diff --git a/espial.cabal b/espial.cabal
index dd0d9c4..6f98500 100644
--- a/espial.cabal
+++ b/espial.cabal
@@ -1,6 +1,6 @@
-cabal-version: 1.12
+cabal-version: 1.12
 
--- This file has been generated from package.yaml by hpack version 0.35.1.
+-- This file has been generated from package.yaml by hpack version 0.36.0.
 --
 -- see: https://github.com/sol/hpack
 
@@ -48,23 +48,43 @@ extra-source-files:
     static/css/tachyons.min.css
     static/css/tachyons.min.css.gz
     static/images/bluepin.gif
-    static/js/app.min.js
-    static/js/app.min.js.gz
-    static/js/app.min.js.map
-    static/js/app.min.js.map.gz
     static/js/js.cookie-2.2.0.min.js
     static/js/js.cookie-2.2.0.min.js.gz
+    static/js/dist/chunk-C2VZJJ3O.js
+    static/js/dist/chunk-C2VZJJ3O.js.gz
+    static/js/dist/chunk-C2VZJJ3O.js.map
+    static/js/dist/chunk-C2VZJJ3O.js.map.gz
+    static/js/dist/chunk-HXAV7WCB.js
+    static/js/dist/chunk-HXAV7WCB.js.gz
+    static/js/dist/chunk-HXAV7WCB.js.map
+    static/js/dist/chunk-HXAV7WCB.js.map.gz
+    static/js/dist/chunk-YZW7HJVL.js
+    static/js/dist/chunk-YZW7HJVL.js.gz
+    static/js/dist/chunk-YZW7HJVL.js.map
+    static/js/dist/chunk-YZW7HJVL.js.map.gz
+    static/js/dist/AccountSettings/index.js
+    static/js/dist/AccountSettings/index.js.gz
+    static/js/dist/AccountSettings/index.js.map
+    static/js/dist/Add/index.js
+    static/js/dist/Add/index.js.gz
+    static/js/dist/Add/index.js.map
+    static/js/dist/Bookmarks/index.js
+    static/js/dist/Bookmarks/index.js.gz
+    static/js/dist/Bookmarks/index.js.map
+    static/js/dist/Logout/index.js
+    static/js/dist/Logout/index.js.gz
+    static/js/dist/Logout/index.js.map
+    static/js/dist/Note/index.js
+    static/js/dist/Note/index.js.gz
+    static/js/dist/Note/index.js.map
     purs/Makefile
     purs/spago.lock
     purs/spago.yaml
-    purs/src/App.purs
-    purs/src/Globals.js
-    purs/src/Globals.purs
-    purs/src/Main.purs
-    purs/src/Marked.js
-    purs/src/Marked.purs
-    purs/src/Model.purs
-    purs/src/Util.purs
+    purs/src/AccountSettings.purs
+    purs/src/Add.purs
+    purs/src/Bookmarks.purs
+    purs/src/Logout.purs
+    purs/src/Note.purs
     purs/src/Component/AccountSettings.purs
     purs/src/Component/Add.purs
     purs/src/Component/BList.purs
diff --git a/package.yaml b/package.yaml
index c82ac31..fd65869 100644
--- a/package.yaml
+++ b/package.yaml
@@ -33,6 +33,8 @@ extra-source-files:
 - static/css/**
 - static/images/**
 - static/js/**
+- static/js/dist/**
+- static/js/dist/**/**
 - purs/Makefile
 - purs/spago.lock
 - purs/spago.yaml
diff --git a/purs/Makefile b/purs/Makefile
index dc73281..971d4fb 100644
--- a/purs/Makefile
+++ b/purs/Makefile
@@ -9,16 +9,8 @@ build:
 	@npm run spago build
 
 bundle: build
-	@npm run esbuild-bundle
-	@npm run esbuild-bundle-min
-	@rm -f dist/*.gz
-	@gzip -k dist/app.min.js.map
-	@gzip -k dist/app.min.js
-	@find dist -type f -printf "%kK\\t%h/%f\\n" | sort -k 2
-	@cp dist/app.min.js ../static/js/app.min.js
-	@cp dist/app.min.js.gz ../static/js/app.min.js.gz
-	@cp dist/app.min.js.map ../static/js/app.min.js.map
-	@cp dist/app.min.js.map.gz ../static/js/app.min.js.map.gz
+	npm run esbuild-bundle-min
+	cp -R dist ../static/js/
 
 docs:
 	@rm -Rf generated-docs
diff --git a/purs/package.json b/purs/package.json
index 471af97..13e68fc 100644
--- a/purs/package.json
+++ b/purs/package.json
@@ -6,8 +6,8 @@
     "purs": "purs",
     "make-install": "make install",
     "make-watch": "inotifywait -m -r -q -e close_write --format '%T %w%f' --timefmt '%T' src | while read FILE; do echo $FILE; make; done",
-    "esbuild-bundle": "esbuild ./output/Main/index.js --bundle --format=esm --target=chrome61,firefox60,edge18 --outfile=dist/app.js",
-    "esbuild-bundle-min": "esbuild ./output/Main/index.js --bundle --format=esm --target=chrome61,firefox60,edge18  --minify --sourcemap --outfile=dist/app.min.js"
+    "esbuild-bundle":     "esbuild ./output/Note/index.js ./output/Add/index.js ./output/Logout/index.js ./output/Bookmarks/index.js ./output/AccountSettings/index.js --bundle --format=esm --target=chrome61,firefox60,edge18 --outdir=dist --splitting",
+    "esbuild-bundle-min": "esbuild ./output/Note/index.js ./output/Add/index.js ./output/Logout/index.js ./output/Bookmarks/index.js ./output/AccountSettings/index.js --bundle --format=esm --target=chrome61,firefox60,edge18 --outdir=dist --splitting --minify --sourcemap"
   },
   "devDependencies": {
     "esbuild": "^0.19.11",
diff --git a/purs/src/AccountSettings.purs b/purs/src/AccountSettings.purs
new file mode 100644
index 0000000..8f5882f
--- /dev/null
+++ b/purs/src/AccountSettings.purs
@@ -0,0 +1,20 @@
+module AccountSettings where
+
+import Prelude
+
+import Component.AccountSettings (usetting)
+import Data.Foldable (traverse_)
+import Effect (Effect)
+import Halogen.Aff as HA
+import Halogen.VDom.Driver (runUI)
+import Model (AccountSettings)
+import Web.DOM.ParentNode (QuerySelector(..))
+import ViewRendered (viewRendered)
+
+
+renderAccountSettings :: String -> AccountSettings -> Effect Unit
+renderAccountSettings renderElSelector accountSettings = do
+  HA.runHalogenAff do
+    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
+      void $ runUI (usetting accountSettings) unit el
+      viewRendered
\ No newline at end of file
diff --git a/purs/src/Add.purs b/purs/src/Add.purs
new file mode 100644
index 0000000..bac987a
--- /dev/null
+++ b/purs/src/Add.purs
@@ -0,0 +1,19 @@
+module Add where
+
+import Prelude
+
+import Component.Add (addbmark)
+import Data.Foldable (traverse_)
+import Effect (Effect)
+import Halogen.Aff as HA
+import Halogen.VDom.Driver (runUI)
+import Model (Bookmark)
+import Web.DOM.ParentNode (QuerySelector(..))
+import ViewRendered (viewRendered)
+
+renderAddForm :: String -> Bookmark -> Effect Unit
+renderAddForm renderElSelector bmark = do
+  HA.runHalogenAff do
+    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
+      void $ runUI (addbmark bmark) unit el
+      viewRendered
\ No newline at end of file
diff --git a/purs/src/Bookmarks.purs b/purs/src/Bookmarks.purs
new file mode 100644
index 0000000..d14f68e
--- /dev/null
+++ b/purs/src/Bookmarks.purs
@@ -0,0 +1,27 @@
+module Bookmarks where
+
+import Prelude
+
+import Component.TagCloud (tagcloudcomponent)
+import Component.BList (blist)
+import Data.Foldable (traverse_)
+import Effect (Effect)
+import Halogen.Aff as HA
+import Halogen.VDom.Driver (runUI)
+import Model (Bookmark, TagCloudMode, tagCloudModeToF)
+import Web.DOM.ParentNode (QuerySelector(..))
+import ViewRendered (viewRendered)
+
+
+renderBookmarks :: String -> Array Bookmark -> Effect Unit
+renderBookmarks renderElSelector bmarks = do
+  HA.runHalogenAff do
+    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
+      void $ runUI (blist bmarks) unit el
+      viewRendered
+
+renderTagCloud :: String -> TagCloudMode -> Effect Unit
+renderTagCloud renderElSelector tagCloudMode = do
+  HA.runHalogenAff do
+    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
+      void $ runUI (tagcloudcomponent (tagCloudModeToF tagCloudMode)) unit el
\ No newline at end of file
diff --git a/purs/src/App.purs b/purs/src/Core/App.purs
similarity index 100%
rename from purs/src/App.purs
rename to purs/src/Core/App.purs
diff --git a/purs/src/Globals.js b/purs/src/Core/Globals.js
similarity index 100%
rename from purs/src/Globals.js
rename to purs/src/Core/Globals.js
diff --git a/purs/src/Globals.purs b/purs/src/Core/Globals.purs
similarity index 100%
rename from purs/src/Globals.purs
rename to purs/src/Core/Globals.purs
diff --git a/purs/src/Marked.js b/purs/src/Core/Marked.js
similarity index 100%
rename from purs/src/Marked.js
rename to purs/src/Core/Marked.js
diff --git a/purs/src/Marked.purs b/purs/src/Core/Marked.purs
similarity index 100%
rename from purs/src/Marked.purs
rename to purs/src/Core/Marked.purs
diff --git a/purs/src/Model.purs b/purs/src/Core/Model.purs
similarity index 100%
rename from purs/src/Model.purs
rename to purs/src/Core/Model.purs
diff --git a/purs/src/Util.purs b/purs/src/Core/Util.purs
similarity index 100%
rename from purs/src/Util.purs
rename to purs/src/Core/Util.purs
diff --git a/purs/src/Core/ViewRendered.purs b/purs/src/Core/ViewRendered.purs
new file mode 100644
index 0000000..00a3788
--- /dev/null
+++ b/purs/src/Core/ViewRendered.purs
@@ -0,0 +1,15 @@
+module ViewRendered where
+
+import Prelude
+
+import Data.Foldable (traverse_)
+import Effect.Aff (Aff)
+import Effect.Class (liftEffect)
+import Halogen.Aff as HA
+import Web.DOM.Element (setAttribute)
+import Web.DOM.ParentNode (QuerySelector(..))
+import Web.HTML.HTMLElement (toElement)
+
+viewRendered :: Aff Unit
+viewRendered = HA.selectElement (QuerySelector "#content") >>= traverse_ \el ->
+  liftEffect $ setAttribute "view-rendered" "" (toElement el) 
diff --git a/purs/src/Logout.purs b/purs/src/Logout.purs
new file mode 100644
index 0000000..24b0a80
--- /dev/null
+++ b/purs/src/Logout.purs
@@ -0,0 +1,11 @@
+module Logout where
+
+import Prelude
+
+import App (logout)
+import Effect (Effect)
+import Effect.Aff (launchAff)
+import Web.Event.Event (Event, preventDefault)
+
+logoutE :: Event -> Effect Unit
+logoutE e = void <<< launchAff <<< logout =<< preventDefault e
\ No newline at end of file
diff --git a/purs/src/Main.purs b/purs/src/Main.purs
deleted file mode 100644
index 42139bf..0000000
--- a/purs/src/Main.purs
+++ /dev/null
@@ -1,70 +0,0 @@
-module Main where
-
-import Prelude
-
-import App (logout)
-import Component.AccountSettings (usetting)
-import Component.Add (addbmark)
-import Component.BList (blist)
-import Component.NList (nlist)
-import Component.NNote (nnote)
-import Component.TagCloud (tagcloudcomponent)
-import Data.Foldable (traverse_)
-import Effect (Effect)
-import Effect.Aff (Aff, launchAff)
-import Effect.Class (liftEffect)
-import Halogen.Aff as HA
-import Halogen.VDom.Driver (runUI)
-import Model (AccountSettings, Bookmark, Note, TagCloudMode, tagCloudModeToF)
-import Web.DOM.Element (setAttribute)
-import Web.DOM.ParentNode (QuerySelector(..))
-import Web.Event.Event (Event, preventDefault)
-import Web.HTML.HTMLElement (toElement)
-
-logoutE :: Event -> Effect Unit
-logoutE e = void <<< launchAff <<< logout =<< preventDefault e
-
-renderBookmarks :: String -> Array Bookmark -> Effect Unit
-renderBookmarks renderElSelector bmarks = do
-  HA.runHalogenAff do
-    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
-      void $ runUI (blist bmarks) unit el
-      viewRendered
-
-renderTagCloud :: String -> TagCloudMode -> Effect Unit
-renderTagCloud renderElSelector tagCloudMode = do
-  HA.runHalogenAff do
-    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
-      void $ runUI (tagcloudcomponent (tagCloudModeToF tagCloudMode)) unit el
-
-renderAddForm :: String -> Bookmark -> Effect Unit
-renderAddForm renderElSelector bmark = do
-  HA.runHalogenAff do
-    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
-      void $ runUI (addbmark bmark) unit el
-      viewRendered
-
-renderNotes :: String -> Array Note -> Effect Unit
-renderNotes renderElSelector notes = do
-  HA.runHalogenAff do
-    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
-      void $ runUI (nlist notes) unit el
-      viewRendered
-
-renderNote :: String -> Note -> Effect Unit
-renderNote renderElSelector note = do
-  HA.runHalogenAff do
-    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
-      void $ runUI (nnote note) unit el
-      viewRendered
-
-renderAccountSettings :: String -> AccountSettings -> Effect Unit
-renderAccountSettings renderElSelector accountSettings = do
-  HA.runHalogenAff do
-    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
-      void $ runUI (usetting accountSettings) unit el
-      viewRendered
-
-viewRendered :: Aff Unit
-viewRendered = HA.selectElement (QuerySelector "#content") >>= traverse_ \el ->
-  liftEffect $ setAttribute "view-rendered" "" (toElement el) 
diff --git a/purs/src/Note.purs b/purs/src/Note.purs
new file mode 100644
index 0000000..72fa6aa
--- /dev/null
+++ b/purs/src/Note.purs
@@ -0,0 +1,27 @@
+module Note where
+
+import Prelude
+
+import Component.NList (nlist)
+import Component.NNote (nnote)
+import Data.Foldable (traverse_)
+import Effect (Effect)
+import Halogen.Aff as HA
+import Halogen.VDom.Driver (runUI)
+import Model (Note)
+import Web.DOM.ParentNode (QuerySelector(..))
+import ViewRendered (viewRendered)
+
+renderNotes :: String -> Array Note -> Effect Unit
+renderNotes renderElSelector notes = do
+  HA.runHalogenAff do
+    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
+      void $ runUI (nlist notes) unit el
+      viewRendered
+
+renderNote :: String -> Note -> Effect Unit
+renderNote renderElSelector note = do
+  HA.runHalogenAff do
+    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \el -> do
+      void $ runUI (nnote note) unit el
+      viewRendered
\ No newline at end of file
diff --git a/src/Handler/AccountSettings.hs b/src/Handler/AccountSettings.hs
index 466c9d5..3bd640f 100644
--- a/src/Handler/AccountSettings.hs
+++ b/src/Handler/AccountSettings.hs
@@ -16,7 +16,7 @@ getAccountSettingsR = do
     |]
     toWidget [hamlet|
       <script type="module">
-        import { renderAccountSettings } from '@{StaticR js_app_min_js}'
+        import { renderAccountSettings } from '@{StaticR js_dist_AccountSettings_index_js}'
         renderAccountSettings('##{accountSettingsEl}')(app.dat.accountSettings)();
     |]
 
diff --git a/src/Handler/Add.hs b/src/Handler/Add.hs
index f31f130..55347ba 100644
--- a/src/Handler/Add.hs
+++ b/src/Handler/Add.hs
@@ -27,7 +27,7 @@ getAddViewR = do
     |]
     toWidget [hamlet|
       <script type="module">
-        import { renderAddForm } from '@{StaticR js_app_min_js}'
+        import { renderAddForm } from '@{StaticR js_dist_Add_index_js}'
         renderAddForm('##{renderEl}')(app.dat.bmark)();
     |]
 
diff --git a/src/Handler/Notes.hs b/src/Handler/Notes.hs
index e868bda..00edad3 100644
--- a/src/Handler/Notes.hs
+++ b/src/Handler/Notes.hs
@@ -41,7 +41,7 @@ getNotesR unamep@(UserNameP uname) = do
     |]
     toWidget [hamlet|
       <script type="module">
-        import { renderNotes } from '@{StaticR js_app_min_js}'
+        import { renderNotes } from '@{StaticR js_dist_Note_index_js}'
         renderNotes('##{renderEl}')(app.dat.notes)();
     |]
 
@@ -67,7 +67,7 @@ getNoteR unamep@(UserNameP uname) slug = do
     |]
     toWidget [hamlet|
       <script type="module">
-        import { renderNote } from '@{StaticR js_app_min_js}'
+        import { renderNote } from '@{StaticR js_dist_Note_index_js}'
         renderNote('##{renderEl}')(app.dat.note)();
     |]
 
@@ -91,7 +91,7 @@ getAddNoteViewR unamep@(UserNameP uname) = do
     |]
     toWidget [hamlet|
       <script type="module">
-        import { renderNote } from '@{StaticR js_app_min_js}'
+        import { renderNote } from '@{StaticR js_dist_Note_index_js}'
         renderNote('##{renderEl}')(app.dat.note)();
     |]
 
diff --git a/src/Handler/User.hs b/src/Handler/User.hs
index 7a1f0ec..92875d0 100644
--- a/src/Handler/User.hs
+++ b/src/Handler/User.hs
@@ -64,7 +64,7 @@ _getUser unamep@(UserNameP uname) sharedp' filterp' (TagsP pathtags) = do
     |]
     toWidget [hamlet|
       <script type="module">
-        import { renderBookmarks, renderTagCloud } from '@{StaticR js_app_min_js}'
+        import { renderBookmarks, renderTagCloud } from '@{StaticR js_dist_Bookmarks_index_js}'
         setTimeout(() => {
           renderBookmarks('##{renderEl}')(app.dat.bmarks)();
         }, 0);
diff --git a/static/js/app.min.js b/static/js/app.min.js
deleted file mode 100644
index 08bbf22..0000000
--- a/static/js/app.min.js
+++ /dev/null
@@ -1,66 +0,0 @@
-var EI=Object.create;var Md=Object.defineProperty,CI=Object.defineProperties,FI=Object.getOwnPropertyDescriptor,wI=Object.getOwnPropertyDescriptors,xI=Object.getOwnPropertyNames,uy=Object.getOwnPropertySymbols,LI=Object.getPrototypeOf,iy=Object.prototype.hasOwnProperty,HI=Object.prototype.propertyIsEnumerable;var bd=(n,e,t)=>e in n?Md(n,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):n[e]=t,yr=(n,e)=>{for(var t in e||(e={}))iy.call(e,t)&&bd(n,t,e[t]);if(uy)for(var t of uy(e))HI.call(e,t)&&bd(n,t,e[t]);return n},yf=(n,e)=>CI(n,wI(e));var fy=(n=>typeof require<"u"?require:typeof Proxy<"u"?new Proxy(n,{get:(e,t)=>(typeof require<"u"?require:e)[t]}):n)(function(n){if(typeof require<"u")return require.apply(this,arguments);throw Error('Dynamic require of "'+n+'" is not supported')});var cy=(n,e)=>()=>(e||n((e={exports:{}}).exports,e),e.exports);var II=(n,e,t,a)=>{if(e&&typeof e=="object"||typeof e=="function")for(let u of xI(e))!iy.call(n,u)&&u!==t&&Md(n,u,{get:()=>e[u],enumerable:!(a=FI(e,u))||a.enumerable});return n};var ly=(n,e,t)=>(t=n!=null?EI(LI(n)):{},II(e||!n||!n.__esModule?Md(t,"default",{value:n,enumerable:!0}):t,n));var Ue=(n,e,t)=>(bd(n,typeof e!="symbol"?e+"":e,t),t),SI=(n,e,t)=>{if(!e.has(n))throw TypeError("Cannot "+t)};var Ed=(n,e,t)=>{if(e.has(n))throw TypeError("Cannot add the same private member more than once");e instanceof WeakSet?e.add(n):e.set(n,t)};var mp=(n,e,t)=>(SI(n,e,"access private method"),t);var tE=cy((cg,uc)=>{(function(n,e){typeof cg=="object"&&typeof uc<"u"?uc.exports=e():typeof define=="function"&&define.amd?define(e):n.moment=e()})(cg,function(){"use strict";var n;function e(){return n.apply(null,arguments)}function t(r){n=r}function a(r){return r instanceof Array||Object.prototype.toString.call(r)==="[object Array]"}function u(r){return r!=null&&Object.prototype.toString.call(r)==="[object Object]"}function i(r,o){return Object.prototype.hasOwnProperty.call(r,o)}function f(r){if(Object.getOwnPropertyNames)return Object.getOwnPropertyNames(r).length===0;var o;for(o in r)if(i(r,o))return!1;return!0}function l(r){return r===void 0}function p(r){return typeof r=="number"||Object.prototype.toString.call(r)==="[object Number]"}function d(r){return r instanceof Date||Object.prototype.toString.call(r)==="[object Date]"}function m(r,o){var c=[],s,_=r.length;for(s=0;s<_;++s)c.push(o(r[s],s));return c}function v(r,o){for(var c in o)i(o,c)&&(r[c]=o[c]);return i(o,"toString")&&(r.toString=o.toString),i(o,"valueOf")&&(r.valueOf=o.valueOf),r}function g(r,o,c,s){return Ph(r,o,c,s,!0).utc()}function h(){return{empty:!1,unusedTokens:[],unusedInput:[],overflow:-2,charsLeftOver:0,nullInput:!1,invalidEra:null,invalidMonth:null,invalidFormat:!1,userInvalidated:!1,iso:!1,parsedDateParts:[],era:null,meridiem:null,rfc2822:!1,weekdayMismatch:!1}}function E(r){return r._pf==null&&(r._pf=h()),r._pf}var F;Array.prototype.some?F=Array.prototype.some:F=function(r){var o=Object(this),c=o.length>>>0,s;for(s=0;s<c;s++)if(s in o&&r.call(this,o[s],s,o))return!0;return!1};function W(r){var o=null,c=!1,s=r._d&&!isNaN(r._d.getTime());if(s&&(o=E(r),c=F.call(o.parsedDateParts,function(_){return _!=null}),s=o.overflow<0&&!o.empty&&!o.invalidEra&&!o.invalidMonth&&!o.invalidWeekday&&!o.weekdayMismatch&&!o.nullInput&&!o.invalidFormat&&!o.userInvalidated&&(!o.meridiem||o.meridiem&&c),r._strict&&(s=s&&o.charsLeftOver===0&&o.unusedTokens.length===0&&o.bigHour===void 0)),Object.isFrozen==null||!Object.isFrozen(r))r._isValid=s;else return s;return r._isValid}function sn(r){var o=g(NaN);return r!=null?v(E(o),r):E(o).userInvalidated=!0,o}var wn=e.momentProperties=[],Rn=!1;function En(r,o){var c,s,_,D=wn.length;if(l(o._isAMomentObject)||(r._isAMomentObject=o._isAMomentObject),l(o._i)||(r._i=o._i),l(o._f)||(r._f=o._f),l(o._l)||(r._l=o._l),l(o._strict)||(r._strict=o._strict),l(o._tzm)||(r._tzm=o._tzm),l(o._isUTC)||(r._isUTC=o._isUTC),l(o._offset)||(r._offset=o._offset),l(o._pf)||(r._pf=E(o)),l(o._locale)||(r._locale=o._locale),D>0)for(c=0;c<D;c++)s=wn[c],_=o[s],l(_)||(r[s]=_);return r}function U(r){En(this,r),this._d=new Date(r._d!=null?r._d.getTime():NaN),this.isValid()||(this._d=new Date(NaN)),Rn===!1&&(Rn=!0,e.updateOffset(this),Rn=!1)}function re(r){return r instanceof U||r!=null&&r._isAMomentObject!=null}function An(r){e.suppressDeprecationWarnings===!1&&typeof console<"u"&&console.warn&&console.warn("Deprecation warning: "+r)}function wt(r,o){var c=!0;return v(function(){if(e.deprecationHandler!=null&&e.deprecationHandler(null,r),c){var s=[],_,D,C,j=arguments.length;for(D=0;D<j;D++){if(_="",typeof arguments[D]=="object"){_+=`
-[`+D+"] ";for(C in arguments[0])i(arguments[0],C)&&(_+=C+": "+arguments[0][C]+", ");_=_.slice(0,-2)}else _=arguments[D];s.push(_)}An(r+`
-Arguments: `+Array.prototype.slice.call(s).join("")+`
-`+new Error().stack),c=!1}return o.apply(this,arguments)},o)}var vr={};function Ta(r,o){e.deprecationHandler!=null&&e.deprecationHandler(r,o),vr[r]||(An(o),vr[r]=!0)}e.suppressDeprecationWarnings=!1,e.deprecationHandler=null;function xt(r){return typeof Function<"u"&&r instanceof Function||Object.prototype.toString.call(r)==="[object Function]"}function ti(r){var o,c;for(c in r)i(r,c)&&(o=r[c],xt(o)?this[c]=o:this["_"+c]=o);this._config=r,this._dayOfMonthOrdinalParseLenient=new RegExp((this._dayOfMonthOrdinalParse.source||this._ordinalParse.source)+"|"+/\d{1,2}/.source)}function gr(r,o){var c=v({},r),s;for(s in o)i(o,s)&&(u(r[s])&&u(o[s])?(c[s]={},v(c[s],r[s]),v(c[s],o[s])):o[s]!=null?c[s]=o[s]:delete c[s]);for(s in r)i(r,s)&&!i(o,s)&&u(r[s])&&(c[s]=v({},c[s]));return c}function mt(r){r!=null&&this.set(r)}var na;Object.keys?na=Object.keys:na=function(r){var o,c=[];for(o in r)i(r,o)&&c.push(o);return c};var ou={sameDay:"[Today at] LT",nextDay:"[Tomorrow at] LT",nextWeek:"dddd [at] LT",lastDay:"[Yesterday at] LT",lastWeek:"[Last] dddd [at] LT",sameElse:"L"};function Mo(r,o,c){var s=this._calendar[r]||this._calendar.sameElse;return xt(s)?s.call(o,c):s}function Le(r,o,c){var s=""+Math.abs(r),_=o-s.length,D=r>=0;return(D?c?"+":"":"-")+Math.pow(10,Math.max(0,_)).toString().substr(1)+s}var Ar=/(\[[^\[]*\])|(\\)?([Hh]mm(ss)?|Mo|MM?M?M?|Do|DDDo|DD?D?D?|ddd?d?|do?|w[o|w]?|W[o|W]?|Qo?|N{1,5}|YYYYYY|YYYYY|YYYY|YY|y{2,4}|yo?|gg(ggg?)?|GG(GGG?)?|e|E|a|A|hh?|HH?|kk?|mm?|ss?|S{1,9}|x|X|zz?|ZZ?|.)/g,ba=/(\[[^\[]*\])|(\\)?(LTS|LT|LL?L?L?|l{1,4})/g,Ja={},Qa={};function w(r,o,c,s){var _=s;typeof s=="string"&&(_=function(){return this[s]()}),r&&(Qa[r]=_),o&&(Qa[o[0]]=function(){return Le(_.apply(this,arguments),o[1],o[2])}),c&&(Qa[c]=function(){return this.localeData().ordinal(_.apply(this,arguments),r)})}function Qn(r){return r.match(/\[[\s\S]/)?r.replace(/^\[|\]$/g,""):r.replace(/\\/g,"")}function He(r){var o=r.match(Ar),c,s;for(c=0,s=o.length;c<s;c++)Qa[o[c]]?o[c]=Qa[o[c]]:o[c]=Qn(o[c]);return function(_){var D="",C;for(C=0;C<s;C++)D+=xt(o[C])?o[C].call(_,r):o[C];return D}}function jn(r,o){return r.isValid()?(o=on(o,r.localeData()),Ja[o]=Ja[o]||He(o),Ja[o](r)):r.localeData().invalidDate()}function on(r,o){var c=5;function s(_){return o.longDateFormat(_)||_}for(ba.lastIndex=0;c>=0&&ba.test(r);)r=r.replace(ba,s),ba.lastIndex=0,c-=1;return r}var k={LTS:"h:mm:ss A",LT:"h:mm A",L:"MM/DD/YYYY",LL:"MMMM D, YYYY",LLL:"MMMM D, YYYY h:mm A",LLLL:"dddd, MMMM D, YYYY h:mm A"};function ne(r){var o=this._longDateFormat[r],c=this._longDateFormat[r.toUpperCase()];return o||!c?o:(this._longDateFormat[r]=c.match(Ar).map(function(s){return s==="MMMM"||s==="MM"||s==="DD"||s==="dddd"?s.slice(1):s}).join(""),this._longDateFormat[r])}var Pn="Invalid date";function ge(){return this._invalidDate}var at="%d",ce=/\d{1,2}/;function Ie(r){return this._ordinal.replace("%d",r)}var Ma={future:"in %s",past:"%s ago",s:"a few seconds",ss:"%d seconds",m:"a minute",mm:"%d minutes",h:"an hour",hh:"%d hours",d:"a day",dd:"%d days",w:"a week",ww:"%d weeks",M:"a month",MM:"%d months",y:"a year",yy:"%d years"};function Ln(r,o,c,s){var _=this._relativeTime[c];return xt(_)?_(r,o,c,s):_.replace(/%d/i,r)}function G(r,o){var c=this._relativeTime[r>0?"future":"past"];return xt(c)?c(o):c.replace(/%s/i,o)}var $n={D:"date",dates:"date",date:"date",d:"day",days:"day",day:"day",e:"weekday",weekdays:"weekday",weekday:"weekday",E:"isoWeekday",isoweekdays:"isoWeekday",isoweekday:"isoWeekday",DDD:"dayOfYear",dayofyears:"dayOfYear",dayofyear:"dayOfYear",h:"hour",hours:"hour",hour:"hour",ms:"millisecond",milliseconds:"millisecond",millisecond:"millisecond",m:"minute",minutes:"minute",minute:"minute",M:"month",months:"month",month:"month",Q:"quarter",quarters:"quarter",quarter:"quarter",s:"second",seconds:"second",second:"second",gg:"weekYear",weekyears:"weekYear",weekyear:"weekYear",GG:"isoWeekYear",isoweekyears:"isoWeekYear",isoweekyear:"isoWeekYear",w:"week",weeks:"week",week:"week",W:"isoWeek",isoweeks:"isoWeek",isoweek:"isoWeek",y:"year",years:"year",year:"year"};function q(r){return typeof r=="string"?$n[r]||$n[r.toLowerCase()]:void 0}function B(r){var o={},c,s;for(s in r)i(r,s)&&(c=q(s),c&&(o[c]=r[s]));return o}var Cn={date:9,day:11,weekday:11,isoWeekday:11,dayOfYear:4,hour:13,millisecond:16,minute:14,month:8,quarter:7,second:15,weekYear:1,isoWeekYear:1,week:5,isoWeek:5,year:1};function rn(r){var o=[],c;for(c in r)i(r,c)&&o.push({unit:c,priority:Cn[c]});return o.sort(function(s,_){return s.priority-_.priority}),o}var un=/\d/,yn=/\d\d/,Bn=/\d{3}/,De=/\d{4}/,Ve=/[+-]?\d{6}/,le=/\d\d?/,Eo=/\d\d\d\d?/,ri=/\d\d\d\d\d\d?/,cf=/\d{1,3}/,$c=/\d{1,4}/,lf=/[+-]?\d{1,6}/,ja=/\d+/,dt=/[+-]?\d+/,ai=/Z|[+-]\d\d:?\d\d/gi,uu=/Z|[+-]\d\d(?::?\d\d)?/gi,nd=/[+-]?\d+(\.\d{1,3})?/,oi=/[0-9]{0,256}['a-z\u00A0-\u05FF\u0700-\uD7FF\uF900-\uFDCF\uFDF0-\uFF07\uFF10-\uFFEF]{1,256}|[\u0600-\u06FF\/]{1,256}(\s*?[\u0600-\u06FF]{1,256}){1,2}/i,iu=/^[1-9]\d?/,qc=/^([1-9]\d|\d)/,ir;ir={};function V(r,o,c){ir[r]=xt(o)?o:function(s,_){return s&&c?c:o}}function Bc(r,o){return i(ir,r)?ir[r](o._strict,o._locale):new RegExp(Vc(r))}function Vc(r){return Ea(r.replace("\\","").replace(/\\(\[)|\\(\])|\[([^\]\[]*)\]|\\(.)/g,function(o,c,s,_,D){return c||s||_||D}))}function Ea(r){return r.replace(/[-\/\\^$*+?.()|[\]{}]/g,"\\$&")}function Dr(r){return r<0?Math.ceil(r)||0:Math.floor(r)}function zn(r){var o=+r,c=0;return o!==0&&isFinite(o)&&(c=Dr(o)),c}var sf={};function pe(r,o){var c,s=o,_;for(typeof r=="string"&&(r=[r]),p(o)&&(s=function(D,C){C[o]=zn(D)}),_=r.length,c=0;c<_;c++)sf[r[c]]=s}function Je(r,o){pe(r,function(c,s,_,D){_._w=_._w||{},o(c,_._w,_,D)})}function ks(r,o,c){o!=null&&i(sf,r)&&sf[r](o,c._a,c,r)}function Ke(r){return r%4===0&&r%100!==0||r%400===0}var Dt=0,_e=1,Gt=2,Ze=3,hr=4,Nr=5,za=6,$s=7,fu=8;w("Y",0,0,function(){var r=this.year();return r<=9999?Le(r,4):"+"+r}),w(0,["YY",2],0,function(){return this.year()%100}),w(0,["YYYY",4],0,"year"),w(0,["YYYYY",5],0,"year"),w(0,["YYYYYY",6,!0],0,"year"),V("Y",dt),V("YY",le,yn),V("YYYY",$c,De),V("YYYYY",lf,Ve),V("YYYYYY",lf,Ve),pe(["YYYYY","YYYYYY"],Dt),pe("YYYY",function(r,o){o[Dt]=r.length===2?e.parseTwoDigitYear(r):zn(r)}),pe("YY",function(r,o){o[Dt]=e.parseTwoDigitYear(r)}),pe("Y",function(r,o){o[Dt]=parseInt(r,10)});function Rr(r){return Ke(r)?366:365}e.parseTwoDigitYear=function(r){return zn(r)+(zn(r)>68?1900:2e3)};var pf=Or("FullYear",!0);function Jc(){return Ke(this.year())}function Or(r,o){return function(c){return c!=null?(ui(this,r,c),e.updateOffset(this,o),this):Ga(this,r)}}function Ga(r,o){if(!r.isValid())return NaN;var c=r._d,s=r._isUTC;switch(o){case"Milliseconds":return s?c.getUTCMilliseconds():c.getMilliseconds();case"Seconds":return s?c.getUTCSeconds():c.getSeconds();case"Minutes":return s?c.getUTCMinutes():c.getMinutes();case"Hours":return s?c.getUTCHours():c.getHours();case"Date":return s?c.getUTCDate():c.getDate();case"Day":return s?c.getUTCDay():c.getDay();case"Month":return s?c.getUTCMonth():c.getMonth();case"FullYear":return s?c.getUTCFullYear():c.getFullYear();default:return NaN}}function ui(r,o,c){var s,_,D,C,j;if(!(!r.isValid()||isNaN(c))){switch(s=r._d,_=r._isUTC,o){case"Milliseconds":return void(_?s.setUTCMilliseconds(c):s.setMilliseconds(c));case"Seconds":return void(_?s.setUTCSeconds(c):s.setSeconds(c));case"Minutes":return void(_?s.setUTCMinutes(c):s.setMinutes(c));case"Hours":return void(_?s.setUTCHours(c):s.setHours(c));case"Date":return void(_?s.setUTCDate(c):s.setDate(c));case"FullYear":break;default:return}D=c,C=r.month(),j=r.date(),j=j===29&&C===1&&!Ke(D)?28:j,_?s.setUTCFullYear(D,C,j):s.setFullYear(D,C,j)}}function qs(r){return r=q(r),xt(this[r])?this[r]():this}function Bs(r,o){if(typeof r=="object"){r=B(r);var c=rn(r),s,_=c.length;for(s=0;s<_;s++)this[c[s].unit](r[c[s].unit])}else if(r=q(r),xt(this[r]))return this[r](o);return this}function ed(r,o){return(r%o+o)%o}var Pe;Array.prototype.indexOf?Pe=Array.prototype.indexOf:Pe=function(r){var o;for(o=0;o<this.length;++o)if(this[o]===r)return o;return-1};function Co(r,o){if(isNaN(r)||isNaN(o))return NaN;var c=ed(o,12);return r+=(o-c)/12,c===1?Ke(r)?29:28:31-c%7%2}w("M",["MM",2],"Mo",function(){return this.month()+1}),w("MMM",0,0,function(r){return this.localeData().monthsShort(this,r)}),w("MMMM",0,0,function(r){return this.localeData().months(this,r)}),V("M",le,iu),V("MM",le,yn),V("MMM",function(r,o){return o.monthsShortRegex(r)}),V("MMMM",function(r,o){return o.monthsRegex(r)}),pe(["M","MM"],function(r,o){o[_e]=zn(r)-1}),pe(["MMM","MMMM"],function(r,o,c,s){var _=c._locale.monthsParse(r,s,c._strict);_!=null?o[_e]=_:E(c).invalidMonth=r});var cu="January_February_March_April_May_June_July_August_September_October_November_December".split("_"),Fo="Jan_Feb_Mar_Apr_May_Jun_Jul_Aug_Sep_Oct_Nov_Dec".split("_"),Qc=/D[oD]?(\[[^\[\]]*\]|\s)+MMMM?/,Vs=oi,Js=oi;function jc(r,o){return r?a(this._months)?this._months[r.month()]:this._months[(this._months.isFormat||Qc).test(o)?"format":"standalone"][r.month()]:a(this._months)?this._months:this._months.standalone}function Qs(r,o){return r?a(this._monthsShort)?this._monthsShort[r.month()]:this._monthsShort[Qc.test(o)?"format":"standalone"][r.month()]:a(this._monthsShort)?this._monthsShort:this._monthsShort.standalone}function _f(r,o,c){var s,_,D,C=r.toLocaleLowerCase();if(!this._monthsParse)for(this._monthsParse=[],this._longMonthsParse=[],this._shortMonthsParse=[],s=0;s<12;++s)D=g([2e3,s]),this._shortMonthsParse[s]=this.monthsShort(D,"").toLocaleLowerCase(),this._longMonthsParse[s]=this.months(D,"").toLocaleLowerCase();return c?o==="MMM"?(_=Pe.call(this._shortMonthsParse,C),_!==-1?_:null):(_=Pe.call(this._longMonthsParse,C),_!==-1?_:null):o==="MMM"?(_=Pe.call(this._shortMonthsParse,C),_!==-1?_:(_=Pe.call(this._longMonthsParse,C),_!==-1?_:null)):(_=Pe.call(this._longMonthsParse,C),_!==-1?_:(_=Pe.call(this._shortMonthsParse,C),_!==-1?_:null))}function mf(r,o,c){var s,_,D;if(this._monthsParseExact)return _f.call(this,r,o,c);for(this._monthsParse||(this._monthsParse=[],this._longMonthsParse=[],this._shortMonthsParse=[]),s=0;s<12;s++){if(_=g([2e3,s]),c&&!this._longMonthsParse[s]&&(this._longMonthsParse[s]=new RegExp("^"+this.months(_,"").replace(".","")+"$","i"),this._shortMonthsParse[s]=new RegExp("^"+this.monthsShort(_,"").replace(".","")+"$","i")),!c&&!this._monthsParse[s]&&(D="^"+this.months(_,"")+"|^"+this.monthsShort(_,""),this._monthsParse[s]=new RegExp(D.replace(".",""),"i")),c&&o==="MMMM"&&this._longMonthsParse[s].test(r))return s;if(c&&o==="MMM"&&this._shortMonthsParse[s].test(r))return s;if(!c&&this._monthsParse[s].test(r))return s}}function ea(r,o){if(!r.isValid())return r;if(typeof o=="string"){if(/^\d+$/.test(o))o=zn(o);else if(o=r.localeData().monthsParse(o),!p(o))return r}var c=o,s=r.date();return s=s<29?s:Math.min(s,Co(r.year(),c)),r._isUTC?r._d.setUTCMonth(c,s):r._d.setMonth(c,s),r}function wo(r){return r!=null?(ea(this,r),e.updateOffset(this,!0),this):Ga(this,"Month")}function zc(){return Co(this.year(),this.month())}function Gc(r){return this._monthsParseExact?(i(this,"_monthsRegex")||lu.call(this),r?this._monthsShortStrictRegex:this._monthsShortRegex):(i(this,"_monthsShortRegex")||(this._monthsShortRegex=Vs),this._monthsShortStrictRegex&&r?this._monthsShortStrictRegex:this._monthsShortRegex)}function td(r){return this._monthsParseExact?(i(this,"_monthsRegex")||lu.call(this),r?this._monthsStrictRegex:this._monthsRegex):(i(this,"_monthsRegex")||(this._monthsRegex=Js),this._monthsStrictRegex&&r?this._monthsStrictRegex:this._monthsRegex)}function lu(){function r(Wn,ae){return ae.length-Wn.length}var o=[],c=[],s=[],_,D,C,j;for(_=0;_<12;_++)D=g([2e3,_]),C=Ea(this.monthsShort(D,"")),j=Ea(this.months(D,"")),o.push(C),c.push(j),s.push(j),s.push(C);o.sort(r),c.sort(r),s.sort(r),this._monthsRegex=new RegExp("^("+s.join("|")+")","i"),this._monthsShortRegex=this._monthsRegex,this._monthsStrictRegex=new RegExp("^("+c.join("|")+")","i"),this._monthsShortStrictRegex=new RegExp("^("+o.join("|")+")","i")}function rd(r,o,c,s,_,D,C){var j;return r<100&&r>=0?(j=new Date(r+400,o,c,s,_,D,C),isFinite(j.getFullYear())&&j.setFullYear(r)):j=new Date(r,o,c,s,_,D,C),j}function ii(r){var o,c;return r<100&&r>=0?(c=Array.prototype.slice.call(arguments),c[0]=r+400,o=new Date(Date.UTC.apply(null,c)),isFinite(o.getUTCFullYear())&&o.setUTCFullYear(r)):o=new Date(Date.UTC.apply(null,arguments)),o}function Xe(r,o,c){var s=7+o-c,_=(7+ii(r,0,s).getUTCDay()-o)%7;return-_+s-1}function xo(r,o,c,s,_){var D=(7+c-s)%7,C=Xe(r,s,_),j=1+7*(o-1)+D+C,Wn,ae;return j<=0?(Wn=r-1,ae=Rr(Wn)+j):j>Rr(r)?(Wn=r+1,ae=j-Rr(r)):(Wn=r,ae=j),{year:Wn,dayOfYear:ae}}function fi(r,o,c){var s=Xe(r.year(),o,c),_=Math.floor((r.dayOfYear()-s-1)/7)+1,D,C;return _<1?(C=r.year()-1,D=_+ta(C,o,c)):_>ta(r.year(),o,c)?(D=_-ta(r.year(),o,c),C=r.year()+1):(C=r.year(),D=_),{week:D,year:C}}function ta(r,o,c){var s=Xe(r,o,c),_=Xe(r+1,o,c);return(Rr(r)-s+_)/7}w("w",["ww",2],"wo","week"),w("W",["WW",2],"Wo","isoWeek"),V("w",le,iu),V("ww",le,yn),V("W",le,iu),V("WW",le,yn),Je(["w","ww","W","WW"],function(r,o,c,s){o[s.substr(0,1)]=zn(r)});function Yc(r){return fi(r,this._week.dow,this._week.doy).week}var js={dow:0,doy:6};function zs(){return this._week.dow}function ad(){return this._week.doy}function Gs(r){var o=this.localeData().week(this);return r==null?o:this.add((r-o)*7,"d")}function Ys(r){var o=fi(this,1,4).week;return r==null?o:this.add((r-o)*7,"d")}w("d",0,"do","day"),w("dd",0,0,function(r){return this.localeData().weekdaysMin(this,r)}),w("ddd",0,0,function(r){return this.localeData().weekdaysShort(this,r)}),w("dddd",0,0,function(r){return this.localeData().weekdays(this,r)}),w("e",0,0,"weekday"),w("E",0,0,"isoWeekday"),V("d",le),V("e",le),V("E",le),V("dd",function(r,o){return o.weekdaysMinRegex(r)}),V("ddd",function(r,o){return o.weekdaysShortRegex(r)}),V("dddd",function(r,o){return o.weekdaysRegex(r)}),Je(["dd","ddd","dddd"],function(r,o,c,s){var _=c._locale.weekdaysParse(r,s,c._strict);_!=null?o.d=_:E(c).invalidWeekday=r}),Je(["d","e","E"],function(r,o,c,s){o[s]=zn(r)});function od(r,o){return typeof r!="string"?r:isNaN(r)?(r=o.weekdaysParse(r),typeof r=="number"?r:null):parseInt(r,10)}function Lo(r,o){return typeof r=="string"?o.weekdaysParse(r)%7||7:isNaN(r)?null:r}function ci(r,o){return r.slice(o,7).concat(r.slice(0,o))}var Ks="Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"),Kc="Sun_Mon_Tue_Wed_Thu_Fri_Sat".split("_"),ud="Su_Mo_Tu_We_Th_Fr_Sa".split("_"),Zs=oi,Ca=oi,Xs=oi;function np(r,o){var c=a(this._weekdays)?this._weekdays:this._weekdays[r&&r!==!0&&this._weekdays.isFormat.test(o)?"format":"standalone"];return r===!0?ci(c,this._week.dow):r?c[r.day()]:c}function ep(r){return r===!0?ci(this._weekdaysShort,this._week.dow):r?this._weekdaysShort[r.day()]:this._weekdaysShort}function tp(r){return r===!0?ci(this._weekdaysMin,this._week.dow):r?this._weekdaysMin[r.day()]:this._weekdaysMin}function id(r,o,c){var s,_,D,C=r.toLocaleLowerCase();if(!this._weekdaysParse)for(this._weekdaysParse=[],this._shortWeekdaysParse=[],this._minWeekdaysParse=[],s=0;s<7;++s)D=g([2e3,1]).day(s),this._minWeekdaysParse[s]=this.weekdaysMin(D,"").toLocaleLowerCase(),this._shortWeekdaysParse[s]=this.weekdaysShort(D,"").toLocaleLowerCase(),this._weekdaysParse[s]=this.weekdays(D,"").toLocaleLowerCase();return c?o==="dddd"?(_=Pe.call(this._weekdaysParse,C),_!==-1?_:null):o==="ddd"?(_=Pe.call(this._shortWeekdaysParse,C),_!==-1?_:null):(_=Pe.call(this._minWeekdaysParse,C),_!==-1?_:null):o==="dddd"?(_=Pe.call(this._weekdaysParse,C),_!==-1||(_=Pe.call(this._shortWeekdaysParse,C),_!==-1)?_:(_=Pe.call(this._minWeekdaysParse,C),_!==-1?_:null)):o==="ddd"?(_=Pe.call(this._shortWeekdaysParse,C),_!==-1||(_=Pe.call(this._weekdaysParse,C),_!==-1)?_:(_=Pe.call(this._minWeekdaysParse,C),_!==-1?_:null)):(_=Pe.call(this._minWeekdaysParse,C),_!==-1||(_=Pe.call(this._weekdaysParse,C),_!==-1)?_:(_=Pe.call(this._shortWeekdaysParse,C),_!==-1?_:null))}function pn(r,o,c){var s,_,D;if(this._weekdaysParseExact)return id.call(this,r,o,c);for(this._weekdaysParse||(this._weekdaysParse=[],this._minWeekdaysParse=[],this._shortWeekdaysParse=[],this._fullWeekdaysParse=[]),s=0;s<7;s++){if(_=g([2e3,1]).day(s),c&&!this._fullWeekdaysParse[s]&&(this._fullWeekdaysParse[s]=new RegExp("^"+this.weekdays(_,"").replace(".","\\.?")+"$","i"),this._shortWeekdaysParse[s]=new RegExp("^"+this.weekdaysShort(_,"").replace(".","\\.?")+"$","i"),this._minWeekdaysParse[s]=new RegExp("^"+this.weekdaysMin(_,"").replace(".","\\.?")+"$","i")),this._weekdaysParse[s]||(D="^"+this.weekdays(_,"")+"|^"+this.weekdaysShort(_,"")+"|^"+this.weekdaysMin(_,""),this._weekdaysParse[s]=new RegExp(D.replace(".",""),"i")),c&&o==="dddd"&&this._fullWeekdaysParse[s].test(r))return s;if(c&&o==="ddd"&&this._shortWeekdaysParse[s].test(r))return s;if(c&&o==="dd"&&this._minWeekdaysParse[s].test(r))return s;if(!c&&this._weekdaysParse[s].test(r))return s}}function T(r){if(!this.isValid())return r!=null?this:NaN;var o=Ga(this,"Day");return r!=null?(r=od(r,this.localeData()),this.add(r-o,"d")):o}function O(r){if(!this.isValid())return r!=null?this:NaN;var o=(this.day()+7-this.localeData()._week.dow)%7;return r==null?o:this.add(r-o,"d")}function an(r){if(!this.isValid())return r!=null?this:NaN;if(r!=null){var o=Lo(r,this.localeData());return this.day(this.day()%7?o:o-7)}else return this.day()||7}function Me(r){return this._weekdaysParseExact?(i(this,"_weekdaysRegex")||It.call(this),r?this._weekdaysStrictRegex:this._weekdaysRegex):(i(this,"_weekdaysRegex")||(this._weekdaysRegex=Zs),this._weekdaysStrictRegex&&r?this._weekdaysStrictRegex:this._weekdaysRegex)}function Lt(r){return this._weekdaysParseExact?(i(this,"_weekdaysRegex")||It.call(this),r?this._weekdaysShortStrictRegex:this._weekdaysShortRegex):(i(this,"_weekdaysShortRegex")||(this._weekdaysShortRegex=Ca),this._weekdaysShortStrictRegex&&r?this._weekdaysShortStrictRegex:this._weekdaysShortRegex)}function Ht(r){return this._weekdaysParseExact?(i(this,"_weekdaysRegex")||It.call(this),r?this._weekdaysMinStrictRegex:this._weekdaysMinRegex):(i(this,"_weekdaysMinRegex")||(this._weekdaysMinRegex=Xs),this._weekdaysMinStrictRegex&&r?this._weekdaysMinStrictRegex:this._weekdaysMinRegex)}function It(){function r(fr,No){return No.length-fr.length}var o=[],c=[],s=[],_=[],D,C,j,Wn,ae;for(D=0;D<7;D++)C=g([2e3,1]).day(D),j=Ea(this.weekdaysMin(C,"")),Wn=Ea(this.weekdaysShort(C,"")),ae=Ea(this.weekdays(C,"")),o.push(j),c.push(Wn),s.push(ae),_.push(j),_.push(Wn),_.push(ae);o.sort(r),c.sort(r),s.sort(r),_.sort(r),this._weekdaysRegex=new RegExp("^("+_.join("|")+")","i"),this._weekdaysShortRegex=this._weekdaysRegex,this._weekdaysMinRegex=this._weekdaysRegex,this._weekdaysStrictRegex=new RegExp("^("+s.join("|")+")","i"),this._weekdaysShortStrictRegex=new RegExp("^("+c.join("|")+")","i"),this._weekdaysMinStrictRegex=new RegExp("^("+o.join("|")+")","i")}function Fa(){return this.hours()%12||12}function li(){return this.hours()||24}w("H",["HH",2],0,"hour"),w("h",["hh",2],0,Fa),w("k",["kk",2],0,li),w("hmm",0,0,function(){return""+Fa.apply(this)+Le(this.minutes(),2)}),w("hmmss",0,0,function(){return""+Fa.apply(this)+Le(this.minutes(),2)+Le(this.seconds(),2)}),w("Hmm",0,0,function(){return""+this.hours()+Le(this.minutes(),2)}),w("Hmmss",0,0,function(){return""+this.hours()+Le(this.minutes(),2)+Le(this.seconds(),2)});function Wt(r,o){w(r,0,0,function(){return this.localeData().meridiem(this.hours(),this.minutes(),o)})}Wt("a",!0),Wt("A",!1);function Zc(r,o){return o._meridiemParse}V("a",Zc),V("A",Zc),V("H",le,qc),V("h",le,iu),V("k",le,iu),V("HH",le,yn),V("hh",le,yn),V("kk",le,yn),V("hmm",Eo),V("hmmss",ri),V("Hmm",Eo),V("Hmmss",ri),pe(["H","HH"],Ze),pe(["k","kk"],function(r,o,c){var s=zn(r);o[Ze]=s===24?0:s}),pe(["a","A"],function(r,o,c){c._isPm=c._locale.isPM(r),c._meridiem=r}),pe(["h","hh"],function(r,o,c){o[Ze]=zn(r),E(c).bigHour=!0}),pe("hmm",function(r,o,c){var s=r.length-2;o[Ze]=zn(r.substr(0,s)),o[hr]=zn(r.substr(s)),E(c).bigHour=!0}),pe("hmmss",function(r,o,c){var s=r.length-4,_=r.length-2;o[Ze]=zn(r.substr(0,s)),o[hr]=zn(r.substr(s,2)),o[Nr]=zn(r.substr(_)),E(c).bigHour=!0}),pe("Hmm",function(r,o,c){var s=r.length-2;o[Ze]=zn(r.substr(0,s)),o[hr]=zn(r.substr(s))}),pe("Hmmss",function(r,o,c){var s=r.length-4,_=r.length-2;o[Ze]=zn(r.substr(0,s)),o[hr]=zn(r.substr(s,2)),o[Nr]=zn(r.substr(_))});function rp(r){return(r+"").toLowerCase().charAt(0)==="p"}var Px=/[ap]\.?m?\.?/i,Wx=Or("Hours",!0);function Ux(r,o,c){return r>11?c?"pm":"PM":c?"am":"AM"}var Sh={calendar:ou,longDateFormat:k,invalidDate:Pn,ordinal:at,dayOfMonthOrdinalParse:ce,relativeTime:Ma,months:cu,monthsShort:Fo,week:js,weekdays:Ks,weekdaysMin:ud,weekdaysShort:Kc,meridiemParse:Px},Qe={},Xc={},nl;function kx(r,o){var c,s=Math.min(r.length,o.length);for(c=0;c<s;c+=1)if(r[c]!==o[c])return c;return s}function Ah(r){return r&&r.toLowerCase().replace("_","-")}function $x(r){for(var o=0,c,s,_,D;o<r.length;){for(D=Ah(r[o]).split("-"),c=D.length,s=Ah(r[o+1]),s=s?s.split("-"):null;c>0;){if(_=ap(D.slice(0,c).join("-")),_)return _;if(s&&s.length>=c&&kx(D,s)>=c-1)break;c--}o++}return nl}function qx(r){return!!(r&&r.match("^[^/\\\\]*$"))}function ap(r){var o=null,c;if(Qe[r]===void 0&&typeof uc<"u"&&uc&&uc.exports&&qx(r))try{o=nl._abbr,c=fy,c("./locale/"+r),su(o)}catch(s){Qe[r]=null}return Qe[r]}function su(r,o){var c;return r&&(l(o)?c=Ho(r):c=fd(r,o),c?nl=c:typeof console<"u"&&console.warn&&console.warn("Locale "+r+" not found. Did you forget to load it?")),nl._abbr}function fd(r,o){if(o!==null){var c,s=Sh;if(o.abbr=r,Qe[r]!=null)Ta("defineLocaleOverride","use moment.updateLocale(localeName, config) to change an existing locale. moment.defineLocale(localeName, config) should only be used for creating a new locale See http://momentjs.com/guides/#/warnings/define-locale/ for more info."),s=Qe[r]._config;else if(o.parentLocale!=null)if(Qe[o.parentLocale]!=null)s=Qe[o.parentLocale]._config;else if(c=ap(o.parentLocale),c!=null)s=c._config;else return Xc[o.parentLocale]||(Xc[o.parentLocale]=[]),Xc[o.parentLocale].push({name:r,config:o}),null;return Qe[r]=new mt(gr(s,o)),Xc[r]&&Xc[r].forEach(function(_){fd(_.name,_.config)}),su(r),Qe[r]}else return delete Qe[r],null}function Bx(r,o){if(o!=null){var c,s,_=Sh;Qe[r]!=null&&Qe[r].parentLocale!=null?Qe[r].set(gr(Qe[r]._config,o)):(s=ap(r),s!=null&&(_=s._config),o=gr(_,o),s==null&&(o.abbr=r),c=new mt(o),c.parentLocale=Qe[r],Qe[r]=c),su(r)}else Qe[r]!=null&&(Qe[r].parentLocale!=null?(Qe[r]=Qe[r].parentLocale,r===su()&&su(r)):Qe[r]!=null&&delete Qe[r]);return Qe[r]}function Ho(r){var o;if(r&&r._locale&&r._locale._abbr&&(r=r._locale._abbr),!r)return nl;if(!a(r)){if(o=ap(r),o)return o;r=[r]}return $x(r)}function Vx(){return na(Qe)}function cd(r){var o,c=r._a;return c&&E(r).overflow===-2&&(o=c[_e]<0||c[_e]>11?_e:c[Gt]<1||c[Gt]>Co(c[Dt],c[_e])?Gt:c[Ze]<0||c[Ze]>24||c[Ze]===24&&(c[hr]!==0||c[Nr]!==0||c[za]!==0)?Ze:c[hr]<0||c[hr]>59?hr:c[Nr]<0||c[Nr]>59?Nr:c[za]<0||c[za]>999?za:-1,E(r)._overflowDayOfYear&&(o<Dt||o>Gt)&&(o=Gt),E(r)._overflowWeeks&&o===-1&&(o=$s),E(r)._overflowWeekday&&o===-1&&(o=fu),E(r).overflow=o),r}var Jx=/^\s*((?:[+-]\d{6}|\d{4})-(?:\d\d-\d\d|W\d\d-\d|W\d\d|\d\d\d|\d\d))(?:(T| )(\d\d(?::\d\d(?::\d\d(?:[.,]\d+)?)?)?)([+-]\d\d(?::?\d\d)?|\s*Z)?)?$/,Qx=/^\s*((?:[+-]\d{6}|\d{4})(?:\d\d\d\d|W\d\d\d|W\d\d|\d\d\d|\d\d|))(?:(T| )(\d\d(?:\d\d(?:\d\d(?:[.,]\d+)?)?)?)([+-]\d\d(?::?\d\d)?|\s*Z)?)?$/,jx=/Z|[+-]\d\d(?::?\d\d)?/,op=[["YYYYYY-MM-DD",/[+-]\d{6}-\d\d-\d\d/],["YYYY-MM-DD",/\d{4}-\d\d-\d\d/],["GGGG-[W]WW-E",/\d{4}-W\d\d-\d/],["GGGG-[W]WW",/\d{4}-W\d\d/,!1],["YYYY-DDD",/\d{4}-\d{3}/],["YYYY-MM",/\d{4}-\d\d/,!1],["YYYYYYMMDD",/[+-]\d{10}/],["YYYYMMDD",/\d{8}/],["GGGG[W]WWE",/\d{4}W\d{3}/],["GGGG[W]WW",/\d{4}W\d{2}/,!1],["YYYYDDD",/\d{7}/],["YYYYMM",/\d{6}/,!1],["YYYY",/\d{4}/,!1]],ld=[["HH:mm:ss.SSSS",/\d\d:\d\d:\d\d\.\d+/],["HH:mm:ss,SSSS",/\d\d:\d\d:\d\d,\d+/],["HH:mm:ss",/\d\d:\d\d:\d\d/],["HH:mm",/\d\d:\d\d/],["HHmmss.SSSS",/\d\d\d\d\d\d\.\d+/],["HHmmss,SSSS",/\d\d\d\d\d\d,\d+/],["HHmmss",/\d\d\d\d\d\d/],["HHmm",/\d\d\d\d/],["HH",/\d\d/]],zx=/^\/?Date\((-?\d+)/i,Gx=/^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),?\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|([+-]\d{4}))$/,Yx={UT:0,GMT:0,EDT:-4*60,EST:-5*60,CDT:-5*60,CST:-6*60,MDT:-6*60,MST:-7*60,PDT:-7*60,PST:-8*60};function Nh(r){var o,c,s=r._i,_=Jx.exec(s)||Qx.exec(s),D,C,j,Wn,ae=op.length,fr=ld.length;if(_){for(E(r).iso=!0,o=0,c=ae;o<c;o++)if(op[o][1].exec(_[1])){C=op[o][0],D=op[o][2]!==!1;break}if(C==null){r._isValid=!1;return}if(_[3]){for(o=0,c=fr;o<c;o++)if(ld[o][1].exec(_[3])){j=(_[2]||" ")+ld[o][0];break}if(j==null){r._isValid=!1;return}}if(!D&&j!=null){r._isValid=!1;return}if(_[4])if(jx.exec(_[4]))Wn="Z";else{r._isValid=!1;return}r._f=C+(j||"")+(Wn||""),pd(r)}else r._isValid=!1}function Kx(r,o,c,s,_,D){var C=[Zx(r),Fo.indexOf(o),parseInt(c,10),parseInt(s,10),parseInt(_,10)];return D&&C.push(parseInt(D,10)),C}function Zx(r){var o=parseInt(r,10);return o<=49?2e3+o:o<=999?1900+o:o}function Xx(r){return r.replace(/\([^()]*\)|[\n\t]/g," ").replace(/(\s\s+)/g," ").replace(/^\s\s*/,"").replace(/\s\s*$/,"")}function nL(r,o,c){if(r){var s=Kc.indexOf(r),_=new Date(o[0],o[1],o[2]).getDay();if(s!==_)return E(c).weekdayMismatch=!0,c._isValid=!1,!1}return!0}function eL(r,o,c){if(r)return Yx[r];if(o)return 0;var s=parseInt(c,10),_=s%100,D=(s-_)/100;return D*60+_}function Rh(r){var o=Gx.exec(Xx(r._i)),c;if(o){if(c=Kx(o[4],o[3],o[2],o[5],o[6],o[7]),!nL(o[1],c,r))return;r._a=c,r._tzm=eL(o[8],o[9],o[10]),r._d=ii.apply(null,r._a),r._d.setUTCMinutes(r._d.getUTCMinutes()-r._tzm),E(r).rfc2822=!0}else r._isValid=!1}function tL(r){var o=zx.exec(r._i);if(o!==null){r._d=new Date(+o[1]);return}if(Nh(r),r._isValid===!1)delete r._isValid;else return;if(Rh(r),r._isValid===!1)delete r._isValid;else return;r._strict?r._isValid=!1:e.createFromInputFallback(r)}e.createFromInputFallback=wt("value provided is not in a recognized RFC2822 or ISO format. moment construction falls back to js Date(), which is not reliable across all browsers and versions. Non RFC2822/ISO date formats are discouraged. Please refer to http://momentjs.com/guides/#/warnings/js-date/ for more info.",function(r){r._d=new Date(r._i+(r._useUTC?" UTC":""))});function df(r,o,c){return r!=null?r:o!=null?o:c}function rL(r){var o=new Date(e.now());return r._useUTC?[o.getUTCFullYear(),o.getUTCMonth(),o.getUTCDate()]:[o.getFullYear(),o.getMonth(),o.getDate()]}function sd(r){var o,c,s=[],_,D,C;if(!r._d){for(_=rL(r),r._w&&r._a[Gt]==null&&r._a[_e]==null&&aL(r),r._dayOfYear!=null&&(C=df(r._a[Dt],_[Dt]),(r._dayOfYear>Rr(C)||r._dayOfYear===0)&&(E(r)._overflowDayOfYear=!0),c=ii(C,0,r._dayOfYear),r._a[_e]=c.getUTCMonth(),r._a[Gt]=c.getUTCDate()),o=0;o<3&&r._a[o]==null;++o)r._a[o]=s[o]=_[o];for(;o<7;o++)r._a[o]=s[o]=r._a[o]==null?o===2?1:0:r._a[o];r._a[Ze]===24&&r._a[hr]===0&&r._a[Nr]===0&&r._a[za]===0&&(r._nextDay=!0,r._a[Ze]=0),r._d=(r._useUTC?ii:rd).apply(null,s),D=r._useUTC?r._d.getUTCDay():r._d.getDay(),r._tzm!=null&&r._d.setUTCMinutes(r._d.getUTCMinutes()-r._tzm),r._nextDay&&(r._a[Ze]=24),r._w&&typeof r._w.d<"u"&&r._w.d!==D&&(E(r).weekdayMismatch=!0)}}function aL(r){var o,c,s,_,D,C,j,Wn,ae;o=r._w,o.GG!=null||o.W!=null||o.E!=null?(D=1,C=4,c=df(o.GG,r._a[Dt],fi(We(),1,4).year),s=df(o.W,1),_=df(o.E,1),(_<1||_>7)&&(Wn=!0)):(D=r._locale._week.dow,C=r._locale._week.doy,ae=fi(We(),D,C),c=df(o.gg,r._a[Dt],ae.year),s=df(o.w,ae.week),o.d!=null?(_=o.d,(_<0||_>6)&&(Wn=!0)):o.e!=null?(_=o.e+D,(o.e<0||o.e>6)&&(Wn=!0)):_=D),s<1||s>ta(c,D,C)?E(r)._overflowWeeks=!0:Wn!=null?E(r)._overflowWeekday=!0:(j=xo(c,s,_,D,C),r._a[Dt]=j.year,r._dayOfYear=j.dayOfYear)}e.ISO_8601=function(){},e.RFC_2822=function(){};function pd(r){if(r._f===e.ISO_8601){Nh(r);return}if(r._f===e.RFC_2822){Rh(r);return}r._a=[],E(r).empty=!0;var o=""+r._i,c,s,_,D,C,j=o.length,Wn=0,ae,fr;for(_=on(r._f,r._locale).match(Ar)||[],fr=_.length,c=0;c<fr;c++)D=_[c],s=(o.match(Bc(D,r))||[])[0],s&&(C=o.substr(0,o.indexOf(s)),C.length>0&&E(r).unusedInput.push(C),o=o.slice(o.indexOf(s)+s.length),Wn+=s.length),Qa[D]?(s?E(r).empty=!1:E(r).unusedTokens.push(D),ks(D,s,r)):r._strict&&!s&&E(r).unusedTokens.push(D);E(r).charsLeftOver=j-Wn,o.length>0&&E(r).unusedInput.push(o),r._a[Ze]<=12&&E(r).bigHour===!0&&r._a[Ze]>0&&(E(r).bigHour=void 0),E(r).parsedDateParts=r._a.slice(0),E(r).meridiem=r._meridiem,r._a[Ze]=oL(r._locale,r._a[Ze],r._meridiem),ae=E(r).era,ae!==null&&(r._a[Dt]=r._locale.erasConvertYear(ae,r._a[Dt])),sd(r),cd(r)}function oL(r,o,c){var s;return c==null?o:r.meridiemHour!=null?r.meridiemHour(o,c):(r.isPM!=null&&(s=r.isPM(c),s&&o<12&&(o+=12),!s&&o===12&&(o=0)),o)}function uL(r){var o,c,s,_,D,C,j=!1,Wn=r._f.length;if(Wn===0){E(r).invalidFormat=!0,r._d=new Date(NaN);return}for(_=0;_<Wn;_++)D=0,C=!1,o=En({},r),r._useUTC!=null&&(o._useUTC=r._useUTC),o._f=r._f[_],pd(o),W(o)&&(C=!0),D+=E(o).charsLeftOver,D+=E(o).unusedTokens.length*10,E(o).score=D,j?D<s&&(s=D,c=o):(s==null||D<s||C)&&(s=D,c=o,C&&(j=!0));v(r,c||o)}function iL(r){if(!r._d){var o=B(r._i),c=o.day===void 0?o.date:o.day;r._a=m([o.year,o.month,c,o.hour,o.minute,o.second,o.millisecond],function(s){return s&&parseInt(s,10)}),sd(r)}}function fL(r){var o=new U(cd(Oh(r)));return o._nextDay&&(o.add(1,"d"),o._nextDay=void 0),o}function Oh(r){var o=r._i,c=r._f;return r._locale=r._locale||Ho(r._l),o===null||c===void 0&&o===""?sn({nullInput:!0}):(typeof o=="string"&&(r._i=o=r._locale.preparse(o)),re(o)?new U(cd(o)):(d(o)?r._d=o:a(c)?uL(r):c?pd(r):cL(r),W(r)||(r._d=null),r))}function cL(r){var o=r._i;l(o)?r._d=new Date(e.now()):d(o)?r._d=new Date(o.valueOf()):typeof o=="string"?tL(r):a(o)?(r._a=m(o.slice(0),function(c){return parseInt(c,10)}),sd(r)):u(o)?iL(r):p(o)?r._d=new Date(o):e.createFromInputFallback(r)}function Ph(r,o,c,s,_){var D={};return(o===!0||o===!1)&&(s=o,o=void 0),(c===!0||c===!1)&&(s=c,c=void 0),(u(r)&&f(r)||a(r)&&r.length===0)&&(r=void 0),D._isAMomentObject=!0,D._useUTC=D._isUTC=_,D._l=c,D._i=r,D._f=o,D._strict=s,fL(D)}function We(r,o,c,s){return Ph(r,o,c,s,!1)}var lL=wt("moment().min is deprecated, use moment.max instead. http://momentjs.com/guides/#/warnings/min-max/",function(){var r=We.apply(null,arguments);return this.isValid()&&r.isValid()?r<this?this:r:sn()}),sL=wt("moment().max is deprecated, use moment.min instead. http://momentjs.com/guides/#/warnings/min-max/",function(){var r=We.apply(null,arguments);return this.isValid()&&r.isValid()?r>this?this:r:sn()});function Wh(r,o){var c,s;if(o.length===1&&a(o[0])&&(o=o[0]),!o.length)return We();for(c=o[0],s=1;s<o.length;++s)(!o[s].isValid()||o[s][r](c))&&(c=o[s]);return c}function pL(){var r=[].slice.call(arguments,0);return Wh("isBefore",r)}function _L(){var r=[].slice.call(arguments,0);return Wh("isAfter",r)}var mL=function(){return Date.now?Date.now():+new Date},el=["year","quarter","month","week","day","hour","minute","second","millisecond"];function dL(r){var o,c=!1,s,_=el.length;for(o in r)if(i(r,o)&&!(Pe.call(el,o)!==-1&&(r[o]==null||!isNaN(r[o]))))return!1;for(s=0;s<_;++s)if(r[el[s]]){if(c)return!1;parseFloat(r[el[s]])!==zn(r[el[s]])&&(c=!0)}return!0}function vL(){return this._isValid}function gL(){return wa(NaN)}function up(r){var o=B(r),c=o.year||0,s=o.quarter||0,_=o.month||0,D=o.week||o.isoWeek||0,C=o.day||0,j=o.hour||0,Wn=o.minute||0,ae=o.second||0,fr=o.millisecond||0;this._isValid=dL(o),this._milliseconds=+fr+ae*1e3+Wn*6e4+j*1e3*60*60,this._days=+C+D*7,this._months=+_+s*3+c*12,this._data={},this._locale=Ho(),this._bubble()}function ip(r){return r instanceof up}function _d(r){return r<0?Math.round(-1*r)*-1:Math.round(r)}function DL(r,o,c){var s=Math.min(r.length,o.length),_=Math.abs(r.length-o.length),D=0,C;for(C=0;C<s;C++)(c&&r[C]!==o[C]||!c&&zn(r[C])!==zn(o[C]))&&D++;return D+_}function Uh(r,o){w(r,0,0,function(){var c=this.utcOffset(),s="+";return c<0&&(c=-c,s="-"),s+Le(~~(c/60),2)+o+Le(~~c%60,2)})}Uh("Z",":"),Uh("ZZ",""),V("Z",uu),V("ZZ",uu),pe(["Z","ZZ"],function(r,o,c){c._useUTC=!0,c._tzm=md(uu,r)});var hL=/([\+\-]|\d\d)/gi;function md(r,o){var c=(o||"").match(r),s,_,D;return c===null?null:(s=c[c.length-1]||[],_=(s+"").match(hL)||["-",0,0],D=+(_[1]*60)+zn(_[2]),D===0?0:_[0]==="+"?D:-D)}function dd(r,o){var c,s;return o._isUTC?(c=o.clone(),s=(re(r)||d(r)?r.valueOf():We(r).valueOf())-c.valueOf(),c._d.setTime(c._d.valueOf()+s),e.updateOffset(c,!1),c):We(r).local()}function vd(r){return-Math.round(r._d.getTimezoneOffset())}e.updateOffset=function(){};function yL(r,o,c){var s=this._offset||0,_;if(!this.isValid())return r!=null?this:NaN;if(r!=null){if(typeof r=="string"){if(r=md(uu,r),r===null)return this}else Math.abs(r)<16&&!c&&(r=r*60);return!this._isUTC&&o&&(_=vd(this)),this._offset=r,this._isUTC=!0,_!=null&&this.add(_,"m"),s!==r&&(!o||this._changeInProgress?Bh(this,wa(r-s,"m"),1,!1):this._changeInProgress||(this._changeInProgress=!0,e.updateOffset(this,!0),this._changeInProgress=null)),this}else return this._isUTC?s:vd(this)}function TL(r,o){return r!=null?(typeof r!="string"&&(r=-r),this.utcOffset(r,o),this):-this.utcOffset()}function bL(r){return this.utcOffset(0,r)}function ML(r){return this._isUTC&&(this.utcOffset(0,r),this._isUTC=!1,r&&this.subtract(vd(this),"m")),this}function EL(){if(this._tzm!=null)this.utcOffset(this._tzm,!1,!0);else if(typeof this._i=="string"){var r=md(ai,this._i);r!=null?this.utcOffset(r):this.utcOffset(0,!0)}return this}function CL(r){return this.isValid()?(r=r?We(r).utcOffset():0,(this.utcOffset()-r)%60===0):!1}function FL(){return this.utcOffset()>this.clone().month(0).utcOffset()||this.utcOffset()>this.clone().month(5).utcOffset()}function wL(){if(!l(this._isDSTShifted))return this._isDSTShifted;var r={},o;return En(r,this),r=Oh(r),r._a?(o=r._isUTC?g(r._a):We(r._a),this._isDSTShifted=this.isValid()&&DL(r._a,o.toArray())>0):this._isDSTShifted=!1,this._isDSTShifted}function xL(){return this.isValid()?!this._isUTC:!1}function LL(){return this.isValid()?this._isUTC:!1}function kh(){return this.isValid()?this._isUTC&&this._offset===0:!1}var HL=/^(-|\+)?(?:(\d*)[. ])?(\d+):(\d+)(?::(\d+)(\.\d*)?)?$/,IL=/^(-|\+)?P(?:([-+]?[0-9,.]*)Y)?(?:([-+]?[0-9,.]*)M)?(?:([-+]?[0-9,.]*)W)?(?:([-+]?[0-9,.]*)D)?(?:T(?:([-+]?[0-9,.]*)H)?(?:([-+]?[0-9,.]*)M)?(?:([-+]?[0-9,.]*)S)?)?$/;function wa(r,o){var c=r,s=null,_,D,C;return ip(r)?c={ms:r._milliseconds,d:r._days,M:r._months}:p(r)||!isNaN(+r)?(c={},o?c[o]=+r:c.milliseconds=+r):(s=HL.exec(r))?(_=s[1]==="-"?-1:1,c={y:0,d:zn(s[Gt])*_,h:zn(s[Ze])*_,m:zn(s[hr])*_,s:zn(s[Nr])*_,ms:zn(_d(s[za]*1e3))*_}):(s=IL.exec(r))?(_=s[1]==="-"?-1:1,c={y:si(s[2],_),M:si(s[3],_),w:si(s[4],_),d:si(s[5],_),h:si(s[6],_),m:si(s[7],_),s:si(s[8],_)}):c==null?c={}:typeof c=="object"&&("from"in c||"to"in c)&&(C=SL(We(c.from),We(c.to)),c={},c.ms=C.milliseconds,c.M=C.months),D=new up(c),ip(r)&&i(r,"_locale")&&(D._locale=r._locale),ip(r)&&i(r,"_isValid")&&(D._isValid=r._isValid),D}wa.fn=up.prototype,wa.invalid=gL;function si(r,o){var c=r&&parseFloat(r.replace(",","."));return(isNaN(c)?0:c)*o}function $h(r,o){var c={};return c.months=o.month()-r.month()+(o.year()-r.year())*12,r.clone().add(c.months,"M").isAfter(o)&&--c.months,c.milliseconds=+o-+r.clone().add(c.months,"M"),c}function SL(r,o){var c;return r.isValid()&&o.isValid()?(o=dd(o,r),r.isBefore(o)?c=$h(r,o):(c=$h(o,r),c.milliseconds=-c.milliseconds,c.months=-c.months),c):{milliseconds:0,months:0}}function qh(r,o){return function(c,s){var _,D;return s!==null&&!isNaN(+s)&&(Ta(o,"moment()."+o+"(period, number) is deprecated. Please use moment()."+o+"(number, period). See http://momentjs.com/guides/#/warnings/add-inverted-param/ for more info."),D=c,c=s,s=D),_=wa(c,s),Bh(this,_,r),this}}function Bh(r,o,c,s){var _=o._milliseconds,D=_d(o._days),C=_d(o._months);r.isValid()&&(s=s==null?!0:s,C&&ea(r,Ga(r,"Month")+C*c),D&&ui(r,"Date",Ga(r,"Date")+D*c),_&&r._d.setTime(r._d.valueOf()+_*c),s&&e.updateOffset(r,D||C))}var AL=qh(1,"add"),NL=qh(-1,"subtract");function Vh(r){return typeof r=="string"||r instanceof String}function RL(r){return re(r)||d(r)||Vh(r)||p(r)||PL(r)||OL(r)||r===null||r===void 0}function OL(r){var o=u(r)&&!f(r),c=!1,s=["years","year","y","months","month","M","days","day","d","dates","date","D","hours","hour","h","minutes","minute","m","seconds","second","s","milliseconds","millisecond","ms"],_,D,C=s.length;for(_=0;_<C;_+=1)D=s[_],c=c||i(r,D);return o&&c}function PL(r){var o=a(r),c=!1;return o&&(c=r.filter(function(s){return!p(s)&&Vh(r)}).length===0),o&&c}function WL(r){var o=u(r)&&!f(r),c=!1,s=["sameDay","nextDay","lastDay","nextWeek","lastWeek","sameElse"],_,D;for(_=0;_<s.length;_+=1)D=s[_],c=c||i(r,D);return o&&c}function UL(r,o){var c=r.diff(o,"days",!0);return c<-6?"sameElse":c<-1?"lastWeek":c<0?"lastDay":c<1?"sameDay":c<2?"nextDay":c<7?"nextWeek":"sameElse"}function kL(r,o){arguments.length===1&&(arguments[0]?RL(arguments[0])?(r=arguments[0],o=void 0):WL(arguments[0])&&(o=arguments[0],r=void 0):(r=void 0,o=void 0));var c=r||We(),s=dd(c,this).startOf("day"),_=e.calendarFormat(this,s)||"sameElse",D=o&&(xt(o[_])?o[_].call(this,c):o[_]);return this.format(D||this.localeData().calendar(_,this,We(c)))}function $L(){return new U(this)}function qL(r,o){var c=re(r)?r:We(r);return this.isValid()&&c.isValid()?(o=q(o)||"millisecond",o==="millisecond"?this.valueOf()>c.valueOf():c.valueOf()<this.clone().startOf(o).valueOf()):!1}function BL(r,o){var c=re(r)?r:We(r);return this.isValid()&&c.isValid()?(o=q(o)||"millisecond",o==="millisecond"?this.valueOf()<c.valueOf():this.clone().endOf(o).valueOf()<c.valueOf()):!1}function VL(r,o,c,s){var _=re(r)?r:We(r),D=re(o)?o:We(o);return this.isValid()&&_.isValid()&&D.isValid()?(s=s||"()",(s[0]==="("?this.isAfter(_,c):!this.isBefore(_,c))&&(s[1]===")"?this.isBefore(D,c):!this.isAfter(D,c))):!1}function JL(r,o){var c=re(r)?r:We(r),s;return this.isValid()&&c.isValid()?(o=q(o)||"millisecond",o==="millisecond"?this.valueOf()===c.valueOf():(s=c.valueOf(),this.clone().startOf(o).valueOf()<=s&&s<=this.clone().endOf(o).valueOf())):!1}function QL(r,o){return this.isSame(r,o)||this.isAfter(r,o)}function jL(r,o){return this.isSame(r,o)||this.isBefore(r,o)}function zL(r,o,c){var s,_,D;if(!this.isValid())return NaN;if(s=dd(r,this),!s.isValid())return NaN;switch(_=(s.utcOffset()-this.utcOffset())*6e4,o=q(o),o){case"year":D=fp(this,s)/12;break;case"month":D=fp(this,s);break;case"quarter":D=fp(this,s)/3;break;case"second":D=(this-s)/1e3;break;case"minute":D=(this-s)/6e4;break;case"hour":D=(this-s)/36e5;break;case"day":D=(this-s-_)/864e5;break;case"week":D=(this-s-_)/6048e5;break;default:D=this-s}return c?D:Dr(D)}function fp(r,o){if(r.date()<o.date())return-fp(o,r);var c=(o.year()-r.year())*12+(o.month()-r.month()),s=r.clone().add(c,"months"),_,D;return o-s<0?(_=r.clone().add(c-1,"months"),D=(o-s)/(s-_)):(_=r.clone().add(c+1,"months"),D=(o-s)/(_-s)),-(c+D)||0}e.defaultFormat="YYYY-MM-DDTHH:mm:ssZ",e.defaultFormatUtc="YYYY-MM-DDTHH:mm:ss[Z]";function GL(){return this.clone().locale("en").format("ddd MMM DD YYYY HH:mm:ss [GMT]ZZ")}function YL(r){if(!this.isValid())return null;var o=r!==!0,c=o?this.clone().utc():this;return c.year()<0||c.year()>9999?jn(c,o?"YYYYYY-MM-DD[T]HH:mm:ss.SSS[Z]":"YYYYYY-MM-DD[T]HH:mm:ss.SSSZ"):xt(Date.prototype.toISOString)?o?this.toDate().toISOString():new Date(this.valueOf()+this.utcOffset()*60*1e3).toISOString().replace("Z",jn(c,"Z")):jn(c,o?"YYYY-MM-DD[T]HH:mm:ss.SSS[Z]":"YYYY-MM-DD[T]HH:mm:ss.SSSZ")}function KL(){if(!this.isValid())return"moment.invalid(/* "+this._i+" */)";var r="moment",o="",c,s,_,D;return this.isLocal()||(r=this.utcOffset()===0?"moment.utc":"moment.parseZone",o="Z"),c="["+r+'("]',s=0<=this.year()&&this.year()<=9999?"YYYY":"YYYYYY",_="-MM-DD[T]HH:mm:ss.SSS",D=o+'[")]',this.format(c+s+_+D)}function ZL(r){r||(r=this.isUtc()?e.defaultFormatUtc:e.defaultFormat);var o=jn(this,r);return this.localeData().postformat(o)}function XL(r,o){return this.isValid()&&(re(r)&&r.isValid()||We(r).isValid())?wa({to:this,from:r}).locale(this.locale()).humanize(!o):this.localeData().invalidDate()}function nH(r){return this.from(We(),r)}function eH(r,o){return this.isValid()&&(re(r)&&r.isValid()||We(r).isValid())?wa({from:this,to:r}).locale(this.locale()).humanize(!o):this.localeData().invalidDate()}function tH(r){return this.to(We(),r)}function Jh(r){var o;return r===void 0?this._locale._abbr:(o=Ho(r),o!=null&&(this._locale=o),this)}var Qh=wt("moment().lang() is deprecated. Instead, use moment().localeData() to get the language configuration. Use moment().locale() to change languages.",function(r){return r===void 0?this.localeData():this.locale(r)});function jh(){return this._locale}var cp=1e3,vf=60*cp,lp=60*vf,zh=(365*400+97)*24*lp;function gf(r,o){return(r%o+o)%o}function Gh(r,o,c){return r<100&&r>=0?new Date(r+400,o,c)-zh:new Date(r,o,c).valueOf()}function Yh(r,o,c){return r<100&&r>=0?Date.UTC(r+400,o,c)-zh:Date.UTC(r,o,c)}function rH(r){var o,c;if(r=q(r),r===void 0||r==="millisecond"||!this.isValid())return this;switch(c=this._isUTC?Yh:Gh,r){case"year":o=c(this.year(),0,1);break;case"quarter":o=c(this.year(),this.month()-this.month()%3,1);break;case"month":o=c(this.year(),this.month(),1);break;case"week":o=c(this.year(),this.month(),this.date()-this.weekday());break;case"isoWeek":o=c(this.year(),this.month(),this.date()-(this.isoWeekday()-1));break;case"day":case"date":o=c(this.year(),this.month(),this.date());break;case"hour":o=this._d.valueOf(),o-=gf(o+(this._isUTC?0:this.utcOffset()*vf),lp);break;case"minute":o=this._d.valueOf(),o-=gf(o,vf);break;case"second":o=this._d.valueOf(),o-=gf(o,cp);break}return this._d.setTime(o),e.updateOffset(this,!0),this}function aH(r){var o,c;if(r=q(r),r===void 0||r==="millisecond"||!this.isValid())return this;switch(c=this._isUTC?Yh:Gh,r){case"year":o=c(this.year()+1,0,1)-1;break;case"quarter":o=c(this.year(),this.month()-this.month()%3+3,1)-1;break;case"month":o=c(this.year(),this.month()+1,1)-1;break;case"week":o=c(this.year(),this.month(),this.date()-this.weekday()+7)-1;break;case"isoWeek":o=c(this.year(),this.month(),this.date()-(this.isoWeekday()-1)+7)-1;break;case"day":case"date":o=c(this.year(),this.month(),this.date()+1)-1;break;case"hour":o=this._d.valueOf(),o+=lp-gf(o+(this._isUTC?0:this.utcOffset()*vf),lp)-1;break;case"minute":o=this._d.valueOf(),o+=vf-gf(o,vf)-1;break;case"second":o=this._d.valueOf(),o+=cp-gf(o,cp)-1;break}return this._d.setTime(o),e.updateOffset(this,!0),this}function oH(){return this._d.valueOf()-(this._offset||0)*6e4}function uH(){return Math.floor(this.valueOf()/1e3)}function iH(){return new Date(this.valueOf())}function fH(){var r=this;return[r.year(),r.month(),r.date(),r.hour(),r.minute(),r.second(),r.millisecond()]}function cH(){var r=this;return{years:r.year(),months:r.month(),date:r.date(),hours:r.hours(),minutes:r.minutes(),seconds:r.seconds(),milliseconds:r.milliseconds()}}function lH(){return this.isValid()?this.toISOString():null}function sH(){return W(this)}function pH(){return v({},E(this))}function _H(){return E(this).overflow}function mH(){return{input:this._i,format:this._f,locale:this._locale,isUTC:this._isUTC,strict:this._strict}}w("N",0,0,"eraAbbr"),w("NN",0,0,"eraAbbr"),w("NNN",0,0,"eraAbbr"),w("NNNN",0,0,"eraName"),w("NNNNN",0,0,"eraNarrow"),w("y",["y",1],"yo","eraYear"),w("y",["yy",2],0,"eraYear"),w("y",["yyy",3],0,"eraYear"),w("y",["yyyy",4],0,"eraYear"),V("N",gd),V("NN",gd),V("NNN",gd),V("NNNN",CH),V("NNNNN",FH),pe(["N","NN","NNN","NNNN","NNNNN"],function(r,o,c,s){var _=c._locale.erasParse(r,s,c._strict);_?E(c).era=_:E(c).invalidEra=r}),V("y",ja),V("yy",ja),V("yyy",ja),V("yyyy",ja),V("yo",wH),pe(["y","yy","yyy","yyyy"],Dt),pe(["yo"],function(r,o,c,s){var _;c._locale._eraYearOrdinalRegex&&(_=r.match(c._locale._eraYearOrdinalRegex)),c._locale.eraYearOrdinalParse?o[Dt]=c._locale.eraYearOrdinalParse(r,_):o[Dt]=parseInt(r,10)});function dH(r,o){var c,s,_,D=this._eras||Ho("en")._eras;for(c=0,s=D.length;c<s;++c){switch(typeof D[c].since){case"string":_=e(D[c].since).startOf("day"),D[c].since=_.valueOf();break}switch(typeof D[c].until){case"undefined":D[c].until=1/0;break;case"string":_=e(D[c].until).startOf("day").valueOf(),D[c].until=_.valueOf();break}}return D}function vH(r,o,c){var s,_,D=this.eras(),C,j,Wn;for(r=r.toUpperCase(),s=0,_=D.length;s<_;++s)if(C=D[s].name.toUpperCase(),j=D[s].abbr.toUpperCase(),Wn=D[s].narrow.toUpperCase(),c)switch(o){case"N":case"NN":case"NNN":if(j===r)return D[s];break;case"NNNN":if(C===r)return D[s];break;case"NNNNN":if(Wn===r)return D[s];break}else if([C,j,Wn].indexOf(r)>=0)return D[s]}function gH(r,o){var c=r.since<=r.until?1:-1;return o===void 0?e(r.since).year():e(r.since).year()+(o-r.offset)*c}function DH(){var r,o,c,s=this.localeData().eras();for(r=0,o=s.length;r<o;++r)if(c=this.clone().startOf("day").valueOf(),s[r].since<=c&&c<=s[r].until||s[r].until<=c&&c<=s[r].since)return s[r].name;return""}function hH(){var r,o,c,s=this.localeData().eras();for(r=0,o=s.length;r<o;++r)if(c=this.clone().startOf("day").valueOf(),s[r].since<=c&&c<=s[r].until||s[r].until<=c&&c<=s[r].since)return s[r].narrow;return""}function yH(){var r,o,c,s=this.localeData().eras();for(r=0,o=s.length;r<o;++r)if(c=this.clone().startOf("day").valueOf(),s[r].since<=c&&c<=s[r].until||s[r].until<=c&&c<=s[r].since)return s[r].abbr;return""}function TH(){var r,o,c,s,_=this.localeData().eras();for(r=0,o=_.length;r<o;++r)if(c=_[r].since<=_[r].until?1:-1,s=this.clone().startOf("day").valueOf(),_[r].since<=s&&s<=_[r].until||_[r].until<=s&&s<=_[r].since)return(this.year()-e(_[r].since).year())*c+_[r].offset;return this.year()}function bH(r){return i(this,"_erasNameRegex")||Dd.call(this),r?this._erasNameRegex:this._erasRegex}function MH(r){return i(this,"_erasAbbrRegex")||Dd.call(this),r?this._erasAbbrRegex:this._erasRegex}function EH(r){return i(this,"_erasNarrowRegex")||Dd.call(this),r?this._erasNarrowRegex:this._erasRegex}function gd(r,o){return o.erasAbbrRegex(r)}function CH(r,o){return o.erasNameRegex(r)}function FH(r,o){return o.erasNarrowRegex(r)}function wH(r,o){return o._eraYearOrdinalRegex||ja}function Dd(){var r=[],o=[],c=[],s=[],_,D,C,j,Wn,ae=this.eras();for(_=0,D=ae.length;_<D;++_)C=Ea(ae[_].name),j=Ea(ae[_].abbr),Wn=Ea(ae[_].narrow),o.push(C),r.push(j),c.push(Wn),s.push(C),s.push(j),s.push(Wn);this._erasRegex=new RegExp("^("+s.join("|")+")","i"),this._erasNameRegex=new RegExp("^("+o.join("|")+")","i"),this._erasAbbrRegex=new RegExp("^("+r.join("|")+")","i"),this._erasNarrowRegex=new RegExp("^("+c.join("|")+")","i")}w(0,["gg",2],0,function(){return this.weekYear()%100}),w(0,["GG",2],0,function(){return this.isoWeekYear()%100});function sp(r,o){w(0,[r,r.length],0,o)}sp("gggg","weekYear"),sp("ggggg","weekYear"),sp("GGGG","isoWeekYear"),sp("GGGGG","isoWeekYear"),V("G",dt),V("g",dt),V("GG",le,yn),V("gg",le,yn),V("GGGG",$c,De),V("gggg",$c,De),V("GGGGG",lf,Ve),V("ggggg",lf,Ve),Je(["gggg","ggggg","GGGG","GGGGG"],function(r,o,c,s){o[s.substr(0,2)]=zn(r)}),Je(["gg","GG"],function(r,o,c,s){o[s]=e.parseTwoDigitYear(r)});function xH(r){return Kh.call(this,r,this.week(),this.weekday()+this.localeData()._week.dow,this.localeData()._week.dow,this.localeData()._week.doy)}function LH(r){return Kh.call(this,r,this.isoWeek(),this.isoWeekday(),1,4)}function HH(){return ta(this.year(),1,4)}function IH(){return ta(this.isoWeekYear(),1,4)}function SH(){var r=this.localeData()._week;return ta(this.year(),r.dow,r.doy)}function AH(){var r=this.localeData()._week;return ta(this.weekYear(),r.dow,r.doy)}function Kh(r,o,c,s,_){var D;return r==null?fi(this,s,_).year:(D=ta(r,s,_),o>D&&(o=D),NH.call(this,r,o,c,s,_))}function NH(r,o,c,s,_){var D=xo(r,o,c,s,_),C=ii(D.year,0,D.dayOfYear);return this.year(C.getUTCFullYear()),this.month(C.getUTCMonth()),this.date(C.getUTCDate()),this}w("Q",0,"Qo","quarter"),V("Q",un),pe("Q",function(r,o){o[_e]=(zn(r)-1)*3});function RH(r){return r==null?Math.ceil((this.month()+1)/3):this.month((r-1)*3+this.month()%3)}w("D",["DD",2],"Do","date"),V("D",le,iu),V("DD",le,yn),V("Do",function(r,o){return r?o._dayOfMonthOrdinalParse||o._ordinalParse:o._dayOfMonthOrdinalParseLenient}),pe(["D","DD"],Gt),pe("Do",function(r,o){o[Gt]=zn(r.match(le)[0])});var Zh=Or("Date",!0);w("DDD",["DDDD",3],"DDDo","dayOfYear"),V("DDD",cf),V("DDDD",Bn),pe(["DDD","DDDD"],function(r,o,c){c._dayOfYear=zn(r)});function OH(r){var o=Math.round((this.clone().startOf("day")-this.clone().startOf("year"))/864e5)+1;return r==null?o:this.add(r-o,"d")}w("m",["mm",2],0,"minute"),V("m",le,qc),V("mm",le,yn),pe(["m","mm"],hr);var PH=Or("Minutes",!1);w("s",["ss",2],0,"second"),V("s",le,qc),V("ss",le,yn),pe(["s","ss"],Nr);var WH=Or("Seconds",!1);w("S",0,0,function(){return~~(this.millisecond()/100)}),w(0,["SS",2],0,function(){return~~(this.millisecond()/10)}),w(0,["SSS",3],0,"millisecond"),w(0,["SSSS",4],0,function(){return this.millisecond()*10}),w(0,["SSSSS",5],0,function(){return this.millisecond()*100}),w(0,["SSSSSS",6],0,function(){return this.millisecond()*1e3}),w(0,["SSSSSSS",7],0,function(){return this.millisecond()*1e4}),w(0,["SSSSSSSS",8],0,function(){return this.millisecond()*1e5}),w(0,["SSSSSSSSS",9],0,function(){return this.millisecond()*1e6}),V("S",cf,un),V("SS",cf,yn),V("SSS",cf,Bn);var pu,Xh;for(pu="SSSS";pu.length<=9;pu+="S")V(pu,ja);function UH(r,o){o[za]=zn(("0."+r)*1e3)}for(pu="S";pu.length<=9;pu+="S")pe(pu,UH);Xh=Or("Milliseconds",!1),w("z",0,0,"zoneAbbr"),w("zz",0,0,"zoneName");function kH(){return this._isUTC?"UTC":""}function $H(){return this._isUTC?"Coordinated Universal Time":""}var N=U.prototype;N.add=AL,N.calendar=kL,N.clone=$L,N.diff=zL,N.endOf=aH,N.format=ZL,N.from=XL,N.fromNow=nH,N.to=eH,N.toNow=tH,N.get=qs,N.invalidAt=_H,N.isAfter=qL,N.isBefore=BL,N.isBetween=VL,N.isSame=JL,N.isSameOrAfter=QL,N.isSameOrBefore=jL,N.isValid=sH,N.lang=Qh,N.locale=Jh,N.localeData=jh,N.max=sL,N.min=lL,N.parsingFlags=pH,N.set=Bs,N.startOf=rH,N.subtract=NL,N.toArray=fH,N.toObject=cH,N.toDate=iH,N.toISOString=YL,N.inspect=KL,typeof Symbol<"u"&&Symbol.for!=null&&(N[Symbol.for("nodejs.util.inspect.custom")]=function(){return"Moment<"+this.format()+">"}),N.toJSON=lH,N.toString=GL,N.unix=uH,N.valueOf=oH,N.creationData=mH,N.eraName=DH,N.eraNarrow=hH,N.eraAbbr=yH,N.eraYear=TH,N.year=pf,N.isLeapYear=Jc,N.weekYear=xH,N.isoWeekYear=LH,N.quarter=N.quarters=RH,N.month=wo,N.daysInMonth=zc,N.week=N.weeks=Gs,N.isoWeek=N.isoWeeks=Ys,N.weeksInYear=SH,N.weeksInWeekYear=AH,N.isoWeeksInYear=HH,N.isoWeeksInISOWeekYear=IH,N.date=Zh,N.day=N.days=T,N.weekday=O,N.isoWeekday=an,N.dayOfYear=OH,N.hour=N.hours=Wx,N.minute=N.minutes=PH,N.second=N.seconds=WH,N.millisecond=N.milliseconds=Xh,N.utcOffset=yL,N.utc=bL,N.local=ML,N.parseZone=EL,N.hasAlignedHourOffset=CL,N.isDST=FL,N.isLocal=xL,N.isUtcOffset=LL,N.isUtc=kh,N.isUTC=kh,N.zoneAbbr=kH,N.zoneName=$H,N.dates=wt("dates accessor is deprecated. Use date instead.",Zh),N.months=wt("months accessor is deprecated. Use month instead",wo),N.years=wt("years accessor is deprecated. Use year instead",pf),N.zone=wt("moment().zone is deprecated, use moment().utcOffset instead. http://momentjs.com/guides/#/warnings/zone/",TL),N.isDSTShifted=wt("isDSTShifted is deprecated. See http://momentjs.com/guides/#/warnings/dst-shifted/ for more information",wL);function qH(r){return We(r*1e3)}function BH(){return We.apply(null,arguments).parseZone()}function ny(r){return r}var se=mt.prototype;se.calendar=Mo,se.longDateFormat=ne,se.invalidDate=ge,se.ordinal=Ie,se.preparse=ny,se.postformat=ny,se.relativeTime=Ln,se.pastFuture=G,se.set=ti,se.eras=dH,se.erasParse=vH,se.erasConvertYear=gH,se.erasAbbrRegex=MH,se.erasNameRegex=bH,se.erasNarrowRegex=EH,se.months=jc,se.monthsShort=Qs,se.monthsParse=mf,se.monthsRegex=td,se.monthsShortRegex=Gc,se.week=Yc,se.firstDayOfYear=ad,se.firstDayOfWeek=zs,se.weekdays=np,se.weekdaysMin=tp,se.weekdaysShort=ep,se.weekdaysParse=pn,se.weekdaysRegex=Me,se.weekdaysShortRegex=Lt,se.weekdaysMinRegex=Ht,se.isPM=rp,se.meridiem=Ux;function pp(r,o,c,s){var _=Ho(),D=g().set(s,o);return _[c](D,r)}function ey(r,o,c){if(p(r)&&(o=r,r=void 0),r=r||"",o!=null)return pp(r,o,c,"month");var s,_=[];for(s=0;s<12;s++)_[s]=pp(r,s,c,"month");return _}function hd(r,o,c,s){typeof r=="boolean"?(p(o)&&(c=o,o=void 0),o=o||""):(o=r,c=o,r=!1,p(o)&&(c=o,o=void 0),o=o||"");var _=Ho(),D=r?_._week.dow:0,C,j=[];if(c!=null)return pp(o,(c+D)%7,s,"day");for(C=0;C<7;C++)j[C]=pp(o,(C+D)%7,s,"day");return j}function VH(r,o){return ey(r,o,"months")}function JH(r,o){return ey(r,o,"monthsShort")}function QH(r,o,c){return hd(r,o,c,"weekdays")}function jH(r,o,c){return hd(r,o,c,"weekdaysShort")}function zH(r,o,c){return hd(r,o,c,"weekdaysMin")}su("en",{eras:[{since:"0001-01-01",until:1/0,offset:1,name:"Anno Domini",narrow:"AD",abbr:"AD"},{since:"0000-12-31",until:-1/0,offset:1,name:"Before Christ",narrow:"BC",abbr:"BC"}],dayOfMonthOrdinalParse:/\d{1,2}(th|st|nd|rd)/,ordinal:function(r){var o=r%10,c=zn(r%100/10)===1?"th":o===1?"st":o===2?"nd":o===3?"rd":"th";return r+c}}),e.lang=wt("moment.lang is deprecated. Use moment.locale instead.",su),e.langData=wt("moment.langData is deprecated. Use moment.localeData instead.",Ho);var Io=Math.abs;function GH(){var r=this._data;return this._milliseconds=Io(this._milliseconds),this._days=Io(this._days),this._months=Io(this._months),r.milliseconds=Io(r.milliseconds),r.seconds=Io(r.seconds),r.minutes=Io(r.minutes),r.hours=Io(r.hours),r.months=Io(r.months),r.years=Io(r.years),this}function ty(r,o,c,s){var _=wa(o,c);return r._milliseconds+=s*_._milliseconds,r._days+=s*_._days,r._months+=s*_._months,r._bubble()}function YH(r,o){return ty(this,r,o,1)}function KH(r,o){return ty(this,r,o,-1)}function ry(r){return r<0?Math.floor(r):Math.ceil(r)}function ZH(){var r=this._milliseconds,o=this._days,c=this._months,s=this._data,_,D,C,j,Wn;return r>=0&&o>=0&&c>=0||r<=0&&o<=0&&c<=0||(r+=ry(yd(c)+o)*864e5,o=0,c=0),s.milliseconds=r%1e3,_=Dr(r/1e3),s.seconds=_%60,D=Dr(_/60),s.minutes=D%60,C=Dr(D/60),s.hours=C%24,o+=Dr(C/24),Wn=Dr(ay(o)),c+=Wn,o-=ry(yd(Wn)),j=Dr(c/12),c%=12,s.days=o,s.months=c,s.years=j,this}function ay(r){return r*4800/146097}function yd(r){return r*146097/4800}function XH(r){if(!this.isValid())return NaN;var o,c,s=this._milliseconds;if(r=q(r),r==="month"||r==="quarter"||r==="year")switch(o=this._days+s/864e5,c=this._months+ay(o),r){case"month":return c;case"quarter":return c/3;case"year":return c/12}else switch(o=this._days+Math.round(yd(this._months)),r){case"week":return o/7+s/6048e5;case"day":return o+s/864e5;case"hour":return o*24+s/36e5;case"minute":return o*1440+s/6e4;case"second":return o*86400+s/1e3;case"millisecond":return Math.floor(o*864e5)+s;default:throw new Error("Unknown unit "+r)}}function So(r){return function(){return this.as(r)}}var oy=So("ms"),nI=So("s"),eI=So("m"),tI=So("h"),rI=So("d"),aI=So("w"),oI=So("M"),uI=So("Q"),iI=So("y"),fI=oy;function cI(){return wa(this)}function lI(r){return r=q(r),this.isValid()?this[r+"s"]():NaN}function pi(r){return function(){return this.isValid()?this._data[r]:NaN}}var sI=pi("milliseconds"),pI=pi("seconds"),_I=pi("minutes"),mI=pi("hours"),dI=pi("days"),vI=pi("months"),gI=pi("years");function DI(){return Dr(this.days()/7)}var Ao=Math.round,Df={ss:44,s:45,m:45,h:22,d:26,w:null,M:11};function hI(r,o,c,s,_){return _.relativeTime(o||1,!!c,r,s)}function yI(r,o,c,s){var _=wa(r).abs(),D=Ao(_.as("s")),C=Ao(_.as("m")),j=Ao(_.as("h")),Wn=Ao(_.as("d")),ae=Ao(_.as("M")),fr=Ao(_.as("w")),No=Ao(_.as("y")),_u=D<=c.ss&&["s",D]||D<c.s&&["ss",D]||C<=1&&["m"]||C<c.m&&["mm",C]||j<=1&&["h"]||j<c.h&&["hh",j]||Wn<=1&&["d"]||Wn<c.d&&["dd",Wn];return c.w!=null&&(_u=_u||fr<=1&&["w"]||fr<c.w&&["ww",fr]),_u=_u||ae<=1&&["M"]||ae<c.M&&["MM",ae]||No<=1&&["y"]||["yy",No],_u[2]=o,_u[3]=+r>0,_u[4]=s,hI.apply(null,_u)}function TI(r){return r===void 0?Ao:typeof r=="function"?(Ao=r,!0):!1}function bI(r,o){return Df[r]===void 0?!1:o===void 0?Df[r]:(Df[r]=o,r==="s"&&(Df.ss=o-1),!0)}function MI(r,o){if(!this.isValid())return this.localeData().invalidDate();var c=!1,s=Df,_,D;return typeof r=="object"&&(o=r,r=!1),typeof r=="boolean"&&(c=r),typeof o=="object"&&(s=Object.assign({},Df,o),o.s!=null&&o.ss==null&&(s.ss=o.s-1)),_=this.localeData(),D=yI(this,!c,s,_),c&&(D=_.pastFuture(+this,D)),_.postformat(D)}var Td=Math.abs;function hf(r){return(r>0)-(r<0)||+r}function _p(){if(!this.isValid())return this.localeData().invalidDate();var r=Td(this._milliseconds)/1e3,o=Td(this._days),c=Td(this._months),s,_,D,C,j=this.asSeconds(),Wn,ae,fr,No;return j?(s=Dr(r/60),_=Dr(s/60),r%=60,s%=60,D=Dr(c/12),c%=12,C=r?r.toFixed(3).replace(/\.?0+$/,""):"",Wn=j<0?"-":"",ae=hf(this._months)!==hf(j)?"-":"",fr=hf(this._days)!==hf(j)?"-":"",No=hf(this._milliseconds)!==hf(j)?"-":"",Wn+"P"+(D?ae+D+"Y":"")+(c?ae+c+"M":"")+(o?fr+o+"D":"")+(_||s||r?"T":"")+(_?No+_+"H":"")+(s?No+s+"M":"")+(r?No+C+"S":"")):"P0D"}var ue=up.prototype;ue.isValid=vL,ue.abs=GH,ue.add=YH,ue.subtract=KH,ue.as=XH,ue.asMilliseconds=oy,ue.asSeconds=nI,ue.asMinutes=eI,ue.asHours=tI,ue.asDays=rI,ue.asWeeks=aI,ue.asMonths=oI,ue.asQuarters=uI,ue.asYears=iI,ue.valueOf=fI,ue._bubble=ZH,ue.clone=cI,ue.get=lI,ue.milliseconds=sI,ue.seconds=pI,ue.minutes=_I,ue.hours=mI,ue.days=dI,ue.weeks=DI,ue.months=vI,ue.years=gI,ue.humanize=MI,ue.toISOString=_p,ue.toString=_p,ue.toJSON=_p,ue.locale=Jh,ue.localeData=jh,ue.toIsoString=wt("toIsoString() is deprecated. Please use toISOString() instead (notice the capitals)",_p),ue.lang=Qh,w("X",0,0,"unix"),w("x",0,0,"valueOf"),V("x",dt),V("X",nd),pe("X",function(r,o,c){c._d=new Date(parseFloat(r)*1e3)}),pe("x",function(r,o,c){c._d=new Date(zn(r))});return e.version="2.30.1",t(We),e.fn=N,e.min=pL,e.max=_L,e.now=mL,e.utc=g,e.unix=qH,e.months=VH,e.isDate=d,e.locale=su,e.invalid=sn,e.duration=wa,e.isMoment=re,e.weekdays=QH,e.parseZone=BH,e.localeData=Ho,e.isDuration=ip,e.monthsShort=JH,e.weekdaysMin=zH,e.defineLocale=fd,e.updateLocale=Bx,e.locales=Vx,e.weekdaysShort=jH,e.normalizeUnits=q,e.relativeTimeRounding=TI,e.relativeTimeThreshold=bI,e.calendarFormat=UL,e.prototype=N,e.HTML5_FMT={DATETIME_LOCAL:"YYYY-MM-DDTHH:mm",DATETIME_LOCAL_SECONDS:"YYYY-MM-DDTHH:mm:ss",DATETIME_LOCAL_MS:"YYYY-MM-DDTHH:mm:ss.SSS",DATE:"YYYY-MM-DD",TIME:"HH:mm",TIME_SECONDS:"HH:mm:ss",TIME_MS:"HH:mm:ss.SSS",WEEK:"GGGG-[W]WW",MONTH:"YYYY-MM"},e})});var m1=cy((uh,ih)=>{(function(n,e){typeof uh=="object"&&typeof ih<"u"?ih.exports=e():typeof define=="function"&&define.amd?define(e):(n=typeof globalThis<"u"?globalThis:n||self,n.DOMPurify=e())})(uh,function(){"use strict";let{entries:n,setPrototypeOf:e,isFrozen:t,getPrototypeOf:a,getOwnPropertyDescriptor:u}=Object,{freeze:i,seal:f,create:l}=Object,{apply:p,construct:d}=typeof Reflect<"u"&&Reflect;i||(i=function(G){return G}),f||(f=function(G){return G}),p||(p=function(G,$n,q){return G.apply($n,q)}),d||(d=function(G,$n){return new G(...$n)});let m=U(Array.prototype.forEach),v=U(Array.prototype.pop),g=U(Array.prototype.push),h=U(String.prototype.toLowerCase),E=U(String.prototype.toString),F=U(String.prototype.match),W=U(String.prototype.replace),sn=U(String.prototype.indexOf),wn=U(String.prototype.trim),Rn=U(RegExp.prototype.test),En=re(TypeError);function U(Ln){return function(G){for(var $n=arguments.length,q=new Array($n>1?$n-1:0),B=1;B<$n;B++)q[B-1]=arguments[B];return p(Ln,G,q)}}function re(Ln){return function(){for(var G=arguments.length,$n=new Array(G),q=0;q<G;q++)$n[q]=arguments[q];return d(Ln,$n)}}function An(Ln,G){let $n=arguments.length>2&&arguments[2]!==void 0?arguments[2]:h;e&&e(Ln,null);let q=G.length;for(;q--;){let B=G[q];if(typeof B=="string"){let Cn=$n(B);Cn!==B&&(t(G)||(G[q]=Cn),B=Cn)}Ln[B]=!0}return Ln}function wt(Ln){for(let G=0;G<Ln.length;G++)u(Ln,G)===void 0&&(Ln[G]=null);return Ln}function vr(Ln){let G=l(null);for(let[$n,q]of n(Ln))u(Ln,$n)!==void 0&&(Array.isArray(q)?G[$n]=wt(q):q&&typeof q=="object"&&q.constructor===Object?G[$n]=vr(q):G[$n]=q);return G}function Ta(Ln,G){for(;Ln!==null;){let q=u(Ln,G);if(q){if(q.get)return U(q.get);if(typeof q.value=="function")return U(q.value)}Ln=a(Ln)}function $n(q){return console.warn("fallback value for",q),null}return $n}let xt=i(["a","abbr","acronym","address","area","article","aside","audio","b","bdi","bdo","big","blink","blockquote","body","br","button","canvas","caption","center","cite","code","col","colgroup","content","data","datalist","dd","decorator","del","details","dfn","dialog","dir","div","dl","dt","element","em","fieldset","figcaption","figure","font","footer","form","h1","h2","h3","h4","h5","h6","head","header","hgroup","hr","html","i","img","input","ins","kbd","label","legend","li","main","map","mark","marquee","menu","menuitem","meter","nav","nobr","ol","optgroup","option","output","p","picture","pre","progress","q","rp","rt","ruby","s","samp","section","select","shadow","small","source","spacer","span","strike","strong","style","sub","summary","sup","table","tbody","td","template","textarea","tfoot","th","thead","time","tr","track","tt","u","ul","var","video","wbr"]),ti=i(["svg","a","altglyph","altglyphdef","altglyphitem","animatecolor","animatemotion","animatetransform","circle","clippath","defs","desc","ellipse","filter","font","g","glyph","glyphref","hkern","image","line","lineargradient","marker","mask","metadata","mpath","path","pattern","polygon","polyline","radialgradient","rect","stop","style","switch","symbol","text","textpath","title","tref","tspan","view","vkern"]),gr=i(["feBlend","feColorMatrix","feComponentTransfer","feComposite","feConvolveMatrix","feDiffuseLighting","feDisplacementMap","feDistantLight","feDropShadow","feFlood","feFuncA","feFuncB","feFuncG","feFuncR","feGaussianBlur","feImage","feMerge","feMergeNode","feMorphology","feOffset","fePointLight","feSpecularLighting","feSpotLight","feTile","feTurbulence"]),mt=i(["animate","color-profile","cursor","discard","font-face","font-face-format","font-face-name","font-face-src","font-face-uri","foreignobject","hatch","hatchpath","mesh","meshgradient","meshpatch","meshrow","missing-glyph","script","set","solidcolor","unknown","use"]),na=i(["math","menclose","merror","mfenced","mfrac","mglyph","mi","mlabeledtr","mmultiscripts","mn","mo","mover","mpadded","mphantom","mroot","mrow","ms","mspace","msqrt","mstyle","msub","msup","msubsup","mtable","mtd","mtext","mtr","munder","munderover","mprescripts"]),ou=i(["maction","maligngroup","malignmark","mlongdiv","mscarries","mscarry","msgroup","mstack","msline","msrow","semantics","annotation","annotation-xml","mprescripts","none"]),Mo=i(["#text"]),Le=i(["accept","action","align","alt","autocapitalize","autocomplete","autopictureinpicture","autoplay","background","bgcolor","border","capture","cellpadding","cellspacing","checked","cite","class","clear","color","cols","colspan","controls","controlslist","coords","crossorigin","datetime","decoding","default","dir","disabled","disablepictureinpicture","disableremoteplayback","download","draggable","enctype","enterkeyhint","face","for","headers","height","hidden","high","href","hreflang","id","inputmode","integrity","ismap","kind","label","lang","list","loading","loop","low","max","maxlength","media","method","min","minlength","multiple","muted","name","nonce","noshade","novalidate","nowrap","open","optimum","pattern","placeholder","playsinline","poster","preload","pubdate","radiogroup","readonly","rel","required","rev","reversed","role","rows","rowspan","spellcheck","scope","selected","shape","size","sizes","span","srclang","start","src","srcset","step","style","summary","tabindex","title","translate","type","usemap","valign","value","width","xmlns","slot"]),Ar=i(["accent-height","accumulate","additive","alignment-baseline","ascent","attributename","attributetype","azimuth","basefrequency","baseline-shift","begin","bias","by","class","clip","clippathunits","clip-path","clip-rule","color","color-interpolation","color-interpolation-filters","color-profile","color-rendering","cx","cy","d","dx","dy","diffuseconstant","direction","display","divisor","dur","edgemode","elevation","end","fill","fill-opacity","fill-rule","filter","filterunits","flood-color","flood-opacity","font-family","font-size","font-size-adjust","font-stretch","font-style","font-variant","font-weight","fx","fy","g1","g2","glyph-name","glyphref","gradientunits","gradienttransform","height","href","id","image-rendering","in","in2","k","k1","k2","k3","k4","kerning","keypoints","keysplines","keytimes","lang","lengthadjust","letter-spacing","kernelmatrix","kernelunitlength","lighting-color","local","marker-end","marker-mid","marker-start","markerheight","markerunits","markerwidth","maskcontentunits","maskunits","max","mask","media","method","mode","min","name","numoctaves","offset","operator","opacity","order","orient","orientation","origin","overflow","paint-order","path","pathlength","patterncontentunits","patterntransform","patternunits","points","preservealpha","preserveaspectratio","primitiveunits","r","rx","ry","radius","refx","refy","repeatcount","repeatdur","restart","result","rotate","scale","seed","shape-rendering","specularconstant","specularexponent","spreadmethod","startoffset","stddeviation","stitchtiles","stop-color","stop-opacity","stroke-dasharray","stroke-dashoffset","stroke-linecap","stroke-linejoin","stroke-miterlimit","stroke-opacity","stroke","stroke-width","style","surfacescale","systemlanguage","tabindex","targetx","targety","transform","transform-origin","text-anchor","text-decoration","text-rendering","textlength","type","u1","u2","unicode","values","viewbox","visibility","version","vert-adv-y","vert-origin-x","vert-origin-y","width","word-spacing","wrap","writing-mode","xchannelselector","ychannelselector","x","x1","x2","xmlns","y","y1","y2","z","zoomandpan"]),ba=i(["accent","accentunder","align","bevelled","close","columnsalign","columnlines","columnspan","denomalign","depth","dir","display","displaystyle","encoding","fence","frame","height","href","id","largeop","length","linethickness","lspace","lquote","mathbackground","mathcolor","mathsize","mathvariant","maxsize","minsize","movablelimits","notation","numalign","open","rowalign","rowlines","rowspacing","rowspan","rspace","rquote","scriptlevel","scriptminsize","scriptsizemultiplier","selection","separator","separators","stretchy","subscriptshift","supscriptshift","symmetric","voffset","width","xmlns"]),Ja=i(["xlink:href","xml:id","xlink:title","xml:space","xmlns:xlink"]),Qa=f(/\{\{[\w\W]*|[\w\W]*\}\}/gm),w=f(/<%[\w\W]*|[\w\W]*%>/gm),Qn=f(/\${[\w\W]*}/gm),He=f(/^data-[\-\w.\u00B7-\uFFFF]/),jn=f(/^aria-[\-\w]+$/),on=f(/^(?:(?:(?:f|ht)tps?|mailto|tel|callto|sms|cid|xmpp):|[^a-z]|[a-z+.\-]+(?:[^a-z+.\-:]|$))/i),k=f(/^(?:\w+script|data):/i),ne=f(/[\u0000-\u0020\u00A0\u1680\u180E\u2000-\u2029\u205F\u3000]/g),Pn=f(/^html$/i);var ge=Object.freeze({__proto__:null,MUSTACHE_EXPR:Qa,ERB_EXPR:w,TMPLIT_EXPR:Qn,DATA_ATTR:He,ARIA_ATTR:jn,IS_ALLOWED_URI:on,IS_SCRIPT_OR_DATA:k,ATTR_WHITESPACE:ne,DOCTYPE_NAME:Pn});let at=function(){return typeof window>"u"?null:window},ce=function(G,$n){if(typeof G!="object"||typeof G.createPolicy!="function")return null;let q=null,B="data-tt-policy-suffix";$n&&$n.hasAttribute(B)&&(q=$n.getAttribute(B));let Cn="dompurify"+(q?"#"+q:"");try{return G.createPolicy(Cn,{createHTML(rn){return rn},createScriptURL(rn){return rn}})}catch(rn){return console.warn("TrustedTypes policy "+Cn+" could not be created."),null}};function Ie(){let Ln=arguments.length>0&&arguments[0]!==void 0?arguments[0]:at(),G=pn=>Ie(pn);if(G.version="3.0.8",G.removed=[],!Ln||!Ln.document||Ln.document.nodeType!==9)return G.isSupported=!1,G;let{document:$n}=Ln,q=$n,B=q.currentScript,{DocumentFragment:Cn,HTMLTemplateElement:rn,Node:un,Element:yn,NodeFilter:Bn,NamedNodeMap:De=Ln.NamedNodeMap||Ln.MozNamedAttrMap,HTMLFormElement:Ve,DOMParser:le,trustedTypes:Eo}=Ln,ri=yn.prototype,cf=Ta(ri,"cloneNode"),$c=Ta(ri,"nextSibling"),lf=Ta(ri,"childNodes"),ja=Ta(ri,"parentNode");if(typeof rn=="function"){let pn=$n.createElement("template");pn.content&&pn.content.ownerDocument&&($n=pn.content.ownerDocument)}let dt,ai="",{implementation:uu,createNodeIterator:nd,createDocumentFragment:oi,getElementsByTagName:iu}=$n,{importNode:qc}=q,ir={};G.isSupported=typeof n=="function"&&typeof ja=="function"&&uu&&uu.createHTMLDocument!==void 0;let{MUSTACHE_EXPR:V,ERB_EXPR:Bc,TMPLIT_EXPR:Vc,DATA_ATTR:Ea,ARIA_ATTR:Dr,IS_SCRIPT_OR_DATA:zn,ATTR_WHITESPACE:sf}=ge,{IS_ALLOWED_URI:pe}=ge,Je=null,ks=An({},[...xt,...ti,...gr,...na,...Mo]),Ke=null,Dt=An({},[...Le,...Ar,...ba,...Ja]),_e=Object.seal(l(null,{tagNameCheck:{writable:!0,configurable:!1,enumerable:!0,value:null},attributeNameCheck:{writable:!0,configurable:!1,enumerable:!0,value:null},allowCustomizedBuiltInElements:{writable:!0,configurable:!1,enumerable:!0,value:!1}})),Gt=null,Ze=null,hr=!0,Nr=!0,za=!1,$s=!0,fu=!1,Rr=!1,pf=!1,Jc=!1,Or=!1,Ga=!1,ui=!1,qs=!0,Bs=!1,ed="user-content-",Pe=!0,Co=!1,cu={},Fo=null,Qc=An({},["annotation-xml","audio","colgroup","desc","foreignobject","head","iframe","math","mi","mn","mo","ms","mtext","noembed","noframes","noscript","plaintext","script","style","svg","template","thead","title","video","xmp"]),Vs=null,Js=An({},["audio","video","img","source","image","track"]),jc=null,Qs=An({},["alt","class","for","id","label","name","pattern","placeholder","role","summary","title","value","style","xmlns"]),_f="http://www.w3.org/1998/Math/MathML",mf="http://www.w3.org/2000/svg",ea="http://www.w3.org/1999/xhtml",wo=ea,zc=!1,Gc=null,td=An({},[_f,mf,ea],E),lu=null,rd=["application/xhtml+xml","text/html"],ii="text/html",Xe=null,xo=null,fi=$n.createElement("form"),ta=function(T){return T instanceof RegExp||T instanceof Function},Yc=function(){let T=arguments.length>0&&arguments[0]!==void 0?arguments[0]:{};if(!(xo&&xo===T)){if((!T||typeof T!="object")&&(T={}),T=vr(T),lu=rd.indexOf(T.PARSER_MEDIA_TYPE)===-1?ii:T.PARSER_MEDIA_TYPE,Xe=lu==="application/xhtml+xml"?E:h,Je="ALLOWED_TAGS"in T?An({},T.ALLOWED_TAGS,Xe):ks,Ke="ALLOWED_ATTR"in T?An({},T.ALLOWED_ATTR,Xe):Dt,Gc="ALLOWED_NAMESPACES"in T?An({},T.ALLOWED_NAMESPACES,E):td,jc="ADD_URI_SAFE_ATTR"in T?An(vr(Qs),T.ADD_URI_SAFE_ATTR,Xe):Qs,Vs="ADD_DATA_URI_TAGS"in T?An(vr(Js),T.ADD_DATA_URI_TAGS,Xe):Js,Fo="FORBID_CONTENTS"in T?An({},T.FORBID_CONTENTS,Xe):Qc,Gt="FORBID_TAGS"in T?An({},T.FORBID_TAGS,Xe):{},Ze="FORBID_ATTR"in T?An({},T.FORBID_ATTR,Xe):{},cu="USE_PROFILES"in T?T.USE_PROFILES:!1,hr=T.ALLOW_ARIA_ATTR!==!1,Nr=T.ALLOW_DATA_ATTR!==!1,za=T.ALLOW_UNKNOWN_PROTOCOLS||!1,$s=T.ALLOW_SELF_CLOSE_IN_ATTR!==!1,fu=T.SAFE_FOR_TEMPLATES||!1,Rr=T.WHOLE_DOCUMENT||!1,Or=T.RETURN_DOM||!1,Ga=T.RETURN_DOM_FRAGMENT||!1,ui=T.RETURN_TRUSTED_TYPE||!1,Jc=T.FORCE_BODY||!1,qs=T.SANITIZE_DOM!==!1,Bs=T.SANITIZE_NAMED_PROPS||!1,Pe=T.KEEP_CONTENT!==!1,Co=T.IN_PLACE||!1,pe=T.ALLOWED_URI_REGEXP||on,wo=T.NAMESPACE||ea,_e=T.CUSTOM_ELEMENT_HANDLING||{},T.CUSTOM_ELEMENT_HANDLING&&ta(T.CUSTOM_ELEMENT_HANDLING.tagNameCheck)&&(_e.tagNameCheck=T.CUSTOM_ELEMENT_HANDLING.tagNameCheck),T.CUSTOM_ELEMENT_HANDLING&&ta(T.CUSTOM_ELEMENT_HANDLING.attributeNameCheck)&&(_e.attributeNameCheck=T.CUSTOM_ELEMENT_HANDLING.attributeNameCheck),T.CUSTOM_ELEMENT_HANDLING&&typeof T.CUSTOM_ELEMENT_HANDLING.allowCustomizedBuiltInElements=="boolean"&&(_e.allowCustomizedBuiltInElements=T.CUSTOM_ELEMENT_HANDLING.allowCustomizedBuiltInElements),fu&&(Nr=!1),Ga&&(Or=!0),cu&&(Je=An({},Mo),Ke=[],cu.html===!0&&(An(Je,xt),An(Ke,Le)),cu.svg===!0&&(An(Je,ti),An(Ke,Ar),An(Ke,Ja)),cu.svgFilters===!0&&(An(Je,gr),An(Ke,Ar),An(Ke,Ja)),cu.mathMl===!0&&(An(Je,na),An(Ke,ba),An(Ke,Ja))),T.ADD_TAGS&&(Je===ks&&(Je=vr(Je)),An(Je,T.ADD_TAGS,Xe)),T.ADD_ATTR&&(Ke===Dt&&(Ke=vr(Ke)),An(Ke,T.ADD_ATTR,Xe)),T.ADD_URI_SAFE_ATTR&&An(jc,T.ADD_URI_SAFE_ATTR,Xe),T.FORBID_CONTENTS&&(Fo===Qc&&(Fo=vr(Fo)),An(Fo,T.FORBID_CONTENTS,Xe)),Pe&&(Je["#text"]=!0),Rr&&An(Je,["html","head","body"]),Je.table&&(An(Je,["tbody"]),delete Gt.tbody),T.TRUSTED_TYPES_POLICY){if(typeof T.TRUSTED_TYPES_POLICY.createHTML!="function")throw En('TRUSTED_TYPES_POLICY configuration option must provide a "createHTML" hook.');if(typeof T.TRUSTED_TYPES_POLICY.createScriptURL!="function")throw En('TRUSTED_TYPES_POLICY configuration option must provide a "createScriptURL" hook.');dt=T.TRUSTED_TYPES_POLICY,ai=dt.createHTML("")}else dt===void 0&&(dt=ce(Eo,B)),dt!==null&&typeof ai=="string"&&(ai=dt.createHTML(""));i&&i(T),xo=T}},js=An({},["mi","mo","mn","ms","mtext"]),zs=An({},["foreignobject","desc","title","annotation-xml"]),ad=An({},["title","style","font","a","script"]),Gs=An({},[...ti,...gr,...mt]),Ys=An({},[...na,...ou]),od=function(T){let O=ja(T);(!O||!O.tagName)&&(O={namespaceURI:wo,tagName:"template"});let an=h(T.tagName),Me=h(O.tagName);return Gc[T.namespaceURI]?T.namespaceURI===mf?O.namespaceURI===ea?an==="svg":O.namespaceURI===_f?an==="svg"&&(Me==="annotation-xml"||js[Me]):!!Gs[an]:T.namespaceURI===_f?O.namespaceURI===ea?an==="math":O.namespaceURI===mf?an==="math"&&zs[Me]:!!Ys[an]:T.namespaceURI===ea?O.namespaceURI===mf&&!zs[Me]||O.namespaceURI===_f&&!js[Me]?!1:!Ys[an]&&(ad[an]||!Gs[an]):!!(lu==="application/xhtml+xml"&&Gc[T.namespaceURI]):!1},Lo=function(T){g(G.removed,{element:T});try{T.parentNode.removeChild(T)}catch(O){T.remove()}},ci=function(T,O){try{g(G.removed,{attribute:O.getAttributeNode(T),from:O})}catch(an){g(G.removed,{attribute:null,from:O})}if(O.removeAttribute(T),T==="is"&&!Ke[T])if(Or||Ga)try{Lo(O)}catch(an){}else try{O.setAttribute(T,"")}catch(an){}},Ks=function(T){let O=null,an=null;if(Jc)T="<remove></remove>"+T;else{let Ht=F(T,/^[\r\n\t ]+/);an=Ht&&Ht[0]}lu==="application/xhtml+xml"&&wo===ea&&(T='<html xmlns="http://www.w3.org/1999/xhtml"><head></head><body>'+T+"</body></html>");let Me=dt?dt.createHTML(T):T;if(wo===ea)try{O=new le().parseFromString(Me,lu)}catch(Ht){}if(!O||!O.documentElement){O=uu.createDocument(wo,"template",null);try{O.documentElement.innerHTML=zc?ai:Me}catch(Ht){}}let Lt=O.body||O.documentElement;return T&&an&&Lt.insertBefore($n.createTextNode(an),Lt.childNodes[0]||null),wo===ea?iu.call(O,Rr?"html":"body")[0]:Rr?O.documentElement:Lt},Kc=function(T){return nd.call(T.ownerDocument||T,T,Bn.SHOW_ELEMENT|Bn.SHOW_COMMENT|Bn.SHOW_TEXT,null)},ud=function(T){return T instanceof Ve&&(typeof T.nodeName!="string"||typeof T.textContent!="string"||typeof T.removeChild!="function"||!(T.attributes instanceof De)||typeof T.removeAttribute!="function"||typeof T.setAttribute!="function"||typeof T.namespaceURI!="string"||typeof T.insertBefore!="function"||typeof T.hasChildNodes!="function")},Zs=function(T){return typeof un=="function"&&T instanceof un},Ca=function(T,O,an){ir[T]&&m(ir[T],Me=>{Me.call(G,O,an,xo)})},Xs=function(T){let O=null;if(Ca("beforeSanitizeElements",T,null),ud(T))return Lo(T),!0;let an=Xe(T.nodeName);if(Ca("uponSanitizeElement",T,{tagName:an,allowedTags:Je}),T.hasChildNodes()&&!Zs(T.firstElementChild)&&Rn(/<[/\w]/g,T.innerHTML)&&Rn(/<[/\w]/g,T.textContent))return Lo(T),!0;if(!Je[an]||Gt[an]){if(!Gt[an]&&ep(an)&&(_e.tagNameCheck instanceof RegExp&&Rn(_e.tagNameCheck,an)||_e.tagNameCheck instanceof Function&&_e.tagNameCheck(an)))return!1;if(Pe&&!Fo[an]){let Me=ja(T)||T.parentNode,Lt=lf(T)||T.childNodes;if(Lt&&Me){let Ht=Lt.length;for(let It=Ht-1;It>=0;--It)Me.insertBefore(cf(Lt[It],!0),$c(T))}}return Lo(T),!0}return T instanceof yn&&!od(T)||(an==="noscript"||an==="noembed"||an==="noframes")&&Rn(/<\/no(script|embed|frames)/i,T.innerHTML)?(Lo(T),!0):(fu&&T.nodeType===3&&(O=T.textContent,m([V,Bc,Vc],Me=>{O=W(O,Me," ")}),T.textContent!==O&&(g(G.removed,{element:T.cloneNode()}),T.textContent=O)),Ca("afterSanitizeElements",T,null),!1)},np=function(T,O,an){if(qs&&(O==="id"||O==="name")&&(an in $n||an in fi))return!1;if(!(Nr&&!Ze[O]&&Rn(Ea,O))){if(!(hr&&Rn(Dr,O))){if(!Ke[O]||Ze[O]){if(!(ep(T)&&(_e.tagNameCheck instanceof RegExp&&Rn(_e.tagNameCheck,T)||_e.tagNameCheck instanceof Function&&_e.tagNameCheck(T))&&(_e.attributeNameCheck instanceof RegExp&&Rn(_e.attributeNameCheck,O)||_e.attributeNameCheck instanceof Function&&_e.attributeNameCheck(O))||O==="is"&&_e.allowCustomizedBuiltInElements&&(_e.tagNameCheck instanceof RegExp&&Rn(_e.tagNameCheck,an)||_e.tagNameCheck instanceof Function&&_e.tagNameCheck(an))))return!1}else if(!jc[O]){if(!Rn(pe,W(an,sf,""))){if(!((O==="src"||O==="xlink:href"||O==="href")&&T!=="script"&&sn(an,"data:")===0&&Vs[T])){if(!(za&&!Rn(zn,W(an,sf,"")))){if(an)return!1}}}}}}return!0},ep=function(T){return T.indexOf("-")>0},tp=function(T){Ca("beforeSanitizeAttributes",T,null);let{attributes:O}=T;if(!O)return;let an={attrName:"",attrValue:"",keepAttr:!0,allowedAttributes:Ke},Me=O.length;for(;Me--;){let Lt=O[Me],{name:Ht,namespaceURI:It,value:Fa}=Lt,li=Xe(Ht),Wt=Ht==="value"?Fa:wn(Fa);if(an.attrName=li,an.attrValue=Wt,an.keepAttr=!0,an.forceKeepAttr=void 0,Ca("uponSanitizeAttribute",T,an),Wt=an.attrValue,an.forceKeepAttr||(ci(Ht,T),!an.keepAttr))continue;if(!$s&&Rn(/\/>/i,Wt)){ci(Ht,T);continue}fu&&m([V,Bc,Vc],rp=>{Wt=W(Wt,rp," ")});let Zc=Xe(T.nodeName);if(np(Zc,li,Wt)){if(Bs&&(li==="id"||li==="name")&&(ci(Ht,T),Wt=ed+Wt),dt&&typeof Eo=="object"&&typeof Eo.getAttributeType=="function"&&!It)switch(Eo.getAttributeType(Zc,li)){case"TrustedHTML":{Wt=dt.createHTML(Wt);break}case"TrustedScriptURL":{Wt=dt.createScriptURL(Wt);break}}try{It?T.setAttributeNS(It,Ht,Wt):T.setAttribute(Ht,Wt),v(G.removed)}catch(rp){}}}Ca("afterSanitizeAttributes",T,null)},id=function pn(T){let O=null,an=Kc(T);for(Ca("beforeSanitizeShadowDOM",T,null);O=an.nextNode();)Ca("uponSanitizeShadowNode",O,null),!Xs(O)&&(O.content instanceof Cn&&pn(O.content),tp(O));Ca("afterSanitizeShadowDOM",T,null)};return G.sanitize=function(pn){let T=arguments.length>1&&arguments[1]!==void 0?arguments[1]:{},O=null,an=null,Me=null,Lt=null;if(zc=!pn,zc&&(pn="<!-->"),typeof pn!="string"&&!Zs(pn))if(typeof pn.toString=="function"){if(pn=pn.toString(),typeof pn!="string")throw En("dirty is not a string, aborting")}else throw En("toString is not a function");if(!G.isSupported)return pn;if(pf||Yc(T),G.removed=[],typeof pn=="string"&&(Co=!1),Co){if(pn.nodeName){let Fa=Xe(pn.nodeName);if(!Je[Fa]||Gt[Fa])throw En("root node is forbidden and cannot be sanitized in-place")}}else if(pn instanceof un)O=Ks("<!---->"),an=O.ownerDocument.importNode(pn,!0),an.nodeType===1&&an.nodeName==="BODY"||an.nodeName==="HTML"?O=an:O.appendChild(an);else{if(!Or&&!fu&&!Rr&&pn.indexOf("<")===-1)return dt&&ui?dt.createHTML(pn):pn;if(O=Ks(pn),!O)return Or?null:ui?ai:""}O&&Jc&&Lo(O.firstChild);let Ht=Kc(Co?pn:O);for(;Me=Ht.nextNode();)Xs(Me)||(Me.content instanceof Cn&&id(Me.content),tp(Me));if(Co)return pn;if(Or){if(Ga)for(Lt=oi.call(O.ownerDocument);O.firstChild;)Lt.appendChild(O.firstChild);else Lt=O;return(Ke.shadowroot||Ke.shadowrootmode)&&(Lt=qc.call(q,Lt,!0)),Lt}let It=Rr?O.outerHTML:O.innerHTML;return Rr&&Je["!doctype"]&&O.ownerDocument&&O.ownerDocument.doctype&&O.ownerDocument.doctype.name&&Rn(Pn,O.ownerDocument.doctype.name)&&(It="<!DOCTYPE "+O.ownerDocument.doctype.name+`>
-`+It),fu&&m([V,Bc,Vc],Fa=>{It=W(It,Fa," ")}),dt&&ui?dt.createHTML(It):It},G.setConfig=function(){let pn=arguments.length>0&&arguments[0]!==void 0?arguments[0]:{};Yc(pn),pf=!0},G.clearConfig=function(){xo=null,pf=!1},G.isValidAttribute=function(pn,T,O){xo||Yc({});let an=Xe(pn),Me=Xe(T);return np(an,Me,O)},G.addHook=function(pn,T){typeof T=="function"&&(ir[pn]=ir[pn]||[],g(ir[pn],T))},G.removeHook=function(pn){if(ir[pn])return v(ir[pn])},G.removeHooks=function(pn){ir[pn]&&(ir[pn]=[])},G.removeAllHooks=function(){ir={}},G}var Ma=Ie();return Ma})});function sy(n,e,t,a,u){return function(i,f){var l=n.newXHR(),p=n.fixupUrl(u.url,l);if(l.open(u.method||"GET",p,!0,u.username,u.password),u.headers)try{for(var d=0,m;(m=u.headers[d])!=null;d++)l.setRequestHeader(m.field,m.value)}catch(g){i(g)}var v=function(g){return function(){i(new Error(g))}};return l.onerror=v(t),l.ontimeout=v(e),l.onload=function(){f({status:l.status,statusText:l.statusText,headers:l.getAllResponseHeaders().split(`\r
-`).filter(function(g){return g.length>0}).map(function(g){var h=g.indexOf(":");return a(g.substring(0,h))(g.substring(h+2))}),body:l.response})},l.responseType=u.responseType,l.withCredentials=u.withCredentials,l.timeout=u.timeout,l.send(u.content),function(g,h,E){try{l.abort()}catch(F){return h(F)}return E()}}}var py=function(n){return function(e){for(var t=e.length,a=new Array(t),u=0;u<t;u++)a[u]=n(e[u]);return a}};var Tf={compose:function(n){return function(e){return function(t){return n(e(t))}}}},bf=function(n){return n.compose};var fn=function(n){return n.identity},cn={identity:function(n){return n},Semigroupoid0:function(){return Tf}};var ct=!0;var Cd=function(n){return function(e){return function(t){return function(a){return n(e(t))(e(a))}}}},ee=function(n){return function(e){return function(t){return n(t)(e)}}},$=function(n){return function(e){return n}};var he=function(){function n(){}return n.value=new n,n}();var M=function(n){return n.map},_i=function(n){var e=M(n);return function(t){return function(a){return e(a)(t)}}},qn=function(n){return M(n)($(void 0))},tl=function(n){var e=M(n);return function(t){return function(a){return e($(a))(t)}}};var Ae={map:py};var _y=function(n){return function(e){return n+e}},my=function(n){return function(e){return n.length===0?e:e.length===0?n:n.concat(e)}};var lt=function(n){return n.reflectSymbol};var mi=function(n){var e=function(t){var a;function u(i){t=i}for(;;)a=u(t);return a};return e(n)};var ra=function(n){return function(e){return e[n]}};var vy={append:_y};var cr={append:my};var mn=function(n){return n.append};var ht=function(n){return n.alt};var gy=function(n){return function(e){for(var t=n.length,a=e.length,u=new Array(t*a),i=0,f=0;f<t;f++)for(var l=n[f],p=0;p<a;p++)u[i++]=l(e[p]);return u}};var UI=fn(cn);var dp={apply:gy,Functor0:function(){return Ae}},oe=function(n){return n.apply};var al=function(n){var e=oe(n),t=M(n.Functor0());return function(a){return function(u){return e(t($(UI))(a))(u)}}},yt=function(n){var e=oe(n),t=M(n.Functor0());return function(a){return function(u){return function(i){return e(t(a)(u))(i)}}}};var S=function(n){return n.pure},ol=function(n){var e=S(n);return function(t){return function(a){if(!t)return a;if(t)return e(void 0);throw new Error("Failed pattern match at Control.Applicative (line 68, column 1 - line 68, column 65): "+[t.constructor.name,a.constructor.name])}}},aa=function(n){var e=S(n);return function(t){return function(a){if(t)return a;if(!t)return e(void 0);throw new Error("Failed pattern match at Control.Applicative (line 63, column 1 - line 63, column 63): "+[t.constructor.name,a.constructor.name])}}},ul=function(n){var e=oe(n.Apply0()),t=S(n);return function(a){return function(u){return e(t(a))(u)}}};var Dy="\uFFFF",hy="\0",$I=Number.POSITIVE_INFINITY,qI=Number.NEGATIVE_INFINITY;var wd=function(n){return function(e){return function(t){return function(a){return function(u){return a<u?n:a===u?e:t}}}}};var yy=wd;var Ty=wd,by=wd;var xd=function(n){return function(e){return n===e}};var My=xd;var Ey=xd,Cy=xd,Fy=function(n){return function(e){return function(t){if(e.length!==t.length)return!1;for(var a=0;a<e.length;a++)if(!n(e[a])(t[a]))return!1;return!0}}};var wy={eq:function(n){return function(e){return!0}}},lr={eq:Cy};var vp={eq:My},xy={eq:Ey};var gn=function(n){return n.eq};var Mf=function(n){return{eq:Fy(gn(n))}};var X=function(){function n(){}return n.value=new n,n}(),Y=function(){function n(){}return n.value=new n,n}(),Dn=function(){function n(){}return n.value=new n,n}();var vi={eq:function(n){return function(e){return n instanceof X&&e instanceof X||n instanceof Y&&e instanceof Y||n instanceof Dn&&e instanceof Dn}}};var Ly=function(n){return function(e){return n-e|0}};var Hy=function(n){return function(e){return n+e|0}},Iy=function(n){return function(e){return n*e|0}};var gp={add:Hy,zero:0,mul:Iy,one:1};var Ld={sub:Ly,Semiring0:function(){return gp}};var Ef={compare:function(n){return function(e){return Dn.value}},Eq0:function(){return wy}},ut=function(){return{compare:Ty(X.value)(Dn.value)(Y.value),Eq0:function(){return lr}}}();var Tt=function(){return{compare:yy(X.value)(Dn.value)(Y.value),Eq0:function(){return vp}}}(),Dp=function(){return{compare:by(X.value)(Dn.value)(Y.value),Eq0:function(){return xy}}}();var ln=function(n){return n.compare};var hp=function(n){var e=ln(n);return function(t){return function(a){return function(u){return e(t(a))(t(u))}}}};var Ha=function(n){return n.top};var Di={top:Dy,bottom:hy,Ord0:function(){return Dp}};var Ia=function(n){return n.bottom};var Ny=function(n){return n.toString()},Ry=function(n){var e=n.toString();return isNaN(e+".0")?e:e+".0"};var Oy=function(n){var e=n.length;return'"'+n.replace(/[\0-\x1F\x7F"\\]/g,function(t,a){switch(t){case'"':case"\\":return"\\"+t;case"\x07":return"\\a";case"\b":return"\\b";case"\f":return"\\f";case`
-`:return"\\n";case"\r":return"\\r";case"	":return"\\t";case"\v":return"\\v"}var u=a+1,i=u<e&&n[u]>="0"&&n[u]<="9"?"\\&":"";return"\\"+t.charCodeAt(0).toString(10)+i})+'"'};var Za={show:Oy};var yp={show:Ry},Wr={show:Ny};var _n=function(n){return n.show};var tS=fn(cn),b=function(){function n(){}return n.value=new n,n}(),y=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}();var Jn=function(n){return function(e){return function(t){if(t instanceof b)return n;if(t instanceof y)return e(t.value0);throw new Error("Failed pattern match at Data.Maybe (line 237, column 1 - line 237, column 51): "+[n.constructor.name,e.constructor.name,t.constructor.name])}}},Wo=Jn(!0)($(!1)),Ur=Jn(!1)($(!0));var ie={map:function(n){return function(e){return e instanceof y?new y(n(e.value0)):b.value}}},rS=M(ie);var Ne=function(n){return Jn(n)(tS)},oa=function(){return function(n){if(n instanceof y)return n.value0;throw new Error("Failed pattern match at Data.Maybe (line 288, column 1 - line 288, column 46): "+[n.constructor.name])}};var vu={apply:function(n){return function(e){if(n instanceof y)return rS(n.value0)(e);if(n instanceof b)return b.value;throw new Error("Failed pattern match at Data.Maybe (line 67, column 1 - line 69, column 30): "+[n.constructor.name,e.constructor.name])}},Functor0:function(){return ie}};var At={bind:function(n){return function(e){if(n instanceof y)return e(n.value0);if(n instanceof b)return b.value;throw new Error("Failed pattern match at Data.Maybe (line 125, column 1 - line 127, column 28): "+[n.constructor.name,e.constructor.name])}},Apply0:function(){return vu}};var gu=function(){return{pure:y.create,Apply0:function(){return vu}}}();var Cf="application/json",Tp="application/x-www-form-urlencoded";var Py=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Wy=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Uy=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Sd=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),ky=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),il=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Ad=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),$y=function(n){return n instanceof il?new y(Tp):n instanceof Ad?new y(Cf):b.value},qy=function(){return Sd.create}();var x=function(n){return n};var bp=function(){return x};var Jy=bp();var kt=function(){return Jy};var fl=function(){return function(){return function(){return function(){return function(n){return Jy}}}}};var Qy=kt();var Mp=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),yi=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Ep=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),jy=function(n){if(n instanceof Mp||n instanceof yi)return Qy(n.value0);if(n instanceof Ep)return n.value1;throw new Error("Failed pattern match at Affjax.RequestHeader (line 26, column 1 - line 26, column 33): "+[n.constructor.name])};var Rd=function(n){if(n instanceof Mp)return"Accept";if(n instanceof yi)return"Content-Type";if(n instanceof Ep)return n.value0;throw new Error("Failed pattern match at Affjax.RequestHeader (line 21, column 1 - line 21, column 32): "+[n.constructor.name])};var Od=fn(cn),Pd=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Wd=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Ud=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),cl=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Cp=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Fp=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Gy=function(n){if(n instanceof Pd)return"arraybuffer";if(n instanceof Wd)return"blob";if(n instanceof Ud)return"document";if(n instanceof cl||n instanceof Cp)return"text";if(n instanceof Fp)return"";throw new Error("Failed pattern match at Affjax.ResponseFormat (line 44, column 3 - line 50, column 19): "+[n.constructor.name])},Yy=function(n){return n instanceof cl?new y(Cf):b.value},wp=function(){return new Cp(Od)}(),Ky=function(){return new cl(Od)}(),Xa=function(){return new Fp(Od)}();var Xy=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}();var nT=function(n){return function(e){for(var t=[],a=0,u=n.length;a<u;a++)Array.prototype.push.apply(t,e(n[a]));return t}};var fS=fn(cn),ke=function(n){return n.discard};var xp={bind:nT,Apply0:function(){return dp}},J=function(n){return n.bind},fe=function(n){return ee(J(n))},Du=function(n){var e=fe(n);return function(t){return function(a){return function(u){return e(t)(a(u))}}}},eT=function(n){var e=J(n);return function(t){return function(a){return function(u){return e(t(u))(a)}}}};var $e={discard:function(n){return J(n)}};var Lp=function(n){var e=J(n);return function(t){return e(t)(fS)}};var z=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Q=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}();var kd=function(n){return Jn(new z(n))(Q.create)};var hu={map:function(n){return function(e){if(e instanceof z)return new z(e.value0);if(e instanceof Q)return new Q(n(e.value0));throw new Error("Failed pattern match at Data.Either (line 0, column 0 - line 0, column 0): "+[e.constructor.name])}}},cS=M(hu);var st=function(n){return function(e){return function(t){if(t instanceof z)return n(t.value0);if(t instanceof Q)return e(t.value0);throw new Error("Failed pattern match at Data.Either (line 208, column 1 - line 208, column 64): "+[n.constructor.name,e.constructor.name,t.constructor.name])}}},Ff=function(){return st($(b.value))(y.create)}();var tT={apply:function(n){return function(e){if(n instanceof z)return new z(n.value0);if(n instanceof Q)return cS(n.value0)(e);throw new Error("Failed pattern match at Data.Either (line 70, column 1 - line 72, column 30): "+[n.constructor.name,e.constructor.name])}},Functor0:function(){return hu}};var $d=function(){return{pure:Q.create,Apply0:function(){return tT}}}();var qd=function(n){return function(){return n}},rT=function(n){return function(e){return function(){return e(n())()}}};var oT=function(n){var e=J(n.Bind1()),t=aa(n.Applicative0());return function(a){return function(u){return e(a)(function(i){return t(i)(u)})}}},uT=function(n){var e=J(n.Bind1()),t=ol(n.Applicative0());return function(a){return function(u){return e(a)(function(i){return t(i)(u)})}}};var Tr=function(n){var e=J(n.Bind1()),t=S(n.Applicative0());return function(a){return function(u){return e(a)(function(i){return e(u)(function(f){return t(i(f))})})}}};var iT=function(n){return Math.min(Math.abs(n),2147483647)},fT=function(n){return function(e){return e===0?0:e>0?Math.floor(n/e):-Math.floor(n/-e)}},cT=function(n){return function(e){if(e===0)return 0;var t=Math.abs(e);return(n%t+t)%t}};var lT={Ring0:function(){return Ld}};var Hp=function(n){return n.mod};var Ip={degree:iT,div:fT,mod:cT,CommutativeRing0:function(){return lT}},ll=function(n){return n.div};var Sa={mempty:"",Semigroup0:function(){return vy}};var Uo={mempty:[],Semigroup0:function(){return cr}};var Zn=function(n){return n.mempty};var no=function(n){var e=Zn(n);return function(t){return function(a){if(t)return a;if(!t)return e;throw new Error("Failed pattern match at Data.Monoid (line 96, column 1 - line 96, column 49): "+[t.constructor.name,a.constructor.name])}}};var sT=function(n,e,t){var a=0,u;return function(i){if(a===2)return u;if(a===1)throw new ReferenceError(n+" was needed before it finished initializing (module "+e+", line "+i+")",e,i);return a=1,u=t(),a=2,u}},Aa={Applicative0:function(){return Ee},Bind1:function(){return nt}},nt={bind:rT,Apply0:function(){return Vd(0)}},Ee={pure:qd,Apply0:function(){return Vd(0)}},pT=sT("functorEffect","Effect",function(){return{map:ul(Ee)}}),Vd=sT("applyEffect","Effect",function(){return{apply:Tr(Aa),Functor0:function(){return pT(0)}}}),On=pT(20),_T=Vd(23),vS=yt(_T),Jd=function(n){return{append:vS(mn(n))}},Ap=function(n){var e=Jd(n.Semigroup0());return{mempty:qd(Zn(n)),Semigroup0:function(){return e}}};function eo(n){return new Error(n)}function wf(n){return n.message}function yu(n){return function(){throw n}}var dT=function(n){return yu(eo(n))};var br=function(n){return n.throwError};var to=function(n){return n.catchError};var sl=function(n){var e=to(n),t=n.MonadThrow0().Monad0(),a=M(t.Bind1().Apply0().Functor0()),u=S(t.Applicative0());return function(i){return e(a(Q.create)(i))(function(f){return u(z.create(f))})}};var ko=function(n){return n};var Tu={map:function(n){return function(e){return n(e)}}};var gT={apply:function(n){return function(e){return n(e)}},Functor0:function(){return Tu}},yS={bind:function(n){return function(e){return e(n)}},Apply0:function(){return gT}},jd={pure:ko,Apply0:function(){return gT}},$t={Applicative0:function(){return jd},Bind1:function(){return yS}};var DT=function(n){return function(){return{value:n}}};var hn=function(n){return function(){return n.value}},hT=function(n){return function(e){return function(){var t=n(e.value);return e.value=t.state,t.value}}},ve=function(n){return function(e){return function(){e.value=n}}};var bS=qn(On),qe=DT,zd=hT,yT=function(n){return zd(function(e){var t=n(e);return{state:t,value:t}})},kr=function(n){return function(e){return bS(yT(n)(e))}};var ES=fe(nt),CS=M(On),qt=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Nt=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),ia=function(n){return n.tailRecM};var TT={tailRecM:function(n){return function(e){var t=function(a){if(a instanceof Nt)return a.value0;throw new Error("Failed pattern match at Control.Monad.Rec.Class (line 137, column 30 - line 137, column 44): "+[a.constructor.name])};return function(){var u=ES(qe)(n(e))();return function(){for(;!function(){var f=hn(u)();if(f instanceof qt){var l=n(f.value0)();return ve(l)(u)(),!1}if(f instanceof Nt)return!0;throw new Error("Failed pattern match at Control.Monad.Rec.Class (line 128, column 22 - line 133, column 28): "+[f.constructor.name])}(););return{}}(),CS(t)(hn(u))()}}},Monad0:function(){return Aa}};var bT=function(n){return function(e){return n&&e}},MT=function(n){return function(e){return n||e}},ET=function(n){return!n};var _l=function(n){return n.tt};var Mu=function(n){return n.not};var Yd=function(n){return n.implies};var Lf=function(n){return n.ff};var Eu=function(n){return n.disj},ro={ff:!1,tt:!0,implies:function(n){return function(e){return Eu(ro)(Mu(ro)(n))(e)}},conj:bT,disj:MT,not:ET};var Hf=function(n){return n.conj},Kd=function(n){var e=Lf(n),t=_l(n),a=Yd(n),u=Hf(n),i=Eu(n),f=Mu(n);return{ff:function(l){return e},tt:function(l){return t},implies:function(l){return function(p){return function(d){return a(l(d))(p(d))}}},conj:function(l){return function(p){return function(d){return u(l(d))(p(d))}}},disj:function(l){return function(p){return function(d){return i(l(d))(p(d))}}},not:function(l){return function(p){return f(l(p))}}}};var nn=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),If=function(n){return function(e){return n(e.value0)(e.value1)}};var Re=function(n){return n.value1};var $o={map:function(n){return function(e){return new nn(e.value0,n(e.value1))}}};var Ce=function(n){return n.value0};var FT=function(n){var e=gn(n);return function(t){var a=gn(t);return{eq:function(u){return function(i){return e(u.value0)(i.value0)&&a(u.value1)(i.value1)}}}}},ml=function(n){var e=ln(n),t=FT(n.Eq0());return function(a){var u=ln(a),i=t(a.Eq0());return{compare:function(f){return function(l){var p=e(f.value0)(l.value0);return p instanceof X?X.value:p instanceof Y?Y.value:u(f.value1)(l.value1)}},Eq0:function(){return i}}}};var ao=function(n){return n.state};var pr=function(n){var e=ao(n);return function(t){return e(function(a){return new nn(void 0,t(a))})}},Sf=function(n){var e=ao(n);return function(t){return e(function(a){var u=t(a);return new nn(u,u)})}},Oa=function(n){var e=ao(n);return function(t){return e(function(a){return new nn(t(a),a)})}},dl=function(n){return ao(n)(function(e){return new nn(e,e)})};var Af={liftEffect:fn(cn),Monad0:function(){return Aa}},Gn=function(n){return n.liftEffect};var wS=M(hu);var Op=function(n){return n};var Pp=function(n){return n};var yl=function(n){return function(e){return n(e)}},Tl=function(n){var e=M(n);return{map:function(t){return yl(e(wS(t)))}}};var wT=function(n){return{Applicative0:function(){return uo(n)},Bind1:function(){return bi(n)}}},bi=function(n){var e=J(n.Bind1()),t=S(n.Applicative0());return{bind:function(a){return function(u){return e(a)(st(function(i){return t(z.create(i))})(function(i){var f=u(i);return f}))}},Apply0:function(){return Zd(n)}}},Zd=function(n){var e=Tl(n.Bind1().Apply0().Functor0());return{apply:Tr(wT(n)),Functor0:function(){return e}}},uo=function(n){return{pure:function(){var e=S(n.Applicative0());return function(t){return Op(e(Q.create(t)))}}(),Apply0:function(){return Zd(n)}}};var xT=function(n){var e=wT(n);return{throwError:function(){var t=S(n.Applicative0());return function(a){return Op(t(z.create(a)))}}(),Monad0:function(){return e}}};var Xd=function(n){var e=mn(n);return function(t){var a=t.Bind1(),u=J(a),i=S(t.Applicative0()),f=Tl(a.Apply0().Functor0());return{alt:function(l){return function(p){return u(l)(function(d){if(d instanceof Q)return i(new Q(d.value0));if(d instanceof z)return u(p)(function(m){if(m instanceof Q)return i(new Q(m.value0));if(m instanceof z)return i(new z(e(d.value0)(m.value0)));throw new Error("Failed pattern match at Control.Monad.Except.Trans (line 86, column 9 - line 88, column 49): "+[m.constructor.name])});throw new Error("Failed pattern match at Control.Monad.Except.Trans (line 82, column 5 - line 88, column 49): "+[d.constructor.name])})}},Functor0:function(){return f}}}};var HS=kt();var Mi=function(n){return HS(Pp(n))};function nv(n){return JSON.stringify(n)}var Ei={};function LT(n,e,t,a){return t in a?e(a[t]):n}function bl(n){return function(e){var t=[];for(var a in e)hasOwnProperty.call(e,a)&&t.push(n(a)(e[a]));return t}}var SS=Object.keys||bl(function(n){return function(){return n}});var PS=function(n,e){if(n<1)return[];var t=new Array(n);return t.fill(e)},WS=function(n,e){for(var t=[],a=0,u=0;u<n;u++)t[a++]=e;return t},US=typeof Array.prototype.fill=="function"?PS:WS;var fa=function(n){return n.length};var NT=function(n,e,t,a){for(var u=0,i=a.length;u<i;u++)if(t(a[u]))return n(u);return e};var RT=function(n,e,t,a){if(t<0||t>=a.length)return e;var u=a.slice();return u.splice(t,1),n(u)};var Up=function(n){if(n.length<=1e4)return Array.prototype.concat.apply([],n);for(var e=[],t=0,a=n.length;t<a;t++)for(var u=n[t],i=0,f=u.length;i<f;i++)e.push(u[i]);return e},OT=function(n,e){return e.filter(n)};var PT=function(){function n(e,t,a,u,i,f){var l,p,d,m,v,g,h;for(l=i+(f-i>>1),l-i>1&&n(e,t,u,a,i,l),f-l>1&&n(e,t,u,a,l,f),p=i,d=l,m=i;p<l&&d<f;)v=u[p],g=u[d],h=t(e(v)(g)),h>0?(a[m++]=g,++d):(a[m++]=v,++p);for(;p<l;)a[m++]=u[p++];for(;d<f;)a[m++]=u[d++]}return function(e,t,a){var u;return a.length<2?a:(u=a.slice(0),n(e,t,u,a.slice(0),0,a.length),u)}}(),WT=function(n,e,t){return t.slice(n,e)};var UT=function(n,e){return n[e]};function $S(n){return n}var kT=$S;function qS(n){return n.slice()}var $T=qS;var qT=function(n,e){return e.push(n)};var kp=function(e){return function(t){return function(){return e(t)}}},ev=function(e){return function(t){return function(a){return function(){return e(t,a)}}}};var BT=kp(kT);var GS=kp($T),VT=function(n){return function(e){return function(){var a=GS(e)();return n(a)(),BT(a)()}}};var tv=ev(qT);var jT=function(n){return function(e){return function(t){for(var a=e,u=t.length,i=u-1;i>=0;i--)a=n(t[i])(a);return a}}},zT=function(n){return function(e){return function(t){for(var a=e,u=t.length,i=0;i<u;i++)a=n(a)(t[i]);return a}}};var Kt=function(n){return n.empty};var Bo=function(n){return n.bimap};var Vp=function(n){return n};var oA=function(n){var e=Eu(n);return{append:function(t){return function(a){return e(t)(a)}}}};var iv=function(n){var e=oA(n);return{mempty:Lf(n),Semigroup0:function(){return e}}};var nb=gn(vi);var lA=fl()()()(),Zt=function(n){return n.foldr};var et=function(n){var e=al(n.Apply0()),t=S(n);return function(a){var u=Zt(a);return function(i){return u(function(f){return e(i(f))})(t(void 0))}}},wi=function(n){var e=et(n);return function(t){return ee(e(t))}};var Mt=function(n){return n.foldl};var Of=function(n){var e=Mt(n);return function(t){var a=mn(t.Semigroup0()),u=Zn(t);return function(i){return function(f){var l=function(p){return function(d){return p.init?{init:!1,acc:d}:{init:!1,acc:a(p.acc)(a(i)(d))}}};return e(l)({init:!0,acc:u})(f).acc}}}};var eb=function(n){var e=Mt(n);return function(t){var a=function(u){return function(i){if(u instanceof b)return new y(i);if(u instanceof y)return new y(function(){var f=nb(t(u.value0)(i))(Y.value);return f?u.value0:i}());throw new Error("Failed pattern match at Data.Foldable (line 441, column 3 - line 441, column 27): "+[u.constructor.name,i.constructor.name])}};return e(a)(b.value)}},cv=function(n){var e=ln(n);return function(t){return eb(t)(e)}},tb=function(n){var e=Mt(n);return function(t){var a=function(u){return function(i){if(u instanceof b)return new y(i);if(u instanceof y)return new y(function(){var f=nb(t(u.value0)(i))(X.value);return f?u.value0:i}());throw new Error("Failed pattern match at Data.Foldable (line 454, column 3 - line 454, column 27): "+[u.constructor.name,i.constructor.name])}};return e(a)(b.value)}},lv=function(n){var e=ln(n);return function(t){return tb(t)(e)}};var gt={foldr:function(n){return function(e){return function(t){if(t instanceof b)return e;if(t instanceof y)return n(t.value0)(e);throw new Error("Failed pattern match at Data.Foldable (line 138, column 1 - line 144, column 27): "+[n.constructor.name,e.constructor.name,t.constructor.name])}}},foldl:function(n){return function(e){return function(t){if(t instanceof b)return e;if(t instanceof y)return n(e)(t.value0);throw new Error("Failed pattern match at Data.Foldable (line 138, column 1 - line 144, column 27): "+[n.constructor.name,e.constructor.name,t.constructor.name])}}},foldMap:function(n){var e=Zn(n);return function(t){return function(a){if(a instanceof b)return e;if(a instanceof y)return t(a.value0);throw new Error("Failed pattern match at Data.Foldable (line 138, column 1 - line 144, column 27): "+[t.constructor.name,a.constructor.name])}}}};var rb=function(n){var e=Zt(n);return function(t){var a=mn(t.Semigroup0()),u=Zn(t);return function(i){return e(function(f){return function(l){return a(i(f))(l)}})(u)}}},Rt={foldr:jT,foldl:zT,foldMap:function(n){return rb(Rt)(n)}};var qr=function(n){return n.foldMap};var Pf=function(n){var e=qr(n);return function(t){return lA(Vp)(e(iv(t)))}};var Wf=function(n){return function(e){return function(t){return n(e,t)}}},Cu=function(n){return function(e){return function(t){return function(a){return n(e,t,a)}}}},Uf=function(n){return function(e){return function(t){return function(a){return function(u){return n(e,t,a,u)}}}}};var ib=function(){function n(u){return[u]}function e(u){return function(i){return[u,i]}}function t(u){return function(i){return function(f){return[u,i,f]}}}function a(u){return function(i){return u.concat(i)}}return function(u){return function(i){return function(f){return function(l){return function(p){function d(m,v){switch(v-m){case 0:return f([]);case 1:return i(n)(l(p[m]));case 2:return u(i(e)(l(p[m])))(l(p[m+1]));case 3:return u(u(i(t)(l(p[m])))(l(p[m+1])))(l(p[m+2]));default:var g=m+Math.floor((v-m)/4)*2;return u(i(a)(d(m,g)))(d(g,v))}}return d(0,p.length)}}}}}}();var jA=fn(cn),Xt=function(n){return n.traverse};var hb=function(n){var e=Xt(n);return function(t){return e(t)(jA)}},qf={traverse:function(n){var e=n.Apply0();return ib(oe(e))(M(e.Functor0()))(S(n))},sequence:function(n){return hb(qf)(n)},Functor0:function(){return Ae},Foldable1:function(){return Rt}};var yb=function(n){return function(e){return function(t){return function(a){return function(u){return function(i){for(var f=[],l=i;;){var p=u(l);if(n(p))return f;var d=e(p);f.push(t(d)),l=a(d)}}}}}}};var Tb=function(n){return function(e){return function(t){return function(a){return function(u){return function(i){for(var f=[],l=i;;){var p=u(l);f.push(t(p));var d=a(p);if(n(d))return f;l=e(d)}}}}}}};var rN=oa();var vv={unfoldr1:Tb(Wo)(rN)(Ce)(Re)};var oN=oa(),Vo=function(n){return n.unfoldr};var wl={unfoldr:yb(Wo)(oN)(Ce)(Re),Unfoldable10:function(){return vv}};var fN=Of(Rt);var cN=M(ie);var lN=oa();var sN=qr(Rt);var pN=mn(cr);var Eb=function(){return Wf(UT)},Cb=Eb();var Dv=function(n){var e=Vo(n);return function(t){var a=fa(t),u=function(i){if(i<a)return new y(new nn(Cb(t)(i),i+1|0));if(ct)return b.value;throw new Error("Failed pattern match at Data.Array (line 163, column 3 - line 165, column 26): "+[i.constructor.name])};return e(u)(0)}};var hv=function(n){return Cu(PT)(n)(function(e){if(e instanceof Y)return 1;if(e instanceof Dn)return 0;if(e instanceof X)return-1;throw new Error("Failed pattern match at Data.Array (line 897, column 38 - line 900, column 11): "+[e.constructor.name])})};var yv=function(n){return function(e){return VT(tv(e))(n)()}},Fb=Cu(WT);var wb=function(n){return[n]};var xb=function(n){return fa(n)===0};var Lb=function(n){return fN(n)};var Zp=function(n){return sN(n)};var Xp=function(){return Uf(NT)(y.create)(b.value)}(),Tv=function(n){return function(e){return cN(Cb(e))(Xp(n)(e))}},xl=Wf(OT);var Hb=function(n){var e=gn(n);return function(t){return Xp(function(a){return e(a)(t)})}},bv=function(n){var e=Hb(n);return function(t){return function(a){return Wo(e(t)(a))}}};var Ll=function(n){return function(e){var t=n<1;return t?e:Fb(n)(fa(e))(e)}};var Ib=function(){return Uf(RT)(y.create)(b.value)}(),n_=function(n){return function(e){return function(t){return t.length===0?[]:Jn(t)(function(a){return lN(Ib(a)(t))})(Xp(n(e))(t))}}},Mv=function(n){return n_(gn(n))};var Hl=function(n){return function(e){return pN([n])(e)}};var _N=ee(J(xp)),Ev=function(n){return _N(function(){var e=Jn([])(wb);return function(t){return e(n(t))}}())};var e_=function(){return{}};var xv=bl(function(n){return function(e){return e}}),Nb=function(n){var e=Dv(n),t=bl(nn.create);return function(a){return e(t(a))}};var Rb=function(){return Uf(LT)(b.value)(y.create)}();var Ob=Ei;function Pb(n,e,t){try{return e(JSON.parse(t))}catch(a){return n(a.message)}}var Wb=function(n){return Pb(z.create,Q.create,n)};var Vf=function(n){return function(e){return function(t){return t.replace(new RegExp(n.replace(/[-\/\\^$*+?.()|[\]{}]/g,"\\$&"),"g"),e)}}},Vr=function(n){return function(e){return e.split(n)}},Sl=function(n){return n.toLowerCase()};var Fu=function(n){return function(e){return e.join(n)}};var Jr=function(n){return n===""};function kb(n){return n.replace(/[!'()*]/g,function(e){return"%"+e.charCodeAt(0).toString(16)})}function $b(n,e,t){try{return e(kb(encodeURIComponent(t)))}catch(a){return n(a)}}function qb(n,e,t){try{return e(kb(encodeURIComponent(t)).replace(/%20/g,"+"))}catch(a){return n(a)}}function Bb(n,e,t){try{return e(decodeURIComponent(t))}catch(a){return n(a)}}var Vb=function(){return Cu($b)($(b.value))(y.create)}();var r_=function(){return Cu(qb)($(b.value))(y.create)}(),Jb=function(){return Cu(Bb)($(b.value))(y.create)}();var LN=oe(vu),jb=M(ie),HN=Xt(qf)(gu);var IN=function(n){return n};var zb=function(){var n=function(a){if(a.value1 instanceof b)return r_(a.value0);if(a.value1 instanceof y)return LN(jb(function(u){return function(i){return u+("="+i)}})(r_(a.value0)))(r_(a.value1.value0));throw new Error("Failed pattern match at Data.FormURLEncoded (line 37, column 16 - line 39, column 114): "+[a.constructor.name])},e=jb(Fu("&")),t=HN(n);return function(a){return e(t(IN(a)))}}();var AN=function(){function n(){}return n.value=new n,n}(),Lv=function(){function n(){}return n.value=new n,n}(),NN=function(){function n(){}return n.value=new n,n}(),sa=function(){function n(){}return n.value=new n,n}(),Gb=function(){function n(){}return n.value=new n,n}(),Al=function(){function n(){}return n.value=new n,n}(),RN=function(){function n(){}return n.value=new n,n}(),ON=function(){function n(){}return n.value=new n,n}(),PN=function(){function n(){}return n.value=new n,n}(),WN=function(){function n(){}return n.value=new n,n}(),UN=function(){function n(){}return n.value=new n,n}(),kN=function(){function n(){}return n.value=new n,n}(),$N=function(){function n(){}return n.value=new n,n}(),qN=function(){function n(){}return n.value=new n,n}(),BN=function(){function n(){}return n.value=new n,n}(),Yb=function(){function n(){}return n.value=new n,n}();var VN=function(n){return n},JN={show:function(n){if(n instanceof AN)return"OPTIONS";if(n instanceof Lv)return"GET";if(n instanceof NN)return"HEAD";if(n instanceof sa)return"POST";if(n instanceof Gb)return"PUT";if(n instanceof Al)return"DELETE";if(n instanceof RN)return"TRACE";if(n instanceof ON)return"CONNECT";if(n instanceof PN)return"PROPFIND";if(n instanceof WN)return"PROPPATCH";if(n instanceof UN)return"MKCOL";if(n instanceof kN)return"COPY";if(n instanceof $N)return"MOVE";if(n instanceof qN)return"LOCK";if(n instanceof BN)return"UNLOCK";if(n instanceof Yb)return"PATCH";throw new Error("Failed pattern match at Data.HTTP.Method (line 43, column 1 - line 59, column 23): "+[n.constructor.name])}};var Kb=st(_n(JN))(VN);var io=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}();var Iv=function(n){var e=Kt(n);return function(t){return new io(t,e)}};var Sn=function(){function n(){}return n.value=new n,n}(),In=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),Sv=function(n){return n},zN=function(n){return new In(n.value0,n.value1)};var GN=function(n){var e=function(t){return function(a){var u=t,i=!1,f;function l(p,d){if(d instanceof In&&d.value1 instanceof In&&d.value1.value1 instanceof In){u=new In(d,p),a=d.value1.value1.value1;return}var m=function(g){return g instanceof In&&g.value1 instanceof In&&g.value1.value1 instanceof Sn?new In(n(g.value0),new In(n(g.value1.value0),Sn.value)):g instanceof In&&g.value1 instanceof Sn?new In(n(g.value0),Sn.value):Sn.value},v=function(g){return function(h){var E=g,F=!1,W;function sn(wn,Rn){if(wn instanceof In&&wn.value0 instanceof In&&wn.value0.value1 instanceof In&&wn.value0.value1.value1 instanceof In){E=wn.value1,h=new In(n(wn.value0.value0),new In(n(wn.value0.value1.value0),new In(n(wn.value0.value1.value1.value0),Rn)));return}return F=!0,Rn}for(;!F;)W=sn(E,h);return W}};return i=!0,v(p)(m(d))}for(;!i;)f=l(u,a);return f}};return e(Sn.value)},eM={map:GN};var fo={foldr:function(n){return function(e){var t=function(){var u=function(i){return function(f){var l=i,p=!1,d;function m(v,g){if(g instanceof Sn)return p=!0,v;if(g instanceof In){l=new In(g.value0,v),f=g.value1;return}throw new Error("Failed pattern match at Data.List.Types (line 107, column 7 - line 107, column 23): "+[v.constructor.name,g.constructor.name])}for(;!p;)d=m(l,f);return d}};return u(Sn.value)}(),a=Mt(fo)(ee(n))(e);return function(u){return a(t(u))}}},foldl:function(n){var e=function(t){return function(a){var u=t,i=!1,f;function l(p,d){if(d instanceof Sn)return i=!0,p;if(d instanceof In){u=n(p)(d.value0),a=d.value1;return}throw new Error("Failed pattern match at Data.List.Types (line 111, column 12 - line 113, column 30): "+[d.constructor.name])}for(;!i;)f=l(u,a);return f}};return e},foldMap:function(n){var e=mn(n.Semigroup0()),t=Zn(n);return function(a){return Mt(fo)(function(u){var i=e(u);return function(f){return i(a(f))}})(t)}}};var YN=Zt(fo);var Av={append:function(n){return function(e){return YN(In.create)(e)(n)}}},tM=mn(Av);var Nv={append:function(n){return function(e){return new io(n.value0,tM(n.value1)(zN(e)))}}};var KN={alt:tM,Functor0:function(){return eM}},rM=function(){return{empty:Sn.value,Alt0:function(){return KN}}}();var Li=function(){var n=function(e){return function(t){var a=e,u=!1,i;function f(l,p){if(p instanceof Sn)return u=!0,l;if(p instanceof In){a=new In(p.value0,l),t=p.value1;return}throw new Error("Failed pattern match at Data.List (line 368, column 3 - line 368, column 19): "+[l.constructor.name,p.constructor.name])}for(;!u;)i=f(a,t);return i}};return n(Sn.value)}();var aM=function(n){return n instanceof Sn};var oM=function(n){return n()};var uM=function(n){throw new Error(n)};var iM=function(){return uM};var uR=iM(),iR=oM,Hi=function(n){return iR(function(){return uR(n)})};var Jf=function(){var n=Iv(rM);return function(e){return Sv(n(e))}}();var cM=function(n){return n.value0};var lM=function(n){return function(e){return new io(n,new In(e.value0,e.value1))}};function sM(n,e,t){return n==null?e:t(n)}function Ov(n){return n}var Bt=Jn(null)(Ov),Xn=function(n){return sM(n,b.value,y.create)};var nr=function(){var n={},e="Pure",t="Throw",a="Catch",u="Sync",i="Async",f="Bind",l="Bracket",p="Fork",d="Sequential",m="Map",v="Apply",g="Alt",h="Cons",E="Resume",F="Release",W="Finalizer",sn="Finalized",wn="Forked",Rn="Fiber",En="Thunk";function U(w,Qn,He,jn){this.tag=w,this._1=Qn,this._2=He,this._3=jn}function re(w){var Qn=function(He,jn,on){return new U(w,He,jn,on)};return Qn.tag=w,Qn}function An(w){return new U(e,void 0)}function wt(w){try{w()}catch(Qn){setTimeout(function(){throw Qn},0)}}function vr(w,Qn,He){try{return Qn(He())}catch(jn){return w(jn)}}function Ta(w,Qn,He){try{return Qn(He)()}catch(jn){return He(w(jn))(),An}}var xt=function(){var w=1024,Qn=0,He=0,jn=new Array(w),on=!1;function k(){var ne;for(on=!0;Qn!==0;)Qn--,ne=jn[He],jn[He]=void 0,He=(He+1)%w,ne();on=!1}return{isDraining:function(){return on},enqueue:function(ne){var Pn,ge;Qn===w&&(ge=on,k(),on=ge),jn[(He+Qn)%w]=ne,Qn++,on||k()}}}();function ti(w){var Qn={},He=0,jn=0;return{register:function(on){var k=He++;on.onComplete({rethrow:!0,handler:function(ne){return function(){jn--,delete Qn[k]}}})(),Qn[k]=on,jn++},isEmpty:function(){return jn===0},killAll:function(on,k){return function(){if(jn===0)return k();var ne=0,Pn={};function ge(ce){Pn[ce]=Qn[ce].kill(on,function(Ie){return function(){delete Pn[ce],ne--,w.isLeft(Ie)&&w.fromLeft(Ie)&&setTimeout(function(){throw w.fromLeft(Ie)},0),ne===0&&k()}})()}for(var at in Qn)Qn.hasOwnProperty(at)&&(ne++,ge(at));return Qn={},He=0,jn=0,function(ce){return new U(u,function(){for(var Ie in Pn)Pn.hasOwnProperty(Ie)&&Pn[Ie]()})}}}}}var gr=0,mt=1,na=2,ou=3,Mo=4,Le=5,Ar=6;function ba(w,Qn,He){var jn=0,on=gr,k=He,ne=null,Pn=null,ge=null,at=null,ce=null,Ie=0,Ma=0,Ln=null,G=!0;function $n(rn){for(var un,yn,Bn;;)switch(un=null,yn=null,Bn=null,on){case na:on=mt;try{k=ge(k),at===null?ge=null:(ge=at._1,at=at._2)}catch(Ve){on=Le,ne=w.left(Ve),k=null}break;case ou:w.isLeft(k)?(on=Le,ne=k,k=null):ge===null?on=Le:(on=na,k=w.fromRight(k));break;case mt:switch(k.tag){case f:ge&&(at=new U(h,ge,at)),ge=k._2,on=mt,k=k._1;break;case e:ge===null?(on=Le,k=w.right(k._1)):(on=na,k=k._1);break;case u:on=ou,k=vr(w.left,w.right,k._1);break;case i:on=Mo,k=Ta(w.left,k._1,function(Ve){return function(){jn===rn&&(jn++,xt.enqueue(function(){jn===rn+1&&(on=ou,k=Ve,$n(jn))}))}});return;case t:on=Le,ne=w.left(k._1),k=null;break;case a:ge===null?ce=new U(h,k,ce,Pn):ce=new U(h,k,new U(h,new U(E,ge,at),ce,Pn),Pn),ge=null,at=null,on=mt,k=k._1;break;case l:Ie++,ge===null?ce=new U(h,k,ce,Pn):ce=new U(h,k,new U(h,new U(E,ge,at),ce,Pn),Pn),ge=null,at=null,on=mt,k=k._1;break;case p:on=ou,un=ba(w,Qn,k._2),Qn&&Qn.register(un),k._1&&un.run(),k=w.right(un);break;case d:on=mt,k=Qa(w,Qn,k._1);break}break;case Le:if(ge=null,at=null,ce===null)on=Ar,k=Pn||ne||k;else switch(un=ce._3,Bn=ce._1,ce=ce._2,Bn.tag){case a:Pn&&Pn!==un&&Ie===0?on=Le:ne&&(on=mt,k=Bn._2(w.fromLeft(ne)),ne=null);break;case E:Pn&&Pn!==un&&Ie===0||ne?on=Le:(ge=Bn._1,at=Bn._2,on=na,k=w.fromRight(k));break;case l:Ie--,ne===null&&(yn=w.fromRight(k),ce=new U(h,new U(F,Bn._2,yn),ce,un),(Pn===un||Ie>0)&&(on=mt,k=Bn._3(yn)));break;case F:ce=new U(h,new U(sn,k,ne),ce,Pn),on=mt,Pn&&Pn!==un&&Ie===0?k=Bn._1.killed(w.fromLeft(Pn))(Bn._2):ne?k=Bn._1.failed(w.fromLeft(ne))(Bn._2):k=Bn._1.completed(w.fromRight(k))(Bn._2),ne=null,Ie++;break;case W:Ie++,ce=new U(h,new U(sn,k,ne),ce,Pn),on=mt,k=Bn._1;break;case sn:Ie--,on=Le,k=Bn._1,ne=Bn._2;break}break;case Ar:for(var De in Ln)Ln.hasOwnProperty(De)&&(G=G&&Ln[De].rethrow,wt(Ln[De].handler(k)));Ln=null,Pn&&ne?setTimeout(function(){throw w.fromLeft(ne)},0):w.isLeft(k)&&G&&setTimeout(function(){if(G)throw w.fromLeft(k)},0);return;case gr:on=mt;break;case Mo:return}}function q(rn){return function(){if(on===Ar)return G=G&&rn.rethrow,rn.handler(k)(),function(){};var un=Ma++;return Ln=Ln||{},Ln[un]=rn,function(){Ln!==null&&delete Ln[un]}}}function B(rn,un){return function(){if(on===Ar)return un(w.right(void 0))(),function(){};var yn=q({rethrow:!1,handler:function(){return un(w.right(void 0))}})();switch(on){case gr:Pn=w.left(rn),on=Ar,k=Pn,$n(jn);break;case Mo:Pn===null&&(Pn=w.left(rn)),Ie===0&&(on===Mo&&(ce=new U(h,new U(W,k(rn)),ce,Pn)),on=Le,k=null,ne=null,$n(++jn));break;default:Pn===null&&(Pn=w.left(rn)),Ie===0&&(on=Le,k=null,ne=null)}return yn}}function Cn(rn){return function(){var un=q({rethrow:!1,handler:rn})();return on===gr&&$n(jn),un}}return{kill:B,join:Cn,onComplete:q,isSuspended:function(){return on===gr},run:function(){on===gr&&(xt.isDraining()?$n(jn):xt.enqueue(function(){$n(jn)}))}}}function Ja(w,Qn,He,jn){var on=0,k={},ne=0,Pn={},ge=new Error("[ParAff] Early exit"),at=null,ce=n;function Ie(q,B,Cn){var rn=B,un=null,yn=null,Bn=0,De={},Ve,le;n:for(;;)switch(Ve=null,rn.tag){case wn:if(rn._3===n&&(Ve=k[rn._1],De[Bn++]=Ve.kill(q,function(Eo){return function(){Bn--,Bn===0&&Cn(Eo)()}})),un===null)break n;rn=un._2,yn===null?un=null:(un=yn._1,yn=yn._2);break;case m:rn=rn._2;break;case v:case g:un&&(yn=new U(h,un,yn)),un=rn,rn=rn._1;break}if(Bn===0)Cn(w.right(void 0))();else for(le=0,Ve=Bn;le<Ve;le++)De[le]=De[le]();return De}function Ma(q,B,Cn){var rn,un,yn,Bn,De,Ve;for(w.isLeft(q)?(rn=q,un=null):(un=q,rn=null);;){if(yn=null,Bn=null,De=null,Ve=null,at!==null)return;if(B===null){jn(rn||un)();return}if(B._3!==n)return;switch(B.tag){case m:rn===null?(B._3=w.right(B._1(w.fromRight(un))),un=B._3):B._3=rn;break;case v:if(yn=B._1._3,Bn=B._2._3,rn){if(B._3=rn,De=!0,Ve=ne++,Pn[Ve]=Ie(ge,rn===yn?B._2:B._1,function(){return function(){delete Pn[Ve],De?De=!1:Cn===null?Ma(rn,null,null):Ma(rn,Cn._1,Cn._2)}}),De){De=!1;return}}else{if(yn===n||Bn===n)return;un=w.right(w.fromRight(yn)(w.fromRight(Bn))),B._3=un}break;case g:if(yn=B._1._3,Bn=B._2._3,yn===n&&w.isLeft(Bn)||Bn===n&&w.isLeft(yn))return;if(yn!==n&&w.isLeft(yn)&&Bn!==n&&w.isLeft(Bn))rn=un===yn?Bn:yn,un=null,B._3=rn;else if(B._3=un,De=!0,Ve=ne++,Pn[Ve]=Ie(ge,un===yn?B._2:B._1,function(){return function(){delete Pn[Ve],De?De=!1:Cn===null?Ma(un,null,null):Ma(un,Cn._1,Cn._2)}}),De){De=!1;return}break}Cn===null?B=null:(B=Cn._1,Cn=Cn._2)}}function Ln(q){return function(B){return function(){delete k[q._1],q._3=B,Ma(B,q._2._1,q._2._2)}}}function G(){var q=mt,B=He,Cn=null,rn=null,un,yn;n:for(;;)switch(un=null,yn=null,q){case mt:switch(B.tag){case m:Cn&&(rn=new U(h,Cn,rn)),Cn=new U(m,B._1,n,n),B=B._2;break;case v:Cn&&(rn=new U(h,Cn,rn)),Cn=new U(v,n,B._2,n),B=B._1;break;case g:Cn&&(rn=new U(h,Cn,rn)),Cn=new U(g,n,B._2,n),B=B._1;break;default:yn=on++,q=Le,un=B,B=new U(wn,yn,new U(h,Cn,rn),n),un=ba(w,Qn,un),un.onComplete({rethrow:!1,handler:Ln(B)})(),k[yn]=un,Qn&&Qn.register(un)}break;case Le:if(Cn===null)break n;Cn._1===n?(Cn._1=B,q=mt,B=Cn._2,Cn._2=n):(Cn._2=B,B=Cn,rn===null?Cn=null:(Cn=rn._1,rn=rn._2))}for(ce=B,yn=0;yn<on;yn++)k[yn].run()}function $n(q,B){at=w.left(q);var Cn;for(var rn in Pn)if(Pn.hasOwnProperty(rn)){Cn=Pn[rn];for(rn in Cn)Cn.hasOwnProperty(rn)&&Cn[rn]()}Pn=null;var un=Ie(q,ce,B);return function(yn){return new U(i,function(Bn){return function(){for(var De in un)un.hasOwnProperty(De)&&un[De]();return An}})}}return G(),function(q){return new U(i,function(B){return function(){return $n(q,B)}})}}function Qa(w,Qn,He){return new U(i,function(jn){return function(){return Ja(w,Qn,He,jn)}})}return U.EMPTY=n,U.Pure=re(e),U.Throw=re(t),U.Catch=re(a),U.Sync=re(u),U.Async=re(i),U.Bind=re(f),U.Bracket=re(l),U.Fork=re(p),U.Seq=re(d),U.ParMap=re(m),U.ParApply=re(v),U.ParAlt=re(g),U.Fiber=ba,U.Supervisor=ti,U.Scheduler=xt,U.nonCanceler=An,U}(),pM=nr.Pure,_M=nr.Throw;function mM(n){return function(e){return nr.Catch(n,e)}}function dM(n){return function(e){return e.tag===nr.Pure.tag?nr.Pure(n(e._1)):nr.Bind(e,function(t){return nr.Pure(n(t))})}}function vM(n){return function(e){return nr.Bind(n,e)}}function Pv(n){return function(e){return nr.Fork(n,e)}}var gM=nr.Sync;function DM(n){return function(e){return nr.ParMap(n,e)}}function hM(n){return function(e){return nr.ParApply(n,e)}}var co=nr.Async;function o_(n){return function(e){return function(t){return nr.Bracket(n,e,t)}}}function yM(n,e){return function(){return nr.Fiber(n,null,e)}}var TM=nr.Seq;var i_={dimap:function(n){return function(e){return function(t){return function(a){return e(t(n(a)))}}}}},Qf=function(n){return n.dimap};var zf=function(n){return n.sequential},wu=function(n){return n.parallel};var hR=fn(cn),yR=function(n){var e=zf(n),t=wu(n);return function(a){var u=et(a);return function(i){var f=u(i);return function(l){var p=f(function(d){return t(l(d))});return function(d){return e(p(d))}}}}};var Gf=function(n){var e=yR(n);return function(t){var a=e(t);return function(u){return a(u)(hR)}}};var Yf=function(n){return n()};var bR=function(n,e,t){var a=0,u;return function(i){if(a===2)return u;if(a===1)throw new ReferenceError(n+" was needed before it finished initializing (module "+e+", line "+i+")",e,i);return a=1,u=t(),a=2,u}},MR=S(Ee),wM=qn(On),xM=M(On);var ER=function(n){return n},LM=Pv(!1);var CR={map:DM},pa={map:dM},FR=M(pa),l_=Pv(!0),wR=function(){var n=function(a){if(a instanceof Q)return a.value0;if(a instanceof z)return Hi("unsafeFromRight: Left");throw new Error("Failed pattern match at Effect.Aff (line 412, column 21 - line 414, column 54): "+[a.constructor.name])},e=function(a){if(a instanceof z)return a.value0;if(a instanceof Q)return Hi("unsafeFromLeft: Right");throw new Error("Failed pattern match at Effect.Aff (line 407, column 20 - line 409, column 55): "+[a.constructor.name])},t=function(a){if(a instanceof z)return!0;if(a instanceof Q)return!1;throw new Error("Failed pattern match at Effect.Aff (line 402, column 12 - line 404, column 21): "+[a.constructor.name])};return{isLeft:t,fromLeft:e,fromRight:n,left:z.create,right:Q.create}}(),HM=function(n){return yM(wR,n)},qv=function(n){return function(){var t=HM(n)();return t.run(),t}};var xR=function(n){return function(e){return o_(n)({killed:$(e),failed:$(e),completed:$(e)})}},IM={apply:hM,Functor0:function(){return CR}};var Kf={Applicative0:function(){return er},Bind1:function(){return Ct}},Ct={bind:vM,Apply0:function(){return Bv(0)}},er={pure:pM,Apply0:function(){return Bv(0)}},Bv=bR("applyAff","Effect.Aff",function(){return{apply:Tr(Kf),Functor0:function(){return pa}}}),LR=Bv(73),s_=S(er),SM=J(Ct);var HR=fe(Ct);var AM=function(n){return function(e){return xR(s_(void 0))($(n))($(e))}};var xu={parallel:x,sequential:TM,Apply0:function(){return LR},Apply1:function(){return IM}},IR=wu(xu),Ii={pure:function(n){return IR(s_(n))},Apply0:function(){return IM}};var SR=Gf(xu)(Ii)(Rt);var AR={append:function(n){return function(e){return function(t){return SR([n(t),e(t)])}}}};var pt={liftEffect:gM,Monad0:function(){return Kf}},c_=Gn(pt),Vv=function(n){return ER($(c_(n)))},Pl=function(n){return co(function(e){return xM(Vv)(n.join(e))})},NM={map:function(n){return function(e){return Yf(HM(FR(n)(Pl(e))))}}};var Wl=function(n){return function(e){return SM(c_(e.isSuspended))(function(t){return t?c_(wM(e.kill(n,$(MR(void 0))))):co(function(a){return xM(Vv)(e.kill(n,a))})})}};var Jv={throwError:_M,Monad0:function(){return Kf}},p_={catchError:mM,MonadThrow0:function(){return Jv}},NR=sl(p_);var RR=function(n){return function(e){return qv(HR(function(t){return c_(n(t))})(NR(e)))}},__=function(n){return function(e){return wM(RR(n)(e))}};var RM={tailRecM:function(n){var e=function(t){return SM(n(t))(function(a){if(a instanceof Nt)return s_(a.value0);if(a instanceof qt)return e(a.value0);throw new Error("Failed pattern match at Effect.Aff (line 104, column 7 - line 106, column 23): "+[a.constructor.name])})};return e},Monad0:function(){return Kf}};var m_=$(s_(void 0)),OM={mempty:m_,Semigroup0:function(){return AR}};var qM=function(n){return co(function(e){return function(){var a=n(function(u){return e(z.create(u))()},function(u){return e(Q.create(u))()});return function(u){return co(function(i){return function(){return a(u,function(l){return i(z.create(l))()},function(l){return i(Q.create(l))()}),m_}})}}})};function Ul(n){return typeof n}function Zf(n){return Object.prototype.toString.call(n).slice(8,-1)}var BM=Array.isArray||function(n){return Object.prototype.toString.call(n)==="[object Array]"};var VM=function(n){return function(e){return function(t){return(t|0)===t?n(t):e}}},Qo=function(n){return n};var jv=Math.log;var jM=function(){return VM(y.create)(b.value)}();var Gv=function(n){return n};var Xf=function(n){return n.length};var nc=function(n){return function(e){return e.substring(n)}};var Yv=function(n){return function(e){return{before:e.substring(0,n),after:e.substring(n)}}};var ec=function(n){return function(e){if(n>=0&&n<e.length)return e.charAt(n);throw new Error("Data.String.Unsafe.charAt: Invalid index.")}};var kl=function(n){return function(e){var t=Yv(Xf(n))(e),a=t.before===n;return a?new y(t.after):b.value}};var cO=_n(Za),lO=_n(Wr),sO=S($d);var D_=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),tc=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),Xv=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),ng=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),_t=x,YM=x;var g_=function(n){if(n instanceof D_)return n.value0;if(n instanceof Xv)return"Error at array index "+(lO(n.value0)+(": "+g_(n.value1)));if(n instanceof ng)return"Error at property "+(cO(n.value0)+(": "+g_(n.value1)));if(n instanceof tc)return"Type mismatch: expected "+(n.value0+(", found "+n.value1));throw new Error("Failed pattern match at Foreign (line 78, column 1 - line 78, column 45): "+[n.constructor.name])};var rc=function(n){var e=br(xT(n));return function(t){return e(Jf(t))}};var $l=function(n){var e=S(uo(n)),t=rc(n);return function(a){return function(u){if(Zf(u)===a)return e(YM(u));if(ct)return t(new tc(a,Zf(u)));throw new Error("Failed pattern match at Foreign (line 123, column 1 - line 123, column 104): "+[a.constructor.name,u.constructor.name])}}},eg=function(n){return $l(n)("Boolean")},KM=function(n){return $l(n)("Number")},h_=function(n){var e=M(n.Bind1().Apply0().Functor0()),t=KM(n);return function(a){var u=new z(Jf(new tc("Int",Zf(a)))),i=function(){var f=Jn(u)(sO);return function(l){return f(jM(l))}}();return yl(e(st($(u))(i)))(t(a))}},ql=function(n){return $l(n)("String")};var tg=S(uo($t)),pO=rc($t),Si=$l($t),ZM=ht(Xd(Nv)($t)),_O=Du(bi($t)),y_=M(ie),mO=Pf(Rt)(ro),dO=gn(lr),vO=fe(At),gO=M(Ae),DO=_i(pa),hO=sl(p_),yO=S(er);var rg=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),ag=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),og=function(){function n(){}return n.value=new n,n}(),ug=function(){function n(){}return n.value=new n,n}(),ig=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),XM=function(n){return function(e){var t=function(m){return m===""?tg(Ob):st(function(v){return pO(D_.create(v))})(tg)(Wb(m))},a=function(){if(e.responseFormat instanceof Pd)return Si("ArrayBuffer");if(e.responseFormat instanceof Wd)return Si("Blob");if(e.responseFormat instanceof Ud)return function(m){return ZM(Si("Document")(m))(ZM(Si("XMLDocument")(m))(Si("HTMLDocument")(m)))};if(e.responseFormat instanceof cl)return _O(function(m){return e.responseFormat.value0(t(m))})(Si("String"));if(e.responseFormat instanceof Cp)return Si("String");if(e.responseFormat instanceof Fp)return $(e.responseFormat.value0(tg(void 0)));throw new Error("Failed pattern match at Affjax (line 274, column 18 - line 283, column 57): "+[e.responseFormat.constructor.name])}(),u=function(m){if(m instanceof Py)return new Q(m.value0(_t));if(m instanceof Wy)return new Q(_t(m.value0));if(m instanceof Uy)return new Q(_t(m.value0));if(m instanceof Sd)return new Q(_t(m.value0));if(m instanceof ky)return new Q(_t(m.value0));if(m instanceof il)return kd("Body contains values that cannot be encoded as application/x-www-form-urlencoded")(y_(_t)(zb(m.value0)));if(m instanceof Ad)return new Q(_t(nv(m.value0)));throw new Error("Failed pattern match at Affjax (line 235, column 20 - line 250, column 69): "+[m.constructor.name])},i=function(m){return function(v){return m instanceof y&&!mO(Cd(dO)(Rd)(m.value0))(v)?yv(v)(m.value0):v}},f=function(m){return i(y_(yi.create)(vO($y)(m)))(i(y_(Mp.create)(Yy(e.responseFormat)))(e.headers))},l=function(m){return{method:Kb(e.method),url:e.url,headers:gO(function(v){return{field:Rd(v),value:jy(v)}})(f(e.content)),content:m,responseType:Gy(e.responseFormat),username:Bt(e.username),password:Bt(e.password),withCredentials:e.withCredentials,timeout:Ne(0)(y_(function(v){return v})(e.timeout))}},p=function(m){return DO(hO(qM(sy(n,"AffjaxTimeoutErrorMessageIdent","AffjaxRequestFailedMessageIdent",Xy.create,l(m)))))(function(v){if(v instanceof Q){var g=Mi(a(v.value0.body));if(g instanceof z)return new z(new ag(cM(g.value0),v.value0));if(g instanceof Q)return new Q({headers:v.value0.headers,status:v.value0.status,statusText:v.value0.statusText,body:g.value0});throw new Error("Failed pattern match at Affjax (line 209, column 9 - line 211, column 52): "+[g.constructor.name])}if(v instanceof z)return new z(function(){var h=wf(v.value0),E=h==="AffjaxTimeoutErrorMessageIdent";if(E)return og.value;var F=h==="AffjaxRequestFailedMessageIdent";return F?ug.value:new ig(v.value0)}());throw new Error("Failed pattern match at Affjax (line 207, column 144 - line 219, column 28): "+[v.constructor.name])})};if(e.content instanceof b)return p(Bt(b.value));if(e.content instanceof y){var d=u(e.content.value0);if(d instanceof Q)return p(Bt(new y(d.value0)));if(d instanceof z)return yO(new z(new rg(d.value0)));throw new Error("Failed pattern match at Affjax (line 199, column 7 - line 203, column 48): "+[d.constructor.name])}throw new Error("Failed pattern match at Affjax (line 195, column 3 - line 203, column 48): "+[e.content.constructor.name])}},lo=function(n){if(n instanceof rg)return"There was a problem with the request content: "+n.value0;if(n instanceof ag)return"There was a problem with the response body: "+g_(n.value0);if(n instanceof og)return"There was a problem making the request: timeout";if(n instanceof ug)return"There was a problem making the request: request failed";if(n instanceof ig)return"There was a problem making the request: "+wf(n.value0);throw new Error("Failed pattern match at Affjax (line 113, column 14 - line 123, column 66): "+[n.constructor.name])},oc=function(){return{method:new z(Lv.value),url:"/",headers:[],content:b.value,username:b.value,password:b.value,withCredentials:!1,responseFormat:Xa,timeout:b.value}}();var nE={eq:function(n){return function(e){return n===e}}};var fg={newXHR:function(){return new XMLHttpRequest},fixupUrl:function(n){return n||"/"}};var eE=XM(fg);var lg=ly(tE(),1),sg=function(){return app};var pg=function(n,e,t,a){try{var u=(0,lg.default)(a,lg.default.ISO_8601),i=u.fromNow(),f=u.format("MMMM D YYYY, h:mm a")+" ("+u.format()+") ";return n(t(i)(f))}catch(l){return e}},_g=function(n){n.close()},mg=function(n){document.getElementById(n).focus()},dg=function(n){return new Date(n).toLocaleDateString(void 0,{dateStyle:"medium"})};var vg=function(n){return n},rE=function(n){return dg(n)},T_=function(n){return function(){return mg(n)}};var ic=function(n){return pg(y.create,b.value,nn.create,n)};var fc=function(n){return function(){return _g(n)}},_a=function(n){return sg()};var aE=JSON.stringify;function Hu(n){return n.charCodeAt(0)}function oE(n){return String.fromCharCode(n)}var uE=Ia(Di),iE=Ha(Di);var Ai=function(n){return n.toEnum};var b_=function(n){return n.fromEnum},fE=function(n){var e=Ai(n),t=b_(n),a=Ia(n.Bounded0());return function(u){return function(i){return function(f){var l=e(f);if(l instanceof y)return l.value0;if(l instanceof b){var p=f<t(a);return p?u:i}throw new Error("Failed pattern match at Data.Enum (line 158, column 33 - line 160, column 62): "+[l.constructor.name])}}}};var Ni=function(n){return function(e){return function(t){return n(e(t)+1|0)}}},Ri=function(n){return function(e){return function(t){return n(e(t)-1|0)}}};var gg=function(n){return n>=Hu(uE)&&n<=Hu(iE)?new y(oE(n)):b.value},UO={succ:Ni(gg)(Hu),pred:Ri(gg)(Hu),Ord0:function(){return Dp}};var Dg=function(){return{cardinality:Hu(iE)-Hu(uE)|0,toEnum:gg,fromEnum:Hu,Bounded0:function(){return Di},Enum1:function(){return UO}}}();function cE(n,e,t,a){return a==null?n:e(a[t])}var BO=function(n){var e=rc(n),t=S(uo(n));return function(a){return function(u){return cE(e(new tc("object",Ul(u))),t,a,u)}}},hg=function(n){return BO(n)};var pE=function(n){var e=lt(n);return function(){return function(t){return function(a){return ra(e(t))(a)}}}};function _E(n){var e={};for(var t in n)({}).hasOwnProperty.call(n,t)&&(e[t]=n[t]);return e}function mE(n){return function(e){return function(t){return t[n]=e,t}}}var dE=Tf;var vE=function(){return function(){return function(n){var e=lt(n);return function(t){return function(a){return function(u){return mE(e(t))(a)(u)}}}}}};var gE=cn,DE=function(n){return function(e){return n(_E(e))}};var zO=fn(gE);var GO=bf(dE),YO=vE()();var hE=function(n){return n.writeImplFields},Tg=function(n){return n.writeImpl},yE=function(n){var e=Tg(n);return function(t){return aE(e(t))}};var ma={writeImpl:_t};var TE=function(n){return{writeImpl:function(){var e=Jn(_t(Bt(b.value)))(Tg(n));return function(t){return e(Xn(t))}}()}},E_={writeImpl:_t},bE={writeImpl:fn(cn)};var so={writeImpl:_t};var ME=function(){return function(n){var e=hE(n);return{writeImpl:function(t){var a=e(he.value)(t);return _t(DE(a)({}))}}}};var Vl={writeImplFields:function(n){return function(e){return zO}}};var Be=function(n){var e=pE(n)(),t=YO(n);return function(a){var u=Tg(a);return function(i){var f=hE(i);return function(){return function(){return function(){return{writeImplFields:function(l){return function(p){var d=f(he.value)(p),m=u(e(he.value)(p)),v=GO(t(he.value)(m))(d);return v}}}}}}}}};var C_=ME(),KO={reflectSymbol:function(){return"expanded"}},ZO={reflectSymbol:function(){return"mode"}},XO={reflectSymbol:function(){return"value"}},nP={reflectSymbol:function(){return"created"}},eP={reflectSymbol:function(){return"id"}},tP={reflectSymbol:function(){return"isMarkdown"}},rP={reflectSymbol:function(){return"length"}},aP={reflectSymbol:function(){return"shared"}},oP={reflectSymbol:function(){return"slug"}},FE=Be(oP)(ma),uP={reflectSymbol:function(){return"text"}},iP={reflectSymbol:function(){return"title"}},wE=Be(iP)(ma),fP={reflectSymbol:function(){return"updated"}},cP={reflectSymbol:function(){return"archiveUrl"}},lP={reflectSymbol:function(){return"bid"}},sP={reflectSymbol:function(){return"description"}},pP={reflectSymbol:function(){return"private"}},_P={reflectSymbol:function(){return"selected"}},mP={reflectSymbol:function(){return"tags"}},dP={reflectSymbol:function(){return"time"}},vP={reflectSymbol:function(){return"toread"}},gP={reflectSymbol:function(){return"url"}},DP={reflectSymbol:function(){return"archiveDefault"}},hP={reflectSymbol:function(){return"privacyLock"}},yP={reflectSymbol:function(){return"privateDefault"}};var TP=gn(Mf(lr)),bg=M(Tl(Tu)),CE=h_($t),bP=ql($t),MP=S(uo($t)),EP=Lb(Sa),jo=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),Qr=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),po=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),da=function(){function n(){}return n.value=new n,n}();var xE=C_(Be(KO)(so)(Be(ZO)(ma)(Be(XO)(bE)(Vl)()()())()()())()()()),LE=C_(Be(nP)(ma)(Be(eP)(E_)(Be(tP)(so)(Be(rP)(E_)(Be(aP)(so)(FE(Be(uP)(ma)(wE(Be(fP)(ma)(Vl)()()())()()())()()())()()())()()())()()())()()())()()())()()()),HE=C_(Be(cP)(TE(ma))(Be(lP)(E_)(Be(sP)(ma)(Be(pP)(so)(Be(_P)(so)(FE(Be(mP)(ma)(Be(dP)(ma)(wE(Be(vP)(so)(Be(gP)(ma)(Vl)()()())()()())()()())()()())()()())()()())()()())()()())()()())()()())()()()),IE=C_(Be(DP)(so)(Be(hP)(so)(Be(yP)(so)(Vl)()()())()()())()()());var SE={eq:function(n){return function(e){return n instanceof jo&&e instanceof jo||n instanceof Qr&&e instanceof Qr?n.value0===e.value0&&n.value1===e.value1:n instanceof po&&e instanceof po?n.value0===e.value0&&TP(n.value1)(e.value1):n instanceof da&&e instanceof da}}},AE=function(n){return Ne(da.value)(Ff(Mi(function(){return n.mode==="top"?bg(jo.create(n.expanded))(CE(n.value)):n.mode==="lowerBound"?bg(Qr.create(n.expanded))(CE(n.value)):n.mode==="related"?bg(function(e){return new po(n.expanded,Vr(" ")(e))})(bP(n.value)):MP(da.value)}())))},Mg=function(n){if(n instanceof jo)return{mode:"top",value:_t(n.value1),expanded:n.value0};if(n instanceof Qr)return{mode:"lowerBound",value:_t(n.value1),expanded:n.value0};if(n instanceof po)return{mode:"related",value:_t(EP(" ")(n.value1)),expanded:n.value0};if(n instanceof da)return{mode:"none",value:_t(""),expanded:!1};throw new Error("Failed pattern match at Model (line 92, column 1 - line 92, column 51): "+[n.constructor.name])};var Eg=function(n){return function(e){if(n instanceof jo)return new jo(e,n.value1);if(n instanceof Qr)return new Qr(e,n.value1);if(n instanceof po)return new po(e,n.value1);if(n instanceof da)return da.value;throw new Error("Failed pattern match at Model (line 112, column 1 - line 112, column 57): "+[n.constructor.name,e.constructor.name])}},NE=function(n){return n instanceof po},va=function(n){if(n instanceof jo||n instanceof Qr||n instanceof po)return n.value0;if(n instanceof da)return!1;throw new Error("Failed pattern match at Model (line 102, column 1 - line 102, column 39): "+[n.constructor.name])};var tr=function(){return window};var Jl=function(n){return n};function RE(n){return n.referrer}var PE=x;var Fg=x;var F_=function(n){return function(){return RE(n)}};function WE(n,e,t){var a=Object.prototype.toString.call(t);return a.indexOf("[object HTML")===0&&a.indexOf("Element]")===a.length-8?e(t):n}var UE=x;var kE=x;var jl=function(n){return WE(b.value,y.create,n)};function Iu(n){return function(e){return function(){e.href=n}}}function Gl(n){return function(){return n.origin}}function wg(n){return function(){return n.search}}function xg(n){return function(){n.reload()}}function Oi(n){return function(){return n.document}}function Yl(n){return function(){return n.location}}var uW=ke($e)(Ct),BE=qn(pa),iW=Gn(pt),qE=J(nt),VE=M(ie),L_=_n(Wr),JE=J(Ct),QE=S(er),jE=J(At),fW=S(gu),cW=gn(nE),Lg=function(){function n(){}return n.value=new n,n}(),Hg=function(){function n(){}return n.value=new n,n}(),lW={show:function(n){if(n instanceof Lg)return"star";if(n instanceof Hg)return"unstar";throw new Error("Failed pattern match at App (line 29, column 1 - line 31, column 25): "+[n.constructor.name])}},sW=_n(lW),zE=function(n){return function(e){return function(t){return function(a){return function(u){var i=_a(void 0);return eE({username:oc.username,password:oc.password,withCredentials:oc.withCredentials,timeout:oc.timeout,url:e,method:new z(n),headers:Hl(new Ep(i.csrfHeaderName,i.csrfToken))(t),content:a,responseFormat:u})}}}}},GE=function(n){var e=_a(n);return uW(BE(zE(sa.value)(e.authRlogoutR)([])(b.value)(Xa)))(function(){return iW(qE(qE(tr)(Yl))(xg))})},YE=function(n){return function(e){return function(t){return function(a){return function(u){return zE(n)(_a(void 0).homeR+e)(t)(a)(u)}}}}},H_=function(n){return function(e){return function(t){return function(a){return YE(n)(e)([new yi(Tp)])(VE(il.create)(t))(a)}}}},KE=function(n){var e="bm/"+(L_(n)+"/read");return H_(sa.value)(e)(b.value)(Xa)},ZE=function(n){return function(e){var t="bm/"+(L_(n)+("/"+sW(e)));return BE(H_(sa.value)(t)(b.value)(Xa))}},I_=function(n){var e=yE(n);return function(t){return function(a){return function(u){return function(i){return YE(t)(a)([new yi(Cf)])(VE(function(f){return qy(e(f))})(u))(i)}}}}},XE=I_(xE),nC=I_(HE),pW=I_(LE),_W=I_(IE),eC=function(n){return JE(XE(sa.value)("api/tagcloud")(new y(n))(Ky))(function(e){return QE(jE(Ff(e))(function(t){return fW(t.body)}))})},S_=function(n){return JE(nC(sa.value)("api/lookuptitle")(new y(n))(wp))(function(e){return QE(jE(Ff(e))(function(t){var a=cW(t.status)(200);return a?new y(t.body):b.value}))})},tC=function(n){return XE(sa.value)("api/tagcloudmode")(new y(n))(Xa)},rC=function(n){return pW(sa.value)("api/note/add")(new y(n))(wp)},A_=function(n){return nC(sa.value)("api/add")(new y(n))(wp)},Ig=function(n){return _W(sa.value)("api/accountSettings")(new y(n))(Xa)},aC=function(n){return H_(Al.value)("api/note/"+L_(n))(b.value)(Xa)},N_=function(n){return H_(Al.value)("bm/"+L_(n))(b.value)(Xa)};var oC=function(){function n(){}return n.value=new n,n}(),_r=function(){function n(){}return n.value=new n,n}(),uC=function(){function n(){}return n.value=new n,n}(),iC=function(){function n(){}return n.value=new n,n}(),fC=function(){function n(){}return n.value=new n,n}(),cC=function(){function n(){}return n.value=new n,n}(),lC=function(){function n(){}return n.value=new n,n}(),sC=function(){function n(){}return n.value=new n,n}(),pC=function(){function n(){}return n.value=new n,n}(),_C=function(){function n(){}return n.value=new n,n}(),mC=function(){function n(){}return n.value=new n,n}(),dC=function(){function n(){}return n.value=new n,n}(),vC=function(){function n(){}return n.value=new n,n}(),gC=function(){function n(){}return n.value=new n,n}(),sc=function(){function n(){}return n.value=new n,n}(),DC=function(){function n(){}return n.value=new n,n}(),Su=function(){function n(){}return n.value=new n,n}(),hC=function(){function n(){}return n.value=new n,n}(),_o=function(){function n(){}return n.value=new n,n}(),yC=function(){function n(){}return n.value=new n,n}(),pc=function(){function n(){}return n.value=new n,n}(),TC=function(){function n(){}return n.value=new n,n}(),bC=function(n){if(n instanceof oC)return"button";if(n instanceof _r)return"checkbox";if(n instanceof uC)return"color";if(n instanceof iC)return"date";if(n instanceof fC)return"datetime-local";if(n instanceof cC)return"email";if(n instanceof lC)return"file";if(n instanceof sC)return"hidden";if(n instanceof pC)return"image";if(n instanceof _C)return"month";if(n instanceof mC)return"number";if(n instanceof dC)return"password";if(n instanceof vC)return"radio";if(n instanceof gC)return"range";if(n instanceof sc)return"reset";if(n instanceof DC)return"search";if(n instanceof Su)return"submit";if(n instanceof hC)return"tel";if(n instanceof _o)return"text";if(n instanceof yC)return"time";if(n instanceof pc)return"url";if(n instanceof TC)return"week";throw new Error("Failed pattern match at DOM.HTML.Indexed.InputType (line 33, column 19 - line 55, column 22): "+[n.constructor.name])};var gW={dimap:function(n){return function(e){return function(t){return function(a){return t(n(a))}}}}},mo={first:function(n){return function(e){return n(Ce(e))}},second:function(n){return function(e){return n(Re(e))}},Profunctor0:function(){return gW}};var Ft={first:function(n){return function(e){return new nn(n(e.value0),e.value1)}},second:M($o),Profunctor0:function(){return i_}};var O_=function(n){return n.first};var xW=kt(),LW=fn(cn);var HW=function(n){return xW(n(LW))},IW=function(n){return function(e){return HW(e)(n)}},Au=function(n){var e=Oa(n);return function(t){return e(function(a){return IW(a)(t)})}};var SW=function(n){return function(e){var t=Qf(e.Profunctor0()),a=O_(e);return function(u){return t(n)(function(i){return i.value1(i.value0)})(a(u))}}},Vt=function(n){return function(e){return function(t){return SW(function(a){return new nn(n(a),function(u){return e(a)(u)})})(t)}}};var EC=function(n){return n},AW=function(n){return function(e){return EC(n)($(e))}};var Nu=function(n){var e=qn(n.Monad0().Bind1().Apply0().Functor0()),t=Sf(n);return function(a){return function(u){return e(t(EC(a)(u)))}}};var _c=function(n){var e=qn(n.Monad0().Bind1().Apply0().Functor0()),t=Sf(n);return function(a){return function(u){return e(t(AW(a)(u)))}}};var ga={liftAff:fn(cn),MonadEffect0:function(){return pt}},rr=function(n){return n.liftAff};var Rg=x,wC=x;var $W=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}();var xC=function(n){return function(e){return Rg(function(t){return n(t.value0)(t.value1)})(e)}};var LC=function(n){return function(e){return wC(new $W(n,e))}},Og={map:function(n){return function(e){return Rg(function(t){return LC(function(a){return n(t.value0(a))})(t.value1)})(e)}}};var HC=LC(fn(cn));var k_=function(n,e,t){var a=0,u;return function(i){if(a===2)return u;if(a===1)throw new ReferenceError(n+" was needed before it finished initializing (module "+e+", line "+i+")",e,i);return a=1,u=t(),a=2,u}};var qW=M(ie);var ft=function(){function n(){}return n.value=new n,n}(),je=function(){function n(e,t,a,u,i,f){this.value0=e,this.value1=t,this.value2=a,this.value3=u,this.value4=i,this.value5=f}return n.create=function(e){return function(t){return function(a){return function(u){return function(i){return function(f){return new n(e,t,a,u,i,f)}}}}}},n}();var U_=function(){function n(e,t,a){this.value0=e,this.value1=t,this.value2=a}return n.create=function(e){return function(t){return function(a){return new n(e,t,a)}}},n}(),IC=function(){function n(e,t,a){this.value0=e,this.value1=t,this.value2=a}return n.create=function(e){return function(t){return function(a){return new n(e,t,a)}}},n}(),Da=function(n,e,t,a){if(t instanceof ft){if(a instanceof ft)return new je(1,1,n,e,t,a);if(a instanceof je)return new je(1+a.value0|0,1+a.value1|0,n,e,t,a);throw new Error("Failed pattern match at Data.Map.Internal (line 680, column 5 - line 684, column 39): "+[a.constructor.name])}if(t instanceof je){if(a instanceof ft)return new je(1+t.value0|0,1+t.value1|0,n,e,t,a);if(a instanceof je)return new je(1+function(){var u=t.value0>a.value0;return u?t.value0:a.value0}()|0,(1+t.value1|0)+a.value1|0,n,e,t,a);throw new Error("Failed pattern match at Data.Map.Internal (line 686, column 5 - line 690, column 68): "+[a.constructor.name])}throw new Error("Failed pattern match at Data.Map.Internal (line 678, column 32 - line 690, column 68): "+[t.constructor.name])};var Ug=function(n){return function(e){return new je(1,1,n,e,ft.value,ft.value)}},Go=function(){var n=function(a){if(a instanceof ft)return 0;if(a instanceof je)return a.value0;throw new Error("Failed pattern match at Data.Map.Internal (line 735, column 12 - line 737, column 26): "+[a.constructor.name])},e=function(a,u,i,f,l,p,d){return p instanceof je&&p.value0>n(d)?Da(p.value2,p.value3,Da(a,u,i,p.value4),Da(f,l,p.value5,d)):Da(f,l,Da(a,u,i,p),d)},t=function(a,u,i,f,l,p,d){return p instanceof je&&n(l)<=p.value0?Da(p.value2,p.value3,Da(i,f,l,p.value4),Da(a,u,p.value5,d)):Da(i,f,l,Da(a,u,p,d))};return function(a,u,i,f){if(i instanceof ft)return f instanceof ft?Ug(a)(u):f instanceof je&&f.value0>1?e(a,u,i,f.value2,f.value3,f.value4,f.value5):Da(a,u,i,f);if(i instanceof je){if(f instanceof je){if(f.value0>(i.value0+1|0))return e(a,u,i,f.value2,f.value3,f.value4,f.value5);if(i.value0>(f.value0+1|0))return t(a,u,i.value2,i.value3,i.value4,i.value5,f)}return f instanceof ft&&i.value0>1?t(a,u,i.value2,i.value3,i.value4,i.value5,f):Da(a,u,i,f)}throw new Error("Failed pattern match at Data.Map.Internal (line 695, column 40 - line 716, column 34): "+[i.constructor.name])}}(),Wg=k_("unsafeSplit","Data.Map.Internal",function(){return function(n,e,t){if(t instanceof ft)return new U_(b.value,ft.value,ft.value);if(t instanceof je){var a=n(e)(t.value2);if(a instanceof X){var u=Wg(771)(n,e,t.value4);return new U_(u.value0,u.value1,Go(t.value2,t.value3,u.value2,t.value5))}if(a instanceof Y){var u=Wg(774)(n,e,t.value5);return new U_(u.value0,Go(t.value2,t.value3,t.value4,u.value1),u.value2)}if(a instanceof Dn)return new U_(new y(t.value3),t.value4,t.value5);throw new Error("Failed pattern match at Data.Map.Internal (line 769, column 5 - line 777, column 30): "+[a.constructor.name])}throw new Error("Failed pattern match at Data.Map.Internal (line 765, column 34 - line 777, column 30): "+[t.constructor.name])}}),SC=Wg(764),AC=k_("unsafeSplitLast","Data.Map.Internal",function(){return function(n,e,t,a){if(a instanceof ft)return new IC(n,e,t);if(a instanceof je){var u=AC(757)(a.value2,a.value3,a.value4,a.value5);return new IC(u.value0,u.value1,Go(n,e,t,u.value2))}throw new Error("Failed pattern match at Data.Map.Internal (line 754, column 37 - line 758, column 57): "+[a.constructor.name])}}),BW=AC(753),kg=function(n,e){if(n instanceof ft)return e;if(n instanceof je){var t=BW(n.value2,n.value3,n.value4,n.value5);return Go(t.value0,t.value1,t.value2,e)}throw new Error("Failed pattern match at Data.Map.Internal (line 742, column 25 - line 746, column 38): "+[n.constructor.name,e.constructor.name])};var NC=function(n){var e=ln(n);return function(t){return function(a){var u=SC(e,t,a);return qW(function(i){return new nn(i,kg(u.value1,u.value2))})(u.value0)}}};var mc=function(n){var e=ln(n);return function(t){var a=function(u){var i=!1,f;function l(p){if(p instanceof ft)return i=!0,b.value;if(p instanceof je){var d=e(t)(p.value2);if(d instanceof X){u=p.value4;return}if(d instanceof Y){u=p.value5;return}if(d instanceof Dn)return i=!0,new y(p.value3);throw new Error("Failed pattern match at Data.Map.Internal (line 281, column 7 - line 284, column 22): "+[d.constructor.name])}throw new Error("Failed pattern match at Data.Map.Internal (line 278, column 8 - line 284, column 22): "+[p.constructor.name])}for(;!i;)f=l(u);return f};return a}};var dc=function(n){var e=ln(n);return function(t){return function(a){var u=function(i){if(i instanceof ft)return Ug(t)(a);if(i instanceof je){var f=e(t)(i.value2);if(f instanceof X)return Go(i.value2,i.value3,u(i.value4),i.value5);if(f instanceof Y)return Go(i.value2,i.value3,i.value4,u(i.value5));if(f instanceof Dn)return new je(i.value0,i.value1,t,a,i.value4,i.value5);throw new Error("Failed pattern match at Data.Map.Internal (line 469, column 7 - line 472, column 35): "+[f.constructor.name])}throw new Error("Failed pattern match at Data.Map.Internal (line 466, column 8 - line 472, column 35): "+[i.constructor.name])};return u}}};var $_={foldr:function(n){return function(e){var t=k_("go","Data.Map.Internal",function(){return function(u,i){if(u instanceof ft)return i;if(u instanceof je)return t(170)(u.value4,n(u.value3)(t(170)(u.value5,i)));throw new Error("Failed pattern match at Data.Map.Internal (line 167, column 26 - line 170, column 43): "+[u.constructor.name])}}),a=t(167);return function(u){return a(u,e)}}},foldl:function(n){return function(e){var t=k_("go","Data.Map.Internal",function(){return function(u,i){if(i instanceof ft)return u;if(i instanceof je)return t(176)(n(t(176)(u,i.value4))(i.value3),i.value5);throw new Error("Failed pattern match at Data.Map.Internal (line 173, column 26 - line 176, column 43): "+[i.constructor.name])}}),a=t(173);return function(u){return a(e,u)}}},foldMap:function(n){var e=Zn(n),t=mn(n.Semigroup0());return function(a){var u=function(i){if(i instanceof ft)return e;if(i instanceof je)return t(u(i.value4))(t(a(i.value3))(u(i.value5)));throw new Error("Failed pattern match at Data.Map.Internal (line 179, column 10 - line 182, column 28): "+[i.constructor.name])};return u}}};var Yo=function(){return ft.value}();var RC=function(n){var e=ln(n);return function(t){var a=function(u){if(u instanceof ft)return ft.value;if(u instanceof je){var i=e(t)(u.value2);if(i instanceof X)return Go(u.value2,u.value3,a(u.value4),u.value5);if(i instanceof Y)return Go(u.value2,u.value3,u.value4,a(u.value5));if(i instanceof Dn)return kg(u.value4,u.value5);throw new Error("Failed pattern match at Data.Map.Internal (line 496, column 7 - line 499, column 43): "+[i.constructor.name])}throw new Error("Failed pattern match at Data.Map.Internal (line 493, column 8 - line 499, column 43): "+[u.constructor.name])};return a}};var OC=function(n){var e=ln(n);return function(t){return function(a){return function(u){var i=SC(e,a,u),f=t(i.value0);if(f instanceof b)return kg(i.value1,i.value2);if(f instanceof y)return Go(a,f.value0,i.value1,i.value2);throw new Error("Failed pattern match at Data.Map.Internal (line 512, column 3 - line 516, column 41): "+[f.constructor.name])}}}};var JW=function(){function n(e,t,a){this.value0=e,this.value1=t,this.value2=a}return n.create=function(e){return function(t){return function(a){return new n(e,t,a)}}},n}();var q_=function(n){return JW.create(gn(n.Eq0()))(ln(n))},QW={eq:function(n){return function(e){return n.value0(n.value2)(e.value2)}}},PC={compare:function(n){return function(e){return n.value1(n.value2)(e.value2)}},Eq0:function(){return QW}};var $g=ml(ut)(PC);var zW=NC($g),GW=mc($g),YW=dc($g);var WC=function(){return function(n){var e=lt(n);return function(t){var a=q_(t);return function(u){return function(i){return function(f){return zW(new nn(e(u),a(i)))(f)}}}}}},qg=function(){return function(n){var e=lt(n);return function(t){var a=q_(t);return function(u){return function(i){return function(f){return GW(new nn(e(u),a(i)))(f)}}}}}},UC=function(){return function(n){var e=lt(n);return function(t){var a=q_(t);return function(u){return function(i){return function(f){return function(l){return YW(new nn(e(u),a(i)))(f)(l)}}}}}}},kC=function(n){var e=et(n)($_);return function(t){return function(a){return e(function(u){return a(u)})(t)}}},vc=Yo;var gc=function(){function n(){}return n.value=new n,n}(),$C=function(){function n(){}return n.value=new n,n}(),qC=function(){function n(){}return n.value=new n,n}(),BC=function(){function n(){}return n.value=new n,n}(),VC=function(){function n(){}return n.value=new n,n}(),JC=function(){function n(){}return n.value=new n,n}(),QC=function(){function n(){}return n.value=new n,n}(),jC=function(){function n(){}return n.value=new n,n}(),zC=function(){function n(){}return n.value=new n,n}(),GC=function(){function n(){}return n.value=new n,n}(),YC=function(){function n(){}return n.value=new n,n}(),KC=function(){function n(){}return n.value=new n,n}(),ZC=function(){function n(){}return n.value=new n,n}(),XC=function(){function n(){}return n.value=new n,n}(),n0=function(){function n(){}return n.value=new n,n}(),e0=function(){function n(){}return n.value=new n,n}(),t0=function(){function n(){}return n.value=new n,n}(),r0=function(){function n(){}return n.value=new n,n}(),a0=function(){function n(){}return n.value=new n,n}(),o0=function(){function n(){}return n.value=new n,n}(),u0=function(){function n(){}return n.value=new n,n}(),i0=function(){function n(){}return n.value=new n,n}(),f0=function(){function n(){}return n.value=new n,n}(),c0=function(){function n(){}return n.value=new n,n}(),l0=function(){function n(){}return n.value=new n,n}(),s0=function(){function n(){}return n.value=new n,n}(),p0=function(){function n(){}return n.value=new n,n}(),_0=function(){function n(){}return n.value=new n,n}(),m0=function(){function n(){}return n.value=new n,n}(),d0=function(){function n(){}return n.value=new n,n}(),v0=function(){function n(){}return n.value=new n,n}(),g0=function(){function n(){}return n.value=new n,n}(),D0=function(){function n(){}return n.value=new n,n}(),h0=function(){function n(){}return n.value=new n,n}(),y0=function(){function n(){}return n.value=new n,n}(),T0=function(){function n(){}return n.value=new n,n}(),b0=function(){function n(){}return n.value=new n,n}(),M0=function(){function n(){}return n.value=new n,n}(),E0=function(){function n(){}return n.value=new n,n}(),C0=function(){function n(){}return n.value=new n,n}(),F0=function(){function n(){}return n.value=new n,n}(),w0=function(){function n(){}return n.value=new n,n}(),x0=function(){function n(){}return n.value=new n,n}(),L0=function(){function n(){}return n.value=new n,n}(),H0=function(){function n(){}return n.value=new n,n}(),I0=function(){function n(){}return n.value=new n,n}(),S0=function(){function n(){}return n.value=new n,n}(),A0=function(){function n(){}return n.value=new n,n}(),N0=function(){function n(){}return n.value=new n,n}(),R0=function(){function n(){}return n.value=new n,n}(),O0=function(){function n(){}return n.value=new n,n}(),P0=function(){function n(){}return n.value=new n,n}(),W0=function(){function n(){}return n.value=new n,n}(),U0=function(){function n(){}return n.value=new n,n}(),k0=function(){function n(){}return n.value=new n,n}(),$0=function(){function n(){}return n.value=new n,n}(),q0=function(n){if(n instanceof gc)return"off";if(n instanceof $C)return"on";if(n instanceof qC)return"name";if(n instanceof BC)return"honorific-prefix";if(n instanceof VC)return"given-name";if(n instanceof JC)return"additional-name";if(n instanceof QC)return"family-name";if(n instanceof jC)return"honorific-suffix";if(n instanceof zC)return"nickname";if(n instanceof GC)return"email";if(n instanceof YC)return"username";if(n instanceof KC)return"new-password";if(n instanceof ZC)return"current-password";if(n instanceof XC)return"one-time-code";if(n instanceof n0)return"organization-title";if(n instanceof e0)return"organization";if(n instanceof t0)return"street-address";if(n instanceof r0)return"address-line1";if(n instanceof a0)return"address-line2";if(n instanceof o0)return"address-line3";if(n instanceof u0)return"address-level1";if(n instanceof i0)return"address-level2";if(n instanceof f0)return"address-level3";if(n instanceof c0)return"address-level4";if(n instanceof l0)return"country";if(n instanceof s0)return"country-name";if(n instanceof p0)return"postal-code";if(n instanceof _0)return"cc-name";if(n instanceof m0)return"cc-given-name";if(n instanceof d0)return"cc-additional-name";if(n instanceof v0)return"cc-family-name";if(n instanceof g0)return"cc-number";if(n instanceof D0)return"cc-exp";if(n instanceof h0)return"cc-exp-month";if(n instanceof y0)return"cc-exp-year";if(n instanceof T0)return"cc-csc";if(n instanceof b0)return"cc-type";if(n instanceof M0)return"transaction-currency";if(n instanceof E0)return"transaction-amount";if(n instanceof C0)return"language";if(n instanceof F0)return"bday";if(n instanceof w0)return"bday-day";if(n instanceof x0)return"bday-month";if(n instanceof L0)return"bday-year";if(n instanceof H0)return"sex";if(n instanceof I0)return"tel";if(n instanceof S0)return"tel-country-code";if(n instanceof A0)return"tel-national";if(n instanceof N0)return"telarea-code";if(n instanceof R0)return"tel-local";if(n instanceof O0)return"tel-local-prefix";if(n instanceof P0)return"tel-local-suffix";if(n instanceof W0)return"tel-extension";if(n instanceof U0)return"impp";if(n instanceof k0)return"url";if(n instanceof $0)return"photo";throw new Error("Failed pattern match at DOM.HTML.Indexed.AutocompleteType (line 67, column 26 - line 123, column 31): "+[n.constructor.name])};var Se=function(){function n(){}return n.value=new n,n}(),B0=function(){function n(){}return n.value=new n,n}(),V0=function(){function n(){}return n.value=new n,n}(),J0=function(n){if(n instanceof Se)return"button";if(n instanceof B0)return"submit";if(n instanceof V0)return"reset";throw new Error("Failed pattern match at DOM.HTML.Indexed.ButtonType (line 14, column 20 - line 17, column 25): "+[n.constructor.name])};var V_=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),Ru=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}();var ze=function(){function n(e,t,a,u){this.value0=e,this.value1=t,this.value2=a,this.value3=u}return n.create=function(e){return function(t){return function(a){return function(u){return new n(e,t,a,u)}}}},n}(),ts=x,wr=function(n,e){return n.value2(n.value1,e)},Ge=x,xr=function(n){return n.value3(n.value1)},Jt=ts(function(n){return n.value0});var Q0=M(Ae),cU=M($o);var Ou=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Ko=function(){function n(e,t,a,u){this.value0=e,this.value1=t,this.value2=a,this.value3=u}return n.create=function(e){return function(t){return function(a){return function(u){return new n(e,t,a,u)}}}},n}(),Pu=function(){function n(e,t,a,u){this.value0=e,this.value1=t,this.value2=a,this.value3=u}return n.create=function(e){return function(t){return function(a){return function(u){return new n(e,t,a,u)}}}},n}(),Wu=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Zo=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),lU=function(){function n(e,t,a){this.value0=e,this.value1=t,this.value2=a}return n.create=function(e){return function(t){return function(a){return new n(e,t,a)}}},n}(),j0=function(n){return function(e){return n(e)}};var sU=x;var pU={bimap:function(n){return function(e){return j0(function(t){return sU(new lU(function(a){return n(t.value0(a))},function(a){return e(t.value1(a))},t.value2))})}}},_U=Bo(pU);var Wi=j0(function(n){var e=function(t){if(t instanceof Ou)return new Ou(t.value0);if(t instanceof Ko)return new Ko(t.value0,t.value1,n.value0(t.value2),Q0(e)(t.value3));if(t instanceof Pu)return new Pu(t.value0,t.value1,n.value0(t.value2),Q0(cU(e))(t.value3));if(t instanceof Wu)return new Wu(n.value1(t.value0));if(t instanceof Zo)return new Zo(_U(n.value0)(n.value1)(t.value0));throw new Error("Failed pattern match at Halogen.VDom.Types (line 86, column 7 - line 86, column 27): "+[t.constructor.name])};return e(n.value2)});function Ui(n,e){return e[n]}function Jg(n,e){return e.hasOwnProperty(n)}function Xo(n,e,t){t[n]=e}function Qg(n,e){for(var t=[],a=0;a<n.length;a++)t.push(e(a,n[a]));return t}function jg(n,e){for(var t=0;t<n.length;t++)e(n[t])}function zg(n,e){for(var t=Object.keys(n),a=0;a<t.length;a++){var u=t[a];e(u,n[u])}}function Gg(n,e,t,a,u){for(var i=[],f=n.length,l=e.length,p=0;;){if(p<f)p<l?i.push(t(p,n[p],e[p])):a(p,n[p]);else if(p<l)i.push(u(p,e[p]));else break;p++}return i}function rs(n,e,t){for(var a={},u=0;u<n.length;u++){var i=n[u],f=e(i);a[f]=t(f,u,i)}return a}function as(n,e,t,a,u,i){for(var f={},l=0;l<e.length;l++){var p=e[l],d=t(p);n.hasOwnProperty(d)?f[d]=a(d,l,n[d],p):f[d]=i(d,l,p)}for(var d in n)d in f||u(d,n[d]);return f}function ki(n,e){return n===e}function Yg(n,e){return e.createTextNode(n)}function Kg(n,e){e.textContent=n}function Q_(n,e,t){return n!=null?t.createElementNS(n,e):t.createElement(e)}function Uu(n,e,t){var a=t.childNodes.item(n)||null;a!==e&&t.insertBefore(e,a)}function os(n,e){e&&n.parentNode===e&&e.removeChild(n)}function us(n){return n.parentNode}function j_(n,e,t,a){n!=null?a.setAttributeNS(n,e,t):a.setAttribute(e,t)}function z_(n,e,t){n!=null?t.removeAttributeNS(n,e):t.removeAttribute(e)}function Zg(n,e,t){return n!=null?t.hasAttributeNS(n,e):t.hasAttribute(e)}function Xg(n,e,t){t.addEventListener(n,e,!1)}function nD(n,e,t){t.removeEventListener(n,e,!1)}var eD=void 0;var tD=Ui,rD=x,aD=Xo,oD=e_;var G_=function(n){return function(e){return e[n]}},vU=G_("namespaceURI"),gU=G_("prefix"),DU=G_("localName"),hU=G_("tagName");function iD(n){return function(e){return function(t){return function(){t.setAttribute(n,e)}}}}var Y_=function(n){return function(e){return function(){return e[n]}}},TU=Y_("children"),bU=Y_("firstElementChild"),MU=Y_("lastElementChild"),EU=Y_("childElementCount");function z0(n){return function(e){return function(){return e.querySelector(n)}}}var wU=M(On);var fD=function(n){var e=wU(Xn),t=z0(n);return function(a){return e(t(a))}};var cD=x;var is=function(n,e,t){var a=0,u;return function(i){if(a===2)return u;if(a===1)throw new ReferenceError(n+" was needed before it finished initializing (module "+e+", line "+i+")",e,i);return a=1,u=t(),a=2,u}};var sD=function(n){return xr(n.widget)},pD=is("patchWidget","Halogen.VDom.DOM",function(){return function(n,e){if(e instanceof Zo)return pD(291)(n,Wi(e.value0));if(e instanceof Wu){var t=wr(n.widget,e.value0),a=ts(function(u){return Ge(new ze(u.value0,{build:n.build,widget:t},pD(296),sD))})(t);return a}return sD(n),n.build(e)}}),HU=pD(286),K_=function(n){var e=us(n.node);return os(n.node,e)},Z_=is("patchText","Halogen.VDom.DOM",function(){return function(n,e){if(e instanceof Zo)return Z_(82)(n,Wi(e.value0));if(e instanceof Ou){if(n.value===e.value0)return Ge(new ze(n.node,n,Z_(85),K_));if(ct){var t={build:n.build,node:n.node,value:e.value0};return Kg(e.value0,n.node),Ge(new ze(n.node,t,Z_(89),K_))}}return K_(n),n.build(e)}}),IU=Z_(77),X_=function(n){var e=us(n.node);return os(n.node,e),zg(n.children,function(t,a){return xr(a)}),xr(n.attrs)},nm=function(n){var e=us(n.node);return os(n.node,e),jg(n.children,xr),xr(n.attrs)},Y0=function(n,e,t,a){var u=e===a;return u?n instanceof y&&t instanceof y&&n.value0===t.value0||n instanceof b&&t instanceof b:!1},em=is("patchElem","Halogen.VDom.DOM",function(){return function(n,e){if(e instanceof Zo)return em(135)(n,Wi(e.value0));if(e instanceof Ko&&Y0(n.ns,n.name,e.value0,e.value1)){var t=fa(e.value3),a=fa(n.children);if(a===0&&t===0){var p=wr(n.attrs,e.value2),d={build:n.build,node:n.node,attrs:p,ns:e.value0,name:e.value1,children:n.children};return Ge(new ze(n.node,d,em(149),nm))}var u=function(m,v){return xr(v)},i=function(m,v,g){var h=wr(v,g);return Uu(m,Jt(h),n.node),h},f=function(m,v){var g=n.build(v);return Uu(m,Jt(g),n.node),g},l=Gg(n.children,e.value3,i,u,f),p=wr(n.attrs,e.value2),d={build:n.build,node:n.node,attrs:p,ns:e.value0,name:e.value1,children:l};return Ge(new ze(n.node,d,em(172),nm))}return nm(n),n.build(e)}}),SU=em(130),tm=is("patchKeyed","Halogen.VDom.DOM",function(){return function(n,e){if(e instanceof Zo)return tm(222)(n,Wi(e.value0));if(e instanceof Pu&&Y0(n.ns,n.name,e.value0,e.value1)){var t=fa(e.value3);if(n.length===0&&t===0){var l=wr(n.attrs,e.value2),p={build:n.build,node:n.node,attrs:l,ns:e.value0,name:e.value1,children:n.children,length:0};return Ge(new ze(n.node,p,tm(237),X_))}var a=function(d,m){return xr(m)},u=function(d,m,v,g){var h=wr(v,g.value1);return Uu(m,Jt(h),n.node),h},i=function(d,m,v){var g=n.build(v.value1);return Uu(m,Jt(g),n.node),g},f=as(n.children,e.value3,Ce,u,a,i),l=wr(n.attrs,e.value2),p={build:n.build,node:n.node,attrs:l,ns:e.value0,name:e.value1,children:f,length:t};return Ge(new ze(n.node,p,tm(261),X_))}return X_(n),n.build(e)}}),AU=tm(217),NU=function(n,e,t){var a=n.buildWidget(n)(t),u=ts(function(i){return Ge(new ze(i.value0,{build:e,widget:a},HU,sD))})(a);return u},RU=function(n,e,t){var a=Yg(t,n.document),u={build:e,node:a,value:t};return Ge(new ze(a,u,IU,K_))},OU=function(n,e,t,a,u,i){var f=Q_(Bt(t),a,n.document),l=cD(f),p=function(g,h,E){var F=e(E.value1);return Uu(h,Jt(F),l),F},d=rs(i,Ce,p),m=n.buildAttributes(f)(u),v={build:e,node:l,attrs:m,ns:t,name:a,children:d,length:fa(i)};return Ge(new ze(l,v,AU,X_))},PU=function(n,e,t,a,u,i){var f=Q_(Bt(t),a,n.document),l=cD(f),p=function(g,h){var E=e(h);return Uu(g,Jt(E),l),E},d=Qg(i,p),m=n.buildAttributes(f)(u),v={build:e,node:l,attrs:m,ns:t,name:a,children:d};return Ge(new ze(l,v,SU,nm))},fs=function(n){var e=is("build","Halogen.VDom.DOM",function(){return function(a){if(a instanceof Ou)return RU(n,e(59),a.value0);if(a instanceof Ko)return PU(n,e(60),a.value0,a.value1,a.value2,a.value3);if(a instanceof Pu)return OU(n,e(61),a.value0,a.value1,a.value2,a.value3);if(a instanceof Wu)return NU(n,e(62),a.value0);if(a instanceof Zo)return e(63)(Wi(a.value0));throw new Error("Failed pattern match at Halogen.VDom.DOM (line 58, column 27 - line 63, column 52): "+[a.constructor.name])}}),t=e(58);return t};function rm(n){return function(){return function(e){return n(e)()}}}var kU=function(n,e,t){var a=0,u;return function(i){if(a===2)return u;if(a===1)throw new ReferenceError(n+" was needed before it finished initializing (module "+e+", line "+i+")",e,i);return a=1,u=t(),a=2,u}};var vD=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),gD=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),nu=function(){function n(e,t,a){this.value0=e,this.value1=t,this.value2=a}return n.create=function(e){return function(t){return function(a){return new n(e,t,a)}}},n}(),ku=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),$u=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),$i=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),$U=Ui,dD=Xo,qU=function(n,e){var t=Zg(null,n,e);if(t)return z_(null,n,e);var a=Ul(Ui(n,e));return a==="string"?Xo(n,"",e):n==="rowSpan"?Xo(n,1,e):n==="colSpan"?Xo(n,1,e):Xo(n,eD,e)},X0=function(n){if(n instanceof nu&&n.value0 instanceof y)return"attr/"+(n.value0.value0+(":"+n.value1));if(n instanceof nu)return"attr/:"+n.value1;if(n instanceof ku)return"prop/"+n.value0;if(n instanceof $u)return"handler/"+n.value0;if(n instanceof $i)return"ref";throw new Error("Failed pattern match at Halogen.VDom.DOM.Prop (line 182, column 16 - line 187, column 16): "+[n.constructor.name])},cs=x;var nF=x,eF=x;var tF=function(n){return function(e){var t=function(m){return function(v,g){if(g instanceof nu)return z_(Bt(g.value0),g.value1,e);if(g instanceof ku)return qU(g.value0,e);if(g instanceof $u){var h=tD(g.value0,m);return nD(g.value0,Ce(h),e)}if(g instanceof $i)return void 0;throw new Error("Failed pattern match at Halogen.VDom.DOM.Prop (line 169, column 5 - line 179, column 18): "+[g.constructor.name])}},a=function(m){return m instanceof y?n(m.value0)():void 0},u=function(m){var v=Rb("ref")(m.props);return v instanceof y&&v.value0 instanceof $i?a(v.value0.value0(new gD(e))):void 0},i=function(m,v){return function(g,h,E,F){if(E instanceof nu&&F instanceof nu){var W=E.value2===F.value2;return W||j_(Bt(F.value0),F.value1,F.value2,e),F}if(E instanceof ku&&F instanceof ku){var sn=ki(E.value1,F.value1);if(sn)return F;if(F.value0==="value"){var wn=$U("value",e),Rn=ki(wn,F.value1);return Rn||dD(F.value0,F.value1,e),F}return dD(F.value0,F.value1,e),F}if(E instanceof $u&&F instanceof $u){var En=tD(F.value0,m);return ve(F.value1)(Re(En))(),aD(F.value0,En,v),F}return F}},f=function(m){return function(v,g,h){if(h instanceof nu)return j_(Bt(h.value0),h.value1,h.value2,e),h;if(h instanceof ku)return dD(h.value0,h.value1,e),h;if(h instanceof $u){var E=Ui(h.value0,m);if(Jg(h.value0,m))return ve(h.value1)(Re(E))(),h;var F=qe(h.value1)(),W=rm(function(sn){return function(){var Rn=hn(F)();return a(Rn(sn))}})();return aD(h.value0,new nn(W,F),m),Xg(h.value0,W,e),h}if(h instanceof $i)return a(h.value0(new vD(e))),h;throw new Error("Failed pattern match at Halogen.VDom.DOM.Prop (line 113, column 5 - line 135, column 15): "+[h.constructor.name])}},l=kU("patchProp","Halogen.VDom.DOM.Prop",function(){return function(m,v){var g=oD(),h=t(m.events),E=i(m.events,g),F=f(g),W=as(m.props,v,X0,E,h,F),sn={events:rD(g),props:W};return Ge(new ze(void 0,sn,l(100),u))}}),p=l(87),d=function(m){var v=oD(),g=rs(m,X0,f(v)),h={events:rD(v),props:g};return Ge(new ze(void 0,h,p,u))};return d}};var hD=function(n){return n},oF=function(n){return hD(Wu.create(n))},JU=function(n){return n.toPropValue},P=function(n){return hD(Ou.create(n))},uF=function(n){return new $i(function(e){return n(function(t){if(t instanceof vD)return new y(t.value0);if(t instanceof gD)return b.value;throw new Error("Failed pattern match at Halogen.HTML.Core (line 109, column 21 - line 111, column 23): "+[t.constructor.name])}(e))})},iF=function(n){var e=JU(n);return function(t){var a=ku.create(t);return function(u){return a(e(u))}}};var qu={toPropValue:cs};var fF={toPropValue:nF},Bu={toPropValue:function(n){return cs(bC(n))}};var Vu={toPropValue:function(n){return cs(J0(n))}},cF={toPropValue:eF},lF={toPropValue:function(n){return cs(q0(n))}},am=function(){return $u.create}(),sF=function(n){return function(e){return function(t){return function(a){return new Ko(n,e,t,a)}}}};var pF=function(n){return function(e){return nu.create(n)(e)}};var QU=fn(cn);var om=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),yD=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),TD=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),_F=function(n){return function(e){return new TD(n,e)}},mF=function(){return yD.create}(),dF=function(n){var e=S(n);return function(t){return function(a){return function(u){return function(i){return function(f){if(i instanceof om)return new nn(new In({func:e(i.value0),count:f},t),a);if(i instanceof yD)return new nn(new In({func:u(i.value0),count:f},t),a);if(i instanceof TD)return dF(n)(t)(lM(i.value1)(a))(u)(i.value0)(f+1|0);throw new Error("Failed pattern match at Control.Applicative.Free (line 102, column 41 - line 105, column 81): "+[i.constructor.name])}}}}}},vF=function(n){var e=oe(n.Apply0());return function(t){return function(a){return function(u){if(t instanceof Sn)return new z(u);if(t instanceof In){var i=e(t.value0.func)(u),f=t.value0.count===1;if(f)return t.value1 instanceof Sn?new z(i):vF(n)(t.value1)(a)(i);if(a instanceof Sn)return new z(i);if(a instanceof In)return new Q(new nn(new In({func:i,count:t.value0.count-1|0},t.value1),new io(a.value0,a.value1)));throw new Error("Failed pattern match at Control.Applicative.Free (line 83, column 11 - line 88, column 50): "+[a.constructor.name])}throw new Error("Failed pattern match at Control.Applicative.Free (line 72, column 3 - line 88, column 50): "+[t.constructor.name])}}}},gF={map:function(n){return function(e){return _F(new om(n))(e)}}},DF=function(n){var e=vF(n),t=S(n),a=dF(n);return function(u){return function(i){var f=function(l){var p=!1,d;function m(v){if(v.value1.value0 instanceof om){var g=e(v.value0)(v.value1.value1)(t(v.value1.value0.value0));if(g instanceof z)return p=!0,g.value0;if(g instanceof Q){l=g.value0;return}throw new Error("Failed pattern match at Control.Applicative.Free (line 54, column 17 - line 56, column 24): "+[g.constructor.name])}if(v.value1.value0 instanceof yD){var g=e(v.value0)(v.value1.value1)(u(v.value1.value0.value0));if(g instanceof z)return p=!0,g.value0;if(g instanceof Q){l=g.value0;return}throw new Error("Failed pattern match at Control.Applicative.Free (line 57, column 17 - line 59, column 24): "+[g.constructor.name])}if(v.value1.value0 instanceof TD){var h=new io(v.value1.value0.value1,v.value1.value1);l=a(v.value0)(h)(u)(v.value1.value0.value0)(1);return}throw new Error("Failed pattern match at Control.Applicative.Free (line 53, column 5 - line 62, column 47): "+[v.value1.value0.constructor.name])}for(;!p;)d=m(l);return d};return f(new nn(Sn.value,Jf(i)))}}},hF=function(n){return DF(n)(QU)},yF={apply:function(n){return function(e){return _F(n)(e)}},Functor0:function(){return gF}},TF=function(){return{pure:om.create,Apply0:function(){return yF}}}(),jU=DF(TF),bD=function(n){return jU(function(e){return mF(n(e))})};var um=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}();var MF=function(n){var e=!1,t;function a(u){if(u.value0 instanceof Sn&&u.value1 instanceof Sn)return e=!0,b.value;if(u.value0 instanceof Sn){n=new um(Li(u.value1),Sn.value);return}if(u.value0 instanceof In)return e=!0,new y(new nn(u.value0.value0,new um(u.value0.value1,u.value1)));throw new Error("Failed pattern match at Data.CatQueue (line 82, column 1 - line 82, column 63): "+[u.constructor.name])}for(;!e;)t=a(n);return t},EF=function(n){return function(e){return new um(n.value0,new In(e,n.value1))}};var CF=function(n){return n.value0 instanceof Sn&&n.value1 instanceof Sn};var FF=function(){return new um(Sn.value,Sn.value)}();var Dc=function(){function n(){}return n.value=new n,n}(),im=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}();var wF=function(n){return function(e){if(n instanceof Dc)return e;if(e instanceof Dc)return n;if(n instanceof im)return new im(n.value0,EF(n.value1)(e));throw new Error("Failed pattern match at Data.CatList (line 108, column 1 - line 108, column 54): "+[n.constructor.name,e.constructor.name])}},GU=function(n){return function(e){return function(t){var a=function(i){return function(f){return function(l){var p=i,d=f,m=!1,v;function g(h,E,F){if(F instanceof Sn)return m=!0,E;if(F instanceof In){p=h,d=h(E)(F.value0),l=F.value1;return}throw new Error("Failed pattern match at Data.CatList (line 124, column 3 - line 124, column 59): "+[h.constructor.name,E.constructor.name,F.constructor.name])}for(;!m;)v=g(p,d,l);return v}}},u=function(i){return function(f){var l=i,p=!1,d;function m(v,g){var h=MF(v);if(h instanceof b)return p=!0,a(function(E){return function(F){return F(E)}})(e)(g);if(h instanceof y){l=h.value0.value1,f=new In(n(h.value0.value0),g);return}throw new Error("Failed pattern match at Data.CatList (line 120, column 14 - line 122, column 67): "+[h.constructor.name])}for(;!p;)d=m(l,f);return d}};return u(t)(Sn.value)}}},xF=function(n){if(n instanceof Dc)return b.value;if(n instanceof im)return new y(new nn(n.value0,function(){var e=CF(n.value1);return e?Dc.value:GU(wF)(Dc.value)(n.value1)}()));throw new Error("Failed pattern match at Data.CatList (line 99, column 1 - line 99, column 61): "+[n.constructor.name])};var LF=function(){return Dc.value}(),HF=wF;var IF={append:HF};var SF=function(n){return function(e){return HF(n)(new im(e,FF))}};var KU=function(n,e,t){var a=0,u;return function(i){if(a===2)return u;if(a===1)throw new ReferenceError(n+" was needed before it finished initializing (module "+e+", line "+i+")",e,i);return a=1,u=t(),a=2,u}},ZU=mn(IF);var MD=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),fm=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),cm=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),XU=function(n){var e=!1,t;function a(u){var i=function(p){return p},f=function(p){return function(d){return new MD(p.value0,ZU(p.value1)(d))}};if(u.value0 instanceof fm){var l=xF(u.value1);if(l instanceof b)return e=!0,new fm(u.value0.value0);if(l instanceof y){n=f(i(l.value0.value0)(u.value0.value0))(l.value0.value1);return}throw new Error("Failed pattern match at Control.Monad.Free (line 227, column 7 - line 231, column 64): "+[l.constructor.name])}if(u.value0 instanceof cm)return e=!0,new cm(u.value0.value0,function(p){return f(u.value0.value1(p))(u.value1)});throw new Error("Failed pattern match at Control.Monad.Free (line 225, column 3 - line 233, column 56): "+[u.value0.constructor.name])}for(;!e;)t=a(n);return t};var AF=function(n){return new MD(n,LF)};var ED={Applicative0:function(){return ls},Bind1:function(){return lm}},CD={map:function(n){return function(e){return fe(lm)(function(){var t=S(ls);return function(a){return t(n(a))}}())(e)}}},lm={bind:function(n){return function(e){return new MD(n.value0,SF(n.value1)(e))}},Apply0:function(){return NF(0)}},ls={pure:function(n){return AF(fm.create(n))},Apply0:function(){return NF(0)}},NF=KU("freeApply","Control.Monad.Free",function(){return{apply:Tr(ED),Functor0:function(){return CD}}});var nk=S(ls);var hc=function(n){return AF(new cm(n,function(e){return nk(e)}))};var RF=function(n){var e=n.Monad0(),t=M(e.Bind1().Apply0().Functor0()),a=S(e.Applicative0()),u=ia(n);return function(i){var f=function(l){var p=XU(l);if(p instanceof fm)return t(Nt.create)(a(p.value0));if(p instanceof cm)return t(function(d){return qt.create(p.value1(d))})(i(p.value0));throw new Error("Failed pattern match at Control.Monad.Free (line 158, column 10 - line 160, column 37): "+[p.constructor.name])};return u(f)}};var PF=x;function FD(n){return function(e){return n===e}}var yc=FD;var tk=qn(On);var rk=J(nt);var ak=mn(cr),ok=et(Ee),uk=ok(Rt);var sm=function(n){return n},UF=function(n){return function(e){return n(function(t){return tk(e(t))})}};var kF=function(n){return function(e){return n(e)}};var $F=function(){var e=qe([])();return{emitter:function(t){return function(){return kr(function(u){return ak(u)([t])})(e)(),kr(n_(yc)(t))(e)}},listener:function(t){return rk(hn(e))(uk(function(a){return a(t)}))}}};var ik=fn(cn);var qF=function(n){return n},BF=function(n){return n},ss=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),pm=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),_m=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),Tc=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),mm=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),ps=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),dm=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),vm=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),gm=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),Dm=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),_s=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}();var ms=function(n){return n};var hm=function(n){return hc(new ps(n,void 0))};var LD=Tt,ym=Tt;var VF=ED,Fe={state:function(n){return ms(hc(ss.create(n)))},Monad0:function(){return VF}};var qi=function(n){return{liftEffect:function(){var e=Gn(n);return function(t){return ms(hc(Tc.create(e(t))))}}(),Monad0:function(){return VF}}};var ya=function(n){var e=qi(n.MonadEffect0());return{liftAff:function(){var t=rr(n);return function(a){return ms(hc(Tc.create(t(a))))}}(),MonadEffect0:function(){return e}}};var Tm=function(n){return hc(new _s(n,ik))},mr=CD;var Ot=lm;var ar=ls;var bc=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Mc=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Ec=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),Cc=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),Fc=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}();var fk=function(n,e,t){var a=0,u;return function(i){if(a===2)return u;if(a===1)throw new ReferenceError(n+" was needed before it finished initializing (module "+e+", line "+i+")",e,i);return a=1,u=t(),a=2,u}};var ck=function(n,e){return ki(n.value0,e.value0)&&ki(n.value1,e.value1)&&n.value1(n.value3,e.value3)};var JF=function(n){return n.value2(n.value3)};var QF=function(n){var e=function(i){return xr(i.vdom)},t=fk("patchThunk","Halogen.VDom.Thunk",function(){return function(i,f){var l=ck(i.thunk,f);if(l)return Ge(new ze(Jt(i.vdom),i,t(112),e));var p=wr(i.vdom,n(JF(f)));return Ge(new ze(Jt(p),{vdom:p,thunk:f},t(115),e))}}),a=t(108),u=function(i){return function(f){var l=fs(i)(n(JF(f)));return Ge(new ze(Jt(l),{thunk:f,vdom:l},a,e))}};return u};var bm=tl(mr),SD=et(ar)(gt),lk=M(mr);var jF=S(ar),sk=qg(),pk=WC(),_k=UC(),ds=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Mm=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),AD=x,ND=x,Qt=function(n){return function(e){if(e instanceof bc)return bm(SD(n.handleAction)(n.initialize))(e.value0);if(e instanceof Mc)return bm(SD(n.handleAction)(n.finalize))(e.value0);if(e instanceof Ec)return bm(SD(n.handleAction)(n.receive(e.value0)))(e.value1);if(e instanceof Cc)return bm(n.handleAction(e.value0))(e.value1);if(e instanceof Fc)return xC(function(t){var a=lk(Jn(e.value1(void 0))(t));return function(u){return a(n.handleQuery(u))}})(e.value0);throw new Error("Failed pattern match at Halogen.Component (line 182, column 15 - line 192, column 71): "+[e.constructor.name])}},mk=x,jt=x;var Yn=function(){return{handleAction:$(jF(void 0)),handleQuery:$(jF(b.value)),receive:$(b.value),initialize:b.value,finalize:b.value}}(),RD=function(){return function(n){var e=sk(n),t=pk(n),a=_k(n);return function(u){var i=e(u),f=t(u),l=a(u);return function(p){return function(d){return function(m){return function(v){return function(g){return mk({get:i(p)(d),pop:f(p)(d),set:l(p)(d),component:m,input:v,output:g})}}}}}}}};var dr=function(){return sF(b.value)}();var Bi=dr("form");var Oe=function(n){return dr("input")(n)([])};var Pt=dr("label");var Vi=dr("p");var vo=dr("span");var OD=dr("table");var zF=dr("tbody"),PD=zF([]),vs=dr("td"),or=vs([]),Ji=function(n){return dr("textarea")(n)([])};var GF=dr("tr"),go=GF([]);var xn=dr("div"),Do=xn([]);var we=dr("button");var YF=function(n){return dr("br")(n)([])},jr=YF([]);var Lr=dr("a");function KF(n){return n.currentTarget}function eu(n){return function(){return n.preventDefault()}}var ZF=function(n){return Xn(KF(n))};var WD="change";var nw="click";var Ck=M(ie),Fk=eT(At),wk=Du(bi($t)),xk=hg($t),Lk=ql($t);var Hk=x;var Ik=function(n){return function(e){return am(n)(function(t){return Ck(Ru.create)(e(t))})}},ew=function(n){return function(e){return am(n)(function(t){return new y(new Ru(e(t)))})}};var Te=function(){var n=ew(nw);return function(e){return n(Hk(e))}}();var wc=ew("submit");var tw=function(n){return function(e){return function(t){return function(a){var u=function(i){return wk(t)(xk(e))(_t(i))};return Ik(n)(Fk(ZF)(function(i){return st($(b.value))(function(f){return y.create(a(f))})(Mi(u(i)))}))}}}},zr=tw(WD)("checked")(eg($t));var Gr=tw(WD)("value")(Lk);var Sk=kt();var rw=function(){var n=function(e){return function(t){return new y(new V_(e,t))}};return function(e){return uF(n(e))}}(),Qi=function(n){return iF(n)},Em=Qi(cF),ji=Qi(qu),Ak=Qi(fF);var Cm=Em("required");var xc=Ak("rows");var UD=ji("target"),ur=ji("title"),Yr=function(n){return Qi(n)("type")},Lc=function(n){return Qi(n)("value")};var tt=ji("name");var Ye=ji("id"),Kr=ji("href");var zt=ji("htmlFor");var Fm=Em("disabled");var aw=function(){var n=ji("className");return function(e){return n(Sk(e))}}(),Zr=Em("checked");var hs=Em("autofocus"),wm=Qi(lF)("autocomplete");var ys=function(){return pF(b.value)}();var kvn=typeof Array.from=="function",Nk=typeof Symbol<"u"&&Symbol!=null&&typeof Symbol.iterator<"u"&&typeof String.prototype[Symbol.iterator]=="function",Rk=typeof String.prototype.fromCodePoint=="function",$vn=typeof String.prototype.codePointAt=="function";var ow=function(n){return Rk?String.fromCodePoint:n},uw=function(n){return function(e){return Nk?function(t){for(var a="",u=t[Symbol.iterator](),i=0;i<e;++i){var f=u.next();if(f.done)return a;a+=f.value}return a}:n(e)}};var kD=b_(Dg);var Pk=ll(Ip),Wk=Hp(Ip);var Uk=function(n){return function(e){return(((n-55296|0)*1024|0)+(e-56320|0)|0)+65536|0}};var kk=function(n){return 56320<=n&&n<=57343},$k=function(n){return 55296<=n&&n<=56319},qk=function(n){var e=Xf(n);if(e===0)return b.value;if(e===1)return new y({head:kD(ec(0)(n)),tail:""});var t=kD(ec(1)(n)),a=kD(ec(0)(n)),u=$k(a)&&kk(t);return u?new y({head:Uk(a)(t),tail:nc(2)(n)}):new y({head:a,tail:nc(1)(n)})};var $D=function(){var n=fE(Dg)(Ia(Di))(Ha(Di));return function(e){return Gv(n(e))}}(),Bk=function(n){if(n<=65535)return $D(n);var e=Pk(n-65536|0)(1024)+55296|0,t=Wk(n-65536|0)(1024)+56320|0;return $D(e)+$D(t)};var Vk=ow(Bk),iw=function(n){return function(e){if(n<1)return"";var t=qk(e);return t instanceof y?Vk(t.value0.head)+iw(n-1|0)(t.value0.tail):e}},ju=uw(iw);var fw=function(n){return function(e){return nc(Xf(ju(n)(e)))(e)}};var zi=function(n){return function(e){return function(){return e[n]}}},Jk=zi("URL"),Qk=zi("documentURI"),jk=zi("origin"),zk=zi("compatMode"),Gk=zi("characterSet"),Yk=zi("contentType");var Kk=zi("documentElement");var o$=oa(),cw=fe(nt);var u$=Lp(At),i$=M(ie),Hr=function(n){return function(e){return n?e(void 0):P("")}};var lw=function(n){return function(e){return n?e(void 0):[]}},f$=function(n){return o$(Jb(n))};var Gi=function(n){return function(e){return function(t){return n?e(void 0):t(void 0)}}},sw=function(n){return function(e){return function(t){return n?e(void 0):t(void 0)}}},tu=function(){var n=Ne("");return function(e){return n(Xn(e))}}(),Hc=function(){var n=Ne(""),e=Vf("+")("%2B");return function(t){return n(Vb(e(t)))}}();var L=function(n){return aw(Jl(n))},Ic=function(n){return ys(n)};var c$=function(n){var e=function(){var u=Vf("+")(" ");return function(i){return f$(u(i))}}(),t=function(u){var i=Vr("=")(u);return i.length===1?new y(new nn(e(i[0]),b.value)):i.length===2?new y(new nn(e(i[0]),new y(e(i[1])))):b.value},a=function(){var u=ju(1)(n),i=u==="#"||u==="?";return i?fw(1)(n):n}();return Ev(t)(xl(function(u){return u!==""})(Vr("&")(a)))};var Ts=function(n){return function(e){return u$(i$(Re)(Tv(function(t){return function(a){return a===e}(Ce(t))})(n)))}},Sc=cw(Yl)(tr);var xm=cw(Oi)(tr),bs=function(){var e=Sc(),t=wg(e)();return c$(t)};var BD=Yr(Bu),l$=ke($e)(Ot),s$=Nu(Fe),pw=J(Ot),_w=Au(Fe),mw=qn(mr),dw=rr(ya(ga)),vw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),gw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Dw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),hw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),p$=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Tw=function(n){return Vt(function(e){return e.us})(function(e){return function(t){return{us:t}}})(n)},_$=Tw(Ft),yw=Tw(mo),bw=function(n){var e=function(u){var i=function(f){return function(l){return hw.create(f(l))}};return xn([L("settings-form")])([xn([L("fw7 mb2")])([P("Account Settings")]),xn([L("flex items-center mb2")])([Oe([BD(_r.value),L("pointer mr2"),Ye("archiveDefault"),tt("archiveDefault"),Zr(u.us.archiveDefault),zr(i(vw.create))]),Pt([zt("archiveDefault"),L("lh-copy")])([P("Archive Non-Private Bookmarks (archive.li)")])]),xn([L("flex items-center mb2")])([Oe([BD(_r.value),L("pointer mr2"),Ye("privateDefault"),tt("privateDefault"),Zr(u.us.privateDefault),zr(i(gw.create))]),Pt([zt("privateDefault"),L("lh-copy")])([P("Default new bookmarks to Private")])]),xn([L("flex items-center mb2")])([Oe([BD(_r.value),L("pointer mr2"),Ye("privacyLock"),tt("privacyLock"),Zr(u.us.privacyLock),zr(i(Dw.create))]),Pt([zt("privacyLock"),L("lh-copy")])([P("Privacy Lock (Private Account)")])])])},t=function(u){return{us:u}},a=function(u){if(u instanceof hw)return l$(s$(_$)(function(){if(u.value0 instanceof vw)return function(i){return{privateDefault:i.privateDefault,privacyLock:i.privacyLock,archiveDefault:u.value0.value0}};if(u.value0 instanceof gw)return function(i){return{archiveDefault:i.archiveDefault,privacyLock:i.privacyLock,privateDefault:u.value0.value0}};if(u.value0 instanceof Dw)return function(i){return{archiveDefault:i.archiveDefault,privateDefault:i.privateDefault,privacyLock:u.value0.value0}};throw new Error("Failed pattern match at Component.AccountSettings (line 77, column 12 - line 80, column 46): "+[u.value0.constructor.name])}()))(function(){return pw(_w(yw))(function(i){return mw(dw(Ig(i)))})});if(u instanceof p$)return pw(_w(yw))(function(i){return mw(dw(Ig(i)))});throw new Error("Failed pattern match at Component.AccountSettings (line 75, column 3 - line 75, column 69): "+[u.constructor.name])};return jt({initialState:$(t(n)),render:e,eval:Qt({handleQuery:Yn.handleQuery,receive:Yn.receive,initialize:Yn.initialize,finalize:Yn.finalize,handleAction:a})})};var ho=function(n){return function(){console.log(n)}},Ms=function(n){return function(){console.warn(n)}};var xw=mn(cr),Hm=Yr(Vu),Lw=no(Uo),Nc=Yr(Bu),Es=Lc(qu),T$=no(Sa),Im=pr(Fe),zu=ke($e)(Ot),yo=J(Ot),Hw=Oa(Fe),VD=rr(ya(ga)),Iw=Nu(Fe),b$=S(ar),M$=qn(mr),$a=Gn(qi(pt)),E$=Au(Fe),Sm=_c(Fe),Sw=fe(nt),Aw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Nw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Rw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Ow=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Pw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Ww=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Uw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),kw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),JD=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),$w=function(){function n(){}return n.value=new n,n}(),qw=function(){function n(){}return n.value=new n,n}(),Vw=function(n){return Vt(function(e){return e.edit_bm})(function(e){return function(t){return{apiError:e.apiError,bm:e.bm,deleteAsk:e.deleteAsk,destroyed:e.destroyed,loading:e.loading,edit_bm:t}}})(n)},Bw=Vw(Ft),C$=Vw(mo),F$=function(n){return Vt(function(e){return e.bm})(function(e){return function(t){return{apiError:e.apiError,deleteAsk:e.deleteAsk,destroyed:e.destroyed,edit_bm:e.edit_bm,loading:e.loading,bm:t}}})(n)},w$=F$(Ft),x$=function(n){return Vt(function(e){return e.apiError})(function(e){return function(t){return{bm:e.bm,deleteAsk:e.deleteAsk,destroyed:e.destroyed,edit_bm:e.edit_bm,loading:e.loading,apiError:t}}})(n)},QD=x$(Ft),Jw=function(n){var e=function(u){var i=ic(u.bm.time),f=function(v){return function(g){return Uw.create(v(g))}},l=function(v){return xn([L("alert")])([P("previously saved\xA0"),vo([L("link f7 dib gray pr3"),ur(Jn(u.bm.time)(Re)(i))])([P(Jn("\xA0")(Ce)(i))]),xn([L("edit_links dib ml1")])([xn([L("delete_link di")])([we(xw([Hm(Se.value),Te(function(g){return new JD(!0)}),L("delete")])(Lw(u.deleteAsk)([Ic("hidden")("hidden")])))([P("delete")]),vo(xw([L("confirm red")])(Lw(!u.deleteAsk)([Ic("hidden")("hidden")])))([we([Hm(Se.value),Te(function(g){return new JD(!1)})])([P("cancel\xA0/\xA0")]),we([Hm(Se.value),Te(function(g){return qw.value}),L("red")])([P("destroy")])])])])])},p=function(v){return Vi([L("red")])([P("you killed this bookmark")])},d=function(v){return function(g){return xn([L("alert alert-err")])([P(v)])}},m=function(v){return Bi([wc(kw.create)])([OD([L("w-100")])([PD([go([vs([L("w1")])([]),or([Hr(u.bm.bid>0)(l),Hr(Ur(u.apiError))(d(Ne("")(u.apiError)))])]),go([or([Pt([zt("url")])([P("URL")])]),or([Oe([Nc(pc.value),Ye("url"),L("w-100 mv1"),Cm(!0),tt("url"),hs(Jr(u.bm.url)),Es(u.edit_bm.url),Gr(f(Aw.create))])])]),go([or([Pt([zt("title")])([P("title")])]),vs([L("flex")])([Oe([Nc(_o.value),Ye("title"),L("w-100 mv1 flex-auto"),tt("title"),Es(u.edit_bm.title),Gr(f(Nw.create))]),we([Fm(u.loading),Hm(Se.value),Te(function(g){return $w.value}),L("ml2 input-reset ba b--navy pointer f6 di dim pa1 ma1 mr0 "+T$(u.loading)("bg-light-silver"))])([P("fetch")])])]),go([or([Pt([zt("description")])([P("description")])]),or([Ji([L("w-100 mt1 mid-gray"),Ye("description"),tt("description"),xc(4),Es(u.edit_bm.description),Gr(f(Rw.create))])])]),go([or([Pt([zt("tags")])([P("tags")])]),or([Oe([Nc(_o.value),Ye("tags"),L("w-100 mv1"),tt("tags"),wm(gc.value),Ic("autocapitalize")("off"),hs(!Jr(u.bm.url)),Es(u.edit_bm.tags),Gr(f(Ow.create))])])]),go([or([Pt([zt("private")])([P("private")])]),or([Oe([Nc(_r.value),Ye("private"),L("private pointer"),tt("private"),Zr(u.edit_bm.private),zr(f(Pw.create))])])]),go([or([Pt([zt("toread")])([P("read later")])]),or([Oe([Nc(_r.value),Ye("toread"),L("toread pointer"),tt("toread"),Zr(u.edit_bm.toread),zr(f(Ww.create))])])]),go([or([]),or([Oe([Nc(Su.value),L("ph3 pv2 input-reset ba b--navy bg-transparent pointer f6 dib mt1 dim"),Es(function(){var g=u.bm.bid>0;return g?"update bookmark":"add bookmark"}())])])])])])])};return Gi(!u.destroyed)(m)(p)},t=function(u){return{bm:u,edit_bm:u,deleteAsk:!1,destroyed:!1,loading:!1,apiError:b.value}},a=function(u){if(u instanceof JD)return Im(function(i){var f={};for(var l in i)({}).hasOwnProperty.call(i,l)&&(f[l]=i[l]);return f.deleteAsk=u.value0,f});if(u instanceof $w)return zu(Im(function(i){var f={};for(var l in i)({}).hasOwnProperty.call(i,l)&&(f[l]=i[l]);return f.loading=!0,f}))(function(){return yo(Hw(function(i){return i.edit_bm}))(function(i){return yo(VD(S_(i)))(function(f){return zu(function(){if(f instanceof y)return Iw(Bw)(function(l){return{url:l.url,description:l.description,tags:l.tags,private:l.private,toread:l.toread,bid:l.bid,slug:l.slug,selected:l.selected,time:l.time,archiveUrl:l.archiveUrl,title:f.value0}});if(f instanceof b)return b$(void 0);throw new Error("Failed pattern match at Component.Add (line 177, column 5 - line 179, column 29): "+[f.constructor.name])}())(function(){return Im(function(l){var p={};for(var d in l)({}).hasOwnProperty.call(l,d)&&(p[d]=l[d]);return p.loading=!1,p})})})})});if(u instanceof qw)return yo(Hw(function(i){return i.bm.bid}))(function(i){return zu(M$(VD(N_(i))))(function(){return Im(function(f){var l={};for(var p in f)({}).hasOwnProperty.call(f,p)&&(l[p]=f[p]);return l.destroyed=!0,l})})});if(u instanceof Uw)return Iw(Bw)(function(){if(u.value0 instanceof Aw)return function(i){return{title:i.title,description:i.description,tags:i.tags,private:i.private,toread:i.toread,bid:i.bid,slug:i.slug,selected:i.selected,time:i.time,archiveUrl:i.archiveUrl,url:u.value0.value0}};if(u.value0 instanceof Nw)return function(i){return{url:i.url,description:i.description,tags:i.tags,private:i.private,toread:i.toread,bid:i.bid,slug:i.slug,selected:i.selected,time:i.time,archiveUrl:i.archiveUrl,title:u.value0.value0}};if(u.value0 instanceof Rw)return function(i){return{url:i.url,title:i.title,tags:i.tags,private:i.private,toread:i.toread,bid:i.bid,slug:i.slug,selected:i.selected,time:i.time,archiveUrl:i.archiveUrl,description:u.value0.value0}};if(u.value0 instanceof Ow)return function(i){return{url:i.url,title:i.title,description:i.description,private:i.private,toread:i.toread,bid:i.bid,slug:i.slug,selected:i.selected,time:i.time,archiveUrl:i.archiveUrl,tags:u.value0.value0}};if(u.value0 instanceof Pw)return function(i){return{url:i.url,title:i.title,description:i.description,tags:i.tags,toread:i.toread,bid:i.bid,slug:i.slug,selected:i.selected,time:i.time,archiveUrl:i.archiveUrl,private:u.value0.value0}};if(u.value0 instanceof Ww)return function(i){return{url:i.url,title:i.title,description:i.description,tags:i.tags,private:i.private,bid:i.bid,slug:i.slug,selected:i.selected,time:i.time,archiveUrl:i.archiveUrl,toread:u.value0.value0}};throw new Error("Failed pattern match at Component.Add (line 188, column 17 - line 194, column 36): "+[u.value0.constructor.name])}());if(u instanceof kw)return zu($a(eu(u.value0)))(function(){return yo(E$(C$))(function(i){return zu(Sm(QD)(b.value))(function(){return yo(VD(A_(i)))(function(f){if(f instanceof z)return zu(Sm(QD)(new y(lo(f.value0))))(function(){return $a(ho(lo(f.value0)))});if(f instanceof Q&&f.value0.status>=200&&f.value0.status<300)return zu(Sm(w$)(i))(function(){return yo($a(bs))(function(l){return yo($a(xm))(function(p){return yo($a(F_(p)))(function(d){return yo($a(Sc))(function(m){return yo($a(Gl(m)))(function(v){var g=Ts(l)("next");return g instanceof y&&g.value0==="closeWindow"?$a(Sw(fc)(tr)):g instanceof y&&g.value0==="back"?$a(function(){var h=kl(v)(d);if(h instanceof y)return Iu(d)(m);if(h instanceof b)return Iu(v)(m);throw new Error("Failed pattern match at Component.Add (line 214, column 13 - line 216, column 41): "+[h.constructor.name])}()):$a(Sw(fc)(tr))})})})})})});if(f instanceof Q)return zu(Sm(QD)(new y(f.value0.body)))(function(){return $a(ho(f.value0.body))});throw new Error("Failed pattern match at Component.Add (line 200, column 42 - line 220, column 36): "+[f.constructor.name])})})})});throw new Error("Failed pattern match at Component.Add (line 169, column 3 - line 169, column 69): "+[u.constructor.name])};return jt({initialState:$(t(n)),render:e,eval:Qt({handleQuery:Yn.handleQuery,receive:Yn.receive,initialize:Yn.initialize,finalize:Yn.finalize,handleAction:a})})};var jD=function(n){return function(e){return function(){n.innerHTML=e}}};var W$=fe(At);var zD=function(){var n=M(mr)(function(e){return W$(jl)(e)});return function(e){return n(Tm(e))}}();var GD=J(Ot),zw=dl(Fe),k$=ke($e),Gw=k$(Ot),$$=wi(ar)(gt),q$=rr(ya(ga)),B$=Gn(Af),V$=Zn(Ap(OM)),J$=S(ar),Q$=pr(Fe),YD=function(){function n(){}return n.value=new n,n}(),Yw=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Kw=function(n){var e=function(a){return xn([rw(a.elRef)])([])},t=function(a){if(a instanceof YD)return GD(zw)(function(u){return GD(zD(u.elRef))(function(i){return Gw($$(i)(function(f){return GD(zw)(function(l){return q$(l_(co(function(p){return function(){return B$(jD(f)(n(l.inputval)))(),V$()}})))})}))(function(){return J$(void 0)})})});if(a instanceof Yw)return Gw(Q$(function(u){var i={};for(var f in u)({}).hasOwnProperty.call(u,f)&&(i[f]=u[f]);return i.inputval=a.value0,i}))(function(){return t(YD.value)});throw new Error("Failed pattern match at Component.RawHtml (line 51, column 18 - line 64, column 34): "+[a.constructor.name])};return jt({initialState:function(a){return{elRef:"inputval",inputval:a}},render:e,eval:Qt({handleQuery:Yn.handleQuery,finalize:Yn.finalize,handleAction:t,initialize:new y(YD.value),receive:function(a){return y.create(Yw.create(a))}})})};function nh(){return{async:!1,breaks:!1,extensions:null,gfm:!0,hooks:null,pedantic:!1,renderer:null,silent:!1,tokenizer:null,walkTokens:null}}var Zi=nh();function r1(n){Zi=n}var a1=/[&<>"']/,z$=new RegExp(a1.source,"g"),o1=/[<>"']|&(?!(#\d{1,7}|#[Xx][a-fA-F0-9]{1,6}|\w+);)/,G$=new RegExp(o1.source,"g"),Y$={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&#39;"},Zw=n=>Y$[n];function Xr(n,e){if(e){if(a1.test(n))return n.replace(z$,Zw)}else if(o1.test(n))return n.replace(G$,Zw);return n}var K$=/&(#(?:\d+)|(?:#x[0-9A-Fa-f]+)|(?:\w+));?/ig;function Z$(n){return n.replace(K$,(e,t)=>(t=t.toLowerCase(),t==="colon"?":":t.charAt(0)==="#"?t.charAt(1)==="x"?String.fromCharCode(parseInt(t.substring(2),16)):String.fromCharCode(+t.substring(1)):""))}var X$=/(^|[^\[])\^/g;function xe(n,e){let t=typeof n=="string"?n:n.source;e=e||"";let a={replace:(u,i)=>{let f=typeof i=="string"?i:i.source;return f=f.replace(X$,"$1"),t=t.replace(u,f),a},getRegex:()=>new RegExp(t,e)};return a}function Xw(n){try{n=encodeURI(n).replace(/%25/g,"%")}catch(e){return null}return n}var Fs={exec:()=>null};function n1(n,e){let t=n.replace(/\|/g,(i,f,l)=>{let p=!1,d=f;for(;--d>=0&&l[d]==="\\";)p=!p;return p?"|":" |"}),a=t.split(/ \|/),u=0;if(a[0].trim()||a.shift(),a.length>0&&!a[a.length-1].trim()&&a.pop(),e)if(a.length>e)a.splice(e);else for(;a.length<e;)a.push("");for(;u<a.length;u++)a[u]=a[u].trim().replace(/\\\|/g,"|");return a}function Am(n,e,t){let a=n.length;if(a===0)return"";let u=0;for(;u<a;){let i=n.charAt(a-u-1);if(i===e&&!t)u++;else if(i!==e&&t)u++;else break}return n.slice(0,a-u)}function n2(n,e){if(n.indexOf(e[1])===-1)return-1;let t=0;for(let a=0;a<n.length;a++)if(n[a]==="\\")a++;else if(n[a]===e[0])t++;else if(n[a]===e[1]&&(t--,t<0))return a;return-1}function e1(n,e,t,a){let u=e.href,i=e.title?Xr(e.title):null,f=n[1].replace(/\\([\[\]])/g,"$1");if(n[0].charAt(0)!=="!"){a.state.inLink=!0;let l={type:"link",raw:t,href:u,title:i,text:f,tokens:a.inlineTokens(f)};return a.state.inLink=!1,l}return{type:"image",raw:t,href:u,title:i,text:Xr(f)}}function e2(n,e){let t=n.match(/^(\s+)(?:```)/);if(t===null)return e;let a=t[1];return e.split(`
-`).map(u=>{let i=u.match(/^\s+/);if(i===null)return u;let[f]=i;return f.length>=a.length?u.slice(a.length):u}).join(`
-`)}var Rc=class{constructor(e){Ue(this,"options");Ue(this,"rules");Ue(this,"lexer");this.options=e||Zi}space(e){let t=this.rules.block.newline.exec(e);if(t&&t[0].length>0)return{type:"space",raw:t[0]}}code(e){let t=this.rules.block.code.exec(e);if(t){let a=t[0].replace(/^ {1,4}/gm,"");return{type:"code",raw:t[0],codeBlockStyle:"indented",text:this.options.pedantic?a:Am(a,`
-`)}}}fences(e){let t=this.rules.block.fences.exec(e);if(t){let a=t[0],u=e2(a,t[3]||"");return{type:"code",raw:a,lang:t[2]?t[2].trim().replace(this.rules.inline.anyPunctuation,"$1"):t[2],text:u}}}heading(e){let t=this.rules.block.heading.exec(e);if(t){let a=t[2].trim();if(/#$/.test(a)){let u=Am(a,"#");(this.options.pedantic||!u||/ $/.test(u))&&(a=u.trim())}return{type:"heading",raw:t[0],depth:t[1].length,text:a,tokens:this.lexer.inline(a)}}}hr(e){let t=this.rules.block.hr.exec(e);if(t)return{type:"hr",raw:t[0]}}blockquote(e){let t=this.rules.block.blockquote.exec(e);if(t){let a=Am(t[0].replace(/^ *>[ \t]?/gm,""),`
-`),u=this.lexer.state.top;this.lexer.state.top=!0;let i=this.lexer.blockTokens(a);return this.lexer.state.top=u,{type:"blockquote",raw:t[0],tokens:i,text:a}}}list(e){let t=this.rules.block.list.exec(e);if(t){let a=t[1].trim(),u=a.length>1,i={type:"list",raw:"",ordered:u,start:u?+a.slice(0,-1):"",loose:!1,items:[]};a=u?`\\d{1,9}\\${a.slice(-1)}`:`\\${a}`,this.options.pedantic&&(a=u?a:"[*+-]");let f=new RegExp(`^( {0,3}${a})((?:[	 ][^\\n]*)?(?:\\n|$))`),l="",p="",d=!1;for(;e;){let m=!1;if(!(t=f.exec(e))||this.rules.block.hr.test(e))break;l=t[0],e=e.substring(l.length);let v=t[2].split(`
-`,1)[0].replace(/^\t+/,sn=>" ".repeat(3*sn.length)),g=e.split(`
-`,1)[0],h=0;this.options.pedantic?(h=2,p=v.trimStart()):(h=t[2].search(/[^ ]/),h=h>4?1:h,p=v.slice(h),h+=t[1].length);let E=!1;if(!v&&/^ *$/.test(g)&&(l+=g+`
-`,e=e.substring(g.length+1),m=!0),!m){let sn=new RegExp(`^ {0,${Math.min(3,h-1)}}(?:[*+-]|\\d{1,9}[.)])((?:[ 	][^\\n]*)?(?:\\n|$))`),wn=new RegExp(`^ {0,${Math.min(3,h-1)}}((?:- *){3,}|(?:_ *){3,}|(?:\\* *){3,})(?:\\n+|$)`),Rn=new RegExp(`^ {0,${Math.min(3,h-1)}}(?:\`\`\`|~~~)`),En=new RegExp(`^ {0,${Math.min(3,h-1)}}#`);for(;e;){let U=e.split(`
-`,1)[0];if(g=U,this.options.pedantic&&(g=g.replace(/^ {1,4}(?=( {4})*[^ ])/g,"  ")),Rn.test(g)||En.test(g)||sn.test(g)||wn.test(e))break;if(g.search(/[^ ]/)>=h||!g.trim())p+=`
-`+g.slice(h);else{if(E||v.search(/[^ ]/)>=4||Rn.test(v)||En.test(v)||wn.test(v))break;p+=`
-`+g}!E&&!g.trim()&&(E=!0),l+=U+`
-`,e=e.substring(U.length+1),v=g.slice(h)}}i.loose||(d?i.loose=!0:/\n *\n *$/.test(l)&&(d=!0));let F=null,W;this.options.gfm&&(F=/^\[[ xX]\] /.exec(p),F&&(W=F[0]!=="[ ] ",p=p.replace(/^\[[ xX]\] +/,""))),i.items.push({type:"list_item",raw:l,task:!!F,checked:W,loose:!1,text:p,tokens:[]}),i.raw+=l}i.items[i.items.length-1].raw=l.trimEnd(),i.items[i.items.length-1].text=p.trimEnd(),i.raw=i.raw.trimEnd();for(let m=0;m<i.items.length;m++)if(this.lexer.state.top=!1,i.items[m].tokens=this.lexer.blockTokens(i.items[m].text,[]),!i.loose){let v=i.items[m].tokens.filter(h=>h.type==="space"),g=v.length>0&&v.some(h=>/\n.*\n/.test(h.raw));i.loose=g}if(i.loose)for(let m=0;m<i.items.length;m++)i.items[m].loose=!0;return i}}html(e){let t=this.rules.block.html.exec(e);if(t)return{type:"html",block:!0,raw:t[0],pre:t[1]==="pre"||t[1]==="script"||t[1]==="style",text:t[0]}}def(e){let t=this.rules.block.def.exec(e);if(t){let a=t[1].toLowerCase().replace(/\s+/g," "),u=t[2]?t[2].replace(/^<(.*)>$/,"$1").replace(this.rules.inline.anyPunctuation,"$1"):"",i=t[3]?t[3].substring(1,t[3].length-1).replace(this.rules.inline.anyPunctuation,"$1"):t[3];return{type:"def",tag:a,raw:t[0],href:u,title:i}}}table(e){let t=this.rules.block.table.exec(e);if(!t||!/[:|]/.test(t[2]))return;let a=n1(t[1]),u=t[2].replace(/^\||\| *$/g,"").split("|"),i=t[3]&&t[3].trim()?t[3].replace(/\n[ \t]*$/,"").split(`
-`):[],f={type:"table",raw:t[0],header:[],align:[],rows:[]};if(a.length===u.length){for(let l of u)/^ *-+: *$/.test(l)?f.align.push("right"):/^ *:-+: *$/.test(l)?f.align.push("center"):/^ *:-+ *$/.test(l)?f.align.push("left"):f.align.push(null);for(let l of a)f.header.push({text:l,tokens:this.lexer.inline(l)});for(let l of i)f.rows.push(n1(l,f.header.length).map(p=>({text:p,tokens:this.lexer.inline(p)})));return f}}lheading(e){let t=this.rules.block.lheading.exec(e);if(t)return{type:"heading",raw:t[0],depth:t[2].charAt(0)==="="?1:2,text:t[1],tokens:this.lexer.inline(t[1])}}paragraph(e){let t=this.rules.block.paragraph.exec(e);if(t){let a=t[1].charAt(t[1].length-1)===`
-`?t[1].slice(0,-1):t[1];return{type:"paragraph",raw:t[0],text:a,tokens:this.lexer.inline(a)}}}text(e){let t=this.rules.block.text.exec(e);if(t)return{type:"text",raw:t[0],text:t[0],tokens:this.lexer.inline(t[0])}}escape(e){let t=this.rules.inline.escape.exec(e);if(t)return{type:"escape",raw:t[0],text:Xr(t[1])}}tag(e){let t=this.rules.inline.tag.exec(e);if(t)return!this.lexer.state.inLink&&/^<a /i.test(t[0])?this.lexer.state.inLink=!0:this.lexer.state.inLink&&/^<\/a>/i.test(t[0])&&(this.lexer.state.inLink=!1),!this.lexer.state.inRawBlock&&/^<(pre|code|kbd|script)(\s|>)/i.test(t[0])?this.lexer.state.inRawBlock=!0:this.lexer.state.inRawBlock&&/^<\/(pre|code|kbd|script)(\s|>)/i.test(t[0])&&(this.lexer.state.inRawBlock=!1),{type:"html",raw:t[0],inLink:this.lexer.state.inLink,inRawBlock:this.lexer.state.inRawBlock,block:!1,text:t[0]}}link(e){let t=this.rules.inline.link.exec(e);if(t){let a=t[2].trim();if(!this.options.pedantic&&/^</.test(a)){if(!/>$/.test(a))return;let f=Am(a.slice(0,-1),"\\");if((a.length-f.length)%2===0)return}else{let f=n2(t[2],"()");if(f>-1){let p=(t[0].indexOf("!")===0?5:4)+t[1].length+f;t[2]=t[2].substring(0,f),t[0]=t[0].substring(0,p).trim(),t[3]=""}}let u=t[2],i="";if(this.options.pedantic){let f=/^([^'"]*[^\s])\s+(['"])(.*)\2/.exec(u);f&&(u=f[1],i=f[3])}else i=t[3]?t[3].slice(1,-1):"";return u=u.trim(),/^</.test(u)&&(this.options.pedantic&&!/>$/.test(a)?u=u.slice(1):u=u.slice(1,-1)),e1(t,{href:u&&u.replace(this.rules.inline.anyPunctuation,"$1"),title:i&&i.replace(this.rules.inline.anyPunctuation,"$1")},t[0],this.lexer)}}reflink(e,t){let a;if((a=this.rules.inline.reflink.exec(e))||(a=this.rules.inline.nolink.exec(e))){let u=(a[2]||a[1]).replace(/\s+/g," "),i=t[u.toLowerCase()];if(!i){let f=a[0].charAt(0);return{type:"text",raw:f,text:f}}return e1(a,i,a[0],this.lexer)}}emStrong(e,t,a=""){let u=this.rules.inline.emStrongLDelim.exec(e);if(!u||u[3]&&a.match(/[\p{L}\p{N}]/u))return;if(!(u[1]||u[2]||"")||!a||this.rules.inline.punctuation.exec(a)){let f=[...u[0]].length-1,l,p,d=f,m=0,v=u[0][0]==="*"?this.rules.inline.emStrongRDelimAst:this.rules.inline.emStrongRDelimUnd;for(v.lastIndex=0,t=t.slice(-1*e.length+f);(u=v.exec(t))!=null;){if(l=u[1]||u[2]||u[3]||u[4]||u[5]||u[6],!l)continue;if(p=[...l].length,u[3]||u[4]){d+=p;continue}else if((u[5]||u[6])&&f%3&&!((f+p)%3)){m+=p;continue}if(d-=p,d>0)continue;p=Math.min(p,p+d+m);let g=[...u[0]][0].length,h=e.slice(0,f+u.index+g+p);if(Math.min(f,p)%2){let F=h.slice(1,-1);return{type:"em",raw:h,text:F,tokens:this.lexer.inlineTokens(F)}}let E=h.slice(2,-2);return{type:"strong",raw:h,text:E,tokens:this.lexer.inlineTokens(E)}}}}codespan(e){let t=this.rules.inline.code.exec(e);if(t){let a=t[2].replace(/\n/g," "),u=/[^ ]/.test(a),i=/^ /.test(a)&&/ $/.test(a);return u&&i&&(a=a.substring(1,a.length-1)),a=Xr(a,!0),{type:"codespan",raw:t[0],text:a}}}br(e){let t=this.rules.inline.br.exec(e);if(t)return{type:"br",raw:t[0]}}del(e){let t=this.rules.inline.del.exec(e);if(t)return{type:"del",raw:t[0],text:t[2],tokens:this.lexer.inlineTokens(t[2])}}autolink(e){let t=this.rules.inline.autolink.exec(e);if(t){let a,u;return t[2]==="@"?(a=Xr(t[1]),u="mailto:"+a):(a=Xr(t[1]),u=a),{type:"link",raw:t[0],text:a,href:u,tokens:[{type:"text",raw:a,text:a}]}}}url(e){var a,u;let t;if(t=this.rules.inline.url.exec(e)){let i,f;if(t[2]==="@")i=Xr(t[0]),f="mailto:"+i;else{let l;do l=t[0],t[0]=(u=(a=this.rules.inline._backpedal.exec(t[0]))==null?void 0:a[0])!=null?u:"";while(l!==t[0]);i=Xr(t[0]),t[1]==="www."?f="http://"+t[0]:f=t[0]}return{type:"link",raw:t[0],text:i,href:f,tokens:[{type:"text",raw:i,text:i}]}}}inlineText(e){let t=this.rules.inline.text.exec(e);if(t){let a;return this.lexer.state.inRawBlock?a=t[0]:a=Xr(t[0]),{type:"text",raw:t[0],text:a}}}},t2=/^(?: *(?:\n|$))+/,r2=/^( {4}[^\n]+(?:\n(?: *(?:\n|$))*)?)+/,a2=/^ {0,3}(`{3,}(?=[^`\n]*(?:\n|$))|~{3,})([^\n]*)(?:\n|$)(?:|([\s\S]*?)(?:\n|$))(?: {0,3}\1[~`]* *(?=\n|$)|$)/,Ls=/^ {0,3}((?:-[\t ]*){3,}|(?:_[ \t]*){3,}|(?:\*[ \t]*){3,})(?:\n+|$)/,o2=/^ {0,3}(#{1,6})(?=\s|$)(.*)(?:\n+|$)/,u1=/(?:[*+-]|\d{1,9}[.)])/,i1=xe(/^(?!bull )((?:.|\n(?!\s*?\n|bull ))+?)\n {0,3}(=+|-+) *(?:\n+|$)/).replace(/bull/g,u1).getRegex(),eh=/^([^\n]+(?:\n(?!hr|heading|lheading|blockquote|fences|list|html|table| +\n)[^\n]+)*)/,u2=/^[^\n]+/,th=/(?!\s*\])(?:\\.|[^\[\]\\])+/,i2=xe(/^ {0,3}\[(label)\]: *(?:\n *)?([^<\s][^\s]*|<.*?>)(?:(?: +(?:\n *)?| *\n *)(title))? *(?:\n+|$)/).replace("label",th).replace("title",/(?:"(?:\\"?|[^"\\])*"|'[^'\n]*(?:\n[^'\n]+)*\n?'|\([^()]*\))/).getRegex(),f2=xe(/^( {0,3}bull)([ \t][^\n]+?)?(?:\n|$)/).replace(/bull/g,u1).getRegex(),Pm="address|article|aside|base|basefont|blockquote|body|caption|center|col|colgroup|dd|details|dialog|dir|div|dl|dt|fieldset|figcaption|figure|footer|form|frame|frameset|h[1-6]|head|header|hr|html|iframe|legend|li|link|main|menu|menuitem|meta|nav|noframes|ol|optgroup|option|p|param|section|source|summary|table|tbody|td|tfoot|th|thead|title|tr|track|ul",rh=/<!--(?!-?>)[\s\S]*?(?:-->|$)/,c2=xe("^ {0,3}(?:<(script|pre|style|textarea)[\\s>][\\s\\S]*?(?:</\\1>[^\\n]*\\n+|$)|comment[^\\n]*(\\n+|$)|<\\?[\\s\\S]*?(?:\\?>\\n*|$)|<![A-Z][\\s\\S]*?(?:>\\n*|$)|<!\\[CDATA\\[[\\s\\S]*?(?:\\]\\]>\\n*|$)|</?(tag)(?: +|\\n|/?>)[\\s\\S]*?(?:(?:\\n *)+\\n|$)|<(?!script|pre|style|textarea)([a-z][\\w-]*)(?:attribute)*? */?>(?=[ \\t]*(?:\\n|$))[\\s\\S]*?(?:(?:\\n *)+\\n|$)|</(?!script|pre|style|textarea)[a-z][\\w-]*\\s*>(?=[ \\t]*(?:\\n|$))[\\s\\S]*?(?:(?:\\n *)+\\n|$))","i").replace("comment",rh).replace("tag",Pm).replace("attribute",/ +[a-zA-Z:_][\w.:-]*(?: *= *"[^"\n]*"| *= *'[^'\n]*'| *= *[^\s"'=<>`]+)?/).getRegex(),f1=xe(eh).replace("hr",Ls).replace("heading"," {0,3}#{1,6}(?:\\s|$)").replace("|lheading","").replace("|table","").replace("blockquote"," {0,3}>").replace("fences"," {0,3}(?:`{3,}(?=[^`\\n]*\\n)|~{3,})[^\\n]*\\n").replace("list"," {0,3}(?:[*+-]|1[.)]) ").replace("html","</?(?:tag)(?: +|\\n|/?>)|<(?:script|pre|style|textarea|!--)").replace("tag",Pm).getRegex(),l2=xe(/^( {0,3}> ?(paragraph|[^\n]*)(?:\n|$))+/).replace("paragraph",f1).getRegex(),ah={blockquote:l2,code:r2,def:i2,fences:a2,heading:o2,hr:Ls,html:c2,lheading:i1,list:f2,newline:t2,paragraph:f1,table:Fs,text:u2},t1=xe("^ *([^\\n ].*)\\n {0,3}((?:\\| *)?:?-+:? *(?:\\| *:?-+:? *)*(?:\\| *)?)(?:\\n((?:(?! *\\n|hr|heading|blockquote|code|fences|list|html).*(?:\\n|$))*)\\n*|$)").replace("hr",Ls).replace("heading"," {0,3}#{1,6}(?:\\s|$)").replace("blockquote"," {0,3}>").replace("code"," {4}[^\\n]").replace("fences"," {0,3}(?:`{3,}(?=[^`\\n]*\\n)|~{3,})[^\\n]*\\n").replace("list"," {0,3}(?:[*+-]|1[.)]) ").replace("html","</?(?:tag)(?: +|\\n|/?>)|<(?:script|pre|style|textarea|!--)").replace("tag",Pm).getRegex(),s2=yf(yr({},ah),{table:t1,paragraph:xe(eh).replace("hr",Ls).replace("heading"," {0,3}#{1,6}(?:\\s|$)").replace("|lheading","").replace("table",t1).replace("blockquote"," {0,3}>").replace("fences"," {0,3}(?:`{3,}(?=[^`\\n]*\\n)|~{3,})[^\\n]*\\n").replace("list"," {0,3}(?:[*+-]|1[.)]) ").replace("html","</?(?:tag)(?: +|\\n|/?>)|<(?:script|pre|style|textarea|!--)").replace("tag",Pm).getRegex()}),p2=yf(yr({},ah),{html:xe(`^ *(?:comment *(?:\\n|\\s*$)|<(tag)[\\s\\S]+?</\\1> *(?:\\n{2,}|\\s*$)|<tag(?:"[^"]*"|'[^']*'|\\s[^'"/>\\s]*)*?/?> *(?:\\n{2,}|\\s*$))`).replace("comment",rh).replace(/tag/g,"(?!(?:a|em|strong|small|s|cite|q|dfn|abbr|data|time|code|var|samp|kbd|sub|sup|i|b|u|mark|ruby|rt|rp|bdi|bdo|span|br|wbr|ins|del|img)\\b)\\w+(?!:|[^\\w\\s@]*@)\\b").getRegex(),def:/^ *\[([^\]]+)\]: *<?([^\s>]+)>?(?: +(["(][^\n]+[")]))? *(?:\n+|$)/,heading:/^(#{1,6})(.*)(?:\n+|$)/,fences:Fs,lheading:/^(.+?)\n {0,3}(=+|-+) *(?:\n+|$)/,paragraph:xe(eh).replace("hr",Ls).replace("heading",` *#{1,6} *[^
-]`).replace("lheading",i1).replace("|table","").replace("blockquote"," {0,3}>").replace("|fences","").replace("|list","").replace("|html","").replace("|tag","").getRegex()}),c1=/^\\([!"#$%&'()*+,\-./:;<=>?@\[\]\\^_`{|}~])/,_2=/^(`+)([^`]|[^`][\s\S]*?[^`])\1(?!`)/,l1=/^( {2,}|\\)\n(?!\s*$)/,m2=/^(`+|[^`])(?:(?= {2,}\n)|[\s\S]*?(?:(?=[\\<!\[`*_]|\b_|$)|[^ ](?= {2,}\n)))/,Hs="\\p{P}$+<=>`^|~",d2=xe(/^((?![*_])[\spunctuation])/,"u").replace(/punctuation/g,Hs).getRegex(),v2=/\[[^[\]]*?\]\([^\(\)]*?\)|`[^`]*?`|<[^<>]*?>/g,g2=xe(/^(?:\*+(?:((?!\*)[punct])|[^\s*]))|^_+(?:((?!_)[punct])|([^\s_]))/,"u").replace(/punct/g,Hs).getRegex(),D2=xe("^[^_*]*?__[^_*]*?\\*[^_*]*?(?=__)|[^*]+(?=[^*])|(?!\\*)[punct](\\*+)(?=[\\s]|$)|[^punct\\s](\\*+)(?!\\*)(?=[punct\\s]|$)|(?!\\*)[punct\\s](\\*+)(?=[^punct\\s])|[\\s](\\*+)(?!\\*)(?=[punct])|(?!\\*)[punct](\\*+)(?!\\*)(?=[punct])|[^punct\\s](\\*+)(?=[^punct\\s])","gu").replace(/punct/g,Hs).getRegex(),h2=xe("^[^_*]*?\\*\\*[^_*]*?_[^_*]*?(?=\\*\\*)|[^_]+(?=[^_])|(?!_)[punct](_+)(?=[\\s]|$)|[^punct\\s](_+)(?!_)(?=[punct\\s]|$)|(?!_)[punct\\s](_+)(?=[^punct\\s])|[\\s](_+)(?!_)(?=[punct])|(?!_)[punct](_+)(?!_)(?=[punct])","gu").replace(/punct/g,Hs).getRegex(),y2=xe(/\\([punct])/,"gu").replace(/punct/g,Hs).getRegex(),T2=xe(/^<(scheme:[^\s\x00-\x1f<>]*|email)>/).replace("scheme",/[a-zA-Z][a-zA-Z0-9+.-]{1,31}/).replace("email",/[a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+(@)[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)+(?![-_])/).getRegex(),b2=xe(rh).replace("(?:-->|$)","-->").getRegex(),M2=xe("^comment|^</[a-zA-Z][\\w:-]*\\s*>|^<[a-zA-Z][\\w-]*(?:attribute)*?\\s*/?>|^<\\?[\\s\\S]*?\\?>|^<![a-zA-Z]+\\s[\\s\\S]*?>|^<!\\[CDATA\\[[\\s\\S]*?\\]\\]>").replace("comment",b2).replace("attribute",/\s+[a-zA-Z:_][\w.:-]*(?:\s*=\s*"[^"]*"|\s*=\s*'[^']*'|\s*=\s*[^\s"'=<>`]+)?/).getRegex(),Rm=/(?:\[(?:\\.|[^\[\]\\])*\]|\\.|`[^`]*`|[^\[\]\\`])*?/,E2=xe(/^!?\[(label)\]\(\s*(href)(?:\s+(title))?\s*\)/).replace("label",Rm).replace("href",/<(?:\\.|[^\n<>\\])+>|[^\s\x00-\x1f]*/).replace("title",/"(?:\\"?|[^"\\])*"|'(?:\\'?|[^'\\])*'|\((?:\\\)?|[^)\\])*\)/).getRegex(),s1=xe(/^!?\[(label)\]\[(ref)\]/).replace("label",Rm).replace("ref",th).getRegex(),p1=xe(/^!?\[(ref)\](?:\[\])?/).replace("ref",th).getRegex(),C2=xe("reflink|nolink(?!\\()","g").replace("reflink",s1).replace("nolink",p1).getRegex(),oh={_backpedal:Fs,anyPunctuation:y2,autolink:T2,blockSkip:v2,br:l1,code:_2,del:Fs,emStrongLDelim:g2,emStrongRDelimAst:D2,emStrongRDelimUnd:h2,escape:c1,link:E2,nolink:p1,punctuation:d2,reflink:s1,reflinkSearch:C2,tag:M2,text:m2,url:Fs},F2=yf(yr({},oh),{link:xe(/^!?\[(label)\]\((.*?)\)/).replace("label",Rm).getRegex(),reflink:xe(/^!?\[(label)\]\s*\[([^\]]*)\]/).replace("label",Rm).getRegex()}),KD=yf(yr({},oh),{escape:xe(c1).replace("])","~|])").getRegex(),url:xe(/^((?:ftp|https?):\/\/|www\.)(?:[a-zA-Z0-9\-]+\.?)+[^\s<]*|^email/,"i").replace("email",/[A-Za-z0-9._+-]+(@)[a-zA-Z0-9-_]+(?:\.[a-zA-Z0-9-_]*[a-zA-Z0-9])+(?![-_])/).getRegex(),_backpedal:/(?:[^?!.,:;*_'"~()&]+|\([^)]*\)|&(?![a-zA-Z0-9]+;$)|[?!.,:;*_'"~)]+(?!$))+/,del:/^(~~?)(?=[^\s~])([\s\S]*?[^\s~])\1(?=[^~]|$)/,text:/^([`~]+|[^`~])(?:(?= {2,}\n)|(?=[a-zA-Z0-9.!#$%&'*+\/=?_`{\|}~-]+@)|[\s\S]*?(?:(?=[\\<!\[`*~_]|\b_|https?:\/\/|ftp:\/\/|www\.|$)|[^ ](?= {2,}\n)|[^a-zA-Z0-9.!#$%&'*+\/=?_`{\|}~-](?=[a-zA-Z0-9.!#$%&'*+\/=?_`{\|}~-]+@)))/}),w2=yf(yr({},KD),{br:xe(l1).replace("{2,}","*").getRegex(),text:xe(KD.text).replace("\\b_","\\b_| {2,}\\n").replace(/\{2,\}/g,"*").getRegex()}),Nm={normal:ah,gfm:s2,pedantic:p2},Cs={normal:oh,gfm:KD,breaks:w2,pedantic:F2},ru=class n{constructor(e){Ue(this,"tokens");Ue(this,"options");Ue(this,"state");Ue(this,"tokenizer");Ue(this,"inlineQueue");this.tokens=[],this.tokens.links=Object.create(null),this.options=e||Zi,this.options.tokenizer=this.options.tokenizer||new Rc,this.tokenizer=this.options.tokenizer,this.tokenizer.options=this.options,this.tokenizer.lexer=this,this.inlineQueue=[],this.state={inLink:!1,inRawBlock:!1,top:!0};let t={block:Nm.normal,inline:Cs.normal};this.options.pedantic?(t.block=Nm.pedantic,t.inline=Cs.pedantic):this.options.gfm&&(t.block=Nm.gfm,this.options.breaks?t.inline=Cs.breaks:t.inline=Cs.gfm),this.tokenizer.rules=t}static get rules(){return{block:Nm,inline:Cs}}static lex(e,t){return new n(t).lex(e)}static lexInline(e,t){return new n(t).inlineTokens(e)}lex(e){e=e.replace(/\r\n|\r/g,`
-`),this.blockTokens(e,this.tokens);for(let t=0;t<this.inlineQueue.length;t++){let a=this.inlineQueue[t];this.inlineTokens(a.src,a.tokens)}return this.inlineQueue=[],this.tokens}blockTokens(e,t=[]){this.options.pedantic?e=e.replace(/\t/g,"    ").replace(/^ +$/gm,""):e=e.replace(/^( *)(\t+)/gm,(l,p,d)=>p+"    ".repeat(d.length));let a,u,i,f;for(;e;)if(!(this.options.extensions&&this.options.extensions.block&&this.options.extensions.block.some(l=>(a=l.call({lexer:this},e,t))?(e=e.substring(a.raw.length),t.push(a),!0):!1))){if(a=this.tokenizer.space(e)){e=e.substring(a.raw.length),a.raw.length===1&&t.length>0?t[t.length-1].raw+=`
-`:t.push(a);continue}if(a=this.tokenizer.code(e)){e=e.substring(a.raw.length),u=t[t.length-1],u&&(u.type==="paragraph"||u.type==="text")?(u.raw+=`
-`+a.raw,u.text+=`
-`+a.text,this.inlineQueue[this.inlineQueue.length-1].src=u.text):t.push(a);continue}if(a=this.tokenizer.fences(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.heading(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.hr(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.blockquote(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.list(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.html(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.def(e)){e=e.substring(a.raw.length),u=t[t.length-1],u&&(u.type==="paragraph"||u.type==="text")?(u.raw+=`
-`+a.raw,u.text+=`
-`+a.raw,this.inlineQueue[this.inlineQueue.length-1].src=u.text):this.tokens.links[a.tag]||(this.tokens.links[a.tag]={href:a.href,title:a.title});continue}if(a=this.tokenizer.table(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.lheading(e)){e=e.substring(a.raw.length),t.push(a);continue}if(i=e,this.options.extensions&&this.options.extensions.startBlock){let l=1/0,p=e.slice(1),d;this.options.extensions.startBlock.forEach(m=>{d=m.call({lexer:this},p),typeof d=="number"&&d>=0&&(l=Math.min(l,d))}),l<1/0&&l>=0&&(i=e.substring(0,l+1))}if(this.state.top&&(a=this.tokenizer.paragraph(i))){u=t[t.length-1],f&&u.type==="paragraph"?(u.raw+=`
-`+a.raw,u.text+=`
-`+a.text,this.inlineQueue.pop(),this.inlineQueue[this.inlineQueue.length-1].src=u.text):t.push(a),f=i.length!==e.length,e=e.substring(a.raw.length);continue}if(a=this.tokenizer.text(e)){e=e.substring(a.raw.length),u=t[t.length-1],u&&u.type==="text"?(u.raw+=`
-`+a.raw,u.text+=`
-`+a.text,this.inlineQueue.pop(),this.inlineQueue[this.inlineQueue.length-1].src=u.text):t.push(a);continue}if(e){let l="Infinite loop on byte: "+e.charCodeAt(0);if(this.options.silent){console.error(l);break}else throw new Error(l)}}return this.state.top=!0,t}inline(e,t=[]){return this.inlineQueue.push({src:e,tokens:t}),t}inlineTokens(e,t=[]){let a,u,i,f=e,l,p,d;if(this.tokens.links){let m=Object.keys(this.tokens.links);if(m.length>0)for(;(l=this.tokenizer.rules.inline.reflinkSearch.exec(f))!=null;)m.includes(l[0].slice(l[0].lastIndexOf("[")+1,-1))&&(f=f.slice(0,l.index)+"["+"a".repeat(l[0].length-2)+"]"+f.slice(this.tokenizer.rules.inline.reflinkSearch.lastIndex))}for(;(l=this.tokenizer.rules.inline.blockSkip.exec(f))!=null;)f=f.slice(0,l.index)+"["+"a".repeat(l[0].length-2)+"]"+f.slice(this.tokenizer.rules.inline.blockSkip.lastIndex);for(;(l=this.tokenizer.rules.inline.anyPunctuation.exec(f))!=null;)f=f.slice(0,l.index)+"++"+f.slice(this.tokenizer.rules.inline.anyPunctuation.lastIndex);for(;e;)if(p||(d=""),p=!1,!(this.options.extensions&&this.options.extensions.inline&&this.options.extensions.inline.some(m=>(a=m.call({lexer:this},e,t))?(e=e.substring(a.raw.length),t.push(a),!0):!1))){if(a=this.tokenizer.escape(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.tag(e)){e=e.substring(a.raw.length),u=t[t.length-1],u&&a.type==="text"&&u.type==="text"?(u.raw+=a.raw,u.text+=a.text):t.push(a);continue}if(a=this.tokenizer.link(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.reflink(e,this.tokens.links)){e=e.substring(a.raw.length),u=t[t.length-1],u&&a.type==="text"&&u.type==="text"?(u.raw+=a.raw,u.text+=a.text):t.push(a);continue}if(a=this.tokenizer.emStrong(e,f,d)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.codespan(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.br(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.del(e)){e=e.substring(a.raw.length),t.push(a);continue}if(a=this.tokenizer.autolink(e)){e=e.substring(a.raw.length),t.push(a);continue}if(!this.state.inLink&&(a=this.tokenizer.url(e))){e=e.substring(a.raw.length),t.push(a);continue}if(i=e,this.options.extensions&&this.options.extensions.startInline){let m=1/0,v=e.slice(1),g;this.options.extensions.startInline.forEach(h=>{g=h.call({lexer:this},v),typeof g=="number"&&g>=0&&(m=Math.min(m,g))}),m<1/0&&m>=0&&(i=e.substring(0,m+1))}if(a=this.tokenizer.inlineText(i)){e=e.substring(a.raw.length),a.raw.slice(-1)!=="_"&&(d=a.raw.slice(-1)),p=!0,u=t[t.length-1],u&&u.type==="text"?(u.raw+=a.raw,u.text+=a.text):t.push(a);continue}if(e){let m="Infinite loop on byte: "+e.charCodeAt(0);if(this.options.silent){console.error(m);break}else throw new Error(m)}}return t}},Oc=class{constructor(e){Ue(this,"options");this.options=e||Zi}code(e,t,a){var i;let u=(i=(t||"").match(/^\S*/))==null?void 0:i[0];return e=e.replace(/\n$/,"")+`
-`,u?'<pre><code class="language-'+Xr(u)+'">'+(a?e:Xr(e,!0))+`</code></pre>
-`:"<pre><code>"+(a?e:Xr(e,!0))+`</code></pre>
-`}blockquote(e){return`<blockquote>
-${e}</blockquote>
-`}html(e,t){return e}heading(e,t,a){return`<h${t}>${e}</h${t}>
-`}hr(){return`<hr>
-`}list(e,t,a){let u=t?"ol":"ul",i=t&&a!==1?' start="'+a+'"':"";return"<"+u+i+`>
-`+e+"</"+u+`>
-`}listitem(e,t,a){return`<li>${e}</li>
-`}checkbox(e){return"<input "+(e?'checked="" ':"")+'disabled="" type="checkbox">'}paragraph(e){return`<p>${e}</p>
-`}table(e,t){return t&&(t=`<tbody>${t}</tbody>`),`<table>
-<thead>
-`+e+`</thead>
-`+t+`</table>
-`}tablerow(e){return`<tr>
-${e}</tr>
-`}tablecell(e,t){let a=t.header?"th":"td";return(t.align?`<${a} align="${t.align}">`:`<${a}>`)+e+`</${a}>
-`}strong(e){return`<strong>${e}</strong>`}em(e){return`<em>${e}</em>`}codespan(e){return`<code>${e}</code>`}br(){return"<br>"}del(e){return`<del>${e}</del>`}link(e,t,a){let u=Xw(e);if(u===null)return a;e=u;let i='<a href="'+e+'"';return t&&(i+=' title="'+t+'"'),i+=">"+a+"</a>",i}image(e,t,a){let u=Xw(e);if(u===null)return a;e=u;let i=`<img src="${e}" alt="${a}"`;return t&&(i+=` title="${t}"`),i+=">",i}text(e){return e}},ws=class{strong(e){return e}em(e){return e}codespan(e){return e}del(e){return e}html(e){return e}text(e){return e}link(e,t,a){return""+a}image(e,t,a){return""+a}br(){return""}},au=class n{constructor(e){Ue(this,"options");Ue(this,"renderer");Ue(this,"textRenderer");this.options=e||Zi,this.options.renderer=this.options.renderer||new Oc,this.renderer=this.options.renderer,this.renderer.options=this.options,this.textRenderer=new ws}static parse(e,t){return new n(t).parse(e)}static parseInline(e,t){return new n(t).parseInline(e)}parse(e,t=!0){let a="";for(let u=0;u<e.length;u++){let i=e[u];if(this.options.extensions&&this.options.extensions.renderers&&this.options.extensions.renderers[i.type]){let f=i,l=this.options.extensions.renderers[f.type].call({parser:this},f);if(l!==!1||!["space","hr","heading","code","table","blockquote","list","html","paragraph","text"].includes(f.type)){a+=l||"";continue}}switch(i.type){case"space":continue;case"hr":{a+=this.renderer.hr();continue}case"heading":{let f=i;a+=this.renderer.heading(this.parseInline(f.tokens),f.depth,Z$(this.parseInline(f.tokens,this.textRenderer)));continue}case"code":{let f=i;a+=this.renderer.code(f.text,f.lang,!!f.escaped);continue}case"table":{let f=i,l="",p="";for(let m=0;m<f.header.length;m++)p+=this.renderer.tablecell(this.parseInline(f.header[m].tokens),{header:!0,align:f.align[m]});l+=this.renderer.tablerow(p);let d="";for(let m=0;m<f.rows.length;m++){let v=f.rows[m];p="";for(let g=0;g<v.length;g++)p+=this.renderer.tablecell(this.parseInline(v[g].tokens),{header:!1,align:f.align[g]});d+=this.renderer.tablerow(p)}a+=this.renderer.table(l,d);continue}case"blockquote":{let f=i,l=this.parse(f.tokens);a+=this.renderer.blockquote(l);continue}case"list":{let f=i,l=f.ordered,p=f.start,d=f.loose,m="";for(let v=0;v<f.items.length;v++){let g=f.items[v],h=g.checked,E=g.task,F="";if(g.task){let W=this.renderer.checkbox(!!h);d?g.tokens.length>0&&g.tokens[0].type==="paragraph"?(g.tokens[0].text=W+" "+g.tokens[0].text,g.tokens[0].tokens&&g.tokens[0].tokens.length>0&&g.tokens[0].tokens[0].type==="text"&&(g.tokens[0].tokens[0].text=W+" "+g.tokens[0].tokens[0].text)):g.tokens.unshift({type:"text",text:W+" "}):F+=W+" "}F+=this.parse(g.tokens,d),m+=this.renderer.listitem(F,E,!!h)}a+=this.renderer.list(m,l,p);continue}case"html":{let f=i;a+=this.renderer.html(f.text,f.block);continue}case"paragraph":{let f=i;a+=this.renderer.paragraph(this.parseInline(f.tokens));continue}case"text":{let f=i,l=f.tokens?this.parseInline(f.tokens):f.text;for(;u+1<e.length&&e[u+1].type==="text";)f=e[++u],l+=`
-`+(f.tokens?this.parseInline(f.tokens):f.text);a+=t?this.renderer.paragraph(l):l;continue}default:{let f='Token with "'+i.type+'" type was not found.';if(this.options.silent)return console.error(f),"";throw new Error(f)}}}return a}parseInline(e,t){t=t||this.renderer;let a="";for(let u=0;u<e.length;u++){let i=e[u];if(this.options.extensions&&this.options.extensions.renderers&&this.options.extensions.renderers[i.type]){let f=this.options.extensions.renderers[i.type].call({parser:this},i);if(f!==!1||!["escape","html","link","image","strong","em","codespan","br","del","text"].includes(i.type)){a+=f||"";continue}}switch(i.type){case"escape":{let f=i;a+=t.text(f.text);break}case"html":{let f=i;a+=t.html(f.text);break}case"link":{let f=i;a+=t.link(f.href,f.title,this.parseInline(f.tokens,t));break}case"image":{let f=i;a+=t.image(f.href,f.title,f.text);break}case"strong":{let f=i;a+=t.strong(this.parseInline(f.tokens,t));break}case"em":{let f=i;a+=t.em(this.parseInline(f.tokens,t));break}case"codespan":{let f=i;a+=t.codespan(f.text);break}case"br":{a+=t.br();break}case"del":{let f=i;a+=t.del(this.parseInline(f.tokens,t));break}case"text":{let f=i;a+=t.text(f.text);break}default:{let f='Token with "'+i.type+'" type was not found.';if(this.options.silent)return console.error(f),"";throw new Error(f)}}}return a}},Yi=class{constructor(e){Ue(this,"options");this.options=e||Zi}preprocess(e){return e}postprocess(e){return e}processAllTokens(e){return e}};Ue(Yi,"passThroughHooks",new Set(["preprocess","postprocess","processAllTokens"]));var xs,XD,Om,_1,ZD=class{constructor(...e){Ed(this,xs);Ed(this,Om);Ue(this,"defaults",nh());Ue(this,"options",this.setOptions);Ue(this,"parse",mp(this,xs,XD).call(this,ru.lex,au.parse));Ue(this,"parseInline",mp(this,xs,XD).call(this,ru.lexInline,au.parseInline));Ue(this,"Parser",au);Ue(this,"Renderer",Oc);Ue(this,"TextRenderer",ws);Ue(this,"Lexer",ru);Ue(this,"Tokenizer",Rc);Ue(this,"Hooks",Yi);this.use(...e)}walkTokens(e,t){var u,i;let a=[];for(let f of e)switch(a=a.concat(t.call(this,f)),f.type){case"table":{let l=f;for(let p of l.header)a=a.concat(this.walkTokens(p.tokens,t));for(let p of l.rows)for(let d of p)a=a.concat(this.walkTokens(d.tokens,t));break}case"list":{let l=f;a=a.concat(this.walkTokens(l.items,t));break}default:{let l=f;(i=(u=this.defaults.extensions)==null?void 0:u.childTokens)!=null&&i[l.type]?this.defaults.extensions.childTokens[l.type].forEach(p=>{a=a.concat(this.walkTokens(l[p],t))}):l.tokens&&(a=a.concat(this.walkTokens(l.tokens,t)))}}return a}use(...e){let t=this.defaults.extensions||{renderers:{},childTokens:{}};return e.forEach(a=>{let u=yr({},a);if(u.async=this.defaults.async||u.async||!1,a.extensions&&(a.extensions.forEach(i=>{if(!i.name)throw new Error("extension name required");if("renderer"in i){let f=t.renderers[i.name];f?t.renderers[i.name]=function(...l){let p=i.renderer.apply(this,l);return p===!1&&(p=f.apply(this,l)),p}:t.renderers[i.name]=i.renderer}if("tokenizer"in i){if(!i.level||i.level!=="block"&&i.level!=="inline")throw new Error("extension level must be 'block' or 'inline'");let f=t[i.level];f?f.unshift(i.tokenizer):t[i.level]=[i.tokenizer],i.start&&(i.level==="block"?t.startBlock?t.startBlock.push(i.start):t.startBlock=[i.start]:i.level==="inline"&&(t.startInline?t.startInline.push(i.start):t.startInline=[i.start]))}"childTokens"in i&&i.childTokens&&(t.childTokens[i.name]=i.childTokens)}),u.extensions=t),a.renderer){let i=this.defaults.renderer||new Oc(this.defaults);for(let f in a.renderer){if(!(f in i))throw new Error(`renderer '${f}' does not exist`);if(f==="options")continue;let l=f,p=a.renderer[l],d=i[l];i[l]=(...m)=>{let v=p.apply(i,m);return v===!1&&(v=d.apply(i,m)),v||""}}u.renderer=i}if(a.tokenizer){let i=this.defaults.tokenizer||new Rc(this.defaults);for(let f in a.tokenizer){if(!(f in i))throw new Error(`tokenizer '${f}' does not exist`);if(["options","rules","lexer"].includes(f))continue;let l=f,p=a.tokenizer[l],d=i[l];i[l]=(...m)=>{let v=p.apply(i,m);return v===!1&&(v=d.apply(i,m)),v}}u.tokenizer=i}if(a.hooks){let i=this.defaults.hooks||new Yi;for(let f in a.hooks){if(!(f in i))throw new Error(`hook '${f}' does not exist`);if(f==="options")continue;let l=f,p=a.hooks[l],d=i[l];Yi.passThroughHooks.has(f)?i[l]=m=>{if(this.defaults.async)return Promise.resolve(p.call(i,m)).then(g=>d.call(i,g));let v=p.call(i,m);return d.call(i,v)}:i[l]=(...m)=>{let v=p.apply(i,m);return v===!1&&(v=d.apply(i,m)),v}}u.hooks=i}if(a.walkTokens){let i=this.defaults.walkTokens,f=a.walkTokens;u.walkTokens=function(l){let p=[];return p.push(f.call(this,l)),i&&(p=p.concat(i.call(this,l))),p}}this.defaults=yr(yr({},this.defaults),u)}),this}setOptions(e){return this.defaults=yr(yr({},this.defaults),e),this}lexer(e,t){return ru.lex(e,t!=null?t:this.defaults)}parser(e,t){return au.parse(e,t!=null?t:this.defaults)}};xs=new WeakSet,XD=function(e,t){return(a,u)=>{let i=yr({},u),f=yr(yr({},this.defaults),i);this.defaults.async===!0&&i.async===!1&&(f.silent||console.warn("marked(): The async option was set to true by an extension. The async: false option sent to parse will be ignored."),f.async=!0);let l=mp(this,Om,_1).call(this,!!f.silent,!!f.async);if(typeof a>"u"||a===null)return l(new Error("marked(): input parameter is undefined or null"));if(typeof a!="string")return l(new Error("marked(): input parameter is of type "+Object.prototype.toString.call(a)+", string expected"));if(f.hooks&&(f.hooks.options=f),f.async)return Promise.resolve(f.hooks?f.hooks.preprocess(a):a).then(p=>e(p,f)).then(p=>f.hooks?f.hooks.processAllTokens(p):p).then(p=>f.walkTokens?Promise.all(this.walkTokens(p,f.walkTokens)).then(()=>p):p).then(p=>t(p,f)).then(p=>f.hooks?f.hooks.postprocess(p):p).catch(l);try{f.hooks&&(a=f.hooks.preprocess(a));let p=e(a,f);f.hooks&&(p=f.hooks.processAllTokens(p)),f.walkTokens&&this.walkTokens(p,f.walkTokens);let d=t(p,f);return f.hooks&&(d=f.hooks.postprocess(d)),d}catch(p){return l(p)}}},Om=new WeakSet,_1=function(e,t){return a=>{if(a.message+=`
-Please report this to https://github.com/markedjs/marked.`,e){let u="<p>An error occurred:</p><pre>"+Xr(a.message+"",!0)+"</pre>";return t?Promise.resolve(u):u}if(t)return Promise.reject(a);throw a}};var Ki=new ZD;function de(n,e){return Ki.parse(n,e)}de.options=de.setOptions=function(n){return Ki.setOptions(n),de.defaults=Ki.defaults,r1(de.defaults),de};de.getDefaults=nh;de.defaults=Zi;de.use=function(...n){return Ki.use(...n),de.defaults=Ki.defaults,r1(de.defaults),de};de.walkTokens=function(n,e){return Ki.walkTokens(n,e)};de.parseInline=Ki.parseInline;de.Parser=au;de.parser=au.parse;de.Renderer=Oc;de.TextRenderer=ws;de.Lexer=ru;de.lexer=ru.lex;de.Tokenizer=Rc;de.Hooks=Yi;de.parse=de;var Wgn=de.options,Ugn=de.setOptions,kgn=de.use,$gn=de.walkTokens,qgn=de.parseInline;var Bgn=au.parse,Vgn=ru.lex;var d1=ly(m1(),1);de.setOptions({pedantic:!1,gfm:!0});var fh=function(n){return n?d1.default.sanitize(de.parse(n)):""};var v1=function(n){return vg(fh(n))};var Wm=Kw(v1);var D1=function(n){var e=Gn(n);return function(t){return e(ho(t))}};var I2=RD();var Pc=function(){return function(n){var e=I2(n);return function(t){var a=e(t);return function(u){return function(i){return function(f){return function(l){return function(p){return oF(new ds(a(u)(i)(f)(l)(function(d){return y.create(p(d))})))}}}}}}}};var h1=_n(Wr),Gu=J(Ot),Is=Au(Fe),Ir=ke($e)(Ot),Ss=rr(ya(ga)),As=Nu(Fe),lh=pr(Fe),y1=qn(mr),Yu=_c(Fe),Um=Gn(qi(pt)),S2=aa(Ee),A2=Oa(Fe),N2=S(ar),T1=D1(Af),Ku=no(Sa),R2=Pc()({reflectSymbol:function(){return"markdown"}})(Ef),O2=M(Ae),Ns=Yr(Vu),P2=no(Uo),Xi=Yr(Bu),Wc=Lc(qu),b1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),M1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),E1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),C1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),F1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),w1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),W2=function(){function n(){}return n.value=new n,n}(),x1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),sh=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),L1=function(){function n(){}return n.value=new n,n}(),H1=function(){function n(){}return n.value=new n,n}(),ph=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),I1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),S1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),A1=function(){function n(){}return n.value=new n,n}(),U2=function(){return he.value}(),R1=function(n){return Vt(function(e){return e.edit_bm})(function(e){return function(t){return{apiError:e.apiError,bm:e.bm,deleteAsk:e.deleteAsk,edit:e.edit,loading:e.loading,edit_bm:t}}})(n)},km=R1(Ft),k2=R1(mo),$2=function(n){return Vt(function(e){return e.edit})(function(e){return function(t){return{apiError:e.apiError,bm:e.bm,deleteAsk:e.deleteAsk,edit_bm:e.edit_bm,loading:e.loading,edit:t}}})(n)},N1=$2(Ft),O1=function(n){return Vt(function(e){return e.bm})(function(e){return function(t){return{apiError:e.apiError,deleteAsk:e.deleteAsk,edit:e.edit,edit_bm:e.edit_bm,loading:e.loading,bm:t}}})(n)},$m=O1(mo),_h=O1(Ft),q2=function(n){return Vt(function(e){return e.apiError})(function(e){return function(t){return{bm:e.bm,deleteAsk:e.deleteAsk,edit:e.edit,edit_bm:e.edit_bm,loading:e.loading,apiError:t}}})(n)},qm=q2(Ft),P1=function(n){var e=function(f){return h1(f.bid)+"_tags"},t=function(f){return{bm:f,edit_bm:f,deleteAsk:!1,edit:!1,loading:!1,apiError:b.value}},a=function(f){if(f instanceof x1)return Gu(Is($m))(function(l){return Ir(Ss(ZE(l.bid)(function(){return f.value0?Lg.value:Hg.value}())))(function(){return Ir(As(_h)(function(p){return{url:p.url,title:p.title,description:p.description,tags:p.tags,private:p.private,toread:p.toread,bid:p.bid,slug:p.slug,time:p.time,archiveUrl:p.archiveUrl,selected:f.value0}}))(function(){return As(km)(function(p){return{url:p.url,title:p.title,description:p.description,tags:p.tags,private:p.private,toread:p.toread,bid:p.bid,slug:p.slug,time:p.time,archiveUrl:p.archiveUrl,selected:f.value0}})})})});if(f instanceof sh)return lh(function(l){var p={};for(var d in l)({}).hasOwnProperty.call(l,d)&&(p[d]=l[d]);return p.deleteAsk=f.value0,p});if(f instanceof H1)return Gu(Is($m))(function(l){return Ir(y1(Ss(N_(l.bid))))(function(){return hm(W2.value)})});if(f instanceof A1)return Gu(Is($m))(function(l){return Ir(y1(Ss(KE(l.bid))))(function(){return As(_h)(function(p){return{url:p.url,title:p.title,description:p.description,tags:p.tags,private:p.private,bid:p.bid,slug:p.slug,selected:p.selected,time:p.time,archiveUrl:p.archiveUrl,toread:!1}})})});if(f instanceof ph)return Gu(Is($m))(function(l){return Ir(Yu(km)(l))(function(){return Ir(Yu(N1)(f.value0))(function(){return Ir(Yu(qm)(b.value))(function(){return Um(S2(f.value0)(T_(e(l))))})})})});if(f instanceof I1)return As(km)(function(){if(f.value0 instanceof b1)return function(l){return{title:l.title,description:l.description,tags:l.tags,private:l.private,toread:l.toread,bid:l.bid,slug:l.slug,selected:l.selected,time:l.time,archiveUrl:l.archiveUrl,url:f.value0.value0}};if(f.value0 instanceof M1)return function(l){return{url:l.url,description:l.description,tags:l.tags,private:l.private,toread:l.toread,bid:l.bid,slug:l.slug,selected:l.selected,time:l.time,archiveUrl:l.archiveUrl,title:f.value0.value0}};if(f.value0 instanceof E1)return function(l){return{url:l.url,title:l.title,tags:l.tags,private:l.private,toread:l.toread,bid:l.bid,slug:l.slug,selected:l.selected,time:l.time,archiveUrl:l.archiveUrl,description:f.value0.value0}};if(f.value0 instanceof C1)return function(l){return{url:l.url,title:l.title,description:l.description,private:l.private,toread:l.toread,bid:l.bid,slug:l.slug,selected:l.selected,time:l.time,archiveUrl:l.archiveUrl,tags:f.value0.value0}};if(f.value0 instanceof F1)return function(l){return{url:l.url,title:l.title,description:l.description,tags:l.tags,toread:l.toread,bid:l.bid,slug:l.slug,selected:l.selected,time:l.time,archiveUrl:l.archiveUrl,private:f.value0.value0}};if(f.value0 instanceof w1)return function(l){return{url:l.url,title:l.title,description:l.description,tags:l.tags,private:l.private,bid:l.bid,slug:l.slug,selected:l.selected,time:l.time,archiveUrl:l.archiveUrl,toread:f.value0.value0}};throw new Error("Failed pattern match at Component.BMark (line 253, column 17 - line 259, column 36): "+[f.value0.constructor.name])}());if(f instanceof L1)return Ir(lh(function(l){var p={};for(var d in l)({}).hasOwnProperty.call(l,d)&&(p[d]=l[d]);return p.loading=!0,p}))(function(){return Gu(A2(function(l){return l.edit_bm}))(function(l){return Gu(Ss(S_(l)))(function(p){return Ir(function(){if(p instanceof y)return As(km)(function(d){return{url:d.url,description:d.description,tags:d.tags,private:d.private,toread:d.toread,bid:d.bid,slug:d.slug,selected:d.selected,time:d.time,archiveUrl:d.archiveUrl,title:p.value0}});if(p instanceof b)return N2(void 0);throw new Error("Failed pattern match at Component.BMark (line 266, column 5 - line 268, column 29): "+[p.constructor.name])}())(function(){return lh(function(d){var m={};for(var v in d)({}).hasOwnProperty.call(d,v)&&(m[v]=d[v]);return m.loading=!1,m})})})})});if(f instanceof S1)return Ir(Um(eu(f.value0)))(function(){return Gu(Is(k2))(function(l){return Ir(Yu(qm)(b.value))(function(){var p={archiveUrl:l.archiveUrl,bid:l.bid,description:l.description,private:l.private,selected:l.selected,slug:l.slug,time:l.time,title:l.title,toread:l.toread,url:l.url,tags:Vf(",")(" ")(l.tags)};return Gu(Ss(A_(p)))(function(d){if(d instanceof z)return Ir(Yu(qm)(new y(lo(d.value0))))(function(){return Um(T1(lo(d.value0)))});if(d instanceof Q&&d.value0.status>=200&&d.value0.status<300)return Ir(Yu(_h)(p))(function(){return Yu(N1)(!1)});if(d instanceof Q)return Ir(Yu(qm)(new y(d.value0.body)))(function(){return Um(T1(d.value0.body))});throw new Error("Failed pattern match at Component.BMark (line 277, column 43 - line 286, column 36): "+[d.constructor.name])})})})});throw new Error("Failed pattern match at Component.BMark (line 216, column 3 - line 216, column 84): "+[f.constructor.name])},u=_a(void 0),i=function(f){var l=function(W){return xn([L("star fl pointer"+Ku(f.bm.selected)(" selected"))])([we([L("moon-gray"),Te(function(sn){return new x1(!f.bm.selected)})])([P("\u272D")])])},p=ju(16)(f.bm.time)+"Z",d=rE(f.bm.time),m=function(W){return tu(u.userR)+("/t:"+Hc(W))},v=function(W){return tu(u.userR)+("/b:"+W)},g=function(W){return function(sn){return I1.create(W(sn))}},h=function(W){return xn([L("display")])([Lr([Kr(f.bm.url),UD("_blank"),L("link f5 lh-title"+Ku(f.bm.toread)(" unread"))])([P(function(){var sn=Jr(f.bm.title);return sn?"[no title]":f.bm.title}())]),jr,Lr([Kr(f.bm.url),L("link f7 gray hover-blue")])([P(f.bm.url)]),Lr([Kr(Ne("http://archive.is/"+f.bm.url)(Xn(f.bm.archiveUrl))),L("link f7 gray hover-blue ml2"+Ku(Ur(Xn(f.bm.archiveUrl)))(" green")),UD("_blank"),ur("archive link")])([function(){var sn=Ur(Xn(f.bm.archiveUrl));return sn?P("\u2611"):P("\u2610")}()]),jr,xn([L("description mt1 mid-gray")])([R2(U2)(void 0)(Wm)(f.bm.description)(mi)]),xn([L("tags")])(lw(!Jr(f.bm.tags))(function(sn){return O2(function(wn){return Lr([L("link tag mr1"+Ku(ju(1)(wn)===".")(" private")),Kr(m(wn))])([P(wn)])})(Vr(" ")(f.bm.tags))})),Lr([L("link f7 dib gray w4"),Kr(v(f.bm.slug)),ur(p)])([P(d)]),Hr(u.dat.isowner)(function(sn){return xn([L("edit_links di")])([we([Ns(Se.value),Te(function(wn){return new ph(!0)}),L("edit light-silver hover-blue")])([P("edit\xA0\xA0")]),xn([L("delete_link di")])([we([Ns(Se.value),Te(function(wn){return new sh(!0)}),L("delete light-silver hover-blue"+Ku(f.deleteAsk)(" dn"))])([P("delete")]),vo([L("confirm red"+Ku(!f.deleteAsk)(" dn"))])([we([Ns(Se.value),Te(function(wn){return new sh(!1)})])([P("cancel\xA0/\xA0")]),we([Ns(Se.value),Te(function(wn){return H1.value}),L("red")])([P("destroy")])])])])}),Hr(u.dat.isowner)(function(sn){return xn([L("read di")])(P2(f.bm.toread)([P("\xA0\xA0"),we([Te(function(wn){return A1.value}),L("mark_read")])([P("mark as read")])]))})])},E=function(W){return function(sn){return xn([L("alert alert-err")])([P(W)])}},F=function(W){return xn([L("edit_bookmark_form pa2 pt0 bg-white")])([Hr(Ur(f.apiError))(E(Ne("")(f.apiError))),Bi([wc(S1.create)])([Do([P("url")]),Oe([Xi(pc.value),L("url w-100 mb2 pt1 edit_form_input"),Cm(!0),tt("url"),Wc(f.edit_bm.url),Gr(g(b1.create))]),Do([P("title")]),xn([L("flex")])([Oe([Xi(_o.value),L("title w-100 mb2 pt1 edit_form_input"),tt("title"),Wc(f.edit_bm.title),Gr(g(M1.create))]),we([Fm(f.loading),Ns(Se.value),Te(function(sn){return L1.value}),L("ml1 pa1 mb2 dark-gray ba b--moon-gray bg-near-white pointer rdim f7 "+Ku(f.loading)("bg-light-silver"))])([P("fetch")])]),Do([P("description")]),Ji([L("description w-100 mb1 pt1 edit_form_input"),tt("description"),xc(5),Wc(f.edit_bm.description),Gr(g(E1.create))]),xn([Ye("tags_input_box")])([Do([P("tags")]),Oe([Ye(e(f.edit_bm)),Xi(_o.value),L("tags w-100 mb1 pt1 edit_form_input"),tt("tags"),wm(gc.value),Ic("autocapitalize")("off"),Wc(f.edit_bm.tags),Gr(g(C1.create))])]),xn([L("edit_form_checkboxes mv3")])([Oe([Xi(_r.value),L("private pointer"),Ye("edit_private"),tt("private"),Zr(f.edit_bm.private),zr(g(F1.create))]),P(" "),Pt([zt("edit_private"),L("mr2")])([P("private")]),P(" "),Oe([Xi(_r.value),L("toread pointer"),Ye("edit_toread"),tt("toread"),Zr(f.edit_bm.toread),zr(g(w1.create))]),P(" "),Pt([zt("edit_toread")])([P("to-read")])]),Oe([Xi(Su.value),L("mr1 pv1 ph2 dark-gray ba b--moon-gray bg-near-white pointer rdim"),Wc("save")]),P(" "),Oe([Xi(sc.value),L("pv1 ph2 dark-gray ba b--moon-gray bg-near-white pointer rdim"),Wc("cancel"),Te(function(sn){return new ph(!1)})])])])};return xn([Ye(h1(f.bm.bid)),L("bookmark w-100 mw7 pa1 mb3"+Ku(f.bm.private)(" private"))])([Hr(u.dat.isowner)(l),Gi(f.edit)(F)(h)])};return jt({initialState:$(t(n)),render:i,eval:Qt({handleQuery:Yn.handleQuery,receive:Yn.receive,initialize:Yn.initialize,finalize:Yn.finalize,handleAction:a})})};var V2=M(Ae),J2=Pc()({reflectSymbol:function(){return"bookmark"}})(Tt),Q2=pr(Fe),j2=function(){function n(e,t){this.value0=e,this.value1=t}return n.create=function(e){return function(t){return new n(e,t)}},n}(),z2=function(){return he.value}(),W1=function(n){var e=function(a){return Do(V2(function(u){return J2(z2)(u.bid)(P1(u))(void 0)(j2.create(u.bid))})(a))},t=function(a){return Q2(xl(function(u){return u.bid!==a.value0}))};return jt({initialState:$(n),render:e,eval:Qt({handleQuery:Yn.handleQuery,receive:Yn.receive,initialize:Yn.initialize,finalize:Yn.finalize,handleAction:t})})};var Y2=Zp(Uo),K2=S(ar),Z2=_n(Wr),X2=M(Ae);var U1=function(n){var e=function(p){return Ll(1)(Y2(function(d){return[jr,P(d)]})(Vr(`
-`)(p)))},t=function(p){return ic(p.created)},a=function(p){return{notes:p,cur:b.value,deleteAsk:!1,edit:!1}},u=function(p){return K2(void 0)},i=_a(void 0),f=function(p){return tu(i.userR)+("/notes/"+p)},l=function(p){var d=function(m){return xn([Ye(Z2(m.id)),L("note w-100 mw7 pa1 mb2"+function(){return m.shared?"":" private"}())])([xn([L("display")])([Lr([Kr(f(m.slug)),L("link f5 lh-title")])([P(function(){var v=Jr(m.title);return v?"[no title]":m.title}())]),jr,xn([L("description mt1 mid-gray")])(e(ju(200)(m.text))),Lr([L("link f7 dib gray w4"),ur(Jn(m.created)(Re)(t(m))),Kr(f(m.slug))])([P(Jn("\xA0")(Ce)(t(m)))])])])};return Do(X2(d)(p.notes))};return jt({initialState:$(a(n)),render:l,eval:Qt({handleQuery:Yn.handleQuery,receive:Yn.receive,initialize:Yn.initialize,finalize:Yn.finalize,handleAction:u})})};var k1=_n(Wr),eq=S(ar),tq=Nu(Fe),$1=pr(Fe),To=J(Ot),mh=Au(Fe),Zu=ke($e)(Ot),rq=qn(mr),q1=rr(ya(ga)),nf=_c(Fe),Sr=Gn(qi(pt)),dh=fe(nt),aq=oT(Aa),oq=S(Ee),uq=Zp(Uo),iq=Pc()({reflectSymbol:function(){return"markdown"}})(Ef),Bm=Yr(Vu),B1=no(Sa),Rs=Yr(Bu),Vm=Lc(qu),V1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),J1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Q1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),j1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),fq=function(){function n(){}return n.value=new n,n}(),z1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),G1=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),vh=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),gh=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),Y1=function(){function n(){}return n.value=new n,n}(),nx=function(n){return Vt(function(e){return e.note})(function(e){return function(t){return{apiError:e.apiError,deleteAsk:e.deleteAsk,destroyed:e.destroyed,edit:e.edit,edit_note:e.edit_note,note:t}}})(n)},K1=nx(mo),cq=nx(Ft),lq=function(){return he.value}(),ex=function(n){return Vt(function(e){return e.edit_note})(function(e){return function(t){return{apiError:e.apiError,deleteAsk:e.deleteAsk,destroyed:e.destroyed,edit:e.edit,note:e.note,edit_note:t}}})(n)},Z1=ex(Ft),sq=ex(mo),pq=function(n){return Vt(function(e){return e.edit})(function(e){return function(t){return{apiError:e.apiError,deleteAsk:e.deleteAsk,destroyed:e.destroyed,edit_note:e.edit_note,note:e.note,edit:t}}})(n)},X1=pq(Ft),_q=function(n){return Vt(function(e){return e.apiError})(function(e){return function(t){return{deleteAsk:e.deleteAsk,destroyed:e.destroyed,edit:e.edit,edit_note:e.edit_note,note:e.note,apiError:t}}})(n)},Dh=_q(Ft),tx=function(n){var e=function(f){return k1(f.id)+"_text"},t=function(f){return{note:f,edit_note:f,deleteAsk:!1,edit:f.id<=0,destroyed:!1,apiError:b.value}},a=_a(void 0),u=function(f){if(f instanceof fq)return eq(void 0);if(f instanceof z1)return tq(Z1)(function(){if(f.value0 instanceof V1)return function(l){return{id:l.id,slug:l.slug,text:l.text,length:l.length,isMarkdown:l.isMarkdown,shared:l.shared,created:l.created,updated:l.updated,title:f.value0.value0}};if(f.value0 instanceof J1)return function(l){return{id:l.id,slug:l.slug,title:l.title,length:l.length,isMarkdown:l.isMarkdown,shared:l.shared,created:l.created,updated:l.updated,text:f.value0.value0}};if(f.value0 instanceof Q1)return function(l){return{id:l.id,slug:l.slug,title:l.title,text:l.text,length:l.length,shared:l.shared,created:l.created,updated:l.updated,isMarkdown:f.value0.value0}};if(f.value0 instanceof j1)return function(l){return{id:l.id,slug:l.slug,title:l.title,text:l.text,length:l.length,isMarkdown:l.isMarkdown,created:l.created,updated:l.updated,shared:f.value0.value0}};throw new Error("Failed pattern match at Component.NNote (line 194, column 19 - line 198, column 36): "+[f.value0.constructor.name])}());if(f instanceof gh)return $1(function(l){var p={};for(var d in l)({}).hasOwnProperty.call(l,d)&&(p[d]=l[d]);return p.deleteAsk=f.value0,p});if(f instanceof Y1)return To(mh(K1))(function(l){return Zu(rq(q1(aC(l.id))))(function(){return $1(function(p){var d={};for(var m in p)({}).hasOwnProperty.call(p,m)&&(d[m]=p[m]);return d.destroyed=!0,d})})});if(f instanceof vh)return To(mh(K1))(function(l){return Zu(nf(Z1)(l))(function(){return Zu(nf(X1)(f.value0))(function(){return To(Sr(bs))(function(p){var d={e:f.value0,q:Ts(p)("next")};return!d.e&&d.q instanceof y&&d.q.value0==="closeWindow"?Sr(dh(fc)(tr)):Sr(aq(oq(f.value0))(T_(e(l))))})})})});if(f instanceof G1)return Zu(Sr(eu(f.value0)))(function(){return To(mh(sq))(function(l){return Zu(nf(Dh)(b.value))(function(){return To(q1(rC(l)))(function(p){if(p instanceof z)return Zu(nf(Dh)(new y(lo(p.value0))))(function(){return Sr(ho(lo(p.value0)))});if(p instanceof Q&&p.value0.status>=200&&p.value0.status<300)return To(Sr(bs))(function(d){return To(Sr(xm))(function(m){return To(Sr(F_(m)))(function(v){return To(Sr(Sc))(function(g){return To(Sr(Gl(g)))(function(h){var E=Ts(d)("next");if(E instanceof y&&E.value0==="closeWindow")return Sr(dh(fc)(tr));if(E instanceof y&&E.value0==="back")return Sr(function(){var W=Ur(kl(h)(v));return W?Iu(v)(g):Iu(h)(g)}());var F=l.id===0;return F?Sr(dh(Iu(tu(a.noteR)))(Sc)):Zu(nf(cq)(l))(function(){return nf(X1)(!1)})})})})})});if(p instanceof Q)return Zu(nf(Dh)(new y(p.value0.body)))(function(){return Sr(ho(p.value0.body))});throw new Error("Failed pattern match at Component.NNote (line 226, column 40 - line 249, column 36): "+[p.constructor.name])})})})});throw new Error("Failed pattern match at Component.NNote (line 189, column 3 - line 189, column 77): "+[f.constructor.name])},i=function(f){var l=function(E){return Ll(1)(uq(function(F){return[jr,P(F)]})(Vr(`
-`)(E)))},p=function(E){return ic(E.created)},d=function(E){return xn([Ye(k1(f.note.id)),L("note w-100 mw7 pa1 mb2")])([xn([L("display")])([xn([L("link f5 lh-title")])([P(function(){var F=Jr(f.note.title);return F?"[no title]":f.note.title}())]),jr,function(){return f.note.isMarkdown?xn([L("description mt1")])([iq(lq)(void 0)(Wm)(f.note.text)(mi)]):xn([L("description mt1 mid-gray")])(l(f.note.text))}(),xn([L("link f7 dib gray w4")])([vo([ur(Jn(f.note.created)(Re)(p(f.note)))])([P(Jn("\xA0")(Ce)(p(f.note)))]),P(" - "),vo([L("gray")])([P(function(){return f.note.shared?"public":"private"}())])])]),Hr(a.dat.isowner)(function(F){return xn([L("edit_links db mt3")])([we([Bm(Se.value),Te(function(W){return new vh(!0)}),L("edit light-silver hover-blue")])([P("edit\xA0\xA0")]),xn([L("delete_link di")])([we([Bm(Se.value),Te(function(W){return new gh(!0)}),L("delete light-silver hover-blue"+B1(f.deleteAsk)(" dn"))])([P("delete")]),vo([L("confirm red"+B1(!f.deleteAsk)(" dn"))])([we([Bm(Se.value),Te(function(W){return new gh(!1)})])([P("cancel\xA0/\xA0")]),we([Bm(Se.value),Te(function(W){return Y1.value}),L("red")])([P("destroy")])])])])})])},m=function(E){return function(F){return z1.create(E(F))}},v=function(E){return Vi([L("red")])([P("you killed this note")])},g=function(E){return function(F){return xn([L("alert alert-err")])([P(E)])}},h=function(E){return Bi([wc(G1.create)])([Hr(Ur(f.apiError))(g(Ne("")(f.apiError))),Vi([L("mt2 mb1")])([P("title:")]),Oe([Rs(_o.value),L("title w-100 mb1 pt1 edit_form_input"),tt("title"),Vm(f.edit_note.title),Gr(m(V1.create)),hs(Jr(f.edit_note.title))]),jr,Vi([L("mt2 mb1")])([P("description:")]),Ji([Ye(e(f.edit_note)),L("description w-100 mb1 pt1 edit_form_input"),tt("text"),xc(25),Vm(f.edit_note.text),Gr(m(J1.create))]),xn([L("edit_form_checkboxes mb3")])([Oe([Rs(_r.value),L("is-markdown pointer"),Ye("edit_ismarkdown"),tt("ismarkdown"),Zr(f.edit_note.isMarkdown),zr(m(Q1.create))]),P(" "),Pt([zt("edit_ismarkdown"),L("mr2")])([P("use markdown?")]),jr]),xn([L("edit_form_checkboxes mb3")])([Oe([Rs(_r.value),L("is-markdown pointer"),Ye("edit_shared"),tt("shared"),Zr(f.edit_note.shared),zr(m(j1.create))]),P(" "),Pt([zt("edit_shared"),L("mr2")])([P("public?")]),jr]),Oe([Rs(Su.value),L("mr1 pv1 ph2 dark-gray ba b--moon-gray bg-near-white pointer rdim"),Vm("save")]),P(" "),Oe([Rs(sc.value),L("pv1 ph2 dark-gray ba b--moon-gray bg-near-white pointer rdim"),Vm("cancel"),Te(function(F){return new vh(!1)})])])};return Gi(f.destroyed)(v)($(Gi(f.edit)(h)(d)))};return jt({initialState:$(t(n)),render:i,eval:Qt({handleQuery:Yn.handleQuery,receive:Yn.receive,initialize:Yn.initialize,finalize:Yn.finalize,handleAction:u})})};var dq=S(ar),Jm=J(Ot),rx=rr(ya(ga)),ax=pr(Fe),hh=Oa(Fe),vq=ke($e)(Ot),gq=qn(mr),ef=gn(SE),Dq=fn(cn),ox=_n(yp),hq=bv(lr),Qm=M(Ae),yq=Mv(lr),Tq=hp(ut),bq=Nb(wl),Mq=mn(cr),Xu=Yr(Vu),Uc=no(Sa),Eq=lv(Tt)(Rt),Cq=cv(Tt)(Rt),ux=function(){function n(){}return n.value=new n,n}(),jm=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),tf=function(){function n(e){this.value0=e}return n.create=function(e){return new n(e)},n}(),ix=function(n){var e=function(m){return function(v){return function(g){return function(h){return function(E){return function(F){return function(){var W=h-g<.01;return W?1:m(v-g)/m(h-g)}()*(F-E)+E}}}}}},t=function(m){return{mode:m,tagcloud:Ei}},a=function(m){return m instanceof da?dq(void 0):Jm(rx(eC(Mg(m))))(function(v){return ax(function(g){var h={};for(var E in g)({}).hasOwnProperty.call(g,E)&&(h[E]=g[E]);return h.mode=m,h.tagcloud=Ne(Ei)(v),h})})},u=function(m){if(m instanceof ux)return Jm(hh(function(v){return v.mode}))(function(v){return a(v)});if(m instanceof jm)return vq(ax(function(v){var g={};for(var h in v)({}).hasOwnProperty.call(v,h)&&(g[h]=v[h]);return g.mode=Eg(v.mode)(m.value0),g}))(function(){return Jm(hh(function(v){return v.mode}))(function(v){return gq(rx(tC(Mg(v))))})});if(m instanceof tf)return Jm(hh(function(v){return v.mode}))(function(v){var g=ef(v)(m.value0);return g?u(new jm(!va(v))):a(Eg(m.value0)(!0))});throw new Error("Failed pattern match at Component.TagCloud (line 161, column 3 - line 161, column 69): "+[m.constructor.name])},i=_a(void 0),f=function(m){return tu(i.userR)+function(){var v=Jr(m);return v?"":"/t:"+m}()},l=function(m){return function(v){return function(g){return function(h){return function(E){var F=e(function(Rn){return jv(function(En){return 1+En}(Rn))})(Qo(E))(Qo(v))(Qo(g))(.6)(1),W=Sl(h),sn=e(Dq)(Qo(E))(Qo(v))(Qo(g))(100)(150),wn=ys("style")("font-size:"+(ox(sn)+("%"+(";opacity:"+ox(F)))));return[Lr([Kr(f(Hc(h))),L("link tag mr1"),wn])([P(h)]),Hr(!xb(m))(function(Rn){var En=hq(W)(m);return En?Lr([Kr(f(Fu("+")(Qm(Hc)(Hl(W)(m))))),L("link mr2 tag-include")])([P("\u2295")]):Lr([Kr(f(Fu("+")(Qm(Hc)(yq(W)(m))))),L("link mr2 tag-exclude")])([P("\u2296")])})]}}}}},p=function(m){return function(v){return function(g){var h=Qm(If(l(Qm(Sl)(m))(v)(g))),E=hv(Tq(function(F){return Sl(Ce(F))}));return function(F){return Up(h(E(bq(F))))}}}},d=function(m){if(m.mode instanceof da)return xn([L("tag_cloud")])([]);var v=new jo(va(m.mode),200),g=new Qr(va(m.mode),5),h=new Qr(va(m.mode),20),E=new Qr(va(m.mode),2),F=new Qr(va(m.mode),10),W=new Qr(va(m.mode),1);return xn([L("tag_cloud mv3")])([xn([L("tag_cloud_header mb2")])(Mq(sw(NE(m.mode))(function(sn){return[we([Xu(Se.value),L("pa1 f7 link hover-blue mr1 b"),Te(function(wn){return new jm(!va(m.mode))})])([P("Related Tags")])]})(function(sn){return[we([Xu(Se.value),L("pa1 f7 link hover-blue mr1"+Uc(ef(m.mode)(v))(" b")),ur("show a cloud of your most-used tags"),Te(function(wn){return new tf(v)})])([P("Top Tags")]),we([Xu(Se.value),L("pa1 f7 link hover-blue ml2 "+Uc(ef(m.mode)(W))(" b")),ur("show all tags"),Te(function(wn){return new tf(W)})])([P("all")]),P("\u2027"),we([Xu(Se.value),L("pa1 f7 link hover-blue"+Uc(ef(m.mode)(E))(" b")),ur("show tags with at least 2 bookmarks"),Te(function(wn){return new tf(E)})])([P("2")]),P("\u2027"),we([Xu(Se.value),L("pa1 f7 link hover-blue"+Uc(ef(m.mode)(g))(" b")),ur("show tags with at least 5 bookmarks"),Te(function(wn){return new tf(g)})])([P("5")]),P("\u2027"),we([Xu(Se.value),L("pa1 f7 link hover-blue"+Uc(ef(m.mode)(F))(" b")),ur("show tags with at least 10 bookmarks"),Te(function(wn){return new tf(F)})])([P("10")]),P("\u2027"),we([Xu(Se.value),L("pa1 f7 link hover-blue"+Uc(ef(m.mode)(h))(" b")),ur("show tags with at least 20 bookmarks"),Te(function(wn){return new tf(h)})])([P("20")])]}))([we([Xu(Se.value),L("pa1 ml2 f7 link silver hover-blue "),Te(function(sn){return new jm(!va(m.mode))})])([P(function(){var sn=va(m.mode);return sn?"hide":"show"}())])])),Hr(va(m.mode))(function(sn){var wn=Ne(1)(Eq(xv(m.tagcloud))),Rn=Ne(1)(Cq(xv(m.tagcloud)));return xn([L("tag_cloud_body")])(function(){return m.mode instanceof da?[]:m.mode instanceof po?p(m.mode.value1)(wn)(Rn)(m.tagcloud):p([])(wn)(Rn)(m.tagcloud)}())})])};return jt({initialState:$(t(n)),render:d,eval:Qt({handleQuery:Yn.handleQuery,receive:Yn.receive,finalize:Yn.finalize,handleAction:u,initialize:new y(ux.value)})})};var wq=J(Ct),xq=Gn(pt),Lq=fe(nt),Hq=Du(nt),Iq=S(er),Sq=fe(At),Aq=S(Ee);var ni=function(n){return wq(xq(Lq(Hq(function(){var e=fD(n);return function(t){return e(PE(t))}}())(Oi))(tr)))(function(e){return Iq(Sq(jl)(e))})},rf=__(st(yu)($(Aq(void 0))));var zm={suspend:LM,fork:l_,join:Pl,Monad0:function(){return Kf},Functor1:function(){return NM}};var Gm=function(n){return n.fork};var cx=x,qa=x,lx=function(n){var e=et(n)(gt);return function(t){return qa(function(a){return e(t)(a.rendering)})}},Rq=x,sx=function(n){return function(e){return qa(function(t){return Rq(e(t.rendering))})}},Oq=x,Ym=function(n){return function(e){return n(e)}},px=function(n){return function(e){return function(t){return function(a){return function(){var i=qe({})(),f=qe(vc)(),l=qe(vc)(),p=qe(t)(),d=qe(new y(Sn.value))(),m=qe(new y(Sn.value))(),v=qe(b.value)(),g=qe(1)(),h=qe(new y(Yo))(),E=qe(Yo)(),F={component:n,state:n.initialState(e),refs:Yo,children:vc,childrenIn:f,childrenOut:l,selfRef:i,handlerRef:p,pendingQueries:d,pendingOuts:m,pendingHandlers:v,rendering:b.value,fresh:g,subscriptions:h,forks:E,lifecycleHandlers:a};return ve(F)(i)(),Oq(i)}}}}};var Pq=et(Ee)(gt),Wq=fe(At),Uq=mc(LD),rt=J(Ct),be=Gn(pt),kq=ke($e),Ba=kq(Ct),Dx=et(er),$q=Dx(fo),hx=Gm(zm),qq=Gf(xu)(Ii)(fo),bo=S(er),Bq=M(Og),_x=wu(xu),Vq=M(pa),mx=zf(xu),Jq=M(ie),Qq=dc(LD),jq=hF(Ii),zq=RC(ym),Gq=uT(Aa),Yq=dc(ym),dx=Dx(gt),vx=mc(ym),Kq=mc(ut),Zq=RF(RM),Xq=OC(ut),nB=function(n){return function(e){return function(){var a=hn(e)(),u=hn(a.subscriptions)();return Pq(sm)(Wq(Uq(n))(u))()}}},Km=function(n){return function(e){return rt(be(hn(n)))(function(t){if(t instanceof b)return e;if(t instanceof y)return be(ve(new y(new In(e,t.value0)))(n));throw new Error("Failed pattern match at Halogen.Aff.Driver.Eval (line 188, column 33 - line 190, column 57): "+[t.constructor.name])})}},Zm=function(n){return function(e){return Ba(be(ve({initializers:Sn.value,finalizers:Sn.value})(n)))(function(){return rt(be(e))(function(t){return rt(be(hn(n)))(function(a){return Ba($q(hx)(a.finalizers))(function(){return Ba(qq(a.initializers))(function(){return bo(t)})})})})})}},af=__(st(yu)($(S(Ee)(void 0)))),gx=function(n){return function(e){return rt(be(hn(e)))(function(t){return be(zd(function(a){return{state:a+1|0,value:n(a)}})(t.fresh))})}},Th=function(n){return function(e){return function(t){return rt(be(hn(e)))(function(a){return ei(n)(e)(a.component.eval(new Fc(Bq(y.create)(HC(t)),$(b.value))))})}}},ei=function(n){return function(e){return function(t){var a=function(i){return function(f){return rt(be(hn(i)))(function(l){return PF(function(p){var d=function(m){return _x(rt(be(hn(m)))(function(v){return qa(function(g){return Th(n)(g.selfRef)(p.value1)})(v)}))};return Vq(p.value2)(mx(p.value0(Ii)(d)(l.children)))})(f)})}},u=function(i){return function(f){if(f instanceof ss)return rt(be(hn(i)))(function(l){var p=f.value0(l.state);if(yc(l.state)(p.value1))return bo(p.value0);if(ct)return Ba(be(ve({component:l.component,refs:l.refs,children:l.children,childrenIn:l.childrenIn,childrenOut:l.childrenOut,selfRef:l.selfRef,handlerRef:l.handlerRef,pendingQueries:l.pendingQueries,pendingOuts:l.pendingOuts,pendingHandlers:l.pendingHandlers,rendering:l.rendering,fresh:l.fresh,subscriptions:l.subscriptions,forks:l.forks,lifecycleHandlers:l.lifecycleHandlers,state:p.value1})(i)))(function(){return Ba(Zm(l.lifecycleHandlers)(n(l.lifecycleHandlers)(i)))(function(){return bo(p.value0)})});throw new Error("Failed pattern match at Halogen.Aff.Driver.Eval (line 86, column 7 - line 92, column 21): "+[p.constructor.name])});if(f instanceof pm)return rt(gx(qF)(i))(function(l){return rt(be(UF(f.value0(l))(function(p){return af(bh(n)(i)(new Ru(p)))})))(function(p){return rt(be(hn(i)))(function(d){return Ba(be(kr(Jq(Qq(l)(p)))(d.subscriptions)))(function(){return bo(f.value1(l))})})})});if(f instanceof _m)return Ba(be(nB(f.value0)(i)))(function(){return bo(f.value1)});if(f instanceof Tc)return f.value0;if(f instanceof mm)return a(i)(f.value0);if(f instanceof ps)return rt(be(hn(i)))(function(l){return rt(be(hn(l.handlerRef)))(function(p){return Ba(Km(l.pendingOuts)(p(f.value0)))(function(){return bo(f.value1)})})});if(f instanceof dm)return mx(jq(bD(function(){var l=ei(n)(i);return function(p){return _x(l(p))}}())(f.value0)));if(f instanceof vm)return rt(gx(BF)(i))(function(l){return rt(be(hn(i)))(function(p){return rt(be(qe(!1)))(function(d){return rt(hx(AM(be(function(){return kr(zq(l))(p.forks)(),ve(!0)(d)()}))(ei(n)(i)(f.value0))))(function(m){return Ba(be(Gq(hn(d))(kr(Yq(l)(m))(p.forks))))(function(){return bo(f.value1(l))})})})})});if(f instanceof gm)return rt(be(hn(i)))(function(l){return rt(be(hn(l.forks)))(function(p){return Ba(dx(Pl)(vx(f.value0)(p)))(function(){return bo(f.value1)})})});if(f instanceof Dm)return rt(be(hn(i)))(function(l){return rt(be(hn(l.forks)))(function(p){return Ba(dx(Wl(eo("Cancelled")))(vx(f.value0)(p)))(function(){return bo(f.value1)})})});if(f instanceof _s)return rt(be(hn(i)))(function(l){return bo(f.value1(Kq(f.value0)(l.refs)))});throw new Error("Failed pattern match at Halogen.Aff.Driver.Eval (line 83, column 12 - line 139, column 33): "+[f.constructor.name])}};return Zq(u(e))(t)}}},bh=function(n){return function(e){return function(t){if(t instanceof V_)return be(ee(kr)(e)(Ym(function(a){return{component:a.component,state:a.state,children:a.children,childrenIn:a.childrenIn,childrenOut:a.childrenOut,selfRef:a.selfRef,handlerRef:a.handlerRef,pendingQueries:a.pendingQueries,pendingOuts:a.pendingOuts,pendingHandlers:a.pendingHandlers,rendering:a.rendering,fresh:a.fresh,subscriptions:a.subscriptions,forks:a.forks,lifecycleHandlers:a.lifecycleHandlers,refs:Xq($(t.value1))(t.value0)(a.refs)}})));if(t instanceof Ru)return rt(be(hn(e)))(function(a){return ei(n)(e)(a.component.eval(new Cc(t.value0,void 0)))});throw new Error("Failed pattern match at Halogen.Aff.Driver.Eval (line 52, column 20 - line 58, column 62): "+[t.constructor.name])}}};var tB=J(nt),rB=ke($e),Fx=wi(Ee)(gt),wx=et(er)(fo),xx=Gm(zm),Ps=fe(nt),Lx=et(Ee),Hx=Lx(gt),yx=Lx($_),Tx=rB(Ct),aB=Gf(xu)(Ii)(fo),Os=Gn(pt),bx=S(Ee),Mh=M(On),Eh=S(er),Ch=aa(Ee),oB=sx(On),uB=qn(pa),Mx=kC(Ee),iB=lx(Ee),fB=ia(TT),cB=tl(On),Fh=J(Ct),lB=Gn(Af),Ex=function(){return qe({initializers:Sn.value,finalizers:Sn.value})}(),Cx=function(n){return function(){var t=hn(n)();return ve(b.value)(n)(),Fx(t)(function(){var a=wx(xx);return function(u){return af(a(Li(u)))}}())()}},sB=function(n){return function(){return Ps(Hx(yx(sm)))(hn(n.subscriptions))(),ve(b.value)(n.subscriptions)(),Ps(yx(function(){var t=Wl(eo("finalized"));return function(a){return af(t(a))}}()))(hn(n.forks))(),ve(Yo)(n.forks)()}},Ix=function(n){return function(e){return function(t){var a=function(m){return function(v){return qa(function(g){var h=ei(f)(g.selfRef)(g.component.eval(new bc(void 0)));return kr(function(E){return{initializers:new In(Tx(aB(Li(E.initializers)))(function(){return Tx(h)(function(){return Os(function(){return Cx(g.pendingQueries)(),Cx(g.pendingOuts)()})})}),v),finalizers:E.finalizers}})(m)})}},u=function(m){return function(v){return function(g){return ND(function(h){return function(){var F=Ex(),W=px(h)(g)(v)(F)(),sn=hn(m)();return ve({initializers:Sn.value,finalizers:sn.finalizers})(m)(),Ps(qa(function(){var wn=f(m);return function(Rn){return wn(function(En){return En.selfRef}(Rn))}}()))(hn(W))(),Ps(a(m)(sn.initializers))(hn(W))(),W}})}}},i=function(m){return function(v){return function(g){return function(h){return AD(function(E){return function(){var W=Mh(E.pop)(hn(g))(),sn=function(){if(W instanceof y){ve(W.value0.value1)(g)();var Rn=hn(W.value0.value0)();return qa(function(En){return function(){return ee(ve)(En.handlerRef)(function(){var re=Jn(Eh(void 0))(v);return function(An){return re(E.output(An))}}())(),af(ei(f)(En.selfRef)(En.component.eval(new Ec(E.input,void 0))))()}})(Rn)(),W.value0.value0}if(W instanceof b)return u(m)(function(){var En=Jn(Eh(void 0))(v);return function(U){return En(E.output(U))}}())(E.input)(E.component)();throw new Error("Failed pattern match at Halogen.Aff.Driver (line 213, column 14 - line 222, column 98): "+[W.constructor.name])}(),wn=Mh(function(Rn){return Ur(E.get(Rn))})(hn(h))();return Ch(wn)(Ms("Halogen: Duplicate slot address was detected during rendering, unexpected results may occur"))(),kr(E.set(sn))(h)(),tB(hn(sn))(oB(function(Rn){if(Rn instanceof b)return dT("Halogen internal error: child was not initialized in renderChild");if(Rn instanceof y)return bx(n.renderChild(Rn.value0));throw new Error("Failed pattern match at Halogen.Aff.Driver (line 227, column 37 - line 229, column 50): "+[Rn.constructor.name])}))()}})}}}},f=function(m){return function(v){return function(){var h=hn(v)(),E=Mh(Wo)(hn(h.pendingHandlers))();Ch(E)(ve(new y(Sn.value))(h.pendingHandlers))(),ve(vc)(h.childrenOut)(),ve(h.children)(h.childrenIn)();var F=function(){var En=Km(h.pendingHandlers),U=bh(f)(h.selfRef);return function(re){return En(uB(U(re)))}}(),W=function(){var En=Km(h.pendingQueries);return function(U){return En(F(Ru.create(U)))}}(),sn=n.render(function(En){return af(F(En))})(i(m)(W)(h.childrenIn)(h.childrenOut))(h.component.render(h.state))(h.rendering)(),wn=hn(h.childrenOut)(),Rn=hn(h.childrenIn)();return Mx(Rn)(function(En){return function(){var re=hn(En)();return iB(n.removeChild)(re)(),l(m)(re)()}})(),ee(kr)(h.selfRef)(Ym(function(En){return{component:En.component,state:En.state,refs:En.refs,childrenIn:En.childrenIn,childrenOut:En.childrenOut,selfRef:En.selfRef,handlerRef:En.handlerRef,pendingQueries:En.pendingQueries,pendingOuts:En.pendingOuts,pendingHandlers:En.pendingHandlers,fresh:En.fresh,subscriptions:En.subscriptions,forks:En.forks,lifecycleHandlers:En.lifecycleHandlers,rendering:new y(sn),children:wn}}))(),Ch(E)(ee(fB)(void 0)(function(En){return function(){var re=hn(h.pendingHandlers)();ve(new y(Sn.value))(h.pendingHandlers)(),Hx(function(){var vr=wx(xx);return function(Ta){return af(vr(Li(Ta)))}}())(re)();var An=hn(h.pendingHandlers)(),wt=Jn(!1)(aM)(An);return wt?cB(ve(b.value)(h.pendingHandlers))(new Nt(void 0))():new qt(void 0)}}))()}}},l=function(m){return qa(function(v){return function(){sB(v)();var h=ei(f)(v.selfRef)(v.component.eval(new Mc(void 0)));return kr(function(E){return{initializers:E.initializers,finalizers:new In(h,E.finalizers)}})(m)(),Mx(v.children)(function(E){return function(){var W=hn(E)();return l(m)(W)()}})()}})},p=function(m){return function(v){return function(g){return Fh(Os(hn(m)))(function(h){return h?Eh(b.value):Th(f)(v)(g)})}}},d=function(m){return function(v){return function(g){return Zm(v)(function(){var E=hn(m)();return E?void 0:(ve(!0)(m)(),l(v)(g)(),qa(function(F){return function(){var sn=lB(hn(F.selfRef))();return Fx(sn.rendering)(n.dispose)()}})(g)())})}}};return Fh(Os(Ex))(function(m){return Fh(Os(qe(!1)))(function(v){return Zm(m)(function(){var h=$F(),E=Ps(hn)(u(m)(function(){var F=kF(h.listener);return function(W){return Os(F(W))}}())(t)(e))();return qa(function(F){return bx({query:p(v)(F.selfRef),messages:h.emitter,dispose:d(v)(m)(E)})})(E)()})})})}}};var Va=function(n){return function(e){return function(){return e[n]}}};var _B=Va("baseURI"),mB=Va("ownerDocument"),Sx=Va("parentNode"),dB=Va("parentElement");var vB=Va("childNodes"),gB=Va("firstChild"),DB=Va("lastChild"),hB=Va("previousSibling"),Ax=Va("nextSibling"),yB=Va("nodeValue");var TB=Va("textContent");function wh(n){return function(e){return function(t){return function(){t.insertBefore(n,e)}}}}function Xm(n){return function(e){return function(){e.appendChild(n)}}}function xh(n){return function(e){return function(){e.removeChild(n)}}}var Nx=M(On);var Lh=function(){var n=Nx(Xn);return function(e){return n(Sx(e))}}();var Rx=function(){var n=Nx(Xn);return function(e){return n(Ax(e))}}();var Hh=function(n,e,t){var a=0,u;return function(i){if(a===2)return u;if(a===1)throw new ReferenceError(n+" was needed before it finished initializing (module "+e+", line "+i+")",e,i);return a=1,u=t(),a=2,u}},Ih=qn(On),FB=S(Ee),wB=et(Ee)(gt),xB=kt(),LB=aa(Ee),HB=Mu(Kd(Kd(ro))),IB=fn(cn),SB=J(Ct),AB=Gn(pt),NB=M(On),RB=fe(nt);var OB=function(n){return function(e){return function(t){return e instanceof y&&t instanceof y?Ih(wh(n)(e.value0)(t.value0)):e instanceof b&&t instanceof y?Ih(Xm(n)(t.value0)):FB(void 0)}}},Ox=function(n){return function(){var t=Lh(n.node)();return wB(function(a){return xh(n.node)(a)})(t)()}},PB=function(n){return function(e){return function(t){var a=cx(function(l){return l.node}),u=function(l){return l instanceof y?xr(l.value0):void 0},i=function(l){var p=QF(xB)(l),d=Hh("patch","Halogen.VDom.Driver",function(){return function(F,W){if(F instanceof y){if(W instanceof ds)return xr(F.value0),v(100)(W.value0);if(W instanceof Mm){var sn=wr(F.value0,W.value0);return Ge(new ze(Jt(sn),new y(sn),d(103),u))}throw new Error("Failed pattern match at Halogen.VDom.Driver (line 97, column 22 - line 103, column 79): "+[W.constructor.name])}return m(104)(W)}}),m=Hh("render","Halogen.VDom.Driver",function(){return function(F){if(F instanceof ds)return v(86)(F.value0);if(F instanceof Mm){var W=p(F.value0);return Ge(new ze(Jt(W),new y(W),d(89),u))}throw new Error("Failed pattern match at Halogen.VDom.Driver (line 84, column 7 - line 89, column 75): "+[F.constructor.name])}}),v=Hh("renderComponentSlot","Halogen.VDom.Driver",function(){return function(F){var W=hn(e)(),sn=W(F)(),wn=a(sn);return Ge(new ze(wn,b.value,d(117),u))}}),g=d(91),h=m(82),E=v(109);return h},f=tF(n);return{buildWidget:i,buildAttributes:f,document:t}}}},WB=function(n){return function(e){var t=function(a){return function(u){return function(i){return function(f){if(f instanceof b)return function(){var p=qe(u)(),d=PB(a)(p)(n),m=fs(d)(i),v=Jt(m);return Ih(Xm(v)(UE(e)))(),{machine:m,node:v,renderChildRef:p}};if(f instanceof y)return function(){ve(u)(f.value0.renderChildRef)();var p=Lh(f.value0.node)(),d=Rx(f.value0.node)(),m=wr(f.value0.machine,i),v=Jt(m);return LB(HB(yc)(f.value0.node)(v))(OB(v)(d)(p))(),{machine:m,node:v,renderChildRef:f.value0.renderChildRef}};throw new Error("Failed pattern match at Halogen.VDom.Driver (line 157, column 5 - line 173, column 80): "+[f.constructor.name])}}}};return{render:t,renderChild:IB,removeChild:Ox,dispose:Ox}}},of=function(n){return function(e){return function(t){return SB(AB(NB(Fg)(RB(Oi)(tr))))(function(a){return Ix(WB(a)(t))(n)(e)})}}};var uf=J(Ct),ff=et(er)(gt),kB=Gn(pt),kc=qn(pa),Ws=ke($e)(Ct),$B=fe(nt),qB=qn(On),Us=uf(ni("#content"))(ff(function(n){return kB(iD("view-rendered")("")(kE(n)))})),Ebn=function(n){return function(e){return rf(uf(ni(n))(ff(function(t){return kc(of(ix(AE(e)))(void 0)(t))})))}},Cbn=function(n){return function(e){return rf(uf(ni(n))(ff(function(t){return Ws(kc(of(U1(e))(void 0)(t)))(function(){return Us})})))}},Fbn=function(n){return function(e){return rf(uf(ni(n))(ff(function(t){return Ws(kc(of(tx(e))(void 0)(t)))(function(){return Us})})))}},wbn=function(n){return function(e){return rf(uf(ni(n))(ff(function(t){return Ws(kc(of(W1(e))(void 0)(t)))(function(){return Us})})))}},xbn=function(n){return function(e){return rf(uf(ni(n))(ff(function(t){return Ws(kc(of(Jw(e))(void 0)(t)))(function(){return Us})})))}},Lbn=function(n){return function(e){return rf(uf(ni(n))(ff(function(t){return Ws(kc(of(bw(e))(void 0)(t)))(function(){return Us})})))}},Hbn=function(n){return $B(function(e){return qB(qv(GE(e)))})(eu(n))};export{Hbn as logoutE,Lbn as renderAccountSettings,xbn as renderAddForm,wbn as renderBookmarks,Fbn as renderNote,Cbn as renderNotes,Ebn as renderTagCloud,Us as viewRendered};
-/*! Bundled license information:
-
-moment/moment.js:
-  (*! moment.js *)
-  (*! version : 2.30.1 *)
-  (*! authors : Tim Wood, Iskren Chernev, Moment.js contributors *)
-  (*! license : MIT *)
-  (*! momentjs.com *)
-
-dompurify/dist/purify.js:
-  (*! @license DOMPurify 3.0.8 | (c) Cure53 and other contributors | Released under the Apache license 2.0 and Mozilla Public License 2.0 | github.com/cure53/DOMPurify/blob/3.0.8/LICENSE *)
-*/
-//# sourceMappingURL=app.min.js.map
diff --git a/static/js/app.min.js.gz b/static/js/app.min.js.gz
deleted file mode 100644
index 4c0ad70..0000000
Binary files a/static/js/app.min.js.gz and /dev/null differ
diff --git a/static/js/app.min.js.map b/static/js/app.min.js.map
deleted file mode 100644
index 5336b48..0000000
--- a/static/js/app.min.js.map
+++ /dev/null
@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../node_modules/moment/moment.js", "../node_modules/dompurify/src/utils.js", "../node_modules/dompurify/src/tags.js", "../node_modules/dompurify/src/attrs.js", "../node_modules/dompurify/src/regexp.js", "../node_modules/dompurify/src/purify.js", "../output/Affjax/foreign.js", "../output/Data.Functor/foreign.js", "../.spago/p/prelude-6.0.1/src/Control/Semigroupoid.purs", "../.spago/p/prelude-6.0.1/src/Control/Category.purs", "../.spago/p/prelude-6.0.1/src/Data/Boolean.purs", "../.spago/p/prelude-6.0.1/src/Data/Function.purs", "../.spago/p/prelude-6.0.1/src/Type/Proxy.purs", "../.spago/p/prelude-6.0.1/src/Data/Functor.purs", "../output/Data.Semigroup/foreign.js", "../.spago/p/prelude-6.0.1/src/Data/Symbol.purs", "../.spago/p/prelude-6.0.1/src/Data/Void.purs", "../output/Record.Unsafe/foreign.js", "../.spago/p/prelude-6.0.1/src/Data/Semigroup.purs", "../.spago/p/control-6.0.0/src/Control/Alt.purs", "../output/Control.Apply/foreign.js", "../.spago/p/prelude-6.0.1/src/Control/Apply.purs", "../.spago/p/prelude-6.0.1/src/Control/Applicative.purs", "../output/Data.Bounded/foreign.js", "../output/Data.Ord/foreign.js", "../output/Data.Eq/foreign.js", "../.spago/p/prelude-6.0.1/src/Data/Eq.purs", "../.spago/p/prelude-6.0.1/src/Data/Ordering.purs", "../output/Data.Ring/foreign.js", "../output/Data.Semiring/foreign.js", "../.spago/p/prelude-6.0.1/src/Data/Semiring.purs", "../.spago/p/prelude-6.0.1/src/Data/Ring.purs", "../.spago/p/prelude-6.0.1/src/Data/Ord.purs", "../.spago/p/prelude-6.0.1/src/Data/Bounded.purs", "../output/Data.Show/foreign.js", "../.spago/p/prelude-6.0.1/src/Data/Show.purs", "../.spago/p/maybe-6.0.0/src/Data/Maybe.purs", "../.spago/p/media-types-6.0.0/src/Data/MediaType/Common.purs", "../.spago/p/affjax-13.0.0/src/Affjax/RequestBody.purs", "../output/Unsafe.Coerce/foreign.js", "../.spago/p/safe-coerce-2.0.0/src/Safe/Coerce.purs", "../.spago/p/newtype-5.0.0/src/Data/Newtype.purs", "../.spago/p/affjax-13.0.0/src/Affjax/RequestHeader.purs", "../.spago/p/affjax-13.0.0/src/Affjax/ResponseFormat.purs", "../.spago/p/affjax-13.0.0/src/Affjax/ResponseHeader.purs", "../output/Control.Bind/foreign.js", "../.spago/p/prelude-6.0.1/src/Control/Bind.purs", "../.spago/p/either-6.1.0/src/Data/Either.purs", "../output/Effect/foreign.js", "../.spago/p/prelude-6.0.1/src/Control/Monad.purs", "../output/Data.EuclideanRing/foreign.js", "../.spago/p/prelude-6.0.1/src/Data/CommutativeRing.purs", "../.spago/p/prelude-6.0.1/src/Data/EuclideanRing.purs", "../.spago/p/prelude-6.0.1/src/Data/Monoid.purs", "../.spago/p/effect-4.0.0/src/Effect.purs", "../output/Effect.Exception/foreign.js", "../.spago/p/exceptions-6.0.0/src/Effect/Exception.purs", "../.spago/p/transformers-6.0.0/src/Control/Monad/Error/Class.purs", "../.spago/p/identity-6.0.0/src/Data/Identity.purs", "../output/Effect.Ref/foreign.js", "../.spago/p/refs-6.0.0/src/Effect/Ref.purs", "../.spago/p/tailrec-6.1.0/src/Control/Monad/Rec/Class.purs", "../output/Data.HeytingAlgebra/foreign.js", "../.spago/p/prelude-6.0.1/src/Data/HeytingAlgebra.purs", "../.spago/p/tuples-7.0.0/src/Data/Tuple.purs", "../.spago/p/transformers-6.0.0/src/Control/Monad/State/Class.purs", "../.spago/p/effect-4.0.0/src/Effect/Class.purs", "../.spago/p/transformers-6.0.0/src/Control/Monad/Except/Trans.purs", "../.spago/p/transformers-6.0.0/src/Control/Monad/Except.purs", "../output/Data.Argonaut.Core/foreign.js", "../output/Foreign.Object/foreign.js", "../output/Data.Array/foreign.js", "../output/Data.Array.ST/foreign.js", "../output/Control.Monad.ST.Uncurried/foreign.js", "../.spago/p/arrays-7.3.0/src/Data/Array/ST.purs", "../output/Data.Foldable/foreign.js", "../.spago/p/control-6.0.0/src/Control/Plus.purs", "../.spago/p/bifunctors-6.0.0/src/Data/Bifunctor.purs", "../.spago/p/prelude-6.0.1/src/Data/Monoid/Disj.purs", "../.spago/p/foldable-traversable-6.0.0/src/Data/Foldable.purs", "../output/Data.Function.Uncurried/foreign.js", "../output/Data.Traversable/foreign.js", "../.spago/p/foldable-traversable-6.0.0/src/Data/Traversable.purs", "../output/Data.Unfoldable/foreign.js", "../output/Data.Unfoldable1/foreign.js", "../.spago/p/unfoldable-6.0.0/src/Data/Unfoldable1.purs", "../.spago/p/unfoldable-6.0.0/src/Data/Unfoldable.purs", "../.spago/p/arrays-7.3.0/src/Data/Array.purs", "../output/Foreign.Object.ST/foreign.js", "../.spago/p/foreign-object-4.1.0/src/Foreign/Object.purs", "../.spago/p/argonaut-core-7.0.0/src/Data/Argonaut/Core.purs", "../output/Data.Argonaut.Parser/foreign.js", "../.spago/p/argonaut-core-7.0.0/src/Data/Argonaut/Parser.purs", "../output/Data.String.Common/foreign.js", "../.spago/p/strings-6.0.1/src/Data/String/Common.purs", "../output/JSURI/foreign.js", "../.spago/p/js-uri-3.1.0/src/JSURI.purs", "../.spago/p/form-urlencoded-7.0.0/src/Data/FormURLEncoded.purs", "../.spago/p/http-methods-6.0.0/src/Data/HTTP/Method.purs", "../.spago/p/nonempty-7.0.0/src/Data/NonEmpty.purs", "../.spago/p/lists-7.0.0/src/Data/List/Types.purs", "../.spago/p/lists-7.0.0/src/Data/List.purs", "../output/Partial.Unsafe/foreign.js", "../output/Partial/foreign.js", "../.spago/p/partial-4.0.0/src/Partial.purs", "../.spago/p/partial-4.0.0/src/Partial/Unsafe.purs", "../.spago/p/lists-7.0.0/src/Data/List/NonEmpty.purs", "../output/Data.Nullable/foreign.js", "../.spago/p/nullable-6.0.0/src/Data/Nullable.purs", "../output/Effect.Aff/foreign.js", "../.spago/p/profunctor-6.0.0/src/Data/Profunctor.purs", "../.spago/p/parallel-7.0.0/src/Control/Parallel/Class.purs", "../.spago/p/parallel-7.0.0/src/Control/Parallel.purs", "../output/Effect.Unsafe/foreign.js", "../.spago/p/aff-7.1.0/src/Effect/Aff.purs", "../.spago/p/aff-7.1.0/src/Effect/Aff/Compat.purs", "../output/Foreign/foreign.js", "../output/Data.Int/foreign.js", "../output/Data.Number/foreign.js", "../.spago/p/integers-6.0.0/src/Data/Int.purs", "../output/Data.String.CodeUnits/foreign.js", "../output/Data.String.Unsafe/foreign.js", "../.spago/p/strings-6.0.1/src/Data/String/CodeUnits.purs", "../.spago/p/foreign-7.0.0/src/Foreign.purs", "../.spago/p/affjax-13.0.0/src/Affjax.purs", "../.spago/p/affjax-13.0.0/src/Affjax/StatusCode.purs", "../output/Affjax.Web/foreign.js", "../.spago/p/affjax-web-1.0.0/src/Affjax/Web.purs", "../output/Globals/foreign.js", "../src/Globals.purs", "../output/Simple.JSON/foreign.js", "../output/Data.Enum/foreign.js", "../.spago/p/enums-6.0.1/src/Data/Enum.purs", "../output/Foreign.Index/foreign.js", "../.spago/p/foreign-7.0.0/src/Foreign/Index.purs", "../.spago/p/record-4.0.0/src/Record.purs", "../output/Record.Builder/foreign.js", "../.spago/p/record-4.0.0/src/Record/Builder.purs", "../.spago/p/simple-json-9.0.0/src/Simple/JSON.purs", "../src/Model.purs", "../output/Web.HTML/foreign.js", "../.spago/p/web-html-4.1.0/src/Web/HTML/Common.purs", "../output/Web.HTML.HTMLDocument/foreign.js", "../.spago/p/web-html-4.1.0/src/Web/HTML/HTMLDocument.purs", "../output/Web.HTML.HTMLElement/foreign.js", "../.spago/p/web-html-4.1.0/src/Web/HTML/HTMLElement.purs", "../output/Web.HTML.Location/foreign.js", "../output/Web.HTML.Window/foreign.js", "../src/App.purs", "../.spago/p/dom-indexed-12.0.0/src/DOM/HTML/Indexed/InputType.purs", "../.spago/p/profunctor-lenses-8.0.0/src/Data/Lens/Internal/Forget.purs", "../.spago/p/profunctor-6.0.0/src/Data/Profunctor/Strong.purs", "../.spago/p/profunctor-lenses-8.0.0/src/Data/Lens/Getter.purs", "../.spago/p/profunctor-lenses-8.0.0/src/Data/Lens/Lens.purs", "../.spago/p/profunctor-lenses-8.0.0/src/Data/Lens/Setter.purs", "../.spago/p/aff-7.1.0/src/Effect/Aff/Class.purs", "../.spago/p/exists-6.0.0/src/Data/Exists.purs", "../.spago/p/free-7.1.0/src/Data/Coyoneda.purs", "../.spago/p/ordered-collections-3.1.1/src/Data/Map/Internal.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Data/OrdBox.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Data/Slot.purs", "../.spago/p/dom-indexed-12.0.0/src/DOM/HTML/Indexed/AutocompleteType.purs", "../.spago/p/dom-indexed-12.0.0/src/DOM/HTML/Indexed/ButtonType.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Query/Input.purs", "../.spago/p/halogen-vdom-8.0.0/src/Halogen/VDom/Machine.purs", "../.spago/p/halogen-vdom-8.0.0/src/Halogen/VDom/Types.purs", "../output/Halogen.VDom.Util/foreign.js", "../.spago/p/halogen-vdom-8.0.0/src/Halogen/VDom/Util.purs", "../output/Web.DOM.Element/foreign.js", "../output/Web.DOM.ParentNode/foreign.js", "../.spago/p/web-dom-6.0.0/src/Web/DOM/ParentNode.purs", "../.spago/p/web-dom-6.0.0/src/Web/DOM/Element.purs", "../.spago/p/halogen-vdom-8.0.0/src/Halogen/VDom/DOM.purs", "../output/Web.Event.EventTarget/foreign.js", "../.spago/p/halogen-vdom-8.0.0/src/Halogen/VDom/DOM/Prop.purs", "../.spago/p/halogen-7.0.0/src/Halogen/HTML/Core.purs", "../.spago/p/freeap-7.0.0/src/Control/Applicative/Free.purs", "../.spago/p/catenable-lists-7.0.0/src/Data/CatQueue.purs", "../.spago/p/catenable-lists-7.0.0/src/Data/CatList.purs", "../.spago/p/free-7.1.0/src/Control/Monad/Free.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Query/ChildQuery.purs", "../output/Unsafe.Reference/foreign.js", "../.spago/p/unsafe-reference-5.0.0/src/Unsafe/Reference.purs", "../.spago/p/halogen-subscriptions-2.0.0/src/Halogen/Subscription.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Query/HalogenM.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Query/HalogenQ.purs", "../.spago/p/halogen-vdom-8.0.0/src/Halogen/VDom/Thunk.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Component.purs", "../.spago/p/halogen-7.0.0/src/Halogen/HTML/Elements.purs", "../output/Web.Event.Event/foreign.js", "../.spago/p/web-events-4.0.0/src/Web/Event/Event.purs", "../.spago/p/web-html-4.1.0/src/Web/HTML/Event/EventTypes.purs", "../.spago/p/web-uievents-5.0.0/src/Web/UIEvent/MouseEvent/EventTypes.purs", "../.spago/p/halogen-7.0.0/src/Halogen/HTML/Events.purs", "../.spago/p/halogen-7.0.0/src/Halogen/HTML/Properties.purs", "../output/Data.String.CodePoints/foreign.js", "../.spago/p/strings-6.0.1/src/Data/String/CodePoints.purs", "../output/Web.DOM.Document/foreign.js", "../src/Util.purs", "../src/Component/AccountSettings.purs", "../output/Effect.Console/foreign.js", "../src/Component/Add.purs", "../output/Component.RawHtml/foreign.js", "../.spago/p/halogen-7.0.0/src/Halogen/Query.purs", "../src/Component/RawHtml.purs", "../node_modules/marked/src/defaults.ts", "../node_modules/marked/src/helpers.ts", "../node_modules/marked/src/Tokenizer.ts", "../node_modules/marked/src/rules.ts", "../node_modules/marked/src/Lexer.ts", "../node_modules/marked/src/Renderer.ts", "../node_modules/marked/src/TextRenderer.ts", "../node_modules/marked/src/Parser.ts", "../node_modules/marked/src/Hooks.ts", "../node_modules/marked/src/Instance.ts", "../node_modules/marked/src/marked.ts", "../output/Foreign.Marked/foreign.js", "../src/Marked.purs", "../src/Component/Markdown.purs", "../.spago/p/console-6.1.0/src/Effect/Class/Console.purs", "../.spago/p/halogen-7.0.0/src/Halogen/HTML.purs", "../src/Component/BMark.purs", "../src/Component/BList.purs", "../src/Component/NList.purs", "../src/Component/NNote.purs", "../src/Component/TagCloud.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Aff/Util.purs", "../.spago/p/fork-6.0.0/src/Control/Monad/Fork/Class.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Aff/Driver/State.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Aff/Driver/Eval.purs", "../.spago/p/halogen-7.0.0/src/Halogen/Aff/Driver.purs", "../output/Web.DOM.Node/foreign.js", "../.spago/p/web-dom-6.0.0/src/Web/DOM/Node.purs", "../.spago/p/halogen-7.0.0/src/Halogen/VDom/Driver.purs", "../src/Main.purs"],
-  "sourcesContent": ["//! moment.js\n//! version : 2.30.1\n//! authors : Tim Wood, Iskren Chernev, Moment.js contributors\n//! license : MIT\n//! momentjs.com\n\n;(function (global, factory) {\n    typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n    typeof define === 'function' && define.amd ? define(factory) :\n    global.moment = factory()\n}(this, (function () { 'use strict';\n\n    var hookCallback;\n\n    function hooks() {\n        return hookCallback.apply(null, arguments);\n    }\n\n    // This is done to register the method called with moment()\n    // without creating circular dependencies.\n    function setHookCallback(callback) {\n        hookCallback = callback;\n    }\n\n    function isArray(input) {\n        return (\n            input instanceof Array ||\n            Object.prototype.toString.call(input) === '[object Array]'\n        );\n    }\n\n    function isObject(input) {\n        // IE8 will treat undefined and null as object if it wasn't for\n        // input != null\n        return (\n            input != null &&\n            Object.prototype.toString.call(input) === '[object Object]'\n        );\n    }\n\n    function hasOwnProp(a, b) {\n        return Object.prototype.hasOwnProperty.call(a, b);\n    }\n\n    function isObjectEmpty(obj) {\n        if (Object.getOwnPropertyNames) {\n            return Object.getOwnPropertyNames(obj).length === 0;\n        } else {\n            var k;\n            for (k in obj) {\n                if (hasOwnProp(obj, k)) {\n                    return false;\n                }\n            }\n            return true;\n        }\n    }\n\n    function isUndefined(input) {\n        return input === void 0;\n    }\n\n    function isNumber(input) {\n        return (\n            typeof input === 'number' ||\n            Object.prototype.toString.call(input) === '[object Number]'\n        );\n    }\n\n    function isDate(input) {\n        return (\n            input instanceof Date ||\n            Object.prototype.toString.call(input) === '[object Date]'\n        );\n    }\n\n    function map(arr, fn) {\n        var res = [],\n            i,\n            arrLen = arr.length;\n        for (i = 0; i < arrLen; ++i) {\n            res.push(fn(arr[i], i));\n        }\n        return res;\n    }\n\n    function extend(a, b) {\n        for (var i in b) {\n            if (hasOwnProp(b, i)) {\n                a[i] = b[i];\n            }\n        }\n\n        if (hasOwnProp(b, 'toString')) {\n            a.toString = b.toString;\n        }\n\n        if (hasOwnProp(b, 'valueOf')) {\n            a.valueOf = b.valueOf;\n        }\n\n        return a;\n    }\n\n    function createUTC(input, format, locale, strict) {\n        return createLocalOrUTC(input, format, locale, strict, true).utc();\n    }\n\n    function defaultParsingFlags() {\n        // We need to deep clone this object.\n        return {\n            empty: false,\n            unusedTokens: [],\n            unusedInput: [],\n            overflow: -2,\n            charsLeftOver: 0,\n            nullInput: false,\n            invalidEra: null,\n            invalidMonth: null,\n            invalidFormat: false,\n            userInvalidated: false,\n            iso: false,\n            parsedDateParts: [],\n            era: null,\n            meridiem: null,\n            rfc2822: false,\n            weekdayMismatch: false,\n        };\n    }\n\n    function getParsingFlags(m) {\n        if (m._pf == null) {\n            m._pf = defaultParsingFlags();\n        }\n        return m._pf;\n    }\n\n    var some;\n    if (Array.prototype.some) {\n        some = Array.prototype.some;\n    } else {\n        some = function (fun) {\n            var t = Object(this),\n                len = t.length >>> 0,\n                i;\n\n            for (i = 0; i < len; i++) {\n                if (i in t && fun.call(this, t[i], i, t)) {\n                    return true;\n                }\n            }\n\n            return false;\n        };\n    }\n\n    function isValid(m) {\n        var flags = null,\n            parsedParts = false,\n            isNowValid = m._d && !isNaN(m._d.getTime());\n        if (isNowValid) {\n            flags = getParsingFlags(m);\n            parsedParts = some.call(flags.parsedDateParts, function (i) {\n                return i != null;\n            });\n            isNowValid =\n                flags.overflow < 0 &&\n                !flags.empty &&\n                !flags.invalidEra &&\n                !flags.invalidMonth &&\n                !flags.invalidWeekday &&\n                !flags.weekdayMismatch &&\n                !flags.nullInput &&\n                !flags.invalidFormat &&\n                !flags.userInvalidated &&\n                (!flags.meridiem || (flags.meridiem && parsedParts));\n            if (m._strict) {\n                isNowValid =\n                    isNowValid &&\n                    flags.charsLeftOver === 0 &&\n                    flags.unusedTokens.length === 0 &&\n                    flags.bigHour === undefined;\n            }\n        }\n        if (Object.isFrozen == null || !Object.isFrozen(m)) {\n            m._isValid = isNowValid;\n        } else {\n            return isNowValid;\n        }\n        return m._isValid;\n    }\n\n    function createInvalid(flags) {\n        var m = createUTC(NaN);\n        if (flags != null) {\n            extend(getParsingFlags(m), flags);\n        } else {\n            getParsingFlags(m).userInvalidated = true;\n        }\n\n        return m;\n    }\n\n    // Plugins that add properties should also add the key here (null value),\n    // so we can properly clone ourselves.\n    var momentProperties = (hooks.momentProperties = []),\n        updateInProgress = false;\n\n    function copyConfig(to, from) {\n        var i,\n            prop,\n            val,\n            momentPropertiesLen = momentProperties.length;\n\n        if (!isUndefined(from._isAMomentObject)) {\n            to._isAMomentObject = from._isAMomentObject;\n        }\n        if (!isUndefined(from._i)) {\n            to._i = from._i;\n        }\n        if (!isUndefined(from._f)) {\n            to._f = from._f;\n        }\n        if (!isUndefined(from._l)) {\n            to._l = from._l;\n        }\n        if (!isUndefined(from._strict)) {\n            to._strict = from._strict;\n        }\n        if (!isUndefined(from._tzm)) {\n            to._tzm = from._tzm;\n        }\n        if (!isUndefined(from._isUTC)) {\n            to._isUTC = from._isUTC;\n        }\n        if (!isUndefined(from._offset)) {\n            to._offset = from._offset;\n        }\n        if (!isUndefined(from._pf)) {\n            to._pf = getParsingFlags(from);\n        }\n        if (!isUndefined(from._locale)) {\n            to._locale = from._locale;\n        }\n\n        if (momentPropertiesLen > 0) {\n            for (i = 0; i < momentPropertiesLen; i++) {\n                prop = momentProperties[i];\n                val = from[prop];\n                if (!isUndefined(val)) {\n                    to[prop] = val;\n                }\n            }\n        }\n\n        return to;\n    }\n\n    // Moment prototype object\n    function Moment(config) {\n        copyConfig(this, config);\n        this._d = new Date(config._d != null ? config._d.getTime() : NaN);\n        if (!this.isValid()) {\n            this._d = new Date(NaN);\n        }\n        // Prevent infinite loop in case updateOffset creates new moment\n        // objects.\n        if (updateInProgress === false) {\n            updateInProgress = true;\n            hooks.updateOffset(this);\n            updateInProgress = false;\n        }\n    }\n\n    function isMoment(obj) {\n        return (\n            obj instanceof Moment || (obj != null && obj._isAMomentObject != null)\n        );\n    }\n\n    function warn(msg) {\n        if (\n            hooks.suppressDeprecationWarnings === false &&\n            typeof console !== 'undefined' &&\n            console.warn\n        ) {\n            console.warn('Deprecation warning: ' + msg);\n        }\n    }\n\n    function deprecate(msg, fn) {\n        var firstTime = true;\n\n        return extend(function () {\n            if (hooks.deprecationHandler != null) {\n                hooks.deprecationHandler(null, msg);\n            }\n            if (firstTime) {\n                var args = [],\n                    arg,\n                    i,\n                    key,\n                    argLen = arguments.length;\n                for (i = 0; i < argLen; i++) {\n                    arg = '';\n                    if (typeof arguments[i] === 'object') {\n                        arg += '\\n[' + i + '] ';\n                        for (key in arguments[0]) {\n                            if (hasOwnProp(arguments[0], key)) {\n                                arg += key + ': ' + arguments[0][key] + ', ';\n                            }\n                        }\n                        arg = arg.slice(0, -2); // Remove trailing comma and space\n                    } else {\n                        arg = arguments[i];\n                    }\n                    args.push(arg);\n                }\n                warn(\n                    msg +\n                        '\\nArguments: ' +\n                        Array.prototype.slice.call(args).join('') +\n                        '\\n' +\n                        new Error().stack\n                );\n                firstTime = false;\n            }\n            return fn.apply(this, arguments);\n        }, fn);\n    }\n\n    var deprecations = {};\n\n    function deprecateSimple(name, msg) {\n        if (hooks.deprecationHandler != null) {\n            hooks.deprecationHandler(name, msg);\n        }\n        if (!deprecations[name]) {\n            warn(msg);\n            deprecations[name] = true;\n        }\n    }\n\n    hooks.suppressDeprecationWarnings = false;\n    hooks.deprecationHandler = null;\n\n    function isFunction(input) {\n        return (\n            (typeof Function !== 'undefined' && input instanceof Function) ||\n            Object.prototype.toString.call(input) === '[object Function]'\n        );\n    }\n\n    function set(config) {\n        var prop, i;\n        for (i in config) {\n            if (hasOwnProp(config, i)) {\n                prop = config[i];\n                if (isFunction(prop)) {\n                    this[i] = prop;\n                } else {\n                    this['_' + i] = prop;\n                }\n            }\n        }\n        this._config = config;\n        // Lenient ordinal parsing accepts just a number in addition to\n        // number + (possibly) stuff coming from _dayOfMonthOrdinalParse.\n        // TODO: Remove \"ordinalParse\" fallback in next major release.\n        this._dayOfMonthOrdinalParseLenient = new RegExp(\n            (this._dayOfMonthOrdinalParse.source || this._ordinalParse.source) +\n                '|' +\n                /\\d{1,2}/.source\n        );\n    }\n\n    function mergeConfigs(parentConfig, childConfig) {\n        var res = extend({}, parentConfig),\n            prop;\n        for (prop in childConfig) {\n            if (hasOwnProp(childConfig, prop)) {\n                if (isObject(parentConfig[prop]) && isObject(childConfig[prop])) {\n                    res[prop] = {};\n                    extend(res[prop], parentConfig[prop]);\n                    extend(res[prop], childConfig[prop]);\n                } else if (childConfig[prop] != null) {\n                    res[prop] = childConfig[prop];\n                } else {\n                    delete res[prop];\n                }\n            }\n        }\n        for (prop in parentConfig) {\n            if (\n                hasOwnProp(parentConfig, prop) &&\n                !hasOwnProp(childConfig, prop) &&\n                isObject(parentConfig[prop])\n            ) {\n                // make sure changes to properties don't modify parent config\n                res[prop] = extend({}, res[prop]);\n            }\n        }\n        return res;\n    }\n\n    function Locale(config) {\n        if (config != null) {\n            this.set(config);\n        }\n    }\n\n    var keys;\n\n    if (Object.keys) {\n        keys = Object.keys;\n    } else {\n        keys = function (obj) {\n            var i,\n                res = [];\n            for (i in obj) {\n                if (hasOwnProp(obj, i)) {\n                    res.push(i);\n                }\n            }\n            return res;\n        };\n    }\n\n    var defaultCalendar = {\n        sameDay: '[Today at] LT',\n        nextDay: '[Tomorrow at] LT',\n        nextWeek: 'dddd [at] LT',\n        lastDay: '[Yesterday at] LT',\n        lastWeek: '[Last] dddd [at] LT',\n        sameElse: 'L',\n    };\n\n    function calendar(key, mom, now) {\n        var output = this._calendar[key] || this._calendar['sameElse'];\n        return isFunction(output) ? output.call(mom, now) : output;\n    }\n\n    function zeroFill(number, targetLength, forceSign) {\n        var absNumber = '' + Math.abs(number),\n            zerosToFill = targetLength - absNumber.length,\n            sign = number >= 0;\n        return (\n            (sign ? (forceSign ? '+' : '') : '-') +\n            Math.pow(10, Math.max(0, zerosToFill)).toString().substr(1) +\n            absNumber\n        );\n    }\n\n    var formattingTokens =\n            /(\\[[^\\[]*\\])|(\\\\)?([Hh]mm(ss)?|Mo|MM?M?M?|Do|DDDo|DD?D?D?|ddd?d?|do?|w[o|w]?|W[o|W]?|Qo?|N{1,5}|YYYYYY|YYYYY|YYYY|YY|y{2,4}|yo?|gg(ggg?)?|GG(GGG?)?|e|E|a|A|hh?|HH?|kk?|mm?|ss?|S{1,9}|x|X|zz?|ZZ?|.)/g,\n        localFormattingTokens = /(\\[[^\\[]*\\])|(\\\\)?(LTS|LT|LL?L?L?|l{1,4})/g,\n        formatFunctions = {},\n        formatTokenFunctions = {};\n\n    // token:    'M'\n    // padded:   ['MM', 2]\n    // ordinal:  'Mo'\n    // callback: function () { this.month() + 1 }\n    function addFormatToken(token, padded, ordinal, callback) {\n        var func = callback;\n        if (typeof callback === 'string') {\n            func = function () {\n                return this[callback]();\n            };\n        }\n        if (token) {\n            formatTokenFunctions[token] = func;\n        }\n        if (padded) {\n            formatTokenFunctions[padded[0]] = function () {\n                return zeroFill(func.apply(this, arguments), padded[1], padded[2]);\n            };\n        }\n        if (ordinal) {\n            formatTokenFunctions[ordinal] = function () {\n                return this.localeData().ordinal(\n                    func.apply(this, arguments),\n                    token\n                );\n            };\n        }\n    }\n\n    function removeFormattingTokens(input) {\n        if (input.match(/\\[[\\s\\S]/)) {\n            return input.replace(/^\\[|\\]$/g, '');\n        }\n        return input.replace(/\\\\/g, '');\n    }\n\n    function makeFormatFunction(format) {\n        var array = format.match(formattingTokens),\n            i,\n            length;\n\n        for (i = 0, length = array.length; i < length; i++) {\n            if (formatTokenFunctions[array[i]]) {\n                array[i] = formatTokenFunctions[array[i]];\n            } else {\n                array[i] = removeFormattingTokens(array[i]);\n            }\n        }\n\n        return function (mom) {\n            var output = '',\n                i;\n            for (i = 0; i < length; i++) {\n                output += isFunction(array[i])\n                    ? array[i].call(mom, format)\n                    : array[i];\n            }\n            return output;\n        };\n    }\n\n    // format date using native date object\n    function formatMoment(m, format) {\n        if (!m.isValid()) {\n            return m.localeData().invalidDate();\n        }\n\n        format = expandFormat(format, m.localeData());\n        formatFunctions[format] =\n            formatFunctions[format] || makeFormatFunction(format);\n\n        return formatFunctions[format](m);\n    }\n\n    function expandFormat(format, locale) {\n        var i = 5;\n\n        function replaceLongDateFormatTokens(input) {\n            return locale.longDateFormat(input) || input;\n        }\n\n        localFormattingTokens.lastIndex = 0;\n        while (i >= 0 && localFormattingTokens.test(format)) {\n            format = format.replace(\n                localFormattingTokens,\n                replaceLongDateFormatTokens\n            );\n            localFormattingTokens.lastIndex = 0;\n            i -= 1;\n        }\n\n        return format;\n    }\n\n    var defaultLongDateFormat = {\n        LTS: 'h:mm:ss A',\n        LT: 'h:mm A',\n        L: 'MM/DD/YYYY',\n        LL: 'MMMM D, YYYY',\n        LLL: 'MMMM D, YYYY h:mm A',\n        LLLL: 'dddd, MMMM D, YYYY h:mm A',\n    };\n\n    function longDateFormat(key) {\n        var format = this._longDateFormat[key],\n            formatUpper = this._longDateFormat[key.toUpperCase()];\n\n        if (format || !formatUpper) {\n            return format;\n        }\n\n        this._longDateFormat[key] = formatUpper\n            .match(formattingTokens)\n            .map(function (tok) {\n                if (\n                    tok === 'MMMM' ||\n                    tok === 'MM' ||\n                    tok === 'DD' ||\n                    tok === 'dddd'\n                ) {\n                    return tok.slice(1);\n                }\n                return tok;\n            })\n            .join('');\n\n        return this._longDateFormat[key];\n    }\n\n    var defaultInvalidDate = 'Invalid date';\n\n    function invalidDate() {\n        return this._invalidDate;\n    }\n\n    var defaultOrdinal = '%d',\n        defaultDayOfMonthOrdinalParse = /\\d{1,2}/;\n\n    function ordinal(number) {\n        return this._ordinal.replace('%d', number);\n    }\n\n    var defaultRelativeTime = {\n        future: 'in %s',\n        past: '%s ago',\n        s: 'a few seconds',\n        ss: '%d seconds',\n        m: 'a minute',\n        mm: '%d minutes',\n        h: 'an hour',\n        hh: '%d hours',\n        d: 'a day',\n        dd: '%d days',\n        w: 'a week',\n        ww: '%d weeks',\n        M: 'a month',\n        MM: '%d months',\n        y: 'a year',\n        yy: '%d years',\n    };\n\n    function relativeTime(number, withoutSuffix, string, isFuture) {\n        var output = this._relativeTime[string];\n        return isFunction(output)\n            ? output(number, withoutSuffix, string, isFuture)\n            : output.replace(/%d/i, number);\n    }\n\n    function pastFuture(diff, output) {\n        var format = this._relativeTime[diff > 0 ? 'future' : 'past'];\n        return isFunction(format) ? format(output) : format.replace(/%s/i, output);\n    }\n\n    var aliases = {\n        D: 'date',\n        dates: 'date',\n        date: 'date',\n        d: 'day',\n        days: 'day',\n        day: 'day',\n        e: 'weekday',\n        weekdays: 'weekday',\n        weekday: 'weekday',\n        E: 'isoWeekday',\n        isoweekdays: 'isoWeekday',\n        isoweekday: 'isoWeekday',\n        DDD: 'dayOfYear',\n        dayofyears: 'dayOfYear',\n        dayofyear: 'dayOfYear',\n        h: 'hour',\n        hours: 'hour',\n        hour: 'hour',\n        ms: 'millisecond',\n        milliseconds: 'millisecond',\n        millisecond: 'millisecond',\n        m: 'minute',\n        minutes: 'minute',\n        minute: 'minute',\n        M: 'month',\n        months: 'month',\n        month: 'month',\n        Q: 'quarter',\n        quarters: 'quarter',\n        quarter: 'quarter',\n        s: 'second',\n        seconds: 'second',\n        second: 'second',\n        gg: 'weekYear',\n        weekyears: 'weekYear',\n        weekyear: 'weekYear',\n        GG: 'isoWeekYear',\n        isoweekyears: 'isoWeekYear',\n        isoweekyear: 'isoWeekYear',\n        w: 'week',\n        weeks: 'week',\n        week: 'week',\n        W: 'isoWeek',\n        isoweeks: 'isoWeek',\n        isoweek: 'isoWeek',\n        y: 'year',\n        years: 'year',\n        year: 'year',\n    };\n\n    function normalizeUnits(units) {\n        return typeof units === 'string'\n            ? aliases[units] || aliases[units.toLowerCase()]\n            : undefined;\n    }\n\n    function normalizeObjectUnits(inputObject) {\n        var normalizedInput = {},\n            normalizedProp,\n            prop;\n\n        for (prop in inputObject) {\n            if (hasOwnProp(inputObject, prop)) {\n                normalizedProp = normalizeUnits(prop);\n                if (normalizedProp) {\n                    normalizedInput[normalizedProp] = inputObject[prop];\n                }\n            }\n        }\n\n        return normalizedInput;\n    }\n\n    var priorities = {\n        date: 9,\n        day: 11,\n        weekday: 11,\n        isoWeekday: 11,\n        dayOfYear: 4,\n        hour: 13,\n        millisecond: 16,\n        minute: 14,\n        month: 8,\n        quarter: 7,\n        second: 15,\n        weekYear: 1,\n        isoWeekYear: 1,\n        week: 5,\n        isoWeek: 5,\n        year: 1,\n    };\n\n    function getPrioritizedUnits(unitsObj) {\n        var units = [],\n            u;\n        for (u in unitsObj) {\n            if (hasOwnProp(unitsObj, u)) {\n                units.push({ unit: u, priority: priorities[u] });\n            }\n        }\n        units.sort(function (a, b) {\n            return a.priority - b.priority;\n        });\n        return units;\n    }\n\n    var match1 = /\\d/, //       0 - 9\n        match2 = /\\d\\d/, //      00 - 99\n        match3 = /\\d{3}/, //     000 - 999\n        match4 = /\\d{4}/, //    0000 - 9999\n        match6 = /[+-]?\\d{6}/, // -999999 - 999999\n        match1to2 = /\\d\\d?/, //       0 - 99\n        match3to4 = /\\d\\d\\d\\d?/, //     999 - 9999\n        match5to6 = /\\d\\d\\d\\d\\d\\d?/, //   99999 - 999999\n        match1to3 = /\\d{1,3}/, //       0 - 999\n        match1to4 = /\\d{1,4}/, //       0 - 9999\n        match1to6 = /[+-]?\\d{1,6}/, // -999999 - 999999\n        matchUnsigned = /\\d+/, //       0 - inf\n        matchSigned = /[+-]?\\d+/, //    -inf - inf\n        matchOffset = /Z|[+-]\\d\\d:?\\d\\d/gi, // +00:00 -00:00 +0000 -0000 or Z\n        matchShortOffset = /Z|[+-]\\d\\d(?::?\\d\\d)?/gi, // +00 -00 +00:00 -00:00 +0000 -0000 or Z\n        matchTimestamp = /[+-]?\\d+(\\.\\d{1,3})?/, // 123456789 123456789.123\n        // any word (or two) characters or numbers including two/three word month in arabic.\n        // includes scottish gaelic two word and hyphenated months\n        matchWord =\n            /[0-9]{0,256}['a-z\\u00A0-\\u05FF\\u0700-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFF07\\uFF10-\\uFFEF]{1,256}|[\\u0600-\\u06FF\\/]{1,256}(\\s*?[\\u0600-\\u06FF]{1,256}){1,2}/i,\n        match1to2NoLeadingZero = /^[1-9]\\d?/, //         1-99\n        match1to2HasZero = /^([1-9]\\d|\\d)/, //           0-99\n        regexes;\n\n    regexes = {};\n\n    function addRegexToken(token, regex, strictRegex) {\n        regexes[token] = isFunction(regex)\n            ? regex\n            : function (isStrict, localeData) {\n                  return isStrict && strictRegex ? strictRegex : regex;\n              };\n    }\n\n    function getParseRegexForToken(token, config) {\n        if (!hasOwnProp(regexes, token)) {\n            return new RegExp(unescapeFormat(token));\n        }\n\n        return regexes[token](config._strict, config._locale);\n    }\n\n    // Code from http://stackoverflow.com/questions/3561493/is-there-a-regexp-escape-function-in-javascript\n    function unescapeFormat(s) {\n        return regexEscape(\n            s\n                .replace('\\\\', '')\n                .replace(\n                    /\\\\(\\[)|\\\\(\\])|\\[([^\\]\\[]*)\\]|\\\\(.)/g,\n                    function (matched, p1, p2, p3, p4) {\n                        return p1 || p2 || p3 || p4;\n                    }\n                )\n        );\n    }\n\n    function regexEscape(s) {\n        return s.replace(/[-\\/\\\\^$*+?.()|[\\]{}]/g, '\\\\$&');\n    }\n\n    function absFloor(number) {\n        if (number < 0) {\n            // -0 -> 0\n            return Math.ceil(number) || 0;\n        } else {\n            return Math.floor(number);\n        }\n    }\n\n    function toInt(argumentForCoercion) {\n        var coercedNumber = +argumentForCoercion,\n            value = 0;\n\n        if (coercedNumber !== 0 && isFinite(coercedNumber)) {\n            value = absFloor(coercedNumber);\n        }\n\n        return value;\n    }\n\n    var tokens = {};\n\n    function addParseToken(token, callback) {\n        var i,\n            func = callback,\n            tokenLen;\n        if (typeof token === 'string') {\n            token = [token];\n        }\n        if (isNumber(callback)) {\n            func = function (input, array) {\n                array[callback] = toInt(input);\n            };\n        }\n        tokenLen = token.length;\n        for (i = 0; i < tokenLen; i++) {\n            tokens[token[i]] = func;\n        }\n    }\n\n    function addWeekParseToken(token, callback) {\n        addParseToken(token, function (input, array, config, token) {\n            config._w = config._w || {};\n            callback(input, config._w, config, token);\n        });\n    }\n\n    function addTimeToArrayFromToken(token, input, config) {\n        if (input != null && hasOwnProp(tokens, token)) {\n            tokens[token](input, config._a, config, token);\n        }\n    }\n\n    function isLeapYear(year) {\n        return (year % 4 === 0 && year % 100 !== 0) || year % 400 === 0;\n    }\n\n    var YEAR = 0,\n        MONTH = 1,\n        DATE = 2,\n        HOUR = 3,\n        MINUTE = 4,\n        SECOND = 5,\n        MILLISECOND = 6,\n        WEEK = 7,\n        WEEKDAY = 8;\n\n    // FORMATTING\n\n    addFormatToken('Y', 0, 0, function () {\n        var y = this.year();\n        return y <= 9999 ? zeroFill(y, 4) : '+' + y;\n    });\n\n    addFormatToken(0, ['YY', 2], 0, function () {\n        return this.year() % 100;\n    });\n\n    addFormatToken(0, ['YYYY', 4], 0, 'year');\n    addFormatToken(0, ['YYYYY', 5], 0, 'year');\n    addFormatToken(0, ['YYYYYY', 6, true], 0, 'year');\n\n    // PARSING\n\n    addRegexToken('Y', matchSigned);\n    addRegexToken('YY', match1to2, match2);\n    addRegexToken('YYYY', match1to4, match4);\n    addRegexToken('YYYYY', match1to6, match6);\n    addRegexToken('YYYYYY', match1to6, match6);\n\n    addParseToken(['YYYYY', 'YYYYYY'], YEAR);\n    addParseToken('YYYY', function (input, array) {\n        array[YEAR] =\n            input.length === 2 ? hooks.parseTwoDigitYear(input) : toInt(input);\n    });\n    addParseToken('YY', function (input, array) {\n        array[YEAR] = hooks.parseTwoDigitYear(input);\n    });\n    addParseToken('Y', function (input, array) {\n        array[YEAR] = parseInt(input, 10);\n    });\n\n    // HELPERS\n\n    function daysInYear(year) {\n        return isLeapYear(year) ? 366 : 365;\n    }\n\n    // HOOKS\n\n    hooks.parseTwoDigitYear = function (input) {\n        return toInt(input) + (toInt(input) > 68 ? 1900 : 2000);\n    };\n\n    // MOMENTS\n\n    var getSetYear = makeGetSet('FullYear', true);\n\n    function getIsLeapYear() {\n        return isLeapYear(this.year());\n    }\n\n    function makeGetSet(unit, keepTime) {\n        return function (value) {\n            if (value != null) {\n                set$1(this, unit, value);\n                hooks.updateOffset(this, keepTime);\n                return this;\n            } else {\n                return get(this, unit);\n            }\n        };\n    }\n\n    function get(mom, unit) {\n        if (!mom.isValid()) {\n            return NaN;\n        }\n\n        var d = mom._d,\n            isUTC = mom._isUTC;\n\n        switch (unit) {\n            case 'Milliseconds':\n                return isUTC ? d.getUTCMilliseconds() : d.getMilliseconds();\n            case 'Seconds':\n                return isUTC ? d.getUTCSeconds() : d.getSeconds();\n            case 'Minutes':\n                return isUTC ? d.getUTCMinutes() : d.getMinutes();\n            case 'Hours':\n                return isUTC ? d.getUTCHours() : d.getHours();\n            case 'Date':\n                return isUTC ? d.getUTCDate() : d.getDate();\n            case 'Day':\n                return isUTC ? d.getUTCDay() : d.getDay();\n            case 'Month':\n                return isUTC ? d.getUTCMonth() : d.getMonth();\n            case 'FullYear':\n                return isUTC ? d.getUTCFullYear() : d.getFullYear();\n            default:\n                return NaN; // Just in case\n        }\n    }\n\n    function set$1(mom, unit, value) {\n        var d, isUTC, year, month, date;\n\n        if (!mom.isValid() || isNaN(value)) {\n            return;\n        }\n\n        d = mom._d;\n        isUTC = mom._isUTC;\n\n        switch (unit) {\n            case 'Milliseconds':\n                return void (isUTC\n                    ? d.setUTCMilliseconds(value)\n                    : d.setMilliseconds(value));\n            case 'Seconds':\n                return void (isUTC ? d.setUTCSeconds(value) : d.setSeconds(value));\n            case 'Minutes':\n                return void (isUTC ? d.setUTCMinutes(value) : d.setMinutes(value));\n            case 'Hours':\n                return void (isUTC ? d.setUTCHours(value) : d.setHours(value));\n            case 'Date':\n                return void (isUTC ? d.setUTCDate(value) : d.setDate(value));\n            // case 'Day': // Not real\n            //    return void (isUTC ? d.setUTCDay(value) : d.setDay(value));\n            // case 'Month': // Not used because we need to pass two variables\n            //     return void (isUTC ? d.setUTCMonth(value) : d.setMonth(value));\n            case 'FullYear':\n                break; // See below ...\n            default:\n                return; // Just in case\n        }\n\n        year = value;\n        month = mom.month();\n        date = mom.date();\n        date = date === 29 && month === 1 && !isLeapYear(year) ? 28 : date;\n        void (isUTC\n            ? d.setUTCFullYear(year, month, date)\n            : d.setFullYear(year, month, date));\n    }\n\n    // MOMENTS\n\n    function stringGet(units) {\n        units = normalizeUnits(units);\n        if (isFunction(this[units])) {\n            return this[units]();\n        }\n        return this;\n    }\n\n    function stringSet(units, value) {\n        if (typeof units === 'object') {\n            units = normalizeObjectUnits(units);\n            var prioritized = getPrioritizedUnits(units),\n                i,\n                prioritizedLen = prioritized.length;\n            for (i = 0; i < prioritizedLen; i++) {\n                this[prioritized[i].unit](units[prioritized[i].unit]);\n            }\n        } else {\n            units = normalizeUnits(units);\n            if (isFunction(this[units])) {\n                return this[units](value);\n            }\n        }\n        return this;\n    }\n\n    function mod(n, x) {\n        return ((n % x) + x) % x;\n    }\n\n    var indexOf;\n\n    if (Array.prototype.indexOf) {\n        indexOf = Array.prototype.indexOf;\n    } else {\n        indexOf = function (o) {\n            // I know\n            var i;\n            for (i = 0; i < this.length; ++i) {\n                if (this[i] === o) {\n                    return i;\n                }\n            }\n            return -1;\n        };\n    }\n\n    function daysInMonth(year, month) {\n        if (isNaN(year) || isNaN(month)) {\n            return NaN;\n        }\n        var modMonth = mod(month, 12);\n        year += (month - modMonth) / 12;\n        return modMonth === 1\n            ? isLeapYear(year)\n                ? 29\n                : 28\n            : 31 - ((modMonth % 7) % 2);\n    }\n\n    // FORMATTING\n\n    addFormatToken('M', ['MM', 2], 'Mo', function () {\n        return this.month() + 1;\n    });\n\n    addFormatToken('MMM', 0, 0, function (format) {\n        return this.localeData().monthsShort(this, format);\n    });\n\n    addFormatToken('MMMM', 0, 0, function (format) {\n        return this.localeData().months(this, format);\n    });\n\n    // PARSING\n\n    addRegexToken('M', match1to2, match1to2NoLeadingZero);\n    addRegexToken('MM', match1to2, match2);\n    addRegexToken('MMM', function (isStrict, locale) {\n        return locale.monthsShortRegex(isStrict);\n    });\n    addRegexToken('MMMM', function (isStrict, locale) {\n        return locale.monthsRegex(isStrict);\n    });\n\n    addParseToken(['M', 'MM'], function (input, array) {\n        array[MONTH] = toInt(input) - 1;\n    });\n\n    addParseToken(['MMM', 'MMMM'], function (input, array, config, token) {\n        var month = config._locale.monthsParse(input, token, config._strict);\n        // if we didn't find a month name, mark the date as invalid.\n        if (month != null) {\n            array[MONTH] = month;\n        } else {\n            getParsingFlags(config).invalidMonth = input;\n        }\n    });\n\n    // LOCALES\n\n    var defaultLocaleMonths =\n            'January_February_March_April_May_June_July_August_September_October_November_December'.split(\n                '_'\n            ),\n        defaultLocaleMonthsShort =\n            'Jan_Feb_Mar_Apr_May_Jun_Jul_Aug_Sep_Oct_Nov_Dec'.split('_'),\n        MONTHS_IN_FORMAT = /D[oD]?(\\[[^\\[\\]]*\\]|\\s)+MMMM?/,\n        defaultMonthsShortRegex = matchWord,\n        defaultMonthsRegex = matchWord;\n\n    function localeMonths(m, format) {\n        if (!m) {\n            return isArray(this._months)\n                ? this._months\n                : this._months['standalone'];\n        }\n        return isArray(this._months)\n            ? this._months[m.month()]\n            : this._months[\n                  (this._months.isFormat || MONTHS_IN_FORMAT).test(format)\n                      ? 'format'\n                      : 'standalone'\n              ][m.month()];\n    }\n\n    function localeMonthsShort(m, format) {\n        if (!m) {\n            return isArray(this._monthsShort)\n                ? this._monthsShort\n                : this._monthsShort['standalone'];\n        }\n        return isArray(this._monthsShort)\n            ? this._monthsShort[m.month()]\n            : this._monthsShort[\n                  MONTHS_IN_FORMAT.test(format) ? 'format' : 'standalone'\n              ][m.month()];\n    }\n\n    function handleStrictParse(monthName, format, strict) {\n        var i,\n            ii,\n            mom,\n            llc = monthName.toLocaleLowerCase();\n        if (!this._monthsParse) {\n            // this is not used\n            this._monthsParse = [];\n            this._longMonthsParse = [];\n            this._shortMonthsParse = [];\n            for (i = 0; i < 12; ++i) {\n                mom = createUTC([2000, i]);\n                this._shortMonthsParse[i] = this.monthsShort(\n                    mom,\n                    ''\n                ).toLocaleLowerCase();\n                this._longMonthsParse[i] = this.months(mom, '').toLocaleLowerCase();\n            }\n        }\n\n        if (strict) {\n            if (format === 'MMM') {\n                ii = indexOf.call(this._shortMonthsParse, llc);\n                return ii !== -1 ? ii : null;\n            } else {\n                ii = indexOf.call(this._longMonthsParse, llc);\n                return ii !== -1 ? ii : null;\n            }\n        } else {\n            if (format === 'MMM') {\n                ii = indexOf.call(this._shortMonthsParse, llc);\n                if (ii !== -1) {\n                    return ii;\n                }\n                ii = indexOf.call(this._longMonthsParse, llc);\n                return ii !== -1 ? ii : null;\n            } else {\n                ii = indexOf.call(this._longMonthsParse, llc);\n                if (ii !== -1) {\n                    return ii;\n                }\n                ii = indexOf.call(this._shortMonthsParse, llc);\n                return ii !== -1 ? ii : null;\n            }\n        }\n    }\n\n    function localeMonthsParse(monthName, format, strict) {\n        var i, mom, regex;\n\n        if (this._monthsParseExact) {\n            return handleStrictParse.call(this, monthName, format, strict);\n        }\n\n        if (!this._monthsParse) {\n            this._monthsParse = [];\n            this._longMonthsParse = [];\n            this._shortMonthsParse = [];\n        }\n\n        // TODO: add sorting\n        // Sorting makes sure if one month (or abbr) is a prefix of another\n        // see sorting in computeMonthsParse\n        for (i = 0; i < 12; i++) {\n            // make the regex if we don't have it already\n            mom = createUTC([2000, i]);\n            if (strict && !this._longMonthsParse[i]) {\n                this._longMonthsParse[i] = new RegExp(\n                    '^' + this.months(mom, '').replace('.', '') + '$',\n                    'i'\n                );\n                this._shortMonthsParse[i] = new RegExp(\n                    '^' + this.monthsShort(mom, '').replace('.', '') + '$',\n                    'i'\n                );\n            }\n            if (!strict && !this._monthsParse[i]) {\n                regex =\n                    '^' + this.months(mom, '') + '|^' + this.monthsShort(mom, '');\n                this._monthsParse[i] = new RegExp(regex.replace('.', ''), 'i');\n            }\n            // test the regex\n            if (\n                strict &&\n                format === 'MMMM' &&\n                this._longMonthsParse[i].test(monthName)\n            ) {\n                return i;\n            } else if (\n                strict &&\n                format === 'MMM' &&\n                this._shortMonthsParse[i].test(monthName)\n            ) {\n                return i;\n            } else if (!strict && this._monthsParse[i].test(monthName)) {\n                return i;\n            }\n        }\n    }\n\n    // MOMENTS\n\n    function setMonth(mom, value) {\n        if (!mom.isValid()) {\n            // No op\n            return mom;\n        }\n\n        if (typeof value === 'string') {\n            if (/^\\d+$/.test(value)) {\n                value = toInt(value);\n            } else {\n                value = mom.localeData().monthsParse(value);\n                // TODO: Another silent failure?\n                if (!isNumber(value)) {\n                    return mom;\n                }\n            }\n        }\n\n        var month = value,\n            date = mom.date();\n\n        date = date < 29 ? date : Math.min(date, daysInMonth(mom.year(), month));\n        void (mom._isUTC\n            ? mom._d.setUTCMonth(month, date)\n            : mom._d.setMonth(month, date));\n        return mom;\n    }\n\n    function getSetMonth(value) {\n        if (value != null) {\n            setMonth(this, value);\n            hooks.updateOffset(this, true);\n            return this;\n        } else {\n            return get(this, 'Month');\n        }\n    }\n\n    function getDaysInMonth() {\n        return daysInMonth(this.year(), this.month());\n    }\n\n    function monthsShortRegex(isStrict) {\n        if (this._monthsParseExact) {\n            if (!hasOwnProp(this, '_monthsRegex')) {\n                computeMonthsParse.call(this);\n            }\n            if (isStrict) {\n                return this._monthsShortStrictRegex;\n            } else {\n                return this._monthsShortRegex;\n            }\n        } else {\n            if (!hasOwnProp(this, '_monthsShortRegex')) {\n                this._monthsShortRegex = defaultMonthsShortRegex;\n            }\n            return this._monthsShortStrictRegex && isStrict\n                ? this._monthsShortStrictRegex\n                : this._monthsShortRegex;\n        }\n    }\n\n    function monthsRegex(isStrict) {\n        if (this._monthsParseExact) {\n            if (!hasOwnProp(this, '_monthsRegex')) {\n                computeMonthsParse.call(this);\n            }\n            if (isStrict) {\n                return this._monthsStrictRegex;\n            } else {\n                return this._monthsRegex;\n            }\n        } else {\n            if (!hasOwnProp(this, '_monthsRegex')) {\n                this._monthsRegex = defaultMonthsRegex;\n            }\n            return this._monthsStrictRegex && isStrict\n                ? this._monthsStrictRegex\n                : this._monthsRegex;\n        }\n    }\n\n    function computeMonthsParse() {\n        function cmpLenRev(a, b) {\n            return b.length - a.length;\n        }\n\n        var shortPieces = [],\n            longPieces = [],\n            mixedPieces = [],\n            i,\n            mom,\n            shortP,\n            longP;\n        for (i = 0; i < 12; i++) {\n            // make the regex if we don't have it already\n            mom = createUTC([2000, i]);\n            shortP = regexEscape(this.monthsShort(mom, ''));\n            longP = regexEscape(this.months(mom, ''));\n            shortPieces.push(shortP);\n            longPieces.push(longP);\n            mixedPieces.push(longP);\n            mixedPieces.push(shortP);\n        }\n        // Sorting makes sure if one month (or abbr) is a prefix of another it\n        // will match the longer piece.\n        shortPieces.sort(cmpLenRev);\n        longPieces.sort(cmpLenRev);\n        mixedPieces.sort(cmpLenRev);\n\n        this._monthsRegex = new RegExp('^(' + mixedPieces.join('|') + ')', 'i');\n        this._monthsShortRegex = this._monthsRegex;\n        this._monthsStrictRegex = new RegExp(\n            '^(' + longPieces.join('|') + ')',\n            'i'\n        );\n        this._monthsShortStrictRegex = new RegExp(\n            '^(' + shortPieces.join('|') + ')',\n            'i'\n        );\n    }\n\n    function createDate(y, m, d, h, M, s, ms) {\n        // can't just apply() to create a date:\n        // https://stackoverflow.com/q/181348\n        var date;\n        // the date constructor remaps years 0-99 to 1900-1999\n        if (y < 100 && y >= 0) {\n            // preserve leap years using a full 400 year cycle, then reset\n            date = new Date(y + 400, m, d, h, M, s, ms);\n            if (isFinite(date.getFullYear())) {\n                date.setFullYear(y);\n            }\n        } else {\n            date = new Date(y, m, d, h, M, s, ms);\n        }\n\n        return date;\n    }\n\n    function createUTCDate(y) {\n        var date, args;\n        // the Date.UTC function remaps years 0-99 to 1900-1999\n        if (y < 100 && y >= 0) {\n            args = Array.prototype.slice.call(arguments);\n            // preserve leap years using a full 400 year cycle, then reset\n            args[0] = y + 400;\n            date = new Date(Date.UTC.apply(null, args));\n            if (isFinite(date.getUTCFullYear())) {\n                date.setUTCFullYear(y);\n            }\n        } else {\n            date = new Date(Date.UTC.apply(null, arguments));\n        }\n\n        return date;\n    }\n\n    // start-of-first-week - start-of-year\n    function firstWeekOffset(year, dow, doy) {\n        var // first-week day -- which january is always in the first week (4 for iso, 1 for other)\n            fwd = 7 + dow - doy,\n            // first-week day local weekday -- which local weekday is fwd\n            fwdlw = (7 + createUTCDate(year, 0, fwd).getUTCDay() - dow) % 7;\n\n        return -fwdlw + fwd - 1;\n    }\n\n    // https://en.wikipedia.org/wiki/ISO_week_date#Calculating_a_date_given_the_year.2C_week_number_and_weekday\n    function dayOfYearFromWeeks(year, week, weekday, dow, doy) {\n        var localWeekday = (7 + weekday - dow) % 7,\n            weekOffset = firstWeekOffset(year, dow, doy),\n            dayOfYear = 1 + 7 * (week - 1) + localWeekday + weekOffset,\n            resYear,\n            resDayOfYear;\n\n        if (dayOfYear <= 0) {\n            resYear = year - 1;\n            resDayOfYear = daysInYear(resYear) + dayOfYear;\n        } else if (dayOfYear > daysInYear(year)) {\n            resYear = year + 1;\n            resDayOfYear = dayOfYear - daysInYear(year);\n        } else {\n            resYear = year;\n            resDayOfYear = dayOfYear;\n        }\n\n        return {\n            year: resYear,\n            dayOfYear: resDayOfYear,\n        };\n    }\n\n    function weekOfYear(mom, dow, doy) {\n        var weekOffset = firstWeekOffset(mom.year(), dow, doy),\n            week = Math.floor((mom.dayOfYear() - weekOffset - 1) / 7) + 1,\n            resWeek,\n            resYear;\n\n        if (week < 1) {\n            resYear = mom.year() - 1;\n            resWeek = week + weeksInYear(resYear, dow, doy);\n        } else if (week > weeksInYear(mom.year(), dow, doy)) {\n            resWeek = week - weeksInYear(mom.year(), dow, doy);\n            resYear = mom.year() + 1;\n        } else {\n            resYear = mom.year();\n            resWeek = week;\n        }\n\n        return {\n            week: resWeek,\n            year: resYear,\n        };\n    }\n\n    function weeksInYear(year, dow, doy) {\n        var weekOffset = firstWeekOffset(year, dow, doy),\n            weekOffsetNext = firstWeekOffset(year + 1, dow, doy);\n        return (daysInYear(year) - weekOffset + weekOffsetNext) / 7;\n    }\n\n    // FORMATTING\n\n    addFormatToken('w', ['ww', 2], 'wo', 'week');\n    addFormatToken('W', ['WW', 2], 'Wo', 'isoWeek');\n\n    // PARSING\n\n    addRegexToken('w', match1to2, match1to2NoLeadingZero);\n    addRegexToken('ww', match1to2, match2);\n    addRegexToken('W', match1to2, match1to2NoLeadingZero);\n    addRegexToken('WW', match1to2, match2);\n\n    addWeekParseToken(\n        ['w', 'ww', 'W', 'WW'],\n        function (input, week, config, token) {\n            week[token.substr(0, 1)] = toInt(input);\n        }\n    );\n\n    // HELPERS\n\n    // LOCALES\n\n    function localeWeek(mom) {\n        return weekOfYear(mom, this._week.dow, this._week.doy).week;\n    }\n\n    var defaultLocaleWeek = {\n        dow: 0, // Sunday is the first day of the week.\n        doy: 6, // The week that contains Jan 6th is the first week of the year.\n    };\n\n    function localeFirstDayOfWeek() {\n        return this._week.dow;\n    }\n\n    function localeFirstDayOfYear() {\n        return this._week.doy;\n    }\n\n    // MOMENTS\n\n    function getSetWeek(input) {\n        var week = this.localeData().week(this);\n        return input == null ? week : this.add((input - week) * 7, 'd');\n    }\n\n    function getSetISOWeek(input) {\n        var week = weekOfYear(this, 1, 4).week;\n        return input == null ? week : this.add((input - week) * 7, 'd');\n    }\n\n    // FORMATTING\n\n    addFormatToken('d', 0, 'do', 'day');\n\n    addFormatToken('dd', 0, 0, function (format) {\n        return this.localeData().weekdaysMin(this, format);\n    });\n\n    addFormatToken('ddd', 0, 0, function (format) {\n        return this.localeData().weekdaysShort(this, format);\n    });\n\n    addFormatToken('dddd', 0, 0, function (format) {\n        return this.localeData().weekdays(this, format);\n    });\n\n    addFormatToken('e', 0, 0, 'weekday');\n    addFormatToken('E', 0, 0, 'isoWeekday');\n\n    // PARSING\n\n    addRegexToken('d', match1to2);\n    addRegexToken('e', match1to2);\n    addRegexToken('E', match1to2);\n    addRegexToken('dd', function (isStrict, locale) {\n        return locale.weekdaysMinRegex(isStrict);\n    });\n    addRegexToken('ddd', function (isStrict, locale) {\n        return locale.weekdaysShortRegex(isStrict);\n    });\n    addRegexToken('dddd', function (isStrict, locale) {\n        return locale.weekdaysRegex(isStrict);\n    });\n\n    addWeekParseToken(['dd', 'ddd', 'dddd'], function (input, week, config, token) {\n        var weekday = config._locale.weekdaysParse(input, token, config._strict);\n        // if we didn't get a weekday name, mark the date as invalid\n        if (weekday != null) {\n            week.d = weekday;\n        } else {\n            getParsingFlags(config).invalidWeekday = input;\n        }\n    });\n\n    addWeekParseToken(['d', 'e', 'E'], function (input, week, config, token) {\n        week[token] = toInt(input);\n    });\n\n    // HELPERS\n\n    function parseWeekday(input, locale) {\n        if (typeof input !== 'string') {\n            return input;\n        }\n\n        if (!isNaN(input)) {\n            return parseInt(input, 10);\n        }\n\n        input = locale.weekdaysParse(input);\n        if (typeof input === 'number') {\n            return input;\n        }\n\n        return null;\n    }\n\n    function parseIsoWeekday(input, locale) {\n        if (typeof input === 'string') {\n            return locale.weekdaysParse(input) % 7 || 7;\n        }\n        return isNaN(input) ? null : input;\n    }\n\n    // LOCALES\n    function shiftWeekdays(ws, n) {\n        return ws.slice(n, 7).concat(ws.slice(0, n));\n    }\n\n    var defaultLocaleWeekdays =\n            'Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday'.split('_'),\n        defaultLocaleWeekdaysShort = 'Sun_Mon_Tue_Wed_Thu_Fri_Sat'.split('_'),\n        defaultLocaleWeekdaysMin = 'Su_Mo_Tu_We_Th_Fr_Sa'.split('_'),\n        defaultWeekdaysRegex = matchWord,\n        defaultWeekdaysShortRegex = matchWord,\n        defaultWeekdaysMinRegex = matchWord;\n\n    function localeWeekdays(m, format) {\n        var weekdays = isArray(this._weekdays)\n            ? this._weekdays\n            : this._weekdays[\n                  m && m !== true && this._weekdays.isFormat.test(format)\n                      ? 'format'\n                      : 'standalone'\n              ];\n        return m === true\n            ? shiftWeekdays(weekdays, this._week.dow)\n            : m\n              ? weekdays[m.day()]\n              : weekdays;\n    }\n\n    function localeWeekdaysShort(m) {\n        return m === true\n            ? shiftWeekdays(this._weekdaysShort, this._week.dow)\n            : m\n              ? this._weekdaysShort[m.day()]\n              : this._weekdaysShort;\n    }\n\n    function localeWeekdaysMin(m) {\n        return m === true\n            ? shiftWeekdays(this._weekdaysMin, this._week.dow)\n            : m\n              ? this._weekdaysMin[m.day()]\n              : this._weekdaysMin;\n    }\n\n    function handleStrictParse$1(weekdayName, format, strict) {\n        var i,\n            ii,\n            mom,\n            llc = weekdayName.toLocaleLowerCase();\n        if (!this._weekdaysParse) {\n            this._weekdaysParse = [];\n            this._shortWeekdaysParse = [];\n            this._minWeekdaysParse = [];\n\n            for (i = 0; i < 7; ++i) {\n                mom = createUTC([2000, 1]).day(i);\n                this._minWeekdaysParse[i] = this.weekdaysMin(\n                    mom,\n                    ''\n                ).toLocaleLowerCase();\n                this._shortWeekdaysParse[i] = this.weekdaysShort(\n                    mom,\n                    ''\n                ).toLocaleLowerCase();\n                this._weekdaysParse[i] = this.weekdays(mom, '').toLocaleLowerCase();\n            }\n        }\n\n        if (strict) {\n            if (format === 'dddd') {\n                ii = indexOf.call(this._weekdaysParse, llc);\n                return ii !== -1 ? ii : null;\n            } else if (format === 'ddd') {\n                ii = indexOf.call(this._shortWeekdaysParse, llc);\n                return ii !== -1 ? ii : null;\n            } else {\n                ii = indexOf.call(this._minWeekdaysParse, llc);\n                return ii !== -1 ? ii : null;\n            }\n        } else {\n            if (format === 'dddd') {\n                ii = indexOf.call(this._weekdaysParse, llc);\n                if (ii !== -1) {\n                    return ii;\n                }\n                ii = indexOf.call(this._shortWeekdaysParse, llc);\n                if (ii !== -1) {\n                    return ii;\n                }\n                ii = indexOf.call(this._minWeekdaysParse, llc);\n                return ii !== -1 ? ii : null;\n            } else if (format === 'ddd') {\n                ii = indexOf.call(this._shortWeekdaysParse, llc);\n                if (ii !== -1) {\n                    return ii;\n                }\n                ii = indexOf.call(this._weekdaysParse, llc);\n                if (ii !== -1) {\n                    return ii;\n                }\n                ii = indexOf.call(this._minWeekdaysParse, llc);\n                return ii !== -1 ? ii : null;\n            } else {\n                ii = indexOf.call(this._minWeekdaysParse, llc);\n                if (ii !== -1) {\n                    return ii;\n                }\n                ii = indexOf.call(this._weekdaysParse, llc);\n                if (ii !== -1) {\n                    return ii;\n                }\n                ii = indexOf.call(this._shortWeekdaysParse, llc);\n                return ii !== -1 ? ii : null;\n            }\n        }\n    }\n\n    function localeWeekdaysParse(weekdayName, format, strict) {\n        var i, mom, regex;\n\n        if (this._weekdaysParseExact) {\n            return handleStrictParse$1.call(this, weekdayName, format, strict);\n        }\n\n        if (!this._weekdaysParse) {\n            this._weekdaysParse = [];\n            this._minWeekdaysParse = [];\n            this._shortWeekdaysParse = [];\n            this._fullWeekdaysParse = [];\n        }\n\n        for (i = 0; i < 7; i++) {\n            // make the regex if we don't have it already\n\n            mom = createUTC([2000, 1]).day(i);\n            if (strict && !this._fullWeekdaysParse[i]) {\n                this._fullWeekdaysParse[i] = new RegExp(\n                    '^' + this.weekdays(mom, '').replace('.', '\\\\.?') + '$',\n                    'i'\n                );\n                this._shortWeekdaysParse[i] = new RegExp(\n                    '^' + this.weekdaysShort(mom, '').replace('.', '\\\\.?') + '$',\n                    'i'\n                );\n                this._minWeekdaysParse[i] = new RegExp(\n                    '^' + this.weekdaysMin(mom, '').replace('.', '\\\\.?') + '$',\n                    'i'\n                );\n            }\n            if (!this._weekdaysParse[i]) {\n                regex =\n                    '^' +\n                    this.weekdays(mom, '') +\n                    '|^' +\n                    this.weekdaysShort(mom, '') +\n                    '|^' +\n                    this.weekdaysMin(mom, '');\n                this._weekdaysParse[i] = new RegExp(regex.replace('.', ''), 'i');\n            }\n            // test the regex\n            if (\n                strict &&\n                format === 'dddd' &&\n                this._fullWeekdaysParse[i].test(weekdayName)\n            ) {\n                return i;\n            } else if (\n                strict &&\n                format === 'ddd' &&\n                this._shortWeekdaysParse[i].test(weekdayName)\n            ) {\n                return i;\n            } else if (\n                strict &&\n                format === 'dd' &&\n                this._minWeekdaysParse[i].test(weekdayName)\n            ) {\n                return i;\n            } else if (!strict && this._weekdaysParse[i].test(weekdayName)) {\n                return i;\n            }\n        }\n    }\n\n    // MOMENTS\n\n    function getSetDayOfWeek(input) {\n        if (!this.isValid()) {\n            return input != null ? this : NaN;\n        }\n\n        var day = get(this, 'Day');\n        if (input != null) {\n            input = parseWeekday(input, this.localeData());\n            return this.add(input - day, 'd');\n        } else {\n            return day;\n        }\n    }\n\n    function getSetLocaleDayOfWeek(input) {\n        if (!this.isValid()) {\n            return input != null ? this : NaN;\n        }\n        var weekday = (this.day() + 7 - this.localeData()._week.dow) % 7;\n        return input == null ? weekday : this.add(input - weekday, 'd');\n    }\n\n    function getSetISODayOfWeek(input) {\n        if (!this.isValid()) {\n            return input != null ? this : NaN;\n        }\n\n        // behaves the same as moment#day except\n        // as a getter, returns 7 instead of 0 (1-7 range instead of 0-6)\n        // as a setter, sunday should belong to the previous week.\n\n        if (input != null) {\n            var weekday = parseIsoWeekday(input, this.localeData());\n            return this.day(this.day() % 7 ? weekday : weekday - 7);\n        } else {\n            return this.day() || 7;\n        }\n    }\n\n    function weekdaysRegex(isStrict) {\n        if (this._weekdaysParseExact) {\n            if (!hasOwnProp(this, '_weekdaysRegex')) {\n                computeWeekdaysParse.call(this);\n            }\n            if (isStrict) {\n                return this._weekdaysStrictRegex;\n            } else {\n                return this._weekdaysRegex;\n            }\n        } else {\n            if (!hasOwnProp(this, '_weekdaysRegex')) {\n                this._weekdaysRegex = defaultWeekdaysRegex;\n            }\n            return this._weekdaysStrictRegex && isStrict\n                ? this._weekdaysStrictRegex\n                : this._weekdaysRegex;\n        }\n    }\n\n    function weekdaysShortRegex(isStrict) {\n        if (this._weekdaysParseExact) {\n            if (!hasOwnProp(this, '_weekdaysRegex')) {\n                computeWeekdaysParse.call(this);\n            }\n            if (isStrict) {\n                return this._weekdaysShortStrictRegex;\n            } else {\n                return this._weekdaysShortRegex;\n            }\n        } else {\n            if (!hasOwnProp(this, '_weekdaysShortRegex')) {\n                this._weekdaysShortRegex = defaultWeekdaysShortRegex;\n            }\n            return this._weekdaysShortStrictRegex && isStrict\n                ? this._weekdaysShortStrictRegex\n                : this._weekdaysShortRegex;\n        }\n    }\n\n    function weekdaysMinRegex(isStrict) {\n        if (this._weekdaysParseExact) {\n            if (!hasOwnProp(this, '_weekdaysRegex')) {\n                computeWeekdaysParse.call(this);\n            }\n            if (isStrict) {\n                return this._weekdaysMinStrictRegex;\n            } else {\n                return this._weekdaysMinRegex;\n            }\n        } else {\n            if (!hasOwnProp(this, '_weekdaysMinRegex')) {\n                this._weekdaysMinRegex = defaultWeekdaysMinRegex;\n            }\n            return this._weekdaysMinStrictRegex && isStrict\n                ? this._weekdaysMinStrictRegex\n                : this._weekdaysMinRegex;\n        }\n    }\n\n    function computeWeekdaysParse() {\n        function cmpLenRev(a, b) {\n            return b.length - a.length;\n        }\n\n        var minPieces = [],\n            shortPieces = [],\n            longPieces = [],\n            mixedPieces = [],\n            i,\n            mom,\n            minp,\n            shortp,\n            longp;\n        for (i = 0; i < 7; i++) {\n            // make the regex if we don't have it already\n            mom = createUTC([2000, 1]).day(i);\n            minp = regexEscape(this.weekdaysMin(mom, ''));\n            shortp = regexEscape(this.weekdaysShort(mom, ''));\n            longp = regexEscape(this.weekdays(mom, ''));\n            minPieces.push(minp);\n            shortPieces.push(shortp);\n            longPieces.push(longp);\n            mixedPieces.push(minp);\n            mixedPieces.push(shortp);\n            mixedPieces.push(longp);\n        }\n        // Sorting makes sure if one weekday (or abbr) is a prefix of another it\n        // will match the longer piece.\n        minPieces.sort(cmpLenRev);\n        shortPieces.sort(cmpLenRev);\n        longPieces.sort(cmpLenRev);\n        mixedPieces.sort(cmpLenRev);\n\n        this._weekdaysRegex = new RegExp('^(' + mixedPieces.join('|') + ')', 'i');\n        this._weekdaysShortRegex = this._weekdaysRegex;\n        this._weekdaysMinRegex = this._weekdaysRegex;\n\n        this._weekdaysStrictRegex = new RegExp(\n            '^(' + longPieces.join('|') + ')',\n            'i'\n        );\n        this._weekdaysShortStrictRegex = new RegExp(\n            '^(' + shortPieces.join('|') + ')',\n            'i'\n        );\n        this._weekdaysMinStrictRegex = new RegExp(\n            '^(' + minPieces.join('|') + ')',\n            'i'\n        );\n    }\n\n    // FORMATTING\n\n    function hFormat() {\n        return this.hours() % 12 || 12;\n    }\n\n    function kFormat() {\n        return this.hours() || 24;\n    }\n\n    addFormatToken('H', ['HH', 2], 0, 'hour');\n    addFormatToken('h', ['hh', 2], 0, hFormat);\n    addFormatToken('k', ['kk', 2], 0, kFormat);\n\n    addFormatToken('hmm', 0, 0, function () {\n        return '' + hFormat.apply(this) + zeroFill(this.minutes(), 2);\n    });\n\n    addFormatToken('hmmss', 0, 0, function () {\n        return (\n            '' +\n            hFormat.apply(this) +\n            zeroFill(this.minutes(), 2) +\n            zeroFill(this.seconds(), 2)\n        );\n    });\n\n    addFormatToken('Hmm', 0, 0, function () {\n        return '' + this.hours() + zeroFill(this.minutes(), 2);\n    });\n\n    addFormatToken('Hmmss', 0, 0, function () {\n        return (\n            '' +\n            this.hours() +\n            zeroFill(this.minutes(), 2) +\n            zeroFill(this.seconds(), 2)\n        );\n    });\n\n    function meridiem(token, lowercase) {\n        addFormatToken(token, 0, 0, function () {\n            return this.localeData().meridiem(\n                this.hours(),\n                this.minutes(),\n                lowercase\n            );\n        });\n    }\n\n    meridiem('a', true);\n    meridiem('A', false);\n\n    // PARSING\n\n    function matchMeridiem(isStrict, locale) {\n        return locale._meridiemParse;\n    }\n\n    addRegexToken('a', matchMeridiem);\n    addRegexToken('A', matchMeridiem);\n    addRegexToken('H', match1to2, match1to2HasZero);\n    addRegexToken('h', match1to2, match1to2NoLeadingZero);\n    addRegexToken('k', match1to2, match1to2NoLeadingZero);\n    addRegexToken('HH', match1to2, match2);\n    addRegexToken('hh', match1to2, match2);\n    addRegexToken('kk', match1to2, match2);\n\n    addRegexToken('hmm', match3to4);\n    addRegexToken('hmmss', match5to6);\n    addRegexToken('Hmm', match3to4);\n    addRegexToken('Hmmss', match5to6);\n\n    addParseToken(['H', 'HH'], HOUR);\n    addParseToken(['k', 'kk'], function (input, array, config) {\n        var kInput = toInt(input);\n        array[HOUR] = kInput === 24 ? 0 : kInput;\n    });\n    addParseToken(['a', 'A'], function (input, array, config) {\n        config._isPm = config._locale.isPM(input);\n        config._meridiem = input;\n    });\n    addParseToken(['h', 'hh'], function (input, array, config) {\n        array[HOUR] = toInt(input);\n        getParsingFlags(config).bigHour = true;\n    });\n    addParseToken('hmm', function (input, array, config) {\n        var pos = input.length - 2;\n        array[HOUR] = toInt(input.substr(0, pos));\n        array[MINUTE] = toInt(input.substr(pos));\n        getParsingFlags(config).bigHour = true;\n    });\n    addParseToken('hmmss', function (input, array, config) {\n        var pos1 = input.length - 4,\n            pos2 = input.length - 2;\n        array[HOUR] = toInt(input.substr(0, pos1));\n        array[MINUTE] = toInt(input.substr(pos1, 2));\n        array[SECOND] = toInt(input.substr(pos2));\n        getParsingFlags(config).bigHour = true;\n    });\n    addParseToken('Hmm', function (input, array, config) {\n        var pos = input.length - 2;\n        array[HOUR] = toInt(input.substr(0, pos));\n        array[MINUTE] = toInt(input.substr(pos));\n    });\n    addParseToken('Hmmss', function (input, array, config) {\n        var pos1 = input.length - 4,\n            pos2 = input.length - 2;\n        array[HOUR] = toInt(input.substr(0, pos1));\n        array[MINUTE] = toInt(input.substr(pos1, 2));\n        array[SECOND] = toInt(input.substr(pos2));\n    });\n\n    // LOCALES\n\n    function localeIsPM(input) {\n        // IE8 Quirks Mode & IE7 Standards Mode do not allow accessing strings like arrays\n        // Using charAt should be more compatible.\n        return (input + '').toLowerCase().charAt(0) === 'p';\n    }\n\n    var defaultLocaleMeridiemParse = /[ap]\\.?m?\\.?/i,\n        // Setting the hour should keep the time, because the user explicitly\n        // specified which hour they want. So trying to maintain the same hour (in\n        // a new timezone) makes sense. Adding/subtracting hours does not follow\n        // this rule.\n        getSetHour = makeGetSet('Hours', true);\n\n    function localeMeridiem(hours, minutes, isLower) {\n        if (hours > 11) {\n            return isLower ? 'pm' : 'PM';\n        } else {\n            return isLower ? 'am' : 'AM';\n        }\n    }\n\n    var baseConfig = {\n        calendar: defaultCalendar,\n        longDateFormat: defaultLongDateFormat,\n        invalidDate: defaultInvalidDate,\n        ordinal: defaultOrdinal,\n        dayOfMonthOrdinalParse: defaultDayOfMonthOrdinalParse,\n        relativeTime: defaultRelativeTime,\n\n        months: defaultLocaleMonths,\n        monthsShort: defaultLocaleMonthsShort,\n\n        week: defaultLocaleWeek,\n\n        weekdays: defaultLocaleWeekdays,\n        weekdaysMin: defaultLocaleWeekdaysMin,\n        weekdaysShort: defaultLocaleWeekdaysShort,\n\n        meridiemParse: defaultLocaleMeridiemParse,\n    };\n\n    // internal storage for locale config files\n    var locales = {},\n        localeFamilies = {},\n        globalLocale;\n\n    function commonPrefix(arr1, arr2) {\n        var i,\n            minl = Math.min(arr1.length, arr2.length);\n        for (i = 0; i < minl; i += 1) {\n            if (arr1[i] !== arr2[i]) {\n                return i;\n            }\n        }\n        return minl;\n    }\n\n    function normalizeLocale(key) {\n        return key ? key.toLowerCase().replace('_', '-') : key;\n    }\n\n    // pick the locale from the array\n    // try ['en-au', 'en-gb'] as 'en-au', 'en-gb', 'en', as in move through the list trying each\n    // substring from most specific to least, but move to the next array item if it's a more specific variant than the current root\n    function chooseLocale(names) {\n        var i = 0,\n            j,\n            next,\n            locale,\n            split;\n\n        while (i < names.length) {\n            split = normalizeLocale(names[i]).split('-');\n            j = split.length;\n            next = normalizeLocale(names[i + 1]);\n            next = next ? next.split('-') : null;\n            while (j > 0) {\n                locale = loadLocale(split.slice(0, j).join('-'));\n                if (locale) {\n                    return locale;\n                }\n                if (\n                    next &&\n                    next.length >= j &&\n                    commonPrefix(split, next) >= j - 1\n                ) {\n                    //the next array item is better than a shallower substring of this one\n                    break;\n                }\n                j--;\n            }\n            i++;\n        }\n        return globalLocale;\n    }\n\n    function isLocaleNameSane(name) {\n        // Prevent names that look like filesystem paths, i.e contain '/' or '\\'\n        // Ensure name is available and function returns boolean\n        return !!(name && name.match('^[^/\\\\\\\\]*$'));\n    }\n\n    function loadLocale(name) {\n        var oldLocale = null,\n            aliasedRequire;\n        // TODO: Find a better way to register and load all the locales in Node\n        if (\n            locales[name] === undefined &&\n            typeof module !== 'undefined' &&\n            module &&\n            module.exports &&\n            isLocaleNameSane(name)\n        ) {\n            try {\n                oldLocale = globalLocale._abbr;\n                aliasedRequire = require;\n                aliasedRequire('./locale/' + name);\n                getSetGlobalLocale(oldLocale);\n            } catch (e) {\n                // mark as not found to avoid repeating expensive file require call causing high CPU\n                // when trying to find en-US, en_US, en-us for every format call\n                locales[name] = null; // null means not found\n            }\n        }\n        return locales[name];\n    }\n\n    // This function will load locale and then set the global locale.  If\n    // no arguments are passed in, it will simply return the current global\n    // locale key.\n    function getSetGlobalLocale(key, values) {\n        var data;\n        if (key) {\n            if (isUndefined(values)) {\n                data = getLocale(key);\n            } else {\n                data = defineLocale(key, values);\n            }\n\n            if (data) {\n                // moment.duration._locale = moment._locale = data;\n                globalLocale = data;\n            } else {\n                if (typeof console !== 'undefined' && console.warn) {\n                    //warn user if arguments are passed but the locale could not be set\n                    console.warn(\n                        'Locale ' + key + ' not found. Did you forget to load it?'\n                    );\n                }\n            }\n        }\n\n        return globalLocale._abbr;\n    }\n\n    function defineLocale(name, config) {\n        if (config !== null) {\n            var locale,\n                parentConfig = baseConfig;\n            config.abbr = name;\n            if (locales[name] != null) {\n                deprecateSimple(\n                    'defineLocaleOverride',\n                    'use moment.updateLocale(localeName, config) to change ' +\n                        'an existing locale. moment.defineLocale(localeName, ' +\n                        'config) should only be used for creating a new locale ' +\n                        'See http://momentjs.com/guides/#/warnings/define-locale/ for more info.'\n                );\n                parentConfig = locales[name]._config;\n            } else if (config.parentLocale != null) {\n                if (locales[config.parentLocale] != null) {\n                    parentConfig = locales[config.parentLocale]._config;\n                } else {\n                    locale = loadLocale(config.parentLocale);\n                    if (locale != null) {\n                        parentConfig = locale._config;\n                    } else {\n                        if (!localeFamilies[config.parentLocale]) {\n                            localeFamilies[config.parentLocale] = [];\n                        }\n                        localeFamilies[config.parentLocale].push({\n                            name: name,\n                            config: config,\n                        });\n                        return null;\n                    }\n                }\n            }\n            locales[name] = new Locale(mergeConfigs(parentConfig, config));\n\n            if (localeFamilies[name]) {\n                localeFamilies[name].forEach(function (x) {\n                    defineLocale(x.name, x.config);\n                });\n            }\n\n            // backwards compat for now: also set the locale\n            // make sure we set the locale AFTER all child locales have been\n            // created, so we won't end up with the child locale set.\n            getSetGlobalLocale(name);\n\n            return locales[name];\n        } else {\n            // useful for testing\n            delete locales[name];\n            return null;\n        }\n    }\n\n    function updateLocale(name, config) {\n        if (config != null) {\n            var locale,\n                tmpLocale,\n                parentConfig = baseConfig;\n\n            if (locales[name] != null && locales[name].parentLocale != null) {\n                // Update existing child locale in-place to avoid memory-leaks\n                locales[name].set(mergeConfigs(locales[name]._config, config));\n            } else {\n                // MERGE\n                tmpLocale = loadLocale(name);\n                if (tmpLocale != null) {\n                    parentConfig = tmpLocale._config;\n                }\n                config = mergeConfigs(parentConfig, config);\n                if (tmpLocale == null) {\n                    // updateLocale is called for creating a new locale\n                    // Set abbr so it will have a name (getters return\n                    // undefined otherwise).\n                    config.abbr = name;\n                }\n                locale = new Locale(config);\n                locale.parentLocale = locales[name];\n                locales[name] = locale;\n            }\n\n            // backwards compat for now: also set the locale\n            getSetGlobalLocale(name);\n        } else {\n            // pass null for config to unupdate, useful for tests\n            if (locales[name] != null) {\n                if (locales[name].parentLocale != null) {\n                    locales[name] = locales[name].parentLocale;\n                    if (name === getSetGlobalLocale()) {\n                        getSetGlobalLocale(name);\n                    }\n                } else if (locales[name] != null) {\n                    delete locales[name];\n                }\n            }\n        }\n        return locales[name];\n    }\n\n    // returns locale data\n    function getLocale(key) {\n        var locale;\n\n        if (key && key._locale && key._locale._abbr) {\n            key = key._locale._abbr;\n        }\n\n        if (!key) {\n            return globalLocale;\n        }\n\n        if (!isArray(key)) {\n            //short-circuit everything else\n            locale = loadLocale(key);\n            if (locale) {\n                return locale;\n            }\n            key = [key];\n        }\n\n        return chooseLocale(key);\n    }\n\n    function listLocales() {\n        return keys(locales);\n    }\n\n    function checkOverflow(m) {\n        var overflow,\n            a = m._a;\n\n        if (a && getParsingFlags(m).overflow === -2) {\n            overflow =\n                a[MONTH] < 0 || a[MONTH] > 11\n                    ? MONTH\n                    : a[DATE] < 1 || a[DATE] > daysInMonth(a[YEAR], a[MONTH])\n                      ? DATE\n                      : a[HOUR] < 0 ||\n                          a[HOUR] > 24 ||\n                          (a[HOUR] === 24 &&\n                              (a[MINUTE] !== 0 ||\n                                  a[SECOND] !== 0 ||\n                                  a[MILLISECOND] !== 0))\n                        ? HOUR\n                        : a[MINUTE] < 0 || a[MINUTE] > 59\n                          ? MINUTE\n                          : a[SECOND] < 0 || a[SECOND] > 59\n                            ? SECOND\n                            : a[MILLISECOND] < 0 || a[MILLISECOND] > 999\n                              ? MILLISECOND\n                              : -1;\n\n            if (\n                getParsingFlags(m)._overflowDayOfYear &&\n                (overflow < YEAR || overflow > DATE)\n            ) {\n                overflow = DATE;\n            }\n            if (getParsingFlags(m)._overflowWeeks && overflow === -1) {\n                overflow = WEEK;\n            }\n            if (getParsingFlags(m)._overflowWeekday && overflow === -1) {\n                overflow = WEEKDAY;\n            }\n\n            getParsingFlags(m).overflow = overflow;\n        }\n\n        return m;\n    }\n\n    // iso 8601 regex\n    // 0000-00-00 0000-W00 or 0000-W00-0 + T + 00 or 00:00 or 00:00:00 or 00:00:00.000 + +00:00 or +0000 or +00)\n    var extendedIsoRegex =\n            /^\\s*((?:[+-]\\d{6}|\\d{4})-(?:\\d\\d-\\d\\d|W\\d\\d-\\d|W\\d\\d|\\d\\d\\d|\\d\\d))(?:(T| )(\\d\\d(?::\\d\\d(?::\\d\\d(?:[.,]\\d+)?)?)?)([+-]\\d\\d(?::?\\d\\d)?|\\s*Z)?)?$/,\n        basicIsoRegex =\n            /^\\s*((?:[+-]\\d{6}|\\d{4})(?:\\d\\d\\d\\d|W\\d\\d\\d|W\\d\\d|\\d\\d\\d|\\d\\d|))(?:(T| )(\\d\\d(?:\\d\\d(?:\\d\\d(?:[.,]\\d+)?)?)?)([+-]\\d\\d(?::?\\d\\d)?|\\s*Z)?)?$/,\n        tzRegex = /Z|[+-]\\d\\d(?::?\\d\\d)?/,\n        isoDates = [\n            ['YYYYYY-MM-DD', /[+-]\\d{6}-\\d\\d-\\d\\d/],\n            ['YYYY-MM-DD', /\\d{4}-\\d\\d-\\d\\d/],\n            ['GGGG-[W]WW-E', /\\d{4}-W\\d\\d-\\d/],\n            ['GGGG-[W]WW', /\\d{4}-W\\d\\d/, false],\n            ['YYYY-DDD', /\\d{4}-\\d{3}/],\n            ['YYYY-MM', /\\d{4}-\\d\\d/, false],\n            ['YYYYYYMMDD', /[+-]\\d{10}/],\n            ['YYYYMMDD', /\\d{8}/],\n            ['GGGG[W]WWE', /\\d{4}W\\d{3}/],\n            ['GGGG[W]WW', /\\d{4}W\\d{2}/, false],\n            ['YYYYDDD', /\\d{7}/],\n            ['YYYYMM', /\\d{6}/, false],\n            ['YYYY', /\\d{4}/, false],\n        ],\n        // iso time formats and regexes\n        isoTimes = [\n            ['HH:mm:ss.SSSS', /\\d\\d:\\d\\d:\\d\\d\\.\\d+/],\n            ['HH:mm:ss,SSSS', /\\d\\d:\\d\\d:\\d\\d,\\d+/],\n            ['HH:mm:ss', /\\d\\d:\\d\\d:\\d\\d/],\n            ['HH:mm', /\\d\\d:\\d\\d/],\n            ['HHmmss.SSSS', /\\d\\d\\d\\d\\d\\d\\.\\d+/],\n            ['HHmmss,SSSS', /\\d\\d\\d\\d\\d\\d,\\d+/],\n            ['HHmmss', /\\d\\d\\d\\d\\d\\d/],\n            ['HHmm', /\\d\\d\\d\\d/],\n            ['HH', /\\d\\d/],\n        ],\n        aspNetJsonRegex = /^\\/?Date\\((-?\\d+)/i,\n        // RFC 2822 regex: For details see https://tools.ietf.org/html/rfc2822#section-3.3\n        rfc2822 =\n            /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),?\\s)?(\\d{1,2})\\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\\s(\\d{2,4})\\s(\\d\\d):(\\d\\d)(?::(\\d\\d))?\\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|([+-]\\d{4}))$/,\n        obsOffsets = {\n            UT: 0,\n            GMT: 0,\n            EDT: -4 * 60,\n            EST: -5 * 60,\n            CDT: -5 * 60,\n            CST: -6 * 60,\n            MDT: -6 * 60,\n            MST: -7 * 60,\n            PDT: -7 * 60,\n            PST: -8 * 60,\n        };\n\n    // date from iso format\n    function configFromISO(config) {\n        var i,\n            l,\n            string = config._i,\n            match = extendedIsoRegex.exec(string) || basicIsoRegex.exec(string),\n            allowTime,\n            dateFormat,\n            timeFormat,\n            tzFormat,\n            isoDatesLen = isoDates.length,\n            isoTimesLen = isoTimes.length;\n\n        if (match) {\n            getParsingFlags(config).iso = true;\n            for (i = 0, l = isoDatesLen; i < l; i++) {\n                if (isoDates[i][1].exec(match[1])) {\n                    dateFormat = isoDates[i][0];\n                    allowTime = isoDates[i][2] !== false;\n                    break;\n                }\n            }\n            if (dateFormat == null) {\n                config._isValid = false;\n                return;\n            }\n            if (match[3]) {\n                for (i = 0, l = isoTimesLen; i < l; i++) {\n                    if (isoTimes[i][1].exec(match[3])) {\n                        // match[2] should be 'T' or space\n                        timeFormat = (match[2] || ' ') + isoTimes[i][0];\n                        break;\n                    }\n                }\n                if (timeFormat == null) {\n                    config._isValid = false;\n                    return;\n                }\n            }\n            if (!allowTime && timeFormat != null) {\n                config._isValid = false;\n                return;\n            }\n            if (match[4]) {\n                if (tzRegex.exec(match[4])) {\n                    tzFormat = 'Z';\n                } else {\n                    config._isValid = false;\n                    return;\n                }\n            }\n            config._f = dateFormat + (timeFormat || '') + (tzFormat || '');\n            configFromStringAndFormat(config);\n        } else {\n            config._isValid = false;\n        }\n    }\n\n    function extractFromRFC2822Strings(\n        yearStr,\n        monthStr,\n        dayStr,\n        hourStr,\n        minuteStr,\n        secondStr\n    ) {\n        var result = [\n            untruncateYear(yearStr),\n            defaultLocaleMonthsShort.indexOf(monthStr),\n            parseInt(dayStr, 10),\n            parseInt(hourStr, 10),\n            parseInt(minuteStr, 10),\n        ];\n\n        if (secondStr) {\n            result.push(parseInt(secondStr, 10));\n        }\n\n        return result;\n    }\n\n    function untruncateYear(yearStr) {\n        var year = parseInt(yearStr, 10);\n        if (year <= 49) {\n            return 2000 + year;\n        } else if (year <= 999) {\n            return 1900 + year;\n        }\n        return year;\n    }\n\n    function preprocessRFC2822(s) {\n        // Remove comments and folding whitespace and replace multiple-spaces with a single space\n        return s\n            .replace(/\\([^()]*\\)|[\\n\\t]/g, ' ')\n            .replace(/(\\s\\s+)/g, ' ')\n            .replace(/^\\s\\s*/, '')\n            .replace(/\\s\\s*$/, '');\n    }\n\n    function checkWeekday(weekdayStr, parsedInput, config) {\n        if (weekdayStr) {\n            // TODO: Replace the vanilla JS Date object with an independent day-of-week check.\n            var weekdayProvided = defaultLocaleWeekdaysShort.indexOf(weekdayStr),\n                weekdayActual = new Date(\n                    parsedInput[0],\n                    parsedInput[1],\n                    parsedInput[2]\n                ).getDay();\n            if (weekdayProvided !== weekdayActual) {\n                getParsingFlags(config).weekdayMismatch = true;\n                config._isValid = false;\n                return false;\n            }\n        }\n        return true;\n    }\n\n    function calculateOffset(obsOffset, militaryOffset, numOffset) {\n        if (obsOffset) {\n            return obsOffsets[obsOffset];\n        } else if (militaryOffset) {\n            // the only allowed military tz is Z\n            return 0;\n        } else {\n            var hm = parseInt(numOffset, 10),\n                m = hm % 100,\n                h = (hm - m) / 100;\n            return h * 60 + m;\n        }\n    }\n\n    // date and time from ref 2822 format\n    function configFromRFC2822(config) {\n        var match = rfc2822.exec(preprocessRFC2822(config._i)),\n            parsedArray;\n        if (match) {\n            parsedArray = extractFromRFC2822Strings(\n                match[4],\n                match[3],\n                match[2],\n                match[5],\n                match[6],\n                match[7]\n            );\n            if (!checkWeekday(match[1], parsedArray, config)) {\n                return;\n            }\n\n            config._a = parsedArray;\n            config._tzm = calculateOffset(match[8], match[9], match[10]);\n\n            config._d = createUTCDate.apply(null, config._a);\n            config._d.setUTCMinutes(config._d.getUTCMinutes() - config._tzm);\n\n            getParsingFlags(config).rfc2822 = true;\n        } else {\n            config._isValid = false;\n        }\n    }\n\n    // date from 1) ASP.NET, 2) ISO, 3) RFC 2822 formats, or 4) optional fallback if parsing isn't strict\n    function configFromString(config) {\n        var matched = aspNetJsonRegex.exec(config._i);\n        if (matched !== null) {\n            config._d = new Date(+matched[1]);\n            return;\n        }\n\n        configFromISO(config);\n        if (config._isValid === false) {\n            delete config._isValid;\n        } else {\n            return;\n        }\n\n        configFromRFC2822(config);\n        if (config._isValid === false) {\n            delete config._isValid;\n        } else {\n            return;\n        }\n\n        if (config._strict) {\n            config._isValid = false;\n        } else {\n            // Final attempt, use Input Fallback\n            hooks.createFromInputFallback(config);\n        }\n    }\n\n    hooks.createFromInputFallback = deprecate(\n        'value provided is not in a recognized RFC2822 or ISO format. moment construction falls back to js Date(), ' +\n            'which is not reliable across all browsers and versions. Non RFC2822/ISO date formats are ' +\n            'discouraged. Please refer to http://momentjs.com/guides/#/warnings/js-date/ for more info.',\n        function (config) {\n            config._d = new Date(config._i + (config._useUTC ? ' UTC' : ''));\n        }\n    );\n\n    // Pick the first defined of two or three arguments.\n    function defaults(a, b, c) {\n        if (a != null) {\n            return a;\n        }\n        if (b != null) {\n            return b;\n        }\n        return c;\n    }\n\n    function currentDateArray(config) {\n        // hooks is actually the exported moment object\n        var nowValue = new Date(hooks.now());\n        if (config._useUTC) {\n            return [\n                nowValue.getUTCFullYear(),\n                nowValue.getUTCMonth(),\n                nowValue.getUTCDate(),\n            ];\n        }\n        return [nowValue.getFullYear(), nowValue.getMonth(), nowValue.getDate()];\n    }\n\n    // convert an array to a date.\n    // the array should mirror the parameters below\n    // note: all values past the year are optional and will default to the lowest possible value.\n    // [year, month, day , hour, minute, second, millisecond]\n    function configFromArray(config) {\n        var i,\n            date,\n            input = [],\n            currentDate,\n            expectedWeekday,\n            yearToUse;\n\n        if (config._d) {\n            return;\n        }\n\n        currentDate = currentDateArray(config);\n\n        //compute day of the year from weeks and weekdays\n        if (config._w && config._a[DATE] == null && config._a[MONTH] == null) {\n            dayOfYearFromWeekInfo(config);\n        }\n\n        //if the day of the year is set, figure out what it is\n        if (config._dayOfYear != null) {\n            yearToUse = defaults(config._a[YEAR], currentDate[YEAR]);\n\n            if (\n                config._dayOfYear > daysInYear(yearToUse) ||\n                config._dayOfYear === 0\n            ) {\n                getParsingFlags(config)._overflowDayOfYear = true;\n            }\n\n            date = createUTCDate(yearToUse, 0, config._dayOfYear);\n            config._a[MONTH] = date.getUTCMonth();\n            config._a[DATE] = date.getUTCDate();\n        }\n\n        // Default to current date.\n        // * if no year, month, day of month are given, default to today\n        // * if day of month is given, default month and year\n        // * if month is given, default only year\n        // * if year is given, don't default anything\n        for (i = 0; i < 3 && config._a[i] == null; ++i) {\n            config._a[i] = input[i] = currentDate[i];\n        }\n\n        // Zero out whatever was not defaulted, including time\n        for (; i < 7; i++) {\n            config._a[i] = input[i] =\n                config._a[i] == null ? (i === 2 ? 1 : 0) : config._a[i];\n        }\n\n        // Check for 24:00:00.000\n        if (\n            config._a[HOUR] === 24 &&\n            config._a[MINUTE] === 0 &&\n            config._a[SECOND] === 0 &&\n            config._a[MILLISECOND] === 0\n        ) {\n            config._nextDay = true;\n            config._a[HOUR] = 0;\n        }\n\n        config._d = (config._useUTC ? createUTCDate : createDate).apply(\n            null,\n            input\n        );\n        expectedWeekday = config._useUTC\n            ? config._d.getUTCDay()\n            : config._d.getDay();\n\n        // Apply timezone offset from input. The actual utcOffset can be changed\n        // with parseZone.\n        if (config._tzm != null) {\n            config._d.setUTCMinutes(config._d.getUTCMinutes() - config._tzm);\n        }\n\n        if (config._nextDay) {\n            config._a[HOUR] = 24;\n        }\n\n        // check for mismatching day of week\n        if (\n            config._w &&\n            typeof config._w.d !== 'undefined' &&\n            config._w.d !== expectedWeekday\n        ) {\n            getParsingFlags(config).weekdayMismatch = true;\n        }\n    }\n\n    function dayOfYearFromWeekInfo(config) {\n        var w, weekYear, week, weekday, dow, doy, temp, weekdayOverflow, curWeek;\n\n        w = config._w;\n        if (w.GG != null || w.W != null || w.E != null) {\n            dow = 1;\n            doy = 4;\n\n            // TODO: We need to take the current isoWeekYear, but that depends on\n            // how we interpret now (local, utc, fixed offset). So create\n            // a now version of current config (take local/utc/offset flags, and\n            // create now).\n            weekYear = defaults(\n                w.GG,\n                config._a[YEAR],\n                weekOfYear(createLocal(), 1, 4).year\n            );\n            week = defaults(w.W, 1);\n            weekday = defaults(w.E, 1);\n            if (weekday < 1 || weekday > 7) {\n                weekdayOverflow = true;\n            }\n        } else {\n            dow = config._locale._week.dow;\n            doy = config._locale._week.doy;\n\n            curWeek = weekOfYear(createLocal(), dow, doy);\n\n            weekYear = defaults(w.gg, config._a[YEAR], curWeek.year);\n\n            // Default to current week.\n            week = defaults(w.w, curWeek.week);\n\n            if (w.d != null) {\n                // weekday -- low day numbers are considered next week\n                weekday = w.d;\n                if (weekday < 0 || weekday > 6) {\n                    weekdayOverflow = true;\n                }\n            } else if (w.e != null) {\n                // local weekday -- counting starts from beginning of week\n                weekday = w.e + dow;\n                if (w.e < 0 || w.e > 6) {\n                    weekdayOverflow = true;\n                }\n            } else {\n                // default to beginning of week\n                weekday = dow;\n            }\n        }\n        if (week < 1 || week > weeksInYear(weekYear, dow, doy)) {\n            getParsingFlags(config)._overflowWeeks = true;\n        } else if (weekdayOverflow != null) {\n            getParsingFlags(config)._overflowWeekday = true;\n        } else {\n            temp = dayOfYearFromWeeks(weekYear, week, weekday, dow, doy);\n            config._a[YEAR] = temp.year;\n            config._dayOfYear = temp.dayOfYear;\n        }\n    }\n\n    // constant that refers to the ISO standard\n    hooks.ISO_8601 = function () {};\n\n    // constant that refers to the RFC 2822 form\n    hooks.RFC_2822 = function () {};\n\n    // date from string and format string\n    function configFromStringAndFormat(config) {\n        // TODO: Move this to another part of the creation flow to prevent circular deps\n        if (config._f === hooks.ISO_8601) {\n            configFromISO(config);\n            return;\n        }\n        if (config._f === hooks.RFC_2822) {\n            configFromRFC2822(config);\n            return;\n        }\n        config._a = [];\n        getParsingFlags(config).empty = true;\n\n        // This array is used to make a Date, either with `new Date` or `Date.UTC`\n        var string = '' + config._i,\n            i,\n            parsedInput,\n            tokens,\n            token,\n            skipped,\n            stringLength = string.length,\n            totalParsedInputLength = 0,\n            era,\n            tokenLen;\n\n        tokens =\n            expandFormat(config._f, config._locale).match(formattingTokens) || [];\n        tokenLen = tokens.length;\n        for (i = 0; i < tokenLen; i++) {\n            token = tokens[i];\n            parsedInput = (string.match(getParseRegexForToken(token, config)) ||\n                [])[0];\n            if (parsedInput) {\n                skipped = string.substr(0, string.indexOf(parsedInput));\n                if (skipped.length > 0) {\n                    getParsingFlags(config).unusedInput.push(skipped);\n                }\n                string = string.slice(\n                    string.indexOf(parsedInput) + parsedInput.length\n                );\n                totalParsedInputLength += parsedInput.length;\n            }\n            // don't parse if it's not a known token\n            if (formatTokenFunctions[token]) {\n                if (parsedInput) {\n                    getParsingFlags(config).empty = false;\n                } else {\n                    getParsingFlags(config).unusedTokens.push(token);\n                }\n                addTimeToArrayFromToken(token, parsedInput, config);\n            } else if (config._strict && !parsedInput) {\n                getParsingFlags(config).unusedTokens.push(token);\n            }\n        }\n\n        // add remaining unparsed input length to the string\n        getParsingFlags(config).charsLeftOver =\n            stringLength - totalParsedInputLength;\n        if (string.length > 0) {\n            getParsingFlags(config).unusedInput.push(string);\n        }\n\n        // clear _12h flag if hour is <= 12\n        if (\n            config._a[HOUR] <= 12 &&\n            getParsingFlags(config).bigHour === true &&\n            config._a[HOUR] > 0\n        ) {\n            getParsingFlags(config).bigHour = undefined;\n        }\n\n        getParsingFlags(config).parsedDateParts = config._a.slice(0);\n        getParsingFlags(config).meridiem = config._meridiem;\n        // handle meridiem\n        config._a[HOUR] = meridiemFixWrap(\n            config._locale,\n            config._a[HOUR],\n            config._meridiem\n        );\n\n        // handle era\n        era = getParsingFlags(config).era;\n        if (era !== null) {\n            config._a[YEAR] = config._locale.erasConvertYear(era, config._a[YEAR]);\n        }\n\n        configFromArray(config);\n        checkOverflow(config);\n    }\n\n    function meridiemFixWrap(locale, hour, meridiem) {\n        var isPm;\n\n        if (meridiem == null) {\n            // nothing to do\n            return hour;\n        }\n        if (locale.meridiemHour != null) {\n            return locale.meridiemHour(hour, meridiem);\n        } else if (locale.isPM != null) {\n            // Fallback\n            isPm = locale.isPM(meridiem);\n            if (isPm && hour < 12) {\n                hour += 12;\n            }\n            if (!isPm && hour === 12) {\n                hour = 0;\n            }\n            return hour;\n        } else {\n            // this is not supposed to happen\n            return hour;\n        }\n    }\n\n    // date from string and array of format strings\n    function configFromStringAndArray(config) {\n        var tempConfig,\n            bestMoment,\n            scoreToBeat,\n            i,\n            currentScore,\n            validFormatFound,\n            bestFormatIsValid = false,\n            configfLen = config._f.length;\n\n        if (configfLen === 0) {\n            getParsingFlags(config).invalidFormat = true;\n            config._d = new Date(NaN);\n            return;\n        }\n\n        for (i = 0; i < configfLen; i++) {\n            currentScore = 0;\n            validFormatFound = false;\n            tempConfig = copyConfig({}, config);\n            if (config._useUTC != null) {\n                tempConfig._useUTC = config._useUTC;\n            }\n            tempConfig._f = config._f[i];\n            configFromStringAndFormat(tempConfig);\n\n            if (isValid(tempConfig)) {\n                validFormatFound = true;\n            }\n\n            // if there is any input that was not parsed add a penalty for that format\n            currentScore += getParsingFlags(tempConfig).charsLeftOver;\n\n            //or tokens\n            currentScore += getParsingFlags(tempConfig).unusedTokens.length * 10;\n\n            getParsingFlags(tempConfig).score = currentScore;\n\n            if (!bestFormatIsValid) {\n                if (\n                    scoreToBeat == null ||\n                    currentScore < scoreToBeat ||\n                    validFormatFound\n                ) {\n                    scoreToBeat = currentScore;\n                    bestMoment = tempConfig;\n                    if (validFormatFound) {\n                        bestFormatIsValid = true;\n                    }\n                }\n            } else {\n                if (currentScore < scoreToBeat) {\n                    scoreToBeat = currentScore;\n                    bestMoment = tempConfig;\n                }\n            }\n        }\n\n        extend(config, bestMoment || tempConfig);\n    }\n\n    function configFromObject(config) {\n        if (config._d) {\n            return;\n        }\n\n        var i = normalizeObjectUnits(config._i),\n            dayOrDate = i.day === undefined ? i.date : i.day;\n        config._a = map(\n            [i.year, i.month, dayOrDate, i.hour, i.minute, i.second, i.millisecond],\n            function (obj) {\n                return obj && parseInt(obj, 10);\n            }\n        );\n\n        configFromArray(config);\n    }\n\n    function createFromConfig(config) {\n        var res = new Moment(checkOverflow(prepareConfig(config)));\n        if (res._nextDay) {\n            // Adding is smart enough around DST\n            res.add(1, 'd');\n            res._nextDay = undefined;\n        }\n\n        return res;\n    }\n\n    function prepareConfig(config) {\n        var input = config._i,\n            format = config._f;\n\n        config._locale = config._locale || getLocale(config._l);\n\n        if (input === null || (format === undefined && input === '')) {\n            return createInvalid({ nullInput: true });\n        }\n\n        if (typeof input === 'string') {\n            config._i = input = config._locale.preparse(input);\n        }\n\n        if (isMoment(input)) {\n            return new Moment(checkOverflow(input));\n        } else if (isDate(input)) {\n            config._d = input;\n        } else if (isArray(format)) {\n            configFromStringAndArray(config);\n        } else if (format) {\n            configFromStringAndFormat(config);\n        } else {\n            configFromInput(config);\n        }\n\n        if (!isValid(config)) {\n            config._d = null;\n        }\n\n        return config;\n    }\n\n    function configFromInput(config) {\n        var input = config._i;\n        if (isUndefined(input)) {\n            config._d = new Date(hooks.now());\n        } else if (isDate(input)) {\n            config._d = new Date(input.valueOf());\n        } else if (typeof input === 'string') {\n            configFromString(config);\n        } else if (isArray(input)) {\n            config._a = map(input.slice(0), function (obj) {\n                return parseInt(obj, 10);\n            });\n            configFromArray(config);\n        } else if (isObject(input)) {\n            configFromObject(config);\n        } else if (isNumber(input)) {\n            // from milliseconds\n            config._d = new Date(input);\n        } else {\n            hooks.createFromInputFallback(config);\n        }\n    }\n\n    function createLocalOrUTC(input, format, locale, strict, isUTC) {\n        var c = {};\n\n        if (format === true || format === false) {\n            strict = format;\n            format = undefined;\n        }\n\n        if (locale === true || locale === false) {\n            strict = locale;\n            locale = undefined;\n        }\n\n        if (\n            (isObject(input) && isObjectEmpty(input)) ||\n            (isArray(input) && input.length === 0)\n        ) {\n            input = undefined;\n        }\n        // object construction must be done this way.\n        // https://github.com/moment/moment/issues/1423\n        c._isAMomentObject = true;\n        c._useUTC = c._isUTC = isUTC;\n        c._l = locale;\n        c._i = input;\n        c._f = format;\n        c._strict = strict;\n\n        return createFromConfig(c);\n    }\n\n    function createLocal(input, format, locale, strict) {\n        return createLocalOrUTC(input, format, locale, strict, false);\n    }\n\n    var prototypeMin = deprecate(\n            'moment().min is deprecated, use moment.max instead. http://momentjs.com/guides/#/warnings/min-max/',\n            function () {\n                var other = createLocal.apply(null, arguments);\n                if (this.isValid() && other.isValid()) {\n                    return other < this ? this : other;\n                } else {\n                    return createInvalid();\n                }\n            }\n        ),\n        prototypeMax = deprecate(\n            'moment().max is deprecated, use moment.min instead. http://momentjs.com/guides/#/warnings/min-max/',\n            function () {\n                var other = createLocal.apply(null, arguments);\n                if (this.isValid() && other.isValid()) {\n                    return other > this ? this : other;\n                } else {\n                    return createInvalid();\n                }\n            }\n        );\n\n    // Pick a moment m from moments so that m[fn](other) is true for all\n    // other. This relies on the function fn to be transitive.\n    //\n    // moments should either be an array of moment objects or an array, whose\n    // first element is an array of moment objects.\n    function pickBy(fn, moments) {\n        var res, i;\n        if (moments.length === 1 && isArray(moments[0])) {\n            moments = moments[0];\n        }\n        if (!moments.length) {\n            return createLocal();\n        }\n        res = moments[0];\n        for (i = 1; i < moments.length; ++i) {\n            if (!moments[i].isValid() || moments[i][fn](res)) {\n                res = moments[i];\n            }\n        }\n        return res;\n    }\n\n    // TODO: Use [].sort instead?\n    function min() {\n        var args = [].slice.call(arguments, 0);\n\n        return pickBy('isBefore', args);\n    }\n\n    function max() {\n        var args = [].slice.call(arguments, 0);\n\n        return pickBy('isAfter', args);\n    }\n\n    var now = function () {\n        return Date.now ? Date.now() : +new Date();\n    };\n\n    var ordering = [\n        'year',\n        'quarter',\n        'month',\n        'week',\n        'day',\n        'hour',\n        'minute',\n        'second',\n        'millisecond',\n    ];\n\n    function isDurationValid(m) {\n        var key,\n            unitHasDecimal = false,\n            i,\n            orderLen = ordering.length;\n        for (key in m) {\n            if (\n                hasOwnProp(m, key) &&\n                !(\n                    indexOf.call(ordering, key) !== -1 &&\n                    (m[key] == null || !isNaN(m[key]))\n                )\n            ) {\n                return false;\n            }\n        }\n\n        for (i = 0; i < orderLen; ++i) {\n            if (m[ordering[i]]) {\n                if (unitHasDecimal) {\n                    return false; // only allow non-integers for smallest unit\n                }\n                if (parseFloat(m[ordering[i]]) !== toInt(m[ordering[i]])) {\n                    unitHasDecimal = true;\n                }\n            }\n        }\n\n        return true;\n    }\n\n    function isValid$1() {\n        return this._isValid;\n    }\n\n    function createInvalid$1() {\n        return createDuration(NaN);\n    }\n\n    function Duration(duration) {\n        var normalizedInput = normalizeObjectUnits(duration),\n            years = normalizedInput.year || 0,\n            quarters = normalizedInput.quarter || 0,\n            months = normalizedInput.month || 0,\n            weeks = normalizedInput.week || normalizedInput.isoWeek || 0,\n            days = normalizedInput.day || 0,\n            hours = normalizedInput.hour || 0,\n            minutes = normalizedInput.minute || 0,\n            seconds = normalizedInput.second || 0,\n            milliseconds = normalizedInput.millisecond || 0;\n\n        this._isValid = isDurationValid(normalizedInput);\n\n        // representation for dateAddRemove\n        this._milliseconds =\n            +milliseconds +\n            seconds * 1e3 + // 1000\n            minutes * 6e4 + // 1000 * 60\n            hours * 1000 * 60 * 60; //using 1000 * 60 * 60 instead of 36e5 to avoid floating point rounding errors https://github.com/moment/moment/issues/2978\n        // Because of dateAddRemove treats 24 hours as different from a\n        // day when working around DST, we need to store them separately\n        this._days = +days + weeks * 7;\n        // It is impossible to translate months into days without knowing\n        // which months you are are talking about, so we have to store\n        // it separately.\n        this._months = +months + quarters * 3 + years * 12;\n\n        this._data = {};\n\n        this._locale = getLocale();\n\n        this._bubble();\n    }\n\n    function isDuration(obj) {\n        return obj instanceof Duration;\n    }\n\n    function absRound(number) {\n        if (number < 0) {\n            return Math.round(-1 * number) * -1;\n        } else {\n            return Math.round(number);\n        }\n    }\n\n    // compare two arrays, return the number of differences\n    function compareArrays(array1, array2, dontConvert) {\n        var len = Math.min(array1.length, array2.length),\n            lengthDiff = Math.abs(array1.length - array2.length),\n            diffs = 0,\n            i;\n        for (i = 0; i < len; i++) {\n            if (\n                (dontConvert && array1[i] !== array2[i]) ||\n                (!dontConvert && toInt(array1[i]) !== toInt(array2[i]))\n            ) {\n                diffs++;\n            }\n        }\n        return diffs + lengthDiff;\n    }\n\n    // FORMATTING\n\n    function offset(token, separator) {\n        addFormatToken(token, 0, 0, function () {\n            var offset = this.utcOffset(),\n                sign = '+';\n            if (offset < 0) {\n                offset = -offset;\n                sign = '-';\n            }\n            return (\n                sign +\n                zeroFill(~~(offset / 60), 2) +\n                separator +\n                zeroFill(~~offset % 60, 2)\n            );\n        });\n    }\n\n    offset('Z', ':');\n    offset('ZZ', '');\n\n    // PARSING\n\n    addRegexToken('Z', matchShortOffset);\n    addRegexToken('ZZ', matchShortOffset);\n    addParseToken(['Z', 'ZZ'], function (input, array, config) {\n        config._useUTC = true;\n        config._tzm = offsetFromString(matchShortOffset, input);\n    });\n\n    // HELPERS\n\n    // timezone chunker\n    // '+10:00' > ['10',  '00']\n    // '-1530'  > ['-15', '30']\n    var chunkOffset = /([\\+\\-]|\\d\\d)/gi;\n\n    function offsetFromString(matcher, string) {\n        var matches = (string || '').match(matcher),\n            chunk,\n            parts,\n            minutes;\n\n        if (matches === null) {\n            return null;\n        }\n\n        chunk = matches[matches.length - 1] || [];\n        parts = (chunk + '').match(chunkOffset) || ['-', 0, 0];\n        minutes = +(parts[1] * 60) + toInt(parts[2]);\n\n        return minutes === 0 ? 0 : parts[0] === '+' ? minutes : -minutes;\n    }\n\n    // Return a moment from input, that is local/utc/zone equivalent to model.\n    function cloneWithOffset(input, model) {\n        var res, diff;\n        if (model._isUTC) {\n            res = model.clone();\n            diff =\n                (isMoment(input) || isDate(input)\n                    ? input.valueOf()\n                    : createLocal(input).valueOf()) - res.valueOf();\n            // Use low-level api, because this fn is low-level api.\n            res._d.setTime(res._d.valueOf() + diff);\n            hooks.updateOffset(res, false);\n            return res;\n        } else {\n            return createLocal(input).local();\n        }\n    }\n\n    function getDateOffset(m) {\n        // On Firefox.24 Date#getTimezoneOffset returns a floating point.\n        // https://github.com/moment/moment/pull/1871\n        return -Math.round(m._d.getTimezoneOffset());\n    }\n\n    // HOOKS\n\n    // This function will be called whenever a moment is mutated.\n    // It is intended to keep the offset in sync with the timezone.\n    hooks.updateOffset = function () {};\n\n    // MOMENTS\n\n    // keepLocalTime = true means only change the timezone, without\n    // affecting the local hour. So 5:31:26 +0300 --[utcOffset(2, true)]-->\n    // 5:31:26 +0200 It is possible that 5:31:26 doesn't exist with offset\n    // +0200, so we adjust the time as needed, to be valid.\n    //\n    // Keeping the time actually adds/subtracts (one hour)\n    // from the actual represented time. That is why we call updateOffset\n    // a second time. In case it wants us to change the offset again\n    // _changeInProgress == true case, then we have to adjust, because\n    // there is no such time in the given timezone.\n    function getSetOffset(input, keepLocalTime, keepMinutes) {\n        var offset = this._offset || 0,\n            localAdjust;\n        if (!this.isValid()) {\n            return input != null ? this : NaN;\n        }\n        if (input != null) {\n            if (typeof input === 'string') {\n                input = offsetFromString(matchShortOffset, input);\n                if (input === null) {\n                    return this;\n                }\n            } else if (Math.abs(input) < 16 && !keepMinutes) {\n                input = input * 60;\n            }\n            if (!this._isUTC && keepLocalTime) {\n                localAdjust = getDateOffset(this);\n            }\n            this._offset = input;\n            this._isUTC = true;\n            if (localAdjust != null) {\n                this.add(localAdjust, 'm');\n            }\n            if (offset !== input) {\n                if (!keepLocalTime || this._changeInProgress) {\n                    addSubtract(\n                        this,\n                        createDuration(input - offset, 'm'),\n                        1,\n                        false\n                    );\n                } else if (!this._changeInProgress) {\n                    this._changeInProgress = true;\n                    hooks.updateOffset(this, true);\n                    this._changeInProgress = null;\n                }\n            }\n            return this;\n        } else {\n            return this._isUTC ? offset : getDateOffset(this);\n        }\n    }\n\n    function getSetZone(input, keepLocalTime) {\n        if (input != null) {\n            if (typeof input !== 'string') {\n                input = -input;\n            }\n\n            this.utcOffset(input, keepLocalTime);\n\n            return this;\n        } else {\n            return -this.utcOffset();\n        }\n    }\n\n    function setOffsetToUTC(keepLocalTime) {\n        return this.utcOffset(0, keepLocalTime);\n    }\n\n    function setOffsetToLocal(keepLocalTime) {\n        if (this._isUTC) {\n            this.utcOffset(0, keepLocalTime);\n            this._isUTC = false;\n\n            if (keepLocalTime) {\n                this.subtract(getDateOffset(this), 'm');\n            }\n        }\n        return this;\n    }\n\n    function setOffsetToParsedOffset() {\n        if (this._tzm != null) {\n            this.utcOffset(this._tzm, false, true);\n        } else if (typeof this._i === 'string') {\n            var tZone = offsetFromString(matchOffset, this._i);\n            if (tZone != null) {\n                this.utcOffset(tZone);\n            } else {\n                this.utcOffset(0, true);\n            }\n        }\n        return this;\n    }\n\n    function hasAlignedHourOffset(input) {\n        if (!this.isValid()) {\n            return false;\n        }\n        input = input ? createLocal(input).utcOffset() : 0;\n\n        return (this.utcOffset() - input) % 60 === 0;\n    }\n\n    function isDaylightSavingTime() {\n        return (\n            this.utcOffset() > this.clone().month(0).utcOffset() ||\n            this.utcOffset() > this.clone().month(5).utcOffset()\n        );\n    }\n\n    function isDaylightSavingTimeShifted() {\n        if (!isUndefined(this._isDSTShifted)) {\n            return this._isDSTShifted;\n        }\n\n        var c = {},\n            other;\n\n        copyConfig(c, this);\n        c = prepareConfig(c);\n\n        if (c._a) {\n            other = c._isUTC ? createUTC(c._a) : createLocal(c._a);\n            this._isDSTShifted =\n                this.isValid() && compareArrays(c._a, other.toArray()) > 0;\n        } else {\n            this._isDSTShifted = false;\n        }\n\n        return this._isDSTShifted;\n    }\n\n    function isLocal() {\n        return this.isValid() ? !this._isUTC : false;\n    }\n\n    function isUtcOffset() {\n        return this.isValid() ? this._isUTC : false;\n    }\n\n    function isUtc() {\n        return this.isValid() ? this._isUTC && this._offset === 0 : false;\n    }\n\n    // ASP.NET json date format regex\n    var aspNetRegex = /^(-|\\+)?(?:(\\d*)[. ])?(\\d+):(\\d+)(?::(\\d+)(\\.\\d*)?)?$/,\n        // from http://docs.closure-library.googlecode.com/git/closure_goog_date_date.js.source.html\n        // somewhat more in line with 4.4.3.2 2004 spec, but allows decimal anywhere\n        // and further modified to allow for strings containing both week and day\n        isoRegex =\n            /^(-|\\+)?P(?:([-+]?[0-9,.]*)Y)?(?:([-+]?[0-9,.]*)M)?(?:([-+]?[0-9,.]*)W)?(?:([-+]?[0-9,.]*)D)?(?:T(?:([-+]?[0-9,.]*)H)?(?:([-+]?[0-9,.]*)M)?(?:([-+]?[0-9,.]*)S)?)?$/;\n\n    function createDuration(input, key) {\n        var duration = input,\n            // matching against regexp is expensive, do it on demand\n            match = null,\n            sign,\n            ret,\n            diffRes;\n\n        if (isDuration(input)) {\n            duration = {\n                ms: input._milliseconds,\n                d: input._days,\n                M: input._months,\n            };\n        } else if (isNumber(input) || !isNaN(+input)) {\n            duration = {};\n            if (key) {\n                duration[key] = +input;\n            } else {\n                duration.milliseconds = +input;\n            }\n        } else if ((match = aspNetRegex.exec(input))) {\n            sign = match[1] === '-' ? -1 : 1;\n            duration = {\n                y: 0,\n                d: toInt(match[DATE]) * sign,\n                h: toInt(match[HOUR]) * sign,\n                m: toInt(match[MINUTE]) * sign,\n                s: toInt(match[SECOND]) * sign,\n                ms: toInt(absRound(match[MILLISECOND] * 1000)) * sign, // the millisecond decimal point is included in the match\n            };\n        } else if ((match = isoRegex.exec(input))) {\n            sign = match[1] === '-' ? -1 : 1;\n            duration = {\n                y: parseIso(match[2], sign),\n                M: parseIso(match[3], sign),\n                w: parseIso(match[4], sign),\n                d: parseIso(match[5], sign),\n                h: parseIso(match[6], sign),\n                m: parseIso(match[7], sign),\n                s: parseIso(match[8], sign),\n            };\n        } else if (duration == null) {\n            // checks for null or undefined\n            duration = {};\n        } else if (\n            typeof duration === 'object' &&\n            ('from' in duration || 'to' in duration)\n        ) {\n            diffRes = momentsDifference(\n                createLocal(duration.from),\n                createLocal(duration.to)\n            );\n\n            duration = {};\n            duration.ms = diffRes.milliseconds;\n            duration.M = diffRes.months;\n        }\n\n        ret = new Duration(duration);\n\n        if (isDuration(input) && hasOwnProp(input, '_locale')) {\n            ret._locale = input._locale;\n        }\n\n        if (isDuration(input) && hasOwnProp(input, '_isValid')) {\n            ret._isValid = input._isValid;\n        }\n\n        return ret;\n    }\n\n    createDuration.fn = Duration.prototype;\n    createDuration.invalid = createInvalid$1;\n\n    function parseIso(inp, sign) {\n        // We'd normally use ~~inp for this, but unfortunately it also\n        // converts floats to ints.\n        // inp may be undefined, so careful calling replace on it.\n        var res = inp && parseFloat(inp.replace(',', '.'));\n        // apply sign while we're at it\n        return (isNaN(res) ? 0 : res) * sign;\n    }\n\n    function positiveMomentsDifference(base, other) {\n        var res = {};\n\n        res.months =\n            other.month() - base.month() + (other.year() - base.year()) * 12;\n        if (base.clone().add(res.months, 'M').isAfter(other)) {\n            --res.months;\n        }\n\n        res.milliseconds = +other - +base.clone().add(res.months, 'M');\n\n        return res;\n    }\n\n    function momentsDifference(base, other) {\n        var res;\n        if (!(base.isValid() && other.isValid())) {\n            return { milliseconds: 0, months: 0 };\n        }\n\n        other = cloneWithOffset(other, base);\n        if (base.isBefore(other)) {\n            res = positiveMomentsDifference(base, other);\n        } else {\n            res = positiveMomentsDifference(other, base);\n            res.milliseconds = -res.milliseconds;\n            res.months = -res.months;\n        }\n\n        return res;\n    }\n\n    // TODO: remove 'name' arg after deprecation is removed\n    function createAdder(direction, name) {\n        return function (val, period) {\n            var dur, tmp;\n            //invert the arguments, but complain about it\n            if (period !== null && !isNaN(+period)) {\n                deprecateSimple(\n                    name,\n                    'moment().' +\n                        name +\n                        '(period, number) is deprecated. Please use moment().' +\n                        name +\n                        '(number, period). ' +\n                        'See http://momentjs.com/guides/#/warnings/add-inverted-param/ for more info.'\n                );\n                tmp = val;\n                val = period;\n                period = tmp;\n            }\n\n            dur = createDuration(val, period);\n            addSubtract(this, dur, direction);\n            return this;\n        };\n    }\n\n    function addSubtract(mom, duration, isAdding, updateOffset) {\n        var milliseconds = duration._milliseconds,\n            days = absRound(duration._days),\n            months = absRound(duration._months);\n\n        if (!mom.isValid()) {\n            // No op\n            return;\n        }\n\n        updateOffset = updateOffset == null ? true : updateOffset;\n\n        if (months) {\n            setMonth(mom, get(mom, 'Month') + months * isAdding);\n        }\n        if (days) {\n            set$1(mom, 'Date', get(mom, 'Date') + days * isAdding);\n        }\n        if (milliseconds) {\n            mom._d.setTime(mom._d.valueOf() + milliseconds * isAdding);\n        }\n        if (updateOffset) {\n            hooks.updateOffset(mom, days || months);\n        }\n    }\n\n    var add = createAdder(1, 'add'),\n        subtract = createAdder(-1, 'subtract');\n\n    function isString(input) {\n        return typeof input === 'string' || input instanceof String;\n    }\n\n    // type MomentInput = Moment | Date | string | number | (number | string)[] | MomentInputObject | void; // null | undefined\n    function isMomentInput(input) {\n        return (\n            isMoment(input) ||\n            isDate(input) ||\n            isString(input) ||\n            isNumber(input) ||\n            isNumberOrStringArray(input) ||\n            isMomentInputObject(input) ||\n            input === null ||\n            input === undefined\n        );\n    }\n\n    function isMomentInputObject(input) {\n        var objectTest = isObject(input) && !isObjectEmpty(input),\n            propertyTest = false,\n            properties = [\n                'years',\n                'year',\n                'y',\n                'months',\n                'month',\n                'M',\n                'days',\n                'day',\n                'd',\n                'dates',\n                'date',\n                'D',\n                'hours',\n                'hour',\n                'h',\n                'minutes',\n                'minute',\n                'm',\n                'seconds',\n                'second',\n                's',\n                'milliseconds',\n                'millisecond',\n                'ms',\n            ],\n            i,\n            property,\n            propertyLen = properties.length;\n\n        for (i = 0; i < propertyLen; i += 1) {\n            property = properties[i];\n            propertyTest = propertyTest || hasOwnProp(input, property);\n        }\n\n        return objectTest && propertyTest;\n    }\n\n    function isNumberOrStringArray(input) {\n        var arrayTest = isArray(input),\n            dataTypeTest = false;\n        if (arrayTest) {\n            dataTypeTest =\n                input.filter(function (item) {\n                    return !isNumber(item) && isString(input);\n                }).length === 0;\n        }\n        return arrayTest && dataTypeTest;\n    }\n\n    function isCalendarSpec(input) {\n        var objectTest = isObject(input) && !isObjectEmpty(input),\n            propertyTest = false,\n            properties = [\n                'sameDay',\n                'nextDay',\n                'lastDay',\n                'nextWeek',\n                'lastWeek',\n                'sameElse',\n            ],\n            i,\n            property;\n\n        for (i = 0; i < properties.length; i += 1) {\n            property = properties[i];\n            propertyTest = propertyTest || hasOwnProp(input, property);\n        }\n\n        return objectTest && propertyTest;\n    }\n\n    function getCalendarFormat(myMoment, now) {\n        var diff = myMoment.diff(now, 'days', true);\n        return diff < -6\n            ? 'sameElse'\n            : diff < -1\n              ? 'lastWeek'\n              : diff < 0\n                ? 'lastDay'\n                : diff < 1\n                  ? 'sameDay'\n                  : diff < 2\n                    ? 'nextDay'\n                    : diff < 7\n                      ? 'nextWeek'\n                      : 'sameElse';\n    }\n\n    function calendar$1(time, formats) {\n        // Support for single parameter, formats only overload to the calendar function\n        if (arguments.length === 1) {\n            if (!arguments[0]) {\n                time = undefined;\n                formats = undefined;\n            } else if (isMomentInput(arguments[0])) {\n                time = arguments[0];\n                formats = undefined;\n            } else if (isCalendarSpec(arguments[0])) {\n                formats = arguments[0];\n                time = undefined;\n            }\n        }\n        // We want to compare the start of today, vs this.\n        // Getting start-of-today depends on whether we're local/utc/offset or not.\n        var now = time || createLocal(),\n            sod = cloneWithOffset(now, this).startOf('day'),\n            format = hooks.calendarFormat(this, sod) || 'sameElse',\n            output =\n                formats &&\n                (isFunction(formats[format])\n                    ? formats[format].call(this, now)\n                    : formats[format]);\n\n        return this.format(\n            output || this.localeData().calendar(format, this, createLocal(now))\n        );\n    }\n\n    function clone() {\n        return new Moment(this);\n    }\n\n    function isAfter(input, units) {\n        var localInput = isMoment(input) ? input : createLocal(input);\n        if (!(this.isValid() && localInput.isValid())) {\n            return false;\n        }\n        units = normalizeUnits(units) || 'millisecond';\n        if (units === 'millisecond') {\n            return this.valueOf() > localInput.valueOf();\n        } else {\n            return localInput.valueOf() < this.clone().startOf(units).valueOf();\n        }\n    }\n\n    function isBefore(input, units) {\n        var localInput = isMoment(input) ? input : createLocal(input);\n        if (!(this.isValid() && localInput.isValid())) {\n            return false;\n        }\n        units = normalizeUnits(units) || 'millisecond';\n        if (units === 'millisecond') {\n            return this.valueOf() < localInput.valueOf();\n        } else {\n            return this.clone().endOf(units).valueOf() < localInput.valueOf();\n        }\n    }\n\n    function isBetween(from, to, units, inclusivity) {\n        var localFrom = isMoment(from) ? from : createLocal(from),\n            localTo = isMoment(to) ? to : createLocal(to);\n        if (!(this.isValid() && localFrom.isValid() && localTo.isValid())) {\n            return false;\n        }\n        inclusivity = inclusivity || '()';\n        return (\n            (inclusivity[0] === '('\n                ? this.isAfter(localFrom, units)\n                : !this.isBefore(localFrom, units)) &&\n            (inclusivity[1] === ')'\n                ? this.isBefore(localTo, units)\n                : !this.isAfter(localTo, units))\n        );\n    }\n\n    function isSame(input, units) {\n        var localInput = isMoment(input) ? input : createLocal(input),\n            inputMs;\n        if (!(this.isValid() && localInput.isValid())) {\n            return false;\n        }\n        units = normalizeUnits(units) || 'millisecond';\n        if (units === 'millisecond') {\n            return this.valueOf() === localInput.valueOf();\n        } else {\n            inputMs = localInput.valueOf();\n            return (\n                this.clone().startOf(units).valueOf() <= inputMs &&\n                inputMs <= this.clone().endOf(units).valueOf()\n            );\n        }\n    }\n\n    function isSameOrAfter(input, units) {\n        return this.isSame(input, units) || this.isAfter(input, units);\n    }\n\n    function isSameOrBefore(input, units) {\n        return this.isSame(input, units) || this.isBefore(input, units);\n    }\n\n    function diff(input, units, asFloat) {\n        var that, zoneDelta, output;\n\n        if (!this.isValid()) {\n            return NaN;\n        }\n\n        that = cloneWithOffset(input, this);\n\n        if (!that.isValid()) {\n            return NaN;\n        }\n\n        zoneDelta = (that.utcOffset() - this.utcOffset()) * 6e4;\n\n        units = normalizeUnits(units);\n\n        switch (units) {\n            case 'year':\n                output = monthDiff(this, that) / 12;\n                break;\n            case 'month':\n                output = monthDiff(this, that);\n                break;\n            case 'quarter':\n                output = monthDiff(this, that) / 3;\n                break;\n            case 'second':\n                output = (this - that) / 1e3;\n                break; // 1000\n            case 'minute':\n                output = (this - that) / 6e4;\n                break; // 1000 * 60\n            case 'hour':\n                output = (this - that) / 36e5;\n                break; // 1000 * 60 * 60\n            case 'day':\n                output = (this - that - zoneDelta) / 864e5;\n                break; // 1000 * 60 * 60 * 24, negate dst\n            case 'week':\n                output = (this - that - zoneDelta) / 6048e5;\n                break; // 1000 * 60 * 60 * 24 * 7, negate dst\n            default:\n                output = this - that;\n        }\n\n        return asFloat ? output : absFloor(output);\n    }\n\n    function monthDiff(a, b) {\n        if (a.date() < b.date()) {\n            // end-of-month calculations work correct when the start month has more\n            // days than the end month.\n            return -monthDiff(b, a);\n        }\n        // difference in months\n        var wholeMonthDiff = (b.year() - a.year()) * 12 + (b.month() - a.month()),\n            // b is in (anchor - 1 month, anchor + 1 month)\n            anchor = a.clone().add(wholeMonthDiff, 'months'),\n            anchor2,\n            adjust;\n\n        if (b - anchor < 0) {\n            anchor2 = a.clone().add(wholeMonthDiff - 1, 'months');\n            // linear across the month\n            adjust = (b - anchor) / (anchor - anchor2);\n        } else {\n            anchor2 = a.clone().add(wholeMonthDiff + 1, 'months');\n            // linear across the month\n            adjust = (b - anchor) / (anchor2 - anchor);\n        }\n\n        //check for negative zero, return zero if negative zero\n        return -(wholeMonthDiff + adjust) || 0;\n    }\n\n    hooks.defaultFormat = 'YYYY-MM-DDTHH:mm:ssZ';\n    hooks.defaultFormatUtc = 'YYYY-MM-DDTHH:mm:ss[Z]';\n\n    function toString() {\n        return this.clone().locale('en').format('ddd MMM DD YYYY HH:mm:ss [GMT]ZZ');\n    }\n\n    function toISOString(keepOffset) {\n        if (!this.isValid()) {\n            return null;\n        }\n        var utc = keepOffset !== true,\n            m = utc ? this.clone().utc() : this;\n        if (m.year() < 0 || m.year() > 9999) {\n            return formatMoment(\n                m,\n                utc\n                    ? 'YYYYYY-MM-DD[T]HH:mm:ss.SSS[Z]'\n                    : 'YYYYYY-MM-DD[T]HH:mm:ss.SSSZ'\n            );\n        }\n        if (isFunction(Date.prototype.toISOString)) {\n            // native implementation is ~50x faster, use it when we can\n            if (utc) {\n                return this.toDate().toISOString();\n            } else {\n                return new Date(this.valueOf() + this.utcOffset() * 60 * 1000)\n                    .toISOString()\n                    .replace('Z', formatMoment(m, 'Z'));\n            }\n        }\n        return formatMoment(\n            m,\n            utc ? 'YYYY-MM-DD[T]HH:mm:ss.SSS[Z]' : 'YYYY-MM-DD[T]HH:mm:ss.SSSZ'\n        );\n    }\n\n    /**\n     * Return a human readable representation of a moment that can\n     * also be evaluated to get a new moment which is the same\n     *\n     * @link https://nodejs.org/dist/latest/docs/api/util.html#util_custom_inspect_function_on_objects\n     */\n    function inspect() {\n        if (!this.isValid()) {\n            return 'moment.invalid(/* ' + this._i + ' */)';\n        }\n        var func = 'moment',\n            zone = '',\n            prefix,\n            year,\n            datetime,\n            suffix;\n        if (!this.isLocal()) {\n            func = this.utcOffset() === 0 ? 'moment.utc' : 'moment.parseZone';\n            zone = 'Z';\n        }\n        prefix = '[' + func + '(\"]';\n        year = 0 <= this.year() && this.year() <= 9999 ? 'YYYY' : 'YYYYYY';\n        datetime = '-MM-DD[T]HH:mm:ss.SSS';\n        suffix = zone + '[\")]';\n\n        return this.format(prefix + year + datetime + suffix);\n    }\n\n    function format(inputString) {\n        if (!inputString) {\n            inputString = this.isUtc()\n                ? hooks.defaultFormatUtc\n                : hooks.defaultFormat;\n        }\n        var output = formatMoment(this, inputString);\n        return this.localeData().postformat(output);\n    }\n\n    function from(time, withoutSuffix) {\n        if (\n            this.isValid() &&\n            ((isMoment(time) && time.isValid()) || createLocal(time).isValid())\n        ) {\n            return createDuration({ to: this, from: time })\n                .locale(this.locale())\n                .humanize(!withoutSuffix);\n        } else {\n            return this.localeData().invalidDate();\n        }\n    }\n\n    function fromNow(withoutSuffix) {\n        return this.from(createLocal(), withoutSuffix);\n    }\n\n    function to(time, withoutSuffix) {\n        if (\n            this.isValid() &&\n            ((isMoment(time) && time.isValid()) || createLocal(time).isValid())\n        ) {\n            return createDuration({ from: this, to: time })\n                .locale(this.locale())\n                .humanize(!withoutSuffix);\n        } else {\n            return this.localeData().invalidDate();\n        }\n    }\n\n    function toNow(withoutSuffix) {\n        return this.to(createLocal(), withoutSuffix);\n    }\n\n    // If passed a locale key, it will set the locale for this\n    // instance.  Otherwise, it will return the locale configuration\n    // variables for this instance.\n    function locale(key) {\n        var newLocaleData;\n\n        if (key === undefined) {\n            return this._locale._abbr;\n        } else {\n            newLocaleData = getLocale(key);\n            if (newLocaleData != null) {\n                this._locale = newLocaleData;\n            }\n            return this;\n        }\n    }\n\n    var lang = deprecate(\n        'moment().lang() is deprecated. Instead, use moment().localeData() to get the language configuration. Use moment().locale() to change languages.',\n        function (key) {\n            if (key === undefined) {\n                return this.localeData();\n            } else {\n                return this.locale(key);\n            }\n        }\n    );\n\n    function localeData() {\n        return this._locale;\n    }\n\n    var MS_PER_SECOND = 1000,\n        MS_PER_MINUTE = 60 * MS_PER_SECOND,\n        MS_PER_HOUR = 60 * MS_PER_MINUTE,\n        MS_PER_400_YEARS = (365 * 400 + 97) * 24 * MS_PER_HOUR;\n\n    // actual modulo - handles negative numbers (for dates before 1970):\n    function mod$1(dividend, divisor) {\n        return ((dividend % divisor) + divisor) % divisor;\n    }\n\n    function localStartOfDate(y, m, d) {\n        // the date constructor remaps years 0-99 to 1900-1999\n        if (y < 100 && y >= 0) {\n            // preserve leap years using a full 400 year cycle, then reset\n            return new Date(y + 400, m, d) - MS_PER_400_YEARS;\n        } else {\n            return new Date(y, m, d).valueOf();\n        }\n    }\n\n    function utcStartOfDate(y, m, d) {\n        // Date.UTC remaps years 0-99 to 1900-1999\n        if (y < 100 && y >= 0) {\n            // preserve leap years using a full 400 year cycle, then reset\n            return Date.UTC(y + 400, m, d) - MS_PER_400_YEARS;\n        } else {\n            return Date.UTC(y, m, d);\n        }\n    }\n\n    function startOf(units) {\n        var time, startOfDate;\n        units = normalizeUnits(units);\n        if (units === undefined || units === 'millisecond' || !this.isValid()) {\n            return this;\n        }\n\n        startOfDate = this._isUTC ? utcStartOfDate : localStartOfDate;\n\n        switch (units) {\n            case 'year':\n                time = startOfDate(this.year(), 0, 1);\n                break;\n            case 'quarter':\n                time = startOfDate(\n                    this.year(),\n                    this.month() - (this.month() % 3),\n                    1\n                );\n                break;\n            case 'month':\n                time = startOfDate(this.year(), this.month(), 1);\n                break;\n            case 'week':\n                time = startOfDate(\n                    this.year(),\n                    this.month(),\n                    this.date() - this.weekday()\n                );\n                break;\n            case 'isoWeek':\n                time = startOfDate(\n                    this.year(),\n                    this.month(),\n                    this.date() - (this.isoWeekday() - 1)\n                );\n                break;\n            case 'day':\n            case 'date':\n                time = startOfDate(this.year(), this.month(), this.date());\n                break;\n            case 'hour':\n                time = this._d.valueOf();\n                time -= mod$1(\n                    time + (this._isUTC ? 0 : this.utcOffset() * MS_PER_MINUTE),\n                    MS_PER_HOUR\n                );\n                break;\n            case 'minute':\n                time = this._d.valueOf();\n                time -= mod$1(time, MS_PER_MINUTE);\n                break;\n            case 'second':\n                time = this._d.valueOf();\n                time -= mod$1(time, MS_PER_SECOND);\n                break;\n        }\n\n        this._d.setTime(time);\n        hooks.updateOffset(this, true);\n        return this;\n    }\n\n    function endOf(units) {\n        var time, startOfDate;\n        units = normalizeUnits(units);\n        if (units === undefined || units === 'millisecond' || !this.isValid()) {\n            return this;\n        }\n\n        startOfDate = this._isUTC ? utcStartOfDate : localStartOfDate;\n\n        switch (units) {\n            case 'year':\n                time = startOfDate(this.year() + 1, 0, 1) - 1;\n                break;\n            case 'quarter':\n                time =\n                    startOfDate(\n                        this.year(),\n                        this.month() - (this.month() % 3) + 3,\n                        1\n                    ) - 1;\n                break;\n            case 'month':\n                time = startOfDate(this.year(), this.month() + 1, 1) - 1;\n                break;\n            case 'week':\n                time =\n                    startOfDate(\n                        this.year(),\n                        this.month(),\n                        this.date() - this.weekday() + 7\n                    ) - 1;\n                break;\n            case 'isoWeek':\n                time =\n                    startOfDate(\n                        this.year(),\n                        this.month(),\n                        this.date() - (this.isoWeekday() - 1) + 7\n                    ) - 1;\n                break;\n            case 'day':\n            case 'date':\n                time = startOfDate(this.year(), this.month(), this.date() + 1) - 1;\n                break;\n            case 'hour':\n                time = this._d.valueOf();\n                time +=\n                    MS_PER_HOUR -\n                    mod$1(\n                        time + (this._isUTC ? 0 : this.utcOffset() * MS_PER_MINUTE),\n                        MS_PER_HOUR\n                    ) -\n                    1;\n                break;\n            case 'minute':\n                time = this._d.valueOf();\n                time += MS_PER_MINUTE - mod$1(time, MS_PER_MINUTE) - 1;\n                break;\n            case 'second':\n                time = this._d.valueOf();\n                time += MS_PER_SECOND - mod$1(time, MS_PER_SECOND) - 1;\n                break;\n        }\n\n        this._d.setTime(time);\n        hooks.updateOffset(this, true);\n        return this;\n    }\n\n    function valueOf() {\n        return this._d.valueOf() - (this._offset || 0) * 60000;\n    }\n\n    function unix() {\n        return Math.floor(this.valueOf() / 1000);\n    }\n\n    function toDate() {\n        return new Date(this.valueOf());\n    }\n\n    function toArray() {\n        var m = this;\n        return [\n            m.year(),\n            m.month(),\n            m.date(),\n            m.hour(),\n            m.minute(),\n            m.second(),\n            m.millisecond(),\n        ];\n    }\n\n    function toObject() {\n        var m = this;\n        return {\n            years: m.year(),\n            months: m.month(),\n            date: m.date(),\n            hours: m.hours(),\n            minutes: m.minutes(),\n            seconds: m.seconds(),\n            milliseconds: m.milliseconds(),\n        };\n    }\n\n    function toJSON() {\n        // new Date(NaN).toJSON() === null\n        return this.isValid() ? this.toISOString() : null;\n    }\n\n    function isValid$2() {\n        return isValid(this);\n    }\n\n    function parsingFlags() {\n        return extend({}, getParsingFlags(this));\n    }\n\n    function invalidAt() {\n        return getParsingFlags(this).overflow;\n    }\n\n    function creationData() {\n        return {\n            input: this._i,\n            format: this._f,\n            locale: this._locale,\n            isUTC: this._isUTC,\n            strict: this._strict,\n        };\n    }\n\n    addFormatToken('N', 0, 0, 'eraAbbr');\n    addFormatToken('NN', 0, 0, 'eraAbbr');\n    addFormatToken('NNN', 0, 0, 'eraAbbr');\n    addFormatToken('NNNN', 0, 0, 'eraName');\n    addFormatToken('NNNNN', 0, 0, 'eraNarrow');\n\n    addFormatToken('y', ['y', 1], 'yo', 'eraYear');\n    addFormatToken('y', ['yy', 2], 0, 'eraYear');\n    addFormatToken('y', ['yyy', 3], 0, 'eraYear');\n    addFormatToken('y', ['yyyy', 4], 0, 'eraYear');\n\n    addRegexToken('N', matchEraAbbr);\n    addRegexToken('NN', matchEraAbbr);\n    addRegexToken('NNN', matchEraAbbr);\n    addRegexToken('NNNN', matchEraName);\n    addRegexToken('NNNNN', matchEraNarrow);\n\n    addParseToken(\n        ['N', 'NN', 'NNN', 'NNNN', 'NNNNN'],\n        function (input, array, config, token) {\n            var era = config._locale.erasParse(input, token, config._strict);\n            if (era) {\n                getParsingFlags(config).era = era;\n            } else {\n                getParsingFlags(config).invalidEra = input;\n            }\n        }\n    );\n\n    addRegexToken('y', matchUnsigned);\n    addRegexToken('yy', matchUnsigned);\n    addRegexToken('yyy', matchUnsigned);\n    addRegexToken('yyyy', matchUnsigned);\n    addRegexToken('yo', matchEraYearOrdinal);\n\n    addParseToken(['y', 'yy', 'yyy', 'yyyy'], YEAR);\n    addParseToken(['yo'], function (input, array, config, token) {\n        var match;\n        if (config._locale._eraYearOrdinalRegex) {\n            match = input.match(config._locale._eraYearOrdinalRegex);\n        }\n\n        if (config._locale.eraYearOrdinalParse) {\n            array[YEAR] = config._locale.eraYearOrdinalParse(input, match);\n        } else {\n            array[YEAR] = parseInt(input, 10);\n        }\n    });\n\n    function localeEras(m, format) {\n        var i,\n            l,\n            date,\n            eras = this._eras || getLocale('en')._eras;\n        for (i = 0, l = eras.length; i < l; ++i) {\n            switch (typeof eras[i].since) {\n                case 'string':\n                    // truncate time\n                    date = hooks(eras[i].since).startOf('day');\n                    eras[i].since = date.valueOf();\n                    break;\n            }\n\n            switch (typeof eras[i].until) {\n                case 'undefined':\n                    eras[i].until = +Infinity;\n                    break;\n                case 'string':\n                    // truncate time\n                    date = hooks(eras[i].until).startOf('day').valueOf();\n                    eras[i].until = date.valueOf();\n                    break;\n            }\n        }\n        return eras;\n    }\n\n    function localeErasParse(eraName, format, strict) {\n        var i,\n            l,\n            eras = this.eras(),\n            name,\n            abbr,\n            narrow;\n        eraName = eraName.toUpperCase();\n\n        for (i = 0, l = eras.length; i < l; ++i) {\n            name = eras[i].name.toUpperCase();\n            abbr = eras[i].abbr.toUpperCase();\n            narrow = eras[i].narrow.toUpperCase();\n\n            if (strict) {\n                switch (format) {\n                    case 'N':\n                    case 'NN':\n                    case 'NNN':\n                        if (abbr === eraName) {\n                            return eras[i];\n                        }\n                        break;\n\n                    case 'NNNN':\n                        if (name === eraName) {\n                            return eras[i];\n                        }\n                        break;\n\n                    case 'NNNNN':\n                        if (narrow === eraName) {\n                            return eras[i];\n                        }\n                        break;\n                }\n            } else if ([name, abbr, narrow].indexOf(eraName) >= 0) {\n                return eras[i];\n            }\n        }\n    }\n\n    function localeErasConvertYear(era, year) {\n        var dir = era.since <= era.until ? +1 : -1;\n        if (year === undefined) {\n            return hooks(era.since).year();\n        } else {\n            return hooks(era.since).year() + (year - era.offset) * dir;\n        }\n    }\n\n    function getEraName() {\n        var i,\n            l,\n            val,\n            eras = this.localeData().eras();\n        for (i = 0, l = eras.length; i < l; ++i) {\n            // truncate time\n            val = this.clone().startOf('day').valueOf();\n\n            if (eras[i].since <= val && val <= eras[i].until) {\n                return eras[i].name;\n            }\n            if (eras[i].until <= val && val <= eras[i].since) {\n                return eras[i].name;\n            }\n        }\n\n        return '';\n    }\n\n    function getEraNarrow() {\n        var i,\n            l,\n            val,\n            eras = this.localeData().eras();\n        for (i = 0, l = eras.length; i < l; ++i) {\n            // truncate time\n            val = this.clone().startOf('day').valueOf();\n\n            if (eras[i].since <= val && val <= eras[i].until) {\n                return eras[i].narrow;\n            }\n            if (eras[i].until <= val && val <= eras[i].since) {\n                return eras[i].narrow;\n            }\n        }\n\n        return '';\n    }\n\n    function getEraAbbr() {\n        var i,\n            l,\n            val,\n            eras = this.localeData().eras();\n        for (i = 0, l = eras.length; i < l; ++i) {\n            // truncate time\n            val = this.clone().startOf('day').valueOf();\n\n            if (eras[i].since <= val && val <= eras[i].until) {\n                return eras[i].abbr;\n            }\n            if (eras[i].until <= val && val <= eras[i].since) {\n                return eras[i].abbr;\n            }\n        }\n\n        return '';\n    }\n\n    function getEraYear() {\n        var i,\n            l,\n            dir,\n            val,\n            eras = this.localeData().eras();\n        for (i = 0, l = eras.length; i < l; ++i) {\n            dir = eras[i].since <= eras[i].until ? +1 : -1;\n\n            // truncate time\n            val = this.clone().startOf('day').valueOf();\n\n            if (\n                (eras[i].since <= val && val <= eras[i].until) ||\n                (eras[i].until <= val && val <= eras[i].since)\n            ) {\n                return (\n                    (this.year() - hooks(eras[i].since).year()) * dir +\n                    eras[i].offset\n                );\n            }\n        }\n\n        return this.year();\n    }\n\n    function erasNameRegex(isStrict) {\n        if (!hasOwnProp(this, '_erasNameRegex')) {\n            computeErasParse.call(this);\n        }\n        return isStrict ? this._erasNameRegex : this._erasRegex;\n    }\n\n    function erasAbbrRegex(isStrict) {\n        if (!hasOwnProp(this, '_erasAbbrRegex')) {\n            computeErasParse.call(this);\n        }\n        return isStrict ? this._erasAbbrRegex : this._erasRegex;\n    }\n\n    function erasNarrowRegex(isStrict) {\n        if (!hasOwnProp(this, '_erasNarrowRegex')) {\n            computeErasParse.call(this);\n        }\n        return isStrict ? this._erasNarrowRegex : this._erasRegex;\n    }\n\n    function matchEraAbbr(isStrict, locale) {\n        return locale.erasAbbrRegex(isStrict);\n    }\n\n    function matchEraName(isStrict, locale) {\n        return locale.erasNameRegex(isStrict);\n    }\n\n    function matchEraNarrow(isStrict, locale) {\n        return locale.erasNarrowRegex(isStrict);\n    }\n\n    function matchEraYearOrdinal(isStrict, locale) {\n        return locale._eraYearOrdinalRegex || matchUnsigned;\n    }\n\n    function computeErasParse() {\n        var abbrPieces = [],\n            namePieces = [],\n            narrowPieces = [],\n            mixedPieces = [],\n            i,\n            l,\n            erasName,\n            erasAbbr,\n            erasNarrow,\n            eras = this.eras();\n\n        for (i = 0, l = eras.length; i < l; ++i) {\n            erasName = regexEscape(eras[i].name);\n            erasAbbr = regexEscape(eras[i].abbr);\n            erasNarrow = regexEscape(eras[i].narrow);\n\n            namePieces.push(erasName);\n            abbrPieces.push(erasAbbr);\n            narrowPieces.push(erasNarrow);\n            mixedPieces.push(erasName);\n            mixedPieces.push(erasAbbr);\n            mixedPieces.push(erasNarrow);\n        }\n\n        this._erasRegex = new RegExp('^(' + mixedPieces.join('|') + ')', 'i');\n        this._erasNameRegex = new RegExp('^(' + namePieces.join('|') + ')', 'i');\n        this._erasAbbrRegex = new RegExp('^(' + abbrPieces.join('|') + ')', 'i');\n        this._erasNarrowRegex = new RegExp(\n            '^(' + narrowPieces.join('|') + ')',\n            'i'\n        );\n    }\n\n    // FORMATTING\n\n    addFormatToken(0, ['gg', 2], 0, function () {\n        return this.weekYear() % 100;\n    });\n\n    addFormatToken(0, ['GG', 2], 0, function () {\n        return this.isoWeekYear() % 100;\n    });\n\n    function addWeekYearFormatToken(token, getter) {\n        addFormatToken(0, [token, token.length], 0, getter);\n    }\n\n    addWeekYearFormatToken('gggg', 'weekYear');\n    addWeekYearFormatToken('ggggg', 'weekYear');\n    addWeekYearFormatToken('GGGG', 'isoWeekYear');\n    addWeekYearFormatToken('GGGGG', 'isoWeekYear');\n\n    // ALIASES\n\n    // PARSING\n\n    addRegexToken('G', matchSigned);\n    addRegexToken('g', matchSigned);\n    addRegexToken('GG', match1to2, match2);\n    addRegexToken('gg', match1to2, match2);\n    addRegexToken('GGGG', match1to4, match4);\n    addRegexToken('gggg', match1to4, match4);\n    addRegexToken('GGGGG', match1to6, match6);\n    addRegexToken('ggggg', match1to6, match6);\n\n    addWeekParseToken(\n        ['gggg', 'ggggg', 'GGGG', 'GGGGG'],\n        function (input, week, config, token) {\n            week[token.substr(0, 2)] = toInt(input);\n        }\n    );\n\n    addWeekParseToken(['gg', 'GG'], function (input, week, config, token) {\n        week[token] = hooks.parseTwoDigitYear(input);\n    });\n\n    // MOMENTS\n\n    function getSetWeekYear(input) {\n        return getSetWeekYearHelper.call(\n            this,\n            input,\n            this.week(),\n            this.weekday() + this.localeData()._week.dow,\n            this.localeData()._week.dow,\n            this.localeData()._week.doy\n        );\n    }\n\n    function getSetISOWeekYear(input) {\n        return getSetWeekYearHelper.call(\n            this,\n            input,\n            this.isoWeek(),\n            this.isoWeekday(),\n            1,\n            4\n        );\n    }\n\n    function getISOWeeksInYear() {\n        return weeksInYear(this.year(), 1, 4);\n    }\n\n    function getISOWeeksInISOWeekYear() {\n        return weeksInYear(this.isoWeekYear(), 1, 4);\n    }\n\n    function getWeeksInYear() {\n        var weekInfo = this.localeData()._week;\n        return weeksInYear(this.year(), weekInfo.dow, weekInfo.doy);\n    }\n\n    function getWeeksInWeekYear() {\n        var weekInfo = this.localeData()._week;\n        return weeksInYear(this.weekYear(), weekInfo.dow, weekInfo.doy);\n    }\n\n    function getSetWeekYearHelper(input, week, weekday, dow, doy) {\n        var weeksTarget;\n        if (input == null) {\n            return weekOfYear(this, dow, doy).year;\n        } else {\n            weeksTarget = weeksInYear(input, dow, doy);\n            if (week > weeksTarget) {\n                week = weeksTarget;\n            }\n            return setWeekAll.call(this, input, week, weekday, dow, doy);\n        }\n    }\n\n    function setWeekAll(weekYear, week, weekday, dow, doy) {\n        var dayOfYearData = dayOfYearFromWeeks(weekYear, week, weekday, dow, doy),\n            date = createUTCDate(dayOfYearData.year, 0, dayOfYearData.dayOfYear);\n\n        this.year(date.getUTCFullYear());\n        this.month(date.getUTCMonth());\n        this.date(date.getUTCDate());\n        return this;\n    }\n\n    // FORMATTING\n\n    addFormatToken('Q', 0, 'Qo', 'quarter');\n\n    // PARSING\n\n    addRegexToken('Q', match1);\n    addParseToken('Q', function (input, array) {\n        array[MONTH] = (toInt(input) - 1) * 3;\n    });\n\n    // MOMENTS\n\n    function getSetQuarter(input) {\n        return input == null\n            ? Math.ceil((this.month() + 1) / 3)\n            : this.month((input - 1) * 3 + (this.month() % 3));\n    }\n\n    // FORMATTING\n\n    addFormatToken('D', ['DD', 2], 'Do', 'date');\n\n    // PARSING\n\n    addRegexToken('D', match1to2, match1to2NoLeadingZero);\n    addRegexToken('DD', match1to2, match2);\n    addRegexToken('Do', function (isStrict, locale) {\n        // TODO: Remove \"ordinalParse\" fallback in next major release.\n        return isStrict\n            ? locale._dayOfMonthOrdinalParse || locale._ordinalParse\n            : locale._dayOfMonthOrdinalParseLenient;\n    });\n\n    addParseToken(['D', 'DD'], DATE);\n    addParseToken('Do', function (input, array) {\n        array[DATE] = toInt(input.match(match1to2)[0]);\n    });\n\n    // MOMENTS\n\n    var getSetDayOfMonth = makeGetSet('Date', true);\n\n    // FORMATTING\n\n    addFormatToken('DDD', ['DDDD', 3], 'DDDo', 'dayOfYear');\n\n    // PARSING\n\n    addRegexToken('DDD', match1to3);\n    addRegexToken('DDDD', match3);\n    addParseToken(['DDD', 'DDDD'], function (input, array, config) {\n        config._dayOfYear = toInt(input);\n    });\n\n    // HELPERS\n\n    // MOMENTS\n\n    function getSetDayOfYear(input) {\n        var dayOfYear =\n            Math.round(\n                (this.clone().startOf('day') - this.clone().startOf('year')) / 864e5\n            ) + 1;\n        return input == null ? dayOfYear : this.add(input - dayOfYear, 'd');\n    }\n\n    // FORMATTING\n\n    addFormatToken('m', ['mm', 2], 0, 'minute');\n\n    // PARSING\n\n    addRegexToken('m', match1to2, match1to2HasZero);\n    addRegexToken('mm', match1to2, match2);\n    addParseToken(['m', 'mm'], MINUTE);\n\n    // MOMENTS\n\n    var getSetMinute = makeGetSet('Minutes', false);\n\n    // FORMATTING\n\n    addFormatToken('s', ['ss', 2], 0, 'second');\n\n    // PARSING\n\n    addRegexToken('s', match1to2, match1to2HasZero);\n    addRegexToken('ss', match1to2, match2);\n    addParseToken(['s', 'ss'], SECOND);\n\n    // MOMENTS\n\n    var getSetSecond = makeGetSet('Seconds', false);\n\n    // FORMATTING\n\n    addFormatToken('S', 0, 0, function () {\n        return ~~(this.millisecond() / 100);\n    });\n\n    addFormatToken(0, ['SS', 2], 0, function () {\n        return ~~(this.millisecond() / 10);\n    });\n\n    addFormatToken(0, ['SSS', 3], 0, 'millisecond');\n    addFormatToken(0, ['SSSS', 4], 0, function () {\n        return this.millisecond() * 10;\n    });\n    addFormatToken(0, ['SSSSS', 5], 0, function () {\n        return this.millisecond() * 100;\n    });\n    addFormatToken(0, ['SSSSSS', 6], 0, function () {\n        return this.millisecond() * 1000;\n    });\n    addFormatToken(0, ['SSSSSSS', 7], 0, function () {\n        return this.millisecond() * 10000;\n    });\n    addFormatToken(0, ['SSSSSSSS', 8], 0, function () {\n        return this.millisecond() * 100000;\n    });\n    addFormatToken(0, ['SSSSSSSSS', 9], 0, function () {\n        return this.millisecond() * 1000000;\n    });\n\n    // PARSING\n\n    addRegexToken('S', match1to3, match1);\n    addRegexToken('SS', match1to3, match2);\n    addRegexToken('SSS', match1to3, match3);\n\n    var token, getSetMillisecond;\n    for (token = 'SSSS'; token.length <= 9; token += 'S') {\n        addRegexToken(token, matchUnsigned);\n    }\n\n    function parseMs(input, array) {\n        array[MILLISECOND] = toInt(('0.' + input) * 1000);\n    }\n\n    for (token = 'S'; token.length <= 9; token += 'S') {\n        addParseToken(token, parseMs);\n    }\n\n    getSetMillisecond = makeGetSet('Milliseconds', false);\n\n    // FORMATTING\n\n    addFormatToken('z', 0, 0, 'zoneAbbr');\n    addFormatToken('zz', 0, 0, 'zoneName');\n\n    // MOMENTS\n\n    function getZoneAbbr() {\n        return this._isUTC ? 'UTC' : '';\n    }\n\n    function getZoneName() {\n        return this._isUTC ? 'Coordinated Universal Time' : '';\n    }\n\n    var proto = Moment.prototype;\n\n    proto.add = add;\n    proto.calendar = calendar$1;\n    proto.clone = clone;\n    proto.diff = diff;\n    proto.endOf = endOf;\n    proto.format = format;\n    proto.from = from;\n    proto.fromNow = fromNow;\n    proto.to = to;\n    proto.toNow = toNow;\n    proto.get = stringGet;\n    proto.invalidAt = invalidAt;\n    proto.isAfter = isAfter;\n    proto.isBefore = isBefore;\n    proto.isBetween = isBetween;\n    proto.isSame = isSame;\n    proto.isSameOrAfter = isSameOrAfter;\n    proto.isSameOrBefore = isSameOrBefore;\n    proto.isValid = isValid$2;\n    proto.lang = lang;\n    proto.locale = locale;\n    proto.localeData = localeData;\n    proto.max = prototypeMax;\n    proto.min = prototypeMin;\n    proto.parsingFlags = parsingFlags;\n    proto.set = stringSet;\n    proto.startOf = startOf;\n    proto.subtract = subtract;\n    proto.toArray = toArray;\n    proto.toObject = toObject;\n    proto.toDate = toDate;\n    proto.toISOString = toISOString;\n    proto.inspect = inspect;\n    if (typeof Symbol !== 'undefined' && Symbol.for != null) {\n        proto[Symbol.for('nodejs.util.inspect.custom')] = function () {\n            return 'Moment<' + this.format() + '>';\n        };\n    }\n    proto.toJSON = toJSON;\n    proto.toString = toString;\n    proto.unix = unix;\n    proto.valueOf = valueOf;\n    proto.creationData = creationData;\n    proto.eraName = getEraName;\n    proto.eraNarrow = getEraNarrow;\n    proto.eraAbbr = getEraAbbr;\n    proto.eraYear = getEraYear;\n    proto.year = getSetYear;\n    proto.isLeapYear = getIsLeapYear;\n    proto.weekYear = getSetWeekYear;\n    proto.isoWeekYear = getSetISOWeekYear;\n    proto.quarter = proto.quarters = getSetQuarter;\n    proto.month = getSetMonth;\n    proto.daysInMonth = getDaysInMonth;\n    proto.week = proto.weeks = getSetWeek;\n    proto.isoWeek = proto.isoWeeks = getSetISOWeek;\n    proto.weeksInYear = getWeeksInYear;\n    proto.weeksInWeekYear = getWeeksInWeekYear;\n    proto.isoWeeksInYear = getISOWeeksInYear;\n    proto.isoWeeksInISOWeekYear = getISOWeeksInISOWeekYear;\n    proto.date = getSetDayOfMonth;\n    proto.day = proto.days = getSetDayOfWeek;\n    proto.weekday = getSetLocaleDayOfWeek;\n    proto.isoWeekday = getSetISODayOfWeek;\n    proto.dayOfYear = getSetDayOfYear;\n    proto.hour = proto.hours = getSetHour;\n    proto.minute = proto.minutes = getSetMinute;\n    proto.second = proto.seconds = getSetSecond;\n    proto.millisecond = proto.milliseconds = getSetMillisecond;\n    proto.utcOffset = getSetOffset;\n    proto.utc = setOffsetToUTC;\n    proto.local = setOffsetToLocal;\n    proto.parseZone = setOffsetToParsedOffset;\n    proto.hasAlignedHourOffset = hasAlignedHourOffset;\n    proto.isDST = isDaylightSavingTime;\n    proto.isLocal = isLocal;\n    proto.isUtcOffset = isUtcOffset;\n    proto.isUtc = isUtc;\n    proto.isUTC = isUtc;\n    proto.zoneAbbr = getZoneAbbr;\n    proto.zoneName = getZoneName;\n    proto.dates = deprecate(\n        'dates accessor is deprecated. Use date instead.',\n        getSetDayOfMonth\n    );\n    proto.months = deprecate(\n        'months accessor is deprecated. Use month instead',\n        getSetMonth\n    );\n    proto.years = deprecate(\n        'years accessor is deprecated. Use year instead',\n        getSetYear\n    );\n    proto.zone = deprecate(\n        'moment().zone is deprecated, use moment().utcOffset instead. http://momentjs.com/guides/#/warnings/zone/',\n        getSetZone\n    );\n    proto.isDSTShifted = deprecate(\n        'isDSTShifted is deprecated. See http://momentjs.com/guides/#/warnings/dst-shifted/ for more information',\n        isDaylightSavingTimeShifted\n    );\n\n    function createUnix(input) {\n        return createLocal(input * 1000);\n    }\n\n    function createInZone() {\n        return createLocal.apply(null, arguments).parseZone();\n    }\n\n    function preParsePostFormat(string) {\n        return string;\n    }\n\n    var proto$1 = Locale.prototype;\n\n    proto$1.calendar = calendar;\n    proto$1.longDateFormat = longDateFormat;\n    proto$1.invalidDate = invalidDate;\n    proto$1.ordinal = ordinal;\n    proto$1.preparse = preParsePostFormat;\n    proto$1.postformat = preParsePostFormat;\n    proto$1.relativeTime = relativeTime;\n    proto$1.pastFuture = pastFuture;\n    proto$1.set = set;\n    proto$1.eras = localeEras;\n    proto$1.erasParse = localeErasParse;\n    proto$1.erasConvertYear = localeErasConvertYear;\n    proto$1.erasAbbrRegex = erasAbbrRegex;\n    proto$1.erasNameRegex = erasNameRegex;\n    proto$1.erasNarrowRegex = erasNarrowRegex;\n\n    proto$1.months = localeMonths;\n    proto$1.monthsShort = localeMonthsShort;\n    proto$1.monthsParse = localeMonthsParse;\n    proto$1.monthsRegex = monthsRegex;\n    proto$1.monthsShortRegex = monthsShortRegex;\n    proto$1.week = localeWeek;\n    proto$1.firstDayOfYear = localeFirstDayOfYear;\n    proto$1.firstDayOfWeek = localeFirstDayOfWeek;\n\n    proto$1.weekdays = localeWeekdays;\n    proto$1.weekdaysMin = localeWeekdaysMin;\n    proto$1.weekdaysShort = localeWeekdaysShort;\n    proto$1.weekdaysParse = localeWeekdaysParse;\n\n    proto$1.weekdaysRegex = weekdaysRegex;\n    proto$1.weekdaysShortRegex = weekdaysShortRegex;\n    proto$1.weekdaysMinRegex = weekdaysMinRegex;\n\n    proto$1.isPM = localeIsPM;\n    proto$1.meridiem = localeMeridiem;\n\n    function get$1(format, index, field, setter) {\n        var locale = getLocale(),\n            utc = createUTC().set(setter, index);\n        return locale[field](utc, format);\n    }\n\n    function listMonthsImpl(format, index, field) {\n        if (isNumber(format)) {\n            index = format;\n            format = undefined;\n        }\n\n        format = format || '';\n\n        if (index != null) {\n            return get$1(format, index, field, 'month');\n        }\n\n        var i,\n            out = [];\n        for (i = 0; i < 12; i++) {\n            out[i] = get$1(format, i, field, 'month');\n        }\n        return out;\n    }\n\n    // ()\n    // (5)\n    // (fmt, 5)\n    // (fmt)\n    // (true)\n    // (true, 5)\n    // (true, fmt, 5)\n    // (true, fmt)\n    function listWeekdaysImpl(localeSorted, format, index, field) {\n        if (typeof localeSorted === 'boolean') {\n            if (isNumber(format)) {\n                index = format;\n                format = undefined;\n            }\n\n            format = format || '';\n        } else {\n            format = localeSorted;\n            index = format;\n            localeSorted = false;\n\n            if (isNumber(format)) {\n                index = format;\n                format = undefined;\n            }\n\n            format = format || '';\n        }\n\n        var locale = getLocale(),\n            shift = localeSorted ? locale._week.dow : 0,\n            i,\n            out = [];\n\n        if (index != null) {\n            return get$1(format, (index + shift) % 7, field, 'day');\n        }\n\n        for (i = 0; i < 7; i++) {\n            out[i] = get$1(format, (i + shift) % 7, field, 'day');\n        }\n        return out;\n    }\n\n    function listMonths(format, index) {\n        return listMonthsImpl(format, index, 'months');\n    }\n\n    function listMonthsShort(format, index) {\n        return listMonthsImpl(format, index, 'monthsShort');\n    }\n\n    function listWeekdays(localeSorted, format, index) {\n        return listWeekdaysImpl(localeSorted, format, index, 'weekdays');\n    }\n\n    function listWeekdaysShort(localeSorted, format, index) {\n        return listWeekdaysImpl(localeSorted, format, index, 'weekdaysShort');\n    }\n\n    function listWeekdaysMin(localeSorted, format, index) {\n        return listWeekdaysImpl(localeSorted, format, index, 'weekdaysMin');\n    }\n\n    getSetGlobalLocale('en', {\n        eras: [\n            {\n                since: '0001-01-01',\n                until: +Infinity,\n                offset: 1,\n                name: 'Anno Domini',\n                narrow: 'AD',\n                abbr: 'AD',\n            },\n            {\n                since: '0000-12-31',\n                until: -Infinity,\n                offset: 1,\n                name: 'Before Christ',\n                narrow: 'BC',\n                abbr: 'BC',\n            },\n        ],\n        dayOfMonthOrdinalParse: /\\d{1,2}(th|st|nd|rd)/,\n        ordinal: function (number) {\n            var b = number % 10,\n                output =\n                    toInt((number % 100) / 10) === 1\n                        ? 'th'\n                        : b === 1\n                          ? 'st'\n                          : b === 2\n                            ? 'nd'\n                            : b === 3\n                              ? 'rd'\n                              : 'th';\n            return number + output;\n        },\n    });\n\n    // Side effect imports\n\n    hooks.lang = deprecate(\n        'moment.lang is deprecated. Use moment.locale instead.',\n        getSetGlobalLocale\n    );\n    hooks.langData = deprecate(\n        'moment.langData is deprecated. Use moment.localeData instead.',\n        getLocale\n    );\n\n    var mathAbs = Math.abs;\n\n    function abs() {\n        var data = this._data;\n\n        this._milliseconds = mathAbs(this._milliseconds);\n        this._days = mathAbs(this._days);\n        this._months = mathAbs(this._months);\n\n        data.milliseconds = mathAbs(data.milliseconds);\n        data.seconds = mathAbs(data.seconds);\n        data.minutes = mathAbs(data.minutes);\n        data.hours = mathAbs(data.hours);\n        data.months = mathAbs(data.months);\n        data.years = mathAbs(data.years);\n\n        return this;\n    }\n\n    function addSubtract$1(duration, input, value, direction) {\n        var other = createDuration(input, value);\n\n        duration._milliseconds += direction * other._milliseconds;\n        duration._days += direction * other._days;\n        duration._months += direction * other._months;\n\n        return duration._bubble();\n    }\n\n    // supports only 2.0-style add(1, 's') or add(duration)\n    function add$1(input, value) {\n        return addSubtract$1(this, input, value, 1);\n    }\n\n    // supports only 2.0-style subtract(1, 's') or subtract(duration)\n    function subtract$1(input, value) {\n        return addSubtract$1(this, input, value, -1);\n    }\n\n    function absCeil(number) {\n        if (number < 0) {\n            return Math.floor(number);\n        } else {\n            return Math.ceil(number);\n        }\n    }\n\n    function bubble() {\n        var milliseconds = this._milliseconds,\n            days = this._days,\n            months = this._months,\n            data = this._data,\n            seconds,\n            minutes,\n            hours,\n            years,\n            monthsFromDays;\n\n        // if we have a mix of positive and negative values, bubble down first\n        // check: https://github.com/moment/moment/issues/2166\n        if (\n            !(\n                (milliseconds >= 0 && days >= 0 && months >= 0) ||\n                (milliseconds <= 0 && days <= 0 && months <= 0)\n            )\n        ) {\n            milliseconds += absCeil(monthsToDays(months) + days) * 864e5;\n            days = 0;\n            months = 0;\n        }\n\n        // The following code bubbles up values, see the tests for\n        // examples of what that means.\n        data.milliseconds = milliseconds % 1000;\n\n        seconds = absFloor(milliseconds / 1000);\n        data.seconds = seconds % 60;\n\n        minutes = absFloor(seconds / 60);\n        data.minutes = minutes % 60;\n\n        hours = absFloor(minutes / 60);\n        data.hours = hours % 24;\n\n        days += absFloor(hours / 24);\n\n        // convert days to months\n        monthsFromDays = absFloor(daysToMonths(days));\n        months += monthsFromDays;\n        days -= absCeil(monthsToDays(monthsFromDays));\n\n        // 12 months -> 1 year\n        years = absFloor(months / 12);\n        months %= 12;\n\n        data.days = days;\n        data.months = months;\n        data.years = years;\n\n        return this;\n    }\n\n    function daysToMonths(days) {\n        // 400 years have 146097 days (taking into account leap year rules)\n        // 400 years have 12 months === 4800\n        return (days * 4800) / 146097;\n    }\n\n    function monthsToDays(months) {\n        // the reverse of daysToMonths\n        return (months * 146097) / 4800;\n    }\n\n    function as(units) {\n        if (!this.isValid()) {\n            return NaN;\n        }\n        var days,\n            months,\n            milliseconds = this._milliseconds;\n\n        units = normalizeUnits(units);\n\n        if (units === 'month' || units === 'quarter' || units === 'year') {\n            days = this._days + milliseconds / 864e5;\n            months = this._months + daysToMonths(days);\n            switch (units) {\n                case 'month':\n                    return months;\n                case 'quarter':\n                    return months / 3;\n                case 'year':\n                    return months / 12;\n            }\n        } else {\n            // handle milliseconds separately because of floating point math errors (issue #1867)\n            days = this._days + Math.round(monthsToDays(this._months));\n            switch (units) {\n                case 'week':\n                    return days / 7 + milliseconds / 6048e5;\n                case 'day':\n                    return days + milliseconds / 864e5;\n                case 'hour':\n                    return days * 24 + milliseconds / 36e5;\n                case 'minute':\n                    return days * 1440 + milliseconds / 6e4;\n                case 'second':\n                    return days * 86400 + milliseconds / 1000;\n                // Math.floor prevents floating point math errors here\n                case 'millisecond':\n                    return Math.floor(days * 864e5) + milliseconds;\n                default:\n                    throw new Error('Unknown unit ' + units);\n            }\n        }\n    }\n\n    function makeAs(alias) {\n        return function () {\n            return this.as(alias);\n        };\n    }\n\n    var asMilliseconds = makeAs('ms'),\n        asSeconds = makeAs('s'),\n        asMinutes = makeAs('m'),\n        asHours = makeAs('h'),\n        asDays = makeAs('d'),\n        asWeeks = makeAs('w'),\n        asMonths = makeAs('M'),\n        asQuarters = makeAs('Q'),\n        asYears = makeAs('y'),\n        valueOf$1 = asMilliseconds;\n\n    function clone$1() {\n        return createDuration(this);\n    }\n\n    function get$2(units) {\n        units = normalizeUnits(units);\n        return this.isValid() ? this[units + 's']() : NaN;\n    }\n\n    function makeGetter(name) {\n        return function () {\n            return this.isValid() ? this._data[name] : NaN;\n        };\n    }\n\n    var milliseconds = makeGetter('milliseconds'),\n        seconds = makeGetter('seconds'),\n        minutes = makeGetter('minutes'),\n        hours = makeGetter('hours'),\n        days = makeGetter('days'),\n        months = makeGetter('months'),\n        years = makeGetter('years');\n\n    function weeks() {\n        return absFloor(this.days() / 7);\n    }\n\n    var round = Math.round,\n        thresholds = {\n            ss: 44, // a few seconds to seconds\n            s: 45, // seconds to minute\n            m: 45, // minutes to hour\n            h: 22, // hours to day\n            d: 26, // days to month/week\n            w: null, // weeks to month\n            M: 11, // months to year\n        };\n\n    // helper function for moment.fn.from, moment.fn.fromNow, and moment.duration.fn.humanize\n    function substituteTimeAgo(string, number, withoutSuffix, isFuture, locale) {\n        return locale.relativeTime(number || 1, !!withoutSuffix, string, isFuture);\n    }\n\n    function relativeTime$1(posNegDuration, withoutSuffix, thresholds, locale) {\n        var duration = createDuration(posNegDuration).abs(),\n            seconds = round(duration.as('s')),\n            minutes = round(duration.as('m')),\n            hours = round(duration.as('h')),\n            days = round(duration.as('d')),\n            months = round(duration.as('M')),\n            weeks = round(duration.as('w')),\n            years = round(duration.as('y')),\n            a =\n                (seconds <= thresholds.ss && ['s', seconds]) ||\n                (seconds < thresholds.s && ['ss', seconds]) ||\n                (minutes <= 1 && ['m']) ||\n                (minutes < thresholds.m && ['mm', minutes]) ||\n                (hours <= 1 && ['h']) ||\n                (hours < thresholds.h && ['hh', hours]) ||\n                (days <= 1 && ['d']) ||\n                (days < thresholds.d && ['dd', days]);\n\n        if (thresholds.w != null) {\n            a =\n                a ||\n                (weeks <= 1 && ['w']) ||\n                (weeks < thresholds.w && ['ww', weeks]);\n        }\n        a = a ||\n            (months <= 1 && ['M']) ||\n            (months < thresholds.M && ['MM', months]) ||\n            (years <= 1 && ['y']) || ['yy', years];\n\n        a[2] = withoutSuffix;\n        a[3] = +posNegDuration > 0;\n        a[4] = locale;\n        return substituteTimeAgo.apply(null, a);\n    }\n\n    // This function allows you to set the rounding function for relative time strings\n    function getSetRelativeTimeRounding(roundingFunction) {\n        if (roundingFunction === undefined) {\n            return round;\n        }\n        if (typeof roundingFunction === 'function') {\n            round = roundingFunction;\n            return true;\n        }\n        return false;\n    }\n\n    // This function allows you to set a threshold for relative time strings\n    function getSetRelativeTimeThreshold(threshold, limit) {\n        if (thresholds[threshold] === undefined) {\n            return false;\n        }\n        if (limit === undefined) {\n            return thresholds[threshold];\n        }\n        thresholds[threshold] = limit;\n        if (threshold === 's') {\n            thresholds.ss = limit - 1;\n        }\n        return true;\n    }\n\n    function humanize(argWithSuffix, argThresholds) {\n        if (!this.isValid()) {\n            return this.localeData().invalidDate();\n        }\n\n        var withSuffix = false,\n            th = thresholds,\n            locale,\n            output;\n\n        if (typeof argWithSuffix === 'object') {\n            argThresholds = argWithSuffix;\n            argWithSuffix = false;\n        }\n        if (typeof argWithSuffix === 'boolean') {\n            withSuffix = argWithSuffix;\n        }\n        if (typeof argThresholds === 'object') {\n            th = Object.assign({}, thresholds, argThresholds);\n            if (argThresholds.s != null && argThresholds.ss == null) {\n                th.ss = argThresholds.s - 1;\n            }\n        }\n\n        locale = this.localeData();\n        output = relativeTime$1(this, !withSuffix, th, locale);\n\n        if (withSuffix) {\n            output = locale.pastFuture(+this, output);\n        }\n\n        return locale.postformat(output);\n    }\n\n    var abs$1 = Math.abs;\n\n    function sign(x) {\n        return (x > 0) - (x < 0) || +x;\n    }\n\n    function toISOString$1() {\n        // for ISO strings we do not use the normal bubbling rules:\n        //  * milliseconds bubble up until they become hours\n        //  * days do not bubble at all\n        //  * months bubble up until they become years\n        // This is because there is no context-free conversion between hours and days\n        // (think of clock changes)\n        // and also not between days and months (28-31 days per month)\n        if (!this.isValid()) {\n            return this.localeData().invalidDate();\n        }\n\n        var seconds = abs$1(this._milliseconds) / 1000,\n            days = abs$1(this._days),\n            months = abs$1(this._months),\n            minutes,\n            hours,\n            years,\n            s,\n            total = this.asSeconds(),\n            totalSign,\n            ymSign,\n            daysSign,\n            hmsSign;\n\n        if (!total) {\n            // this is the same as C#'s (Noda) and python (isodate)...\n            // but not other JS (goog.date)\n            return 'P0D';\n        }\n\n        // 3600 seconds -> 60 minutes -> 1 hour\n        minutes = absFloor(seconds / 60);\n        hours = absFloor(minutes / 60);\n        seconds %= 60;\n        minutes %= 60;\n\n        // 12 months -> 1 year\n        years = absFloor(months / 12);\n        months %= 12;\n\n        // inspired by https://github.com/dordille/moment-isoduration/blob/master/moment.isoduration.js\n        s = seconds ? seconds.toFixed(3).replace(/\\.?0+$/, '') : '';\n\n        totalSign = total < 0 ? '-' : '';\n        ymSign = sign(this._months) !== sign(total) ? '-' : '';\n        daysSign = sign(this._days) !== sign(total) ? '-' : '';\n        hmsSign = sign(this._milliseconds) !== sign(total) ? '-' : '';\n\n        return (\n            totalSign +\n            'P' +\n            (years ? ymSign + years + 'Y' : '') +\n            (months ? ymSign + months + 'M' : '') +\n            (days ? daysSign + days + 'D' : '') +\n            (hours || minutes || seconds ? 'T' : '') +\n            (hours ? hmsSign + hours + 'H' : '') +\n            (minutes ? hmsSign + minutes + 'M' : '') +\n            (seconds ? hmsSign + s + 'S' : '')\n        );\n    }\n\n    var proto$2 = Duration.prototype;\n\n    proto$2.isValid = isValid$1;\n    proto$2.abs = abs;\n    proto$2.add = add$1;\n    proto$2.subtract = subtract$1;\n    proto$2.as = as;\n    proto$2.asMilliseconds = asMilliseconds;\n    proto$2.asSeconds = asSeconds;\n    proto$2.asMinutes = asMinutes;\n    proto$2.asHours = asHours;\n    proto$2.asDays = asDays;\n    proto$2.asWeeks = asWeeks;\n    proto$2.asMonths = asMonths;\n    proto$2.asQuarters = asQuarters;\n    proto$2.asYears = asYears;\n    proto$2.valueOf = valueOf$1;\n    proto$2._bubble = bubble;\n    proto$2.clone = clone$1;\n    proto$2.get = get$2;\n    proto$2.milliseconds = milliseconds;\n    proto$2.seconds = seconds;\n    proto$2.minutes = minutes;\n    proto$2.hours = hours;\n    proto$2.days = days;\n    proto$2.weeks = weeks;\n    proto$2.months = months;\n    proto$2.years = years;\n    proto$2.humanize = humanize;\n    proto$2.toISOString = toISOString$1;\n    proto$2.toString = toISOString$1;\n    proto$2.toJSON = toISOString$1;\n    proto$2.locale = locale;\n    proto$2.localeData = localeData;\n\n    proto$2.toIsoString = deprecate(\n        'toIsoString() is deprecated. Please use toISOString() instead (notice the capitals)',\n        toISOString$1\n    );\n    proto$2.lang = lang;\n\n    // FORMATTING\n\n    addFormatToken('X', 0, 0, 'unix');\n    addFormatToken('x', 0, 0, 'valueOf');\n\n    // PARSING\n\n    addRegexToken('x', matchSigned);\n    addRegexToken('X', matchTimestamp);\n    addParseToken('X', function (input, array, config) {\n        config._d = new Date(parseFloat(input) * 1000);\n    });\n    addParseToken('x', function (input, array, config) {\n        config._d = new Date(toInt(input));\n    });\n\n    //! moment.js\n\n    hooks.version = '2.30.1';\n\n    setHookCallback(createLocal);\n\n    hooks.fn = proto;\n    hooks.min = min;\n    hooks.max = max;\n    hooks.now = now;\n    hooks.utc = createUTC;\n    hooks.unix = createUnix;\n    hooks.months = listMonths;\n    hooks.isDate = isDate;\n    hooks.locale = getSetGlobalLocale;\n    hooks.invalid = createInvalid;\n    hooks.duration = createDuration;\n    hooks.isMoment = isMoment;\n    hooks.weekdays = listWeekdays;\n    hooks.parseZone = createInZone;\n    hooks.localeData = getLocale;\n    hooks.isDuration = isDuration;\n    hooks.monthsShort = listMonthsShort;\n    hooks.weekdaysMin = listWeekdaysMin;\n    hooks.defineLocale = defineLocale;\n    hooks.updateLocale = updateLocale;\n    hooks.locales = listLocales;\n    hooks.weekdaysShort = listWeekdaysShort;\n    hooks.normalizeUnits = normalizeUnits;\n    hooks.relativeTimeRounding = getSetRelativeTimeRounding;\n    hooks.relativeTimeThreshold = getSetRelativeTimeThreshold;\n    hooks.calendarFormat = getCalendarFormat;\n    hooks.prototype = proto;\n\n    // currently HTML5 input type only supports 24-hour formats\n    hooks.HTML5_FMT = {\n        DATETIME_LOCAL: 'YYYY-MM-DDTHH:mm', // <input type=\"datetime-local\" />\n        DATETIME_LOCAL_SECONDS: 'YYYY-MM-DDTHH:mm:ss', // <input type=\"datetime-local\" step=\"1\" />\n        DATETIME_LOCAL_MS: 'YYYY-MM-DDTHH:mm:ss.SSS', // <input type=\"datetime-local\" step=\"0.001\" />\n        DATE: 'YYYY-MM-DD', // <input type=\"date\" />\n        TIME: 'HH:mm', // <input type=\"time\" />\n        TIME_SECONDS: 'HH:mm:ss', // <input type=\"time\" step=\"1\" />\n        TIME_MS: 'HH:mm:ss.SSS', // <input type=\"time\" step=\"0.001\" />\n        WEEK: 'GGGG-[W]WW', // <input type=\"week\" />\n        MONTH: 'YYYY-MM', // <input type=\"month\" />\n    };\n\n    return hooks;\n\n})));\n", "const {\n  entries,\n  setPrototypeOf,\n  isFrozen,\n  getPrototypeOf,\n  getOwnPropertyDescriptor,\n} = Object;\n\nlet { freeze, seal, create } = Object; // eslint-disable-line import/no-mutable-exports\nlet { apply, construct } = typeof Reflect !== 'undefined' && Reflect;\n\nif (!freeze) {\n  freeze = function (x) {\n    return x;\n  };\n}\n\nif (!seal) {\n  seal = function (x) {\n    return x;\n  };\n}\n\nif (!apply) {\n  apply = function (fun, thisValue, args) {\n    return fun.apply(thisValue, args);\n  };\n}\n\nif (!construct) {\n  construct = function (Func, args) {\n    return new Func(...args);\n  };\n}\n\nconst arrayForEach = unapply(Array.prototype.forEach);\nconst arrayIndexOf = unapply(Array.prototype.indexOf);\nconst arrayPop = unapply(Array.prototype.pop);\nconst arrayPush = unapply(Array.prototype.push);\nconst arraySlice = unapply(Array.prototype.slice);\n\nconst stringToLowerCase = unapply(String.prototype.toLowerCase);\nconst stringToString = unapply(String.prototype.toString);\nconst stringMatch = unapply(String.prototype.match);\nconst stringReplace = unapply(String.prototype.replace);\nconst stringIndexOf = unapply(String.prototype.indexOf);\nconst stringTrim = unapply(String.prototype.trim);\n\nconst regExpTest = unapply(RegExp.prototype.test);\n\nconst typeErrorCreate = unconstruct(TypeError);\n\n/**\n * Creates a new function that calls the given function with a specified thisArg and arguments.\n *\n * @param {Function} func - The function to be wrapped and called.\n * @returns {Function} A new function that calls the given function with a specified thisArg and arguments.\n */\nfunction unapply(func) {\n  return (thisArg, ...args) => apply(func, thisArg, args);\n}\n\n/**\n * Creates a new function that constructs an instance of the given constructor function with the provided arguments.\n *\n * @param {Function} func - The constructor function to be wrapped and called.\n * @returns {Function} A new function that constructs an instance of the given constructor function with the provided arguments.\n */\nfunction unconstruct(func) {\n  return (...args) => construct(func, args);\n}\n\n/**\n * Add properties to a lookup table\n *\n * @param {Object} set - The set to which elements will be added.\n * @param {Array} array - The array containing elements to be added to the set.\n * @param {Function} transformCaseFunc - An optional function to transform the case of each element before adding to the set.\n * @returns {Object} The modified set with added elements.\n */\nfunction addToSet(set, array, transformCaseFunc = stringToLowerCase) {\n  if (setPrototypeOf) {\n    // Make 'in' and truthy checks like Boolean(set.constructor)\n    // independent of any properties defined on Object.prototype.\n    // Prevent prototype setters from intercepting set as a this value.\n    setPrototypeOf(set, null);\n  }\n\n  let l = array.length;\n  while (l--) {\n    let element = array[l];\n    if (typeof element === 'string') {\n      const lcElement = transformCaseFunc(element);\n      if (lcElement !== element) {\n        // Config presets (e.g. tags.js, attrs.js) are immutable.\n        if (!isFrozen(array)) {\n          array[l] = lcElement;\n        }\n\n        element = lcElement;\n      }\n    }\n\n    set[element] = true;\n  }\n\n  return set;\n}\n\n/**\n * Clean up an array to harden against CSPP\n *\n * @param {Array} array - The array to be cleaned.\n * @returns {Array} The cleaned version of the array\n */\nfunction cleanArray(array) {\n  for (let index = 0; index < array.length; index++) {\n    if (getOwnPropertyDescriptor(array, index) === undefined) {\n      array[index] = null;\n    }\n  }\n\n  return array;\n}\n\n/**\n * Shallow clone an object\n *\n * @param {Object} object - The object to be cloned.\n * @returns {Object} A new object that copies the original.\n */\nfunction clone(object) {\n  const newObject = create(null);\n\n  for (const [property, value] of entries(object)) {\n    if (getOwnPropertyDescriptor(object, property) !== undefined) {\n      if (Array.isArray(value)) {\n        newObject[property] = cleanArray(value);\n      } else if (\n        value &&\n        typeof value === 'object' &&\n        value.constructor === Object\n      ) {\n        newObject[property] = clone(value);\n      } else {\n        newObject[property] = value;\n      }\n    }\n  }\n\n  return newObject;\n}\n\n/**\n * This method automatically checks if the prop is function or getter and behaves accordingly.\n *\n * @param {Object} object - The object to look up the getter function in its prototype chain.\n * @param {String} prop - The property name for which to find the getter function.\n * @returns {Function} The getter function found in the prototype chain or a fallback function.\n */\nfunction lookupGetter(object, prop) {\n  while (object !== null) {\n    const desc = getOwnPropertyDescriptor(object, prop);\n\n    if (desc) {\n      if (desc.get) {\n        return unapply(desc.get);\n      }\n\n      if (typeof desc.value === 'function') {\n        return unapply(desc.value);\n      }\n    }\n\n    object = getPrototypeOf(object);\n  }\n\n  function fallbackValue(element) {\n    console.warn('fallback value for', element);\n    return null;\n  }\n\n  return fallbackValue;\n}\n\nexport {\n  // Array\n  arrayForEach,\n  arrayIndexOf,\n  arrayPop,\n  arrayPush,\n  arraySlice,\n  // Object\n  entries,\n  freeze,\n  getPrototypeOf,\n  getOwnPropertyDescriptor,\n  isFrozen,\n  setPrototypeOf,\n  seal,\n  clone,\n  create,\n  // RegExp\n  regExpTest,\n  // String\n  stringIndexOf,\n  stringMatch,\n  stringReplace,\n  stringToLowerCase,\n  stringToString,\n  stringTrim,\n  // Errors\n  typeErrorCreate,\n  // Other\n  lookupGetter,\n  addToSet,\n  // Reflect\n  unapply,\n  unconstruct,\n};\n", "import { freeze } from './utils.js';\n\nexport const html = freeze([\n  'a',\n  'abbr',\n  'acronym',\n  'address',\n  'area',\n  'article',\n  'aside',\n  'audio',\n  'b',\n  'bdi',\n  'bdo',\n  'big',\n  'blink',\n  'blockquote',\n  'body',\n  'br',\n  'button',\n  'canvas',\n  'caption',\n  'center',\n  'cite',\n  'code',\n  'col',\n  'colgroup',\n  'content',\n  'data',\n  'datalist',\n  'dd',\n  'decorator',\n  'del',\n  'details',\n  'dfn',\n  'dialog',\n  'dir',\n  'div',\n  'dl',\n  'dt',\n  'element',\n  'em',\n  'fieldset',\n  'figcaption',\n  'figure',\n  'font',\n  'footer',\n  'form',\n  'h1',\n  'h2',\n  'h3',\n  'h4',\n  'h5',\n  'h6',\n  'head',\n  'header',\n  'hgroup',\n  'hr',\n  'html',\n  'i',\n  'img',\n  'input',\n  'ins',\n  'kbd',\n  'label',\n  'legend',\n  'li',\n  'main',\n  'map',\n  'mark',\n  'marquee',\n  'menu',\n  'menuitem',\n  'meter',\n  'nav',\n  'nobr',\n  'ol',\n  'optgroup',\n  'option',\n  'output',\n  'p',\n  'picture',\n  'pre',\n  'progress',\n  'q',\n  'rp',\n  'rt',\n  'ruby',\n  's',\n  'samp',\n  'section',\n  'select',\n  'shadow',\n  'small',\n  'source',\n  'spacer',\n  'span',\n  'strike',\n  'strong',\n  'style',\n  'sub',\n  'summary',\n  'sup',\n  'table',\n  'tbody',\n  'td',\n  'template',\n  'textarea',\n  'tfoot',\n  'th',\n  'thead',\n  'time',\n  'tr',\n  'track',\n  'tt',\n  'u',\n  'ul',\n  'var',\n  'video',\n  'wbr',\n]);\n\n// SVG\nexport const svg = freeze([\n  'svg',\n  'a',\n  'altglyph',\n  'altglyphdef',\n  'altglyphitem',\n  'animatecolor',\n  'animatemotion',\n  'animatetransform',\n  'circle',\n  'clippath',\n  'defs',\n  'desc',\n  'ellipse',\n  'filter',\n  'font',\n  'g',\n  'glyph',\n  'glyphref',\n  'hkern',\n  'image',\n  'line',\n  'lineargradient',\n  'marker',\n  'mask',\n  'metadata',\n  'mpath',\n  'path',\n  'pattern',\n  'polygon',\n  'polyline',\n  'radialgradient',\n  'rect',\n  'stop',\n  'style',\n  'switch',\n  'symbol',\n  'text',\n  'textpath',\n  'title',\n  'tref',\n  'tspan',\n  'view',\n  'vkern',\n]);\n\nexport const svgFilters = freeze([\n  'feBlend',\n  'feColorMatrix',\n  'feComponentTransfer',\n  'feComposite',\n  'feConvolveMatrix',\n  'feDiffuseLighting',\n  'feDisplacementMap',\n  'feDistantLight',\n  'feDropShadow',\n  'feFlood',\n  'feFuncA',\n  'feFuncB',\n  'feFuncG',\n  'feFuncR',\n  'feGaussianBlur',\n  'feImage',\n  'feMerge',\n  'feMergeNode',\n  'feMorphology',\n  'feOffset',\n  'fePointLight',\n  'feSpecularLighting',\n  'feSpotLight',\n  'feTile',\n  'feTurbulence',\n]);\n\n// List of SVG elements that are disallowed by default.\n// We still need to know them so that we can do namespace\n// checks properly in case one wants to add them to\n// allow-list.\nexport const svgDisallowed = freeze([\n  'animate',\n  'color-profile',\n  'cursor',\n  'discard',\n  'font-face',\n  'font-face-format',\n  'font-face-name',\n  'font-face-src',\n  'font-face-uri',\n  'foreignobject',\n  'hatch',\n  'hatchpath',\n  'mesh',\n  'meshgradient',\n  'meshpatch',\n  'meshrow',\n  'missing-glyph',\n  'script',\n  'set',\n  'solidcolor',\n  'unknown',\n  'use',\n]);\n\nexport const mathMl = freeze([\n  'math',\n  'menclose',\n  'merror',\n  'mfenced',\n  'mfrac',\n  'mglyph',\n  'mi',\n  'mlabeledtr',\n  'mmultiscripts',\n  'mn',\n  'mo',\n  'mover',\n  'mpadded',\n  'mphantom',\n  'mroot',\n  'mrow',\n  'ms',\n  'mspace',\n  'msqrt',\n  'mstyle',\n  'msub',\n  'msup',\n  'msubsup',\n  'mtable',\n  'mtd',\n  'mtext',\n  'mtr',\n  'munder',\n  'munderover',\n  'mprescripts',\n]);\n\n// Similarly to SVG, we want to know all MathML elements,\n// even those that we disallow by default.\nexport const mathMlDisallowed = freeze([\n  'maction',\n  'maligngroup',\n  'malignmark',\n  'mlongdiv',\n  'mscarries',\n  'mscarry',\n  'msgroup',\n  'mstack',\n  'msline',\n  'msrow',\n  'semantics',\n  'annotation',\n  'annotation-xml',\n  'mprescripts',\n  'none',\n]);\n\nexport const text = freeze(['#text']);\n", "import { freeze } from './utils.js';\n\nexport const html = freeze([\n  'accept',\n  'action',\n  'align',\n  'alt',\n  'autocapitalize',\n  'autocomplete',\n  'autopictureinpicture',\n  'autoplay',\n  'background',\n  'bgcolor',\n  'border',\n  'capture',\n  'cellpadding',\n  'cellspacing',\n  'checked',\n  'cite',\n  'class',\n  'clear',\n  'color',\n  'cols',\n  'colspan',\n  'controls',\n  'controlslist',\n  'coords',\n  'crossorigin',\n  'datetime',\n  'decoding',\n  'default',\n  'dir',\n  'disabled',\n  'disablepictureinpicture',\n  'disableremoteplayback',\n  'download',\n  'draggable',\n  'enctype',\n  'enterkeyhint',\n  'face',\n  'for',\n  'headers',\n  'height',\n  'hidden',\n  'high',\n  'href',\n  'hreflang',\n  'id',\n  'inputmode',\n  'integrity',\n  'ismap',\n  'kind',\n  'label',\n  'lang',\n  'list',\n  'loading',\n  'loop',\n  'low',\n  'max',\n  'maxlength',\n  'media',\n  'method',\n  'min',\n  'minlength',\n  'multiple',\n  'muted',\n  'name',\n  'nonce',\n  'noshade',\n  'novalidate',\n  'nowrap',\n  'open',\n  'optimum',\n  'pattern',\n  'placeholder',\n  'playsinline',\n  'poster',\n  'preload',\n  'pubdate',\n  'radiogroup',\n  'readonly',\n  'rel',\n  'required',\n  'rev',\n  'reversed',\n  'role',\n  'rows',\n  'rowspan',\n  'spellcheck',\n  'scope',\n  'selected',\n  'shape',\n  'size',\n  'sizes',\n  'span',\n  'srclang',\n  'start',\n  'src',\n  'srcset',\n  'step',\n  'style',\n  'summary',\n  'tabindex',\n  'title',\n  'translate',\n  'type',\n  'usemap',\n  'valign',\n  'value',\n  'width',\n  'xmlns',\n  'slot',\n]);\n\nexport const svg = freeze([\n  'accent-height',\n  'accumulate',\n  'additive',\n  'alignment-baseline',\n  'ascent',\n  'attributename',\n  'attributetype',\n  'azimuth',\n  'basefrequency',\n  'baseline-shift',\n  'begin',\n  'bias',\n  'by',\n  'class',\n  'clip',\n  'clippathunits',\n  'clip-path',\n  'clip-rule',\n  'color',\n  'color-interpolation',\n  'color-interpolation-filters',\n  'color-profile',\n  'color-rendering',\n  'cx',\n  'cy',\n  'd',\n  'dx',\n  'dy',\n  'diffuseconstant',\n  'direction',\n  'display',\n  'divisor',\n  'dur',\n  'edgemode',\n  'elevation',\n  'end',\n  'fill',\n  'fill-opacity',\n  'fill-rule',\n  'filter',\n  'filterunits',\n  'flood-color',\n  'flood-opacity',\n  'font-family',\n  'font-size',\n  'font-size-adjust',\n  'font-stretch',\n  'font-style',\n  'font-variant',\n  'font-weight',\n  'fx',\n  'fy',\n  'g1',\n  'g2',\n  'glyph-name',\n  'glyphref',\n  'gradientunits',\n  'gradienttransform',\n  'height',\n  'href',\n  'id',\n  'image-rendering',\n  'in',\n  'in2',\n  'k',\n  'k1',\n  'k2',\n  'k3',\n  'k4',\n  'kerning',\n  'keypoints',\n  'keysplines',\n  'keytimes',\n  'lang',\n  'lengthadjust',\n  'letter-spacing',\n  'kernelmatrix',\n  'kernelunitlength',\n  'lighting-color',\n  'local',\n  'marker-end',\n  'marker-mid',\n  'marker-start',\n  'markerheight',\n  'markerunits',\n  'markerwidth',\n  'maskcontentunits',\n  'maskunits',\n  'max',\n  'mask',\n  'media',\n  'method',\n  'mode',\n  'min',\n  'name',\n  'numoctaves',\n  'offset',\n  'operator',\n  'opacity',\n  'order',\n  'orient',\n  'orientation',\n  'origin',\n  'overflow',\n  'paint-order',\n  'path',\n  'pathlength',\n  'patterncontentunits',\n  'patterntransform',\n  'patternunits',\n  'points',\n  'preservealpha',\n  'preserveaspectratio',\n  'primitiveunits',\n  'r',\n  'rx',\n  'ry',\n  'radius',\n  'refx',\n  'refy',\n  'repeatcount',\n  'repeatdur',\n  'restart',\n  'result',\n  'rotate',\n  'scale',\n  'seed',\n  'shape-rendering',\n  'specularconstant',\n  'specularexponent',\n  'spreadmethod',\n  'startoffset',\n  'stddeviation',\n  'stitchtiles',\n  'stop-color',\n  'stop-opacity',\n  'stroke-dasharray',\n  'stroke-dashoffset',\n  'stroke-linecap',\n  'stroke-linejoin',\n  'stroke-miterlimit',\n  'stroke-opacity',\n  'stroke',\n  'stroke-width',\n  'style',\n  'surfacescale',\n  'systemlanguage',\n  'tabindex',\n  'targetx',\n  'targety',\n  'transform',\n  'transform-origin',\n  'text-anchor',\n  'text-decoration',\n  'text-rendering',\n  'textlength',\n  'type',\n  'u1',\n  'u2',\n  'unicode',\n  'values',\n  'viewbox',\n  'visibility',\n  'version',\n  'vert-adv-y',\n  'vert-origin-x',\n  'vert-origin-y',\n  'width',\n  'word-spacing',\n  'wrap',\n  'writing-mode',\n  'xchannelselector',\n  'ychannelselector',\n  'x',\n  'x1',\n  'x2',\n  'xmlns',\n  'y',\n  'y1',\n  'y2',\n  'z',\n  'zoomandpan',\n]);\n\nexport const mathMl = freeze([\n  'accent',\n  'accentunder',\n  'align',\n  'bevelled',\n  'close',\n  'columnsalign',\n  'columnlines',\n  'columnspan',\n  'denomalign',\n  'depth',\n  'dir',\n  'display',\n  'displaystyle',\n  'encoding',\n  'fence',\n  'frame',\n  'height',\n  'href',\n  'id',\n  'largeop',\n  'length',\n  'linethickness',\n  'lspace',\n  'lquote',\n  'mathbackground',\n  'mathcolor',\n  'mathsize',\n  'mathvariant',\n  'maxsize',\n  'minsize',\n  'movablelimits',\n  'notation',\n  'numalign',\n  'open',\n  'rowalign',\n  'rowlines',\n  'rowspacing',\n  'rowspan',\n  'rspace',\n  'rquote',\n  'scriptlevel',\n  'scriptminsize',\n  'scriptsizemultiplier',\n  'selection',\n  'separator',\n  'separators',\n  'stretchy',\n  'subscriptshift',\n  'supscriptshift',\n  'symmetric',\n  'voffset',\n  'width',\n  'xmlns',\n]);\n\nexport const xml = freeze([\n  'xlink:href',\n  'xml:id',\n  'xlink:title',\n  'xml:space',\n  'xmlns:xlink',\n]);\n", "import { seal } from './utils.js';\n\n// eslint-disable-next-line unicorn/better-regex\nexport const MUSTACHE_EXPR = seal(/\\{\\{[\\w\\W]*|[\\w\\W]*\\}\\}/gm); // Specify template detection regex for SAFE_FOR_TEMPLATES mode\nexport const ERB_EXPR = seal(/<%[\\w\\W]*|[\\w\\W]*%>/gm);\nexport const TMPLIT_EXPR = seal(/\\${[\\w\\W]*}/gm);\nexport const DATA_ATTR = seal(/^data-[\\-\\w.\\u00B7-\\uFFFF]/); // eslint-disable-line no-useless-escape\nexport const ARIA_ATTR = seal(/^aria-[\\-\\w]+$/); // eslint-disable-line no-useless-escape\nexport const IS_ALLOWED_URI = seal(\n  /^(?:(?:(?:f|ht)tps?|mailto|tel|callto|sms|cid|xmpp):|[^a-z]|[a-z+.\\-]+(?:[^a-z+.\\-:]|$))/i // eslint-disable-line no-useless-escape\n);\nexport const IS_SCRIPT_OR_DATA = seal(/^(?:\\w+script|data):/i);\nexport const ATTR_WHITESPACE = seal(\n  /[\\u0000-\\u0020\\u00A0\\u1680\\u180E\\u2000-\\u2029\\u205F\\u3000]/g // eslint-disable-line no-control-regex\n);\nexport const DOCTYPE_NAME = seal(/^html$/i);\n", "import * as TAGS from './tags.js';\nimport * as ATTRS from './attrs.js';\nimport * as EXPRESSIONS from './regexp.js';\nimport {\n  addToSet,\n  clone,\n  entries,\n  freeze,\n  arrayForEach,\n  arrayPop,\n  arrayPush,\n  stringMatch,\n  stringReplace,\n  stringToLowerCase,\n  stringToString,\n  stringIndexOf,\n  stringTrim,\n  regExpTest,\n  typeErrorCreate,\n  lookupGetter,\n  create,\n} from './utils.js';\n\nconst getGlobal = function () {\n  return typeof window === 'undefined' ? null : window;\n};\n\n/**\n * Creates a no-op policy for internal use only.\n * Don't export this function outside this module!\n * @param {TrustedTypePolicyFactory} trustedTypes The policy factory.\n * @param {HTMLScriptElement} purifyHostElement The Script element used to load DOMPurify (to determine policy name suffix).\n * @return {TrustedTypePolicy} The policy created (or null, if Trusted Types\n * are not supported or creating the policy failed).\n */\nconst _createTrustedTypesPolicy = function (trustedTypes, purifyHostElement) {\n  if (\n    typeof trustedTypes !== 'object' ||\n    typeof trustedTypes.createPolicy !== 'function'\n  ) {\n    return null;\n  }\n\n  // Allow the callers to control the unique policy name\n  // by adding a data-tt-policy-suffix to the script element with the DOMPurify.\n  // Policy creation with duplicate names throws in Trusted Types.\n  let suffix = null;\n  const ATTR_NAME = 'data-tt-policy-suffix';\n  if (purifyHostElement && purifyHostElement.hasAttribute(ATTR_NAME)) {\n    suffix = purifyHostElement.getAttribute(ATTR_NAME);\n  }\n\n  const policyName = 'dompurify' + (suffix ? '#' + suffix : '');\n\n  try {\n    return trustedTypes.createPolicy(policyName, {\n      createHTML(html) {\n        return html;\n      },\n      createScriptURL(scriptUrl) {\n        return scriptUrl;\n      },\n    });\n  } catch (_) {\n    // Policy creation failed (most likely another DOMPurify script has\n    // already run). Skip creating the policy, as this will only cause errors\n    // if TT are enforced.\n    console.warn(\n      'TrustedTypes policy ' + policyName + ' could not be created.'\n    );\n    return null;\n  }\n};\n\nfunction createDOMPurify(window = getGlobal()) {\n  const DOMPurify = (root) => createDOMPurify(root);\n\n  /**\n   * Version label, exposed for easier checks\n   * if DOMPurify is up to date or not\n   */\n  DOMPurify.version = VERSION;\n\n  /**\n   * Array of elements that DOMPurify removed during sanitation.\n   * Empty if nothing was removed.\n   */\n  DOMPurify.removed = [];\n\n  if (!window || !window.document || window.document.nodeType !== 9) {\n    // Not running in a browser, provide a factory function\n    // so that you can pass your own Window\n    DOMPurify.isSupported = false;\n\n    return DOMPurify;\n  }\n\n  let { document } = window;\n\n  const originalDocument = document;\n  const currentScript = originalDocument.currentScript;\n  const {\n    DocumentFragment,\n    HTMLTemplateElement,\n    Node,\n    Element,\n    NodeFilter,\n    NamedNodeMap = window.NamedNodeMap || window.MozNamedAttrMap,\n    HTMLFormElement,\n    DOMParser,\n    trustedTypes,\n  } = window;\n\n  const ElementPrototype = Element.prototype;\n\n  const cloneNode = lookupGetter(ElementPrototype, 'cloneNode');\n  const getNextSibling = lookupGetter(ElementPrototype, 'nextSibling');\n  const getChildNodes = lookupGetter(ElementPrototype, 'childNodes');\n  const getParentNode = lookupGetter(ElementPrototype, 'parentNode');\n\n  // As per issue #47, the web-components registry is inherited by a\n  // new document created via createHTMLDocument. As per the spec\n  // (http://w3c.github.io/webcomponents/spec/custom/#creating-and-passing-registries)\n  // a new empty registry is used when creating a template contents owner\n  // document, so we use that as our parent document to ensure nothing\n  // is inherited.\n  if (typeof HTMLTemplateElement === 'function') {\n    const template = document.createElement('template');\n    if (template.content && template.content.ownerDocument) {\n      document = template.content.ownerDocument;\n    }\n  }\n\n  let trustedTypesPolicy;\n  let emptyHTML = '';\n\n  const {\n    implementation,\n    createNodeIterator,\n    createDocumentFragment,\n    getElementsByTagName,\n  } = document;\n  const { importNode } = originalDocument;\n\n  let hooks = {};\n\n  /**\n   * Expose whether this browser supports running the full DOMPurify.\n   */\n  DOMPurify.isSupported =\n    typeof entries === 'function' &&\n    typeof getParentNode === 'function' &&\n    implementation &&\n    implementation.createHTMLDocument !== undefined;\n\n  const {\n    MUSTACHE_EXPR,\n    ERB_EXPR,\n    TMPLIT_EXPR,\n    DATA_ATTR,\n    ARIA_ATTR,\n    IS_SCRIPT_OR_DATA,\n    ATTR_WHITESPACE,\n  } = EXPRESSIONS;\n\n  let { IS_ALLOWED_URI } = EXPRESSIONS;\n\n  /**\n   * We consider the elements and attributes below to be safe. Ideally\n   * don't add any new ones but feel free to remove unwanted ones.\n   */\n\n  /* allowed element names */\n  let ALLOWED_TAGS = null;\n  const DEFAULT_ALLOWED_TAGS = addToSet({}, [\n    ...TAGS.html,\n    ...TAGS.svg,\n    ...TAGS.svgFilters,\n    ...TAGS.mathMl,\n    ...TAGS.text,\n  ]);\n\n  /* Allowed attribute names */\n  let ALLOWED_ATTR = null;\n  const DEFAULT_ALLOWED_ATTR = addToSet({}, [\n    ...ATTRS.html,\n    ...ATTRS.svg,\n    ...ATTRS.mathMl,\n    ...ATTRS.xml,\n  ]);\n\n  /*\n   * Configure how DOMPUrify should handle custom elements and their attributes as well as customized built-in elements.\n   * @property {RegExp|Function|null} tagNameCheck one of [null, regexPattern, predicate]. Default: `null` (disallow any custom elements)\n   * @property {RegExp|Function|null} attributeNameCheck one of [null, regexPattern, predicate]. Default: `null` (disallow any attributes not on the allow list)\n   * @property {boolean} allowCustomizedBuiltInElements allow custom elements derived from built-ins if they pass CUSTOM_ELEMENT_HANDLING.tagNameCheck. Default: `false`.\n   */\n  let CUSTOM_ELEMENT_HANDLING = Object.seal(\n    create(null, {\n      tagNameCheck: {\n        writable: true,\n        configurable: false,\n        enumerable: true,\n        value: null,\n      },\n      attributeNameCheck: {\n        writable: true,\n        configurable: false,\n        enumerable: true,\n        value: null,\n      },\n      allowCustomizedBuiltInElements: {\n        writable: true,\n        configurable: false,\n        enumerable: true,\n        value: false,\n      },\n    })\n  );\n\n  /* Explicitly forbidden tags (overrides ALLOWED_TAGS/ADD_TAGS) */\n  let FORBID_TAGS = null;\n\n  /* Explicitly forbidden attributes (overrides ALLOWED_ATTR/ADD_ATTR) */\n  let FORBID_ATTR = null;\n\n  /* Decide if ARIA attributes are okay */\n  let ALLOW_ARIA_ATTR = true;\n\n  /* Decide if custom data attributes are okay */\n  let ALLOW_DATA_ATTR = true;\n\n  /* Decide if unknown protocols are okay */\n  let ALLOW_UNKNOWN_PROTOCOLS = false;\n\n  /* Decide if self-closing tags in attributes are allowed.\n   * Usually removed due to a mXSS issue in jQuery 3.0 */\n  let ALLOW_SELF_CLOSE_IN_ATTR = true;\n\n  /* Output should be safe for common template engines.\n   * This means, DOMPurify removes data attributes, mustaches and ERB\n   */\n  let SAFE_FOR_TEMPLATES = false;\n\n  /* Decide if document with <html>... should be returned */\n  let WHOLE_DOCUMENT = false;\n\n  /* Track whether config is already set on this instance of DOMPurify. */\n  let SET_CONFIG = false;\n\n  /* Decide if all elements (e.g. style, script) must be children of\n   * document.body. By default, browsers might move them to document.head */\n  let FORCE_BODY = false;\n\n  /* Decide if a DOM `HTMLBodyElement` should be returned, instead of a html\n   * string (or a TrustedHTML object if Trusted Types are supported).\n   * If `WHOLE_DOCUMENT` is enabled a `HTMLHtmlElement` will be returned instead\n   */\n  let RETURN_DOM = false;\n\n  /* Decide if a DOM `DocumentFragment` should be returned, instead of a html\n   * string  (or a TrustedHTML object if Trusted Types are supported) */\n  let RETURN_DOM_FRAGMENT = false;\n\n  /* Try to return a Trusted Type object instead of a string, return a string in\n   * case Trusted Types are not supported  */\n  let RETURN_TRUSTED_TYPE = false;\n\n  /* Output should be free from DOM clobbering attacks?\n   * This sanitizes markups named with colliding, clobberable built-in DOM APIs.\n   */\n  let SANITIZE_DOM = true;\n\n  /* Achieve full DOM Clobbering protection by isolating the namespace of named\n   * properties and JS variables, mitigating attacks that abuse the HTML/DOM spec rules.\n   *\n   * HTML/DOM spec rules that enable DOM Clobbering:\n   *   - Named Access on Window (§7.3.3)\n   *   - DOM Tree Accessors (§3.1.5)\n   *   - Form Element Parent-Child Relations (§4.10.3)\n   *   - Iframe srcdoc / Nested WindowProxies (§4.8.5)\n   *   - HTMLCollection (§4.2.10.2)\n   *\n   * Namespace isolation is implemented by prefixing `id` and `name` attributes\n   * with a constant string, i.e., `user-content-`\n   */\n  let SANITIZE_NAMED_PROPS = false;\n  const SANITIZE_NAMED_PROPS_PREFIX = 'user-content-';\n\n  /* Keep element content when removing element? */\n  let KEEP_CONTENT = true;\n\n  /* If a `Node` is passed to sanitize(), then performs sanitization in-place instead\n   * of importing it into a new Document and returning a sanitized copy */\n  let IN_PLACE = false;\n\n  /* Allow usage of profiles like html, svg and mathMl */\n  let USE_PROFILES = {};\n\n  /* Tags to ignore content of when KEEP_CONTENT is true */\n  let FORBID_CONTENTS = null;\n  const DEFAULT_FORBID_CONTENTS = addToSet({}, [\n    'annotation-xml',\n    'audio',\n    'colgroup',\n    'desc',\n    'foreignobject',\n    'head',\n    'iframe',\n    'math',\n    'mi',\n    'mn',\n    'mo',\n    'ms',\n    'mtext',\n    'noembed',\n    'noframes',\n    'noscript',\n    'plaintext',\n    'script',\n    'style',\n    'svg',\n    'template',\n    'thead',\n    'title',\n    'video',\n    'xmp',\n  ]);\n\n  /* Tags that are safe for data: URIs */\n  let DATA_URI_TAGS = null;\n  const DEFAULT_DATA_URI_TAGS = addToSet({}, [\n    'audio',\n    'video',\n    'img',\n    'source',\n    'image',\n    'track',\n  ]);\n\n  /* Attributes safe for values like \"javascript:\" */\n  let URI_SAFE_ATTRIBUTES = null;\n  const DEFAULT_URI_SAFE_ATTRIBUTES = addToSet({}, [\n    'alt',\n    'class',\n    'for',\n    'id',\n    'label',\n    'name',\n    'pattern',\n    'placeholder',\n    'role',\n    'summary',\n    'title',\n    'value',\n    'style',\n    'xmlns',\n  ]);\n\n  const MATHML_NAMESPACE = 'http://www.w3.org/1998/Math/MathML';\n  const SVG_NAMESPACE = 'http://www.w3.org/2000/svg';\n  const HTML_NAMESPACE = 'http://www.w3.org/1999/xhtml';\n  /* Document namespace */\n  let NAMESPACE = HTML_NAMESPACE;\n  let IS_EMPTY_INPUT = false;\n\n  /* Allowed XHTML+XML namespaces */\n  let ALLOWED_NAMESPACES = null;\n  const DEFAULT_ALLOWED_NAMESPACES = addToSet(\n    {},\n    [MATHML_NAMESPACE, SVG_NAMESPACE, HTML_NAMESPACE],\n    stringToString\n  );\n\n  /* Parsing of strict XHTML documents */\n  let PARSER_MEDIA_TYPE = null;\n  const SUPPORTED_PARSER_MEDIA_TYPES = ['application/xhtml+xml', 'text/html'];\n  const DEFAULT_PARSER_MEDIA_TYPE = 'text/html';\n  let transformCaseFunc = null;\n\n  /* Keep a reference to config to pass to hooks */\n  let CONFIG = null;\n\n  /* Ideally, do not touch anything below this line */\n  /* ______________________________________________ */\n\n  const formElement = document.createElement('form');\n\n  const isRegexOrFunction = function (testValue) {\n    return testValue instanceof RegExp || testValue instanceof Function;\n  };\n\n  /**\n   * _parseConfig\n   *\n   * @param  {Object} cfg optional config literal\n   */\n  // eslint-disable-next-line complexity\n  const _parseConfig = function (cfg = {}) {\n    if (CONFIG && CONFIG === cfg) {\n      return;\n    }\n\n    /* Shield configuration object from tampering */\n    if (!cfg || typeof cfg !== 'object') {\n      cfg = {};\n    }\n\n    /* Shield configuration object from prototype pollution */\n    cfg = clone(cfg);\n\n    PARSER_MEDIA_TYPE =\n      // eslint-disable-next-line unicorn/prefer-includes\n      SUPPORTED_PARSER_MEDIA_TYPES.indexOf(cfg.PARSER_MEDIA_TYPE) === -1\n        ? DEFAULT_PARSER_MEDIA_TYPE\n        : cfg.PARSER_MEDIA_TYPE;\n\n    // HTML tags and attributes are not case-sensitive, converting to lowercase. Keeping XHTML as is.\n    transformCaseFunc =\n      PARSER_MEDIA_TYPE === 'application/xhtml+xml'\n        ? stringToString\n        : stringToLowerCase;\n\n    /* Set configuration parameters */\n    ALLOWED_TAGS =\n      'ALLOWED_TAGS' in cfg\n        ? addToSet({}, cfg.ALLOWED_TAGS, transformCaseFunc)\n        : DEFAULT_ALLOWED_TAGS;\n    ALLOWED_ATTR =\n      'ALLOWED_ATTR' in cfg\n        ? addToSet({}, cfg.ALLOWED_ATTR, transformCaseFunc)\n        : DEFAULT_ALLOWED_ATTR;\n    ALLOWED_NAMESPACES =\n      'ALLOWED_NAMESPACES' in cfg\n        ? addToSet({}, cfg.ALLOWED_NAMESPACES, stringToString)\n        : DEFAULT_ALLOWED_NAMESPACES;\n    URI_SAFE_ATTRIBUTES =\n      'ADD_URI_SAFE_ATTR' in cfg\n        ? addToSet(\n            clone(DEFAULT_URI_SAFE_ATTRIBUTES), // eslint-disable-line indent\n            cfg.ADD_URI_SAFE_ATTR, // eslint-disable-line indent\n            transformCaseFunc // eslint-disable-line indent\n          ) // eslint-disable-line indent\n        : DEFAULT_URI_SAFE_ATTRIBUTES;\n    DATA_URI_TAGS =\n      'ADD_DATA_URI_TAGS' in cfg\n        ? addToSet(\n            clone(DEFAULT_DATA_URI_TAGS), // eslint-disable-line indent\n            cfg.ADD_DATA_URI_TAGS, // eslint-disable-line indent\n            transformCaseFunc // eslint-disable-line indent\n          ) // eslint-disable-line indent\n        : DEFAULT_DATA_URI_TAGS;\n    FORBID_CONTENTS =\n      'FORBID_CONTENTS' in cfg\n        ? addToSet({}, cfg.FORBID_CONTENTS, transformCaseFunc)\n        : DEFAULT_FORBID_CONTENTS;\n    FORBID_TAGS =\n      'FORBID_TAGS' in cfg\n        ? addToSet({}, cfg.FORBID_TAGS, transformCaseFunc)\n        : {};\n    FORBID_ATTR =\n      'FORBID_ATTR' in cfg\n        ? addToSet({}, cfg.FORBID_ATTR, transformCaseFunc)\n        : {};\n    USE_PROFILES = 'USE_PROFILES' in cfg ? cfg.USE_PROFILES : false;\n    ALLOW_ARIA_ATTR = cfg.ALLOW_ARIA_ATTR !== false; // Default true\n    ALLOW_DATA_ATTR = cfg.ALLOW_DATA_ATTR !== false; // Default true\n    ALLOW_UNKNOWN_PROTOCOLS = cfg.ALLOW_UNKNOWN_PROTOCOLS || false; // Default false\n    ALLOW_SELF_CLOSE_IN_ATTR = cfg.ALLOW_SELF_CLOSE_IN_ATTR !== false; // Default true\n    SAFE_FOR_TEMPLATES = cfg.SAFE_FOR_TEMPLATES || false; // Default false\n    WHOLE_DOCUMENT = cfg.WHOLE_DOCUMENT || false; // Default false\n    RETURN_DOM = cfg.RETURN_DOM || false; // Default false\n    RETURN_DOM_FRAGMENT = cfg.RETURN_DOM_FRAGMENT || false; // Default false\n    RETURN_TRUSTED_TYPE = cfg.RETURN_TRUSTED_TYPE || false; // Default false\n    FORCE_BODY = cfg.FORCE_BODY || false; // Default false\n    SANITIZE_DOM = cfg.SANITIZE_DOM !== false; // Default true\n    SANITIZE_NAMED_PROPS = cfg.SANITIZE_NAMED_PROPS || false; // Default false\n    KEEP_CONTENT = cfg.KEEP_CONTENT !== false; // Default true\n    IN_PLACE = cfg.IN_PLACE || false; // Default false\n    IS_ALLOWED_URI = cfg.ALLOWED_URI_REGEXP || EXPRESSIONS.IS_ALLOWED_URI;\n    NAMESPACE = cfg.NAMESPACE || HTML_NAMESPACE;\n    CUSTOM_ELEMENT_HANDLING = cfg.CUSTOM_ELEMENT_HANDLING || {};\n    if (\n      cfg.CUSTOM_ELEMENT_HANDLING &&\n      isRegexOrFunction(cfg.CUSTOM_ELEMENT_HANDLING.tagNameCheck)\n    ) {\n      CUSTOM_ELEMENT_HANDLING.tagNameCheck =\n        cfg.CUSTOM_ELEMENT_HANDLING.tagNameCheck;\n    }\n\n    if (\n      cfg.CUSTOM_ELEMENT_HANDLING &&\n      isRegexOrFunction(cfg.CUSTOM_ELEMENT_HANDLING.attributeNameCheck)\n    ) {\n      CUSTOM_ELEMENT_HANDLING.attributeNameCheck =\n        cfg.CUSTOM_ELEMENT_HANDLING.attributeNameCheck;\n    }\n\n    if (\n      cfg.CUSTOM_ELEMENT_HANDLING &&\n      typeof cfg.CUSTOM_ELEMENT_HANDLING.allowCustomizedBuiltInElements ===\n        'boolean'\n    ) {\n      CUSTOM_ELEMENT_HANDLING.allowCustomizedBuiltInElements =\n        cfg.CUSTOM_ELEMENT_HANDLING.allowCustomizedBuiltInElements;\n    }\n\n    if (SAFE_FOR_TEMPLATES) {\n      ALLOW_DATA_ATTR = false;\n    }\n\n    if (RETURN_DOM_FRAGMENT) {\n      RETURN_DOM = true;\n    }\n\n    /* Parse profile info */\n    if (USE_PROFILES) {\n      ALLOWED_TAGS = addToSet({}, TAGS.text);\n      ALLOWED_ATTR = [];\n      if (USE_PROFILES.html === true) {\n        addToSet(ALLOWED_TAGS, TAGS.html);\n        addToSet(ALLOWED_ATTR, ATTRS.html);\n      }\n\n      if (USE_PROFILES.svg === true) {\n        addToSet(ALLOWED_TAGS, TAGS.svg);\n        addToSet(ALLOWED_ATTR, ATTRS.svg);\n        addToSet(ALLOWED_ATTR, ATTRS.xml);\n      }\n\n      if (USE_PROFILES.svgFilters === true) {\n        addToSet(ALLOWED_TAGS, TAGS.svgFilters);\n        addToSet(ALLOWED_ATTR, ATTRS.svg);\n        addToSet(ALLOWED_ATTR, ATTRS.xml);\n      }\n\n      if (USE_PROFILES.mathMl === true) {\n        addToSet(ALLOWED_TAGS, TAGS.mathMl);\n        addToSet(ALLOWED_ATTR, ATTRS.mathMl);\n        addToSet(ALLOWED_ATTR, ATTRS.xml);\n      }\n    }\n\n    /* Merge configuration parameters */\n    if (cfg.ADD_TAGS) {\n      if (ALLOWED_TAGS === DEFAULT_ALLOWED_TAGS) {\n        ALLOWED_TAGS = clone(ALLOWED_TAGS);\n      }\n\n      addToSet(ALLOWED_TAGS, cfg.ADD_TAGS, transformCaseFunc);\n    }\n\n    if (cfg.ADD_ATTR) {\n      if (ALLOWED_ATTR === DEFAULT_ALLOWED_ATTR) {\n        ALLOWED_ATTR = clone(ALLOWED_ATTR);\n      }\n\n      addToSet(ALLOWED_ATTR, cfg.ADD_ATTR, transformCaseFunc);\n    }\n\n    if (cfg.ADD_URI_SAFE_ATTR) {\n      addToSet(URI_SAFE_ATTRIBUTES, cfg.ADD_URI_SAFE_ATTR, transformCaseFunc);\n    }\n\n    if (cfg.FORBID_CONTENTS) {\n      if (FORBID_CONTENTS === DEFAULT_FORBID_CONTENTS) {\n        FORBID_CONTENTS = clone(FORBID_CONTENTS);\n      }\n\n      addToSet(FORBID_CONTENTS, cfg.FORBID_CONTENTS, transformCaseFunc);\n    }\n\n    /* Add #text in case KEEP_CONTENT is set to true */\n    if (KEEP_CONTENT) {\n      ALLOWED_TAGS['#text'] = true;\n    }\n\n    /* Add html, head and body to ALLOWED_TAGS in case WHOLE_DOCUMENT is true */\n    if (WHOLE_DOCUMENT) {\n      addToSet(ALLOWED_TAGS, ['html', 'head', 'body']);\n    }\n\n    /* Add tbody to ALLOWED_TAGS in case tables are permitted, see #286, #365 */\n    if (ALLOWED_TAGS.table) {\n      addToSet(ALLOWED_TAGS, ['tbody']);\n      delete FORBID_TAGS.tbody;\n    }\n\n    if (cfg.TRUSTED_TYPES_POLICY) {\n      if (typeof cfg.TRUSTED_TYPES_POLICY.createHTML !== 'function') {\n        throw typeErrorCreate(\n          'TRUSTED_TYPES_POLICY configuration option must provide a \"createHTML\" hook.'\n        );\n      }\n\n      if (typeof cfg.TRUSTED_TYPES_POLICY.createScriptURL !== 'function') {\n        throw typeErrorCreate(\n          'TRUSTED_TYPES_POLICY configuration option must provide a \"createScriptURL\" hook.'\n        );\n      }\n\n      // Overwrite existing TrustedTypes policy.\n      trustedTypesPolicy = cfg.TRUSTED_TYPES_POLICY;\n\n      // Sign local variables required by `sanitize`.\n      emptyHTML = trustedTypesPolicy.createHTML('');\n    } else {\n      // Uninitialized policy, attempt to initialize the internal dompurify policy.\n      if (trustedTypesPolicy === undefined) {\n        trustedTypesPolicy = _createTrustedTypesPolicy(\n          trustedTypes,\n          currentScript\n        );\n      }\n\n      // If creating the internal policy succeeded sign internal variables.\n      if (trustedTypesPolicy !== null && typeof emptyHTML === 'string') {\n        emptyHTML = trustedTypesPolicy.createHTML('');\n      }\n    }\n\n    // Prevent further manipulation of configuration.\n    // Not available in IE8, Safari 5, etc.\n    if (freeze) {\n      freeze(cfg);\n    }\n\n    CONFIG = cfg;\n  };\n\n  const MATHML_TEXT_INTEGRATION_POINTS = addToSet({}, [\n    'mi',\n    'mo',\n    'mn',\n    'ms',\n    'mtext',\n  ]);\n\n  const HTML_INTEGRATION_POINTS = addToSet({}, [\n    'foreignobject',\n    'desc',\n    'title',\n    'annotation-xml',\n  ]);\n\n  // Certain elements are allowed in both SVG and HTML\n  // namespace. We need to specify them explicitly\n  // so that they don't get erroneously deleted from\n  // HTML namespace.\n  const COMMON_SVG_AND_HTML_ELEMENTS = addToSet({}, [\n    'title',\n    'style',\n    'font',\n    'a',\n    'script',\n  ]);\n\n  /* Keep track of all possible SVG and MathML tags\n   * so that we can perform the namespace checks\n   * correctly. */\n  const ALL_SVG_TAGS = addToSet({}, [\n    ...TAGS.svg,\n    ...TAGS.svgFilters,\n    ...TAGS.svgDisallowed,\n  ]);\n  const ALL_MATHML_TAGS = addToSet({}, [\n    ...TAGS.mathMl,\n    ...TAGS.mathMlDisallowed,\n  ]);\n\n  /**\n   * @param  {Element} element a DOM element whose namespace is being checked\n   * @returns {boolean} Return false if the element has a\n   *  namespace that a spec-compliant parser would never\n   *  return. Return true otherwise.\n   */\n  const _checkValidNamespace = function (element) {\n    let parent = getParentNode(element);\n\n    // In JSDOM, if we're inside shadow DOM, then parentNode\n    // can be null. We just simulate parent in this case.\n    if (!parent || !parent.tagName) {\n      parent = {\n        namespaceURI: NAMESPACE,\n        tagName: 'template',\n      };\n    }\n\n    const tagName = stringToLowerCase(element.tagName);\n    const parentTagName = stringToLowerCase(parent.tagName);\n\n    if (!ALLOWED_NAMESPACES[element.namespaceURI]) {\n      return false;\n    }\n\n    if (element.namespaceURI === SVG_NAMESPACE) {\n      // The only way to switch from HTML namespace to SVG\n      // is via <svg>. If it happens via any other tag, then\n      // it should be killed.\n      if (parent.namespaceURI === HTML_NAMESPACE) {\n        return tagName === 'svg';\n      }\n\n      // The only way to switch from MathML to SVG is via`\n      // svg if parent is either <annotation-xml> or MathML\n      // text integration points.\n      if (parent.namespaceURI === MATHML_NAMESPACE) {\n        return (\n          tagName === 'svg' &&\n          (parentTagName === 'annotation-xml' ||\n            MATHML_TEXT_INTEGRATION_POINTS[parentTagName])\n        );\n      }\n\n      // We only allow elements that are defined in SVG\n      // spec. All others are disallowed in SVG namespace.\n      return Boolean(ALL_SVG_TAGS[tagName]);\n    }\n\n    if (element.namespaceURI === MATHML_NAMESPACE) {\n      // The only way to switch from HTML namespace to MathML\n      // is via <math>. If it happens via any other tag, then\n      // it should be killed.\n      if (parent.namespaceURI === HTML_NAMESPACE) {\n        return tagName === 'math';\n      }\n\n      // The only way to switch from SVG to MathML is via\n      // <math> and HTML integration points\n      if (parent.namespaceURI === SVG_NAMESPACE) {\n        return tagName === 'math' && HTML_INTEGRATION_POINTS[parentTagName];\n      }\n\n      // We only allow elements that are defined in MathML\n      // spec. All others are disallowed in MathML namespace.\n      return Boolean(ALL_MATHML_TAGS[tagName]);\n    }\n\n    if (element.namespaceURI === HTML_NAMESPACE) {\n      // The only way to switch from SVG to HTML is via\n      // HTML integration points, and from MathML to HTML\n      // is via MathML text integration points\n      if (\n        parent.namespaceURI === SVG_NAMESPACE &&\n        !HTML_INTEGRATION_POINTS[parentTagName]\n      ) {\n        return false;\n      }\n\n      if (\n        parent.namespaceURI === MATHML_NAMESPACE &&\n        !MATHML_TEXT_INTEGRATION_POINTS[parentTagName]\n      ) {\n        return false;\n      }\n\n      // We disallow tags that are specific for MathML\n      // or SVG and should never appear in HTML namespace\n      return (\n        !ALL_MATHML_TAGS[tagName] &&\n        (COMMON_SVG_AND_HTML_ELEMENTS[tagName] || !ALL_SVG_TAGS[tagName])\n      );\n    }\n\n    // For XHTML and XML documents that support custom namespaces\n    if (\n      PARSER_MEDIA_TYPE === 'application/xhtml+xml' &&\n      ALLOWED_NAMESPACES[element.namespaceURI]\n    ) {\n      return true;\n    }\n\n    // The code should never reach this place (this means\n    // that the element somehow got namespace that is not\n    // HTML, SVG, MathML or allowed via ALLOWED_NAMESPACES).\n    // Return false just in case.\n    return false;\n  };\n\n  /**\n   * _forceRemove\n   *\n   * @param  {Node} node a DOM node\n   */\n  const _forceRemove = function (node) {\n    arrayPush(DOMPurify.removed, { element: node });\n\n    try {\n      // eslint-disable-next-line unicorn/prefer-dom-node-remove\n      node.parentNode.removeChild(node);\n    } catch (_) {\n      node.remove();\n    }\n  };\n\n  /**\n   * _removeAttribute\n   *\n   * @param  {String} name an Attribute name\n   * @param  {Node} node a DOM node\n   */\n  const _removeAttribute = function (name, node) {\n    try {\n      arrayPush(DOMPurify.removed, {\n        attribute: node.getAttributeNode(name),\n        from: node,\n      });\n    } catch (_) {\n      arrayPush(DOMPurify.removed, {\n        attribute: null,\n        from: node,\n      });\n    }\n\n    node.removeAttribute(name);\n\n    // We void attribute values for unremovable \"is\"\" attributes\n    if (name === 'is' && !ALLOWED_ATTR[name]) {\n      if (RETURN_DOM || RETURN_DOM_FRAGMENT) {\n        try {\n          _forceRemove(node);\n        } catch (_) {}\n      } else {\n        try {\n          node.setAttribute(name, '');\n        } catch (_) {}\n      }\n    }\n  };\n\n  /**\n   * _initDocument\n   *\n   * @param  {String} dirty a string of dirty markup\n   * @return {Document} a DOM, filled with the dirty markup\n   */\n  const _initDocument = function (dirty) {\n    /* Create a HTML document */\n    let doc = null;\n    let leadingWhitespace = null;\n\n    if (FORCE_BODY) {\n      dirty = '<remove></remove>' + dirty;\n    } else {\n      /* If FORCE_BODY isn't used, leading whitespace needs to be preserved manually */\n      const matches = stringMatch(dirty, /^[\\r\\n\\t ]+/);\n      leadingWhitespace = matches && matches[0];\n    }\n\n    if (\n      PARSER_MEDIA_TYPE === 'application/xhtml+xml' &&\n      NAMESPACE === HTML_NAMESPACE\n    ) {\n      // Root of XHTML doc must contain xmlns declaration (see https://www.w3.org/TR/xhtml1/normative.html#strict)\n      dirty =\n        '<html xmlns=\"http://www.w3.org/1999/xhtml\"><head></head><body>' +\n        dirty +\n        '</body></html>';\n    }\n\n    const dirtyPayload = trustedTypesPolicy\n      ? trustedTypesPolicy.createHTML(dirty)\n      : dirty;\n    /*\n     * Use the DOMParser API by default, fallback later if needs be\n     * DOMParser not work for svg when has multiple root element.\n     */\n    if (NAMESPACE === HTML_NAMESPACE) {\n      try {\n        doc = new DOMParser().parseFromString(dirtyPayload, PARSER_MEDIA_TYPE);\n      } catch (_) {}\n    }\n\n    /* Use createHTMLDocument in case DOMParser is not available */\n    if (!doc || !doc.documentElement) {\n      doc = implementation.createDocument(NAMESPACE, 'template', null);\n      try {\n        doc.documentElement.innerHTML = IS_EMPTY_INPUT\n          ? emptyHTML\n          : dirtyPayload;\n      } catch (_) {\n        // Syntax error if dirtyPayload is invalid xml\n      }\n    }\n\n    const body = doc.body || doc.documentElement;\n\n    if (dirty && leadingWhitespace) {\n      body.insertBefore(\n        document.createTextNode(leadingWhitespace),\n        body.childNodes[0] || null\n      );\n    }\n\n    /* Work on whole document or just its body */\n    if (NAMESPACE === HTML_NAMESPACE) {\n      return getElementsByTagName.call(\n        doc,\n        WHOLE_DOCUMENT ? 'html' : 'body'\n      )[0];\n    }\n\n    return WHOLE_DOCUMENT ? doc.documentElement : body;\n  };\n\n  /**\n   * Creates a NodeIterator object that you can use to traverse filtered lists of nodes or elements in a document.\n   *\n   * @param  {Node} root The root element or node to start traversing on.\n   * @return {NodeIterator} The created NodeIterator\n   */\n  const _createNodeIterator = function (root) {\n    return createNodeIterator.call(\n      root.ownerDocument || root,\n      root,\n      // eslint-disable-next-line no-bitwise\n      NodeFilter.SHOW_ELEMENT | NodeFilter.SHOW_COMMENT | NodeFilter.SHOW_TEXT,\n      null\n    );\n  };\n\n  /**\n   * _isClobbered\n   *\n   * @param  {Node} elm element to check for clobbering attacks\n   * @return {Boolean} true if clobbered, false if safe\n   */\n  const _isClobbered = function (elm) {\n    return (\n      elm instanceof HTMLFormElement &&\n      (typeof elm.nodeName !== 'string' ||\n        typeof elm.textContent !== 'string' ||\n        typeof elm.removeChild !== 'function' ||\n        !(elm.attributes instanceof NamedNodeMap) ||\n        typeof elm.removeAttribute !== 'function' ||\n        typeof elm.setAttribute !== 'function' ||\n        typeof elm.namespaceURI !== 'string' ||\n        typeof elm.insertBefore !== 'function' ||\n        typeof elm.hasChildNodes !== 'function')\n    );\n  };\n\n  /**\n   * Checks whether the given object is a DOM node.\n   *\n   * @param  {Node} object object to check whether it's a DOM node\n   * @return {Boolean} true is object is a DOM node\n   */\n  const _isNode = function (object) {\n    return typeof Node === 'function' && object instanceof Node;\n  };\n\n  /**\n   * _executeHook\n   * Execute user configurable hooks\n   *\n   * @param  {String} entryPoint  Name of the hook's entry point\n   * @param  {Node} currentNode node to work on with the hook\n   * @param  {Object} data additional hook parameters\n   */\n  const _executeHook = function (entryPoint, currentNode, data) {\n    if (!hooks[entryPoint]) {\n      return;\n    }\n\n    arrayForEach(hooks[entryPoint], (hook) => {\n      hook.call(DOMPurify, currentNode, data, CONFIG);\n    });\n  };\n\n  /**\n   * _sanitizeElements\n   *\n   * @protect nodeName\n   * @protect textContent\n   * @protect removeChild\n   *\n   * @param   {Node} currentNode to check for permission to exist\n   * @return  {Boolean} true if node was killed, false if left alive\n   */\n  const _sanitizeElements = function (currentNode) {\n    let content = null;\n\n    /* Execute a hook if present */\n    _executeHook('beforeSanitizeElements', currentNode, null);\n\n    /* Check if element is clobbered or can clobber */\n    if (_isClobbered(currentNode)) {\n      _forceRemove(currentNode);\n      return true;\n    }\n\n    /* Now let's check the element's type and name */\n    const tagName = transformCaseFunc(currentNode.nodeName);\n\n    /* Execute a hook if present */\n    _executeHook('uponSanitizeElement', currentNode, {\n      tagName,\n      allowedTags: ALLOWED_TAGS,\n    });\n\n    /* Detect mXSS attempts abusing namespace confusion */\n    if (\n      currentNode.hasChildNodes() &&\n      !_isNode(currentNode.firstElementChild) &&\n      regExpTest(/<[/\\w]/g, currentNode.innerHTML) &&\n      regExpTest(/<[/\\w]/g, currentNode.textContent)\n    ) {\n      _forceRemove(currentNode);\n      return true;\n    }\n\n    /* Remove element if anything forbids its presence */\n    if (!ALLOWED_TAGS[tagName] || FORBID_TAGS[tagName]) {\n      /* Check if we have a custom element to handle */\n      if (!FORBID_TAGS[tagName] && _isBasicCustomElement(tagName)) {\n        if (\n          CUSTOM_ELEMENT_HANDLING.tagNameCheck instanceof RegExp &&\n          regExpTest(CUSTOM_ELEMENT_HANDLING.tagNameCheck, tagName)\n        ) {\n          return false;\n        }\n\n        if (\n          CUSTOM_ELEMENT_HANDLING.tagNameCheck instanceof Function &&\n          CUSTOM_ELEMENT_HANDLING.tagNameCheck(tagName)\n        ) {\n          return false;\n        }\n      }\n\n      /* Keep content except for bad-listed elements */\n      if (KEEP_CONTENT && !FORBID_CONTENTS[tagName]) {\n        const parentNode = getParentNode(currentNode) || currentNode.parentNode;\n        const childNodes = getChildNodes(currentNode) || currentNode.childNodes;\n\n        if (childNodes && parentNode) {\n          const childCount = childNodes.length;\n\n          for (let i = childCount - 1; i >= 0; --i) {\n            parentNode.insertBefore(\n              cloneNode(childNodes[i], true),\n              getNextSibling(currentNode)\n            );\n          }\n        }\n      }\n\n      _forceRemove(currentNode);\n      return true;\n    }\n\n    /* Check whether element has a valid namespace */\n    if (currentNode instanceof Element && !_checkValidNamespace(currentNode)) {\n      _forceRemove(currentNode);\n      return true;\n    }\n\n    /* Make sure that older browsers don't get fallback-tag mXSS */\n    if (\n      (tagName === 'noscript' ||\n        tagName === 'noembed' ||\n        tagName === 'noframes') &&\n      regExpTest(/<\\/no(script|embed|frames)/i, currentNode.innerHTML)\n    ) {\n      _forceRemove(currentNode);\n      return true;\n    }\n\n    /* Sanitize element content to be template-safe */\n    if (SAFE_FOR_TEMPLATES && currentNode.nodeType === 3) {\n      /* Get the element's text content */\n      content = currentNode.textContent;\n\n      arrayForEach([MUSTACHE_EXPR, ERB_EXPR, TMPLIT_EXPR], (expr) => {\n        content = stringReplace(content, expr, ' ');\n      });\n\n      if (currentNode.textContent !== content) {\n        arrayPush(DOMPurify.removed, { element: currentNode.cloneNode() });\n        currentNode.textContent = content;\n      }\n    }\n\n    /* Execute a hook if present */\n    _executeHook('afterSanitizeElements', currentNode, null);\n\n    return false;\n  };\n\n  /**\n   * _isValidAttribute\n   *\n   * @param  {string} lcTag Lowercase tag name of containing element.\n   * @param  {string} lcName Lowercase attribute name.\n   * @param  {string} value Attribute value.\n   * @return {Boolean} Returns true if `value` is valid, otherwise false.\n   */\n  // eslint-disable-next-line complexity\n  const _isValidAttribute = function (lcTag, lcName, value) {\n    /* Make sure attribute cannot clobber */\n    if (\n      SANITIZE_DOM &&\n      (lcName === 'id' || lcName === 'name') &&\n      (value in document || value in formElement)\n    ) {\n      return false;\n    }\n\n    /* Allow valid data-* attributes: At least one character after \"-\"\n        (https://html.spec.whatwg.org/multipage/dom.html#embedding-custom-non-visible-data-with-the-data-*-attributes)\n        XML-compatible (https://html.spec.whatwg.org/multipage/infrastructure.html#xml-compatible and http://www.w3.org/TR/xml/#d0e804)\n        We don't need to check the value; it's always URI safe. */\n    if (\n      ALLOW_DATA_ATTR &&\n      !FORBID_ATTR[lcName] &&\n      regExpTest(DATA_ATTR, lcName)\n    ) {\n      // This attribute is safe\n    } else if (ALLOW_ARIA_ATTR && regExpTest(ARIA_ATTR, lcName)) {\n      // This attribute is safe\n      /* Otherwise, check the name is permitted */\n    } else if (!ALLOWED_ATTR[lcName] || FORBID_ATTR[lcName]) {\n      if (\n        // First condition does a very basic check if a) it's basically a valid custom element tagname AND\n        // b) if the tagName passes whatever the user has configured for CUSTOM_ELEMENT_HANDLING.tagNameCheck\n        // and c) if the attribute name passes whatever the user has configured for CUSTOM_ELEMENT_HANDLING.attributeNameCheck\n        (_isBasicCustomElement(lcTag) &&\n          ((CUSTOM_ELEMENT_HANDLING.tagNameCheck instanceof RegExp &&\n            regExpTest(CUSTOM_ELEMENT_HANDLING.tagNameCheck, lcTag)) ||\n            (CUSTOM_ELEMENT_HANDLING.tagNameCheck instanceof Function &&\n              CUSTOM_ELEMENT_HANDLING.tagNameCheck(lcTag))) &&\n          ((CUSTOM_ELEMENT_HANDLING.attributeNameCheck instanceof RegExp &&\n            regExpTest(CUSTOM_ELEMENT_HANDLING.attributeNameCheck, lcName)) ||\n            (CUSTOM_ELEMENT_HANDLING.attributeNameCheck instanceof Function &&\n              CUSTOM_ELEMENT_HANDLING.attributeNameCheck(lcName)))) ||\n        // Alternative, second condition checks if it's an `is`-attribute, AND\n        // the value passes whatever the user has configured for CUSTOM_ELEMENT_HANDLING.tagNameCheck\n        (lcName === 'is' &&\n          CUSTOM_ELEMENT_HANDLING.allowCustomizedBuiltInElements &&\n          ((CUSTOM_ELEMENT_HANDLING.tagNameCheck instanceof RegExp &&\n            regExpTest(CUSTOM_ELEMENT_HANDLING.tagNameCheck, value)) ||\n            (CUSTOM_ELEMENT_HANDLING.tagNameCheck instanceof Function &&\n              CUSTOM_ELEMENT_HANDLING.tagNameCheck(value))))\n      ) {\n        // If user has supplied a regexp or function in CUSTOM_ELEMENT_HANDLING.tagNameCheck, we need to also allow derived custom elements using the same tagName test.\n        // Additionally, we need to allow attributes passing the CUSTOM_ELEMENT_HANDLING.attributeNameCheck user has configured, as custom elements can define these at their own discretion.\n      } else {\n        return false;\n      }\n      /* Check value is safe. First, is attr inert? If so, is safe */\n    } else if (URI_SAFE_ATTRIBUTES[lcName]) {\n      // This attribute is safe\n      /* Check no script, data or unknown possibly unsafe URI\n        unless we know URI values are safe for that attribute */\n    } else if (\n      regExpTest(IS_ALLOWED_URI, stringReplace(value, ATTR_WHITESPACE, ''))\n    ) {\n      // This attribute is safe\n      /* Keep image data URIs alive if src/xlink:href is allowed */\n      /* Further prevent gadget XSS for dynamically built script tags */\n    } else if (\n      (lcName === 'src' || lcName === 'xlink:href' || lcName === 'href') &&\n      lcTag !== 'script' &&\n      stringIndexOf(value, 'data:') === 0 &&\n      DATA_URI_TAGS[lcTag]\n    ) {\n      // This attribute is safe\n      /* Allow unknown protocols: This provides support for links that\n        are handled by protocol handlers which may be unknown ahead of\n        time, e.g. fb:, spotify: */\n    } else if (\n      ALLOW_UNKNOWN_PROTOCOLS &&\n      !regExpTest(IS_SCRIPT_OR_DATA, stringReplace(value, ATTR_WHITESPACE, ''))\n    ) {\n      // This attribute is safe\n      /* Check for binary attributes */\n    } else if (value) {\n      return false;\n    } else {\n      // Binary attributes are safe at this point\n      /* Anything else, presume unsafe, do not add it back */\n    }\n\n    return true;\n  };\n\n  /**\n   * _isBasicCustomElement\n   * checks if at least one dash is included in tagName, and it's not the first char\n   * for more sophisticated checking see https://github.com/sindresorhus/validate-element-name\n   *\n   * @param {string} tagName name of the tag of the node to sanitize\n   * @returns {boolean} Returns true if the tag name meets the basic criteria for a custom element, otherwise false.\n   */\n  const _isBasicCustomElement = function (tagName) {\n    return tagName.indexOf('-') > 0;\n  };\n\n  /**\n   * _sanitizeAttributes\n   *\n   * @protect attributes\n   * @protect nodeName\n   * @protect removeAttribute\n   * @protect setAttribute\n   *\n   * @param  {Node} currentNode to sanitize\n   */\n  const _sanitizeAttributes = function (currentNode) {\n    /* Execute a hook if present */\n    _executeHook('beforeSanitizeAttributes', currentNode, null);\n\n    const { attributes } = currentNode;\n\n    /* Check if we have attributes; if not we might have a text node */\n    if (!attributes) {\n      return;\n    }\n\n    const hookEvent = {\n      attrName: '',\n      attrValue: '',\n      keepAttr: true,\n      allowedAttributes: ALLOWED_ATTR,\n    };\n    let l = attributes.length;\n\n    /* Go backwards over all attributes; safely remove bad ones */\n    while (l--) {\n      const attr = attributes[l];\n      const { name, namespaceURI, value: attrValue } = attr;\n      const lcName = transformCaseFunc(name);\n\n      let value = name === 'value' ? attrValue : stringTrim(attrValue);\n\n      /* Execute a hook if present */\n      hookEvent.attrName = lcName;\n      hookEvent.attrValue = value;\n      hookEvent.keepAttr = true;\n      hookEvent.forceKeepAttr = undefined; // Allows developers to see this is a property they can set\n      _executeHook('uponSanitizeAttribute', currentNode, hookEvent);\n      value = hookEvent.attrValue;\n      /* Did the hooks approve of the attribute? */\n      if (hookEvent.forceKeepAttr) {\n        continue;\n      }\n\n      /* Remove attribute */\n      _removeAttribute(name, currentNode);\n\n      /* Did the hooks approve of the attribute? */\n      if (!hookEvent.keepAttr) {\n        continue;\n      }\n\n      /* Work around a security issue in jQuery 3.0 */\n      if (!ALLOW_SELF_CLOSE_IN_ATTR && regExpTest(/\\/>/i, value)) {\n        _removeAttribute(name, currentNode);\n        continue;\n      }\n\n      /* Sanitize attribute content to be template-safe */\n      if (SAFE_FOR_TEMPLATES) {\n        arrayForEach([MUSTACHE_EXPR, ERB_EXPR, TMPLIT_EXPR], (expr) => {\n          value = stringReplace(value, expr, ' ');\n        });\n      }\n\n      /* Is `value` valid for this attribute? */\n      const lcTag = transformCaseFunc(currentNode.nodeName);\n      if (!_isValidAttribute(lcTag, lcName, value)) {\n        continue;\n      }\n\n      /* Full DOM Clobbering protection via namespace isolation,\n       * Prefix id and name attributes with `user-content-`\n       */\n      if (SANITIZE_NAMED_PROPS && (lcName === 'id' || lcName === 'name')) {\n        // Remove the attribute with this value\n        _removeAttribute(name, currentNode);\n\n        // Prefix the value and later re-create the attribute with the sanitized value\n        value = SANITIZE_NAMED_PROPS_PREFIX + value;\n      }\n\n      /* Handle attributes that require Trusted Types */\n      if (\n        trustedTypesPolicy &&\n        typeof trustedTypes === 'object' &&\n        typeof trustedTypes.getAttributeType === 'function'\n      ) {\n        if (namespaceURI) {\n          /* Namespaces are not yet supported, see https://bugs.chromium.org/p/chromium/issues/detail?id=1305293 */\n        } else {\n          switch (trustedTypes.getAttributeType(lcTag, lcName)) {\n            case 'TrustedHTML': {\n              value = trustedTypesPolicy.createHTML(value);\n              break;\n            }\n\n            case 'TrustedScriptURL': {\n              value = trustedTypesPolicy.createScriptURL(value);\n              break;\n            }\n\n            default: {\n              break;\n            }\n          }\n        }\n      }\n\n      /* Handle invalid data-* attribute set by try-catching it */\n      try {\n        if (namespaceURI) {\n          currentNode.setAttributeNS(namespaceURI, name, value);\n        } else {\n          /* Fallback to setAttribute() for browser-unrecognized namespaces e.g. \"x-schema\". */\n          currentNode.setAttribute(name, value);\n        }\n\n        arrayPop(DOMPurify.removed);\n      } catch (_) {}\n    }\n\n    /* Execute a hook if present */\n    _executeHook('afterSanitizeAttributes', currentNode, null);\n  };\n\n  /**\n   * _sanitizeShadowDOM\n   *\n   * @param  {DocumentFragment} fragment to iterate over recursively\n   */\n  const _sanitizeShadowDOM = function (fragment) {\n    let shadowNode = null;\n    const shadowIterator = _createNodeIterator(fragment);\n\n    /* Execute a hook if present */\n    _executeHook('beforeSanitizeShadowDOM', fragment, null);\n\n    while ((shadowNode = shadowIterator.nextNode())) {\n      /* Execute a hook if present */\n      _executeHook('uponSanitizeShadowNode', shadowNode, null);\n\n      /* Sanitize tags and elements */\n      if (_sanitizeElements(shadowNode)) {\n        continue;\n      }\n\n      /* Deep shadow DOM detected */\n      if (shadowNode.content instanceof DocumentFragment) {\n        _sanitizeShadowDOM(shadowNode.content);\n      }\n\n      /* Check attributes, sanitize if necessary */\n      _sanitizeAttributes(shadowNode);\n    }\n\n    /* Execute a hook if present */\n    _executeHook('afterSanitizeShadowDOM', fragment, null);\n  };\n\n  /**\n   * Sanitize\n   * Public method providing core sanitation functionality\n   *\n   * @param {String|Node} dirty string or DOM node\n   * @param {Object} cfg object\n   */\n  // eslint-disable-next-line complexity\n  DOMPurify.sanitize = function (dirty, cfg = {}) {\n    let body = null;\n    let importedNode = null;\n    let currentNode = null;\n    let returnNode = null;\n    /* Make sure we have a string to sanitize.\n      DO NOT return early, as this will return the wrong type if\n      the user has requested a DOM object rather than a string */\n    IS_EMPTY_INPUT = !dirty;\n    if (IS_EMPTY_INPUT) {\n      dirty = '<!-->';\n    }\n\n    /* Stringify, in case dirty is an object */\n    if (typeof dirty !== 'string' && !_isNode(dirty)) {\n      if (typeof dirty.toString === 'function') {\n        dirty = dirty.toString();\n        if (typeof dirty !== 'string') {\n          throw typeErrorCreate('dirty is not a string, aborting');\n        }\n      } else {\n        throw typeErrorCreate('toString is not a function');\n      }\n    }\n\n    /* Return dirty HTML if DOMPurify cannot run */\n    if (!DOMPurify.isSupported) {\n      return dirty;\n    }\n\n    /* Assign config vars */\n    if (!SET_CONFIG) {\n      _parseConfig(cfg);\n    }\n\n    /* Clean up removed elements */\n    DOMPurify.removed = [];\n\n    /* Check if dirty is correctly typed for IN_PLACE */\n    if (typeof dirty === 'string') {\n      IN_PLACE = false;\n    }\n\n    if (IN_PLACE) {\n      /* Do some early pre-sanitization to avoid unsafe root nodes */\n      if (dirty.nodeName) {\n        const tagName = transformCaseFunc(dirty.nodeName);\n        if (!ALLOWED_TAGS[tagName] || FORBID_TAGS[tagName]) {\n          throw typeErrorCreate(\n            'root node is forbidden and cannot be sanitized in-place'\n          );\n        }\n      }\n    } else if (dirty instanceof Node) {\n      /* If dirty is a DOM element, append to an empty document to avoid\n         elements being stripped by the parser */\n      body = _initDocument('<!---->');\n      importedNode = body.ownerDocument.importNode(dirty, true);\n      if (importedNode.nodeType === 1 && importedNode.nodeName === 'BODY') {\n        /* Node is already a body, use as is */\n        body = importedNode;\n      } else if (importedNode.nodeName === 'HTML') {\n        body = importedNode;\n      } else {\n        // eslint-disable-next-line unicorn/prefer-dom-node-append\n        body.appendChild(importedNode);\n      }\n    } else {\n      /* Exit directly if we have nothing to do */\n      if (\n        !RETURN_DOM &&\n        !SAFE_FOR_TEMPLATES &&\n        !WHOLE_DOCUMENT &&\n        // eslint-disable-next-line unicorn/prefer-includes\n        dirty.indexOf('<') === -1\n      ) {\n        return trustedTypesPolicy && RETURN_TRUSTED_TYPE\n          ? trustedTypesPolicy.createHTML(dirty)\n          : dirty;\n      }\n\n      /* Initialize the document to work on */\n      body = _initDocument(dirty);\n\n      /* Check we have a DOM node from the data */\n      if (!body) {\n        return RETURN_DOM ? null : RETURN_TRUSTED_TYPE ? emptyHTML : '';\n      }\n    }\n\n    /* Remove first element node (ours) if FORCE_BODY is set */\n    if (body && FORCE_BODY) {\n      _forceRemove(body.firstChild);\n    }\n\n    /* Get node iterator */\n    const nodeIterator = _createNodeIterator(IN_PLACE ? dirty : body);\n\n    /* Now start iterating over the created document */\n    while ((currentNode = nodeIterator.nextNode())) {\n      /* Sanitize tags and elements */\n      if (_sanitizeElements(currentNode)) {\n        continue;\n      }\n\n      /* Shadow DOM detected, sanitize it */\n      if (currentNode.content instanceof DocumentFragment) {\n        _sanitizeShadowDOM(currentNode.content);\n      }\n\n      /* Check attributes, sanitize if necessary */\n      _sanitizeAttributes(currentNode);\n    }\n\n    /* If we sanitized `dirty` in-place, return it. */\n    if (IN_PLACE) {\n      return dirty;\n    }\n\n    /* Return sanitized string or DOM */\n    if (RETURN_DOM) {\n      if (RETURN_DOM_FRAGMENT) {\n        returnNode = createDocumentFragment.call(body.ownerDocument);\n\n        while (body.firstChild) {\n          // eslint-disable-next-line unicorn/prefer-dom-node-append\n          returnNode.appendChild(body.firstChild);\n        }\n      } else {\n        returnNode = body;\n      }\n\n      if (ALLOWED_ATTR.shadowroot || ALLOWED_ATTR.shadowrootmode) {\n        /*\n          AdoptNode() is not used because internal state is not reset\n          (e.g. the past names map of a HTMLFormElement), this is safe\n          in theory but we would rather not risk another attack vector.\n          The state that is cloned by importNode() is explicitly defined\n          by the specs.\n        */\n        returnNode = importNode.call(originalDocument, returnNode, true);\n      }\n\n      return returnNode;\n    }\n\n    let serializedHTML = WHOLE_DOCUMENT ? body.outerHTML : body.innerHTML;\n\n    /* Serialize doctype if allowed */\n    if (\n      WHOLE_DOCUMENT &&\n      ALLOWED_TAGS['!doctype'] &&\n      body.ownerDocument &&\n      body.ownerDocument.doctype &&\n      body.ownerDocument.doctype.name &&\n      regExpTest(EXPRESSIONS.DOCTYPE_NAME, body.ownerDocument.doctype.name)\n    ) {\n      serializedHTML =\n        '<!DOCTYPE ' + body.ownerDocument.doctype.name + '>\\n' + serializedHTML;\n    }\n\n    /* Sanitize final string template-safe */\n    if (SAFE_FOR_TEMPLATES) {\n      arrayForEach([MUSTACHE_EXPR, ERB_EXPR, TMPLIT_EXPR], (expr) => {\n        serializedHTML = stringReplace(serializedHTML, expr, ' ');\n      });\n    }\n\n    return trustedTypesPolicy && RETURN_TRUSTED_TYPE\n      ? trustedTypesPolicy.createHTML(serializedHTML)\n      : serializedHTML;\n  };\n\n  /**\n   * Public method to set the configuration once\n   * setConfig\n   *\n   * @param {Object} cfg configuration object\n   */\n  DOMPurify.setConfig = function (cfg = {}) {\n    _parseConfig(cfg);\n    SET_CONFIG = true;\n  };\n\n  /**\n   * Public method to remove the configuration\n   * clearConfig\n   *\n   */\n  DOMPurify.clearConfig = function () {\n    CONFIG = null;\n    SET_CONFIG = false;\n  };\n\n  /**\n   * Public method to check if an attribute value is valid.\n   * Uses last set config, if any. Otherwise, uses config defaults.\n   * isValidAttribute\n   *\n   * @param  {String} tag Tag name of containing element.\n   * @param  {String} attr Attribute name.\n   * @param  {String} value Attribute value.\n   * @return {Boolean} Returns true if `value` is valid. Otherwise, returns false.\n   */\n  DOMPurify.isValidAttribute = function (tag, attr, value) {\n    /* Initialize shared config vars if necessary. */\n    if (!CONFIG) {\n      _parseConfig({});\n    }\n\n    const lcTag = transformCaseFunc(tag);\n    const lcName = transformCaseFunc(attr);\n    return _isValidAttribute(lcTag, lcName, value);\n  };\n\n  /**\n   * AddHook\n   * Public method to add DOMPurify hooks\n   *\n   * @param {String} entryPoint entry point for the hook to add\n   * @param {Function} hookFunction function to execute\n   */\n  DOMPurify.addHook = function (entryPoint, hookFunction) {\n    if (typeof hookFunction !== 'function') {\n      return;\n    }\n\n    hooks[entryPoint] = hooks[entryPoint] || [];\n    arrayPush(hooks[entryPoint], hookFunction);\n  };\n\n  /**\n   * RemoveHook\n   * Public method to remove a DOMPurify hook at a given entryPoint\n   * (pops it from the stack of hooks if more are present)\n   *\n   * @param {String} entryPoint entry point for the hook to remove\n   * @return {Function} removed(popped) hook\n   */\n  DOMPurify.removeHook = function (entryPoint) {\n    if (hooks[entryPoint]) {\n      return arrayPop(hooks[entryPoint]);\n    }\n  };\n\n  /**\n   * RemoveHooks\n   * Public method to remove all DOMPurify hooks at a given entryPoint\n   *\n   * @param  {String} entryPoint entry point for the hooks to remove\n   */\n  DOMPurify.removeHooks = function (entryPoint) {\n    if (hooks[entryPoint]) {\n      hooks[entryPoint] = [];\n    }\n  };\n\n  /**\n   * RemoveAllHooks\n   * Public method to remove all DOMPurify hooks\n   */\n  DOMPurify.removeAllHooks = function () {\n    hooks = {};\n  };\n\n  return DOMPurify;\n}\n\nexport default createDOMPurify();\n", "export function _ajax(platformSpecificDriver, timeoutErrorMessageIdent, requestFailedMessageIdent, mkHeader, options) {\n  return function (errback, callback) {\n    var xhr = platformSpecificDriver.newXHR();\n    var fixedUrl = platformSpecificDriver.fixupUrl(options.url, xhr);\n    xhr.open(options.method || \"GET\", fixedUrl, true, options.username, options.password);\n    if (options.headers) {\n      try {\n        // eslint-disable-next-line no-eq-null,eqeqeq\n        for (var i = 0, header; (header = options.headers[i]) != null; i++) {\n          xhr.setRequestHeader(header.field, header.value);\n        }\n      } catch (e) {\n        errback(e);\n      }\n    }\n    var onerror = function (msgIdent) {\n      return function () {\n        errback(new Error(msgIdent));\n      };\n    };\n    xhr.onerror = onerror(requestFailedMessageIdent);\n    xhr.ontimeout = onerror(timeoutErrorMessageIdent);\n    xhr.onload = function () {\n      callback({\n        status: xhr.status,\n        statusText: xhr.statusText,\n        headers: xhr.getAllResponseHeaders().split(\"\\r\\n\")\n          .filter(function (header) {\n            return header.length > 0;\n          })\n          .map(function (header) {\n            var i = header.indexOf(\":\");\n            return mkHeader(header.substring(0, i))(header.substring(i + 2));\n          }),\n        body: xhr.response\n      });\n    };\n    xhr.responseType = options.responseType;\n    xhr.withCredentials = options.withCredentials;\n    xhr.timeout = options.timeout;\n    xhr.send(options.content);\n\n    return function (error, cancelErrback, cancelCallback) {\n      try {\n        xhr.abort();\n      } catch (e) {\n        return cancelErrback(e);\n      }\n      return cancelCallback();\n    };\n  };\n}\n", "export const arrayMap = function (f) {\n  return function (arr) {\n    var l = arr.length;\n    var result = new Array(l);\n    for (var i = 0; i < l; i++) {\n      result[i] = f(arr[i]);\n    }\n    return result;\n  };\n};\n", "module Control.Semigroupoid where\n\n-- | A `Semigroupoid` is similar to a [`Category`](#category) but does not\n-- | require an identity element `identity`, just composable morphisms.\n-- |\n-- | `Semigroupoid`s must satisfy the following law:\n-- |\n-- | - Associativity: `p <<< (q <<< r) = (p <<< q) <<< r`\n-- |\n-- | One example of a `Semigroupoid` is the function type constructor `(->)`,\n-- | with `(<<<)` defined as function composition.\nclass Semigroupoid :: forall k. (k -> k -> Type) -> Constraint\nclass Semigroupoid a where\n  compose :: forall b c d. a c d -> a b c -> a b d\n\ninstance semigroupoidFn :: Semigroupoid (->) where\n  compose f g x = f (g x)\n\ninfixr 9 compose as <<<\n\n-- | Forwards composition, or `compose` with its arguments reversed.\ncomposeFlipped :: forall a b c d. Semigroupoid a => a b c -> a c d -> a b d\ncomposeFlipped f g = compose g f\n\ninfixr 9 composeFlipped as >>>\n", "module Control.Category\n  ( class Category\n  , identity\n  , module Control.Semigroupoid\n  ) where\n\nimport Control.Semigroupoid (class Semigroupoid, compose, (<<<), (>>>))\n\n-- | `Category`s consist of objects and composable morphisms between them, and\n-- | as such are [`Semigroupoids`](#semigroupoid), but unlike `semigroupoids`\n-- | must have an identity element.\n-- |\n-- | Instances must satisfy the following law in addition to the\n-- | `Semigroupoid` law:\n-- |\n-- | - Identity: `identity <<< p = p <<< identity = p`\nclass Category :: forall k. (k -> k -> Type) -> Constraint\nclass Semigroupoid a <= Category a where\n  identity :: forall t. a t t\n\ninstance categoryFn :: Category (->) where\n  identity x = x\n", "module Data.Boolean where\n\n-- | An alias for `true`, which can be useful in guard clauses:\n-- |\n-- | ```purescript\n-- | max x y | x >= y    = x\n-- |         | otherwise = y\n-- | ```\notherwise :: Boolean\notherwise = true\n", "module Data.Function\n  ( flip\n  , const\n  , apply\n  , ($)\n  , applyFlipped\n  , (#)\n  , applyN\n  , on\n  , module Control.Category\n  ) where\n\nimport Control.Category (identity, compose, (<<<), (>>>))\nimport Data.Boolean (otherwise)\nimport Data.Ord ((<=))\nimport Data.Ring ((-))\n\n-- | Given a function that takes two arguments, applies the arguments\n-- | to the function in a swapped order.\n-- |\n-- | ```purescript\n-- | flip append \"1\" \"2\" == append \"2\" \"1\" == \"21\"\n-- |\n-- | const 1 \"two\" == 1\n-- |\n-- | flip const 1 \"two\" == const \"two\" 1 == \"two\"\n-- | ```\nflip :: forall a b c. (a -> b -> c) -> b -> a -> c\nflip f b a = f a b\n\n-- | Returns its first argument and ignores its second.\n-- |\n-- | ```purescript\n-- | const 1 \"hello\" = 1\n-- | ```\n-- |\n-- | It can also be thought of as creating a function that ignores its argument:\n-- |\n-- | ```purescript\n-- | const 1 = \\_ -> 1\n-- | ```\nconst :: forall a b. a -> b -> a\nconst a _ = a\n\n-- | Applies a function to an argument. This is primarily used as the operator\n-- | `($)` which allows parentheses to be omitted in some cases, or as a\n-- | natural way to apply a chain of composed functions to a value.\napply :: forall a b. (a -> b) -> a -> b\napply f x = f x\n\n-- | Applies a function to an argument: the reverse of `(#)`.\n-- |\n-- | ```purescript\n-- | length $ groupBy productCategory $ filter isInStock $ products\n-- | ```\n-- |\n-- | is equivalent to:\n-- |\n-- | ```purescript\n-- | length (groupBy productCategory (filter isInStock products))\n-- | ```\n-- |\n-- | Or another alternative equivalent, applying chain of composed functions to\n-- | a value:\n-- |\n-- | ```purescript\n-- | length <<< groupBy productCategory <<< filter isInStock $ products\n-- | ```\ninfixr 0 apply as $\n\n-- | Applies an argument to a function. This is primarily used as the `(#)`\n-- | operator, which allows parentheses to be omitted in some cases, or as a\n-- | natural way to apply a value to a chain of composed functions.\napplyFlipped :: forall a b. a -> (a -> b) -> b\napplyFlipped x f = f x\n\n-- | Applies an argument to a function: the reverse of `($)`.\n-- |\n-- | ```purescript\n-- | products # filter isInStock # groupBy productCategory # length\n-- | ```\n-- |\n-- | is equivalent to:\n-- |\n-- | ```purescript\n-- | length (groupBy productCategory (filter isInStock products))\n-- | ```\n-- |\n-- | Or another alternative equivalent, applying a value to a chain of composed\n-- | functions:\n-- |\n-- | ```purescript\n-- | products # filter isInStock >>> groupBy productCategory >>> length\n-- | ```\ninfixl 1 applyFlipped as #\n\n-- | `applyN f n` applies the function `f` to its argument `n` times.\n-- |\n-- | If n is less than or equal to 0, the function is not applied.\n-- |\n-- | ```purescript\n-- | applyN (_ + 1) 10 0 == 10\n-- | ```\napplyN :: forall a. (a -> a) -> Int -> a -> a\napplyN f = go\n  where\n  go n acc\n    | n <= 0 = acc\n    | otherwise = go (n - 1) (f acc)\n\n-- | The `on` function is used to change the domain of a binary operator.\n-- |\n-- | For example, we can create a function which compares two records based on the values of their `x` properties:\n-- |\n-- | ```purescript\n-- | compareX :: forall r. { x :: Number | r } -> { x :: Number | r } -> Ordering\n-- | compareX = compare `on` _.x\n-- | ```\non :: forall a b c. (b -> b -> c) -> (a -> b) -> a -> a -> c\non f g x y = g x `f` g y\n", "-- | The `Proxy` type and values are for situations where type information is\n-- | required for an input to determine the type of an output, but where it is\n-- | not possible or convenient to provide a _value_ for the input.\n-- |\n-- | A hypothetical example: if you have a class that is used to handle the\n-- | result of an AJAX request, you may want to use this information to set the\n-- | expected content type of the request, so you might have a class something\n-- | like this:\n-- |\n-- | ``` purescript\n-- | class AjaxResponse a where\n-- |   responseType :: a -> ResponseType\n-- |   fromResponse :: Foreign -> a\n-- | ```\n-- |\n-- | The problem here is `responseType` requires a value of type `a`, but we\n-- | won't have a value of that type until the request has been completed. The\n-- | solution is to use a `Proxy` type instead:\n-- |\n-- | ``` purescript\n-- | class AjaxResponse a where\n-- |   responseType :: Proxy a -> ResponseType\n-- |   fromResponse :: Foreign -> a\n-- | ```\n-- |\n-- | We can now call `responseType (Proxy :: Proxy SomeContentType)` to produce\n-- | a `ResponseType` for `SomeContentType` without having to construct some\n-- | empty version of `SomeContentType` first. In situations like this where\n-- | the `Proxy` type can be statically determined, it is recommended to pull\n-- | out the definition to the top level and make a declaration like:\n-- |\n-- | ``` purescript\n-- | _SomeContentType :: Proxy SomeContentType\n-- | _SomeContentType = Proxy\n-- | ```\n-- |\n-- | That way the proxy value can be used as `responseType _SomeContentType`\n-- | for improved readability. However, this is not always possible, sometimes\n-- | the type required will be determined by a type variable. As PureScript has\n-- | scoped type variables, we can do things like this:\n-- |\n-- | ``` purescript\n-- | makeRequest :: URL -> ResponseType -> Aff _ Foreign\n-- | makeRequest = ...\n-- |\n-- | fetchData :: forall a. (AjaxResponse a) => URL -> Aff _ a\n-- | fetchData url = fromResponse <$> makeRequest url (responseType (Proxy :: Proxy a))\n-- | ```\nmodule Type.Proxy where\n\n-- | Proxy type for all `kind`s.\ndata Proxy :: forall k. k -> Type\ndata Proxy a = Proxy\n", "module Data.Functor\n  ( class Functor\n  , map\n  , (<$>)\n  , mapFlipped\n  , (<#>)\n  , void\n  , voidRight\n  , (<$)\n  , voidLeft\n  , ($>)\n  , flap\n  , (<@>)\n  ) where\n\nimport Data.Function (const, compose)\nimport Data.Unit (Unit, unit)\nimport Type.Proxy (Proxy(..))\n\n-- | A `Functor` is a type constructor which supports a mapping operation\n-- | `map`.\n-- |\n-- | `map` can be used to turn functions `a -> b` into functions\n-- | `f a -> f b` whose argument and return types use the type constructor `f`\n-- | to represent some computational context.\n-- |\n-- | Instances must satisfy the following laws:\n-- |\n-- | - Identity: `map identity = identity`\n-- | - Composition: `map (f <<< g) = map f <<< map g`\nclass Functor f where\n  map :: forall a b. (a -> b) -> f a -> f b\n\ninfixl 4 map as <$>\n\n-- | `mapFlipped` is `map` with its arguments reversed. For example:\n-- |\n-- | ```purescript\n-- | [1, 2, 3] <#> \\n -> n * n\n-- | ```\nmapFlipped :: forall f a b. Functor f => f a -> (a -> b) -> f b\nmapFlipped fa f = f <$> fa\n\ninfixl 1 mapFlipped as <#>\n\ninstance functorFn :: Functor ((->) r) where\n  map = compose\n\ninstance functorArray :: Functor Array where\n  map = arrayMap\n\ninstance functorProxy :: Functor Proxy where\n  map _ _ = Proxy\n\nforeign import arrayMap :: forall a b. (a -> b) -> Array a -> Array b\n\n-- | The `void` function is used to ignore the type wrapped by a\n-- | [`Functor`](#functor), replacing it with `Unit` and keeping only the type\n-- | information provided by the type constructor itself.\n-- |\n-- | `void` is often useful when using `do` notation to change the return type\n-- | of a monadic computation:\n-- |\n-- | ```purescript\n-- | main = forE 1 10 \\n -> void do\n-- |   print n\n-- |   print (n * n)\n-- | ```\nvoid :: forall f a. Functor f => f a -> f Unit\nvoid = map (const unit)\n\n-- | Ignore the return value of a computation, using the specified return value\n-- | instead.\nvoidRight :: forall f a b. Functor f => a -> f b -> f a\nvoidRight x = map (const x)\n\ninfixl 4 voidRight as <$\n\n-- | A version of `voidRight` with its arguments flipped.\nvoidLeft :: forall f a b. Functor f => f a -> b -> f b\nvoidLeft f x = const x <$> f\n\ninfixl 4 voidLeft as $>\n\n-- | Apply a value in a computational context to a value in no context.\n-- |\n-- | Generalizes `flip`.\n-- |\n-- | ```purescript\n-- | longEnough :: String -> Bool\n-- | hasSymbol :: String -> Bool\n-- | hasDigit :: String -> Bool\n-- | password :: String\n-- |\n-- | validate :: String -> Array Bool\n-- | validate = flap [longEnough, hasSymbol, hasDigit]\n-- | ```\n-- |\n-- | ```purescript\n-- | flap (-) 3 4 == 1\n-- | threeve <$> Just 1 <@> 'a' <*> Just true == Just (threeve 1 'a' true)\n-- | ```\nflap :: forall f a b. Functor f => f (a -> b) -> a -> f b\nflap ff x = map (\\f -> f x) ff\n\ninfixl 4 flap as <@>\n", "export const concatString = function (s1) {\n  return function (s2) {\n    return s1 + s2;\n  };\n};\n\nexport const concatArray = function (xs) {\n  return function (ys) {\n    if (xs.length === 0) return ys;\n    if (ys.length === 0) return xs;\n    return xs.concat(ys);\n  };\n};\n", "module Data.Symbol\n  ( class IsSymbol\n  , reflectSymbol\n  , reifySymbol\n  ) where\n\nimport Type.Proxy (Proxy(..))\n\n-- | A class for known symbols\nclass IsSymbol (sym :: Symbol) where\n  reflectSymbol :: Proxy sym -> String\n\n-- local definition for use in `reifySymbol`\nforeign import unsafeCoerce :: forall a b. a -> b\n\nreifySymbol :: forall r. String -> (forall sym. IsSymbol sym => Proxy sym -> r) -> r\nreifySymbol s f = coerce f { reflectSymbol: \\_ -> s } Proxy\n  where\n  coerce\n    :: (forall sym1. IsSymbol sym1 => Proxy sym1 -> r)\n    -> { reflectSymbol :: Proxy \"\" -> String }\n    -> Proxy \"\"\n    -> r\n  coerce = unsafeCoerce\n", "module Data.Void (Void, absurd) where\n\n-- | An uninhabited data type. In other words, one can never create\n-- | a runtime value of type `Void` because no such value exists.\n-- |\n-- | `Void` is useful to eliminate the possibility of a value being created.\n-- | For example, a value of type `Either Void Boolean` can never have\n-- | a Left value created in PureScript.\n-- |\n-- | This should not be confused with the keyword `void` that commonly appears in\n-- | C-family languages, such as Java:\n-- | ```\n-- | public class Foo {\n-- |   void doSomething() { System.out.println(\"hello world!\"); }\n-- | }\n-- | ```\n-- |\n-- | In PureScript, one often uses `Unit` to achieve similar effects as\n-- | the `void` of C-family languages above.\nnewtype Void = Void Void\n\n-- | Eliminator for the `Void` type.\n-- | Useful for stating that some code branch is impossible because you've\n-- | \"acquired\" a value of type `Void` (which you can't).\n-- |\n-- | ```purescript\n-- | rightOnly :: forall t . Either Void t -> t\n-- | rightOnly (Left v) = absurd v\n-- | rightOnly (Right t) = t\n-- | ```\nabsurd :: forall a. Void -> a\nabsurd a = spin a\n  where\n  spin (Void b) = spin b\n", "export const unsafeHas = function (label) {\n  return function (rec) {\n    return {}.hasOwnProperty.call(rec, label);\n  };\n};\n\nexport const unsafeGet = function (label) {\n  return function (rec) {\n    return rec[label];\n  };\n};\n\nexport const unsafeSet = function (label) {\n  return function (value) {\n    return function (rec) {\n      var copy = {};\n      for (var key in rec) {\n        if ({}.hasOwnProperty.call(rec, key)) {\n          copy[key] = rec[key];\n        }\n      }\n      copy[label] = value;\n      return copy;\n    };\n  };\n};\n\nexport const unsafeDelete = function (label) {\n  return function (rec) {\n    var copy = {};\n    for (var key in rec) {\n      if (key !== label && {}.hasOwnProperty.call(rec, key)) {\n        copy[key] = rec[key];\n      }\n    }\n    return copy;\n  };\n};\n", "module Data.Semigroup\n  ( class Semigroup\n  , append\n  , (<>)\n  , class SemigroupRecord\n  , appendRecord\n  ) where\n\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Unit (Unit, unit)\nimport Data.Void (Void, absurd)\nimport Prim.Row as Row\nimport Prim.RowList as RL\nimport Record.Unsafe (unsafeGet, unsafeSet)\nimport Type.Proxy (Proxy(..))\n\n-- | The `Semigroup` type class identifies an associative operation on a type.\n-- |\n-- | Instances are required to satisfy the following law:\n-- |\n-- | - Associativity: `(x <> y) <> z = x <> (y <> z)`\n-- |\n-- | One example of a `Semigroup` is `String`, with `(<>)` defined as string\n-- | concatenation. Another example is `List a`, with `(<>)` defined as\n-- | list concatenation.\n-- |\n-- | ### Newtypes for Semigroup\n-- |\n-- | There are two other ways to implement an instance for this type class\n-- | regardless of which type is used. These instances can be used by\n-- | wrapping the values in one of the two newtypes below:\n-- | 1. `First` - Use the first argument every time: `append first _ = first`.\n-- | 2. `Last` - Use the last argument every time: `append _ last = last`.\nclass Semigroup a where\n  append :: a -> a -> a\n\ninfixr 5 append as <>\n\ninstance semigroupString :: Semigroup String where\n  append = concatString\n\ninstance semigroupUnit :: Semigroup Unit where\n  append _ _ = unit\n\ninstance semigroupVoid :: Semigroup Void where\n  append _ = absurd\n\ninstance semigroupFn :: Semigroup s' => Semigroup (s -> s') where\n  append f g x = f x <> g x\n\ninstance semigroupArray :: Semigroup (Array a) where\n  append = concatArray\n\ninstance semigroupProxy :: Semigroup (Proxy a) where\n  append _ _ = Proxy\n\ninstance semigroupRecord :: (RL.RowToList row list, SemigroupRecord list row row) => Semigroup (Record row) where\n  append = appendRecord (Proxy :: Proxy list)\n\nforeign import concatString :: String -> String -> String\nforeign import concatArray :: forall a. Array a -> Array a -> Array a\n\n-- | A class for records where all fields have `Semigroup` instances, used to\n-- | implement the `Semigroup` instance for records.\nclass SemigroupRecord :: RL.RowList Type -> Row Type -> Row Type -> Constraint\nclass SemigroupRecord rowlist row subrow | rowlist -> subrow where\n  appendRecord :: Proxy rowlist -> Record row -> Record row -> Record subrow\n\ninstance semigroupRecordNil :: SemigroupRecord RL.Nil row () where\n  appendRecord _ _ _ = {}\n\ninstance semigroupRecordCons ::\n  ( IsSymbol key\n  , Row.Cons key focus subrowTail subrow\n  , SemigroupRecord rowlistTail row subrowTail\n  , Semigroup focus\n  ) =>\n  SemigroupRecord (RL.Cons key focus rowlistTail) row subrow where\n  appendRecord _ ra rb = insert (get ra <> get rb) tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    get = unsafeGet key :: Record row -> focus\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    tail = appendRecord (Proxy :: Proxy rowlistTail) ra rb\n", "module Control.Alt\n  ( class Alt, alt, (<|>)\n  , module Data.Functor\n  ) where\n\nimport Data.Functor (class Functor, map, void, ($>), (<#>), (<$), (<$>))\nimport Data.Semigroup (append)\n\n-- | The `Alt` type class identifies an associative operation on a type\n-- | constructor.  It is similar to `Semigroup`, except that it applies to\n-- | types of kind `* -> *`, like `Array` or `List`, rather than concrete types\n-- | `String` or `Number`.\n-- |\n-- | `Alt` instances are required to satisfy the following laws:\n-- |\n-- | - Associativity: `(x <|> y) <|> z == x <|> (y <|> z)`\n-- | - Distributivity: `f <$> (x <|> y) == (f <$> x) <|> (f <$> y)`\n-- |\n-- | For example, the `Array` (`[]`) type is an instance of `Alt`, where\n-- | `(<|>)` is defined to be concatenation.\n-- |\n-- | A common use case is to select the first \"valid\" item, or, if all items\n-- | are \"invalid\", the last \"invalid\" item.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | import Control.Alt ((<|>))\n-- | import Data.Maybe (Maybe(..)\n-- | import Data.Either (Either(..))\n-- |\n-- | Nothing <|> Just 1 <|> Just 2 == Just 1\n-- | Left \"err\" <|> Right 1 <|> Right 2 == Right 1\n-- | Left \"err 1\" <|> Left \"err 2\" <|> Left \"err 3\" == Left \"err 3\"\n-- | ```\nclass Functor f <= Alt f where\n  alt :: forall a. f a -> f a -> f a\n\ninfixr 3 alt as <|>\n\ninstance altArray :: Alt Array where\n  alt = append\n", "export const arrayApply = function (fs) {\n  return function (xs) {\n    var l = fs.length;\n    var k = xs.length;\n    var result = new Array(l*k);\n    var n = 0;\n    for (var i = 0; i < l; i++) {\n      var f = fs[i];\n      for (var j = 0; j < k; j++) {\n        result[n++] = f(xs[j]);\n      }\n    }\n    return result;\n  };\n};\n", "module Control.Apply\n  ( class Apply\n  , apply\n  , (<*>)\n  , applyFirst\n  , (<*)\n  , applySecond\n  , (*>)\n  , lift2\n  , lift3\n  , lift4\n  , lift5\n  , module Data.Functor\n  ) where\n\nimport Data.Functor (class Functor, map, void, ($>), (<#>), (<$), (<$>))\nimport Data.Function (const)\nimport Control.Category (identity)\nimport Type.Proxy (Proxy(..))\n\n-- | The `Apply` class provides the `(<*>)` which is used to apply a function\n-- | to an argument under a type constructor.\n-- |\n-- | `Apply` can be used to lift functions of two or more arguments to work on\n-- | values wrapped with the type constructor `f`. It might also be understood\n-- | in terms of the `lift2` function:\n-- |\n-- | ```purescript\n-- | lift2 :: forall f a b c. Apply f => (a -> b -> c) -> f a -> f b -> f c\n-- | lift2 f a b = f <$> a <*> b\n-- | ```\n-- |\n-- | `(<*>)` is recovered from `lift2` as `lift2 ($)`. That is, `(<*>)` lifts\n-- | the function application operator `($)` to arguments wrapped with the\n-- | type constructor `f`.\n-- |\n-- | Put differently...\n-- | ```\n-- | foo =\n-- |   functionTakingNArguments <$> computationProducingArg1\n-- |                            <*> computationProducingArg2\n-- |                            <*> ...\n-- |                            <*> computationProducingArgN\n-- | ```\n-- |\n-- | Instances must satisfy the following law in addition to the `Functor`\n-- | laws:\n-- |\n-- | - Associative composition: `(<<<) <$> f <*> g <*> h = f <*> (g <*> h)`\n-- |\n-- | Formally, `Apply` represents a strong lax semi-monoidal endofunctor.\nclass Functor f <= Apply f where\n  apply :: forall a b. f (a -> b) -> f a -> f b\n\ninfixl 4 apply as <*>\n\ninstance applyFn :: Apply ((->) r) where\n  apply f g x = f x (g x)\n\ninstance applyArray :: Apply Array where\n  apply = arrayApply\n\nforeign import arrayApply :: forall a b. Array (a -> b) -> Array a -> Array b\n\ninstance applyProxy :: Apply Proxy where\n  apply _ _ = Proxy\n\n-- | Combine two effectful actions, keeping only the result of the first.\napplyFirst :: forall a b f. Apply f => f a -> f b -> f a\napplyFirst a b = const <$> a <*> b\n\ninfixl 4 applyFirst as <*\n\n-- | Combine two effectful actions, keeping only the result of the second.\napplySecond :: forall a b f. Apply f => f a -> f b -> f b\napplySecond a b = const identity <$> a <*> b\n\ninfixl 4 applySecond as *>\n\n-- | Lift a function of two arguments to a function which accepts and returns\n-- | values wrapped with the type constructor `f`.\n-- |\n-- | ```purescript\n-- | lift2 add (Just 1) (Just 2) == Just 3\n-- | lift2 add Nothing (Just 2) == Nothing\n-- |```\n-- |\nlift2 :: forall a b c f. Apply f => (a -> b -> c) -> f a -> f b -> f c\nlift2 f a b = f <$> a <*> b\n\n-- | Lift a function of three arguments to a function which accepts and returns\n-- | values wrapped with the type constructor `f`.\nlift3 :: forall a b c d f. Apply f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d\nlift3 f a b c = f <$> a <*> b <*> c\n\n-- | Lift a function of four arguments to a function which accepts and returns\n-- | values wrapped with the type constructor `f`.\nlift4 :: forall a b c d e f. Apply f => (a -> b -> c -> d -> e) -> f a -> f b -> f c -> f d -> f e\nlift4 f a b c d = f <$> a <*> b <*> c <*> d\n\n-- | Lift a function of five arguments to a function which accepts and returns\n-- | values wrapped with the type constructor `f`.\nlift5 :: forall a b c d e f g. Apply f => (a -> b -> c -> d -> e -> g) -> f a -> f b -> f c -> f d -> f e -> f g\nlift5 f a b c d e = f <$> a <*> b <*> c <*> d <*> e\n", "module Control.Applicative\n  ( class Applicative\n  , pure\n  , liftA1\n  , unless\n  , when\n  , module Control.Apply\n  , module Data.Functor\n  ) where\n\nimport Control.Apply (class Apply, apply, (*>), (<*), (<*>))\n\nimport Data.Functor (class Functor, map, void, ($>), (<#>), (<$), (<$>))\nimport Data.Unit (Unit, unit)\nimport Type.Proxy (Proxy(..))\n\n-- | The `Applicative` type class extends the [`Apply`](#apply) type class\n-- | with a `pure` function, which can be used to create values of type `f a`\n-- | from values of type `a`.\n-- |\n-- | Where [`Apply`](#apply) provides the ability to lift functions of two or\n-- | more arguments to functions whose arguments are wrapped using `f`, and\n-- | [`Functor`](#functor) provides the ability to lift functions of one\n-- | argument, `pure` can be seen as the function which lifts functions of\n-- | _zero_ arguments. That is, `Applicative` functors support a lifting\n-- | operation for any number of function arguments.\n-- |\n-- | Instances must satisfy the following laws in addition to the `Apply`\n-- | laws:\n-- |\n-- | - Identity: `(pure identity) <*> v = v`\n-- | - Composition: `pure (<<<) <*> f <*> g <*> h = f <*> (g <*> h)`\n-- | - Homomorphism: `(pure f) <*> (pure x) = pure (f x)`\n-- | - Interchange: `u <*> (pure y) = (pure (_ $ y)) <*> u`\nclass Apply f <= Applicative f where\n  pure :: forall a. a -> f a\n\ninstance applicativeFn :: Applicative ((->) r) where\n  pure x _ = x\n\ninstance applicativeArray :: Applicative Array where\n  pure x = [ x ]\n\ninstance applicativeProxy :: Applicative Proxy where\n  pure _ = Proxy\n\n-- | `liftA1` provides a default implementation of `(<$>)` for any\n-- | [`Applicative`](#applicative) functor, without using `(<$>)` as provided\n-- | by the [`Functor`](#functor)-[`Applicative`](#applicative) superclass\n-- | relationship.\n-- |\n-- | `liftA1` can therefore be used to write [`Functor`](#functor) instances\n-- | as follows:\n-- |\n-- | ```purescript\n-- | instance functorF :: Functor F where\n-- |   map = liftA1\n-- | ```\nliftA1 :: forall f a b. Applicative f => (a -> b) -> f a -> f b\nliftA1 f a = pure f <*> a\n\n-- | Perform an applicative action when a condition is true.\nwhen :: forall m. Applicative m => Boolean -> m Unit -> m Unit\nwhen true m = m\nwhen false _ = pure unit\n\n-- | Perform an applicative action unless a condition is true.\nunless :: forall m. Applicative m => Boolean -> m Unit -> m Unit\nunless false m = m\nunless true _ = pure unit\n", "export const topInt = 2147483647;\nexport const bottomInt = -2147483648;\n\nexport const topChar = String.fromCharCode(65535);\nexport const bottomChar = String.fromCharCode(0);\n\nexport const topNumber = Number.POSITIVE_INFINITY;\nexport const bottomNumber = Number.NEGATIVE_INFINITY;\n", "var unsafeCompareImpl = function (lt) {\n  return function (eq) {\n    return function (gt) {\n      return function (x) {\n        return function (y) {\n          return x < y ? lt : x === y ? eq : gt;\n        };\n      };\n    };\n  };\n};\n\nexport const ordBooleanImpl = unsafeCompareImpl;\nexport const ordIntImpl = unsafeCompareImpl;\nexport const ordNumberImpl = unsafeCompareImpl;\nexport const ordStringImpl = unsafeCompareImpl;\nexport const ordCharImpl = unsafeCompareImpl;\n\nexport const ordArrayImpl = function (f) {\n  return function (xs) {\n    return function (ys) {\n      var i = 0;\n      var xlen = xs.length;\n      var ylen = ys.length;\n      while (i < xlen && i < ylen) {\n        var x = xs[i];\n        var y = ys[i];\n        var o = f(x)(y);\n        if (o !== 0) {\n          return o;\n        }\n        i++;\n      }\n      if (xlen === ylen) {\n        return 0;\n      } else if (xlen > ylen) {\n        return -1;\n      } else {\n        return 1;\n      }\n    };\n  };\n};\n", "var refEq = function (r1) {\n  return function (r2) {\n    return r1 === r2;\n  };\n};\n\nexport const eqBooleanImpl = refEq;\nexport const eqIntImpl = refEq;\nexport const eqNumberImpl = refEq;\nexport const eqCharImpl = refEq;\nexport const eqStringImpl = refEq;\n\nexport const eqArrayImpl = function (f) {\n  return function (xs) {\n    return function (ys) {\n      if (xs.length !== ys.length) return false;\n      for (var i = 0; i < xs.length; i++) {\n        if (!f(xs[i])(ys[i])) return false;\n      }\n      return true;\n    };\n  };\n};\n", "module Data.Eq\n  ( class Eq\n  , eq\n  , (==)\n  , notEq\n  , (/=)\n  , class Eq1\n  , eq1\n  , notEq1\n  , class EqRecord\n  , eqRecord\n  ) where\n\nimport Data.HeytingAlgebra ((&&))\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Unit (Unit)\nimport Data.Void (Void)\nimport Prim.Row as Row\nimport Prim.RowList as RL\nimport Record.Unsafe (unsafeGet)\nimport Type.Proxy (Proxy(..))\n\n-- | The `Eq` type class represents types which support decidable equality.\n-- |\n-- | `Eq` instances should satisfy the following laws:\n-- |\n-- | - Reflexivity: `x == x = true`\n-- | - Symmetry: `x == y = y == x`\n-- | - Transitivity: if `x == y` and `y == z` then `x == z`\n-- |\n-- | **Note:** The `Number` type is not an entirely law abiding member of this\n-- | class due to the presence of `NaN`, since `NaN /= NaN`. Additionally,\n-- | computing with `Number` can result in a loss of precision, so sometimes\n-- | values that should be equivalent are not.\nclass Eq a where\n  eq :: a -> a -> Boolean\n\ninfix 4 eq as ==\n\n-- | `notEq` tests whether one value is _not equal_ to another. Shorthand for\n-- | `not (eq x y)`.\nnotEq :: forall a. Eq a => a -> a -> Boolean\nnotEq x y = (x == y) == false\n\ninfix 4 notEq as /=\n\ninstance eqBoolean :: Eq Boolean where\n  eq = eqBooleanImpl\n\ninstance eqInt :: Eq Int where\n  eq = eqIntImpl\n\ninstance eqNumber :: Eq Number where\n  eq = eqNumberImpl\n\ninstance eqChar :: Eq Char where\n  eq = eqCharImpl\n\ninstance eqString :: Eq String where\n  eq = eqStringImpl\n\ninstance eqUnit :: Eq Unit where\n  eq _ _ = true\n\ninstance eqVoid :: Eq Void where\n  eq _ _ = true\n\ninstance eqArray :: Eq a => Eq (Array a) where\n  eq = eqArrayImpl eq\n\ninstance eqRec :: (RL.RowToList row list, EqRecord list row) => Eq (Record row) where\n  eq = eqRecord (Proxy :: Proxy list)\n\ninstance eqProxy :: Eq (Proxy a) where\n  eq _ _ = true\n\nforeign import eqBooleanImpl :: Boolean -> Boolean -> Boolean\nforeign import eqIntImpl :: Int -> Int -> Boolean\nforeign import eqNumberImpl :: Number -> Number -> Boolean\nforeign import eqCharImpl :: Char -> Char -> Boolean\nforeign import eqStringImpl :: String -> String -> Boolean\n\nforeign import eqArrayImpl :: forall a. (a -> a -> Boolean) -> Array a -> Array a -> Boolean\n\n-- | The `Eq1` type class represents type constructors with decidable equality.\nclass Eq1 f where\n  eq1 :: forall a. Eq a => f a -> f a -> Boolean\n\ninstance eq1Array :: Eq1 Array where\n  eq1 = eq\n\nnotEq1 :: forall f a. Eq1 f => Eq a => f a -> f a -> Boolean\nnotEq1 x y = (x `eq1` y) == false\n\n-- | A class for records where all fields have `Eq` instances, used to implement\n-- | the `Eq` instance for records.\nclass EqRecord :: RL.RowList Type -> Row Type -> Constraint\nclass EqRecord rowlist row where\n  eqRecord :: Proxy rowlist -> Record row -> Record row -> Boolean\n\ninstance eqRowNil :: EqRecord RL.Nil row where\n  eqRecord _ _ _ = true\n\ninstance eqRowCons ::\n  ( EqRecord rowlistTail row\n  , Row.Cons key focus rowTail row\n  , IsSymbol key\n  , Eq focus\n  ) =>\n  EqRecord (RL.Cons key focus rowlistTail) row where\n  eqRecord _ ra rb = (get ra == get rb) && tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    get = unsafeGet key :: Record row -> focus\n    tail = eqRecord (Proxy :: Proxy rowlistTail) ra rb\n", "module Data.Ordering (Ordering(..), invert) where\n\nimport Data.Eq (class Eq)\nimport Data.Semigroup (class Semigroup)\nimport Data.Show (class Show)\n\n-- | The `Ordering` data type represents the three possible outcomes of\n-- | comparing two values:\n-- |\n-- | `LT` - The first value is _less than_ the second.\n-- | `GT` - The first value is _greater than_ the second.\n-- | `EQ` - The first value is _equal to_ the second.\ndata Ordering = LT | GT | EQ\n\ninstance eqOrdering :: Eq Ordering where\n  eq LT LT = true\n  eq GT GT = true\n  eq EQ EQ = true\n  eq _ _ = false\n\ninstance semigroupOrdering :: Semigroup Ordering where\n  append LT _ = LT\n  append GT _ = GT\n  append EQ y = y\n\ninstance showOrdering :: Show Ordering where\n  show LT = \"LT\"\n  show GT = \"GT\"\n  show EQ = \"EQ\"\n\n-- | Reverses an `Ordering` value, flipping greater than for less than while\n-- | preserving equality.\ninvert :: Ordering -> Ordering\ninvert GT = LT\ninvert EQ = EQ\ninvert LT = GT\n", "export const intSub = function (x) {\n  return function (y) {\n    /* jshint bitwise: false */\n    return x - y | 0;\n  };\n};\n\nexport const numSub = function (n1) {\n  return function (n2) {\n    return n1 - n2;\n  };\n};\n", "export const intAdd = function (x) {\n  return function (y) {\n    /* jshint bitwise: false */\n    return x + y | 0;\n  };\n};\n\nexport const intMul = function (x) {\n  return function (y) {\n    /* jshint bitwise: false */\n    return x * y | 0;\n  };\n};\n\nexport const numAdd = function (n1) {\n  return function (n2) {\n    return n1 + n2;\n  };\n};\n\nexport const numMul = function (n1) {\n  return function (n2) {\n    return n1 * n2;\n  };\n};\n", "module Data.Semiring\n  ( class Semiring\n  , add\n  , (+)\n  , zero\n  , mul\n  , (*)\n  , one\n  , class SemiringRecord\n  , addRecord\n  , mulRecord\n  , oneRecord\n  , zeroRecord\n  ) where\n\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Unit (Unit, unit)\nimport Prim.Row as Row\nimport Prim.RowList as RL\nimport Record.Unsafe (unsafeGet, unsafeSet)\nimport Type.Proxy (Proxy(..))\n\n-- | The `Semiring` class is for types that support an addition and\n-- | multiplication operation.\n-- |\n-- | Instances must satisfy the following laws:\n-- |\n-- | - Commutative monoid under addition:\n-- |   - Associativity: `(a + b) + c = a + (b + c)`\n-- |   - Identity: `zero + a = a + zero = a`\n-- |   - Commutative: `a + b = b + a`\n-- | - Monoid under multiplication:\n-- |   - Associativity: `(a * b) * c = a * (b * c)`\n-- |   - Identity: `one * a = a * one = a`\n-- | - Multiplication distributes over addition:\n-- |   - Left distributivity: `a * (b + c) = (a * b) + (a * c)`\n-- |   - Right distributivity: `(a + b) * c = (a * c) + (b * c)`\n-- | - Annihilation: `zero * a = a * zero = zero`\n-- |\n-- | **Note:** The `Number` and `Int` types are not fully law abiding\n-- | members of this class hierarchy due to the potential for arithmetic\n-- | overflows, and in the case of `Number`, the presence of `NaN` and\n-- | `Infinity` values. The behaviour is unspecified in these cases.\nclass Semiring a where\n  add :: a -> a -> a\n  zero :: a\n  mul :: a -> a -> a\n  one :: a\n\ninfixl 6 add as +\ninfixl 7 mul as *\n\ninstance semiringInt :: Semiring Int where\n  add = intAdd\n  zero = 0\n  mul = intMul\n  one = 1\n\ninstance semiringNumber :: Semiring Number where\n  add = numAdd\n  zero = 0.0\n  mul = numMul\n  one = 1.0\n\ninstance semiringFn :: Semiring b => Semiring (a -> b) where\n  add f g x = f x + g x\n  zero = \\_ -> zero\n  mul f g x = f x * g x\n  one = \\_ -> one\n\ninstance semiringUnit :: Semiring Unit where\n  add _ _ = unit\n  zero = unit\n  mul _ _ = unit\n  one = unit\n\ninstance semiringProxy :: Semiring (Proxy a) where\n  add _ _ = Proxy\n  mul _ _ = Proxy\n  one = Proxy\n  zero = Proxy\n\ninstance semiringRecord :: (RL.RowToList row list, SemiringRecord list row row) => Semiring (Record row) where\n  add = addRecord (Proxy :: Proxy list)\n  mul = mulRecord (Proxy :: Proxy list)\n  one = oneRecord (Proxy :: Proxy list) (Proxy :: Proxy row)\n  zero = zeroRecord (Proxy :: Proxy list) (Proxy :: Proxy row)\n\nforeign import intAdd :: Int -> Int -> Int\nforeign import intMul :: Int -> Int -> Int\nforeign import numAdd :: Number -> Number -> Number\nforeign import numMul :: Number -> Number -> Number\n\n-- | A class for records where all fields have `Semiring` instances, used to\n-- | implement the `Semiring` instance for records.\nclass SemiringRecord :: RL.RowList Type -> Row Type -> Row Type -> Constraint\nclass SemiringRecord rowlist row subrow | rowlist -> subrow where\n  addRecord :: Proxy rowlist -> Record row -> Record row -> Record subrow\n  mulRecord :: Proxy rowlist -> Record row -> Record row -> Record subrow\n  oneRecord :: Proxy rowlist -> Proxy row -> Record subrow\n  zeroRecord :: Proxy rowlist -> Proxy row -> Record subrow\n\ninstance semiringRecordNil :: SemiringRecord RL.Nil row () where\n  addRecord _ _ _ = {}\n  mulRecord _ _ _ = {}\n  oneRecord _ _ = {}\n  zeroRecord _ _ = {}\n\ninstance semiringRecordCons ::\n  ( IsSymbol key\n  , Row.Cons key focus subrowTail subrow\n  , SemiringRecord rowlistTail row subrowTail\n  , Semiring focus\n  ) =>\n  SemiringRecord (RL.Cons key focus rowlistTail) row subrow where\n  addRecord _ ra rb = insert (get ra + get rb) tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    get = unsafeGet key :: Record row -> focus\n    tail = addRecord (Proxy :: Proxy rowlistTail) ra rb\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n\n  mulRecord _ ra rb = insert (get ra * get rb) tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    get = unsafeGet key :: Record row -> focus\n    tail = mulRecord (Proxy :: Proxy rowlistTail) ra rb\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n\n  oneRecord _ _ = insert one tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    tail = oneRecord (Proxy :: Proxy rowlistTail) (Proxy :: Proxy row)\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n\n  zeroRecord _ _ = insert zero tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    tail = zeroRecord (Proxy :: Proxy rowlistTail) (Proxy :: Proxy row)\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n", "module Data.Ring\n  ( class Ring\n  , sub\n  , negate\n  , (-)\n  , module Data.Semiring\n  , class RingRecord\n  , subRecord\n  ) where\n\nimport Data.Semiring (class Semiring, class SemiringRecord, add, mul, one, zero, (*), (+))\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Unit (Unit, unit)\nimport Prim.Row as Row\nimport Prim.RowList as RL\nimport Record.Unsafe (unsafeGet, unsafeSet)\nimport Type.Proxy (Proxy(..))\n\n-- | The `Ring` class is for types that support addition, multiplication,\n-- | and subtraction operations.\n-- |\n-- | Instances must satisfy the following laws in addition to the `Semiring`\n-- | laws:\n-- |\n-- | - Additive inverse: `a - a = zero`\n-- | - Compatibility of `sub` and `negate`: `a - b = a + (zero - b)`\nclass Semiring a <= Ring a where\n  sub :: a -> a -> a\n\ninfixl 6 sub as -\n\ninstance ringInt :: Ring Int where\n  sub = intSub\n\ninstance ringNumber :: Ring Number where\n  sub = numSub\n\ninstance ringUnit :: Ring Unit where\n  sub _ _ = unit\n\ninstance ringFn :: Ring b => Ring (a -> b) where\n  sub f g x = f x - g x\n\ninstance ringProxy :: Ring (Proxy a) where\n  sub _ _ = Proxy\n\ninstance ringRecord :: (RL.RowToList row list, RingRecord list row row) => Ring (Record row) where\n  sub = subRecord (Proxy :: Proxy list)\n\n-- | `negate x` can be used as a shorthand for `zero - x`.\nnegate :: forall a. Ring a => a -> a\nnegate a = zero - a\n\nforeign import intSub :: Int -> Int -> Int\nforeign import numSub :: Number -> Number -> Number\n\n-- | A class for records where all fields have `Ring` instances, used to\n-- | implement the `Ring` instance for records.\nclass RingRecord :: RL.RowList Type -> Row Type -> Row Type -> Constraint\nclass SemiringRecord rowlist row subrow <= RingRecord rowlist row subrow | rowlist -> subrow where\n  subRecord :: Proxy rowlist -> Record row -> Record row -> Record subrow\n\ninstance ringRecordNil :: RingRecord RL.Nil row () where\n  subRecord _ _ _ = {}\n\ninstance ringRecordCons ::\n  ( IsSymbol key\n  , Row.Cons key focus subrowTail subrow\n  , RingRecord rowlistTail row subrowTail\n  , Ring focus\n  ) =>\n  RingRecord (RL.Cons key focus rowlistTail) row subrow where\n  subRecord _ ra rb = insert (get ra - get rb) tail\n    where\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    key = reflectSymbol (Proxy :: Proxy key)\n    get = unsafeGet key :: Record row -> focus\n    tail = subRecord (Proxy :: Proxy rowlistTail) ra rb\n", "module Data.Ord\n  ( class Ord\n  , compare\n  , class Ord1\n  , compare1\n  , lessThan\n  , (<)\n  , lessThanOrEq\n  , (<=)\n  , greaterThan\n  , (>)\n  , greaterThanOrEq\n  , (>=)\n  , comparing\n  , min\n  , max\n  , clamp\n  , between\n  , abs\n  , signum\n  , module Data.Ordering\n  , class OrdRecord\n  , compareRecord\n  ) where\n\nimport Data.Eq (class Eq, class Eq1, class EqRecord, (/=))\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Ordering (Ordering(..))\nimport Data.Ring (class Ring, zero, one, negate)\nimport Data.Unit (Unit)\nimport Data.Void (Void)\nimport Prim.Row as Row\nimport Prim.RowList as RL\nimport Record.Unsafe (unsafeGet)\nimport Type.Proxy (Proxy(..))\n\n-- | The `Ord` type class represents types which support comparisons with a\n-- | _total order_.\n-- |\n-- | `Ord` instances should satisfy the laws of total orderings:\n-- |\n-- | - Reflexivity: `a <= a`\n-- | - Antisymmetry: if `a <= b` and `b <= a` then `a == b`\n-- | - Transitivity: if `a <= b` and `b <= c` then `a <= c`\n-- |\n-- | **Note:** The `Number` type is not an entirely law abiding member of this\n-- | class due to the presence of `NaN`, since `NaN <= NaN` evaluates to `false`\nclass Eq a <= Ord a where\n  compare :: a -> a -> Ordering\n\ninstance ordBoolean :: Ord Boolean where\n  compare = ordBooleanImpl LT EQ GT\n\ninstance ordInt :: Ord Int where\n  compare = ordIntImpl LT EQ GT\n\ninstance ordNumber :: Ord Number where\n  compare = ordNumberImpl LT EQ GT\n\ninstance ordString :: Ord String where\n  compare = ordStringImpl LT EQ GT\n\ninstance ordChar :: Ord Char where\n  compare = ordCharImpl LT EQ GT\n\ninstance ordUnit :: Ord Unit where\n  compare _ _ = EQ\n\ninstance ordVoid :: Ord Void where\n  compare _ _ = EQ\n\ninstance ordProxy :: Ord (Proxy a) where\n  compare _ _ = EQ\n\ninstance ordArray :: Ord a => Ord (Array a) where\n  compare = \\xs ys -> compare 0 (ordArrayImpl toDelta xs ys)\n    where\n    toDelta x y =\n      case compare x y of\n        EQ -> 0\n        LT -> 1\n        GT -> -1\n\nforeign import ordBooleanImpl\n  :: Ordering\n  -> Ordering\n  -> Ordering\n  -> Boolean\n  -> Boolean\n  -> Ordering\n\nforeign import ordIntImpl\n  :: Ordering\n  -> Ordering\n  -> Ordering\n  -> Int\n  -> Int\n  -> Ordering\n\nforeign import ordNumberImpl\n  :: Ordering\n  -> Ordering\n  -> Ordering\n  -> Number\n  -> Number\n  -> Ordering\n\nforeign import ordStringImpl\n  :: Ordering\n  -> Ordering\n  -> Ordering\n  -> String\n  -> String\n  -> Ordering\n\nforeign import ordCharImpl\n  :: Ordering\n  -> Ordering\n  -> Ordering\n  -> Char\n  -> Char\n  -> Ordering\n\nforeign import ordArrayImpl :: forall a. (a -> a -> Int) -> Array a -> Array a -> Int\n\ninstance ordOrdering :: Ord Ordering where\n  compare LT LT = EQ\n  compare EQ EQ = EQ\n  compare GT GT = EQ\n  compare LT _ = LT\n  compare EQ LT = GT\n  compare EQ GT = LT\n  compare GT _ = GT\n\n-- | Test whether one value is _strictly less than_ another.\nlessThan :: forall a. Ord a => a -> a -> Boolean\nlessThan a1 a2 = case a1 `compare` a2 of\n  LT -> true\n  _ -> false\n\n-- | Test whether one value is _strictly greater than_ another.\ngreaterThan :: forall a. Ord a => a -> a -> Boolean\ngreaterThan a1 a2 = case a1 `compare` a2 of\n  GT -> true\n  _ -> false\n\n-- | Test whether one value is _non-strictly less than_ another.\nlessThanOrEq :: forall a. Ord a => a -> a -> Boolean\nlessThanOrEq a1 a2 = case a1 `compare` a2 of\n  GT -> false\n  _ -> true\n\n-- | Test whether one value is _non-strictly greater than_ another.\ngreaterThanOrEq :: forall a. Ord a => a -> a -> Boolean\ngreaterThanOrEq a1 a2 = case a1 `compare` a2 of\n  LT -> false\n  _ -> true\n\ninfixl 4 lessThan as <\ninfixl 4 lessThanOrEq as <=\ninfixl 4 greaterThan as >\ninfixl 4 greaterThanOrEq as >=\n\n-- | Compares two values by mapping them to a type with an `Ord` instance.\ncomparing :: forall a b. Ord b => (a -> b) -> (a -> a -> Ordering)\ncomparing f x y = compare (f x) (f y)\n\n-- | Take the minimum of two values. If they are considered equal, the first\n-- | argument is chosen.\nmin :: forall a. Ord a => a -> a -> a\nmin x y =\n  case compare x y of\n    LT -> x\n    EQ -> x\n    GT -> y\n\n-- | Take the maximum of two values. If they are considered equal, the first\n-- | argument is chosen.\nmax :: forall a. Ord a => a -> a -> a\nmax x y =\n  case compare x y of\n    LT -> y\n    EQ -> x\n    GT -> x\n\n-- | Clamp a value between a minimum and a maximum. For example:\n-- |\n-- | ``` purescript\n-- | let f = clamp 0 10\n-- | f (-5) == 0\n-- | f 5    == 5\n-- | f 15   == 10\n-- | ```\nclamp :: forall a. Ord a => a -> a -> a -> a\nclamp low hi x = min hi (max low x)\n\n-- | Test whether a value is between a minimum and a maximum (inclusive).\n-- | For example:\n-- |\n-- | ``` purescript\n-- | let f = between 0 10\n-- | f 0    == true\n-- | f (-5) == false\n-- | f 5    == true\n-- | f 10   == true\n-- | f 15   == false\n-- | ```\nbetween :: forall a. Ord a => a -> a -> a -> Boolean\nbetween low hi x\n  | x < low = false\n  | x > hi = false\n  | true = true\n\n-- | The absolute value function. `abs x` is defined as `if x >= zero then x\n-- | else negate x`.\nabs :: forall a. Ord a => Ring a => a -> a\nabs x = if x >= zero then x else negate x\n\n-- | The sign function; returns `one` if the argument is positive,\n-- | `negate one` if the argument is negative, or `zero` if the argument is `zero`.\n-- | For floating point numbers with signed zeroes, when called with a zero,\n-- | this function returns the argument in order to preserve the sign.\n-- | For any `x`, we should have `signum x * abs x == x`.\nsignum :: forall a. Ord a => Ring a => a -> a\nsignum x =\n  if x < zero then negate one\n  else if x > zero then one\n  else x\n\n-- | The `Ord1` type class represents totally ordered type constructors.\nclass Eq1 f <= Ord1 f where\n  compare1 :: forall a. Ord a => f a -> f a -> Ordering\n\ninstance ord1Array :: Ord1 Array where\n  compare1 = compare\n\nclass OrdRecord :: RL.RowList Type -> Row Type -> Constraint\nclass EqRecord rowlist row <= OrdRecord rowlist row where\n  compareRecord :: Proxy rowlist -> Record row -> Record row -> Ordering\n\ninstance ordRecordNil :: OrdRecord RL.Nil row where\n  compareRecord _ _ _ = EQ\n\ninstance ordRecordCons ::\n  ( OrdRecord rowlistTail row\n  , Row.Cons key focus rowTail row\n  , IsSymbol key\n  , Ord focus\n  ) =>\n  OrdRecord (RL.Cons key focus rowlistTail) row where\n  compareRecord _ ra rb =\n    if left /= EQ then left\n    else compareRecord (Proxy :: Proxy rowlistTail) ra rb\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    unsafeGet' = unsafeGet :: String -> Record row -> focus\n    left = unsafeGet' key ra `compare` unsafeGet' key rb\n\ninstance ordRecord ::\n  ( RL.RowToList row list\n  , OrdRecord list row\n  ) =>\n  Ord (Record row) where\n  compare = compareRecord (Proxy :: Proxy list)\n", "module Data.Bounded\n  ( class Bounded\n  , bottom\n  , top\n  , module Data.Ord\n  , class BoundedRecord\n  , bottomRecord\n  , topRecord\n  ) where\n\nimport Data.Ord (class Ord, class OrdRecord, Ordering(..), compare, (<), (<=), (>), (>=))\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Unit (Unit, unit)\nimport Prim.Row as Row\nimport Prim.RowList as RL\nimport Record.Unsafe (unsafeSet)\nimport Type.Proxy (Proxy(..))\n\n-- | The `Bounded` type class represents totally ordered types that have an\n-- | upper and lower boundary.\n-- |\n-- | Instances should satisfy the following law in addition to the `Ord` laws:\n-- |\n-- | - Bounded: `bottom <= a <= top`\nclass Ord a <= Bounded a where\n  top :: a\n  bottom :: a\n\ninstance boundedBoolean :: Bounded Boolean where\n  top = true\n  bottom = false\n\n-- | The `Bounded` `Int` instance has `top :: Int` equal to 2^31 - 1,\n-- | and `bottom :: Int` equal to -2^31, since these are the largest and smallest\n-- | integers representable by twos-complement 32-bit integers, respectively.\ninstance boundedInt :: Bounded Int where\n  top = topInt\n  bottom = bottomInt\n\nforeign import topInt :: Int\nforeign import bottomInt :: Int\n\n-- | Characters fall within the Unicode range.\ninstance boundedChar :: Bounded Char where\n  top = topChar\n  bottom = bottomChar\n\nforeign import topChar :: Char\nforeign import bottomChar :: Char\n\ninstance boundedOrdering :: Bounded Ordering where\n  top = GT\n  bottom = LT\n\ninstance boundedUnit :: Bounded Unit where\n  top = unit\n  bottom = unit\n\nforeign import topNumber :: Number\nforeign import bottomNumber :: Number\n\ninstance boundedNumber :: Bounded Number where\n  top = topNumber\n  bottom = bottomNumber\n\ninstance boundedProxy :: Bounded (Proxy a) where\n  bottom = Proxy\n  top = Proxy\n\nclass BoundedRecord :: RL.RowList Type -> Row Type -> Row Type -> Constraint\nclass OrdRecord rowlist row <= BoundedRecord rowlist row subrow | rowlist -> subrow where\n  topRecord :: Proxy rowlist -> Proxy row -> Record subrow\n  bottomRecord :: Proxy rowlist -> Proxy row -> Record subrow\n\ninstance boundedRecordNil :: BoundedRecord RL.Nil row () where\n  topRecord _ _ = {}\n  bottomRecord _ _ = {}\n\ninstance boundedRecordCons ::\n  ( IsSymbol key\n  , Bounded focus\n  , Row.Cons key focus rowTail row\n  , Row.Cons key focus subrowTail subrow\n  , BoundedRecord rowlistTail row subrowTail\n  ) =>\n  BoundedRecord (RL.Cons key focus rowlistTail) row subrow where\n  topRecord _ rowProxy = insert top tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    tail = topRecord (Proxy :: Proxy rowlistTail) rowProxy\n\n  bottomRecord _ rowProxy = insert bottom tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    tail = bottomRecord (Proxy :: Proxy rowlistTail) rowProxy\n\ninstance boundedRecord ::\n  ( RL.RowToList row list\n  , BoundedRecord list row row\n  ) =>\n  Bounded (Record row) where\n  top = topRecord (Proxy :: Proxy list) (Proxy :: Proxy row)\n  bottom = bottomRecord (Proxy :: Proxy list) (Proxy :: Proxy row)\n", "export const showIntImpl = function (n) {\n  return n.toString();\n};\n\nexport const showNumberImpl = function (n) {\n  var str = n.toString();\n  return isNaN(str + \".0\") ? str : str + \".0\";\n};\n\nexport const showCharImpl = function (c) {\n  var code = c.charCodeAt(0);\n  if (code < 0x20 || code === 0x7F) {\n    switch (c) {\n      case \"\\x07\": return \"'\\\\a'\";\n      case \"\\b\": return \"'\\\\b'\";\n      case \"\\f\": return \"'\\\\f'\";\n      case \"\\n\": return \"'\\\\n'\";\n      case \"\\r\": return \"'\\\\r'\";\n      case \"\\t\": return \"'\\\\t'\";\n      case \"\\v\": return \"'\\\\v'\";\n    }\n    return \"'\\\\\" + code.toString(10) + \"'\";\n  }\n  return c === \"'\" || c === \"\\\\\" ? \"'\\\\\" + c + \"'\" : \"'\" + c + \"'\";\n};\n\nexport const showStringImpl = function (s) {\n  var l = s.length;\n  return \"\\\"\" + s.replace(\n    /[\\0-\\x1F\\x7F\"\\\\]/g, // eslint-disable-line no-control-regex\n    function (c, i) {\n      switch (c) {\n        case \"\\\"\":\n        case \"\\\\\":\n          return \"\\\\\" + c;\n        case \"\\x07\": return \"\\\\a\";\n        case \"\\b\": return \"\\\\b\";\n        case \"\\f\": return \"\\\\f\";\n        case \"\\n\": return \"\\\\n\";\n        case \"\\r\": return \"\\\\r\";\n        case \"\\t\": return \"\\\\t\";\n        case \"\\v\": return \"\\\\v\";\n      }\n      var k = i + 1;\n      var empty = k < l && s[k] >= \"0\" && s[k] <= \"9\" ? \"\\\\&\" : \"\";\n      return \"\\\\\" + c.charCodeAt(0).toString(10) + empty;\n    }\n  ) + \"\\\"\";\n};\n\nexport const showArrayImpl = function (f) {\n  return function (xs) {\n    var ss = [];\n    for (var i = 0, l = xs.length; i < l; i++) {\n      ss[i] = f(xs[i]);\n    }\n    return \"[\" + ss.join(\",\") + \"]\";\n  };\n};\n", "module Data.Show\n  ( class Show\n  , show\n  , class ShowRecordFields\n  , showRecordFields\n  ) where\n\nimport Data.Semigroup ((<>))\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Unit (Unit)\nimport Data.Void (Void, absurd)\nimport Prim.Row (class Nub)\nimport Prim.RowList as RL\nimport Record.Unsafe (unsafeGet)\nimport Type.Proxy (Proxy(..))\n\n-- | The `Show` type class represents those types which can be converted into\n-- | a human-readable `String` representation.\n-- |\n-- | While not required, it is recommended that for any expression `x`, the\n-- | string `show x` be executable PureScript code which evaluates to the same\n-- | value as the expression `x`.\nclass Show a where\n  show :: a -> String\n\ninstance showUnit :: Show Unit where\n  show _ = \"unit\"\n\ninstance showBoolean :: Show Boolean where\n  show true = \"true\"\n  show false = \"false\"\n\ninstance showInt :: Show Int where\n  show = showIntImpl\n\ninstance showNumber :: Show Number where\n  show = showNumberImpl\n\ninstance showChar :: Show Char where\n  show = showCharImpl\n\ninstance showString :: Show String where\n  show = showStringImpl\n\ninstance showArray :: Show a => Show (Array a) where\n  show = showArrayImpl show\n\ninstance showProxy :: Show (Proxy a) where\n  show _ = \"Proxy\"\n\ninstance showVoid :: Show Void where\n  show = absurd\n\ninstance showRecord ::\n  ( Nub rs rs\n  , RL.RowToList rs ls\n  , ShowRecordFields ls rs\n  ) =>\n  Show (Record rs) where\n  show record = \"{\" <> showRecordFields (Proxy :: Proxy ls) record <> \"}\"\n\n-- | A class for records where all fields have `Show` instances, used to\n-- | implement the `Show` instance for records.\nclass ShowRecordFields :: RL.RowList Type -> Row Type -> Constraint\nclass ShowRecordFields rowlist row where\n  showRecordFields :: Proxy rowlist -> Record row -> String\n\ninstance showRecordFieldsNil :: ShowRecordFields RL.Nil row where\n  showRecordFields _ _ = \"\"\nelse\ninstance showRecordFieldsConsNil ::\n  ( IsSymbol key\n  , Show focus\n  ) =>\n  ShowRecordFields (RL.Cons key focus RL.Nil) row where\n  showRecordFields _ record = \" \" <> key <> \": \" <> show focus <> \" \"\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    focus = unsafeGet key record :: focus\nelse\ninstance showRecordFieldsCons ::\n  ( IsSymbol key\n  , ShowRecordFields rowlistTail row\n  , Show focus\n  ) =>\n  ShowRecordFields (RL.Cons key focus rowlistTail) row where\n  showRecordFields _ record = \" \" <> key <> \": \" <> show focus <> \",\" <> tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    focus = unsafeGet key record :: focus\n    tail = showRecordFields (Proxy :: Proxy rowlistTail) record\n\nforeign import showIntImpl :: Int -> String\nforeign import showNumberImpl :: Number -> String\nforeign import showCharImpl :: Char -> String\nforeign import showStringImpl :: String -> String\nforeign import showArrayImpl :: forall a. (a -> String) -> Array a -> String\n", "module Data.Maybe where\n\nimport Prelude\n\nimport Control.Alt (class Alt, (<|>))\nimport Control.Alternative (class Alternative)\nimport Control.Extend (class Extend)\nimport Control.Plus (class Plus)\n\nimport Data.Eq (class Eq1)\nimport Data.Functor.Invariant (class Invariant, imapF)\nimport Data.Generic.Rep (class Generic)\nimport Data.Ord (class Ord1)\n\n-- | The `Maybe` type is used to represent optional values and can be seen as\n-- | something like a type-safe `null`, where `Nothing` is `null` and `Just x`\n-- | is the non-null value `x`.\ndata Maybe a = Nothing | Just a\n\n-- | The `Functor` instance allows functions to transform the contents of a\n-- | `Just` with the `<$>` operator:\n-- |\n-- | ``` purescript\n-- | f <$> Just x == Just (f x)\n-- | ```\n-- |\n-- | `Nothing` values are left untouched:\n-- |\n-- | ``` purescript\n-- | f <$> Nothing == Nothing\n-- | ```\ninstance functorMaybe :: Functor Maybe where\n  map fn (Just x) = Just (fn x)\n  map _  _        = Nothing\n\n-- | The `Apply` instance allows functions contained within a `Just` to\n-- | transform a value contained within a `Just` using the `apply` operator:\n-- |\n-- | ``` purescript\n-- | Just f <*> Just x == Just (f x)\n-- | ```\n-- |\n-- | `Nothing` values are left untouched:\n-- |\n-- | ``` purescript\n-- | Just f <*> Nothing == Nothing\n-- | Nothing <*> Just x == Nothing\n-- | ```\n-- |\n-- | Combining `Functor`'s `<$>` with `Apply`'s `<*>` can be used transform a\n-- | pure function to take `Maybe`-typed arguments so `f :: a -> b -> c`\n-- | becomes `f :: Maybe a -> Maybe b -> Maybe c`:\n-- |\n-- | ``` purescript\n-- | f <$> Just x <*> Just y == Just (f x y)\n-- | ```\n-- |\n-- | The `Nothing`-preserving behaviour of both operators means the result of\n-- | an expression like the above but where any one of the values is `Nothing`\n-- | means the whole result becomes `Nothing` also:\n-- |\n-- | ``` purescript\n-- | f <$> Nothing <*> Just y == Nothing\n-- | f <$> Just x <*> Nothing == Nothing\n-- | f <$> Nothing <*> Nothing == Nothing\n-- | ```\ninstance applyMaybe :: Apply Maybe where\n  apply (Just fn) x = fn <$> x\n  apply Nothing   _ = Nothing\n\n-- | The `Applicative` instance enables lifting of values into `Maybe` with the\n-- | `pure` function:\n-- |\n-- | ``` purescript\n-- | pure x :: Maybe _ == Just x\n-- | ```\n-- |\n-- | Combining `Functor`'s `<$>` with `Apply`'s `<*>` and `Applicative`'s\n-- | `pure` can be used to pass a mixture of `Maybe` and non-`Maybe` typed\n-- | values to a function that does not usually expect them, by using `pure`\n-- | for any value that is not already `Maybe` typed:\n-- |\n-- | ``` purescript\n-- | f <$> Just x <*> pure y == Just (f x y)\n-- | ```\n-- |\n-- | Even though `pure = Just` it is recommended to use `pure` in situations\n-- | like this as it allows the choice of `Applicative` to be changed later\n-- | without having to go through and replace `Just` with a new constructor.\ninstance applicativeMaybe :: Applicative Maybe where\n  pure = Just\n\n-- | The `Alt` instance allows for a choice to be made between two `Maybe`\n-- | values with the `<|>` operator, where the first `Just` encountered\n-- | is taken.\n-- |\n-- | ``` purescript\n-- | Just x <|> Just y == Just x\n-- | Nothing <|> Just y == Just y\n-- | Nothing <|> Nothing == Nothing\n-- | ```\ninstance altMaybe :: Alt Maybe where\n  alt Nothing r = r\n  alt l       _ = l\n\n-- | The `Plus` instance provides a default `Maybe` value:\n-- |\n-- | ``` purescript\n-- | empty :: Maybe _ == Nothing\n-- | ```\ninstance plusMaybe :: Plus Maybe where\n  empty = Nothing\n\n-- | The `Alternative` instance guarantees that there are both `Applicative` and\n-- | `Plus` instances for `Maybe`.\ninstance alternativeMaybe :: Alternative Maybe\n\n-- | The `Bind` instance allows sequencing of `Maybe` values and functions that\n-- | return a `Maybe` by using the `>>=` operator:\n-- |\n-- | ``` purescript\n-- | Just x >>= f = f x\n-- | Nothing >>= f = Nothing\n-- | ```\ninstance bindMaybe :: Bind Maybe where\n  bind (Just x) k = k x\n  bind Nothing  _ = Nothing\n\n-- | The `Monad` instance guarantees that there are both `Applicative` and\n-- | `Bind` instances for `Maybe`. This also enables the `do` syntactic sugar:\n-- |\n-- | ``` purescript\n-- | do\n-- |   x' <- x\n-- |   y' <- y\n-- |   pure (f x' y')\n-- | ```\n-- |\n-- | Which is equivalent to:\n-- |\n-- | ``` purescript\n-- | x >>= (\\x' -> y >>= (\\y' -> pure (f x' y')))\n-- | ```\n-- |\n-- | Which is equivalent to:\n-- |\n-- | ``` purescript\n-- | case x of\n-- |   Nothing -> Nothing\n-- |   Just x' -> case y of\n-- |     Nothing -> Nothing\n-- |     Just y' -> Just (f x' y')\n-- | ```\ninstance monadMaybe :: Monad Maybe\n\n-- | The `Extend` instance allows sequencing of `Maybe` values and functions\n-- | that accept a `Maybe a` and return a non-`Maybe` result using the\n-- | `<<=` operator.\n-- |\n-- | ``` purescript\n-- | f <<= Nothing = Nothing\n-- | f <<= x = Just (f x)\n-- | ```\ninstance extendMaybe :: Extend Maybe where\n  extend _ Nothing  = Nothing\n  extend f x        = Just (f x)\n\ninstance invariantMaybe :: Invariant Maybe where\n  imap = imapF\n\n-- | The `Semigroup` instance enables use of the operator `<>` on `Maybe` values\n-- | whenever there is a `Semigroup` instance for the type the `Maybe` contains.\n-- | The exact behaviour of `<>` depends on the \"inner\" `Semigroup` instance,\n-- | but generally captures the notion of appending or combining things.\n-- |\n-- | ``` purescript\n-- | Just x <> Just y = Just (x <> y)\n-- | Just x <> Nothing = Just x\n-- | Nothing <> Just y = Just y\n-- | Nothing <> Nothing = Nothing\n-- | ```\ninstance semigroupMaybe :: Semigroup a => Semigroup (Maybe a) where\n  append Nothing y = y\n  append x Nothing = x\n  append (Just x) (Just y) = Just (x <> y)\n\ninstance monoidMaybe :: Semigroup a => Monoid (Maybe a) where\n  mempty = Nothing\n\ninstance semiringMaybe :: Semiring a => Semiring (Maybe a) where\n  zero = Nothing\n  one = Just one\n\n  add Nothing y = y\n  add x Nothing = x\n  add (Just x) (Just y) = Just (add x y)\n\n  mul x y = mul <$> x <*> y\n\n-- | The `Eq` instance allows `Maybe` values to be checked for equality with\n-- | `==` and inequality with `/=` whenever there is an `Eq` instance for the\n-- | type the `Maybe` contains.\nderive instance eqMaybe :: Eq a => Eq (Maybe a)\n\ninstance eq1Maybe :: Eq1 Maybe where eq1 = eq\n\n-- | The `Ord` instance allows `Maybe` values to be compared with\n-- | `compare`, `>`, `>=`, `<` and `<=` whenever there is an `Ord` instance for\n-- | the type the `Maybe` contains.\n-- |\n-- | `Nothing` is considered to be less than any `Just` value.\nderive instance ordMaybe :: Ord a => Ord (Maybe a)\n\ninstance ord1Maybe :: Ord1 Maybe where compare1 = compare\n\ninstance boundedMaybe :: Bounded a => Bounded (Maybe a) where\n  top = Just top\n  bottom = Nothing\n\n-- | The `Show` instance allows `Maybe` values to be rendered as a string with\n-- | `show` whenever there is an `Show` instance for the type the `Maybe`\n-- | contains.\ninstance showMaybe :: Show a => Show (Maybe a) where\n  show (Just x) = \"(Just \" <> show x <> \")\"\n  show Nothing  = \"Nothing\"\n\nderive instance genericMaybe :: Generic (Maybe a) _\n\n-- | Takes a default value, a function, and a `Maybe` value. If the `Maybe`\n-- | value is `Nothing` the default value is returned, otherwise the function\n-- | is applied to the value inside the `Just` and the result is returned.\n-- |\n-- | ``` purescript\n-- | maybe x f Nothing == x\n-- | maybe x f (Just y) == f y\n-- | ```\nmaybe :: forall a b. b -> (a -> b) -> Maybe a -> b\nmaybe b _ Nothing = b\nmaybe _ f (Just a) = f a\n\n-- | Similar to `maybe` but for use in cases where the default value may be\n-- | expensive to compute. As PureScript is not lazy, the standard `maybe` has\n-- | to evaluate the default value before returning the result, whereas here\n-- | the value is only computed when the `Maybe` is known to be `Nothing`.\n-- |\n-- | ``` purescript\n-- | maybe' (\\_ -> x) f Nothing == x\n-- | maybe' (\\_ -> x) f (Just y) == f y\n-- | ```\nmaybe' :: forall a b. (Unit -> b) -> (a -> b) -> Maybe a -> b\nmaybe' g _ Nothing = g unit\nmaybe' _ f (Just a) = f a\n\n-- | Takes a default value, and a `Maybe` value. If the `Maybe` value is\n-- | `Nothing` the default value is returned, otherwise the value inside the\n-- | `Just` is returned.\n-- |\n-- | ``` purescript\n-- | fromMaybe x Nothing == x\n-- | fromMaybe x (Just y) == y\n-- | ```\nfromMaybe :: forall a. a -> Maybe a -> a\nfromMaybe a = maybe a identity\n\n-- | Similar to `fromMaybe` but for use in cases where the default value may be\n-- | expensive to compute. As PureScript is not lazy, the standard `fromMaybe`\n-- | has to evaluate the default value before returning the result, whereas here\n-- | the value is only computed when the `Maybe` is known to be `Nothing`.\n-- |\n-- | ``` purescript\n-- | fromMaybe' (\\_ -> x) Nothing == x\n-- | fromMaybe' (\\_ -> x) (Just y) == y\n-- | ```\nfromMaybe' :: forall a. (Unit -> a) -> Maybe a -> a\nfromMaybe' a = maybe' a identity\n\n-- | Returns `true` when the `Maybe` value was constructed with `Just`.\nisJust :: forall a. Maybe a -> Boolean\nisJust = maybe false (const true)\n\n-- | Returns `true` when the `Maybe` value is `Nothing`.\nisNothing :: forall a. Maybe a -> Boolean\nisNothing = maybe true (const false)\n\n-- | A partial function that extracts the value from the `Just` data\n-- | constructor. Passing `Nothing` to `fromJust` will throw an error at\n-- | runtime.\nfromJust :: forall a. Partial => Maybe a -> a\nfromJust (Just x) = x\n\n-- | One or none.\n-- |\n-- | ```purescript\n-- | optional empty = pure Nothing\n-- | ```\n-- |\n-- | The behaviour of `optional (pure x)` depends on whether the `Alt` instance\n-- | satisfy the left catch law (`pure a <|> b = pure a`).\n-- |\n-- | `Either e` does:\n-- |\n-- | ```purescript\n-- | optional (Right x) = Right (Just x)\n-- | ```\n-- |\n-- | But `Array` does not:\n-- |\n-- | ```purescript\n-- | optional [x] = [Just x, Nothing]\n-- | ```\noptional :: forall f a. Alt f => Applicative f => f a -> f (Maybe a)\noptional a = map Just a <|> pure Nothing\n", "module Data.MediaType.Common where\n\nimport Data.MediaType (MediaType(..))\n\n-- | The `application/x-www-form-urlencoded` media type.\napplicationFormURLEncoded :: MediaType\napplicationFormURLEncoded = MediaType \"application/x-www-form-urlencoded\"\n\n-- | The `application/json` media type.\napplicationJSON :: MediaType\napplicationJSON = MediaType \"application/json\"\n\n-- | The `application/javascript` media type.\napplicationJavascript :: MediaType\napplicationJavascript = MediaType \"application/javascript\"\n\n-- | The `application/octet-stream` media type.\napplicationOctetStream :: MediaType\napplicationOctetStream = MediaType \"application/octet-stream\"\n\n-- | The `application/xml` media type.\napplicationXML :: MediaType\napplicationXML = MediaType \"application/xml\"\n\n-- | The `image/gif` media type.\nimageGIF :: MediaType\nimageGIF = MediaType \"image/gif\"\n\n-- | The `image/jpeg` media type.\nimageJPEG :: MediaType\nimageJPEG = MediaType \"image/jpeg\"\n\n-- | The `image/png` media type.\nimagePNG :: MediaType\nimagePNG = MediaType \"image/png\"\n\n-- | The `multipart/form-data` media type.\nmultipartFormData :: MediaType\nmultipartFormData = MediaType \"multipart/form-data\"\n\n-- | The `text/csv` media type.\ntextCSV :: MediaType\ntextCSV = MediaType \"text/csv\"\n\n-- | The `text/html` media type.\ntextHTML :: MediaType\ntextHTML = MediaType \"text/html\"\n\n-- | The `text/plain` media type.\ntextPlain :: MediaType\ntextPlain = MediaType \"text/plain\"\n\n-- | The `text/xml` media type.\ntextXML :: MediaType\ntextXML = MediaType \"text/xml\"\n\n-- | The `text/css` media type.\ntextCSS :: MediaType\ntextCSS = MediaType \"text/css\"\n", "module Affjax.RequestBody where\n\nimport Data.Argonaut.Core (Json)\nimport Data.ArrayBuffer.Types as A\nimport Data.FormURLEncoded (FormURLEncoded)\nimport Data.Maybe (Maybe(..))\nimport Data.MediaType (MediaType)\nimport Data.MediaType.Common (applicationJSON, applicationFormURLEncoded)\nimport Web.DOM.Document (Document)\nimport Web.File.Blob (Blob)\nimport Web.XHR.FormData (FormData)\n\n-- | Represents data for an HTTP request that will be included in the request\n-- | body.\ndata RequestBody\n  = ArrayView (forall r. (forall a. A.ArrayView a -> r) -> r)\n  | Blob Blob\n  | Document Document\n  | String String\n  | FormData FormData\n  | FormURLEncoded FormURLEncoded\n  | Json Json\n\narrayView :: forall a. A.ArrayView a -> RequestBody\narrayView av = ArrayView \\f -> f av\n\nblob :: Blob -> RequestBody\nblob = Blob\n\ndocument :: Document -> RequestBody\ndocument = Document\n\nstring :: String -> RequestBody\nstring = String\n\nformData :: FormData -> RequestBody\nformData = FormData\n\nformURLEncoded :: FormURLEncoded -> RequestBody\nformURLEncoded = FormURLEncoded\n\njson :: Json -> RequestBody\njson = Json\n\ntoMediaType :: RequestBody -> Maybe MediaType\ntoMediaType = case _ of\n  FormURLEncoded _ -> Just applicationFormURLEncoded\n  Json _ -> Just applicationJSON\n  _ -> Nothing\n", "// module Unsafe.Coerce\n\nexport const unsafeCoerce = function (x) {\n  return x;\n};\n", "module Safe.Coerce\n  ( module Prim.Coerce\n  , coerce\n  ) where\n\nimport Prim.Coerce (class Coercible)\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | Coerce a value of one type to a value of some other type, without changing\n-- | its runtime representation. This function behaves identically to\n-- | `unsafeCoerce` at runtime. Unlike `unsafeCoerce`, it is safe, because the\n-- | `Coercible` constraint prevents any use of this function from compiling\n-- | unless the compiler can prove that the two types have the same runtime\n-- | representation.\n-- |\n-- | One application for this function is to avoid doing work that you know is a\n-- | no-op because of newtypes. For example, if you have an `Array (Conj a)` and you\n-- | want an `Array (Disj a)`, you could do `Data.Array.map (un Conj >>> Disj)`, but\n-- | this performs an unnecessary traversal of the array, with O(n) cost.\n-- | `coerce` accomplishes the same with only O(1) cost:\n-- |\n-- | ```purescript\n-- | mapConjToDisj :: forall a. Array (Conj a) -> Array (Disj a)\n-- | mapConjToDisj = coerce\n-- | ```\ncoerce :: forall a b. Coercible a b => a -> b\ncoerce = unsafeCoerce\n", "module Data.Newtype where\n\nimport Data.Monoid.Additive (Additive(..))\nimport Data.Monoid.Conj (Conj(..))\nimport Data.Monoid.Disj (Disj(..))\nimport Data.Monoid.Dual (Dual(..))\nimport Data.Monoid.Endo (Endo(..))\nimport Data.Monoid.Multiplicative (Multiplicative(..))\nimport Data.Semigroup.First (First(..))\nimport Data.Semigroup.Last (Last(..))\nimport Safe.Coerce (class Coercible, coerce)\n\n-- | A type class for `newtype`s to enable convenient wrapping and unwrapping,\n-- | and the use of the other functions in this module.\n-- |\n-- | The compiler can derive instances of `Newtype` automatically:\n-- |\n-- | ``` purescript\n-- | newtype EmailAddress = EmailAddress String\n-- |\n-- | derive instance newtypeEmailAddress :: Newtype EmailAddress _\n-- | ```\n-- |\n-- | Note that deriving for `Newtype` instances requires that the type be\n-- | defined as `newtype` rather than `data` declaration (even if the `data`\n-- | structurally fits the rules of a `newtype`), and the use of a wildcard for\n-- | the wrapped type.\nclass Newtype :: Type -> Type -> Constraint\nclass Coercible t a <= Newtype t a | t -> a\n\nwrap :: forall t a. Newtype t a => a -> t\nwrap = coerce\n\nunwrap :: forall t a. Newtype t a => t -> a\nunwrap = coerce\n\ninstance newtypeAdditive :: Newtype (Additive a) a\n\ninstance newtypeMultiplicative :: Newtype (Multiplicative a) a\n\ninstance newtypeConj :: Newtype (Conj a) a\n\ninstance newtypeDisj :: Newtype (Disj a) a\n\ninstance newtypeDual :: Newtype (Dual a) a\n\ninstance newtypeEndo :: Newtype (Endo c a) (c a a)\n\ninstance newtypeFirst :: Newtype (First a) a\n\ninstance newtypeLast :: Newtype (Last a) a\n\n-- | Given a constructor for a `Newtype`, this returns the appropriate `unwrap`\n-- | function.\nun :: forall t a. Newtype t a => (a -> t) -> t -> a\nun _ = unwrap\n\n-- | This combinator unwraps the newtype, applies a monomorphic function to the \n-- | contained value and wraps the result back in the newtype\nmodify :: forall t a. Newtype t a => (a -> a) -> t -> t\nmodify fn t = wrap (fn (unwrap t))\n\n-- | This combinator is for when you have a higher order function that you want\n-- | to use in the context of some newtype - `foldMap` being a common example:\n-- |\n-- | ``` purescript\n-- | ala Additive foldMap [1,2,3,4] -- 10\n-- | ala Multiplicative foldMap [1,2,3,4] -- 24\n-- | ala Conj foldMap [true, false] -- false\n-- | ala Disj foldMap [true, false] -- true\n-- | ```\nala\n  :: forall f t a s b\n   . Coercible (f t) (f a)\n  => Newtype t a\n  => Newtype s b\n  => (a -> t)\n  -> ((b -> s) -> f t)\n  -> f a\nala _ f = coerce (f wrap)\n\n-- | Similar to `ala` but useful for cases where you want to use an additional\n-- | projection with the higher order function:\n-- |\n-- | ``` purescript\n-- | alaF Additive foldMap String.length [\"hello\", \"world\"] -- 10\n-- | alaF Multiplicative foldMap Math.abs [1.0, -2.0, 3.0, -4.0] -- 24.0\n-- | ```\n-- |\n-- | The type admits other possibilities due to the polymorphic `Functor`\n-- | constraints, but the case described above works because ((->) a) is a\n-- | `Functor`.\nalaF\n  :: forall f g t a s b\n   . Coercible (f t) (f a)\n  => Coercible (g s) (g b)\n  => Newtype t a\n  => Newtype s b\n  => (a -> t)\n  -> (f t -> g s)\n  -> f a\n  -> g b\nalaF _ = coerce\n\n-- | Lifts a function operate over newtypes. This can be used to lift a\n-- | function to manipulate the contents of a single newtype, somewhat like\n-- | `map` does for a `Functor`:\n-- |\n-- | ``` purescript\n-- | newtype Label = Label String\n-- | derive instance newtypeLabel :: Newtype Label _\n-- |\n-- | toUpperLabel :: Label -> Label\n-- | toUpperLabel = over Label String.toUpper\n-- | ```\n-- |\n-- | But the result newtype is polymorphic, meaning the result can be returned\n-- | as an alternative newtype:\n-- |\n-- | ``` purescript\n-- | newtype UppercaseLabel = UppercaseLabel String\n-- | derive instance newtypeUppercaseLabel :: Newtype UppercaseLabel _\n-- |\n-- | toUpperLabel' :: Label -> UppercaseLabel\n-- | toUpperLabel' = over Label String.toUpper\n-- | ```\nover\n  :: forall t a s b\n   . Newtype t a\n  => Newtype s b\n  => (a -> t)\n  -> (a -> b)\n  -> t\n  -> s\nover _ = coerce\n\n-- | Much like `over`, but where the lifted function operates on values in a\n-- | `Functor`:\n-- |\n-- | ``` purescript\n-- | findLabel :: String -> Array Label -> Maybe Label\n-- | findLabel s = overF Label (Foldable.find (_ == s))\n-- | ```\n-- |\n-- | The above example also demonstrates that the functor type is polymorphic\n-- | here too, the input is an `Array` but the result is a `Maybe`.\noverF\n  :: forall f g t a s b\n   . Coercible (f a) (f t)\n  => Coercible (g b) (g s)\n  => Newtype t a\n  => Newtype s b\n  => (a -> t)\n  -> (f a -> g b)\n  -> f t\n  -> g s\noverF _ = coerce\n\n-- | The opposite of `over`: lowers a function that operates on `Newtype`d\n-- | values to operate on the wrapped value instead.\n-- |\n-- | ``` purescript\n-- | newtype Degrees = Degrees Number\n-- | derive instance newtypeDegrees :: Newtype Degrees _\n-- |\n-- | newtype NormalDegrees = NormalDegrees Number\n-- | derive instance newtypeNormalDegrees :: Newtype NormalDegrees _\n-- |\n-- | normaliseDegrees :: Degrees -> NormalDegrees\n-- | normaliseDegrees (Degrees deg) = NormalDegrees (deg % 360.0)\n-- |\n-- | asNormalDegrees :: Number -> Number\n-- | asNormalDegrees = under Degrees normaliseDegrees\n-- | ```\n-- |\n-- | As with `over` the `Newtype` is polymorphic, as illustrated in the example\n-- | above - both `Degrees` and `NormalDegrees` are instances of `Newtype`,\n-- | so even though `normaliseDegrees` changes the result type we can still put\n-- | a `Number` in and get a `Number` out via `under`.\nunder\n  :: forall t a s b\n   . Newtype t a\n  => Newtype s b\n  => (a -> t)\n  -> (t -> s)\n  -> a\n  -> b\nunder _ = coerce\n\n-- | Much like `under`, but where the lifted function operates on values in a\n-- | `Functor`:\n-- |\n-- | ``` purescript\n-- | newtype EmailAddress = EmailAddress String\n-- | derive instance newtypeEmailAddress :: Newtype EmailAddress _\n-- |\n-- | isValid :: EmailAddress -> Boolean\n-- | isValid x = false -- imagine a slightly less strict predicate here\n-- |\n-- | findValidEmailString :: Array String -> Maybe String\n-- | findValidEmailString = underF EmailAddress (Foldable.find isValid)\n-- | ```\n-- |\n-- | The above example also demonstrates that the functor type is polymorphic\n-- | here too, the input is an `Array` but the result is a `Maybe`.\nunderF\n  :: forall f g t a s b\n   . Coercible (f t) (f a)\n  => Coercible (g s) (g b)\n  => Newtype t a\n  => Newtype s b\n  => (a -> t)\n  -> (f t -> g s)\n  -> f a\n  -> g b\nunderF _ = coerce\n\n-- | Lifts a binary function to operate over newtypes.\n-- |\n-- | ``` purescript\n-- | newtype Meter = Meter Int\n-- | derive newtype instance newtypeMeter :: Newtype Meter _\n-- | newtype SquareMeter = SquareMeter Int\n-- | derive newtype instance newtypeSquareMeter :: Newtype SquareMeter _\n-- |\n-- | area :: Meter -> Meter -> SquareMeter\n-- | area = over2 Meter (*)\n-- | ```\n-- |\n-- | The above example also demonstrates that the return type is polymorphic\n-- | here too.\nover2\n  :: forall t a s b\n   . Newtype t a\n  => Newtype s b\n  => (a -> t)\n  -> (a -> a -> b)\n  -> t\n  -> t\n  -> s\nover2 _ = coerce\n\n-- | Much like `over2`, but where the lifted binary function operates on\n-- | values in a `Functor`.\noverF2\n  :: forall f g t a s b\n   . Coercible (f a) (f t)\n  => Coercible (g b) (g s)\n  => Newtype t a\n  => Newtype s b\n  => (a -> t)\n  -> (f a -> f a -> g b)\n  -> f t\n  -> f t\n  -> g s\noverF2 _ = coerce\n\n-- | The opposite of `over2`: lowers a binary function that operates on `Newtype`d\n-- | values to operate on the wrapped value instead.\nunder2\n  :: forall t a s b\n   . Newtype t a\n  => Newtype s b\n  => (a -> t)\n  -> (t -> t -> s)\n  -> a\n  -> a\n  -> b\nunder2 _ = coerce\n\n-- | Much like `under2`, but where the lifted binary function operates on\n-- | values in a `Functor`.\nunderF2\n  :: forall f g t a s b\n   . Coercible (f t) (f a)\n  => Coercible (g s) (g b)\n  => Newtype t a\n  => Newtype s b\n  => (a -> t)\n  -> (f t -> f t -> g s)\n  -> f a\n  -> f a\n  -> g b\nunderF2 _ = coerce\n\n-- | Similar to the function from the `Traversable` class, but operating within\n-- | a newtype instead.\ntraverse\n  :: forall f t a\n   . Coercible (f a) (f t)\n  => Newtype t a\n  => (a -> t)\n  -> (a -> f a)\n  -> t\n  -> f t\ntraverse _ = coerce\n\n-- | Similar to the function from the `Distributive` class, but operating within\n-- | a newtype instead.\ncollect\n  :: forall f t a\n   . Coercible (f a) (f t)\n  => Newtype t a\n  => (a -> t)\n  -> (f a -> a)\n  -> f t\n  -> t\ncollect _ = coerce\n", "module Affjax.RequestHeader where\n\nimport Prelude\n\nimport Data.MediaType (MediaType)\nimport Data.Newtype (unwrap)\n\ndata RequestHeader\n  = Accept MediaType\n  | ContentType MediaType\n  | RequestHeader String String\n\nderive instance eqRequestHeader :: Eq RequestHeader\nderive instance ordRequestHeader :: Ord RequestHeader\n\ninstance showRequestHeader :: Show RequestHeader where\n  show (Accept m) = \"(Accept \" <> show m <> \")\"\n  show (ContentType m) = \"(ContentType \" <> show m <> \")\"\n  show (RequestHeader h v) = \"(RequestHeader \" <> show h <> \" \" <> show v <> \")\"\n\nname :: RequestHeader -> String\nname (Accept _) = \"Accept\"\nname (ContentType _) = \"Content-Type\"\nname (RequestHeader h _) = h\n\nvalue :: RequestHeader -> String\nvalue (Accept m) = unwrap m\nvalue (ContentType m) = unwrap m\nvalue (RequestHeader _ v) = v\n", "module Affjax.ResponseFormat where\n\nimport Prelude\n\nimport Data.Argonaut.Core (Json)\nimport Data.ArrayBuffer.Types (ArrayBuffer)\nimport Data.Maybe (Maybe(..))\nimport Data.MediaType (MediaType)\nimport Data.MediaType.Common (applicationJSON)\nimport Web.DOM.Document (Document)\nimport Web.File.Blob (Blob)\n\n-- | Used to represent how a HTTP response body should be interpreted.\ndata ResponseFormat a\n  = ArrayBuffer (forall f. f ArrayBuffer -> f a)\n  | Blob (forall f. f Blob -> f a)\n  | Document (forall f. f Document -> f a)\n  | Json (forall f. f Json -> f a)\n  | String (forall f. f String -> f a)\n  | Ignore (forall f. f Unit -> f a)\n\narrayBuffer :: ResponseFormat ArrayBuffer\narrayBuffer = ArrayBuffer identity\n\nblob :: ResponseFormat Blob\nblob = Blob identity\n\ndocument :: ResponseFormat Document\ndocument = Document identity\n\njson :: ResponseFormat Json\njson = Json identity\n\nstring :: ResponseFormat String\nstring = String identity\n\nignore :: ResponseFormat Unit\nignore = Ignore identity\n\n-- | Converts a `Response a` into a string representation of the response type\n-- | that it represents.\ntoResponseType :: forall a. ResponseFormat a -> String\ntoResponseType =\n  case _ of\n    ArrayBuffer _ -> \"arraybuffer\"\n    Blob _ -> \"blob\"\n    Document _ -> \"document\"\n    Json _ -> \"text\" -- IE doesn't support \"json\" ResponseFormat\n    String _ -> \"text\"\n    Ignore _ -> \"\"\n\ntoMediaType :: forall a. ResponseFormat a -> Maybe MediaType\ntoMediaType =\n  case _ of\n    Json _ -> Just applicationJSON\n    _ -> Nothing\n", "module Affjax.ResponseHeader where\n\nimport Prelude\n\ndata ResponseHeader = ResponseHeader String String\n\nderive instance eqResponseHeader :: Eq ResponseHeader\nderive instance ordResponseHeader :: Ord ResponseHeader\n\ninstance showResponseHeader :: Show ResponseHeader where\n  show (ResponseHeader h v) = \"(ResponseHeader \" <> show h <> \" \" <> show v <> \")\"\n\nname :: ResponseHeader -> String\nname (ResponseHeader h _) = h\n\nvalue :: ResponseHeader -> String\nvalue (ResponseHeader _ v) = v\n", "export const arrayBind = function (arr) {\n  return function (f) {\n    var result = [];\n    for (var i = 0, l = arr.length; i < l; i++) {\n      Array.prototype.push.apply(result, f(arr[i]));\n    }\n    return result;\n  };\n};\n", "module Control.Bind\n  ( class Bind\n  , bind\n  , (>>=)\n  , bindFlipped\n  , (=<<)\n  , class Discard\n  , discard\n  , join\n  , composeKleisli\n  , (>=>)\n  , composeKleisliFlipped\n  , (<=<)\n  , ifM\n  , module Data.Functor\n  , module Control.Apply\n  , module Control.Applicative\n  ) where\n\nimport Control.Applicative (class Applicative, liftA1, pure, unless, when)\nimport Control.Apply (class Apply, apply, (*>), (<*), (<*>))\nimport Control.Category (identity)\n\nimport Data.Function (flip)\nimport Data.Functor (class Functor, map, void, ($>), (<#>), (<$), (<$>))\nimport Data.Unit (Unit)\nimport Type.Proxy (Proxy(..))\n\n-- | The `Bind` type class extends the [`Apply`](#apply) type class with a\n-- | \"bind\" operation `(>>=)` which composes computations in sequence, using\n-- | the return value of one computation to determine the next computation.\n-- |\n-- | The `>>=` operator can also be expressed using `do` notation, as follows:\n-- |\n-- | ```purescript\n-- | x >>= f = do y <- x\n-- |              f y\n-- | ```\n-- |\n-- | where the function argument of `f` is given the name `y`.\n-- |\n-- | Instances must satisfy the following laws in addition to the `Apply`\n-- | laws:\n-- |\n-- | - Associativity: `(x >>= f) >>= g = x >>= (\\k -> f k >>= g)`\n-- | - Apply Superclass: `apply f x = f >>= \\f\u2019 -> map f\u2019 x`\n-- |\n-- | Associativity tells us that we can regroup operations which use `do`\n-- | notation so that we can unambiguously write, for example:\n-- |\n-- | ```purescript\n-- | do x <- m1\n-- |    y <- m2 x\n-- |    m3 x y\n-- | ```\nclass Apply m <= Bind m where\n  bind :: forall a b. m a -> (a -> m b) -> m b\n\ninfixl 1 bind as >>=\n\n-- | `bindFlipped` is `bind` with its arguments reversed. For example:\n-- |\n-- | ```purescript\n-- | print =<< random\n-- | ```\nbindFlipped :: forall m a b. Bind m => (a -> m b) -> m a -> m b\nbindFlipped = flip bind\n\ninfixr 1 bindFlipped as =<<\n\ninstance bindFn :: Bind ((->) r) where\n  bind m f x = f (m x) x\n\n-- | The `bind`/`>>=` function for `Array` works by applying a function to\n-- | each element in the array, and flattening the results into a single,\n-- | new array.\n-- |\n-- | Array's `bind`/`>>=` works like a nested for loop. Each `bind` adds\n-- | another level of nesting in the loop. For example:\n-- | ```\n-- | foo :: Array String\n-- | foo =\n-- |   [\"a\", \"b\"] >>= \\eachElementInArray1 ->\n-- |     [\"c\", \"d\"] >>= \\eachElementInArray2\n-- |       pure (eachElementInArray1 <> eachElementInArray2)\n-- |\n-- | -- In other words...\n-- | foo\n-- | -- ... is the same as...\n-- | [ (\"a\" <> \"c\"), (\"a\" <> \"d\"), (\"b\" <> \"c\"), (\"b\" <> \"d\") ]\n-- | -- which simplifies to...\n-- | [ \"ac\", \"ad\", \"bc\", \"bd\" ]\n-- | ```\ninstance bindArray :: Bind Array where\n  bind = arrayBind\n\nforeign import arrayBind :: forall a b. Array a -> (a -> Array b) -> Array b\n\ninstance bindProxy :: Bind Proxy where\n  bind _ _ = Proxy\n\n-- | A class for types whose values can safely be discarded\n-- | in a `do` notation block.\n-- |\n-- | An example is the `Unit` type, since there is only one\n-- | possible value which can be returned.\nclass Discard a where\n  discard :: forall f b. Bind f => f a -> (a -> f b) -> f b\n\ninstance discardUnit :: Discard Unit where\n  discard = bind\n\ninstance discardProxy :: Discard (Proxy a) where\n  discard = bind\n\n-- | Collapse two applications of a monadic type constructor into one.\njoin :: forall a m. Bind m => m (m a) -> m a\njoin m = m >>= identity\n\n-- | Forwards Kleisli composition.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | import Data.Array (head, tail)\n-- |\n-- | third = tail >=> tail >=> head\n-- | ```\ncomposeKleisli :: forall a b c m. Bind m => (a -> m b) -> (b -> m c) -> a -> m c\ncomposeKleisli f g a = f a >>= g\n\ninfixr 1 composeKleisli as >=>\n\n-- | Backwards Kleisli composition.\ncomposeKleisliFlipped :: forall a b c m. Bind m => (b -> m c) -> (a -> m b) -> a -> m c\ncomposeKleisliFlipped f g a = f =<< g a\n\ninfixr 1 composeKleisliFlipped as <=<\n\n-- | Execute a monadic action if a condition holds.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | main = ifM ((< 0.5) <$> random)\n-- |          (trace \"Heads\")\n-- |          (trace \"Tails\")\n-- | ```\nifM :: forall a m. Bind m => m Boolean -> m a -> m a -> m a\nifM cond t f = cond >>= \\cond' -> if cond' then t else f\n", "module Data.Either where\n\nimport Prelude\n\nimport Control.Alt (class Alt, (<|>))\nimport Control.Extend (class Extend)\nimport Data.Eq (class Eq1)\nimport Data.Functor.Invariant (class Invariant, imapF)\nimport Data.Generic.Rep (class Generic)\nimport Data.Maybe (Maybe(..), maybe, maybe')\nimport Data.Ord (class Ord1)\n\n-- | The `Either` type is used to represent a choice between two types of value.\n-- |\n-- | A common use case for `Either` is error handling, where `Left` is used to\n-- | carry an error value and `Right` is used to carry a success value.\ndata Either a b = Left a | Right b\n\n-- | The `Functor` instance allows functions to transform the contents of a\n-- | `Right` with the `<$>` operator:\n-- |\n-- | ``` purescript\n-- | f <$> Right x == Right (f x)\n-- | ```\n-- |\n-- | `Left` values are untouched:\n-- |\n-- | ``` purescript\n-- | f <$> Left y == Left y\n-- | ```\nderive instance functorEither :: Functor (Either a)\n\nderive instance genericEither :: Generic (Either a b) _\n\ninstance invariantEither :: Invariant (Either a) where\n  imap = imapF\n\n-- | The `Apply` instance allows functions contained within a `Right` to\n-- | transform a value contained within a `Right` using the `(<*>)` operator:\n-- |\n-- | ``` purescript\n-- | Right f <*> Right x == Right (f x)\n-- | ```\n-- |\n-- | `Left` values are left untouched:\n-- |\n-- | ``` purescript\n-- | Left f <*> Right x == Left f\n-- | Right f <*> Left y == Left y\n-- | ```\n-- |\n-- | Combining `Functor`'s `<$>` with `Apply`'s `<*>` can be used to transform a\n-- | pure function to take `Either`-typed arguments so `f :: a -> b -> c`\n-- | becomes `f :: Either l a -> Either l b -> Either l c`:\n-- |\n-- | ``` purescript\n-- | f <$> Right x <*> Right y == Right (f x y)\n-- | ```\n-- |\n-- | The `Left`-preserving behaviour of both operators means the result of\n-- | an expression like the above but where any one of the values is `Left`\n-- | means the whole result becomes `Left` also, taking the first `Left` value\n-- | found:\n-- |\n-- | ``` purescript\n-- | f <$> Left x <*> Right y == Left x\n-- | f <$> Right x <*> Left y == Left y\n-- | f <$> Left x <*> Left y == Left x\n-- | ```\ninstance applyEither :: Apply (Either e) where\n  apply (Left e) _ = Left e\n  apply (Right f) r = f <$> r\n\n-- | The `Applicative` instance enables lifting of values into `Either` with the\n-- | `pure` function:\n-- |\n-- | ``` purescript\n-- | pure x :: Either _ _ == Right x\n-- | ```\n-- |\n-- | Combining `Functor`'s `<$>` with `Apply`'s `<*>` and `Applicative`'s\n-- | `pure` can be used to pass a mixture of `Either` and non-`Either` typed\n-- | values to a function that does not usually expect them, by using `pure`\n-- | for any value that is not already `Either` typed:\n-- |\n-- | ``` purescript\n-- | f <$> Right x <*> pure y == Right (f x y)\n-- | ```\n-- |\n-- | Even though `pure = Right` it is recommended to use `pure` in situations\n-- | like this as it allows the choice of `Applicative` to be changed later\n-- | without having to go through and replace `Right` with a new constructor.\ninstance applicativeEither :: Applicative (Either e) where\n  pure = Right\n\n-- | The `Alt` instance allows for a choice to be made between two `Either`\n-- | values with the `<|>` operator, where the first `Right` encountered\n-- | is taken.\n-- |\n-- | ``` purescript\n-- | Right x <|> Right y == Right x\n-- | Left x <|> Right y == Right y\n-- | Left x <|> Left y == Left y\n-- | ```\ninstance altEither :: Alt (Either e) where\n  alt (Left _) r = r\n  alt l        _ = l\n\n-- | The `Bind` instance allows sequencing of `Either` values and functions that\n-- | return an `Either` by using the `>>=` operator:\n-- |\n-- | ``` purescript\n-- | Left x >>= f = Left x\n-- | Right x >>= f = f x\n-- | ```\n-- |\n-- | `Either`'s \"do notation\" can be understood to work like this:\n-- | ``` purescript\n-- | x :: forall e a. Either e a\n-- | x = --\n-- |\n-- | y :: forall e b. Either e b\n-- | y = --\n-- |\n-- | foo :: forall e a. (a -> b -> c) -> Either e c\n-- | foo f = do\n-- |   x' <- x\n-- |   y' <- y\n-- |   pure (f x' y')\n-- | ```\n-- |\n-- | ...which is equivalent to...\n-- |\n-- | ``` purescript\n-- | x >>= (\\x' -> y >>= (\\y' -> pure (f x' y')))\n-- | ```\n-- |\n-- | ...and is the same as writing...\n-- |\n-- | ```\n-- | foo :: forall e a. (a -> b -> c) -> Either e c\n-- | foo f = case x of\n-- |   Left e ->\n-- |     Left e\n-- |   Right x -> case y of\n-- |     Left e ->\n-- |       Left e\n-- |     Right y ->\n-- |       Right (f x y)\n-- | ```\ninstance bindEither :: Bind (Either e) where\n  bind = either (\\e _ -> Left e) (\\a f -> f a)\n\n-- | The `Monad` instance guarantees that there are both `Applicative` and\n-- | `Bind` instances for `Either`.\ninstance monadEither :: Monad (Either e)\n\n-- | The `Extend` instance allows sequencing of `Either` values and functions\n-- | that accept an `Either` and return a non-`Either` result using the\n-- | `<<=` operator.\n-- |\n-- | ``` purescript\n-- | f <<= Left x = Left x\n-- | f <<= Right x = Right (f (Right x))\n-- | ```\ninstance extendEither :: Extend (Either e) where\n  extend _ (Left y)  = Left y\n  extend f x         = Right (f x)\n\n-- | The `Show` instance allows `Either` values to be rendered as a string with\n-- | `show` whenever there is an `Show` instance for both type the `Either` can\n-- | contain.\ninstance showEither :: (Show a, Show b) => Show (Either a b) where\n  show (Left x) = \"(Left \" <> show x <> \")\"\n  show (Right y) = \"(Right \" <> show y <> \")\"\n\n-- | The `Eq` instance allows `Either` values to be checked for equality with\n-- | `==` and inequality with `/=` whenever there is an `Eq` instance for both\n-- | types the `Either` can contain.\nderive instance eqEither :: (Eq a, Eq b) => Eq (Either a b)\n\nderive instance eq1Either :: Eq a => Eq1 (Either a)\n\n-- | The `Ord` instance allows `Either` values to be compared with\n-- | `compare`, `>`, `>=`, `<` and `<=` whenever there is an `Ord` instance for\n-- | both types the `Either` can contain.\n-- |\n-- | Any `Left` value is considered to be less than a `Right` value.\nderive instance ordEither :: (Ord a, Ord b) => Ord (Either a b)\n\nderive instance ord1Either :: Ord a => Ord1 (Either a)\n\ninstance boundedEither :: (Bounded a, Bounded b) => Bounded (Either a b) where\n  top = Right top\n  bottom = Left bottom\n\ninstance semigroupEither :: (Semigroup b) => Semigroup (Either a b) where\n  append x y = append <$> x <*> y\n\n-- | Takes two functions and an `Either` value, if the value is a `Left` the\n-- | inner value is applied to the first function, if the value is a `Right`\n-- | the inner value is applied to the second function.\n-- |\n-- | ``` purescript\n-- | either f g (Left x) == f x\n-- | either f g (Right y) == g y\n-- | ```\neither :: forall a b c. (a -> c) -> (b -> c) -> Either a b -> c\neither f _ (Left a) = f a\neither _ g (Right b) = g b\n\n-- | Combine two alternatives.\nchoose :: forall m a b. Alt m => m a -> m b -> m (Either a b)\nchoose a b = Left <$> a <|> Right <$> b\n\n-- | Returns `true` when the `Either` value was constructed with `Left`.\nisLeft :: forall a b. Either a b -> Boolean\nisLeft = either (const true) (const false)\n\n-- | Returns `true` when the `Either` value was constructed with `Right`.\nisRight :: forall a b. Either a b -> Boolean\nisRight = either (const false) (const true)\n\n-- | A function that extracts the value from the `Left` data constructor.\n-- | The first argument is a default value, which will be returned in the\n-- | case where a `Right` is passed to `fromLeft`.\nfromLeft :: forall a b. a -> Either a b -> a\nfromLeft _ (Left a) = a\nfromLeft default _ = default\n\n-- | Similar to `fromLeft` but for use in cases where the default value may be\n-- | expensive to compute. As PureScript is not lazy, the standard `fromLeft`\n-- | has to evaluate the default value before returning the result,\n-- | whereas here the value is only computed when the `Either` is known\n-- | to be `Right`.\nfromLeft' :: forall a b. (Unit -> a) -> Either a b -> a\nfromLeft' _ (Left a) = a\nfromLeft' default _ = default unit\n\n-- | A function that extracts the value from the `Right` data constructor.\n-- | The first argument is a default value, which will be returned in the\n-- | case where a `Left` is passed to `fromRight`.\nfromRight :: forall a b. b -> Either a b -> b\nfromRight _ (Right b) = b\nfromRight default _ = default\n\n-- | Similar to `fromRight` but for use in cases where the default value may be\n-- | expensive to compute. As PureScript is not lazy, the standard `fromRight`\n-- | has to evaluate the default value before returning the result,\n-- | whereas here the value is only computed when the `Either` is known\n-- | to be `Left`.\nfromRight' :: forall a b. (Unit -> b) -> Either a b -> b\nfromRight' _ (Right b) = b\nfromRight' default _ = default unit\n\n-- | Takes a default and a `Maybe` value, if the value is a `Just`, turn it into\n-- | a `Right`, if the value is a `Nothing` use the provided default as a `Left`\n-- |\n-- | ```purescript\n-- | note \"default\" Nothing = Left \"default\"\n-- | note \"default\" (Just 1) = Right 1\n-- | ```\nnote :: forall a b. a -> Maybe b -> Either a b\nnote a = maybe (Left a) Right\n\n-- | Similar to `note`, but for use in cases where the default value may be\n-- | expensive to compute.\n-- |\n-- | ```purescript\n-- | note' (\\_ -> \"default\") Nothing = Left \"default\"\n-- | note' (\\_ -> \"default\") (Just 1) = Right 1\n-- | ```\nnote' :: forall a b. (Unit -> a) -> Maybe b -> Either a b\nnote' f = maybe' (Left <<< f) Right\n\n-- | Turns an `Either` into a `Maybe`, by throwing potential `Left` values away and converting\n-- | them into `Nothing`. `Right` values get turned into `Just`s.\n-- |\n-- | ```purescript\n-- | hush (Left \"ParseError\") = Nothing\n-- | hush (Right 42) = Just 42\n-- | ```\nhush :: forall a b. Either a b -> Maybe b\nhush = either (const Nothing) Just\n\n-- | Turns an `Either` into a `Maybe`, by throwing potential `Right` values away and converting\n-- | them into `Nothing`. `Left` values get turned into `Just`s.\n-- |\n-- | ```purescript\n-- | blush (Left \"ParseError\") = Just \"Parse Error\"\n-- | blush (Right 42) = Nothing\n-- | ```\nblush :: forall a b. Either a b -> Maybe a\nblush = either Just (const Nothing)\n", "export const pureE = function (a) {\n  return function () {\n    return a;\n  };\n};\n\nexport const bindE = function (a) {\n  return function (f) {\n    return function () {\n      return f(a())();\n    };\n  };\n};\n\nexport const untilE = function (f) {\n  return function () {\n    while (!f());\n  };\n};\n\nexport const whileE = function (f) {\n  return function (a) {\n    return function () {\n      while (f()) {\n        a();\n      }\n    };\n  };\n};\n\nexport const forE = function (lo) {\n  return function (hi) {\n    return function (f) {\n      return function () {\n        for (var i = lo; i < hi; i++) {\n          f(i)();\n        }\n      };\n    };\n  };\n};\n\nexport const foreachE = function (as) {\n  return function (f) {\n    return function () {\n      for (var i = 0, l = as.length; i < l; i++) {\n        f(as[i])();\n      }\n    };\n  };\n};\n", "module Control.Monad\n  ( class Monad\n  , liftM1\n  , whenM\n  , unlessM\n  , ap\n  , module Data.Functor\n  , module Control.Apply\n  , module Control.Applicative\n  , module Control.Bind\n  ) where\n\nimport Control.Applicative (class Applicative, liftA1, pure, unless, when)\nimport Control.Apply (class Apply, apply, (*>), (<*), (<*>))\nimport Control.Bind (class Bind, bind, ifM, join, (<=<), (=<<), (>=>), (>>=))\n\nimport Data.Functor (class Functor, map, void, ($>), (<#>), (<$), (<$>))\nimport Data.Unit (Unit)\nimport Type.Proxy (Proxy)\n\n-- | The `Monad` type class combines the operations of the `Bind` and\n-- | `Applicative` type classes. Therefore, `Monad` instances represent type\n-- | constructors which support sequential composition, and also lifting of\n-- | functions of arbitrary arity.\n-- |\n-- | Instances must satisfy the following laws in addition to the\n-- | `Applicative` and `Bind` laws:\n-- |\n-- | - Left Identity: `pure x >>= f = f x`\n-- | - Right Identity: `x >>= pure = x`\nclass (Applicative m, Bind m) <= Monad m\n\ninstance monadFn :: Monad ((->) r)\n\ninstance monadArray :: Monad Array\n\ninstance monadProxy :: Monad Proxy\n\n-- | `liftM1` provides a default implementation of `(<$>)` for any\n-- | [`Monad`](#monad), without using `(<$>)` as provided by the\n-- | [`Functor`](#functor)-[`Monad`](#monad) superclass relationship.\n-- |\n-- | `liftM1` can therefore be used to write [`Functor`](#functor) instances\n-- | as follows:\n-- |\n-- | ```purescript\n-- | instance functorF :: Functor F where\n-- |   map = liftM1\n-- | ```\nliftM1 :: forall m a b. Monad m => (a -> b) -> m a -> m b\nliftM1 f a = do\n  a' <- a\n  pure (f a')\n\n-- | Perform a monadic action when a condition is true, where the conditional\n-- | value is also in a monadic context.\nwhenM :: forall m. Monad m => m Boolean -> m Unit -> m Unit\nwhenM mb m = do\n  b <- mb\n  when b m\n\n-- | Perform a monadic action unless a condition is true, where the conditional\n-- | value is also in a monadic context.\nunlessM :: forall m. Monad m => m Boolean -> m Unit -> m Unit\nunlessM mb m = do\n  b <- mb\n  unless b m\n\n-- | `ap` provides a default implementation of `(<*>)` for any `Monad`, without\n-- | using `(<*>)` as provided by the `Apply`-`Monad` superclass relationship.\n-- |\n-- | `ap` can therefore be used to write `Apply` instances as follows:\n-- |\n-- | ```purescript\n-- | instance applyF :: Apply F where\n-- |   apply = ap\n-- | ```\n-- Note: Only a `Bind` constraint is needed, but this can\n-- produce loops when used with other default implementations\n-- (i.e. `liftA1`).\n-- See https://github.com/purescript/purescript-prelude/issues/232\nap :: forall m a b. Monad m => m (a -> b) -> m a -> m b\nap f a = do\n  f' <- f\n  a' <- a\n  pure (f' a')\n", "export const intDegree = function (x) {\n  return Math.min(Math.abs(x), 2147483647);\n};\n\n// See the Euclidean definition in\n// https://en.m.wikipedia.org/wiki/Modulo_operation.\nexport const intDiv = function (x) {\n  return function (y) {\n    if (y === 0) return 0;\n    return y > 0 ? Math.floor(x / y) : -Math.floor(x / -y);\n  };\n};\n\nexport const intMod = function (x) {\n  return function (y) {\n    if (y === 0) return 0;\n    var yy = Math.abs(y);\n    return ((x % yy) + yy) % yy;\n  };\n};\n\nexport const numDiv = function (n1) {\n  return function (n2) {\n    return n1 / n2;\n  };\n};\n", "module Data.CommutativeRing\n  ( class CommutativeRing\n  , module Data.Ring\n  , module Data.Semiring\n  , class CommutativeRingRecord\n  ) where\n\nimport Data.Ring (class Ring, class RingRecord)\nimport Data.Semiring (class Semiring, add, mul, one, zero, (*), (+))\nimport Data.Symbol (class IsSymbol)\nimport Data.Unit (Unit)\nimport Prim.Row as Row\nimport Prim.RowList as RL\nimport Type.Proxy (Proxy)\n\n-- | The `CommutativeRing` class is for rings where multiplication is\n-- | commutative.\n-- |\n-- | Instances must satisfy the following law in addition to the `Ring`\n-- | laws:\n-- |\n-- | - Commutative multiplication: `a * b = b * a`\nclass Ring a <= CommutativeRing a\n\ninstance commutativeRingInt :: CommutativeRing Int\ninstance commutativeRingNumber :: CommutativeRing Number\ninstance commutativeRingUnit :: CommutativeRing Unit\ninstance commutativeRingFn :: CommutativeRing b => CommutativeRing (a -> b)\ninstance commutativeRingRecord :: (RL.RowToList row list, CommutativeRingRecord list row row) => CommutativeRing (Record row)\ninstance commutativeRingProxy :: CommutativeRing (Proxy a)\n\n-- | A class for records where all fields have `CommutativeRing` instances, used\n-- | to implement the `CommutativeRing` instance for records.\nclass RingRecord rowlist row subrow <= CommutativeRingRecord rowlist row subrow | rowlist -> subrow\n\ninstance commutativeRingRecordNil :: CommutativeRingRecord RL.Nil row ()\n\ninstance commutativeRingRecordCons ::\n  ( IsSymbol key\n  , Row.Cons key focus subrowTail subrow\n  , CommutativeRingRecord rowlistTail row subrowTail\n  , CommutativeRing focus\n  ) =>\n  CommutativeRingRecord (RL.Cons key focus rowlistTail) row subrow\n", "module Data.EuclideanRing\n  ( class EuclideanRing\n  , degree\n  , div\n  , mod\n  , (/)\n  , gcd\n  , lcm\n  , module Data.CommutativeRing\n  , module Data.Ring\n  , module Data.Semiring\n  ) where\n\nimport Data.BooleanAlgebra ((||))\nimport Data.CommutativeRing (class CommutativeRing)\nimport Data.Eq (class Eq, (==))\nimport Data.Ring (class Ring, sub, (-))\nimport Data.Semiring (class Semiring, add, mul, one, zero, (*), (+))\n\n-- | The `EuclideanRing` class is for commutative rings that support division.\n-- | The mathematical structure this class is based on is sometimes also called\n-- | a *Euclidean domain*.\n-- |\n-- | Instances must satisfy the following laws in addition to the `Ring`\n-- | laws:\n-- |\n-- | - Integral domain: `one /= zero`, and if `a` and `b` are both nonzero then\n-- |   so is their product `a * b`\n-- | - Euclidean function `degree`:\n-- |   - Nonnegativity: For all nonzero `a`, `degree a >= 0`\n-- |   - Quotient/remainder: For all `a` and `b`, where `b` is nonzero,\n-- |     let `q = a / b` and ``r = a `mod` b``; then `a = q*b + r`, and also\n-- |     either `r = zero` or `degree r < degree b`\n-- | - Submultiplicative euclidean function:\n-- |   - For all nonzero `a` and `b`, `degree a <= degree (a * b)`\n-- |\n-- | The behaviour of division by `zero` is unconstrained by these laws,\n-- | meaning that individual instances are free to choose how to behave in this\n-- | case. Similarly, there are no restrictions on what the result of\n-- | `degree zero` is; it doesn't make sense to ask for `degree zero` in the\n-- | same way that it doesn't make sense to divide by `zero`, so again,\n-- | individual instances may choose how to handle this case.\n-- |\n-- | For any `EuclideanRing` which is also a `Field`, one valid choice\n-- | for `degree` is simply `const 1`. In fact, unless there's a specific\n-- | reason not to, `Field` types should normally use this definition of\n-- | `degree`.\n-- |\n-- | The `EuclideanRing Int` instance is one of the most commonly used\n-- | `EuclideanRing` instances and deserves a little more discussion. In\n-- | particular, there are a few different sensible law-abiding implementations\n-- | to choose from, with slightly different behaviour in the presence of\n-- | negative dividends or divisors. The most common definitions are \"truncating\"\n-- | division, where the result of `a / b` is rounded towards 0, and \"Knuthian\"\n-- | or \"flooring\" division, where the result of `a / b` is rounded towards\n-- | negative infinity. A slightly less common, but arguably more useful, option\n-- | is \"Euclidean\" division, which is defined so as to ensure that ``a `mod` b``\n-- | is always nonnegative. With Euclidean division, `a / b` rounds towards\n-- | negative infinity if the divisor is positive, and towards positive infinity\n-- | if the divisor is negative. Note that all three definitions are identical if\n-- | we restrict our attention to nonnegative dividends and divisors.\n-- |\n-- | In versions 1.x, 2.x, and 3.x of the Prelude, the `EuclideanRing Int`\n-- | instance used truncating division. As of 4.x, the `EuclideanRing Int`\n-- | instance uses Euclidean division. Additional functions `quot` and `rem` are\n-- | supplied if truncating division is desired.\nclass CommutativeRing a <= EuclideanRing a where\n  degree :: a -> Int\n  div :: a -> a -> a\n  mod :: a -> a -> a\n\ninfixl 7 div as /\n\ninstance euclideanRingInt :: EuclideanRing Int where\n  degree = intDegree\n  div = intDiv\n  mod = intMod\n\ninstance euclideanRingNumber :: EuclideanRing Number where\n  degree _ = 1\n  div = numDiv\n  mod _ _ = 0.0\n\nforeign import intDegree :: Int -> Int\nforeign import intDiv :: Int -> Int -> Int\nforeign import intMod :: Int -> Int -> Int\n\nforeign import numDiv :: Number -> Number -> Number\n\n-- | The *greatest common divisor* of two values.\ngcd :: forall a. Eq a => EuclideanRing a => a -> a -> a\ngcd a b =\n  if b == zero then a\n  else gcd b (a `mod` b)\n\n-- | The *least common multiple* of two values.\nlcm :: forall a. Eq a => EuclideanRing a => a -> a -> a\nlcm a b =\n  if a == zero || b == zero then zero\n  else a * b / gcd a b\n", "module Data.Monoid\n  ( class Monoid\n  , mempty\n  , power\n  , guard\n  , module Data.Semigroup\n  , class MonoidRecord\n  , memptyRecord\n  ) where\n\nimport Data.Boolean (otherwise)\nimport Data.Eq ((==))\nimport Data.EuclideanRing (mod, (/))\nimport Data.Ord ((<=))\nimport Data.Ordering (Ordering(..))\nimport Data.Semigroup (class Semigroup, class SemigroupRecord, (<>))\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Unit (Unit, unit)\nimport Prim.Row as Row\nimport Prim.RowList as RL\nimport Record.Unsafe (unsafeSet)\nimport Type.Proxy (Proxy(..))\n\n-- | A `Monoid` is a `Semigroup` with a value `mempty`, which is both a\n-- | left and right unit for the associative operation `<>`:\n-- |\n-- | - Left unit: `(mempty <> x) = x`\n-- | - Right unit: `(x <> mempty) = x`\n-- |\n-- | `Monoid`s are commonly used as the result of fold operations, where\n-- | `<>` is used to combine individual results, and `mempty` gives the result\n-- | of folding an empty collection of elements.\n-- |\n-- | ### Newtypes for Monoid\n-- |\n-- | Some types (e.g. `Int`, `Boolean`) can implement multiple law-abiding\n-- | instances for `Monoid`. Let's use `Int` as an example\n-- | 1. `<>` could be `+` and `mempty` could be `0`\n-- | 2. `<>` could be `*` and `mempty` could be `1`.\n-- |\n-- | To clarify these ambiguous situations, one should use the newtypes\n-- | defined in `Data.Monoid.<NewtypeName>` modules.\n-- |\n-- | In the above ambiguous situation, we could use `Additive`\n-- | for the first situation or `Multiplicative` for the second one.\nclass Semigroup m <= Monoid m where\n  mempty :: m\n\ninstance monoidUnit :: Monoid Unit where\n  mempty = unit\n\ninstance monoidOrdering :: Monoid Ordering where\n  mempty = EQ\n\ninstance monoidFn :: Monoid b => Monoid (a -> b) where\n  mempty _ = mempty\n\ninstance monoidString :: Monoid String where\n  mempty = \"\"\n\ninstance monoidArray :: Monoid (Array a) where\n  mempty = []\n\ninstance monoidRecord :: (RL.RowToList row list, MonoidRecord list row row) => Monoid (Record row) where\n  mempty = memptyRecord (Proxy :: Proxy list)\n\n-- | Append a value to itself a certain number of times. For the\n-- | `Multiplicative` type, and for a non-negative power, this is the same as\n-- | normal number exponentiation.\n-- |\n-- | If the second argument is negative this function will return `mempty`\n-- | (*unlike* normal number exponentiation). The `Monoid` constraint alone\n-- | is not enough to write a `power` function with the property that `power x\n-- | n` cancels with `power x (-n)`, i.e. `power x n <> power x (-n) = mempty`.\n-- | For that, we would additionally need the ability to invert elements, i.e.\n-- | a Group.\n-- |\n-- | ```purescript\n-- | power [1,2] 3    == [1,2,1,2,1,2]\n-- | power [1,2] 1    == [1,2]\n-- | power [1,2] 0    == []\n-- | power [1,2] (-3) == []\n-- | ```\n-- |\npower :: forall m. Monoid m => m -> Int -> m\npower x = go\n  where\n  go :: Int -> m\n  go p\n    | p <= 0 = mempty\n    | p == 1 = x\n    | p `mod` 2 == 0 = let x' = go (p / 2) in x' <> x'\n    | otherwise = let x' = go (p / 2) in x' <> x' <> x\n\n-- | Allow or \"truncate\" a Monoid to its `mempty` value based on a condition.\nguard :: forall m. Monoid m => Boolean -> m -> m\nguard true a = a\nguard false _ = mempty\n\n-- | A class for records where all fields have `Monoid` instances, used to\n-- | implement the `Monoid` instance for records.\nclass MonoidRecord :: RL.RowList Type -> Row Type -> Row Type -> Constraint\nclass SemigroupRecord rowlist row subrow <= MonoidRecord rowlist row subrow | rowlist -> row subrow where\n  memptyRecord :: Proxy rowlist -> Record subrow\n\ninstance monoidRecordNil :: MonoidRecord RL.Nil row () where\n  memptyRecord _ = {}\n\ninstance monoidRecordCons ::\n  ( IsSymbol key\n  , Monoid focus\n  , Row.Cons key focus subrowTail subrow\n  , MonoidRecord rowlistTail row subrowTail\n  ) =>\n  MonoidRecord (RL.Cons key focus rowlistTail) row subrow where\n  memptyRecord _ = insert mempty tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    tail = memptyRecord (Proxy :: Proxy rowlistTail)\n", "-- | This module provides the `Effect` type, which is used to represent\n-- | _native_ effects. The `Effect` type provides a typed API for effectful\n-- | computations, while at the same time generating efficient JavaScript.\nmodule Effect\n  ( Effect\n  , untilE, whileE, forE, foreachE\n  ) where\n\nimport Prelude\n\nimport Control.Apply (lift2)\n\n-- | A native effect. The type parameter denotes the return type of running the\n-- | effect, that is, an `Effect Int` is a possibly-effectful computation which\n-- | eventually produces a value of the type `Int` when it finishes.\nforeign import data Effect :: Type -> Type\n\ntype role Effect representational\n\ninstance functorEffect :: Functor Effect where\n  map = liftA1\n\ninstance applyEffect :: Apply Effect where\n  apply = ap\n\ninstance applicativeEffect :: Applicative Effect where\n  pure = pureE\n\nforeign import pureE :: forall a. a -> Effect a\n\ninstance bindEffect :: Bind Effect where\n  bind = bindE\n\nforeign import bindE :: forall a b. Effect a -> (a -> Effect b) -> Effect b\n\ninstance monadEffect :: Monad Effect\n\n-- | The `Semigroup` instance for effects allows you to run two effects, one\n-- | after the other, and then combine their results using the result type's\n-- | `Semigroup` instance.\ninstance semigroupEffect :: Semigroup a => Semigroup (Effect a) where\n  append = lift2 append\n\n-- | If you have a `Monoid a` instance, then `mempty :: Effect a` is defined as\n-- | `pure mempty`.\ninstance monoidEffect :: Monoid a => Monoid (Effect a) where\n  mempty = pureE mempty\n\n-- | Loop until a condition becomes `true`.\n-- |\n-- | `untilE b` is an effectful computation which repeatedly runs the effectful\n-- | computation `b`, until its return value is `true`.\nforeign import untilE :: Effect Boolean -> Effect Unit\n\n-- | Loop while a condition is `true`.\n-- |\n-- | `whileE b m` is effectful computation which runs the effectful computation\n-- | `b`. If its result is `true`, it runs the effectful computation `m` and\n-- | loops. If not, the computation ends.\nforeign import whileE :: forall a. Effect Boolean -> Effect a -> Effect Unit\n\n-- | Loop over a consecutive collection of numbers.\n-- |\n-- | `forE lo hi f` runs the computation returned by the function `f` for each\n-- | of the inputs between `lo` (inclusive) and `hi` (exclusive).\nforeign import forE :: Int -> Int -> (Int -> Effect Unit) -> Effect Unit\n\n-- | Loop over an array of values.\n-- |\n-- | `foreachE xs f` runs the computation returned by the function `f` for each\n-- | of the inputs `xs`.\nforeign import foreachE :: forall a. Array a -> (a -> Effect Unit) -> Effect Unit\n", "export function showErrorImpl(err) {\n  return err.stack || err.toString();\n}\n\nexport function error(msg) {\n  return new Error(msg);\n}\n\nexport function message(e) {\n  return e.message;\n}\n\nexport function name(e) {\n  return e.name || \"Error\";\n}\n\nexport function stackImpl(just) {\n  return function (nothing) {\n    return function (e) {\n      return e.stack ? just(e.stack) : nothing;\n    };\n  };\n}\n\nexport function throwException(e) {\n  return function () {\n    throw e;\n  };\n}\n\nexport function catchException(c) {\n  return function (t) {\n    return function () {\n      try {\n        return t();\n      } catch (e) {\n        if (e instanceof Error || Object.prototype.toString.call(e) === \"[object Error]\") {\n          return c(e)();\n        } else {\n          return c(new Error(e.toString()))();\n        }\n      }\n    };\n  };\n}\n", "-- | This module defines an effect, actions and handlers for working\n-- | with JavaScript exceptions.\n\nmodule Effect.Exception\n  ( Error\n  , error\n  , message\n  , name\n  , stack\n  , throwException\n  , catchException\n  , throw\n  , try\n  ) where\n\nimport Prelude\n\nimport Effect (Effect)\n\nimport Data.Either (Either(..))\nimport Data.Maybe (Maybe(..))\n\n-- | The type of JavaScript errors\nforeign import data Error :: Type\n\ninstance showError :: Show Error where\n  show = showErrorImpl\n\nforeign import showErrorImpl :: Error -> String\n\n-- | Create a JavaScript error, specifying a message\nforeign import error :: String -> Error\n\n-- | Get the error message from a JavaScript error\nforeign import message :: Error -> String\n\n-- | Get the error name when defined, or fallback to 'Error'\nforeign import name :: Error -> String\n\n-- | Get the stack trace from a JavaScript error\nstack :: Error -> Maybe String\nstack = stackImpl Just Nothing\n\nforeign import stackImpl\n  :: (forall a. a -> Maybe a)\n  -> (forall a. Maybe a)\n  -> Error\n  -> Maybe String\n\n-- | Throw an exception\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | main = do\n-- |   x <- readNumber\n-- |   when (x < 0) $ throwException $\n-- |     error \"Expected a non-negative number\"\n-- | ```\nforeign import throwException\n  :: forall a\n   . Error\n  -> Effect a\n\n-- | Catch an exception by providing an exception handler.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | main = catchException Console.logShow do\n-- |   Console.log \"Exceptions thrown in this block will be logged to the console\"\n-- | ```\nforeign import catchException\n  :: forall a\n   . (Error -> Effect a)\n  -> Effect a\n  -> Effect a\n\n-- | A shortcut allowing you to throw an error in one step. Defined as\n-- | `throwException <<< error`.\nthrow :: forall a. String -> Effect a\nthrow = throwException <<< error\n\n-- | Runs an Eff and returns eventual Exceptions as a `Left` value. If the\n-- | computation succeeds the result gets wrapped in a `Right`.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | main :: Effect Unit\n-- | main = do\n-- |   result <- try (readTextFile UTF8 \"README.md\")\n-- |   case result of\n-- |     Right lines ->\n-- |       Console.log (\"README: \\n\" <> lines )\n-- |     Left error ->\n-- |       Console.error (\"Couldn't open README.md. Error was: \" <> show error)\n-- | ```\n\ntry :: forall a. Effect a -> Effect (Either Error a)\ntry action = catchException (pure <<< Left) (Right <$> action)\n", "-- | This module defines the `MonadError` type class and its instances.\n\nmodule Control.Monad.Error.Class where\n\nimport Prelude\n\nimport Data.Either (Either(..), either)\nimport Data.Maybe (Maybe(..), maybe)\nimport Effect (Effect)\nimport Effect.Exception as Ex\n\n\n-- | The `MonadThrow` type class represents those monads which support errors via\n-- | `throwError`, where `throwError e` halts, yielding the error `e`.\n-- |\n-- | An implementation is provided for `ExceptT`, and for other monad transformers\n-- | defined in this library.\n-- |\n-- | Laws:\n-- |\n-- | - Left zero: `throwError e >>= f = throwError e`\n-- |\nclass Monad m <= MonadThrow e m | m -> e where\n  throwError :: forall a. e -> m a\n\n-- | The `MonadError` type class represents those monads which support catching\n-- | errors.\n-- |\n-- | - `catchError x f` calls the error handler `f` if an error is thrown during the\n-- |   evaluation of `x`.\n-- |\n-- | An implementation is provided for `ExceptT`, and for other monad transformers\n-- | defined in this library.\n-- |\n-- | Laws:\n-- |\n-- | - Catch: `catchError (throwError e) f = f e`\n-- | - Pure: `catchError (pure a) f = pure a`\n-- |\nclass MonadThrow e m <= MonadError e m | m -> e where\n  catchError :: forall a. m a -> (e -> m a) -> m a\n\n-- | This function allows you to provide a predicate for selecting the\n-- | exceptions that you're interested in, and handle only those exceptons.\n-- | If the inner computation throws an exception, and the predicate returns\n-- | Nothing, then the whole computation will still fail with that exception.\ncatchJust\n  :: forall e m a b\n   . MonadError e m\n  => (e -> Maybe b) -- ^ Predicate to select exceptions\n  -> m a            -- ^ Computation to run\n  -> (b -> m a)     -- ^ Handler\n  -> m a\ncatchJust p act handler = catchError act handle\n  where\n  handle e =\n    case p e of\n      Nothing -> throwError e\n      Just b -> handler b\n\n-- | Return `Right` if the given action succeeds, `Left` if it throws.\ntry\n  :: forall e m a\n   . MonadError e m\n  => m a\n  -> m (Either e a)\ntry a = (Right <$> a) `catchError` (pure <<< Left)\n\ninstance monadThrowEither :: MonadThrow e (Either e) where\n  throwError = Left\n\ninstance monadErrorEither :: MonadError e (Either e) where\n  catchError (Left e) h = h e\n  catchError (Right x) _ = Right x\n\ninstance monadThrowMaybe :: MonadThrow Unit Maybe where\n  throwError = const Nothing\n\ninstance monadErrorMaybe :: MonadError Unit Maybe where\n  catchError Nothing f  = f unit\n  catchError (Just a) _ = Just a\n \ninstance monadThrowEffect :: MonadThrow Ex.Error Effect where\n  throwError = Ex.throwException\n\ninstance monadErrorEffect :: MonadError Ex.Error Effect where\n  catchError = flip Ex.catchException\n\n\n-- | Make sure that a resource is cleaned up in the event of an exception. The\n-- | release action is called regardless of whether the body action throws or\n-- | returns.\nwithResource\n  :: forall e m r a\n   . MonadError e m\n  => m r\n  -> (r -> m Unit)\n  -> (r -> m a)\n  -> m a\nwithResource acquire release kleisli = do\n  resource <- acquire\n  result <- try $ kleisli resource\n  release resource\n  either throwError pure result\n\n-- | Lift a `Maybe` value to a MonadThrow monad.\nliftMaybe :: forall m e a. MonadThrow e m => e -> Maybe a -> m a\nliftMaybe error = maybe (throwError error) pure\n\n-- | Lift an `Either` value to a MonadThrow monad.\nliftEither :: forall m e a. MonadThrow e m => Either e a -> m a\nliftEither = either throwError pure\n", "module Data.Identity where\n\nimport Prelude\n\nimport Control.Alt (class Alt)\nimport Control.Comonad (class Comonad)\nimport Control.Extend (class Extend)\nimport Control.Lazy (class Lazy)\nimport Data.Eq (class Eq1)\nimport Data.Functor.Invariant (class Invariant, imapF)\nimport Data.Newtype (class Newtype)\nimport Data.Ord (class Ord1)\n\nnewtype Identity a = Identity a\n\nderive instance newtypeIdentity :: Newtype (Identity a) _\n\nderive newtype instance eqIdentity :: Eq a => Eq (Identity a)\n\nderive newtype instance ordIdentity :: Ord a => Ord (Identity a)\n\nderive newtype instance boundedIdentity :: Bounded a => Bounded (Identity a)\n\nderive newtype instance heytingAlgebraIdentity :: HeytingAlgebra a => HeytingAlgebra (Identity a)\n\nderive newtype instance booleanAlgebraIdentity :: BooleanAlgebra a => BooleanAlgebra (Identity a)\n\nderive newtype instance semigroupIdentity :: Semigroup a => Semigroup (Identity a)\n\nderive newtype instance monoidIdentity :: Monoid a => Monoid (Identity a)\n\nderive newtype instance semiringIdentity :: Semiring a => Semiring (Identity a)\n\nderive newtype instance euclideanRingIdentity :: EuclideanRing a => EuclideanRing (Identity a)\n\nderive newtype instance ringIdentity :: Ring a => Ring (Identity a)\n\nderive newtype instance commutativeRingIdentity :: CommutativeRing a => CommutativeRing (Identity a)\n\nderive newtype instance lazyIdentity :: Lazy a => Lazy (Identity a)\n\ninstance showIdentity :: Show a => Show (Identity a) where\n  show (Identity x) = \"(Identity \" <> show x <> \")\"\n\nderive instance eq1Identity :: Eq1 Identity\n\nderive instance ord1Identity :: Ord1 Identity\n\nderive instance functorIdentity :: Functor Identity\n\ninstance invariantIdentity :: Invariant Identity where\n  imap = imapF\n\ninstance altIdentity :: Alt Identity where\n  alt x _ = x\n\ninstance applyIdentity :: Apply Identity where\n  apply (Identity f) (Identity x) = Identity (f x)\n\ninstance applicativeIdentity :: Applicative Identity where\n  pure = Identity\n\ninstance bindIdentity :: Bind Identity where\n  bind (Identity m) f = f m\n\ninstance monadIdentity :: Monad Identity\n\ninstance extendIdentity :: Extend Identity where\n  extend f m = Identity (f m)\n\ninstance comonadIdentity :: Comonad Identity where\n  extract (Identity x) = x\n", "export const _new = function (val) {\n  return function () {\n    return { value: val };\n  };\n};\n\nexport const newWithSelf = function (f) {\n  return function () {\n    var ref = { value: null };\n    ref.value = f(ref);\n    return ref;\n  };\n};\n\nexport const read = function (ref) {\n  return function () {\n    return ref.value;\n  };\n};\n\nexport const modifyImpl = function (f) {\n  return function (ref) {\n    return function () {\n      var t = f(ref.value);\n      ref.value = t.state;\n      return t.value;\n    };\n  };\n};\n\nexport const write = function (val) {\n  return function (ref) {\n    return function () {\n      ref.value = val;\n    };\n  };\n};\n", "-- | This module defines the `Ref` type for mutable value references, as well\n-- | as actions for working with them.\n-- |\n-- | You'll notice that all of the functions that operate on a `Ref` (e.g.\n-- | `new`, `read`, `write`) return their result wrapped in an `Effect`.\n-- | Working with mutable references is considered effectful in PureScript\n-- | because of the principle of purity: functions should not have side\n-- | effects, and should return the same result when called with the same\n-- | arguments. If a `Ref` could be written to without using `Effect`, that\n-- | would cause a side effect (the effect of changing the result of subsequent\n-- | reads for that `Ref`). If there were a function for reading the current\n-- | value of a `Ref` without the result being wrapped in `Effect`, the result\n-- | of calling that function would change each time a new value was written to\n-- | the `Ref`. Even creating a new `Ref` is effectful: if there were a\n-- | function for creating a new `Ref` with the type `forall s. s -> Ref s`,\n-- | then calling that function twice with the same argument would not give the\n-- | same result in each case, since you'd end up with two distinct references\n-- | which could be updated independently of each other.\n-- |\n-- | _Note_: `Control.Monad.ST` provides a pure alternative to `Ref` when\n-- | mutation is restricted to a local scope.\nmodule Effect.Ref\n  ( Ref\n  , new\n  , newWithSelf\n  , read\n  , modify'\n  , modify\n  , modify_\n  , write\n  ) where\n\nimport Prelude\n\nimport Effect (Effect)\n\n-- | A value of type `Ref a` represents a mutable reference\n-- | which holds a value of type `a`.\nforeign import data Ref :: Type -> Type\n\ntype role Ref representational\n\n-- | Create a new mutable reference containing the specified value.\nforeign import _new :: forall s. s -> Effect (Ref s)\n\nnew :: forall s. s -> Effect (Ref s)\nnew = _new\n\n-- | Create a new mutable reference containing a value that can refer to the\n-- | `Ref` being created.\nforeign import newWithSelf :: forall s. (Ref s -> s) -> Effect (Ref s)\n\n-- | Read the current value of a mutable reference.\nforeign import read :: forall s. Ref s -> Effect s\n\n-- | Update the value of a mutable reference by applying a function\n-- | to the current value.\nmodify' :: forall s b. (s -> { state :: s, value :: b }) -> Ref s -> Effect b\nmodify' = modifyImpl\n\nforeign import modifyImpl :: forall s b. (s -> { state :: s, value :: b }) -> Ref s -> Effect b\n\n-- | Update the value of a mutable reference by applying a function\n-- | to the current value. The updated value is returned.\nmodify :: forall s. (s -> s) -> Ref s -> Effect s\nmodify f = modify' \\s -> let s' = f s in { state: s', value: s' }\n\n-- | A version of `modify` which does not return the updated value.\nmodify_ :: forall s. (s -> s) -> Ref s -> Effect Unit\nmodify_ f s = void $ modify f s\n\n-- | Update the value of a mutable reference to the specified value.\nforeign import write :: forall s. s -> Ref s -> Effect Unit\n", "module Control.Monad.Rec.Class\n  ( Step(..)\n  , class MonadRec\n  , tailRec\n  , tailRec2\n  , tailRec3\n  , tailRecM\n  , tailRecM2\n  , tailRecM3\n  , forever\n  , whileJust\n  , untilJust\n  , loop2\n  , loop3\n  ) where\n\nimport Prelude\n\nimport Data.Bifunctor (class Bifunctor)\nimport Data.Either (Either(..))\nimport Data.Identity (Identity(..))\nimport Data.Maybe (Maybe(..))\nimport Effect (Effect, untilE)\nimport Effect.Ref as Ref\nimport Partial.Unsafe (unsafePartial)\n\n-- | The result of a computation: either `Loop` containing the updated\n-- | accumulator, or `Done` containing the final result of the computation.\ndata Step a b = Loop a | Done b\n\nderive instance functorStep :: Functor (Step a)\n\ninstance bifunctorStep :: Bifunctor Step where\n  bimap f _ (Loop a) = Loop (f a)\n  bimap _ g (Done b) = Done (g b)\n\n-- | This type class captures those monads which support tail recursion in\n-- | constant stack space.\n-- |\n-- | The `tailRecM` function takes a step function, and applies that step\n-- | function recursively until a pure value of type `b` is found.\n-- |\n-- | Instances are provided for standard monad transformers.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | loopWriter :: Int -> WriterT (Additive Int) Effect Unit\n-- | loopWriter n = tailRecM go n\n-- |   where\n-- |   go 0 = do\n-- |     traceM \"Done!\"\n-- |     pure (Done unit)\n-- |   go i = do\n-- |     tell $ Additive i\n-- |     pure (Loop (i - 1))\n-- | ```\nclass Monad m <= MonadRec m where\n  tailRecM :: forall a b. (a -> m (Step a b)) -> a -> m b\n\n-- | Create a tail-recursive function of two arguments which uses constant stack space.\n-- |\n-- | The `loop2` helper function provides a curried alternative to the `Loop`\n-- | constructor for this function.\ntailRecM2\n  :: forall m a b c\n   . MonadRec m\n  => (a -> b -> m (Step { a :: a, b :: b } c))\n  -> a\n  -> b\n  -> m c\ntailRecM2 f a b = tailRecM (\\o -> f o.a o.b) { a, b }\n\n-- | Create a tail-recursive function of three arguments which uses constant stack space.\n-- |\n-- | The `loop3` helper function provides a curried alternative to the `Loop`\n-- | constructor for this function.\ntailRecM3\n  :: forall m a b c d\n   . MonadRec m\n  => (a -> b -> c -> m (Step { a :: a, b :: b, c :: c } d))\n  -> a\n  -> b\n  -> c\n  -> m d\ntailRecM3 f a b c = tailRecM (\\o -> f o.a o.b o.c) { a, b, c }\n\n-- | Create a pure tail-recursive function of one argument\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | pow :: Int -> Int -> Int\n-- | pow n p = tailRec go { accum: 1, power: p }\n-- |   where\n-- |   go :: _ -> Step _ Int\n-- |   go { accum: acc, power: 0 } = Done acc\n-- |   go { accum: acc, power: p } = Loop { accum: acc * n, power: p - 1 }\n-- | ```\ntailRec :: forall a b. (a -> Step a b) -> a -> b\ntailRec f = go <<< f\n  where\n  go (Loop a) = go (f a)\n  go (Done b) = b\n\n-- | Create a pure tail-recursive function of two arguments\n-- |\n-- | The `loop2` helper function provides a curried alternative to the `Loop`\n-- | constructor for this function.\ntailRec2 :: forall a b c. (a -> b -> Step { a :: a, b :: b } c) -> a -> b -> c\ntailRec2 f a b = tailRec (\\o -> f o.a o.b) { a, b }\n\n-- | Create a pure tail-recursive function of three arguments\n-- |\n-- | The `loop3` helper function provides a curried alternative to the `Loop`\n-- | constructor for this function.\ntailRec3 :: forall a b c d. (a -> b -> c -> Step { a :: a, b :: b, c :: c } d) -> a -> b -> c -> d\ntailRec3 f a b c = tailRec (\\o -> f o.a o.b o.c) { a, b, c }\n\ninstance monadRecIdentity :: MonadRec Identity where\n  tailRecM f = Identity <<< tailRec (runIdentity <<< f)\n    where runIdentity (Identity x) = x\n\ninstance monadRecEffect :: MonadRec Effect where\n  tailRecM f a = do\n    r <- Ref.new =<< f a\n    untilE do\n      Ref.read r >>= case _ of\n        Loop a' -> do\n          e <- f a'\n          _ <- Ref.write e r\n          pure false\n        Done _ -> pure true\n    fromDone <$> Ref.read r\n    where\n    fromDone :: forall a b. Step a b -> b\n    fromDone = unsafePartial \\(Done b) -> b\n\ninstance monadRecFunction :: MonadRec ((->) e) where\n  tailRecM f a0 e = tailRec (\\a -> f a e) a0\n\ninstance monadRecEither :: MonadRec (Either e) where\n  tailRecM f a0 =\n    let\n      g (Left e) = Done (Left e)\n      g (Right (Loop a)) = Loop (f a)\n      g (Right (Done b)) = Done (Right b)\n    in tailRec g (f a0)\n\ninstance monadRecMaybe :: MonadRec Maybe where\n  tailRecM f a0 =\n    let\n      g Nothing = Done Nothing\n      g (Just (Loop a)) = Loop (f a)\n      g (Just (Done b)) = Done (Just b)\n    in tailRec g (f a0)\n\n-- | `forever` runs an action indefinitely, using the `MonadRec` instance to\n-- | ensure constant stack usage.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | main = forever $ trace \"Hello, World!\"\n-- | ```\nforever :: forall m a b. MonadRec m => m a -> m b\nforever ma = tailRecM (\\u -> Loop u <$ ma) unit\n\n-- | While supplied computation evaluates to `Just _`, it will be\n-- | executed repeatedly and results will be combined using monoid instance.\nwhileJust :: forall a m. Monoid a => MonadRec m => m (Maybe a) -> m a\nwhileJust m = mempty # tailRecM \\v -> m <#> case _ of\n  Nothing -> Done v\n  Just x -> Loop $ v <> x\n\n-- | Supplied computation will be executed repeatedly until it evaluates\n-- | to `Just value` and then that `value` will be returned.\nuntilJust :: forall a m. MonadRec m => m (Maybe a) -> m a\nuntilJust m = unit # tailRecM \\_ -> m <#> case _ of\n  Nothing -> Loop unit\n  Just x -> Done x\n\n-- | A curried version of the `Loop` constructor, provided as a convenience for\n-- | use with `tailRec2` and `tailRecM2`.\nloop2 :: forall a b c. a -> b -> Step { a :: a, b :: b } c\nloop2 a b = Loop { a, b }\n\n-- | A curried version of the `Loop` constructor, provided as a convenience for\n-- | use with `tailRec3` and `tailRecM3`.\nloop3 :: forall a b c d. a -> b -> c -> Step { a :: a, b :: b, c :: c } d\nloop3 a b c = Loop { a, b, c }\n", "export const boolConj = function (b1) {\n  return function (b2) {\n    return b1 && b2;\n  };\n};\n\nexport const boolDisj = function (b1) {\n  return function (b2) {\n    return b1 || b2;\n  };\n};\n\nexport const boolNot = function (b) {\n  return !b;\n};\n", "module Data.HeytingAlgebra\n  ( class HeytingAlgebra\n  , tt\n  , ff\n  , implies\n  , conj\n  , disj\n  , not\n  , (&&)\n  , (||)\n  , class HeytingAlgebraRecord\n  , ffRecord\n  , ttRecord\n  , impliesRecord\n  , conjRecord\n  , disjRecord\n  , notRecord\n  ) where\n\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Unit (Unit, unit)\nimport Prim.Row as Row\nimport Prim.RowList as RL\nimport Record.Unsafe (unsafeGet, unsafeSet)\nimport Type.Proxy (Proxy(..))\n\n-- | The `HeytingAlgebra` type class represents types that are bounded lattices with\n-- | an implication operator such that the following laws hold:\n-- |\n-- | - Associativity:\n-- |   - `a || (b || c) = (a || b) || c`\n-- |   - `a && (b && c) = (a && b) && c`\n-- | - Commutativity:\n-- |   - `a || b = b || a`\n-- |   - `a && b = b && a`\n-- | - Absorption:\n-- |   - `a || (a && b) = a`\n-- |   - `a && (a || b) = a`\n-- | - Idempotent:\n-- |   - `a || a = a`\n-- |   - `a && a = a`\n-- | - Identity:\n-- |   - `a || ff = a`\n-- |   - `a && tt = a`\n-- | - Implication:\n-- |   - ``a `implies` a = tt``\n-- |   - ``a && (a `implies` b) = a && b``\n-- |   - ``b && (a `implies` b) = b``\n-- |   - ``a `implies` (b && c) = (a `implies` b) && (a `implies` c)``\n-- | - Complemented:\n-- |   - ``not a = a `implies` ff``\nclass HeytingAlgebra a where\n  ff :: a\n  tt :: a\n  implies :: a -> a -> a\n  conj :: a -> a -> a\n  disj :: a -> a -> a\n  not :: a -> a\n\ninfixr 3 conj as &&\ninfixr 2 disj as ||\n\ninstance heytingAlgebraBoolean :: HeytingAlgebra Boolean where\n  ff = false\n  tt = true\n  implies a b = not a || b\n  conj = boolConj\n  disj = boolDisj\n  not = boolNot\n\ninstance heytingAlgebraUnit :: HeytingAlgebra Unit where\n  ff = unit\n  tt = unit\n  implies _ _ = unit\n  conj _ _ = unit\n  disj _ _ = unit\n  not _ = unit\n\ninstance heytingAlgebraFunction :: HeytingAlgebra b => HeytingAlgebra (a -> b) where\n  ff _ = ff\n  tt _ = tt\n  implies f g a = f a `implies` g a\n  conj f g a = f a && g a\n  disj f g a = f a || g a\n  not f a = not (f a)\n\ninstance heytingAlgebraProxy :: HeytingAlgebra (Proxy a) where\n  conj _ _ = Proxy\n  disj _ _ = Proxy\n  implies _ _ = Proxy\n  ff = Proxy\n  not _ = Proxy\n  tt = Proxy\n\ninstance heytingAlgebraRecord :: (RL.RowToList row list, HeytingAlgebraRecord list row row) => HeytingAlgebra (Record row) where\n  ff = ffRecord (Proxy :: Proxy list) (Proxy :: Proxy row)\n  tt = ttRecord (Proxy :: Proxy list) (Proxy :: Proxy row)\n  conj = conjRecord (Proxy :: Proxy list)\n  disj = disjRecord (Proxy :: Proxy list)\n  implies = impliesRecord (Proxy :: Proxy list)\n  not = notRecord (Proxy :: Proxy list)\n\nforeign import boolConj :: Boolean -> Boolean -> Boolean\nforeign import boolDisj :: Boolean -> Boolean -> Boolean\nforeign import boolNot :: Boolean -> Boolean\n\n-- | A class for records where all fields have `HeytingAlgebra` instances, used\n-- | to implement the `HeytingAlgebra` instance for records.\nclass HeytingAlgebraRecord :: RL.RowList Type -> Row Type -> Row Type -> Constraint\nclass HeytingAlgebraRecord rowlist row subrow | rowlist -> subrow where\n  ffRecord :: Proxy rowlist -> Proxy row -> Record subrow\n  ttRecord :: Proxy rowlist -> Proxy row -> Record subrow\n  impliesRecord :: Proxy rowlist -> Record row -> Record row -> Record subrow\n  disjRecord :: Proxy rowlist -> Record row -> Record row -> Record subrow\n  conjRecord :: Proxy rowlist -> Record row -> Record row -> Record subrow\n  notRecord :: Proxy rowlist -> Record row -> Record subrow\n\ninstance heytingAlgebraRecordNil :: HeytingAlgebraRecord RL.Nil row () where\n  conjRecord _ _ _ = {}\n  disjRecord _ _ _ = {}\n  ffRecord _ _ = {}\n  impliesRecord _ _ _ = {}\n  notRecord _ _ = {}\n  ttRecord _ _ = {}\n\ninstance heytingAlgebraRecordCons ::\n  ( IsSymbol key\n  , Row.Cons key focus subrowTail subrow\n  , HeytingAlgebraRecord rowlistTail row subrowTail\n  , HeytingAlgebra focus\n  ) =>\n  HeytingAlgebraRecord (RL.Cons key focus rowlistTail) row subrow where\n  conjRecord _ ra rb = insert (conj (get ra) (get rb)) tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    get = unsafeGet key :: Record row -> focus\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    tail = conjRecord (Proxy :: Proxy rowlistTail) ra rb\n\n  disjRecord _ ra rb = insert (disj (get ra) (get rb)) tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    get = unsafeGet key :: Record row -> focus\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    tail = disjRecord (Proxy :: Proxy rowlistTail) ra rb\n\n  impliesRecord _ ra rb = insert (implies (get ra) (get rb)) tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    get = unsafeGet key :: Record row -> focus\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    tail = impliesRecord (Proxy :: Proxy rowlistTail) ra rb\n\n  ffRecord _ row = insert ff tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    tail = ffRecord (Proxy :: Proxy rowlistTail) row\n\n  notRecord _ row = insert (not (get row)) tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    get = unsafeGet key :: Record row -> focus\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    tail = notRecord (Proxy :: Proxy rowlistTail) row\n\n  ttRecord _ row = insert tt tail\n    where\n    key = reflectSymbol (Proxy :: Proxy key)\n    insert = unsafeSet key :: focus -> Record subrowTail -> Record subrow\n    tail = ttRecord (Proxy :: Proxy rowlistTail) row\n", "-- | A data type and functions for working with ordered pairs.\nmodule Data.Tuple where\n\nimport Prelude\n\nimport Control.Comonad (class Comonad)\nimport Control.Extend (class Extend)\nimport Control.Lazy (class Lazy, defer)\nimport Data.Eq (class Eq1)\nimport Data.Functor.Invariant (class Invariant, imapF)\nimport Data.Generic.Rep (class Generic)\nimport Data.HeytingAlgebra (implies, ff, tt)\nimport Data.Ord (class Ord1)\n\n-- | A simple product type for wrapping a pair of component values.\ndata Tuple a b = Tuple a b\n\n-- | Allows `Tuple`s to be rendered as a string with `show` whenever there are\n-- | `Show` instances for both component types.\ninstance showTuple :: (Show a, Show b) => Show (Tuple a b) where\n  show (Tuple a b) = \"(Tuple \" <> show a <> \" \" <> show b <> \")\"\n\n-- | Allows `Tuple`s to be checked for equality with `==` and `/=` whenever\n-- | there are `Eq` instances for both component types.\nderive instance eqTuple :: (Eq a, Eq b) => Eq (Tuple a b)\n\nderive instance eq1Tuple :: Eq a => Eq1 (Tuple a)\n\n-- | Allows `Tuple`s to be compared with `compare`, `>`, `>=`, `<` and `<=`\n-- | whenever there are `Ord` instances for both component types. To obtain\n-- | the result, the `fst`s are `compare`d, and if they are `EQ`ual, the\n-- | `snd`s are `compare`d.\nderive instance ordTuple :: (Ord a, Ord b) => Ord (Tuple a b)\n\nderive instance ord1Tuple :: Ord a => Ord1 (Tuple a)\n\ninstance boundedTuple :: (Bounded a, Bounded b) => Bounded (Tuple a b) where\n  top = Tuple top top\n  bottom = Tuple bottom bottom\n\ninstance semigroupoidTuple :: Semigroupoid Tuple where\n  compose (Tuple _ c) (Tuple a _) = Tuple a c\n\n-- | The `Semigroup` instance enables use of the associative operator `<>` on\n-- | `Tuple`s whenever there are `Semigroup` instances for the component\n-- | types. The `<>` operator is applied pairwise, so:\n-- | ```purescript\n-- | (Tuple a1 b1) <> (Tuple a2 b2) = Tuple (a1 <> a2) (b1 <> b2)\n-- | ```\ninstance semigroupTuple :: (Semigroup a, Semigroup b) => Semigroup (Tuple a b) where\n  append (Tuple a1 b1) (Tuple a2 b2) = Tuple (a1 <> a2) (b1 <> b2)\n\ninstance monoidTuple :: (Monoid a, Monoid b) => Monoid (Tuple a b) where\n  mempty = Tuple mempty mempty\n\ninstance semiringTuple :: (Semiring a, Semiring b) => Semiring (Tuple a b) where\n  add (Tuple x1 y1) (Tuple x2 y2) = Tuple (add x1 x2) (add y1 y2)\n  one = Tuple one one\n  mul (Tuple x1 y1) (Tuple x2 y2) = Tuple (mul x1 x2) (mul y1 y2)\n  zero = Tuple zero zero\n\ninstance ringTuple :: (Ring a, Ring b) => Ring (Tuple a b) where\n  sub (Tuple x1 y1) (Tuple x2 y2) = Tuple (sub x1 x2) (sub y1 y2)\n\ninstance commutativeRingTuple :: (CommutativeRing a, CommutativeRing b) => CommutativeRing (Tuple a b)\n\ninstance heytingAlgebraTuple :: (HeytingAlgebra a, HeytingAlgebra b) => HeytingAlgebra (Tuple a b) where\n  tt = Tuple tt tt\n  ff = Tuple ff ff\n  implies (Tuple x1 y1) (Tuple x2 y2) = Tuple (x1 `implies` x2) (y1 `implies` y2)\n  conj (Tuple x1 y1) (Tuple x2 y2) = Tuple (conj x1 x2) (conj y1 y2)\n  disj (Tuple x1 y1) (Tuple x2 y2) = Tuple (disj x1 x2) (disj y1 y2)\n  not (Tuple x y) = Tuple (not x) (not y)\n\ninstance booleanAlgebraTuple :: (BooleanAlgebra a, BooleanAlgebra b) => BooleanAlgebra (Tuple a b)\n\n-- | The `Functor` instance allows functions to transform the contents of a\n-- | `Tuple` with the `<$>` operator, applying the function to the second\n-- | component, so:\n-- | ```purescript\n-- | f <$> (Tuple x y) = Tuple x (f y)\n-- | ````\nderive instance functorTuple :: Functor (Tuple a)\n\nderive instance genericTuple :: Generic (Tuple a b) _\n\ninstance invariantTuple :: Invariant (Tuple a) where\n  imap = imapF\n\n-- | The `Apply` instance allows functions to transform the contents of a\n-- | `Tuple` with the `<*>` operator whenever there is a `Semigroup` instance\n-- | for the `fst` component, so:\n-- | ```purescript\n-- | (Tuple a1 f) <*> (Tuple a2 x) == Tuple (a1 <> a2) (f x)\n-- | ```\ninstance applyTuple :: (Semigroup a) => Apply (Tuple a) where\n  apply (Tuple a1 f) (Tuple a2 x) = Tuple (a1 <> a2) (f x)\n\ninstance applicativeTuple :: (Monoid a) => Applicative (Tuple a) where\n  pure = Tuple mempty\n\ninstance bindTuple :: (Semigroup a) => Bind (Tuple a) where\n  bind (Tuple a1 b) f = case f b of\n    Tuple a2 c -> Tuple (a1 <> a2) c\n\ninstance monadTuple :: (Monoid a) => Monad (Tuple a)\n\ninstance extendTuple :: Extend (Tuple a) where\n  extend f t@(Tuple a _) = Tuple a (f t)\n\ninstance comonadTuple :: Comonad (Tuple a) where\n  extract = snd\n\ninstance lazyTuple :: (Lazy a, Lazy b) => Lazy (Tuple a b) where\n  defer f = Tuple (defer $ \\_ -> fst (f unit)) (defer $ \\_ -> snd (f unit))\n\n-- | Returns the first component of a tuple.\nfst :: forall a b. Tuple a b -> a\nfst (Tuple a _) = a\n\n-- | Returns the second component of a tuple.\nsnd :: forall a b. Tuple a b -> b\nsnd (Tuple _ b) = b\n\n-- | Turn a function that expects a tuple into a function of two arguments.\ncurry :: forall a b c. (Tuple a b -> c) -> a -> b -> c\ncurry f a b = f (Tuple a b)\n\n-- | Turn a function of two arguments into a function that expects a tuple.\nuncurry :: forall a b c. (a -> b -> c) -> Tuple a b -> c\nuncurry f (Tuple a b) = f a b\n\n-- | Exchange the first and second components of a tuple.\nswap :: forall a b. Tuple a b -> Tuple b a\nswap (Tuple a b) = Tuple b a\n", "-- | This module defines the `MonadState` type class and its instances.\n\nmodule Control.Monad.State.Class where\n\nimport Prelude (class Monad, Unit, unit)\n\nimport Data.Tuple (Tuple(..))\n\n-- | The `MonadState s` type class represents those monads which support a single piece of mutable\n-- | state of type `s`.\n-- |\n-- | - `state f` updates the state using the function `f`.\n-- |\n-- | An implementation is provided for `StateT`, and for other monad transformers\n-- | defined in this library.\n-- |\n-- | Laws:\n-- |\n-- | - `do { get ; get } = get`\n-- | - `do { put x ; put y } = put y`\n-- | - `do { put x ; get } = put x $> x`\n-- | - `do { s <- get ; put s } = pure unit`\n-- |\nclass Monad m <= MonadState s m | m -> s where\n  state :: forall a. (s -> (Tuple a s)) -> m a\n\n-- | Get the current state.\nget :: forall m s. MonadState s m => m s\nget = state \\s -> Tuple s s\n\n-- | Get a value which depends on the current state.\ngets :: forall s m a. MonadState s m => (s -> a) -> m a\ngets f = state \\s -> Tuple (f s) s\n\n-- | Set the state.\nput :: forall m s. MonadState s m => s -> m Unit\nput s = state \\_ -> Tuple unit s\n\n-- | Modify the state by applying a function to the current state. The returned\n-- | value is the new state value.\nmodify :: forall s m. MonadState s m => (s -> s) -> m s\nmodify f = state \\s -> let s' = f s in Tuple s' s'\n\nmodify_ :: forall s m. MonadState s m => (s -> s) -> m Unit\nmodify_ f = state \\s -> Tuple unit (f s)\n", "module Effect.Class where\n\nimport Control.Category (identity)\nimport Control.Monad (class Monad)\nimport Effect (Effect)\n\n-- | The `MonadEffect` class captures those monads which support native effects.\n-- |\n-- | Instances are provided for `Effect` itself, and the standard monad\n-- | transformers.\n-- |\n-- | `liftEffect` can be used in any appropriate monad transformer stack to lift an\n-- | action of type `Effect a` into the monad.\n-- |\nclass Monad m <= MonadEffect m where\n  liftEffect :: forall a. Effect a -> m a\n\ninstance monadEffectEffect :: MonadEffect Effect where\n  liftEffect = identity\n", "-- | This module defines the _exception monad transformer_ `ExceptT`.\n\nmodule Control.Monad.Except.Trans\n  ( ExceptT(..), runExceptT, withExceptT, mapExceptT, except\n  , module Control.Monad.Trans.Class\n  , module Control.Monad.Error.Class\n  ) where\n\nimport Prelude\n\nimport Control.Alt (class Alt)\nimport Control.Alternative (class Alternative)\nimport Control.Apply (lift2)\nimport Control.Monad.Cont.Class (class MonadCont, callCC)\nimport Control.Monad.Error.Class (class MonadThrow, class MonadError, throwError, catchError)\nimport Control.Monad.Reader.Class (class MonadAsk, class MonadReader, ask, local)\nimport Control.Monad.Rec.Class (class MonadRec, tailRecM, Step(..))\nimport Control.Monad.State.Class (class MonadState, state)\nimport Control.Monad.Trans.Class (class MonadTrans, lift)\nimport Control.Monad.Writer.Class (class MonadWriter, class MonadTell, pass, listen, tell)\nimport Control.MonadPlus (class MonadPlus)\nimport Control.Plus (class Plus)\nimport Data.Either (Either(..), either)\nimport Data.Newtype (class Newtype)\nimport Data.Tuple (Tuple(..))\nimport Effect.Class (class MonadEffect, liftEffect)\n\n-- | A monad transformer which adds exceptions to other monads, in the same way\n-- | as `Except`. As before, `e` is the type of exceptions, and `a` is the type\n-- | of successful results. The new type parameter `m` is the inner monad that\n-- | computations run in.\nnewtype ExceptT e m a = ExceptT (m (Either e a))\n\n-- | The inverse of `ExceptT`. Run a computation in the `ExceptT` monad.\nrunExceptT :: forall e m a. ExceptT e m a -> m (Either e a)\nrunExceptT (ExceptT x) = x\n\n-- | Transform any exceptions thrown by an `ExceptT` computation using the given function.\nwithExceptT :: forall e e' m a. Functor m => (e -> e') -> ExceptT e m a -> ExceptT e' m a\nwithExceptT f (ExceptT t) = ExceptT $ map (mapLeft f) t\n  where\n  mapLeft _ (Right x) = Right x\n  mapLeft f' (Left x) = Left (f' x)\n\n-- | Transform the unwrapped computation using the given function.\nmapExceptT :: forall e e' m n a b. (m (Either e a) -> n (Either e' b)) -> ExceptT e m a -> ExceptT e' n b\nmapExceptT f (ExceptT m) = ExceptT (f m)\n\n-- | Construct a computation in the `ExceptT` transformer from an `Either` value.\nexcept :: forall e m a. Applicative m => Either e a -> ExceptT e m a\nexcept = ExceptT <<< pure\n\nderive instance newtypeExceptT :: Newtype (ExceptT e m a) _\n\ninstance functorExceptT :: Functor m => Functor (ExceptT e m) where\n  map f = mapExceptT (map (map f))\n\ninstance applyExceptT :: Monad m => Apply (ExceptT e m) where\n  apply = ap\n\ninstance applicativeExceptT :: Monad m => Applicative (ExceptT e m) where\n  pure = ExceptT <<< pure <<< Right\n\ninstance bindExceptT :: Monad m => Bind (ExceptT e m) where\n  bind (ExceptT m) k =\n    ExceptT (m >>= either (pure <<< Left) (\\a -> case k a of ExceptT b -> b))\n\ninstance monadExceptT :: Monad m => Monad (ExceptT e m)\n\ninstance monadRecExceptT :: MonadRec m => MonadRec (ExceptT e m) where\n  tailRecM f = ExceptT <<< tailRecM \\a ->\n    case f a of\n      ExceptT m -> m >>= \\m' ->\n        pure case m' of\n          Left e -> Done (Left e)\n          Right (Loop a1) -> Loop a1\n          Right (Done b) -> Done (Right b)\n\ninstance altExceptT :: (Semigroup e, Monad m) => Alt (ExceptT e m) where\n  alt (ExceptT m) (ExceptT n) = ExceptT do\n    rm <- m\n    case rm of\n      Right x -> pure (Right x)\n      Left err -> do\n        rn <- n\n        case rn of\n          Right x -> pure (Right x)\n          Left err' -> pure (Left (err <> err'))\n\ninstance plusExceptT :: (Monoid e, Monad m) => Plus (ExceptT e m) where\n  empty = throwError (mempty :: e)\n\ninstance alternativeExceptT :: (Monoid e, Monad m) => Alternative (ExceptT e m)\n\ninstance monadPlusExceptT :: (Monoid e, Monad m) => MonadPlus (ExceptT e m)\n\ninstance monadTransExceptT :: MonadTrans (ExceptT e) where\n  lift m = ExceptT do\n    a <- m\n    pure $ Right a\n\ninstance monadEffectExceptT :: MonadEffect m => MonadEffect (ExceptT e m) where\n  liftEffect = lift <<< liftEffect\n\ninstance monadContExceptT :: MonadCont m => MonadCont (ExceptT e m) where\n  callCC f = ExceptT $ callCC \\c ->\n    case f (\\a -> ExceptT $ c (Right a)) of ExceptT b -> b\n\ninstance monadThrowExceptT :: Monad m => MonadThrow e (ExceptT e m) where\n  throwError = ExceptT <<< pure <<< Left\n\ninstance monadErrorExceptT :: Monad m => MonadError e (ExceptT e m) where\n  catchError (ExceptT m) k =\n    ExceptT (m >>= either (\\a -> case k a of ExceptT b -> b) (pure <<< Right))\n\ninstance monadAskExceptT :: MonadAsk r m => MonadAsk r (ExceptT e m) where\n  ask = lift ask\n\ninstance monadReaderExceptT :: MonadReader r m => MonadReader r (ExceptT e m) where\n  local f = mapExceptT (local f)\n\ninstance monadStateExceptT :: MonadState s m => MonadState s (ExceptT e m) where\n  state f = lift (state f)\n\ninstance monadTellExceptT :: MonadTell w m => MonadTell w (ExceptT e m) where\n  tell = lift <<< tell\n\ninstance monadWriterExceptT :: MonadWriter w m => MonadWriter w (ExceptT e m) where\n  listen = mapExceptT \\m -> do\n    Tuple a w <- listen m\n    pure $ (\\r -> Tuple r w) <$> a\n  pass = mapExceptT \\m -> pass do\n    a <- m\n    pure case a of\n      Left e -> Tuple (Left e) identity\n      Right (Tuple r f) -> Tuple (Right r) f\n\ninstance semigroupExceptT :: (Monad m, Semigroup a) => Semigroup (ExceptT e m a) where\n  append = lift2 (<>)\n\ninstance monoidExceptT :: (Monad m, Monoid a) => Monoid (ExceptT e m a) where\n  mempty = pure mempty\n\n", "\nmodule Control.Monad.Except\n  ( Except\n  , runExcept\n  , mapExcept\n  , withExcept\n  , module Control.Monad.Error.Class\n  , module Control.Monad.Except.Trans\n  ) where\n\nimport Prelude\n\nimport Control.Monad.Error.Class (class MonadError, catchError, catchJust, throwError)\nimport Control.Monad.Except.Trans (class MonadTrans, ExceptT(..), except, lift, mapExceptT, runExceptT, withExceptT)\n\nimport Data.Either (Either)\nimport Data.Identity (Identity(..))\nimport Data.Newtype (unwrap)\n\n-- | A parametrizable exception monad; computations are either exceptions or\n-- | pure values. If an exception is thrown (see `throwError`), the computation\n-- | terminates with that value. Exceptions may also be caught with `catchError`,\n-- | allowing the computation to resume and exit successfully.\n-- |\n-- | The type parameter `e` is the type of exceptions, and `a` is the type\n-- | of successful results.\n-- |\n-- | A mechanism for trying many different computations until one succeeds is\n-- | provided via the `Alt` instance, specifically the `(<|>)` function.\n-- | The first computation to succeed is returned; if all fail, the exceptions\n-- | are combined using their `Semigroup` instance. The `Plus` instance goes\n-- | further and adds the possibility of a computation failing with an 'empty'\n-- | exception; naturally, this requires the stronger constraint of a `Monoid`\n-- | instance for the exception type.\ntype Except e = ExceptT e Identity\n\n-- | Run a computation in the `Except` monad. The inverse of `except`.\nrunExcept :: forall e a. Except e a -> Either e a\nrunExcept = unwrap <<< runExceptT\n\n-- | Transform the unwrapped computation using the given function.\nmapExcept :: forall e e' a b. (Either e a -> Either e' b) -> Except e a -> Except e' b\nmapExcept f = mapExceptT (Identity <<< f <<< unwrap)\n\n-- | Transform any exceptions thrown by an `Except` computation using the given function.\nwithExcept :: forall e e' a. (e -> e') -> Except e a -> Except e' a\nwithExcept = withExceptT\n", "/* eslint-disable no-eq-null, eqeqeq */\nfunction id(x) {\n  return x;\n}\n\nexport {id as fromBoolean};\nexport {id as fromNumber};\nexport {id as fromString};\nexport {id as fromArray};\nexport {id as fromObject};\nexport const jsonNull = null;\n\nexport function stringify(j) {\n  return JSON.stringify(j);\n}\n\nexport function stringifyWithIndent(i) {\n  return function (j) {\n    return JSON.stringify(j, null, i);\n  };\n}\n\nfunction isArray(a) {\n  return Object.prototype.toString.call(a) === \"[object Array]\";\n}\n\nexport function _caseJson(isNull, isBool, isNum, isStr, isArr, isObj, j) {\n  if (j == null) return isNull();\n  else if (typeof j === \"boolean\") return isBool(j);\n  else if (typeof j === \"number\") return isNum(j);\n  else if (typeof j === \"string\") return isStr(j);\n  else if (Object.prototype.toString.call(j) === \"[object Array]\")\n    return isArr(j);\n  else return isObj(j);\n}\n\nexport function _compare(EQ, GT, LT, a, b) {\n  if (a == null) {\n    if (b == null) return EQ;\n    else return LT;\n  } else if (typeof a === \"boolean\") {\n    if (typeof b === \"boolean\") {\n      // boolean / boolean\n      if (a === b) return EQ;\n      else if (a === false) return LT;\n      else return GT;\n    } else if (b == null) return GT;\n    else return LT;\n  } else if (typeof a === \"number\") {\n    if (typeof b === \"number\") {\n      if (a === b) return EQ;\n      else if (a < b) return LT;\n      else return GT;\n    } else if (b == null) return GT;\n    else if (typeof b === \"boolean\") return GT;\n    else return LT;\n  } else if (typeof a === \"string\") {\n    if (typeof b === \"string\") {\n      if (a === b) return EQ;\n      else if (a < b) return LT;\n      else return GT;\n    } else if (b == null) return GT;\n    else if (typeof b === \"boolean\") return GT;\n    else if (typeof b === \"number\") return GT;\n    else return LT;\n  } else if (isArray(a)) {\n    if (isArray(b)) {\n      for (var i = 0; i < Math.min(a.length, b.length); i++) {\n        var ca = _compare(EQ, GT, LT, a[i], b[i]);\n        if (ca !== EQ) return ca;\n      }\n      if (a.length === b.length) return EQ;\n      else if (a.length < b.length) return LT;\n      else return GT;\n    } else if (b == null) return GT;\n    else if (typeof b === \"boolean\") return GT;\n    else if (typeof b === \"number\") return GT;\n    else if (typeof b === \"string\") return GT;\n    else return LT;\n  } else {\n    if (b == null) return GT;\n    else if (typeof b === \"boolean\") return GT;\n    else if (typeof b === \"number\") return GT;\n    else if (typeof b === \"string\") return GT;\n    else if (isArray(b)) return GT;\n    else {\n      var akeys = Object.keys(a);\n      var bkeys = Object.keys(b);\n      if (akeys.length < bkeys.length) return LT;\n      else if (akeys.length > bkeys.length) return GT;\n      var keys = akeys.concat(bkeys).sort();\n      for (var j = 0; j < keys.length; j++) {\n        var k = keys[j];\n        if (a[k] === undefined) return LT;\n        else if (b[k] === undefined) return GT;\n        var ck = _compare(EQ, GT, LT, a[k], b[k]);\n        if (ck !== EQ) return ck;\n      }\n      return EQ;\n    }\n  }\n}\n", "export function _copyST(m) {\n  return function () {\n    var r = {};\n    for (var k in m) {\n      if (hasOwnProperty.call(m, k)) {\n        r[k] = m[k];\n      }\n    }\n    return r;\n  };\n}\n\nexport const empty = {};\n\nexport function runST(f) {\n  return f();\n}\n\nexport function _fmapObject(m0, f) {\n  var m = {};\n  for (var k in m0) {\n    if (hasOwnProperty.call(m0, k)) {\n      m[k] = f(m0[k]);\n    }\n  }\n  return m;\n}\n\nexport function _mapWithKey(m0, f) {\n  var m = {};\n  for (var k in m0) {\n    if (hasOwnProperty.call(m0, k)) {\n      m[k] = f(k)(m0[k]);\n    }\n  }\n  return m;\n}\n\nexport function _foldM(bind) {\n  return function (f) {\n    return function (mz) {\n      return function (m) {\n        var acc = mz;\n        function g(k) {\n          return function (z) {\n            return f(z)(k)(m[k]);\n          };\n        }\n        for (var k in m) {\n          if (hasOwnProperty.call(m, k)) {\n            acc = bind(acc)(g(k));\n          }\n        }\n        return acc;\n      };\n    };\n  };\n}\n\nexport function _foldSCObject(m, z, f, fromMaybe) {\n  var acc = z;\n  for (var k in m) {\n    if (hasOwnProperty.call(m, k)) {\n      var maybeR = f(acc)(k)(m[k]);\n      var r = fromMaybe(null)(maybeR);\n      if (r === null) return acc;\n      else acc = r;\n    }\n  }\n  return acc;\n}\n\nexport function all(f) {\n  return function (m) {\n    for (var k in m) {\n      if (hasOwnProperty.call(m, k) && !f(k)(m[k])) return false;\n    }\n    return true;\n  };\n}\n\nexport function size(m) {\n  var s = 0;\n  for (var k in m) {\n    if (hasOwnProperty.call(m, k)) {\n      ++s;\n    }\n  }\n  return s;\n}\n\nexport function _lookup(no, yes, k, m) {\n  return k in m ? yes(m[k]) : no;\n}\n\nexport function _lookupST(no, yes, k, m) {\n  return function () {\n    return k in m ? yes(m[k]) : no;\n  };\n}\n\nexport function toArrayWithKey(f) {\n  return function (m) {\n    var r = [];\n    for (var k in m) {\n      if (hasOwnProperty.call(m, k)) {\n        r.push(f(k)(m[k]));\n      }\n    }\n    return r;\n  };\n}\n\nexport const keys = Object.keys || toArrayWithKey(function (k) {\n  return function () { return k; };\n});\n", "//------------------------------------------------------------------------------\n// Array creation --------------------------------------------------------------\n//------------------------------------------------------------------------------\n\nexport const rangeImpl = function (start, end) {\n  var step = start > end ? -1 : 1;\n  var result = new Array(step * (end - start) + 1);\n  var i = start, n = 0;\n  while (i !== end) {\n    result[n++] = i;\n    i += step;\n  }\n  result[n] = i;\n  return result;\n};\n\nvar replicateFill = function (count, value) {\n  if (count < 1) {\n    return [];\n  }\n  var result = new Array(count);\n  return result.fill(value);\n};\n\nvar replicatePolyfill = function (count, value) {\n  var result = [];\n  var n = 0;\n  for (var i = 0; i < count; i++) {\n    result[n++] = value;\n  }\n  return result;\n};\n\n// In browsers that have Array.prototype.fill we use it, as it's faster.\nexport const replicateImpl = typeof Array.prototype.fill === \"function\" ? replicateFill : replicatePolyfill;\n\nexport const fromFoldableImpl = (function () {\n  function Cons(head, tail) {\n    this.head = head;\n    this.tail = tail;\n  }\n  var emptyList = {};\n\n  function curryCons(head) {\n    return function (tail) {\n      return new Cons(head, tail);\n    };\n  }\n\n  function listToArray(list) {\n    var result = [];\n    var count = 0;\n    var xs = list;\n    while (xs !== emptyList) {\n      result[count++] = xs.head;\n      xs = xs.tail;\n    }\n    return result;\n  }\n\n  return function (foldr, xs) {\n    return listToArray(foldr(curryCons)(emptyList)(xs));\n  };\n})();\n\n//------------------------------------------------------------------------------\n// Array size ------------------------------------------------------------------\n//------------------------------------------------------------------------------\n\nexport const length = function (xs) {\n  return xs.length;\n};\n\n//------------------------------------------------------------------------------\n// Non-indexed reads -----------------------------------------------------------\n//------------------------------------------------------------------------------\n\nexport const unconsImpl = function (empty, next, xs) {\n  return xs.length === 0 ? empty({}) : next(xs[0])(xs.slice(1));\n};\n\n//------------------------------------------------------------------------------\n// Indexed operations ----------------------------------------------------------\n//------------------------------------------------------------------------------\n\nexport const indexImpl = function (just, nothing, xs, i) {\n  return i < 0 || i >= xs.length ? nothing :  just(xs[i]);\n};\n\nexport const findMapImpl = function (nothing, isJust, f, xs) {\n  for (var i = 0; i < xs.length; i++) {\n    var result = f(xs[i]);\n    if (isJust(result)) return result;\n  }\n  return nothing;\n};\n\nexport const findIndexImpl = function (just, nothing, f, xs) {\n  for (var i = 0, l = xs.length; i < l; i++) {\n    if (f(xs[i])) return just(i);\n  }\n  return nothing;\n};\n\nexport const findLastIndexImpl = function (just, nothing, f, xs) {\n  for (var i = xs.length - 1; i >= 0; i--) {\n    if (f(xs[i])) return just(i);\n  }\n  return nothing;\n};\n\nexport const _insertAt = function (just, nothing, i, a, l) {\n  if (i < 0 || i > l.length) return nothing;\n  var l1 = l.slice();\n  l1.splice(i, 0, a);\n  return just(l1);\n};\n\nexport const _deleteAt = function (just, nothing, i, l) {\n  if (i < 0 || i >= l.length) return nothing;\n  var l1 = l.slice();\n  l1.splice(i, 1);\n  return just(l1);\n};\n\nexport const _updateAt = function (just, nothing, i, a, l) {\n  if (i < 0 || i >= l.length) return nothing;\n  var l1 = l.slice();\n  l1[i] = a;\n  return just(l1);\n};\n\n//------------------------------------------------------------------------------\n// Transformations -------------------------------------------------------------\n//------------------------------------------------------------------------------\n\nexport const reverse = function (l) {\n  return l.slice().reverse();\n};\n\nexport const concat = function (xss) {\n  if (xss.length <= 10000) {\n    // This method is faster, but it crashes on big arrays.\n    // So we use it when can and fallback to simple variant otherwise.\n    return Array.prototype.concat.apply([], xss);\n  }\n\n  var result = [];\n  for (var i = 0, l = xss.length; i < l; i++) {\n    var xs = xss[i];\n    for (var j = 0, m = xs.length; j < m; j++) {\n      result.push(xs[j]);\n    }\n  }\n  return result;\n};\n\nexport const filterImpl = function (f, xs) {\n  return xs.filter(f);\n};\n\nexport const partitionImpl = function (f, xs) {\n  var yes = [];\n  var no  = [];\n  for (var i = 0; i < xs.length; i++) {\n    var x = xs[i];\n    if (f(x))\n      yes.push(x);\n    else\n      no.push(x);\n  }\n  return { yes: yes, no: no };\n};\n\nexport const scanlImpl = function (f, b, xs) {\n  var len = xs.length;\n  var acc = b;\n  var out = new Array(len);\n  for (var i = 0; i < len; i++) {\n    acc = f(acc)(xs[i]);\n    out[i] = acc;\n  }\n  return out;\n};\n\nexport const scanrImpl = function (f, b, xs) {\n  var len = xs.length;\n  var acc = b;\n  var out = new Array(len);\n  for (var i = len - 1; i >= 0; i--) {\n    acc = f(xs[i])(acc);\n    out[i] = acc;\n  }\n  return out;\n};\n\n//------------------------------------------------------------------------------\n// Sorting ---------------------------------------------------------------------\n//------------------------------------------------------------------------------\n\nexport const sortByImpl = (function () {\n  function mergeFromTo(compare, fromOrdering, xs1, xs2, from, to) {\n    var mid;\n    var i;\n    var j;\n    var k;\n    var x;\n    var y;\n    var c;\n\n    mid = from + ((to - from) >> 1);\n    if (mid - from > 1) mergeFromTo(compare, fromOrdering, xs2, xs1, from, mid);\n    if (to - mid > 1) mergeFromTo(compare, fromOrdering, xs2, xs1, mid, to);\n\n    i = from;\n    j = mid;\n    k = from;\n    while (i < mid && j < to) {\n      x = xs2[i];\n      y = xs2[j];\n      c = fromOrdering(compare(x)(y));\n      if (c > 0) {\n        xs1[k++] = y;\n        ++j;\n      }\n      else {\n        xs1[k++] = x;\n        ++i;\n      }\n    }\n    while (i < mid) {\n      xs1[k++] = xs2[i++];\n    }\n    while (j < to) {\n      xs1[k++] = xs2[j++];\n    }\n  }\n\n  return function (compare, fromOrdering, xs) {\n    var out;\n\n    if (xs.length < 2) return xs;\n\n    out = xs.slice(0);\n    mergeFromTo(compare, fromOrdering, out, xs.slice(0), 0, xs.length);\n\n    return out;\n  };\n})();\n\n//------------------------------------------------------------------------------\n// Subarrays -------------------------------------------------------------------\n//------------------------------------------------------------------------------\n\nexport const sliceImpl = function (s, e, l) {\n  return l.slice(s, e);\n};\n\n//------------------------------------------------------------------------------\n// Zipping ---------------------------------------------------------------------\n//------------------------------------------------------------------------------\n\nexport const zipWithImpl = function (f, xs, ys) {\n  var l = xs.length < ys.length ? xs.length : ys.length;\n  var result = new Array(l);\n  for (var i = 0; i < l; i++) {\n    result[i] = f(xs[i])(ys[i]);\n  }\n  return result;\n};\n\n//------------------------------------------------------------------------------\n// Folding ---------------------------------------------------------------------\n//------------------------------------------------------------------------------\n\nexport const anyImpl = function (p, xs) {\n  var len = xs.length;\n  for (var i = 0; i < len; i++) {\n    if (p(xs[i])) return true;\n  }\n  return false;\n};\n\nexport const allImpl = function (p, xs) {\n  var len = xs.length;\n  for (var i = 0; i < len; i++) {\n    if (!p(xs[i])) return false;\n  }\n  return true;\n};\n\n//------------------------------------------------------------------------------\n// Partial ---------------------------------------------------------------------\n//------------------------------------------------------------------------------\n\nexport const unsafeIndexImpl = function (xs, n) {\n  return xs[n];\n};\n", "function newSTArray() {\n  return [];\n}\nexport { newSTArray as new };\n\nexport const peekImpl = function (just, nothing, i, xs) {\n  return i >= 0 && i < xs.length ? just(xs[i]) : nothing;\n};\n\nexport const pokeImpl = function (i, a, xs) {\n  var ret = i >= 0 && i < xs.length;\n  if (ret) xs[i] = a;\n  return ret;\n};\n\nexport const lengthImpl = function (xs) {\n  return xs.length;\n};\n\nexport const popImpl = function (just, nothing, xs) {\n  return xs.length > 0 ? just(xs.pop()) : nothing;\n};\n\nexport const pushAllImpl = function (as, xs) {\n  return xs.push.apply(xs, as);\n};\n\nexport const shiftImpl = function (just, nothing, xs) {\n  return xs.length > 0 ? just(xs.shift()) : nothing;\n};\n\nexport const unshiftAllImpl = function (as, xs) {\n  return xs.unshift.apply(xs, as);\n};\n\nexport const spliceImpl = function (i, howMany, bs, xs) {\n  return xs.splice.apply(xs, [i, howMany].concat(bs));\n};\n\nfunction unsafeFreezeThawImpl(xs) {\n  return xs;\n}\n\nexport const unsafeFreezeImpl = unsafeFreezeThawImpl;\n\nexport const unsafeThawImpl = unsafeFreezeThawImpl;\n\nfunction copyImpl(xs) {\n  return xs.slice();\n}\n\nexport const freezeImpl = copyImpl;\n\nexport const thawImpl = copyImpl;\n\nexport const cloneImpl = copyImpl;\n\nexport const sortByImpl = (function () {\n  function mergeFromTo(compare, fromOrdering, xs1, xs2, from, to) {\n    var mid;\n    var i;\n    var j;\n    var k;\n    var x;\n    var y;\n    var c;\n\n    mid = from + ((to - from) >> 1);\n    if (mid - from > 1) mergeFromTo(compare, fromOrdering, xs2, xs1, from, mid);\n    if (to - mid > 1) mergeFromTo(compare, fromOrdering, xs2, xs1, mid, to);\n\n    i = from;\n    j = mid;\n    k = from;\n    while (i < mid && j < to) {\n      x = xs2[i];\n      y = xs2[j];\n      c = fromOrdering(compare(x)(y));\n      if (c > 0) {\n        xs1[k++] = y;\n        ++j;\n      } else {\n        xs1[k++] = x;\n        ++i;\n      }\n    }\n    while (i < mid) {\n      xs1[k++] = xs2[i++];\n    }\n    while (j < to) {\n      xs1[k++] = xs2[j++];\n    }\n  }\n\n  return function (compare, fromOrdering, xs) {\n    if (xs.length < 2) return xs;\n\n    mergeFromTo(compare, fromOrdering, xs, xs.slice(0), 0, xs.length);\n\n    return xs;\n  };\n})();\n\nexport const toAssocArrayImpl = function (xs) {\n  var n = xs.length;\n  var as = new Array(n);\n  for (var i = 0; i < n; i++) as[i] = { value: xs[i], index: i };\n  return as;\n};\n\nexport const pushImpl = function (a, xs) {\n  return xs.push(a);\n};\n", "export const mkSTFn1 = function mkSTFn1(fn) {\n  return function(x) {\n    return fn(x)();\n  };\n};\n  \nexport const mkSTFn2 = function mkSTFn2(fn) {\n  return function(a, b) {\n    return fn(a)(b)();\n  };\n};\n  \nexport const mkSTFn3 = function mkSTFn3(fn) {\n  return function(a, b, c) {\n    return fn(a)(b)(c)();\n  };\n};\n  \nexport const mkSTFn4 = function mkSTFn4(fn) {\n  return function(a, b, c, d) {\n    return fn(a)(b)(c)(d)();\n  };\n};\n  \nexport const mkSTFn5 = function mkSTFn5(fn) {\n  return function(a, b, c, d, e) {\n    return fn(a)(b)(c)(d)(e)();\n  };\n};\n  \nexport const mkSTFn6 = function mkSTFn6(fn) {\n  return function(a, b, c, d, e, f) {\n    return fn(a)(b)(c)(d)(e)(f)();\n  };\n};\n  \nexport const mkSTFn7 = function mkSTFn7(fn) {\n  return function(a, b, c, d, e, f, g) {\n    return fn(a)(b)(c)(d)(e)(f)(g)();\n  };\n};\n  \nexport const mkSTFn8 = function mkSTFn8(fn) {\n  return function(a, b, c, d, e, f, g, h) {\n    return fn(a)(b)(c)(d)(e)(f)(g)(h)();\n  };\n};\n  \nexport const mkSTFn9 = function mkSTFn9(fn) {\n  return function(a, b, c, d, e, f, g, h, i) {\n    return fn(a)(b)(c)(d)(e)(f)(g)(h)(i)();\n  };\n};\n  \nexport const mkSTFn10 = function mkSTFn10(fn) {\n  return function(a, b, c, d, e, f, g, h, i, j) {\n    return fn(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)();\n  };\n};\n  \nexport const runSTFn1 = function runSTFn1(fn) {\n  return function(a) {\n    return function() {\n      return fn(a);\n    };\n  };\n};\n  \nexport const runSTFn2 = function runSTFn2(fn) {\n  return function(a) {\n    return function(b) {\n      return function() {\n        return fn(a, b);\n      };\n    };\n  };\n};\n  \nexport const runSTFn3 = function runSTFn3(fn) {\n  return function(a) {\n    return function(b) {\n      return function(c) {\n        return function() {\n          return fn(a, b, c);\n        };\n      };\n    };\n  };\n};\n  \nexport const runSTFn4 = function runSTFn4(fn) {\n  return function(a) {\n    return function(b) {\n      return function(c) {\n        return function(d) {\n          return function() {\n            return fn(a, b, c, d);\n          };\n        };\n      };\n    };\n  };\n};\n  \nexport const runSTFn5 = function runSTFn5(fn) {\n  return function(a) {\n    return function(b) {\n      return function(c) {\n        return function(d) {\n          return function(e) {\n            return function() {\n              return fn(a, b, c, d, e);\n            };\n          };\n        };\n      };\n    };\n  };\n};\n  \nexport const runSTFn6 = function runSTFn6(fn) {\n  return function(a) {\n    return function(b) {\n      return function(c) {\n        return function(d) {\n          return function(e) {\n            return function(f) {\n              return function() {\n                return fn(a, b, c, d, e, f);\n              };\n            };\n          };\n        };\n      };\n    };\n  };\n};\n  \nexport const runSTFn7 = function runSTFn7(fn) {\n  return function(a) {\n    return function(b) {\n      return function(c) {\n        return function(d) {\n          return function(e) {\n            return function(f) {\n              return function(g) {\n                return function() {\n                  return fn(a, b, c, d, e, f, g);\n                };\n              };\n            };\n          };\n        };\n      };\n    };\n  };\n};\n  \nexport const runSTFn8 = function runSTFn8(fn) {\n  return function(a) {\n    return function(b) {\n      return function(c) {\n        return function(d) {\n          return function(e) {\n            return function(f) {\n              return function(g) {\n                return function(h) {\n                  return function() {\n                    return fn(a, b, c, d, e, f, g, h);\n                  };\n                };\n              };\n            };\n          };\n        };\n      };\n    };\n  };\n};\n  \nexport const runSTFn9 = function runSTFn9(fn) {\n  return function(a) {\n    return function(b) {\n      return function(c) {\n        return function(d) {\n          return function(e) {\n            return function(f) {\n              return function(g) {\n                return function(h) {\n                  return function(i) {\n                    return function() {\n                      return fn(a, b, c, d, e, f, g, h, i);\n                    };\n                  };\n                };\n              };\n            };\n          };\n        };\n      };\n    };\n  };\n};\n  \nexport const runSTFn10 = function runSTFn10(fn) {\n  return function(a) {\n    return function(b) {\n      return function(c) {\n        return function(d) {\n          return function(e) {\n            return function(f) {\n              return function(g) {\n                return function(h) {\n                  return function(i) {\n                    return function(j) {\n                      return function() {\n                        return fn(a, b, c, d, e, f, g, h, i, j);\n                      };\n                    };\n                  };\n                };\n              };\n            };\n          };\n        };\n      };\n    };\n  };\n};", "-- | Helper functions for working with mutable arrays using the `ST` effect.\n-- |\n-- | This module can be used when performance is important and mutation is a local effect.\n\nmodule Data.Array.ST\n  ( STArray(..)\n  , Assoc\n  , run\n  , withArray\n  , new\n  , peek\n  , poke\n  , modify\n  , length\n  , pop\n  , push\n  , pushAll\n  , shift\n  , unshift\n  , unshiftAll\n  , splice\n  , sort\n  , sortBy\n  , sortWith\n  , freeze\n  , thaw\n  , clone\n  , unsafeFreeze\n  , unsafeThaw\n  , toAssocArray\n  ) where\n\nimport Prelude\n\nimport Control.Monad.ST (ST, Region)\nimport Control.Monad.ST as ST\nimport Control.Monad.ST.Uncurried (STFn1, STFn2, STFn3, STFn4, runSTFn1, runSTFn2, runSTFn3, runSTFn4)\nimport Data.Maybe (Maybe(..))\n\n-- | A reference to a mutable array.\n-- |\n-- | The first type parameter represents the memory region which the array belongs to.\n-- | The second type parameter defines the type of elements of the mutable array.\n-- |\n-- | The runtime representation of a value of type `STArray h a` is the same as that of `Array a`,\n-- | except that mutation is allowed.\nforeign import data STArray :: Region -> Type -> Type\n\ntype role STArray nominal representational\n\n-- | An element and its index.\ntype Assoc a = { value :: a, index :: Int }\n\n-- | A safe way to create and work with a mutable array before returning an\n-- | immutable array for later perusal. This function avoids copying the array\n-- | before returning it - it uses unsafeFreeze internally, but this wrapper is\n-- | a safe interface to that function.\nrun :: forall a. (forall h. ST h (STArray h a)) -> Array a\nrun st = ST.run (st >>= unsafeFreeze)\n\n-- | Perform an effect requiring a mutable array on a copy of an immutable array,\n-- | safely returning the result as an immutable array.\nwithArray\n  :: forall h a b\n   . (STArray h a -> ST h b)\n  -> Array a\n  -> ST h (Array a)\nwithArray f xs = do\n  result <- thaw xs\n  _ <- f result\n  unsafeFreeze result\n\n-- | O(1). Convert a mutable array to an immutable array, without copying. The mutable\n-- | array must not be mutated afterwards.\nunsafeFreeze :: forall h a. STArray h a -> ST h (Array a)\nunsafeFreeze = runSTFn1 unsafeFreezeImpl\n\nforeign import unsafeFreezeImpl :: forall h a. STFn1 (STArray h a) h (Array a)\n\n-- | O(1) Convert an immutable array to a mutable array, without copying. The input\n-- | array must not be used afterward.\nunsafeThaw :: forall h a. Array a -> ST h (STArray h a)\nunsafeThaw = runSTFn1 unsafeThawImpl\n\nforeign import unsafeThawImpl :: forall h a. STFn1 (Array a) h (STArray h a)\n\n-- | Create a new, empty mutable array.\nforeign import new :: forall h a. ST h (STArray h a)\n\nthaw\n  :: forall h a\n   . Array a\n  -> ST h (STArray h a)\nthaw = runSTFn1 thawImpl\n\n-- | Create a mutable copy of an immutable array.\nforeign import thawImpl :: forall h a. STFn1 (Array a) h (STArray h a)\n\n-- | Make a mutable copy of a mutable array.\nclone\n  :: forall h a\n   . STArray h a\n  -> ST h (STArray h a)\nclone = runSTFn1 cloneImpl\n\nforeign import cloneImpl :: forall h a. STFn1 (STArray h a) h (STArray h a)\n\n-- | Sort a mutable array in place. Sorting is stable: the order of equal\n-- | elements is preserved.\nsort :: forall a h. Ord a => STArray h a -> ST h (STArray h a)\nsort = sortBy compare\n\n-- | Remove the first element from an array and return that element.\nshift :: forall h a. STArray h a -> ST h (Maybe a)\nshift = runSTFn3 shiftImpl Just Nothing\n\nforeign import shiftImpl\n  :: forall h a\n   . STFn3 (forall b. b -> Maybe b) (forall b. Maybe b) (STArray h a) h (Maybe a)\n\n-- | Sort a mutable array in place using a comparison function. Sorting is\n-- | stable: the order of elements is preserved if they are equal according to\n-- | the comparison function.\nsortBy\n  :: forall a h\n   . (a -> a -> Ordering)\n  -> STArray h a\n  -> ST h (STArray h a)\nsortBy comp = runSTFn3 sortByImpl comp case _ of\n  GT -> 1\n  EQ -> 0\n  LT -> -1\n\nforeign import sortByImpl\n  :: forall a h\n   . STFn3 (a -> a -> Ordering) (Ordering -> Int) (STArray h a) h (STArray h a)\n\n-- | Sort a mutable array in place based on a projection. Sorting is stable: the\n-- | order of elements is preserved if they are equal according to the projection.\nsortWith\n  :: forall a b h\n   . Ord b\n  => (a -> b)\n  -> STArray h a\n  -> ST h (STArray h a)\nsortWith f = sortBy (comparing f)\n\n-- | Create an immutable copy of a mutable array.\nfreeze\n  :: forall h a\n   . STArray h a\n  -> ST h (Array a)\nfreeze = runSTFn1 freezeImpl\n\nforeign import freezeImpl :: forall h a. STFn1 (STArray h a) h (Array a)\n\n-- | Read the value at the specified index in a mutable array.\npeek\n  :: forall h a\n   . Int\n  -> STArray h a\n  -> ST h (Maybe a)\npeek = runSTFn4 peekImpl Just Nothing\n\nforeign import peekImpl :: forall h a r. STFn4 (a -> r) r Int (STArray h a) h r\n\npoke\n  :: forall h a\n   . Int\n  -> a\n  -> STArray h a\n  -> ST h Boolean\npoke = runSTFn3 pokeImpl\n\n-- | Change the value at the specified index in a mutable array.\nforeign import pokeImpl :: forall h a. STFn3 Int a (STArray h a) h Boolean\n\nforeign import lengthImpl :: forall h a. STFn1 (STArray h a) h Int\n\n-- | Get the number of elements in a mutable array.\nlength :: forall h a. STArray h a -> ST h Int\nlength = runSTFn1 lengthImpl\n\n-- | Remove the last element from an array and return that element.\npop :: forall h a. STArray h a -> ST h (Maybe a)\npop = runSTFn3 popImpl Just Nothing\n\nforeign import popImpl\n  :: forall h a\n   . STFn3 (forall b. b -> Maybe b) (forall b. Maybe b) (STArray h a) h (Maybe a)\n\n-- | Append an element to the end of a mutable array. Returns the new length of\n-- | the array.\npush :: forall h a. a -> (STArray h a) -> ST h Int\npush = runSTFn2 pushImpl\n\nforeign import pushImpl :: forall h a. STFn2 a (STArray h a) h Int\n\n-- | Append the values in an immutable array to the end of a mutable array.\n-- | Returns the new length of the mutable array.\npushAll\n  :: forall h a\n   . Array a\n  -> STArray h a\n  -> ST h Int\npushAll = runSTFn2 pushAllImpl\n\nforeign import pushAllImpl\n  :: forall h a\n   . STFn2 (Array a) (STArray h a) h Int\n\n-- | Append an element to the front of a mutable array. Returns the new length of\n-- | the array.\nunshift :: forall h a. a -> STArray h a -> ST h Int\nunshift a = runSTFn2 unshiftAllImpl [ a ]\n\n-- | Append the values in an immutable array to the front of a mutable array.\n-- | Returns the new length of the mutable array.\nunshiftAll\n  :: forall h a\n   . Array a\n  -> STArray h a\n  -> ST h Int\nunshiftAll = runSTFn2 unshiftAllImpl\n\nforeign import unshiftAllImpl\n  :: forall h a\n   . STFn2 (Array a) (STArray h a) h Int\n\n-- | Mutate the element at the specified index using the supplied function.\nmodify :: forall h a. Int -> (a -> a) -> STArray h a -> ST h Boolean\nmodify i f xs = do\n  entry <- peek i xs\n  case entry of\n    Just x -> poke i (f x) xs\n    Nothing -> pure false\n\n-- | Remove and/or insert elements from/into a mutable array at the specified index.\nsplice\n  :: forall h a\n   . Int\n  -> Int\n  -> Array a\n  -> STArray h a\n  -> ST h (Array a)\nsplice = runSTFn4 spliceImpl\n\nforeign import spliceImpl\n  :: forall h a\n   . STFn4 Int Int (Array a) (STArray h a) h (Array a)\n\n-- | Create an immutable copy of a mutable array, where each element\n-- | is labelled with its index in the original array.\ntoAssocArray\n  :: forall h a\n   . STArray h a\n  -> ST h (Array (Assoc a))\ntoAssocArray = runSTFn1 toAssocArrayImpl\n\nforeign import toAssocArrayImpl\n  :: forall h a\n   . STFn1 (STArray h a) h (Array (Assoc a))\n", "export const foldrArray = function (f) {\n  return function (init) {\n    return function (xs) {\n      var acc = init;\n      var len = xs.length;\n      for (var i = len - 1; i >= 0; i--) {\n        acc = f(xs[i])(acc);\n      }\n      return acc;\n    };\n  };\n};\n\nexport const foldlArray = function (f) {\n  return function (init) {\n    return function (xs) {\n      var acc = init;\n      var len = xs.length;\n      for (var i = 0; i < len; i++) {\n        acc = f(acc)(xs[i]);\n      }\n      return acc;\n    };\n  };\n};\n", "module Control.Plus\n  ( class Plus, empty\n  , module Control.Alt\n  , module Data.Functor\n  ) where\n\nimport Control.Alt (class Alt, alt, (<|>))\n\nimport Data.Functor (class Functor, map, void, ($>), (<#>), (<$), (<$>))\n\n-- | The `Plus` type class extends the `Alt` type class with a value that\n-- | should be the left and right identity for `(<|>)`.\n-- |\n-- | It is similar to `Monoid`, except that it applies to types of\n-- | kind `* -> *`, like `Array` or `List`, rather than concrete types like\n-- | `String` or `Number`.\n-- |\n-- | `Plus` instances should satisfy the following laws:\n-- |\n-- | - Left identity: `empty <|> x == x`\n-- | - Right identity: `x <|> empty == x`\n-- | - Annihilation: `f <$> empty == empty`\nclass Alt f <= Plus f where\n  empty :: forall a. f a\n\ninstance plusArray :: Plus Array where\n  empty = []\n", "module Data.Bifunctor where\n\nimport Control.Category (identity)\nimport Data.Const (Const(..))\nimport Data.Either (Either(..))\nimport Data.Tuple (Tuple(..))\n\n-- | A `Bifunctor` is a `Functor` from the pair category `(Type, Type)` to `Type`.\n-- |\n-- | A type constructor with two type arguments can be made into a `Bifunctor` if\n-- | both of its type arguments are covariant.\n-- |\n-- | The `bimap` function maps a pair of functions over the two type arguments\n-- | of the bifunctor.\n-- |\n-- | Laws:\n-- |\n-- | - Identity: `bimap identity identity == identity`\n-- | - Composition: `bimap f1 g1 <<< bimap f2 g2 == bimap (f1 <<< f2) (g1 <<< g2)`\n-- |\nclass Bifunctor f where\n  bimap :: forall a b c d. (a -> b) -> (c -> d) -> f a c -> f b d\n\n-- | Map a function over the first type argument of a `Bifunctor`.\nlmap :: forall f a b c. Bifunctor f => (a -> b) -> f a c -> f b c\nlmap f = bimap f identity\n\n-- | Map a function over the second type arguments of a `Bifunctor`.\nrmap :: forall f a b c. Bifunctor f => (b -> c) -> f a b -> f a c\nrmap = bimap identity\n\ninstance bifunctorEither :: Bifunctor Either where\n  bimap f _ (Left l) = Left (f l)\n  bimap _ g (Right r) = Right (g r)\n\ninstance bifunctorTuple :: Bifunctor Tuple where\n  bimap f g (Tuple x y) = Tuple (f x) (g y)\n\ninstance bifunctorConst :: Bifunctor Const where\n  bimap f _ (Const a) = Const (f a)\n", "module Data.Monoid.Disj where\n\nimport Prelude\n\nimport Data.Eq (class Eq1)\nimport Data.HeytingAlgebra (ff, tt)\nimport Data.Ord (class Ord1)\n\n-- | Monoid and semigroup for disjunction.\n-- |\n-- | ``` purescript\n-- | Disj x <> Disj y == Disj (x || y)\n-- | (mempty :: Disj _) == Disj bottom\n-- | ```\nnewtype Disj a = Disj a\n\nderive newtype instance eqDisj :: Eq a => Eq (Disj a)\nderive instance eq1Disj :: Eq1 Disj\n\nderive newtype instance ordDisj :: Ord a => Ord (Disj a)\nderive instance ord1Disj :: Ord1 Disj\n\nderive newtype instance boundedDisj :: Bounded a => Bounded (Disj a)\n\ninstance showDisj :: Show a => Show (Disj a) where\n  show (Disj a) = \"(Disj \" <> show a <> \")\"\n\nderive instance functorDisj :: Functor Disj\n\ninstance applyDisj :: Apply Disj where\n  apply (Disj f) (Disj x) = Disj (f x)\n\ninstance applicativeDisj :: Applicative Disj where\n  pure = Disj\n\ninstance bindDisj :: Bind Disj where\n  bind (Disj x) f = f x\n\ninstance monadDisj :: Monad Disj\n\ninstance semigroupDisj :: HeytingAlgebra a => Semigroup (Disj a) where\n  append (Disj a) (Disj b) = Disj (disj a b)\n\ninstance monoidDisj :: HeytingAlgebra a => Monoid (Disj a) where\n  mempty = Disj ff\n\ninstance semiringDisj :: HeytingAlgebra a => Semiring (Disj a) where\n  zero = Disj ff\n  one = Disj tt\n  add (Disj a) (Disj b) = Disj (disj a b)\n  mul (Disj a) (Disj b) = Disj (conj a b)\n", "module Data.Foldable\n  ( class Foldable, foldr, foldl, foldMap\n  , foldrDefault, foldlDefault, foldMapDefaultL, foldMapDefaultR\n  , fold\n  , foldM\n  , traverse_\n  , for_\n  , sequence_\n  , oneOf\n  , oneOfMap\n  , intercalate\n  , surroundMap\n  , surround\n  , and\n  , or\n  , all\n  , any\n  , sum\n  , product\n  , elem\n  , notElem\n  , indexl\n  , indexr\n  , find\n  , findMap\n  , maximum\n  , maximumBy\n  , minimum\n  , minimumBy\n  , null\n  , length\n  , lookup\n  ) where\n\nimport Prelude\n\nimport Control.Plus (class Plus, alt, empty)\nimport Data.Const (Const)\nimport Data.Either (Either(..))\nimport Data.Functor.App (App(..))\nimport Data.Functor.Compose (Compose(..))\nimport Data.Functor.Coproduct (Coproduct, coproduct)\nimport Data.Functor.Product (Product(..))\nimport Data.Identity (Identity(..))\nimport Data.Maybe (Maybe(..))\nimport Data.Maybe.First (First(..))\nimport Data.Maybe.Last (Last(..))\nimport Data.Monoid.Additive (Additive(..))\nimport Data.Monoid.Conj (Conj(..))\nimport Data.Monoid.Disj (Disj(..))\nimport Data.Monoid.Dual (Dual(..))\nimport Data.Monoid.Endo (Endo(..))\nimport Data.Monoid.Multiplicative (Multiplicative(..))\nimport Data.Newtype (alaF, unwrap)\nimport Data.Tuple (Tuple(..))\n\n-- | `Foldable` represents data structures which can be _folded_.\n-- |\n-- | - `foldr` folds a structure from the right\n-- | - `foldl` folds a structure from the left\n-- | - `foldMap` folds a structure by accumulating values in a `Monoid`\n-- |\n-- | Default implementations are provided by the following functions:\n-- |\n-- | - `foldrDefault`\n-- | - `foldlDefault`\n-- | - `foldMapDefaultR`\n-- | - `foldMapDefaultL`\n-- |\n-- | Note: some combinations of the default implementations are unsafe to\n-- | use together - causing a non-terminating mutually recursive cycle.\n-- | These combinations are documented per function.\nclass Foldable f where\n  foldr :: forall a b. (a -> b -> b) -> b -> f a -> b\n  foldl :: forall a b. (b -> a -> b) -> b -> f a -> b\n  foldMap :: forall a m. Monoid m => (a -> m) -> f a -> m\n\n-- | A default implementation of `foldr` using `foldMap`.\n-- |\n-- | Note: when defining a `Foldable` instance, this function is unsafe to use\n-- | in combination with `foldMapDefaultR`.\nfoldrDefault\n  :: forall f a b\n   . Foldable f\n  => (a -> b -> b)\n  -> b\n  -> f a\n  -> b\nfoldrDefault c u xs = unwrap (foldMap (Endo <<< c) xs) u\n\n-- | A default implementation of `foldl` using `foldMap`.\n-- |\n-- | Note: when defining a `Foldable` instance, this function is unsafe to use\n-- | in combination with `foldMapDefaultL`.\nfoldlDefault\n  :: forall f a b\n   . Foldable f\n  => (b -> a -> b)\n  -> b\n  -> f a\n  -> b\nfoldlDefault c u xs = unwrap (unwrap (foldMap (Dual <<< Endo <<< flip c) xs)) u\n\n-- | A default implementation of `foldMap` using `foldr`.\n-- |\n-- | Note: when defining a `Foldable` instance, this function is unsafe to use\n-- | in combination with `foldrDefault`.\nfoldMapDefaultR\n  :: forall f a m\n   . Foldable f\n  => Monoid m\n  => (a -> m)\n  -> f a\n  -> m\nfoldMapDefaultR f = foldr (\\x acc -> f x <> acc) mempty\n\n-- | A default implementation of `foldMap` using `foldl`.\n-- |\n-- | Note: when defining a `Foldable` instance, this function is unsafe to use\n-- | in combination with `foldlDefault`.\nfoldMapDefaultL\n  :: forall f a m\n   . Foldable f\n  => Monoid m\n  => (a -> m)\n  -> f a\n  -> m\nfoldMapDefaultL f = foldl (\\acc x -> acc <> f x) mempty\n\ninstance foldableArray :: Foldable Array where\n  foldr = foldrArray\n  foldl = foldlArray\n  foldMap = foldMapDefaultR\n\nforeign import foldrArray :: forall a b. (a -> b -> b) -> b -> Array a -> b\nforeign import foldlArray :: forall a b. (b -> a -> b) -> b -> Array a -> b\n\ninstance foldableMaybe :: Foldable Maybe where\n  foldr _ z Nothing  = z\n  foldr f z (Just x) = x `f` z\n  foldl _ z Nothing  = z\n  foldl f z (Just x) = z `f` x\n  foldMap _ Nothing  = mempty\n  foldMap f (Just x) = f x\n\ninstance foldableFirst :: Foldable First where\n  foldr f z (First x) = foldr f z x\n  foldl f z (First x) = foldl f z x\n  foldMap f (First x) = foldMap f x\n\ninstance foldableLast :: Foldable Last where\n  foldr f z (Last x) = foldr f z x\n  foldl f z (Last x) = foldl f z x\n  foldMap f (Last x) = foldMap f x\n\ninstance foldableAdditive :: Foldable Additive where\n  foldr f z (Additive x) = x `f` z\n  foldl f z (Additive x) = z `f` x\n  foldMap f (Additive x) = f x\n\ninstance foldableDual :: Foldable Dual where\n  foldr f z (Dual x) = x `f` z\n  foldl f z (Dual x) = z `f` x\n  foldMap f (Dual x) = f x\n\ninstance foldableDisj :: Foldable Disj where\n  foldr f z (Disj x) = f x z\n  foldl f z (Disj x) = f z x\n  foldMap f (Disj x) = f x\n\ninstance foldableConj :: Foldable Conj where\n  foldr f z (Conj x) = f x z\n  foldl f z (Conj x) = f z x\n  foldMap f (Conj x) = f x\n\ninstance foldableMultiplicative :: Foldable Multiplicative where\n  foldr f z (Multiplicative x) = x `f` z\n  foldl f z (Multiplicative x) = z `f` x\n  foldMap f (Multiplicative x) = f x\n\ninstance foldableEither :: Foldable (Either a) where\n  foldr _ z (Left _)  = z\n  foldr f z (Right x) = f x z\n  foldl _ z (Left _)  = z\n  foldl f z (Right x) = f z x\n  foldMap _ (Left _)  = mempty\n  foldMap f (Right x) = f x\n\ninstance foldableTuple :: Foldable (Tuple a) where\n  foldr f z (Tuple _ x) = f x z\n  foldl f z (Tuple _ x) = f z x\n  foldMap f (Tuple _ x) = f x\n\ninstance foldableIdentity :: Foldable Identity where\n  foldr f z (Identity x) = f x z\n  foldl f z (Identity x) = f z x\n  foldMap f (Identity x) = f x\n\ninstance foldableConst :: Foldable (Const a) where\n  foldr _ z _ = z\n  foldl _ z _ = z\n  foldMap _ _ = mempty\n\ninstance foldableProduct :: (Foldable f, Foldable g) => Foldable (Product f g) where\n  foldr f z (Product (Tuple fa ga)) = foldr f (foldr f z ga) fa\n  foldl f z (Product (Tuple fa ga)) = foldl f (foldl f z fa) ga\n  foldMap f (Product (Tuple fa ga)) = foldMap f fa <> foldMap f ga\n\ninstance foldableCoproduct :: (Foldable f, Foldable g) => Foldable (Coproduct f g) where\n  foldr f z = coproduct (foldr f z) (foldr f z)\n  foldl f z = coproduct (foldl f z) (foldl f z)\n  foldMap f = coproduct (foldMap f) (foldMap f)\n\ninstance foldableCompose :: (Foldable f, Foldable g) => Foldable (Compose f g) where\n  foldr f i (Compose fga) = foldr (flip (foldr f)) i fga\n  foldl f i (Compose fga) = foldl (foldl f) i fga\n  foldMap f (Compose fga) = foldMap (foldMap f) fga\n\ninstance foldableApp :: Foldable f => Foldable (App f) where\n  foldr f i (App x) = foldr f i x\n  foldl f i (App x) = foldl f i x\n  foldMap f (App x) = foldMap f x\n\n-- | Fold a data structure, accumulating values in some `Monoid`.\nfold :: forall f m. Foldable f => Monoid m => f m -> m\nfold = foldMap identity\n\n-- | Similar to 'foldl', but the result is encapsulated in a monad.\n-- |\n-- | Note: this function is not generally stack-safe, e.g., for monads which\n-- | build up thunks a la `Eff`.\nfoldM :: forall f m a b. Foldable f => Monad m => (b -> a -> m b) -> b -> f a -> m b\nfoldM f b0 = foldl (\\b a -> b >>= flip f a) (pure b0)\n\n-- | Traverse a data structure, performing some effects encoded by an\n-- | `Applicative` functor at each value, ignoring the final result.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | traverse_ print [1, 2, 3]\n-- | ```\ntraverse_\n  :: forall a b f m\n   . Applicative m\n  => Foldable f\n  => (a -> m b)\n  -> f a\n  -> m Unit\ntraverse_ f = foldr ((*>) <<< f) (pure unit)\n\n-- | A version of `traverse_` with its arguments flipped.\n-- |\n-- | This can be useful when running an action written using do notation\n-- | for every element in a data structure:\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | for_ [1, 2, 3] \\n -> do\n-- |   print n\n-- |   trace \"squared is\"\n-- |   print (n * n)\n-- | ```\nfor_\n  :: forall a b f m\n   . Applicative m\n  => Foldable f\n  => f a\n  -> (a -> m b)\n  -> m Unit\nfor_ = flip traverse_\n\n-- | Perform all of the effects in some data structure in the order\n-- | given by the `Foldable` instance, ignoring the final result.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | sequence_ [ trace \"Hello, \", trace \" world!\" ]\n-- | ```\nsequence_ :: forall a f m. Applicative m => Foldable f => f (m a) -> m Unit\nsequence_ = traverse_ identity\n\n-- | Combines a collection of elements using the `Alt` operation.\noneOf :: forall f g a. Foldable f => Plus g => f (g a) -> g a\noneOf = foldr alt empty\n\n-- | Folds a structure into some `Plus`.\noneOfMap :: forall f g a b. Foldable f => Plus g => (a -> g b) -> f a -> g b\noneOfMap f = foldr (alt <<< f) empty\n\n-- | Fold a data structure, accumulating values in some `Monoid`,\n-- | combining adjacent elements using the specified separator.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | > intercalate \", \" [\"Lorem\", \"ipsum\", \"dolor\"]\n-- | = \"Lorem, ipsum, dolor\"\n-- |\n-- | > intercalate \"*\" [\"a\", \"b\", \"c\"]\n-- | = \"a*b*c\"\n-- |\n-- | > intercalate [1] [[2, 3], [4, 5], [6, 7]]\n-- | = [2, 3, 1, 4, 5, 1, 6, 7]\n-- | ```\nintercalate :: forall f m. Foldable f => Monoid m => m -> f m -> m\nintercalate sep xs = (foldl go { init: true, acc: mempty } xs).acc\n  where\n  go { init: true } x = { init: false, acc: x }\n  go { acc: acc }   x = { init: false, acc: acc <> sep <> x }\n\n-- | `foldMap` but with each element surrounded by some fixed value.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | > surroundMap \"*\" show []\n-- | = \"*\"\n-- |\n-- | > surroundMap \"*\" show [1]\n-- | = \"*1*\"\n-- |\n-- | > surroundMap \"*\" show [1, 2]\n-- | = \"*1*2*\"\n-- |\n-- | > surroundMap \"*\" show [1, 2, 3]\n-- | = \"*1*2*3*\"\n-- | ```\nsurroundMap :: forall f a m. Foldable f => Semigroup m => m -> (a -> m) -> f a -> m\nsurroundMap d t f = unwrap (foldMap joined f) d\n  where joined a = Endo \\m -> d <> t a <> m\n\n-- | `fold` but with each element surrounded by some fixed value.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | > surround \"*\" []\n-- | = \"*\"\n-- |\n-- | > surround \"*\" [\"1\"]\n-- | = \"*1*\"\n-- |\n-- | > surround \"*\" [\"1\", \"2\"]\n-- | = \"*1*2*\"\n-- |\n-- | > surround \"*\" [\"1\", \"2\", \"3\"]\n-- | = \"*1*2*3*\"\n-- | ```\nsurround :: forall f m. Foldable f => Semigroup m => m -> f m -> m\nsurround d = surroundMap d identity\n\n-- | The conjunction of all the values in a data structure. When specialized\n-- | to `Boolean`, this function will test whether all of the values in a data\n-- | structure are `true`.\nand :: forall a f. Foldable f => HeytingAlgebra a => f a -> a\nand = all identity\n\n-- | The disjunction of all the values in a data structure. When specialized\n-- | to `Boolean`, this function will test whether any of the values in a data\n-- | structure is `true`.\nor :: forall a f. Foldable f => HeytingAlgebra a => f a -> a\nor = any identity\n\n-- | `all f` is the same as `and <<< map f`; map a function over the structure,\n-- | and then get the conjunction of the results.\nall :: forall a b f. Foldable f => HeytingAlgebra b => (a -> b) -> f a -> b\nall  = alaF Conj foldMap\n\n-- | `any f` is the same as `or <<< map f`; map a function over the structure,\n-- | and then get the disjunction of the results.\nany :: forall a b f. Foldable f => HeytingAlgebra b => (a -> b) -> f a -> b\nany = alaF Disj foldMap\n\n-- | Find the sum of the numeric values in a data structure.\nsum :: forall a f. Foldable f => Semiring a => f a -> a\nsum = foldl (+) zero\n\n-- | Find the product of the numeric values in a data structure.\nproduct :: forall a f. Foldable f => Semiring a => f a -> a\nproduct = foldl (*) one\n\n-- | Test whether a value is an element of a data structure.\nelem :: forall a f. Foldable f => Eq a => a -> f a -> Boolean\nelem = any <<< (==)\n\n-- | Test whether a value is not an element of a data structure.\nnotElem :: forall a f. Foldable f => Eq a => a -> f a -> Boolean\nnotElem x = not <<< elem x\n\n-- | Try to get nth element from the left in a data structure\nindexl :: forall a f. Foldable f => Int -> f a -> Maybe a\nindexl idx = _.elem <<< foldl go { elem: Nothing, pos: 0 }\n  where\n  go cursor a =\n    case cursor.elem of\n      Just _ -> cursor\n      _ ->\n        if cursor.pos == idx\n          then { elem: Just a, pos: cursor.pos }\n          else { pos: cursor.pos + 1, elem: cursor.elem }\n\n-- | Try to get nth element from the right in a data structure\nindexr :: forall a f. Foldable f => Int -> f a -> Maybe a\nindexr idx = _.elem <<< foldr go { elem: Nothing, pos: 0 }\n  where\n  go a cursor =\n    case cursor.elem of\n      Just _ -> cursor\n      _ ->\n        if cursor.pos == idx\n          then { elem: Just a, pos: cursor.pos }\n          else { pos: cursor.pos + 1, elem: cursor.elem }\n\n-- | Try to find an element in a data structure which satisfies a predicate.\nfind :: forall a f. Foldable f => (a -> Boolean) -> f a -> Maybe a\nfind p = foldl go Nothing\n  where\n  go Nothing x | p x = Just x\n  go r _ = r\n\n-- | Try to find an element in a data structure which satisfies a predicate mapping.\nfindMap :: forall a b f. Foldable f => (a -> Maybe b) -> f a -> Maybe b\nfindMap p = foldl go Nothing\n  where\n  go Nothing x = p x\n  go r _ = r\n\n-- | Find the largest element of a structure, according to its `Ord` instance.\nmaximum :: forall a f. Ord a => Foldable f => f a -> Maybe a\nmaximum = maximumBy compare\n\n-- | Find the largest element of a structure, according to a given comparison\n-- | function. The comparison function should represent a total ordering (see\n-- | the `Ord` type class laws); if it does not, the behaviour is undefined.\nmaximumBy :: forall a f. Foldable f => (a -> a -> Ordering) -> f a -> Maybe a\nmaximumBy cmp = foldl max' Nothing\n  where\n  max' Nothing x  = Just x\n  max' (Just x) y = Just (if cmp x y == GT then x else y)\n\n-- | Find the smallest element of a structure, according to its `Ord` instance.\nminimum :: forall a f. Ord a => Foldable f => f a -> Maybe a\nminimum = minimumBy compare\n\n-- | Find the smallest element of a structure, according to a given comparison\n-- | function. The comparison function should represent a total ordering (see\n-- | the `Ord` type class laws); if it does not, the behaviour is undefined.\nminimumBy :: forall a f. Foldable f => (a -> a -> Ordering) -> f a -> Maybe a\nminimumBy cmp = foldl min' Nothing\n  where\n  min' Nothing x  = Just x\n  min' (Just x) y = Just (if cmp x y == LT then x else y)\n\n-- | Test whether the structure is empty.\n-- | Optimized for structures that are similar to cons-lists, because there\n-- | is no general way to do better.\nnull :: forall a f. Foldable f => f a -> Boolean\nnull = foldr (\\_ _ -> false) true\n\n-- | Returns the size/length of a finite structure.\n-- | Optimized for structures that are similar to cons-lists, because there\n-- | is no general way to do better.\nlength :: forall a b f. Foldable f => Semiring b => f a -> b\nlength = foldl (\\c _ -> add one c) zero\n\n-- | Lookup a value in a data structure of `Tuple`s, generalizing association lists.\nlookup :: forall a b f. Foldable f => Eq a => a -> f (Tuple a b) -> Maybe b\nlookup a = unwrap <<< foldMap \\(Tuple a' b) -> First (if a == a' then Just b else Nothing)\n", "// module Data.Function.Uncurried\n\nexport const mkFn0 = function (fn) {\n  return function () {\n    return fn();\n  };\n};\n\nexport const mkFn2 = function (fn) {\n  /* jshint maxparams: 2 */\n  return function (a, b) {\n    return fn(a)(b);\n  };\n};\n\nexport const mkFn3 = function (fn) {\n  /* jshint maxparams: 3 */\n  return function (a, b, c) {\n    return fn(a)(b)(c);\n  };\n};\n\nexport const mkFn4 = function (fn) {\n  /* jshint maxparams: 4 */\n  return function (a, b, c, d) {\n    return fn(a)(b)(c)(d);\n  };\n};\n\nexport const mkFn5 = function (fn) {\n  /* jshint maxparams: 5 */\n  return function (a, b, c, d, e) {\n    return fn(a)(b)(c)(d)(e);\n  };\n};\n\nexport const mkFn6 = function (fn) {\n  /* jshint maxparams: 6 */\n  return function (a, b, c, d, e, f) {\n    return fn(a)(b)(c)(d)(e)(f);\n  };\n};\n\nexport const mkFn7 = function (fn) {\n  /* jshint maxparams: 7 */\n  return function (a, b, c, d, e, f, g) {\n    return fn(a)(b)(c)(d)(e)(f)(g);\n  };\n};\n\nexport const mkFn8 = function (fn) {\n  /* jshint maxparams: 8 */\n  return function (a, b, c, d, e, f, g, h) {\n    return fn(a)(b)(c)(d)(e)(f)(g)(h);\n  };\n};\n\nexport const mkFn9 = function (fn) {\n  /* jshint maxparams: 9 */\n  return function (a, b, c, d, e, f, g, h, i) {\n    return fn(a)(b)(c)(d)(e)(f)(g)(h)(i);\n  };\n};\n\nexport const mkFn10 = function (fn) {\n  /* jshint maxparams: 10 */\n  return function (a, b, c, d, e, f, g, h, i, j) {\n    return fn(a)(b)(c)(d)(e)(f)(g)(h)(i)(j);\n  };\n};\n\nexport const runFn0 = function (fn) {\n  return fn();\n};\n\nexport const runFn2 = function (fn) {\n  return function (a) {\n    return function (b) {\n      return fn(a, b);\n    };\n  };\n};\n\nexport const runFn3 = function (fn) {\n  return function (a) {\n    return function (b) {\n      return function (c) {\n        return fn(a, b, c);\n      };\n    };\n  };\n};\n\nexport const runFn4 = function (fn) {\n  return function (a) {\n    return function (b) {\n      return function (c) {\n        return function (d) {\n          return fn(a, b, c, d);\n        };\n      };\n    };\n  };\n};\n\nexport const runFn5 = function (fn) {\n  return function (a) {\n    return function (b) {\n      return function (c) {\n        return function (d) {\n          return function (e) {\n            return fn(a, b, c, d, e);\n          };\n        };\n      };\n    };\n  };\n};\n\nexport const runFn6 = function (fn) {\n  return function (a) {\n    return function (b) {\n      return function (c) {\n        return function (d) {\n          return function (e) {\n            return function (f) {\n              return fn(a, b, c, d, e, f);\n            };\n          };\n        };\n      };\n    };\n  };\n};\n\nexport const runFn7 = function (fn) {\n  return function (a) {\n    return function (b) {\n      return function (c) {\n        return function (d) {\n          return function (e) {\n            return function (f) {\n              return function (g) {\n                return fn(a, b, c, d, e, f, g);\n              };\n            };\n          };\n        };\n      };\n    };\n  };\n};\n\nexport const runFn8 = function (fn) {\n  return function (a) {\n    return function (b) {\n      return function (c) {\n        return function (d) {\n          return function (e) {\n            return function (f) {\n              return function (g) {\n                return function (h) {\n                  return fn(a, b, c, d, e, f, g, h);\n                };\n              };\n            };\n          };\n        };\n      };\n    };\n  };\n};\n\nexport const runFn9 = function (fn) {\n  return function (a) {\n    return function (b) {\n      return function (c) {\n        return function (d) {\n          return function (e) {\n            return function (f) {\n              return function (g) {\n                return function (h) {\n                  return function (i) {\n                    return fn(a, b, c, d, e, f, g, h, i);\n                  };\n                };\n              };\n            };\n          };\n        };\n      };\n    };\n  };\n};\n\nexport const runFn10 = function (fn) {\n  return function (a) {\n    return function (b) {\n      return function (c) {\n        return function (d) {\n          return function (e) {\n            return function (f) {\n              return function (g) {\n                return function (h) {\n                  return function (i) {\n                    return function (j) {\n                      return fn(a, b, c, d, e, f, g, h, i, j);\n                    };\n                  };\n                };\n              };\n            };\n          };\n        };\n      };\n    };\n  };\n};\n", "// jshint maxparams: 3\n\nexport const traverseArrayImpl = (function () {\n  function array1(a) {\n    return [a];\n  }\n\n  function array2(a) {\n    return function (b) {\n      return [a, b];\n    };\n  }\n\n  function array3(a) {\n    return function (b) {\n      return function (c) {\n        return [a, b, c];\n      };\n    };\n  }\n\n  function concat2(xs) {\n    return function (ys) {\n      return xs.concat(ys);\n    };\n  }\n\n  return function (apply) {\n    return function (map) {\n      return function (pure) {\n        return function (f) {\n          return function (array) {\n            function go(bot, top) {\n              switch (top - bot) {\n              case 0: return pure([]);\n              case 1: return map(array1)(f(array[bot]));\n              case 2: return apply(map(array2)(f(array[bot])))(f(array[bot + 1]));\n              case 3: return apply(apply(map(array3)(f(array[bot])))(f(array[bot + 1])))(f(array[bot + 2]));\n              default:\n                // This slightly tricky pivot selection aims to produce two\n                // even-length partitions where possible.\n                var pivot = bot + Math.floor((top - bot) / 4) * 2;\n                return apply(map(concat2)(go(bot, pivot)))(go(pivot, top));\n              }\n            }\n            return go(0, array.length);\n          };\n        };\n      };\n    };\n  };\n})();\n", "module Data.Traversable\n  ( class Traversable, traverse, sequence\n  , traverseDefault, sequenceDefault\n  , for\n  , scanl\n  , scanr\n  , mapAccumL\n  , mapAccumR\n  , module Data.Foldable\n  , module Data.Traversable.Accum\n  ) where\n\nimport Prelude\n\nimport Control.Apply (lift2)\nimport Data.Const (Const(..))\nimport Data.Either (Either(..))\nimport Data.Foldable (class Foldable, all, and, any, elem, find, fold, foldMap, foldMapDefaultL, foldMapDefaultR, foldl, foldlDefault, foldr, foldrDefault, for_, intercalate, maximum, maximumBy, minimum, minimumBy, notElem, oneOf, or, sequence_, sum, traverse_)\nimport Data.Functor.App (App(..))\nimport Data.Functor.Compose (Compose(..))\nimport Data.Functor.Coproduct (Coproduct(..), coproduct)\nimport Data.Functor.Product (Product(..), product)\nimport Data.Identity (Identity(..))\nimport Data.Maybe (Maybe(..))\nimport Data.Maybe.First (First(..))\nimport Data.Maybe.Last (Last(..))\nimport Data.Monoid.Additive (Additive(..))\nimport Data.Monoid.Conj (Conj(..))\nimport Data.Monoid.Disj (Disj(..))\nimport Data.Monoid.Dual (Dual(..))\nimport Data.Monoid.Multiplicative (Multiplicative(..))\nimport Data.Traversable.Accum (Accum)\nimport Data.Traversable.Accum.Internal (StateL(..), StateR(..), stateL, stateR)\nimport Data.Tuple (Tuple(..))\n\n-- | `Traversable` represents data structures which can be _traversed_,\n-- | accumulating results and effects in some `Applicative` functor.\n-- |\n-- | - `traverse` runs an action for every element in a data structure,\n-- |   and accumulates the results.\n-- | - `sequence` runs the actions _contained_ in a data structure,\n-- |   and accumulates the results.\n-- |\n-- | ```purescript\n-- | import Data.Traversable\n-- | import Data.Maybe\n-- | import Data.Int (fromNumber)\n-- |\n-- | sequence [Just 1, Just 2, Just 3] == Just [1,2,3]\n-- | sequence [Nothing, Just 2, Just 3] == Nothing\n-- |\n-- | traverse fromNumber [1.0, 2.0, 3.0] == Just [1,2,3]\n-- | traverse fromNumber [1.5, 2.0, 3.0] == Nothing\n-- |\n-- | traverse logShow [1,2,3]\n-- | -- prints:\n-- |    1\n-- |    2\n-- |    3\n-- |\n-- | traverse (\\x -> [x, 0]) [1,2,3] == [[1,2,3],[1,2,0],[1,0,3],[1,0,0],[0,2,3],[0,2,0],[0,0,3],[0,0,0]]\n-- | ```\n-- |\n-- | The `traverse` and `sequence` functions should be compatible in the\n-- | following sense:\n-- |\n-- | - `traverse f xs = sequence (f <$> xs)`\n-- | - `sequence = traverse identity`\n-- |\n-- | `Traversable` instances should also be compatible with the corresponding\n-- | `Foldable` instances, in the following sense:\n-- |\n-- | - `foldMap f = runConst <<< traverse (Const <<< f)`\n-- |\n-- | Default implementations are provided by the following functions:\n-- |\n-- | - `traverseDefault`\n-- | - `sequenceDefault`\nclass (Functor t, Foldable t) <= Traversable t where\n  traverse :: forall a b m. Applicative m => (a -> m b) -> t a -> m (t b)\n  sequence :: forall a m. Applicative m => t (m a) -> m (t a)\n\n-- | A default implementation of `traverse` using `sequence` and `map`.\ntraverseDefault\n  :: forall t a b m\n   . Traversable t\n  => Applicative m\n  => (a -> m b)\n  -> t a\n  -> m (t b)\ntraverseDefault f ta = sequence (f <$> ta)\n\n-- | A default implementation of `sequence` using `traverse`.\nsequenceDefault\n  :: forall t a m\n   . Traversable t\n  => Applicative m\n  => t (m a)\n  -> m (t a)\nsequenceDefault = traverse identity\n\ninstance traversableArray :: Traversable Array where\n  traverse = traverseArrayImpl apply map pure\n  sequence = sequenceDefault\n\nforeign import traverseArrayImpl\n  :: forall m a b\n   . (forall x y. m (x -> y) -> m x -> m y)\n  -> (forall x y. (x -> y) -> m x -> m y)\n  -> (forall x. x -> m x)\n  -> (a -> m b)\n  -> Array a\n  -> m (Array b)\n\ninstance traversableMaybe :: Traversable Maybe where\n  traverse _ Nothing  = pure Nothing\n  traverse f (Just x) = Just <$> f x\n  sequence Nothing  = pure Nothing\n  sequence (Just x) = Just <$> x\n\ninstance traversableFirst :: Traversable First where\n  traverse f (First x) = First <$> traverse f x\n  sequence (First x) = First <$> sequence x\n\ninstance traversableLast :: Traversable Last where\n  traverse f (Last x) = Last <$> traverse f x\n  sequence (Last x) = Last <$> sequence x\n\ninstance traversableAdditive :: Traversable Additive where\n  traverse f (Additive x) = Additive <$> f x\n  sequence (Additive x) = Additive <$> x\n\ninstance traversableDual :: Traversable Dual where\n  traverse f (Dual x) = Dual <$> f x\n  sequence (Dual x) = Dual <$> x\n\ninstance traversableConj :: Traversable Conj where\n  traverse f (Conj x) = Conj <$> f x\n  sequence (Conj x) = Conj <$> x\n\ninstance traversableDisj :: Traversable Disj where\n  traverse f (Disj x) = Disj <$> f x\n  sequence (Disj x) = Disj <$> x\n\ninstance traversableMultiplicative :: Traversable Multiplicative where\n  traverse f (Multiplicative x) = Multiplicative <$> f x\n  sequence (Multiplicative x) = Multiplicative <$> x\n\ninstance traversableEither :: Traversable (Either a) where\n  traverse _ (Left x)  = pure (Left x)\n  traverse f (Right x) = Right <$> f x\n  sequence (Left x) = pure (Left x)\n  sequence (Right x)  = Right <$> x\n\ninstance traversableTuple :: Traversable (Tuple a) where\n  traverse f (Tuple x y) = Tuple x <$> f y\n  sequence (Tuple x y) = Tuple x <$> y\n\ninstance traversableIdentity :: Traversable Identity where\n  traverse f (Identity x) = Identity <$> f x\n  sequence (Identity x) = Identity <$> x\n\ninstance traversableConst :: Traversable (Const a) where\n  traverse _ (Const x) = pure (Const x)\n  sequence (Const x) = pure (Const x)\n\ninstance traversableProduct :: (Traversable f, Traversable g) => Traversable (Product f g) where\n  traverse f (Product (Tuple fa ga)) = lift2 product (traverse f fa) (traverse f ga)\n  sequence (Product (Tuple fa ga)) = lift2 product (sequence fa) (sequence ga)\n\ninstance traversableCoproduct :: (Traversable f, Traversable g) => Traversable (Coproduct f g) where\n  traverse f = coproduct\n    (map (Coproduct <<< Left) <<< traverse f)\n    (map (Coproduct <<< Right) <<< traverse f)\n  sequence = coproduct\n    (map (Coproduct <<< Left) <<< sequence)\n    (map (Coproduct <<< Right) <<< sequence)\n\ninstance traversableCompose :: (Traversable f, Traversable g) => Traversable (Compose f g) where\n  traverse f (Compose fga) = map Compose $ traverse (traverse f) fga\n  sequence = traverse identity\n\ninstance traversableApp :: Traversable f => Traversable (App f) where\n  traverse f (App x) = App <$> traverse f x\n  sequence (App x) = App <$> sequence x\n\n-- | A version of `traverse` with its arguments flipped.\n-- |\n-- |\n-- | This can be useful when running an action written using do notation\n-- | for every element in a data structure:\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | for [1, 2, 3] \\n -> do\n-- |   print n\n-- |   return (n * n)\n-- | ```\nfor\n  :: forall a b m t\n   . Applicative m\n  => Traversable t\n  => t a\n  -> (a -> m b)\n  -> m (t b)\nfor x f = traverse f x\n\n-- | Fold a data structure from the left, keeping all intermediate results\n-- | instead of only the final result. Note that the initial value does not\n-- | appear in the result (unlike Haskell's `Prelude.scanl`).\n-- |\n-- | ```purescript\n-- | scanl (+) 0  [1,2,3] = [1,3,6]\n-- | scanl (-) 10 [1,2,3] = [9,7,4]\n-- | ```\nscanl :: forall a b f. Traversable f => (b -> a -> b) -> b -> f a -> f b\nscanl f b0 xs = (mapAccumL (\\b a -> let b' = f b a in { accum: b', value: b' }) b0 xs).value\n\n-- | Fold a data structure from the left, keeping all intermediate results\n-- | instead of only the final result.\n-- |\n-- | Unlike `scanl`, `mapAccumL` allows the type of accumulator to differ\n-- | from the element type of the final data structure.\nmapAccumL\n  :: forall a b s f\n   . Traversable f\n  => (s -> a -> Accum s b)\n  -> s\n  -> f a\n  -> Accum s (f b)\nmapAccumL f s0 xs = stateL (traverse (\\a -> StateL \\s -> f s a) xs) s0\n\n-- | Fold a data structure from the right, keeping all intermediate results\n-- | instead of only the final result. Note that the initial value does not\n-- | appear in the result (unlike Haskell's `Prelude.scanr`).\n-- |\n-- | ```purescript\n-- | scanr (+) 0 [1,2,3] = [6,5,3]\n-- | scanr (flip (-)) 10 [1,2,3] = [4,5,7]\n-- | ```\nscanr :: forall a b f. Traversable f => (a -> b -> b) -> b -> f a -> f b\nscanr f b0 xs = (mapAccumR (\\b a -> let b' = f a b in { accum: b', value: b' }) b0 xs).value\n\n-- | Fold a data structure from the right, keeping all intermediate results\n-- | instead of only the final result.\n-- |\n-- | Unlike `scanr`, `mapAccumR` allows the type of accumulator to differ\n-- | from the element type of the final data structure.\nmapAccumR\n  :: forall a b s f\n   . Traversable f\n  => (s -> a -> Accum s b)\n  -> s\n  -> f a\n  -> Accum s (f b)\nmapAccumR f s0 xs = stateR (traverse (\\a -> StateR \\s -> f s a) xs) s0\n", "export const unfoldrArrayImpl = function (isNothing) {\n  return function (fromJust) {\n    return function (fst) {\n      return function (snd) {\n        return function (f) {\n          return function (b) {\n            var result = [];\n            var value = b;\n            while (true) { // eslint-disable-line no-constant-condition\n              var maybe = f(value);\n              if (isNothing(maybe)) return result;\n              var tuple = fromJust(maybe);\n              result.push(fst(tuple));\n              value = snd(tuple);\n            }\n          };\n        };\n      };\n    };\n  };\n};\n", "export const unfoldr1ArrayImpl = function (isNothing) {\n  return function (fromJust) {\n    return function (fst) {\n      return function (snd) {\n        return function (f) {\n          return function (b) {\n            var result = [];\n            var value = b;\n            while (true) { // eslint-disable-line no-constant-condition\n              var tuple = f(value);\n              result.push(fst(tuple));\n              var maybe = snd(tuple);\n              if (isNothing(maybe)) return result;\n              value = fromJust(maybe);\n            }\n          };\n        };\n      };\n    };\n  };\n};\n", "module Data.Unfoldable1\n  ( class Unfoldable1, unfoldr1\n  , replicate1\n  , replicate1A\n  , singleton\n  , range\n  , iterateN\n  ) where\n\nimport Prelude\n\nimport Data.Maybe (Maybe(..), fromJust, isNothing)\nimport Data.Semigroup.Traversable (class Traversable1, sequence1)\nimport Data.Tuple (Tuple(..), fst, snd)\nimport Partial.Unsafe (unsafePartial)\n\n-- | This class identifies data structures which can be _unfolded_.\n-- |\n-- | The generating function `f` in `unfoldr1 f` corresponds to the `uncons`\n-- | operation of a non-empty list or array; it always returns a value, and\n-- | then optionally a value to continue unfolding from.\n-- |\n-- | Note that, in order to provide an `Unfoldable1 t` instance, `t` need not\n-- | be a type which is guaranteed to be non-empty. For example, the fact that\n-- | lists can be empty does not prevent us from providing an\n-- | `Unfoldable1 List` instance. However, the result of `unfoldr1` should\n-- | always be non-empty.\n-- |\n-- | Every type which has an `Unfoldable` instance can be given an\n-- | `Unfoldable1` instance (and, in fact, is required to, because\n-- | `Unfoldable1` is a superclass of `Unfoldable`). However, there are types\n-- | which have `Unfoldable1` instances but cannot have `Unfoldable` instances.\n-- | In particular, types which are guaranteed to be non-empty, such as\n-- | `NonEmptyList`, cannot be given `Unfoldable` instances.\n-- |\n-- | The utility of this class, then, is that it provides an `Unfoldable`-like\n-- | interface while still permitting instances for guaranteed-non-empty types\n-- | like `NonEmptyList`.\nclass Unfoldable1 t where\n  unfoldr1 :: forall a b. (b -> Tuple a (Maybe b)) -> b -> t a\n\ninstance unfoldable1Array :: Unfoldable1 Array where\n  unfoldr1 = unfoldr1ArrayImpl isNothing (unsafePartial fromJust) fst snd\n\ninstance unfoldable1Maybe :: Unfoldable1 Maybe where\n  unfoldr1 f b = Just (fst (f b))\n\nforeign import unfoldr1ArrayImpl\n  :: forall a b\n   . (forall x. Maybe x -> Boolean)\n  -> (forall x. Maybe x -> x)\n  -> (forall x y. Tuple x y -> x)\n  -> (forall x y. Tuple x y -> y)\n  -> (b -> Tuple a (Maybe b))\n  -> b\n  -> Array a\n\n-- | Replicate a value `n` times. At least one value will be produced, so values\n-- | `n` less than 1 will be treated as 1.\n-- |\n-- | ``` purescript\n-- | replicate1 2 \"foo\" == (NEL.cons \"foo\" (NEL.singleton \"foo\") :: NEL.NonEmptyList String)\n-- | replicate1 0 \"foo\" == (NEL.singleton \"foo\" :: NEL.NonEmptyList String)\n-- | ```\nreplicate1 :: forall f a. Unfoldable1 f => Int -> a -> f a\nreplicate1 n v = unfoldr1 step (n - 1)\n  where\n    step :: Int -> Tuple a (Maybe Int)\n    step i\n      | i <= 0 = Tuple v Nothing\n      | otherwise = Tuple v (Just (i - 1))\n\n-- | Perform an `Apply` action `n` times (at least once, so values `n` less\n-- | than 1 will be treated as 1), and accumulate the results.\n-- |\n-- | ``` purescript\n-- | > replicate1A 2 (randomInt 1 10) :: Effect (NEL.NonEmptyList Int)\n-- | (NonEmptyList (NonEmpty 8 (2 : Nil)))\n-- | > replicate1A 0 (randomInt 1 10) :: Effect (NEL.NonEmptyList Int)\n-- | (NonEmptyList (NonEmpty 4 Nil))\n-- | ```\nreplicate1A\n  :: forall m f a\n   . Apply m\n  => Unfoldable1 f\n  => Traversable1 f\n  => Int\n  -> m a\n  -> m (f a)\nreplicate1A n m = sequence1 (replicate1 n m)\n\n-- | Contain a single value. For example:\n-- |\n-- | ``` purescript\n-- | singleton \"foo\" == (NEL.singleton \"foo\" :: NEL.NonEmptyList String)\n-- | ```\nsingleton :: forall f a. Unfoldable1 f => a -> f a\nsingleton = replicate1 1\n\n-- | Create an `Unfoldable1` containing a range of values, including both\n-- | endpoints.\n-- |\n-- | ``` purescript\n-- | range 0 0 == (NEL.singleton 0 :: NEL.NonEmptyList Int)\n-- | range 1 2 == (NEL.cons 1 (NEL.singleton 2) :: NEL.NonEmptyList Int)\n-- | range 2 0 == (NEL.cons 2 (NEL.cons 1 (NEL.singleton 0)) :: NEL.NonEmptyList Int)\n-- | ```\nrange :: forall f. Unfoldable1 f => Int -> Int -> f Int\nrange start end =\n  let delta = if end >= start then 1 else -1 in unfoldr1 (go delta) start\n  where\n    go delta i =\n      let i' = i + delta\n      in Tuple i (if i == end then Nothing else Just i')\n\n-- | Create an `Unfoldable1` by repeated application of a function to a seed value.\n-- | For example:\n-- |\n-- | ``` purescript\n-- | (iterateN 5 (_ + 1) 0 :: Array Int) == [0, 1, 2, 3, 4]\n-- | (iterateN 5 (_ + 1) 0 :: NonEmptyArray Int) == NonEmptyArray [0, 1, 2, 3, 4]\n-- |\n-- | (iterateN 0 (_ + 1) 0 :: Array Int) == [0]\n-- | (iterateN 0 (_ + 1) 0 :: NonEmptyArray Int) == NonEmptyArray [0]\n-- | ```\niterateN :: forall f a. Unfoldable1 f => Int -> (a -> a) -> a -> f a\niterateN n f s = unfoldr1 go $ Tuple s (n - 1)\n  where\n  go (Tuple x n') = Tuple x\n    if n' > 0 then Just $ Tuple (f x) $ n' - 1\n    else Nothing\n", "-- | This module provides a type class for _unfoldable functors_, i.e.\n-- | functors which support an `unfoldr` operation.\n-- |\n-- | This allows us to unify various operations on arrays, lists,\n-- | sequences, etc.\n\nmodule Data.Unfoldable\n  ( class Unfoldable, unfoldr\n  , replicate\n  , replicateA\n  , none\n  , fromMaybe\n  , module Data.Unfoldable1\n  ) where\n\nimport Prelude\n\nimport Data.Maybe (Maybe(..), isNothing, fromJust)\nimport Data.Traversable (class Traversable, sequence)\nimport Data.Tuple (Tuple(..), fst, snd)\nimport Data.Unfoldable1 (class Unfoldable1, unfoldr1, singleton, range, iterateN, replicate1, replicate1A)\nimport Partial.Unsafe (unsafePartial)\n\n-- | This class identifies (possibly empty) data structures which can be\n-- | _unfolded_.\n-- |\n-- | The generating function `f` in `unfoldr f` is understood as follows:\n-- |\n-- | - If `f b` is `Nothing`, then `unfoldr f b` should be empty.\n-- | - If `f b` is `Just (Tuple a b1)`, then `unfoldr f b` should consist of `a`\n-- |   appended to the result of `unfoldr f b1`.\n-- |\n-- | Note that it is not possible to give `Unfoldable` instances to types which\n-- | represent structures which are guaranteed to be non-empty, such as\n-- | `NonEmptyArray`: consider what `unfoldr (const Nothing)` should produce.\n-- | Structures which are guaranteed to be non-empty can instead be given\n-- | `Unfoldable1` instances.\nclass Unfoldable1 t <= Unfoldable t where\n  unfoldr :: forall a b. (b -> Maybe (Tuple a b)) -> b -> t a\n\ninstance unfoldableArray :: Unfoldable Array where\n  unfoldr = unfoldrArrayImpl isNothing (unsafePartial fromJust) fst snd\n\ninstance unfoldableMaybe :: Unfoldable Maybe where\n  unfoldr f b = fst <$> f b\n\nforeign import unfoldrArrayImpl\n  :: forall a b\n   . (forall x. Maybe x -> Boolean)\n  -> (forall x. Maybe x -> x)\n  -> (forall x y. Tuple x y -> x)\n  -> (forall x y. Tuple x y -> y)\n  -> (b -> Maybe (Tuple a b))\n  -> b\n  -> Array a\n\n-- | Replicate a value some natural number of times.\n-- | For example:\n-- |\n-- | ``` purescript\n-- | replicate 2 \"foo\" == ([\"foo\", \"foo\"] :: Array String)\n-- | ```\nreplicate :: forall f a. Unfoldable f => Int -> a -> f a\nreplicate n v = unfoldr step n\n  where\n    step :: Int -> Maybe (Tuple a Int)\n    step i =\n      if i <= 0 then Nothing\n      else Just (Tuple v (i - 1))\n\n-- | Perform an Applicative action `n` times, and accumulate all the results.\n-- |\n-- | ``` purescript\n-- | > replicateA 5 (randomInt 1 10) :: Effect (Array Int)\n-- | [1,3,2,7,5]\n-- | ```\nreplicateA\n  :: forall m f a\n   . Applicative m\n  => Unfoldable f\n  => Traversable f\n  => Int\n  -> m a\n  -> m (f a)\nreplicateA n m = sequence (replicate n m)\n\n-- | The container with no elements - unfolded with zero iterations.\n-- | For example:\n-- |\n-- | ``` purescript\n-- | none == ([] :: Array Unit)\n-- | ```\nnone :: forall f a. Unfoldable f => f a\nnone = unfoldr (const Nothing) unit\n\n-- | Convert a Maybe to any Unfoldable, such as lists or arrays.\n-- |\n-- | ``` purescript\n-- | fromMaybe (Nothing :: Maybe Int) == []\n-- | fromMaybe (Just 1) == [1]\n-- | ```\nfromMaybe :: forall f a. Unfoldable f => Maybe a -> f a\nfromMaybe = unfoldr (\\b -> flip Tuple Nothing <$> b)\n", "-- | Helper functions for working with immutable Javascript arrays.\n-- |\n-- | _Note_: Depending on your use-case, you may prefer to use `Data.List` or\n-- | `Data.Sequence` instead, which might give better performance for certain\n-- | use cases. This module is useful when integrating with JavaScript libraries\n-- | which use arrays, but immutable arrays are not a practical data structure\n-- | for many use cases due to their poor asymptotics.\n-- |\n-- | In addition to the functions in this module, Arrays have a number of\n-- | useful instances:\n-- |\n-- | * `Functor`, which provides `map :: forall a b. (a -> b) -> Array a ->\n-- |   Array b`\n-- | * `Apply`, which provides `(<*>) :: forall a b. Array (a -> b) -> Array a\n-- |   -> Array b`. This function works a bit like a Cartesian product; the\n-- |   result array is constructed by applying each function in the first\n-- |   array to each value in the second, so that the result array ends up with\n-- |   a length equal to the product of the two arguments' lengths.\n-- | * `Bind`, which provides `(>>=) :: forall a b. (a -> Array b) -> Array a\n-- |   -> Array b` (this is the same as `concatMap`).\n-- | * `Semigroup`, which provides `(<>) :: forall a. Array a -> Array a ->\n-- |   Array a`, for concatenating arrays.\n-- | * `Foldable`, which provides a slew of functions for *folding* (also known\n-- |   as *reducing*) arrays down to one value. For example,\n-- |   `Data.Foldable.or` tests whether an array of `Boolean` values contains\n-- |   at least one `true` value.\n-- | * `Traversable`, which provides the PureScript version of a for-loop,\n-- |   allowing you to STAI.iterate over an array and accumulate effects.\n-- |\nmodule Data.Array\n  ( fromFoldable\n  , toUnfoldable\n  , singleton\n  , (..)\n  , range\n  , replicate\n  , some\n  , many\n\n  , null\n  , length\n\n  , (:)\n  , cons\n  , snoc\n  , insert\n  , insertBy\n\n  , head\n  , last\n  , tail\n  , init\n  , uncons\n  , unsnoc\n\n  , (!!)\n  , index\n  , elem\n  , notElem\n  , elemIndex\n  , elemLastIndex\n  , find\n  , findMap\n  , findIndex\n  , findLastIndex\n  , insertAt\n  , deleteAt\n  , updateAt\n  , updateAtIndices\n  , modifyAt\n  , modifyAtIndices\n  , alterAt\n\n  , intersperse\n  , reverse\n  , concat\n  , concatMap\n  , filter\n  , partition\n  , splitAt\n  , filterA\n  , mapMaybe\n  , catMaybes\n  , mapWithIndex\n  , foldl\n  , foldr\n  , foldMap\n  , fold\n  , intercalate\n  , transpose\n  , scanl\n  , scanr\n\n  , sort\n  , sortBy\n  , sortWith\n  , slice\n  , take\n  , takeEnd\n  , takeWhile\n  , drop\n  , dropEnd\n  , dropWhile\n  , span\n  , group\n  , groupAll\n  , groupBy\n  , groupAllBy\n\n  , nub\n  , nubEq\n  , nubBy\n  , nubByEq\n  , union\n  , unionBy\n  , delete\n  , deleteBy\n\n  , (\\\\)\n  , difference\n  , intersect\n  , intersectBy\n\n  , zipWith\n  , zipWithA\n  , zip\n  , unzip\n\n  , any\n  , all\n\n  , foldM\n  , foldRecM\n\n  , unsafeIndex\n  ) where\n\nimport Prelude\n\nimport Control.Alt ((<|>))\nimport Control.Alternative (class Alternative)\nimport Control.Lazy (class Lazy, defer)\nimport Control.Monad.Rec.Class (class MonadRec, Step(..), tailRecM2)\nimport Control.Monad.ST as ST\nimport Data.Array.NonEmpty.Internal (NonEmptyArray(..))\nimport Data.Array.ST as STA\nimport Data.Array.ST.Iterator as STAI\nimport Data.Foldable (class Foldable, traverse_)\nimport Data.Foldable as F\nimport Data.Function.Uncurried (Fn2, Fn3, Fn4, Fn5, runFn2, runFn3, runFn4, runFn5)\nimport Data.FunctorWithIndex as FWI\nimport Data.Maybe (Maybe(..), maybe, isJust, fromJust, isNothing)\nimport Data.Traversable (sequence, traverse)\nimport Data.Tuple (Tuple(..), fst, snd)\nimport Data.Unfoldable (class Unfoldable, unfoldr)\nimport Partial.Unsafe (unsafePartial)\n\n-- | Convert an `Array` into an `Unfoldable` structure.\ntoUnfoldable :: forall f. Unfoldable f => Array ~> f\ntoUnfoldable xs = unfoldr f 0\n  where\n  len = length xs\n  f i\n    | i < len = Just (Tuple (unsafePartial (unsafeIndex xs i)) (i + 1))\n    | otherwise = Nothing\n\n-- | Convert a `Foldable` structure into an `Array`.\n-- |\n-- | ```purescript\n-- | fromFoldable (Just 1) = [1]\n-- | fromFoldable (Nothing) = []\n-- | ```\n-- |\nfromFoldable :: forall f. Foldable f => f ~> Array\nfromFoldable = runFn2 fromFoldableImpl F.foldr\n\nforeign import fromFoldableImpl\n  :: forall f a\n   . Fn2 (forall b. (a -> b -> b) -> b -> f a -> b) (f a) (Array a)\n\n-- | Create an array of one element\n-- | ```purescript\n-- | singleton 2 = [2]\n-- | ```\nsingleton :: forall a. a -> Array a\nsingleton a = [ a ]\n\n-- | Create an array containing a range of integers, including both endpoints.\n-- | ```purescript\n-- | range 2 5 = [2, 3, 4, 5]\n-- | ```\nrange :: Int -> Int -> Array Int\nrange = runFn2 rangeImpl\n\nforeign import rangeImpl :: Fn2 Int Int (Array Int)\n\n-- | Create an array containing a value repeated the specified number of times.\n-- | ```purescript\n-- | replicate 2 \"Hi\" = [\"Hi\", \"Hi\"]\n-- | ```\nreplicate :: forall a. Int -> a -> Array a\nreplicate = runFn2 replicateImpl\n\nforeign import replicateImpl :: forall a. Fn2 Int a (Array a)\n\n-- | An infix synonym for `range`.\n-- | ```purescript\n-- | 2 .. 5 = [2, 3, 4, 5]\n-- | ```\ninfix 8 range as ..\n\n-- | Attempt a computation multiple times, requiring at least one success.\n-- |\n-- | The `Lazy` constraint is used to generate the result lazily, to ensure\n-- | termination.\nsome :: forall f a. Alternative f => Lazy (f (Array a)) => f a -> f (Array a)\nsome v = (:) <$> v <*> defer (\\_ -> many v)\n\n-- | Attempt a computation multiple times, returning as many successful results\n-- | as possible (possibly zero).\n-- |\n-- | The `Lazy` constraint is used to generate the result lazily, to ensure\n-- | termination.\nmany :: forall f a. Alternative f => Lazy (f (Array a)) => f a -> f (Array a)\nmany v = some v <|> pure []\n\n--------------------------------------------------------------------------------\n-- Array size ------------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Test whether an array is empty.\n-- | ```purescript\n-- | null [] = true\n-- | null [1, 2] = false\n-- | ```\nnull :: forall a. Array a -> Boolean\nnull xs = length xs == 0\n\n-- | Get the number of elements in an array.\n-- | ```purescript\n-- | length [\"Hello\", \"World\"] = 2\n-- | ```\nforeign import length :: forall a. Array a -> Int\n\n--------------------------------------------------------------------------------\n-- Extending arrays ------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Attaches an element to the front of an array, creating a new array.\n-- |\n-- | ```purescript\n-- | cons 1 [2, 3, 4] = [1, 2, 3, 4]\n-- | ```\n-- |\n-- | Note, the running time of this function is `O(n)`.\ncons :: forall a. a -> Array a -> Array a\ncons x xs = [ x ] <> xs\n\n-- | An infix alias for `cons`.\n-- |\n-- | ```purescript\n-- | 1 : [2, 3, 4] = [1, 2, 3, 4]\n-- | ```\n-- |\n-- | Note, the running time of this function is `O(n)`.\ninfixr 6 cons as :\n\n-- | Append an element to the end of an array, creating a new array.\n-- |\n-- | ```purescript\n-- | snoc [1, 2, 3] 4 = [1, 2, 3, 4]\n-- | ```\n-- |\nsnoc :: forall a. Array a -> a -> Array a\nsnoc xs x = ST.run (STA.withArray (STA.push x) xs)\n\n-- | Insert an element into a sorted array.\n-- |\n-- | ```purescript\n-- | insert 10 [1, 2, 20, 21] = [1, 2, 10, 20, 21]\n-- | ```\n-- |\ninsert :: forall a. Ord a => a -> Array a -> Array a\ninsert = insertBy compare\n\n-- | Insert an element into a sorted array, using the specified function to\n-- | determine the ordering of elements.\n-- |\n-- | ```purescript\n-- | invertCompare a b = invert $ compare a b\n-- |\n-- | insertBy invertCompare 10 [21, 20, 2, 1] = [21, 20, 10, 2, 1]\n-- | ```\n-- |\ninsertBy :: forall a. (a -> a -> Ordering) -> a -> Array a -> Array a\ninsertBy cmp x ys =\n  let\n    i = maybe 0 (_ + 1) (findLastIndex (\\y -> cmp x y == GT) ys)\n  in\n    unsafePartial (fromJust (insertAt i x ys))\n\n--------------------------------------------------------------------------------\n-- Non-indexed reads -----------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Get the first element in an array, or `Nothing` if the array is empty\n-- |\n-- | Running time: `O(1)`.\n-- |\n-- | ```purescript\n-- | head [1, 2] = Just 1\n-- | head [] = Nothing\n-- | ```\n-- |\nhead :: forall a. Array a -> Maybe a\nhead xs = xs !! 0\n\n-- | Get the last element in an array, or `Nothing` if the array is empty\n-- |\n-- | Running time: `O(1)`.\n-- |\n-- | ```purescript\n-- | last [1, 2] = Just 2\n-- | last [] = Nothing\n-- | ```\n-- |\nlast :: forall a. Array a -> Maybe a\nlast xs = xs !! (length xs - 1)\n\n-- | Get all but the first element of an array, creating a new array, or\n-- | `Nothing` if the array is empty\n-- |\n-- | ```purescript\n-- | tail [1, 2, 3, 4] = Just [2, 3, 4]\n-- | tail [] = Nothing\n-- | ```\n-- |\n-- | Running time: `O(n)` where `n` is the length of the array\ntail :: forall a. Array a -> Maybe (Array a)\ntail = runFn3 unconsImpl (const Nothing) (\\_ xs -> Just xs)\n\n-- | Get all but the last element of an array, creating a new array, or\n-- | `Nothing` if the array is empty.\n-- |\n-- | ```purescript\n-- | init [1, 2, 3, 4] = Just [1, 2, 3]\n-- | init [] = Nothing\n-- | ```\n-- |\n-- | Running time: `O(n)` where `n` is the length of the array\ninit :: forall a. Array a -> Maybe (Array a)\ninit xs\n  | null xs = Nothing\n  | otherwise = Just (slice zero (length xs - one) xs)\n\n-- | Break an array into its first element and remaining elements.\n-- |\n-- | Using `uncons` provides a way of writing code that would use cons patterns\n-- | in Haskell or pre-PureScript 0.7:\n-- | ``` purescript\n-- | f (x : xs) = something\n-- | f [] = somethingElse\n-- | ```\n-- | Becomes:\n-- | ``` purescript\n-- | f arr = case uncons arr of\n-- |   Just { head: x, tail: xs } -> something\n-- |   Nothing -> somethingElse\n-- | ```\nuncons :: forall a. Array a -> Maybe { head :: a, tail :: Array a }\nuncons = runFn3 unconsImpl (const Nothing) \\x xs -> Just { head: x, tail: xs }\n\nforeign import unconsImpl\n  :: forall a b\n   . Fn3 (Unit -> b) (a -> Array a -> b) (Array a) b\n\n-- | Break an array into its last element and all preceding elements.\n-- |\n-- | ```purescript\n-- | unsnoc [1, 2, 3] = Just {init: [1, 2], last: 3}\n-- | unsnoc [] = Nothing\n-- | ```\n-- |\n-- | Running time: `O(n)` where `n` is the length of the array\nunsnoc :: forall a. Array a -> Maybe { init :: Array a, last :: a }\nunsnoc xs = { init: _, last: _ } <$> init xs <*> last xs\n\n--------------------------------------------------------------------------------\n-- Indexed operations ----------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | This function provides a safe way to read a value at a particular index\n-- | from an array.\n-- |\n-- | ```purescript\n-- | sentence = [\"Hello\", \"World\", \"!\"]\n-- |\n-- | index sentence 0 = Just \"Hello\"\n-- | index sentence 7 = Nothing\n-- | ```\n-- |\nindex :: forall a. Array a -> Int -> Maybe a\nindex = runFn4 indexImpl Just Nothing\n\nforeign import indexImpl\n  :: forall a\n   . Fn4 (forall r. r -> Maybe r) (forall r. Maybe r) (Array a) Int (Maybe a)\n\n-- | An infix version of `index`.\n-- |\n-- | ```purescript\n-- | sentence = [\"Hello\", \"World\", \"!\"]\n-- |\n-- | sentence !! 0 = Just \"Hello\"\n-- | sentence !! 7 = Nothing\n-- | ```\n-- |\ninfixl 8 index as !!\n\n-- | Returns true if the array has the given element.\nelem :: forall a. Eq a => a -> Array a -> Boolean\nelem a arr = isJust $ elemIndex a arr\n\n-- | Returns true if the array does not have the given element.\nnotElem :: forall a. Eq a => a -> Array a -> Boolean\nnotElem a arr = isNothing $ elemIndex a arr\n\n-- | Find the index of the first element equal to the specified element.\n-- |\n-- | ```purescript\n-- | elemIndex \"a\" [\"a\", \"b\", \"a\", \"c\"] = Just 0\n-- | elemIndex \"Earth\" [\"Hello\", \"World\", \"!\"] = Nothing\n-- | ```\n-- |\nelemIndex :: forall a. Eq a => a -> Array a -> Maybe Int\nelemIndex x = findIndex (_ == x)\n\n-- | Find the index of the last element equal to the specified element.\n-- |\n-- | ```purescript\n-- | elemLastIndex \"a\" [\"a\", \"b\", \"a\", \"c\"] = Just 2\n-- | elemLastIndex \"Earth\" [\"Hello\", \"World\", \"!\"] = Nothing\n-- | ```\n-- |\nelemLastIndex :: forall a. Eq a => a -> Array a -> Maybe Int\nelemLastIndex x = findLastIndex (_ == x)\n\n-- | Find the first element for which a predicate holds.\n-- |\n-- | ```purescript\n-- | find (contains $ Pattern \"b\") [\"a\", \"bb\", \"b\", \"d\"] = Just \"bb\"\n-- | find (contains $ Pattern \"x\") [\"a\", \"bb\", \"b\", \"d\"] = Nothing\n-- | ```\nfind :: forall a. (a -> Boolean) -> Array a -> Maybe a\nfind f xs = unsafePartial (unsafeIndex xs) <$> findIndex f xs\n\n-- | Find the first element in a data structure which satisfies\n-- | a predicate mapping.\nfindMap :: forall a b. (a -> Maybe b) -> Array a -> Maybe b\nfindMap = runFn4 findMapImpl Nothing isJust\n\nforeign import findMapImpl\n  :: forall a b\n   . Fn4\n       (forall c. Maybe c)\n       (forall c. Maybe c -> Boolean)\n       (a -> Maybe b)\n       (Array a)\n       (Maybe b)\n\n-- | Find the first index for which a predicate holds.\n-- |\n-- | ```purescript\n-- | findIndex (contains $ Pattern \"b\") [\"a\", \"bb\", \"b\", \"d\"] = Just 1\n-- | findIndex (contains $ Pattern \"x\") [\"a\", \"bb\", \"b\", \"d\"] = Nothing\n-- | ```\n-- |\nfindIndex :: forall a. (a -> Boolean) -> Array a -> Maybe Int\nfindIndex = runFn4 findIndexImpl Just Nothing\n\nforeign import findIndexImpl\n  :: forall a\n   . Fn4\n       (forall b. b -> Maybe b)\n       (forall b. Maybe b)\n       (a -> Boolean)\n       (Array a)\n       (Maybe Int)\n\n-- | Find the last index for which a predicate holds.\n-- |\n-- | ```purescript\n-- | findLastIndex (contains $ Pattern \"b\") [\"a\", \"bb\", \"b\", \"d\"] = Just 2\n-- | findLastIndex (contains $ Pattern \"x\") [\"a\", \"bb\", \"b\", \"d\"] = Nothing\n-- | ```\n-- |\nfindLastIndex :: forall a. (a -> Boolean) -> Array a -> Maybe Int\nfindLastIndex = runFn4 findLastIndexImpl Just Nothing\n\nforeign import findLastIndexImpl\n  :: forall a\n   . Fn4\n       (forall b. b -> Maybe b)\n       (forall b. Maybe b)\n       (a -> Boolean)\n       (Array a)\n       (Maybe Int)\n\n-- | Insert an element at the specified index, creating a new array, or\n-- | returning `Nothing` if the index is out of bounds.\n-- |\n-- | ```purescript\n-- | insertAt 2 \"!\" [\"Hello\", \"World\"] = Just [\"Hello\", \"World\", \"!\"]\n-- | insertAt 10 \"!\" [\"Hello\"] = Nothing\n-- | ```\n-- |\ninsertAt :: forall a. Int -> a -> Array a -> Maybe (Array a)\ninsertAt = runFn5 _insertAt Just Nothing\n\nforeign import _insertAt\n  :: forall a\n   . Fn5\n       (forall b. b -> Maybe b)\n       (forall b. Maybe b)\n       Int\n       a\n       (Array a)\n       (Maybe (Array a))\n\n-- | Delete the element at the specified index, creating a new array, or\n-- | returning `Nothing` if the index is out of bounds.\n-- |\n-- | ```purescript\n-- | deleteAt 0 [\"Hello\", \"World\"] = Just [\"World\"]\n-- | deleteAt 10 [\"Hello\", \"World\"] = Nothing\n-- | ```\n-- |\ndeleteAt :: forall a. Int -> Array a -> Maybe (Array a)\ndeleteAt = runFn4 _deleteAt Just Nothing\n\nforeign import _deleteAt\n  :: forall a\n   . Fn4\n       (forall b. b -> Maybe b)\n       (forall b. Maybe b)\n       Int\n       (Array a)\n       (Maybe (Array a))\n\n-- | Change the element at the specified index, creating a new array, or\n-- | returning `Nothing` if the index is out of bounds.\n-- |\n-- | ```purescript\n-- | updateAt 1 \"World\" [\"Hello\", \"Earth\"] = Just [\"Hello\", \"World\"]\n-- | updateAt 10 \"World\" [\"Hello\", \"Earth\"] = Nothing\n-- | ```\n-- |\nupdateAt :: forall a. Int -> a -> Array a -> Maybe (Array a)\nupdateAt = runFn5 _updateAt Just Nothing\n\nforeign import _updateAt\n  :: forall a\n   . Fn5\n       (forall b. b -> Maybe b)\n       (forall b. Maybe b)\n       Int\n       a\n       (Array a)\n       (Maybe (Array a))\n\n-- | Apply a function to the element at the specified index, creating a new\n-- | array, or returning `Nothing` if the index is out of bounds.\n-- |\n-- | ```purescript\n-- | modifyAt 1 toUpper [\"Hello\", \"World\"] = Just [\"Hello\", \"WORLD\"]\n-- | modifyAt 10 toUpper [\"Hello\", \"World\"] = Nothing\n-- | ```\n-- |\nmodifyAt :: forall a. Int -> (a -> a) -> Array a -> Maybe (Array a)\nmodifyAt i f xs = maybe Nothing go (xs !! i)\n  where\n  go x = updateAt i (f x) xs\n\n-- | Update or delete the element at the specified index by applying a\n-- | function to the current value, returning a new array or `Nothing` if the\n-- | index is out-of-bounds.\n-- |\n-- | ```purescript\n-- | alterAt 1 (stripSuffix $ Pattern \"!\") [\"Hello\", \"World!\"]\n-- |    = Just [\"Hello\", \"World\"]\n-- |\n-- | alterAt 1 (stripSuffix $ Pattern \"!!!!!\") [\"Hello\", \"World!\"]\n-- |    = Just [\"Hello\"]\n-- |\n-- | alterAt 10 (stripSuffix $ Pattern \"!\") [\"Hello\", \"World!\"] = Nothing\n-- | ```\n-- |\nalterAt :: forall a. Int -> (a -> Maybe a) -> Array a -> Maybe (Array a)\nalterAt i f xs = maybe Nothing go (xs !! i)\n  where\n  go x = case f x of\n    Nothing -> deleteAt i xs\n    Just x' -> updateAt i x' xs\n\n--------------------------------------------------------------------------------\n-- Transformations -------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Inserts the given element in between each element in the array. The array\n-- | must have two or more elements for this operation to take effect.\n-- |\n-- | ```purescript\n-- | intersperse \" \" [ \"a\", \"b\" ] == [ \"a\", \" \", \"b\" ]\n-- | intersperse 0 [ 1, 2, 3, 4, 5 ] == [ 1, 0, 2, 0, 3, 0, 4, 0, 5 ]\n-- | ```\n-- |\n-- | If the array has less than two elements, the input array is returned.\n-- | ```purescript\n-- | intersperse \" \" [] == []\n-- | intersperse \" \" [\"a\"] == [\"a\"]\n-- | ```\nintersperse :: forall a. a -> Array a -> Array a\nintersperse a arr = case length arr of\n  len\n    | len < 2 -> arr\n    | otherwise -> STA.run do\n        let unsafeGetElem idx = unsafePartial (unsafeIndex arr idx)\n        out <- STA.new\n        _ <- STA.push (unsafeGetElem 0) out\n        ST.for 1 len \\idx -> do\n          _ <- STA.push a out\n          void (STA.push (unsafeGetElem idx) out)\n        pure out\n\n-- | Reverse an array, creating a new array.\n-- |\n-- | ```purescript\n-- | reverse [] = []\n-- | reverse [1, 2, 3] = [3, 2, 1]\n-- | ```\n-- |\nforeign import reverse :: forall a. Array a -> Array a\n\n-- | Flatten an array of arrays, creating a new array.\n-- |\n-- | ```purescript\n-- | concat [[1, 2, 3], [], [4, 5, 6]] = [1, 2, 3, 4, 5, 6]\n-- | ```\n-- |\nforeign import concat :: forall a. Array (Array a) -> Array a\n\n-- | Apply a function to each element in an array, and flatten the results\n-- | into a single, new array.\n-- |\n-- | ```purescript\n-- | concatMap (split $ Pattern \" \") [\"Hello World\", \"other thing\"]\n-- |    = [\"Hello\", \"World\", \"other\", \"thing\"]\n-- | ```\n-- |\nconcatMap :: forall a b. (a -> Array b) -> Array a -> Array b\nconcatMap = flip bind\n\n-- | Filter an array, keeping the elements which satisfy a predicate function,\n-- | creating a new array.\n-- |\n-- | ```purescript\n-- | filter (_ > 0) [-1, 4, -5, 7] = [4, 7]\n-- | ```\n-- |\nfilter :: forall a. (a -> Boolean) -> Array a -> Array a\nfilter = runFn2 filterImpl\n\nforeign import filterImpl\n  :: forall a\n   . Fn2 (a -> Boolean) (Array a) (Array a)\n\n-- | Partition an array using a predicate function, creating a set of\n-- | new arrays. One for the values satisfying the predicate function\n-- | and one for values that don't.\n-- |\n-- | ```purescript\n-- | partition (_ > 0) [-1, 4, -5, 7] = { yes: [4, 7], no: [-1, -5] }\n-- | ```\n-- |\npartition\n  :: forall a\n   . (a -> Boolean)\n  -> Array a\n  -> { yes :: Array a, no :: Array a }\npartition = runFn2 partitionImpl\n\nforeign import partitionImpl\n  :: forall a\n   . Fn2 (a -> Boolean) (Array a) { yes :: Array a, no :: Array a }\n\n-- | Splits an array into two subarrays, where `before` contains the elements\n-- | up to (but not including) the given index, and `after` contains the rest\n-- | of the elements, from that index on.\n-- |\n-- | ```purescript\n-- | >>> splitAt 3 [1, 2, 3, 4, 5]\n-- | { before: [1, 2, 3], after: [4, 5] }\n-- | ```\n-- |\n-- | Thus, the length of `(splitAt i arr).before` will equal either `i` or\n-- | `length arr`, if that is shorter. (Or if `i` is negative the length will\n-- | be 0.)\n-- |\n-- | ```purescript\n-- | splitAt 2 ([] :: Array Int) == { before: [], after: [] }\n-- | splitAt 3 [1, 2, 3, 4, 5] == { before: [1, 2, 3], after: [4, 5] }\n-- | ```\nsplitAt :: forall a. Int -> Array a -> { before :: Array a, after :: Array a }\nsplitAt i xs | i <= 0 = { before: [], after: xs }\nsplitAt i xs = { before: slice 0 i xs, after: slice i (length xs) xs }\n\n-- | Filter where the predicate returns a `Boolean` in some `Applicative`.\n-- |\n-- | ```purescript\n-- | powerSet :: forall a. Array a -> Array (Array a)\n-- | powerSet = filterA (const [true, false])\n-- | ```\nfilterA :: forall a f. Applicative f => (a -> f Boolean) -> Array a -> f (Array a)\nfilterA p =\n  traverse (\\x -> Tuple x <$> p x)\n    >>> map (mapMaybe (\\(Tuple x b) -> if b then Just x else Nothing))\n\n-- | Apply a function to each element in an array, keeping only the results\n-- | which contain a value, creating a new array.\n-- |\n-- | ```purescript\n-- | parseEmail :: String -> Maybe Email\n-- | parseEmail = ...\n-- |\n-- | mapMaybe parseEmail [\"a.com\", \"hello@example.com\", \"--\"]\n-- |    = [Email {user: \"hello\", domain: \"example.com\"}]\n-- | ```\n-- |\nmapMaybe :: forall a b. (a -> Maybe b) -> Array a -> Array b\nmapMaybe f = concatMap (maybe [] singleton <<< f)\n\n-- | Filter an array of optional values, keeping only the elements which contain\n-- | a value, creating a new array.\n-- |\n-- | ```purescript\n-- | catMaybes [Nothing, Just 2, Nothing, Just 4] = [2, 4]\n-- | ```\n-- |\ncatMaybes :: forall a. Array (Maybe a) -> Array a\ncatMaybes = mapMaybe identity\n\n-- | Apply a function to each element in an array, supplying a generated\n-- | zero-based index integer along with the element, creating an array\n-- | with the new elements.\n-- |\n-- | ```purescript\n-- | prefixIndex index element = show index <> element\n-- |\n-- | mapWithIndex prefixIndex [\"Hello\", \"World\"] = [\"0Hello\", \"1World\"]\n-- | ```\n-- |\nmapWithIndex :: forall a b. (Int -> a -> b) -> Array a -> Array b\nmapWithIndex = FWI.mapWithIndex\n\n-- | Change the elements at the specified indices in index/value pairs.\n-- | Out-of-bounds indices will have no effect.\n-- |\n-- | ```purescript\n-- | updates = [Tuple 0 \"Hi\", Tuple 2 \".\" , Tuple 10 \"foobar\"]\n-- |\n-- | updateAtIndices updates [\"Hello\", \"World\", \"!\"] = [\"Hi\", \"World\", \".\"]\n-- | ```\n-- |\nupdateAtIndices :: forall t a. Foldable t => t (Tuple Int a) -> Array a -> Array a\nupdateAtIndices us xs =\n  ST.run (STA.withArray (\\res -> traverse_ (\\(Tuple i a) -> STA.poke i a res) us) xs)\n\n-- | Apply a function to the element at the specified indices,\n-- | creating a new array. Out-of-bounds indices will have no effect.\n-- |\n-- | ```purescript\n-- | indices = [1, 3]\n-- | modifyAtIndices indices toUpper [\"Hello\", \"World\", \"and\", \"others\"]\n-- |    = [\"Hello\", \"WORLD\", \"and\", \"OTHERS\"]\n-- | ```\n-- |\nmodifyAtIndices :: forall t a. Foldable t => t Int -> (a -> a) -> Array a -> Array a\nmodifyAtIndices is f xs =\n  ST.run (STA.withArray (\\res -> traverse_ (\\i -> STA.modify i f res) is) xs)\n\nfoldl :: forall a b. (b -> a -> b) -> b -> Array a -> b\nfoldl = F.foldl\n\nfoldr :: forall a b. (a -> b -> b) -> b -> Array a -> b\nfoldr = F.foldr\n\nfoldMap :: forall a m. Monoid m => (a -> m) -> Array a -> m\nfoldMap = F.foldMap\n\nfold :: forall m. Monoid m => Array m -> m\nfold = F.fold\n\nintercalate :: forall a. Monoid a => a -> Array a -> a\nintercalate = F.intercalate\n\n-- | The 'transpose' function transposes the rows and columns of its argument.\n-- | For example,\n-- |\n-- | ```purescript\n-- | transpose \n-- |   [ [1, 2, 3]\n-- |   , [4, 5, 6]\n-- |   ] == \n-- |   [ [1, 4]\n-- |   , [2, 5]\n-- |   , [3, 6]\n-- |   ]\n-- | ```\n-- |\n-- | If some of the rows are shorter than the following rows, their elements are skipped:\n-- |\n-- | ```purescript\n-- | transpose \n-- |   [ [10, 11]\n-- |   , [20]\n-- |   , [30, 31, 32]\n-- |   ] == \n-- |   [ [10, 20, 30]\n-- |   , [11, 31]\n-- |   , [32]\n-- |   ]\n-- | ```\ntranspose :: forall a. Array (Array a) -> Array (Array a)\ntranspose xs = go 0 []\n  where\n  go :: Int -> Array (Array a) -> Array (Array a)\n  go idx allArrays = case buildNext idx of\n    Nothing -> allArrays\n    Just next -> go (idx + 1) (snoc allArrays next)\n\n  buildNext :: Int -> Maybe (Array a)\n  buildNext idx = do\n    xs # flip foldl Nothing \\acc nextArr -> do\n      maybe acc (\\el -> Just $ maybe [ el ] (flip snoc el) acc) $ index nextArr idx\n\n-- | Fold a data structure from the left, keeping all intermediate results\n-- | instead of only the final result. Note that the initial value does not\n-- | appear in the result (unlike Haskell's `Prelude.scanl`).\n-- |\n-- | ```\n-- | scanl (+) 0  [1,2,3] = [1,3,6]\n-- | scanl (-) 10 [1,2,3] = [9,7,4]\n-- | ```\nscanl :: forall a b. (b -> a -> b) -> b -> Array a -> Array b\nscanl = runFn3 scanlImpl\n\nforeign import scanlImpl :: forall a b. Fn3 (b -> a -> b) b (Array a) (Array b)\n\n-- | Fold a data structure from the right, keeping all intermediate results\n-- | instead of only the final result. Note that the initial value does not\n-- | appear in the result (unlike Haskell's `Prelude.scanr`).\n-- |\n-- | ```\n-- | scanr (+) 0 [1,2,3] = [6,5,3]\n-- | scanr (flip (-)) 10 [1,2,3] = [4,5,7]\n-- | ```\nscanr :: forall a b. (a -> b -> b) -> b -> Array a -> Array b\nscanr = runFn3 scanrImpl\n\nforeign import scanrImpl :: forall a b. Fn3 (a -> b -> b) b (Array a) (Array b)\n\n--------------------------------------------------------------------------------\n-- Sorting ---------------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Sort the elements of an array in increasing order, creating a new array.\n-- | Sorting is stable: the order of equal elements is preserved.\n-- |\n-- | ```purescript\n-- | sort [2, -3, 1] = [-3, 1, 2]\n-- | ```\n-- |\nsort :: forall a. Ord a => Array a -> Array a\nsort xs = sortBy compare xs\n\n-- | Sort the elements of an array in increasing order, where elements are\n-- | compared using the specified partial ordering, creating a new array.\n-- | Sorting is stable: the order of elements is preserved if they are equal\n-- | according to the specified partial ordering.\n-- |\n-- | ```purescript\n-- | compareLength a b = compare (length a) (length b)\n-- | sortBy compareLength [[1, 2, 3], [7, 9], [-2]] = [[-2],[7,9],[1,2,3]]\n-- | ```\n-- |\nsortBy :: forall a. (a -> a -> Ordering) -> Array a -> Array a\nsortBy comp = runFn3 sortByImpl comp case _ of\n  GT -> 1\n  EQ -> 0\n  LT -> -1\n\n-- | Sort the elements of an array in increasing order, where elements are\n-- | sorted based on a projection. Sorting is stable: the order of elements is\n-- | preserved if they are equal according to the projection.\n-- |\n-- | ```purescript\n-- | sortWith (_.age) [{name: \"Alice\", age: 42}, {name: \"Bob\", age: 21}]\n-- |    = [{name: \"Bob\", age: 21}, {name: \"Alice\", age: 42}]\n-- | ```\n-- |\nsortWith :: forall a b. Ord b => (a -> b) -> Array a -> Array a\nsortWith f = sortBy (comparing f)\n\nforeign import sortByImpl :: forall a. Fn3 (a -> a -> Ordering) (Ordering -> Int) (Array a) (Array a)\n\n--------------------------------------------------------------------------------\n-- Subarrays -------------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Extract a subarray by a start and end index.\n-- |\n-- | ```purescript\n-- | letters = [\"a\", \"b\", \"c\"]\n-- | slice 1 3 letters = [\"b\", \"c\"]\n-- | slice 5 7 letters = []\n-- | slice 4 1 letters = []\n-- | ```\n-- |\nslice :: forall a. Int -> Int -> Array a -> Array a\nslice = runFn3 sliceImpl\n\nforeign import sliceImpl :: forall a. Fn3 Int Int (Array a) (Array a)\n\n-- | Keep only a number of elements from the start of an array, creating a new\n-- | array.\n-- |\n-- | ```purescript\n-- | letters = [\"a\", \"b\", \"c\"]\n-- |\n-- | take 2 letters = [\"a\", \"b\"]\n-- | take 100 letters = [\"a\", \"b\", \"c\"]\n-- | ```\n-- |\ntake :: forall a. Int -> Array a -> Array a\ntake n xs = if n < 1 then [] else slice 0 n xs\n\n-- | Keep only a number of elements from the end of an array, creating a new\n-- | array.\n-- |\n-- | ```purescript\n-- | letters = [\"a\", \"b\", \"c\"]\n-- |\n-- | takeEnd 2 letters = [\"b\", \"c\"]\n-- | takeEnd 100 letters = [\"a\", \"b\", \"c\"]\n-- | ```\n-- |\ntakeEnd :: forall a. Int -> Array a -> Array a\ntakeEnd n xs = drop (length xs - n) xs\n\n-- | Calculate the longest initial subarray for which all element satisfy the\n-- | specified predicate, creating a new array.\n-- |\n-- | ```purescript\n-- | takeWhile (_ > 0) [4, 1, 0, -4, 5] = [4, 1]\n-- | takeWhile (_ > 0) [-1, 4] = []\n-- | ```\n-- |\ntakeWhile :: forall a. (a -> Boolean) -> Array a -> Array a\ntakeWhile p xs = (span p xs).init\n\n-- | Drop a number of elements from the start of an array, creating a new array.\n-- |\n-- | ```purescript\n-- | letters = [\"a\", \"b\", \"c\", \"d\"]\n-- |\n-- | drop 2 letters = [\"c\", \"d\"]\n-- | drop 10 letters = []\n-- | ```\n-- |\ndrop :: forall a. Int -> Array a -> Array a\ndrop n xs = if n < 1 then xs else slice n (length xs) xs\n\n-- | Drop a number of elements from the end of an array, creating a new array.\n-- |\n-- | ```purescript\n-- | letters = [\"a\", \"b\", \"c\", \"d\"]\n-- |\n-- | dropEnd 2 letters = [\"a\", \"b\"]\n-- | dropEnd 10 letters = []\n-- | ```\n-- |\ndropEnd :: forall a. Int -> Array a -> Array a\ndropEnd n xs = take (length xs - n) xs\n\n-- | Remove the longest initial subarray for which all element satisfy the\n-- | specified predicate, creating a new array.\n-- |\n-- | ```purescript\n-- | dropWhile (_ < 0) [-3, -1, 0, 4, -6] = [0, 4, -6]\n-- | ```\n-- |\ndropWhile :: forall a. (a -> Boolean) -> Array a -> Array a\ndropWhile p xs = (span p xs).rest\n\n-- | Split an array into two parts:\n-- |\n-- | 1. the longest initial subarray for which all elements satisfy the\n-- |    specified predicate\n-- | 2. the remaining elements\n-- |\n-- | ```purescript\n-- | span (\\n -> n % 2 == 1) [1,3,2,4,5] == { init: [1,3], rest: [2,4,5] }\n-- | ```\n-- |\n-- | Running time: `O(n)`.\nspan\n  :: forall a\n   . (a -> Boolean)\n  -> Array a\n  -> { init :: Array a, rest :: Array a }\nspan p arr =\n  case breakIndex of\n    Just 0 ->\n      { init: [], rest: arr }\n    Just i ->\n      { init: slice 0 i arr, rest: slice i (length arr) arr }\n    Nothing ->\n      { init: arr, rest: [] }\n  where\n  breakIndex = go 0\n  go i =\n    -- This looks like a good opportunity to use the Monad Maybe instance,\n    -- but it's important to write out an explicit case expression here in\n    -- order to ensure that TCO is triggered.\n    case index arr i of\n      Just x -> if p x then go (i + 1) else Just i\n      Nothing -> Nothing\n\n-- | Group equal, consecutive elements of an array into arrays.\n-- |\n-- | ```purescript\n-- | group [1, 1, 2, 2, 1] == [NonEmptyArray [1, 1], NonEmptyArray [2, 2], NonEmptyArray [1]]\n-- | ```\ngroup :: forall a. Eq a => Array a -> Array (NonEmptyArray a)\ngroup xs = groupBy eq xs\n\n-- | Group equal elements of an array into arrays.\n-- |\n-- | ```purescript\n-- | groupAll [1, 1, 2, 2, 1] == [NonEmptyArray [1, 1, 1], NonEmptyArray [2, 2]]\n-- | ```\ngroupAll :: forall a. Ord a => Array a -> Array (NonEmptyArray a)\ngroupAll = groupAllBy compare\n\n-- | Group equal, consecutive elements of an array into arrays, using the\n-- | specified equivalence relation to determine equality.\n-- |\n-- | ```purescript\n-- | groupBy (\\a b -> odd a && odd b) [1, 3, 2, 4, 3, 3]\n-- |    = [NonEmptyArray [1, 3], NonEmptyArray [2], NonEmptyArray [4], NonEmptyArray [3, 3]]\n-- | ```\n-- |\ngroupBy :: forall a. (a -> a -> Boolean) -> Array a -> Array (NonEmptyArray a)\ngroupBy op xs =\n  ST.run do\n    result <- STA.new\n    iter <- STAI.iterator (xs !! _)\n    STAI.iterate iter \\x -> void do\n      sub <- STA.new\n      _ <- STA.push x sub\n      STAI.pushWhile (op x) iter sub\n      grp <- STA.unsafeFreeze sub\n      STA.push (NonEmptyArray grp) result\n    STA.unsafeFreeze result\n\n-- | Group equal elements of an array into arrays, using the specified\n-- | comparison function to determine equality.\n-- |\n-- | ```purescript\n-- | groupAllBy (comparing Down) [1, 3, 2, 4, 3, 3]\n-- |    = [NonEmptyArray [4], NonEmptyArray [3, 3, 3], NonEmptyArray [2], NonEmptyArray [1]]\n-- | ```\n-- |\ngroupAllBy :: forall a. (a -> a -> Ordering) -> Array a -> Array (NonEmptyArray a)\ngroupAllBy cmp = groupBy (\\x y -> cmp x y == EQ) <<< sortBy cmp\n\n-- | Remove the duplicates from an array, creating a new array.\n-- |\n-- | ```purescript\n-- | nub [1, 2, 1, 3, 3] = [1, 2, 3]\n-- | ```\n-- |\nnub :: forall a. Ord a => Array a -> Array a\nnub = nubBy compare\n\n-- | Remove the duplicates from an array, creating a new array.\n-- |\n-- | This less efficient version of `nub` only requires an `Eq` instance.\n-- |\n-- | ```purescript\n-- | nubEq [1, 2, 1, 3, 3] = [1, 2, 3]\n-- | ```\n-- |\nnubEq :: forall a. Eq a => Array a -> Array a\nnubEq = nubByEq eq\n\n-- | Remove the duplicates from an array, where element equality is determined\n-- | by the specified ordering, creating a new array.\n-- |\n-- | ```purescript\n-- | nubBy compare [1, 3, 4, 2, 2, 1] == [1, 3, 4, 2]\n-- | ```\n-- |\nnubBy :: forall a. (a -> a -> Ordering) -> Array a -> Array a\nnubBy comp xs = case head indexedAndSorted of\n  Nothing -> []\n  Just x -> map snd $ sortWith fst $ ST.run do\n    -- TODO: use NonEmptyArrays here to avoid partial functions\n    result <- STA.unsafeThaw $ singleton x\n    ST.foreach indexedAndSorted \\pair@(Tuple _ x') -> do\n      lst <- snd <<< unsafePartial (fromJust <<< last) <$> STA.unsafeFreeze result\n      when (comp lst x' /= EQ) $ void $ STA.push pair result\n    STA.unsafeFreeze result\n  where\n  indexedAndSorted :: Array (Tuple Int a)\n  indexedAndSorted = sortBy (\\x y -> comp (snd x) (snd y))\n    (mapWithIndex Tuple xs)\n\n-- | Remove the duplicates from an array, where element equality is determined\n-- | by the specified equivalence relation, creating a new array.\n-- |\n-- | This less efficient version of `nubBy` only requires an equivalence\n-- | relation.\n-- |\n-- | ```purescript\n-- | mod3eq a b = a `mod` 3 == b `mod` 3\n-- | nubByEq mod3eq [1, 3, 4, 5, 6] = [1, 3, 5]\n-- | ```\n-- |\nnubByEq :: forall a. (a -> a -> Boolean) -> Array a -> Array a\nnubByEq eq xs = ST.run do\n  arr <- STA.new\n  ST.foreach xs \\x -> do\n    e <- not <<< any (_ `eq` x) <$> (STA.unsafeFreeze arr)\n    when e $ void $ STA.push x arr\n  STA.unsafeFreeze arr\n\n-- | Calculate the union of two arrays. Note that duplicates in the first array\n-- | are preserved while duplicates in the second array are removed.\n-- |\n-- | Running time: `O(n^2)`\n-- |\n-- | ```purescript\n-- | union [1, 2, 1, 1] [3, 3, 3, 4] = [1, 2, 1, 1, 3, 4]\n-- | ```\n-- |\nunion :: forall a. Eq a => Array a -> Array a -> Array a\nunion = unionBy (==)\n\n-- | Calculate the union of two arrays, using the specified function to\n-- | determine equality of elements. Note that duplicates in the first array\n-- | are preserved while duplicates in the second array are removed.\n-- |\n-- | ```purescript\n-- | mod3eq a b = a `mod` 3 == b `mod` 3\n-- | unionBy mod3eq [1, 5, 1, 2] [3, 4, 3, 3] = [1, 5, 1, 2, 3]\n-- | ```\n-- |\nunionBy :: forall a. (a -> a -> Boolean) -> Array a -> Array a -> Array a\nunionBy eq xs ys = xs <> foldl (flip (deleteBy eq)) (nubByEq eq ys) xs\n\n-- | Delete the first element of an array which is equal to the specified value,\n-- | creating a new array.\n-- |\n-- | ```purescript\n-- | delete 7 [1, 7, 3, 7] = [1, 3, 7]\n-- | delete 7 [1, 2, 3] = [1, 2, 3]\n-- | ```\n-- |\n-- | Running time: `O(n)`\ndelete :: forall a. Eq a => a -> Array a -> Array a\ndelete = deleteBy eq\n\n-- | Delete the first element of an array which matches the specified value,\n-- | under the equivalence relation provided in the first argument, creating a\n-- | new array.\n-- |\n-- | ```purescript\n-- | mod3eq a b = a `mod` 3 == b `mod` 3\n-- | deleteBy mod3eq 6 [1, 3, 4, 3] = [1, 4, 3]\n-- | ```\n-- |\ndeleteBy :: forall a. (a -> a -> Boolean) -> a -> Array a -> Array a\ndeleteBy _ _ [] = []\ndeleteBy eq x ys = maybe ys (\\i -> unsafePartial $ fromJust (deleteAt i ys)) (findIndex (eq x) ys)\n\n-- | Delete the first occurrence of each element in the second array from the\n-- | first array, creating a new array.\n-- |\n-- | ```purescript\n-- | difference [2, 1] [2, 3] = [1]\n-- | ```\n-- |\n-- | Running time: `O(n*m)`, where n is the length of the first array, and m is\n-- | the length of the second.\ndifference :: forall a. Eq a => Array a -> Array a -> Array a\ndifference = foldr delete\n\ninfix 5 difference as \\\\\n\n-- | Calculate the intersection of two arrays, creating a new array. Note that\n-- | duplicates in the first array are preserved while duplicates in the second\n-- | array are removed.\n-- |\n-- | ```purescript\n-- | intersect [1, 1, 2] [2, 2, 1] = [1, 1, 2]\n-- | ```\n-- |\nintersect :: forall a. Eq a => Array a -> Array a -> Array a\nintersect = intersectBy eq\n\n-- | Calculate the intersection of two arrays, using the specified equivalence\n-- | relation to compare elements, creating a new array. Note that duplicates\n-- | in the first array are preserved while duplicates in the second array are\n-- | removed.\n-- |\n-- | ```purescript\n-- | mod3eq a b = a `mod` 3 == b `mod` 3\n-- | intersectBy mod3eq [1, 2, 3] [4, 6, 7] = [1, 3]\n-- | ```\n-- |\nintersectBy :: forall a. (a -> a -> Boolean) -> Array a -> Array a -> Array a\nintersectBy eq xs ys = filter (\\x -> isJust (findIndex (eq x) ys)) xs\n\n-- | Apply a function to pairs of elements at the same index in two arrays,\n-- | collecting the results in a new array.\n-- |\n-- | If one array is longer, elements will be discarded from the longer array.\n-- |\n-- | For example\n-- |\n-- | ```purescript\n-- | zipWith (*) [1, 2, 3] [4, 5, 6, 7] == [4, 10, 18]\n-- | ```\nzipWith\n  :: forall a b c\n   . (a -> b -> c)\n  -> Array a\n  -> Array b\n  -> Array c\nzipWith = runFn3 zipWithImpl\n\nforeign import zipWithImpl\n  :: forall a b c\n   . Fn3\n       (a -> b -> c)\n       (Array a)\n       (Array b)\n       (Array c)\n\n-- | A generalization of `zipWith` which accumulates results in some\n-- | `Applicative` functor.\n-- |\n-- | ```purescript\n-- | sndChars = zipWithA (\\a b -> charAt 2 (a <> b))\n-- | sndChars [\"a\", \"b\"] [\"A\", \"B\"] = Nothing -- since \"aA\" has no 3rd char\n-- | sndChars [\"aa\", \"b\"] [\"AA\", \"BBB\"] = Just ['A', 'B']\n-- | ```\n-- |\nzipWithA\n  :: forall m a b c\n   . Applicative m\n  => (a -> b -> m c)\n  -> Array a\n  -> Array b\n  -> m (Array c)\nzipWithA f xs ys = sequence (zipWith f xs ys)\n\n-- | Takes two arrays and returns an array of corresponding pairs.\n-- | If one input array is short, excess elements of the longer array are\n-- | discarded.\n-- |\n-- | ```purescript\n-- | zip [1, 2, 3] [\"a\", \"b\"] = [Tuple 1 \"a\", Tuple 2 \"b\"]\n-- | ```\n-- |\nzip :: forall a b. Array a -> Array b -> Array (Tuple a b)\nzip = zipWith Tuple\n\n-- | Transforms an array of pairs into an array of first components and an\n-- | array of second components.\n-- |\n-- | ```purescript\n-- | unzip [Tuple 1 \"a\", Tuple 2 \"b\"] = Tuple [1, 2] [\"a\", \"b\"]\n-- | ```\n-- |\nunzip :: forall a b. Array (Tuple a b) -> Tuple (Array a) (Array b)\nunzip xs =\n  ST.run do\n    fsts <- STA.new\n    snds <- STA.new\n    iter <- STAI.iterator (xs !! _)\n    STAI.iterate iter \\(Tuple fst snd) -> do\n      void $ STA.push fst fsts\n      void $ STA.push snd snds\n    fsts' <- STA.unsafeFreeze fsts\n    snds' <- STA.unsafeFreeze snds\n    pure $ Tuple fsts' snds'\n\n-- | Returns true if at least one array element satisfies the given predicate,\n-- | iterating the array only as necessary and stopping as soon as the predicate\n-- | yields true.\n-- |\n-- | ```purescript\n-- | any (_ > 0) [] = False\n-- | any (_ > 0) [-1, 0, 1] = True\n-- | any (_ > 0) [-1, -2, -3] = False\n-- | ```\nany :: forall a. (a -> Boolean) -> Array a -> Boolean\nany = runFn2 anyImpl\n\nforeign import anyImpl :: forall a. Fn2 (a -> Boolean) (Array a) Boolean\n\n-- | Returns true if all the array elements satisfy the given predicate.\n-- | iterating the array only as necessary and stopping as soon as the predicate\n-- | yields false.\n-- |\n-- | ```purescript\n-- | all (_ > 0) [] = True\n-- | all (_ > 0) [1, 2, 3] = True\n-- | all (_ > 0) [-1, -2, -3] = False\n-- | ```\nall :: forall a. (a -> Boolean) -> Array a -> Boolean\nall = runFn2 allImpl\n\nforeign import allImpl :: forall a. Fn2 (a -> Boolean) (Array a) Boolean\n\n-- | Perform a fold using a monadic step function.\n-- |\n-- | ```purescript\n-- | foldM (\\x y -> Just (x + y)) 0 [1, 4] = Just 5\n-- | ```\nfoldM :: forall m a b. Monad m => (b -> a -> m b) -> b -> Array a -> m b\nfoldM f b = runFn3 unconsImpl (\\_ -> pure b) (\\a as -> f b a >>= \\b' -> foldM f b' as)\n\nfoldRecM :: forall m a b. MonadRec m => (b -> a -> m b) -> b -> Array a -> m b\nfoldRecM f b array = tailRecM2 go b 0\n  where\n  go res i\n    | i >= length array = pure (Done res)\n    | otherwise = do\n        res' <- f res (unsafePartial (unsafeIndex array i))\n        pure (Loop { a: res', b: i + 1 })\n\n-- | Find the element of an array at the specified index.\n-- |\n-- | ```purescript\n-- | unsafePartial $ unsafeIndex [\"a\", \"b\", \"c\"] 1 = \"b\"\n-- | ```\n-- |\n-- | Using `unsafeIndex` with an out-of-range index will not immediately raise a runtime error.\n-- | Instead, the result will be undefined. Most attempts to subsequently use the result will\n-- | cause a runtime error, of course, but this is not guaranteed, and is dependent on the backend;\n-- | some programs will continue to run as if nothing is wrong. For example, in the JavaScript backend,\n-- | the expression `unsafePartial (unsafeIndex [true] 1)` has type `Boolean`;\n-- | since this expression evaluates to `undefined`, attempting to use it in an `if` statement will cause\n-- | the else branch to be taken.\nunsafeIndex :: forall a. Partial => Array a -> Int -> a\nunsafeIndex = runFn2 unsafeIndexImpl\n\nforeign import unsafeIndexImpl :: forall a. Fn2 (Array a) Int a\n", "const newImpl = function () {\n  return {};\n};\nexport { newImpl as new };\n\nexport function peekImpl(just) {\n  return function (nothing) {\n    return function (k) {\n      return function (m) {\n        return function () {\n          return {}.hasOwnProperty.call(m, k) ? just(m[k]) : nothing;\n        };\n      };\n    };\n  };\n}\n\nexport function poke(k) {\n  return function (v) {\n    return function (m) {\n      return function () {\n        m[k] = v;\n        return m;\n      };\n    };\n  };\n}\n\nconst deleteImpl = function (k) {\n  return function (m) {\n    return function () {\n      delete m[k];\n      return m;\n    };\n  };\n};\nexport { deleteImpl as delete };\n", "-- | This module defines a type of native homogeneous Javascript Objects.\n-- |\n-- | To maximize performance, Javascript objects are not wrapped,\n-- | and some native code is used even when it's not necessary.\n\nmodule Foreign.Object\n  ( Object\n  , empty\n  , isEmpty\n  , size\n  , singleton\n  , insert\n  , lookup\n  , toUnfoldable\n  , toAscUnfoldable\n  , fromFoldable\n  , fromFoldableWith\n  , fromFoldableWithIndex\n  , fromHomogeneous\n  , delete\n  , pop\n  , member\n  , alter\n  , update\n  , mapWithKey\n  , filterWithKey\n  , filterKeys\n  , filter\n  , keys\n  , values\n  , union\n  , unionWith\n  , unions\n  , isSubmap\n  , fold\n  , foldMap\n  , foldM\n  , foldMaybe\n  , all\n  , thawST\n  , freezeST\n  , runST\n  , toArrayWithKey\n  ) where\n\nimport Prelude\n\nimport Control.Monad.ST (ST)\nimport Control.Monad.ST as ST\nimport Data.Array as A\nimport Data.Eq (class Eq1)\nimport Data.Foldable (class Foldable, foldl, foldr, for_)\nimport Data.FoldableWithIndex (class FoldableWithIndex, forWithIndex_)\nimport Data.Function.Uncurried (Fn2, runFn2, Fn4, runFn4)\nimport Data.FunctorWithIndex (class FunctorWithIndex)\nimport Data.Maybe (Maybe(..), maybe, fromMaybe)\nimport Data.Traversable (class Traversable, traverse)\nimport Data.TraversableWithIndex (class TraversableWithIndex, traverseWithIndex)\nimport Data.Tuple (Tuple(..), fst, uncurry)\nimport Data.Unfoldable (class Unfoldable)\nimport Foreign.Object.ST (STObject)\nimport Foreign.Object.ST as OST\nimport Type.Row.Homogeneous (class Homogeneous)\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | `Object a` represents a homogeneous JS Object with values of type `a`.\nforeign import data Object :: Type -> Type\n\ntype role Object representational\n\nforeign import _copyST :: forall a b r. a -> ST r b\n\n-- | Convert an immutable Object into a mutable Object\nthawST :: forall a r. Object a -> ST r (STObject r a)\nthawST = _copyST\n\n-- | Convert a mutable Object into an immutable Object\nfreezeST :: forall a r. STObject r a -> ST r (Object a)\nfreezeST = _copyST\n\n-- | Freeze a mutable Object, creating an immutable Object. Use this function as you would use\n-- | `Control.Monad.ST.run` (from the `purescript-st` package) to freeze a mutable reference.\n-- |\n-- | The rank-2 type prevents the Object from escaping the scope of `runST`.\nforeign import runST :: forall a. (forall r. ST r (STObject r a)) -> Object a\n\nmutate :: forall a b. (forall r. STObject r a -> ST r b) -> Object a -> Object a\nmutate f m = runST do\n  s <- thawST m\n  _ <- f s\n  pure s\n\nforeign import _fmapObject :: forall a b. Fn2 (Object a) (a -> b) (Object b)\n\ninstance functorObject :: Functor Object where\n  map f m = runFn2 _fmapObject m f\n\ninstance functorWithIndexObject :: FunctorWithIndex String Object where\n  mapWithIndex = mapWithKey\n\nforeign import _foldM :: forall a m z. (m -> (z -> m) -> m) -> (z -> String -> a -> m) -> m -> Object a -> m\n\n-- | Fold the keys and values of an object\nfold :: forall a z. (z -> String -> a -> z) -> z -> Object a -> z\nfold = _foldM ((#))\n\n-- | Fold the keys and values of an object, accumulating values using some\n-- | `Monoid`.\nfoldMap :: forall a m. Monoid m => (String -> a -> m) -> Object a -> m\nfoldMap f = fold (\\acc k v -> acc <> f k v) mempty\n\n-- | Fold the keys and values of an object, accumulating values and effects in\n-- | some `Monad`.\nfoldM :: forall a m z. Monad m => (z -> String -> a -> m z) -> z -> Object a -> m z\nfoldM f z = _foldM bind f (pure z)\n\ninstance foldableObject :: Foldable Object where\n  foldl f = fold (\\z _ -> f z)\n  foldr f z m = foldr f z (values m)\n  foldMap f = foldMap (const f)\n\ninstance foldableWithIndexObject :: FoldableWithIndex String Object where\n  foldlWithIndex f = fold (flip f)\n  foldrWithIndex f z m = foldr (uncurry f) z (toArrayWithKey Tuple m)\n  foldMapWithIndex = foldMap\n\ninstance traversableObject :: Traversable Object where\n  traverse = traverseWithIndex <<< const\n  sequence = traverse identity\n\ninstance traversableWithIndexObject :: TraversableWithIndex String Object where\n  traverseWithIndex f ms =\n    fold (\\acc k v -> flip (insert k) <$> acc <*> f k v) (pure empty) ms\n\n-- Unfortunately the above are not short-circuitable (consider using purescript-machines)\n-- so we need special cases:\n\nforeign import _foldSCObject :: forall a z. Fn4 (Object a) z (z -> String -> a -> Maybe z) (forall b. b -> Maybe b -> b) z\n\n-- | Fold the keys and values of a map.\n-- |\n-- | This function allows the folding function to terminate the fold early,\n-- | using `Maybe`.\nfoldMaybe :: forall a z. (z -> String -> a -> Maybe z) -> z -> Object a -> z\nfoldMaybe f z m = runFn4 _foldSCObject m z f fromMaybe\n\n-- | Test whether all key/value pairs in a `Object` satisfy a predicate.\nforeign import all :: forall a. (String -> a -> Boolean) -> Object a -> Boolean\n\ninstance eqObject :: Eq a => Eq (Object a) where\n  eq m1 m2 = (isSubmap m1 m2) && (isSubmap m2 m1)\n\ninstance eq1Object :: Eq1 Object where\n  eq1 = eq\n\n-- Internal use\ntoAscArray :: forall v. Object v -> Array (Tuple String v)\ntoAscArray = toAscUnfoldable\n\ninstance ordObject :: Ord a => Ord (Object a) where\n  compare m1 m2 = compare (toAscArray m1) (toAscArray m2)\n\ninstance showObject :: Show a => Show (Object a) where\n  show m = \"(fromFoldable \" <> show (toArray m) <> \")\"\n\n-- | An empty map\nforeign import empty :: forall a. Object a\n\n-- | Test whether one map contains all of the keys and values contained in another map\nisSubmap :: forall a. Eq a => Object a -> Object a -> Boolean\nisSubmap m1 m2 = all f m1 where\n  f k v = runFn4 _lookup false ((==) v) k m2\n\n-- | Test whether a map is empty\nisEmpty :: forall a. Object a -> Boolean\nisEmpty = all (\\_ _ -> false)\n\n-- | Calculate the number of key/value pairs in a map\nforeign import size :: forall a. Object a -> Int\n\n-- | Create an `Object a` with one key/value pair\nsingleton :: forall a. String -> a -> Object a\nsingleton k v = runST (OST.poke k v =<< OST.new)\n\nforeign import _lookup :: forall a z. Fn4 z (a -> z) String (Object a) z\n\n-- | Lookup the value for a key in a map\nlookup :: forall a. String -> Object a -> Maybe a\nlookup = runFn4 _lookup Nothing Just\n\n-- | Test whether a `String` appears as a key in a map\nmember :: forall a. String -> Object a -> Boolean\nmember = runFn4 _lookup false (const true)\n\n-- | Insert or replace a key/value pair in a map\ninsert :: forall a. String -> a -> Object a -> Object a\ninsert k v = mutate (OST.poke k v)\n\n-- | Delete a key and value from a map\ndelete :: forall a. String -> Object a -> Object a\ndelete k = mutate (OST.delete k)\n\n-- | Delete a key and value from a map, returning the value\n-- | as well as the subsequent map\npop :: forall a. String -> Object a -> Maybe (Tuple a (Object a))\npop k m = lookup k m <#> \\a -> Tuple a (delete k m)\n\n-- | Insert, remove or update a value for a key in a map\nalter :: forall a. (Maybe a -> Maybe a) -> String -> Object a -> Object a\nalter f k m = case f (k `lookup` m) of\n  Nothing -> delete k m\n  Just v -> insert k v m\n\n-- | Remove or update a value for a key in a map\nupdate :: forall a. (a -> Maybe a) -> String -> Object a -> Object a\nupdate f k m = alter (maybe Nothing f) k m\n\n-- | Create an `Object a` from a foldable collection of key/value pairs\nfromFoldable :: forall f a. Foldable f => f (Tuple String a) -> Object a\nfromFoldable l = runST do\n  s <- OST.new\n  ST.foreach (A.fromFoldable l) \\(Tuple k v) -> void $ OST.poke k v s\n  pure s\n\n-- | Create an `Object a` from a `String`-indexed foldable collection\nfromFoldableWithIndex :: forall f a. FoldableWithIndex String f => f a -> Object a\nfromFoldableWithIndex l = runST do\n  s <- OST.new\n  forWithIndex_ l \\k v -> OST.poke k v s\n  pure s\n\nforeign import _lookupST :: forall a r z. Fn4 z (a -> z) String (STObject r a) (ST r z)\n\n-- | Create an `Object a` from a foldable collection of key/value pairs, using the\n-- | specified function to combine values for duplicate keys.\nfromFoldableWith :: forall f a. Foldable f => (a -> a -> a) -> f (Tuple String a) -> Object a\nfromFoldableWith f l = runST (do\n  s <- OST.new\n  for_ l (\\(Tuple k v) -> runFn4 _lookupST v (f v) k s >>= \\v' -> OST.poke k v' s)\n  pure s)\n\n-- | Create an `Object a` from a homogeneous record, i.e. all of the record\n-- | fields are of the same type.\nfromHomogeneous :: forall r a. Homogeneous r a => { | r } -> Object a\nfromHomogeneous = unsafeCoerce\n\nforeign import toArrayWithKey :: forall a b . (String -> a -> b) -> Object a -> Array b\n\n-- | Unfolds a map into a list of key/value pairs\ntoUnfoldable :: forall f a. Unfoldable f => Object a -> f (Tuple String a)\ntoUnfoldable = A.toUnfoldable <<< toArrayWithKey Tuple\n\n-- | Unfolds a map into a list of key/value pairs which is guaranteed to be\n-- | sorted by key\ntoAscUnfoldable :: forall f a. Unfoldable f => Object a -> f (Tuple String a)\ntoAscUnfoldable = A.toUnfoldable <<< A.sortWith fst <<< toArrayWithKey Tuple\n\n-- Internal\ntoArray :: forall a. Object a -> Array (Tuple String a)\ntoArray = toArrayWithKey Tuple\n\n-- | Get an array of the keys in a map\nforeign import keys :: forall a. Object a -> Array String\n\n-- | Get a list of the values in a map\nvalues :: forall a. Object a -> Array a\nvalues = toArrayWithKey (\\_ v -> v)\n\n-- | Compute the union of two maps, preferring the first map in the case of\n-- | duplicate keys.\nunion :: forall a. Object a -> Object a -> Object a\nunion m = mutate (\\s -> foldM (\\s' k v -> OST.poke k v s') s m)\n\n-- | Compute the union of two maps, using the specified function\n-- | to combine values for duplicate keys.\nunionWith :: forall a. (a -> a -> a) -> Object a -> Object a -> Object a\nunionWith f m1 m2 =\n  mutate (\\s1 -> foldM (\\s2 k v1 -> OST.poke k (runFn4 _lookup v1 (\\v2 -> f v1 v2) k m2) s2) s1 m1) m2\n\n-- | Compute the union of a collection of maps\nunions :: forall f a. Foldable f => f (Object a) -> Object a\nunions = foldl union empty\n\nforeign import _mapWithKey :: forall a b. Fn2 (Object a) (String -> a -> b) (Object b)\n\n-- | Apply a function of two arguments to each key/value pair, producing a new map\nmapWithKey :: forall a b. (String -> a -> b) -> Object a -> Object b\nmapWithKey f m = runFn2 _mapWithKey m f\n\ninstance semigroupObject :: (Semigroup a) => Semigroup (Object a) where\n  append = unionWith (<>)\n\ninstance monoidObject :: (Semigroup a) => Monoid (Object a) where\n  mempty = empty\n\n-- | Filter out those key/value pairs of a map for which a predicate\n-- | fails to hold.\nfilterWithKey :: forall a. (String -> a -> Boolean) -> Object a -> Object a\nfilterWithKey predicate m = runST go\n  where\n  go :: forall r. ST r (STObject r a)\n  go = do\n    m' <- OST.new\n    foldM step m' m\n    where\n      step acc k v = if predicate k v then OST.poke k v acc else pure acc\n\n-- | Filter out those key/value pairs of a map for which a predicate\n-- | on the key fails to hold.\nfilterKeys :: (String -> Boolean) -> Object ~> Object\nfilterKeys predicate = filterWithKey $ const <<< predicate\n\n-- | Filter out those key/value pairs of a map for which a predicate\n-- | on the value fails to hold.\nfilter :: forall a. (a -> Boolean) -> Object a -> Object a\nfilter predicate = filterWithKey $ const predicate\n", "-- | This module defines a data type and various functions for creating and\n-- | manipulating JSON values. The README contains additional documentation\n-- | for this module.\nmodule Data.Argonaut.Core\n  ( Json\n  , caseJson\n  , caseJsonNull\n  , caseJsonBoolean\n  , caseJsonNumber\n  , caseJsonString\n  , caseJsonArray\n  , caseJsonObject\n  , isNull\n  , isBoolean\n  , isNumber\n  , isString\n  , isArray\n  , isObject\n  , fromBoolean\n  , fromNumber\n  , fromString\n  , fromArray\n  , fromObject\n  , toNull\n  , toBoolean\n  , toNumber\n  , toString\n  , toArray\n  , toObject\n  , jsonNull\n  , jsonTrue\n  , jsonFalse\n  , jsonZero\n  , jsonEmptyString\n  , jsonEmptyArray\n  , jsonSingletonArray\n  , jsonEmptyObject\n  , jsonSingletonObject\n  , stringify\n  , stringifyWithIndent\n  ) where\n\nimport Prelude\n\nimport Data.Function.Uncurried (Fn5, runFn5, Fn7, runFn7)\nimport Data.Maybe (Maybe(..))\nimport Foreign.Object (Object)\nimport Foreign.Object as Obj\n\n-- | The type of JSON data. The underlying representation is the same as what\n-- | would be returned from JavaScript's `JSON.parse` function; that is,\n-- | ordinary JavaScript booleans, strings, arrays, objects, etc.\nforeign import data Json :: Type\n\ninstance eqJson :: Eq Json where\n  eq j1 j2 = compare j1 j2 == EQ\n\ninstance ordJson :: Ord Json where\n  compare a b = runFn5 _compare EQ GT LT a b\n\n-- | The type of null values inside JSON data. There is exactly one value of\n-- | this type: in JavaScript, it is written `null`. This module exports this\n-- | value as `jsonNull`.\nforeign import data JNull :: Type\n\ninstance eqJNull :: Eq JNull where\n  eq _ _ = true\n\ninstance ordJNull :: Ord JNull where\n  compare _ _ = EQ\n\n-- | Case analysis for `Json` values. See the README for more information.\ncaseJson\n  :: forall a\n   . (Unit -> a)\n  -> (Boolean -> a)\n  -> (Number -> a)\n  -> (String -> a)\n  -> (Array Json -> a)\n  -> (Object Json -> a)\n  -> Json\n  -> a\ncaseJson a b c d e f json = runFn7 _caseJson a b c d e f json\n\n-- | A simpler version of `caseJson` which accepts a callback for when the\n-- | `Json` argument was null, and a default value for all other cases.\ncaseJsonNull :: forall a. a -> (Unit -> a) -> Json -> a\ncaseJsonNull d f j = runFn7 _caseJson f (const d) (const d) (const d) (const d) (const d) j\n\n-- | A simpler version of `caseJson` which accepts a callback for when the\n-- | `Json` argument was a `Boolean`, and a default value for all other cases.\ncaseJsonBoolean :: forall a. a -> (Boolean -> a) -> Json -> a\ncaseJsonBoolean d f j = runFn7 _caseJson (const d) f (const d) (const d) (const d) (const d) j\n\n-- | A simpler version of `caseJson` which accepts a callback for when the\n-- | `Json` argument was a `Number`, and a default value for all other cases.\ncaseJsonNumber :: forall a. a -> (Number -> a) -> Json -> a\ncaseJsonNumber d f j = runFn7 _caseJson (const d) (const d) f (const d) (const d) (const d) j\n\n-- | A simpler version of `caseJson` which accepts a callback for when the\n-- | `Json` argument was a `String`, and a default value for all other cases.\ncaseJsonString :: forall a. a -> (String -> a) -> Json -> a\ncaseJsonString d f j = runFn7 _caseJson (const d) (const d) (const d) f (const d) (const d) j\n\n-- | A simpler version of `caseJson` which accepts a callback for when the\n-- | `Json` argument was a `Array Json`, and a default value for all other cases.\ncaseJsonArray :: forall a. a -> (Array Json -> a) -> Json -> a\ncaseJsonArray d f j = runFn7 _caseJson (const d) (const d) (const d) (const d) f (const d) j\n\n-- | A simpler version of `caseJson` which accepts a callback for when the\n-- | `Json` argument was an `Object`, and a default value for all other cases.\ncaseJsonObject :: forall a. a -> (Object Json -> a) -> Json -> a\ncaseJsonObject d f j = runFn7 _caseJson (const d) (const d) (const d) (const d) (const d) f j\n\nverbJsonType :: forall a b. b -> (a -> b) -> (b -> (a -> b) -> Json -> b) -> Json -> b\nverbJsonType def f g = g def f\n\n-- Tests\n\nisJsonType :: forall a. (Boolean -> (a -> Boolean) -> Json -> Boolean) -> Json -> Boolean\nisJsonType = verbJsonType false (const true)\n\n-- | Check if the provided `Json` is the `null` value\nisNull :: Json -> Boolean\nisNull = isJsonType caseJsonNull\n\n-- | Check if the provided `Json` is a `Boolean`\nisBoolean :: Json -> Boolean\nisBoolean = isJsonType caseJsonBoolean\n\n-- | Check if the provided `Json` is a `Number`\nisNumber :: Json -> Boolean\nisNumber = isJsonType caseJsonNumber\n\n-- | Check if the provided `Json` is a `String`\nisString :: Json -> Boolean\nisString = isJsonType caseJsonString\n\n-- | Check if the provided `Json` is an `Array`\nisArray :: Json -> Boolean\nisArray = isJsonType caseJsonArray\n\n-- | Check if the provided `Json` is an `Object`\nisObject :: Json -> Boolean\nisObject = isJsonType caseJsonObject\n\n-- Decoding\n\ntoJsonType\n  :: forall a\n   . (Maybe a -> (a -> Maybe a) -> Json -> Maybe a)\n  -> Json\n  -> Maybe a\ntoJsonType = verbJsonType Nothing Just\n\n-- | Convert `Json` to the `Unit` value if the `Json` is the null value\ntoNull :: Json -> Maybe Unit\ntoNull = toJsonType caseJsonNull\n\n-- | Convert `Json` to a `Boolean` value, if the `Json` is a boolean.\ntoBoolean :: Json -> Maybe Boolean\ntoBoolean = toJsonType caseJsonBoolean\n\n-- | Convert `Json` to a `Number` value, if the `Json` is a number.\ntoNumber :: Json -> Maybe Number\ntoNumber = toJsonType caseJsonNumber\n\n-- | Convert `Json` to a `String` value, if the `Json` is a string. To write a\n-- | `Json` value to a JSON string, see `stringify`.\ntoString :: Json -> Maybe String\ntoString = toJsonType caseJsonString\n\n-- | Convert `Json` to an `Array` of `Json` values, if the `Json` is an array.\ntoArray :: Json -> Maybe (Array Json)\ntoArray = toJsonType caseJsonArray\n\n-- | Convert `Json` to an `Object` of `Json` values, if the `Json` is an object.\ntoObject :: Json -> Maybe (Object Json)\ntoObject = toJsonType caseJsonObject\n\n-- Encoding\n\n-- | Construct `Json` from a `Boolean` value\nforeign import fromBoolean :: Boolean -> Json\n\n-- | Construct `Json` from a `Number` value\nforeign import fromNumber :: Number -> Json\n\n-- | Construct the `Json` representation of a `String` value.\n-- | Note that this function only produces `Json` containing a single piece of `String`\n-- | data (similar to `fromBoolean`, `fromNumber`, etc.).\n-- | This function does NOT convert the `String` encoding of a JSON value to `Json` - For that\n-- | purpose, you'll need to use `jsonParser`.\nforeign import fromString :: String -> Json\n\n-- | Construct `Json` from an array of `Json` values\nforeign import fromArray :: Array Json -> Json\n\n-- | Construct `Json` from an object with `Json` values\nforeign import fromObject :: Object Json -> Json\n\n-- Defaults\n\n-- | The JSON null value represented as `Json`\nforeign import jsonNull :: Json\n\n-- | The true boolean value represented as `Json`\njsonTrue :: Json\njsonTrue = fromBoolean true\n\n-- | The false boolean value represented as `Json`\njsonFalse :: Json\njsonFalse = fromBoolean false\n\n-- | The number zero represented as `Json`\njsonZero :: Json\njsonZero = fromNumber 0.0\n\n-- | An empty string represented as `Json`\njsonEmptyString :: Json\njsonEmptyString = fromString \"\"\n\n-- | An empty array represented as `Json`\njsonEmptyArray :: Json\njsonEmptyArray = fromArray []\n\n-- | An empty object represented as `Json`\njsonEmptyObject :: Json\njsonEmptyObject = fromObject Obj.empty\n\n-- | Constructs a `Json` array value containing only the provided value\njsonSingletonArray :: Json -> Json\njsonSingletonArray j = fromArray [ j ]\n\n-- | Constructs a `Json` object value containing only the provided key and value\njsonSingletonObject :: String -> Json -> Json\njsonSingletonObject key val = fromObject (Obj.singleton key val)\n\n-- | Converts a `Json` value to a JSON string. To retrieve a string from a `Json`\n-- | string value, see `fromString`.\nforeign import stringify :: Json -> String\n\n-- | Converts a `Json` value to a JSON string.\n-- | The first `Int` argument specifies the amount of white space characters to use as indentation.\n-- | This number is capped at 10 (if it is greater, the value is just 10). Values less than 1 indicate that no space should be used.\nforeign import stringifyWithIndent :: Int -> Json -> String\n\nforeign import _caseJson\n  :: forall z\n   . Fn7\n       (Unit -> z)\n       (Boolean -> z)\n       (Number -> z)\n       (String -> z)\n       (Array Json -> z)\n       (Object Json -> z)\n       Json\n       z\n\nforeign import _compare :: Fn5 Ordering Ordering Ordering Json Json Ordering\n", "export function _jsonParser(fail, succ, s) {\n  try {\n    return succ(JSON.parse(s));\n  }\n  catch (e) {\n    return fail(e.message);\n  }\n}\n", "module Data.Argonaut.Parser (jsonParser) where\n\nimport Data.Argonaut.Core (Json)\nimport Data.Either (Either(..))\nimport Data.Function.Uncurried (Fn3, runFn3)\n\nforeign import _jsonParser :: forall a. Fn3 (String -> a) (Json -> a) String a\n\n-- | Parse a JSON string, constructing the `Json` value described by the string.\n-- | To convert a string into a `Json` string, see `fromString`.\njsonParser :: String -> Either String Json\njsonParser j = runFn3 _jsonParser Left Right j\n", "export const _localeCompare = function (lt) {\n  return function (eq) {\n    return function (gt) {\n      return function (s1) {\n        return function (s2) {\n          var result = s1.localeCompare(s2);\n          return result < 0 ? lt : result > 0 ? gt : eq;\n        };\n      };\n    };\n  };\n};\n\nexport const replace = function (s1) {\n  return function (s2) {\n    return function (s3) {\n      return s3.replace(s1, s2);\n    };\n  };\n};\n\nexport const replaceAll = function (s1) {\n  return function (s2) {\n    return function (s3) {\n      return s3.replace(new RegExp(s1.replace(/[-\\/\\\\^$*+?.()|[\\]{}]/g, \"\\\\$&\"), \"g\"), s2); // eslint-disable-line no-useless-escape\n    };\n  };\n};\n\nexport const split = function (sep) {\n  return function (s) {\n    return s.split(sep);\n  };\n};\n\nexport const toLower = function (s) {\n  return s.toLowerCase();\n};\n\nexport const toUpper = function (s) {\n  return s.toUpperCase();\n};\n\nexport const trim = function (s) {\n  return s.trim();\n};\n\nexport const joinWith = function (s) {\n  return function (xs) {\n    return xs.join(s);\n  };\n};\n", "module Data.String.Common\n  ( null\n  , localeCompare\n  , replace\n  , replaceAll\n  , split\n  , toLower\n  , toUpper\n  , trim\n  , joinWith\n  ) where\n\nimport Prelude\n\nimport Data.String.Pattern (Pattern, Replacement)\n\n-- | Returns `true` if the given string is empty.\n-- |\n-- | ```purescript\n-- | null \"\" == true\n-- | null \"Hi\" == false\n-- | ```\nnull :: String -> Boolean\nnull s = s == \"\"\n\n-- | Compare two strings in a locale-aware fashion. This is in contrast to\n-- | the `Ord` instance on `String` which treats strings as arrays of code\n-- | units:\n-- |\n-- | ```purescript\n-- | \"\u00E4\" `localeCompare` \"b\" == LT\n-- | \"\u00E4\" `compare` \"b\" == GT\n-- | ```\nlocaleCompare :: String -> String -> Ordering\nlocaleCompare = _localeCompare LT EQ GT\n\nforeign import _localeCompare\n  :: Ordering\n  -> Ordering\n  -> Ordering\n  -> String\n  -> String\n  -> Ordering\n\n-- | Replaces the first occurence of the pattern with the replacement string.\n-- |\n-- | ```purescript\n-- | replace (Pattern \"<=\") (Replacement \"\u2264\") \"a <= b <= c\" == \"a \u2264 b <= c\"\n-- | ```\nforeign import replace :: Pattern -> Replacement -> String -> String\n\n-- | Replaces all occurences of the pattern with the replacement string.\n-- |\n-- | ```purescript\n-- | replaceAll (Pattern \"<=\") (Replacement \"\u2264\") \"a <= b <= c\" == \"a \u2264 b \u2264 c\"\n-- | ```\nforeign import replaceAll :: Pattern -> Replacement -> String -> String\n\n-- | Returns the substrings of the second string separated along occurences\n-- | of the first string.\n-- |\n-- | ```purescript\n-- | split (Pattern \" \") \"hello world\" == [\"hello\", \"world\"]\n-- | ```\nforeign import split :: Pattern -> String -> Array String\n\n-- | Returns the argument converted to lowercase.\n-- |\n-- | ```purescript\n-- | toLower \"hElLo\" == \"hello\"\n-- | ```\nforeign import toLower :: String -> String\n\n-- | Returns the argument converted to uppercase.\n-- |\n-- | ```purescript\n-- | toUpper \"Hello\" == \"HELLO\"\n-- | ```\nforeign import toUpper :: String -> String\n\n-- | Removes whitespace from the beginning and end of a string, including\n-- | [whitespace characters](http://www.ecma-international.org/ecma-262/5.1/#sec-7.2)\n-- | and [line terminators](http://www.ecma-international.org/ecma-262/5.1/#sec-7.3).\n-- |\n-- | ```purescript\n-- | trim \"   Hello  \\n World\\n\\t    \" == \"Hello  \\n World\"\n-- | ```\nforeign import trim :: String -> String\n\n-- | Joins the strings in the array together, inserting the first argument\n-- | as separator between them.\n-- |\n-- | ```purescript\n-- | joinWith \", \" [\"apple\", \"banana\", \"orange\"] == \"apple, banana, orange\"\n-- | ```\nforeign import joinWith :: String -> Array String -> String\n", "// A helper which transforms the result of encodeURIComponent to be compliant\n// with RFC3986, as described in the MDN documentation here:\n//\n// https://web.archive.org/web/20201206001047/https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/encodeURIComponent\nfunction encodeURIComponent_to_RFC3986(input) {\n  return input.replace(/[!'()*]/g, function (c) {\n    return \"%\" + c.charCodeAt(0).toString(16);\n  });\n}\n\n// A helper which transforms the result of encodeURI to be compliant\n// with RFC3986, as described in the MDN documentation here:\n//\n// https://web.archive.org/web/20210117175449/https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/encodeURI#encoding_for_ipv6\nfunction encodeURI_to_RFC3986(input) {\n  return input.replace(/%5B/g, \"[\").replace(/%5D/g, \"]\");\n}\n\nexport function _encodeURIComponent(fail, succeed, input) {\n  try {\n    return succeed(encodeURIComponent_to_RFC3986(encodeURIComponent(input)));\n  } catch (err) {\n    return fail(err);\n  }\n}\n\nexport function _encodeFormURLComponent(fail, succeed, input) {\n  try {\n    return succeed(encodeURIComponent_to_RFC3986(encodeURIComponent(input)).replace(/%20/g, \"+\"));\n  } catch (err) {\n    return fail(err);\n  }\n}\n\nexport function _decodeURIComponent(fail, succeed, input) {\n  try {\n    return succeed(decodeURIComponent(input));\n  } catch (err) {\n    return fail(err);\n  }\n}\n\nexport function _decodeFormURLComponent(fail, succeed, input) {\n  return _decodeURIComponent(fail, succeed, input.replace(/\\+/g, \" \"));\n}\n\nexport function _encodeURI(fail, succeed, input) {\n  try {\n    return succeed(encodeURI_to_RFC3986(encodeURI(input)));\n  } catch (err) {\n    return fail(err);\n  }\n}\n\nexport function _decodeURI(fail, succeed, input) {\n  try {\n    return succeed(decodeURI(input));\n  } catch (err) {\n    return fail(err);\n  }\n}\n", "module JSURI\n  ( encodeURIComponent\n  , encodeFormURLComponent\n  , encodeURI\n  , decodeURIComponent\n  , decodeFormURLComponent\n  , decodeURI\n  ) where\n\nimport Prelude\n\nimport Data.Function.Uncurried (Fn3, runFn3)\nimport Data.Maybe (Maybe(..))\n\nforeign import _encodeURIComponent :: Fn3 (String -> Maybe String) (String -> Maybe String) String (Maybe String)\n\n-- | URI-encode a string according to RFC3896. Implemented using JavaScript's\n-- | `encodeURIComponent`.\n-- |\n-- | ```purs\n-- | > encodeURIComponent \"https://purescript.org\"\n-- | Just \"https%3A%2F%2Fpurescript.org\"\n-- | ```\n-- |\n-- | Encoding a URI can fail with a `URIError` if the string contains malformed\n-- | characters. If you are confident you are encoding a well-formed string then\n-- | you can run this function unsafely:\n-- |\n-- | ```purs\n-- | import Partial.Unsafe (unsafePartial)\n-- | import Data.Maybe (fromJust)\n-- |\n-- | unsafeEncode :: String -> String\n-- | unsafeEncode str = unsafePartial $ fromJust $ encodeURIComponent str\n-- | ```\nencodeURIComponent :: String -> Maybe String\nencodeURIComponent = runFn3 _encodeURIComponent (const Nothing) Just\n\nforeign import _encodeFormURLComponent :: Fn3 (String -> Maybe String) (String -> Maybe String) String (Maybe String)\n\n-- | URI-encode a string according to RFC3896, except with spaces encoded using\n-- | '+' instead of '%20' to comply with application/x-www-form-urlencoded.\n-- |\n-- | ```purs\n-- | > encodeURIComponent \"abc ABC\"\n-- | Just \"abc%20ABC\"\n-- |\n-- | > encodeFormURLComponent \"abc ABC\"\n-- | Just \"abc+ABC\"\n-- | ```\nencodeFormURLComponent :: String -> Maybe String\nencodeFormURLComponent = runFn3 _encodeFormURLComponent (const Nothing) Just\n\nforeign import _decodeURIComponent :: Fn3 (String -> Maybe String) (String -> Maybe String) String (Maybe String)\n\n-- | Decode a URI string according to RFC3896. Implemented using JavaScript's\n-- | `decodeURIComponent`.\n-- |\n-- | ```purs\n-- | > decodeURIComponent \"https%3A%2F%2Fpurescript.org\"\n-- | Just \"https://purescript.org\"\n-- | ```\n-- |\n-- | Decoding a URI can fail with a `URIError` if the string contains malformed\n-- | characters. If you are confident you are encoding a well-formed string then\n-- | you can run this function unsafely:\n-- |\n-- | ```purs\n-- | import Partial.Unsafe (unsafePartial)\n-- | import Data.Maybe (fromJust)\n-- |\n-- | unsafeDecode :: String -> String\n-- | unsafeDecode str = unsafePartial $ fromJust $ decodeURIComponent str\n-- | ```\ndecodeURIComponent :: String -> Maybe String\ndecodeURIComponent = runFn3 _decodeURIComponent (const Nothing) Just\n\nforeign import _decodeFormURLComponent :: Fn3 (String -> Maybe String) (String -> Maybe String) String (Maybe String)\n\n-- | Decode a URI according to application/x-www-form-urlencoded (for example,\n-- | a string containing '+' for spaces or query parameters).\n-- |\n-- | ```purs\n-- | > decodeURIComponent \"https%3A%2F%2Fpurescript.org?search+query\"\n-- | Just \"https://purescript.org?search+query\"\n-- |\n-- | > decodeFormURLComponent \"https%3A%2F%2Fpurescript.org?search+query\"\n-- | Just \"https://purescript.org?search query\"\n-- | ```\ndecodeFormURLComponent :: String -> Maybe String\ndecodeFormURLComponent = runFn3 _decodeFormURLComponent (const Nothing) Just\n\nforeign import _encodeURI :: Fn3 (String -> Maybe String) (String -> Maybe String) String (Maybe String)\n\nencodeURI :: String -> Maybe String\nencodeURI = runFn3 _encodeURI (const Nothing) Just\n\nforeign import _decodeURI :: Fn3 (String -> Maybe String) (String -> Maybe String) String (Maybe String)\n\ndecodeURI :: String -> Maybe String\ndecodeURI = runFn3 _decodeURI (const Nothing) Just\n", "module Data.FormURLEncoded where\n\nimport Prelude\n\nimport Data.Maybe (Maybe(..))\nimport Data.Newtype (class Newtype)\nimport Data.String (joinWith, split) as String\nimport Data.String.Pattern (Pattern(..))\nimport Data.Traversable (traverse)\nimport Data.Tuple (Tuple(..))\nimport JSURI (decodeFormURLComponent, encodeFormURLComponent)\n\n-- | `FormURLEncoded` is an ordered list of key-value pairs with possible duplicates.\nnewtype FormURLEncoded = FormURLEncoded (Array (Tuple String (Maybe String)))\n\n-- | Construct `FormURLEncoded` from an `Array` of key-value pairs.\nfromArray :: Array (Tuple String (Maybe String)) -> FormURLEncoded\nfromArray = FormURLEncoded\n\n-- | View `FormURLEncoded` as an `Array` of key-value pairs.\ntoArray :: FormURLEncoded -> Array (Tuple String (Maybe String))\ntoArray (FormURLEncoded a) = a\n\nderive instance newtypeFormUrlEncoded :: Newtype FormURLEncoded _\nderive newtype instance eqFormUrlEncoded :: Eq FormURLEncoded\nderive newtype instance ordFormUrlEncoded :: Ord FormURLEncoded\nderive newtype instance semigroupFormUrlEncoded :: Semigroup FormURLEncoded\nderive newtype instance monoidFormUrlEncoded :: Monoid FormURLEncoded\n\ninstance showFormUrlEncoded :: Show FormURLEncoded where\n  show (FormURLEncoded kvs) = \"(FormURLEncoded \" <> show kvs <> \")\"\n\n-- | Encode `FormURLEncoded` as `application/x-www-form-urlencoded`.\nencode :: FormURLEncoded -> Maybe String\nencode = map (String.joinWith \"&\") <<< traverse encodePart <<< toArray\n  where\n  encodePart = case _ of\n    Tuple k Nothing -> encodeFormURLComponent k\n    Tuple k (Just v) -> (\\key val -> key <> \"=\" <> val) <$> encodeFormURLComponent k <*> encodeFormURLComponent v\n\n-- | Decode `FormURLEncoded` from `application/x-www-form-urlencoded`.\ndecode :: String -> Maybe FormURLEncoded\ndecode = map FormURLEncoded <<< traverse decodePart <<< String.split (Pattern \"&\")\n  where\n  decodePart = String.split (Pattern \"=\") >>> case _ of\n    [ k, v ] -> (\\key val -> Tuple key $ Just val) <$> decodeFormURLComponent k <*> decodeFormURLComponent v\n    [ k ] -> Tuple <$> decodeFormURLComponent k <*> pure Nothing\n    _ -> Nothing\n", "module Data.HTTP.Method\n  ( Method(..)\n  , CustomMethod\n  , unCustomMethod\n  , fromString\n  , print\n  ) where\n\nimport Prelude\n\nimport Data.Either (Either(..), either)\nimport Data.String as Str\n\n-- | The definition of the type is based on HTTP/1.1 with\n-- | [RFC 2518](https://tools.ietf.org/html/rfc2518) and\n-- | [RFC 5789](https://tools.ietf.org/html/rfc5789).\ndata Method\n  -- HTTP/1.1\n  = OPTIONS\n  | GET\n  | HEAD\n  | POST\n  | PUT\n  | DELETE\n  | TRACE\n  | CONNECT\n\n  -- RFC 2518\n  | PROPFIND\n  | PROPPATCH\n  | MKCOL\n  | COPY\n  | MOVE\n  | LOCK\n  | UNLOCK\n\n  -- RFC5789\n  | PATCH\n\nderive instance eqMethod :: Eq Method\nderive instance ordMethod :: Ord Method\n\ninstance showMethod :: Show Method where\n  show OPTIONS = \"OPTIONS\"\n  show GET = \"GET\"\n  show HEAD = \"HEAD\"\n  show POST = \"POST\"\n  show PUT = \"PUT\"\n  show DELETE = \"DELETE\"\n  show TRACE = \"TRACE\"\n  show CONNECT = \"CONNECT\"\n  show PROPFIND = \"PROPFIND\"\n  show PROPPATCH = \"PROPPATCH\"\n  show MKCOL = \"MKCOL\"\n  show COPY = \"COPY\"\n  show MOVE = \"MOVE\"\n  show LOCK = \"LOCK\"\n  show UNLOCK = \"UNLOCK\"\n  show PATCH = \"PATCH\"\n\nnewtype CustomMethod = CustomMethod String\n\nunCustomMethod :: CustomMethod -> String\nunCustomMethod (CustomMethod m) = m\n\nderive instance eqCustomMethod :: Eq CustomMethod\nderive instance ordCustomMethod :: Ord CustomMethod\n\ninstance showCustomMethod :: Show CustomMethod where\n  show (CustomMethod m) = \"(CustomMethod \" <> show m <> \")\"\n\n-- | Parses a `String` into a `Method` and pass the result into the first\n-- | handler. If the string does not match a known method,\n-- | passes itself into the second handler.\nparse :: forall c. (Method -> c) -> (String -> c) -> String -> c\nparse handleMethod handleUnknown s =\n  case Str.toUpper s of\n    \"OPTIONS\" -> handleMethod OPTIONS\n    \"GET\" -> handleMethod GET\n    \"HEAD\" -> handleMethod HEAD\n    \"POST\" -> handleMethod POST\n    \"PUT\" -> handleMethod PUT\n    \"DELETE\" -> handleMethod DELETE\n    \"TRACE\" -> handleMethod TRACE\n    \"CONNECT\" -> handleMethod CONNECT\n    \"PROPFIND\" -> handleMethod PROPFIND\n    \"PROPPATCH\" -> handleMethod PROPPATCH\n    \"MKCOL\" -> handleMethod MKCOL\n    \"COPY\" -> handleMethod COPY\n    \"MOVE\" -> handleMethod MOVE\n    \"LOCK\" -> handleMethod LOCK\n    \"UNLOCK\" -> handleMethod UNLOCK\n    \"PATCH\" -> handleMethod PATCH\n    m -> handleUnknown m\n\nfromString :: String -> Either Method CustomMethod\nfromString = parse Left (Right <<< CustomMethod)\n\nprint :: Either Method CustomMethod -> String\nprint = either show unCustomMethod\n", "-- | This module defines a generic non-empty data structure, which adds an\n-- | additional element to any container type.\nmodule Data.NonEmpty\n  ( NonEmpty(..)\n  , singleton\n  , (:|)\n  , foldl1\n  , fromNonEmpty\n  , oneOf\n  , head\n  , tail\n  ) where\n\nimport Prelude\n\nimport Control.Alt ((<|>))\nimport Control.Alternative (class Alternative)\nimport Control.Plus (class Plus, empty)\nimport Data.Eq (class Eq1)\nimport Data.Foldable (class Foldable, foldl, foldr, foldMap)\nimport Data.FoldableWithIndex (class FoldableWithIndex, foldMapWithIndex, foldlWithIndex, foldrWithIndex)\nimport Data.FunctorWithIndex (class FunctorWithIndex, mapWithIndex)\nimport Data.Maybe (Maybe(..), maybe)\nimport Data.Ord (class Ord1)\nimport Data.Semigroup.Foldable (class Foldable1)\nimport Data.Semigroup.Foldable (foldl1) as Foldable1\nimport Data.Traversable (class Traversable, traverse, sequence)\nimport Data.TraversableWithIndex (class TraversableWithIndex, traverseWithIndex)\nimport Data.Tuple (uncurry)\nimport Data.Unfoldable (class Unfoldable, unfoldr)\nimport Data.Unfoldable1 (class Unfoldable1)\n\n-- | A non-empty container of elements of type a.\n-- |\n-- | ```purescript\n-- | import Data.NonEmpty\n-- |\n-- | nonEmptyArray :: NonEmpty Array Int\n-- | nonEmptyArray = NonEmpty 1 [2,3]\n-- |\n-- | import Data.List(List(..), (:))\n-- |\n-- | nonEmptyList :: NonEmpty List Int\n-- | nonEmptyList = NonEmpty 1 (2 : 3 : Nil)\n-- | ```\ndata NonEmpty f a = NonEmpty a (f a)\n\n-- | An infix synonym for `NonEmpty`.\n-- |\n-- | ```purescript\n-- | nonEmptyArray :: NonEmpty Array Int\n-- | nonEmptyArray = 1 :| [2,3]\n-- |\n-- | nonEmptyList :: NonEmpty List Int\n-- | nonEmptyList = 1 :| 2 : 3 : Nil\n-- | ```\ninfixr 5 NonEmpty as :|\n\n-- | Create a non-empty structure with a single value.\n-- |\n-- | ```purescript\n-- | import Prelude\n-- |\n-- | singleton 1 == 1 :| []\n-- | singleton 1 == 1 :| Nil\n-- | ```\nsingleton :: forall f a. Plus f => a -> NonEmpty f a\nsingleton a = a :| empty\n\n-- | Fold a non-empty structure, collecting results using a binary operation.\n-- |\n-- | ```purescript\n-- | foldl1 (+) (1 :| [2, 3]) == 6\n-- | ```\nfoldl1 :: forall f a. Foldable f => (a -> a -> a) -> NonEmpty f a -> a\nfoldl1 = Foldable1.foldl1\n\n-- | Apply a function that takes the `first` element and remaining elements\n-- | as arguments to a non-empty container.\n-- |\n-- | For example, return the remaining elements multiplied by the first element:\n-- |\n-- | ```purescript\n-- | fromNonEmpty (\\x xs -> map (_ * x) xs) (3 :| [2, 1]) == [6, 3]\n-- | ```\nfromNonEmpty :: forall f a r. (a -> f a -> r) -> NonEmpty f a -> r\nfromNonEmpty f (a :| fa) = a `f` fa\n\n-- | Returns the `alt` (`<|>`) result of:\n-- | - The first element lifted to the container of the remaining elements.\n-- | - The remaining elements.\n-- |\n-- | ```purescript\n-- | import Data.Maybe(Maybe(..))\n-- |\n-- | oneOf (1 :| Nothing) == Just 1\n-- | oneOf (1 :| Just 2) == Just 1\n-- |\n-- | oneOf (1 :| [2, 3]) == [1,2,3]\n-- | ```\noneOf :: forall f a. Alternative f => NonEmpty f a -> f a\noneOf (a :| fa) = pure a <|> fa\n\n-- | Get the 'first' element of a non-empty container.\n-- |\n-- | ```purescript\n-- | head (1 :| [2, 3]) == 1\n-- | ```\nhead :: forall f a. NonEmpty f a -> a\nhead (x :| _) = x\n\n-- | Get everything but the 'first' element of a non-empty container.\n-- |\n-- | ```purescript\n-- | tail (1 :| [2, 3]) == [2, 3]\n-- | ```\ntail :: forall f a. NonEmpty f a -> f a\ntail (_ :| xs) = xs\n\ninstance showNonEmpty :: (Show a, Show (f a)) => Show (NonEmpty f a) where\n  show (a :| fa) = \"(NonEmpty \" <> show a <> \" \" <> show fa <> \")\"\n\nderive instance eqNonEmpty :: (Eq1 f, Eq a) => Eq (NonEmpty f a)\n\nderive instance eq1NonEmpty :: Eq1 f => Eq1 (NonEmpty f)\n\nderive instance ordNonEmpty :: (Ord1 f, Ord a) => Ord (NonEmpty f a)\n\nderive instance ord1NonEmpty :: Ord1 f => Ord1 (NonEmpty f)\n\nderive instance functorNonEmpty :: Functor f => Functor (NonEmpty f)\n\ninstance functorWithIndex\n  :: FunctorWithIndex i f\n  => FunctorWithIndex (Maybe i) (NonEmpty f) where\n  mapWithIndex f (a :| fa) = f Nothing a :| mapWithIndex (f <<< Just) fa\n\ninstance foldableNonEmpty :: Foldable f => Foldable (NonEmpty f) where\n  foldMap f (a :| fa) = f a <> foldMap f fa\n  foldl f b (a :| fa) = foldl f (f b a) fa\n  foldr f b (a :| fa) = f a (foldr f b fa)\n\ninstance foldableWithIndexNonEmpty\n  :: (FoldableWithIndex i f)\n  => FoldableWithIndex (Maybe i) (NonEmpty f) where\n  foldMapWithIndex f (a :| fa) = f Nothing a <> foldMapWithIndex (f <<< Just) fa\n  foldlWithIndex f b (a :| fa) = foldlWithIndex (f <<< Just) (f Nothing b a) fa\n  foldrWithIndex f b (a :| fa) = f Nothing a (foldrWithIndex (f <<< Just) b fa)\n\ninstance traversableNonEmpty :: Traversable f => Traversable (NonEmpty f) where\n  sequence (a :| fa) = NonEmpty <$> a <*> sequence fa\n  traverse f (a :| fa) = NonEmpty <$> f a <*> traverse f fa\n\ninstance traversableWithIndexNonEmpty\n  :: (TraversableWithIndex i f)\n  => TraversableWithIndex (Maybe i) (NonEmpty f) where\n  traverseWithIndex f (a :| fa) =\n    NonEmpty <$> f Nothing a <*> traverseWithIndex (f <<< Just) fa\n\ninstance foldable1NonEmpty :: Foldable f => Foldable1 (NonEmpty f) where\n  foldMap1 f (a :| fa) = foldl (\\s a1 -> s <> f a1) (f a) fa\n  foldr1 f (a :| fa) = maybe a (f a) $ foldr (\\a1 -> Just <<< maybe a1 (f a1)) Nothing fa\n  foldl1 f (a :| fa) = foldl f a fa\n\ninstance unfoldable1NonEmpty :: Unfoldable f => Unfoldable1 (NonEmpty f) where\n  unfoldr1 f b = uncurry (:|) $ unfoldr (map f) <$> f b\n\n-- | This is a lawful `Semigroup` instance that will behave sensibly for common nonempty\n-- | containers like lists and arrays. However, it's not guaranteed that `pure` will behave\n-- | sensibly alongside `<>` for all types, as we don't have any laws which govern their behavior.\ninstance semigroupNonEmpty\n  :: (Applicative f, Semigroup (f a))\n  => Semigroup (NonEmpty f a) where\n  append (a1 :| f1) (a2 :| f2) = a1 :| (f1 <> pure a2 <> f2)\n", "module Data.List.Types\n  ( List(..)\n  , (:)\n  , NonEmptyList(..)\n  , toList\n  , nelCons\n  ) where\n\nimport Prelude\n\nimport Control.Alt (class Alt)\nimport Control.Alternative (class Alternative)\nimport Control.Apply (lift2)\nimport Control.Comonad (class Comonad)\nimport Control.Extend (class Extend)\nimport Control.MonadPlus (class MonadPlus)\nimport Control.Plus (class Plus)\nimport Data.Eq (class Eq1, eq1)\nimport Data.Foldable (class Foldable, foldl, foldr, intercalate)\nimport Data.FoldableWithIndex (class FoldableWithIndex, foldlWithIndex, foldrWithIndex, foldMapWithIndex)\nimport Data.FunctorWithIndex (class FunctorWithIndex, mapWithIndex)\nimport Data.Maybe (Maybe(..), maybe)\nimport Data.Newtype (class Newtype)\nimport Data.NonEmpty (NonEmpty, (:|))\nimport Data.NonEmpty as NE\nimport Data.Ord (class Ord1, compare1)\nimport Data.Semigroup.Foldable (class Foldable1)\nimport Data.Semigroup.Traversable (class Traversable1, traverse1)\nimport Data.Traversable (class Traversable, traverse)\nimport Data.TraversableWithIndex (class TraversableWithIndex, traverseWithIndex)\nimport Data.Tuple (Tuple(..), snd)\nimport Data.Unfoldable (class Unfoldable)\nimport Data.Unfoldable1 (class Unfoldable1)\n\ndata List a = Nil | Cons a (List a)\n\ninfixr 6 Cons as :\n\ninstance showList :: Show a => Show (List a) where\n  show Nil = \"Nil\"\n  show xs = \"(\" <> intercalate \" : \" (show <$> xs) <> \" : Nil)\"\n\ninstance eqList :: Eq a => Eq (List a) where\n  eq = eq1\n\ninstance eq1List :: Eq1 List where\n  eq1 xs ys = go xs ys true\n    where\n      go _ _ false = false\n      go Nil Nil acc = acc\n      go (x : xs') (y : ys') acc = go xs' ys' $ acc && (y == x)\n      go _ _ _ = false\n\ninstance ordList :: Ord a => Ord (List a) where\n  compare = compare1\n\ninstance ord1List :: Ord1 List where\n  compare1 xs ys = go xs ys\n    where\n    go Nil Nil = EQ\n    go Nil _ = LT\n    go _ Nil = GT\n    go (x : xs') (y : ys') =\n      case compare x y of\n        EQ -> go xs' ys'\n        other -> other\n\ninstance semigroupList :: Semigroup (List a) where\n  append xs ys = foldr (:) ys xs\n\ninstance monoidList :: Monoid (List a) where\n  mempty = Nil\n\ninstance functorList :: Functor List where\n  map = listMap\n\n-- chunked list Functor inspired by OCaml\n-- https://discuss.ocaml.org/t/a-new-list-map-that-is-both-stack-safe-and-fast/865\n-- chunk sizes determined through experimentation\nlistMap :: forall a b. (a -> b) -> List a -> List b\nlistMap f = chunkedRevMap Nil\n  where\n  chunkedRevMap :: List (List a) -> List a -> List b\n  chunkedRevMap chunksAcc chunk@(_ : _ : _ : xs) =\n    chunkedRevMap (chunk : chunksAcc) xs\n  chunkedRevMap chunksAcc xs =\n    reverseUnrolledMap chunksAcc $ unrolledMap xs\n    where\n    unrolledMap :: List a -> List b\n    unrolledMap (x1 : x2 : Nil) = f x1 : f x2 : Nil\n    unrolledMap (x1 : Nil) = f x1 : Nil\n    unrolledMap _ = Nil\n\n    reverseUnrolledMap :: List (List a) -> List b -> List b\n    reverseUnrolledMap ((x1 : x2 : x3 : _) : cs) acc =\n      reverseUnrolledMap cs (f x1 : f x2 : f x3 : acc)\n    reverseUnrolledMap _ acc = acc\n\ninstance functorWithIndexList :: FunctorWithIndex Int List where\n  mapWithIndex f = foldrWithIndex (\\i x acc -> f i x : acc) Nil\n\ninstance foldableList :: Foldable List where\n  foldr f b = foldl (flip f) b <<< rev\n    where\n    rev = go Nil\n      where\n      go acc Nil = acc\n      go acc (x : xs) = go (x : acc) xs\n  foldl f = go\n    where\n    go b = case _ of\n      Nil -> b\n      a : as -> go (f b a) as\n  foldMap f = foldl (\\acc -> append acc <<< f) mempty\n\ninstance foldableWithIndexList :: FoldableWithIndex Int List where\n  foldrWithIndex f b xs =\n    -- as we climb the reversed list, we decrement the index\n    snd $ foldl\n            (\\(Tuple i b') a -> Tuple (i - 1) (f (i - 1) a b'))\n            (Tuple len b)\n            revList\n    where\n    Tuple len revList = rev (Tuple 0 Nil) xs\n      where\n      -- As we create our reversed list, we count elements.\n      rev = foldl (\\(Tuple i acc) a -> Tuple (i + 1) (a : acc))\n  foldlWithIndex f acc =\n    snd <<< foldl (\\(Tuple i b) a -> Tuple (i + 1) (f i b a)) (Tuple 0 acc)\n  foldMapWithIndex f = foldlWithIndex (\\i acc -> append acc <<< f i) mempty\n\ninstance unfoldable1List :: Unfoldable1 List where\n  unfoldr1 f b = go b Nil\n    where\n    go source memo = case f source of\n      Tuple one (Just rest) -> go rest (one : memo)\n      Tuple one Nothing -> foldl (flip (:)) Nil (one : memo)\n\ninstance unfoldableList :: Unfoldable List where\n  unfoldr f b = go b Nil\n    where\n    go source memo = case f source of\n      Nothing -> (foldl (flip (:)) Nil memo)\n      Just (Tuple one rest) -> go rest (one : memo)\n\ninstance traversableList :: Traversable List where\n  traverse f = map (foldl (flip (:)) Nil) <<< foldl (\\acc -> lift2 (flip (:)) acc <<< f) (pure Nil)\n  sequence = traverse identity\n\ninstance traversableWithIndexList :: TraversableWithIndex Int List where\n  traverseWithIndex f =\n    map rev\n    <<< foldlWithIndex (\\i acc -> lift2 (flip (:)) acc <<< f i) (pure Nil)\n    where\n    rev = foldl (flip Cons) Nil\n\ninstance applyList :: Apply List where\n  apply Nil _ = Nil\n  apply (f : fs) xs = (f <$> xs) <> (fs <*> xs)\n\ninstance applicativeList :: Applicative List where\n  pure a = a : Nil\n\ninstance bindList :: Bind List where\n  bind Nil _ = Nil\n  bind (x : xs) f = f x <> bind xs f\n\ninstance monadList :: Monad List\n\ninstance altList :: Alt List where\n  alt = append\n\ninstance plusList :: Plus List where\n  empty = Nil\n\ninstance alternativeList :: Alternative List\n\ninstance monadPlusList :: MonadPlus List\n\ninstance extendList :: Extend List where\n  extend _ Nil = Nil\n  extend f l@(_ : as) =\n    f l : (foldr go { val: Nil, acc: Nil } as).val\n    where\n    go a' { val, acc } =\n      let acc' = a' : acc\n      in { val: f acc' : val, acc: acc' }\n\nnewtype NonEmptyList a = NonEmptyList (NonEmpty List a)\n\ntoList :: NonEmptyList ~> List\ntoList (NonEmptyList (x :| xs)) = x : xs\n\nnelCons :: forall a. a -> NonEmptyList a -> NonEmptyList a\nnelCons a (NonEmptyList (b :| bs)) = NonEmptyList (a :| b : bs)\n\nderive instance newtypeNonEmptyList :: Newtype (NonEmptyList a) _\n\nderive newtype instance eqNonEmptyList :: Eq a => Eq (NonEmptyList a)\nderive newtype instance ordNonEmptyList :: Ord a => Ord (NonEmptyList a)\n\nderive newtype instance eq1NonEmptyList :: Eq1 NonEmptyList\nderive newtype instance ord1NonEmptyList :: Ord1 NonEmptyList\n\ninstance showNonEmptyList :: Show a => Show (NonEmptyList a) where\n  show (NonEmptyList nel) = \"(NonEmptyList \" <> show nel <> \")\"\n\nderive newtype instance functorNonEmptyList :: Functor NonEmptyList\n\ninstance applyNonEmptyList :: Apply NonEmptyList where\n  apply (NonEmptyList (f :| fs)) (NonEmptyList (a :| as)) =\n    NonEmptyList (f a :| (fs <*> a : Nil) <> ((f : fs) <*> as))\n\ninstance applicativeNonEmptyList :: Applicative NonEmptyList where\n  pure = NonEmptyList <<< NE.singleton\n\ninstance bindNonEmptyList :: Bind NonEmptyList where\n  bind (NonEmptyList (a :| as)) f =\n    case f a of\n      NonEmptyList (b :| bs) ->\n        NonEmptyList (b :| bs <> bind as (toList <<< f))\n\ninstance monadNonEmptyList :: Monad NonEmptyList\n\ninstance altNonEmptyList :: Alt NonEmptyList where\n  alt = append\n\ninstance extendNonEmptyList :: Extend NonEmptyList where\n  extend f w@(NonEmptyList (_ :| as)) =\n    NonEmptyList (f w :| (foldr go { val: Nil, acc: Nil } as).val)\n    where\n    go a { val, acc } = { val: f (NonEmptyList (a :| acc)) : val, acc: a : acc }\n\ninstance comonadNonEmptyList :: Comonad NonEmptyList where\n  extract (NonEmptyList (a :| _)) = a\n\ninstance semigroupNonEmptyList :: Semigroup (NonEmptyList a) where\n  append (NonEmptyList (a :| as)) as' =\n    NonEmptyList (a :| as <> toList as')\n\nderive newtype instance foldableNonEmptyList :: Foldable NonEmptyList\n\nderive newtype instance traversableNonEmptyList :: Traversable NonEmptyList\n\nderive newtype instance foldable1NonEmptyList :: Foldable1 NonEmptyList\n\nderive newtype instance unfoldable1NonEmptyList :: Unfoldable1 NonEmptyList\n\ninstance functorWithIndexNonEmptyList :: FunctorWithIndex Int NonEmptyList where\n  mapWithIndex fn (NonEmptyList ne) = NonEmptyList $ mapWithIndex (fn <<< maybe 0 (add 1)) ne\n\ninstance foldableWithIndexNonEmptyList :: FoldableWithIndex Int NonEmptyList where\n  foldMapWithIndex f (NonEmptyList ne) = foldMapWithIndex (f <<< maybe 0 (add 1)) ne\n  foldlWithIndex f b (NonEmptyList ne) = foldlWithIndex (f <<< maybe 0 (add 1)) b ne\n  foldrWithIndex f b (NonEmptyList ne) = foldrWithIndex (f <<< maybe 0 (add 1)) b ne\n\ninstance traversableWithIndexNonEmptyList :: TraversableWithIndex Int NonEmptyList where\n  traverseWithIndex f (NonEmptyList ne) = NonEmptyList <$> traverseWithIndex (f <<< maybe 0 (add 1)) ne\n\ninstance traversable1NonEmptyList :: Traversable1 NonEmptyList where\n  traverse1 f (NonEmptyList (a :| as)) =\n    foldl (\\acc -> lift2 (flip nelCons) acc <<< f) (pure <$> f a) as\n      <#> case _ of NonEmptyList (x :| xs) \u2192 foldl (flip nelCons) (pure x) xs\n  sequence1 = traverse1 identity\n", "-- | This module defines a type of _strict_ linked lists, and associated helper\n-- | functions and type class instances.\n-- |\n-- | _Note_: Depending on your use-case, you may prefer to use\n-- | `Data.Sequence` instead, which might give better performance for certain\n-- | use cases. This module is an improvement over `Data.Array` when working with\n-- | immutable lists of data in a purely-functional setting, but does not have\n-- | good random-access performance.\n\nmodule Data.List\n  ( module Data.List.Types\n  , toUnfoldable\n  , fromFoldable\n\n  , singleton\n  , (..), range\n  , some\n  , someRec\n  , many\n  , manyRec\n\n  , null\n  , length\n\n  , snoc\n  , insert\n  , insertBy\n\n  , head\n  , last\n  , tail\n  , init\n  , uncons\n  , unsnoc\n\n  , (!!), index\n  , elemIndex\n  , elemLastIndex\n  , findIndex\n  , findLastIndex\n  , insertAt\n  , deleteAt\n  , updateAt\n  , modifyAt\n  , alterAt\n\n  , reverse\n  , concat\n  , concatMap\n  , filter\n  , filterM\n  , mapMaybe\n  , catMaybes\n\n  , sort\n  , sortBy\n\n  , Pattern(..)\n  , stripPrefix\n  , slice\n  , take\n  , takeEnd\n  , takeWhile\n  , drop\n  , dropEnd\n  , dropWhile\n  , span\n  , group\n  , groupAll\n  , groupBy\n  , groupAllBy\n  , partition\n\n  , nub\n  , nubBy\n  , nubEq\n  , nubByEq\n  , union\n  , unionBy\n  , delete\n  , deleteBy\n  , (\\\\), difference\n  , intersect\n  , intersectBy\n\n  , zipWith\n  , zipWithA\n  , zip\n  , unzip\n\n  , transpose\n\n  , foldM\n\n  , module Exports\n  ) where\n\nimport Prelude\n\nimport Control.Alt ((<|>))\nimport Control.Alternative (class Alternative)\nimport Control.Lazy (class Lazy, defer)\nimport Control.Monad.Rec.Class (class MonadRec, Step(..), tailRecM, tailRecM2)\nimport Data.Bifunctor (bimap)\nimport Data.Foldable (class Foldable, foldr, any, foldl)\nimport Data.Foldable (foldl, foldr, foldMap, fold, intercalate, elem, notElem, find, findMap, any, all) as Exports\nimport Data.List.Internal (emptySet, insertAndLookupBy)\nimport Data.List.Types (List(..), (:))\nimport Data.List.Types (NonEmptyList(..)) as NEL\nimport Data.Maybe (Maybe(..))\nimport Data.Newtype (class Newtype)\nimport Data.NonEmpty ((:|))\nimport Data.Traversable (scanl, scanr) as Exports\nimport Data.Traversable (sequence)\nimport Data.Tuple (Tuple(..))\nimport Data.Unfoldable (class Unfoldable, unfoldr)\n\n-- | Convert a list into any unfoldable structure.\n-- |\n-- | Running time: `O(n)`\ntoUnfoldable :: forall f. Unfoldable f => List ~> f\ntoUnfoldable = unfoldr (\\xs -> (\\rec -> Tuple rec.head rec.tail) <$> uncons xs)\n\n-- | Construct a list from a foldable structure.\n-- |\n-- | Running time: `O(n)`\nfromFoldable :: forall f. Foldable f => f ~> List\nfromFoldable = foldr Cons Nil\n\n--------------------------------------------------------------------------------\n-- List creation ---------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Create a list with a single element.\n-- |\n-- | Running time: `O(1)`\nsingleton :: forall a. a -> List a\nsingleton a = a : Nil\n\n-- | An infix synonym for `range`.\ninfix 8 range as ..\n\n-- | Create a list containing a range of integers, including both endpoints.\nrange :: Int -> Int -> List Int\nrange start end | start == end = singleton start\n                | otherwise = go end start (if start > end then 1 else -1) Nil\n  where\n  go s e step rest | s == e = s : rest\n                   | otherwise = go (s + step) e step (s : rest)\n\n-- | Attempt a computation multiple times, requiring at least one success.\n-- |\n-- | The `Lazy` constraint is used to generate the result lazily, to ensure\n-- | termination.\nsome :: forall f a. Alternative f => Lazy (f (List a)) => f a -> f (List a)\nsome v = Cons <$> v <*> defer (\\_ -> many v)\n\n-- | A stack-safe version of `some`, at the cost of a `MonadRec` constraint.\nsomeRec :: forall f a. MonadRec f => Alternative f => f a -> f (List a)\nsomeRec v = Cons <$> v <*> manyRec v\n\n-- | Attempt a computation multiple times, returning as many successful results\n-- | as possible (possibly zero).\n-- |\n-- | The `Lazy` constraint is used to generate the result lazily, to ensure\n-- | termination.\nmany :: forall f a. Alternative f => Lazy (f (List a)) => f a -> f (List a)\nmany v = some v <|> pure Nil\n\n-- | A stack-safe version of `many`, at the cost of a `MonadRec` constraint.\nmanyRec :: forall f a. MonadRec f => Alternative f => f a -> f (List a)\nmanyRec p = tailRecM go Nil\n  where\n  go :: List a -> f (Step (List a) (List a))\n  go acc = do\n    aa <- (Loop <$> p) <|> pure (Done unit)\n    pure $ bimap (_ : acc) (\\_ -> reverse acc) aa\n\n--------------------------------------------------------------------------------\n-- List size -------------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Test whether a list is empty.\n-- |\n-- | Running time: `O(1)`\nnull :: forall a. List a -> Boolean\nnull Nil = true\nnull _ = false\n\n-- | Get the length of a list\n-- |\n-- | Running time: `O(n)`\nlength :: forall a. List a -> Int\nlength = foldl (\\acc _ -> acc + 1) 0\n\n--------------------------------------------------------------------------------\n-- Extending lists -------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Append an element to the end of a list, creating a new list.\n-- |\n-- | Running time: `O(n)`\nsnoc :: forall a. List a -> a -> List a\nsnoc xs x = foldr (:) (x : Nil) xs\n\n-- | Insert an element into a sorted list.\n-- |\n-- | Running time: `O(n)`\ninsert :: forall a. Ord a => a -> List a -> List a\ninsert = insertBy compare\n\n-- | Insert an element into a sorted list, using the specified function to\n-- | determine the ordering of elements.\n-- |\n-- | Running time: `O(n)`\ninsertBy :: forall a. (a -> a -> Ordering) -> a -> List a -> List a\ninsertBy _ x Nil = singleton x\ninsertBy cmp x ys@(y : ys') =\n  case cmp x y of\n    GT -> y : (insertBy cmp x ys')\n    _  -> x : ys\n\n--------------------------------------------------------------------------------\n-- Non-indexed reads -----------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Get the first element in a list, or `Nothing` if the list is empty.\n-- |\n-- | Running time: `O(1)`.\nhead :: List ~> Maybe\nhead Nil = Nothing\nhead (x : _) = Just x\n\n-- | Get the last element in a list, or `Nothing` if the list is empty.\n-- |\n-- | Running time: `O(n)`.\nlast :: List ~> Maybe\nlast (x : Nil) = Just x\nlast (_ : xs)  = last xs\nlast _         = Nothing\n\n-- | Get all but the first element of a list, or `Nothing` if the list is empty.\n-- |\n-- | Running time: `O(1)`\ntail :: forall a. List a -> Maybe (List a)\ntail Nil = Nothing\ntail (_ : xs) = Just xs\n\n-- | Get all but the last element of a list, or `Nothing` if the list is empty.\n-- |\n-- | Running time: `O(n)`\ninit :: forall a. List a -> Maybe (List a)\ninit lst = _.init <$> unsnoc lst\n\n-- | Break a list into its first element, and the remaining elements,\n-- | or `Nothing` if the list is empty.\n-- |\n-- | Running time: `O(1)`\nuncons :: forall a. List a -> Maybe { head :: a, tail :: List a }\nuncons Nil = Nothing\nuncons (x : xs) = Just { head: x, tail: xs }\n\n-- | Break a list into its last element, and the preceding elements,\n-- | or `Nothing` if the list is empty.\n-- |\n-- | Running time: `O(n)`\nunsnoc :: forall a. List a -> Maybe { init :: List a, last :: a }\nunsnoc lst = (\\h -> { init: reverse h.revInit, last: h.last }) <$> go lst Nil\n  where\n  go Nil _ = Nothing\n  go (x : Nil) acc = Just { revInit: acc, last: x }\n  go (x : xs) acc = go xs (x : acc)\n\n--------------------------------------------------------------------------------\n-- Indexed operations ----------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Get the element at the specified index, or `Nothing` if the index is out-of-bounds.\n-- |\n-- | Running time: `O(n)` where `n` is the required index.\nindex :: forall a. List a -> Int -> Maybe a\nindex Nil _ = Nothing\nindex (a : _) 0 = Just a\nindex (_ : as) i = index as (i - 1)\n\n-- | An infix synonym for `index`.\ninfixl 8 index as !!\n\n-- | Find the index of the first element equal to the specified element.\nelemIndex :: forall a. Eq a => a -> List a -> Maybe Int\nelemIndex x = findIndex (_ == x)\n\n-- | Find the index of the last element equal to the specified element.\nelemLastIndex :: forall a. Eq a => a -> List a -> Maybe Int\nelemLastIndex x = findLastIndex (_ == x)\n\n-- | Find the first index for which a predicate holds.\nfindIndex :: forall a. (a -> Boolean) -> List a -> Maybe Int\nfindIndex fn = go 0\n  where\n  go :: Int -> List a -> Maybe Int\n  go n (x : xs) | fn x = Just n\n                | otherwise = go (n + 1) xs\n  go _ Nil = Nothing\n\n-- | Find the last index for which a predicate holds.\nfindLastIndex :: forall a. (a -> Boolean) -> List a -> Maybe Int\nfindLastIndex fn xs = ((length xs - 1) - _) <$> findIndex fn (reverse xs)\n\n-- | Insert an element into a list at the specified index, returning a new\n-- | list or `Nothing` if the index is out-of-bounds.\n-- |\n-- | Running time: `O(n)`\ninsertAt :: forall a. Int -> a -> List a -> Maybe (List a)\ninsertAt 0 x xs = Just (x : xs)\ninsertAt n x (y : ys) = (y : _) <$> insertAt (n - 1) x ys\ninsertAt _ _ _  = Nothing\n\n-- | Delete an element from a list at the specified index, returning a new\n-- | list or `Nothing` if the index is out-of-bounds.\n-- |\n-- | Running time: `O(n)`\ndeleteAt :: forall a. Int -> List a -> Maybe (List a)\ndeleteAt 0 (_ : ys) = Just ys\ndeleteAt n (y : ys) = (y : _) <$> deleteAt (n - 1) ys\ndeleteAt _ _  = Nothing\n\n-- | Update the element at the specified index, returning a new\n-- | list or `Nothing` if the index is out-of-bounds.\n-- |\n-- | Running time: `O(n)`\nupdateAt :: forall a. Int -> a -> List a -> Maybe (List a)\nupdateAt 0 x ( _ : xs) = Just (x : xs)\nupdateAt n x (x1 : xs) = (x1 : _) <$> updateAt (n - 1) x xs\nupdateAt _ _ _ = Nothing\n\n-- | Update the element at the specified index by applying a function to\n-- | the current value, returning a new list or `Nothing` if the index is\n-- | out-of-bounds.\n-- |\n-- | Running time: `O(n)`\nmodifyAt :: forall a. Int -> (a -> a) -> List a -> Maybe (List a)\nmodifyAt n f = alterAt n (Just <<< f)\n\n-- | Update or delete the element at the specified index by applying a\n-- | function to the current value, returning a new list or `Nothing` if the\n-- | index is out-of-bounds.\n-- |\n-- | Running time: `O(n)`\nalterAt :: forall a. Int -> (a -> Maybe a) -> List a -> Maybe (List a)\nalterAt 0 f (y : ys) = Just $\n  case f y of\n    Nothing -> ys\n    Just y' -> y' : ys\nalterAt n f (y : ys) = (y : _) <$> alterAt (n - 1) f ys\nalterAt _ _ _  = Nothing\n\n--------------------------------------------------------------------------------\n-- Transformations -------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Reverse a list.\n-- |\n-- | Running time: `O(n)`\nreverse :: List ~> List\nreverse = go Nil\n  where\n  go acc Nil = acc\n  go acc (x : xs) = go (x : acc) xs\n\n-- | Flatten a list of lists.\n-- |\n-- | Running time: `O(n)`, where `n` is the total number of elements.\nconcat :: forall a. List (List a) -> List a\nconcat = (_ >>= identity)\n\n-- | Apply a function to each element in a list, and flatten the results\n-- | into a single, new list.\n-- |\n-- | Running time: `O(n)`, where `n` is the total number of elements.\nconcatMap :: forall a b. (a -> List b) -> List a -> List b\nconcatMap = flip bind\n\n-- | Filter a list, keeping the elements which satisfy a predicate function.\n-- |\n-- | Running time: `O(n)`\nfilter :: forall a. (a -> Boolean) -> List a -> List a\nfilter p = go Nil\n  where\n  go acc Nil = reverse acc\n  go acc (x : xs)\n    | p x = go (x : acc) xs\n    | otherwise = go acc xs\n\n-- | Filter where the predicate returns a monadic `Boolean`.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | powerSet :: forall a. [a] -> [[a]]\n-- | powerSet = filterM (const [true, false])\n-- | ```\nfilterM :: forall a m. Monad m => (a -> m Boolean) -> List a -> m (List a)\nfilterM _ Nil = pure Nil\nfilterM p (x : xs) = do\n  b <- p x\n  xs' <- filterM p xs\n  pure if b then x : xs' else xs'\n\n-- | Apply a function to each element in a list, keeping only the results which\n-- | contain a value.\n-- |\n-- | Running time: `O(n)`\nmapMaybe :: forall a b. (a -> Maybe b) -> List a -> List b\nmapMaybe f = go Nil\n  where\n  go acc Nil = reverse acc\n  go acc (x : xs) =\n    case f x of\n      Nothing -> go acc xs\n      Just y -> go (y : acc) xs\n\n-- | Filter a list of optional values, keeping only the elements which contain\n-- | a value.\ncatMaybes :: forall a. List (Maybe a) -> List a\ncatMaybes = mapMaybe identity\n\n--------------------------------------------------------------------------------\n-- Sorting ---------------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Sort the elements of an list in increasing order.\nsort :: forall a. Ord a => List a -> List a\nsort xs = sortBy compare xs\n\n-- | Sort the elements of a list in increasing order, where elements are\n-- | compared using the specified ordering.\nsortBy :: forall a. (a -> a -> Ordering) -> List a -> List a\nsortBy cmp = mergeAll <<< sequences\n  -- implementation lifted from http://hackage.haskell.org/package/base-4.8.0.0/docs/src/Data-OldList.html#sort\n  where\n  sequences :: List a -> List (List a)\n  sequences (a : b : xs)\n    | a `cmp` b == GT = descending b (singleton a) xs\n    | otherwise = ascending b (a : _) xs\n  sequences xs = singleton xs\n\n  descending :: a -> List a -> List a -> List (List a)\n  descending a as (b : bs)\n    | a `cmp` b == GT = descending b (a : as) bs\n  descending a as bs = (a : as) : sequences bs\n\n  ascending :: a -> (List a -> List a) -> List a -> List (List a)\n  ascending a as (b : bs)\n    | a `cmp` b /= GT = ascending b (\\ys -> as (a : ys)) bs\n  ascending a as bs = ((as $ singleton a) : sequences bs)\n\n  mergeAll :: List (List a) -> List a\n  mergeAll (x : Nil) = x\n  mergeAll xs = mergeAll (mergePairs xs)\n\n  mergePairs :: List (List a) -> List (List a)\n  mergePairs (a : b : xs) = merge a b : mergePairs xs\n  mergePairs xs = xs\n\n  merge :: List a -> List a -> List a\n  merge as@(a : as') bs@(b : bs')\n    | a `cmp` b == GT = b : merge as bs'\n    | otherwise       = a : merge as' bs\n  merge Nil bs = bs\n  merge as Nil = as\n\n--------------------------------------------------------------------------------\n-- Sublists --------------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | A newtype used in cases where there is a list to be matched.\nnewtype Pattern a = Pattern (List a)\n\nderive instance eqPattern :: Eq a => Eq (Pattern a)\nderive instance ordPattern :: Ord a => Ord (Pattern a)\nderive instance newtypePattern :: Newtype (Pattern a) _\n\ninstance showPattern :: Show a => Show (Pattern a) where\n  show (Pattern s) = \"(Pattern \" <> show s <> \")\"\n\n\n-- | If the list starts with the given prefix, return the portion of the\n-- | list left after removing it, as a Just value. Otherwise, return Nothing.\n-- | * `stripPrefix (Pattern (1:Nil)) (1:2:Nil) == Just (2:Nil)`\n-- | * `stripPrefix (Pattern Nil) (1:Nil) == Just (1:Nil)`\n-- | * `stripPrefix (Pattern (2:Nil)) (1:Nil) == Nothing`\n-- |\n-- | Running time: `O(n)` where `n` is the number of elements to strip.\nstripPrefix :: forall a. Eq a => Pattern a -> List a -> Maybe (List a)\nstripPrefix (Pattern p') s = tailRecM2 go p' s\n  where\n  go prefix input = case prefix, input of\n    Cons p ps, Cons i is | p == i -> Just $ Loop { a: ps, b: is }\n    Nil, is -> Just $ Done is\n    _, _ -> Nothing\n\n-- | Extract a sublist by a start and end index.\nslice :: Int -> Int -> List ~> List\nslice start end xs = take (end - start) (drop start xs)\n\n-- | Take the specified number of elements from the front of a list.\n-- |\n-- | Running time: `O(n)` where `n` is the number of elements to take.\ntake :: forall a. Int -> List a -> List a\ntake = go Nil\n  where\n  go acc n _ | n < 1 = reverse acc\n  go acc _ Nil = reverse acc\n  go acc n (x : xs) = go (x : acc) (n - 1) xs\n\n-- | Take the specified number of elements from the end of a list.\n-- |\n-- | Running time: `O(2n - m)` where `n` is the number of elements in list\n-- | and `m` is number of elements to take.\ntakeEnd :: forall a. Int -> List a -> List a\ntakeEnd n xs = drop (length xs - n) xs\n\n-- | Take those elements from the front of a list which match a predicate.\n-- |\n-- | Running time (worst case): `O(n)`\ntakeWhile :: forall a. (a -> Boolean) -> List a -> List a\ntakeWhile p = go Nil\n  where\n  go acc (x : xs) | p x = go (x : acc) xs\n  go acc _ = reverse acc\n\n-- | Drop the specified number of elements from the front of a list.\n-- |\n-- | Running time: `O(n)` where `n` is the number of elements to drop.\ndrop :: forall a. Int -> List a -> List a\ndrop n xs | n < 1 = xs\ndrop _ Nil = Nil\ndrop n (_ : xs) = drop (n - 1) xs\n\n-- | Drop the specified number of elements from the end of a list.\n-- |\n-- | Running time: `O(2n - m)` where `n` is the number of elements in list\n-- | and `m` is number of elements to drop.\ndropEnd :: forall a. Int -> List a -> List a\ndropEnd n xs = take (length xs - n) xs\n\n-- | Drop those elements from the front of a list which match a predicate.\n-- |\n-- | Running time (worst case): `O(n)`\ndropWhile :: forall a. (a -> Boolean) -> List a -> List a\ndropWhile p = go\n  where\n  go (x : xs) | p x = go xs\n  go xs = xs\n\n-- | Split a list into two parts:\n-- |\n-- | 1. the longest initial segment for which all elements satisfy the specified predicate\n-- | 2. the remaining elements\n-- |\n-- | For example,\n-- |\n-- | ```purescript\n-- | span (\\n -> n % 2 == 1) (1 : 3 : 2 : 4 : 5 : Nil) == { init: (1 : 3 : Nil), rest: (2 : 4 : 5 : Nil) }\n-- | ```\n-- |\n-- | Running time: `O(n)`\nspan :: forall a. (a -> Boolean) -> List a -> { init :: List a, rest :: List a }\nspan p (x : xs') | p x = case span p xs' of\n  { init: ys, rest: zs } -> { init: x : ys, rest: zs }\nspan _ xs = { init: Nil, rest: xs }\n\n-- | Group equal, consecutive elements of a list into lists.\n-- |\n-- | For example,\n-- |\n-- | ```purescript\n-- | group (1 : 1 : 2 : 2 : 1 : Nil) ==\n-- |   (NonEmptyList (NonEmpty 1 (1 : Nil))) : (NonEmptyList (NonEmpty 2 (2 : Nil))) : (NonEmptyList (NonEmpty 1 Nil)) : Nil\n-- | ```\n-- |\n-- | Running time: `O(n)`\ngroup :: forall a. Eq a => List a -> List (NEL.NonEmptyList a)\ngroup = groupBy (==)\n\n-- | Group equal elements of a list into lists.\n-- |\n-- | For example,\n-- |\n-- | ```purescript\n-- | groupAll (1 : 1 : 2 : 2 : 1 : Nil) ==\n-- |   (NonEmptyList (NonEmpty 1 (1 : 1 : Nil))) : (NonEmptyList (NonEmpty 2 (2 : Nil))) : Nil\n-- | ```\ngroupAll :: forall a. Ord a => List a -> List (NEL.NonEmptyList a)\ngroupAll = group <<< sort\n\n-- | Group equal, consecutive elements of a list into lists, using the specified\n-- | equivalence relation to determine equality.\n-- |\n-- | For example,\n-- |\n-- | ```purescript\n-- | groupBy (\\a b -> odd a && odd b) (1 : 3 : 2 : 4 : 3 : 3 : Nil) ==\n-- |   (NonEmptyList (NonEmpty 1 (3 : Nil))) : (NonEmptyList (NonEmpty 2 Nil)) : (NonEmptyList (NonEmpty 4 Nil)) : (NonEmptyList (NonEmpty 3 (3 : Nil))) : Nil\n-- | ```\n-- |\n-- | Running time: `O(n)`\ngroupBy :: forall a. (a -> a -> Boolean) -> List a -> List (NEL.NonEmptyList a)\ngroupBy _ Nil = Nil\ngroupBy eq (x : xs) = case span (eq x) xs of\n  { init: ys, rest: zs } -> NEL.NonEmptyList (x :| ys) : groupBy eq zs\n\n-- | Sort, then group equal elements of a list into lists, using the provided comparison function.\n-- |\n-- | ```purescript\n-- | groupAllBy (compare `on` (_ `div` 10)) (32 : 31 : 21 : 22 : 11 : 33 : Nil) ==\n-- |   NonEmptyList (11 :| Nil) : NonEmptyList (21 :| 22 : Nil) : NonEmptyList (32 :| 31 : 33) : Nil\n-- | ```\n-- |\n-- | Running time: `O(n log n)`\ngroupAllBy :: forall a. (a -> a -> Ordering) -> List a -> List (NEL.NonEmptyList a)\ngroupAllBy p = groupBy (\\x y -> p x y == EQ) <<< sortBy p\n\n-- | Returns a lists of elements which do and do not satisfy a predicate.\n-- |\n-- | Running time: `O(n)`\npartition :: forall a. (a -> Boolean) -> List a -> { yes :: List a, no :: List a }\npartition p xs = foldr select { no: Nil, yes: Nil } xs\n  where\n    select x { no, yes } = if p x\n                           then { no, yes: x : yes }\n                           else { no: x : no, yes }\n\n-- | Returns all final segments of the argument, longest first. For example,\n-- |\n-- | ```purescript\n-- | tails (1 : 2 : 3 : Nil) == ((1 : 2 : 3 : Nil) : (2 : 3 : Nil) : (3 : Nil) : (Nil) : Nil)\n-- | ```\n-- | Running time: `O(n)`\ntails :: forall a. List a -> List (List a)\ntails Nil = singleton Nil\ntails list@(Cons _ tl)= list : tails tl\n\n--------------------------------------------------------------------------------\n-- Set-like operations ---------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Remove duplicate elements from a list.\n-- | Keeps the first occurrence of each element in the input list,\n-- | in the same order they appear in the input list.\n-- |\n-- | ```purescript\n-- | nub 1:2:1:3:3:Nil == 1:2:3:Nil\n-- | ```\n-- |\n-- | Running time: `O(n log n)`\nnub :: forall a. Ord a => List a -> List a\nnub = nubBy compare\n\n-- | Remove duplicate elements from a list based on the provided comparison function.\n-- | Keeps the first occurrence of each element in the input list,\n-- | in the same order they appear in the input list.\n-- |\n-- | ```purescript\n-- | nubBy (compare `on` Array.length) ([1]:[2]:[3,4]:Nil) == [1]:[3,4]:Nil\n-- | ```\n-- |\n-- | Running time: `O(n log n)`\nnubBy :: forall a. (a -> a -> Ordering) -> List a -> List a\nnubBy p = reverse <<< go emptySet Nil\n  where\n    go _ acc Nil = acc\n    go s acc (a : as) =\n      let { found, result: s' } = insertAndLookupBy p a s\n      in if found\n        then go s' acc as\n        else go s' (a : acc) as\n\n-- | Remove duplicate elements from a list.\n-- | Keeps the first occurrence of each element in the input list,\n-- | in the same order they appear in the input list.\n-- | This less efficient version of `nub` only requires an `Eq` instance.\n-- |\n-- | ```purescript\n-- | nubEq 1:2:1:3:3:Nil == 1:2:3:Nil\n-- | ```\n-- |\n-- | Running time: `O(n^2)`\nnubEq :: forall a. Eq a => List a -> List a\nnubEq = nubByEq eq\n\n-- | Remove duplicate elements from a list, using the provided equivalence function.\n-- | Keeps the first occurrence of each element in the input list,\n-- | in the same order they appear in the input list.\n-- | This less efficient version of `nubBy` only requires an equivalence\n-- | function, rather than an ordering function.\n-- |\n-- | ```purescript\n-- | mod3eq = eq `on` \\n -> mod n 3\n-- | nubByEq mod3eq 1:3:4:5:6:Nil == 1:3:5:Nil\n-- | ```\n-- |\n-- | Running time: `O(n^2)`\nnubByEq :: forall a. (a -> a -> Boolean) -> List a -> List a\nnubByEq _     Nil = Nil\nnubByEq eq' (x : xs) = x : nubByEq eq' (filter (\\y -> not (eq' x y)) xs)\n\n-- | Calculate the union of two lists.\n-- |\n-- | Running time: `O(n^2)`\nunion :: forall a. Eq a => List a -> List a -> List a\nunion = unionBy (==)\n\n-- | Calculate the union of two lists, using the specified\n-- | function to determine equality of elements.\n-- |\n-- | Running time: `O(n^2)`\nunionBy :: forall a. (a -> a -> Boolean) -> List a -> List a -> List a\nunionBy eq xs ys = xs <> foldl (flip (deleteBy eq)) (nubByEq eq ys) xs\n\n-- | Delete the first occurrence of an element from a list.\n-- |\n-- | Running time: `O(n)`\ndelete :: forall a. Eq a => a -> List a -> List a\ndelete = deleteBy (==)\n\n-- | Delete the first occurrence of an element from a list, using the specified\n-- | function to determine equality of elements.\n-- |\n-- | Running time: `O(n)`\ndeleteBy :: forall a. (a -> a -> Boolean) -> a -> List a -> List a\ndeleteBy _ _ Nil = Nil\ndeleteBy eq' x (y : ys) | eq' x y = ys\ndeleteBy eq' x (y : ys) = y : deleteBy eq' x ys\n\ninfix 5 difference as \\\\\n\n-- | Delete the first occurrence of each element in the second list from the first list.\n-- |\n-- | Running time: `O(n^2)`\ndifference :: forall a. Eq a => List a -> List a -> List a\ndifference = foldl (flip delete)\n\n-- | Calculate the intersection of two lists.\n-- |\n-- | Running time: `O(n^2)`\nintersect :: forall a. Eq a => List a -> List a -> List a\nintersect = intersectBy (==)\n\n-- | Calculate the intersection of two lists, using the specified\n-- | function to determine equality of elements.\n-- |\n-- | Running time: `O(n^2)`\nintersectBy :: forall a. (a -> a -> Boolean) -> List a -> List a -> List a\nintersectBy _  Nil _   = Nil\nintersectBy _  _   Nil = Nil\nintersectBy eq xs  ys  = filter (\\x -> any (eq x) ys) xs\n\n--------------------------------------------------------------------------------\n-- Zipping ---------------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Apply a function to pairs of elements at the same positions in two lists,\n-- | collecting the results in a new list.\n-- |\n-- | If one list is longer, elements will be discarded from the longer list.\n-- |\n-- | For example\n-- |\n-- | ```purescript\n-- | zipWith (*) (1 : 2 : 3 : Nil) (4 : 5 : 6 : 7 Nil) == 4 : 10 : 18 : Nil\n-- | ```\n-- |\n-- | Running time: `O(min(m, n))`\nzipWith :: forall a b c. (a -> b -> c) -> List a -> List b -> List c\nzipWith f xs ys = reverse $ go xs ys Nil\n  where\n  go Nil _ acc = acc\n  go _ Nil acc = acc\n  go (a : as) (b : bs) acc = go as bs $ f a b : acc\n\n-- | A generalization of `zipWith` which accumulates results in some `Applicative`\n-- | functor.\nzipWithA :: forall m a b c. Applicative m => (a -> b -> m c) -> List a -> List b -> m (List c)\nzipWithA f xs ys = sequence (zipWith f xs ys)\n\n-- | Collect pairs of elements at the same positions in two lists.\n-- |\n-- | Running time: `O(min(m, n))`\nzip :: forall a b. List a -> List b -> List (Tuple a b)\nzip = zipWith Tuple\n\n-- | Transforms a list of pairs into a list of first components and a list of\n-- | second components.\nunzip :: forall a b. List (Tuple a b) -> Tuple (List a) (List b)\nunzip = foldr (\\(Tuple a b) (Tuple as bs) -> Tuple (a : as) (b : bs)) (Tuple Nil Nil)\n\n--------------------------------------------------------------------------------\n-- Transpose -------------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | The 'transpose' function transposes the rows and columns of its argument.\n-- | For example,\n-- |\n-- |     transpose ((1:2:3:Nil) : (4:5:6:Nil) : Nil) ==\n-- |       ((1:4:Nil) : (2:5:Nil) : (3:6:Nil) : Nil)\n-- |\n-- | If some of the rows are shorter than the following rows, their elements are skipped:\n-- |\n-- |     transpose ((10:11:Nil) : (20:Nil) : Nil : (30:31:32:Nil) : Nil) ==\n-- |       ((10:20:30:Nil) : (11:31:Nil) : (32:Nil) : Nil)\ntranspose :: forall a. List (List a) -> List (List a)\ntranspose Nil = Nil\ntranspose (Nil : xss) = transpose xss\ntranspose ((x : xs) : xss) =\n  (x : mapMaybe head xss) : transpose (xs : mapMaybe tail xss)\n\n--------------------------------------------------------------------------------\n-- Folding ---------------------------------------------------------------------\n--------------------------------------------------------------------------------\n\n-- | Perform a fold using a monadic step function.\nfoldM :: forall m a b. Monad m => (b -> a -> m b) -> b -> List a -> m b\nfoldM _ b Nil = pure b\nfoldM f b (a : as) = f b a >>= \\b' -> foldM f b' as\n", "// module Partial.Unsafe\n\nexport const _unsafePartial = function (f) {\n  return f();\n};\n", "// module Partial\n\nexport const _crashWith = function (msg) {\n  throw new Error(msg);\n};\n", "-- | Some partial helper functions. See the README for more documentation.\nmodule Partial\n  ( crash\n  , crashWith\n  ) where\n\n-- | A partial function which crashes on any input with a default message.\ncrash :: forall a. Partial => a\ncrash = crashWith \"Partial.crash: partial function\"\n\n-- | A partial function which crashes on any input with the specified message.\ncrashWith :: forall a. Partial => String -> a\ncrashWith = _crashWith\n\nforeign import _crashWith :: forall a. String -> a\n", "-- | Utilities for working with partial functions.\n-- | See the README for more documentation.\nmodule Partial.Unsafe\n  ( unsafePartial\n  , unsafeCrashWith\n  ) where\n\nimport Partial (crashWith)\n\n-- Note: this function's type signature is more like\n-- `(Unit -> a) -> a`. However, we would need to use\n-- `unsafeCoerce` to make this compile, incurring\n-- either a dependency or reimplementing it here.\n-- Rather than doing that, we'll use a type signature\n-- of `a -> b` instead.\nforeign import _unsafePartial :: forall a b. a -> b\n\n-- | Discharge a partiality constraint, unsafely.\nunsafePartial :: forall a. (Partial => a) -> a\nunsafePartial = _unsafePartial\n\n-- | A function which crashes with the specified error message.\nunsafeCrashWith :: forall a. String -> a\nunsafeCrashWith msg = unsafePartial (crashWith msg)\n", "module Data.List.NonEmpty\n  ( module Data.List.Types\n  , toUnfoldable\n  , fromFoldable\n  , fromList\n  , toList\n  , singleton\n  , length\n  , cons\n  , cons'\n  , snoc\n  , snoc'\n  , head\n  , last\n  , tail\n  , init\n  , uncons\n  , unsnoc\n  , (!!), index\n  , elemIndex\n  , elemLastIndex\n  , findIndex\n  , findLastIndex\n  , insertAt\n  , updateAt\n  , modifyAt\n  , reverse\n  , concat\n  , concatMap\n  , filter\n  , filterM\n  , mapMaybe\n  , catMaybes\n  , appendFoldable\n  , sort\n  , sortBy\n  , take\n  , takeWhile\n  , drop\n  , dropWhile\n  , span\n  , group\n  , groupAll\n  , groupBy\n  , groupAllBy\n  , partition\n  , nub\n  , nubBy\n  , nubEq\n  , nubByEq\n  , union\n  , unionBy\n  , intersect\n  , intersectBy\n  , zipWith\n  , zipWithA\n  , zip\n  , unzip\n  , foldM\n  , module Exports\n  ) where\n\nimport Prelude\n\nimport Data.Foldable (class Foldable)\nimport Data.List ((:))\nimport Data.List as L\nimport Data.List.Types (NonEmptyList(..))\nimport Data.Maybe (Maybe(..), fromMaybe, maybe)\nimport Data.NonEmpty ((:|))\nimport Data.NonEmpty as NE\nimport Data.Semigroup.Traversable (sequence1)\nimport Data.Tuple (Tuple(..), fst, snd)\nimport Data.Unfoldable (class Unfoldable, unfoldr)\nimport Partial.Unsafe (unsafeCrashWith)\n\nimport Data.Foldable (foldl, foldr, foldMap, fold, intercalate, elem, notElem, find, findMap, any, all) as Exports\nimport Data.Semigroup.Foldable (fold1, foldMap1, for1_, sequence1_, traverse1_) as Exports\nimport Data.Semigroup.Traversable (sequence1, traverse1, traverse1Default) as Exports\nimport Data.Traversable (scanl, scanr) as Exports\n\n-- | Internal function: any operation on a list that is guaranteed not to delete\n-- | all elements also applies to a NEL, this function is a helper for defining\n-- | those cases.\nwrappedOperation\n  :: forall a b\n   . String\n  -> (L.List a -> L.List b)\n  -> NonEmptyList a\n  -> NonEmptyList b\nwrappedOperation name f (NonEmptyList (x :| xs)) =\n  case f (x : xs) of\n    x' : xs' -> NonEmptyList (x' :| xs')\n    L.Nil -> unsafeCrashWith (\"Impossible: empty list in NonEmptyList \" <> name)\n\n-- | Like `wrappedOperation`, but for functions that operate on 2 lists.\nwrappedOperation2\n  :: forall a b c\n   . String\n  -> (L.List a -> L.List b -> L.List c)\n  -> NonEmptyList a\n  -> NonEmptyList b\n  -> NonEmptyList c\nwrappedOperation2 name f (NonEmptyList (x :| xs)) (NonEmptyList (y :| ys)) =\n  case f (x : xs) (y : ys) of\n    x' : xs' -> NonEmptyList (x' :| xs')\n    L.Nil -> unsafeCrashWith (\"Impossible: empty list in NonEmptyList \" <> name)\n\n-- | Lifts a function that operates on a list to work on a NEL. This does not\n-- | preserve the non-empty status of the result.\nlift :: forall a b. (L.List a -> b) -> NonEmptyList a -> b\nlift f (NonEmptyList (x :| xs)) = f (x : xs)\n\ntoUnfoldable :: forall f. Unfoldable f => NonEmptyList ~> f\ntoUnfoldable =\n  unfoldr (\\xs -> (\\rec -> Tuple rec.head rec.tail) <$> L.uncons xs) <<< toList\n\nfromFoldable :: forall f a. Foldable f => f a -> Maybe (NonEmptyList a)\nfromFoldable = fromList <<< L.fromFoldable\n\nfromList :: forall a. L.List a -> Maybe (NonEmptyList a)\nfromList L.Nil = Nothing\nfromList (x : xs) = Just (NonEmptyList (x :| xs))\n\ntoList :: NonEmptyList ~> L.List\ntoList (NonEmptyList (x :| xs)) = x : xs\n\nsingleton :: forall a. a -> NonEmptyList a\nsingleton = NonEmptyList <<< NE.singleton\n\ncons :: forall a. a -> NonEmptyList a -> NonEmptyList a\ncons y (NonEmptyList (x :| xs)) = NonEmptyList (y :| x : xs)\n\ncons' :: forall a. a -> L.List a -> NonEmptyList a\ncons' x xs = NonEmptyList (x :| xs)\n\nsnoc :: forall a. NonEmptyList a -> a -> NonEmptyList a\nsnoc (NonEmptyList (x :| xs)) y = NonEmptyList (x :| L.snoc xs y)\n\nsnoc' :: forall a. L.List a -> a -> NonEmptyList a\nsnoc' (x : xs) y = NonEmptyList (x :| L.snoc xs y)\nsnoc' L.Nil y = singleton y\n\nhead :: forall a. NonEmptyList a -> a\nhead (NonEmptyList (x :| _)) = x\n\nlast :: forall a. NonEmptyList a -> a\nlast (NonEmptyList (x :| xs)) = fromMaybe x (L.last xs)\n\ntail :: NonEmptyList ~> L.List\ntail (NonEmptyList (_ :| xs)) = xs\n\ninit :: NonEmptyList ~> L.List\ninit (NonEmptyList (x :| xs)) = maybe L.Nil (x : _) (L.init xs)\n\nuncons :: forall a. NonEmptyList a -> { head :: a, tail :: L.List a }\nuncons (NonEmptyList (x :| xs)) = { head: x, tail: xs }\n\nunsnoc :: forall a. NonEmptyList a -> { init :: L.List a, last :: a }\nunsnoc (NonEmptyList (x :| xs)) = case L.unsnoc xs of\n  Nothing -> { init: L.Nil, last: x }\n  Just un -> { init: x : un.init, last: un.last }\n\nlength :: forall a. NonEmptyList a -> Int\nlength (NonEmptyList (_ :| xs)) = 1 + L.length xs\n\nindex :: forall a. NonEmptyList a -> Int -> Maybe a\nindex (NonEmptyList (x :| xs)) i\n  | i == 0 = Just x\n  | otherwise = L.index xs (i - 1)\n\ninfixl 8 index as !!\n\nelemIndex :: forall a. Eq a => a -> NonEmptyList a -> Maybe Int\nelemIndex x = findIndex (_ == x)\n\nelemLastIndex :: forall a. Eq a => a -> NonEmptyList a -> Maybe Int\nelemLastIndex x = findLastIndex (_ == x)\n\nfindIndex :: forall a. (a -> Boolean) -> NonEmptyList a -> Maybe Int\nfindIndex f (NonEmptyList (x :| xs))\n  | f x = Just 0\n  | otherwise = (_ + 1) <$> L.findIndex f xs\n\nfindLastIndex :: forall a. (a -> Boolean) -> NonEmptyList a -> Maybe Int\nfindLastIndex f (NonEmptyList (x :| xs)) =\n  case L.findLastIndex f xs of\n    Just i -> Just (i + 1)\n    Nothing\n      | f x -> Just 0\n      | otherwise -> Nothing\n\ninsertAt :: forall a. Int -> a -> NonEmptyList a -> Maybe (NonEmptyList a)\ninsertAt i a (NonEmptyList (x :| xs))\n  | i == 0 = Just (NonEmptyList (a :| x : xs))\n  | otherwise = NonEmptyList <<< (x :| _) <$> L.insertAt (i - 1) a xs\n\nupdateAt :: forall a. Int -> a -> NonEmptyList a -> Maybe (NonEmptyList a)\nupdateAt i a (NonEmptyList (x :| xs))\n  | i == 0 = Just (NonEmptyList (a :| xs))\n  | otherwise = NonEmptyList <<< (x :| _) <$> L.updateAt (i - 1) a xs\n\nmodifyAt :: forall a. Int -> (a -> a) -> NonEmptyList a -> Maybe (NonEmptyList a)\nmodifyAt i f (NonEmptyList (x :| xs))\n  | i == 0 = Just (NonEmptyList (f x :| xs))\n  | otherwise = NonEmptyList <<< (x :| _) <$> L.modifyAt (i - 1) f xs\n\nreverse :: forall a. NonEmptyList a -> NonEmptyList a\nreverse = wrappedOperation \"reverse\" L.reverse\n\nfilter :: forall a. (a -> Boolean) -> NonEmptyList a -> L.List a\nfilter = lift <<< L.filter\n\nfilterM :: forall m a. Monad m => (a -> m Boolean) -> NonEmptyList a -> m (L.List a)\nfilterM = lift <<< L.filterM\n\nmapMaybe :: forall a b. (a -> Maybe b) -> NonEmptyList a -> L.List b\nmapMaybe = lift <<< L.mapMaybe\n\ncatMaybes :: forall a. NonEmptyList (Maybe a) -> L.List a\ncatMaybes = lift L.catMaybes\n\nconcat :: forall a. NonEmptyList (NonEmptyList a) -> NonEmptyList a\nconcat = (_ >>= identity)\n\nconcatMap :: forall a b. (a -> NonEmptyList b) -> NonEmptyList a -> NonEmptyList b\nconcatMap = flip bind\n\nappendFoldable :: forall t a. Foldable t => NonEmptyList a -> t a -> NonEmptyList a\nappendFoldable (NonEmptyList (x :| xs)) ys =\n  NonEmptyList (x :| (xs <> L.fromFoldable ys))\n\nsort :: forall a. Ord a => NonEmptyList a -> NonEmptyList a\nsort xs = sortBy compare xs\n\nsortBy :: forall a. (a -> a -> Ordering) -> NonEmptyList a -> NonEmptyList a\nsortBy = wrappedOperation \"sortBy\" <<< L.sortBy\n\ntake :: forall a. Int -> NonEmptyList a -> L.List a\ntake = lift <<< L.take\n\ntakeWhile :: forall a. (a -> Boolean) -> NonEmptyList a -> L.List a\ntakeWhile = lift <<< L.takeWhile\n\ndrop :: forall a. Int -> NonEmptyList a -> L.List a\ndrop = lift <<< L.drop\n\ndropWhile :: forall a. (a -> Boolean) -> NonEmptyList a -> L.List a\ndropWhile = lift <<< L.dropWhile\n\nspan :: forall a. (a -> Boolean) -> NonEmptyList a -> { init :: L.List a, rest :: L.List a }\nspan = lift <<< L.span\n\ngroup :: forall a. Eq a => NonEmptyList a -> NonEmptyList (NonEmptyList a)\ngroup = wrappedOperation \"group\" L.group\n\ngroupAll :: forall a. Ord a => NonEmptyList a -> NonEmptyList (NonEmptyList a)\ngroupAll = wrappedOperation \"groupAll\" L.groupAll\n\ngroupBy :: forall a. (a -> a -> Boolean) -> NonEmptyList a -> NonEmptyList (NonEmptyList a)\ngroupBy = wrappedOperation \"groupBy\" <<< L.groupBy\n\ngroupAllBy :: forall a. (a -> a -> Ordering) -> NonEmptyList a -> NonEmptyList (NonEmptyList a)\ngroupAllBy = wrappedOperation \"groupAllBy\" <<< L.groupAllBy\n\npartition :: forall a. (a -> Boolean) -> NonEmptyList a -> { yes :: L.List a, no :: L.List a }\npartition = lift <<< L.partition\n\nnub :: forall a. Ord a => NonEmptyList a -> NonEmptyList a\nnub = wrappedOperation \"nub\" L.nub\n\nnubBy :: forall a. (a -> a -> Ordering) -> NonEmptyList a -> NonEmptyList a\nnubBy = wrappedOperation \"nubBy\" <<< L.nubBy\n\nnubEq :: forall a. Eq a => NonEmptyList a -> NonEmptyList a\nnubEq = wrappedOperation \"nubEq\" L.nubEq\n\nnubByEq :: forall a. (a -> a -> Boolean) -> NonEmptyList a -> NonEmptyList a\nnubByEq = wrappedOperation \"nubByEq\" <<< L.nubByEq\n\nunion :: forall a. Eq a => NonEmptyList a -> NonEmptyList a -> NonEmptyList a\nunion = wrappedOperation2 \"union\" L.union\n\nunionBy :: forall a. (a -> a -> Boolean) -> NonEmptyList a -> NonEmptyList a -> NonEmptyList a\nunionBy = wrappedOperation2 \"unionBy\" <<< L.unionBy\n\nintersect :: forall a. Eq a => NonEmptyList a -> NonEmptyList a -> NonEmptyList a\nintersect = wrappedOperation2 \"intersect\" L.intersect\n\nintersectBy :: forall a. (a -> a -> Boolean) -> NonEmptyList a -> NonEmptyList a -> NonEmptyList a\nintersectBy = wrappedOperation2 \"intersectBy\" <<< L.intersectBy\n\nzipWith :: forall a b c. (a -> b -> c) -> NonEmptyList a -> NonEmptyList b -> NonEmptyList c\nzipWith f (NonEmptyList (x :| xs)) (NonEmptyList (y :| ys)) =\n  NonEmptyList (f x y :| L.zipWith f xs ys)\n\nzipWithA :: forall m a b c. Applicative m => (a -> b -> m c) -> NonEmptyList a -> NonEmptyList b -> m (NonEmptyList c)\nzipWithA f xs ys = sequence1 (zipWith f xs ys)\n\nzip :: forall a b. NonEmptyList a -> NonEmptyList b -> NonEmptyList (Tuple a b)\nzip = zipWith Tuple\n\nunzip :: forall a b. NonEmptyList (Tuple a b) -> Tuple (NonEmptyList a) (NonEmptyList b)\nunzip ts = Tuple (map fst ts) (map snd ts)\n\nfoldM :: forall m a b. Monad m => (b -> a -> m b) -> b -> NonEmptyList a -> m b\nfoldM f b (NonEmptyList (a :| as)) = f b a >>= \\b' -> L.foldM f b' as\n", "/* eslint-disable no-eq-null, eqeqeq */\n\nconst nullImpl = null;\nexport { nullImpl as null };\n\nexport function nullable(a, r, f) {\n  return a == null ? r : f(a);\n}\n\nexport function notNull(x) {\n  return x;\n}\n", "-- | This module defines types and functions for working with nullable types\n-- | using the FFI.\n\nmodule Data.Nullable\n  ( Nullable\n  , null\n  , notNull\n  , toMaybe\n  , toNullable\n  ) where\n\nimport Prelude\n\nimport Data.Eq (class Eq1)\nimport Data.Function (on)\nimport Data.Function.Uncurried (Fn3, runFn3)\nimport Data.Maybe (Maybe(..), maybe)\nimport Data.Ord (class Ord1)\n\n-- | A nullable type. This type constructor is intended to be used for\n-- | interoperating with JavaScript functions which accept or return null\n-- | values.\n-- |\n-- | The runtime representation of `Nullable T` is the same as that of `T`,\n-- | except that it may also be `null`. For example, the JavaScript values\n-- | `null`, `[]`, and `[1,2,3]` may all be given the type\n-- | `Nullable (Array Int)`. Similarly, the JavaScript values `[]`, `[null]`,\n-- | and `[1,2,null,3]` may all be given the type `Array (Nullable Int)`.\n-- |\n-- | There is one pitfall with `Nullable`, which is that values of the type\n-- | `Nullable T` will not function as you might expect if the type `T` happens\n-- | to itself permit `null` as a valid runtime representation.\n-- |\n-- | In particular, values of the type `Nullable (Nullable T)` will \u2018collapse\u2019,\n-- | in the sense that the PureScript expressions `notNull null` and `null`\n-- | will both leave you with a value whose runtime representation is just\n-- | `null`. Therefore it is important to avoid using `Nullable T` in\n-- | situations where `T` itself can take `null` as a runtime representation.\n-- | If in doubt, use `Maybe` instead.\n-- |\n-- | `Nullable` does not permit lawful `Functor`, `Applicative`, or `Monad`\n-- | instances as a result of this pitfall, which is why these instances are\n-- | not provided.\nforeign import data Nullable :: Type -> Type\n\ntype role Nullable representational\n\n-- | The null value.\nforeign import null :: forall a. Nullable a\n\nforeign import nullable :: forall a r. Fn3 (Nullable a) r (a -> r) r\n\n-- | Wrap a non-null value.\nforeign import notNull :: forall a. a -> Nullable a\n\n-- | Takes `Nothing` to `null`, and `Just a` to `a`.\ntoNullable :: forall a. Maybe a -> Nullable a\ntoNullable = maybe null notNull\n\n-- | Represent `null` using `Maybe a` as `Nothing`. Note that this function\n-- | can violate parametricity, as it inspects the runtime representation of\n-- | its argument (see the warning about the pitfall of `Nullable` above).\ntoMaybe :: forall a. Nullable a -> Maybe a\ntoMaybe n = runFn3 nullable n Nothing Just\n\ninstance showNullable :: Show a => Show (Nullable a) where\n  show = maybe \"null\" show <<< toMaybe\n\ninstance eqNullable :: Eq a => Eq (Nullable a) where\n  eq = eq `on` toMaybe\n\ninstance eq1Nullable :: Eq1 Nullable where\n  eq1 = eq\n\ninstance ordNullable :: Ord a => Ord (Nullable a) where\n  compare = compare `on` toMaybe\n\ninstance ord1Nullable :: Ord1 Nullable where\n  compare1 = compare\n", "/* globals setImmediate, clearImmediate, setTimeout, clearTimeout */\n/* eslint-disable no-unused-vars, no-prototype-builtins, no-use-before-define, no-unused-labels, no-param-reassign */\nvar Aff = function () {\n  // A unique value for empty.\n  var EMPTY = {};\n\n  /*\n\n  An awkward approximation. We elide evidence we would otherwise need in PS for\n  efficiency sake.\n\n  data Aff eff a\n    = Pure a\n    | Throw Error\n    | Catch (Aff eff a) (Error -> Aff eff a)\n    | Sync (Eff eff a)\n    | Async ((Either Error a -> Eff eff Unit) -> Eff eff (Canceler eff))\n    | forall b. Bind (Aff eff b) (b -> Aff eff a)\n    | forall b. Bracket (Aff eff b) (BracketConditions eff b) (b -> Aff eff a)\n    | forall b. Fork Boolean (Aff eff b) ?(Fiber eff b -> a)\n    | Sequential (ParAff aff a)\n\n  */\n  var PURE    = \"Pure\";\n  var THROW   = \"Throw\";\n  var CATCH   = \"Catch\";\n  var SYNC    = \"Sync\";\n  var ASYNC   = \"Async\";\n  var BIND    = \"Bind\";\n  var BRACKET = \"Bracket\";\n  var FORK    = \"Fork\";\n  var SEQ     = \"Sequential\";\n\n  /*\n\n  data ParAff eff a\n    = forall b. Map (b -> a) (ParAff eff b)\n    | forall b. Apply (ParAff eff (b -> a)) (ParAff eff b)\n    | Alt (ParAff eff a) (ParAff eff a)\n    | ?Par (Aff eff a)\n\n  */\n  var MAP   = \"Map\";\n  var APPLY = \"Apply\";\n  var ALT   = \"Alt\";\n\n  // Various constructors used in interpretation\n  var CONS      = \"Cons\";      // Cons-list, for stacks\n  var RESUME    = \"Resume\";    // Continue indiscriminately\n  var RELEASE   = \"Release\";   // Continue with bracket finalizers\n  var FINALIZER = \"Finalizer\"; // A non-interruptible effect\n  var FINALIZED = \"Finalized\"; // Marker for finalization\n  var FORKED    = \"Forked\";    // Reference to a forked fiber, with resumption stack\n  var FIBER     = \"Fiber\";     // Actual fiber reference\n  var THUNK     = \"Thunk\";     // Primed effect, ready to invoke\n\n  function Aff(tag, _1, _2, _3) {\n    this.tag = tag;\n    this._1  = _1;\n    this._2  = _2;\n    this._3  = _3;\n  }\n\n  function AffCtr(tag) {\n    var fn = function (_1, _2, _3) {\n      return new Aff(tag, _1, _2, _3);\n    };\n    fn.tag = tag;\n    return fn;\n  }\n\n  function nonCanceler(error) {\n    return new Aff(PURE, void 0);\n  }\n\n  function runEff(eff) {\n    try {\n      eff();\n    } catch (error) {\n      setTimeout(function () {\n        throw error;\n      }, 0);\n    }\n  }\n\n  function runSync(left, right, eff) {\n    try {\n      return right(eff());\n    } catch (error) {\n      return left(error);\n    }\n  }\n\n  function runAsync(left, eff, k) {\n    try {\n      return eff(k)();\n    } catch (error) {\n      k(left(error))();\n      return nonCanceler;\n    }\n  }\n\n  var Scheduler = function () {\n    var limit    = 1024;\n    var size     = 0;\n    var ix       = 0;\n    var queue    = new Array(limit);\n    var draining = false;\n\n    function drain() {\n      var thunk;\n      draining = true;\n      while (size !== 0) {\n        size--;\n        thunk     = queue[ix];\n        queue[ix] = void 0;\n        ix        = (ix + 1) % limit;\n        thunk();\n      }\n      draining = false;\n    }\n\n    return {\n      isDraining: function () {\n        return draining;\n      },\n      enqueue: function (cb) {\n        var i, tmp;\n        if (size === limit) {\n          tmp = draining;\n          drain();\n          draining = tmp;\n        }\n\n        queue[(ix + size) % limit] = cb;\n        size++;\n\n        if (!draining) {\n          drain();\n        }\n      }\n    };\n  }();\n\n  function Supervisor(util) {\n    var fibers  = {};\n    var fiberId = 0;\n    var count   = 0;\n\n    return {\n      register: function (fiber) {\n        var fid = fiberId++;\n        fiber.onComplete({\n          rethrow: true,\n          handler: function (result) {\n            return function () {\n              count--;\n              delete fibers[fid];\n            };\n          }\n        })();\n        fibers[fid] = fiber;\n        count++;\n      },\n      isEmpty: function () {\n        return count === 0;\n      },\n      killAll: function (killError, cb) {\n        return function () {\n          if (count === 0) {\n            return cb();\n          }\n\n          var killCount = 0;\n          var kills     = {};\n\n          function kill(fid) {\n            kills[fid] = fibers[fid].kill(killError, function (result) {\n              return function () {\n                delete kills[fid];\n                killCount--;\n                if (util.isLeft(result) && util.fromLeft(result)) {\n                  setTimeout(function () {\n                    throw util.fromLeft(result);\n                  }, 0);\n                }\n                if (killCount === 0) {\n                  cb();\n                }\n              };\n            })();\n          }\n\n          for (var k in fibers) {\n            if (fibers.hasOwnProperty(k)) {\n              killCount++;\n              kill(k);\n            }\n          }\n\n          fibers  = {};\n          fiberId = 0;\n          count   = 0;\n\n          return function (error) {\n            return new Aff(SYNC, function () {\n              for (var k in kills) {\n                if (kills.hasOwnProperty(k)) {\n                  kills[k]();\n                }\n              }\n            });\n          };\n        };\n      }\n    };\n  }\n\n  // Fiber state machine\n  var SUSPENDED   = 0; // Suspended, pending a join.\n  var CONTINUE    = 1; // Interpret the next instruction.\n  var STEP_BIND   = 2; // Apply the next bind.\n  var STEP_RESULT = 3; // Handle potential failure from a result.\n  var PENDING     = 4; // An async effect is running.\n  var RETURN      = 5; // The current stack has returned.\n  var COMPLETED   = 6; // The entire fiber has completed.\n\n  function Fiber(util, supervisor, aff) {\n    // Monotonically increasing tick, increased on each asynchronous turn.\n    var runTick = 0;\n\n    // The current branch of the state machine.\n    var status = SUSPENDED;\n\n    // The current point of interest for the state machine branch.\n    var step      = aff;  // Successful step\n    var fail      = null; // Failure step\n    var interrupt = null; // Asynchronous interrupt\n\n    // Stack of continuations for the current fiber.\n    var bhead = null;\n    var btail = null;\n\n    // Stack of attempts and finalizers for error recovery. Every `Cons` is also\n    // tagged with current `interrupt` state. We use this to track which items\n    // should be ignored or evaluated as a result of a kill.\n    var attempts = null;\n\n    // A special state is needed for Bracket, because it cannot be killed. When\n    // we enter a bracket acquisition or finalizer, we increment the counter,\n    // and then decrement once complete.\n    var bracketCount = 0;\n\n    // Each join gets a new id so they can be revoked.\n    var joinId  = 0;\n    var joins   = null;\n    var rethrow = true;\n\n    // Each invocation of `run` requires a tick. When an asynchronous effect is\n    // resolved, we must check that the local tick coincides with the fiber\n    // tick before resuming. This prevents multiple async continuations from\n    // accidentally resuming the same fiber. A common example may be invoking\n    // the provided callback in `makeAff` more than once, but it may also be an\n    // async effect resuming after the fiber was already cancelled.\n    function run(localRunTick) {\n      var tmp, result, attempt;\n      while (true) {\n        tmp       = null;\n        result    = null;\n        attempt   = null;\n\n        switch (status) {\n        case STEP_BIND:\n          status = CONTINUE;\n          try {\n            step   = bhead(step);\n            if (btail === null) {\n              bhead = null;\n            } else {\n              bhead = btail._1;\n              btail = btail._2;\n            }\n          } catch (e) {\n            status = RETURN;\n            fail   = util.left(e);\n            step   = null;\n          }\n          break;\n\n        case STEP_RESULT:\n          if (util.isLeft(step)) {\n            status = RETURN;\n            fail   = step;\n            step   = null;\n          } else if (bhead === null) {\n            status = RETURN;\n          } else {\n            status = STEP_BIND;\n            step   = util.fromRight(step);\n          }\n          break;\n\n        case CONTINUE:\n          switch (step.tag) {\n          case BIND:\n            if (bhead) {\n              btail = new Aff(CONS, bhead, btail);\n            }\n            bhead  = step._2;\n            status = CONTINUE;\n            step   = step._1;\n            break;\n\n          case PURE:\n            if (bhead === null) {\n              status = RETURN;\n              step   = util.right(step._1);\n            } else {\n              status = STEP_BIND;\n              step   = step._1;\n            }\n            break;\n\n          case SYNC:\n            status = STEP_RESULT;\n            step   = runSync(util.left, util.right, step._1);\n            break;\n\n          case ASYNC:\n            status = PENDING;\n            step   = runAsync(util.left, step._1, function (result) {\n              return function () {\n                if (runTick !== localRunTick) {\n                  return;\n                }\n                runTick++;\n                Scheduler.enqueue(function () {\n                  // It's possible to interrupt the fiber between enqueuing and\n                  // resuming, so we need to check that the runTick is still\n                  // valid.\n                  if (runTick !== localRunTick + 1) {\n                    return;\n                  }\n                  status = STEP_RESULT;\n                  step   = result;\n                  run(runTick);\n                });\n              };\n            });\n            return;\n\n          case THROW:\n            status = RETURN;\n            fail   = util.left(step._1);\n            step   = null;\n            break;\n\n          // Enqueue the Catch so that we can call the error handler later on\n          // in case of an exception.\n          case CATCH:\n            if (bhead === null) {\n              attempts = new Aff(CONS, step, attempts, interrupt);\n            } else {\n              attempts = new Aff(CONS, step, new Aff(CONS, new Aff(RESUME, bhead, btail), attempts, interrupt), interrupt);\n            }\n            bhead    = null;\n            btail    = null;\n            status   = CONTINUE;\n            step     = step._1;\n            break;\n\n          // Enqueue the Bracket so that we can call the appropriate handlers\n          // after resource acquisition.\n          case BRACKET:\n            bracketCount++;\n            if (bhead === null) {\n              attempts = new Aff(CONS, step, attempts, interrupt);\n            } else {\n              attempts = new Aff(CONS, step, new Aff(CONS, new Aff(RESUME, bhead, btail), attempts, interrupt), interrupt);\n            }\n            bhead  = null;\n            btail  = null;\n            status = CONTINUE;\n            step   = step._1;\n            break;\n\n          case FORK:\n            status = STEP_RESULT;\n            tmp    = Fiber(util, supervisor, step._2);\n            if (supervisor) {\n              supervisor.register(tmp);\n            }\n            if (step._1) {\n              tmp.run();\n            }\n            step = util.right(tmp);\n            break;\n\n          case SEQ:\n            status = CONTINUE;\n            step   = sequential(util, supervisor, step._1);\n            break;\n          }\n          break;\n\n        case RETURN:\n          bhead = null;\n          btail = null;\n          // If the current stack has returned, and we have no other stacks to\n          // resume or finalizers to run, the fiber has halted and we can\n          // invoke all join callbacks. Otherwise we need to resume.\n          if (attempts === null) {\n            status = COMPLETED;\n            step   = interrupt || fail || step;\n          } else {\n            // The interrupt status for the enqueued item.\n            tmp      = attempts._3;\n            attempt  = attempts._1;\n            attempts = attempts._2;\n\n            switch (attempt.tag) {\n            // We cannot recover from an unmasked interrupt. Otherwise we should\n            // continue stepping, or run the exception handler if an exception\n            // was raised.\n            case CATCH:\n              // We should compare the interrupt status as well because we\n              // only want it to apply if there has been an interrupt since\n              // enqueuing the catch.\n              if (interrupt && interrupt !== tmp && bracketCount === 0) {\n                status = RETURN;\n              } else if (fail) {\n                status = CONTINUE;\n                step   = attempt._2(util.fromLeft(fail));\n                fail   = null;\n              }\n              break;\n\n            // We cannot resume from an unmasked interrupt or exception.\n            case RESUME:\n              // As with Catch, we only want to ignore in the case of an\n              // interrupt since enqueing the item.\n              if (interrupt && interrupt !== tmp && bracketCount === 0 || fail) {\n                status = RETURN;\n              } else {\n                bhead  = attempt._1;\n                btail  = attempt._2;\n                status = STEP_BIND;\n                step   = util.fromRight(step);\n              }\n              break;\n\n            // If we have a bracket, we should enqueue the handlers,\n            // and continue with the success branch only if the fiber has\n            // not been interrupted. If the bracket acquisition failed, we\n            // should not run either.\n            case BRACKET:\n              bracketCount--;\n              if (fail === null) {\n                result   = util.fromRight(step);\n                // We need to enqueue the Release with the same interrupt\n                // status as the Bracket that is initiating it.\n                attempts = new Aff(CONS, new Aff(RELEASE, attempt._2, result), attempts, tmp);\n                // We should only coninue as long as the interrupt status has not changed or\n                // we are currently within a non-interruptable finalizer.\n                if (interrupt === tmp || bracketCount > 0) {\n                  status = CONTINUE;\n                  step   = attempt._3(result);\n                }\n              }\n              break;\n\n            // Enqueue the appropriate handler. We increase the bracket count\n            // because it should not be cancelled.\n            case RELEASE:\n              attempts = new Aff(CONS, new Aff(FINALIZED, step, fail), attempts, interrupt);\n              status   = CONTINUE;\n              // It has only been killed if the interrupt status has changed\n              // since we enqueued the item, and the bracket count is 0. If the\n              // bracket count is non-zero then we are in a masked state so it's\n              // impossible to be killed.\n              if (interrupt && interrupt !== tmp && bracketCount === 0) {\n                step = attempt._1.killed(util.fromLeft(interrupt))(attempt._2);\n              } else if (fail) {\n                step = attempt._1.failed(util.fromLeft(fail))(attempt._2);\n              } else {\n                step = attempt._1.completed(util.fromRight(step))(attempt._2);\n              }\n              fail = null;\n              bracketCount++;\n              break;\n\n            case FINALIZER:\n              bracketCount++;\n              attempts = new Aff(CONS, new Aff(FINALIZED, step, fail), attempts, interrupt);\n              status   = CONTINUE;\n              step     = attempt._1;\n              break;\n\n            case FINALIZED:\n              bracketCount--;\n              status = RETURN;\n              step   = attempt._1;\n              fail   = attempt._2;\n              break;\n            }\n          }\n          break;\n\n        case COMPLETED:\n          for (var k in joins) {\n            if (joins.hasOwnProperty(k)) {\n              rethrow = rethrow && joins[k].rethrow;\n              runEff(joins[k].handler(step));\n            }\n          }\n          joins = null;\n          // If we have an interrupt and a fail, then the thread threw while\n          // running finalizers. This should always rethrow in a fresh stack.\n          if (interrupt && fail) {\n            setTimeout(function () {\n              throw util.fromLeft(fail);\n            }, 0);\n          // If we have an unhandled exception, and no other fiber has joined\n          // then we need to throw the exception in a fresh stack.\n          } else if (util.isLeft(step) && rethrow) {\n            setTimeout(function () {\n              // Guard on reathrow because a completely synchronous fiber can\n              // still have an observer which was added after-the-fact.\n              if (rethrow) {\n                throw util.fromLeft(step);\n              }\n            }, 0);\n          }\n          return;\n        case SUSPENDED:\n          status = CONTINUE;\n          break;\n        case PENDING: return;\n        }\n      }\n    }\n\n    function onComplete(join) {\n      return function () {\n        if (status === COMPLETED) {\n          rethrow = rethrow && join.rethrow;\n          join.handler(step)();\n          return function () {};\n        }\n\n        var jid    = joinId++;\n        joins      = joins || {};\n        joins[jid] = join;\n\n        return function() {\n          if (joins !== null) {\n            delete joins[jid];\n          }\n        };\n      };\n    }\n\n    function kill(error, cb) {\n      return function () {\n        if (status === COMPLETED) {\n          cb(util.right(void 0))();\n          return function () {};\n        }\n\n        var canceler = onComplete({\n          rethrow: false,\n          handler: function (/* unused */) {\n            return cb(util.right(void 0));\n          }\n        })();\n\n        switch (status) {\n        case SUSPENDED:\n          interrupt = util.left(error);\n          status    = COMPLETED;\n          step      = interrupt;\n          run(runTick);\n          break;\n        case PENDING:\n          if (interrupt === null) {\n            interrupt = util.left(error);\n          }\n          if (bracketCount === 0) {\n            if (status === PENDING) {\n              attempts = new Aff(CONS, new Aff(FINALIZER, step(error)), attempts, interrupt);\n            }\n            status   = RETURN;\n            step     = null;\n            fail     = null;\n            run(++runTick);\n          }\n          break;\n        default:\n          if (interrupt === null) {\n            interrupt = util.left(error);\n          }\n          if (bracketCount === 0) {\n            status = RETURN;\n            step   = null;\n            fail   = null;\n          }\n        }\n\n        return canceler;\n      };\n    }\n\n    function join(cb) {\n      return function () {\n        var canceler = onComplete({\n          rethrow: false,\n          handler: cb\n        })();\n        if (status === SUSPENDED) {\n          run(runTick);\n        }\n        return canceler;\n      };\n    }\n\n    return {\n      kill: kill,\n      join: join,\n      onComplete: onComplete,\n      isSuspended: function () {\n        return status === SUSPENDED;\n      },\n      run: function () {\n        if (status === SUSPENDED) {\n          if (!Scheduler.isDraining()) {\n            Scheduler.enqueue(function () {\n              run(runTick);\n            });\n          } else {\n            run(runTick);\n          }\n        }\n      }\n    };\n  }\n\n  function runPar(util, supervisor, par, cb) {\n    // Table of all forked fibers.\n    var fiberId   = 0;\n    var fibers    = {};\n\n    // Table of currently running cancelers, as a product of `Alt` behavior.\n    var killId    = 0;\n    var kills     = {};\n\n    // Error used for early cancelation on Alt branches.\n    var early     = new Error(\"[ParAff] Early exit\");\n\n    // Error used to kill the entire tree.\n    var interrupt = null;\n\n    // The root pointer of the tree.\n    var root      = EMPTY;\n\n    // Walks a tree, invoking all the cancelers. Returns the table of pending\n    // cancellation fibers.\n    function kill(error, par, cb) {\n      var step  = par;\n      var head  = null;\n      var tail  = null;\n      var count = 0;\n      var kills = {};\n      var tmp, kid;\n\n      loop: while (true) {\n        tmp = null;\n\n        switch (step.tag) {\n        case FORKED:\n          if (step._3 === EMPTY) {\n            tmp = fibers[step._1];\n            kills[count++] = tmp.kill(error, function (result) {\n              return function () {\n                count--;\n                if (count === 0) {\n                  cb(result)();\n                }\n              };\n            });\n          }\n          // Terminal case.\n          if (head === null) {\n            break loop;\n          }\n          // Go down the right side of the tree.\n          step = head._2;\n          if (tail === null) {\n            head = null;\n          } else {\n            head = tail._1;\n            tail = tail._2;\n          }\n          break;\n        case MAP:\n          step = step._2;\n          break;\n        case APPLY:\n        case ALT:\n          if (head) {\n            tail = new Aff(CONS, head, tail);\n          }\n          head = step;\n          step = step._1;\n          break;\n        }\n      }\n\n      if (count === 0) {\n        cb(util.right(void 0))();\n      } else {\n        // Run the cancelation effects. We alias `count` because it's mutable.\n        kid = 0;\n        tmp = count;\n        for (; kid < tmp; kid++) {\n          kills[kid] = kills[kid]();\n        }\n      }\n\n      return kills;\n    }\n\n    // When a fiber resolves, we need to bubble back up the tree with the\n    // result, computing the applicative nodes.\n    function join(result, head, tail) {\n      var fail, step, lhs, rhs, tmp, kid;\n\n      if (util.isLeft(result)) {\n        fail = result;\n        step = null;\n      } else {\n        step = result;\n        fail = null;\n      }\n\n      loop: while (true) {\n        lhs = null;\n        rhs = null;\n        tmp = null;\n        kid = null;\n\n        // We should never continue if the entire tree has been interrupted.\n        if (interrupt !== null) {\n          return;\n        }\n\n        // We've made it all the way to the root of the tree, which means\n        // the tree has fully evaluated.\n        if (head === null) {\n          cb(fail || step)();\n          return;\n        }\n\n        // The tree has already been computed, so we shouldn't try to do it\n        // again. This should never happen.\n        // TODO: Remove this?\n        if (head._3 !== EMPTY) {\n          return;\n        }\n\n        switch (head.tag) {\n        case MAP:\n          if (fail === null) {\n            head._3 = util.right(head._1(util.fromRight(step)));\n            step    = head._3;\n          } else {\n            head._3 = fail;\n          }\n          break;\n        case APPLY:\n          lhs = head._1._3;\n          rhs = head._2._3;\n          // If we have a failure we should kill the other side because we\n          // can't possible yield a result anymore.\n          if (fail) {\n            head._3 = fail;\n            tmp     = true;\n            kid     = killId++;\n\n            kills[kid] = kill(early, fail === lhs ? head._2 : head._1, function (/* unused */) {\n              return function () {\n                delete kills[kid];\n                if (tmp) {\n                  tmp = false;\n                } else if (tail === null) {\n                  join(fail, null, null);\n                } else {\n                  join(fail, tail._1, tail._2);\n                }\n              };\n            });\n\n            if (tmp) {\n              tmp = false;\n              return;\n            }\n          } else if (lhs === EMPTY || rhs === EMPTY) {\n            // We can only proceed if both sides have resolved.\n            return;\n          } else {\n            step    = util.right(util.fromRight(lhs)(util.fromRight(rhs)));\n            head._3 = step;\n          }\n          break;\n        case ALT:\n          lhs = head._1._3;\n          rhs = head._2._3;\n          // We can only proceed if both have resolved or we have a success\n          if (lhs === EMPTY && util.isLeft(rhs) || rhs === EMPTY && util.isLeft(lhs)) {\n            return;\n          }\n          // If both sides resolve with an error, we should continue with the\n          // first error\n          if (lhs !== EMPTY && util.isLeft(lhs) && rhs !== EMPTY && util.isLeft(rhs)) {\n            fail    = step === lhs ? rhs : lhs;\n            step    = null;\n            head._3 = fail;\n          } else {\n            head._3 = step;\n            tmp     = true;\n            kid     = killId++;\n            // Once a side has resolved, we need to cancel the side that is still\n            // pending before we can continue.\n            kills[kid] = kill(early, step === lhs ? head._2 : head._1, function (/* unused */) {\n              return function () {\n                delete kills[kid];\n                if (tmp) {\n                  tmp = false;\n                } else if (tail === null) {\n                  join(step, null, null);\n                } else {\n                  join(step, tail._1, tail._2);\n                }\n              };\n            });\n\n            if (tmp) {\n              tmp = false;\n              return;\n            }\n          }\n          break;\n        }\n\n        if (tail === null) {\n          head = null;\n        } else {\n          head = tail._1;\n          tail = tail._2;\n        }\n      }\n    }\n\n    function resolve(fiber) {\n      return function (result) {\n        return function () {\n          delete fibers[fiber._1];\n          fiber._3 = result;\n          join(result, fiber._2._1, fiber._2._2);\n        };\n      };\n    }\n\n    // Walks the applicative tree, substituting non-applicative nodes with\n    // `FORKED` nodes. In this tree, all applicative nodes use the `_3` slot\n    // as a mutable slot for memoization. In an unresolved state, the `_3`\n    // slot is `EMPTY`. In the cases of `ALT` and `APPLY`, we always walk\n    // the left side first, because both operations are left-associative. As\n    // we `RETURN` from those branches, we then walk the right side.\n    function run() {\n      var status = CONTINUE;\n      var step   = par;\n      var head   = null;\n      var tail   = null;\n      var tmp, fid;\n\n      loop: while (true) {\n        tmp = null;\n        fid = null;\n\n        switch (status) {\n        case CONTINUE:\n          switch (step.tag) {\n          case MAP:\n            if (head) {\n              tail = new Aff(CONS, head, tail);\n            }\n            head = new Aff(MAP, step._1, EMPTY, EMPTY);\n            step = step._2;\n            break;\n          case APPLY:\n            if (head) {\n              tail = new Aff(CONS, head, tail);\n            }\n            head = new Aff(APPLY, EMPTY, step._2, EMPTY);\n            step = step._1;\n            break;\n          case ALT:\n            if (head) {\n              tail = new Aff(CONS, head, tail);\n            }\n            head = new Aff(ALT, EMPTY, step._2, EMPTY);\n            step = step._1;\n            break;\n          default:\n            // When we hit a leaf value, we suspend the stack in the `FORKED`.\n            // When the fiber resolves, it can bubble back up the tree.\n            fid    = fiberId++;\n            status = RETURN;\n            tmp    = step;\n            step   = new Aff(FORKED, fid, new Aff(CONS, head, tail), EMPTY);\n            tmp    = Fiber(util, supervisor, tmp);\n            tmp.onComplete({\n              rethrow: false,\n              handler: resolve(step)\n            })();\n            fibers[fid] = tmp;\n            if (supervisor) {\n              supervisor.register(tmp);\n            }\n          }\n          break;\n        case RETURN:\n          // Terminal case, we are back at the root.\n          if (head === null) {\n            break loop;\n          }\n          // If we are done with the right side, we need to continue down the\n          // left. Otherwise we should continue up the stack.\n          if (head._1 === EMPTY) {\n            head._1 = step;\n            status  = CONTINUE;\n            step    = head._2;\n            head._2 = EMPTY;\n          } else {\n            head._2 = step;\n            step    = head;\n            if (tail === null) {\n              head  = null;\n            } else {\n              head  = tail._1;\n              tail  = tail._2;\n            }\n          }\n        }\n      }\n\n      // Keep a reference to the tree root so it can be cancelled.\n      root = step;\n\n      for (fid = 0; fid < fiberId; fid++) {\n        fibers[fid].run();\n      }\n    }\n\n    // Cancels the entire tree. If there are already subtrees being canceled,\n    // we need to first cancel those joins. We will then add fresh joins for\n    // all pending branches including those that were in the process of being\n    // canceled.\n    function cancel(error, cb) {\n      interrupt = util.left(error);\n      var innerKills;\n      for (var kid in kills) {\n        if (kills.hasOwnProperty(kid)) {\n          innerKills = kills[kid];\n          for (kid in innerKills) {\n            if (innerKills.hasOwnProperty(kid)) {\n              innerKills[kid]();\n            }\n          }\n        }\n      }\n\n      kills = null;\n      var newKills = kill(error, root, cb);\n\n      return function (killError) {\n        return new Aff(ASYNC, function (killCb) {\n          return function () {\n            for (var kid in newKills) {\n              if (newKills.hasOwnProperty(kid)) {\n                newKills[kid]();\n              }\n            }\n            return nonCanceler;\n          };\n        });\n      };\n    }\n\n    run();\n\n    return function (killError) {\n      return new Aff(ASYNC, function (killCb) {\n        return function () {\n          return cancel(killError, killCb);\n        };\n      });\n    };\n  }\n\n  function sequential(util, supervisor, par) {\n    return new Aff(ASYNC, function (cb) {\n      return function () {\n        return runPar(util, supervisor, par, cb);\n      };\n    });\n  }\n\n  Aff.EMPTY       = EMPTY;\n  Aff.Pure        = AffCtr(PURE);\n  Aff.Throw       = AffCtr(THROW);\n  Aff.Catch       = AffCtr(CATCH);\n  Aff.Sync        = AffCtr(SYNC);\n  Aff.Async       = AffCtr(ASYNC);\n  Aff.Bind        = AffCtr(BIND);\n  Aff.Bracket     = AffCtr(BRACKET);\n  Aff.Fork        = AffCtr(FORK);\n  Aff.Seq         = AffCtr(SEQ);\n  Aff.ParMap      = AffCtr(MAP);\n  Aff.ParApply    = AffCtr(APPLY);\n  Aff.ParAlt      = AffCtr(ALT);\n  Aff.Fiber       = Fiber;\n  Aff.Supervisor  = Supervisor;\n  Aff.Scheduler   = Scheduler;\n  Aff.nonCanceler = nonCanceler;\n\n  return Aff;\n}();\n\nexport const _pure = Aff.Pure;\nexport const _throwError = Aff.Throw;\n\nexport function _catchError(aff) {\n  return function (k) {\n    return Aff.Catch(aff, k);\n  };\n}\n\nexport function _map(f) {\n  return function (aff) {\n    if (aff.tag === Aff.Pure.tag) {\n      return Aff.Pure(f(aff._1));\n    } else {\n      return Aff.Bind(aff, function (value) {\n        return Aff.Pure(f(value));\n      });\n    }\n  };\n}\n\nexport function _bind(aff) {\n  return function (k) {\n    return Aff.Bind(aff, k);\n  };\n}\n\nexport function _fork(immediate) {\n  return function (aff) {\n    return Aff.Fork(immediate, aff);\n  };\n}\n\nexport const _liftEffect = Aff.Sync;\n\nexport function _parAffMap(f) {\n  return function (aff) {\n    return Aff.ParMap(f, aff);\n  };\n}\n\nexport function _parAffApply(aff1) {\n  return function (aff2) {\n    return Aff.ParApply(aff1, aff2);\n  };\n}\n\nexport function _parAffAlt(aff1) {\n  return function (aff2) {\n    return Aff.ParAlt(aff1, aff2);\n  };\n}\n\nexport const makeAff = Aff.Async;\n\nexport function generalBracket(acquire) {\n  return function (options) {\n    return function (k) {\n      return Aff.Bracket(acquire, options, k);\n    };\n  };\n}\n\nexport function _makeFiber(util, aff) {\n  return function () {\n    return Aff.Fiber(util, null, aff);\n  };\n}\n\nexport function _makeSupervisedFiber(util, aff) {\n  return function () {\n    var supervisor = Aff.Supervisor(util);\n    return {\n      fiber: Aff.Fiber(util, supervisor, aff),\n      supervisor: supervisor\n    };\n  };\n}\n\nexport function _killAll(error, supervisor, cb) {\n  return supervisor.killAll(error, cb);\n}\n\nexport const _delay = function () {\n  function setDelay(n, k) {\n    if (n === 0 && typeof setImmediate !== \"undefined\") {\n      return setImmediate(k);\n    } else {\n      return setTimeout(k, n);\n    }\n  }\n\n  function clearDelay(n, t) {\n    if (n === 0 && typeof clearImmediate !== \"undefined\") {\n      return clearImmediate(t);\n    } else {\n      return clearTimeout(t);\n    }\n  }\n\n  return function (right, ms) {\n    return Aff.Async(function (cb) {\n      return function () {\n        var timer = setDelay(ms, cb(right()));\n        return function () {\n          return Aff.Sync(function () {\n            return right(clearDelay(ms, timer));\n          });\n        };\n      };\n    });\n  };\n}();\n\nexport const _sequential = Aff.Seq;\n", "module Data.Profunctor where\n\nimport Prelude\nimport Data.Newtype (class Newtype, wrap, unwrap)\n\n-- | A `Profunctor` is a `Functor` from the pair category `(Type^op, Type)`\n-- | to `Type`.\n-- |\n-- | In other words, a `Profunctor` is a type constructor of two type\n-- | arguments, which is contravariant in its first argument and covariant\n-- | in its second argument.\n-- |\n-- | The `dimap` function can be used to map functions over both arguments\n-- | simultaneously.\n-- |\n-- | A straightforward example of a profunctor is the function arrow `(->)`.\n-- |\n-- | Laws:\n-- |\n-- | - Identity: `dimap identity identity = identity`\n-- | - Composition: `dimap f1 g1 <<< dimap f2 g2 = dimap (f1 >>> f2) (g1 <<< g2)`\nclass Profunctor p where\n  dimap :: forall a b c d. (a -> b) -> (c -> d) -> p b c -> p a d\n\n-- | Map a function over the (contravariant) first type argument only.\nlcmap :: forall a b c p. Profunctor p => (a -> b) -> p b c -> p a c\nlcmap a2b = dimap a2b identity\n\n-- | Map a function over the (covariant) second type argument only.\nrmap :: forall a b c p. Profunctor p => (b -> c) -> p a b -> p a c\nrmap b2c = dimap identity b2c\n\n-- | Lift a pure function into any `Profunctor` which is also a `Category`.\narr :: forall a b p. Category p => Profunctor p => (a -> b) -> p a b\narr f = rmap f identity\n\nunwrapIso :: forall p t a. Profunctor p => Newtype t a => p t t -> p a a\nunwrapIso = dimap wrap unwrap\n\nwrapIso :: forall p t a. Profunctor p => Newtype t a => (a -> t) -> p a a -> p t t\nwrapIso _ = dimap unwrap wrap\n\ninstance profunctorFn :: Profunctor (->) where\n  dimap a2b c2d b2c = a2b >>> b2c >>> c2d\n", "module Control.Parallel.Class where\n\nimport Prelude\n\nimport Control.Alt (class Alt)\nimport Control.Alternative (class Alternative)\nimport Control.Monad.Cont.Trans (ContT(..), runContT)\nimport Control.Monad.Except.Trans (ExceptT(..))\nimport Control.Monad.Maybe.Trans (MaybeT(..))\nimport Control.Monad.Reader.Trans (mapReaderT, ReaderT)\nimport Control.Monad.Writer.Trans (mapWriterT, WriterT)\nimport Control.Plus (class Plus)\nimport Data.Either (Either)\nimport Data.Functor.Compose (Compose(..))\nimport Data.Functor.Costar (Costar(..))\nimport Data.Maybe (Maybe(..))\nimport Data.Newtype (class Newtype)\nimport Data.Profunctor.Star (Star(..))\nimport Effect.Class (class MonadEffect, liftEffect)\nimport Effect.Ref as Ref\n\n-- | The `Parallel` class abstracts over pairs of `Apply`s where one of them\n-- | (`m`) composes sequentially, and the other (`f`) composes in parallel.\n-- | `m` is usually a `Monad`, which enforces the sequential nature of its\n-- | composition, but it doesn't need to be.\nclass (Apply m, Apply f) <= Parallel f m | m -> f, f -> m where\n  parallel :: m ~> f\n  sequential :: f ~> m\n\ninstance monadParExceptT :: (Parallel f m, Monad m) => Parallel (Compose f (Either e)) (ExceptT e m) where\n  parallel (ExceptT ma) = Compose (parallel ma)\n  sequential (Compose fa) = ExceptT (sequential fa)\n\ninstance monadParReaderT :: Parallel f m => Parallel (ReaderT e f) (ReaderT e m) where\n  parallel = mapReaderT parallel\n  sequential = mapReaderT sequential\n\ninstance monadParWriterT :: (Monoid w, Parallel f m) => Parallel (WriterT w f) (WriterT w m) where\n  parallel = mapWriterT parallel\n  sequential = mapWriterT sequential\n\ninstance monadParMaybeT :: (Parallel f m, Monad m) => Parallel (Compose f Maybe) (MaybeT m) where\n  parallel (MaybeT ma) = Compose (parallel ma)\n  sequential (Compose fa) = MaybeT (sequential fa)\n\ninstance monadParStar :: Parallel f m => Parallel (Star f a) (Star m a) where\n  parallel (Star f) = (Star $ parallel <<< f)\n  sequential (Star f) = (Star $ sequential <<< f)\n\ninstance monadParCostar :: Parallel f m => Parallel (Costar f a) (Costar m a) where\n  parallel (Costar f) = (Costar $ sequential >>> f)\n  sequential (Costar f) = (Costar $ parallel >>> f)\n\n-- | The `ParCont` type constructor provides an `Applicative` instance\n-- | based on `ContT Unit m`, which waits for multiple continuations to be\n-- | resumed simultaneously.\n-- |\n-- | ParCont sections of code can be embedded in sequential code by using\n-- | the `parallel` and `sequential` functions:\n-- |\n-- | ```purescript\n-- | loadModel :: ContT Unit (Eff (ajax :: AJAX)) Model\n-- | loadModel = do\n-- |   token <- authenticate\n-- |   sequential $\n-- |     Model <$> parallel (get \"/products/popular/\" token)\n-- |           <*> parallel (get \"/categories/all\" token)\n-- | ```\nnewtype ParCont m a = ParCont (ContT Unit m a)\n\nderive instance newtypeParCont :: Newtype (ParCont m a) _\n\ninstance functorParCont :: MonadEffect m => Functor (ParCont m) where\n  map f = parallel <<< map f <<< sequential\n\ninstance applyParCont :: MonadEffect m => Apply (ParCont m) where\n  apply (ParCont ca) (ParCont cb) = ParCont $ ContT \\k -> do\n    ra <- liftEffect (Ref.new Nothing)\n    rb <- liftEffect (Ref.new Nothing)\n\n    runContT ca \\a -> do\n      mb <- liftEffect (Ref.read rb)\n      case mb of\n        Nothing -> liftEffect (Ref.write (Just a) ra)\n        Just b -> k (a b)\n\n    runContT cb \\b -> do\n      ma <- liftEffect (Ref.read ra)\n      case ma of\n        Nothing -> liftEffect (Ref.write (Just b) rb)\n        Just a -> k (a b)\n\ninstance applicativeParCont :: MonadEffect m => Applicative (ParCont m) where\n  pure = parallel <<< pure\n\ninstance altParCont :: MonadEffect m => Alt (ParCont m) where\n  alt (ParCont c1) (ParCont c2) = ParCont $ ContT \\k -> do\n    done <- liftEffect (Ref.new false)\n\n    runContT c1 \\a -> do\n      b <- liftEffect (Ref.read done)\n      if b\n        then pure unit\n        else do\n          liftEffect (Ref.write true done)\n          k a\n\n    runContT c2 \\a -> do\n      b <- liftEffect (Ref.read done)\n      if b\n        then pure unit\n        else do\n          liftEffect (Ref.write true done)\n          k a\n\ninstance plusParCont :: MonadEffect m => Plus (ParCont m) where\n  empty = ParCont $ ContT \\_ -> pure unit\n\ninstance alternativeParCont :: MonadEffect m => Alternative (ParCont m)\n\ninstance monadParParCont :: MonadEffect m => Parallel (ParCont m) (ContT Unit m) where\n  parallel = ParCont\n  sequential (ParCont ma) = ma\n", "module Control.Parallel\n  ( parApply\n  , parTraverse\n  , parTraverse_\n  , parSequence\n  , parSequence_\n  , parOneOf\n  , parOneOfMap\n  , module Control.Parallel.Class\n  ) where\n\nimport Prelude\n\nimport Control.Alternative (class Alternative)\nimport Control.Parallel.Class (class Parallel, parallel, sequential, ParCont(..))\n\nimport Data.Foldable (class Foldable, traverse_, oneOfMap)\nimport Data.Traversable (class Traversable, traverse)\n\n-- | Apply a function to an argument under a type constructor in parallel.\nparApply\n  :: forall f m a b\n   . Parallel f m\n   => m (a -> b)\n   -> m a\n   -> m b\nparApply mf ma = sequential(apply (parallel mf) (parallel ma))\n\n-- | Traverse a collection in parallel.\nparTraverse\n  :: forall f m t a b\n   . Parallel f m\n  => Applicative f\n  => Traversable t\n  => (a -> m b)\n  -> t a\n  -> m (t b)\nparTraverse f = sequential <<< traverse (parallel <<< f)\n\n-- | Traverse a collection in parallel, discarding any results.\nparTraverse_\n  :: forall f m t a b\n   . Parallel f m\n  => Applicative f\n  => Foldable t\n  => (a -> m b)\n  -> t a\n  -> m Unit\nparTraverse_ f = sequential <<< traverse_ (parallel <<< f)\n\nparSequence\n  :: forall a t m f\n   . Parallel f m\n  => Applicative f\n  => Traversable t\n  => t (m a)\n  -> m (t a)\nparSequence = parTraverse identity\n\nparSequence_\n  :: forall a t m f\n   . Parallel f m\n  => Applicative f\n  => Foldable t\n  => t (m a)\n  -> m Unit\nparSequence_ = parTraverse_ identity\n\n-- | Race a collection in parallel.\nparOneOf\n  :: forall a t m f\n   . Parallel f m\n  => Alternative f\n  => Foldable t\n  => Functor t\n  => t (m a)\n  -> m a\nparOneOf = sequential <<< oneOfMap parallel\n\n-- | Race a collection in parallel while mapping to some effect.\nparOneOfMap\n  :: forall a b t m f\n   . Parallel f m\n  => Alternative f\n  => Foldable t\n  => Functor t\n  => (a -> m b)\n  -> t a\n  -> m b\nparOneOfMap f = sequential <<< oneOfMap (parallel <<< f)\n", "export const unsafePerformEffect = function (f) {\n  return f();\n};\n", "module Effect.Aff\n  ( Aff\n  , Fiber\n  , ParAff(..)\n  , Canceler(..)\n  , makeAff\n  , launchAff\n  , launchAff_\n  , launchSuspendedAff\n  , runAff\n  , runAff_\n  , runSuspendedAff\n  , forkAff\n  , suspendAff\n  , supervise\n  , attempt\n  , apathize\n  , delay\n  , never\n  , finally\n  , invincible\n  , killFiber\n  , joinFiber\n  , cancelWith\n  , bracket\n  , BracketConditions\n  , generalBracket\n  , nonCanceler\n  , effectCanceler\n  , fiberCanceler\n  , module Exports\n  ) where\n\nimport Prelude\n\nimport Control.Alt (class Alt)\nimport Control.Alternative (class Alternative)\nimport Control.Apply (lift2)\nimport Control.Lazy (class Lazy)\nimport Control.Monad.Error.Class (class MonadError, class MonadThrow, throwError, catchError, try)\nimport Control.Monad.Error.Class (try, throwError, catchError) as Exports\nimport Control.Monad.Rec.Class (class MonadRec, Step(..))\nimport Control.Monad.ST.Class (class MonadST, liftST)\nimport Control.Monad.ST.Global (Global)\nimport Control.Parallel (parSequence_, parallel)\nimport Control.Parallel.Class (class Parallel)\nimport Control.Parallel.Class (sequential, parallel) as Exports\nimport Control.Plus (class Plus, empty)\nimport Data.Either (Either(..))\nimport Data.Function.Uncurried as Fn\nimport Data.Newtype (class Newtype)\nimport Data.Time.Duration (Milliseconds(..))\nimport Data.Time.Duration (Milliseconds(..)) as Exports\nimport Effect (Effect)\nimport Effect.Class (class MonadEffect, liftEffect)\nimport Effect.Exception (Error, error)\nimport Effect.Exception (Error, error, message) as Exports\nimport Effect.Unsafe (unsafePerformEffect)\nimport Partial.Unsafe (unsafeCrashWith)\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | An `Aff a` is an asynchronous computation with effects. The\n-- | computation may either error with an exception, or produce a result of\n-- | type `a`. `Aff` effects are assembled from primitive `Effect` effects using\n-- | `makeAff` or `liftEffect`.\nforeign import data Aff :: Type -> Type\n\ntype role Aff representational\n\ninstance functorAff :: Functor Aff where\n  map = _map\n\ninstance applyAff :: Apply Aff where\n  apply = ap\n\ninstance applicativeAff :: Applicative Aff where\n  pure = _pure\n\ninstance bindAff :: Bind Aff where\n  bind = _bind\n\ninstance monadAff :: Monad Aff\n\ninstance semigroupAff :: Semigroup a => Semigroup (Aff a) where\n  append = lift2 append\n\ninstance monoidAff :: Monoid a => Monoid (Aff a) where\n  mempty = pure mempty\n\ninstance altAff :: Alt Aff where\n  alt a1 a2 = catchError a1 (const a2)\n\ninstance plusAff :: Plus Aff where\n  empty = throwError (error \"Always fails\")\n\n-- | This instance is provided for compatibility. `Aff` is always stack-safe\n-- | within a given fiber. This instance will just result in unnecessary\n-- | bind overhead.\ninstance monadRecAff :: MonadRec Aff where\n  tailRecM k = go\n    where\n    go a = do\n      res <- k a\n      case res of\n        Done r -> pure r\n        Loop b -> go b\n\ninstance monadThrowAff :: MonadThrow Error Aff where\n  throwError = _throwError\n\ninstance monadErrorAff :: MonadError Error Aff where\n  catchError = _catchError\n\ninstance monadEffectAff :: MonadEffect Aff where\n  liftEffect = _liftEffect\n\ninstance lazyAff :: Lazy (Aff a) where\n  defer f = pure unit >>= f\n\ninstance monadSTAff :: MonadST Global Aff where\n  liftST = liftST >>> liftEffect\n\n-- | Applicative for running parallel effects. Any `Aff` can be coerced to a\n-- | `ParAff` and back using the `Parallel` class.\nforeign import data ParAff :: Type -> Type\n\ntype role ParAff representational\n\ninstance functorParAff :: Functor ParAff where\n  map = _parAffMap\n\n-- | Runs effects in parallel, combining their results.\ninstance applyParAff :: Apply ParAff where\n  apply = _parAffApply\n\ninstance applicativeParAff :: Applicative ParAff where\n  pure = parallel <<< pure\n\ninstance semigroupParAff :: Semigroup a => Semigroup (ParAff a) where\n  append = lift2 append\n\ninstance monoidParAff :: Monoid a => Monoid (ParAff a) where\n  mempty = pure mempty\n\n-- | Races effects in parallel. Returns the first successful result or the\n-- | first error if all fail with an exception. Losing branches will be\n-- | cancelled.\ninstance altParAff :: Alt ParAff where\n  alt = _parAffAlt\n\ninstance plusParAff :: Plus ParAff where\n  empty = parallel empty\n\ninstance alternativeParAff :: Alternative ParAff\n\ninstance parallelAff :: Parallel ParAff Aff where\n  parallel = (unsafeCoerce :: forall a. Aff a -> ParAff a)\n  sequential = _sequential\n\ntype OnComplete a =\n  { rethrow :: Boolean\n  , handler :: (Either Error a -> Effect Unit) -> Effect Unit\n  }\n\n-- | Represents a forked computation by way of `forkAff`. `Fiber`s are\n-- | memoized, so their results are only computed once.\nnewtype Fiber a = Fiber\n  { run :: Effect Unit\n  , kill :: Fn.Fn2 Error (Either Error Unit -> Effect Unit) (Effect (Effect Unit))\n  , join :: (Either Error a -> Effect Unit) -> Effect (Effect Unit)\n  , onComplete :: OnComplete a -> Effect (Effect Unit)\n  , isSuspended :: Effect Boolean\n  }\n\ninstance functorFiber :: Functor Fiber where\n  map f t = unsafePerformEffect (makeFiber (f <$> joinFiber t))\n\ninstance applyFiber :: Apply Fiber where\n  apply t1 t2 = unsafePerformEffect (makeFiber (joinFiber t1 <*> joinFiber t2))\n\ninstance applicativeFiber :: Applicative Fiber where\n  pure a = unsafePerformEffect (makeFiber (pure a))\n\n-- | Invokes pending cancelers in a fiber and runs cleanup effects. Blocks\n-- | until the fiber has fully exited.\nkillFiber :: forall a. Error -> Fiber a -> Aff Unit\nkillFiber e (Fiber t) = do\n  suspended <- liftEffect t.isSuspended\n  if suspended then\n    liftEffect $ void $ Fn.runFn2 t.kill e (const (pure unit))\n  else\n    makeAff \\k -> effectCanceler <$> Fn.runFn2 t.kill e k\n\n-- | Blocks until the fiber completes, yielding the result. If the fiber\n-- | throws an exception, it is rethrown in the current fiber.\njoinFiber :: Fiber ~> Aff\njoinFiber (Fiber t) = makeAff \\k -> effectCanceler <$> t.join k\n\n-- | A cancellation effect for actions run via `makeAff`. If a `Fiber` is\n-- | killed, and an async action is pending, the canceler will be called to\n-- | clean it up.\nnewtype Canceler = Canceler (Error -> Aff Unit)\n\nderive instance newtypeCanceler :: Newtype Canceler _\n\ninstance semigroupCanceler :: Semigroup Canceler where\n  append (Canceler c1) (Canceler c2) =\n    Canceler \\err -> parSequence_ [ c1 err, c2 err ]\n\n-- | A no-op `Canceler` can be constructed with `mempty`.\ninstance monoidCanceler :: Monoid Canceler where\n  mempty = nonCanceler\n\n-- | A canceler which does not cancel anything.\nnonCanceler :: Canceler\nnonCanceler = Canceler (const (pure unit))\n\n-- | A canceler from an Effect action.\neffectCanceler :: Effect Unit -> Canceler\neffectCanceler = Canceler <<< const <<< liftEffect\n\n-- | A canceler from a Fiber.\nfiberCanceler :: forall a. Fiber a -> Canceler\nfiberCanceler = Canceler <<< flip killFiber\n\n-- | Forks an `Aff` from an `Effect` context, returning the `Fiber`.\nlaunchAff :: forall a. Aff a -> Effect (Fiber a)\nlaunchAff aff = do\n  fiber <- makeFiber aff\n  case fiber of Fiber f -> f.run\n  pure fiber\n\n-- | Forks an `Aff` from an `Effect` context, discarding the `Fiber`.\nlaunchAff_ :: Aff Unit -> Effect Unit\nlaunchAff_ = void <<< launchAff\n\n-- | Suspends an `Aff` from an `Effect` context, returning the `Fiber`.\nlaunchSuspendedAff :: forall a. Aff a -> Effect (Fiber a)\nlaunchSuspendedAff = makeFiber\n\n-- | Forks an `Aff` from an `Effect` context and also takes a callback to run when\n-- | it completes. Returns the pending `Fiber`.\nrunAff :: forall a. (Either Error a -> Effect Unit) -> Aff a -> Effect (Fiber Unit)\nrunAff k aff = launchAff $ liftEffect <<< k =<< try aff\n\n-- | Forks an `Aff` from an `Effect` context and also takes a callback to run when\n-- | it completes, discarding the `Fiber`.\nrunAff_ :: forall a. (Either Error a -> Effect Unit) -> Aff a -> Effect Unit\nrunAff_ k aff = void $ runAff k aff\n\n-- | Suspends an `Aff` from an `Effect` context and also takes a callback to run\n-- | when it completes. Returns the suspended `Fiber`.\nrunSuspendedAff :: forall a. (Either Error a -> Effect Unit) -> Aff a -> Effect (Fiber Unit)\nrunSuspendedAff k aff = launchSuspendedAff $ liftEffect <<< k =<< try aff\n\n-- | Forks an `Aff` from within a parent `Aff` context, returning the `Fiber`.\nforkAff :: forall a. Aff a -> Aff (Fiber a)\nforkAff = _fork true\n\n-- | Suspends an `Aff` from within a parent `Aff` context, returning the `Fiber`.\n-- | A suspended `Aff` is not executed until a consumer observes the result\n-- | with `joinFiber`.\nsuspendAff :: forall a. Aff a -> Aff (Fiber a)\nsuspendAff = _fork false\n\n-- | Pauses the running fiber.\ndelay :: Milliseconds -> Aff Unit\ndelay (Milliseconds n) = Fn.runFn2 _delay Right n\n\n-- | An async computation which does not resolve.\nnever :: forall a. Aff a\nnever = makeAff \\_ -> pure mempty\n\n-- | A monomorphic version of `try`. Catches thrown errors and lifts them\n-- | into an `Either`.\nattempt :: forall a. Aff a -> Aff (Either Error a)\nattempt = try\n\n-- | Ignores any errors.\napathize :: forall a. Aff a -> Aff Unit\napathize = attempt >>> map (const unit)\n\n-- | Runs the first effect after the second, regardless of whether it completed\n-- | successfully or the fiber was cancelled.\nfinally :: forall a. Aff Unit -> Aff a -> Aff a\nfinally fin a = bracket (pure unit) (const fin) (const a)\n\n-- | Runs an effect such that it cannot be killed.\ninvincible :: forall a. Aff a -> Aff a\ninvincible a = bracket a (const (pure unit)) pure\n\n-- | Attaches a custom `Canceler` to an action. If the computation is canceled,\n-- | then the custom `Canceler` will be run afterwards.\ncancelWith :: forall a. Aff a -> Canceler -> Aff a\ncancelWith aff (Canceler cancel) =\n  generalBracket (pure unit)\n    { killed: \\e _ -> cancel e\n    , failed: const pure\n    , completed: const pure\n    }\n    (const aff)\n\n-- | Guarantees resource acquisition and cleanup. The first effect may acquire\n-- | some resource, while the second will dispose of it. The third effect makes\n-- | use of the resource. Disposal is always run last, regardless. Neither\n-- | acquisition nor disposal may be cancelled and are guaranteed to run until\n-- | they complete.\nbracket :: forall a b. Aff a -> (a -> Aff Unit) -> (a -> Aff b) -> Aff b\nbracket acquire completed =\n  generalBracket acquire\n    { killed: const completed\n    , failed: const completed\n    , completed: const completed\n    }\n\ntype Supervised a =\n  { fiber :: Fiber a\n  , supervisor :: Supervisor\n  }\n\n-- | Creates a new supervision context for some `Aff`, guaranteeing fiber\n-- | cleanup when the parent completes. Any pending fibers forked within\n-- | the context will be killed and have their cancelers run.\nsupervise :: forall a. Aff a -> Aff a\nsupervise aff =\n  generalBracket (liftEffect acquire)\n    { killed: \\err sup -> parSequence_ [ killFiber err sup.fiber, killAll err sup ]\n    , failed: const (killAll killError)\n    , completed: const (killAll killError)\n    }\n    (joinFiber <<< _.fiber)\n  where\n  killError :: Error\n  killError =\n    error \"[Aff] Child fiber outlived parent\"\n\n  killAll :: Error -> Supervised a -> Aff Unit\n  killAll err sup = makeAff \\k ->\n    Fn.runFn3 _killAll err sup.supervisor (k (pure unit))\n\n  acquire :: Effect (Supervised a)\n  acquire = do\n    sup <- Fn.runFn2 _makeSupervisedFiber ffiUtil aff\n    case sup.fiber of Fiber f -> f.run\n    pure sup\n\nforeign import data Supervisor :: Type\nforeign import _pure :: forall a. a -> Aff a\nforeign import _throwError :: forall a. Error -> Aff a\nforeign import _catchError :: forall a. Aff a -> (Error -> Aff a) -> Aff a\nforeign import _fork :: forall a. Boolean -> Aff a -> Aff (Fiber a)\nforeign import _map :: forall a b. (a -> b) -> Aff a -> Aff b\nforeign import _bind :: forall a b. Aff a -> (a -> Aff b) -> Aff b\nforeign import _delay :: forall a. Fn.Fn2 (Unit -> Either a Unit) Number (Aff Unit)\nforeign import _liftEffect :: forall a. Effect a -> Aff a\nforeign import _parAffMap :: forall a b. (a -> b) -> ParAff a -> ParAff b\nforeign import _parAffApply :: forall a b. ParAff (a -> b) -> ParAff a -> ParAff b\nforeign import _parAffAlt :: forall a. ParAff a -> ParAff a -> ParAff a\nforeign import _makeFiber :: forall a. Fn.Fn2 FFIUtil (Aff a) (Effect (Fiber a))\nforeign import _makeSupervisedFiber :: forall a. Fn.Fn2 FFIUtil (Aff a) (Effect (Supervised a))\nforeign import _killAll :: Fn.Fn3 Error Supervisor (Effect Unit) (Effect Canceler)\nforeign import _sequential :: ParAff ~> Aff\n\ntype BracketConditions a b =\n  { killed :: Error -> a -> Aff Unit\n  , failed :: Error -> a -> Aff Unit\n  , completed :: b -> a -> Aff Unit\n  }\n\n-- | A general purpose bracket which lets you observe the status of the\n-- | bracketed action. The bracketed action may have been killed with an\n-- | exception, thrown an exception, or completed successfully.\nforeign import generalBracket :: forall a b. Aff a -> BracketConditions a b -> (a -> Aff b) -> Aff b\n\n-- | Constructs an `Aff` from low-level `Effect` effects using a callback. A\n-- | `Canceler` effect should be returned to cancel the pending action. The\n-- | supplied callback may be invoked only once. Subsequent invocation are\n-- | ignored.\nforeign import makeAff :: forall a. ((Either Error a -> Effect Unit) -> Effect Canceler) -> Aff a\n\nmakeFiber :: forall a. Aff a -> Effect (Fiber a)\nmakeFiber aff = Fn.runFn2 _makeFiber ffiUtil aff\n\nnewtype FFIUtil = FFIUtil\n  { isLeft :: forall a b. Either a b -> Boolean\n  , fromLeft :: forall a b. Either a b -> a\n  , fromRight :: forall a b. Either a b -> b\n  , left :: forall a b. a -> Either a b\n  , right :: forall a b. b -> Either a b\n  }\n\nffiUtil :: FFIUtil\nffiUtil = FFIUtil\n  { isLeft\n  , fromLeft: unsafeFromLeft\n  , fromRight: unsafeFromRight\n  , left: Left\n  , right: Right\n  }\n  where\n  isLeft :: forall a b. Either a b -> Boolean\n  isLeft = case _ of\n    Left _ -> true\n    Right _ -> false\n\n  unsafeFromLeft :: forall a b. Either a b -> a\n  unsafeFromLeft = case _ of\n    Left a -> a\n    Right _ -> unsafeCrashWith \"unsafeFromLeft: Right\"\n\n  unsafeFromRight :: forall a b. Either a b -> b\n  unsafeFromRight = case _ of\n    Right a -> a\n    Left _ -> unsafeCrashWith \"unsafeFromRight: Left\"\n", "-- | This module provides compatability functions for constructing `Aff`s which\n-- | are defined via the FFI.\nmodule Effect.Aff.Compat\n  ( EffectFnAff(..)\n  , EffectFnCanceler(..)\n  , EffectFnCb\n  , fromEffectFnAff\n  , module Effect.Uncurried\n  ) where\n\nimport Prelude\nimport Data.Either (Either(..))\nimport Effect.Aff (Aff, Canceler(..), makeAff, nonCanceler)\nimport Effect.Exception (Error)\nimport Effect.Uncurried (EffectFn1, EffectFn2, EffectFn3, mkEffectFn1, mkEffectFn2, mkEffectFn3, runEffectFn1, runEffectFn2, runEffectFn3)\n\ntype EffectFnCb a = EffectFn1 a Unit\n\nnewtype EffectFnAff a = EffectFnAff (EffectFn2 (EffectFnCb Error) (EffectFnCb a) EffectFnCanceler)\n\nnewtype EffectFnCanceler = EffectFnCanceler (EffectFn3 Error (EffectFnCb Error) (EffectFnCb Unit) Unit)\n\n-- | Lift a FFI definition into an `Aff`. `EffectFnAff` makes use of `EffectFn` so\n-- | `Effect` thunks are unnecessary. A definition might follow this example:\n-- |\n-- | ```javascript\n-- | exports._myAff = function (onError, onSuccess) {\n-- |   var cancel = doSomethingAsync(function (err, res) {\n-- |     if (err) {\n-- |       onError(err);\n-- |     } else {\n-- |       onSuccess(res);\n-- |     }\n-- |   });\n-- |   return function (cancelError, onCancelerError, onCancelerSuccess) {\n-- |     cancel();\n-- |     onCancelerSuccess();\n-- |   };\n-- | };\n-- | ```\n-- |\n-- | ```purescript\n-- | foreign import _myAff :: EffectFnAff String\n-- |\n-- | myAff :: Aff String\n-- | myAff = fromEffectFnAff _myAff\n-- | ````\nfromEffectFnAff :: EffectFnAff ~> Aff\nfromEffectFnAff (EffectFnAff eff) = makeAff \\k -> do\n  EffectFnCanceler canceler <- runEffectFn2 eff (mkEffectFn1 (k <<< Left)) (mkEffectFn1 (k <<< Right))\n  pure $ Canceler \\e -> makeAff \\k2 -> do\n    runEffectFn3 canceler e (mkEffectFn1 (k2 <<< Left)) (mkEffectFn1 (k2 <<< Right))\n    pure nonCanceler\n", "export function typeOf(value) {\n  return typeof value;\n}\n\nexport function tagOf(value) {\n  return Object.prototype.toString.call(value).slice(8, -1);\n}\n\nexport function isNull(value) {\n  return value === null;\n}\n\nexport function isUndefined(value) {\n  return value === undefined;\n}\n\nexport const isArray = Array.isArray || function (value) {\n  return Object.prototype.toString.call(value) === \"[object Array]\";\n};\n", "export const fromNumberImpl = function (just) {\n  return function (nothing) {\n    return function (n) {\n      /* jshint bitwise: false */\n      return (n | 0) === n ? just(n) : nothing;\n    };\n  };\n};\n\nexport const toNumber = function (n) {\n  return n;\n};\n\nexport const fromStringAsImpl = function (just) {\n  return function (nothing) {\n    return function (radix) {\n      var digits;\n      if (radix < 11) {\n        digits = \"[0-\" + (radix - 1).toString() + \"]\";\n      } else if (radix === 11) {\n        digits = \"[0-9a]\";\n      } else {\n        digits = \"[0-9a-\" + String.fromCharCode(86 + radix) + \"]\";\n      }\n      var pattern = new RegExp(\"^[\\\\+\\\\-]?\" + digits + \"+$\", \"i\");\n\n      return function (s) {\n        /* jshint bitwise: false */\n        if (pattern.test(s)) {\n          var i = parseInt(s, radix);\n          return (i | 0) === i ? just(i) : nothing;\n        } else {\n          return nothing;\n        }\n      };\n    };\n  };\n};\n\nexport const toStringAs = function (radix) {\n  return function (i) {\n    return i.toString(radix);\n  };\n};\n\n\nexport const quot = function (x) {\n  return function (y) {\n    /* jshint bitwise: false */\n    return x / y | 0;\n  };\n};\n\nexport const rem = function (x) {\n  return function (y) {\n    return x % y;\n  };\n};\n\nexport const pow = function (x) {\n  return function (y) {\n    /* jshint bitwise: false */\n    return Math.pow(x,y) | 0;\n  };\n};\n", "/* globals exports */\nexport const nan = NaN;\nconst isNaNImpl = isNaN;\nexport { isNaNImpl as isNaN };\nexport const infinity = Infinity;\nconst isFiniteImpl = isFinite;\nexport { isFiniteImpl as isFinite };\n\nexport function fromStringImpl(str, isFinite, just, nothing) {\n  var num = parseFloat(str);\n  if (isFinite(num)) {\n    return just(num);\n  } else {\n    return nothing;\n  }\n}\n\nexport const abs = Math.abs;\n\nexport const acos = Math.acos;\n\nexport const asin = Math.asin;\n\nexport const atan = Math.atan;\n\nexport const atan2 = function (y) {\n  return function (x) {\n    return Math.atan2(y, x);\n  };\n};\n\nexport const ceil = Math.ceil;\n\nexport const cos = Math.cos;\n\nexport const exp = Math.exp;\n\nexport const floor = Math.floor;\n\nexport const log = Math.log;\n\nexport const max = function (n1) {\n  return function (n2) {\n    return Math.max(n1, n2);\n  };\n};\n\nexport const min = function (n1) {\n  return function (n2) {\n    return Math.min(n1, n2);\n  };\n};\n\nexport const pow = function (n) {\n  return function (p) {\n    return Math.pow(n, p);\n  };\n};\n\nexport const remainder = function (n) {\n  return function (m) {\n    return n % m;\n  };\n};\n\nexport const round = Math.round;\n\nexport const sign = Math.sign ? Math.sign : function(x) {\n  return x === 0 || x !== x ? x : (x < 0 ? -1 : 1);\n};\n\nexport const sin = Math.sin;\n\nexport const sqrt = Math.sqrt;\n\nexport const tan = Math.tan;\n\nexport const trunc = Math.trunc ? Math.trunc : function(x) {\n  return x < 0 ? Math.ceil(x) : Math.floor(x);\n}\n", "module Data.Int\n  ( fromNumber\n  , ceil\n  , floor\n  , trunc\n  , round\n  , toNumber\n  , fromString\n  , Radix\n  , radix\n  , binary\n  , octal\n  , decimal\n  , hexadecimal\n  , base36\n  , fromStringAs\n  , toStringAs\n  , Parity(..)\n  , parity\n  , even\n  , odd\n  , quot\n  , rem\n  , pow\n  ) where\n\nimport Prelude\n\nimport Data.Int.Bits ((.&.))\nimport Data.Maybe (Maybe(..), fromMaybe)\nimport Data.Number (isFinite)\nimport Data.Number as Number\n\n-- | Creates an `Int` from a `Number` value. The number must already be an\n-- | integer and fall within the valid range of values for the `Int` type\n-- | otherwise `Nothing` is returned.\nfromNumber :: Number -> Maybe Int\nfromNumber = fromNumberImpl Just Nothing\n\nforeign import fromNumberImpl\n  :: (forall a. a -> Maybe a)\n  -> (forall a. Maybe a)\n  -> Number\n  -> Maybe Int\n\n-- | Convert a `Number` to an `Int`, by taking the closest integer equal to or\n-- | less than the argument. Values outside the `Int` range are clamped, `NaN`\n-- | and `Infinity` values return 0.\nfloor :: Number -> Int\nfloor = unsafeClamp <<< Number.floor\n\n-- | Convert a `Number` to an `Int`, by taking the closest integer equal to or\n-- | greater than the argument. Values outside the `Int` range are clamped,\n-- | `NaN` and `Infinity` values return 0.\nceil :: Number -> Int\nceil = unsafeClamp <<< Number.ceil\n\n-- | Convert a `Number` to an `Int`, by dropping the decimal.\n-- | Values outside the `Int` range are clamped, `NaN` and `Infinity`\n-- | values return 0.\ntrunc :: Number -> Int\ntrunc = unsafeClamp <<< Number.trunc\n\n-- | Convert a `Number` to an `Int`, by taking the nearest integer to the\n-- | argument. Values outside the `Int` range are clamped, `NaN` and `Infinity`\n-- | values return 0.\nround :: Number -> Int\nround = unsafeClamp <<< Number.round\n\n-- | Convert an integral `Number` to an `Int`, by clamping to the `Int` range.\n-- | This function will return 0 if the input is `NaN` or an `Infinity`.\nunsafeClamp :: Number -> Int\nunsafeClamp x\n  | not (isFinite x) = 0\n  | x >= toNumber top = top\n  | x <= toNumber bottom = bottom\n  | otherwise = fromMaybe 0 (fromNumber x)\n\n-- | Converts an `Int` value back into a `Number`. Any `Int` is a valid `Number`\n-- | so there is no loss of precision with this function.\nforeign import toNumber :: Int -> Number\n\n-- | Reads an `Int` from a `String` value. The number must parse as an integer\n-- | and fall within the valid range of values for the `Int` type, otherwise\n-- | `Nothing` is returned.\nfromString :: String -> Maybe Int\nfromString = fromStringAs (Radix 10)\n\n-- | A type for describing whether an integer is even or odd.\n-- |\n-- | The `Ord` instance considers `Even` to be less than `Odd`.\n-- |\n-- | The `Semiring` instance allows you to ask about the parity of the results\n-- | of arithmetical operations, given only the parities of the inputs. For\n-- | example, the sum of an odd number and an even number is odd, so\n-- | `Odd + Even == Odd`. This also works for multiplication, eg. the product\n-- | of two odd numbers is odd, and therefore `Odd * Odd == Odd`.\n-- |\n-- | More generally, we have that\n-- |\n-- | ```purescript\n-- | parity x + parity y == parity (x + y)\n-- | parity x * parity y == parity (x * y)\n-- | ```\n-- |\n-- | for any integers `x`, `y`. (A mathematician would say that `parity` is a\n-- | *ring homomorphism*.)\n-- |\n-- | After defining addition and multiplication on `Parity` in this way, the\n-- | `Semiring` laws now force us to choose `zero = Even` and `one = Odd`.\n-- | This `Semiring` instance actually turns out to be a `Field`.\ndata Parity = Even | Odd\n\nderive instance eqParity :: Eq Parity\nderive instance ordParity :: Ord Parity\n\ninstance showParity :: Show Parity where\n  show Even = \"Even\"\n  show Odd = \"Odd\"\n\ninstance boundedParity :: Bounded Parity where\n  bottom = Even\n  top = Odd\n\ninstance semiringParity :: Semiring Parity where\n  zero = Even\n  add x y = if x == y then Even else Odd\n  one = Odd\n  mul Odd Odd = Odd\n  mul _ _ = Even\n\ninstance ringParity :: Ring Parity where\n  sub = add\n\ninstance commutativeRingParity :: CommutativeRing Parity\n\ninstance euclideanRingParity :: EuclideanRing Parity where\n  degree Even = 0\n  degree Odd = 1\n  div x _ = x\n  mod _ _ = Even\n\ninstance divisionRingParity :: DivisionRing Parity where\n  recip = identity\n\n-- | Returns whether an `Int` is `Even` or `Odd`.\n-- |\n-- | ``` purescript\n-- | parity 0 == Even\n-- | parity 1 == Odd\n-- | ```\nparity :: Int -> Parity\nparity n = if even n then Even else Odd\n\n-- | Returns whether an `Int` is an even number.\n-- |\n-- | ``` purescript\n-- | even 0 == true\n-- | even 1 == false\n-- | ```\neven :: Int -> Boolean\neven x = x .&. 1 == 0\n\n-- | The negation of `even`.\n-- |\n-- | ``` purescript\n-- | odd 0 == false\n-- | odd 1 == true\n-- | ```\nodd :: Int -> Boolean\nodd x = x .&. 1 /= 0\n\n-- | The number of unique digits (including zero) used to represent integers in\n-- | a specific base.\nnewtype Radix = Radix Int\n\n-- | The base-2 system.\nbinary :: Radix\nbinary = Radix 2\n\n-- | The base-8 system.\noctal :: Radix\noctal = Radix 8\n\n-- | The base-10 system.\ndecimal :: Radix\ndecimal = Radix 10\n\n-- | The base-16 system.\nhexadecimal :: Radix\nhexadecimal = Radix 16\n\n-- | The base-36 system.\nbase36 :: Radix\nbase36 = Radix 36\n\n-- | Create a `Radix` from a number between 2 and 36.\nradix :: Int -> Maybe Radix\nradix n | n >= 2 && n <= 36 = Just (Radix n)\n        | otherwise         = Nothing\n\n-- | Like `fromString`, but the integer can be specified in a different base.\n-- |\n-- | Example:\n-- | ``` purs\n-- | fromStringAs binary      \"100\" == Just 4\n-- | fromStringAs hexadecimal \"ff\"  == Just 255\n-- | ```\nfromStringAs :: Radix -> String -> Maybe Int\nfromStringAs = fromStringAsImpl Just Nothing\n\n-- | The `quot` function provides _truncating_ integer division (see the\n-- | documentation for the `EuclideanRing` class). It is identical to `div` in\n-- | the `EuclideanRing Int` instance if the dividend is positive, but will be\n-- | slightly different if the dividend is negative. For example:\n-- |\n-- | ```purescript\n-- | div 2 3 == 0\n-- | quot 2 3 == 0\n-- |\n-- | div (-2) 3 == (-1)\n-- | quot (-2) 3 == 0\n-- |\n-- | div 2 (-3) == 0\n-- | quot 2 (-3) == 0\n-- | ```\nforeign import quot :: Int -> Int -> Int\n\n-- | The `rem` function provides the remainder after _truncating_ integer\n-- | division (see the documentation for the `EuclideanRing` class). It is\n-- | identical to `mod` in the `EuclideanRing Int` instance if the dividend is\n-- | positive, but will be slightly different if the dividend is negative. For\n-- | example:\n-- |\n-- | ```purescript\n-- | mod 2 3 == 2\n-- | rem 2 3 == 2\n-- |\n-- | mod (-2) 3 == 1\n-- | rem (-2) 3 == (-2)\n-- |\n-- | mod 2 (-3) == 2\n-- | rem 2 (-3) == 2\n-- | ```\nforeign import rem :: Int -> Int -> Int\n\n-- | Raise an Int to the power of another Int.\nforeign import pow :: Int -> Int -> Int\n\nforeign import fromStringAsImpl\n  :: (forall a. a -> Maybe a)\n  -> (forall a. Maybe a)\n  -> Radix\n  -> String\n  -> Maybe Int\n\nforeign import toStringAs :: Radix -> Int -> String\n", "export const fromCharArray = function (a) {\n  return a.join(\"\");\n};\n\nexport const toCharArray = function (s) {\n  return s.split(\"\");\n};\n\nexport const singleton = function (c) {\n  return c;\n};\n\nexport const _charAt = function (just) {\n  return function (nothing) {\n    return function (i) {\n      return function (s) {\n        return i >= 0 && i < s.length ? just(s.charAt(i)) : nothing;\n      };\n    };\n  };\n};\n\nexport const _toChar = function (just) {\n  return function (nothing) {\n    return function (s) {\n      return s.length === 1 ? just(s) : nothing;\n    };\n  };\n};\n\nexport const length = function (s) {\n  return s.length;\n};\n\nexport const countPrefix = function (p) {\n  return function (s) {\n    var i = 0;\n    while (i < s.length && p(s.charAt(i))) i++;\n    return i;\n  };\n};\n\nexport const _indexOf = function (just) {\n  return function (nothing) {\n    return function (x) {\n      return function (s) {\n        var i = s.indexOf(x);\n        return i === -1 ? nothing : just(i);\n      };\n    };\n  };\n};\n\nexport const _indexOfStartingAt = function (just) {\n  return function (nothing) {\n    return function (x) {\n      return function (startAt) {\n        return function (s) {\n          if (startAt < 0 || startAt > s.length) return nothing;\n          var i = s.indexOf(x, startAt);\n          return i === -1 ? nothing : just(i);\n        };\n      };\n    };\n  };\n};\n\nexport const _lastIndexOf = function (just) {\n  return function (nothing) {\n    return function (x) {\n      return function (s) {\n        var i = s.lastIndexOf(x);\n        return i === -1 ? nothing : just(i);\n      };\n    };\n  };\n};\n\nexport const _lastIndexOfStartingAt = function (just) {\n  return function (nothing) {\n    return function (x) {\n      return function (startAt) {\n        return function (s) {\n          var i = s.lastIndexOf(x, startAt);\n          return i === -1 ? nothing : just(i);\n        };\n      };\n    };\n  };\n};\n\nexport const take = function (n) {\n  return function (s) {\n    return s.substr(0, n);\n  };\n};\n\nexport const drop = function (n) {\n  return function (s) {\n    return s.substring(n);\n  };\n};\n\nexport const slice = function (b) {\n  return function (e) {\n    return function (s) {\n      return s.slice(b,e);\n    };\n  };\n};\n\nexport const splitAt = function (i) {\n  return function (s) {\n    return { before: s.substring(0, i), after: s.substring(i) };\n  };\n};\n", "export const charAt = function (i) {\n  return function (s) {\n    if (i >= 0 && i < s.length) return s.charAt(i);\n    throw new Error(\"Data.String.Unsafe.charAt: Invalid index.\");\n  };\n};\n\nexport const char = function (s) {\n  if (s.length === 1) return s.charAt(0);\n  throw new Error(\"Data.String.Unsafe.char: Expected string of length 1.\");\n};\n", "module Data.String.CodeUnits\n  ( stripPrefix\n  , stripSuffix\n  , contains\n  , singleton\n  , fromCharArray\n  , toCharArray\n  , charAt\n  , toChar\n  , uncons\n  , length\n  , countPrefix\n  , indexOf\n  , indexOf'\n  , lastIndexOf\n  , lastIndexOf'\n  , take\n  , takeRight\n  , takeWhile\n  , drop\n  , dropRight\n  , dropWhile\n  , slice\n  , splitAt\n  ) where\n\nimport Prelude\n\nimport Data.Maybe (Maybe(..), isJust)\nimport Data.String.Pattern (Pattern(..))\nimport Data.String.Unsafe as U\n\n-------------------------------------------------------------------------------\n-- `stripPrefix`, `stripSuffix`, and `contains` are CodeUnit/CodePoint agnostic\n-- as they are based on patterns rather than lengths/indices, but they need to\n-- be defined in here to avoid a circular module dependency\n-------------------------------------------------------------------------------\n\n-- | If the string starts with the given prefix, return the portion of the\n-- | string left after removing it, as a `Just` value. Otherwise, return `Nothing`.\n-- |\n-- | ```purescript\n-- | stripPrefix (Pattern \"http:\") \"http://purescript.org\" == Just \"//purescript.org\"\n-- | stripPrefix (Pattern \"http:\") \"https://purescript.org\" == Nothing\n-- | ```\nstripPrefix :: Pattern -> String -> Maybe String\nstripPrefix (Pattern prefix) str =\n  let { before, after } = splitAt (length prefix) str in\n  if before == prefix then Just after else Nothing\n\n-- | If the string ends with the given suffix, return the portion of the\n-- | string left after removing it, as a `Just` value. Otherwise, return\n-- | `Nothing`.\n-- |\n-- | ```purescript\n-- | stripSuffix (Pattern \".exe\") \"psc.exe\" == Just \"psc\"\n-- | stripSuffix (Pattern \".exe\") \"psc\" == Nothing\n-- | ```\nstripSuffix :: Pattern -> String -> Maybe String\nstripSuffix (Pattern suffix) str =\n  let { before, after } = splitAt (length str - length suffix) str in\n  if after == suffix then Just before else Nothing\n\n-- | Checks whether the pattern appears in the given string.\n-- |\n-- | ```purescript\n-- | contains (Pattern \"needle\") \"haystack with needle\" == true\n-- | contains (Pattern \"needle\") \"haystack\" == false\n-- | ```\ncontains :: Pattern -> String -> Boolean\ncontains pat = isJust <<< indexOf pat\n\n-------------------------------------------------------------------------------\n-- all functions past this point are CodeUnit specific\n-------------------------------------------------------------------------------\n\n-- | Returns a string of length `1` containing the given character.\n-- |\n-- | ```purescript\n-- | singleton 'l' == \"l\"\n-- | ```\n-- |\nforeign import singleton :: Char -> String\n\n-- | Converts an array of characters into a string.\n-- |\n-- | ```purescript\n-- | fromCharArray ['H', 'e', 'l', 'l', 'o'] == \"Hello\"\n-- | ```\nforeign import fromCharArray :: Array Char -> String\n\n-- | Converts the string into an array of characters.\n-- |\n-- | ```purescript\n-- | toCharArray \"Hello\u263A\\n\" == ['H','e','l','l','o','\u263A','\\n']\n-- | ```\nforeign import toCharArray :: String -> Array Char\n\n-- | Returns the character at the given index, if the index is within bounds.\n-- |\n-- | ```purescript\n-- | charAt 2 \"Hello\" == Just 'l'\n-- | charAt 10 \"Hello\" == Nothing\n-- | ```\n-- |\ncharAt :: Int -> String -> Maybe Char\ncharAt = _charAt Just Nothing\n\nforeign import _charAt\n  :: (forall a. a -> Maybe a)\n  -> (forall a. Maybe a)\n  -> Int\n  -> String\n  -> Maybe Char\n\n-- | Converts the string to a character, if the length of the string is\n-- | exactly `1`.\n-- |\n-- | ```purescript\n-- | toChar \"l\" == Just 'l'\n-- | toChar \"Hi\" == Nothing -- since length is not 1\n-- | ```\ntoChar :: String -> Maybe Char\ntoChar = _toChar Just Nothing\n\nforeign import _toChar\n  :: (forall a. a -> Maybe a)\n  -> (forall a. Maybe a)\n  -> String\n  -> Maybe Char\n\n-- | Returns the first character and the rest of the string,\n-- | if the string is not empty.\n-- |\n-- | ```purescript\n-- | uncons \"\" == Nothing\n-- | uncons \"Hello World\" == Just { head: 'H', tail: \"ello World\" }\n-- | ```\n-- |\nuncons :: String -> Maybe { head :: Char, tail :: String }\nuncons \"\" = Nothing\nuncons s  = Just { head: U.charAt zero s, tail: drop one s }\n\n-- | Returns the number of characters the string is composed of.\n-- |\n-- | ```purescript\n-- | length \"Hello World\" == 11\n-- | ```\n-- |\nforeign import length :: String -> Int\n\n-- | Returns the number of contiguous characters at the beginning\n-- | of the string for which the predicate holds.\n-- |\n-- | ```purescript\n-- | countPrefix (_ /= ' ') \"Hello World\" == 5 -- since length \"Hello\" == 5\n-- | ```\n-- |\nforeign import countPrefix :: (Char -> Boolean) -> String -> Int\n\n-- | Returns the index of the first occurrence of the pattern in the\n-- | given string. Returns `Nothing` if there is no match.\n-- |\n-- | ```purescript\n-- | indexOf (Pattern \"c\") \"abcdc\" == Just 2\n-- | indexOf (Pattern \"c\") \"aaa\" == Nothing\n-- | ```\n-- |\nindexOf :: Pattern -> String -> Maybe Int\nindexOf = _indexOf Just Nothing\n\nforeign import _indexOf\n  :: (forall a. a -> Maybe a)\n  -> (forall a. Maybe a)\n  -> Pattern\n  -> String\n  -> Maybe Int\n\n-- | Returns the index of the first occurrence of the pattern in the\n-- | given string, starting at the specified index. Returns `Nothing` if there is\n-- | no match.\n-- |\n-- | ```purescript\n-- | indexOf' (Pattern \"a\") 2 \"ababa\" == Just 2\n-- | indexOf' (Pattern \"a\") 3 \"ababa\" == Just 4\n-- | ```\n-- |\nindexOf' :: Pattern -> Int -> String -> Maybe Int\nindexOf' = _indexOfStartingAt Just Nothing\n\nforeign import _indexOfStartingAt\n  :: (forall a. a -> Maybe a)\n  -> (forall a. Maybe a)\n  -> Pattern\n  -> Int\n  -> String\n  -> Maybe Int\n\n-- | Returns the index of the last occurrence of the pattern in the\n-- | given string. Returns `Nothing` if there is no match.\n-- |\n-- | ```purescript\n-- | lastIndexOf (Pattern \"c\") \"abcdc\" == Just 4\n-- | lastIndexOf (Pattern \"c\") \"aaa\" == Nothing\n-- | ```\n-- |\nlastIndexOf :: Pattern -> String -> Maybe Int\nlastIndexOf = _lastIndexOf Just Nothing\n\nforeign import _lastIndexOf\n  :: (forall a. a -> Maybe a)\n  -> (forall a. Maybe a)\n  -> Pattern\n  -> String\n  -> Maybe Int\n\n-- | Returns the index of the last occurrence of the pattern in the\n-- | given string, starting at the specified index and searching\n-- | backwards towards the beginning of the string.\n-- |\n-- | Starting at a negative index is equivalent to starting at 0 and\n-- | starting at an index greater than the string length is equivalent\n-- | to searching in the whole string.\n-- |\n-- | Returns `Nothing` if there is no match.\n-- |\n-- | ```purescript\n-- | lastIndexOf' (Pattern \"a\") (-1) \"ababa\" == Just 0\n-- | lastIndexOf' (Pattern \"a\") 1 \"ababa\" == Just 0\n-- | lastIndexOf' (Pattern \"a\") 3 \"ababa\" == Just 2\n-- | lastIndexOf' (Pattern \"a\") 4 \"ababa\" == Just 4\n-- | lastIndexOf' (Pattern \"a\") 5 \"ababa\" == Just 4\n-- | ```\n-- |\nlastIndexOf' :: Pattern -> Int -> String -> Maybe Int\nlastIndexOf' = _lastIndexOfStartingAt Just Nothing\n\nforeign import _lastIndexOfStartingAt\n  :: (forall a. a -> Maybe a)\n  -> (forall a. Maybe a)\n  -> Pattern\n  -> Int\n  -> String\n  -> Maybe Int\n\n-- | Returns the first `n` characters of the string.\n-- |\n-- | ```purescript\n-- | take 5 \"Hello World\" == \"Hello\"\n-- | ```\n-- |\nforeign import take :: Int -> String -> String\n\n-- | Returns the last `n` characters of the string.\n-- |\n-- | ```purescript\n-- | takeRight 5 \"Hello World\" == \"World\"\n-- | ```\n-- |\ntakeRight :: Int -> String -> String\ntakeRight i s = drop (length s - i) s\n\n-- | Returns the longest prefix (possibly empty) of characters that satisfy\n-- | the predicate.\n-- |\n-- | ```purescript\n-- | takeWhile (_ /= ':') \"http://purescript.org\" == \"http\"\n-- | ```\n-- |\ntakeWhile :: (Char -> Boolean) -> String -> String\ntakeWhile p s = take (countPrefix p s) s\n\n-- | Returns the string without the first `n` characters.\n-- |\n-- | ```purescript\n-- | drop 6 \"Hello World\" == \"World\"\n-- | ```\n-- |\nforeign import drop :: Int -> String -> String\n\n-- | Returns the string without the last `n` characters.\n-- |\n-- | ```purescript\n-- | dropRight 6 \"Hello World\" == \"Hello\"\n-- | ```\n-- |\ndropRight :: Int -> String -> String\ndropRight i s = take (length s - i) s\n\n-- | Returns the suffix remaining after `takeWhile`.\n-- |\n-- | ```purescript\n-- | dropWhile (_ /= '.') \"Test.purs\" == \".purs\"\n-- | ```\n-- |\ndropWhile :: (Char -> Boolean) -> String -> String\ndropWhile p s = drop (countPrefix p s) s\n\n-- | Returns the substring at indices `[begin, end)`.\n-- | If either index is negative, it is normalised to `length s - index`,\n-- | where `s` is the input string. `\"\"` is returned if either\n-- | index is out of bounds or if `begin > end` after normalisation.\n-- |\n-- | ```purescript\n-- | slice 0 0   \"purescript\" == \"\"\n-- | slice 0 1   \"purescript\" == \"p\"\n-- | slice 3 6   \"purescript\" == \"esc\"\n-- | slice (-4) (-1) \"purescript\" == \"rip\"\n-- | slice (-4) 3  \"purescript\" == \"\"\n-- | ```\nforeign import slice :: Int -> Int -> String -> String\n\n-- | Splits a string into two substrings, where `before` contains the\n-- | characters up to (but not including) the given index, and `after` contains\n-- | the rest of the string, from that index on.\n-- |\n-- | ```purescript\n-- | splitAt 2 \"Hello World\" == { before: \"He\", after: \"llo World\"}\n-- | splitAt 10 \"Hi\" == { before: \"Hi\", after: \"\"}\n-- | ```\n-- |\n-- | Thus the length of `(splitAt i s).before` will equal either `i` or\n-- | `length s`, if that is shorter. (Or if `i` is negative the length will be\n-- | 0.)\n-- |\n-- | In code:\n-- | ```purescript\n-- | length (splitAt i s).before == min (max i 0) (length s)\n-- | (splitAt i s).before <> (splitAt i s).after == s\n-- | splitAt i s == {before: take i s, after: drop i s}\n-- | ```\nforeign import splitAt :: Int -> String -> { before :: String, after :: String }\n", "-- | This module defines types and functions for working with _foreign_\n-- | data.\n-- |\n-- | `ExceptT (NonEmptyList ForeignError) m` is used in this library\n-- | to encode possible failures when dealing with foreign data.\n-- |\n-- | The `Alt` instance for `ExceptT` allows us to accumulate errors,\n-- | unlike `Either`, which preserves only the last error.\nmodule Foreign\n  ( Foreign\n  , ForeignError(..)\n  , MultipleErrors(..)\n  , F\n  , FT\n  , renderForeignError\n  , unsafeToForeign\n  , unsafeFromForeign\n  , unsafeReadTagged\n  , typeOf\n  , tagOf\n  , isNull\n  , isUndefined\n  , isArray\n  , readString\n  , readChar\n  , readBoolean\n  , readNumber\n  , readInt\n  , readArray\n  , readNull\n  , readUndefined\n  , readNullOrUndefined\n  , fail\n  ) where\n\nimport Prelude\n\nimport Control.Monad.Except (Except, ExceptT, mapExceptT, throwError)\nimport Data.Either (Either(..), either)\nimport Data.Int as Int\nimport Data.List.NonEmpty (NonEmptyList)\nimport Data.List.NonEmpty as NEL\nimport Data.Maybe (Maybe(..), maybe)\nimport Data.String.CodeUnits (toChar)\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | A type for _foreign data_.\n-- |\n-- | Foreign data is data from any external _unknown_ or _unreliable_\n-- | source, for which it cannot be guaranteed that the runtime representation\n-- | conforms to that of any particular type.\n-- |\n-- | Suitable applications of `Foreign` are\n-- |\n-- | - To represent responses from web services\n-- | - To integrate with external JavaScript libraries.\nforeign import data Foreign :: Type\n\n-- | A type for foreign type errors\ndata ForeignError\n  = ForeignError String\n  | TypeMismatch String String\n  | ErrorAtIndex Int ForeignError\n  | ErrorAtProperty String ForeignError\n\nderive instance eqForeignError :: Eq ForeignError\nderive instance ordForeignError :: Ord ForeignError\n\ninstance showForeignError :: Show ForeignError where\n  show (ForeignError msg) = \"(ForeignError \" <> show msg <> \")\"\n  show (ErrorAtIndex i e) = \"(ErrorAtIndex \" <> show i <> \" \" <> show e <> \")\"\n  show (ErrorAtProperty prop e) = \"(ErrorAtProperty \" <> show prop <> \" \" <> show e <> \")\"\n  show (TypeMismatch exps act) = \"(TypeMismatch \" <> show exps <> \" \" <> show act <> \")\"\n\n-- | A type for accumulating multiple `ForeignError`s.\ntype MultipleErrors = NonEmptyList ForeignError\n\nrenderForeignError :: ForeignError -> String\nrenderForeignError (ForeignError msg) = msg\nrenderForeignError (ErrorAtIndex i e) = \"Error at array index \" <> show i <> \": \" <> renderForeignError e\nrenderForeignError (ErrorAtProperty prop e) = \"Error at property \" <> show prop <> \": \" <> renderForeignError e\nrenderForeignError (TypeMismatch exp act) = \"Type mismatch: expected \" <> exp <> \", found \" <> act\n\n-- | While this alias is not deprecated, it is recommended\n-- | that one use `Except (NonEmptyList ForeignError)` directly\n-- | for all future usages rather than this type alias.\n-- |\n-- | An error monad, used in this library to encode possible failures when\n-- | dealing with foreign data.\n-- |\n-- | The `Alt` instance for `Except` allows us to accumulate errors,\n-- | unlike `Either`, which preserves only the last error.\ntype F = Except MultipleErrors\n\n-- | While this alias is not deprecated, it is recommended\n-- | that one use `ExceptT (NonEmptyList ForeignError)` directly\n-- | for all future usages rather than this type alias.\ntype FT = ExceptT MultipleErrors\n\n-- | Coerce any value to the a `Foreign` value.\n-- |\n-- | This is considered unsafe as it's only intended to be used on primitive\n-- | JavaScript types, rather than PureScript types. Exporting PureScript values\n-- | via the FFI can be dangerous as they can be mutated by code outside the\n-- | PureScript program, resulting in difficult to diagnose problems elsewhere.\nunsafeToForeign :: forall a. a -> Foreign\nunsafeToForeign = unsafeCoerce\n\n-- | Unsafely coerce a `Foreign` value.\nunsafeFromForeign :: forall a. Foreign -> a\nunsafeFromForeign = unsafeCoerce\n\n-- | Read the Javascript _type_ of a value\nforeign import typeOf :: Foreign -> String\n\n-- | Read the Javascript _tag_ of a value.\n-- |\n-- | This function wraps the `Object.toString` method.\nforeign import tagOf :: Foreign -> String\n\n-- | Unsafely coerce a `Foreign` value when the value has a particular `tagOf`\n-- | value.\nunsafeReadTagged :: forall m a. Monad m => String -> Foreign -> ExceptT (NonEmptyList ForeignError) m a\nunsafeReadTagged tag value\n  | tagOf value == tag = pure (unsafeFromForeign value)\n  | otherwise = fail $ TypeMismatch tag (tagOf value)\n\n-- | Test whether a foreign value is null\nforeign import isNull :: Foreign -> Boolean\n\n-- | Test whether a foreign value is undefined\nforeign import isUndefined :: Foreign -> Boolean\n\n-- | Test whether a foreign value is an array\nforeign import isArray :: Foreign -> Boolean\n\n-- | Attempt to coerce a foreign value to a `String`.\nreadString :: forall m. Monad m => Foreign -> ExceptT (NonEmptyList ForeignError) m String\nreadString = unsafeReadTagged \"String\"\n\n-- | Attempt to coerce a foreign value to a `Char`.\nreadChar :: forall m. Monad m => Foreign -> ExceptT (NonEmptyList ForeignError) m Char\nreadChar value = mapExceptT (map $ either (const error) fromString) (readString value)\n  where\n  fromString = maybe error pure <<< toChar\n  error = Left $ NEL.singleton $ TypeMismatch \"Char\" (tagOf value)\n\n-- | Attempt to coerce a foreign value to a `Boolean`.\nreadBoolean :: forall m. Monad m => Foreign -> ExceptT (NonEmptyList ForeignError) m Boolean\nreadBoolean = unsafeReadTagged \"Boolean\"\n\n-- | Attempt to coerce a foreign value to a `Number`.\nreadNumber :: forall m. Monad m => Foreign -> ExceptT (NonEmptyList ForeignError) m Number\nreadNumber = unsafeReadTagged \"Number\"\n\n-- | Attempt to coerce a foreign value to an `Int`.\nreadInt :: forall m. Monad m => Foreign -> ExceptT (NonEmptyList ForeignError) m Int\nreadInt value = mapExceptT (map $ either (const error) fromNumber) (readNumber value)\n  where\n  fromNumber = maybe error pure <<< Int.fromNumber\n  error = Left $ NEL.singleton $ TypeMismatch \"Int\" (tagOf value)\n\n-- | Attempt to coerce a foreign value to an array.\nreadArray :: forall m. Monad m => Foreign -> ExceptT (NonEmptyList ForeignError) m (Array Foreign)\nreadArray value\n  | isArray value = pure $ unsafeFromForeign value\n  | otherwise = fail $ TypeMismatch \"array\" (tagOf value)\n\nreadNull :: forall m. Monad m => Foreign -> ExceptT (NonEmptyList ForeignError) m (Maybe Foreign)\nreadNull value\n  | isNull value = pure Nothing\n  | otherwise = pure (Just value)\n\nreadUndefined :: forall m. Monad m => Foreign -> ExceptT (NonEmptyList ForeignError) m (Maybe Foreign)\nreadUndefined value\n  | isUndefined value = pure Nothing\n  | otherwise = pure (Just value)\n\nreadNullOrUndefined :: forall m. Monad m => Foreign -> ExceptT (NonEmptyList ForeignError) m (Maybe Foreign)\nreadNullOrUndefined value\n  | isNull value || isUndefined value = pure Nothing\n  | otherwise = pure (Just value)\n\n-- | Throws a failure error in `ExceptT (NonEmptyList ForeignError) m`.\nfail :: forall m a. Monad m => ForeignError -> ExceptT (NonEmptyList ForeignError) m a\nfail = throwError <<< NEL.singleton\n", "-- | Note: this module is not intended to be used by end-users.\n-- | Rather, use the environment-specific library instead:\n-- | - [`purescript-affjax-node`](https://github.com/purescript-contrib/purescript-affjax-node)\n-- | - [`purescript-affjax-web`](https://github.com/purescript-contrib/purescript-affjax-web)\n-- |\n-- | You should use this module if you are writing a driver for a specific environment.\n-- | See this module's source code for more details.\n-- If you want to write a driver for an environment, see the comments\n-- for the `AffjaxDriver` type and look at the `node` and `web` libraries\n-- (linked above) as examples.\nmodule Affjax\n  ( Request\n  , defaultRequest\n  , Response\n  , Error(..)\n  , printError\n  , URL\n  , AffjaxDriver\n  , request\n  , get\n  , post\n  , post_\n  , put\n  , put_\n  , delete\n  , delete_\n  , patch\n  , patch_\n  ) where\n\nimport Prelude\n\nimport Affjax.RequestBody as RequestBody\nimport Affjax.RequestHeader (RequestHeader(..))\nimport Affjax.RequestHeader as RequestHeader\nimport Affjax.ResponseFormat as ResponseFormat\nimport Affjax.ResponseHeader (ResponseHeader(..))\nimport Affjax.StatusCode (StatusCode)\nimport Control.Alt ((<|>))\nimport Control.Monad.Except (Except, runExcept)\nimport Data.Argonaut.Core (Json)\nimport Data.Argonaut.Core as J\nimport Data.Argonaut.Parser (jsonParser)\nimport Data.Array as Arr\nimport Data.ArrayBuffer.Types (ArrayView)\nimport Data.Either (Either(..), either, note)\nimport Data.Foldable (any)\nimport Data.FormURLEncoded as FormURLEncoded\nimport Data.Function (on)\nimport Data.Function.Uncurried (Fn5, runFn5)\nimport Data.HTTP.Method (Method(..), CustomMethod)\nimport Data.HTTP.Method as Method\nimport Data.List.NonEmpty as NEL\nimport Data.Maybe (Maybe(..), fromMaybe)\nimport Data.Nullable (Nullable, toNullable)\nimport Data.Time.Duration (Milliseconds(..))\nimport Effect.Aff (Aff, try)\nimport Effect.Aff.Compat as AC\nimport Effect.Exception as Exn\nimport Foreign (Foreign, ForeignError(..), fail, renderForeignError, unsafeReadTagged, unsafeToForeign)\nimport Web.DOM (Document)\nimport Web.File.Blob (Blob)\nimport Web.XHR.FormData (FormData)\n\n-- | A record that contains all the information to perform an HTTP request.\n-- | Instead of constructing the record from scratch it is often easier to build\n-- | one based on `defaultRequest`.\ntype Request a =\n  { method :: Either Method CustomMethod\n  , url :: URL\n  , headers :: Array RequestHeader\n  , content :: Maybe RequestBody.RequestBody\n  , username :: Maybe String\n  , password :: Maybe String\n  , withCredentials :: Boolean\n  , responseFormat :: ResponseFormat.ResponseFormat a\n  , timeout :: Maybe Milliseconds\n  }\n\n-- | A record of the type `Request` that has all fields set to default\n-- | values. This record can be used as the foundation for constructing\n-- | custom requests.\n-- |\n-- | As an example:\n-- |\n-- | ```purescript\n-- | defaultRequest { url = \"/api/user\", method = Left POST }\n-- | ```\n-- |\n-- | Would represents a POST request to the URL `/api/user`.\ndefaultRequest :: Request Unit\ndefaultRequest =\n  { method: Left GET\n  , url: \"/\"\n  , headers: []\n  , content: Nothing\n  , username: Nothing\n  , password: Nothing\n  , withCredentials: false\n  , responseFormat: ResponseFormat.ignore\n  , timeout: Nothing\n  }\n\n-- | The possible errors that can occur when making an Affjax request.\ndata Error\n  = RequestContentError String\n  | ResponseBodyError ForeignError (Response Foreign)\n  | TimeoutError\n  | RequestFailedError\n  | XHROtherError Exn.Error\n\nprintError :: Error -> String\nprintError = case _ of\n  RequestContentError err ->\n    \"There was a problem with the request content: \" <> err\n  ResponseBodyError err _ ->\n    \"There was a problem with the response body: \" <> renderForeignError err\n  TimeoutError ->\n    \"There was a problem making the request: timeout\"\n  RequestFailedError ->\n    \"There was a problem making the request: request failed\"\n  XHROtherError err ->\n    \"There was a problem making the request: \" <> Exn.message err\n\n-- | The type of records that represents a received HTTP response.\ntype Response a =\n  { status :: StatusCode\n  , statusText :: String\n  , headers :: Array ResponseHeader\n  , body :: a\n  }\n\n-- | Type alias for URL strings to aid readability of types.\ntype URL = String\n\n-- | Makes a `GET` request to the specified URL.\nget :: forall a. AffjaxDriver -> ResponseFormat.ResponseFormat a -> URL -> Aff (Either Error (Response a))\nget driver rf u = request driver (defaultRequest { url = u, responseFormat = rf })\n\n-- | Makes a `POST` request to the specified URL with the option to send data.\npost :: forall a. AffjaxDriver -> ResponseFormat.ResponseFormat a -> URL -> Maybe RequestBody.RequestBody -> Aff (Either Error (Response a))\npost driver rf u c = request driver (defaultRequest { method = Left POST, url = u, content = c, responseFormat = rf })\n\n-- | Makes a `POST` request to the specified URL with the option to send data\n-- | and ignores the response body.\npost_ :: AffjaxDriver -> URL -> Maybe RequestBody.RequestBody -> Aff (Either Error Unit)\npost_ driver url = map void <<< post driver ResponseFormat.ignore url\n\n-- | Makes a `PUT` request to the specified URL with the option to send data.\nput :: forall a. AffjaxDriver -> ResponseFormat.ResponseFormat a -> URL -> Maybe RequestBody.RequestBody -> Aff (Either Error (Response a))\nput driver rf u c = request driver (defaultRequest { method = Left PUT, url = u, content = c, responseFormat = rf })\n\n-- | Makes a `PUT` request to the specified URL with the option to send data\n-- | and ignores the response body.\nput_ :: AffjaxDriver -> URL -> Maybe RequestBody.RequestBody -> Aff (Either Error Unit)\nput_ driver url = map void <<< put driver ResponseFormat.ignore url\n\n-- | Makes a `DELETE` request to the specified URL.\ndelete :: forall a. AffjaxDriver -> ResponseFormat.ResponseFormat a -> URL -> Aff (Either Error (Response a))\ndelete driver rf u = request driver (defaultRequest { method = Left DELETE, url = u, responseFormat = rf })\n\n-- | Makes a `DELETE` request to the specified URL and ignores the response\n-- | body.\ndelete_ :: AffjaxDriver -> URL -> Aff (Either Error Unit)\ndelete_ driver = map void <<< delete driver ResponseFormat.ignore\n\n-- | Makes a `PATCH` request to the specified URL with the option to send data.\npatch :: forall a. AffjaxDriver -> ResponseFormat.ResponseFormat a -> URL -> RequestBody.RequestBody -> Aff (Either Error (Response a))\npatch driver rf u c = request driver (defaultRequest { method = Left PATCH, url = u, content = Just c, responseFormat = rf })\n\n-- | Makes a `PATCH` request to the specified URL with the option to send data\n-- | and ignores the response body.\npatch_ :: AffjaxDriver -> URL -> RequestBody.RequestBody -> Aff (Either Error Unit)\npatch_ driver url = map void <<< patch driver ResponseFormat.ignore url\n\n-- | Makes an HTTP request.\n-- |\n-- | The example below performs a `GET` request to the URL `/resource` and\n-- | interprets the response body as JSON.\n-- |\n-- | ```purescript\n-- | import Affjax.ResponseFormat (json)\n-- | ...\n-- | request (defaultRequest { url = \"/resource\", method = Left GET, responseFormat = json})\n-- | ```\n-- |\n-- | For common cases helper functions can often be used instead of `request` .\n-- | For instance, the above example is equivalent to the following.\n-- |\n-- | ```purescript\n-- | get json \"/resource\"\n-- | ```\nrequest :: forall a. AffjaxDriver -> Request a -> Aff (Either Error (Response a))\nrequest driver req =\n  case req.content of\n    Nothing ->\n      send (toNullable Nothing)\n    Just content ->\n      case extractContent content of\n        Right c ->\n          send (toNullable (Just c))\n        Left err ->\n          pure $ Left (RequestContentError err)\n  where\n  send :: Nullable Foreign -> Aff (Either Error (Response a))\n  send content =\n    try (AC.fromEffectFnAff (runFn5 _ajax driver timeoutErrorMessageIdent requestFailedMessageIdent ResponseHeader (ajaxRequest content))) <#> case _ of\n      Right res ->\n        case runExcept (fromResponse res.body) of\n          Left err -> Left (ResponseBodyError (NEL.head err) res)\n          Right body -> Right (res { body = body })\n      Left err -> Left do\n        let message = Exn.message err\n        if message == timeoutErrorMessageIdent then\n          TimeoutError\n        else if message == requestFailedMessageIdent then\n          RequestFailedError\n        else\n          XHROtherError err\n\n  ajaxRequest :: Nullable Foreign -> AjaxRequest a\n  ajaxRequest =\n    { method: Method.print req.method\n    , url: req.url\n    , headers: (\\h -> { field: RequestHeader.name h, value: RequestHeader.value h }) <$> headers req.content\n    , content: _\n    , responseType: ResponseFormat.toResponseType req.responseFormat\n    , username: toNullable req.username\n    , password: toNullable req.password\n    , withCredentials: req.withCredentials\n    , timeout: fromMaybe 0.0 $ (\\(Milliseconds x) -> x) <$> req.timeout\n    }\n\n  extractContent :: RequestBody.RequestBody -> Either String Foreign\n  extractContent = case _ of\n    RequestBody.ArrayView f ->\n      Right $ f (unsafeToForeign :: forall b. ArrayView b -> Foreign)\n    RequestBody.Blob x ->\n      Right $ (unsafeToForeign :: Blob -> Foreign) x\n    RequestBody.Document x ->\n      Right $ (unsafeToForeign :: Document -> Foreign) x\n    RequestBody.String x ->\n      Right $ (unsafeToForeign :: String -> Foreign) x\n    RequestBody.FormData x ->\n      Right $ (unsafeToForeign :: FormData -> Foreign) x\n    RequestBody.FormURLEncoded x -> do\n      note \"Body contains values that cannot be encoded as application/x-www-form-urlencoded\"\n        $ (unsafeToForeign :: String -> Foreign) <$> FormURLEncoded.encode x\n    RequestBody.Json x ->\n      Right $ (unsafeToForeign :: String -> Foreign) (J.stringify x)\n\n  headers :: Maybe RequestBody.RequestBody -> Array RequestHeader\n  headers reqContent =\n    addHeader (ContentType <$> (RequestBody.toMediaType =<< reqContent))\n      $ addHeader (Accept <$> ResponseFormat.toMediaType req.responseFormat) req.headers\n\n  timeoutErrorMessageIdent :: String\n  timeoutErrorMessageIdent = \"AffjaxTimeoutErrorMessageIdent\"\n\n  requestFailedMessageIdent :: String\n  requestFailedMessageIdent = \"AffjaxRequestFailedMessageIdent\"\n\n  addHeader :: Maybe RequestHeader -> Array RequestHeader -> Array RequestHeader\n  addHeader mh hs = case mh of\n    Just h | not $ any (on eq RequestHeader.name h) hs -> hs `Arr.snoc` h\n    _ -> hs\n\n  parseJSON :: String -> Except (NEL.NonEmptyList ForeignError) Json\n  parseJSON = case _ of\n    \"\" -> pure J.jsonEmptyObject\n    str -> either (fail <<< ForeignError) pure (jsonParser str)\n\n  fromResponse :: Foreign -> Except (NEL.NonEmptyList ForeignError) a\n  fromResponse = case req.responseFormat of\n    ResponseFormat.ArrayBuffer _ -> unsafeReadTagged \"ArrayBuffer\"\n    ResponseFormat.Blob _ -> unsafeReadTagged \"Blob\"\n    ResponseFormat.Document _ -> \\x ->\n      unsafeReadTagged \"Document\" x\n        <|> unsafeReadTagged \"XMLDocument\" x\n        <|> unsafeReadTagged \"HTMLDocument\" x\n    ResponseFormat.Json coe -> coe <<< parseJSON <=< unsafeReadTagged \"String\"\n    ResponseFormat.String _ -> unsafeReadTagged \"String\"\n    ResponseFormat.Ignore coe -> const $ coe (pure unit)\n\ntype AjaxRequest :: Type -> Type\ntype AjaxRequest a =\n  { method :: String\n  , url :: URL\n  , headers :: Array { field :: String, value :: String }\n  , content :: Nullable Foreign\n  , responseType :: String\n  , username :: Nullable String\n  , password :: Nullable String\n  , withCredentials :: Boolean\n  , timeout :: Number\n  }\n\n-- Drivers should have the following 'shape':\n-- ```\n-- { newXHR :: Effect Xhr\n-- , fixupUrl :: Fn2 Xhr String String\n-- }\n-- ```\n-- If you're adding a new environment (e.g. Electron),\n-- be sure to re-export all the types and functions\n-- in the `Affjax` module, so people can easily\n-- update their code by changing the imported module\nforeign import data AffjaxDriver :: Type\n\nforeign import _ajax\n  :: forall a\n   . Fn5\n       AffjaxDriver\n       String\n       String\n       (String -> String -> ResponseHeader)\n       (AjaxRequest a)\n       (AC.EffectFnAff (Response Foreign))\n", "module Affjax.StatusCode where\n\nimport Prelude\nimport Data.Newtype (class Newtype)\n\nnewtype StatusCode = StatusCode Int\n\nderive instance eqStatusCode :: Eq StatusCode\nderive instance ordStatusCode :: Ord StatusCode\nderive instance newtypeStatusCode :: Newtype StatusCode _\n\ninstance showStatusCode :: Show StatusCode where\n  show (StatusCode code) = \"(StatusCode \" <> show code <> \")\"\n", "export const driver = {\n  newXHR: function () {\n    return new XMLHttpRequest();\n  },\n  fixupUrl: function (url) {\n    return url || \"/\";\n  }\n};\n", "module Affjax.Web\n  ( driver\n  , request\n  , get\n  , post\n  , post_\n  , put\n  , put_\n  , delete\n  , delete_\n  , patch\n  , patch_\n  , module Exports\n  ) where\n\nimport Prelude\n\nimport Affjax (Request, defaultRequest, Response, Error(..), printError, URL) as Exports\nimport Affjax as AX\nimport Affjax (Error, Request, Response, URL, AffjaxDriver)\nimport Affjax.RequestBody as RequestBody\nimport Affjax.ResponseFormat as ResponseFormat\nimport Data.Either (Either)\nimport Data.Maybe (Maybe)\nimport Effect.Aff (Aff)\n\n-- | Provides an Affjax driver that only works in the browser.\n-- | Using this with NodeJS will cause errors.\nforeign import driver :: AffjaxDriver\n\n-- | Makes a `GET` request to the specified URL.\nget :: forall a. ResponseFormat.ResponseFormat a -> URL -> Aff (Either Error (Response a))\nget = AX.get driver\n\n-- | Makes a `POST` request to the specified URL with the option to send data.\npost :: forall a. ResponseFormat.ResponseFormat a -> URL -> Maybe RequestBody.RequestBody -> Aff (Either Error (Response a))\npost = AX.post driver\n\n-- | Makes a `POST` request to the specified URL with the option to send data\n-- | and ignores the response body.\npost_ :: URL -> Maybe RequestBody.RequestBody -> Aff (Either Error Unit)\npost_ = AX.post_ driver\n\n-- | Makes a `PUT` request to the specified URL with the option to send data.\nput :: forall a. ResponseFormat.ResponseFormat a -> URL -> Maybe RequestBody.RequestBody -> Aff (Either Error (Response a))\nput = AX.put driver\n\n-- | Makes a `PUT` request to the specified URL with the option to send data\n-- | and ignores the response body.\nput_ :: URL -> Maybe RequestBody.RequestBody -> Aff (Either Error Unit)\nput_ = AX.put_ driver\n\n-- | Makes a `DELETE` request to the specified URL.\ndelete :: forall a. ResponseFormat.ResponseFormat a -> URL -> Aff (Either Error (Response a))\ndelete = AX.delete driver\n\n-- | Makes a `DELETE` request to the specified URL and ignores the response\n-- | body.\ndelete_ :: URL -> Aff (Either Error Unit)\ndelete_ = AX.delete_ driver\n\n-- | Makes a `PATCH` request to the specified URL with the option to send data.\npatch :: forall a. ResponseFormat.ResponseFormat a -> URL -> RequestBody.RequestBody -> Aff (Either Error (Response a))\npatch = AX.patch driver\n\n-- | Makes a `PATCH` request to the specified URL with the option to send data\n-- | and ignores the response body.\npatch_ :: URL -> RequestBody.RequestBody -> Aff (Either Error Unit)\npatch_ = AX.patch_ driver\n\n-- | Makes an HTTP request.\n-- |\n-- | The example below performs a `GET` request to the URL `/resource` and\n-- | interprets the response body as JSON.\n-- |\n-- | ```purescript\n-- | import Affjax.ResponseFormat (json)\n-- | ...\n-- | request (defaultRequest { url = \"/resource\", method = Left GET, responseFormat = json})\n-- | ```\n-- |\n-- | For common cases helper functions can often be used instead of `request` .\n-- | For instance, the above example is equivalent to the following.\n-- |\n-- | ```purescript\n-- | get json \"/resource\"\n-- | ```\nrequest :: forall a. Request a -> Aff (Either Error (Response a))\nrequest = AX.request driver\n", "\"use strict\";\n\nimport moment from 'moment'\n\nexport const _app = function() {\n  return app;\n}\n\nexport const _closest = function(just, nothing, selector, el) {\n  var node = el.closest(selector);\n  if(node) {\n    return just(node);\n  } else {\n    return nothing;\n  }\n}\n\nexport const _createFormData = function(formElement) {\n  return new FormData(formElement);\n}\n\nexport const _createFormString = function(formElement) {\n  return new URLSearchParams(new FormData(formElement)).toString()\n}\n\nexport const _createFormArray = function(formElement) {\n  return Array.from(new FormData(formElement));\n}\n\nexport const _moment8601 = function(tuple, s) {\n  var m = moment(s, moment.ISO_8601);\n  var s1 = m.fromNow();\n  var s2 = m.format('MMMM D YYYY, h:mm a') + \" (\" + m.format() + \") \";\n  return tuple(s1)(s2);\n}\n\nexport const _mmoment8601 = function(just, nothing, tuple, s) {\n  try {\n    var m = moment(s, moment.ISO_8601);\n    var s1 = m.fromNow();\n    var s2 = m.format('MMMM D YYYY, h:mm a') + \" (\" + m.format() + \") \";\n    return just(tuple(s1)(s2));\n  } catch (error) {\n    return nothing\n  }\n}\n\nexport const _closeWindow = function (window) {\n  window.close();\n};\n\nexport const _setFocus = function(elemId) {\n    document.getElementById(elemId).focus();\n};\n\n\nexport const _toLocaleDateString = function(dateString) {\n  return new Date(dateString).toLocaleDateString(undefined, {dateStyle: 'medium'}) \n}\n", "module Globals where\n\nimport Data.Maybe (Maybe(..))\nimport Data.Newtype (class Newtype)\nimport Data.Nullable (Nullable)\nimport Data.Tuple (Tuple(..))\nimport Effect (Effect)\nimport Data.Function.Uncurried (Fn0, Fn1, Fn4, runFn0, runFn1, runFn4)\nimport Effect.Uncurried (EffectFn1, EffectFn2, EffectFn4, runEffectFn1, runEffectFn2, runEffectFn4)\nimport Model (Bookmark)\nimport Prelude (Unit)\nimport Web.DOM (Node)\nimport Web.HTML (HTMLFormElement, Window)\nimport Web.XHR.FormData (FormData)\n\ntype App =\n    { csrfHeaderName :: String\n    , csrfCookieName :: String\n    , csrfParamName :: String\n    , csrfToken :: String\n    , homeR :: String\n    , authRlogoutR :: String\n    , userR :: Nullable String\n    , noteR :: Nullable String\n    , dat :: AppData\n    }\n\ntype AppData =\n  { bmarks :: Array Bookmark\n  , bmark :: Bookmark\n  , isowner :: Boolean\n  }\n\nforeign import _app :: Fn0 App\n\napp' :: Unit -> App\napp' _ = runFn0 _app\n\nforeign import _closest :: forall a. EffectFn4 (a -> Maybe a) (Maybe a) String Node (Maybe Node)\n\nclosest :: String -> Node -> Effect (Maybe Node)\nclosest selector node = runEffectFn4 _closest Just Nothing selector node \n\nforeign import _moment8601 :: EffectFn2 (String -> String -> Tuple String String) String (Tuple String String)\n\nmoment8601 :: String -> Effect (Tuple String String)\nmoment8601 s = runEffectFn2 _moment8601 Tuple s\n\nforeign import _mmoment8601 :: forall a. Fn4 (a -> Maybe a) (Maybe a) (String -> String -> Tuple String String) String (Maybe (Tuple String String))\n\nmmoment8601 :: String -> Maybe (Tuple String String)\nmmoment8601 s = runFn4 _mmoment8601 Just Nothing Tuple s\n\nforeign import _createFormData :: Fn1 HTMLFormElement FormData\n\ncreateFormData :: HTMLFormElement -> FormData\ncreateFormData f = runFn1 _createFormData f\n\nforeign import _createFormString :: Fn1 HTMLFormElement String\n\ncreateFormString :: HTMLFormElement -> String\ncreateFormString f = runFn1 _createFormString f\n\n\nforeign import _createFormArray :: Fn1 HTMLFormElement (Array (Array String))\n\ncreateFormArray :: HTMLFormElement -> (Array (Array String))\ncreateFormArray f = runFn1 _createFormArray f\n\nforeign import _closeWindow :: EffectFn1 Window Unit\n\ncloseWindow :: Window -> Effect Unit\ncloseWindow win = runEffectFn1 _closeWindow win\n\nnewtype RawHTML = RawHTML String\n\nderive instance newtypeRawHTML :: Newtype RawHTML _\n\nforeign import _setFocus :: EffectFn1 String Unit\n\nsetFocus :: String -> Effect Unit\nsetFocus s = runEffectFn1 _setFocus s\n\nforeign import _toLocaleDateString :: Fn1 String String\n\ntoLocaleDateString :: String -> String\ntoLocaleDateString s = runFn1 _toLocaleDateString s\n", "export const _parseJSON = JSON.parse;\n\nexport const _undefined = undefined;\n\nexport const _unsafeStringify = JSON.stringify;\n", "export function toCharCode(c) {\n  return c.charCodeAt(0);\n}\n\nexport function fromCharCode(c) {\n  return String.fromCharCode(c);\n}\n", "module Data.Enum\n  ( class Enum, succ, pred\n  , class BoundedEnum, cardinality, toEnum, fromEnum\n  , toEnumWithDefaults\n  , Cardinality(..)\n  , enumFromTo\n  , enumFromThenTo\n  , upFrom\n  , upFromIncluding\n  , downFrom\n  , downFromIncluding\n  , defaultSucc\n  , defaultPred\n  , defaultCardinality\n  , defaultToEnum\n  , defaultFromEnum\n  ) where\n\nimport Prelude\n\nimport Control.MonadPlus (guard)\nimport Data.Either (Either(..))\nimport Data.Maybe (Maybe(..), maybe, fromJust)\nimport Data.Newtype (class Newtype)\nimport Data.Tuple (Tuple(..))\nimport Data.Unfoldable (class Unfoldable, singleton, unfoldr)\nimport Data.Unfoldable1 (class Unfoldable1, unfoldr1)\nimport Partial.Unsafe (unsafePartial)\n\n-- | Type class for enumerations.\n-- |\n-- | Laws:\n-- | - Successor: `all (a < _) (succ a)`\n-- | - Predecessor: `all (_ < a) (pred a)`\n-- | - Succ retracts pred: `pred >=> succ >=> pred = pred`\n-- | - Pred retracts succ: `succ >=> pred >=> succ = succ`\n-- | - Non-skipping succ: `b <= a || any (_ <= b) (succ a)`\n-- | - Non-skipping pred: `a <= b || any (b <= _) (pred a)`\n-- |\n-- | The retraction laws can intuitively be understood as saying that `succ` is\n-- | the opposite of `pred`; if you apply `succ` and then `pred` to something,\n-- | you should end up with what you started with (although of course this\n-- | doesn't apply if you tried to `succ` the last value in an enumeration and\n-- | therefore got `Nothing` out).\n-- |\n-- | The non-skipping laws can intuitively be understood as saying that `succ`\n-- | shouldn't skip over any elements of your type. For example, _without_ the\n-- | non-skipping laws, it would be permissible to write an `Enum Int` instance\n-- | where `succ x = Just (x+2)`, and similarly `pred x = Just (x-2)`.\nclass Ord a <= Enum a where\n  succ :: a -> Maybe a\n  pred :: a -> Maybe a\n\ninstance enumBoolean :: Enum Boolean where\n  succ false = Just true\n  succ _ = Nothing\n  pred true = Just false\n  pred _= Nothing\n\ninstance enumInt :: Enum Int where\n  succ n = if n < top then Just (n + 1) else Nothing\n  pred n = if n > bottom then Just (n - 1) else Nothing\n\ninstance enumChar :: Enum Char where\n  succ = defaultSucc charToEnum toCharCode\n  pred = defaultPred charToEnum toCharCode\n\ninstance enumUnit :: Enum Unit where\n  succ = const Nothing\n  pred = const Nothing\n\ninstance enumOrdering :: Enum Ordering where\n  succ LT = Just EQ\n  succ EQ = Just GT\n  succ GT = Nothing\n  pred LT = Nothing\n  pred EQ = Just LT\n  pred GT = Just EQ\n\ninstance enumMaybe :: BoundedEnum a => Enum (Maybe a) where\n  succ Nothing = Just (Just bottom)\n  succ (Just a) = Just <$> succ a\n  pred Nothing = Nothing\n  pred (Just a) = Just (pred a)\n\ninstance enumEither :: (BoundedEnum a, BoundedEnum b) => Enum (Either a b) where\n  succ (Left a) = maybe (Just (Right bottom)) (Just <<< Left) (succ a)\n  succ (Right b) = maybe Nothing (Just <<< Right) (succ b)\n  pred (Left a) = maybe Nothing (Just <<< Left) (pred a)\n  pred (Right b) = maybe (Just (Left top)) (Just <<< Right) (pred b)\n\ninstance enumTuple :: (Enum a, BoundedEnum b) => Enum (Tuple a b) where\n  succ (Tuple a b) = maybe (flip Tuple bottom <$> succ a) (Just <<< Tuple a) (succ b)\n  pred (Tuple a b) = maybe (flip Tuple top <$> pred a) (Just <<< Tuple a) (pred b)\n\n-- | Type class for finite enumerations.\n-- |\n-- | This should not be considered a part of a numeric hierarchy, as in Haskell.\n-- | Rather, this is a type class for small, ordered sum types with\n-- | statically-determined cardinality and the ability to easily compute\n-- | successor and predecessor elements like `DayOfWeek`.\n-- |\n-- | Laws:\n-- |\n-- | - ```succ bottom >>= succ >>= succ ... succ [cardinality - 1 times] == top```\n-- | - ```pred top    >>= pred >>= pred ... pred [cardinality - 1 times] == bottom```\n-- | - ```forall a > bottom: pred a >>= succ == Just a```\n-- | - ```forall a < top:  succ a >>= pred == Just a```\n-- | - ```forall a > bottom: fromEnum <$> pred a = pred (fromEnum a)```\n-- | - ```forall a < top:  fromEnum <$> succ a = succ (fromEnum a)```\n-- | - ```e1 `compare` e2 == fromEnum e1 `compare` fromEnum e2```\n-- | - ```toEnum (fromEnum a) = Just a```\nclass (Bounded a, Enum a) <= BoundedEnum a where\n  cardinality :: Cardinality a\n  toEnum :: Int -> Maybe a\n  fromEnum :: a -> Int\n\ninstance boundedEnumBoolean :: BoundedEnum Boolean where\n  cardinality = Cardinality 2\n  toEnum 0 = Just false\n  toEnum 1 = Just true\n  toEnum _ = Nothing\n  fromEnum false = 0\n  fromEnum true = 1\n\ninstance boundedEnumChar :: BoundedEnum Char where\n  cardinality = Cardinality (toCharCode top - toCharCode bottom)\n  toEnum = charToEnum\n  fromEnum = toCharCode\n\ninstance boundedEnumUnit :: BoundedEnum Unit where\n  cardinality = Cardinality 1\n  toEnum 0 = Just unit\n  toEnum _ = Nothing\n  fromEnum = const 0\n\ninstance boundedEnumOrdering :: BoundedEnum Ordering where\n  cardinality = Cardinality 3\n  toEnum 0 = Just LT\n  toEnum 1 = Just EQ\n  toEnum 2 = Just GT\n  toEnum _ = Nothing\n  fromEnum LT = 0\n  fromEnum EQ = 1\n  fromEnum GT = 2\n\n-- | Like `toEnum` but returns the first argument if `x` is less than\n-- | `fromEnum bottom` and the second argument if `x` is greater than\n-- | `fromEnum top`.\n-- |\n-- | ``` purescript\n-- | toEnumWithDefaults False True (-1) -- False\n-- | toEnumWithDefaults False True 0    -- False\n-- | toEnumWithDefaults False True 1    -- True\n-- | toEnumWithDefaults False True 2    -- True\n-- | ```\ntoEnumWithDefaults :: forall a. BoundedEnum a => a -> a -> Int -> a\ntoEnumWithDefaults low high x = case toEnum x of\n  Just enum -> enum\n  Nothing -> if x < fromEnum (bottom :: a) then low else high\n\n-- | A type for the size of finite enumerations.\nnewtype Cardinality :: forall k. k -> Type\nnewtype Cardinality a = Cardinality Int\n\ntype role Cardinality representational\n\nderive instance newtypeCardinality :: Newtype (Cardinality a) _\nderive newtype instance eqCardinality :: Eq (Cardinality a)\nderive newtype instance ordCardinality :: Ord (Cardinality a)\n\ninstance showCardinality :: Show (Cardinality a) where\n  show (Cardinality n) = \"(Cardinality \" <> show n <> \")\"\n\n-- | Returns a contiguous sequence of elements from the first value to the\n-- | second value (inclusive).\n-- |\n-- | ``` purescript\n-- | enumFromTo 0 3 = [0, 1, 2, 3]\n-- | enumFromTo 'c' 'a' = ['c', 'b', 'a']\n-- | ```\n-- |\n-- | The example shows `Array` return values, but the result can be any type\n-- | with an `Unfoldable1` instance.\nenumFromTo :: forall a u. Enum a => Unfoldable1 u => a -> a -> u a\nenumFromTo = case _, _ of\n  from, to\n    | from == to -> singleton from\n    | from < to -> unfoldr1 (go succ (<=) to) from\n    | otherwise -> unfoldr1 (go pred (>=) to) from\n  where\n    go step op to a = Tuple a (step a >>= \\a' -> guard (a' `op` to) $> a')\n\n-- | Returns a sequence of elements from the first value, taking steps\n-- | according to the difference between the first and second value, up to\n-- | (but not exceeding) the third value.\n-- |\n-- | ``` purescript\n-- | enumFromThenTo 0 2 6 = [0, 2, 4, 6]\n-- | enumFromThenTo 0 3 5 = [0, 3]\n-- | ```\n-- |\n-- | Note that there is no `BoundedEnum` instance for integers, they're just\n-- | being used here for illustrative purposes to help clarify the behaviour.\n-- |\n-- | The example shows `Array` return values, but the result can be any type\n-- | with an `Unfoldable1` instance.\nenumFromThenTo :: forall f a. Unfoldable f => Functor f => BoundedEnum a => a -> a -> a -> f a\nenumFromThenTo = unsafePartial \\a b c ->\n  let\n    a' = fromEnum a\n    b' = fromEnum b\n    c' = fromEnum c\n  in\n    (toEnum >>> fromJust) <$> unfoldr (go (b' - a') c') a'\n  where\n    go step to e\n      | e <= to = Just (Tuple e (e + step))\n      | otherwise = Nothing\n\n-- | Produces all successors of an `Enum` value, excluding the start value.\nupFrom :: forall a u. Enum a => Unfoldable u => a -> u a\nupFrom = unfoldr (map diag <<< succ)\n\n-- | Produces all successors of an `Enum` value, including the start value.\n-- |\n-- | `upFromIncluding bottom` will return all values in an `Enum`.\nupFromIncluding :: \u2200 a u. Enum a => Unfoldable1 u => a -> u a\nupFromIncluding = unfoldr1 (Tuple <*> succ)\n\n-- | Produces all predecessors of an `Enum` value, excluding the start value.\ndownFrom :: forall a u. Enum a => Unfoldable u => a -> u a\ndownFrom = unfoldr (map diag <<< pred)\n\n-- | Produces all predecessors of an `Enum` value, including the start value.\n-- |\n-- | `downFromIncluding top` will return all values in an `Enum`, in reverse\n-- | order.\ndownFromIncluding :: forall a u. Enum a => Unfoldable1 u => a -> u a\ndownFromIncluding = unfoldr1 (Tuple <*> pred)\n\n-- | Provides a default implementation for `succ`, given a function that maps\n-- | integers to values in the `Enum`, and a function that maps values in the\n-- | `Enum` back to integers. The integer mapping must agree in both directions\n-- | for this to implement a law-abiding `succ`.\n-- |\n-- | If a `BoundedEnum` instance exists for `a`, the `toEnum` and `fromEnum`\n-- | functions can be used here:\n-- |\n-- | ``` purescript\n-- | succ = defaultSucc toEnum fromEnum\n-- | ```\ndefaultSucc :: forall a. (Int -> Maybe a) -> (a -> Int) -> a -> Maybe a\ndefaultSucc toEnum' fromEnum' a = toEnum' (fromEnum' a + 1)\n\n-- | Provides a default implementation for `pred`, given a function that maps\n-- | integers to values in the `Enum`, and a function that maps values in the\n-- | `Enum` back to integers. The integer mapping must agree in both directions\n-- | for this to implement a law-abiding `pred`.\n-- |\n-- | If a `BoundedEnum` instance exists for `a`, the `toEnum` and `fromEnum`\n-- | functions can be used here:\n-- |\n-- | ``` purescript\n-- | pred = defaultPred toEnum fromEnum\n-- | ```\ndefaultPred :: forall a. (Int -> Maybe a) -> (a -> Int) -> a -> Maybe a\ndefaultPred toEnum' fromEnum' a = toEnum' (fromEnum' a - 1)\n\n-- | Provides a default implementation for `cardinality`.\n-- |\n-- | Runs in `O(n)` where `n` is `fromEnum top`\ndefaultCardinality :: forall a. Bounded a => Enum a => Cardinality a\ndefaultCardinality = Cardinality $ go 1 (bottom :: a) where\n  go i x =\n    case succ x of\n      Just x' -> go (i + 1) x'\n      Nothing -> i\n\n-- | Provides a default implementation for `toEnum`.\n-- |\n-- | - Assumes `fromEnum bottom = 0`.\n-- | - Cannot be used in conjuction with `defaultSucc`.\n-- |\n-- | Runs in `O(n)` where `n` is `fromEnum a`.\ndefaultToEnum :: forall a. Bounded a => Enum a => Int -> Maybe a\ndefaultToEnum i' =\n  if i' < 0\n    then Nothing\n    else go i' bottom\n  where\n  go i x =\n    if i == 0\n      then Just x\n      -- We avoid using >>= here because it foils tail-call optimization\n      else case succ x of\n              Just x' -> go (i - 1) x'\n              Nothing -> Nothing\n\n-- | Provides a default implementation for `fromEnum`.\n-- |\n-- | - Assumes `toEnum 0 = Just bottom`.\n-- | - Cannot be used in conjuction with `defaultPred`.\n-- |\n-- | Runs in `O(n)` where `n` is `fromEnum a`.\ndefaultFromEnum :: forall a. Enum a => a -> Int\ndefaultFromEnum = go 0 where\n  go i x =\n    case pred x of\n      Just x' -> go (i + 1) x'\n      Nothing -> i\n\ndiag :: forall a. a -> Tuple a a\ndiag a = Tuple a a\n\ncharToEnum :: Int -> Maybe Char\ncharToEnum n | n >= toCharCode bottom && n <= toCharCode top = Just (fromCharCode n)\ncharToEnum _ = Nothing\n\nforeign import toCharCode :: Char -> Int\nforeign import fromCharCode :: Int -> Char\n", "export function unsafeReadPropImpl(f, s, key, value) {\n  return value == null ? f : s(value[key]);\n}\n\nexport function unsafeHasOwnProperty(prop, value) {\n  return Object.prototype.hasOwnProperty.call(value, prop);\n}\n\nexport function unsafeHasProperty(prop, value) {\n  return prop in value;\n}\n", "-- | This module defines a type class for types which act like\n-- | _property indices_.\n\nmodule Foreign.Index\n  ( class Index\n  , class Indexable\n  , readProp\n  , readIndex\n  , ix, (!)\n  , index\n  , hasProperty\n  , hasOwnProperty\n  , errorAt\n  ) where\n\nimport Prelude\n\nimport Control.Monad.Except.Trans (ExceptT)\n\nimport Foreign (Foreign, ForeignError(..), typeOf, isUndefined, isNull, fail)\nimport Data.Function.Uncurried (Fn2, runFn2, Fn4, runFn4)\nimport Data.List.NonEmpty (NonEmptyList)\n\n-- | This type class identifies types that act like _property indices_.\n-- |\n-- | The canonical instances are for `String`s and `Int`s.\nclass Index i m | i -> m where\n  index :: Foreign -> i -> ExceptT (NonEmptyList ForeignError) m Foreign\n  hasProperty :: i -> Foreign -> Boolean\n  hasOwnProperty :: i -> Foreign -> Boolean\n  errorAt :: i -> ForeignError -> ForeignError\n\nclass Indexable a m | a -> m where\n  ix :: forall i. Index i m => a -> i -> ExceptT (NonEmptyList ForeignError) m Foreign\n\ninfixl 9 ix as !\n\nforeign import unsafeReadPropImpl :: forall r k. Fn4 r (Foreign -> r) k Foreign r\n\nunsafeReadProp :: forall k m. Monad m => k -> Foreign -> ExceptT (NonEmptyList ForeignError) m Foreign\nunsafeReadProp k value =\n  runFn4 unsafeReadPropImpl (fail (TypeMismatch \"object\" (typeOf value))) pure k value\n\n-- | Attempt to read a value from a foreign value property\nreadProp :: forall m. Monad m => String -> Foreign -> ExceptT (NonEmptyList ForeignError) m Foreign\nreadProp = unsafeReadProp\n\n-- | Attempt to read a value from a foreign value at the specified numeric index\nreadIndex :: forall m. Monad m => Int -> Foreign -> ExceptT (NonEmptyList ForeignError) m Foreign\nreadIndex = unsafeReadProp\n\nforeign import unsafeHasOwnProperty :: forall k. Fn2 k Foreign Boolean\n\nhasOwnPropertyImpl :: forall k. k -> Foreign -> Boolean\nhasOwnPropertyImpl _ value | isNull value = false\nhasOwnPropertyImpl _ value | isUndefined value = false\nhasOwnPropertyImpl p value | typeOf value == \"object\" || typeOf value == \"function\" = runFn2 unsafeHasOwnProperty p value\nhasOwnPropertyImpl _ _ = false\n\nforeign import unsafeHasProperty :: forall k. Fn2 k Foreign Boolean\n\nhasPropertyImpl :: forall k. k -> Foreign -> Boolean\nhasPropertyImpl _ value | isNull value = false\nhasPropertyImpl _ value | isUndefined value = false\nhasPropertyImpl p value | typeOf value == \"object\" || typeOf value == \"function\" = runFn2 unsafeHasProperty p value\nhasPropertyImpl _ _ = false\n\ninstance indexString :: Monad m => Index String m where\n  index = flip readProp\n  hasProperty = hasPropertyImpl\n  hasOwnProperty = hasOwnPropertyImpl\n  errorAt = ErrorAtProperty\n\ninstance indexInt :: Monad m => Index Int m where\n  index = flip readIndex\n  hasProperty = hasPropertyImpl\n  hasOwnProperty = hasOwnPropertyImpl\n  errorAt = ErrorAtIndex\n\ninstance indexableForeign :: Monad m => Indexable Foreign m where\n  ix = index\n\ninstance indexableExceptT :: Monad m => Indexable (ExceptT (NonEmptyList ForeignError) m Foreign) m where\n  ix f i = flip index i =<< f\n", "module Record\n  ( get\n  , set\n  , modify\n  , insert\n  , delete\n  , rename\n  , equal\n  , merge\n  , union\n  , disjointUnion\n  , nub\n  , class EqualFields\n  , equalFields\n  ) where\n\nimport Prelude\n\nimport Data.Function.Uncurried (runFn2)\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Prim.Row (class Lacks, class Cons, class Nub, class Union)\nimport Prim.RowList (class RowToList, RowList, Cons, Nil)\nimport Record.Unsafe (unsafeGet, unsafeSet, unsafeDelete)\nimport Record.Unsafe.Union (unsafeUnionFn)\nimport Type.Proxy (Proxy(..))\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | Get a property for a label which is specified using a value-level proxy for\n-- | a type-level string.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | get (Proxy :: Proxy \"x\") :: forall r a. { x :: a | r } -> a\n-- | ```\nget\n  :: forall r r' l a\n   . IsSymbol l\n  => Cons l a r' r\n  => Proxy l\n  -> Record r\n  -> a\nget l r = unsafeGet (reflectSymbol l) r\n\n-- | Set a property for a label which is specified using a value-level proxy for\n-- | a type-level string.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | set (Proxy :: Proxy \"x\")\n-- |   :: forall r a b. a -> { x :: b | r } -> { x :: a | r }\n-- | ```\nset\n  :: forall r1 r2 r l a b\n   . IsSymbol l\n  => Cons l a r r1\n  => Cons l b r r2\n  => Proxy l\n  -> b\n  -> Record r1\n  -> Record r2\nset l b r = unsafeSet (reflectSymbol l) b r\n\n-- | Modify a property for a label which is specified using a value-level proxy for\n-- | a type-level string.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | modify (Proxy :: Proxy \"x\")\n-- |   :: forall r a b. (a -> b) -> { x :: a | r } -> { x :: b | r }\n-- | ```\nmodify\n  :: forall r1 r2 r l a b\n   . IsSymbol l\n  => Cons l a r r1\n  => Cons l b r r2\n  => Proxy l\n  -> (a -> b)\n  -> Record r1\n  -> Record r2\nmodify l f r = set l (f (get l r)) r\n\n-- | Insert a new property for a label which is specified using a value-level proxy for\n-- | a type-level string.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | insert (Proxy :: Proxy \"x\")\n-- |   :: forall r a. Lacks \"x\" r => a -> { | r } -> { x :: a | r }\n-- | ```\ninsert\n  :: forall r1 r2 l a\n   . IsSymbol l\n  => Lacks l r1\n  => Cons l a r1 r2\n  => Proxy l\n  -> a\n  -> Record r1\n  -> Record r2\ninsert l a r = unsafeSet (reflectSymbol l) a r\n\n-- | Delete a property for a label which is specified using a value-level proxy for\n-- | a type-level string.\n-- |\n-- | Note that the type of the resulting row must _lack_ the specified property.\n-- | Since duplicate labels are allowed, this is checked with a type class constraint.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | delete (Proxy :: Proxy \"x\")\n-- |   :: forall r a. Lacks \"x\" r => { x :: a | r } -> { | r }\n-- | ```\ndelete\n  :: forall r1 r2 l a\n   . IsSymbol l\n  => Lacks l r1\n  => Cons l a r1 r2\n  => Proxy l\n  -> Record r2\n  -> Record r1\ndelete l r = unsafeDelete (reflectSymbol l) r\n\n-- | Rename a property for a label which is specified using a value-level proxy for\n-- | a type-level string.\n-- |\n-- | Note that the type of the resulting row must _lack_ the specified property.\n-- | Since duplicate labels are allowed, this is checked with a type class constraint.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | rename (Proxy :: Proxy \"x\") (Proxy :: Proxy \"y\")\n-- |   :: forall a r. Lacks \"x\" r => Lacks \"y\" r => { x :: a | r} -> { y :: a | r}\n-- | ```\nrename :: forall prev next ty input inter output\n   . IsSymbol prev\n  => IsSymbol next\n  => Cons prev ty inter input\n  => Lacks prev inter\n  => Cons next ty inter output\n  => Lacks next inter\n  => Proxy prev\n  -> Proxy next\n  -> Record input\n  -> Record output\nrename prev next record =\n  insert next (get prev record) (delete prev record :: Record inter)\n\n-- | Merges two records with the first record's labels taking precedence in the\n-- | case of overlaps.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | merge { x: 1, y: \"y\" } { y: 2, z: true }\n-- |  :: { x :: Int, y :: String, z :: Boolean }\n-- | ```\nmerge\n  :: forall r1 r2 r3 r4\n   . Union r1 r2 r3\n  => Nub r3 r4\n  => Record r1\n  -> Record r2\n  -> Record r4\nmerge l r = runFn2 unsafeUnionFn l r\n\n-- | Merges two records with the first record's labels taking precedence in the\n-- | case of overlaps. Unlike `merge`, this does not remove duplicate labels\n-- | from the resulting record type. This can result in better inference for\n-- | some pipelines, deferring the need for a `Nub` constraint.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | union { x: 1, y: \"y\" } { y: 2, z: true }\n-- |  :: { x :: Int, y :: String, y :: Int, z :: Boolean }\n-- | ```\nunion\n  :: forall r1 r2 r3\n   . Union r1 r2 r3\n  => Record r1\n  -> Record r2\n  -> Record r3\nunion l r = runFn2 unsafeUnionFn l r\n\n-- | Merges two records where no labels overlap. This restriction exhibits\n-- | better inference than `merge` when the resulting record type is known,\n-- | but one argument is not.\n-- |\n-- | For example, hole `?help` is inferred to have type `{ b :: Int }` here:\n-- |\n-- | ```purescript\n-- | disjointUnion { a: 5 } ?help :: { a :: Int, b :: Int }\n-- | ```\ndisjointUnion\n  :: forall r1 r2 r3\n   . Union r1 r2 r3\n  => Nub r3 r3\n  => Record r1\n  -> Record r2\n  -> Record r3\ndisjointUnion l r = runFn2 unsafeUnionFn l r\n\n-- | A coercion which removes duplicate labels from a record's type.\nnub\n  :: forall r1 r2\n   . Nub r1 r2\n  => Record r1\n  -> Record r2\nnub = unsafeCoerce\n\n-- | Check two records of the same type for equality.\nequal\n  :: forall r rs\n   . RowToList r rs\n  => EqualFields rs r\n  => Record r\n  -> Record r\n  -> Boolean\nequal a b = equalFields (Proxy :: Proxy rs) a b\n\nclass EqualFields (rs :: RowList Type) (row :: Row Type) | rs -> row where\n  equalFields :: Proxy rs -> Record row -> Record row -> Boolean\n\ninstance equalFieldsCons\n  ::\n  ( IsSymbol name\n  , Eq ty\n  , Cons name ty tailRow row\n  , EqualFields tail row\n  ) => EqualFields (Cons name ty tail) row where\n  equalFields _ a b = get' a == get' b && equalRest a b\n    where\n      get' = get (Proxy :: Proxy name)\n      equalRest = equalFields (Proxy :: Proxy tail)\n\ninstance equalFieldsNil :: EqualFields Nil row where\n  equalFields _ _ _ = true\n", "export function copyRecord(rec) {\n  var copy = {};\n  for (var key in rec) {\n    if ({}.hasOwnProperty.call(rec, key)) {\n      copy[key] = rec[key];\n    }\n  }\n  return copy;\n}\n\nexport function unsafeInsert(l) {\n  return function(a) {\n    return function(rec) {\n      rec[l] = a;\n      return rec;\n    };\n  };\n}\n\nexport function unsafeModify(l) {\n  return function (f) {\n    return function(rec) {\n      rec[l] = f(rec[l]);\n      return rec;\n    };\n  };\n}\n\nexport function unsafeDelete(l) {\n  return function(rec) {\n    delete rec[l];\n    return rec;\n  };\n}\n\nexport function unsafeRename(l1) {\n  return function (l2) {\n    return function (rec) {\n      rec[l2] = rec[l1];\n      delete rec[l1];\n      return rec;\n    };\n  };\n}\n", "module Record.Builder\n  ( Builder\n  , build\n  , buildFromScratch\n  , flip\n  , insert\n  , modify\n  , delete\n  , rename\n  , merge\n  , union\n  , disjointUnion\n  , nub\n  ) where\n\nimport Prelude hiding (flip)\n\nimport Data.Function (flip) as Function\nimport Data.Function.Uncurried (runFn2)\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Prim.Row as Row\nimport Record.Unsafe.Union (unsafeUnionFn)\nimport Type.Proxy (Proxy)\nimport Unsafe.Coerce (unsafeCoerce)\n\nforeign import copyRecord :: forall r1. Record r1 -> Record r1\nforeign import unsafeInsert :: forall a r1 r2. String -> a -> Record r1 -> Record r2\nforeign import unsafeModify :: forall a b r1 r2. String -> (a -> b) -> Record r1 -> Record r2\nforeign import unsafeDelete :: forall r1 r2. String -> Record r1 -> Record r2\nforeign import unsafeRename :: forall r1 r2. String -> String -> Record r1 -> Record r2\n\n-- | A `Builder` can be used to `build` a record by incrementally adding\n-- | fields in-place, instead of using `insert` and repeatedly generating new\n-- | immutable records which need to be garbage collected.\n-- |\n-- | The mutations accumulated in a `Builder` are safe because intermediate states can't be\n-- | observed. These mutations, then, are performed all-at-once in the `build` function.\n-- |\n-- | The `Category` instance for `Builder` can be used to compose builders.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | build (insert x 42 >>> insert y \"testing\") {} :: { x :: Int, y :: String }\n-- | ```\nnewtype Builder a b = Builder (a -> b)\n\n-- | Build a record, starting from some other record.\nbuild :: forall r1 r2. Builder (Record r1) (Record r2) -> Record r1 -> Record r2\nbuild (Builder b) r1 = b (copyRecord r1)\n\n-- | Build a record from scratch.\nbuildFromScratch :: forall r. Builder (Record ()) (Record r) -> Record r\nbuildFromScratch = Function.flip build {}\n\n-- | Flip a function of one argument returning a builder.\nflip :: forall r1 r2 r3. (Record r1 -> Builder (Record r2) (Record r3)) -> Record r2 -> Builder (Record r1) (Record r3)\nflip f b = Builder \\a -> build (f a) b\n\nderive newtype instance semigroupoidBuilder :: Semigroupoid Builder\nderive newtype instance categoryBuilder :: Category Builder\n\n-- | Build by inserting a new field.\ninsert\n  :: forall l a r1 r2\n   . Row.Cons l a r1 r2\n  => Row.Lacks l r1\n  => IsSymbol l\n  => Proxy l\n  -> a\n  -> Builder (Record r1) (Record r2)\ninsert l a = Builder \\r1 -> unsafeInsert (reflectSymbol l) a r1\n\n-- | Build by modifying an existing field.\nmodify\n  :: forall l a b r r1 r2\n   . Row.Cons l a r r1\n  => Row.Cons l b r r2\n  => IsSymbol l\n  => Proxy l\n  -> (a -> b)\n  -> Builder (Record r1) (Record r2)\nmodify l f = Builder \\r1 -> unsafeModify (reflectSymbol l) f r1\n\n-- | Build by deleting an existing field.\ndelete\n  :: forall l a r1 r2\n   . IsSymbol l\n   => Row.Lacks l r1\n   => Row.Cons l a r1 r2\n   => Proxy l\n   -> Builder (Record r2) (Record r1)\ndelete l = Builder \\r2 -> unsafeDelete (reflectSymbol l) r2\n\n-- | Build by renaming an existing field.\nrename :: forall l1 l2 a r1 r2 r3\n   . IsSymbol l1\n  => IsSymbol l2\n  => Row.Cons l1 a r2 r1\n  => Row.Lacks l1 r2\n  => Row.Cons l2 a r2 r3\n  => Row.Lacks l2 r2\n  => Proxy l1\n  -> Proxy l2\n  -> Builder (Record r1) (Record r3)\nrename l1 l2 = Builder \\r1 -> unsafeRename (reflectSymbol l1) (reflectSymbol l2) r1\n\n-- | Build by merging existing fields from another record, taking precedence\n-- | in the case of overlaps.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | build (merge { x: 1, y: \"y\" }) { y: 2, z: true }\n-- |  :: { x :: Int, y :: String, z :: Boolean }\n-- | ```\nmerge\n  :: forall r1 r2 r3 r4\n   . Row.Union r1 r2 r3\n  => Row.Nub r3 r4\n  => Record r1\n  -> Builder (Record r2) (Record r4)\nmerge r1 = Builder \\r2 -> runFn2 unsafeUnionFn r1 r2\n\n-- | Build by merging existing fields from another record, taking precedence\n-- | in the case of overlaps. Unlike `merge`, this does not remove duplicate\n-- | labels from the resulting record type. This can result in better inference\n-- | for some pipelines, deferring the need for a `Nub` constraint.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | build (union { x: 1, y: \"y\" }) { y: 2, z: true }\n-- |  :: { x :: Int, y :: String, y :: Int, z :: Boolean }\n-- | ```\nunion\n  :: forall r1 r2 r3\n   . Row.Union r1 r2 r3\n  => Record r1\n  -> Builder (Record r2) (Record r3)\nunion r1 = Builder \\r2 -> runFn2 unsafeUnionFn r1 r2\n\n-- | Build by merging some disjoint set of fields from another record.\ndisjointUnion\n  :: forall r1 r2 r3\n   . Row.Union r1 r2 r3\n  => Row.Nub r3 r3\n  => Record r1\n  -> Builder (Record r2) (Record r3)\ndisjointUnion r1 = Builder \\r2 -> runFn2 unsafeUnionFn r1 r2\n\n-- | A coercion which removes duplicate labels from a record's type.\nnub\n  :: forall r1 r2\n   . Row.Nub r1 r2\n  => Builder (Record r1) (Record r2)\nnub = Builder unsafeCoerce\n", "module Simple.JSON\n( E\n, readJSON\n, readJSON'\n, readJSON_\n, writeJSON\n, write\n, read\n, read'\n, read_\n, readAsForeign\n, parseJSON\n, undefined\n, unsafeStringify\n\n, class ReadForeign\n, readImpl\n, class ReadForeignFields\n, getFields\n, class ReadForeignVariant\n, readVariantImpl\n\n, class WriteForeign\n, writeImpl\n, class WriteForeignFields\n, writeImplFields\n, class WriteForeignVariant\n, writeVariantImpl\n\n) where\n\nimport Prelude\n\nimport Control.Alt ((<|>))\nimport Control.Monad.Except (ExceptT(..), except, runExcept, runExceptT, withExcept)\nimport Data.Array.NonEmpty (NonEmptyArray, fromArray, toArray)\nimport Data.Bifunctor (lmap)\nimport Data.Either (Either(..), hush, note)\nimport Data.Identity (Identity(..))\nimport Data.List.NonEmpty (singleton)\nimport Data.Maybe (Maybe(..), maybe)\nimport Data.Nullable (Nullable, toMaybe, toNullable)\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Traversable (sequence, traverse)\nimport Data.TraversableWithIndex (traverseWithIndex)\nimport Data.Variant (Variant, inj, on)\nimport Effect.Exception (message, try)\nimport Effect.Uncurried as EU\nimport Effect.Unsafe (unsafePerformEffect)\nimport Foreign (F, Foreign, ForeignError(..), MultipleErrors, fail, isNull, isUndefined, readArray, readBoolean, readChar, readInt, readNull, readNumber, readString, tagOf, unsafeFromForeign, unsafeToForeign)\nimport Foreign.Index (readProp)\nimport Foreign.Object (Object)\nimport Foreign.Object as Object\nimport Partial.Unsafe (unsafeCrashWith)\nimport Prim.Row as Row\nimport Prim.RowList (class RowToList, Cons, Nil, RowList)\nimport Record (get)\nimport Record.Builder (Builder)\nimport Record.Builder as Builder\nimport Type.Proxy (Proxy(..))\n\n-- | An alias for the Either result of decoding\ntype E a = Either MultipleErrors a\n\n-- | Read a JSON string to a type `a` while returning a `MultipleErrors` if the\n-- | parsing failed.\nreadJSON :: forall a\n  .  ReadForeign a\n  => String\n  -> E a\nreadJSON = runExcept <<< (readImpl <=< parseJSON)\n\n-- | Read a JSON string to a type `a` using `F a`. Useful with record types.\nreadJSON' :: forall a\n  .  ReadForeign a\n  => String\n  -> F a\nreadJSON' = readImpl <=< parseJSON\n\n-- | Read a JSON string to a type `a` while returning `Nothing` if the parsing\n-- | failed.\nreadJSON_ ::  forall a\n   . ReadForeign a\n  => String\n  -> Maybe a\nreadJSON_ = hush <<< readJSON\n\n-- | JSON.stringify\nforeign import _unsafeStringify :: forall a. a -> String\n\nunsafeStringify :: forall a. a -> String\nunsafeStringify = _unsafeStringify\n\n-- | Write a JSON string from a type `a`.\nwriteJSON :: forall a\n  .  WriteForeign a\n  => a\n  -> String\nwriteJSON = _unsafeStringify <<< writeImpl\n\nwrite :: forall a\n  .  WriteForeign a\n  => a\n  -> Foreign\nwrite = writeImpl\n\n-- | Read a Foreign value to a type\nread :: forall a\n   . ReadForeign a\n  => Foreign\n  -> E a\nread = runExcept <<< readImpl\n\n-- | Read a value of any type as Foreign to a type\nreadAsForeign :: forall a b\n   . ReadForeign a\n  => b\n  -> E a\nreadAsForeign = read <<< unsafeToForeign\n\nread' :: forall a\n  .  ReadForeign a\n  => Foreign\n  -> F a\nread' = readImpl\n\n-- | Read a Foreign value to a type, as a Maybe of type\nread_ :: forall a\n   . ReadForeign a\n  => Foreign\n  -> Maybe a\nread_ = hush <<< read\n\nforeign import _parseJSON :: EU.EffectFn1 String Foreign\n\nparseJSON :: String -> F Foreign\nparseJSON\n    = ExceptT\n  <<< Identity\n  <<< lmap (pure <<< ForeignError <<< message)\n  <<< runPure\n  <<< try\n  <<< EU.runEffectFn1 _parseJSON\n  where\n    -- Nate Faubion: \"It uses unsafePerformEffect because that\u2019s the only way to catch exceptions and still use the builtin json decoder\"\n    runPure = unsafePerformEffect\n\nforeign import _undefined :: Foreign\n\nundefined :: Foreign\nundefined = _undefined\n\n-- | A class for reading foreign values to a type\nclass ReadForeign a where\n  readImpl :: Foreign -> F a\n\ninstance readForeign :: ReadForeign Foreign where\n  readImpl = pure\n\ninstance readChar :: ReadForeign Char where\n  readImpl = readChar\n\ninstance readNumber :: ReadForeign Number where\n  readImpl = readNumber\n\ninstance readInt :: ReadForeign Int where\n  readImpl = readInt\n\ninstance readString :: ReadForeign String where\n  readImpl = readString\n\ninstance readBoolean :: ReadForeign Boolean where\n  readImpl = readBoolean\n\ninstance readArray :: ReadForeign a => ReadForeign (Array a) where\n  readImpl = traverseWithIndex readAtIdx <=< readArray\n    where\n      readAtIdx i f = withExcept (map (ErrorAtIndex i)) (readImpl f)\n\ninstance readMaybe :: ReadForeign a => ReadForeign (Maybe a) where\n  readImpl = readNullOrUndefined readImpl\n    where\n      readNullOrUndefined _ value | isNull value || isUndefined value = pure Nothing\n      readNullOrUndefined f value = Just <$> f value\n\ninstance readNullable :: ReadForeign a => ReadForeign (Nullable a) where\n  readImpl o = withExcept (map reformat) $\n    map toNullable <$> traverse readImpl =<< readNull o\n    where\n      reformat error = case error of\n        TypeMismatch inner other -> TypeMismatch (\"Nullable \" <> inner) other\n        _ -> error\n\ninstance readObject :: ReadForeign a => ReadForeign (Object.Object a) where\n  readImpl = sequence <<< Object.mapWithKey (const readImpl) <=< readObject'\n    where\n      readObject' :: Foreign -> F (Object Foreign)\n      readObject' value\n        | tagOf value == \"Object\" = pure $ unsafeFromForeign value\n        | otherwise = fail $ TypeMismatch \"Object\" (tagOf value)\n\n\ninstance readRecord ::\n  ( RowToList fields fieldList\n  , ReadForeignFields fieldList () fields\n  ) => ReadForeign (Record fields) where\n  readImpl o = flip Builder.build {} <$> getFields fieldListP o\n    where\n      fieldListP = Proxy :: Proxy fieldList\n\n-- | A class for reading foreign values from properties\nclass ReadForeignFields (xs :: RowList Type) (from :: Row Type) (to :: Row Type)\n  | xs -> from to where\n  getFields :: Proxy xs\n    -> Foreign\n    -> F (Builder (Record from) (Record to))\n\ninstance readFieldsCons ::\n  ( IsSymbol name\n  , ReadForeign ty\n  , ReadForeignFields tail from from'\n  , Row.Lacks name from'\n  , Row.Cons name ty from' to\n  ) => ReadForeignFields (Cons name ty tail) from to where\n  getFields _ obj = (compose <$> first) `exceptTApply` rest\n    where\n      first = do\n        value <- withExcept' (readImpl =<< readProp name obj)\n        pure $ Builder.insert nameP value\n      rest = getFields tailP obj\n      nameP = Proxy :: Proxy name\n      tailP = Proxy :: Proxy tail\n      name = reflectSymbol nameP\n      withExcept' = withExcept <<< map $ ErrorAtProperty name\n\nexceptTApply :: forall a b e m. Semigroup e => Applicative m => ExceptT e m (a -> b) -> ExceptT e m a -> ExceptT e m b\nexceptTApply fun a = ExceptT $ applyEither\n  <$> runExceptT fun\n  <*> runExceptT a\n\napplyEither :: forall e a b. Semigroup e => Either e (a -> b) -> Either e a -> Either e b\napplyEither (Left e) (Right _) = Left e\napplyEither (Left e1) (Left e2) = Left (e1 <> e2)\napplyEither (Right _) (Left e) = Left e\napplyEither (Right fun) (Right a) = Right (fun a)\n\ninstance readFieldsNil ::\n  ReadForeignFields Nil () () where\n  getFields _ _ =\n    pure identity\n\ninstance readForeignVariant ::\n  ( RowToList variants rl\n  , ReadForeignVariant rl variants\n  ) => ReadForeign (Variant variants) where\n  readImpl o = readVariantImpl (Proxy :: Proxy rl) o\n\nclass ReadForeignVariant (xs :: RowList Type) (row :: Row Type)\n  | xs -> row where\n  readVariantImpl :: Proxy xs\n    -> Foreign\n    -> F (Variant row)\n\ninstance readVariantNil ::\n  ReadForeignVariant Nil trash where\n  readVariantImpl _ _ = fail $ ForeignError \"Unable to match any variant member.\"\n\ninstance readVariantCons ::\n  ( IsSymbol name\n  , ReadForeign ty\n  , Row.Cons name ty trash row\n  , ReadForeignVariant tail row\n  ) => ReadForeignVariant (Cons name ty tail) row where\n  readVariantImpl _ o = do\n    obj :: { type :: String, value :: Foreign } <- readImpl o\n    if obj.type == name\n      then do\n        value :: ty <- readImpl obj.value\n        pure $ inj namep value\n      else\n        (fail <<< ForeignError $ \"Did not match variant tag \" <> name)\n    <|> readVariantImpl (Proxy :: Proxy tail) o\n    where\n      namep = Proxy :: Proxy name\n      name = reflectSymbol namep\n\n-- -- | A class for writing a value into JSON\n-- -- | need to do this intelligently using Foreign probably, because of null and undefined whatever\nclass WriteForeign a where\n  writeImpl :: a -> Foreign\n\ninstance writeForeignForeign :: WriteForeign Foreign where\n  writeImpl = identity\n\ninstance writeForeignString :: WriteForeign String where\n  writeImpl = unsafeToForeign\n\ninstance writeForeignInt :: WriteForeign Int where\n  writeImpl = unsafeToForeign\n\ninstance writeForeignChar :: WriteForeign Char where\n  writeImpl = unsafeToForeign\n\ninstance writeForeignNumber :: WriteForeign Number where\n  writeImpl = unsafeToForeign\n\ninstance writeForeignBoolean :: WriteForeign Boolean where\n  writeImpl = unsafeToForeign\n\ninstance writeForeignArray :: WriteForeign a => WriteForeign (Array a) where\n  writeImpl xs = unsafeToForeign $ writeImpl <$> xs\n\ninstance writeForeignMaybe :: WriteForeign a => WriteForeign (Maybe a) where\n  writeImpl = maybe undefined writeImpl\n\ninstance writeForeignNullable :: WriteForeign a => WriteForeign (Nullable a) where\n  writeImpl = maybe (unsafeToForeign $ toNullable Nothing) writeImpl <<< toMaybe\n\ninstance writeForeignObject :: WriteForeign a => WriteForeign (Object.Object a) where\n  writeImpl = unsafeToForeign <<< Object.mapWithKey (const writeImpl)\n\ninstance recordWriteForeign ::\n  ( RowToList row rl\n  , WriteForeignFields rl row () to\n  ) => WriteForeign (Record row) where\n  writeImpl rec = unsafeToForeign $ Builder.build steps {}\n    where\n      rlp = Proxy :: Proxy rl\n      steps = writeImplFields rlp rec\n\nclass WriteForeignFields (rl :: RowList Type) row (from :: Row Type) (to :: Row Type)\n  | rl -> row from to where\n  writeImplFields :: forall g. g rl -> Record row -> Builder (Record from) (Record to)\n\ninstance consWriteForeignFields ::\n  ( IsSymbol name\n  , WriteForeign ty\n  , WriteForeignFields tail row from from'\n  , Row.Cons name ty whatever row\n  , Row.Lacks name from'\n  , Row.Cons name Foreign from' to\n  ) => WriteForeignFields (Cons name ty tail) row from to where\n  writeImplFields _ rec = result\n    where\n      namep = Proxy :: Proxy name\n      value = writeImpl $ get namep rec\n      tailp = Proxy :: Proxy tail\n      rest = writeImplFields tailp rec\n      result = Builder.insert namep value <<< rest\ninstance nilWriteForeignFields ::\n  WriteForeignFields Nil row () () where\n  writeImplFields _ _ = identity\n\ninstance writeForeignVariant ::\n  ( RowToList row rl\n  , WriteForeignVariant rl row\n  ) => WriteForeign (Variant row) where\n  writeImpl variant = writeVariantImpl (Proxy :: Proxy rl) variant\n\nclass WriteForeignVariant (rl :: RowList Type) (row :: Row Type)\n  | rl -> row where\n  writeVariantImpl :: forall g. g rl -> Variant row -> Foreign\n\ninstance nilWriteForeignVariant ::\n  WriteForeignVariant Nil () where\n  writeVariantImpl _ _ =\n    -- a PureScript-defined variant cannot reach this path, but a JavaScript FFI one could.\n    unsafeCrashWith \"Variant was not able to be writen row WriteForeign.\"\n\ninstance consWriteForeignVariant ::\n  ( IsSymbol name\n  , WriteForeign ty\n  , Row.Cons name ty subRow row\n  , WriteForeignVariant tail subRow\n  ) => WriteForeignVariant (Cons name ty tail) row where\n  writeVariantImpl _ variant =\n    on\n      namep\n      writeVariant\n      (writeVariantImpl (Proxy :: Proxy tail))\n      variant\n    where\n    namep = Proxy :: Proxy name\n    writeVariant value = unsafeToForeign\n      { type: reflectSymbol namep\n      , value: writeImpl value\n      }\n\ninstance readForeignNEArray :: ReadForeign a => ReadForeign (NonEmptyArray a) where\n  readImpl f = do\n    raw :: Array a <- readImpl f\n    except $ note (singleton $ ForeignError \"Nonempty array expected, got empty array\") $ fromArray raw\n\ninstance writeForeignNEArray :: WriteForeign a => WriteForeign (NonEmptyArray a) where\n  writeImpl a = writeImpl <<< toArray $ a\n", "module Model where\n\nimport Control.Monad.Except (runExcept)\nimport Data.Array (intercalate)\nimport Data.Either (hush)\nimport Data.Maybe (fromMaybe)\nimport Data.Nullable (Nullable)\nimport Data.String (Pattern(..), split)\nimport Foreign (Foreign, readInt, readString, unsafeToForeign)\nimport Foreign.Object (Object)\nimport Prelude (class Eq, pure, ($), (<$>))\nimport Simple.JSON as J\n\ntype BookmarkId = Int\ntype TagId = Int\n\ntype Bookmark =\n  { url :: String\n  , title :: String\n  , description :: String\n  , tags :: String\n  , private :: Boolean\n  , toread :: Boolean\n  , bid :: BookmarkId\n  , slug :: String\n  , selected :: Boolean\n  , time :: String\n  , archiveUrl :: Nullable String\n  }\n\nnewtype Bookmark' = Bookmark' Bookmark\nderive newtype instance J.ReadForeign Bookmark'\nderive newtype instance J.WriteForeign Bookmark'\n\ntype NoteId = Int\ntype NoteSlug = String\n\ntype Note =\n  { id :: NoteId\n  , slug :: NoteSlug\n  , title :: String\n  , text :: String\n  , length :: Int\n  , isMarkdown :: Boolean\n  , shared :: Boolean\n  , created :: String\n  , updated :: String\n  }\n\nnewtype Note' = Note' Note\nderive newtype instance J.ReadForeign Note'\nderive newtype instance J.WriteForeign Note'\n\ntype AccountSettings =\n  { archiveDefault :: Boolean\n  , privateDefault :: Boolean\n  , privacyLock :: Boolean\n  }\n\nnewtype AccountSettings' = AccountSettings' AccountSettings\nderive newtype instance J.ReadForeign AccountSettings'\nderive newtype instance J.WriteForeign AccountSettings'\n\ntype TagCloudMode =\n  { mode :: String\n  , value :: Foreign\n  , expanded :: Boolean\n  }\nnewtype TagCloudMode' = TagCloudMode' TagCloudMode\nderive newtype instance J.ReadForeign TagCloudMode'\nderive newtype instance J.WriteForeign TagCloudMode'\n\ntype TagCloud = Object Int\n\ndata TagCloudModeF\n  = TagCloudModeTop Boolean Int \n  | TagCloudModeLowerBound Boolean Int \n  | TagCloudModeRelated Boolean (Array String) \n  | TagCloudModeNone\n\nderive instance Eq TagCloudModeF\n\ntagCloudModeToF :: TagCloudMode -> TagCloudModeF\ntagCloudModeToF tagCloudMode =\n  fromMaybe TagCloudModeNone $ hush $ runExcept $\n    case tagCloudMode.mode of\n      \"top\" -> TagCloudModeTop tagCloudMode.expanded <$> readInt tagCloudMode.value\n      \"lowerBound\" -> TagCloudModeLowerBound tagCloudMode.expanded <$> readInt tagCloudMode.value\n      \"related\" -> (\\s -> TagCloudModeRelated tagCloudMode.expanded (split (Pattern \" \") s)) <$> readString tagCloudMode.value\n      _ -> pure TagCloudModeNone\n\ntagCloudModeFromF :: TagCloudModeF -> TagCloudMode\ntagCloudModeFromF (TagCloudModeTop e i) =\n  { mode: \"top\" , value: unsafeToForeign i, expanded: e }\ntagCloudModeFromF (TagCloudModeLowerBound e i) =\n  { mode: \"lowerBound\" , value: unsafeToForeign i, expanded: e }\ntagCloudModeFromF (TagCloudModeRelated e tags) =\n  { mode: \"related\" , value: unsafeToForeign (intercalate \" \" tags), expanded: e  }\ntagCloudModeFromF TagCloudModeNone =\n  { mode: \"none\" , value: unsafeToForeign \"\", expanded: false }\n    \nisExpanded :: TagCloudModeF -> Boolean\nisExpanded (TagCloudModeTop e _) = e\nisExpanded (TagCloudModeLowerBound e _) = e\nisExpanded (TagCloudModeRelated e _) = e\nisExpanded TagCloudModeNone = false\n\nisRelated :: TagCloudModeF -> Boolean\nisRelated (TagCloudModeRelated _ _) = true\nisRelated _ = false\n\nsetExpanded :: TagCloudModeF -> Boolean -> TagCloudModeF\nsetExpanded (TagCloudModeTop _ i) e' = TagCloudModeTop e' i\nsetExpanded (TagCloudModeLowerBound _ i) e' = TagCloudModeLowerBound e' i\nsetExpanded (TagCloudModeRelated _ i) e' = TagCloudModeRelated e' i\nsetExpanded TagCloudModeNone _ = TagCloudModeNone\n\nshowMode :: TagCloudModeF -> String\nshowMode (TagCloudModeTop _ _)  = \"top\"\nshowMode (TagCloudModeLowerBound _ _)  = \"lowerBound\"\nshowMode (TagCloudModeRelated _ _)  = \"related\"\nshowMode TagCloudModeNone = \"\"\n\n-- isSameMode :: TagCloudModeF -> TagCloudModeF -> Boolean\n-- isSameMode (TagCloudModeTop _ _) (TagCloudModeTop _ _) = true\n-- isSameMode (TagCloudModeLowerBound _ _) (TagCloudModeLowerBound _ _) = true\n-- isSameMode (TagCloudModeRelated _ _) (TagCloudModeRelated _ _) = true\n-- isSameMode TagCloudModeNone TagCloudModeNone = true\n-- isSameMode _ _ = false\n", "const windowImpl = function () {\n  return window;\n};\nexport { windowImpl as window };\n", "module Web.HTML.Common where\n\nimport Prelude\n\nimport Data.Newtype (class Newtype)\n\n-- | A wrapper for property names.\n-- |\n-- | The phantom type `value` describes the type of value which this property\n-- | requires.\nnewtype PropName :: Type -> Type\nnewtype PropName value = PropName String\n\nderive instance newtypePropName :: Newtype (PropName value) _\nderive newtype instance eqPropName :: Eq (PropName value)\nderive newtype instance ordPropName :: Ord (PropName value)\n\n-- | A wrapper for attribute names.\nnewtype AttrName = AttrName String\n\nderive instance newtypeAttrName :: Newtype AttrName _\nderive newtype instance eqAttrName :: Eq AttrName\nderive newtype instance ordAttrName :: Ord AttrName\n\n-- | A wrapper for strings which are used as CSS classes.\nnewtype ClassName = ClassName String\n\nderive instance newtypeClassName :: Newtype ClassName _\nderive newtype instance eqClassName :: Eq ClassName\nderive newtype instance ordClassName :: Ord ClassName\n", "export function _documentElement(doc) {\n  return doc.documentElement;\n}\n\nexport function _head(doc) {\n  return doc.head;\n}\n\nexport function _body(doc) {\n  return doc.body;\n}\n\nexport function _readyState(doc) {\n  return doc.readyState;\n}\n\nexport function _visibilityState(doc) {\n  return doc.readyState;\n}\n\nexport function _activeElement(doc) {\n  return doc.activeElement;\n}\n\nexport function _currentScript(doc) {\n  return doc.currentScript;\n}\n\nexport function _referrer(doc) {\n  return doc.referrer;\n}\n\nexport function _title(doc) {\n  return doc.title;\n}\n\nexport function _setTitle(title, doc) {\n  doc.title = title;\n}\n", "module Web.HTML.HTMLDocument\n  ( HTMLDocument\n  , fromDocument\n  , fromNode\n  , fromParentNode\n  , fromNonElementParentNode\n  , fromEventTarget\n  , toDocument\n  , toNode\n  , toParentNode\n  , toNonElementParentNode\n  , toEventTarget\n  , documentElement\n  , head\n  , body\n  , readyState\n  , visibilityState\n  , activeElement\n  , currentScript\n  , referrer\n  , title\n  , setTitle\n  ) where\n\nimport Prelude\n\nimport Data.Maybe (Maybe, fromMaybe)\nimport Data.Nullable (Nullable, toMaybe)\nimport Effect (Effect)\nimport Effect.Uncurried (EffectFn1, EffectFn2, runEffectFn1, runEffectFn2)\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.DOM.Document (Document)\nimport Web.DOM.Internal.Types (Node)\nimport Web.DOM.NonElementParentNode (NonElementParentNode)\nimport Web.DOM.ParentNode (ParentNode)\nimport Web.Event.EventTarget (EventTarget)\nimport Web.HTML.HTMLDocument.ReadyState (ReadyState)\nimport Web.HTML.HTMLDocument.ReadyState as ReadyState\nimport Web.HTML.HTMLDocument.VisibilityState (VisibilityState)\nimport Web.HTML.HTMLDocument.VisibilityState as VisibilityState\nimport Web.HTML.HTMLElement (HTMLElement)\nimport Web.HTML.HTMLHtmlElement (HTMLHtmlElement)\nimport Web.HTML.HTMLScriptElement (HTMLScriptElement)\nimport Web.Internal.FFI (unsafeReadProtoTagged)\n\nforeign import data HTMLDocument :: Type\n\nfromDocument :: Document -> Maybe HTMLDocument\nfromDocument = unsafeReadProtoTagged \"HTMLDocument\"\n\nfromNode :: Node -> Maybe HTMLDocument\nfromNode = unsafeReadProtoTagged \"HTMLDocument\"\n\nfromParentNode :: ParentNode -> Maybe HTMLDocument\nfromParentNode = unsafeReadProtoTagged \"HTMLDocument\"\n\nfromNonElementParentNode :: NonElementParentNode -> Maybe HTMLDocument\nfromNonElementParentNode = unsafeReadProtoTagged \"HTMLDocument\"\n\nfromEventTarget :: EventTarget -> Maybe HTMLDocument\nfromEventTarget = unsafeReadProtoTagged \"HTMLDocument\"\n\ntoDocument :: HTMLDocument -> Document\ntoDocument = unsafeCoerce\n\ntoNode :: HTMLDocument -> Node\ntoNode = unsafeCoerce\n\ntoParentNode :: HTMLDocument -> ParentNode\ntoParentNode = unsafeCoerce\n\ntoNonElementParentNode :: HTMLDocument -> NonElementParentNode\ntoNonElementParentNode = unsafeCoerce\n\ntoEventTarget :: HTMLDocument -> EventTarget\ntoEventTarget = unsafeCoerce\n\nforeign import _documentElement :: EffectFn1 HTMLDocument (Nullable HTMLHtmlElement)\n\ndocumentElement :: HTMLDocument -> Effect (Maybe HTMLHtmlElement)\ndocumentElement doc = toMaybe <$> runEffectFn1 _documentElement doc\n\nforeign import _head :: EffectFn1 HTMLDocument (Nullable HTMLElement)\n\nhead :: HTMLDocument -> Effect (Maybe HTMLElement)\nhead doc = toMaybe <$> runEffectFn1 _head doc\n\nforeign import _body :: EffectFn1 HTMLDocument (Nullable HTMLElement)\n\nbody :: HTMLDocument -> Effect (Maybe HTMLElement)\nbody doc = toMaybe <$> runEffectFn1 _body doc\n\nforeign import _readyState :: EffectFn1 HTMLDocument String\n\nreadyState :: HTMLDocument -> Effect ReadyState\nreadyState doc = (fromMaybe ReadyState.Loading <<< ReadyState.parse) <$> (runEffectFn1 _readyState doc)\n\nforeign import _visibilityState :: EffectFn1 HTMLDocument String\n\nvisibilityState :: HTMLDocument -> Effect VisibilityState\nvisibilityState doc = (fromMaybe VisibilityState.Visible <<< VisibilityState.parse) <$> (runEffectFn1 _visibilityState doc)\n\nforeign import _activeElement :: EffectFn1 HTMLDocument (Nullable HTMLElement)\n\nactiveElement :: HTMLDocument -> Effect (Maybe HTMLElement)\nactiveElement doc = toMaybe <$> (runEffectFn1 _activeElement doc)\n\nforeign import _currentScript :: EffectFn1 HTMLDocument (Nullable HTMLScriptElement)\n\ncurrentScript :: HTMLDocument -> Effect (Maybe HTMLScriptElement)\ncurrentScript doc = toMaybe <$> (runEffectFn1 _currentScript doc)\n\nforeign import _referrer :: EffectFn1 HTMLDocument String\n\nreferrer :: HTMLDocument -> Effect String\nreferrer doc = runEffectFn1 _referrer doc\n\nforeign import _title :: EffectFn1 HTMLDocument String\n\ntitle :: HTMLDocument -> Effect String\ntitle doc = runEffectFn1 _title doc\n\nforeign import _setTitle :: EffectFn2 String HTMLDocument Unit\n\nsetTitle :: String -> HTMLDocument -> Effect Unit\nsetTitle newTitle doc = runEffectFn2 _setTitle newTitle doc\n", "export function _read(nothing, just, value) {\n  var tag = Object.prototype.toString.call(value);\n  if (tag.indexOf(\"[object HTML\") === 0 && tag.indexOf(\"Element]\") === tag.length - 8) {\n    return just(value);\n  } else {\n    return nothing;\n  }\n}\n\n// ----------------------------------------------------------------------------\n\nexport function title(elt) {\n  return function () {\n    return elt.title;\n  };\n}\n\nexport function setTitle(title) {\n  return function (elt) {\n    return function () {\n      elt.title = title;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function lang(elt) {\n  return function () {\n    return elt.lang;\n  };\n}\n\nexport function setLang(lang) {\n  return function (elt) {\n    return function () {\n      elt.lang = lang;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function dir(elt) {\n  return function () {\n    return elt.dir;\n  };\n}\n\nexport function setDir(dir) {\n  return function (elt) {\n    return function () {\n      elt.dir = dir;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function hidden(elt) {\n  return function () {\n    return elt.hidden;\n  };\n}\n\nexport function setHidden(hidden) {\n  return function (elt) {\n    return function () {\n      elt.hidden = hidden;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function tabIndex(elt) {\n  return function () {\n    return elt.tabIndex;\n  };\n}\n\nexport function setTabIndex(tabIndex) {\n  return function (elt) {\n    return function () {\n      elt.tabIndex = tabIndex;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function draggable(elt) {\n  return function () {\n    return elt.draggable;\n  };\n}\n\nexport function setDraggable(draggable) {\n  return function (elt) {\n    return function () {\n      elt.draggable = draggable;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function contentEditable(elt) {\n  return function () {\n    return elt.contentEditable;\n  };\n}\n\nexport function setContentEditable(contentEditable) {\n  return function (elt) {\n    return function () {\n      elt.contentEditable = contentEditable;\n    };\n  };\n}\n\nexport function isContentEditable(elt) {\n  return function () {\n    return elt.isContentEditable;\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function spellcheck(elt) {\n  return function () {\n    return elt.spellcheck;\n  };\n}\n\nexport function setSpellcheck(spellcheck) {\n  return function (elt) {\n    return function () {\n      elt.spellcheck = spellcheck;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function click(elt) {\n  return function () {\n    return elt.click();\n  };\n}\n\nexport function focus(elt) {\n  return function () {\n    return elt.focus();\n  };\n}\n\nexport function blur(elt) {\n  return function () {\n    return elt.blur();\n  };\n}\n\n// - CSSOM ---------------------------------------------------------------------\n\nexport function _offsetParent(el) {\n  return function () {\n    return el.offsetParent;\n  };\n}\n\nexport function offsetTop(el) {\n  return function () {\n    return el.offsetTop;\n  };\n}\n\nexport function offsetLeft(el) {\n  return function () {\n    return el.offsetLeft;\n  };\n}\n\nexport function offsetWidth(el) {\n  return function () {\n    return el.offsetWidth;\n  };\n}\n\nexport function offsetHeight(el) {\n  return function () {\n    return el.offsetHeight;\n  };\n}\n", "module Web.HTML.HTMLElement\n  ( HTMLElement\n  , fromElement\n  , fromNode\n  , fromChildNode\n  , fromNonDocumentTypeChildNode\n  , fromParentNode\n  , fromEventTarget\n  , toElement\n  , toNode\n  , toChildNode\n  , toNonDocumentTypeChildNode\n  , toParentNode\n  , toEventTarget\n  , title\n  , setTitle\n  , lang\n  , setLang\n  , dir\n  , setDir\n  , hidden\n  , setHidden\n  , tabIndex\n  , setTabIndex\n  , draggable\n  , setDraggable\n  , contentEditable\n  , setContentEditable\n  , isContentEditable\n  , spellcheck\n  , setSpellcheck\n  , click\n  , focus\n  , blur\n  , offsetParent\n  , offsetTop\n  , offsetLeft\n  , offsetWidth\n  , offsetHeight\n  ) where\n\nimport Prelude\n\nimport Data.Function.Uncurried (Fn3, runFn3)\nimport Data.Maybe (Maybe(..))\nimport Data.Nullable (Nullable, toMaybe)\nimport Effect (Effect)\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.DOM (ChildNode)\nimport Web.DOM.Element (Element)\nimport Web.DOM.Internal.Types (Node)\nimport Web.DOM.NonDocumentTypeChildNode (NonDocumentTypeChildNode)\nimport Web.DOM.ParentNode (ParentNode)\nimport Web.Event.EventTarget (EventTarget)\n\nforeign import data HTMLElement :: Type\n\nforeign import _read :: forall a. Fn3 (forall x. Maybe x) (forall x. x -> Maybe x) a (Maybe HTMLElement)\n\nfromElement :: Element -> Maybe HTMLElement\nfromElement x = runFn3 _read Nothing Just x\n\nfromNode :: Node -> Maybe HTMLElement\nfromNode x = runFn3 _read Nothing Just x\n\nfromChildNode :: ChildNode -> Maybe HTMLElement\nfromChildNode x = runFn3 _read Nothing Just x\n\nfromNonDocumentTypeChildNode :: NonDocumentTypeChildNode -> Maybe HTMLElement\nfromNonDocumentTypeChildNode x = runFn3 _read Nothing Just x\n\nfromParentNode :: ParentNode -> Maybe HTMLElement\nfromParentNode x = runFn3 _read Nothing Just x\n\nfromEventTarget :: EventTarget -> Maybe HTMLElement\nfromEventTarget x = runFn3 _read Nothing Just x\n\ntoElement :: HTMLElement -> Element\ntoElement = unsafeCoerce\n\ntoNode :: HTMLElement -> Node\ntoNode = unsafeCoerce\n\ntoChildNode :: HTMLElement -> ChildNode\ntoChildNode = unsafeCoerce\n\ntoNonDocumentTypeChildNode :: HTMLElement -> NonDocumentTypeChildNode\ntoNonDocumentTypeChildNode = unsafeCoerce\n\ntoParentNode :: HTMLElement -> ParentNode\ntoParentNode = unsafeCoerce\n\ntoEventTarget :: HTMLElement -> EventTarget\ntoEventTarget = unsafeCoerce\n\nforeign import title :: HTMLElement -> Effect String\nforeign import setTitle :: String -> HTMLElement -> Effect Unit\n\nforeign import lang :: HTMLElement -> Effect String\nforeign import setLang :: String -> HTMLElement -> Effect Unit\n\nforeign import dir :: HTMLElement -> Effect String\nforeign import setDir :: String -> HTMLElement -> Effect Unit\n\nforeign import hidden :: HTMLElement -> Effect Boolean\nforeign import setHidden :: Boolean -> HTMLElement -> Effect Unit\n\nforeign import tabIndex :: HTMLElement -> Effect Int\nforeign import setTabIndex :: Int -> HTMLElement -> Effect Unit\n\nforeign import draggable :: HTMLElement -> Effect Boolean\nforeign import setDraggable :: Boolean -> HTMLElement -> Effect Unit\n\nforeign import contentEditable :: HTMLElement -> Effect String\nforeign import setContentEditable :: String -> HTMLElement -> Effect Unit\nforeign import isContentEditable :: HTMLElement -> Effect Boolean\n\nforeign import spellcheck :: HTMLElement -> Effect Boolean\nforeign import setSpellcheck :: Boolean -> HTMLElement -> Effect Unit\n\nforeign import click :: HTMLElement -> Effect Unit\nforeign import focus :: HTMLElement -> Effect Unit\nforeign import blur :: HTMLElement -> Effect Unit\n\nforeign import _offsetParent :: HTMLElement -> Effect (Nullable Element)\n\noffsetParent :: HTMLElement -> Effect (Maybe Element)\noffsetParent = map toMaybe <<< _offsetParent\n\nforeign import offsetTop :: HTMLElement -> Effect Number\nforeign import offsetLeft :: HTMLElement -> Effect Number\nforeign import offsetWidth :: HTMLElement -> Effect Number\nforeign import offsetHeight :: HTMLElement -> Effect Number\n", "export function hash(location) {\n  return function () {\n    return location.hash;\n  };\n}\n\nexport function setHash(hash) {\n  return function (location) {\n    return function () {\n      location.hash = hash;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function host(location) {\n  return function () {\n    return location.host;\n  };\n}\n\nexport function setHost(host) {\n  return function (location) {\n    return function () {\n      location.host = host;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function hostname(location) {\n  return function () {\n    return location.hostname;\n  };\n}\n\nexport function setHostname(hostname) {\n  return function (location) {\n    return function () {\n      location.hostname = hostname;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function href(location) {\n  return function () {\n    return location.href;\n  };\n}\n\nexport function setHref(href) {\n  return function (location) {\n    return function () {\n      location.href = href;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function origin(location) {\n  return function () {\n    return location.origin;\n  };\n}\n\nexport function setOrigin(origin) {\n  return function (location) {\n    return function () {\n      location.origin = origin;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function pathname(location) {\n  return function () {\n    return location.pathname;\n  };\n}\n\nexport function setPathname(pathname) {\n  return function (location) {\n    return function () {\n      location.pathname = pathname;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function port(location) {\n  return function () {\n    return location.port;\n  };\n}\n\nexport function setPort(port) {\n  return function (location) {\n    return function () {\n      location.port = port;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function protocol(location) {\n  return function () {\n    return location.protocol;\n  };\n}\n\nexport function setProtocol(protocol) {\n  return function (location) {\n    return function () {\n      location.protocol = protocol;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function search(location) {\n  return function () {\n    return location.search;\n  };\n}\n\nexport function setSearch(search) {\n  return function (location) {\n    return function () {\n      location.search = search;\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function assign(url) {\n  return function (location) {\n    return function () {\n      location.assign(url);\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function replace(url) {\n  return function (location) {\n    return function () {\n      location.replace(url);\n    };\n  };\n}\n\n// ----------------------------------------------------------------------------\n\nexport function reload(location) {\n  return function () {\n    location.reload();\n  };\n}\n", "export function document(window) {\n  return function () {\n    return window.document;\n  };\n}\n\nexport function navigator(window) {\n  return function () {\n    return window.navigator;\n  };\n}\n\nexport function location(window) {\n  return function () {\n    return window.location;\n  };\n}\n\nexport function history(window) {\n  return function() {\n    return window.history;\n  };\n}\n\nexport function innerWidth(window) {\n  return function () {\n    return window.innerWidth;\n  };\n}\n\nexport function innerHeight(window) {\n  return function () {\n    return window.innerHeight;\n  };\n}\n\nexport function alert(str) {\n  return function (window) {\n    return function () {\n      window.alert(str);\n    };\n  };\n}\n\nexport function confirm(str) {\n  return function (window) {\n    return function () {\n      return window.confirm(str);\n    };\n  };\n}\n\nexport function moveBy(xDelta) {\n  return function (yDelta) {\n    return function (window) {\n      return function () {\n        window.moveBy(xDelta, yDelta);\n      };\n    };\n  };\n}\n\nexport function moveTo(width) {\n  return function (height) {\n    return function (window) {\n      return function () {\n        window.moveTo(width, height);\n      };\n    };\n  };\n}\n\nexport function _open(url) {\n  return function (name) {\n    return function (features) {\n      return function (window) {\n        return function () {\n          return window.open(url, name, features);\n        };\n      };\n    };\n  };\n}\n\nexport function close(window) {\n  return function () {\n    return window.close();\n  };\n}\n\nexport function outerHeight(window) {\n  return function () {\n    return window.outerHeight;\n  };\n}\n\nexport function outerWidth(window) {\n  return function () {\n    return window.outerWidth;\n  };\n}\n\nexport function print(window) {\n  return function () {\n    window.print();\n  };\n}\n\nexport function _prompt(str) {\n  return function (defaultText) {\n    return function (window) {\n      return function () {\n        return window.prompt(str, defaultText);\n      };\n    };\n  };\n}\n\nexport function resizeBy(xDelta) {\n  return function (yDelta) {\n    return function (window) {\n      return function () {\n        window.resizeBy(xDelta, yDelta);\n      };\n    };\n  };\n}\n\nexport function resizeTo(width) {\n  return function (height) {\n    return function (window) {\n      return function () {\n        window.resizeTo(width, height);\n      };\n    };\n  };\n}\n\nexport function screenX(window) {\n  return function () {\n    return window.screenX;\n  };\n}\n\nexport function screenY(window) {\n  return function () {\n    return window.screenY;\n  };\n}\n\nexport function scroll(xCoord) {\n  return function (yCoord) {\n    return function (window) {\n      return function () {\n        window.scroll(xCoord, yCoord);\n      };\n    };\n  };\n}\n\nexport function scrollBy(xCoord) {\n  return function (yCoord) {\n    return function (window) {\n      return function () {\n        window.scrollBy(xCoord, yCoord);\n      };\n    };\n  };\n}\n\nexport function scrollX(window) {\n  return function () {\n    return window.scrollX;\n  };\n}\n\nexport function scrollY(window) {\n  return function () {\n    return window.scrollY;\n  };\n}\n\nexport function localStorage(window) {\n  return function () {\n    return window.localStorage;\n  };\n}\n\nexport function sessionStorage(window) {\n  return function () {\n    return window.sessionStorage;\n  };\n}\n\nexport function requestAnimationFrame(fn) {\n  return function(window) {\n    return function() {\n      return window.requestAnimationFrame(fn);\n    };\n  };\n}\n\nexport function cancelAnimationFrame(id) {\n  return function(window) {\n    return function() {\n      return window.cancelAnimationFrame(id);\n    };\n  };\n}\n\nexport function requestIdleCallback(opts) {\n  return function(fn) {\n    return function(window) {\n      return function() {\n        return window.requestIdleCallback(fn, opts);\n      };\n    };\n  };\n}\n\nexport function cancelIdleCallback(id) {\n  return function(window) {\n    return function() {\n      return window.cancelIdleCallback(id);\n    };\n  };\n}\n\nexport function parent(window) {\n  return function() {\n    return window.parent;\n  };\n}\n\nexport function _opener(window) {\n  return function() {\n    return window.opener;\n  };\n}\n", "module App where\n\nimport Prelude\n\nimport Affjax.RequestBody as AXReq\nimport Affjax.RequestHeader (RequestHeader(..))\nimport Affjax.ResponseFormat as AXRes\nimport Affjax.StatusCode (StatusCode(..))\nimport Affjax.Web (Response, Error)\nimport Affjax.Web (defaultRequest) as AX\nimport Affjax.Web as Ax\nimport Data.Array ((:))\nimport Data.Either (Either(..), hush)\nimport Data.FormURLEncoded (FormURLEncoded)\nimport Data.HTTP.Method (Method(..))\nimport Data.Maybe (Maybe(..))\nimport Data.MediaType.Common (applicationFormURLEncoded, applicationJSON)\nimport Effect.Aff (Aff)\nimport Effect.Class (liftEffect)\nimport Globals (app')\nimport Model (Bookmark, Bookmark'(..), Note, Note'(..), AccountSettings, AccountSettings'(..), TagCloudMode, TagCloudMode'(..), TagCloud)\nimport Simple.JSON as J\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.HTML (window)\nimport Web.HTML.Location (reload)\nimport Web.HTML.Window (location)\n\ndata StarAction = Star | UnStar\ninstance showStar :: Show StarAction where\n  show Star = \"star\"\n  show UnStar = \"unstar\"\n\ntoggleStar :: Int -> StarAction -> Aff Unit\ntoggleStar bid action = do\n  let path = \"bm/\" <> show bid <> \"/\" <> show action\n  void (fetchUrlEnc POST path Nothing AXRes.ignore)\n\ndestroy :: Int -> Aff (Either Error (Response Unit))\ndestroy bid =\n  fetchUrlEnc DELETE (\"bm/\" <> show bid) Nothing AXRes.ignore\n\nmarkRead :: Int -> Aff (Either Error (Response Unit))\nmarkRead bid = do\n  let path = \"bm/\" <> show bid <> \"/read\"\n  fetchUrlEnc POST path Nothing AXRes.ignore\n\neditBookmark :: Bookmark -> Aff (Either Error (Response String))\neditBookmark bm =  do\n    fetchJson POST \"api/add\" (Just (Bookmark' bm)) AXRes.string\n\neditNote :: Note -> Aff (Either Error (Response String))\neditNote bm =  do\n    fetchJson POST \"api/note/add\" (Just (Note' bm)) AXRes.string\n\nlookupTitle :: Bookmark -> Aff (Maybe String)\nlookupTitle bm = do\n  eres <- fetchJson POST \"api/lookuptitle\" (Just (Bookmark' bm)) AXRes.string\n  pure $ hush eres >>= \\res ->\n    if (res.status == StatusCode 200)\n    then Just res.body\n    else Nothing\n      \ngetTagCloud :: TagCloudMode -> Aff (Maybe TagCloud)\ngetTagCloud mode = do\n    eres <- fetchJson POST \"api/tagcloud\" (Just (TagCloudMode' mode)) AXRes.json\n    pure $ hush eres >>= \\res ->\n        pure (unsafeCoerce res.body)\n\nupdateTagCloudMode :: TagCloudMode -> Aff (Either Error (Response Unit))\nupdateTagCloudMode mode = do\n    fetchJson POST \"api/tagcloudmode\" (Just (TagCloudMode' mode)) AXRes.ignore\n  \ndestroyNote :: Int -> Aff (Either Error (Response Unit))\ndestroyNote nid =  do\n  fetchUrlEnc DELETE (\"api/note/\" <> show nid) Nothing AXRes.ignore\n\neditAccountSettings :: AccountSettings -> Aff (Either Error (Response Unit))\neditAccountSettings us =  do\n    fetchJson POST \"api/accountSettings\" (Just (AccountSettings' us)) AXRes.ignore\n\nlogout :: Unit -> Aff Unit\nlogout u = do\n  void (fetchUrl POST app.authRlogoutR [] Nothing AXRes.ignore)\n  liftEffect (window >>= location >>= reload)\n  where\n    app = app' u\n\nfetchJson\n  :: forall a b.\n     J.WriteForeign b\n  => Method\n  -> String\n  -> Maybe b\n  -> AXRes.ResponseFormat a\n  -> Aff (Either Error (Response a))\nfetchJson method path content rt =\n    fetchPath method path [ContentType applicationJSON] (AXReq.string <<< J.writeJSON <$> content) rt\n\nfetchUrlEnc\n  :: forall a.\n     Method\n  -> String\n  -> Maybe FormURLEncoded\n  -> AXRes.ResponseFormat a\n  -> Aff (Either Error (Response a))\nfetchUrlEnc method path content rt =\n    fetchPath method path [ContentType applicationFormURLEncoded] (AXReq.FormURLEncoded <$> content) rt\n\nfetchPath\n  :: forall a.\n     Method\n  -> String\n  -> Array RequestHeader\n  -> Maybe AXReq.RequestBody\n  -> AXRes.ResponseFormat a\n  -> Aff (Either Error (Response a))\nfetchPath method path headers content rt =\n    fetchUrl method ((app' unit).homeR <> path) headers content rt\n\nfetchUrl\n  :: forall a.\n     Method\n  -> String\n  -> Array RequestHeader\n  -> Maybe AXReq.RequestBody\n  -> AXRes.ResponseFormat a\n  -> Aff (Either Error (Response a))\nfetchUrl method url headers content rt =\n  Ax.request\n    AX.defaultRequest\n    { url = url\n    , method = Left method\n    , headers = RequestHeader app.csrfHeaderName app.csrfToken : headers\n    , content = content\n    , responseFormat = rt\n    }\n  where\n    app = app' unit\n", "module DOM.HTML.Indexed.InputType where\n\nimport Prelude\n\ndata InputType\n  = InputButton\n  | InputCheckbox\n  | InputColor\n  | InputDate\n  | InputDatetimeLocal\n  | InputEmail\n  | InputFile\n  | InputHidden\n  | InputImage\n  | InputMonth\n  | InputNumber\n  | InputPassword\n  | InputRadio\n  | InputRange\n  | InputReset\n  | InputSearch\n  | InputSubmit\n  | InputTel\n  | InputText\n  | InputTime\n  | InputUrl\n  | InputWeek\n\nderive instance eqInputType :: Eq InputType\nderive instance ordInputType :: Ord InputType\n\nrenderInputType :: InputType -> String\nrenderInputType = case _ of\n  InputButton -> \"button\"\n  InputCheckbox -> \"checkbox\"\n  InputColor -> \"color\"\n  InputDate -> \"date\"\n  InputDatetimeLocal -> \"datetime-local\"\n  InputEmail -> \"email\"\n  InputFile -> \"file\"\n  InputHidden -> \"hidden\"\n  InputImage -> \"image\"\n  InputMonth -> \"month\"\n  InputNumber -> \"number\"\n  InputPassword -> \"password\"\n  InputRadio -> \"radio\"\n  InputRange -> \"range\"\n  InputReset -> \"reset\"\n  InputSearch -> \"search\"\n  InputSubmit -> \"submit\"\n  InputTel -> \"tel\"\n  InputText -> \"text\"\n  InputTime -> \"time\"\n  InputUrl -> \"url\"\n  InputWeek -> \"week\"\n", "module Data.Lens.Internal.Forget where\n\nimport Prelude\n\nimport Data.Const (Const(..))\nimport Data.Either (Either(..), either)\nimport Data.Lens.Internal.Wander (class Wander)\nimport Data.Newtype (class Newtype, alaF)\nimport Data.Profunctor (class Profunctor)\nimport Data.Profunctor.Choice (class Choice)\nimport Data.Profunctor.Cochoice (class Cochoice)\nimport Data.Profunctor.Strong (class Strong)\nimport Data.Tuple (fst, snd)\n\n-- | Profunctor that forgets the `b` value and returns (and accumulates) a\n-- | value of type `r`.\n-- |\n-- | `Forget r` is isomorphic to `Star (Const r)`, but can be given a `Cochoice`\n-- | instance.\nnewtype Forget :: forall k. Type -> Type -> k -> Type\nnewtype Forget r a b = Forget (a -> r)\n\nderive instance newtypeForget :: Newtype (Forget r a b) _\n\nderive newtype instance semigroupForget :: Semigroup r => Semigroup (Forget r a b)\n\nderive newtype instance monoidForget :: Monoid r => Monoid (Forget r a b)\n\ninstance profunctorForget :: Profunctor (Forget r) where\n  dimap f _ (Forget z) = Forget (z <<< f)\n\ninstance choiceForget :: Monoid r => Choice (Forget r) where\n  left (Forget z) = Forget (either z mempty)\n  right (Forget z) = Forget (either mempty z)\n\ninstance strongForget :: Strong (Forget r) where\n  first (Forget z) = Forget (z <<< fst)\n  second (Forget z) = Forget (z <<< snd)\n\ninstance cochoiceForget :: Cochoice (Forget r) where\n  unleft (Forget z) = Forget (z <<< Left)\n  unright (Forget z) = Forget (z <<< Right)\n\ninstance wanderForget :: Monoid r => Wander (Forget r) where\n  wander f (Forget r) = Forget (alaF Const f r)\n", "module Data.Profunctor.Strong where\n\nimport Prelude\n\nimport Data.Profunctor (class Profunctor, dimap)\nimport Data.Tuple (Tuple(..))\n\n-- | The `Strong` class extends `Profunctor` with combinators for working with\n-- | product types.\n-- |\n-- | `first` and `second` lift values in a `Profunctor` to act on the first and\n-- | second components of a `Tuple`, respectively.\n-- |\n-- | Another way to think about Strong is to piggyback on the intuition of\n-- | inputs and outputs.  Rewriting the type signature in this light then yields:\n-- | ```\n-- | first ::  forall input output a. p input output -> p (Tuple input a) (Tuple output a)\n-- | second :: forall input output a. p input output -> p (Tuple a input) (Tuple a output)\n-- | ```\n-- | If we specialize the profunctor p to the function arrow, we get the following type\n-- | signatures, which may look a bit more familiar:\n-- | ```\n-- | first ::  forall input output a. (input -> output) -> (Tuple input a) -> (Tuple output a)\n-- | second :: forall input output a. (input -> output) -> (Tuple a input) -> (Tuple a output)\n-- | ```\n-- | So, when the `profunctor` is `Function` application, `first` essentially applies your function\n-- | to the first element of a `Tuple`, and `second` applies it to the second element (same as `map` would do).\nclass Profunctor p <= Strong p where\n  first :: forall a b c. p a b -> p (Tuple a c) (Tuple b c)\n  second :: forall a b c. p b c -> p (Tuple a b) (Tuple a c)\n\ninstance strongFn :: Strong (->) where\n  first a2b (Tuple a c) = Tuple (a2b a) c\n  second = (<$>)\n\n-- | Compose a value acting on a `Tuple` from two values, each acting on one of\n-- | the components of the `Tuple`.\n-- |\n-- | Specializing `(***)` to function application would look like this:\n-- | ```\n-- | (***) :: forall a b c d. (a -> b) -> (c -> d) -> (Tuple a c) -> (Tuple b d)\n-- | ```\n-- | We take two functions, `f` and `g`, and we transform them into a single function which\n-- | takes a `Tuple` and maps `f` over the first element and `g` over the second.  Just like `bi-map`\n-- | would do for the `bi-functor` instance of `Tuple`.\nsplitStrong\n  :: forall p a b c d\n   . Category p\n  => Strong p\n  => p a b\n  -> p c d\n  -> p (Tuple a c) (Tuple b d)\nsplitStrong l r = first l >>> second r\n\ninfixr 3 splitStrong as ***\n\n-- | Compose a value which introduces a `Tuple` from two values, each introducing\n-- | one side of the `Tuple`.\n-- |\n-- | This combinator is useful when assembling values from smaller components,\n-- | because it provides a way to support two different types of output.\n-- |\n-- | Specializing `(&&&)` to function application would look like this:\n-- | ```\n-- | (&&&) :: forall a b c. (a -> b) -> (a -> c) -> (a -> (Tuple b c))\n-- | ```\n-- | We take two functions, `f` and `g`, with the same parameter type and we transform them into a\n-- | single function which takes one parameter and returns a `Tuple` of the results of running\n-- | `f` and `g` on the parameter, respectively.  This allows us to run two parallel computations\n-- | on the same input and return both results in a `Tuple`.\nfanout\n  :: forall p a b c\n   . Category p\n  => Strong p\n  => p a b\n  -> p a c\n  -> p a (Tuple b c)\nfanout l r = split >>> (l *** r)\n  where\n  split :: p a (Tuple a a)\n  split = dimap identity (\\a -> Tuple a a) identity\n\ninfixr 3 fanout as &&&\n", "-- | This module defines functions for working with getters.\nmodule Data.Lens.Getter\n  ( (^.)\n  , viewOn\n  , view\n  , to\n  , takeBoth\n  , use\n  , iview\n  , iuse\n  , cloneGetter\n  , module Data.Lens.Types\n  ) where\n\nimport Prelude\n\nimport Control.Monad.State.Class (class MonadState, gets)\nimport Data.Lens.Internal.Forget (Forget(..))\nimport Data.Lens.Types (AGetter, Fold, Getter, Indexed(..), IndexedFold, IndexedGetter, Optic)\nimport Data.Newtype (unwrap)\nimport Data.Profunctor.Strong ((&&&))\nimport Data.Tuple (Tuple)\n\ninfixl 8 viewOn as ^.\n\n-- | View the focus of a `Getter`.\nview :: forall s t a b. AGetter s t a b -> s -> a\nview l = unwrap (l (Forget identity))\n\n-- | View the focus of a `Getter` and its index.\niview :: forall i s t a b. IndexedFold (Tuple i a) i s t a b -> s -> Tuple i a\niview l = unwrap (l (Indexed $ Forget identity))\n\n-- | Synonym for `view`, flipped.\nviewOn :: forall s t a b. s -> AGetter s t a b -> a\nviewOn s l = view l s\n\n-- | Convert a function into a getter.\nto :: forall s t a b. (s -> a) -> Getter s t a b\nto f p = Forget (unwrap p <<< f)\n\ncloneGetter :: forall s t a b. AGetter s t a b -> Getter s t a b\ncloneGetter g = to (view g)\n\n-- | Combine two getters.\ntakeBoth :: forall s t a b c d. AGetter s t a b -> AGetter s t c d -> Getter s t (Tuple a c) (Tuple b d)\ntakeBoth l r = to (view l &&& view r)\n\n-- | View the focus of a `Getter` in the state of a monad.\nuse :: forall s t a b m. MonadState s m => Getter s t a b -> m a\nuse p = gets (_ ^. p)\n\n-- | View the focus of a `Getter` and its index in the state of a monad.\niuse\n  :: forall i s t a b m\n   . MonadState s m\n  => IndexedFold (Tuple i a) i s t a b\n  -> m (Tuple i a)\niuse p = gets (iview p)\n", "-- | This module defines functions for working with lenses.\nmodule Data.Lens.Lens\n  ( lens\n  , lens'\n  , withLens\n  , cloneLens\n  , ilens\n  , ilens'\n  , withIndexedLens\n  , cloneIndexedLens\n  , lensStore\n  , module Data.Lens.Types\n  ) where\n\nimport Prelude\n\nimport Control.Apply (lift2)\nimport Data.Lens.Internal.Indexed (Indexed(..))\nimport Data.Lens.Internal.Shop (Shop(..))\nimport Data.Lens.Types\n  ( ALens\n  , ALens'\n  , AnIndexedLens\n  , AnIndexedLens'\n  , IndexedLens\n  , IndexedLens'\n  , Lens\n  , Lens'\n  )\nimport Data.Newtype (un)\nimport Data.Profunctor (dimap)\nimport Data.Profunctor.Strong (first)\nimport Data.Tuple (Tuple(..))\n\n-- | Create a `Lens` from a getter/setter pair.\n-- |\n-- | ```purescript\n-- | > species = lens _.species $ _ {species = _}\n-- | > view species {species : \"bovine\"}\n-- | \"bovine\"\n-- |\n-- | > _2 = lens Tuple.snd $ \\(Tuple keep _) new -> Tuple keep new\n-- | ```\n-- |\n-- | Note: `_2` is predefined in `Data.Lens.Tuple`.\n\nlens :: forall s t a b. (s -> a) -> (s -> b -> t) -> Lens s t a b\nlens get set = lens' \\s -> Tuple (get s) \\b -> set s b\n\nlens' :: forall s t a b. (s -> Tuple a (b -> t)) -> Lens s t a b\nlens' to pab = dimap to (\\(Tuple b f) -> f b) (first pab)\n\nwithLens :: forall s t a b r. ALens s t a b -> ((s -> a) -> (s -> b -> t) -> r) -> r\nwithLens l f = case l (Shop identity \\_ b -> b) of Shop x y -> f x y\n\ncloneLens :: forall s t a b. ALens s t a b -> Lens s t a b\ncloneLens l = withLens l \\x y p -> lens x y p\n\nilens'\n  :: forall i s t a b\n   . (s -> Tuple (Tuple i a) (b -> t))\n  -> IndexedLens i s t a b\nilens' to pab = dimap to (\\(Tuple b f) -> f b) (first ((un Indexed) pab))\n\n-- create an `IndexedLens` from a getter/setter pair.\nilens\n  :: forall i s t a b\n   . (s -> Tuple i a)\n  -> (s -> b -> t)\n  -> IndexedLens i s t a b\nilens get set = ilens' \\s -> Tuple (get s) \\b -> set s b\n\nwithIndexedLens\n  :: forall i s t a b r\n   . (AnIndexedLens i s t a b)\n  -> ((s -> (Tuple i a)) -> (s -> b -> t) -> r)\n  -> r\nwithIndexedLens l f = case l (Indexed (Shop identity \\_ b -> b)) of Shop x y -> f x y\n\ncloneIndexedLens :: forall i s t a b. AnIndexedLens i s t a b -> IndexedLens i s t a b\ncloneIndexedLens l = withIndexedLens l \\x y p -> ilens x y p\n\n-- | Converts a lens into the form that `lens'` accepts.\n-- |\n-- | Can be useful when defining a lens where the focus appears under multiple\n-- | constructors of an algebraic data type.  This function would be called for\n-- | each case of the data type.\n-- |\n-- | For example:\n-- |\n-- | ```\n-- | data LensStoreExample = LensStoreA Int | LensStoreB (Tuple Boolean Int)\n-- |\n-- | lensStoreExampleInt :: Lens' LensStoreExample Int\n-- | lensStoreExampleInt = lens' case _ of\n-- |   LensStoreA i -> map LensStoreA <$> lensStore identity i\n-- |   LensStoreB i -> map LensStoreB <$> lensStore _2 i\n-- | ```\nlensStore :: forall s t a b. ALens s t a b -> s -> Tuple a (b -> t)\nlensStore l = withLens l (lift2 Tuple)\n\n", "-- | This module defines functions for working with setters.\nmodule Data.Lens.Setter\n  ( (%~)\n  , over\n  , iover\n  , (.~)\n  , set\n  , (+~)\n  , addOver\n  , (-~)\n  , subOver\n  , (*~)\n  , mulOver\n  , (//~)\n  , divOver\n  , (||~)\n  , disjOver\n  , (&&~)\n  , conjOver\n  , (<>~)\n  , appendOver\n  , (?~)\n  , setJust\n  , (.=)\n  , assign\n  , (%=)\n  , modifying\n  , (+=)\n  , addModifying\n  , (*=)\n  , mulModifying\n  , (-=)\n  , subModifying\n  , (//=)\n  , divModifying\n  , (||=)\n  , disjModifying\n  , (&&=)\n  , conjModifying\n  , (<>=)\n  , appendModifying\n  , (?=)\n  , assignJust\n  , module Data.Lens.Types\n  ) where\n\nimport Prelude\n\nimport Control.Monad.State.Class (class MonadState, modify)\nimport Data.Lens.Types (Indexed(..), IndexedSetter, Setter, Setter')\nimport Data.Maybe (Maybe(..))\nimport Data.Tuple (uncurry)\n\ninfixr 4 over as %~\ninfixr 4 set as .~\ninfixr 4 addOver as +~\ninfixr 4 subOver as -~\ninfixr 4 mulOver as *~\ninfixr 4 divOver as //~\ninfixr 4 disjOver as ||~\ninfixr 4 conjOver as &&~\ninfixr 4 appendOver as <>~\ninfixr 4 setJust as ?~\n\ninfix 4 assign as .=\ninfix 4 modifying as %=\ninfix 4 addModifying as +=\ninfix 4 mulModifying as *=\ninfix 4 subModifying as -=\ninfix 4 divModifying as //=\ninfix 4 disjModifying as ||=\ninfix 4 conjModifying as &&=\ninfix 4 appendModifying as <>=\ninfix 4 assignJust as ?=\n\n-- | Apply a function to the foci of a `Setter`.\nover :: forall s t a b. Setter s t a b -> (a -> b) -> s -> t\nover l = l\n\n-- | Apply a function to the foci of a `Setter` that may vary with the index.\niover :: forall i s t a b. IndexedSetter i s t a b -> (i -> a -> b) -> s -> t\niover l f = l (Indexed $ uncurry f)\n\n-- | Set the foci of a `Setter` to a constant value.\nset :: forall s t a b. Setter s t a b -> b -> s -> t\nset l b = over l (const b)\n\naddOver :: forall s t a. Semiring a => Setter s t a a -> a -> s -> t\naddOver p = over p <<< add\n\nmulOver :: forall s t a. Semiring a => Setter s t a a -> a -> s -> t\nmulOver p = over p <<< flip mul\n\nsubOver :: forall s t a. Ring a => Setter s t a a -> a -> s -> t\nsubOver p = over p <<< flip sub\n\ndivOver :: forall s t a. EuclideanRing a => Setter s t a a -> a -> s -> t\ndivOver p = over p <<< flip div\n\ndisjOver :: forall s t a. HeytingAlgebra a => Setter s t a a -> a -> s -> t\ndisjOver p = over p <<< flip disj\n\nconjOver :: forall s t a. HeytingAlgebra a => Setter s t a a -> a -> s -> t\nconjOver p = over p <<< flip conj\n\nappendOver :: forall s t a. Semigroup a => Setter s t a a -> a -> s -> t\nappendOver p = over p <<< flip append\n\nsetJust :: forall s t a b. Setter s t a (Maybe b) -> b -> s -> t\nsetJust p = set p <<< Just\n\n-- Stateful\n\n-- | Set the foci of a `Setter` in a monadic state to a constant value.\nassign :: forall s a b m. MonadState s m => Setter s s a b -> b -> m Unit\nassign p b = void (modify (set p b))\n\n-- | Modify the foci of a `Setter` in a monadic state.\nmodifying :: forall s a b m. MonadState s m => Setter s s a b -> (a -> b) -> m Unit\nmodifying p f = void (modify (over p f))\n\naddModifying :: forall s a m. MonadState s m => Semiring a => Setter' s a -> a -> m Unit\naddModifying p = modifying p <<< add\n\nmulModifying :: forall s a m. MonadState s m => Semiring a => Setter' s a -> a -> m Unit\nmulModifying p = modifying p <<< flip mul\n\nsubModifying :: forall s a m. MonadState s m => Ring a => Setter' s a -> a -> m Unit\nsubModifying p = modifying p <<< flip sub\n\ndivModifying :: forall s a m. MonadState s m => EuclideanRing a => Setter' s a -> a -> m Unit\ndivModifying p = modifying p <<< flip div\n\ndisjModifying :: forall s a m. MonadState s m => HeytingAlgebra a => Setter' s a -> a -> m Unit\ndisjModifying p = modifying p <<< flip disj\n\nconjModifying :: forall s a m. MonadState s m => HeytingAlgebra a => Setter' s a -> a -> m Unit\nconjModifying p = modifying p <<< flip conj\n\nappendModifying :: forall s a m. MonadState s m => Semigroup a => Setter' s a -> a -> m Unit\nappendModifying p = modifying p <<< flip append\n\nassignJust :: forall s a b m. MonadState s m => Setter s s a (Maybe b) -> b -> m Unit\nassignJust p = assign p <<< Just\n", "module Effect.Aff.Class where\n\nimport Prelude\nimport Control.Monad.Cont.Trans (ContT)\nimport Control.Monad.Except.Trans (ExceptT)\nimport Control.Monad.List.Trans (ListT)\nimport Control.Monad.Maybe.Trans (MaybeT)\nimport Control.Monad.Reader.Trans (ReaderT)\nimport Control.Monad.RWS.Trans (RWST)\nimport Control.Monad.State.Trans (StateT)\nimport Control.Monad.Trans.Class (lift)\nimport Control.Monad.Writer.Trans (WriterT)\nimport Effect.Aff (Aff)\nimport Effect.Class (class MonadEffect)\n\nclass MonadEffect m <= MonadAff m where\n  liftAff :: Aff ~> m\n\ninstance monadAffAff :: MonadAff Aff where\n  liftAff = identity\n\ninstance monadAffContT :: MonadAff m => MonadAff (ContT r m) where\n  liftAff = lift <<< liftAff\n\ninstance monadAffExceptT :: MonadAff m => MonadAff (ExceptT e m) where\n  liftAff = lift <<< liftAff\n\ninstance monadAffListT :: MonadAff m => MonadAff (ListT m) where\n  liftAff = lift <<< liftAff\n\ninstance monadAffMaybe :: MonadAff m => MonadAff (MaybeT m) where\n  liftAff = lift <<< liftAff\n\ninstance monadAffReader :: MonadAff m => MonadAff (ReaderT r m) where\n  liftAff = lift <<< liftAff\n\ninstance monadAffRWS :: (MonadAff m, Monoid w) => MonadAff (RWST r w s m) where\n  liftAff = lift <<< liftAff\n\ninstance monadAffState :: MonadAff m => MonadAff (StateT s m) where\n  liftAff = lift <<< liftAff\n\ninstance monadAffWriter :: (MonadAff m, Monoid w) => MonadAff (WriterT w m) where\n  liftAff = lift <<< liftAff\n", "module Data.Exists where\n\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | This type constructor can be used to existentially quantify over a type.\n-- |\n-- | Specifically, the type `Exists f` is isomorphic to the existential type `exists a. f a`.\n-- |\n-- | Existential types can be encoded using universal types (`forall`) for endofunctors in more general\n-- | categories. The benefit of this library is that, by using the FFI, we can create an efficient\n-- | representation of the existential by simply hiding type information.\n-- |\n-- | For example, consider the type `exists s. Tuple s (s -> Tuple s a)` which represents infinite streams\n-- | of elements of type `a`.\n-- |\n-- | This type can be constructed by creating a type constructor `StreamF` as follows:\n-- |\n-- | ```purescript\n-- | data StreamF a s = StreamF s (s -> Tuple s a)\n-- | ```\n-- |\n-- | We can then define the type of streams using `Exists`:\n-- |\n-- | ```purescript\n-- | type Stream a = Exists (StreamF a)\n-- | ```\nforeign import data Exists :: forall k. (k -> Type) -> Type\n\ntype role Exists representational\n\n-- | The `mkExists` function is used to introduce a value of type `Exists f`, by providing a value of\n-- | type `f a`, for some type `a` which will be hidden in the existentially-quantified type.\n-- |\n-- | For example, to create a value of type `Stream Number`, we might use `mkExists` as follows:\n-- |\n-- | ```purescript\n-- | nats :: Stream Number\n-- | nats = mkExists $ StreamF 0 (\\n -> Tuple (n + 1) n)\n-- | ```\nmkExists :: forall f a. f a -> Exists f\nmkExists = unsafeCoerce\n\n-- | The `runExists` function is used to eliminate a value of type `Exists f`. The rank 2 type ensures\n-- | that the existentially-quantified type does not escape its scope. Since the function is required\n-- | to work for _any_ type `a`, it will work for the existentially-quantified type.\n-- |\n-- | For example, we can write a function to obtain the head of a stream by using `runExists` as follows:\n-- |\n-- | ```purescript\n-- | head :: forall a. Stream a -> a\n-- | head = runExists head'\n-- |   where\n-- |   head' :: forall s. StreamF a s -> a\n-- |   head' (StreamF s f) = snd (f s)\n-- | ```\nrunExists :: forall f r. (forall a. f a -> r) -> Exists f -> r\nrunExists = unsafeCoerce\n", "module Data.Coyoneda\n  ( Coyoneda(..)\n  , CoyonedaF\n  , coyoneda\n  , unCoyoneda\n  , liftCoyoneda\n  , lowerCoyoneda\n  , hoistCoyoneda\n  ) where\n\nimport Prelude\n\nimport Control.Alt (class Alt, alt)\nimport Control.Alternative (class Alternative, class Plus, empty)\nimport Control.Comonad (class Comonad, extract)\nimport Control.Extend (class Extend, (<<=))\nimport Control.Monad.Trans.Class (class MonadTrans)\nimport Control.MonadPlus (class MonadPlus)\nimport Data.Distributive (class Distributive, collect)\nimport Data.Eq (class Eq1, eq1)\nimport Data.Exists (Exists, runExists, mkExists)\nimport Data.Foldable (class Foldable, foldMap, foldl, foldr)\nimport Data.Functor.Invariant (class Invariant, imapF)\nimport Data.Ord (class Ord1, compare1)\nimport Data.Semigroup.Foldable (class Foldable1, foldMap1, foldr1Default, foldl1Default)\nimport Data.Semigroup.Traversable (class Traversable1, sequence1, traverse1)\nimport Data.Traversable (class Traversable, traverse)\n\n-- | `Coyoneda` is encoded as an existential type using `Data.Exists`.\n-- |\n-- | This type constructor encodes the contents of the existential package.\ndata CoyonedaF f a i = CoyonedaF (i -> a) (f i)\n\n-- | The `Coyoneda` `Functor`.\n-- |\n-- | `Coyoneda f` is a `Functor` for any type constructor `f`. In fact,\n-- | it is the _free_ `Functor` for `f`, i.e. any natural transformation\n-- | `nat :: f ~> g`, can be factor through `liftCoyoneda`.  The natural\n-- | transformation from `Coyoneda f ~> g` is given by `lowerCoyoneda <<<\n-- | hoistCoyoneda nat`:\n-- | ```purescript\n-- | lowerCoyoneda <<< hoistCoyoneda nat <<< liftCoyoneda $ fi\n-- | = lowerCoyoneda (hoistCoyoneda nat (Coyoneda $ mkExists $ CoyonedaF identity fi))    (by definition of liftCoyoneda)\n-- | = lowerCoyoneda (coyoneda identity (nat fi))                                         (by definition of hoistCoyoneda)\n-- | = unCoyoneda map (coyoneda identity (nat fi))                                        (by definition of lowerCoyoneda)\n-- | = unCoyoneda map (Coyoneda $ mkExists $ CoyonedaF  identity (nat fi))                (by definition of coyoneda)\n-- | = map identity (nat fi)                                                              (by definition of unCoyoneda)\n-- | = nat fi                                                                       (since g is a Functor)\n-- | ```\nnewtype Coyoneda f a = Coyoneda (Exists (CoyonedaF f a))\n\ninstance eqCoyoneda :: (Functor f, Eq1 f, Eq a) => Eq (Coyoneda f a) where\n  eq x y = lowerCoyoneda x `eq1` lowerCoyoneda y\n\ninstance eq1Coyoneda :: (Functor f, Eq1 f) => Eq1 (Coyoneda f) where\n  eq1 = eq\n\ninstance ordCoyoneda :: (Functor f, Ord1 f, Ord a) => Ord (Coyoneda f a) where\n  compare x y = lowerCoyoneda x `compare1` lowerCoyoneda y\n\ninstance ord1Coyoneda :: (Functor f, Ord1 f) => Ord1 (Coyoneda f) where\n  compare1 = compare\n\ninstance functorCoyoneda :: Functor (Coyoneda f) where\n  map f (Coyoneda e) = runExists (\\(CoyonedaF k fi) -> coyoneda (f <<< k) fi) e\n\ninstance invatiantCoyoneda :: Invariant (Coyoneda f) where\n  imap = imapF\n\ninstance applyCoyoneda :: Apply f => Apply (Coyoneda f) where\n  apply f g = liftCoyoneda $ lowerCoyoneda f <*> lowerCoyoneda g\n\ninstance applicativeCoyoneda :: Applicative f => Applicative (Coyoneda f) where\n  pure = liftCoyoneda <<< pure\n\ninstance altCoyoneda :: Alt f => Alt (Coyoneda f) where\n  alt x y = liftCoyoneda $ alt (lowerCoyoneda x) (lowerCoyoneda y)\n\ninstance plusCoyoneda :: Plus f => Plus (Coyoneda f) where\n  empty = liftCoyoneda empty\n\ninstance alternativeCoyoneda :: Alternative f => Alternative (Coyoneda f)\n\ninstance bindCoyoneda :: Bind f => Bind (Coyoneda f) where\n  bind (Coyoneda e) f =\n    liftCoyoneda $\n      runExists (\\(CoyonedaF k fi) -> lowerCoyoneda <<< f <<< k =<< fi) e\n\n-- | When `f` is a Monad then it is a functor as well.  In this case\n-- | `liftCoyoneda` is not only a functor isomorphism but also a monad\n-- | isomorphism, i.e. the following law holds\n-- | ```purescript\n-- | liftCoyoneda fa >>= liftCoyoneda <<< g = liftCoyoneda $ fa >>= g\n-- | ```\ninstance monadCoyoneda :: Monad f => Monad (Coyoneda f)\n\ninstance monadTransCoyoneda :: MonadTrans Coyoneda where\n  lift = liftCoyoneda\n\ninstance monadPlusCoyoneda :: MonadPlus f => MonadPlus (Coyoneda f)\n\ninstance extendCoyoneda :: Extend w => Extend (Coyoneda w) where\n  extend f (Coyoneda e) =\n    runExists (\\(CoyonedaF k fi) -> liftCoyoneda $ f <<< coyoneda k <<= fi) e\n\n-- | As in the monad case: if `w` is a comonad, then it is a functor, thus\n-- | `liftCoyoneda` is an iso of functors, but moreover it is an iso of\n-- | comonads, i.e. the following law holds:\n-- | ```purescript\n-- | g <<= liftCoyoneda w = liftCoyoneda $ g <<< liftCoyoneda <<= w\n-- | ```\ninstance comonadCoyoneda :: Comonad w => Comonad (Coyoneda w) where\n  extract (Coyoneda e) = runExists (\\(CoyonedaF k fi) -> k $ extract fi) e\n\ninstance foldableCoyoneda :: Foldable f => Foldable (Coyoneda f) where\n  foldr f z = unCoyoneda \\k -> foldr (f <<< k) z\n  foldl f z = unCoyoneda \\k -> foldl (\\x -> f x <<< k) z\n  foldMap f = unCoyoneda \\k -> foldMap (f <<< k)\n\ninstance traversableCoyoneda :: Traversable f => Traversable (Coyoneda f) where\n  traverse f = unCoyoneda \\k -> map liftCoyoneda <<< traverse (f <<< k)\n  sequence = unCoyoneda \\k -> map liftCoyoneda <<< traverse k\n\ninstance foldable1Coyoneda :: Foldable1 f => Foldable1 (Coyoneda f) where\n  foldMap1 f = unCoyoneda \\k -> foldMap1 (f <<< k)\n  foldr1 = foldr1Default\n  foldl1 = foldl1Default\n\ninstance traversable1Coyoneda :: Traversable1 f => Traversable1 (Coyoneda f) where\n  traverse1 f = unCoyoneda \\k -> map liftCoyoneda <<< traverse1 (f <<< k)\n  sequence1 = unCoyoneda \\k -> map liftCoyoneda <<< sequence1 <<< map k\n\ninstance distributiveCoyoneda :: Distributive f => Distributive (Coyoneda f) where\n  collect f = liftCoyoneda <<< collect (lowerCoyoneda <<< f)\n  distribute = liftCoyoneda <<< collect lowerCoyoneda\n\n-- | Construct a value of type `Coyoneda f b` from a mapping function and a\n-- | value of type `f a`.\ncoyoneda :: forall f a b. (a -> b) -> f a -> Coyoneda f b\ncoyoneda k fi = Coyoneda $ mkExists $ CoyonedaF k fi\n\n-- | Deconstruct a value of `Coyoneda a` to retrieve the mapping function and\n-- | original value.\nunCoyoneda :: forall f a r. (forall b. (b -> a) -> f b -> r) -> Coyoneda f a -> r\nunCoyoneda f (Coyoneda e) = runExists (\\(CoyonedaF k fi) -> f k fi) e\n\n-- | Lift a value described by the type constructor `f` to `Coyoneda f`.\n-- |\n-- | Note that for any functor `f` `liftCoyoneda` has a right inverse\n-- | `lowerCoyoneda`:\n-- | ```purescript\n-- | liftCoyoneda <<< lowerCoyoneda $ (Coyoneda e)\n-- | = liftCoyoneda <<< unCoyoneda map $ (Coyoneda e)\n-- | = liftCoyonead (runExists (\\(CoyonedaF k fi) -> map k fi) e)\n-- | = liftCoyonead (Coyoneda e)\n-- | = coyoneda identity (Coyoneda e)\n-- | = Coyoneda e\n-- | ```\n-- | Moreover if `f` is a `Functor` then `liftCoyoneda` is an isomorphism of\n-- | functors with inverse `lowerCoyoneda`:  we already showed that\n-- | `lowerCoyoneda <<< hoistCoyoneda identity = lowerCoyoneda` is its left inverse\n-- | whenever `f` is a functor.\nliftCoyoneda :: forall f. f ~> Coyoneda f\nliftCoyoneda = coyoneda identity\n\n-- | Lower a value of type `Coyoneda f a` to the `Functor` `f`.\nlowerCoyoneda :: forall f. Functor f => Coyoneda f ~> f\nlowerCoyoneda = unCoyoneda map\n\n-- | Use a natural transformation to change the generating type constructor of a\n-- | `Coyoneda`.\nhoistCoyoneda :: forall f g. (f ~> g) -> Coyoneda f ~> Coyoneda g\nhoistCoyoneda nat (Coyoneda e) =\n  runExists (\\(CoyonedaF k fi) -> coyoneda k (nat fi)) e\n", "-- | This module defines a type of maps as height-balanced (AVL) binary trees.\n-- | Efficient set operations are implemented in terms of\n-- | <https://www.cs.cmu.edu/~guyb/papers/BFS16.pdf>\n\nmodule Data.Map.Internal\n  ( Map(..)\n  , showTree\n  , empty\n  , isEmpty\n  , singleton\n  , checkValid\n  , insert\n  , insertWith\n  , lookup\n  , lookupLE\n  , lookupLT\n  , lookupGE\n  , lookupGT\n  , findMin\n  , findMax\n  , foldSubmap\n  , submap\n  , fromFoldable\n  , fromFoldableWith\n  , fromFoldableWithIndex\n  , toUnfoldable\n  , toUnfoldableUnordered\n  , delete\n  , pop\n  , member\n  , alter\n  , update\n  , keys\n  , values\n  , union\n  , unionWith\n  , unions\n  , intersection\n  , intersectionWith\n  , difference\n  , isSubmap\n  , size\n  , filterWithKey\n  , filterKeys\n  , filter\n  , mapMaybeWithKey\n  , mapMaybe\n  , catMaybes\n  , MapIter\n  , MapIterStep(..)\n  , toMapIter\n  , stepAsc\n  , stepAscCps\n  , stepDesc\n  , stepDescCps\n  , stepUnordered\n  , stepUnorderedCps\n  , unsafeNode\n  , unsafeBalancedNode\n  , unsafeJoinNodes\n  , unsafeSplit\n  , Split(..)\n  ) where\n\nimport Prelude\n\nimport Control.Alt (class Alt)\nimport Control.Plus (class Plus)\nimport Data.Eq (class Eq1)\nimport Data.Foldable (class Foldable, foldl, foldr)\nimport Data.FoldableWithIndex (class FoldableWithIndex, foldlWithIndex, foldrWithIndex)\nimport Data.Function.Uncurried (Fn2, Fn3, Fn4, Fn7, mkFn2, mkFn3, mkFn4, mkFn7, runFn2, runFn3, runFn4, runFn7)\nimport Data.FunctorWithIndex (class FunctorWithIndex)\nimport Data.List (List(..), (:))\nimport Data.Maybe (Maybe(..))\nimport Data.Ord (class Ord1, abs)\nimport Data.Traversable (traverse, class Traversable)\nimport Data.TraversableWithIndex (class TraversableWithIndex)\nimport Data.Tuple (Tuple(Tuple))\nimport Data.Unfoldable (class Unfoldable, unfoldr)\nimport Prim.TypeError (class Warn, Text)\n\n-- | `Map k v` represents maps from keys of type `k` to values of type `v`.\ndata Map k v = Leaf | Node Int Int k v (Map k v) (Map k v)\n\ntype role Map nominal representational\n\ninstance eq1Map :: Eq k => Eq1 (Map k) where\n  eq1 = eq\n\ninstance eqMap :: (Eq k, Eq v) => Eq (Map k v) where\n  eq xs ys = case xs of\n    Leaf ->\n      case ys of\n        Leaf -> true\n        _ -> false\n    Node _ s1 _ _ _ _ ->\n      case ys of\n        Node _ s2 _ _ _ _\n          | s1 == s2 ->\n              toMapIter xs == toMapIter ys\n        _ ->\n          false\n\ninstance ord1Map :: Ord k => Ord1 (Map k) where\n  compare1 = compare\n\ninstance ordMap :: (Ord k, Ord v) => Ord (Map k v) where\n  compare xs ys = case xs of\n    Leaf ->\n      case ys of\n        Leaf -> EQ\n        _ -> LT\n    _ ->\n      case ys of\n        Leaf -> GT\n        _ -> compare (toMapIter xs) (toMapIter ys)\n\ninstance showMap :: (Show k, Show v) => Show (Map k v) where\n  show as = \"(fromFoldable \" <> show (toUnfoldable as :: Array _) <> \")\"\n\ninstance semigroupMap ::\n  ( Warn (Text \"Data.Map's `Semigroup` instance is now unbiased and differs from the left-biased instance defined in PureScript releases <= 0.13.x.\")\n  , Ord k\n  , Semigroup v\n  ) => Semigroup (Map k v) where\n  append = unionWith append\n\ninstance monoidSemigroupMap ::\n  ( Warn (Text \"Data.Map's `Semigroup` instance is now unbiased and differs from the left-biased instance defined in PureScript releases <= 0.13.x.\")\n  , Ord k\n  , Semigroup v\n  ) => Monoid (Map k v) where\n  mempty = empty\n\ninstance altMap :: Ord k => Alt (Map k) where\n  alt = union\n\ninstance plusMap :: Ord k => Plus (Map k) where\n  empty = empty\n\ninstance functorMap :: Functor (Map k) where\n  map f = go\n    where\n    go = case _ of\n      Leaf -> Leaf\n      Node h s k v l r ->\n        Node h s k (f v) (go l) (go r)\n\ninstance functorWithIndexMap :: FunctorWithIndex k (Map k) where\n  mapWithIndex f = go\n    where\n    go = case _ of\n      Leaf -> Leaf\n      Node h s k v l r ->\n        Node h s k (f k v) (go l) (go r)\n\ninstance applyMap :: Ord k => Apply (Map k) where\n  apply = intersectionWith identity\n\ninstance bindMap :: Ord k => Bind (Map k) where\n  bind m f = mapMaybeWithKey (\\k -> lookup k <<< f) m\n\ninstance foldableMap :: Foldable (Map k) where\n  foldr f z = \\m -> runFn2 go m z\n    where\n    go = mkFn2 \\m' z' -> case m' of\n      Leaf -> z'\n      Node _ _ _ v l r ->\n        runFn2 go l (f v (runFn2 go r z'))\n  foldl f z = \\m -> runFn2 go z m\n    where\n    go = mkFn2 \\z' m' -> case m' of\n      Leaf -> z'\n      Node _ _ _ v l r ->\n        runFn2 go (f (runFn2 go z' l) v) r\n  foldMap f = go\n    where\n    go = case _ of\n      Leaf -> mempty\n      Node _ _ _ v l r ->\n        go l <> f v <> go r\n\ninstance foldableWithIndexMap :: FoldableWithIndex k (Map k) where\n  foldrWithIndex f z = \\m -> runFn2 go m z\n    where\n    go = mkFn2 \\m' z' -> case m' of\n      Leaf -> z'\n      Node _ _ k v l r ->\n        runFn2 go l (f k v (runFn2 go r z'))\n  foldlWithIndex f z = \\m -> runFn2 go z m\n    where\n    go = mkFn2 \\z' m' -> case m' of\n      Leaf -> z'\n      Node _ _ k v l r ->\n        runFn2 go (f k (runFn2 go z' l) v) r\n  foldMapWithIndex f = go\n    where\n    go = case _ of\n      Leaf -> mempty\n      Node _ _ k v l r ->\n        go l <> f k v <> go r\n\ninstance traversableMap :: Traversable (Map k) where\n  traverse f = go\n    where\n    go = case _ of\n      Leaf -> pure Leaf\n      Node h s k v l r ->\n        (\\l' v' r' -> Node h s k v' l' r')\n          <$> go l\n          <*> f v\n          <*> go r\n  sequence = traverse identity\n\ninstance traversableWithIndexMap :: TraversableWithIndex k (Map k) where\n  traverseWithIndex f = go\n    where\n    go = case _ of\n      Leaf -> pure Leaf\n      Node h s k v l r ->\n        (\\l' v' r' -> Node h s k v' l' r')\n          <$> go l\n          <*> f k v\n          <*> go r\n\n-- | Render a `Map` as a `String`\nshowTree :: forall k v. Show k => Show v => Map k v -> String\nshowTree = go \"\"\n  where\n  go ind = case _ of\n    Leaf -> ind <> \"Leaf\"\n    Node h _ k v l r ->\n      (ind <> \"[\" <> show h  <> \"] \" <> show k <> \" => \" <> show v <> \"\\n\")\n        <> (go (ind <> \"    \") l <> \"\\n\")\n        <> (go (ind <> \"    \") r)\n\n-- | An empty map\nempty :: forall k v. Map k v\nempty = Leaf\n\n-- | Test if a map is empty\nisEmpty :: forall k v. Map k v -> Boolean\nisEmpty Leaf = true\nisEmpty _ = false\n\n-- | Create a map with one key/value pair\nsingleton :: forall k v. k -> v -> Map k v\nsingleton k v = Node 1 1 k v Leaf Leaf\n\n-- | Check whether the underlying tree satisfies the height, size, and ordering invariants.\n-- |\n-- | This function is provided for internal use.\ncheckValid :: forall k v. Ord k => Map k v -> Boolean\ncheckValid = go\n  where\n  go = case _ of\n    Leaf -> true\n    Node h s k _ l r ->\n      case l of\n        Leaf ->\n          case r of\n            Leaf ->\n              true\n            Node rh rs rk _ _ _ ->\n              h == 2 && rh == 1 && s > rs && rk > k && go r\n        Node lh ls lk _ _ _ ->\n          case r of\n            Leaf ->\n              h == 2 && lh == 1 && s > ls && lk < k && go l\n            Node rh rs rk _ _ _ ->\n              h > rh && rk > k && h > lh && lk < k && abs (rh - lh) < 2 && rs + ls + 1 == s && go l && go r\n\n-- | Look up a value for the specified key\nlookup :: forall k v. Ord k => k -> Map k v -> Maybe v\nlookup k = go\n  where\n  go = case _ of\n    Leaf -> Nothing\n    Node _ _ mk mv ml mr ->\n      case compare k mk of\n        LT -> go ml\n        GT -> go mr\n        EQ -> Just mv\n\n-- | Look up a value for the specified key, or the greatest one less than it\nlookupLE :: forall k v. Ord k => k -> Map k v -> Maybe { key :: k, value :: v }\nlookupLE k = go\n  where\n  go = case _ of\n    Leaf -> Nothing\n    Node _ _ mk mv ml mr ->\n      case compare k mk of\n        LT -> go ml\n        GT ->\n          case go mr of\n            Nothing -> Just { key: mk, value: mv }\n            other -> other\n        EQ ->\n          Just { key: mk, value: mv }\n\n-- | Look up a value for the greatest key less than the specified key\nlookupLT :: forall k v. Ord k => k -> Map k v -> Maybe { key :: k, value :: v }\nlookupLT k = go\n  where\n  go = case _ of\n    Leaf -> Nothing\n    Node _ _ mk mv ml mr ->\n      case compare k mk of\n        LT -> go ml\n        GT ->\n          case go mr of\n            Nothing -> Just { key: mk, value: mv }\n            other -> other\n        EQ ->\n          findMax ml\n\n-- | Look up a value for the specified key, or the least one greater than it\nlookupGE :: forall k v. Ord k => k -> Map k v -> Maybe { key :: k, value :: v }\nlookupGE k = go\n  where\n  go = case _ of\n    Leaf -> Nothing\n    Node _ _ mk mv ml mr ->\n      case compare k mk of\n        LT ->\n          case go ml of\n            Nothing -> Just { key: mk, value: mv }\n            other -> other\n        GT -> go mr\n        EQ -> Just { key: mk, value: mv }\n\n-- | Look up a value for the least key greater than the specified key\nlookupGT :: forall k v. Ord k => k -> Map k v -> Maybe { key :: k, value :: v }\nlookupGT k = go\n  where\n  go = case _ of\n    Leaf -> Nothing\n    Node _ _ mk mv ml mr ->\n      case compare k mk of\n        LT ->\n          case go ml of\n            Nothing -> Just { key: mk, value: mv }\n            other -> other\n        GT -> go mr\n        EQ -> findMin mr\n\n-- | Returns the pair with the greatest key\nfindMax :: forall k v. Map k v -> Maybe { key :: k, value :: v }\nfindMax = case _ of\n  Leaf -> Nothing\n  Node _ _ k v  _ r ->\n    case r of\n      Leaf -> Just { key: k, value: v }\n      _ -> findMax r\n\n-- | Returns the pair with the least key\nfindMin :: forall k v. Map k v -> Maybe { key :: k, value :: v }\nfindMin = case _ of\n  Leaf -> Nothing\n  Node _ _ k v l _ ->\n    case l of\n      Leaf -> Just { key: k, value: v }\n      _ -> findMin l\n\n-- | Fold over the entries of a given map where the key is between a lower and\n-- | an upper bound. Passing `Nothing` as either the lower or upper bound\n-- | argument means that the fold has no lower or upper bound, i.e. the fold\n-- | starts from (or ends with) the smallest (or largest) key in the map.\n-- |\n-- | ```purescript\n-- | foldSubmap (Just 1) (Just 2) (\\_ v -> [v])\n-- |  (fromFoldable [Tuple 0 \"zero\", Tuple 1 \"one\", Tuple 2 \"two\", Tuple 3 \"three\"])\n-- |  == [\"one\", \"two\"]\n-- |\n-- | foldSubmap Nothing (Just 2) (\\_ v -> [v])\n-- |  (fromFoldable [Tuple 0 \"zero\", Tuple 1 \"one\", Tuple 2 \"two\", Tuple 3 \"three\"])\n-- |  == [\"zero\", \"one\", \"two\"]\n-- | ```\nfoldSubmap :: forall k v m. Ord k => Monoid m => Maybe k -> Maybe k -> (k -> v -> m) -> Map k v -> m\nfoldSubmap = foldSubmapBy (<>) mempty\n\nfoldSubmapBy :: forall k v m. Ord k => (m -> m -> m) -> m -> Maybe k -> Maybe k -> (k -> v -> m) -> Map k v -> m\nfoldSubmapBy appendFn memptyValue kmin kmax f =\n  let\n    tooSmall =\n      case kmin of\n        Just kmin' ->\n          \\k -> k < kmin'\n        Nothing ->\n          const false\n\n    tooLarge =\n      case kmax of\n        Just kmax' ->\n          \\k -> k > kmax'\n        Nothing ->\n          const false\n\n    inBounds =\n      case kmin, kmax of\n        Just kmin', Just kmax' ->\n          \\k -> kmin' <= k && k <= kmax'\n        Just kmin', Nothing ->\n          \\k -> kmin' <= k\n        Nothing, Just kmax' ->\n          \\k -> k <= kmax'\n        Nothing, Nothing ->\n          const true\n\n    go = case _ of\n      Leaf ->\n        memptyValue\n      Node _ _ k v left right ->\n                    (if tooSmall k then memptyValue else go left)\n        `appendFn` (if inBounds k then f k v else memptyValue)\n        `appendFn` (if tooLarge k then memptyValue else go right)\n  in\n    go\n\n-- | Returns a new map containing all entries of the given map which lie\n-- | between a given lower and upper bound, treating `Nothing` as no bound i.e.\n-- | including the smallest (or largest) key in the map, no matter how small\n-- | (or large) it is. For example:\n-- |\n-- | ```purescript\n-- | submap (Just 1) (Just 2)\n-- |   (fromFoldable [Tuple 0 \"zero\", Tuple 1 \"one\", Tuple 2 \"two\", Tuple 3 \"three\"])\n-- |   == fromFoldable [Tuple 1 \"one\", Tuple 2 \"two\"]\n-- |\n-- | submap Nothing (Just 2)\n-- |   (fromFoldable [Tuple 0 \"zero\", Tuple 1 \"one\", Tuple 2 \"two\", Tuple 3 \"three\"])\n-- |   == fromFoldable [Tuple 0 \"zero\", Tuple 1 \"one\", Tuple 2 \"two\"]\n-- | ```\n-- |\n-- | The function is entirely specified by the following\n-- | property:\n-- |\n-- | ```purescript\n-- | Given any m :: Map k v, mmin :: Maybe k, mmax :: Maybe k, key :: k,\n-- |   let m' = submap mmin mmax m in\n-- |     if (maybe true (\\min -> min <= key) mmin &&\n-- |         maybe true (\\max -> max >= key) mmax)\n-- |       then lookup key m == lookup key m'\n-- |       else not (member key m')\n-- | ```\nsubmap :: forall k v. Ord k => Maybe k -> Maybe k -> Map k v -> Map k v\nsubmap kmin kmax = foldSubmapBy union empty kmin kmax singleton\n\n-- | Test if a key is a member of a map\nmember :: forall k v. Ord k => k -> Map k v -> Boolean\nmember k = go\n  where\n  go = case _ of\n    Leaf -> false\n    Node _ _ mk _ ml mr ->\n      case compare k mk of\n        LT -> go ml\n        GT -> go mr\n        EQ -> true\n\n-- | Insert or replace a key/value pair in a map\ninsert :: forall k v. Ord k => k -> v -> Map k v -> Map k v\ninsert k v = go\n  where\n  go = case _ of\n    Leaf -> singleton k v\n    Node mh ms mk mv ml mr ->\n      case compare k mk of\n        LT -> runFn4 unsafeBalancedNode mk mv (go ml) mr\n        GT -> runFn4 unsafeBalancedNode mk mv ml (go mr)\n        EQ -> Node mh ms k v ml mr\n\n-- | Inserts or updates a value with the given function.\n-- |\n-- | The combining function is called with the existing value as the first\n-- | argument and the new value as the second argument.\ninsertWith :: forall k v. Ord k => (v -> v -> v) -> k -> v -> Map k v -> Map k v\ninsertWith app k v = go\n  where\n  go = case _ of\n    Leaf -> singleton k v\n    Node mh ms mk mv ml mr ->\n      case compare k mk of\n        LT -> runFn4 unsafeBalancedNode mk mv (go ml) mr\n        GT -> runFn4 unsafeBalancedNode mk mv ml (go mr)\n        EQ -> Node mh ms k (app mv v) ml mr\n\n-- | Delete a key and its corresponding value from a map.\ndelete :: forall k v. Ord k => k -> Map k v -> Map k v\ndelete k = go\n  where\n  go = case _ of\n    Leaf -> Leaf\n    Node _ _ mk mv ml mr ->\n      case compare k mk of\n        LT -> runFn4 unsafeBalancedNode mk mv (go ml) mr\n        GT -> runFn4 unsafeBalancedNode mk mv ml (go mr)\n        EQ -> runFn2 unsafeJoinNodes ml mr\n\n-- | Delete a key and its corresponding value from a map, returning the value\n-- | as well as the subsequent map.\npop :: forall k v. Ord k => k -> Map k v -> Maybe (Tuple v (Map k v))\npop k m = do\n  let (Split x l r) = runFn3 unsafeSplit compare k m\n  map (\\a -> Tuple a (runFn2 unsafeJoinNodes l r)) x\n\n-- | Insert the value, delete a value, or update a value for a key in a map\nalter :: forall k v. Ord k => (Maybe v -> Maybe v) -> k -> Map k v -> Map k v\nalter f k m = do\n  let Split v l r = runFn3 unsafeSplit compare k m\n  case f v of\n    Nothing ->\n      runFn2 unsafeJoinNodes l r\n    Just v' ->\n      runFn4 unsafeBalancedNode k v' l r\n\n-- | Update or delete the value for a key in a map\nupdate :: forall k v. Ord k => (v -> Maybe v) -> k -> Map k v -> Map k v\nupdate f k = go\n  where\n  go = case _ of\n    Leaf -> Leaf\n    Node mh ms mk mv ml mr ->\n      case compare k mk of\n        LT -> runFn4 unsafeBalancedNode mk mv (go ml) mr\n        GT -> runFn4 unsafeBalancedNode mk mv ml (go mr)\n        EQ ->\n          case f mv of\n            Nothing ->\n              runFn2 unsafeJoinNodes ml mr\n            Just mv' ->\n              Node mh ms mk mv' ml mr\n\n-- | Convert any foldable collection of key/value pairs to a map.\n-- | On key collision, later values take precedence over earlier ones.\nfromFoldable :: forall f k v. Ord k => Foldable f => f (Tuple k v) -> Map k v\nfromFoldable = foldl (\\m (Tuple k v) -> insert k v m) empty\n\n-- | Convert any foldable collection of key/value pairs to a map.\n-- | On key collision, the values are configurably combined.\nfromFoldableWith :: forall f k v. Ord k => Foldable f => (v -> v -> v) -> f (Tuple k v) -> Map k v\nfromFoldableWith f = foldl (\\m (Tuple k v) -> f' k v m) empty\n  where\n  f' = insertWith (flip f)\n\n-- | Convert any indexed foldable collection into a map.\nfromFoldableWithIndex :: forall f k v. Ord k => FoldableWithIndex k f => f v -> Map k v\nfromFoldableWithIndex = foldlWithIndex (\\k m v -> insert k v m) empty\n\n-- | Convert a map to an unfoldable structure of key/value pairs where the keys are in ascending order\ntoUnfoldable :: forall f k v. Unfoldable f => Map k v -> f (Tuple k v)\ntoUnfoldable = unfoldr stepUnfoldr <<< toMapIter\n\n-- | Convert a map to an unfoldable structure of key/value pairs\n-- |\n-- | While this traversal is up to 10% faster in benchmarks than `toUnfoldable`,\n-- | it leaks the underlying map stucture, making it only suitable for applications\n-- | where order is irrelevant.\n-- |\n-- | If you are unsure, use `toUnfoldable`\ntoUnfoldableUnordered :: forall f k v. Unfoldable f => Map k v -> f (Tuple k v)\ntoUnfoldableUnordered = unfoldr stepUnfoldrUnordered <<< toMapIter\n\n-- | Get a list of the keys contained in a map\nkeys :: forall k v. Map k v -> List k\nkeys = foldrWithIndex (\\k _ acc -> k : acc) Nil\n\n-- | Get a list of the values contained in a map\nvalues :: forall k v. Map k v -> List v\nvalues = foldr Cons Nil\n\n-- | Compute the union of two maps, using the specified function\n-- | to combine values for duplicate keys.\nunionWith :: forall k v. Ord k => (v -> v -> v) -> Map k v -> Map k v -> Map k v\nunionWith app m1 m2 = runFn4 unsafeUnionWith compare app m1 m2\n\n-- | Compute the union of two maps, preferring values from the first map in the case\n-- | of duplicate keys\nunion :: forall k v. Ord k => Map k v -> Map k v -> Map k v\nunion = unionWith const\n\n-- | Compute the union of a collection of maps\nunions :: forall k v f. Ord k => Foldable f => f (Map k v) -> Map k v\nunions = foldl union empty\n\n-- | Compute the intersection of two maps, using the specified function\n-- | to combine values for duplicate keys.\nintersectionWith :: forall k a b c. Ord k => (a -> b -> c) -> Map k a -> Map k b -> Map k c\nintersectionWith app m1 m2 = runFn4 unsafeIntersectionWith compare app m1 m2\n\n-- | Compute the intersection of two maps, preferring values from the first map in the case\n-- | of duplicate keys.\nintersection :: forall k a b. Ord k => Map k a -> Map k b -> Map k a\nintersection = intersectionWith const\n\n-- | Difference of two maps. Return elements of the first map where\n-- | the keys do not exist in the second map.\ndifference :: forall k v w. Ord k => Map k v -> Map k w -> Map k v\ndifference m1 m2 = runFn3 unsafeDifference compare m1 m2\n\n-- | Test whether one map contains all of the keys and values contained in another map\nisSubmap :: forall k v. Ord k => Eq v => Map k v -> Map k v -> Boolean\nisSubmap = go\n  where\n  go m1 m2 = case m1 of\n    Leaf -> true\n    Node _ _ k v l r ->\n      case lookup k m2 of\n        Nothing -> false\n        Just v' ->\n          v == v' && go l m2 && go r m2\n\n-- | Calculate the number of key/value pairs in a map\nsize :: forall k v. Map k v -> Int\nsize = case _ of\n  Leaf -> 0\n  Node _ s _ _ _ _ -> s\n\n-- | Filter out those key/value pairs of a map for which a predicate\n-- | fails to hold.\nfilterWithKey :: forall k v. Ord k => (k -> v -> Boolean) -> Map k v -> Map k v\nfilterWithKey f = go\n  where\n  go = case _ of\n    Leaf -> Leaf\n    Node _ _ k v l r\n      | f k v ->\n          runFn4 unsafeBalancedNode k v (go l) (go r)\n      | otherwise ->\n          runFn2 unsafeJoinNodes (go l) (go r)\n\n-- | Filter out those key/value pairs of a map for which a predicate\n-- | on the key fails to hold.\nfilterKeys :: forall k. Ord k => (k -> Boolean) -> Map k ~> Map k\nfilterKeys f = go\n  where\n  go = case _ of\n    Leaf -> Leaf\n    Node _ _ k v l r\n      | f k ->\n          runFn4 unsafeBalancedNode k v (go l) (go r)\n      | otherwise ->\n          runFn2 unsafeJoinNodes (go l) (go r)\n\n-- | Filter out those key/value pairs of a map for which a predicate\n-- | on the value fails to hold.\nfilter :: forall k v. Ord k => (v -> Boolean) -> Map k v -> Map k v\nfilter = filterWithKey <<< const\n\n-- | Applies a function to each key/value pair in a map, discarding entries\n-- | where the function returns `Nothing`.\nmapMaybeWithKey :: forall k a b. Ord k => (k -> a -> Maybe b) -> Map k a -> Map k b\nmapMaybeWithKey f = go\n  where\n  go = case _ of\n    Leaf -> Leaf\n    Node _ _ k v l r ->\n      case f k v of\n        Just v' ->\n          runFn4 unsafeBalancedNode k v' (go l) (go r)\n        Nothing ->\n          runFn2 unsafeJoinNodes (go l) (go r)\n\n-- | Applies a function to each value in a map, discarding entries where the\n-- | function returns `Nothing`.\nmapMaybe :: forall k a b. Ord k => (a -> Maybe b) -> Map k a -> Map k b\nmapMaybe = mapMaybeWithKey <<< const\n\n-- | Filter a map of optional values, keeping only the key/value pairs which\n-- | contain a value, creating a new map.\ncatMaybes :: forall k v. Ord k => Map k (Maybe v) -> Map k v\ncatMaybes = mapMaybe identity\n\n-- | Low-level Node constructor which maintains the height and size invariants\n-- | This is unsafe because it assumes the child Maps are ordered and balanced.\nunsafeNode :: forall k v. Fn4 k v (Map k v) (Map k v) (Map k v)\nunsafeNode = mkFn4 \\k v l r -> case l of\n  Leaf ->\n    case r of\n      Leaf ->\n        Node 1 1 k v l r\n      Node h2 s2 _ _ _ _ ->\n        Node (1 + h2) (1 + s2) k v l r\n  Node h1 s1 _ _ _ _ ->\n    case r of\n      Leaf ->\n        Node (1 + h1) (1 + s1) k v l r\n      Node h2 s2 _ _ _ _ ->\n        Node (1 + if h1 > h2 then h1 else h2) (1 + s1 + s2) k v l r\n\n-- | Low-level Node constructor which maintains the balance invariants.\n-- | This is unsafe because it assumes the child Maps are ordered.\nunsafeBalancedNode :: forall k v. Fn4 k v (Map k v) (Map k v) (Map k v)\nunsafeBalancedNode = mkFn4 \\k v l r -> case l of\n  Leaf ->\n    case r of\n      Leaf ->\n        singleton k v\n      Node rh _ rk rv rl rr\n        | rh > 1 ->\n            runFn7 rotateLeft k v l rk rv rl rr\n      _ ->\n        runFn4 unsafeNode k v l r\n  Node lh _ lk lv ll lr ->\n    case r of\n      Node rh _ rk rv rl rr\n        | rh > lh + 1 ->\n            runFn7 rotateLeft k v l rk rv rl rr\n        | lh > rh + 1 ->\n            runFn7 rotateRight k v lk lv ll lr r\n      Leaf\n        | lh > 1 ->\n            runFn7 rotateRight k v lk lv ll lr r\n      _ ->\n        runFn4 unsafeNode k v l r\n  where\n  rotateLeft :: Fn7 k v (Map k v) k v (Map k v) (Map k v) (Map k v)\n  rotateLeft = mkFn7 \\k v l rk rv rl rr -> case rl of\n    Node lh _ lk lv ll lr\n      | lh > height rr ->\n          runFn4 unsafeNode lk lv (runFn4 unsafeNode k v l ll) (runFn4 unsafeNode rk rv lr rr)\n    _ ->\n      runFn4 unsafeNode rk rv (runFn4 unsafeNode k v l rl) rr\n\n  rotateRight :: Fn7 k v k v (Map k v) (Map k v) (Map k v) (Map k v)\n  rotateRight = mkFn7 \\k v lk lv ll lr r -> case lr of\n    Node rh _ rk rv rl rr\n      | height ll <= rh ->\n          runFn4 unsafeNode rk rv (runFn4 unsafeNode lk lv ll rl) (runFn4 unsafeNode k v rr r)\n    _ ->\n      runFn4 unsafeNode lk lv ll (runFn4 unsafeNode k v lr r)\n\n  height :: Map k v -> Int\n  height = case _ of\n    Leaf -> 0\n    Node h _ _ _ _ _ -> h\n\n-- | Low-level Node constructor from two Maps.\n-- | This is unsafe because it assumes the child Maps are ordered.\nunsafeJoinNodes :: forall k v. Fn2 (Map k v) (Map k v) (Map k v)\nunsafeJoinNodes = mkFn2 case _, _ of\n  Leaf, b -> b\n  Node _ _ lk lv ll lr, r -> do\n    let (SplitLast k v l) = runFn4 unsafeSplitLast lk lv ll lr\n    runFn4 unsafeBalancedNode k v l r\n\ndata SplitLast k v = SplitLast k v (Map k v)\n\n-- | Reassociates a node by moving the last node to the top.\n-- | This is unsafe because it assumes the key and child Maps are from\n-- | a balanced node.\nunsafeSplitLast :: forall k v. Fn4 k v (Map k v) (Map k v) (SplitLast k v)\nunsafeSplitLast = mkFn4 \\k v l r -> case r of\n  Leaf -> SplitLast k v l\n  Node _ _ rk rv rl rr -> do\n    let (SplitLast k' v' t') = runFn4 unsafeSplitLast rk rv rl rr\n    SplitLast k' v' (runFn4 unsafeBalancedNode k v l t')\n\ndata Split k v = Split (Maybe v) (Map k v) (Map k v)\n\n-- | Reassocates a Map so the given key is at the top.\n-- | This is unsafe because it assumes the ordering function is appropriate.\nunsafeSplit :: forall k v. Fn3 (k -> k -> Ordering) k (Map k v) (Split k v)\nunsafeSplit = mkFn3 \\comp k m -> case m of\n  Leaf ->\n    Split Nothing Leaf Leaf\n  Node _ _ mk mv ml mr ->\n    case comp k mk of\n      LT -> do\n        let (Split b ll lr) = runFn3 unsafeSplit comp k ml\n        Split b ll (runFn4 unsafeBalancedNode mk mv lr mr)\n      GT -> do\n        let (Split b rl rr) = runFn3 unsafeSplit comp k mr\n        Split b (runFn4 unsafeBalancedNode mk mv ml rl) rr\n      EQ ->\n        Split (Just mv) ml mr\n\n-- | Low-level unionWith implementation.\n-- | This is unsafe because it assumes the ordering function is appropriate.\nunsafeUnionWith :: forall k v. Fn4 (k -> k -> Ordering) (v -> v -> v) (Map k v) (Map k v) (Map k v)\nunsafeUnionWith = mkFn4 \\comp app l r -> case l, r of\n  Leaf, _ -> r\n  _, Leaf -> l\n  _, Node _ _ rk rv rl rr -> do\n    let (Split lv ll lr) = runFn3 unsafeSplit comp rk l\n    let l' = runFn4 unsafeUnionWith comp app ll rl\n    let r' = runFn4 unsafeUnionWith comp app lr rr\n    case lv of\n      Just lv' ->\n        runFn4 unsafeBalancedNode rk (app lv' rv) l' r'\n      Nothing ->\n        runFn4 unsafeBalancedNode rk rv l' r'\n\n-- | Low-level intersectionWith implementation.\n-- | This is unsafe because it assumes the ordering function is appropriate.\nunsafeIntersectionWith :: forall k a b c. Fn4 (k -> k -> Ordering) (a -> b -> c) (Map k a) (Map k b) (Map k c)\nunsafeIntersectionWith = mkFn4 \\comp app l r -> case l, r of\n  Leaf, _ -> Leaf\n  _, Leaf -> Leaf\n  _, Node _ _ rk rv rl rr -> do\n    let (Split lv ll lr) = runFn3 unsafeSplit comp rk l\n    let l' = runFn4 unsafeIntersectionWith comp app ll rl\n    let r' = runFn4 unsafeIntersectionWith comp app lr rr\n    case lv of\n      Just lv' ->\n        runFn4 unsafeBalancedNode rk (app lv' rv) l' r'\n      Nothing ->\n        runFn2 unsafeJoinNodes l' r'\n\n-- | Low-level difference implementation.\n-- | This is unsafe because it assumes the ordering function is appropriate.\nunsafeDifference :: forall k v w. Fn3 (k -> k -> Ordering) (Map k v) (Map k w) (Map k v)\nunsafeDifference = mkFn3 \\comp l r -> case l, r of\n  Leaf, _ -> Leaf\n  _, Leaf -> l\n  _, Node _ _ rk _ rl rr -> do\n    let (Split _ ll lr) = runFn3 unsafeSplit comp rk l\n    let l' = runFn3 unsafeDifference comp ll rl\n    let r' = runFn3 unsafeDifference comp lr rr\n    runFn2 unsafeJoinNodes l' r'\n\ndata MapIterStep k v\n  = IterDone\n  | IterNext k v (MapIter k v)\n\n-- | Low-level iteration state for a `Map`. Must be consumed using\n-- | an appropriate stepper.\ndata MapIter k v\n  = IterLeaf\n  | IterEmit k v (MapIter k v)\n  | IterNode (Map k v) (MapIter k v)\n\ninstance (Eq k, Eq v) => Eq (MapIter k v) where\n  eq = go\n    where\n    go a b = case stepAsc a of\n      IterNext k1 v1 a' ->\n        case stepAsc b of\n          IterNext k2 v2 b'\n            | k1 == k2 && v1 == v2 ->\n                go a' b'\n          _ ->\n            false\n      IterDone ->\n        true\n\ninstance (Ord k, Ord v) => Ord (MapIter k v) where\n  compare = go\n    where\n    go a b = case stepAsc a, stepAsc b of\n      IterNext k1 v1 a', IterNext k2 v2 b' ->\n        case compare k1 k2 of\n          EQ ->\n            case compare v1 v2 of\n              EQ ->\n                go a' b'\n              other ->\n                other\n          other ->\n            other\n      IterDone, b'->\n        case b' of\n          IterDone ->\n            EQ\n          _ ->\n            LT\n      _, IterDone ->\n        GT\n\n-- | Converts a Map to a MapIter for iteration using a MapStepper.\ntoMapIter :: forall k v. Map k v -> MapIter k v\ntoMapIter = flip IterNode IterLeaf\n\ntype MapStepper k v = MapIter k v -> MapIterStep k v\n\ntype MapStepperCps k v = forall r. (Fn3 k v (MapIter k v) r) -> (Unit -> r) -> MapIter k v -> r\n\n-- | Steps a `MapIter` in ascending order.\nstepAsc :: forall k v. MapStepper k v\nstepAsc = stepAscCps (mkFn3 \\k v next -> IterNext k v next) (const IterDone)\n\n-- | Steps a `MapIter` in descending order.\nstepDesc :: forall k v. MapStepper k v\nstepDesc = stepDescCps (mkFn3 \\k v next -> IterNext k v next) (const IterDone)\n\n-- | Steps a `MapIter` in arbitrary order.\nstepUnordered :: forall k v. MapStepper k v\nstepUnordered = stepUnorderedCps (mkFn3 \\k v next -> IterNext k v next) (const IterDone)\n\n-- | Steps a `MapIter` in ascending order with a CPS encoding.\nstepAscCps :: forall k v. MapStepperCps k v\nstepAscCps = stepWith iterMapL\n\n-- | Steps a `MapIter` in descending order with a CPS encoding.\nstepDescCps :: forall k v. MapStepperCps k v\nstepDescCps = stepWith iterMapR\n\n-- | Steps a `MapIter` in arbitrary order with a CPS encoding.\nstepUnorderedCps :: forall k v. MapStepperCps k v\nstepUnorderedCps = stepWith iterMapU\n\nstepUnfoldr :: forall k v. MapIter k v -> Maybe (Tuple (Tuple k v) (MapIter k v))\nstepUnfoldr = stepAscCps step (\\_ -> Nothing)\n  where\n  step = mkFn3 \\k v next ->\n    Just (Tuple (Tuple k v) next)\n\nstepUnfoldrUnordered :: forall k v. MapIter k v -> Maybe (Tuple (Tuple k v) (MapIter k v))\nstepUnfoldrUnordered = stepUnorderedCps step (\\_ -> Nothing)\n  where\n  step = mkFn3 \\k v next ->\n    Just (Tuple (Tuple k v) next)\n\nstepWith :: forall k v r. (MapIter k v -> Map k v -> MapIter k v) -> (Fn3 k v (MapIter k v) r) -> (Unit -> r) -> MapIter k v -> r\nstepWith f next done = go\n  where\n  go = case _ of\n    IterLeaf ->\n      done unit\n    IterEmit k v iter ->\n      runFn3 next k v iter\n    IterNode m iter ->\n      go (f iter m)\n\niterMapL :: forall k v. MapIter k v -> Map k v -> MapIter k v\niterMapL = go\n  where\n  go iter = case _ of\n    Leaf -> iter\n    Node _ _ k v l r ->\n      case r of\n        Leaf ->\n          go (IterEmit k v iter) l\n        _ ->\n          go (IterEmit k v (IterNode r iter)) l\n\niterMapR :: forall k v. MapIter k v -> Map k v -> MapIter k v\niterMapR = go\n  where\n  go iter = case _ of\n    Leaf -> iter\n    Node _ _ k v l r ->\n      case r of\n        Leaf ->\n          go (IterEmit k v iter) l\n        _ ->\n          go (IterEmit k v (IterNode l iter)) r\n\niterMapU :: forall k v. MapIter k v -> Map k v -> MapIter k v\niterMapU iter = case _ of\n  Leaf -> iter\n  Node _ _ k v l r ->\n    case l of\n      Leaf ->\n        case r of\n          Leaf ->\n            IterEmit k v iter\n          _ ->\n            IterEmit k v (IterNode r iter)\n      _ ->\n        case r of\n          Leaf ->\n            IterEmit k v (IterNode l iter)\n          _ ->\n            IterEmit k v (IterNode l (IterNode r iter))\n", "module Halogen.Data.OrdBox\n  ( OrdBox\n  , mkOrdBox\n  , unOrdBox\n  ) where\n\nimport Prelude\n\n-- | A value carrying its `Ord` instance so it can be used at a later date\n-- | without the need for evidence of the instance.\ndata OrdBox a = OrdBox (a -> a -> Boolean) (a -> a -> Ordering) a\n\ninstance eqOrdBox :: Eq (OrdBox a) where\n  eq (OrdBox e _ x) (OrdBox _ _ y) = e x y\n\ninstance ordOrdBox :: Ord (OrdBox a) where\n  compare (OrdBox _ c x) (OrdBox _ _ y) = c x y\n\nmkOrdBox :: forall a. Ord a => a -> OrdBox a\nmkOrdBox = OrdBox eq compare\n\nunOrdBox :: forall a. OrdBox a -> a\nunOrdBox (OrdBox _ _ a) = a\n", "module Halogen.Data.Slot\n  ( Slot\n  , SlotStorage\n  , empty\n  , lookup\n  , insert\n  , pop\n  , slots\n  , foreachSlot\n  ) where\n\nimport Prelude\n\nimport Data.Foldable (traverse_)\nimport Data.Map (Map)\nimport Data.Map as Map\nimport Data.Maybe (Maybe(..))\nimport Data.Monoid.Alternate (Alternate(..))\nimport Data.Newtype (un)\nimport Data.Symbol (class IsSymbol, reflectSymbol)\nimport Data.Tuple (Tuple(..))\nimport Halogen.Data.OrdBox (OrdBox, mkOrdBox, unOrdBox)\nimport Prim.Row as Row\nimport Type.Proxy (Proxy)\nimport Unsafe.Coerce (unsafeCoerce)\n\nforeign import data Any :: Type\n\n-- | A type which records the queries, output messages, and slot identifier for\n-- | a particular slot (ie. a location in HTML where a component is rendered).\n-- | For example:\n-- |\n-- | ```purescript\n-- | type ButtonSlot slot = Slot Button.Query Button.Output slot\n-- |\n-- | -- A component using this slot type can have one type of child component,\n-- | -- which supports `Button.Query` queries, `Button.Output` outputs, and\n-- | -- which can be uniquely identified by an integer.\n-- | type Slots = ( button :: ButtonSlot Int )\n-- | ```\n-- |\n-- | - `query` represents the requests that can be made of this component\n-- | - `output` represents the output messages that can be raised by this component\n-- | - `slot` represents the unique identifier for this component\ndata Slot :: (Type -> Type) -> Type -> Type -> Type\ndata Slot (query :: Type -> Type) output slot\n\nnewtype SlotStorage (slots :: Row Type) (slot :: (Type -> Type) -> Type -> Type) =\n  SlotStorage (Map (Tuple String (OrdBox Any)) Any)\n\nempty :: forall slots slot. SlotStorage slots slot\nempty = SlotStorage Map.empty\n\nlookup\n  :: forall sym px slots slot query output s\n   . Row.Cons sym (Slot query output s) px slots\n  => IsSymbol sym\n  => Ord s\n  => Proxy sym\n  -> s\n  -> SlotStorage slots slot\n  -> Maybe (slot query output)\nlookup sym key (SlotStorage m) =\n  coerceSlot (Map.lookup (Tuple (reflectSymbol sym) (coerceBox (mkOrdBox key))) m)\n  where\n  coerceSlot :: Maybe Any -> Maybe (slot query output)\n  coerceSlot = unsafeCoerce\n\n  coerceBox :: OrdBox s -> OrdBox Any\n  coerceBox = unsafeCoerce\n\npop\n  :: forall sym px slots slot query output s\n   . Row.Cons sym (Slot query output s) px slots\n  => IsSymbol sym\n  => Ord s\n  => Proxy sym\n  -> s\n  -> SlotStorage slots slot\n  -> Maybe (Tuple (slot query output) (SlotStorage slots slot))\npop sym key (SlotStorage m) =\n  coercePop (Map.pop (Tuple (reflectSymbol sym) (coerceBox (mkOrdBox key))) m)\n  where\n  coercePop :: Maybe (Tuple Any (Map (Tuple String (OrdBox Any)) Any)) -> Maybe (Tuple (slot query output) (SlotStorage slots slot))\n  coercePop = unsafeCoerce\n\n  coerceBox :: OrdBox s -> OrdBox Any\n  coerceBox = unsafeCoerce\n\ninsert\n  :: forall sym px slots slot query output s\n   . Row.Cons sym (Slot query output s) px slots\n  => IsSymbol sym\n  => Ord s\n  => Proxy sym\n  -> s\n  -> slot query output\n  -> SlotStorage slots slot\n  -> SlotStorage slots slot\ninsert sym key val (SlotStorage m) =\n  SlotStorage (Map.insert (Tuple (reflectSymbol sym) (coerceBox (mkOrdBox key))) (coerceVal val) m)\n  where\n  coerceBox :: OrdBox s -> OrdBox Any\n  coerceBox = unsafeCoerce\n\n  coerceVal :: slot query output -> Any\n  coerceVal = unsafeCoerce\n\nslots\n  :: forall sym px slots slot query output s\n   . Row.Cons sym (Slot query output s) px slots\n  => IsSymbol sym\n  => Ord s\n  => Proxy sym\n  -> SlotStorage slots slot\n  -> Map s (slot query output)\nslots sym (SlotStorage m) = un Alternate $ Map.foldSubmap Nothing Nothing go m\n  where\n  key = reflectSymbol sym\n\n  go (Tuple key' ob) val\n    | key == key' = Alternate $ Map.singleton (unOrdBox (coerceBox ob)) (coerceVal val)\n    | otherwise = Alternate Map.empty\n\n  coerceBox :: OrdBox Any -> OrdBox s\n  coerceBox = unsafeCoerce\n\n  coerceVal :: Any -> slot query output\n  coerceVal = unsafeCoerce\n\nforeachSlot\n  :: forall m slots slot\n   . Applicative m\n  => SlotStorage slots slot\n  -> (forall query output. slot query output -> m Unit)\n  -> m Unit\nforeachSlot (SlotStorage m) k = traverse_ (k <<< coerceVal) m\n  where\n  coerceVal :: forall query output. Any -> slot query output\n  coerceVal = unsafeCoerce\n", "module DOM.HTML.Indexed.AutocompleteType where\n\nimport Prelude\n\ndata AutocompleteType\n  = AutocompleteOff\n  | AutocompleteOn\n  | AutocompleteName\n  | AutocompleteHonorificPrefix\n  | AutocompleteGivenName\n  | AutocompleteAdditionalName\n  | AutocompleteFamilyName\n  | AutocompleteHonorificSuffix\n  | AutocompleteNickname\n  | AutocompleteEmail\n  | AutocompleteUsername\n  | AutocompleteNewPassword\n  | AutocompleteCurrentPassword\n  | AutocompleteOneTimeCode\n  | AutocompleteOrganizationTitle\n  | AutocompleteOrganization\n  | AutocompleteStreetAddress\n  | AutocompleteAddressLine1\n  | AutocompleteAddressLine2\n  | AutocompleteAddressLine3\n  | AutocompleteAddressLevel1\n  | AutocompleteAddressLevel2\n  | AutocompleteAddressLevel3\n  | AutocompleteAddressLevel4\n  | AutocompleteCountry\n  | AutocompleteCountryName\n  | AutocompletePostalCode\n  | AutocompleteCreditCardName\n  | AutocompleteCreditCardGivenName\n  | AutocompleteCreditCardAdditionalName\n  | AutocompleteCreditCardFamilyName\n  | AutocompleteCreditCardNumber\n  | AutocompleteCreditCardExpiration\n  | AutocompleteCreditCardExpirationMonth\n  | AutocompleteCreditCardExpirationYear\n  | AutocompleteCreditCardSecurityCode\n  | AutocompleteCreditCardType\n  | AutocompleteTransactionCurrency\n  | AutocompleteTransactionAmount\n  | AutocompleteLanguage\n  | AutocompleteBirthday\n  | AutocompleteBirthdayDay\n  | AutocompleteBirthdayMonth\n  | AutocompleteBirthdayYear\n  | AutocompleteSex\n  | AutocompleteTelephone\n  | AutocompleteTelephoneCountryCode\n  | AutocompleteTelephoneNational\n  | AutocompleteTelephoneAreaCode\n  | AutocompleteTelephoneLocal\n  | AutocompleteTelephoneLocalPrefix\n  | AutocompleteTelephoneLocalSuffix\n  | AutocompleteTelephoneExtension\n  | AutocompleteIMPP\n  | AutocompleteURL\n  | AutocompletePhoto\n\nderive instance eqAutocompleteType :: Eq AutocompleteType\nderive instance ordAutocompleteType :: Ord AutocompleteType\n\nrenderAutocompleteType :: AutocompleteType -> String\nrenderAutocompleteType = case _ of\n  AutocompleteOff -> \"off\"\n  AutocompleteOn -> \"on\"\n  AutocompleteName -> \"name\"\n  AutocompleteHonorificPrefix -> \"honorific-prefix\"\n  AutocompleteGivenName -> \"given-name\"\n  AutocompleteAdditionalName -> \"additional-name\"\n  AutocompleteFamilyName -> \"family-name\"\n  AutocompleteHonorificSuffix -> \"honorific-suffix\"\n  AutocompleteNickname -> \"nickname\"\n  AutocompleteEmail -> \"email\"\n  AutocompleteUsername -> \"username\"\n  AutocompleteNewPassword -> \"new-password\"\n  AutocompleteCurrentPassword -> \"current-password\"\n  AutocompleteOneTimeCode -> \"one-time-code\"\n  AutocompleteOrganizationTitle -> \"organization-title\"\n  AutocompleteOrganization -> \"organization\"\n  AutocompleteStreetAddress -> \"street-address\"\n  AutocompleteAddressLine1 -> \"address-line1\"\n  AutocompleteAddressLine2 -> \"address-line2\"\n  AutocompleteAddressLine3 -> \"address-line3\"\n  AutocompleteAddressLevel1 -> \"address-level1\"\n  AutocompleteAddressLevel2 -> \"address-level2\"\n  AutocompleteAddressLevel3 -> \"address-level3\"\n  AutocompleteAddressLevel4 -> \"address-level4\"\n  AutocompleteCountry -> \"country\"\n  AutocompleteCountryName -> \"country-name\"\n  AutocompletePostalCode -> \"postal-code\"\n  AutocompleteCreditCardName -> \"cc-name\"\n  AutocompleteCreditCardGivenName -> \"cc-given-name\"\n  AutocompleteCreditCardAdditionalName -> \"cc-additional-name\"\n  AutocompleteCreditCardFamilyName -> \"cc-family-name\"\n  AutocompleteCreditCardNumber -> \"cc-number\"\n  AutocompleteCreditCardExpiration -> \"cc-exp\"\n  AutocompleteCreditCardExpirationMonth -> \"cc-exp-month\"\n  AutocompleteCreditCardExpirationYear -> \"cc-exp-year\"\n  AutocompleteCreditCardSecurityCode -> \"cc-csc\"\n  AutocompleteCreditCardType -> \"cc-type\"\n  AutocompleteTransactionCurrency -> \"transaction-currency\"\n  AutocompleteTransactionAmount -> \"transaction-amount\"\n  AutocompleteLanguage -> \"language\"\n  AutocompleteBirthday -> \"bday\"\n  AutocompleteBirthdayDay -> \"bday-day\"\n  AutocompleteBirthdayMonth -> \"bday-month\"\n  AutocompleteBirthdayYear -> \"bday-year\"\n  AutocompleteSex -> \"sex\"\n  AutocompleteTelephone -> \"tel\"\n  AutocompleteTelephoneCountryCode -> \"tel-country-code\"\n  AutocompleteTelephoneNational -> \"tel-national\"\n  AutocompleteTelephoneAreaCode -> \"telarea-code\"\n  AutocompleteTelephoneLocal -> \"tel-local\"\n  AutocompleteTelephoneLocalPrefix -> \"tel-local-prefix\"\n  AutocompleteTelephoneLocalSuffix -> \"tel-local-suffix\"\n  AutocompleteTelephoneExtension -> \"tel-extension\"\n  AutocompleteIMPP -> \"impp\"\n  AutocompleteURL -> \"url\"\n  AutocompletePhoto -> \"photo\"\n", "module DOM.HTML.Indexed.ButtonType where\n\nimport Prelude\n\ndata ButtonType\n  = ButtonButton\n  | ButtonSubmit\n  | ButtonReset\n\nderive instance eqButtonType :: Eq ButtonType\nderive instance ordButtonType :: Ord ButtonType\n\nrenderButtonType :: ButtonType -> String\nrenderButtonType = case _ of\n  ButtonButton -> \"button\"\n  ButtonSubmit -> \"submit\"\n  ButtonReset -> \"reset\"\n", "module Halogen.Query.Input where\n\nimport Prelude\n\nimport Data.Maybe (Maybe)\nimport Data.Newtype (class Newtype)\nimport Web.DOM (Element)\n\nnewtype RefLabel = RefLabel String\n\nderive instance newtypeRefLabel :: Newtype RefLabel _\nderive newtype instance eqRefLabel :: Eq RefLabel\nderive newtype instance ordRefLabel :: Ord RefLabel\n\ndata Input action\n  = RefUpdate RefLabel (Maybe Element)\n  | Action action\n\nderive instance functorInput :: Functor Input\n", "module Halogen.VDom.Machine\n  ( Machine\n  , Step'(..)\n  , Step\n  , mkStep\n  , unStep\n  , extract\n  , step\n  , halt\n  ) where\n\nimport Prelude\n\nimport Effect.Uncurried (EffectFn1, EffectFn2, mkEffectFn1, mkEffectFn2, runEffectFn1, runEffectFn2)\nimport Unsafe.Coerce (unsafeCoerce)\n\ntype Machine a b = EffectFn1 a (Step a b)\n\ndata Step' a b s = Step b s (EffectFn2 s a (Step a b)) (EffectFn1 s Unit)\n\nforeign import data Step \u2237 Type \u2192 Type \u2192 Type\n\nmkStep \u2237 \u2200 a b s. Step' a b s \u2192 Step a b\nmkStep = unsafeCoerce\n\nunStep :: \u2200 a b r. (\u2200 s. Step' a b s \u2192 r) \u2192 Step a b \u2192 r\nunStep = unsafeCoerce\n\n-- | Returns the output value of a `Step`.\nextract \u2237 \u2200 a b. Step a b \u2192 b\nextract = unStep \\(Step x _ _ _) \u2192 x\n\n-- | Runs the next step.\nstep \u2237 \u2200 a b. EffectFn2 (Step a b) a (Step a b)\nstep = coerce $ mkEffectFn2 \\(Step _ s k _) a \u2192 runEffectFn2 k s a\n  where\n  coerce \u2237 \u2200 s. EffectFn2 (Step' a b s) a (Step a b) \u2192 EffectFn2 (Step a b) a (Step a b)\n  coerce = unsafeCoerce\n\n-- | Runs the finalizer associated with a `Step`\nhalt \u2237 \u2200 a b. EffectFn1 (Step a b) Unit\nhalt = coerce $ mkEffectFn1 \\(Step _ s _ k) \u2192 runEffectFn1 k s\n  where\n  coerce \u2237 \u2200 s. EffectFn1 (Step' a b s) Unit \u2192 EffectFn1 (Step a b) Unit\n  coerce = unsafeCoerce\n", "module Halogen.VDom.Types\n  ( VDom(..)\n  , renderWidget\n  , Graft\n  , GraftX(..)\n  , graft\n  , unGraft\n  , runGraft\n  , ElemName(..)\n  , Namespace(..)\n  ) where\n\nimport Prelude\nimport Data.Bifunctor (class Bifunctor, bimap)\nimport Data.Maybe (Maybe)\nimport Data.Newtype (class Newtype)\nimport Data.Tuple (Tuple)\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | The core virtual-dom tree type, where `a` is the type of attributes,\n-- | and `w` is the type of \"widgets\". Widgets are machines that have complete\n-- | control over the lifecycle of some `DOM.Node`.\n-- |\n-- | The `Grafted` constructor and associated machinery enables `bimap`\n-- | fusion using a Coyoneda-like encoding.\ndata VDom a w\n  = Text String\n  | Elem (Maybe Namespace) ElemName a (Array (VDom a w))\n  | Keyed (Maybe Namespace) ElemName a (Array (Tuple String (VDom a w)))\n  | Widget w\n  | Grafted (Graft a w)\n\ninstance functorVDom \u2237 Functor (VDom a) where\n  map _ (Text a) = Text a\n  map g (Grafted a) = Grafted (map g a)\n  map g a = Grafted (graft (Graft identity g a))\n\ninstance bifunctorVDom \u2237 Bifunctor VDom where\n  bimap _ _ (Text a) = Text a\n  bimap f g (Grafted a) = Grafted (bimap f g a)\n  bimap f g a = Grafted (graft (Graft f g a))\n\n-- | Replaces \"widgets\" in the `VDom` with the ability to turn them into other\n-- | `VDom` nodes.\n-- |\n-- | Using this function will fuse any `Graft`s present in the `VDom`.\nrenderWidget \u2237 \u2200 a b w x. (a \u2192 b) \u2192 (w \u2192 VDom b x) \u2192 VDom a w \u2192 VDom b x\nrenderWidget f g = case _ of\n  Text a \u2192 Text a\n  Elem ns n a ch \u2192 Elem ns n (f a) (map (renderWidget f g) ch)\n  Keyed ns n a ch \u2192 Keyed ns n (f a) (map (map (renderWidget f g)) ch)\n  Widget w \u2192 g w\n  Grafted gaw \u2192 renderWidget f g (runGraft gaw)\n\nforeign import data Graft \u2237 Type \u2192 Type \u2192 Type\n\ninstance functorGraft \u2237 Functor (Graft a) where\n  map g = unGraft \\(Graft f' g' a) \u2192 graft (Graft f' (g <<< g') a)\n\ninstance bifunctorGraft \u2237 Bifunctor Graft where\n  bimap f g = unGraft \\(Graft f' g' a) \u2192 graft (Graft (f <<< f') (g <<< g') a)\n\ndata GraftX a a' w w' =\n  Graft (a \u2192 a') (w \u2192 w') (VDom a w)\n\ngraft\n  \u2237 \u2200 a a' w w'\n  . GraftX a a' w w'\n  \u2192 Graft a' w'\ngraft = unsafeCoerce\n\nunGraft\n  \u2237 \u2200 a' w' r\n  . (\u2200 a w. GraftX a a' w w' \u2192 r)\n  \u2192 Graft a' w'\n  \u2192 r\nunGraft f = f <<< unsafeCoerce\n\nrunGraft\n  \u2237 \u2200 a' w'\n  . Graft a' w'\n  \u2192 VDom a' w'\nrunGraft =\n  unGraft \\(Graft fa fw v) \u2192\n    let\n      go (Text s) = Text s\n      go (Elem ns n a ch) = Elem ns n (fa a) (map go ch)\n      go (Keyed ns n a ch) = Keyed ns n (fa a) (map (map go) ch)\n      go (Widget w) = Widget (fw w)\n      go (Grafted g) = Grafted (bimap fa fw g)\n    in\n      go v\n\nnewtype ElemName = ElemName String\n\nderive instance newtypeElemName \u2237 Newtype ElemName _\nderive newtype instance eqElemName \u2237 Eq ElemName\nderive newtype instance ordElemName \u2237 Ord ElemName\n\nnewtype Namespace = Namespace String\n\nderive instance newtypeNamespace \u2237 Newtype Namespace _\nderive newtype instance eqNamespace \u2237 Eq Namespace\nderive newtype instance ordNamespace \u2237 Ord Namespace\n", "\"use strict\";\n\nexport function unsafeGetAny(key, obj) {\n  return obj[key];\n}\n\nexport function unsafeHasAny(key, obj) {\n  return obj.hasOwnProperty(key);\n}\n\nexport function unsafeSetAny(key, val, obj) {\n    obj[key] = val;\n}\n\nexport function unsafeDeleteAny(key, obj) {\n  delete obj[key];\n}\n\nexport function forE(a, f) {\n  var b = [];\n  for (var i = 0; i < a.length; i++) {\n    b.push(f(i, a[i]));\n  }\n  return b;\n}\n\nexport function forEachE(a, f) {\n  for (var i = 0; i < a.length; i++) {\n    f(a[i]);\n  }\n}\n\nexport function forInE(o, f) {\n  var ks = Object.keys(o);\n  for (var i = 0; i < ks.length; i++) {\n    var k = ks[i];\n    f(k, o[k]);\n  }\n}\n\nexport function replicateE(n, f) {\n  for (var i = 0; i < n; i++) {\n    f();\n  }\n}\n\nexport function diffWithIxE(a1, a2, f1, f2, f3) {\n  var a3 = [];\n  var l1 = a1.length;\n  var l2 = a2.length;\n  var i  = 0;\n  while (1) {\n    if (i < l1) {\n      if (i < l2) {\n        a3.push(f1(i, a1[i], a2[i]));\n      } else {\n        f2(i, a1[i]);\n      }\n    } else if (i < l2) {\n      a3.push(f3(i, a2[i]));\n    } else {\n      break;\n    }\n    i++;\n  }\n  return a3;\n}\n\nexport function strMapWithIxE(as, fk, f) {\n  var o = {};\n  for (var i = 0; i < as.length; i++) {\n    var a = as[i];\n    var k = fk(a);\n    o[k] = f(k, i, a);\n  }\n  return o;\n}\n\nexport function diffWithKeyAndIxE(o1, as, fk, f1, f2, f3) {\n  var o2 = {};\n  for (var i = 0; i < as.length; i++) {\n    var a = as[i];\n    var k = fk(a);\n    if (o1.hasOwnProperty(k)) {\n      o2[k] = f1(k, i, o1[k], a);\n    } else {\n      o2[k] = f3(k, i, a);\n    }\n  }\n  for (var k in o1) {\n    if (k in o2) {\n      continue;\n    }\n    f2(k, o1[k]);\n  }\n  return o2;\n}\n\nexport function refEq(a, b) {\n  return a === b;\n}\n\nexport function createTextNode(s, doc) {\n  return doc.createTextNode(s);\n}\n\nexport function setTextContent(s, n) {\n  n.textContent = s;\n}\n\nexport function createElement(ns, name, doc) {\n  if (ns != null) {\n    return doc.createElementNS(ns, name);\n  } else {\n    return doc.createElement(name)\n  }\n}\n\nexport function insertChildIx(i, a, b) {\n  var n = b.childNodes.item(i) || null;\n  if (n !== a) {\n    b.insertBefore(a, n);\n  }\n}\n\nexport function removeChild(a, b) {\n  if (b && a.parentNode === b) {\n    b.removeChild(a);\n  }\n}\n\nexport function parentNode(a) {\n  return a.parentNode;\n}\n\nexport function setAttribute(ns, attr, val, el) {\n  if (ns != null) {\n    el.setAttributeNS(ns, attr, val);\n  } else {\n    el.setAttribute(attr, val);\n  }\n}\n\nexport function removeAttribute(ns, attr, el) {\n  if (ns != null) {\n    el.removeAttributeNS(ns, attr);\n  } else {\n    el.removeAttribute(attr);\n  }\n}\n\nexport function hasAttribute(ns, attr, el) {\n  if (ns != null) {\n    return el.hasAttributeNS(ns, attr);\n  } else {\n    return el.hasAttribute(attr);\n  }\n}\n\nexport function addEventListener(ev, listener, el) {\n  el.addEventListener(ev, listener, false);\n}\n\nexport function removeEventListener(ev, listener, el) {\n  el.removeEventListener(ev, listener, false);\n}\n\nexport var jsUndefined = void 0;\n", "module Halogen.VDom.Util\n  ( newMutMap\n  , pokeMutMap\n  , deleteMutMap\n  , unsafeFreeze\n  , unsafeLookup\n  , unsafeGetAny\n  , unsafeHasAny\n  , unsafeSetAny\n  , unsafeDeleteAny\n  , forE\n  , forEachE\n  , forInE\n  , replicateE\n  , diffWithIxE\n  , diffWithKeyAndIxE\n  , strMapWithIxE\n  , refEq\n  , createTextNode\n  , setTextContent\n  , createElement\n  , insertChildIx\n  , removeChild\n  , parentNode\n  , setAttribute\n  , removeAttribute\n  , hasAttribute\n  , addEventListener\n  , removeEventListener\n  , JsUndefined\n  , jsUndefined\n  ) where\n\nimport Prelude\n\nimport Data.Function.Uncurried as Fn\nimport Data.Nullable (Nullable)\nimport Effect (Effect)\nimport Effect.Uncurried as EFn\nimport Foreign.Object (Object)\nimport Foreign.Object as Object\nimport Foreign.Object.ST (STObject)\nimport Foreign.Object.ST as STObject\nimport Halogen.VDom.Types (Namespace, ElemName)\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.DOM.Document (Document) as DOM\nimport Web.DOM.Element (Element) as DOM\nimport Web.DOM.Node (Node) as DOM\nimport Web.Event.EventTarget (EventListener) as DOM\n\nnewMutMap \u2237 \u2200 r a. Effect (STObject r a)\nnewMutMap = unsafeCoerce STObject.new\n\npokeMutMap \u2237 \u2200 r a. EFn.EffectFn3 String a (STObject r a) Unit\npokeMutMap = unsafeSetAny\n\ndeleteMutMap \u2237 \u2200 r a. EFn.EffectFn2 String (STObject r a) Unit\ndeleteMutMap = unsafeDeleteAny\n\nunsafeFreeze \u2237 \u2200 r a. STObject r a \u2192 Object a\nunsafeFreeze = unsafeCoerce\n\nunsafeLookup \u2237 \u2200 a. Fn.Fn2 String (Object a) a\nunsafeLookup = unsafeGetAny\n\nforeign import unsafeGetAny\n  \u2237 \u2200 a b. Fn.Fn2 String a b\n\nforeign import unsafeHasAny\n  \u2237 \u2200 a. Fn.Fn2 String a Boolean\n\nforeign import unsafeSetAny \u2237 \u2200 a b. EFn.EffectFn3 String a b Unit\n\nforeign import unsafeDeleteAny\n  \u2237 \u2200 a. EFn.EffectFn2 String a Unit\n\nforeign import forE\n  \u2237 \u2200 a b\n  . EFn.EffectFn2\n      (Array a)\n      (EFn.EffectFn2 Int a b)\n      (Array b)\n\nforeign import forEachE\n  \u2237 \u2200 a\n  . EFn.EffectFn2\n      (Array a)\n      (EFn.EffectFn1 a Unit)\n      Unit\n\nforeign import forInE\n  \u2237 \u2200 a\n  . EFn.EffectFn2\n      (Object.Object a)\n      (EFn.EffectFn2 String a Unit)\n      Unit\n\nforeign import replicateE\n  \u2237 \u2200 a\n  . EFn.EffectFn2\n      Int\n      (Effect a)\n      Unit\n\nforeign import diffWithIxE\n  \u2237 \u2200 b c d\n  . EFn.EffectFn5\n      (Array b)\n      (Array c)\n      (EFn.EffectFn3 Int b c d)\n      (EFn.EffectFn2 Int b Unit)\n      (EFn.EffectFn2 Int c d)\n      (Array d)\n\nforeign import diffWithKeyAndIxE\n  \u2237 \u2200 a b c d\n  . EFn.EffectFn6\n      (Object.Object a)\n      (Array b)\n      (b \u2192 String)\n      (EFn.EffectFn4 String Int a b c)\n      (EFn.EffectFn2 String a d)\n      (EFn.EffectFn3 String Int b c)\n      (Object.Object c)\n\nforeign import strMapWithIxE\n  \u2237 \u2200 a b\n  . EFn.EffectFn3\n      (Array a)\n      (a \u2192 String)\n      (EFn.EffectFn3 String Int a b)\n      (Object.Object b)\n\nforeign import refEq\n  \u2237 \u2200 a b. Fn.Fn2 a b Boolean\n\nforeign import createTextNode\n  \u2237 EFn.EffectFn2 String DOM.Document DOM.Node\n\nforeign import setTextContent\n  \u2237 EFn.EffectFn2 String DOM.Node Unit\n\nforeign import createElement\n  \u2237 EFn.EffectFn3 (Nullable Namespace) ElemName DOM.Document DOM.Element\n\nforeign import insertChildIx\n  \u2237 EFn.EffectFn3 Int DOM.Node DOM.Node Unit\n\nforeign import removeChild\n  \u2237 EFn.EffectFn2 DOM.Node DOM.Node Unit\n\nforeign import parentNode\n  \u2237 EFn.EffectFn1 DOM.Node DOM.Node\n\nforeign import setAttribute\n  \u2237 EFn.EffectFn4 (Nullable Namespace) String String DOM.Element Unit\n\nforeign import removeAttribute\n  \u2237 EFn.EffectFn3 (Nullable Namespace) String DOM.Element Unit\n\nforeign import hasAttribute\n  \u2237 EFn.EffectFn3 (Nullable Namespace) String DOM.Element Boolean\n\nforeign import addEventListener\n  \u2237 EFn.EffectFn3 String DOM.EventListener DOM.Element Unit\n\nforeign import removeEventListener\n  \u2237 EFn.EffectFn3 String DOM.EventListener DOM.Element Unit\n\nforeign import data JsUndefined \u2237 Type\n\nforeign import jsUndefined \u2237 JsUndefined\n", "var getProp = function (name) {\n  return function (doctype) {\n    return doctype[name];\n  };\n};\n\nexport const _namespaceURI = getProp(\"namespaceURI\");\nexport const _prefix = getProp(\"prefix\");\nexport const localName = getProp(\"localName\");\nexport const tagName = getProp(\"tagName\");\n\nexport function id(node) {\n  return function () {\n    return node.id;\n  };\n}\n\nexport function setId(id) {\n  return function (node) {\n    return function () {\n      node.id = id;\n    };\n  };\n}\n\nexport function className(node) {\n  return function () {\n    return node.className;\n  };\n}\n\nexport function classList(element) {\n  return function () {\n    return element.classList;\n  };\n}\n\nexport function setClassName(className) {\n  return function (node) {\n    return function () {\n      node.className = className;\n    };\n  };\n}\n\nexport function getElementsByTagName(localName) {\n  return function (doc) {\n    return function () {\n      return doc.getElementsByTagName(localName);\n    };\n  };\n}\n\nexport function _getElementsByTagNameNS(ns) {\n  return function (localName) {\n    return function (doc) {\n      return function () {\n        return doc.getElementsByTagNameNS(ns, localName);\n      };\n    };\n  };\n}\n\nexport function getElementsByClassName(classNames) {\n  return function (doc) {\n    return function () {\n      return doc.getElementsByClassName(classNames);\n    };\n  };\n}\n\nexport function setAttribute(name) {\n  return function (value) {\n    return function (element) {\n      return function () {\n        element.setAttribute(name, value);\n      };\n    };\n  };\n}\n\nexport function _getAttribute(name) {\n  return function (element) {\n    return function () {\n      return element.getAttribute(name);\n    };\n  };\n}\n\nexport function hasAttribute(name) {\n  return function (element) {\n    return function () {\n      return element.hasAttribute(name);\n    };\n  };\n}\n\nexport function removeAttribute(name) {\n  return function (element) {\n    return function () {\n      element.removeAttribute(name);\n    };\n  };\n}\n\nexport function matches(selector) {\n  return function(element) {\n    return function () {\n      return element.matches(selector);\n    };\n  };\n}\n\nexport function _closest(selector) {\n  return function(element) {\n    return function () {\n      return element.closest(selector);\n    };\n  };\n}\n\n// - CSSOM ---------------------------------------------------------------------\n\nexport function scrollTop(node) {\n  return function () {\n    return node.scrollTop;\n  };\n}\n\nexport function setScrollTop(scrollTop) {\n  return function (node) {\n    return function () {\n      node.scrollTop = scrollTop;\n    };\n  };\n}\n\nexport function scrollLeft(node) {\n  return function () {\n    return node.scrollLeft;\n  };\n}\n\nexport function setScrollLeft(scrollLeft) {\n  return function (node) {\n    return function () {\n      node.scrollLeft = scrollLeft;\n    };\n  };\n}\n\nexport function scrollWidth(el) {\n  return function () {\n    return el.scrollWidth;\n  };\n}\n\nexport function scrollHeight(el) {\n  return function () {\n    return el.scrollHeight;\n  };\n}\n\nexport function clientTop(el) {\n  return function () {\n    return el.clientTop;\n  };\n}\n\nexport function clientLeft(el) {\n  return function () {\n    return el.clientLeft;\n  };\n}\n\nexport function clientWidth(el) {\n  return function () {\n    return el.clientWidth;\n  };\n}\n\nexport function clientHeight(el) {\n  return function () {\n    return el.clientHeight;\n  };\n}\n\nexport function getBoundingClientRect(el) {\n  return function () {\n    var rect = el.getBoundingClientRect();\n    return {\n      top: rect.top,\n      right: rect.right,\n      bottom: rect.bottom,\n      left: rect.left,\n      width: rect.width,\n      height: rect.height,\n      x: rect.x,\n      y: rect.y\n    };\n  };\n}\n\nexport function _attachShadow(props) {\n  return function (el) {\n    return function() {\n      return el.attachShadow(props);\n    };\n  };\n}\n", "var getEffProp = function (name) {\n  return function (node) {\n    return function () {\n      return node[name];\n    };\n  };\n};\n\nexport const children = getEffProp(\"children\");\nexport const _firstElementChild = getEffProp(\"firstElementChild\");\nexport const _lastElementChild = getEffProp(\"lastElementChild\");\nexport const childElementCount = getEffProp(\"childElementCount\");\n\nexport function _querySelector(selector) {\n  return function (node) {\n    return function () {\n      return node.querySelector(selector);\n    };\n  };\n}\n\nexport function querySelectorAll(selector) {\n  return function (node) {\n    return function () {\n      return node.querySelectorAll(selector);\n    };\n  };\n}\n", "module Web.DOM.ParentNode\n  ( ParentNode\n  , children\n  , firstElementChild\n  , lastElementChild\n  , childElementCount\n  , QuerySelector(..)\n  , querySelector\n  , querySelectorAll\n  ) where\n\nimport Prelude\n\nimport Data.Maybe (Maybe)\nimport Data.Newtype (class Newtype)\nimport Data.Nullable (Nullable, toMaybe)\nimport Effect (Effect)\nimport Web.DOM.Internal.Types (Element)\nimport Web.DOM.HTMLCollection (HTMLCollection)\nimport Web.DOM.NodeList (NodeList)\n\nforeign import data ParentNode :: Type\n\n-- | The child elements for the node.\nforeign import children :: ParentNode -> Effect HTMLCollection\n\n-- | The first child that is an element, or Nothing if no such element exists.\nfirstElementChild :: ParentNode -> Effect (Maybe Element)\nfirstElementChild = map toMaybe <<< _firstElementChild\n\nforeign import _firstElementChild :: ParentNode -> Effect (Nullable Element)\n\n-- | The last child that is an element, or Nothing if no such element exists.\nlastElementChild :: ParentNode -> Effect (Maybe Element)\nlastElementChild = map toMaybe <<< _lastElementChild\n\nforeign import _lastElementChild :: ParentNode -> Effect (Nullable Element)\n\n-- | The number of child elements.\nforeign import childElementCount :: ParentNode -> Effect Int\n\nnewtype QuerySelector = QuerySelector String\n\nderive newtype instance eqQuerySelector :: Eq QuerySelector\nderive newtype instance ordQuerySelector :: Ord QuerySelector\nderive instance newtypeQuerySelector :: Newtype QuerySelector _\n\n-- | Finds the first child that is an element that matches the selector(s), or\n-- | Nothing if no such element exists.\nquerySelector :: QuerySelector -> ParentNode -> Effect (Maybe Element)\nquerySelector qs = map toMaybe <<< _querySelector qs\n\nforeign import _querySelector :: QuerySelector -> ParentNode -> Effect (Nullable Element)\n\n-- | Finds all the child elements that matches the selector(s).\nforeign import querySelectorAll :: QuerySelector -> ParentNode -> Effect NodeList\n", "module Web.DOM.Element\n  ( module Exports\n  , fromNode\n  , fromChildNode\n  , fromNonDocumentTypeChildNode\n  , fromParentNode\n  , fromEventTarget\n  , toNode\n  , toChildNode\n  , toNonDocumentTypeChildNode\n  , toParentNode\n  , toEventTarget\n  , namespaceURI\n  , prefix\n  , localName\n  , tagName\n  , id\n  , setId\n  , className\n  , classList\n  , setClassName\n  , getElementsByTagName\n  , getElementsByTagNameNS\n  , getElementsByClassName\n  , setAttribute\n  , getAttribute\n  , hasAttribute\n  , removeAttribute\n  , matches\n  , closest\n  , scrollTop\n  , setScrollTop\n  , scrollLeft\n  , setScrollLeft\n  , scrollWidth\n  , scrollHeight\n  , clientTop\n  , clientLeft\n  , clientWidth\n  , clientHeight\n  , getBoundingClientRect\n  , DOMRect\n  , ShadowRootInit\n  , attachShadow\n  ) where\n\nimport Prelude\n\nimport Data.Maybe (Maybe)\nimport Data.Nullable (Nullable, toMaybe, toNullable)\nimport Effect (Effect)\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.DOM.ChildNode (ChildNode)\nimport Web.DOM.DOMTokenList (DOMTokenList)\nimport Web.DOM.Internal.Types (Element) as Exports\nimport Web.DOM.Internal.Types (Element, HTMLCollection, Node)\nimport Web.DOM.NonDocumentTypeChildNode (NonDocumentTypeChildNode)\nimport Web.DOM.ParentNode (QuerySelector) as Exports\nimport Web.DOM.ParentNode (ParentNode, QuerySelector)\nimport Web.DOM.ShadowRoot (ShadowRoot, ShadowRootMode)\nimport Web.Event.EventTarget (EventTarget)\nimport Web.Internal.FFI (unsafeReadProtoTagged)\n\nfromNode :: Node -> Maybe Element\nfromNode = unsafeReadProtoTagged \"Element\"\n\nfromChildNode :: ChildNode -> Maybe Element\nfromChildNode = unsafeReadProtoTagged \"Element\"\n\nfromNonDocumentTypeChildNode :: NonDocumentTypeChildNode -> Maybe Element\nfromNonDocumentTypeChildNode = unsafeReadProtoTagged \"Element\"\n\nfromParentNode :: ParentNode -> Maybe Element\nfromParentNode = unsafeReadProtoTagged \"Element\"\n\nfromEventTarget :: EventTarget -> Maybe Element\nfromEventTarget = unsafeReadProtoTagged \"Element\"\n\ntoNode :: Element -> Node\ntoNode = unsafeCoerce\n\ntoChildNode :: Element -> ChildNode\ntoChildNode = unsafeCoerce\n\ntoNonDocumentTypeChildNode :: Element -> NonDocumentTypeChildNode\ntoNonDocumentTypeChildNode = unsafeCoerce\n\ntoParentNode :: Element -> ParentNode\ntoParentNode = unsafeCoerce\n\ntoEventTarget :: Element -> EventTarget\ntoEventTarget = unsafeCoerce\n\nnamespaceURI :: Element -> Maybe String\nnamespaceURI = toMaybe <<< _namespaceURI\n\nprefix :: Element -> Maybe String\nprefix = toMaybe <<< _prefix\n\nforeign import _namespaceURI :: Element -> Nullable String\nforeign import _prefix :: Element -> Nullable String\nforeign import localName :: Element -> String\nforeign import tagName :: Element -> String\n\nforeign import id :: Element -> Effect String\nforeign import setId :: String -> Element -> Effect Unit\nforeign import className :: Element -> Effect String\nforeign import classList :: Element -> Effect DOMTokenList\nforeign import setClassName :: String -> Element -> Effect Unit\n\nforeign import getElementsByTagName :: String -> Element -> Effect HTMLCollection\n\ngetElementsByTagNameNS :: Maybe String -> String -> Element -> Effect HTMLCollection\ngetElementsByTagNameNS = _getElementsByTagNameNS <<< toNullable\n\nforeign import _getElementsByTagNameNS :: Nullable String -> String -> Element -> Effect HTMLCollection\n\nforeign import getElementsByClassName :: String -> Element -> Effect HTMLCollection\n\nforeign import setAttribute :: String -> String -> Element -> Effect Unit\n\ngetAttribute :: String -> Element -> Effect (Maybe String)\ngetAttribute attr = map toMaybe <<< _getAttribute attr\n\nforeign import _getAttribute :: String -> Element -> Effect (Nullable String)\nforeign import hasAttribute :: String -> Element -> Effect Boolean\nforeign import removeAttribute :: String -> Element -> Effect Unit\n\nforeign import matches :: QuerySelector -> Element -> Effect Boolean\n\nclosest :: QuerySelector -> Element -> Effect (Maybe Element)\nclosest qs = map toMaybe <<< _closest qs\n\nforeign import _closest :: QuerySelector -> Element -> Effect (Nullable Element)\n\nforeign import scrollTop :: Element -> Effect Number\nforeign import setScrollTop :: Number -> Element -> Effect Unit\n\nforeign import scrollLeft :: Element -> Effect Number\nforeign import setScrollLeft :: Number -> Element -> Effect Unit\n\nforeign import scrollWidth :: Element -> Effect Number\nforeign import scrollHeight :: Element -> Effect Number\nforeign import clientTop :: Element -> Effect Number\nforeign import clientLeft :: Element -> Effect Number\nforeign import clientWidth :: Element -> Effect Number\nforeign import clientHeight :: Element -> Effect Number\n\ntype DOMRect =\n  { top :: Number\n  , right :: Number\n  , bottom :: Number\n  , left :: Number\n  , width :: Number\n  , height :: Number\n  , x :: Number\n  , y :: Number\n  }\n\nforeign import getBoundingClientRect :: Element -> Effect DOMRect\n\ntype ShadowRootInit = {\n  mode :: ShadowRootMode,\n  delegatesFocus :: Boolean\n}\n\nattachShadow :: ShadowRootInit -> Element -> Effect ShadowRoot\nattachShadow = _attachShadow <<< initToProps\n\ntype ShadowRootProps = {\n  mode :: String,\n  delegatesFocus :: Boolean\n}\n\ninitToProps :: ShadowRootInit -> ShadowRootProps\ninitToProps init = {\n  mode: show init.mode,\n  delegatesFocus: init.delegatesFocus\n}\n\nforeign import _attachShadow :: ShadowRootProps -> Element -> Effect ShadowRoot\n", "module Halogen.VDom.DOM\n  ( VDomSpec(..)\n  , buildVDom\n  , buildText\n  , buildElem\n  , buildKeyed\n  , buildWidget\n  ) where\n\nimport Prelude\n\nimport Data.Array as Array\nimport Data.Function.Uncurried as Fn\nimport Data.Maybe (Maybe(..))\nimport Data.Nullable (toNullable)\nimport Data.Tuple (Tuple(..), fst)\nimport Effect.Uncurried as EFn\nimport Foreign.Object as Object\nimport Halogen.VDom.Machine (Machine, Step, Step'(..), extract, halt, mkStep, step, unStep)\nimport Halogen.VDom.Machine as Machine\nimport Halogen.VDom.Types (ElemName(..), Namespace(..), VDom(..), runGraft)\nimport Halogen.VDom.Util as Util\nimport Web.DOM.Document (Document) as DOM\nimport Web.DOM.Element (Element) as DOM\nimport Web.DOM.Element as DOMElement\nimport Web.DOM.Node (Node) as DOM\n\ntype VDomMachine a w = Machine (VDom a w) DOM.Node\n\ntype VDomStep a w = Step (VDom a w) DOM.Node\n\ntype VDomInit i a w = EFn.EffectFn1 i (VDomStep a w)\n\ntype VDomBuilder i a w = EFn.EffectFn3 (VDomSpec a w) (VDomMachine a w) i (VDomStep a w)\n\ntype VDomBuilder4 i j k l a w = EFn.EffectFn6 (VDomSpec a w) (VDomMachine a w) i j k l (VDomStep a w)\n\n-- | Widget machines recursively reference the configured spec to potentially\n-- | enable recursive trees of Widgets.\nnewtype VDomSpec a w = VDomSpec\n  { buildWidget \u2237 VDomSpec a w \u2192 Machine w DOM.Node\n  , buildAttributes \u2237 DOM.Element \u2192 Machine a Unit\n  , document \u2237 DOM.Document\n  }\n\n-- | Starts an initial `VDom` machine by providing a `VDomSpec`.\n-- |\n-- | ```purescript\n-- | main = do\n-- |   machine1 \u2190 buildVDom spec vdomTree1\n-- |   machine2 \u2190 Machine.step machine1 vdomTree2\n-- |   machine3 \u2190 Machine.step machine2 vdomTree3\n-- |   ...\n-- | ````\nbuildVDom \u2237 \u2200 a w. VDomSpec a w \u2192 VDomMachine a w\nbuildVDom spec = build\n  where\n  build = EFn.mkEffectFn1 case _ of\n    Text s \u2192 EFn.runEffectFn3 buildText spec build s\n    Elem ns n a ch \u2192 EFn.runEffectFn6 buildElem spec build ns n a ch\n    Keyed ns n a ch \u2192 EFn.runEffectFn6 buildKeyed spec build ns n a ch\n    Widget w \u2192 EFn.runEffectFn3 buildWidget spec build w\n    Grafted g \u2192 EFn.runEffectFn1 build (runGraft g)\n\ntype TextState a w =\n  { build \u2237 VDomMachine a w\n  , node \u2237 DOM.Node\n  , value \u2237 String\n  }\n\nbuildText \u2237 \u2200 a w. VDomBuilder String a w\nbuildText = EFn.mkEffectFn3 \\(VDomSpec spec) build s \u2192 do\n  node \u2190 EFn.runEffectFn2 Util.createTextNode s spec.document\n  let state = { build, node, value: s }\n  pure $ mkStep $ Step node state patchText haltText\n\npatchText \u2237 \u2200 a w. EFn.EffectFn2 (TextState a w) (VDom a w) (VDomStep a w)\npatchText = EFn.mkEffectFn2 \\state vdom \u2192 do\n  let { build, node, value: value1 } = state\n  case vdom of\n    Grafted g \u2192\n      EFn.runEffectFn2 patchText state (runGraft g)\n    Text value2\n      | value1 == value2 \u2192\n          pure $ mkStep $ Step node state patchText haltText\n      | otherwise \u2192 do\n          let nextState = { build, node, value: value2 }\n          EFn.runEffectFn2 Util.setTextContent value2 node\n          pure $ mkStep $ Step node nextState patchText haltText\n    _ \u2192 do\n      EFn.runEffectFn1 haltText state\n      EFn.runEffectFn1 build vdom\n\nhaltText \u2237 \u2200 a w. EFn.EffectFn1 (TextState a w) Unit\nhaltText = EFn.mkEffectFn1 \\{ node } \u2192 do\n  parent \u2190 EFn.runEffectFn1 Util.parentNode node\n  EFn.runEffectFn2 Util.removeChild node parent\n\ntype ElemState a w =\n  { build \u2237 VDomMachine a w\n  , node \u2237 DOM.Node\n  , attrs \u2237 Step a Unit\n  , ns \u2237 Maybe Namespace\n  , name \u2237 ElemName\n  , children \u2237 Array (VDomStep a w)\n  }\n\nbuildElem \u2237 \u2200 a w. VDomBuilder4 (Maybe Namespace) ElemName a (Array (VDom a w)) a w\nbuildElem = EFn.mkEffectFn6 \\(VDomSpec spec) build ns1 name1 as1 ch1 \u2192 do\n  el \u2190 EFn.runEffectFn3 Util.createElement (toNullable ns1) name1 spec.document\n  let\n    node = DOMElement.toNode el\n    onChild = EFn.mkEffectFn2 \\ix child \u2192 do\n      res \u2190 EFn.runEffectFn1 build child\n      EFn.runEffectFn3 Util.insertChildIx ix (extract res) node\n      pure res\n  children \u2190 EFn.runEffectFn2 Util.forE ch1 onChild\n  attrs \u2190 EFn.runEffectFn1 (spec.buildAttributes el) as1\n  let\n    state =\n      { build\n      , node\n      , attrs\n      , ns: ns1\n      , name: name1\n      , children\n      }\n  pure $ mkStep $ Step node state patchElem haltElem\n\npatchElem \u2237 \u2200 a w. EFn.EffectFn2 (ElemState a w) (VDom a w) (VDomStep a w)\npatchElem = EFn.mkEffectFn2 \\state vdom \u2192 do\n  let { build, node, attrs, ns: ns1, name: name1, children: ch1 } = state\n  case vdom of\n    Grafted g \u2192\n      EFn.runEffectFn2 patchElem state (runGraft g)\n    Elem ns2 name2 as2 ch2 | Fn.runFn4 eqElemSpec ns1 name1 ns2 name2 \u2192 do\n      case Array.length ch1, Array.length ch2 of\n        0, 0 \u2192 do\n          attrs2 \u2190 EFn.runEffectFn2 step attrs as2\n          let\n            nextState =\n              { build\n              , node\n              , attrs: attrs2\n              , ns: ns2\n              , name: name2\n              , children: ch1\n              }\n          pure $ mkStep $ Step node nextState patchElem haltElem\n        _, _ \u2192 do\n          let\n            onThese = EFn.mkEffectFn3 \\ix s v \u2192 do\n              res \u2190 EFn.runEffectFn2 step s v\n              EFn.runEffectFn3 Util.insertChildIx ix (extract res) node\n              pure res\n            onThis = EFn.mkEffectFn2 \\_ s \u2192 EFn.runEffectFn1 halt s\n            onThat = EFn.mkEffectFn2 \\ix v \u2192 do\n              res \u2190 EFn.runEffectFn1 build v\n              EFn.runEffectFn3 Util.insertChildIx ix (extract res) node\n              pure res\n          children2 \u2190 EFn.runEffectFn5 Util.diffWithIxE ch1 ch2 onThese onThis onThat\n          attrs2 \u2190 EFn.runEffectFn2 step attrs as2\n          let\n            nextState =\n              { build\n              , node\n              , attrs: attrs2\n              , ns: ns2\n              , name: name2\n              , children: children2\n              }\n          pure $ mkStep $ Step node nextState patchElem haltElem\n    _ \u2192 do\n      EFn.runEffectFn1 haltElem state\n      EFn.runEffectFn1 build vdom\n\nhaltElem \u2237 \u2200 a w. EFn.EffectFn1 (ElemState a w) Unit\nhaltElem = EFn.mkEffectFn1 \\{ node, attrs, children } \u2192 do\n  parent \u2190 EFn.runEffectFn1 Util.parentNode node\n  EFn.runEffectFn2 Util.removeChild node parent\n  EFn.runEffectFn2 Util.forEachE children halt\n  EFn.runEffectFn1 halt attrs\n\ntype KeyedState a w =\n  { build \u2237 VDomMachine a w\n  , node \u2237 DOM.Node\n  , attrs \u2237 Step a Unit\n  , ns \u2237 Maybe Namespace\n  , name \u2237 ElemName\n  , children \u2237 Object.Object (VDomStep a w)\n  , length \u2237 Int\n  }\n\nbuildKeyed \u2237 \u2200 a w. VDomBuilder4 (Maybe Namespace) ElemName a (Array (Tuple String (VDom a w))) a w\nbuildKeyed = EFn.mkEffectFn6 \\(VDomSpec spec) build ns1 name1 as1 ch1 \u2192 do\n  el \u2190 EFn.runEffectFn3 Util.createElement (toNullable ns1) name1 spec.document\n  let\n    node = DOMElement.toNode el\n    onChild = EFn.mkEffectFn3 \\_ ix (Tuple _ vdom) \u2192 do\n      res \u2190 EFn.runEffectFn1 build vdom\n      EFn.runEffectFn3 Util.insertChildIx ix (extract res) node\n      pure res\n  children \u2190 EFn.runEffectFn3 Util.strMapWithIxE ch1 fst onChild\n  attrs \u2190 EFn.runEffectFn1 (spec.buildAttributes el) as1\n  let\n    state =\n      { build\n      , node\n      , attrs\n      , ns: ns1\n      , name: name1\n      , children\n      , length: Array.length ch1\n      }\n  pure $ mkStep $ Step node state patchKeyed haltKeyed\n\npatchKeyed \u2237 \u2200 a w. EFn.EffectFn2 (KeyedState a w) (VDom a w) (VDomStep a w)\npatchKeyed = EFn.mkEffectFn2 \\state vdom \u2192 do\n  let { build, node, attrs, ns: ns1, name: name1, children: ch1, length: len1 } = state\n  case vdom of\n    Grafted g \u2192\n      EFn.runEffectFn2 patchKeyed state (runGraft g)\n    Keyed ns2 name2 as2 ch2 | Fn.runFn4 eqElemSpec ns1 name1 ns2 name2 \u2192\n      case len1, Array.length ch2 of\n        0, 0 \u2192 do\n          attrs2 \u2190 EFn.runEffectFn2 Machine.step attrs as2\n          let\n            nextState =\n              { build\n              , node\n              , attrs: attrs2\n              , ns: ns2\n              , name: name2\n              , children: ch1\n              , length: 0\n              }\n          pure $ mkStep $ Step node nextState patchKeyed haltKeyed\n        _, len2 \u2192 do\n          let\n            onThese = EFn.mkEffectFn4 \\_ ix' s (Tuple _ v) \u2192 do\n              res \u2190 EFn.runEffectFn2 step s v\n              EFn.runEffectFn3 Util.insertChildIx ix' (extract res) node\n              pure res\n            onThis = EFn.mkEffectFn2 \\_ s \u2192 EFn.runEffectFn1 halt s\n            onThat = EFn.mkEffectFn3 \\_ ix (Tuple _ v) \u2192 do\n              res \u2190 EFn.runEffectFn1 build v\n              EFn.runEffectFn3 Util.insertChildIx ix (extract res) node\n              pure res\n          children2 \u2190 EFn.runEffectFn6 Util.diffWithKeyAndIxE ch1 ch2 fst onThese onThis onThat\n          attrs2 \u2190 EFn.runEffectFn2 step attrs as2\n          let\n            nextState =\n              { build\n              , node\n              , attrs: attrs2\n              , ns: ns2\n              , name: name2\n              , children: children2\n              , length: len2\n              }\n          pure $ mkStep $ Step node nextState patchKeyed haltKeyed\n    _ \u2192 do\n      EFn.runEffectFn1 haltKeyed state\n      EFn.runEffectFn1 build vdom\n\nhaltKeyed \u2237 \u2200 a w. EFn.EffectFn1 (KeyedState a w) Unit\nhaltKeyed = EFn.mkEffectFn1 \\{ node, attrs, children } \u2192 do\n  parent \u2190 EFn.runEffectFn1 Util.parentNode node\n  EFn.runEffectFn2 Util.removeChild node parent\n  EFn.runEffectFn2 Util.forInE children (EFn.mkEffectFn2 \\_ s \u2192 EFn.runEffectFn1 halt s)\n  EFn.runEffectFn1 halt attrs\n\ntype WidgetState a w =\n  { build \u2237 VDomMachine a w\n  , widget \u2237 Step w DOM.Node\n  }\n\nbuildWidget \u2237 \u2200 a w. VDomBuilder w a w\nbuildWidget = EFn.mkEffectFn3 \\(VDomSpec spec) build w \u2192 do\n  res \u2190 EFn.runEffectFn1 (spec.buildWidget (VDomSpec spec)) w\n  let\n    res' = res # unStep \\(Step n _ _ _) \u2192\n      mkStep $ Step n { build, widget: res } patchWidget haltWidget\n  pure res'\n\npatchWidget \u2237 \u2200 a w. EFn.EffectFn2 (WidgetState a w) (VDom a w) (VDomStep a w)\npatchWidget = EFn.mkEffectFn2 \\state vdom \u2192 do\n  let { build, widget } = state\n  case vdom of\n    Grafted g \u2192\n      EFn.runEffectFn2 patchWidget state (runGraft g)\n    Widget w \u2192 do\n      res \u2190 EFn.runEffectFn2 step widget w\n      let\n        res' = res # unStep \\(Step n _ _ _) \u2192\n          mkStep $ Step n { build, widget: res } patchWidget haltWidget\n      pure res'\n    _ \u2192 do\n      EFn.runEffectFn1 haltWidget state\n      EFn.runEffectFn1 build vdom\n\nhaltWidget \u2237 forall a w. EFn.EffectFn1 (WidgetState a w) Unit\nhaltWidget = EFn.mkEffectFn1 \\{ widget } \u2192 do\n  EFn.runEffectFn1 halt widget\n\neqElemSpec \u2237 Fn.Fn4 (Maybe Namespace) ElemName (Maybe Namespace) ElemName Boolean\neqElemSpec = Fn.mkFn4 \\ns1 (ElemName name1) ns2 (ElemName name2) \u2192\n  if name1 == name2\n    then case ns1, ns2 of\n      Just (Namespace ns1'), Just (Namespace ns2') | ns1' == ns2' \u2192 true\n      Nothing, Nothing \u2192 true\n      _, _ \u2192 false\n    else false\n", "export function eventListener(fn) {\n  return function () {\n    return function (event) {\n      return fn(event)();\n    };\n  };\n}\n\nexport function addEventListenerWithOptions(type) {\n  return function (listener) {\n    return function (options) {\n      return function (target) {\n        return function () {\n          return target.addEventListener(type, listener, options);\n        };\n      };\n    };\n  };\n}\n\nexport function addEventListener(type) {\n  return function (listener) {\n    return function (useCapture) {\n      return function (target) {\n        return function () {\n          return target.addEventListener(type, listener, useCapture);\n        };\n      };\n    };\n  };\n}\n\nexport function removeEventListener(type) {\n  return function (listener) {\n    return function (useCapture) {\n      return function (target) {\n        return function () {\n          return target.removeEventListener(type, listener, useCapture);\n        };\n      };\n    };\n  };\n}\n\nexport function dispatchEvent(event) {\n  return function (target) {\n    return function () {\n      return target.dispatchEvent(event);\n    };\n  };\n}\n", "module Halogen.VDom.DOM.Prop\n  ( Prop(..)\n  , ElemRef(..)\n  , PropValue\n  , propFromString\n  , propFromBoolean\n  , propFromInt\n  , propFromNumber\n  , buildProp\n  ) where\n\nimport Prelude\n\nimport Data.Function.Uncurried as Fn\nimport Data.Maybe (Maybe(..))\nimport Data.Nullable (null, toNullable)\nimport Data.Tuple (Tuple(..), fst, snd)\nimport Effect (Effect)\nimport Effect.Ref as Ref\nimport Effect.Uncurried as EFn\nimport Foreign (typeOf)\nimport Foreign.Object as Object\nimport Halogen.VDom as V\nimport Halogen.VDom.Machine (Step'(..), mkStep)\nimport Halogen.VDom.Types (Namespace(..))\nimport Halogen.VDom.Util as Util\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.DOM.Element (Element) as DOM\nimport Web.Event.Event (EventType(..), Event) as DOM\nimport Web.Event.EventTarget (eventListener) as DOM\n\n-- | Attributes, properties, event handlers, and element lifecycles.\n-- | Parameterized by the type of handlers outputs.\ndata Prop a\n  = Attribute (Maybe Namespace) String String\n  | Property String PropValue\n  | Handler DOM.EventType (DOM.Event \u2192 Maybe a)\n  | Ref (ElemRef DOM.Element \u2192 Maybe a)\n\ninstance functorProp \u2237 Functor Prop where\n  map f (Handler ty g) = Handler ty (map f <$> g)\n  map f (Ref g) = Ref (map f <$> g)\n  map _ p = unsafeCoerce p\n\ndata ElemRef a\n  = Created a\n  | Removed a\n\ninstance functorElemRef \u2237 Functor ElemRef where\n  map f (Created a) = Created (f a)\n  map f (Removed a) = Removed (f a)\n\nforeign import data PropValue \u2237 Type\n\npropFromString \u2237 String \u2192 PropValue\npropFromString = unsafeCoerce\n\npropFromBoolean \u2237 Boolean \u2192 PropValue\npropFromBoolean = unsafeCoerce\n\npropFromInt \u2237 Int \u2192 PropValue\npropFromInt = unsafeCoerce\n\npropFromNumber \u2237 Number \u2192 PropValue\npropFromNumber = unsafeCoerce\n\n-- | A `Machine`` for applying attributes, properties, and event handlers.\n-- | An emitter effect must be provided to respond to events. For example,\n-- | to allow arbitrary effects in event handlers, one could use `id`.\nbuildProp\n  \u2237 \u2200 a\n  . (a \u2192 Effect Unit)\n  \u2192 DOM.Element\n  \u2192 V.Machine (Array (Prop a)) Unit\nbuildProp emit el = renderProp\n  where\n  renderProp = EFn.mkEffectFn1 \\ps1 \u2192 do\n    events \u2190 Util.newMutMap\n    ps1' \u2190 EFn.runEffectFn3 Util.strMapWithIxE ps1 propToStrKey (applyProp events)\n    let\n      state =\n        { events: Util.unsafeFreeze events\n        , props: ps1'\n        }\n    pure $ mkStep $ Step unit state patchProp haltProp\n\n  patchProp = EFn.mkEffectFn2 \\state ps2 \u2192 do\n    events \u2190 Util.newMutMap\n    let\n      { events: prevEvents, props: ps1 } = state\n      onThese = Fn.runFn2 diffProp prevEvents events\n      onThis = removeProp prevEvents\n      onThat = applyProp events\n    props \u2190 EFn.runEffectFn6 Util.diffWithKeyAndIxE ps1 ps2 propToStrKey onThese onThis onThat\n    let\n      nextState =\n        { events: Util.unsafeFreeze events\n        , props\n        }\n    pure $ mkStep $ Step unit nextState patchProp haltProp\n\n  haltProp = EFn.mkEffectFn1 \\state \u2192 do\n    case Object.lookup \"ref\" state.props of\n      Just (Ref f) \u2192\n        EFn.runEffectFn1 mbEmit (f (Removed el))\n      _ \u2192 pure unit\n\n  mbEmit = EFn.mkEffectFn1 case _ of\n    Just a \u2192 emit a\n    _ \u2192 pure unit\n\n  applyProp events = EFn.mkEffectFn3 \\_ _ v \u2192\n    case v of\n      Attribute ns attr val \u2192 do\n        EFn.runEffectFn4 Util.setAttribute (toNullable ns) attr val el\n        pure v\n      Property prop val \u2192 do\n        EFn.runEffectFn3 setProperty prop val el\n        pure v\n      Handler (DOM.EventType ty) f \u2192 do\n        case Fn.runFn2 Util.unsafeGetAny ty events of\n          handler | Fn.runFn2 Util.unsafeHasAny ty events \u2192 do\n            Ref.write f (snd handler)\n            pure v\n          _ \u2192 do\n            ref \u2190 Ref.new f\n            listener \u2190 DOM.eventListener \\ev \u2192 do\n              f' \u2190 Ref.read ref\n              EFn.runEffectFn1 mbEmit (f' ev)\n            EFn.runEffectFn3 Util.pokeMutMap ty (Tuple listener ref) events\n            EFn.runEffectFn3 Util.addEventListener ty listener el\n            pure v\n      Ref f \u2192 do\n        EFn.runEffectFn1 mbEmit (f (Created el))\n        pure v\n\n  diffProp = Fn.mkFn2 \\prevEvents events \u2192 EFn.mkEffectFn4 \\_ _ v1 v2 \u2192\n    case v1, v2 of\n      Attribute _ _ val1, Attribute ns2 attr2 val2 \u2192\n        if val1 == val2\n          then pure v2\n          else do\n            EFn.runEffectFn4 Util.setAttribute (toNullable ns2) attr2 val2 el\n            pure v2\n      Property _ val1, Property prop2 val2 \u2192\n        case Fn.runFn2 Util.refEq val1 val2, prop2 of\n          true, _ \u2192\n            pure v2\n          _, \"value\" \u2192 do\n            let elVal = Fn.runFn2 unsafeGetProperty \"value\" el\n            if Fn.runFn2 Util.refEq elVal val2\n              then pure v2\n              else do\n                EFn.runEffectFn3 setProperty prop2 val2 el\n                pure v2\n          _, _ \u2192 do\n            EFn.runEffectFn3 setProperty prop2 val2 el\n            pure v2\n      Handler _ _, Handler (DOM.EventType ty) f \u2192 do\n        let\n          handler = Fn.runFn2 Util.unsafeLookup ty prevEvents\n        Ref.write f (snd handler)\n        EFn.runEffectFn3 Util.pokeMutMap ty handler events\n        pure v2\n      _, _ \u2192\n        pure v2\n\n  removeProp prevEvents = EFn.mkEffectFn2 \\_ v \u2192\n    case v of\n      Attribute ns attr _ \u2192\n        EFn.runEffectFn3 Util.removeAttribute (toNullable ns) attr el\n      Property prop _ \u2192\n        EFn.runEffectFn2 removeProperty prop el\n      Handler (DOM.EventType ty) _ \u2192 do\n        let\n          handler = Fn.runFn2 Util.unsafeLookup ty prevEvents\n        EFn.runEffectFn3 Util.removeEventListener ty (fst handler) el\n      Ref _ \u2192\n        pure unit\n\npropToStrKey \u2237 \u2200 i. Prop i \u2192 String\npropToStrKey = case _ of\n  Attribute (Just (Namespace ns)) attr _ \u2192 \"attr/\" <> ns <> \":\" <> attr\n  Attribute _ attr _ \u2192 \"attr/:\" <> attr\n  Property prop _ \u2192 \"prop/\" <> prop\n  Handler (DOM.EventType ty) _ \u2192 \"handler/\" <> ty\n  Ref _ \u2192 \"ref\"\n\nsetProperty \u2237 EFn.EffectFn3 String PropValue DOM.Element Unit\nsetProperty = Util.unsafeSetAny\n\nunsafeGetProperty \u2237 Fn.Fn2 String DOM.Element PropValue\nunsafeGetProperty = Util.unsafeGetAny\n\nremoveProperty \u2237 EFn.EffectFn2 String DOM.Element Unit\nremoveProperty = EFn.mkEffectFn2 \\key el \u2192\n  EFn.runEffectFn3 Util.hasAttribute null key el >>= if _\n    then EFn.runEffectFn3 Util.removeAttribute null key el\n    else case typeOf (Fn.runFn2 Util.unsafeGetAny key el) of\n      \"string\" \u2192 EFn.runEffectFn3 Util.unsafeSetAny key \"\" el\n      _        \u2192 case key of\n        \"rowSpan\" \u2192 EFn.runEffectFn3 Util.unsafeSetAny key 1 el\n        \"colSpan\" \u2192 EFn.runEffectFn3 Util.unsafeSetAny key 1 el\n        _ \u2192 EFn.runEffectFn3 Util.unsafeSetAny key Util.jsUndefined el\n", "module Halogen.HTML.Core\n  ( HTML(..)\n  , renderWidget\n  , widget\n  , text\n  , element\n  , keyed\n  , prop\n  , attr\n  , handler\n  , ref\n  , class IsProp\n  , toPropValue\n  , module Exports\n  ) where\n\nimport Prelude\n\nimport DOM.HTML.Indexed.AutocompleteType (AutocompleteType, renderAutocompleteType)\nimport DOM.HTML.Indexed.ButtonType (ButtonType, renderButtonType)\nimport DOM.HTML.Indexed.CrossOriginValue (CrossOriginValue, renderCrossOriginValue)\nimport DOM.HTML.Indexed.DirValue (DirValue, renderDirValue)\nimport DOM.HTML.Indexed.FormMethod (FormMethod, renderFormMethod)\nimport DOM.HTML.Indexed.InputAcceptType (InputAcceptType, renderInputAcceptType)\nimport DOM.HTML.Indexed.InputType (InputType, renderInputType)\nimport DOM.HTML.Indexed.KindValue (KindValue, renderKindValue)\nimport DOM.HTML.Indexed.MenuType (MenuType, renderMenuType)\nimport DOM.HTML.Indexed.MenuitemType (MenuitemType, renderMenuitemType)\nimport DOM.HTML.Indexed.OrderedListType (OrderedListType, renderOrderedListType)\nimport DOM.HTML.Indexed.PreloadValue (PreloadValue, renderPreloadValue)\nimport DOM.HTML.Indexed.ScopeValue (ScopeValue, renderScopeValue)\nimport DOM.HTML.Indexed.StepValue (StepValue, renderStepValue)\nimport DOM.HTML.Indexed.WrapValue (WrapValue, renderWrapValue)\nimport Data.Bifunctor (class Bifunctor, bimap, rmap)\nimport Data.Maybe (Maybe(..))\nimport Data.MediaType (MediaType)\nimport Data.Newtype (class Newtype, un, unwrap)\nimport Data.Tuple (Tuple)\nimport Halogen.Query.Input (Input)\nimport Halogen.VDom (ElemName(..), Namespace(..)) as Exports\nimport Halogen.VDom.DOM.Prop (ElemRef(..), Prop(..), PropValue, propFromBoolean, propFromInt, propFromNumber, propFromString)\nimport Halogen.VDom.DOM.Prop (Prop(..), PropValue) as Exports\nimport Halogen.VDom.Types as VDom\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.DOM.Element (Element)\nimport Web.Event.Event (Event, EventType)\nimport Web.HTML.Common (AttrName(..), ClassName(..), PropName(..)) as Exports\nimport Web.HTML.Common (AttrName(..), PropName(..))\n\nnewtype HTML w i = HTML (VDom.VDom (Array (Prop (Input i))) w)\n\nderive instance newtypeHTML :: Newtype (HTML w i) _\n\ninstance bifunctorHTML :: Bifunctor HTML where\n  bimap f g (HTML vdom) = HTML (bimap (map (map (map g))) f vdom)\n\ninstance functorHTML :: Functor (HTML p) where\n  map = rmap\n\nrenderWidget :: forall w x i j. (i -> j) -> (w -> HTML x j) -> HTML w i -> HTML x j\nrenderWidget f g (HTML vdom) =\n  HTML (VDom.renderWidget (map (map (map f))) (un HTML <<< g) vdom)\n\nwidget :: forall p q. p -> HTML p q\nwidget = HTML <<< VDom.Widget\n\n-- | Constructs a text node `HTML` value.\ntext :: forall w i. String -> HTML w i\ntext = HTML <<< VDom.Text\n\n-- | A smart constructor for HTML elements.\nelement :: forall w i. Maybe VDom.Namespace -> VDom.ElemName -> Array (Prop i) -> Array (HTML w i) -> HTML w i\nelement ns =\n  coe (\\name props children -> VDom.Elem ns name props children)\n  where\n  coe\n    :: (VDom.ElemName -> Array (Prop i) -> Array (VDom.VDom (Array (Prop i)) w) -> VDom.VDom (Array (Prop i)) w)\n    -> VDom.ElemName\n    -> Array (Prop i)\n    -> Array (HTML w i)\n    -> HTML w i\n  coe = unsafeCoerce\n\n-- | A smart constructor for HTML elements with keyed children.\nkeyed :: forall w i. Maybe VDom.Namespace -> VDom.ElemName -> Array (Prop i) -> Array (Tuple String (HTML w i)) -> HTML w i\nkeyed ns = coe (\\name props children -> VDom.Keyed ns name props children)\n  where\n  coe\n    :: (VDom.ElemName -> Array (Prop i) -> Array (Tuple String (VDom.VDom (Array (Prop i)) w)) -> VDom.VDom (Array (Prop i)) w)\n    -> VDom.ElemName\n    -> Array (Prop i)\n    -> Array (Tuple String (HTML w i))\n    -> HTML w i\n  coe = unsafeCoerce\n\n-- | Create a HTML property.\nprop :: forall value i. IsProp value => PropName value -> value -> Prop i\nprop (PropName name) = Property name <<< toPropValue\n\n-- | Create a HTML attribute.\nattr :: forall i. Maybe VDom.Namespace -> AttrName -> String -> Prop i\nattr ns (AttrName name) = Attribute ns name\n\n-- | Create an event handler.\nhandler :: forall i. EventType -> (Event -> Maybe i) -> Prop i\nhandler = Handler\n\nref :: forall i. (Maybe Element -> Maybe i) -> Prop i\nref f = Ref $ f <<< case _ of\n  Created x -> Just x\n  Removed _ -> Nothing\n\nclass IsProp a where\n  toPropValue :: a -> PropValue\n\ninstance isPropString :: IsProp String where\n  toPropValue = propFromString\n\ninstance isPropInt :: IsProp Int where\n  toPropValue = propFromInt\n\ninstance isPropNumber :: IsProp Number where\n  toPropValue = propFromNumber\n\ninstance isPropBoolean :: IsProp Boolean where\n  toPropValue = propFromBoolean\n\ninstance isPropMediaType :: IsProp MediaType where\n  toPropValue = propFromString <<< unwrap\n\ninstance isPropButtonType :: IsProp ButtonType where\n  toPropValue = propFromString <<< renderButtonType\n\ninstance isPropCrossOriginValue :: IsProp CrossOriginValue where\n  toPropValue = propFromString <<< renderCrossOriginValue\n\ninstance isPropDirValue :: IsProp DirValue where\n  toPropValue = propFromString <<< renderDirValue\n\ninstance isPropFormMethod :: IsProp FormMethod where\n  toPropValue = propFromString <<< renderFormMethod\n\ninstance isPropInputType :: IsProp InputType where\n  toPropValue = propFromString <<< renderInputType\n\ninstance isPropKindValue :: IsProp KindValue where\n  toPropValue = propFromString <<< renderKindValue\n\ninstance isPropMenuitemType :: IsProp MenuitemType where\n  toPropValue = propFromString <<< renderMenuitemType\n\ninstance isPropMenuType :: IsProp MenuType where\n  toPropValue = propFromString <<< renderMenuType\n\ninstance isPropAutocompleteType :: IsProp AutocompleteType where\n  toPropValue = propFromString <<< renderAutocompleteType\n\ninstance isPropOrderedListType :: IsProp OrderedListType where\n  toPropValue = propFromString <<< renderOrderedListType\n\ninstance isPropPreloadValue :: IsProp PreloadValue where\n  toPropValue = propFromString <<< renderPreloadValue\n\ninstance isPropScopeValue :: IsProp ScopeValue where\n  toPropValue = propFromString <<< renderScopeValue\n\ninstance isPropStepValue :: IsProp StepValue where\n  toPropValue = propFromString <<< renderStepValue\n\ninstance isPropWrapValue :: IsProp WrapValue where\n  toPropValue = propFromString <<< renderWrapValue\n\ninstance isPropInputAcceptType :: IsProp InputAcceptType where\n  toPropValue = propFromString <<< renderInputAcceptType\n", "module Control.Applicative.Free\n  ( FreeAp\n  , liftFreeAp\n  , retractFreeAp\n  , foldFreeAp\n  , hoistFreeAp\n  , analyzeFreeAp\n  ) where\n\nimport Prelude\n\nimport Data.Const (Const(..))\nimport Data.Either (Either(..))\nimport Data.List (List(..))\nimport Data.List.NonEmpty as NEL\nimport Data.Newtype (unwrap)\nimport Data.NonEmpty ((:|))\nimport Data.Tuple (Tuple(..))\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | The free applicative functor for a type constructor `f`.\ndata FreeAp f a\n  = Pure a\n  | Lift (f a)\n  | Ap (FreeAp f (Val -> a)) (FreeAp f Val)\n\ndata Val\n\n-- | Lift a value described by the type constructor `f` into\n-- | the free applicative functor.\nliftFreeAp :: forall f a. f a -> FreeAp f a\nliftFreeAp = Lift\n\ntype ApFunc g = { func :: g (Val -> Val), count :: Int }\ntype FuncStack g = List (ApFunc g)\ntype ValStack f = NEL.NonEmptyList (FreeAp f Val)\ntype Stack f g = Tuple (FuncStack g) (ValStack f)\n\n-- | Run a free applicative functor with a natural transformation from\n-- | the type constructor `f` to the applicative functor `g`.\nfoldFreeAp :: forall f g a. Applicative g => (f ~> g) -> FreeAp f a -> g a\nfoldFreeAp nat z =\n  unsafeToG $ go $ Tuple Nil (NEL.singleton $ unsafeToFVal z)\n  where\n  unsafeToG :: g Val -> g a\n  unsafeToG = unsafeCoerce\n\n  unsafeToFVal :: forall f' a'. FreeAp f' a' -> FreeAp f' Val\n  unsafeToFVal = unsafeCoerce\n\n  go :: Stack f g -> g Val\n  go (Tuple fStack (NEL.NonEmptyList (val :| vals))) =\n    case val of\n      Pure a -> case goApply fStack vals (pure a) of\n        Left x -> x\n        Right s -> go s\n      Lift a -> case goApply fStack vals (nat a) of\n        Left x -> x\n        Right s -> go s\n      Ap l r ->\n        let nextVals = NEL.NonEmptyList (r :| vals)\n        in go $ goLeft fStack nextVals nat l 1\n\ngoApply\n  :: forall f g\n  . Applicative g\n  => FuncStack g\n  -> List (FreeAp f Val)\n  -> g Val\n  -> Either (g Val) (Stack f g)\ngoApply fStack vals gVal =\n  case fStack of\n    Nil -> Left gVal\n    Cons f fs ->\n      let gRes = f.func <*> gVal\n      in if f.count == 1 then\n        case fs of\n          Nil ->\n            -- here vals must be empty\n            Left gRes\n          _ -> goApply fs vals gRes\n        else\n          case vals of\n            Nil -> Left gRes\n            Cons val vals' ->\n              Right $ Tuple\n                (Cons { func: unsafeToGFunc gRes, count: f.count - 1 } fs)\n                (NEL.NonEmptyList (val :| vals'))\n  where\n  unsafeToGFunc :: g Val -> g (Val -> Val)\n  unsafeToGFunc = unsafeCoerce\n\ngoLeft\n  :: forall f g\n  . Applicative g\n  => FuncStack g\n  -> ValStack f\n  -> (f ~> g)\n  -> FreeAp f (Val -> Val)\n  -> Int\n  -> Stack f g\ngoLeft fStack valStack nat func count = case func of\n  Pure a -> Tuple (Cons { func: pure a, count } fStack) valStack\n  Lift a -> Tuple (Cons { func: nat a, count } fStack) valStack\n  Ap l r -> goLeft fStack (NEL.cons r valStack) nat (unsafeToFunc l) (count + 1)\n  where\n  unsafeToFunc :: FreeAp f (Val -> Val -> Val) -> FreeAp f (Val -> Val)\n  unsafeToFunc = unsafeCoerce\n\n-- | Run a free applicative functor using the applicative instance for\n-- | the type constructor `f`.\nretractFreeAp :: forall f a. Applicative f => FreeAp f a -> f a\nretractFreeAp = foldFreeAp identity\n\n-- | Natural transformation from `FreeAp f a` to `FreeAp g a` given a\n-- | natural transformation from `f` to `g`.\nhoistFreeAp :: forall f g a. (f ~> g) -> FreeAp f a -> FreeAp g a\nhoistFreeAp f = foldFreeAp (f >>> liftFreeAp)\n\n-- | Perform monoidal analysis over the free applicative functor `f`.\nanalyzeFreeAp :: forall f m a. Monoid m => (forall b. f b -> m) -> FreeAp f a -> m\nanalyzeFreeAp k = unwrap <<< foldFreeAp (Const <<< k)\n\nmkAp :: forall f a b. FreeAp f (b -> a) -> FreeAp f b -> FreeAp f a\nmkAp fba fb = Ap (coerceFunc fba) (coerceValue fb)\n  where\n  coerceFunc :: FreeAp f (b -> a) -> FreeAp f (Val -> a)\n  coerceFunc = unsafeCoerce\n\n  coerceValue :: FreeAp f b -> FreeAp f Val\n  coerceValue = unsafeCoerce\n\ninstance functorFreeAp :: Functor (FreeAp f) where\n  map f x = mkAp (Pure f) x\n\ninstance applyFreeAp :: Apply (FreeAp f) where\n  apply fba fb = mkAp fba fb\n\ninstance applicativeFreeAp :: Applicative (FreeAp f) where\n  pure = Pure\n", "-- | This module defines a strict double-ended queue.\n-- |\n-- | The queue implementation is based on a pair of lists where all\n-- | operations require `O(1)` amortized time.\n-- |\n-- | However, any single `uncons` operation may run in `O(n)` time.\n-- |\n-- | See [Simple and Efficient Purely Functional Queues and Dequeues](http://www.westpoint.edu/eecs/SiteAssets/SitePages/Faculty%20Publication%20Documents/Okasaki/jfp95queue.pdf) (Okasaki 1995)\nmodule Data.CatQueue\n  ( CatQueue(..)\n  , empty\n  , null\n  , singleton\n  , length\n  , cons\n  , snoc\n  , uncons\n  , unsnoc\n  , fromFoldable\n  ) where\n\nimport Prelude\n\nimport Control.Alt (class Alt)\nimport Control.Alternative (class Alternative)\nimport Control.Apply (lift2)\nimport Control.MonadPlus (class MonadPlus)\nimport Control.Plus (class Plus)\nimport Data.Foldable (class Foldable, foldMap, foldMapDefaultL, foldl, foldrDefault)\nimport Data.List (List(..), reverse)\nimport Data.List as L\nimport Data.Maybe (Maybe(..))\nimport Data.Traversable (class Traversable, sequenceDefault)\nimport Data.Tuple (Tuple(..))\nimport Data.Unfoldable (class Unfoldable, class Unfoldable1)\n\n-- | A strict double-ended queue (dequeue) representated using a pair of lists.\ndata CatQueue a = CatQueue (List a) (List a)\n\n-- | Create an empty queue.\n-- |\n-- | Running time: `O(1)`\nempty :: forall a. CatQueue a\nempty = CatQueue Nil Nil\n\n-- | Test whether a queue is empty.\n-- |\n-- | Running time: `O(1)`\nnull :: forall a. CatQueue a -> Boolean\nnull (CatQueue Nil Nil) = true\nnull _ = false\n\n-- | Create a queue containing a single element.\n-- |\n-- | Running time: `O(1)`\nsingleton :: forall a. a -> CatQueue a\nsingleton = snoc empty\n\n-- | Number of elements in queue.\n-- |\n-- | Running time: `O(n)` in length of queue.\nlength :: forall a. CatQueue a -> Int\nlength (CatQueue l r) = L.length l + L.length r\n\n-- | Append an element to the beginning of the queue, creating a new queue.\n-- |\n-- | Running time: `O(1)`\ncons :: forall a. a -> CatQueue a -> CatQueue a\ncons a (CatQueue l r) = CatQueue (Cons a l) r\n\n-- | Append an element to the end of the queue, creating a new queue.\n-- |\n-- | Running time: `O(1)`\nsnoc :: forall a. CatQueue a -> a -> CatQueue a\nsnoc (CatQueue l r) a = CatQueue l (Cons a r)\n\n-- | Decompose a queue into a `Tuple` of the first element and the rest of the queue.\n-- |\n-- | Running time: `O(1)`\n-- |\n-- | Note that any single operation may run in `O(n)`.\nuncons :: forall a. CatQueue a -> Maybe (Tuple a (CatQueue a))\nuncons (CatQueue Nil Nil) = Nothing\nuncons (CatQueue Nil r) = uncons (CatQueue (reverse r) Nil)\nuncons (CatQueue (Cons a as) r) = Just (Tuple a (CatQueue as r))\n\n-- | Decompose a queue into a `Tuple` of the last element and the rest of the queue.\n-- |\n-- | Running time: `O(1)`\n-- |\n-- | Note that any single operation may run in `O(n)`.\nunsnoc :: forall a. CatQueue a -> Maybe (Tuple a (CatQueue a))\nunsnoc (CatQueue l (Cons a as)) = Just (Tuple a (CatQueue l as))\nunsnoc (CatQueue Nil Nil) = Nothing\nunsnoc (CatQueue l Nil) = unsnoc (CatQueue Nil (reverse l))\n\n-- | Convert any `Foldable` into a `CatQueue`.\n-- |\n-- | Running time: `O(n)`\nfromFoldable :: forall f a. Foldable f => f a -> CatQueue a\nfromFoldable f = foldMap singleton f\n\ncqEq :: forall a. Eq a => CatQueue a -> CatQueue a -> Boolean\ncqEq = go\n  where\n    elemEq = eq :: (a -> a -> Boolean)\n    go xs ys = case uncons xs, uncons ys of\n      Just (Tuple x xs'), Just (Tuple y ys')\n        | x `elemEq` y -> go xs' ys'\n      Nothing, Nothing -> true\n      _      , _       -> false\n\ncqCompare :: forall a. Ord a => CatQueue a -> CatQueue a -> Ordering\ncqCompare = go\n  where\n    elemCompare = compare :: (a -> a -> Ordering)\n    go xs ys = case uncons xs, uncons ys of\n      Just (Tuple x xs'), Just (Tuple y ys') ->\n        case elemCompare x y of\n             EQ       -> go xs' ys'\n             ordering -> ordering\n      Just _,   Nothing -> GT\n      Nothing,  Just _  -> LT\n      Nothing,  Nothing -> EQ\n\ninstance eqCatQueue :: Eq a => Eq (CatQueue a) where\n  eq = cqEq\n\ninstance ordCatQueue :: Ord a => Ord (CatQueue a) where\n  compare = cqCompare\n\n-- | Running time: `O(n) in the length of the second queue`\ninstance semigroupCatQueue :: Semigroup (CatQueue a) where\n  append = foldl snoc\n\ninstance monoidCatQueue :: Monoid (CatQueue a) where\n  mempty = empty\n\ninstance showCatQueue :: Show a => Show (CatQueue a) where\n  show (CatQueue l r) = \"(CatQueue \" <> show l <> \" \" <> show r <> \")\"\n\ninstance foldableCatQueue :: Foldable CatQueue where\n  foldMap = foldMapDefaultL\n  foldr f = foldrDefault f\n  foldl f = go\n    where\n    go acc q = case uncons q of\n       Just (Tuple x xs) -> go (f acc x) xs\n       Nothing -> acc\n\ninstance unfoldable1CatQueue :: Unfoldable1 CatQueue where\n  unfoldr1 f b = go b empty\n    where\n      go source memo = case f source of\n        Tuple one Nothing -> snoc memo one\n        Tuple one (Just rest) -> go rest (snoc memo one)\n\ninstance unfoldableCatQueue :: Unfoldable CatQueue where\n  unfoldr f b = go b empty\n    where\n      go source memo = case f source of\n        Nothing -> memo\n        Just (Tuple one rest) -> go rest (snoc memo one)\n\ninstance traversableCatQueue :: Traversable CatQueue where\n  traverse f =\n    map (foldl snoc empty)\n    <<< foldl (\\acc -> lift2 snoc acc <<< f) (pure empty)\n  sequence = sequenceDefault\n\ninstance functorCatQueue :: Functor CatQueue where\n  map f (CatQueue l r) = CatQueue (map f l) (map f r)\n\ninstance applyCatQueue :: Apply CatQueue where\n  apply = ap\n\ninstance applicativeCatQueue :: Applicative CatQueue where\n  pure = singleton\n\ninstance bindCatQueue :: Bind CatQueue where\n  bind = flip foldMap\n\ninstance monadCatQueue :: Monad CatQueue\n\ninstance altCatQueue :: Alt CatQueue where\n  alt = append\n\ninstance plusCatQueue :: Plus CatQueue where\n  empty = empty\n\ninstance alternativeCatQueue :: Alternative CatQueue\n\ninstance monadPlusCatQueue :: MonadPlus CatQueue\n", "-- | This module defines a strict catenable list.\n-- |\n-- | The implementation is based on a queue where all operations require\n-- | `O(1)` amortized time.\n-- |\n-- | However, any single `uncons` operation may run in `O(n)` time.\n-- |\n-- | See [Purely Functional Data Structures](http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf) (Okasaki 1996)\nmodule Data.CatList\n  ( CatList(..)\n  , empty\n  , null\n  , singleton\n  , length\n  , append\n  , cons\n  , snoc\n  , uncons\n  , fromFoldable\n  ) where\n\nimport Prelude hiding (append)\n\nimport Control.Alt (class Alt)\nimport Control.Alternative (class Alternative)\nimport Control.MonadPlus (class MonadPlus)\nimport Control.Plus (class Plus)\nimport Data.CatQueue as Q\nimport Data.Foldable (class Foldable, foldMapDefaultL)\nimport Data.Foldable as Foldable\nimport Data.List as L\nimport Data.Maybe (Maybe(..))\nimport Data.Traversable (sequence, traverse, class Traversable)\nimport Data.Tuple (Tuple(..))\nimport Data.Unfoldable (class Unfoldable)\nimport Data.Unfoldable1 (class Unfoldable1)\n\n-- | A strict catenable list.\n-- |\n-- | `CatList` may be empty, represented by `CatNil`.\n-- |\n-- | `CatList` may be non-empty, represented by `CatCons`. The `CatCons`\n-- | data constructor takes the first element of the list and a queue of\n-- | `CatList`.\ndata CatList a = CatNil | CatCons a (Q.CatQueue (CatList a))\n\n-- | Create an empty catenable list.\n-- |\n-- | Running time: `O(1)`\nempty :: forall a. CatList a\nempty = CatNil\n\n-- | Test whether a catenable list is empty.\n-- |\n-- | Running time: `O(1)`\nnull :: forall a. CatList a -> Boolean\nnull CatNil = true\nnull _ = false\n\n-- | Number of elements in queue.\n-- |\n-- | Running time: `O(n)` in length of queue.\nlength :: forall a. CatList a -> Int\nlength = Foldable.length\n\n-- | Append all elements of a catenable list to the end of another\n-- | catenable list, create a new catenable list.\n-- |\n-- | Running time: `O(1)`\nappend :: forall a. CatList a -> CatList a -> CatList a\nappend = link\n\n-- | Append an element to the beginning of the catenable list, creating a new\n-- | catenable list.\n-- |\n-- | Running time: `O(1)`\ncons :: forall a. a -> CatList a -> CatList a\ncons a cat = append (CatCons a Q.empty) cat\n\n-- | Create a catenable list with a single item.\n-- |\n-- | Running time: `O(1)`\nsingleton :: forall a. a -> CatList a\nsingleton a = cons a CatNil\n\n-- | Append an element to the end of the catenable list, creating a new\n-- | catenable list.\n-- |\n-- | Running time: `O(1)`\nsnoc :: forall a. CatList a -> a -> CatList a\nsnoc cat a = append cat (CatCons a Q.empty)\n\n-- | Decompose a catenable list into a `Tuple` of the first element and\n-- | the rest of the catenable list.\n-- |\n-- | Running time: `O(1)`\n-- |\n-- | Note that any single operation may run in `O(n)`.\nuncons :: forall a. CatList a -> Maybe (Tuple a (CatList a))\nuncons CatNil = Nothing\nuncons (CatCons a q) = Just (Tuple a (if Q.null q then CatNil else (foldr link CatNil q)))\n\n-- | Links two catenable lists by making appending the queue in the\n-- | first catenable list to the second catenable list. This operation\n-- | creates a new catenable list.\n-- |\n-- | Running time: `O(1)`\nlink :: forall a. CatList a -> CatList a -> CatList a\nlink CatNil cat = cat\nlink cat CatNil = cat\nlink (CatCons a q) cat = CatCons a (Q.snoc q cat)\n\n-- | Tail recursive version of foldr on `CatList`.\n-- |\n-- | Ensures foldl on `List` is tail-recursive.\nfoldr :: forall a. (CatList a -> CatList a -> CatList a) -> CatList a -> Q.CatQueue (CatList a) -> CatList a\nfoldr k b q = go q L.Nil\n  where\n  go :: Q.CatQueue (CatList a) -> L.List (CatList a -> CatList a) -> CatList a\n  go xs ys = case Q.uncons xs of\n                  Nothing -> foldl (\\x i -> i x) b ys\n                  Just (Tuple a rest) -> go rest (L.Cons (k a) ys)\n\n  foldl :: forall b c. (c -> b -> c) -> c -> L.List b -> c\n  foldl _ c L.Nil = c\n  foldl k' c (L.Cons b' as) = foldl k' (k' c b') as\n\n-- | Convert any `Foldable` into a `CatList`.\n-- |\n-- | Running time: `O(n)`\nfromFoldable :: forall f. Foldable f => f ~> CatList\nfromFoldable f = Foldable.foldMap singleton f\n\nfoldMap :: forall a m. Monoid m => (a -> m) -> CatList a -> m\nfoldMap _ CatNil = mempty\nfoldMap f (CatCons a q) =\n  let d = if Q.null q then CatNil else (foldr link CatNil q)\n  in f a <> foldMap f d\n\n-- | Running time: `O(1)`\ninstance semigroupCatList :: Semigroup (CatList a) where\n  append = append\n\ninstance monoidCatList :: Monoid (CatList a) where\n  mempty = CatNil\n\ninstance showCatList :: Show a => Show (CatList a) where\n  show CatNil = \"CatNil\"\n  show (CatCons a as) = \"(CatList \" <> show a <> \" \" <> show as <> \")\"\n\ninstance foldableCatList :: Foldable CatList where\n  foldMap = foldMapDefaultL\n  foldr f s l = Foldable.foldrDefault f s l\n  foldl f = go\n    where\n    go acc q = case uncons q of\n       Just (Tuple x xs) -> go (f acc x) xs\n       Nothing -> acc\n\ninstance unfoldableCatList :: Unfoldable CatList where\n  unfoldr f b = go b CatNil\n    where\n      go source memo = case f source of\n        Nothing -> memo\n        Just (Tuple one rest) -> go rest (snoc memo one)\n\ninstance unfoldable1CatList :: Unfoldable1 CatList where\n  unfoldr1 f b = go b CatNil\n    where\n      go source memo = case f source of\n        Tuple one Nothing -> snoc memo one\n        Tuple one (Just rest) -> go rest (snoc memo one)\n\ninstance traversableCatList :: Traversable CatList where\n  traverse _ CatNil = pure CatNil\n  traverse f (CatCons a q) =\n    let d = if Q.null q then CatNil else (foldr link CatNil q)\n    in cons <$> f a <*> traverse f d\n  sequence CatNil = pure CatNil\n  sequence (CatCons a q) =\n    let d = if Q.null q then CatNil else (foldr link CatNil q)\n    in cons <$> a <*> sequence d\n\ninstance functorCatList :: Functor CatList where\n  map _ CatNil = CatNil\n  map f (CatCons a q) =\n    let d = if Q.null q then CatNil else (foldr link CatNil q)\n    in f a `cons` map f d\n\ninstance applyCatList :: Apply CatList where\n  apply = ap\n\ninstance applicativeCatList :: Applicative CatList where\n  pure = singleton\n\ninstance bindCatList :: Bind CatList where\n  bind = flip foldMap\n\ninstance monadCatList :: Monad CatList\n\ninstance altCatList :: Alt CatList where\n  alt = append\n\ninstance plusCatList :: Plus CatList where\n  empty = empty\n\ninstance alternativeCatList :: Alternative CatList\n\ninstance monadPlusCatList :: MonadPlus CatList\n", "module Control.Monad.Free\n  ( Free\n  , suspendF\n  , wrap\n  , liftF\n  , hoistFree\n  , foldFree\n  , substFree\n  , runFree\n  , runFreeM\n  , resume\n  , resume'\n  ) where\n\nimport Prelude\n\nimport Control.Apply (lift2)\nimport Control.Monad.Rec.Class (class MonadRec, Step(..), tailRecM)\nimport Control.Monad.Trans.Class (class MonadTrans)\n\nimport Data.CatList (CatList, empty, snoc, uncons)\nimport Data.Either (Either(..))\nimport Data.Eq (class Eq1, eq1)\nimport Data.Foldable (class Foldable, foldMap, foldl, foldr)\nimport Data.Maybe (Maybe(..))\nimport Data.Ord (class Ord1, compare1)\nimport Data.Traversable (class Traversable, traverse)\nimport Data.Tuple (Tuple(..))\n\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | The free monad for a type constructor `f`.\n-- |\n-- | Implemented in the spirit of [Reflection without Remorse](http://okmij.org/ftp/Haskell/zseq.pdf),\n-- | the free monad is represented using a sequential data structure in\n-- | order to overcome the quadratic complexity of left-associated binds\n-- | and traversal through the free monad structure.\ndata Free f a = Free (FreeView f Val Val) (CatList (ExpF f))\n\nnewtype ExpF f = ExpF (Val -> Free f Val)\n\ndata FreeView f a b = Return a | Bind (f b) (b -> Free f a)\n\ndata Val\n\ninstance eqFree :: (Functor f, Eq1 f, Eq a) => Eq (Free f a) where\n  eq x y = case resume x, resume y of\n    Left fa, Left fb -> eq1 fa fb\n    Right a, Right b -> a == b\n    _, _ -> false\n\ninstance eq1Free :: (Functor f, Eq1 f) => Eq1 (Free f) where\n  eq1 = eq\n\ninstance ordFree :: (Functor f, Ord1 f, Ord a) => Ord (Free f a) where\n  compare x y = case resume x, resume y of\n    Left fa, Left fb -> compare1 fa fb\n    Left _, _ -> LT\n    _, Left _ -> GT\n    Right a, Right b -> compare a b\n\ninstance ord1Free :: (Functor f, Ord1 f) => Ord1 (Free f) where\n  compare1 = compare\n\ninstance freeFunctor :: Functor (Free f) where\n  map k f = pure <<< k =<< f\n\ninstance freeBind :: Bind (Free f) where\n  bind (Free v s) k = Free v (snoc s (ExpF (unsafeCoerceBind k)))\n    where\n    unsafeCoerceBind :: forall a b. (a -> Free f b) -> Val -> Free f Val\n    unsafeCoerceBind = unsafeCoerce\n\ninstance freeApplicative :: Applicative (Free f) where\n  pure = fromView <<< Return\n\ninstance freeApply :: Apply (Free f) where\n  apply = ap\n\ninstance freeMonad :: Monad (Free f)\n\ninstance freeMonadTrans :: MonadTrans Free where\n  lift = liftF\n\ninstance freeMonadRec :: MonadRec (Free f) where\n  tailRecM k a = k a >>= case _ of\n    Loop b -> tailRecM k b\n    Done r -> pure r\n\ninstance foldableFree :: (Functor f, Foldable f) => Foldable (Free f) where\n  foldMap f = go\n    where\n    go = resume >>> case _ of\n      Left fa -> foldMap go fa\n      Right a -> f a\n  foldl f = go\n    where\n    go r = resume >>> case _  of\n      Left fa -> foldl go r fa\n      Right a -> f r a\n  foldr f = go\n    where\n    go r = resume >>> case _ of\n      Left fa -> foldr (flip go) r fa\n      Right a -> f a r\n\ninstance traversableFree :: Traversable f => Traversable (Free f) where\n  traverse f = go\n    where\n    go = resume >>> case _ of\n      Left fa -> join <<< liftF <$> traverse go fa\n      Right a -> pure <$> f a\n  sequence tma = traverse identity tma\n\ninstance semigroupFree :: Semigroup a => Semigroup (Free f a) where\n  append = lift2 append\n\ninstance monoidFree :: Monoid a => Monoid (Free f a) where\n  mempty = pure mempty\n  \n-- | Lift an impure value described by the generating type constructor `f` into\n-- | the free monad.\nliftF :: forall f. f ~> Free f\nliftF f = fromView (Bind (unsafeCoerceF f) (pure <<< unsafeCoerceVal))\n  where\n  unsafeCoerceF :: forall a. f a -> f Val\n  unsafeCoerceF = unsafeCoerce\n\n  unsafeCoerceVal :: forall a. Val -> a\n  unsafeCoerceVal = unsafeCoerce\n\n-- | Add a layer.\nwrap :: forall f a. f (Free f a) -> Free f a\nwrap f = fromView (Bind (unsafeCoerceF f) unsafeCoerceVal)\n  where\n  unsafeCoerceF :: forall b. f (Free f b) -> f Val\n  unsafeCoerceF = unsafeCoerce\n\n  unsafeCoerceVal :: forall b. Val -> Free f b\n  unsafeCoerceVal = unsafeCoerce\n\n-- | Suspend a value given the applicative functor `f` into the free monad.\nsuspendF :: forall f. Applicative f => Free f ~> Free f\nsuspendF f = wrap (pure f)\n\n-- | Use a natural transformation to change the generating type constructor of a\n-- | free monad.\nhoistFree :: forall f g. (f ~> g) -> Free f ~> Free g\nhoistFree k = substFree (liftF <<< k)\n\n-- | Run a free monad with a natural transformation from the type constructor `f`\n-- | to the tail-recursive monad `m`. See the `MonadRec` type class for more\n-- | details.\nfoldFree :: forall f m. MonadRec m => (f ~> m) -> Free f ~> m\nfoldFree k = tailRecM go\n  where\n  go :: forall a. Free f a -> m (Step (Free f a) a)\n  go f = case toView f of\n    Return a -> Done <$> pure a\n    Bind g i -> (Loop <<< i) <$> k g\n\n-- | Like `foldFree`, but for folding into some other Free monad without the\n-- | overhead that `MonadRec` incurs.\nsubstFree :: forall f g. (f ~> Free g) -> Free f ~> Free g\nsubstFree k = go\n  where\n  go :: Free f ~> Free g\n  go f = case toView f of\n    Return a -> pure a\n    Bind g i -> k g >>= go <$> i\n\n-- | Run a free monad with a function that unwraps a single layer of the functor\n-- | `f` at a time.\nrunFree :: forall f a. Functor f => (f (Free f a) -> Free f a) -> Free f a -> a\nrunFree k = go\n  where\n  go :: Free f a -> a\n  go f = case toView f of\n    Return a -> a\n    Bind g i -> go (k (i <$> g))\n\n-- | Run a free monad with a function mapping a functor `f` to a tail-recursive\n-- | monad `m`. See the `MonadRec` type class for more details.\nrunFreeM\n  :: forall f m a\n   . Functor f\n  => MonadRec m\n  => (f (Free f a) -> m (Free f a))\n  -> Free f a\n  -> m a\nrunFreeM k = tailRecM go\n  where\n  go :: Free f a -> m (Step (Free f a) a)\n  go f = case toView f of\n    Return a -> Done <$> pure a\n    Bind g i -> Loop <$> k (i <$> g)\n\n-- | Unwraps a single layer of the functor `f`.\nresume\n  :: forall f a\n   . Functor f\n  => Free f a\n  -> Either (f (Free f a)) a\nresume = resume' (\\g i -> Left (i <$> g)) Right\n\n-- | Unwraps a single layer of `f`, providing the continuation.\nresume'\n  :: forall f a r\n   . (forall b. f b -> (b -> Free f a) -> r)\n  -> (a -> r)\n  -> Free f a\n  -> r\nresume' k j f = case toView f of\n  Return a -> j a\n  Bind g i -> k g i\n\nfromView :: forall f a. FreeView f a Val -> Free f a\nfromView f = Free (unsafeCoerceFreeView f) empty\n  where\n  unsafeCoerceFreeView :: FreeView f a Val -> FreeView f Val Val\n  unsafeCoerceFreeView = unsafeCoerce\n\ntoView :: forall f a. Free f a -> FreeView f a Val\ntoView (Free v s) =\n  case v of\n    Return a ->\n      case uncons s of\n        Nothing ->\n          Return (unsafeCoerceVal a)\n        Just (Tuple h t) ->\n          toView (unsafeCoerceFree (concatF ((runExpF h) a) t))\n    Bind f k ->\n      Bind f (\\a -> unsafeCoerceFree (concatF (k a) s))\n  where\n  concatF :: Free f Val -> CatList (ExpF f) -> Free f Val\n  concatF (Free v' l) r = Free v' (l <> r)\n\n  runExpF :: ExpF f -> (Val -> Free f Val)\n  runExpF (ExpF k) = k\n\n  unsafeCoerceFree :: Free f Val -> Free f a\n  unsafeCoerceFree = unsafeCoerce\n\n  unsafeCoerceVal :: Val -> a\n  unsafeCoerceVal = unsafeCoerce\n", "module Halogen.Query.ChildQuery where\n\nimport Prelude\n\nimport Data.Maybe (Maybe)\nimport Halogen.Data.Slot (SlotStorage)\nimport Unsafe.Coerce (unsafeCoerce)\n\ndata ChildQueryBox :: Row Type -> Type -> Type\ndata ChildQueryBox (ps :: Row Type) a\n\ndata ChildQuery ps g o a f b =\n  ChildQuery\n    (forall slot m. Applicative m => (slot g o -> m (Maybe b)) -> SlotStorage ps slot -> m (f b))\n    (g b)\n    (f b -> a)\n\ninstance functorChildQuery :: Functor (ChildQueryBox ps) where\n  map f = unChildQueryBox \\(ChildQuery u q k) ->\n    mkChildQueryBox (ChildQuery u q (f <<< k))\n\nmkChildQueryBox\n  :: forall ps g o a f b\n   . ChildQuery ps g o a f b\n  -> ChildQueryBox ps a\nmkChildQueryBox = unsafeCoerce\n\nunChildQueryBox\n  :: forall ps a r\n   . (forall g o f b. ChildQuery ps g o a f b -> r)\n  -> ChildQueryBox ps a\n  -> r\nunChildQueryBox = unsafeCoerce\n", "export function reallyUnsafeRefEq(a) {\n  return function (b) {\n    return a === b;\n  };\n}\n", "module Unsafe.Reference\n  ( unsafeRefEq\n  , reallyUnsafeRefEq\n  , UnsafeRefEq(..)\n  , UnsafeRefEqFallback(..)\n  ) where\n\nimport Prelude\n\n-- | Compares two values of the same type using strict (`===`) equality.\nunsafeRefEq :: forall a. a -> a -> Boolean\nunsafeRefEq = reallyUnsafeRefEq\n\n-- | Compares two values of different types using strict (`===`) equality.\nforeign import reallyUnsafeRefEq :: forall a b. a -> b -> Boolean\n\n-- | The `Eq` instance is defined by `unsafeRefEq`.\nnewtype UnsafeRefEq a = UnsafeRefEq a\n\ninstance eqUnsafeRefEq :: Eq (UnsafeRefEq a) where\n  eq (UnsafeRefEq l) (UnsafeRefEq r) = unsafeRefEq l r\n\n-- | The `Eq` instance first checks `unsafeRefEq`, if `false` falls back to\n-- | the underlying `Eq` instance.\nnewtype UnsafeRefEqFallback a = UnsafeRefEqFallback a\n\ninstance eqUnsafeRefEqFallback ::\n  Eq a =>\n  Eq (UnsafeRefEqFallback a) where\n  eq (UnsafeRefEqFallback l) (UnsafeRefEqFallback r) =\n    unsafeRefEq l r || l == r\n\n", "module Halogen.Subscription\n  ( SubscribeIO(..)\n  , create\n  , Listener\n  , notify\n  , Emitter\n  , makeEmitter\n  , Subscription\n  , subscribe\n  , unsubscribe\n  , fold\n  , filter\n  , fix\n  ) where\n\nimport Prelude\n\nimport Control.Alt (class Alt)\nimport Control.Alternative (class Alternative)\nimport Control.Apply (lift2)\nimport Control.Plus (class Plus)\nimport Data.Array (deleteBy)\nimport Data.Foldable (traverse_)\nimport Data.Functor.Contravariant (class Contravariant)\nimport Data.Maybe (Maybe(..))\nimport Effect (Effect)\nimport Effect.Ref as Ref\nimport Effect.Unsafe (unsafePerformEffect)\nimport Safe.Coerce (coerce)\nimport Unsafe.Reference (unsafeRefEq)\n\n-- | A paired `Listener` and `Emitter` produced with the `create` function.\ntype SubscribeIO a =\n  { listener :: Listener a\n  , emitter :: Emitter a\n  }\n\n-- | Create a paired `Listener` and `Emitter`, where you can push values to\n-- | the listener and subscribe to values from the emitter.\n-- |\n-- | ```purs\n-- | { emitter, listener } <- create\n-- |\n-- | -- Push values into the listener:\n-- | notify listener \"hello\"\n-- |\n-- | -- Subscribe to outputs from the emitter with a callback:\n-- | subscription <- subscribe emitter \\value ->\n-- |   Console.log value\n-- |\n-- | -- Unsubscribe at any time:\n-- | unsubscribe subscription\n-- | ```\ncreate :: forall a. Effect (SubscribeIO a)\ncreate = do\n  subscribers <- Ref.new []\n  pure\n    { emitter: Emitter \\k -> do\n        Ref.modify_ (_ <> [k]) subscribers\n        pure $ Subscription do\n          Ref.modify_ (deleteBy unsafeRefEq k) subscribers\n    , listener: Listener \\a -> do\n        Ref.read subscribers >>= traverse_ \\k -> k a\n    }\n\n-- | An `Emitter` represents a collection of discrete occurrences of an event;\n-- | conceptually, an emitter is a possibly-infinite list of values.\n-- |\n-- | Emitters are created from real events like timers or mouse clicks and can\n-- | be combined or transformed with the functions and instances in this module.\n-- |\n-- | Emitters are consumed by providing a callback via the `subscribe` function.\nnewtype Emitter a = Emitter ((a -> Effect Unit) -> Effect Subscription)\n\ninstance functorEmitter :: Functor Emitter where\n  map f (Emitter e) = Emitter \\k -> e (k <<< f)\n\ninstance applyEmitter :: Apply Emitter where\n  apply (Emitter e1) (Emitter e2) = Emitter \\k -> do\n    latestA <- Ref.new Nothing\n    latestB <- Ref.new Nothing\n    Subscription c1 <- e1 \\a -> do\n      Ref.write (Just a) latestA\n      Ref.read latestB >>= traverse_ (k <<< a)\n    Subscription c2 <- e2 \\b -> do\n      Ref.write (Just b) latestB\n      Ref.read latestA >>= traverse_ (k <<< (_ $ b))\n    pure (Subscription (c1 *> c2))\n\ninstance applicativeEmitter :: Applicative Emitter where\n  pure a = Emitter \\k -> do\n    k a\n    pure (Subscription (pure unit))\n\ninstance altEmitter :: Alt Emitter where\n  alt (Emitter f) (Emitter g) = Emitter \\k -> do\n    Subscription c1 <- f k\n    Subscription c2 <- g k\n    pure (Subscription (c1 *> c2))\n\ninstance plusEmitter :: Plus Emitter where\n  empty = Emitter \\_ -> pure (Subscription (pure unit))\n\ninstance alternativeEmitter :: Alternative Emitter\n\ninstance semigroupEmitter :: Semigroup a => Semigroup (Emitter a) where\n  append = lift2 append\n\ninstance monoidEmitter :: Monoid a => Monoid (Emitter a) where\n  mempty = Emitter mempty\n\n-- | Make an `Emitter` from a function which accepts a callback and returns an\n-- | unsubscription function.\n-- |\n-- | Note: You should use `create` unless you need explicit control over\n-- | unsubscription.\nmakeEmitter\n  :: forall a\n   . ((a -> Effect Unit) -> Effect (Effect Unit))\n  -> Emitter a\nmakeEmitter = coerce\n\n-- | Conceptually, a `Listener` represents an input source to an `Emitter`. You\n-- | can push a value to its paired emitter with the `notify` function.\nnewtype Listener a = Listener (a -> Effect Unit)\n\ninstance contravariantListener :: Contravariant Listener where\n  cmap f (Listener g) = coerce (g <<< f)\n\n-- | Push a value to the `Emitter` paired with the provided `Listener` argument.\n-- |\n-- | ```purs\n-- | -- Create an emitter and listener with `create`:\n-- | { emitter, listener } <- create\n-- |\n-- | -- Then, push values to the emitter via the listener with `notify`:\n-- | notify listener \"hello\"\n-- | ```\nnotify :: forall a. Listener a -> a -> Effect Unit\nnotify (Listener f) a = f a\n\n-- | A `Subscription` results from subscribing to an `Emitter` with `subscribe`;\n-- | the subscription can be ended at any time with `unsubscribe`.\nnewtype Subscription = Subscription (Effect Unit)\n\nderive newtype instance semigroupSubscription :: Semigroup Subscription\nderive newtype instance monoidSubscription :: Monoid Subscription\n\n-- | Subscribe to an `Emitter` by providing a callback to run on values produced\n-- | by the emitter:\n-- |\n-- | ```purs\n-- | -- Produce an emitter / listener pair with `create`:\n-- | { emitter, listener } <- create\n-- |\n-- | -- Then, subscribe to the emitter by providing a callback:\n-- | subscription <- subscribe emitter \\emitted ->\n-- |   doSomethingWith emitted\n-- |\n-- | -- End the subscription at any time with `unsubscribe`:\n-- | unsubscribe subscription\n-- | ```\nsubscribe\n  :: forall r a\n   . Emitter a\n  -> (a -> Effect r)\n  -> Effect Subscription\nsubscribe (Emitter e) k = e (void <<< k)\n\n-- | End a subscription to an `Emitter`.\nunsubscribe :: Subscription -> Effect Unit\nunsubscribe (Subscription unsub) = unsub\n\n-- | Fold over values received from some `Emitter`, creating a new `Emitter`.\nfold :: forall a b. (a -> b -> b) -> Emitter a -> b -> Emitter b\nfold f (Emitter e) b = Emitter \\k -> do\n  result <- Ref.new b\n  e \\a -> Ref.modify (f a) result >>= k\n\n-- | Create an `Emitter` which only fires when a predicate holds.\nfilter :: forall a. (a -> Boolean) -> Emitter a -> Emitter a\nfilter p (Emitter e) = Emitter \\k -> e \\a -> if p a then k a else pure unit\n\n-- | Compute a fixed point.\nfix :: forall i o. (Emitter i -> { input :: Emitter i, output :: Emitter o }) -> Emitter o\nfix f = Emitter \\k -> do\n  Subscription c1 <- subscribe input (notify listener)\n  Subscription c2 <- subscribe output k\n  pure (Subscription (c1 *> c2))\n  where\n  { emitter, listener } = unsafePerformEffect create\n  { input, output } = f emitter\n", "module Halogen.Query.HalogenM where\n\nimport Prelude\n\nimport Control.Applicative.Free (FreeAp, liftFreeAp, hoistFreeAp)\nimport Control.Monad.Error.Class (class MonadThrow, throwError)\nimport Control.Monad.Free (Free, hoistFree, liftF)\nimport Control.Monad.Reader.Class (class MonadAsk, ask)\nimport Control.Monad.Rec.Class (class MonadRec, tailRecM, Step(..))\nimport Control.Monad.State.Class (class MonadState)\nimport Control.Monad.Trans.Class (class MonadTrans)\nimport Control.Monad.Writer.Class (class MonadTell, tell)\nimport Control.Parallel.Class (class Parallel)\nimport Data.Bifunctor (lmap)\nimport Data.FoldableWithIndex (foldrWithIndex)\nimport Data.Map (Map)\nimport Data.Map as Map\nimport Data.Maybe (Maybe(..), maybe)\nimport Data.Newtype (class Newtype, over)\nimport Data.Symbol (class IsSymbol)\nimport Data.Traversable (traverse)\nimport Data.Tuple (Tuple)\nimport Effect.Aff.Class (class MonadAff, liftAff)\nimport Effect.Class (class MonadEffect, liftEffect)\nimport Halogen.Data.Slot (Slot)\nimport Halogen.Data.Slot as Slot\nimport Halogen.Query.ChildQuery as CQ\nimport Halogen.Query.Input (RefLabel)\nimport Halogen.Subscription as HS\nimport Prim.Row as Row\nimport Type.Proxy (Proxy)\nimport Web.DOM (Element)\n\n-- | The Halogen component eval algebra.\n-- |\n-- | - `state` is the component's state\n-- | - `action` is the type of actions; events internal to the component that\n-- |   can be evaluated\n-- | - `slots` is the set of slots for addressing child components\n-- | - `output` is the type of output messages the component can raise\n-- | - `m` is the monad used during evaluation\n-- | - `a` is the result of the HalogenF expression (see HalogenM for an example).\ndata HalogenF state action slots output m a\n  = State (state -> Tuple a state)\n  | Subscribe (SubscriptionId -> HS.Emitter action) (SubscriptionId -> a)\n  | Unsubscribe SubscriptionId a\n  | Lift (m a)\n  | ChildQuery (CQ.ChildQueryBox slots a)\n  | Raise output a\n  | Par (HalogenAp state action slots output m a)\n  | Fork (HalogenM state action slots output m Unit) (ForkId -> a)\n  | Join ForkId a\n  | Kill ForkId a\n  | GetRef RefLabel (Maybe Element -> a)\n\ninstance functorHalogenF :: Functor m => Functor (HalogenF state action slots output m) where\n  map f = case _ of\n    State k -> State (lmap f <<< k)\n    Subscribe fes k -> Subscribe fes (f <<< k)\n    Unsubscribe sid a -> Unsubscribe sid (f a)\n    Lift q -> Lift (map f q)\n    ChildQuery cq -> ChildQuery (map f cq)\n    Raise o a -> Raise o (f a)\n    Par pa -> Par (map f pa)\n    Fork hmu k -> Fork hmu (f <<< k)\n    Join fid a -> Join fid (f a)\n    Kill fid a -> Kill fid (f a)\n    GetRef p k -> GetRef p (f <<< k)\n\n-- | The Halogen component eval effect monad.\n-- |\n-- | - `state` is the component's state\n-- | - `action` is the type of actions; events internal to the component that\n-- |   can be evaluated\n-- | - `slots` is the set of slots for addressing child components\n-- | - `output` is the type of output messages the component can raise\n-- | - `m` is the monad used during evaluation\n-- | - `a` is the result of the HalogenM expression. Use the following pattern:\n-- |     `handleAction :: Action -> H.HalogenM State Action Slots Output m Unit`\n-- |     `handleQuery  :: forall a. Query a -> H.HalogenM State Action Slots Output m (Maybe a)`\nnewtype HalogenM state action slots output m a = HalogenM (Free (HalogenF state action slots output m) a)\n\nderive newtype instance functorHalogenM :: Functor (HalogenM state action slots output m)\nderive newtype instance applyHalogenM :: Apply (HalogenM state action slots output m)\nderive newtype instance applicativeHalogenM :: Applicative (HalogenM state action slots output m)\nderive newtype instance bindHalogenM :: Bind (HalogenM state action slots output m)\nderive newtype instance monadHalogenM :: Monad (HalogenM state action slots output m)\nderive newtype instance semigroupHalogenM :: Semigroup a => Semigroup (HalogenM state action slots output m a)\nderive newtype instance monoidHalogenM :: Monoid a => Monoid (HalogenM state action slots output m a)\n\ninstance monadEffectHalogenM :: MonadEffect m => MonadEffect (HalogenM state action slots output m) where\n  liftEffect = HalogenM <<< liftF <<< Lift <<< liftEffect\n\ninstance monadAffHalogenM :: MonadAff m => MonadAff (HalogenM state action slots output m) where\n  liftAff = HalogenM <<< liftF <<< Lift <<< liftAff\n\ninstance parallelHalogenM :: Parallel (HalogenAp state action slots output m) (HalogenM state action slots output m) where\n  parallel = HalogenAp <<< liftFreeAp\n  sequential = HalogenM <<< liftF <<< Par\n\ninstance monadTransHalogenM :: MonadTrans (HalogenM state action slots o) where\n  lift = HalogenM <<< liftF <<< Lift\n\ninstance monadRecHalogenM :: MonadRec (HalogenM state action slots output m) where\n  tailRecM k a = k a >>= case _ of\n    Loop x -> tailRecM k x\n    Done y -> pure y\n\ninstance monadStateHalogenM :: MonadState state (HalogenM state action slots output m) where\n  state = HalogenM <<< liftF <<< State\n\ninstance monadAskHalogenM :: MonadAsk r m => MonadAsk r (HalogenM state action slots output m) where\n  ask = HalogenM $ liftF $ Lift ask\n\ninstance monadTellHalogenM :: MonadTell w m => MonadTell w (HalogenM state action slots output m) where\n  tell = HalogenM <<< liftF <<< Lift <<< tell\n\ninstance monadThrowHalogenM :: MonadThrow e m => MonadThrow e (HalogenM state action slots output m) where\n  throwError = HalogenM <<< liftF <<< Lift <<< throwError\n\n-- | An applicative-only version of `HalogenM` to allow for parallel evaluation.\nnewtype HalogenAp state action slots output m a = HalogenAp (FreeAp (HalogenM state action slots output m) a)\n\nderive instance newtypeHalogenAp :: Newtype (HalogenAp state query slots output m a) _\nderive newtype instance functorHalogenAp :: Functor (HalogenAp state query slots output m)\nderive newtype instance applyHalogenAp :: Apply (HalogenAp state query slots output m)\nderive newtype instance applicativeHalogenAp :: Applicative (HalogenAp state query slots output m)\n\n-- | Raises an output message for the component.\nraise :: forall state action slots output m. output -> HalogenM state action slots output m Unit\nraise o = HalogenM $ liftF $ Raise o unit\n\n-- | Sends a query to a child of a component at the specified slot.\nquery\n  :: forall state action output m label slots query output' slot a _1\n   . Row.Cons label (Slot query output' slot) _1 slots\n  => IsSymbol label\n  => Ord slot\n  => Proxy label\n  -> slot\n  -> query a\n  -> HalogenM state action slots output m (Maybe a)\nquery label p q = HalogenM $ liftF $ ChildQuery $ CQ.mkChildQueryBox $\n  CQ.ChildQuery (\\k -> maybe (pure Nothing) k <<< Slot.lookup label p) q identity\n\n-- | Sends a query to all children of a component at a given slot label.\nqueryAll\n  :: forall state action output m label slots query output' slot a _1\n   . Row.Cons label (Slot query output' slot) _1 slots\n  => IsSymbol label\n  => Ord slot\n  => Proxy label\n  -> query a\n  -> HalogenM state action slots output m (Map slot a)\nqueryAll label q =\n  HalogenM $ liftF $ ChildQuery $ CQ.mkChildQueryBox $\n    CQ.ChildQuery (\\k -> map catMapMaybes <<< traverse k <<< Slot.slots label) q identity\n  where\n  catMapMaybes :: forall k v. Ord k => Map k (Maybe v) -> Map k v\n  catMapMaybes = foldrWithIndex (\\k v acc -> maybe acc (flip (Map.insert k) acc) v) Map.empty\n\n-- | The ID value associated with a subscription. Allows the subscription to be\n-- | stopped at a later time.\nnewtype SubscriptionId = SubscriptionId Int\n\nderive newtype instance eqSubscriptionId :: Eq SubscriptionId\nderive newtype instance ordSubscriptionId :: Ord SubscriptionId\n\n-- | Subscribes a component to an `Emitter`.\n-- |\n-- | When a component is disposed of any active subscriptions will automatically\n-- | be stopped and no further subscriptions will be possible during\n-- | finalization.\nsubscribe :: forall state action slots output m. HS.Emitter action -> HalogenM state action slots output m SubscriptionId\nsubscribe es = HalogenM $ liftF $ Subscribe (\\_ -> es) identity\n\n-- | An alternative to `subscribe`, intended for subscriptions that unsubscribe\n-- | themselves. Instead of returning the `SubscriptionId` from `subscribe'`, it\n-- | is passed into an `Emitter` constructor. This allows emitted queries\n-- | to include the `SubscriptionId`, rather than storing it in the state of the\n-- | component.\n-- |\n-- | When a component is disposed of any active subscriptions will automatically\n-- | be stopped and no further subscriptions will be possible during\n-- | finalization.\nsubscribe' :: forall state action slots output m. (SubscriptionId -> HS.Emitter action) -> HalogenM state action slots output m Unit\nsubscribe' esc = HalogenM $ liftF $ Subscribe esc (const unit)\n\n-- | Unsubscribes a component from a subscription. If the subscription associated\n-- | with the ID has already ended this will have no effect.\nunsubscribe :: forall state action slots output m. SubscriptionId -> HalogenM state action slots output m Unit\nunsubscribe sid = HalogenM $ liftF $ Unsubscribe sid unit\n\n-- | The ID value associated with a forked process. Allows the fork to be killed\n-- | at a later time.\nnewtype ForkId = ForkId Int\n\nderive newtype instance eqForkId :: Eq ForkId\nderive newtype instance ordForkId :: Ord ForkId\n\n-- | Starts a `HalogenM` process running independent from the current `eval`\n-- | \"thread\".\n-- |\n-- | A commonly use case for `fork` is in component initializers where some\n-- | async action is started. Normally all interaction with the component will\n-- | be blocked until the initializer completes, but if the async action is\n-- | `fork`ed instead, the initializer can complete synchronously while the\n-- | async action continues.\n-- |\n-- | Some care needs to be taken when using a `fork` that can modify the\n-- | component state, as it's easy for the forked process to \"clobber\" the state\n-- | (overwrite some or all of it with an old value) by mistake.\n-- |\n-- | When a component is disposed of any active forks will automatically\n-- | be killed. New forks can be started during finalization but there will be\n-- | no means of killing them.\nfork :: forall state action slots output m. HalogenM state action slots output m Unit -> HalogenM state action slots output m ForkId\nfork hmu = HalogenM $ liftF $ Fork hmu identity\n\n-- | Joins a forked process. Attempting to join a forked process that has\n-- | already ended will result in eval continuing immediately. Attempting\n-- | to join a forked process that has been killed will also terminate the\n-- | current eval.\njoin :: forall state action slots output m. ForkId -> HalogenM state action slots output m Unit\njoin fid = HalogenM $ liftF $ Join fid unit\n\n-- | Kills a forked process if it is still running. Attempting to kill a forked\n-- | process that has already ended will have no effect.\nkill :: forall state action slots output m. ForkId -> HalogenM state action slots output m Unit\nkill fid = HalogenM $ liftF $ Kill fid unit\n\n-- | Retrieves an `Element` value that is associated with a `Ref` in the\n-- | rendered output of a component. If there is no currently rendered value for\n-- | the requested ref this will return `Nothing`.\ngetRef :: forall state action slots output m. RefLabel -> HalogenM state action slots output m (Maybe Element)\ngetRef p = HalogenM $ liftF $ GetRef p identity\n\nimapState\n  :: forall state state' action slots output m a\n   . (state -> state')\n  -> (state' -> state)\n  -> HalogenM state action slots output m a\n  -> HalogenM state' action slots output m a\nimapState f f' (HalogenM h) = HalogenM (hoistFree go h)\n  where\n  go :: HalogenF state action slots output m ~> HalogenF state' action slots output m\n  go = case _ of\n    State fs -> State (map f <<< fs <<< f')\n    Subscribe fes k -> Subscribe fes k\n    Unsubscribe sid a -> Unsubscribe sid a\n    Lift q -> Lift q\n    ChildQuery cq -> ChildQuery cq\n    Raise o a -> Raise o a\n    Par p -> Par (over HalogenAp (hoistFreeAp (imapState f f')) p)\n    Fork hmu k -> Fork (imapState f f' hmu) k\n    Join fid a -> Join fid a\n    Kill fid a -> Kill fid a\n    GetRef p k -> GetRef p k\n\nmapAction\n  :: forall state action action' slots output m a\n   . Functor m\n  => (action -> action')\n  -> HalogenM state action slots output m a\n  -> HalogenM state action' slots output m a\nmapAction f (HalogenM h) = HalogenM (hoistFree go h)\n  where\n  go :: HalogenF state action slots output m ~> HalogenF state action' slots output m\n  go = case _ of\n    State fs -> State fs\n    Subscribe fes k -> Subscribe (map f <<< fes) k\n    Unsubscribe sid a -> Unsubscribe sid a\n    Lift q -> Lift q\n    ChildQuery cq -> ChildQuery cq\n    Raise o a -> Raise o a\n    Par p -> Par (over HalogenAp (hoistFreeAp (mapAction f)) p)\n    Fork hmu k -> Fork (mapAction f hmu) k\n    Join fid a -> Join fid a\n    Kill fid a -> Kill fid a\n    GetRef p k -> GetRef p k\n\nmapOutput\n  :: forall state action slots output output' m a\n   . (output -> output')\n  -> HalogenM state action slots output m a\n  -> HalogenM state action slots output' m a\nmapOutput f (HalogenM h) = HalogenM (hoistFree go h)\n  where\n  go :: HalogenF state action slots output m ~> HalogenF state action slots output' m\n  go = case _ of\n    State fs -> State fs\n    Subscribe fes k -> Subscribe fes k\n    Unsubscribe sid a -> Unsubscribe sid a\n    Lift q -> Lift q\n    ChildQuery cq -> ChildQuery cq\n    Raise o a -> Raise (f o) a\n    Par p -> Par (over HalogenAp (hoistFreeAp (mapOutput f)) p)\n    Fork hmu k -> Fork (mapOutput f hmu) k\n    Join fid a -> Join fid a\n    Kill fid a -> Kill fid a\n    GetRef p k -> GetRef p k\n\nhoist\n  :: forall state action slots output m m' a\n   . Functor m'\n  => (m ~> m')\n  -> HalogenM state action slots output m a\n  -> HalogenM state action slots output m' a\nhoist nat (HalogenM fa) = HalogenM (hoistFree go fa)\n  where\n  go :: HalogenF state action slots output m ~> HalogenF state action slots output m'\n  go = case _ of\n    State f -> State f\n    Subscribe fes k -> Subscribe fes k\n    Unsubscribe sid a -> Unsubscribe sid a\n    Lift q -> Lift (nat q)\n    ChildQuery cq -> ChildQuery cq\n    Raise o a -> Raise o a\n    Par p -> Par (over HalogenAp (hoistFreeAp (hoist nat)) p)\n    Fork hmu k -> Fork (hoist nat hmu) k\n    Join fid a -> Join fid a\n    Kill fid a -> Kill fid a\n    GetRef p k -> GetRef p k\n", "module Halogen.Query.HalogenQ where\n\nimport Prelude\n\nimport Data.Bifunctor (class Bifunctor)\nimport Data.Coyoneda (Coyoneda)\n\ndata HalogenQ query action input a\n  = Initialize a\n  | Finalize a\n  | Receive input a\n  | Action action a\n  | Query (Coyoneda query a) (Unit -> a)\n\ninstance bifunctorHalogenQ :: Bifunctor (HalogenQ query action) where\n  bimap f g = case _ of\n    Initialize a -> Initialize (g a)\n    Finalize a -> Finalize (g a)\n    Receive i a -> Receive (f i) (g a)\n    Action action a -> Action action (g a)\n    Query fa k -> Query (map g fa) (map g k)\n\nderive instance functorHalogenQ :: Functor (HalogenQ query action input)\n", "module Halogen.VDom.Thunk\n  ( Thunk\n  , buildThunk\n  , runThunk\n  , hoist\n  , mapThunk\n  , thunked\n  , thunk1\n  , thunk2\n  , thunk3\n  ) where\n\nimport Prelude\n\nimport Data.Function.Uncurried as Fn\nimport Effect.Uncurried as EFn\nimport Halogen.VDom as V\nimport Halogen.VDom.Machine as M\nimport Halogen.VDom.Util as Util\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.DOM.Node (Node)\n\nforeign import data ThunkArg \u2237 Type\n\nforeign import data ThunkId \u2237 Type\n\ndata Thunk :: (Type -> Type) -> Type -> Type\ndata Thunk f i = Thunk ThunkId (Fn.Fn2 ThunkArg ThunkArg Boolean) (ThunkArg \u2192 f i) ThunkArg\n\nunsafeThunkId \u2237 \u2200 a. a \u2192 ThunkId\nunsafeThunkId = unsafeCoerce\n\ninstance functorThunk \u2237 Functor f \u21D2 Functor (Thunk f) where\n  map f (Thunk a b c d) = Thunk a b (c >>> map f) d\n\nhoist \u2237 \u2200 f g. (f ~> g) \u2192 Thunk f ~> Thunk g\nhoist = mapThunk\n\nmapThunk \u2237 \u2200 f g i j. (f i -> g j) \u2192 Thunk f i -> Thunk g j\nmapThunk k (Thunk a b c d) = Thunk a b (c >>> k) d\n\nthunk \u2237 \u2200 a f i. Fn.Fn4 ThunkId (Fn.Fn2 a a Boolean) (a \u2192 f i) a (Thunk f i)\nthunk = Fn.mkFn4 \\tid eqFn f a \u2192\n  Thunk tid\n    (unsafeCoerce eqFn \u2237 Fn.Fn2 ThunkArg ThunkArg Boolean)\n    (unsafeCoerce f \u2237 ThunkArg \u2192 f i)\n    (unsafeCoerce a \u2237 ThunkArg)\n\nthunked \u2237 \u2200 a f i. (a \u2192 a \u2192 Boolean) \u2192 (a \u2192 f i) \u2192 a \u2192 Thunk f i\nthunked eqFn f =\n  let\n    tid = unsafeThunkId { f }\n    eqFn' = Fn.mkFn2 eqFn\n  in\n    \\a \u2192 Fn.runFn4 thunk tid eqFn' f a\n\nthunk1 \u2237 \u2200 a f i. Fn.Fn2 (a \u2192 f i) a (Thunk f i)\nthunk1 = Fn.mkFn2 \\f a \u2192 Fn.runFn4 thunk (unsafeThunkId f) Util.refEq f a\n\nthunk2 \u2237 \u2200 a b f i. Fn.Fn3 (a \u2192 b \u2192 f i) a b (Thunk f i)\nthunk2 =\n  let\n    eqFn = Fn.mkFn2 \\a b \u2192\n      Fn.runFn2 Util.refEq a._1 b._1 &&\n      Fn.runFn2 Util.refEq a._2 b._2\n  in\n    Fn.mkFn3 \\f a b \u2192\n      Fn.runFn4 thunk (unsafeThunkId f) eqFn (\\{ _1, _2 } \u2192 f _1 _2) { _1: a, _2: b }\n\nthunk3 \u2237 \u2200 a b c f i. Fn.Fn4 (a \u2192 b \u2192 c \u2192 f i) a b c (Thunk f i)\nthunk3 =\n  let\n    eqFn = Fn.mkFn2 \\a b \u2192\n      Fn.runFn2 Util.refEq a._1 b._1 &&\n      Fn.runFn2 Util.refEq a._2 b._2 &&\n      Fn.runFn2 Util.refEq a._3 b._3\n  in\n    Fn.mkFn4 \\f a b c \u2192\n      Fn.runFn4 thunk (unsafeThunkId f) eqFn (\\{ _1, _2, _3 } \u2192 f _1 _2 _3) { _1: a, _2: b, _3: c }\n\nrunThunk \u2237 \u2200 f i. Thunk f i \u2192 f i\nrunThunk (Thunk _ _ render arg) = render arg\n\nunsafeEqThunk \u2237 \u2200 f i. Fn.Fn2 (Thunk f i) (Thunk f i) Boolean\nunsafeEqThunk = Fn.mkFn2 \\(Thunk a1 b1 _ d1) (Thunk a2 b2 _ d2) \u2192\n  Fn.runFn2 Util.refEq a1 a2 &&\n  Fn.runFn2 Util.refEq b1 b2 &&\n  Fn.runFn2 b1 d1 d2\n\ntype ThunkState :: (Type -> Type) -> Type -> Type -> Type -> Type\ntype ThunkState f i a w =\n  { thunk \u2237 Thunk f i\n  , vdom \u2237 M.Step (V.VDom a w) Node\n  }\n\nbuildThunk\n  \u2237 \u2200 f i a w\n  . (f i \u2192 V.VDom a w)\n  \u2192 V.VDomSpec a w\n  \u2192 V.Machine (Thunk f i) Node\nbuildThunk toVDom = renderThunk\n  where\n  renderThunk \u2237 V.VDomSpec a w \u2192 V.Machine (Thunk f i) Node\n  renderThunk spec = EFn.mkEffectFn1 \\t \u2192 do\n    vdom \u2190 EFn.runEffectFn1 (V.buildVDom spec) (toVDom (runThunk t))\n    pure $ M.mkStep $ M.Step (M.extract vdom) { thunk: t, vdom } patchThunk haltThunk\n\n  patchThunk \u2237 EFn.EffectFn2 (ThunkState f i a w) (Thunk f i) (V.Step (Thunk f i) Node)\n  patchThunk = EFn.mkEffectFn2 \\state t2 \u2192 do\n    let { vdom: prev, thunk: t1 } = state\n    if Fn.runFn2 unsafeEqThunk t1 t2\n      then pure $ M.mkStep $ M.Step (M.extract prev) state patchThunk haltThunk\n      else do\n        vdom \u2190 EFn.runEffectFn2 M.step prev (toVDom (runThunk t2))\n        pure $ M.mkStep $ M.Step (M.extract vdom) { vdom, thunk: t2 } patchThunk haltThunk\n\n  haltThunk \u2237 EFn.EffectFn1 (ThunkState f i a w) Unit\n  haltThunk = EFn.mkEffectFn1 \\state \u2192 do\n    EFn.runEffectFn1 M.halt state.vdom\n", "module Halogen.Component\n  ( Component\n  , ComponentSpec\n  , mkComponent\n  , unComponent\n  , hoist\n  , EvalSpec\n  , mkEval\n  , defaultEval\n  , ComponentSlotBox\n  , ComponentSlot(..)\n  , componentSlot\n  , ComponentSlotSpec\n  , mkComponentSlot\n  , unComponentSlot\n  , hoistSlot\n  ) where\n\nimport Prelude\n\nimport Data.Bifunctor (bimap, lmap)\nimport Data.Coyoneda (unCoyoneda)\nimport Data.Foldable (traverse_)\nimport Data.Maybe (Maybe(..), maybe)\nimport Data.Symbol (class IsSymbol)\nimport Data.Tuple (Tuple)\nimport Halogen.Data.Slot (Slot, SlotStorage)\nimport Halogen.Data.Slot as Slot\nimport Halogen.HTML.Core as HC\nimport Halogen.Query.HalogenM (HalogenM)\nimport Halogen.Query.HalogenM as HM\nimport Halogen.Query.HalogenQ (HalogenQ(..))\nimport Halogen.VDom.Thunk (Thunk)\nimport Halogen.VDom.Thunk as Thunk\nimport Prim.Row as Row\nimport Type.Proxy (Proxy)\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | The \"public\" type for a component, with details of the component internals\n-- | existentially hidden.\n-- |\n-- |   `HTML`\n-- | - `query` is the query algebra; the requests that can be made of the\n-- |   component\n-- | - `input` is the input value that will be received when the parent of\n-- |   this component renders\n-- | - `output` is the type of messages the component can raise\n-- | - `m` is the effect monad used during evaluation\ndata Component\n  (query :: Type -> Type)\n  (input :: Type)\n  (output :: Type)\n  (m :: Type -> Type)\n\n-- | The spec for a component.\n-- |\n-- | The type variables involved:\n-- | - `state` is the component's state\n-- | - `query` is the query algebra; the requests that can be made of the\n-- |   component\n-- | - `action` is the type of actions; messages internal to the component that\n-- |   can be evaluated\n-- | - `slots` is the set of slots for addressing child components\n-- | - `input` is the input value that will be received when the parent of\n-- |   this component renders\n-- | - `output` is the type of messages the component can raise\n-- | - `m` is the effect monad used during evaluation\n-- |\n-- | The values in the record:\n-- | - `initialState` is a function that accepts an input value and produces the\n-- |   state the component will start with. If the input value is unused\n-- |   (`Unit`), or irrelevant to the state construction, this will often be\n-- |   `const ?someInitialStateValue`.\n-- | - `render` is a function that accepts the component's current state and\n-- |   produces a value to render (`HTML` usually). The rendered output can\n-- |   raise actions that will be handled in `eval`.\n-- | - `eval` is a function that handles the `HalogenQ` algebra that deals with\n-- |   component lifecycle, handling actions, and responding to requests.\ntype ComponentSpec state query action slots input output m =\n  { initialState :: input -> state\n  , render :: state -> HC.HTML (ComponentSlot slots m action) action\n  , eval :: HalogenQ query action input ~> HalogenM state action slots output m\n  }\n\n-- | Constructs a [`Component`](#t:Component) from a [`ComponentSpec`](#t:ComponentSpec).\nmkComponent\n  :: forall state query action slots input output m\n   . ComponentSpec state query action slots input output m\n  -> Component query input output m\nmkComponent = unsafeCoerce\n\n-- | Exposes the inner details of a [`Component`](#t:Component) to a function\n-- | to produce a new result.\n-- |\n-- | The hidden details will not be allowed to be revealed in the result\n-- | of the function - if any of the hidden types (state, action, set of slots)\n-- | appear in the result, the compiler will complain about an escaped skolem.\nunComponent\n  :: forall query input output m a\n   . (forall state action slots. ComponentSpec state query action slots input output m -> a)\n  -> Component query input output m\n  -> a\nunComponent = unsafeCoerce\n\n-- | Changes the [`Component`](#t:Component)'s `m` type. A use case for this\n-- | might be to interpret some `Free` monad as `Aff` so the component can be\n-- | used with `runUI`.\nhoist\n  :: forall query input output m m'\n   . Functor m'\n  => (m ~> m')\n  -> Component query input output m\n  -> Component query input output m'\nhoist nat = unComponent \\c ->\n  mkComponent\n    { initialState: c.initialState\n    , render: lmap (hoistSlot nat) <<< c.render\n    , eval: HM.hoist nat <<< c.eval\n    }\n\n-- | The spec record that `mkEval` accepts to construct a component `eval`\n-- | function.\n-- |\n-- | It's not a requirement to use `mkEval`, and sometimes it's preferrable\n-- | to write a component `eval` function from scratch, but often `mkEval` is\n-- | more convenient for common cases.\n-- |\n-- | See below for more details about `mkEval` and `defaultEval`.\ntype EvalSpec state query action slots input output m =\n  { handleAction :: action -> HalogenM state action slots output m Unit\n  , handleQuery :: forall a. query a -> HalogenM state action slots output m (Maybe a)\n  , receive :: input -> Maybe action\n  , initialize :: Maybe action\n  , finalize :: Maybe action\n  }\n\n-- | A default value for `mkEval` that will result in an `eval` that nothing at\n-- | all - all incoming actions and queries will be ignored, and no receiver,\n-- | initializer, or finalizer will be specified.\n-- |\n-- | Usually this will be used with record update syntax to override fields to\n-- | specify things as needed. If a component only needs to handle actions,\n-- | for instance, a usage might be something like this:\n-- |\n-- | ```purescript\n-- | H.mkComponent\n-- |   { initialState\n-- |   , render\n-- |   , eval: H.mkEval (H.defaultEval { handleAction = ?handleAction })\n-- |   }\n-- | ```\ndefaultEval :: forall state query action slots input output m. EvalSpec state query action slots input output m\ndefaultEval =\n  { handleAction: const (pure unit)\n  , handleQuery: const (pure Nothing)\n  , receive: const Nothing\n  , initialize: Nothing\n  , finalize: Nothing\n  }\n\n-- | Accepts an `EvalSpec` to produce an `eval` function for a component. For\n-- | example:\n-- |\n-- | ```purescript\n-- | -- use `defaultEval` and override fields selectively\n-- | H.mkEval (H.defaultEval { handleAction = ?handleAction })\n-- |\n-- | -- or specify all the fields in the `EvalSpec`\n-- | H.mkEval\n-- |   { handleAction: ?handleAction\n-- |   , handleQuery: ?handleQuery\n-- |   , receive: ?receive\n-- |   , initialize: ?initialize\n-- |   , finalize: ?finalize\n-- |   }\n-- | ```\nmkEval\n  :: forall state query action slots input output m a\n   . EvalSpec state query action slots input output m\n  -> HalogenQ query action input a\n  -> HalogenM state action slots output m a\nmkEval args = case _ of\n  Initialize a ->\n    traverse_ args.handleAction args.initialize $> a\n  Finalize a ->\n    traverse_ args.handleAction args.finalize $> a\n  Receive i a ->\n    traverse_ args.handleAction (args.receive i) $> a\n  Action action a ->\n    args.handleAction action $> a\n  Query req f ->\n    unCoyoneda (\\g -> map (maybe (f unit) g) <<< args.handleQuery) req\n\n-- | A slot for a child component in a component's rendered content.\ndata ComponentSlotBox\n  (slots :: Row Type)\n  (m :: Type -> Type)\n  (action :: Type)\n\ninstance functorComponentSlotBox :: Functor (ComponentSlotBox slots m) where\n  map f = unComponentSlot \\slot ->\n    mkComponentSlot $ slot { output = map f <$> slot.output }\n\ndata ComponentSlot slots m action\n  = ComponentSlot (ComponentSlotBox slots m action)\n  | ThunkSlot (Thunk (HC.HTML (ComponentSlot slots m action)) action)\n\ninstance functorComponentSlot :: Functor (ComponentSlot slots m) where\n  map f = case _ of\n    ComponentSlot box -> ComponentSlot (map f box)\n    ThunkSlot thunk -> ThunkSlot (Thunk.mapThunk (bimap (map f) f) thunk)\n\n-- | Constructs a [`ComponentSlot`](#t:ComponentSlot).\n-- |\n-- | Takes:\n-- | - the slot address label\n-- | - the slot address index\n-- | - the component for the slot\n-- | - the input value to pass to the component\n-- | - a function mapping outputs from the component to a query in the parent\ncomponentSlot\n  :: forall query input output slots m action label slot _1\n   . Row.Cons label (Slot query output slot) _1 slots\n  => IsSymbol label\n  => Ord slot\n  => Proxy label\n  -> slot\n  -> Component query input output m\n  -> input\n  -> (output -> Maybe action)\n  -> ComponentSlotBox slots m action\ncomponentSlot label p comp input output =\n  mkComponentSlot\n    { get: Slot.lookup label p\n    , pop: Slot.pop label p\n    , set: Slot.insert label p\n    , component: comp\n    , input: input\n    , output\n    }\n\n-- | The internal representation used for a [`ComponentSlot`](#t:ComponentSlot).\ntype ComponentSlotSpec query input output slots m action =\n  { get :: forall slot. SlotStorage slots slot -> Maybe (slot query output)\n  , pop :: forall slot. SlotStorage slots slot -> Maybe (Tuple (slot query output) (SlotStorage slots slot))\n  , set :: forall slot. slot query output -> SlotStorage slots slot -> SlotStorage slots slot\n  , component :: Component query input output m\n  , input :: input\n  , output :: output -> Maybe action\n  }\n\n-- | Constructs [`ComponentSlotBox`](#t:ComponentSlot) from a [`ComponentSlotSpec`](#t:ComponentSlotSpec).\nmkComponentSlot\n  :: forall query input output slots m action\n   . ComponentSlotSpec query input output slots m action\n  -> ComponentSlotBox slots m action\nmkComponentSlot = unsafeCoerce\n\n-- | Exposes the inner details of a [`ComponentSlot`](#t:ComponentSlot) to a\n-- | function to produce a new result.\n-- |\n-- |  The hidden details will not be allowed to be revealed in the result\n-- | of the function - if any of the hidden types (state, action, set of slots)\n-- | appear in the result, the compiler will complain about an escaped skolem.\nunComponentSlot\n  :: forall slots m action a\n   . (forall query input output. ComponentSlotSpec query input output slots m action -> a)\n  -> ComponentSlotBox slots m action\n  -> a\nunComponentSlot = unsafeCoerce\n\n-- | Changes the [`ComponentSlot`](#t:ComponentSlot)'s `m` type.\nhoistSlot\n  :: forall slots m m' action\n   . Functor m'\n  => (m ~> m')\n  -> ComponentSlot slots m action\n  -> ComponentSlot slots m' action\nhoistSlot nat = case _ of\n  ComponentSlot cs ->\n    cs # unComponentSlot \\slot ->\n      ComponentSlot $ mkComponentSlot $ slot { component = hoist nat slot.component }\n  ThunkSlot t ->\n    ThunkSlot $ Thunk.hoist (lmap (hoistSlot nat)) t\n", "module Halogen.HTML.Elements\n  ( Node\n  , Leaf\n  , element\n  , elementNS\n  , keyed\n  , keyedNS\n  , withKeys\n  , withKeys_\n  , a\n  , a_\n  , abbr\n  , abbr_\n  , address\n  , address_\n  , area\n  , article\n  , article_\n  , aside\n  , aside_\n  , audio\n  , audio_\n  , b\n  , b_\n  , base\n  , bdi\n  , bdi_\n  , bdo\n  , bdo_\n  , blockquote\n  , blockquote_\n  , body\n  , body_\n  , br\n  , br_\n  , button\n  , button_\n  , canvas\n  , caption\n  , caption_\n  , cite\n  , cite_\n  , code\n  , code_\n  , col\n  , colgroup\n  , colgroup_\n  , command\n  , datalist\n  , datalist_\n  , dd\n  , dd_\n  , del\n  , del_\n  , details\n  , details_\n  , dfn\n  , dfn_\n  , dialog\n  , dialog_\n  , div\n  , div_\n  , dl\n  , dl_\n  , dt\n  , dt_\n  , em\n  , em_\n  , embed\n  , embed_\n  , fieldset\n  , fieldset_\n  , figcaption\n  , figcaption_\n  , figure\n  , figure_\n  , footer\n  , footer_\n  , form\n  , form_\n  , h1\n  , h1_\n  , h2\n  , h2_\n  , h3\n  , h3_\n  , h4\n  , h4_\n  , h5\n  , h5_\n  , h6\n  , h6_\n  , head\n  , head_\n  , header\n  , header_\n  , hr\n  , hr_\n  , html\n  , html_\n  , i\n  , i_\n  , iframe\n  , img\n  , input\n  , ins\n  , ins_\n  , kbd\n  , kbd_\n  , label\n  , label_\n  , legend\n  , legend_\n  , li\n  , li_\n  , link\n  , main\n  , main_\n  , map\n  , map_\n  , mark\n  , mark_\n  , menu\n  , menu_\n  , menuitem\n  , menuitem_\n  , meta\n  , meter\n  , meter_\n  , nav\n  , nav_\n  , noscript\n  , noscript_\n  , object\n  , object_\n  , ol\n  , ol_\n  , optgroup\n  , optgroup_\n  , option\n  , option_\n  , output\n  , output_\n  , p\n  , p_\n  , param\n  , pre\n  , pre_\n  , progress\n  , progress_\n  , q\n  , q_\n  , rp\n  , rp_\n  , rt\n  , rt_\n  , ruby\n  , ruby_\n  , samp\n  , samp_\n  , script\n  , script_\n  , section\n  , section_\n  , select\n  , select_\n  , small\n  , small_\n  , source\n  , span\n  , span_\n  , strong\n  , strong_\n  , style\n  , style_\n  , sub\n  , sub_\n  , summary\n  , summary_\n  , sup\n  , sup_\n  , table\n  , table_\n  , tbody\n  , tbody_\n  , td\n  , td_\n  , textarea\n  , tfoot\n  , tfoot_\n  , th\n  , th_\n  , thead\n  , thead_\n  , time\n  , time_\n  , title\n  , title_\n  , tr\n  , tr_\n  , track\n  , u\n  , u_\n  , ul\n  , ul_\n  , var\n  , var_\n  , video\n  , video_\n  , wbr\n  ) where\n\nimport Prelude ((#), (>>>), pure)\nimport Data.Maybe (Maybe(Nothing))\nimport Data.Tuple (Tuple)\n\nimport DOM.HTML.Indexed as I\n\nimport Halogen.HTML.Core (ElemName(..), HTML(..), Namespace, Prop)\nimport Halogen.HTML.Core as Core\nimport Halogen.HTML.Properties (IProp)\nimport Halogen.Query.Input (Input)\nimport Halogen.VDom as VDom\n\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | An HTML element that admits children.\ntype Node r w i = Array (IProp r i) -> Array (HTML w i) -> HTML w i\n\n-- | An HTML element that does not admit children.\ntype Leaf r w i = Array (IProp r i) -> HTML w i\n\n-- | Creates an HTML element that expects indexed properties.\nelement :: forall r w i. ElemName -> Array (IProp r i) -> Array (HTML w i) -> HTML w i\nelement =\n  Core.element Nothing #\n    ( unsafeCoerce\n        :: (ElemName -> Array (Prop i) -> Array (HTML w i) -> HTML w i)\n        -> ElemName\n        -> Array (IProp r i)\n        -> Array (HTML w i)\n        -> HTML w i\n    )\n\n-- | Creates a Namespaced HTML element that expects indexed properties.\nelementNS :: forall r w i. Namespace -> ElemName -> Array (IProp r i) -> Array (HTML w i) -> HTML w i\nelementNS =\n  pure >>> Core.element >>>\n    ( unsafeCoerce\n        :: (ElemName -> Array (Prop i) -> Array (HTML w i) -> HTML w i)\n        -> ElemName\n        -> Array (IProp r i)\n        -> Array (HTML w i)\n        -> HTML w i\n    )\n\n-- | Creates an HTML element that expects indexed properties, with keyed\n-- | children.\nkeyed :: forall r w i. ElemName -> Array (IProp r i) -> Array (Tuple String (HTML w i)) -> HTML w i\nkeyed =\n  Core.keyed Nothing #\n    ( unsafeCoerce\n        :: (ElemName -> Array (Prop i) -> Array (Tuple String (HTML w i)) -> HTML w i)\n        -> ElemName\n        -> Array (IProp r i)\n        -> Array (Tuple String (HTML w i))\n        -> HTML w i\n    )\n\n-- | Creates a Namespaced HTML element that expects indexed properties, with\n-- | keyed children.\nkeyedNS :: forall r w i. Namespace -> ElemName -> Array (IProp r i) -> Array (Tuple String (HTML w i)) -> HTML w i\nkeyedNS =\n  pure >>> Core.keyed >>>\n    ( unsafeCoerce\n        :: (ElemName -> Array (Prop i) -> Array (Tuple String (HTML w i)) -> HTML w i)\n        -> ElemName\n        -> Array (IProp r i)\n        -> Array (Tuple String (HTML w i))\n        -> HTML w i\n    )\n\nwithKeys :: forall r w i. (Array (IProp r i) -> Array (HTML w i) -> HTML w i) -> Array (IProp r i) -> Array (Tuple String (HTML w i)) -> HTML w i\nwithKeys ctor props children =\n  case ctor props [] of\n    HTML (VDom.Elem x y z _) -> HTML (VDom.Keyed x y z (coe children))\n    h -> h\n  where\n  coe :: Array (Tuple String (HTML w i)) -> Array (Tuple String (VDom.VDom (Array (Prop (Input i))) w))\n  coe = unsafeCoerce\n\nwithKeys_ :: forall w i. (Array (HTML w i) -> HTML w i) -> Array (Tuple String (HTML w i)) -> HTML w i\nwithKeys_ ctor children =\n  case ctor [] of\n    HTML (VDom.Elem x y z _) -> HTML (VDom.Keyed x y z (coe children))\n    h -> h\n  where\n  coe :: Array (Tuple String (HTML w i)) -> Array (Tuple String (VDom.VDom (Array (Prop (Input i))) w))\n  coe = unsafeCoerce\n\na :: forall w i. Node I.HTMLa w i\na = element (ElemName \"a\")\n\na_ :: forall w i. Array (HTML w i) -> HTML w i\na_ = a []\n\nabbr :: forall w i. Node I.HTMLabbr w i\nabbr = element (ElemName \"abbr\")\n\nabbr_ :: forall w i. Array (HTML w i) -> HTML w i\nabbr_ = abbr []\n\naddress :: forall w i. Node I.HTMLaddress w i\naddress = element (ElemName \"address\")\n\naddress_ :: forall w i. Array (HTML w i) -> HTML w i\naddress_ = address []\n\narea :: forall w i. Leaf I.HTMLarea w i\narea props = element (ElemName \"area\") props []\n\narticle :: forall w i. Node I.HTMLarticle w i\narticle = element (ElemName \"article\")\n\narticle_ :: forall w i. Array (HTML w i) -> HTML w i\narticle_ = article []\n\naside :: forall w i. Node I.HTMLaside w i\naside = element (ElemName \"aside\")\n\naside_ :: forall w i. Array (HTML w i) -> HTML w i\naside_ = aside []\n\naudio :: forall w i. Node I.HTMLaudio w i\naudio = element (ElemName \"audio\")\n\naudio_ :: forall w i. Array (HTML w i) -> HTML w i\naudio_ = audio []\n\nb :: forall w i. Node I.HTMLb w i\nb = element (ElemName \"b\")\n\nb_ :: forall w i. Array (HTML w i) -> HTML w i\nb_ = b []\n\nbase :: forall w i. Leaf I.HTMLbase w i\nbase props = element (ElemName \"base\") props []\n\nbdi :: forall w i. Node I.HTMLbdi w i\nbdi = element (ElemName \"bdi\")\n\nbdi_ :: forall w i. Array (HTML w i) -> HTML w i\nbdi_ = bdi []\n\nbdo :: forall w i. Node I.HTMLbdo w i\nbdo = element (ElemName \"bdo\")\n\nbdo_ :: forall w i. Array (HTML w i) -> HTML w i\nbdo_ = bdo []\n\nblockquote :: forall w i. Node I.HTMLblockquote w i\nblockquote = element (ElemName \"blockquote\")\n\nblockquote_ :: forall w i. Array (HTML w i) -> HTML w i\nblockquote_ = blockquote []\n\nbody :: forall w i. Node I.HTMLbody w i\nbody = element (ElemName \"body\")\n\nbody_ :: forall w i. Array (HTML w i) -> HTML w i\nbody_ = body []\n\nbr :: forall w i. Leaf I.HTMLbr w i\nbr props = element (ElemName \"br\") props []\n\nbr_ :: forall w i. HTML w i\nbr_ = br []\n\nbutton :: forall w i. Node I.HTMLbutton w i\nbutton = element (ElemName \"button\")\n\nbutton_ :: forall w i. Array (HTML w i) -> HTML w i\nbutton_ = button []\n\ncanvas :: forall w i. Leaf I.HTMLcanvas w i\ncanvas props = element (ElemName \"canvas\") props []\n\ncaption :: forall w i. Node I.HTMLcaption w i\ncaption = element (ElemName \"caption\")\n\ncaption_ :: forall w i. Array (HTML w i) -> HTML w i\ncaption_ = caption []\n\ncite :: forall w i. Node I.HTMLcite w i\ncite = element (ElemName \"cite\")\n\ncite_ :: forall w i. Array (HTML w i) -> HTML w i\ncite_ = cite []\n\ncode :: forall w i. Node I.HTMLcode w i\ncode = element (ElemName \"code\")\n\ncode_ :: forall w i. Array (HTML w i) -> HTML w i\ncode_ = code []\n\ncol :: forall w i. Leaf I.HTMLcol w i\ncol props = element (ElemName \"col\") props []\n\ncolgroup :: forall w i. Node I.HTMLcolgroup w i\ncolgroup = element (ElemName \"colgroup\")\n\ncolgroup_ :: forall w i. Array (HTML w i) -> HTML w i\ncolgroup_ = colgroup []\n\ncommand :: forall w i. Leaf I.HTMLcommand w i\ncommand props = element (ElemName \"command\") props []\n\ndatalist :: forall w i. Node I.HTMLdatalist w i\ndatalist = element (ElemName \"datalist\")\n\ndatalist_ :: forall w i. Array (HTML w i) -> HTML w i\ndatalist_ = datalist []\n\ndd :: forall w i. Node I.HTMLdd w i\ndd = element (ElemName \"dd\")\n\ndd_ :: forall w i. Array (HTML w i) -> HTML w i\ndd_ = dd []\n\ndel :: forall w i. Node I.HTMLdel w i\ndel = element (ElemName \"del\")\n\ndel_ :: forall w i. Array (HTML w i) -> HTML w i\ndel_ = del []\n\ndetails :: forall w i. Node I.HTMLdetails w i\ndetails = element (ElemName \"details\")\n\ndetails_ :: forall w i. Array (HTML w i) -> HTML w i\ndetails_ = details []\n\ndfn :: forall w i. Node I.HTMLdfn w i\ndfn = element (ElemName \"dfn\")\n\ndfn_ :: forall w i. Array (HTML w i) -> HTML w i\ndfn_ = dfn []\n\ndialog :: forall w i. Node I.HTMLdialog w i\ndialog = element (ElemName \"dialog\")\n\ndialog_ :: forall w i. Array (HTML w i) -> HTML w i\ndialog_ = dialog []\n\ndiv :: forall w i. Node I.HTMLdiv w i\ndiv = element (ElemName \"div\")\n\ndiv_ :: forall w i. Array (HTML w i) -> HTML w i\ndiv_ = div []\n\ndl :: forall w i. Node I.HTMLdl w i\ndl = element (ElemName \"dl\")\n\ndl_ :: forall w i. Array (HTML w i) -> HTML w i\ndl_ = dl []\n\ndt :: forall w i. Node (I.HTMLdt) w i\ndt = element (ElemName \"dt\")\n\ndt_ :: forall w i. Array (HTML w i) -> HTML w i\ndt_ = dt []\n\nem :: forall w i. Node I.HTMLem w i\nem = element (ElemName \"em\")\n\nem_ :: forall w i. Array (HTML w i) -> HTML w i\nem_ = em []\n\nembed :: forall w i. Node I.HTMLembed w i\nembed = element (ElemName \"embed\")\n\nembed_ :: forall w i. Array (HTML w i) -> HTML w i\nembed_ = embed []\n\nfieldset :: forall w i. Node I.HTMLfieldset w i\nfieldset = element (ElemName \"fieldset\")\n\nfieldset_ :: forall w i. Array (HTML w i) -> HTML w i\nfieldset_ = fieldset []\n\nfigcaption :: forall w i. Node I.HTMLfigcaption w i\nfigcaption = element (ElemName \"figcaption\")\n\nfigcaption_ :: forall w i. Array (HTML w i) -> HTML w i\nfigcaption_ = figcaption []\n\nfigure :: forall w i. Node I.HTMLfigure w i\nfigure = element (ElemName \"figure\")\n\nfigure_ :: forall w i. Array (HTML w i) -> HTML w i\nfigure_ = figure []\n\nfooter :: forall w i. Node I.HTMLfooter w i\nfooter = element (ElemName \"footer\")\n\nfooter_ :: forall w i. Array (HTML w i) -> HTML w i\nfooter_ = footer []\n\nform :: forall w i. Node I.HTMLform w i\nform = element (ElemName \"form\")\n\nform_ :: forall w i. Array (HTML w i) -> HTML w i\nform_ = form []\n\nh1 :: forall w i. Node I.HTMLh1 w i\nh1 = element (ElemName \"h1\")\n\nh1_ :: forall w i. Array (HTML w i) -> HTML w i\nh1_ = h1 []\n\nh2 :: forall w i. Node I.HTMLh2 w i\nh2 = element (ElemName \"h2\")\n\nh2_ :: forall w i. Array (HTML w i) -> HTML w i\nh2_ = h2 []\n\nh3 :: forall w i. Node I.HTMLh3 w i\nh3 = element (ElemName \"h3\")\n\nh3_ :: forall w i. Array (HTML w i) -> HTML w i\nh3_ = h3 []\n\nh4 :: forall w i. Node I.HTMLh4 w i\nh4 = element (ElemName \"h4\")\n\nh4_ :: forall w i. Array (HTML w i) -> HTML w i\nh4_ = h4 []\n\nh5 :: forall w i. Node I.HTMLh5 w i\nh5 = element (ElemName \"h5\")\n\nh5_ :: forall w i. Array (HTML w i) -> HTML w i\nh5_ = h5 []\n\nh6 :: forall w i. Node I.HTMLh6 w i\nh6 = element (ElemName \"h6\")\n\nh6_ :: forall w i. Array (HTML w i) -> HTML w i\nh6_ = h6 []\n\nhead :: forall w i. Node I.HTMLhead w i\nhead = element (ElemName \"head\")\n\nhead_ :: forall w i. Array (HTML w i) -> HTML w i\nhead_ = head []\n\nheader :: forall w i. Node I.HTMLheader w i\nheader = element (ElemName \"header\")\n\nheader_ :: forall w i. Array (HTML w i) -> HTML w i\nheader_ = header []\n\nhr :: forall w i. Leaf I.HTMLhr w i\nhr props = element (ElemName \"hr\") props []\n\nhr_ :: forall w i. HTML w i\nhr_ = hr []\n\nhtml :: forall w i. Node I.HTMLhtml w i\nhtml = element (ElemName \"html\")\n\nhtml_ :: forall w i. Array (HTML w i) -> HTML w i\nhtml_ = html []\n\ni :: forall w i. Node I.HTMLi w i\ni = element (ElemName \"i\")\n\ni_ :: forall w i. Array (HTML w i) -> HTML w i\ni_ = i []\n\niframe :: forall w i. Leaf I.HTMLiframe w i\niframe props = element (ElemName \"iframe\") props []\n\nimg :: forall w i. Leaf I.HTMLimg w i\nimg props = element (ElemName \"img\") props []\n\ninput :: forall w i. Leaf I.HTMLinput w i\ninput props = element (ElemName \"input\") props []\n\nins :: forall w i. Node I.HTMLins w i\nins = element (ElemName \"ins\")\n\nins_ :: forall w i. Array (HTML w i) -> HTML w i\nins_ = ins []\n\nkbd :: forall w i. Node I.HTMLkbd w i\nkbd = element (ElemName \"kbd\")\n\nkbd_ :: forall w i. Array (HTML w i) -> HTML w i\nkbd_ = kbd []\n\nlabel :: forall w i. Node I.HTMLlabel w i\nlabel = element (ElemName \"label\")\n\nlabel_ :: forall w i. Array (HTML w i) -> HTML w i\nlabel_ = label []\n\nlegend :: forall w i. Node I.HTMLlegend w i\nlegend = element (ElemName \"legend\")\n\nlegend_ :: forall w i. Array (HTML w i) -> HTML w i\nlegend_ = legend []\n\nli :: forall w i. Node I.HTMLli w i\nli = element (ElemName \"li\")\n\nli_ :: forall w i. Array (HTML w i) -> HTML w i\nli_ = li []\n\nlink :: forall w i. Leaf I.HTMLlink w i\nlink props = element (ElemName \"link\") props []\n\nmain :: forall w i. Node I.HTMLmain w i\nmain = element (ElemName \"main\")\n\nmain_ :: forall w i. Array (HTML w i) -> HTML w i\nmain_ = main []\n\nmap :: forall w i. Node I.HTMLmap w i\nmap = element (ElemName \"map\")\n\nmap_ :: forall w i. Array (HTML w i) -> HTML w i\nmap_ = map []\n\nmark :: forall w i. Node I.HTMLmark w i\nmark = element (ElemName \"mark\")\n\nmark_ :: forall w i. Array (HTML w i) -> HTML w i\nmark_ = mark []\n\nmenu :: forall w i. Node I.HTMLmenu w i\nmenu = element (ElemName \"menu\")\n\nmenu_ :: forall w i. Array (HTML w i) -> HTML w i\nmenu_ = menu []\n\nmenuitem :: forall w i. Node I.HTMLmenuitem w i\nmenuitem = element (ElemName \"menuitem\")\n\nmenuitem_ :: forall w i. Array (HTML w i) -> HTML w i\nmenuitem_ = menuitem []\n\nmeta :: forall w i. Leaf I.HTMLmeta w i\nmeta props = element (ElemName \"meta\") props []\n\nmeter :: forall w i. Node I.HTMLmeter w i\nmeter = element (ElemName \"meter\")\n\nmeter_ :: forall w i. Array (HTML w i) -> HTML w i\nmeter_ = meter []\n\nnav :: forall w i. Node I.HTMLnav w i\nnav = element (ElemName \"nav\")\n\nnav_ :: forall w i. Array (HTML w i) -> HTML w i\nnav_ = nav []\n\nnoscript :: forall w i. Node I.HTMLnoscript w i\nnoscript = element (ElemName \"noscript\")\n\nnoscript_ :: forall w i. Array (HTML w i) -> HTML w i\nnoscript_ = noscript []\n\nobject :: forall w i. Node I.HTMLobject w i\nobject = element (ElemName \"object\")\n\nobject_ :: forall w i. Array (HTML w i) -> HTML w i\nobject_ = object []\n\nol :: forall w i. Node I.HTMLol w i\nol = element (ElemName \"ol\")\n\nol_ :: forall w i. Array (HTML w i) -> HTML w i\nol_ = ol []\n\noptgroup :: forall w i. Node I.HTMLoptgroup w i\noptgroup = element (ElemName \"optgroup\")\n\noptgroup_ :: forall w i. Array (HTML w i) -> HTML w i\noptgroup_ = optgroup []\n\noption :: forall w i. Node I.HTMLoption w i\noption = element (ElemName \"option\")\n\noption_ :: forall w i. Array (HTML w i) -> HTML w i\noption_ = option []\n\noutput :: forall w i. Node I.HTMLoutput w i\noutput = element (ElemName \"output\")\n\noutput_ :: forall w i. Array (HTML w i) -> HTML w i\noutput_ = output []\n\np :: forall w i. Node I.HTMLp w i\np = element (ElemName \"p\")\n\np_ :: forall w i. Array (HTML w i) -> HTML w i\np_ = p []\n\nparam :: forall w i. Leaf I.HTMLparam w i\nparam props = element (ElemName \"param\") props []\n\npre :: forall w i. Node I.HTMLpre w i\npre = element (ElemName \"pre\")\n\npre_ :: forall w i. Array (HTML w i) -> HTML w i\npre_ = pre []\n\nprogress :: forall w i. Node I.HTMLprogress w i\nprogress = element (ElemName \"progress\")\n\nprogress_ :: forall w i. Array (HTML w i) -> HTML w i\nprogress_ = progress []\n\nq :: forall w i. Node I.HTMLq w i\nq = element (ElemName \"q\")\n\nq_ :: forall w i. Array (HTML w i) -> HTML w i\nq_ = q []\n\nrp :: forall w i. Node I.HTMLrp w i\nrp = element (ElemName \"rp\")\n\nrp_ :: forall w i. Array (HTML w i) -> HTML w i\nrp_ = rp []\n\nrt :: forall w i. Node I.HTMLrt w i\nrt = element (ElemName \"rt\")\n\nrt_ :: forall w i. Array (HTML w i) -> HTML w i\nrt_ = rt []\n\nruby :: forall w i. Node I.HTMLruby w i\nruby = element (ElemName \"ruby\")\n\nruby_ :: forall w i. Array (HTML w i) -> HTML w i\nruby_ = ruby []\n\nsamp :: forall w i. Node I.HTMLsamp w i\nsamp = element (ElemName \"samp\")\n\nsamp_ :: forall w i. Array (HTML w i) -> HTML w i\nsamp_ = samp []\n\nscript :: forall w i. Node I.HTMLscript w i\nscript = element (ElemName \"script\")\n\nscript_ :: forall w i. Array (HTML w i) -> HTML w i\nscript_ = script []\n\nsection :: forall w i. Node I.HTMLsection w i\nsection = element (ElemName \"section\")\n\nsection_ :: forall w i. Array (HTML w i) -> HTML w i\nsection_ = section []\n\nselect :: forall w i. Node I.HTMLselect w i\nselect = element (ElemName \"select\")\n\nselect_ :: forall w i. Array (HTML w i) -> HTML w i\nselect_ = select []\n\nsmall :: forall w i. Node I.HTMLsmall w i\nsmall = element (ElemName \"small\")\n\nsmall_ :: forall w i. Array (HTML w i) -> HTML w i\nsmall_ = small []\n\nsource :: forall w i. Leaf I.HTMLsource w i\nsource props = element (ElemName \"source\") props []\n\nspan :: forall w i. Node I.HTMLspan w i\nspan = element (ElemName \"span\")\n\nspan_ :: forall w i. Array (HTML w i) -> HTML w i\nspan_ = span []\n\nstrong :: forall w i. Node I.HTMLstrong w i\nstrong = element (ElemName \"strong\")\n\nstrong_ :: forall w i. Array (HTML w i) -> HTML w i\nstrong_ = strong []\n\nstyle :: forall w i. Node I.HTMLstyle w i\nstyle = element (ElemName \"style\")\n\nstyle_ :: forall w i. Array (HTML w i) -> HTML w i\nstyle_ = style []\n\nsub :: forall w i. Node I.HTMLsub w i\nsub = element (ElemName \"sub\")\n\nsub_ :: forall w i. Array (HTML w i) -> HTML w i\nsub_ = sub []\n\nsummary :: forall w i. Node I.HTMLsummary w i\nsummary = element (ElemName \"summary\")\n\nsummary_ :: forall w i. Array (HTML w i) -> HTML w i\nsummary_ = summary []\n\nsup :: forall w i. Node I.HTMLsup w i\nsup = element (ElemName \"sup\")\n\nsup_ :: forall w i. Array (HTML w i) -> HTML w i\nsup_ = sup []\n\ntable :: forall w i. Node I.HTMLtable w i\ntable = element (ElemName \"table\")\n\ntable_ :: forall w i. Array (HTML w i) -> HTML w i\ntable_ = table []\n\ntbody :: forall w i. Node I.HTMLtbody w i\ntbody = element (ElemName \"tbody\")\n\ntbody_ :: forall w i. Array (HTML w i) -> HTML w i\ntbody_ = tbody []\n\ntd :: forall w i. Node I.HTMLtd w i\ntd = element (ElemName \"td\")\n\ntd_ :: forall w i. Array (HTML w i) -> HTML w i\ntd_ = td []\n\ntextarea :: forall w i. Leaf I.HTMLtextarea w i\ntextarea es = element (ElemName \"textarea\") es []\n\ntfoot :: forall w i. Node I.HTMLtfoot w i\ntfoot = element (ElemName \"tfoot\")\n\ntfoot_ :: forall w i. Array (HTML w i) -> HTML w i\ntfoot_ = tfoot []\n\nth :: forall w i. Node I.HTMLth w i\nth = element (ElemName \"th\")\n\nth_ :: forall w i. Array (HTML w i) -> HTML w i\nth_ = th []\n\nthead :: forall w i. Node I.HTMLthead w i\nthead = element (ElemName \"thead\")\n\nthead_ :: forall w i. Array (HTML w i) -> HTML w i\nthead_ = thead []\n\ntime :: forall w i. Node I.HTMLtime w i\ntime = element (ElemName \"time\")\n\ntime_ :: forall w i. Array (HTML w i) -> HTML w i\ntime_ = time []\n\ntitle :: forall w i. Node I.HTMLtitle w i\ntitle = element (ElemName \"title\")\n\ntitle_ :: forall w i. Array (HTML w i) -> HTML w i\ntitle_ = title []\n\ntr :: forall w i. Node I.HTMLtr w i\ntr = element (ElemName \"tr\")\n\ntr_ :: forall w i. Array (HTML w i) -> HTML w i\ntr_ = tr []\n\ntrack :: forall w i. Leaf I.HTMLtrack w i\ntrack props = element (ElemName \"track\") props []\n\nu :: forall w i. Node I.HTMLu w i\nu = element (ElemName \"u\")\n\nu_ :: forall w i. Array (HTML w i) -> HTML w i\nu_ = u []\n\nul :: forall w i. Node I.HTMLul w i\nul = element (ElemName \"ul\")\n\nul_ :: forall w i. Array (HTML w i) -> HTML w i\nul_ = ul []\n\nvar :: forall w i. Node I.HTMLvar w i\nvar = element (ElemName \"var\")\n\nvar_ :: forall w i. Array (HTML w i) -> HTML w i\nvar_ = var []\n\nvideo :: forall w i. Node I.HTMLvideo w i\nvideo = element (ElemName \"video\")\n\nvideo_ :: forall w i. Array (HTML w i) -> HTML w i\nvideo_ = video []\n\nwbr :: forall w i. Leaf I.HTMLwbr w i\nwbr props = element (ElemName \"wbr\") props []\n", "export function bubbles(e) {\n  return e.bubbles;\n}\n\nexport function cancelable(e) {\n  return e.cancelable;\n}\n\nexport function _currentTarget(e) {\n  return e.currentTarget;\n}\n\nexport function defaultPrevented(e) {\n  return function() {\n    return e.defaultPrevented;\n  };\n}\n\nexport function eventPhaseIndex(e) {\n  return e.eventPhase;\n}\n\nexport function _target(e) {\n  return e.target;\n}\n\nexport function timeStamp(e) {\n  return e.timeStamp;\n}\n\nexport function type_(e) {\n  return e.type;\n}\n\nexport function preventDefault(e) {\n  return function () {\n    return e.preventDefault();\n  };\n}\n\nexport function stopImmediatePropagation(e) {\n  return function () {\n    return e.stopImmediatePropagation();\n  };\n}\n\nexport function stopPropagation(e) {\n  return function () {\n    return e.stopPropagation();\n  };\n}\n", "module Web.Event.Event\n  ( module Exports\n  , EventType(..)\n  , type_\n  , target\n  , currentTarget\n  , eventPhase\n  , stopPropagation\n  , stopImmediatePropagation\n  , bubbles\n  , cancelable\n  , preventDefault\n  , defaultPrevented\n  , timeStamp\n  ) where\n\nimport Prelude\n\nimport Data.DateTime.Instant (Instant)\nimport Data.Enum (toEnum)\nimport Data.Maybe (Maybe, fromJust)\nimport Data.Newtype (class Newtype)\nimport Data.Nullable (Nullable, toMaybe)\nimport Effect (Effect)\nimport Web.Event.EventPhase (EventPhase)\nimport Web.Event.Internal.Types (Event) as Exports\nimport Web.Event.Internal.Types (Event, EventTarget)\n\n-- | The type of strings used for event types.\nnewtype EventType = EventType String\n\nderive instance newtypeEventType :: Newtype EventType _\nderive newtype instance eqEventType :: Eq EventType\nderive newtype instance ordEventType :: Ord EventType\n\n-- | The event type.\nforeign import type_ :: Event -> EventType\n\n-- | The element that was the source of the event.\ntarget :: Event -> Maybe EventTarget\ntarget = toMaybe <<< _target\n\nforeign import _target :: Event -> Nullable EventTarget\n\n-- | The element that the event listener was added to.\ncurrentTarget :: Event -> Maybe EventTarget\ncurrentTarget = toMaybe <<< _currentTarget\n\nforeign import _currentTarget :: Event -> Nullable EventTarget\n\n-- | Indicates which phase of the event flow that is currently being processed\n-- | for the event.\neventPhase :: Partial => Event -> EventPhase\neventPhase = fromJust <<< toEnum <<< eventPhaseIndex\n\n-- | The integer value for the current event phase.\nforeign import eventPhaseIndex :: Event -> Int\n\n-- | Prevents the event from bubbling up to futher event listeners. Other event\n-- | listeners on the current target will still fire.\nforeign import stopPropagation :: Event -> Effect Unit\n\n-- | Prevents all other listeners for the event from being called. This includes\n-- | event listeners added to the current target after the current listener.\nforeign import stopImmediatePropagation :: Event -> Effect Unit\n\n-- | Indicates whether the event will bubble up through the DOM or not.\nforeign import bubbles :: Event -> Boolean\n\n-- | Indicates whether the event can be cancelled.\nforeign import cancelable :: Event -> Boolean\n\n-- | Cancels the event if it can be cancelled.\nforeign import preventDefault :: Event -> Effect Unit\n\n-- | Indicates whether `preventDefault` was called on the event.\nforeign import defaultPrevented :: Event -> Effect Boolean\n\n-- | The time in milliseconds between 01/01/1970 and when the event was\n-- | dispatched.\nforeign import timeStamp :: Event -> Instant\n", "module Web.HTML.Event.EventTypes where\n\nimport Web.Event.Event (EventType(..))\n\nabort :: EventType\nabort = EventType \"abort\"\n\nafterprint :: EventType\nafterprint = EventType \"afterprint\"\n\nafterscriptexecute :: EventType\nafterscriptexecute = EventType \"afterscriptexecute\"\n\nbeforeprint :: EventType\nbeforeprint = EventType \"beforeprint\"\n\nbeforescriptexecute :: EventType\nbeforescriptexecute = EventType \"beforescriptexecute\"\n\nblur :: EventType\nblur = EventType \"blur\"\n\ncancel :: EventType\ncancel = EventType \"cancel\"\n\nchange :: EventType\nchange = EventType \"change\"\n\nclick :: EventType\nclick = EventType \"click\"\n\nclose :: EventType\nclose = EventType \"close\"\n\ncopy :: EventType\ncopy = EventType \"copy\"\n\ncut :: EventType\ncut = EventType \"cut\"\n\ndomcontentloaded :: EventType\ndomcontentloaded = EventType \"DOMContentLoaded\"\n\nerror :: EventType\nerror = EventType \"error\"\n\nfocus :: EventType\nfocus = EventType \"focus\"\n\ninput :: EventType\ninput = EventType \"input\"\n\ninvalid :: EventType\ninvalid = EventType \"invalid\"\n\nlanguagechange :: EventType\nlanguagechange = EventType \"languagechange\"\n\nload :: EventType\nload = EventType \"load\"\n\nloadend :: EventType\nloadend = EventType \"loadend\"\n\nloadstart :: EventType\nloadstart = EventType \"loadstart\"\n\nmessage :: EventType\nmessage = EventType \"message\"\n\noffline :: EventType\noffline = EventType \"offline\"\n\nonline :: EventType\nonline = EventType \"online\"\n\npaste :: EventType\npaste = EventType \"paste\"\n\nprogress :: EventType\nprogress = EventType \"progress\"\n\nreadystatechange :: EventType\nreadystatechange = EventType \"readystatechange\"\n\nreset :: EventType\nreset = EventType \"reset\"\n\nselect :: EventType\nselect = EventType \"select\"\n\nstorage :: EventType\nstorage = EventType \"storage\"\n\nsubmit :: EventType\nsubmit = EventType \"submit\"\n\ntoggle :: EventType\ntoggle = EventType \"toggle\"\n\nunload :: EventType\nunload = EventType \"unload\"\n", "module Web.UIEvent.MouseEvent.EventTypes where\n\nimport Web.Event.Event (EventType(..))\n\nauxclick :: EventType\nauxclick = EventType \"auxclick\"\n\nclick :: EventType\nclick = EventType \"click\"\n\ndblclick :: EventType\ndblclick = EventType \"dblclick\"\n\nmousedown :: EventType\nmousedown = EventType \"mousedown\"\n\nmouseenter :: EventType\nmouseenter = EventType \"mouseenter\"\n\nmouseleave :: EventType\nmouseleave = EventType \"mouseleave\"\n\nmousemove :: EventType\nmousemove = EventType \"mousemove\"\n\nmouseout :: EventType\nmouseout = EventType \"mouseout\"\n\nmouseover :: EventType\nmouseover = EventType \"mouseover\"\n\nmouseup :: EventType\nmouseup = EventType \"mouseup\"\n", "module Halogen.HTML.Events\n  ( handler\n  , handler'\n  , onAbort\n  , onError\n  , onLoad\n  , onScroll\n  , onChange\n  , onFileUpload\n  , onInput\n  , onInvalid\n  , onReset\n  , onSelect\n  , onSubmit\n  , onTransitionEnd\n  , onCopy\n  , onPaste\n  , onCut\n  , onAuxClick\n  , onClick\n  -- , onContextMenu\n  , onDoubleClick\n  , onMouseDown\n  , onMouseEnter\n  , onMouseLeave\n  , onMouseMove\n  , onMouseOver\n  , onMouseOut\n  , onMouseUp\n  , onWheel\n  , onKeyDown\n  -- , onKeyPress\n  , onKeyUp\n  , onBlur\n  , onFocus\n  , onFocusIn\n  , onFocusOut\n  , onDrag\n  , onDragEnd\n  , onDragExit\n  , onDragEnter\n  , onDragLeave\n  , onDragOver\n  , onDragStart\n  , onDrop\n  , onTouchCancel\n  , onTouchEnd\n  , onTouchEnter\n  , onTouchLeave\n  , onTouchMove\n  , onTouchStart\n  , onResize\n  , onValueChange\n  , onValueInput\n  , onSelectedIndexChange\n  , onChecked\n  ) where\n\nimport Prelude\n\nimport Control.Monad.Except (runExcept)\nimport Data.Either (either)\nimport Data.Maybe (Maybe(..), maybe)\nimport Data.Unfoldable (class Unfoldable, none)\nimport Foreign (F, Foreign, readBoolean, readInt, readString, unsafeToForeign)\nimport Foreign.Index (readProp)\nimport Halogen.HTML.Core (Prop)\nimport Halogen.HTML.Core as Core\nimport Halogen.HTML.Properties (IProp)\nimport Halogen.Query.Input (Input(..))\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.Clipboard.ClipboardEvent (ClipboardEvent)\nimport Web.Clipboard.ClipboardEvent.EventTypes as CET\nimport Web.Event.Event (Event, EventType(..))\nimport Web.Event.Event as EE\nimport Web.Event.Event as Event\nimport Web.File.File (File)\nimport Web.File.FileList (items)\nimport Web.HTML.Event.DragEvent (DragEvent)\nimport Web.HTML.Event.DragEvent.EventTypes as DET\nimport Web.HTML.Event.EventTypes as ET\nimport Web.HTML.HTMLInputElement as HTMLInputElement\nimport Web.TouchEvent.TouchEvent (TouchEvent)\nimport Web.UIEvent.FocusEvent (FocusEvent)\nimport Web.UIEvent.FocusEvent.EventTypes as FET\nimport Web.UIEvent.KeyboardEvent (KeyboardEvent)\nimport Web.UIEvent.KeyboardEvent.EventTypes as KET\nimport Web.UIEvent.MouseEvent (MouseEvent)\nimport Web.UIEvent.MouseEvent.EventTypes as MET\nimport Web.UIEvent.WheelEvent (WheelEvent)\nimport Web.UIEvent.WheelEvent.EventTypes as WET\nimport Effect.Unsafe (unsafePerformEffect)\n\nhandler :: forall r i. EventType -> (Event -> i) -> IProp r i\nhandler et f =\n  (unsafeCoerce :: (EventType -> (Event -> Maybe i) -> Prop i) -> EventType -> (Event -> Maybe (Input i)) -> IProp r i)\n    Core.handler\n    et\n    \\ev -> Just (Action (f ev))\n\nhandler' :: forall r i. EventType -> (Event -> Maybe i) -> IProp r i\nhandler' et f =\n  (unsafeCoerce :: (EventType -> (Event -> Maybe i) -> Prop i) -> EventType -> (Event -> Maybe (Input i)) -> IProp r i)\n    Core.handler\n    et\n    \\ev -> Action <$> f ev\n\nonAbort :: forall r i. (Event -> i) -> IProp (onAbort :: Event | r) i\nonAbort = handler (EventType \"abort\")\n\nonError :: forall r i. (Event -> i) -> IProp (onError :: Event | r) i\nonError = handler ET.error\n\nonLoad :: forall r i. (Event -> i) -> IProp (onLoad :: Event | r) i\nonLoad = handler ET.load\n\nonScroll :: forall r i. (Event -> i) -> IProp (onScroll :: Event | r) i\nonScroll = handler (EventType \"scroll\")\n\nonChange :: forall r i. (Event -> i) -> IProp (onChange :: Event | r) i\nonChange = handler ET.change\n\nonFileUpload\n  :: forall r i t\n   . Unfoldable t\n  => (t File -> i)\n  -> IProp (onChange :: Event | r) i\nonFileUpload f = handler ET.change $\n  ( Event.target\n      >=> HTMLInputElement.fromEventTarget\n      >=>\n        HTMLInputElement.files >>> unsafePerformEffect\n  )\n    >>> maybe none items\n    >>> f\n\nonInput :: forall r i. (Event -> i) -> IProp (onInput :: Event | r) i\nonInput = handler ET.input\n\nonInvalid :: forall r i. (Event -> i) -> IProp (onInvalid :: Event | r) i\nonInvalid = handler ET.invalid\n\nonReset :: forall r i. (Event -> i) -> IProp (onReset :: Event | r) i\nonReset = handler (EventType \"reset\")\n\nonSelect :: forall r i. (Event -> i) -> IProp (onSelect :: Event | r) i\nonSelect = handler ET.select\n\nonSubmit :: forall r i. (Event -> i) -> IProp (onSubmit :: Event | r) i\nonSubmit = handler (EventType \"submit\")\n\nonTransitionEnd :: forall r i. (Event -> i) -> IProp (onTransitionEnd :: Event | r) i\nonTransitionEnd = handler (EventType \"transitionend\")\n\nonCopy :: forall r i. (ClipboardEvent -> i) -> IProp (onCopy :: ClipboardEvent | r) i\nonCopy = handler CET.copy <<< clipboardHandler\n\nonPaste :: forall r i. (ClipboardEvent -> i) -> IProp (onPaste :: ClipboardEvent | r) i\nonPaste = handler CET.paste <<< clipboardHandler\n\nonCut :: forall r i. (ClipboardEvent -> i) -> IProp (onCut :: ClipboardEvent | r) i\nonCut = handler CET.cut <<< clipboardHandler\n\nonAuxClick :: forall r i. (MouseEvent -> i) -> IProp (onAuxClick :: MouseEvent | r) i\nonAuxClick = handler MET.auxclick <<< mouseHandler\n\nonClick :: forall r i. (MouseEvent -> i) -> IProp (onClick :: MouseEvent | r) i\nonClick = handler MET.click <<< mouseHandler\n\n-- onContextMenu :: forall r i. (MouseEvent -> i) -> IProp (onContextMenu :: MouseEvent | r) i\n-- onContextMenu = handler ET.contextmenu <<< mouseHandler\n\nonDoubleClick :: forall r i. (MouseEvent -> i) -> IProp (onDoubleClick :: MouseEvent | r) i\nonDoubleClick = handler MET.dblclick <<< mouseHandler\n\nonMouseDown :: forall r i. (MouseEvent -> i) -> IProp (onMouseDown :: MouseEvent | r) i\nonMouseDown = handler MET.mousedown <<< mouseHandler\n\nonMouseEnter :: forall r i. (MouseEvent -> i) -> IProp (onMouseEnter :: MouseEvent | r) i\nonMouseEnter = handler MET.mouseenter <<< mouseHandler\n\nonMouseLeave :: forall r i. (MouseEvent -> i) -> IProp (onMouseLeave :: MouseEvent | r) i\nonMouseLeave = handler MET.mouseleave <<< mouseHandler\n\nonMouseMove :: forall r i. (MouseEvent -> i) -> IProp (onMouseMove :: MouseEvent | r) i\nonMouseMove = handler MET.mousemove <<< mouseHandler\n\nonMouseOver :: forall r i. (MouseEvent -> i) -> IProp (onMouseOver :: MouseEvent | r) i\nonMouseOver = handler MET.mouseover <<< mouseHandler\n\nonMouseOut :: forall r i. (MouseEvent -> i) -> IProp (onMouseOut :: MouseEvent | r) i\nonMouseOut = handler MET.mouseout <<< mouseHandler\n\nonMouseUp :: forall r i. (MouseEvent -> i) -> IProp (onMouseUp :: MouseEvent | r) i\nonMouseUp = handler MET.mouseup <<< mouseHandler\n\nonWheel :: forall r i. (WheelEvent -> i) -> IProp (onWheel :: WheelEvent | r) i\nonWheel = handler WET.wheel <<< wheelHandler\n\nonKeyDown :: forall r i. (KeyboardEvent -> i) -> IProp (onKeyDown :: KeyboardEvent | r) i\nonKeyDown = handler KET.keydown <<< keyHandler\n\n-- onKeyPress :: forall r i. (KeyboardEvent -> i) -> IProp (onKeyPress :: KeyboardEvent | r) i\n-- onKeyPress = handler KET.keypress <<< keyHandler\n\nonKeyUp :: forall r i. (KeyboardEvent -> i) -> IProp (onKeyUp :: KeyboardEvent | r) i\nonKeyUp = handler KET.keyup <<< keyHandler\n\nonBlur :: forall r i. (FocusEvent -> i) -> IProp (onBlur :: FocusEvent | r) i\nonBlur = handler ET.blur <<< focusHandler\n\nonFocus :: forall r i. (FocusEvent -> i) -> IProp (onFocus :: FocusEvent | r) i\nonFocus = handler FET.focus <<< focusHandler\n\nonFocusIn :: forall r i. (FocusEvent -> i) -> IProp (onFocusIn :: FocusEvent | r) i\nonFocusIn = handler FET.focusin <<< focusHandler\n\nonFocusOut :: forall r i. (FocusEvent -> i) -> IProp (onFocusOut :: FocusEvent | r) i\nonFocusOut = handler FET.focusout <<< focusHandler\n\nonDrag :: forall r i. (DragEvent -> i) -> IProp (onDrag :: DragEvent | r) i\nonDrag = handler DET.drag <<< dragHandler\n\nonDragEnd :: forall r i. (DragEvent -> i) -> IProp (onDragEnd :: DragEvent | r) i\nonDragEnd = handler DET.dragend <<< dragHandler\n\nonDragExit :: forall r i. (DragEvent -> i) -> IProp (onDragExit :: DragEvent | r) i\nonDragExit = handler DET.dragexit <<< dragHandler\n\nonDragEnter :: forall r i. (DragEvent -> i) -> IProp (onDragEnter :: DragEvent | r) i\nonDragEnter = handler DET.dragenter <<< dragHandler\n\nonDragLeave :: forall r i. (DragEvent -> i) -> IProp (onDragLeave :: DragEvent | r) i\nonDragLeave = handler DET.dragleave <<< dragHandler\n\nonDragOver :: forall r i. (DragEvent -> i) -> IProp (onDragOver :: DragEvent | r) i\nonDragOver = handler DET.dragover <<< dragHandler\n\nonDragStart :: forall r i. (DragEvent -> i) -> IProp (onDragStart :: DragEvent | r) i\nonDragStart = handler DET.dragstart <<< dragHandler\n\nonDrop :: forall r i. (DragEvent -> i) -> IProp (onDrop :: DragEvent | r) i\nonDrop = handler DET.drop <<< dragHandler\n\nonTouchCancel :: forall r i. (TouchEvent -> i) -> IProp (onTouchCancel :: TouchEvent | r) i\nonTouchCancel = handler (EventType \"touchcancel\") <<< touchHandler\n\nonTouchEnd :: forall r i. (TouchEvent -> i) -> IProp (onTouchEnd :: TouchEvent | r) i\nonTouchEnd = handler (EventType \"touchend\") <<< touchHandler\n\nonTouchEnter :: forall r i. (TouchEvent -> i) -> IProp (onTouchEnter :: TouchEvent | r) i\nonTouchEnter = handler (EventType \"touchenter\") <<< touchHandler\n\nonTouchLeave :: forall r i. (TouchEvent -> i) -> IProp (onTouchEnter :: TouchEvent | r) i\nonTouchLeave = handler (EventType \"touchleave\") <<< touchHandler\n\nonTouchMove :: forall r i. (TouchEvent -> i) -> IProp (onTouchMove :: TouchEvent | r) i\nonTouchMove = handler (EventType \"touchmove\") <<< touchHandler\n\nonTouchStart :: forall r i. (TouchEvent -> i) -> IProp (onTouchStart :: TouchEvent | r) i\nonTouchStart = handler (EventType \"touchstart\") <<< touchHandler\n\nonResize :: forall r i. (Event -> i) -> IProp (onResize :: Event | r) i\nonResize = handler (EventType \"resize\")\n\nkeyHandler :: forall i. (KeyboardEvent -> i) -> Event -> i\nkeyHandler = unsafeCoerce\n\nmouseHandler :: forall i. (MouseEvent -> i) -> Event -> i\nmouseHandler = unsafeCoerce\n\nwheelHandler :: forall i. (WheelEvent -> i) -> Event -> i\nwheelHandler = unsafeCoerce\n\nfocusHandler :: forall i. (FocusEvent -> i) -> Event -> i\nfocusHandler = unsafeCoerce\n\ndragHandler :: forall i. (DragEvent -> i) -> Event -> i\ndragHandler = unsafeCoerce\n\nclipboardHandler :: forall i. (ClipboardEvent -> i) -> Event -> i\nclipboardHandler = unsafeCoerce\n\ntouchHandler :: forall i. (TouchEvent -> i) -> Event -> i\ntouchHandler = unsafeCoerce\n\n-- | Attaches event handler to event `key` with getting `prop` field as an\n-- | argument of `handler`.\naddForeignPropHandler :: forall r i value. EventType -> String -> (Foreign -> F value) -> (value -> i) -> IProp r i\naddForeignPropHandler key prop reader f =\n  handler' key $ EE.currentTarget >=> \\e -> either (const Nothing) (Just <<< f) $ runExcept $ go e\n  where\n  go a = reader <=< readProp prop $ unsafeToForeign a\n\n-- | Attaches an event handler which will produce an input when the value of an\n-- | input field changes.\nonValueChange :: forall r i. (String -> i) -> IProp (value :: String, onChange :: Event | r) i\nonValueChange = addForeignPropHandler ET.change \"value\" readString\n\n-- | Attaches an event handler which will produce an input when the seleced index of a\n-- | `select` element changes.\nonSelectedIndexChange :: forall r i. (Int -> i) -> IProp (selectedIndex :: Int, onChange :: Event | r) i\nonSelectedIndexChange = addForeignPropHandler ET.change \"selectedIndex\" readInt\n\n-- | Attaches an event handler which will fire on input.\nonValueInput :: forall r i. (String -> i) -> IProp (value :: String, onInput :: Event | r) i\nonValueInput = addForeignPropHandler ET.input \"value\" readString\n\n-- | Attaches an event handler which will fire when a checkbox is checked or\n-- | unchecked.\nonChecked :: forall r i. (Boolean -> i) -> IProp (checked :: Boolean, onChange :: Event | r) i\nonChecked = addForeignPropHandler ET.change \"checked\" readBoolean\n", "-- | A closed signature of type-indexed (refined) HTML properties; these can be\n-- | used to ensure correctness by construction, and then erased into the\n-- | standard unrefined versions.\nmodule Halogen.HTML.Properties\n  ( IProp(..)\n  , prop\n  , attr\n  , attrNS\n  , ref\n  , expand\n\n  , alt\n  , charset\n  , class_\n  , classes\n  , cols\n  , rows\n  , colSpan\n  , rowSpan\n  , for\n  , height\n  , width\n  , href\n  , id\n  , name\n  , rel\n  , src\n  , srcDoc\n  , style\n  , scope\n  , target\n  , title\n  , download\n\n  , method\n  , action\n  , enctype\n  , noValidate\n\n  , type_\n  , value\n  , min\n  , max\n  , step\n  , disabled\n  , enabled\n  , required\n  , readOnly\n  , spellcheck\n  , checked\n  , selected\n  , selectedIndex\n  , placeholder\n  , autocomplete\n  , list\n  , autofocus\n  , multiple\n  , pattern\n  , accept\n\n  , autoplay\n  , controls\n  , loop\n  , muted\n  , poster\n  , preload\n\n  , draggable\n  , tabIndex\n\n  , module I\n  ) where\n\nimport Prelude\n\nimport DOM.HTML.Indexed (CSSPixel) as I\nimport DOM.HTML.Indexed.AutocompleteType (AutocompleteType(..)) as I\nimport DOM.HTML.Indexed.ButtonType (ButtonType(..)) as I\nimport DOM.HTML.Indexed.FormMethod (FormMethod(..)) as I\nimport DOM.HTML.Indexed.InputAcceptType (InputAcceptType(..)) as I\nimport DOM.HTML.Indexed.InputType (InputType(..)) as I\nimport DOM.HTML.Indexed.MenuType (MenuType(..)) as I\nimport DOM.HTML.Indexed.MenuitemType (MenuitemType(..)) as I\nimport DOM.HTML.Indexed.OrderedListType (OrderedListType(..)) as I\nimport DOM.HTML.Indexed.PreloadValue (PreloadValue(..)) as I\nimport DOM.HTML.Indexed.ScopeValue (ScopeValue(..)) as I\nimport DOM.HTML.Indexed.StepValue (StepValue(..)) as I\nimport Data.Maybe (Maybe(..))\nimport Data.MediaType (MediaType)\nimport Data.Newtype (class Newtype, unwrap)\nimport Data.String (joinWith)\nimport Halogen.HTML.Core (class IsProp, AttrName(..), ClassName, Namespace, PropName(..), Prop)\nimport Halogen.HTML.Core as Core\nimport Halogen.Query.Input (Input(..), RefLabel)\nimport Prim.Row as Row\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.DOM.Element (Element)\n\n-- | The phantom row `r` can be thought of as a context which is synthesized in\n-- | the course of constructing a refined HTML expression.\nnewtype IProp (r :: Row Type) i = IProp (Prop (Input i))\n\nderive instance newtypeIProp :: Newtype (IProp r i) _\nderive instance functorIProp :: Functor (IProp r)\n\n-- | Creates an indexed HTML property.\nprop\n  :: forall value r i\n   . IsProp value\n  => PropName value\n  -> value\n  -> IProp r i\nprop = (unsafeCoerce :: (PropName value -> value -> Prop (Input i)) -> PropName value -> value -> IProp r i) Core.prop\n\n-- | Creates an indexed HTML attribute.\nattr :: forall r i. AttrName -> String -> IProp r i\nattr =\n  Core.attr Nothing #\n    ( unsafeCoerce\n        :: (AttrName -> String -> Prop (Input i))\n        -> AttrName\n        -> String\n        -> IProp r i\n    )\n\n-- | Creates an indexed HTML attribute.\nattrNS :: forall r i. Namespace -> AttrName -> String -> IProp r i\nattrNS =\n  pure >>> Core.attr >>>\n    ( unsafeCoerce\n        :: (AttrName -> String -> Prop (Input i))\n        -> AttrName\n        -> String\n        -> IProp r i\n    )\n\n-- | The `ref` property allows an input to be raised once a `HTMLElement` has\n-- | been created or destroyed in the DOM for the element that the property is\n-- | attached to.\nref :: forall r i. RefLabel -> IProp r i\nref = (unsafeCoerce :: ((Maybe Element -> Maybe (Input i)) -> Prop (Input i)) -> (Maybe Element -> Maybe (Input i)) -> IProp r i) Core.ref <<< go\n  where\n  go :: RefLabel -> Maybe Element -> Maybe (Input i)\n  go p mel = Just (RefUpdate p mel)\n\n-- | Every `IProp lt i` can be cast to some `IProp gt i` as long as `lt` is a\n-- | subset of `gt`.\nexpand :: forall lt gt a i. Row.Union lt a gt => IProp lt i -> IProp gt i\nexpand = unsafeCoerce\n\nalt :: forall r i. String -> IProp (alt :: String | r) i\nalt = prop (PropName \"alt\")\n\ncharset :: forall r i. String -> IProp (charset :: String | r) i\ncharset = prop (PropName \"charset\")\n\nclass_ :: forall r i. ClassName -> IProp (class :: String | r) i\nclass_ = prop (PropName \"className\") <<< unwrap\n\nclasses :: forall r i. Array ClassName -> IProp (class :: String | r) i\nclasses = prop (PropName \"className\") <<< joinWith \" \" <<< map unwrap\n\ncols :: forall r i. Int -> IProp (cols :: Int | r) i\ncols = prop (PropName \"cols\")\n\nrows :: forall r i. Int -> IProp (rows :: Int | r) i\nrows = prop (PropName \"rows\")\n\ncolSpan :: forall r i. Int -> IProp (colSpan :: Int | r) i\ncolSpan = prop (PropName \"colSpan\")\n\nrowSpan :: forall r i. Int -> IProp (rowSpan :: Int | r) i\nrowSpan = prop (PropName \"rowSpan\")\n\nfor :: forall r i. String -> IProp (for :: String | r) i\nfor = prop (PropName \"htmlFor\")\n\nheight :: forall r i. I.CSSPixel -> IProp (height :: I.CSSPixel | r) i\nheight = prop (PropName \"height\")\n\nwidth :: forall r i. I.CSSPixel -> IProp (width :: I.CSSPixel | r) i\nwidth = prop (PropName \"width\")\n\nhref :: forall r i. String -> IProp (href :: String | r) i\nhref = prop (PropName \"href\")\n\nid :: forall r i. String -> IProp (id :: String | r) i\nid = prop (PropName \"id\")\n\nname :: forall r i. String -> IProp (name :: String | r) i\nname = prop (PropName \"name\")\n\nrel :: forall r i. String -> IProp (rel :: String | r) i\nrel = prop (PropName \"rel\")\n\nsrc :: forall r i. String -> IProp (src :: String | r) i\nsrc = prop (PropName \"src\")\n\nsrcDoc :: forall r i. String -> IProp (srcDoc :: String | r) i\nsrcDoc = prop (PropName \"srcdoc\")\n\n-- | Sets the `style` attribute to the specified string.\n-- |\n-- | ```purs\n-- | ... [ style \"height: 50px;\" ]\n-- | ```\n-- |\n-- | If you prefer to use typed CSS for this attribute, you can use the purescript-halogen-css library:\n-- | https://github.com/purescript-halogen/purescript-halogen-css\nstyle :: forall r i. String -> IProp (style :: String | r) i\nstyle = attr (AttrName \"style\")\n\nscope :: forall r i. I.ScopeValue -> IProp (scope :: I.ScopeValue | r) i\nscope = prop (PropName \"scope\")\n\ntarget :: forall r i. String -> IProp (target :: String | r) i\ntarget = prop (PropName \"target\")\n\ntitle :: forall r i. String -> IProp (title :: String | r) i\ntitle = prop (PropName \"title\")\n\ndownload :: forall r i. String -> IProp (download :: String | r) i\ndownload = prop (PropName \"download\")\n\nmethod :: forall r i. I.FormMethod -> IProp (method :: I.FormMethod | r) i\nmethod = prop (PropName \"method\")\n\naction :: forall r i. String -> IProp (action :: String | r) i\naction = prop (PropName \"action\")\n\nenctype :: forall r i. MediaType -> IProp (enctype :: MediaType | r) i\nenctype = prop (PropName \"enctype\")\n\nnoValidate :: forall r i. Boolean -> IProp (noValidate :: Boolean | r) i\nnoValidate = prop (PropName \"noValidate\")\n\ntype_ :: forall r i value. IsProp value => value -> IProp (type :: value | r) i\ntype_ = prop (PropName \"type\")\n\nvalue :: forall r i value. IsProp value => value -> IProp (value :: value | r) i\nvalue = prop (PropName \"value\")\n\nmin :: forall r i. Number -> IProp (min :: Number | r) i\nmin = prop (PropName \"min\")\n\nmax :: forall r i. Number -> IProp (max :: Number | r) i\nmax = prop (PropName \"max\")\n\nstep :: forall r i. I.StepValue -> IProp (step :: I.StepValue | r) i\nstep = prop (PropName \"step\")\n\nenabled :: forall r i. Boolean -> IProp (disabled :: Boolean | r) i\nenabled = disabled <<< not\n\ndisabled :: forall r i. Boolean -> IProp (disabled :: Boolean | r) i\ndisabled = prop (PropName \"disabled\")\n\nrequired :: forall r i. Boolean -> IProp (required :: Boolean | r) i\nrequired = prop (PropName \"required\")\n\nreadOnly :: forall r i. Boolean -> IProp (readOnly :: Boolean | r) i\nreadOnly = prop (PropName \"readOnly\")\n\nspellcheck :: forall r i. Boolean -> IProp (spellcheck :: Boolean | r) i\nspellcheck = prop (PropName \"spellcheck\")\n\nchecked :: forall r i. Boolean -> IProp (checked :: Boolean | r) i\nchecked = prop (PropName \"checked\")\n\nselected :: forall r i. Boolean -> IProp (selected :: Boolean | r) i\nselected = prop (PropName \"selected\")\n\nselectedIndex :: forall r i. Int -> IProp (selectedIndex :: Int | r) i\nselectedIndex = prop (PropName \"selectedIndex\")\n\nplaceholder :: forall r i. String -> IProp (placeholder :: String | r) i\nplaceholder = prop (PropName \"placeholder\")\n\nautocomplete :: forall r i. I.AutocompleteType -> IProp (autocomplete :: I.AutocompleteType | r) i\nautocomplete = prop (PropName \"autocomplete\")\n\nlist :: forall r i. String -> IProp (list :: String | r) i\nlist = attr (AttrName \"list\")\n\nautofocus :: forall r i. Boolean -> IProp (autofocus :: Boolean | r) i\nautofocus = prop (PropName \"autofocus\")\n\nmultiple :: forall r i. Boolean -> IProp (multiple :: Boolean | r) i\nmultiple = prop (PropName \"multiple\")\n\naccept :: forall r i. I.InputAcceptType -> IProp (accept :: I.InputAcceptType | r) i\naccept = prop (PropName \"accept\")\n\npattern :: forall r i. String -> IProp (pattern :: String | r) i\npattern = prop (PropName \"pattern\")\n\nautoplay :: forall r i. Boolean -> IProp (autoplay :: Boolean | r) i\nautoplay = prop (PropName \"autoplay\")\n\ncontrols :: forall r i. Boolean -> IProp (controls :: Boolean | r) i\ncontrols = prop (PropName \"controls\")\n\nloop :: forall r i. Boolean -> IProp (loop :: Boolean | r) i\nloop = prop (PropName \"loop\")\n\nmuted :: forall r i. Boolean -> IProp (muted :: Boolean | r) i\nmuted = prop (PropName \"muted\")\n\nposter :: forall r i. String -> IProp (poster :: String | r) i\nposter = prop (PropName \"poster\")\n\npreload :: forall r i. I.PreloadValue -> IProp (preload :: I.PreloadValue | r) i\npreload = prop (PropName \"preload\")\n\ndraggable :: forall r i. Boolean -> IProp (draggable :: Boolean | r) i\ndraggable = prop (PropName \"draggable\")\n\ntabIndex :: forall r i. Int -> IProp (tabIndex :: Int | r) i\ntabIndex = prop (PropName \"tabIndex\")\n", "/* global Symbol */\n\nvar hasArrayFrom = typeof Array.from === \"function\";\nvar hasStringIterator =\n  typeof Symbol !== \"undefined\" &&\n  Symbol != null &&\n  typeof Symbol.iterator !== \"undefined\" &&\n  typeof String.prototype[Symbol.iterator] === \"function\";\nvar hasFromCodePoint = typeof String.prototype.fromCodePoint === \"function\";\nvar hasCodePointAt = typeof String.prototype.codePointAt === \"function\";\n\nexport const _unsafeCodePointAt0 = function (fallback) {\n  return hasCodePointAt\n    ? function (str) { return str.codePointAt(0); }\n    : fallback;\n};\n\nexport const _codePointAt = function (fallback) {\n  return function (Just) {\n    return function (Nothing) {\n      return function (unsafeCodePointAt0) {\n        return function (index) {\n          return function (str) {\n            var length = str.length;\n            if (index < 0 || index >= length) return Nothing;\n            if (hasStringIterator) {\n              var iter = str[Symbol.iterator]();\n              for (var i = index;; --i) {\n                var o = iter.next();\n                if (o.done) return Nothing;\n                if (i === 0) return Just(unsafeCodePointAt0(o.value));\n              }\n            }\n            return fallback(index)(str);\n          };\n        };\n      };\n    };\n  };\n};\n\nexport const _countPrefix = function (fallback) {\n  return function (unsafeCodePointAt0) {\n    if (hasStringIterator) {\n      return function (pred) {\n        return function (str) {\n          var iter = str[Symbol.iterator]();\n          for (var cpCount = 0; ; ++cpCount) {\n            var o = iter.next();\n            if (o.done) return cpCount;\n            var cp = unsafeCodePointAt0(o.value);\n            if (!pred(cp)) return cpCount;\n          }\n        };\n      };\n    }\n    return fallback;\n  };\n};\n\nexport const _fromCodePointArray = function (singleton) {\n  return hasFromCodePoint\n    ? function (cps) {\n      // Function.prototype.apply will fail for very large second parameters,\n      // so we don't use it for arrays with 10,000 or more entries.\n      if (cps.length < 10e3) {\n        return String.fromCodePoint.apply(String, cps);\n      }\n      return cps.map(singleton).join(\"\");\n    }\n    : function (cps) {\n      return cps.map(singleton).join(\"\");\n    };\n};\n\nexport const _singleton = function (fallback) {\n  return hasFromCodePoint ? String.fromCodePoint : fallback;\n};\n\nexport const _take = function (fallback) {\n  return function (n) {\n    if (hasStringIterator) {\n      return function (str) {\n        var accum = \"\";\n        var iter = str[Symbol.iterator]();\n        for (var i = 0; i < n; ++i) {\n          var o = iter.next();\n          if (o.done) return accum;\n          accum += o.value;\n        }\n        return accum;\n      };\n    }\n    return fallback(n);\n  };\n};\n\nexport const _toCodePointArray = function (fallback) {\n  return function (unsafeCodePointAt0) {\n    if (hasArrayFrom) {\n      return function (str) {\n        return Array.from(str, unsafeCodePointAt0);\n      };\n    }\n    return fallback;\n  };\n};\n", "-- | These functions allow PureScript strings to be treated as if they were\n-- | sequences of Unicode code points instead of their true underlying\n-- | implementation (sequences of UTF-16 code units). For nearly all uses of\n-- | strings, these functions should be preferred over the ones in\n-- | `Data.String.CodeUnits`.\nmodule Data.String.CodePoints\n  ( module Exports\n  , CodePoint\n  , codePointFromChar\n  , singleton\n  , fromCodePointArray\n  , toCodePointArray\n  , codePointAt\n  , uncons\n  , length\n  , countPrefix\n  , indexOf\n  , indexOf'\n  , lastIndexOf\n  , lastIndexOf'\n  , take\n  -- , takeRight\n  , takeWhile\n  , drop\n  -- , dropRight\n  , dropWhile\n  -- , slice\n  , splitAt\n  ) where\n\nimport Prelude\n\nimport Data.Array as Array\nimport Data.Enum (class BoundedEnum, class Enum, Cardinality(..), defaultPred, defaultSucc, fromEnum, toEnum, toEnumWithDefaults)\nimport Data.Int (hexadecimal, toStringAs)\nimport Data.Maybe (Maybe(..))\nimport Data.String.CodeUnits (contains, stripPrefix, stripSuffix) as Exports\nimport Data.String.CodeUnits as CU\nimport Data.String.Common (toUpper)\nimport Data.String.Pattern (Pattern)\nimport Data.String.Unsafe as Unsafe\nimport Data.Tuple (Tuple(..))\nimport Data.Unfoldable (unfoldr)\n\n-- | CodePoint is an `Int` bounded between `0` and `0x10FFFF`, corresponding to\n-- | Unicode code points.\nnewtype CodePoint = CodePoint Int\n\nderive instance eqCodePoint :: Eq CodePoint\nderive instance ordCodePoint :: Ord CodePoint\n\ninstance showCodePoint :: Show CodePoint where\n  show (CodePoint i) = \"(CodePoint 0x\" <> toUpper (toStringAs hexadecimal i) <> \")\"\n\ninstance boundedCodePoint :: Bounded CodePoint where\n  bottom = CodePoint 0\n  top = CodePoint 0x10FFFF\n\ninstance enumCodePoint :: Enum CodePoint where\n  succ = defaultSucc toEnum fromEnum\n  pred = defaultPred toEnum fromEnum\n\ninstance boundedEnumCodePoint :: BoundedEnum CodePoint where\n  cardinality = Cardinality (0x10FFFF + 1)\n  fromEnum (CodePoint n) = n\n  toEnum n\n    | n >= 0 && n <= 0x10FFFF = Just (CodePoint n)\n    | otherwise = Nothing\n\n-- | Creates a `CodePoint` from a given `Char`.\n-- |\n-- | ```purescript\n-- | >>> codePointFromChar 'B'\n-- | CodePoint 0x42 -- represents 'B'\n-- | ```\n-- |\ncodePointFromChar :: Char -> CodePoint\ncodePointFromChar = fromEnum >>> CodePoint\n\n-- | Creates a string containing just the given code point. Operates in\n-- | constant space and time.\n-- |\n-- | ```purescript\n-- | >>> map singleton (toEnum 0x1D400)\n-- | Just \"\uD835\uDC00\"\n-- | ```\n-- |\nsingleton :: CodePoint -> String\nsingleton = _singleton singletonFallback\n\nforeign import _singleton\n  :: (CodePoint -> String)\n  -> CodePoint\n  -> String\n\nsingletonFallback :: CodePoint -> String\nsingletonFallback (CodePoint cp) | cp <= 0xFFFF = fromCharCode cp\nsingletonFallback (CodePoint cp) =\n  let lead = ((cp - 0x10000) / 0x400) + 0xD800 in\n  let trail = (cp - 0x10000) `mod` 0x400 + 0xDC00 in\n  fromCharCode lead <> fromCharCode trail\n\n-- | Creates a string from an array of code points. Operates in space and time\n-- | linear to the length of the array.\n-- |\n-- | ```purescript\n-- | >>> codePointArray = toCodePointArray \"c \uD835\uDC00\"\n-- | >>> codePointArray\n-- | [CodePoint 0x63, CodePoint 0x20, CodePoint 0x1D400]\n-- | >>> fromCodePointArray codePointArray\n-- | \"c \uD835\uDC00\"\n-- | ```\n-- |\nfromCodePointArray :: Array CodePoint -> String\nfromCodePointArray = _fromCodePointArray singletonFallback\n\nforeign import _fromCodePointArray\n  :: (CodePoint -> String)\n  -> Array CodePoint\n  -> String\n\n-- | Creates an array of code points from a string. Operates in space and time\n-- | linear to the length of the string.\n-- |\n-- | ```purescript\n-- | >>> codePointArray = toCodePointArray \"b \uD835\uDC00\uD835\uDC00\"\n-- | >>> codePointArray\n-- | [CodePoint 0x62, CodePoint 0x20, CodePoint 0x1D400, CodePoint 0x1D400]\n-- | >>> map singleton codePointArray\n-- | [\"b\", \" \", \"\uD835\uDC00\", \"\uD835\uDC00\"]\n-- | ```\n-- |\ntoCodePointArray :: String -> Array CodePoint\ntoCodePointArray = _toCodePointArray toCodePointArrayFallback unsafeCodePointAt0\n\nforeign import _toCodePointArray\n  :: (String -> Array CodePoint)\n  -> (String -> CodePoint)\n  -> String\n  -> Array CodePoint\n\ntoCodePointArrayFallback :: String -> Array CodePoint\ntoCodePointArrayFallback s = unfoldr unconsButWithTuple s\n\nunconsButWithTuple :: String -> Maybe (Tuple CodePoint String)\nunconsButWithTuple s = (\\{ head, tail } -> Tuple head tail) <$> uncons s\n\n-- | Returns the first code point of the string after dropping the given number\n-- | of code points from the beginning, if there is such a code point. Operates\n-- | in constant space and in time linear to the given index.\n-- |\n-- | ```purescript\n-- | >>> codePointAt 1 \"\uD835\uDC00\uD835\uDC00\uD835\uDC00\uD835\uDC00\"\n-- | Just (CodePoint 0x1D400) -- represents \"\uD835\uDC00\"\n-- | -- compare to Data.String:\n-- | >>> charAt 1 \"\uD835\uDC00\uD835\uDC00\uD835\uDC00\uD835\uDC00\"\n-- | Just '\uFFFD'\n-- | ```\n-- |\ncodePointAt :: Int -> String -> Maybe CodePoint\ncodePointAt n _ | n < 0 = Nothing\ncodePointAt 0 \"\" = Nothing\ncodePointAt 0 s = Just (unsafeCodePointAt0 s)\ncodePointAt n s = _codePointAt codePointAtFallback Just Nothing unsafeCodePointAt0 n s\n\nforeign import _codePointAt\n  :: (Int -> String -> Maybe CodePoint)\n  -> (forall a. a -> Maybe a)\n  -> (forall a. Maybe a)\n  -> (String -> CodePoint)\n  -> Int\n  -> String\n  -> Maybe CodePoint\n\ncodePointAtFallback :: Int -> String -> Maybe CodePoint\ncodePointAtFallback n s = case uncons s of\n  Just { head, tail } -> if n == 0 then Just head else codePointAtFallback (n - 1) tail\n  _ -> Nothing\n\n-- | Returns a record with the first code point and the remaining code points\n-- | of the string. Returns `Nothing` if the string is empty. Operates in\n-- | constant space and time.\n-- |\n-- | ```purescript\n-- | >>> uncons \"\uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Just { head: CodePoint 0x1D400, tail: \"\uD835\uDC00 c \uD835\uDC00\" }\n-- | >>> uncons \"\"\n-- | Nothing\n-- | ```\n-- |\nuncons :: String -> Maybe { head :: CodePoint, tail :: String }\nuncons s = case CU.length s of\n  0 -> Nothing\n  1 -> Just { head: CodePoint (fromEnum (Unsafe.charAt 0 s)), tail: \"\" }\n  _ ->\n    let\n      cu0 = fromEnum (Unsafe.charAt 0 s)\n      cu1 = fromEnum (Unsafe.charAt 1 s)\n    in\n      if isLead cu0 && isTrail cu1\n        then Just { head: unsurrogate cu0 cu1, tail: CU.drop 2 s }\n        else Just { head: CodePoint cu0, tail: CU.drop 1 s }\n\n-- | Returns the number of code points in the string. Operates in constant\n-- | space and in time linear to the length of the string.\n-- |\n-- | ```purescript\n-- | >>> length \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | 8\n-- | -- compare to Data.String:\n-- | >>> length \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | 11\n-- | ```\n-- |\nlength :: String -> Int\nlength = Array.length <<< toCodePointArray\n\n-- | Returns the number of code points in the leading sequence of code points\n-- | which all match the given predicate. Operates in constant space and in\n-- | time linear to the length of the string.\n-- |\n-- | ```purescript\n-- | >>> countPrefix (\\c -> fromEnum c == 0x1D400) \"\uD835\uDC00\uD835\uDC00 b c \uD835\uDC00\"\n-- | 2\n-- | ```\n-- |\ncountPrefix :: (CodePoint -> Boolean) -> String -> Int\ncountPrefix = _countPrefix countFallback unsafeCodePointAt0\n\nforeign import _countPrefix\n  :: ((CodePoint -> Boolean) -> String -> Int)\n  -> (String -> CodePoint)\n  -> (CodePoint -> Boolean)\n  -> String\n  -> Int\n\ncountFallback :: (CodePoint -> Boolean) -> String -> Int\ncountFallback p s = countTail p s 0\n\ncountTail :: (CodePoint -> Boolean) -> String -> Int -> Int\ncountTail p s accum = case uncons s of\n  Just { head, tail } -> if p head then countTail p tail (accum + 1) else accum\n  _ -> accum\n\n-- | Returns the number of code points preceding the first match of the given\n-- | pattern in the string. Returns `Nothing` when no matches are found.\n-- |\n-- | ```purescript\n-- | >>> indexOf (Pattern \"\uD835\uDC00\") \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Just 2\n-- | >>> indexOf (Pattern \"o\") \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Nothing\n-- | ```\n-- |\nindexOf :: Pattern -> String -> Maybe Int\nindexOf p s = (\\i -> length (CU.take i s)) <$> CU.indexOf p s\n\n-- | Returns the number of code points preceding the first match of the given\n-- | pattern in the string. Pattern matches preceding the given index will be\n-- | ignored. Returns `Nothing` when no matches are found.\n-- |\n-- | ```purescript\n-- | >>> indexOf' (Pattern \"\uD835\uDC00\") 4 \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Just 7\n-- | >>> indexOf' (Pattern \"o\") 4 \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Nothing\n-- | ```\n-- |\nindexOf' :: Pattern -> Int -> String -> Maybe Int\nindexOf' p i s =\n  let s' = drop i s in\n  (\\k -> i + length (CU.take k s')) <$> CU.indexOf p s'\n\n-- | Returns the number of code points preceding the last match of the given\n-- | pattern in the string. Returns `Nothing` when no matches are found.\n-- |\n-- | ```purescript\n-- | >>> lastIndexOf (Pattern \"\uD835\uDC00\") \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Just 7\n-- | >>> lastIndexOf (Pattern \"o\") \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Nothing\n-- | ```\n-- |\nlastIndexOf :: Pattern -> String -> Maybe Int\nlastIndexOf p s = (\\i -> length (CU.take i s)) <$> CU.lastIndexOf p s\n\n-- | Returns the number of code points preceding the first match of the given\n-- | pattern in the string. Pattern matches following the given index will be\n-- | ignored.\n-- |\n-- | Giving a negative index is equivalent to giving 0 and giving an index\n-- | greater than the number of code points in the string is equivalent to\n-- | searching in the whole string.\n-- |\n-- | Returns `Nothing` when no matches are found.\n-- |\n-- | ```purescript\n-- | >>> lastIndexOf' (Pattern \"\uD835\uDC00\") (-1) \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Nothing\n-- | >>> lastIndexOf' (Pattern \"\uD835\uDC00\") 0 \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Nothing\n-- | >>> lastIndexOf' (Pattern \"\uD835\uDC00\") 5 \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Just 3\n-- | >>> lastIndexOf' (Pattern \"\uD835\uDC00\") 8 \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Just 7\n-- | >>> lastIndexOf' (Pattern \"o\") 5 \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | Nothing\n-- | ```\n-- |\nlastIndexOf' :: Pattern -> Int -> String -> Maybe Int\nlastIndexOf' p i s =\n  let i' = CU.length (take i s) in\n  (\\k -> length (CU.take k s)) <$> CU.lastIndexOf' p i' s\n\n-- | Returns a string containing the given number of code points from the\n-- | beginning of the given string. If the string does not have that many code\n-- | points, returns the empty string. Operates in constant space and in time\n-- | linear to the given number.\n-- |\n-- | ```purescript\n-- | >>> take 3 \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | \"b \uD835\uDC00\"\n-- | -- compare to Data.String:\n-- | >>> take 3 \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | \"b \uFFFD\"\n-- | ```\n-- |\ntake :: Int -> String -> String\ntake = _take takeFallback\n\nforeign import _take :: (Int -> String -> String) -> Int -> String -> String\n\ntakeFallback :: Int -> String -> String\ntakeFallback n _ | n < 1 = \"\"\ntakeFallback n s = case uncons s of\n  Just { head, tail } -> singleton head <> takeFallback (n - 1) tail\n  _ -> s\n\n-- | Returns a string containing the leading sequence of code points which all\n-- | match the given predicate from the string. Operates in constant space and\n-- | in time linear to the length of the string.\n-- |\n-- | ```purescript\n-- | >>> takeWhile (\\c -> fromEnum c == 0x1D400) \"\uD835\uDC00\uD835\uDC00 b c \uD835\uDC00\"\n-- | \"\uD835\uDC00\uD835\uDC00\"\n-- | ```\n-- |\ntakeWhile :: (CodePoint -> Boolean) -> String -> String\ntakeWhile p s = take (countPrefix p s) s\n\n-- | Drops the given number of code points from the beginning of the string. If\n-- | the string does not have that many code points, returns the empty string.\n-- | Operates in constant space and in time linear to the given number.\n-- |\n-- | ```purescript\n-- | >>> drop 5 \"\uD835\uDC00\uD835\uDC00 b c\"\n-- | \"c\"\n-- | -- compared to Data.String:\n-- | >>> drop 5 \"\uD835\uDC00\uD835\uDC00 b c\"\n-- | \"b c\" -- because \"\uD835\uDC00\" occupies 2 code units\n-- | ```\n-- |\ndrop :: Int -> String -> String\ndrop n s = CU.drop (CU.length (take n s)) s\n\n-- | Drops the leading sequence of code points which all match the given\n-- | predicate from the string. Operates in constant space and in time linear\n-- | to the length of the string.\n-- |\n-- | ```purescript\n-- | >>> dropWhile (\\c -> fromEnum c == 0x1D400) \"\uD835\uDC00\uD835\uDC00 b c \uD835\uDC00\"\n-- | \" b c \uD835\uDC00\"\n-- | ```\n-- |\ndropWhile :: (CodePoint -> Boolean) -> String -> String\ndropWhile p s = drop (countPrefix p s) s\n\n-- | Splits a string into two substrings, where `before` contains the code\n-- | points up to (but not including) the given index, and `after` contains the\n-- | rest of the string, from that index on.\n-- |\n-- | ```purescript\n-- | >>> splitAt 3 \"b \uD835\uDC00\uD835\uDC00 c \uD835\uDC00\"\n-- | { before: \"b \uD835\uDC00\", after: \"\uD835\uDC00 c \uD835\uDC00\" }\n-- | ```\n-- |\n-- | Thus the length of `(splitAt i s).before` will equal either `i` or\n-- | `length s`, if that is shorter. (Or if `i` is negative the length will be\n-- | 0.)\n-- |\n-- | In code:\n-- | ```purescript\n-- | length (splitAt i s).before == min (max i 0) (length s)\n-- | (splitAt i s).before <> (splitAt i s).after == s\n-- | splitAt i s == {before: take i s, after: drop i s}\n-- | ```\nsplitAt :: Int -> String -> { before :: String, after :: String }\nsplitAt i s =\n  let before = take i s in\n  { before\n  -- inline drop i s to reuse the result of take i s\n  , after: CU.drop (CU.length before) s\n  }\n\nunsurrogate :: Int -> Int -> CodePoint\nunsurrogate lead trail = CodePoint ((lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000)\n\nisLead :: Int -> Boolean\nisLead cu = 0xD800 <= cu && cu <= 0xDBFF\n\nisTrail :: Int -> Boolean\nisTrail cu = 0xDC00 <= cu && cu <= 0xDFFF\n\nfromCharCode :: Int -> String\nfromCharCode = CU.singleton <<< toEnumWithDefaults bottom top\n\n-- WARN: this function expects the String parameter to be non-empty\nunsafeCodePointAt0 :: String -> CodePoint\nunsafeCodePointAt0 = _unsafeCodePointAt0 unsafeCodePointAt0Fallback\n\nforeign import _unsafeCodePointAt0\n  :: (String -> CodePoint)\n  -> String\n  -> CodePoint\n\nunsafeCodePointAt0Fallback :: String -> CodePoint\nunsafeCodePointAt0Fallback s =\n  let\n    cu0 = fromEnum (Unsafe.charAt 0 s)\n  in\n    if isLead cu0 && CU.length s > 1\n       then\n         let cu1 = fromEnum (Unsafe.charAt 1 s) in\n         if isTrail cu1 then unsurrogate cu0 cu1 else CodePoint cu0\n       else\n         CodePoint cu0\n", "var getEffProp = function (name) {\n  return function (doc) {\n    return function () {\n      return doc[name];\n    };\n  };\n};\n\nexport const url = getEffProp(\"URL\");\nexport const documentURI = getEffProp(\"documentURI\");\nexport const origin = getEffProp(\"origin\");\nexport const compatMode = getEffProp(\"compatMode\");\nexport const characterSet = getEffProp(\"characterSet\");\nexport const contentType = getEffProp(\"contentType\");\nexport function _doctype(doc) {\n  return doc[\"doctype\"];\n}\nexport const _documentElement = getEffProp(\"documentElement\");\n\nexport function getElementsByTagName(localName) {\n  return function (doc) {\n    return function () {\n      return doc.getElementsByTagName(localName);\n    };\n  };\n}\n\nexport function _getElementsByTagNameNS(ns) {\n  return function (localName) {\n    return function (doc) {\n      return function () {\n        return doc.getElementsByTagNameNS(ns, localName);\n      };\n    };\n  };\n}\n\nexport function getElementsByClassName(classNames) {\n  return function (doc) {\n    return function () {\n      return doc.getElementsByClassName(classNames);\n    };\n  };\n}\n\nexport function createElement(localName) {\n  return function (doc) {\n    return function () {\n      return doc.createElement(localName);\n    };\n  };\n}\n\nexport function _createElementNS(ns) {\n  return function (qualifiedName) {\n    return function (doc) {\n      return function () {\n        return doc.createElementNS(ns, qualifiedName);\n      };\n    };\n  };\n}\n\nexport function createDocumentFragment(doc) {\n  return function () {\n    return doc.createDocumentFragment();\n  };\n}\n\nexport function createTextNode(data) {\n  return function (doc) {\n    return function () {\n      return doc.createTextNode(data);\n    };\n  };\n}\n\nexport function createComment(data) {\n  return function (doc) {\n    return function () {\n      return doc.createComment(data);\n    };\n  };\n}\n\nexport function createProcessingInstruction(target) {\n  return function (data) {\n    return function (doc) {\n      return function () {\n        return doc.createProcessingInstruction(target, data);\n      };\n    };\n  };\n}\n\nexport function importNode(node) {\n  return function (deep) {\n    return function (doc) {\n      return function () {\n        return doc.importNode(node, deep);\n      };\n    };\n  };\n}\n\nexport function adoptNode(node) {\n  return function (doc) {\n    return function () {\n      return doc.adoptNode(node);\n    };\n  };\n}\n", "module Util where\n\nimport Prelude\n\nimport Control.Monad.Maybe.Trans (MaybeT(..))\nimport Data.Array (filter, find, mapMaybe)\nimport Data.Foldable (for_)\nimport Data.Maybe (Maybe(..), fromJust, fromMaybe, maybe)\nimport Data.Nullable (Nullable, toMaybe)\nimport Data.String (Pattern(..), Replacement(..), drop, replaceAll, split, take)\nimport Data.Tuple (Tuple(..), fst, snd)\nimport Effect (Effect)\nimport Halogen (ClassName(..))\nimport Halogen.HTML as HH\nimport Halogen.HTML.Properties as HP\nimport JSURI (decodeURIComponent, encodeURIComponent)\nimport Partial.Unsafe (unsafePartial)\nimport Web.DOM (Element, Node)\nimport Web.DOM.Document (toNonElementParentNode)\nimport Web.DOM.Element (fromNode, toParentNode)\nimport Web.DOM.NodeList (toArray)\nimport Web.DOM.NonElementParentNode (getElementById)\nimport Web.DOM.ParentNode (QuerySelector(..), querySelector, querySelectorAll)\nimport Web.HTML (HTMLDocument, Location, window)\nimport Web.HTML.HTMLDocument (body) as HD\nimport Web.HTML.HTMLDocument (toDocument)\nimport Web.HTML.HTMLElement (HTMLElement)\nimport Web.HTML.HTMLElement (fromElement) as HE\nimport Web.HTML.Location (search)\nimport Web.HTML.Window (document, location)\n\nunsafeDecode :: String -> String\nunsafeDecode str = unsafePartial $ fromJust $ decodeURIComponent str\n  \n-- Halogen\n\nclass_ :: forall r i. String -> HP.IProp ( \"class\" :: String | r) i\nclass_ = HP.class_ <<< HH.ClassName\n\nattr :: forall r i. String -> String -> HP.IProp r i\nattr a = HP.attr (HH.AttrName a)\n\n-- Util\n\n_queryBoth :: forall a. Tuple String Element -> Tuple String Element -> (Element -> Element -> Effect a) -> Effect Unit\n_queryBoth (Tuple qa ea) (Tuple qb eb) f = do\n   ma <- _querySelector qa ea\n   mb <- _querySelector qb eb\n   for_ ma \\a -> \n     for_ mb \\b ->\n       f a b\n\n_queryBoth' :: forall a. Tuple String Element -> Tuple String Element -> (Element -> Array Node -> Effect a) -> Effect Unit\n_queryBoth' (Tuple qa ea) (Tuple qb eb) f = do\n   ma <- _querySelector qa ea\n   bs <- _querySelectorAll qb eb\n   for_ ma \\a -> \n     f a bs\n\n_queryBoth'' :: forall a. Tuple String Element -> Tuple String Element -> (Array Node -> Array Node -> Effect a) -> Effect a\n_queryBoth'' (Tuple qa ea) (Tuple qb eb) f = do\n   as <- _querySelectorAll qa ea\n   bs <- _querySelectorAll qb eb\n   f as bs\n\n_querySelector :: String -> Element -> Effect (Maybe Element)\n_querySelector s n = querySelector (QuerySelector s) (toParentNode n)\n\n_querySelectorAll :: String -> Element -> Effect (Array Node)\n_querySelectorAll s n = toArray =<< querySelectorAll (QuerySelector s) (toParentNode n)\n\n_fromNode :: Node -> Element\n_fromNode e = unsafePartial $ fromJust (fromNode e)\n\n_fromElement :: Element -> HTMLElement\n_fromElement e = unsafePartial $ fromJust (HE.fromElement e)\n\n_getElementById :: String -> HTMLDocument -> Effect (Maybe Element)\n_getElementById s = getElementById s <<< toNonElementParentNode <<< toDocument\n\n_doc :: Effect HTMLDocument\n_doc = document =<< window \n\n_loc :: Effect Location\n_loc = location =<< window \n\ntype QueryStringArray = Array (Tuple String (Maybe String))\n\n_curQuerystring :: Effect QueryStringArray\n_curQuerystring = do\n  loc <- _loc\n  srh <- search loc\n  pure $ _parseQueryString srh\n\n_parseQueryString :: String -> QueryStringArray\n_parseQueryString srh = do\n  let qs = let srh' = take 1 srh in if (srh' == \"#\" || srh' == \"?\") then drop 1 srh else srh\n  mapMaybe go $ (filter (_ /= \"\") <<< split (Pattern \"&\")) qs\n  where\n    decode = unsafeDecode <<< replaceAll (Pattern \"+\") (Replacement \" \")\n    go kv =\n      case split (Pattern \"=\") kv of\n        [k] -> Just (Tuple (decode k) Nothing)\n        [k, v] -> Just (Tuple (decode k) (Just (decode v)))\n        _ -> Nothing\n\n_lookupQueryStringValue :: QueryStringArray -> String -> Maybe String\n_lookupQueryStringValue qs k = do\n  join $ map snd $ find ((_ == k) <<< fst) qs\n\n_body :: Effect HTMLElement\n_body = unsafePartial $ pure <<< fromJust =<< HD.body =<< _doc\n\n_mt :: forall a. Effect (Maybe a) -> MaybeT Effect a\n_mt = MaybeT\n\n_mt_pure :: forall a. Maybe a -> MaybeT Effect a\n_mt_pure = MaybeT <<< pure\n\nencodeTag :: String -> String\nencodeTag = fromMaybe \"\" <<< encodeURIComponent <<< replaceAll (Pattern \"+\") (Replacement \"%2B\")\n\ndummyAttr :: forall r i. HP.IProp r i\ndummyAttr = HP.attr (HH.AttrName \"data-dummy\") \"\"\n\nwhenP :: forall r i. Boolean -> HP.IProp r i -> HP.IProp r i\nwhenP b p = if b then p else dummyAttr\n\nmaybeP :: forall a r i. Maybe a -> (a -> HP.IProp r i) -> HP.IProp r i\nmaybeP m p = maybe dummyAttr p m\n  \nwhenC :: Boolean -> ClassName -> ClassName\nwhenC b c = if b then c else ClassName \"\"\n\nwhenH :: forall p i. Boolean -> (Unit -> HH.HTML p i) -> HH.HTML p i\nwhenH b k = if b then k unit else HH.text \"\"\n\nwhenA :: forall t. Boolean -> (Unit -> Array t) -> Array t\nwhenA b k = if b then k unit else []\n\nifElseH :: forall p i. Boolean -> (Unit -> HH.HTML p i) -> (Unit -> HH.HTML p i) -> HH.HTML p i\nifElseH b f k = if b then f unit else k unit\n\nifElseA :: forall t. Boolean -> (Unit -> Array t) -> (Unit -> Array t) -> Array t\nifElseA b f k = if b then f unit else k unit\n\nmaybeH :: forall a p i. Maybe a -> (a -> HH.HTML p i) -> HH.HTML p i\nmaybeH m k = maybe (HH.text \"\") k m\n\nfromNullableStr :: Nullable String -> String\nfromNullableStr = fromMaybe \"\" <<< toMaybe\n\nmonthNames :: Array String\nmonthNames = [\"january\", \"february\", \"march\", \"april\", \"may\", \"june\", \"july\", \"august\", \"september\", \"october\", \"november\", \"december\"]\n", "module Component.AccountSettings where\n\nimport Prelude hiding (div)\n\nimport App (editAccountSettings)\nimport Data.Lens (Lens', lens, use, (%=))\nimport Effect.Aff (Aff)\nimport Halogen as H\nimport Halogen.HTML (div, input, text)\nimport Halogen.HTML.Elements (label)\nimport Halogen.HTML.Events (onChecked)\nimport Halogen.HTML.Properties (InputType(..), checked, for, id, name, type_)\nimport Model (AccountSettings)\nimport Util (class_)\nimport Web.Event.Event (Event)\n\ntype UState =\n  { us :: AccountSettings\n  }\n\n_us :: Lens' UState AccountSettings\n_us = lens _.us (_ { us = _ })\n\ndata UAction\n  = UEditField EditField\n  | USubmit Event\n\ndata EditField\n  = EarchiveDefault Boolean\n  | EprivateDefault Boolean\n  | EprivacyLock Boolean\n\n\n-- | The bookmark component definition.\nusetting :: forall q i o. AccountSettings -> H.Component q i o Aff\nusetting u' =\n  H.mkComponent\n    { initialState: const (mkState u')\n    , render\n    , eval: H.mkEval $ H.defaultEval { handleAction = handleAction }\n    }\n  where\n\n  mkState u =\n    { us: u\n    }\n\n  render :: forall m. UState -> H.ComponentHTML UAction () m\n  render { us } =\n    div [ class_ \"settings-form\" ]\n    [ div [ class_ \"fw7 mb2\"] [ text \"Account Settings\" ]\n    , div [ class_ \"flex items-center mb2\" ]\n      [ input [ type_ InputCheckbox , class_ \"pointer mr2\" , id \"archiveDefault\", name \"archiveDefault\"\n              , checked (us.archiveDefault) , onChecked (editField EarchiveDefault) ]\n      , label [ for \"archiveDefault\", class_ \"lh-copy\" ]\n        [ text \"Archive Non-Private Bookmarks (archive.li)\" ]\n      ]\n    , div [ class_ \"flex items-center mb2\" ]\n      [ input [ type_ InputCheckbox , class_ \"pointer mr2\" , id \"privateDefault\", name \"privateDefault\"\n              , checked (us.privateDefault) , onChecked (editField EprivateDefault) ]\n      , label [ for \"privateDefault\", class_ \"lh-copy\"  ]\n        [ text \"Default new bookmarks to Private\" ]\n      ]\n    , div [ class_ \"flex items-center mb2\" ]\n      [ input [ type_ InputCheckbox , class_ \"pointer mr2\" , id \"privacyLock\", name \"privacyLock\"\n              , checked (us.privacyLock) , onChecked (editField EprivacyLock) ]\n      , label [ for \"privacyLock\", class_ \"lh-copy\"  ]\n        [ text \"Privacy Lock (Private Account)\" ]\n      ]\n    ]\n    where\n      editField :: forall a. (a -> EditField) -> a -> UAction\n      editField f = UEditField <<< f\n\n  handleAction :: UAction -> H.HalogenM UState UAction () o Aff Unit\n  handleAction (UEditField f) = do\n    _us %= case f of\n      EarchiveDefault e -> _ { archiveDefault = e }\n      EprivateDefault e -> _ { privateDefault = e }\n      EprivacyLock e -> _ { privacyLock = e }\n    us <- use _us\n    void $ H.liftAff (editAccountSettings us)\n\n  handleAction (USubmit _) = do\n    us <- use _us\n    void $ H.liftAff (editAccountSettings us)\n", "export const log = function (s) {\n  return function () {\n    console.log(s);\n  };\n};\n\nexport const warn = function (s) {\n  return function () {\n    console.warn(s);\n  };\n};\n\nexport const error = function (s) {\n  return function () {\n    console.error(s);\n  };\n};\n\nexport const info = function (s) {\n  return function () {\n    console.info(s);\n  };\n};\n\nexport const debug = function (s) {\n  return function () {\n    console.debug(s);\n  };\n};\n\nexport const time = function (s) {\n  return function () {\n    console.time(s);\n  };\n};\n\nexport const timeLog = function (s) {\n  return function () {\n    console.timeLog(s);\n  };\n};\n\nexport const timeEnd = function (s) {\n  return function () {\n    console.timeEnd(s);\n  };\n};\n\nexport const clear = function () {\n  console.clear();\n};\n\nexport const group = function (s) {\n  return function () {\n    console.group(s);\n  };\n};\n\nexport const groupCollapsed = function (s) {\n  return function () {\n    console.groupCollapsed(s);\n  };\n};\n\nexport const groupEnd = function () {\n  console.groupEnd();\n};\n", "module Component.Add where\n\nimport Prelude hiding (div)\n\nimport Affjax (printError)\nimport Affjax.StatusCode (StatusCode(..))\nimport App (destroy, editBookmark, lookupTitle)\nimport Data.Either (Either(..))\nimport Data.Lens (Lens', lens, use, (%=), (.=))\nimport Data.Maybe (Maybe(..), fromMaybe, isJust, maybe)\nimport Data.Monoid (guard)\nimport Data.String (Pattern(..), null, stripPrefix)\nimport Data.Tuple (fst, snd)\nimport Effect.Aff (Aff)\nimport Effect.Class (liftEffect)\nimport Effect.Console (log)\nimport Globals (closeWindow, mmoment8601)\nimport Halogen as H\nimport Halogen.HTML (button, div, form, input, label, p, span, table, tbody_, td, td_, text, textarea, tr_)\nimport Halogen.HTML.Events (onSubmit, onValueChange, onChecked, onClick)\nimport Halogen.HTML.Properties (ButtonType(..), InputType(..), autocomplete, autofocus, checked, disabled, for, id, name, required, rows, title, type_, value)\nimport Model (Bookmark)\nimport Util (_curQuerystring, _loc, _doc, _lookupQueryStringValue, attr, class_, ifElseH, whenH)\nimport Web.Event.Event (Event, preventDefault)\nimport Web.HTML (window)\nimport Web.HTML.HTMLDocument (referrer)\nimport Web.HTML.Location (setHref, origin)\nimport DOM.HTML.Indexed.AutocompleteType (AutocompleteType(..))\n\ndata BAction\n  = BEditField EditField\n  | BEditSubmit Event\n  | BDeleteAsk Boolean\n  | BLookupTitle\n  | BDestroy\n\ndata EditField\n  = Eurl String\n  | Etitle String\n  | Edescription String\n  | Etags String\n  | Eprivate Boolean\n  | Etoread Boolean\n\ntype BState =\n  { bm :: Bookmark\n  , edit_bm :: Bookmark\n  , deleteAsk :: Boolean\n  , loading :: Boolean\n  , destroyed :: Boolean\n  , apiError :: Maybe String\n  }\n\n_bm :: Lens' BState Bookmark\n_bm = lens _.bm (_ { bm = _ })\n\n_edit_bm :: Lens' BState Bookmark\n_edit_bm = lens _.edit_bm (_ { edit_bm = _ })\n\n_apiError :: Lens' BState (Maybe String)\n_apiError = lens _.apiError (_ { apiError = _ })\n\naddbmark :: forall q i o. Bookmark -> H.Component q i o Aff\naddbmark b' =\n  H.mkComponent\n    { initialState: const (mkState b')\n    , render\n    , eval: H.mkEval $ H.defaultEval { handleAction = handleAction }\n    }\n  where\n\n  mkState b =\n    { bm: b\n    , edit_bm: b\n    , deleteAsk: false\n    , destroyed: false\n    , loading: false\n    , apiError: Nothing\n    }\n\n  render :: forall m. BState -> H.ComponentHTML BAction () m\n  render s@{ bm, edit_bm, apiError } =\n    ifElseH (not s.destroyed)\n      display_edit\n      display_destroyed\n   where\n     display_edit _ =\n       form [ onSubmit BEditSubmit ]\n       [ table [ class_ \"w-100\" ]\n         [ tbody_\n           [ tr_\n             [ td [ class_ \"w1\" ] [ ]\n             , td_ [ whenH (bm.bid > 0)\n                       display_exists,\n                     whenH (isJust apiError)\n                       (alert_notification (fromMaybe \"\" apiError))\n                   ]\n             ]\n           , tr_\n             [ td_ [ label [ for \"url\" ] [ text \"URL\" ] ]\n             , td_ [ input [ type_ InputUrl , id \"url\", class_ \"w-100 mv1\" , required true, name \"url\", autofocus (null bm.url)\n                          , value (edit_bm.url) , onValueChange (editField Eurl)] ]\n             ]\n           , tr_\n             [ td_ [ label [ for \"title\" ] [ text \"title\" ] ]\n             , td [class_ \"flex\"]\n                  [ input [ type_ InputText , id \"title\", class_ \"w-100 mv1 flex-auto\" , name \"title\" , value (edit_bm.title) , onValueChange (editField Etitle)]\n                  , button [ disabled s.loading, type_ ButtonButton, onClick \\_ -> BLookupTitle, class_ (\"ml2 input-reset ba b--navy pointer f6 di dim pa1 ma1 mr0 \" <> guard s.loading \"bg-light-silver\") ] [ text \"fetch\" ]\n                  ]\n             ]\n           , tr_\n             [ td_ [ label [ for \"description\" ] [ text \"description\" ] ]\n             , td_ [ textarea [ class_ \"w-100 mt1 mid-gray\" , id \"description\", name \"description\", rows 4\n                              , value (edit_bm.description) , onValueChange (editField Edescription)] ]\n             ]\n           , tr_\n             [ td_ [ label [ for \"tags\" ] [ text \"tags\" ] ]\n             , td_ [ input [ type_ InputText , id \"tags\", class_ \"w-100 mv1\" , name \"tags\", autocomplete AutocompleteOff, attr \"autocapitalize\" \"off\", autofocus (not $ null bm.url)\n                           , value (edit_bm.tags) , onValueChange (editField Etags)] ]\n             ]\n           , tr_\n             [ td_ [ label [ for \"private\" ] [ text \"private\" ] ]\n             , td_ [ input [ type_ InputCheckbox , id \"private\", class_ \"private pointer\" , name \"private\"\n                           , checked (edit_bm.private) , onChecked (editField Eprivate)] ]\n             ]\n           , tr_\n             [ td_ [ label [ for \"toread\" ] [ text \"read later\" ] ]\n             , td_ [ input [ type_ InputCheckbox , id \"toread\", class_ \"toread pointer\" , name \"toread\"\n                           , checked (edit_bm.toread) , onChecked (editField Etoread)] ]\n             ]\n           , tr_\n             [ td_ [ ]\n             , td_ [ input [ type_ InputSubmit , class_ \"ph3 pv2 input-reset ba b--navy bg-transparent pointer f6 dib mt1 dim\"\n                           , value (if bm.bid > 0 then \"update bookmark\" else \"add bookmark\") ] ]\n             ]\n           ]\n         ]\n       ]\n\n     display_exists _ = \n       div [ class_ \"alert\" ]\n       [ text \"previously saved\u00A0\"\n       , span [ class_ \"link f7 dib gray pr3\" , title (maybe bm.time snd mmoment) ]\n         [ text (maybe \"\u00A0\" fst mmoment) ]\n       , div [ class_ \"edit_links dib ml1\" ]\n         [ div [ class_ \"delete_link di\" ]\n           [ button ([ type_ ButtonButton, onClick \\_ -> BDeleteAsk true, class_ \"delete\" ] <> guard s.deleteAsk [ attr \"hidden\" \"hidden\" ]) [ text \"delete\" ]\n           , span ([ class_ \"confirm red\" ] <> guard (not s.deleteAsk) [ attr \"hidden\" \"hidden\" ])\n             [ button [ type_ ButtonButton, onClick \\_ -> BDeleteAsk false] [ text \"cancel\u00A0/\u00A0\" ]\n             , button [ type_ ButtonButton, onClick \\_ -> BDestroy, class_ \"red\" ] [ text \"destroy\" ]\n             ] \n           ]\n         ]\n       ]\n\n     alert_notification alert_text _ = \n       div [ class_ \"alert alert-err\" ] [ text alert_text ]\n\n     display_destroyed _ = p [ class_ \"red\"] [text \"you killed this bookmark\"]\n\n     editField :: forall a. (a -> EditField) -> a -> BAction\n     editField f = BEditField <<< f\n     mmoment = mmoment8601 bm.time\n     -- toTextarea =\n     --   drop 1\n     --     <<< foldMap (\\x -> [br_, text x])\n     --     <<< S.split (Pattern \"\\n\")\n\n  handleAction :: BAction -> H.HalogenM BState BAction () o Aff Unit\n  handleAction (BDeleteAsk e) = do\n    H.modify_ (_ { deleteAsk = e })\n\n  handleAction BLookupTitle = do\n    H.modify_ (_ { loading = true })\n    edit_bm <- H.gets _.edit_bm\n    mtitle <- H.liftAff $ lookupTitle edit_bm\n    case mtitle of\n      Just title' -> _edit_bm %= (_ { title = title' })\n      Nothing -> pure $ unit\n    H.modify_ (_ { loading = false })\n\n  handleAction (BDestroy) = do\n    bid <- H.gets _.bm.bid\n    void $ H.liftAff (destroy bid)\n    H.modify_ (_ { destroyed = true })\n\n  handleAction (BEditField f) = do\n    _edit_bm %= case f of\n      Eurl e -> _ { url = e }\n      Etitle e -> _ { title = e }\n      Edescription e -> _ { description = e }\n      Etags e -> _ { tags = e }\n      Eprivate e -> _ { private = e }\n      Etoread e -> _ { toread = e }\n\n  handleAction (BEditSubmit e) = do\n    liftEffect (preventDefault e)\n    edit_bm <- use _edit_bm \n    _apiError .= Nothing\n    H.liftAff (editBookmark edit_bm) >>= case _ of\n      Left affErr -> do\n        _apiError .= Just (printError affErr)\n        liftEffect $ log (printError affErr)\n      Right { status: StatusCode s } | s >= 200 && s < 300 -> do\n        _bm .= edit_bm\n        qs <- liftEffect $ _curQuerystring\n        doc <- liftEffect $ _doc\n        ref <- liftEffect $ referrer doc\n        loc <- liftEffect $ _loc\n        org <- liftEffect $ origin loc\n        case _lookupQueryStringValue qs \"next\" of\n          Just \"closeWindow\" -> liftEffect $ closeWindow =<< window\n          Just \"back\" -> liftEffect $\n            case stripPrefix (Pattern org) ref of\n              Just _ -> setHref ref loc\n              Nothing -> setHref org loc\n          _ -> liftEffect $ closeWindow =<< window\n      Right res -> do\n        _apiError .= Just (res.body)\n        liftEffect $ log (res.body)\n", "// use at your own risk!\nexport const unsafeSetInnerHTML = function(element) {\n  return function(html) {\n    return function() {\n      element.innerHTML = html;\n    };\n  };\n};\n", "-- | Functions and types used to describe the `HalogenF` algebra used in a\n-- | component's `eval` function.\nmodule Halogen.Query\n  ( Tell\n  , mkTell\n  , tell\n  , tellAll\n  , Request\n  , mkRequest\n  , request\n  , requestAll\n  , getHTMLElementRef\n  , module Exports\n  , module Halogen.Query.Input\n  , module Halogen.Query.HalogenM\n  , module Halogen.Query.HalogenQ\n  ) where\n\nimport Prelude hiding (join)\n\nimport Control.Monad.State.Class (get, gets, modify, modify_, put) as Exports\nimport Control.Monad.Trans.Class (lift) as Exports\nimport Data.Map (Map)\nimport Data.Maybe (Maybe)\nimport Data.Symbol (class IsSymbol)\nimport Effect.Aff.Class (liftAff) as Exports\nimport Effect.Class (liftEffect) as Exports\nimport Halogen.Data.Slot (Slot)\nimport Halogen.Query.HalogenM (ForkId, HalogenF(..), HalogenM(..), SubscriptionId, fork, getRef, join, kill, query, queryAll, raise, subscribe, subscribe', unsubscribe)\nimport Halogen.Query.HalogenQ (HalogenQ(..))\nimport Halogen.Query.Input (RefLabel(..))\nimport Prim.Row as Row\nimport Type.Proxy (Proxy)\nimport Web.HTML.HTMLElement (HTMLElement)\nimport Web.HTML.HTMLElement as HTMLElement\n\n-- | Type synonym for a \"tell-style\" query - queries that only cause effects,\n-- | but that cannot receive a return value.\n-- |\n-- | In a query algebra, a tell constructor carries the algebra's type variable\n-- | as its last argument. For example:\n-- |\n-- | ``` purescript\n-- | data Query a\n-- |   = SomeTell a\n-- |   | SomeOtherTell String a\n-- |   | NotATell (Boolean -> a)\n-- | ```\n-- |\n-- | Both `SomeTell` and `SomeOtherTell` carry a plain `a` as a value, whereas\n-- | `NotATell` has `a` as the result of a function so is considered to be a\n-- | \"request\" ([see below](#Request)).\ntype Tell f = Unit -> f Unit\n\n-- | Takes a data constructor of query algebra `f` and creates a tell query.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | data Query a = Tick a\n-- |\n-- | sendTick :: forall o. H.HalogenIO Query o Aff -> Aff (Maybe Unit)\n-- | sendTick app = app.query (H.mkTell Tick)\n-- | ```\nmkTell :: forall f. Tell f -> f Unit\nmkTell act = act unit\n\ntell\n  :: forall state action output m label slots query output' slot _1\n   . Row.Cons label (Slot query output' slot) _1 slots\n  => IsSymbol label\n  => Ord slot\n  => Proxy label\n  -> slot\n  -> Tell query\n  -> HalogenM state action slots output m Unit\ntell slot label req = void $ query slot label (req unit)\n\ntellAll\n  :: forall state action output m label slots query output' slot _1\n   . Row.Cons label (Slot query output' slot) _1 slots\n  => IsSymbol label\n  => Ord slot\n  => Proxy label\n  -> Tell query\n  -> HalogenM state action slots output m Unit\ntellAll label req = void $ queryAll label (req unit)\n\n-- | Type synonym for an \"request-style\" query - queries that can cause effects\n-- | as well as fetching some information from a component.\n-- |\n-- | In a query algebra, a request constructor carries the algebra's type\n-- | variable as the return value of a function as its last argument. For\n-- | example:\n-- |\n-- | ``` purescript\n-- | data Query a = SomeRequest (Boolean -> a)\n-- | ```\ntype Request f a = (a -> a) -> f a\n\n-- | Takes a data constructor of query algebra `f` and creates a request query.\n-- |\n-- | For example:\n-- |\n-- | ```purescript\n-- | data Query a = GetTickCount (Int -> a)\n-- |\n-- | getTickCount :: forall o. H.HalogenIO Query o Aff -> Aff (Maybe Int)\n-- | getTickCount app = app.query (H.mkRequest GetTickCount)\n-- | ```\nmkRequest :: forall f a. Request f a -> f a\nmkRequest req = req identity\n\nrequest\n  :: forall state action output m label slots query output' slot a _1\n   . Row.Cons label (Slot query output' slot) _1 slots\n  => IsSymbol label\n  => Ord slot\n  => Proxy label\n  -> slot\n  -> Request query a\n  -> HalogenM state action slots output m (Maybe a)\nrequest slot label req = query slot label (req identity)\n\nrequestAll\n  :: forall state action output m label slots query output' slot a _1\n   . Row.Cons label (Slot query output' slot) _1 slots\n  => IsSymbol label\n  => Ord slot\n  => Proxy label\n  -> Request query a\n  -> HalogenM state action slots output m (Map slot a)\nrequestAll label req = queryAll label (req identity)\n\n-- | Retrieves a `HTMLElement` value that is associated with a `Ref` in the\n-- | rendered output of a component. If there is no currently rendered value (or\n-- | it is not an `HTMLElement`) for the request will return `Nothing`.\ngetHTMLElementRef\n  :: forall state action slots output m\n   . RefLabel\n  -> HalogenM state action slots output m (Maybe HTMLElement)\ngetHTMLElementRef = map (HTMLElement.fromElement =<< _) <<< getRef\n", "module Component.RawHtml where\n\nimport Prelude\n\nimport Data.Foldable (for_)\nimport Data.Maybe (Maybe(..))\nimport Effect (Effect)\nimport Effect.Aff (Aff, forkAff, makeAff)\nimport Effect.Class (liftEffect)\nimport Globals (RawHTML(..))\nimport Halogen as H\nimport Halogen.HTML as HH\nimport Halogen.HTML.Properties as HP\nimport Web.HTML (HTMLElement)\n\nforeign import unsafeSetInnerHTML :: HTMLElement -> RawHTML -> Effect Unit\n\ndata Action i\n  = SetInnerHTML\n  | Receive (Input i)\n\ntype Input :: forall k. k -> k\ntype Input i = i\n\ntype State i =\n  { elRef :: H.RefLabel\n  , inputval :: Input i\n  }\n\ncomponent :: forall q o. H.Component q (Input String) o Aff\ncomponent = mkComponent RawHTML\n\nmkComponent :: forall q i o. (Input i -> RawHTML) -> H.Component q (Input i) o Aff\nmkComponent toRawHTML =\n  H.mkComponent\n    { initialState: \\inputval -> { elRef: H.RefLabel \"inputval\", inputval } \n    , render\n    , eval: H.mkEval (H.defaultEval { handleAction = handleAction\n                                    , initialize = Just SetInnerHTML\n                                    , receive = Just <<< Receive\n                                    })\n    }\n  where\n  render :: forall m. (State i) -> H.ComponentHTML (Action i) () m\n  render state = \n    HH.div \n      [ HP.ref state.elRef ] \n      []\n\n  handleAction :: (Action i) -> H.HalogenM (State i) (Action i) () o Aff Unit\n  handleAction = case _ of\n    SetInnerHTML -> do\n      { elRef } <- H.get\n      mel <- H.getHTMLElementRef elRef\n      for_ mel \\el -> do  \n        { inputval } <- H.get\n        H.liftAff $ forkAff $ makeAff \\_ -> do\n          liftEffect $ unsafeSetInnerHTML el (toRawHTML inputval)\n          mempty\n      pure unit\n    \n    Receive inputval -> do\n      H.modify_ _ { inputval = inputval }\n      handleAction $ SetInnerHTML\n", "/**\n * Gets the original marked default options.\n */\nexport function _getDefaults() {\n    return {\n        async: false,\n        breaks: false,\n        extensions: null,\n        gfm: true,\n        hooks: null,\n        pedantic: false,\n        renderer: null,\n        silent: false,\n        tokenizer: null,\n        walkTokens: null\n    };\n}\nexport let _defaults = _getDefaults();\nexport function changeDefaults(newDefaults) {\n    _defaults = newDefaults;\n}\n", "/**\n * Helpers\n */\nconst escapeTest = /[&<>\"']/;\nconst escapeReplace = new RegExp(escapeTest.source, 'g');\nconst escapeTestNoEncode = /[<>\"']|&(?!(#\\d{1,7}|#[Xx][a-fA-F0-9]{1,6}|\\w+);)/;\nconst escapeReplaceNoEncode = new RegExp(escapeTestNoEncode.source, 'g');\nconst escapeReplacements = {\n    '&': '&amp;',\n    '<': '&lt;',\n    '>': '&gt;',\n    '\"': '&quot;',\n    \"'\": '&#39;'\n};\nconst getEscapeReplacement = (ch) => escapeReplacements[ch];\nexport function escape(html, encode) {\n    if (encode) {\n        if (escapeTest.test(html)) {\n            return html.replace(escapeReplace, getEscapeReplacement);\n        }\n    }\n    else {\n        if (escapeTestNoEncode.test(html)) {\n            return html.replace(escapeReplaceNoEncode, getEscapeReplacement);\n        }\n    }\n    return html;\n}\nconst unescapeTest = /&(#(?:\\d+)|(?:#x[0-9A-Fa-f]+)|(?:\\w+));?/ig;\nexport function unescape(html) {\n    // explicitly match decimal, hex, and named HTML entities\n    return html.replace(unescapeTest, (_, n) => {\n        n = n.toLowerCase();\n        if (n === 'colon')\n            return ':';\n        if (n.charAt(0) === '#') {\n            return n.charAt(1) === 'x'\n                ? String.fromCharCode(parseInt(n.substring(2), 16))\n                : String.fromCharCode(+n.substring(1));\n        }\n        return '';\n    });\n}\nconst caret = /(^|[^\\[])\\^/g;\nexport function edit(regex, opt) {\n    let source = typeof regex === 'string' ? regex : regex.source;\n    opt = opt || '';\n    const obj = {\n        replace: (name, val) => {\n            let valSource = typeof val === 'string' ? val : val.source;\n            valSource = valSource.replace(caret, '$1');\n            source = source.replace(name, valSource);\n            return obj;\n        },\n        getRegex: () => {\n            return new RegExp(source, opt);\n        }\n    };\n    return obj;\n}\nexport function cleanUrl(href) {\n    try {\n        href = encodeURI(href).replace(/%25/g, '%');\n    }\n    catch (e) {\n        return null;\n    }\n    return href;\n}\nexport const noopTest = { exec: () => null };\nexport function splitCells(tableRow, count) {\n    // ensure that every cell-delimiting pipe has a space\n    // before it to distinguish it from an escaped pipe\n    const row = tableRow.replace(/\\|/g, (match, offset, str) => {\n        let escaped = false;\n        let curr = offset;\n        while (--curr >= 0 && str[curr] === '\\\\')\n            escaped = !escaped;\n        if (escaped) {\n            // odd number of slashes means | is escaped\n            // so we leave it alone\n            return '|';\n        }\n        else {\n            // add space before unescaped |\n            return ' |';\n        }\n    }), cells = row.split(/ \\|/);\n    let i = 0;\n    // First/last cell in a row cannot be empty if it has no leading/trailing pipe\n    if (!cells[0].trim()) {\n        cells.shift();\n    }\n    if (cells.length > 0 && !cells[cells.length - 1].trim()) {\n        cells.pop();\n    }\n    if (count) {\n        if (cells.length > count) {\n            cells.splice(count);\n        }\n        else {\n            while (cells.length < count)\n                cells.push('');\n        }\n    }\n    for (; i < cells.length; i++) {\n        // leading or trailing whitespace is ignored per the gfm spec\n        cells[i] = cells[i].trim().replace(/\\\\\\|/g, '|');\n    }\n    return cells;\n}\n/**\n * Remove trailing 'c's. Equivalent to str.replace(/c*$/, '').\n * /c*$/ is vulnerable to REDOS.\n *\n * @param str\n * @param c\n * @param invert Remove suffix of non-c chars instead. Default falsey.\n */\nexport function rtrim(str, c, invert) {\n    const l = str.length;\n    if (l === 0) {\n        return '';\n    }\n    // Length of suffix matching the invert condition.\n    let suffLen = 0;\n    // Step left until we fail to match the invert condition.\n    while (suffLen < l) {\n        const currChar = str.charAt(l - suffLen - 1);\n        if (currChar === c && !invert) {\n            suffLen++;\n        }\n        else if (currChar !== c && invert) {\n            suffLen++;\n        }\n        else {\n            break;\n        }\n    }\n    return str.slice(0, l - suffLen);\n}\nexport function findClosingBracket(str, b) {\n    if (str.indexOf(b[1]) === -1) {\n        return -1;\n    }\n    let level = 0;\n    for (let i = 0; i < str.length; i++) {\n        if (str[i] === '\\\\') {\n            i++;\n        }\n        else if (str[i] === b[0]) {\n            level++;\n        }\n        else if (str[i] === b[1]) {\n            level--;\n            if (level < 0) {\n                return i;\n            }\n        }\n    }\n    return -1;\n}\n", "import { _defaults } from './defaults.ts';\nimport { rtrim, splitCells, escape, findClosingBracket } from './helpers.ts';\nfunction outputLink(cap, link, raw, lexer) {\n    const href = link.href;\n    const title = link.title ? escape(link.title) : null;\n    const text = cap[1].replace(/\\\\([\\[\\]])/g, '$1');\n    if (cap[0].charAt(0) !== '!') {\n        lexer.state.inLink = true;\n        const token = {\n            type: 'link',\n            raw,\n            href,\n            title,\n            text,\n            tokens: lexer.inlineTokens(text)\n        };\n        lexer.state.inLink = false;\n        return token;\n    }\n    return {\n        type: 'image',\n        raw,\n        href,\n        title,\n        text: escape(text)\n    };\n}\nfunction indentCodeCompensation(raw, text) {\n    const matchIndentToCode = raw.match(/^(\\s+)(?:```)/);\n    if (matchIndentToCode === null) {\n        return text;\n    }\n    const indentToCode = matchIndentToCode[1];\n    return text\n        .split('\\n')\n        .map(node => {\n        const matchIndentInNode = node.match(/^\\s+/);\n        if (matchIndentInNode === null) {\n            return node;\n        }\n        const [indentInNode] = matchIndentInNode;\n        if (indentInNode.length >= indentToCode.length) {\n            return node.slice(indentToCode.length);\n        }\n        return node;\n    })\n        .join('\\n');\n}\n/**\n * Tokenizer\n */\nexport class _Tokenizer {\n    options;\n    rules; // set by the lexer\n    lexer; // set by the lexer\n    constructor(options) {\n        this.options = options || _defaults;\n    }\n    space(src) {\n        const cap = this.rules.block.newline.exec(src);\n        if (cap && cap[0].length > 0) {\n            return {\n                type: 'space',\n                raw: cap[0]\n            };\n        }\n    }\n    code(src) {\n        const cap = this.rules.block.code.exec(src);\n        if (cap) {\n            const text = cap[0].replace(/^ {1,4}/gm, '');\n            return {\n                type: 'code',\n                raw: cap[0],\n                codeBlockStyle: 'indented',\n                text: !this.options.pedantic\n                    ? rtrim(text, '\\n')\n                    : text\n            };\n        }\n    }\n    fences(src) {\n        const cap = this.rules.block.fences.exec(src);\n        if (cap) {\n            const raw = cap[0];\n            const text = indentCodeCompensation(raw, cap[3] || '');\n            return {\n                type: 'code',\n                raw,\n                lang: cap[2] ? cap[2].trim().replace(this.rules.inline.anyPunctuation, '$1') : cap[2],\n                text\n            };\n        }\n    }\n    heading(src) {\n        const cap = this.rules.block.heading.exec(src);\n        if (cap) {\n            let text = cap[2].trim();\n            // remove trailing #s\n            if (/#$/.test(text)) {\n                const trimmed = rtrim(text, '#');\n                if (this.options.pedantic) {\n                    text = trimmed.trim();\n                }\n                else if (!trimmed || / $/.test(trimmed)) {\n                    // CommonMark requires space before trailing #s\n                    text = trimmed.trim();\n                }\n            }\n            return {\n                type: 'heading',\n                raw: cap[0],\n                depth: cap[1].length,\n                text,\n                tokens: this.lexer.inline(text)\n            };\n        }\n    }\n    hr(src) {\n        const cap = this.rules.block.hr.exec(src);\n        if (cap) {\n            return {\n                type: 'hr',\n                raw: cap[0]\n            };\n        }\n    }\n    blockquote(src) {\n        const cap = this.rules.block.blockquote.exec(src);\n        if (cap) {\n            const text = rtrim(cap[0].replace(/^ *>[ \\t]?/gm, ''), '\\n');\n            const top = this.lexer.state.top;\n            this.lexer.state.top = true;\n            const tokens = this.lexer.blockTokens(text);\n            this.lexer.state.top = top;\n            return {\n                type: 'blockquote',\n                raw: cap[0],\n                tokens,\n                text\n            };\n        }\n    }\n    list(src) {\n        let cap = this.rules.block.list.exec(src);\n        if (cap) {\n            let bull = cap[1].trim();\n            const isordered = bull.length > 1;\n            const list = {\n                type: 'list',\n                raw: '',\n                ordered: isordered,\n                start: isordered ? +bull.slice(0, -1) : '',\n                loose: false,\n                items: []\n            };\n            bull = isordered ? `\\\\d{1,9}\\\\${bull.slice(-1)}` : `\\\\${bull}`;\n            if (this.options.pedantic) {\n                bull = isordered ? bull : '[*+-]';\n            }\n            // Get next list item\n            const itemRegex = new RegExp(`^( {0,3}${bull})((?:[\\t ][^\\\\n]*)?(?:\\\\n|$))`);\n            let raw = '';\n            let itemContents = '';\n            let endsWithBlankLine = false;\n            // Check if current bullet point can start a new List Item\n            while (src) {\n                let endEarly = false;\n                if (!(cap = itemRegex.exec(src))) {\n                    break;\n                }\n                if (this.rules.block.hr.test(src)) { // End list if bullet was actually HR (possibly move into itemRegex?)\n                    break;\n                }\n                raw = cap[0];\n                src = src.substring(raw.length);\n                let line = cap[2].split('\\n', 1)[0].replace(/^\\t+/, (t) => ' '.repeat(3 * t.length));\n                let nextLine = src.split('\\n', 1)[0];\n                let indent = 0;\n                if (this.options.pedantic) {\n                    indent = 2;\n                    itemContents = line.trimStart();\n                }\n                else {\n                    indent = cap[2].search(/[^ ]/); // Find first non-space char\n                    indent = indent > 4 ? 1 : indent; // Treat indented code blocks (> 4 spaces) as having only 1 indent\n                    itemContents = line.slice(indent);\n                    indent += cap[1].length;\n                }\n                let blankLine = false;\n                if (!line && /^ *$/.test(nextLine)) { // Items begin with at most one blank line\n                    raw += nextLine + '\\n';\n                    src = src.substring(nextLine.length + 1);\n                    endEarly = true;\n                }\n                if (!endEarly) {\n                    const nextBulletRegex = new RegExp(`^ {0,${Math.min(3, indent - 1)}}(?:[*+-]|\\\\d{1,9}[.)])((?:[ \\t][^\\\\n]*)?(?:\\\\n|$))`);\n                    const hrRegex = new RegExp(`^ {0,${Math.min(3, indent - 1)}}((?:- *){3,}|(?:_ *){3,}|(?:\\\\* *){3,})(?:\\\\n+|$)`);\n                    const fencesBeginRegex = new RegExp(`^ {0,${Math.min(3, indent - 1)}}(?:\\`\\`\\`|~~~)`);\n                    const headingBeginRegex = new RegExp(`^ {0,${Math.min(3, indent - 1)}}#`);\n                    // Check if following lines should be included in List Item\n                    while (src) {\n                        const rawLine = src.split('\\n', 1)[0];\n                        nextLine = rawLine;\n                        // Re-align to follow commonmark nesting rules\n                        if (this.options.pedantic) {\n                            nextLine = nextLine.replace(/^ {1,4}(?=( {4})*[^ ])/g, '  ');\n                        }\n                        // End list item if found code fences\n                        if (fencesBeginRegex.test(nextLine)) {\n                            break;\n                        }\n                        // End list item if found start of new heading\n                        if (headingBeginRegex.test(nextLine)) {\n                            break;\n                        }\n                        // End list item if found start of new bullet\n                        if (nextBulletRegex.test(nextLine)) {\n                            break;\n                        }\n                        // Horizontal rule found\n                        if (hrRegex.test(src)) {\n                            break;\n                        }\n                        if (nextLine.search(/[^ ]/) >= indent || !nextLine.trim()) { // Dedent if possible\n                            itemContents += '\\n' + nextLine.slice(indent);\n                        }\n                        else {\n                            // not enough indentation\n                            if (blankLine) {\n                                break;\n                            }\n                            // paragraph continuation unless last line was a different block level element\n                            if (line.search(/[^ ]/) >= 4) { // indented code block\n                                break;\n                            }\n                            if (fencesBeginRegex.test(line)) {\n                                break;\n                            }\n                            if (headingBeginRegex.test(line)) {\n                                break;\n                            }\n                            if (hrRegex.test(line)) {\n                                break;\n                            }\n                            itemContents += '\\n' + nextLine;\n                        }\n                        if (!blankLine && !nextLine.trim()) { // Check if current line is blank\n                            blankLine = true;\n                        }\n                        raw += rawLine + '\\n';\n                        src = src.substring(rawLine.length + 1);\n                        line = nextLine.slice(indent);\n                    }\n                }\n                if (!list.loose) {\n                    // If the previous item ended with a blank line, the list is loose\n                    if (endsWithBlankLine) {\n                        list.loose = true;\n                    }\n                    else if (/\\n *\\n *$/.test(raw)) {\n                        endsWithBlankLine = true;\n                    }\n                }\n                let istask = null;\n                let ischecked;\n                // Check for task list items\n                if (this.options.gfm) {\n                    istask = /^\\[[ xX]\\] /.exec(itemContents);\n                    if (istask) {\n                        ischecked = istask[0] !== '[ ] ';\n                        itemContents = itemContents.replace(/^\\[[ xX]\\] +/, '');\n                    }\n                }\n                list.items.push({\n                    type: 'list_item',\n                    raw,\n                    task: !!istask,\n                    checked: ischecked,\n                    loose: false,\n                    text: itemContents,\n                    tokens: []\n                });\n                list.raw += raw;\n            }\n            // Do not consume newlines at end of final item. Alternatively, make itemRegex *start* with any newlines to simplify/speed up endsWithBlankLine logic\n            list.items[list.items.length - 1].raw = raw.trimEnd();\n            (list.items[list.items.length - 1]).text = itemContents.trimEnd();\n            list.raw = list.raw.trimEnd();\n            // Item child tokens handled here at end because we needed to have the final item to trim it first\n            for (let i = 0; i < list.items.length; i++) {\n                this.lexer.state.top = false;\n                list.items[i].tokens = this.lexer.blockTokens(list.items[i].text, []);\n                if (!list.loose) {\n                    // Check if list should be loose\n                    const spacers = list.items[i].tokens.filter(t => t.type === 'space');\n                    const hasMultipleLineBreaks = spacers.length > 0 && spacers.some(t => /\\n.*\\n/.test(t.raw));\n                    list.loose = hasMultipleLineBreaks;\n                }\n            }\n            // Set all items to loose if list is loose\n            if (list.loose) {\n                for (let i = 0; i < list.items.length; i++) {\n                    list.items[i].loose = true;\n                }\n            }\n            return list;\n        }\n    }\n    html(src) {\n        const cap = this.rules.block.html.exec(src);\n        if (cap) {\n            const token = {\n                type: 'html',\n                block: true,\n                raw: cap[0],\n                pre: cap[1] === 'pre' || cap[1] === 'script' || cap[1] === 'style',\n                text: cap[0]\n            };\n            return token;\n        }\n    }\n    def(src) {\n        const cap = this.rules.block.def.exec(src);\n        if (cap) {\n            const tag = cap[1].toLowerCase().replace(/\\s+/g, ' ');\n            const href = cap[2] ? cap[2].replace(/^<(.*)>$/, '$1').replace(this.rules.inline.anyPunctuation, '$1') : '';\n            const title = cap[3] ? cap[3].substring(1, cap[3].length - 1).replace(this.rules.inline.anyPunctuation, '$1') : cap[3];\n            return {\n                type: 'def',\n                tag,\n                raw: cap[0],\n                href,\n                title\n            };\n        }\n    }\n    table(src) {\n        const cap = this.rules.block.table.exec(src);\n        if (!cap) {\n            return;\n        }\n        if (!/[:|]/.test(cap[2])) {\n            // delimiter row must have a pipe (|) or colon (:) otherwise it is a setext heading\n            return;\n        }\n        const headers = splitCells(cap[1]);\n        const aligns = cap[2].replace(/^\\||\\| *$/g, '').split('|');\n        const rows = cap[3] && cap[3].trim() ? cap[3].replace(/\\n[ \\t]*$/, '').split('\\n') : [];\n        const item = {\n            type: 'table',\n            raw: cap[0],\n            header: [],\n            align: [],\n            rows: []\n        };\n        if (headers.length !== aligns.length) {\n            // header and align columns must be equal, rows can be different.\n            return;\n        }\n        for (const align of aligns) {\n            if (/^ *-+: *$/.test(align)) {\n                item.align.push('right');\n            }\n            else if (/^ *:-+: *$/.test(align)) {\n                item.align.push('center');\n            }\n            else if (/^ *:-+ *$/.test(align)) {\n                item.align.push('left');\n            }\n            else {\n                item.align.push(null);\n            }\n        }\n        for (const header of headers) {\n            item.header.push({\n                text: header,\n                tokens: this.lexer.inline(header)\n            });\n        }\n        for (const row of rows) {\n            item.rows.push(splitCells(row, item.header.length).map(cell => {\n                return {\n                    text: cell,\n                    tokens: this.lexer.inline(cell)\n                };\n            }));\n        }\n        return item;\n    }\n    lheading(src) {\n        const cap = this.rules.block.lheading.exec(src);\n        if (cap) {\n            return {\n                type: 'heading',\n                raw: cap[0],\n                depth: cap[2].charAt(0) === '=' ? 1 : 2,\n                text: cap[1],\n                tokens: this.lexer.inline(cap[1])\n            };\n        }\n    }\n    paragraph(src) {\n        const cap = this.rules.block.paragraph.exec(src);\n        if (cap) {\n            const text = cap[1].charAt(cap[1].length - 1) === '\\n'\n                ? cap[1].slice(0, -1)\n                : cap[1];\n            return {\n                type: 'paragraph',\n                raw: cap[0],\n                text,\n                tokens: this.lexer.inline(text)\n            };\n        }\n    }\n    text(src) {\n        const cap = this.rules.block.text.exec(src);\n        if (cap) {\n            return {\n                type: 'text',\n                raw: cap[0],\n                text: cap[0],\n                tokens: this.lexer.inline(cap[0])\n            };\n        }\n    }\n    escape(src) {\n        const cap = this.rules.inline.escape.exec(src);\n        if (cap) {\n            return {\n                type: 'escape',\n                raw: cap[0],\n                text: escape(cap[1])\n            };\n        }\n    }\n    tag(src) {\n        const cap = this.rules.inline.tag.exec(src);\n        if (cap) {\n            if (!this.lexer.state.inLink && /^<a /i.test(cap[0])) {\n                this.lexer.state.inLink = true;\n            }\n            else if (this.lexer.state.inLink && /^<\\/a>/i.test(cap[0])) {\n                this.lexer.state.inLink = false;\n            }\n            if (!this.lexer.state.inRawBlock && /^<(pre|code|kbd|script)(\\s|>)/i.test(cap[0])) {\n                this.lexer.state.inRawBlock = true;\n            }\n            else if (this.lexer.state.inRawBlock && /^<\\/(pre|code|kbd|script)(\\s|>)/i.test(cap[0])) {\n                this.lexer.state.inRawBlock = false;\n            }\n            return {\n                type: 'html',\n                raw: cap[0],\n                inLink: this.lexer.state.inLink,\n                inRawBlock: this.lexer.state.inRawBlock,\n                block: false,\n                text: cap[0]\n            };\n        }\n    }\n    link(src) {\n        const cap = this.rules.inline.link.exec(src);\n        if (cap) {\n            const trimmedUrl = cap[2].trim();\n            if (!this.options.pedantic && /^</.test(trimmedUrl)) {\n                // commonmark requires matching angle brackets\n                if (!(/>$/.test(trimmedUrl))) {\n                    return;\n                }\n                // ending angle bracket cannot be escaped\n                const rtrimSlash = rtrim(trimmedUrl.slice(0, -1), '\\\\');\n                if ((trimmedUrl.length - rtrimSlash.length) % 2 === 0) {\n                    return;\n                }\n            }\n            else {\n                // find closing parenthesis\n                const lastParenIndex = findClosingBracket(cap[2], '()');\n                if (lastParenIndex > -1) {\n                    const start = cap[0].indexOf('!') === 0 ? 5 : 4;\n                    const linkLen = start + cap[1].length + lastParenIndex;\n                    cap[2] = cap[2].substring(0, lastParenIndex);\n                    cap[0] = cap[0].substring(0, linkLen).trim();\n                    cap[3] = '';\n                }\n            }\n            let href = cap[2];\n            let title = '';\n            if (this.options.pedantic) {\n                // split pedantic href and title\n                const link = /^([^'\"]*[^\\s])\\s+(['\"])(.*)\\2/.exec(href);\n                if (link) {\n                    href = link[1];\n                    title = link[3];\n                }\n            }\n            else {\n                title = cap[3] ? cap[3].slice(1, -1) : '';\n            }\n            href = href.trim();\n            if (/^</.test(href)) {\n                if (this.options.pedantic && !(/>$/.test(trimmedUrl))) {\n                    // pedantic allows starting angle bracket without ending angle bracket\n                    href = href.slice(1);\n                }\n                else {\n                    href = href.slice(1, -1);\n                }\n            }\n            return outputLink(cap, {\n                href: href ? href.replace(this.rules.inline.anyPunctuation, '$1') : href,\n                title: title ? title.replace(this.rules.inline.anyPunctuation, '$1') : title\n            }, cap[0], this.lexer);\n        }\n    }\n    reflink(src, links) {\n        let cap;\n        if ((cap = this.rules.inline.reflink.exec(src))\n            || (cap = this.rules.inline.nolink.exec(src))) {\n            const linkString = (cap[2] || cap[1]).replace(/\\s+/g, ' ');\n            const link = links[linkString.toLowerCase()];\n            if (!link) {\n                const text = cap[0].charAt(0);\n                return {\n                    type: 'text',\n                    raw: text,\n                    text\n                };\n            }\n            return outputLink(cap, link, cap[0], this.lexer);\n        }\n    }\n    emStrong(src, maskedSrc, prevChar = '') {\n        let match = this.rules.inline.emStrongLDelim.exec(src);\n        if (!match)\n            return;\n        // _ can't be between two alphanumerics. \\p{L}\\p{N} includes non-english alphabet/numbers as well\n        if (match[3] && prevChar.match(/[\\p{L}\\p{N}]/u))\n            return;\n        const nextChar = match[1] || match[2] || '';\n        if (!nextChar || !prevChar || this.rules.inline.punctuation.exec(prevChar)) {\n            // unicode Regex counts emoji as 1 char; spread into array for proper count (used multiple times below)\n            const lLength = [...match[0]].length - 1;\n            let rDelim, rLength, delimTotal = lLength, midDelimTotal = 0;\n            const endReg = match[0][0] === '*' ? this.rules.inline.emStrongRDelimAst : this.rules.inline.emStrongRDelimUnd;\n            endReg.lastIndex = 0;\n            // Clip maskedSrc to same section of string as src (move to lexer?)\n            maskedSrc = maskedSrc.slice(-1 * src.length + lLength);\n            while ((match = endReg.exec(maskedSrc)) != null) {\n                rDelim = match[1] || match[2] || match[3] || match[4] || match[5] || match[6];\n                if (!rDelim)\n                    continue; // skip single * in __abc*abc__\n                rLength = [...rDelim].length;\n                if (match[3] || match[4]) { // found another Left Delim\n                    delimTotal += rLength;\n                    continue;\n                }\n                else if (match[5] || match[6]) { // either Left or Right Delim\n                    if (lLength % 3 && !((lLength + rLength) % 3)) {\n                        midDelimTotal += rLength;\n                        continue; // CommonMark Emphasis Rules 9-10\n                    }\n                }\n                delimTotal -= rLength;\n                if (delimTotal > 0)\n                    continue; // Haven't found enough closing delimiters\n                // Remove extra characters. *a*** -> *a*\n                rLength = Math.min(rLength, rLength + delimTotal + midDelimTotal);\n                // char length can be >1 for unicode characters;\n                const lastCharLength = [...match[0]][0].length;\n                const raw = src.slice(0, lLength + match.index + lastCharLength + rLength);\n                // Create `em` if smallest delimiter has odd char count. *a***\n                if (Math.min(lLength, rLength) % 2) {\n                    const text = raw.slice(1, -1);\n                    return {\n                        type: 'em',\n                        raw,\n                        text,\n                        tokens: this.lexer.inlineTokens(text)\n                    };\n                }\n                // Create 'strong' if smallest delimiter has even char count. **a***\n                const text = raw.slice(2, -2);\n                return {\n                    type: 'strong',\n                    raw,\n                    text,\n                    tokens: this.lexer.inlineTokens(text)\n                };\n            }\n        }\n    }\n    codespan(src) {\n        const cap = this.rules.inline.code.exec(src);\n        if (cap) {\n            let text = cap[2].replace(/\\n/g, ' ');\n            const hasNonSpaceChars = /[^ ]/.test(text);\n            const hasSpaceCharsOnBothEnds = /^ /.test(text) && / $/.test(text);\n            if (hasNonSpaceChars && hasSpaceCharsOnBothEnds) {\n                text = text.substring(1, text.length - 1);\n            }\n            text = escape(text, true);\n            return {\n                type: 'codespan',\n                raw: cap[0],\n                text\n            };\n        }\n    }\n    br(src) {\n        const cap = this.rules.inline.br.exec(src);\n        if (cap) {\n            return {\n                type: 'br',\n                raw: cap[0]\n            };\n        }\n    }\n    del(src) {\n        const cap = this.rules.inline.del.exec(src);\n        if (cap) {\n            return {\n                type: 'del',\n                raw: cap[0],\n                text: cap[2],\n                tokens: this.lexer.inlineTokens(cap[2])\n            };\n        }\n    }\n    autolink(src) {\n        const cap = this.rules.inline.autolink.exec(src);\n        if (cap) {\n            let text, href;\n            if (cap[2] === '@') {\n                text = escape(cap[1]);\n                href = 'mailto:' + text;\n            }\n            else {\n                text = escape(cap[1]);\n                href = text;\n            }\n            return {\n                type: 'link',\n                raw: cap[0],\n                text,\n                href,\n                tokens: [\n                    {\n                        type: 'text',\n                        raw: text,\n                        text\n                    }\n                ]\n            };\n        }\n    }\n    url(src) {\n        let cap;\n        if (cap = this.rules.inline.url.exec(src)) {\n            let text, href;\n            if (cap[2] === '@') {\n                text = escape(cap[0]);\n                href = 'mailto:' + text;\n            }\n            else {\n                // do extended autolink path validation\n                let prevCapZero;\n                do {\n                    prevCapZero = cap[0];\n                    cap[0] = this.rules.inline._backpedal.exec(cap[0])?.[0] ?? '';\n                } while (prevCapZero !== cap[0]);\n                text = escape(cap[0]);\n                if (cap[1] === 'www.') {\n                    href = 'http://' + cap[0];\n                }\n                else {\n                    href = cap[0];\n                }\n            }\n            return {\n                type: 'link',\n                raw: cap[0],\n                text,\n                href,\n                tokens: [\n                    {\n                        type: 'text',\n                        raw: text,\n                        text\n                    }\n                ]\n            };\n        }\n    }\n    inlineText(src) {\n        const cap = this.rules.inline.text.exec(src);\n        if (cap) {\n            let text;\n            if (this.lexer.state.inRawBlock) {\n                text = cap[0];\n            }\n            else {\n                text = escape(cap[0]);\n            }\n            return {\n                type: 'text',\n                raw: cap[0],\n                text\n            };\n        }\n    }\n}\n", "import { edit, noopTest } from './helpers.ts';\n/**\n * Block-Level Grammar\n */\nconst newline = /^(?: *(?:\\n|$))+/;\nconst blockCode = /^( {4}[^\\n]+(?:\\n(?: *(?:\\n|$))*)?)+/;\nconst fences = /^ {0,3}(`{3,}(?=[^`\\n]*(?:\\n|$))|~{3,})([^\\n]*)(?:\\n|$)(?:|([\\s\\S]*?)(?:\\n|$))(?: {0,3}\\1[~`]* *(?=\\n|$)|$)/;\nconst hr = /^ {0,3}((?:-[\\t ]*){3,}|(?:_[ \\t]*){3,}|(?:\\*[ \\t]*){3,})(?:\\n+|$)/;\nconst heading = /^ {0,3}(#{1,6})(?=\\s|$)(.*)(?:\\n+|$)/;\nconst bullet = /(?:[*+-]|\\d{1,9}[.)])/;\nconst lheading = edit(/^(?!bull )((?:.|\\n(?!\\s*?\\n|bull ))+?)\\n {0,3}(=+|-+) *(?:\\n+|$)/)\n    .replace(/bull/g, bullet) // lists can interrupt\n    .getRegex();\nconst _paragraph = /^([^\\n]+(?:\\n(?!hr|heading|lheading|blockquote|fences|list|html|table| +\\n)[^\\n]+)*)/;\nconst blockText = /^[^\\n]+/;\nconst _blockLabel = /(?!\\s*\\])(?:\\\\.|[^\\[\\]\\\\])+/;\nconst def = edit(/^ {0,3}\\[(label)\\]: *(?:\\n *)?([^<\\s][^\\s]*|<.*?>)(?:(?: +(?:\\n *)?| *\\n *)(title))? *(?:\\n+|$)/)\n    .replace('label', _blockLabel)\n    .replace('title', /(?:\"(?:\\\\\"?|[^\"\\\\])*\"|'[^'\\n]*(?:\\n[^'\\n]+)*\\n?'|\\([^()]*\\))/)\n    .getRegex();\nconst list = edit(/^( {0,3}bull)([ \\t][^\\n]+?)?(?:\\n|$)/)\n    .replace(/bull/g, bullet)\n    .getRegex();\nconst _tag = 'address|article|aside|base|basefont|blockquote|body|caption'\n    + '|center|col|colgroup|dd|details|dialog|dir|div|dl|dt|fieldset|figcaption'\n    + '|figure|footer|form|frame|frameset|h[1-6]|head|header|hr|html|iframe'\n    + '|legend|li|link|main|menu|menuitem|meta|nav|noframes|ol|optgroup|option'\n    + '|p|param|section|source|summary|table|tbody|td|tfoot|th|thead|title|tr'\n    + '|track|ul';\nconst _comment = /<!--(?!-?>)[\\s\\S]*?(?:-->|$)/;\nconst html = edit('^ {0,3}(?:' // optional indentation\n    + '<(script|pre|style|textarea)[\\\\s>][\\\\s\\\\S]*?(?:</\\\\1>[^\\\\n]*\\\\n+|$)' // (1)\n    + '|comment[^\\\\n]*(\\\\n+|$)' // (2)\n    + '|<\\\\?[\\\\s\\\\S]*?(?:\\\\?>\\\\n*|$)' // (3)\n    + '|<![A-Z][\\\\s\\\\S]*?(?:>\\\\n*|$)' // (4)\n    + '|<!\\\\[CDATA\\\\[[\\\\s\\\\S]*?(?:\\\\]\\\\]>\\\\n*|$)' // (5)\n    + '|</?(tag)(?: +|\\\\n|/?>)[\\\\s\\\\S]*?(?:(?:\\\\n *)+\\\\n|$)' // (6)\n    + '|<(?!script|pre|style|textarea)([a-z][\\\\w-]*)(?:attribute)*? */?>(?=[ \\\\t]*(?:\\\\n|$))[\\\\s\\\\S]*?(?:(?:\\\\n *)+\\\\n|$)' // (7) open tag\n    + '|</(?!script|pre|style|textarea)[a-z][\\\\w-]*\\\\s*>(?=[ \\\\t]*(?:\\\\n|$))[\\\\s\\\\S]*?(?:(?:\\\\n *)+\\\\n|$)' // (7) closing tag\n    + ')', 'i')\n    .replace('comment', _comment)\n    .replace('tag', _tag)\n    .replace('attribute', / +[a-zA-Z:_][\\w.:-]*(?: *= *\"[^\"\\n]*\"| *= *'[^'\\n]*'| *= *[^\\s\"'=<>`]+)?/)\n    .getRegex();\nconst paragraph = edit(_paragraph)\n    .replace('hr', hr)\n    .replace('heading', ' {0,3}#{1,6}(?:\\\\s|$)')\n    .replace('|lheading', '') // setex headings don't interrupt commonmark paragraphs\n    .replace('|table', '')\n    .replace('blockquote', ' {0,3}>')\n    .replace('fences', ' {0,3}(?:`{3,}(?=[^`\\\\n]*\\\\n)|~{3,})[^\\\\n]*\\\\n')\n    .replace('list', ' {0,3}(?:[*+-]|1[.)]) ') // only lists starting from 1 can interrupt\n    .replace('html', '</?(?:tag)(?: +|\\\\n|/?>)|<(?:script|pre|style|textarea|!--)')\n    .replace('tag', _tag) // pars can be interrupted by type (6) html blocks\n    .getRegex();\nconst blockquote = edit(/^( {0,3}> ?(paragraph|[^\\n]*)(?:\\n|$))+/)\n    .replace('paragraph', paragraph)\n    .getRegex();\n/**\n * Normal Block Grammar\n */\nconst blockNormal = {\n    blockquote,\n    code: blockCode,\n    def,\n    fences,\n    heading,\n    hr,\n    html,\n    lheading,\n    list,\n    newline,\n    paragraph,\n    table: noopTest,\n    text: blockText\n};\n/**\n * GFM Block Grammar\n */\nconst gfmTable = edit('^ *([^\\\\n ].*)\\\\n' // Header\n    + ' {0,3}((?:\\\\| *)?:?-+:? *(?:\\\\| *:?-+:? *)*(?:\\\\| *)?)' // Align\n    + '(?:\\\\n((?:(?! *\\\\n|hr|heading|blockquote|code|fences|list|html).*(?:\\\\n|$))*)\\\\n*|$)') // Cells\n    .replace('hr', hr)\n    .replace('heading', ' {0,3}#{1,6}(?:\\\\s|$)')\n    .replace('blockquote', ' {0,3}>')\n    .replace('code', ' {4}[^\\\\n]')\n    .replace('fences', ' {0,3}(?:`{3,}(?=[^`\\\\n]*\\\\n)|~{3,})[^\\\\n]*\\\\n')\n    .replace('list', ' {0,3}(?:[*+-]|1[.)]) ') // only lists starting from 1 can interrupt\n    .replace('html', '</?(?:tag)(?: +|\\\\n|/?>)|<(?:script|pre|style|textarea|!--)')\n    .replace('tag', _tag) // tables can be interrupted by type (6) html blocks\n    .getRegex();\nconst blockGfm = {\n    ...blockNormal,\n    table: gfmTable,\n    paragraph: edit(_paragraph)\n        .replace('hr', hr)\n        .replace('heading', ' {0,3}#{1,6}(?:\\\\s|$)')\n        .replace('|lheading', '') // setex headings don't interrupt commonmark paragraphs\n        .replace('table', gfmTable) // interrupt paragraphs with table\n        .replace('blockquote', ' {0,3}>')\n        .replace('fences', ' {0,3}(?:`{3,}(?=[^`\\\\n]*\\\\n)|~{3,})[^\\\\n]*\\\\n')\n        .replace('list', ' {0,3}(?:[*+-]|1[.)]) ') // only lists starting from 1 can interrupt\n        .replace('html', '</?(?:tag)(?: +|\\\\n|/?>)|<(?:script|pre|style|textarea|!--)')\n        .replace('tag', _tag) // pars can be interrupted by type (6) html blocks\n        .getRegex()\n};\n/**\n * Pedantic grammar (original John Gruber's loose markdown specification)\n */\nconst blockPedantic = {\n    ...blockNormal,\n    html: edit('^ *(?:comment *(?:\\\\n|\\\\s*$)'\n        + '|<(tag)[\\\\s\\\\S]+?</\\\\1> *(?:\\\\n{2,}|\\\\s*$)' // closed tag\n        + '|<tag(?:\"[^\"]*\"|\\'[^\\']*\\'|\\\\s[^\\'\"/>\\\\s]*)*?/?> *(?:\\\\n{2,}|\\\\s*$))')\n        .replace('comment', _comment)\n        .replace(/tag/g, '(?!(?:'\n        + 'a|em|strong|small|s|cite|q|dfn|abbr|data|time|code|var|samp|kbd|sub'\n        + '|sup|i|b|u|mark|ruby|rt|rp|bdi|bdo|span|br|wbr|ins|del|img)'\n        + '\\\\b)\\\\w+(?!:|[^\\\\w\\\\s@]*@)\\\\b')\n        .getRegex(),\n    def: /^ *\\[([^\\]]+)\\]: *<?([^\\s>]+)>?(?: +([\"(][^\\n]+[\")]))? *(?:\\n+|$)/,\n    heading: /^(#{1,6})(.*)(?:\\n+|$)/,\n    fences: noopTest, // fences not supported\n    lheading: /^(.+?)\\n {0,3}(=+|-+) *(?:\\n+|$)/,\n    paragraph: edit(_paragraph)\n        .replace('hr', hr)\n        .replace('heading', ' *#{1,6} *[^\\n]')\n        .replace('lheading', lheading)\n        .replace('|table', '')\n        .replace('blockquote', ' {0,3}>')\n        .replace('|fences', '')\n        .replace('|list', '')\n        .replace('|html', '')\n        .replace('|tag', '')\n        .getRegex()\n};\n/**\n * Inline-Level Grammar\n */\nconst escape = /^\\\\([!\"#$%&'()*+,\\-./:;<=>?@\\[\\]\\\\^_`{|}~])/;\nconst inlineCode = /^(`+)([^`]|[^`][\\s\\S]*?[^`])\\1(?!`)/;\nconst br = /^( {2,}|\\\\)\\n(?!\\s*$)/;\nconst inlineText = /^(`+|[^`])(?:(?= {2,}\\n)|[\\s\\S]*?(?:(?=[\\\\<!\\[`*_]|\\b_|$)|[^ ](?= {2,}\\n)))/;\n// list of unicode punctuation marks, plus any missing characters from CommonMark spec\nconst _punctuation = '\\\\p{P}$+<=>`^|~';\nconst punctuation = edit(/^((?![*_])[\\spunctuation])/, 'u')\n    .replace(/punctuation/g, _punctuation).getRegex();\n// sequences em should skip over [title](link), `code`, <html>\nconst blockSkip = /\\[[^[\\]]*?\\]\\([^\\(\\)]*?\\)|`[^`]*?`|<[^<>]*?>/g;\nconst emStrongLDelim = edit(/^(?:\\*+(?:((?!\\*)[punct])|[^\\s*]))|^_+(?:((?!_)[punct])|([^\\s_]))/, 'u')\n    .replace(/punct/g, _punctuation)\n    .getRegex();\nconst emStrongRDelimAst = edit('^[^_*]*?__[^_*]*?\\\\*[^_*]*?(?=__)' // Skip orphan inside strong\n    + '|[^*]+(?=[^*])' // Consume to delim\n    + '|(?!\\\\*)[punct](\\\\*+)(?=[\\\\s]|$)' // (1) #*** can only be a Right Delimiter\n    + '|[^punct\\\\s](\\\\*+)(?!\\\\*)(?=[punct\\\\s]|$)' // (2) a***#, a*** can only be a Right Delimiter\n    + '|(?!\\\\*)[punct\\\\s](\\\\*+)(?=[^punct\\\\s])' // (3) #***a, ***a can only be Left Delimiter\n    + '|[\\\\s](\\\\*+)(?!\\\\*)(?=[punct])' // (4) ***# can only be Left Delimiter\n    + '|(?!\\\\*)[punct](\\\\*+)(?!\\\\*)(?=[punct])' // (5) #***# can be either Left or Right Delimiter\n    + '|[^punct\\\\s](\\\\*+)(?=[^punct\\\\s])', 'gu') // (6) a***a can be either Left or Right Delimiter\n    .replace(/punct/g, _punctuation)\n    .getRegex();\n// (6) Not allowed for _\nconst emStrongRDelimUnd = edit('^[^_*]*?\\\\*\\\\*[^_*]*?_[^_*]*?(?=\\\\*\\\\*)' // Skip orphan inside strong\n    + '|[^_]+(?=[^_])' // Consume to delim\n    + '|(?!_)[punct](_+)(?=[\\\\s]|$)' // (1) #___ can only be a Right Delimiter\n    + '|[^punct\\\\s](_+)(?!_)(?=[punct\\\\s]|$)' // (2) a___#, a___ can only be a Right Delimiter\n    + '|(?!_)[punct\\\\s](_+)(?=[^punct\\\\s])' // (3) #___a, ___a can only be Left Delimiter\n    + '|[\\\\s](_+)(?!_)(?=[punct])' // (4) ___# can only be Left Delimiter\n    + '|(?!_)[punct](_+)(?!_)(?=[punct])', 'gu') // (5) #___# can be either Left or Right Delimiter\n    .replace(/punct/g, _punctuation)\n    .getRegex();\nconst anyPunctuation = edit(/\\\\([punct])/, 'gu')\n    .replace(/punct/g, _punctuation)\n    .getRegex();\nconst autolink = edit(/^<(scheme:[^\\s\\x00-\\x1f<>]*|email)>/)\n    .replace('scheme', /[a-zA-Z][a-zA-Z0-9+.-]{1,31}/)\n    .replace('email', /[a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+(@)[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)+(?![-_])/)\n    .getRegex();\nconst _inlineComment = edit(_comment).replace('(?:-->|$)', '-->').getRegex();\nconst tag = edit('^comment'\n    + '|^</[a-zA-Z][\\\\w:-]*\\\\s*>' // self-closing tag\n    + '|^<[a-zA-Z][\\\\w-]*(?:attribute)*?\\\\s*/?>' // open tag\n    + '|^<\\\\?[\\\\s\\\\S]*?\\\\?>' // processing instruction, e.g. <?php ?>\n    + '|^<![a-zA-Z]+\\\\s[\\\\s\\\\S]*?>' // declaration, e.g. <!DOCTYPE html>\n    + '|^<!\\\\[CDATA\\\\[[\\\\s\\\\S]*?\\\\]\\\\]>') // CDATA section\n    .replace('comment', _inlineComment)\n    .replace('attribute', /\\s+[a-zA-Z:_][\\w.:-]*(?:\\s*=\\s*\"[^\"]*\"|\\s*=\\s*'[^']*'|\\s*=\\s*[^\\s\"'=<>`]+)?/)\n    .getRegex();\nconst _inlineLabel = /(?:\\[(?:\\\\.|[^\\[\\]\\\\])*\\]|\\\\.|`[^`]*`|[^\\[\\]\\\\`])*?/;\nconst link = edit(/^!?\\[(label)\\]\\(\\s*(href)(?:\\s+(title))?\\s*\\)/)\n    .replace('label', _inlineLabel)\n    .replace('href', /<(?:\\\\.|[^\\n<>\\\\])+>|[^\\s\\x00-\\x1f]*/)\n    .replace('title', /\"(?:\\\\\"?|[^\"\\\\])*\"|'(?:\\\\'?|[^'\\\\])*'|\\((?:\\\\\\)?|[^)\\\\])*\\)/)\n    .getRegex();\nconst reflink = edit(/^!?\\[(label)\\]\\[(ref)\\]/)\n    .replace('label', _inlineLabel)\n    .replace('ref', _blockLabel)\n    .getRegex();\nconst nolink = edit(/^!?\\[(ref)\\](?:\\[\\])?/)\n    .replace('ref', _blockLabel)\n    .getRegex();\nconst reflinkSearch = edit('reflink|nolink(?!\\\\()', 'g')\n    .replace('reflink', reflink)\n    .replace('nolink', nolink)\n    .getRegex();\n/**\n * Normal Inline Grammar\n */\nconst inlineNormal = {\n    _backpedal: noopTest, // only used for GFM url\n    anyPunctuation,\n    autolink,\n    blockSkip,\n    br,\n    code: inlineCode,\n    del: noopTest,\n    emStrongLDelim,\n    emStrongRDelimAst,\n    emStrongRDelimUnd,\n    escape,\n    link,\n    nolink,\n    punctuation,\n    reflink,\n    reflinkSearch,\n    tag,\n    text: inlineText,\n    url: noopTest\n};\n/**\n * Pedantic Inline Grammar\n */\nconst inlinePedantic = {\n    ...inlineNormal,\n    link: edit(/^!?\\[(label)\\]\\((.*?)\\)/)\n        .replace('label', _inlineLabel)\n        .getRegex(),\n    reflink: edit(/^!?\\[(label)\\]\\s*\\[([^\\]]*)\\]/)\n        .replace('label', _inlineLabel)\n        .getRegex()\n};\n/**\n * GFM Inline Grammar\n */\nconst inlineGfm = {\n    ...inlineNormal,\n    escape: edit(escape).replace('])', '~|])').getRegex(),\n    url: edit(/^((?:ftp|https?):\\/\\/|www\\.)(?:[a-zA-Z0-9\\-]+\\.?)+[^\\s<]*|^email/, 'i')\n        .replace('email', /[A-Za-z0-9._+-]+(@)[a-zA-Z0-9-_]+(?:\\.[a-zA-Z0-9-_]*[a-zA-Z0-9])+(?![-_])/)\n        .getRegex(),\n    _backpedal: /(?:[^?!.,:;*_'\"~()&]+|\\([^)]*\\)|&(?![a-zA-Z0-9]+;$)|[?!.,:;*_'\"~)]+(?!$))+/,\n    del: /^(~~?)(?=[^\\s~])([\\s\\S]*?[^\\s~])\\1(?=[^~]|$)/,\n    text: /^([`~]+|[^`~])(?:(?= {2,}\\n)|(?=[a-zA-Z0-9.!#$%&'*+\\/=?_`{\\|}~-]+@)|[\\s\\S]*?(?:(?=[\\\\<!\\[`*~_]|\\b_|https?:\\/\\/|ftp:\\/\\/|www\\.|$)|[^ ](?= {2,}\\n)|[^a-zA-Z0-9.!#$%&'*+\\/=?_`{\\|}~-](?=[a-zA-Z0-9.!#$%&'*+\\/=?_`{\\|}~-]+@)))/\n};\n/**\n * GFM + Line Breaks Inline Grammar\n */\nconst inlineBreaks = {\n    ...inlineGfm,\n    br: edit(br).replace('{2,}', '*').getRegex(),\n    text: edit(inlineGfm.text)\n        .replace('\\\\b_', '\\\\b_| {2,}\\\\n')\n        .replace(/\\{2,\\}/g, '*')\n        .getRegex()\n};\n/**\n * exports\n */\nexport const block = {\n    normal: blockNormal,\n    gfm: blockGfm,\n    pedantic: blockPedantic\n};\nexport const inline = {\n    normal: inlineNormal,\n    gfm: inlineGfm,\n    breaks: inlineBreaks,\n    pedantic: inlinePedantic\n};\n", "import { _Tokenizer } from './Tokenizer.ts';\nimport { _defaults } from './defaults.ts';\nimport { block, inline } from './rules.ts';\n/**\n * Block Lexer\n */\nexport class _Lexer {\n    tokens;\n    options;\n    state;\n    tokenizer;\n    inlineQueue;\n    constructor(options) {\n        // TokenList cannot be created in one go\n        this.tokens = [];\n        this.tokens.links = Object.create(null);\n        this.options = options || _defaults;\n        this.options.tokenizer = this.options.tokenizer || new _Tokenizer();\n        this.tokenizer = this.options.tokenizer;\n        this.tokenizer.options = this.options;\n        this.tokenizer.lexer = this;\n        this.inlineQueue = [];\n        this.state = {\n            inLink: false,\n            inRawBlock: false,\n            top: true\n        };\n        const rules = {\n            block: block.normal,\n            inline: inline.normal\n        };\n        if (this.options.pedantic) {\n            rules.block = block.pedantic;\n            rules.inline = inline.pedantic;\n        }\n        else if (this.options.gfm) {\n            rules.block = block.gfm;\n            if (this.options.breaks) {\n                rules.inline = inline.breaks;\n            }\n            else {\n                rules.inline = inline.gfm;\n            }\n        }\n        this.tokenizer.rules = rules;\n    }\n    /**\n     * Expose Rules\n     */\n    static get rules() {\n        return {\n            block,\n            inline\n        };\n    }\n    /**\n     * Static Lex Method\n     */\n    static lex(src, options) {\n        const lexer = new _Lexer(options);\n        return lexer.lex(src);\n    }\n    /**\n     * Static Lex Inline Method\n     */\n    static lexInline(src, options) {\n        const lexer = new _Lexer(options);\n        return lexer.inlineTokens(src);\n    }\n    /**\n     * Preprocessing\n     */\n    lex(src) {\n        src = src\n            .replace(/\\r\\n|\\r/g, '\\n');\n        this.blockTokens(src, this.tokens);\n        for (let i = 0; i < this.inlineQueue.length; i++) {\n            const next = this.inlineQueue[i];\n            this.inlineTokens(next.src, next.tokens);\n        }\n        this.inlineQueue = [];\n        return this.tokens;\n    }\n    blockTokens(src, tokens = []) {\n        if (this.options.pedantic) {\n            src = src.replace(/\\t/g, '    ').replace(/^ +$/gm, '');\n        }\n        else {\n            src = src.replace(/^( *)(\\t+)/gm, (_, leading, tabs) => {\n                return leading + '    '.repeat(tabs.length);\n            });\n        }\n        let token;\n        let lastToken;\n        let cutSrc;\n        let lastParagraphClipped;\n        while (src) {\n            if (this.options.extensions\n                && this.options.extensions.block\n                && this.options.extensions.block.some((extTokenizer) => {\n                    if (token = extTokenizer.call({ lexer: this }, src, tokens)) {\n                        src = src.substring(token.raw.length);\n                        tokens.push(token);\n                        return true;\n                    }\n                    return false;\n                })) {\n                continue;\n            }\n            // newline\n            if (token = this.tokenizer.space(src)) {\n                src = src.substring(token.raw.length);\n                if (token.raw.length === 1 && tokens.length > 0) {\n                    // if there's a single \\n as a spacer, it's terminating the last line,\n                    // so move it there so that we don't get unnecessary paragraph tags\n                    tokens[tokens.length - 1].raw += '\\n';\n                }\n                else {\n                    tokens.push(token);\n                }\n                continue;\n            }\n            // code\n            if (token = this.tokenizer.code(src)) {\n                src = src.substring(token.raw.length);\n                lastToken = tokens[tokens.length - 1];\n                // An indented code block cannot interrupt a paragraph.\n                if (lastToken && (lastToken.type === 'paragraph' || lastToken.type === 'text')) {\n                    lastToken.raw += '\\n' + token.raw;\n                    lastToken.text += '\\n' + token.text;\n                    this.inlineQueue[this.inlineQueue.length - 1].src = lastToken.text;\n                }\n                else {\n                    tokens.push(token);\n                }\n                continue;\n            }\n            // fences\n            if (token = this.tokenizer.fences(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // heading\n            if (token = this.tokenizer.heading(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // hr\n            if (token = this.tokenizer.hr(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // blockquote\n            if (token = this.tokenizer.blockquote(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // list\n            if (token = this.tokenizer.list(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // html\n            if (token = this.tokenizer.html(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // def\n            if (token = this.tokenizer.def(src)) {\n                src = src.substring(token.raw.length);\n                lastToken = tokens[tokens.length - 1];\n                if (lastToken && (lastToken.type === 'paragraph' || lastToken.type === 'text')) {\n                    lastToken.raw += '\\n' + token.raw;\n                    lastToken.text += '\\n' + token.raw;\n                    this.inlineQueue[this.inlineQueue.length - 1].src = lastToken.text;\n                }\n                else if (!this.tokens.links[token.tag]) {\n                    this.tokens.links[token.tag] = {\n                        href: token.href,\n                        title: token.title\n                    };\n                }\n                continue;\n            }\n            // table (gfm)\n            if (token = this.tokenizer.table(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // lheading\n            if (token = this.tokenizer.lheading(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // top-level paragraph\n            // prevent paragraph consuming extensions by clipping 'src' to extension start\n            cutSrc = src;\n            if (this.options.extensions && this.options.extensions.startBlock) {\n                let startIndex = Infinity;\n                const tempSrc = src.slice(1);\n                let tempStart;\n                this.options.extensions.startBlock.forEach((getStartIndex) => {\n                    tempStart = getStartIndex.call({ lexer: this }, tempSrc);\n                    if (typeof tempStart === 'number' && tempStart >= 0) {\n                        startIndex = Math.min(startIndex, tempStart);\n                    }\n                });\n                if (startIndex < Infinity && startIndex >= 0) {\n                    cutSrc = src.substring(0, startIndex + 1);\n                }\n            }\n            if (this.state.top && (token = this.tokenizer.paragraph(cutSrc))) {\n                lastToken = tokens[tokens.length - 1];\n                if (lastParagraphClipped && lastToken.type === 'paragraph') {\n                    lastToken.raw += '\\n' + token.raw;\n                    lastToken.text += '\\n' + token.text;\n                    this.inlineQueue.pop();\n                    this.inlineQueue[this.inlineQueue.length - 1].src = lastToken.text;\n                }\n                else {\n                    tokens.push(token);\n                }\n                lastParagraphClipped = (cutSrc.length !== src.length);\n                src = src.substring(token.raw.length);\n                continue;\n            }\n            // text\n            if (token = this.tokenizer.text(src)) {\n                src = src.substring(token.raw.length);\n                lastToken = tokens[tokens.length - 1];\n                if (lastToken && lastToken.type === 'text') {\n                    lastToken.raw += '\\n' + token.raw;\n                    lastToken.text += '\\n' + token.text;\n                    this.inlineQueue.pop();\n                    this.inlineQueue[this.inlineQueue.length - 1].src = lastToken.text;\n                }\n                else {\n                    tokens.push(token);\n                }\n                continue;\n            }\n            if (src) {\n                const errMsg = 'Infinite loop on byte: ' + src.charCodeAt(0);\n                if (this.options.silent) {\n                    console.error(errMsg);\n                    break;\n                }\n                else {\n                    throw new Error(errMsg);\n                }\n            }\n        }\n        this.state.top = true;\n        return tokens;\n    }\n    inline(src, tokens = []) {\n        this.inlineQueue.push({ src, tokens });\n        return tokens;\n    }\n    /**\n     * Lexing/Compiling\n     */\n    inlineTokens(src, tokens = []) {\n        let token, lastToken, cutSrc;\n        // String with links masked to avoid interference with em and strong\n        let maskedSrc = src;\n        let match;\n        let keepPrevChar, prevChar;\n        // Mask out reflinks\n        if (this.tokens.links) {\n            const links = Object.keys(this.tokens.links);\n            if (links.length > 0) {\n                while ((match = this.tokenizer.rules.inline.reflinkSearch.exec(maskedSrc)) != null) {\n                    if (links.includes(match[0].slice(match[0].lastIndexOf('[') + 1, -1))) {\n                        maskedSrc = maskedSrc.slice(0, match.index) + '[' + 'a'.repeat(match[0].length - 2) + ']' + maskedSrc.slice(this.tokenizer.rules.inline.reflinkSearch.lastIndex);\n                    }\n                }\n            }\n        }\n        // Mask out other blocks\n        while ((match = this.tokenizer.rules.inline.blockSkip.exec(maskedSrc)) != null) {\n            maskedSrc = maskedSrc.slice(0, match.index) + '[' + 'a'.repeat(match[0].length - 2) + ']' + maskedSrc.slice(this.tokenizer.rules.inline.blockSkip.lastIndex);\n        }\n        // Mask out escaped characters\n        while ((match = this.tokenizer.rules.inline.anyPunctuation.exec(maskedSrc)) != null) {\n            maskedSrc = maskedSrc.slice(0, match.index) + '++' + maskedSrc.slice(this.tokenizer.rules.inline.anyPunctuation.lastIndex);\n        }\n        while (src) {\n            if (!keepPrevChar) {\n                prevChar = '';\n            }\n            keepPrevChar = false;\n            // extensions\n            if (this.options.extensions\n                && this.options.extensions.inline\n                && this.options.extensions.inline.some((extTokenizer) => {\n                    if (token = extTokenizer.call({ lexer: this }, src, tokens)) {\n                        src = src.substring(token.raw.length);\n                        tokens.push(token);\n                        return true;\n                    }\n                    return false;\n                })) {\n                continue;\n            }\n            // escape\n            if (token = this.tokenizer.escape(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // tag\n            if (token = this.tokenizer.tag(src)) {\n                src = src.substring(token.raw.length);\n                lastToken = tokens[tokens.length - 1];\n                if (lastToken && token.type === 'text' && lastToken.type === 'text') {\n                    lastToken.raw += token.raw;\n                    lastToken.text += token.text;\n                }\n                else {\n                    tokens.push(token);\n                }\n                continue;\n            }\n            // link\n            if (token = this.tokenizer.link(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // reflink, nolink\n            if (token = this.tokenizer.reflink(src, this.tokens.links)) {\n                src = src.substring(token.raw.length);\n                lastToken = tokens[tokens.length - 1];\n                if (lastToken && token.type === 'text' && lastToken.type === 'text') {\n                    lastToken.raw += token.raw;\n                    lastToken.text += token.text;\n                }\n                else {\n                    tokens.push(token);\n                }\n                continue;\n            }\n            // em & strong\n            if (token = this.tokenizer.emStrong(src, maskedSrc, prevChar)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // code\n            if (token = this.tokenizer.codespan(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // br\n            if (token = this.tokenizer.br(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // del (gfm)\n            if (token = this.tokenizer.del(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // autolink\n            if (token = this.tokenizer.autolink(src)) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // url (gfm)\n            if (!this.state.inLink && (token = this.tokenizer.url(src))) {\n                src = src.substring(token.raw.length);\n                tokens.push(token);\n                continue;\n            }\n            // text\n            // prevent inlineText consuming extensions by clipping 'src' to extension start\n            cutSrc = src;\n            if (this.options.extensions && this.options.extensions.startInline) {\n                let startIndex = Infinity;\n                const tempSrc = src.slice(1);\n                let tempStart;\n                this.options.extensions.startInline.forEach((getStartIndex) => {\n                    tempStart = getStartIndex.call({ lexer: this }, tempSrc);\n                    if (typeof tempStart === 'number' && tempStart >= 0) {\n                        startIndex = Math.min(startIndex, tempStart);\n                    }\n                });\n                if (startIndex < Infinity && startIndex >= 0) {\n                    cutSrc = src.substring(0, startIndex + 1);\n                }\n            }\n            if (token = this.tokenizer.inlineText(cutSrc)) {\n                src = src.substring(token.raw.length);\n                if (token.raw.slice(-1) !== '_') { // Track prevChar before string of ____ started\n                    prevChar = token.raw.slice(-1);\n                }\n                keepPrevChar = true;\n                lastToken = tokens[tokens.length - 1];\n                if (lastToken && lastToken.type === 'text') {\n                    lastToken.raw += token.raw;\n                    lastToken.text += token.text;\n                }\n                else {\n                    tokens.push(token);\n                }\n                continue;\n            }\n            if (src) {\n                const errMsg = 'Infinite loop on byte: ' + src.charCodeAt(0);\n                if (this.options.silent) {\n                    console.error(errMsg);\n                    break;\n                }\n                else {\n                    throw new Error(errMsg);\n                }\n            }\n        }\n        return tokens;\n    }\n}\n", "import { _defaults } from './defaults.ts';\nimport { cleanUrl, escape } from './helpers.ts';\n/**\n * Renderer\n */\nexport class _Renderer {\n    options;\n    constructor(options) {\n        this.options = options || _defaults;\n    }\n    code(code, infostring, escaped) {\n        const lang = (infostring || '').match(/^\\S*/)?.[0];\n        code = code.replace(/\\n$/, '') + '\\n';\n        if (!lang) {\n            return '<pre><code>'\n                + (escaped ? code : escape(code, true))\n                + '</code></pre>\\n';\n        }\n        return '<pre><code class=\"language-'\n            + escape(lang)\n            + '\">'\n            + (escaped ? code : escape(code, true))\n            + '</code></pre>\\n';\n    }\n    blockquote(quote) {\n        return `<blockquote>\\n${quote}</blockquote>\\n`;\n    }\n    html(html, block) {\n        return html;\n    }\n    heading(text, level, raw) {\n        // ignore IDs\n        return `<h${level}>${text}</h${level}>\\n`;\n    }\n    hr() {\n        return '<hr>\\n';\n    }\n    list(body, ordered, start) {\n        const type = ordered ? 'ol' : 'ul';\n        const startatt = (ordered && start !== 1) ? (' start=\"' + start + '\"') : '';\n        return '<' + type + startatt + '>\\n' + body + '</' + type + '>\\n';\n    }\n    listitem(text, task, checked) {\n        return `<li>${text}</li>\\n`;\n    }\n    checkbox(checked) {\n        return '<input '\n            + (checked ? 'checked=\"\" ' : '')\n            + 'disabled=\"\" type=\"checkbox\">';\n    }\n    paragraph(text) {\n        return `<p>${text}</p>\\n`;\n    }\n    table(header, body) {\n        if (body)\n            body = `<tbody>${body}</tbody>`;\n        return '<table>\\n'\n            + '<thead>\\n'\n            + header\n            + '</thead>\\n'\n            + body\n            + '</table>\\n';\n    }\n    tablerow(content) {\n        return `<tr>\\n${content}</tr>\\n`;\n    }\n    tablecell(content, flags) {\n        const type = flags.header ? 'th' : 'td';\n        const tag = flags.align\n            ? `<${type} align=\"${flags.align}\">`\n            : `<${type}>`;\n        return tag + content + `</${type}>\\n`;\n    }\n    /**\n     * span level renderer\n     */\n    strong(text) {\n        return `<strong>${text}</strong>`;\n    }\n    em(text) {\n        return `<em>${text}</em>`;\n    }\n    codespan(text) {\n        return `<code>${text}</code>`;\n    }\n    br() {\n        return '<br>';\n    }\n    del(text) {\n        return `<del>${text}</del>`;\n    }\n    link(href, title, text) {\n        const cleanHref = cleanUrl(href);\n        if (cleanHref === null) {\n            return text;\n        }\n        href = cleanHref;\n        let out = '<a href=\"' + href + '\"';\n        if (title) {\n            out += ' title=\"' + title + '\"';\n        }\n        out += '>' + text + '</a>';\n        return out;\n    }\n    image(href, title, text) {\n        const cleanHref = cleanUrl(href);\n        if (cleanHref === null) {\n            return text;\n        }\n        href = cleanHref;\n        let out = `<img src=\"${href}\" alt=\"${text}\"`;\n        if (title) {\n            out += ` title=\"${title}\"`;\n        }\n        out += '>';\n        return out;\n    }\n    text(text) {\n        return text;\n    }\n}\n", "/**\n * TextRenderer\n * returns only the textual part of the token\n */\nexport class _TextRenderer {\n    // no need for block level renderers\n    strong(text) {\n        return text;\n    }\n    em(text) {\n        return text;\n    }\n    codespan(text) {\n        return text;\n    }\n    del(text) {\n        return text;\n    }\n    html(text) {\n        return text;\n    }\n    text(text) {\n        return text;\n    }\n    link(href, title, text) {\n        return '' + text;\n    }\n    image(href, title, text) {\n        return '' + text;\n    }\n    br() {\n        return '';\n    }\n}\n", "import { _Renderer } from './Renderer.ts';\nimport { _TextRenderer } from './TextRenderer.ts';\nimport { _defaults } from './defaults.ts';\nimport { unescape } from './helpers.ts';\n/**\n * Parsing & Compiling\n */\nexport class _Parser {\n    options;\n    renderer;\n    textRenderer;\n    constructor(options) {\n        this.options = options || _defaults;\n        this.options.renderer = this.options.renderer || new _Renderer();\n        this.renderer = this.options.renderer;\n        this.renderer.options = this.options;\n        this.textRenderer = new _TextRenderer();\n    }\n    /**\n     * Static Parse Method\n     */\n    static parse(tokens, options) {\n        const parser = new _Parser(options);\n        return parser.parse(tokens);\n    }\n    /**\n     * Static Parse Inline Method\n     */\n    static parseInline(tokens, options) {\n        const parser = new _Parser(options);\n        return parser.parseInline(tokens);\n    }\n    /**\n     * Parse Loop\n     */\n    parse(tokens, top = true) {\n        let out = '';\n        for (let i = 0; i < tokens.length; i++) {\n            const token = tokens[i];\n            // Run any renderer extensions\n            if (this.options.extensions && this.options.extensions.renderers && this.options.extensions.renderers[token.type]) {\n                const genericToken = token;\n                const ret = this.options.extensions.renderers[genericToken.type].call({ parser: this }, genericToken);\n                if (ret !== false || !['space', 'hr', 'heading', 'code', 'table', 'blockquote', 'list', 'html', 'paragraph', 'text'].includes(genericToken.type)) {\n                    out += ret || '';\n                    continue;\n                }\n            }\n            switch (token.type) {\n                case 'space': {\n                    continue;\n                }\n                case 'hr': {\n                    out += this.renderer.hr();\n                    continue;\n                }\n                case 'heading': {\n                    const headingToken = token;\n                    out += this.renderer.heading(this.parseInline(headingToken.tokens), headingToken.depth, unescape(this.parseInline(headingToken.tokens, this.textRenderer)));\n                    continue;\n                }\n                case 'code': {\n                    const codeToken = token;\n                    out += this.renderer.code(codeToken.text, codeToken.lang, !!codeToken.escaped);\n                    continue;\n                }\n                case 'table': {\n                    const tableToken = token;\n                    let header = '';\n                    // header\n                    let cell = '';\n                    for (let j = 0; j < tableToken.header.length; j++) {\n                        cell += this.renderer.tablecell(this.parseInline(tableToken.header[j].tokens), { header: true, align: tableToken.align[j] });\n                    }\n                    header += this.renderer.tablerow(cell);\n                    let body = '';\n                    for (let j = 0; j < tableToken.rows.length; j++) {\n                        const row = tableToken.rows[j];\n                        cell = '';\n                        for (let k = 0; k < row.length; k++) {\n                            cell += this.renderer.tablecell(this.parseInline(row[k].tokens), { header: false, align: tableToken.align[k] });\n                        }\n                        body += this.renderer.tablerow(cell);\n                    }\n                    out += this.renderer.table(header, body);\n                    continue;\n                }\n                case 'blockquote': {\n                    const blockquoteToken = token;\n                    const body = this.parse(blockquoteToken.tokens);\n                    out += this.renderer.blockquote(body);\n                    continue;\n                }\n                case 'list': {\n                    const listToken = token;\n                    const ordered = listToken.ordered;\n                    const start = listToken.start;\n                    const loose = listToken.loose;\n                    let body = '';\n                    for (let j = 0; j < listToken.items.length; j++) {\n                        const item = listToken.items[j];\n                        const checked = item.checked;\n                        const task = item.task;\n                        let itemBody = '';\n                        if (item.task) {\n                            const checkbox = this.renderer.checkbox(!!checked);\n                            if (loose) {\n                                if (item.tokens.length > 0 && item.tokens[0].type === 'paragraph') {\n                                    item.tokens[0].text = checkbox + ' ' + item.tokens[0].text;\n                                    if (item.tokens[0].tokens && item.tokens[0].tokens.length > 0 && item.tokens[0].tokens[0].type === 'text') {\n                                        item.tokens[0].tokens[0].text = checkbox + ' ' + item.tokens[0].tokens[0].text;\n                                    }\n                                }\n                                else {\n                                    item.tokens.unshift({\n                                        type: 'text',\n                                        text: checkbox + ' '\n                                    });\n                                }\n                            }\n                            else {\n                                itemBody += checkbox + ' ';\n                            }\n                        }\n                        itemBody += this.parse(item.tokens, loose);\n                        body += this.renderer.listitem(itemBody, task, !!checked);\n                    }\n                    out += this.renderer.list(body, ordered, start);\n                    continue;\n                }\n                case 'html': {\n                    const htmlToken = token;\n                    out += this.renderer.html(htmlToken.text, htmlToken.block);\n                    continue;\n                }\n                case 'paragraph': {\n                    const paragraphToken = token;\n                    out += this.renderer.paragraph(this.parseInline(paragraphToken.tokens));\n                    continue;\n                }\n                case 'text': {\n                    let textToken = token;\n                    let body = textToken.tokens ? this.parseInline(textToken.tokens) : textToken.text;\n                    while (i + 1 < tokens.length && tokens[i + 1].type === 'text') {\n                        textToken = tokens[++i];\n                        body += '\\n' + (textToken.tokens ? this.parseInline(textToken.tokens) : textToken.text);\n                    }\n                    out += top ? this.renderer.paragraph(body) : body;\n                    continue;\n                }\n                default: {\n                    const errMsg = 'Token with \"' + token.type + '\" type was not found.';\n                    if (this.options.silent) {\n                        console.error(errMsg);\n                        return '';\n                    }\n                    else {\n                        throw new Error(errMsg);\n                    }\n                }\n            }\n        }\n        return out;\n    }\n    /**\n     * Parse Inline Tokens\n     */\n    parseInline(tokens, renderer) {\n        renderer = renderer || this.renderer;\n        let out = '';\n        for (let i = 0; i < tokens.length; i++) {\n            const token = tokens[i];\n            // Run any renderer extensions\n            if (this.options.extensions && this.options.extensions.renderers && this.options.extensions.renderers[token.type]) {\n                const ret = this.options.extensions.renderers[token.type].call({ parser: this }, token);\n                if (ret !== false || !['escape', 'html', 'link', 'image', 'strong', 'em', 'codespan', 'br', 'del', 'text'].includes(token.type)) {\n                    out += ret || '';\n                    continue;\n                }\n            }\n            switch (token.type) {\n                case 'escape': {\n                    const escapeToken = token;\n                    out += renderer.text(escapeToken.text);\n                    break;\n                }\n                case 'html': {\n                    const tagToken = token;\n                    out += renderer.html(tagToken.text);\n                    break;\n                }\n                case 'link': {\n                    const linkToken = token;\n                    out += renderer.link(linkToken.href, linkToken.title, this.parseInline(linkToken.tokens, renderer));\n                    break;\n                }\n                case 'image': {\n                    const imageToken = token;\n                    out += renderer.image(imageToken.href, imageToken.title, imageToken.text);\n                    break;\n                }\n                case 'strong': {\n                    const strongToken = token;\n                    out += renderer.strong(this.parseInline(strongToken.tokens, renderer));\n                    break;\n                }\n                case 'em': {\n                    const emToken = token;\n                    out += renderer.em(this.parseInline(emToken.tokens, renderer));\n                    break;\n                }\n                case 'codespan': {\n                    const codespanToken = token;\n                    out += renderer.codespan(codespanToken.text);\n                    break;\n                }\n                case 'br': {\n                    out += renderer.br();\n                    break;\n                }\n                case 'del': {\n                    const delToken = token;\n                    out += renderer.del(this.parseInline(delToken.tokens, renderer));\n                    break;\n                }\n                case 'text': {\n                    const textToken = token;\n                    out += renderer.text(textToken.text);\n                    break;\n                }\n                default: {\n                    const errMsg = 'Token with \"' + token.type + '\" type was not found.';\n                    if (this.options.silent) {\n                        console.error(errMsg);\n                        return '';\n                    }\n                    else {\n                        throw new Error(errMsg);\n                    }\n                }\n            }\n        }\n        return out;\n    }\n}\n", "import { _defaults } from './defaults.ts';\nexport class _Hooks {\n    options;\n    constructor(options) {\n        this.options = options || _defaults;\n    }\n    static passThroughHooks = new Set([\n        'preprocess',\n        'postprocess',\n        'processAllTokens'\n    ]);\n    /**\n     * Process markdown before marked\n     */\n    preprocess(markdown) {\n        return markdown;\n    }\n    /**\n     * Process HTML after marked is finished\n     */\n    postprocess(html) {\n        return html;\n    }\n    /**\n     * Process all tokens before walk tokens\n     */\n    processAllTokens(tokens) {\n        return tokens;\n    }\n}\n", "import { _getDefaults } from './defaults.ts';\nimport { _Lexer } from './Lexer.ts';\nimport { _Parser } from './Parser.ts';\nimport { _Hooks } from './Hooks.ts';\nimport { _Renderer } from './Renderer.ts';\nimport { _Tokenizer } from './Tokenizer.ts';\nimport { _TextRenderer } from './TextRenderer.ts';\nimport { escape } from './helpers.ts';\nexport class Marked {\n    defaults = _getDefaults();\n    options = this.setOptions;\n    parse = this.#parseMarkdown(_Lexer.lex, _Parser.parse);\n    parseInline = this.#parseMarkdown(_Lexer.lexInline, _Parser.parseInline);\n    Parser = _Parser;\n    Renderer = _Renderer;\n    TextRenderer = _TextRenderer;\n    Lexer = _Lexer;\n    Tokenizer = _Tokenizer;\n    Hooks = _Hooks;\n    constructor(...args) {\n        this.use(...args);\n    }\n    /**\n     * Run callback for every token\n     */\n    walkTokens(tokens, callback) {\n        let values = [];\n        for (const token of tokens) {\n            values = values.concat(callback.call(this, token));\n            switch (token.type) {\n                case 'table': {\n                    const tableToken = token;\n                    for (const cell of tableToken.header) {\n                        values = values.concat(this.walkTokens(cell.tokens, callback));\n                    }\n                    for (const row of tableToken.rows) {\n                        for (const cell of row) {\n                            values = values.concat(this.walkTokens(cell.tokens, callback));\n                        }\n                    }\n                    break;\n                }\n                case 'list': {\n                    const listToken = token;\n                    values = values.concat(this.walkTokens(listToken.items, callback));\n                    break;\n                }\n                default: {\n                    const genericToken = token;\n                    if (this.defaults.extensions?.childTokens?.[genericToken.type]) {\n                        this.defaults.extensions.childTokens[genericToken.type].forEach((childTokens) => {\n                            values = values.concat(this.walkTokens(genericToken[childTokens], callback));\n                        });\n                    }\n                    else if (genericToken.tokens) {\n                        values = values.concat(this.walkTokens(genericToken.tokens, callback));\n                    }\n                }\n            }\n        }\n        return values;\n    }\n    use(...args) {\n        const extensions = this.defaults.extensions || { renderers: {}, childTokens: {} };\n        args.forEach((pack) => {\n            // copy options to new object\n            const opts = { ...pack };\n            // set async to true if it was set to true before\n            opts.async = this.defaults.async || opts.async || false;\n            // ==-- Parse \"addon\" extensions --== //\n            if (pack.extensions) {\n                pack.extensions.forEach((ext) => {\n                    if (!ext.name) {\n                        throw new Error('extension name required');\n                    }\n                    if ('renderer' in ext) { // Renderer extensions\n                        const prevRenderer = extensions.renderers[ext.name];\n                        if (prevRenderer) {\n                            // Replace extension with func to run new extension but fall back if false\n                            extensions.renderers[ext.name] = function (...args) {\n                                let ret = ext.renderer.apply(this, args);\n                                if (ret === false) {\n                                    ret = prevRenderer.apply(this, args);\n                                }\n                                return ret;\n                            };\n                        }\n                        else {\n                            extensions.renderers[ext.name] = ext.renderer;\n                        }\n                    }\n                    if ('tokenizer' in ext) { // Tokenizer Extensions\n                        if (!ext.level || (ext.level !== 'block' && ext.level !== 'inline')) {\n                            throw new Error(\"extension level must be 'block' or 'inline'\");\n                        }\n                        const extLevel = extensions[ext.level];\n                        if (extLevel) {\n                            extLevel.unshift(ext.tokenizer);\n                        }\n                        else {\n                            extensions[ext.level] = [ext.tokenizer];\n                        }\n                        if (ext.start) { // Function to check for start of token\n                            if (ext.level === 'block') {\n                                if (extensions.startBlock) {\n                                    extensions.startBlock.push(ext.start);\n                                }\n                                else {\n                                    extensions.startBlock = [ext.start];\n                                }\n                            }\n                            else if (ext.level === 'inline') {\n                                if (extensions.startInline) {\n                                    extensions.startInline.push(ext.start);\n                                }\n                                else {\n                                    extensions.startInline = [ext.start];\n                                }\n                            }\n                        }\n                    }\n                    if ('childTokens' in ext && ext.childTokens) { // Child tokens to be visited by walkTokens\n                        extensions.childTokens[ext.name] = ext.childTokens;\n                    }\n                });\n                opts.extensions = extensions;\n            }\n            // ==-- Parse \"overwrite\" extensions --== //\n            if (pack.renderer) {\n                const renderer = this.defaults.renderer || new _Renderer(this.defaults);\n                for (const prop in pack.renderer) {\n                    if (!(prop in renderer)) {\n                        throw new Error(`renderer '${prop}' does not exist`);\n                    }\n                    if (prop === 'options') {\n                        // ignore options property\n                        continue;\n                    }\n                    const rendererProp = prop;\n                    const rendererFunc = pack.renderer[rendererProp];\n                    const prevRenderer = renderer[rendererProp];\n                    // Replace renderer with func to run extension, but fall back if false\n                    renderer[rendererProp] = (...args) => {\n                        let ret = rendererFunc.apply(renderer, args);\n                        if (ret === false) {\n                            ret = prevRenderer.apply(renderer, args);\n                        }\n                        return ret || '';\n                    };\n                }\n                opts.renderer = renderer;\n            }\n            if (pack.tokenizer) {\n                const tokenizer = this.defaults.tokenizer || new _Tokenizer(this.defaults);\n                for (const prop in pack.tokenizer) {\n                    if (!(prop in tokenizer)) {\n                        throw new Error(`tokenizer '${prop}' does not exist`);\n                    }\n                    if (['options', 'rules', 'lexer'].includes(prop)) {\n                        // ignore options, rules, and lexer properties\n                        continue;\n                    }\n                    const tokenizerProp = prop;\n                    const tokenizerFunc = pack.tokenizer[tokenizerProp];\n                    const prevTokenizer = tokenizer[tokenizerProp];\n                    // Replace tokenizer with func to run extension, but fall back if false\n                    // @ts-expect-error cannot type tokenizer function dynamically\n                    tokenizer[tokenizerProp] = (...args) => {\n                        let ret = tokenizerFunc.apply(tokenizer, args);\n                        if (ret === false) {\n                            ret = prevTokenizer.apply(tokenizer, args);\n                        }\n                        return ret;\n                    };\n                }\n                opts.tokenizer = tokenizer;\n            }\n            // ==-- Parse Hooks extensions --== //\n            if (pack.hooks) {\n                const hooks = this.defaults.hooks || new _Hooks();\n                for (const prop in pack.hooks) {\n                    if (!(prop in hooks)) {\n                        throw new Error(`hook '${prop}' does not exist`);\n                    }\n                    if (prop === 'options') {\n                        // ignore options property\n                        continue;\n                    }\n                    const hooksProp = prop;\n                    const hooksFunc = pack.hooks[hooksProp];\n                    const prevHook = hooks[hooksProp];\n                    if (_Hooks.passThroughHooks.has(prop)) {\n                        // @ts-expect-error cannot type hook function dynamically\n                        hooks[hooksProp] = (arg) => {\n                            if (this.defaults.async) {\n                                return Promise.resolve(hooksFunc.call(hooks, arg)).then(ret => {\n                                    return prevHook.call(hooks, ret);\n                                });\n                            }\n                            const ret = hooksFunc.call(hooks, arg);\n                            return prevHook.call(hooks, ret);\n                        };\n                    }\n                    else {\n                        // @ts-expect-error cannot type hook function dynamically\n                        hooks[hooksProp] = (...args) => {\n                            let ret = hooksFunc.apply(hooks, args);\n                            if (ret === false) {\n                                ret = prevHook.apply(hooks, args);\n                            }\n                            return ret;\n                        };\n                    }\n                }\n                opts.hooks = hooks;\n            }\n            // ==-- Parse WalkTokens extensions --== //\n            if (pack.walkTokens) {\n                const walkTokens = this.defaults.walkTokens;\n                const packWalktokens = pack.walkTokens;\n                opts.walkTokens = function (token) {\n                    let values = [];\n                    values.push(packWalktokens.call(this, token));\n                    if (walkTokens) {\n                        values = values.concat(walkTokens.call(this, token));\n                    }\n                    return values;\n                };\n            }\n            this.defaults = { ...this.defaults, ...opts };\n        });\n        return this;\n    }\n    setOptions(opt) {\n        this.defaults = { ...this.defaults, ...opt };\n        return this;\n    }\n    lexer(src, options) {\n        return _Lexer.lex(src, options ?? this.defaults);\n    }\n    parser(tokens, options) {\n        return _Parser.parse(tokens, options ?? this.defaults);\n    }\n    #parseMarkdown(lexer, parser) {\n        return (src, options) => {\n            const origOpt = { ...options };\n            const opt = { ...this.defaults, ...origOpt };\n            // Show warning if an extension set async to true but the parse was called with async: false\n            if (this.defaults.async === true && origOpt.async === false) {\n                if (!opt.silent) {\n                    console.warn('marked(): The async option was set to true by an extension. The async: false option sent to parse will be ignored.');\n                }\n                opt.async = true;\n            }\n            const throwError = this.#onError(!!opt.silent, !!opt.async);\n            // throw error in case of non string input\n            if (typeof src === 'undefined' || src === null) {\n                return throwError(new Error('marked(): input parameter is undefined or null'));\n            }\n            if (typeof src !== 'string') {\n                return throwError(new Error('marked(): input parameter is of type '\n                    + Object.prototype.toString.call(src) + ', string expected'));\n            }\n            if (opt.hooks) {\n                opt.hooks.options = opt;\n            }\n            if (opt.async) {\n                return Promise.resolve(opt.hooks ? opt.hooks.preprocess(src) : src)\n                    .then(src => lexer(src, opt))\n                    .then(tokens => opt.hooks ? opt.hooks.processAllTokens(tokens) : tokens)\n                    .then(tokens => opt.walkTokens ? Promise.all(this.walkTokens(tokens, opt.walkTokens)).then(() => tokens) : tokens)\n                    .then(tokens => parser(tokens, opt))\n                    .then(html => opt.hooks ? opt.hooks.postprocess(html) : html)\n                    .catch(throwError);\n            }\n            try {\n                if (opt.hooks) {\n                    src = opt.hooks.preprocess(src);\n                }\n                let tokens = lexer(src, opt);\n                if (opt.hooks) {\n                    tokens = opt.hooks.processAllTokens(tokens);\n                }\n                if (opt.walkTokens) {\n                    this.walkTokens(tokens, opt.walkTokens);\n                }\n                let html = parser(tokens, opt);\n                if (opt.hooks) {\n                    html = opt.hooks.postprocess(html);\n                }\n                return html;\n            }\n            catch (e) {\n                return throwError(e);\n            }\n        };\n    }\n    #onError(silent, async) {\n        return (e) => {\n            e.message += '\\nPlease report this to https://github.com/markedjs/marked.';\n            if (silent) {\n                const msg = '<p>An error occurred:</p><pre>'\n                    + escape(e.message + '', true)\n                    + '</pre>';\n                if (async) {\n                    return Promise.resolve(msg);\n                }\n                return msg;\n            }\n            if (async) {\n                return Promise.reject(e);\n            }\n            throw e;\n        };\n    }\n}\n", "import { _Lexer } from './Lexer.ts';\nimport { _Parser } from './Parser.ts';\nimport { _Tokenizer } from './Tokenizer.ts';\nimport { _Renderer } from './Renderer.ts';\nimport { _TextRenderer } from './TextRenderer.ts';\nimport { _Hooks } from './Hooks.ts';\nimport { Marked } from './Instance.ts';\nimport { _getDefaults, changeDefaults, _defaults } from './defaults.ts';\nconst markedInstance = new Marked();\nexport function marked(src, opt) {\n    return markedInstance.parse(src, opt);\n}\n/**\n * Sets the default options.\n *\n * @param options Hash of options\n */\nmarked.options =\n    marked.setOptions = function (options) {\n        markedInstance.setOptions(options);\n        marked.defaults = markedInstance.defaults;\n        changeDefaults(marked.defaults);\n        return marked;\n    };\n/**\n * Gets the original marked default options.\n */\nmarked.getDefaults = _getDefaults;\nmarked.defaults = _defaults;\n/**\n * Use Extension\n */\nmarked.use = function (...args) {\n    markedInstance.use(...args);\n    marked.defaults = markedInstance.defaults;\n    changeDefaults(marked.defaults);\n    return marked;\n};\n/**\n * Run callback for every token\n */\nmarked.walkTokens = function (tokens, callback) {\n    return markedInstance.walkTokens(tokens, callback);\n};\n/**\n * Compiles markdown to HTML without enclosing `p` tag.\n *\n * @param src String of markdown source to be compiled\n * @param options Hash of options\n * @return String of compiled HTML\n */\nmarked.parseInline = markedInstance.parseInline;\n/**\n * Expose\n */\nmarked.Parser = _Parser;\nmarked.parser = _Parser.parse;\nmarked.Renderer = _Renderer;\nmarked.TextRenderer = _TextRenderer;\nmarked.Lexer = _Lexer;\nmarked.lexer = _Lexer.lex;\nmarked.Tokenizer = _Tokenizer;\nmarked.Hooks = _Hooks;\nmarked.parse = marked;\nexport const options = marked.options;\nexport const setOptions = marked.setOptions;\nexport const use = marked.use;\nexport const walkTokens = marked.walkTokens;\nexport const parseInline = marked.parseInline;\nexport const parse = marked;\nexport const parser = _Parser.parse;\nexport const lexer = _Lexer.lex;\nexport { _defaults as defaults, _getDefaults as getDefaults } from './defaults.ts';\nexport { _Lexer as Lexer } from './Lexer.ts';\nexport { _Parser as Parser } from './Parser.ts';\nexport { _Tokenizer as Tokenizer } from './Tokenizer.ts';\nexport { _Renderer as Renderer } from './Renderer.ts';\nexport { _TextRenderer as TextRenderer } from './TextRenderer.ts';\nexport { _Hooks as Hooks } from './Hooks.ts';\nexport { Marked } from './Instance.ts';\n", "import { marked } from 'marked';\nimport DOMPurify from \"dompurify\"\n\nmarked.setOptions({\n  pedantic: false,\n  gfm: true\n});\n\nexport const markedImpl = function(str) {\n  if (!str) return \"\";\n  return DOMPurify.sanitize(marked.parse(str));\n};\n", "module Foreign.Marked where\n\nimport Prelude\nimport Globals (RawHTML(..))\n\nforeign import markedImpl :: String -> String\n\nmarked :: String -> RawHTML\nmarked = RawHTML <<< markedImpl\n", "module Component.Markdown (component, Slot) where\n\nimport Component.RawHtml as RH\nimport Data.Const (Const)\nimport Effect.Aff (Aff)\nimport Foreign.Marked (marked)\nimport Halogen as H\nimport Prelude (Void)\n\ntype Slot = H.Slot (Const Void) Void\n\ncomponent :: forall q o. H.Component q String o Aff\ncomponent = RH.mkComponent marked\n", "module Effect.Class.Console where\n\nimport Control.Bind (discard, bind, pure)\nimport Data.Function ((<<<))\nimport Data.Show (class Show)\nimport Data.Unit (Unit)\nimport Effect.Class (class MonadEffect, liftEffect)\nimport Effect.Console as EffConsole\n\nlog :: forall m. MonadEffect m => String -> m Unit\nlog = liftEffect <<< EffConsole.log\n\nlogShow :: forall m a. MonadEffect m => Show a => a -> m Unit\nlogShow = liftEffect <<< EffConsole.logShow\n\nwarn :: forall m. MonadEffect m => String -> m Unit\nwarn = liftEffect <<< EffConsole.warn\n\nwarnShow :: forall m a. MonadEffect m => Show a => a -> m Unit\nwarnShow = liftEffect <<< EffConsole.warnShow\n\nerror :: forall m. MonadEffect m => String -> m Unit\nerror = liftEffect <<< EffConsole.error\n\nerrorShow :: forall m a. MonadEffect m => Show a => a -> m Unit\nerrorShow = liftEffect <<< EffConsole.errorShow\n\ninfo :: forall m. MonadEffect m => String -> m Unit\ninfo = liftEffect <<< EffConsole.info\n\ninfoShow :: forall m a. MonadEffect m => Show a => a -> m Unit\ninfoShow = liftEffect <<< EffConsole.infoShow\n\ndebug :: forall m. MonadEffect m => String -> m Unit\ndebug = liftEffect <<< EffConsole.debug\n\ndebugShow :: forall m a. MonadEffect m => Show a => a -> m Unit\ndebugShow = liftEffect <<< EffConsole.debugShow\n\ntime :: forall m. MonadEffect m => String -> m Unit\ntime = liftEffect <<< EffConsole.time\n\ntimeLog :: forall m. MonadEffect m => String -> m Unit\ntimeLog = liftEffect <<< EffConsole.timeLog\n\ntimeEnd :: forall m. MonadEffect m => String -> m Unit\ntimeEnd = liftEffect <<< EffConsole.timeEnd\n\nclear :: forall m. MonadEffect m => m Unit\nclear = liftEffect EffConsole.clear\n\ngroup :: forall m. MonadEffect m => String -> m Unit\ngroup = liftEffect <<< EffConsole.group\n\ngroupCollapsed :: forall m. MonadEffect m => String -> m Unit\ngroupCollapsed = liftEffect <<< EffConsole.groupCollapsed\n\ngroupEnd :: forall m. MonadEffect m => m Unit\ngroupEnd = liftEffect EffConsole.groupEnd\n\ngrouped :: forall m a. MonadEffect m => String -> m a -> m a\ngrouped name inner = do\n  group name\n  result <- inner\n  groupEnd\n  pure result\n", "-- | This module re-exports the types for the `HTML` DSL, and values for all\n-- | supported HTML elements.\nmodule Halogen.HTML\n  ( ComponentHTML\n  , PlainHTML\n  , fromPlainHTML\n  , slot\n  , slot_\n  , memoized\n  , lazy\n  , lazy2\n  , lazy3\n  , module Halogen.HTML.Core\n  , module Halogen.HTML.Elements\n  , module Halogen.HTML.Properties\n  ) where\n\nimport Halogen.HTML.Elements\n\nimport Data.Function (const)\nimport Data.Function.Uncurried as Fn\nimport Data.Maybe (Maybe(..))\nimport Data.Symbol (class IsSymbol)\nimport Halogen.Component (Component, ComponentSlot(..), componentSlot)\nimport Halogen.Data.Slot (Slot)\nimport Halogen.HTML.Core (class IsProp, AttrName(..), ClassName(..), HTML(..), Namespace(..), PropName(..), ElemName(..), text, handler)\nimport Halogen.HTML.Core as Core\nimport Halogen.HTML.Properties (IProp, attr, attrNS, prop)\nimport Halogen.VDom.Thunk (thunk1, thunk2, thunk3, thunked)\nimport Prelude (class Ord, Void, (<<<), (<$>))\nimport Prim.Row as Row\nimport Type.Proxy (Proxy)\nimport Unsafe.Coerce (unsafeCoerce)\n\n-- | A convenience synonym for the output type of a `render` function for a\n-- | component that renders HTML.\n-- |\n-- | - `action` is the type of actions, events internal to the component that can\n-- |   be evaluated with the `handleAction` function\n-- | - `slots` is the set of child component types that can be used in the HTML\n-- | - `m` is the monad used by the child component during evaluation\ntype ComponentHTML action slots m = HTML (ComponentSlot slots m action) action\n\n-- | A type useful for a chunk of HTML with no slot-embedding or query-raising.\n-- |\n-- | Often a polymorphic usage of `HTML` is good enough for this, but sometimes\n-- | it's useful to have a type like this (and accompanying coercion) when doing\n-- | things like creating components that accept a chunk of HTML as part of\n-- | their configuration.\ntype PlainHTML = HTML Void Void\n\n-- | Relaxes the type of `PlainHTML` to make it compatible with all `HTML`.\nfromPlainHTML :: forall w i. PlainHTML -> HTML w i\nfromPlainHTML = unsafeCoerce -- \u2245 bimap absurd absurd\n\n-- | Defines a slot for a child component. Takes:\n-- | - the slot address label\n-- | - the slot address index\n-- | - the component for the slot\n-- | - the input value to pass to the component\n-- | - a function mapping outputs from the component to a query in the parent\nslot\n  :: forall query action input output slots m label slot _1\n   . Row.Cons label (Slot query output slot) _1 slots\n  => IsSymbol label\n  => Ord slot\n  => Proxy label\n  -> slot\n  -> Component query input output m\n  -> input\n  -> (output -> action)\n  -> ComponentHTML action slots m\nslot label p component input outputQuery =\n  Core.widget (ComponentSlot (componentSlot label p component input (Just <<< outputQuery)))\n\n-- | Defines a slot for a child component, ignoring its output.\n-- |\n-- | This variant may be used when the component produces output, but it is not\n-- | needed in the current context, or instead of passing `absurd` to `slot`\n-- | when the output type is `Void`.\n-- |\n-- | Takes:\n-- | - the slot address label\n-- | - the slot address index\n-- | - the component for the slot\n-- | - the input value to pass to the component\nslot_\n  :: forall query action input output slots m label slot _1\n   . Row.Cons label (Slot query output slot) _1 slots\n  => IsSymbol label\n  => Ord slot\n  => Proxy label\n  -> slot\n  -> Component query input output m\n  -> input\n  -> ComponentHTML action slots m\nslot_ label p component input =\n  Core.widget (ComponentSlot (componentSlot label p component input (const Nothing)))\n\n-- | Optimizes rendering of a subtree given an equality predicate. If an argument\n-- | is deemed equivalent to the previous value, rendering and diffing will be\n-- | skipped. You should not use this function fully saturated, but instead\n-- | partially apply it for use within a Component's scope. For example, to skip\n-- | rendering for equal states, just wrap your `render` function.\n-- |\n-- | ```purescript\n-- | myComponent = component\n-- |  { render: memoized eq render\n-- |  , ...\n-- |  }\n-- | ```\nmemoized\n  :: forall a action slots m\n   . (a -> a -> Boolean)\n  -> (a -> ComponentHTML action slots m)\n  -> a\n  -> ComponentHTML action slots m\nmemoized eqFn f =\n  -- Note: This implementation must not be eta-expanded, as it relies on\n  -- partial application to work.\n  Core.widget <<< ThunkSlot <$> thunked eqFn f\n\n-- | Skips rendering for referentially equal arguments. You should not use this\n-- | function fully saturated, but instead partially apply it for use within a\n-- | Component's scope.\nlazy\n  :: forall a action slots m\n   . (a -> ComponentHTML action slots m)\n  -> a\n  -> ComponentHTML action slots m\nlazy f a = Core.widget (ThunkSlot (Fn.runFn2 thunk1 f a))\n\n-- | Like `lazy`, but for a rendering function which takes 2 arguments.\nlazy2\n  :: forall a b action slots m\n   . (a -> b -> ComponentHTML action slots m)\n  -> a\n  -> b\n  -> ComponentHTML action slots m\nlazy2 f a b = Core.widget (ThunkSlot (Fn.runFn3 thunk2 f a b))\n\n-- | Like `lazy`, but for a rendering function which takes 3 arguments.\nlazy3\n  :: forall a b c action slots m\n   . (a -> b -> c -> ComponentHTML action slots m)\n  -> a\n  -> b\n  -> c\n  -> ComponentHTML action slots m\nlazy3 f a b c = Core.widget (ThunkSlot (Fn.runFn4 thunk3 f a b c))\n", "module Component.BMark where\n\nimport Prelude hiding (div)\n\nimport Affjax (printError)\nimport Affjax.StatusCode (StatusCode(..))\nimport App (StarAction(..), destroy, editBookmark, markRead, toggleStar, lookupTitle)\nimport Component.Markdown as Markdown\nimport Data.Const (Const)\nimport Data.Either (Either(..))\nimport Data.Lens (Lens', lens, use, (%=), (.=))\nimport Data.Maybe (Maybe(..), fromMaybe, isJust)\nimport Data.Monoid (guard)\nimport Data.Nullable (toMaybe)\nimport Data.String (null, split, take, replaceAll) as S\nimport Data.String.Pattern (Pattern(..), Replacement(..))\nimport Effect.Aff (Aff)\nimport Effect.Class (liftEffect)\nimport Effect.Class.Console (log)\nimport Globals (app', setFocus, toLocaleDateString)\nimport Halogen as H\nimport Halogen.HTML (a, br_, button, div, div_, form, input, label, span, text, textarea)\nimport Halogen.HTML as HH\nimport Halogen.HTML.Events (onSubmit, onValueChange, onChecked, onClick)\nimport Halogen.HTML.Properties (ButtonType(..), InputType(..), autocomplete, checked, disabled, for, href, id, name, required, rows, target, title, type_, value)\nimport Model (Bookmark)\nimport Type.Proxy (Proxy(..))\nimport Util (attr, class_, encodeTag, fromNullableStr, ifElseH, whenA, whenH)\nimport Web.Event.Event (Event, preventDefault)\nimport DOM.HTML.Indexed.AutocompleteType (AutocompleteType(..))\n\n-- | UI Events\ndata BAction\n  = BStar Boolean\n  | BDeleteAsk Boolean\n  | BLookupTitle\n  | BDestroy\n  | BEdit Boolean\n  | BEditField EditField\n  | BEditSubmit Event\n  | BMarkRead\n\n-- | FormField Edits\ndata EditField\n  = Eurl String\n  | Etitle String\n  | Edescription String\n  | Etags String\n  | Eprivate Boolean\n  | Etoread Boolean\n\n-- | Messages to parent\ndata BMessage\n  = BNotifyRemove\n\ntype BSlot = H.Slot (Const Void) BMessage\n\ntype BState =\n  { bm :: Bookmark\n  , edit_bm :: Bookmark\n  , deleteAsk:: Boolean\n  , edit :: Boolean\n  , loading :: Boolean\n  , apiError :: Maybe String\n  }\n\n_bm :: Lens' BState Bookmark\n_bm = lens _.bm (_ { bm = _ })\n\n_edit_bm :: Lens' BState Bookmark\n_edit_bm = lens _.edit_bm (_ { edit_bm = _ })\n\n_edit :: Lens' BState Boolean\n_edit = lens _.edit (_ { edit = _ })\n\n_apiError :: Lens' BState (Maybe String)\n_apiError = lens _.apiError (_ { apiError = _ })\n\n_markdown = Proxy :: Proxy \"markdown\"\n\ntype ChildSlots =\n  ( markdown :: Markdown.Slot Unit\n  )\n\nbmark :: forall q i. Bookmark -> H.Component q i BMessage Aff\nbmark b' =\n  H.mkComponent\n    { initialState: const (mkState b')\n    , render\n    , eval: H.mkEval $ H.defaultEval { handleAction = handleAction }\n    }\n  where\n  app = app' unit\n\n  mkState b =\n    { bm: b\n    , edit_bm: b\n    , deleteAsk: false\n    , edit: false\n    , loading: false\n    , apiError: Nothing\n    }\n\n  render :: BState -> H.ComponentHTML BAction ChildSlots Aff\n  render s@{ bm, edit_bm, apiError } =\n    div [ id (show bm.bid) , class_ (\"bookmark w-100 mw7 pa1 mb3\" <> guard bm.private \" private\")] $\n      [ whenH app.dat.isowner\n          star\n      , ifElseH s.edit\n          display_edit\n          display\n      ]\n\n    where\n\n     star _ =\n       div [ class_ (\"star fl pointer\" <> guard bm.selected \" selected\") ]\n       [ button [ class_ \"moon-gray\", onClick \\_ -> BStar (not bm.selected) ] [ text \"\u272D\" ] ]\n\n     display _ =\n        div [ class_ \"display\" ] $\n        [ a [ href bm.url, target \"_blank\", class_ (\"link f5 lh-title\" <> guard bm.toread \" unread\")]\n          [ text $ if S.null bm.title then \"[no title]\" else bm.title ]\n        , br_\n        , a [ href bm.url , class_ \"link f7 gray hover-blue\" ] [ text bm.url ]\n        , a [ href (fromMaybe (\"http://archive.is/\" <> bm.url) (toMaybe bm.archiveUrl))\n            , class_ (\"link f7 gray hover-blue ml2\" <> (guard (isJust (toMaybe bm.archiveUrl)) \" green\"))\n            , target \"_blank\", title \"archive link\"]\n            [ if isJust (toMaybe bm.archiveUrl) then text \"\u2611\" else text \"\u2610\" ]\n        , br_\n        , div [ class_ \"description mt1 mid-gray\" ] [ HH.slot _markdown unit Markdown.component bm.description absurd ]\n        , div [ class_ \"tags\" ] $\n              whenA (not (S.null bm.tags)) $ \\_ ->\n                map (\\tag -> a [ class_ (\"link tag mr1\" <> guard (S.take 1 tag == \".\") \" private\")\n                             , href (linkToFilterTag tag) ]\n                             [ text tag ])\n                (S.split (Pattern \" \") bm.tags)\n              \n        , a [ class_ \"link f7 dib gray w4\", href (linkToFilterSingle bm.slug), title shdatetime ]\n          [ text shdate ]\n\n        -- links\n        , whenH app.dat.isowner $ \\_ ->\n            div [ class_ \"edit_links di\" ]\n            [ button [ type_ ButtonButton, onClick \\_ -> BEdit true, class_ \"edit light-silver hover-blue\" ] [ text \"edit\u00A0\u00A0\" ]\n            , div [ class_ \"delete_link di\" ]\n              [ button [ type_ ButtonButton, onClick \\_ -> BDeleteAsk true, class_ (\"delete light-silver hover-blue\" <> guard s.deleteAsk \" dn\") ] [ text \"delete\" ]\n              , span ([ class_ (\"confirm red\" <> guard (not s.deleteAsk) \" dn\") ] )\n                [ button [ type_ ButtonButton, onClick \\_ -> BDeleteAsk false] [ text \"cancel\u00A0/\u00A0\" ]\n                , button [ type_ ButtonButton, onClick \\_ -> BDestroy, class_ \"red\" ] [ text \"destroy\" ]\n                ] \n              ]\n            ]\n        , whenH app.dat.isowner $ \\_ ->\n            div [ class_ \"read di\" ] $\n              guard bm.toread\n              [ text \"\u00A0\u00A0\"\n              , button [ onClick \\_ -> BMarkRead, class_ \"mark_read\" ] [ text \"mark as read\"]\n              ]\n        ]\n       \n\n     display_edit _ =\n       div [ class_ \"edit_bookmark_form pa2 pt0 bg-white\" ] $\n       [ whenH (isJust apiError)\n              (alert_notification (fromMaybe \"\" apiError))\n       , form [ onSubmit BEditSubmit ]\n         [ div_ [ text \"url\" ]\n         , input [ type_ InputUrl , class_ \"url w-100 mb2 pt1 edit_form_input\" , required true , name \"url\"\n                 , value (edit_bm.url) , onValueChange (editField Eurl) ]\n         , div_ [ text \"title\" ]\n         , div [class_ \"flex\"]\n               [input [ type_ InputText , class_ \"title w-100 mb2 pt1 edit_form_input\" , name \"title\"\n                      , value (edit_bm.title) , onValueChange (editField Etitle) ]\n               , button [ disabled s.loading, type_ ButtonButton, onClick \\_ -> BLookupTitle, class_ (\"ml1 pa1 mb2 dark-gray ba b--moon-gray bg-near-white pointer rdim f7 \" <> guard s.loading \"bg-light-silver\") ] [ text \"fetch\" ]\n               ]\n         , div_ [ text \"description\" ]\n         , textarea [ class_ \"description w-100 mb1 pt1 edit_form_input\" , name \"description\", rows 5\n                    , value (edit_bm.description) , onValueChange (editField Edescription) ]\n         , div [ id \"tags_input_box\"]\n           [ div_ [ text \"tags\" ]\n             , input [ id (tagid edit_bm), type_ InputText , class_ \"tags w-100 mb1 pt1 edit_form_input\" , name \"tags\"\n                     , autocomplete AutocompleteOff, attr \"autocapitalize\" \"off\"\n                     , value (edit_bm.tags) , onValueChange (editField Etags) ]\n           ]\n         , div [ class_ \"edit_form_checkboxes mv3\"]\n           [ input [ type_ InputCheckbox , class_ \"private pointer\" , id \"edit_private\", name \"private\"\n                   , checked (edit_bm.private) , onChecked (editField Eprivate) ]\n           , text \" \"\n           , label [ for \"edit_private\" , class_ \"mr2\" ] [ text \"private\" ]\n           , text \" \"\n           , input [ type_ InputCheckbox , class_ \"toread pointer\" , id \"edit_toread\", name \"toread\"\n                   , checked (edit_bm.toread) , onChecked (editField Etoread) ]\n           , text \" \"\n           , label [ for \"edit_toread\" ] [ text \"to-read\" ]\n           ]\n         , input [ type_ InputSubmit , class_ \"mr1 pv1 ph2 dark-gray ba b--moon-gray bg-near-white pointer rdim\" , value \"save\" ]\n         , text \" \"\n         , input [ type_ InputReset , class_ \"pv1 ph2 dark-gray ba b--moon-gray bg-near-white pointer rdim\" , value \"cancel\"\n                 , onClick \\_ -> BEdit false ]\n         ]\n       ]\n       \n     alert_notification alert_text _ = \n       div [ class_ \"alert alert-err\" ] [ text alert_text ]\n\n     editField :: forall a. (a -> EditField) -> a -> BAction\n     editField f = BEditField <<< f\n     linkToFilterSingle slug = fromNullableStr app.userR <> \"/b:\" <> slug\n     linkToFilterTag tag = fromNullableStr app.userR <> \"/t:\" <> encodeTag tag \n     shdate = toLocaleDateString bm.time \n     shdatetime = S.take 16 bm.time `append` \"Z\"\n\n  tagid bm = show bm.bid <> \"_tags\"\n\n  handleAction :: BAction -> H.HalogenM BState BAction ChildSlots BMessage Aff Unit\n\n  -- | Star\n  handleAction (BStar e) = do\n    bm <- use _bm\n    H.liftAff (toggleStar bm.bid (if e then Star else UnStar))\n    _bm %= _ { selected = e }\n    _edit_bm %= _ { selected = e }\n\n  -- | Delete\n  handleAction (BDeleteAsk e) = do\n    H.modify_ (_ { deleteAsk = e })\n\n  -- | Destroy\n  handleAction (BDestroy) = do\n    bm <- use _bm\n    void $ H.liftAff (destroy bm.bid)\n    H.raise BNotifyRemove\n\n  -- | Mark Read\n  handleAction (BMarkRead) = do\n    bm <- use _bm\n    void (H.liftAff (markRead bm.bid))\n    _bm %= _ { toread = false }\n\n  -- | Start/Stop Editing\n  handleAction (BEdit e) = do\n    bm <- use _bm\n    _edit_bm .= bm\n    _edit .= e\n    _apiError .= Nothing\n    H.liftEffect $\n      when e\n        (setFocus (tagid bm)) \n\n  -- | Update Form Field \n  handleAction (BEditField f) = do\n    _edit_bm %= case f of\n      Eurl e -> _ { url = e }\n      Etitle e -> _ { title = e }\n      Edescription e -> _ { description = e }\n      Etags e -> _ { tags = e }\n      Eprivate e -> _ { private = e }\n      Etoread e -> _ { toread = e }\n\n  -- | Lookup Title\n  handleAction BLookupTitle = do\n    H.modify_ (_ { loading = true })\n    edit_bm <- H.gets _.edit_bm\n    mtitle <- H.liftAff $ lookupTitle edit_bm\n    case mtitle of\n      Just title' -> _edit_bm %= (_ { title = title' })\n      Nothing -> pure $ unit\n    H.modify_ (_ { loading = false })\n\n  -- | Submit\n  handleAction (BEditSubmit e) = do\n    H.liftEffect (preventDefault e)\n    edit_bm <- use _edit_bm\n    _apiError .= Nothing\n    let edit_bm' = edit_bm { tags = S.replaceAll (Pattern \",\") (Replacement \" \") edit_bm.tags }\n    H.liftAff (editBookmark edit_bm') >>= case _ of\n      Left affErr -> do\n        _apiError .= Just (printError affErr)\n        liftEffect $ log (printError affErr)\n      Right { status: StatusCode s } | s >= 200 && s < 300 -> do\n        _bm .= edit_bm'\n        _edit .= false\n      Right res -> do\n        _apiError .= Just (res.body)\n        liftEffect $ log (res.body)\n", "module Component.BList where\n\nimport Prelude\n\nimport Component.BMark (BMessage(..), BSlot, bmark)\nimport Model (Bookmark, BookmarkId)\n\nimport Data.Array (filter)\nimport Effect.Aff (Aff)\nimport Halogen as H\nimport Halogen.HTML as HH\nimport Type.Proxy (Proxy(..))\n\ndata LAction =\n  HandleBMessage BookmarkId BMessage\n\ntype ChildSlots =\n  ( bookmark :: BSlot Int\n  )\n\n_bookmark = Proxy :: Proxy \"bookmark\"\n\nblist :: forall q i o. Array Bookmark -> H.Component q i o Aff\nblist st =\n  H.mkComponent\n    { initialState: const st\n    , render\n    , eval: H.mkEval $ H.defaultEval { handleAction = handleAction }\n    }\n  where\n\n  render :: Array Bookmark -> H.ComponentHTML LAction ChildSlots Aff\n  render bms =\n    HH.div_ $ map (\\b -> HH.slot _bookmark b.bid (bmark b) unit (HandleBMessage b.bid)) bms\n\n  handleAction :: LAction -> H.HalogenM (Array Bookmark) LAction ChildSlots o Aff Unit\n  handleAction (HandleBMessage bid BNotifyRemove) = do\n    H.modify_ (filter (\\b -> b.bid /= bid))\n", "module Component.NList where\n\nimport Prelude hiding (div)\n\nimport Data.Array (drop, foldMap)\nimport Data.Maybe (Maybe(..), maybe)\nimport Data.String (null, split, take) as S\nimport Data.String.Pattern (Pattern(..))\nimport Data.Tuple (fst, snd)\nimport Effect.Aff (Aff)\nimport Globals (app', mmoment8601)\nimport Halogen as H\nimport Halogen.HTML (a, br_, div, text)\nimport Halogen.HTML as HH\nimport Halogen.HTML.Properties (href, id, title)\nimport Model (Note, NoteSlug)\nimport Util (class_, fromNullableStr)\n\ndata NLAction\n  = NLNop\n\ntype NLState =\n  { notes :: Array Note\n  , cur :: Maybe NoteSlug\n  , deleteAsk:: Boolean\n  , edit :: Boolean\n  }\n\n\nnlist :: forall q i o. Array Note -> H.Component q i o Aff\nnlist st' =\n  H.mkComponent\n    { initialState: const (mkState st')\n    , render\n    , eval: H.mkEval $ H.defaultEval { handleAction = handleAction }\n    }\n  where\n  app = app' unit\n\n  mkState notes' =\n    { notes: notes'\n    , cur: Nothing\n    , deleteAsk: false\n    , edit: false\n    }\n\n  render :: NLState -> H.ComponentHTML NLAction () Aff\n  render { notes } =\n    HH.div_ (map renderNote notes)\n    where\n      renderNote note =\n        div [ id (show note.id)\n            , class_ (\"note w-100 mw7 pa1 mb2\"\n                     <> if note.shared then \"\" else \" private\")] $\n           [ div [ class_ \"display\" ] $\n             [ a [ href (linkToFilterSingle note.slug), class_ (\"link f5 lh-title\")]\n               [ text $ if S.null note.title then \"[no title]\" else note.title ]\n             , br_\n             , div [ class_ \"description mt1 mid-gray\" ] (toTextarea (S.take 200 note.text))\n             ,  a [ class_ \"link f7 dib gray w4\"\n                  , title (maybe note.created snd (mmoment note))\n                  , href (linkToFilterSingle note.slug)]\n                [text (maybe \"\u00A0\" fst (mmoment note))]\n             ]\n           ]\n\n  mmoment note = mmoment8601 note.created\n  linkToFilterSingle slug = fromNullableStr app.userR <> \"/notes/\" <> slug\n  toTextarea input =\n    S.split (Pattern \"\\n\") input\n    # foldMap (\\x -> [br_, text x])\n    # drop 1\n\n  handleAction :: NLAction -> H.HalogenM NLState NLAction () o Aff Unit\n  handleAction NLNop = pure unit\n", "module Component.NNote where\n\nimport Prelude hiding (div)\n\nimport Affjax (printError)\nimport Affjax.StatusCode (StatusCode(..))\nimport App (destroyNote, editNote)\nimport Component.Markdown as Markdown\nimport Data.Array (drop, foldMap)\nimport Data.Either (Either(..))\nimport Data.Lens (Lens', lens, use, (%=), (.=))\nimport Data.Maybe (Maybe(..), fromMaybe, isJust, maybe)\nimport Data.Monoid (guard)\nimport Data.String (null, split) as S\nimport Data.String (null, stripPrefix)\nimport Data.String.Pattern (Pattern(..))\nimport Data.Tuple (fst, snd)\nimport Effect.Aff (Aff)\nimport Effect.Class (liftEffect)\nimport Effect.Console (log)\nimport Globals (app', mmoment8601, setFocus, closeWindow)\nimport Halogen as H\nimport Halogen.HTML (br_, button, div, form, input, label, p, span, text, textarea)\nimport Halogen.HTML as HH\nimport Halogen.HTML.Events (onChecked, onClick, onSubmit, onValueChange)\nimport Halogen.HTML.Properties (ButtonType(..), InputType(..), autofocus, checked, for, id, name, rows, title, type_, value)\nimport Model (Note)\nimport Type.Proxy (Proxy(..))\nimport Util (_curQuerystring, _doc, _loc, _lookupQueryStringValue, class_, fromNullableStr, ifElseH, whenH)\nimport Web.Event.Event (Event, preventDefault)\nimport Web.HTML (window)\nimport Web.HTML.HTMLDocument (referrer)\nimport Web.HTML.Location (origin, setHref)\n\ndata NAction\n  = NNop\n  | NEditField EditField\n  | NEditSubmit Event\n  | NEdit Boolean\n  | NDeleteAsk Boolean\n  | NDestroy\n\ntype NState =\n  { note :: Note\n  , edit_note :: Note\n  , deleteAsk :: Boolean\n  , edit :: Boolean\n  , destroyed :: Boolean\n  , apiError :: Maybe String\n  }\n\n_note :: Lens' NState Note\n_note = lens _.note (_ { note = _ })\n\n_edit_note :: Lens' NState Note\n_edit_note = lens _.edit_note (_ { edit_note = _ })\n\n_edit :: Lens' NState Boolean\n_edit = lens _.edit (_ { edit = _ })\n\n_apiError :: Lens' NState (Maybe String)\n_apiError = lens _.apiError (_ { apiError = _ })\n\n-- | FormField Edits\ndata EditField\n  = Etitle String\n  | Etext String\n  | EisMarkdown Boolean\n  | Eshared Boolean\n\n_markdown = Proxy :: Proxy \"markdown\"\n\ntype ChildSlots =\n  ( markdown :: Markdown.Slot Unit\n  )\n\nnnote :: forall q i o. Note -> H.Component q i o Aff\nnnote st' =\n  H.mkComponent\n    { initialState: const (mkState st')\n    , render\n    , eval: H.mkEval $ H.defaultEval { handleAction = handleAction }\n    }\n  where\n  app = app' unit\n\n  mkState note' =\n    { note: note'\n    , edit_note: note'\n    , deleteAsk: false\n    , edit: note'.id <= 0\n    , destroyed: false\n    , apiError: Nothing\n    }\n\n  render :: NState -> H.ComponentHTML NAction ChildSlots Aff\n  render st@{ note, edit_note, apiError } =\n    ifElseH st.destroyed\n       display_destroyed\n       (const (ifElseH st.edit\n                 renderNote_edit\n                 renderNote))\n    where\n\n      renderNote _ =\n        div [ id (show note.id) , class_ (\"note w-100 mw7 pa1 mb2\")] $\n           [ div [ class_ \"display\" ] $\n             [ div [ class_ (\"link f5 lh-title\")]\n               [ text $ if S.null note.title then \"[no title]\" else note.title ]\n             , br_\n             , if note.isMarkdown\n               then div [ class_ \"description mt1\" ] [ HH.slot _markdown unit Markdown.component note.text absurd ]\n               else div [ class_ \"description mt1 mid-gray\" ] (toTextarea note.text)\n             , div [ class_ \"link f7 dib gray w4\"]\n                 [ span [title (maybe note.created snd (mmoment note))]\n                   [text (maybe \"\u00A0\" fst (mmoment note))]\n                 , text \" - \"\n                 , span [ class_ (\"gray\")]\n                   [ text $ if note.shared then \"public\" else \"private\" ]\n               ]\n             ]\n           , whenH app.dat.isowner $ \\_ ->\n               div [ class_ \"edit_links db mt3\" ]\n                 [ button [ type_ ButtonButton, onClick \\_ -> NEdit true, class_ \"edit light-silver hover-blue\" ] [ text \"edit\u00A0\u00A0\" ]\n                 , div [ class_ \"delete_link di\" ]\n                   [ button [ type_ ButtonButton, onClick \\_ -> NDeleteAsk true, class_ (\"delete light-silver hover-blue\" <> guard st.deleteAsk \" dn\") ] [ text \"delete\" ]\n                   , span ([ class_ (\"confirm red\" <> guard (not st.deleteAsk) \" dn\") ] )\n                     [ button [ type_ ButtonButton, onClick \\_ -> NDeleteAsk false] [ text \"cancel\u00A0/\u00A0\" ]\n                     , button [ type_ ButtonButton, onClick \\_ -> NDestroy, class_ \"red\" ] [ text \"destroy\" ]\n                     ]\n                   ]\n                 ]\n               \n           ]\n\n      renderNote_edit _ =\n        form [ onSubmit NEditSubmit ]\n          [ whenH (isJust apiError)\n              (alert_notification (fromMaybe \"\" apiError))\n          , p [ class_ \"mt2 mb1\"] [ text \"title:\" ]\n          , input [ type_ InputText , class_ \"title w-100 mb1 pt1 edit_form_input\" , name \"title\"\n                  , value (edit_note.title) , onValueChange (editField Etitle), autofocus (null edit_note.title)\n            ]\n          , br_\n          , p [ class_ \"mt2 mb1\"] [ text \"description:\" ]\n          , textarea [ id (notetextid edit_note), class_ \"description w-100 mb1 pt1 edit_form_input\" , name \"text\", rows 25\n                     , value (edit_note.text) , onValueChange (editField Etext)\n            ]\n          , div [ class_ \"edit_form_checkboxes mb3\"]\n            [ input [ type_ InputCheckbox , class_ \"is-markdown pointer\" , id \"edit_ismarkdown\", name \"ismarkdown\"\n                     , checked (edit_note.isMarkdown) , onChecked (editField EisMarkdown) ]\n             , text \" \"\n             , label [ for \"edit_ismarkdown\" , class_ \"mr2\" ] [ text \"use markdown?\" ]\n             , br_\n            ]\n          , div [ class_ \"edit_form_checkboxes mb3\"]\n            [ input [ type_ InputCheckbox , class_ \"is-markdown pointer\" , id \"edit_shared\", name \"shared\"\n                    , checked (edit_note.shared) , onChecked (editField Eshared) ]\n            , text \" \"\n            , label [ for \"edit_shared\" , class_ \"mr2\" ] [ text \"public?\" ]\n            , br_\n            ]\n          , input [ type_ InputSubmit\n                  , class_ \"mr1 pv1 ph2 dark-gray ba b--moon-gray bg-near-white pointer rdim\"\n                  , value \"save\" ]\n          , text \" \"\n          , input [ type_ InputReset\n                  , class_ \"pv1 ph2 dark-gray ba b--moon-gray bg-near-white pointer rdim\"\n                  , value \"cancel\"\n                  , onClick \\_ -> NEdit false\n                  ]\n          ]\n\n      display_destroyed _ = p [ class_ \"red\"] [text \"you killed this note\"]\n\n      alert_notification alert_text _ = \n        div [ class_ \"alert alert-err\" ] [ text alert_text ]\n\n      mmoment n = mmoment8601 n.created\n      editField :: forall a. (a -> EditField) -> a -> NAction\n      editField f = NEditField <<< f\n      toTextarea input =\n        S.split (Pattern \"\\n\") input\n        # foldMap (\\x -> [br_, text x])\n        # drop 1\n\n  notetextid note = show note.id <> \"_text\"\n\n  handleAction :: NAction -> H.HalogenM NState NAction ChildSlots o Aff Unit\n  handleAction (NNop) = pure unit\n\n  -- | EditField\n  handleAction (NEditField f) = do\n    _edit_note %= case f of\n      Etitle e -> _ { title = e }\n      Etext e -> _ { text = e }\n      EisMarkdown e -> _ { isMarkdown = e }\n      Eshared e -> _ { shared = e }\n\n  -- | Delete\n  handleAction (NDeleteAsk e) = do\n    H.modify_ (_ { deleteAsk = e })\n\n  -- | Destroy\n  handleAction (NDestroy) = do\n    note <- use _note\n    void $ H.liftAff (destroyNote note.id)\n    H.modify_ (_ { destroyed = true })\n\n  -- | Start/Stop Editing\n  handleAction (NEdit e) = do\n    note <- use _note\n    _edit_note .= note\n    _edit .= e\n    qs <- liftEffect _curQuerystring\n    case {e:e, q:_lookupQueryStringValue qs \"next\"} of\n      {e:false, q:Just \"closeWindow\"} -> liftEffect $ closeWindow =<< window\n      _ -> H.liftEffect $ whenM (pure e) (setFocus (notetextid note))\n    \n\n  -- | Submit\n  handleAction (NEditSubmit e) = do\n    H.liftEffect (preventDefault e)\n    edit_note <- use _edit_note\n    _apiError .= Nothing\n    H.liftAff (editNote edit_note) >>= case _ of\n      Left affErr -> do\n        _apiError .= Just (printError affErr)\n        liftEffect $ log (printError affErr)\n      Right { status: StatusCode s } | s >= 200 && s < 300 -> do\n        qs <- liftEffect _curQuerystring\n        doc <- liftEffect $ _doc\n        ref <- liftEffect $ referrer doc\n        loc <- liftEffect $ _loc\n        org <- liftEffect $ origin loc\n        case _lookupQueryStringValue qs \"next\" of\n          Just \"closeWindow\" -> liftEffect $ closeWindow =<< window\n          Just \"back\" -> liftEffect $\n            if isJust (stripPrefix (Pattern org) ref)\n              then setHref ref loc\n              else setHref org loc\n          _ -> if (edit_note.id == 0)\n                 then liftEffect $ setHref (fromNullableStr app.noteR) =<< _loc\n                 else do\n                   _note .= edit_note\n                   _edit .= false\n      Right res -> do\n        _apiError .= Just (res.body)\n        liftEffect $ log (res.body)\n", "module Component.TagCloud where\n\nimport Prelude hiding (div)\n\nimport App (getTagCloud, updateTagCloudMode)\nimport Data.Array (concat, cons, delete, notElem, null, sortBy)\nimport Data.Foldable (maximum, minimum)\nimport Data.Int (toNumber)\nimport Data.Lens (Lens', lens)\nimport Data.Maybe (Maybe(..), fromMaybe)\nimport Data.Monoid (guard)\nimport Data.String (joinWith, toLower, null) as S\nimport Data.String (toLower)\nimport Data.Tuple (fst, uncurry)\nimport Effect.Aff (Aff)\nimport Foreign.Object (Object)\nimport Foreign.Object (toUnfoldable, empty, values) as F\nimport Globals (app')\nimport Halogen (AttrName(..))\nimport Halogen as H\nimport Halogen.HTML (HTML, a, attr, button, div, text)\nimport Halogen.HTML.Events (onClick)\nimport Halogen.HTML.Properties (ButtonType(..), href, title, type_)\nimport Data.Number (log)\nimport Model (TagCloud, TagCloudModeF(..), isExpanded, isRelated, setExpanded, tagCloudModeFromF)\nimport Util (class_, encodeTag, fromNullableStr, ifElseA, whenH)\n\ndata TAction\n  = TInitialize\n  | TExpanded Boolean\n  | TChangeMode TagCloudModeF\n\ntype TState =\n  { mode :: TagCloudModeF\n  , tagcloud :: TagCloud\n  }\n\n_mode :: Lens' TState TagCloudModeF\n_mode = lens _.mode (_ { mode = _ })\n\ntagcloudcomponent :: forall q i o. TagCloudModeF -> H.Component q i o Aff\ntagcloudcomponent m' =\n  H.mkComponent\n    { initialState: const (mkState m')\n    , render\n    , eval: H.mkEval $ H.defaultEval { handleAction = handleAction\n                                     , initialize = Just TInitialize\n                                     }\n    }\n  where\n  app = app' unit\n  mkState m =\n    { mode: m\n    , tagcloud: F.empty\n    }\n\n  render :: TState -> H.ComponentHTML TAction () Aff\n  render { mode:TagCloudModeNone } =\n    div [class_ \"tag_cloud\" ] []\n  render { mode, tagcloud } =\n    div [class_ \"tag_cloud mv3\" ] \n    [\n      div [class_ \"tag_cloud_header mb2\"] $\n          ifElseA (isRelated mode)\n            (\\_ -> do --RELATED\n              [ button [ type_ ButtonButton, class_ (\"pa1 f7 link hover-blue mr1 b\")\n                       , onClick \\_ -> TExpanded (not (isExpanded mode))\n                       ] [text \"Related Tags\"]\n              ]\n            ) \n            (\\_ -> do -- NOT RELATED\n              [ button [ type_ ButtonButton, class_ (\"pa1 f7 link hover-blue mr1\" <> guard (mode == modetop) \" b\")\n                       , title \"show a cloud of your most-used tags\"\n                       , onClick \\_ -> TChangeMode modetop\n                       ] [text \"Top Tags\"]\n              , button [ type_ ButtonButton, class_ (\"pa1 f7 link hover-blue ml2 \" <> guard (mode == modelb1) \" b\") \n                       , title \"show all tags\"\n                       , onClick \\_ -> TChangeMode modelb1\n                       ] [text \"all\"] \n              , text \"\u2027\"\n              , button [ type_ ButtonButton, class_ (\"pa1 f7 link hover-blue\" <> guard (mode == modelb2) \" b\") \n                       , title \"show tags with at least 2 bookmarks\"\n                       , onClick \\_ -> TChangeMode modelb2\n                       ] [text \"2\"]\n              , text \"\u2027\"\n              , button [ type_ ButtonButton, class_ (\"pa1 f7 link hover-blue\" <> guard (mode == modelb5) \" b\") \n                       , title \"show tags with at least 5 bookmarks\"\n                       , onClick \\_ -> TChangeMode modelb5\n                       ] [text \"5\"]\n              , text \"\u2027\"\n              , button [ type_ ButtonButton, class_ (\"pa1 f7 link hover-blue\" <> guard (mode == modelb10) \" b\") \n                       , title \"show tags with at least 10 bookmarks\"\n                       , onClick \\_ -> TChangeMode modelb10\n                       ] [text \"10\"]\n              , text \"\u2027\"\n              , button [ type_ ButtonButton, class_ (\"pa1 f7 link hover-blue\" <> guard (mode == modelb20) \" b\") \n                       , title \"show tags with at least 20 bookmarks\"\n                       , onClick \\_ -> TChangeMode modelb20\n                       ] [text \"20\"]\n              ])\n              <> [button [ type_ ButtonButton, class_ \"pa1 ml2 f7 link silver hover-blue \"\n                         , onClick \\_ -> TExpanded (not (isExpanded mode))]\n                         [ text (if isExpanded mode then \"hide\" else \"show\") ]]\n    , whenH (isExpanded mode) \\_ -> do\n        let n = fromMaybe 1 (minimum (F.values tagcloud))\n            m = fromMaybe 1 (maximum (F.values tagcloud))\n        div [class_ \"tag_cloud_body\"] $ case mode of\n          TagCloudModeNone -> []\n          (TagCloudModeRelated _ curtags) -> \n            toArray curtags n m tagcloud\n          _ -> \n            toArray [] n m tagcloud\n          \n    ]\n    where\n      modetop = TagCloudModeTop (isExpanded mode) 200\n      modelb1 = TagCloudModeLowerBound (isExpanded mode) 1\n      modelb2 = TagCloudModeLowerBound (isExpanded mode) 2\n      modelb5 = TagCloudModeLowerBound (isExpanded mode) 5\n      modelb10 = TagCloudModeLowerBound (isExpanded mode) 10\n      modelb20 = TagCloudModeLowerBound (isExpanded mode) 20\n\n\n  toArray :: Array String -> Int -> Int -> Object Int -> Array (HTML _ _)\n  toArray curtags n m =\n    concat\n    <<< map (uncurry (toSizedTag (map toLower curtags) n m))\n    <<< sortBy (comparing (S.toLower <<< fst))\n    <<< F.toUnfoldable\n\n  linkToFilterTag rest = fromNullableStr app.userR <> (if S.null rest then \"\" else \"/t:\" <> rest) \n\n  toSizedTag :: Array String -> Int -> Int -> String -> Int -> _\n  toSizedTag curtags n m k v =\n    [ a [ href (linkToFilterTag (encodeTag k)), class_ \"link tag mr1\" , style] \n        [ text k ]\n      , whenH (not (null curtags))  \\_ -> if (notElem k_lower curtags)\n          then a [href (linkToFilterTag (S.joinWith \"+\" (map encodeTag (cons k_lower curtags)))), class_ \"link mr2 tag-include\"] [text \"\u2295\"]\n          else a [href (linkToFilterTag (S.joinWith \"+\" (map encodeTag (delete k_lower curtags)))), class_ \"link mr2 tag-exclude\"] [text \"\u2296\"]\n    ]\n    where\n      k_lower = toLower k\n      fontsize = rescale identity (toNumber v) (toNumber n) (toNumber m) 100.0 150.0\n      opacity = rescale (log <<< (1.0 + _)) (toNumber v) (toNumber n) (toNumber m) 0.6 1.0\n      style = attr (AttrName \"style\") (\"font-size:\" <> show fontsize <> \"%\" <> \";opacity:\" <> show opacity)\n\n  rescale :: (Number -> Number) -> Number -> Number -> Number -> Number -> Number -> Number\n  rescale f v n m l h = (if m - n < 0.01 then 1.0 else (f (v - n) / f (m - n))) * (h - l) + l\n\n  fetchTagCloud :: TagCloudModeF -> H.HalogenM TState TAction () o Aff Unit\n  fetchTagCloud mode' = do\n    case mode' of\n      TagCloudModeNone -> pure unit\n      _ -> do\n        tagcloud <- H.liftAff $ getTagCloud (tagCloudModeFromF mode')\n        H.modify_ (\\s -> s { \n          mode = mode',\n          tagcloud = fromMaybe F.empty tagcloud\n        })\n  \n  handleAction :: TAction -> H.HalogenM TState TAction () o Aff Unit\n  handleAction TInitialize = do\n    mode <- H.gets _.mode\n    fetchTagCloud mode\n  handleAction (TExpanded expanded) = do\n    H.modify_ (\\s -> s { mode = setExpanded s.mode expanded })\n    mode <- H.gets _.mode\n    void $ H.liftAff $ updateTagCloudMode (tagCloudModeFromF mode)\n  handleAction (TChangeMode mode') = do\n    mode <- H.gets _.mode\n    if mode == mode'\n       then handleAction (TExpanded (not (isExpanded mode)))\n       else fetchTagCloud (setExpanded mode' true)\n", "module Halogen.Aff.Util\n  ( awaitLoad\n  , awaitBody\n  , selectElement\n  , runHalogenAff\n  ) where\n\nimport Prelude\n\nimport Control.Monad.Error.Class (throwError)\nimport Data.Either (Either(..), either)\nimport Data.Maybe (Maybe, maybe)\nimport Effect (Effect)\nimport Effect.Aff (Aff, effectCanceler, makeAff, nonCanceler, runAff_)\nimport Effect.Class (liftEffect)\nimport Effect.Exception (throwException, error)\nimport Web.DOM.ParentNode (QuerySelector(..), querySelector)\nimport Web.Event.EventTarget (addEventListener, eventListener, removeEventListener)\nimport Web.HTML (window)\nimport Web.HTML.Event.EventTypes as ET\nimport Web.HTML.HTMLDocument (readyState)\nimport Web.HTML.HTMLDocument as HTMLDocument\nimport Web.HTML.HTMLDocument.ReadyState (ReadyState(..))\nimport Web.HTML.HTMLElement (HTMLElement)\nimport Web.HTML.HTMLElement as HTMLElement\nimport Web.HTML.Window as Window\n\n-- | Waits for the document to load.\nawaitLoad :: Aff Unit\nawaitLoad = makeAff \\callback -> do\n  rs <- readyState =<< Window.document =<< window\n  case rs of\n    Loading -> do\n      et <- Window.toEventTarget <$> window\n      listener <- eventListener (\\_ -> callback (Right unit))\n      addEventListener ET.domcontentloaded listener false et\n      pure $ effectCanceler (removeEventListener ET.domcontentloaded listener false et)\n    _ -> do\n      callback (Right unit)\n      pure nonCanceler\n\n-- | Waits for the document to load and then finds the `body` element.\nawaitBody :: Aff HTMLElement\nawaitBody = do\n  awaitLoad\n  body <- selectElement (QuerySelector \"body\")\n  maybe (throwError (error \"Could not find body\")) pure body\n\n-- | Tries to find an element in the document.\nselectElement :: QuerySelector -> Aff (Maybe HTMLElement)\nselectElement query = do\n  mel <- liftEffect do\n    (querySelector query <<< HTMLDocument.toParentNode <=< Window.document) =<< window\n  pure $ HTMLElement.fromElement =<< mel\n\n-- | Runs an `Aff` value of the type commonly used by Halogen components. Any\n-- | unhandled errors will be re-thrown as exceptions.\nrunHalogenAff :: forall x. Aff x -> Effect Unit\nrunHalogenAff = runAff_ (either throwException (const (pure unit)))\n", "module Control.Monad.Fork.Class where\n\nimport Prelude hiding (join)\n\nimport Effect.Aff as Aff\nimport Control.Monad.Error.Class (class MonadThrow, class MonadError)\nimport Control.Monad.Reader.Trans (ReaderT(..), runReaderT)\nimport Control.Monad.Trans.Class (lift)\n\n-- | Represents Monads which can be forked asynchronously.\n-- |\n-- | Laws:\n-- |\n-- | ```purescript\n-- | -- Unjoined suspension is a no-op\n-- | suspend a1 *> suspend a2 = suspend a2\n-- |\n-- | -- Suspend/join is identity\n-- | suspend >=> join = id\n-- |\n-- | -- Fork/join is identity\n-- | fork >=> join = id\n-- |\n-- | -- Join is idempotent\n-- | join t *> join t = join t\n-- | ```\nclass (Monad m, Functor f) <= MonadFork f m | m -> f where\n  suspend :: forall a. m a -> m (f a)\n  fork :: forall a. m a -> m (f a)\n  join :: forall a. f a -> m a\n\ninstance monadForkAff :: MonadFork Aff.Fiber Aff.Aff where\n  suspend = Aff.suspendAff\n  fork = Aff.forkAff\n  join = Aff.joinFiber\n\ninstance monadForkReaderT :: MonadFork f m => MonadFork f (ReaderT r m) where\n  suspend (ReaderT ma) = ReaderT (suspend <<< ma)\n  fork (ReaderT ma) = ReaderT (fork <<< ma)\n  join = lift <<< join\n\n-- | Represents Monads which can be killed after being forked.\n-- |\n-- | Laws:\n-- |\n-- | ```purescript\n-- | -- Killed suspension is an exception\n-- | suspend a >>= \\f -> kill e f *> join f = throwError e\n-- |\n-- | -- Suspend/kill is unit\n-- | suspend a >>= kill e = pure unit\n-- | ```\nclass (MonadFork f m, MonadThrow e m) <= MonadKill e f m | m -> e f where\n  kill :: forall a. e -> f a -> m Unit\n\ninstance monadKillAff :: MonadKill Aff.Error Aff.Fiber Aff.Aff where\n  kill = Aff.killFiber\n\ninstance monadKillReaderT :: MonadKill e f m => MonadKill e f (ReaderT r m) where\n  kill e = lift <<< kill e\n\ndata BracketCondition e a\n  = Completed a\n  | Failed e\n  | Killed e\n\n-- | Represents Monads which support cleanup in the presence of async\n-- | exceptions.\n-- |\n-- | Laws:\n-- | ```purescript\n-- | bracket a k \\_ -> pure r\n-- |   = uninterruptible (a >>= k (Completed r))\n-- |\n-- | -- Release failed\n-- | bracket a k \\_ -> throwError e\n-- |   = uninterruptible (a >>= k (Failed e) *> throwError e)\n-- |\n-- | -- Release killed\n-- | fork (bracket a k \\_ -> never) >>= \\f -> kill e f *> void (try (join f))\n-- |   = uninterruptible (a >>= k (Killed e))\n-- | ```\nclass (MonadKill e f m, MonadError e m) <= MonadBracket e f m | m -> e f where\n  bracket :: forall r a. m r -> (BracketCondition e a -> r -> m Unit) -> (r -> m a) -> m a\n  uninterruptible :: forall a. m a -> m a\n  never :: forall a. m a\n\ninstance monadBracketAff :: MonadBracket Aff.Error Aff.Fiber Aff.Aff where\n  bracket acquire release run =\n    Aff.generalBracket acquire\n      { completed: release <<< Completed\n      , failed: release <<< Failed\n      , killed: release <<< Killed\n      }\n      run\n  uninterruptible = Aff.invincible\n  never = Aff.never\n\ninstance monadBracketReaderT :: MonadBracket e f m => MonadBracket e f (ReaderT r m) where\n  bracket (ReaderT acquire) release run = ReaderT \\r ->\n    bracket (acquire r)\n      (\\c a -> runReaderT (release c a) r)\n      (\\a -> runReaderT (run a) r)\n  uninterruptible k = ReaderT \\r ->\n    uninterruptible (runReaderT k r)\n  never = lift never\n", "module Halogen.Aff.Driver.State\n  ( LifecycleHandlers\n  , DriverState(..)\n  , mapDriverState\n  , DriverStateRef(..)\n  , DriverStateRec\n  , DriverStateX\n  , unDriverStateX\n  , mkDriverStateXRef\n  , RenderStateX\n  , renderStateX\n  , renderStateX_\n  , unRenderStateX\n  , initDriverState\n  ) where\n\nimport Prelude\n\nimport Data.List (List(..))\nimport Data.Map as M\nimport Data.Maybe (Maybe(..))\nimport Data.Traversable (traverse_)\nimport Effect (Effect)\nimport Effect.Aff (Aff, Fiber)\nimport Effect.Ref (Ref)\nimport Effect.Ref as Ref\nimport Halogen.Component (ComponentSpec)\nimport Halogen.Data.Slot (SlotStorage)\nimport Halogen.Data.Slot as SlotStorage\nimport Halogen.Query.HalogenM (ForkId, SubscriptionId)\nimport Halogen.Subscription as HS\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.DOM (Element)\n\ntype LifecycleHandlers =\n  { initializers :: List (Aff Unit)\n  , finalizers :: List (Aff Unit)\n  }\n\nnewtype DriverState r s f act ps i o = DriverState (DriverStateRec r s f act ps i o)\n\ntype DriverStateRec r s f act ps i o =\n  { component :: ComponentSpec s f act ps i o Aff\n  , state :: s\n  , refs :: M.Map String Element\n  , children :: SlotStorage ps (DriverStateRef r)\n  , childrenIn :: Ref (SlotStorage ps (DriverStateRef r))\n  , childrenOut :: Ref (SlotStorage ps (DriverStateRef r))\n  , selfRef :: Ref (DriverState r s f act ps i o)\n  , handlerRef :: Ref (o -> Aff Unit)\n  , pendingQueries :: Ref (Maybe (List (Aff Unit)))\n  , pendingOuts :: Ref (Maybe (List (Aff Unit)))\n  , pendingHandlers :: Ref (Maybe (List (Aff Unit)))\n  , rendering :: Maybe (r s act ps o)\n  , fresh :: Ref Int\n  , subscriptions :: Ref (Maybe (M.Map SubscriptionId HS.Subscription))\n  , forks :: Ref (M.Map ForkId (Fiber Unit))\n  , lifecycleHandlers :: Ref LifecycleHandlers\n  }\n\nmapDriverState\n  :: forall r s f act ps i o\n   . (DriverStateRec r s f act ps i o -> DriverStateRec r s f act ps i o)\n  -> DriverState r s f act ps i o\n  -> DriverState r s f act ps i o\nmapDriverState f (DriverState ds) = DriverState (f ds)\n\nnewtype DriverStateRef r f o = DriverStateRef (Ref (DriverStateX r f o))\n\n-- | A version of `DriverState` with the aspects relating to child components\n-- | existentially hidden.\ndata DriverStateX\n  (r :: Type -> Type -> Row Type -> Type -> Type)\n  (f :: Type -> Type)\n  (o :: Type)\n\nmkDriverStateXRef\n  :: forall r s f act ps i o\n   . Ref (DriverState r s f act ps i o)\n  -> Ref (DriverStateX r f o)\nmkDriverStateXRef = unsafeCoerce\n\nunDriverStateX\n  :: forall r f i o x\n   . (forall s act ps. DriverStateRec r s f act ps i o -> x)\n  -> DriverStateX r f o\n  -> x\nunDriverStateX = unsafeCoerce\n\n-- | A wrapper of `r` from `DriverState` with the aspects relating to child\n-- | components existentially hidden.\ndata RenderStateX (r :: Type -> Type -> Row Type -> Type -> Type)\n\nmkRenderStateX\n  :: forall r s f ps o m\n   . m (r s f ps o)\n  -> m (RenderStateX r)\nmkRenderStateX = unsafeCoerce\n\nunRenderStateX\n  :: forall r x\n   . (forall s f ps o. r s f ps o -> x)\n  -> RenderStateX r\n  -> x\nunRenderStateX = unsafeCoerce\n\nrenderStateX\n  :: forall m r f o\n   . Functor m\n  => (forall s act ps. Maybe (r s act ps o) -> m (r s act ps o))\n  -> DriverStateX r f o\n  -> m (RenderStateX r)\nrenderStateX f = unDriverStateX \\st ->\n  mkRenderStateX (f st.rendering)\n\nrenderStateX_\n  :: forall m r f o\n   . Applicative m\n  => (forall s act ps. r s act ps o -> m Unit)\n  -> DriverStateX r f o\n  -> m Unit\nrenderStateX_ f = unDriverStateX \\st -> traverse_ f st.rendering\n\ninitDriverState\n  :: forall r s f act ps i o\n   . ComponentSpec s f act ps i o Aff\n  -> i\n  -> (o -> Aff Unit)\n  -> Ref LifecycleHandlers\n  -> Effect (Ref (DriverStateX r f o))\ninitDriverState component input handler lchs = do\n  selfRef <- Ref.new (unsafeCoerce {})\n  childrenIn <- Ref.new SlotStorage.empty\n  childrenOut <- Ref.new SlotStorage.empty\n  handlerRef <- Ref.new handler\n  pendingQueries <- Ref.new (Just Nil)\n  pendingOuts <- Ref.new (Just Nil)\n  pendingHandlers <- Ref.new Nothing\n  fresh <- Ref.new 1\n  subscriptions <- Ref.new (Just M.empty)\n  forks <- Ref.new M.empty\n  let\n    ds :: DriverStateRec r s f act ps i o\n    ds =\n      { component\n      , state: component.initialState input\n      , refs: M.empty\n      , children: SlotStorage.empty\n      , childrenIn\n      , childrenOut\n      , selfRef\n      , handlerRef\n      , pendingQueries\n      , pendingOuts\n      , pendingHandlers\n      , rendering: Nothing\n      , fresh\n      , subscriptions\n      , forks\n      , lifecycleHandlers: lchs\n      }\n  Ref.write (DriverState ds) selfRef\n  pure $ mkDriverStateXRef selfRef\n", "module Halogen.Aff.Driver.Eval\n  ( Renderer\n  , evalF\n  , evalQ\n  , evalM\n  , handleLifecycle\n  , queueOrRun\n  , handleAff\n  ) where\n\nimport Prelude\n\nimport Control.Applicative.Free (hoistFreeAp, retractFreeAp)\nimport Control.Monad.Fork.Class (fork)\nimport Control.Monad.Free (foldFree)\nimport Control.Parallel (parSequence_, parallel, sequential)\nimport Data.Coyoneda (liftCoyoneda)\nimport Data.Either (either)\nimport Data.Foldable (traverse_)\nimport Data.List (List, (:))\nimport Data.List as L\nimport Data.Map as M\nimport Data.Maybe (Maybe(..))\nimport Data.Tuple (Tuple(..))\nimport Effect (Effect)\nimport Effect.Aff (Aff, error, finally, joinFiber, killFiber, runAff_)\nimport Effect.Class (liftEffect)\nimport Effect.Exception (throwException)\nimport Effect.Ref (Ref)\nimport Effect.Ref as Ref\nimport Halogen.Aff.Driver.State (DriverState(..), DriverStateRef(..), LifecycleHandlers, mapDriverState, unDriverStateX)\nimport Halogen.Query.ChildQuery as CQ\nimport Halogen.Query.HalogenM (ForkId(..), HalogenAp(..), HalogenF(..), HalogenM(..), SubscriptionId(..))\nimport Halogen.Query.HalogenQ as HQ\nimport Halogen.Query.Input (Input)\nimport Halogen.Query.Input as Input\nimport Halogen.Subscription as HS\nimport Unsafe.Reference (unsafeRefEq)\n\ntype Renderer r =\n  forall s f act ps i o\n   . Ref LifecycleHandlers\n  -> Ref (DriverState r s f act ps i o)\n  -> Effect Unit\n\nevalF\n  :: forall r s f act ps i o\n   . Renderer r\n  -> Ref (DriverState r s f act ps i o)\n  -> Input act\n  -> Aff Unit\nevalF render ref = case _ of\n  Input.RefUpdate (Input.RefLabel p) el -> do\n    liftEffect $ flip Ref.modify_ ref $ mapDriverState \\st ->\n      st { refs = M.alter (const el) p st.refs }\n  Input.Action act -> do\n    DriverState st <- liftEffect (Ref.read ref)\n    evalM render ref (st.component.eval (HQ.Action act unit))\n\nevalQ\n  :: forall r s f act ps i o a\n   . Renderer r\n  -> Ref (DriverState r s f act ps i o)\n  -> f a\n  -> Aff (Maybe a)\nevalQ render ref q = do\n  DriverState st <- liftEffect (Ref.read ref)\n  evalM render ref (st.component.eval (HQ.Query (Just <$> liftCoyoneda q) (const Nothing)))\n\nevalM\n  :: forall r s f act ps i o a\n   . Renderer r\n  -> Ref (DriverState r s f act ps i o)\n  -> HalogenM s act ps o Aff a\n  -> Aff a\nevalM render initRef (HalogenM hm) = foldFree (go initRef) hm\n  where\n  go\n    :: forall s' f' act' ps' i' o' a'\n     . Ref (DriverState r s' f' act' ps' i' o')\n    -> HalogenF s' act' ps' o' Aff a'\n    -> Aff a'\n  go ref = case _ of\n    State f -> do\n      DriverState (st@{ state, lifecycleHandlers }) <- liftEffect (Ref.read ref)\n      case f state of\n        Tuple a state'\n          | unsafeRefEq state state' -> pure a\n          | otherwise -> do\n              liftEffect $ Ref.write (DriverState (st { state = state' })) ref\n              handleLifecycle lifecycleHandlers (render lifecycleHandlers ref)\n              pure a\n    Subscribe fes k -> do\n      sid <- fresh SubscriptionId ref\n      finalize <- liftEffect $ HS.subscribe (fes sid) \\act ->\n        handleAff $ evalF render ref (Input.Action act)\n      DriverState ({ subscriptions }) <- liftEffect (Ref.read ref)\n      liftEffect $ Ref.modify_ (map (M.insert sid finalize)) subscriptions\n      pure (k sid)\n    Unsubscribe sid next -> do\n      liftEffect $ unsubscribe sid ref\n      pure next\n    Lift aff ->\n      aff\n    ChildQuery cq ->\n      evalChildQuery ref cq\n    Raise o a -> do\n      DriverState { handlerRef, pendingOuts } <- liftEffect (Ref.read ref)\n      handler <- liftEffect (Ref.read handlerRef)\n      queueOrRun pendingOuts (handler o)\n      pure a\n    Par (HalogenAp p) ->\n      sequential $ retractFreeAp $ hoistFreeAp (parallel <<< evalM render ref) p\n    Fork hmu k -> do\n      fid <- fresh ForkId ref\n      DriverState ({ forks }) <- liftEffect (Ref.read ref)\n      doneRef <- liftEffect (Ref.new false)\n      fiber <- fork $ finally\n        ( liftEffect do\n            Ref.modify_ (M.delete fid) forks\n            Ref.write true doneRef\n        )\n        (evalM render ref hmu)\n      liftEffect $ unlessM (Ref.read doneRef) do\n        Ref.modify_ (M.insert fid fiber) forks\n      pure (k fid)\n    Join fid a -> do\n      DriverState { forks } <- liftEffect (Ref.read ref)\n      forkMap <- liftEffect (Ref.read forks)\n      traverse_ joinFiber (M.lookup fid forkMap)\n      pure a\n    Kill fid a -> do\n      DriverState ({ forks }) <- liftEffect (Ref.read ref)\n      forkMap <- liftEffect (Ref.read forks)\n      traverse_ (killFiber (error \"Cancelled\")) (M.lookup fid forkMap)\n      pure a\n    GetRef (Input.RefLabel p) k -> do\n      DriverState { refs } <- liftEffect (Ref.read ref)\n      pure $ k $ M.lookup p refs\n\n  evalChildQuery\n    :: forall s' f' act' ps' i' o' a'\n     . Ref (DriverState r s' f' act' ps' i' o')\n    -> CQ.ChildQueryBox ps' a'\n    -> Aff a'\n  evalChildQuery ref cqb = do\n    DriverState st <- liftEffect (Ref.read ref)\n    cqb # CQ.unChildQueryBox \\(CQ.ChildQuery unpack query reply) -> do\n      let\n        evalChild (DriverStateRef var) = parallel do\n          dsx <- liftEffect (Ref.read var)\n          unDriverStateX (\\ds -> evalQ render ds.selfRef query) dsx\n      reply <$> sequential (unpack evalChild st.children)\n\nunsubscribe\n  :: forall r s' f' act' ps' i' o'\n   . SubscriptionId\n  -> Ref (DriverState r s' f' act' ps' i' o')\n  -> Effect Unit\nunsubscribe sid ref = do\n  DriverState ({ subscriptions }) <- Ref.read ref\n  subs <- Ref.read subscriptions\n  traverse_ HS.unsubscribe (M.lookup sid =<< subs)\n\nhandleLifecycle :: Ref LifecycleHandlers -> Effect ~> Aff\nhandleLifecycle lchs f = do\n  liftEffect $ Ref.write { initializers: L.Nil, finalizers: L.Nil } lchs\n  result <- liftEffect f\n  { initializers, finalizers } <- liftEffect $ Ref.read lchs\n  traverse_ fork finalizers\n  parSequence_ initializers\n  pure result\n\nfresh\n  :: forall r s f act ps i o a\n   . (Int -> a)\n  -> Ref (DriverState r s f act ps i o)\n  -> Aff a\nfresh f ref = do\n  DriverState st <- liftEffect (Ref.read ref)\n  liftEffect $ Ref.modify' (\\i -> { state: i + 1, value: f i }) st.fresh\n\nqueueOrRun\n  :: Ref (Maybe (List (Aff Unit)))\n  -> Aff Unit\n  -> Aff Unit\nqueueOrRun ref au =\n  liftEffect (Ref.read ref) >>= case _ of\n    Nothing -> au\n    Just p -> liftEffect $ Ref.write (Just (au : p)) ref\n\n-- We could perhaps do something more intelligent now this isn't baked into\n-- the virtual-dom rendering. It hasn't really been a problem so far though.\nhandleAff :: forall a. Aff a -> Effect Unit\nhandleAff = runAff_ (either throwException (const (pure unit)))\n", "module Halogen.Aff.Driver\n  ( RenderSpec\n  , runUI\n  , module Halogen\n  ) where\n\nimport Prelude\n\nimport Control.Monad.Fork.Class (fork)\nimport Control.Monad.Rec.Class (Step(..), tailRecM)\nimport Control.Parallel (parSequence_)\nimport Data.List ((:))\nimport Data.List as L\nimport Data.Map as M\nimport Data.Maybe (Maybe(..), maybe, isJust, isNothing)\nimport Data.Traversable (for_, traverse_)\nimport Data.Tuple (Tuple(..))\nimport Effect (Effect)\nimport Effect.Aff (Aff, killFiber)\nimport Effect.Class (liftEffect)\nimport Effect.Console (warn)\nimport Effect.Exception (error, throw)\nimport Effect.Ref (Ref)\nimport Effect.Ref as Ref\nimport Halogen (HalogenIO)\nimport Halogen.Aff.Driver.Eval as Eval\nimport Halogen.Aff.Driver.State (DriverState(..), DriverStateRef(..), DriverStateX, LifecycleHandlers, RenderStateX, initDriverState, mapDriverState, renderStateX, renderStateX_, unDriverStateX)\nimport Halogen.Component (Component, ComponentSlot, ComponentSlotBox, unComponent, unComponentSlot)\nimport Halogen.Data.Slot as Slot\nimport Halogen.HTML.Core as HC\nimport Halogen.Query.HalogenQ as HQ\nimport Halogen.Query.Input (Input)\nimport Halogen.Query.Input as Input\nimport Halogen.Subscription as HS\n\n-- | `RenderSpec` allows for alternative driver implementations without the need\n-- | to provide all of the driver machinery again, focusing just on the code\n-- | needed to render components.\n-- |\n-- | The type variables are as follows:\n-- | - `h` is the type of value being rendered (`Halogen.HTML.Core.HTML`, for\n-- |   example).\n-- | - `r` is the type for the \"render state\" for the driver. This is a value\n-- |   that is stored for each component, that allows the driver to persist\n-- |   state between each rendering of a component. This will differ entirely\n-- |   for each driver. `r` accepts a number of parameters that will be\n-- |   explained below.\n-- |\n-- | The \"inner\" type variables, used by `r` and the other functions are as\n-- | follows:\n-- | - `s` is the state type for the component.\n-- | - `act` is the action type for the component\n-- | - `ps` is the set of slots for addressing child components\n-- | - `o` is the output message type for the component\n-- |\n-- | Note that none of these variables can escape `RenderSpec`'s functions. They\n-- | need to be instantiated with each function call, as the same `RenderSpec`\n-- | is used to deal with all components in the hierarchy.\n-- |\n-- | The `render` function is the main part of the spec, it accepts:\n-- | - A \"handler\" function, for evaluating component queries. This is used to\n-- |   implement event handlers in HTML-based drivers.\n-- | - A \"child\" function for dealing with the rendering of children, returning\n-- |   the render state for the child component in an existentially hidden\n-- |   package. This return value would commonly be used to extract the rendered\n-- |   subtree for the child to graft it in place of the child slot. The\n-- |   existential package can be unwrapped with `Halogen.Aff.Driver.State.unRenderStateX`.\n-- | - The `h` value to render, parameterised by the slot type for the\n-- |   component's children. This slot type is what the \"child\" function\n-- |   accepts.\n-- | - The previous render state for the component. If the component has not\n-- |   previously been initalized, this will be `Nothing`.\n-- |\n-- | The render function then returns the updated (or initial) render state for\n-- | the component, which will be fed back into `render` the next time the\n-- | component needs to update.\n-- |\n-- | The `renderChild` function's behaviour will be highly dependant on the\n-- | particular driver implementing `RenderSpec`. Its purpose is to take a\n-- | driver render state for a component and produce a new one that may remap\n-- | the rendered value to be something more suitable for grafting during\n-- | `render` of the parent. For the built-in `halogen-vdom` driver this is\n-- | just `identity`. For the `virtual-dom` driver it wraps the rendered HTML\n-- | in a widget, to prevent the `virtual-dom` algorithm from re-diffing\n-- | values that we know are unchanged.\n-- |\n-- | The `removeChild` function is for drivers that need to perform some special\n-- | cleanup when removing a component from the hierarchy. In the `halogen-vdom`\n-- | driver this actually performs the `removeChild` from the DOM. For the\n-- | `virtual-dom` driver nothing needs to happen here, so it is\n-- | `const (pure unit)`.\n-- |\n-- | The `dispose` function is called when the top level component is disposed of\n-- | via `HalogenIO`.\ntype RenderSpec r =\n  { render ::\n      forall s act ps o\n       . (Input act -> Effect Unit)\n      -> (ComponentSlotBox ps Aff act -> Effect (RenderStateX r))\n      -> HC.HTML (ComponentSlot ps Aff act) act\n      -> Maybe (r s act ps o)\n      -> Effect (r s act ps o)\n  , renderChild :: forall s act ps o. r s act ps o -> r s act ps o\n  , removeChild :: forall s act ps o. r s act ps o -> Effect Unit\n  , dispose :: forall s act ps o. r s act ps o -> Effect Unit\n  }\n\nrunUI\n  :: forall r f i o\n   . RenderSpec r\n  -> Component f i o Aff\n  -> i\n  -> Aff (HalogenIO f o Aff)\nrunUI renderSpec component i = do\n  lchs <- liftEffect newLifecycleHandlers\n  disposed <- liftEffect $ Ref.new false\n  Eval.handleLifecycle lchs do\n    sio <- HS.create\n    dsx <- Ref.read =<< runComponent lchs (liftEffect <<< HS.notify sio.listener) i component\n    dsx # unDriverStateX \\st -> pure\n      { query: evalDriver disposed st.selfRef\n      , messages: sio.emitter\n      , dispose: dispose disposed lchs dsx\n      }\n  where\n  evalDriver\n    :: forall s f' act ps i' o'\n     . Ref Boolean\n    -> Ref (DriverState r s f' act ps i' o')\n    -> (forall a. f' a -> Aff (Maybe a))\n  evalDriver disposed ref q =\n    liftEffect (Ref.read disposed) >>=\n      if _ then pure Nothing\n      else Eval.evalQ render ref q\n\n  runComponent\n    :: forall f' i' o'\n     . Ref LifecycleHandlers\n    -> (o' -> Aff Unit)\n    -> i'\n    -> Component f' i' o' Aff\n    -> Effect (Ref (DriverStateX r f' o'))\n  runComponent lchs handler j = unComponent \\c -> do\n    lchs' <- newLifecycleHandlers\n    var <- initDriverState c j handler lchs'\n    pre <- Ref.read lchs\n    Ref.write { initializers: L.Nil, finalizers: pre.finalizers } lchs\n    unDriverStateX (render lchs <<< _.selfRef) =<< Ref.read var\n    squashChildInitializers lchs pre.initializers =<< Ref.read var\n    pure var\n\n  render\n    :: forall s f' act ps i' o'\n     . Ref LifecycleHandlers\n    -> Ref (DriverState r s f' act ps i' o')\n    -> Effect Unit\n  render lchs var = Ref.read var >>= \\(DriverState ds) -> do\n    shouldProcessHandlers <- isNothing <$> Ref.read ds.pendingHandlers\n    when shouldProcessHandlers $ Ref.write (Just L.Nil) ds.pendingHandlers\n    Ref.write Slot.empty ds.childrenOut\n    Ref.write ds.children ds.childrenIn\n\n    let\n      -- The following 3 defs are working around a capture bug, see #586\n      pendingHandlers = identity ds.pendingHandlers\n      pendingQueries = identity ds.pendingQueries\n      selfRef = identity ds.selfRef\n\n      handler :: Input act -> Aff Unit\n      handler = Eval.queueOrRun pendingHandlers <<< void <<< Eval.evalF render selfRef\n\n      childHandler :: act -> Aff Unit\n      childHandler = Eval.queueOrRun pendingQueries <<< handler <<< Input.Action\n\n    rendering <-\n      renderSpec.render\n        (Eval.handleAff <<< handler)\n        (renderChild lchs childHandler ds.childrenIn ds.childrenOut)\n        (ds.component.render ds.state)\n        ds.rendering\n\n    children <- Ref.read ds.childrenOut\n    childrenIn <- Ref.read ds.childrenIn\n\n    Slot.foreachSlot childrenIn \\(DriverStateRef childVar) -> do\n      childDS <- Ref.read childVar\n      renderStateX_ renderSpec.removeChild childDS\n      finalize lchs childDS\n\n    flip Ref.modify_ ds.selfRef $ mapDriverState \\ds' ->\n      ds' { rendering = Just rendering, children = children }\n\n    when shouldProcessHandlers do\n      flip tailRecM unit \\_ -> do\n        handlers <- Ref.read pendingHandlers\n        Ref.write (Just L.Nil) pendingHandlers\n        traverse_ (Eval.handleAff <<< traverse_ fork <<< L.reverse) handlers\n        mmore <- Ref.read pendingHandlers\n        if maybe false L.null mmore then Ref.write Nothing pendingHandlers $> Done unit\n        else pure $ Loop unit\n\n  renderChild\n    :: forall ps act\n     . Ref LifecycleHandlers\n    -> (act -> Aff Unit)\n    -> Ref (Slot.SlotStorage ps (DriverStateRef r))\n    -> Ref (Slot.SlotStorage ps (DriverStateRef r))\n    -> ComponentSlotBox ps Aff act\n    -> Effect (RenderStateX r)\n  renderChild lchs handler childrenInRef childrenOutRef =\n    unComponentSlot \\slot -> do\n      childrenIn <- slot.pop <$> Ref.read childrenInRef\n      var <- case childrenIn of\n        Just (Tuple (DriverStateRef existing) childrenIn') -> do\n          Ref.write childrenIn' childrenInRef\n          dsx <- Ref.read existing\n          dsx # unDriverStateX \\st -> do\n            flip Ref.write st.handlerRef $ maybe (pure unit) handler <<< slot.output\n            Eval.handleAff $ Eval.evalM render st.selfRef (st.component.eval (HQ.Receive slot.input unit))\n          pure existing\n        Nothing ->\n          runComponent lchs (maybe (pure unit) handler <<< slot.output) slot.input slot.component\n      isDuplicate <- isJust <<< slot.get <$> Ref.read childrenOutRef\n      when isDuplicate\n        $ warn \"Halogen: Duplicate slot address was detected during rendering, unexpected results may occur\"\n      Ref.modify_ (slot.set $ DriverStateRef var) childrenOutRef\n      Ref.read var >>= renderStateX case _ of\n        Nothing -> throw \"Halogen internal error: child was not initialized in renderChild\"\n        Just r -> pure (renderSpec.renderChild r)\n\n  squashChildInitializers\n    :: forall f' o'\n     . Ref LifecycleHandlers\n    -> L.List (Aff Unit)\n    -> DriverStateX r f' o'\n    -> Effect Unit\n  squashChildInitializers lchs preInits =\n    unDriverStateX \\st -> do\n      let parentInitializer = Eval.evalM render st.selfRef (st.component.eval (HQ.Initialize unit))\n      lchs # Ref.modify_ \\handlers ->\n        { initializers:\n            ( do\n                parSequence_ (L.reverse handlers.initializers)\n                parentInitializer\n                liftEffect do\n                  handlePending st.pendingQueries\n                  handlePending st.pendingOuts\n            ) : preInits\n        , finalizers: handlers.finalizers\n        }\n\n  finalize\n    :: forall f' o'\n     . Ref LifecycleHandlers\n    -> DriverStateX r f' o'\n    -> Effect Unit\n  finalize lchs = do\n    unDriverStateX \\st -> do\n      cleanupSubscriptionsAndForks (DriverState st)\n      let f = Eval.evalM render st.selfRef (st.component.eval (HQ.Finalize unit))\n      lchs # Ref.modify_ \\handlers ->\n        { initializers: handlers.initializers\n        , finalizers: f : handlers.finalizers\n        }\n      Slot.foreachSlot st.children \\(DriverStateRef ref) -> do\n        dsx <- Ref.read ref\n        finalize lchs dsx\n\n  dispose\n    :: forall f' o'\n     . Ref Boolean\n    -> Ref LifecycleHandlers\n    -> DriverStateX r f' o'\n    -> Aff Unit\n  dispose disposed lchs dsx = Eval.handleLifecycle lchs do\n    Ref.read disposed >>=\n      if _ then\n        pure unit\n      else do\n        Ref.write true disposed\n        finalize lchs dsx\n        dsx # unDriverStateX \\{ selfRef } -> do\n          (DriverState ds) <- liftEffect $ Ref.read selfRef\n          for_ ds.rendering renderSpec.dispose\n\nnewLifecycleHandlers :: Effect (Ref LifecycleHandlers)\nnewLifecycleHandlers = Ref.new { initializers: L.Nil, finalizers: L.Nil }\n\nhandlePending :: Ref (Maybe (L.List (Aff Unit))) -> Effect Unit\nhandlePending ref = do\n  queue <- Ref.read ref\n  Ref.write Nothing ref\n  for_ queue (Eval.handleAff <<< traverse_ fork <<< L.reverse)\n\ncleanupSubscriptionsAndForks\n  :: forall r s f act ps i o\n   . DriverState r s f act ps i o\n  -> Effect Unit\ncleanupSubscriptionsAndForks (DriverState ds) = do\n  traverse_ (traverse_ HS.unsubscribe) =<< Ref.read ds.subscriptions\n  Ref.write Nothing ds.subscriptions\n  traverse_ (Eval.handleAff <<< killFiber (error \"finalized\")) =<< Ref.read ds.forks\n  Ref.write M.empty ds.forks\n", "var getEffProp = function (name) {\n  return function (node) {\n    return function () {\n      return node[name];\n    };\n  };\n};\n\nexport function nodeTypeIndex(node) {\n  return node.nodeType;\n}\n\nexport function nodeName(node) {\n  return node.nodeName;\n}\n\nexport const baseURI = getEffProp(\"baseURI\");\nexport const _ownerDocument = getEffProp(\"ownerDocument\");\nexport const _parentNode = getEffProp(\"parentNode\");\nexport const _parentElement = getEffProp(\"parentElement\");\n\nexport function hasChildNodes(node) {\n  return function () {\n    return node.hasChildNodes();\n  };\n}\n\nexport const childNodes = getEffProp(\"childNodes\");\nexport const _firstChild = getEffProp(\"firstChild\");\nexport const _lastChild = getEffProp(\"lastChild\");\nexport const _previousSibling = getEffProp(\"previousSibling\");\nexport const _nextSibling = getEffProp(\"nextSibling\");\nexport const _nodeValue = getEffProp(\"nodeValue\");\n\nexport function setNodeValue(value) {\n  return function (node) {\n    return function () {\n      node.nodeValue = value;\n    };\n  };\n}\n\nexport const textContent = getEffProp(\"textContent\");\n\nexport function setTextContent(value) {\n  return function (node) {\n    return function () {\n      node.textContent = value;\n    };\n  };\n}\n\nexport function normalize(node) {\n  return function () {\n    node.normalize();\n  };\n}\n\nexport function clone(node) {\n  return function () {\n    return node.cloneNode(false);\n  };\n}\n\nexport function deepClone(node) {\n  return function () {\n    return node.cloneNode(true);\n  };\n}\n\nexport function isEqualNode(node1) {\n  return function (node2) {\n    return function () {\n      return node1.isEqualNode(node2);\n    };\n  };\n}\n\nexport function compareDocumentPositionBits(node1) {\n  return function (node2) {\n    return function () {\n      return node1.compareDocumentPosition(node2);\n    };\n  };\n}\n\nexport function contains(node1) {\n  return function (node2) {\n    return function () {\n      return node1.contains(node2);\n    };\n  };\n}\n\nexport function _lookupPrefix(prefix) {\n  return function (node) {\n    return function () {\n      return node.lookupPrefix(prefix);\n    };\n  };\n}\n\nexport function _lookupNamespaceURI(ns) {\n  return function (node) {\n    return function () {\n      return node.lookupNamespaceURI(ns);\n    };\n  };\n}\n\nexport function isDefaultNamespace(ns) {\n  return function (node) {\n    return function () {\n      return node.isDefaultNamespace(ns);\n    };\n  };\n}\n\nexport function insertBefore(node1) {\n  return function (node2) {\n    return function (parent) {\n      return function () {\n        parent.insertBefore(node1, node2);\n      };\n    };\n  };\n}\n\nexport function appendChild(node) {\n  return function (parent) {\n    return function () {\n      parent.appendChild(node);\n    };\n  };\n}\n\nexport function replaceChild(newChild) {\n  return function (oldChild) {\n    return function (parent) {\n      return function () {\n        parent.replaceChild(newChild, oldChild);\n      };\n    };\n  };\n}\n\nexport function removeChild(node) {\n  return function (parent) {\n    return function () {\n      parent.removeChild(node);\n    };\n  };\n}\n", "module Web.DOM.Node\n  ( module Exports\n  , fromEventTarget\n  , toEventTarget\n  , nodeType\n  , nodeTypeIndex\n  , nodeName\n  , baseURI\n  , ownerDocument\n  , parentNode\n  , parentElement\n  , hasChildNodes\n  , childNodes\n  , firstChild\n  , lastChild\n  , previousSibling\n  , nextSibling\n  , nodeValue\n  , setNodeValue\n  , textContent\n  , setTextContent\n  , normalize\n  , clone\n  , deepClone\n  , isEqualNode\n  , compareDocumentPositionBits\n  , contains\n  , lookupPrefix\n  , lookupNamespaceURI\n  , isDefaultNamespace\n  , insertBefore\n  , appendChild\n  , replaceChild\n  , removeChild\n  ) where\n\nimport Prelude\n\nimport Data.Enum (toEnum)\nimport Data.Maybe (Maybe, fromJust)\nimport Data.Nullable (Nullable, toMaybe)\nimport Effect (Effect)\nimport Unsafe.Coerce (unsafeCoerce)\nimport Web.DOM.Document (Document)\nimport Web.DOM.Element (Element)\nimport Web.DOM.Internal.Types (Node) as Exports\nimport Web.DOM.Internal.Types (Node, NodeList)\nimport Web.DOM.NodeType (NodeType)\nimport Web.Event.EventTarget (EventTarget)\nimport Web.Internal.FFI (unsafeReadProtoTagged)\n\nfromEventTarget :: EventTarget -> Maybe Node\nfromEventTarget = unsafeReadProtoTagged \"Node\"\n\ntoEventTarget :: Node -> EventTarget\ntoEventTarget = unsafeCoerce\n\n-- | The type of a node.\nnodeType :: Partial => Node -> NodeType\nnodeType = fromJust <<< toEnum <<< nodeTypeIndex\n\n-- | The numeric value for the type of a node.\nforeign import nodeTypeIndex :: Node -> Int\n\n-- | For elements this is the tag name, for document types this is the doctype\n-- | name, for processing instructions this is the target, for all other nodes\n-- | it is a string like `\"#text\"`, `\"#comment\", etc. depending on the node\n-- | type.\nforeign import nodeName :: Node -> String\n\n-- | The node's base URL.\nforeign import baseURI :: Node -> Effect String\n\n-- | The document the node belongs to, unless the node is a document in which\n-- | case the value is Nothing.\nownerDocument :: Node -> Effect (Maybe Document)\nownerDocument = map toMaybe <<< _ownerDocument\n\nforeign import _ownerDocument :: Node -> Effect (Nullable Document)\n\n-- | The parent node of the node.\nparentNode :: Node -> Effect (Maybe Node)\nparentNode = map toMaybe <<< _parentNode\n\nforeign import _parentNode :: Node -> Effect (Nullable Node)\n\n-- | The parent element of the node.\nparentElement :: Node -> Effect (Maybe Element)\nparentElement = map toMaybe <<< _parentElement\n\nforeign import _parentElement :: Node -> Effect (Nullable Element)\n\n-- | Indicates whether the node has any child nodes.\nforeign import hasChildNodes :: Node -> Effect Boolean\n\n-- | The children of the node.\nforeign import childNodes :: Node -> Effect NodeList\n\n-- | The first child of the node, or Nothing if the node has no children.\nfirstChild :: Node -> Effect (Maybe Node)\nfirstChild = map toMaybe <<< _firstChild\n\nforeign import _firstChild :: Node -> Effect (Nullable Node)\n\n\n-- | The last child of the node, or Nothing if the node has no children.\nlastChild :: Node -> Effect (Maybe Node)\nlastChild = map toMaybe <<< _lastChild\n\nforeign import _lastChild :: Node -> Effect (Nullable Node)\n\n-- | The previous sibling node, or Nothing if there is no previous sibling.\npreviousSibling :: Node -> Effect (Maybe Node)\npreviousSibling = map toMaybe <<< _previousSibling\n\nforeign import _previousSibling :: Node -> Effect (Nullable Node)\n\n-- | The next sibling node, or Nothing if there is no next sibling.\nnextSibling :: Node -> Effect (Maybe Node)\nnextSibling = map toMaybe <<< _nextSibling\n\nforeign import _nextSibling :: Node -> Effect (Nullable Node)\n\n-- | If the node type is text, comment, or processing instruction this is\n-- | `Just` the node's data, or `Nothing` in all other cases.\nnodeValue :: Node -> Effect (Maybe String)\nnodeValue = map toMaybe <<< _nodeValue\n\nforeign import _nodeValue :: Node -> Effect (Nullable String)\n\n-- | If the node type is text, comment, or processing instruction this allows\n-- | the node's data to be changed, or has no effect in all other cases.\nforeign import setNodeValue :: String -> Node -> Effect Unit\n\n-- | If the node type is document fragment, element, text, processing\n-- | instruction, or comment this is the node's data, or null in all other\n-- | cases.\nforeign import textContent :: Node -> Effect String\n\n-- | If the node type is document fragment, element, text, processing\n-- | instruction, or comment this allows the node's data to be changed, or has\n-- | no effect in all other cases.\nforeign import setTextContent :: String -> Node -> Effect Unit\n\n-- | Removes empty text nodes and then combines any remaining text nodes that\n-- | are contiguous.\nforeign import normalize :: Node -> Effect Unit\n\n-- | Clones the node without cloning the node's descendants.\nforeign import clone :: Node -> Effect Node\n\n-- | Clones the node and its descendants.\nforeign import deepClone :: Node -> Effect Node\n\n-- | Checks whether two nodes are equivalent.\nforeign import isEqualNode :: Node -> Node -> Effect Boolean\n\n-- TODO: compareDocumentPosition that returns a semigroup or something instead of the bitmask value\n\n-- | Compares the position of two nodes in the document.\nforeign import compareDocumentPositionBits :: Node -> Node -> Effect Int\n\n-- | Checks whether the second node is contained within the first\nforeign import contains :: Node -> Node -> Effect Boolean\n\nlookupPrefix :: String -> Node -> Effect (Maybe String)\nlookupPrefix p = map toMaybe <<< _lookupPrefix p\n\nforeign import _lookupPrefix :: String -> Node -> Effect (Nullable String)\n\nlookupNamespaceURI :: String -> Node -> Effect (Maybe String)\nlookupNamespaceURI ns = map toMaybe <<< _lookupNamespaceURI ns\n\nforeign import _lookupNamespaceURI :: String -> Node -> Effect (Nullable String)\n\nforeign import isDefaultNamespace :: String -> Node -> Effect Boolean\n\n-- | Inserts the first node before the second as a child of the third node.\nforeign import insertBefore :: Node -> Node -> Node -> Effect Unit\n\n-- | Appends the first node to the child node list of the second node.\nforeign import appendChild :: Node -> Node -> Effect Unit\n\n-- | Uses the first node as a replacement for the second node in the children\n-- | of the third node.\nforeign import replaceChild :: Node -> Node -> Node -> Effect Unit\n\n-- | Removes the first node from the children of the second node.\nforeign import removeChild :: Node -> Node -> Effect Unit\n", "module Halogen.VDom.Driver\n  ( runUI\n  , module Halogen.Aff.Driver\n  ) where\n\nimport Prelude\n\nimport Data.Foldable (traverse_)\nimport Data.Maybe (Maybe(..))\nimport Data.Newtype (unwrap)\nimport Effect (Effect)\nimport Effect.Aff (Aff)\nimport Effect.Class (liftEffect)\nimport Effect.Ref (Ref)\nimport Effect.Ref as Ref\nimport Effect.Uncurried as EFn\nimport Halogen.Aff.Driver (HalogenIO)\nimport Halogen.Aff.Driver as AD\nimport Halogen.Aff.Driver.State (RenderStateX, unRenderStateX)\nimport Halogen.Component (Component, ComponentSlot(..), ComponentSlotBox)\nimport Halogen.HTML.Core (HTML(..), Prop)\nimport Halogen.Query.Input (Input)\nimport Halogen.VDom as V\nimport Halogen.VDom.DOM.Prop as VP\nimport Halogen.VDom.Thunk (Thunk)\nimport Halogen.VDom.Thunk as Thunk\nimport Unsafe.Reference (unsafeRefEq)\nimport Web.DOM.Document (Document) as DOM\nimport Web.DOM.Element (Element) as DOM\nimport Web.DOM.Node (Node, appendChild, removeChild, parentNode, nextSibling, insertBefore) as DOM\nimport Web.HTML (window) as DOM\nimport Web.HTML.HTMLDocument as HTMLDocument\nimport Web.HTML.HTMLElement (HTMLElement) as DOM\nimport Web.HTML.HTMLElement as HTMLElement\nimport Web.HTML.Window (document) as DOM\n\ntype VHTML action slots =\n  V.VDom (Array (Prop (Input action))) (ComponentSlot slots Aff action)\n\ntype ChildRenderer action slots = ComponentSlotBox slots Aff action -> Effect (RenderStateX RenderState)\n\nnewtype RenderState state action slots output =\n  RenderState\n    { node :: DOM.Node\n    , machine :: V.Step (VHTML action slots) DOM.Node\n    , renderChildRef :: Ref (ChildRenderer action slots)\n    }\n\ntype HTMLThunk slots action =\n  Thunk (HTML (ComponentSlot slots Aff action)) action\n\ntype WidgetState slots action =\n  Maybe (V.Step (HTMLThunk slots action) DOM.Node)\n\nmkSpec\n  :: forall action slots\n   . (Input action -> Effect Unit)\n  -> Ref (ChildRenderer action slots)\n  -> DOM.Document\n  -> V.VDomSpec\n       (Array (VP.Prop (Input action)))\n       (ComponentSlot slots Aff action)\nmkSpec handler renderChildRef document =\n  V.VDomSpec { buildWidget, buildAttributes, document }\n  where\n\n  buildAttributes\n    :: DOM.Element\n    -> V.Machine (Array (VP.Prop (Input action))) Unit\n  buildAttributes = VP.buildProp handler\n\n  buildWidget\n    :: V.VDomSpec\n         (Array (VP.Prop (Input action)))\n         (ComponentSlot slots Aff action)\n    -> V.Machine\n         (ComponentSlot slots Aff action)\n         DOM.Node\n  buildWidget spec = render\n    where\n\n    render :: V.Machine (ComponentSlot slots Aff action) DOM.Node\n    render = EFn.mkEffectFn1 \\slot ->\n      case slot of\n        ComponentSlot cs ->\n          EFn.runEffectFn1 renderComponentSlot cs\n        ThunkSlot t -> do\n          step <- EFn.runEffectFn1 buildThunk t\n          pure $ V.mkStep $ V.Step (V.extract step) (Just step) patch done\n\n    patch\n      :: EFn.EffectFn2 (WidgetState slots action)\n           (ComponentSlot slots Aff action)\n           (V.Step (ComponentSlot slots Aff action) DOM.Node)\n    patch = EFn.mkEffectFn2 \\st slot ->\n      case st of\n        Just step -> case slot of\n          ComponentSlot cs -> do\n            EFn.runEffectFn1 V.halt step\n            EFn.runEffectFn1 renderComponentSlot cs\n          ThunkSlot t -> do\n            step' <- EFn.runEffectFn2 V.step step t\n            pure $ V.mkStep $ V.Step (V.extract step') (Just step') patch done\n        _ -> EFn.runEffectFn1 render slot\n\n    buildThunk :: V.Machine (HTMLThunk slots action) DOM.Node\n    buildThunk = Thunk.buildThunk unwrap spec\n\n    renderComponentSlot\n      :: EFn.EffectFn1\n           (ComponentSlotBox slots Aff action)\n           (V.Step (ComponentSlot slots Aff action) DOM.Node)\n    renderComponentSlot = EFn.mkEffectFn1 \\cs -> do\n      renderChild <- Ref.read renderChildRef\n      rsx <- renderChild cs\n      let node = getNode rsx\n      pure $ V.mkStep $ V.Step node Nothing patch done\n\n  done :: EFn.EffectFn1 (WidgetState slots action) Unit\n  done = EFn.mkEffectFn1 \\st ->\n    case st of\n      Just step -> EFn.runEffectFn1 V.halt step\n      _ -> pure unit\n\n  getNode :: RenderStateX RenderState -> DOM.Node\n  getNode = unRenderStateX (\\(RenderState { node }) -> node)\n\nrunUI\n  :: forall query input output\n   . Component query input output Aff\n  -> input\n  -> DOM.HTMLElement\n  -> Aff (HalogenIO query output Aff)\nrunUI component i element = do\n  document <- liftEffect $ HTMLDocument.toDocument <$> (DOM.document =<< DOM.window)\n  AD.runUI (renderSpec document element) component i\n\nrenderSpec\n  :: DOM.Document\n  -> DOM.HTMLElement\n  -> AD.RenderSpec RenderState\nrenderSpec document container =\n  { render\n  , renderChild: identity\n  , removeChild\n  , dispose: removeChild\n  }\n  where\n  render\n    :: forall state action slots output\n     . (Input action -> Effect Unit)\n    -> (ComponentSlotBox slots Aff action -> Effect (RenderStateX RenderState))\n    -> HTML (ComponentSlot slots Aff action) action\n    -> Maybe (RenderState state action slots output)\n    -> Effect (RenderState state action slots output)\n  render handler child (HTML vdom) =\n    case _ of\n      Nothing -> do\n        renderChildRef <- Ref.new child\n        let spec = mkSpec handler renderChildRef document\n        machine <- EFn.runEffectFn1 (V.buildVDom spec) vdom\n        let node = V.extract machine\n        void $ DOM.appendChild node (HTMLElement.toNode container)\n        pure $ RenderState { machine, node, renderChildRef }\n      Just (RenderState { machine, node, renderChildRef }) -> do\n        Ref.write child renderChildRef\n        parent <- DOM.parentNode node\n        nextSib <- DOM.nextSibling node\n        machine' <- EFn.runEffectFn2 V.step machine vdom\n        let newNode = V.extract machine'\n        when (not unsafeRefEq node newNode) do\n          substInParent newNode nextSib parent\n        pure $ RenderState { machine: machine', node: newNode, renderChildRef }\n\nremoveChild :: forall state action slots output. RenderState state action slots output -> Effect Unit\nremoveChild (RenderState { node }) = do\n  npn <- DOM.parentNode node\n  traverse_ (\\pn -> DOM.removeChild node pn) npn\n\nsubstInParent :: DOM.Node -> Maybe DOM.Node -> Maybe DOM.Node -> Effect Unit\nsubstInParent newNode (Just sib) (Just pn) = void $ DOM.insertBefore newNode sib pn\nsubstInParent newNode Nothing (Just pn) = void $ DOM.appendChild newNode pn\nsubstInParent _ _ _ = pure unit\n", "module Main where\n\nimport Prelude\n\nimport App (logout)\nimport Component.AccountSettings (usetting)\nimport Component.Add (addbmark)\nimport Component.BList (blist)\nimport Component.NList (nlist)\nimport Component.NNote (nnote)\nimport Component.TagCloud (tagcloudcomponent)\nimport Data.Foldable (traverse_)\nimport Effect (Effect)\nimport Effect.Aff (Aff, launchAff)\nimport Effect.Class (liftEffect)\nimport Halogen.Aff as HA\nimport Halogen.VDom.Driver (runUI)\nimport Model (AccountSettings, Bookmark, Note, TagCloudMode, tagCloudModeToF)\nimport Web.DOM.Element (setAttribute)\nimport Web.DOM.ParentNode (QuerySelector(..))\nimport Web.Event.Event (Event, preventDefault)\nimport Web.HTML.HTMLElement (toElement)\n\nlogoutE :: Event -> Effect Unit\nlogoutE e = void <<< launchAff <<< logout =<< preventDefault e\n\nrenderBookmarks :: String -> Array Bookmark -> Effect Unit\nrenderBookmarks renderElSelector bmarks = do\n  HA.runHalogenAff do\n    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \\el -> do\n      void $ runUI (blist bmarks) unit el\n      viewRendered\n\nrenderTagCloud :: String -> TagCloudMode -> Effect Unit\nrenderTagCloud renderElSelector tagCloudMode = do\n  HA.runHalogenAff do\n    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \\el -> do\n      void $ runUI (tagcloudcomponent (tagCloudModeToF tagCloudMode)) unit el\n\nrenderAddForm :: String -> Bookmark -> Effect Unit\nrenderAddForm renderElSelector bmark = do\n  HA.runHalogenAff do\n    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \\el -> do\n      void $ runUI (addbmark bmark) unit el\n      viewRendered\n\nrenderNotes :: String -> Array Note -> Effect Unit\nrenderNotes renderElSelector notes = do\n  HA.runHalogenAff do\n    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \\el -> do\n      void $ runUI (nlist notes) unit el\n      viewRendered\n\nrenderNote :: String -> Note -> Effect Unit\nrenderNote renderElSelector note = do\n  HA.runHalogenAff do\n    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \\el -> do\n      void $ runUI (nnote note) unit el\n      viewRendered\n\nrenderAccountSettings :: String -> AccountSettings -> Effect Unit\nrenderAccountSettings renderElSelector accountSettings = do\n  HA.runHalogenAff do\n    HA.selectElement (QuerySelector renderElSelector) >>= traverse_ \\el -> do\n      void $ runUI (usetting accountSettings) unit el\n      viewRendered\n\nviewRendered :: Aff Unit\nviewRendered = HA.selectElement (QuerySelector \"#content\") >>= traverse_ \\el ->\n  liftEffect $ setAttribute \"view-rendered\" \"\" (toElement el) \n"],
-  "mappings": "y6CAAA,IAAAA,GAAAC,GAAA,CAAAC,GAAAC,KAAA,EAME,SAAUC,EAAQC,EAAS,CACzB,OAAOH,IAAY,UAAY,OAAOC,GAAW,IAAcA,GAAO,QAAUE,EAAQ,EACxF,OAAO,QAAW,YAAc,OAAO,IAAM,OAAOA,CAAO,EAC3DD,EAAO,OAASC,EAAQ,CAC5B,GAAEH,GAAO,UAAY,CAAE,aAEnB,IAAII,EAEJ,SAASC,GAAQ,CACb,OAAOD,EAAa,MAAM,KAAM,SAAS,CAC7C,CAIA,SAASE,EAAgBC,EAAU,CAC/BH,EAAeG,CACnB,CAEA,SAASC,EAAQC,EAAO,CACpB,OACIA,aAAiB,OACjB,OAAO,UAAU,SAAS,KAAKA,CAAK,IAAM,gBAElD,CAEA,SAASC,EAASD,EAAO,CAGrB,OACIA,GAAS,MACT,OAAO,UAAU,SAAS,KAAKA,CAAK,IAAM,iBAElD,CAEA,SAASE,EAAWC,EAAGC,EAAG,CACtB,OAAO,OAAO,UAAU,eAAe,KAAKD,EAAGC,CAAC,CACpD,CAEA,SAASC,EAAcC,EAAK,CACxB,GAAI,OAAO,oBACP,OAAO,OAAO,oBAAoBA,CAAG,EAAE,SAAW,EAElD,IAAIC,EACJ,IAAKA,KAAKD,EACN,GAAIJ,EAAWI,EAAKC,CAAC,EACjB,MAAO,GAGf,MAAO,EAEf,CAEA,SAASC,EAAYR,EAAO,CACxB,OAAOA,IAAU,MACrB,CAEA,SAASS,EAAST,EAAO,CACrB,OACI,OAAOA,GAAU,UACjB,OAAO,UAAU,SAAS,KAAKA,CAAK,IAAM,iBAElD,CAEA,SAASU,EAAOV,EAAO,CACnB,OACIA,aAAiB,MACjB,OAAO,UAAU,SAAS,KAAKA,CAAK,IAAM,eAElD,CAEA,SAASW,EAAIC,EAAKC,EAAI,CAClB,IAAIC,EAAM,CAAC,EACPC,EACAC,EAASJ,EAAI,OACjB,IAAKG,EAAI,EAAGA,EAAIC,EAAQ,EAAED,EACtBD,EAAI,KAAKD,EAAGD,EAAIG,CAAC,EAAGA,CAAC,CAAC,EAE1B,OAAOD,CACX,CAEA,SAASG,EAAOd,EAAGC,EAAG,CAClB,QAASW,KAAKX,EACNF,EAAWE,EAAGW,CAAC,IACfZ,EAAEY,CAAC,EAAIX,EAAEW,CAAC,GAIlB,OAAIb,EAAWE,EAAG,UAAU,IACxBD,EAAE,SAAWC,EAAE,UAGfF,EAAWE,EAAG,SAAS,IACvBD,EAAE,QAAUC,EAAE,SAGXD,CACX,CAEA,SAASe,EAAUlB,EAAOmB,EAAQC,EAAQC,EAAQ,CAC9C,OAAOC,GAAiBtB,EAAOmB,EAAQC,EAAQC,EAAQ,EAAI,EAAE,IAAI,CACrE,CAEA,SAASE,GAAsB,CAE3B,MAAO,CACH,MAAO,GACP,aAAc,CAAC,EACf,YAAa,CAAC,EACd,SAAU,GACV,cAAe,EACf,UAAW,GACX,WAAY,KACZ,aAAc,KACd,cAAe,GACf,gBAAiB,GACjB,IAAK,GACL,gBAAiB,CAAC,EAClB,IAAK,KACL,SAAU,KACV,QAAS,GACT,gBAAiB,EACrB,CACJ,CAEA,SAASC,EAAgBC,EAAG,CACxB,OAAIA,EAAE,KAAO,OACTA,EAAE,IAAMF,EAAoB,GAEzBE,EAAE,GACb,CAEA,IAAIC,EACA,MAAM,UAAU,KAChBA,EAAO,MAAM,UAAU,KAEvBA,EAAO,SAAUC,EAAK,CAClB,IAAIC,EAAI,OAAO,IAAI,EACfC,EAAMD,EAAE,SAAW,EACnBb,EAEJ,IAAKA,EAAI,EAAGA,EAAIc,EAAKd,IACjB,GAAIA,KAAKa,GAAKD,EAAI,KAAK,KAAMC,EAAEb,CAAC,EAAGA,EAAGa,CAAC,EACnC,MAAO,GAIf,MAAO,EACX,EAGJ,SAASE,EAAQL,EAAG,CAChB,IAAIM,EAAQ,KACRC,EAAc,GACdC,EAAaR,EAAE,IAAM,CAAC,MAAMA,EAAE,GAAG,QAAQ,CAAC,EAyB9C,GAxBIQ,IACAF,EAAQP,EAAgBC,CAAC,EACzBO,EAAcN,EAAK,KAAKK,EAAM,gBAAiB,SAAUhB,EAAG,CACxD,OAAOA,GAAK,IAChB,CAAC,EACDkB,EACIF,EAAM,SAAW,GACjB,CAACA,EAAM,OACP,CAACA,EAAM,YACP,CAACA,EAAM,cACP,CAACA,EAAM,gBACP,CAACA,EAAM,iBACP,CAACA,EAAM,WACP,CAACA,EAAM,eACP,CAACA,EAAM,kBACN,CAACA,EAAM,UAAaA,EAAM,UAAYC,GACvCP,EAAE,UACFQ,EACIA,GACAF,EAAM,gBAAkB,GACxBA,EAAM,aAAa,SAAW,GAC9BA,EAAM,UAAY,SAG1B,OAAO,UAAY,MAAQ,CAAC,OAAO,SAASN,CAAC,EAC7CA,EAAE,SAAWQ,MAEb,QAAOA,EAEX,OAAOR,EAAE,QACb,CAEA,SAASS,GAAcH,EAAO,CAC1B,IAAIN,EAAIP,EAAU,GAAG,EACrB,OAAIa,GAAS,KACTd,EAAOO,EAAgBC,CAAC,EAAGM,CAAK,EAEhCP,EAAgBC,CAAC,EAAE,gBAAkB,GAGlCA,CACX,CAIA,IAAIU,GAAoBvC,EAAM,iBAAmB,CAAC,EAC9CwC,GAAmB,GAEvB,SAASC,GAAWC,EAAIC,EAAM,CAC1B,IAAIxB,EACAyB,EACAC,EACAC,EAAsBP,GAAiB,OAiC3C,GA/BK3B,EAAY+B,EAAK,gBAAgB,IAClCD,EAAG,iBAAmBC,EAAK,kBAE1B/B,EAAY+B,EAAK,EAAE,IACpBD,EAAG,GAAKC,EAAK,IAEZ/B,EAAY+B,EAAK,EAAE,IACpBD,EAAG,GAAKC,EAAK,IAEZ/B,EAAY+B,EAAK,EAAE,IACpBD,EAAG,GAAKC,EAAK,IAEZ/B,EAAY+B,EAAK,OAAO,IACzBD,EAAG,QAAUC,EAAK,SAEjB/B,EAAY+B,EAAK,IAAI,IACtBD,EAAG,KAAOC,EAAK,MAEd/B,EAAY+B,EAAK,MAAM,IACxBD,EAAG,OAASC,EAAK,QAEhB/B,EAAY+B,EAAK,OAAO,IACzBD,EAAG,QAAUC,EAAK,SAEjB/B,EAAY+B,EAAK,GAAG,IACrBD,EAAG,IAAMd,EAAgBe,CAAI,GAE5B/B,EAAY+B,EAAK,OAAO,IACzBD,EAAG,QAAUC,EAAK,SAGlBG,EAAsB,EACtB,IAAK3B,EAAI,EAAGA,EAAI2B,EAAqB3B,IACjCyB,EAAOL,GAAiBpB,CAAC,EACzB0B,EAAMF,EAAKC,CAAI,EACVhC,EAAYiC,CAAG,IAChBH,EAAGE,CAAI,EAAIC,GAKvB,OAAOH,CACX,CAGA,SAASK,EAAOC,EAAQ,CACpBP,GAAW,KAAMO,CAAM,EACvB,KAAK,GAAK,IAAI,KAAKA,EAAO,IAAM,KAAOA,EAAO,GAAG,QAAQ,EAAI,GAAG,EAC3D,KAAK,QAAQ,IACd,KAAK,GAAK,IAAI,KAAK,GAAG,GAItBR,KAAqB,KACrBA,GAAmB,GACnBxC,EAAM,aAAa,IAAI,EACvBwC,GAAmB,GAE3B,CAEA,SAASS,GAASvC,EAAK,CACnB,OACIA,aAAeqC,GAAWrC,GAAO,MAAQA,EAAI,kBAAoB,IAEzE,CAEA,SAASwC,GAAKC,EAAK,CAEXnD,EAAM,8BAAgC,IACtC,OAAO,QAAY,KACnB,QAAQ,MAER,QAAQ,KAAK,wBAA0BmD,CAAG,CAElD,CAEA,SAASC,GAAUD,EAAKlC,EAAI,CACxB,IAAIoC,EAAY,GAEhB,OAAOhC,EAAO,UAAY,CAItB,GAHIrB,EAAM,oBAAsB,MAC5BA,EAAM,mBAAmB,KAAMmD,CAAG,EAElCE,EAAW,CACX,IAAIC,EAAO,CAAC,EACRC,EACApC,EACAqC,EACAC,EAAS,UAAU,OACvB,IAAKtC,EAAI,EAAGA,EAAIsC,EAAQtC,IAAK,CAEzB,GADAoC,EAAM,GACF,OAAO,UAAUpC,CAAC,GAAM,SAAU,CAClCoC,GAAO;AAAA,GAAQpC,EAAI,KACnB,IAAKqC,KAAO,UAAU,CAAC,EACflD,EAAW,UAAU,CAAC,EAAGkD,CAAG,IAC5BD,GAAOC,EAAM,KAAO,UAAU,CAAC,EAAEA,CAAG,EAAI,MAGhDD,EAAMA,EAAI,MAAM,EAAG,EAAE,CACzB,MACIA,EAAM,UAAUpC,CAAC,EAErBmC,EAAK,KAAKC,CAAG,CACjB,CACAL,GACIC,EACI;AAAA,aACA,MAAM,UAAU,MAAM,KAAKG,CAAI,EAAE,KAAK,EAAE,EACxC;AAAA,EACA,IAAI,MAAM,EAAE,KACpB,EACAD,EAAY,EAChB,CACA,OAAOpC,EAAG,MAAM,KAAM,SAAS,CACnC,EAAGA,CAAE,CACT,CAEA,IAAIyC,GAAe,CAAC,EAEpB,SAASC,GAAgBC,EAAMT,EAAK,CAC5BnD,EAAM,oBAAsB,MAC5BA,EAAM,mBAAmB4D,EAAMT,CAAG,EAEjCO,GAAaE,CAAI,IAClBV,GAAKC,CAAG,EACRO,GAAaE,CAAI,EAAI,GAE7B,CAEA5D,EAAM,4BAA8B,GACpCA,EAAM,mBAAqB,KAE3B,SAAS6D,GAAWzD,EAAO,CACvB,OACK,OAAO,SAAa,KAAeA,aAAiB,UACrD,OAAO,UAAU,SAAS,KAAKA,CAAK,IAAM,mBAElD,CAEA,SAAS0D,GAAId,EAAQ,CACjB,IAAIJ,EAAMzB,EACV,IAAKA,KAAK6B,EACF1C,EAAW0C,EAAQ7B,CAAC,IACpByB,EAAOI,EAAO7B,CAAC,EACX0C,GAAWjB,CAAI,EACf,KAAKzB,CAAC,EAAIyB,EAEV,KAAK,IAAMzB,CAAC,EAAIyB,GAI5B,KAAK,QAAUI,EAIf,KAAK,+BAAiC,IAAI,QACrC,KAAK,wBAAwB,QAAU,KAAK,cAAc,QACvD,IACA,UAAU,MAClB,CACJ,CAEA,SAASe,GAAaC,EAAcC,EAAa,CAC7C,IAAI/C,EAAMG,EAAO,CAAC,EAAG2C,CAAY,EAC7BpB,EACJ,IAAKA,KAAQqB,EACL3D,EAAW2D,EAAarB,CAAI,IACxBvC,EAAS2D,EAAapB,CAAI,CAAC,GAAKvC,EAAS4D,EAAYrB,CAAI,CAAC,GAC1D1B,EAAI0B,CAAI,EAAI,CAAC,EACbvB,EAAOH,EAAI0B,CAAI,EAAGoB,EAAapB,CAAI,CAAC,EACpCvB,EAAOH,EAAI0B,CAAI,EAAGqB,EAAYrB,CAAI,CAAC,GAC5BqB,EAAYrB,CAAI,GAAK,KAC5B1B,EAAI0B,CAAI,EAAIqB,EAAYrB,CAAI,EAE5B,OAAO1B,EAAI0B,CAAI,GAI3B,IAAKA,KAAQoB,EAEL1D,EAAW0D,EAAcpB,CAAI,GAC7B,CAACtC,EAAW2D,EAAarB,CAAI,GAC7BvC,EAAS2D,EAAapB,CAAI,CAAC,IAG3B1B,EAAI0B,CAAI,EAAIvB,EAAO,CAAC,EAAGH,EAAI0B,CAAI,CAAC,GAGxC,OAAO1B,CACX,CAEA,SAASgD,GAAOlB,EAAQ,CAChBA,GAAU,MACV,KAAK,IAAIA,CAAM,CAEvB,CAEA,IAAImB,GAEA,OAAO,KACPA,GAAO,OAAO,KAEdA,GAAO,SAAUzD,EAAK,CAClB,IAAIS,EACAD,EAAM,CAAC,EACX,IAAKC,KAAKT,EACFJ,EAAWI,EAAKS,CAAC,GACjBD,EAAI,KAAKC,CAAC,EAGlB,OAAOD,CACX,EAGJ,IAAIkD,GAAkB,CAClB,QAAS,gBACT,QAAS,mBACT,SAAU,eACV,QAAS,oBACT,SAAU,sBACV,SAAU,GACd,EAEA,SAASC,GAASb,EAAKc,EAAKC,EAAK,CAC7B,IAAIC,EAAS,KAAK,UAAUhB,CAAG,GAAK,KAAK,UAAU,SACnD,OAAOK,GAAWW,CAAM,EAAIA,EAAO,KAAKF,EAAKC,CAAG,EAAIC,CACxD,CAEA,SAASC,GAASC,EAAQC,EAAcC,EAAW,CAC/C,IAAIC,EAAY,GAAK,KAAK,IAAIH,CAAM,EAChCI,EAAcH,EAAeE,EAAU,OACvCE,EAAOL,GAAU,EACrB,OACKK,EAAQH,EAAY,IAAM,GAAM,KACjC,KAAK,IAAI,GAAI,KAAK,IAAI,EAAGE,CAAW,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,EAC1DD,CAER,CAEA,IAAIG,GACI,yMACJC,GAAwB,6CACxBC,GAAkB,CAAC,EACnBC,GAAuB,CAAC,EAM5B,SAASC,EAAeC,EAAOC,EAAQC,EAASrF,EAAU,CACtD,IAAIsF,EAAOtF,EACP,OAAOA,GAAa,WACpBsF,EAAO,UAAY,CACf,OAAO,KAAKtF,CAAQ,EAAE,CAC1B,GAEAmF,IACAF,GAAqBE,CAAK,EAAIG,GAE9BF,IACAH,GAAqBG,EAAO,CAAC,CAAC,EAAI,UAAY,CAC1C,OAAOb,GAASe,EAAK,MAAM,KAAM,SAAS,EAAGF,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,CACrE,GAEAC,IACAJ,GAAqBI,CAAO,EAAI,UAAY,CACxC,OAAO,KAAK,WAAW,EAAE,QACrBC,EAAK,MAAM,KAAM,SAAS,EAC1BH,CACJ,CACJ,EAER,CAEA,SAASI,GAAuBrF,EAAO,CACnC,OAAIA,EAAM,MAAM,UAAU,EACfA,EAAM,QAAQ,WAAY,EAAE,EAEhCA,EAAM,QAAQ,MAAO,EAAE,CAClC,CAEA,SAASsF,GAAmBnE,EAAQ,CAChC,IAAIoE,EAAQpE,EAAO,MAAMyD,EAAgB,EACrC7D,EACAyE,EAEJ,IAAKzE,EAAI,EAAGyE,EAASD,EAAM,OAAQxE,EAAIyE,EAAQzE,IACvCgE,GAAqBQ,EAAMxE,CAAC,CAAC,EAC7BwE,EAAMxE,CAAC,EAAIgE,GAAqBQ,EAAMxE,CAAC,CAAC,EAExCwE,EAAMxE,CAAC,EAAIsE,GAAuBE,EAAMxE,CAAC,CAAC,EAIlD,OAAO,SAAUmD,EAAK,CAClB,IAAIE,EAAS,GACTrD,EACJ,IAAKA,EAAI,EAAGA,EAAIyE,EAAQzE,IACpBqD,GAAUX,GAAW8B,EAAMxE,CAAC,CAAC,EACvBwE,EAAMxE,CAAC,EAAE,KAAKmD,EAAK/C,CAAM,EACzBoE,EAAMxE,CAAC,EAEjB,OAAOqD,CACX,CACJ,CAGA,SAASqB,GAAahE,EAAGN,EAAQ,CAC7B,OAAKM,EAAE,QAAQ,GAIfN,EAASuE,GAAavE,EAAQM,EAAE,WAAW,CAAC,EAC5CqD,GAAgB3D,CAAM,EAClB2D,GAAgB3D,CAAM,GAAKmE,GAAmBnE,CAAM,EAEjD2D,GAAgB3D,CAAM,EAAEM,CAAC,GAPrBA,EAAE,WAAW,EAAE,YAAY,CAQ1C,CAEA,SAASiE,GAAavE,EAAQC,EAAQ,CAClC,IAAIL,EAAI,EAER,SAAS4E,EAA4B3F,EAAO,CACxC,OAAOoB,EAAO,eAAepB,CAAK,GAAKA,CAC3C,CAGA,IADA6E,GAAsB,UAAY,EAC3B9D,GAAK,GAAK8D,GAAsB,KAAK1D,CAAM,GAC9CA,EAASA,EAAO,QACZ0D,GACAc,CACJ,EACAd,GAAsB,UAAY,EAClC9D,GAAK,EAGT,OAAOI,CACX,CAEA,IAAIyE,EAAwB,CACxB,IAAK,YACL,GAAI,SACJ,EAAG,aACH,GAAI,eACJ,IAAK,sBACL,KAAM,2BACV,EAEA,SAASC,GAAezC,EAAK,CACzB,IAAIjC,EAAS,KAAK,gBAAgBiC,CAAG,EACjC0C,EAAc,KAAK,gBAAgB1C,EAAI,YAAY,CAAC,EAExD,OAAIjC,GAAU,CAAC2E,EACJ3E,GAGX,KAAK,gBAAgBiC,CAAG,EAAI0C,EACvB,MAAMlB,EAAgB,EACtB,IAAI,SAAUmB,EAAK,CAChB,OACIA,IAAQ,QACRA,IAAQ,MACRA,IAAQ,MACRA,IAAQ,OAEDA,EAAI,MAAM,CAAC,EAEfA,CACX,CAAC,EACA,KAAK,EAAE,EAEL,KAAK,gBAAgB3C,CAAG,EACnC,CAEA,IAAI4C,GAAqB,eAEzB,SAASC,IAAc,CACnB,OAAO,KAAK,YAChB,CAEA,IAAIC,GAAiB,KACjBC,GAAgC,UAEpC,SAAShB,GAAQb,EAAQ,CACrB,OAAO,KAAK,SAAS,QAAQ,KAAMA,CAAM,CAC7C,CAEA,IAAI8B,GAAsB,CACtB,OAAQ,QACR,KAAM,SACN,EAAG,gBACH,GAAI,aACJ,EAAG,WACH,GAAI,aACJ,EAAG,UACH,GAAI,WACJ,EAAG,QACH,GAAI,UACJ,EAAG,SACH,GAAI,WACJ,EAAG,UACH,GAAI,YACJ,EAAG,SACH,GAAI,UACR,EAEA,SAASC,GAAa/B,EAAQgC,EAAeC,EAAQC,EAAU,CAC3D,IAAIpC,EAAS,KAAK,cAAcmC,CAAM,EACtC,OAAO9C,GAAWW,CAAM,EAClBA,EAAOE,EAAQgC,EAAeC,EAAQC,CAAQ,EAC9CpC,EAAO,QAAQ,MAAOE,CAAM,CACtC,CAEA,SAASmC,EAAWC,EAAMtC,EAAQ,CAC9B,IAAIjD,EAAS,KAAK,cAAcuF,EAAO,EAAI,SAAW,MAAM,EAC5D,OAAOjD,GAAWtC,CAAM,EAAIA,EAAOiD,CAAM,EAAIjD,EAAO,QAAQ,MAAOiD,CAAM,CAC7E,CAEA,IAAIuC,GAAU,CACV,EAAG,OACH,MAAO,OACP,KAAM,OACN,EAAG,MACH,KAAM,MACN,IAAK,MACL,EAAG,UACH,SAAU,UACV,QAAS,UACT,EAAG,aACH,YAAa,aACb,WAAY,aACZ,IAAK,YACL,WAAY,YACZ,UAAW,YACX,EAAG,OACH,MAAO,OACP,KAAM,OACN,GAAI,cACJ,aAAc,cACd,YAAa,cACb,EAAG,SACH,QAAS,SACT,OAAQ,SACR,EAAG,QACH,OAAQ,QACR,MAAO,QACP,EAAG,UACH,SAAU,UACV,QAAS,UACT,EAAG,SACH,QAAS,SACT,OAAQ,SACR,GAAI,WACJ,UAAW,WACX,SAAU,WACV,GAAI,cACJ,aAAc,cACd,YAAa,cACb,EAAG,OACH,MAAO,OACP,KAAM,OACN,EAAG,UACH,SAAU,UACV,QAAS,UACT,EAAG,OACH,MAAO,OACP,KAAM,MACV,EAEA,SAASC,EAAeC,EAAO,CAC3B,OAAO,OAAOA,GAAU,SAClBF,GAAQE,CAAK,GAAKF,GAAQE,EAAM,YAAY,CAAC,EAC7C,MACV,CAEA,SAASC,EAAqBC,EAAa,CACvC,IAAIC,EAAkB,CAAC,EACnBC,EACAzE,EAEJ,IAAKA,KAAQuE,EACL7G,EAAW6G,EAAavE,CAAI,IAC5ByE,EAAiBL,EAAepE,CAAI,EAChCyE,IACAD,EAAgBC,CAAc,EAAIF,EAAYvE,CAAI,IAK9D,OAAOwE,CACX,CAEA,IAAIE,GAAa,CACb,KAAM,EACN,IAAK,GACL,QAAS,GACT,WAAY,GACZ,UAAW,EACX,KAAM,GACN,YAAa,GACb,OAAQ,GACR,MAAO,EACP,QAAS,EACT,OAAQ,GACR,SAAU,EACV,YAAa,EACb,KAAM,EACN,QAAS,EACT,KAAM,CACV,EAEA,SAASC,GAAoBC,EAAU,CACnC,IAAIP,EAAQ,CAAC,EACTQ,EACJ,IAAKA,KAAKD,EACFlH,EAAWkH,EAAUC,CAAC,GACtBR,EAAM,KAAK,CAAE,KAAMQ,EAAG,SAAUH,GAAWG,CAAC,CAAE,CAAC,EAGvD,OAAAR,EAAM,KAAK,SAAU1G,EAAGC,EAAG,CACvB,OAAOD,EAAE,SAAWC,EAAE,QAC1B,CAAC,EACMyG,CACX,CAEA,IAAIS,GAAS,KACTC,GAAS,OACTC,GAAS,QACTC,GAAS,QACTC,GAAS,aACTC,GAAY,QACZC,GAAY,YACZC,GAAY,gBACZC,GAAY,UACZC,GAAY,UACZC,GAAY,eACZC,GAAgB,MAChBC,GAAc,WACdC,GAAc,qBACdC,GAAmB,0BACnBC,GAAiB,uBAGjBC,GACI,wJACJC,GAAyB,YACzBC,GAAmB,gBACnBC,GAEJA,GAAU,CAAC,EAEX,SAASC,EAAczD,EAAO0D,EAAOC,EAAa,CAC9CH,GAAQxD,CAAK,EAAIxB,GAAWkF,CAAK,EAC3BA,EACA,SAAUE,EAAUC,EAAY,CAC5B,OAAOD,GAAYD,EAAcA,EAAcD,CACnD,CACV,CAEA,SAASI,GAAsB9D,EAAOrC,EAAQ,CAC1C,OAAK1C,EAAWuI,GAASxD,CAAK,EAIvBwD,GAAQxD,CAAK,EAAErC,EAAO,QAASA,EAAO,OAAO,EAHzC,IAAI,OAAOoG,GAAe/D,CAAK,CAAC,CAI/C,CAGA,SAAS+D,GAAeC,EAAG,CACvB,OAAOC,GACHD,EACK,QAAQ,KAAM,EAAE,EAChB,QACG,sCACA,SAAUE,EAASC,EAAIC,EAAIC,EAAIC,EAAI,CAC/B,OAAOH,GAAMC,GAAMC,GAAMC,CAC7B,CACJ,CACR,CACJ,CAEA,SAASL,GAAYD,EAAG,CACpB,OAAOA,EAAE,QAAQ,yBAA0B,MAAM,CACrD,CAEA,SAASO,GAASlF,EAAQ,CACtB,OAAIA,EAAS,EAEF,KAAK,KAAKA,CAAM,GAAK,EAErB,KAAK,MAAMA,CAAM,CAEhC,CAEA,SAASmF,GAAMC,EAAqB,CAChC,IAAIC,EAAgB,CAACD,EACjBE,EAAQ,EAEZ,OAAID,IAAkB,GAAK,SAASA,CAAa,IAC7CC,EAAQJ,GAASG,CAAa,GAG3BC,CACX,CAEA,IAAIC,GAAS,CAAC,EAEd,SAASC,GAAc7E,EAAOnF,EAAU,CACpC,IAAIiB,EACAqE,EAAOtF,EACPiK,EAUJ,IATI,OAAO9E,GAAU,WACjBA,EAAQ,CAACA,CAAK,GAEdxE,EAASX,CAAQ,IACjBsF,EAAO,SAAUpF,EAAOuF,EAAO,CAC3BA,EAAMzF,CAAQ,EAAI2J,GAAMzJ,CAAK,CACjC,GAEJ+J,EAAW9E,EAAM,OACZlE,EAAI,EAAGA,EAAIgJ,EAAUhJ,IACtB8I,GAAO5E,EAAMlE,CAAC,CAAC,EAAIqE,CAE3B,CAEA,SAAS4E,GAAkB/E,EAAOnF,EAAU,CACxCgK,GAAc7E,EAAO,SAAUjF,EAAOuF,EAAO3C,EAAQqC,EAAO,CACxDrC,EAAO,GAAKA,EAAO,IAAM,CAAC,EAC1B9C,EAASE,EAAO4C,EAAO,GAAIA,EAAQqC,CAAK,CAC5C,CAAC,CACL,CAEA,SAASgF,GAAwBhF,EAAOjF,EAAO4C,EAAQ,CAC/C5C,GAAS,MAAQE,EAAW2J,GAAQ5E,CAAK,GACzC4E,GAAO5E,CAAK,EAAEjF,EAAO4C,EAAO,GAAIA,EAAQqC,CAAK,CAErD,CAEA,SAASiF,GAAWC,EAAM,CACtB,OAAQA,EAAO,IAAM,GAAKA,EAAO,MAAQ,GAAMA,EAAO,MAAQ,CAClE,CAEA,IAAIC,GAAO,EACPC,GAAQ,EACRC,GAAO,EACPC,GAAO,EACPC,GAAS,EACTC,GAAS,EACTC,GAAc,EACdC,GAAO,EACPC,GAAU,EAId5F,EAAe,IAAK,EAAG,EAAG,UAAY,CAClC,IAAI6F,EAAI,KAAK,KAAK,EAClB,OAAOA,GAAK,KAAOxG,GAASwG,EAAG,CAAC,EAAI,IAAMA,CAC9C,CAAC,EAED7F,EAAe,EAAG,CAAC,KAAM,CAAC,EAAG,EAAG,UAAY,CACxC,OAAO,KAAK,KAAK,EAAI,GACzB,CAAC,EAEDA,EAAe,EAAG,CAAC,OAAQ,CAAC,EAAG,EAAG,MAAM,EACxCA,EAAe,EAAG,CAAC,QAAS,CAAC,EAAG,EAAG,MAAM,EACzCA,EAAe,EAAG,CAAC,SAAU,EAAG,EAAI,EAAG,EAAG,MAAM,EAIhD0D,EAAc,IAAKR,EAAW,EAC9BQ,EAAc,KAAMf,GAAWJ,EAAM,EACrCmB,EAAc,OAAQX,GAAWN,EAAM,EACvCiB,EAAc,QAASV,GAAWN,EAAM,EACxCgB,EAAc,SAAUV,GAAWN,EAAM,EAEzCoC,GAAc,CAAC,QAAS,QAAQ,EAAGM,EAAI,EACvCN,GAAc,OAAQ,SAAU9J,EAAOuF,EAAO,CAC1CA,EAAM6E,EAAI,EACNpK,EAAM,SAAW,EAAIJ,EAAM,kBAAkBI,CAAK,EAAIyJ,GAAMzJ,CAAK,CACzE,CAAC,EACD8J,GAAc,KAAM,SAAU9J,EAAOuF,EAAO,CACxCA,EAAM6E,EAAI,EAAIxK,EAAM,kBAAkBI,CAAK,CAC/C,CAAC,EACD8J,GAAc,IAAK,SAAU9J,EAAOuF,EAAO,CACvCA,EAAM6E,EAAI,EAAI,SAASpK,EAAO,EAAE,CACpC,CAAC,EAID,SAAS8K,GAAWX,EAAM,CACtB,OAAOD,GAAWC,CAAI,EAAI,IAAM,GACpC,CAIAvK,EAAM,kBAAoB,SAAUI,EAAO,CACvC,OAAOyJ,GAAMzJ,CAAK,GAAKyJ,GAAMzJ,CAAK,EAAI,GAAK,KAAO,IACtD,EAIA,IAAI+K,GAAaC,GAAW,WAAY,EAAI,EAE5C,SAASC,IAAgB,CACrB,OAAOf,GAAW,KAAK,KAAK,CAAC,CACjC,CAEA,SAASc,GAAWE,EAAMC,EAAU,CAChC,OAAO,SAAUvB,EAAO,CACpB,OAAIA,GAAS,MACTwB,GAAM,KAAMF,EAAMtB,CAAK,EACvBhK,EAAM,aAAa,KAAMuL,CAAQ,EAC1B,MAEAE,GAAI,KAAMH,CAAI,CAE7B,CACJ,CAEA,SAASG,GAAInH,EAAKgH,EAAM,CACpB,GAAI,CAAChH,EAAI,QAAQ,EACb,MAAO,KAGX,IAAIoH,EAAIpH,EAAI,GACRqH,EAAQrH,EAAI,OAEhB,OAAQgH,EAAM,CACV,IAAK,eACD,OAAOK,EAAQD,EAAE,mBAAmB,EAAIA,EAAE,gBAAgB,EAC9D,IAAK,UACD,OAAOC,EAAQD,EAAE,cAAc,EAAIA,EAAE,WAAW,EACpD,IAAK,UACD,OAAOC,EAAQD,EAAE,cAAc,EAAIA,EAAE,WAAW,EACpD,IAAK,QACD,OAAOC,EAAQD,EAAE,YAAY,EAAIA,EAAE,SAAS,EAChD,IAAK,OACD,OAAOC,EAAQD,EAAE,WAAW,EAAIA,EAAE,QAAQ,EAC9C,IAAK,MACD,OAAOC,EAAQD,EAAE,UAAU,EAAIA,EAAE,OAAO,EAC5C,IAAK,QACD,OAAOC,EAAQD,EAAE,YAAY,EAAIA,EAAE,SAAS,EAChD,IAAK,WACD,OAAOC,EAAQD,EAAE,eAAe,EAAIA,EAAE,YAAY,EACtD,QACI,MAAO,IACf,CACJ,CAEA,SAASF,GAAMlH,EAAKgH,EAAMtB,EAAO,CAC7B,IAAI0B,EAAGC,EAAOpB,EAAMqB,EAAOC,EAE3B,GAAI,GAACvH,EAAI,QAAQ,GAAK,MAAM0F,CAAK,GAOjC,QAHA0B,EAAIpH,EAAI,GACRqH,EAAQrH,EAAI,OAEJgH,EAAM,CACV,IAAK,eACD,OAAO,KAAMK,EACPD,EAAE,mBAAmB1B,CAAK,EAC1B0B,EAAE,gBAAgB1B,CAAK,GACjC,IAAK,UACD,OAAO,KAAM2B,EAAQD,EAAE,cAAc1B,CAAK,EAAI0B,EAAE,WAAW1B,CAAK,GACpE,IAAK,UACD,OAAO,KAAM2B,EAAQD,EAAE,cAAc1B,CAAK,EAAI0B,EAAE,WAAW1B,CAAK,GACpE,IAAK,QACD,OAAO,KAAM2B,EAAQD,EAAE,YAAY1B,CAAK,EAAI0B,EAAE,SAAS1B,CAAK,GAChE,IAAK,OACD,OAAO,KAAM2B,EAAQD,EAAE,WAAW1B,CAAK,EAAI0B,EAAE,QAAQ1B,CAAK,GAK9D,IAAK,WACD,MACJ,QACI,MACR,CAEAO,EAAOP,EACP4B,EAAQtH,EAAI,MAAM,EAClBuH,EAAOvH,EAAI,KAAK,EAChBuH,EAAOA,IAAS,IAAMD,IAAU,GAAK,CAACtB,GAAWC,CAAI,EAAI,GAAKsB,EACxDF,EACAD,EAAE,eAAenB,EAAMqB,EAAOC,CAAI,EAClCH,EAAE,YAAYnB,EAAMqB,EAAOC,CAAI,EACzC,CAIA,SAASC,GAAU7E,EAAO,CAEtB,OADAA,EAAQD,EAAeC,CAAK,EACxBpD,GAAW,KAAKoD,CAAK,CAAC,EACf,KAAKA,CAAK,EAAE,EAEhB,IACX,CAEA,SAAS8E,GAAU9E,EAAO+C,EAAO,CAC7B,GAAI,OAAO/C,GAAU,SAAU,CAC3BA,EAAQC,EAAqBD,CAAK,EAClC,IAAI+E,EAAczE,GAAoBN,CAAK,EACvC9F,EACA8K,EAAiBD,EAAY,OACjC,IAAK7K,EAAI,EAAGA,EAAI8K,EAAgB9K,IAC5B,KAAK6K,EAAY7K,CAAC,EAAE,IAAI,EAAE8F,EAAM+E,EAAY7K,CAAC,EAAE,IAAI,CAAC,CAE5D,SACI8F,EAAQD,EAAeC,CAAK,EACxBpD,GAAW,KAAKoD,CAAK,CAAC,EACtB,OAAO,KAAKA,CAAK,EAAE+C,CAAK,EAGhC,OAAO,IACX,CAEA,SAASkC,GAAIC,EAAGC,EAAG,CACf,OAASD,EAAIC,EAAKA,GAAKA,CAC3B,CAEA,IAAIC,GAEA,MAAM,UAAU,QAChBA,GAAU,MAAM,UAAU,QAE1BA,GAAU,SAAUC,EAAG,CAEnB,IAAInL,EACJ,IAAKA,EAAI,EAAGA,EAAI,KAAK,OAAQ,EAAEA,EAC3B,GAAI,KAAKA,CAAC,IAAMmL,EACZ,OAAOnL,EAGf,MAAO,EACX,EAGJ,SAASoL,GAAYhC,EAAMqB,EAAO,CAC9B,GAAI,MAAMrB,CAAI,GAAK,MAAMqB,CAAK,EAC1B,MAAO,KAEX,IAAIY,EAAWN,GAAIN,EAAO,EAAE,EAC5B,OAAArB,IAASqB,EAAQY,GAAY,GACtBA,IAAa,EACdlC,GAAWC,CAAI,EACX,GACA,GACJ,GAAOiC,EAAW,EAAK,CACjC,CAIApH,EAAe,IAAK,CAAC,KAAM,CAAC,EAAG,KAAM,UAAY,CAC7C,OAAO,KAAK,MAAM,EAAI,CAC1B,CAAC,EAEDA,EAAe,MAAO,EAAG,EAAG,SAAU7D,EAAQ,CAC1C,OAAO,KAAK,WAAW,EAAE,YAAY,KAAMA,CAAM,CACrD,CAAC,EAED6D,EAAe,OAAQ,EAAG,EAAG,SAAU7D,EAAQ,CAC3C,OAAO,KAAK,WAAW,EAAE,OAAO,KAAMA,CAAM,CAChD,CAAC,EAIDuH,EAAc,IAAKf,GAAWY,EAAsB,EACpDG,EAAc,KAAMf,GAAWJ,EAAM,EACrCmB,EAAc,MAAO,SAAUG,EAAUzH,EAAQ,CAC7C,OAAOA,EAAO,iBAAiByH,CAAQ,CAC3C,CAAC,EACDH,EAAc,OAAQ,SAAUG,EAAUzH,EAAQ,CAC9C,OAAOA,EAAO,YAAYyH,CAAQ,CACtC,CAAC,EAEDiB,GAAc,CAAC,IAAK,IAAI,EAAG,SAAU9J,EAAOuF,EAAO,CAC/CA,EAAM8E,EAAK,EAAIZ,GAAMzJ,CAAK,EAAI,CAClC,CAAC,EAED8J,GAAc,CAAC,MAAO,MAAM,EAAG,SAAU9J,EAAOuF,EAAO3C,EAAQqC,EAAO,CAClE,IAAIuG,EAAQ5I,EAAO,QAAQ,YAAY5C,EAAOiF,EAAOrC,EAAO,OAAO,EAE/D4I,GAAS,KACTjG,EAAM8E,EAAK,EAAImB,EAEfhK,EAAgBoB,CAAM,EAAE,aAAe5C,CAE/C,CAAC,EAID,IAAIqM,GACI,wFAAwF,MACpF,GACJ,EACJC,GACI,kDAAkD,MAAM,GAAG,EAC/DC,GAAmB,gCACnBC,GAA0BlE,GAC1BmE,GAAqBnE,GAEzB,SAASoE,GAAajL,EAAGN,EAAQ,CAC7B,OAAKM,EAKE1B,EAAQ,KAAK,OAAO,EACrB,KAAK,QAAQ0B,EAAE,MAAM,CAAC,EACtB,KAAK,SACA,KAAK,QAAQ,UAAY8K,IAAkB,KAAKpL,CAAM,EACjD,SACA,YACV,EAAEM,EAAE,MAAM,CAAC,EAVN1B,EAAQ,KAAK,OAAO,EACrB,KAAK,QACL,KAAK,QAAQ,UAS3B,CAEA,SAAS4M,GAAkBlL,EAAGN,EAAQ,CAClC,OAAKM,EAKE1B,EAAQ,KAAK,YAAY,EAC1B,KAAK,aAAa0B,EAAE,MAAM,CAAC,EAC3B,KAAK,aACD8K,GAAiB,KAAKpL,CAAM,EAAI,SAAW,YAC/C,EAAEM,EAAE,MAAM,CAAC,EARN1B,EAAQ,KAAK,YAAY,EAC1B,KAAK,aACL,KAAK,aAAa,UAOhC,CAEA,SAAS6M,GAAkBC,EAAW1L,EAAQE,EAAQ,CAClD,IAAIN,EACA+L,EACA5I,EACA6I,EAAMF,EAAU,kBAAkB,EACtC,GAAI,CAAC,KAAK,aAKN,IAHA,KAAK,aAAe,CAAC,EACrB,KAAK,iBAAmB,CAAC,EACzB,KAAK,kBAAoB,CAAC,EACrB9L,EAAI,EAAGA,EAAI,GAAI,EAAEA,EAClBmD,EAAMhD,EAAU,CAAC,IAAMH,CAAC,CAAC,EACzB,KAAK,kBAAkBA,CAAC,EAAI,KAAK,YAC7BmD,EACA,EACJ,EAAE,kBAAkB,EACpB,KAAK,iBAAiBnD,CAAC,EAAI,KAAK,OAAOmD,EAAK,EAAE,EAAE,kBAAkB,EAI1E,OAAI7C,EACIF,IAAW,OACX2L,EAAKb,GAAQ,KAAK,KAAK,kBAAmBc,CAAG,EACtCD,IAAO,GAAKA,EAAK,OAExBA,EAAKb,GAAQ,KAAK,KAAK,iBAAkBc,CAAG,EACrCD,IAAO,GAAKA,EAAK,MAGxB3L,IAAW,OACX2L,EAAKb,GAAQ,KAAK,KAAK,kBAAmBc,CAAG,EACzCD,IAAO,GACAA,GAEXA,EAAKb,GAAQ,KAAK,KAAK,iBAAkBc,CAAG,EACrCD,IAAO,GAAKA,EAAK,QAExBA,EAAKb,GAAQ,KAAK,KAAK,iBAAkBc,CAAG,EACxCD,IAAO,GACAA,GAEXA,EAAKb,GAAQ,KAAK,KAAK,kBAAmBc,CAAG,EACtCD,IAAO,GAAKA,EAAK,MAGpC,CAEA,SAASE,GAAkBH,EAAW1L,EAAQE,EAAQ,CAClD,IAAIN,EAAGmD,EAAKyE,EAEZ,GAAI,KAAK,kBACL,OAAOiE,GAAkB,KAAK,KAAMC,EAAW1L,EAAQE,CAAM,EAYjE,IATK,KAAK,eACN,KAAK,aAAe,CAAC,EACrB,KAAK,iBAAmB,CAAC,EACzB,KAAK,kBAAoB,CAAC,GAMzBN,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAmBrB,GAjBAmD,EAAMhD,EAAU,CAAC,IAAMH,CAAC,CAAC,EACrBM,GAAU,CAAC,KAAK,iBAAiBN,CAAC,IAClC,KAAK,iBAAiBA,CAAC,EAAI,IAAI,OAC3B,IAAM,KAAK,OAAOmD,EAAK,EAAE,EAAE,QAAQ,IAAK,EAAE,EAAI,IAC9C,GACJ,EACA,KAAK,kBAAkBnD,CAAC,EAAI,IAAI,OAC5B,IAAM,KAAK,YAAYmD,EAAK,EAAE,EAAE,QAAQ,IAAK,EAAE,EAAI,IACnD,GACJ,GAEA,CAAC7C,GAAU,CAAC,KAAK,aAAaN,CAAC,IAC/B4H,EACI,IAAM,KAAK,OAAOzE,EAAK,EAAE,EAAI,KAAO,KAAK,YAAYA,EAAK,EAAE,EAChE,KAAK,aAAanD,CAAC,EAAI,IAAI,OAAO4H,EAAM,QAAQ,IAAK,EAAE,EAAG,GAAG,GAI7DtH,GACAF,IAAW,QACX,KAAK,iBAAiBJ,CAAC,EAAE,KAAK8L,CAAS,EAEvC,OAAO9L,EACJ,GACHM,GACAF,IAAW,OACX,KAAK,kBAAkBJ,CAAC,EAAE,KAAK8L,CAAS,EAExC,OAAO9L,EACJ,GAAI,CAACM,GAAU,KAAK,aAAaN,CAAC,EAAE,KAAK8L,CAAS,EACrD,OAAO9L,CAEf,CACJ,CAIA,SAASkM,GAAS/I,EAAK0F,EAAO,CAC1B,GAAI,CAAC1F,EAAI,QAAQ,EAEb,OAAOA,EAGX,GAAI,OAAO0F,GAAU,UACjB,GAAI,QAAQ,KAAKA,CAAK,EAClBA,EAAQH,GAAMG,CAAK,UAEnBA,EAAQ1F,EAAI,WAAW,EAAE,YAAY0F,CAAK,EAEtC,CAACnJ,EAASmJ,CAAK,EACf,OAAO1F,EAKnB,IAAIsH,EAAQ5B,EACR6B,EAAOvH,EAAI,KAAK,EAEpB,OAAAuH,EAAOA,EAAO,GAAKA,EAAO,KAAK,IAAIA,EAAMU,GAAYjI,EAAI,KAAK,EAAGsH,CAAK,CAAC,EACjEtH,EAAI,OACJA,EAAI,GAAG,YAAYsH,EAAOC,CAAI,EAC9BvH,EAAI,GAAG,SAASsH,EAAOC,CAAI,EAC1BvH,CACX,CAEA,SAASgJ,GAAYtD,EAAO,CACxB,OAAIA,GAAS,MACTqD,GAAS,KAAMrD,CAAK,EACpBhK,EAAM,aAAa,KAAM,EAAI,EACtB,MAEAyL,GAAI,KAAM,OAAO,CAEhC,CAEA,SAAS8B,IAAiB,CACtB,OAAOhB,GAAY,KAAK,KAAK,EAAG,KAAK,MAAM,CAAC,CAChD,CAEA,SAASiB,GAAiBvE,EAAU,CAChC,OAAI,KAAK,mBACA3I,EAAW,KAAM,cAAc,GAChCmN,GAAmB,KAAK,IAAI,EAE5BxE,EACO,KAAK,wBAEL,KAAK,oBAGX3I,EAAW,KAAM,mBAAmB,IACrC,KAAK,kBAAoBsM,IAEtB,KAAK,yBAA2B3D,EACjC,KAAK,wBACL,KAAK,kBAEnB,CAEA,SAASyE,GAAYzE,EAAU,CAC3B,OAAI,KAAK,mBACA3I,EAAW,KAAM,cAAc,GAChCmN,GAAmB,KAAK,IAAI,EAE5BxE,EACO,KAAK,mBAEL,KAAK,eAGX3I,EAAW,KAAM,cAAc,IAChC,KAAK,aAAeuM,IAEjB,KAAK,oBAAsB5D,EAC5B,KAAK,mBACL,KAAK,aAEnB,CAEA,SAASwE,IAAqB,CAC1B,SAASE,EAAUpN,GAAGC,GAAG,CACrB,OAAOA,GAAE,OAASD,GAAE,MACxB,CAEA,IAAIqN,EAAc,CAAC,EACfC,EAAa,CAAC,EACdC,EAAc,CAAC,EACf3M,EACAmD,EACAyJ,EACAC,EACJ,IAAK7M,EAAI,EAAGA,EAAI,GAAIA,IAEhBmD,EAAMhD,EAAU,CAAC,IAAMH,CAAC,CAAC,EACzB4M,EAASzE,GAAY,KAAK,YAAYhF,EAAK,EAAE,CAAC,EAC9C0J,EAAQ1E,GAAY,KAAK,OAAOhF,EAAK,EAAE,CAAC,EACxCsJ,EAAY,KAAKG,CAAM,EACvBF,EAAW,KAAKG,CAAK,EACrBF,EAAY,KAAKE,CAAK,EACtBF,EAAY,KAAKC,CAAM,EAI3BH,EAAY,KAAKD,CAAS,EAC1BE,EAAW,KAAKF,CAAS,EACzBG,EAAY,KAAKH,CAAS,EAE1B,KAAK,aAAe,IAAI,OAAO,KAAOG,EAAY,KAAK,GAAG,EAAI,IAAK,GAAG,EACtE,KAAK,kBAAoB,KAAK,aAC9B,KAAK,mBAAqB,IAAI,OAC1B,KAAOD,EAAW,KAAK,GAAG,EAAI,IAC9B,GACJ,EACA,KAAK,wBAA0B,IAAI,OAC/B,KAAOD,EAAY,KAAK,GAAG,EAAI,IAC/B,GACJ,CACJ,CAEA,SAASK,GAAWhD,EAAGpJ,EAAG6J,EAAGwC,EAAGC,EAAG9E,EAAG+E,EAAI,CAGtC,IAAIvC,EAEJ,OAAIZ,EAAI,KAAOA,GAAK,GAEhBY,EAAO,IAAI,KAAKZ,EAAI,IAAKpJ,EAAG6J,EAAGwC,EAAGC,EAAG9E,EAAG+E,CAAE,EACtC,SAASvC,EAAK,YAAY,CAAC,GAC3BA,EAAK,YAAYZ,CAAC,GAGtBY,EAAO,IAAI,KAAKZ,EAAGpJ,EAAG6J,EAAGwC,EAAGC,EAAG9E,EAAG+E,CAAE,EAGjCvC,CACX,CAEA,SAASwC,GAAcpD,EAAG,CACtB,IAAIY,EAAMvI,EAEV,OAAI2H,EAAI,KAAOA,GAAK,GAChB3H,EAAO,MAAM,UAAU,MAAM,KAAK,SAAS,EAE3CA,EAAK,CAAC,EAAI2H,EAAI,IACdY,EAAO,IAAI,KAAK,KAAK,IAAI,MAAM,KAAMvI,CAAI,CAAC,EACtC,SAASuI,EAAK,eAAe,CAAC,GAC9BA,EAAK,eAAeZ,CAAC,GAGzBY,EAAO,IAAI,KAAK,KAAK,IAAI,MAAM,KAAM,SAAS,CAAC,EAG5CA,CACX,CAGA,SAASyC,GAAgB/D,EAAMgE,EAAKC,EAAK,CACrC,IACIC,EAAM,EAAIF,EAAMC,EAEhBE,GAAS,EAAIL,GAAc9D,EAAM,EAAGkE,CAAG,EAAE,UAAU,EAAIF,GAAO,EAElE,MAAO,CAACG,EAAQD,EAAM,CAC1B,CAGA,SAASE,GAAmBpE,EAAMqE,EAAMC,EAASN,EAAKC,EAAK,CACvD,IAAIM,GAAgB,EAAID,EAAUN,GAAO,EACrCQ,EAAaT,GAAgB/D,EAAMgE,EAAKC,CAAG,EAC3CQ,EAAY,EAAI,GAAKJ,EAAO,GAAKE,EAAeC,EAChDE,GACAC,GAEJ,OAAIF,GAAa,GACbC,GAAU1E,EAAO,EACjB2E,GAAehE,GAAW+D,EAAO,EAAID,GAC9BA,EAAY9D,GAAWX,CAAI,GAClC0E,GAAU1E,EAAO,EACjB2E,GAAeF,EAAY9D,GAAWX,CAAI,IAE1C0E,GAAU1E,EACV2E,GAAeF,GAGZ,CACH,KAAMC,GACN,UAAWC,EACf,CACJ,CAEA,SAASC,GAAW7K,EAAKiK,EAAKC,EAAK,CAC/B,IAAIO,EAAaT,GAAgBhK,EAAI,KAAK,EAAGiK,EAAKC,CAAG,EACjDI,EAAO,KAAK,OAAOtK,EAAI,UAAU,EAAIyK,EAAa,GAAK,CAAC,EAAI,EAC5DK,EACAH,EAEJ,OAAIL,EAAO,GACPK,EAAU3K,EAAI,KAAK,EAAI,EACvB8K,EAAUR,EAAOS,GAAYJ,EAASV,EAAKC,CAAG,GACvCI,EAAOS,GAAY/K,EAAI,KAAK,EAAGiK,EAAKC,CAAG,GAC9CY,EAAUR,EAAOS,GAAY/K,EAAI,KAAK,EAAGiK,EAAKC,CAAG,EACjDS,EAAU3K,EAAI,KAAK,EAAI,IAEvB2K,EAAU3K,EAAI,KAAK,EACnB8K,EAAUR,GAGP,CACH,KAAMQ,EACN,KAAMH,CACV,CACJ,CAEA,SAASI,GAAY9E,EAAMgE,EAAKC,EAAK,CACjC,IAAIO,EAAaT,GAAgB/D,EAAMgE,EAAKC,CAAG,EAC3Cc,EAAiBhB,GAAgB/D,EAAO,EAAGgE,EAAKC,CAAG,EACvD,OAAQtD,GAAWX,CAAI,EAAIwE,EAAaO,GAAkB,CAC9D,CAIAlK,EAAe,IAAK,CAAC,KAAM,CAAC,EAAG,KAAM,MAAM,EAC3CA,EAAe,IAAK,CAAC,KAAM,CAAC,EAAG,KAAM,SAAS,EAI9C0D,EAAc,IAAKf,GAAWY,EAAsB,EACpDG,EAAc,KAAMf,GAAWJ,EAAM,EACrCmB,EAAc,IAAKf,GAAWY,EAAsB,EACpDG,EAAc,KAAMf,GAAWJ,EAAM,EAErCyC,GACI,CAAC,IAAK,KAAM,IAAK,IAAI,EACrB,SAAUhK,EAAOwO,EAAM5L,EAAQqC,EAAO,CAClCuJ,EAAKvJ,EAAM,OAAO,EAAG,CAAC,CAAC,EAAIwE,GAAMzJ,CAAK,CAC1C,CACJ,EAMA,SAASmP,GAAWjL,EAAK,CACrB,OAAO6K,GAAW7K,EAAK,KAAK,MAAM,IAAK,KAAK,MAAM,GAAG,EAAE,IAC3D,CAEA,IAAIkL,GAAoB,CACpB,IAAK,EACL,IAAK,CACT,EAEA,SAASC,IAAuB,CAC5B,OAAO,KAAK,MAAM,GACtB,CAEA,SAASC,IAAuB,CAC5B,OAAO,KAAK,MAAM,GACtB,CAIA,SAASC,GAAWvP,EAAO,CACvB,IAAIwO,EAAO,KAAK,WAAW,EAAE,KAAK,IAAI,EACtC,OAAOxO,GAAS,KAAOwO,EAAO,KAAK,KAAKxO,EAAQwO,GAAQ,EAAG,GAAG,CAClE,CAEA,SAASgB,GAAcxP,EAAO,CAC1B,IAAIwO,EAAOO,GAAW,KAAM,EAAG,CAAC,EAAE,KAClC,OAAO/O,GAAS,KAAOwO,EAAO,KAAK,KAAKxO,EAAQwO,GAAQ,EAAG,GAAG,CAClE,CAIAxJ,EAAe,IAAK,EAAG,KAAM,KAAK,EAElCA,EAAe,KAAM,EAAG,EAAG,SAAU7D,EAAQ,CACzC,OAAO,KAAK,WAAW,EAAE,YAAY,KAAMA,CAAM,CACrD,CAAC,EAED6D,EAAe,MAAO,EAAG,EAAG,SAAU7D,EAAQ,CAC1C,OAAO,KAAK,WAAW,EAAE,cAAc,KAAMA,CAAM,CACvD,CAAC,EAED6D,EAAe,OAAQ,EAAG,EAAG,SAAU7D,EAAQ,CAC3C,OAAO,KAAK,WAAW,EAAE,SAAS,KAAMA,CAAM,CAClD,CAAC,EAED6D,EAAe,IAAK,EAAG,EAAG,SAAS,EACnCA,EAAe,IAAK,EAAG,EAAG,YAAY,EAItC0D,EAAc,IAAKf,EAAS,EAC5Be,EAAc,IAAKf,EAAS,EAC5Be,EAAc,IAAKf,EAAS,EAC5Be,EAAc,KAAM,SAAUG,EAAUzH,EAAQ,CAC5C,OAAOA,EAAO,iBAAiByH,CAAQ,CAC3C,CAAC,EACDH,EAAc,MAAO,SAAUG,EAAUzH,EAAQ,CAC7C,OAAOA,EAAO,mBAAmByH,CAAQ,CAC7C,CAAC,EACDH,EAAc,OAAQ,SAAUG,EAAUzH,EAAQ,CAC9C,OAAOA,EAAO,cAAcyH,CAAQ,CACxC,CAAC,EAEDmB,GAAkB,CAAC,KAAM,MAAO,MAAM,EAAG,SAAUhK,EAAOwO,EAAM5L,EAAQqC,EAAO,CAC3E,IAAIwJ,EAAU7L,EAAO,QAAQ,cAAc5C,EAAOiF,EAAOrC,EAAO,OAAO,EAEnE6L,GAAW,KACXD,EAAK,EAAIC,EAETjN,EAAgBoB,CAAM,EAAE,eAAiB5C,CAEjD,CAAC,EAEDgK,GAAkB,CAAC,IAAK,IAAK,GAAG,EAAG,SAAUhK,EAAOwO,EAAM5L,EAAQqC,EAAO,CACrEuJ,EAAKvJ,CAAK,EAAIwE,GAAMzJ,CAAK,CAC7B,CAAC,EAID,SAASyP,GAAazP,EAAOoB,EAAQ,CACjC,OAAI,OAAOpB,GAAU,SACVA,EAGN,MAAMA,CAAK,GAIhBA,EAAQoB,EAAO,cAAcpB,CAAK,EAC9B,OAAOA,GAAU,SACVA,EAGJ,MARI,SAASA,EAAO,EAAE,CASjC,CAEA,SAAS0P,GAAgB1P,EAAOoB,EAAQ,CACpC,OAAI,OAAOpB,GAAU,SACVoB,EAAO,cAAcpB,CAAK,EAAI,GAAK,EAEvC,MAAMA,CAAK,EAAI,KAAOA,CACjC,CAGA,SAAS2P,GAAcC,EAAI7D,EAAG,CAC1B,OAAO6D,EAAG,MAAM7D,EAAG,CAAC,EAAE,OAAO6D,EAAG,MAAM,EAAG7D,CAAC,CAAC,CAC/C,CAEA,IAAI8D,GACI,2DAA2D,MAAM,GAAG,EACxEC,GAA6B,8BAA8B,MAAM,GAAG,EACpEC,GAA2B,uBAAuB,MAAM,GAAG,EAC3DC,GAAuB1H,GACvB2H,GAA4B3H,GAC5B4H,GAA0B5H,GAE9B,SAAS6H,GAAe1O,EAAGN,EAAQ,CAC/B,IAAIiP,EAAWrQ,EAAQ,KAAK,SAAS,EAC/B,KAAK,UACL,KAAK,UACD0B,GAAKA,IAAM,IAAQ,KAAK,UAAU,SAAS,KAAKN,CAAM,EAChD,SACA,YACV,EACN,OAAOM,IAAM,GACPkO,GAAcS,EAAU,KAAK,MAAM,GAAG,EACtC3O,EACE2O,EAAS3O,EAAE,IAAI,CAAC,EAChB2O,CACZ,CAEA,SAASC,GAAoB5O,EAAG,CAC5B,OAAOA,IAAM,GACPkO,GAAc,KAAK,eAAgB,KAAK,MAAM,GAAG,EACjDlO,EACE,KAAK,eAAeA,EAAE,IAAI,CAAC,EAC3B,KAAK,cACjB,CAEA,SAAS6O,GAAkB7O,EAAG,CAC1B,OAAOA,IAAM,GACPkO,GAAc,KAAK,aAAc,KAAK,MAAM,GAAG,EAC/ClO,EACE,KAAK,aAAaA,EAAE,IAAI,CAAC,EACzB,KAAK,YACjB,CAEA,SAAS8O,GAAoBC,EAAarP,EAAQE,EAAQ,CACtD,IAAIN,EACA+L,EACA5I,EACA6I,EAAMyD,EAAY,kBAAkB,EACxC,GAAI,CAAC,KAAK,eAKN,IAJA,KAAK,eAAiB,CAAC,EACvB,KAAK,oBAAsB,CAAC,EAC5B,KAAK,kBAAoB,CAAC,EAErBzP,EAAI,EAAGA,EAAI,EAAG,EAAEA,EACjBmD,EAAMhD,EAAU,CAAC,IAAM,CAAC,CAAC,EAAE,IAAIH,CAAC,EAChC,KAAK,kBAAkBA,CAAC,EAAI,KAAK,YAC7BmD,EACA,EACJ,EAAE,kBAAkB,EACpB,KAAK,oBAAoBnD,CAAC,EAAI,KAAK,cAC/BmD,EACA,EACJ,EAAE,kBAAkB,EACpB,KAAK,eAAenD,CAAC,EAAI,KAAK,SAASmD,EAAK,EAAE,EAAE,kBAAkB,EAI1E,OAAI7C,EACIF,IAAW,QACX2L,EAAKb,GAAQ,KAAK,KAAK,eAAgBc,CAAG,EACnCD,IAAO,GAAKA,EAAK,MACjB3L,IAAW,OAClB2L,EAAKb,GAAQ,KAAK,KAAK,oBAAqBc,CAAG,EACxCD,IAAO,GAAKA,EAAK,OAExBA,EAAKb,GAAQ,KAAK,KAAK,kBAAmBc,CAAG,EACtCD,IAAO,GAAKA,EAAK,MAGxB3L,IAAW,QACX2L,EAAKb,GAAQ,KAAK,KAAK,eAAgBc,CAAG,EACtCD,IAAO,KAGXA,EAAKb,GAAQ,KAAK,KAAK,oBAAqBc,CAAG,EAC3CD,IAAO,IACAA,GAEXA,EAAKb,GAAQ,KAAK,KAAK,kBAAmBc,CAAG,EACtCD,IAAO,GAAKA,EAAK,OACjB3L,IAAW,OAClB2L,EAAKb,GAAQ,KAAK,KAAK,oBAAqBc,CAAG,EAC3CD,IAAO,KAGXA,EAAKb,GAAQ,KAAK,KAAK,eAAgBc,CAAG,EACtCD,IAAO,IACAA,GAEXA,EAAKb,GAAQ,KAAK,KAAK,kBAAmBc,CAAG,EACtCD,IAAO,GAAKA,EAAK,QAExBA,EAAKb,GAAQ,KAAK,KAAK,kBAAmBc,CAAG,EACzCD,IAAO,KAGXA,EAAKb,GAAQ,KAAK,KAAK,eAAgBc,CAAG,EACtCD,IAAO,IACAA,GAEXA,EAAKb,GAAQ,KAAK,KAAK,oBAAqBc,CAAG,EACxCD,IAAO,GAAKA,EAAK,MAGpC,CAEA,SAAS2D,GAAoBD,EAAarP,EAAQE,EAAQ,CACtD,IAAIN,EAAGmD,EAAKyE,EAEZ,GAAI,KAAK,oBACL,OAAO4H,GAAoB,KAAK,KAAMC,EAAarP,EAAQE,CAAM,EAUrE,IAPK,KAAK,iBACN,KAAK,eAAiB,CAAC,EACvB,KAAK,kBAAoB,CAAC,EAC1B,KAAK,oBAAsB,CAAC,EAC5B,KAAK,mBAAqB,CAAC,GAG1BN,EAAI,EAAGA,EAAI,EAAGA,IAAK,CA6BpB,GA1BAmD,EAAMhD,EAAU,CAAC,IAAM,CAAC,CAAC,EAAE,IAAIH,CAAC,EAC5BM,GAAU,CAAC,KAAK,mBAAmBN,CAAC,IACpC,KAAK,mBAAmBA,CAAC,EAAI,IAAI,OAC7B,IAAM,KAAK,SAASmD,EAAK,EAAE,EAAE,QAAQ,IAAK,MAAM,EAAI,IACpD,GACJ,EACA,KAAK,oBAAoBnD,CAAC,EAAI,IAAI,OAC9B,IAAM,KAAK,cAAcmD,EAAK,EAAE,EAAE,QAAQ,IAAK,MAAM,EAAI,IACzD,GACJ,EACA,KAAK,kBAAkBnD,CAAC,EAAI,IAAI,OAC5B,IAAM,KAAK,YAAYmD,EAAK,EAAE,EAAE,QAAQ,IAAK,MAAM,EAAI,IACvD,GACJ,GAEC,KAAK,eAAenD,CAAC,IACtB4H,EACI,IACA,KAAK,SAASzE,EAAK,EAAE,EACrB,KACA,KAAK,cAAcA,EAAK,EAAE,EAC1B,KACA,KAAK,YAAYA,EAAK,EAAE,EAC5B,KAAK,eAAenD,CAAC,EAAI,IAAI,OAAO4H,EAAM,QAAQ,IAAK,EAAE,EAAG,GAAG,GAI/DtH,GACAF,IAAW,QACX,KAAK,mBAAmBJ,CAAC,EAAE,KAAKyP,CAAW,EAE3C,OAAOzP,EACJ,GACHM,GACAF,IAAW,OACX,KAAK,oBAAoBJ,CAAC,EAAE,KAAKyP,CAAW,EAE5C,OAAOzP,EACJ,GACHM,GACAF,IAAW,MACX,KAAK,kBAAkBJ,CAAC,EAAE,KAAKyP,CAAW,EAE1C,OAAOzP,EACJ,GAAI,CAACM,GAAU,KAAK,eAAeN,CAAC,EAAE,KAAKyP,CAAW,EACzD,OAAOzP,CAEf,CACJ,CAIA,SAAS2P,EAAgB1Q,EAAO,CAC5B,GAAI,CAAC,KAAK,QAAQ,EACd,OAAOA,GAAS,KAAO,KAAO,IAGlC,IAAI2Q,EAAMtF,GAAI,KAAM,KAAK,EACzB,OAAIrL,GAAS,MACTA,EAAQyP,GAAazP,EAAO,KAAK,WAAW,CAAC,EACtC,KAAK,IAAIA,EAAQ2Q,EAAK,GAAG,GAEzBA,CAEf,CAEA,SAASC,EAAsB5Q,EAAO,CAClC,GAAI,CAAC,KAAK,QAAQ,EACd,OAAOA,GAAS,KAAO,KAAO,IAElC,IAAIyO,GAAW,KAAK,IAAI,EAAI,EAAI,KAAK,WAAW,EAAE,MAAM,KAAO,EAC/D,OAAOzO,GAAS,KAAOyO,EAAU,KAAK,IAAIzO,EAAQyO,EAAS,GAAG,CAClE,CAEA,SAASoC,GAAmB7Q,EAAO,CAC/B,GAAI,CAAC,KAAK,QAAQ,EACd,OAAOA,GAAS,KAAO,KAAO,IAOlC,GAAIA,GAAS,KAAM,CACf,IAAIyO,EAAUiB,GAAgB1P,EAAO,KAAK,WAAW,CAAC,EACtD,OAAO,KAAK,IAAI,KAAK,IAAI,EAAI,EAAIyO,EAAUA,EAAU,CAAC,CAC1D,KACI,QAAO,KAAK,IAAI,GAAK,CAE7B,CAEA,SAASqC,GAAcjI,EAAU,CAC7B,OAAI,KAAK,qBACA3I,EAAW,KAAM,gBAAgB,GAClC6Q,GAAqB,KAAK,IAAI,EAE9BlI,EACO,KAAK,qBAEL,KAAK,iBAGX3I,EAAW,KAAM,gBAAgB,IAClC,KAAK,eAAiB8P,IAEnB,KAAK,sBAAwBnH,EAC9B,KAAK,qBACL,KAAK,eAEnB,CAEA,SAASmI,GAAmBnI,EAAU,CAClC,OAAI,KAAK,qBACA3I,EAAW,KAAM,gBAAgB,GAClC6Q,GAAqB,KAAK,IAAI,EAE9BlI,EACO,KAAK,0BAEL,KAAK,sBAGX3I,EAAW,KAAM,qBAAqB,IACvC,KAAK,oBAAsB+P,IAExB,KAAK,2BAA6BpH,EACnC,KAAK,0BACL,KAAK,oBAEnB,CAEA,SAASoI,GAAiBpI,EAAU,CAChC,OAAI,KAAK,qBACA3I,EAAW,KAAM,gBAAgB,GAClC6Q,GAAqB,KAAK,IAAI,EAE9BlI,EACO,KAAK,wBAEL,KAAK,oBAGX3I,EAAW,KAAM,mBAAmB,IACrC,KAAK,kBAAoBgQ,IAEtB,KAAK,yBAA2BrH,EACjC,KAAK,wBACL,KAAK,kBAEnB,CAEA,SAASkI,IAAuB,CAC5B,SAASxD,EAAUpN,GAAGC,GAAG,CACrB,OAAOA,GAAE,OAASD,GAAE,MACxB,CAEA,IAAI+Q,EAAY,CAAC,EACb1D,EAAc,CAAC,EACfC,EAAa,CAAC,EACdC,EAAc,CAAC,EACf3M,EACAmD,EACAiN,EACAC,GACAC,GACJ,IAAKtQ,EAAI,EAAGA,EAAI,EAAGA,IAEfmD,EAAMhD,EAAU,CAAC,IAAM,CAAC,CAAC,EAAE,IAAIH,CAAC,EAChCoQ,EAAOjI,GAAY,KAAK,YAAYhF,EAAK,EAAE,CAAC,EAC5CkN,GAASlI,GAAY,KAAK,cAAchF,EAAK,EAAE,CAAC,EAChDmN,GAAQnI,GAAY,KAAK,SAAShF,EAAK,EAAE,CAAC,EAC1CgN,EAAU,KAAKC,CAAI,EACnB3D,EAAY,KAAK4D,EAAM,EACvB3D,EAAW,KAAK4D,EAAK,EACrB3D,EAAY,KAAKyD,CAAI,EACrBzD,EAAY,KAAK0D,EAAM,EACvB1D,EAAY,KAAK2D,EAAK,EAI1BH,EAAU,KAAK3D,CAAS,EACxBC,EAAY,KAAKD,CAAS,EAC1BE,EAAW,KAAKF,CAAS,EACzBG,EAAY,KAAKH,CAAS,EAE1B,KAAK,eAAiB,IAAI,OAAO,KAAOG,EAAY,KAAK,GAAG,EAAI,IAAK,GAAG,EACxE,KAAK,oBAAsB,KAAK,eAChC,KAAK,kBAAoB,KAAK,eAE9B,KAAK,qBAAuB,IAAI,OAC5B,KAAOD,EAAW,KAAK,GAAG,EAAI,IAC9B,GACJ,EACA,KAAK,0BAA4B,IAAI,OACjC,KAAOD,EAAY,KAAK,GAAG,EAAI,IAC/B,GACJ,EACA,KAAK,wBAA0B,IAAI,OAC/B,KAAO0D,EAAU,KAAK,GAAG,EAAI,IAC7B,GACJ,CACJ,CAIA,SAASI,IAAU,CACf,OAAO,KAAK,MAAM,EAAI,IAAM,EAChC,CAEA,SAASC,IAAU,CACf,OAAO,KAAK,MAAM,GAAK,EAC3B,CAEAvM,EAAe,IAAK,CAAC,KAAM,CAAC,EAAG,EAAG,MAAM,EACxCA,EAAe,IAAK,CAAC,KAAM,CAAC,EAAG,EAAGsM,EAAO,EACzCtM,EAAe,IAAK,CAAC,KAAM,CAAC,EAAG,EAAGuM,EAAO,EAEzCvM,EAAe,MAAO,EAAG,EAAG,UAAY,CACpC,MAAO,GAAKsM,GAAQ,MAAM,IAAI,EAAIjN,GAAS,KAAK,QAAQ,EAAG,CAAC,CAChE,CAAC,EAEDW,EAAe,QAAS,EAAG,EAAG,UAAY,CACtC,MACI,GACAsM,GAAQ,MAAM,IAAI,EAClBjN,GAAS,KAAK,QAAQ,EAAG,CAAC,EAC1BA,GAAS,KAAK,QAAQ,EAAG,CAAC,CAElC,CAAC,EAEDW,EAAe,MAAO,EAAG,EAAG,UAAY,CACpC,MAAO,GAAK,KAAK,MAAM,EAAIX,GAAS,KAAK,QAAQ,EAAG,CAAC,CACzD,CAAC,EAEDW,EAAe,QAAS,EAAG,EAAG,UAAY,CACtC,MACI,GACA,KAAK,MAAM,EACXX,GAAS,KAAK,QAAQ,EAAG,CAAC,EAC1BA,GAAS,KAAK,QAAQ,EAAG,CAAC,CAElC,CAAC,EAED,SAASmN,GAASvM,EAAOwM,EAAW,CAChCzM,EAAeC,EAAO,EAAG,EAAG,UAAY,CACpC,OAAO,KAAK,WAAW,EAAE,SACrB,KAAK,MAAM,EACX,KAAK,QAAQ,EACbwM,CACJ,CACJ,CAAC,CACL,CAEAD,GAAS,IAAK,EAAI,EAClBA,GAAS,IAAK,EAAK,EAInB,SAASE,GAAc7I,EAAUzH,EAAQ,CACrC,OAAOA,EAAO,cAClB,CAEAsH,EAAc,IAAKgJ,EAAa,EAChChJ,EAAc,IAAKgJ,EAAa,EAChChJ,EAAc,IAAKf,GAAWa,EAAgB,EAC9CE,EAAc,IAAKf,GAAWY,EAAsB,EACpDG,EAAc,IAAKf,GAAWY,EAAsB,EACpDG,EAAc,KAAMf,GAAWJ,EAAM,EACrCmB,EAAc,KAAMf,GAAWJ,EAAM,EACrCmB,EAAc,KAAMf,GAAWJ,EAAM,EAErCmB,EAAc,MAAOd,EAAS,EAC9Bc,EAAc,QAASb,EAAS,EAChCa,EAAc,MAAOd,EAAS,EAC9Bc,EAAc,QAASb,EAAS,EAEhCiC,GAAc,CAAC,IAAK,IAAI,EAAGS,EAAI,EAC/BT,GAAc,CAAC,IAAK,IAAI,EAAG,SAAU9J,EAAOuF,EAAO3C,EAAQ,CACvD,IAAI+O,EAASlI,GAAMzJ,CAAK,EACxBuF,EAAMgF,EAAI,EAAIoH,IAAW,GAAK,EAAIA,CACtC,CAAC,EACD7H,GAAc,CAAC,IAAK,GAAG,EAAG,SAAU9J,EAAOuF,EAAO3C,EAAQ,CACtDA,EAAO,MAAQA,EAAO,QAAQ,KAAK5C,CAAK,EACxC4C,EAAO,UAAY5C,CACvB,CAAC,EACD8J,GAAc,CAAC,IAAK,IAAI,EAAG,SAAU9J,EAAOuF,EAAO3C,EAAQ,CACvD2C,EAAMgF,EAAI,EAAId,GAAMzJ,CAAK,EACzBwB,EAAgBoB,CAAM,EAAE,QAAU,EACtC,CAAC,EACDkH,GAAc,MAAO,SAAU9J,EAAOuF,EAAO3C,EAAQ,CACjD,IAAIgP,EAAM5R,EAAM,OAAS,EACzBuF,EAAMgF,EAAI,EAAId,GAAMzJ,EAAM,OAAO,EAAG4R,CAAG,CAAC,EACxCrM,EAAMiF,EAAM,EAAIf,GAAMzJ,EAAM,OAAO4R,CAAG,CAAC,EACvCpQ,EAAgBoB,CAAM,EAAE,QAAU,EACtC,CAAC,EACDkH,GAAc,QAAS,SAAU9J,EAAOuF,EAAO3C,EAAQ,CACnD,IAAIiP,EAAO7R,EAAM,OAAS,EACtB8R,EAAO9R,EAAM,OAAS,EAC1BuF,EAAMgF,EAAI,EAAId,GAAMzJ,EAAM,OAAO,EAAG6R,CAAI,CAAC,EACzCtM,EAAMiF,EAAM,EAAIf,GAAMzJ,EAAM,OAAO6R,EAAM,CAAC,CAAC,EAC3CtM,EAAMkF,EAAM,EAAIhB,GAAMzJ,EAAM,OAAO8R,CAAI,CAAC,EACxCtQ,EAAgBoB,CAAM,EAAE,QAAU,EACtC,CAAC,EACDkH,GAAc,MAAO,SAAU9J,EAAOuF,EAAO3C,EAAQ,CACjD,IAAIgP,EAAM5R,EAAM,OAAS,EACzBuF,EAAMgF,EAAI,EAAId,GAAMzJ,EAAM,OAAO,EAAG4R,CAAG,CAAC,EACxCrM,EAAMiF,EAAM,EAAIf,GAAMzJ,EAAM,OAAO4R,CAAG,CAAC,CAC3C,CAAC,EACD9H,GAAc,QAAS,SAAU9J,EAAOuF,EAAO3C,EAAQ,CACnD,IAAIiP,EAAO7R,EAAM,OAAS,EACtB8R,EAAO9R,EAAM,OAAS,EAC1BuF,EAAMgF,EAAI,EAAId,GAAMzJ,EAAM,OAAO,EAAG6R,CAAI,CAAC,EACzCtM,EAAMiF,EAAM,EAAIf,GAAMzJ,EAAM,OAAO6R,EAAM,CAAC,CAAC,EAC3CtM,EAAMkF,EAAM,EAAIhB,GAAMzJ,EAAM,OAAO8R,CAAI,CAAC,CAC5C,CAAC,EAID,SAASC,GAAW/R,EAAO,CAGvB,OAAQA,EAAQ,IAAI,YAAY,EAAE,OAAO,CAAC,IAAM,GACpD,CAEA,IAAIgS,GAA6B,gBAK7BC,GAAajH,GAAW,QAAS,EAAI,EAEzC,SAASkH,GAAeC,EAAOC,EAASC,EAAS,CAC7C,OAAIF,EAAQ,GACDE,EAAU,KAAO,KAEjBA,EAAU,KAAO,IAEhC,CAEA,IAAIC,GAAa,CACb,SAAUtO,GACV,eAAgB4B,EAChB,YAAaI,GACb,QAASE,GACT,uBAAwBC,GACxB,aAAcC,GAEd,OAAQiG,GACR,YAAaC,GAEb,KAAM8C,GAEN,SAAUS,GACV,YAAaE,GACb,cAAeD,GAEf,cAAekC,EACnB,EAGIO,GAAU,CAAC,EACXC,GAAiB,CAAC,EAClBC,GAEJ,SAASC,GAAaC,EAAMC,EAAM,CAC9B,IAAI7R,EACA8R,EAAO,KAAK,IAAIF,EAAK,OAAQC,EAAK,MAAM,EAC5C,IAAK7R,EAAI,EAAGA,EAAI8R,EAAM9R,GAAK,EACvB,GAAI4R,EAAK5R,CAAC,IAAM6R,EAAK7R,CAAC,EAClB,OAAOA,EAGf,OAAO8R,CACX,CAEA,SAASC,GAAgB1P,EAAK,CAC1B,OAAOA,GAAMA,EAAI,YAAY,EAAE,QAAQ,IAAK,GAAG,CACnD,CAKA,SAAS2P,GAAaC,EAAO,CAOzB,QANIjS,EAAI,EACJkS,EACAC,EACA9R,EACA+R,EAEGpS,EAAIiS,EAAM,QAAQ,CAKrB,IAJAG,EAAQL,GAAgBE,EAAMjS,CAAC,CAAC,EAAE,MAAM,GAAG,EAC3CkS,EAAIE,EAAM,OACVD,EAAOJ,GAAgBE,EAAMjS,EAAI,CAAC,CAAC,EACnCmS,EAAOA,EAAOA,EAAK,MAAM,GAAG,EAAI,KACzBD,EAAI,GAAG,CAEV,GADA7R,EAASgS,GAAWD,EAAM,MAAM,EAAGF,CAAC,EAAE,KAAK,GAAG,CAAC,EAC3C7R,EACA,OAAOA,EAEX,GACI8R,GACAA,EAAK,QAAUD,GACfP,GAAaS,EAAOD,CAAI,GAAKD,EAAI,EAGjC,MAEJA,GACJ,CACAlS,GACJ,CACA,OAAO0R,EACX,CAEA,SAASY,GAAiB7P,EAAM,CAG5B,MAAO,CAAC,EAAEA,GAAQA,EAAK,MAAM,aAAa,EAC9C,CAEA,SAAS4P,GAAW5P,EAAM,CACtB,IAAI8P,EAAY,KACZC,EAEJ,GACIhB,GAAQ/O,CAAI,IAAM,QAClB,OAAOhE,GAAW,KAClBA,IACAA,GAAO,SACP6T,GAAiB7P,CAAI,EAErB,GAAI,CACA8P,EAAYb,GAAa,MACzBc,EAAiBC,GACjBD,EAAe,YAAc/P,CAAI,EACjCiQ,GAAmBH,CAAS,CAChC,OAASI,EAAG,CAGRnB,GAAQ/O,CAAI,EAAI,IACpB,CAEJ,OAAO+O,GAAQ/O,CAAI,CACvB,CAKA,SAASiQ,GAAmBrQ,EAAKuQ,EAAQ,CACrC,IAAIC,EACJ,OAAIxQ,IACI5C,EAAYmT,CAAM,EAClBC,EAAOC,GAAUzQ,CAAG,EAEpBwQ,EAAOE,GAAa1Q,EAAKuQ,CAAM,EAG/BC,EAEAnB,GAAemB,EAEX,OAAO,QAAY,KAAe,QAAQ,MAE1C,QAAQ,KACJ,UAAYxQ,EAAM,wCACtB,GAKLqP,GAAa,KACxB,CAEA,SAASqB,GAAatQ,EAAMZ,EAAQ,CAChC,GAAIA,IAAW,KAAM,CACjB,IAAIxB,EACAwC,EAAe0O,GAEnB,GADA1P,EAAO,KAAOY,EACV+O,GAAQ/O,CAAI,GAAK,KACjBD,GACI,uBACA,yOAIJ,EACAK,EAAe2O,GAAQ/O,CAAI,EAAE,gBACtBZ,EAAO,cAAgB,KAC9B,GAAI2P,GAAQ3P,EAAO,YAAY,GAAK,KAChCgB,EAAe2O,GAAQ3P,EAAO,YAAY,EAAE,gBAE5CxB,EAASgS,GAAWxQ,EAAO,YAAY,EACnCxB,GAAU,KACVwC,EAAexC,EAAO,YAEtB,QAAKoR,GAAe5P,EAAO,YAAY,IACnC4P,GAAe5P,EAAO,YAAY,EAAI,CAAC,GAE3C4P,GAAe5P,EAAO,YAAY,EAAE,KAAK,CACrC,KAAMY,EACN,OAAQZ,CACZ,CAAC,EACM,KAInB,OAAA2P,GAAQ/O,CAAI,EAAI,IAAIM,GAAOH,GAAaC,EAAchB,CAAM,CAAC,EAEzD4P,GAAehP,CAAI,GACnBgP,GAAehP,CAAI,EAAE,QAAQ,SAAUwI,EAAG,CACtC8H,GAAa9H,EAAE,KAAMA,EAAE,MAAM,CACjC,CAAC,EAMLyH,GAAmBjQ,CAAI,EAEhB+O,GAAQ/O,CAAI,CACvB,KAEI,eAAO+O,GAAQ/O,CAAI,EACZ,IAEf,CAEA,SAASuQ,GAAavQ,EAAMZ,EAAQ,CAChC,GAAIA,GAAU,KAAM,CAChB,IAAIxB,EACA4S,EACApQ,EAAe0O,GAEfC,GAAQ/O,CAAI,GAAK,MAAQ+O,GAAQ/O,CAAI,EAAE,cAAgB,KAEvD+O,GAAQ/O,CAAI,EAAE,IAAIG,GAAa4O,GAAQ/O,CAAI,EAAE,QAASZ,CAAM,CAAC,GAG7DoR,EAAYZ,GAAW5P,CAAI,EACvBwQ,GAAa,OACbpQ,EAAeoQ,EAAU,SAE7BpR,EAASe,GAAaC,EAAchB,CAAM,EACtCoR,GAAa,OAIbpR,EAAO,KAAOY,GAElBpC,EAAS,IAAI0C,GAAOlB,CAAM,EAC1BxB,EAAO,aAAemR,GAAQ/O,CAAI,EAClC+O,GAAQ/O,CAAI,EAAIpC,GAIpBqS,GAAmBjQ,CAAI,CAC3B,MAEQ+O,GAAQ/O,CAAI,GAAK,OACb+O,GAAQ/O,CAAI,EAAE,cAAgB,MAC9B+O,GAAQ/O,CAAI,EAAI+O,GAAQ/O,CAAI,EAAE,aAC1BA,IAASiQ,GAAmB,GAC5BA,GAAmBjQ,CAAI,GAEpB+O,GAAQ/O,CAAI,GAAK,MACxB,OAAO+O,GAAQ/O,CAAI,GAI/B,OAAO+O,GAAQ/O,CAAI,CACvB,CAGA,SAASqQ,GAAUzQ,EAAK,CACpB,IAAIhC,EAMJ,GAJIgC,GAAOA,EAAI,SAAWA,EAAI,QAAQ,QAClCA,EAAMA,EAAI,QAAQ,OAGlB,CAACA,EACD,OAAOqP,GAGX,GAAI,CAAC1S,EAAQqD,CAAG,EAAG,CAGf,GADAhC,EAASgS,GAAWhQ,CAAG,EACnBhC,EACA,OAAOA,EAEXgC,EAAM,CAACA,CAAG,CACd,CAEA,OAAO2P,GAAa3P,CAAG,CAC3B,CAEA,SAAS6Q,IAAc,CACnB,OAAOlQ,GAAKwO,EAAO,CACvB,CAEA,SAAS2B,GAAczS,EAAG,CACtB,IAAI0S,EACAhU,EAAIsB,EAAE,GAEV,OAAItB,GAAKqB,EAAgBC,CAAC,EAAE,WAAa,KACrC0S,EACIhU,EAAEkK,EAAK,EAAI,GAAKlK,EAAEkK,EAAK,EAAI,GACrBA,GACAlK,EAAEmK,EAAI,EAAI,GAAKnK,EAAEmK,EAAI,EAAI6B,GAAYhM,EAAEiK,EAAI,EAAGjK,EAAEkK,EAAK,CAAC,EACpDC,GACAnK,EAAEoK,EAAI,EAAI,GACRpK,EAAEoK,EAAI,EAAI,IACTpK,EAAEoK,EAAI,IAAM,KACRpK,EAAEqK,EAAM,IAAM,GACXrK,EAAEsK,EAAM,IAAM,GACdtK,EAAEuK,EAAW,IAAM,GAC3BH,GACApK,EAAEqK,EAAM,EAAI,GAAKrK,EAAEqK,EAAM,EAAI,GAC3BA,GACArK,EAAEsK,EAAM,EAAI,GAAKtK,EAAEsK,EAAM,EAAI,GAC3BA,GACAtK,EAAEuK,EAAW,EAAI,GAAKvK,EAAEuK,EAAW,EAAI,IACrCA,GACA,GAGhBlJ,EAAgBC,CAAC,EAAE,qBAClB0S,EAAW/J,IAAQ+J,EAAW7J,MAE/B6J,EAAW7J,IAEX9I,EAAgBC,CAAC,EAAE,gBAAkB0S,IAAa,KAClDA,EAAWxJ,IAEXnJ,EAAgBC,CAAC,EAAE,kBAAoB0S,IAAa,KACpDA,EAAWvJ,IAGfpJ,EAAgBC,CAAC,EAAE,SAAW0S,GAG3B1S,CACX,CAIA,IAAI2S,GACI,iJACJC,GACI,6IACJC,GAAU,wBACVC,GAAW,CACP,CAAC,eAAgB,qBAAqB,EACtC,CAAC,aAAc,iBAAiB,EAChC,CAAC,eAAgB,gBAAgB,EACjC,CAAC,aAAc,cAAe,EAAK,EACnC,CAAC,WAAY,aAAa,EAC1B,CAAC,UAAW,aAAc,EAAK,EAC/B,CAAC,aAAc,YAAY,EAC3B,CAAC,WAAY,OAAO,EACpB,CAAC,aAAc,aAAa,EAC5B,CAAC,YAAa,cAAe,EAAK,EAClC,CAAC,UAAW,OAAO,EACnB,CAAC,SAAU,QAAS,EAAK,EACzB,CAAC,OAAQ,QAAS,EAAK,CAC3B,EAEAC,GAAW,CACP,CAAC,gBAAiB,qBAAqB,EACvC,CAAC,gBAAiB,oBAAoB,EACtC,CAAC,WAAY,gBAAgB,EAC7B,CAAC,QAAS,WAAW,EACrB,CAAC,cAAe,mBAAmB,EACnC,CAAC,cAAe,kBAAkB,EAClC,CAAC,SAAU,cAAc,EACzB,CAAC,OAAQ,UAAU,EACnB,CAAC,KAAM,MAAM,CACjB,EACAC,GAAkB,qBAElBC,GACI,0LACJC,GAAa,CACT,GAAI,EACJ,IAAK,EACL,IAAK,GAAK,GACV,IAAK,GAAK,GACV,IAAK,GAAK,GACV,IAAK,GAAK,GACV,IAAK,GAAK,GACV,IAAK,GAAK,GACV,IAAK,GAAK,GACV,IAAK,GAAK,EACd,EAGJ,SAASC,GAAchS,EAAQ,CAC3B,IAAI7B,EACA8T,EACAtO,EAAS3D,EAAO,GAChBkS,EAAQV,GAAiB,KAAK7N,CAAM,GAAK8N,GAAc,KAAK9N,CAAM,EAClEwO,EACAC,EACAC,EACAC,GACAC,GAAcZ,GAAS,OACvBa,GAAcZ,GAAS,OAE3B,GAAIM,EAAO,CAEP,IADAtT,EAAgBoB,CAAM,EAAE,IAAM,GACzB7B,EAAI,EAAG8T,EAAIM,GAAapU,EAAI8T,EAAG9T,IAChC,GAAIwT,GAASxT,CAAC,EAAE,CAAC,EAAE,KAAK+T,EAAM,CAAC,CAAC,EAAG,CAC/BE,EAAaT,GAASxT,CAAC,EAAE,CAAC,EAC1BgU,EAAYR,GAASxT,CAAC,EAAE,CAAC,IAAM,GAC/B,KACJ,CAEJ,GAAIiU,GAAc,KAAM,CACpBpS,EAAO,SAAW,GAClB,MACJ,CACA,GAAIkS,EAAM,CAAC,EAAG,CACV,IAAK/T,EAAI,EAAG8T,EAAIO,GAAarU,EAAI8T,EAAG9T,IAChC,GAAIyT,GAASzT,CAAC,EAAE,CAAC,EAAE,KAAK+T,EAAM,CAAC,CAAC,EAAG,CAE/BG,GAAcH,EAAM,CAAC,GAAK,KAAON,GAASzT,CAAC,EAAE,CAAC,EAC9C,KACJ,CAEJ,GAAIkU,GAAc,KAAM,CACpBrS,EAAO,SAAW,GAClB,MACJ,CACJ,CACA,GAAI,CAACmS,GAAaE,GAAc,KAAM,CAClCrS,EAAO,SAAW,GAClB,MACJ,CACA,GAAIkS,EAAM,CAAC,EACP,GAAIR,GAAQ,KAAKQ,EAAM,CAAC,CAAC,EACrBI,GAAW,QACR,CACHtS,EAAO,SAAW,GAClB,MACJ,CAEJA,EAAO,GAAKoS,GAAcC,GAAc,KAAOC,IAAY,IAC3DG,GAA0BzS,CAAM,CACpC,MACIA,EAAO,SAAW,EAE1B,CAEA,SAAS0S,GACLC,EACAC,EACAC,EACAC,EACAC,EACAC,EACF,CACE,IAAIC,EAAS,CACTC,GAAeP,CAAO,EACtBjJ,GAAyB,QAAQkJ,CAAQ,EACzC,SAASC,EAAQ,EAAE,EACnB,SAASC,EAAS,EAAE,EACpB,SAASC,EAAW,EAAE,CAC1B,EAEA,OAAIC,GACAC,EAAO,KAAK,SAASD,EAAW,EAAE,CAAC,EAGhCC,CACX,CAEA,SAASC,GAAeP,EAAS,CAC7B,IAAIpL,EAAO,SAASoL,EAAS,EAAE,EAC/B,OAAIpL,GAAQ,GACD,IAAOA,EACPA,GAAQ,IACR,KAAOA,EAEXA,CACX,CAEA,SAAS4L,GAAkB9M,EAAG,CAE1B,OAAOA,EACF,QAAQ,qBAAsB,GAAG,EACjC,QAAQ,WAAY,GAAG,EACvB,QAAQ,SAAU,EAAE,EACpB,QAAQ,SAAU,EAAE,CAC7B,CAEA,SAAS+M,GAAaC,EAAYC,EAAatT,EAAQ,CACnD,GAAIqT,EAAY,CAEZ,IAAIE,EAAkBrG,GAA2B,QAAQmG,CAAU,EAC/DG,EAAgB,IAAI,KAChBF,EAAY,CAAC,EACbA,EAAY,CAAC,EACbA,EAAY,CAAC,CACjB,EAAE,OAAO,EACb,GAAIC,IAAoBC,EACpB,OAAA5U,EAAgBoB,CAAM,EAAE,gBAAkB,GAC1CA,EAAO,SAAW,GACX,EAEf,CACA,MAAO,EACX,CAEA,SAASyT,GAAgBC,EAAWC,EAAgBC,EAAW,CAC3D,GAAIF,EACA,OAAO3B,GAAW2B,CAAS,EACxB,GAAIC,EAEP,MAAO,GAEP,IAAIE,EAAK,SAASD,EAAW,EAAE,EAC3B/U,EAAIgV,EAAK,IACT3I,GAAK2I,EAAKhV,GAAK,IACnB,OAAOqM,EAAI,GAAKrM,CAExB,CAGA,SAASiV,GAAkB9T,EAAQ,CAC/B,IAAIkS,EAAQJ,GAAQ,KAAKqB,GAAkBnT,EAAO,EAAE,CAAC,EACjD+T,EACJ,GAAI7B,EAAO,CASP,GARA6B,EAAcrB,GACVR,EAAM,CAAC,EACPA,EAAM,CAAC,EACPA,EAAM,CAAC,EACPA,EAAM,CAAC,EACPA,EAAM,CAAC,EACPA,EAAM,CAAC,CACX,EACI,CAACkB,GAAalB,EAAM,CAAC,EAAG6B,EAAa/T,CAAM,EAC3C,OAGJA,EAAO,GAAK+T,EACZ/T,EAAO,KAAOyT,GAAgBvB,EAAM,CAAC,EAAGA,EAAM,CAAC,EAAGA,EAAM,EAAE,CAAC,EAE3DlS,EAAO,GAAKqL,GAAc,MAAM,KAAMrL,EAAO,EAAE,EAC/CA,EAAO,GAAG,cAAcA,EAAO,GAAG,cAAc,EAAIA,EAAO,IAAI,EAE/DpB,EAAgBoB,CAAM,EAAE,QAAU,EACtC,MACIA,EAAO,SAAW,EAE1B,CAGA,SAASgU,GAAiBhU,EAAQ,CAC9B,IAAIuG,EAAUsL,GAAgB,KAAK7R,EAAO,EAAE,EAC5C,GAAIuG,IAAY,KAAM,CAClBvG,EAAO,GAAK,IAAI,KAAK,CAACuG,EAAQ,CAAC,CAAC,EAChC,MACJ,CAGA,GADAyL,GAAchS,CAAM,EAChBA,EAAO,WAAa,GACpB,OAAOA,EAAO,aAEd,QAIJ,GADA8T,GAAkB9T,CAAM,EACpBA,EAAO,WAAa,GACpB,OAAOA,EAAO,aAEd,QAGAA,EAAO,QACPA,EAAO,SAAW,GAGlBhD,EAAM,wBAAwBgD,CAAM,CAE5C,CAEAhD,EAAM,wBAA0BoD,GAC5B,gSAGA,SAAUJ,EAAQ,CACdA,EAAO,GAAK,IAAI,KAAKA,EAAO,IAAMA,EAAO,QAAU,OAAS,GAAG,CACnE,CACJ,EAGA,SAASiU,GAAS1W,EAAGC,EAAG,EAAG,CACvB,OAAID,GAAK,KACEA,EAEPC,GAAK,KACEA,EAEJ,CACX,CAEA,SAAS0W,GAAiBlU,EAAQ,CAE9B,IAAImU,EAAW,IAAI,KAAKnX,EAAM,IAAI,CAAC,EACnC,OAAIgD,EAAO,QACA,CACHmU,EAAS,eAAe,EACxBA,EAAS,YAAY,EACrBA,EAAS,WAAW,CACxB,EAEG,CAACA,EAAS,YAAY,EAAGA,EAAS,SAAS,EAAGA,EAAS,QAAQ,CAAC,CAC3E,CAMA,SAASC,GAAgBpU,EAAQ,CAC7B,IAAI7B,EACA0K,EACAzL,EAAQ,CAAC,EACTiX,EACAC,EACAC,EAEJ,GAAI,CAAAvU,EAAO,GAgCX,KA5BAqU,EAAcH,GAAiBlU,CAAM,EAGjCA,EAAO,IAAMA,EAAO,GAAG0H,EAAI,GAAK,MAAQ1H,EAAO,GAAGyH,EAAK,GAAK,MAC5D+M,GAAsBxU,CAAM,EAI5BA,EAAO,YAAc,OACrBuU,EAAYN,GAASjU,EAAO,GAAGwH,EAAI,EAAG6M,EAAY7M,EAAI,CAAC,GAGnDxH,EAAO,WAAakI,GAAWqM,CAAS,GACxCvU,EAAO,aAAe,KAEtBpB,EAAgBoB,CAAM,EAAE,mBAAqB,IAGjD6I,EAAOwC,GAAckJ,EAAW,EAAGvU,EAAO,UAAU,EACpDA,EAAO,GAAGyH,EAAK,EAAIoB,EAAK,YAAY,EACpC7I,EAAO,GAAG0H,EAAI,EAAImB,EAAK,WAAW,GAQjC1K,EAAI,EAAGA,EAAI,GAAK6B,EAAO,GAAG7B,CAAC,GAAK,KAAM,EAAEA,EACzC6B,EAAO,GAAG7B,CAAC,EAAIf,EAAMe,CAAC,EAAIkW,EAAYlW,CAAC,EAI3C,KAAOA,EAAI,EAAGA,IACV6B,EAAO,GAAG7B,CAAC,EAAIf,EAAMe,CAAC,EAClB6B,EAAO,GAAG7B,CAAC,GAAK,KAAQA,IAAM,EAAI,EAAI,EAAK6B,EAAO,GAAG7B,CAAC,EAK1D6B,EAAO,GAAG2H,EAAI,IAAM,IACpB3H,EAAO,GAAG4H,EAAM,IAAM,GACtB5H,EAAO,GAAG6H,EAAM,IAAM,GACtB7H,EAAO,GAAG8H,EAAW,IAAM,IAE3B9H,EAAO,SAAW,GAClBA,EAAO,GAAG2H,EAAI,EAAI,GAGtB3H,EAAO,IAAMA,EAAO,QAAUqL,GAAgBJ,IAAY,MACtD,KACA7N,CACJ,EACAkX,EAAkBtU,EAAO,QACnBA,EAAO,GAAG,UAAU,EACpBA,EAAO,GAAG,OAAO,EAInBA,EAAO,MAAQ,MACfA,EAAO,GAAG,cAAcA,EAAO,GAAG,cAAc,EAAIA,EAAO,IAAI,EAG/DA,EAAO,WACPA,EAAO,GAAG2H,EAAI,EAAI,IAKlB3H,EAAO,IACP,OAAOA,EAAO,GAAG,EAAM,KACvBA,EAAO,GAAG,IAAMsU,IAEhB1V,EAAgBoB,CAAM,EAAE,gBAAkB,IAElD,CAEA,SAASwU,GAAsBxU,EAAQ,CACnC,IAAIyU,EAAGC,EAAU9I,EAAMC,EAASN,EAAKC,EAAKmJ,EAAMC,GAAiBC,GAEjEJ,EAAIzU,EAAO,GACPyU,EAAE,IAAM,MAAQA,EAAE,GAAK,MAAQA,EAAE,GAAK,MACtClJ,EAAM,EACNC,EAAM,EAMNkJ,EAAWT,GACPQ,EAAE,GACFzU,EAAO,GAAGwH,EAAI,EACd2E,GAAW2I,GAAY,EAAG,EAAG,CAAC,EAAE,IACpC,EACAlJ,EAAOqI,GAASQ,EAAE,EAAG,CAAC,EACtB5I,EAAUoI,GAASQ,EAAE,EAAG,CAAC,GACrB5I,EAAU,GAAKA,EAAU,KACzB+I,GAAkB,MAGtBrJ,EAAMvL,EAAO,QAAQ,MAAM,IAC3BwL,EAAMxL,EAAO,QAAQ,MAAM,IAE3B6U,GAAU1I,GAAW2I,GAAY,EAAGvJ,EAAKC,CAAG,EAE5CkJ,EAAWT,GAASQ,EAAE,GAAIzU,EAAO,GAAGwH,EAAI,EAAGqN,GAAQ,IAAI,EAGvDjJ,EAAOqI,GAASQ,EAAE,EAAGI,GAAQ,IAAI,EAE7BJ,EAAE,GAAK,MAEP5I,EAAU4I,EAAE,GACR5I,EAAU,GAAKA,EAAU,KACzB+I,GAAkB,KAEfH,EAAE,GAAK,MAEd5I,EAAU4I,EAAE,EAAIlJ,GACZkJ,EAAE,EAAI,GAAKA,EAAE,EAAI,KACjBG,GAAkB,KAItB/I,EAAUN,GAGdK,EAAO,GAAKA,EAAOS,GAAYqI,EAAUnJ,EAAKC,CAAG,EACjD5M,EAAgBoB,CAAM,EAAE,eAAiB,GAClC4U,IAAmB,KAC1BhW,EAAgBoB,CAAM,EAAE,iBAAmB,IAE3C2U,EAAOhJ,GAAmB+I,EAAU9I,EAAMC,EAASN,EAAKC,CAAG,EAC3DxL,EAAO,GAAGwH,EAAI,EAAImN,EAAK,KACvB3U,EAAO,WAAa2U,EAAK,UAEjC,CAGA3X,EAAM,SAAW,UAAY,CAAC,EAG9BA,EAAM,SAAW,UAAY,CAAC,EAG9B,SAASyV,GAA0BzS,EAAQ,CAEvC,GAAIA,EAAO,KAAOhD,EAAM,SAAU,CAC9BgV,GAAchS,CAAM,EACpB,MACJ,CACA,GAAIA,EAAO,KAAOhD,EAAM,SAAU,CAC9B8W,GAAkB9T,CAAM,EACxB,MACJ,CACAA,EAAO,GAAK,CAAC,EACbpB,EAAgBoB,CAAM,EAAE,MAAQ,GAGhC,IAAI2D,EAAS,GAAK3D,EAAO,GACrB7B,EACAmV,EACArM,EACA5E,EACA0S,EACAC,EAAerR,EAAO,OACtBsR,GAAyB,EACzBC,GACA/N,GAKJ,IAHAF,EACInE,GAAa9C,EAAO,GAAIA,EAAO,OAAO,EAAE,MAAMgC,EAAgB,GAAK,CAAC,EACxEmF,GAAWF,EAAO,OACb9I,EAAI,EAAGA,EAAIgJ,GAAUhJ,IACtBkE,EAAQ4E,EAAO9I,CAAC,EAChBmV,GAAe3P,EAAO,MAAMwC,GAAsB9D,EAAOrC,CAAM,CAAC,GAC5D,CAAC,GAAG,CAAC,EACLsT,IACAyB,EAAUpR,EAAO,OAAO,EAAGA,EAAO,QAAQ2P,CAAW,CAAC,EAClDyB,EAAQ,OAAS,GACjBnW,EAAgBoB,CAAM,EAAE,YAAY,KAAK+U,CAAO,EAEpDpR,EAASA,EAAO,MACZA,EAAO,QAAQ2P,CAAW,EAAIA,EAAY,MAC9C,EACA2B,IAA0B3B,EAAY,QAGtCnR,GAAqBE,CAAK,GACtBiR,EACA1U,EAAgBoB,CAAM,EAAE,MAAQ,GAEhCpB,EAAgBoB,CAAM,EAAE,aAAa,KAAKqC,CAAK,EAEnDgF,GAAwBhF,EAAOiR,EAAatT,CAAM,GAC3CA,EAAO,SAAW,CAACsT,GAC1B1U,EAAgBoB,CAAM,EAAE,aAAa,KAAKqC,CAAK,EAKvDzD,EAAgBoB,CAAM,EAAE,cACpBgV,EAAeC,GACftR,EAAO,OAAS,GAChB/E,EAAgBoB,CAAM,EAAE,YAAY,KAAK2D,CAAM,EAK/C3D,EAAO,GAAG2H,EAAI,GAAK,IACnB/I,EAAgBoB,CAAM,EAAE,UAAY,IACpCA,EAAO,GAAG2H,EAAI,EAAI,IAElB/I,EAAgBoB,CAAM,EAAE,QAAU,QAGtCpB,EAAgBoB,CAAM,EAAE,gBAAkBA,EAAO,GAAG,MAAM,CAAC,EAC3DpB,EAAgBoB,CAAM,EAAE,SAAWA,EAAO,UAE1CA,EAAO,GAAG2H,EAAI,EAAIwN,GACdnV,EAAO,QACPA,EAAO,GAAG2H,EAAI,EACd3H,EAAO,SACX,EAGAkV,GAAMtW,EAAgBoB,CAAM,EAAE,IAC1BkV,KAAQ,OACRlV,EAAO,GAAGwH,EAAI,EAAIxH,EAAO,QAAQ,gBAAgBkV,GAAKlV,EAAO,GAAGwH,EAAI,CAAC,GAGzE4M,GAAgBpU,CAAM,EACtBsR,GAActR,CAAM,CACxB,CAEA,SAASmV,GAAgB3W,EAAQ4W,EAAMxG,EAAU,CAC7C,IAAIyG,EAEJ,OAAIzG,GAAY,KAELwG,EAEP5W,EAAO,cAAgB,KAChBA,EAAO,aAAa4W,EAAMxG,CAAQ,GAClCpQ,EAAO,MAAQ,OAEtB6W,EAAO7W,EAAO,KAAKoQ,CAAQ,EACvByG,GAAQD,EAAO,KACfA,GAAQ,IAER,CAACC,GAAQD,IAAS,KAClBA,EAAO,IAEJA,EAKf,CAGA,SAASE,GAAyBtV,EAAQ,CACtC,IAAIuV,EACAC,EACAC,EACAtX,EACAuX,EACAC,EACAC,EAAoB,GACpBC,GAAa7V,EAAO,GAAG,OAE3B,GAAI6V,KAAe,EAAG,CAClBjX,EAAgBoB,CAAM,EAAE,cAAgB,GACxCA,EAAO,GAAK,IAAI,KAAK,GAAG,EACxB,MACJ,CAEA,IAAK7B,EAAI,EAAGA,EAAI0X,GAAY1X,IACxBuX,EAAe,EACfC,EAAmB,GACnBJ,EAAa9V,GAAW,CAAC,EAAGO,CAAM,EAC9BA,EAAO,SAAW,OAClBuV,EAAW,QAAUvV,EAAO,SAEhCuV,EAAW,GAAKvV,EAAO,GAAG7B,CAAC,EAC3BsU,GAA0B8C,CAAU,EAEhCrW,EAAQqW,CAAU,IAClBI,EAAmB,IAIvBD,GAAgB9W,EAAgB2W,CAAU,EAAE,cAG5CG,GAAgB9W,EAAgB2W,CAAU,EAAE,aAAa,OAAS,GAElE3W,EAAgB2W,CAAU,EAAE,MAAQG,EAE/BE,EAaGF,EAAeD,IACfA,EAAcC,EACdF,EAAaD,IAbbE,GAAe,MACfC,EAAeD,GACfE,KAEAF,EAAcC,EACdF,EAAaD,EACTI,IACAC,EAAoB,KAWpCvX,EAAO2B,EAAQwV,GAAcD,CAAU,CAC3C,CAEA,SAASO,GAAiB9V,EAAQ,CAC9B,GAAI,CAAAA,EAAO,GAIX,KAAI7B,EAAI+F,EAAqBlE,EAAO,EAAE,EAClC+V,EAAY5X,EAAE,MAAQ,OAAYA,EAAE,KAAOA,EAAE,IACjD6B,EAAO,GAAKjC,EACR,CAACI,EAAE,KAAMA,EAAE,MAAO4X,EAAW5X,EAAE,KAAMA,EAAE,OAAQA,EAAE,OAAQA,EAAE,WAAW,EACtE,SAAUT,EAAK,CACX,OAAOA,GAAO,SAASA,EAAK,EAAE,CAClC,CACJ,EAEA0W,GAAgBpU,CAAM,EAC1B,CAEA,SAASgW,GAAiBhW,EAAQ,CAC9B,IAAI9B,EAAM,IAAI6B,EAAOuR,GAAc2E,GAAcjW,CAAM,CAAC,CAAC,EACzD,OAAI9B,EAAI,WAEJA,EAAI,IAAI,EAAG,GAAG,EACdA,EAAI,SAAW,QAGZA,CACX,CAEA,SAAS+X,GAAcjW,EAAQ,CAC3B,IAAI5C,EAAQ4C,EAAO,GACfzB,EAASyB,EAAO,GAIpB,OAFAA,EAAO,QAAUA,EAAO,SAAWiR,GAAUjR,EAAO,EAAE,EAElD5C,IAAU,MAASmB,IAAW,QAAanB,IAAU,GAC9CkC,GAAc,CAAE,UAAW,EAAK,CAAC,GAGxC,OAAOlC,GAAU,WACjB4C,EAAO,GAAK5C,EAAQ4C,EAAO,QAAQ,SAAS5C,CAAK,GAGjD6C,GAAS7C,CAAK,EACP,IAAI2C,EAAOuR,GAAclU,CAAK,CAAC,GAC/BU,EAAOV,CAAK,EACnB4C,EAAO,GAAK5C,EACLD,EAAQoB,CAAM,EACrB+W,GAAyBtV,CAAM,EACxBzB,EACPkU,GAA0BzS,CAAM,EAEhCkW,GAAgBlW,CAAM,EAGrBd,EAAQc,CAAM,IACfA,EAAO,GAAK,MAGTA,GACX,CAEA,SAASkW,GAAgBlW,EAAQ,CAC7B,IAAI5C,EAAQ4C,EAAO,GACfpC,EAAYR,CAAK,EACjB4C,EAAO,GAAK,IAAI,KAAKhD,EAAM,IAAI,CAAC,EACzBc,EAAOV,CAAK,EACnB4C,EAAO,GAAK,IAAI,KAAK5C,EAAM,QAAQ,CAAC,EAC7B,OAAOA,GAAU,SACxB4W,GAAiBhU,CAAM,EAChB7C,EAAQC,CAAK,GACpB4C,EAAO,GAAKjC,EAAIX,EAAM,MAAM,CAAC,EAAG,SAAUM,EAAK,CAC3C,OAAO,SAASA,EAAK,EAAE,CAC3B,CAAC,EACD0W,GAAgBpU,CAAM,GACf3C,EAASD,CAAK,EACrB0Y,GAAiB9V,CAAM,EAChBnC,EAAST,CAAK,EAErB4C,EAAO,GAAK,IAAI,KAAK5C,CAAK,EAE1BJ,EAAM,wBAAwBgD,CAAM,CAE5C,CAEA,SAAStB,GAAiBtB,EAAOmB,EAAQC,EAAQC,EAAQkK,EAAO,CAC5D,IAAIwN,EAAI,CAAC,EAET,OAAI5X,IAAW,IAAQA,IAAW,MAC9BE,EAASF,EACTA,EAAS,SAGTC,IAAW,IAAQA,IAAW,MAC9BC,EAASD,EACTA,EAAS,SAIRnB,EAASD,CAAK,GAAKK,EAAcL,CAAK,GACtCD,EAAQC,CAAK,GAAKA,EAAM,SAAW,KAEpCA,EAAQ,QAIZ+Y,EAAE,iBAAmB,GACrBA,EAAE,QAAUA,EAAE,OAASxN,EACvBwN,EAAE,GAAK3X,EACP2X,EAAE,GAAK/Y,EACP+Y,EAAE,GAAK5X,EACP4X,EAAE,QAAU1X,EAELuX,GAAiBG,CAAC,CAC7B,CAEA,SAASrB,GAAY1X,EAAOmB,EAAQC,EAAQC,EAAQ,CAChD,OAAOC,GAAiBtB,EAAOmB,EAAQC,EAAQC,EAAQ,EAAK,CAChE,CAEA,IAAI2X,GAAehW,GACX,qGACA,UAAY,CACR,IAAIiW,EAAQvB,GAAY,MAAM,KAAM,SAAS,EAC7C,OAAI,KAAK,QAAQ,GAAKuB,EAAM,QAAQ,EACzBA,EAAQ,KAAO,KAAOA,EAEtB/W,GAAc,CAE7B,CACJ,EACAgX,GAAelW,GACX,qGACA,UAAY,CACR,IAAIiW,EAAQvB,GAAY,MAAM,KAAM,SAAS,EAC7C,OAAI,KAAK,QAAQ,GAAKuB,EAAM,QAAQ,EACzBA,EAAQ,KAAO,KAAOA,EAEtB/W,GAAc,CAE7B,CACJ,EAOJ,SAASiX,GAAOtY,EAAIuY,EAAS,CACzB,IAAItY,EAAKC,EAIT,GAHIqY,EAAQ,SAAW,GAAKrZ,EAAQqZ,EAAQ,CAAC,CAAC,IAC1CA,EAAUA,EAAQ,CAAC,GAEnB,CAACA,EAAQ,OACT,OAAO1B,GAAY,EAGvB,IADA5W,EAAMsY,EAAQ,CAAC,EACVrY,EAAI,EAAGA,EAAIqY,EAAQ,OAAQ,EAAErY,GAC1B,CAACqY,EAAQrY,CAAC,EAAE,QAAQ,GAAKqY,EAAQrY,CAAC,EAAEF,CAAE,EAAEC,CAAG,KAC3CA,EAAMsY,EAAQrY,CAAC,GAGvB,OAAOD,CACX,CAGA,SAASuY,IAAM,CACX,IAAInW,EAAO,CAAC,EAAE,MAAM,KAAK,UAAW,CAAC,EAErC,OAAOiW,GAAO,WAAYjW,CAAI,CAClC,CAEA,SAASoW,IAAM,CACX,IAAIpW,EAAO,CAAC,EAAE,MAAM,KAAK,UAAW,CAAC,EAErC,OAAOiW,GAAO,UAAWjW,CAAI,CACjC,CAEA,IAAIiB,GAAM,UAAY,CAClB,OAAO,KAAK,IAAM,KAAK,IAAI,EAAI,CAAC,IAAI,IACxC,EAEIoV,GAAW,CACX,OACA,UACA,QACA,OACA,MACA,OACA,SACA,SACA,aACJ,EAEA,SAASC,GAAgB/X,EAAG,CACxB,IAAI2B,EACAqW,EAAiB,GACjB1Y,EACA2Y,EAAWH,GAAS,OACxB,IAAKnW,KAAO3B,EACR,GACIvB,EAAWuB,EAAG2B,CAAG,GACjB,EACI6I,GAAQ,KAAKsN,GAAUnW,CAAG,IAAM,KAC/B3B,EAAE2B,CAAG,GAAK,MAAQ,CAAC,MAAM3B,EAAE2B,CAAG,CAAC,IAGpC,MAAO,GAIf,IAAKrC,EAAI,EAAGA,EAAI2Y,EAAU,EAAE3Y,EACxB,GAAIU,EAAE8X,GAASxY,CAAC,CAAC,EAAG,CAChB,GAAI0Y,EACA,MAAO,GAEP,WAAWhY,EAAE8X,GAASxY,CAAC,CAAC,CAAC,IAAM0I,GAAMhI,EAAE8X,GAASxY,CAAC,CAAC,CAAC,IACnD0Y,EAAiB,GAEzB,CAGJ,MAAO,EACX,CAEA,SAASE,IAAY,CACjB,OAAO,KAAK,QAChB,CAEA,SAASC,IAAkB,CACvB,OAAOC,GAAe,GAAG,CAC7B,CAEA,SAASC,GAASC,EAAU,CACxB,IAAI/S,EAAkBF,EAAqBiT,CAAQ,EAC/CC,EAAQhT,EAAgB,MAAQ,EAChCiT,EAAWjT,EAAgB,SAAW,EACtCkT,EAASlT,EAAgB,OAAS,EAClCmT,EAAQnT,EAAgB,MAAQA,EAAgB,SAAW,EAC3DoT,EAAOpT,EAAgB,KAAO,EAC9BmL,EAAQnL,EAAgB,MAAQ,EAChCoL,GAAUpL,EAAgB,QAAU,EACpCqT,GAAUrT,EAAgB,QAAU,EACpCsT,GAAetT,EAAgB,aAAe,EAElD,KAAK,SAAWwS,GAAgBxS,CAAe,EAG/C,KAAK,cACD,CAACsT,GACDD,GAAU,IACVjI,GAAU,IACVD,EAAQ,IAAO,GAAK,GAGxB,KAAK,MAAQ,CAACiI,EAAOD,EAAQ,EAI7B,KAAK,QAAU,CAACD,EAASD,EAAW,EAAID,EAAQ,GAEhD,KAAK,MAAQ,CAAC,EAEd,KAAK,QAAUnG,GAAU,EAEzB,KAAK,QAAQ,CACjB,CAEA,SAAS0G,GAAWja,EAAK,CACrB,OAAOA,aAAewZ,EAC1B,CAEA,SAASU,GAASlW,EAAQ,CACtB,OAAIA,EAAS,EACF,KAAK,MAAM,GAAKA,CAAM,EAAI,GAE1B,KAAK,MAAMA,CAAM,CAEhC,CAGA,SAASmW,GAAcC,EAAQC,EAAQC,EAAa,CAChD,IAAI/Y,EAAM,KAAK,IAAI6Y,EAAO,OAAQC,EAAO,MAAM,EAC3CE,EAAa,KAAK,IAAIH,EAAO,OAASC,EAAO,MAAM,EACnDG,EAAQ,EACR/Z,EACJ,IAAKA,EAAI,EAAGA,EAAIc,EAAKd,KAEZ6Z,GAAeF,EAAO3Z,CAAC,IAAM4Z,EAAO5Z,CAAC,GACrC,CAAC6Z,GAAenR,GAAMiR,EAAO3Z,CAAC,CAAC,IAAM0I,GAAMkR,EAAO5Z,CAAC,CAAC,IAErD+Z,IAGR,OAAOA,EAAQD,CACnB,CAIA,SAASE,GAAO9V,EAAO+V,EAAW,CAC9BhW,EAAeC,EAAO,EAAG,EAAG,UAAY,CACpC,IAAI8V,EAAS,KAAK,UAAU,EACxBpW,EAAO,IACX,OAAIoW,EAAS,IACTA,EAAS,CAACA,EACVpW,EAAO,KAGPA,EACAN,GAAS,CAAC,EAAE0W,EAAS,IAAK,CAAC,EAC3BC,EACA3W,GAAS,CAAC,CAAC0W,EAAS,GAAI,CAAC,CAEjC,CAAC,CACL,CAEAA,GAAO,IAAK,GAAG,EACfA,GAAO,KAAM,EAAE,EAIfrS,EAAc,IAAKN,EAAgB,EACnCM,EAAc,KAAMN,EAAgB,EACpC0B,GAAc,CAAC,IAAK,IAAI,EAAG,SAAU9J,EAAOuF,EAAO3C,EAAQ,CACvDA,EAAO,QAAU,GACjBA,EAAO,KAAOqY,GAAiB7S,GAAkBpI,CAAK,CAC1D,CAAC,EAOD,IAAIkb,GAAc,kBAElB,SAASD,GAAiBE,EAAS5U,EAAQ,CACvC,IAAI6U,GAAW7U,GAAU,IAAI,MAAM4U,CAAO,EACtCE,EACAC,EACAlJ,EAEJ,OAAIgJ,IAAY,KACL,MAGXC,EAAQD,EAAQA,EAAQ,OAAS,CAAC,GAAK,CAAC,EACxCE,GAASD,EAAQ,IAAI,MAAMH,EAAW,GAAK,CAAC,IAAK,EAAG,CAAC,EACrD9I,EAAU,EAAEkJ,EAAM,CAAC,EAAI,IAAM7R,GAAM6R,EAAM,CAAC,CAAC,EAEpClJ,IAAY,EAAI,EAAIkJ,EAAM,CAAC,IAAM,IAAMlJ,EAAU,CAACA,EAC7D,CAGA,SAASmJ,GAAgBvb,EAAOwb,EAAO,CACnC,IAAI1a,EAAK4F,EACT,OAAI8U,EAAM,QACN1a,EAAM0a,EAAM,MAAM,EAClB9U,GACK7D,GAAS7C,CAAK,GAAKU,EAAOV,CAAK,EAC1BA,EAAM,QAAQ,EACd0X,GAAY1X,CAAK,EAAE,QAAQ,GAAKc,EAAI,QAAQ,EAEtDA,EAAI,GAAG,QAAQA,EAAI,GAAG,QAAQ,EAAI4F,CAAI,EACtC9G,EAAM,aAAakB,EAAK,EAAK,EACtBA,GAEA4W,GAAY1X,CAAK,EAAE,MAAM,CAExC,CAEA,SAASyb,GAAcha,EAAG,CAGtB,MAAO,CAAC,KAAK,MAAMA,EAAE,GAAG,kBAAkB,CAAC,CAC/C,CAMA7B,EAAM,aAAe,UAAY,CAAC,EAclC,SAAS8b,GAAa1b,EAAO2b,EAAeC,EAAa,CACrD,IAAIb,EAAS,KAAK,SAAW,EACzBc,EACJ,GAAI,CAAC,KAAK,QAAQ,EACd,OAAO7b,GAAS,KAAO,KAAO,IAElC,GAAIA,GAAS,KAAM,CACf,GAAI,OAAOA,GAAU,UAEjB,GADAA,EAAQib,GAAiB7S,GAAkBpI,CAAK,EAC5CA,IAAU,KACV,OAAO,UAEJ,KAAK,IAAIA,CAAK,EAAI,IAAM,CAAC4b,IAChC5b,EAAQA,EAAQ,IAEpB,MAAI,CAAC,KAAK,QAAU2b,IAChBE,EAAcJ,GAAc,IAAI,GAEpC,KAAK,QAAUzb,EACf,KAAK,OAAS,GACV6b,GAAe,MACf,KAAK,IAAIA,EAAa,GAAG,EAEzBd,IAAW/a,IACP,CAAC2b,GAAiB,KAAK,kBACvBG,GACI,KACAjC,GAAe7Z,EAAQ+a,EAAQ,GAAG,EAClC,EACA,EACJ,EACQ,KAAK,oBACb,KAAK,kBAAoB,GACzBnb,EAAM,aAAa,KAAM,EAAI,EAC7B,KAAK,kBAAoB,OAG1B,IACX,KACI,QAAO,KAAK,OAASmb,EAASU,GAAc,IAAI,CAExD,CAEA,SAASM,GAAW/b,EAAO2b,EAAe,CACtC,OAAI3b,GAAS,MACL,OAAOA,GAAU,WACjBA,EAAQ,CAACA,GAGb,KAAK,UAAUA,EAAO2b,CAAa,EAE5B,MAEA,CAAC,KAAK,UAAU,CAE/B,CAEA,SAASK,GAAeL,EAAe,CACnC,OAAO,KAAK,UAAU,EAAGA,CAAa,CAC1C,CAEA,SAASM,GAAiBN,EAAe,CACrC,OAAI,KAAK,SACL,KAAK,UAAU,EAAGA,CAAa,EAC/B,KAAK,OAAS,GAEVA,GACA,KAAK,SAASF,GAAc,IAAI,EAAG,GAAG,GAGvC,IACX,CAEA,SAASS,IAA0B,CAC/B,GAAI,KAAK,MAAQ,KACb,KAAK,UAAU,KAAK,KAAM,GAAO,EAAI,UAC9B,OAAO,KAAK,IAAO,SAAU,CACpC,IAAIC,EAAQlB,GAAiB9S,GAAa,KAAK,EAAE,EAC7CgU,GAAS,KACT,KAAK,UAAUA,CAAK,EAEpB,KAAK,UAAU,EAAG,EAAI,CAE9B,CACA,OAAO,IACX,CAEA,SAASC,GAAqBpc,EAAO,CACjC,OAAK,KAAK,QAAQ,GAGlBA,EAAQA,EAAQ0X,GAAY1X,CAAK,EAAE,UAAU,EAAI,GAEzC,KAAK,UAAU,EAAIA,GAAS,KAAO,GAJhC,EAKf,CAEA,SAASqc,IAAuB,CAC5B,OACI,KAAK,UAAU,EAAI,KAAK,MAAM,EAAE,MAAM,CAAC,EAAE,UAAU,GACnD,KAAK,UAAU,EAAI,KAAK,MAAM,EAAE,MAAM,CAAC,EAAE,UAAU,CAE3D,CAEA,SAASC,IAA8B,CACnC,GAAI,CAAC9b,EAAY,KAAK,aAAa,EAC/B,OAAO,KAAK,cAGhB,IAAIuY,EAAI,CAAC,EACLE,EAEJ,OAAA5W,GAAW0W,EAAG,IAAI,EAClBA,EAAIF,GAAcE,CAAC,EAEfA,EAAE,IACFE,EAAQF,EAAE,OAAS7X,EAAU6X,EAAE,EAAE,EAAIrB,GAAYqB,EAAE,EAAE,EACrD,KAAK,cACD,KAAK,QAAQ,GAAK0B,GAAc1B,EAAE,GAAIE,EAAM,QAAQ,CAAC,EAAI,GAE7D,KAAK,cAAgB,GAGlB,KAAK,aAChB,CAEA,SAASsD,IAAU,CACf,OAAO,KAAK,QAAQ,EAAI,CAAC,KAAK,OAAS,EAC3C,CAEA,SAASC,IAAc,CACnB,OAAO,KAAK,QAAQ,EAAI,KAAK,OAAS,EAC1C,CAEA,SAASC,IAAQ,CACb,OAAO,KAAK,QAAQ,EAAI,KAAK,QAAU,KAAK,UAAY,EAAI,EAChE,CAGA,IAAIC,GAAc,wDAIdC,GACI,sKAER,SAAS9C,GAAe7Z,EAAOoD,EAAK,CAChC,IAAI2W,EAAW/Z,EAEX8U,EAAQ,KACRnQ,EACAiY,EACAC,EAEJ,OAAItC,GAAWva,CAAK,EAChB+Z,EAAW,CACP,GAAI/Z,EAAM,cACV,EAAGA,EAAM,MACT,EAAGA,EAAM,OACb,EACOS,EAAST,CAAK,GAAK,CAAC,MAAM,CAACA,CAAK,GACvC+Z,EAAW,CAAC,EACR3W,EACA2W,EAAS3W,CAAG,EAAI,CAACpD,EAEjB+Z,EAAS,aAAe,CAAC/Z,IAErB8U,EAAQ4H,GAAY,KAAK1c,CAAK,IACtC2E,EAAOmQ,EAAM,CAAC,IAAM,IAAM,GAAK,EAC/BiF,EAAW,CACP,EAAG,EACH,EAAGtQ,GAAMqL,EAAMxK,EAAI,CAAC,EAAI3F,EACxB,EAAG8E,GAAMqL,EAAMvK,EAAI,CAAC,EAAI5F,EACxB,EAAG8E,GAAMqL,EAAMtK,EAAM,CAAC,EAAI7F,EAC1B,EAAG8E,GAAMqL,EAAMrK,EAAM,CAAC,EAAI9F,EAC1B,GAAI8E,GAAM+Q,GAAS1F,EAAMpK,EAAW,EAAI,GAAI,CAAC,EAAI/F,CACrD,IACQmQ,EAAQ6H,GAAS,KAAK3c,CAAK,IACnC2E,EAAOmQ,EAAM,CAAC,IAAM,IAAM,GAAK,EAC/BiF,EAAW,CACP,EAAG+C,GAAShI,EAAM,CAAC,EAAGnQ,CAAI,EAC1B,EAAGmY,GAAShI,EAAM,CAAC,EAAGnQ,CAAI,EAC1B,EAAGmY,GAAShI,EAAM,CAAC,EAAGnQ,CAAI,EAC1B,EAAGmY,GAAShI,EAAM,CAAC,EAAGnQ,CAAI,EAC1B,EAAGmY,GAAShI,EAAM,CAAC,EAAGnQ,CAAI,EAC1B,EAAGmY,GAAShI,EAAM,CAAC,EAAGnQ,CAAI,EAC1B,EAAGmY,GAAShI,EAAM,CAAC,EAAGnQ,CAAI,CAC9B,GACOoV,GAAY,KAEnBA,EAAW,CAAC,EAEZ,OAAOA,GAAa,WACnB,SAAUA,GAAY,OAAQA,KAE/B8C,EAAUE,GACNrF,GAAYqC,EAAS,IAAI,EACzBrC,GAAYqC,EAAS,EAAE,CAC3B,EAEAA,EAAW,CAAC,EACZA,EAAS,GAAK8C,EAAQ,aACtB9C,EAAS,EAAI8C,EAAQ,QAGzBD,EAAM,IAAI9C,GAASC,CAAQ,EAEvBQ,GAAWva,CAAK,GAAKE,EAAWF,EAAO,SAAS,IAChD4c,EAAI,QAAU5c,EAAM,SAGpBua,GAAWva,CAAK,GAAKE,EAAWF,EAAO,UAAU,IACjD4c,EAAI,SAAW5c,EAAM,UAGlB4c,CACX,CAEA/C,GAAe,GAAKC,GAAS,UAC7BD,GAAe,QAAUD,GAEzB,SAASkD,GAASE,EAAKrY,EAAM,CAIzB,IAAI7D,EAAMkc,GAAO,WAAWA,EAAI,QAAQ,IAAK,GAAG,CAAC,EAEjD,OAAQ,MAAMlc,CAAG,EAAI,EAAIA,GAAO6D,CACpC,CAEA,SAASsY,GAA0BC,EAAMjE,EAAO,CAC5C,IAAInY,EAAM,CAAC,EAEX,OAAAA,EAAI,OACAmY,EAAM,MAAM,EAAIiE,EAAK,MAAM,GAAKjE,EAAM,KAAK,EAAIiE,EAAK,KAAK,GAAK,GAC9DA,EAAK,MAAM,EAAE,IAAIpc,EAAI,OAAQ,GAAG,EAAE,QAAQmY,CAAK,GAC/C,EAAEnY,EAAI,OAGVA,EAAI,aAAe,CAACmY,EAAQ,CAACiE,EAAK,MAAM,EAAE,IAAIpc,EAAI,OAAQ,GAAG,EAEtDA,CACX,CAEA,SAASic,GAAkBG,EAAMjE,EAAO,CACpC,IAAInY,EACJ,OAAMoc,EAAK,QAAQ,GAAKjE,EAAM,QAAQ,GAItCA,EAAQsC,GAAgBtC,EAAOiE,CAAI,EAC/BA,EAAK,SAASjE,CAAK,EACnBnY,EAAMmc,GAA0BC,EAAMjE,CAAK,GAE3CnY,EAAMmc,GAA0BhE,EAAOiE,CAAI,EAC3Cpc,EAAI,aAAe,CAACA,EAAI,aACxBA,EAAI,OAAS,CAACA,EAAI,QAGfA,GAZI,CAAE,aAAc,EAAG,OAAQ,CAAE,CAa5C,CAGA,SAASqc,GAAYC,EAAW5Z,EAAM,CAClC,OAAO,SAAUf,EAAK4a,EAAQ,CAC1B,IAAIC,EAAKC,EAET,OAAIF,IAAW,MAAQ,CAAC,MAAM,CAACA,CAAM,IACjC9Z,GACIC,EACA,YACIA,EACA,uDACAA,EACA,gGAER,EACA+Z,EAAM9a,EACNA,EAAM4a,EACNA,EAASE,GAGbD,EAAMzD,GAAepX,EAAK4a,CAAM,EAChCvB,GAAY,KAAMwB,EAAKF,CAAS,EACzB,IACX,CACJ,CAEA,SAAStB,GAAY5X,EAAK6V,EAAUyD,EAAUC,EAAc,CACxD,IAAInD,EAAeP,EAAS,cACxBK,EAAOI,GAAST,EAAS,KAAK,EAC9BG,EAASM,GAAST,EAAS,OAAO,EAEjC7V,EAAI,QAAQ,IAKjBuZ,EAAeA,GAAgB,KAAO,GAAOA,EAEzCvD,GACAjN,GAAS/I,EAAKmH,GAAInH,EAAK,OAAO,EAAIgW,EAASsD,CAAQ,EAEnDpD,GACAhP,GAAMlH,EAAK,OAAQmH,GAAInH,EAAK,MAAM,EAAIkW,EAAOoD,CAAQ,EAErDlD,GACApW,EAAI,GAAG,QAAQA,EAAI,GAAG,QAAQ,EAAIoW,EAAekD,CAAQ,EAEzDC,GACA7d,EAAM,aAAasE,EAAKkW,GAAQF,CAAM,EAE9C,CAEA,IAAIwD,GAAMP,GAAY,EAAG,KAAK,EAC1BQ,GAAWR,GAAY,GAAI,UAAU,EAEzC,SAASS,GAAS5d,EAAO,CACrB,OAAO,OAAOA,GAAU,UAAYA,aAAiB,MACzD,CAGA,SAAS6d,GAAc7d,EAAO,CAC1B,OACI6C,GAAS7C,CAAK,GACdU,EAAOV,CAAK,GACZ4d,GAAS5d,CAAK,GACdS,EAAST,CAAK,GACd8d,GAAsB9d,CAAK,GAC3B+d,GAAoB/d,CAAK,GACzBA,IAAU,MACVA,IAAU,MAElB,CAEA,SAAS+d,GAAoB/d,EAAO,CAChC,IAAIge,EAAa/d,EAASD,CAAK,GAAK,CAACK,EAAcL,CAAK,EACpDie,EAAe,GACfC,EAAa,CACT,QACA,OACA,IACA,SACA,QACA,IACA,OACA,MACA,IACA,QACA,OACA,IACA,QACA,OACA,IACA,UACA,SACA,IACA,UACA,SACA,IACA,eACA,cACA,IACJ,EACAnd,EACAod,EACAC,EAAcF,EAAW,OAE7B,IAAKnd,EAAI,EAAGA,EAAIqd,EAAard,GAAK,EAC9Bod,EAAWD,EAAWnd,CAAC,EACvBkd,EAAeA,GAAgB/d,EAAWF,EAAOme,CAAQ,EAG7D,OAAOH,GAAcC,CACzB,CAEA,SAASH,GAAsB9d,EAAO,CAClC,IAAIqe,EAAYte,EAAQC,CAAK,EACzBse,EAAe,GACnB,OAAID,IACAC,EACIte,EAAM,OAAO,SAAUue,EAAM,CACzB,MAAO,CAAC9d,EAAS8d,CAAI,GAAKX,GAAS5d,CAAK,CAC5C,CAAC,EAAE,SAAW,GAEfqe,GAAaC,CACxB,CAEA,SAASE,GAAexe,EAAO,CAC3B,IAAIge,EAAa/d,EAASD,CAAK,GAAK,CAACK,EAAcL,CAAK,EACpDie,EAAe,GACfC,EAAa,CACT,UACA,UACA,UACA,WACA,WACA,UACJ,EACAnd,EACAod,EAEJ,IAAKpd,EAAI,EAAGA,EAAImd,EAAW,OAAQnd,GAAK,EACpCod,EAAWD,EAAWnd,CAAC,EACvBkd,EAAeA,GAAgB/d,EAAWF,EAAOme,CAAQ,EAG7D,OAAOH,GAAcC,CACzB,CAEA,SAASQ,GAAkBC,EAAUva,EAAK,CACtC,IAAIuC,EAAOgY,EAAS,KAAKva,EAAK,OAAQ,EAAI,EAC1C,OAAOuC,EAAO,GACR,WACAA,EAAO,GACL,WACAA,EAAO,EACL,UACAA,EAAO,EACL,UACAA,EAAO,EACL,UACAA,EAAO,EACL,WACA,UACpB,CAEA,SAASiY,GAAWC,EAAMC,EAAS,CAE3B,UAAU,SAAW,IAChB,UAAU,CAAC,EAGLhB,GAAc,UAAU,CAAC,CAAC,GACjCe,EAAO,UAAU,CAAC,EAClBC,EAAU,QACHL,GAAe,UAAU,CAAC,CAAC,IAClCK,EAAU,UAAU,CAAC,EACrBD,EAAO,SAPPA,EAAO,OACPC,EAAU,SAWlB,IAAI1a,EAAMya,GAAQlH,GAAY,EAC1BoH,EAAMvD,GAAgBpX,EAAK,IAAI,EAAE,QAAQ,KAAK,EAC9ChD,EAASvB,EAAM,eAAe,KAAMkf,CAAG,GAAK,WAC5C1a,EACIya,IACCpb,GAAWob,EAAQ1d,CAAM,CAAC,EACrB0d,EAAQ1d,CAAM,EAAE,KAAK,KAAMgD,CAAG,EAC9B0a,EAAQ1d,CAAM,GAE5B,OAAO,KAAK,OACRiD,GAAU,KAAK,WAAW,EAAE,SAASjD,EAAQ,KAAMuW,GAAYvT,CAAG,CAAC,CACvE,CACJ,CAEA,SAAS4a,IAAQ,CACb,OAAO,IAAIpc,EAAO,IAAI,CAC1B,CAEA,SAASqc,GAAQhf,EAAO6G,EAAO,CAC3B,IAAIoY,EAAapc,GAAS7C,CAAK,EAAIA,EAAQ0X,GAAY1X,CAAK,EAC5D,OAAM,KAAK,QAAQ,GAAKif,EAAW,QAAQ,GAG3CpY,EAAQD,EAAeC,CAAK,GAAK,cAC7BA,IAAU,cACH,KAAK,QAAQ,EAAIoY,EAAW,QAAQ,EAEpCA,EAAW,QAAQ,EAAI,KAAK,MAAM,EAAE,QAAQpY,CAAK,EAAE,QAAQ,GAN3D,EAQf,CAEA,SAASqY,GAASlf,EAAO6G,EAAO,CAC5B,IAAIoY,EAAapc,GAAS7C,CAAK,EAAIA,EAAQ0X,GAAY1X,CAAK,EAC5D,OAAM,KAAK,QAAQ,GAAKif,EAAW,QAAQ,GAG3CpY,EAAQD,EAAeC,CAAK,GAAK,cAC7BA,IAAU,cACH,KAAK,QAAQ,EAAIoY,EAAW,QAAQ,EAEpC,KAAK,MAAM,EAAE,MAAMpY,CAAK,EAAE,QAAQ,EAAIoY,EAAW,QAAQ,GANzD,EAQf,CAEA,SAASE,GAAU5c,EAAMD,EAAIuE,EAAOuY,EAAa,CAC7C,IAAIC,EAAYxc,GAASN,CAAI,EAAIA,EAAOmV,GAAYnV,CAAI,EACpD+c,EAAUzc,GAASP,CAAE,EAAIA,EAAKoV,GAAYpV,CAAE,EAChD,OAAM,KAAK,QAAQ,GAAK+c,EAAU,QAAQ,GAAKC,EAAQ,QAAQ,GAG/DF,EAAcA,GAAe,MAExBA,EAAY,CAAC,IAAM,IACd,KAAK,QAAQC,EAAWxY,CAAK,EAC7B,CAAC,KAAK,SAASwY,EAAWxY,CAAK,KACpCuY,EAAY,CAAC,IAAM,IACd,KAAK,SAASE,EAASzY,CAAK,EAC5B,CAAC,KAAK,QAAQyY,EAASzY,CAAK,IAT3B,EAWf,CAEA,SAAS0Y,GAAOvf,EAAO6G,EAAO,CAC1B,IAAIoY,EAAapc,GAAS7C,CAAK,EAAIA,EAAQ0X,GAAY1X,CAAK,EACxDwf,EACJ,OAAM,KAAK,QAAQ,GAAKP,EAAW,QAAQ,GAG3CpY,EAAQD,EAAeC,CAAK,GAAK,cAC7BA,IAAU,cACH,KAAK,QAAQ,IAAMoY,EAAW,QAAQ,GAE7CO,EAAUP,EAAW,QAAQ,EAEzB,KAAK,MAAM,EAAE,QAAQpY,CAAK,EAAE,QAAQ,GAAK2Y,GACzCA,GAAW,KAAK,MAAM,EAAE,MAAM3Y,CAAK,EAAE,QAAQ,IAT1C,EAYf,CAEA,SAAS4Y,GAAczf,EAAO6G,EAAO,CACjC,OAAO,KAAK,OAAO7G,EAAO6G,CAAK,GAAK,KAAK,QAAQ7G,EAAO6G,CAAK,CACjE,CAEA,SAAS6Y,GAAe1f,EAAO6G,EAAO,CAClC,OAAO,KAAK,OAAO7G,EAAO6G,CAAK,GAAK,KAAK,SAAS7G,EAAO6G,CAAK,CAClE,CAEA,SAASH,GAAK1G,EAAO6G,EAAO8Y,EAAS,CACjC,IAAIC,EAAMC,EAAWzb,EAErB,GAAI,CAAC,KAAK,QAAQ,EACd,MAAO,KAKX,GAFAwb,EAAOrE,GAAgBvb,EAAO,IAAI,EAE9B,CAAC4f,EAAK,QAAQ,EACd,MAAO,KAOX,OAJAC,GAAaD,EAAK,UAAU,EAAI,KAAK,UAAU,GAAK,IAEpD/Y,EAAQD,EAAeC,CAAK,EAEpBA,EAAO,CACX,IAAK,OACDzC,EAAS0b,GAAU,KAAMF,CAAI,EAAI,GACjC,MACJ,IAAK,QACDxb,EAAS0b,GAAU,KAAMF,CAAI,EAC7B,MACJ,IAAK,UACDxb,EAAS0b,GAAU,KAAMF,CAAI,EAAI,EACjC,MACJ,IAAK,SACDxb,GAAU,KAAOwb,GAAQ,IACzB,MACJ,IAAK,SACDxb,GAAU,KAAOwb,GAAQ,IACzB,MACJ,IAAK,OACDxb,GAAU,KAAOwb,GAAQ,KACzB,MACJ,IAAK,MACDxb,GAAU,KAAOwb,EAAOC,GAAa,MACrC,MACJ,IAAK,OACDzb,GAAU,KAAOwb,EAAOC,GAAa,OACrC,MACJ,QACIzb,EAAS,KAAOwb,CACxB,CAEA,OAAOD,EAAUvb,EAASoF,GAASpF,CAAM,CAC7C,CAEA,SAAS0b,GAAU3f,EAAGC,EAAG,CACrB,GAAID,EAAE,KAAK,EAAIC,EAAE,KAAK,EAGlB,MAAO,CAAC0f,GAAU1f,EAAGD,CAAC,EAG1B,IAAI4f,GAAkB3f,EAAE,KAAK,EAAID,EAAE,KAAK,GAAK,IAAMC,EAAE,MAAM,EAAID,EAAE,MAAM,GAEnE6f,EAAS7f,EAAE,MAAM,EAAE,IAAI4f,EAAgB,QAAQ,EAC/CE,EACAC,EAEJ,OAAI9f,EAAI4f,EAAS,GACbC,EAAU9f,EAAE,MAAM,EAAE,IAAI4f,EAAiB,EAAG,QAAQ,EAEpDG,GAAU9f,EAAI4f,IAAWA,EAASC,KAElCA,EAAU9f,EAAE,MAAM,EAAE,IAAI4f,EAAiB,EAAG,QAAQ,EAEpDG,GAAU9f,EAAI4f,IAAWC,EAAUD,IAIhC,EAAED,EAAiBG,IAAW,CACzC,CAEAtgB,EAAM,cAAgB,uBACtBA,EAAM,iBAAmB,yBAEzB,SAASugB,IAAW,CAChB,OAAO,KAAK,MAAM,EAAE,OAAO,IAAI,EAAE,OAAO,kCAAkC,CAC9E,CAEA,SAASC,GAAYC,EAAY,CAC7B,GAAI,CAAC,KAAK,QAAQ,EACd,OAAO,KAEX,IAAIC,EAAMD,IAAe,GACrB5e,EAAI6e,EAAM,KAAK,MAAM,EAAE,IAAI,EAAI,KACnC,OAAI7e,EAAE,KAAK,EAAI,GAAKA,EAAE,KAAK,EAAI,KACpBgE,GACHhE,EACA6e,EACM,iCACA,8BACV,EAEA7c,GAAW,KAAK,UAAU,WAAW,EAEjC6c,EACO,KAAK,OAAO,EAAE,YAAY,EAE1B,IAAI,KAAK,KAAK,QAAQ,EAAI,KAAK,UAAU,EAAI,GAAK,GAAI,EACxD,YAAY,EACZ,QAAQ,IAAK7a,GAAahE,EAAG,GAAG,CAAC,EAGvCgE,GACHhE,EACA6e,EAAM,+BAAiC,4BAC3C,CACJ,CAQA,SAASC,IAAU,CACf,GAAI,CAAC,KAAK,QAAQ,EACd,MAAO,qBAAuB,KAAK,GAAK,OAE5C,IAAInb,EAAO,SACPob,EAAO,GACPC,EACAtW,EACAuW,EACAC,EACJ,OAAK,KAAK,QAAQ,IACdvb,EAAO,KAAK,UAAU,IAAM,EAAI,aAAe,mBAC/Cob,EAAO,KAEXC,EAAS,IAAMrb,EAAO,MACtB+E,EAAO,GAAK,KAAK,KAAK,GAAK,KAAK,KAAK,GAAK,KAAO,OAAS,SAC1DuW,EAAW,wBACXC,EAASH,EAAO,OAET,KAAK,OAAOC,EAAStW,EAAOuW,EAAWC,CAAM,CACxD,CAEA,SAASxf,GAAOyf,EAAa,CACpBA,IACDA,EAAc,KAAK,MAAM,EACnBhhB,EAAM,iBACNA,EAAM,eAEhB,IAAIwE,EAASqB,GAAa,KAAMmb,CAAW,EAC3C,OAAO,KAAK,WAAW,EAAE,WAAWxc,CAAM,CAC9C,CAEA,SAAS7B,GAAKqc,EAAMtY,EAAe,CAC/B,OACI,KAAK,QAAQ,IACXzD,GAAS+b,CAAI,GAAKA,EAAK,QAAQ,GAAMlH,GAAYkH,CAAI,EAAE,QAAQ,GAE1D/E,GAAe,CAAE,GAAI,KAAM,KAAM+E,CAAK,CAAC,EACzC,OAAO,KAAK,OAAO,CAAC,EACpB,SAAS,CAACtY,CAAa,EAErB,KAAK,WAAW,EAAE,YAAY,CAE7C,CAEA,SAASua,GAAQva,EAAe,CAC5B,OAAO,KAAK,KAAKoR,GAAY,EAAGpR,CAAa,CACjD,CAEA,SAAShE,GAAGsc,EAAMtY,EAAe,CAC7B,OACI,KAAK,QAAQ,IACXzD,GAAS+b,CAAI,GAAKA,EAAK,QAAQ,GAAMlH,GAAYkH,CAAI,EAAE,QAAQ,GAE1D/E,GAAe,CAAE,KAAM,KAAM,GAAI+E,CAAK,CAAC,EACzC,OAAO,KAAK,OAAO,CAAC,EACpB,SAAS,CAACtY,CAAa,EAErB,KAAK,WAAW,EAAE,YAAY,CAE7C,CAEA,SAASwa,GAAMxa,EAAe,CAC1B,OAAO,KAAK,GAAGoR,GAAY,EAAGpR,CAAa,CAC/C,CAKA,SAASlF,GAAOgC,EAAK,CACjB,IAAI2d,EAEJ,OAAI3d,IAAQ,OACD,KAAK,QAAQ,OAEpB2d,EAAgBlN,GAAUzQ,CAAG,EACzB2d,GAAiB,OACjB,KAAK,QAAUA,GAEZ,KAEf,CAEA,IAAIC,GAAOhe,GACP,kJACA,SAAUI,EAAK,CACX,OAAIA,IAAQ,OACD,KAAK,WAAW,EAEhB,KAAK,OAAOA,CAAG,CAE9B,CACJ,EAEA,SAAS0F,IAAa,CAClB,OAAO,KAAK,OAChB,CAEA,IAAImY,GAAgB,IAChBC,GAAgB,GAAKD,GACrBE,GAAc,GAAKD,GACnBE,IAAoB,IAAM,IAAM,IAAM,GAAKD,GAG/C,SAASE,GAAMC,EAAUC,EAAS,CAC9B,OAASD,EAAWC,EAAWA,GAAWA,CAC9C,CAEA,SAASC,GAAiB3W,EAAGpJ,EAAG6J,EAAG,CAE/B,OAAIT,EAAI,KAAOA,GAAK,EAET,IAAI,KAAKA,EAAI,IAAKpJ,EAAG6J,CAAC,EAAI8V,GAE1B,IAAI,KAAKvW,EAAGpJ,EAAG6J,CAAC,EAAE,QAAQ,CAEzC,CAEA,SAASmW,GAAe5W,EAAGpJ,EAAG6J,EAAG,CAE7B,OAAIT,EAAI,KAAOA,GAAK,EAET,KAAK,IAAIA,EAAI,IAAKpJ,EAAG6J,CAAC,EAAI8V,GAE1B,KAAK,IAAIvW,EAAGpJ,EAAG6J,CAAC,CAE/B,CAEA,SAASoW,GAAQ7a,EAAO,CACpB,IAAI+X,EAAM+C,EAEV,GADA9a,EAAQD,EAAeC,CAAK,EACxBA,IAAU,QAAaA,IAAU,eAAiB,CAAC,KAAK,QAAQ,EAChE,OAAO,KAKX,OAFA8a,EAAc,KAAK,OAASF,GAAiBD,GAErC3a,EAAO,CACX,IAAK,OACD+X,EAAO+C,EAAY,KAAK,KAAK,EAAG,EAAG,CAAC,EACpC,MACJ,IAAK,UACD/C,EAAO+C,EACH,KAAK,KAAK,EACV,KAAK,MAAM,EAAK,KAAK,MAAM,EAAI,EAC/B,CACJ,EACA,MACJ,IAAK,QACD/C,EAAO+C,EAAY,KAAK,KAAK,EAAG,KAAK,MAAM,EAAG,CAAC,EAC/C,MACJ,IAAK,OACD/C,EAAO+C,EACH,KAAK,KAAK,EACV,KAAK,MAAM,EACX,KAAK,KAAK,EAAI,KAAK,QAAQ,CAC/B,EACA,MACJ,IAAK,UACD/C,EAAO+C,EACH,KAAK,KAAK,EACV,KAAK,MAAM,EACX,KAAK,KAAK,GAAK,KAAK,WAAW,EAAI,EACvC,EACA,MACJ,IAAK,MACL,IAAK,OACD/C,EAAO+C,EAAY,KAAK,KAAK,EAAG,KAAK,MAAM,EAAG,KAAK,KAAK,CAAC,EACzD,MACJ,IAAK,OACD/C,EAAO,KAAK,GAAG,QAAQ,EACvBA,GAAQyC,GACJzC,GAAQ,KAAK,OAAS,EAAI,KAAK,UAAU,EAAIsC,IAC7CC,EACJ,EACA,MACJ,IAAK,SACDvC,EAAO,KAAK,GAAG,QAAQ,EACvBA,GAAQyC,GAAMzC,EAAMsC,EAAa,EACjC,MACJ,IAAK,SACDtC,EAAO,KAAK,GAAG,QAAQ,EACvBA,GAAQyC,GAAMzC,EAAMqC,EAAa,EACjC,KACR,CAEA,YAAK,GAAG,QAAQrC,CAAI,EACpBhf,EAAM,aAAa,KAAM,EAAI,EACtB,IACX,CAEA,SAASgiB,GAAM/a,EAAO,CAClB,IAAI+X,EAAM+C,EAEV,GADA9a,EAAQD,EAAeC,CAAK,EACxBA,IAAU,QAAaA,IAAU,eAAiB,CAAC,KAAK,QAAQ,EAChE,OAAO,KAKX,OAFA8a,EAAc,KAAK,OAASF,GAAiBD,GAErC3a,EAAO,CACX,IAAK,OACD+X,EAAO+C,EAAY,KAAK,KAAK,EAAI,EAAG,EAAG,CAAC,EAAI,EAC5C,MACJ,IAAK,UACD/C,EACI+C,EACI,KAAK,KAAK,EACV,KAAK,MAAM,EAAK,KAAK,MAAM,EAAI,EAAK,EACpC,CACJ,EAAI,EACR,MACJ,IAAK,QACD/C,EAAO+C,EAAY,KAAK,KAAK,EAAG,KAAK,MAAM,EAAI,EAAG,CAAC,EAAI,EACvD,MACJ,IAAK,OACD/C,EACI+C,EACI,KAAK,KAAK,EACV,KAAK,MAAM,EACX,KAAK,KAAK,EAAI,KAAK,QAAQ,EAAI,CACnC,EAAI,EACR,MACJ,IAAK,UACD/C,EACI+C,EACI,KAAK,KAAK,EACV,KAAK,MAAM,EACX,KAAK,KAAK,GAAK,KAAK,WAAW,EAAI,GAAK,CAC5C,EAAI,EACR,MACJ,IAAK,MACL,IAAK,OACD/C,EAAO+C,EAAY,KAAK,KAAK,EAAG,KAAK,MAAM,EAAG,KAAK,KAAK,EAAI,CAAC,EAAI,EACjE,MACJ,IAAK,OACD/C,EAAO,KAAK,GAAG,QAAQ,EACvBA,GACIuC,GACAE,GACIzC,GAAQ,KAAK,OAAS,EAAI,KAAK,UAAU,EAAIsC,IAC7CC,EACJ,EACA,EACJ,MACJ,IAAK,SACDvC,EAAO,KAAK,GAAG,QAAQ,EACvBA,GAAQsC,GAAgBG,GAAMzC,EAAMsC,EAAa,EAAI,EACrD,MACJ,IAAK,SACDtC,EAAO,KAAK,GAAG,QAAQ,EACvBA,GAAQqC,GAAgBI,GAAMzC,EAAMqC,EAAa,EAAI,EACrD,KACR,CAEA,YAAK,GAAG,QAAQrC,CAAI,EACpBhf,EAAM,aAAa,KAAM,EAAI,EACtB,IACX,CAEA,SAASiiB,IAAU,CACf,OAAO,KAAK,GAAG,QAAQ,GAAK,KAAK,SAAW,GAAK,GACrD,CAEA,SAASC,IAAO,CACZ,OAAO,KAAK,MAAM,KAAK,QAAQ,EAAI,GAAI,CAC3C,CAEA,SAASC,IAAS,CACd,OAAO,IAAI,KAAK,KAAK,QAAQ,CAAC,CAClC,CAEA,SAASC,IAAU,CACf,IAAIvgB,EAAI,KACR,MAAO,CACHA,EAAE,KAAK,EACPA,EAAE,MAAM,EACRA,EAAE,KAAK,EACPA,EAAE,KAAK,EACPA,EAAE,OAAO,EACTA,EAAE,OAAO,EACTA,EAAE,YAAY,CAClB,CACJ,CAEA,SAASwgB,IAAW,CAChB,IAAIxgB,EAAI,KACR,MAAO,CACH,MAAOA,EAAE,KAAK,EACd,OAAQA,EAAE,MAAM,EAChB,KAAMA,EAAE,KAAK,EACb,MAAOA,EAAE,MAAM,EACf,QAASA,EAAE,QAAQ,EACnB,QAASA,EAAE,QAAQ,EACnB,aAAcA,EAAE,aAAa,CACjC,CACJ,CAEA,SAASygB,IAAS,CAEd,OAAO,KAAK,QAAQ,EAAI,KAAK,YAAY,EAAI,IACjD,CAEA,SAASC,IAAY,CACjB,OAAOrgB,EAAQ,IAAI,CACvB,CAEA,SAASsgB,IAAe,CACpB,OAAOnhB,EAAO,CAAC,EAAGO,EAAgB,IAAI,CAAC,CAC3C,CAEA,SAAS6gB,IAAY,CACjB,OAAO7gB,EAAgB,IAAI,EAAE,QACjC,CAEA,SAAS8gB,IAAe,CACpB,MAAO,CACH,MAAO,KAAK,GACZ,OAAQ,KAAK,GACb,OAAQ,KAAK,QACb,MAAO,KAAK,OACZ,OAAQ,KAAK,OACjB,CACJ,CAEAtd,EAAe,IAAK,EAAG,EAAG,SAAS,EACnCA,EAAe,KAAM,EAAG,EAAG,SAAS,EACpCA,EAAe,MAAO,EAAG,EAAG,SAAS,EACrCA,EAAe,OAAQ,EAAG,EAAG,SAAS,EACtCA,EAAe,QAAS,EAAG,EAAG,WAAW,EAEzCA,EAAe,IAAK,CAAC,IAAK,CAAC,EAAG,KAAM,SAAS,EAC7CA,EAAe,IAAK,CAAC,KAAM,CAAC,EAAG,EAAG,SAAS,EAC3CA,EAAe,IAAK,CAAC,MAAO,CAAC,EAAG,EAAG,SAAS,EAC5CA,EAAe,IAAK,CAAC,OAAQ,CAAC,EAAG,EAAG,SAAS,EAE7C0D,EAAc,IAAK6Z,EAAY,EAC/B7Z,EAAc,KAAM6Z,EAAY,EAChC7Z,EAAc,MAAO6Z,EAAY,EACjC7Z,EAAc,OAAQ8Z,EAAY,EAClC9Z,EAAc,QAAS+Z,EAAc,EAErC3Y,GACI,CAAC,IAAK,KAAM,MAAO,OAAQ,OAAO,EAClC,SAAU9J,EAAOuF,EAAO3C,EAAQqC,EAAO,CACnC,IAAI6S,EAAMlV,EAAO,QAAQ,UAAU5C,EAAOiF,EAAOrC,EAAO,OAAO,EAC3DkV,EACAtW,EAAgBoB,CAAM,EAAE,IAAMkV,EAE9BtW,EAAgBoB,CAAM,EAAE,WAAa5C,CAE7C,CACJ,EAEA0I,EAAc,IAAKT,EAAa,EAChCS,EAAc,KAAMT,EAAa,EACjCS,EAAc,MAAOT,EAAa,EAClCS,EAAc,OAAQT,EAAa,EACnCS,EAAc,KAAMga,EAAmB,EAEvC5Y,GAAc,CAAC,IAAK,KAAM,MAAO,MAAM,EAAGM,EAAI,EAC9CN,GAAc,CAAC,IAAI,EAAG,SAAU9J,EAAOuF,EAAO3C,EAAQqC,EAAO,CACzD,IAAI6P,EACAlS,EAAO,QAAQ,uBACfkS,EAAQ9U,EAAM,MAAM4C,EAAO,QAAQ,oBAAoB,GAGvDA,EAAO,QAAQ,oBACf2C,EAAM6E,EAAI,EAAIxH,EAAO,QAAQ,oBAAoB5C,EAAO8U,CAAK,EAE7DvP,EAAM6E,EAAI,EAAI,SAASpK,EAAO,EAAE,CAExC,CAAC,EAED,SAAS2iB,GAAWlhB,EAAGN,EAAQ,CAC3B,IAAIJ,EACA8T,EACApJ,EACAmX,EAAO,KAAK,OAAS/O,GAAU,IAAI,EAAE,MACzC,IAAK9S,EAAI,EAAG8T,EAAI+N,EAAK,OAAQ7hB,EAAI8T,EAAG,EAAE9T,EAAG,CACrC,OAAQ,OAAO6hB,EAAK7hB,CAAC,EAAE,MAAO,CAC1B,IAAK,SAED0K,EAAO7L,EAAMgjB,EAAK7hB,CAAC,EAAE,KAAK,EAAE,QAAQ,KAAK,EACzC6hB,EAAK7hB,CAAC,EAAE,MAAQ0K,EAAK,QAAQ,EAC7B,KACR,CAEA,OAAQ,OAAOmX,EAAK7hB,CAAC,EAAE,MAAO,CAC1B,IAAK,YACD6hB,EAAK7hB,CAAC,EAAE,MAAQ,IAChB,MACJ,IAAK,SAED0K,EAAO7L,EAAMgjB,EAAK7hB,CAAC,EAAE,KAAK,EAAE,QAAQ,KAAK,EAAE,QAAQ,EACnD6hB,EAAK7hB,CAAC,EAAE,MAAQ0K,EAAK,QAAQ,EAC7B,KACR,CACJ,CACA,OAAOmX,CACX,CAEA,SAASC,GAAgBC,EAAS3hB,EAAQE,EAAQ,CAC9C,IAAIN,EACA8T,EACA+N,EAAO,KAAK,KAAK,EACjBpf,EACAuf,EACAC,GAGJ,IAFAF,EAAUA,EAAQ,YAAY,EAEzB/hB,EAAI,EAAG8T,EAAI+N,EAAK,OAAQ7hB,EAAI8T,EAAG,EAAE9T,EAKlC,GAJAyC,EAAOof,EAAK7hB,CAAC,EAAE,KAAK,YAAY,EAChCgiB,EAAOH,EAAK7hB,CAAC,EAAE,KAAK,YAAY,EAChCiiB,GAASJ,EAAK7hB,CAAC,EAAE,OAAO,YAAY,EAEhCM,EACA,OAAQF,EAAQ,CACZ,IAAK,IACL,IAAK,KACL,IAAK,MACD,GAAI4hB,IAASD,EACT,OAAOF,EAAK7hB,CAAC,EAEjB,MAEJ,IAAK,OACD,GAAIyC,IAASsf,EACT,OAAOF,EAAK7hB,CAAC,EAEjB,MAEJ,IAAK,QACD,GAAIiiB,KAAWF,EACX,OAAOF,EAAK7hB,CAAC,EAEjB,KACR,SACO,CAACyC,EAAMuf,EAAMC,EAAM,EAAE,QAAQF,CAAO,GAAK,EAChD,OAAOF,EAAK7hB,CAAC,CAGzB,CAEA,SAASkiB,GAAsBnL,EAAK3N,EAAM,CACtC,IAAI+Y,EAAMpL,EAAI,OAASA,EAAI,MAAQ,EAAK,GACxC,OAAI3N,IAAS,OACFvK,EAAMkY,EAAI,KAAK,EAAE,KAAK,EAEtBlY,EAAMkY,EAAI,KAAK,EAAE,KAAK,GAAK3N,EAAO2N,EAAI,QAAUoL,CAE/D,CAEA,SAASC,IAAa,CAClB,IAAIpiB,EACA8T,EACApS,EACAmgB,EAAO,KAAK,WAAW,EAAE,KAAK,EAClC,IAAK7hB,EAAI,EAAG8T,EAAI+N,EAAK,OAAQ7hB,EAAI8T,EAAG,EAAE9T,EAOlC,GALA0B,EAAM,KAAK,MAAM,EAAE,QAAQ,KAAK,EAAE,QAAQ,EAEtCmgB,EAAK7hB,CAAC,EAAE,OAAS0B,GAAOA,GAAOmgB,EAAK7hB,CAAC,EAAE,OAGvC6hB,EAAK7hB,CAAC,EAAE,OAAS0B,GAAOA,GAAOmgB,EAAK7hB,CAAC,EAAE,MACvC,OAAO6hB,EAAK7hB,CAAC,EAAE,KAIvB,MAAO,EACX,CAEA,SAASqiB,IAAe,CACpB,IAAIriB,EACA8T,EACApS,EACAmgB,EAAO,KAAK,WAAW,EAAE,KAAK,EAClC,IAAK7hB,EAAI,EAAG8T,EAAI+N,EAAK,OAAQ7hB,EAAI8T,EAAG,EAAE9T,EAOlC,GALA0B,EAAM,KAAK,MAAM,EAAE,QAAQ,KAAK,EAAE,QAAQ,EAEtCmgB,EAAK7hB,CAAC,EAAE,OAAS0B,GAAOA,GAAOmgB,EAAK7hB,CAAC,EAAE,OAGvC6hB,EAAK7hB,CAAC,EAAE,OAAS0B,GAAOA,GAAOmgB,EAAK7hB,CAAC,EAAE,MACvC,OAAO6hB,EAAK7hB,CAAC,EAAE,OAIvB,MAAO,EACX,CAEA,SAASsiB,IAAa,CAClB,IAAItiB,EACA8T,EACApS,EACAmgB,EAAO,KAAK,WAAW,EAAE,KAAK,EAClC,IAAK7hB,EAAI,EAAG8T,EAAI+N,EAAK,OAAQ7hB,EAAI8T,EAAG,EAAE9T,EAOlC,GALA0B,EAAM,KAAK,MAAM,EAAE,QAAQ,KAAK,EAAE,QAAQ,EAEtCmgB,EAAK7hB,CAAC,EAAE,OAAS0B,GAAOA,GAAOmgB,EAAK7hB,CAAC,EAAE,OAGvC6hB,EAAK7hB,CAAC,EAAE,OAAS0B,GAAOA,GAAOmgB,EAAK7hB,CAAC,EAAE,MACvC,OAAO6hB,EAAK7hB,CAAC,EAAE,KAIvB,MAAO,EACX,CAEA,SAASuiB,IAAa,CAClB,IAAIviB,EACA8T,EACAqO,EACAzgB,EACAmgB,EAAO,KAAK,WAAW,EAAE,KAAK,EAClC,IAAK7hB,EAAI,EAAG8T,EAAI+N,EAAK,OAAQ7hB,EAAI8T,EAAG,EAAE9T,EAMlC,GALAmiB,EAAMN,EAAK7hB,CAAC,EAAE,OAAS6hB,EAAK7hB,CAAC,EAAE,MAAQ,EAAK,GAG5C0B,EAAM,KAAK,MAAM,EAAE,QAAQ,KAAK,EAAE,QAAQ,EAGrCmgB,EAAK7hB,CAAC,EAAE,OAAS0B,GAAOA,GAAOmgB,EAAK7hB,CAAC,EAAE,OACvC6hB,EAAK7hB,CAAC,EAAE,OAAS0B,GAAOA,GAAOmgB,EAAK7hB,CAAC,EAAE,MAExC,OACK,KAAK,KAAK,EAAInB,EAAMgjB,EAAK7hB,CAAC,EAAE,KAAK,EAAE,KAAK,GAAKmiB,EAC9CN,EAAK7hB,CAAC,EAAE,OAKpB,OAAO,KAAK,KAAK,CACrB,CAEA,SAASwiB,GAAc1a,EAAU,CAC7B,OAAK3I,EAAW,KAAM,gBAAgB,GAClCsjB,GAAiB,KAAK,IAAI,EAEvB3a,EAAW,KAAK,eAAiB,KAAK,UACjD,CAEA,SAAS4a,GAAc5a,EAAU,CAC7B,OAAK3I,EAAW,KAAM,gBAAgB,GAClCsjB,GAAiB,KAAK,IAAI,EAEvB3a,EAAW,KAAK,eAAiB,KAAK,UACjD,CAEA,SAAS6a,GAAgB7a,EAAU,CAC/B,OAAK3I,EAAW,KAAM,kBAAkB,GACpCsjB,GAAiB,KAAK,IAAI,EAEvB3a,EAAW,KAAK,iBAAmB,KAAK,UACnD,CAEA,SAAS0Z,GAAa1Z,EAAUzH,EAAQ,CACpC,OAAOA,EAAO,cAAcyH,CAAQ,CACxC,CAEA,SAAS2Z,GAAa3Z,EAAUzH,EAAQ,CACpC,OAAOA,EAAO,cAAcyH,CAAQ,CACxC,CAEA,SAAS4Z,GAAe5Z,EAAUzH,EAAQ,CACtC,OAAOA,EAAO,gBAAgByH,CAAQ,CAC1C,CAEA,SAAS6Z,GAAoB7Z,EAAUzH,EAAQ,CAC3C,OAAOA,EAAO,sBAAwB6G,EAC1C,CAEA,SAASub,IAAmB,CACxB,IAAIG,EAAa,CAAC,EACdC,EAAa,CAAC,EACdC,EAAe,CAAC,EAChBnW,EAAc,CAAC,EACf3M,EACA8T,EACAiP,EACAC,EACAC,GACApB,GAAO,KAAK,KAAK,EAErB,IAAK7hB,EAAI,EAAG8T,EAAI+N,GAAK,OAAQ7hB,EAAI8T,EAAG,EAAE9T,EAClC+iB,EAAW5a,GAAY0Z,GAAK7hB,CAAC,EAAE,IAAI,EACnCgjB,EAAW7a,GAAY0Z,GAAK7hB,CAAC,EAAE,IAAI,EACnCijB,GAAa9a,GAAY0Z,GAAK7hB,CAAC,EAAE,MAAM,EAEvC6iB,EAAW,KAAKE,CAAQ,EACxBH,EAAW,KAAKI,CAAQ,EACxBF,EAAa,KAAKG,EAAU,EAC5BtW,EAAY,KAAKoW,CAAQ,EACzBpW,EAAY,KAAKqW,CAAQ,EACzBrW,EAAY,KAAKsW,EAAU,EAG/B,KAAK,WAAa,IAAI,OAAO,KAAOtW,EAAY,KAAK,GAAG,EAAI,IAAK,GAAG,EACpE,KAAK,eAAiB,IAAI,OAAO,KAAOkW,EAAW,KAAK,GAAG,EAAI,IAAK,GAAG,EACvE,KAAK,eAAiB,IAAI,OAAO,KAAOD,EAAW,KAAK,GAAG,EAAI,IAAK,GAAG,EACvE,KAAK,iBAAmB,IAAI,OACxB,KAAOE,EAAa,KAAK,GAAG,EAAI,IAChC,GACJ,CACJ,CAIA7e,EAAe,EAAG,CAAC,KAAM,CAAC,EAAG,EAAG,UAAY,CACxC,OAAO,KAAK,SAAS,EAAI,GAC7B,CAAC,EAEDA,EAAe,EAAG,CAAC,KAAM,CAAC,EAAG,EAAG,UAAY,CACxC,OAAO,KAAK,YAAY,EAAI,GAChC,CAAC,EAED,SAASif,GAAuBhf,EAAOif,EAAQ,CAC3Clf,EAAe,EAAG,CAACC,EAAOA,EAAM,MAAM,EAAG,EAAGif,CAAM,CACtD,CAEAD,GAAuB,OAAQ,UAAU,EACzCA,GAAuB,QAAS,UAAU,EAC1CA,GAAuB,OAAQ,aAAa,EAC5CA,GAAuB,QAAS,aAAa,EAM7Cvb,EAAc,IAAKR,EAAW,EAC9BQ,EAAc,IAAKR,EAAW,EAC9BQ,EAAc,KAAMf,GAAWJ,EAAM,EACrCmB,EAAc,KAAMf,GAAWJ,EAAM,EACrCmB,EAAc,OAAQX,GAAWN,EAAM,EACvCiB,EAAc,OAAQX,GAAWN,EAAM,EACvCiB,EAAc,QAASV,GAAWN,EAAM,EACxCgB,EAAc,QAASV,GAAWN,EAAM,EAExCsC,GACI,CAAC,OAAQ,QAAS,OAAQ,OAAO,EACjC,SAAUhK,EAAOwO,EAAM5L,EAAQqC,EAAO,CAClCuJ,EAAKvJ,EAAM,OAAO,EAAG,CAAC,CAAC,EAAIwE,GAAMzJ,CAAK,CAC1C,CACJ,EAEAgK,GAAkB,CAAC,KAAM,IAAI,EAAG,SAAUhK,EAAOwO,EAAM5L,EAAQqC,EAAO,CAClEuJ,EAAKvJ,CAAK,EAAIrF,EAAM,kBAAkBI,CAAK,CAC/C,CAAC,EAID,SAASmkB,GAAenkB,EAAO,CAC3B,OAAOokB,GAAqB,KACxB,KACApkB,EACA,KAAK,KAAK,EACV,KAAK,QAAQ,EAAI,KAAK,WAAW,EAAE,MAAM,IACzC,KAAK,WAAW,EAAE,MAAM,IACxB,KAAK,WAAW,EAAE,MAAM,GAC5B,CACJ,CAEA,SAASqkB,GAAkBrkB,EAAO,CAC9B,OAAOokB,GAAqB,KACxB,KACApkB,EACA,KAAK,QAAQ,EACb,KAAK,WAAW,EAChB,EACA,CACJ,CACJ,CAEA,SAASskB,IAAoB,CACzB,OAAOrV,GAAY,KAAK,KAAK,EAAG,EAAG,CAAC,CACxC,CAEA,SAASsV,IAA2B,CAChC,OAAOtV,GAAY,KAAK,YAAY,EAAG,EAAG,CAAC,CAC/C,CAEA,SAASuV,IAAiB,CACtB,IAAIC,EAAW,KAAK,WAAW,EAAE,MACjC,OAAOxV,GAAY,KAAK,KAAK,EAAGwV,EAAS,IAAKA,EAAS,GAAG,CAC9D,CAEA,SAASC,IAAqB,CAC1B,IAAID,EAAW,KAAK,WAAW,EAAE,MACjC,OAAOxV,GAAY,KAAK,SAAS,EAAGwV,EAAS,IAAKA,EAAS,GAAG,CAClE,CAEA,SAASL,GAAqBpkB,EAAOwO,EAAMC,EAASN,EAAKC,EAAK,CAC1D,IAAIuW,EACJ,OAAI3kB,GAAS,KACF+O,GAAW,KAAMZ,EAAKC,CAAG,EAAE,MAElCuW,EAAc1V,GAAYjP,EAAOmO,EAAKC,CAAG,EACrCI,EAAOmW,IACPnW,EAAOmW,GAEJC,GAAW,KAAK,KAAM5kB,EAAOwO,EAAMC,EAASN,EAAKC,CAAG,EAEnE,CAEA,SAASwW,GAAWtN,EAAU9I,EAAMC,EAASN,EAAKC,EAAK,CACnD,IAAIyW,EAAgBtW,GAAmB+I,EAAU9I,EAAMC,EAASN,EAAKC,CAAG,EACpE3C,EAAOwC,GAAc4W,EAAc,KAAM,EAAGA,EAAc,SAAS,EAEvE,YAAK,KAAKpZ,EAAK,eAAe,CAAC,EAC/B,KAAK,MAAMA,EAAK,YAAY,CAAC,EAC7B,KAAK,KAAKA,EAAK,WAAW,CAAC,EACpB,IACX,CAIAzG,EAAe,IAAK,EAAG,KAAM,SAAS,EAItC0D,EAAc,IAAKpB,EAAM,EACzBwC,GAAc,IAAK,SAAU9J,EAAOuF,EAAO,CACvCA,EAAM8E,EAAK,GAAKZ,GAAMzJ,CAAK,EAAI,GAAK,CACxC,CAAC,EAID,SAAS8kB,GAAc9kB,EAAO,CAC1B,OAAOA,GAAS,KACV,KAAK,MAAM,KAAK,MAAM,EAAI,GAAK,CAAC,EAChC,KAAK,OAAOA,EAAQ,GAAK,EAAK,KAAK,MAAM,EAAI,CAAE,CACzD,CAIAgF,EAAe,IAAK,CAAC,KAAM,CAAC,EAAG,KAAM,MAAM,EAI3C0D,EAAc,IAAKf,GAAWY,EAAsB,EACpDG,EAAc,KAAMf,GAAWJ,EAAM,EACrCmB,EAAc,KAAM,SAAUG,EAAUzH,EAAQ,CAE5C,OAAOyH,EACDzH,EAAO,yBAA2BA,EAAO,cACzCA,EAAO,8BACjB,CAAC,EAED0I,GAAc,CAAC,IAAK,IAAI,EAAGQ,EAAI,EAC/BR,GAAc,KAAM,SAAU9J,EAAOuF,EAAO,CACxCA,EAAM+E,EAAI,EAAIb,GAAMzJ,EAAM,MAAM2H,EAAS,EAAE,CAAC,CAAC,CACjD,CAAC,EAID,IAAIod,GAAmB/Z,GAAW,OAAQ,EAAI,EAI9ChG,EAAe,MAAO,CAAC,OAAQ,CAAC,EAAG,OAAQ,WAAW,EAItD0D,EAAc,MAAOZ,EAAS,EAC9BY,EAAc,OAAQlB,EAAM,EAC5BsC,GAAc,CAAC,MAAO,MAAM,EAAG,SAAU9J,EAAOuF,EAAO3C,EAAQ,CAC3DA,EAAO,WAAa6G,GAAMzJ,CAAK,CACnC,CAAC,EAMD,SAASglB,GAAgBhlB,EAAO,CAC5B,IAAI4O,EACA,KAAK,OACA,KAAK,MAAM,EAAE,QAAQ,KAAK,EAAI,KAAK,MAAM,EAAE,QAAQ,MAAM,GAAK,KACnE,EAAI,EACR,OAAO5O,GAAS,KAAO4O,EAAY,KAAK,IAAI5O,EAAQ4O,EAAW,GAAG,CACtE,CAIA5J,EAAe,IAAK,CAAC,KAAM,CAAC,EAAG,EAAG,QAAQ,EAI1C0D,EAAc,IAAKf,GAAWa,EAAgB,EAC9CE,EAAc,KAAMf,GAAWJ,EAAM,EACrCuC,GAAc,CAAC,IAAK,IAAI,EAAGU,EAAM,EAIjC,IAAIya,GAAeja,GAAW,UAAW,EAAK,EAI9ChG,EAAe,IAAK,CAAC,KAAM,CAAC,EAAG,EAAG,QAAQ,EAI1C0D,EAAc,IAAKf,GAAWa,EAAgB,EAC9CE,EAAc,KAAMf,GAAWJ,EAAM,EACrCuC,GAAc,CAAC,IAAK,IAAI,EAAGW,EAAM,EAIjC,IAAIya,GAAela,GAAW,UAAW,EAAK,EAI9ChG,EAAe,IAAK,EAAG,EAAG,UAAY,CAClC,MAAO,CAAC,EAAE,KAAK,YAAY,EAAI,IACnC,CAAC,EAEDA,EAAe,EAAG,CAAC,KAAM,CAAC,EAAG,EAAG,UAAY,CACxC,MAAO,CAAC,EAAE,KAAK,YAAY,EAAI,GACnC,CAAC,EAEDA,EAAe,EAAG,CAAC,MAAO,CAAC,EAAG,EAAG,aAAa,EAC9CA,EAAe,EAAG,CAAC,OAAQ,CAAC,EAAG,EAAG,UAAY,CAC1C,OAAO,KAAK,YAAY,EAAI,EAChC,CAAC,EACDA,EAAe,EAAG,CAAC,QAAS,CAAC,EAAG,EAAG,UAAY,CAC3C,OAAO,KAAK,YAAY,EAAI,GAChC,CAAC,EACDA,EAAe,EAAG,CAAC,SAAU,CAAC,EAAG,EAAG,UAAY,CAC5C,OAAO,KAAK,YAAY,EAAI,GAChC,CAAC,EACDA,EAAe,EAAG,CAAC,UAAW,CAAC,EAAG,EAAG,UAAY,CAC7C,OAAO,KAAK,YAAY,EAAI,GAChC,CAAC,EACDA,EAAe,EAAG,CAAC,WAAY,CAAC,EAAG,EAAG,UAAY,CAC9C,OAAO,KAAK,YAAY,EAAI,GAChC,CAAC,EACDA,EAAe,EAAG,CAAC,YAAa,CAAC,EAAG,EAAG,UAAY,CAC/C,OAAO,KAAK,YAAY,EAAI,GAChC,CAAC,EAID0D,EAAc,IAAKZ,GAAWR,EAAM,EACpCoB,EAAc,KAAMZ,GAAWP,EAAM,EACrCmB,EAAc,MAAOZ,GAAWN,EAAM,EAEtC,IAAIvC,GAAOkgB,GACX,IAAKlgB,GAAQ,OAAQA,GAAM,QAAU,EAAGA,IAAS,IAC7CyD,EAAczD,GAAOgD,EAAa,EAGtC,SAASmd,GAAQplB,EAAOuF,EAAO,CAC3BA,EAAMmF,EAAW,EAAIjB,IAAO,KAAOzJ,GAAS,GAAI,CACpD,CAEA,IAAKiF,GAAQ,IAAKA,GAAM,QAAU,EAAGA,IAAS,IAC1C6E,GAAc7E,GAAOmgB,EAAO,EAGhCD,GAAoBna,GAAW,eAAgB,EAAK,EAIpDhG,EAAe,IAAK,EAAG,EAAG,UAAU,EACpCA,EAAe,KAAM,EAAG,EAAG,UAAU,EAIrC,SAASqgB,IAAc,CACnB,OAAO,KAAK,OAAS,MAAQ,EACjC,CAEA,SAASC,IAAc,CACnB,OAAO,KAAK,OAAS,6BAA+B,EACxD,CAEA,IAAIC,EAAQ5iB,EAAO,UAEnB4iB,EAAM,IAAM7H,GACZ6H,EAAM,SAAW5G,GACjB4G,EAAM,MAAQxG,GACdwG,EAAM,KAAO7e,GACb6e,EAAM,MAAQ3D,GACd2D,EAAM,OAASpkB,GACfokB,EAAM,KAAOhjB,GACbgjB,EAAM,QAAU1E,GAChB0E,EAAM,GAAKjjB,GACXijB,EAAM,MAAQzE,GACdyE,EAAM,IAAM7Z,GACZ6Z,EAAM,UAAYlD,GAClBkD,EAAM,QAAUvG,GAChBuG,EAAM,SAAWrG,GACjBqG,EAAM,UAAYpG,GAClBoG,EAAM,OAAShG,GACfgG,EAAM,cAAgB9F,GACtB8F,EAAM,eAAiB7F,GACvB6F,EAAM,QAAUpD,GAChBoD,EAAM,KAAOvE,GACbuE,EAAM,OAASnkB,GACfmkB,EAAM,WAAazc,GACnByc,EAAM,IAAMrM,GACZqM,EAAM,IAAMvM,GACZuM,EAAM,aAAenD,GACrBmD,EAAM,IAAM5Z,GACZ4Z,EAAM,QAAU7D,GAChB6D,EAAM,SAAW5H,GACjB4H,EAAM,QAAUvD,GAChBuD,EAAM,SAAWtD,GACjBsD,EAAM,OAASxD,GACfwD,EAAM,YAAcnF,GACpBmF,EAAM,QAAUhF,GACZ,OAAO,OAAW,KAAe,OAAO,KAAO,OAC/CgF,EAAM,OAAO,IAAI,4BAA4B,CAAC,EAAI,UAAY,CAC1D,MAAO,UAAY,KAAK,OAAO,EAAI,GACvC,GAEJA,EAAM,OAASrD,GACfqD,EAAM,SAAWpF,GACjBoF,EAAM,KAAOzD,GACbyD,EAAM,QAAU1D,GAChB0D,EAAM,aAAejD,GACrBiD,EAAM,QAAUpC,GAChBoC,EAAM,UAAYnC,GAClBmC,EAAM,QAAUlC,GAChBkC,EAAM,QAAUjC,GAChBiC,EAAM,KAAOxa,GACbwa,EAAM,WAAata,GACnBsa,EAAM,SAAWpB,GACjBoB,EAAM,YAAclB,GACpBkB,EAAM,QAAUA,EAAM,SAAWT,GACjCS,EAAM,MAAQrY,GACdqY,EAAM,YAAcpY,GACpBoY,EAAM,KAAOA,EAAM,MAAQhW,GAC3BgW,EAAM,QAAUA,EAAM,SAAW/V,GACjC+V,EAAM,YAAcf,GACpBe,EAAM,gBAAkBb,GACxBa,EAAM,eAAiBjB,GACvBiB,EAAM,sBAAwBhB,GAC9BgB,EAAM,KAAOR,GACbQ,EAAM,IAAMA,EAAM,KAAO7U,EACzB6U,EAAM,QAAU3U,EAChB2U,EAAM,WAAa1U,GACnB0U,EAAM,UAAYP,GAClBO,EAAM,KAAOA,EAAM,MAAQtT,GAC3BsT,EAAM,OAASA,EAAM,QAAUN,GAC/BM,EAAM,OAASA,EAAM,QAAUL,GAC/BK,EAAM,YAAcA,EAAM,aAAeJ,GACzCI,EAAM,UAAY7J,GAClB6J,EAAM,IAAMvJ,GACZuJ,EAAM,MAAQtJ,GACdsJ,EAAM,UAAYrJ,GAClBqJ,EAAM,qBAAuBnJ,GAC7BmJ,EAAM,MAAQlJ,GACdkJ,EAAM,QAAUhJ,GAChBgJ,EAAM,YAAc/I,GACpB+I,EAAM,MAAQ9I,GACd8I,EAAM,MAAQ9I,GACd8I,EAAM,SAAWF,GACjBE,EAAM,SAAWD,GACjBC,EAAM,MAAQviB,GACV,kDACA+hB,EACJ,EACAQ,EAAM,OAASviB,GACX,mDACAkK,EACJ,EACAqY,EAAM,MAAQviB,GACV,iDACA+H,EACJ,EACAwa,EAAM,KAAOviB,GACT,2GACA+Y,EACJ,EACAwJ,EAAM,aAAeviB,GACjB,0GACAsZ,EACJ,EAEA,SAASkJ,GAAWxlB,EAAO,CACvB,OAAO0X,GAAY1X,EAAQ,GAAI,CACnC,CAEA,SAASylB,IAAe,CACpB,OAAO/N,GAAY,MAAM,KAAM,SAAS,EAAE,UAAU,CACxD,CAEA,SAASgO,GAAmBnf,EAAQ,CAChC,OAAOA,CACX,CAEA,IAAIof,GAAU7hB,GAAO,UAErB6hB,GAAQ,SAAW1hB,GACnB0hB,GAAQ,eAAiB9f,GACzB8f,GAAQ,YAAc1f,GACtB0f,GAAQ,QAAUxgB,GAClBwgB,GAAQ,SAAWD,GACnBC,GAAQ,WAAaD,GACrBC,GAAQ,aAAetf,GACvBsf,GAAQ,WAAalf,EACrBkf,GAAQ,IAAMjiB,GACdiiB,GAAQ,KAAOhD,GACfgD,GAAQ,UAAY9C,GACpB8C,GAAQ,gBAAkB1C,GAC1B0C,GAAQ,cAAgBlC,GACxBkC,GAAQ,cAAgBpC,GACxBoC,GAAQ,gBAAkBjC,GAE1BiC,GAAQ,OAASjZ,GACjBiZ,GAAQ,YAAchZ,GACtBgZ,GAAQ,YAAc3Y,GACtB2Y,GAAQ,YAAcrY,GACtBqY,GAAQ,iBAAmBvY,GAC3BuY,GAAQ,KAAOxW,GACfwW,GAAQ,eAAiBrW,GACzBqW,GAAQ,eAAiBtW,GAEzBsW,GAAQ,SAAWxV,GACnBwV,GAAQ,YAAcrV,GACtBqV,GAAQ,cAAgBtV,GACxBsV,GAAQ,cAAgBlV,GAExBkV,GAAQ,cAAgB7U,GACxB6U,GAAQ,mBAAqB3U,GAC7B2U,GAAQ,iBAAmB1U,GAE3B0U,GAAQ,KAAO5T,GACf4T,GAAQ,SAAWzT,GAEnB,SAAS0T,GAAMzkB,EAAQ0kB,EAAOC,EAAOC,EAAQ,CACzC,IAAI3kB,EAASyS,GAAU,EACnByM,EAAMpf,EAAU,EAAE,IAAI6kB,EAAQF,CAAK,EACvC,OAAOzkB,EAAO0kB,CAAK,EAAExF,EAAKnf,CAAM,CACpC,CAEA,SAAS6kB,GAAe7kB,EAAQ0kB,EAAOC,EAAO,CAQ1C,GAPIrlB,EAASU,CAAM,IACf0kB,EAAQ1kB,EACRA,EAAS,QAGbA,EAASA,GAAU,GAEf0kB,GAAS,KACT,OAAOD,GAAMzkB,EAAQ0kB,EAAOC,EAAO,OAAO,EAG9C,IAAI/kB,EACAklB,EAAM,CAAC,EACX,IAAKllB,EAAI,EAAGA,EAAI,GAAIA,IAChBklB,EAAIllB,CAAC,EAAI6kB,GAAMzkB,EAAQJ,EAAG+kB,EAAO,OAAO,EAE5C,OAAOG,CACX,CAUA,SAASC,GAAiBC,EAAchlB,EAAQ0kB,EAAOC,EAAO,CACtD,OAAOK,GAAiB,WACpB1lB,EAASU,CAAM,IACf0kB,EAAQ1kB,EACRA,EAAS,QAGbA,EAASA,GAAU,KAEnBA,EAASglB,EACTN,EAAQ1kB,EACRglB,EAAe,GAEX1lB,EAASU,CAAM,IACf0kB,EAAQ1kB,EACRA,EAAS,QAGbA,EAASA,GAAU,IAGvB,IAAIC,EAASyS,GAAU,EACnBuS,EAAQD,EAAe/kB,EAAO,MAAM,IAAM,EAC1CL,EACAklB,EAAM,CAAC,EAEX,GAAIJ,GAAS,KACT,OAAOD,GAAMzkB,GAAS0kB,EAAQO,GAAS,EAAGN,EAAO,KAAK,EAG1D,IAAK/kB,EAAI,EAAGA,EAAI,EAAGA,IACfklB,EAAIllB,CAAC,EAAI6kB,GAAMzkB,GAASJ,EAAIqlB,GAAS,EAAGN,EAAO,KAAK,EAExD,OAAOG,CACX,CAEA,SAASI,GAAWllB,EAAQ0kB,EAAO,CAC/B,OAAOG,GAAe7kB,EAAQ0kB,EAAO,QAAQ,CACjD,CAEA,SAASS,GAAgBnlB,EAAQ0kB,EAAO,CACpC,OAAOG,GAAe7kB,EAAQ0kB,EAAO,aAAa,CACtD,CAEA,SAASU,GAAaJ,EAAchlB,EAAQ0kB,EAAO,CAC/C,OAAOK,GAAiBC,EAAchlB,EAAQ0kB,EAAO,UAAU,CACnE,CAEA,SAASW,GAAkBL,EAAchlB,EAAQ0kB,EAAO,CACpD,OAAOK,GAAiBC,EAAchlB,EAAQ0kB,EAAO,eAAe,CACxE,CAEA,SAASY,GAAgBN,EAAchlB,EAAQ0kB,EAAO,CAClD,OAAOK,GAAiBC,EAAchlB,EAAQ0kB,EAAO,aAAa,CACtE,CAEApS,GAAmB,KAAM,CACrB,KAAM,CACF,CACI,MAAO,aACP,MAAO,IACP,OAAQ,EACR,KAAM,cACN,OAAQ,KACR,KAAM,IACV,EACA,CACI,MAAO,aACP,MAAO,KACP,OAAQ,EACR,KAAM,gBACN,OAAQ,KACR,KAAM,IACV,CACJ,EACA,uBAAwB,uBACxB,QAAS,SAAUnP,EAAQ,CACvB,IAAIlE,EAAIkE,EAAS,GACbF,EACIqF,GAAOnF,EAAS,IAAO,EAAE,IAAM,EACzB,KACAlE,IAAM,EACJ,KACAA,IAAM,EACJ,KACAA,IAAM,EACJ,KACA,KACpB,OAAOkE,EAASF,CACpB,CACJ,CAAC,EAIDxE,EAAM,KAAOoD,GACT,wDACAyQ,EACJ,EACA7T,EAAM,SAAWoD,GACb,gEACA6Q,EACJ,EAEA,IAAI6S,GAAU,KAAK,IAEnB,SAASC,IAAM,CACX,IAAI/S,EAAO,KAAK,MAEhB,YAAK,cAAgB8S,GAAQ,KAAK,aAAa,EAC/C,KAAK,MAAQA,GAAQ,KAAK,KAAK,EAC/B,KAAK,QAAUA,GAAQ,KAAK,OAAO,EAEnC9S,EAAK,aAAe8S,GAAQ9S,EAAK,YAAY,EAC7CA,EAAK,QAAU8S,GAAQ9S,EAAK,OAAO,EACnCA,EAAK,QAAU8S,GAAQ9S,EAAK,OAAO,EACnCA,EAAK,MAAQ8S,GAAQ9S,EAAK,KAAK,EAC/BA,EAAK,OAAS8S,GAAQ9S,EAAK,MAAM,EACjCA,EAAK,MAAQ8S,GAAQ9S,EAAK,KAAK,EAExB,IACX,CAEA,SAASgT,GAAc7M,EAAU/Z,EAAO4J,EAAOwT,EAAW,CACtD,IAAInE,EAAQY,GAAe7Z,EAAO4J,CAAK,EAEvC,OAAAmQ,EAAS,eAAiBqD,EAAYnE,EAAM,cAC5Cc,EAAS,OAASqD,EAAYnE,EAAM,MACpCc,EAAS,SAAWqD,EAAYnE,EAAM,QAE/Bc,EAAS,QAAQ,CAC5B,CAGA,SAAS8M,GAAM7mB,EAAO4J,EAAO,CACzB,OAAOgd,GAAc,KAAM5mB,EAAO4J,EAAO,CAAC,CAC9C,CAGA,SAASkd,GAAW9mB,EAAO4J,EAAO,CAC9B,OAAOgd,GAAc,KAAM5mB,EAAO4J,EAAO,EAAE,CAC/C,CAEA,SAASmd,GAAQziB,EAAQ,CACrB,OAAIA,EAAS,EACF,KAAK,MAAMA,CAAM,EAEjB,KAAK,KAAKA,CAAM,CAE/B,CAEA,SAAS0iB,IAAS,CACd,IAAI1M,EAAe,KAAK,cACpBF,EAAO,KAAK,MACZF,EAAS,KAAK,QACdtG,EAAO,KAAK,MACZyG,EACAjI,EACAD,EACA6H,EACAiN,GAIJ,OAES3M,GAAgB,GAAKF,GAAQ,GAAKF,GAAU,GAC5CI,GAAgB,GAAKF,GAAQ,GAAKF,GAAU,IAGjDI,GAAgByM,GAAQG,GAAahN,CAAM,EAAIE,CAAI,EAAI,MACvDA,EAAO,EACPF,EAAS,GAKbtG,EAAK,aAAe0G,EAAe,IAEnCD,EAAU7Q,GAAS8Q,EAAe,GAAI,EACtC1G,EAAK,QAAUyG,EAAU,GAEzBjI,EAAU5I,GAAS6Q,EAAU,EAAE,EAC/BzG,EAAK,QAAUxB,EAAU,GAEzBD,EAAQ3I,GAAS4I,EAAU,EAAE,EAC7BwB,EAAK,MAAQzB,EAAQ,GAErBiI,GAAQ5Q,GAAS2I,EAAQ,EAAE,EAG3B8U,GAAiBzd,GAAS2d,GAAa/M,CAAI,CAAC,EAC5CF,GAAU+M,GACV7M,GAAQ2M,GAAQG,GAAaD,EAAc,CAAC,EAG5CjN,EAAQxQ,GAAS0Q,EAAS,EAAE,EAC5BA,GAAU,GAEVtG,EAAK,KAAOwG,EACZxG,EAAK,OAASsG,EACdtG,EAAK,MAAQoG,EAEN,IACX,CAEA,SAASmN,GAAa/M,EAAM,CAGxB,OAAQA,EAAO,KAAQ,MAC3B,CAEA,SAAS8M,GAAahN,EAAQ,CAE1B,OAAQA,EAAS,OAAU,IAC/B,CAEA,SAASkN,GAAGvgB,EAAO,CACf,GAAI,CAAC,KAAK,QAAQ,EACd,MAAO,KAEX,IAAIuT,EACAF,EACAI,EAAe,KAAK,cAIxB,GAFAzT,EAAQD,EAAeC,CAAK,EAExBA,IAAU,SAAWA,IAAU,WAAaA,IAAU,OAGtD,OAFAuT,EAAO,KAAK,MAAQE,EAAe,MACnCJ,EAAS,KAAK,QAAUiN,GAAa/M,CAAI,EACjCvT,EAAO,CACX,IAAK,QACD,OAAOqT,EACX,IAAK,UACD,OAAOA,EAAS,EACpB,IAAK,OACD,OAAOA,EAAS,EACxB,KAIA,QADAE,EAAO,KAAK,MAAQ,KAAK,MAAM8M,GAAa,KAAK,OAAO,CAAC,EACjDrgB,EAAO,CACX,IAAK,OACD,OAAOuT,EAAO,EAAIE,EAAe,OACrC,IAAK,MACD,OAAOF,EAAOE,EAAe,MACjC,IAAK,OACD,OAAOF,EAAO,GAAKE,EAAe,KACtC,IAAK,SACD,OAAOF,EAAO,KAAOE,EAAe,IACxC,IAAK,SACD,OAAOF,EAAO,MAAQE,EAAe,IAEzC,IAAK,cACD,OAAO,KAAK,MAAMF,EAAO,KAAK,EAAIE,EACtC,QACI,MAAM,IAAI,MAAM,gBAAkBzT,CAAK,CAC/C,CAER,CAEA,SAASwgB,GAAOC,EAAO,CACnB,OAAO,UAAY,CACf,OAAO,KAAK,GAAGA,CAAK,CACxB,CACJ,CAEA,IAAIC,GAAiBF,GAAO,IAAI,EAC5BG,GAAYH,GAAO,GAAG,EACtBI,GAAYJ,GAAO,GAAG,EACtBK,GAAUL,GAAO,GAAG,EACpBM,GAASN,GAAO,GAAG,EACnBO,GAAUP,GAAO,GAAG,EACpBQ,GAAWR,GAAO,GAAG,EACrBS,GAAaT,GAAO,GAAG,EACvBU,GAAUV,GAAO,GAAG,EACpBW,GAAYT,GAEhB,SAASU,IAAU,CACf,OAAOpO,GAAe,IAAI,CAC9B,CAEA,SAASqO,GAAMrhB,EAAO,CAClB,OAAAA,EAAQD,EAAeC,CAAK,EACrB,KAAK,QAAQ,EAAI,KAAKA,EAAQ,GAAG,EAAE,EAAI,GAClD,CAEA,SAASshB,GAAW3kB,EAAM,CACtB,OAAO,UAAY,CACf,OAAO,KAAK,QAAQ,EAAI,KAAK,MAAMA,CAAI,EAAI,GAC/C,CACJ,CAEA,IAAI8W,GAAe6N,GAAW,cAAc,EACxC9N,GAAU8N,GAAW,SAAS,EAC9B/V,GAAU+V,GAAW,SAAS,EAC9BhW,GAAQgW,GAAW,OAAO,EAC1B/N,GAAO+N,GAAW,MAAM,EACxBjO,GAASiO,GAAW,QAAQ,EAC5BnO,GAAQmO,GAAW,OAAO,EAE9B,SAAShO,IAAQ,CACb,OAAO3Q,GAAS,KAAK,KAAK,EAAI,CAAC,CACnC,CAEA,IAAI4e,GAAQ,KAAK,MACbC,GAAa,CACT,GAAI,GACJ,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,KACH,EAAG,EACP,EAGJ,SAASC,GAAkB/hB,EAAQjC,EAAQgC,EAAeE,EAAUpF,EAAQ,CACxE,OAAOA,EAAO,aAAakD,GAAU,EAAG,CAAC,CAACgC,EAAeC,EAAQC,CAAQ,CAC7E,CAEA,SAAS+hB,GAAeC,EAAgBliB,EAAe+hB,EAAYjnB,EAAQ,CACvE,IAAI2Y,EAAWF,GAAe2O,CAAc,EAAE,IAAI,EAC9CnO,EAAU+N,GAAMrO,EAAS,GAAG,GAAG,CAAC,EAChC3H,EAAUgW,GAAMrO,EAAS,GAAG,GAAG,CAAC,EAChC5H,EAAQiW,GAAMrO,EAAS,GAAG,GAAG,CAAC,EAC9BK,GAAOgO,GAAMrO,EAAS,GAAG,GAAG,CAAC,EAC7BG,GAASkO,GAAMrO,EAAS,GAAG,GAAG,CAAC,EAC/BI,GAAQiO,GAAMrO,EAAS,GAAG,GAAG,CAAC,EAC9BC,GAAQoO,GAAMrO,EAAS,GAAG,GAAG,CAAC,EAC9B5Z,GACKka,GAAWgO,EAAW,IAAM,CAAC,IAAKhO,CAAO,GACzCA,EAAUgO,EAAW,GAAK,CAAC,KAAMhO,CAAO,GACxCjI,GAAW,GAAK,CAAC,GAAG,GACpBA,EAAUiW,EAAW,GAAK,CAAC,KAAMjW,CAAO,GACxCD,GAAS,GAAK,CAAC,GAAG,GAClBA,EAAQkW,EAAW,GAAK,CAAC,KAAMlW,CAAK,GACpCiI,IAAQ,GAAK,CAAC,GAAG,GACjBA,GAAOiO,EAAW,GAAK,CAAC,KAAMjO,EAAI,EAE3C,OAAIiO,EAAW,GAAK,OAChBloB,GACIA,IACCga,IAAS,GAAK,CAAC,GAAG,GAClBA,GAAQkO,EAAW,GAAK,CAAC,KAAMlO,EAAK,GAE7Cha,GAAIA,IACC+Z,IAAU,GAAK,CAAC,GAAG,GACnBA,GAASmO,EAAW,GAAK,CAAC,KAAMnO,EAAM,GACtCF,IAAS,GAAK,CAAC,GAAG,GAAM,CAAC,KAAMA,EAAK,EAEzC7Z,GAAE,CAAC,EAAImG,EACPnG,GAAE,CAAC,EAAI,CAACqoB,EAAiB,EACzBroB,GAAE,CAAC,EAAIiB,EACAknB,GAAkB,MAAM,KAAMnoB,EAAC,CAC1C,CAGA,SAASsoB,GAA2BC,EAAkB,CAClD,OAAIA,IAAqB,OACdN,GAEP,OAAOM,GAAqB,YAC5BN,GAAQM,EACD,IAEJ,EACX,CAGA,SAASC,GAA4BC,EAAWC,EAAO,CACnD,OAAIR,GAAWO,CAAS,IAAM,OACnB,GAEPC,IAAU,OACHR,GAAWO,CAAS,GAE/BP,GAAWO,CAAS,EAAIC,EACpBD,IAAc,MACdP,GAAW,GAAKQ,EAAQ,GAErB,GACX,CAEA,SAASC,GAASC,EAAeC,EAAe,CAC5C,GAAI,CAAC,KAAK,QAAQ,EACd,OAAO,KAAK,WAAW,EAAE,YAAY,EAGzC,IAAIC,EAAa,GACbC,EAAKb,GACLjnB,EACAgD,EAEJ,OAAI,OAAO2kB,GAAkB,WACzBC,EAAgBD,EAChBA,EAAgB,IAEhB,OAAOA,GAAkB,YACzBE,EAAaF,GAEb,OAAOC,GAAkB,WACzBE,EAAK,OAAO,OAAO,CAAC,EAAGb,GAAYW,CAAa,EAC5CA,EAAc,GAAK,MAAQA,EAAc,IAAM,OAC/CE,EAAG,GAAKF,EAAc,EAAI,IAIlC5nB,EAAS,KAAK,WAAW,EACzBgD,EAASmkB,GAAe,KAAM,CAACU,EAAYC,EAAI9nB,CAAM,EAEjD6nB,IACA7kB,EAAShD,EAAO,WAAW,CAAC,KAAMgD,CAAM,GAGrChD,EAAO,WAAWgD,CAAM,CACnC,CAEA,IAAI+kB,GAAQ,KAAK,IAEjB,SAASxkB,GAAKqH,EAAG,CACb,OAAQA,EAAI,IAAMA,EAAI,IAAM,CAACA,CACjC,CAEA,SAASod,IAAgB,CAQrB,GAAI,CAAC,KAAK,QAAQ,EACd,OAAO,KAAK,WAAW,EAAE,YAAY,EAGzC,IAAI/O,EAAU8O,GAAM,KAAK,aAAa,EAAI,IACtC/O,EAAO+O,GAAM,KAAK,KAAK,EACvBjP,EAASiP,GAAM,KAAK,OAAO,EAC3B/W,EACAD,EACA6H,EACA/Q,EACAogB,EAAQ,KAAK,UAAU,EACvBC,GACAC,GACAC,GACAC,GAEJ,OAAKJ,GAOLjX,EAAU5I,GAAS6Q,EAAU,EAAE,EAC/BlI,EAAQ3I,GAAS4I,EAAU,EAAE,EAC7BiI,GAAW,GACXjI,GAAW,GAGX4H,EAAQxQ,GAAS0Q,EAAS,EAAE,EAC5BA,GAAU,GAGVjR,EAAIoR,EAAUA,EAAQ,QAAQ,CAAC,EAAE,QAAQ,SAAU,EAAE,EAAI,GAEzDiP,GAAYD,EAAQ,EAAI,IAAM,GAC9BE,GAAS5kB,GAAK,KAAK,OAAO,IAAMA,GAAK0kB,CAAK,EAAI,IAAM,GACpDG,GAAW7kB,GAAK,KAAK,KAAK,IAAMA,GAAK0kB,CAAK,EAAI,IAAM,GACpDI,GAAU9kB,GAAK,KAAK,aAAa,IAAMA,GAAK0kB,CAAK,EAAI,IAAM,GAGvDC,GACA,KACCtP,EAAQuP,GAASvP,EAAQ,IAAM,KAC/BE,EAASqP,GAASrP,EAAS,IAAM,KACjCE,EAAOoP,GAAWpP,EAAO,IAAM,KAC/BjI,GAASC,GAAWiI,EAAU,IAAM,KACpClI,EAAQsX,GAAUtX,EAAQ,IAAM,KAChCC,EAAUqX,GAAUrX,EAAU,IAAM,KACpCiI,EAAUoP,GAAUxgB,EAAI,IAAM,KA9BxB,KAgCf,CAEA,IAAIygB,GAAU5P,GAAS,UAEvB4P,GAAQ,QAAU/P,GAClB+P,GAAQ,IAAM/C,GACd+C,GAAQ,IAAM7C,GACd6C,GAAQ,SAAW5C,GACnB4C,GAAQ,GAAKtC,GACbsC,GAAQ,eAAiBnC,GACzBmC,GAAQ,UAAYlC,GACpBkC,GAAQ,UAAYjC,GACpBiC,GAAQ,QAAUhC,GAClBgC,GAAQ,OAAS/B,GACjB+B,GAAQ,QAAU9B,GAClB8B,GAAQ,SAAW7B,GACnB6B,GAAQ,WAAa5B,GACrB4B,GAAQ,QAAU3B,GAClB2B,GAAQ,QAAU1B,GAClB0B,GAAQ,QAAU1C,GAClB0C,GAAQ,MAAQzB,GAChByB,GAAQ,IAAMxB,GACdwB,GAAQ,aAAepP,GACvBoP,GAAQ,QAAUrP,GAClBqP,GAAQ,QAAUtX,GAClBsX,GAAQ,MAAQvX,GAChBuX,GAAQ,KAAOtP,GACfsP,GAAQ,MAAQvP,GAChBuP,GAAQ,OAASxP,GACjBwP,GAAQ,MAAQ1P,GAChB0P,GAAQ,SAAWZ,GACnBY,GAAQ,YAAcN,GACtBM,GAAQ,SAAWN,GACnBM,GAAQ,OAASN,GACjBM,GAAQ,OAAStoB,GACjBsoB,GAAQ,WAAa5gB,GAErB4gB,GAAQ,YAAc1mB,GAClB,sFACAomB,EACJ,EACAM,GAAQ,KAAO1I,GAIfhc,EAAe,IAAK,EAAG,EAAG,MAAM,EAChCA,EAAe,IAAK,EAAG,EAAG,SAAS,EAInC0D,EAAc,IAAKR,EAAW,EAC9BQ,EAAc,IAAKL,EAAc,EACjCyB,GAAc,IAAK,SAAU9J,EAAOuF,EAAO3C,EAAQ,CAC/CA,EAAO,GAAK,IAAI,KAAK,WAAW5C,CAAK,EAAI,GAAI,CACjD,CAAC,EACD8J,GAAc,IAAK,SAAU9J,EAAOuF,EAAO3C,EAAQ,CAC/CA,EAAO,GAAK,IAAI,KAAK6G,GAAMzJ,CAAK,CAAC,CACrC,CAAC,EAID,OAAAJ,EAAM,QAAU,SAEhBC,EAAgB6X,EAAW,EAE3B9X,EAAM,GAAK2lB,EACX3lB,EAAM,IAAMyZ,GACZzZ,EAAM,IAAM0Z,GACZ1Z,EAAM,IAAMuE,GACZvE,EAAM,IAAMsB,EACZtB,EAAM,KAAO4lB,GACb5lB,EAAM,OAASymB,GACfzmB,EAAM,OAASc,EACfd,EAAM,OAAS6T,GACf7T,EAAM,QAAUsC,GAChBtC,EAAM,SAAWia,GACjBja,EAAM,SAAWiD,GACjBjD,EAAM,SAAW2mB,GACjB3mB,EAAM,UAAY6lB,GAClB7lB,EAAM,WAAaiU,GACnBjU,EAAM,WAAa2a,GACnB3a,EAAM,YAAc0mB,GACpB1mB,EAAM,YAAc6mB,GACpB7mB,EAAM,aAAekU,GACrBlU,EAAM,aAAemU,GACrBnU,EAAM,QAAUqU,GAChBrU,EAAM,cAAgB4mB,GACtB5mB,EAAM,eAAiBgH,EACvBhH,EAAM,qBAAuB6oB,GAC7B7oB,EAAM,sBAAwB+oB,GAC9B/oB,EAAM,eAAiB6e,GACvB7e,EAAM,UAAY2lB,EAGlB3lB,EAAM,UAAY,CACd,eAAgB,mBAChB,uBAAwB,sBACxB,kBAAmB,0BACnB,KAAM,aACN,KAAM,QACN,aAAc,WACd,QAAS,eACT,KAAM,aACN,MAAO,SACX,EAEOA,CAEX,CAAE,mOCvjLF,GAAM,CACJ+pB,QAAAA,EACAC,eAAAA,EACAC,SAAAA,EACAC,eAAAA,EACAC,yBAAAA,CACF,EAAIC,OAEA,CAAEC,OAAAA,EAAQC,KAAAA,EAAMC,OAAAA,CAAO,EAAIH,OAC3B,CAAEI,MAAAA,EAAOC,UAAAA,CAAU,EAAI,OAAOC,QAAY,KAAeA,QAExDL,IACHA,EAAS,SAAUM,EAAG,CACpB,OAAOA,IAINL,IACHA,EAAO,SAAUK,EAAG,CAClB,OAAOA,IAINH,IACHA,EAAQ,SAAUI,EAAKC,GAAWC,EAAM,CACtC,OAAOF,EAAIJ,MAAMK,GAAWC,CAAI,IAI/BL,IACHA,EAAY,SAAUM,EAAMD,GAAM,CAChC,OAAO,IAAIC,EAAK,GAAGD,EAAI,IAI3B,IAAME,EAAeC,EAAQC,MAAMC,UAAUC,OAAO,EAE9CC,EAAWJ,EAAQC,MAAMC,UAAUG,GAAG,EACtCC,EAAYN,EAAQC,MAAMC,UAAUK,IAAI,EAGxCC,EAAoBR,EAAQS,OAAOP,UAAUQ,WAAW,EACxDC,EAAiBX,EAAQS,OAAOP,UAAUU,QAAQ,EAClDC,EAAcb,EAAQS,OAAOP,UAAUY,KAAK,EAC5CC,EAAgBf,EAAQS,OAAOP,UAAUc,OAAO,EAChDC,GAAgBjB,EAAQS,OAAOP,UAAUgB,OAAO,EAChDC,GAAanB,EAAQS,OAAOP,UAAUkB,IAAI,EAE1CC,GAAarB,EAAQsB,OAAOpB,UAAUqB,IAAI,EAE1CC,GAAkBC,GAAYC,SAAS,EAQ7C,SAAS1B,EAAQ2B,GAAM,CACrB,OAAO,SAACC,EAAO,CAAA,QAAAC,GAAAC,UAAAC,OAAKlC,EAAI,IAAAI,MAAA4B,GAAAA,EAAAA,GAAA,EAAA,CAAA,EAAAG,EAAA,EAAAA,EAAAH,GAAAG,IAAJnC,EAAImC,EAAAF,CAAAA,EAAAA,UAAAE,CAAA,EAAA,OAAKzC,EAAMoC,GAAMC,EAAS/B,CAAI,CAAC,CACzD,CAQA,SAAS4B,GAAYE,GAAM,CACzB,OAAO,UAAA,CAAA,QAAAM,EAAAH,UAAAC,OAAIlC,GAAII,IAAAA,MAAAgC,CAAA,EAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJrC,GAAIqC,CAAA,EAAAJ,UAAAI,CAAA,EAAA,OAAK1C,EAAUmC,GAAM9B,EAAI,CAAC,CAC3C,CAUA,SAASsC,GAASC,GAAKC,EAA8C,CAAA,IAAvCC,GAAiBR,UAAAC,OAAA,GAAAD,UAAA,CAAA,IAAAS,OAAAT,UAAA,CAAA,EAAGtB,EAC5CzB,GAIFA,EAAeqD,GAAK,IAAI,EAG1B,IAAII,EAAIH,EAAMN,OACd,KAAOS,KAAK,CACV,IAAIC,EAAUJ,EAAMG,CAAC,EACrB,GAAI,OAAOC,GAAY,SAAU,CAC/B,IAAMC,GAAYJ,GAAkBG,CAAO,EACvCC,KAAcD,IAEXzD,EAASqD,CAAK,IACjBA,EAAMG,CAAC,EAAIE,IAGbD,EAAUC,GAEd,CAEAN,GAAIK,CAAO,EAAI,EACjB,CAEA,OAAOL,EACT,CAQA,SAASO,GAAWN,GAAO,CACzB,QAASO,EAAQ,EAAGA,EAAQP,GAAMN,OAAQa,IACpC1D,EAAyBmD,GAAOO,CAAK,IAAML,SAC7CF,GAAMO,CAAK,EAAI,MAInB,OAAOP,EACT,CAQA,SAASQ,GAAMC,GAAQ,CACrB,IAAMC,EAAYzD,EAAO,IAAI,EAE7B,OAAW,CAAC0D,GAAUC,CAAK,IAAKnE,EAAQgE,EAAM,EACxC5D,EAAyB4D,GAAQE,EAAQ,IAAMT,SAC7CtC,MAAMiD,QAAQD,CAAK,EACrBF,EAAUC,EAAQ,EAAIL,GAAWM,CAAK,EAEtCA,GACA,OAAOA,GAAU,UACjBA,EAAME,cAAgBhE,OAEtB4D,EAAUC,EAAQ,EAAIH,GAAMI,CAAK,EAEjCF,EAAUC,EAAQ,EAAIC,GAK5B,OAAOF,CACT,CASA,SAASK,GAAaN,GAAQO,EAAM,CAClC,KAAOP,KAAW,MAAM,CACtB,IAAMQ,EAAOpE,EAAyB4D,GAAQO,CAAI,EAElD,GAAIC,EAAM,CACR,GAAIA,EAAKC,IACP,OAAOvD,EAAQsD,EAAKC,GAAG,EAGzB,GAAI,OAAOD,EAAKL,OAAU,WACxB,OAAOjD,EAAQsD,EAAKL,KAAK,CAE7B,CAEAH,GAAS7D,EAAe6D,EAAM,CAChC,CAEA,SAASU,GAAcf,EAAS,CAC9BgB,eAAQC,KAAK,qBAAsBjB,CAAO,EACnC,IACT,CAEA,OAAOe,EACT,CCrLO,IAAMG,GAAOvE,EAAO,CACzB,IACA,OACA,UACA,UACA,OACA,UACA,QACA,QACA,IACA,MACA,MACA,MACA,QACA,aACA,OACA,KACA,SACA,SACA,UACA,SACA,OACA,OACA,MACA,WACA,UACA,OACA,WACA,KACA,YACA,MACA,UACA,MACA,SACA,MACA,MACA,KACA,KACA,UACA,KACA,WACA,aACA,SACA,OACA,SACA,OACA,KACA,KACA,KACA,KACA,KACA,KACA,OACA,SACA,SACA,KACA,OACA,IACA,MACA,QACA,MACA,MACA,QACA,SACA,KACA,OACA,MACA,OACA,UACA,OACA,WACA,QACA,MACA,OACA,KACA,WACA,SACA,SACA,IACA,UACA,MACA,WACA,IACA,KACA,KACA,OACA,IACA,OACA,UACA,SACA,SACA,QACA,SACA,SACA,OACA,SACA,SACA,QACA,MACA,UACA,MACA,QACA,QACA,KACA,WACA,WACA,QACA,KACA,QACA,OACA,KACA,QACA,KACA,IACA,KACA,MACA,QACA,KAAK,CACN,EAGYwE,GAAMxE,EAAO,CACxB,MACA,IACA,WACA,cACA,eACA,eACA,gBACA,mBACA,SACA,WACA,OACA,OACA,UACA,SACA,OACA,IACA,QACA,WACA,QACA,QACA,OACA,iBACA,SACA,OACA,WACA,QACA,OACA,UACA,UACA,WACA,iBACA,OACA,OACA,QACA,SACA,SACA,OACA,WACA,QACA,OACA,QACA,OACA,OAAO,CACR,EAEYyE,GAAazE,EAAO,CAC/B,UACA,gBACA,sBACA,cACA,mBACA,oBACA,oBACA,iBACA,eACA,UACA,UACA,UACA,UACA,UACA,iBACA,UACA,UACA,cACA,eACA,WACA,eACA,qBACA,cACA,SACA,cAAc,CACf,EAMY0E,GAAgB1E,EAAO,CAClC,UACA,gBACA,SACA,UACA,YACA,mBACA,iBACA,gBACA,gBACA,gBACA,QACA,YACA,OACA,eACA,YACA,UACA,gBACA,SACA,MACA,aACA,UACA,KAAK,CACN,EAEY2E,GAAS3E,EAAO,CAC3B,OACA,WACA,SACA,UACA,QACA,SACA,KACA,aACA,gBACA,KACA,KACA,QACA,UACA,WACA,QACA,OACA,KACA,SACA,QACA,SACA,OACA,OACA,UACA,SACA,MACA,QACA,MACA,SACA,aACA,aAAa,CACd,EAIY4E,GAAmB5E,EAAO,CACrC,UACA,cACA,aACA,WACA,YACA,UACA,UACA,SACA,SACA,QACA,YACA,aACA,iBACA,cACA,MAAM,CACP,EAEY6E,GAAO7E,EAAO,CAAC,OAAO,CAAC,ECrRvBuE,GAAOvE,EAAO,CACzB,SACA,SACA,QACA,MACA,iBACA,eACA,uBACA,WACA,aACA,UACA,SACA,UACA,cACA,cACA,UACA,OACA,QACA,QACA,QACA,OACA,UACA,WACA,eACA,SACA,cACA,WACA,WACA,UACA,MACA,WACA,0BACA,wBACA,WACA,YACA,UACA,eACA,OACA,MACA,UACA,SACA,SACA,OACA,OACA,WACA,KACA,YACA,YACA,QACA,OACA,QACA,OACA,OACA,UACA,OACA,MACA,MACA,YACA,QACA,SACA,MACA,YACA,WACA,QACA,OACA,QACA,UACA,aACA,SACA,OACA,UACA,UACA,cACA,cACA,SACA,UACA,UACA,aACA,WACA,MACA,WACA,MACA,WACA,OACA,OACA,UACA,aACA,QACA,WACA,QACA,OACA,QACA,OACA,UACA,QACA,MACA,SACA,OACA,QACA,UACA,WACA,QACA,YACA,OACA,SACA,SACA,QACA,QACA,QACA,MAAM,CACP,EAEYwE,GAAMxE,EAAO,CACxB,gBACA,aACA,WACA,qBACA,SACA,gBACA,gBACA,UACA,gBACA,iBACA,QACA,OACA,KACA,QACA,OACA,gBACA,YACA,YACA,QACA,sBACA,8BACA,gBACA,kBACA,KACA,KACA,IACA,KACA,KACA,kBACA,YACA,UACA,UACA,MACA,WACA,YACA,MACA,OACA,eACA,YACA,SACA,cACA,cACA,gBACA,cACA,YACA,mBACA,eACA,aACA,eACA,cACA,KACA,KACA,KACA,KACA,aACA,WACA,gBACA,oBACA,SACA,OACA,KACA,kBACA,KACA,MACA,IACA,KACA,KACA,KACA,KACA,UACA,YACA,aACA,WACA,OACA,eACA,iBACA,eACA,mBACA,iBACA,QACA,aACA,aACA,eACA,eACA,cACA,cACA,mBACA,YACA,MACA,OACA,QACA,SACA,OACA,MACA,OACA,aACA,SACA,WACA,UACA,QACA,SACA,cACA,SACA,WACA,cACA,OACA,aACA,sBACA,mBACA,eACA,SACA,gBACA,sBACA,iBACA,IACA,KACA,KACA,SACA,OACA,OACA,cACA,YACA,UACA,SACA,SACA,QACA,OACA,kBACA,mBACA,mBACA,eACA,cACA,eACA,cACA,aACA,eACA,mBACA,oBACA,iBACA,kBACA,oBACA,iBACA,SACA,eACA,QACA,eACA,iBACA,WACA,UACA,UACA,YACA,mBACA,cACA,kBACA,iBACA,aACA,OACA,KACA,KACA,UACA,SACA,UACA,aACA,UACA,aACA,gBACA,gBACA,QACA,eACA,OACA,eACA,mBACA,mBACA,IACA,KACA,KACA,QACA,IACA,KACA,KACA,IACA,YAAY,CACb,EAEY2E,GAAS3E,EAAO,CAC3B,SACA,cACA,QACA,WACA,QACA,eACA,cACA,aACA,aACA,QACA,MACA,UACA,eACA,WACA,QACA,QACA,SACA,OACA,KACA,UACA,SACA,gBACA,SACA,SACA,iBACA,YACA,WACA,cACA,UACA,UACA,gBACA,WACA,WACA,OACA,WACA,WACA,aACA,UACA,SACA,SACA,cACA,gBACA,uBACA,YACA,YACA,aACA,WACA,iBACA,iBACA,YACA,UACA,QACA,OAAO,CACR,EAEY8E,GAAM9E,EAAO,CACxB,aACA,SACA,cACA,YACA,aAAa,CACd,ECtWY+E,GAAgB9E,EAAK,2BAA2B,EAChD+E,EAAW/E,EAAK,uBAAuB,EACvCgF,GAAchF,EAAK,eAAe,EAClCiF,GAAYjF,EAAK,4BAA4B,EAC7CkF,GAAYlF,EAAK,gBAAgB,EACjCmF,GAAiBnF,EAC5B,2FACF,EACaoF,EAAoBpF,EAAK,uBAAuB,EAChDqF,GAAkBrF,EAC7B,6DACF,EACasF,GAAetF,EAAK,SAAS,uLCQ1C,IAAMuF,GAAY,UAAY,CAC5B,OAAO,OAAOC,OAAW,IAAc,KAAOA,MAChD,EAUMC,GAA4B,SAAUC,EAAcC,GAAmB,CAC3E,GACE,OAAOD,GAAiB,UACxB,OAAOA,EAAaE,cAAiB,WAErC,OAAO,KAMT,IAAIC,EAAS,KACPC,EAAY,wBACdH,IAAqBA,GAAkBI,aAAaD,CAAS,IAC/DD,EAASF,GAAkBK,aAAaF,CAAS,GAGnD,IAAMG,GAAa,aAAeJ,EAAS,IAAMA,EAAS,IAE1D,GAAI,CACF,OAAOH,EAAaE,aAAaK,GAAY,CAC3CC,WAAW5B,GAAM,CACf,OAAOA,IAET6B,gBAAgBC,GAAW,CACzB,OAAOA,EACT,CACF,CAAC,QACMC,GAAG,CAIVjC,eAAQC,KACN,uBAAyB4B,GAAa,wBACxC,EACO,IACT,CACF,EAEA,SAASK,IAAsC,CAAA,IAAtBd,GAAM/C,UAAAC,OAAAD,GAAAA,UAAAS,CAAAA,IAAAA,OAAAT,UAAG8C,CAAAA,EAAAA,GAAS,EACnCgB,EAAaC,IAASF,GAAgBE,EAAI,EAchD,GARAD,EAAUE,QAAUC,QAMpBH,EAAUI,QAAU,CAAA,EAEhB,CAACnB,IAAU,CAACA,GAAOoB,UAAYpB,GAAOoB,SAASC,WAAa,EAG9DN,OAAAA,EAAUO,YAAc,GAEjBP,EAGT,GAAI,CAAEK,SAAAA,EAAS,EAAIpB,GAEbuB,EAAmBH,GACnBI,EAAgBD,EAAiBC,cACjC,CACJC,iBAAAA,GACAC,oBAAAA,GACAC,KAAAA,GACAC,QAAAA,GACAC,WAAAA,GACAC,aAAAA,GAAe9B,GAAO8B,cAAgB9B,GAAO+B,gBAC7CC,gBAAAA,GACAC,UAAAA,GACA/B,aAAAA,EACF,EAAIF,GAEEkC,GAAmBN,GAAQvG,UAE3B8G,GAAY5D,GAAa2D,GAAkB,WAAW,EACtDE,GAAiB7D,GAAa2D,GAAkB,aAAa,EAC7DG,GAAgB9D,GAAa2D,GAAkB,YAAY,EAC3DI,GAAgB/D,GAAa2D,GAAkB,YAAY,EAQjE,GAAI,OAAOR,IAAwB,WAAY,CAC7C,IAAMa,GAAWnB,GAASoB,cAAc,UAAU,EAC9CD,GAASE,SAAWF,GAASE,QAAQC,gBACvCtB,GAAWmB,GAASE,QAAQC,cAEhC,CAEA,IAAIC,GACAC,GAAY,GAEV,CACJC,eAAAA,GACAC,mBAAAA,GACAC,uBAAAA,GACAC,qBAAAA,EACF,EAAI5B,GACE,CAAE6B,WAAAA,EAAW,EAAI1B,EAEnB2B,GAAQ,CAAA,EAKZnC,EAAUO,YACR,OAAOrH,GAAY,YACnB,OAAOqI,IAAkB,YACzBO,IACAA,GAAeM,qBAAuBzF,OAExC,GAAM,CACJ4B,cAAAA,EACAC,SAAAA,GACAC,YAAAA,GACAC,UAAAA,GACAC,UAAAA,GACAE,kBAAAA,GACAC,gBAAAA,EACF,EAAIuD,GAEA,CAAEzD,eAAAA,EAAe,EAAIyD,GAQrBC,GAAe,KACbC,GAAuBhG,GAAS,CAAA,EAAI,CACxC,GAAGiG,GACH,GAAGA,GACH,GAAGA,GACH,GAAGA,GACH,GAAGA,EAAS,CACb,EAGGC,GAAe,KACbC,GAAuBnG,GAAS,CAAA,EAAI,CACxC,GAAGoG,GACH,GAAGA,GACH,GAAGA,GACH,GAAGA,EAAS,CACb,EAQGC,GAA0BrJ,OAAOE,KACnCC,EAAO,KAAM,CACXmJ,aAAc,CACZC,SAAU,GACVC,aAAc,GACdC,WAAY,GACZ3F,MAAO,MAET4F,mBAAoB,CAClBH,SAAU,GACVC,aAAc,GACdC,WAAY,GACZ3F,MAAO,MAET6F,+BAAgC,CAC9BJ,SAAU,GACVC,aAAc,GACdC,WAAY,GACZ3F,MAAO,EACT,CACF,CAAC,CACH,EAGI8F,GAAc,KAGdC,GAAc,KAGdC,GAAkB,GAGlBC,GAAkB,GAGlBC,GAA0B,GAI1BC,GAA2B,GAK3BC,GAAqB,GAGrBC,GAAiB,GAGjBC,GAAa,GAIbC,GAAa,GAMbC,GAAa,GAIbC,GAAsB,GAItBC,GAAsB,GAKtBC,GAAe,GAefC,GAAuB,GACrBC,GAA8B,gBAGhCC,GAAe,GAIfC,GAAW,GAGXC,GAAe,CAAA,EAGfC,GAAkB,KAChBC,GAA0BhI,GAAS,CAAA,EAAI,CAC3C,iBACA,QACA,WACA,OACA,gBACA,OACA,SACA,OACA,KACA,KACA,KACA,KACA,QACA,UACA,WACA,WACA,YACA,SACA,QACA,MACA,WACA,QACA,QACA,QACA,KAAK,CACN,EAGGiI,GAAgB,KACdC,GAAwBlI,GAAS,CAAA,EAAI,CACzC,QACA,QACA,MACA,SACA,QACA,OAAO,CACR,EAGGmI,GAAsB,KACpBC,GAA8BpI,GAAS,CAAA,EAAI,CAC/C,MACA,QACA,MACA,KACA,QACA,OACA,UACA,cACA,OACA,UACA,QACA,QACA,QACA,OAAO,CACR,EAEKqI,GAAmB,qCACnBC,GAAgB,6BAChBC,GAAiB,+BAEnBC,GAAYD,GACZE,GAAiB,GAGjBC,GAAqB,KACnBC,GAA6B3I,GACjC,CAAA,EACA,CAACqI,GAAkBC,GAAeC,EAAc,EAChD/J,CACF,EAGIoK,GAAoB,KAClBC,GAA+B,CAAC,wBAAyB,WAAW,EACpEC,GAA4B,YAC9B3I,GAAoB,KAGpB4I,GAAS,KAKPC,GAAclF,GAASoB,cAAc,MAAM,EAE3C+D,GAAoB,SAAUC,EAAW,CAC7C,OAAOA,aAAqB/J,QAAU+J,aAAqBC,UASvDC,GAAe,UAAoB,CAAA,IAAVC,EAAG1J,UAAAC,OAAA,GAAAD,UAAA,CAAA,IAAAS,OAAAT,UAAA,CAAA,EAAG,CAAA,EACnC,GAAIoJ,EAAAA,IAAUA,KAAWM,GA6LzB,KAxLI,CAACA,GAAO,OAAOA,GAAQ,YACzBA,EAAM,CAAA,GAIRA,EAAM3I,GAAM2I,CAAG,EAEfT,GAEEC,GAA6B9J,QAAQsK,EAAIT,iBAAiB,IAAM,GAC5DE,GACAO,EAAIT,kBAGVzI,GACEyI,KAAsB,wBAClBpK,EACAH,EAGN0H,GACE,iBAAkBsD,EACdrJ,GAAS,CAAA,EAAIqJ,EAAItD,aAAc5F,EAAiB,EAChD6F,GACNE,GACE,iBAAkBmD,EACdrJ,GAAS,CAAA,EAAIqJ,EAAInD,aAAc/F,EAAiB,EAChDgG,GACNuC,GACE,uBAAwBW,EACpBrJ,GAAS,CAAA,EAAIqJ,EAAIX,mBAAoBlK,CAAc,EACnDmK,GACNR,GACE,sBAAuBkB,EACnBrJ,GACEU,GAAM0H,EAA2B,EACjCiB,EAAIC,kBACJnJ,EACF,EACAiI,GACNH,GACE,sBAAuBoB,EACnBrJ,GACEU,GAAMwH,EAAqB,EAC3BmB,EAAIE,kBACJpJ,EACF,EACA+H,GACNH,GACE,oBAAqBsB,EACjBrJ,GAAS,CAAA,EAAIqJ,EAAItB,gBAAiB5H,EAAiB,EACnD6H,GACNpB,GACE,gBAAiByC,EACbrJ,GAAS,CAAA,EAAIqJ,EAAIzC,YAAazG,EAAiB,EAC/C,CAAA,EACN0G,GACE,gBAAiBwC,EACbrJ,GAAS,CAAA,EAAIqJ,EAAIxC,YAAa1G,EAAiB,EAC/C,CAAA,EACN2H,GAAe,iBAAkBuB,EAAMA,EAAIvB,aAAe,GAC1DhB,GAAkBuC,EAAIvC,kBAAoB,GAC1CC,GAAkBsC,EAAItC,kBAAoB,GAC1CC,GAA0BqC,EAAIrC,yBAA2B,GACzDC,GAA2BoC,EAAIpC,2BAA6B,GAC5DC,GAAqBmC,EAAInC,oBAAsB,GAC/CC,GAAiBkC,EAAIlC,gBAAkB,GACvCG,GAAa+B,EAAI/B,YAAc,GAC/BC,GAAsB8B,EAAI9B,qBAAuB,GACjDC,GAAsB6B,EAAI7B,qBAAuB,GACjDH,GAAagC,EAAIhC,YAAc,GAC/BI,GAAe4B,EAAI5B,eAAiB,GACpCC,GAAuB2B,EAAI3B,sBAAwB,GACnDE,GAAeyB,EAAIzB,eAAiB,GACpCC,GAAWwB,EAAIxB,UAAY,GAC3BxF,GAAiBgH,EAAIG,oBAAsB1D,GAC3C0C,GAAYa,EAAIb,WAAaD,GAC7BlC,GAA0BgD,EAAIhD,yBAA2B,CAAA,EAEvDgD,EAAIhD,yBACJ4C,GAAkBI,EAAIhD,wBAAwBC,YAAY,IAE1DD,GAAwBC,aACtB+C,EAAIhD,wBAAwBC,cAI9B+C,EAAIhD,yBACJ4C,GAAkBI,EAAIhD,wBAAwBK,kBAAkB,IAEhEL,GAAwBK,mBACtB2C,EAAIhD,wBAAwBK,oBAI9B2C,EAAIhD,yBACJ,OAAOgD,EAAIhD,wBAAwBM,gCACjC,YAEFN,GAAwBM,+BACtB0C,EAAIhD,wBAAwBM,gCAG5BO,KACFH,GAAkB,IAGhBQ,KACFD,GAAa,IAIXQ,KACF/B,GAAe/F,GAAS,CAAA,EAAIiG,EAAS,EACrCC,GAAe,CAAA,EACX4B,GAAatG,OAAS,KACxBxB,GAAS+F,GAAcE,EAAS,EAChCjG,GAASkG,GAAcE,EAAU,GAG/B0B,GAAarG,MAAQ,KACvBzB,GAAS+F,GAAcE,EAAQ,EAC/BjG,GAASkG,GAAcE,EAAS,EAChCpG,GAASkG,GAAcE,EAAS,GAG9B0B,GAAapG,aAAe,KAC9B1B,GAAS+F,GAAcE,EAAe,EACtCjG,GAASkG,GAAcE,EAAS,EAChCpG,GAASkG,GAAcE,EAAS,GAG9B0B,GAAalG,SAAW,KAC1B5B,GAAS+F,GAAcE,EAAW,EAClCjG,GAASkG,GAAcE,EAAY,EACnCpG,GAASkG,GAAcE,EAAS,IAKhCiD,EAAII,WACF1D,KAAiBC,KACnBD,GAAerF,GAAMqF,EAAY,GAGnC/F,GAAS+F,GAAcsD,EAAII,SAAUtJ,EAAiB,GAGpDkJ,EAAIK,WACFxD,KAAiBC,KACnBD,GAAexF,GAAMwF,EAAY,GAGnClG,GAASkG,GAAcmD,EAAIK,SAAUvJ,EAAiB,GAGpDkJ,EAAIC,mBACNtJ,GAASmI,GAAqBkB,EAAIC,kBAAmBnJ,EAAiB,EAGpEkJ,EAAItB,kBACFA,KAAoBC,KACtBD,GAAkBrH,GAAMqH,EAAe,GAGzC/H,GAAS+H,GAAiBsB,EAAItB,gBAAiB5H,EAAiB,GAI9DyH,KACF7B,GAAa,OAAO,EAAI,IAItBoB,IACFnH,GAAS+F,GAAc,CAAC,OAAQ,OAAQ,MAAM,CAAC,EAI7CA,GAAa4D,QACf3J,GAAS+F,GAAc,CAAC,OAAO,CAAC,EAChC,OAAOa,GAAYgD,OAGjBP,EAAIQ,qBAAsB,CAC5B,GAAI,OAAOR,EAAIQ,qBAAqBzG,YAAe,WACjD,MAAM/D,GACJ,6EACF,EAGF,GAAI,OAAOgK,EAAIQ,qBAAqBxG,iBAAoB,WACtD,MAAMhE,GACJ,kFACF,EAIFgG,GAAqBgE,EAAIQ,qBAGzBvE,GAAYD,GAAmBjC,WAAW,EAAE,CAC9C,MAEMiC,KAAuBjF,SACzBiF,GAAqB1C,GACnBC,GACAsB,CACF,GAIEmB,KAAuB,MAAQ,OAAOC,IAAc,WACtDA,GAAYD,GAAmBjC,WAAW,EAAE,GAM5CnG,GACFA,EAAOoM,CAAG,EAGZN,GAASM,IAGLS,GAAiC9J,GAAS,CAAA,EAAI,CAClD,KACA,KACA,KACA,KACA,OAAO,CACR,EAEK+J,GAA0B/J,GAAS,CAAA,EAAI,CAC3C,gBACA,OACA,QACA,gBAAgB,CACjB,EAMKgK,GAA+BhK,GAAS,CAAA,EAAI,CAChD,QACA,QACA,OACA,IACA,QAAQ,CACT,EAKKiK,GAAejK,GAAS,CAAA,EAAI,CAChC,GAAGiG,GACH,GAAGA,GACH,GAAGA,EAAkB,CACtB,EACKiE,GAAkBlK,GAAS,CAAA,EAAI,CACnC,GAAGiG,GACH,GAAGA,EAAqB,CACzB,EAQKkE,GAAuB,SAAU7J,EAAS,CAC9C,IAAI8J,EAASpF,GAAc1E,CAAO,GAI9B,CAAC8J,GAAU,CAACA,EAAOC,WACrBD,EAAS,CACPE,aAAc9B,GACd6B,QAAS,aAIb,IAAMA,GAAUhM,EAAkBiC,EAAQ+J,OAAO,EAC3CE,GAAgBlM,EAAkB+L,EAAOC,OAAO,EAEtD,OAAK3B,GAAmBpI,EAAQgK,YAAY,EAIxChK,EAAQgK,eAAiBhC,GAIvB8B,EAAOE,eAAiB/B,GACnB8B,KAAY,MAMjBD,EAAOE,eAAiBjC,GAExBgC,KAAY,QACXE,KAAkB,kBACjBT,GAA+BS,EAAa,GAM3CC,EAAQP,GAAaI,EAAO,EAGjC/J,EAAQgK,eAAiBjC,GAIvB+B,EAAOE,eAAiB/B,GACnB8B,KAAY,OAKjBD,EAAOE,eAAiBhC,GACnB+B,KAAY,QAAUN,GAAwBQ,EAAa,EAK7DC,EAAQN,GAAgBG,EAAO,EAGpC/J,EAAQgK,eAAiB/B,GAKzB6B,EAAOE,eAAiBhC,IACxB,CAACyB,GAAwBQ,EAAa,GAMtCH,EAAOE,eAAiBjC,IACxB,CAACyB,GAA+BS,EAAa,EAEtC,GAMP,CAACL,GAAgBG,EAAO,IACvBL,GAA6BK,EAAO,GAAK,CAACJ,GAAaI,EAAO,GAMjEzB,GAAAA,KAAsB,yBACtBF,GAAmBpI,EAAQgK,YAAY,GA3EhC,IA4FLG,GAAe,SAAUC,EAAM,CACnCvM,EAAUsF,EAAUI,QAAS,CAAEvD,QAASoK,CAAK,CAAC,EAE9C,GAAI,CAEFA,EAAKC,WAAWC,YAAYF,CAAI,QACzBnH,EAAG,CACVmH,EAAKG,OAAM,CACb,GASIC,GAAmB,SAAUC,EAAML,EAAM,CAC7C,GAAI,CACFvM,EAAUsF,EAAUI,QAAS,CAC3BmH,UAAWN,EAAKO,iBAAiBF,CAAI,EACrCG,KAAMR,CACR,CAAC,QACMnH,GAAG,CACVpF,EAAUsF,EAAUI,QAAS,CAC3BmH,UAAW,KACXE,KAAMR,CACR,CAAC,CACH,CAKA,GAHAA,EAAKS,gBAAgBJ,CAAI,EAGrBA,IAAS,MAAQ,CAAC7E,GAAa6E,CAAI,EACrC,GAAIzD,IAAcC,GAChB,GAAI,CACFkD,GAAaC,CAAI,CACnB,OAASnH,GAAG,CAAA,KAEZ,IAAI,CACFmH,EAAKU,aAAaL,EAAM,EAAE,CAC5B,OAASxH,GAAG,CAAA,GAWZ8H,GAAgB,SAAUC,EAAO,CAErC,IAAIC,EAAM,KACNC,GAAoB,KAExB,GAAInE,GACFiE,EAAQ,oBAAsBA,MACzB,CAEL,IAAMG,GAAU/M,EAAY4M,EAAO,aAAa,EAChDE,GAAoBC,IAAWA,GAAQ,CAAC,CAC1C,CAGE7C,KAAsB,yBACtBJ,KAAcD,KAGd+C,EACE,iEACAA,EACA,kBAGJ,IAAMI,GAAerG,GACjBA,GAAmBjC,WAAWkI,CAAK,EACnCA,EAKJ,GAAI9C,KAAcD,GAChB,GAAI,CACFgD,EAAM,IAAI5G,GAAS,EAAGgH,gBAAgBD,GAAc9C,EAAiB,CACvE,OAASrF,GAAG,CAAA,CAId,GAAI,CAACgI,GAAO,CAACA,EAAIK,gBAAiB,CAChCL,EAAMhG,GAAesG,eAAerD,GAAW,WAAY,IAAI,EAC/D,GAAI,CACF+C,EAAIK,gBAAgBE,UAAYrD,GAC5BnD,GACAoG,SACGnI,GAAG,CACV,CAEJ,CAEA,IAAMwI,GAAOR,EAAIQ,MAAQR,EAAIK,gBAU7B,OARIN,GAASE,IACXO,GAAKC,aACHlI,GAASmI,eAAeT,EAAiB,EACzCO,GAAKG,WAAW,CAAC,GAAK,IACxB,EAIE1D,KAAcD,GACT7C,GAAqByG,KAC1BZ,EACApE,GAAiB,OAAS,MAC5B,EAAE,CAAC,EAGEA,GAAiBoE,EAAIK,gBAAkBG,IAS1CK,GAAsB,SAAU1I,EAAM,CAC1C,OAAO8B,GAAmB2G,KACxBzI,EAAK0B,eAAiB1B,EACtBA,EAEAa,GAAW8H,aAAe9H,GAAW+H,aAAe/H,GAAWgI,UAC/D,IACF,GASIC,GAAe,SAAUC,EAAK,CAClC,OACEA,aAAe/H,KACd,OAAO+H,EAAIC,UAAa,UACvB,OAAOD,EAAIE,aAAgB,UAC3B,OAAOF,EAAI7B,aAAgB,YAC3B,EAAE6B,EAAIG,sBAAsBpI,KAC5B,OAAOiI,EAAItB,iBAAoB,YAC/B,OAAOsB,EAAIrB,cAAiB,YAC5B,OAAOqB,EAAInC,cAAiB,UAC5B,OAAOmC,EAAIT,cAAiB,YAC5B,OAAOS,EAAII,eAAkB,aAU7BC,GAAU,SAAUnM,EAAQ,CAChC,OAAO,OAAO0D,IAAS,YAAc1D,aAAkB0D,IAWnD0I,GAAe,SAAUC,EAAYC,EAAaC,GAAM,CACvDtH,GAAMoH,CAAU,GAIrBpP,EAAagI,GAAMoH,CAAU,EAAIG,IAAS,CACxCA,GAAKhB,KAAK1I,EAAWwJ,EAAaC,GAAMnE,EAAM,CAChD,CAAC,GAaGqE,GAAoB,SAAUH,EAAa,CAC/C,IAAI9H,EAAU,KAMd,GAHA4H,GAAa,yBAA0BE,EAAa,IAAI,EAGpDT,GAAaS,CAAW,EAC1BxC,OAAAA,GAAawC,CAAW,EACjB,GAIT,IAAM5C,GAAUlK,GAAkB8M,EAAYP,QAAQ,EAStD,GANAK,GAAa,sBAAuBE,EAAa,CAC/C5C,QAAAA,GACAgD,YAAatH,EACf,CAAC,EAICkH,EAAYJ,cAAa,GACzB,CAACC,GAAQG,EAAYK,iBAAiB,GACtCpO,GAAW,UAAW+N,EAAYnB,SAAS,GAC3C5M,GAAW,UAAW+N,EAAYN,WAAW,EAE7ClC,OAAAA,GAAawC,CAAW,EACjB,GAIT,GAAI,CAAClH,GAAasE,EAAO,GAAKzD,GAAYyD,EAAO,EAAG,CAElD,GAAI,CAACzD,GAAYyD,EAAO,GAAKkD,GAAsBlD,EAAO,IAEtDhE,GAAwBC,wBAAwBnH,QAChDD,GAAWmH,GAAwBC,aAAc+D,EAAO,GAMxDhE,GAAwBC,wBAAwB6C,UAChD9C,GAAwBC,aAAa+D,EAAO,GAE5C,MAAO,GAKX,GAAIzC,IAAgB,CAACG,GAAgBsC,EAAO,EAAG,CAC7C,IAAMM,GAAa3F,GAAciI,CAAW,GAAKA,EAAYtC,WACvDuB,GAAanH,GAAckI,CAAW,GAAKA,EAAYf,WAE7D,GAAIA,IAAcvB,GAAY,CAC5B,IAAM6C,GAAatB,GAAWtM,OAE9B,QAAS6N,GAAID,GAAa,EAAGC,IAAK,EAAG,EAAEA,GACrC9C,GAAWqB,aACTnH,GAAUqH,GAAWuB,EAAC,EAAG,EAAI,EAC7B3I,GAAemI,CAAW,CAC5B,CAEJ,CACF,CAEAxC,OAAAA,GAAawC,CAAW,EACjB,EACT,CASA,OANIA,aAAuB3I,IAAW,CAAC6F,GAAqB8C,CAAW,IAOpE5C,KAAY,YACXA,KAAY,WACZA,KAAY,aACdnL,GAAW,8BAA+B+N,EAAYnB,SAAS,GAE/DrB,GAAawC,CAAW,EACjB,KAIL/F,IAAsB+F,EAAYlJ,WAAa,IAEjDoB,EAAU8H,EAAYN,YAEtB/O,EAAa,CAACoE,EAAeC,GAAUC,EAAW,EAAIwL,IAAS,CAC7DvI,EAAUvG,EAAcuG,EAASuI,GAAM,GAAG,CAC5C,CAAC,EAEGT,EAAYN,cAAgBxH,IAC9BhH,EAAUsF,EAAUI,QAAS,CAAEvD,QAAS2M,EAAYpI,UAAS,CAAG,CAAC,EACjEoI,EAAYN,YAAcxH,IAK9B4H,GAAa,wBAAyBE,EAAa,IAAI,EAEhD,KAYHU,GAAoB,SAAUC,EAAOC,EAAQ/M,GAAO,CAExD,GACE2G,KACCoG,IAAW,MAAQA,IAAW,UAC9B/M,MAASgD,IAAYhD,MAASkI,IAE/B,MAAO,GAOT,GACEjC,EAAAA,IACA,CAACF,GAAYgH,CAAM,GACnB3O,GAAWiD,GAAW0L,CAAM,IAGvB,GAAI/G,EAAAA,IAAmB5H,GAAWkD,GAAWyL,CAAM,IAGnD,GAAI,CAAC3H,GAAa2H,CAAM,GAAKhH,GAAYgH,CAAM,GACpD,GAIGN,EAAAA,GAAsBK,CAAK,IACxBvH,GAAwBC,wBAAwBnH,QAChDD,GAAWmH,GAAwBC,aAAcsH,CAAK,GACrDvH,GAAwBC,wBAAwB6C,UAC/C9C,GAAwBC,aAAasH,CAAK,KAC5CvH,GAAwBK,8BAA8BvH,QACtDD,GAAWmH,GAAwBK,mBAAoBmH,CAAM,GAC5DxH,GAAwBK,8BAA8ByC,UACrD9C,GAAwBK,mBAAmBmH,CAAM,IAGtDA,IAAW,MACVxH,GAAwBM,iCACtBN,GAAwBC,wBAAwBnH,QAChDD,GAAWmH,GAAwBC,aAAcxF,EAAK,GACrDuF,GAAwBC,wBAAwB6C,UAC/C9C,GAAwBC,aAAaxF,EAAK,IAKhD,MAAO,WAGAqH,CAAAA,GAAoB0F,CAAM,GAI9B,GACL3O,CAAAA,GAAWmD,GAAgBzD,EAAckC,GAAOyB,GAAiB,EAAE,CAAC,GAK/D,GACJsL,GAAAA,IAAW,OAASA,IAAW,cAAgBA,IAAW,SAC3DD,IAAU,UACV9O,GAAcgC,GAAO,OAAO,IAAM,GAClCmH,GAAc2F,CAAK,IAMd,GACL5G,EAAAA,IACA,CAAC9H,GAAWoD,GAAmB1D,EAAckC,GAAOyB,GAAiB,EAAE,CAAC,IAInE,GAAIzB,GACT,MAAO,QAMT,MAAO,IAWHyM,GAAwB,SAAUlD,EAAS,CAC/C,OAAOA,EAAQtL,QAAQ,GAAG,EAAI,GAa1B+O,GAAsB,SAAUb,EAAa,CAEjDF,GAAa,2BAA4BE,EAAa,IAAI,EAE1D,GAAM,CAAEL,WAAAA,CAAW,EAAIK,EAGvB,GAAI,CAACL,EACH,OAGF,IAAMmB,GAAY,CAChBC,SAAU,GACVC,UAAW,GACXC,SAAU,GACVC,kBAAmBjI,IAEjB7F,GAAIuM,EAAWhN,OAGnB,KAAOS,MAAK,CACV,IAAM+N,GAAOxB,EAAWvM,EAAC,EACnB,CAAE0K,KAAAA,GAAMT,aAAAA,GAAcxJ,MAAOmN,EAAU,EAAIG,GAC3CP,GAAS1N,GAAkB4K,EAAI,EAEjCjK,GAAQiK,KAAS,QAAUkD,GAAYjP,GAAWiP,EAAS,EAkB/D,GAfAF,GAAUC,SAAWH,GACrBE,GAAUE,UAAYnN,GACtBiN,GAAUG,SAAW,GACrBH,GAAUM,cAAgBjO,OAC1B2M,GAAa,wBAAyBE,EAAac,EAAS,EAC5DjN,GAAQiN,GAAUE,UAEdF,GAAUM,gBAKdvD,GAAiBC,GAAMkC,CAAW,EAG9B,CAACc,GAAUG,UACb,SAIF,GAAI,CAACjH,IAA4B/H,GAAW,OAAQ4B,EAAK,EAAG,CAC1DgK,GAAiBC,GAAMkC,CAAW,EAClC,QACF,CAGI/F,IACFtJ,EAAa,CAACoE,EAAeC,GAAUC,EAAW,EAAIwL,IAAS,CAC7D5M,GAAQlC,EAAckC,GAAO4M,GAAM,GAAG,CACxC,CAAC,EAIH,IAAME,GAAQzN,GAAkB8M,EAAYP,QAAQ,EACpD,GAAKiB,GAAkBC,GAAOC,GAAQ/M,EAAK,EAgB3C,IATI4G,KAAyBmG,KAAW,MAAQA,KAAW,UAEzD/C,GAAiBC,GAAMkC,CAAW,EAGlCnM,GAAQ6G,GAA8B7G,IAKtCuE,IACA,OAAOzC,IAAiB,UACxB,OAAOA,GAAa0L,kBAAqB,YAErChE,CAAAA,GAGF,OAAQ1H,GAAa0L,iBAAiBV,GAAOC,EAAM,EAAC,CAClD,IAAK,cAAe,CAClB/M,GAAQuE,GAAmBjC,WAAWtC,EAAK,EAC3C,KACF,CAEA,IAAK,mBAAoB,CACvBA,GAAQuE,GAAmBhC,gBAAgBvC,EAAK,EAChD,KACF,CAKF,CAKJ,GAAI,CACEwJ,GACF2C,EAAYsB,eAAejE,GAAcS,GAAMjK,EAAK,EAGpDmM,EAAY7B,aAAaL,GAAMjK,EAAK,EAGtC7C,EAASwF,EAAUI,OAAO,CAC5B,OAASN,GAAG,CAAA,EACd,CAGAwJ,GAAa,0BAA2BE,EAAa,IAAI,GAQrDuB,GAAqB,SAArBA,GAA+BC,EAAU,CAC7C,IAAIC,EAAa,KACXC,GAAiBvC,GAAoBqC,CAAQ,EAKnD,IAFA1B,GAAa,0BAA2B0B,EAAU,IAAI,EAE9CC,EAAaC,GAAeC,SAAQ,GAE1C7B,GAAa,yBAA0B2B,EAAY,IAAI,EAGnDtB,CAAAA,GAAkBsB,CAAU,IAK5BA,EAAWvJ,mBAAmBhB,IAChCqK,GAAmBE,EAAWvJ,OAAO,EAIvC2I,GAAoBY,CAAU,GAIhC3B,GAAa,yBAA0B0B,EAAU,IAAI,GAWvDhL,OAAAA,EAAUoL,SAAW,SAAUvD,GAAiB,CAAA,IAAVjC,EAAG1J,UAAAC,OAAA,GAAAD,UAAA,CAAA,IAAAS,OAAAT,UAAA,CAAA,EAAG,CAAA,EACtCoM,EAAO,KACP+C,GAAe,KACf7B,GAAc,KACd8B,GAAa,KAUjB,GANAtG,GAAiB,CAAC6C,GACd7C,KACF6C,GAAQ,SAIN,OAAOA,IAAU,UAAY,CAACwB,GAAQxB,EAAK,EAC7C,GAAI,OAAOA,GAAM7M,UAAa,YAE5B,GADA6M,GAAQA,GAAM7M,SAAQ,EAClB,OAAO6M,IAAU,SACnB,MAAMjM,GAAgB,iCAAiC,MAGzD,OAAMA,GAAgB,4BAA4B,EAKtD,GAAI,CAACoE,EAAUO,YACb,OAAOsH,GAgBT,GAZKlE,IACHgC,GAAaC,CAAG,EAIlB5F,EAAUI,QAAU,CAAA,EAGhB,OAAOyH,IAAU,WACnBzD,GAAW,IAGTA,IAEF,GAAIyD,GAAMoB,SAAU,CAClB,IAAMrC,GAAUlK,GAAkBmL,GAAMoB,QAAQ,EAChD,GAAI,CAAC3G,GAAasE,EAAO,GAAKzD,GAAYyD,EAAO,EAC/C,MAAMhL,GACJ,yDACF,CAEJ,UACSiM,cAAiBjH,GAG1B0H,EAAOV,GAAc,SAAS,EAC9ByD,GAAe/C,EAAK3G,cAAcO,WAAW2F,GAAO,EAAI,EACpDwD,GAAa/K,WAAa,GAAK+K,GAAapC,WAAa,QAGlDoC,GAAapC,WAAa,OADnCX,EAAO+C,GAKP/C,EAAKiD,YAAYF,EAAY,MAE1B,CAEL,GACE,CAACxH,IACD,CAACJ,IACD,CAACC,IAEDmE,GAAMvM,QAAQ,GAAG,IAAM,GAEvB,OAAOsG,IAAsBmC,GACzBnC,GAAmBjC,WAAWkI,EAAK,EACnCA,GAON,GAHAS,EAAOV,GAAcC,EAAK,EAGtB,CAACS,EACH,OAAOzE,GAAa,KAAOE,GAAsBlC,GAAY,EAEjE,CAGIyG,GAAQ1E,IACVoD,GAAasB,EAAKkD,UAAU,EAI9B,IAAMC,GAAe9C,GAAoBvE,GAAWyD,GAAQS,CAAI,EAGhE,KAAQkB,GAAciC,GAAaN,SAAQ,GAErCxB,GAAkBH,EAAW,IAK7BA,GAAY9H,mBAAmBhB,IACjCqK,GAAmBvB,GAAY9H,OAAO,EAIxC2I,GAAoBb,EAAW,GAIjC,GAAIpF,GACF,OAAOyD,GAIT,GAAIhE,GAAY,CACd,GAAIC,GAGF,IAFAwH,GAAatJ,GAAuB0G,KAAKJ,EAAK3G,aAAa,EAEpD2G,EAAKkD,YAEVF,GAAWC,YAAYjD,EAAKkD,UAAU,OAGxCF,GAAahD,EAGf,OAAI7F,GAAaiJ,YAAcjJ,GAAakJ,kBAQ1CL,GAAapJ,GAAWwG,KAAKlI,EAAkB8K,GAAY,EAAI,GAG1DA,EACT,CAEA,IAAIM,GAAiBlI,GAAiB4E,EAAKuD,UAAYvD,EAAKD,UAG5D,OACE3E,IACApB,GAAa,UAAU,GACvBgG,EAAK3G,eACL2G,EAAK3G,cAAcmK,SACnBxD,EAAK3G,cAAcmK,QAAQxE,MAC3B7L,GAAW4G,GAA0BiG,EAAK3G,cAAcmK,QAAQxE,IAAI,IAEpEsE,GACE,aAAetD,EAAK3G,cAAcmK,QAAQxE,KAAO;EAAQsE,IAIzDnI,IACFtJ,EAAa,CAACoE,EAAeC,GAAUC,EAAW,EAAIwL,IAAS,CAC7D2B,GAAiBzQ,EAAcyQ,GAAgB3B,GAAM,GAAG,CAC1D,CAAC,EAGIrI,IAAsBmC,GACzBnC,GAAmBjC,WAAWiM,EAAc,EAC5CA,IASN5L,EAAU+L,UAAY,UAAoB,CAAA,IAAVnG,GAAG1J,UAAAC,OAAA,GAAAD,UAAA,CAAA,IAAAS,OAAAT,UAAA,CAAA,EAAG,CAAA,EACpCyJ,GAAaC,EAAG,EAChBjC,GAAa,IAQf3D,EAAUgM,YAAc,UAAY,CAClC1G,GAAS,KACT3B,GAAa,IAaf3D,EAAUiM,iBAAmB,SAAUC,GAAKvB,EAAMtN,EAAO,CAElDiI,IACHK,GAAa,CAAA,CAAE,EAGjB,IAAMwE,GAAQzN,GAAkBwP,EAAG,EAC7B9B,GAAS1N,GAAkBiO,CAAI,EACrC,OAAOT,GAAkBC,GAAOC,GAAQ/M,CAAK,GAU/C2C,EAAUmM,QAAU,SAAU5C,GAAY6C,EAAc,CAClD,OAAOA,GAAiB,aAI5BjK,GAAMoH,EAAU,EAAIpH,GAAMoH,EAAU,GAAK,CAAA,EACzC7O,EAAUyH,GAAMoH,EAAU,EAAG6C,CAAY,IAW3CpM,EAAUqM,WAAa,SAAU9C,GAAY,CAC3C,GAAIpH,GAAMoH,EAAU,EAClB,OAAO/O,EAAS2H,GAAMoH,EAAU,CAAC,GAUrCvJ,EAAUsM,YAAc,SAAU/C,GAAY,CACxCpH,GAAMoH,EAAU,IAClBpH,GAAMoH,EAAU,EAAI,CAAA,IAQxBvJ,EAAUuM,eAAiB,UAAY,CACrCpK,GAAQ,CAAA,GAGHnC,CACT,CAEA,IAAAwM,GAAezM,GAAe,gBCxmDvB,SAAS0M,GAAMC,EAAwBC,EAA0BC,EAA2BC,EAAUC,EAAS,CACpH,OAAO,SAAUC,EAASC,EAAU,CAClC,IAAIC,EAAMP,EAAuB,OAAO,EACpCQ,EAAWR,EAAuB,SAASI,EAAQ,IAAKG,CAAG,EAE/D,GADAA,EAAI,KAAKH,EAAQ,QAAU,MAAOI,EAAU,GAAMJ,EAAQ,SAAUA,EAAQ,QAAQ,EAChFA,EAAQ,QACV,GAAI,CAEF,QAASK,EAAI,EAAGC,GAASA,EAASN,EAAQ,QAAQK,CAAC,IAAM,KAAMA,IAC7DF,EAAI,iBAAiBG,EAAO,MAAOA,EAAO,KAAK,CAEnD,OAASC,EAAG,CACVN,EAAQM,CAAC,CACX,CAEF,IAAIC,EAAU,SAAUC,EAAU,CAChC,OAAO,UAAY,CACjBR,EAAQ,IAAI,MAAMQ,CAAQ,CAAC,CAC7B,CACF,EACA,OAAAN,EAAI,QAAUK,EAAQV,CAAyB,EAC/CK,EAAI,UAAYK,EAAQX,CAAwB,EAChDM,EAAI,OAAS,UAAY,CACvBD,EAAS,CACP,OAAQC,EAAI,OACZ,WAAYA,EAAI,WAChB,QAASA,EAAI,sBAAsB,EAAE,MAAM;AAAA,CAAM,EAC9C,OAAO,SAAUG,EAAQ,CACxB,OAAOA,EAAO,OAAS,CACzB,CAAC,EACA,IAAI,SAAUA,EAAQ,CACrB,IAAID,EAAIC,EAAO,QAAQ,GAAG,EAC1B,OAAOP,EAASO,EAAO,UAAU,EAAGD,CAAC,CAAC,EAAEC,EAAO,UAAUD,EAAI,CAAC,CAAC,CACjE,CAAC,EACH,KAAMF,EAAI,QACZ,CAAC,CACH,EACAA,EAAI,aAAeH,EAAQ,aAC3BG,EAAI,gBAAkBH,EAAQ,gBAC9BG,EAAI,QAAUH,EAAQ,QACtBG,EAAI,KAAKH,EAAQ,OAAO,EAEjB,SAAUU,EAAOC,EAAeC,EAAgB,CACrD,GAAI,CACFT,EAAI,MAAM,CACZ,OAASI,EAAG,CACV,OAAOI,EAAcJ,CAAC,CACxB,CACA,OAAOK,EAAe,CACxB,CACF,CACF,CCnDO,IAAMC,GAAW,SAAUC,EAAG,CACnC,OAAO,SAAUC,EAAK,CAGpB,QAFIC,EAAID,EAAI,OACRE,EAAS,IAAI,MAAMD,CAAC,EACfE,EAAI,EAAGA,EAAIF,EAAGE,IACrBD,EAAOC,CAAC,EAAIJ,EAAEC,EAAIG,CAAC,CAAC,EAEtB,OAAOD,CACT,CACF,ECMA,IAAAE,GAAA,SAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QACkBF,EAAGC,EAAEC,CAAA,CAAA,MAHrBC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,SCKA,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,UAEFC,GAAA,UAAA,SAAAC,EAAA,QACeA,iBADf,UAAA,aCZA,IAAAC,GACY,GC6GZ,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QACkBH,EAALC,EAAEC,CAAA,CAAA,EAAMD,EAAEE,CAAA,CAAA,MA5FvBC,GAAA,SAAAJ,EAAA,QAAA,SAAAK,EAAA,QAAA,SAAAC,EAAA,QACaN,EAAEM,CAAA,EAAED,CAAA,KAajBE,EAAA,SAAAD,EAAA,QAAA,SAAAE,EAAA,QACYF,ICUZ,IAAAG,GAAA,UAAA,yCCrBE,IAAAC,EAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,KASFC,GAAA,SAAAC,EAAA,OACoBH,EAAAG,CAAA,SADpB,SAAAC,EAAA,QAAA,SAAAC,EAAA,UACkBA,CAAA,EAAMD,CAAA,KA2BxBE,GAAA,SAAAH,EAAA,QACOH,EAAAG,CAAA,EAAAI,EAAA,MAAA,CAAA,GAUPC,GAAA,SAAAL,EAAA,OACuBH,EAAAG,CAAA,SADvB,SAAAE,EAAA,QAAA,SAAAI,EAAA,YACqBA,CAAA,CAAA,EAAMJ,CAAA,KAhC3B,IAAAK,GAAA,SChDO,IAAMC,GAAe,SAAUC,EAAI,CACxC,OAAO,SAAUC,EAAI,CACnB,OAAOD,EAAKC,CACd,CACF,EAEaC,GAAc,SAAUC,EAAI,CACvC,OAAO,SAAUC,EAAI,CACnB,OAAID,EAAG,SAAW,EAAUC,EACxBA,EAAG,SAAW,EAAUD,EACrBA,EAAG,OAAOC,CAAE,CACrB,CACF,ECFE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,eCoBF,IAAAC,GAAA,SAAAC,EAAA,CAGE,IAAAC,EAAA,SAAAC,EAAA,qBAAMA,EAANC,iCAFSF,EAAKD,CAAA,GCzBT,IAAMI,GAAY,SAAUC,EAAO,CACxC,OAAO,SAAUC,EAAK,CACpB,OAAOA,EAAID,CAAK,CAClB,CACF,EC4BA,IAAAE,GAAA,YAYA,IAAAC,GAAA,YAhBE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,QCEA,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,KCpCK,IAAMC,GAAa,SAAUC,EAAI,CACtC,OAAO,SAAUC,EAAI,CAKnB,QAJIC,EAAIF,EAAG,OACPG,EAAIF,EAAG,OACPG,EAAS,IAAI,MAAMF,EAAEC,CAAC,EACtBE,EAAI,EACCC,EAAI,EAAGA,EAAIJ,EAAGI,IAErB,QADIC,EAAIP,EAAGM,CAAC,EACHE,EAAI,EAAGA,EAAIL,EAAGK,IACrBJ,EAAOC,GAAG,EAAIE,EAAEN,EAAGO,CAAC,CAAC,EAGzB,OAAOJ,CACT,CACF,gBC6CA,IAAAK,GAAA,mBAAA,UAAA,aAPEC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,OAsBF,IAAAC,GAAA,SAAAC,EAAA,OACuCC,GAAAD,CAAA,2BADvC,SAAA,EAAA,QAAA,SAAAE,EAAA,mBACqC,CAAA,CAAA,EAAMA,CAAA,KAY3CC,GAAA,SAAAH,EAAA,OACsBC,GAAAD,CAAA,2BADtB,SAAAI,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAH,EAAA,YACcE,CAAA,EAAMC,CAAA,CAAA,EAAMH,CAAA,MCrDxB,IAAAI,EAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,MAgCFC,GAAA,SAAAC,EAAA,OAEgBH,EAAAG,CAAA,SAFhB,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACO,GAAA,CAAPD,EAAa,OAAbC,EACO,GADPD,EACY,OAAAE,EAAA,MAAA,4GADZF,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,KANAE,GAAA,SAAAJ,EAAA,OAEeH,EAAAG,CAAA,SAFf,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACK,GAALD,EAAU,OAAVC,EACK,GAAA,CADLD,EACW,OAAAE,EAAA,MAAA,4GADXF,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,KALAG,GAAA,SAAAL,EAAA,wBACaH,EAAAG,CAAA,SADb,SAAAM,EAAA,QAAA,SAAAC,EAAA,YACkBD,CAAA,CAAA,EAAMC,CAAA,KCxDjB,IAAMC,GAAU,SACVC,GAAa,KAEbC,GAAY,OAAO,kBACnBC,GAAe,OAAO,kBCPnC,IAAIC,GAAoB,SAAUC,EAAI,CACpC,OAAO,SAAUC,EAAI,CACnB,OAAO,SAAUC,EAAI,CACnB,OAAO,SAAUC,EAAG,CAClB,OAAO,SAAUC,EAAG,CAClB,OAAOD,EAAIC,EAAIJ,EAAKG,IAAMC,EAAIH,EAAKC,CACrC,CACF,CACF,CACF,CACF,EAGO,IAAMG,GAAaC,GAEnB,IAAMC,GAAgBC,GAChBC,GAAcD,GChB3B,IAAIE,GAAQ,SAAUC,EAAI,CACxB,OAAO,SAAUC,EAAI,CACnB,OAAOD,IAAOC,CAChB,CACF,EAGO,IAAMC,GAAYC,GAElB,IAAMC,GAAaC,GACbC,GAAeD,GAEfE,GAAc,SAAUC,EAAG,CACtC,OAAO,SAAUC,EAAI,CACnB,OAAO,SAAUC,EAAI,CACnB,GAAID,EAAG,SAAWC,EAAG,OAAQ,MAAO,GACpC,QAASC,EAAI,EAAGA,EAAIF,EAAG,OAAQE,IAC7B,GAAI,CAACH,EAAEC,EAAGE,CAAC,CAAC,EAAED,EAAGC,CAAC,CAAC,EAAG,MAAO,GAE/B,MAAO,EACT,CACF,CACF,ECuCA,IAAAC,GAAA,IAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,OACW,MAJXC,GAAA,QATA,IAAAC,GAAA,QAMAC,GAAA,QApBE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,IAgCF,IAAAC,GAAA,SAAAC,EAAA,OAAA,OACmBC,GAAAD,CAAA,CAAA,ICxDnB,IAAAE,EAAA,UAAA,yCAAAC,EAAA,UAAA,yCAAAC,GAAA,UAAA,yCAEA,IAAAC,GAAA,IAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAGK,OAFHD,aAAAE,GAAAD,aAAAC,GAAAF,aAAAG,GAAAF,aAAAE,GAAAH,aAAAI,IAAAH,aAAAG,MCfK,IAAMC,GAAS,SAAUC,EAAG,CACjC,OAAO,SAAUC,EAAG,CAElB,OAAOD,EAAIC,EAAI,CACjB,CACF,ECLO,IAAMC,GAAS,SAAUC,EAAG,CACjC,OAAO,SAAUC,EAAG,CAElB,OAAOD,EAAIC,EAAI,CACjB,CACF,EAEaC,GAAS,SAAUF,EAAG,CACjC,OAAO,SAAUC,EAAG,CAElB,OAAOD,EAAIC,EAAI,CACjB,CACF,ECwCA,IAAAE,GAAA,aAES,aAED,GCzBR,IAAAC,GAAA,kBAAA,UAAA,aCkCA,IAAAC,GAAA,SAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,uBAAA,UAAA,aANAC,GAAA,UAAA,OAAA,4CAAA,UAAA,gBANA,IAAAC,GAAA,UAAA,OAAA,4CAAA,UAAA,gBASAC,GAAA,UAAA,OAAA,4CAAA,UAAA,gBAdE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,SAoHF,IAAAC,GAAA,SAAAC,EAAA,OACkBC,GAAAD,CAAA,SADlB,SAAAE,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,UAC2BF,EAAEC,CAAA,CAAA,EAAID,EAAEE,CAAA,CAAA,MC5IjC,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,KAkBF,IAAAC,GAAA,uBAAA,UAAA,aAjBE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,QC1BK,IAAMC,GAAc,SAAU,EAAG,CACtC,OAAO,EAAE,SAAS,CACpB,EAEaC,GAAiB,SAAU,EAAG,CACzC,IAAIC,EAAM,EAAE,SAAS,EACrB,OAAO,MAAMA,EAAM,IAAI,EAAIA,EAAMA,EAAM,IACzC,EAmBO,IAAMC,GAAiB,SAAUC,EAAG,CACzC,IAAIC,EAAID,EAAE,OACV,MAAO,IAAOA,EAAE,QACd,oBACA,SAAUE,EAAGC,EAAG,CACd,OAAQD,EAAG,CACT,IAAK,IACL,IAAK,KACH,MAAO,KAAOA,EAChB,IAAK,OAAQ,MAAO,MACpB,IAAK,KAAM,MAAO,MAClB,IAAK,KAAM,MAAO,MAClB,IAAK;AAAA,EAAM,MAAO,MAClB,IAAK,KAAM,MAAO,MAClB,IAAK,IAAM,MAAO,MAClB,IAAK,KAAM,MAAO,KACpB,CACA,IAAIE,EAAID,EAAI,EACRE,EAAQD,EAAIH,GAAKD,EAAEI,CAAC,GAAK,KAAOJ,EAAEI,CAAC,GAAK,IAAM,MAAQ,GAC1D,MAAO,KAAOF,EAAE,WAAW,CAAC,EAAE,SAAS,EAAE,EAAIG,CAC/C,CACF,EAAI,GACN,ECPA,IAAAC,GAAA,UANA,IAAAC,GAAA,UAHAC,GAAA,UATE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,oBCNFC,EAAA,UAAA,yCAAAC,EAAA,UAAA,+EA2NA,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACM,GAANA,aAAAC,SAAAH,EACM,GADNE,aAAAE,EACgB,OADhBH,EAAAC,EAAA,MAAA,qGAAAF,EAAA,YAAA,KAAAC,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,KA4CAG,GACYN,GAAM,EAAA,EAAAO,EAAY,EAAA,CAAA,EAL9BC,GACSR,GAAM,EAAA,EAAAO,EAAa,EAAA,CAAA,EAvP5B,IAAAE,GAAA,KAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACM,OAAJA,aAAAC,EAAa,IAAAA,EAAbF,EAAAC,EAAA,MAAA,CAAA,EACIE,EAAA,kBAoON,IAAAC,GAAA,SAAAC,EAAA,QACcC,GAAMD,CAAA,EAAAE,EAAA,GAyBpBC,GAAA,UAAA,QAAA,SAAAC,EAAA,CACU,GAAVA,aAAAC,EAAe,OAAfD,EAAA,0GAAAA,EAAA,YAAA,IAAA,CAAA,IA9NA,IAAAE,GAAA,OAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACS,GAAPD,aAAAE,EAAY,OAAAC,GAAZH,EAAA,MAAA,EAAAC,CAAA,EACM,GADND,aAAAI,EACgB,OAAAA,EAAA,uGADhBJ,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,aADF,UAAA,aA0DA,IAAAI,GAAA,MAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACQ,GAAND,aAAAE,EAAW,OAAXD,EAAAD,EAAA,MAAA,EACK,GADLA,aAAAG,EACc,OAAAA,EAAA,yGADdH,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,WADF,UAAA,aAnCA,IAAAG,GAAA,UAAA,OAAA,sBAAA,UAAA,gBChFA,IAAAC,GACkB,mBALlBC,GAC4B,oCCQ5B,IAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EA8BAC,GACc,SAAAC,EAAA,CACZ,OAAAA,aAAAH,GAAe,IAAAI,EAAAC,EAAA,EACfF,aAAAF,GAAK,IAAAG,EAAAE,EAAA,EACLC,EAAA,OAhBFC,GAAA,UAAA,qBC9BO,IAAMC,EAAe,SAAUC,EAAG,CACvC,OAAOA,CACT,ECqBA,IAAAC,GAAA,UAAA,uBCQA,IAAAC,GAAA,UAAA,YA2DA,IAAAC,GAAA,UAAA,QAAA,UAAA,QAAA,UAAA,QAAA,UAAA,QAAA,SAAAC,EAAA,4BCrFA,IAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,qHAkBAC,GAAA,SAAAC,EAAA,CAEO,GADPA,aAAAJ,IAAAI,aAAAH,GACmB,OAAAI,GADnBD,EAAA,MAAA,EAEO,GAFPA,aAAAF,GAEqB,OAFrBE,EAAA,kHAAAA,EAAA,YAAA,IAAA,CAAA,GANA,IAAAE,GAAA,SAAAC,EAAA,CACM,GAANA,aAAAC,GAAa,MAAK,SACZ,GADND,aAAAE,GACkB,MAAK,eACjB,GAFNF,aAAAG,GAEoB,OAFpBH,EAAA,kHAAAA,EAAA,YAAA,IAAA,CAAA,iBCRAI,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EA4BAC,GAEE,SAAAC,EAAA,CACE,GAAAA,aAAAP,GAAY,MAAK,cACjB,GAAAO,aAAAN,GAAK,MAAK,OACV,GAAAM,aAAAL,GAAS,MAAK,WAEd,GADAK,aAAAJ,IACAI,aAAAH,GAAO,MAAK,OACZ,GAAAG,aAAAF,GAAO,MAAK,qIAEhBG,GAEE,SAAAD,EAAA,CACE,OAAAA,aAAAJ,GAAK,IAAAM,EAAAC,EAAA,EACLC,EAAA,OAtBJC,GAAA,UAAA,sBAHAC,GAAA,UAAA,sBAMAC,GAAA,UAAA,sBChCA,IAAAC,GAAA,UAAA,qHCJO,IAAMC,GAAY,SAAUC,EAAK,CACtC,OAAO,SAAUC,EAAG,CAElB,QADIC,EAAS,CAAC,EACLC,EAAI,EAAGC,EAAIJ,EAAI,OAAQG,EAAIC,EAAGD,IACrC,MAAM,UAAU,KAAK,MAAMD,EAAQD,EAAED,EAAIG,CAAC,CAAC,CAAC,EAE9C,OAAOD,CACT,CACF,gBCmGEG,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,SAdF,IAAAC,GAAA,gBAAA,UAAA,aArCEC,EAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,MASFC,GAAA,SAAAC,EAAA,WACmBH,EAAAG,CAAA,CAAA,GAoEnBC,GAAA,SAAAD,EAAA,OACgCD,GAAAC,CAAA,SADhC,SAAAE,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,UAC8BF,CAAA,EAAMC,EAAEC,CAAA,CAAA,MAPtCC,GAAA,SAAAL,EAAA,OAC2BH,EAAAG,CAAA,SAD3B,SAAAE,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,UACuBF,EAAEE,CAAA,CAAA,EAAMD,CAAA,MApB/B,IAAAG,GAAA,SAAA,SAAAC,EAAA,QACYC,EAAAD,CAAA,IAMZ,IAAAE,GAAA,SAAAC,EAAA,OACWC,EAAAD,CAAA,SADX,SAAAE,EAAA,UACSA,CAAA,EAAAC,EAAA,ICrGT,IAAAC,EAAA,UAAA,+EAAAC,EAAA,UAAA,+EAsPA,IAAAC,GAAA,SAAAC,EAAA,iBACqBA,CAAA,CAAA,EAAAC,EAAA,MAAA,GAzOrB,IAAAC,GAAA,yPAiLA,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACO,GAAPA,aAAAC,EAAiB,OAAjBH,EAAAE,EAAA,MAAA,EACO,GADPA,aAAAE,EACkB,OADlBH,EAAAC,EAAA,MAAA,sGAAAF,EAAA,YAAA,KAAAC,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,KA0EAG,GAAA,UAAA,QACON,GAAAO,EAAAC,EAAA,KAAA,CAAA,EAAAC,EAAA,MAAA,KAtNP,IAAAC,GAAA,OAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACS,GAAPD,aAAAE,EAAY,OAAA,IAAAA,EAAZF,EAAA,MAAA,EACO,GADPA,aAAAG,EACa,OAAAC,GADbJ,EAAA,MAAA,EAAAC,CAAA,oGAAAD,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,aADF,UAAA,aAuBA,IAAAI,GAAA,UAAA,OAAA,sBAAA,UAAA,gBC5FO,IAAMC,GAAQ,SAAUC,EAAG,CAChC,OAAO,UAAY,CACjB,OAAOA,CACT,CACF,EAEaC,GAAQ,SAAUD,EAAG,CAChC,OAAO,SAAUE,EAAG,CAClB,OAAO,UAAY,CACjB,OAAOA,EAAEF,EAAE,CAAC,EAAE,CAChB,CACF,CACF,EC4CA,IAAAG,GAAA,SAAAC,EAAA,kDAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,UAEOD,CAAA,EAAL,SAAAE,EAAA,UACKA,CAAA,EAAED,CAAA,OAITE,GAAA,SAAAJ,EAAA,kDAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,UAEOD,CAAA,EAAL,SAAAE,EAAA,UACOA,CAAA,EAAED,CAAA,OAeX,IAAAG,GAAA,SAAAC,EAAA,iDAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,UAEQD,CAAA,EAAN,SAAAE,EAAA,UACMD,CAAA,EAAN,SAAAE,EAAA,UACMD,EAAGC,CAAA,CAAA,SCrFJ,IAAMC,GAAY,SAAUC,EAAG,CACpC,OAAO,KAAK,IAAI,KAAK,IAAIA,CAAC,EAAG,UAAU,CACzC,EAIaC,GAAS,SAAUD,EAAG,CACjC,OAAO,SAAUE,EAAG,CAClB,OAAIA,IAAM,EAAU,EACbA,EAAI,EAAI,KAAK,MAAMF,EAAIE,CAAC,EAAI,CAAC,KAAK,MAAMF,EAAI,CAACE,CAAC,CACvD,CACF,EAEaC,GAAS,SAAUH,EAAG,CACjC,OAAO,SAAUE,EAAG,CAClB,GAAIA,IAAM,EAAG,MAAO,GACpB,IAAIE,EAAK,KAAK,IAAIF,CAAC,EACnB,OAASF,EAAII,EAAMA,GAAMA,CAC3B,CACF,ECKA,IAAAC,GAAA,OAAA,UAAA,aC6CE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,KAIF,IAAAC,GAAA,0CAAA,UAAA,aALEC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,KCXF,IAAAC,GAAA,QACW,cADX,UAAA,aAGA,IAAAC,GAAA,QACW,CAAA,aADX,UAAA,aAdE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,QAiDF,IAAAC,GAAA,SAAAC,EAAA,OAEgBC,GAAAD,CAAA,SAFhB,SAAAE,EAAA,QAAA,SAAAC,EAAA,CACM,GAAND,EAAW,OAAXC,EACM,GAAA,CADND,EACY,OAAAE,oGADZF,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,sNC7DAE,GAAA,cAAA,UAAA,kBAAA,UAAA,aALAC,GAAA,gBAAA,UAAA,gBALAC,GAAA,gBAAA,UAAA,gEANA,6DAGA,uBAAA,UAAA,kBAHAC,GAAAC,GAAA,EAAA,EAGAC,GAAAC,GAAA,EAAA,YAkBAC,GAAA,SAAAC,EAAA,OAAA,oBAKAC,GAAA,SAAAC,EAAA,gCAAA,6BAAA,UAAA,aCzCO,SAASC,GAAMC,EAAK,CACzB,OAAO,IAAI,MAAMA,CAAG,CACtB,CAEO,SAASC,GAAQC,EAAG,CACzB,OAAOA,EAAE,OACX,CAcO,SAASC,GAAeC,EAAG,CAChC,OAAO,UAAY,CACjB,MAAMA,CACR,CACF,CCoDA,IAAAC,GACQ,SAAAC,EAAA,cAAAA,CAAA,CAAA,GC1DN,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,YAiBA,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,YAqBF,IAAAC,GAAA,SAAAC,EAAA,OAKuBC,GAAAD,CAAA,6FALvB,SAAAE,EAAA,sBAKmBA,CAAA,CAAA,EAAiB,SAAAC,EAAA,mBAAAA,CAAA,CAAA,MCrDpC,IAAAC,GAAA,SAAAC,EAAA,QAAAA,GAmCA,IAAAC,GAAA,mDAQA,IAAAC,GAAA,OAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACS,OAAPD,EAAAC,CAAA,aADF,UAAA,aAMAC,GAAA,MAAA,SAAAF,EAAA,QAAA,SAAAG,EAAA,CACQ,OAANA,EAAAH,CAAA,WADF,UAAA,aAHAI,GAAA,MACSC,UADT,UAAA,aAMAC,GAAA,cAAA,UAAA,kBAAA,UAAA,aCjEO,IAAMC,GAAO,SAAUC,EAAK,CACjC,OAAO,UAAY,CACjB,MAAO,CAAE,MAAOA,CAAI,CACtB,CACF,EAUO,IAAMC,GAAO,SAAUC,EAAK,CACjC,OAAO,UAAY,CACjB,OAAOA,EAAI,KACb,CACF,EAEaC,GAAa,SAAUC,EAAG,CACrC,OAAO,SAAUF,EAAK,CACpB,OAAO,UAAY,CACjB,IAAI,EAAIE,EAAEF,EAAI,KAAK,EACnB,OAAAA,EAAI,MAAQ,EAAE,MACP,EAAE,KACX,CACF,CACF,EAEaG,GAAQ,SAAUC,EAAK,CAClC,OAAO,SAAUJ,EAAK,CACpB,OAAO,UAAY,CACjBA,EAAI,MAAQI,CACd,CACF,CACF,gBCSAC,GAAAC,GAYAC,GAAAC,GAOAC,GAAA,SAAAC,EAAA,QACWH,GAAQ,SAAAI,EAAA,CAAU,IAAAC,EAAKF,EAAEC,CAAA,QAAK,OAASC,QAAWA,MAG7DC,GAAA,SAAAH,EAAA,QAAA,SAAAC,EAAA,WACqBF,GAAOC,CAAA,EAAEC,CAAA,CAAA,2BCzC9BG,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EA8BEC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,UAiEF,IAAAC,GAAA,UAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAYI,IAAAC,EACyB,SAAAC,EAAA,CAAE,GAAAA,aAAAC,GAAK,OAAAD,EAAA,qJAXhC,UAAA,cAAiBH,EAAEC,CAAA,CAAA,EAAA,0BAEF,UAAA,UAANI,CAAA,EAAA,EACP,GAAAF,aAAAG,GAAA,OACON,EAAAG,EAAA,MAAA,EAAA,YACUI,CAAA,EAAEF,CAAA,EAAA,EACZ,GACP,GAAAF,aAAAC,GAAK,MAAU,6JACnBF,CAAA,EAAAM,GAAsBH,CAAA,CAAA,EAAA,YAV1B,UAAA,aC3HO,IAAMI,GAAW,SAAUC,EAAI,CACpC,OAAO,SAAUC,EAAI,CACnB,OAAOD,GAAMC,CACf,CACF,EAEaC,GAAW,SAAUF,EAAI,CACpC,OAAO,SAAUC,EAAI,CACnB,OAAOD,GAAMC,CACf,CACF,EAEaE,GAAU,SAAUC,EAAG,CAClC,MAAO,CAACA,CACV,ECuCE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,IAIA,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,KAHA,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,SAFA,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,IAIA,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,MAMFC,GAAA,IACO,MACA,WAFP,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAGsBJ,GAAAE,EAAA,EAANG,GAAAH,EAAA,EAAIC,CAAA,CAAA,EAAKC,CAAA,4BAVvB,IAAAE,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,MAuBFC,GAAA,SAAAC,EAAA,OACSC,GAAAD,CAAA,IACAE,GAAAF,CAAA,IACcG,GAAAH,CAAA,IACJH,GAAAG,CAAA,IACAI,GAAAJ,CAAA,IACPK,GAAAL,CAAA,QANZ,IAAA,SAAAM,EAAA,cAAA,SAAAA,EAAA,mBAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,UAGkBF,EAAEE,CAAA,CAAA,EAAYD,EAAEC,CAAA,CAAA,UAHlC,SAAAF,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,UAIeF,EAAEE,CAAA,CAAA,EAAKD,EAAEC,CAAA,CAAA,UAJxB,SAAAF,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,UAKeF,EAAEE,CAAA,CAAA,EAAKD,EAAEC,CAAA,CAAA,SALxB,SAAAF,EAAA,QAAA,SAAAE,EAAA,UAMiBF,EAAEE,CAAA,CAAA,MCrEnB,IAAAC,GAAA,UAAA,qHAkHAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACQ,OAARD,EAAAC,EAAA,MAAA,EAAAA,EAAA,MAAA,IATA,IAAAC,GAAA,SAAAC,EAAA,CACK,OAALA,EAAA,QAxCA,IAAAC,GAAA,2EAmCA,IAAAC,GAAA,SAAAC,EAAA,CACK,OAALA,EAAA,QA9FA,IAAAC,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,mBAAA,4FAQAC,GAAA,SAAAC,EAAA,kCAAA,SAAAC,EAAA,gCAAA,wCAAA,IAAAC,EAAAC,EAAAC,EAAA,MAAA,EAAAC,EAAA,MAAA,SAAAH,aAAAI,UAAAJ,aAAAK,8DCRE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,OAmBF,IAAAC,GAAA,SAAAC,EAAA,OACYC,GAAAD,CAAA,SADZ,SAAAE,EAAA,UACkB,SAAAC,EAAA,sBAAkBD,EAAEC,CAAA,CAAA,MAJtCC,GAAA,SAAAJ,EAAA,OACWC,GAAAD,CAAA,SADX,SAAAE,EAAA,UACiB,SAAAC,EAAA,CAAU,IAAAE,EAAKH,EAAEC,CAAA,gBAAWE,EAAGA,CAAA,MAVhDC,GAAA,SAAAN,EAAA,OACSC,GAAAD,CAAA,SADT,SAAAE,EAAA,UACe,SAAAC,EAAA,eAAaD,EAAEC,CAAA,EAAGA,CAAA,MALjCI,GAAA,SAAAP,EAAA,QACMC,GAAAD,CAAA,EAAM,SAAAG,EAAA,eAAYA,EAAEA,CAAA,KCX1B,IAAAK,GAAA,0BAAA,UAAA,aAFEC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,yBCgBF,IAAAC,GAAA,SAAAC,EAAA,QAAAA,GAGA,IAAAC,GAAA,SAAAC,EAAA,CACY,OAAZA,GAUA,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACW,OAAXD,EAAAC,CAAA,IAQAC,GAAA,SAAAC,EAAA,kBAAA,KAAA,SAAAH,EAAA,QACUD,GAAAK,EAAAC,GAAqBL,CAAA,CAAA,CAAA,KAY/B,IAAAM,GAAA,SAAAC,EAAA,OAAA,cAAA,UAAA,qBAAA,UAAA,iBAJAC,GAAA,SAAAD,EAAA,gDAAA,MAAA,SAAAE,EAAA,QAAA,SAAAC,EAAA,CACQ,OAAAC,EAANF,CAAA,EAAAG,GACyB,SAAAC,EAAA,mBAAAA,CAAA,CAAA,IAAgB,SAAAC,EAAA,CAF3C,IAAAC,EACEL,EACsDI,CAAA,EAAK,OAF7DC,cAAA,UAAA,iBANAC,GAAA,SAAAT,EAAA,+CAAA,0BAAA,UAAA,aAGAU,GAAA,SAAAV,EAAA,OAAA,MACS,UAAA,CAAA,IAAAW,EAAAC,EAAAZ,EAAA,aAAA,CAAA,SAAA,SAAAa,EAAA,QAAAC,GAAYH,EAAAI,EAAA,OAAZF,CAAA,CAAA,CAAA,aADT,UAAA,iBAgDA,IAAAG,GAAA,SAAAC,EAAA,mBAAA,YACe,UAAA,CAAA,IAAAC,EAAAC,EAAAF,EAAA,aAAA,CAAA,SAAA,SAAAG,EAAA,QAAAC,GAAYH,EAAAI,EAAA,OAAZF,CAAA,CAAA,CAAA,aADf,UAAA,aA9BA,IAAAG,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,gFAAA,KAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACO,OAAAC,EAALF,CAAA,EACE,SAAAG,EAAA,CAEE,GADGA,aAAAC,EACG,OAAAC,EAAA,IAAAD,EADHD,EAAA,MAAA,CAAA,EAEH,GAFGA,aAAAG,EAEE,OAAAJ,EAJTD,CAAA,EAKM,SAAAM,EAAA,CAEE,GADGA,aAAAH,EACG,OAAAC,EAAA,IAAAD,EADHG,EAAA,MAAA,CAAA,EAEH,GAFGA,aAAAD,EAEE,OAAAD,EAAA,IAAAC,EAAAE,EANNL,EAAA,MAAA,EAIII,EAAA,MAAA,CAAA,CAAA,mHAAAA,EAAA,YAAA,IAAA,CAAA,qHAJJJ,EAAA,YAAA,IAAA,CAAA,eAHT,UAAA,0BCzCA,IAAAM,GACY,SAAAC,EAAA,cAAAA,CAAA,CAAA,GC1BL,SAASC,GAAUC,EAAG,CAC3B,OAAO,KAAK,UAAUA,CAAC,CACzB,CCFO,IAAMC,GAAQ,CAAC,EA+Ef,SAASC,GAAQC,EAAIC,EAAKC,EAAGC,EAAG,CACrC,OAAOD,KAAKC,EAAIF,EAAIE,EAAED,CAAC,CAAC,EAAIF,CAC9B,CAQO,SAASI,GAAeC,EAAG,CAChC,OAAO,SAAUC,EAAG,CAClB,IAAIC,EAAI,CAAC,EACT,QAASC,KAAKF,EACR,eAAe,KAAKA,EAAGE,CAAC,GAC1BD,EAAE,KAAKF,EAAEG,CAAC,EAAEF,EAAEE,CAAC,CAAC,CAAC,EAGrB,OAAOD,CACT,CACF,CAEO,IAAME,GAAO,OAAO,MAAQL,GAAe,SAAUI,EAAG,CAC7D,OAAO,UAAY,CAAE,OAAOA,CAAG,CACjC,CAAC,ECnGD,IAAIE,GAAgB,SAAUC,EAAOC,EAAO,CAC1C,GAAID,EAAQ,EACV,MAAO,CAAC,EAEV,IAAIE,EAAS,IAAI,MAAMF,CAAK,EAC5B,OAAOE,EAAO,KAAKD,CAAK,CAC1B,EAEIE,GAAoB,SAAUH,EAAOC,EAAO,CAG9C,QAFIC,EAAS,CAAC,EACVE,EAAI,EACCC,EAAI,EAAGA,EAAIL,EAAOK,IACzBH,EAAOE,GAAG,EAAIH,EAEhB,OAAOC,CACT,EAGaI,GAAgB,OAAO,MAAM,UAAU,MAAS,WAAaP,GAAgBI,GAmCnF,IAAMI,GAAS,SAAUC,EAAI,CAClC,OAAOA,EAAG,MACZ,EA0BO,IAAMC,GAAgB,SAAUC,EAAMC,EAASC,EAAGC,EAAI,CAC3D,QAASC,EAAI,EAAGC,EAAIF,EAAG,OAAQC,EAAIC,EAAGD,IACpC,GAAIF,EAAEC,EAAGC,CAAC,CAAC,EAAG,OAAOJ,EAAKI,CAAC,EAE7B,OAAOH,CACT,EAgBO,IAAMK,GAAY,SAAUC,EAAMC,EAASC,EAAGC,EAAG,CACtD,GAAID,EAAI,GAAKA,GAAKC,EAAE,OAAQ,OAAOF,EACnC,IAAIG,EAAKD,EAAE,MAAM,EACjB,OAAAC,EAAG,OAAOF,EAAG,CAAC,EACPF,EAAKI,CAAE,CAChB,EAiBO,IAAMC,GAAS,SAAUC,EAAK,CACnC,GAAIA,EAAI,QAAU,IAGhB,OAAO,MAAM,UAAU,OAAO,MAAM,CAAC,EAAGA,CAAG,EAI7C,QADIC,EAAS,CAAC,EACLC,EAAI,EAAGC,EAAIH,EAAI,OAAQE,EAAIC,EAAGD,IAErC,QADIE,EAAKJ,EAAIE,CAAC,EACLG,EAAI,EAAGC,EAAIF,EAAG,OAAQC,EAAIC,EAAGD,IACpCJ,EAAO,KAAKG,EAAGC,CAAC,CAAC,EAGrB,OAAOJ,CACT,EAEaM,GAAa,SAAUC,EAAGJ,EAAI,CACzC,OAAOA,EAAG,OAAOI,CAAC,CACpB,EAyCO,IAAMC,GAAc,UAAY,CACrC,SAASC,EAAYC,EAASC,EAAcC,EAAKC,EAAKC,EAAMC,EAAI,CAC9D,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,IAPAN,EAAMF,GAASC,EAAKD,GAAS,GACzBE,EAAMF,EAAO,GAAGL,EAAYC,EAASC,EAAcE,EAAKD,EAAKE,EAAME,CAAG,EACtED,EAAKC,EAAM,GAAGP,EAAYC,EAASC,EAAcE,EAAKD,EAAKI,EAAKD,CAAE,EAEtEE,EAAIH,EACJI,EAAIF,EACJG,EAAIL,EACGG,EAAID,GAAOE,EAAIH,GACpBK,EAAIP,EAAII,CAAC,EACTI,EAAIR,EAAIK,CAAC,EACTI,EAAIX,EAAaD,EAAQU,CAAC,EAAEC,CAAC,CAAC,EAC1BC,EAAI,GACNV,EAAIO,GAAG,EAAIE,EACX,EAAEH,IAGFN,EAAIO,GAAG,EAAIC,EACX,EAAEH,GAGN,KAAOA,EAAID,GACTJ,EAAIO,GAAG,EAAIN,EAAII,GAAG,EAEpB,KAAOC,EAAIH,GACTH,EAAIO,GAAG,EAAIN,EAAIK,GAAG,CAEtB,CAEA,OAAO,SAAUR,EAASC,EAAcY,EAAI,CAC1C,IAAIC,EAEJ,OAAID,EAAG,OAAS,EAAUA,GAE1BC,EAAMD,EAAG,MAAM,CAAC,EAChBd,EAAYC,EAASC,EAAca,EAAKD,EAAG,MAAM,CAAC,EAAG,EAAGA,EAAG,MAAM,EAE1DC,EACT,CACF,EAAG,EAMUC,GAAY,SAAUC,EAAG,EAAGC,EAAG,CAC1C,OAAOA,EAAE,MAAMD,EAAG,CAAC,CACrB,EAuCO,IAAME,GAAkB,SAAUC,EAAIC,EAAG,CAC9C,OAAOD,EAAGC,CAAC,CACb,EClQA,SAASC,GAAqBC,EAAI,CAChC,OAAOA,CACT,CAEO,IAAMC,GAAmBF,GAIhC,SAASG,GAASC,EAAI,CACpB,OAAOA,EAAG,MAAM,CAClB,CAIO,IAAMC,GAAWC,GAyDjB,IAAMC,GAAW,SAAUC,EAAGC,EAAI,CACvC,OAAOA,EAAG,KAAKD,CAAC,CAClB,ECpDO,IAAME,GAAW,SAAkBC,EAAI,CAC5C,OAAO,SAASC,EAAG,CACjB,OAAO,UAAW,CAChB,OAAOD,EAAGC,CAAC,CACb,CACF,CACF,EAEaC,GAAW,SAAkBF,EAAI,CAC5C,OAAO,SAASC,EAAG,CACjB,OAAO,SAASE,EAAG,CACjB,OAAO,UAAW,CAChB,OAAOH,EAAGC,EAAGE,CAAC,CAChB,CACF,CACF,CACF,ECFA,IAAAC,GAAAC,GAAAC,EAAA,EAeA,IAAAC,GAAAC,GAAAC,EAAA,EA3BAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAME,UAAA,OAAUL,GAAKK,CAAA,EAAA,EACV,OAAAD,EAAEE,CAAA,EAAA,EACPC,GAAaD,CAAA,EAAA,KA2Hf,IAAAE,GAAAC,GAAAC,EAAA,ECjMO,IAAMC,GAAa,SAAUC,EAAG,CACrC,OAAO,SAAUC,EAAM,CACrB,OAAO,SAAUC,EAAI,CAGnB,QAFIC,EAAMF,EACNG,EAAMF,EAAG,OACJ,EAAIE,EAAM,EAAG,GAAK,EAAG,IAC5BD,EAAMH,EAAEE,EAAG,CAAC,CAAC,EAAEC,CAAG,EAEpB,OAAOA,CACT,CACF,CACF,EAEaE,GAAa,SAAUL,EAAG,CACrC,OAAO,SAAUC,EAAM,CACrB,OAAO,SAAUC,EAAI,CAGnB,QAFIC,EAAMF,EACNG,EAAMF,EAAG,OACJ,EAAI,EAAG,EAAIE,EAAK,IACvBD,EAAMH,EAAEG,CAAG,EAAED,EAAG,CAAC,CAAC,EAEpB,OAAOC,CACT,CACF,CACF,ECDE,IAAAG,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,OCFA,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,OCPF,IAAAC,GAAA,SAAAC,EAAA,QAAAA,GA0BA,IAAAC,GAAA,SAAAC,EAAA,mBAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACU,OAAAC,EAARF,CAAA,EAAAC,CAAA,MAEF,IAAAE,GAAA,SAAAC,EAAA,mBAAA,yBAAA,UAAA,6CC8BEC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,OAyKF,IAAAC,GAAA,SAAAC,EAAA,oCAAA,SAAAC,EAAA,OAOcC,GAAAD,CAAA,SAPd,SAAAE,EAAA,UAOqB,SAAAC,EAAA,UAASD,EAATC,CAAA,CAAA,kBAerBC,GAAA,SAAAL,EAAA,OAOYD,GAAAC,CAAA,SAPZ,SAAAC,EAAA,mBA9LE,IAAAK,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,OAyOF,IAAAC,GAAA,SAAAC,EAAA,OACsBC,GAAAD,CAAA,SADtB,SAAAE,EAAA,yCAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAGE,IAAAC,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAAG,OAAHD,EAAA,KAAsB,MAAQ,OAA9BC,GACsB,MAAQ,SAD9BD,EAAA,GAAA,EAAAE,EACiDL,CAAA,EADjDI,CAAA,CAAA,cAF0BF,CAAA,EAAG,MAAQ,WAAoBD,CAAA,EAAA,QAiI3D,IAAAK,GAAA,SAAAC,EAAA,OACgBC,GAAAD,CAAA,SADhB,SAAAE,EAAA,CAGE,IAAAC,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAAK,GAALD,aAAAE,EAAa,OAAA,IAAAC,EAAbF,CAAA,EACM,GADND,aAAAG,EACW,OAAA,IAAAA,EAAA,UAAA,UAAgBL,EAD3BE,EAAA,MAAA,EAAAC,CAAA,CAAA,EAAAG,EAAA,KAAA,EACwB,OAAAC,EADxBL,EAAA,OAAAC,4GAAAD,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,aAFoBF,CAAA,EAAAG,EAAA,KAAA,IAPtBI,GAAA,SAAAC,EAAA,oBAAA,SAAAX,EAAA,QACUD,GAAAC,CAAA,EAAAY,CAAA,IAkBVC,GAAA,SAAAb,EAAA,OACgBC,GAAAD,CAAA,SADhB,SAAAE,EAAA,CAGE,IAAAY,EAAA,SAAAV,EAAA,QAAA,SAAAC,EAAA,CAAK,GAALD,aAAAE,EAAa,OAAA,IAAAC,EAAbF,CAAA,EACM,GADND,aAAAG,EACW,OAAA,IAAAA,EAAA,UAAA,UAAgBL,EAD3BE,EAAA,MAAA,EAAAC,CAAA,CAAA,EAAAU,EAAA,KAAA,EACwB,OAAAC,EADxBZ,EAAA,OAAAC,4GAAAD,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,aAFoBS,CAAA,EAAAR,EAAA,KAAA,IAPtBW,GAAA,SAAAN,EAAA,oBAAA,SAAAX,EAAA,QACUa,GAAAb,CAAA,EAAAY,CAAA,IApTV,IAAAM,GAAA,OAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACQ,GAANA,aAAAC,SAAAF,EACM,GADNC,aAAAE,EACgB,OADhBJ,EAAAE,EAAA,MAAA,EAAAD,CAAA,wGAAAD,EAAA,YAAA,KAAAC,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,WADF,SAAAF,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAGQ,GAANA,aAAAC,SAAAF,EACM,GADNC,aAAAE,EACgB,OADhBJ,EAAAC,CAAA,EAAAC,EAAA,MAAA,wGAAAF,EAAA,YAAA,KAAAC,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,aAHF,SAAAG,EAAA,oBAAA,SAAAL,EAAA,QAAA,SAAAC,EAAA,CAKU,GAARA,aAAAE,WACQ,GADRF,aAAAG,EACgB,OADhBJ,EAAAC,EAAA,MAAA,wGAAAD,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,MAnCF,IAAAK,GAAA,SAAAC,EAAA,OAOoBC,GAAAD,CAAA,SAPpB,SAAAE,EAAA,yCAAA,SAAAC,EAAA,UAO2B,SAAAC,EAAA,QAAA,SAAAC,EAAA,UAAUF,EAAEC,CAAA,CAAA,EAAKC,CAAA,WAe5CC,GAAA,2BAAA,SAAAJ,EAAA,QAGYH,GAAAO,EAAA,EAAAJ,CAAA,IAzDV,IAAAK,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,SA0SF,IAAAC,GAAA,SAAAC,EAAA,OACgBC,GAAAD,CAAA,SADhB,SAAAE,EAAA,2BC1SO,IAAMC,GAAS,SAAUC,EAAI,CAClC,OAAO,SAAUC,EAAG,CAClB,OAAO,SAAUC,EAAG,CAClB,OAAOF,EAAGC,EAAGC,CAAC,CAChB,CACF,CACF,EAEaC,GAAS,SAAUH,EAAI,CAClC,OAAO,SAAUC,EAAG,CAClB,OAAO,SAAUC,EAAG,CAClB,OAAO,SAAUE,EAAG,CAClB,OAAOJ,EAAGC,EAAGC,EAAGE,CAAC,CACnB,CACF,CACF,CACF,EAEaC,GAAS,SAAUL,EAAI,CAClC,OAAO,SAAUC,EAAG,CAClB,OAAO,SAAUC,EAAG,CAClB,OAAO,SAAUE,EAAG,CAClB,OAAO,SAAUE,EAAG,CAClB,OAAON,EAAGC,EAAGC,EAAGE,EAAGE,CAAC,CACtB,CACF,CACF,CACF,CACF,ECrGO,IAAMC,GAAqB,UAAY,CAC5C,SAASC,EAAOC,EAAG,CACjB,MAAO,CAACA,CAAC,CACX,CAEA,SAASC,EAAOD,EAAG,CACjB,OAAO,SAAUE,EAAG,CAClB,MAAO,CAACF,EAAGE,CAAC,CACd,CACF,CAEA,SAASC,EAAOH,EAAG,CACjB,OAAO,SAAUE,EAAG,CAClB,OAAO,SAAUE,EAAG,CAClB,MAAO,CAACJ,EAAGE,EAAGE,CAAC,CACjB,CACF,CACF,CAEA,SAASC,EAAQC,EAAI,CACnB,OAAO,SAAUC,EAAI,CACnB,OAAOD,EAAG,OAAOC,CAAE,CACrB,CACF,CAEA,OAAO,SAAUC,EAAO,CACtB,OAAO,SAAUC,EAAK,CACpB,OAAO,SAAUC,EAAM,CACrB,OAAO,SAAUC,EAAG,CAClB,OAAO,SAAUC,EAAO,CACtB,SAASC,EAAGC,EAAKC,EAAK,CACpB,OAAQA,EAAMD,EAAK,CACnB,IAAK,GAAG,OAAOJ,EAAK,CAAC,CAAC,EACtB,IAAK,GAAG,OAAOD,EAAIV,CAAM,EAAEY,EAAEC,EAAME,CAAG,CAAC,CAAC,EACxC,IAAK,GAAG,OAAON,EAAMC,EAAIR,CAAM,EAAEU,EAAEC,EAAME,CAAG,CAAC,CAAC,CAAC,EAAEH,EAAEC,EAAME,EAAM,CAAC,CAAC,CAAC,EAClE,IAAK,GAAG,OAAON,EAAMA,EAAMC,EAAIN,CAAM,EAAEQ,EAAEC,EAAME,CAAG,CAAC,CAAC,CAAC,EAAEH,EAAEC,EAAME,EAAM,CAAC,CAAC,CAAC,CAAC,EAAEH,EAAEC,EAAME,EAAM,CAAC,CAAC,CAAC,EAC5F,QAGE,IAAIE,EAAQF,EAAM,KAAK,OAAOC,EAAMD,GAAO,CAAC,EAAI,EAChD,OAAON,EAAMC,EAAIJ,CAAO,EAAEQ,EAAGC,EAAKE,CAAK,CAAC,CAAC,EAAEH,EAAGG,EAAOD,CAAG,CAAC,CAC3D,CACF,CACA,OAAOF,EAAG,EAAGD,EAAM,MAAM,CAC3B,CACF,CACF,CACF,CACF,CACF,EAAG,gBC4BDK,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,UAcF,IAAAC,GAAA,SAAAC,EAAA,OAMkBC,GAAAD,CAAA,SANlB,SAAAE,EAAA,mBAQAC,GAAA,UAAA,SAAAD,EAAA,oEAAA,SAAAA,EAAA,QAEaH,GAAAI,EAAA,EAAAD,CAAA,YAFb,UAAA,sBAAA,UAAA,aCrGO,IAAME,GAAmB,SAAUC,EAAW,CACnD,OAAO,SAAUC,EAAU,CACzB,OAAO,SAAUC,EAAK,CACpB,OAAO,SAAUC,EAAK,CACpB,OAAO,SAAUC,EAAG,CAClB,OAAO,SAAUC,EAAG,CAGlB,QAFIC,EAAS,CAAC,EACVC,EAAQF,IACC,CACX,IAAIG,EAAQJ,EAAEG,CAAK,EACnB,GAAIP,EAAUQ,CAAK,EAAG,OAAOF,EAC7B,IAAIG,EAAQR,EAASO,CAAK,EAC1BF,EAAO,KAAKJ,EAAIO,CAAK,CAAC,EACtBF,EAAQJ,EAAIM,CAAK,CACnB,CACF,CACF,CACF,CACF,CACF,CACF,ECpBO,IAAMC,GAAoB,SAAUC,EAAW,CACpD,OAAO,SAAUC,EAAU,CACzB,OAAO,SAAUC,EAAK,CACpB,OAAO,SAAUC,EAAK,CACpB,OAAO,SAAUC,EAAG,CAClB,OAAO,SAAUC,EAAG,CAGlB,QAFIC,EAAS,CAAC,EACVC,EAAQF,IACC,CACX,IAAIG,EAAQJ,EAAEG,CAAK,EACnBD,EAAO,KAAKJ,EAAIM,CAAK,CAAC,EACtB,IAAIC,EAAQN,EAAIK,CAAK,EACrB,GAAIR,EAAUS,CAAK,EAAG,OAAOH,EAC7BC,EAAQN,EAASQ,CAAK,CACxB,CACF,CACF,CACF,CACF,CACF,CACF,cCqBA,IAAAC,GAAA,0CCHEC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,SAEF,IAAAC,GAAA,yCAAA,UAAA,gFC+yCA,IAAAC,GAAA,UAAA,mBAprC4CA,GAAA,EAL5C,IAAAC,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,CAGE,IAAAC,EAAAC,GAAaF,CAAA,EACbG,EAAA,SAAA,EAAA,CAAE,GAAF,EACQF,yBAA8CD,CAAA,EADtD,CAAA,EAAA,EACkE,EAAJ,CAAA,CAAA,EAD5D,GAAAI,qHAAF,EAAA,YAAA,IAAA,CAAA,YAHwBD,CAAA,EAAE,CAAA,IAguB5B,IAAAE,GAAA,SAAAC,EAAA,eACgCA,CAAA,EAAK,SAAAC,EAAA,CACnC,GAAAA,aAAAC,QAAM,GACN,GAAAD,aAAAE,SAAM,GACN,GAAAF,aAAAG,uIAlnBF,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,cAC4CA,CAAA,CAAA,EAAGD,CAAA,EAAA,IA8oB/CE,GAAAC,GAAAC,EAAA,EAxuBA,IAAAC,GAAA,SAAAC,EAAA,OACc,CAAEA,CAAA,GAkDhB,IAAAC,GAAA,SAAAC,EAAA,WACiBA,CAAA,IAAM,GAsjBvB,IAAAC,GAAA,SAAAC,EAAA,eANA,IAAAC,GAAA,SAAAC,EAAA,eA/TA,IAAAC,GAAA,UAAA,qCAxBAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,cACuCA,CAAA,CAAA,EAAQH,GAAUE,CAAA,EAAEC,CAAA,CAAA,IAuN3DC,GAAAC,GAAAC,EAAA,EA3OA,IAAAC,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,QACcC,GAAU,SAAAC,EAAA,aAAMF,CAAA,MAX9BG,GAAA,SAAAJ,EAAA,OAC4BD,GAAAC,CAAA,SAD5B,SAAAK,EAAA,QAAA,SAAAC,EAAA,aACsCD,CAAA,EAAEC,CAAA,CAAA,KA0iBxC,IAAAC,GAAA,SAAA,EAAA,QAAA,SAAAC,EAAA,OACe,EAAI,EAAP,OAAAC,EAAcD,EAAQE,GAAM,CAAA,EAAAC,GAAUH,CAAA,CAAA,EAAIA,CAAA,IA3btD,IAAAI,GAAA,UAAA,qCA+oBAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACS,OAATA,EAAA,SAAA,EAAkB,CAAA,EACTC,GADTD,CAAA,EAC6B,SAAAE,EAAA,WAAgCN,GAASM,CAAA,EADtEF,CAAA,CAAA,IAC8EG,GAD9EL,EAAAC,CAAA,CAAA,EAAAC,CAAA,CAAA,KAbAI,GAAA,SAAAC,EAAA,QACSR,GAAAS,GAAAD,CAAA,CAAA,GA95BT,IAAAE,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,WACY,CAAED,CAAA,CAAA,EAAOC,CAAA,IAmZrB,IAAAC,GAAAC,GAAAC,EAAAC,EAAA,CAAA,EA+EAC,GAAA,SAAAC,EAAA,QACaL,GAAW,UAAA,CAAA,IAAAM,EAAAC,GAAM,CAAA,CAAA,EAAGC,EAAA,SAAT,SAAAC,EAAA,QAAAH,EAAuBD,EAAvBI,CAAA,CAAA,QCnuBxB,IAAMC,GAAU,UAAY,CAC1B,MAAO,CAAC,CACV,ECuQA,IAAAC,GAAAC,GACyB,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAQA,KAjBjCC,GAAA,SAAAC,EAAA,CACe,IAAAC,EAAAF,GAAAC,CAAA,EAAAE,EAAAN,GAAAO,GAAA,MAAA,SAAA,SAAAC,EAAA,QAAAH,EAAmBC,EAAnBE,CAAA,CAAA,IA/Df,IAAAC,GAAA,UAAA,qCCwCA,IAAAC,GAAAC,GCnOO,SAASC,GAAYC,EAAMC,EAAMC,EAAG,CACzC,GAAI,CACF,OAAOD,EAAK,KAAK,MAAMC,CAAC,CAAC,CAC3B,OACOC,EAAG,CACR,OAAOH,EAAKG,EAAE,OAAO,CACvB,CACF,CCGA,IAAAC,GAAA,SAAAC,EAAA,6BAC6CA,CAAA,GCUtC,IAAMC,GAAa,SAAUC,EAAI,CACtC,OAAO,SAAUC,EAAI,CACnB,OAAO,SAAUC,EAAI,CACnB,OAAOA,EAAG,QAAQ,IAAI,OAAOF,EAAG,QAAQ,yBAA0B,MAAM,EAAG,GAAG,EAAGC,CAAE,CACrF,CACF,CACF,EAEaE,GAAQ,SAAUC,EAAK,CAClC,OAAO,SAAUC,EAAG,CAClB,OAAOA,EAAE,MAAMD,CAAG,CACpB,CACF,EAEaE,GAAU,SAAUD,EAAG,CAClC,OAAOA,EAAE,YAAY,CACvB,EAUO,IAAME,GAAW,SAAUC,EAAG,CACnC,OAAO,SAAUC,EAAI,CACnB,OAAOA,EAAG,KAAKD,CAAC,CAClB,CACF,EC7BA,IAAAE,GAAA,SAAAC,EAAA,QACSA,IAAK,ICnBd,SAASC,GAA8BC,EAAO,CAC5C,OAAOA,EAAM,QAAQ,WAAY,SAAUC,EAAG,CAC5C,MAAO,IAAMA,EAAE,WAAW,CAAC,EAAE,SAAS,EAAE,CAC1C,CAAC,CACH,CAUO,SAASC,GAAoBC,EAAMC,EAASC,EAAO,CACxD,GAAI,CACF,OAAOD,EAAQE,GAA8B,mBAAmBD,CAAK,CAAC,CAAC,CACzE,OAASE,EAAK,CACZ,OAAOJ,EAAKI,CAAG,CACjB,CACF,CAEO,SAASC,GAAwBL,EAAMC,EAASC,EAAO,CAC5D,GAAI,CACF,OAAOD,EAAQE,GAA8B,mBAAmBD,CAAK,CAAC,EAAE,QAAQ,OAAQ,GAAG,CAAC,CAC9F,OAASE,EAAK,CACZ,OAAOJ,EAAKI,CAAG,CACjB,CACF,CAEO,SAASE,GAAoBN,EAAMC,EAASC,EAAO,CACxD,GAAI,CACF,OAAOD,EAAQ,mBAAmBC,CAAK,CAAC,CAC1C,OAASE,EAAK,CACZ,OAAOJ,EAAKI,CAAG,CACjB,CACF,CCLA,IAAAG,GAAA,UAAA,wCAeA,IAAAC,GAAA,UAAA,wCAwBAC,GAAA,UAAA,6ECtDA,IAAAC,GAAA,SAAAC,EAAA,CACS,OAATA,GAYA,IAAAC,GAAA,UAAA,CAGE,IAAAC,EAAa,SAAAC,EAAA,CACX,GAAAA,EAAA,kBAAAC,sBACA,GAAAD,EAAA,kBAAAE,EAAc,OAAAC,GAAAC,GAAO,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAYD,GAAO,IAAOC,4KAJ1CC,EAAAH,GAAAI,GAAqB,GAAA,CAAA,EAArBC,EAAAC,GAAuCX,CAAA,SAAvC,SAAAY,EAAA,QAAAJ,EAA8BE,EAAwBG,GAAtDD,CAAA,CAAA,CAAA,MClBT,IAAAE,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCA8CA,IAAAC,GAAA,SAAAC,EAAA,CACgB,OAAhBA,GArBAC,GAAA,MAAA,SAAAD,EAAA,CACO,GAALA,aAAAE,SAAe,UACV,GADLF,aAAAG,SACW,MACN,GAFLH,aAAAI,SAEY,OACP,GAHLJ,aAAAK,SAGY,OACP,GAJLL,aAAAM,SAIW,MACN,GALLN,aAAAO,SAKc,SACT,GANLP,aAAAQ,SAMa,QACR,GAPLR,aAAAS,SAOe,UACV,GARLT,aAAAU,SAQgB,WACX,GATLV,aAAAW,SASiB,YACZ,GAVLX,aAAAY,SAUa,QACR,GAXLZ,aAAAa,SAWY,OACP,GAZLb,aAAAc,SAYY,OACP,GAbLd,aAAAe,SAaY,OACP,GAdLf,aAAAgB,SAcc,SACT,GAfLhB,aAAAiB,SAea,+GAfbjB,EAAA,YAAA,IAAA,CAAA,IAuDF,IAAAkB,GAAAC,GAAAC,GAAAC,EAAA,CAAA,EACoBC,EAAA,ECtDpB,IAAAC,GAAA,UAAA,qHAqBA,IAAAC,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,eACcA,EAAAC,CAAA,ICjCd,IAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,qHA0JAC,GAAA,SAAAC,EAAA,QAAAA,GAEAC,GAAA,SAAAC,EAAA,CACQ,OAAA,IAAAJ,GAARI,EAAA,OAAAA,EAAA,MAAA,GAhHA,IAAAC,GAAA,SAAAC,EAAA,CAGE,IAAAC,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,gCACc,GAAdC,aAAAC,IAAAD,EAAA,kBAAAC,IAAAD,EAAA,OAAA,kBAAAC,GAAA,CAAuCC,EAAA,IAAAD,GAAvCD,EAAAG,CAAA,EAAuCJ,EAAvCC,EAAA,OAAA,OAAA,OAAuC,OAKrC,IAAAI,EAAA,SAAAC,EAAA,CACgB,OAAhBA,aAAAJ,IAAAI,EAAA,kBAAAJ,IAAAI,EAAA,OAAA,kBAAAC,UAA8BV,EAA9BS,EAAA,MAAA,EAAA,IAAAJ,GAAqCL,EAArCS,EAAA,OAAA,MAAA,EAAAC,GAAA,KAAA,CAAA,EAAAD,aAAAJ,IAAAI,EAAA,kBAAAC,UACyBV,EADzBS,EAAA,MAAA,EAAAC,GAAA,KAAA,EAEYA,GAAA,OAEZC,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,mCACuC,GAAvCJ,cAAAJ,IAAAI,GAAA,kBAAAJ,IAAAI,GAAA,OAAA,kBAAAJ,IAAAI,GAAA,OAAA,OAAA,kBAAAJ,GAAA,CAA+BS,EAA/BL,GAAA,OAA+BI,EAAA,IAAAR,GACNL,EADzBS,GAAA,OAAA,MAAA,EAAA,IAAAJ,GACgCL,EADhCS,GAAA,OAAA,OAAA,MAAA,EAAA,IAAAJ,GACuCL,EADvCS,GAAA,OAAA,OAAA,OAAA,MAAA,EAAAM,EAAA,CAAA,CAAA,EAA+B,OAEZ,OAAAC,EAAA,GAFnBD,6CARAJ,EAHFJ,CAAA,EAGiCC,EAHjCJ,CAAA,CAAA,sCAHUH,EAAAS,GAAA,KAAA,GAPZO,GAAA,KACQlB,IA2BR,IAAAmB,GAAA,OAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAGI,IAAAC,EAAA,UAAA,CAEE,IAAAC,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,gCAAG,GAAHC,aAAAC,eAAA,EACG,GADHD,aAAAE,GAAA,CACQC,EAAA,IAAAD,GADRF,EAAA,OAAA,CAAA,EACQD,EADRC,EAAA,OACQ,+GADR,EAAA,YAAA,KAAAA,EAAA,YAAA,IAAA,CAAA,sCAFIH,EAAAI,GAAA,KAAA,KAFIG,EAAAC,GAAAZ,EAAA,EAAAa,GAAYZ,CAAA,CAAA,EAAGC,CAAA,SAAf,SAAAY,EAAA,QAAAH,EAAqBR,EAArBW,CAAA,CAAA,WADd,SAAAb,EAAA,CASI,IAAAG,EAAA,SAAAW,EAAA,QAAO,SAAAV,EAAA,gCACL,GAAAW,aAAAR,eAAON,EACL,GAAAc,aAAAP,GAAA,CAAFQ,EAAchB,EAAEC,CAAA,EAAAc,EAAA,MAAA,EAAhBX,EAAAW,EAAA,OAAA,yKAJMZ,WAPZ,SAAAc,EAAA,yCAAA,SAAAjB,EAAA,eAYqB,SAAAkB,EAAA,CAAQ,IAAAC,EAAAC,EAAOF,CAAA,SAAP,SAAAG,EAAA,QAAAF,EAAenB,EAAfqB,CAAA,CAAA,yBA9C7B,IAAAC,GAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,sBAC2BA,CAAA,EAAGD,CAAA,eAwK9B,IAAAE,GAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACU,OAAA,IAAAC,GAARF,EAAA,OAAAG,GAAAH,EAAA,MAAA,EAC2BI,GAD3BH,CAAA,CAAA,CAAA,KApEF,IAAAI,GAAA,iBAAA,UAAA,aAGAC,GAAA,UAAA,OAAA,qBAAA,UAAA,gBCgMA,IAAAC,GAAA,UAAA,CAGE,IAAAC,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,gCAAG,GAAHC,aAAAC,eAAAC,EACG,GADHF,aAAAG,GAAA,CACQC,EAAA,IAAAD,GADRH,EAAA,OAAAE,CAAA,EACQH,EADRC,EAAA,OACQ,yGADRE,EAAA,YAAA,KAAAF,EAAA,YAAA,IAAA,CAAA,sCAFQH,EAAAI,GAAA,KAAA,KApLV,IAAAI,GAAA,SAAAC,EAAA,CACK,OAALA,aAAAC,ICxLO,IAAMC,GAAiB,SAAUC,EAAG,CACzC,OAAOA,EAAE,CACX,ECFO,IAAMC,GAAa,SAAUC,EAAK,CACvC,MAAM,IAAI,MAAMA,CAAG,CACrB,ECOA,IAAAC,GAAA,UAAA,wBCOAC,GAAAC,GAIAC,GAAA,SAAAC,EAAA,QACsBH,GAAA,UAAA,WAAyBG,CAAA,KCwG/C,IAAAC,GACY,UAAA,CAAA,IAAAC,EAAAD,GAAAE,EAAA,SAAA,SAAAC,EAAA,WAAiBF,EAAjBE,CAAA,CAAA,MAeZ,IAAAC,GAAA,SAAAC,EAAA,CACM,OAANA,EAAA,QAdA,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACK,OAAA,IAAAC,GAALF,EAAA,IAAAG,GAAAF,EAAA,OAAAA,EAAA,MAAA,CAAA,IC9HO,SAASG,GAASC,EAAGC,EAAGC,EAAG,CAChC,OAAOF,GAAK,KAAOC,EAAIC,EAAEF,CAAC,CAC5B,CAEO,SAASG,GAAQC,EAAG,CACzB,OAAOA,CACT,CC6CA,IAAAC,GAAAC,GAAA,IAAA,EAAAC,EAAA,EAMAC,GAAA,SAAA,EAAA,WAC4B,EAAAC,EAAA,MAAAC,EAAA,MAAA,GC7D5B,IAAIC,GAAM,UAAY,CAEpB,IAAIC,EAAQ,CAAC,EAmBTC,EAAU,OACVC,EAAU,QACVC,EAAU,QACVC,EAAU,OACVC,EAAU,QACVC,EAAU,OACVC,EAAU,UACVC,EAAU,OACVC,EAAU,aAWVC,EAAQ,MACRC,EAAQ,QACRC,EAAQ,MAGRC,EAAY,OACZC,EAAY,SACZC,EAAY,UACZC,EAAY,YACZC,GAAY,YACZC,GAAY,SACZC,GAAY,QACZC,GAAY,QAEhB,SAASrB,EAAIsB,EAAKC,GAAIC,GAAIC,GAAI,CAC5B,KAAK,IAAMH,EACX,KAAK,GAAMC,GACX,KAAK,GAAMC,GACX,KAAK,GAAMC,EACb,CAEA,SAASC,GAAOJ,EAAK,CACnB,IAAIK,GAAK,SAAUJ,GAAIC,GAAIC,GAAI,CAC7B,OAAO,IAAIzB,EAAIsB,EAAKC,GAAIC,GAAIC,EAAE,CAChC,EACA,OAAAE,GAAG,IAAML,EACFK,EACT,CAEA,SAASC,GAAYC,EAAO,CAC1B,OAAO,IAAI7B,EAAIE,EAAM,MAAM,CAC7B,CAEA,SAAS4B,GAAOC,EAAK,CACnB,GAAI,CACFA,EAAI,CACN,OAASF,GAAO,CACd,WAAW,UAAY,CACrB,MAAMA,EACR,EAAG,CAAC,CACN,CACF,CAEA,SAASG,GAAQC,EAAMC,GAAOH,GAAK,CACjC,GAAI,CACF,OAAOG,GAAMH,GAAI,CAAC,CACpB,OAASF,GAAO,CACd,OAAOI,EAAKJ,EAAK,CACnB,CACF,CAEA,SAASM,GAASF,EAAMF,GAAKK,GAAG,CAC9B,GAAI,CACF,OAAOL,GAAIK,EAAC,EAAE,CAChB,OAASP,GAAO,CACd,OAAAO,GAAEH,EAAKJ,EAAK,CAAC,EAAE,EACRD,EACT,CACF,CAEA,IAAIS,GAAY,UAAY,CAC1B,IAAIC,EAAW,KACXC,GAAW,EACXC,GAAW,EACXC,GAAW,IAAI,MAAMH,CAAK,EAC1BI,GAAW,GAEf,SAASC,GAAQ,CACf,IAAIC,GAEJ,IADAF,GAAW,GACJH,KAAS,GACdA,KACAK,GAAYH,GAAMD,EAAE,EACpBC,GAAMD,EAAE,EAAI,OACZA,IAAaA,GAAK,GAAKF,EACvBM,GAAM,EAERF,GAAW,EACb,CAEA,MAAO,CACL,WAAY,UAAY,CACtB,OAAOA,EACT,EACA,QAAS,SAAUG,GAAI,CACrB,IAAIC,GAAGC,GACHR,KAASD,IACXS,GAAML,GACNC,EAAM,EACND,GAAWK,IAGbN,IAAOD,GAAKD,IAAQD,CAAK,EAAIO,GAC7BN,KAEKG,IACHC,EAAM,CAEV,CACF,CACF,EAAE,EAEF,SAASK,GAAWC,EAAM,CACxB,IAAIC,GAAU,CAAC,EACXC,GAAU,EACVC,GAAU,EAEd,MAAO,CACL,SAAU,SAAUC,GAAO,CACzB,IAAIC,EAAMH,KACVE,GAAM,WAAW,CACf,QAAS,GACT,QAAS,SAAUE,GAAQ,CACzB,OAAO,UAAY,CACjBH,KACA,OAAOF,GAAOI,CAAG,CACnB,CACF,CACF,CAAC,EAAE,EACHJ,GAAOI,CAAG,EAAID,GACdD,IACF,EACA,QAAS,UAAY,CACnB,OAAOA,KAAU,CACnB,EACA,QAAS,SAAUI,GAAWX,EAAI,CAChC,OAAO,UAAY,CACjB,GAAIO,KAAU,EACZ,OAAOP,EAAG,EAGZ,IAAIY,GAAY,EACZC,GAAY,CAAC,EAEjB,SAASC,GAAKL,GAAK,CACjBI,GAAMJ,EAAG,EAAIJ,GAAOI,EAAG,EAAE,KAAKE,GAAW,SAAUD,GAAQ,CACzD,OAAO,UAAY,CACjB,OAAOG,GAAMJ,EAAG,EAChBG,KACIR,EAAK,OAAOM,EAAM,GAAKN,EAAK,SAASM,EAAM,GAC7C,WAAW,UAAY,CACrB,MAAMN,EAAK,SAASM,EAAM,CAC5B,EAAG,CAAC,EAEFE,KAAc,GAChBZ,EAAG,CAEP,CACF,CAAC,EAAE,CACL,CAEA,QAAST,MAAKc,GACRA,GAAO,eAAed,EAAC,IACzBqB,KACAE,GAAKvB,EAAC,GAIV,OAAAc,GAAU,CAAC,EACXC,GAAU,EACVC,GAAU,EAEH,SAAUvB,GAAO,CACtB,OAAO,IAAI7B,EAAIK,EAAM,UAAY,CAC/B,QAAS+B,MAAKsB,GACRA,GAAM,eAAetB,EAAC,GACxBsB,GAAMtB,EAAC,EAAE,CAGf,CAAC,CACH,CACF,CACF,CACF,CACF,CAGA,IAAIwB,GAAc,EACdC,GAAc,EACdC,GAAc,EACdC,GAAc,EACdC,GAAc,EACdC,GAAc,EACdC,GAAc,EAElB,SAASC,GAAMlB,EAAMmB,GAAYC,GAAK,CAEpC,IAAIC,GAAU,EAGVC,GAASX,GAGTY,EAAYH,GACZI,GAAY,KACZC,GAAY,KAGZC,GAAQ,KACRC,GAAQ,KAKRC,GAAW,KAKXC,GAAe,EAGfC,GAAU,EACVC,GAAU,KACVC,EAAU,GAQd,SAASC,GAAIC,GAAc,CAEzB,QADIpC,GAAKQ,GAAQ6B,KAMf,OAJArC,GAAY,KACZQ,GAAY,KACZ6B,GAAY,KAEJb,GAAQ,CAChB,KAAKT,GACHS,GAASV,GACT,GAAI,CACFW,EAASG,GAAMH,CAAI,EACfI,KAAU,KACZD,GAAQ,MAERA,GAAQC,GAAM,GACdA,GAAQA,GAAM,GAElB,OAASS,GAAG,CACVd,GAASN,GACTQ,GAASxB,EAAK,KAAKoC,EAAC,EACpBb,EAAS,IACX,CACA,MAEF,KAAKT,GACCd,EAAK,OAAOuB,CAAI,GAClBD,GAASN,GACTQ,GAASD,EACTA,EAAS,MACAG,KAAU,KACnBJ,GAASN,IAETM,GAAST,GACTU,EAASvB,EAAK,UAAUuB,CAAI,GAE9B,MAEF,KAAKX,GACH,OAAQW,EAAK,IAAK,CAClB,KAAKjE,EACCoE,KACFC,GAAQ,IAAI5E,EAAIc,EAAM6D,GAAOC,EAAK,GAEpCD,GAASH,EAAK,GACdD,GAASV,GACTW,EAASA,EAAK,GACd,MAEF,KAAKtE,EACCyE,KAAU,MACZJ,GAASN,GACTO,EAASvB,EAAK,MAAMuB,EAAK,EAAE,IAE3BD,GAAST,GACTU,EAASA,EAAK,IAEhB,MAEF,KAAKnE,EACHkE,GAASR,GACTS,EAASxC,GAAQiB,EAAK,KAAMA,EAAK,MAAOuB,EAAK,EAAE,EAC/C,MAEF,KAAKlE,EACHiE,GAASP,GACTQ,EAASrC,GAASc,EAAK,KAAMuB,EAAK,GAAI,SAAUjB,GAAQ,CACtD,OAAO,UAAY,CACbe,KAAYa,KAGhBb,KACAjC,GAAU,QAAQ,UAAY,CAIxBiC,KAAYa,GAAe,IAG/BZ,GAASR,GACTS,EAASjB,GACT2B,GAAIZ,EAAO,EACb,CAAC,EACH,CACF,CAAC,EACD,OAEF,KAAKnE,EACHoE,GAASN,GACTQ,GAASxB,EAAK,KAAKuB,EAAK,EAAE,EAC1BA,EAAS,KACT,MAIF,KAAKpE,EACCuE,KAAU,KACZE,GAAW,IAAI7E,EAAIc,EAAM0D,EAAMK,GAAUH,EAAS,EAElDG,GAAW,IAAI7E,EAAIc,EAAM0D,EAAM,IAAIxE,EAAIc,EAAM,IAAId,EAAIe,EAAQ4D,GAAOC,EAAK,EAAGC,GAAUH,EAAS,EAAGA,EAAS,EAE7GC,GAAW,KACXC,GAAW,KACXL,GAAWV,GACXW,EAAWA,EAAK,GAChB,MAIF,KAAKhE,EACHsE,KACIH,KAAU,KACZE,GAAW,IAAI7E,EAAIc,EAAM0D,EAAMK,GAAUH,EAAS,EAElDG,GAAW,IAAI7E,EAAIc,EAAM0D,EAAM,IAAIxE,EAAIc,EAAM,IAAId,EAAIe,EAAQ4D,GAAOC,EAAK,EAAGC,GAAUH,EAAS,EAAGA,EAAS,EAE7GC,GAAS,KACTC,GAAS,KACTL,GAASV,GACTW,EAASA,EAAK,GACd,MAEF,KAAK/D,EACH8D,GAASR,GACThB,GAASoB,GAAMlB,EAAMmB,GAAYI,EAAK,EAAE,EACpCJ,IACFA,GAAW,SAASrB,EAAG,EAErByB,EAAK,IACPzB,GAAI,IAAI,EAEVyB,EAAOvB,EAAK,MAAMF,EAAG,EACrB,MAEF,KAAKrC,EACH6D,GAASV,GACTW,EAASc,GAAWrC,EAAMmB,GAAYI,EAAK,EAAE,EAC7C,KACF,CACA,MAEF,KAAKP,GAMH,GALAU,GAAQ,KACRC,GAAQ,KAIJC,KAAa,KACfN,GAASL,GACTM,EAASE,IAAaD,IAAQD,MAO9B,QAJAzB,GAAW8B,GAAS,GACpBO,GAAWP,GAAS,GACpBA,GAAWA,GAAS,GAEZO,GAAQ,IAAK,CAIrB,KAAKhF,EAICsE,IAAaA,KAAc3B,IAAO+B,KAAiB,EACrDP,GAASN,GACAQ,KACTF,GAASV,GACTW,EAASY,GAAQ,GAAGnC,EAAK,SAASwB,EAAI,CAAC,EACvCA,GAAS,MAEX,MAGF,KAAK1D,EAGC2D,IAAaA,KAAc3B,IAAO+B,KAAiB,GAAKL,GAC1DF,GAASN,IAETU,GAASS,GAAQ,GACjBR,GAASQ,GAAQ,GACjBb,GAAST,GACTU,EAASvB,EAAK,UAAUuB,CAAI,GAE9B,MAMF,KAAKhE,EACHsE,KACIL,KAAS,OACXlB,GAAWN,EAAK,UAAUuB,CAAI,EAG9BK,GAAW,IAAI7E,EAAIc,EAAM,IAAId,EAAIgB,EAASoE,GAAQ,GAAI7B,EAAM,EAAGsB,GAAU9B,EAAG,GAGxE2B,KAAc3B,IAAO+B,GAAe,KACtCP,GAASV,GACTW,EAASY,GAAQ,GAAG7B,EAAM,IAG9B,MAIF,KAAKvC,EACH6D,GAAW,IAAI7E,EAAIc,EAAM,IAAId,EAAIkB,GAAWsD,EAAMC,EAAI,EAAGI,GAAUH,EAAS,EAC5EH,GAAWV,GAKPa,IAAaA,KAAc3B,IAAO+B,KAAiB,EACrDN,EAAOY,GAAQ,GAAG,OAAOnC,EAAK,SAASyB,EAAS,CAAC,EAAEU,GAAQ,EAAE,EACpDX,GACTD,EAAOY,GAAQ,GAAG,OAAOnC,EAAK,SAASwB,EAAI,CAAC,EAAEW,GAAQ,EAAE,EAExDZ,EAAOY,GAAQ,GAAG,UAAUnC,EAAK,UAAUuB,CAAI,CAAC,EAAEY,GAAQ,EAAE,EAE9DX,GAAO,KACPK,KACA,MAEF,KAAK7D,EACH6D,KACAD,GAAW,IAAI7E,EAAIc,EAAM,IAAId,EAAIkB,GAAWsD,EAAMC,EAAI,EAAGI,GAAUH,EAAS,EAC5EH,GAAWV,GACXW,EAAWY,GAAQ,GACnB,MAEF,KAAKlE,GACH4D,KACAP,GAASN,GACTO,EAASY,GAAQ,GACjBX,GAASW,GAAQ,GACjB,KACF,CAEF,MAEF,KAAKlB,GACH,QAAS9B,MAAK4C,GACRA,GAAM,eAAe5C,EAAC,IACxB6C,EAAUA,GAAWD,GAAM5C,EAAC,EAAE,QAC9BN,GAAOkD,GAAM5C,EAAC,EAAE,QAAQoC,CAAI,CAAC,GAGjCQ,GAAQ,KAGJN,IAAaD,GACf,WAAW,UAAY,CACrB,MAAMxB,EAAK,SAASwB,EAAI,CAC1B,EAAG,CAAC,EAGKxB,EAAK,OAAOuB,CAAI,GAAKS,GAC9B,WAAW,UAAY,CAGrB,GAAIA,EACF,MAAMhC,EAAK,SAASuB,CAAI,CAE5B,EAAG,CAAC,EAEN,OACF,KAAKZ,GACHW,GAASV,GACT,MACF,KAAKG,GAAS,MACd,CAEJ,CAEA,SAASuB,EAAWC,GAAM,CACxB,OAAO,UAAY,CACjB,GAAIjB,KAAWL,GACb,OAAAe,EAAUA,GAAWO,GAAK,QAC1BA,GAAK,QAAQhB,CAAI,EAAE,EACZ,UAAY,CAAC,EAGtB,IAAIiB,GAASV,KACb,OAAAC,GAAaA,IAAS,CAAC,EACvBA,GAAMS,EAAG,EAAID,GAEN,UAAW,CACZR,KAAU,MACZ,OAAOA,GAAMS,EAAG,CAEpB,CACF,CACF,CAEA,SAAS9B,EAAK9B,GAAOgB,GAAI,CACvB,OAAO,UAAY,CACjB,GAAI0B,KAAWL,GACb,OAAArB,GAAGI,EAAK,MAAM,MAAM,CAAC,EAAE,EAChB,UAAY,CAAC,EAGtB,IAAIyC,GAAWH,EAAW,CACxB,QAAS,GACT,QAAS,UAAwB,CAC/B,OAAO1C,GAAGI,EAAK,MAAM,MAAM,CAAC,CAC9B,CACF,CAAC,EAAE,EAEH,OAAQsB,GAAQ,CAChB,KAAKX,GACHc,GAAYzB,EAAK,KAAKpB,EAAK,EAC3B0C,GAAYL,GACZM,EAAYE,GACZQ,GAAIZ,EAAO,EACX,MACF,KAAKN,GACCU,KAAc,OAChBA,GAAYzB,EAAK,KAAKpB,EAAK,GAEzBiD,KAAiB,IACfP,KAAWP,KACba,GAAW,IAAI7E,EAAIc,EAAM,IAAId,EAAIiB,EAAWuD,EAAK3C,EAAK,CAAC,EAAGgD,GAAUH,EAAS,GAE/EH,GAAWN,GACXO,EAAW,KACXC,GAAW,KACXS,GAAI,EAAEZ,EAAO,GAEf,MACF,QACMI,KAAc,OAChBA,GAAYzB,EAAK,KAAKpB,EAAK,GAEzBiD,KAAiB,IACnBP,GAASN,GACTO,EAAS,KACTC,GAAS,KAEb,CAEA,OAAOiB,EACT,CACF,CAEA,SAASF,GAAK3C,GAAI,CAChB,OAAO,UAAY,CACjB,IAAI6C,GAAWH,EAAW,CACxB,QAAS,GACT,QAAS1C,EACX,CAAC,EAAE,EACH,OAAI0B,KAAWX,IACbsB,GAAIZ,EAAO,EAENoB,EACT,CACF,CAEA,MAAO,CACL,KAAM/B,EACN,KAAM6B,GACN,WAAYD,EACZ,YAAa,UAAY,CACvB,OAAOhB,KAAWX,EACpB,EACA,IAAK,UAAY,CACXW,KAAWX,KACRvB,GAAU,WAAW,EAKxB6C,GAAIZ,EAAO,EAJXjC,GAAU,QAAQ,UAAY,CAC5B6C,GAAIZ,EAAO,CACb,CAAC,EAKP,CACF,CACF,CAEA,SAASqB,GAAO1C,EAAMmB,GAAYwB,GAAK/C,GAAI,CAEzC,IAAIM,GAAY,EACZD,EAAY,CAAC,EAGb2C,GAAY,EACZnC,GAAY,CAAC,EAGboC,GAAY,IAAI,MAAM,qBAAqB,EAG3CpB,GAAY,KAGZqB,GAAY9F,EAIhB,SAAS0D,GAAK9B,EAAO+D,EAAK/C,GAAI,CAC5B,IAAI2B,GAAQoB,EACRI,GAAQ,KACRC,GAAQ,KACR7C,GAAQ,EACRM,GAAQ,CAAC,EACTX,GAAKmD,GAETC,EAAM,OAGJ,OAFApD,GAAM,KAEEyB,GAAK,IAAK,CAClB,KAAKrD,GAaH,GAZIqD,GAAK,KAAOvE,IACd8C,GAAMG,EAAOsB,GAAK,EAAE,EACpBd,GAAMN,IAAO,EAAIL,GAAI,KAAKlB,EAAO,SAAU0B,GAAQ,CACjD,OAAO,UAAY,CACjBH,KACIA,KAAU,GACZP,GAAGU,EAAM,EAAE,CAEf,CACF,CAAC,GAGCyC,KAAS,KACX,MAAMG,EAGR3B,GAAOwB,GAAK,GACRC,KAAS,KACXD,GAAO,MAEPA,GAAOC,GAAK,GACZA,GAAOA,GAAK,IAEd,MACF,KAAKtF,EACH6D,GAAOA,GAAK,GACZ,MACF,KAAK5D,EACL,KAAKC,EACCmF,KACFC,GAAO,IAAIjG,EAAIc,EAAMkF,GAAMC,EAAI,GAEjCD,GAAOxB,GACPA,GAAOA,GAAK,GACZ,KACF,CAGF,GAAIpB,KAAU,EACZP,GAAGI,EAAK,MAAM,MAAM,CAAC,EAAE,MAKvB,KAFAiD,GAAM,EACNnD,GAAMK,GACC8C,GAAMnD,GAAKmD,KAChBxC,GAAMwC,EAAG,EAAIxC,GAAMwC,EAAG,EAAE,EAI5B,OAAOxC,EACT,CAIA,SAAS8B,GAAKjC,EAAQyC,EAAMC,GAAM,CAChC,IAAIxB,GAAMD,GAAM4B,GAAKC,GAAKtD,GAAKmD,GAUzB,IARFjD,EAAK,OAAOM,CAAM,GACpBkB,GAAOlB,EACPiB,GAAO,OAEPA,GAAOjB,EACPkB,GAAO,QAGU,CAOjB,GANA2B,GAAM,KACNC,GAAM,KACNtD,GAAM,KACNmD,GAAM,KAGFxB,KAAc,KAChB,OAKF,GAAIsB,IAAS,KAAM,CACjBnD,GAAG4B,IAAQD,EAAI,EAAE,EACjB,MACF,CAKA,GAAIwB,EAAK,KAAO/F,EACd,OAGF,OAAQ+F,EAAK,IAAK,CAClB,KAAKrF,EACC8D,KAAS,MACXuB,EAAK,GAAK/C,EAAK,MAAM+C,EAAK,GAAG/C,EAAK,UAAUuB,EAAI,CAAC,CAAC,EAClDA,GAAUwB,EAAK,IAEfA,EAAK,GAAKvB,GAEZ,MACF,KAAK7D,EAKH,GAJAwF,GAAMJ,EAAK,GAAG,GACdK,GAAML,EAAK,GAAG,GAGVvB,IAkBF,GAjBAuB,EAAK,GAAKvB,GACV1B,GAAU,GACVmD,GAAUL,KAEVnC,GAAMwC,EAAG,EAAIvC,GAAKmC,GAAOrB,KAAS2B,GAAMJ,EAAK,GAAKA,EAAK,GAAI,UAAwB,CACjF,OAAO,UAAY,CACjB,OAAOtC,GAAMwC,EAAG,EACZnD,GACFA,GAAM,GACGkD,KAAS,KAClBT,GAAKf,GAAM,KAAM,IAAI,EAErBe,GAAKf,GAAMwB,GAAK,GAAIA,GAAK,EAAE,CAE/B,CACF,CAAC,EAEGlD,GAAK,CACPA,GAAM,GACN,MACF,MACK,IAAIqD,KAAQnG,GAASoG,KAAQpG,EAElC,OAEAuE,GAAUvB,EAAK,MAAMA,EAAK,UAAUmD,EAAG,EAAEnD,EAAK,UAAUoD,EAAG,CAAC,CAAC,EAC7DL,EAAK,GAAKxB,GAEZ,MACF,KAAK3D,EAIH,GAHAuF,GAAMJ,EAAK,GAAG,GACdK,GAAML,EAAK,GAAG,GAEVI,KAAQnG,GAASgD,EAAK,OAAOoD,EAAG,GAAKA,KAAQpG,GAASgD,EAAK,OAAOmD,EAAG,EACvE,OAIF,GAAIA,KAAQnG,GAASgD,EAAK,OAAOmD,EAAG,GAAKC,KAAQpG,GAASgD,EAAK,OAAOoD,EAAG,EACvE5B,GAAUD,KAAS4B,GAAMC,GAAMD,GAC/B5B,GAAU,KACVwB,EAAK,GAAKvB,WAEVuB,EAAK,GAAKxB,GACVzB,GAAU,GACVmD,GAAUL,KAGVnC,GAAMwC,EAAG,EAAIvC,GAAKmC,GAAOtB,KAAS4B,GAAMJ,EAAK,GAAKA,EAAK,GAAI,UAAwB,CACjF,OAAO,UAAY,CACjB,OAAOtC,GAAMwC,EAAG,EACZnD,GACFA,GAAM,GACGkD,KAAS,KAClBT,GAAKhB,GAAM,KAAM,IAAI,EAErBgB,GAAKhB,GAAMyB,GAAK,GAAIA,GAAK,EAAE,CAE/B,CACF,CAAC,EAEGlD,GAAK,CACPA,GAAM,GACN,MACF,CAEF,KACF,CAEIkD,KAAS,KACXD,EAAO,MAEPA,EAAOC,GAAK,GACZA,GAAOA,GAAK,GAEhB,CACF,CAEA,SAASK,GAAQjD,EAAO,CACtB,OAAO,SAAUE,EAAQ,CACvB,OAAO,UAAY,CACjB,OAAOL,EAAOG,EAAM,EAAE,EACtBA,EAAM,GAAKE,EACXiC,GAAKjC,EAAQF,EAAM,GAAG,GAAIA,EAAM,GAAG,EAAE,CACvC,CACF,CACF,CAQA,SAAS6B,GAAM,CACb,IAAIX,EAASV,GACTW,EAASoB,GACTI,GAAS,KACTC,GAAS,KACTlD,GAAKO,GAET6C,EAAM,OAIJ,OAHApD,GAAM,KACNO,GAAM,KAEEiB,EAAQ,CAChB,KAAKV,GACH,OAAQW,EAAK,IAAK,CAClB,KAAK7D,EACCqF,KACFC,GAAO,IAAIjG,EAAIc,EAAMkF,GAAMC,EAAI,GAEjCD,GAAO,IAAIhG,EAAIW,EAAK6D,EAAK,GAAIvE,EAAOA,CAAK,EACzCuE,EAAOA,EAAK,GACZ,MACF,KAAK5D,EACCoF,KACFC,GAAO,IAAIjG,EAAIc,EAAMkF,GAAMC,EAAI,GAEjCD,GAAO,IAAIhG,EAAIY,EAAOX,EAAOuE,EAAK,GAAIvE,CAAK,EAC3CuE,EAAOA,EAAK,GACZ,MACF,KAAK3D,EACCmF,KACFC,GAAO,IAAIjG,EAAIc,EAAMkF,GAAMC,EAAI,GAEjCD,GAAO,IAAIhG,EAAIa,EAAKZ,EAAOuE,EAAK,GAAIvE,CAAK,EACzCuE,EAAOA,EAAK,GACZ,MACF,QAGElB,GAASH,KACToB,EAASN,GACTlB,GAASyB,EACTA,EAAS,IAAIxE,EAAImB,GAAQmC,GAAK,IAAItD,EAAIc,EAAMkF,GAAMC,EAAI,EAAGhG,CAAK,EAC9D8C,GAASoB,GAAMlB,EAAMmB,GAAYrB,EAAG,EACpCA,GAAI,WAAW,CACb,QAAS,GACT,QAASuD,GAAQ9B,CAAI,CACvB,CAAC,EAAE,EACHtB,EAAOI,EAAG,EAAIP,GACVqB,IACFA,GAAW,SAASrB,EAAG,CAE3B,CACA,MACF,KAAKkB,GAEH,GAAI+B,KAAS,KACX,MAAMG,EAIJH,GAAK,KAAO/F,GACd+F,GAAK,GAAKxB,EACVD,EAAUV,GACVW,EAAUwB,GAAK,GACfA,GAAK,GAAK/F,IAEV+F,GAAK,GAAKxB,EACVA,EAAUwB,GACNC,KAAS,KACXD,GAAQ,MAERA,GAAQC,GAAK,GACbA,GAAQA,GAAK,IAGnB,CAMF,IAFAF,GAAOvB,EAEFlB,GAAM,EAAGA,GAAMH,GAASG,KAC3BJ,EAAOI,EAAG,EAAE,IAAI,CAEpB,CAMA,SAASiD,GAAO1E,EAAOgB,EAAI,CACzB6B,GAAYzB,EAAK,KAAKpB,CAAK,EAC3B,IAAI2E,GACJ,QAASN,MAAOxC,GACd,GAAIA,GAAM,eAAewC,EAAG,EAAG,CAC7BM,GAAa9C,GAAMwC,EAAG,EACtB,IAAKA,MAAOM,GACNA,GAAW,eAAeN,EAAG,GAC/BM,GAAWN,EAAG,EAAE,CAGtB,CAGFxC,GAAQ,KACR,IAAI+C,GAAW9C,GAAK9B,EAAOkE,GAAMlD,CAAE,EAEnC,OAAO,SAAUW,GAAW,CAC1B,OAAO,IAAIxD,EAAIM,EAAO,SAAUoG,GAAQ,CACtC,OAAO,UAAY,CACjB,QAASR,MAAOO,GACVA,GAAS,eAAeP,EAAG,GAC7BO,GAASP,EAAG,EAAE,EAGlB,OAAOtE,EACT,CACF,CAAC,CACH,CACF,CAEA,OAAAsD,EAAI,EAEG,SAAU1B,EAAW,CAC1B,OAAO,IAAIxD,EAAIM,EAAO,SAAUoG,EAAQ,CACtC,OAAO,UAAY,CACjB,OAAOH,GAAO/C,EAAWkD,CAAM,CACjC,CACF,CAAC,CACH,CACF,CAEA,SAASpB,GAAWrC,EAAMmB,GAAYwB,GAAK,CACzC,OAAO,IAAI5F,EAAIM,EAAO,SAAUuC,GAAI,CAClC,OAAO,UAAY,CACjB,OAAO8C,GAAO1C,EAAMmB,GAAYwB,GAAK/C,EAAE,CACzC,CACF,CAAC,CACH,CAEA,OAAA7C,EAAI,MAAcC,EAClBD,EAAI,KAAc0B,GAAOxB,CAAI,EAC7BF,EAAI,MAAc0B,GAAOvB,CAAK,EAC9BH,EAAI,MAAc0B,GAAOtB,CAAK,EAC9BJ,EAAI,KAAc0B,GAAOrB,CAAI,EAC7BL,EAAI,MAAc0B,GAAOpB,CAAK,EAC9BN,EAAI,KAAc0B,GAAOnB,CAAI,EAC7BP,EAAI,QAAc0B,GAAOlB,CAAO,EAChCR,EAAI,KAAc0B,GAAOjB,CAAI,EAC7BT,EAAI,IAAc0B,GAAOhB,CAAG,EAC5BV,EAAI,OAAc0B,GAAOf,CAAG,EAC5BX,EAAI,SAAc0B,GAAOd,CAAK,EAC9BZ,EAAI,OAAc0B,GAAOb,CAAG,EAC5Bb,EAAI,MAAcmE,GAClBnE,EAAI,WAAcgD,GAClBhD,EAAI,UAAcqC,GAClBrC,EAAI,YAAc4B,GAEX5B,CACT,EAAE,EAEW2G,GAAQ3G,GAAI,KACZ4G,GAAc5G,GAAI,MAExB,SAAS6G,GAAYxC,EAAK,CAC/B,OAAO,SAAUjC,EAAG,CAClB,OAAOpC,GAAI,MAAMqE,EAAKjC,CAAC,CACzB,CACF,CAEO,SAAS0E,GAAKC,EAAG,CACtB,OAAO,SAAU1C,EAAK,CACpB,OAAIA,EAAI,MAAQrE,GAAI,KAAK,IAChBA,GAAI,KAAK+G,EAAE1C,EAAI,EAAE,CAAC,EAElBrE,GAAI,KAAKqE,EAAK,SAAU2C,EAAO,CACpC,OAAOhH,GAAI,KAAK+G,EAAEC,CAAK,CAAC,CAC1B,CAAC,CAEL,CACF,CAEO,SAASC,GAAM5C,EAAK,CACzB,OAAO,SAAUjC,EAAG,CAClB,OAAOpC,GAAI,KAAKqE,EAAKjC,CAAC,CACxB,CACF,CAEO,SAAS8E,GAAMC,EAAW,CAC/B,OAAO,SAAU9C,EAAK,CACpB,OAAOrE,GAAI,KAAKmH,EAAW9C,CAAG,CAChC,CACF,CAEO,IAAM+C,GAAcpH,GAAI,KAExB,SAASqH,GAAWN,EAAG,CAC5B,OAAO,SAAU1C,EAAK,CACpB,OAAOrE,GAAI,OAAO+G,EAAG1C,CAAG,CAC1B,CACF,CAEO,SAASiD,GAAaC,EAAM,CACjC,OAAO,SAAUC,EAAM,CACrB,OAAOxH,GAAI,SAASuH,EAAMC,CAAI,CAChC,CACF,CAQO,IAAMC,GAAUC,GAAI,MAEpB,SAASC,GAAeC,EAAS,CACtC,OAAO,SAAUC,EAAS,CACxB,OAAO,SAAUC,EAAG,CAClB,OAAOJ,GAAI,QAAQE,EAASC,EAASC,CAAC,CACxC,CACF,CACF,CAEO,SAASC,GAAWC,EAAMC,EAAK,CACpC,OAAO,UAAY,CACjB,OAAOP,GAAI,MAAMM,EAAM,KAAMC,CAAG,CAClC,CACF,CA+CO,IAAMC,GAAcC,GAAI,ICvlC/B,IAAAC,GAAA,OAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QACsB,SAAAC,EAAA,QAAgBF,EAARC,EAARF,EAAAG,CAAA,CAAA,CAAA,OArBpBC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,OCKA,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,YADAC,GAAA,SAAAD,EAAA,CAAA,OAAAA,EAAA,wBCcFE,GAAA,SAAAC,EAAA,4BAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,mBAAA,SAAAC,EAAA,CAQiB,IAAAC,EAAAC,EAA0B,SAAAC,EAAA,UAAaH,EAAbG,CAAA,CAAA,WAA1B,SAAAC,EAAA,UAAeH,EAAfG,CAAA,CAAA,OAWjB,IAAAC,GAAA,SAAAC,EAAA,OAOeC,GAAAD,CAAA,SAPf,SAAAE,EAAA,mBAAA,SAAAC,EAAA,oBC3DO,IAAMC,GAAsB,SAAUC,EAAG,CAC9C,OAAOA,EAAE,CACX,+OCuMA,IAAAC,GAAA,SAAAC,EAAA,QAAAA,GA6DAC,GAAAC,GACmB,EAAA,EAvInB,IAAAC,GAAA,SA3DAC,GAAA,kBA2LAC,GAAAC,GACgB,EAAA,EAsIhBC,GAAA,UAAA,CAmBE,IAAAC,EACkB,SAAAC,EAAA,CAChB,GAAAA,aAAAC,EAAM,OAAAD,EAAA,OACN,GAAAA,aAAAE,EAAK,OAAAC,GAAqB,uBAAA,4HAR5BC,EACiB,SAAAJ,EAAA,CACf,GAAAA,aAAAE,EAAK,OAAAF,EAAA,OACL,GAAAA,aAAAC,EAAM,OAAAE,GAAqB,uBAAA,4HAR7BE,EACS,SAAAL,EAAA,CACP,GAAAA,aAAAE,EAAK,MAAK,GACV,GAAAF,aAAAC,EAAM,MAAK,mIAXL,QACNI,WACUD,YACCL,mCAffO,GAAA,SAAAC,EAAA,WACqCT,GAAQS,CAAA,GA3J7CC,GAAA,SAAAD,EAAA,QAEE,UAAA,OAASD,GAAUC,CAAA,EAAA,EACd,OAAAE,EAAA,IAAA,EACAA,IA6EP,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,WAEiBD,CAAA,EACb,UAAgBC,CAAA,WACAA,CAAA,cACGA,CAAA,MApLvBC,GAAA,mBAAA,UAAA,aAnDA,IAAAC,GAAA,cAAA,UAAA,kBAAA,UAAA,aAHAC,GAAA,gBAAA,UAAA,gBAHAC,GAAA,gBAAA,UAAA,+DAHA,uBAAA,UAAA,eAAAC,GAAAC,GAAA,EAAA,kCAoNA,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QACgBC,GAAAC,GAAA,MAAA,CAAA,EAAAC,EAA2BJ,CAAA,CAAA,EAAAI,EAAYH,CAAA,CAAA,IAlIvD,IAAAI,GAAA,iCAAA,UAAA,mBAAA,UAAA,uBApBAC,GAAA,MACS,SAAAC,EAAA,cAAAA,CAAA,CAAA,UADT,UAAA,mCAsEA,IAAAC,GAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACU,OACN,SAAAC,EAAA,WAA8B,CADhCF,EACqCE,CAAA,EADrCD,EAC6CC,CAAA,CAAA,CAAA,MA9F/C,IAAAC,GAAA,sBAAA,UAAA,uBAyGAC,GACiB,SAAAC,EAAA,QAAAC,GAAAC,EAAAC,GAAAH,CAAA,CAAA,CAAA,GAxBjBI,GAAA,SAAAC,EAAA,CACW,OAAAC,GAAmB,SAAAC,EAAA,WAAMR,EAAA,EAApCM,EAAA,KAA8DE,CAAA,CAAA,KAtB9DC,GAAA,KAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,WACiCC,GAAAC,GAAWH,CAAA,EAAML,GAAUM,CAAA,CAAA,CAAA,CAAA,KAU5D,IAAAG,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACU,OAAAC,GAAAC,GAAVF,EAAA,WAAA,CAAA,EACE,SAAAG,EAAA,CACA,OAAGA,QAFLH,EAAA,KAAAD,EAAAK,EAAAC,GAAA,MAAA,CAAA,CAAA,CAAA,CAAA,EAEEC,GAGU,SAAAC,EAAA,WAAMC,EAAA,EALlBR,EAAA,KAAAD,EAKwDQ,CAAA,CAAA,QApFxD,IAAAE,GAAA,sBAAA,UAAA,aAGAC,GAAA,2BAAA,UAAA,uBAoIA,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QACeC,GAAAC,GAAA,SAAAC,EAAA,WAA2BJ,EAA3BI,CAAA,CAAA,OAAqCH,CAAA,CAAA,CAAA,IAIpDI,GAAA,SAAAL,EAAA,QAAA,SAAAC,EAAA,WACuBF,GAAOC,CAAA,EAAEC,CAAA,CAAA,IAtJhC,IAAAK,GAAA,UAAA,SAAAC,EAAA,CAGI,IAAAC,EAAA,SAAAC,EAAA,WACSF,EAAEE,CAAA,CAAA,EAAT,SAAAC,EAAA,CAEE,GADGA,aAAAC,GACE,OAAAC,GADFF,EAAA,MAAA,EAEH,GAFGA,aAAAG,GAEE,OAAKL,EAFPE,EAAA,MAAA,qGAAAA,EAAA,YAAA,IAAA,CAAA,YAJIF,UADf,UAAA,aAoHA,IAAAM,GAAAC,EAAAC,GAAA,MAAA,CAAA,EAJAC,GAAA,QACWH,cADX,UAAA,aCnKA,IAAAI,GAAA,SAAAC,EAAA,CACiB,OAAAC,GAA2B,SAAAC,EAAA,QAC1C,UAAA,OADFF,EACiD,SAAAG,EAAA,QAAaD,EAAAE,EAAA,OAAAD,CAAA,CAAA,EAAA,GAAc,SAAAE,EAAA,QAAaH,EAAAI,EAAA,OAAAD,CAAA,CAAA,EAAA,IAAvF,OACO,SAAAE,EAAA,WAAuB,SAAAC,EAAA,QAC5B,UAAA,CAFF,OAAAC,EAEwBF,EAAG,SAAAG,EAAA,QAAaF,EAAAJ,EAAA,OAAAM,CAAA,CAAA,EAAA,GAAe,SAAAC,EAAA,QAAaH,EAAAF,EAAA,OAAAK,CAAA,CAAA,EAAA,eCnD/D,SAASC,GAAOC,EAAO,CAC5B,OAAO,OAAOA,CAChB,CAEO,SAASC,GAAMD,EAAO,CAC3B,OAAO,OAAO,UAAU,SAAS,KAAKA,CAAK,EAAE,MAAM,EAAG,EAAE,CAC1D,CAUO,IAAME,GAAU,MAAM,SAAW,SAAUC,EAAO,CACvD,OAAO,OAAO,UAAU,SAAS,KAAKA,CAAK,IAAM,gBACnD,EClBO,IAAMC,GAAiB,SAAUC,EAAM,CAC5C,OAAO,SAAUC,EAAS,CACxB,OAAO,SAAUC,EAAG,CAElB,OAAQA,EAAI,KAAOA,EAAIF,EAAKE,CAAC,EAAID,CACnC,CACF,CACF,EAEaE,GAAW,SAAU,EAAG,CACnC,OAAO,CACT,EC4BO,IAAMC,GAAM,KAAK,ICHxB,IAAAC,GAAA,UAAA,iCC5BO,IAAMC,GAAY,SAAUC,EAAG,CACpC,OAAOA,CACT,EAoBO,IAAMC,GAAS,SAAUC,EAAG,CACjC,OAAOA,EAAE,MACX,EAiEO,IAAMC,GAAO,SAAU,EAAG,CAC/B,OAAO,SAAUC,EAAG,CAClB,OAAOA,EAAE,UAAU,CAAC,CACtB,CACF,EAUO,IAAMC,GAAU,SAAUC,EAAG,CAClC,OAAO,SAAUC,EAAG,CAClB,MAAO,CAAE,OAAQA,EAAE,UAAU,EAAGD,CAAC,EAAG,MAAOC,EAAE,UAAUD,CAAC,CAAE,CAC5D,CACF,ECnHO,IAAME,GAAS,SAAUC,EAAG,CACjC,OAAO,SAAUC,EAAG,CAClB,GAAID,GAAK,GAAKA,EAAIC,EAAE,OAAQ,OAAOA,EAAE,OAAOD,CAAC,EAC7C,MAAM,IAAI,MAAM,2CAA2C,CAC7D,CACF,ECwCA,IAAAE,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAAA,IAAAC,EAAAC,GAAAC,GACAJ,CAAA,CAAA,EAAAC,CAAA,IADAC,EAAA,SACAF,EAEE,OAAAK,QAHFH,EAAA,KAAA,EAGEI,EAAA,yCCWF,IAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,qHA8CAC,GAAAC,EAIAC,GAAAD,EAhCA,IAAAE,GAAA,SAAAC,EAAA,CACoB,GAApBA,aAAAC,GAAiC,OAAjCD,EAAA,OACoB,GADpBA,aAAAE,GACiC,MAAO,yBAAAC,GADxCH,EAAA,MAAA,GAC6E,KAAQD,GADrFC,EAAA,MAAA,IAEoB,GAFpBA,aAAAI,GAEoC,MAAU,sBAAAC,GAF9CL,EAAA,MAAA,GAEmF,KAAQD,GAF3FC,EAAA,MAAA,IAGoB,GAHpBA,aAAAM,GAGiC,MAAW,4BAH5CN,EAAA,QAGiF,WAHjFA,EAAA,uGAAAA,EAAA,YAAA,IAAA,CAAA,GA0GA,IAAAO,GAAA,SAAAC,EAAA,CACO,IAAAC,EAAAC,GAAAC,GAAAH,CAAA,CAAA,SAAA,SAAAI,EAAA,QAAAH,EAAAI,GAAAD,CAAA,CAAA,IA/DP,IAAAE,GAAA,SAAAC,EAAA,kBAGgBC,GAAAD,CAAA,SAHhB,SAAAE,EAAA,QAAA,SAAAC,EAAA,CACiB,GAAAC,GAAjBD,CAAA,IAAAD,WAC+BG,GAD/BF,CAAA,CAAA,EAAiB,GAAAG,mBAAjBJ,EAAAE,GAAAD,CAAA,CAAA,CAAA,mGAAAD,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,KAyBAI,GAAA,SAAAP,EAAA,QACcD,GAAAC,CAAA,EAAiB,SAAA,GAG/BQ,GAAA,SAAAR,EAAA,QACaD,GAAAC,CAAA,EAAiB,QAAA,GAG9BS,GAAA,SAAAT,EAAA,0CACoEQ,GAAAR,CAAA,SADpE,SAAAG,EAAA,CAIE,IAAAO,EAAA,IAAAC,EAAAC,GAAA,IAAAC,GAA4C,MAAAT,GAAaD,CAAA,CAAA,CAAA,CAAA,EADzDW,EAAa,UAAA,CAAA,IAAAC,EAAAC,GAAMN,CAAA,EAAAO,EAAA,SAAN,SAAAC,EAAA,QAAAH,EAAAD,GAAAI,CAAA,CAAA,uBAFiCR,CAAA,CAAA,EAAOI,CAAA,CAAA,CAAA,EAAAK,EAAwBhB,CAAA,CAAA,IApB/EiB,GAAA,SAAApB,EAAA,QACaD,GAAAC,CAAA,EAAiB,QAAA,yJClC9B,IAAAqB,GAAA,UAAA,+EAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,+EAwFAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CA2EE,IAAAC,EACY,SAAAC,EAAA,CACV,OAAAA,IAAA,UACAC,GAAe,SAAAC,EAAA,qBAAAA,CAAA,CAAA,gBAEjBC,EAAA,UAAA,CAEE,GADkBL,EAAA,0BAAAM,GACS,OAAAC,GAAsB,aAAA,EACjD,GAFkBP,EAAA,0BAAAQ,GAEE,OAAAD,GAAsB,MAAA,EAC1C,GAHkBP,EAAA,0BAAAS,GAGM,OAAK,SAAAC,EAAA,cACV,UAAA,EAAWA,CAAA,CAAA,EAAAC,GAAAJ,GACL,aAAA,EAAcG,CAAA,CAAA,EAAAH,GACd,cAAA,EAAeG,CAAA,CAAA,CAAA,GACxC,GAPkBV,EAAA,0BAAAY,GAOE,OAAAC,GAAO,SAAAC,EAAA,QAPTd,EAAA,eAAA,OAOiBC,EAARa,CAAA,CAAA,OAAuC,QAAA,CAAA,EAClE,GARkBd,EAAA,0BAAAe,GAQI,OAAAR,GAAsB,QAAA,EAC5C,GATkBP,EAAA,0BAAAgB,GASI,OAAAC,EATJjB,EAAA,eAAA,OAAAkB,GAAA,MAAA,CAAA,CAAA,kGAAAlB,EAAA,eAAA,YAAA,IAAA,CAAA,KAxCpBmB,EACiB,SAAAjB,EAAA,CACf,GAAAA,aAAAkB,GAAsB,OAAA,IAAAC,EAAAnB,EAAA,OAAAoB,EAAA,CAAA,EAEtB,GAAApB,aAAAM,GAAiB,OAAA,IAAAa,EAAAC,GAAApB,EAAA,MAAA,CAAA,EAEjB,GAAAA,aAAAO,GAAqB,OAAA,IAAAY,EAAAC,GAAApB,EAAA,MAAA,CAAA,EAErB,GAAAA,aAAAa,GAAmB,OAAA,IAAAM,EAAAC,GAAApB,EAAA,MAAA,CAAA,EAEnB,GAAAA,aAAAqB,GAAqB,OAAA,IAAAF,EAAAC,GAAApB,EAAA,MAAA,CAAA,EAErB,GAAAA,aAAAsB,GAA2B,OAAAC,GACpB,kFAAA,EAAAC,GAAAJ,EAAA,EAAAK,GAAAzB,EAAA,MAAA,CAAA,CAAA,EAEP,GAAAA,aAAAU,GAAiB,OAAA,IAAAS,EAAAC,GAAAM,GAAA1B,EAAA,MAAA,CAAA,CAAA,wHAcnB2B,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAEE,OADqBD,aAAAE,GAAA,CAAAC,GAAAC,GAAAC,EAAA,EAAAC,EAAA,EAAAN,EAAA,MAAA,CAAA,EAC2BC,CAAA,KAAMA,CAAA,EADjCD,EAAA,MAAA,EAEhBC,IAdPM,EAAA,SAAAC,EAAA,QAEET,EAAAH,GAAAa,GAAA,MAAA,EAAAC,GAAAC,EAAA,EAAwDH,CAAA,CAAA,CAAA,EACpDT,EAAAH,GAAAgB,GAAA,MAAA,EAAAD,GAAiDzC,EAAA,cAAA,CAAA,CAAA,EAAoBA,EAAA,OAAA,CAAA,GAlC3E2C,EAEE,SAAAzC,EAAA,OAAA,WAAuBF,EAAA,MAAA,MAChBA,EAAA,eACK,SAAA4C,EAAA,OAAM,UAA4BA,CAAA,WAA8BA,CAAA,KAASP,EAAQrC,EAAA,OAAA,CAAA,4BAE/CA,EAAA,cAAA,cACvBA,EAAA,QAAA,cACAA,EAAA,QAAA,kBACJA,EAAA,2BACE,CAAA,EAAA0B,GAAO,SAAAmB,EAAA,CAAE,OAAAA,IAA0B7C,EAAA,OAAA,CAAA,IA1B1D8C,EAAA,SAAAC,EAAA,oBAEwChD,EAmDb,iCAGC,kCAAAiD,GAAA,OAtDsFL,EAAYI,CAAA,CAAA,CAAA,CAAA,CAAA,EAAe,SAAA,EAAA,CACzI,GAAA,aAAA1B,EAAA,CAfN,IAAAwB,EAAAI,GAgBwB5C,EAAA,EAAA,OAAA,IAAA,CAAA,EACd,GAjBVwC,aAAAK,EAiBe,OAAA,IAAAA,EAAA,IAAAxD,GAAAyD,GAjBfN,EAAA,MAAA,EAAA,EAAA,MAAA,CAAA,EAkBU,GAlBVA,aAAAxB,EAkBgB,OAAA,IAAAA,EAAe,qFAlB/BwB,EAAA,wGAAAA,EAAA,YAAA,IAAA,CAAA,EAmBM,GAAA,aAAAK,EAAK,OAAA,IAAAA,EAAA,UAAA,CACC,IAAAE,EAAAA,GAAA,EAAA,MAAA,IACDA,IA4CkB,iCA5CrB,GAAAC,wBAEQD,IA6Cc,kCA7CjB,OAAAE,WAAA,IAAAzD,GAAA,EAAA,MAAA,+HApBT,GADGG,EAAA,mBAAAuD,SAEDT,EAAAU,GAAAD,EAAA,KAAA,CAAA,EACF,GAHGvD,EAAA,mBAAAgC,EAAA,CAFP,IAAA9B,EAMWiB,EAJJnB,EAAA,QAAA,MAAA,EAKC,GAPRE,aAAAmB,EAOc,OACJyB,EAAAU,GAAA,IAAAxB,EARV9B,EAAA,MAAA,CAAA,CAAA,EASQ,GATRA,aAAAgD,EASa,OAAAO,GAAA,IAAAP,EAAA,IAAAzD,GATbS,EAAA,MAAA,CAAA,CAAA,iGAAAA,EAAA,YAAA,IAAA,CAAA,iGAEOF,EAAA,QAAA,YAAA,IAAA,CAAA,IAnFP0D,GACa,SAAAxD,EAAA,CACX,GAAAA,aAAAT,GAAoB,MAClB,iDAAAS,EAAA,OACF,GAAAA,aAAAR,GAAkB,MAChB,+CAAAiE,GAAAzD,EAAA,MAAA,EACF,GAAAA,aAAAP,SACE,kDACF,GAAAO,aAAAN,SACE,yDACF,GAAAM,aAAAL,GAAc,MACZ,2CAAAuD,GAAAlD,EAAA,MAAA,wHAhCJ0D,GAAA,UAAA,OAEE,4BACO,YACI,CAAA,oEAIQ,yCC3FrB,IAAAC,GAAA,mDCPO,IAAMC,GAAS,CACpB,OAAQ,UAAY,CAClB,OAAO,IAAI,cACb,EACA,SAAU,SAAUC,EAAK,CACvB,OAAOA,GAAO,GAChB,CACF,ECgFA,IAAAC,GAAAA,GAAAC,EAAA,ECrFA,IAAAC,GAAmB,WAENC,GAAO,UAAW,CAC7B,OAAO,GACT,EA8BO,IAAMC,GAAe,SAASC,EAAMC,EAASC,EAAOC,EAAG,CAC5D,GAAI,CACF,IAAIC,KAAI,GAAAC,SAAOF,EAAG,GAAAE,QAAO,QAAQ,EAC7BC,EAAKF,EAAE,QAAQ,EACfG,EAAKH,EAAE,OAAO,qBAAqB,EAAI,KAAOA,EAAE,OAAO,EAAI,KAC/D,OAAOJ,EAAKE,EAAMI,CAAE,EAAEC,CAAE,CAAC,CAC3B,OAASC,EAAO,CACd,OAAOP,CACT,CACF,EAEaQ,GAAe,SAAUC,EAAQ,CAC5CA,EAAO,MAAM,CACf,EAEaC,GAAY,SAASC,EAAQ,CACtC,SAAS,eAAeA,CAAM,EAAE,MAAM,CAC1C,EAGaC,GAAsB,SAASC,EAAY,CACtD,OAAO,IAAI,KAAKA,CAAU,EAAE,mBAAmB,OAAW,CAAC,UAAW,QAAQ,CAAC,CACjF,ECgBA,IAAAC,GAAA,SAAAC,EAAA,QAAAA,GAWAC,GAAA,SAAAC,EAAA,WACkDA,CAAA,GANlDC,GAAA,SAAAD,EAAA,6BACoCA,CAAA,IA/BpC,IAAAE,GAAA,SAAAC,EAAA,sCACuDA,CAAA,GAoBvD,IAAAC,GAAA,SAAAC,EAAA,6BAC4CA,CAAA,IArC5CC,GAAA,SAAAC,EAAA,cC/BO,IAAMC,GAAmB,KAAK,UCJ9B,SAASC,GAAWC,EAAG,CAC5B,OAAOA,EAAE,WAAW,CAAC,CACvB,CAEO,SAASC,GAAaD,EAAG,CAC9B,OAAO,OAAO,aAAaA,CAAC,CAC9B,yBC4GE,IAAAE,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,QACA,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,UAyCFC,GAAA,SAAAC,EAAA,OACqCC,GAAAD,CAAA,IAEjBH,GAAAG,CAAA,4BAHpB,SAAAE,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAAA,IAAAC,EAAAC,EAC4CF,CAAA,EAC1C,GAFFC,aAAAE,EAEO,OAFPF,EAAA,OAGE,GAHFA,aAAAG,EAAA,OAGgBJ,EAAAK,EAAAC,CAAA,EAAH,OAAAC,EAAmCT,EAASC,qGAHzDE,EAAA,YAAA,IAAA,CAAA,MAgGA,IAAAO,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QACkCF,EAASC,EAAUC,CAAA,EAAI,EAAd,CAAA,KAa3CC,GAAA,SAAAH,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QACkCF,EAASC,EAAUC,CAAA,EAAI,EAAd,CAAA,KAgD3C,IAAAE,GAAA,SAAAC,EAAA,CACW,OAAXA,GAAAC,GAAAC,EAAA,GAAAF,GAAAC,GAAAE,EAAA,WAAAH,CAAA,CAAA,EACWI,EAAA,OA9PXC,GAAA,MACSC,GAAYP,EAAA,EAAAE,EAAA,OACZM,GAAYR,EAAA,EAAAE,EAAA,OAFrB,UAAA,aA8DA,IAAAO,GAAA,UAAA,OAAA,2BACgB,SACLC,wBAFX,UAAA,kBAAA,UAAA,gBC7HO,SAASC,GAAmBC,EAAGC,EAAGC,EAAKC,EAAO,CACnD,OAAOA,GAAS,KAAOH,EAAIC,EAAEE,EAAMD,CAAG,CAAC,CACzC,CCqCA,IAAAE,GAAA,SAAAC,EAAA,+BAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,oBAEgD,SAAAC,GAAiBD,CAAA,CAAA,CAAA,EAAAE,EAAcH,EAAEC,CAAA,KAGjFG,GAAA,SAAAL,EAAA,QACWD,GAAAC,CAAA,GCVX,IAAAM,GAAA,SAAAC,EAAA,oBAAA,UAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,aAOmCD,CAAA,CAAA,EAAGC,CAAA,MC1C/B,SAASC,GAAWC,EAAK,CAC9B,IAAIC,EAAO,CAAC,EACZ,QAASC,KAAOF,GACV,CAAC,GAAE,eAAe,KAAKA,EAAKE,CAAG,IACjCD,EAAKC,CAAG,EAAIF,EAAIE,CAAG,GAGvB,OAAOD,CACT,CAEO,SAASE,GAAaC,EAAG,CAC9B,OAAO,SAASC,EAAG,CACjB,OAAO,SAASL,EAAK,CACnB,OAAAA,EAAII,CAAC,EAAIC,EACFL,CACT,CACF,CACF,CC0CA,IAAAM,GAAAC,GAIA,IAAAC,GAAA,UAAA,QAAA,UAAA,QAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,QAAA,SAAA,EAAA,QAQa,SAAAC,EAAA,aAA2CD,CAAA,CAAA,EAAG,CAAA,EAAEC,CAAA,QAX7D,IAAAC,GAAAC,GAZAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACO,OAAPD,EAAAE,GAAAD,CAAA,CAAA,0CC2RE,IAAAE,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,iBA3CAC,GAAA,SAAAD,EAAA,CAAA,OAAAA,EAAA,WAnMFE,GAAA,SAAAC,EAAA,CAIY,IAAAC,EAAqBH,GAAAE,CAAA,SAArB,SAAAE,EAAA,WAAqBD,EAArBC,CAAA,CAAA,IAoMZ,IAAAC,GAAA,eAqBA,IAAAC,GAAA,SAAAC,EAAA,OAAA,WACc,UAAA,CAAA,IAAAC,EAAAC,GAAAC,GAAAC,GAAAC,EAAA,KAAA,CAAA,CAAA,EAA6CC,GAAAN,CAAA,CAAA,SAA7C,SAAAO,EAAA,QAAAN,EAAAO,GAAAD,CAAA,CAAA,QAnBdE,GAAA,eANAC,GAAA,mBAeA,IAAAC,GAAA,eAeA,IAAAC,GAAA,UAAA,QAAA,SAAAC,EAAA,OAOcC,GAAAD,CAAA,QAPd,WAAA,SAAAE,EAAA,CAOM,IAAAC,EAAAC,EAAAC,GAAA,KAAA,EAA4BH,CAAA,eAHgBC,CAAA,EAAM,CAAA,CAAA,CAAA,MAwBxD,IAAAG,GAAA,iBAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,cAfA,IAAAC,GAAA,SAAAC,EAAA,8BAAA,SAAAC,EAAA,OAWcC,GAAAD,CAAA,SAXd,SAAAE,EAAA,OAaaC,GAAAD,CAAA,SAbb,UAAA,QAAA,UAAA,QAAA,UAAA,OAAA,iBAAA,SAAAE,EAAA,QAAA,SAAAC,EAAA,CAaM,IAAAC,EAAAC,EAAAC,GAAA,KAAA,EAA6BH,CAAA,EAF7BI,EAAAC,EAAAC,EAAAH,GAAA,KAAA,EAA8BH,CAAA,CAAA,EAG9BO,EAAAC,GAAAC,EAAAN,GAAA,KAAA,EAA8BC,CAAA,CAAA,EAAUH,CAAA,SANpBM,0BChR1B,gDAAA,4CAAA,6CAnBA,+CAAA,0CAAA,kDAAA,8CAAA,8CAAA,0DAAA,4CAAA,2DAAA,+CAnBA,kDAAA,2CAAA,mDAAA,+CAAA,gDAAA,4CAAA,4CAAA,8CAAA,2CA6BA,sDAAA,mDAAA,6HAaAG,GAAA,UAAA,qHAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,yCAJA,IAAAC,GAAAC,GAAAC,GAAAC,EAAA,EAAAC,EAAA,EAAAF,GAAAG,EAAA,EAAAC,EAAA,EAAAJ,GAAAK,EAAA,EAAAC,EAAA,EAAAC,EAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAnBAC,GAAAT,GAAAC,GAAAS,EAAA,EAAAL,EAAA,EAAAJ,GAAAU,EAAA,EAAAC,EAAA,EAAAX,GAAAY,EAAA,EAAAV,EAAA,EAAAF,GAAAa,EAAA,EAAAF,EAAA,EAAAX,GAAAc,EAAA,EAAAZ,EAAA,EAAAF,GAAAA,GAAAe,EAAA,EAAAX,EAAA,EAAAY,GAAAhB,GAAAiB,EAAA,EAAAb,EAAA,EAAAG,EAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAnBAW,GAAAnB,GAAAC,GAAAmB,EAAA,EAAAC,GAAAhB,EAAA,CAAA,EAAAJ,GAAAqB,EAAA,EAAAV,EAAA,EAAAX,GAAAsB,EAAA,EAAAlB,EAAA,EAAAJ,GAAAuB,EAAA,EAAArB,EAAA,EAAAF,GAAAwB,EAAA,EAAAtB,EAAA,EAAAF,GAAAA,GAAAyB,EAAA,EAAArB,EAAA,EAAAJ,GAAA0B,EAAA,EAAAtB,EAAA,EAAAY,GAAAhB,GAAA2B,EAAA,EAAAzB,EAAA,EAAAF,GAAA4B,EAAA,EAAAxB,EAAA,EAAAG,EAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EA6BAsB,GAAA9B,GAAAC,GAAA8B,EAAA,EAAA5B,EAAA,EAAAF,GAAA+B,EAAA,EAAA7B,EAAA,EAAAF,GAAAgC,EAAA,EAAA9B,EAAA,EAAAK,EAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAAA,EAAA,EAAA,CAAA,EAmBA,IAAA0B,GAAA,uQAEAC,GAAA,SAAAC,EAAA,sCAIM,OADGA,EAAA,OAAA,mBACsBA,EAAA,QAAA,CAAA,EAAAC,GAAkCD,EAAA,KAAA,CAAA,EADxDA,EAAA,OAAA,0BAEoCA,EAAA,QAAA,CAAA,EAAAC,GAAkCD,EAAA,KAAA,CAAA,EAFtEA,EAAA,OAAA,aAGW,SAAAE,EAAA,eAA0BF,EAAA,SAAAG,GAA8B,GAAA,EAAaD,CAAA,CAAA,OAAmBF,EAAA,KAAA,CAAA,EACtGI,GAAAC,GAAA,KAAA,SAENC,GAAA,SAAAC,EAAA,CACmB,GAAnBA,aAAAC,GAAmC,MACjC,MAAQ,eADVD,EAAA,MAAA,WAAAA,EAAA,QAEmB,GAFnBA,aAAAE,GAE0C,MACxC,MAAQ,sBAHVF,EAAA,MAAA,WAAAA,EAAA,QAImB,GAJnBA,aAAAG,GAIuC,MACrC,MAAQ,sBAAgD,GAAA,EAL1DH,EAAA,MAAA,CAAA,WAAAA,EAAA,QAMkB,GANlBA,aAAAF,SAOE,MAAQ,gBAAgC,EAAA,WAAc,gGAPxDE,EAAA,YAAA,IAAA,CAAA,GAmBA,IAAAI,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACa,GAAbD,aAAAE,GAA6B,OAAA,IAAAA,GAA7BD,EAAAD,EAAA,MAAA,EACa,GADbA,aAAAG,GACoC,OAAA,IAAAA,GADpCF,EAAAD,EAAA,MAAA,EAEa,GAFbA,aAAAI,GAEiC,OAAA,IAAAA,GAFjCH,EAAAD,EAAA,MAAA,EAGY,GAHZA,aAAAK,GAG6B,OAAAA,GAAA,oGAH7BL,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,IALAK,GAAA,SAAAN,EAAA,CACW,OAAXA,aAAAI,IAPAG,GAAA,SAAAP,EAAA,CAGY,GAFZA,aAAAE,IAAAF,aAAAG,IAAAH,aAAAI,GAEgC,OAFhCJ,EAAA,OAGW,GAHXA,aAAAK,SAG8B,iGAH9BL,EAAA,YAAA,IAAA,CAAA,GCtGA,IAAMQ,GAAa,UAAY,CAC7B,OAAO,MACT,ECuBA,IAAAC,GAAA,SAAAC,EAAA,QAAAA,GCGO,SAASC,GAAUC,EAAK,CAC7B,OAAOA,EAAI,QACb,CCsCA,IAAAC,GAAAC,EANA,IAAAC,GAAAC,EAoDA,IAAAC,GAAA,SAAAC,EAAA,6BACsCA,CAAA,ICnH/B,SAASC,GAAMC,EAASC,EAAMC,EAAO,CAC1C,IAAIC,EAAM,OAAO,UAAU,SAAS,KAAKD,CAAK,EAC9C,OAAIC,EAAI,QAAQ,cAAc,IAAM,GAAKA,EAAI,QAAQ,UAAU,IAAMA,EAAI,OAAS,EACzEF,EAAKC,CAAK,EAEVF,CAEX,CCyEA,IAAAI,GAAAC,EAHA,IAAAC,GAAAC,EAlBA,IAAAC,GAAA,SAAAC,EAAA,4BAC0CA,CAAA,GCNnC,SAASC,GAAQC,EAAM,CAC5B,OAAO,SAAUC,EAAU,CACzB,OAAO,UAAY,CACjBA,EAAS,KAAOD,CAClB,CACF,CACF,CAIO,SAASE,GAAOD,EAAU,CAC/B,OAAO,UAAY,CACjB,OAAOA,EAAS,MAClB,CACF,CA4DO,SAASE,GAAOC,EAAU,CAC/B,OAAO,UAAY,CACjB,OAAOA,EAAS,MAClB,CACF,CAgCO,SAASC,GAAOC,EAAU,CAC/B,OAAO,UAAY,CACjBA,EAAS,OAAO,CAClB,CACF,CCxKO,SAASC,GAASC,EAAQ,CAC/B,OAAO,UAAY,CACjB,OAAOA,EAAO,QAChB,CACF,CAQO,SAASC,GAASC,EAAQ,CAC/B,OAAO,UAAY,CACjB,OAAOA,EAAO,QAChB,CACF,iHCWAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCACAC,GAAA,MAAA,SAAAC,EAAA,CACO,GAALA,aAAAH,SAAY,OACP,GADLG,aAAAF,SACc,mGADdE,EAAA,YAAA,IAAA,CAAA,cA0FFC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAkBI,IAAAC,EAAAC,GAAA,MAAA,YARA,qGACQL,eACQD,CAAA,oBACUK,EAAA,eAAmBA,EAAA,SAAA,CAAA,EAAgBH,CAAA,UACjDC,iBACOC,SAtDvBG,GAAA,SAAAC,EAAA,CAKI,IAAAH,EAAAC,GAAWE,CAAA,eAHPT,GAAAU,GAAA,KAAA,EAAcJ,EAAA,YAAA,EAAiB,CAAA,CAAA,EAAAK,EAAA,KAAA,EAAAC,EAAA,CAAA,CAAA,EAArC,UAAA,kCA0BFC,GAAA,SAAAZ,EAAA,QAAA,SAAAa,EAAA,QAAA,SAAAX,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QASIL,GAASC,CAAA,EAAAM,GAAA,MAAA,EAAA,MAA6BO,CAAA,EAAMX,CAAA,EAAQC,CAAA,EAAQC,CAAA,OAnBhEU,GAAA,SAAAd,EAAA,QAAA,SAAAa,EAAA,QAAA,SAAAV,EAAA,QAAA,SAAAC,EAAA,QAQIQ,GAAUZ,CAAA,EAAOa,CAAA,EAAK,CAAA,IAAAE,GAAAC,EAAA,CAAA,CAAA,EAAAC,GAAAC,GAAA,MAAA,EAAkEf,CAAA,CAAA,EAASC,CAAA,MAjErGe,GAAA,SAAAC,EAAA,CAEM,IAAAP,EAAO,OAAAQ,GAAcD,CAAA,EAAO,gBAChCN,GAAAL,GAAA,KAAA,EAAiBI,CAAA,EAAAH,EAAA,KAAA,EAAAC,EAAA,GAZnBW,GAAA,SAAAF,EAAA,QAAA,SAAAG,EAAA,CAEM,IAAAV,EAAO,OAAAQ,GAAcD,CAAA,GAAO,IAAAI,GAAYD,CAAA,cACtCT,GAAAL,GAAA,KAAA,EAAiBI,CAAA,EAAAH,EAAA,KAAA,EAAAC,EAAA,CAAA,IAoDzBc,GAAA,SAAAC,EAAA,oBAAA,SAAA1B,EAAA,QAAA,SAAAa,EAAA,QAAA,SAAAV,EAAA,QAAA,SAAAC,EAAA,QASIQ,GAAUZ,CAAA,EAAOa,CAAA,EAAK,CAAA,IAAAE,GAAAY,EAAA,CAAA,CAAA,EAAAV,GAA+B,SAAAW,EAAA,aAAAA,CAAA,CAAA,IAAiCzB,CAAA,CAAA,EAASC,CAAA,UAhCvFqB,GAAAI,EAAA,KARFJ,GAAAK,EAAA,KAJNL,GAAAM,EAAA,KA0BAN,GAAAO,EAAA,EAhBJC,GAAA,SAAAC,EAAA,wBAE2B,cAAA,EAAA,IAAAC,EAAsBD,CAAA,CAAA,EAAAE,EAAA,CAAA,EAA7C,SAAAC,EAAA,iBACYA,CAAA,CAAA,EAAS,SAAAC,EAAA,WACEA,EAAA,IAAA,QAZ3BC,GAAA,SAAAC,EAAA,wBAEyB,iBAAA,EAAA,IAAAL,EAAyBK,CAAA,CAAA,EAAAC,EAAA,CAAA,EAAhD,SAAAJ,EAAA,iBACYA,CAAA,CAAA,EAAS,SAAAC,EAAA,UACfA,EAAA,MAAA,EAAc,GAAA,EAAlB,OAAAI,QACUJ,EAAA,IAAA,EADV5B,EAAA,YAUJiC,GAAA,SAAAT,EAAA,qBAEmB,kBAAA,EAAA,IAAAC,EAA0BD,CAAA,CAAA,EAAAvB,EAAA,GApB7CiC,GAAA,SAAAJ,EAAA,qBAEmB,cAAA,EAAA,IAAAL,EAAsBK,CAAA,CAAA,EAAAC,EAAA,GANzCI,GAAA,SAAAL,EAAA,qBAEmB,SAAA,EAAA,IAAAL,EAAiBK,CAAA,CAAA,EAAAC,EAAA,GA4BpCK,GAAA,SAAAC,EAAA,qBAEmB,qBAAA,EAAA,IAAAZ,EAA6BY,CAAA,CAAA,EAAApC,EAAA,GANhDqC,GAAA,SAAAC,EAAA,QAEEnC,GAAAoC,GAAA,KAAA,EAAoB,YAAA7B,GAAoB4B,CAAA,CAAA,EAAAvC,EAAA,KAAA,EAAAC,EAAA,GArC1CwC,GAAA,SAAA/B,EAAA,QAEEN,GAAAoC,GAAA,KAAA,EAAoB,MAAA7B,GAAcD,CAAA,CAAA,EAAAV,EAAA,KAAA,EAAAC,EAAA,GCnCpC,IAAAyC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCA2BAC,GACkB,SAAAC,EAAA,CAChB,GAAAA,aAAAvB,SAAe,SACf,GAAAuB,aAAAtB,SAAiB,WACjB,GAAAsB,aAAArB,SAAc,QACd,GAAAqB,aAAApB,SAAa,OACb,GAAAoB,aAAAnB,SAAsB,iBACtB,GAAAmB,aAAAlB,SAAc,QACd,GAAAkB,aAAAjB,SAAa,OACb,GAAAiB,aAAAhB,SAAe,SACf,GAAAgB,aAAAf,SAAc,QACd,GAAAe,aAAAd,SAAc,QACd,GAAAc,aAAAb,SAAe,SACf,GAAAa,aAAAZ,SAAiB,WACjB,GAAAY,aAAAX,SAAc,QACd,GAAAW,aAAAV,SAAc,QACd,GAAAU,aAAAT,SAAc,QACd,GAAAS,aAAAR,SAAe,SACf,GAAAQ,aAAAP,SAAe,SACf,GAAAO,aAAAN,SAAY,MACZ,GAAAM,aAAAL,SAAa,OACb,GAAAK,aAAAJ,SAAa,OACb,GAAAI,aAAAH,SAAY,MACZ,GAAAG,aAAAF,SAAa,+IC1Bf,IAAAG,GAAA,OAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACQ,OAAiB,SAAAC,EAAA,QAAvBD,EAAAF,EAAuBG,CAAA,CAAA,OAMzBC,GAAA,OAAA,SAAAH,EAAA,CACS,OAAY,SAAAI,EAAA,QAAnBJ,EAAAK,GAAmBD,CAAA,CAAA,WADrB,SAAAJ,EAAA,CAEU,OAAY,SAAAM,EAAA,QAApBN,EAAAO,GAAoBD,CAAA,CAAA,gBAFtB,UAAA,aCJA,IAAAE,GAAA,OAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACQ,OAAA,IAAAC,GAANF,EAAAC,EAAA,MAAA,EAAAA,EAAA,MAAA,6BADF,UAAA,aAHE,IAAAE,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,6BCFF,IAAAC,GAAA,SAAAC,EAAA,WACiBA,EAAGC,EAAA,CAAA,GAOpBC,GAAA,SAAAC,EAAA,QAAA,SAAAH,EAAA,QACaD,GAAKC,CAAA,EAAEG,CAAA,IAcpBC,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,UACa,SAAAC,EAAA,QAAGL,GAAAK,CAAA,EAAGD,CAAA,MCDnB,IAAAE,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,0CAAA,SAAAC,EAAA,UACqBF,CAAA,EAAI,SAAAG,EAAA,CAAE,OAAAA,EAAA,OAAAA,EAAA,MAAA,MAA0BD,CAAA,CAAA,KAJrDE,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAL,EAAA,QACeF,GAAM,SAAAQ,EAAA,eAAaF,EAAIE,CAAA,EAAG,SAAAC,EAAA,QAAMF,EAAIC,CAAA,EAAEC,CAAA,YC6BrD,IAAAC,GAAA,SAAAC,EAAA,QACSA,GAOTC,GAAA,SAAAD,EAAA,QAAA,SAAAE,EAAA,QACUH,GAAKC,CAAA,EAAAG,EAASD,CAAA,CAAA,IAiCxB,IAAAE,GAAA,SAAAC,EAAA,iEAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,YAC8BC,GAAKF,CAAA,EAAEC,CAAA,CAAA,CAAA,KALrC,IAAAE,GAAA,SAAAC,EAAA,iEAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,YAC2BC,GAAIF,CAAA,EAAEC,CAAA,CAAA,CAAA,KCjGjC,IAAAE,GAAA,6BAAA,UAAA,aAFEC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,SCuCF,IAAAC,GAAAC,EAhBAC,GAAAD,ECRA,IAAAE,GAAA,UAAA,qHAgHA,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACW,OAAAC,GAA4B,SAAAC,EAAA,CAAE,OAAzCH,EAAAG,EAAA,MAAA,EAAAA,EAAA,MAAA,IAAAF,CAAA,IANA,IAAAG,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,kBACgDD,EAAEC,CAAA,CAAA,IA5ElDC,GAAA,KAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACM,OAAAC,GAA4B,SAAAC,EAAA,CAAE,OAAmBP,GAAU,SAAAQ,EAAA,QAA/DJ,EAAAG,EAAA,OAA+DC,CAAA,CAAA,gBAA/DH,CAAA,KAkGF,IAAAI,GACeC,GAAAC,GAAAC,EAAA,CAAA,gOChFf,IAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,6QAoqBA,IAAAC,GAAA,UAAA,2JAZAC,GAAA,UAAA,2JAvEAC,GACa,SAAAC,EAAAC,EAAAC,EAAAC,EAAA,CACX,GADkCD,aAAAE,GAAA,CAG9B,GADGD,aAAAC,iBAEI,EAAE,EAAEJ,EAAEC,EAAEC,EAAEC,CAAA,EACjB,GAHGA,aAAAE,GAGE,OAAA,IAAAA,GACG,EAJLF,EAAA,OAIK,EAAS,EAJdA,EAAA,OAIc,EAAQH,EAAEC,EAAEC,EAAEC,CAAA,4GAJ5BA,EAAA,YAAA,IAAA,CAAA,EAKP,GAPkCD,aAAAG,GAAA,CAS9B,GADGF,aAAAC,iBAEK,EAVsBF,EAAA,OAUtB,EAAS,EAVaA,EAAA,OAUb,EAAQF,EAAEC,EAAEC,EAAEC,CAAA,EAC/B,GAHGA,aAAAE,GAGE,OAAA,IAAAA,GACG,EAAA,UAAA,OAZsBH,EAAA,OAQ3BC,EAAA,OAIS,OAAAG,EAZkBJ,EAAA,OAQ3BC,EAAA,UAIK,GAAiC,EAZXD,EAAA,OAYW,GAJtCC,EAAA,OAIsC,EAAaH,EAAEC,EAAEC,EAAEC,CAAA,4GAJzDA,EAAA,YAAA,IAAA,CAAA,6GAR2BD,EAAA,YAAA,IAAA,CAAA,GA9apC,IAAAK,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,eACqB,EAAE,EAAED,EAAEC,EAAAC,GAAA,MAAAA,GAAA,KAAA,IA6b3BC,GAAA,UAAA,CAwCE,IAAAC,EACS,SAAAH,EAAA,CACP,GAAAA,aAAAC,SAAQ,GACR,GAAAD,aAAAI,GAAK,OAAAJ,EAAA,wIAnBPK,EACa,SAAAN,EAAAC,EAAAM,EAAAC,EAAAC,EAAAC,EAAAC,EAAA,CACX,OAD4CD,aAAAL,IAAAK,EAAA,OAEnCN,EAAOO,CAAA,EACHC,GAH+BF,EAAA,OAAAA,EAAA,OAGNE,GAAWZ,EAAEC,EAAEM,EAHTG,EAAA,MAAA,EAGuBE,GAAWJ,EAAGC,EAHrCC,EAAA,OAG2CC,CAAA,CAAA,EAE9EC,GAAWJ,EAAGC,EAAWG,GAAWZ,EAAEC,EAAEM,EAAEG,CAAA,EAAIC,CAAA,GAEzDE,EACc,SAAAb,EAAAC,EAAAa,EAAAC,EAAAC,EAAAC,EAAAC,EAAA,CACZ,OAD6CD,aAAAZ,IAEzCD,EAAOY,CAAA,GAFkCC,EAAA,OAGhCL,GAHgCK,EAAA,OAAAA,EAAA,OAGPL,GAAWE,EAAGC,EAAGC,EAHVC,EAAA,MAAA,EAGyBL,GAAWZ,EAAEC,EAHtCgB,EAAA,OAG2CC,CAAA,CAAA,EAE/EN,GAAWE,EAAGC,EAAGC,EAAWJ,GAAWZ,EAAEC,EAAEgB,EAAGC,CAAA,CAAA,UArCtC,SAAAlB,EAAAC,EAAAM,EAAAW,EAAA,CACnB,GAD0CX,aAAAL,GAGtC,OADGgB,aAAAhB,GAEDH,GAAUC,CAAA,EAAEC,CAAA,EAFXiB,aAAAb,IAAAa,EAAA,OAIM,EACIZ,EAAWN,EAAEC,EAAEM,EALzBW,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAAAA,EAAA,MAAA,EAOMN,GAAWZ,EAAEC,EAAEM,EAAEW,CAAA,EAC9B,GAV0CX,aAAAF,GAAA,CAYtC,GADGa,aAAAb,GAAA,CACE,GADFa,EAAA,QAXmCX,EAAA,OAaxB,EAAV,UACSD,EAAWN,EAAEC,EAAEM,EAHzBW,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAAAA,EAAA,MAAA,EACE,GAZiCX,EAAA,QAWnCW,EAAA,OAIW,EAAV,UACSL,EAAYb,EAAEC,EAhBWM,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAgBGW,CAAA,EACzC,OANGA,aAAAhB,IAXmCK,EAAA,OAkB7B,EACIM,EAAYb,EAAEC,EAnBWM,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAmBGW,CAAA,EAEhCN,GAAWZ,EAAEC,EAAEM,EAAEW,CAAA,6GArBYX,EAAA,YAAA,IAAA,CAAA,gEAsE9B,SAAAY,EAAAnB,EAAAoB,EAAA,CACZ,GADoCA,aAAAlB,4CAGpC,GAHoCkB,aAAAf,GAAA,CADtC,IAAAJ,EAKSkB,EAAKnB,CAAA,EAJwBoB,EAAA,MAAA,EAKhC,GANNnB,aAAAoB,EAAA,CAAA,IAAAC,EAAAC,GAAA,GAAA,EAOiDJ,EAAKnB,EANhBoB,EAAA,MAAA,EAMzB,OAAA,IAAAI,GAPbF,EAAA,OAAAA,EAAA,OAQ2BnB,GAPWiB,EAAA,OAAAA,EAAA,OADtCE,EAAA,OACsCF,EAAA,MAAA,CAAA,EAQhC,GATNnB,aAAAwB,EAAA,CAAA,IAAAH,EAAAC,GAAA,GAAA,EAUiDJ,EAAKnB,EAThBoB,EAAA,MAAA,EASzB,OAAA,IAAAI,GAVbF,EAAA,OAWwBnB,GAVciB,EAAA,OAAAA,EAAA,OAAAA,EAAA,OADtCE,EAAA,MAAA,EAAAA,EAAA,MAAA,EAYM,GAZNrB,aAAAyB,uBACsCN,EAAA,MAAA,EAAAA,EAAA,OAAAA,EAAA,MAAA,4GADtCnB,EAAA,YAAA,IAAA,CAAA,6GACsCmB,EAAA,YAAA,IAAA,CAAA,KADtCO,GAAAJ,GAAA,GAAA,gEAVkB,SAAAvB,EAAAC,EAAAM,EAAAW,EAAA,CAChB,GADuCA,aAAAhB,iBACrBF,EAAEC,EAAEM,CAAA,EACtB,GAFuCW,aAAAb,GAAA,CADzC,IAAAiB,EAAAM,GAAA,GAAA,EACyCV,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAAAA,EAAA,MAAA,EAGhC,OAAA,IAAAW,GAJTP,EAAA,OAAAA,EAAA,OAK4BnB,GAAmBH,EAAEC,EAAEM,EALnDe,EAAA,MAAA,CAAA,6GACyCJ,EAAA,YAAA,IAAA,CAAA,KADzCY,GAAAF,GAAA,GAAA,EAZAG,GACkB,SAAA9B,EAAAqB,EAAA,CAChB,GAAArB,aAAAC,GAAM,OAAAoB,EACN,GAAArB,aAAAI,GAAA,CAHF,IAAA2B,EAImCF,GAAA7B,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAAAA,EAAA,MAAA,EAA1B,OACEE,GALX6B,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAAAV,CAAA,sJA9OA,IAAAW,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAAA,IAAAC,EAE6BC,GAAAC,EAAoBJ,EAAEC,CAAA,EAA5C,OAAAI,GACA,SAAAC,EAAA,eAAYA,EAAUC,GAH7BL,EAAA,OAAAA,EAAA,MAAA,CAAA,IAAAA,EAAA,MAAA,KApOA,IAAAM,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,CAGE,IAAAC,EAAK,SAAAC,EAAA,0BACH,GAAAC,aAAAC,uBACA,GAAAD,aAAAE,GAAA,CALJ,IAAAC,EAAAC,EAMmBP,CAAA,EAAAG,EAAA,MAAA,EACX,GAPRG,aAAAE,EAAA,mBAQQ,GARRF,aAAAG,EAAA,mBASQ,GATRH,aAAAI,yIAAAJ,EAAA,YAAA,IAAA,CAAA,kKACWL,IA2LX,IAAAU,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAGE,IAAAC,EAAK,SAAAC,EAAA,CACH,GAAAA,aAAAC,UAAQC,GAAUL,CAAA,EAAEC,CAAA,EACpB,GAAAE,aAAAG,GAAA,CALJ,IAAAC,EAAAC,EAMmBR,CAAA,EAAAG,EAAA,MAAA,EACX,GAPRI,aAAAE,SAOqBC,GAAAP,EAAA,OAAAA,EAAA,OAA0BD,EAAAC,EAAA,MAAA,EAAAA,EAAA,MAAA,EACvC,GARRI,aAAAI,SAQqBD,GAAAP,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAA6BD,EAAAC,EAAA,MAAA,CAAA,EAC1C,GATRI,aAAAK,mCASyBZ,EAAEC,EAAAE,EAAA,OAAAA,EAAA,MAAA,4GAT3BI,EAAA,YAAA,IAAA,CAAA,yIACaL,KA5Sb,IAAAW,GAAA,OAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,qDAGS,SAAAC,EAAAC,EAAA,CACH,GADwBD,aAAAE,UAChBD,EACR,GAFwBD,aAAAG,GAEnB,OAAAC,EAAA,GAAA,EAFmBJ,EAAA,OAGTF,EAHSE,EAAA,MAAA,EAAAI,EAAA,GAAA,EAAAJ,EAAA,OAGQC,CAAA,CAAA,CAAA,6GAHRD,EAAA,YAAA,IAAA,CAAA,KAA1BK,EAAAD,EAAA,GAAA,SAFU,SAAAE,EAAA,QAAaD,EAAGC,EAAEP,CAAA,WADhC,SAAAD,EAAA,QAAA,SAAAC,EAAA,qDASS,SAAAE,EAAAD,EAAA,CACH,GADwBA,aAAAE,UAChBD,EACR,GAFwBD,aAAAG,GAEnB,OAAAC,EAAA,GAAA,EACQN,EAAAM,EAAA,GAAA,EAAaH,EAHFD,EAAA,MAAA,CAAA,EAAAA,EAAA,MAAA,EAAAA,EAAA,MAAA,6GAAAA,EAAA,YAAA,IAAA,CAAA,KAA1BK,EAAAD,EAAA,GAAA,SAFU,SAAAE,EAAA,QAAaD,EAAGN,EAAEO,CAAA,aAPhC,SAAAC,EAAA,yCAAA,SAAAT,EAAA,CAeI,IAAAO,EAAK,SAAAG,EAAA,CACH,GAAAA,aAAAN,YACA,GAAAM,aAAAL,GAAK,OAAAM,EACHJ,EAAAG,EAAA,MAAA,CAAA,EAAAC,EAAQX,EAAAU,EAAA,MAAA,CAAA,EAAOH,EAAAG,EAAA,MAAA,CAAA,CAAA,0IALTH,KA8Dd,IAAAK,GAAA,UAAA,oBA2PA,IAAAC,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,CAGE,IAAAC,EAAK,SAAAC,EAAA,CACH,GAAAA,aAAAC,mBACA,GAAAD,aAAAE,GAAA,CALJ,IAAAC,EAAAC,EAMmBN,CAAA,EAAAE,EAAA,MAAA,EACX,GAPRG,aAAAE,SAOqBC,GAAAN,EAAA,OAAAA,EAAA,OAA0BD,EAAAC,EAAA,MAAA,EAAAA,EAAA,MAAA,EACvC,GARRG,aAAAI,SAQqBD,GAAAN,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAA6BD,EAAAC,EAAA,MAAA,CAAA,EAC1C,GATRG,aAAAK,UASqBC,GAAAT,EAAA,OAAAA,EAAA,MAAA,4GATrBG,EAAA,YAAA,IAAA,CAAA,yIACWJ,IAkBX,IAAAW,GAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAAA,IAAAC,EAE2BC,GAAAC,EAAoBJ,EAAEC,CAAA,EAFjDI,EAGON,EAHPG,EAAA,MAAA,EAII,GAJJG,aAAAC,SAKaC,GALbL,EAAA,OAAAA,EAAA,MAAA,EAMI,GANJG,aAAAG,EAMS,OACIC,GAAmBT,EAPhCK,EAAA,OAAAH,EAAA,OAAAA,EAAA,MAAA,4GAAAG,EAAA,YAAA,IAAA,CAAA,MClfA,IAAAK,GAAA,UAAA,2JAQA,IAAAC,GAAA,SAAAC,EAAA,uCANAC,GAAA,IAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACM,OAAJD,EAAA,OAAAA,EAAA,MAAA,EAAAC,EAAA,MAAA,KAEFC,GAAA,SAAA,SAAAF,EAAA,QAAA,SAAAC,EAAA,CACW,OAATD,EAAA,OAAAA,EAAA,MAAA,EAAAC,EAAA,MAAA,QADF,UAAA,iECwDA,IAAAE,GAAA,UAAA,QAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CASI,OAAAC,GAAA,IAAAC,GAAAC,EAAJL,CAAA,EAAAM,EAAAL,CAAA,CAAA,CAAA,EAAAC,CAAA,QA3BAK,GAAA,UAAA,QAAA,SAAAT,EAAA,oBAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CASO,OAAAM,GAAA,IAAAJ,GAAAC,EAAPL,CAAA,EAAAM,EAAAL,CAAA,CAAA,CAAA,EAAAC,CAAA,QA2BAO,GAAA,UAAA,QAAA,SAAAX,EAAA,oBAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAS,EAAA,QAAA,SAAAR,EAAA,CAUO,OAAAS,GAAA,IAAAP,GAAAC,EAAPL,CAAA,EAAAM,EAAAL,CAAA,CAAA,CAAA,EAAAS,CAAA,EAAAR,CAAA,SA+BAU,GAAA,SAAAC,EAAA,wBAAA,SAAAX,EAAA,QAAA,SAAAY,EAAA,CAMa,OAAAC,EAA8B,SAAAC,EAAA,QAA3CF,EAA2CE,CAAA,IAA3Cd,CAAA,KAtFAe,GAAAA,GC9CA,IAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCA6DAC,GACyB,SAAAC,EAAA,CACvB,GAAAA,aAAAzD,SAAmB,MACnB,GAAAyD,aAAAxD,SAAkB,KAClB,GAAAwD,aAAAvD,SAAoB,OACpB,GAAAuD,aAAAtD,SAA+B,mBAC/B,GAAAsD,aAAArD,SAAyB,aACzB,GAAAqD,aAAApD,SAA8B,kBAC9B,GAAAoD,aAAAnD,SAA0B,cAC1B,GAAAmD,aAAAlD,SAA+B,mBAC/B,GAAAkD,aAAAjD,SAAwB,WACxB,GAAAiD,aAAAhD,SAAqB,QACrB,GAAAgD,aAAA/C,SAAwB,WACxB,GAAA+C,aAAA9C,SAA2B,eAC3B,GAAA8C,aAAA7C,SAA+B,mBAC/B,GAAA6C,aAAA5C,SAA2B,gBAC3B,GAAA4C,aAAA3C,SAAiC,qBACjC,GAAA2C,aAAA1C,SAA4B,eAC5B,GAAA0C,aAAAzC,SAA6B,iBAC7B,GAAAyC,aAAAxC,SAA4B,gBAC5B,GAAAwC,aAAAvC,SAA4B,gBAC5B,GAAAuC,aAAAtC,SAA4B,gBAC5B,GAAAsC,aAAArC,SAA6B,iBAC7B,GAAAqC,aAAApC,SAA6B,iBAC7B,GAAAoC,aAAAnC,SAA6B,iBAC7B,GAAAmC,aAAAlC,SAA6B,iBAC7B,GAAAkC,aAAAjC,SAAuB,UACvB,GAAAiC,aAAAhC,SAA2B,eAC3B,GAAAgC,aAAA/B,SAA0B,cAC1B,GAAA+B,aAAA9B,SAA8B,UAC9B,GAAA8B,aAAA7B,SAAmC,gBACnC,GAAA6B,aAAA5B,SAAwC,qBACxC,GAAA4B,aAAA3B,SAAoC,iBACpC,GAAA2B,aAAA1B,SAAgC,YAChC,GAAA0B,aAAAzB,SAAoC,SACpC,GAAAyB,aAAAxB,SAAyC,eACzC,GAAAwB,aAAAvB,SAAwC,cACxC,GAAAuB,aAAAtB,SAAsC,SACtC,GAAAsB,aAAArB,SAA8B,UAC9B,GAAAqB,aAAApB,SAAmC,uBACnC,GAAAoB,aAAAnB,SAAiC,qBACjC,GAAAmB,aAAAlB,SAAwB,WACxB,GAAAkB,aAAAjB,SAAwB,OACxB,GAAAiB,aAAAhB,SAA2B,WAC3B,GAAAgB,aAAAf,SAA6B,aAC7B,GAAAe,aAAAd,SAA4B,YAC5B,GAAAc,aAAAb,SAAmB,MACnB,GAAAa,aAAAZ,SAAyB,MACzB,GAAAY,aAAAX,SAAoC,mBACpC,GAAAW,aAAAV,SAAiC,eACjC,GAAAU,aAAAT,SAAiC,eACjC,GAAAS,aAAAR,SAA8B,YAC9B,GAAAQ,aAAAP,SAAoC,mBACpC,GAAAO,aAAAN,SAAoC,mBACpC,GAAAM,aAAAL,SAAkC,gBAClC,GAAAK,aAAAJ,SAAoB,OACpB,GAAAI,aAAAH,SAAmB,MACnB,GAAAG,aAAAF,SAAqB,wJCtHvB,IAAAG,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAQAC,GACmB,SAAAC,EAAA,CACjB,GAAAA,aAAAJ,SAAgB,SAChB,GAAAI,aAAAH,SAAgB,SAChB,GAAAG,aAAAF,SAAe,iJCFjB,IAAAG,GAAA,UAAA,qHAAAC,GAAA,UAAA,+ECIA,IAAAC,GAAA,UAAA,iMAOAC,GAAAC,EAQAC,GACgB,SAAAC,EAAAC,EAAA,0BAAiDA,CAAA,GAZjEC,GAAAJ,EAkBAK,GACgB,SAAAH,EAAA,4BAZhBI,GACUP,GAAO,SAAAG,EAAA,CAAE,OAAAA,EAAA,+BCLnB,IAAAK,GAAA,UAAA,+EAAAC,GAAA,UAAA,iMAAAC,GAAA,UAAA,iMAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAqCAC,GAAA,UAAA,2JASAC,GAAA,SAAAC,EAAA,QAKY,SAAAC,EAAA,QAAAD,EAAAC,CAAA,IAXZ,IAAAC,GAAAC,EANA,IAAAC,GAAA,OAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QACcC,GAAQ,SAAAC,EAAA,CAAE,OAAiBC,GAAA,IAAAC,GAAc,SAAAC,EAAA,QAAAN,EAAAG,EAAA,OAAAG,CAAA,CAAA,GAAW,SAAAC,EAAA,QAAAN,EAAAE,EAAA,OAAAI,CAAA,CAAA,6BAkBlE,IAAAC,GAKEC,GAAQ,SAAAC,EAAA,CAEJ,IAAAC,EAAA,SAAAC,EAAA,CAAI,GAAJA,aAAAC,GAAS,OAAA,IAAAA,GAATD,EAAA,MAAA,EACI,GADJA,aAAAE,GACS,OAAA,IAAAA,GADTF,EAAA,OAAAA,EAAA,OAAAF,EAAA,OAAAE,EAAA,MAAA,EAAAG,GAC4CJ,CAAA,EAD5CC,EAAA,MAAA,CAAA,EAEI,GAFJA,aAAAI,GAEU,OAAA,IAAAA,GAFVJ,EAAA,OAAAA,EAAA,OAAAF,EAAA,OAAAE,EAAA,MAAA,EAAAG,GAAAE,GAEmDN,CAAA,CAAA,EAFnDC,EAAA,MAAA,CAAA,EAGI,GAHJA,aAAAM,GAGW,OAAA,IAAAA,GAAAR,EAAA,OAHXE,EAAA,MAAA,CAAA,EAII,GAJJA,aAAAO,GAIY,OAAA,IAAAA,GAAAC,GAAAV,EAAA,MAAA,EAAAA,EAAA,MAAA,EAJZE,EAAA,MAAA,CAAA,2GAAAA,EAAA,YAAA,IAAA,CAAA,UAMAD,EAAAD,EAAA,MAAA,ICzFC,SAASW,GAAaC,EAAKC,EAAK,CACrC,OAAOA,EAAID,CAAG,CAChB,CAEO,SAASE,GAAaF,EAAKC,EAAK,CACrC,OAAOA,EAAI,eAAeD,CAAG,CAC/B,CAEO,SAASG,GAAaH,EAAKI,EAAKH,EAAK,CACxCA,EAAID,CAAG,EAAII,CACf,CAMO,SAASC,GAAKC,EAAGC,EAAG,CAEzB,QADIC,EAAI,CAAC,EACAC,EAAI,EAAGA,EAAIH,EAAE,OAAQG,IAC5BD,EAAE,KAAKD,EAAEE,EAAGH,EAAEG,CAAC,CAAC,CAAC,EAEnB,OAAOD,CACT,CAEO,SAASE,GAASJ,EAAGC,EAAG,CAC7B,QAASE,EAAI,EAAGA,EAAIH,EAAE,OAAQG,IAC5BF,EAAED,EAAEG,CAAC,CAAC,CAEV,CAEO,SAASE,GAAOC,EAAGL,EAAG,CAE3B,QADIM,EAAK,OAAO,KAAKD,CAAC,EACbH,EAAI,EAAGA,EAAII,EAAG,OAAQJ,IAAK,CAClC,IAAIK,EAAID,EAAGJ,CAAC,EACZF,EAAEO,EAAGF,EAAEE,CAAC,CAAC,CACX,CACF,CAQO,SAASC,GAAYC,EAAIC,EAAIC,EAAIC,EAAIC,EAAI,CAK9C,QAJIC,EAAK,CAAC,EACNC,EAAKN,EAAG,OACRO,EAAKN,EAAG,OACRO,EAAK,IACC,CACR,GAAIA,EAAIF,EACFE,EAAID,EACNF,EAAG,KAAKH,EAAGM,EAAGR,EAAGQ,CAAC,EAAGP,EAAGO,CAAC,CAAC,CAAC,EAE3BL,EAAGK,EAAGR,EAAGQ,CAAC,CAAC,UAEJA,EAAID,EACbF,EAAG,KAAKD,EAAGI,EAAGP,EAAGO,CAAC,CAAC,CAAC,MAEpB,OAEFA,GACF,CACA,OAAOH,CACT,CAEO,SAASI,GAAcC,EAAIC,EAAIC,EAAG,CAEvC,QADIC,EAAI,CAAC,EACAL,EAAI,EAAGA,EAAIE,EAAG,OAAQF,IAAK,CAClC,IAAIM,EAAIJ,EAAGF,CAAC,EACRO,EAAIJ,EAAGG,CAAC,EACZD,EAAEE,CAAC,EAAIH,EAAEG,EAAGP,EAAGM,CAAC,CAClB,CACA,OAAOD,CACT,CAEO,SAASG,GAAkBC,EAAIP,EAAIC,EAAIT,EAAIC,EAAIC,EAAI,CAExD,QADIc,EAAK,CAAC,EACDV,EAAI,EAAGA,EAAIE,EAAG,OAAQF,IAAK,CAClC,IAAIM,EAAIJ,EAAGF,CAAC,EACRO,EAAIJ,EAAGG,CAAC,EACRG,EAAG,eAAeF,CAAC,EACrBG,EAAGH,CAAC,EAAIb,EAAGa,EAAGP,EAAGS,EAAGF,CAAC,EAAGD,CAAC,EAEzBI,EAAGH,CAAC,EAAIX,EAAGW,EAAGP,EAAGM,CAAC,CAEtB,CACA,QAASC,KAAKE,EACRF,KAAKG,GAGTf,EAAGY,EAAGE,EAAGF,CAAC,CAAC,EAEb,OAAOG,CACT,CAEO,SAASC,GAAML,EAAGM,EAAG,CAC1B,OAAON,IAAMM,CACf,CAEO,SAASC,GAAeC,EAAGC,EAAK,CACrC,OAAOA,EAAI,eAAeD,CAAC,CAC7B,CAEO,SAASE,GAAeF,EAAGG,EAAG,CACnCA,EAAE,YAAcH,CAClB,CAEO,SAASI,GAAcC,EAAIC,EAAML,EAAK,CAC3C,OAAII,GAAM,KACDJ,EAAI,gBAAgBI,EAAIC,CAAI,EAE5BL,EAAI,cAAcK,CAAI,CAEjC,CAEO,SAASC,GAAcrB,EAAGM,EAAGM,EAAG,CACrC,IAAIK,EAAIL,EAAE,WAAW,KAAKZ,CAAC,GAAK,KAC5BiB,IAAMX,GACRM,EAAE,aAAaN,EAAGW,CAAC,CAEvB,CAEO,SAASK,GAAYhB,EAAGM,EAAG,CAC5BA,GAAKN,EAAE,aAAeM,GACxBA,EAAE,YAAYN,CAAC,CAEnB,CAEO,SAASiB,GAAWjB,EAAG,CAC5B,OAAOA,EAAE,UACX,CAEO,SAASkB,GAAaL,EAAIM,EAAMC,EAAKC,EAAI,CAC1CR,GAAM,KACRQ,EAAG,eAAeR,EAAIM,EAAMC,CAAG,EAE/BC,EAAG,aAAaF,EAAMC,CAAG,CAE7B,CAEO,SAASE,GAAgBT,EAAIM,EAAME,EAAI,CACxCR,GAAM,KACRQ,EAAG,kBAAkBR,EAAIM,CAAI,EAE7BE,EAAG,gBAAgBF,CAAI,CAE3B,CAEO,SAASI,GAAaV,EAAIM,EAAME,EAAI,CACzC,OAAIR,GAAM,KACDQ,EAAG,eAAeR,EAAIM,CAAI,EAE1BE,EAAG,aAAaF,CAAI,CAE/B,CAEO,SAASK,GAAiBC,EAAIC,EAAUL,EAAI,CACjDA,EAAG,iBAAiBI,EAAIC,EAAU,EAAK,CACzC,CAEO,SAASC,GAAoBF,EAAIC,EAAUL,EAAI,CACpDA,EAAG,oBAAoBI,EAAIC,EAAU,EAAK,CAC5C,CAEO,IAAIE,GAAc,OCzGzB,IAAAC,GAAAC,GAHAC,GAAAC,EANAC,GAAAC,GAHAC,GAAAC,GClDA,IAAIC,GAAU,SAAUC,EAAM,CAC5B,OAAO,SAAUC,EAAS,CACxB,OAAOA,EAAQD,CAAI,CACrB,CACF,EAEaE,GAAgBH,GAAQ,cAAc,EACtCI,GAAUJ,GAAQ,QAAQ,EAC1BK,GAAYL,GAAQ,WAAW,EAC/BM,GAAUN,GAAQ,SAAS,EA8DjC,SAASO,GAAaC,EAAM,CACjC,OAAO,SAAUC,EAAO,CACtB,OAAO,SAAUC,EAAS,CACxB,OAAO,UAAY,CACjBA,EAAQ,aAAaF,EAAMC,CAAK,CAClC,CACF,CACF,CACF,CC/EA,IAAIE,GAAa,SAAUC,EAAM,CAC/B,OAAO,SAAUC,EAAM,CACrB,OAAO,UAAY,CACjB,OAAOA,EAAKD,CAAI,CAClB,CACF,CACF,EAEaE,GAAWH,GAAW,UAAU,EAChCI,GAAqBJ,GAAW,mBAAmB,EACnDK,GAAoBL,GAAW,kBAAkB,EACjDM,GAAoBN,GAAW,mBAAmB,EAExD,SAASO,GAAeC,EAAU,CACvC,OAAO,SAAUN,EAAM,CACrB,OAAO,UAAY,CACjB,OAAOA,EAAK,cAAcM,CAAQ,CACpC,CACF,CACF,cC8BA,IAAAC,GAAA,SAAAC,EAAA,CACmB,IAAAC,EAAAC,GAAAC,EAAA,EAAAC,EAAAC,GAA+BL,CAAA,SAA/B,SAAAM,EAAA,QAAAL,EAAgBG,EAAhBE,CAAA,CAAA,IC4BnB,IAAAC,GAAAC,mNC+NA,IAAAC,GACa,SAAAC,EAAA,+EAhBC,SAAAC,EAAAC,EAAA,CAGV,GADGA,aAAAC,GACK,OAAAC,GAAA,GAAA,EACuBH,EAAAI,GAF5BH,EAAA,MAAA,CAAA,EAGH,GAHGA,aAAAI,GAAA,UADmBL,EAAA,OACnBC,EAAA,MAAA,EAMCK,EAAAC,GAAoB,SAAAR,EAAA,CAAE,OAAAS,GAAA,IAAAC,GAAAV,EAAA,OACJ,OARAC,EAAA,aAQiBU,WAAkBZ,EAAA,CAAA,IAD9CY,CAAA,SAEJJ,EAEY,OAAAR,GAAWE,CAAA,EAXRA,EAAA,MAYGC,CAAA,KAd7BU,GAAAR,GAAA,GAAA,EAhMAS,GACW,SAAAb,EAAA,mCAE8Bc,CAAA,0DAnB7B,SAAAb,EAAAC,EAAA,CAGR,GADGA,aAAAC,GACK,OAAAY,GAAA,EAAA,EACqBd,EAAAI,GAF1BH,EAAA,MAAA,CAAA,EAGH,GAHGA,aAAAc,GAAA,CAGE,GAJ8Bf,EAAA,QAChCC,EAAA,wBADgCD,EAAA,KAMHA,EAAAc,GAAA,EAAA,EAAgBF,EAAA,CAAA,EAF3C,GAAAI,GAAA,CAIK,IAAAC,EAAY,OARajB,EAAA,WAAAA,EAAA,WAChCC,EAAA,kBAAAA,EAAA,OADgCD,EAAA,IAAA,YAAAA,EAAA,KAUHiB,EAAAH,GAAA,EAAA,EAAoBF,EAAA,CAAA,GAEjC,OAAAA,GAASZ,CAAA,EAZOA,EAAA,MAaVC,CAAA,KAf7BiB,GAAAJ,GAAA,EAAA,EA6LAK,GACY,SAAApB,EAAA,mCAE6Bc,CAAA,gBACA,SAAAO,EAAAC,EAAA,WAA6CA,CAAA,iBA7FtFC,GACW,SAAAvB,EAAA,mCAE8Bc,CAAA,iCA8HzCU,GACa,SAAAC,EAAAzB,EAAA0B,EAAAL,EAAA,aACX,OAAAM,EACYF,aAAAG,GAAKF,aAAAE,GAALH,EAAA,SAAKC,EAAA,QAALD,aAAAI,GAAKH,aAAAG,EAIV,2DAtLG,SAAA5B,EAAAC,EAAA,CAGR,GADGA,aAAAC,GACK,OAAA2B,GAAA,GAAA,EACqB7B,EAAAI,GAF1BH,EAAA,MAAA,CAAA,EAGH,GAHGA,aAAA6B,IAGgCP,GAJ6BvB,EAAA,GAAAA,EAAA,KAC7DC,EAAA,OAAAA,EAAA,MAAA,EAAA,CAHP,IAAAF,EAAAgC,GAGO9B,EAAA,MAAA,EAHPmB,EAAAW,GAEoE/B,EAAA,QAAA,EAM5D,GARRoB,IAAA,GAAArB,IAAA,EAAA,UAEoEC,EAAA,MAC7DC,EAAA,MAAA,EAQKgB,EACE,OAVsDjB,EAAA,WAAAA,EAAA,WAY7CgC,KAXhB/B,EAAA,YAAAA,EAAA,gBAD6DD,EAAA,2BAAAA,EAAA,KAiBhCiB,EAAAY,GAAA,GAAA,EAAoBP,EAAA,CAAA,EAO5C,IAAAW,EAAS,SAAAC,EAAAb,EAAA,WAA6CA,CAAA,GAJtDc,EAAU,SAAAC,EAAAf,EAAAa,EAAA,UACoBb,EAAEa,CAAA,YACME,EAAAC,GAAY3B,CAAA,EAtBMV,EAAA,IAAA,EAuBjDU,GAEP4B,EAAS,SAAAF,EAAAF,EAAA,OAzB+ClC,EAAA,MA0BzBkC,CAAA,YACOE,EAAAC,GAAY3B,CAAA,EA3BMV,EAAA,IAAA,EA4BjDU,QA5BiDV,EAAA,SAC7DC,EAAA,OA4ByDkC,EAAQF,EAAOK,CAAA,OA7BXtC,EAAA,MAC7DC,EAAA,MAAA,EA+BKgB,EACE,OAjCsDjB,EAAA,WAAAA,EAAA,WAmC7CgC,KAlChB/B,EAAA,YAAAA,EAAA,gBAqCmBsC,oBAtC0CvC,EAAA,KAwChCiB,EAAAY,GAAA,GAAA,EAAoBP,EAAA,CAAA,EAEjC,OAAAA,GAAStB,CAAA,EA1CoCA,EAAA,MA2CvCC,CAAA,KA7C7BuC,GAAAX,GAAA,GAAA,0DAwFa,SAAA7B,EAAAC,EAAA,CAGT,GADGA,aAAAC,GACK,OAAAuC,GAAA,GAAA,EACsBzC,EAAAI,GAF3BH,EAAA,MAAA,CAAA,EAGH,GAHGA,aAAAyC,IAGiCnB,GAJ0CvB,EAAA,GAAAA,EAAA,KAC3EC,EAAA,OAAAA,EAAA,MAAA,EAAA,CAHP,IAAAF,EAAAgC,GAGO9B,EAAA,MAAA,EAKC,GAN0ED,EAAA,SAAA,GAFlFD,IAAA,EAAA,UAEkFC,EAAA,MAC3EC,EAAA,MAAA,EAQKgB,EACE,OAVoEjB,EAAA,WAAAA,EAAA,WAY3DgC,KAXhB/B,EAAA,YAAAA,EAAA,gBAD2ED,EAAA,gBAgB1D,oBAhB0DA,EAAA,KAkB9CiB,EAAAwB,GAAA,GAAA,EAAqBtB,EAAA,CAAA,EAO7C,IAAAc,EAAS,SAAAC,EAAAb,EAAA,WAA6CA,CAAA,GAJtDc,EAAU,SAAAD,EAAAS,EAAAtB,EAAAuB,EAAA,UACoBvB,EAAAuB,EAAA,MAAA,YACQD,EAAAN,GAAa3B,CAAA,EAvBmBV,EAAA,IAAA,EAwB/DU,GAEP4B,EAAS,SAAAJ,EAAAE,EAAAQ,EAAA,OA1B6D5C,EAAA,MAAA4C,EAAA,MAAA,YA4BhCR,EAAAC,GAAY3B,CAAA,EA5BoBV,EAAA,IAAA,EA6B/DU,QA7B+DV,EAAA,SAC3EC,EAAA,OAAA4C,GA6BmEV,EAAQF,EAAOK,CAAA,OA9BPtC,EAAA,MAC3EC,EAAA,MAAA,EAgCKgB,EACE,OAlCoEjB,EAAA,WAAAA,EAAA,WAoC3DgC,KAnChB/B,EAAA,YAAAA,EAAA,gBAsCmBsC,SAzC1BxC,oBAEkFC,EAAA,KA0C9CiB,EAAAwB,GAAA,GAAA,EAAqBtB,EAAA,CAAA,EAElC,OAAAA,GAAUnB,CAAA,EA5CiDA,EAAA,MA6CrDC,CAAA,KA/C7B6C,GAAAL,GAAA,GAAA,EA6DAM,GACc,SAAAhD,EAAAiD,EAAAC,EAAA,wBAC8CA,CAAA,EAExD3C,EAAAC,GAAoB,SAAAa,EAAA,CAAE,OAAAZ,GAAA,IAAAC,GAAAW,EAAA,OACJ,OAAE4B,SAAetC,GAAMC,GAAYb,EAAA,CAAA,IAD9CY,CAAA,SAEJJ,GArNP4C,GACY,SAAAnD,EAAAiD,EAAA3B,EAAA,UACkCA,EAAAtB,EAAA,QAAA,EACxCC,EAAQ,OAAEgD,OAAOG,QAAa9B,oBACb8B,EAAKnD,EAAMkB,GAAUN,EAAA,CAAA,GAuH5CwC,GACa,SAAArD,EAAAiD,EAAAxB,EAAA6B,EAAAC,EAAAC,EAAA,aAC0C/B,CAAA,EAAK6B,EAAAtD,EAAA,QAAA,EAExDoD,EAAAK,GAAyBC,CAAA,EACzBC,EAAU,SAAAtC,EAAAgB,EAAAF,EAAA,OACec,EAAAd,EAAA,MAAA,YACaE,EAAAC,GAAY3B,CAAA,EAAKyC,CAAA,EAChDzC,QACsC6C,EAAAV,GAAQa,CAAA,sBACRD,CAAA,EAAIH,CAAA,EAEjDtD,EACE,OAAEgD,OACAG,QACAQ,KACInC,OACE6B,WACNO,YACqBL,CAAA,oBAENJ,EAAKnD,EAAM8C,GAAW3B,EAAA,CAAA,GA3G7C0C,GACY,SAAA9D,EAAAiD,EAAAxB,EAAA6B,EAAAC,EAAAC,EAAA,aAC2C/B,CAAA,EAAK6B,EAAAtD,EAAA,QAAA,EAExDoD,EAAAK,GAAyBC,CAAA,EACzBC,EAAU,SAAAtB,EAAA0B,EAAA,OACed,EAAMc,CAAA,YACO1B,EAAAC,GAAY3B,CAAA,EAAKyC,CAAA,EAChDzC,QAC6B6C,EAAIG,CAAA,sBACKD,CAAA,EAAIH,CAAA,EAEjDtD,EACE,OAAEgD,OACAG,QACAQ,KACInC,OACE6B,WACNO,oBAEeT,EAAKnD,EAAMwC,GAAUlB,EAAA,CAAA,GAzE5CyC,GAAA,SAAAC,EAAA,uDAGU,SAAAjE,EAAA,CACN,GAAAA,aAAAgB,GAAK,OAAqBmC,GAAUc,EAAAC,EAAA,EAAA,EAAAlE,EAAA,MAAA,EACpC,GAAAA,aAAA+B,GAAK,OAA6B+B,GAAUG,EAAAC,EAAA,EAAA,EAAAlE,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAAAA,EAAA,MAAA,EAC5C,GAAAA,aAAA2C,GAAM,OAA6BU,GAAWY,EAAAC,EAAA,EAAA,EAAAlE,EAAA,OAAAA,EAAA,OAAAA,EAAA,OAAAA,EAAA,MAAA,EAC9C,GAAAA,aAAAM,GAAO,OAAqB0C,GAAYiB,EAAAC,EAAA,EAAA,EAAAlE,EAAA,MAAA,EACxC,GAAAA,aAAAG,GAAQ,OAAA+D,EAAA,EAAA,EAAA7D,GAAAL,EAAA,MAAA,CAAA,kIALViD,EAAAiB,EAAA,EAAA,SAFejB,GCvDV,SAASkB,GAAcC,EAAI,CAChC,OAAO,UAAY,CACjB,OAAO,SAAUC,EAAO,CACtB,OAAOD,EAAGC,CAAK,EAAE,CACnB,CACF,CACF,kNCsCA,IAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAXAC,GAAA,UAAA,2JAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,+EA8JAC,GAAAC,GAHAC,GAAAC,GAMAC,GACiB,SAAAC,EAAAC,EAAA,eACyBD,EAAIC,CAAA,EAAO,GAAAC,iBACDF,EAAIC,CAAA,EAHxD,IAAAE,EAAAC,GAAAR,GAIkDI,EAAIC,CAAA,CAAA,EAChD,OALNE,IAAA,YAKoDH,EAAI,GAAGC,CAAA,EACrCD,IAAA,aACiCA,EAAI,EAAEC,CAAA,EADvCD,IAAA,aAEiCA,EAAI,EAAEC,CAAA,EACrDH,GAAuCE,EAAAK,GAAqBJ,CAAA,GAvBpEK,GACe,SAAAJ,EAAA,CACb,GAAAA,aAAAX,IAAAW,EAAA,kBAAAK,EAAiB,MAAwB,SAAAL,EAAA,OAAA,QAAiB,IAAAA,EAAA,SAC1D,GAAAA,aAAAX,GAAU,MAAW,SAAAW,EAAA,OACrB,GAAAA,aAAAV,GAAS,MAAS,QAAAU,EAAA,OAClB,GAAAA,aAAAT,GAAS,MAAsB,WAAAS,EAAA,OAC/B,GAAAA,aAAAR,GAAI,MAAI,2IApIVc,GAAAC,EAMA,IAAAC,GAAAC,EAHAC,GAAAD,EAYA,IAAAE,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAkGE,IAAAC,EAAA,SAAAC,EAAA,QAAwB,SAAA,EAAAC,EAAA,CAEpB,GADGA,aAAAC,GACO,OAAAC,GAAAC,GADPH,EAAA,MAAA,EAAAA,EAAA,OAE0DH,CAAA,EAC7D,GAHGG,aAAAI,GAGM,OACUC,GAJhBL,EAAA,OAIoCH,CAAA,EACvC,GALGG,aAAAM,GAAA,CAOC,IAAAC,EAAAC,GAPDR,EAAA,OAO0CD,CAAA,YAP1CC,EAAA,OAAAS,GAQiDF,CAAA,EAASV,CAAA,EAC7D,GATGG,aAAAU,GASC,OAAA,qHATDV,EAAA,YAAA,IAAA,CAAA,IA7DPW,EAAS,SAAAC,EAAA,CACP,OAAAA,aAAAC,EAASjB,EAAAgB,EAAA,MAAA,EAAA,EACT,QARFE,EAAW,SAAAC,EAAA,CAhCb,IAAA,EAAAC,GAiCuB,KAAA,EAAMD,EAAA,KAAA,EACvB,OAlCN,aAAAF,GAAA,EAAA,kBAAAH,GAmCyBC,EAnCzB,EAAA,OAAA,OAAA,IAAAM,GAmC4CpB,CAAA,CAAA,CAAA,EACtC,QA+BJqB,EAAW,SAAAnB,EAAAoB,EAAA,QAA8B,SAAAP,EAAAZ,EAAAoB,EAAAC,EAAA,CAErC,GADGD,aAAAnB,IAAIoB,aAAApB,GAAA,OAAJmB,EAAA,SAAIC,EAAA,OAEL,OAAAC,SAFKD,EAAA,MAAA,EAAAA,EAAA,OAAAA,EAAA,OAK8DxB,CAAA,EAC1DwB,EACX,GAPGD,aAAAhB,IAAIiB,aAAAjB,GAAA,CApEb,IAAAmB,GAAAC,GAoESJ,EAAA,OAAIC,EAAA,MAAA,EASH,GA7EVE,GA6EgB,OACCF,EACP,GAXGA,EAAA,SAAA,QAAA,CAYG,IAAAI,GAAkBC,GAAkB,QAAQ7B,CAAA,QACxB4B,GAbvBJ,EAAA,MAAA,EAaD,OAAAM,IAGqBC,GAhBpBP,EAAA,OAAAA,EAAA,OAgB2CxB,CAAA,EACnCwB,EAEQ,OAAAO,GAnBhBP,EAAA,OAAAA,EAAA,OAmBuCxB,CAAA,EACnCwB,EACX,GArBGD,aAAAd,IAAIe,aAAAf,GAAA,CAuBH,IAAAC,GAAAC,GAvBGa,EAAA,OAuBsCtB,CAAA,YAvBtCsB,EAAA,MAAA,EAAAQ,GAwBYtB,EAAA,CAAA,EAAA,KAxBZc,EAAA,OAyB+Bd,GAAQY,CAAA,EACvCE,EACP,OACOA,IAtDXS,EAAA,SAAAX,EAAA,QAAmB,SAAA,EAAAnB,EAAAqB,EAAA,CAEf,GADGA,aAAApB,gBAAAoB,EAAA,MAAA,EAAAA,EAAA,OAAAA,EAAA,OAE2DxB,CAAA,EACvDwB,EACP,GAJGA,aAAAjB,GAKgB,OAAAwB,GALhBP,EAAA,OAAAA,EAAA,OAKqCxB,CAAA,EACjCwB,EACP,GAPGA,aAAAf,GAAA,CA3CT,IAAAyB,EAAAC,GA2CSX,EAAA,OAQmCF,CAAA,EAClC,GAAAc,GATDZ,EAAA,OAS0CF,CAAA,YAT1CE,EAAA,MAAA,EAAAQ,GA3CTE,CAAA,CAAA,EAAA,EAsDiBV,WAXRA,EAAA,MAAA,EAAA,OAcgC,SAAAa,GAAA,QAC3B,UAAA,WAAcC,CAAA,EAAA,SACGxB,EAAQyB,GAAGF,EAAA,CAAA,iBAhBjCb,EAAA,OAAA,IAAAgB,GAiB8CC,EAASH,CAAA,EAAKhB,CAAA,KAjB5DE,EAAA,OAkB6CiB,EAASzC,CAAA,EAC9CwB,EACX,GApBGA,aAAAX,GAqBgB,OAAAC,EArBhBU,EAAA,OAAA,IAAAkB,GAqBmC1C,CAAA,CAAA,CAAA,EAC/BwB,gHAtBJA,EAAA,YAAA,IAAA,CAAA,+DA1BK,SAAAN,EAAAyB,EAAA,YAKRC,EAAS3C,EAF4BiB,EAAA,MAAA,EACrC2B,EAAoBxB,EADiBH,EAAA,OACGI,CAAA,EAExCwB,EAASb,EAAUX,CAAA,OAHkBJ,EAAA,MAIayB,EAAII,GAAaF,EAAQD,EAAOE,CAAA,EAElFE,GACE,WAA4B1B,CAAA,QAC1B2B,2BAEoBD,GAAAE,EAAA,GAAA,EAAoBjC,CAAA,CAAA,KAbhDkC,EAAAD,EAAA,EAAA,EAVAE,EAAa,SAAAC,EAAA,iBAEgCA,EAAIN,GAAcd,EAAUX,CAAA,CAAA,EAErEJ,EACE,WAA4BI,CAAA,QACnBgC,2BAEapC,EAAMiC,EAAUlC,CAAA,CAAA,UAV1BmC,ICzBpB,IAAAG,GAAA,SAAAC,EAAA,QAAAA,GAcAC,GACS,SAAAC,EAAA,QAAAH,GAAAI,GAAA,OAAAD,CAAA,CAAA,GAiDPE,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,aA9CFC,EACO,SAAAC,EAAA,QAAAR,GAAAS,GAAA,OAAAD,CAAA,CAAA,GAuCPE,GAAA,SAAAC,EAAA,eACQ,SAAAC,EAAA,QAAMD,EAAM,SAAAE,EAAA,CAClB,GAAAA,aAAAC,GAAQ,OAAA,IAAAC,EAAAF,EAAA,MAAA,EACR,GAAAA,aAAAG,GAAQ,OAAAC,EAAA,uIAFFL,CAAA,CAAA,KAZRM,GAAA,SAAAC,EAAA,OACyCd,GAAAc,CAAA,SADzC,SAAAN,EAAA,CACuB,IAAAO,EAAAC,GAAA,OAAvBR,CAAA,SAAuB,SAAAS,EAAA,QAAAF,EAAAG,EAAAD,CAAA,CAAA,KAkBvB,IAAAE,GAAA,iBAGA,IAAAC,GAAA,iBAwBAC,GAAA,aACgB,SAAAC,EAAA,cAAAA,CAAA,CAAA,IAbhB,IAAAC,GAAA,aACgB,SAAAC,EAAA,cAAAA,CAAA,CAAA,IAPhBC,GAAA,iBA8BAC,GAAA,aACgB,SAAAC,EAAA,cAAAA,CAAA,CAAA,IAnDhBC,GAAA,UAAA,qBAjCAC,GAAA,SAAAC,EAAA,QAEO,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,eAAkCH,EAAGC,EAAKC,EAAMC,CAAA,MA2BvD,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACK,OAAAC,GAAA,OAALF,CAAA,EAAAC,CAAA,kBChFA,IAAAE,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,qHAsGAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,eAC6BD,EAAkBC,CAAA,IA9F/CC,GAAA,UAAA,qBA8DAC,GAAA,SAAAC,EAAA,mBAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAUE,GAD2CD,aAAAZ,GACtC,OAAA,IAAAc,GAAA,IAAAC,GAAiB,QADqBH,EAAA,MAAA,QACLC,GAAQJ,CAAA,EAAQC,CAAA,EACtD,GAF2CE,aAAAX,GAEtC,OAAA,IAAAa,GAAA,IAAAC,GAAiB,MAAQJ,EAFaC,EAAA,MAAA,QAENC,GAAQJ,CAAA,EAAQC,CAAA,EACrD,GAH2CE,aAAAV,GAGxC,OAAOK,GAAAC,CAAA,EAAOC,CAAA,EAAAO,GAH0BJ,EAAA,MAAA,EAGPF,CAAA,CAAA,EAAUC,CAAA,EAHHC,EAAA,MAAA,EAGyBC,EAAQ,EAAR,CAAA,oHAHzBD,EAAA,YAAA,IAAA,CAAA,QAtC7CK,GAAA,SAAAT,EAAA,6BAAA,SAAAC,EAAA,QAAA,SAAAS,EAAA,QAAA,SAAAC,EAAA,CASI,GADGV,aAAAW,gBACSD,CAAA,EACZ,GAFGV,aAAAM,GAAA,CAGG,IAAAM,EAAAC,EAHHb,EAAA,OAAA,IAAA,EAGqBU,CAAA,IAHrBV,EAAA,OAAA,QAIgB,EAAd,GAAAc,EAEC,OANHd,EAAA,kBAAAW,SAQUC,CAAA,EACFJ,GAAAT,CAAA,EATRC,EAAA,MAAA,EASmBS,CAAA,EAAKG,CAAA,EAGnB,GADGH,aAAAE,gBACSC,CAAA,EACZ,GAFGH,aAAAH,GAEE,OAAA,IAAAS,EAAA,IAAAV,GAAA,IAAAC,GAEK,MAAsBM,QAfrCZ,EAAA,OAAA,MAe4D,EAAV,GAflDA,EAAA,MAAA,EAAA,IAAAgB,GAWQP,EAAA,OAAAA,EAAA,MAAA,CAAA,CAAA,kHAAAA,EAAA,YAAA,IAAA,CAAA,iHAXRT,EAAA,YAAA,IAAA,CAAA,MA6DPiB,GAAA,KAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QACYzB,GAAA,IAAAH,GAAW2B,CAAA,CAAA,EAAGC,CAAA,KA7F1BC,GAAA,SAAArB,EAAA,OAaqBS,GAAAT,CAAA,WAQLD,GAAAC,CAAA,SArBhB,SAAAG,EAAA,QAAA,SAAAmB,EAAA,CAUE,IAAAC,EAAA,SAAAC,EAAA,0BAGI,GAFJ,EAAA,OAAA,kBAAAhC,GAAA,CAXF,IAAAiC,EAAAC,EAWE,EAAA,MAAA,EAAA,EAAA,OAAA,MAAA,EAAAC,EAAA,EAAA,OAAA,OAAA,MAAA,CAAA,EAGM,GAdRF,aAAAG,EAca,OAAAC,EAAA,GAdbJ,EAAA,OAeQ,GAfRA,aAAAT,EAAA,CAecQ,EAfdC,EAAA,OAec,uHAfdA,EAAA,YAAA,IAAA,CAAA,EAgBM,GALJ,EAAA,OAAA,kBAAAhC,GAAA,CAXF,IAAAgC,EAAAC,EAWE,EAAA,MAAA,EAAA,EAAA,OAAA,MAAA,EAKwCvB,EALxC,EAAA,OAAA,OAAA,MAAA,CAAA,EAMM,GAjBRsB,aAAAG,EAiBa,OAAAC,EAAA,GAjBbJ,EAAA,OAkBQ,GAlBRA,aAAAT,EAAA,CAkBcQ,EAlBdC,EAAA,OAkBc,uHAlBdA,EAAA,YAAA,IAAA,CAAA,EAmBM,GARJ,EAAA,OAAA,kBAAA/B,GAAA,CASU,IAAAoC,EAAA,IAAAb,GATV,EAAA,OAAA,OAAA,OAAA,EAAA,OAAA,MAAA,MAAA,EAAA,MAAA,EAU4Ba,CAAA,EAAS3B,CAAA,EAVrC,EAAA,OAAA,OAAA,MAAA,EAU2C,CAAA,wHAV3C,EAAA,OAAA,OAAA,YAAA,IAAA,CAAA,mCATYoB,EAAA,IAAAjB,GAAAM,GAAA,MAAAmB,GAA6CT,CAAA,CAAA,CAAA,KAqE3DU,GAAA,SAAAhC,EAAA,QACgBqB,GAAArB,CAAA,EAAAiC,EAAA,GAuBhBC,GAAA,OAAA,SAAAtC,EAAA,QAAA,SAAAC,EAAA,QACiBF,GAAKC,CAAA,EAAIC,CAAA,aAD1B,UAAA,aAGAsC,GAAA,UAAA,OAAA,uBAAA,UAAA,mBArBgBd,GAAAc,EAAA,EADhBC,GAAA,SAAAjB,EAAA,WAC4B,SAAAkB,EAAA,QAAMvC,GAANqB,EAAAkB,CAAA,CAAA,KChF5B,IAAAC,GAAA,UAAA,qHA4CA,IAAAC,GAAA,SAAAC,EAAA,0BACQ,GAARC,EAAA,kBAAAC,IAAAD,EAAA,kBAAAC,uBACQ,GADRD,EAAA,kBAAAC,GAAA,CACqBF,EAAA,IAAAG,GAAAC,GADrBH,EAAA,MAAA,EAAAC,GAAA,KAAA,EACqB,OACb,GAFRD,EAAA,kBAAAI,GAEuB,OAAAC,EAAA,GAAA,IAAAC,EAAA,IAAAC,GAFvBP,EAAA,OAAA,OAAA,IAAAE,GAAAF,EAAA,OAAA,OAAAA,EAAA,MAAA,CAAA,CAAA,sGAAAA,EAAA,YAAA,IAAA,CAAA,4BATAQ,GAAA,SAAAR,EAAA,QAAA,SAAAS,EAAA,CACM,OAAA,IAAAP,GAANF,EAAA,OAAA,IAAAI,GAAAK,EAAAT,EAAA,MAAA,CAAA,IA1BA,IAAAU,GAAA,SAAAC,EAAA,CACM,OAANA,EAAA,kBAAAC,IAAAD,EAAA,kBAAAC,IAPA,IAAAC,GAAA,UAAA,qCCEA,IAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,qHA+DA,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACK,GAALD,aAAAE,GAAY,OAAZD,EACK,GADLA,aAAAC,UAAAF,EAEM,GAFNA,aAAAG,GAEc,OAAA,IAAAA,GAFdH,EAAA,OAAAI,GAAAJ,EAAA,MAAA,EAAAC,CAAA,CAAA,uGAAAD,EAAA,YAAA,KAAAC,EAAA,YAAA,IAAA,CAAA,IAOAI,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAQE,IAAAC,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,sCACM,GAANC,aAAAC,eAAAb,EACM,GADNY,aAAAE,GAAA,CACmBC,EADnBhB,EACmBiB,EADnBjB,EAAAC,CAAA,EAAAY,EAAA,MAAA,EACmBD,EADnBC,EAAA,OACmB,4GADnBb,EAAA,YAAA,KAAAC,EAAA,YAAA,KAAAY,EAAA,YAAA,IAAA,CAAA,kCANAK,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,gCAHF,IAAApB,EAAAqB,GAI2BC,CAAA,EACT,GALlBtB,aAAAuB,cAK6Bd,EAAO,SAAAe,EAAA,QAAA,SAAAC,EAAA,QAAQA,EAAED,CAAA,KAAGjB,CAAA,EAAEmB,CAAA,EACjC,GANlB1B,aAAA2B,EAAA,CAMwBC,EANxB5B,EAAA,OAAA,OAMwBoB,EAAA,IAAAL,GAAkCT,EAN1DN,EAAA,OAAA,MAAA,EAM+D0B,CAAA,EAAvC,6GANxB1B,EAAA,YAAA,IAAA,CAAA,sCACckB,EAAGV,CAAA,EAAAM,GAAA,KAAA,KAlBjBO,GAAA,SAAArB,EAAA,CACO,GAAPA,aAAAE,kBACQ,GADRF,aAAAG,GACgB,OAAA,IAAAwB,EAAA,IAAAE,GADhB7B,EAAA,OAAA,UAAA,UAAAA,EAAA,MAAA,EACsC,OAAA8B,WAA8BzB,GAAMN,EAAA,EAAAG,GAAA,KAAA,EAD1EF,EAAA,MAAA,0GAAAA,EAAA,YAAA,IAAA,CAAA,GAlDA,IAAA+B,GAAA,UAAA,oBAoBAC,GACSC,GAsET,IAAAC,GAAA,QACWC,IApDX,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QACaC,GAAOF,CAAA,EAAA,IAAAG,GAAaF,EAAAG,EAAA,CAAA,+NCrDjC,IAAAC,GAAA,UAAA,qHAIAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,qHAqLAC,GAAA,SAAAC,EAAA,0BAeE,IAAAC,EAAA,SAAAC,EAAA,CACS,OAATA,GAJAC,EAAA,SAAAD,EAAA,QAAA,SAAAE,EAAA,CACS,OAAA,IAAAR,GAATM,EAAA,OAAAG,GAAAH,EAAA,MAAA,EAAAE,CAAA,CAAA,IAVE,GAFJE,EAAA,kBAAAT,GAAA,CADA,IAAAK,EAAAK,GACAD,EAAA,MAAA,EAIQ,GALRJ,aAAAM,qBACAF,EAAA,OAAA,MAAA,EAMQ,GAPRJ,aAAAO,EAAA,CAOcT,EACsBG,EAAUF,EAR9CC,EAAA,OAAA,MAAA,EACAI,EAAA,OAAA,MAAA,CAAA,EADAJ,EAAA,OAAA,MAAA,EAOc,kHAPdA,EAAA,YAAA,IAAA,CAAA,EASI,GARJI,EAAA,kBAAAR,GAQS,OAAAY,EAAA,GAAA,IAAAZ,GARTQ,EAAA,OAAA,OASc,SAAAK,EAAA,QAAwBR,EATtCG,EAAA,OAAA,OASiDK,CAAA,CAAA,EATjDL,EAAA,MAAA,+GAAAA,EAAA,OAAA,YAAA,IAAA,CAAA,4BAPA,IAAAM,GAAA,SAAAC,EAAA,eACwCA,EAAAC,EAAA,GA1IxC,IAAAC,GAAA,cAAA,UAAA,kBAAA,UAAA,aAfAC,GAAA,KAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,eACY,UAAA,CAAA,IAAAC,EAAAC,EAAAC,EAAA,SAAA,SAAAC,EAAA,QAAAH,EAASF,EAATK,CAAA,CAAA,OAAeJ,CAAA,KAE3BK,GAAA,MAAA,SAAAC,EAAA,QAAA,SAAAP,EAAA,CACQ,OAAA,IAAAQ,GAAND,EAAA,OAAAE,GAAAF,EAAA,MAAA,EAAAP,CAAA,CAAA,WADF,UAAA,gBAMAI,GAAA,MACS,SAAAM,EAAA,QAAAC,GAAAC,GAAA,OAAAF,CAAA,CAAA,UADT,UAAA,wEAGA,uBAAA,UAAA,4BA8CA,IAAAG,GAAA,SAAAC,EAAA,QACUC,GAAA,IAAAC,GAA8BF,EAAI,SAAAG,EAAA,WAAAA,CAAA,MA8B5C,IAAAC,GAAA,SAAAC,EAAA,0FAAA,SAAAC,EAAA,CAGE,IAAAC,EAAA,SAAAC,EAAA,CAHF,IAAAC,EAIcC,GAAOF,CAAA,EACjB,GALJC,aAAAE,GAKW,OAAAC,EAAAC,GAAA,MAAA,EAAAC,EALXL,EAAA,MAAA,CAAA,EAMI,GANJA,aAAAM,GAMS,OAAAH,EAAQ,SAAAI,EAAA,kBANjBP,EAAA,OAMiBO,CAAA,CAAA,IAAgBV,EANjCG,EAAA,MAAA,CAAA,8GAAAA,EAAA,YAAA,IAAA,CAAA,YACsBF,CAAA,IC/HtB,IAAAU,GAAAC,EC3BO,SAASC,GAAkBC,EAAG,CACnC,OAAO,SAAUC,EAAG,CAClB,OAAOD,IAAMC,CACf,CACF,CCMA,IAAAC,GAAAC,gECgKA,IAAAC,GAAA,SAAAC,EAAA,CACa,OAAbA,GATAC,GAAA,SAAAD,EAAA,QAAA,SAAAE,EAAA,CAKW,OAAXF,EAA6B,SAAAG,EAAA,WAA7BD,EAA6BC,CAAA,CAAA,MA7B7B,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACQ,OAARD,EAAAC,CAAA,IAtFA,IAAAC,GAEE,UAAA,UAAuB,CAAA,CAAA,EAAA,QAErB,SAAW,SAAAC,EAAA,QACP,UAAA,WAAY,SAAAC,EAAA,cAAM,CAACD,CAAA,CAAA,IAAIE,CAAA,EAAA,YAEaF,CAAA,CAAA,EAAGE,CAAA,aAC/B,SAAAC,EAAA,cACCD,CAAA,CAAA,EAAAE,GAA0B,SAAAJ,EAAA,QAAMA,EAAEG,CAAA,sBCqGnD,IAAAE,GAAA,SAAAC,EAAA,QAAAA,GAgCAC,GAAA,SAAAD,EAAA,QAAAA,GAzJAE,GAAA,UAAA,+EAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,qHAsCA,IAAAC,GAAA,SAAAC,EAAA,QAAAA,GAiDA,IAAAC,GAAA,SAAAC,EAAA,kBACmCA,EAAA,MAAA,CAAA,GAoCnC,IAAAC,GAAAC,GAgCAC,GAAAD,GAhHA,IAAAE,GAAAC,GAsBAC,GAAA,OACU,SAAAC,EAAA,QAAAC,GAAAC,GAAAC,GAAA,OAAAH,CAAA,CAAA,CAAA,UADV,UAAA,aAlBA,IAAAI,GAAA,SAAAC,EAAA,OAAA,YACe,UAAA,CAAA,IAAAC,EAAAC,GAAAF,CAAA,SAAA,SAAAG,EAAA,QAAAC,GAAAC,GAAAC,GAAA,OAAgCL,EAAhCE,CAAA,CAAA,CAAA,CAAA,aADf,UAAA,cAGA,IAAAI,GAAA,SAAAC,EAAA,kCAAA,SACY,UAAA,CAAA,IAAAC,EAAAC,GAAAF,CAAA,SAAA,SAAAG,EAAA,QAAAC,GAAAC,GAAAC,GAAA,OAAgCL,EAAhCE,CAAA,CAAA,CAAA,CAAA,mBADZ,UAAA,aA6IA,IAAAI,GAAA,SAAAC,EAAA,kBACqCA,EAAAC,EAAA,CAAA,GAzJrCC,GAAAC,GAGA,IAAAC,GAAAC,GADA,IAAAC,GAAAC,GC7EA,IAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,qHAAAC,GAAA,UAAA,sUC4EA,IAAAC,GACgB,SAAAC,EAAAC,EAAA,CAA8B,OAAAC,GAAAF,EAAA,OAAAC,EAAA,MAAA,GAAAC,GAAAF,EAAA,OAAAC,EAAA,MAAA,GAAAD,EAAA,OAAAA,EAAA,OAAAC,EAAA,MAAA,GAJ9C,IAAAE,GAAA,SAAAC,EAAA,CACU,OAAVA,EAAA,OAAAA,EAAA,MAAA,GAcA,IAAAC,GAAA,SAAAC,EAAA,CAqBE,IAAAC,EACY,SAAAC,EAAA,WACcA,EAAA,IAAA,4DAVb,SAAAA,EAAAC,EAAA,OAEEC,GADmBF,EAAA,MACFC,CAAA,EAA9B,GAAAE,sBADgCH,EAAA,IAAA,EAEiBA,EAAAI,EAAA,GAAA,EAAiBL,CAAA,CAAA,WAFlCC,EAAA,KAISF,EAAQO,GAASJ,CAAA,CAAA,CAAA,sBAClBK,CAAA,EAAM,MAAEA,QAAaL,UAAgBF,CAAA,CAAA,KAP/EQ,EAAAH,EAAA,GAAA,EALAI,EAAA,SAAAC,EAAA,QACmB,SAAAC,EAAA,UACoBD,CAAA,EAAOX,EAAQO,GAASK,CAAA,CAAA,CAAA,sBACzBJ,CAAA,EAAM,OAASI,OAAGJ,GAAOC,EAAWR,CAAA,CAAA,WALxDS,6ECuGpBG,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EA6DAC,GAAAC,EAvKAC,GAAAD,EA+EAE,GAAA,SAAAC,EAAA,QAKc,SAAAC,EAAA,CACZ,GAAAA,aAAAC,GAAW,OAAAC,GAAAC,GACCJ,EAAA,YAAA,EAAkBA,EAAA,UAAA,CAAA,EAAAC,EAAA,MAAA,EAC9B,GAAAA,aAAAI,GAAS,OAAAF,GAAAC,GACGJ,EAAA,YAAA,EAAkBA,EAAA,QAAA,CAAA,EAAAC,EAAA,MAAA,EAC9B,GAAAA,aAAAK,GAAQ,OAAAH,GAAAC,GACIJ,EAAA,YAAA,EAAmBA,EAAA,QAAAC,EAAA,MAAA,CAAA,CAAA,EAAAA,EAAA,MAAA,EAC/B,GAAAA,aAAAM,GAAO,OAAAJ,GACLH,EAAA,aAAAC,EAAA,MAAA,CAAA,EAAAA,EAAA,MAAA,EACF,GAAAA,aAAAO,GAAM,OAAAC,GACQ,SAAAC,EAAA,CAAM,IAAAC,EAAAC,GAAAC,GAAAZ,EAAA,OAAA,MAAA,CAAA,EAAoBS,CAAA,CAAA,SAApB,SAAAI,EAAA,QAAAH,EAA2BX,EAAA,YAA3Bc,CAAA,CAAA,iJA6DtBC,GAAAlB,EAvKAmB,GAAAnB,EAkEA,IAAAoB,GAAA,UAAA,OAEE,kHAmEFC,GAAA,UAAA,QAAA,SAAAC,EAAA,oCAAA,SAAAC,EAAA,iCAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAYEC,GACE,OAAmBL,CAAA,EAAMC,CAAA,QACTD,CAAA,EAAMC,CAAA,QACHD,CAAA,EAAMC,CAAA,YACZC,QACJC,SACPC,YCLN,IAAAE,GAAA,UAAA,uBAkRA,IAAAC,GACOC,GAAS,MAAA,EA6EhB,IAAAC,GAAA,SAAAC,EAAA,QACcC,GAAS,OAAA,EAAkBD,CAAA,EAAM,CAAA,CAAA,GAc/C,IAAAE,GACQC,GAAS,OAAA,EAqGjB,IAAAC,GACIC,GAAS,GAAA,EA6Eb,IAAAC,GACOC,GAAS,MAAA,EAmChB,IAAAC,GACQC,GAAS,OAAA,EAKjB,IAAAC,GACQC,GAAS,OAAA,EAEjBC,GACSF,GAAM,CAAA,CAAA,EAEfG,GACKF,GAAS,IAAA,EAEdG,GACMD,GAAG,CAAA,CAAA,EAETE,GAAA,SAAAC,EAAA,QACcL,GAAS,UAAA,EAAqBK,CAAA,EAAG,CAAA,CAAA,GAgC/C,IAAAC,GACKC,GAAS,IAAA,EAEdC,GACMF,GAAG,CAAA,CAAA,EAlaT,IAAAG,GACMC,GAAS,KAAA,EAEfC,GACOF,GAAI,CAAA,CAAA,EA/EX,IAAAG,GACSC,GAAS,QAAA,EAPlB,IAAAC,GAAA,SAAAC,EAAA,QACWC,GAAS,IAAA,EAAeD,CAAA,EAAM,CAAA,CAAA,GAEzCE,GACMH,GAAG,CAAA,CAAA,EA5ET,IAAAI,GACIC,GAAS,GAAA,ECrSN,SAASC,GAAeC,EAAG,CAChC,OAAOA,EAAE,aACX,CAwBO,SAASC,GAAeC,EAAG,CAChC,OAAO,UAAY,CACjB,OAAOA,EAAE,eAAe,CAC1B,CACF,CCOA,IAAAC,GACgB,SAAAC,EAAA,cAAAA,CAAA,CAAA,GCrBhB,IAAAC,GACS,SCnBT,IAAAC,GACQ,iECoQR,IAAAC,GAAAC,EAxKA,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,WAIID,CAAA,EACA,SAAAE,EAAA,sBAAkBD,EAAEC,CAAA,CAAA,MAZxBC,GAAA,SAAAH,EAAA,QAAA,SAAAC,EAAA,WAIID,CAAA,EACA,SAAAE,EAAA,qBAAqBD,EAAEC,CAAA,CAAA,CAAA,MAoE3B,IAAAE,GACU,UAAA,CAAA,IAAAC,EAAAC,GAAAC,EAAA,SAAA,SAAAC,EAAA,QAAAH,EAAsBI,GAAtBD,CAAA,CAAA,MAnBV,IAAAE,GACWC,GAAS,QAAA,EA2IpB,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAIE,IAAAC,EAAA,SAAAC,EAAA,WAAOH,CAAA,EAAAI,GAAoBL,CAAA,CAAA,EAAAM,GAAuBF,CAAA,CAAA,UAFlDG,GAASR,CAAA,EAAAS,GAAAC,EAAA,EAA2B,SAAAC,EAAA,uBAA8B,SAAAC,EAAA,iBAAST,EAATS,CAAA,CAAA,OAA0BR,EAAGO,CAAA,CAAA,CAAA,SAoBjGE,GACYd,GAAAe,EAAA,EAAgC,SAAA,EAAAC,GAAAC,EAAA,CAAA,EAf5C,IAAAC,GACgBC,GAAAC,EAAA,EAAgC,OAAA,EAAAC,EAAA,cC9JhD,IAAAC,GAAA,UAAA,CAGE,IAAAC,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,qBAC2BD,EAAEC,CAAA,CAAA,WAHzB,SAAAC,EAAA,WAAyIH,EAAzIG,CAAA,CAAA,MAlCNC,GAAA,SAAAC,EAAA,kBA2JWD,GAAAE,EAAA,KApELF,GAAAG,EAAA,KArBIH,GAAAI,EAAA,EAqFV,IAAAC,GAAAC,GACiB,UAAA,EA7FjB,IAAAC,GAAAC,GACa,MAAA,EAiDb,IAAAC,GAAAC,GACe,QAAA,EAEfC,GAAAD,GACc,OAAA,EAiBdE,GAAA,SAAAC,EAAA,QACQC,GAAAD,CAAA,EAAM,MAAA,GAEdE,GAAA,SAAAF,EAAA,QACQC,GAAAD,CAAA,EAAM,OAAA,GAnDd,IAAAG,GAAAC,GACa,MAAA,EAJb,IAAAC,GAAAC,GACW,IAAA,EAJXC,GAAAD,GACa,MAAA,EAVb,IAAAE,GAAAC,GACY,SAAA,EA+EZ,IAAAC,GAAAC,GACiB,UAAA,EAnGjB,IAAAC,GACS,UAAA,CAAA,IAAAC,EAAAC,GAAM,WAAA,SAAN,SAAAC,EAAA,QAAAF,EAAAG,GAAAD,CAAA,CAAA,MA6GTE,GAAAC,GACgB,SAAA,EAiBhB,IAAAC,GAAAC,GACkB,WAAA,EAPlBC,GACeC,GAAAC,EAAA,EAAM,cAAA,EApKrB,IAAAC,GAAA,UAAA,uBCjHA,IAAIC,IAAe,OAAO,MAAM,MAAS,WACrCC,GACF,OAAO,OAAW,KAClB,QAAU,MACV,OAAO,OAAO,SAAa,KAC3B,OAAO,OAAO,UAAU,OAAO,QAAQ,GAAM,WAC3CC,GAAmB,OAAO,OAAO,UAAU,eAAkB,WAC7DC,IAAiB,OAAO,OAAO,UAAU,aAAgB,WAkEtD,IAAMC,GAAa,SAAUC,EAAU,CAC5C,OAAOC,GAAmB,OAAO,cAAgBD,CACnD,EAEaE,GAAQ,SAAUF,EAAU,CACvC,OAAO,SAAUG,EAAG,CAClB,OAAIC,GACK,SAAUC,EAAK,CAGpB,QAFIC,EAAQ,GACRC,EAAOF,EAAI,OAAO,QAAQ,EAAE,EACvB,EAAI,EAAG,EAAIF,EAAG,EAAE,EAAG,CAC1B,IAAIK,EAAID,EAAK,KAAK,EAClB,GAAIC,EAAE,KAAM,OAAOF,EACnBA,GAASE,EAAE,KACb,CACA,OAAOF,CACT,EAEKN,EAASG,CAAC,CACnB,CACF,wCCqTA,IAAAM,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,UACqCD,EAAO,MAAP,GAAiB,KAAlB,IAA2BC,EAAQ,MAAR,GAA3B,GAA6C,MAAxD,IAKzB,IAAAC,GAAA,SAAAC,EAAA,OACa,QAAUA,GAAMA,GAAM,OAJnCC,GAAA,SAAAD,EAAA,OACY,QAAUA,GAAMA,GAAM,OA1NlCE,GAAA,SAAAC,EAAA,CAAA,IAAAC,EAAAC,GAC0BF,CAAA,EACxB,GAFFC,IAAA,iBAGE,GAHFA,IAAA,eAGY,YAA2C,CAAA,EAAED,CAAA,CAAA,OAAW,KAI9D,IAAAG,EAAAC,GAAAC,GAA8B,CAAA,EAAEL,CAAA,CAAA,EADhCM,EAAAF,GAAAC,GAA8B,CAAA,EAAEL,CAAA,CAAA,IAG7BF,GAAOQ,CAAA,GAAOV,GAAQO,CAAA,EAAzB,OAAAI,QACY,MAAQC,GAAYF,CAAA,EAAIH,CAAA,UAAmB,CAAA,EAAEH,CAAA,IADzD,IAAAS,EAEY,MAAQH,UAA6B,CAAA,EAAEN,CAAA,KAoNzD,IAAAU,GACe,UAAA,CAAA,IAAAC,EAAAC,GAAAC,EAAA,EAAAC,GAAAC,EAAA,CAAA,EAAAC,GAAAD,EAAA,CAAA,SAAA,SAAAE,EAAA,WAAiBN,EAAjBM,CAAA,CAAA,MA/TfC,GAAA,SAAAC,EAAA,CACmB,GAAnBA,GAAyC,aAAST,GAAlDS,CAAA,EAEM,IAAAC,EAAAC,GAFNF,EAEoB,MAAL,CAAA,EAAgB,IAAA,EAAS,MAA3B,EACPG,EAAAC,GAHNJ,EAGoB,MAAL,CAAA,EAAoB,IAAA,EAAQ,MAA7B,SACZT,GAAaU,CAAA,EAAQV,GAAaY,CAAA,GAbpC,IAAAE,GAAAC,GACuBC,EAAA,EAoPvBC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACa,GAAbD,EAAuB,QAAI,GAD3B,IAAAE,EAEwBC,GADxBF,CAAA,EAEE,OAHFC,aAAAE,EAGyBR,GAHzBM,EAAA,OAAA,IAAA,EAG2CH,GAF3CC,EAE6D,EAAJ,CAAA,EAHzDE,EAAA,OAAA,IAAA,EACAD,IANAI,GAAAC,GACaP,EAAA,EAkCb,IAAAQ,GAAA,SAAA,EAAA,QAAA,SAAAC,EAAA,cAC+BC,GAAK,CAAA,EAAED,CAAA,CAAA,CAAA,EAAIA,CAAA,IC3W1C,IAAIE,GAAa,SAAUC,EAAM,CAC/B,OAAO,SAAUC,EAAK,CACpB,OAAO,UAAY,CACjB,OAAOA,EAAID,CAAI,CACjB,CACF,CACF,EAEaE,GAAMH,GAAW,KAAK,EACtBI,GAAcJ,GAAW,aAAa,EACtCK,GAASL,GAAW,QAAQ,EAC5BM,GAAaN,GAAW,YAAY,EACpCO,GAAeP,GAAW,cAAc,EACxCQ,GAAcR,GAAW,aAAa,EAI5C,IAAMS,GAAmBC,GAAW,iBAAiB,+CCqH5DC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACY,OAAGD,EAAOC,EAAA,MAAA,EAAVC,EAA8B,EAAA,IAE1C,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACY,OAAGD,EAAOC,EAAA,MAAA,EAAY,CAAA,IA3GlCC,GAAA,SAAAC,EAAA,cACiEA,CAAA,CAAA,GA4GjE,IAAAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACgB,OAAGF,EAAOC,EAAA,MAAA,EAAYC,EAAA,MAAA,KAEtCC,GAAA,SAAAH,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACgB,OAAGF,EAAOC,EAAA,MAAA,EAAYC,EAAA,MAAA,KAKtCE,GACkB,UAAA,CAAA,IAAAC,EAAAC,GAAU,EAAA,SAAV,SAAAC,EAAA,QAAAF,EAAAG,GAAAD,CAAA,CAAA,MA/BlBE,GACY,UAAA,CAAA,IAAAC,EAAAJ,GAAU,EAAA,EAAVK,EAAAC,GAAoD,GAAA,EAAc,KAAA,SAAlE,SAAAC,EAAA,QAAAH,EAAAI,GAAwCH,EAAxCE,CAAA,CAAA,CAAA,MApFZ,IAAAE,EACS,SAAAC,EAAA,cAAAA,CAAA,CAAA,GAETC,GAAA,SAAAC,EAAA,WACkBA,CAAA,GAsDlB,IAAAC,GAAA,SAAAC,EAAA,CAKI,IAAAC,EAAS,UAAA,CAAA,IAAAC,EAAAC,GAA6B,GAAA,EAAc,GAAA,SAA3C,SAAAC,EAAA,QAAAC,GAAiBH,EAAjBE,CAAA,CAAA,MACTE,EAAA,SAAAC,EAAA,CANJ,IAAAC,EAAAC,GAOkB,GAAA,EAAaF,CAAA,EACvB,OARRC,EAAA,SAAA,EAQS,IAAAE,EAAA,IAAAC,GAAmBV,EAR5BO,EAAA,CAAA,CAAA,EAAAI,EAAA,KAAA,CAAA,EAAAJ,EAAA,SAAA,EASS,IAAAE,EAAA,IAAAC,GAAsBV,EAT/BO,EAAA,CAAA,CAAA,EAAA,IAAAE,EASgDT,EAThDO,EAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAUQI,EAAA,OARFC,EAAA,UAAA,CAAS,IAAAC,EAAAC,GAAY,CAAA,EAAEf,CAAA,IAAWc,IAAQ,KAAOA,IAAQ,IAA3B,OAAAE,KAA0C,CAAA,EAAEhB,CAAA,EAASA,eAC9EM,CAAA,EAAAW,GAAa,SAAAT,EAAA,YAAM,QAAe,GAAA,EAAcK,CAAA,CAAA,CAAA,GAS3D,IAAAK,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,qBAEyB,SAAAC,EAAA,QAAA,SAAAC,EAAA,YAAMF,MAANC,CAAA,CAAA,IAAkBF,CAAA,CAAA,CAAA,IAzB3CI,GAAAC,GAAAC,EAAA,EAAAC,EAAA,EAHA,IAAAC,GAAAC,GAAAC,EAAA,EAAAC,EAAA,EAQAC,GAEE,UAAA,OAAOC,GAAA,OACOC,CAAA,EAAA,SACPC,GAAkBC,CAAA,oFCjE3BC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAJAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAHAC,GAAA,SAAAC,EAAA,WACW,SAAAC,EAAA,eAAM,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,iBAuDbH,GAAAI,EAAA,KAIUJ,GAAAK,EAAA,EA9CdC,GAAA,SAAAC,EAAA,CAaE,IAAAC,EAAA,SAAAN,EAAA,CAwBI,IAAAO,EAAA,SAAA,EAAA,QACc,SAAAC,EAAA,kBAAe,EAAfA,CAAA,CAAA,cAvBZ,CAAAC,EAAS,eAAA,CAAA,CAAA,EACb,CAAAC,GAAM,CAAAD,EAAS,SAAA,CAAA,CAAA,EAAW,CAAAE,EAAO,kBAAA,CAAA,CAAA,EAAAD,GAC3B,CAAAD,EAAS,uBAAA,CAAA,CAAA,EACb,CAAAG,GAAQ,CAAAC,GAAAC,GAAA,KAAA,EAAAL,EAA+B,aAAA,EAAAM,GAAmB,gBAAA,EAAAC,GAAuB,gBAAA,EAAAC,GAJrFjB,EAAA,GAAA,cAAA,EAAAkB,GAKuDX,EAAAd,GAAA,MAAA,CAAA,CAAA,CAAA,EAAA0B,GAC3C,CAAAC,GAAM,gBAAA,EAAAX,EAAyB,SAAA,CAAA,CAAA,EACrC,CAAAE,EAAO,4CAAA,CAAA,CAAA,CAAA,CAAA,EAAAD,GAEL,CAAAD,EAAS,uBAAA,CAAA,CAAA,EACb,CAAAG,GAAQ,CAAAC,GAAAC,GAAA,KAAA,EAAAL,EAA+B,aAAA,EAAAM,GAAmB,gBAAA,EAAAC,GAAuB,gBAAA,EAAAC,GAVrFjB,EAAA,GAAA,cAAA,EAAAkB,GAWuDX,EAAAb,GAAA,MAAA,CAAA,CAAA,CAAA,EAAAyB,GAC3C,CAAAC,GAAM,gBAAA,EAAAX,EAAyB,SAAA,CAAA,CAAA,EACrC,CAAAE,EAAO,kCAAA,CAAA,CAAA,CAAA,CAAA,EAAAD,GAEL,CAAAD,EAAS,uBAAA,CAAA,CAAA,EACb,CAAAG,GAAQ,CAAAC,GAAAC,GAAA,KAAA,EAAAL,EAA+B,aAAA,EAAAM,GAAmB,aAAA,EAAAC,GAAoB,aAAA,EAAAC,GAhBlFjB,EAAA,GAAA,WAAA,EAAAkB,GAiBoDX,EAAAZ,GAAA,MAAA,CAAA,CAAA,CAAA,EAAAwB,GACxC,CAAAC,GAAM,aAAA,EAAAX,EAAsB,SAAA,CAAA,CAAA,EAClC,CAAAE,EAAO,gCAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,GAxBbU,EAAA,SAAA,EAAA,OACE,IAAM,IA8BRC,EAAA,SAAAtB,EAAA,CACc,GAAdA,aAAAJ,GAAyB,OAAA2B,GAAAC,GAAAC,EAAA,EAAA,UAAA,CAErB,GAFJzB,EAAA,kBAAAP,GAEoB,OAAK,SAAAQ,EAAA,OAAA,0EAFzBD,EAAA,OAAA,SAGI,GAHJA,EAAA,kBAAAN,GAGoB,OAAK,SAAAO,EAAA,OAAA,0EAHzBD,EAAA,OAAA,SAII,GAJJA,EAAA,kBAAAL,GAIiB,OAAK,SAAAM,EAAA,OAAA,6EAJtBD,EAAA,OAAA,0HAAAA,EAAA,OAAA,YAAA,IAAA,CAAA,OACE,UAAA,mBAIA,SAAA0B,EAAA,iBACsCA,CAAA,CAAA,CAAA,MAE1B,GARd1B,aAAAH,GAQsB,OAAA8B,GAAAC,GAAAC,EAAA,CAAA,EACpB,SAAAH,EAAA,iBACsCA,CAAA,CAAA,CAAA,oHAVxC1B,EAAA,YAAA,IAAA,CAAA,aAtCE,gBAAuBqB,EAAQhB,CAAA,CAAA,SAC7BC,UACiB,0GAA+BgB,OCvC/C,IAAMQ,GAAM,SAAUC,EAAG,CAC9B,OAAO,UAAY,CACjB,QAAQ,IAAIA,CAAC,CACf,CACF,EAEaC,GAAO,SAAUD,EAAG,CAC/B,OAAO,UAAY,CACjB,QAAQ,KAAKA,CAAC,CAChB,CACF,oMC0BAE,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAPAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCA2BAC,GAAA,SAAAC,EAAA,WACgB,SAAAC,EAAA,oBAAW,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,gHAwHNH,GAAAI,EAAA,KAoBFJ,GAAAK,EAAA,EAhJnBC,GAAA,SAAAL,EAAA,WACW,SAAAC,EAAA,eAAM,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,qHAsJTG,GAAAF,EAAA,EAjJRG,GAAA,SAAAN,EAAA,WACiB,SAAAC,EAAA,qBAAY,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,+GA0IzBI,GAAAH,EAAA,EAxIJI,GAAA,SAAAC,EAAA,CAkBE,IAAAC,EAAA,SAAAR,EAAA,CAkFG,IAAAS,EAAAC,GAjFHV,EAAA,GAAA,IAAA,EA+EGW,EAAA,SAAAC,EAAA,QACc,SAAAC,EAAA,kBAAeD,EAAfC,CAAA,CAAA,IAtBdC,EAAA,SAAAb,EAAA,WACM,CAAAc,EAAS,OAAA,CAAA,CAAA,EACb,CAAAC,EAAO,sBAAA,EAAAC,GACA,CAAAF,EAAS,sBAAA,EAAAG,GAAAC,GA7DrBnB,EAAA,GAAA,IAAA,EAAAoB,EAAA,EA6DuEX,CAAA,CAAA,CAAA,CAAA,EAChE,CAAAO,EAAAG,GAAc,MAAA,EAAAE,EAAA,EAAQZ,CAAA,CAAA,CAAA,CAAA,EAAAa,GAClB,CAAAP,EAAS,oBAAA,CAAA,CAAA,EACb,CAAAO,GAAM,CAAAP,EAAS,gBAAA,CAAA,CAAA,EACb,CAAAQ,GAAAC,GAAU,CAAAC,GAAAC,GAAA,KAAA,EAAAC,GAA8B,SAAAC,EAAA,eAAiB,EAAA,MAAa,QAAA,CAAA,CAAA,EAAAC,GAjE/E7B,EAAA,SAAA,EAiE+G,CAAA8B,GAAO,QAAA,EAAS,QAAA,CAAA,CAAA,CAAA,CAAA,EAAY,CAAAd,EAAO,QAAA,CAAA,CAAA,EAAAC,GAAAO,GACjI,CAAAT,EAAS,aAAA,CAAA,CAAA,EAAAc,GAAA,CAlE1B7B,EAAA,SAAA,EAkEqE,CAAA8B,GAAO,QAAA,EAAS,QAAA,CAAA,CAAA,CAAA,CAAA,EAC1E,CAAAP,GAAS,CAAAE,GAAAC,GAAA,KAAA,EAAAC,GAA8B,SAAAC,EAAA,eAAiB,EAAA,MAAO,CAAAZ,EAAO,iBAAA,CAAA,CAAA,EAAAO,GAC7D,CAAAE,GAAAC,GAAA,KAAA,EAAAC,GAA8B,SAAAC,EAAA,qBAAuB,KAAA,CAAA,CAAA,EAAQ,CAAAZ,EAAO,SAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,GASrFe,EAAA,SAAA9B,EAAA,WAAwB,CAAAc,EAAS,KAAA,CAAA,CAAA,EAAO,CAAAC,EAAM,0BAAA,CAAA,CAAA,GAH9CgB,EAAA,SAAAC,EAAA,QAAA,SAAAhC,EAAA,WACM,CAAAc,EAAS,iBAAA,CAAA,CAAA,EAAoB,CAAAC,EAAOiB,CAAA,CAAA,CAAA,IAtE1CC,EAAA,SAAAjC,EAAA,WACO,CAAAkC,GAAAzC,GAAA,MAAA,CAAA,CAAA,EACL,CAAA0C,GAAQ,CAAArB,EAAS,OAAA,CAAA,CAAA,EACf,CAAAsB,GACE,CAAAC,GACE,CAAAC,GAAK,CAAAxB,EAAS,IAAA,CAAA,CAAA,EAAO,CAAA,CAAA,EAAAyB,GACf,CAAAC,GAXjBzC,EAAA,GAAA,IAWmC,CAAA,EACdc,CAAA,EAAA2B,GAAAC,GAZrB1C,EAAA,QAAA,CAAA,EAcsBgC,EAAAW,GAA8B,EAAA,EAdpD3C,EAAA,QAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAAsC,GAkBW,CAAAE,GAAM,CAAAI,GAAQ,CAAAC,GAAM,KAAA,CAAA,CAAA,EAAQ,CAAA7B,EAAO,KAAA,CAAA,CAAA,CAAA,CAAA,EAAAwB,GAC7B,CAAAM,GAAQ,CAAAC,GAAAC,GAAA,KAAA,EAAAC,GAAsB,KAAA,EAAAlC,EAAc,WAAA,EAAAmC,GAAuB,EAAA,EAAAC,GAAW,KAAA,EAAAC,GAAAC,GAnB/FrD,EAAA,GAAA,GAAA,CAAA,EAAAsD,GAAAtD,EAAA,QAAA,GAAA,EAAAuD,GAoB+D5C,EAAAxB,GAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAAmD,GAGpD,CAAAE,GAAM,CAAAI,GAAQ,CAAAC,GAAM,OAAA,CAAA,CAAA,EAAU,CAAA7B,EAAO,OAAA,CAAA,CAAA,CAAA,CAAA,EAAAuB,GAChC,CAAAxB,EAAQ,MAAA,CAAA,CAAA,EACR,CAAA+B,GAAQ,CAAAC,GAAAS,GAAA,KAAA,EAAAP,GAAuB,OAAA,EAAAlC,EAAgB,qBAAA,EAAAoC,GAA6B,OAAA,EAAAG,GAzB5FtD,EAAA,QAAA,KAAA,EAAAuD,GAyB6I5C,EAAAvB,GAAA,MAAA,CAAA,CAAA,CAAA,EAAAmC,GACpH,CAAAkC,GA1BzBzD,EAAA,OAAA,EAAAyB,GAAAC,GAAA,KAAA,EAAAC,GA0B2E,SAAAC,EAAA,qBAA4B,4DAAA8B,GA1BvG1D,EAAA,OAAA,EA0BsL,iBAAA,CAAA,CAAA,CAAA,EAAqB,CAAAgB,EAAO,OAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAAsB,GAIvM,CAAAE,GAAM,CAAAI,GAAQ,CAAAC,GAAM,aAAA,CAAA,CAAA,EAAgB,CAAA7B,EAAO,aAAA,CAAA,CAAA,CAAA,CAAA,EAAAwB,GACrC,CAAAmB,GAAW,CAAA5C,EAAS,oBAAA,EAAAkC,GAA0B,aAAA,EAAAE,GAAoB,aAAA,EAAAS,GAAoB,CAAA,EAAAN,GA/BvGtD,EAAA,QAAA,WAAA,EAAAuD,GAgC2E5C,EAAAtB,GAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAAiD,GAGhE,CAAAE,GAAM,CAAAI,GAAQ,CAAAC,GAAM,MAAA,CAAA,CAAA,EAAS,CAAA7B,EAAO,MAAA,CAAA,CAAA,CAAA,CAAA,EAAAwB,GAC9B,CAAAM,GAAQ,CAAAC,GAAAS,GAAA,KAAA,EAAAP,GAAuB,MAAA,EAAAlC,EAAe,WAAA,EAAAoC,GAAmB,MAAA,EAAAU,GAAAC,GAAA,KAAA,EAAAhC,GAA2C,gBAAA,EAAiB,KAAA,EAAAsB,GAAA,CAAAC,GApC9IrD,EAAA,GAAA,GAAA,CAAA,EAAAsD,GAAAtD,EAAA,QAAA,IAAA,EAAAuD,GAqCiE5C,EAAArB,GAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAAgD,GAGtD,CAAAE,GAAM,CAAAI,GAAQ,CAAAC,GAAM,SAAA,CAAA,CAAA,EAAY,CAAA7B,EAAO,SAAA,CAAA,CAAA,CAAA,CAAA,EAAAwB,GACjC,CAAAM,GAAQ,CAAAC,GAAAgB,GAAA,KAAA,EAAAd,GAA2B,SAAA,EAAAlC,EAAkB,iBAAA,EAAAoC,GAAyB,SAAA,EAAAa,GAzC/FhE,EAAA,QAAA,OAAA,EAAAiE,GA0CkEtD,EAAApB,GAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAA+C,GAGvD,CAAAE,GAAM,CAAAI,GAAQ,CAAAC,GAAM,QAAA,CAAA,CAAA,EAAW,CAAA7B,EAAO,YAAA,CAAA,CAAA,CAAA,CAAA,EAAAwB,GAChC,CAAAM,GAAQ,CAAAC,GAAAgB,GAAA,KAAA,EAAAd,GAA2B,QAAA,EAAAlC,EAAiB,gBAAA,EAAAoC,GAAwB,QAAA,EAAAa,GA9C7FhE,EAAA,QAAA,MAAA,EAAAiE,GA+CiEtD,EAAAnB,GAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAA8C,GAGtD,CAAAE,GAAM,CAAA,CAAA,EAAAA,GACA,CAAAM,GAAQ,CAAAC,GAAAmB,GAAA,KAAA,EAAAnD,EAA6B,sEAAA,EAAAuC,GAAA,UAAA,OAnDtDtD,EAAA,GAAA,IAoD8C,EAAZ,OAAAmE,EAAmB,kBAAuB,2CApD5EnE,EAAA,SAAA,EAEIkC,CAAA,EACAH,CAAA,GAbJqC,EAAA,SAAAC,EAAA,OACE,IAAMA,UACKA,YACE,aACA,WACF,sBA4FbC,EAAA,SAAAtE,EAAA,CACc,GAAdA,aAAAL,GAAyB,OAAA4E,GACZ,SAAAtE,EAAA,uFADbD,EAAA,WAGa,GAHbA,aAAAJ,gBAIa,SAAAK,EAAA,qFAAc,QAAzB,UAAA,cACkB,SAAAA,EAAA,qBAAlB,SAAAuE,EAAA,iBACkCA,CAAA,CAAA,CAAA,EAAlC,SAAAC,EAAA,sBAEE,GADGA,aAAAC,EACE,OAAAC,GAAAC,EAAA,EAAuB,SAAA3E,EAAA,OAAA,uKADzBwE,EAAA,UAEH,GAFGA,aAAAI,0HAAAJ,EAAA,YAAA,IAAA,CAAA,MAAL,UAAA,WAGW,SAAAxE,EAAA,qFAAc,eAEb,GAZdD,aAAAH,gBAagB,SAAAI,EAAA,oBAAd,SAAA6E,EAAA,oBAC0BA,CAAA,CAAA,CAAA,CAAA,EAA1B,UAAA,WACW,SAAA7E,EAAA,uFAAgB,WAEf,GAjBdD,aAAAP,GAiByB,OAAAkF,GAAAC,EAAA,EAAA,UAAA,CAErB,GAnBJ5E,EAAA,kBAAAb,GAmBS,OAAK,SAAAc,EAAA,OAAA,yKAnBdD,EAAA,OAAA,SAoBI,GApBJA,EAAA,kBAAAZ,GAoBW,OAAK,SAAAa,EAAA,OAAA,uKApBhBD,EAAA,OAAA,SAqBI,GArBJA,EAAA,kBAAAX,GAqBiB,OAAK,SAAAY,EAAA,OAAA,iKArBtBD,EAAA,OAAA,SAsBI,GAtBJA,EAAA,kBAAAV,GAsBU,OAAK,SAAAW,EAAA,OAAA,wKAtBfD,EAAA,OAAA,SAuBI,GAvBJA,EAAA,kBAAAT,GAuBa,OAAK,SAAAU,EAAA,OAAA,qKAvBlBD,EAAA,OAAA,SAwBI,GAxBJA,EAAA,kBAAAR,GAwBY,OAAK,SAAAS,EAAA,OAAA,sKAxBjBD,EAAA,OAAA,gHAAAA,EAAA,OAAA,YAAA,IAAA,CAAA,MA0Bc,GA1BdA,aAAAN,GA0B0B,OAAAqF,GAAAC,GAAAC,GA1B1BjF,EAAA,MAAA,CAAA,CAAA,EA2BE,UAAA,mBACA,SAAAwE,EAAA,4BACA,UAAA,iBACwBA,CAAA,CAAA,CAAA,EAAa,SAAAvE,EAAA,CACnC,GAAAA,aAAAiF,EAAK,OAAAH,GAAAI,GAAAC,EAAA,EAAA,IAAAV,EAAAW,GAAApF,EAAA,MAAA,CAAA,CAAA,CAAA,EACH,UAAA,+BAEF,GAAAA,aAAAqF,GAAArF,EAAA,OAAA,QAAsC,KAAAA,EAAA,OAAA,OAAW,qBACxCuE,CAAA,CAAA,EAAP,UAAA,mBACA,SAAAe,EAAA,mBACA,SAAAC,EAAA,iBAC6BA,CAAA,CAAA,CAAA,EAA7B,SAAAC,EAAA,mBACA,SAAAC,EAAA,iBAC2BA,CAAA,CAAA,CAAA,EAA3B,SAAAC,EAAA,CAnJR,IAAA/D,EAAAgE,GAoJqCL,CAAA,EAAG,MAAA,EAC9B,OArJV3D,aAAA8C,GAAA9C,EAAA,SAAA,6BAAAA,aAAA8C,GAAA9C,EAAA,SAAA,qBAAA,IAAAiE,EAAAC,GAuJ8BH,CAAA,EAAaF,CAAA,EAC7B,GAxJdI,aAAAnB,EAwJmB,OAAAqB,GAAaN,CAAA,EAAIC,CAAA,EACtB,GAzJdG,aAAAhB,YAyJiCc,CAAA,EAAID,CAAA,yGAzJrCG,EAAA,YAAA,IAAA,CAAA,MA0JUb,GAAAgB,GAAAC,EAAA,EAAAC,EAAA,CAAA,cACJ,GAAAjG,aAAAqF,EAAM,OAAAP,GAAAI,GAAAC,EAAA,EAAA,IAAAV,EAAAzE,EAAA,OAAA,IAAA,CAAA,CAAA,EACJ,UAAA,0QAjDND,EAAA,YAAA,IAAA,CAAA,aAxGE,gBAAuBoE,EAAQ7D,CAAA,CAAA,SAC7BC,UACiB,0GAA+B8D,OClE/C,IAAM6B,GAAqB,SAASC,EAAS,CAClD,OAAO,SAASC,EAAM,CACpB,OAAO,UAAW,CAChBD,EAAQ,UAAYC,CACtB,CACF,CACF,gBCkIA,IAAAC,GAIoB,UAAA,CAAA,IAAAC,EAAAC,EAAAC,EAAA,EAAI,SAAAC,EAAA,2BAAJ,SAAAC,EAAA,QAAAJ,EAAAK,GAAAD,CAAA,CAAA,wHC5HpBE,GAAA,UAAA,yCAAAC,GAAA,UAAA,+EAeAC,GAAA,SAAAC,EAAA,CAWE,IAAAC,EAAA,SAAAC,EAAA,WAGI,CAAAC,GAASD,EAAA,KAAA,CAAA,CAAA,EACT,CAAA,CAAA,GAEJE,EACe,SAAAC,EAAA,CACb,GAAAA,aAAAR,iBACE,SAAAS,EAAA,CAAA,OAAAC,GAAAC,GAAAF,EAAA,KAAA,CAAA,EACA,SAAAG,EAAA,cACKA,CAAA,EAAI,SAAAC,EAAA,eACP,SAAAC,EAAA,CAAA,OAAAC,GAAAC,GAAAC,GAC8B,SAAAC,EAAA,QAC5B,UAAA,cAAgCL,CAAA,EAAIV,EAFtCW,EAAA,QAAA,CAAA,CAAA,EAAA,iBADF,UAAA,yBAOF,GAAAN,aAAAP,GAAQ,OAAAkB,GAAAC,GACI,SAAAX,EAAA,oGAAV,UAAA,QACAF,EAAAP,GAAA,KAAA,6IA5BF,cAAgB,SAAAqB,EAAA,OAAa,OAAS,oBAAuBA,WAC3DjB,UACgB,8DAA+BG,qCAEL,SAAAe,EAAA,2BAAAA,CAAA,CAAA,QCpCzC,SAASC,IAAe,CAC3B,MAAO,CACH,MAAO,GACP,OAAQ,GACR,WAAY,KACZ,IAAK,GACL,MAAO,KACP,SAAU,GACV,SAAU,KACV,OAAQ,GACR,UAAW,KACX,WAAY,IACpB,CACA,CACU,IAACC,GAAYD,GAAY,EAC5B,SAASE,GAAeC,EAAa,CACxCF,GAAYE,CAChB,CCjBA,IAAMC,GAAa,UACbC,GAAgB,IAAI,OAAOD,GAAW,OAAQ,GAAG,EACjDE,GAAqB,oDACrBC,GAAwB,IAAI,OAAOD,GAAmB,OAAQ,GAAG,EACjEE,GAAqB,CACvB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,OACT,EACMC,GAAwBC,GAAOF,GAAmBE,CAAE,EACnD,SAASC,GAAOC,EAAMC,EAAQ,CACjC,GAAIA,GACA,GAAIT,GAAW,KAAKQ,CAAI,EACpB,OAAOA,EAAK,QAAQP,GAAeI,EAAoB,UAIvDH,GAAmB,KAAKM,CAAI,EAC5B,OAAOA,EAAK,QAAQL,GAAuBE,EAAoB,EAGvE,OAAOG,CACX,CACA,IAAME,GAAe,6CACd,SAASC,GAASH,EAAM,CAE3B,OAAOA,EAAK,QAAQE,GAAc,CAACE,EAAGC,KAClCA,EAAIA,EAAE,YAAW,EACbA,IAAM,QACC,IACPA,EAAE,OAAO,CAAC,IAAM,IACTA,EAAE,OAAO,CAAC,IAAM,IACjB,OAAO,aAAa,SAASA,EAAE,UAAU,CAAC,EAAG,EAAE,CAAC,EAChD,OAAO,aAAa,CAACA,EAAE,UAAU,CAAC,CAAC,EAEtC,GACV,CACL,CACA,IAAMC,GAAQ,eACP,SAASC,GAAKC,EAAOC,EAAK,CAC7B,IAAIC,EAAS,OAAOF,GAAU,SAAWA,EAAQA,EAAM,OACvDC,EAAMA,GAAO,GACb,IAAME,EAAM,CACR,QAAS,CAACC,EAAMC,IAAQ,CACpB,IAAIC,EAAY,OAAOD,GAAQ,SAAWA,EAAMA,EAAI,OACpD,OAAAC,EAAYA,EAAU,QAAQR,GAAO,IAAI,EACzCI,EAASA,EAAO,QAAQE,EAAME,CAAS,EAChCH,CACnB,EACQ,SAAU,IACC,IAAI,OAAOD,EAAQD,CAAG,CAEzC,EACI,OAAOE,CACX,CACO,SAASI,GAASC,EAAM,CAC3B,GAAI,CACAA,EAAO,UAAUA,CAAI,EAAE,QAAQ,OAAQ,GAAG,CAClD,OACW,EAAG,CACN,OAAO,IACf,CACI,OAAOA,CACX,CACO,IAAMC,GAAW,CAAE,KAAM,IAAM,IAAI,EACnC,SAASC,GAAWC,EAAUC,EAAO,CAGxC,IAAMC,EAAMF,EAAS,QAAQ,MAAO,CAACG,EAAOC,EAAQC,IAAQ,CACxD,IAAIC,EAAU,GACVC,EAAOH,EACX,KAAO,EAAEG,GAAQ,GAAKF,EAAIE,CAAI,IAAM,MAChCD,EAAU,CAACA,EACf,OAAIA,EAGO,IAIA,IAEnB,CAAK,EAAGE,EAAQN,EAAI,MAAM,KAAK,EACvBO,EAAI,EAQR,GANKD,EAAM,CAAC,EAAE,KAAI,GACdA,EAAM,MAAK,EAEXA,EAAM,OAAS,GAAK,CAACA,EAAMA,EAAM,OAAS,CAAC,EAAE,KAAI,GACjDA,EAAM,IAAG,EAETP,EACA,GAAIO,EAAM,OAASP,EACfO,EAAM,OAAOP,CAAK,MAGlB,MAAOO,EAAM,OAASP,GAClBO,EAAM,KAAK,EAAE,EAGzB,KAAOC,EAAID,EAAM,OAAQC,IAErBD,EAAMC,CAAC,EAAID,EAAMC,CAAC,EAAE,KAAI,EAAG,QAAQ,QAAS,GAAG,EAEnD,OAAOD,CACX,CASO,SAASE,GAAML,EAAKM,EAAGC,EAAQ,CAClC,IAAMC,EAAIR,EAAI,OACd,GAAIQ,IAAM,EACN,MAAO,GAGX,IAAIC,EAAU,EAEd,KAAOA,EAAUD,GAAG,CAChB,IAAME,EAAWV,EAAI,OAAOQ,EAAIC,EAAU,CAAC,EAC3C,GAAIC,IAAaJ,GAAK,CAACC,EACnBE,YAEKC,IAAaJ,GAAKC,EACvBE,QAGA,MAEZ,CACI,OAAOT,EAAI,MAAM,EAAGQ,EAAIC,CAAO,CACnC,CACO,SAASE,GAAmBX,EAAKY,EAAG,CACvC,GAAIZ,EAAI,QAAQY,EAAE,CAAC,CAAC,IAAM,GACtB,MAAO,GAEX,IAAIC,EAAQ,EACZ,QAAST,EAAI,EAAGA,EAAIJ,EAAI,OAAQI,IAC5B,GAAIJ,EAAII,CAAC,IAAM,KACXA,YAEKJ,EAAII,CAAC,IAAMQ,EAAE,CAAC,EACnBC,YAEKb,EAAII,CAAC,IAAMQ,EAAE,CAAC,IACnBC,IACIA,EAAQ,GACR,OAAOT,EAInB,MAAO,EACX,CC/JA,SAASU,GAAWC,EAAKC,EAAMC,EAAKC,EAAO,CACvC,IAAM1B,EAAOwB,EAAK,KACZG,EAAQH,EAAK,MAAQzC,GAAOyC,EAAK,KAAK,EAAI,KAC1CI,EAAOL,EAAI,CAAC,EAAE,QAAQ,cAAe,IAAI,EAC/C,GAAIA,EAAI,CAAC,EAAE,OAAO,CAAC,IAAM,IAAK,CAC1BG,EAAM,MAAM,OAAS,GACrB,IAAMG,EAAQ,CACV,KAAM,OACN,IAAAJ,EACA,KAAAzB,EACA,MAAA2B,EACA,KAAAC,EACA,OAAQF,EAAM,aAAaE,CAAI,CAC3C,EACQ,OAAAF,EAAM,MAAM,OAAS,GACdG,CACf,CACI,MAAO,CACH,KAAM,QACN,IAAAJ,EACA,KAAAzB,EACA,MAAA2B,EACA,KAAM5C,GAAO6C,CAAI,CACzB,CACA,CACA,SAASE,GAAuBL,EAAKG,EAAM,CACvC,IAAMG,EAAoBN,EAAI,MAAM,eAAe,EACnD,GAAIM,IAAsB,KACtB,OAAOH,EAEX,IAAMI,EAAeD,EAAkB,CAAC,EACxC,OAAOH,EACF,MAAM;CAAI,EACV,IAAIK,GAAQ,CACb,IAAMC,EAAoBD,EAAK,MAAM,MAAM,EAC3C,GAAIC,IAAsB,KACtB,OAAOD,EAEX,GAAM,CAACE,CAAY,EAAID,EACvB,OAAIC,EAAa,QAAUH,EAAa,OAC7BC,EAAK,MAAMD,EAAa,MAAM,EAElCC,CACf,CAAK,EACI,KAAK;CAAI,CAClB,CAIO,IAAMG,GAAN,KAAiB,CAIpB,YAAYC,EAAS,CAHrBC,GAAA,gBACAA,GAAA,cACAA,GAAA,cAEI,KAAK,QAAUD,GAAWhE,EAClC,CACI,MAAMkE,EAAK,CACP,IAAMhB,EAAM,KAAK,MAAM,MAAM,QAAQ,KAAKgB,CAAG,EAC7C,GAAIhB,GAAOA,EAAI,CAAC,EAAE,OAAS,EACvB,MAAO,CACH,KAAM,QACN,IAAKA,EAAI,CAAC,CAC1B,CAEA,CACI,KAAKgB,EAAK,CACN,IAAMhB,EAAM,KAAK,MAAM,MAAM,KAAK,KAAKgB,CAAG,EAC1C,GAAIhB,EAAK,CACL,IAAMK,EAAOL,EAAI,CAAC,EAAE,QAAQ,YAAa,EAAE,EAC3C,MAAO,CACH,KAAM,OACN,IAAKA,EAAI,CAAC,EACV,eAAgB,WAChB,KAAO,KAAK,QAAQ,SAEdK,EADAf,GAAMe,EAAM;CAAI,CAEtC,CACA,CACA,CACI,OAAOW,EAAK,CACR,IAAMhB,EAAM,KAAK,MAAM,MAAM,OAAO,KAAKgB,CAAG,EAC5C,GAAIhB,EAAK,CACL,IAAME,EAAMF,EAAI,CAAC,EACXK,EAAOE,GAAuBL,EAAKF,EAAI,CAAC,GAAK,EAAE,EACrD,MAAO,CACH,KAAM,OACN,IAAAE,EACA,KAAMF,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,KAAI,EAAG,QAAQ,KAAK,MAAM,OAAO,eAAgB,IAAI,EAAIA,EAAI,CAAC,EACpF,KAAAK,CAChB,CACA,CACA,CACI,QAAQW,EAAK,CACT,IAAMhB,EAAM,KAAK,MAAM,MAAM,QAAQ,KAAKgB,CAAG,EAC7C,GAAIhB,EAAK,CACL,IAAIK,EAAOL,EAAI,CAAC,EAAE,KAAI,EAEtB,GAAI,KAAK,KAAKK,CAAI,EAAG,CACjB,IAAMY,EAAU3B,GAAMe,EAAM,GAAG,GAC3B,KAAK,QAAQ,UAGR,CAACY,GAAW,KAAK,KAAKA,CAAO,KAElCZ,EAAOY,EAAQ,KAAI,EAEvC,CACY,MAAO,CACH,KAAM,UACN,IAAKjB,EAAI,CAAC,EACV,MAAOA,EAAI,CAAC,EAAE,OACd,KAAAK,EACA,OAAQ,KAAK,MAAM,OAAOA,CAAI,CAC9C,CACA,CACA,CACI,GAAGW,EAAK,CACJ,IAAMhB,EAAM,KAAK,MAAM,MAAM,GAAG,KAAKgB,CAAG,EACxC,GAAIhB,EACA,MAAO,CACH,KAAM,KACN,IAAKA,EAAI,CAAC,CAC1B,CAEA,CACI,WAAWgB,EAAK,CACZ,IAAMhB,EAAM,KAAK,MAAM,MAAM,WAAW,KAAKgB,CAAG,EAChD,GAAIhB,EAAK,CACL,IAAMK,EAAOf,GAAMU,EAAI,CAAC,EAAE,QAAQ,eAAgB,EAAE,EAAG;CAAI,EACrDkB,EAAM,KAAK,MAAM,MAAM,IAC7B,KAAK,MAAM,MAAM,IAAM,GACvB,IAAMC,EAAS,KAAK,MAAM,YAAYd,CAAI,EAC1C,YAAK,MAAM,MAAM,IAAMa,EAChB,CACH,KAAM,aACN,IAAKlB,EAAI,CAAC,EACV,OAAAmB,EACA,KAAAd,CAChB,CACA,CACA,CACI,KAAKW,EAAK,CACN,IAAIhB,EAAM,KAAK,MAAM,MAAM,KAAK,KAAKgB,CAAG,EACxC,GAAIhB,EAAK,CACL,IAAIoB,EAAOpB,EAAI,CAAC,EAAE,KAAI,EAChBqB,EAAYD,EAAK,OAAS,EAC1BE,EAAO,CACT,KAAM,OACN,IAAK,GACL,QAASD,EACT,MAAOA,EAAY,CAACD,EAAK,MAAM,EAAG,EAAE,EAAI,GACxC,MAAO,GACP,MAAO,CAAA,CACvB,EACYA,EAAOC,EAAY,aAAaD,EAAK,MAAM,EAAE,CAAC,GAAK,KAAKA,CAAI,GACxD,KAAK,QAAQ,WACbA,EAAOC,EAAYD,EAAO,SAG9B,IAAMG,EAAY,IAAI,OAAO,WAAWH,CAAI,8BAA+B,EACvElB,EAAM,GACNsB,EAAe,GACfC,EAAoB,GAExB,KAAOT,GAAK,CACR,IAAIU,EAAW,GAIf,GAHI,EAAE1B,EAAMuB,EAAU,KAAKP,CAAG,IAG1B,KAAK,MAAM,MAAM,GAAG,KAAKA,CAAG,EAC5B,MAEJd,EAAMF,EAAI,CAAC,EACXgB,EAAMA,EAAI,UAAUd,EAAI,MAAM,EAC9B,IAAIyB,EAAO3B,EAAI,CAAC,EAAE,MAAM;EAAM,CAAC,EAAE,CAAC,EAAE,QAAQ,OAAS4B,IAAM,IAAI,OAAO,EAAIA,GAAE,MAAM,CAAC,EAC/EC,EAAWb,EAAI,MAAM;EAAM,CAAC,EAAE,CAAC,EAC/Bc,EAAS,EACT,KAAK,QAAQ,UACbA,EAAS,EACTN,EAAeG,EAAK,UAAS,IAG7BG,EAAS9B,EAAI,CAAC,EAAE,OAAO,MAAM,EAC7B8B,EAASA,EAAS,EAAI,EAAIA,EAC1BN,EAAeG,EAAK,MAAMG,CAAM,EAChCA,GAAU9B,EAAI,CAAC,EAAE,QAErB,IAAI+B,EAAY,GAMhB,GALI,CAACJ,GAAQ,OAAO,KAAKE,CAAQ,IAC7B3B,GAAO2B,EAAW;EAClBb,EAAMA,EAAI,UAAUa,EAAS,OAAS,CAAC,EACvCH,EAAW,IAEX,CAACA,EAAU,CACX,IAAMM,GAAkB,IAAI,OAAO,QAAQ,KAAK,IAAI,EAAGF,EAAS,CAAC,CAAC,oDAAqD,EACjHG,GAAU,IAAI,OAAO,QAAQ,KAAK,IAAI,EAAGH,EAAS,CAAC,CAAC,oDAAoD,EACxGI,GAAmB,IAAI,OAAO,QAAQ,KAAK,IAAI,EAAGJ,EAAS,CAAC,CAAC,iBAAiB,EAC9EK,GAAoB,IAAI,OAAO,QAAQ,KAAK,IAAI,EAAGL,EAAS,CAAC,CAAC,IAAI,EAExE,KAAOd,GAAK,CACR,IAAMoB,EAAUpB,EAAI,MAAM;EAAM,CAAC,EAAE,CAAC,EAmBpC,GAlBAa,EAAWO,EAEP,KAAK,QAAQ,WACbP,EAAWA,EAAS,QAAQ,0BAA2B,IAAI,GAG3DK,GAAiB,KAAKL,CAAQ,GAI9BM,GAAkB,KAAKN,CAAQ,GAI/BG,GAAgB,KAAKH,CAAQ,GAI7BI,GAAQ,KAAKjB,CAAG,EAChB,MAEJ,GAAIa,EAAS,OAAO,MAAM,GAAKC,GAAU,CAACD,EAAS,KAAI,EACnDL,GAAgB;EAAOK,EAAS,MAAMC,CAAM,MAE3C,CAeD,GAbIC,GAIAJ,EAAK,OAAO,MAAM,GAAK,GAGvBO,GAAiB,KAAKP,CAAI,GAG1BQ,GAAkB,KAAKR,CAAI,GAG3BM,GAAQ,KAAKN,CAAI,EACjB,MAEJH,GAAgB;EAAOK,CACnD,CAC4B,CAACE,GAAa,CAACF,EAAS,KAAI,IAC5BE,EAAY,IAEhB7B,GAAOkC,EAAU;EACjBpB,EAAMA,EAAI,UAAUoB,EAAQ,OAAS,CAAC,EACtCT,EAAOE,EAAS,MAAMC,CAAM,CACpD,CACA,CACqBR,EAAK,QAEFG,EACAH,EAAK,MAAQ,GAER,YAAY,KAAKpB,CAAG,IACzBuB,EAAoB,KAG5B,IAAIY,EAAS,KACTC,EAEA,KAAK,QAAQ,MACbD,EAAS,cAAc,KAAKb,CAAY,EACpCa,IACAC,EAAYD,EAAO,CAAC,IAAM,OAC1Bb,EAAeA,EAAa,QAAQ,eAAgB,EAAE,IAG9DF,EAAK,MAAM,KAAK,CACZ,KAAM,YACN,IAAApB,EACA,KAAM,CAAC,CAACmC,EACR,QAASC,EACT,MAAO,GACP,KAAMd,EACN,OAAQ,CAAA,CAC5B,CAAiB,EACDF,EAAK,KAAOpB,CAC5B,CAEYoB,EAAK,MAAMA,EAAK,MAAM,OAAS,CAAC,EAAE,IAAMpB,EAAI,QAAO,EAClDoB,EAAK,MAAMA,EAAK,MAAM,OAAS,CAAC,EAAG,KAAOE,EAAa,QAAO,EAC/DF,EAAK,IAAMA,EAAK,IAAI,QAAO,EAE3B,QAASjC,EAAI,EAAGA,EAAIiC,EAAK,MAAM,OAAQjC,IAGnC,GAFA,KAAK,MAAM,MAAM,IAAM,GACvBiC,EAAK,MAAMjC,CAAC,EAAE,OAAS,KAAK,MAAM,YAAYiC,EAAK,MAAMjC,CAAC,EAAE,KAAM,CAAA,CAAE,EAChE,CAACiC,EAAK,MAAO,CAEb,IAAMiB,EAAUjB,EAAK,MAAMjC,CAAC,EAAE,OAAO,OAAOuC,GAAKA,EAAE,OAAS,OAAO,EAC7DY,EAAwBD,EAAQ,OAAS,GAAKA,EAAQ,KAAKX,GAAK,SAAS,KAAKA,EAAE,GAAG,CAAC,EAC1FN,EAAK,MAAQkB,CACjC,CAGY,GAAIlB,EAAK,MACL,QAASjC,EAAI,EAAGA,EAAIiC,EAAK,MAAM,OAAQjC,IACnCiC,EAAK,MAAMjC,CAAC,EAAE,MAAQ,GAG9B,OAAOiC,CACnB,CACA,CACI,KAAKN,EAAK,CACN,IAAMhB,EAAM,KAAK,MAAM,MAAM,KAAK,KAAKgB,CAAG,EAC1C,GAAIhB,EAQA,MAPc,CACV,KAAM,OACN,MAAO,GACP,IAAKA,EAAI,CAAC,EACV,IAAKA,EAAI,CAAC,IAAM,OAASA,EAAI,CAAC,IAAM,UAAYA,EAAI,CAAC,IAAM,QAC3D,KAAMA,EAAI,CAAC,CAC3B,CAGA,CACI,IAAIgB,EAAK,CACL,IAAMhB,EAAM,KAAK,MAAM,MAAM,IAAI,KAAKgB,CAAG,EACzC,GAAIhB,EAAK,CACL,IAAMyC,EAAMzC,EAAI,CAAC,EAAE,YAAW,EAAG,QAAQ,OAAQ,GAAG,EAC9CvB,EAAOuB,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,QAAQ,WAAY,IAAI,EAAE,QAAQ,KAAK,MAAM,OAAO,eAAgB,IAAI,EAAI,GACnGI,EAAQJ,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,UAAU,EAAGA,EAAI,CAAC,EAAE,OAAS,CAAC,EAAE,QAAQ,KAAK,MAAM,OAAO,eAAgB,IAAI,EAAIA,EAAI,CAAC,EACrH,MAAO,CACH,KAAM,MACN,IAAAyC,EACA,IAAKzC,EAAI,CAAC,EACV,KAAAvB,EACA,MAAA2B,CAChB,CACA,CACA,CACI,MAAMY,EAAK,CACP,IAAMhB,EAAM,KAAK,MAAM,MAAM,MAAM,KAAKgB,CAAG,EAI3C,GAHI,CAAChB,GAGD,CAAC,OAAO,KAAKA,EAAI,CAAC,CAAC,EAEnB,OAEJ,IAAM0C,EAAU/D,GAAWqB,EAAI,CAAC,CAAC,EAC3B2C,EAAS3C,EAAI,CAAC,EAAE,QAAQ,aAAc,EAAE,EAAE,MAAM,GAAG,EACnD4C,EAAO5C,EAAI,CAAC,GAAKA,EAAI,CAAC,EAAE,KAAI,EAAKA,EAAI,CAAC,EAAE,QAAQ,YAAa,EAAE,EAAE,MAAM;CAAI,EAAI,CAAA,EAC/E6C,EAAO,CACT,KAAM,QACN,IAAK7C,EAAI,CAAC,EACV,OAAQ,CAAA,EACR,MAAO,CAAA,EACP,KAAM,CAAA,CAClB,EACQ,GAAI0C,EAAQ,SAAWC,EAAO,OAI9B,SAAWG,KAASH,EACZ,YAAY,KAAKG,CAAK,EACtBD,EAAK,MAAM,KAAK,OAAO,EAElB,aAAa,KAAKC,CAAK,EAC5BD,EAAK,MAAM,KAAK,QAAQ,EAEnB,YAAY,KAAKC,CAAK,EAC3BD,EAAK,MAAM,KAAK,MAAM,EAGtBA,EAAK,MAAM,KAAK,IAAI,EAG5B,QAAWE,KAAUL,EACjBG,EAAK,OAAO,KAAK,CACb,KAAME,EACN,OAAQ,KAAK,MAAM,OAAOA,CAAM,CAChD,CAAa,EAEL,QAAWjE,KAAO8D,EACdC,EAAK,KAAK,KAAKlE,GAAWG,EAAK+D,EAAK,OAAO,MAAM,EAAE,IAAIG,IAC5C,CACH,KAAMA,EACN,OAAQ,KAAK,MAAM,OAAOA,CAAI,CAClD,EACa,CAAC,EAEN,OAAOH,EACf,CACI,SAAS7B,EAAK,CACV,IAAMhB,EAAM,KAAK,MAAM,MAAM,SAAS,KAAKgB,CAAG,EAC9C,GAAIhB,EACA,MAAO,CACH,KAAM,UACN,IAAKA,EAAI,CAAC,EACV,MAAOA,EAAI,CAAC,EAAE,OAAO,CAAC,IAAM,IAAM,EAAI,EACtC,KAAMA,EAAI,CAAC,EACX,OAAQ,KAAK,MAAM,OAAOA,EAAI,CAAC,CAAC,CAChD,CAEA,CACI,UAAUgB,EAAK,CACX,IAAMhB,EAAM,KAAK,MAAM,MAAM,UAAU,KAAKgB,CAAG,EAC/C,GAAIhB,EAAK,CACL,IAAMK,EAAOL,EAAI,CAAC,EAAE,OAAOA,EAAI,CAAC,EAAE,OAAS,CAAC,IAAM;EAC5CA,EAAI,CAAC,EAAE,MAAM,EAAG,EAAE,EAClBA,EAAI,CAAC,EACX,MAAO,CACH,KAAM,YACN,IAAKA,EAAI,CAAC,EACV,KAAAK,EACA,OAAQ,KAAK,MAAM,OAAOA,CAAI,CAC9C,CACA,CACA,CACI,KAAKW,EAAK,CACN,IAAMhB,EAAM,KAAK,MAAM,MAAM,KAAK,KAAKgB,CAAG,EAC1C,GAAIhB,EACA,MAAO,CACH,KAAM,OACN,IAAKA,EAAI,CAAC,EACV,KAAMA,EAAI,CAAC,EACX,OAAQ,KAAK,MAAM,OAAOA,EAAI,CAAC,CAAC,CAChD,CAEA,CACI,OAAOgB,EAAK,CACR,IAAMhB,EAAM,KAAK,MAAM,OAAO,OAAO,KAAKgB,CAAG,EAC7C,GAAIhB,EACA,MAAO,CACH,KAAM,SACN,IAAKA,EAAI,CAAC,EACV,KAAMxC,GAAOwC,EAAI,CAAC,CAAC,CACnC,CAEA,CACI,IAAIgB,EAAK,CACL,IAAMhB,EAAM,KAAK,MAAM,OAAO,IAAI,KAAKgB,CAAG,EAC1C,GAAIhB,EACA,MAAI,CAAC,KAAK,MAAM,MAAM,QAAU,QAAQ,KAAKA,EAAI,CAAC,CAAC,EAC/C,KAAK,MAAM,MAAM,OAAS,GAErB,KAAK,MAAM,MAAM,QAAU,UAAU,KAAKA,EAAI,CAAC,CAAC,IACrD,KAAK,MAAM,MAAM,OAAS,IAE1B,CAAC,KAAK,MAAM,MAAM,YAAc,iCAAiC,KAAKA,EAAI,CAAC,CAAC,EAC5E,KAAK,MAAM,MAAM,WAAa,GAEzB,KAAK,MAAM,MAAM,YAAc,mCAAmC,KAAKA,EAAI,CAAC,CAAC,IAClF,KAAK,MAAM,MAAM,WAAa,IAE3B,CACH,KAAM,OACN,IAAKA,EAAI,CAAC,EACV,OAAQ,KAAK,MAAM,MAAM,OACzB,WAAY,KAAK,MAAM,MAAM,WAC7B,MAAO,GACP,KAAMA,EAAI,CAAC,CAC3B,CAEA,CACI,KAAKgB,EAAK,CACN,IAAMhB,EAAM,KAAK,MAAM,OAAO,KAAK,KAAKgB,CAAG,EAC3C,GAAIhB,EAAK,CACL,IAAMiD,EAAajD,EAAI,CAAC,EAAE,KAAI,EAC9B,GAAI,CAAC,KAAK,QAAQ,UAAY,KAAK,KAAKiD,CAAU,EAAG,CAEjD,GAAI,CAAE,KAAK,KAAKA,CAAU,EACtB,OAGJ,IAAMC,EAAa5D,GAAM2D,EAAW,MAAM,EAAG,EAAE,EAAG,IAAI,EACtD,IAAKA,EAAW,OAASC,EAAW,QAAU,IAAM,EAChD,MAEpB,KACiB,CAED,IAAMC,EAAiBvD,GAAmBI,EAAI,CAAC,EAAG,IAAI,EACtD,GAAImD,EAAiB,GAAI,CAErB,IAAMC,GADQpD,EAAI,CAAC,EAAE,QAAQ,GAAG,IAAM,EAAI,EAAI,GACtBA,EAAI,CAAC,EAAE,OAASmD,EACxCnD,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,UAAU,EAAGmD,CAAc,EAC3CnD,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,UAAU,EAAGoD,CAAO,EAAE,KAAI,EAC1CpD,EAAI,CAAC,EAAI,EAC7B,CACA,CACY,IAAIvB,EAAOuB,EAAI,CAAC,EACZI,EAAQ,GACZ,GAAI,KAAK,QAAQ,SAAU,CAEvB,IAAMH,EAAO,gCAAgC,KAAKxB,CAAI,EAClDwB,IACAxB,EAAOwB,EAAK,CAAC,EACbG,EAAQH,EAAK,CAAC,EAElC,MAEgBG,EAAQJ,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,MAAM,EAAG,EAAE,EAAI,GAE3C,OAAAvB,EAAOA,EAAK,KAAI,EACZ,KAAK,KAAKA,CAAI,IACV,KAAK,QAAQ,UAAY,CAAE,KAAK,KAAKwE,CAAU,EAE/CxE,EAAOA,EAAK,MAAM,CAAC,EAGnBA,EAAOA,EAAK,MAAM,EAAG,EAAE,GAGxBsB,GAAWC,EAAK,CACnB,KAAMvB,GAAOA,EAAK,QAAQ,KAAK,MAAM,OAAO,eAAgB,IAAI,EAChE,MAAO2B,GAAQA,EAAM,QAAQ,KAAK,MAAM,OAAO,eAAgB,IAAI,CACnF,EAAeJ,EAAI,CAAC,EAAG,KAAK,KAAK,CACjC,CACA,CACI,QAAQgB,EAAKqC,EAAO,CAChB,IAAIrD,EACJ,IAAKA,EAAM,KAAK,MAAM,OAAO,QAAQ,KAAKgB,CAAG,KACrChB,EAAM,KAAK,MAAM,OAAO,OAAO,KAAKgB,CAAG,GAAI,CAC/C,IAAMsC,GAActD,EAAI,CAAC,GAAKA,EAAI,CAAC,GAAG,QAAQ,OAAQ,GAAG,EACnDC,EAAOoD,EAAMC,EAAW,YAAW,CAAE,EAC3C,GAAI,CAACrD,EAAM,CACP,IAAMI,EAAOL,EAAI,CAAC,EAAE,OAAO,CAAC,EAC5B,MAAO,CACH,KAAM,OACN,IAAKK,EACL,KAAAA,CACpB,CACA,CACY,OAAON,GAAWC,EAAKC,EAAMD,EAAI,CAAC,EAAG,KAAK,KAAK,CAC3D,CACA,CACI,SAASgB,EAAKuC,EAAWC,EAAW,GAAI,CACpC,IAAIzE,EAAQ,KAAK,MAAM,OAAO,eAAe,KAAKiC,CAAG,EAIrD,GAHI,CAACjC,GAGDA,EAAM,CAAC,GAAKyE,EAAS,MAAM,eAAe,EAC1C,OAEJ,GAAI,EADazE,EAAM,CAAC,GAAKA,EAAM,CAAC,GAAK,KACxB,CAACyE,GAAY,KAAK,MAAM,OAAO,YAAY,KAAKA,CAAQ,EAAG,CAExE,IAAMC,EAAU,CAAC,GAAG1E,EAAM,CAAC,CAAC,EAAE,OAAS,EACnC2E,EAAQC,EAASC,EAAaH,EAASI,EAAgB,EACrDC,EAAS/E,EAAM,CAAC,EAAE,CAAC,IAAM,IAAM,KAAK,MAAM,OAAO,kBAAoB,KAAK,MAAM,OAAO,kBAI7F,IAHA+E,EAAO,UAAY,EAEnBP,EAAYA,EAAU,MAAM,GAAKvC,EAAI,OAASyC,CAAO,GAC7C1E,EAAQ+E,EAAO,KAAKP,CAAS,IAAM,MAAM,CAE7C,GADAG,EAAS3E,EAAM,CAAC,GAAKA,EAAM,CAAC,GAAKA,EAAM,CAAC,GAAKA,EAAM,CAAC,GAAKA,EAAM,CAAC,GAAKA,EAAM,CAAC,EACxE,CAAC2E,EACD,SAEJ,GADAC,EAAU,CAAC,GAAGD,CAAM,EAAE,OAClB3E,EAAM,CAAC,GAAKA,EAAM,CAAC,EAAG,CACtB6E,GAAcD,EACd,QACpB,UACyB5E,EAAM,CAAC,GAAKA,EAAM,CAAC,IACpB0E,EAAU,GAAK,GAAGA,EAAUE,GAAW,GAAI,CAC3CE,GAAiBF,EACjB,QACxB,CAGgB,GADAC,GAAcD,EACVC,EAAa,EACb,SAEJD,EAAU,KAAK,IAAIA,EAASA,EAAUC,EAAaC,CAAa,EAEhE,IAAME,EAAiB,CAAC,GAAGhF,EAAM,CAAC,CAAC,EAAE,CAAC,EAAE,OAClCmB,EAAMc,EAAI,MAAM,EAAGyC,EAAU1E,EAAM,MAAQgF,EAAiBJ,CAAO,EAEzE,GAAI,KAAK,IAAIF,EAASE,CAAO,EAAI,EAAG,CAChC,IAAMtD,EAAOH,EAAI,MAAM,EAAG,EAAE,EAC5B,MAAO,CACH,KAAM,KACN,IAAAA,EACA,KAAAG,EACA,OAAQ,KAAK,MAAM,aAAaA,CAAI,CAC5D,CACA,CAEgB,IAAMA,EAAOH,EAAI,MAAM,EAAG,EAAE,EAC5B,MAAO,CACH,KAAM,SACN,IAAAA,EACA,KAAAG,EACA,OAAQ,KAAK,MAAM,aAAaA,CAAI,CACxD,CACA,CACA,CACA,CACI,SAASW,EAAK,CACV,IAAMhB,EAAM,KAAK,MAAM,OAAO,KAAK,KAAKgB,CAAG,EAC3C,GAAIhB,EAAK,CACL,IAAIK,EAAOL,EAAI,CAAC,EAAE,QAAQ,MAAO,GAAG,EAC9BgE,EAAmB,OAAO,KAAK3D,CAAI,EACnC4D,EAA0B,KAAK,KAAK5D,CAAI,GAAK,KAAK,KAAKA,CAAI,EACjE,OAAI2D,GAAoBC,IACpB5D,EAAOA,EAAK,UAAU,EAAGA,EAAK,OAAS,CAAC,GAE5CA,EAAO7C,GAAO6C,EAAM,EAAI,EACjB,CACH,KAAM,WACN,IAAKL,EAAI,CAAC,EACV,KAAAK,CAChB,CACA,CACA,CACI,GAAGW,EAAK,CACJ,IAAMhB,EAAM,KAAK,MAAM,OAAO,GAAG,KAAKgB,CAAG,EACzC,GAAIhB,EACA,MAAO,CACH,KAAM,KACN,IAAKA,EAAI,CAAC,CAC1B,CAEA,CACI,IAAIgB,EAAK,CACL,IAAMhB,EAAM,KAAK,MAAM,OAAO,IAAI,KAAKgB,CAAG,EAC1C,GAAIhB,EACA,MAAO,CACH,KAAM,MACN,IAAKA,EAAI,CAAC,EACV,KAAMA,EAAI,CAAC,EACX,OAAQ,KAAK,MAAM,aAAaA,EAAI,CAAC,CAAC,CACtD,CAEA,CACI,SAASgB,EAAK,CACV,IAAMhB,EAAM,KAAK,MAAM,OAAO,SAAS,KAAKgB,CAAG,EAC/C,GAAIhB,EAAK,CACL,IAAIK,EAAM5B,EACV,OAAIuB,EAAI,CAAC,IAAM,KACXK,EAAO7C,GAAOwC,EAAI,CAAC,CAAC,EACpBvB,EAAO,UAAY4B,IAGnBA,EAAO7C,GAAOwC,EAAI,CAAC,CAAC,EACpBvB,EAAO4B,GAEJ,CACH,KAAM,OACN,IAAKL,EAAI,CAAC,EACV,KAAAK,EACA,KAAA5B,EACA,OAAQ,CACJ,CACI,KAAM,OACN,IAAK4B,EACL,KAAAA,CACxB,CACA,CACA,CACA,CACA,CACI,IAAIW,EAAK,SACL,IAAIhB,EACJ,GAAIA,EAAM,KAAK,MAAM,OAAO,IAAI,KAAKgB,CAAG,EAAG,CACvC,IAAIX,EAAM5B,EACV,GAAIuB,EAAI,CAAC,IAAM,IACXK,EAAO7C,GAAOwC,EAAI,CAAC,CAAC,EACpBvB,EAAO,UAAY4B,MAElB,CAED,IAAI6D,EACJ,GACIA,EAAclE,EAAI,CAAC,EACnBA,EAAI,CAAC,GAAImE,GAAAC,EAAA,KAAK,MAAM,OAAO,WAAW,KAAKpE,EAAI,CAAC,CAAC,IAAxC,YAAAoE,EAA4C,KAA5C,KAAAD,EAAkD,SACtDD,IAAgBlE,EAAI,CAAC,GAC9BK,EAAO7C,GAAOwC,EAAI,CAAC,CAAC,EAChBA,EAAI,CAAC,IAAM,OACXvB,EAAO,UAAYuB,EAAI,CAAC,EAGxBvB,EAAOuB,EAAI,CAAC,CAEhC,CACY,MAAO,CACH,KAAM,OACN,IAAKA,EAAI,CAAC,EACV,KAAAK,EACA,KAAA5B,EACA,OAAQ,CACJ,CACI,KAAM,OACN,IAAK4B,EACL,KAAAA,CACxB,CACA,CACA,CACA,CACA,CACI,WAAWW,EAAK,CACZ,IAAMhB,EAAM,KAAK,MAAM,OAAO,KAAK,KAAKgB,CAAG,EAC3C,GAAIhB,EAAK,CACL,IAAIK,EACJ,OAAI,KAAK,MAAM,MAAM,WACjBA,EAAOL,EAAI,CAAC,EAGZK,EAAO7C,GAAOwC,EAAI,CAAC,CAAC,EAEjB,CACH,KAAM,OACN,IAAKA,EAAI,CAAC,EACV,KAAAK,CAChB,CACA,CACA,CACA,ECrsBMgE,GAAU,mBACVC,GAAY,uCACZC,GAAS,8GACTC,GAAK,qEACLC,GAAU,uCACVC,GAAS,wBACTC,GAAW3G,GAAK,kEAAkE,EACnF,QAAQ,QAAS0G,EAAM,EACvB,SAAQ,EACPE,GAAa,uFACbC,GAAY,UACZC,GAAc,8BACdC,GAAM/G,GAAK,iGAAiG,EAC7G,QAAQ,QAAS8G,EAAW,EAC5B,QAAQ,QAAS,8DAA8D,EAC/E,SAAQ,EACPxD,GAAOtD,GAAK,sCAAsC,EACnD,QAAQ,QAAS0G,EAAM,EACvB,SAAQ,EACPM,GAAO,gWAMPC,GAAW,+BACXxH,GAAOO,GAAK,mdASP,GAAG,EACT,QAAQ,UAAWiH,EAAQ,EAC3B,QAAQ,MAAOD,EAAI,EACnB,QAAQ,YAAa,0EAA0E,EAC/F,SAAQ,EACPE,GAAYlH,GAAK4G,EAAU,EAC5B,QAAQ,KAAMJ,EAAE,EAChB,QAAQ,UAAW,uBAAuB,EAC1C,QAAQ,YAAa,EAAE,EACvB,QAAQ,SAAU,EAAE,EACpB,QAAQ,aAAc,SAAS,EAC/B,QAAQ,SAAU,gDAAgD,EAClE,QAAQ,OAAQ,wBAAwB,EACxC,QAAQ,OAAQ,6DAA6D,EAC7E,QAAQ,MAAOQ,EAAI,EACnB,SAAQ,EACPG,GAAanH,GAAK,yCAAyC,EAC5D,QAAQ,YAAakH,EAAS,EAC9B,SAAQ,EAIPE,GAAc,CAChB,WAAAD,GACA,KAAMb,GACN,IAAAS,GACA,OAAAR,GACA,QAAAE,GACA,GAAAD,GACA,KAAA/G,GACA,SAAAkH,GACA,KAAArD,GACA,QAAA+C,GACA,UAAAa,GACA,MAAOxG,GACP,KAAMmG,EACV,EAIMQ,GAAWrH,GAAK,6JAEsE,EACvF,QAAQ,KAAMwG,EAAE,EAChB,QAAQ,UAAW,uBAAuB,EAC1C,QAAQ,aAAc,SAAS,EAC/B,QAAQ,OAAQ,YAAY,EAC5B,QAAQ,SAAU,gDAAgD,EAClE,QAAQ,OAAQ,wBAAwB,EACxC,QAAQ,OAAQ,6DAA6D,EAC7E,QAAQ,MAAOQ,EAAI,EACnB,SAAQ,EACPM,GAAWC,GAAAC,GAAA,GACVJ,IADU,CAEb,MAAOC,GACP,UAAWrH,GAAK4G,EAAU,EACrB,QAAQ,KAAMJ,EAAE,EAChB,QAAQ,UAAW,uBAAuB,EAC1C,QAAQ,YAAa,EAAE,EACvB,QAAQ,QAASa,EAAQ,EACzB,QAAQ,aAAc,SAAS,EAC/B,QAAQ,SAAU,gDAAgD,EAClE,QAAQ,OAAQ,wBAAwB,EACxC,QAAQ,OAAQ,6DAA6D,EAC7E,QAAQ,MAAOL,EAAI,EACnB,SAAQ,CACjB,GAIMS,GAAgBF,GAAAC,GAAA,GACfJ,IADe,CAElB,KAAMpH,GAAK,wIAEiE,EACvE,QAAQ,UAAWiH,EAAQ,EAC3B,QAAQ,OAAQ,mKAGgB,EAChC,SAAQ,EACb,IAAK,oEACL,QAAS,yBACT,OAAQvG,GACR,SAAU,mCACV,UAAWV,GAAK4G,EAAU,EACrB,QAAQ,KAAMJ,EAAE,EAChB,QAAQ,UAAW;EAAiB,EACpC,QAAQ,WAAYG,EAAQ,EAC5B,QAAQ,SAAU,EAAE,EACpB,QAAQ,aAAc,SAAS,EAC/B,QAAQ,UAAW,EAAE,EACrB,QAAQ,QAAS,EAAE,EACnB,QAAQ,QAAS,EAAE,EACnB,QAAQ,OAAQ,EAAE,EAClB,SAAQ,CACjB,GAIMnH,GAAS,8CACTkI,GAAa,sCACbC,GAAK,wBACLC,GAAa,8EAEbC,GAAe,kBACfC,GAAc9H,GAAK,6BAA8B,GAAG,EACrD,QAAQ,eAAgB6H,EAAY,EAAE,SAAQ,EAE7CE,GAAY,gDACZC,GAAiBhI,GAAK,oEAAqE,GAAG,EAC/F,QAAQ,SAAU6H,EAAY,EAC9B,SAAQ,EACPI,GAAoBjI,GAAK,wQAOY,IAAI,EAC1C,QAAQ,SAAU6H,EAAY,EAC9B,SAAQ,EAEPK,GAAoBlI,GAAK,uNAMY,IAAI,EAC1C,QAAQ,SAAU6H,EAAY,EAC9B,SAAQ,EACPM,GAAiBnI,GAAK,cAAe,IAAI,EAC1C,QAAQ,SAAU6H,EAAY,EAC9B,SAAQ,EACPO,GAAWpI,GAAK,qCAAqC,EACtD,QAAQ,SAAU,8BAA8B,EAChD,QAAQ,QAAS,8IAA8I,EAC/J,SAAQ,EACPqI,GAAiBrI,GAAKiH,EAAQ,EAAE,QAAQ,YAAa,KAAK,EAAE,SAAQ,EACpExC,GAAMzE,GAAK,0JAKuB,EACnC,QAAQ,UAAWqI,EAAc,EACjC,QAAQ,YAAa,6EAA6E,EAClG,SAAQ,EACPC,GAAe,sDACfrG,GAAOjC,GAAK,+CAA+C,EAC5D,QAAQ,QAASsI,EAAY,EAC7B,QAAQ,OAAQ,sCAAsC,EACtD,QAAQ,QAAS,6DAA6D,EAC9E,SAAQ,EACPC,GAAUvI,GAAK,yBAAyB,EACzC,QAAQ,QAASsI,EAAY,EAC7B,QAAQ,MAAOxB,EAAW,EAC1B,SAAQ,EACP0B,GAASxI,GAAK,uBAAuB,EACtC,QAAQ,MAAO8G,EAAW,EAC1B,SAAQ,EACP2B,GAAgBzI,GAAK,wBAAyB,GAAG,EAClD,QAAQ,UAAWuI,EAAO,EAC1B,QAAQ,SAAUC,EAAM,EACxB,SAAQ,EAIPE,GAAe,CACjB,WAAYhI,GACZ,eAAAyH,GACA,SAAAC,GACA,UAAAL,GACA,GAAAJ,GACA,KAAMD,GACN,IAAKhH,GACL,eAAAsH,GACA,kBAAAC,GACA,kBAAAC,GACA,OAAA1I,GACA,KAAAyC,GACA,OAAAuG,GACA,YAAAV,GACA,QAAAS,GACA,cAAAE,GACA,IAAAhE,GACA,KAAMmD,GACN,IAAKlH,EACT,EAIMiI,GAAiBpB,GAAAC,GAAA,GAChBkB,IADgB,CAEnB,KAAM1I,GAAK,yBAAyB,EAC/B,QAAQ,QAASsI,EAAY,EAC7B,SAAQ,EACb,QAAStI,GAAK,+BAA+B,EACxC,QAAQ,QAASsI,EAAY,EAC7B,SAAQ,CACjB,GAIMM,GAAYrB,GAAAC,GAAA,GACXkB,IADW,CAEd,OAAQ1I,GAAKR,EAAM,EAAE,QAAQ,KAAM,MAAM,EAAE,SAAQ,EACnD,IAAKQ,GAAK,mEAAoE,GAAG,EAC5E,QAAQ,QAAS,2EAA2E,EAC5F,SAAQ,EACb,WAAY,6EACZ,IAAK,+CACL,KAAM,4NACV,GAIM6I,GAAetB,GAAAC,GAAA,GACdoB,IADc,CAEjB,GAAI5I,GAAK2H,EAAE,EAAE,QAAQ,OAAQ,GAAG,EAAE,SAAQ,EAC1C,KAAM3H,GAAK4I,GAAU,IAAI,EACpB,QAAQ,OAAQ,eAAe,EAC/B,QAAQ,UAAW,GAAG,EACtB,SAAQ,CACjB,GAIaE,GAAQ,CACjB,OAAQ1B,GACR,IAAKE,GACL,SAAUG,EACd,EACasB,GAAS,CAClB,OAAQL,GACR,IAAKE,GACL,OAAQC,GACR,SAAUF,EACd,ECjRaK,GAAN,MAAMC,CAAO,CAMhB,YAAYnG,EAAS,CALrBC,GAAA,eACAA,GAAA,gBACAA,GAAA,cACAA,GAAA,kBACAA,GAAA,oBAGI,KAAK,OAAS,CAAA,EACd,KAAK,OAAO,MAAQ,OAAO,OAAO,IAAI,EACtC,KAAK,QAAUD,GAAWhE,GAC1B,KAAK,QAAQ,UAAY,KAAK,QAAQ,WAAa,IAAI+D,GACvD,KAAK,UAAY,KAAK,QAAQ,UAC9B,KAAK,UAAU,QAAU,KAAK,QAC9B,KAAK,UAAU,MAAQ,KACvB,KAAK,YAAc,CAAA,EACnB,KAAK,MAAQ,CACT,OAAQ,GACR,WAAY,GACZ,IAAK,EACjB,EACQ,IAAMqG,EAAQ,CACV,MAAOJ,GAAM,OACb,OAAQC,GAAO,MAC3B,EACY,KAAK,QAAQ,UACbG,EAAM,MAAQJ,GAAM,SACpBI,EAAM,OAASH,GAAO,UAEjB,KAAK,QAAQ,MAClBG,EAAM,MAAQJ,GAAM,IAChB,KAAK,QAAQ,OACbI,EAAM,OAASH,GAAO,OAGtBG,EAAM,OAASH,GAAO,KAG9B,KAAK,UAAU,MAAQG,CAC/B,CAII,WAAW,OAAQ,CACf,MAAO,CACH,MAAAJ,GACA,OAAAC,EACZ,CACA,CAII,OAAO,IAAI/F,EAAKF,EAAS,CAErB,OADc,IAAImG,EAAOnG,CAAO,EACnB,IAAIE,CAAG,CAC5B,CAII,OAAO,UAAUA,EAAKF,EAAS,CAE3B,OADc,IAAImG,EAAOnG,CAAO,EACnB,aAAaE,CAAG,CACrC,CAII,IAAIA,EAAK,CACLA,EAAMA,EACD,QAAQ,WAAY;CAAI,EAC7B,KAAK,YAAYA,EAAK,KAAK,MAAM,EACjC,QAAS3B,EAAI,EAAGA,EAAI,KAAK,YAAY,OAAQA,IAAK,CAC9C,IAAM8H,EAAO,KAAK,YAAY9H,CAAC,EAC/B,KAAK,aAAa8H,EAAK,IAAKA,EAAK,MAAM,CACnD,CACQ,YAAK,YAAc,CAAA,EACZ,KAAK,MACpB,CACI,YAAYnG,EAAKG,EAAS,CAAA,EAAI,CACtB,KAAK,QAAQ,SACbH,EAAMA,EAAI,QAAQ,MAAO,MAAM,EAAE,QAAQ,SAAU,EAAE,EAGrDA,EAAMA,EAAI,QAAQ,eAAgB,CAACnD,EAAGuJ,EAASC,IACpCD,EAAU,OAAO,OAAOC,EAAK,MAAM,CAC7C,EAEL,IAAI/G,EACAgH,EACAC,EACAC,EACJ,KAAOxG,GACH,GAAI,OAAK,QAAQ,YACV,KAAK,QAAQ,WAAW,OACxB,KAAK,QAAQ,WAAW,MAAM,KAAMyG,IAC/BnH,EAAQmH,EAAa,KAAK,CAAE,MAAO,IAAI,EAAIzG,EAAKG,CAAM,IACtDH,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACV,IAEJ,EACV,GAIL,IAAIA,EAAQ,KAAK,UAAU,MAAMU,CAAG,EAAG,CACnCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EAChCA,EAAM,IAAI,SAAW,GAAKa,EAAO,OAAS,EAG1CA,EAAOA,EAAO,OAAS,CAAC,EAAE,KAAO;EAGjCA,EAAO,KAAKb,CAAK,EAErB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,KAAKU,CAAG,EAAG,CAClCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCgH,EAAYnG,EAAOA,EAAO,OAAS,CAAC,EAEhCmG,IAAcA,EAAU,OAAS,aAAeA,EAAU,OAAS,SACnEA,EAAU,KAAO;EAAOhH,EAAM,IAC9BgH,EAAU,MAAQ;EAAOhH,EAAM,KAC/B,KAAK,YAAY,KAAK,YAAY,OAAS,CAAC,EAAE,IAAMgH,EAAU,MAG9DnG,EAAO,KAAKb,CAAK,EAErB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,OAAOU,CAAG,EAAG,CACpCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,QAAQU,CAAG,EAAG,CACrCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,GAAGU,CAAG,EAAG,CAChCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,WAAWU,CAAG,EAAG,CACxCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,KAAKU,CAAG,EAAG,CAClCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,KAAKU,CAAG,EAAG,CAClCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,IAAIU,CAAG,EAAG,CACjCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCgH,EAAYnG,EAAOA,EAAO,OAAS,CAAC,EAChCmG,IAAcA,EAAU,OAAS,aAAeA,EAAU,OAAS,SACnEA,EAAU,KAAO;EAAOhH,EAAM,IAC9BgH,EAAU,MAAQ;EAAOhH,EAAM,IAC/B,KAAK,YAAY,KAAK,YAAY,OAAS,CAAC,EAAE,IAAMgH,EAAU,MAExD,KAAK,OAAO,MAAMhH,EAAM,GAAG,IACjC,KAAK,OAAO,MAAMA,EAAM,GAAG,EAAI,CAC3B,KAAMA,EAAM,KACZ,MAAOA,EAAM,KACrC,GAEgB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,MAAMU,CAAG,EAAG,CACnCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,SAASU,CAAG,EAAG,CACtCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAIY,GADAiH,EAASvG,EACL,KAAK,QAAQ,YAAc,KAAK,QAAQ,WAAW,WAAY,CAC/D,IAAI0G,EAAa,IACXC,EAAU3G,EAAI,MAAM,CAAC,EACvB4G,EACJ,KAAK,QAAQ,WAAW,WAAW,QAASC,GAAkB,CAC1DD,EAAYC,EAAc,KAAK,CAAE,MAAO,IAAI,EAAIF,CAAO,EACnD,OAAOC,GAAc,UAAYA,GAAa,IAC9CF,EAAa,KAAK,IAAIA,EAAYE,CAAS,EAEnE,CAAiB,EACGF,EAAa,KAAYA,GAAc,IACvCH,EAASvG,EAAI,UAAU,EAAG0G,EAAa,CAAC,EAE5D,CACY,GAAI,KAAK,MAAM,MAAQpH,EAAQ,KAAK,UAAU,UAAUiH,CAAM,GAAI,CAC9DD,EAAYnG,EAAOA,EAAO,OAAS,CAAC,EAChCqG,GAAwBF,EAAU,OAAS,aAC3CA,EAAU,KAAO;EAAOhH,EAAM,IAC9BgH,EAAU,MAAQ;EAAOhH,EAAM,KAC/B,KAAK,YAAY,IAAG,EACpB,KAAK,YAAY,KAAK,YAAY,OAAS,CAAC,EAAE,IAAMgH,EAAU,MAG9DnG,EAAO,KAAKb,CAAK,EAErBkH,EAAwBD,EAAO,SAAWvG,EAAI,OAC9CA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpC,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,KAAKU,CAAG,EAAG,CAClCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCgH,EAAYnG,EAAOA,EAAO,OAAS,CAAC,EAChCmG,GAAaA,EAAU,OAAS,QAChCA,EAAU,KAAO;EAAOhH,EAAM,IAC9BgH,EAAU,MAAQ;EAAOhH,EAAM,KAC/B,KAAK,YAAY,IAAG,EACpB,KAAK,YAAY,KAAK,YAAY,OAAS,CAAC,EAAE,IAAMgH,EAAU,MAG9DnG,EAAO,KAAKb,CAAK,EAErB,QAChB,CACY,GAAIU,EAAK,CACL,IAAM8G,EAAS,0BAA4B9G,EAAI,WAAW,CAAC,EAC3D,GAAI,KAAK,QAAQ,OAAQ,CACrB,QAAQ,MAAM8G,CAAM,EACpB,KACpB,KAEoB,OAAM,IAAI,MAAMA,CAAM,CAE1C,EAEQ,YAAK,MAAM,IAAM,GACV3G,CACf,CACI,OAAOH,EAAKG,EAAS,CAAA,EAAI,CACrB,YAAK,YAAY,KAAK,CAAE,IAAAH,EAAK,OAAAG,CAAM,CAAE,EAC9BA,CACf,CAII,aAAaH,EAAKG,EAAS,CAAA,EAAI,CAC3B,IAAIb,EAAOgH,EAAWC,EAElBhE,EAAYvC,EACZjC,EACAgJ,EAAcvE,EAElB,GAAI,KAAK,OAAO,MAAO,CACnB,IAAMH,EAAQ,OAAO,KAAK,KAAK,OAAO,KAAK,EAC3C,GAAIA,EAAM,OAAS,EACf,MAAQtE,EAAQ,KAAK,UAAU,MAAM,OAAO,cAAc,KAAKwE,CAAS,IAAM,MACtEF,EAAM,SAAStE,EAAM,CAAC,EAAE,MAAMA,EAAM,CAAC,EAAE,YAAY,GAAG,EAAI,EAAG,EAAE,CAAC,IAChEwE,EAAYA,EAAU,MAAM,EAAGxE,EAAM,KAAK,EAAI,IAAM,IAAI,OAAOA,EAAM,CAAC,EAAE,OAAS,CAAC,EAAI,IAAMwE,EAAU,MAAM,KAAK,UAAU,MAAM,OAAO,cAAc,SAAS,EAIvL,CAEQ,MAAQxE,EAAQ,KAAK,UAAU,MAAM,OAAO,UAAU,KAAKwE,CAAS,IAAM,MACtEA,EAAYA,EAAU,MAAM,EAAGxE,EAAM,KAAK,EAAI,IAAM,IAAI,OAAOA,EAAM,CAAC,EAAE,OAAS,CAAC,EAAI,IAAMwE,EAAU,MAAM,KAAK,UAAU,MAAM,OAAO,UAAU,SAAS,EAG/J,MAAQxE,EAAQ,KAAK,UAAU,MAAM,OAAO,eAAe,KAAKwE,CAAS,IAAM,MAC3EA,EAAYA,EAAU,MAAM,EAAGxE,EAAM,KAAK,EAAI,KAAOwE,EAAU,MAAM,KAAK,UAAU,MAAM,OAAO,eAAe,SAAS,EAE7H,KAAOvC,GAMH,GALK+G,IACDvE,EAAW,IAEfuE,EAAe,GAEX,OAAK,QAAQ,YACV,KAAK,QAAQ,WAAW,QACxB,KAAK,QAAQ,WAAW,OAAO,KAAMN,IAChCnH,EAAQmH,EAAa,KAAK,CAAE,MAAO,IAAI,EAAIzG,EAAKG,CAAM,IACtDH,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACV,IAEJ,EACV,GAIL,IAAIA,EAAQ,KAAK,UAAU,OAAOU,CAAG,EAAG,CACpCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,IAAIU,CAAG,EAAG,CACjCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCgH,EAAYnG,EAAOA,EAAO,OAAS,CAAC,EAChCmG,GAAahH,EAAM,OAAS,QAAUgH,EAAU,OAAS,QACzDA,EAAU,KAAOhH,EAAM,IACvBgH,EAAU,MAAQhH,EAAM,MAGxBa,EAAO,KAAKb,CAAK,EAErB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,KAAKU,CAAG,EAAG,CAClCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,QAAQU,EAAK,KAAK,OAAO,KAAK,EAAG,CACxDA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCgH,EAAYnG,EAAOA,EAAO,OAAS,CAAC,EAChCmG,GAAahH,EAAM,OAAS,QAAUgH,EAAU,OAAS,QACzDA,EAAU,KAAOhH,EAAM,IACvBgH,EAAU,MAAQhH,EAAM,MAGxBa,EAAO,KAAKb,CAAK,EAErB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,SAASU,EAAKuC,EAAWC,CAAQ,EAAG,CAC3DxC,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,SAASU,CAAG,EAAG,CACtCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,GAAGU,CAAG,EAAG,CAChCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,IAAIU,CAAG,EAAG,CACjCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAIA,EAAQ,KAAK,UAAU,SAASU,CAAG,EAAG,CACtCA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAEY,GAAI,CAAC,KAAK,MAAM,SAAWA,EAAQ,KAAK,UAAU,IAAIU,CAAG,GAAI,CACzDA,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EACpCa,EAAO,KAAKb,CAAK,EACjB,QAChB,CAIY,GADAiH,EAASvG,EACL,KAAK,QAAQ,YAAc,KAAK,QAAQ,WAAW,YAAa,CAChE,IAAI0G,EAAa,IACXC,EAAU3G,EAAI,MAAM,CAAC,EACvB4G,EACJ,KAAK,QAAQ,WAAW,YAAY,QAASC,GAAkB,CAC3DD,EAAYC,EAAc,KAAK,CAAE,MAAO,IAAI,EAAIF,CAAO,EACnD,OAAOC,GAAc,UAAYA,GAAa,IAC9CF,EAAa,KAAK,IAAIA,EAAYE,CAAS,EAEnE,CAAiB,EACGF,EAAa,KAAYA,GAAc,IACvCH,EAASvG,EAAI,UAAU,EAAG0G,EAAa,CAAC,EAE5D,CACY,GAAIpH,EAAQ,KAAK,UAAU,WAAWiH,CAAM,EAAG,CAC3CvG,EAAMA,EAAI,UAAUV,EAAM,IAAI,MAAM,EAChCA,EAAM,IAAI,MAAM,EAAE,IAAM,MACxBkD,EAAWlD,EAAM,IAAI,MAAM,EAAE,GAEjCyH,EAAe,GACfT,EAAYnG,EAAOA,EAAO,OAAS,CAAC,EAChCmG,GAAaA,EAAU,OAAS,QAChCA,EAAU,KAAOhH,EAAM,IACvBgH,EAAU,MAAQhH,EAAM,MAGxBa,EAAO,KAAKb,CAAK,EAErB,QAChB,CACY,GAAIU,EAAK,CACL,IAAM8G,EAAS,0BAA4B9G,EAAI,WAAW,CAAC,EAC3D,GAAI,KAAK,QAAQ,OAAQ,CACrB,QAAQ,MAAM8G,CAAM,EACpB,KACpB,KAEoB,OAAM,IAAI,MAAMA,CAAM,CAE1C,EAEQ,OAAO3G,CACf,CACA,EC5aa6G,GAAN,KAAgB,CAEnB,YAAYlH,EAAS,CADrBC,GAAA,gBAEI,KAAK,QAAUD,GAAWhE,EAClC,CACI,KAAKmL,EAAMC,EAAYhJ,EAAS,OAC5B,IAAMiJ,GAAQ/D,GAAA8D,GAAc,IAAI,MAAM,MAAM,IAA9B,YAAA9D,EAAkC,GAEhD,OADA6D,EAAOA,EAAK,QAAQ,MAAO,EAAE,EAAI;EAC5BE,EAKE,8BACD3K,GAAO2K,CAAI,EACX,MACCjJ,EAAU+I,EAAOzK,GAAOyK,EAAM,EAAI,GACnC;EARK,eACA/I,EAAU+I,EAAOzK,GAAOyK,EAAM,EAAI,GACnC;CAOlB,CACI,WAAWG,EAAO,CACd,MAAO;EAAiBA,CAAK;CACrC,CACI,KAAK3K,EAAMqJ,EAAO,CACd,OAAOrJ,CACf,CACI,QAAQ4C,EAAMP,EAAOI,EAAK,CAEtB,MAAO,KAAKJ,CAAK,IAAIO,CAAI,MAAMP,CAAK;CAC5C,CACI,IAAK,CACD,MAAO;CACf,CACI,KAAKuI,EAAMC,EAASC,EAAO,CACvB,IAAMC,EAAOF,EAAU,KAAO,KACxBG,EAAYH,GAAWC,IAAU,EAAM,WAAaA,EAAQ,IAAO,GACzE,MAAO,IAAMC,EAAOC,EAAW;EAAQJ,EAAO,KAAOG,EAAO;CACpE,CACI,SAASnI,EAAMqI,EAAMC,EAAS,CAC1B,MAAO,OAAOtI,CAAI;CAC1B,CACI,SAASsI,EAAS,CACd,MAAO,WACAA,EAAU,cAAgB,IAC3B,8BACd,CACI,UAAUtI,EAAM,CACZ,MAAO,MAAMA,CAAI;CACzB,CACI,MAAM0C,EAAQsF,EAAM,CAChB,OAAIA,IACAA,EAAO,UAAUA,CAAI,YAClB;;EAEDtF,EACA;EACAsF,EACA;CACd,CACI,SAASO,EAAS,CACd,MAAO;EAASA,CAAO;CAC/B,CACI,UAAUA,EAASC,EAAO,CACtB,IAAML,EAAOK,EAAM,OAAS,KAAO,KAInC,OAHYA,EAAM,MACZ,IAAIL,CAAI,WAAWK,EAAM,KAAK,KAC9B,IAAIL,CAAI,KACDI,EAAU,KAAKJ,CAAI;CACxC,CAII,OAAOnI,EAAM,CACT,MAAO,WAAWA,CAAI,WAC9B,CACI,GAAGA,EAAM,CACL,MAAO,OAAOA,CAAI,OAC1B,CACI,SAASA,EAAM,CACX,MAAO,SAASA,CAAI,SAC5B,CACI,IAAK,CACD,MAAO,MACf,CACI,IAAIA,EAAM,CACN,MAAO,QAAQA,CAAI,QAC3B,CACI,KAAK5B,EAAM2B,EAAOC,EAAM,CACpB,IAAMyI,EAAYtK,GAASC,CAAI,EAC/B,GAAIqK,IAAc,KACd,OAAOzI,EAEX5B,EAAOqK,EACP,IAAIC,EAAM,YAActK,EAAO,IAC/B,OAAI2B,IACA2I,GAAO,WAAa3I,EAAQ,KAEhC2I,GAAO,IAAM1I,EAAO,OACb0I,CACf,CACI,MAAMtK,EAAM2B,EAAOC,EAAM,CACrB,IAAMyI,EAAYtK,GAASC,CAAI,EAC/B,GAAIqK,IAAc,KACd,OAAOzI,EAEX5B,EAAOqK,EACP,IAAIC,EAAM,aAAatK,CAAI,UAAU4B,CAAI,IACzC,OAAID,IACA2I,GAAO,WAAW3I,CAAK,KAE3B2I,GAAO,IACAA,CACf,CACI,KAAK1I,EAAM,CACP,OAAOA,CACf,CACA,ECpHa2I,GAAN,KAAoB,CAEvB,OAAO3I,EAAM,CACT,OAAOA,CACf,CACI,GAAGA,EAAM,CACL,OAAOA,CACf,CACI,SAASA,EAAM,CACX,OAAOA,CACf,CACI,IAAIA,EAAM,CACN,OAAOA,CACf,CACI,KAAKA,EAAM,CACP,OAAOA,CACf,CACI,KAAKA,EAAM,CACP,OAAOA,CACf,CACI,KAAK5B,EAAM2B,EAAOC,EAAM,CACpB,MAAO,GAAKA,CACpB,CACI,MAAM5B,EAAM2B,EAAOC,EAAM,CACrB,MAAO,GAAKA,CACpB,CACI,IAAK,CACD,MAAO,EACf,CACA,EC1Ba4I,GAAN,MAAMC,CAAQ,CAIjB,YAAYpI,EAAS,CAHrBC,GAAA,gBACAA,GAAA,iBACAA,GAAA,qBAEI,KAAK,QAAUD,GAAWhE,GAC1B,KAAK,QAAQ,SAAW,KAAK,QAAQ,UAAY,IAAIkL,GACrD,KAAK,SAAW,KAAK,QAAQ,SAC7B,KAAK,SAAS,QAAU,KAAK,QAC7B,KAAK,aAAe,IAAIgB,EAChC,CAII,OAAO,MAAM7H,EAAQL,EAAS,CAE1B,OADe,IAAIoI,EAAQpI,CAAO,EACpB,MAAMK,CAAM,CAClC,CAII,OAAO,YAAYA,EAAQL,EAAS,CAEhC,OADe,IAAIoI,EAAQpI,CAAO,EACpB,YAAYK,CAAM,CACxC,CAII,MAAMA,EAAQD,EAAM,GAAM,CACtB,IAAI6H,EAAM,GACV,QAAS1J,EAAI,EAAGA,EAAI8B,EAAO,OAAQ9B,IAAK,CACpC,IAAMiB,EAAQa,EAAO9B,CAAC,EAEtB,GAAI,KAAK,QAAQ,YAAc,KAAK,QAAQ,WAAW,WAAa,KAAK,QAAQ,WAAW,UAAUiB,EAAM,IAAI,EAAG,CAC/G,IAAM6I,EAAe7I,EACf8I,EAAM,KAAK,QAAQ,WAAW,UAAUD,EAAa,IAAI,EAAE,KAAK,CAAE,OAAQ,IAAI,EAAIA,CAAY,EACpG,GAAIC,IAAQ,IAAS,CAAC,CAAC,QAAS,KAAM,UAAW,OAAQ,QAAS,aAAc,OAAQ,OAAQ,YAAa,MAAM,EAAE,SAASD,EAAa,IAAI,EAAG,CAC9IJ,GAAOK,GAAO,GACd,QACpB,CACA,CACY,OAAQ9I,EAAM,KAAI,CACd,IAAK,QACD,SAEJ,IAAK,KAAM,CACPyI,GAAO,KAAK,SAAS,GAAE,EACvB,QACpB,CACgB,IAAK,UAAW,CACZ,IAAMM,EAAe/I,EACrByI,GAAO,KAAK,SAAS,QAAQ,KAAK,YAAYM,EAAa,MAAM,EAAGA,EAAa,MAAOzL,GAAS,KAAK,YAAYyL,EAAa,OAAQ,KAAK,YAAY,CAAC,CAAC,EAC1J,QACpB,CACgB,IAAK,OAAQ,CACT,IAAMC,EAAYhJ,EAClByI,GAAO,KAAK,SAAS,KAAKO,EAAU,KAAMA,EAAU,KAAM,CAAC,CAACA,EAAU,OAAO,EAC7E,QACpB,CACgB,IAAK,QAAS,CACV,IAAMC,EAAajJ,EACfyC,EAAS,GAETC,EAAO,GACX,QAASwG,EAAI,EAAGA,EAAID,EAAW,OAAO,OAAQC,IAC1CxG,GAAQ,KAAK,SAAS,UAAU,KAAK,YAAYuG,EAAW,OAAOC,CAAC,EAAE,MAAM,EAAG,CAAE,OAAQ,GAAM,MAAOD,EAAW,MAAMC,CAAC,CAAC,CAAE,EAE/HzG,GAAU,KAAK,SAAS,SAASC,CAAI,EACrC,IAAIqF,EAAO,GACX,QAASmB,EAAI,EAAGA,EAAID,EAAW,KAAK,OAAQC,IAAK,CAC7C,IAAM1K,EAAMyK,EAAW,KAAKC,CAAC,EAC7BxG,EAAO,GACP,QAASyG,EAAI,EAAGA,EAAI3K,EAAI,OAAQ2K,IAC5BzG,GAAQ,KAAK,SAAS,UAAU,KAAK,YAAYlE,EAAI2K,CAAC,EAAE,MAAM,EAAG,CAAE,OAAQ,GAAO,MAAOF,EAAW,MAAME,CAAC,CAAC,CAAE,EAElHpB,GAAQ,KAAK,SAAS,SAASrF,CAAI,CAC3D,CACoB+F,GAAO,KAAK,SAAS,MAAMhG,EAAQsF,CAAI,EACvC,QACpB,CACgB,IAAK,aAAc,CACf,IAAMqB,EAAkBpJ,EAClB+H,EAAO,KAAK,MAAMqB,EAAgB,MAAM,EAC9CX,GAAO,KAAK,SAAS,WAAWV,CAAI,EACpC,QACpB,CACgB,IAAK,OAAQ,CACT,IAAMsB,EAAYrJ,EACZgI,EAAUqB,EAAU,QACpBpB,EAAQoB,EAAU,MAClBC,EAAQD,EAAU,MACpBtB,EAAO,GACX,QAASmB,EAAI,EAAGA,EAAIG,EAAU,MAAM,OAAQH,IAAK,CAC7C,IAAM3G,EAAO8G,EAAU,MAAMH,CAAC,EACxBb,EAAU9F,EAAK,QACf6F,EAAO7F,EAAK,KACdgH,EAAW,GACf,GAAIhH,EAAK,KAAM,CACX,IAAMiH,EAAW,KAAK,SAAS,SAAS,CAAC,CAACnB,CAAO,EAC7CiB,EACI/G,EAAK,OAAO,OAAS,GAAKA,EAAK,OAAO,CAAC,EAAE,OAAS,aAClDA,EAAK,OAAO,CAAC,EAAE,KAAOiH,EAAW,IAAMjH,EAAK,OAAO,CAAC,EAAE,KAClDA,EAAK,OAAO,CAAC,EAAE,QAAUA,EAAK,OAAO,CAAC,EAAE,OAAO,OAAS,GAAKA,EAAK,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,OAAS,SAC/FA,EAAK,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,KAAOiH,EAAW,IAAMjH,EAAK,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,OAI9EA,EAAK,OAAO,QAAQ,CAChB,KAAM,OACN,KAAMiH,EAAW,GACzD,CAAqC,EAILD,GAAYC,EAAW,GAEvD,CACwBD,GAAY,KAAK,MAAMhH,EAAK,OAAQ+G,CAAK,EACzCvB,GAAQ,KAAK,SAAS,SAASwB,EAAUnB,EAAM,CAAC,CAACC,CAAO,CAChF,CACoBI,GAAO,KAAK,SAAS,KAAKV,EAAMC,EAASC,CAAK,EAC9C,QACpB,CACgB,IAAK,OAAQ,CACT,IAAMwB,EAAYzJ,EAClByI,GAAO,KAAK,SAAS,KAAKgB,EAAU,KAAMA,EAAU,KAAK,EACzD,QACpB,CACgB,IAAK,YAAa,CACd,IAAMC,EAAiB1J,EACvByI,GAAO,KAAK,SAAS,UAAU,KAAK,YAAYiB,EAAe,MAAM,CAAC,EACtE,QACpB,CACgB,IAAK,OAAQ,CACT,IAAIC,EAAY3J,EACZ+H,EAAO4B,EAAU,OAAS,KAAK,YAAYA,EAAU,MAAM,EAAIA,EAAU,KAC7E,KAAO5K,EAAI,EAAI8B,EAAO,QAAUA,EAAO9B,EAAI,CAAC,EAAE,OAAS,QACnD4K,EAAY9I,EAAO,EAAE9B,CAAC,EACtBgJ,GAAQ;GAAQ4B,EAAU,OAAS,KAAK,YAAYA,EAAU,MAAM,EAAIA,EAAU,MAEtFlB,GAAO7H,EAAM,KAAK,SAAS,UAAUmH,CAAI,EAAIA,EAC7C,QACpB,CACgB,QAAS,CACL,IAAMP,EAAS,eAAiBxH,EAAM,KAAO,wBAC7C,GAAI,KAAK,QAAQ,OACb,eAAQ,MAAMwH,CAAM,EACb,GAGP,MAAM,IAAI,MAAMA,CAAM,CAE9C,CACA,CACA,CACQ,OAAOiB,CACf,CAII,YAAY5H,EAAQ+I,EAAU,CAC1BA,EAAWA,GAAY,KAAK,SAC5B,IAAInB,EAAM,GACV,QAAS1J,EAAI,EAAGA,EAAI8B,EAAO,OAAQ9B,IAAK,CACpC,IAAMiB,EAAQa,EAAO9B,CAAC,EAEtB,GAAI,KAAK,QAAQ,YAAc,KAAK,QAAQ,WAAW,WAAa,KAAK,QAAQ,WAAW,UAAUiB,EAAM,IAAI,EAAG,CAC/G,IAAM8I,EAAM,KAAK,QAAQ,WAAW,UAAU9I,EAAM,IAAI,EAAE,KAAK,CAAE,OAAQ,IAAI,EAAIA,CAAK,EACtF,GAAI8I,IAAQ,IAAS,CAAC,CAAC,SAAU,OAAQ,OAAQ,QAAS,SAAU,KAAM,WAAY,KAAM,MAAO,MAAM,EAAE,SAAS9I,EAAM,IAAI,EAAG,CAC7HyI,GAAOK,GAAO,GACd,QACpB,CACA,CACY,OAAQ9I,EAAM,KAAI,CACd,IAAK,SAAU,CACX,IAAM6J,EAAc7J,EACpByI,GAAOmB,EAAS,KAAKC,EAAY,IAAI,EACrC,KACpB,CACgB,IAAK,OAAQ,CACT,IAAMC,EAAW9J,EACjByI,GAAOmB,EAAS,KAAKE,EAAS,IAAI,EAClC,KACpB,CACgB,IAAK,OAAQ,CACT,IAAMC,EAAY/J,EAClByI,GAAOmB,EAAS,KAAKG,EAAU,KAAMA,EAAU,MAAO,KAAK,YAAYA,EAAU,OAAQH,CAAQ,CAAC,EAClG,KACpB,CACgB,IAAK,QAAS,CACV,IAAMI,EAAahK,EACnByI,GAAOmB,EAAS,MAAMI,EAAW,KAAMA,EAAW,MAAOA,EAAW,IAAI,EACxE,KACpB,CACgB,IAAK,SAAU,CACX,IAAMC,EAAcjK,EACpByI,GAAOmB,EAAS,OAAO,KAAK,YAAYK,EAAY,OAAQL,CAAQ,CAAC,EACrE,KACpB,CACgB,IAAK,KAAM,CACP,IAAMM,EAAUlK,EAChByI,GAAOmB,EAAS,GAAG,KAAK,YAAYM,EAAQ,OAAQN,CAAQ,CAAC,EAC7D,KACpB,CACgB,IAAK,WAAY,CACb,IAAMO,EAAgBnK,EACtByI,GAAOmB,EAAS,SAASO,EAAc,IAAI,EAC3C,KACpB,CACgB,IAAK,KAAM,CACP1B,GAAOmB,EAAS,GAAE,EAClB,KACpB,CACgB,IAAK,MAAO,CACR,IAAMQ,EAAWpK,EACjByI,GAAOmB,EAAS,IAAI,KAAK,YAAYQ,EAAS,OAAQR,CAAQ,CAAC,EAC/D,KACpB,CACgB,IAAK,OAAQ,CACT,IAAMD,EAAY3J,EAClByI,GAAOmB,EAAS,KAAKD,EAAU,IAAI,EACnC,KACpB,CACgB,QAAS,CACL,IAAMnC,EAAS,eAAiBxH,EAAM,KAAO,wBAC7C,GAAI,KAAK,QAAQ,OACb,eAAQ,MAAMwH,CAAM,EACb,GAGP,MAAM,IAAI,MAAMA,CAAM,CAE9C,CACA,CACA,CACQ,OAAOiB,CACf,CACA,ECnPa4B,GAAN,KAAa,CAEhB,YAAY7J,EAAS,CADrBC,GAAA,gBAEI,KAAK,QAAUD,GAAWhE,EAClC,CASI,WAAW8N,EAAU,CACjB,OAAOA,CACf,CAII,YAAYnN,EAAM,CACd,OAAOA,CACf,CAII,iBAAiB0D,EAAQ,CACrB,OAAOA,CACf,CACA,EAvBIJ,GALS4J,GAKF,mBAAmB,IAAI,IAAI,CAC9B,aACA,cACA,kBACR,CAAK,mBCFQE,GAAN,KAAa,CAWhB,eAAeC,EAAM,CAgOrBC,GAAA,KAAAC,IAsDAD,GAAA,KAAAE,IAhSAlK,GAAA,gBAAWlE,GAAY,GACvBkE,GAAA,eAAU,KAAK,YACfA,GAAA,aAAQmK,GAAA,KAAKF,GAAAG,IAAL,UAAoBnE,GAAO,IAAKiC,GAAQ,QAChDlI,GAAA,mBAAcmK,GAAA,KAAKF,GAAAG,IAAL,UAAoBnE,GAAO,UAAWiC,GAAQ,cAC5DlI,GAAA,cAASkI,IACTlI,GAAA,gBAAWiH,IACXjH,GAAA,oBAAeiI,IACfjI,GAAA,aAAQiG,IACRjG,GAAA,iBAAYF,IACZE,GAAA,aAAQ4J,IAEJ,KAAK,IAAI,GAAGG,CAAI,CACxB,CAII,WAAW3J,EAAQiK,EAAU,SACzB,IAAIC,EAAS,CAAA,EACb,QAAW/K,KAASa,EAEhB,OADAkK,EAASA,EAAO,OAAOD,EAAS,KAAK,KAAM9K,CAAK,CAAC,EACzCA,EAAM,KAAI,CACd,IAAK,QAAS,CACV,IAAMiJ,EAAajJ,EACnB,QAAW0C,KAAQuG,EAAW,OAC1B8B,EAASA,EAAO,OAAO,KAAK,WAAWrI,EAAK,OAAQoI,CAAQ,CAAC,EAEjE,QAAWtM,KAAOyK,EAAW,KACzB,QAAWvG,KAAQlE,EACfuM,EAASA,EAAO,OAAO,KAAK,WAAWrI,EAAK,OAAQoI,CAAQ,CAAC,EAGrE,KACpB,CACgB,IAAK,OAAQ,CACT,IAAMzB,EAAYrJ,EAClB+K,EAASA,EAAO,OAAO,KAAK,WAAW1B,EAAU,MAAOyB,CAAQ,CAAC,EACjE,KACpB,CACgB,QAAS,CACL,IAAMjC,EAAe7I,GACjB6D,GAAAC,EAAA,KAAK,SAAS,aAAd,YAAAA,EAA0B,cAA1B,MAAAD,EAAwCgF,EAAa,MACrD,KAAK,SAAS,WAAW,YAAYA,EAAa,IAAI,EAAE,QAASmC,GAAgB,CAC7ED,EAASA,EAAO,OAAO,KAAK,WAAWlC,EAAamC,CAAW,EAAGF,CAAQ,CAAC,CACvG,CAAyB,EAEIjC,EAAa,SAClBkC,EAASA,EAAO,OAAO,KAAK,WAAWlC,EAAa,OAAQiC,CAAQ,CAAC,EAE7F,CACA,CAEQ,OAAOC,CACf,CACI,OAAOP,EAAM,CACT,IAAMS,EAAa,KAAK,SAAS,YAAc,CAAE,UAAW,CAAA,EAAI,YAAa,CAAA,CAAE,EAC/E,OAAAT,EAAK,QAASU,GAAS,CAEnB,IAAMC,EAAOjG,GAAA,GAAKgG,GA8DlB,GA5DAC,EAAK,MAAQ,KAAK,SAAS,OAASA,EAAK,OAAS,GAE9CD,EAAK,aACLA,EAAK,WAAW,QAASE,GAAQ,CAC7B,GAAI,CAACA,EAAI,KACL,MAAM,IAAI,MAAM,yBAAyB,EAE7C,GAAI,aAAcA,EAAK,CACnB,IAAMC,EAAeJ,EAAW,UAAUG,EAAI,IAAI,EAC9CC,EAEAJ,EAAW,UAAUG,EAAI,IAAI,EAAI,YAAaZ,EAAM,CAChD,IAAI1B,EAAMsC,EAAI,SAAS,MAAM,KAAMZ,CAAI,EACvC,OAAI1B,IAAQ,KACRA,EAAMuC,EAAa,MAAM,KAAMb,CAAI,GAEhC1B,CACvC,EAG4BmC,EAAW,UAAUG,EAAI,IAAI,EAAIA,EAAI,QAEjE,CACoB,GAAI,cAAeA,EAAK,CACpB,GAAI,CAACA,EAAI,OAAUA,EAAI,QAAU,SAAWA,EAAI,QAAU,SACtD,MAAM,IAAI,MAAM,6CAA6C,EAEjE,IAAME,EAAWL,EAAWG,EAAI,KAAK,EACjCE,EACAA,EAAS,QAAQF,EAAI,SAAS,EAG9BH,EAAWG,EAAI,KAAK,EAAI,CAACA,EAAI,SAAS,EAEtCA,EAAI,QACAA,EAAI,QAAU,QACVH,EAAW,WACXA,EAAW,WAAW,KAAKG,EAAI,KAAK,EAGpCH,EAAW,WAAa,CAACG,EAAI,KAAK,EAGjCA,EAAI,QAAU,WACfH,EAAW,YACXA,EAAW,YAAY,KAAKG,EAAI,KAAK,EAGrCH,EAAW,YAAc,CAACG,EAAI,KAAK,GAIvE,CACwB,gBAAiBA,GAAOA,EAAI,cAC5BH,EAAW,YAAYG,EAAI,IAAI,EAAIA,EAAI,YAE/D,CAAiB,EACDD,EAAK,WAAaF,GAGlBC,EAAK,SAAU,CACf,IAAMtB,EAAW,KAAK,SAAS,UAAY,IAAIlC,GAAU,KAAK,QAAQ,EACtE,QAAW6D,KAAQL,EAAK,SAAU,CAC9B,GAAI,EAAEK,KAAQ3B,GACV,MAAM,IAAI,MAAM,aAAa2B,CAAI,kBAAkB,EAEvD,GAAIA,IAAS,UAET,SAEJ,IAAMC,EAAeD,EACfE,EAAeP,EAAK,SAASM,CAAY,EACzCH,EAAezB,EAAS4B,CAAY,EAE1C5B,EAAS4B,CAAY,EAAI,IAAIhB,IAAS,CAClC,IAAI1B,EAAM2C,EAAa,MAAM7B,EAAUY,CAAI,EAC3C,OAAI1B,IAAQ,KACRA,EAAMuC,EAAa,MAAMzB,EAAUY,CAAI,GAEpC1B,GAAO,EACtC,CACA,CACgBqC,EAAK,SAAWvB,CAChC,CACY,GAAIsB,EAAK,UAAW,CAChB,IAAMQ,EAAY,KAAK,SAAS,WAAa,IAAInL,GAAW,KAAK,QAAQ,EACzE,QAAWgL,KAAQL,EAAK,UAAW,CAC/B,GAAI,EAAEK,KAAQG,GACV,MAAM,IAAI,MAAM,cAAcH,CAAI,kBAAkB,EAExD,GAAI,CAAC,UAAW,QAAS,OAAO,EAAE,SAASA,CAAI,EAE3C,SAEJ,IAAMI,EAAgBJ,EAChBK,EAAgBV,EAAK,UAAUS,CAAa,EAC5CE,EAAgBH,EAAUC,CAAa,EAG7CD,EAAUC,CAAa,EAAI,IAAInB,IAAS,CACpC,IAAI1B,EAAM8C,EAAc,MAAMF,EAAWlB,CAAI,EAC7C,OAAI1B,IAAQ,KACRA,EAAM+C,EAAc,MAAMH,EAAWlB,CAAI,GAEtC1B,CAC/B,CACA,CACgBqC,EAAK,UAAYO,CACjC,CAEY,GAAIR,EAAK,MAAO,CACZ,IAAMY,EAAQ,KAAK,SAAS,OAAS,IAAIzB,GACzC,QAAWkB,KAAQL,EAAK,MAAO,CAC3B,GAAI,EAAEK,KAAQO,GACV,MAAM,IAAI,MAAM,SAASP,CAAI,kBAAkB,EAEnD,GAAIA,IAAS,UAET,SAEJ,IAAMQ,EAAYR,EACZS,EAAYd,EAAK,MAAMa,CAAS,EAChCE,EAAWH,EAAMC,CAAS,EAC5B1B,GAAO,iBAAiB,IAAIkB,CAAI,EAEhCO,EAAMC,CAAS,EAAKG,GAAQ,CACxB,GAAI,KAAK,SAAS,MACd,OAAO,QAAQ,QAAQF,EAAU,KAAKF,EAAOI,CAAG,CAAC,EAAE,KAAKpD,GAC7CmD,EAAS,KAAKH,EAAOhD,CAAG,CAClC,EAEL,IAAMA,EAAMkD,EAAU,KAAKF,EAAOI,CAAG,EACrC,OAAOD,EAAS,KAAKH,EAAOhD,CAAG,CAC3D,EAIwBgD,EAAMC,CAAS,EAAI,IAAIvB,IAAS,CAC5B,IAAI1B,EAAMkD,EAAU,MAAMF,EAAOtB,CAAI,EACrC,OAAI1B,IAAQ,KACRA,EAAMmD,EAAS,MAAMH,EAAOtB,CAAI,GAE7B1B,CACnC,CAEA,CACgBqC,EAAK,MAAQW,CAC7B,CAEY,GAAIZ,EAAK,WAAY,CACjB,IAAMiB,EAAa,KAAK,SAAS,WAC3BC,EAAiBlB,EAAK,WAC5BC,EAAK,WAAa,SAAUnL,EAAO,CAC/B,IAAI+K,EAAS,CAAA,EACb,OAAAA,EAAO,KAAKqB,EAAe,KAAK,KAAMpM,CAAK,CAAC,EACxCmM,IACApB,EAASA,EAAO,OAAOoB,EAAW,KAAK,KAAMnM,CAAK,CAAC,GAEhD+K,CAC3B,CACA,CACY,KAAK,SAAW7F,MAAA,GAAK,KAAK,UAAaiG,EACnD,CAAS,EACM,IACf,CACI,WAAWvN,EAAK,CACZ,YAAK,SAAWsH,MAAA,GAAK,KAAK,UAAatH,GAChC,IACf,CACI,MAAM8C,EAAKF,EAAS,CAChB,OAAOkG,GAAO,IAAIhG,EAAKF,GAAA,KAAAA,EAAW,KAAK,QAAQ,CACvD,CACI,OAAOK,EAAQL,EAAS,CACpB,OAAOmI,GAAQ,MAAM9H,EAAQL,GAAA,KAAAA,EAAW,KAAK,QAAQ,CAC7D,CAyEA,EAxEIkK,GAAA,YAAAG,GAAc,SAAChL,EAAOwM,EAAQ,CAC1B,MAAO,CAAC3L,EAAKF,IAAY,CACrB,IAAM8L,EAAUpH,GAAA,GAAK1E,GACf5C,EAAMsH,MAAA,GAAK,KAAK,UAAaoH,GAE/B,KAAK,SAAS,QAAU,IAAQA,EAAQ,QAAU,KAC7C1O,EAAI,QACL,QAAQ,KAAK,oHAAoH,EAErIA,EAAI,MAAQ,IAEhB,IAAM2O,EAAa3B,GAAA,KAAKD,GAAA6B,IAAL,UAAc,CAAC,CAAC5O,EAAI,OAAQ,CAAC,CAACA,EAAI,OAErD,GAAI,OAAO8C,EAAQ,KAAeA,IAAQ,KACtC,OAAO6L,EAAW,IAAI,MAAM,gDAAgD,CAAC,EAEjF,GAAI,OAAO7L,GAAQ,SACf,OAAO6L,EAAW,IAAI,MAAM,wCACtB,OAAO,UAAU,SAAS,KAAK7L,CAAG,EAAI,mBAAmB,CAAC,EAKpE,GAHI9C,EAAI,QACJA,EAAI,MAAM,QAAUA,GAEpBA,EAAI,MACJ,OAAO,QAAQ,QAAQA,EAAI,MAAQA,EAAI,MAAM,WAAW8C,CAAG,EAAIA,CAAG,EAC7D,KAAKA,GAAOb,EAAMa,EAAK9C,CAAG,CAAC,EAC3B,KAAKiD,GAAUjD,EAAI,MAAQA,EAAI,MAAM,iBAAiBiD,CAAM,EAAIA,CAAM,EACtE,KAAKA,GAAUjD,EAAI,WAAa,QAAQ,IAAI,KAAK,WAAWiD,EAAQjD,EAAI,UAAU,CAAC,EAAE,KAAK,IAAMiD,CAAM,EAAIA,CAAM,EAChH,KAAKA,GAAUwL,EAAOxL,EAAQjD,CAAG,CAAC,EAClC,KAAKT,GAAQS,EAAI,MAAQA,EAAI,MAAM,YAAYT,CAAI,EAAIA,CAAI,EAC3D,MAAMoP,CAAU,EAEzB,GAAI,CACI3O,EAAI,QACJ8C,EAAM9C,EAAI,MAAM,WAAW8C,CAAG,GAElC,IAAIG,EAAShB,EAAMa,EAAK9C,CAAG,EACvBA,EAAI,QACJiD,EAASjD,EAAI,MAAM,iBAAiBiD,CAAM,GAE1CjD,EAAI,YACJ,KAAK,WAAWiD,EAAQjD,EAAI,UAAU,EAE1C,IAAIT,EAAOkP,EAAOxL,EAAQjD,CAAG,EAC7B,OAAIA,EAAI,QACJT,EAAOS,EAAI,MAAM,YAAYT,CAAI,GAE9BA,CACvB,OACmBsP,EAAG,CACN,OAAOF,EAAWE,CAAC,CACnC,CACA,CACA,EACI9B,GAAA,YAAA6B,GAAQ,SAACE,EAAQC,EAAO,CACpB,OAAQF,GAAM,CAEV,GADAA,EAAE,SAAW;2DACTC,EAAQ,CACR,IAAME,EAAM,iCACN1P,GAAOuP,EAAE,QAAU,GAAI,EAAI,EAC3B,SACN,OAAIE,EACO,QAAQ,QAAQC,CAAG,EAEvBA,CACvB,CACY,GAAID,EACA,OAAO,QAAQ,OAAOF,CAAC,EAE3B,MAAMA,CAClB,CACA,EClTA,IAAMI,GAAiB,IAAItC,GACpB,SAASuC,GAAOpM,EAAK9C,EAAK,CAC7B,OAAOiP,GAAe,MAAMnM,EAAK9C,CAAG,CACxC,CAMAkP,GAAO,QACHA,GAAO,WAAa,SAAUtM,EAAS,CACnC,OAAAqM,GAAe,WAAWrM,CAAO,EACjCsM,GAAO,SAAWD,GAAe,SACjCpQ,GAAeqQ,GAAO,QAAQ,EACvBA,EACf,EAIAA,GAAO,YAAcvQ,GACrBuQ,GAAO,SAAWtQ,GAIlBsQ,GAAO,IAAM,YAAatC,EAAM,CAC5B,OAAAqC,GAAe,IAAI,GAAGrC,CAAI,EAC1BsC,GAAO,SAAWD,GAAe,SACjCpQ,GAAeqQ,GAAO,QAAQ,EACvBA,EACX,EAIAA,GAAO,WAAa,SAAUjM,EAAQiK,EAAU,CAC5C,OAAO+B,GAAe,WAAWhM,EAAQiK,CAAQ,CACrD,EAQAgC,GAAO,YAAcD,GAAe,YAIpCC,GAAO,OAASnE,GAChBmE,GAAO,OAASnE,GAAQ,MACxBmE,GAAO,SAAWpF,GAClBoF,GAAO,aAAepE,GACtBoE,GAAO,MAAQpG,GACfoG,GAAO,MAAQpG,GAAO,IACtBoG,GAAO,UAAYvM,GACnBuM,GAAO,MAAQzC,GACfyC,GAAO,MAAQA,GACH,IAACtM,IAAUsM,GAAO,QACjBC,IAAaD,GAAO,WACpBE,IAAMF,GAAO,IACbX,IAAaW,GAAO,WACpBG,IAAcH,GAAO,YAEtB,IAACI,IAASC,GAAQ,MACjBC,IAAQC,GAAO,ICtE5B,IAAAC,GAAsB,WAEtBC,GAAO,WAAW,CAChB,SAAU,GACV,IAAK,EACP,CAAC,EAEM,IAAMC,GAAa,SAASC,EAAK,CACtC,OAAKA,EACE,GAAAC,QAAU,SAASH,GAAO,MAAME,CAAG,CAAC,EAD1B,EAEnB,ECJA,IAAAE,GACS,SAAAC,EAAA,cAAAA,CAAA,CAAA,GCGT,IAAAC,GAAAC,GAAAC,EAAA,ECFA,IAAAC,GAAA,SAAAC,EAAA,CACM,IAAAC,EAAAC,GAAAF,CAAA,SAAA,SAAAG,EAAA,QAAAF,EAAAF,GAAAI,CAAA,CAAA,gBCmDN,IAAAC,GAAA,UAAA,QAAA,SAAAC,EAAA,oBAAA,SAAAC,EAAA,mBAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,oBAY4CJ,CAAA,EAAMC,CAAA,EAAEC,CAAA,EAAUC,CAAA,EAAO,SAAAE,EAAA,iBAASD,EAATC,CAAA,CAAA,0LCyDf,mGAvFtDC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EASAC,GAAA,UAAA,yCApBAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,yCA8CAC,GAAA,UAAA,oBATAC,GAAA,SAAAC,EAAA,WACgB,SAAAC,EAAA,oBAAW,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,sGAwJvBH,GAAAI,EAAA,KAmDeJ,GAAAK,EAAA,EAzMnBC,GAAA,SAAAL,EAAA,WACa,SAAAC,EAAA,iBAAQ,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,yGA2KjBG,GAAAF,EAAA,EAlLJG,GAAA,SAAAN,EAAA,WACW,SAAAC,EAAA,eAAM,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,2GAwJHI,GAAAF,EAAA,KAEVE,GAAAH,EAAA,EAlJJI,GAAA,SAAAP,EAAA,WACiB,SAAAC,EAAA,qBAAY,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,qGAyKzBK,GAAAJ,EAAA,EAjKJK,GAAA,SAAAC,EAAA,CAiIE,IAAAC,EAAA,SAAAC,EAAA,WAAgBA,EAAA,GAAA,EAAU,SAvH1BC,EAAA,SAAAC,EAAA,OACE,IAAMA,UACKA,YACE,QACL,WACG,sBAoHbC,EAAA,SAAAb,EAAA,CAGc,GAAdA,aAAAX,GAAoB,OAAAyB,GAAAC,GAAAC,EAAA,CAAA,EAClB,SAAAN,EAAA,iBACsBA,EAAA,GAAA,EAAA,UAAA,CAAQ,OAFhCV,EAAA,gBAEgCiB,GAAA,YAA9B,UAAA,kBACO,SAAAhB,EAAA,OAAA,oKAHTD,EAAA,WAGE,UAAA,eACY,SAAAC,EAAA,OAAA,oKAJdD,EAAA,gBAOc,GAPdA,aAAAV,GAOyB,OAAA4B,GACZ,SAAAjB,EAAA,uFARbD,EAAA,WAWc,GAXdA,aAAAR,qBAYE,SAAAkB,EAAA,oBAC0BA,EAAA,GAAA,CAAA,CAAA,CAAA,EAA1B,UAAA,yBAIY,GAjBdV,aAAAJ,qBAkBE,SAAAc,EAAA,oBAC0BA,EAAA,GAAA,CAAA,CAAA,CAAA,EAA1B,UAAA,eACO,SAAAT,EAAA,OAAA,sKAAa,UAGR,GAvBdD,aAAAP,GAuBoB,OAAAqB,GAAAC,GAAAC,EAAA,CAAA,EAClB,SAAAN,EAAA,kBACYA,CAAA,CAAA,EAAZ,UAAA,kBAzBFV,EAAA,MAAA,CAAA,EA0BE,UAAA,4BACA,UAAA,cA3BFA,EAAA,MAAA,EAAAmB,GA8BiBV,EAAMC,CAAA,CAAA,CAAA,CAAA,UAGT,GAjCdV,aAAAN,GAiCyB,OAAA0B,GAAAC,EAAA,EAAA,UAAA,CAErB,GAnCJrB,EAAA,kBAAAlB,GAmCS,OAAK,SAAAmB,EAAA,OAAA,yKAnCdD,EAAA,OAAA,SAoCI,GApCJA,EAAA,kBAAAjB,GAoCW,OAAK,SAAAkB,EAAA,OAAA,uKApChBD,EAAA,OAAA,SAqCI,GArCJA,EAAA,kBAAAhB,GAqCiB,OAAK,SAAAiB,EAAA,OAAA,iKArCtBD,EAAA,OAAA,SAsCI,GAtCJA,EAAA,kBAAAf,GAsCU,OAAK,SAAAgB,EAAA,OAAA,wKAtCfD,EAAA,OAAA,SAuCI,GAvCJA,EAAA,kBAAAd,GAuCa,OAAK,SAAAe,EAAA,OAAA,qKAvClBD,EAAA,OAAA,SAwCI,GAxCJA,EAAA,kBAAAb,GAwCY,OAAK,SAAAc,EAAA,OAAA,sKAxCjBD,EAAA,OAAA,kHAAAA,EAAA,OAAA,YAAA,IAAA,CAAA,MA2Ca,GA3CbA,aAAAT,gBA4Ca,SAAAU,EAAA,qFAAc,QAAzB,UAAA,cACkB,SAAAA,EAAA,qBAAlB,SAAAqB,EAAA,iBACkCA,CAAA,CAAA,CAAA,EAAlC,SAAAC,EAAA,sBAEE,GADGA,aAAAC,EACE,OAAAJ,GAAAC,EAAA,EAAuB,SAAApB,EAAA,OAAA,uKADzBsB,EAAA,UAEH,GAFGA,aAAAE,4HAAAF,EAAA,YAAA,IAAA,CAAA,MAAL,UAAA,WAGW,SAAAtB,EAAA,qFAAc,eAGb,GArDdD,aAAAL,GAqD0B,OAAA+B,GAAAC,GAAAC,GArD1B5B,EAAA,MAAA,CAAA,CAAA,EAsDE,UAAA,mBACA,SAAAsB,EAAA,4BACA,UAAA,CACI,IAAAO,EAAW,YAAAP,EAAA,eAAAA,EAAA,gBAAAA,EAAA,oBAAAA,EAAA,iBAAAA,EAAA,cAAAA,EAAA,UAAAA,EAAA,WAAAA,EAAA,aAAAA,EAAA,WAAAA,EAAA,YAA+B,GAAA,EAAc,GAAA,EAAiBA,EAAA,IAAA,mBACrDO,CAAA,CAAA,CAAA,EAAc,SAAA5B,EAAA,CACpC,GAAAA,aAAA6B,EAAK,OAAAJ,GAAAK,GAAAC,EAAA,EAAA,IAAAR,EAAAS,GAAAhC,EAAA,MAAA,CAAA,CAAA,CAAA,EACH,UAAA,+BAEF,GAAAA,aAAAiC,GAAAjC,EAAA,OAAA,QAAsC,KAAAA,EAAA,OAAA,OAAW,qBACxC4B,CAAA,CAAA,EAAP,UAAA,eACS,EAAA,IACX,GAAA5B,aAAAiC,EAAM,OAAAR,GAAAK,GAAAC,EAAA,EAAA,IAAAR,EAAAvB,EAAA,OAAA,IAAA,CAAA,CAAA,EACJ,UAAA,8QAlEND,EAAA,YAAA,IAAA,CAAA,GA9HAmC,EAAAC,GAAA,MAAA,EAWAC,EAAA,SAAArC,EAAA,CAYG,IAAAsC,EAAA,SAAArC,EAAA,WACM,CAAAsC,EAAU,kBAAAC,GAZnBxC,EAAA,GAAA,QAAA,EAY0D,WAAA,CAAA,CAAA,CAAA,EACrD,CAAAyC,GAAS,CAAAF,EAAS,WAAA,EAAAG,GAAqB,SAAAC,GAAA,gBAb5C3C,EAAA,GAAA,QAAA,MAa4E,CAAA4C,EAAO,QAAA,CAAA,CAAA,CAAA,CAAA,GA8FhFC,EAAAC,GAAoB,EAAA,EA3GvB9C,EAAA,GAAA,IAAA,EA2G2C,IADxC+C,EAAAC,GA1GHhD,EAAA,GAAA,IAAA,EAyGGiD,EAAA,SAAAC,EAAA,WAAsCf,EAAA,KAAA,GAAa,MAAAgB,GAAmBD,CAAA,IADtEE,EAAA,SAAAC,EAAA,WAA0ClB,EAAA,KAAA,GAAa,MAASkB,IAFhEC,EAAA,SAAAC,EAAA,QACc,SAAAC,GAAA,kBAAeD,EAAfC,EAAA,CAAA,IAxFdC,EAAA,SAAAxD,EAAA,WACO,CAAAsC,EAAS,SAAA,CAAA,CAAA,EACb,CAAAmB,GAAI,CAAAC,GAjBV3D,EAAA,GAAA,GAAA,EAAA4D,GAiBgC,QAAA,EAAArB,EAAkB,mBAAAC,GAjBlDxC,EAAA,GAAA,MAAA,EAiBwF,SAAA,CAAA,CAAA,CAAA,EAChF,CAAA4C,EAAA,UAAA,WAlBR5C,EAAA,GAAA,KAAA,EAkBiB,OAAA6D,GAAwB,aAlBzC7D,EAAA,GAAA,kBAoBU,CAAA2D,GApBV3D,EAAA,GAAA,GAAA,EAAAuC,EAoBiC,yBAAA,CAAA,CAAA,EAA4B,CAAAK,EApB7D5C,EAAA,GAAA,GAAA,CAAA,CAAA,EAAA0D,GAqBU,CAAAC,GAAAG,GAAmB,qBArB7B9D,EAAA,GAAA,GAAA,EAAA+D,GAAA/D,EAAA,GAAA,UAAA,CAAA,CAAA,EAAAuC,EAsBoB,8BAAAC,GAAAwB,GAAAD,GAtBpB/D,EAAA,GAAA,UAAA,CAAA,CAAA,EAsB6F,QAAA,CAAA,EAAA4D,GAC1E,QAAA,EAAAK,GAAgB,cAAA,CAAA,CAAA,EACzB,CAAA,UAAA,cAxBVjE,EAAA,GAAA,UAAA,CAAA,EAwBY,OAAAkE,KAA4C,QAAA,EAA5CtB,EAA0D,QAAA,aAE1D,CAAAL,EAAS,0BAAA,CAAA,CAAA,EAA6B,CAAA4B,GAAUtE,EAAA,EAAA,MAAA,EAAAuE,EAAA,EA1B5DpE,EAAA,GAAA,WAAA,EAAAqE,EAAA,CAAA,CAAA,EAAAC,GA2BY,CAAA/B,EAAS,MAAA,CAAA,CAAA,EAAAgC,GAAA,CAAAC,GA3BrBxE,EAAA,GAAA,IAAA,CAAA,EA4B2C,SAAA2C,GAAA,WACxB,SAAAO,GAAA,WAAU,CAAAX,EAAU,eAAAC,GAAAM,GAAgC,CAAA,EAAEI,EAAA,IAAO,GAAA,EAAK,UAAA,CAAA,EAAAS,GAClDV,EAAgBC,EAAA,CAAA,CAAA,CAAA,EACxB,CAAAN,EAAOM,EAAA,CAAA,CAAA,OACV,GAAA,EAhCxBlD,EAAA,GAAA,IAAA,CAAA,QAkCU,CAAAuC,EAAS,qBAAA,EAAAoB,GAA6BP,EAlChDpD,EAAA,GAAA,IAAA,CAAA,EAAAiE,GAkCmFpB,CAAA,CAAA,CAAA,EAC3E,CAAAD,EAAOG,CAAA,CAAA,CAAA,EAAA0B,GAGDtC,EAAA,IAAA,OAAA,EAAkB,SAAAQ,GAAA,WAClB,CAAAJ,EAAS,eAAA,CAAA,CAAA,EACb,CAAAE,GAAS,CAAAiC,GAAAC,GAAA,KAAA,EAAAjC,GAA8B,SAAAkC,GAAA,eAAY,EAAA,MAAa,8BAAA,CAAA,CAAA,EAAiC,CAAAhC,EAAO,cAAA,CAAA,CAAA,EAAA0B,GAClG,CAAA/B,EAAS,gBAAA,CAAA,CAAA,EACb,CAAAE,GAAS,CAAAiC,GAAAC,GAAA,KAAA,EAAAjC,GAA8B,SAAAkC,GAAA,eAAiB,EAAA,MAAc,iCAAApC,GA1ClFxC,EAAA,SAAA,EA0CwI,KAAA,CAAA,CAAA,CAAA,EAAS,CAAA4C,EAAO,QAAA,CAAA,CAAA,EAAAiC,GACpI,CAAAtC,EAAU,cAAAC,GAAA,CA3C9BxC,EAAA,SAAA,EA2CuE,KAAA,CAAA,CAAA,CAAA,EACzD,CAAAyC,GAAS,CAAAiC,GAAAC,GAAA,KAAA,EAAAjC,GAA8B,SAAAkC,GAAA,eAAiB,EAAA,MAAO,CAAAhC,EAAO,iBAAA,CAAA,CAAA,EAAAH,GAC7D,CAAAiC,GAAAC,GAAA,KAAA,EAAAjC,GAA8B,SAAAkC,GAAA,qBAAuB,KAAA,CAAA,CAAA,EAAQ,CAAAhC,EAAO,SAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,OAI7ET,EAAA,IAAA,OAAA,EAAkB,SAAAQ,GAAA,WAClB,CAAAJ,EAAS,SAAA,CAAA,CAAA,EAAAuC,GAlDvB9E,EAAA,GAAA,MAAA,EAoDY,CAAA4C,EAAO,UAAA,EAAAH,GACE,CAAAC,GAAU,SAAAkC,GAAA,qBAAwB,WAAA,CAAA,CAAA,EAAc,CAAAhC,EAAO,cAAA,CAAA,CAAA,CAAA,CAAA,CAAA,OA8CzEmC,EAAA,SAAAC,EAAA,QAAA,SAAA/E,GAAA,WACM,CAAAsC,EAAS,iBAAA,CAAA,CAAA,EAAoB,CAAAK,EAAOoC,CAAA,CAAA,CAAA,IA1C1CC,EAAA,SAAAhF,EAAA,WACM,CAAAsC,EAAS,qCAAA,CAAA,CAAA,EACb,CAAAkC,GAAAT,GA5DLhE,EAAA,QAAA,CAAA,EA6Da+E,EAAAjB,GAA8B,EAAA,EA7D3C9D,EAAA,QAAA,CAAA,CAAA,EAAAkF,GA8DY,CAAAC,GAAAxF,GAAA,MAAA,CAAA,CAAA,EACL,CAAAyF,GAAO,CAAAxC,EAAO,KAAA,CAAA,CAAA,EAAAyC,GACN,CAAAC,GAAAC,GAAA,KAAA,EAAAhD,EAA0B,mCAAA,EAAAiD,GAA+C,EAAA,EAAAC,GAAY,KAAA,EAAAC,GAhEpG1F,EAAA,QAAA,GAAA,EAAA2F,GAiEsDrC,EAAAxE,GAAA,MAAA,CAAA,CAAA,CAAA,EAAAsG,GACxC,CAAAxC,EAAO,OAAA,CAAA,CAAA,EAAA0B,GACR,CAAA/B,EAAQ,MAAA,CAAA,CAAA,EACR,CAAA8C,GAAO,CAAAC,GAAAM,GAAA,KAAA,EAAArD,EAA2B,qCAAA,EAAAkD,GAA6C,OAAA,EAAAC,GApE5F1F,EAAA,QAAA,KAAA,EAAA2F,GAqE6DrC,EAAAvE,GAAA,MAAA,CAAA,CAAA,CAAA,EAAA0D,GACvC,CAAAoD,GAtEtB7F,EAAA,OAAA,EAAA0E,GAAAC,GAAA,KAAA,EAAAjC,GAsEwE,SAAAC,GAAA,qBAA4B,uEAAAH,GAtEpGxC,EAAA,OAAA,EAsE8L,iBAAA,CAAA,CAAA,CAAA,EAAqB,CAAA4C,EAAO,OAAA,CAAA,CAAA,CAAA,CAAA,EAAAwC,GAE5M,CAAAxC,EAAO,aAAA,CAAA,CAAA,EAAAkD,GACH,CAAAvD,EAAS,2CAAA,EAAAkD,GAAmD,aAAA,EAAAM,GAAoB,CAAA,EAAAL,GAzElG1F,EAAA,QAAA,WAAA,EAAA2F,GA0EiErC,EAAAtE,GAAA,MAAA,CAAA,CAAA,CAAA,EAAAsF,GACpD,CAAA0B,GAAK,gBAAA,CAAA,CAAA,EACT,CAAAZ,GAAO,CAAAxC,EAAO,MAAA,CAAA,CAAA,EAAAyC,GACJ,CAAAW,GAAMvF,EA7EzBT,EAAA,OAAA,CAAA,EAAAsF,GAAAM,GAAA,KAAA,EAAArD,EA6EkE,oCAAA,EAAAkD,GAA4C,MAAA,EAAAQ,GAAAC,GAAA,KAAA,EAAAC,GACtD,gBAAA,EAAiB,KAAA,EAAAT,GA9EzE1F,EAAA,QAAA,IAAA,EAAA2F,GA+E2DrC,EAAArE,GAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAAqF,GAE9C,CAAA/B,EAAS,0BAAA,CAAA,CAAA,EACb,CAAA8C,GAAQ,CAAAC,GAAAc,GAAA,KAAA,EAAA7D,EAA+B,iBAAA,EAAAyD,GAAuB,cAAA,EAAAP,GAAqB,SAAA,EAAAY,GAlF5FrG,EAAA,QAAA,OAAA,EAAAsG,GAmF0DhD,EAAApE,GAAA,MAAA,CAAA,CAAA,CAAA,EAAA0D,EAC1C,GAAA,EAAA2D,GACC,CAAAC,GAAM,cAAA,EAAAjE,EAAwB,KAAA,CAAA,CAAA,EAAQ,CAAAK,EAAO,SAAA,CAAA,CAAA,EAAAA,EAC9C,GAAA,EAAAyC,GACC,CAAAC,GAAAc,GAAA,KAAA,EAAA7D,EAA+B,gBAAA,EAAAyD,GAAsB,aAAA,EAAAP,GAAoB,QAAA,EAAAY,GAvF1FrG,EAAA,QAAA,MAAA,EAAAsG,GAwFyDhD,EAAAnE,GAAA,MAAA,CAAA,CAAA,CAAA,EAAAyD,EACzC,GAAA,EAAA2D,GACC,CAAAC,GAAM,aAAA,CAAA,CAAA,EAAgB,CAAA5D,EAAO,SAAA,CAAA,CAAA,CAAA,CAAA,EAAAyC,GAE/B,CAAAC,GAAAmB,GAAA,KAAA,EAAAlE,EAA6B,kEAAA,EAAAmD,GAA2E,MAAA,CAAA,CAAA,EAAA9C,EACzG,GAAA,EAAAyC,GACC,CAAAC,GAAAoB,GAAA,KAAA,EAAAnE,EAA4B,8DAAA,EAAAmD,GAAuE,QAAA,EAAAhD,GACzF,SAAAC,GAAA,eAAY,EAAA,qBA9F/B,CAAAqD,GAAAW,GADN3G,EAAA,GAAA,GAAA,CAAA,EAAAuC,EACmC,6BAAAC,GADnCxC,EAAA,GAAA,OAAA,EACoF,UAAA,CAAA,CAAA,CAAA,EAChF,CAAAyE,GAAQtC,EAAA,IAAA,OAAA,EACJG,CAAA,EAAAsE,GAHR5G,EAAA,IAAA,EAKQiF,CAAA,EACAxB,CAAA,CAAA,CAAA,aAvBN,gBAAuB9C,EAAQH,CAAA,CAAA,SAC7B6B,UACiB,0GAA+BxB,4BCxD7B,4DApBzBgG,GAAA,UAAA,qHAOAC,GAAA,UAAA,oBAEAC,GAAA,SAAAC,EAAA,CASE,IAAAC,EAAA,SAAAC,EAAA,cAEiB,SAAAC,EAAA,WAAcL,EAAA,EAAUK,EAAA,GAAA,EAAAC,GAAaD,CAAA,CAAA,EAAA,MAAA,EAAAN,GAAA,OAAwBM,EAAA,GAAA,CAAA,IAAQD,CAAA,CAAA,GAEtFG,EAAA,SAAAC,EAAA,CACc,OAAAC,GAAAC,GACO,SAAAL,EAAA,QAAMA,EAAA,MAD3BG,EAAA,qBAXE,gBAAsBN,CAAA,SACpBC,UACiB,0GAA+BI,iDCEtD,IAAAI,GAAA,SAAAC,EAAA,CAuCE,IAAAC,EAAA,SAAAC,EAAA,WAGS,CAAA,EAAAC,GADI,SAAAC,EAAA,OAAM,CAAAC,GAAAC,EAAWF,CAAA,CAAA,OADnB;CAAA,EAAcF,CAAA,CAAA,CAAA,GAHzBK,EAAA,SAAAC,EAAA,WAA2BA,EAAA,OAAA,GA3B3BC,EAAA,SAAAC,EAAA,OACE,OAASA,wBAEI,QACL,KA8BVC,EAAA,SAAAC,EAAA,CACa,OAAAC,GAAA,MAAA,GArCbC,EAAAC,GAAA,MAAA,EA8BAC,EAAA,SAAAC,EAAA,WAA0CH,EAAA,KAAA,GAAa,UAAaG,IArBpEC,EAAA,SAAAN,EAAA,CAII,IAAAO,EAAA,SAAAX,EAAA,WACM,CAAAY,GAAAC,GAAWb,EAAA,EAAA,CAAA,EAAAc,EACD,yBAAA,UAAA,CACE,OAAGd,EAAA,OAAiB,GAAQ,iBACzC,CAAAe,GAAM,CAAAD,EAAS,SAAA,CAAA,CAAA,EACb,CAAAE,GAAI,CAAAC,GAAQT,EAAmBR,EAAA,IAAA,CAAA,EAAAc,EAAoB,kBAAA,CAAA,CAAA,EACjD,CAAAhB,EAAA,UAAA,UAAmBE,EAAA,KAAA,EAAV,OAAAkB,EAA0B,aAAkBlB,EAAA,kBAEjD,CAAAc,EAAS,0BAAA,CAAA,CAAA,EAA8BrB,EAAA0B,GAAmB,GAAA,EAAInB,EAAA,IAAA,CAAA,CAAA,EAAAgB,GAC/D,CAAAF,EAAS,qBAAA,EAAAM,GAAAC,GACMrB,EAAA,OAAA,EAAAsB,EAAA,EAAkBvB,EAAQC,CAAA,CAAA,CAAA,EAAAiB,GACjCT,EAAmBR,EAAA,IAAA,CAAA,CAAA,CAAA,EAC7B,CAAAF,EAAAuB,GAAa,MAAA,EAAAE,EAAA,EAASxB,EAAQC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,gBAd7BW,CAAA,EADfP,EAAA,KAAA,CAAA,aAfE,gBAAuBH,EAAQT,CAAA,CAAA,SAC7BkB,UACiB,0GAA+BP,kLC6EC,0FA/CvDqB,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EA9BAC,GAAA,UAAA,yCAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,yCAiBAC,GAAA,SAAAC,EAAA,WACa,SAAAC,EAAA,iBAAQ,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,qHAyJLH,GAAAI,EAAA,KAuCGJ,GAAAK,EAAA,EA9KnBC,GAAA,UAAA,oBAhBAC,GAAA,SAAAN,EAAA,WACkB,SAAAC,EAAA,sBAAa,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,gHA0I3BI,GAAAF,EAAA,KA8BiBE,GAAAH,EAAA,EAtKrBI,GAAA,SAAAP,EAAA,WACa,SAAAC,EAAA,iBAAQ,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,qHA2JjBK,GAAAH,EAAA,EAzJJI,GAAA,SAAAR,EAAA,WACiB,SAAAC,EAAA,qBAAY,SAAAA,EAAA,QAAA,SAAAC,EAAA,OAAA,iHAmKzBM,GAAAJ,EAAA,EApJJK,GAAA,SAAAC,EAAA,CA8GE,IAAAC,EAAA,SAAAC,EAAA,WAAuBA,EAAA,EAAA,EAAW,SApGlCC,EAAA,SAAAC,EAAA,OACE,MAAQA,YACKA,YACA,QACLA,EAAA,IAAY,YACP,sBAPfC,EAAAC,GAAA,MAAA,EAwGAC,EAAA,SAAAhB,EAAA,CACc,GAAdA,aAAAR,qBAGc,GAHdQ,aAAAP,GAGyB,OAAAwB,GAAAC,EAAA,EAAA,UAAA,CAErB,GALJlB,EAAA,kBAAAZ,GAKW,OAAK,SAAAa,EAAA,OAAA,mIALhBD,EAAA,OAAA,SAMI,GANJA,EAAA,kBAAAX,GAMU,OAAK,SAAAY,EAAA,OAAA,oIANfD,EAAA,OAAA,SAOI,GAPJA,EAAA,kBAAAV,GAOgB,OAAK,SAAAW,EAAA,OAAA,8HAPrBD,EAAA,OAAA,SAQI,GARJA,EAAA,kBAAAT,GAQY,OAAK,SAAAU,EAAA,OAAA,kIARjBD,EAAA,OAAA,kHAAAA,EAAA,OAAA,YAAA,IAAA,CAAA,MAWc,GAXdA,aAAAJ,GAWyB,OAAAuB,GACZ,SAAAlB,EAAA,uFAZbD,EAAA,WAec,GAfdA,aAAAH,qBAgBE,SAAAc,EAAA,oBAC8BA,EAAA,EAAA,CAAA,CAAA,CAAA,EAA9B,UAAA,WACW,SAAAV,EAAA,uFAAgB,WAGf,GArBdD,aAAAL,GAqBoB,OAAAyB,GAAAC,GAAAC,EAAA,CAAA,EAClB,SAAAX,EAAA,kBACcA,CAAA,CAAA,EAAd,UAAA,kBAvBFX,EAAA,MAAA,CAAA,EAwBE,UAAA,mBACA,SAAAuB,EAAA,OACK,GA1BPvB,EAAA,YA0BuCuB,CAAA,EAAG,MAAA,GACtC,MAAA,CAAAC,EAAA,GAAAA,EAAA,aAAAC,GAAAD,EAAA,EAAA,SAAA,6BACAE,GAAAC,GAAAC,GA5BJ5B,EAAA,MAAA,CAAA,EAAA6B,GA4BkDnB,EAAWC,CAAA,CAAA,CAAA,CAAA,UAI/C,GAhCdX,aAAAN,GAgC0B,OAAAoC,GAAAJ,GAAAK,GAhC1B/B,EAAA,MAAA,CAAA,CAAA,EAiCE,UAAA,mBACA,SAAAgC,EAAA,4BACA,UAAA,iBACoBA,CAAA,CAAA,CAAA,EAAe,SAAA/B,EAAA,CACjC,GAAAA,aAAAgC,EAAK,OAAAH,GAAAI,GAAAC,EAAA,EAAA,IAAAV,EAAAW,GAAAnC,EAAA,MAAA,CAAA,CAAA,CAAA,EACH,UAAA,+BAEF,GAAAA,aAAAoC,GAAApC,EAAA,OAAA,QAAsC,KAAAA,EAAA,OAAA,OAAW,sBAC/C,SAAAsB,EAAA,mBACA,SAAAe,EAAA,iBAC6BA,CAAA,CAAA,CAAA,EAA7B,SAAAC,EAAA,mBACA,SAAAC,EAAA,iBAC2BA,CAAA,CAAA,CAAA,EAA3B,SAAAC,EAAA,CA9JR,IAAAC,EAAAC,GA+JqCpB,CAAA,EAAG,MAAA,EAC9B,GAhKVmB,aAAAjB,GAAAiB,EAAA,SAAA,oCAiKU,GAjKVA,aAAAjB,GAAAiB,EAAA,SAAA,wCAkKoCD,CAAA,EAAaF,CAAA,CAAA,EAArC,OAAAK,KACeL,CAAA,EAAIC,CAAA,EADnBK,GAEeJ,CAAA,EAAID,CAAA,YACZR,EAAA,KAAgB,EAApB,OAAAc,cAC6ChC,EAAA,KAAA,CAAA,CAAA,EAAAiC,EAAA,CAAA,EAD7CjB,GAAAI,GAAAc,EAAA,EAGahB,CAAA,CAAA,EAAT,UAAA,eACS,EAAA,cACtB,GAAA/B,aAAAoC,EAAM,OAAAP,GAAAI,GAAAC,EAAA,EAAA,IAAAV,EAAAxB,EAAA,OAAA,IAAA,CAAA,CAAA,EACJ,UAAA,8QA1DND,EAAA,YAAA,IAAA,CAAA,GA9FAiD,EAAA,SAAAjD,EAAA,CAsFI,IAAAkD,EAAA,SAAAC,EAAA,WAGS,CAAA,EAAAC,GADI,SAAAC,EAAA,OAAM,CAAAC,GAAAC,EAAWF,CAAA,CAAA,OADnB;CAAA,EAAcF,CAAA,CAAA,CAAA,GAJzBK,EAAA,SAAAC,EAAA,WAAwBA,EAAA,OAAA,GA1ExBC,EAAA,SAAAzD,EAAA,WACM,CAAA0D,GAAAC,GATV5D,EAAA,KAAA,EAAA,CAAA,EAAA6D,EASwC,wBAAA,CAAA,CAAA,EAC/B,CAAAC,GAAM,CAAAD,EAAS,SAAA,CAAA,CAAA,EACb,CAAAC,GAAM,CAAAD,EAAU,kBAAA,CAAA,CAAA,EACd,CAAAN,EAAA,UAAA,UAZbvD,EAAA,KAAA,KAAA,EAYsB,OAAA+D,EAA0B,aAZhD/D,EAAA,KAAA,0BAca,OAdbA,EAAA,KAAA,cAesB,CAAA6D,EAAS,iBAAA,CAAA,CAAA,EAAoB,CAAAG,GAAU5D,EAAA,EAAA,MAAA,EAAA6D,EAAA,EAf7DjE,EAAA,KAAA,IAAA,EAAAkE,EAAA,CAAA,CAAA,EAcaJ,GAES,CAAAD,EAAS,0BAAA,CAAA,CAAA,EAA8BX,EAhB7DlD,EAAA,KAAA,IAAA,CAAA,QAiBiB,CAAA6D,EAAS,qBAAA,CAAA,CAAA,EACX,CAAAM,GAAO,CAAAC,GAAAC,GAlBtBrE,EAAA,KAAA,OAAA,EAAAsE,EAAA,EAkBsDd,EAlBtDxD,EAAA,IAAA,CAAA,CAAA,CAAA,CAAA,EAmBiB,CAAAuD,EAAAc,GAAa,MAAA,EAAAE,EAAA,EAASf,EAnBvCxD,EAAA,IAAA,CAAA,CAAA,CAAA,CAAA,EAAAuD,EAoBsB,KAAA,EAAAY,GACA,CAAAN,EAAU,MAAA,CAAA,CAAA,EACf,CAAAN,EAAA,UAAA,CAAS,OAtB1BvD,EAAA,KAAA,OAsB8C,SAAc,uBAG3Cc,EAAA,IAAA,OAAA,EAAkB,SAAA4B,EAAA,WAClB,CAAAmB,EAAS,mBAAA,CAAA,CAAA,EACX,CAAAW,GAAS,CAAAC,GAAAC,GAAA,KAAA,EAAAC,GAA8B,SAAAC,EAAA,eAAY,EAAA,MAAa,8BAAA,CAAA,CAAA,EAAiC,CAAArB,EAAO,cAAA,CAAA,CAAA,EAAAO,GAClG,CAAAD,EAAS,gBAAA,CAAA,CAAA,EACb,CAAAW,GAAS,CAAAC,GAAAC,GAAA,KAAA,EAAAC,GAA8B,SAAAC,EAAA,eAAiB,EAAA,MAAc,iCAAAC,GA7BvF7E,EAAA,SAAA,EA6B8I,KAAA,CAAA,CAAA,CAAA,EAAS,CAAAuD,EAAO,QAAA,CAAA,CAAA,EAAAY,GACrI,CAAAN,EAAU,cAAAgB,GAAA,CA9BnC7E,EAAA,SAAA,EA8B6E,KAAA,CAAA,CAAA,CAAA,EAC1D,CAAAwE,GAAS,CAAAC,GAAAC,GAAA,KAAA,EAAAC,GAA8B,SAAAC,EAAA,eAAiB,EAAA,MAAO,CAAArB,EAAO,iBAAA,CAAA,CAAA,EAAAiB,GAC7D,CAAAC,GAAAC,GAAA,KAAA,EAAAC,GAA8B,SAAAC,EAAA,qBAAuB,KAAA,CAAA,CAAA,EAAQ,CAAArB,EAAO,SAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,OAmD5FuB,EAAA,SAAAC,EAAA,QACc,SAAAC,EAAA,kBAAeD,EAAfC,CAAA,CAAA,IAPdC,EAAA,SAAAhF,EAAA,WAAwB,CAAA4D,EAAS,KAAA,CAAA,CAAA,EAAO,CAAAN,EAAM,sBAAA,CAAA,CAAA,GAE9C2B,EAAA,SAAAC,EAAA,QAAA,SAAAlF,EAAA,WACM,CAAA4D,EAAS,iBAAA,CAAA,CAAA,EAAoB,CAAAN,EAAO4B,CAAA,CAAA,CAAA,IAzC1CC,EAAA,SAAAnF,EAAA,WACO,CAAAoF,GAAA3F,GAAA,MAAA,CAAA,CAAA,EACH,CAAA4F,GAAAC,GAzCRvF,EAAA,QAAA,CAAA,EA0CakF,EAAAM,GAA8B,EAAA,EA1C3CxF,EAAA,QAAA,CAAA,CAAA,EAAAyF,GA2CY,CAAA5B,EAAS,SAAA,CAAA,CAAA,EAAW,CAAAN,EAAO,QAAA,CAAA,CAAA,EAAAJ,GACvB,CAAAuC,GAAAC,GAAA,KAAA,EAAA9B,EAA2B,qCAAA,EAAA+B,GAA6C,OAAA,EAAAC,GA5CxF7F,EAAA,UAAA,KAAA,EAAA8F,GA6C2DhB,EAAA1F,GAAA,MAAA,CAAA,EAAA2G,GAAAC,GA7C3DhG,EAAA,UAAA,KAAA,CAAA,CAAA,CAAA,EAAAsD,GAAAmC,GAgDY,CAAA5B,EAAS,SAAA,CAAA,CAAA,EAAW,CAAAN,EAAO,cAAA,CAAA,CAAA,EAAA0C,GACpB,CAAAtC,GAAMjD,EAjDzBV,EAAA,SAAA,CAAA,EAAA6D,EAiDuD,2CAAA,EAAA+B,GAAmD,MAAA,EAAAM,GAAa,EAAA,EAAAL,GAjDvH7F,EAAA,UAAA,IAAA,EAAA8F,GAkD6DhB,EAAAzF,GAAA,MAAA,CAAA,CAAA,CAAA,EAAAyE,GAE/C,CAAAD,EAAS,0BAAA,CAAA,CAAA,EACb,CAAAV,GAAQ,CAAAuC,GAAAS,GAAA,KAAA,EAAAtC,EAA+B,qBAAA,EAAAF,GAA2B,iBAAA,EAAAiC,GAAwB,YAAA,EAAAQ,GArDpGpG,EAAA,UAAA,UAAA,EAAAqG,GAsDiEvB,EAAAxF,GAAA,MAAA,CAAA,CAAA,CAAA,EAAAiE,EAC/C,GAAA,EAAA+C,GACC,CAAAC,GAAM,iBAAA,EAAA1C,EAA2B,KAAA,CAAA,CAAA,EAAQ,CAAAN,EAAO,eAAA,CAAA,CAAA,EAAAD,EAAA,CAAA,EAAAQ,GAGrD,CAAAD,EAAS,0BAAA,CAAA,CAAA,EACb,CAAAV,GAAQ,CAAAuC,GAAAS,GAAA,KAAA,EAAAtC,EAA+B,qBAAA,EAAAF,GAA2B,aAAA,EAAAiC,GAAoB,QAAA,EAAAQ,GA5DhGpG,EAAA,UAAA,MAAA,EAAAqG,GA6D4DvB,EAAAvF,GAAA,MAAA,CAAA,CAAA,CAAA,EAAAgE,EAC3C,GAAA,EAAA+C,GACC,CAAAC,GAAM,aAAA,EAAA1C,EAAuB,KAAA,CAAA,CAAA,EAAQ,CAAAN,EAAO,SAAA,CAAA,CAAA,EAAAD,EAAA,CAAA,EAAAH,GAG9C,CAAAuC,GAAAc,GAAA,KAAA,EAAA3C,EACS,kEAAA,EAAAgC,GACD,MAAA,CAAA,CAAA,EAAAtC,EACT,GAAA,EAAAJ,GACC,CAAAuC,GAAAe,GAAA,KAAA,EAAA5C,EACS,8DAAA,EAAAgC,GACD,QAAA,EAAAlB,GACE,SAAAjC,EAAA,eAAY,EAAA,mBAzEtC1C,EAAA,SAAA,EAEKiF,CAAA,EAAAyB,EAAAC,GAFL3G,EAAA,IAAA,EAIeoF,CAAA,EACA1B,CAAA,CAAA,CAAA,aAtBb,gBAAuB9C,EAAQH,CAAA,CAAA,SAC7BwC,UACiB,0GAA+BjC,gOCtDtD4F,GAAA,UAAA,yCAAAC,GAAA,UAAA,+EAAAC,GAAA,UAAA,+EAaAC,GAAA,SAAAC,EAAA,CA0GE,IAAAC,EAAA,SAAAC,EAAA,QAAA,SAAA,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,yBAC0BF,EAAID,EAAI,IAAX,OAAAI,EAAqB,EAAUL,EAAG,EAAIC,CAAA,EAAKD,EAAGE,EAAID,CAAA,MAAQG,EAAID,GAAKA,QAhG1FG,EAAA,SAAA,EAAA,OACE,MAAQ,gBAiGVC,EAAA,SAAAC,EAAA,CAGI,OADGA,aAAAC,cAEHC,GAAAC,GAAAC,GAAAC,GACyDL,CAAA,CAAA,CAAA,CAAA,EAAvD,SAAAM,EAAA,WACW,SAAAC,EAAA,uBAAMA,2BAAAA,EAAAC,CAAA,SAAAD,EAAAC,CAAA,iBACRR,oBACsBM,CAAA,SAGrCG,EAAA,SAAAC,EAAA,CACa,GAAbA,aAAAxB,gBACiB,SAAAyB,EAAA,kBAAf,SAAAC,EAAA,QACAb,EAAca,CAAA,IACF,GAHdF,aAAAvB,GAGwB,OAAA0B,GAAAC,GACX,SAAAP,EAAA,uBAAMA,2BAAAA,EAAAQ,CAAA,SAAAR,EAAAQ,CAAA,oBAAuBR,EAAA,IAAA,EAJ1CG,EAAA,MAAA,OAIE,UAAA,cACe,SAAAC,EAAA,kBAAf,SAAAC,EAAA,oBACyDA,CAAA,CAAA,CAAA,CAAA,MAC7C,GAPdF,aAAAtB,GAO0B,OAAAc,GAAAc,GACT,SAAAL,EAAA,kBAAf,SAAAC,EAAA,UACGA,CAAA,EATLF,EAAA,MAAA,EASE,OAAAO,EACQR,EAAA,IAAAtB,GAAA,CAAA+B,GAAyCN,CAAA,CAAA,CAAA,EACzCb,EAAAoB,GAXVT,EAAA,MAAA,EAW2C,EAAA,CAAA,+GAX3CA,EAAA,YAAA,IAAA,CAAA,GA/GAU,EAAAC,GAAA,MAAA,EAgFAC,EAAA,SAAAC,EAAA,WAAuCH,EAAA,KAAA,EAAA,UAAA,UAAwBG,CAAA,EAAV,OAAAC,EAAoB,GAAQ,MAASD,MAE1FE,EAAA,SAAAC,EAAA,QAAA,SAAAjC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAiC,EAAA,QAAA,SAAAjB,EAAA,CAWI,IAAAkB,EAAUrC,EAAS,SAAAsC,GAAA,WAAQ,SAAAlB,GAAA,OAAC,GAAAA,IAATkB,EAAA,CAAA,OAA6BnB,CAAA,CAAA,EAAAoB,GAAarC,CAAA,CAAA,EAAAqC,GAAapC,CAAA,CAAA,EAAG,EAAA,EAAI,CAAA,EAFjFqC,EAAAC,GAAkBL,CAAA,EAClBM,GAAW1C,EAAA2C,EAAA,EAAAJ,GAA2BpB,CAAA,CAAA,EAAAoB,GAAarC,CAAA,CAAA,EAAAqC,GAAapC,CAAA,CAAA,EAAG,GAAA,EAAM,GAAA,EAEzEyC,GAAAC,GAAc,OAAA,EAAmB,cAAAC,GAAqBJ,EAAA,GAAY,KAAO,YAAAI,GAAoBT,CAAA,IAAA,QAV/F,CAAAU,GAAI,CAAAC,GAAQjB,EAAAkB,GAA2Bb,CAAA,CAAA,CAAA,EAAAc,EAAY,cAAA,EAAiBN,EAAA,CAAA,EAChE,CAAAO,EAAOf,CAAA,CAAA,CAAA,EAAAgB,GAAA,CAAAC,GACUlB,CAAA,CAAA,EAAW,SAAAf,GAAA,WAAkBoB,CAAA,EAAQL,CAAA,EAApB,OAAAmB,MACzB,CAAAN,GAAOjB,EAAAwB,GAA4B,GAAA,EAAAC,GAAAP,EAAA,EAAAQ,GAAyBjB,CAAA,EAAQL,CAAA,CAAA,CAAA,CAAA,CAAA,EAAAe,EAAoB,sBAAA,CAAA,CAAA,EAAwB,CAAAC,EAAM,QAAA,CAAA,CAAA,EAD7FJ,GAEzB,CAAAC,GAAOjB,EAAAwB,GAA4B,GAAA,EAAAC,GAAAP,EAAA,EAAAS,GAA2BlB,CAAA,EAAQL,CAAA,CAAA,CAAA,CAAA,CAAA,EAAAe,EAAoB,sBAAA,CAAA,CAAA,EAAwB,CAAAC,EAAM,QAAA,CAAA,CAAA,UAfvIQ,EAAA,SAAAxB,EAAA,QAAA,SAAAjC,EAAA,QAAA,SAAAC,EAAA,CAEE,IAAAyD,EAAAJ,GAAAK,GACkB3B,EAAAsB,GAAAf,EAAA,EAAwBN,CAAA,CAAA,EAASjC,CAAA,EAAEC,CAAA,CAAA,CAAA,EADrD2D,EAAAC,GAAAC,GAEuB,SAAAC,EAAA,cAAAA,CAAA,CAAA,YAFvB,SAAAC,EAAA,WACIN,EACAE,EAAAK,GAFJD,CAAA,CAAA,CAAA,CAAA,MArEFE,EAAA,SAAAjD,EAAA,CACO,GAAPA,EAAA,gBAAAT,aACM,CAAAwC,EAAQ,WAAA,CAAA,CAAA,EAAc,CAAA,CAAA,EAyDxB,IAAAmB,EAAA,IAAAC,GAAA3C,GA1DJR,EAAA,IAAA,EA0DgD,GAAA,EAG5CoD,EAAA,IAAAC,GAAA7C,GA7DJR,EAAA,IAAA,EA6DuD,CAAA,EAEnDsD,EAAA,IAAAD,GAAA7C,GA/DJR,EAAA,IAAA,EA+DwD,EAAA,EAHpDuD,EAAA,IAAAF,GAAA7C,GA5DJR,EAAA,IAAA,EA4DuD,CAAA,EAEnDwD,EAAA,IAAAH,GAAA7C,GA9DJR,EAAA,IAAA,EA8DwD,EAAA,EAHpDyD,EAAA,IAAAJ,GAAA7C,GA3DJR,EAAA,IAAA,EA2DuD,CAAA,YAxDjD,CAAA+B,EAAQ,eAAA,CAAA,CAAA,EACZ,CAAA2B,GACM,CAAA3B,EAAQ,sBAAA,CAAA,CAAA,EAAA4B,GAAAC,GAAAC,GALhB7D,EAAA,IAAA,CAAA,EAOW,SAAAC,GAAA,OACC,CAAA6D,GAAS,CAAAC,GAAAC,GAAA,KAAA,EAAAjC,EAA8B,8BAAA,EAAAkC,GACpB,SAAAC,GAAA,mBAT/BlE,EAAA,IAAA,CAAA,MAUuB,CAAAgC,EAAM,cAAA,CAAA,CAAA,CAAA,IAGlB,SAAA/B,GAAA,OACC,CAAA6D,GAAS,CAAAC,GAAAC,GAAA,KAAA,EAAAjC,EAA8B,6BAAAoC,GAAAC,GAdnDpE,EAAA,IAAA,EAckGkD,CAAA,CAAA,EAAS,IAAA,CAAA,EAAAmB,GAC9E,qCAAA,EAAAJ,GACE,SAAAC,GAAA,eAAkBhB,CAAA,MAC1B,CAAAlB,EAAM,UAAA,CAAA,CAAA,EAAA8B,GACR,CAAAC,GAAAC,GAAA,KAAA,EAAAjC,EAA8B,8BAAAoC,GAAAC,GAlBnDpE,EAAA,IAAA,EAkBmGyD,CAAA,CAAA,EAAS,IAAA,CAAA,EAAAY,GAC/E,eAAA,EAAAJ,GACE,SAAAC,GAAA,eAAkBT,CAAA,MAC1B,CAAAzB,EAAM,KAAA,CAAA,CAAA,EAAAA,EACV,QAAA,EAAA8B,GACE,CAAAC,GAAAC,GAAA,KAAA,EAAAjC,EAA8B,yBAAAoC,GAAAC,GAvBnDpE,EAAA,IAAA,EAuB8FuD,CAAA,CAAA,EAAS,IAAA,CAAA,EAAAc,GAC1E,qCAAA,EAAAJ,GACE,SAAAC,GAAA,eAAkBX,CAAA,MAC1B,CAAAvB,EAAM,GAAA,CAAA,CAAA,EAAAA,EACV,QAAA,EAAA8B,GACE,CAAAC,GAAAC,GAAA,KAAA,EAAAjC,EAA8B,yBAAAoC,GAAAC,GA5BnDpE,EAAA,IAAA,EA4B8FoD,CAAA,CAAA,EAAS,IAAA,CAAA,EAAAiB,GAC1E,qCAAA,EAAAJ,GACE,SAAAC,GAAA,eAAkBd,CAAA,MAC1B,CAAApB,EAAM,GAAA,CAAA,CAAA,EAAAA,EACV,QAAA,EAAA8B,GACE,CAAAC,GAAAC,GAAA,KAAA,EAAAjC,EAA8B,yBAAAoC,GAAAC,GAjCnDpE,EAAA,IAAA,EAiC8FwD,CAAA,CAAA,EAAU,IAAA,CAAA,EAAAa,GAC3E,sCAAA,EAAAJ,GACE,SAAAC,GAAA,eAAkBV,CAAA,MAC1B,CAAAxB,EAAM,IAAA,CAAA,CAAA,EAAAA,EACV,QAAA,EAAA8B,GACE,CAAAC,GAAAC,GAAA,KAAA,EAAAjC,EAA8B,yBAAAoC,GAAAC,GAtCnDpE,EAAA,IAAA,EAsC8FsD,CAAA,CAAA,EAAU,IAAA,CAAA,EAAAe,GAC3E,sCAAA,EAAAJ,GACE,SAAAC,GAAA,eAAkBZ,CAAA,MAC1B,CAAAtB,EAAM,IAAA,CAAA,CAAA,CAAA,KAEd,CAAA8B,GAAQ,CAAAC,GAAAC,GAAA,KAAA,EAAAjC,EAA6B,oCAAA,EAAAkC,GACnB,SAAAhE,GAAA,mBA5CjCD,EAAA,IAAA,CAAA,MA6CuB,CAAAgC,EAAA,UAAA,WA7CvBhC,EAAA,IAAA,EA6C+B,OAAAsE,GAAwB,OAAY,sBA7CnEtE,EAAA,IAAA,CAAA,EA8C4B,SAAAC,GAAA,CAClB,IAAAlB,GAAAwF,GAAc,CAAA,EAAAC,GAAAC,GA/CxBzE,EAAA,QAAA,CAAA,CAAA,EAgDUhB,GAAAuF,GAAc,CAAA,EAAAG,GAAAD,GAhDxBzE,EAAA,QAAA,CAAA,CAAA,YAiDU,CAAA+B,EAAQ,gBAAA,CAAA,CAAA,EAAA,UAAA,CACV,OAlDR/B,EAAA,gBAAAT,GAkD4B,CAAA,EAlD5BS,EAAA,gBAAA2E,GAoDUnC,EApDVxC,EAAA,KAAA,MAAA,EAoD0BjB,EAAA,EAAEC,EAAA,EApD5BgB,EAAA,QAAA,EAsDUwC,EAAQ,CAAA,CAAA,EAAGzD,EAAA,EAAEC,EAAA,EAtDvBgB,EAAA,QAAA,qBAdE,gBAAuBZ,EAAQR,CAAA,CAAA,SAC7BqE,UACiB,iFAA+BlD,yGCItD,IAAA6E,GAAA,SAAAC,EAAA,oBAGK,UAAA,CAAA,IAAAC,EAAAC,GAAcF,CAAA,SAAd,SAAAG,EAAA,QAAAF,EAAAG,GAAAD,CAAA,CAAA,kBADH,SAAAE,EAAA,kBAEmCA,CAAA,CAAA,KAIrCC,GAAAC,GAAAC,GAAAC,EAAA,EAAAC,EAAAC,GAAA,MAAA,CAAA,CAAA,CAAA,EC1BA,IAAAC,GAAA,mCAAA,UAAA,qBAAA,UAAA,aAHE,IAAAC,GAAA,SAAAC,EAAA,CAAA,OAAAA,EAAA,MCuEF,IAAAC,GAAAC,EAjBAC,GAAAD,EAiCAE,GAAA,SAAAC,EAAA,wBAAA,SAAAC,EAAA,QAMkBH,GAAe,SAAAI,EAAA,UAAiBD,CAAA,EAAEC,EAAA,SAAA,MA5BpDC,GAAAN,EAaAO,GAAA,SAAAC,EAAA,QAAA,SAAAJ,EAAA,QAMiBH,GAAe,SAAAI,EAAA,QAC9BC,GAAgBF,EAAEC,EAAA,SAAA,CAAA,MArCpBI,GAAAT,EAhBAU,GAAA,SAAAN,EAAA,QAAA,SAAAO,EAAA,CAKe,OAAfP,EAAAO,CAAA,IA0DAC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAQE,UAAA,UAAiC,CAAA,CAAA,EAAA,6BAGXD,CAAA,EAAA,uEAIL,CAAA,EAAA,+BAIfE,EAEE,WAAEJ,QACOA,EAAA,aAAuBC,CAAA,iCAG9BI,cACAC,UACAC,aACAC,iBACAC,cACAC,kBACAC,0BAEAC,gBACAC,QACAC,oBACmBX,aAEdC,CAAA,EAAgBG,CAAA,EAAA,EACpBX,GAAkBW,CAAA,gSCR3BQ,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAME,UAAA,UAA4CA,CAAA,EAAA,OAA5CC,EAAA,aAAA,EAAA,sBAEmCF,CAAA,CAAA,EAAQG,CAAA,CAAA,EAAA,KAoB7CC,GAAA,SAAAH,EAAA,QAAA,SAAAI,EAAA,iBAKuBJ,CAAA,CAAA,CAAA,EAAS,SAAAC,EAAA,CAC5B,GAAAA,aAAAI,SAAWD,EACX,GAAAH,aAAAK,EAAK,OAAAC,GAAAC,GAAA,IAAAF,EAAA,IAAAG,GAAmCL,EAAAH,EAAA,MAAA,CAAA,CAAA,EAASD,CAAA,CAAA,4IAzBrDU,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,iBAEyB,6CAA2CD,CAAA,CAAA,CAAA,EAAlE,UAAA,cACqBC,CAAA,CAAA,EAArB,SAAAC,EAAA,iBACsDF,CAAA,CAAA,CAAA,EAAtD,SAAAV,EAAA,CAAA,OAAAa,GAAAC,GAAAC,EAAA,EAAAf,EAAA,UAAA,CAAA,EACA,UAAA,cADAA,EAAA,YAAA,CAAA,EAEA,UAAA,WACKY,CAAA,cAsBPI,GAAAC,GAAAC,GAAAC,EAAA,EAAAC,EAAAC,EAAAC,EAAA,EAAA,MAAA,CAAA,CAAA,CAAA,EApBAC,GAAA,SAAAZ,EAAA,QAAA,SAAAZ,EAAA,iBAMyCA,CAAA,CAAA,CAAA,EAAvC,SAAAC,EAAA,CAAA,OAAAM,GAAAkB,GAC0B,SAAAC,EAAA,OAAM,OAASA,EAAI,EAAJ,QAAcd,EAAEc,CAAA,KADzDzB,EAAA,KAAA,CAAA,MAxHF0B,GAAA,SAAAC,EAAA,QAAA,SAAA5B,EAAA,QAAA,SAAA6B,EAAA,iBAOyC7B,CAAA,CAAA,CAAA,EAAvC,SAAAC,EAAA,CAAA,OACA6B,GAAMF,CAAA,EAAO5B,CAAA,EADbC,EAAA,UAAA,KAAA,IAAA8B,GAAAC,GAAA1B,EAAA,MAAA,EAAA2B,GACqEJ,CAAA,CAAA,EAAAR,EAAAhB,EAAA,KAAA,CAAA,CAAA,CAAA,OAEvEyB,GAAA,SAAAF,EAAA,QAAA,SAAAM,EAAA,QAAA,SAAAjC,EAAA,CAuEE,IAAAkC,EAAA,SAAAnC,EAAA,QAAA,SAAAoC,EAAA,iBAMyCpC,CAAA,CAAA,CAAA,EAAvC,SAAAqC,EAAA,CAAA,OAAAC,GACyB,SAAAC,EAAA,CAErB,IAAAC,EAAA,SAAAC,EAAA,CAAW,OAAAC,GAAAC,GAAApC,GAAAqC,GAAXH,CAAA,CAAA,CAAA,EACE,SAAAI,EAAA,WACgB,SAAAC,EAAA,QAAOnB,GA5EjCC,CAAA,EA4E8CkB,EAAA,OAAA,EAAAP,EAAA,MAAA,IAAkBM,CAAA,0CAC7BL,CAAA,EAN/BH,EAAA,QAAA,CAAA,CAAA,IACAD,CAAA,MAtEFW,EAAA,SAAA/C,EAAA,QAKS,SAAAqC,EAAA,CACP,GAAAA,aAAAW,GAAM,OAAAL,GAAApC,GAAAqC,GACkE5C,CAAA,CAAA,CAAA,EAAtE,SAAAuC,EAAA,CAzBN,IAAAE,EAAAJ,EAAA,OAyBME,EAAA,KAAA,EAEE,GAAAU,GAFFV,EAAA,KAAA,EAzBNE,EAAA,MAAA,YAAAA,EAAA,MAAA,EA2BQ,GAAAS,mBAG2C,WAL7CX,EAAA,eAAAA,EAAA,cAAAA,EAAA,oBAAAA,EAAA,uBAAAA,EAAA,oBAAAA,EAAA,mBAAAA,EAAA,0BAAAA,EAAA,2BAAAA,EAAA,4BAAAA,EAAA,0BAAAA,EAAA,gBAAAA,EAAA,oBAAAA,EAAA,oBAAAA,EAAA,wBAAAA,EAAA,wBAzBNE,EAAA,SA8B2EzC,CAAA,CAAA,CAAA,EAA7D,UAAA,WACAU,GANR6B,EAAA,iBAAA,EATNX,EASMW,EAAA,iBAAA,EAMoEvC,CAAA,CAAA,CAAA,EAA5D,UAAA,WA/BdyC,EAAA,MAAA,oHAAAA,EAAA,YAAA,IAAA,CAAA,IAiCI,GAAAJ,aAAAc,GAAU,OAAAR,GACDnB,GAAA4B,EAAA,EAAqBpD,CAAA,CAAA,EAA5B,SAAAD,EAAA,0BAC2CA,CAAA,CAAA,EAAK,SAAAsD,EAAA,QAC9CpC,GAAYqC,GApBpB1B,CAAA,EAoBiC5B,CAAA,EAAA,IAAAuD,GAAkBF,CAAA,CAAA,CAAA,MAD7C,SAAAG,EAAA,iBAEwDxD,CAAA,CAAA,CAAA,EAAxD,SAAAuC,EAAA,CAAA,OAAAzB,GAAAP,GAAAkD,GAAAC,GAAAC,GACwC5D,CAAA,EAAIyD,CAAA,CAAA,CAAA,EAD5CjB,EAAA,aAAA,CAAA,CAAA,EACA,UAAA,oBACQxC,CAAA,CAAA,UACV,GAAAsC,aAAAuB,GAAY,OAAA9C,GAAAP,GACGT,GAAAuC,EAAA,MAAA,EAAgBrC,CAAA,CAAA,CAAA,EAA7B,UAAA,uBAEF,GAAAqC,aAAAwB,GAAK,OAAAxB,EAAA,OAEL,GAAAA,aAAAyB,GAAW,OACT3B,EAAenC,CAAA,EAAAqC,EAAA,MAAA,EACjB,GAAAA,aAAA0B,GAAM,OAAApB,GAAApC,GAAAqC,GAC4D5C,CAAA,CAAA,CAAA,EAAhE,SAAAuC,EAAA,CAAA,OAAAI,GAAApC,GAAAqC,GAAAL,EAAA,UAAA,CAAA,CAAA,EACA,SAAAyB,EAAA,WACA7D,GAFAoC,EAAA,WAAA,EAEwByB,EAAA3B,EAAA,MAAA,CAAA,CAAA,EAAxB,UAAA,2BAEF,GAAAA,aAAA4B,GAAK,OAAAC,GAAAC,GAAAC,GACuC,UAAA,CAAA,IAAAC,EAAavC,GArC7DF,CAAA,EAqC0E5B,CAAA,SAA1B,SAAAsE,EAAA,WAAaD,EAAbC,CAAA,CAAA,mBAC5C,GAAAjC,aAAAkC,GAAK,OAAA5B,GACInB,GAAAgD,EAAA,EAAaxE,CAAA,CAAA,EAApB,SAAAyE,EAAA,iBACgDzE,CAAA,CAAA,CAAA,EAAhD,SAAAuC,EAAA,CAAA,OAAAI,GAAApC,GAAAmE,GAC+B,EAAA,CAAA,CAAA,EAA/B,SAAAC,EAAA,oBAGM,UAAA,cAAsBF,CAAA,CAAA,EAJ5BlC,EAAA,KAAA,EAAA,KAKgB,EAAA,EAAKoC,CAAA,EAAA,KAElB7C,GA/CTF,CAAA,EA+CsB5B,CAAA,EAAAqC,EAAA,MAAA,CAAA,CAAA,CAAA,EALhB,SAAAuC,EAAA,oBAM+BD,CAAA,CAAA,EAAAlB,GAAAoB,GACPJ,CAAA,EAAIG,CAAA,CAAA,EAT5BrC,EAAA,KAAA,CAAA,CAAA,CAAA,EAQA,UAAA,oBAEQkC,CAAA,CAAA,YACV,GAAApC,aAAAyC,GAAK,OAAAnC,GAAApC,GAAAqC,GAC2C5C,CAAA,CAAA,CAAA,EAA9C,SAAAuC,EAAA,CAAA,OAAAI,GAAApC,GAAAqC,GAAAL,EAAA,KAAA,CAAA,CAAA,EACA,SAAAwC,EAAA,+BACkCA,CAAA,CAAA,CAAA,EAAlC,UAAA,2BAEF,GAAA1C,aAAA2C,GAAK,OAAArC,GAAApC,GAAAqC,GAC6C5C,CAAA,CAAA,CAAA,EAAhD,SAAAuC,EAAA,CAAA,OAAAI,GAAApC,GAAAqC,GAAAL,EAAA,KAAA,CAAA,CAAA,EACA,SAAAwC,EAAA,oBAC4B,WAAA,CAAA,CAAA,EAAAE,GAAA5C,EAAA,MAAA,EAA4B0C,CAAA,CAAA,CAAA,EAAxD,UAAA,2BAEF,GAAA1C,aAAA6C,GAAQ,OAAAvC,GAAApC,GAAAqC,GACuC5C,CAAA,CAAA,CAAA,EAA7C,SAAAuC,EAAA,CAAA,OAAAjB,GAAAe,EAAA,OAAA8C,GAAA9C,EAAA,MAAA,EAAAE,EAAA,IAAA,CAAA,CAAA,qJA9DyCQ,EAA/Cb,CAAA,CAAA,EAAAjC,CAAA,KA9BAqD,GAAA,SAAA1B,EAAA,QAAA,SAAA5B,EAAA,QAMmB,SAAAC,EAAA,CACjB,GAAAA,aAAAmF,GAAiB,OAAA7E,GAAA8E,GAAA5B,EAAA,EACezD,CAAA,EAAAsF,GAAqB,SAAAC,EAAA,OACjD,WAAAA,EAAA,gBAAAA,EAAA,eAAAA,EAAA,oBAAAA,EAAA,uBAAAA,EAAA,oBAAAA,EAAA,mBAAAA,EAAA,0BAAAA,EAAA,2BAAAA,EAAA,4BAAAA,EAAA,0BAAAA,EAAA,gBAAAA,EAAA,oBAAAA,EAAA,oBAAAA,EAAA,wBAAAA,EAAA,iDAAiCA,EAAA,IAAA,OACrC,GAAAtF,aAAAsD,GAAa,OAAAZ,GAAApC,GAAAqC,GAC4B5C,CAAA,CAAA,CAAA,EAAvC,SAAAqC,EAAA,CAAA,OACAP,GAAMF,CAAA,EAAO5B,CAAA,EADbqC,EAAA,UAAA,KAAA,IAAAkB,GAAAtD,EAAA,OAAA,MAAA,CAAA,CAAA,0YCqOJuF,GAAA,UAAA,WAC+B,gDAE/BC,GAAA,SAAAC,EAAA,QAEE,UAAA,UAAkBA,CAAA,EAAA,qBACAA,CAAA,EAAA,KACbC,CAAA,EAAO,UAAA,CAAA,IAAAC,EAAAC,GAAAC,EAAA,SAAA,SAAAC,EAAA,WAAmBH,EAAAI,GAAnBD,CAAA,CAAA,CAAA,WAEdE,GAAA,SAAAC,EAAA,CAI8B,OAC5B,UAAA,0BADFA,EAAA,aAAA,CAAA,EAAA,cAAAA,EAAA,aAAA,EAAA,QAGa,UAAA,CAAA,IAAAC,EAAAC,GAAAC,GAAoC,WAAA,CAAA,SAApC,SAAAC,EAAA,WAAmBH,EAAnBG,CAAA,CAAA,WAHbJ,EAAA,KAAA,CAAA,EAAA,SAAAA,EAAA,KAAA,EAAA,IA/LAK,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CA2HE,IAAAC,EAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,WAOiB,SAAAC,EAAA,CACT,IAAAC,EAAAC,GAA+BC,CAAA,EAAOH,EAAA,OAAA,EAAYA,EAAA,UAAA,KAAA,IAAAI,GAAA,MAAA,CAAA,CAAA,YACnC,SAAAC,EAAA,OACjB,8BAEgCA,EAAA,YAAA,CAAA,CAAA,EAAxB,UAAA,WACAJ,CAAA,EAAA,UAAA,WAEE,UAAA,CAAA,OAAAtB,GAAcqB,EAAA,cAAA,EAAA,EACdrB,GAAcqB,EAAA,WAAA,EAAA,QAChBD,CAAA,aACMM,EAAA,cAThBP,CAAA,MAxGJQ,EAAA,SAAAR,EAAA,QAAA,SAAAS,EAAA,QAAA,SAAAC,EAAA,WAO0C,SAAAC,EAAA,QACxC,UAAA,OAAS/B,GAAA,OACc+B,CAAA,EAAED,CAAA,EAAED,CAAA,EAAQG,CAAA,EAAA,QACnBZ,CAAA,EAAA,YACN,kCAAmCa,GAAA,aAAiBb,CAAA,EAAA,QAC9C,UAAA,CAAA,IAAAc,GAAAT,EAAOL,CAAA,SAAP,SAAAe,GAAA,QAAAD,GAAgB,SAAAxB,GAAA,oBAAhByB,EAAA,CAAA,WAAwCC,CAAA,CAAA,EAAA,KACxDjB,EAAwBC,CAAA,EAAKa,GAAA,YAAA,CAAA,EAAAI,GAA8BD,CAAA,CAAA,EAAA,EACtDA,QAoDPE,EAAA,SAAAlB,EAAA,QAAA,SAAAS,EAAA,QAAA,SAAAU,EAAA,QAAA,SAAAC,EAAA,WASkB,SAAAC,EAAA,QACd,UAAA,UAAcA,EAAA,GAAA,EAAAJ,GAAsBE,CAAA,CAAA,EAAA,gBAElC,GADUG,aAAAC,EAAA,IAAAD,EAAA,OAAA,MAAA,EAEcH,CAAA,EAAA,YAFdG,EAAA,OAAA,MAAA,EAAA,YAIa,SAAApB,GAAA,QACnB,UAAA,eAAeA,GAAA,UAAA,EAAf,UAAA,CAAA,IAAAsB,GAAAC,GAAAC,GAAA,MAAA,CAAA,EAAiDjB,CAAA,SAAjD,SAAAkB,GAAA,QAA+BH,GAA8BH,EAAA,OAA7DM,EAAA,CAAA,eAC4BtB,CAAA,EAAOH,GAAA,OAAA,EAAYA,GAAA,UAAA,KAAA,IAAA0B,GAA8BP,EAAA,MAAA,MAAA,CAAA,CAAA,CAAA,EAAA,KAF/EQ,EAAA,EAAA,EAJQP,EAAA,OAAA,OAQV,GARUA,aAAAQ,SASRtB,EAAaR,CAAA,EAAM,UAAA,CAAA,IAAA+B,GAAAN,GAAAC,GAAA,MAAA,CAAA,EAAkBjB,CAAA,SAAlB,SAAAuB,EAAA,QAAAD,GAA8BV,EAAA,OAA9BW,CAAA,CAAA,OAA2CX,EAAA,KAAA,EAAWA,EAAA,SAAA,EAAA,8GATjEC,EAAA,YAAA,IAAA,CAAA,WAUG,SAAAW,GAAA,WAAWZ,EAAA,IAAXY,EAAA,CAAA,OAAiCb,CAAA,CAAA,EAAA,YAC3Cc,EAAA,EAAAC,GACI,6FAAA,CAAA,EAAA,KACId,EAAA,IAAWL,EAAA,CAAA,EAAoBI,CAAA,EAAA,QACnCJ,EAAA,CAAA,EAAAoB,GAAqB,SAAA9C,GAAA,CAC5B,GAAAA,cAAAwC,YAAiB,kEAAA,EACjB,GAAAxC,cAAAiC,EAAK,OAAAc,GAAWzC,EAAA,YAAAN,GAAA,MAAA,CAAA,gJA7EtBe,EAAA,SAAAL,EAAA,QAAA,SAAAgB,EAAA,QAKmC,UAAA,UAARA,CAAA,EAAA,uCAEpBsB,CAAA,EAAAC,GAAA,IAAAhB,EAAAiB,GAAA,KAAA,CAAA,EAAAlD,EAAA,eAAA,CAAA,EAAA,yDAUH,IAAAmB,EACU,UAAA,CAAA,IAAAgC,GAAAC,GAAApD,EAAA,eAAA,EAAAqD,EAAAC,GAAwDvC,CAAA,EAAAf,EAAA,OAAA,SAAxD,SAAAuD,GAAA,QAAAJ,GAAAK,GAA6CH,EAA7CE,EAAA,CAAA,CAAA,MAEVE,EACe,UAAA,CAAA,IAAAC,GAAAN,GAAApD,EAAA,cAAA,SAAA,SAAA2D,EAAA,QAAAD,GAAmCvC,EAAAyC,GAAA,OAAnCD,CAAA,CAAA,CAAA,SAGfrD,EAAA,OACG,SAAAuD,GAAA,WAAmB1C,EAAnB0C,EAAA,CAAA,IACAjC,EAAYlB,CAAA,EAAK+C,CAAA,EAAAzD,EAAA,UAAA,EAAAA,EAAA,WAAA,CAAA,EAAAA,EAAA,UAAA,OAAAA,EAAA,KAAA,CAAA,EAAAA,EAAA,SAAA,EAAA,yDAOLgC,EAAA,EAAW,SAAA8B,GAAA,CAAE,OAC5B,UAAA,2BACcxD,EAAA,WAAA,EAAuByD,EAAA,EAAA,EACrCC,EAAStD,CAAA,EAAKqD,EAAA,EAAA,4BAE6B,SAAAE,GAAA,OAC3C,WAAAA,GAAA,gBAAAA,GAAA,WAAAA,GAAA,gBAAAA,GAAA,uBAAAA,GAAA,oBAAAA,GAAA,mBAAAA,GAAA,0BAAAA,GAAA,2BAAAA,GAAA,4BAAAA,GAAA,sBAAAA,GAAA,oBAAAA,GAAA,oBAAAA,GAAA,wBAAAA,GAAA,kCAAuBC,EAAA,WAAsBC,YAE1CnB,CAAA,EAAAoB,GAAAC,EAAA,EAAA,MAAA,EACgB,SAAAP,GAAA,QACjB,UAAA,4EAEW,UAAA,CAAA,IAAAQ,GAAA3E,GAAAC,EAAA,SAAA,SAAA2E,GAAA,WAAmBD,GAAAxE,GAAnByE,EAAA,CAAA,CAAA,OAAiDtD,EAAA,EAAA,uCAEnD,EAAA,EAAAuD,EAAA,EAAaC,EAAA,EAAtB,OAAAC,wDAAA,IAAAC,GAAA,MAAA,WAqDNX,EAAA,SAAAtD,EAAA,WAMiB,SAAAE,EAAA,QACb,UAAA,CAAAb,GAA8Ba,CAAA,EAAA,EAC1B,IAAAgE,EAAA9D,GAAeC,CAAA,EAAOH,EAAA,OAAA,EAAYA,EAAA,UAAA,KAAA,IAAAiE,GAAA,MAAA,CAAA,CAAA,YACnB,SAAA5D,EAAA,OACjB,cAAgBA,EAAA,+BACF2D,EAAI3D,EAAA,UAAA,KAFpBP,CAAA,EAAA,KAIiBE,EAAA,QAAA,EAAY,SAAAZ,EAAA,CAAE,OAC7B,UAAA,sBACAgE,EAAStD,CAAA,EAAK6B,CAAA,EAAA,WA7IpBuC,EAAA,SAAAC,EAAA,QAAA,SAAAvF,EAAA,QAAA,SAAAwF,EAAA,iBAMuBD,CAAA,CAAA,CAAA,EACnB,SAAA/E,EAAA,CAAA,OAAAA,cAAAiF,GACgBlE,CAAA,EAAOvB,CAAA,EAAIwF,CAAA,OAuI/BE,EAAA,SAAAH,EAAA,QAAA,SAAArE,EAAA,QAAA,SAAA6B,EAAA,WAMiD7B,CAAA,EAE7C,UAAA,UADOqE,CAAA,EAAA,EACP,OAAA/E,aAGY,EAAA,EAAK+E,CAAA,EAAA,EACff,EAAStD,CAAA,EAAK6B,CAAA,EAAA,KACO,SAAAuB,EAAA,CAAC,OACpB,UAAA,4BAAC,OAAAqB,GAADC,GAAA,SAAA,EACkB9E,EAAA,OAAA,EAAA,KAFpBiC,CAAA,EAAA,qBAvKajD,EAAA,CAAA,EAAnB,SAAAoB,EAAA,iBACiC,EAAA,CAAA,CAAA,EAAjC,SAAAqE,EAAA,WACqBrE,CAAA,EACnB,UAAA,qBACoBQ,EAAaR,CAAA,EAAM,UAAA,CAAA,IAAA2E,EAAAC,GAAyBC,EAAA,QAAA,SAAzB,SAAAC,EAAA,WAAeH,EAAfG,CAAA,CAAA,OAAuChF,CAAA,EAAED,CAAA,CAAA,EAAA,YAC3D,SAAAK,EAAA,WACnB,OAASkE,EAAWC,CAAA,EAASnE,EAAA,OAAA,WACjB2E,EAAA,gBACDL,EAAQH,CAAA,EAASrE,CAAA,EAAK6B,CAAA,MAHnCA,CAAA,EAAA,WCvHJ,IAAIkD,GAAa,SAAUC,EAAM,CAC/B,OAAO,SAAUC,EAAM,CACrB,OAAO,UAAY,CACjB,OAAOA,EAAKD,CAAI,CAClB,CACF,CACF,EAUO,IAAME,GAAUC,GAAW,SAAS,EAC9BC,GAAiBD,GAAW,eAAe,EAC3CE,GAAcF,GAAW,YAAY,EACrCG,GAAiBH,GAAW,eAAe,EAQjD,IAAMI,GAAaC,GAAW,YAAY,EACpCC,GAAcD,GAAW,YAAY,EACrCE,GAAaF,GAAW,WAAW,EACnCG,GAAmBH,GAAW,iBAAiB,EAC/CI,GAAeJ,GAAW,aAAa,EACvCK,GAAaL,GAAW,WAAW,EAUzC,IAAMM,GAAcC,GAAW,aAAa,EA4E5C,SAASC,GAAaC,EAAO,CAClC,OAAO,SAAUC,EAAO,CACtB,OAAO,SAAUC,EAAQ,CACvB,OAAO,UAAY,CACjBA,EAAO,aAAaF,EAAOC,CAAK,CAClC,CACF,CACF,CACF,CAEO,SAASE,GAAYC,EAAM,CAChC,OAAO,SAAUF,EAAQ,CACvB,OAAO,UAAY,CACjBA,EAAO,YAAYE,CAAI,CACzB,CACF,CACF,CAYO,SAASC,GAAYC,EAAM,CAChC,OAAO,SAAUC,EAAQ,CACvB,OAAO,UAAY,CACjBA,EAAO,YAAYD,CAAI,CACzB,CACF,CACF,cCvEA,IAAAE,GACa,UAAA,CAAA,IAAAC,EAAAC,GAAAC,EAAA,SAAA,SAAAC,EAAA,QAAAH,EAAAI,GAAAD,CAAA,CAAA,MAoCb,IAAAE,GACc,UAAA,CAAA,IAAAC,EAAAC,GAAAC,EAAA,SAAA,SAAAC,EAAA,QAAAH,EAAAI,GAAAD,CAAA,CAAA,4UC4Dd,IAAAE,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CACc,OAAdD,aAAAE,GAAAD,aAAAC,EAAuCC,GAAAC,GAAvCL,CAAA,EAAAC,EAAA,MAAA,EAAAC,EAAA,MAAA,CAAA,EAAAD,aAAAK,GAAAJ,aAAAC,EACoCC,GAAAG,GADpCP,CAAA,EAAAE,EAAA,MAAA,CAAA,EAEcM,GAAA,MAAA,KARdC,GAAA,SAAAT,EAAA,CACa,OACX,UAAA,UADFA,EAAA,IAAA,EAAA,YAEa,SAAAU,EAAA,WAFbV,EAAA,IAAA,EAEyCU,CAAA,IAAIC,CAAA,EAAA,IA3H7CC,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,CAsEE,IAAAC,EAAAC,GAC0B,SAAAjB,EAAA,CAAE,OAAAA,EAAA,OAP5BkB,EACO,SAAAC,EAAA,CAEH,OADGA,aAAAhB,EACEiB,GADFD,EAAA,MAAA,EAEH,QAnDJE,EAAA,SAAAC,EAAA,CAkCE,IAAAC,EAAAA,GAAAC,EAAA,EACqCF,CAAA,uDAZ7B,SAAAH,EAAAM,EAAA,CAEJ,GADGN,aAAAhB,EAAA,CAED,GADgBsB,aAAAC,aADfP,EAAA,MAAA,SACeM,EAAA,MAAA,EAIhB,GAJgBA,aAAAE,GAAA,WADfR,EAAA,OACeM,EAAA,MAAA,sBAMsBG,EAAA,EAAA,IAAAzB,EAAayB,EAAA,EAAAC,EAAA,GAAA,EAAaX,CAAA,CAAA,8GANhDO,EAAA,YAAA,IAAA,CAAA,EAOlB,OAAAK,EAAA,GAAA,EAA6BL,CAAA,2DArBxB,SAAAA,EAAA,CAEL,GADGA,aAAAC,GACW,OAAAK,EAAA,EAAA,EADXN,EAAA,MAAA,EAGH,GAHGA,aAAAE,GAAA,OAIwBJ,EAJxBE,EAAA,MAAA,sBAKmCO,CAAA,EAAA,IAAA7B,EAAY6B,CAAA,EAAAH,EAAA,EAAA,EAAYX,CAAA,CAAA,4GAL3DO,EAAA,YAAA,IAAA,CAAA,wEA6Be,SAAAQ,EAAA,UACInB,CAAA,EAAA,KACjBoB,EAAYD,CAAA,EAAA,EACfE,GAAOnB,EAAQoB,EAAA,mBACMD,GAAA7B,EAAA,MAAAuB,EAAA,GAAA,EAAmBX,CAAA,CAAA,KA1B9CmB,EAAAR,EAAA,EAAA,EATAS,EAAAR,EAAA,EAAA,EA2BAS,EAAAR,EAAA,GAAA,SA9BiBO,GAZnBE,EAAAC,GAG+B5B,CAAA,QAN/B,aAAaQ,kBAAamB,WAAiBzB,MA0E7C2B,GAAA,SAAA3B,EAAA,QAAA,SAAA4B,EAAA,CAWE,IAAAL,EAAA,SAAAzB,EAAA,QAAA,SAAA+B,EAAA,QAAA,SAAA5C,EAAA,CAOO,OACL,SAAAC,EAAA,CACE,GAAAA,aAAAK,SACE,UAAA,UAHNsC,CAAA,EAAA,EAIUtB,EAAOV,GAJjBC,CAAA,EAIgCC,CAAA,EAAeC,CAAA,OACAO,CAAA,EAL/CtB,CAAA,EAMUmC,EAAAU,GAAiBC,CAAA,eACEX,CAAA,EAAAY,GAAyBJ,CAAA,CAAA,CAAA,EAAA,EACzC,SAAcG,OAASX,iBAAMrB,IACtC,GAAAb,aAAAE,EAAM,OACJ,UAAA,IAVNyC,CAAA,EAAA3C,EAAA,OAAA,cAAA,EAAA,wEAAAD,CAAA,EAcUgD,EAAAH,GAAoBI,CAAA,kCACGD,CAAA,CAAA,EACzBjD,GAAciD,CAAA,EAAQE,CAAA,EAAQC,CAAA,CAAA,EAAA,EACzB,SAAuBF,OAAgBD,sLA9BpD,QAAEV,6BAEA7B,WACSA,MAlBb2C,GAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,mCAOE,SAAAxC,EAAA,WACU2B,GAAW3B,CAAA,EAASwC,CAAA,CAAA,EAASF,CAAA,EAAUC,CAAA,wFCpEnDE,GAAAC,GAAAC,GACiC,UAAA,CAAA,EAAAC,GAAwC,SAAAC,EAAA,cAC7C,eAAA,EAAgB,EAAA,EAAAC,GAAcD,CAAA,CAAA,CAAA,KApC1DE,IAAA,SAAAC,EAAA,QAAA,SAAAC,EAAA,iBAGsBD,CAAA,CAAA,EAAAJ,GAA8C,SAAAC,EAAA,oBACbI,CAAA,CAAA,CAAA,EAAA,MAAA,EAAoBJ,CAAA,CAAA,QAS3EK,IAAA,SAAAF,EAAA,QAAA,SAAAG,EAAA,iBAGsBH,CAAA,CAAA,EAAAJ,GAA8C,SAAAC,EAAA,oBAC1CM,CAAA,CAAA,EAAA,MAAA,EAAYN,CAAA,CAAA,CAAA,EAAhC,UAAA,QACAJ,WAENW,IAAA,SAAAJ,EAAA,QAAA,SAAAK,EAAA,iBAGsBL,CAAA,CAAA,EAAAJ,GAA8C,SAAAC,EAAA,oBAC1CQ,CAAA,CAAA,EAAA,MAAA,EAAWR,CAAA,CAAA,CAAA,EAA/B,UAAA,QACAJ,WAhCNa,IAAA,SAAAN,EAAA,QAAA,SAAAO,EAAA,iBAGsBP,CAAA,CAAA,EAAAJ,GAA8C,SAAAC,EAAA,oBAC1CU,CAAA,CAAA,EAAA,MAAA,EAAaV,CAAA,CAAA,CAAA,EAAjC,UAAA,QACAJ,WAQNe,IAAA,SAAAR,EAAA,QAAA,SAAAS,EAAA,iBAGsBT,CAAA,CAAA,EAAAJ,GAA8C,SAAAC,EAAA,oBACvCY,CAAA,CAAA,EAAA,MAAA,EAAYZ,CAAA,CAAA,CAAA,EAAnC,UAAA,QACAJ,WAgBNiB,IAAA,SAAAV,EAAA,QAAA,SAAAW,EAAA,iBAGsBX,CAAA,CAAA,EAAAJ,GAA8C,SAAAC,EAAA,oBACvCc,CAAA,CAAA,EAAA,MAAA,EAAsBd,CAAA,CAAA,CAAA,EAA7C,UAAA,QACAJ,WA1CNmB,IAAA,SAAAC,EAAA,WACY,SAAAC,EAAA,iBAAAA,CAAA,CAAA,CAAA,OAAiDD,CAAA,CAAA",
-  "names": ["require_moment", "__commonJSMin", "exports", "module", "global", "factory", "hookCallback", "hooks", "setHookCallback", "callback", "isArray", "input", "isObject", "hasOwnProp", "a", "b", "isObjectEmpty", "obj", "k", "isUndefined", "isNumber", "isDate", "map", "arr", "fn", "res", "i", "arrLen", "extend", "createUTC", "format", "locale", "strict", "createLocalOrUTC", "defaultParsingFlags", "getParsingFlags", "m", "some", "fun", "t", "len", "isValid", "flags", "parsedParts", "isNowValid", "createInvalid", "momentProperties", "updateInProgress", "copyConfig", "to", "from", "prop", "val", "momentPropertiesLen", "Moment", "config", "isMoment", "warn", "msg", "deprecate", "firstTime", "args", "arg", "key", "argLen", "deprecations", "deprecateSimple", "name", "isFunction", "set", "mergeConfigs", "parentConfig", "childConfig", "Locale", "keys", "defaultCalendar", "calendar", "mom", "now", "output", "zeroFill", "number", "targetLength", "forceSign", "absNumber", "zerosToFill", "sign", "formattingTokens", "localFormattingTokens", "formatFunctions", "formatTokenFunctions", "addFormatToken", "token", "padded", "ordinal", "func", "removeFormattingTokens", "makeFormatFunction", "array", "length", "formatMoment", "expandFormat", "replaceLongDateFormatTokens", "defaultLongDateFormat", "longDateFormat", "formatUpper", "tok", "defaultInvalidDate", "invalidDate", "defaultOrdinal", "defaultDayOfMonthOrdinalParse", "defaultRelativeTime", "relativeTime", "withoutSuffix", "string", "isFuture", "pastFuture", "diff", "aliases", "normalizeUnits", "units", "normalizeObjectUnits", "inputObject", "normalizedInput", "normalizedProp", "priorities", "getPrioritizedUnits", "unitsObj", "u", "match1", "match2", "match3", "match4", "match6", "match1to2", "match3to4", "match5to6", "match1to3", "match1to4", "match1to6", "matchUnsigned", "matchSigned", "matchOffset", "matchShortOffset", "matchTimestamp", "matchWord", "match1to2NoLeadingZero", "match1to2HasZero", "regexes", "addRegexToken", "regex", "strictRegex", "isStrict", "localeData", "getParseRegexForToken", "unescapeFormat", "s", "regexEscape", "matched", "p1", "p2", "p3", "p4", "absFloor", "toInt", "argumentForCoercion", "coercedNumber", "value", "tokens", "addParseToken", "tokenLen", "addWeekParseToken", "addTimeToArrayFromToken", "isLeapYear", "year", "YEAR", "MONTH", "DATE", "HOUR", "MINUTE", "SECOND", "MILLISECOND", "WEEK", "WEEKDAY", "y", "daysInYear", "getSetYear", "makeGetSet", "getIsLeapYear", "unit", "keepTime", "set$1", "get", "d", "isUTC", "month", "date", "stringGet", "stringSet", "prioritized", "prioritizedLen", "mod", "n", "x", "indexOf", "o", "daysInMonth", "modMonth", "defaultLocaleMonths", "defaultLocaleMonthsShort", "MONTHS_IN_FORMAT", "defaultMonthsShortRegex", "defaultMonthsRegex", "localeMonths", "localeMonthsShort", "handleStrictParse", "monthName", "ii", "llc", "localeMonthsParse", "setMonth", "getSetMonth", "getDaysInMonth", "monthsShortRegex", "computeMonthsParse", "monthsRegex", "cmpLenRev", "shortPieces", "longPieces", "mixedPieces", "shortP", "longP", "createDate", "h", "M", "ms", "createUTCDate", "firstWeekOffset", "dow", "doy", "fwd", "fwdlw", "dayOfYearFromWeeks", "week", "weekday", "localWeekday", "weekOffset", "dayOfYear", "resYear", "resDayOfYear", "weekOfYear", "resWeek", "weeksInYear", "weekOffsetNext", "localeWeek", "defaultLocaleWeek", "localeFirstDayOfWeek", "localeFirstDayOfYear", "getSetWeek", "getSetISOWeek", "parseWeekday", "parseIsoWeekday", "shiftWeekdays", "ws", "defaultLocaleWeekdays", "defaultLocaleWeekdaysShort", "defaultLocaleWeekdaysMin", "defaultWeekdaysRegex", "defaultWeekdaysShortRegex", "defaultWeekdaysMinRegex", "localeWeekdays", "weekdays", "localeWeekdaysShort", "localeWeekdaysMin", "handleStrictParse$1", "weekdayName", "localeWeekdaysParse", "getSetDayOfWeek", "day", "getSetLocaleDayOfWeek", "getSetISODayOfWeek", "weekdaysRegex", "computeWeekdaysParse", "weekdaysShortRegex", "weekdaysMinRegex", "minPieces", "minp", "shortp", "longp", "hFormat", "kFormat", "meridiem", "lowercase", "matchMeridiem", "kInput", "pos", "pos1", "pos2", "localeIsPM", "defaultLocaleMeridiemParse", "getSetHour", "localeMeridiem", "hours", "minutes", "isLower", "baseConfig", "locales", "localeFamilies", "globalLocale", "commonPrefix", "arr1", "arr2", "minl", "normalizeLocale", "chooseLocale", "names", "j", "next", "split", "loadLocale", "isLocaleNameSane", "oldLocale", "aliasedRequire", "__require", "getSetGlobalLocale", "e", "values", "data", "getLocale", "defineLocale", "updateLocale", "tmpLocale", "listLocales", "checkOverflow", "overflow", "extendedIsoRegex", "basicIsoRegex", "tzRegex", "isoDates", "isoTimes", "aspNetJsonRegex", "rfc2822", "obsOffsets", "configFromISO", "l", "match", "allowTime", "dateFormat", "timeFormat", "tzFormat", "isoDatesLen", "isoTimesLen", "configFromStringAndFormat", "extractFromRFC2822Strings", "yearStr", "monthStr", "dayStr", "hourStr", "minuteStr", "secondStr", "result", "untruncateYear", "preprocessRFC2822", "checkWeekday", "weekdayStr", "parsedInput", "weekdayProvided", "weekdayActual", "calculateOffset", "obsOffset", "militaryOffset", "numOffset", "hm", "configFromRFC2822", "parsedArray", "configFromString", "defaults", "currentDateArray", "nowValue", "configFromArray", "currentDate", "expectedWeekday", "yearToUse", "dayOfYearFromWeekInfo", "w", "weekYear", "temp", "weekdayOverflow", "curWeek", "createLocal", "skipped", "stringLength", "totalParsedInputLength", "era", "meridiemFixWrap", "hour", "isPm", "configFromStringAndArray", "tempConfig", "bestMoment", "scoreToBeat", "currentScore", "validFormatFound", "bestFormatIsValid", "configfLen", "configFromObject", "dayOrDate", "createFromConfig", "prepareConfig", "configFromInput", "c", "prototypeMin", "other", "prototypeMax", "pickBy", "moments", "min", "max", "ordering", "isDurationValid", "unitHasDecimal", "orderLen", "isValid$1", "createInvalid$1", "createDuration", "Duration", "duration", "years", "quarters", "months", "weeks", "days", "seconds", "milliseconds", "isDuration", "absRound", "compareArrays", "array1", "array2", "dontConvert", "lengthDiff", "diffs", "offset", "separator", "offsetFromString", "chunkOffset", "matcher", "matches", "chunk", "parts", "cloneWithOffset", "model", "getDateOffset", "getSetOffset", "keepLocalTime", "keepMinutes", "localAdjust", "addSubtract", "getSetZone", "setOffsetToUTC", "setOffsetToLocal", "setOffsetToParsedOffset", "tZone", "hasAlignedHourOffset", "isDaylightSavingTime", "isDaylightSavingTimeShifted", "isLocal", "isUtcOffset", "isUtc", "aspNetRegex", "isoRegex", "ret", "diffRes", "parseIso", "momentsDifference", "inp", "positiveMomentsDifference", "base", "createAdder", "direction", "period", "dur", "tmp", "isAdding", "updateOffset", "add", "subtract", "isString", "isMomentInput", "isNumberOrStringArray", "isMomentInputObject", "objectTest", "propertyTest", "properties", "property", "propertyLen", "arrayTest", "dataTypeTest", "item", "isCalendarSpec", "getCalendarFormat", "myMoment", "calendar$1", "time", "formats", "sod", "clone", "isAfter", "localInput", "isBefore", "isBetween", "inclusivity", "localFrom", "localTo", "isSame", "inputMs", "isSameOrAfter", "isSameOrBefore", "asFloat", "that", "zoneDelta", "monthDiff", "wholeMonthDiff", "anchor", "anchor2", "adjust", "toString", "toISOString", "keepOffset", "utc", "inspect", "zone", "prefix", "datetime", "suffix", "inputString", "fromNow", "toNow", "newLocaleData", "lang", "MS_PER_SECOND", "MS_PER_MINUTE", "MS_PER_HOUR", "MS_PER_400_YEARS", "mod$1", "dividend", "divisor", "localStartOfDate", "utcStartOfDate", "startOf", "startOfDate", "endOf", "valueOf", "unix", "toDate", "toArray", "toObject", "toJSON", "isValid$2", "parsingFlags", "invalidAt", "creationData", "matchEraAbbr", "matchEraName", "matchEraNarrow", "matchEraYearOrdinal", "localeEras", "eras", "localeErasParse", "eraName", "abbr", "narrow", "localeErasConvertYear", "dir", "getEraName", "getEraNarrow", "getEraAbbr", "getEraYear", "erasNameRegex", "computeErasParse", "erasAbbrRegex", "erasNarrowRegex", "abbrPieces", "namePieces", "narrowPieces", "erasName", "erasAbbr", "erasNarrow", "addWeekYearFormatToken", "getter", "getSetWeekYear", "getSetWeekYearHelper", "getSetISOWeekYear", "getISOWeeksInYear", "getISOWeeksInISOWeekYear", "getWeeksInYear", "weekInfo", "getWeeksInWeekYear", "weeksTarget", "setWeekAll", "dayOfYearData", "getSetQuarter", "getSetDayOfMonth", "getSetDayOfYear", "getSetMinute", "getSetSecond", "getSetMillisecond", "parseMs", "getZoneAbbr", "getZoneName", "proto", "createUnix", "createInZone", "preParsePostFormat", "proto$1", "get$1", "index", "field", "setter", "listMonthsImpl", "out", "listWeekdaysImpl", "localeSorted", "shift", "listMonths", "listMonthsShort", "listWeekdays", "listWeekdaysShort", "listWeekdaysMin", "mathAbs", "abs", "addSubtract$1", "add$1", "subtract$1", "absCeil", "bubble", "monthsFromDays", "monthsToDays", "daysToMonths", "as", "makeAs", "alias", "asMilliseconds", "asSeconds", "asMinutes", "asHours", "asDays", "asWeeks", "asMonths", "asQuarters", "asYears", "valueOf$1", "clone$1", "get$2", "makeGetter", "round", "thresholds", "substituteTimeAgo", "relativeTime$1", "posNegDuration", "getSetRelativeTimeRounding", "roundingFunction", "getSetRelativeTimeThreshold", "threshold", "limit", "humanize", "argWithSuffix", "argThresholds", "withSuffix", "th", "abs$1", "toISOString$1", "total", "totalSign", "ymSign", "daysSign", "hmsSign", "proto$2", "entries", "setPrototypeOf", "isFrozen", "getPrototypeOf", "getOwnPropertyDescriptor", "Object", "freeze", "seal", "create", "apply", "construct", "Reflect", "x", "fun", "thisValue", "args", "Func", "arrayForEach", "unapply", "Array", "prototype", "forEach", "arrayPop", "pop", "arrayPush", "push", "stringToLowerCase", "String", "toLowerCase", "stringToString", "toString", "stringMatch", "match", "stringReplace", "replace", "stringIndexOf", "indexOf", "stringTrim", "trim", "regExpTest", "RegExp", "test", "typeErrorCreate", "unconstruct", "TypeError", "func", "thisArg", "_len", "arguments", "length", "_key", "_len2", "_key2", "addToSet", "set", "array", "transformCaseFunc", "undefined", "l", "element", "lcElement", "cleanArray", "index", "clone", "object", "newObject", "property", "value", "isArray", "constructor", "lookupGetter", "prop", "desc", "get", "fallbackValue", "console", "warn", "html", "svg", "svgFilters", "svgDisallowed", "mathMl", "mathMlDisallowed", "text", "xml", "MUSTACHE_EXPR", "ERB_EXPR", "TMPLIT_EXPR", "DATA_ATTR", "ARIA_ATTR", "IS_ALLOWED_URI", "IS_SCRIPT_OR_DATA", "ATTR_WHITESPACE", "DOCTYPE_NAME", "getGlobal", "window", "_createTrustedTypesPolicy", "trustedTypes", "purifyHostElement", "createPolicy", "suffix", "ATTR_NAME", "hasAttribute", "getAttribute", "policyName", "createHTML", "createScriptURL", "scriptUrl", "_", "createDOMPurify", "DOMPurify", "root", "version", "VERSION", "removed", "document", "nodeType", "isSupported", "originalDocument", "currentScript", "DocumentFragment", "HTMLTemplateElement", "Node", "Element", "NodeFilter", "NamedNodeMap", "MozNamedAttrMap", "HTMLFormElement", "DOMParser", "ElementPrototype", "cloneNode", "getNextSibling", "getChildNodes", "getParentNode", "template", "createElement", "content", "ownerDocument", "trustedTypesPolicy", "emptyHTML", "implementation", "createNodeIterator", "createDocumentFragment", "getElementsByTagName", "importNode", "hooks", "createHTMLDocument", "EXPRESSIONS", "ALLOWED_TAGS", "DEFAULT_ALLOWED_TAGS", "TAGS", "ALLOWED_ATTR", "DEFAULT_ALLOWED_ATTR", "ATTRS", "CUSTOM_ELEMENT_HANDLING", "tagNameCheck", "writable", "configurable", "enumerable", "attributeNameCheck", "allowCustomizedBuiltInElements", "FORBID_TAGS", "FORBID_ATTR", "ALLOW_ARIA_ATTR", "ALLOW_DATA_ATTR", "ALLOW_UNKNOWN_PROTOCOLS", "ALLOW_SELF_CLOSE_IN_ATTR", "SAFE_FOR_TEMPLATES", "WHOLE_DOCUMENT", "SET_CONFIG", "FORCE_BODY", "RETURN_DOM", "RETURN_DOM_FRAGMENT", "RETURN_TRUSTED_TYPE", "SANITIZE_DOM", "SANITIZE_NAMED_PROPS", "SANITIZE_NAMED_PROPS_PREFIX", "KEEP_CONTENT", "IN_PLACE", "USE_PROFILES", "FORBID_CONTENTS", "DEFAULT_FORBID_CONTENTS", "DATA_URI_TAGS", "DEFAULT_DATA_URI_TAGS", "URI_SAFE_ATTRIBUTES", "DEFAULT_URI_SAFE_ATTRIBUTES", "MATHML_NAMESPACE", "SVG_NAMESPACE", "HTML_NAMESPACE", "NAMESPACE", "IS_EMPTY_INPUT", "ALLOWED_NAMESPACES", "DEFAULT_ALLOWED_NAMESPACES", "PARSER_MEDIA_TYPE", "SUPPORTED_PARSER_MEDIA_TYPES", "DEFAULT_PARSER_MEDIA_TYPE", "CONFIG", "formElement", "isRegexOrFunction", "testValue", "Function", "_parseConfig", "cfg", "ADD_URI_SAFE_ATTR", "ADD_DATA_URI_TAGS", "ALLOWED_URI_REGEXP", "ADD_TAGS", "ADD_ATTR", "table", "tbody", "TRUSTED_TYPES_POLICY", "MATHML_TEXT_INTEGRATION_POINTS", "HTML_INTEGRATION_POINTS", "COMMON_SVG_AND_HTML_ELEMENTS", "ALL_SVG_TAGS", "ALL_MATHML_TAGS", "_checkValidNamespace", "parent", "tagName", "namespaceURI", "parentTagName", "Boolean", "_forceRemove", "node", "parentNode", "removeChild", "remove", "_removeAttribute", "name", "attribute", "getAttributeNode", "from", "removeAttribute", "setAttribute", "_initDocument", "dirty", "doc", "leadingWhitespace", "matches", "dirtyPayload", "parseFromString", "documentElement", "createDocument", "innerHTML", "body", "insertBefore", "createTextNode", "childNodes", "call", "_createNodeIterator", "SHOW_ELEMENT", "SHOW_COMMENT", "SHOW_TEXT", "_isClobbered", "elm", "nodeName", "textContent", "attributes", "hasChildNodes", "_isNode", "_executeHook", "entryPoint", "currentNode", "data", "hook", "_sanitizeElements", "allowedTags", "firstElementChild", "_isBasicCustomElement", "childCount", "i", "expr", "_isValidAttribute", "lcTag", "lcName", "_sanitizeAttributes", "hookEvent", "attrName", "attrValue", "keepAttr", "allowedAttributes", "attr", "forceKeepAttr", "getAttributeType", "setAttributeNS", "_sanitizeShadowDOM", "fragment", "shadowNode", "shadowIterator", "nextNode", "sanitize", "importedNode", "returnNode", "appendChild", "firstChild", "nodeIterator", "shadowroot", "shadowrootmode", "serializedHTML", "outerHTML", "doctype", "setConfig", "clearConfig", "isValidAttribute", "tag", "addHook", "hookFunction", "removeHook", "removeHooks", "removeAllHooks", "purify", "_ajax", "platformSpecificDriver", "timeoutErrorMessageIdent", "requestFailedMessageIdent", "mkHeader", "options", "errback", "callback", "xhr", "fixedUrl", "i", "header", "e", "onerror", "msgIdent", "error", "cancelErrback", "cancelCallback", "arrayMap", "f", "arr", "l", "result", "i", "semigroupoidFn", "f", "g", "x", "compose", "dict", "identity", "dict", "categoryFn", "x", "otherwise", "on", "f", "g", "x", "y", "flip", "b", "a", "$$const", "v", "$$Proxy", "map", "dict", "mapFlipped", "dictFunctor", "fa", "f", "$$void", "$$const", "voidLeft", "x", "functorArray", "concatString", "s1", "s2", "concatArray", "xs", "ys", "reflectSymbol", "dict", "absurd", "a", "spin", "$copy_v", "v", "unsafeGet", "label", "rec", "semigroupString", "semigroupArray", "append", "dict", "alt", "dict", "arrayApply", "fs", "xs", "l", "k", "result", "n", "i", "f", "j", "applyArray", "apply", "dict", "applySecond", "dictApply", "apply", "b", "lift2", "f", "a", "pure", "dict", "unless", "dictApplicative", "v", "v1", "pure1", "when", "liftA1", "f", "a", "topChar", "bottomChar", "topNumber", "bottomNumber", "unsafeCompareImpl", "lt", "eq", "gt", "x", "y", "ordIntImpl", "unsafeCompareImpl", "ordStringImpl", "unsafeCompareImpl", "ordCharImpl", "refEq", "r1", "r2", "eqIntImpl", "refEq", "eqCharImpl", "refEq", "eqStringImpl", "eqArrayImpl", "f", "xs", "ys", "i", "eqUnit", "v", "v1", "eqString", "eqInt", "eqChar", "eq", "dict", "eqArray", "dictEq", "eq", "LT", "GT", "EQ", "eqOrdering", "v", "v1", "LT", "GT", "EQ", "intSub", "x", "y", "intAdd", "x", "y", "intMul", "semiringInt", "ringInt", "ordUnit", "v", "v1", "ordString", "ordInt", "ordChar", "compare", "dict", "comparing", "dictOrd", "compare", "f", "x", "y", "top", "dict", "boundedChar", "bottom", "dict", "showIntImpl", "showNumberImpl", "str", "showStringImpl", "s", "l", "c", "i", "k", "empty", "showString", "showNumber", "showInt", "show", "dict", "Nothing", "Just", "maybe", "v", "v1", "v2", "Nothing", "Just", "isNothing", "$$const", "isJust", "functorMaybe", "v", "v1", "Just", "Nothing", "fromMaybe", "a", "maybe", "identity", "fromJust", "v", "Just", "applyMaybe", "v", "v1", "Just", "map", "Nothing", "bindMaybe", "v", "v1", "Just", "Nothing", "applicativeMaybe", "applicationJSON", "applicationFormURLEncoded", "ArrayView", "Blob", "Document", "$$String", "FormData", "FormURLEncoded", "Json", "toMediaType", "v", "Just", "applicationFormURLEncoded", "applicationJSON", "Nothing", "string", "unsafeCoerce", "x", "coerce", "unwrap", "alaF", "v", "Accept", "ContentType", "RequestHeader", "value", "v", "unwrap", "name", "v", "Accept", "ContentType", "RequestHeader", "$$ArrayBuffer", "Blob", "Document", "Json", "$$String", "Ignore", "toResponseType", "v", "toMediaType", "Just", "applicationJSON", "Nothing", "string", "json", "ignore", "ResponseHeader", "arrayBind", "arr", "f", "result", "i", "l", "discard", "dict", "bindArray", "bind", "dict", "bindFlipped", "dictBind", "composeKleisliFlipped", "f", "g", "a", "composeKleisli", "discardUnit", "dictBind", "bind", "join", "dictBind", "bind", "m", "identity", "Left", "Right", "note", "a", "Right", "functorEither", "either", "v", "v1", "v2", "Left", "Right", "hush", "$$const", "Nothing", "Just", "applyEither", "v", "v1", "Left", "Right", "map", "applicativeEither", "pureE", "a", "bindE", "f", "whenM", "dictMonad", "mb", "m", "b", "unlessM", "ap", "dictMonad", "f", "a", "f$prime", "a$prime", "intDegree", "x", "intDiv", "y", "intMod", "yy", "commutativeRingInt", "mod", "dict", "euclideanRingInt", "div", "dict", "monoidString", "monoidArray", "mempty", "dict", "guard", "dictMonoid", "mempty", "v", "v1", "mempty1", "monadEffect", "bindEffect", "applicativeEffect", "functorEffect", "$lazy_functorEffect", "applyEffect", "$lazy_applyEffect", "semigroupEffect", "dictSemigroup", "monoidEffect", "dictMonoid", "error", "msg", "message", "e", "throwException", "e", "$$throw", "$4", "throwError", "dict", "catchError", "dict", "$$try", "dictMonadError", "catchError", "a", "$52", "Identity", "x", "functorIdentity", "applyIdentity", "v", "v1", "bindIdentity", "f", "applicativeIdentity", "Identity", "monadIdentity", "_new", "val", "read", "ref", "modifyImpl", "f", "write", "val", "$$new", "_new", "modify$prime", "modifyImpl", "modify", "f", "s", "s$prime", "modify_", "Loop", "Done", "tailRecM", "dict", "monadRecEffect", "f", "a", "fromDone", "v", "Done", "r", "Loop", "e", "read", "boolConj", "b1", "b2", "boolDisj", "boolNot", "b", "tt", "dict", "not", "dict", "implies", "dict", "ff", "dict", "disj", "dict", "heytingAlgebraBoolean", "a", "b", "not", "conj", "dict", "heytingAlgebraFunction", "dictHeytingAlgebra", "ff", "tt", "implies", "disj", "not", "v", "f", "g", "a", "Tuple", "uncurry", "f", "v", "snd", "v", "functorTuple", "fst", "v", "eqTuple", "dictEq", "dictEq1", "ordTuple", "dictOrd", "dictOrd1", "v", "compare", "x", "y", "LT", "GT", "state", "dict", "modify_", "dictMonadState", "state", "f", "s", "modify", "s$prime", "gets", "get", "monadEffectEffect", "liftEffect", "dict", "ExceptT", "x", "runExceptT", "v", "mapExceptT", "f", "v", "functorExceptT", "dictFunctor", "map1", "map", "monadExceptT", "dictMonad", "bindExceptT", "v", "k", "bind", "either", "$187", "a", "v1", "applyExceptT", "applicativeExceptT", "$188", "pure", "$189", "ExceptT", "Right", "monadThrowExceptT", "dictMonad", "$198", "pure", "$199", "ExceptT", "Left", "altExceptT", "dictSemigroup", "dictMonad", "v", "v1", "bind", "rm", "Right", "pure", "Left", "rn", "append", "runExcept", "$3", "stringify", "j", "empty", "_lookup", "no", "yes", "k", "m", "toArrayWithKey", "f", "m", "r", "k", "keys", "replicateFill", "count", "value", "result", "replicatePolyfill", "n", "i", "replicateImpl", "length", "xs", "findIndexImpl", "just", "nothing", "f", "xs", "i", "l", "_deleteAt", "just", "nothing", "i", "l", "l1", "concat", "xss", "result", "i", "l", "xs", "j", "m", "filterImpl", "f", "sortByImpl", "mergeFromTo", "compare", "fromOrdering", "xs1", "xs2", "from", "to", "mid", "i", "j", "k", "x", "y", "c", "xs", "out", "sliceImpl", "s", "l", "unsafeIndexImpl", "xs", "n", "unsafeFreezeThawImpl", "xs", "unsafeFreezeImpl", "copyImpl", "xs", "thawImpl", "copyImpl", "pushImpl", "a", "xs", "runSTFn1", "fn", "a", "runSTFn2", "b", "unsafeFreeze", "runSTFn1", "unsafeFreezeImpl", "thaw", "runSTFn1", "thawImpl", "withArray", "f", "xs", "result", "unsafeFreeze", "push", "runSTFn2", "pushImpl", "foldrArray", "f", "init", "xs", "acc", "len", "foldlArray", "empty", "dict", "bimap", "dict", "Disj", "x", "semigroupDisj", "dictHeytingAlgebra", "v", "v1", "disj", "monoidDisj", "dictHeytingAlgebra", "foldr", "dict", "traverse_", "dictApplicative", "dictFoldable", "foldr", "f", "$454", "for_", "foldl", "dict", "intercalate", "dictFoldable", "foldl", "dictMonoid", "sep", "xs", "go", "v", "v1", "append", "maximumBy", "dictFoldable", "foldl", "cmp", "max$prime", "v", "v1", "Nothing", "Just", "GT", "$303", "maximum", "dictOrd", "compare", "minimumBy", "min$prime", "LT", "$307", "minimum", "foldableMaybe", "v", "v1", "v2", "Nothing", "Just", "dictMonoid", "foldMapDefaultR", "dictFoldable", "foldr", "dictMonoid", "f", "x", "acc", "foldableArray", "foldMap", "dict", "any", "dictFoldable", "foldMap", "dictHeytingAlgebra", "runFn2", "fn", "a", "b", "runFn3", "c", "runFn4", "d", "traverseArrayImpl", "array1", "a", "array2", "b", "array3", "c", "concat2", "xs", "ys", "apply", "map", "pure", "f", "array", "go", "bot", "top", "pivot", "traverse", "dict", "sequenceDefault", "dictTraversable", "traverse", "dictApplicative", "traversableArray", "unfoldrArrayImpl", "isNothing", "fromJust", "fst", "snd", "f", "b", "result", "value", "maybe", "tuple", "unfoldr1ArrayImpl", "isNothing", "fromJust", "fst", "snd", "f", "b", "result", "value", "tuple", "maybe", "unfoldable1Array", "unfoldr", "dict", "unfoldableArray", "unsafeIndex", "toUnfoldable", "dictUnfoldable", "xs", "len", "length", "f", "otherwise", "sortBy", "comp", "v", "GT", "EQ", "LT", "snoc", "xs", "x", "slice", "runFn3", "sliceImpl", "singleton", "a", "$$null", "xs", "intercalate", "dictMonoid", "foldMap", "dictMonoid", "findIndex", "find", "f", "xs", "filter", "runFn2", "filterImpl", "elemIndex", "dictEq", "x", "findIndex", "v", "notElem", "a", "arr", "drop", "xs", "$173", "slice", "length", "deleteAt", "deleteBy", "v", "v1", "v2", "maybe", "i", "findIndex", "$$delete", "dictEq", "eq", "cons", "x", "xs", "concatMap", "flip", "bind", "bindArray", "mapMaybe", "f", "$189", "maybe", "singleton", "$190", "newImpl", "values", "toArrayWithKey", "v", "v1", "toUnfoldable", "dictUnfoldable", "$89", "$90", "Tuple", "$91", "lookup", "jsonEmptyObject", "empty", "_jsonParser", "fail", "succ", "s", "e", "jsonParser", "j", "replaceAll", "s1", "s2", "s3", "split", "sep", "s", "toLower", "joinWith", "s", "xs", "$$null", "s", "encodeURIComponent_to_RFC3986", "input", "c", "_encodeURIComponent", "fail", "succeed", "input", "encodeURIComponent_to_RFC3986", "err", "_encodeFormURLComponent", "_decodeURIComponent", "$$encodeURIComponent", "encodeFormURLComponent", "$$decodeURIComponent", "toArray", "v", "encode", "encodePart", "v", "Nothing", "Just", "apply", "map", "key", "val", "$37", "joinWith", "$38", "traverse", "$39", "toArray", "OPTIONS", "GET", "HEAD", "POST", "PUT", "DELETE", "TRACE", "CONNECT", "PROPFIND", "PROPPATCH", "MKCOL", "COPY", "MOVE", "LOCK", "UNLOCK", "PATCH", "unCustomMethod", "v", "showMethod", "OPTIONS", "GET", "HEAD", "POST", "PUT", "DELETE", "TRACE", "CONNECT", "PROPFIND", "PROPPATCH", "MKCOL", "COPY", "MOVE", "LOCK", "UNLOCK", "PATCH", "print", "either", "show", "showMethod", "unCustomMethod", "NonEmpty", "singleton", "dictPlus", "a", "empty", "Nil", "Cons", "NonEmptyList", "x", "toList", "v", "listMap", "f", "chunkedRevMap", "$copy_v", "$copy_v1", "v1", "Cons", "$tco_var_v", "v", "unrolledMap", "v2", "Nil", "reverseUnrolledMap", "$copy_v2", "$copy_v3", "$tco_var_v2", "v3", "$tco_done1", "functorList", "foldableList", "f", "b", "rev", "go", "$copy_v", "$copy_v1", "v1", "Nil", "Cons", "$tco_var_v", "$284", "foldl", "flip", "$285", "$copy_b", "v", "$tco_var_b", "dictMonoid", "acc", "$286", "append2", "$287", "semigroupList", "xs", "ys", "semigroupNonEmptyList", "v", "as$prime", "NonEmpty", "append1", "toList", "altList", "plusList", "reverse", "go", "$copy_v", "$copy_v1", "v1", "Nil", "v", "Cons", "$tco_var_v", "$$null", "v", "Nil", "_unsafePartial", "f", "_crashWith", "msg", "crashWith", "unsafePartial", "_unsafePartial", "unsafeCrashWith", "msg", "singleton", "$200", "plusList", "$201", "head", "v", "cons", "y", "v", "NonEmpty", "Cons", "nullable", "a", "r", "f", "notNull", "x", "toNullable", "maybe", "notNull", "toMaybe", "Nothing", "Just", "Aff", "EMPTY", "PURE", "THROW", "CATCH", "SYNC", "ASYNC", "BIND", "BRACKET", "FORK", "SEQ", "MAP", "APPLY", "ALT", "CONS", "RESUME", "RELEASE", "FINALIZER", "FINALIZED", "FORKED", "FIBER", "THUNK", "tag", "_1", "_2", "_3", "AffCtr", "fn", "nonCanceler", "error", "runEff", "eff", "runSync", "left", "right", "runAsync", "k", "Scheduler", "limit", "size", "ix", "queue", "draining", "drain", "thunk", "cb", "i", "tmp", "Supervisor", "util", "fibers", "fiberId", "count", "fiber", "fid", "result", "killError", "killCount", "kills", "kill", "SUSPENDED", "CONTINUE", "STEP_BIND", "STEP_RESULT", "PENDING", "RETURN", "COMPLETED", "Fiber", "supervisor", "aff", "runTick", "status", "step", "fail", "interrupt", "bhead", "btail", "attempts", "bracketCount", "joinId", "joins", "rethrow", "run", "localRunTick", "attempt", "e", "sequential", "onComplete", "join", "jid", "canceler", "runPar", "par", "killId", "early", "root", "head", "tail", "kid", "loop", "lhs", "rhs", "resolve", "cancel", "innerKills", "newKills", "killCb", "_pure", "_throwError", "_catchError", "_map", "f", "value", "_bind", "_fork", "immediate", "_liftEffect", "_parAffMap", "_parAffApply", "aff1", "aff2", "makeAff", "Aff", "generalBracket", "acquire", "options", "k", "_makeFiber", "util", "aff", "_sequential", "Aff", "profunctorFn", "a2b", "c2d", "b2c", "$18", "dimap", "dict", "sequential", "dict", "parallel", "parTraverse_", "dictParallel", "dictApplicative", "dictFoldable", "f", "$51", "traverse_1", "$53", "$52", "parSequence_", "dictParallel", "parTraverse_", "dictApplicative", "dictFoldable", "unsafePerformEffect", "f", "Canceler", "x", "suspendAff", "_fork", "functorParAff", "functorAff", "forkAff", "_fork", "ffiUtil", "unsafeFromRight", "v", "Right", "Left", "unsafeCrashWith", "unsafeFromLeft", "isLeft", "makeFiber", "aff", "launchAff", "fiber", "bracket", "acquire", "completed", "applyParAff", "monadAff", "bindAff", "applicativeAff", "applyAff", "$lazy_applyAff", "$$finally", "fin", "a", "bracket", "pure2", "$$const", "parallelAff", "applicativeParAff", "$76", "semigroupCanceler", "v", "v1", "err", "monadEffectAff", "effectCanceler", "$77", "Canceler", "$$const", "liftEffect", "joinFiber", "v", "makeAff", "k", "functorFiber", "f", "t", "makeFiber", "map1", "killFiber", "e", "v", "bind1", "liftEffect", "suspended", "$$const", "pure", "makeAff", "k", "effectCanceler", "monadThrowAff", "monadErrorAff", "runAff", "k", "aff", "launchAff", "bindFlipped", "$83", "runAff_", "monadRecAff", "k", "go", "a", "res", "Done", "pure2", "Loop", "nonCanceler", "$$const", "pure2", "monoidCanceler", "fromEffectFnAff", "v", "makeAff", "k", "$9", "Left", "$10", "Right", "e", "k2", "v1", "$11", "$12", "typeOf", "value", "tagOf", "isArray", "value", "fromNumberImpl", "just", "nothing", "n", "toNumber", "log", "fromNumber", "singleton", "c", "length", "s", "drop", "s", "splitAt", "i", "s", "charAt", "i", "s", "stripPrefix", "v", "str", "v1", "splitAt", "length", "$20", "Nothing", "ForeignError", "TypeMismatch", "ErrorAtIndex", "ErrorAtProperty", "unsafeToForeign", "unsafeCoerce", "unsafeFromForeign", "renderForeignError", "v", "ForeignError", "ErrorAtIndex", "show1", "ErrorAtProperty", "show", "TypeMismatch", "fail", "dictMonad", "$153", "throwError", "monadThrowExceptT", "$154", "singleton", "unsafeReadTagged", "dictMonad", "fail", "tag", "value", "tagOf", "unsafeFromForeign", "otherwise", "readBoolean", "readNumber", "readInt", "error", "Left", "singleton", "TypeMismatch", "fromNumber", "$155", "maybe", "pure", "$156", "readNumber1", "readString", "RequestContentError", "ResponseBodyError", "TimeoutError", "RequestFailedError", "XHROtherError", "request", "driver", "req", "parseJSON", "v", "either", "$74", "fromResponse", "$$ArrayBuffer", "unsafeReadTagged", "Blob", "Document", "x", "alt", "Json", "composeKleisliFlipped", "$75", "$$String", "Ignore", "$$const", "pure", "extractContent", "ArrayView", "Right", "unsafeToForeign", "FormData", "FormURLEncoded", "note", "map", "encode", "stringify", "addHeader", "mh", "hs", "Just", "any", "on", "eq", "name", "headers", "reqContent", "ContentType", "bindFlipped", "toMediaType", "Accept", "ajaxRequest", "h", "v1", "send", "content", "ResponseHeader", "runExcept", "Left", "head", "message", "$61", "$62", "Nothing", "toNullable", "pure1", "printError", "renderForeignError", "defaultRequest", "eqStatusCode", "driver", "url", "request", "driver", "import_moment", "_app", "_mmoment8601", "just", "nothing", "tuple", "s", "m", "moment", "s1", "s2", "error", "_closeWindow", "window", "_setFocus", "elemId", "_toLocaleDateString", "dateString", "RawHTML", "x", "toLocaleDateString", "s", "setFocus", "mmoment8601", "s", "closeWindow", "win", "app$prime", "v", "_unsafeStringify", "toCharCode", "c", "fromCharCode", "toEnum", "dict", "fromEnum", "dict", "toEnumWithDefaults", "dictBoundedEnum", "toEnum", "low", "high", "x", "v", "toEnum1", "Just", "Nothing", "fromEnum1", "bottom2", "$140", "defaultSucc", "toEnum$prime", "fromEnum$prime", "a", "defaultPred", "charToEnum", "v", "toCharCode", "bottom1", "top1", "Nothing", "enumChar", "defaultSucc", "defaultPred", "boundedEnumChar", "charToEnum", "unsafeReadPropImpl", "f", "s", "key", "value", "unsafeReadProp", "dictMonad", "k", "value", "typeOf", "pure", "readProp", "get", "dictIsSymbol", "l", "r", "copyRecord", "rec", "copy", "key", "unsafeInsert", "l", "a", "semigroupoidBuilder", "semigroupoidFn", "insert", "dictIsSymbol", "l", "r1", "categoryBuilder", "categoryFn", "build", "v", "r1", "copyRecord", "writeImplFields", "dict", "writeImpl", "writeJSON", "dictWriteForeign", "$191", "$192", "writeForeignString", "writeForeignNullable", "dictWriteForeign", "$195", "maybe", "unsafeToForeign", "toNullable", "Nothing", "writeImpl", "$196", "toMaybe", "writeForeignInt", "writeForeignForeign", "writeForeignBoolean", "recordWriteForeign", "dictWriteForeignFields", "writeImplFields", "rec", "steps", "writeImplFields1", "$$Proxy", "nilWriteForeignFields", "v", "v1", "consWriteForeignFields", "dictIsSymbol", "dictWriteForeign", "writeImpl", "dictWriteForeignFields", "writeImplFields", "v", "rec", "rest", "writeImplFields1", "$$Proxy", "value", "writeImpl1", "get", "result", "compose1", "insert1", "TagCloudModeTop", "TagCloudModeLowerBound", "TagCloudModeRelated", "TagCloudModeNone", "writeForeignTagCloudMode$prime", "recordWriteForeign", "consWriteForeignFields", "expandedIsSymbol", "writeForeignBoolean", "modeIsSymbol", "writeForeignString", "valueIsSymbol", "writeForeignForeign", "nilWriteForeignFields", "writeForeignNote$prime", "createdIsSymbol", "idIsSymbol", "writeForeignInt", "isMarkdownIsSymbol", "lengthIsSymbol", "sharedIsSymbol", "textIsSymbol", "consWriteForeignFields1", "updatedIsSymbol", "writeForeignBookmark$prime", "archiveUrlIsSymbol", "writeForeignNullable", "bidIsSymbol", "descriptionIsSymbol", "privateIsSymbol", "selectedIsSymbol", "tagsIsSymbol", "timeIsSymbol", "toreadIsSymbol", "urlIsSymbol", "writeForeignAccountSettin", "archiveDefaultIsSymbol", "privacyLockIsSymbol", "privateDefaultIsSymbol", "eqTagCloudModeF", "tagCloudModeToF", "tagCloudMode", "readInt", "s", "split", "pure", "TagCloudModeNone", "tagCloudModeFromF", "v", "TagCloudModeTop", "TagCloudModeLowerBound", "TagCloudModeRelated", "setExpanded", "v", "v1", "TagCloudModeTop", "TagCloudModeLowerBound", "TagCloudModeRelated", "TagCloudModeNone", "isRelated", "isExpanded", "windowImpl", "ClassName", "x", "_referrer", "doc", "toParentNode", "unsafeCoerce", "toDocument", "unsafeCoerce", "referrer", "doc", "_read", "nothing", "just", "value", "tag", "toNode", "unsafeCoerce", "toElement", "unsafeCoerce", "fromElement", "x", "setHref", "href", "location", "origin", "search", "location", "reload", "location", "document", "window", "location", "window", "Star", "UnStar", "showStar", "v", "fetchUrl", "method", "url", "headers", "content", "rt", "app", "app$prime", "logout", "u", "POST", "Nothing", "ignore", "fetchPath", "path", "fetchUrlEnc", "ContentType", "applicationFormURLEncoded", "map", "FormURLEncoded", "markRead", "bid", "show", "toggleStar", "action", "show1", "fetchJson", "dictWriteForeign", "applicationJSON", "$25", "writeForeignTagCloudMode$prime", "writeForeignBookmark$prime", "writeForeignNote$prime", "writeForeignAccountSettin", "getTagCloud", "mode", "Just", "json", "eres", "res", "lookupTitle", "bm", "string", "$24", "updateTagCloudMode", "editNote", "editBookmark", "editAccountSettings", "us", "destroyNote", "nid", "DELETE", "destroy", "InputButton", "InputCheckbox", "InputColor", "InputDate", "InputDatetimeLocal", "InputEmail", "InputFile", "InputHidden", "InputImage", "InputMonth", "InputNumber", "InputPassword", "InputRadio", "InputRange", "InputReset", "InputSearch", "InputSubmit", "InputTel", "InputText", "InputTime", "InputUrl", "InputWeek", "renderInputType", "v", "profunctorForget", "f", "v", "v1", "$36", "strongForget", "$37", "fst", "$38", "snd", "strongFn", "a2b", "v", "Tuple", "first", "dict", "view", "l", "identity", "viewOn", "s", "use", "dictMonadState", "p", "v", "lens$prime", "to", "dictStrong", "pab", "v", "lens", "get", "set", "s", "b", "over", "l", "set", "b", "$$const", "modifying", "dictMonadState", "p", "f", "over", "assign", "dictMonadState", "p", "b", "set", "monadAffAff", "liftAff", "dict", "runExists", "unsafeCoerce", "mkExists", "CoyonedaF", "unCoyoneda", "f", "v", "runExists", "v1", "coyoneda", "k", "fi", "functorCoyoneda", "f", "v", "runExists", "v1", "$180", "liftCoyoneda", "coyoneda", "identity", "categoryFn", "Leaf", "Node", "Split", "SplitLast", "unsafeNode", "k", "v", "l", "r", "Leaf", "Node", "$277", "singleton", "k", "v", "Leaf", "unsafeBalancedNode", "height", "Node", "rotateLeft", "l", "rk", "rv", "rl", "rr", "unsafeNode", "rotateRight", "lk", "lv", "ll", "lr", "r", "comp", "m", "LT", "v1", "$lazy_unsafeSplit", "Split", "GT", "EQ", "unsafeSplit", "$lazy_unsafeSplitLast", "SplitLast", "unsafeSplitLast", "unsafeJoinNodes", "v2", "pop", "dictOrd", "k", "m", "v", "unsafeSplit", "compare", "map", "a", "unsafeJoinNodes", "lookup", "dictOrd", "k", "go", "$copy_v", "v", "Leaf", "Node", "v1", "compare", "LT", "GT", "EQ", "insert", "dictOrd", "k", "v", "go", "v1", "Leaf", "singleton", "Node", "v2", "compare", "LT", "unsafeBalancedNode", "GT", "EQ", "foldableMap", "f", "z", "m$prime", "z$prime", "Leaf", "Node", "$lazy_go", "go", "m", "dictMonoid", "v", "append1", "empty", "$$delete", "dictOrd", "k", "go", "v", "Leaf", "Node", "v1", "compare", "LT", "unsafeBalancedNode", "GT", "EQ", "unsafeJoinNodes", "alter", "dictOrd", "f", "k", "m", "v", "unsafeSplit", "compare", "v2", "Nothing", "unsafeJoinNodes", "Just", "unsafeBalancedNode", "OrdBox", "mkOrdBox", "dictOrd", "eqOrdBox", "v", "v1", "ordOrdBox", "pop", "dictIsSymbol", "dictOrd", "sym", "key", "v", "pop1", "Tuple", "reflectSymbol", "mkOrdBox", "lookup", "lookup1", "insert", "val", "insert1", "foreachSlot", "dictApplicative", "k", "traverse_", "$54", "empty", "AutocompleteOff", "AutocompleteOn", "AutocompleteName", "AutocompleteHonorificPrefix", "AutocompleteGivenName", "AutocompleteAdditionalName", "AutocompleteFamilyName", "AutocompleteHonorificSuffix", "AutocompleteNickname", "AutocompleteEmail", "AutocompleteUsername", "AutocompleteNewPassword", "AutocompleteCurrentPassword", "AutocompleteOneTimeCode", "AutocompleteOrganizationTitle", "AutocompleteOrganization", "AutocompleteStreetAddress", "AutocompleteAddressLine1", "AutocompleteAddressLine2", "AutocompleteAddressLine3", "AutocompleteAddressLevel1", "AutocompleteAddressLevel2", "AutocompleteAddressLevel3", "AutocompleteAddressLevel4", "AutocompleteCountry", "AutocompleteCountryName", "AutocompletePostalCode", "AutocompleteCreditCardName", "AutocompleteCreditCardGivenName", "AutocompleteCreditCardAdditionalName", "AutocompleteCreditCardFamilyName", "AutocompleteCreditCardNumber", "AutocompleteCreditCardExpiration", "AutocompleteCreditCardExpirationMonth", "AutocompleteCreditCardExpirationYear", "AutocompleteCreditCardSecurityCode", "AutocompleteCreditCardType", "AutocompleteTransactionCurrency", "AutocompleteTransactionAmount", "AutocompleteLanguage", "AutocompleteBirthday", "AutocompleteBirthdayDay", "AutocompleteBirthdayMonth", "AutocompleteBirthdayYear", "AutocompleteSex", "AutocompleteTelephone", "AutocompleteTelephoneCountryCode", "AutocompleteTelephoneNational", "AutocompleteTelephoneAreaCode", "AutocompleteTelephoneLocal", "AutocompleteTelephoneLocalPrefix", "AutocompleteTelephoneLocalSuffix", "AutocompleteTelephoneExtension", "AutocompleteIMPP", "AutocompleteURL", "AutocompletePhoto", "renderAutocompleteType", "v", "ButtonButton", "ButtonSubmit", "ButtonReset", "renderButtonType", "v", "RefUpdate", "Action", "Step", "unStep", "unsafeCoerce", "step", "v", "a", "mkStep", "halt", "extract", "Text", "Elem", "Keyed", "Widget", "Grafted", "Graft", "unGraft", "f", "$61", "graft", "unsafeCoerce", "bifunctorGraft", "f", "g", "unGraft", "v", "graft", "Graft", "$63", "$64", "runGraft", "unGraft", "v", "go", "v2", "Text", "Elem", "map", "Keyed", "map1", "Widget", "Grafted", "bimap", "unsafeGetAny", "key", "obj", "unsafeHasAny", "unsafeSetAny", "val", "forE", "a", "f", "b", "i", "forEachE", "forInE", "o", "ks", "k", "diffWithIxE", "a1", "a2", "f1", "f2", "f3", "a3", "l1", "l2", "i", "strMapWithIxE", "as", "fk", "f", "o", "a", "k", "diffWithKeyAndIxE", "o1", "o2", "refEq", "b", "createTextNode", "s", "doc", "setTextContent", "n", "createElement", "ns", "name", "insertChildIx", "removeChild", "parentNode", "setAttribute", "attr", "val", "el", "removeAttribute", "hasAttribute", "addEventListener", "ev", "listener", "removeEventListener", "jsUndefined", "unsafeLookup", "unsafeGetAny", "unsafeFreeze", "unsafeCoerce", "pokeMutMap", "unsafeSetAny", "newMutMap", "newImpl", "getProp", "name", "doctype", "_namespaceURI", "_prefix", "localName", "tagName", "setAttribute", "name", "value", "element", "getEffProp", "name", "node", "children", "_firstElementChild", "_lastElementChild", "childElementCount", "_querySelector", "selector", "querySelector", "qs", "$2", "map", "toMaybe", "$3", "_querySelector", "$4", "toNode", "unsafeCoerce", "haltWidget", "v", "state", "vdom", "Grafted", "$lazy_patchWidget", "runGraft", "Widget", "res$prime", "unStep", "mkStep", "Step", "res", "patchWidget", "haltText", "parent", "$lazy_patchText", "Text", "otherwise", "nextState", "patchText", "haltKeyed", "v1", "s", "haltElem", "eqElemSpec", "ns1", "ns2", "$63", "Just", "Nothing", "$lazy_patchElem", "Elem", "length", "attrs2", "onThis", "v2", "onThese", "ix", "extract", "onThat", "children2", "patchElem", "$lazy_patchKeyed", "Keyed", "ix$prime", "v3", "fst", "patchKeyed", "buildWidget", "build", "w", "buildText", "node", "buildKeyed", "name1", "as1", "ch1", "toNode", "el", "onChild", "attrs", "children", "buildElem", "child", "buildVDom", "spec", "$lazy_build", "eventListener", "fn", "event", "Created", "Removed", "Attribute", "Property", "Handler", "Ref", "unsafeGetProperty", "unsafeGetAny", "setProperty", "unsafeSetAny", "removeProperty", "key", "el", "v", "v1", "typeOf", "jsUndefined", "propToStrKey", "Just", "propFromString", "unsafeCoerce", "propFromInt", "unsafeCoerce", "propFromBoolean", "buildProp", "emit", "el", "removeProp", "prevEvents", "v1", "Attribute", "removeAttribute", "toNullable", "Property", "removeProperty", "Handler", "handler", "unsafeLookup", "fst", "Ref", "mbEmit", "v", "Just", "haltProp", "state", "lookup", "Removed", "diffProp", "events", "v11", "v2", "$66", "v4", "refEq", "elVal", "unsafeGetProperty", "$75", "setProperty", "snd", "applyProp", "v3", "unsafeGetAny", "unsafeHasAny", "ev", "ref", "f$prime", "Tuple", "listener", "Created", "ps2", "onThis", "onThese", "onThat", "propToStrKey", "nextState", "props", "$lazy_patchProp", "patchProp", "renderProp", "ps1", "ps1$prime", "HTML", "x", "widget", "$28", "Widget", "toPropValue", "dict", "text", "$29", "Text", "ref", "f", "$30", "v", "Created", "Just", "Removed", "Nothing", "prop", "dictIsProp", "$31", "Property", "$32", "toPropValue1", "isPropString", "isPropInt", "isPropInputType", "$45", "isPropButtonType", "$50", "isPropBoolean", "isPropAutocompleteType", "$51", "handler", "element", "ns", "name", "props", "children", "attr", "ns", "v", "Attribute", "Pure", "Lift", "Ap", "mkAp", "fba", "fb", "liftFreeAp", "goLeft", "dictApplicative", "fStack", "valStack", "nat", "func", "count", "Tuple", "Cons", "cons", "goApply", "vals", "gVal", "Nil", "gRes", "apply", "$31", "Right", "NonEmpty", "functorFreeAp", "f", "x", "foldFreeAp", "z", "go", "$copy_v", "v1", "goApply1", "pure", "Left", "$tco_done", "nextVals", "singleton", "retractFreeAp", "identity", "applyFreeAp", "applicativeFreeAp", "hoistFreeAp", "$54", "CatQueue", "uncons", "$copy_v", "v", "Nil", "CatQueue", "reverse", "Cons", "$tco_done", "Just", "Tuple", "snoc", "a", "$$null", "v", "Nil", "empty", "CatNil", "CatCons", "link", "v", "v1", "CatNil", "CatCons", "snoc", "foldr", "k", "b", "q", "foldl", "$copy_v", "$copy_v1", "$copy_v2", "v2", "Nil", "Cons", "$tco_var_v", "$tco_var_v1", "go", "$copy_xs", "$copy_ys", "uncons", "xs", "Nothing", "x", "i", "ys", "Just", "$tco_var_xs", "Tuple", "$66", "empty", "append", "link", "semigroupCatList", "append", "snoc", "cat", "a", "append", "CatCons", "empty", "Free", "Return", "Bind", "toView", "$copy_v", "runExpF", "v2", "concatF", "r", "append", "v", "uncons", "Nothing", "Just", "$tco_done", "a", "fromView", "f", "empty", "freeMonad", "freeFunctor", "k", "f", "$189", "pure", "freeApplicative", "$190", "freeBind", "v", "Free", "snoc", "$191", "fromView", "Return", "liftF", "f", "fromView", "Bind", "$192", "foldFree", "dictMonadRec", "k", "go", "f", "v", "toView", "Return", "map1", "Done", "pure1", "Bind", "$199", "unChildQueryBox", "unsafeCoerce", "reallyUnsafeRefEq", "a", "b", "unsafeRefEq", "reallyUnsafeRefEq", "unsubscribe", "v", "subscribe", "k", "$76", "notify", "v", "a", "create", "k", "v", "subscribers", "a", "traverse_1", "SubscriptionId", "x", "ForkId", "State", "Subscribe", "Unsubscribe", "Lift", "ChildQuery", "Raise", "Par", "Fork", "Join", "Kill", "GetRef", "HalogenM", "x", "raise", "o", "ordSubscriptionId", "ordInt", "ordForkId", "monadHalogenM", "freeMonad", "monadStateHalogenM", "$181", "HalogenM", "liftF", "State", "monadEffectHalogenM", "dictMonadEffect", "$186", "liftEffect", "$187", "HalogenM", "liftF", "Lift", "monadAffHalogenM", "dictMonadAff", "$188", "liftAff", "$189", "HalogenM", "liftF", "Lift", "getRef", "p", "identity", "functorHalogenM", "freeFunctor", "bindHalogenM", "freeBind", "applicativeHalogenM", "freeApplicative", "Initialize", "Finalize", "Receive", "Action", "Query", "unsafeEqThunk", "v", "v1", "refEq", "runThunk", "v", "buildThunk", "toVDom", "haltThunk", "state", "t2", "unsafeEqThunk", "$48", "$lazy_patchThunk", "runThunk", "vdom", "patchThunk", "renderThunk", "spec", "t", "ComponentSlot", "ThunkSlot", "unComponentSlot", "unsafeCoerce", "unComponent", "mkEval", "args", "v", "Initialize", "voidLeft", "traverse_", "Finalize", "Receive", "Action", "Query", "unCoyoneda", "g", "$45", "map", "maybe", "$46", "mkComponentSlot", "mkComponent", "defaultEval", "componentSlot", "dictIsSymbol", "dictOrd", "label", "p", "comp", "input", "output", "mkComponentSlot", "element", "form", "element", "input", "props", "element", "label", "element", "p", "element", "span", "element", "table", "element", "tbody", "element", "tbody_", "td", "td_", "textarea", "es", "tr", "element", "tr_", "div", "element", "div_", "button", "element", "br", "props", "element", "br_", "a", "element", "_currentTarget", "e", "preventDefault", "e", "currentTarget", "$5", "change", "click", "mouseHandler", "unsafeCoerce", "handler$prime", "et", "f", "ev", "handler", "onClick", "$15", "handler", "click", "$16", "mouseHandler", "onSubmit", "handler", "addForeignPropHandler", "key", "prop", "reader", "f", "go", "a", "readProp", "unsafeToForeign", "handler$prime", "composeKleisli", "currentTarget", "e", "$85", "onChecked", "change", "readBoolean", "monadIdentity", "onValueChange", "addForeignPropHandler", "change", "readString", "ref", "go", "p", "mel", "$29", "prop", "dictIsProp", "isPropBoolean", "isPropString", "isPropInt", "required", "prop1", "rows", "prop3", "target", "prop2", "title", "type_", "dictIsProp", "prop", "value", "name", "prop2", "id", "prop2", "href", "$$for", "prop2", "disabled", "prop1", "class_", "$36", "prop2", "$37", "unwrap", "checked", "prop1", "autofocus", "prop1", "autocomplete", "prop", "isPropAutocompleteType", "attr", "hasArrayFrom", "hasStringIterator", "hasFromCodePoint", "hasCodePointAt", "_singleton", "fallback", "hasFromCodePoint", "_take", "n", "hasStringIterator", "str", "accum", "iter", "o", "unsurrogate", "lead", "trail", "isTrail", "cu", "isLead", "uncons", "s", "v", "length", "cu1", "fromEnum", "charAt", "cu0", "$43", "unsurrogate", "Just", "fromCharCode", "$75", "toEnumWithDefaults", "boundedEnumChar", "bottom", "boundedChar", "top", "$76", "singletonFallback", "v", "lead", "div", "trail", "mod", "singleton", "_singleton", "singletonFallback", "takeFallback", "v", "v1", "v2", "uncons", "Just", "take", "_take", "drop", "s", "take", "getEffProp", "name", "doc", "url", "documentURI", "origin", "compatMode", "characterSet", "contentType", "_documentElement", "getEffProp", "whenH", "b", "k", "text", "whenA", "b", "k", "unsafeDecode", "str", "ifElseH", "b", "f", "k", "ifElseA", "fromNullableStr", "$53", "fromMaybe", "$54", "toMaybe", "encodeTag", "$55", "$56", "replaceAll", "$57", "$$encodeURIComponent", "class_", "$58", "attr", "a", "_parseQueryString", "srh", "decode", "$59", "replaceAll", "$60", "unsafeDecode", "go", "kv", "v", "split", "Just", "Tuple", "Nothing", "qs", "srh$prime", "take", "$52", "filter", "_lookupQueryStringValue", "qs", "k", "$62", "v", "_loc", "bindFlipped", "location", "windowImpl", "_doc", "bindFlipped", "document", "windowImpl", "_curQuerystring", "_loc", "loc", "_parseQueryString", "srh", "EarchiveDefault", "EprivateDefault", "EprivacyLock", "UEditField", "USubmit", "_us", "dictStrong", "v", "v1", "strongFn", "strongForget", "usetting", "u$prime", "render", "editField", "$31", "class_", "div", "text", "input", "type_", "InputCheckbox", "id", "name", "checked", "onChecked", "label", "$$for", "mkState", "handleAction", "discard", "modifying", "_us1", "us", "bind", "use", "_us2", "log", "s", "warn", "Eurl", "Etitle", "Edescription", "Etags", "Eprivate", "Etoread", "BEditField", "BEditSubmit", "BDeleteAsk", "BLookupTitle", "BDestroy", "_edit_bm", "dictStrong", "v", "v1", "strongFn", "strongForget", "_bm", "_apiError", "addbmark", "b$prime", "render", "mmoment", "mmoment8601", "editField", "f", "$111", "display_exists", "class_", "text", "span", "title", "maybe", "snd", "fst", "div", "button", "append", "type_", "ButtonButton", "onClick", "v2", "guard", "attr", "display_destroyed", "alert_notification", "alert_text", "display_edit", "onSubmit", "table", "tbody_", "tr_", "td", "td_", "whenH", "isJust", "fromMaybe", "label", "$$for", "input", "type_1", "InputUrl", "id", "required", "name", "autofocus", "$$null", "value", "onValueChange", "InputText", "disabled", "guard1", "textarea", "rows", "autocomplete", "AutocompleteOff", "InputCheckbox", "checked", "onChecked", "InputSubmit", "$72", "mkState", "b", "handleAction", "modify_", "edit_bm", "mtitle", "Just", "modifying", "_edit_bm1", "Nothing", "bid", "discard", "liftEffect", "preventDefault", "Left", "assign", "_apiError1", "printError", "Right", "qs", "doc", "ref", "loc", "org", "_lookupQueryStringValue", "v3", "stripPrefix", "setHref", "bindFlipped", "closeWindow", "windowImpl", "unsafeSetInnerHTML", "element", "html", "getHTMLElementRef", "$24", "map", "functorHalogenM", "v", "$25", "getRef", "SetInnerHTML", "Receive", "mkComponent", "toRawHTML", "render", "state", "ref", "handleAction", "v", "v1", "bind", "getHTMLElementRef", "mel", "el", "v2", "liftAff", "forkAff", "makeAff", "v3", "discard1", "modify_", "inputval", "$30", "_getDefaults", "_defaults", "changeDefaults", "newDefaults", "escapeTest", "escapeReplace", "escapeTestNoEncode", "escapeReplaceNoEncode", "escapeReplacements", "getEscapeReplacement", "ch", "escape", "html", "encode", "unescapeTest", "unescape", "_", "n", "caret", "edit", "regex", "opt", "source", "obj", "name", "val", "valSource", "cleanUrl", "href", "noopTest", "splitCells", "tableRow", "count", "row", "match", "offset", "str", "escaped", "curr", "cells", "i", "rtrim", "c", "invert", "l", "suffLen", "currChar", "findClosingBracket", "b", "level", "outputLink", "cap", "link", "raw", "lexer", "title", "text", "token", "indentCodeCompensation", "matchIndentToCode", "indentToCode", "node", "matchIndentInNode", "indentInNode", "_Tokenizer", "options", "__publicField", "src", "trimmed", "top", "tokens", "bull", "isordered", "list", "itemRegex", "itemContents", "endsWithBlankLine", "endEarly", "line", "t", "nextLine", "indent", "blankLine", "nextBulletRegex", "hrRegex", "fencesBeginRegex", "headingBeginRegex", "rawLine", "istask", "ischecked", "spacers", "hasMultipleLineBreaks", "tag", "headers", "aligns", "rows", "item", "align", "header", "cell", "trimmedUrl", "rtrimSlash", "lastParenIndex", "linkLen", "links", "linkString", "maskedSrc", "prevChar", "lLength", "rDelim", "rLength", "delimTotal", "midDelimTotal", "endReg", "lastCharLength", "hasNonSpaceChars", "hasSpaceCharsOnBothEnds", "prevCapZero", "_b", "_a", "newline", "blockCode", "fences", "hr", "heading", "bullet", "lheading", "_paragraph", "blockText", "_blockLabel", "def", "_tag", "_comment", "paragraph", "blockquote", "blockNormal", "gfmTable", "blockGfm", "__spreadProps", "__spreadValues", "blockPedantic", "inlineCode", "br", "inlineText", "_punctuation", "punctuation", "blockSkip", "emStrongLDelim", "emStrongRDelimAst", "emStrongRDelimUnd", "anyPunctuation", "autolink", "_inlineComment", "_inlineLabel", "reflink", "nolink", "reflinkSearch", "inlineNormal", "inlinePedantic", "inlineGfm", "inlineBreaks", "block", "inline", "_Lexer", "__Lexer", "rules", "next", "leading", "tabs", "lastToken", "cutSrc", "lastParagraphClipped", "extTokenizer", "startIndex", "tempSrc", "tempStart", "getStartIndex", "errMsg", "keepPrevChar", "_Renderer", "code", "infostring", "lang", "quote", "body", "ordered", "start", "type", "startatt", "task", "checked", "content", "flags", "cleanHref", "out", "_TextRenderer", "_Parser", "__Parser", "genericToken", "ret", "headingToken", "codeToken", "tableToken", "j", "k", "blockquoteToken", "listToken", "loose", "itemBody", "checkbox", "htmlToken", "paragraphToken", "textToken", "renderer", "escapeToken", "tagToken", "linkToken", "imageToken", "strongToken", "emToken", "codespanToken", "delToken", "_Hooks", "markdown", "Marked", "args", "__privateAdd", "_parseMarkdown", "_onError", "__privateMethod", "parseMarkdown_fn", "callback", "values", "childTokens", "extensions", "pack", "opts", "ext", "prevRenderer", "extLevel", "prop", "rendererProp", "rendererFunc", "tokenizer", "tokenizerProp", "tokenizerFunc", "prevTokenizer", "hooks", "hooksProp", "hooksFunc", "prevHook", "arg", "walkTokens", "packWalktokens", "parser", "origOpt", "throwError", "onError_fn", "e", "silent", "async", "msg", "markedInstance", "marked", "setOptions", "use", "parseInline", "parser", "_Parser", "lexer", "_Lexer", "import_dompurify", "marked", "markedImpl", "str", "DOMPurify", "marked", "$1", "component", "mkComponent", "marked", "log", "dictMonadEffect", "$67", "liftEffect", "$68", "slot", "dictIsSymbol", "dictOrd", "label", "p", "component", "input", "outputQuery", "$11", "Eurl", "Etitle", "Edescription", "Etags", "Eprivate", "Etoread", "BNotifyRemove", "BStar", "BDeleteAsk", "BLookupTitle", "BDestroy", "BEdit", "BEditField", "BEditSubmit", "BMarkRead", "_markdown", "_edit_bm", "dictStrong", "v", "v1", "strongFn", "strongForget", "_edit", "_bm", "_apiError", "bmark", "b$prime", "tagid", "bm", "mkState", "b", "handleAction", "bind", "use", "_bm1", "UnStar", "modify_", "setFocus", "modifying", "_edit_bm1", "edit_bm", "mtitle", "Just", "Nothing", "discard", "liftEffect", "preventDefault", "edit_bm$prime", "Left", "assign", "_apiError1", "printError", "Right", "app", "app$prime", "render", "star", "class_", "guard", "button", "onClick", "v2", "text", "shdatetime", "take", "shdate", "toLocaleDateString", "linkToFilterTag", "tag", "encodeTag", "linkToFilterSingle", "slug", "editField", "f", "$126", "display", "a", "href", "target", "$121", "fromMaybe", "toMaybe", "isJust", "title", "$122", "slot", "component", "absurd", "div", "whenA", "$$null", "whenH", "type_", "ButtonButton", "v3", "span", "guard1", "alert_notification", "alert_text", "display_edit", "form", "onSubmit", "div_", "input", "type_1", "InputUrl", "required", "name", "value", "onValueChange", "InputText", "disabled", "textarea", "rows", "id", "autocomplete", "AutocompleteOff", "attr", "InputCheckbox", "checked", "onChecked", "label", "$$for", "InputSubmit", "InputReset", "show", "ifElseH", "HandleBMessage", "_bookmark", "blist", "st", "render", "bms", "b", "bmark", "handleAction", "v", "modify_", "filter", "nlist", "st$prime", "toTextarea", "input", "foldMap", "x", "br_", "text", "mmoment", "note", "mkState", "notes$prime", "handleAction", "v", "pure", "app", "app$prime", "linkToFilterSingle", "slug", "render", "renderNote", "id", "show", "class_", "div", "a", "href", "$11", "take", "title", "maybe", "snd", "fst", "Etitle", "Etext", "EisMarkdown", "Eshared", "NNop", "NEditField", "NEditSubmit", "NEdit", "NDeleteAsk", "NDestroy", "_note", "dictStrong", "v", "v1", "strongForget", "strongFn", "_markdown", "_edit_note", "_edit", "_apiError", "nnote", "st$prime", "notetextid", "note", "mkState", "note$prime", "app", "app$prime", "handleAction", "modifying", "_edit_note1", "modify_", "bind", "use", "_note1", "qs", "$91", "Just", "liftEffect", "whenM", "pure1", "setFocus", "discard", "preventDefault", "edit_note", "Left", "assign", "_apiError1", "printError", "Right", "doc", "ref", "loc", "org", "v2", "_lookupQueryStringValue", "$100", "setHref", "$102", "_loc", "_note2", "render", "toTextarea", "input", "foldMap", "x", "br_", "text", "mmoment", "n", "renderNote", "id", "show", "class_", "div", "$108", "slot", "component", "absurd", "span", "title", "maybe", "snd", "fst", "button", "type_", "ButtonButton", "onClick", "v3", "guard", "editField", "f", "$114", "display_destroyed", "alert_notification", "alert_text", "renderNote_edit", "onSubmit", "whenH", "isJust", "fromMaybe", "p", "type_1", "InputText", "name", "value", "onValueChange", "autofocus", "$$null", "textarea", "rows", "InputCheckbox", "checked", "onChecked", "label", "$$for", "InputSubmit", "InputReset", "$$const", "ifElseH", "TInitialize", "TExpanded", "TChangeMode", "tagcloudcomponent", "m$prime", "rescale", "f", "n", "m", "l", "h", "$57", "mkState", "fetchTagCloud", "mode$prime", "TagCloudModeNone", "bind", "liftAff", "getTagCloud", "tagCloudModeFromF", "tagcloud", "s", "$60", "handleAction", "v", "v1", "mode", "discard", "modify_", "$64", "gets", "$67", "isExpanded", "setExpanded", "app", "app$prime", "linkToFilterTag", "rest", "$69", "toSizedTag", "curtags", "k", "opacity", "$79", "toNumber", "k_lower", "toLower", "fontsize", "identity", "style", "attr", "show", "a", "href", "encodeTag", "class_", "text", "whenH", "$$null", "$70", "joinWith", "map", "cons", "$$delete", "toArray", "$80", "uncurry", "$81", "sortBy", "comparing", "$83", "$82", "toUnfoldable", "render", "modetop", "TagCloudModeTop", "modelb5", "TagCloudModeLowerBound", "modelb20", "modelb2", "modelb10", "modelb1", "div", "append1", "ifElseA", "isRelated", "button", "type_", "ButtonButton", "onClick", "v2", "guard", "eq", "title", "$73", "fromMaybe", "minimum", "values", "maximum", "TagCloudModeRelated", "selectElement", "query", "$16", "querySelector", "$17", "toParentNode", "mel", "runHalogenAff", "runAff_", "either", "throwException", "$$const", "pure1", "monadForkAff", "fork", "dict", "unRenderStateX", "unsafeCoerce", "unDriverStateX", "renderStateX_", "dictApplicative", "f", "st", "mkRenderStateX", "renderStateX", "dictFunctor", "mkDriverStateXRef", "mapDriverState", "v", "initDriverState", "component", "input", "handler", "lchs", "ds", "childrenIn", "childrenOut", "selfRef", "handlerRef", "pendingQueries", "pendingOuts", "pendingHandlers", "fresh", "subscriptions", "forks", "unsubscribe", "sid", "ref", "v", "subs", "queueOrRun", "au", "Nothing", "Just", "liftEffect", "write", "Cons", "handleLifecycle", "lchs", "f", "result", "discard1", "traverse_2", "fork", "handleAff", "runAff_", "either", "throwException", "$$const", "pure", "applicativeEffect", "fresh", "modify$prime", "i", "evalQ", "render", "q", "evalM", "Query", "map", "liftCoyoneda", "initRef", "evalChildQuery", "cqb", "v1", "unChildQueryBox", "v2", "evalChild", "v3", "parallel", "bind1", "read", "dsx", "ds", "go", "State", "unsafeRefEq", "otherwise", "Subscribe", "SubscriptionId", "act", "evalF", "Action", "finalize", "modify_", "map2", "insert", "Unsubscribe", "Lift", "ChildQuery", "Raise", "handler", "Par", "sequential", "retractFreeAp", "hoistFreeAp", "$119", "$120", "Fork", "ForkId", "fid", "$$new", "doneRef", "fiber", "insert1", "Join", "forkMap", "Kill", "lookup1", "GetRef", "lookup2", "RefUpdate", "flip", "mapDriverState", "st", "newLifecycleHandlers", "handlePending", "ref", "queue", "$59", "traverse_", "fork", "$60", "reverse", "cleanupSubscriptionsAndForks", "v", "$61", "killFiber", "error", "$62", "runUI", "renderSpec", "component", "i", "squashChildInitializers", "lchs", "preInits", "st", "parentInitializer", "evalM", "render", "Initialize", "handlers", "runComponent", "handler", "j", "c", "lchs$prime", "pre", "$63", "$64", "$$var", "read", "renderChild", "childrenInRef", "childrenOutRef", "slot", "childrenIn", "Just", "$65", "maybe", "pure1", "$66", "Receive", "dsx", "Nothing", "$67", "$68", "$69", "isDuplicate", "warn", "renderStateX", "pure", "shouldProcessHandlers", "write", "Nil", "$70", "queueOrRun", "$71", "evalF", "$72", "$$void", "childHandler", "$73", "$74", "Action", "$75", "v1", "childDS", "finalize", "ds$prime", "rendering", "children", "flip", "tailRecM", "$76", "$77", "$$null", "mmore", "$52", "Loop", "f", "Finalize", "evalDriver", "disposed", "q", "evalQ", "dispose", "for_", "v2", "$78", "notify", "sio", "$79", "getEffProp", "name", "node", "baseURI", "getEffProp", "_ownerDocument", "_parentNode", "_parentElement", "childNodes", "getEffProp", "_firstChild", "_lastChild", "_previousSibling", "_nextSibling", "_nodeValue", "textContent", "getEffProp", "insertBefore", "node1", "node2", "parent", "appendChild", "node", "removeChild", "node", "parent", "parentNode", "$6", "map", "toMaybe", "$7", "_parentNode", "nextSibling", "$15", "map", "toMaybe", "$16", "_nextSibling", "substInParent", "v", "v1", "v2", "Just", "$$void", "insertBefore", "Nothing", "appendChild", "pure", "removeChild", "pn", "npn", "mkSpec", "handler", "renderChildRef", "document", "getNode", "unRenderStateX", "done", "st", "halt", "buildWidget", "spec", "buildThunk", "unwrap", "slot", "ComponentSlot", "ThunkSlot", "step$prime", "$lazy_patch", "$lazy_render", "$lazy_renderComponentSlot", "step", "cs", "renderChild", "node", "rsx", "patch", "render", "renderComponentSlot", "buildAttributes", "buildProp", "renderSpec", "container", "child", "extract", "machine", "toNode", "newNode", "machine$prime", "nextSib", "parent", "runUI", "component", "i", "element", "viewRendered", "bind", "selectElement", "traverse_", "el", "toElement", "renderTagCloud", "renderElSelector", "tagCloudMode", "renderNotes", "notes", "renderNote", "note", "renderBookmarks", "bmarks", "renderAddForm", "bmark", "renderAccountSettings", "accountSettings", "logoutE", "e", "$10"]
-}
diff --git a/static/js/app.min.js.map.gz b/static/js/app.min.js.map.gz
deleted file mode 100644
index 96a0394..0000000
Binary files a/static/js/app.min.js.map.gz and /dev/null differ
diff --git a/templates/default-layout-wrapper.hamlet b/templates/default-layout-wrapper.hamlet
index 516c8fd..5f7281a 100644
--- a/templates/default-layout-wrapper.hamlet
+++ b/templates/default-layout-wrapper.hamlet
@@ -34,5 +34,5 @@ $newline never
     ^{pageBody pc}
 
   <script type="module">
-    import { logoutE } from '@{StaticR js_app_min_js}';
+    import { logoutE } from '@{StaticR js_dist_Logout_index_js}';
     Array.from(document.getElementsByClassName('logout-btn')).forEach(_ => _.addEventListener('click', (e) => logoutE(e)()));
\ No newline at end of file