From 4171aa8396bacd38440424bea561b68857e9a1eb Mon Sep 17 00:00:00 2001
From: Ethan Bennett <ebennett19@gmail.com>
Date: Tue, 28 Jul 2020 19:10:52 -0400
Subject: [PATCH] Fix outdated references to chief and iou

---
 packages/dai-plugin-governance/contracts/addresses/kovan.json | 4 ++--
 .../dai-plugin-governance/contracts/addresses/mainnet.json    | 4 ++--
 .../dai-plugin-governance/contracts/addresses/testnet.json    | 2 --
 packages/dai-plugin-governance/src/index.js                   | 4 ++--
 packages/dai-plugin-governance/umd/index.js                   | 2 +-
 packages/dai-plugin-governance/umd/index.js.map               | 2 +-
 6 files changed, 8 insertions(+), 10 deletions(-)

diff --git a/packages/dai-plugin-governance/contracts/addresses/kovan.json b/packages/dai-plugin-governance/contracts/addresses/kovan.json
index 14899dc59..248756ca7 100644
--- a/packages/dai-plugin-governance/contracts/addresses/kovan.json
+++ b/packages/dai-plugin-governance/contracts/addresses/kovan.json
@@ -1,11 +1,11 @@
 {
-  "CHIEF": "0xbbffc76e94b34f72d96d054b31f6424249c1337d",
+  "MCD_ADM": "0xbbffc76e94b34f72d96d054b31f6424249c1337d",
   "VOTE_PROXY_FACTORY": "0x3e08741a68c2d964d172793cd0ad14292f658cd8",
   "POLLING": "0x518a0702701BF98b5242E73b2368ae07562BEEA3",
   "BATCH_POLLING": "0xD931E7c869618dB6FD30cfE4e89248CAA091Ea5f",
   "MCD_ESM": "0x0c376764f585828ffb52471c1c35f855e312a06c",
   "MCD_END": "0x24728acf2e2c403f5d2db4df6834b8998e56aa5f",
   "GOV": "0xaaf64bfcc32d0f15873a02163e7e500671a4ffcd",
-  "IOU": "0x4D5d2F7E1284bc5c871ce3e1A997Bd8646c75ba5",
+  "MCD_IOU": "0x4D5d2F7E1284bc5c871ce3e1A997Bd8646c75ba5",
   "PAUSE": "0x8754e6ecb4fe68daa5132c2886ab39297a5c7189"
 }
diff --git a/packages/dai-plugin-governance/contracts/addresses/mainnet.json b/packages/dai-plugin-governance/contracts/addresses/mainnet.json
index 597727656..3beb33417 100644
--- a/packages/dai-plugin-governance/contracts/addresses/mainnet.json
+++ b/packages/dai-plugin-governance/contracts/addresses/mainnet.json
@@ -1,8 +1,8 @@
 {
-  "CHIEF": "0x9eF05f7F6deB616fd37aC3c959a2dDD25A54E4F5",
+  "MCD_ADM": "0x9eF05f7F6deB616fd37aC3c959a2dDD25A54E4F5",
   "VOTE_PROXY_FACTORY": "0x868ba9aeacA5B73c7C27F3B01588bf4F1339F2bC",
   "GOV": "0x9f8f72aa9304c8b593d555f12ef6589cc3a579a2",
-  "IOU": "0x496C67A4CEd9C453A60F3166AB4B329870c8E355",
+  "MCD_IOU": "0x496C67A4CEd9C453A60F3166AB4B329870c8E355",
   "POLLING": "0xF9be8F0945acDdeeDaA64DFCA5Fe9629D0CF8E5D",
   "BATCH_POLLING": "0xD3A9FE267852281a1e6307a1C37CDfD76d39b133",
   "MCD_ESM": "0x0581a0abe32aae9b5f0f68defab77c6759100085",
diff --git a/packages/dai-plugin-governance/contracts/addresses/testnet.json b/packages/dai-plugin-governance/contracts/addresses/testnet.json
index 80ef7c44c..1fc64bbe2 100644
--- a/packages/dai-plugin-governance/contracts/addresses/testnet.json
+++ b/packages/dai-plugin-governance/contracts/addresses/testnet.json
@@ -1,6 +1,4 @@
 {
-  "IOU": "0x14f7e74A26a0e6791523451d85129babf01cFd44",
-  "CHIEF": "0x863d1CdF27146631585A274916C23A627Bd960C1",
   "POLLING": "0x9A2810a12197CB844af4BA74a4b81bC1CA727130",
   "BATCH_POLLING": "0xa9D33Ce18803b0742460ffb1b33B6c40f95178BC",
   "VOTE_PROXY_FACTORY": "0x059B38F71E37F6f66572946e9cc7C8052A3f6626",
diff --git a/packages/dai-plugin-governance/src/index.js b/packages/dai-plugin-governance/src/index.js
index 9c5aac37c..e5023783e 100644
--- a/packages/dai-plugin-governance/src/index.js
+++ b/packages/dai-plugin-governance/src/index.js
@@ -47,7 +47,7 @@ export default {
 
     const addContracts = {
       [CHIEF]: {
-        address: map(prop('CHIEF'), contractAddresses),
+        address: map(prop('MCD_ADM'), contractAddresses),
         // TODO check for MCD-specific version of DSChief
         abi: require('../contracts/abis/DSChief.json')
       },
@@ -99,7 +99,7 @@ export default {
           {
             currency: IOU,
             symbol: IOU.symbol,
-            address: contractAddresses[addressKey].IOU
+            address: contractAddresses[addressKey].MCD_IOU
           }
         ]
       }
diff --git a/packages/dai-plugin-governance/umd/index.js b/packages/dai-plugin-governance/umd/index.js
index 1c099806f..1cbec9b5e 100644
--- a/packages/dai-plugin-governance/umd/index.js
+++ b/packages/dai-plugin-governance/umd/index.js
@@ -1,3 +1,3 @@
 /*! For license information please see index.js.LICENSE.txt */
-!function webpackUniversalModuleDefinition(t,r){"object"==typeof exports&&"object"==typeof module?module.exports=r():"function"==typeof define&&define.amd?define([],r):"object"==typeof exports?exports["@makerdao/dai-plugin-governance"]=r():t["@makerdao/dai-plugin-governance"]=r()}(window,(function(){return function(t){var r={};function __webpack_require__(i){if(r[i])return r[i].exports;var a=r[i]={i:i,l:!1,exports:{}};return t[i].call(a.exports,a,a.exports,__webpack_require__),a.l=!0,a.exports}return __webpack_require__.m=t,__webpack_require__.c=r,__webpack_require__.d=function(t,r,i){__webpack_require__.o(t,r)||Object.defineProperty(t,r,{enumerable:!0,get:i})},__webpack_require__.r=function(t){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})},__webpack_require__.t=function(t,r){if(1&r&&(t=__webpack_require__(t)),8&r)return t;if(4&r&&"object"==typeof t&&t&&t.__esModule)return t;var i=Object.create(null);if(__webpack_require__.r(i),Object.defineProperty(i,"default",{enumerable:!0,value:t}),2&r&&"string"!=typeof t)for(var a in t)__webpack_require__.d(i,a,function(r){return t[r]}.bind(null,a));return i},__webpack_require__.n=function(t){var r=t&&t.__esModule?function getDefault(){return t.default}:function getModuleExports(){return t};return __webpack_require__.d(r,"a",r),r},__webpack_require__.o=function(t,r){return Object.prototype.hasOwnProperty.call(t,r)},__webpack_require__.p="",__webpack_require__(__webpack_require__.s=109)}([function(t,r){t.exports=function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}},function(t,r){t.exports=function _classCallCheck(t,r){if(!(t instanceof r))throw new TypeError("Cannot call a class as a function")}},function(t,r){function _defineProperties(t,r){for(var i=0;i<r.length;i++){var a=r[i];a.enumerable=a.enumerable||!1,a.configurable=!0,"value"in a&&(a.writable=!0),Object.defineProperty(t,a.key,a)}}t.exports=function _createClass(t,r,i){return r&&_defineProperties(t.prototype,r),i&&_defineProperties(t,i),t}},function(t,r){function _getPrototypeOf(r){return t.exports=_getPrototypeOf=Object.setPrototypeOf?Object.getPrototypeOf:function _getPrototypeOf(t){return t.__proto__||Object.getPrototypeOf(t)},_getPrototypeOf(r)}t.exports=_getPrototypeOf},function(t,r){var i=t.exports={version:"2.6.11"};"number"==typeof __e&&(__e=i)},function(t,r,i){var a=i(55);t.exports=function _inherits(t,r){if("function"!=typeof r&&null!==r)throw new TypeError("Super expression must either be null or a function");t.prototype=Object.create(r&&r.prototype,{constructor:{value:t,writable:!0,configurable:!0}}),r&&a(t,r)}},function(t,r,i){var a=i(15),u=i(87);t.exports=function _possibleConstructorReturn(t,r){return!r||"object"!==a(r)&&"function"!=typeof r?u(t):r}},function(t,r,i){var a=i(47)("wks"),u=i(33),c=i(12).Symbol,l="function"==typeof c;(t.exports=function(t){return a[t]||(a[t]=l&&c[t]||(l?c:u)("Symbol."+t))}).store=a},function(t,r,i){t.exports=i(168)},function(t,r){function asyncGeneratorStep(t,r,i,a,u,c,l){try{var p=t[c](l),d=p.value}catch(t){return void i(t)}p.done?r(d):Promise.resolve(d).then(a,u)}t.exports=function _asyncToGenerator(t){return function(){var r=this,i=arguments;return new Promise((function(a,u){var c=t.apply(r,i);function _next(t){asyncGeneratorStep(c,a,u,_next,_throw,"next",t)}function _throw(t){asyncGeneratorStep(c,a,u,_next,_throw,"throw",t)}_next(void 0)}))}}},function(t,r,i){Object.defineProperty(r,"__esModule",{value:!0}),r.MAINNET_URL=r.STAGING_MAINNET_URL=r.KOVAN_URL=r.LOCAL_URL=r.ZERO_ADDRESS=r.PAUSE=r.END=r.ESM=r.CHIEF=r.BATCH_POLLING=r.POLLING=r.VOTE_PROXY_FACTORY=r.IOU=r.MKR=void 0;var a=i(66),u=(0,a.createCurrency)("MKR");r.MKR=u;var c=(0,a.createCurrency)("IOU");r.IOU=c;r.VOTE_PROXY_FACTORY="VOTE_PROXY_FACTORY";r.POLLING="POLLING";r.BATCH_POLLING="BATCH_POLLING";r.CHIEF="CHIEF";r.ESM="ESM";r.END="END";r.PAUSE="PAUSE";r.ZERO_ADDRESS="0x0000000000000000000000000000000000000000";r.LOCAL_URL="http://localhost:3001/v1";r.KOVAN_URL="https://staging-gov-db.makerfoundation.com/api/v1";r.STAGING_MAINNET_URL="https://qa-gov-db.makerfoundation.com/api/v1";r.MAINNET_URL="https://gov-db.makerfoundation.com/api/v1"},function(t,r,i){var a=i(12),u=i(4),c=i(41),l=i(19),p=i(17),$export=function(t,r,i){var d,y,h,g=t&$export.F,v=t&$export.G,m=t&$export.S,b=t&$export.P,_=t&$export.B,w=t&$export.W,x=v?u:u[r]||(u[r]={}),S=x.prototype,O=v?a:m?a[r]:(a[r]||{}).prototype;for(d in v&&(i=r),i)(y=!g&&O&&void 0!==O[d])&&p(x,d)||(h=y?O[d]:i[d],x[d]=v&&"function"!=typeof O[d]?i[d]:_&&y?c(h,a):w&&O[d]==h?function(t){var F=function(r,i,a){if(this instanceof t){switch(arguments.length){case 0:return new t;case 1:return new t(r);case 2:return new t(r,i)}return new t(r,i,a)}return t.apply(this,arguments)};return F.prototype=t.prototype,F}(h):b&&"function"==typeof h?c(Function.call,h):h,b&&((x.virtual||(x.virtual={}))[d]=h,t&$export.R&&S&&!S[d]&&l(S,d,h)))};$export.F=1,$export.G=2,$export.S=4,$export.P=8,$export.B=16,$export.W=32,$export.U=64,$export.R=128,t.exports=$export},function(t,r){var i=t.exports="undefined"!=typeof window&&window.Math==Math?window:"undefined"!=typeof self&&self.Math==Math?self:Function("return this")();"number"==typeof __g&&(__g=i)},function(t,r,i){var a=i(16),u=i(68),c=i(42),l=Object.defineProperty;r.f=i(14)?Object.defineProperty:function defineProperty(t,r,i){if(a(t),r=c(r,!0),a(i),u)try{return l(t,r,i)}catch(t){}if("get"in i||"set"in i)throw TypeError("Accessors not supported!");return"value"in i&&(t[r]=i.value),t}},function(t,r,i){t.exports=!i(21)((function(){return 7!=Object.defineProperty({},"a",{get:function(){return 7}}).a}))},function(t,r){function _typeof(r){return"function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?t.exports=_typeof=function _typeof(t){return typeof t}:t.exports=_typeof=function _typeof(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},_typeof(r)}t.exports=_typeof},function(t,r,i){var a=i(20);t.exports=function(t){if(!a(t))throw TypeError(t+" is not an object!");return t}},function(t,r){var i={}.hasOwnProperty;t.exports=function(t,r){return i.call(t,r)}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),Object.defineProperty(r,"standardizeConfig",{enumerable:!0,get:function get(){return u.default}}),Object.defineProperty(r,"ServiceProvider",{enumerable:!0,get:function get(){return c.default}}),Object.defineProperty(r,"Container",{enumerable:!0,get:function get(){return l.default}}),Object.defineProperty(r,"LocalService",{enumerable:!0,get:function get(){return p.default}}),Object.defineProperty(r,"PublicService",{enumerable:!0,get:function get(){return d.default}}),Object.defineProperty(r,"PrivateService",{enumerable:!0,get:function get(){return y.default}}),Object.defineProperty(r,"ServiceManager",{enumerable:!0,get:function get(){return h.default}}),Object.defineProperty(r,"StateMachine",{enumerable:!0,get:function get(){return g.default}});var u=a(i(88)),c=a(i(178)),l=a(i(95)),p=a(i(240)),d=a(i(241)),y=a(i(242)),h=a(i(56)),g=a(i(89))},function(t,r,i){var a=i(13),u=i(26);t.exports=i(14)?function(t,r,i){return a.f(t,r,u(1,i))}:function(t,r,i){return t[r]=i,t}},function(t,r){t.exports=function(t){return"object"==typeof t?null!==t:"function"==typeof t}},function(t,r){t.exports=function(t){try{return!!t()}catch(t){return!0}}},function(t,r,i){var a=i(71),u=i(44);t.exports=function(t){return a(u(t))}},function(t,r,i){var a=i(165),u=i(166),c=i(85),l=i(167);t.exports=function _slicedToArray(t,r){return a(t)||u(t,r)||c(t,r)||l()}},function(t,r,i){(function(t){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.fromBuffer=r.toBuffer=r.paddedArray=r.getCurrency=r.netIdtoSpockUrlStaging=r.netIdtoSpockUrl=r.netIdToName=void 0;var u=a(i(64)),c=i(66),l=a(i(101)),p=i(10);r.netIdToName=function netIdToName(t){switch(parseInt(t,10)){case 1:return"mainnet";case 42:return"kovan";case 999:return"ganache";default:return""}};r.netIdtoSpockUrl=function netIdtoSpockUrl(t){switch(parseInt(t,10)){case 1:return p.MAINNET_URL;case 42:return p.KOVAN_URL;default:return p.STAGING_MAINNET_URL}};r.netIdtoSpockUrlStaging=function netIdtoSpockUrlStaging(t){switch(parseInt(t,10)){case 1:return p.STAGING_MAINNET_URL;case 42:return p.KOVAN_URL;default:return p.STAGING_MAINNET_URL}};var d=(0,c.createGetCurrency)({MKR:p.MKR});r.getCurrency=d;r.paddedArray=function paddedArray(t,r){var i;return(i=Array.from({length:t}).map((function(){return 0}))).concat.apply(i,(0,u.default)(r))};r.toBuffer=function toBuffer(r,i){var a,u,c,p,d=new l.default(r).toString(16);if(i||(i={}),c={1:"big","-1":"little"}[i.endian]||i.endian||"big","-"===d.charAt(0))throw new Error("Converting negative numbers to Buffers not supported yet");for(p="auto"===i.size?Math.ceil(d.length/2):i.size||1,u=Math.ceil(d.length/(2*p))*p,a=t.alloc(u);d.length<2*u;)d="0".concat(d);return d.split(new RegExp("(.{".concat(2*p,"})"))).filter((function(t){return t.length>0})).forEach((function(t,r){for(var i=0;i<p;i++){a[r*p+("big"===c?i:p-i-1)]=parseInt(t.slice(2*i,2*i+2),16)}})),a};r.fromBuffer=function fromBuffer(t,r){r||(r={});var i={1:"big","-1":"little"}[r.endian]||r.endian||"big",a="auto"===r.size?Math.ceil(t.length):r.size||1;if(t.length%a!=0)throw new RangeError("Buffer length (".concat(t.length,") must be a multiple of size (").concat(a,")"));for(var u=[],c=0;c<t.length;c+=a){for(var p=[],d=0;d<a;d++)p.push(t[c+("big"===i?d:a-d-1)]);u.push(p.map((function(t){return(t<16?"0":"")+t.toString(16)})).join(""))}return new l.default(u.join(""),16)}}).call(this,i(243).Buffer)},function(t,r){t.exports=function _defineProperty(t,r,i){return r in t?Object.defineProperty(t,r,{value:i,enumerable:!0,configurable:!0,writable:!0}):t[r]=i,t}},function(t,r){t.exports=function(t,r){return{enumerable:!(1&t),configurable:!(2&t),writable:!(4&t),value:r}}},function(t,r,i){var a=i(44);t.exports=function(t){return Object(a(t))}},function(t,r){t.exports={}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.serviceTypeTransitions=r.default=void 0;var u=a(i(59));r.default={LOCAL:"LOCAL",PUBLIC:"PUBLIC",PRIVATE:"PRIVATE"};var c={LOCAL:{CREATED:[u.default.INITIALIZING],INITIALIZING:[u.default.CREATED,u.default.READY],READY:[u.default.ERROR],ERROR:[]},PUBLIC:{CREATED:[u.default.INITIALIZING],INITIALIZING:[u.default.CREATED,u.default.OFFLINE],OFFLINE:[u.default.CONNECTING],CONNECTING:[u.default.OFFLINE,u.default.READY],READY:[u.default.OFFLINE,u.default.ERROR],ERROR:[]},PRIVATE:{CREATED:[u.default.INITIALIZING],INITIALIZING:[u.default.CREATED,u.default.OFFLINE],OFFLINE:[u.default.CONNECTING],CONNECTING:[u.default.OFFLINE,u.default.ONLINE],ONLINE:[u.default.OFFLINE,u.default.AUTHENTICATING],AUTHENTICATING:[u.default.ONLINE,u.default.READY],READY:[u.default.OFFLINE,u.default.ONLINE,u.default.ERROR],ERROR:[]}};r.serviceTypeTransitions=c},function(t,r,i){var a=i(93),u="object"==typeof self&&self&&self.Object===Object&&self,c=a||u||Function("return this")();t.exports=c},function(t,r,i){var a=i(70),u=i(48);t.exports=Object.keys||function keys(t){return a(t,u)}},function(t,r){t.exports=!0},function(t,r){var i=0,a=Math.random();t.exports=function(t){return"Symbol(".concat(void 0===t?"":t,")_",(++i+a).toString(36))}},function(t,r){r.f={}.propertyIsEnumerable},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(2)),l=a(i(56)),p=a(i(29)),d=a(i(59));function _defineLifeCycleMethods(t){void 0===this.initialize&&(this.initialize=function(){}),t!==p.default.LOCAL&&(void 0===this.connect&&(this.connect=function(){}),this.disconnect=function(){}),t===p.default.PRIVATE&&(void 0===this.authenticate&&(this.authenticate=function(){}),this.deauthenticate=function(){})}function _buildServiceManager(t,r,i){var a=this,u=t===p.default.LOCAL?null:function(t){return a.disconnect=t,a.connect()},c=t!==p.default.PRIVATE?null:function(t){return a.deauthenticate=t,a.authenticate()};return new l.default(r,i,(function(t){return a.initialize(t)}),u,c)}function _installLifeCycleHooks(t){var r=this;t.onInitialized((function(){t.type()!==p.default.LOCAL&&t.dependencies().forEach((function(t){r.get(t).manager().onDisconnected((function(){return r.disconnect()}))})),t.type()===p.default.PRIVATE&&t.dependencies().forEach((function(t){r.get(t).manager().onDeauthenticated((function(){return r.deauthenticate()}))}))}))}function _guardLifeCycleMethods(){var t={initialize:this.initialize,connect:this.connect,authenticate:this.authenticate};this.initialize=function(r){if(this.manager().state()!==d.default.INITIALIZING)throw new Error("Expected state INITIALIZING, but got "+this.manager().state()+". Did you mean to call service.manager().initialize() instead of service.initialize()?");return t.initialize.apply(this,[r])},void 0!==t.connect&&(this.connect=function(){if(this.manager().state()!==d.default.CONNECTING)throw new Error("Expected state CONNECTING, but got "+this.manager().state()+". Did you mean to call service.manager().connect() instead of service.connect()?");return t.connect.apply(this)}),void 0!==t.authenticate&&(this.authenticate=function(){if(this.manager().state()!==d.default.AUTHENTICATING)throw new Error("Expected state AUTHENTICATING, but got "+this.manager().state()+". Did you mean to call service.manager().authenticate() instead of service.authenticate()?");return t.authenticate.apply(this)})}var y=function(){function ServiceBase(t,r){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:[];if((0,u.default)(this,ServiceBase),r||(r=this.constructor.role),this.constructor.dependencies&&(i=this.constructor.dependencies),void 0===p.default[t])throw new Error("Invalid ServiceType: "+t);_defineLifeCycleMethods.call(this,t),this._serviceManager=_buildServiceManager.call(this,t,r,i),_installLifeCycleHooks.call(this,this._serviceManager),_guardLifeCycleMethods.call(this)}return(0,c.default)(ServiceBase,[{key:"manager",value:function manager(){return this._serviceManager}},{key:"get",value:function get(t){return this._serviceManager.dependency(t)}}]),ServiceBase}();r.default=y},function(t,r,i){var a=i(60)(Object,"create");t.exports=a},function(t,r,i){var a=i(61),u=i(186),c=i(187),l=a?a.toStringTag:void 0;t.exports=function baseGetTag(t){return null==t?void 0===t?"[object Undefined]":"[object Null]":l&&l in Object(t)?u(t):c(t)}},function(t,r,i){var a=i(199);t.exports=function assocIndexOf(t,r){for(var i=t.length;i--;)if(a(t[i][0],r))return i;return-1}},function(t,r,i){var a=i(205);t.exports=function getMapData(t,r){var i=t.__data__;return a(r)?i["string"==typeof r?"string":"hash"]:i.map}},function(t,r){t.exports=function isObjectLike(t){return null!=t&&"object"==typeof t}},function(t,r,i){var a=i(113);t.exports=function(t,r,i){if(a(t),void 0===r)return t;switch(i){case 1:return function(i){return t.call(r,i)};case 2:return function(i,a){return t.call(r,i,a)};case 3:return function(i,a,u){return t.call(r,i,a,u)}}return function(){return t.apply(r,arguments)}}},function(t,r,i){var a=i(20);t.exports=function(t,r){if(!a(t))return t;var i,u;if(r&&"function"==typeof(i=t.toString)&&!a(u=i.call(t)))return u;if("function"==typeof(i=t.valueOf)&&!a(u=i.call(t)))return u;if(!r&&"function"==typeof(i=t.toString)&&!a(u=i.call(t)))return u;throw TypeError("Can't convert object to primitive value")}},function(t,r){var i={}.toString;t.exports=function(t){return i.call(t).slice(8,-1)}},function(t,r){t.exports=function(t){if(null==t)throw TypeError("Can't call method on  "+t);return t}},function(t,r){var i=Math.ceil,a=Math.floor;t.exports=function(t){return isNaN(t=+t)?0:(t>0?a:i)(t)}},function(t,r,i){var a=i(47)("keys"),u=i(33);t.exports=function(t){return a[t]||(a[t]=u(t))}},function(t,r,i){var a=i(4),u=i(12),c=u["__core-js_shared__"]||(u["__core-js_shared__"]={});(t.exports=function(t,r){return c[t]||(c[t]=void 0!==r?r:{})})("versions",[]).push({version:a.version,mode:i(32)?"pure":"global",copyright:"© 2019 Denis Pushkarev (zloirock.ru)"})},function(t,r){t.exports="constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf".split(",")},function(t,r){r.f=Object.getOwnPropertySymbols},function(t,r,i){var a=i(122)(!0);i(78)(String,"String",(function(t){this._t=String(t),this._i=0}),(function(){var t,r=this._t,i=this._i;return i>=r.length?{value:void 0,done:!0}:(t=a(r,i),this._i+=t.length,{value:t,done:!1})}))},function(t,r,i){var a=i(16),u=i(124),c=i(48),l=i(46)("IE_PROTO"),Empty=function(){},createDict=function(){var t,r=i(69)("iframe"),a=c.length;for(r.style.display="none",i(125).appendChild(r),r.src="javascript:",(t=r.contentWindow.document).open(),t.write("<script>document.F=Object<\/script>"),t.close(),createDict=t.F;a--;)delete createDict.prototype[c[a]];return createDict()};t.exports=Object.create||function create(t,r){var i;return null!==t?(Empty.prototype=a(t),i=new Empty,Empty.prototype=null,i[l]=t):i=createDict(),void 0===r?i:u(i,r)}},function(t,r,i){var a=i(13).f,u=i(17),c=i(7)("toStringTag");t.exports=function(t,r,i){t&&!u(t=i?t:t.prototype,c)&&a(t,c,{configurable:!0,value:r})}},function(t,r,i){r.f=i(7)},function(t,r,i){var a=i(12),u=i(4),c=i(32),l=i(53),p=i(13).f;t.exports=function(t){var r=u.Symbol||(u.Symbol=c?{}:a.Symbol||{});"_"==t.charAt(0)||t in r||p(r,t,{value:l.f(t)})}},function(t,r){function _setPrototypeOf(r,i){return t.exports=_setPrototypeOf=Object.setPrototypeOf||function _setPrototypeOf(t,r){return t.__proto__=r,t},_setPrototypeOf(r,i)}t.exports=_setPrototypeOf},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.DependencyNotResolvedError=r.UnknownDependencyError=r.InvalidServiceError=r.default=void 0;var u=a(i(15)),c=a(i(169)),l=a(i(2)),p=a(i(1)),d=a(i(5)),y=a(i(6)),h=a(i(3)),g=a(i(57)),v=a(i(174));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,h.default)(t);if(r){var u=(0,h.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,y.default)(this,i)}}var m=function(t){(0,d.default)(InvalidServiceError,t);var r=_createSuper(InvalidServiceError);function InvalidServiceError(t){return(0,p.default)(this,InvalidServiceError),r.call(this,t)}return InvalidServiceError}((0,g.default)(Error));r.InvalidServiceError=m;var b=function(t){(0,d.default)(UnknownDependencyError,t);var r=_createSuper(UnknownDependencyError);function UnknownDependencyError(t,i){return(0,p.default)(this,UnknownDependencyError),r.call(this,"Injected service "+i+" is not a dependency of "+t)}return UnknownDependencyError}((0,g.default)(Error));r.UnknownDependencyError=b;var _=function(t){(0,d.default)(DependencyNotResolvedError,t);var r=_createSuper(DependencyNotResolvedError);function DependencyNotResolvedError(t,i){return(0,p.default)(this,DependencyNotResolvedError),r.call(this,"Dependency "+i+" of service "+t+" is unavailable.")}return DependencyNotResolvedError}((0,g.default)(Error));function _waitForDependencies(t){return Promise.all(this.dependencies().map((function(r){return t(r)})))}r.DependencyNotResolvedError=_;var w=function(t){(0,d.default)(ServiceManager,t);var r=_createSuper(ServiceManager);function ServiceManager(t){var i,a=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[],u=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null,c=arguments.length>3&&void 0!==arguments[3]?arguments[3]:null,l=arguments.length>4&&void 0!==arguments[4]?arguments[4]:null;if((0,p.default)(this,ServiceManager),i=r.call(this,u,c,l),!t)throw new Error("Service name must not be empty.");return i._name=t,i._dependencies=a,i._injections={},a.forEach((function(t){return i._injections[t]=null})),i}return(0,l.default)(ServiceManager,null,[{key:"isValidService",value:function isValidService(t){return null!==t&&"object"===(0,u.default)(t)&&"function"==typeof t.manager}}]),(0,l.default)(ServiceManager,[{key:"name",value:function name(){return this._name}},{key:"dependencies",value:function dependencies(){return this._dependencies}},{key:"inject",value:function inject(t,r){if(void 0===this._injections[t])throw new b(this.name(),t);if(!ServiceManager.isValidService(r))throw new m("Cannot inject invalid service in "+this.name());return this._injections[t]=r,this}},{key:"dependency",value:function dependency(t){if(!this._injections[t])throw new _(this.name(),t);return this._injections[t]}},{key:"initialize",value:function initialize(){var t=this;return this.initializeDependencies().then((function(){return(0,c.default)((0,h.default)(ServiceManager.prototype),"initialize",t).call(t,t._settings)}))}},{key:"connect",value:function connect(){var t=this;return this.connectDependencies().then((function(){return(0,c.default)((0,h.default)(ServiceManager.prototype),"connect",t).call(t)}))}},{key:"authenticate",value:function authenticate(){var t=this;return this.authenticateDependencies().then((function(){return(0,c.default)((0,h.default)(ServiceManager.prototype),"authenticate",t).call(t)}))}},{key:"initializeDependencies",value:function initializeDependencies(){var t=this;return _waitForDependencies.call(this,(function(r){return t.dependency(r).manager().initialize()}))}},{key:"connectDependencies",value:function connectDependencies(){var t=this;return _waitForDependencies.call(this,(function(r){return t.dependency(r).manager().connect()}))}},{key:"authenticateDependencies",value:function authenticateDependencies(){var t=this;return _waitForDependencies.call(this,(function(r){return t.dependency(r).manager().authenticate()}))}},{key:"createService",value:function createService(){var t=this;return{manager:function manager(){return t}}}}]),ServiceManager}(v.default);r.default=w},function(t,r,i){var a=i(3),u=i(55),c=i(171),l=i(172);function _wrapNativeSuper(r){var i="function"==typeof Map?new Map:void 0;return t.exports=_wrapNativeSuper=function _wrapNativeSuper(t){if(null===t||!c(t))return t;if("function"!=typeof t)throw new TypeError("Super expression must either be null or a function");if(void 0!==i){if(i.has(t))return i.get(t);i.set(t,Wrapper)}function Wrapper(){return l(t,arguments,a(this).constructor)}return Wrapper.prototype=Object.create(t.prototype,{constructor:{value:Wrapper,enumerable:!1,writable:!0,configurable:!0}}),u(Wrapper,t)},_wrapNativeSuper(r)}t.exports=_wrapNativeSuper},function(t,r,i){var a=i(15);function _getRequireWildcardCache(){if("function"!=typeof WeakMap)return null;var t=new WeakMap;return _getRequireWildcardCache=function _getRequireWildcardCache(){return t},t}t.exports=function _interopRequireWildcard(t){if(t&&t.__esModule)return t;if(null===t||"object"!==a(t)&&"function"!=typeof t)return{default:t};var r=_getRequireWildcardCache();if(r&&r.has(t))return r.get(t);var i={},u=Object.defineProperty&&Object.getOwnPropertyDescriptor;for(var c in t)if(Object.prototype.hasOwnProperty.call(t,c)){var l=u?Object.getOwnPropertyDescriptor(t,c):null;l&&(l.get||l.set)?Object.defineProperty(i,c,l):i[c]=t[c]}return i.default=t,r&&r.set(t,i),i}},function(t,r,i){Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var a={CREATED:"CREATED",INITIALIZING:"INITIALIZING",OFFLINE:"OFFLINE",CONNECTING:"CONNECTING",ONLINE:"ONLINE",AUTHENTICATING:"AUTHENTICATING",READY:"READY",ERROR:"ERROR"};r.default=a},function(t,r,i){var a=i(185),u=i(191);t.exports=function getNative(t,r){var i=u(t,r);return a(i)?i:void 0}},function(t,r,i){var a=i(30).Symbol;t.exports=a},function(t,r){var i;i=function(){return this}();try{i=i||new Function("return this")()}catch(t){"object"==typeof window&&(i=window)}t.exports=i},function(t,r){t.exports=function isObject(t){var r=typeof t;return null!=t&&("object"==r||"function"==r)}},function(t,r,i){var a=i(247),u=i(248),c=i(85),l=i(249);t.exports=function _toConsumableArray(t){return a(t)||u(t)||c(t)||l()}},function(t,r){var i=RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");t.exports=function hasUnicode(t){return i.test(t)}},function(t,r,i){Object.defineProperty(r,"__esModule",{value:!0}),r.createGetCurrency=r.Currency=void 0;var a=_interopRequireDefault(i(67)),u=_interopRequireDefault(i(73)),c=_interopRequireDefault(i(75)),l=_interopRequireDefault(i(76)),p=_interopRequireDefault(i(83));r.createCurrency=function createCurrency(t){var r=function creatorFn(t,r){return new i(t,r)},i=function(i){function CurrencyX(i,a){(0,c.default)(this,CurrencyX);var p=(0,l.default)(this,(CurrencyX.__proto__||(0,u.default)(CurrencyX)).call(this,i,a));return p.symbol=t,p.type=r,p}return(0,p.default)(CurrencyX,i),CurrencyX}(y);return Object.defineProperty(i,"name",{value:t}),Object.defineProperty(i,"symbol",{value:t}),(0,a.default)(r,{wei:makeShiftedCreatorFn(r,t,"wei"),ray:makeShiftedCreatorFn(r,t,"ray"),rad:makeShiftedCreatorFn(r,t,"rad"),symbol:t,isInstance:function isInstance(t){return t instanceof i}}),(0,a.default)(i,{wei:r.wei,ray:r.ray}),r},r.createCurrencyRatio=function createCurrencyRatio(t,r){var i=t(0).constructor,u=r(0).constructor,c=function creatorFn(t,r){return new d.CurrencyRatio(t,i,u,r)},l=i.symbol+"/"+u.symbol;return(0,a.default)(c,{wei:makeShiftedCreatorFn(c,l,"wei"),ray:makeShiftedCreatorFn(c,l,"ray"),rad:makeShiftedCreatorFn(c,l,"rad"),symbol:l,isInstance:function isInstance(t){return t instanceof d.CurrencyRatio&&t.symbol===l}}),c};var d=i(146);function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}var y=r.Currency=d.Currency;function makeShiftedCreatorFn(t,r,i){var a=function fn(r){return t(r,i)};return a.symbol=r,a.shift=i,a}r.createGetCurrency=function createGetCurrency(t){return function(r,i){if(r instanceof y)return r;if(!i)throw new Error("Amount is not a Currency");var a="string"==typeof i?i.toUpperCase():i.symbol,u=t[a];if(!u)throw new Error("Couldn't find currency for \""+a+'"');return u(r,i.shift)}}},function(t,r,i){t.exports={default:i(111),__esModule:!0}},function(t,r,i){t.exports=!i(14)&&!i(21)((function(){return 7!=Object.defineProperty(i(69)("div"),"a",{get:function(){return 7}}).a}))},function(t,r,i){var a=i(20),u=i(12).document,c=a(u)&&a(u.createElement);t.exports=function(t){return c?u.createElement(t):{}}},function(t,r,i){var a=i(17),u=i(22),c=i(115)(!1),l=i(46)("IE_PROTO");t.exports=function(t,r){var i,p=u(t),d=0,y=[];for(i in p)i!=l&&a(p,i)&&y.push(i);for(;r.length>d;)a(p,i=r[d++])&&(~c(y,i)||y.push(i));return y}},function(t,r,i){var a=i(43);t.exports=Object("z").propertyIsEnumerable(0)?Object:function(t){return"String"==a(t)?t.split(""):Object(t)}},function(t,r,i){var a=i(45),u=Math.min;t.exports=function(t){return t>0?u(a(t),9007199254740991):0}},function(t,r,i){t.exports={default:i(117),__esModule:!0}},function(t,r,i){var a=i(17),u=i(27),c=i(46)("IE_PROTO"),l=Object.prototype;t.exports=Object.getPrototypeOf||function(t){return t=u(t),a(t,c)?t[c]:"function"==typeof t.constructor&&t instanceof t.constructor?t.constructor.prototype:t instanceof Object?l:null}},function(t,r,i){r.__esModule=!0,r.default=function(t,r){if(!(t instanceof r))throw new TypeError("Cannot call a class as a function")}},function(t,r,i){r.__esModule=!0;var a=function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}(i(77));r.default=function(t,r){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!r||"object"!==(void 0===r?"undefined":(0,a.default)(r))&&"function"!=typeof r?t:r}},function(t,r,i){r.__esModule=!0;var a=_interopRequireDefault(i(120)),u=_interopRequireDefault(i(129)),c="function"==typeof u.default&&"symbol"==typeof a.default?function(t){return typeof t}:function(t){return t&&"function"==typeof u.default&&t.constructor===u.default&&t!==u.default.prototype?"symbol":typeof t};function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}r.default="function"==typeof u.default&&"symbol"===c(a.default)?function(t){return void 0===t?"undefined":c(t)}:function(t){return t&&"function"==typeof u.default&&t.constructor===u.default&&t!==u.default.prototype?"symbol":void 0===t?"undefined":c(t)}},function(t,r,i){var a=i(32),u=i(11),c=i(79),l=i(19),p=i(28),d=i(123),y=i(52),h=i(74),g=i(7)("iterator"),v=!([].keys&&"next"in[].keys()),returnThis=function(){return this};t.exports=function(t,r,i,m,b,_,w){d(i,r,m);var x,S,O,getMethod=function(t){if(!v&&t in N)return N[t];switch(t){case"keys":return function keys(){return new i(this,t)};case"values":return function values(){return new i(this,t)}}return function entries(){return new i(this,t)}},E=r+" Iterator",k="values"==b,A=!1,N=t.prototype,T=N[g]||N["@@iterator"]||b&&N[b],P=T||getMethod(b),C=b?k?getMethod("entries"):P:void 0,B="Array"==r&&N.entries||T;if(B&&(O=h(B.call(new t)))!==Object.prototype&&O.next&&(y(O,E,!0),a||"function"==typeof O[g]||l(O,g,returnThis)),k&&T&&"values"!==T.name&&(A=!0,P=function values(){return T.call(this)}),a&&!w||!v&&!A&&N[g]||l(N,g,P),p[r]=P,p[E]=returnThis,b)if(x={values:k?P:getMethod("values"),keys:_?P:getMethod("keys"),entries:C},w)for(S in x)S in N||c(N,S,x[S]);else u(u.P+u.F*(v||A),r,x);return x}},function(t,r,i){t.exports=i(19)},function(t,r,i){i(126);for(var a=i(12),u=i(19),c=i(28),l=i(7)("toStringTag"),p="CSSRuleList,CSSStyleDeclaration,CSSValueList,ClientRectList,DOMRectList,DOMStringList,DOMTokenList,DataTransferItemList,FileList,HTMLAllCollection,HTMLCollection,HTMLFormElement,HTMLSelectElement,MediaList,MimeTypeArray,NamedNodeMap,NodeList,PaintRequestList,Plugin,PluginArray,SVGLengthList,SVGNumberList,SVGPathSegList,SVGPointList,SVGStringList,SVGTransformList,SourceBufferList,StyleSheetList,TextTrackCueList,TextTrackList,TouchList".split(","),d=0;d<p.length;d++){var y=p[d],h=a[y],g=h&&h.prototype;g&&!g[l]&&u(g,l,y),c[y]=c.Array}},function(t,r,i){var a=i(70),u=i(48).concat("length","prototype");r.f=Object.getOwnPropertyNames||function getOwnPropertyNames(t){return a(t,u)}},function(t,r,i){var a=i(34),u=i(26),c=i(22),l=i(42),p=i(17),d=i(68),y=Object.getOwnPropertyDescriptor;r.f=i(14)?y:function getOwnPropertyDescriptor(t,r){if(t=c(t),r=l(r,!0),d)try{return y(t,r)}catch(t){}if(p(t,r))return u(!a.f.call(t,r),t[r])}},function(t,r,i){r.__esModule=!0;var a=_interopRequireDefault(i(139)),u=_interopRequireDefault(i(143)),c=_interopRequireDefault(i(77));function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}r.default=function(t,r){if("function"!=typeof r&&null!==r)throw new TypeError("Super expression must either be null or a function, not "+(void 0===r?"undefined":(0,c.default)(r)));t.prototype=(0,u.default)(r&&r.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),r&&(a.default?(0,a.default)(t,r):t.__proto__=r)}},function(t,r,i){var a=i(150),u=i(7)("iterator"),c=i(28);t.exports=i(4).getIteratorMethod=function(t){if(null!=t)return t[u]||t["@@iterator"]||c[a(t)]}},function(t,r,i){var a=i(86);t.exports=function _unsupportedIterableToArray(t,r){if(t){if("string"==typeof t)return a(t,r);var i=Object.prototype.toString.call(t).slice(8,-1);return"Object"===i&&t.constructor&&(i=t.constructor.name),"Map"===i||"Set"===i?Array.from(t):"Arguments"===i||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(i)?a(t,r):void 0}}},function(t,r){t.exports=function _arrayLikeToArray(t,r){(null==r||r>t.length)&&(r=t.length);for(var i=0,a=new Array(r);i<r;i++)a[i]=t[i];return a}},function(t,r){t.exports=function _assertThisInitialized(t){if(void 0===t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return t}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=function standardizeConfig(t,r,i){if(r instanceof Array)return"boolean"==typeof r[0]&&i?[resolveNameForBoolean(t,r[0],i),r[1]]:r;var a,l={};switch((0,u.default)(r)){case"string":case"function":a=r;break;case"object":r instanceof c.default?a=r:(a=!i||resolveNameForBoolean(t,!0,i),l=r);break;case"boolean":a=i?resolveNameForBoolean(t,r,i):r;break;default:throw new Error("could not parse settings for ".concat(t,":"),r)}return[a,l]};var u=a(i(15)),c=a(i(35));function resolveNameForBoolean(t,r,i){var a,u=i.defaults,c=i.disabled;if(r){if(!(a=u[t]))throw new Error('The "'.concat(t,'" service has no default'))}else if(!(a=c[t]))throw new Error('The "'.concat(t,'" service cannot be disabled'));return a}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=r.IllegalStateError=void 0;var u=a(i(15)),c=a(i(2)),l=a(i(1)),p=a(i(5)),d=a(i(6)),y=a(i(3));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,y.default)(t);if(r){var u=(0,y.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,d.default)(this,i)}}var h=function(t){(0,p.default)(IllegalStateError,t);var r=_createSuper(IllegalStateError);function IllegalStateError(){return(0,l.default)(this,IllegalStateError),r.apply(this,arguments)}return IllegalStateError}((0,a(i(57)).default)(Error));r.IllegalStateError=h;var g=function(){function StateMachine(t,r){if((0,l.default)(this,StateMachine),"object"!==(0,u.default)(r))throw new Error("StateMachine transitions parameter must be an object.");if(Object.keys(r).filter((function(t){return r.hasOwnProperty(t)&&!(r[t]instanceof Array)})).length>0)throw new Error("Illegal StateMachine transition found: not an array.");if(Object.keys(r).filter((function(t){return r.hasOwnProperty(t)&&r[t].filter((function(t){return!r[t]})).length>0})).length>0)throw new Error("Illegal StateMachine transition found: target state not in transition map.");if(!(r[t]instanceof Array))throw new Error("Initial state "+t+" is not set in the transitions map.");this._state=t,this._nextStates=r,this._stateChangedHandlers=[]}return(0,c.default)(StateMachine,[{key:"onStateChanged",value:function onStateChanged(t){this._stateChangedHandlers.push(t)}},{key:"state",value:function state(){return this._state}},{key:"inState",value:function inState(t){return t instanceof Array||(t=[t]),t.indexOf(this._state)>=0}},{key:"assertState",value:function assertState(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"";if(!this.inState(t))throw new h("Illegal operation for state "+this._state+(r.length>0?": "+r:""))}},{key:"transitionTo",value:function transitionTo(t){if(void 0===this._nextStates[t])throw new h("Cannot set illegal state: "+t);if(t!==this._state){if(this._nextStates[this._state].indexOf(t)<0)throw new h("Illegal state transition: "+this._state+" to "+t);var r=this._state;this._state=t,this._stateChangedHandlers.forEach((function(i){return i(r,t)}))}return this}}]),StateMachine}();r.default=g},function(t,r){var i,a,u=t.exports={};function defaultSetTimout(){throw new Error("setTimeout has not been defined")}function defaultClearTimeout(){throw new Error("clearTimeout has not been defined")}function runTimeout(t){if(i===setTimeout)return setTimeout(t,0);if((i===defaultSetTimout||!i)&&setTimeout)return i=setTimeout,setTimeout(t,0);try{return i(t,0)}catch(r){try{return i.call(null,t,0)}catch(r){return i.call(this,t,0)}}}!function(){try{i="function"==typeof setTimeout?setTimeout:defaultSetTimout}catch(t){i=defaultSetTimout}try{a="function"==typeof clearTimeout?clearTimeout:defaultClearTimeout}catch(t){a=defaultClearTimeout}}();var c,l=[],p=!1,d=-1;function cleanUpNextTick(){p&&c&&(p=!1,c.length?l=c.concat(l):d=-1,l.length&&drainQueue())}function drainQueue(){if(!p){var t=runTimeout(cleanUpNextTick);p=!0;for(var r=l.length;r;){for(c=l,l=[];++d<r;)c&&c[d].run();d=-1,r=l.length}c=null,p=!1,function runClearTimeout(t){if(a===clearTimeout)return clearTimeout(t);if((a===defaultClearTimeout||!a)&&clearTimeout)return a=clearTimeout,clearTimeout(t);try{return a(t)}catch(r){try{return a.call(null,t)}catch(r){return a.call(this,t)}}}(t)}}function Item(t,r){this.fun=t,this.array=r}function noop(){}u.nextTick=function(t){var r=new Array(arguments.length-1);if(arguments.length>1)for(var i=1;i<arguments.length;i++)r[i-1]=arguments[i];l.push(new Item(t,r)),1!==l.length||p||runTimeout(drainQueue)},Item.prototype.run=function(){this.fun.apply(null,this.array)},u.title="browser",u.browser=!0,u.env={},u.argv=[],u.version="",u.versions={},u.on=noop,u.addListener=noop,u.once=noop,u.off=noop,u.removeListener=noop,u.removeAllListeners=noop,u.emit=noop,u.prependListener=noop,u.prependOnceListener=noop,u.listeners=function(t){return[]},u.binding=function(t){throw new Error("process.binding is not supported")},u.cwd=function(){return"/"},u.chdir=function(t){throw new Error("process.chdir is not supported")},u.umask=function(){return 0}},function(t,r,i){var a=i(179);t.exports=function uniq(t){return t&&t.length?a(t):[]}},function(t,r,i){var a=i(37),u=i(63);t.exports=function isFunction(t){if(!u(t))return!1;var r=a(t);return"[object Function]"==r||"[object GeneratorFunction]"==r||"[object AsyncFunction]"==r||"[object Proxy]"==r}},function(t,r,i){(function(r){var i="object"==typeof r&&r&&r.Object===Object&&r;t.exports=i}).call(this,i(62))},function(t,r){t.exports=function setToArray(t){var r=-1,i=Array(t.size);return t.forEach((function(t){i[++r]=t})),i}},function(t,r,i){var a=i(58),u=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.orderServices=orderServices,Object.defineProperty(r,"InvalidServiceError",{enumerable:!0,get:function get(){return _.InvalidServiceError}}),r.ServiceNotFoundError=r.ServiceAlreadyRegisteredError=r.ExtractedServiceError=r.default=void 0;var c=u(i(8)),l=u(i(9)),p=u(i(2)),d=u(i(1)),y=u(i(5)),h=u(i(6)),g=u(i(3)),v=u(i(57)),m=u(i(221)),b=u(i(91)),_=a(i(56)),w=u(i(239));function _createForOfIteratorHelper(t){if("undefined"==typeof Symbol||null==t[Symbol.iterator]){if(Array.isArray(t)||(t=function _unsupportedIterableToArray(t,r){if(!t)return;if("string"==typeof t)return _arrayLikeToArray(t,r);var i=Object.prototype.toString.call(t).slice(8,-1);"Object"===i&&t.constructor&&(i=t.constructor.name);if("Map"===i||"Set"===i)return Array.from(t);if("Arguments"===i||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(i))return _arrayLikeToArray(t,r)}(t))){var r=0,i=function F(){};return{s:i,n:function n(){return r>=t.length?{done:!0}:{done:!1,value:t[r++]}},e:function e(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,u,c=!0,l=!1;return{s:function s(){a=t[Symbol.iterator]()},n:function n(){var t=a.next();return c=t.done,t},e:function e(t){l=!0,u=t},f:function f(){try{c||null==a.return||a.return()}finally{if(l)throw u}}}}function _arrayLikeToArray(t,r){(null==r||r>t.length)&&(r=t.length);for(var i=0,a=new Array(r);i<r;i++)a[i]=t[i];return a}function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,g.default)(t);if(r){var u=(0,g.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,h.default)(this,i)}}var x=function(t){(0,y.default)(ServiceAlreadyRegisteredError,t);var r=_createSuper(ServiceAlreadyRegisteredError);function ServiceAlreadyRegisteredError(t){return(0,d.default)(this,ServiceAlreadyRegisteredError),r.call(this,"Service with name '"+t+"' is already registered with this container.")}return ServiceAlreadyRegisteredError}((0,v.default)(Error));r.ServiceAlreadyRegisteredError=x;var S=function(t){(0,y.default)(ServiceNotFoundError,t);var r=_createSuper(ServiceNotFoundError);function ServiceNotFoundError(t){return(0,d.default)(this,ServiceNotFoundError),r.call(this,"Service with name '"+t+"' cannot be found in this container.")}return ServiceNotFoundError}((0,v.default)(Error));r.ServiceNotFoundError=S;var O=function(t){(0,y.default)(ExtractedServiceError,t);var r=_createSuper(ExtractedServiceError);function ExtractedServiceError(t){return(0,d.default)(this,ExtractedServiceError),r.call(this,"Service with name '"+t+"' has been extracted from the core dai.js library into a discrete plugin. Please refer to the documentation here to install and add it to your configuration: \n\n https://github.com/makerdao/dai.js/wiki/Basic-Usage-(Plugins) \n\n")}return ExtractedServiceError}((0,v.default)(Error));function orderServices(t){var r,i=[],a=[],u=_createForOfIteratorHelper(t);try{var c=function _loop(){var t=r.value,u=t.manager().name(),c=t.manager().dependencies();0===c.length?a.push(u):c.forEach((function(t){return i.push([t,u])}))};for(u.s();!(r=u.n()).done;)c()}catch(t){u.e(t)}finally{u.f()}return(0,b.default)((0,w.default)(i).concat(a))}r.ExtractedServiceError=O;var E=function(){function Container(){(0,d.default)(this,Container),this._services={},this.isAuthenticated=!1}var t;return(0,p.default)(Container,[{key:"register",value:function register(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null;if(!_.default.isValidService(t))throw new _.InvalidServiceError("Service must be an object with manager() method returning a valid ServiceManager");r=r||t.manager().name();var i=this.service(r,!1);if(void 0!==i&&i!==t)throw new x(r);return this._services[r]=t,this}},{key:"service",value:function service(t){var r=!(arguments.length>1&&void 0!==arguments[1])||arguments[1],i=["exchange"];if(!t)throw new Error("Provide a service name.");if(!this._services[t]&&r&&i.includes(t))throw new O(t);if(!this._services[t]&&r)throw new S(t);return this._services[t]}},{key:"getRegisteredServiceNames",value:function getRegisteredServiceNames(){return Object.keys(this._services)}},{key:"injectDependencies",value:function injectDependencies(){var t,r=_createForOfIteratorHelper((0,m.default)(this._services));try{for(r.s();!(t=r.n()).done;){var i,a=t.value.manager(),u=_createForOfIteratorHelper(a.dependencies());try{for(u.s();!(i=u.n()).done;){var c=i.value;if(!this._services[c])throw new S(c);a.inject(c,this._services[c])}}catch(t){u.e(t)}finally{u.f()}}}catch(t){r.e(t)}finally{r.f()}}},{key:"initialize",value:function initialize(){return this._waitForServices((function(t){return t.manager().initialize()}))}},{key:"connect",value:function connect(){return this._waitForServices((function(t){return t.manager().connect()}))}},{key:"authenticate",value:function authenticate(){var t=this;return this._waitForServices((function(t){return t.manager().authenticate()})).then((function(){t.isAuthenticated=!0}))}},{key:"_waitForServices",value:(t=(0,l.default)(c.default.mark((function _callee(t){var r,i,a;return c.default.wrap((function _callee$(u){for(;;)switch(u.prev=u.next){case 0:this._orderedServiceNames||(this._orderedServiceNames=orderServices((0,m.default)(this._services))),r=_createForOfIteratorHelper(this._orderedServiceNames),u.prev=2,r.s();case 4:if((i=r.n()).done){u.next=13;break}if(a=i.value,this._services[a]){u.next=9;break}throw new Error("No service for ".concat(a));case 9:return u.next=11,t(this._services[a]);case 11:u.next=4;break;case 13:u.next=18;break;case 15:u.prev=15,u.t0=u.catch(2),r.e(u.t0);case 18:return u.prev=18,r.f(),u.finish(18);case 21:case"end":return u.stop()}}),_callee,this,[[2,15,18,21]])}))),function _waitForServices(r){return t.apply(this,arguments)})}]),Container}();r.default=E},function(t,r){t.exports=function arrayMap(t,r){for(var i=-1,a=null==t?0:t.length,u=Array(a);++i<a;)u[i]=r(t[i],i,t);return u}},function(t,r){t.exports=function baseTimes(t,r){for(var i=-1,a=Array(t);++i<t;)a[i]=r(i);return a}},function(t,r){var i=Array.isArray;t.exports=i},function(t,r){t.exports=function(t){return t.webpackPolyfill||(t.deprecate=function(){},t.paths=[],t.children||(t.children=[]),Object.defineProperty(t,"loaded",{enumerable:!0,get:function(){return t.l}}),Object.defineProperty(t,"id",{enumerable:!0,get:function(){return t.i}}),t.webpackPolyfill=1),t}},function(t,r){t.exports=function isLength(t){return"number"==typeof t&&t>-1&&t%1==0&&t<=9007199254740991}},function(t,r,i){var a;!function(u){var c,l=/^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i,p=Math.ceil,d=Math.floor,y="[BigNumber Error] ",h=y+"Number primitive has more than 15 significant digits: ",g=1e14,v=[1,10,100,1e3,1e4,1e5,1e6,1e7,1e8,1e9,1e10,1e11,1e12,1e13],m=1e9;function bitFloor(t){var r=0|t;return t>0||t===r?r:r-1}function coeffToString(t){for(var r,i,a=1,u=t.length,c=t[0]+"";a<u;){for(i=14-(r=t[a++]+"").length;i--;r="0"+r);c+=r}for(u=c.length;48===c.charCodeAt(--u););return c.slice(0,u+1||1)}function compare(t,r){var i,a,u=t.c,c=r.c,l=t.s,p=r.s,d=t.e,y=r.e;if(!l||!p)return null;if(i=u&&!u[0],a=c&&!c[0],i||a)return i?a?0:-p:l;if(l!=p)return l;if(i=l<0,a=d==y,!u||!c)return a?0:!u^i?1:-1;if(!a)return d>y^i?1:-1;for(p=(d=u.length)<(y=c.length)?d:y,l=0;l<p;l++)if(u[l]!=c[l])return u[l]>c[l]^i?1:-1;return d==y?0:d>y^i?1:-1}function intCheck(t,r,i,a){if(t<r||t>i||t!==(t<0?p(t):d(t)))throw Error(y+(a||"Argument")+("number"==typeof t?t<r||t>i?" out of range: ":" not an integer: ":" not a primitive number: ")+t)}function isArray(t){return"[object Array]"==Object.prototype.toString.call(t)}function isOdd(t){var r=t.c.length-1;return bitFloor(t.e/14)==r&&t.c[r]%2!=0}function toExponential(t,r){return(t.length>1?t.charAt(0)+"."+t.slice(1):t)+(r<0?"e":"e+")+r}function toFixedPoint(t,r,i){var a,u;if(r<0){for(u=i+".";++r;u+=i);t=u+t}else if(++r>(a=t.length)){for(u=i,r-=a;--r;u+=i);t+=u}else r<a&&(t=t.slice(0,r)+"."+t.slice(r));return t}(c=function clone(t){var r,i,a,u,c,b,_,w,x,S=BigNumber.prototype={constructor:BigNumber,toString:null,valueOf:null},O=new BigNumber(1),E=20,k=4,A=-7,N=21,T=-1e7,P=1e7,C=!1,B=1,I=0,R={decimalSeparator:".",groupSeparator:",",groupSize:3,secondaryGroupSize:0,fractionGroupSeparator:" ",fractionGroupSize:0},j="0123456789abcdefghijklmnopqrstuvwxyz";function BigNumber(t,r){var u,c,p,y,g,v,m,b,_=this;if(!(_ instanceof BigNumber))return new BigNumber(t,r);if(null==r){if(t instanceof BigNumber)return _.s=t.s,_.e=t.e,void(_.c=(t=t.c)?t.slice():t);if((v="number"==typeof t)&&0*t==0){if(_.s=1/t<0?(t=-t,-1):1,t===~~t){for(y=0,g=t;g>=10;g/=10,y++);return _.e=y,void(_.c=[t])}b=t+""}else{if(!l.test(b=t+""))return a(_,b,v);_.s=45==b.charCodeAt(0)?(b=b.slice(1),-1):1}(y=b.indexOf("."))>-1&&(b=b.replace(".","")),(g=b.search(/e/i))>0?(y<0&&(y=g),y+=+b.slice(g+1),b=b.substring(0,g)):y<0&&(y=b.length)}else{if(intCheck(r,2,j.length,"Base"),b=t+"",10==r)return round(_=new BigNumber(t instanceof BigNumber?t:b),E+_.e+1,k);if(v="number"==typeof t){if(0*t!=0)return a(_,b,v,r);if(_.s=1/t<0?(b=b.slice(1),-1):1,BigNumber.DEBUG&&b.replace(/^0\.0*|\./,"").length>15)throw Error(h+t);v=!1}else _.s=45===b.charCodeAt(0)?(b=b.slice(1),-1):1;for(u=j.slice(0,r),y=g=0,m=b.length;g<m;g++)if(u.indexOf(c=b.charAt(g))<0){if("."==c){if(g>y){y=m;continue}}else if(!p&&(b==b.toUpperCase()&&(b=b.toLowerCase())||b==b.toLowerCase()&&(b=b.toUpperCase()))){p=!0,g=-1,y=0;continue}return a(_,t+"",v,r)}(y=(b=i(b,r,10,_.s)).indexOf("."))>-1?b=b.replace(".",""):y=b.length}for(g=0;48===b.charCodeAt(g);g++);for(m=b.length;48===b.charCodeAt(--m););if(b=b.slice(g,++m)){if(m-=g,v&&BigNumber.DEBUG&&m>15&&(t>9007199254740991||t!==d(t)))throw Error(h+_.s*t);if((y=y-g-1)>P)_.c=_.e=null;else if(y<T)_.c=[_.e=0];else{if(_.e=y,_.c=[],g=(y+1)%14,y<0&&(g+=14),g<m){for(g&&_.c.push(+b.slice(0,g)),m-=14;g<m;)_.c.push(+b.slice(g,g+=14));g=14-(b=b.slice(g)).length}else g-=m;for(;g--;b+="0");_.c.push(+b)}}else _.c=[_.e=0]}function format(t,r,i,a){var u,c,l,p,d;if(null==i?i=k:intCheck(i,0,8),!t.c)return t.toString();if(u=t.c[0],l=t.e,null==r)d=coeffToString(t.c),d=1==a||2==a&&l<=A?toExponential(d,l):toFixedPoint(d,l,"0");else if(c=(t=round(new BigNumber(t),r,i)).e,p=(d=coeffToString(t.c)).length,1==a||2==a&&(r<=c||c<=A)){for(;p<r;d+="0",p++);d=toExponential(d,c)}else if(r-=l,d=toFixedPoint(d,c,"0"),c+1>p){if(--r>0)for(d+=".";r--;d+="0");}else if((r+=c-p)>0)for(c+1==p&&(d+=".");r--;d+="0");return t.s<0&&u?"-"+d:d}function maxOrMin(t,r){var i,a,u=0;for(isArray(t[0])&&(t=t[0]),i=new BigNumber(t[0]);++u<t.length;){if(!(a=new BigNumber(t[u])).s){i=a;break}r.call(i,a)&&(i=a)}return i}function normalise(t,r,i){for(var a=1,u=r.length;!r[--u];r.pop());for(u=r[0];u>=10;u/=10,a++);return(i=a+14*i-1)>P?t.c=t.e=null:i<T?t.c=[t.e=0]:(t.e=i,t.c=r),t}function round(t,r,i,a){var u,c,l,y,h,m,b,_=t.c,w=v;if(_){e:{for(u=1,y=_[0];y>=10;y/=10,u++);if((c=r-u)<0)c+=14,l=r,b=(h=_[m=0])/w[u-l-1]%10|0;else if((m=p((c+1)/14))>=_.length){if(!a)break e;for(;_.length<=m;_.push(0));h=b=0,u=1,l=(c%=14)-14+1}else{for(h=y=_[m],u=1;y>=10;y/=10,u++);b=(l=(c%=14)-14+u)<0?0:h/w[u-l-1]%10|0}if(a=a||r<0||null!=_[m+1]||(l<0?h:h%w[u-l-1]),a=i<4?(b||a)&&(0==i||i==(t.s<0?3:2)):b>5||5==b&&(4==i||a||6==i&&(c>0?l>0?h/w[u-l]:0:_[m-1])%10&1||i==(t.s<0?8:7)),r<1||!_[0])return _.length=0,a?(r-=t.e+1,_[0]=w[(14-r%14)%14],t.e=-r||0):_[0]=t.e=0,t;if(0==c?(_.length=m,y=1,m--):(_.length=m+1,y=w[14-c],_[m]=l>0?d(h/w[u-l]%w[l])*y:0),a)for(;;){if(0==m){for(c=1,l=_[0];l>=10;l/=10,c++);for(l=_[0]+=y,y=1;l>=10;l/=10,y++);c!=y&&(t.e++,_[0]==g&&(_[0]=1));break}if(_[m]+=y,_[m]!=g)break;_[m--]=0,y=1}for(c=_.length;0===_[--c];_.pop());}t.e>P?t.c=t.e=null:t.e<T&&(t.c=[t.e=0])}return t}return BigNumber.clone=clone,BigNumber.ROUND_UP=0,BigNumber.ROUND_DOWN=1,BigNumber.ROUND_CEIL=2,BigNumber.ROUND_FLOOR=3,BigNumber.ROUND_HALF_UP=4,BigNumber.ROUND_HALF_DOWN=5,BigNumber.ROUND_HALF_EVEN=6,BigNumber.ROUND_HALF_CEIL=7,BigNumber.ROUND_HALF_FLOOR=8,BigNumber.EUCLID=9,BigNumber.config=BigNumber.set=function(t){var r,i;if(null!=t){if("object"!=typeof t)throw Error(y+"Object expected: "+t);if(t.hasOwnProperty(r="DECIMAL_PLACES")&&(intCheck(i=t[r],0,m,r),E=i),t.hasOwnProperty(r="ROUNDING_MODE")&&(intCheck(i=t[r],0,8,r),k=i),t.hasOwnProperty(r="EXPONENTIAL_AT")&&(isArray(i=t[r])?(intCheck(i[0],-m,0,r),intCheck(i[1],0,m,r),A=i[0],N=i[1]):(intCheck(i,-m,m,r),A=-(N=i<0?-i:i))),t.hasOwnProperty(r="RANGE"))if(isArray(i=t[r]))intCheck(i[0],-m,-1,r),intCheck(i[1],1,m,r),T=i[0],P=i[1];else{if(intCheck(i,-m,m,r),!i)throw Error(y+r+" cannot be zero: "+i);T=-(P=i<0?-i:i)}if(t.hasOwnProperty(r="CRYPTO")){if((i=t[r])!==!!i)throw Error(y+r+" not true or false: "+i);if(i){if("undefined"==typeof crypto||!crypto||!crypto.getRandomValues&&!crypto.randomBytes)throw C=!i,Error(y+"crypto unavailable");C=i}else C=i}if(t.hasOwnProperty(r="MODULO_MODE")&&(intCheck(i=t[r],0,9,r),B=i),t.hasOwnProperty(r="POW_PRECISION")&&(intCheck(i=t[r],0,m,r),I=i),t.hasOwnProperty(r="FORMAT")){if("object"!=typeof(i=t[r]))throw Error(y+r+" not an object: "+i);R=i}if(t.hasOwnProperty(r="ALPHABET")){if("string"!=typeof(i=t[r])||/^.$|\.|(.).*\1/.test(i))throw Error(y+r+" invalid: "+i);j=i}}return{DECIMAL_PLACES:E,ROUNDING_MODE:k,EXPONENTIAL_AT:[A,N],RANGE:[T,P],CRYPTO:C,MODULO_MODE:B,POW_PRECISION:I,FORMAT:R,ALPHABET:j}},BigNumber.isBigNumber=function(t){return t instanceof BigNumber||t&&!0===t._isBigNumber||!1},BigNumber.maximum=BigNumber.max=function(){return maxOrMin(arguments,S.lt)},BigNumber.minimum=BigNumber.min=function(){return maxOrMin(arguments,S.gt)},BigNumber.random=(u=9007199254740992*Math.random()&2097151?function(){return d(9007199254740992*Math.random())}:function(){return 8388608*(1073741824*Math.random()|0)+(8388608*Math.random()|0)},function(t){var r,i,a,c,l,h=0,g=[],b=new BigNumber(O);if(null==t?t=E:intCheck(t,0,m),c=p(t/14),C)if(crypto.getRandomValues){for(r=crypto.getRandomValues(new Uint32Array(c*=2));h<c;)(l=131072*r[h]+(r[h+1]>>>11))>=9e15?(i=crypto.getRandomValues(new Uint32Array(2)),r[h]=i[0],r[h+1]=i[1]):(g.push(l%1e14),h+=2);h=c/2}else{if(!crypto.randomBytes)throw C=!1,Error(y+"crypto unavailable");for(r=crypto.randomBytes(c*=7);h<c;)(l=281474976710656*(31&r[h])+1099511627776*r[h+1]+4294967296*r[h+2]+16777216*r[h+3]+(r[h+4]<<16)+(r[h+5]<<8)+r[h+6])>=9e15?crypto.randomBytes(7).copy(r,h):(g.push(l%1e14),h+=7);h=c/7}if(!C)for(;h<c;)(l=u())<9e15&&(g[h++]=l%1e14);for(t%=14,(c=g[--h])&&t&&(l=v[14-t],g[h]=d(c/l)*l);0===g[h];g.pop(),h--);if(h<0)g=[a=0];else{for(a=-1;0===g[0];g.splice(0,1),a-=14);for(h=1,l=g[0];l>=10;l/=10,h++);h<14&&(a-=14-h)}return b.e=a,b.c=g,b}),i=function(){function toBaseOut(t,r,i,a){for(var u,c,l=[0],p=0,d=t.length;p<d;){for(c=l.length;c--;l[c]*=r);for(l[0]+=a.indexOf(t.charAt(p++)),u=0;u<l.length;u++)l[u]>i-1&&(null==l[u+1]&&(l[u+1]=0),l[u+1]+=l[u]/i|0,l[u]%=i)}return l.reverse()}return function(t,i,a,u,c){var l,p,d,y,h,g,v,m,b=t.indexOf("."),_=E,w=k;for(b>=0&&(y=I,I=0,t=t.replace(".",""),g=(m=new BigNumber(i)).pow(t.length-b),I=y,m.c=toBaseOut(toFixedPoint(coeffToString(g.c),g.e,"0"),10,a,"0123456789"),m.e=m.c.length),d=y=(v=toBaseOut(t,i,a,c?(l=j,"0123456789"):(l="0123456789",j))).length;0==v[--y];v.pop());if(!v[0])return l.charAt(0);if(b<0?--d:(g.c=v,g.e=d,g.s=u,v=(g=r(g,m,_,w,a)).c,h=g.r,d=g.e),b=v[p=d+_+1],y=a/2,h=h||p<0||null!=v[p+1],h=w<4?(null!=b||h)&&(0==w||w==(g.s<0?3:2)):b>y||b==y&&(4==w||h||6==w&&1&v[p-1]||w==(g.s<0?8:7)),p<1||!v[0])t=h?toFixedPoint(l.charAt(1),-_,l.charAt(0)):l.charAt(0);else{if(v.length=p,h)for(--a;++v[--p]>a;)v[p]=0,p||(++d,v=[1].concat(v));for(y=v.length;!v[--y];);for(b=0,t="";b<=y;t+=l.charAt(v[b++]));t=toFixedPoint(t,d,l.charAt(0))}return t}}(),r=function(){function multiply(t,r,i){var a,u,c,l,p=0,d=t.length,y=r%1e7,h=r/1e7|0;for(t=t.slice();d--;)p=((u=y*(c=t[d]%1e7)+(a=h*c+(l=t[d]/1e7|0)*y)%1e7*1e7+p)/i|0)+(a/1e7|0)+h*l,t[d]=u%i;return p&&(t=[p].concat(t)),t}function compare(t,r,i,a){var u,c;if(i!=a)c=i>a?1:-1;else for(u=c=0;u<i;u++)if(t[u]!=r[u]){c=t[u]>r[u]?1:-1;break}return c}function subtract(t,r,i,a){for(var u=0;i--;)t[i]-=u,u=t[i]<r[i]?1:0,t[i]=u*a+t[i]-r[i];for(;!t[0]&&t.length>1;t.splice(0,1));}return function(t,r,i,a,u){var c,l,p,y,h,v,m,b,_,w,x,S,O,E,k,A,N,T=t.s==r.s?1:-1,P=t.c,C=r.c;if(!(P&&P[0]&&C&&C[0]))return new BigNumber(t.s&&r.s&&(P?!C||P[0]!=C[0]:C)?P&&0==P[0]||!C?0*T:T/0:NaN);for(_=(b=new BigNumber(T)).c=[],T=i+(l=t.e-r.e)+1,u||(u=g,l=bitFloor(t.e/14)-bitFloor(r.e/14),T=T/14|0),p=0;C[p]==(P[p]||0);p++);if(C[p]>(P[p]||0)&&l--,T<0)_.push(1),y=!0;else{for(E=P.length,A=C.length,p=0,T+=2,(h=d(u/(C[0]+1)))>1&&(C=multiply(C,h,u),P=multiply(P,h,u),A=C.length,E=P.length),O=A,x=(w=P.slice(0,A)).length;x<A;w[x++]=0);N=C.slice(),N=[0].concat(N),k=C[0],C[1]>=u/2&&k++;do{if(h=0,(c=compare(C,w,A,x))<0){if(S=w[0],A!=x&&(S=S*u+(w[1]||0)),(h=d(S/k))>1)for(h>=u&&(h=u-1),m=(v=multiply(C,h,u)).length,x=w.length;1==compare(v,w,m,x);)h--,subtract(v,A<m?N:C,m,u),m=v.length,c=1;else 0==h&&(c=h=1),m=(v=C.slice()).length;if(m<x&&(v=[0].concat(v)),subtract(w,v,x,u),x=w.length,-1==c)for(;compare(C,w,A,x)<1;)h++,subtract(w,A<x?N:C,x,u),x=w.length}else 0===c&&(h++,w=[0]);_[p++]=h,w[0]?w[x++]=P[O]||0:(w=[P[O]],x=1)}while((O++<E||null!=w[0])&&T--);y=null!=w[0],_[0]||_.splice(0,1)}if(u==g){for(p=1,T=_[0];T>=10;T/=10,p++);round(b,i+(b.e=p+14*l-1)+1,a,y)}else b.e=l,b.r=+y;return b}}(),c=/^(-?)0([xbo])(?=\w[\w.]*$)/i,b=/^([^.]+)\.$/,_=/^\.([^.]+)$/,w=/^-?(Infinity|NaN)$/,x=/^\s*\+(?=[\w.])|^\s+|\s+$/g,a=function(t,r,i,a){var u,l=i?r:r.replace(x,"");if(w.test(l))t.s=isNaN(l)?null:l<0?-1:1,t.c=t.e=null;else{if(!i&&(l=l.replace(c,(function(t,r,i){return u="x"==(i=i.toLowerCase())?16:"b"==i?2:8,a&&a!=u?t:r})),a&&(u=a,l=l.replace(b,"$1").replace(_,"0.$1")),r!=l))return new BigNumber(l,u);if(BigNumber.DEBUG)throw Error(y+"Not a"+(a?" base "+a:"")+" number: "+r);t.c=t.e=t.s=null}},S.absoluteValue=S.abs=function(){var t=new BigNumber(this);return t.s<0&&(t.s=1),t},S.comparedTo=function(t,r){return compare(this,new BigNumber(t,r))},S.decimalPlaces=S.dp=function(t,r){var i,a,u,c=this;if(null!=t)return intCheck(t,0,m),null==r?r=k:intCheck(r,0,8),round(new BigNumber(c),t+c.e+1,r);if(!(i=c.c))return null;if(a=14*((u=i.length-1)-bitFloor(this.e/14)),u=i[u])for(;u%10==0;u/=10,a--);return a<0&&(a=0),a},S.dividedBy=S.div=function(t,i){return r(this,new BigNumber(t,i),E,k)},S.dividedToIntegerBy=S.idiv=function(t,i){return r(this,new BigNumber(t,i),0,1)},S.exponentiatedBy=S.pow=function(t,r){var i,a,u,c,l,h,g,v=this;if((t=new BigNumber(t)).c&&!t.isInteger())throw Error(y+"Exponent not an integer: "+t);if(null!=r&&(r=new BigNumber(r)),c=t.e>14,!v.c||!v.c[0]||1==v.c[0]&&!v.e&&1==v.c.length||!t.c||!t.c[0])return g=new BigNumber(Math.pow(+v.valueOf(),c?2-isOdd(t):+t)),r?g.mod(r):g;if(l=t.s<0,r){if(r.c?!r.c[0]:!r.s)return new BigNumber(NaN);(a=!l&&v.isInteger()&&r.isInteger())&&(v=v.mod(r))}else{if(t.e>9&&(v.e>0||v.e<-1||(0==v.e?v.c[0]>1||c&&v.c[1]>=24e7:v.c[0]<8e13||c&&v.c[0]<=9999975e7)))return u=v.s<0&&isOdd(t)?-0:0,v.e>-1&&(u=1/u),new BigNumber(l?1/u:u);I&&(u=p(I/14+2))}for(c?(i=new BigNumber(.5),h=isOdd(t)):h=t%2,l&&(t.s=1),g=new BigNumber(O);;){if(h){if(!(g=g.times(v)).c)break;u?g.c.length>u&&(g.c.length=u):a&&(g=g.mod(r))}if(c){if(round(t=t.times(i),t.e+1,1),!t.c[0])break;c=t.e>14,h=isOdd(t)}else{if(!(t=d(t/2)))break;h=t%2}v=v.times(v),u?v.c&&v.c.length>u&&(v.c.length=u):a&&(v=v.mod(r))}return a?g:(l&&(g=O.div(g)),r?g.mod(r):u?round(g,I,k,void 0):g)},S.integerValue=function(t){var r=new BigNumber(this);return null==t?t=k:intCheck(t,0,8),round(r,r.e+1,t)},S.isEqualTo=S.eq=function(t,r){return 0===compare(this,new BigNumber(t,r))},S.isFinite=function(){return!!this.c},S.isGreaterThan=S.gt=function(t,r){return compare(this,new BigNumber(t,r))>0},S.isGreaterThanOrEqualTo=S.gte=function(t,r){return 1===(r=compare(this,new BigNumber(t,r)))||0===r},S.isInteger=function(){return!!this.c&&bitFloor(this.e/14)>this.c.length-2},S.isLessThan=S.lt=function(t,r){return compare(this,new BigNumber(t,r))<0},S.isLessThanOrEqualTo=S.lte=function(t,r){return-1===(r=compare(this,new BigNumber(t,r)))||0===r},S.isNaN=function(){return!this.s},S.isNegative=function(){return this.s<0},S.isPositive=function(){return this.s>0},S.isZero=function(){return!!this.c&&0==this.c[0]},S.minus=function(t,r){var i,a,u,c,l=this,p=l.s;if(r=(t=new BigNumber(t,r)).s,!p||!r)return new BigNumber(NaN);if(p!=r)return t.s=-r,l.plus(t);var d=l.e/14,y=t.e/14,h=l.c,v=t.c;if(!d||!y){if(!h||!v)return h?(t.s=-r,t):new BigNumber(v?l:NaN);if(!h[0]||!v[0])return v[0]?(t.s=-r,t):new BigNumber(h[0]?l:3==k?-0:0)}if(d=bitFloor(d),y=bitFloor(y),h=h.slice(),p=d-y){for((c=p<0)?(p=-p,u=h):(y=d,u=v),u.reverse(),r=p;r--;u.push(0));u.reverse()}else for(a=(c=(p=h.length)<(r=v.length))?p:r,p=r=0;r<a;r++)if(h[r]!=v[r]){c=h[r]<v[r];break}if(c&&(u=h,h=v,v=u,t.s=-t.s),(r=(a=v.length)-(i=h.length))>0)for(;r--;h[i++]=0);for(r=g-1;a>p;){if(h[--a]<v[a]){for(i=a;i&&!h[--i];h[i]=r);--h[i],h[a]+=g}h[a]-=v[a]}for(;0==h[0];h.splice(0,1),--y);return h[0]?normalise(t,h,y):(t.s=3==k?-1:1,t.c=[t.e=0],t)},S.modulo=S.mod=function(t,i){var a,u,c=this;return t=new BigNumber(t,i),!c.c||!t.s||t.c&&!t.c[0]?new BigNumber(NaN):!t.c||c.c&&!c.c[0]?new BigNumber(c):(9==B?(u=t.s,t.s=1,a=r(c,t,0,3),t.s=u,a.s*=u):a=r(c,t,0,B),(t=c.minus(a.times(t))).c[0]||1!=B||(t.s=c.s),t)},S.multipliedBy=S.times=function(t,r){var i,a,u,c,l,p,d,y,h,v,m,b,_,w,x=this,S=x.c,O=(t=new BigNumber(t,r)).c;if(!(S&&O&&S[0]&&O[0]))return!x.s||!t.s||S&&!S[0]&&!O||O&&!O[0]&&!S?t.c=t.e=t.s=null:(t.s*=x.s,S&&O?(t.c=[0],t.e=0):t.c=t.e=null),t;for(a=bitFloor(x.e/14)+bitFloor(t.e/14),t.s*=x.s,(d=S.length)<(v=O.length)&&(_=S,S=O,O=_,u=d,d=v,v=u),u=d+v,_=[];u--;_.push(0));for(w=g,1e7,u=v;--u>=0;){for(i=0,m=O[u]%1e7,b=O[u]/1e7|0,c=u+(l=d);c>u;)i=((y=m*(y=S[--l]%1e7)+(p=b*y+(h=S[l]/1e7|0)*m)%1e7*1e7+_[c]+i)/w|0)+(p/1e7|0)+b*h,_[c--]=y%w;_[c]=i}return i?++a:_.splice(0,1),normalise(t,_,a)},S.negated=function(){var t=new BigNumber(this);return t.s=-t.s||null,t},S.plus=function(t,r){var i,a=this,u=a.s;if(r=(t=new BigNumber(t,r)).s,!u||!r)return new BigNumber(NaN);if(u!=r)return t.s=-r,a.minus(t);var c=a.e/14,l=t.e/14,p=a.c,d=t.c;if(!c||!l){if(!p||!d)return new BigNumber(u/0);if(!p[0]||!d[0])return d[0]?t:new BigNumber(p[0]?a:0*u)}if(c=bitFloor(c),l=bitFloor(l),p=p.slice(),u=c-l){for(u>0?(l=c,i=d):(u=-u,i=p),i.reverse();u--;i.push(0));i.reverse()}for((u=p.length)-(r=d.length)<0&&(i=d,d=p,p=i,r=u),u=0;r;)u=(p[--r]=p[r]+d[r]+u)/g|0,p[r]=g===p[r]?0:p[r]%g;return u&&(p=[u].concat(p),++l),normalise(t,p,l)},S.precision=S.sd=function(t,r){var i,a,u,c=this;if(null!=t&&t!==!!t)return intCheck(t,1,m),null==r?r=k:intCheck(r,0,8),round(new BigNumber(c),t,r);if(!(i=c.c))return null;if(a=14*(u=i.length-1)+1,u=i[u]){for(;u%10==0;u/=10,a--);for(u=i[0];u>=10;u/=10,a++);}return t&&c.e+1>a&&(a=c.e+1),a},S.shiftedBy=function(t){return intCheck(t,-9007199254740991,9007199254740991),this.times("1e"+t)},S.squareRoot=S.sqrt=function(){var t,i,a,u,c,l=this,p=l.c,d=l.s,y=l.e,h=E+4,g=new BigNumber("0.5");if(1!==d||!p||!p[0])return new BigNumber(!d||d<0&&(!p||p[0])?NaN:p?l:1/0);if(0==(d=Math.sqrt(+l))||d==1/0?(((i=coeffToString(p)).length+y)%2==0&&(i+="0"),d=Math.sqrt(i),y=bitFloor((y+1)/2)-(y<0||y%2),a=new BigNumber(i=d==1/0?"1e"+y:(i=d.toExponential()).slice(0,i.indexOf("e")+1)+y)):a=new BigNumber(d+""),a.c[0])for((d=(y=a.e)+h)<3&&(d=0);;)if(c=a,a=g.times(c.plus(r(l,c,h,1))),coeffToString(c.c).slice(0,d)===(i=coeffToString(a.c)).slice(0,d)){if(a.e<y&&--d,"9999"!=(i=i.slice(d-3,d+1))&&(u||"4999"!=i)){+i&&(+i.slice(1)||"5"!=i.charAt(0))||(round(a,a.e+E+2,1),t=!a.times(a).eq(l));break}if(!u&&(round(c,c.e+E+2,0),c.times(c).eq(l))){a=c;break}h+=4,d+=4,u=1}return round(a,a.e+E+1,k,t)},S.toExponential=function(t,r){return null!=t&&(intCheck(t,0,m),t++),format(this,t,r,1)},S.toFixed=function(t,r){return null!=t&&(intCheck(t,0,m),t=t+this.e+1),format(this,t,r)},S.toFormat=function(t,r){var i=this.toFixed(t,r);if(this.c){var a,u=i.split("."),c=+R.groupSize,l=+R.secondaryGroupSize,p=R.groupSeparator,d=u[0],y=u[1],h=this.s<0,g=h?d.slice(1):d,v=g.length;if(l&&(a=c,c=l,l=a,v-=a),c>0&&v>0){for(a=v%c||c,d=g.substr(0,a);a<v;a+=c)d+=p+g.substr(a,c);l>0&&(d+=p+g.slice(a)),h&&(d="-"+d)}i=y?d+R.decimalSeparator+((l=+R.fractionGroupSize)?y.replace(new RegExp("\\d{"+l+"}\\B","g"),"$&"+R.fractionGroupSeparator):y):d}return i},S.toFraction=function(t){var i,a,u,c,l,p,d,h,g,m,b,_,w=this,x=w.c;if(null!=t&&(!(h=new BigNumber(t)).isInteger()&&(h.c||1!==h.s)||h.lt(O)))throw Error(y+"Argument "+(h.isInteger()?"out of range: ":"not an integer: ")+t);if(!x)return w.toString();for(a=new BigNumber(O),m=u=new BigNumber(O),c=g=new BigNumber(O),_=coeffToString(x),p=a.e=_.length-w.e-1,a.c[0]=v[(d=p%14)<0?14+d:d],t=!t||h.comparedTo(a)>0?p>0?a:m:h,d=P,P=1/0,h=new BigNumber(_),g.c[0]=0;b=r(h,a,0,1),1!=(l=u.plus(b.times(c))).comparedTo(t);)u=c,c=l,m=g.plus(b.times(l=m)),g=l,a=h.minus(b.times(l=a)),h=l;return l=r(t.minus(u),c,0,1),g=g.plus(l.times(m)),u=u.plus(l.times(c)),g.s=m.s=w.s,i=r(m,c,p*=2,k).minus(w).abs().comparedTo(r(g,u,p,k).minus(w).abs())<1?[m.toString(),c.toString()]:[g.toString(),u.toString()],P=d,i},S.toNumber=function(){return+this},S.toPrecision=function(t,r){return null!=t&&intCheck(t,1,m),format(this,t,r,2)},S.toString=function(t){var r,a=this,u=a.s,c=a.e;return null===c?u?(r="Infinity",u<0&&(r="-"+r)):r="NaN":(r=coeffToString(a.c),null==t?r=c<=A||c>=N?toExponential(r,c):toFixedPoint(r,c,"0"):(intCheck(t,2,j.length,"Base"),r=i(toFixedPoint(r,c,"0"),10,t,u,!0)),u<0&&a.c[0]&&(r="-"+r)),r},S.valueOf=S.toJSON=function(){var t,r=this,i=r.e;return null===i?r.toString():(t=coeffToString(r.c),t=i<=A||i>=N?toExponential(t,i):toFixedPoint(t,i,"0"),r.s<0?"-"+t:t)},S._isBigNumber=!0,null!=t&&BigNumber.set(t),BigNumber}()).default=c.BigNumber=c,void 0===(a=function(){return c}.call(r,i,r,t))||(t.exports=a)}()},function(t){t.exports=JSON.parse('{"chief":{"inception_block":{"mainnet":"0x487813","kovan":"0x649575"},"events":{"etch":"0x4f0892983790f53eea39a7a496f6cb40e8811b313871337b6a761efc6c67bb1f","vote_slate":"0xa69beaba00000000000000000000000000000000000000000000000000000000","vote_addresses":"0xed08132900000000000000000000000000000000000000000000000000000000","lock":"0xdd46706400000000000000000000000000000000000000000000000000000000","free":"0xd8ccd0f300000000000000000000000000000000000000000000000000000000"}},"pause":{"inception_block":{"mainnet":"8928171","kovan":"14764552"},"events":{"exec":"0x168ccd6700000000000000000000000000000000000000000000000000000000","plot":"0x46d2fbbb00000000000000000000000000000000000000000000000000000000"}},"proxy_factory":{"initiate_link_gas":45840,"approve_link_gas":886503,"send_mkr_gas":46471,"total_link_gas":1123568}}')},function(t,r,i){(function(r){var a=i(257);function compare(t,r){if(t===r)return 0;for(var i=t.length,a=r.length,u=0,c=Math.min(i,a);u<c;++u)if(t[u]!==r[u]){i=t[u],a=r[u];break}return i<a?-1:a<i?1:0}function isBuffer(t){return r.Buffer&&"function"==typeof r.Buffer.isBuffer?r.Buffer.isBuffer(t):!(null==t||!t._isBuffer)}var u=i(258),c=Object.prototype.hasOwnProperty,l=Array.prototype.slice,p="foo"===function foo(){}.name;function pToString(t){return Object.prototype.toString.call(t)}function isView(t){return!isBuffer(t)&&("function"==typeof r.ArrayBuffer&&("function"==typeof ArrayBuffer.isView?ArrayBuffer.isView(t):!!t&&(t instanceof DataView||!!(t.buffer&&t.buffer instanceof ArrayBuffer))))}var d=t.exports=ok,y=/\s*function\s+([^\(\s]*)\s*/;function getName(t){if(u.isFunction(t)){if(p)return t.name;var r=t.toString().match(y);return r&&r[1]}}function truncate(t,r){return"string"==typeof t?t.length<r?t:t.slice(0,r):t}function inspect(t){if(p||!u.isFunction(t))return u.inspect(t);var r=getName(t);return"[Function"+(r?": "+r:"")+"]"}function fail(t,r,i,a,u){throw new d.AssertionError({message:i,actual:t,expected:r,operator:a,stackStartFunction:u})}function ok(t,r){t||fail(t,!0,r,"==",d.ok)}function _deepEqual(t,r,i,a){if(t===r)return!0;if(isBuffer(t)&&isBuffer(r))return 0===compare(t,r);if(u.isDate(t)&&u.isDate(r))return t.getTime()===r.getTime();if(u.isRegExp(t)&&u.isRegExp(r))return t.source===r.source&&t.global===r.global&&t.multiline===r.multiline&&t.lastIndex===r.lastIndex&&t.ignoreCase===r.ignoreCase;if(null!==t&&"object"==typeof t||null!==r&&"object"==typeof r){if(isView(t)&&isView(r)&&pToString(t)===pToString(r)&&!(t instanceof Float32Array||t instanceof Float64Array))return 0===compare(new Uint8Array(t.buffer),new Uint8Array(r.buffer));if(isBuffer(t)!==isBuffer(r))return!1;var c=(a=a||{actual:[],expected:[]}).actual.indexOf(t);return-1!==c&&c===a.expected.indexOf(r)||(a.actual.push(t),a.expected.push(r),function objEquiv(t,r,i,a){if(null==t||null==r)return!1;if(u.isPrimitive(t)||u.isPrimitive(r))return t===r;if(i&&Object.getPrototypeOf(t)!==Object.getPrototypeOf(r))return!1;var c=isArguments(t),p=isArguments(r);if(c&&!p||!c&&p)return!1;if(c)return t=l.call(t),r=l.call(r),_deepEqual(t,r,i);var d,y,g=h(t),v=h(r);if(g.length!==v.length)return!1;for(g.sort(),v.sort(),y=g.length-1;y>=0;y--)if(g[y]!==v[y])return!1;for(y=g.length-1;y>=0;y--)if(d=g[y],!_deepEqual(t[d],r[d],i,a))return!1;return!0}(t,r,i,a))}return i?t===r:t==r}function isArguments(t){return"[object Arguments]"==Object.prototype.toString.call(t)}function expectedException(t,r){if(!t||!r)return!1;if("[object RegExp]"==Object.prototype.toString.call(r))return r.test(t);try{if(t instanceof r)return!0}catch(t){}return!Error.isPrototypeOf(r)&&!0===r.call({},t)}function _throws(t,r,i,a){var c;if("function"!=typeof r)throw new TypeError('"block" argument must be a function');"string"==typeof i&&(a=i,i=null),c=function _tryBlock(t){var r;try{t()}catch(t){r=t}return r}(r),a=(i&&i.name?" ("+i.name+").":".")+(a?" "+a:"."),t&&!c&&fail(c,i,"Missing expected exception"+a);var l="string"==typeof a,p=!t&&c&&!i;if((!t&&u.isError(c)&&l&&expectedException(c,i)||p)&&fail(c,i,"Got unwanted exception"+a),t&&c&&i&&!expectedException(c,i)||!t&&c)throw c}d.AssertionError=function AssertionError(t){this.name="AssertionError",this.actual=t.actual,this.expected=t.expected,this.operator=t.operator,t.message?(this.message=t.message,this.generatedMessage=!1):(this.message=function getMessage(t){return truncate(inspect(t.actual),128)+" "+t.operator+" "+truncate(inspect(t.expected),128)}(this),this.generatedMessage=!0);var r=t.stackStartFunction||fail;if(Error.captureStackTrace)Error.captureStackTrace(this,r);else{var i=new Error;if(i.stack){var a=i.stack,u=getName(r),c=a.indexOf("\n"+u);if(c>=0){var l=a.indexOf("\n",c+1);a=a.substring(l+1)}this.stack=a}}},u.inherits(d.AssertionError,Error),d.fail=fail,d.ok=ok,d.equal=function equal(t,r,i){t!=r&&fail(t,r,i,"==",d.equal)},d.notEqual=function notEqual(t,r,i){t==r&&fail(t,r,i,"!=",d.notEqual)},d.deepEqual=function deepEqual(t,r,i){_deepEqual(t,r,!1)||fail(t,r,i,"deepEqual",d.deepEqual)},d.deepStrictEqual=function deepStrictEqual(t,r,i){_deepEqual(t,r,!0)||fail(t,r,i,"deepStrictEqual",d.deepStrictEqual)},d.notDeepEqual=function notDeepEqual(t,r,i){_deepEqual(t,r,!1)&&fail(t,r,i,"notDeepEqual",d.notDeepEqual)},d.notDeepStrictEqual=function notDeepStrictEqual(t,r,i){_deepEqual(t,r,!0)&&fail(t,r,i,"notDeepStrictEqual",notDeepStrictEqual)},d.strictEqual=function strictEqual(t,r,i){t!==r&&fail(t,r,i,"===",d.strictEqual)},d.notStrictEqual=function notStrictEqual(t,r,i){t===r&&fail(t,r,i,"!==",d.notStrictEqual)},d.throws=function(t,r,i){_throws(!0,t,r,i)},d.doesNotThrow=function(t,r,i){_throws(!1,t,r,i)},d.ifError=function(t){if(t)throw t},d.strict=a((function strict(t,r){t||fail(t,!0,r,"==",strict)}),d,{equal:d.strictEqual,deepEqual:d.deepStrictEqual,notEqual:d.notStrictEqual,notDeepEqual:d.notDeepStrictEqual}),d.strict.strict=d.strict;var h=Object.keys||function(t){var r=[];for(var i in t)c.call(t,i)&&r.push(i);return r}}).call(this,i(62))},function(t,r,i){var a=i(267);t.exports=function toInteger(t){var r=a(t),i=r%1;return r==r?i?r-i:r:0}},function(t,r,i){var a=i(37),u=i(40);t.exports=function isSymbol(t){return"symbol"==typeof t||u(t)&&"[object Symbol]"==a(t)}},function(t,r,i){var a=i(61),u=i(96),c=i(98),l=i(105),p=a?a.prototype:void 0,d=p?p.toString:void 0;t.exports=function baseToString(t){if("string"==typeof t)return t;if(c(t))return u(t,baseToString)+"";if(l(t))return d?d.call(t):"";var r=t+"";return"0"==r&&1/t==-1/0?"-0":r}},function(t,r,i){var a=i(276),u=i(65),c=i(278);t.exports=function stringSize(t){return u(t)?c(t):a(t)}},function(t,r,i){function _isPlaceholder(t){return null!=t&&"object"==typeof t&&!0===t["@@functional/placeholder"]}function _curry1(t){return function f1(r){return 0===arguments.length||_isPlaceholder(r)?f1:t.apply(this,arguments)}}i.r(r),i.d(r,"F",(function(){return u})),i.d(r,"T",(function(){return c})),i.d(r,"__",(function(){return l})),i.d(r,"add",(function(){return p})),i.d(r,"addIndex",(function(){return y})),i.d(r,"adjust",(function(){return h})),i.d(r,"all",(function(){return b})),i.d(r,"allPass",(function(){return L})),i.d(r,"always",(function(){return a})),i.d(r,"and",(function(){return U})),i.d(r,"any",(function(){return G})),i.d(r,"anyPass",(function(){return V})),i.d(r,"ap",(function(){return z})),i.d(r,"aperture",(function(){return H})),i.d(r,"append",(function(){return Y})),i.d(r,"apply",(function(){return $})),i.d(r,"applySpec",(function(){return Q})),i.d(r,"applyTo",(function(){return J})),i.d(r,"ascend",(function(){return Z})),i.d(r,"assoc",(function(){return ee})),i.d(r,"assocPath",(function(){return ne})),i.d(r,"binary",(function(){return oe})),i.d(r,"bind",(function(){return S})),i.d(r,"both",(function(){return ce})),i.d(r,"call",(function(){return fe})),i.d(r,"chain",(function(){return pe})),i.d(r,"clamp",(function(){return de})),i.d(r,"clone",(function(){return he})),i.d(r,"comparator",(function(){return ge})),i.d(r,"complement",(function(){return me})),i.d(r,"compose",(function(){return compose})),i.d(r,"composeK",(function(){return composeK})),i.d(r,"composeP",(function(){return composeP})),i.d(r,"concat",(function(){return Pe})),i.d(r,"cond",(function(){return Ce})),i.d(r,"construct",(function(){return Ie})),i.d(r,"constructN",(function(){return Be})),i.d(r,"contains",(function(){return Re})),i.d(r,"converge",(function(){return je})),i.d(r,"countBy",(function(){return Le})),i.d(r,"curry",(function(){return se})),i.d(r,"curryN",(function(){return d})),i.d(r,"dec",(function(){return Fe})),i.d(r,"defaultTo",(function(){return Ue})),i.d(r,"descend",(function(){return qe})),i.d(r,"difference",(function(){return We})),i.d(r,"differenceWith",(function(){return Ge})),i.d(r,"dissoc",(function(){return Ve})),i.d(r,"dissocPath",(function(){return He})),i.d(r,"divide",(function(){return Ye})),i.d(r,"drop",(function(){return Ke})),i.d(r,"dropLast",(function(){return et})),i.d(r,"dropLastWhile",(function(){return rt})),i.d(r,"dropRepeats",(function(){return ct})),i.d(r,"dropRepeatsWith",(function(){return ut})),i.d(r,"dropWhile",(function(){return ft})),i.d(r,"either",(function(){return dt})),i.d(r,"empty",(function(){return yt})),i.d(r,"endsWith",(function(){return vt})),i.d(r,"eqBy",(function(){return mt})),i.d(r,"eqProps",(function(){return bt})),i.d(r,"equals",(function(){return Se})),i.d(r,"evolve",(function(){return _t})),i.d(r,"filter",(function(){return Ae})),i.d(r,"find",(function(){return xt})),i.d(r,"findIndex",(function(){return Ot})),i.d(r,"findLast",(function(){return kt})),i.d(r,"findLastIndex",(function(){return Nt})),i.d(r,"flatten",(function(){return Tt})),i.d(r,"flip",(function(){return Pt})),i.d(r,"forEach",(function(){return Ct})),i.d(r,"forEachObjIndexed",(function(){return Bt})),i.d(r,"fromPairs",(function(){return It})),i.d(r,"groupBy",(function(){return Rt})),i.d(r,"groupWith",(function(){return jt})),i.d(r,"gt",(function(){return Mt})),i.d(r,"gte",(function(){return Dt})),i.d(r,"has",(function(){return Lt})),i.d(r,"hasIn",(function(){return Ft})),i.d(r,"head",(function(){return Ut})),i.d(r,"identical",(function(){return xe})),i.d(r,"identity",(function(){return qt})),i.d(r,"ifElse",(function(){return Wt})),i.d(r,"inc",(function(){return Gt})),i.d(r,"indexBy",(function(){return Vt})),i.d(r,"indexOf",(function(){return zt})),i.d(r,"init",(function(){return Xt})),i.d(r,"innerJoin",(function(){return Ht})),i.d(r,"insert",(function(){return Yt})),i.d(r,"insertAll",(function(){return $t})),i.d(r,"intersection",(function(){return Zt})),i.d(r,"intersperse",(function(){return er})),i.d(r,"into",(function(){return ur})),i.d(r,"invert",(function(){return cr})),i.d(r,"invertObj",(function(){return sr})),i.d(r,"invoker",(function(){return fr})),i.d(r,"is",(function(){return lr})),i.d(r,"isEmpty",(function(){return pr})),i.d(r,"isNil",(function(){return re})),i.d(r,"join",(function(){return dr})),i.d(r,"juxt",(function(){return yr})),i.d(r,"keys",(function(){return B})),i.d(r,"keysIn",(function(){return hr})),i.d(r,"last",(function(){return at})),i.d(r,"lastIndexOf",(function(){return gr})),i.d(r,"length",(function(){return vr})),i.d(r,"lens",(function(){return mr})),i.d(r,"lensIndex",(function(){return br})),i.d(r,"lensPath",(function(){return _r})),i.d(r,"lensProp",(function(){return wr})),i.d(r,"lift",(function(){return ue})),i.d(r,"liftN",(function(){return ae})),i.d(r,"lt",(function(){return xr})),i.d(r,"lte",(function(){return Sr})),i.d(r,"map",(function(){return I})),i.d(r,"mapAccum",(function(){return Or})),i.d(r,"mapAccumRight",(function(){return Er})),i.d(r,"mapObjIndexed",(function(){return kr})),i.d(r,"match",(function(){return Ar})),i.d(r,"mathMod",(function(){return Nr})),i.d(r,"max",(function(){return _})),i.d(r,"maxBy",(function(){return Tr})),i.d(r,"mean",(function(){return Cr})),i.d(r,"median",(function(){return Br})),i.d(r,"memoize",(function(){return Rr})),i.d(r,"memoizeWith",(function(){return Ir})),i.d(r,"merge",(function(){return jr})),i.d(r,"mergeAll",(function(){return Mr})),i.d(r,"mergeDeepLeft",(function(){return Fr})),i.d(r,"mergeDeepRight",(function(){return Ur})),i.d(r,"mergeDeepWith",(function(){return qr})),i.d(r,"mergeDeepWithKey",(function(){return Lr})),i.d(r,"mergeWith",(function(){return Wr})),i.d(r,"mergeWithKey",(function(){return Dr})),i.d(r,"min",(function(){return Gr})),i.d(r,"minBy",(function(){return Vr})),i.d(r,"modulo",(function(){return zr})),i.d(r,"multiply",(function(){return Xr})),i.d(r,"nAry",(function(){return ie})),i.d(r,"negate",(function(){return Hr})),i.d(r,"none",(function(){return Yr})),i.d(r,"not",(function(){return ve})),i.d(r,"nth",(function(){return ot})),i.d(r,"nthArg",(function(){return $r})),i.d(r,"o",(function(){return Kr})),i.d(r,"objOf",(function(){return rr})),i.d(r,"of",(function(){return Qr})),i.d(r,"omit",(function(){return Jr})),i.d(r,"once",(function(){return Zr})),i.d(r,"or",(function(){return pt})),i.d(r,"over",(function(){return en})),i.d(r,"pair",(function(){return tn})),i.d(r,"partial",(function(){return rn})),i.d(r,"partialRight",(function(){return nn})),i.d(r,"partition",(function(){return on})),i.d(r,"path",(function(){return R})),i.d(r,"pathEq",(function(){return an})),i.d(r,"pathOr",(function(){return un})),i.d(r,"pathSatisfies",(function(){return cn})),i.d(r,"pick",(function(){return sn})),i.d(r,"pickAll",(function(){return ln})),i.d(r,"pickBy",(function(){return pn})),i.d(r,"pipe",(function(){return pipe})),i.d(r,"pipeK",(function(){return pipeK})),i.d(r,"pipeP",(function(){return pipeP})),i.d(r,"pluck",(function(){return M})),i.d(r,"prepend",(function(){return dn})),i.d(r,"product",(function(){return yn})),i.d(r,"project",(function(){return gn})),i.d(r,"prop",(function(){return j})),i.d(r,"propEq",(function(){return vn})),i.d(r,"propIs",(function(){return mn})),i.d(r,"propOr",(function(){return bn})),i.d(r,"propSatisfies",(function(){return _n})),i.d(r,"props",(function(){return wn})),i.d(r,"range",(function(){return xn})),i.d(r,"reduce",(function(){return D})),i.d(r,"reduceBy",(function(){return De})),i.d(r,"reduceRight",(function(){return Sn})),i.d(r,"reduceWhile",(function(){return On})),i.d(r,"reduced",(function(){return En})),i.d(r,"reject",(function(){return Ne})),i.d(r,"remove",(function(){return ze})),i.d(r,"repeat",(function(){return An})),i.d(r,"replace",(function(){return Nn})),i.d(r,"reverse",(function(){return we})),i.d(r,"scan",(function(){return Tn})),i.d(r,"sequence",(function(){return Pn})),i.d(r,"set",(function(){return Cn})),i.d(r,"slice",(function(){return be})),i.d(r,"sort",(function(){return Bn})),i.d(r,"sortBy",(function(){return In})),i.d(r,"sortWith",(function(){return Rn})),i.d(r,"split",(function(){return jn})),i.d(r,"splitAt",(function(){return Mn})),i.d(r,"splitEvery",(function(){return Dn})),i.d(r,"splitWhen",(function(){return Ln})),i.d(r,"startsWith",(function(){return Fn})),i.d(r,"subtract",(function(){return Un})),i.d(r,"sum",(function(){return Pr})),i.d(r,"symmetricDifference",(function(){return qn})),i.d(r,"symmetricDifferenceWith",(function(){return Wn})),i.d(r,"tail",(function(){return _e})),i.d(r,"take",(function(){return Je})),i.d(r,"takeLast",(function(){return ht})),i.d(r,"takeLastWhile",(function(){return Gn})),i.d(r,"takeWhile",(function(){return zn})),i.d(r,"tap",(function(){return Hn})),i.d(r,"test",(function(){return Yn})),i.d(r,"times",(function(){return kn})),i.d(r,"toLower",(function(){return $n})),i.d(r,"toPairs",(function(){return Kn})),i.d(r,"toPairsIn",(function(){return Qn})),i.d(r,"toString",(function(){return Te})),i.d(r,"toUpper",(function(){return Jn})),i.d(r,"transduce",(function(){return Zn})),i.d(r,"transpose",(function(){return ei})),i.d(r,"traverse",(function(){return ti})),i.d(r,"trim",(function(){return ni})),i.d(r,"tryCatch",(function(){return ii})),i.d(r,"type",(function(){return ye})),i.d(r,"unapply",(function(){return oi})),i.d(r,"unary",(function(){return ai})),i.d(r,"uncurryN",(function(){return ui})),i.d(r,"unfold",(function(){return ci})),i.d(r,"union",(function(){return si})),i.d(r,"unionWith",(function(){return li})),i.d(r,"uniq",(function(){return Jt})),i.d(r,"uniqBy",(function(){return Qt})),i.d(r,"uniqWith",(function(){return fi})),i.d(r,"unless",(function(){return pi})),i.d(r,"unnest",(function(){return di})),i.d(r,"until",(function(){return yi})),i.d(r,"update",(function(){return Xe})),i.d(r,"useWith",(function(){return hn})),i.d(r,"values",(function(){return K})),i.d(r,"valuesIn",(function(){return hi})),i.d(r,"view",(function(){return gi})),i.d(r,"when",(function(){return vi})),i.d(r,"where",(function(){return mi})),i.d(r,"whereEq",(function(){return bi})),i.d(r,"without",(function(){return _i})),i.d(r,"xprod",(function(){return wi})),i.d(r,"zip",(function(){return xi})),i.d(r,"zipObj",(function(){return Si})),i.d(r,"zipWith",(function(){return Oi}));var a=_curry1((function always(t){return function(){return t}})),u=a(!1),c=a(!0),l={"@@functional/placeholder":!0};function _curry2(t){return function f2(r,i){switch(arguments.length){case 0:return f2;case 1:return _isPlaceholder(r)?f2:_curry1((function(i){return t(r,i)}));default:return _isPlaceholder(r)&&_isPlaceholder(i)?f2:_isPlaceholder(r)?_curry1((function(r){return t(r,i)})):_isPlaceholder(i)?_curry1((function(i){return t(r,i)})):t(r,i)}}}var p=_curry2((function add(t,r){return Number(t)+Number(r)}));function _concat(t,r){var i;r=r||[];var a=(t=t||[]).length,u=r.length,c=[];for(i=0;i<a;)c[c.length]=t[i],i+=1;for(i=0;i<u;)c[c.length]=r[i],i+=1;return c}function _arity(t,r){switch(t){case 0:return function(){return r.apply(this,arguments)};case 1:return function(t){return r.apply(this,arguments)};case 2:return function(t,i){return r.apply(this,arguments)};case 3:return function(t,i,a){return r.apply(this,arguments)};case 4:return function(t,i,a,u){return r.apply(this,arguments)};case 5:return function(t,i,a,u,c){return r.apply(this,arguments)};case 6:return function(t,i,a,u,c,l){return r.apply(this,arguments)};case 7:return function(t,i,a,u,c,l,p){return r.apply(this,arguments)};case 8:return function(t,i,a,u,c,l,p,d){return r.apply(this,arguments)};case 9:return function(t,i,a,u,c,l,p,d,y){return r.apply(this,arguments)};case 10:return function(t,i,a,u,c,l,p,d,y,h){return r.apply(this,arguments)};default:throw new Error("First argument to _arity must be a non-negative integer no greater than ten")}}function _curryN(t,r,i){return function(){for(var a=[],u=0,c=t,l=0;l<r.length||u<arguments.length;){var p;l<r.length&&(!_isPlaceholder(r[l])||u>=arguments.length)?p=r[l]:(p=arguments[u],u+=1),a[l]=p,_isPlaceholder(p)||(c-=1),l+=1}return c<=0?i.apply(this,a):_arity(c,_curryN(t,a,i))}}var d=_curry2((function curryN(t,r){return 1===t?_curry1(r):_arity(t,_curryN(t,[],r))})),y=_curry1((function addIndex(t){return d(t.length,(function(){var r=0,i=arguments[0],a=arguments[arguments.length-1],u=Array.prototype.slice.call(arguments,0);return u[0]=function(){var t=i.apply(this,_concat(arguments,[r,a]));return r+=1,t},t.apply(this,u)}))}));function _curry3(t){return function f3(r,i,a){switch(arguments.length){case 0:return f3;case 1:return _isPlaceholder(r)?f3:_curry2((function(i,a){return t(r,i,a)}));case 2:return _isPlaceholder(r)&&_isPlaceholder(i)?f3:_isPlaceholder(r)?_curry2((function(r,a){return t(r,i,a)})):_isPlaceholder(i)?_curry2((function(i,a){return t(r,i,a)})):_curry1((function(a){return t(r,i,a)}));default:return _isPlaceholder(r)&&_isPlaceholder(i)&&_isPlaceholder(a)?f3:_isPlaceholder(r)&&_isPlaceholder(i)?_curry2((function(r,i){return t(r,i,a)})):_isPlaceholder(r)&&_isPlaceholder(a)?_curry2((function(r,a){return t(r,i,a)})):_isPlaceholder(i)&&_isPlaceholder(a)?_curry2((function(i,a){return t(r,i,a)})):_isPlaceholder(r)?_curry1((function(r){return t(r,i,a)})):_isPlaceholder(i)?_curry1((function(i){return t(r,i,a)})):_isPlaceholder(a)?_curry1((function(a){return t(r,i,a)})):t(r,i,a)}}}var h=_curry3((function adjust(t,r,i){if(r>=i.length||r<-i.length)return i;var a=(r<0?i.length:0)+r,u=_concat(i);return u[a]=t(i[a]),u})),g=Array.isArray||function _isArray(t){return null!=t&&t.length>=0&&"[object Array]"===Object.prototype.toString.call(t)};function _isTransformer(t){return"function"==typeof t["@@transducer/step"]}function _dispatchable(t,r,i){return function(){if(0===arguments.length)return i();var a=Array.prototype.slice.call(arguments,0),u=a.pop();if(!g(u)){for(var c=0;c<t.length;){if("function"==typeof u[t[c]])return u[t[c]].apply(u,a);c+=1}if(_isTransformer(u)){var l=r.apply(null,a);return l(u)}}return i.apply(this,arguments)}}function _reduced(t){return t&&t["@@transducer/reduced"]?t:{"@@transducer/value":t,"@@transducer/reduced":!0}}var v={init:function(){return this.xf["@@transducer/init"]()},result:function(t){return this.xf["@@transducer/result"](t)}},m=function(){function XAll(t,r){this.xf=r,this.f=t,this.all=!0}return XAll.prototype["@@transducer/init"]=v.init,XAll.prototype["@@transducer/result"]=function(t){return this.all&&(t=this.xf["@@transducer/step"](t,!0)),this.xf["@@transducer/result"](t)},XAll.prototype["@@transducer/step"]=function(t,r){return this.f(r)||(this.all=!1,t=_reduced(this.xf["@@transducer/step"](t,!1))),t},XAll}(),b=_curry2(_dispatchable(["all"],_curry2((function _xall(t,r){return new m(t,r)})),(function all(t,r){for(var i=0;i<r.length;){if(!t(r[i]))return!1;i+=1}return!0}))),_=_curry2((function max(t,r){return r>t?r:t}));function _map(t,r){for(var i=0,a=r.length,u=Array(a);i<a;)u[i]=t(r[i]),i+=1;return u}function _isString(t){return"[object String]"===Object.prototype.toString.call(t)}var w=_curry1((function isArrayLike(t){return!!g(t)||!!t&&("object"==typeof t&&(!_isString(t)&&(1===t.nodeType?!!t.length:0===t.length||t.length>0&&(t.hasOwnProperty(0)&&t.hasOwnProperty(t.length-1)))))})),x=function(){function XWrap(t){this.f=t}return XWrap.prototype["@@transducer/init"]=function(){throw new Error("init not implemented on XWrap")},XWrap.prototype["@@transducer/result"]=function(t){return t},XWrap.prototype["@@transducer/step"]=function(t,r){return this.f(t,r)},XWrap}();function _xwrap(t){return new x(t)}var S=_curry2((function bind(t,r){return _arity(t.length,(function(){return t.apply(r,arguments)}))}));function _iterableReduce(t,r,i){for(var a=i.next();!a.done;){if((r=t["@@transducer/step"](r,a.value))&&r["@@transducer/reduced"]){r=r["@@transducer/value"];break}a=i.next()}return t["@@transducer/result"](r)}function _methodReduce(t,r,i,a){return t["@@transducer/result"](i[a](S(t["@@transducer/step"],t),r))}var O="undefined"!=typeof Symbol?Symbol.iterator:"@@iterator";function _reduce(t,r,i){if("function"==typeof t&&(t=_xwrap(t)),w(i))return function _arrayReduce(t,r,i){for(var a=0,u=i.length;a<u;){if((r=t["@@transducer/step"](r,i[a]))&&r["@@transducer/reduced"]){r=r["@@transducer/value"];break}a+=1}return t["@@transducer/result"](r)}(t,r,i);if("function"==typeof i["fantasy-land/reduce"])return _methodReduce(t,r,i,"fantasy-land/reduce");if(null!=i[O])return _iterableReduce(t,r,i[O]());if("function"==typeof i.next)return _iterableReduce(t,r,i);if("function"==typeof i.reduce)return _methodReduce(t,r,i,"reduce");throw new TypeError("reduce: list must be array or iterable")}var E=function(){function XMap(t,r){this.xf=r,this.f=t}return XMap.prototype["@@transducer/init"]=v.init,XMap.prototype["@@transducer/result"]=v.result,XMap.prototype["@@transducer/step"]=function(t,r){return this.xf["@@transducer/step"](t,this.f(r))},XMap}(),k=_curry2((function _xmap(t,r){return new E(t,r)}));function _has(t,r){return Object.prototype.hasOwnProperty.call(r,t)}var A=Object.prototype.toString,internal_isArguments=function(){return"[object Arguments]"===A.call(arguments)?function _isArguments(t){return"[object Arguments]"===A.call(t)}:function _isArguments(t){return _has("callee",t)}},N=!{toString:null}.propertyIsEnumerable("toString"),T=["constructor","valueOf","isPrototypeOf","toString","propertyIsEnumerable","hasOwnProperty","toLocaleString"],P=function(){return arguments.propertyIsEnumerable("length")}(),C=function contains(t,r){for(var i=0;i<t.length;){if(t[i]===r)return!0;i+=1}return!1},B=_curry1("function"!=typeof Object.keys||P?function keys(t){if(Object(t)!==t)return[];var r,i,a=[],u=P&&internal_isArguments(t);for(r in t)!_has(r,t)||u&&"length"===r||(a[a.length]=r);if(N)for(i=T.length-1;i>=0;)_has(r=T[i],t)&&!C(a,r)&&(a[a.length]=r),i-=1;return a}:function keys(t){return Object(t)!==t?[]:Object.keys(t)}),I=_curry2(_dispatchable(["fantasy-land/map","map"],k,(function map(t,r){switch(Object.prototype.toString.call(r)){case"[object Function]":return d(r.length,(function(){return t.call(this,r.apply(this,arguments))}));case"[object Object]":return _reduce((function(i,a){return i[a]=t(r[a]),i}),{},B(r));default:return _map(t,r)}}))),R=_curry2((function path(t,r){for(var i=r,a=0;a<t.length;){if(null==i)return;i=i[t[a]],a+=1}return i})),j=_curry2((function prop(t,r){return R([t],r)})),M=_curry2((function pluck(t,r){return I(j(t),r)})),D=_curry3(_reduce),L=_curry1((function allPass(t){return d(D(_,0,M("length",t)),(function(){for(var r=0,i=t.length;r<i;){if(!t[r].apply(this,arguments))return!1;r+=1}return!0}))})),U=_curry2((function and(t,r){return t&&r})),q=function(){function XAny(t,r){this.xf=r,this.f=t,this.any=!1}return XAny.prototype["@@transducer/init"]=v.init,XAny.prototype["@@transducer/result"]=function(t){return this.any||(t=this.xf["@@transducer/step"](t,!1)),this.xf["@@transducer/result"](t)},XAny.prototype["@@transducer/step"]=function(t,r){return this.f(r)&&(this.any=!0,t=_reduced(this.xf["@@transducer/step"](t,!0))),t},XAny}(),W=_curry2((function _xany(t,r){return new q(t,r)})),G=_curry2(_dispatchable(["any"],W,(function any(t,r){for(var i=0;i<r.length;){if(t(r[i]))return!0;i+=1}return!1}))),V=_curry1((function anyPass(t){return d(D(_,0,M("length",t)),(function(){for(var r=0,i=t.length;r<i;){if(t[r].apply(this,arguments))return!0;r+=1}return!1}))})),z=_curry2((function ap(t,r){return"function"==typeof r["fantasy-land/ap"]?r["fantasy-land/ap"](t):"function"==typeof t.ap?t.ap(r):"function"==typeof t?function(i){return t(i)(r(i))}:_reduce((function(t,i){return _concat(t,I(i,r))}),[],t)}));function _aperture(t,r){for(var i=0,a=r.length-(t-1),u=new Array(a>=0?a:0);i<a;)u[i]=Array.prototype.slice.call(r,i,i+t),i+=1;return u}var X=function(){function XAperture(t,r){this.xf=r,this.pos=0,this.full=!1,this.acc=new Array(t)}return XAperture.prototype["@@transducer/init"]=v.init,XAperture.prototype["@@transducer/result"]=function(t){return this.acc=null,this.xf["@@transducer/result"](t)},XAperture.prototype["@@transducer/step"]=function(t,r){return this.store(r),this.full?this.xf["@@transducer/step"](t,this.getCopy()):t},XAperture.prototype.store=function(t){this.acc[this.pos]=t,this.pos+=1,this.pos===this.acc.length&&(this.pos=0,this.full=!0)},XAperture.prototype.getCopy=function(){return _concat(Array.prototype.slice.call(this.acc,this.pos),Array.prototype.slice.call(this.acc,0,this.pos))},XAperture}(),H=_curry2(_dispatchable([],_curry2((function _xaperture(t,r){return new X(t,r)})),_aperture)),Y=_curry2((function append(t,r){return _concat(r,[t])})),$=_curry2((function apply(t,r){return t.apply(this,r)})),K=_curry1((function values(t){for(var r=B(t),i=r.length,a=[],u=0;u<i;)a[u]=t[r[u]],u+=1;return a})),Q=_curry1((function applySpec(t){return t=I((function(t){return"function"==typeof t?t:applySpec(t)}),t),d(D(_,0,M("length",K(t))),(function(){var r=arguments;return I((function(t){return $(t,r)}),t)}))})),J=_curry2((function applyTo(t,r){return r(t)})),Z=_curry3((function ascend(t,r,i){var a=t(r),u=t(i);return a<u?-1:a>u?1:0})),ee=_curry3((function assoc(t,r,i){var a={};for(var u in i)a[u]=i[u];return a[t]=r,a})),te=Number.isInteger||function _isInteger(t){return t<<0===t},re=_curry1((function isNil(t){return null==t})),ne=_curry3((function assocPath(t,r,i){if(0===t.length)return r;var a=t[0];if(t.length>1){var u=!re(i)&&_has(a,i)?i[a]:te(t[1])?[]:{};r=assocPath(Array.prototype.slice.call(t,1),r,u)}if(te(a)&&g(i)){var c=[].concat(i);return c[a]=r,c}return ee(a,r,i)})),ie=_curry2((function nAry(t,r){switch(t){case 0:return function(){return r.call(this)};case 1:return function(t){return r.call(this,t)};case 2:return function(t,i){return r.call(this,t,i)};case 3:return function(t,i,a){return r.call(this,t,i,a)};case 4:return function(t,i,a,u){return r.call(this,t,i,a,u)};case 5:return function(t,i,a,u,c){return r.call(this,t,i,a,u,c)};case 6:return function(t,i,a,u,c,l){return r.call(this,t,i,a,u,c,l)};case 7:return function(t,i,a,u,c,l,p){return r.call(this,t,i,a,u,c,l,p)};case 8:return function(t,i,a,u,c,l,p,d){return r.call(this,t,i,a,u,c,l,p,d)};case 9:return function(t,i,a,u,c,l,p,d,y){return r.call(this,t,i,a,u,c,l,p,d,y)};case 10:return function(t,i,a,u,c,l,p,d,y,h){return r.call(this,t,i,a,u,c,l,p,d,y,h)};default:throw new Error("First argument to nAry must be a non-negative integer no greater than ten")}})),oe=_curry1((function binary(t){return ie(2,t)}));function _isFunction(t){return"[object Function]"===Object.prototype.toString.call(t)}var ae=_curry2((function liftN(t,r){var i=d(t,r);return d(t,(function(){return _reduce(z,I(i,arguments[0]),Array.prototype.slice.call(arguments,1))}))})),ue=_curry1((function lift(t){return ae(t.length,t)})),ce=_curry2((function both(t,r){return _isFunction(t)?function _both(){return t.apply(this,arguments)&&r.apply(this,arguments)}:ue(U)(t,r)})),se=_curry1((function curry(t){return d(t.length,t)})),fe=se((function call(t){return t.apply(this,Array.prototype.slice.call(arguments,1))}));function _makeFlat(t){return function flatt(r){for(var i,a,u,c=[],l=0,p=r.length;l<p;){if(w(r[l]))for(u=0,a=(i=t?flatt(r[l]):r[l]).length;u<a;)c[c.length]=i[u],u+=1;else c[c.length]=r[l];l+=1}return c}}var le=function _xcat(t){var r=function(t){return{"@@transducer/init":v.init,"@@transducer/result":function(r){return t["@@transducer/result"](r)},"@@transducer/step":function(r,i){var a=t["@@transducer/step"](r,i);return a["@@transducer/reduced"]?function _forceReduced(t){return{"@@transducer/value":t,"@@transducer/reduced":!0}}(a):a}}}(t);return{"@@transducer/init":v.init,"@@transducer/result":function(t){return r["@@transducer/result"](t)},"@@transducer/step":function(t,i){return w(i)?_reduce(r,t,i):_reduce(r,t,[i])}}},pe=_curry2(_dispatchable(["fantasy-land/chain","chain"],_curry2((function _xchain(t,r){return I(t,le(r))})),(function chain(t,r){return"function"==typeof r?function(i){return t(r(i))(i)}:_makeFlat(!1)(I(t,r))}))),de=_curry3((function clamp(t,r,i){if(t>r)throw new Error("min must not be greater than max in clamp(min, max, value)");return i<t?t:i>r?r:i}));function _cloneRegExp(t){return new RegExp(t.source,(t.global?"g":"")+(t.ignoreCase?"i":"")+(t.multiline?"m":"")+(t.sticky?"y":"")+(t.unicode?"u":""))}var ye=_curry1((function type(t){return null===t?"Null":void 0===t?"Undefined":Object.prototype.toString.call(t).slice(8,-1)}));function _clone(t,r,i,a){var u=function copy(u){for(var c=r.length,l=0;l<c;){if(t===r[l])return i[l];l+=1}for(var p in r[l+1]=t,i[l+1]=u,t)u[p]=a?_clone(t[p],r,i,!0):t[p];return u};switch(ye(t)){case"Object":return u({});case"Array":return u([]);case"Date":return new Date(t.valueOf());case"RegExp":return _cloneRegExp(t);default:return t}}var he=_curry1((function clone(t){return null!=t&&"function"==typeof t.clone?t.clone():_clone(t,[],[],!0)})),ge=_curry1((function comparator(t){return function(r,i){return t(r,i)?-1:t(i,r)?1:0}})),ve=_curry1((function not(t){return!t})),me=ue(ve);function _pipe(t,r){return function(){return r.call(this,t.apply(this,arguments))}}function _checkForMethod(t,r){return function(){var i=arguments.length;if(0===i)return r();var a=arguments[i-1];return g(a)||"function"!=typeof a[t]?r.apply(this,arguments):a[t].apply(a,Array.prototype.slice.call(arguments,0,i-1))}}var be=_curry3(_checkForMethod("slice",(function slice(t,r,i){return Array.prototype.slice.call(i,t,r)}))),_e=_curry1(_checkForMethod("tail",be(1,1/0)));function pipe(){if(0===arguments.length)throw new Error("pipe requires at least one argument");return _arity(arguments[0].length,D(_pipe,arguments[0],_e(arguments)))}var we=_curry1((function reverse(t){return _isString(t)?t.split("").reverse().join(""):Array.prototype.slice.call(t,0).reverse()}));function compose(){if(0===arguments.length)throw new Error("compose requires at least one argument");return pipe.apply(this,we(arguments))}function composeK(){if(0===arguments.length)throw new Error("composeK requires at least one argument");var t=Array.prototype.slice.call(arguments),r=t.pop();return compose(compose.apply(this,I(pe,t)),r)}function _pipeP(t,r){return function(){var i=this;return t.apply(i,arguments).then((function(t){return r.call(i,t)}))}}function pipeP(){if(0===arguments.length)throw new Error("pipeP requires at least one argument");return _arity(arguments[0].length,D(_pipeP,arguments[0],_e(arguments)))}function composeP(){if(0===arguments.length)throw new Error("composeP requires at least one argument");return pipeP.apply(this,we(arguments))}function _arrayFromIterator(t){for(var r,i=[];!(r=t.next()).done;)i.push(r.value);return i}function _containsWith(t,r,i){for(var a=0,u=i.length;a<u;){if(t(r,i[a]))return!0;a+=1}return!1}var xe=_curry2((function identical(t,r){return t===r?0!==t||1/t==1/r:t!=t&&r!=r}));function _uniqContentEquals(t,r,i,a){var u=_arrayFromIterator(t);function eq(t,r){return _equals(t,r,i.slice(),a.slice())}return!_containsWith((function(t,r){return!_containsWith(eq,r,t)}),_arrayFromIterator(r),u)}function _equals(t,r,i,a){if(xe(t,r))return!0;var u=ye(t);if(u!==ye(r))return!1;if(null==t||null==r)return!1;if("function"==typeof t["fantasy-land/equals"]||"function"==typeof r["fantasy-land/equals"])return"function"==typeof t["fantasy-land/equals"]&&t["fantasy-land/equals"](r)&&"function"==typeof r["fantasy-land/equals"]&&r["fantasy-land/equals"](t);if("function"==typeof t.equals||"function"==typeof r.equals)return"function"==typeof t.equals&&t.equals(r)&&"function"==typeof r.equals&&r.equals(t);switch(u){case"Arguments":case"Array":case"Object":if("function"==typeof t.constructor&&"Promise"===function _functionName(t){var r=String(t).match(/^function (\w*)/);return null==r?"":r[1]}(t.constructor))return t===r;break;case"Boolean":case"Number":case"String":if(typeof t!=typeof r||!xe(t.valueOf(),r.valueOf()))return!1;break;case"Date":if(!xe(t.valueOf(),r.valueOf()))return!1;break;case"Error":return t.name===r.name&&t.message===r.message;case"RegExp":if(t.source!==r.source||t.global!==r.global||t.ignoreCase!==r.ignoreCase||t.multiline!==r.multiline||t.sticky!==r.sticky||t.unicode!==r.unicode)return!1}for(var c=i.length-1;c>=0;){if(i[c]===t)return a[c]===r;c-=1}switch(u){case"Map":return t.size===r.size&&_uniqContentEquals(t.entries(),r.entries(),i.concat([t]),a.concat([r]));case"Set":return t.size===r.size&&_uniqContentEquals(t.values(),r.values(),i.concat([t]),a.concat([r]));case"Arguments":case"Array":case"Object":case"Boolean":case"Number":case"String":case"Date":case"Error":case"RegExp":case"Int8Array":case"Uint8Array":case"Uint8ClampedArray":case"Int16Array":case"Uint16Array":case"Int32Array":case"Uint32Array":case"Float32Array":case"Float64Array":case"ArrayBuffer":break;default:return!1}var l=B(t);if(l.length!==B(r).length)return!1;var p=i.concat([t]),d=a.concat([r]);for(c=l.length-1;c>=0;){var y=l[c];if(!_has(y,r)||!_equals(r[y],t[y],p,d))return!1;c-=1}return!0}var Se=_curry2((function equals(t,r){return _equals(t,r,[],[])}));function _indexOf(t,r,i){var a,u;if("function"==typeof t.indexOf)switch(typeof r){case"number":if(0===r){for(a=1/r;i<t.length;){if(0===(u=t[i])&&1/u===a)return i;i+=1}return-1}if(r!=r){for(;i<t.length;){if("number"==typeof(u=t[i])&&u!=u)return i;i+=1}return-1}return t.indexOf(r,i);case"string":case"boolean":case"function":case"undefined":return t.indexOf(r,i);case"object":if(null===r)return t.indexOf(r,i)}for(;i<t.length;){if(Se(t[i],r))return i;i+=1}return-1}function _contains(t,r){return _indexOf(r,t,0)>=0}function _quote(t){return'"'+t.replace(/\\/g,"\\\\").replace(/[\b]/g,"\\b").replace(/\f/g,"\\f").replace(/\n/g,"\\n").replace(/\r/g,"\\r").replace(/\t/g,"\\t").replace(/\v/g,"\\v").replace(/\0/g,"\\0").replace(/"/g,'\\"')+'"'}var Oe=function pad(t){return(t<10?"0":"")+t},Ee="function"==typeof Date.prototype.toISOString?function _toISOString(t){return t.toISOString()}:function _toISOString(t){return t.getUTCFullYear()+"-"+Oe(t.getUTCMonth()+1)+"-"+Oe(t.getUTCDate())+"T"+Oe(t.getUTCHours())+":"+Oe(t.getUTCMinutes())+":"+Oe(t.getUTCSeconds())+"."+(t.getUTCMilliseconds()/1e3).toFixed(3).slice(2,5)+"Z"};function _complement(t){return function(){return!t.apply(this,arguments)}}function _filter(t,r){for(var i=0,a=r.length,u=[];i<a;)t(r[i])&&(u[u.length]=r[i]),i+=1;return u}function _isObject(t){return"[object Object]"===Object.prototype.toString.call(t)}var ke=function(){function XFilter(t,r){this.xf=r,this.f=t}return XFilter.prototype["@@transducer/init"]=v.init,XFilter.prototype["@@transducer/result"]=v.result,XFilter.prototype["@@transducer/step"]=function(t,r){return this.f(r)?this.xf["@@transducer/step"](t,r):t},XFilter}(),Ae=_curry2(_dispatchable(["filter"],_curry2((function _xfilter(t,r){return new ke(t,r)})),(function(t,r){return _isObject(r)?_reduce((function(i,a){return t(r[a])&&(i[a]=r[a]),i}),{},B(r)):_filter(t,r)}))),Ne=_curry2((function reject(t,r){return Ae(_complement(t),r)}));var Te=_curry1((function toString(t){return function _toString(t,r){var i=function recur(i){var a=r.concat([t]);return _contains(i,a)?"<Circular>":_toString(i,a)},mapPairs=function(t,r){return _map((function(r){return _quote(r)+": "+i(t[r])}),r.slice().sort())};switch(Object.prototype.toString.call(t)){case"[object Arguments]":return"(function() { return arguments; }("+_map(i,t).join(", ")+"))";case"[object Array]":return"["+_map(i,t).concat(mapPairs(t,Ne((function(t){return/^\d+$/.test(t)}),B(t)))).join(", ")+"]";case"[object Boolean]":return"object"==typeof t?"new Boolean("+i(t.valueOf())+")":t.toString();case"[object Date]":return"new Date("+(isNaN(t.valueOf())?i(NaN):_quote(Ee(t)))+")";case"[object Null]":return"null";case"[object Number]":return"object"==typeof t?"new Number("+i(t.valueOf())+")":1/t==-1/0?"-0":t.toString(10);case"[object String]":return"object"==typeof t?"new String("+i(t.valueOf())+")":_quote(t);case"[object Undefined]":return"undefined";default:if("function"==typeof t.toString){var a=t.toString();if("[object Object]"!==a)return a}return"{"+mapPairs(t,B(t)).join(", ")+"}"}}(t,[])})),Pe=_curry2((function concat(t,r){if(g(t)){if(g(r))return t.concat(r);throw new TypeError(Te(r)+" is not an array")}if(_isString(t)){if(_isString(r))return t+r;throw new TypeError(Te(r)+" is not a string")}if(null!=t&&_isFunction(t["fantasy-land/concat"]))return t["fantasy-land/concat"](r);if(null!=t&&_isFunction(t.concat))return t.concat(r);throw new TypeError(Te(t)+' does not have a method named "concat" or "fantasy-land/concat"')})),Ce=_curry1((function cond(t){return _arity(D(_,0,I((function(t){return t[0].length}),t)),(function(){for(var r=0;r<t.length;){if(t[r][0].apply(this,arguments))return t[r][1].apply(this,arguments);r+=1}}))})),Be=_curry2((function constructN(t,r){if(t>10)throw new Error("Constructor with greater than ten arguments");return 0===t?function(){return new r}:se(ie(t,(function(t,i,a,u,c,l,p,d,y,h){switch(arguments.length){case 1:return new r(t);case 2:return new r(t,i);case 3:return new r(t,i,a);case 4:return new r(t,i,a,u);case 5:return new r(t,i,a,u,c);case 6:return new r(t,i,a,u,c,l);case 7:return new r(t,i,a,u,c,l,p);case 8:return new r(t,i,a,u,c,l,p,d);case 9:return new r(t,i,a,u,c,l,p,d,y);case 10:return new r(t,i,a,u,c,l,p,d,y,h)}})))})),Ie=_curry1((function construct(t){return Be(t.length,t)})),Re=_curry2(_contains),je=_curry2((function converge(t,r){return d(D(_,0,M("length",r)),(function(){var i=arguments,a=this;return t.apply(a,_map((function(t){return t.apply(a,i)}),r))}))})),Me=function(){function XReduceBy(t,r,i,a){this.valueFn=t,this.valueAcc=r,this.keyFn=i,this.xf=a,this.inputs={}}return XReduceBy.prototype["@@transducer/init"]=v.init,XReduceBy.prototype["@@transducer/result"]=function(t){var r;for(r in this.inputs)if(_has(r,this.inputs)&&(t=this.xf["@@transducer/step"](t,this.inputs[r]))["@@transducer/reduced"]){t=t["@@transducer/value"];break}return this.inputs=null,this.xf["@@transducer/result"](t)},XReduceBy.prototype["@@transducer/step"]=function(t,r){var i=this.keyFn(r);return this.inputs[i]=this.inputs[i]||[i,this.valueAcc],this.inputs[i][1]=this.valueFn(this.inputs[i][1],r),t},XReduceBy}(),De=_curryN(4,[],_dispatchable([],_curryN(4,[],(function _xreduceBy(t,r,i,a){return new Me(t,r,i,a)})),(function reduceBy(t,r,i,a){return _reduce((function(a,u){var c=i(u);return a[c]=t(_has(c,a)?a[c]:r,u),a}),{},a)}))),Le=De((function(t,r){return t+1}),0),Fe=p(-1),Ue=_curry2((function defaultTo(t,r){return null==r||r!=r?t:r})),qe=_curry3((function descend(t,r,i){var a=t(r),u=t(i);return a>u?-1:a<u?1:0})),We=_curry2((function difference(t,r){for(var i=[],a=0,u=t.length;a<u;)_contains(t[a],r)||_contains(t[a],i)||(i[i.length]=t[a]),a+=1;return i})),Ge=_curry3((function differenceWith(t,r,i){for(var a=[],u=0,c=r.length;u<c;)_containsWith(t,r[u],i)||_containsWith(t,r[u],a)||a.push(r[u]),u+=1;return a})),Ve=_curry2((function dissoc(t,r){var i={};for(var a in r)i[a]=r[a];return delete i[t],i})),ze=_curry3((function remove(t,r,i){var a=Array.prototype.slice.call(i,0);return a.splice(t,r),a})),Xe=_curry3((function update(t,r,i){return h(a(r),t,i)})),He=_curry2((function dissocPath(t,r){switch(t.length){case 0:return r;case 1:return te(t[0])?ze(t[0],1,r):Ve(t[0],r);default:var i=t[0],a=Array.prototype.slice.call(t,1);return null==r[i]?r:te(t[0])?Xe(i,dissocPath(a,r[i]),r):ee(i,dissocPath(a,r[i]),r)}})),Ye=_curry2((function divide(t,r){return t/r})),$e=function(){function XDrop(t,r){this.xf=r,this.n=t}return XDrop.prototype["@@transducer/init"]=v.init,XDrop.prototype["@@transducer/result"]=v.result,XDrop.prototype["@@transducer/step"]=function(t,r){return this.n>0?(this.n-=1,t):this.xf["@@transducer/step"](t,r)},XDrop}(),Ke=_curry2(_dispatchable(["drop"],_curry2((function _xdrop(t,r){return new $e(t,r)})),(function drop(t,r){return be(Math.max(0,t),1/0,r)}))),Qe=function(){function XTake(t,r){this.xf=r,this.n=t,this.i=0}return XTake.prototype["@@transducer/init"]=v.init,XTake.prototype["@@transducer/result"]=v.result,XTake.prototype["@@transducer/step"]=function(t,r){this.i+=1;var i=0===this.n?t:this.xf["@@transducer/step"](t,r);return this.n>=0&&this.i>=this.n?_reduced(i):i},XTake}(),Je=_curry2(_dispatchable(["take"],_curry2((function _xtake(t,r){return new Qe(t,r)})),(function take(t,r){return be(0,t<0?1/0:t,r)})));function dropLast(t,r){return Je(t<r.length?r.length-t:0,r)}var Ze=function(){function XDropLast(t,r){this.xf=r,this.pos=0,this.full=!1,this.acc=new Array(t)}return XDropLast.prototype["@@transducer/init"]=v.init,XDropLast.prototype["@@transducer/result"]=function(t){return this.acc=null,this.xf["@@transducer/result"](t)},XDropLast.prototype["@@transducer/step"]=function(t,r){return this.full&&(t=this.xf["@@transducer/step"](t,this.acc[this.pos])),this.store(r),t},XDropLast.prototype.store=function(t){this.acc[this.pos]=t,this.pos+=1,this.pos===this.acc.length&&(this.pos=0,this.full=!0)},XDropLast}(),et=_curry2(_dispatchable([],_curry2((function _xdropLast(t,r){return new Ze(t,r)})),dropLast));function dropLastWhile(t,r){for(var i=r.length-1;i>=0&&t(r[i]);)i-=1;return be(0,i+1,r)}var tt=function(){function XDropLastWhile(t,r){this.f=t,this.retained=[],this.xf=r}return XDropLastWhile.prototype["@@transducer/init"]=v.init,XDropLastWhile.prototype["@@transducer/result"]=function(t){return this.retained=null,this.xf["@@transducer/result"](t)},XDropLastWhile.prototype["@@transducer/step"]=function(t,r){return this.f(r)?this.retain(t,r):this.flush(t,r)},XDropLastWhile.prototype.flush=function(t,r){return t=_reduce(this.xf["@@transducer/step"],t,this.retained),this.retained=[],this.xf["@@transducer/step"](t,r)},XDropLastWhile.prototype.retain=function(t,r){return this.retained.push(r),t},XDropLastWhile}(),rt=_curry2(_dispatchable([],_curry2((function _xdropLastWhile(t,r){return new tt(t,r)})),dropLastWhile)),nt=function(){function XDropRepeatsWith(t,r){this.xf=r,this.pred=t,this.lastValue=void 0,this.seenFirstValue=!1}return XDropRepeatsWith.prototype["@@transducer/init"]=v.init,XDropRepeatsWith.prototype["@@transducer/result"]=v.result,XDropRepeatsWith.prototype["@@transducer/step"]=function(t,r){var i=!1;return this.seenFirstValue?this.pred(this.lastValue,r)&&(i=!0):this.seenFirstValue=!0,this.lastValue=r,i?t:this.xf["@@transducer/step"](t,r)},XDropRepeatsWith}(),it=_curry2((function _xdropRepeatsWith(t,r){return new nt(t,r)})),ot=_curry2((function nth(t,r){var i=t<0?r.length+t:t;return _isString(r)?r.charAt(i):r[i]})),at=ot(-1),ut=_curry2(_dispatchable([],it,(function dropRepeatsWith(t,r){var i=[],a=1,u=r.length;if(0!==u)for(i[0]=r[0];a<u;)t(at(i),r[a])||(i[i.length]=r[a]),a+=1;return i}))),ct=_curry1(_dispatchable([],it(Se),ut(Se))),st=function(){function XDropWhile(t,r){this.xf=r,this.f=t}return XDropWhile.prototype["@@transducer/init"]=v.init,XDropWhile.prototype["@@transducer/result"]=v.result,XDropWhile.prototype["@@transducer/step"]=function(t,r){if(this.f){if(this.f(r))return t;this.f=null}return this.xf["@@transducer/step"](t,r)},XDropWhile}(),ft=_curry2(_dispatchable(["dropWhile"],_curry2((function _xdropWhile(t,r){return new st(t,r)})),(function dropWhile(t,r){for(var i=0,a=r.length;i<a&&t(r[i]);)i+=1;return be(i,1/0,r)}))),pt=_curry2((function or(t,r){return t||r})),dt=_curry2((function either(t,r){return _isFunction(t)?function _either(){return t.apply(this,arguments)||r.apply(this,arguments)}:ue(pt)(t,r)})),yt=_curry1((function empty(t){return null!=t&&"function"==typeof t["fantasy-land/empty"]?t["fantasy-land/empty"]():null!=t&&null!=t.constructor&&"function"==typeof t.constructor["fantasy-land/empty"]?t.constructor["fantasy-land/empty"]():null!=t&&"function"==typeof t.empty?t.empty():null!=t&&null!=t.constructor&&"function"==typeof t.constructor.empty?t.constructor.empty():g(t)?[]:_isString(t)?"":_isObject(t)?{}:internal_isArguments(t)?function(){return arguments}():void 0})),ht=_curry2((function takeLast(t,r){return Ke(t>=0?r.length-t:0,r)})),vt=_curry2((function(t,r){return Se(ht(t.length,r),t)})),mt=_curry3((function eqBy(t,r,i){return Se(t(r),t(i))})),bt=_curry3((function eqProps(t,r,i){return Se(r[t],i[t])})),_t=_curry2((function evolve(t,r){var i,a,u,c={};for(a in r)u=typeof(i=t[a]),c[a]="function"===u?i(r[a]):i&&"object"===u?evolve(i,r[a]):r[a];return c})),wt=function(){function XFind(t,r){this.xf=r,this.f=t,this.found=!1}return XFind.prototype["@@transducer/init"]=v.init,XFind.prototype["@@transducer/result"]=function(t){return this.found||(t=this.xf["@@transducer/step"](t,void 0)),this.xf["@@transducer/result"](t)},XFind.prototype["@@transducer/step"]=function(t,r){return this.f(r)&&(this.found=!0,t=_reduced(this.xf["@@transducer/step"](t,r))),t},XFind}(),xt=_curry2(_dispatchable(["find"],_curry2((function _xfind(t,r){return new wt(t,r)})),(function find(t,r){for(var i=0,a=r.length;i<a;){if(t(r[i]))return r[i];i+=1}}))),St=function(){function XFindIndex(t,r){this.xf=r,this.f=t,this.idx=-1,this.found=!1}return XFindIndex.prototype["@@transducer/init"]=v.init,XFindIndex.prototype["@@transducer/result"]=function(t){return this.found||(t=this.xf["@@transducer/step"](t,-1)),this.xf["@@transducer/result"](t)},XFindIndex.prototype["@@transducer/step"]=function(t,r){return this.idx+=1,this.f(r)&&(this.found=!0,t=_reduced(this.xf["@@transducer/step"](t,this.idx))),t},XFindIndex}(),Ot=_curry2(_dispatchable([],_curry2((function _xfindIndex(t,r){return new St(t,r)})),(function findIndex(t,r){for(var i=0,a=r.length;i<a;){if(t(r[i]))return i;i+=1}return-1}))),Et=function(){function XFindLast(t,r){this.xf=r,this.f=t}return XFindLast.prototype["@@transducer/init"]=v.init,XFindLast.prototype["@@transducer/result"]=function(t){return this.xf["@@transducer/result"](this.xf["@@transducer/step"](t,this.last))},XFindLast.prototype["@@transducer/step"]=function(t,r){return this.f(r)&&(this.last=r),t},XFindLast}(),kt=_curry2(_dispatchable([],_curry2((function _xfindLast(t,r){return new Et(t,r)})),(function findLast(t,r){for(var i=r.length-1;i>=0;){if(t(r[i]))return r[i];i-=1}}))),At=function(){function XFindLastIndex(t,r){this.xf=r,this.f=t,this.idx=-1,this.lastIdx=-1}return XFindLastIndex.prototype["@@transducer/init"]=v.init,XFindLastIndex.prototype["@@transducer/result"]=function(t){return this.xf["@@transducer/result"](this.xf["@@transducer/step"](t,this.lastIdx))},XFindLastIndex.prototype["@@transducer/step"]=function(t,r){return this.idx+=1,this.f(r)&&(this.lastIdx=this.idx),t},XFindLastIndex}(),Nt=_curry2(_dispatchable([],_curry2((function _xfindLastIndex(t,r){return new At(t,r)})),(function findLastIndex(t,r){for(var i=r.length-1;i>=0;){if(t(r[i]))return i;i-=1}return-1}))),Tt=_curry1(_makeFlat(!0)),Pt=_curry1((function flip(t){return d(t.length,(function(r,i){var a=Array.prototype.slice.call(arguments,0);return a[0]=i,a[1]=r,t.apply(this,a)}))})),Ct=_curry2(_checkForMethod("forEach",(function forEach(t,r){for(var i=r.length,a=0;a<i;)t(r[a]),a+=1;return r}))),Bt=_curry2((function forEachObjIndexed(t,r){for(var i=B(r),a=0;a<i.length;){var u=i[a];t(r[u],u,r),a+=1}return r})),It=_curry1((function fromPairs(t){for(var r={},i=0;i<t.length;)r[t[i][0]]=t[i][1],i+=1;return r})),Rt=_curry2(_checkForMethod("groupBy",De((function(t,r){return null==t&&(t=[]),t.push(r),t}),null))),jt=_curry2((function(t,r){for(var i=[],a=0,u=r.length;a<u;){for(var c=a+1;c<u&&t(r[c-1],r[c]);)c+=1;i.push(r.slice(a,c)),a=c}return i})),Mt=_curry2((function gt(t,r){return t>r})),Dt=_curry2((function gte(t,r){return t>=r})),Lt=_curry2(_has),Ft=_curry2((function hasIn(t,r){return t in r})),Ut=ot(0);function _identity(t){return t}var qt=_curry1(_identity),Wt=_curry3((function ifElse(t,r,i){return d(Math.max(t.length,r.length,i.length),(function _ifElse(){return t.apply(this,arguments)?r.apply(this,arguments):i.apply(this,arguments)}))})),Gt=p(1),Vt=De((function(t,r){return r}),null),zt=_curry2((function indexOf(t,r){return"function"!=typeof r.indexOf||g(r)?_indexOf(r,t,0):r.indexOf(t)})),Xt=be(0,-1),Ht=_curry3((function innerJoin(t,r,i){return _filter((function(r){return _containsWith(t,r,i)}),r)})),Yt=_curry3((function insert(t,r,i){t=t<i.length&&t>=0?t:i.length;var a=Array.prototype.slice.call(i,0);return a.splice(t,0,r),a})),$t=_curry3((function insertAll(t,r,i){return t=t<i.length&&t>=0?t:i.length,[].concat(Array.prototype.slice.call(i,0,t),r,Array.prototype.slice.call(i,t))}));function hasOrAdd(t,r,i){var a,u=typeof t;switch(u){case"string":case"number":return 0===t&&1/t==-1/0?!!i._items["-0"]||(r&&(i._items["-0"]=!0),!1):null!==i._nativeSet?r?(a=i._nativeSet.size,i._nativeSet.add(t),i._nativeSet.size===a):i._nativeSet.has(t):u in i._items?t in i._items[u]||(r&&(i._items[u][t]=!0),!1):(r&&(i._items[u]={},i._items[u][t]=!0),!1);case"boolean":if(u in i._items){var c=t?1:0;return!!i._items[u][c]||(r&&(i._items[u][c]=!0),!1)}return r&&(i._items[u]=t?[!1,!0]:[!0,!1]),!1;case"function":return null!==i._nativeSet?r?(a=i._nativeSet.size,i._nativeSet.add(t),i._nativeSet.size===a):i._nativeSet.has(t):u in i._items?!!_contains(t,i._items[u])||(r&&i._items[u].push(t),!1):(r&&(i._items[u]=[t]),!1);case"undefined":return!!i._items[u]||(r&&(i._items[u]=!0),!1);case"object":if(null===t)return!!i._items.null||(r&&(i._items.null=!0),!1);default:return(u=Object.prototype.toString.call(t))in i._items?!!_contains(t,i._items[u])||(r&&i._items[u].push(t),!1):(r&&(i._items[u]=[t]),!1)}}var Kt=function(){function _Set(){this._nativeSet="function"==typeof Set?new Set:null,this._items={}}return _Set.prototype.add=function(t){return!hasOrAdd(t,!0,this)},_Set.prototype.has=function(t){return hasOrAdd(t,!1,this)},_Set}(),Qt=_curry2((function uniqBy(t,r){for(var i,a,u=new Kt,c=[],l=0;l<r.length;)i=t(a=r[l]),u.add(i)&&c.push(a),l+=1;return c})),Jt=Qt(qt),Zt=_curry2((function intersection(t,r){var i,a;return t.length>r.length?(i=t,a=r):(i=r,a=t),Jt(_filter(Pt(_contains)(i),a))})),er=_curry2(_checkForMethod("intersperse",(function intersperse(t,r){for(var i=[],a=0,u=r.length;a<u;)a===u-1?i.push(r[a]):i.push(r[a],t),a+=1;return i})));var tr="function"==typeof Object.assign?Object.assign:function _objectAssign(t){if(null==t)throw new TypeError("Cannot convert undefined or null to object");for(var r=Object(t),i=1,a=arguments.length;i<a;){var u=arguments[i];if(null!=u)for(var c in u)_has(c,u)&&(r[c]=u[c]);i+=1}return r},rr=_curry2((function objOf(t,r){var i={};return i[t]=r,i})),nr={"@@transducer/init":Array,"@@transducer/step":function(t,r){return t.push(r),t},"@@transducer/result":_identity},ir={"@@transducer/init":String,"@@transducer/step":function(t,r){return t+r},"@@transducer/result":_identity},ar={"@@transducer/init":Object,"@@transducer/step":function(t,r){return tr(t,w(r)?rr(r[0],r[1]):r)},"@@transducer/result":_identity};var ur=_curry3((function into(t,r,i){return _isTransformer(t)?_reduce(r(t),t["@@transducer/init"](),i):_reduce(r(function _stepCat(t){if(_isTransformer(t))return t;if(w(t))return nr;if("string"==typeof t)return ir;if("object"==typeof t)return ar;throw new Error("Cannot create transformer for "+t)}(t)),_clone(t,[],[],!1),i)})),cr=_curry1((function invert(t){for(var r=B(t),i=r.length,a=0,u={};a<i;){var c=r[a],l=t[c],p=_has(l,u)?u[l]:u[l]=[];p[p.length]=c,a+=1}return u})),sr=_curry1((function invertObj(t){for(var r=B(t),i=r.length,a=0,u={};a<i;){var c=r[a];u[t[c]]=c,a+=1}return u})),fr=_curry2((function invoker(t,r){return d(t+1,(function(){var i=arguments[t];if(null!=i&&_isFunction(i[r]))return i[r].apply(i,Array.prototype.slice.call(arguments,0,t));throw new TypeError(Te(i)+' does not have a method named "'+r+'"')}))})),lr=_curry2((function is(t,r){return null!=r&&r.constructor===t||r instanceof t})),pr=_curry1((function isEmpty(t){return null!=t&&Se(t,yt(t))})),dr=fr(1,"join"),yr=_curry1((function juxt(t){return je((function(){return Array.prototype.slice.call(arguments,0)}),t)})),hr=_curry1((function keysIn(t){var r,i=[];for(r in t)i[i.length]=r;return i})),gr=_curry2((function lastIndexOf(t,r){if("function"!=typeof r.lastIndexOf||g(r)){for(var i=r.length-1;i>=0;){if(Se(r[i],t))return i;i-=1}return-1}return r.lastIndexOf(t)}));function _isNumber(t){return"[object Number]"===Object.prototype.toString.call(t)}var vr=_curry1((function length(t){return null!=t&&_isNumber(t.length)?t.length:NaN})),mr=_curry2((function lens(t,r){return function(i){return function(a){return I((function(t){return r(t,a)}),i(t(a)))}}})),br=_curry1((function lensIndex(t){return mr(ot(t),Xe(t))})),_r=_curry1((function lensPath(t){return mr(R(t),ne(t))})),wr=_curry1((function lensProp(t){return mr(j(t),ee(t))})),xr=_curry2((function lt(t,r){return t<r})),Sr=_curry2((function lte(t,r){return t<=r})),Or=_curry3((function mapAccum(t,r,i){for(var a=0,u=i.length,c=[],l=[r];a<u;)l=t(l[0],i[a]),c[a]=l[1],a+=1;return[l[0],c]})),Er=_curry3((function mapAccumRight(t,r,i){for(var a=i.length-1,u=[],c=[r];a>=0;)c=t(i[a],c[0]),u[a]=c[1],a-=1;return[u,c[0]]})),kr=_curry2((function mapObjIndexed(t,r){return _reduce((function(i,a){return i[a]=t(r[a],a,r),i}),{},B(r))})),Ar=_curry2((function match(t,r){return r.match(t)||[]})),Nr=_curry2((function mathMod(t,r){return te(t)?!te(r)||r<1?NaN:(t%r+r)%r:NaN})),Tr=_curry3((function maxBy(t,r,i){return t(i)>t(r)?i:r})),Pr=D(p,0),Cr=_curry1((function mean(t){return Pr(t)/t.length})),Br=_curry1((function median(t){var r=t.length;if(0===r)return NaN;var i=2-r%2,a=(r-i)/2;return Cr(Array.prototype.slice.call(t,0).sort((function(t,r){return t<r?-1:t>r?1:0})).slice(a,a+i))})),Ir=_curry2((function memoizeWith(t,r){var i={};return _arity(r.length,(function(){var a=t.apply(this,arguments);return _has(a,i)||(i[a]=r.apply(this,arguments)),i[a]}))})),Rr=Ir((function(){return Te(arguments)})),jr=_curry2((function merge(t,r){return tr({},t,r)})),Mr=_curry1((function mergeAll(t){return tr.apply(null,[{}].concat(t))})),Dr=_curry3((function mergeWithKey(t,r,i){var a,u={};for(a in r)_has(a,r)&&(u[a]=_has(a,i)?t(a,r[a],i[a]):r[a]);for(a in i)_has(a,i)&&!_has(a,u)&&(u[a]=i[a]);return u})),Lr=_curry3((function mergeDeepWithKey(t,r,i){return Dr((function(r,i,a){return _isObject(i)&&_isObject(a)?mergeDeepWithKey(t,i,a):t(r,i,a)}),r,i)})),Fr=_curry2((function mergeDeepLeft(t,r){return Lr((function(t,r,i){return r}),t,r)})),Ur=_curry2((function mergeDeepRight(t,r){return Lr((function(t,r,i){return i}),t,r)})),qr=_curry3((function mergeDeepWith(t,r,i){return Lr((function(r,i,a){return t(i,a)}),r,i)})),Wr=_curry3((function mergeWith(t,r,i){return Dr((function(r,i,a){return t(i,a)}),r,i)})),Gr=_curry2((function min(t,r){return r<t?r:t})),Vr=_curry3((function minBy(t,r,i){return t(i)<t(r)?i:r})),zr=_curry2((function modulo(t,r){return t%r})),Xr=_curry2((function multiply(t,r){return t*r})),Hr=_curry1((function negate(t){return-t})),Yr=_curry2(_complement(_dispatchable(["any"],W,G))),$r=_curry1((function nthArg(t){return d(t<0?1:t+1,(function(){return ot(t,arguments)}))})),Kr=_curry3((function o(t,r,i){return t(r(i))}));function _of(t){return[t]}var Qr=_curry1(_of),Jr=_curry2((function omit(t,r){for(var i={},a={},u=0,c=t.length;u<c;)a[t[u]]=1,u+=1;for(var l in r)a.hasOwnProperty(l)||(i[l]=r[l]);return i})),Zr=_curry1((function once(t){var r,i=!1;return _arity(t.length,(function(){return i?r:(i=!0,r=t.apply(this,arguments))}))})),Identity=function(t){return{value:t,map:function(r){return Identity(r(t))}}},en=_curry3((function over(t,r,i){return t((function(t){return Identity(r(t))}))(i).value})),tn=_curry2((function pair(t,r){return[t,r]}));function _createPartialApplicator(t){return _curry2((function(r,i){return _arity(Math.max(0,r.length-i.length),(function(){return r.apply(this,t(i,arguments))}))}))}var rn=_createPartialApplicator(_concat),nn=_createPartialApplicator(Pt(_concat)),on=yr([Ae,Ne]),an=_curry3((function pathEq(t,r,i){return Se(R(t,i),r)})),un=_curry3((function pathOr(t,r,i){return Ue(t,R(r,i))})),cn=_curry3((function pathSatisfies(t,r,i){return r.length>0&&t(R(r,i))})),sn=_curry2((function pick(t,r){for(var i={},a=0;a<t.length;)t[a]in r&&(i[t[a]]=r[t[a]]),a+=1;return i})),ln=_curry2((function pickAll(t,r){for(var i={},a=0,u=t.length;a<u;){var c=t[a];i[c]=r[c],a+=1}return i})),pn=_curry2((function pickBy(t,r){var i={};for(var a in r)t(r[a],a,r)&&(i[a]=r[a]);return i}));function pipeK(){if(0===arguments.length)throw new Error("pipeK requires at least one argument");return composeK.apply(this,we(arguments))}var dn=_curry2((function prepend(t,r){return _concat([t],r)})),yn=D(Xr,1),hn=_curry2((function useWith(t,r){return d(r.length,(function(){for(var i=[],a=0;a<r.length;)i.push(r[a].call(this,arguments[a])),a+=1;return t.apply(this,i.concat(Array.prototype.slice.call(arguments,r.length)))}))})),gn=hn(_map,[ln,qt]),vn=_curry3((function propEq(t,r,i){return Se(r,i[t])})),mn=_curry3((function propIs(t,r,i){return lr(t,i[r])})),bn=_curry3((function propOr(t,r,i){return null!=i&&_has(r,i)?i[r]:t})),_n=_curry3((function propSatisfies(t,r,i){return t(i[r])})),wn=_curry2((function props(t,r){for(var i=t.length,a=[],u=0;u<i;)a[u]=r[t[u]],u+=1;return a})),xn=_curry2((function range(t,r){if(!_isNumber(t)||!_isNumber(r))throw new TypeError("Both arguments to range must be numbers");for(var i=[],a=t;a<r;)i.push(a),a+=1;return i})),Sn=_curry3((function reduceRight(t,r,i){for(var a=i.length-1;a>=0;)r=t(i[a],r),a-=1;return r})),On=_curryN(4,[],(function _reduceWhile(t,r,i,a){return _reduce((function(i,a){return t(i,a)?r(i,a):_reduced(i)}),i,a)})),En=_curry1(_reduced),kn=_curry2((function times(t,r){var i,a=Number(r),u=0;if(a<0||isNaN(a))throw new RangeError("n must be a non-negative number");for(i=new Array(a);u<a;)i[u]=t(u),u+=1;return i})),An=_curry2((function repeat(t,r){return kn(a(t),r)})),Nn=_curry3((function replace(t,r,i){return i.replace(t,r)})),Tn=_curry3((function scan(t,r,i){for(var a=0,u=i.length,c=[r];a<u;)r=t(r,i[a]),c[a+1]=r,a+=1;return c})),Pn=_curry2((function sequence(t,r){return"function"==typeof r.sequence?r.sequence(t):Sn((function(t,r){return z(I(dn,t),r)}),t([]),r)})),Cn=_curry3((function set(t,r,i){return en(t,a(r),i)})),Bn=_curry2((function sort(t,r){return Array.prototype.slice.call(r,0).sort(t)})),In=_curry2((function sortBy(t,r){return Array.prototype.slice.call(r,0).sort((function(r,i){var a=t(r),u=t(i);return a<u?-1:a>u?1:0}))})),Rn=_curry2((function sortWith(t,r){return Array.prototype.slice.call(r,0).sort((function(r,i){for(var a=0,u=0;0===a&&u<t.length;)a=t[u](r,i),u+=1;return a}))})),jn=fr(1,"split"),Mn=_curry2((function splitAt(t,r){return[be(0,t,r),be(t,vr(r),r)]})),Dn=_curry2((function splitEvery(t,r){if(t<=0)throw new Error("First argument to splitEvery must be a positive integer");for(var i=[],a=0;a<r.length;)i.push(be(a,a+=t,r));return i})),Ln=_curry2((function splitWhen(t,r){for(var i=0,a=r.length,u=[];i<a&&!t(r[i]);)u.push(r[i]),i+=1;return[u,Array.prototype.slice.call(r,i)]})),Fn=_curry2((function(t,r){return Se(Je(t.length,r),t)})),Un=_curry2((function subtract(t,r){return Number(t)-Number(r)})),qn=_curry2((function symmetricDifference(t,r){return Pe(We(t,r),We(r,t))})),Wn=_curry3((function symmetricDifferenceWith(t,r,i){return Pe(Ge(t,r,i),Ge(t,i,r))})),Gn=_curry2((function takeLastWhile(t,r){for(var i=r.length-1;i>=0&&t(r[i]);)i-=1;return be(i+1,1/0,r)})),Vn=function(){function XTakeWhile(t,r){this.xf=r,this.f=t}return XTakeWhile.prototype["@@transducer/init"]=v.init,XTakeWhile.prototype["@@transducer/result"]=v.result,XTakeWhile.prototype["@@transducer/step"]=function(t,r){return this.f(r)?this.xf["@@transducer/step"](t,r):_reduced(t)},XTakeWhile}(),zn=_curry2(_dispatchable(["takeWhile"],_curry2((function _xtakeWhile(t,r){return new Vn(t,r)})),(function takeWhile(t,r){for(var i=0,a=r.length;i<a&&t(r[i]);)i+=1;return be(0,i,r)}))),Xn=function(){function XTap(t,r){this.xf=r,this.f=t}return XTap.prototype["@@transducer/init"]=v.init,XTap.prototype["@@transducer/result"]=v.result,XTap.prototype["@@transducer/step"]=function(t,r){return this.f(r),this.xf["@@transducer/step"](t,r)},XTap}(),Hn=_curry2(_dispatchable([],_curry2((function _xtap(t,r){return new Xn(t,r)})),(function tap(t,r){return t(r),r})));var Yn=_curry2((function test(t,r){if(!function _isRegExp(t){return"[object RegExp]"===Object.prototype.toString.call(t)}(t))throw new TypeError("‘test’ requires a value of type RegExp as its first argument; received "+Te(t));return _cloneRegExp(t).test(r)})),$n=fr(0,"toLowerCase"),Kn=_curry1((function toPairs(t){var r=[];for(var i in t)_has(i,t)&&(r[r.length]=[i,t[i]]);return r})),Qn=_curry1((function toPairsIn(t){var r=[];for(var i in t)r[r.length]=[i,t[i]];return r})),Jn=fr(0,"toUpperCase"),Zn=d(4,(function transduce(t,r,i,a){return _reduce(t("function"==typeof r?_xwrap(r):r),i,a)})),ei=_curry1((function transpose(t){for(var r=0,i=[];r<t.length;){for(var a=t[r],u=0;u<a.length;)void 0===i[u]&&(i[u]=[]),i[u].push(a[u]),u+=1;r+=1}return i})),ti=_curry3((function traverse(t,r,i){return"function"==typeof i["fantasy-land/traverse"]?i["fantasy-land/traverse"](r,t):Pn(t,I(r,i))})),ri="\t\n\v\f\r   ᠎             　\u2028\u2029\ufeff",ni=_curry1("function"==typeof String.prototype.trim&&!ri.trim()&&"​".trim()?function trim(t){return t.trim()}:function trim(t){var r=new RegExp("^["+ri+"]["+ri+"]*"),i=new RegExp("["+ri+"]["+ri+"]*$");return t.replace(r,"").replace(i,"")}),ii=_curry2((function _tryCatch(t,r){return _arity(t.length,(function(){try{return t.apply(this,arguments)}catch(t){return r.apply(this,_concat([t],arguments))}}))})),oi=_curry1((function unapply(t){return function(){return t(Array.prototype.slice.call(arguments,0))}})),ai=_curry1((function unary(t){return ie(1,t)})),ui=_curry2((function uncurryN(t,r){return d(t,(function(){for(var i,a=1,u=r,c=0;a<=t&&"function"==typeof u;)i=a===t?arguments.length:c+u.length,u=u.apply(this,Array.prototype.slice.call(arguments,c,i)),a+=1,c=i;return u}))})),ci=_curry2((function unfold(t,r){for(var i=t(r),a=[];i&&i.length;)a[a.length]=i[0],i=t(i[1]);return a})),si=_curry2(compose(Jt,_concat)),fi=_curry2((function uniqWith(t,r){for(var i,a=0,u=r.length,c=[];a<u;)_containsWith(t,i=r[a],c)||(c[c.length]=i),a+=1;return c})),li=_curry3((function unionWith(t,r,i){return fi(t,_concat(r,i))})),pi=_curry3((function unless(t,r,i){return t(i)?i:r(i)})),di=pe(_identity),yi=_curry3((function until(t,r,i){for(var a=i;!t(a);)a=r(a);return a})),hi=_curry1((function valuesIn(t){var r,i=[];for(r in t)i[i.length]=t[r];return i})),Const=function(t){return{value:t,"fantasy-land/map":function(){return this}}},gi=_curry2((function view(t,r){return t(Const)(r).value})),vi=_curry3((function when(t,r,i){return t(i)?r(i):i})),mi=_curry2((function where(t,r){for(var i in t)if(_has(i,t)&&!t[i](r[i]))return!1;return!0})),bi=_curry2((function whereEq(t,r){return mi(I(Se,t),r)})),_i=_curry2((function(t,r){return Ne(Pt(_contains)(t),r)})),wi=_curry2((function xprod(t,r){for(var i,a=0,u=t.length,c=r.length,l=[];a<u;){for(i=0;i<c;)l[l.length]=[t[a],r[i]],i+=1;a+=1}return l})),xi=_curry2((function zip(t,r){for(var i=[],a=0,u=Math.min(t.length,r.length);a<u;)i[a]=[t[a],r[a]],a+=1;return i})),Si=_curry2((function zipObj(t,r){for(var i=0,a=Math.min(t.length,r.length),u={};i<a;)u[t[i]]=r[i],i+=1;return u})),Oi=_curry3((function zipWith(t,r,i){for(var a=[],u=0,c=Math.min(r.length,i.length);u<c;)a[u]=t(r[u],i[u]),u+=1;return a}))},function(t,r,i){t.exports=i(110)},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(25)),c=i(108),l=i(10),p=a(i(164)),d=a(i(250)),y=a(i(253)),h=a(i(255)),g=a(i(256)),v=a(i(261)),m=a(i(269));function ownKeys(t,r){var i=Object.keys(t);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(t);r&&(a=a.filter((function(r){return Object.getOwnPropertyDescriptor(t,r).enumerable}))),i.push.apply(i,a)}return i}function _objectSpread(t){for(var r=1;r<arguments.length;r++){var i=null!=arguments[r]?arguments[r]:{};r%2?ownKeys(Object(i),!0).forEach((function(r){(0,u.default)(t,r,i[r])})):Object.getOwnPropertyDescriptors?Object.defineProperties(t,Object.getOwnPropertyDescriptors(i)):ownKeys(Object(i)).forEach((function(r){Object.defineProperty(t,r,Object.getOwnPropertyDescriptor(i,r))}))}return t}var b={addConfig:function addConfig(t,r){var a,b,_=r.network,w=void 0===_?"mainnet":_,x=r.staging,S=void 0!==x&&x,O={kovan:i(283),mainnet:i(284)};try{O.testnet=i(285)}catch(t){}var E="ganache"==w?"testnet":w,k=(a={},(0,u.default)(a,l.ESM,{address:(0,c.map)((0,c.prop)("MCD_ESM"),O),abi:i(286)}),(0,u.default)(a,l.END,{address:(0,c.map)((0,c.prop)("MCD_END"),O),abi:i(287)}),a),A=_objectSpread((b={},(0,u.default)(b,l.CHIEF,{address:(0,c.map)((0,c.prop)("CHIEF"),O),abi:i(288)}),(0,u.default)(b,l.VOTE_PROXY_FACTORY,{address:(0,c.map)((0,c.prop)("VOTE_PROXY_FACTORY"),O),abi:i(289)}),(0,u.default)(b,l.POLLING,{address:(0,c.map)((0,c.prop)("POLLING"),O),abi:i(290)}),(0,u.default)(b,l.BATCH_POLLING,{address:(0,c.map)((0,c.prop)("BATCH_POLLING"),O),abi:i(291)}),(0,u.default)(b,l.PAUSE,{address:(0,c.map)((0,c.prop)("PAUSE"),O),abi:i(292)}),b),k);return _objectSpread(_objectSpread({},t),{},{additionalServices:["chief","voteProxy","voteProxyFactory","govPolling","govQueryApi","esm","spell"],chief:[p.default],voteProxy:[d.default],voteProxyFactory:[y.default],govPolling:[h.default],govQueryApi:[g.default,{staging:S}],esm:[v.default],spell:[m.default],smartContract:{addContracts:A},token:{erc20:[{currency:l.MKR,symbol:l.MKR.symbol,address:O[E].SAI_GOV},{currency:l.IOU,symbol:l.IOU.symbol,address:O[E].IOU}]}})}};r.default=b},function(t,r,i){i(112),t.exports=i(4).Object.assign},function(t,r,i){var a=i(11);a(a.S+a.F,"Object",{assign:i(114)})},function(t,r){t.exports=function(t){if("function"!=typeof t)throw TypeError(t+" is not a function!");return t}},function(t,r,i){var a=i(14),u=i(31),c=i(49),l=i(34),p=i(27),d=i(71),y=Object.assign;t.exports=!y||i(21)((function(){var t={},r={},i=Symbol(),a="abcdefghijklmnopqrst";return t[i]=7,a.split("").forEach((function(t){r[t]=t})),7!=y({},t)[i]||Object.keys(y({},r)).join("")!=a}))?function assign(t,r){for(var i=p(t),y=arguments.length,h=1,g=c.f,v=l.f;y>h;)for(var m,b=d(arguments[h++]),_=g?u(b).concat(g(b)):u(b),w=_.length,x=0;w>x;)m=_[x++],a&&!v.call(b,m)||(i[m]=b[m]);return i}:y},function(t,r,i){var a=i(22),u=i(72),c=i(116);t.exports=function(t){return function(r,i,l){var p,d=a(r),y=u(d.length),h=c(l,y);if(t&&i!=i){for(;y>h;)if((p=d[h++])!=p)return!0}else for(;y>h;h++)if((t||h in d)&&d[h]===i)return t||h||0;return!t&&-1}}},function(t,r,i){var a=i(45),u=Math.max,c=Math.min;t.exports=function(t,r){return(t=a(t))<0?u(t+r,0):c(t,r)}},function(t,r,i){i(118),t.exports=i(4).Object.getPrototypeOf},function(t,r,i){var a=i(27),u=i(74);i(119)("getPrototypeOf",(function(){return function getPrototypeOf(t){return u(a(t))}}))},function(t,r,i){var a=i(11),u=i(4),c=i(21);t.exports=function(t,r){var i=(u.Object||{})[t]||Object[t],l={};l[t]=r(i),a(a.S+a.F*c((function(){i(1)})),"Object",l)}},function(t,r,i){t.exports={default:i(121),__esModule:!0}},function(t,r,i){i(50),i(80),t.exports=i(53).f("iterator")},function(t,r,i){var a=i(45),u=i(44);t.exports=function(t){return function(r,i){var c,l,p=String(u(r)),d=a(i),y=p.length;return d<0||d>=y?t?"":void 0:(c=p.charCodeAt(d))<55296||c>56319||d+1===y||(l=p.charCodeAt(d+1))<56320||l>57343?t?p.charAt(d):c:t?p.slice(d,d+2):l-56320+(c-55296<<10)+65536}}},function(t,r,i){var a=i(51),u=i(26),c=i(52),l={};i(19)(l,i(7)("iterator"),(function(){return this})),t.exports=function(t,r,i){t.prototype=a(l,{next:u(1,i)}),c(t,r+" Iterator")}},function(t,r,i){var a=i(13),u=i(16),c=i(31);t.exports=i(14)?Object.defineProperties:function defineProperties(t,r){u(t);for(var i,l=c(r),p=l.length,d=0;p>d;)a.f(t,i=l[d++],r[i]);return t}},function(t,r,i){var a=i(12).document;t.exports=a&&a.documentElement},function(t,r,i){var a=i(127),u=i(128),c=i(28),l=i(22);t.exports=i(78)(Array,"Array",(function(t,r){this._t=l(t),this._i=0,this._k=r}),(function(){var t=this._t,r=this._k,i=this._i++;return!t||i>=t.length?(this._t=void 0,u(1)):u(0,"keys"==r?i:"values"==r?t[i]:[i,t[i]])}),"values"),c.Arguments=c.Array,a("keys"),a("values"),a("entries")},function(t,r){t.exports=function(){}},function(t,r){t.exports=function(t,r){return{value:r,done:!!t}}},function(t,r,i){t.exports={default:i(130),__esModule:!0}},function(t,r,i){i(131),i(136),i(137),i(138),t.exports=i(4).Symbol},function(t,r,i){var a=i(12),u=i(17),c=i(14),l=i(11),p=i(79),d=i(132).KEY,y=i(21),h=i(47),g=i(52),v=i(33),m=i(7),b=i(53),_=i(54),w=i(133),x=i(134),S=i(16),O=i(20),E=i(27),k=i(22),A=i(42),N=i(26),T=i(51),P=i(135),C=i(82),B=i(49),I=i(13),R=i(31),j=C.f,M=I.f,D=P.f,L=a.Symbol,U=a.JSON,q=U&&U.stringify,W=m("_hidden"),G=m("toPrimitive"),V={}.propertyIsEnumerable,z=h("symbol-registry"),X=h("symbols"),H=h("op-symbols"),Y=Object.prototype,$="function"==typeof L&&!!B.f,K=a.QObject,Q=!K||!K.prototype||!K.prototype.findChild,J=c&&y((function(){return 7!=T(M({},"a",{get:function(){return M(this,"a",{value:7}).a}})).a}))?function(t,r,i){var a=j(Y,r);a&&delete Y[r],M(t,r,i),a&&t!==Y&&M(Y,r,a)}:M,wrap=function(t){var r=X[t]=T(L.prototype);return r._k=t,r},Z=$&&"symbol"==typeof L.iterator?function(t){return"symbol"==typeof t}:function(t){return t instanceof L},ee=function defineProperty(t,r,i){return t===Y&&ee(H,r,i),S(t),r=A(r,!0),S(i),u(X,r)?(i.enumerable?(u(t,W)&&t[W][r]&&(t[W][r]=!1),i=T(i,{enumerable:N(0,!1)})):(u(t,W)||M(t,W,N(1,{})),t[W][r]=!0),J(t,r,i)):M(t,r,i)},te=function defineProperties(t,r){S(t);for(var i,a=w(r=k(r)),u=0,c=a.length;c>u;)ee(t,i=a[u++],r[i]);return t},re=function propertyIsEnumerable(t){var r=V.call(this,t=A(t,!0));return!(this===Y&&u(X,t)&&!u(H,t))&&(!(r||!u(this,t)||!u(X,t)||u(this,W)&&this[W][t])||r)},ne=function getOwnPropertyDescriptor(t,r){if(t=k(t),r=A(r,!0),t!==Y||!u(X,r)||u(H,r)){var i=j(t,r);return!i||!u(X,r)||u(t,W)&&t[W][r]||(i.enumerable=!0),i}},ie=function getOwnPropertyNames(t){for(var r,i=D(k(t)),a=[],c=0;i.length>c;)u(X,r=i[c++])||r==W||r==d||a.push(r);return a},oe=function getOwnPropertySymbols(t){for(var r,i=t===Y,a=D(i?H:k(t)),c=[],l=0;a.length>l;)!u(X,r=a[l++])||i&&!u(Y,r)||c.push(X[r]);return c};$||(p((L=function Symbol(){if(this instanceof L)throw TypeError("Symbol is not a constructor!");var t=v(arguments.length>0?arguments[0]:void 0),$set=function(r){this===Y&&$set.call(H,r),u(this,W)&&u(this[W],t)&&(this[W][t]=!1),J(this,t,N(1,r))};return c&&Q&&J(Y,t,{configurable:!0,set:$set}),wrap(t)}).prototype,"toString",(function toString(){return this._k})),C.f=ne,I.f=ee,i(81).f=P.f=ie,i(34).f=re,B.f=oe,c&&!i(32)&&p(Y,"propertyIsEnumerable",re,!0),b.f=function(t){return wrap(m(t))}),l(l.G+l.W+l.F*!$,{Symbol:L});for(var ae="hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables".split(","),ue=0;ae.length>ue;)m(ae[ue++]);for(var ce=R(m.store),se=0;ce.length>se;)_(ce[se++]);l(l.S+l.F*!$,"Symbol",{for:function(t){return u(z,t+="")?z[t]:z[t]=L(t)},keyFor:function keyFor(t){if(!Z(t))throw TypeError(t+" is not a symbol!");for(var r in z)if(z[r]===t)return r},useSetter:function(){Q=!0},useSimple:function(){Q=!1}}),l(l.S+l.F*!$,"Object",{create:function create(t,r){return void 0===r?T(t):te(T(t),r)},defineProperty:ee,defineProperties:te,getOwnPropertyDescriptor:ne,getOwnPropertyNames:ie,getOwnPropertySymbols:oe});var fe=y((function(){B.f(1)}));l(l.S+l.F*fe,"Object",{getOwnPropertySymbols:function getOwnPropertySymbols(t){return B.f(E(t))}}),U&&l(l.S+l.F*(!$||y((function(){var t=L();return"[null]"!=q([t])||"{}"!=q({a:t})||"{}"!=q(Object(t))}))),"JSON",{stringify:function stringify(t){for(var r,i,a=[t],u=1;arguments.length>u;)a.push(arguments[u++]);if(i=r=a[1],(O(r)||void 0!==t)&&!Z(t))return x(r)||(r=function(t,r){if("function"==typeof i&&(r=i.call(this,t,r)),!Z(r))return r}),a[1]=r,q.apply(U,a)}}),L.prototype[G]||i(19)(L.prototype,G,L.prototype.valueOf),g(L,"Symbol"),g(Math,"Math",!0),g(a.JSON,"JSON",!0)},function(t,r,i){var a=i(33)("meta"),u=i(20),c=i(17),l=i(13).f,p=0,d=Object.isExtensible||function(){return!0},y=!i(21)((function(){return d(Object.preventExtensions({}))})),setMeta=function(t){l(t,a,{value:{i:"O"+ ++p,w:{}}})},h=t.exports={KEY:a,NEED:!1,fastKey:function(t,r){if(!u(t))return"symbol"==typeof t?t:("string"==typeof t?"S":"P")+t;if(!c(t,a)){if(!d(t))return"F";if(!r)return"E";setMeta(t)}return t[a].i},getWeak:function(t,r){if(!c(t,a)){if(!d(t))return!0;if(!r)return!1;setMeta(t)}return t[a].w},onFreeze:function(t){return y&&h.NEED&&d(t)&&!c(t,a)&&setMeta(t),t}}},function(t,r,i){var a=i(31),u=i(49),c=i(34);t.exports=function(t){var r=a(t),i=u.f;if(i)for(var l,p=i(t),d=c.f,y=0;p.length>y;)d.call(t,l=p[y++])&&r.push(l);return r}},function(t,r,i){var a=i(43);t.exports=Array.isArray||function isArray(t){return"Array"==a(t)}},function(t,r,i){var a=i(22),u=i(81).f,c={}.toString,l="object"==typeof window&&window&&Object.getOwnPropertyNames?Object.getOwnPropertyNames(window):[];t.exports.f=function getOwnPropertyNames(t){return l&&"[object Window]"==c.call(t)?function(t){try{return u(t)}catch(t){return l.slice()}}(t):u(a(t))}},function(t,r){},function(t,r,i){i(54)("asyncIterator")},function(t,r,i){i(54)("observable")},function(t,r,i){t.exports={default:i(140),__esModule:!0}},function(t,r,i){i(141),t.exports=i(4).Object.setPrototypeOf},function(t,r,i){var a=i(11);a(a.S,"Object",{setPrototypeOf:i(142).set})},function(t,r,i){var a=i(20),u=i(16),check=function(t,r){if(u(t),!a(r)&&null!==r)throw TypeError(r+": can't set as prototype!")};t.exports={set:Object.setPrototypeOf||("__proto__"in{}?function(t,r,a){try{(a=i(41)(Function.call,i(82).f(Object.prototype,"__proto__").set,2))(t,[]),r=!(t instanceof Array)}catch(t){r=!0}return function setPrototypeOf(t,i){return check(t,i),r?t.__proto__=i:a(t,i),t}}({},!1):void 0),check:check}},function(t,r,i){t.exports={default:i(144),__esModule:!0}},function(t,r,i){i(145);var a=i(4).Object;t.exports=function create(t,r){return a.create(t,r)}},function(t,r,i){var a=i(11);a(a.S,"Object",{create:i(51)})},function(t,r,i){Object.defineProperty(r,"__esModule",{value:!0}),r.CurrencyRatio=r.Currency=void 0;var a=_interopRequireDefault(i(147)),u=_interopRequireDefault(i(151)),c=_interopRequireDefault(i(67)),l=_interopRequireDefault(i(73)),p=_interopRequireDefault(i(76)),d=_interopRequireDefault(i(83)),y=_interopRequireDefault(i(75)),h=_interopRequireDefault(i(159)),g=_interopRequireDefault(i(163));function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}function amountToBigNumber(t){if(t instanceof v||"function"==typeof t.toBigNumber)return t.toBigNumber();var r=(0,g.default)(t);if(r.isNaN())throw new Error('amount "'+t+'" is not a number');return r}var v=r.Currency=function(){function Currency(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;(0,y.default)(this,Currency),"wei"===r&&(r=-18),"ray"===r&&(r=-27),"rad"===r&&(r=-45),this._amount=r?amountToBigNumber(t).shiftedBy(r):amountToBigNumber(t),this.symbol="???"}return(0,h.default)(Currency,[{key:"isEqual",value:function isEqual(t){return this._amount.eq(t._amount)&&this.symbol==t.symbol}},{key:"toString",value:function toString(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:2;return this._amount.toFixed(t)+" "+this.symbol}},{key:"toBigNumber",value:function toBigNumber(){return this._amount}},{key:"toNumber",value:function toNumber(){return this._amount.toNumber()}},{key:"toFixed",value:function toFixed(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:0;return"wei"===t&&(t=18),"ray"===t&&(t=27),"rad"===t&&(t=45),this._amount.shiftedBy(t).integerValue(g.default.ROUND_DOWN).toFixed()}},{key:"isSameType",value:function isSameType(t){return this.symbol===t.symbol}}]),Currency}(),m=r.CurrencyRatio=function(t){function CurrencyRatio(t,r,i,a){(0,y.default)(this,CurrencyRatio);var u=(0,p.default)(this,(CurrencyRatio.__proto__||(0,l.default)(CurrencyRatio)).call(this,t,a));return u.numerator=r,u.denominator=i,u.symbol=r.symbol+"/"+i.symbol,u}return(0,d.default)(CurrencyRatio,t),CurrencyRatio}(v);function bigNumberFnWrapper(t,r){return function(i){!function assertValidOperation(t,r,i){if(!i&&0!==i)throw new Error("Invalid operation: "+r.symbol+" "+t+" with no right operand");if(i instanceof v&&!r.isSameType(i)){if(i instanceof m)switch(t){case"times":if(r.isSameType(i.denominator))return;break;case"div":if(r.isSameType(i.numerator))return}else switch(t){case"div":return}throw new Error("Invalid operation: "+r.symbol+" "+t+" "+i.symbol)}}(t,this,i);var a=i instanceof v?i.toBigNumber():i,u=this.toBigNumber()[t](a);return r?u:function bigNumberFnResult(t,r,i,a){if(i instanceof m)switch(t){case"times":return new i.numerator(a);case"div":return new i.denominator(a)}return i instanceof v&&!r.isSameType(i)?new m(a,r.constructor,i.constructor):r instanceof m?new r.constructor(a,r.numerator,r.denominator,r.shift):new r.constructor(a)}(t,this,i,u)}}(0,c.default)(v.prototype,[["plus","add"],["minus","sub"],["times","multipliedBy","mul"],["div","dividedBy"],["shiftedBy"]].reduce((function(t,r){var i=(0,u.default)(r),c=i[0],l=i.slice(1);t[c]=bigNumberFnWrapper(c);var p=!0,d=!1,y=void 0;try{for(var h,g=(0,a.default)(l);!(p=(h=g.next()).done);p=!0){t[h.value]=t[c]}}catch(t){d=!0,y=t}finally{try{!p&&g.return&&g.return()}finally{if(d)throw y}}return t}),{}),[["isLessThan","lt"],["isLessThanOrEqualTo","lte"],["isGreaterThan","gt"],["isGreaterThanOrEqualTo","gte"],["eq"]].reduce((function(t,r){var i=(0,u.default)(r),c=i[0],l=i.slice(1);t[c]=bigNumberFnWrapper(c,!0);var p=!0,d=!1,y=void 0;try{for(var h,g=(0,a.default)(l);!(p=(h=g.next()).done);p=!0){t[h.value]=t[c]}}catch(t){d=!0,y=t}finally{try{!p&&g.return&&g.return()}finally{if(d)throw y}}return t}),{}))},function(t,r,i){t.exports={default:i(148),__esModule:!0}},function(t,r,i){i(80),i(50),t.exports=i(149)},function(t,r,i){var a=i(16),u=i(84);t.exports=i(4).getIterator=function(t){var r=u(t);if("function"!=typeof r)throw TypeError(t+" is not iterable!");return a(r.call(t))}},function(t,r,i){var a=i(43),u=i(7)("toStringTag"),c="Arguments"==a(function(){return arguments}());t.exports=function(t){var r,i,l;return void 0===t?"Undefined":null===t?"Null":"string"==typeof(i=function(t,r){try{return t[r]}catch(t){}}(r=Object(t),u))?i:c?a(r):"Object"==(l=a(r))&&"function"==typeof r.callee?"Arguments":l}},function(t,r,i){r.__esModule=!0;var a=function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}(i(152));r.default=function(t){return Array.isArray(t)?t:(0,a.default)(t)}},function(t,r,i){t.exports={default:i(153),__esModule:!0}},function(t,r,i){i(50),i(154),t.exports=i(4).Array.from},function(t,r,i){var a=i(41),u=i(11),c=i(27),l=i(155),p=i(156),d=i(72),y=i(157),h=i(84);u(u.S+u.F*!i(158)((function(t){Array.from(t)})),"Array",{from:function from(t){var r,i,u,g,v=c(t),m="function"==typeof this?this:Array,b=arguments.length,_=b>1?arguments[1]:void 0,w=void 0!==_,x=0,S=h(v);if(w&&(_=a(_,b>2?arguments[2]:void 0,2)),null==S||m==Array&&p(S))for(i=new m(r=d(v.length));r>x;x++)y(i,x,w?_(v[x],x):v[x]);else for(g=S.call(v),i=new m;!(u=g.next()).done;x++)y(i,x,w?l(g,_,[u.value,x],!0):u.value);return i.length=x,i}})},function(t,r,i){var a=i(16);t.exports=function(t,r,i,u){try{return u?r(a(i)[0],i[1]):r(i)}catch(r){var c=t.return;throw void 0!==c&&a(c.call(t)),r}}},function(t,r,i){var a=i(28),u=i(7)("iterator"),c=Array.prototype;t.exports=function(t){return void 0!==t&&(a.Array===t||c[u]===t)}},function(t,r,i){var a=i(13),u=i(26);t.exports=function(t,r,i){r in t?a.f(t,r,u(0,i)):t[r]=i}},function(t,r,i){var a=i(7)("iterator"),u=!1;try{var c=[7][a]();c.return=function(){u=!0},Array.from(c,(function(){throw 2}))}catch(t){}t.exports=function(t,r){if(!r&&!u)return!1;var i=!1;try{var c=[7],l=c[a]();l.next=function(){return{done:i=!0}},c[a]=function(){return l},t(c)}catch(t){}return i}},function(t,r,i){r.__esModule=!0;var a=function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}(i(160));r.default=function(){function defineProperties(t,r){for(var i=0;i<r.length;i++){var u=r[i];u.enumerable=u.enumerable||!1,u.configurable=!0,"value"in u&&(u.writable=!0),(0,a.default)(t,u.key,u)}}return function(t,r,i){return r&&defineProperties(t.prototype,r),i&&defineProperties(t,i),t}}()},function(t,r,i){t.exports={default:i(161),__esModule:!0}},function(t,r,i){i(162);var a=i(4).Object;t.exports=function defineProperty(t,r,i){return a.defineProperty(t,r,i)}},function(t,r,i){var a=i(11);a(a.S+a.F*!i(14),"Object",{defineProperty:i(13).f})},function(t,r,i){var a;!function(u){var c,l=/^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i,p="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator,d=Math.ceil,y=Math.floor,h="[BigNumber Error] ",g=h+"Number primitive has more than 15 significant digits: ",v=1e14,m=[1,10,100,1e3,1e4,1e5,1e6,1e7,1e8,1e9,1e10,1e11,1e12,1e13],b=1e9;function bitFloor(t){var r=0|t;return t>0||t===r?r:r-1}function coeffToString(t){for(var r,i,a=1,u=t.length,c=t[0]+"";a<u;){for(i=14-(r=t[a++]+"").length;i--;r="0"+r);c+=r}for(u=c.length;48===c.charCodeAt(--u););return c.slice(0,u+1||1)}function compare(t,r){var i,a,u=t.c,c=r.c,l=t.s,p=r.s,d=t.e,y=r.e;if(!l||!p)return null;if(i=u&&!u[0],a=c&&!c[0],i||a)return i?a?0:-p:l;if(l!=p)return l;if(i=l<0,a=d==y,!u||!c)return a?0:!u^i?1:-1;if(!a)return d>y^i?1:-1;for(p=(d=u.length)<(y=c.length)?d:y,l=0;l<p;l++)if(u[l]!=c[l])return u[l]>c[l]^i?1:-1;return d==y?0:d>y^i?1:-1}function intCheck(t,r,i,a){if(t<r||t>i||t!==y(t))throw Error(h+(a||"Argument")+("number"==typeof t?t<r||t>i?" out of range: ":" not an integer: ":" not a primitive number: ")+String(t))}function isOdd(t){var r=t.c.length-1;return bitFloor(t.e/14)==r&&t.c[r]%2!=0}function toExponential(t,r){return(t.length>1?t.charAt(0)+"."+t.slice(1):t)+(r<0?"e":"e+")+r}function toFixedPoint(t,r,i){var a,u;if(r<0){for(u=i+".";++r;u+=i);t=u+t}else if(++r>(a=t.length)){for(u=i,r-=a;--r;u+=i);t+=u}else r<a&&(t=t.slice(0,r)+"."+t.slice(r));return t}(c=function clone(t){var r,i,a,u,c,_,w,x,S,O=BigNumber.prototype={constructor:BigNumber,toString:null,valueOf:null},E=new BigNumber(1),k=20,A=4,N=-7,T=21,P=-1e7,C=1e7,B=!1,I=1,R=0,j={prefix:"",groupSize:3,secondaryGroupSize:0,groupSeparator:",",decimalSeparator:".",fractionGroupSize:0,fractionGroupSeparator:" ",suffix:""},M="0123456789abcdefghijklmnopqrstuvwxyz";function BigNumber(t,r){var u,c,p,d,h,v,m,b,_=this;if(!(_ instanceof BigNumber))return new BigNumber(t,r);if(null==r){if(t&&!0===t._isBigNumber)return _.s=t.s,void(!t.c||t.e>C?_.c=_.e=null:t.e<P?_.c=[_.e=0]:(_.e=t.e,_.c=t.c.slice()));if((v="number"==typeof t)&&0*t==0){if(_.s=1/t<0?(t=-t,-1):1,t===~~t){for(d=0,h=t;h>=10;h/=10,d++);return void(d>C?_.c=_.e=null:(_.e=d,_.c=[t]))}b=String(t)}else{if(!l.test(b=String(t)))return a(_,b,v);_.s=45==b.charCodeAt(0)?(b=b.slice(1),-1):1}(d=b.indexOf("."))>-1&&(b=b.replace(".","")),(h=b.search(/e/i))>0?(d<0&&(d=h),d+=+b.slice(h+1),b=b.substring(0,h)):d<0&&(d=b.length)}else{if(intCheck(r,2,M.length,"Base"),10==r)return round(_=new BigNumber(t),k+_.e+1,A);if(b=String(t),v="number"==typeof t){if(0*t!=0)return a(_,b,v,r);if(_.s=1/t<0?(b=b.slice(1),-1):1,BigNumber.DEBUG&&b.replace(/^0\.0*|\./,"").length>15)throw Error(g+t)}else _.s=45===b.charCodeAt(0)?(b=b.slice(1),-1):1;for(u=M.slice(0,r),d=h=0,m=b.length;h<m;h++)if(u.indexOf(c=b.charAt(h))<0){if("."==c){if(h>d){d=m;continue}}else if(!p&&(b==b.toUpperCase()&&(b=b.toLowerCase())||b==b.toLowerCase()&&(b=b.toUpperCase()))){p=!0,h=-1,d=0;continue}return a(_,String(t),v,r)}v=!1,(d=(b=i(b,r,10,_.s)).indexOf("."))>-1?b=b.replace(".",""):d=b.length}for(h=0;48===b.charCodeAt(h);h++);for(m=b.length;48===b.charCodeAt(--m););if(b=b.slice(h,++m)){if(m-=h,v&&BigNumber.DEBUG&&m>15&&(t>9007199254740991||t!==y(t)))throw Error(g+_.s*t);if((d=d-h-1)>C)_.c=_.e=null;else if(d<P)_.c=[_.e=0];else{if(_.e=d,_.c=[],h=(d+1)%14,d<0&&(h+=14),h<m){for(h&&_.c.push(+b.slice(0,h)),m-=14;h<m;)_.c.push(+b.slice(h,h+=14));h=14-(b=b.slice(h)).length}else h-=m;for(;h--;b+="0");_.c.push(+b)}}else _.c=[_.e=0]}function format(t,r,i,a){var u,c,l,p,d;if(null==i?i=A:intCheck(i,0,8),!t.c)return t.toString();if(u=t.c[0],l=t.e,null==r)d=coeffToString(t.c),d=1==a||2==a&&(l<=N||l>=T)?toExponential(d,l):toFixedPoint(d,l,"0");else if(c=(t=round(new BigNumber(t),r,i)).e,p=(d=coeffToString(t.c)).length,1==a||2==a&&(r<=c||c<=N)){for(;p<r;d+="0",p++);d=toExponential(d,c)}else if(r-=l,d=toFixedPoint(d,c,"0"),c+1>p){if(--r>0)for(d+=".";r--;d+="0");}else if((r+=c-p)>0)for(c+1==p&&(d+=".");r--;d+="0");return t.s<0&&u?"-"+d:d}function maxOrMin(t,r){for(var i,a=1,u=new BigNumber(t[0]);a<t.length;a++){if(!(i=new BigNumber(t[a])).s){u=i;break}r.call(u,i)&&(u=i)}return u}function normalise(t,r,i){for(var a=1,u=r.length;!r[--u];r.pop());for(u=r[0];u>=10;u/=10,a++);return(i=a+14*i-1)>C?t.c=t.e=null:i<P?t.c=[t.e=0]:(t.e=i,t.c=r),t}function round(t,r,i,a){var u,c,l,p,h,g,b,_=t.c,w=m;if(_){e:{for(u=1,p=_[0];p>=10;p/=10,u++);if((c=r-u)<0)c+=14,l=r,b=(h=_[g=0])/w[u-l-1]%10|0;else if((g=d((c+1)/14))>=_.length){if(!a)break e;for(;_.length<=g;_.push(0));h=b=0,u=1,l=(c%=14)-14+1}else{for(h=p=_[g],u=1;p>=10;p/=10,u++);b=(l=(c%=14)-14+u)<0?0:h/w[u-l-1]%10|0}if(a=a||r<0||null!=_[g+1]||(l<0?h:h%w[u-l-1]),a=i<4?(b||a)&&(0==i||i==(t.s<0?3:2)):b>5||5==b&&(4==i||a||6==i&&(c>0?l>0?h/w[u-l]:0:_[g-1])%10&1||i==(t.s<0?8:7)),r<1||!_[0])return _.length=0,a?(r-=t.e+1,_[0]=w[(14-r%14)%14],t.e=-r||0):_[0]=t.e=0,t;if(0==c?(_.length=g,p=1,g--):(_.length=g+1,p=w[14-c],_[g]=l>0?y(h/w[u-l]%w[l])*p:0),a)for(;;){if(0==g){for(c=1,l=_[0];l>=10;l/=10,c++);for(l=_[0]+=p,p=1;l>=10;l/=10,p++);c!=p&&(t.e++,_[0]==v&&(_[0]=1));break}if(_[g]+=p,_[g]!=v)break;_[g--]=0,p=1}for(c=_.length;0===_[--c];_.pop());}t.e>C?t.c=t.e=null:t.e<P&&(t.c=[t.e=0])}return t}function valueOf(t){var r,i=t.e;return null===i?t.toString():(r=coeffToString(t.c),r=i<=N||i>=T?toExponential(r,i):toFixedPoint(r,i,"0"),t.s<0?"-"+r:r)}return BigNumber.clone=clone,BigNumber.ROUND_UP=0,BigNumber.ROUND_DOWN=1,BigNumber.ROUND_CEIL=2,BigNumber.ROUND_FLOOR=3,BigNumber.ROUND_HALF_UP=4,BigNumber.ROUND_HALF_DOWN=5,BigNumber.ROUND_HALF_EVEN=6,BigNumber.ROUND_HALF_CEIL=7,BigNumber.ROUND_HALF_FLOOR=8,BigNumber.EUCLID=9,BigNumber.config=BigNumber.set=function(t){var r,i;if(null!=t){if("object"!=typeof t)throw Error(h+"Object expected: "+t);if(t.hasOwnProperty(r="DECIMAL_PLACES")&&(intCheck(i=t[r],0,b,r),k=i),t.hasOwnProperty(r="ROUNDING_MODE")&&(intCheck(i=t[r],0,8,r),A=i),t.hasOwnProperty(r="EXPONENTIAL_AT")&&((i=t[r])&&i.pop?(intCheck(i[0],-b,0,r),intCheck(i[1],0,b,r),N=i[0],T=i[1]):(intCheck(i,-b,b,r),N=-(T=i<0?-i:i))),t.hasOwnProperty(r="RANGE"))if((i=t[r])&&i.pop)intCheck(i[0],-b,-1,r),intCheck(i[1],1,b,r),P=i[0],C=i[1];else{if(intCheck(i,-b,b,r),!i)throw Error(h+r+" cannot be zero: "+i);P=-(C=i<0?-i:i)}if(t.hasOwnProperty(r="CRYPTO")){if((i=t[r])!==!!i)throw Error(h+r+" not true or false: "+i);if(i){if("undefined"==typeof crypto||!crypto||!crypto.getRandomValues&&!crypto.randomBytes)throw B=!i,Error(h+"crypto unavailable");B=i}else B=i}if(t.hasOwnProperty(r="MODULO_MODE")&&(intCheck(i=t[r],0,9,r),I=i),t.hasOwnProperty(r="POW_PRECISION")&&(intCheck(i=t[r],0,b,r),R=i),t.hasOwnProperty(r="FORMAT")){if("object"!=typeof(i=t[r]))throw Error(h+r+" not an object: "+i);j=i}if(t.hasOwnProperty(r="ALPHABET")){if("string"!=typeof(i=t[r])||/^.$|[+-.\s]|(.).*\1/.test(i))throw Error(h+r+" invalid: "+i);M=i}}return{DECIMAL_PLACES:k,ROUNDING_MODE:A,EXPONENTIAL_AT:[N,T],RANGE:[P,C],CRYPTO:B,MODULO_MODE:I,POW_PRECISION:R,FORMAT:j,ALPHABET:M}},BigNumber.isBigNumber=function(t){if(!t||!0!==t._isBigNumber)return!1;if(!BigNumber.DEBUG)return!0;var r,i,a=t.c,u=t.e,c=t.s;e:if("[object Array]"=={}.toString.call(a)){if((1===c||-1===c)&&u>=-b&&u<=b&&u===y(u)){if(0===a[0]){if(0===u&&1===a.length)return!0;break e}if((r=(u+1)%14)<1&&(r+=14),String(a[0]).length==r){for(r=0;r<a.length;r++)if((i=a[r])<0||i>=v||i!==y(i))break e;if(0!==i)return!0}}}else if(null===a&&null===u&&(null===c||1===c||-1===c))return!0;throw Error(h+"Invalid BigNumber: "+t)},BigNumber.maximum=BigNumber.max=function(){return maxOrMin(arguments,O.lt)},BigNumber.minimum=BigNumber.min=function(){return maxOrMin(arguments,O.gt)},BigNumber.random=(u=9007199254740992*Math.random()&2097151?function(){return y(9007199254740992*Math.random())}:function(){return 8388608*(1073741824*Math.random()|0)+(8388608*Math.random()|0)},function(t){var r,i,a,c,l,p=0,g=[],v=new BigNumber(E);if(null==t?t=k:intCheck(t,0,b),c=d(t/14),B)if(crypto.getRandomValues){for(r=crypto.getRandomValues(new Uint32Array(c*=2));p<c;)(l=131072*r[p]+(r[p+1]>>>11))>=9e15?(i=crypto.getRandomValues(new Uint32Array(2)),r[p]=i[0],r[p+1]=i[1]):(g.push(l%1e14),p+=2);p=c/2}else{if(!crypto.randomBytes)throw B=!1,Error(h+"crypto unavailable");for(r=crypto.randomBytes(c*=7);p<c;)(l=281474976710656*(31&r[p])+1099511627776*r[p+1]+4294967296*r[p+2]+16777216*r[p+3]+(r[p+4]<<16)+(r[p+5]<<8)+r[p+6])>=9e15?crypto.randomBytes(7).copy(r,p):(g.push(l%1e14),p+=7);p=c/7}if(!B)for(;p<c;)(l=u())<9e15&&(g[p++]=l%1e14);for(t%=14,(c=g[--p])&&t&&(l=m[14-t],g[p]=y(c/l)*l);0===g[p];g.pop(),p--);if(p<0)g=[a=0];else{for(a=-1;0===g[0];g.splice(0,1),a-=14);for(p=1,l=g[0];l>=10;l/=10,p++);p<14&&(a-=14-p)}return v.e=a,v.c=g,v}),BigNumber.sum=function(){for(var t=1,r=arguments,i=new BigNumber(r[0]);t<r.length;)i=i.plus(r[t++]);return i},i=function(){function toBaseOut(t,r,i,a){for(var u,c,l=[0],p=0,d=t.length;p<d;){for(c=l.length;c--;l[c]*=r);for(l[0]+=a.indexOf(t.charAt(p++)),u=0;u<l.length;u++)l[u]>i-1&&(null==l[u+1]&&(l[u+1]=0),l[u+1]+=l[u]/i|0,l[u]%=i)}return l.reverse()}return function(t,i,a,u,c){var l,p,d,y,h,g,v,m,b=t.indexOf("."),_=k,w=A;for(b>=0&&(y=R,R=0,t=t.replace(".",""),g=(m=new BigNumber(i)).pow(t.length-b),R=y,m.c=toBaseOut(toFixedPoint(coeffToString(g.c),g.e,"0"),10,a,"0123456789"),m.e=m.c.length),d=y=(v=toBaseOut(t,i,a,c?(l=M,"0123456789"):(l="0123456789",M))).length;0==v[--y];v.pop());if(!v[0])return l.charAt(0);if(b<0?--d:(g.c=v,g.e=d,g.s=u,v=(g=r(g,m,_,w,a)).c,h=g.r,d=g.e),b=v[p=d+_+1],y=a/2,h=h||p<0||null!=v[p+1],h=w<4?(null!=b||h)&&(0==w||w==(g.s<0?3:2)):b>y||b==y&&(4==w||h||6==w&&1&v[p-1]||w==(g.s<0?8:7)),p<1||!v[0])t=h?toFixedPoint(l.charAt(1),-_,l.charAt(0)):l.charAt(0);else{if(v.length=p,h)for(--a;++v[--p]>a;)v[p]=0,p||(++d,v=[1].concat(v));for(y=v.length;!v[--y];);for(b=0,t="";b<=y;t+=l.charAt(v[b++]));t=toFixedPoint(t,d,l.charAt(0))}return t}}(),r=function(){function multiply(t,r,i){var a,u,c,l,p=0,d=t.length,y=r%1e7,h=r/1e7|0;for(t=t.slice();d--;)p=((u=y*(c=t[d]%1e7)+(a=h*c+(l=t[d]/1e7|0)*y)%1e7*1e7+p)/i|0)+(a/1e7|0)+h*l,t[d]=u%i;return p&&(t=[p].concat(t)),t}function compare(t,r,i,a){var u,c;if(i!=a)c=i>a?1:-1;else for(u=c=0;u<i;u++)if(t[u]!=r[u]){c=t[u]>r[u]?1:-1;break}return c}function subtract(t,r,i,a){for(var u=0;i--;)t[i]-=u,u=t[i]<r[i]?1:0,t[i]=u*a+t[i]-r[i];for(;!t[0]&&t.length>1;t.splice(0,1));}return function(t,r,i,a,u){var c,l,p,d,h,g,m,b,_,w,x,S,O,E,k,A,N,T=t.s==r.s?1:-1,P=t.c,C=r.c;if(!(P&&P[0]&&C&&C[0]))return new BigNumber(t.s&&r.s&&(P?!C||P[0]!=C[0]:C)?P&&0==P[0]||!C?0*T:T/0:NaN);for(_=(b=new BigNumber(T)).c=[],T=i+(l=t.e-r.e)+1,u||(u=v,l=bitFloor(t.e/14)-bitFloor(r.e/14),T=T/14|0),p=0;C[p]==(P[p]||0);p++);if(C[p]>(P[p]||0)&&l--,T<0)_.push(1),d=!0;else{for(E=P.length,A=C.length,p=0,T+=2,(h=y(u/(C[0]+1)))>1&&(C=multiply(C,h,u),P=multiply(P,h,u),A=C.length,E=P.length),O=A,x=(w=P.slice(0,A)).length;x<A;w[x++]=0);N=C.slice(),N=[0].concat(N),k=C[0],C[1]>=u/2&&k++;do{if(h=0,(c=compare(C,w,A,x))<0){if(S=w[0],A!=x&&(S=S*u+(w[1]||0)),(h=y(S/k))>1)for(h>=u&&(h=u-1),m=(g=multiply(C,h,u)).length,x=w.length;1==compare(g,w,m,x);)h--,subtract(g,A<m?N:C,m,u),m=g.length,c=1;else 0==h&&(c=h=1),m=(g=C.slice()).length;if(m<x&&(g=[0].concat(g)),subtract(w,g,x,u),x=w.length,-1==c)for(;compare(C,w,A,x)<1;)h++,subtract(w,A<x?N:C,x,u),x=w.length}else 0===c&&(h++,w=[0]);_[p++]=h,w[0]?w[x++]=P[O]||0:(w=[P[O]],x=1)}while((O++<E||null!=w[0])&&T--);d=null!=w[0],_[0]||_.splice(0,1)}if(u==v){for(p=1,T=_[0];T>=10;T/=10,p++);round(b,i+(b.e=p+14*l-1)+1,a,d)}else b.e=l,b.r=+d;return b}}(),c=/^(-?)0([xbo])(?=\w[\w.]*$)/i,_=/^([^.]+)\.$/,w=/^\.([^.]+)$/,x=/^-?(Infinity|NaN)$/,S=/^\s*\+(?=[\w.])|^\s+|\s+$/g,a=function(t,r,i,a){var u,l=i?r:r.replace(S,"");if(x.test(l))t.s=isNaN(l)?null:l<0?-1:1;else{if(!i&&(l=l.replace(c,(function(t,r,i){return u="x"==(i=i.toLowerCase())?16:"b"==i?2:8,a&&a!=u?t:r})),a&&(u=a,l=l.replace(_,"$1").replace(w,"0.$1")),r!=l))return new BigNumber(l,u);if(BigNumber.DEBUG)throw Error(h+"Not a"+(a?" base "+a:"")+" number: "+r);t.s=null}t.c=t.e=null},O.absoluteValue=O.abs=function(){var t=new BigNumber(this);return t.s<0&&(t.s=1),t},O.comparedTo=function(t,r){return compare(this,new BigNumber(t,r))},O.decimalPlaces=O.dp=function(t,r){var i,a,u,c=this;if(null!=t)return intCheck(t,0,b),null==r?r=A:intCheck(r,0,8),round(new BigNumber(c),t+c.e+1,r);if(!(i=c.c))return null;if(a=14*((u=i.length-1)-bitFloor(this.e/14)),u=i[u])for(;u%10==0;u/=10,a--);return a<0&&(a=0),a},O.dividedBy=O.div=function(t,i){return r(this,new BigNumber(t,i),k,A)},O.dividedToIntegerBy=O.idiv=function(t,i){return r(this,new BigNumber(t,i),0,1)},O.exponentiatedBy=O.pow=function(t,r){var i,a,u,c,l,p,g,v,m=this;if((t=new BigNumber(t)).c&&!t.isInteger())throw Error(h+"Exponent not an integer: "+valueOf(t));if(null!=r&&(r=new BigNumber(r)),l=t.e>14,!m.c||!m.c[0]||1==m.c[0]&&!m.e&&1==m.c.length||!t.c||!t.c[0])return v=new BigNumber(Math.pow(+valueOf(m),l?2-isOdd(t):+valueOf(t))),r?v.mod(r):v;if(p=t.s<0,r){if(r.c?!r.c[0]:!r.s)return new BigNumber(NaN);(a=!p&&m.isInteger()&&r.isInteger())&&(m=m.mod(r))}else{if(t.e>9&&(m.e>0||m.e<-1||(0==m.e?m.c[0]>1||l&&m.c[1]>=24e7:m.c[0]<8e13||l&&m.c[0]<=9999975e7)))return c=m.s<0&&isOdd(t)?-0:0,m.e>-1&&(c=1/c),new BigNumber(p?1/c:c);R&&(c=d(R/14+2))}for(l?(i=new BigNumber(.5),p&&(t.s=1),g=isOdd(t)):g=(u=Math.abs(+valueOf(t)))%2,v=new BigNumber(E);;){if(g){if(!(v=v.times(m)).c)break;c?v.c.length>c&&(v.c.length=c):a&&(v=v.mod(r))}if(u){if(0===(u=y(u/2)))break;g=u%2}else if(round(t=t.times(i),t.e+1,1),t.e>14)g=isOdd(t);else{if(0===(u=+valueOf(t)))break;g=u%2}m=m.times(m),c?m.c&&m.c.length>c&&(m.c.length=c):a&&(m=m.mod(r))}return a?v:(p&&(v=E.div(v)),r?v.mod(r):c?round(v,R,A,void 0):v)},O.integerValue=function(t){var r=new BigNumber(this);return null==t?t=A:intCheck(t,0,8),round(r,r.e+1,t)},O.isEqualTo=O.eq=function(t,r){return 0===compare(this,new BigNumber(t,r))},O.isFinite=function(){return!!this.c},O.isGreaterThan=O.gt=function(t,r){return compare(this,new BigNumber(t,r))>0},O.isGreaterThanOrEqualTo=O.gte=function(t,r){return 1===(r=compare(this,new BigNumber(t,r)))||0===r},O.isInteger=function(){return!!this.c&&bitFloor(this.e/14)>this.c.length-2},O.isLessThan=O.lt=function(t,r){return compare(this,new BigNumber(t,r))<0},O.isLessThanOrEqualTo=O.lte=function(t,r){return-1===(r=compare(this,new BigNumber(t,r)))||0===r},O.isNaN=function(){return!this.s},O.isNegative=function(){return this.s<0},O.isPositive=function(){return this.s>0},O.isZero=function(){return!!this.c&&0==this.c[0]},O.minus=function(t,r){var i,a,u,c,l=this,p=l.s;if(r=(t=new BigNumber(t,r)).s,!p||!r)return new BigNumber(NaN);if(p!=r)return t.s=-r,l.plus(t);var d=l.e/14,y=t.e/14,h=l.c,g=t.c;if(!d||!y){if(!h||!g)return h?(t.s=-r,t):new BigNumber(g?l:NaN);if(!h[0]||!g[0])return g[0]?(t.s=-r,t):new BigNumber(h[0]?l:3==A?-0:0)}if(d=bitFloor(d),y=bitFloor(y),h=h.slice(),p=d-y){for((c=p<0)?(p=-p,u=h):(y=d,u=g),u.reverse(),r=p;r--;u.push(0));u.reverse()}else for(a=(c=(p=h.length)<(r=g.length))?p:r,p=r=0;r<a;r++)if(h[r]!=g[r]){c=h[r]<g[r];break}if(c&&(u=h,h=g,g=u,t.s=-t.s),(r=(a=g.length)-(i=h.length))>0)for(;r--;h[i++]=0);for(r=v-1;a>p;){if(h[--a]<g[a]){for(i=a;i&&!h[--i];h[i]=r);--h[i],h[a]+=v}h[a]-=g[a]}for(;0==h[0];h.splice(0,1),--y);return h[0]?normalise(t,h,y):(t.s=3==A?-1:1,t.c=[t.e=0],t)},O.modulo=O.mod=function(t,i){var a,u,c=this;return t=new BigNumber(t,i),!c.c||!t.s||t.c&&!t.c[0]?new BigNumber(NaN):!t.c||c.c&&!c.c[0]?new BigNumber(c):(9==I?(u=t.s,t.s=1,a=r(c,t,0,3),t.s=u,a.s*=u):a=r(c,t,0,I),(t=c.minus(a.times(t))).c[0]||1!=I||(t.s=c.s),t)},O.multipliedBy=O.times=function(t,r){var i,a,u,c,l,p,d,y,h,g,m,b,_,w,x=this,S=x.c,O=(t=new BigNumber(t,r)).c;if(!(S&&O&&S[0]&&O[0]))return!x.s||!t.s||S&&!S[0]&&!O||O&&!O[0]&&!S?t.c=t.e=t.s=null:(t.s*=x.s,S&&O?(t.c=[0],t.e=0):t.c=t.e=null),t;for(a=bitFloor(x.e/14)+bitFloor(t.e/14),t.s*=x.s,(d=S.length)<(g=O.length)&&(_=S,S=O,O=_,u=d,d=g,g=u),u=d+g,_=[];u--;_.push(0));for(w=v,1e7,u=g;--u>=0;){for(i=0,m=O[u]%1e7,b=O[u]/1e7|0,c=u+(l=d);c>u;)i=((y=m*(y=S[--l]%1e7)+(p=b*y+(h=S[l]/1e7|0)*m)%1e7*1e7+_[c]+i)/w|0)+(p/1e7|0)+b*h,_[c--]=y%w;_[c]=i}return i?++a:_.splice(0,1),normalise(t,_,a)},O.negated=function(){var t=new BigNumber(this);return t.s=-t.s||null,t},O.plus=function(t,r){var i,a=this,u=a.s;if(r=(t=new BigNumber(t,r)).s,!u||!r)return new BigNumber(NaN);if(u!=r)return t.s=-r,a.minus(t);var c=a.e/14,l=t.e/14,p=a.c,d=t.c;if(!c||!l){if(!p||!d)return new BigNumber(u/0);if(!p[0]||!d[0])return d[0]?t:new BigNumber(p[0]?a:0*u)}if(c=bitFloor(c),l=bitFloor(l),p=p.slice(),u=c-l){for(u>0?(l=c,i=d):(u=-u,i=p),i.reverse();u--;i.push(0));i.reverse()}for((u=p.length)-(r=d.length)<0&&(i=d,d=p,p=i,r=u),u=0;r;)u=(p[--r]=p[r]+d[r]+u)/v|0,p[r]=v===p[r]?0:p[r]%v;return u&&(p=[u].concat(p),++l),normalise(t,p,l)},O.precision=O.sd=function(t,r){var i,a,u,c=this;if(null!=t&&t!==!!t)return intCheck(t,1,b),null==r?r=A:intCheck(r,0,8),round(new BigNumber(c),t,r);if(!(i=c.c))return null;if(a=14*(u=i.length-1)+1,u=i[u]){for(;u%10==0;u/=10,a--);for(u=i[0];u>=10;u/=10,a++);}return t&&c.e+1>a&&(a=c.e+1),a},O.shiftedBy=function(t){return intCheck(t,-9007199254740991,9007199254740991),this.times("1e"+t)},O.squareRoot=O.sqrt=function(){var t,i,a,u,c,l=this,p=l.c,d=l.s,y=l.e,h=k+4,g=new BigNumber("0.5");if(1!==d||!p||!p[0])return new BigNumber(!d||d<0&&(!p||p[0])?NaN:p?l:1/0);if(0==(d=Math.sqrt(+valueOf(l)))||d==1/0?(((i=coeffToString(p)).length+y)%2==0&&(i+="0"),d=Math.sqrt(+i),y=bitFloor((y+1)/2)-(y<0||y%2),a=new BigNumber(i=d==1/0?"1e"+y:(i=d.toExponential()).slice(0,i.indexOf("e")+1)+y)):a=new BigNumber(d+""),a.c[0])for((d=(y=a.e)+h)<3&&(d=0);;)if(c=a,a=g.times(c.plus(r(l,c,h,1))),coeffToString(c.c).slice(0,d)===(i=coeffToString(a.c)).slice(0,d)){if(a.e<y&&--d,"9999"!=(i=i.slice(d-3,d+1))&&(u||"4999"!=i)){+i&&(+i.slice(1)||"5"!=i.charAt(0))||(round(a,a.e+k+2,1),t=!a.times(a).eq(l));break}if(!u&&(round(c,c.e+k+2,0),c.times(c).eq(l))){a=c;break}h+=4,d+=4,u=1}return round(a,a.e+k+1,A,t)},O.toExponential=function(t,r){return null!=t&&(intCheck(t,0,b),t++),format(this,t,r,1)},O.toFixed=function(t,r){return null!=t&&(intCheck(t,0,b),t=t+this.e+1),format(this,t,r)},O.toFormat=function(t,r,i){var a,u=this;if(null==i)null!=t&&r&&"object"==typeof r?(i=r,r=null):t&&"object"==typeof t?(i=t,t=r=null):i=j;else if("object"!=typeof i)throw Error(h+"Argument not an object: "+i);if(a=u.toFixed(t,r),u.c){var c,l=a.split("."),p=+i.groupSize,d=+i.secondaryGroupSize,y=i.groupSeparator||"",g=l[0],v=l[1],m=u.s<0,b=m?g.slice(1):g,_=b.length;if(d&&(c=p,p=d,d=c,_-=c),p>0&&_>0){for(c=_%p||p,g=b.substr(0,c);c<_;c+=p)g+=y+b.substr(c,p);d>0&&(g+=y+b.slice(c)),m&&(g="-"+g)}a=v?g+(i.decimalSeparator||"")+((d=+i.fractionGroupSize)?v.replace(new RegExp("\\d{"+d+"}\\B","g"),"$&"+(i.fractionGroupSeparator||"")):v):g}return(i.prefix||"")+a+(i.suffix||"")},O.toFraction=function(t){var i,a,u,c,l,p,d,y,g,v,b,_,w=this,x=w.c;if(null!=t&&(!(d=new BigNumber(t)).isInteger()&&(d.c||1!==d.s)||d.lt(E)))throw Error(h+"Argument "+(d.isInteger()?"out of range: ":"not an integer: ")+valueOf(d));if(!x)return new BigNumber(w);for(i=new BigNumber(E),g=a=new BigNumber(E),u=y=new BigNumber(E),_=coeffToString(x),l=i.e=_.length-w.e-1,i.c[0]=m[(p=l%14)<0?14+p:p],t=!t||d.comparedTo(i)>0?l>0?i:g:d,p=C,C=1/0,d=new BigNumber(_),y.c[0]=0;v=r(d,i,0,1),1!=(c=a.plus(v.times(u))).comparedTo(t);)a=u,u=c,g=y.plus(v.times(c=g)),y=c,i=d.minus(v.times(c=i)),d=c;return c=r(t.minus(a),u,0,1),y=y.plus(c.times(g)),a=a.plus(c.times(u)),y.s=g.s=w.s,b=r(g,u,l*=2,A).minus(w).abs().comparedTo(r(y,a,l,A).minus(w).abs())<1?[g,u]:[y,a],C=p,b},O.toNumber=function(){return+valueOf(this)},O.toPrecision=function(t,r){return null!=t&&intCheck(t,1,b),format(this,t,r,2)},O.toString=function(t){var r,a=this,u=a.s,c=a.e;return null===c?u?(r="Infinity",u<0&&(r="-"+r)):r="NaN":(null==t?r=c<=N||c>=T?toExponential(coeffToString(a.c),c):toFixedPoint(coeffToString(a.c),c,"0"):10===t?r=toFixedPoint(coeffToString((a=round(new BigNumber(a),k+c+1,A)).c),a.e,"0"):(intCheck(t,2,M.length,"Base"),r=i(toFixedPoint(coeffToString(a.c),c,"0"),10,t,u,!0)),u<0&&a.c[0]&&(r="-"+r)),r},O.valueOf=O.toJSON=function(){return valueOf(this)},O._isBigNumber=!0,p&&(O[Symbol.toStringTag]="BigNumber",O[Symbol.for("nodejs.util.inspect.custom")]=O.valueOf),null!=t&&BigNumber.set(t),BigNumber}()).default=c.BigNumber=c,void 0===(a=function(){return c}.call(r,i,r,t))||(t.exports=a)}()},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(23)),c=a(i(8)),l=a(i(9)),p=a(i(1)),d=a(i(2)),y=a(i(87)),h=a(i(5)),g=a(i(6)),v=a(i(3)),m=a(i(25)),b=i(18),_=i(10),w=i(24),x=i(108);function _createForOfIteratorHelper(t){if("undefined"==typeof Symbol||null==t[Symbol.iterator]){if(Array.isArray(t)||(t=function _unsupportedIterableToArray(t,r){if(!t)return;if("string"==typeof t)return _arrayLikeToArray(t,r);var i=Object.prototype.toString.call(t).slice(8,-1);"Object"===i&&t.constructor&&(i=t.constructor.name);if("Map"===i||"Set"===i)return Array.from(t);if("Arguments"===i||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(i))return _arrayLikeToArray(t,r)}(t))){var r=0,i=function F(){};return{s:i,n:function n(){return r>=t.length?{done:!0}:{done:!1,value:t[r++]}},e:function e(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,u,c=!0,l=!1;return{s:function s(){a=t[Symbol.iterator]()},n:function n(){var t=a.next();return c=t.done,t},e:function e(t){l=!0,u=t},f:function f(){try{c||null==a.return||a.return()}finally{if(l)throw u}}}}function _arrayLikeToArray(t,r){(null==r||r>t.length)&&(r=t.length);for(var i=0,a=new Array(r);i<r;i++)a[i]=t[i];return a}function ownKeys(t,r){var i=Object.keys(t);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(t);r&&(a=a.filter((function(r){return Object.getOwnPropertyDescriptor(t,r).enumerable}))),i.push.apply(i,a)}return i}function _objectSpread(t){for(var r=1;r<arguments.length;r++){var i=null!=arguments[r]?arguments[r]:{};r%2?ownKeys(Object(i),!0).forEach((function(r){(0,m.default)(t,r,i[r])})):Object.getOwnPropertyDescriptors?Object.defineProperties(t,Object.getOwnPropertyDescriptors(i)):ownKeys(Object(i)).forEach((function(r){Object.defineProperty(t,r,Object.getOwnPropertyDescriptor(i,r))}))}return t}function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,v.default)(t);if(r){var u=(0,v.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,g.default)(this,i)}}var S=a(i(102)).default.chief,O=function(t){(0,h.default)(ChiefService,t);var r,i,a=_createSuper(ChiefService);function ChiefService(){var t,r=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"chief";return(0,p.default)(this,ChiefService),t=a.call(this,r,["smartContract","web3"]),(0,m.default)((0,y.default)(t),"paddedBytes32ToAddress",(function(t){return t.length>42?"0x"+(0,x.takeLast)(40,t):t})),(0,m.default)((0,y.default)(t),"parseVoteAddressData",(function(t){for(var r=[],i=t.substr(330),a=0;a<i.length/64;a++){var u="0x".concat(i.substring(64*a+24,64*(a+1)));42===u.length&&r.push(u)}return r})),(0,m.default)((0,y.default)(t),"memoizedGetSlateAddresses",(0,x.memoizeWith)(x.identity,t.getSlateAddresses)),(0,m.default)((0,y.default)(t),"getDetailedLockLogs",(0,l.default)(c.default.mark((function _callee(){var r,i,a,u,l;return c.default.wrap((function _callee$(c){for(;;)switch(c.prev=c.next){case 0:return r=t._chiefContract().address,i=t.get("web3"),a=i.network,u=(0,w.netIdToName)(a),c.next=6,i.getPastLogs({fromBlock:S.inception_block[u],toBlock:"latest",address:r,topics:[S.events.lock]});case 6:return l=c.sent,c.abrupt("return",l.map((function(r){return{blockNumber:r.blockNumber,sender:t.paddedBytes32ToAddress(r.topics[1]),amount:_.MKR.wei(r.topics[2])}})));case 8:case"end":return c.stop()}}),_callee)})))),(0,m.default)((0,y.default)(t),"getDetailedFreeLogs",(0,l.default)(c.default.mark((function _callee2(){var r,i,a,u,l;return c.default.wrap((function _callee2$(c){for(;;)switch(c.prev=c.next){case 0:return r=t._chiefContract().address,i=t.get("web3"),a=i.network,u=(0,w.netIdToName)(a),c.next=6,i.getPastLogs({fromBlock:S.inception_block[u],toBlock:"latest",address:r,topics:[S.events.free]});case 6:return l=c.sent,c.abrupt("return",l.map((function(r){return{blockNumber:r.blockNumber,sender:t.paddedBytes32ToAddress(r.topics[1]),amount:_.MKR.wei(r.topics[2])}})));case 8:case"end":return c.stop()}}),_callee2)})))),(0,m.default)((0,y.default)(t),"getLockLogs",(0,l.default)(c.default.mark((function _callee3(){var r,i,a,u,l;return c.default.wrap((function _callee3$(c){for(;;)switch(c.prev=c.next){case 0:return r=t._chiefContract().address,i=t.get("web3"),a=i.network,u=(0,w.netIdToName)(a),c.next=6,i.getPastLogs({fromBlock:S.inception_block[u],toBlock:"latest",address:r,topics:[S.events.lock]});case 6:return l=c.sent,c.abrupt("return",(0,x.uniq)(l.map((function(t){return(0,x.nth)(1,t.topics)})).map(t.paddedBytes32ToAddress)));case 8:case"end":return c.stop()}}),_callee3)})))),(0,m.default)((0,y.default)(t),"getVoteAddressLogs",(0,l.default)(c.default.mark((function _callee4(){var r,i,a,u,l;return c.default.wrap((function _callee4$(c){for(;;)switch(c.prev=c.next){case 0:return r=t._chiefContract().address,i=t.get("web3"),a=i.network,u=(0,w.netIdToName)(a),c.next=6,i.getPastLogs({fromBlock:S.inception_block[u],toBlock:"latest",address:r,topics:[S.events.vote_addresses]});case 6:return l=c.sent,c.abrupt("return",l.map((function(r){return{blockNumber:r.blockNumber,sender:t.paddedBytes32ToAddress(r.topics[1]),candidates:t.parseVoteAddressData(r.data)}})));case 8:case"end":return c.stop()}}),_callee4)})))),(0,m.default)((0,y.default)(t),"getVoteSlateLogs",(0,l.default)(c.default.mark((function _callee5(){var r,i,a,u,l;return c.default.wrap((function _callee5$(c){for(;;)switch(c.prev=c.next){case 0:return r=t._chiefContract().address,i=t.get("web3"),a=i.network,u=(0,w.netIdToName)(a),c.next=6,i.getPastLogs({fromBlock:S.inception_block[u],toBlock:"latest",address:r,topics:[S.events.vote_slate]});case 6:return l=c.sent,c.abrupt("return",l.map((function(r){return{blockNumber:r.blockNumber,sender:t.paddedBytes32ToAddress(r.topics[1]),slate:r.topics[2]}})));case 8:case"end":return c.stop()}}),_callee5)})))),t}return(0,d.default)(ChiefService,[{key:"etch",value:function etch(t){return this._chiefContract().etch(t)}},{key:"lift",value:function lift(t){return this._chiefContract().lift(t)}},{key:"vote",value:function vote(t){return Array.isArray(t)?this._chiefContract()["vote(address[])"](t):this._chiefContract()["vote(bytes32)"](t)}},{key:"lock",value:function lock(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:_.MKR,i=(0,w.getCurrency)(t,r).toFixed("wei");return this._chiefContract().lock(i)}},{key:"free",value:function free(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:_.MKR,i=(0,w.getCurrency)(t,r).toFixed("wei");return this._chiefContract().free(i)}},{key:"getVoteTally",value:(i=(0,l.default)(c.default.mark((function _callee6(){var t,r,i,a,l,p,d,y,h,g,v,m,b,_,w=this;return c.default.wrap((function _callee6$(c){for(;;)switch(c.prev=c.next){case 0:return c.next=2,this.getLockLogs();case 2:return t=c.sent,c.next=5,Promise.all(t.map((function(t){return w.getNumDeposits(t).then((function(r){return{address:t,deposits:parseFloat(r)}}))})));case 5:return r=c.sent,c.next=8,Promise.all(r.map((function(t){return w.getVotedSlate(t.address).then((function(r){return _objectSpread(_objectSpread({},t),{},{slate:r})}))})));case 8:return i=c.sent,c.next=11,Promise.all(i.map((function(t){return w.memoizedGetSlateAddresses(t.slate).then((function(r){return _objectSpread(_objectSpread({},t),{},{votes:r})}))})));case 11:a=c.sent,l={},p=_createForOfIteratorHelper(a);try{for(p.s();!(d=p.n()).done;){y=d.value,h=_createForOfIteratorHelper(y.votes);try{for(h.s();!(g=h.n()).done;)v=(v=g.value).toLowerCase(),void 0===l[v]?l[v]={approvals:y.deposits,addresses:[{address:y.address,deposits:y.deposits}]}:(l[v].approvals+=y.deposits,l[v].addresses.push({address:y.address,deposits:y.deposits}))}catch(t){h.e(t)}finally{h.f()}}}catch(t){p.e(t)}finally{p.f()}for(m=function _loop(){var t=(0,u.default)(_[b],2),r=t[0],i=t[1].addresses.sort((function(t,r){return r.deposits-t.deposits})),a=l[r].approvals,c=i.map((function(t){return _objectSpread(_objectSpread({},t),{},{percent:(100*t.deposits/a).toFixed(2)})}));l[r]=c},b=0,_=Object.entries(l);b<_.length;b++)m();return c.abrupt("return",l);case 18:case"end":return c.stop()}}),_callee6,this)}))),function getVoteTally(){return i.apply(this,arguments)})},{key:"getVotedSlate",value:function getVotedSlate(t){return this._chiefContract().votes(t)}},{key:"getNumDeposits",value:function getNumDeposits(t){return this._chiefContract().deposits(t).then(_.MKR.wei)}},{key:"getApprovalCount",value:function getApprovalCount(t){return this._chiefContract().approvals(t).then(_.MKR.wei)}},{key:"getHat",value:function getHat(){return this._chiefContract().hat()}},{key:"getSlateAddresses",value:(r=(0,l.default)(c.default.mark((function _callee7(t){var r,i=arguments;return c.default.wrap((function _callee7$(a){for(;;)switch(a.prev=a.next){case 0:return r=i.length>1&&void 0!==i[1]?i[1]:0,a.prev=1,a.next=4,this._chiefContract().slates(t,r);case 4:return a.t1=a.sent,a.t0=[a.t1],a.next=8,this.getSlateAddresses(t,r+1);case 8:return a.t2=a.sent,a.abrupt("return",a.t0.concat.call(a.t0,a.t2));case 12:return a.prev=12,a.t3=a.catch(1),a.abrupt("return",[]);case 15:case"end":return a.stop()}}),_callee7,this,[[1,12]])}))),function getSlateAddresses(t){return r.apply(this,arguments)})},{key:"getLockAddressLogs",value:function getLockAddressLogs(){var t=this;return new Promise((function(r,i){t._chiefContract({web3js:!0}).LogNote({sig:"0xdd467064"},{fromBlock:0,toBlock:"latest"}).get((function(t,a){t&&i(t),r(a.map((function(t){return t.args.guy})))}))}))}},{key:"getEtchSlateLogs",value:function getEtchSlateLogs(){var t=this;return new Promise((function(r,i){t._chiefContract({web3js:!0}).Etch({},{fromBlock:0,toBlock:"latest"}).get((function(t,a){t&&i(t),r(a.map((function(t){return t.args.slate})))}))}))}},{key:"_chiefContract",value:function _chiefContract(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{},r=t.web3js,i=void 0!==r&&r;return i?this.get("smartContract").getWeb3ContractByName(_.CHIEF):this.get("smartContract").getContractByName(_.CHIEF)}}]),ChiefService}(b.LocalService);r.default=O},function(t,r){t.exports=function _arrayWithHoles(t){if(Array.isArray(t))return t}},function(t,r){t.exports=function _iterableToArrayLimit(t,r){if("undefined"!=typeof Symbol&&Symbol.iterator in Object(t)){var i=[],a=!0,u=!1,c=void 0;try{for(var l,p=t[Symbol.iterator]();!(a=(l=p.next()).done)&&(i.push(l.value),!r||i.length!==r);a=!0);}catch(t){u=!0,c=t}finally{try{a||null==p.return||p.return()}finally{if(u)throw c}}return i}}},function(t,r){t.exports=function _nonIterableRest(){throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}},function(t,r,i){var a=function(t){var r=Object.prototype,i=r.hasOwnProperty,a="function"==typeof Symbol?Symbol:{},u=a.iterator||"@@iterator",c=a.asyncIterator||"@@asyncIterator",l=a.toStringTag||"@@toStringTag";function wrap(t,r,i,a){var u=r&&r.prototype instanceof Generator?r:Generator,c=Object.create(u.prototype),l=new Context(a||[]);return c._invoke=function makeInvokeMethod(t,r,i){var a="suspendedStart";return function invoke(u,c){if("executing"===a)throw new Error("Generator is already running");if("completed"===a){if("throw"===u)throw c;return doneResult()}for(i.method=u,i.arg=c;;){var l=i.delegate;if(l){var d=maybeInvokeDelegate(l,i);if(d){if(d===p)continue;return d}}if("next"===i.method)i.sent=i._sent=i.arg;else if("throw"===i.method){if("suspendedStart"===a)throw a="completed",i.arg;i.dispatchException(i.arg)}else"return"===i.method&&i.abrupt("return",i.arg);a="executing";var y=tryCatch(t,r,i);if("normal"===y.type){if(a=i.done?"completed":"suspendedYield",y.arg===p)continue;return{value:y.arg,done:i.done}}"throw"===y.type&&(a="completed",i.method="throw",i.arg=y.arg)}}}(t,i,l),c}function tryCatch(t,r,i){try{return{type:"normal",arg:t.call(r,i)}}catch(t){return{type:"throw",arg:t}}}t.wrap=wrap;var p={};function Generator(){}function GeneratorFunction(){}function GeneratorFunctionPrototype(){}var d={};d[u]=function(){return this};var y=Object.getPrototypeOf,h=y&&y(y(values([])));h&&h!==r&&i.call(h,u)&&(d=h);var g=GeneratorFunctionPrototype.prototype=Generator.prototype=Object.create(d);function defineIteratorMethods(t){["next","throw","return"].forEach((function(r){t[r]=function(t){return this._invoke(r,t)}}))}function AsyncIterator(t,r){var a;this._invoke=function enqueue(u,c){function callInvokeWithMethodAndArg(){return new r((function(a,l){!function invoke(a,u,c,l){var p=tryCatch(t[a],t,u);if("throw"!==p.type){var d=p.arg,y=d.value;return y&&"object"==typeof y&&i.call(y,"__await")?r.resolve(y.__await).then((function(t){invoke("next",t,c,l)}),(function(t){invoke("throw",t,c,l)})):r.resolve(y).then((function(t){d.value=t,c(d)}),(function(t){return invoke("throw",t,c,l)}))}l(p.arg)}(u,c,a,l)}))}return a=a?a.then(callInvokeWithMethodAndArg,callInvokeWithMethodAndArg):callInvokeWithMethodAndArg()}}function maybeInvokeDelegate(t,r){var i=t.iterator[r.method];if(void 0===i){if(r.delegate=null,"throw"===r.method){if(t.iterator.return&&(r.method="return",r.arg=void 0,maybeInvokeDelegate(t,r),"throw"===r.method))return p;r.method="throw",r.arg=new TypeError("The iterator does not provide a 'throw' method")}return p}var a=tryCatch(i,t.iterator,r.arg);if("throw"===a.type)return r.method="throw",r.arg=a.arg,r.delegate=null,p;var u=a.arg;return u?u.done?(r[t.resultName]=u.value,r.next=t.nextLoc,"return"!==r.method&&(r.method="next",r.arg=void 0),r.delegate=null,p):u:(r.method="throw",r.arg=new TypeError("iterator result is not an object"),r.delegate=null,p)}function pushTryEntry(t){var r={tryLoc:t[0]};1 in t&&(r.catchLoc=t[1]),2 in t&&(r.finallyLoc=t[2],r.afterLoc=t[3]),this.tryEntries.push(r)}function resetTryEntry(t){var r=t.completion||{};r.type="normal",delete r.arg,t.completion=r}function Context(t){this.tryEntries=[{tryLoc:"root"}],t.forEach(pushTryEntry,this),this.reset(!0)}function values(t){if(t){var r=t[u];if(r)return r.call(t);if("function"==typeof t.next)return t;if(!isNaN(t.length)){var a=-1,c=function next(){for(;++a<t.length;)if(i.call(t,a))return next.value=t[a],next.done=!1,next;return next.value=void 0,next.done=!0,next};return c.next=c}}return{next:doneResult}}function doneResult(){return{value:void 0,done:!0}}return GeneratorFunction.prototype=g.constructor=GeneratorFunctionPrototype,GeneratorFunctionPrototype.constructor=GeneratorFunction,GeneratorFunctionPrototype[l]=GeneratorFunction.displayName="GeneratorFunction",t.isGeneratorFunction=function(t){var r="function"==typeof t&&t.constructor;return!!r&&(r===GeneratorFunction||"GeneratorFunction"===(r.displayName||r.name))},t.mark=function(t){return Object.setPrototypeOf?Object.setPrototypeOf(t,GeneratorFunctionPrototype):(t.__proto__=GeneratorFunctionPrototype,l in t||(t[l]="GeneratorFunction")),t.prototype=Object.create(g),t},t.awrap=function(t){return{__await:t}},defineIteratorMethods(AsyncIterator.prototype),AsyncIterator.prototype[c]=function(){return this},t.AsyncIterator=AsyncIterator,t.async=function(r,i,a,u,c){void 0===c&&(c=Promise);var l=new AsyncIterator(wrap(r,i,a,u),c);return t.isGeneratorFunction(i)?l:l.next().then((function(t){return t.done?t.value:l.next()}))},defineIteratorMethods(g),g[l]="Generator",g[u]=function(){return this},g.toString=function(){return"[object Generator]"},t.keys=function(t){var r=[];for(var i in t)r.push(i);return r.reverse(),function next(){for(;r.length;){var i=r.pop();if(i in t)return next.value=i,next.done=!1,next}return next.done=!0,next}},t.values=values,Context.prototype={constructor:Context,reset:function(t){if(this.prev=0,this.next=0,this.sent=this._sent=void 0,this.done=!1,this.delegate=null,this.method="next",this.arg=void 0,this.tryEntries.forEach(resetTryEntry),!t)for(var r in this)"t"===r.charAt(0)&&i.call(this,r)&&!isNaN(+r.slice(1))&&(this[r]=void 0)},stop:function(){this.done=!0;var t=this.tryEntries[0].completion;if("throw"===t.type)throw t.arg;return this.rval},dispatchException:function(t){if(this.done)throw t;var r=this;function handle(i,a){return c.type="throw",c.arg=t,r.next=i,a&&(r.method="next",r.arg=void 0),!!a}for(var a=this.tryEntries.length-1;a>=0;--a){var u=this.tryEntries[a],c=u.completion;if("root"===u.tryLoc)return handle("end");if(u.tryLoc<=this.prev){var l=i.call(u,"catchLoc"),p=i.call(u,"finallyLoc");if(l&&p){if(this.prev<u.catchLoc)return handle(u.catchLoc,!0);if(this.prev<u.finallyLoc)return handle(u.finallyLoc)}else if(l){if(this.prev<u.catchLoc)return handle(u.catchLoc,!0)}else{if(!p)throw new Error("try statement without catch or finally");if(this.prev<u.finallyLoc)return handle(u.finallyLoc)}}}},abrupt:function(t,r){for(var a=this.tryEntries.length-1;a>=0;--a){var u=this.tryEntries[a];if(u.tryLoc<=this.prev&&i.call(u,"finallyLoc")&&this.prev<u.finallyLoc){var c=u;break}}c&&("break"===t||"continue"===t)&&c.tryLoc<=r&&r<=c.finallyLoc&&(c=null);var l=c?c.completion:{};return l.type=t,l.arg=r,c?(this.method="next",this.next=c.finallyLoc,p):this.complete(l)},complete:function(t,r){if("throw"===t.type)throw t.arg;return"break"===t.type||"continue"===t.type?this.next=t.arg:"return"===t.type?(this.rval=this.arg=t.arg,this.method="return",this.next="end"):"normal"===t.type&&r&&(this.next=r),p},finish:function(t){for(var r=this.tryEntries.length-1;r>=0;--r){var i=this.tryEntries[r];if(i.finallyLoc===t)return this.complete(i.completion,i.afterLoc),resetTryEntry(i),p}},catch:function(t){for(var r=this.tryEntries.length-1;r>=0;--r){var i=this.tryEntries[r];if(i.tryLoc===t){var a=i.completion;if("throw"===a.type){var u=a.arg;resetTryEntry(i)}return u}}throw new Error("illegal catch attempt")},delegateYield:function(t,r,i){return this.delegate={iterator:values(t),resultName:r,nextLoc:i},"next"===this.method&&(this.arg=void 0),p}},t}(t.exports);try{regeneratorRuntime=a}catch(t){Function("r","regeneratorRuntime = r")(a)}},function(t,r,i){var a=i(170);function _get(r,i,u){return"undefined"!=typeof Reflect&&Reflect.get?t.exports=_get=Reflect.get:t.exports=_get=function _get(t,r,i){var u=a(t,r);if(u){var c=Object.getOwnPropertyDescriptor(u,r);return c.get?c.get.call(i):c.value}},_get(r,i,u||r)}t.exports=_get},function(t,r,i){var a=i(3);t.exports=function _superPropBase(t,r){for(;!Object.prototype.hasOwnProperty.call(t,r)&&null!==(t=a(t)););return t}},function(t,r){t.exports=function _isNativeFunction(t){return-1!==Function.toString.call(t).indexOf("[native code]")}},function(t,r,i){var a=i(55),u=i(173);function _construct(r,i,c){return u()?t.exports=_construct=Reflect.construct:t.exports=_construct=function _construct(t,r,i){var u=[null];u.push.apply(u,r);var c=new(Function.bind.apply(t,u));return i&&a(c,i.prototype),c},_construct.apply(null,arguments)}t.exports=_construct},function(t,r){t.exports=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}},function(t,r,i){var a=i(58),u=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var c=u(i(1)),l=u(i(2)),p=u(i(89)),d=u(i(59)),y=a(i(29)),h=(0,u(i(175)).default)("dai:ServiceManagerBase");function _promisify(t){return new Promise((function(r,i){try{r(t())}catch(t){i(t.message)}}))}var g=function(){function ServiceManagerBase(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null,r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null,i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null;if((0,c.default)(this,ServiceManagerBase),null!==t&&"function"!=typeof t)throw new Error("Invalid argument init: not a function or null.");if(null===t&&(t=function init(){return Promise.resolve()}),null!==r&&"function"!=typeof r)throw new Error("Invalid argument connect: not a function or null.");if(null===r&&null!==i&&(r=function connect(){return Promise.resolve()}),null!==i&&"function"!=typeof i)throw new Error("Invalid argument auth: not a function or null.");this._init=t,this._connect=r,this._auth=i,this._type=null===i?null===r?y.default.LOCAL:y.default.PUBLIC:y.default.PRIVATE,this._state=new p.default(d.default.CREATED,y.serviceTypeTransitions[this._type]),this._initPromise=null,this._connectPromise=null,this._authPromise=null}return(0,l.default)(ServiceManagerBase,[{key:"initialize",value:function initialize(t){var r=this;if(this._state.inState(d.default.CREATED)){if(this._initPromise)throw new Error("Unexpected init promise in state CREATED.");this._state.transitionTo(d.default.INITIALIZING),this._initPromise=_promisify((function(){return r._init(t)})).then((function(){return r._state.transitionTo(r._type===y.default.LOCAL?d.default.READY:d.default.OFFLINE)}),(function(t){throw h(t),r._state.transitionTo(d.default.CREATED),t}))}return this._initPromise}},{key:"connect",value:function connect(){var t=this;return this._type===y.default.LOCAL?this.initialize():(this._state.inState([d.default.CREATED,d.default.INITIALIZING,d.default.OFFLINE])&&null===this._connectPromise&&(this._connectPromise=this.initialize().then((function(){return t._state.transitionTo(d.default.CONNECTING),_promisify((function(){return t._connect((function(){return t._disconnect()}))})).then((function(){t._state.inState(d.default.CONNECTING)&&t._state.transitionTo(t._type===y.default.PUBLIC?d.default.READY:d.default.ONLINE)}),(function(r){throw h("connect error:",r),t._state.inState(d.default.CONNECTING)&&t._state.transitionTo(d.default.OFFLINE),r}))}))),this._connectPromise)}},{key:"authenticate",value:function authenticate(){var t=this;return this._type!==y.default.PRIVATE?this.connect():(this._state.inState([d.default.CREATED,d.default.INITIALIZING,d.default.OFFLINE,d.default.CONNECTING,d.default.ONLINE])&&null===this._authPromise&&(this._authPromise=this.connect().then((function(){return t._state.transitionTo(d.default.AUTHENTICATING),_promisify((function(){return t._auth((function(){return t._deauthenticate()}))})).then((function(){t._state.inState(d.default.AUTHENTICATING)&&t._state.transitionTo(d.default.READY)}),(function(r){h("authenticate error: "+r),t._state.inState(d.default.AUTHENTICATING)&&t._state.transitionTo(d.default.ONLINE)}))}))),this._authPromise)}},{key:"settings",value:function settings(t){return this._settings=t,this}},{key:"state",value:function state(){return this._state.state()}},{key:"type",value:function type(){return this._type}},{key:"isInitialized",value:function isInitialized(){return!this._state.inState([d.default.CREATED,d.default.INITIALIZING])}},{key:"isConnected",value:function isConnected(){return this._type===y.default.LOCAL?null:this._state.inState([d.default.ONLINE,d.default.AUTHENTICATING,d.default.READY])}},{key:"isAuthenticated",value:function isAuthenticated(){return this._type===y.default.PRIVATE?this._state.inState(d.default.READY):null}},{key:"isReady",value:function isReady(){return this._state.inState(d.default.READY)}},{key:"onInitialized",value:function onInitialized(t){return this._state.onStateChanged((function(r,i){r!==d.default.INITIALIZING||i!==d.default.OFFLINE&&i!==d.default.READY||t()})),this}},{key:"onConnected",value:function onConnected(t){return this._state.onStateChanged((function(r,i){r!==d.default.CONNECTING||i!==d.default.ONLINE&&i!==d.default.READY||t()})),this}},{key:"onDisconnected",value:function onDisconnected(t){return this._state.onStateChanged((function(r,i){i!==d.default.OFFLINE||r!==d.default.ONLINE&&r!==d.default.READY||t()})),this}},{key:"onAuthenticated",value:function onAuthenticated(t){return this._state.onStateChanged((function(r,i){r===d.default.AUTHENTICATING&&i===d.default.READY&&t()})),this}},{key:"onDeauthenticated",value:function onDeauthenticated(t){return this.type()===y.default.PRIVATE&&this._state.onStateChanged((function(r,i){i!==d.default.OFFLINE&&i!==d.default.ONLINE||r!==d.default.READY||t()})),this}},{key:"onReady",value:function onReady(t){return this._state.onStateChanged((function(r,i){i===d.default.READY&&t()})),this}},{key:"onStateChanged",value:function onStateChanged(t){return this._state.onStateChanged(t),this}},{key:"_disconnect",value:function _disconnect(){if(this._type===y.default.LOCAL)throw new Error("_disconnect must not be called on a Local Service");this._state.inState(d.default.AUTHENTICATING)&&this._deauthenticate(),this._state.inState([d.default.READY,d.default.ONLINE,d.default.CONNECTING])&&(this._authPromise=null,this._connectPromise=null,this._state.transitionTo(d.default.OFFLINE))}},{key:"_deauthenticate",value:function _deauthenticate(){if(this._type!==y.default.PRIVATE)throw new Error("_deauthenticate must not be called on a Local or Public Service");this._state.inState([d.default.READY,d.default.AUTHENTICATING])&&(this._authPromise=null,this._state.transitionTo(d.default.ONLINE))}}]),ServiceManagerBase}();r.default=g},function(t,r,i){(function(a){function load(){var t;try{t=r.storage.debug}catch(t){}return!t&&void 0!==a&&"env"in a&&(t=a.env.DEBUG),t}(r=t.exports=i(176)).log=function log(){return"object"==typeof console&&console.log&&Function.prototype.apply.call(console.log,console,arguments)},r.formatArgs=function formatArgs(t){var i=this.useColors;if(t[0]=(i?"%c":"")+this.namespace+(i?" %c":" ")+t[0]+(i?"%c ":" ")+"+"+r.humanize(this.diff),!i)return;var a="color: "+this.color;t.splice(1,0,a,"color: inherit");var u=0,c=0;t[0].replace(/%[a-zA-Z%]/g,(function(t){"%%"!==t&&(u++,"%c"===t&&(c=u))})),t.splice(c,0,a)},r.save=function save(t){try{null==t?r.storage.removeItem("debug"):r.storage.debug=t}catch(t){}},r.load=load,r.useColors=function useColors(){if("undefined"!=typeof window&&window.process&&"renderer"===window.process.type)return!0;return"undefined"!=typeof document&&document.documentElement&&document.documentElement.style&&document.documentElement.style.WebkitAppearance||"undefined"!=typeof window&&window.console&&(window.console.firebug||window.console.exception&&window.console.table)||"undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/)&&parseInt(RegExp.$1,10)>=31||"undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/applewebkit\/(\d+)/)},r.storage="undefined"!=typeof chrome&&void 0!==chrome.storage?chrome.storage.local:function localstorage(){try{return window.localStorage}catch(t){}}(),r.colors=["lightseagreen","forestgreen","goldenrod","dodgerblue","darkorchid","crimson"],r.formatters.j=function(t){try{return JSON.stringify(t)}catch(t){return"[UnexpectedJSONParseError]: "+t.message}},r.enable(load())}).call(this,i(90))},function(t,r,i){var a;function createDebug(t){function debug(){if(debug.enabled){var t=debug,i=+new Date,u=i-(a||i);t.diff=u,t.prev=a,t.curr=i,a=i;for(var c=new Array(arguments.length),l=0;l<c.length;l++)c[l]=arguments[l];c[0]=r.coerce(c[0]),"string"!=typeof c[0]&&c.unshift("%O");var p=0;c[0]=c[0].replace(/%([a-zA-Z%])/g,(function(i,a){if("%%"===i)return i;p++;var u=r.formatters[a];if("function"==typeof u){var l=c[p];i=u.call(t,l),c.splice(p,1),p--}return i})),r.formatArgs.call(t,c);var d=debug.log||r.log||console.log.bind(console);d.apply(t,c)}}return debug.namespace=t,debug.enabled=r.enabled(t),debug.useColors=r.useColors(),debug.color=function selectColor(t){var i,a=0;for(i in t)a=(a<<5)-a+t.charCodeAt(i),a|=0;return r.colors[Math.abs(a)%r.colors.length]}(t),"function"==typeof r.init&&r.init(debug),debug}(r=t.exports=createDebug.debug=createDebug.default=createDebug).coerce=function coerce(t){return t instanceof Error?t.stack||t.message:t},r.disable=function disable(){r.enable("")},r.enable=function enable(t){r.save(t),r.names=[],r.skips=[];for(var i=("string"==typeof t?t:"").split(/[\s,]+/),a=i.length,u=0;u<a;u++)i[u]&&("-"===(t=i[u].replace(/\*/g,".*?"))[0]?r.skips.push(new RegExp("^"+t.substr(1)+"$")):r.names.push(new RegExp("^"+t+"$")))},r.enabled=function enabled(t){var i,a;for(i=0,a=r.skips.length;i<a;i++)if(r.skips[i].test(t))return!1;for(i=0,a=r.names.length;i<a;i++)if(r.names[i].test(t))return!0;return!1},r.humanize=i(177),r.names=[],r.skips=[],r.formatters={}},function(t,r){var i=1e3,a=6e4,u=60*a,c=24*u;function plural(t,r,i){if(!(t<r))return t<1.5*r?Math.floor(t/r)+" "+i:Math.ceil(t/r)+" "+i+"s"}t.exports=function(t,r){r=r||{};var l=typeof t;if("string"===l&&t.length>0)return function parse(t){if((t=String(t)).length>100)return;var r=/^((?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|years?|yrs?|y)?$/i.exec(t);if(!r)return;var l=parseFloat(r[1]);switch((r[2]||"ms").toLowerCase()){case"years":case"year":case"yrs":case"yr":case"y":return 315576e5*l;case"days":case"day":case"d":return l*c;case"hours":case"hour":case"hrs":case"hr":case"h":return l*u;case"minutes":case"minute":case"mins":case"min":case"m":return l*a;case"seconds":case"second":case"secs":case"sec":case"s":return l*i;case"milliseconds":case"millisecond":case"msecs":case"msec":case"ms":return l;default:return}}(t);if("number"===l&&!1===isNaN(t))return r.long?function fmtLong(t){return plural(t,c,"day")||plural(t,u,"hour")||plural(t,a,"minute")||plural(t,i,"second")||t+" ms"}(t):function fmtShort(t){if(t>=c)return Math.round(t/c)+"d";if(t>=u)return Math.round(t/u)+"h";if(t>=a)return Math.round(t/a)+"m";if(t>=i)return Math.round(t/i)+"s";return t+"ms"}(t);throw new Error("val is not a non-empty string or a valid number. val="+JSON.stringify(t))}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(15)),c=a(i(23)),l=a(i(1)),p=a(i(2)),d=a(i(91)),y=a(i(95)),h=a(i(88));function _createForOfIteratorHelper(t){if("undefined"==typeof Symbol||null==t[Symbol.iterator]){if(Array.isArray(t)||(t=function _unsupportedIterableToArray(t,r){if(!t)return;if("string"==typeof t)return _arrayLikeToArray(t,r);var i=Object.prototype.toString.call(t).slice(8,-1);"Object"===i&&t.constructor&&(i=t.constructor.name);if("Map"===i||"Set"===i)return Array.from(t);if("Arguments"===i||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(i))return _arrayLikeToArray(t,r)}(t))){var r=0,i=function F(){};return{s:i,n:function n(){return r>=t.length?{done:!0}:{done:!1,value:t[r++]}},e:function e(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,u,c=!0,l=!1;return{s:function s(){a=t[Symbol.iterator]()},n:function n(){var t=a.next();return c=t.done,t},e:function e(t){l=!0,u=t},f:function f(){try{c||null==a.return||a.return()}finally{if(l)throw u}}}}function _arrayLikeToArray(t,r){(null==r||r>t.length)&&(r=t.length);for(var i=0,a=new Array(r);i<r;i++)a[i]=t[i];return a}var g=function(){function ServiceProvider(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},i=r.services,a=void 0===i?{}:i,u=r.defaults,c=void 0===u?{}:u,p=r.disabled,d=void 0===p?{}:p;(0,l.default)(this,ServiceProvider),this._config=t,this._services=a,this._resolver={defaults:c,disabled:d}}return(0,p.default)(ServiceProvider,[{key:"supports",value:function supports(t){return!!this._services[t]}},{key:"buildContainer",value:function buildContainer(){var t=new y.default;for(var r in this._config){var i=(0,h.default)(r,this._config[r],this._resolver),a=(0,c.default)(i,2),l=a[0],p=a[1],d=void 0;if("object"==(0,u.default)(l))d=l;else if("function"==typeof l)d=new l;else{if(!this.supports(l)&&"exchange"===r)throw new Error("This service has been extracted from dai.js. Please refer to the documentation to add it as a plugin: \n\n https://github.com/makerdao/dai.js/wiki/Basic-Usage-(Plugins)");if(!this.supports(l))throw new Error("Unsupported service in configuration: "+l);d=new this._services[l]}var g=d.manager().name();if(g!==r)throw new Error('Role mismatch: "'.concat(g,'", "').concat(r,'"'));d.manager().settings(p),t.register(d,r)}return this._registerDependencies(t),t.injectDependencies(),this._container=t,t}},{key:"_registerDependencies",value:function _registerDependencies(t){var r=t.getRegisteredServiceNames(),i=r.reduce((function(r,i){var a=t.service(i).manager().dependencies();return(0,d.default)(r.concat(a))}),[]).filter((function(t){return!r.includes(t)}));if(0!==i.length){var a,u=_createForOfIteratorHelper(i);try{for(u.s();!(a=u.n()).done;){var c=a.value,l=this._resolver.defaults[c];if("string"==typeof l&&(l=this._services[l]),!l)throw new Error('No service found for "'.concat(c,'"'));t.register(new l,c)}}catch(t){u.e(t)}finally{u.f()}this._registerDependencies(t)}}},{key:"service",value:function service(t){return this._container||this.buildContainer(),this._container.service(t)}}]),ServiceProvider}();r.default=g},function(t,r,i){var a=i(180),u=i(211),c=i(216),l=i(217),p=i(218),d=i(94);t.exports=function baseUniq(t,r,i){var y=-1,h=u,g=t.length,v=!0,m=[],b=m;if(i)v=!1,h=c;else if(g>=200){var _=r?null:p(t);if(_)return d(_);v=!1,h=l,b=new a}else b=r?[]:m;e:for(;++y<g;){var w=t[y],x=r?r(w):w;if(w=i||0!==w?w:0,v&&x==x){for(var S=b.length;S--;)if(b[S]===x)continue e;r&&b.push(x),m.push(w)}else h(b,x,i)||(b!==m&&b.push(x),m.push(w))}return m}},function(t,r,i){var a=i(181),u=i(209),c=i(210);function SetCache(t){var r=-1,i=null==t?0:t.length;for(this.__data__=new a;++r<i;)this.add(t[r])}SetCache.prototype.add=SetCache.prototype.push=u,SetCache.prototype.has=c,t.exports=SetCache},function(t,r,i){var a=i(182),u=i(204),c=i(206),l=i(207),p=i(208);function MapCache(t){var r=-1,i=null==t?0:t.length;for(this.clear();++r<i;){var a=t[r];this.set(a[0],a[1])}}MapCache.prototype.clear=a,MapCache.prototype.delete=u,MapCache.prototype.get=c,MapCache.prototype.has=l,MapCache.prototype.set=p,t.exports=MapCache},function(t,r,i){var a=i(183),u=i(196),c=i(203);t.exports=function mapCacheClear(){this.size=0,this.__data__={hash:new a,map:new(c||u),string:new a}}},function(t,r,i){var a=i(184),u=i(192),c=i(193),l=i(194),p=i(195);function Hash(t){var r=-1,i=null==t?0:t.length;for(this.clear();++r<i;){var a=t[r];this.set(a[0],a[1])}}Hash.prototype.clear=a,Hash.prototype.delete=u,Hash.prototype.get=c,Hash.prototype.has=l,Hash.prototype.set=p,t.exports=Hash},function(t,r,i){var a=i(36);t.exports=function hashClear(){this.__data__=a?a(null):{},this.size=0}},function(t,r,i){var a=i(92),u=i(188),c=i(63),l=i(190),p=/^\[object .+?Constructor\]$/,d=Function.prototype,y=Object.prototype,h=d.toString,g=y.hasOwnProperty,v=RegExp("^"+h.call(g).replace(/[\\^$.*+?()[\]{}|]/g,"\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,"$1.*?")+"$");t.exports=function baseIsNative(t){return!(!c(t)||u(t))&&(a(t)?v:p).test(l(t))}},function(t,r,i){var a=i(61),u=Object.prototype,c=u.hasOwnProperty,l=u.toString,p=a?a.toStringTag:void 0;t.exports=function getRawTag(t){var r=c.call(t,p),i=t[p];try{t[p]=void 0;var a=!0}catch(t){}var u=l.call(t);return a&&(r?t[p]=i:delete t[p]),u}},function(t,r){var i=Object.prototype.toString;t.exports=function objectToString(t){return i.call(t)}},function(t,r,i){var a,u=i(189),c=(a=/[^.]+$/.exec(u&&u.keys&&u.keys.IE_PROTO||""))?"Symbol(src)_1."+a:"";t.exports=function isMasked(t){return!!c&&c in t}},function(t,r,i){var a=i(30)["__core-js_shared__"];t.exports=a},function(t,r){var i=Function.prototype.toString;t.exports=function toSource(t){if(null!=t){try{return i.call(t)}catch(t){}try{return t+""}catch(t){}}return""}},function(t,r){t.exports=function getValue(t,r){return null==t?void 0:t[r]}},function(t,r){t.exports=function hashDelete(t){var r=this.has(t)&&delete this.__data__[t];return this.size-=r?1:0,r}},function(t,r,i){var a=i(36),u=Object.prototype.hasOwnProperty;t.exports=function hashGet(t){var r=this.__data__;if(a){var i=r[t];return"__lodash_hash_undefined__"===i?void 0:i}return u.call(r,t)?r[t]:void 0}},function(t,r,i){var a=i(36),u=Object.prototype.hasOwnProperty;t.exports=function hashHas(t){var r=this.__data__;return a?void 0!==r[t]:u.call(r,t)}},function(t,r,i){var a=i(36);t.exports=function hashSet(t,r){var i=this.__data__;return this.size+=this.has(t)?0:1,i[t]=a&&void 0===r?"__lodash_hash_undefined__":r,this}},function(t,r,i){var a=i(197),u=i(198),c=i(200),l=i(201),p=i(202);function ListCache(t){var r=-1,i=null==t?0:t.length;for(this.clear();++r<i;){var a=t[r];this.set(a[0],a[1])}}ListCache.prototype.clear=a,ListCache.prototype.delete=u,ListCache.prototype.get=c,ListCache.prototype.has=l,ListCache.prototype.set=p,t.exports=ListCache},function(t,r){t.exports=function listCacheClear(){this.__data__=[],this.size=0}},function(t,r,i){var a=i(38),u=Array.prototype.splice;t.exports=function listCacheDelete(t){var r=this.__data__,i=a(r,t);return!(i<0)&&(i==r.length-1?r.pop():u.call(r,i,1),--this.size,!0)}},function(t,r){t.exports=function eq(t,r){return t===r||t!=t&&r!=r}},function(t,r,i){var a=i(38);t.exports=function listCacheGet(t){var r=this.__data__,i=a(r,t);return i<0?void 0:r[i][1]}},function(t,r,i){var a=i(38);t.exports=function listCacheHas(t){return a(this.__data__,t)>-1}},function(t,r,i){var a=i(38);t.exports=function listCacheSet(t,r){var i=this.__data__,u=a(i,t);return u<0?(++this.size,i.push([t,r])):i[u][1]=r,this}},function(t,r,i){var a=i(60)(i(30),"Map");t.exports=a},function(t,r,i){var a=i(39);t.exports=function mapCacheDelete(t){var r=a(this,t).delete(t);return this.size-=r?1:0,r}},function(t,r){t.exports=function isKeyable(t){var r=typeof t;return"string"==r||"number"==r||"symbol"==r||"boolean"==r?"__proto__"!==t:null===t}},function(t,r,i){var a=i(39);t.exports=function mapCacheGet(t){return a(this,t).get(t)}},function(t,r,i){var a=i(39);t.exports=function mapCacheHas(t){return a(this,t).has(t)}},function(t,r,i){var a=i(39);t.exports=function mapCacheSet(t,r){var i=a(this,t),u=i.size;return i.set(t,r),this.size+=i.size==u?0:1,this}},function(t,r){t.exports=function setCacheAdd(t){return this.__data__.set(t,"__lodash_hash_undefined__"),this}},function(t,r){t.exports=function setCacheHas(t){return this.__data__.has(t)}},function(t,r,i){var a=i(212);t.exports=function arrayIncludes(t,r){return!!(null==t?0:t.length)&&a(t,r,0)>-1}},function(t,r,i){var a=i(213),u=i(214),c=i(215);t.exports=function baseIndexOf(t,r,i){return r==r?c(t,r,i):a(t,u,i)}},function(t,r){t.exports=function baseFindIndex(t,r,i,a){for(var u=t.length,c=i+(a?1:-1);a?c--:++c<u;)if(r(t[c],c,t))return c;return-1}},function(t,r){t.exports=function baseIsNaN(t){return t!=t}},function(t,r){t.exports=function strictIndexOf(t,r,i){for(var a=i-1,u=t.length;++a<u;)if(t[a]===r)return a;return-1}},function(t,r){t.exports=function arrayIncludesWith(t,r,i){for(var a=-1,u=null==t?0:t.length;++a<u;)if(i(r,t[a]))return!0;return!1}},function(t,r){t.exports=function cacheHas(t,r){return t.has(r)}},function(t,r,i){var a=i(219),u=i(220),c=i(94),l=a&&1/c(new a([,-0]))[1]==1/0?function(t){return new a(t)}:u;t.exports=l},function(t,r,i){var a=i(60)(i(30),"Set");t.exports=a},function(t,r){t.exports=function noop(){}},function(t,r,i){var a=i(222),u=i(223);t.exports=function values(t){return null==t?[]:a(t,u(t))}},function(t,r,i){var a=i(96);t.exports=function baseValues(t,r){return a(r,(function(r){return t[r]}))}},function(t,r,i){var a=i(224),u=i(234),c=i(238);t.exports=function keys(t){return c(t)?a(t):u(t)}},function(t,r,i){var a=i(97),u=i(225),c=i(98),l=i(227),p=i(229),d=i(230),y=Object.prototype.hasOwnProperty;t.exports=function arrayLikeKeys(t,r){var i=c(t),h=!i&&u(t),g=!i&&!h&&l(t),v=!i&&!h&&!g&&d(t),m=i||h||g||v,b=m?a(t.length,String):[],_=b.length;for(var w in t)!r&&!y.call(t,w)||m&&("length"==w||g&&("offset"==w||"parent"==w)||v&&("buffer"==w||"byteLength"==w||"byteOffset"==w)||p(w,_))||b.push(w);return b}},function(t,r,i){var a=i(226),u=i(40),c=Object.prototype,l=c.hasOwnProperty,p=c.propertyIsEnumerable,d=a(function(){return arguments}())?a:function(t){return u(t)&&l.call(t,"callee")&&!p.call(t,"callee")};t.exports=d},function(t,r,i){var a=i(37),u=i(40);t.exports=function baseIsArguments(t){return u(t)&&"[object Arguments]"==a(t)}},function(t,r,i){(function(t){var a=i(30),u=i(228),c=r&&!r.nodeType&&r,l=c&&"object"==typeof t&&t&&!t.nodeType&&t,p=l&&l.exports===c?a.Buffer:void 0,d=(p?p.isBuffer:void 0)||u;t.exports=d}).call(this,i(99)(t))},function(t,r){t.exports=function stubFalse(){return!1}},function(t,r){var i=/^(?:0|[1-9]\d*)$/;t.exports=function isIndex(t,r){var a=typeof t;return!!(r=null==r?9007199254740991:r)&&("number"==a||"symbol"!=a&&i.test(t))&&t>-1&&t%1==0&&t<r}},function(t,r,i){var a=i(231),u=i(232),c=i(233),l=c&&c.isTypedArray,p=l?u(l):a;t.exports=p},function(t,r,i){var a=i(37),u=i(100),c=i(40),l={};l["[object Float32Array]"]=l["[object Float64Array]"]=l["[object Int8Array]"]=l["[object Int16Array]"]=l["[object Int32Array]"]=l["[object Uint8Array]"]=l["[object Uint8ClampedArray]"]=l["[object Uint16Array]"]=l["[object Uint32Array]"]=!0,l["[object Arguments]"]=l["[object Array]"]=l["[object ArrayBuffer]"]=l["[object Boolean]"]=l["[object DataView]"]=l["[object Date]"]=l["[object Error]"]=l["[object Function]"]=l["[object Map]"]=l["[object Number]"]=l["[object Object]"]=l["[object RegExp]"]=l["[object Set]"]=l["[object String]"]=l["[object WeakMap]"]=!1,t.exports=function baseIsTypedArray(t){return c(t)&&u(t.length)&&!!l[a(t)]}},function(t,r){t.exports=function baseUnary(t){return function(r){return t(r)}}},function(t,r,i){(function(t){var a=i(93),u=r&&!r.nodeType&&r,c=u&&"object"==typeof t&&t&&!t.nodeType&&t,l=c&&c.exports===u&&a.process,p=function(){try{var t=c&&c.require&&c.require("util").types;return t||l&&l.binding&&l.binding("util")}catch(t){}}();t.exports=p}).call(this,i(99)(t))},function(t,r,i){var a=i(235),u=i(236),c=Object.prototype.hasOwnProperty;t.exports=function baseKeys(t){if(!a(t))return u(t);var r=[];for(var i in Object(t))c.call(t,i)&&"constructor"!=i&&r.push(i);return r}},function(t,r){var i=Object.prototype;t.exports=function isPrototype(t){var r=t&&t.constructor;return t===("function"==typeof r&&r.prototype||i)}},function(t,r,i){var a=i(237)(Object.keys,Object);t.exports=a},function(t,r){t.exports=function overArg(t,r){return function(i){return t(r(i))}}},function(t,r,i){var a=i(92),u=i(100);t.exports=function isArrayLike(t){return null!=t&&u(t.length)&&!a(t)}},function(t,r){function toposort(t,r){var i=t.length,a=new Array(i),u={},c=i,l=function makeOutgoingEdges(t){for(var r=new Map,i=0,a=t.length;i<a;i++){var u=t[i];r.has(u[0])||r.set(u[0],new Set),r.has(u[1])||r.set(u[1],new Set),r.get(u[0]).add(u[1])}return r}(r),p=function makeNodesHash(t){for(var r=new Map,i=0,a=t.length;i<a;i++)r.set(t[i],i);return r}(t);for(r.forEach((function(t){if(!p.has(t[0])||!p.has(t[1]))throw new Error("Unknown node. There is an unknown node in the supplied edges.")}));c--;)u[c]||visit(t[c],c,new Set);return a;function visit(t,r,c){if(c.has(t)){var d;try{d=", node was:"+JSON.stringify(t)}catch(t){d=""}throw new Error("Cyclic dependency"+d)}if(!p.has(t))throw new Error("Found unknown node. Make sure to provided all involved nodes. Unknown node: "+JSON.stringify(t));if(!u[r]){u[r]=!0;var y=l.get(t)||new Set;if(r=(y=Array.from(y)).length){c.add(t);do{var h=y[--r];visit(h,p.get(h),c)}while(r);c.delete(t)}a[--i]=t}}}t.exports=function(t){return toposort(function uniqueNodes(t){for(var r=new Set,i=0,a=t.length;i<a;i++){var u=t[i];r.add(u[0]),r.add(u[1])}return Array.from(r)}(t),t)},t.exports.array=toposort},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(5)),l=a(i(6)),p=a(i(3)),d=a(i(29));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,p.default)(t);if(r){var u=(0,p.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,l.default)(this,i)}}var y=function(t){(0,c.default)(LocalService,t);var r=_createSuper(LocalService);function LocalService(t){var i=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];return(0,u.default)(this,LocalService),r.call(this,d.default.LOCAL,t,i)}return LocalService}(a(i(35)).default);r.default=y},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(5)),l=a(i(6)),p=a(i(3)),d=a(i(29));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,p.default)(t);if(r){var u=(0,p.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,l.default)(this,i)}}var y=function(t){(0,c.default)(PublicService,t);var r=_createSuper(PublicService);function PublicService(t){var i=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];return(0,u.default)(this,PublicService),r.call(this,d.default.PUBLIC,t,i)}return PublicService}(a(i(35)).default);r.default=y},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(5)),l=a(i(6)),p=a(i(3)),d=a(i(29));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,p.default)(t);if(r){var u=(0,p.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,l.default)(this,i)}}var y=function(t){(0,c.default)(PrivateService,t);var r=_createSuper(PrivateService);function PrivateService(t){var i=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];return(0,u.default)(this,PrivateService),r.call(this,d.default.PRIVATE,t,i)}return PrivateService}(a(i(35)).default);r.default=y},function(t,r,i){(function(t){var a=i(244),u=i(245),c=i(246);function kMaxLength(){return Buffer.TYPED_ARRAY_SUPPORT?2147483647:1073741823}function createBuffer(t,r){if(kMaxLength()<r)throw new RangeError("Invalid typed array length");return Buffer.TYPED_ARRAY_SUPPORT?(t=new Uint8Array(r)).__proto__=Buffer.prototype:(null===t&&(t=new Buffer(r)),t.length=r),t}function Buffer(t,r,i){if(!(Buffer.TYPED_ARRAY_SUPPORT||this instanceof Buffer))return new Buffer(t,r,i);if("number"==typeof t){if("string"==typeof r)throw new Error("If encoding is specified then the first argument must be a string");return allocUnsafe(this,t)}return from(this,t,r,i)}function from(t,r,i,a){if("number"==typeof r)throw new TypeError('"value" argument must not be a number');return"undefined"!=typeof ArrayBuffer&&r instanceof ArrayBuffer?function fromArrayBuffer(t,r,i,a){if(r.byteLength,i<0||r.byteLength<i)throw new RangeError("'offset' is out of bounds");if(r.byteLength<i+(a||0))throw new RangeError("'length' is out of bounds");r=void 0===i&&void 0===a?new Uint8Array(r):void 0===a?new Uint8Array(r,i):new Uint8Array(r,i,a);Buffer.TYPED_ARRAY_SUPPORT?(t=r).__proto__=Buffer.prototype:t=fromArrayLike(t,r);return t}(t,r,i,a):"string"==typeof r?function fromString(t,r,i){"string"==typeof i&&""!==i||(i="utf8");if(!Buffer.isEncoding(i))throw new TypeError('"encoding" must be a valid string encoding');var a=0|byteLength(r,i),u=(t=createBuffer(t,a)).write(r,i);u!==a&&(t=t.slice(0,u));return t}(t,r,i):function fromObject(t,r){if(Buffer.isBuffer(r)){var i=0|checked(r.length);return 0===(t=createBuffer(t,i)).length||r.copy(t,0,0,i),t}if(r){if("undefined"!=typeof ArrayBuffer&&r.buffer instanceof ArrayBuffer||"length"in r)return"number"!=typeof r.length||function isnan(t){return t!=t}(r.length)?createBuffer(t,0):fromArrayLike(t,r);if("Buffer"===r.type&&c(r.data))return fromArrayLike(t,r.data)}throw new TypeError("First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.")}(t,r)}function assertSize(t){if("number"!=typeof t)throw new TypeError('"size" argument must be a number');if(t<0)throw new RangeError('"size" argument must not be negative')}function allocUnsafe(t,r){if(assertSize(r),t=createBuffer(t,r<0?0:0|checked(r)),!Buffer.TYPED_ARRAY_SUPPORT)for(var i=0;i<r;++i)t[i]=0;return t}function fromArrayLike(t,r){var i=r.length<0?0:0|checked(r.length);t=createBuffer(t,i);for(var a=0;a<i;a+=1)t[a]=255&r[a];return t}function checked(t){if(t>=kMaxLength())throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x"+kMaxLength().toString(16)+" bytes");return 0|t}function byteLength(t,r){if(Buffer.isBuffer(t))return t.length;if("undefined"!=typeof ArrayBuffer&&"function"==typeof ArrayBuffer.isView&&(ArrayBuffer.isView(t)||t instanceof ArrayBuffer))return t.byteLength;"string"!=typeof t&&(t=""+t);var i=t.length;if(0===i)return 0;for(var a=!1;;)switch(r){case"ascii":case"latin1":case"binary":return i;case"utf8":case"utf-8":case void 0:return utf8ToBytes(t).length;case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return 2*i;case"hex":return i>>>1;case"base64":return base64ToBytes(t).length;default:if(a)return utf8ToBytes(t).length;r=(""+r).toLowerCase(),a=!0}}function slowToString(t,r,i){var a=!1;if((void 0===r||r<0)&&(r=0),r>this.length)return"";if((void 0===i||i>this.length)&&(i=this.length),i<=0)return"";if((i>>>=0)<=(r>>>=0))return"";for(t||(t="utf8");;)switch(t){case"hex":return hexSlice(this,r,i);case"utf8":case"utf-8":return utf8Slice(this,r,i);case"ascii":return asciiSlice(this,r,i);case"latin1":case"binary":return latin1Slice(this,r,i);case"base64":return base64Slice(this,r,i);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return utf16leSlice(this,r,i);default:if(a)throw new TypeError("Unknown encoding: "+t);t=(t+"").toLowerCase(),a=!0}}function swap(t,r,i){var a=t[r];t[r]=t[i],t[i]=a}function bidirectionalIndexOf(t,r,i,a,u){if(0===t.length)return-1;if("string"==typeof i?(a=i,i=0):i>2147483647?i=2147483647:i<-2147483648&&(i=-2147483648),i=+i,isNaN(i)&&(i=u?0:t.length-1),i<0&&(i=t.length+i),i>=t.length){if(u)return-1;i=t.length-1}else if(i<0){if(!u)return-1;i=0}if("string"==typeof r&&(r=Buffer.from(r,a)),Buffer.isBuffer(r))return 0===r.length?-1:arrayIndexOf(t,r,i,a,u);if("number"==typeof r)return r&=255,Buffer.TYPED_ARRAY_SUPPORT&&"function"==typeof Uint8Array.prototype.indexOf?u?Uint8Array.prototype.indexOf.call(t,r,i):Uint8Array.prototype.lastIndexOf.call(t,r,i):arrayIndexOf(t,[r],i,a,u);throw new TypeError("val must be string, number or Buffer")}function arrayIndexOf(t,r,i,a,u){var c,l=1,p=t.length,d=r.length;if(void 0!==a&&("ucs2"===(a=String(a).toLowerCase())||"ucs-2"===a||"utf16le"===a||"utf-16le"===a)){if(t.length<2||r.length<2)return-1;l=2,p/=2,d/=2,i/=2}function read(t,r){return 1===l?t[r]:t.readUInt16BE(r*l)}if(u){var y=-1;for(c=i;c<p;c++)if(read(t,c)===read(r,-1===y?0:c-y)){if(-1===y&&(y=c),c-y+1===d)return y*l}else-1!==y&&(c-=c-y),y=-1}else for(i+d>p&&(i=p-d),c=i;c>=0;c--){for(var h=!0,g=0;g<d;g++)if(read(t,c+g)!==read(r,g)){h=!1;break}if(h)return c}return-1}function hexWrite(t,r,i,a){i=Number(i)||0;var u=t.length-i;a?(a=Number(a))>u&&(a=u):a=u;var c=r.length;if(c%2!=0)throw new TypeError("Invalid hex string");a>c/2&&(a=c/2);for(var l=0;l<a;++l){var p=parseInt(r.substr(2*l,2),16);if(isNaN(p))return l;t[i+l]=p}return l}function utf8Write(t,r,i,a){return blitBuffer(utf8ToBytes(r,t.length-i),t,i,a)}function asciiWrite(t,r,i,a){return blitBuffer(function asciiToBytes(t){for(var r=[],i=0;i<t.length;++i)r.push(255&t.charCodeAt(i));return r}(r),t,i,a)}function latin1Write(t,r,i,a){return asciiWrite(t,r,i,a)}function base64Write(t,r,i,a){return blitBuffer(base64ToBytes(r),t,i,a)}function ucs2Write(t,r,i,a){return blitBuffer(function utf16leToBytes(t,r){for(var i,a,u,c=[],l=0;l<t.length&&!((r-=2)<0);++l)i=t.charCodeAt(l),a=i>>8,u=i%256,c.push(u),c.push(a);return c}(r,t.length-i),t,i,a)}function base64Slice(t,r,i){return 0===r&&i===t.length?a.fromByteArray(t):a.fromByteArray(t.slice(r,i))}function utf8Slice(t,r,i){i=Math.min(t.length,i);for(var a=[],u=r;u<i;){var c,l,p,d,y=t[u],h=null,g=y>239?4:y>223?3:y>191?2:1;if(u+g<=i)switch(g){case 1:y<128&&(h=y);break;case 2:128==(192&(c=t[u+1]))&&(d=(31&y)<<6|63&c)>127&&(h=d);break;case 3:c=t[u+1],l=t[u+2],128==(192&c)&&128==(192&l)&&(d=(15&y)<<12|(63&c)<<6|63&l)>2047&&(d<55296||d>57343)&&(h=d);break;case 4:c=t[u+1],l=t[u+2],p=t[u+3],128==(192&c)&&128==(192&l)&&128==(192&p)&&(d=(15&y)<<18|(63&c)<<12|(63&l)<<6|63&p)>65535&&d<1114112&&(h=d)}null===h?(h=65533,g=1):h>65535&&(h-=65536,a.push(h>>>10&1023|55296),h=56320|1023&h),a.push(h),u+=g}return function decodeCodePointsArray(t){var r=t.length;if(r<=4096)return String.fromCharCode.apply(String,t);var i="",a=0;for(;a<r;)i+=String.fromCharCode.apply(String,t.slice(a,a+=4096));return i}(a)}r.Buffer=Buffer,r.SlowBuffer=function SlowBuffer(t){+t!=t&&(t=0);return Buffer.alloc(+t)},r.INSPECT_MAX_BYTES=50,Buffer.TYPED_ARRAY_SUPPORT=void 0!==t.TYPED_ARRAY_SUPPORT?t.TYPED_ARRAY_SUPPORT:function typedArraySupport(){try{var t=new Uint8Array(1);return t.__proto__={__proto__:Uint8Array.prototype,foo:function(){return 42}},42===t.foo()&&"function"==typeof t.subarray&&0===t.subarray(1,1).byteLength}catch(t){return!1}}(),r.kMaxLength=kMaxLength(),Buffer.poolSize=8192,Buffer._augment=function(t){return t.__proto__=Buffer.prototype,t},Buffer.from=function(t,r,i){return from(null,t,r,i)},Buffer.TYPED_ARRAY_SUPPORT&&(Buffer.prototype.__proto__=Uint8Array.prototype,Buffer.__proto__=Uint8Array,"undefined"!=typeof Symbol&&Symbol.species&&Buffer[Symbol.species]===Buffer&&Object.defineProperty(Buffer,Symbol.species,{value:null,configurable:!0})),Buffer.alloc=function(t,r,i){return function alloc(t,r,i,a){return assertSize(r),r<=0?createBuffer(t,r):void 0!==i?"string"==typeof a?createBuffer(t,r).fill(i,a):createBuffer(t,r).fill(i):createBuffer(t,r)}(null,t,r,i)},Buffer.allocUnsafe=function(t){return allocUnsafe(null,t)},Buffer.allocUnsafeSlow=function(t){return allocUnsafe(null,t)},Buffer.isBuffer=function isBuffer(t){return!(null==t||!t._isBuffer)},Buffer.compare=function compare(t,r){if(!Buffer.isBuffer(t)||!Buffer.isBuffer(r))throw new TypeError("Arguments must be Buffers");if(t===r)return 0;for(var i=t.length,a=r.length,u=0,c=Math.min(i,a);u<c;++u)if(t[u]!==r[u]){i=t[u],a=r[u];break}return i<a?-1:a<i?1:0},Buffer.isEncoding=function isEncoding(t){switch(String(t).toLowerCase()){case"hex":case"utf8":case"utf-8":case"ascii":case"latin1":case"binary":case"base64":case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return!0;default:return!1}},Buffer.concat=function concat(t,r){if(!c(t))throw new TypeError('"list" argument must be an Array of Buffers');if(0===t.length)return Buffer.alloc(0);var i;if(void 0===r)for(r=0,i=0;i<t.length;++i)r+=t[i].length;var a=Buffer.allocUnsafe(r),u=0;for(i=0;i<t.length;++i){var l=t[i];if(!Buffer.isBuffer(l))throw new TypeError('"list" argument must be an Array of Buffers');l.copy(a,u),u+=l.length}return a},Buffer.byteLength=byteLength,Buffer.prototype._isBuffer=!0,Buffer.prototype.swap16=function swap16(){var t=this.length;if(t%2!=0)throw new RangeError("Buffer size must be a multiple of 16-bits");for(var r=0;r<t;r+=2)swap(this,r,r+1);return this},Buffer.prototype.swap32=function swap32(){var t=this.length;if(t%4!=0)throw new RangeError("Buffer size must be a multiple of 32-bits");for(var r=0;r<t;r+=4)swap(this,r,r+3),swap(this,r+1,r+2);return this},Buffer.prototype.swap64=function swap64(){var t=this.length;if(t%8!=0)throw new RangeError("Buffer size must be a multiple of 64-bits");for(var r=0;r<t;r+=8)swap(this,r,r+7),swap(this,r+1,r+6),swap(this,r+2,r+5),swap(this,r+3,r+4);return this},Buffer.prototype.toString=function toString(){var t=0|this.length;return 0===t?"":0===arguments.length?utf8Slice(this,0,t):slowToString.apply(this,arguments)},Buffer.prototype.equals=function equals(t){if(!Buffer.isBuffer(t))throw new TypeError("Argument must be a Buffer");return this===t||0===Buffer.compare(this,t)},Buffer.prototype.inspect=function inspect(){var t="",i=r.INSPECT_MAX_BYTES;return this.length>0&&(t=this.toString("hex",0,i).match(/.{2}/g).join(" "),this.length>i&&(t+=" ... ")),"<Buffer "+t+">"},Buffer.prototype.compare=function compare(t,r,i,a,u){if(!Buffer.isBuffer(t))throw new TypeError("Argument must be a Buffer");if(void 0===r&&(r=0),void 0===i&&(i=t?t.length:0),void 0===a&&(a=0),void 0===u&&(u=this.length),r<0||i>t.length||a<0||u>this.length)throw new RangeError("out of range index");if(a>=u&&r>=i)return 0;if(a>=u)return-1;if(r>=i)return 1;if(this===t)return 0;for(var c=(u>>>=0)-(a>>>=0),l=(i>>>=0)-(r>>>=0),p=Math.min(c,l),d=this.slice(a,u),y=t.slice(r,i),h=0;h<p;++h)if(d[h]!==y[h]){c=d[h],l=y[h];break}return c<l?-1:l<c?1:0},Buffer.prototype.includes=function includes(t,r,i){return-1!==this.indexOf(t,r,i)},Buffer.prototype.indexOf=function indexOf(t,r,i){return bidirectionalIndexOf(this,t,r,i,!0)},Buffer.prototype.lastIndexOf=function lastIndexOf(t,r,i){return bidirectionalIndexOf(this,t,r,i,!1)},Buffer.prototype.write=function write(t,r,i,a){if(void 0===r)a="utf8",i=this.length,r=0;else if(void 0===i&&"string"==typeof r)a=r,i=this.length,r=0;else{if(!isFinite(r))throw new Error("Buffer.write(string, encoding, offset[, length]) is no longer supported");r|=0,isFinite(i)?(i|=0,void 0===a&&(a="utf8")):(a=i,i=void 0)}var u=this.length-r;if((void 0===i||i>u)&&(i=u),t.length>0&&(i<0||r<0)||r>this.length)throw new RangeError("Attempt to write outside buffer bounds");a||(a="utf8");for(var c=!1;;)switch(a){case"hex":return hexWrite(this,t,r,i);case"utf8":case"utf-8":return utf8Write(this,t,r,i);case"ascii":return asciiWrite(this,t,r,i);case"latin1":case"binary":return latin1Write(this,t,r,i);case"base64":return base64Write(this,t,r,i);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return ucs2Write(this,t,r,i);default:if(c)throw new TypeError("Unknown encoding: "+a);a=(""+a).toLowerCase(),c=!0}},Buffer.prototype.toJSON=function toJSON(){return{type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}};function asciiSlice(t,r,i){var a="";i=Math.min(t.length,i);for(var u=r;u<i;++u)a+=String.fromCharCode(127&t[u]);return a}function latin1Slice(t,r,i){var a="";i=Math.min(t.length,i);for(var u=r;u<i;++u)a+=String.fromCharCode(t[u]);return a}function hexSlice(t,r,i){var a=t.length;(!r||r<0)&&(r=0),(!i||i<0||i>a)&&(i=a);for(var u="",c=r;c<i;++c)u+=toHex(t[c]);return u}function utf16leSlice(t,r,i){for(var a=t.slice(r,i),u="",c=0;c<a.length;c+=2)u+=String.fromCharCode(a[c]+256*a[c+1]);return u}function checkOffset(t,r,i){if(t%1!=0||t<0)throw new RangeError("offset is not uint");if(t+r>i)throw new RangeError("Trying to access beyond buffer length")}function checkInt(t,r,i,a,u,c){if(!Buffer.isBuffer(t))throw new TypeError('"buffer" argument must be a Buffer instance');if(r>u||r<c)throw new RangeError('"value" argument is out of bounds');if(i+a>t.length)throw new RangeError("Index out of range")}function objectWriteUInt16(t,r,i,a){r<0&&(r=65535+r+1);for(var u=0,c=Math.min(t.length-i,2);u<c;++u)t[i+u]=(r&255<<8*(a?u:1-u))>>>8*(a?u:1-u)}function objectWriteUInt32(t,r,i,a){r<0&&(r=4294967295+r+1);for(var u=0,c=Math.min(t.length-i,4);u<c;++u)t[i+u]=r>>>8*(a?u:3-u)&255}function checkIEEE754(t,r,i,a,u,c){if(i+a>t.length)throw new RangeError("Index out of range");if(i<0)throw new RangeError("Index out of range")}function writeFloat(t,r,i,a,c){return c||checkIEEE754(t,0,i,4),u.write(t,r,i,a,23,4),i+4}function writeDouble(t,r,i,a,c){return c||checkIEEE754(t,0,i,8),u.write(t,r,i,a,52,8),i+8}Buffer.prototype.slice=function slice(t,r){var i,a=this.length;if((t=~~t)<0?(t+=a)<0&&(t=0):t>a&&(t=a),(r=void 0===r?a:~~r)<0?(r+=a)<0&&(r=0):r>a&&(r=a),r<t&&(r=t),Buffer.TYPED_ARRAY_SUPPORT)(i=this.subarray(t,r)).__proto__=Buffer.prototype;else{var u=r-t;i=new Buffer(u,void 0);for(var c=0;c<u;++c)i[c]=this[c+t]}return i},Buffer.prototype.readUIntLE=function readUIntLE(t,r,i){t|=0,r|=0,i||checkOffset(t,r,this.length);for(var a=this[t],u=1,c=0;++c<r&&(u*=256);)a+=this[t+c]*u;return a},Buffer.prototype.readUIntBE=function readUIntBE(t,r,i){t|=0,r|=0,i||checkOffset(t,r,this.length);for(var a=this[t+--r],u=1;r>0&&(u*=256);)a+=this[t+--r]*u;return a},Buffer.prototype.readUInt8=function readUInt8(t,r){return r||checkOffset(t,1,this.length),this[t]},Buffer.prototype.readUInt16LE=function readUInt16LE(t,r){return r||checkOffset(t,2,this.length),this[t]|this[t+1]<<8},Buffer.prototype.readUInt16BE=function readUInt16BE(t,r){return r||checkOffset(t,2,this.length),this[t]<<8|this[t+1]},Buffer.prototype.readUInt32LE=function readUInt32LE(t,r){return r||checkOffset(t,4,this.length),(this[t]|this[t+1]<<8|this[t+2]<<16)+16777216*this[t+3]},Buffer.prototype.readUInt32BE=function readUInt32BE(t,r){return r||checkOffset(t,4,this.length),16777216*this[t]+(this[t+1]<<16|this[t+2]<<8|this[t+3])},Buffer.prototype.readIntLE=function readIntLE(t,r,i){t|=0,r|=0,i||checkOffset(t,r,this.length);for(var a=this[t],u=1,c=0;++c<r&&(u*=256);)a+=this[t+c]*u;return a>=(u*=128)&&(a-=Math.pow(2,8*r)),a},Buffer.prototype.readIntBE=function readIntBE(t,r,i){t|=0,r|=0,i||checkOffset(t,r,this.length);for(var a=r,u=1,c=this[t+--a];a>0&&(u*=256);)c+=this[t+--a]*u;return c>=(u*=128)&&(c-=Math.pow(2,8*r)),c},Buffer.prototype.readInt8=function readInt8(t,r){return r||checkOffset(t,1,this.length),128&this[t]?-1*(255-this[t]+1):this[t]},Buffer.prototype.readInt16LE=function readInt16LE(t,r){r||checkOffset(t,2,this.length);var i=this[t]|this[t+1]<<8;return 32768&i?4294901760|i:i},Buffer.prototype.readInt16BE=function readInt16BE(t,r){r||checkOffset(t,2,this.length);var i=this[t+1]|this[t]<<8;return 32768&i?4294901760|i:i},Buffer.prototype.readInt32LE=function readInt32LE(t,r){return r||checkOffset(t,4,this.length),this[t]|this[t+1]<<8|this[t+2]<<16|this[t+3]<<24},Buffer.prototype.readInt32BE=function readInt32BE(t,r){return r||checkOffset(t,4,this.length),this[t]<<24|this[t+1]<<16|this[t+2]<<8|this[t+3]},Buffer.prototype.readFloatLE=function readFloatLE(t,r){return r||checkOffset(t,4,this.length),u.read(this,t,!0,23,4)},Buffer.prototype.readFloatBE=function readFloatBE(t,r){return r||checkOffset(t,4,this.length),u.read(this,t,!1,23,4)},Buffer.prototype.readDoubleLE=function readDoubleLE(t,r){return r||checkOffset(t,8,this.length),u.read(this,t,!0,52,8)},Buffer.prototype.readDoubleBE=function readDoubleBE(t,r){return r||checkOffset(t,8,this.length),u.read(this,t,!1,52,8)},Buffer.prototype.writeUIntLE=function writeUIntLE(t,r,i,a){(t=+t,r|=0,i|=0,a)||checkInt(this,t,r,i,Math.pow(2,8*i)-1,0);var u=1,c=0;for(this[r]=255&t;++c<i&&(u*=256);)this[r+c]=t/u&255;return r+i},Buffer.prototype.writeUIntBE=function writeUIntBE(t,r,i,a){(t=+t,r|=0,i|=0,a)||checkInt(this,t,r,i,Math.pow(2,8*i)-1,0);var u=i-1,c=1;for(this[r+u]=255&t;--u>=0&&(c*=256);)this[r+u]=t/c&255;return r+i},Buffer.prototype.writeUInt8=function writeUInt8(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,1,255,0),Buffer.TYPED_ARRAY_SUPPORT||(t=Math.floor(t)),this[r]=255&t,r+1},Buffer.prototype.writeUInt16LE=function writeUInt16LE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,2,65535,0),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=255&t,this[r+1]=t>>>8):objectWriteUInt16(this,t,r,!0),r+2},Buffer.prototype.writeUInt16BE=function writeUInt16BE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,2,65535,0),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=t>>>8,this[r+1]=255&t):objectWriteUInt16(this,t,r,!1),r+2},Buffer.prototype.writeUInt32LE=function writeUInt32LE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,4,4294967295,0),Buffer.TYPED_ARRAY_SUPPORT?(this[r+3]=t>>>24,this[r+2]=t>>>16,this[r+1]=t>>>8,this[r]=255&t):objectWriteUInt32(this,t,r,!0),r+4},Buffer.prototype.writeUInt32BE=function writeUInt32BE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,4,4294967295,0),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=t>>>24,this[r+1]=t>>>16,this[r+2]=t>>>8,this[r+3]=255&t):objectWriteUInt32(this,t,r,!1),r+4},Buffer.prototype.writeIntLE=function writeIntLE(t,r,i,a){if(t=+t,r|=0,!a){var u=Math.pow(2,8*i-1);checkInt(this,t,r,i,u-1,-u)}var c=0,l=1,p=0;for(this[r]=255&t;++c<i&&(l*=256);)t<0&&0===p&&0!==this[r+c-1]&&(p=1),this[r+c]=(t/l>>0)-p&255;return r+i},Buffer.prototype.writeIntBE=function writeIntBE(t,r,i,a){if(t=+t,r|=0,!a){var u=Math.pow(2,8*i-1);checkInt(this,t,r,i,u-1,-u)}var c=i-1,l=1,p=0;for(this[r+c]=255&t;--c>=0&&(l*=256);)t<0&&0===p&&0!==this[r+c+1]&&(p=1),this[r+c]=(t/l>>0)-p&255;return r+i},Buffer.prototype.writeInt8=function writeInt8(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,1,127,-128),Buffer.TYPED_ARRAY_SUPPORT||(t=Math.floor(t)),t<0&&(t=255+t+1),this[r]=255&t,r+1},Buffer.prototype.writeInt16LE=function writeInt16LE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,2,32767,-32768),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=255&t,this[r+1]=t>>>8):objectWriteUInt16(this,t,r,!0),r+2},Buffer.prototype.writeInt16BE=function writeInt16BE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,2,32767,-32768),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=t>>>8,this[r+1]=255&t):objectWriteUInt16(this,t,r,!1),r+2},Buffer.prototype.writeInt32LE=function writeInt32LE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,4,2147483647,-2147483648),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=255&t,this[r+1]=t>>>8,this[r+2]=t>>>16,this[r+3]=t>>>24):objectWriteUInt32(this,t,r,!0),r+4},Buffer.prototype.writeInt32BE=function writeInt32BE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,4,2147483647,-2147483648),t<0&&(t=4294967295+t+1),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=t>>>24,this[r+1]=t>>>16,this[r+2]=t>>>8,this[r+3]=255&t):objectWriteUInt32(this,t,r,!1),r+4},Buffer.prototype.writeFloatLE=function writeFloatLE(t,r,i){return writeFloat(this,t,r,!0,i)},Buffer.prototype.writeFloatBE=function writeFloatBE(t,r,i){return writeFloat(this,t,r,!1,i)},Buffer.prototype.writeDoubleLE=function writeDoubleLE(t,r,i){return writeDouble(this,t,r,!0,i)},Buffer.prototype.writeDoubleBE=function writeDoubleBE(t,r,i){return writeDouble(this,t,r,!1,i)},Buffer.prototype.copy=function copy(t,r,i,a){if(i||(i=0),a||0===a||(a=this.length),r>=t.length&&(r=t.length),r||(r=0),a>0&&a<i&&(a=i),a===i)return 0;if(0===t.length||0===this.length)return 0;if(r<0)throw new RangeError("targetStart out of bounds");if(i<0||i>=this.length)throw new RangeError("sourceStart out of bounds");if(a<0)throw new RangeError("sourceEnd out of bounds");a>this.length&&(a=this.length),t.length-r<a-i&&(a=t.length-r+i);var u,c=a-i;if(this===t&&i<r&&r<a)for(u=c-1;u>=0;--u)t[u+r]=this[u+i];else if(c<1e3||!Buffer.TYPED_ARRAY_SUPPORT)for(u=0;u<c;++u)t[u+r]=this[u+i];else Uint8Array.prototype.set.call(t,this.subarray(i,i+c),r);return c},Buffer.prototype.fill=function fill(t,r,i,a){if("string"==typeof t){if("string"==typeof r?(a=r,r=0,i=this.length):"string"==typeof i&&(a=i,i=this.length),1===t.length){var u=t.charCodeAt(0);u<256&&(t=u)}if(void 0!==a&&"string"!=typeof a)throw new TypeError("encoding must be a string");if("string"==typeof a&&!Buffer.isEncoding(a))throw new TypeError("Unknown encoding: "+a)}else"number"==typeof t&&(t&=255);if(r<0||this.length<r||this.length<i)throw new RangeError("Out of range index");if(i<=r)return this;var c;if(r>>>=0,i=void 0===i?this.length:i>>>0,t||(t=0),"number"==typeof t)for(c=r;c<i;++c)this[c]=t;else{var l=Buffer.isBuffer(t)?t:utf8ToBytes(new Buffer(t,a).toString()),p=l.length;for(c=0;c<i-r;++c)this[c+r]=l[c%p]}return this};var l=/[^+\/0-9A-Za-z-_]/g;function toHex(t){return t<16?"0"+t.toString(16):t.toString(16)}function utf8ToBytes(t,r){var i;r=r||1/0;for(var a=t.length,u=null,c=[],l=0;l<a;++l){if((i=t.charCodeAt(l))>55295&&i<57344){if(!u){if(i>56319){(r-=3)>-1&&c.push(239,191,189);continue}if(l+1===a){(r-=3)>-1&&c.push(239,191,189);continue}u=i;continue}if(i<56320){(r-=3)>-1&&c.push(239,191,189),u=i;continue}i=65536+(u-55296<<10|i-56320)}else u&&(r-=3)>-1&&c.push(239,191,189);if(u=null,i<128){if((r-=1)<0)break;c.push(i)}else if(i<2048){if((r-=2)<0)break;c.push(i>>6|192,63&i|128)}else if(i<65536){if((r-=3)<0)break;c.push(i>>12|224,i>>6&63|128,63&i|128)}else{if(!(i<1114112))throw new Error("Invalid code point");if((r-=4)<0)break;c.push(i>>18|240,i>>12&63|128,i>>6&63|128,63&i|128)}}return c}function base64ToBytes(t){return a.toByteArray(function base64clean(t){if((t=function stringtrim(t){return t.trim?t.trim():t.replace(/^\s+|\s+$/g,"")}(t).replace(l,"")).length<2)return"";for(;t.length%4!=0;)t+="=";return t}(t))}function blitBuffer(t,r,i,a){for(var u=0;u<a&&!(u+i>=r.length||u>=t.length);++u)r[u+i]=t[u];return u}}).call(this,i(62))},function(t,r,i){r.byteLength=function byteLength(t){var r=getLens(t),i=r[0],a=r[1];return 3*(i+a)/4-a},r.toByteArray=function toByteArray(t){var r,i,a=getLens(t),l=a[0],p=a[1],d=new c(function _byteLength(t,r,i){return 3*(r+i)/4-i}(0,l,p)),y=0,h=p>0?l-4:l;for(i=0;i<h;i+=4)r=u[t.charCodeAt(i)]<<18|u[t.charCodeAt(i+1)]<<12|u[t.charCodeAt(i+2)]<<6|u[t.charCodeAt(i+3)],d[y++]=r>>16&255,d[y++]=r>>8&255,d[y++]=255&r;2===p&&(r=u[t.charCodeAt(i)]<<2|u[t.charCodeAt(i+1)]>>4,d[y++]=255&r);1===p&&(r=u[t.charCodeAt(i)]<<10|u[t.charCodeAt(i+1)]<<4|u[t.charCodeAt(i+2)]>>2,d[y++]=r>>8&255,d[y++]=255&r);return d},r.fromByteArray=function fromByteArray(t){for(var r,i=t.length,u=i%3,c=[],l=0,p=i-u;l<p;l+=16383)c.push(encodeChunk(t,l,l+16383>p?p:l+16383));1===u?(r=t[i-1],c.push(a[r>>2]+a[r<<4&63]+"==")):2===u&&(r=(t[i-2]<<8)+t[i-1],c.push(a[r>>10]+a[r>>4&63]+a[r<<2&63]+"="));return c.join("")};for(var a=[],u=[],c="undefined"!=typeof Uint8Array?Uint8Array:Array,l="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",p=0,d=l.length;p<d;++p)a[p]=l[p],u[l.charCodeAt(p)]=p;function getLens(t){var r=t.length;if(r%4>0)throw new Error("Invalid string. Length must be a multiple of 4");var i=t.indexOf("=");return-1===i&&(i=r),[i,i===r?0:4-i%4]}function encodeChunk(t,r,i){for(var u,c,l=[],p=r;p<i;p+=3)u=(t[p]<<16&16711680)+(t[p+1]<<8&65280)+(255&t[p+2]),l.push(a[(c=u)>>18&63]+a[c>>12&63]+a[c>>6&63]+a[63&c]);return l.join("")}u["-".charCodeAt(0)]=62,u["_".charCodeAt(0)]=63},function(t,r){r.read=function(t,r,i,a,u){var c,l,p=8*u-a-1,d=(1<<p)-1,y=d>>1,h=-7,g=i?u-1:0,v=i?-1:1,m=t[r+g];for(g+=v,c=m&(1<<-h)-1,m>>=-h,h+=p;h>0;c=256*c+t[r+g],g+=v,h-=8);for(l=c&(1<<-h)-1,c>>=-h,h+=a;h>0;l=256*l+t[r+g],g+=v,h-=8);if(0===c)c=1-y;else{if(c===d)return l?NaN:1/0*(m?-1:1);l+=Math.pow(2,a),c-=y}return(m?-1:1)*l*Math.pow(2,c-a)},r.write=function(t,r,i,a,u,c){var l,p,d,y=8*c-u-1,h=(1<<y)-1,g=h>>1,v=23===u?Math.pow(2,-24)-Math.pow(2,-77):0,m=a?0:c-1,b=a?1:-1,_=r<0||0===r&&1/r<0?1:0;for(r=Math.abs(r),isNaN(r)||r===1/0?(p=isNaN(r)?1:0,l=h):(l=Math.floor(Math.log(r)/Math.LN2),r*(d=Math.pow(2,-l))<1&&(l--,d*=2),(r+=l+g>=1?v/d:v*Math.pow(2,1-g))*d>=2&&(l++,d/=2),l+g>=h?(p=0,l=h):l+g>=1?(p=(r*d-1)*Math.pow(2,u),l+=g):(p=r*Math.pow(2,g-1)*Math.pow(2,u),l=0));u>=8;t[i+m]=255&p,m+=b,p/=256,u-=8);for(l=l<<u|p,y+=u;y>0;t[i+m]=255&l,m+=b,l/=256,y-=8);t[i+m-b]|=128*_}},function(t,r){var i={}.toString;t.exports=Array.isArray||function(t){return"[object Array]"==i.call(t)}},function(t,r,i){var a=i(86);t.exports=function _arrayWithoutHoles(t){if(Array.isArray(t))return a(t)}},function(t,r){t.exports=function _iterableToArray(t){if("undefined"!=typeof Symbol&&Symbol.iterator in Object(t))return Array.from(t)}},function(t,r){t.exports=function _nonIterableSpread(){throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(23)),c=a(i(25)),l=a(i(8)),p=a(i(9)),d=a(i(1)),y=a(i(2)),h=a(i(5)),g=a(i(6)),v=a(i(3)),m=i(18),b=a(i(251)),_=i(10),w=i(24),x=a(i(252));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,v.default)(t);if(r){var u=(0,v.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,g.default)(this,i)}}var S=function(t){(0,h.default)(VoteProxyService,t);var r,i,a,g=_createSuper(VoteProxyService);function VoteProxyService(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"voteProxy";return(0,d.default)(this,VoteProxyService),g.call(this,t,["smartContract","chief"])}return(0,y.default)(VoteProxyService,[{key:"lock",value:function lock(t,r){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:_.MKR,a=(0,w.getCurrency)(r,i).toFixed("wei");return this._proxyContract(t).lock(a)}},{key:"free",value:function free(t,r){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:_.MKR,a=(0,w.getCurrency)(r,i).toFixed("wei");return this._proxyContract(t).free(a)}},{key:"freeAll",value:function freeAll(t){return this._proxyContract(t).freeAll()}},{key:"voteExec",value:function voteExec(t,r){return Array.isArray(r)?this._proxyContract(t)["vote(address[])"](r):this._proxyContract(t)["vote(bytes32)"](r)}},{key:"getVotedProposalAddresses",value:(a=(0,p.default)(l.default.mark((function _callee(t){var r;return l.default.wrap((function _callee$(i){for(;;)switch(i.prev=i.next){case 0:return i.next=2,this.get("chief").getVotedSlate(t);case 2:return r=i.sent,i.abrupt("return",this.get("chief").getSlateAddresses(r));case 4:case"end":return i.stop()}}),_callee,this)}))),function getVotedProposalAddresses(t){return a.apply(this,arguments)})},{key:"getVoteProxy",value:(i=(0,p.default)(l.default.mark((function _callee2(t){var r,i,a,u,p,d,y;return l.default.wrap((function _callee2$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,this._getProxyStatus(t);case 2:if(i=l.sent,a=i.hasProxy,u=i.role,p=i.address,a){l.next=8;break}return l.abrupt("return",{hasProxy:a,voteProxy:null});case 8:return d="hot"===u?"cold":"hot",l.next=11,this._getAddressOfRole(p,d);case 11:return y=l.sent,l.abrupt("return",{hasProxy:a,voteProxy:new b.default((r={voteProxyService:this,proxyAddress:p},(0,c.default)(r,"".concat(u,"Address"),t),(0,c.default)(r,"".concat(d,"Address"),y),r))});case 13:case"end":return l.stop()}}),_callee2,this)}))),function getVoteProxy(t){return i.apply(this,arguments)})},{key:"_proxyContract",value:function _proxyContract(t){return this.get("smartContract").getContractByAddressAndAbi(t,x.default)}},{key:"_proxyFactoryContract",value:function _proxyFactoryContract(){return this.get("smartContract").getContractByName(_.VOTE_PROXY_FACTORY)}},{key:"_getProxyStatus",value:(r=(0,p.default)(l.default.mark((function _callee3(t){var r,i,a,c;return l.default.wrap((function _callee3$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,Promise.all([this._proxyFactoryContract().coldMap(t),this._proxyFactoryContract().hotMap(t)]);case 2:if(r=l.sent,i=(0,u.default)(r,2),a=i[0],c=i[1],a===_.ZERO_ADDRESS){l.next=8;break}return l.abrupt("return",{role:"cold",address:a,hasProxy:!0});case 8:if(c===_.ZERO_ADDRESS){l.next=10;break}return l.abrupt("return",{role:"hot",address:c,hasProxy:!0});case 10:return l.abrupt("return",{role:null,address:"",hasProxy:!1});case 11:case"end":return l.stop()}}),_callee3,this)}))),function _getProxyStatus(t){return r.apply(this,arguments)})},{key:"_getAddressOfRole",value:function _getAddressOfRole(t,r){return"hot"===r?this._proxyContract(t).hot():"cold"===r?this._proxyContract(t).cold():null}}]),VoteProxyService}(m.LocalService);r.default=S,Object.assign(S.prototype,["getVotedSlate","getNumDeposits"].reduce((function(t,r){return t[r]=function(){var t;return(t=this.get("chief"))[r].apply(t,arguments)},t}),{}))},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(2)),l=function(){function VoteProxy(t){var r=t.voteProxyService,i=t.proxyAddress,a=t.coldAddress,c=t.hotAddress;(0,u.default)(this,VoteProxy),this._voteProxyService=r,this._proxyAddress=i,this._coldAddress=a,this._hotAddress=c}return(0,c.default)(VoteProxy,[{key:"getProxyAddress",value:function getProxyAddress(){return this._proxyAddress}},{key:"getColdAddress",value:function getColdAddress(){return this._coldAddress}},{key:"getHotAddress",value:function getHotAddress(){return this._hotAddress}}]),VoteProxy}();r.default=l;Object.assign(l.prototype,["lock","free","voteExec","getNumDeposits","getVotedProposalAddresses"].reduce((function(t,r){return t[r]=function(){for(var t,i=arguments.length,a=new Array(i),u=0;u<i;u++)a[u]=arguments[u];return(t=this._voteProxyService)[r].apply(t,[this._proxyAddress].concat(a))},t}),{}))},function(t){t.exports=JSON.parse('[{"constant":true,"inputs":[],"name":"gov","outputs":[{"name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"cold","outputs":[{"name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"freeAll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"iou","outputs":[{"name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"name":"slate","type":"bytes32"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"wad","type":"uint256"}],"name":"free","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"wad","type":"uint256"}],"name":"lock","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"hot","outputs":[{"name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"name":"yays","type":"address[]"}],"name":"vote","outputs":[{"name":"","type":"bytes32"}],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"chief","outputs":[{"name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"inputs":[{"name":"_chief","type":"address"},{"name":"_cold","type":"address"},{"name":"_hot","type":"address"}],"payable":false,"stateMutability":"nonpayable","type":"constructor"}]')},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(2)),l=a(i(5)),p=a(i(6)),d=a(i(3)),y=i(18),h=i(10),g=a(i(254));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,d.default)(t);if(r){var u=(0,d.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,p.default)(this,i)}}var v=function(t){(0,l.default)(VoteProxyFactoryService,t);var r=_createSuper(VoteProxyFactoryService);function VoteProxyFactoryService(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"voteProxyFactory";return(0,u.default)(this,VoteProxyFactoryService),r.call(this,t,["smartContract","voteProxy","transactionManager"])}return(0,c.default)(VoteProxyFactoryService,[{key:"initiateLink",value:function initiateLink(t){return this._proxyFactoryContract().initiateLink(t)}},{key:"approveLink",value:function approveLink(t){return new g.default(this._proxyFactoryContract(),this.get("transactionManager")).build("approveLink",[t])}},{key:"breakLink",value:function breakLink(){return this._proxyFactoryContract().breakLink()}},{key:"getVoteProxy",value:function getVoteProxy(t){return this.get("voteProxy").getVoteProxy(t)}},{key:"_proxyFactoryContract",value:function _proxyFactoryContract(){return this.get("smartContract").getContractByName(h.VOTE_PROXY_FACTORY)}}]),VoteProxyFactoryService}(y.LocalService);r.default=v},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(8)),c=a(i(64)),l=a(i(9)),p=a(i(1)),d=a(i(2)),y=function(){function ApproveLinkTransaction(t,r){(0,p.default)(this,ApproveLinkTransaction),this._contract=t,this._txMgr=r}return(0,d.default)(ApproveLinkTransaction,[{key:"build",value:function build(t,r){var i=this,a=(0,l.default)(u.default.mark((function _callee(){var l,p;return u.default.wrap((function _callee$(u){for(;;)switch(u.prev=u.next){case 0:return u.next=2,0;case 2:return u.next=4,(l=i._contract)[t].apply(l,[].concat((0,c.default)(r),[{promise:a}]));case 4:return p=u.sent,i._parseLogs(p.receipt.logs),u.abrupt("return",i);case 7:case"end":return u.stop()}}),_callee)})))();return this.promise=a,a}},{key:"_parseLogs",value:function _parseLogs(t){var r=this._contract.interface.events.LinkConfirmed,i=this._txMgr.get("web3")._web3,a=i.utils.keccak256(i.utils.toHex(r.signature)),u=t.filter((function(t){return t.topics[0].toLowerCase()===a.toLowerCase()})),c=r.parse(u[0].topics,u[0].data);this.proxyAddress=c.voteProxy}},{key:"fees",get:function get(){return this._txMgr.getTransaction(this.promise).fees()}},{key:"timeStamp",get:function get(){return this._txMgr.getTransaction(this.promise).timeStamp()}},{key:"timeStampSubmitted",get:function get(){return this._txMgr.getTransaction(this.promise).timeStampSubmitted()}}]),ApproveLinkTransaction}();r.default=y},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(15)),c=a(i(23)),l=a(i(25)),p=a(i(8)),d=a(i(9)),y=a(i(1)),h=a(i(2)),g=a(i(5)),v=a(i(6)),m=a(i(3)),b=i(18),_=i(10),w=a(i(101)),x=i(24);function ownKeys(t,r){var i=Object.keys(t);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(t);r&&(a=a.filter((function(r){return Object.getOwnPropertyDescriptor(t,r).enumerable}))),i.push.apply(i,a)}return i}function _objectSpread(t){for(var r=1;r<arguments.length;r++){var i=null!=arguments[r]?arguments[r]:{};r%2?ownKeys(Object(i),!0).forEach((function(r){(0,l.default)(t,r,i[r])})):Object.getOwnPropertyDescriptors?Object.defineProperties(t,Object.getOwnPropertyDescriptors(i)):ownKeys(Object(i)).forEach((function(r){Object.defineProperty(t,r,Object.getOwnPropertyDescriptor(i,r))}))}return t}function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,m.default)(t);if(r){var u=(0,m.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,v.default)(this,i)}}var S=function(t){(0,g.default)(GovPollingService,t);var r,i,a,l,v,m,b,S,O,E,k,A,N,T,P,C=_createSuper(GovPollingService);function GovPollingService(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"govPolling";return(0,y.default)(this,GovPollingService),C.call(this,t,["smartContract","govQueryApi","token"])}return(0,h.default)(GovPollingService,[{key:"createPoll",value:(P=(0,d.default)(p.default.mark((function _callee(t,r,i,a){var u,c;return p.default.wrap((function _callee$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,this._pollingContract().createPoll(t,r,i,a);case 2:return u=l.sent,c=parseInt(u.receipt.logs[0].topics[2]),l.abrupt("return",c);case 5:case"end":return l.stop()}}),_callee,this)}))),function createPoll(t,r,i,a){return P.apply(this,arguments)})},{key:"withdrawPoll",value:function withdrawPoll(t){return this._pollingContract().withdrawPoll(t)}},{key:"vote",value:function vote(t,r){if(t.length!==r.length||0===t.length)throw new Error("poll id array and option id array must be the same length and have a non-zero number of elements");if(1===t.length){return this._batchPollingContract()["vote(uint256,uint256)"](t[0],r[0])}return this._batchPollingContract()["vote(uint256[],uint256[])"](t,r)}},{key:"voteRankedChoice",value:function voteRankedChoice(t,r){var i=new Uint8Array(32);r.forEach((function(t,r){i[i.length-r-1]=t+1}));var a=(0,x.fromBuffer)(i).toString();return this._batchPollingContract().vote(t,a)}},{key:"_pollingContract",value:function _pollingContract(){return this.get("smartContract").getContractByName(_.POLLING)}},{key:"_batchPollingContract",value:function _batchPollingContract(){return this.get("smartContract").getContractByName(_.BATCH_POLLING)}},{key:"getPoll",value:(T=(0,d.default)(p.default.mark((function _callee2(t){var r,i,a,u,c;return p.default.wrap((function _callee2$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,this.getAllWhitelistedPolls();case 2:for(r=l.sent,i=r.filter((function(r){return r.multiHash===t})),a=1/0,c=0;c<i.length;c++)i[c].pollId<a&&(a=i[c].pollId,u=i[c]);return l.abrupt("return",u);case 7:case"end":return l.stop()}}),_callee2,this)}))),function getPoll(t){return T.apply(this,arguments)})},{key:"_getPoll",value:(N=(0,d.default)(p.default.mark((function _callee3(t){var r;return p.default.wrap((function _callee3$(i){for(;;)switch(i.prev=i.next){case 0:return i.next=2,this.getAllWhitelistedPolls();case 2:return r=i.sent,i.abrupt("return",r.find((function(r){return parseInt(r.pollId)===parseInt(t)})));case 4:case"end":return i.stop()}}),_callee3,this)}))),function _getPoll(t){return N.apply(this,arguments)})},{key:"getAllWhitelistedPolls",value:(A=(0,d.default)(p.default.mark((function _callee4(){return p.default.wrap((function _callee4$(t){for(;;)switch(t.prev=t.next){case 0:if(!this.polls){t.next=2;break}return t.abrupt("return",this.polls);case 2:return t.next=4,this.get("govQueryApi").getAllWhitelistedPolls();case 4:return this.polls=t.sent,t.abrupt("return",this.polls);case 6:case"end":return t.stop()}}),_callee4,this)}))),function getAllWhitelistedPolls(){return A.apply(this,arguments)})},{key:"refresh",value:function refresh(){this.polls=null}},{key:"getOptionVotingFor",value:(k=(0,d.default)(p.default.mark((function _callee5(t,r){return p.default.wrap((function _callee5$(i){for(;;)switch(i.prev=i.next){case 0:return i.abrupt("return",this.get("govQueryApi").getOptionVotingFor(t.toLowerCase(),r));case 1:case"end":return i.stop()}}),_callee5,this)}))),function getOptionVotingFor(t,r){return k.apply(this,arguments)})},{key:"getOptionVotingForRankedChoice",value:(E=(0,d.default)(p.default.mark((function _callee6(t,r){var i,a,u;return p.default.wrap((function _callee6$(c){for(;;)switch(c.prev=c.next){case 0:return c.next=2,this.get("govQueryApi").getOptionVotingForRankedChoice(t.toLowerCase(),r);case 2:if(i=c.sent){c.next=5;break}return c.abrupt("return",[]);case 5:return a=(0,x.toBuffer)(i,{endian:"little"}),u=(0,x.paddedArray)(32-a.length,a),c.abrupt("return",u.reverse().filter((function(t){return 0!==t&&"0"!==t})));case 8:case"end":return c.stop()}}),_callee6,this)}))),function getOptionVotingForRankedChoice(t,r){return E.apply(this,arguments)})},{key:"getAllOptionsVotingFor",value:(O=(0,d.default)(p.default.mark((function _callee7(t){var r;return p.default.wrap((function _callee7$(i){for(;;)switch(i.prev=i.next){case 0:return i.next=2,this.get("govQueryApi").getAllOptionsVotingFor(t.toLowerCase());case 2:if(r=i.sent){i.next=5;break}return i.abrupt("return",[]);case 5:return i.abrupt("return",r.map((function(t){var r=null;if(t.optionIdRaw){var i=(0,x.toBuffer)(t.optionIdRaw,{endian:"little"});r=(0,x.paddedArray)(32-i.length,i).reverse().filter((function(t){return 0!==t&&"0"!==t}))}return{pollId:t.pollId,option:t.optionId,rankedChoiceOption:r}})));case 6:case"end":return i.stop()}}),_callee7,this)}))),function getAllOptionsVotingFor(t){return O.apply(this,arguments)})},{key:"getNumUniqueVoters",value:(S=(0,d.default)(p.default.mark((function _callee8(t){return p.default.wrap((function _callee8$(r){for(;;)switch(r.prev=r.next){case 0:return r.abrupt("return",this.get("govQueryApi").getNumUniqueVoters(t));case 1:case"end":return r.stop()}}),_callee8,this)}))),function getNumUniqueVoters(t){return S.apply(this,arguments)})},{key:"getMkrWeight",value:(b=(0,d.default)(p.default.mark((function _callee9(t){var r;return p.default.wrap((function _callee9$(i){for(;;)switch(i.prev=i.next){case 0:return i.next=2,this.get("govQueryApi").getMkrWeight(t.toLowerCase(),2147483647);case 2:return r=i.sent,i.abrupt("return",(0,_.MKR)(r));case 4:case"end":return i.stop()}}),_callee9,this)}))),function getMkrWeight(t){return b.apply(this,arguments)})},{key:"getMkrAmtVoted",value:(m=(0,d.default)(p.default.mark((function _callee10(t){var r,i,a,u;return p.default.wrap((function _callee10$(c){for(;;)switch(c.prev=c.next){case 0:return c.next=2,this._getPoll(t);case 2:return r=c.sent,i=r.endDate,a=Math.floor(i/1e3),c.next=7,this.get("govQueryApi").getMkrSupport(t,a);case 7:return u=c.sent,c.abrupt("return",(0,_.MKR)(u.reduce((function(t,r){return t+r.mkrSupport}),0)));case 9:case"end":return c.stop()}}),_callee10,this)}))),function getMkrAmtVoted(t){return m.apply(this,arguments)})},{key:"getMkrAmtVotedRankedChoice",value:(v=(0,d.default)(p.default.mark((function _callee11(t){var r,i,a,u;return p.default.wrap((function _callee11$(c){for(;;)switch(c.prev=c.next){case 0:return c.next=2,this._getPoll(t);case 2:return r=c.sent,i=r.endDate,a=Math.floor(i/1e3),c.next=7,this.get("govQueryApi").getMkrSupportRankedChoice(t,a);case 7:return u=c.sent,c.abrupt("return",(0,_.MKR)(u.reduce((function(t,r){return t+parseFloat(r.mkrSupport)}),0)));case 9:case"end":return c.stop()}}),_callee11,this)}))),function getMkrAmtVotedRankedChoice(t){return v.apply(this,arguments)})},{key:"getTallyRankedChoiceIrv",value:(l=(0,d.default)(p.default.mark((function _callee12(t){var r,i,a,l,d,y,h,g,v;return p.default.wrap((function _callee12$(p){for(;;)switch(p.prev=p.next){case 0:return p.next=2,this._getPoll(t);case 2:return r=p.sent,i=r.endDate,a=Math.floor(i/1e3),p.next=7,this.get("govQueryApi").getMkrSupportRankedChoice(t,a);case 7:if(l=p.sent,d=l.reduce((function(t,r){return(0,w.default)(r.mkrSupport||0).plus(t)}),(0,w.default)(0)),y={rounds:1,winner:null,totalMkrParticipation:d,options:{}},h={firstChoice:(0,w.default)(0),transfer:(0,w.default)(0),winner:!1,eliminated:!1},0!==l.length){p.next=13;break}return p.abrupt("return",y);case 13:if(l.forEach((function(t){t.choice=t.ballot.pop(),y.options[t.choice]||(y.options[t.choice]=_objectSpread({},h)),y.options[t.choice].firstChoice=(0,w.default)(y.options[t.choice].firstChoice).plus(t.mkrSupport||0)})),Object.entries(y.options).forEach((function(t){var r=(0,c.default)(t,2),i=r[0];r[1].firstChoice.gt(d.div(2))&&(y.winner=i)})),!y.winner){p.next=18;break}return y.options[y.winner].winner=!0,p.abrupt("return",y);case 18:g=function _loop(){y.rounds++;var t=Object.entries(y.options).filter((function(t){return!(0,c.default)(t,2)[1].eliminated})),r=t.reduce((function(t,r){var i=(0,c.default)(t,2)[1],a=(0,c.default)(r,2)[1];return a.firstChoice.plus(a.transfer).lt(i.firstChoice.plus(i.transfer))?r:t})),i=(0,c.default)(r,1)[0];if(y.options[i].eliminated=!0,y.options[i].transfer=(0,w.default)(0),l.map((function(t,r){return _objectSpread(_objectSpread({},t),{},{index:r})})).filter((function(t){return parseInt(t.choice)===parseInt(i)})).filter((function(t){return 0!==t.ballot[t.ballot.length-1]})).forEach((function(t){l[t.index].choice=l[t.index].ballot.pop(),y.options[l[t.index].choice].transfer=(0,w.default)(y.options[l[t.index].choice].transfer).plus(t.mkrSupport||0)})),Object.entries(y.options).forEach((function(t){var r=(0,c.default)(t,2),i=r[0],a=r[1],u=a.firstChoice,l=a.transfer;u.plus(l).gt(d.div(2))&&(y.winner=i)})),y.rounds>32&&!y.winner||(1===t.length||0===t.length)&&!y.winner){var a,u=(0,w.default)(0);Object.entries(y.options).forEach((function(t){var r=(0,c.default)(t,2),i=r[0],l=r[1],p=l.firstChoice,d=l.transfer;p.plus(d).gt(u)&&(u=p.plus(d),a=i)})),y.winner=a}if(2===Object.keys(y.options).length)return{v:y};if(1===Object.keys(y.options).length)throw new Error("Invalid ranked choice tally ".concat(y.options))};case 19:if(y.winner){p.next=25;break}if(v=g(),"object"!==(0,u.default)(v)){p.next=23;break}return p.abrupt("return",v.v);case 23:p.next=19;break;case 25:return y.options[y.winner].winner=!0,p.abrupt("return",y);case 27:case"end":return p.stop()}}),_callee12,this)}))),function getTallyRankedChoiceIrv(t){return l.apply(this,arguments)})},{key:"getPercentageMkrVoted",value:(a=(0,d.default)(p.default.mark((function _callee13(t){var r,i,a,u;return p.default.wrap((function _callee13$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,Promise.all([this.getMkrAmtVoted(t),this.get("token").getToken(_.MKR).totalSupply()]);case 2:return r=l.sent,i=(0,c.default)(r,2),a=i[0],u=i[1],l.abrupt("return",a.div(u).times(100).toNumber());case 7:case"end":return l.stop()}}),_callee13,this)}))),function getPercentageMkrVoted(t){return a.apply(this,arguments)})},{key:"getPercentageMkrVotedRankedChoice",value:(i=(0,d.default)(p.default.mark((function _callee14(t){var r,i,a,u;return p.default.wrap((function _callee14$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,Promise.all([this.getMkrAmtVotedRankedChoice(t),this.get("token").getToken(_.MKR).totalSupply()]);case 2:return r=l.sent,i=(0,c.default)(r,2),a=i[0],u=i[1],l.abrupt("return",a.div(u).times(100).toNumber());case 7:case"end":return l.stop()}}),_callee14,this)}))),function getPercentageMkrVotedRankedChoice(t){return i.apply(this,arguments)})},{key:"getWinningProposal",value:(r=(0,d.default)(p.default.mark((function _callee15(t){var r,i,a,u,c,l;return p.default.wrap((function _callee15$(p){for(;;)switch(p.prev=p.next){case 0:return p.next=2,this._getPoll(t);case 2:return r=p.sent,i=r.endDate,a=Math.floor(i/1e3),p.next=7,this.get("govQueryApi").getMkrSupport(t,a);case 7:for(u=p.sent,c=u[0],l=1;l<u.length;l++)u[l].mkrSupport>c.mkrSupport&&(c=u[l]);return p.abrupt("return",c?c.optionId:0);case 11:case"end":return p.stop()}}),_callee15,this)}))),function getWinningProposal(t){return r.apply(this,arguments)})}]),GovPollingService}(b.PrivateService);r.default=S},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(25)),c=a(i(8)),l=a(i(9)),p=a(i(1)),d=a(i(2)),y=a(i(5)),h=a(i(6)),g=a(i(3)),v=i(18),m=a(i(103)),b=i(24);function ownKeys(t,r){var i=Object.keys(t);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(t);r&&(a=a.filter((function(r){return Object.getOwnPropertyDescriptor(t,r).enumerable}))),i.push.apply(i,a)}return i}function _objectSpread(t){for(var r=1;r<arguments.length;r++){var i=null!=arguments[r]?arguments[r]:{};r%2?ownKeys(Object(i),!0).forEach((function(r){(0,u.default)(t,r,i[r])})):Object.getOwnPropertyDescriptors?Object.defineProperties(t,Object.getOwnPropertyDescriptors(i)):ownKeys(Object(i)).forEach((function(r){Object.defineProperty(t,r,Object.getOwnPropertyDescriptor(i,r))}))}return t}function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,g.default)(t);if(r){var u=(0,g.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,h.default)(this,i)}}var _=function(t){(0,y.default)(QueryApi,t);var r,i,a,u,h,g,v,_,w,x,S,O,E=_createSuper(QueryApi);function QueryApi(){var t,r=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"govQueryApi";return(0,p.default)(this,QueryApi),(t=E.call(this,r,["web3"])).queryPromises={},t.staging=!1,t}return(0,d.default)(QueryApi,[{key:"getQueryResponse",value:(O=(0,l.default)(c.default.mark((function _callee(t,r){var i,a,u;return c.default.wrap((function _callee$(c){for(;;)switch(c.prev=c.next){case 0:return c.next=2,fetch(t,{method:"POST",headers:{Accept:"application/json","Content-Type":"application/json"},body:JSON.stringify({query:r})});case 2:return i=c.sent,c.next=5,i.json();case 5:return a=c.sent,u=a.data,(0,m.default)(u,"error fetching data from ".concat(t)),c.abrupt("return",u);case 9:case"end":return c.stop()}}),_callee)}))),function getQueryResponse(t,r){return O.apply(this,arguments)})},{key:"getQueryResponseMemoized",value:(S=(0,l.default)(c.default.mark((function _callee2(t,r){var i;return c.default.wrap((function _callee2$(a){for(;;)switch(a.prev=a.next){case 0:if(i="".concat(t,";").concat(r),!this.queryPromises[i]){a.next=3;break}return a.abrupt("return",this.queryPromises[i]);case 3:return this.queryPromises[i]=this.getQueryResponse(t,r),a.abrupt("return",this.queryPromises[i]);case 5:case"end":return a.stop()}}),_callee2,this)}))),function getQueryResponseMemoized(t,r){return S.apply(this,arguments)})},{key:"initialize",value:function initialize(t){t.staging&&(this.staging=!0)}},{key:"connect",value:function connect(){var t=this.get("web3").network;this.serverUrl=this.staging?(0,b.netIdtoSpockUrlStaging)(t):(0,b.netIdtoSpockUrl)(t)}},{key:"getAllWhitelistedPolls",value:(x=(0,l.default)(c.default.mark((function _callee3(){var t;return c.default.wrap((function _callee3$(r){for(;;)switch(r.prev=r.next){case 0:return r.next=3,this.getQueryResponse(this.serverUrl,"{activePolls {\n      nodes {\n          creator\n          pollId\n          blockCreated\n          startDate\n          endDate\n          multiHash\n          url\n        }\n      }\n    }");case 3:return t=r.sent,r.abrupt("return",t.activePolls.nodes.map((function(t){return t.startDate=new Date(1e3*t.startDate),t.endDate=new Date(1e3*t.endDate),t})));case 5:case"end":return r.stop()}}),_callee3,this)}))),function getAllWhitelistedPolls(){return x.apply(this,arguments)})},{key:"getNumUniqueVoters",value:(w=(0,l.default)(c.default.mark((function _callee4(t){var r,i;return c.default.wrap((function _callee4$(a){for(;;)switch(a.prev=a.next){case 0:return r="{uniqueVoters(argPollId:".concat(t,"){\n      nodes\n    }\n    }"),a.next=3,this.getQueryResponse(this.serverUrl,r);case 3:return i=a.sent,a.abrupt("return",parseInt(i.uniqueVoters.nodes[0]));case 5:case"end":return a.stop()}}),_callee4,this)}))),function getNumUniqueVoters(t){return w.apply(this,arguments)})},{key:"getMkrWeight",value:(_=(0,l.default)(c.default.mark((function _callee5(t,r){var i,a;return c.default.wrap((function _callee5$(u){for(;;)switch(u.prev=u.next){case 0:return i='{totalMkrWeightProxyAndNoProxyByAddressAtTime(argAddress: "'.concat(t,'", argUnix: ').concat(r,"){\n      nodes {\n        address\n        weight\n      }\n    }\n    }"),u.next=3,this.getQueryResponse(this.serverUrl,i);case 3:if((a=u.sent).totalMkrWeightProxyAndNoProxyByAddressAtTime.nodes[0]){u.next=6;break}return u.abrupt("return",0);case 6:return u.abrupt("return",a.totalMkrWeightProxyAndNoProxyByAddressAtTime.nodes[0].weight);case 7:case"end":return u.stop()}}),_callee5,this)}))),function getMkrWeight(t,r){return _.apply(this,arguments)})},{key:"getOptionVotingFor",value:(v=(0,l.default)(c.default.mark((function _callee6(t,r){var i,a;return c.default.wrap((function _callee6$(u){for(;;)switch(u.prev=u.next){case 0:return i='{\n      currentVote(argAddress: "'.concat(t,'", argPollId: ').concat(r,"){\n        nodes{\n          optionId\n        }\n      }\n    }"),u.next=3,this.getQueryResponse(this.serverUrl,i);case 3:if((a=u.sent).currentVote.nodes[0]){u.next=6;break}return u.abrupt("return",null);case 6:return u.abrupt("return",a.currentVote.nodes[0].optionId);case 7:case"end":return u.stop()}}),_callee6,this)}))),function getOptionVotingFor(t,r){return v.apply(this,arguments)})},{key:"getAllOptionsVotingFor",value:(g=(0,l.default)(c.default.mark((function _callee7(t){var r,i;return c.default.wrap((function _callee7$(a){for(;;)switch(a.prev=a.next){case 0:return r='{\n      allCurrentVotes(argAddress: "'.concat(t,'"){\n        nodes{\n          pollId\n          optionId\n          optionIdRaw\n        }\n      }\n    }'),a.next=3,this.getQueryResponse(this.serverUrl,r);case 3:if((i=a.sent).allCurrentVotes.nodes[0]){a.next=6;break}return a.abrupt("return",null);case 6:return a.abrupt("return",i.allCurrentVotes.nodes);case 7:case"end":return a.stop()}}),_callee7,this)}))),function getAllOptionsVotingFor(t){return g.apply(this,arguments)})},{key:"getOptionVotingForRankedChoice",value:(h=(0,l.default)(c.default.mark((function _callee8(t,r){var i,a;return c.default.wrap((function _callee8$(u){for(;;)switch(u.prev=u.next){case 0:return i='{\n      currentVoteRankedChoice(argAddress: "'.concat(t,'", argPollId: ').concat(r,"){\n        nodes{\n          optionIdRaw\n        }\n      }\n    }"),u.next=3,this.getQueryResponse(this.serverUrl,i);case 3:if((a=u.sent).currentVoteRankedChoice.nodes[0]){u.next=6;break}return u.abrupt("return",null);case 6:return u.abrupt("return",a.currentVoteRankedChoice.nodes[0].optionIdRaw);case 7:case"end":return u.stop()}}),_callee8,this)}))),function getOptionVotingForRankedChoice(t,r){return h.apply(this,arguments)})},{key:"getBlockNumber",value:(u=(0,l.default)(c.default.mark((function _callee9(t){var r,i;return c.default.wrap((function _callee9$(a){for(;;)switch(a.prev=a.next){case 0:return r="{\n      timeToBlockNumber(argUnix: ".concat(t,"){\n      nodes\n    }\n    }"),a.next=3,this.getQueryResponseMemoized(this.serverUrl,r);case 3:return i=a.sent,a.abrupt("return",i.timeToBlockNumber.nodes[0]);case 5:case"end":return a.stop()}}),_callee9,this)}))),function getBlockNumber(t){return u.apply(this,arguments)})},{key:"getMkrSupportRankedChoice",value:(a=(0,l.default)(c.default.mark((function _callee10(t,r){var i,a;return c.default.wrap((function _callee10$(u){for(;;)switch(u.prev=u.next){case 0:return i="{voteMkrWeightsAtTimeRankedChoice(argPollId: ".concat(t,", argUnix: ").concat(r,"){\n      nodes{\n        optionIdRaw\n        mkrSupport\n      }\n    }\n    }"),u.next=3,this.getQueryResponseMemoized(this.serverUrl,i);case 3:return a=u.sent,u.abrupt("return",a.voteMkrWeightsAtTimeRankedChoice.nodes.filter((function(t){return"0"!==t.optionIdRaw})).map((function(t){var r=(0,b.toBuffer)(t.optionIdRaw,{endian:"little"}),i=(0,b.paddedArray)(32-r.length,r);return _objectSpread(_objectSpread({},t),{},{ballot:i})})));case 5:case"end":return u.stop()}}),_callee10,this)}))),function getMkrSupportRankedChoice(t,r){return a.apply(this,arguments)})},{key:"getMkrSupport",value:(i=(0,l.default)(c.default.mark((function _callee11(t,r){var i,a,u,l;return c.default.wrap((function _callee11$(c){for(;;)switch(c.prev=c.next){case 0:return i="{voteOptionMkrWeightsAtTime(argPollId: ".concat(t,", argUnix: ").concat(r,"){\n    nodes{\n      optionId\n      mkrSupport\n    }\n  }\n  }"),c.next=3,this.getQueryResponseMemoized(this.serverUrl,i);case 3:return a=c.sent,u=(u=a.voteOptionMkrWeightsAtTime.nodes).filter((function(t){return 0!==t.optionId})),l=u.reduce((function(t,r){return t+(isNaN(parseFloat(r.mkrSupport))?0:parseFloat(r.mkrSupport))}),0),c.abrupt("return",u.map((function(t){var r=isNaN(parseFloat(t.mkrSupport))?0:parseFloat(t.mkrSupport);return t.mkrSupport=r,t.percentage=100*r/l,t})));case 8:case"end":return c.stop()}}),_callee11,this)}))),function getMkrSupport(t,r){return i.apply(this,arguments)})},{key:"getEsmJoins",value:(r=(0,l.default)(c.default.mark((function _callee12(){var t,r;return c.default.wrap((function _callee12$(i){for(;;)switch(i.prev=i.next){case 0:return i.next=3,this.getQueryResponse(this.serverUrl,"{allEsmJoins {\n      nodes {\n        txFrom\n        txHash\n        joinAmount\n        blockTimestamp\n      }\n  }\n  }");case 3:return t=i.sent,r=t.allEsmJoins.nodes,i.abrupt("return",r);case 6:case"end":return i.stop()}}),_callee12,this)}))),function getEsmJoins(){return r.apply(this,arguments)})}]),QueryApi}(v.PublicService);r.default=_},function(t,r,i){var a=Object.getOwnPropertySymbols,u=Object.prototype.hasOwnProperty,c=Object.prototype.propertyIsEnumerable;function toObject(t){if(null==t)throw new TypeError("Object.assign cannot be called with null or undefined");return Object(t)}t.exports=function shouldUseNative(){try{if(!Object.assign)return!1;var t=new String("abc");if(t[5]="de","5"===Object.getOwnPropertyNames(t)[0])return!1;for(var r={},i=0;i<10;i++)r["_"+String.fromCharCode(i)]=i;if("0123456789"!==Object.getOwnPropertyNames(r).map((function(t){return r[t]})).join(""))return!1;var a={};return"abcdefghijklmnopqrst".split("").forEach((function(t){a[t]=t})),"abcdefghijklmnopqrst"===Object.keys(Object.assign({},a)).join("")}catch(t){return!1}}()?Object.assign:function(t,r){for(var i,l,p=toObject(t),d=1;d<arguments.length;d++){for(var y in i=Object(arguments[d]))u.call(i,y)&&(p[y]=i[y]);if(a){l=a(i);for(var h=0;h<l.length;h++)c.call(i,l[h])&&(p[l[h]]=i[l[h]])}}return p}},function(t,r,i){(function(t){var a=Object.getOwnPropertyDescriptors||function getOwnPropertyDescriptors(t){for(var r=Object.keys(t),i={},a=0;a<r.length;a++)i[r[a]]=Object.getOwnPropertyDescriptor(t,r[a]);return i},u=/%[sdj%]/g;r.format=function(t){if(!isString(t)){for(var r=[],i=0;i<arguments.length;i++)r.push(inspect(arguments[i]));return r.join(" ")}i=1;for(var a=arguments,c=a.length,l=String(t).replace(u,(function(t){if("%%"===t)return"%";if(i>=c)return t;switch(t){case"%s":return String(a[i++]);case"%d":return Number(a[i++]);case"%j":try{return JSON.stringify(a[i++])}catch(t){return"[Circular]"}default:return t}})),p=a[i];i<c;p=a[++i])isNull(p)||!isObject(p)?l+=" "+p:l+=" "+inspect(p);return l},r.deprecate=function(i,a){if(void 0!==t&&!0===t.noDeprecation)return i;if(void 0===t)return function(){return r.deprecate(i,a).apply(this,arguments)};var u=!1;return function deprecated(){if(!u){if(t.throwDeprecation)throw new Error(a);t.traceDeprecation?console.trace(a):console.error(a),u=!0}return i.apply(this,arguments)}};var c,l={};function inspect(t,i){var a={seen:[],stylize:stylizeNoColor};return arguments.length>=3&&(a.depth=arguments[2]),arguments.length>=4&&(a.colors=arguments[3]),isBoolean(i)?a.showHidden=i:i&&r._extend(a,i),isUndefined(a.showHidden)&&(a.showHidden=!1),isUndefined(a.depth)&&(a.depth=2),isUndefined(a.colors)&&(a.colors=!1),isUndefined(a.customInspect)&&(a.customInspect=!0),a.colors&&(a.stylize=stylizeWithColor),formatValue(a,t,a.depth)}function stylizeWithColor(t,r){var i=inspect.styles[r];return i?"["+inspect.colors[i][0]+"m"+t+"["+inspect.colors[i][1]+"m":t}function stylizeNoColor(t,r){return t}function formatValue(t,i,a){if(t.customInspect&&i&&isFunction(i.inspect)&&i.inspect!==r.inspect&&(!i.constructor||i.constructor.prototype!==i)){var u=i.inspect(a,t);return isString(u)||(u=formatValue(t,u,a)),u}var c=function formatPrimitive(t,r){if(isUndefined(r))return t.stylize("undefined","undefined");if(isString(r)){var i="'"+JSON.stringify(r).replace(/^"|"$/g,"").replace(/'/g,"\\'").replace(/\\"/g,'"')+"'";return t.stylize(i,"string")}if(isNumber(r))return t.stylize(""+r,"number");if(isBoolean(r))return t.stylize(""+r,"boolean");if(isNull(r))return t.stylize("null","null")}(t,i);if(c)return c;var l=Object.keys(i),p=function arrayToHash(t){var r={};return t.forEach((function(t,i){r[t]=!0})),r}(l);if(t.showHidden&&(l=Object.getOwnPropertyNames(i)),isError(i)&&(l.indexOf("message")>=0||l.indexOf("description")>=0))return formatError(i);if(0===l.length){if(isFunction(i)){var d=i.name?": "+i.name:"";return t.stylize("[Function"+d+"]","special")}if(isRegExp(i))return t.stylize(RegExp.prototype.toString.call(i),"regexp");if(isDate(i))return t.stylize(Date.prototype.toString.call(i),"date");if(isError(i))return formatError(i)}var y,h="",g=!1,v=["{","}"];(isArray(i)&&(g=!0,v=["[","]"]),isFunction(i))&&(h=" [Function"+(i.name?": "+i.name:"")+"]");return isRegExp(i)&&(h=" "+RegExp.prototype.toString.call(i)),isDate(i)&&(h=" "+Date.prototype.toUTCString.call(i)),isError(i)&&(h=" "+formatError(i)),0!==l.length||g&&0!=i.length?a<0?isRegExp(i)?t.stylize(RegExp.prototype.toString.call(i),"regexp"):t.stylize("[Object]","special"):(t.seen.push(i),y=g?function formatArray(t,r,i,a,u){for(var c=[],l=0,p=r.length;l<p;++l)hasOwnProperty(r,String(l))?c.push(formatProperty(t,r,i,a,String(l),!0)):c.push("");return u.forEach((function(u){u.match(/^\d+$/)||c.push(formatProperty(t,r,i,a,u,!0))})),c}(t,i,a,p,l):l.map((function(r){return formatProperty(t,i,a,p,r,g)})),t.seen.pop(),function reduceToSingleString(t,r,i){if(t.reduce((function(t,r){return r.indexOf("\n")>=0&&0,t+r.replace(/\u001b\[\d\d?m/g,"").length+1}),0)>60)return i[0]+(""===r?"":r+"\n ")+" "+t.join(",\n  ")+" "+i[1];return i[0]+r+" "+t.join(", ")+" "+i[1]}(y,h,v)):v[0]+h+v[1]}function formatError(t){return"["+Error.prototype.toString.call(t)+"]"}function formatProperty(t,r,i,a,u,c){var l,p,d;if((d=Object.getOwnPropertyDescriptor(r,u)||{value:r[u]}).get?p=d.set?t.stylize("[Getter/Setter]","special"):t.stylize("[Getter]","special"):d.set&&(p=t.stylize("[Setter]","special")),hasOwnProperty(a,u)||(l="["+u+"]"),p||(t.seen.indexOf(d.value)<0?(p=isNull(i)?formatValue(t,d.value,null):formatValue(t,d.value,i-1)).indexOf("\n")>-1&&(p=c?p.split("\n").map((function(t){return"  "+t})).join("\n").substr(2):"\n"+p.split("\n").map((function(t){return"   "+t})).join("\n")):p=t.stylize("[Circular]","special")),isUndefined(l)){if(c&&u.match(/^\d+$/))return p;(l=JSON.stringify(""+u)).match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)?(l=l.substr(1,l.length-2),l=t.stylize(l,"name")):(l=l.replace(/'/g,"\\'").replace(/\\"/g,'"').replace(/(^"|"$)/g,"'"),l=t.stylize(l,"string"))}return l+": "+p}function isArray(t){return Array.isArray(t)}function isBoolean(t){return"boolean"==typeof t}function isNull(t){return null===t}function isNumber(t){return"number"==typeof t}function isString(t){return"string"==typeof t}function isUndefined(t){return void 0===t}function isRegExp(t){return isObject(t)&&"[object RegExp]"===objectToString(t)}function isObject(t){return"object"==typeof t&&null!==t}function isDate(t){return isObject(t)&&"[object Date]"===objectToString(t)}function isError(t){return isObject(t)&&("[object Error]"===objectToString(t)||t instanceof Error)}function isFunction(t){return"function"==typeof t}function objectToString(t){return Object.prototype.toString.call(t)}function pad(t){return t<10?"0"+t.toString(10):t.toString(10)}r.debuglog=function(i){if(isUndefined(c)&&(c=t.env.NODE_DEBUG||""),i=i.toUpperCase(),!l[i])if(new RegExp("\\b"+i+"\\b","i").test(c)){var a=t.pid;l[i]=function(){var t=r.format.apply(r,arguments);console.error("%s %d: %s",i,a,t)}}else l[i]=function(){};return l[i]},r.inspect=inspect,inspect.colors={bold:[1,22],italic:[3,23],underline:[4,24],inverse:[7,27],white:[37,39],grey:[90,39],black:[30,39],blue:[34,39],cyan:[36,39],green:[32,39],magenta:[35,39],red:[31,39],yellow:[33,39]},inspect.styles={special:"cyan",number:"yellow",boolean:"yellow",undefined:"grey",null:"bold",string:"green",date:"magenta",regexp:"red"},r.isArray=isArray,r.isBoolean=isBoolean,r.isNull=isNull,r.isNullOrUndefined=function isNullOrUndefined(t){return null==t},r.isNumber=isNumber,r.isString=isString,r.isSymbol=function isSymbol(t){return"symbol"==typeof t},r.isUndefined=isUndefined,r.isRegExp=isRegExp,r.isObject=isObject,r.isDate=isDate,r.isError=isError,r.isFunction=isFunction,r.isPrimitive=function isPrimitive(t){return null===t||"boolean"==typeof t||"number"==typeof t||"string"==typeof t||"symbol"==typeof t||void 0===t},r.isBuffer=i(259);var p=["Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"];function timestamp(){var t=new Date,r=[pad(t.getHours()),pad(t.getMinutes()),pad(t.getSeconds())].join(":");return[t.getDate(),p[t.getMonth()],r].join(" ")}function hasOwnProperty(t,r){return Object.prototype.hasOwnProperty.call(t,r)}r.log=function(){console.log("%s - %s",timestamp(),r.format.apply(r,arguments))},r.inherits=i(260),r._extend=function(t,r){if(!r||!isObject(r))return t;for(var i=Object.keys(r),a=i.length;a--;)t[i[a]]=r[i[a]];return t};var d="undefined"!=typeof Symbol?Symbol("util.promisify.custom"):void 0;function callbackifyOnRejected(t,r){if(!t){var i=new Error("Promise was rejected with a falsy value");i.reason=t,t=i}return r(t)}r.promisify=function promisify(t){if("function"!=typeof t)throw new TypeError('The "original" argument must be of type Function');if(d&&t[d]){var r;if("function"!=typeof(r=t[d]))throw new TypeError('The "util.promisify.custom" argument must be of type Function');return Object.defineProperty(r,d,{value:r,enumerable:!1,writable:!1,configurable:!0}),r}function r(){for(var r,i,a=new Promise((function(t,a){r=t,i=a})),u=[],c=0;c<arguments.length;c++)u.push(arguments[c]);u.push((function(t,a){t?i(t):r(a)}));try{t.apply(this,u)}catch(t){i(t)}return a}return Object.setPrototypeOf(r,Object.getPrototypeOf(t)),d&&Object.defineProperty(r,d,{value:r,enumerable:!1,writable:!1,configurable:!0}),Object.defineProperties(r,a(t))},r.promisify.custom=d,r.callbackify=function callbackify(r){if("function"!=typeof r)throw new TypeError('The "original" argument must be of type Function');function callbackified(){for(var i=[],a=0;a<arguments.length;a++)i.push(arguments[a]);var u=i.pop();if("function"!=typeof u)throw new TypeError("The last argument must be of type Function");var c=this,cb=function(){return u.apply(c,arguments)};r.apply(this,i).then((function(r){t.nextTick(cb,null,r)}),(function(r){t.nextTick(callbackifyOnRejected,r,cb)}))}return Object.setPrototypeOf(callbackified,Object.getPrototypeOf(r)),Object.defineProperties(callbackified,a(r)),callbackified}}).call(this,i(90))},function(t,r){t.exports=function isBuffer(t){return t&&"object"==typeof t&&"function"==typeof t.copy&&"function"==typeof t.fill&&"function"==typeof t.readUInt8}},function(t,r){"function"==typeof Object.create?t.exports=function inherits(t,r){t.super_=r,t.prototype=Object.create(r.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}})}:t.exports=function inherits(t,r){t.super_=r;var TempCtor=function(){};TempCtor.prototype=r.prototype,t.prototype=new TempCtor,t.prototype.constructor=t}},function(t,r,i){var a=i(0),u=i(58);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var c,l,p,d=a(i(23)),y=a(i(8)),h=a(i(9)),g=a(i(1)),v=a(i(2)),m=a(i(5)),b=a(i(6)),_=a(i(3)),w=a(i(262)),x=i(18),S=i(10),O=i(24),E=u(i(263));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,_.default)(t);if(r){var u=(0,_.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,b.default)(this,i)}}var k=(c=(0,E.tracksTransactionsWithOptions)({numArguments:3}),l=(0,E.tracksTransactionsWithOptions)({numArguments:2}),p=function(t){(0,m.default)(EsmService,t);var r,i,a,u,c,l,p,b,_,w=_createSuper(EsmService);function EsmService(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"esm";return(0,g.default)(this,EsmService),w.call(this,t,["smartContract","web3","token","allowance","govQueryApi"])}return(0,v.default)(EsmService,[{key:"thresholdAmount",value:(_=(0,h.default)(y.default.mark((function _callee(){var t;return y.default.wrap((function _callee$(r){for(;;)switch(r.prev=r.next){case 0:return r.next=2,this._esmContract().min();case 2:return t=r.sent,r.abrupt("return",(0,O.getCurrency)(t,S.MKR).shiftedBy(-18));case 4:case"end":return r.stop()}}),_callee,this)}))),function thresholdAmount(){return _.apply(this,arguments)})},{key:"fired",value:(b=(0,h.default)(y.default.mark((function _callee2(){var t;return y.default.wrap((function _callee2$(r){for(;;)switch(r.prev=r.next){case 0:return r.next=2,this._esmContract().fired();case 2:return t=r.sent,r.abrupt("return",t.eq(1));case 4:case"end":return r.stop()}}),_callee2,this)}))),function fired(){return b.apply(this,arguments)})},{key:"emergencyShutdownActive",value:(p=(0,h.default)(y.default.mark((function _callee3(){var t;return y.default.wrap((function _callee3$(r){for(;;)switch(r.prev=r.next){case 0:return r.next=2,this._endContract().live();case 2:return t=r.sent,r.abrupt("return",t.eq(0));case 4:case"end":return r.stop()}}),_callee3,this)}))),function emergencyShutdownActive(){return p.apply(this,arguments)})},{key:"canFire",value:(l=(0,h.default)(y.default.mark((function _callee4(){var t,r,i,a;return y.default.wrap((function _callee4$(u){for(;;)switch(u.prev=u.next){case 0:return u.next=2,Promise.all([this.fired(),this.emergencyShutdownActive()]);case 2:return t=u.sent,r=(0,d.default)(t,2),i=r[0],a=r[1],u.abrupt("return",!i&&!a);case 7:case"end":return u.stop()}}),_callee4,this)}))),function canFire(){return l.apply(this,arguments)})},{key:"getTotalStaked",value:(c=(0,h.default)(y.default.mark((function _callee5(){var t;return y.default.wrap((function _callee5$(r){for(;;)switch(r.prev=r.next){case 0:return r.next=2,this._esmContract().Sum();case 2:return t=r.sent,r.abrupt("return",(0,O.getCurrency)(t,S.MKR).shiftedBy(-18));case 4:case"end":return r.stop()}}),_callee5,this)}))),function getTotalStaked(){return c.apply(this,arguments)})},{key:"getTotalStakedByAddress",value:(u=(0,h.default)(y.default.mark((function _callee6(){var t,r,i=arguments;return y.default.wrap((function _callee6$(a){for(;;)switch(a.prev=a.next){case 0:return(t=i.length>0&&void 0!==i[0]&&i[0])||(t=this.get("web3").currentAddress()),a.next=4,this._esmContract().sum(t);case 4:return r=a.sent,a.abrupt("return",(0,O.getCurrency)(r,S.MKR).shiftedBy(-18));case 6:case"end":return a.stop()}}),_callee6,this)}))),function getTotalStakedByAddress(){return u.apply(this,arguments)})},{key:"stake",value:(a=(0,h.default)(y.default.mark((function _callee7(t){var r,i,a,u,c,l,p,h,g=arguments;return y.default.wrap((function _callee7$(y){for(;;)switch(y.prev=y.next){case 0:if(r=g.length>1&&void 0!==g[1]&&g[1],i=g.length>2?g[2]:void 0,a=i.promise,u=(0,O.getCurrency)(t,S.MKR),r){y.next=14;break}return y.next=6,Promise.all([this.fired(),this.get("token").getToken(S.MKR).balance()]);case 6:if(c=y.sent,l=(0,d.default)(c,2),p=l[0],h=l[1],!p){y.next=12;break}throw new Error("cannot join when emergency shutdown has been fired");case 12:if(!h.lt(u)){y.next=14;break}throw new Error("amount to join is greater than the user balance");case 14:return y.abrupt("return",this._esmContract().join(u.toFixed("wei"),{promise:a}));case 15:case"end":return y.stop()}}),_callee7,this)}))),function stake(t){return a.apply(this,arguments)})},{key:"triggerEmergencyShutdown",value:(i=(0,h.default)(y.default.mark((function _callee8(){var t,r,i,a,u,c,l=arguments;return y.default.wrap((function _callee8$(p){for(;;)switch(p.prev=p.next){case 0:if(t=l.length>0&&void 0!==l[0]&&l[0],(l.length>1?l[1]:void 0).promise,t){p.next=14;break}return p.next=5,Promise.all([this.thresholdAmount(),this.getTotalStaked(),this.canFire()]);case 5:if(r=p.sent,i=(0,d.default)(r,3),a=i[0],u=i[1],c=i[2],!u.lt(a)){p.next=12;break}throw new Error("total amount of staked MKR has not reached the required threshold");case 12:if(c){p.next=14;break}throw new Error("emergency shutdown has already been initiated");case 14:return p.abrupt("return",this._esmContract().fire());case 15:case"end":return p.stop()}}),_callee8,this)}))),function triggerEmergencyShutdown(){return i.apply(this,arguments)})},{key:"getStakingHistory",value:(r=(0,h.default)(y.default.mark((function _callee9(){var t,r,i;return y.default.wrap((function _callee9$(a){for(;;)switch(a.prev=a.next){case 0:return a.next=2,this.get("govQueryApi").getEsmJoins();case 2:return t=a.sent,r=t.map((function(t){return{transactionHash:t.txHash,senderAddress:t.txFrom,amount:(0,S.MKR)(t.joinAmount),time:new Date(t.blockTimestamp)}})),i=r.sort((function(t,r){return r.time-t.time})),a.abrupt("return",i);case 6:case"end":return a.stop()}}),_callee9,this)}))),function getStakingHistory(){return r.apply(this,arguments)})},{key:"_esmContract",value:function _esmContract(){return this.get("smartContract").getContractByName(S.ESM)}},{key:"_endContract",value:function _endContract(){return this.get("smartContract").getContractByName(S.END)}}]),EsmService}(x.PrivateService),(0,w.default)(p.prototype,"stake",[c],Object.getOwnPropertyDescriptor(p.prototype,"stake"),p.prototype),(0,w.default)(p.prototype,"triggerEmergencyShutdown",[l],Object.getOwnPropertyDescriptor(p.prototype,"triggerEmergencyShutdown"),p.prototype),p);r.default=k},function(t,r){t.exports=function _applyDecoratedDescriptor(t,r,i,a,u){var c={};return Object.keys(a).forEach((function(t){c[t]=a[t]})),c.enumerable=!!c.enumerable,c.configurable=!!c.configurable,("value"in c||c.initializer)&&(c.writable=!0),c=i.slice().reverse().reduce((function(i,a){return a(t,r,i)||i}),c),u&&void 0!==c.initializer&&(c.value=c.initializer?c.initializer.call(u):void 0,c.initializer=void 0),void 0===c.initializer&&(Object.defineProperty(t,r,c),c=null),c}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.tracksTransactionsWithOptions=tracksTransactionsWithOptions,r.default=void 0;var u=a(i(8)),c=a(i(64)),l=a(i(9)),p=a(i(15)),d=a(i(264)),y=tracksTransactionsWithOptions({});function tracksTransactionsWithOptions(t){var r=t.numArguments;return function(t,i,a){var y=a.value,h=r||y.length;return a.value=function(){for(var t=this,r=arguments.length,i=new Array(r),a=0;a<r;a++)i[a]=arguments[a];var g,v=i[i.length-1];"object"===(0,p.default)(v)&&null!==v&&v.constructor===Object?(i=i.slice(0,i.length-1),g=v):g={};var m=(0,l.default)(u.default.mark((function _callee(){var r;return u.default.wrap((function _callee$(a){for(;;)switch(a.prev=a.next){case 0:return a.next=2,0;case 2:return g.promise||(g.promise=m),r=[].concat((0,c.default)(i),(0,c.default)((0,d.default)(h-1-i.length,(function(){}))),[g]),a.abrupt("return",y.apply(t,r));case 5:case"end":return a.stop()}}),_callee)})))();return m},a}}r.default=y},function(t,r,i){var a=i(97),u=i(265),c=i(104),l=Math.min;t.exports=function times(t,r){if((t=c(t))<1||t>9007199254740991)return[];var i=4294967295,p=l(t,4294967295);r=u(r),t-=4294967295;for(var d=a(p,r);++i<t;)r(i);return d}},function(t,r,i){var a=i(266);t.exports=function castFunction(t){return"function"==typeof t?t:a}},function(t,r){t.exports=function identity(t){return t}},function(t,r,i){var a=i(268);t.exports=function toFinite(t){return t?(t=a(t))===1/0||t===-1/0?17976931348623157e292*(t<0?-1:1):t==t?t:0:0===t?t:0}},function(t,r,i){var a=i(63),u=i(105),c=/^\s+|\s+$/g,l=/^[-+]0x[0-9a-f]+$/i,p=/^0b[01]+$/i,d=/^0o[0-7]+$/i,y=parseInt;t.exports=function toNumber(t){if("number"==typeof t)return t;if(u(t))return NaN;if(a(t)){var r="function"==typeof t.valueOf?t.valueOf():t;t=a(r)?r+"":r}if("string"!=typeof t)return 0===t?t:+t;t=t.replace(c,"");var i=p.test(t);return i||d.test(t)?y(t.slice(2),i?2:8):l.test(t)?NaN:+t}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(23)),c=a(i(8)),l=a(i(9)),p=a(i(1)),d=a(i(2)),y=a(i(5)),h=a(i(6)),g=a(i(3)),v=i(18),m=i(10),b=a(i(270)),_=a(i(271)),w=a(i(103)),x=a(i(102)),S=i(24);function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,g.default)(t);if(r){var u=(0,g.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,h.default)(this,i)}}var O=x.default.pause,E=function(t){(0,y.default)(SpellService,t);var r,i,a,h,g,v=_createSuper(SpellService);function SpellService(){var t,r=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"spell";return(0,p.default)(this,SpellService),(t=v.call(this,r,["smartContract","web3"])).eta={},t.done={},t.action={},t.executionDate={},t.scheduledDate={},t}return(0,d.default)(SpellService,[{key:"getDelayInSeconds",value:function getDelayInSeconds(){return this.delay||(this.delay=this._pauseContract().delay()),this.delay}},{key:"getEta",value:(g=(0,l.default)(c.default.mark((function _callee(t){var r,i;return c.default.wrap((function _callee$(a){for(;;)switch(a.prev=a.next){case 0:if(!this.eta[t]){a.next=2;break}return a.abrupt("return",this.eta[t]);case 2:return r=this.get("smartContract").getContractByAddressAndAbi(t,b.default),a.next=5,r.eta();case 5:if((i=a.sent).toNumber()){a.next=8;break}return a.abrupt("return",void 0);case 8:return this.eta[t]=new Date(1e3*i.toNumber()),a.abrupt("return",this.eta[t]);case 10:case"end":return a.stop()}}),_callee,this)}))),function getEta(t){return g.apply(this,arguments)})},{key:"getScheduledDate",value:(h=(0,l.default)(c.default.mark((function _callee2(t){var r,i,a,l,p,d,y,h,g,v,m;return c.default.wrap((function _callee2$(c){for(;;)switch(c.prev=c.next){case 0:if(!this.scheduledDate[t]){c.next=2;break}return c.abrupt("return",this.scheduledDate[t]);case 2:return c.next=4,this.getEta(t);case 4:return r=c.sent,(0,w.default)(r,"spell ".concat(t," has not been scheduled")),i=this._pauseContract().address,a=this.get("web3"),l=a.network,p=(0,S.netIdToName)(l),d="0x"+(0,_.default)(t.replace(/^0x/,""),64,"0"),c.next=13,a.getPastLogs({fromBlock:O.inception_block[p],toBlock:"latest",address:i,topics:[O.events.plot,d]});case 13:return y=c.sent,h=(0,u.default)(y,1),g=h[0],c.next=18,a.getBlock(g.blockNumber);case 18:return v=c.sent,m=v.timestamp,this.scheduledDate[t]=new Date(1e3*m),c.abrupt("return",this.scheduledDate[t]);case 22:case"end":return c.stop()}}),_callee2,this)}))),function getScheduledDate(t){return h.apply(this,arguments)})},{key:"getDone",value:(a=(0,l.default)(c.default.mark((function _callee3(t){var r;return c.default.wrap((function _callee3$(i){for(;;)switch(i.prev=i.next){case 0:if(!this.done[t]){i.next=2;break}return i.abrupt("return",this.done[t]);case 2:return r=this.get("smartContract").getContractByAddressAndAbi(t,b.default),this.done[t]=r.done(),i.abrupt("return",this.done[t]);case 5:case"end":return i.stop()}}),_callee3,this)}))),function getDone(t){return a.apply(this,arguments)})},{key:"getAction",value:(i=(0,l.default)(c.default.mark((function _callee4(t){var r;return c.default.wrap((function _callee4$(i){for(;;)switch(i.prev=i.next){case 0:if(!this.action[t]){i.next=2;break}return i.abrupt("return",this.action[t]);case 2:return r=this.get("smartContract").getContractByAddressAndAbi(t,b.default),this.action[t]=r.action(),i.abrupt("return",this.action[t]);case 5:case"end":return i.stop()}}),_callee4,this)}))),function getAction(t){return i.apply(this,arguments)})},{key:"getExecutionDate",value:(r=(0,l.default)(c.default.mark((function _callee5(t){var r,i,a,l,p,d,y,h,g,v,m;return c.default.wrap((function _callee5$(c){for(;;)switch(c.prev=c.next){case 0:if(!this.executionDate[t]){c.next=2;break}return c.abrupt("return",this.executionDate[t]);case 2:return c.next=4,this.getDone(t);case 4:return r=c.sent,(0,w.default)(r,"spell ".concat(t," has not been executed")),i=this._pauseContract().address,a=this.get("web3"),l=a.network,p=(0,S.netIdToName)(l),d="0x"+(0,_.default)(t.replace(/^0x/,""),64,"0"),c.next=13,a.getPastLogs({fromBlock:O.inception_block[p],toBlock:"latest",address:i,topics:[O.events.exec,d]});case 13:return y=c.sent,h=(0,u.default)(y,1),g=h[0],c.next=18,a.getBlock(g.blockNumber);case 18:return v=c.sent,m=v.timestamp,this.executionDate[t]=new Date(1e3*m),c.abrupt("return",this.executionDate[t]);case 22:case"end":return c.stop()}}),_callee5,this)}))),function getExecutionDate(t){return r.apply(this,arguments)})},{key:"refresh",value:function refresh(){this.delay=null,this.eta={},this.done={},this.executionDate={},this.scheduledDate={}}},{key:"_pauseContract",value:function _pauseContract(){return this.get("smartContract").getContractByName(m.PAUSE)}}]),SpellService}(v.PublicService);r.default=E},function(t){t.exports=JSON.parse('[{"inputs":[],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"constant":true,"inputs":[],"name":"SAIMOM","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"SCDCAP","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"action","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"cast","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"done","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"eta","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"pause","outputs":[{"internalType":"contract DSPauseAbstract","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"schedule","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"sig","outputs":[{"internalType":"bytes","name":"","type":"bytes"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"tag","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"payable":false,"stateMutability":"view","type":"function"}]')},function(t,r,i){var a=i(272),u=i(107),c=i(104),l=i(282);t.exports=function padStart(t,r,i){t=l(t);var p=(r=c(r))?u(t):0;return r&&p<r?a(r-p,i)+t:t}},function(t,r,i){var a=i(273),u=i(106),c=i(274),l=i(65),p=i(107),d=i(279),y=Math.ceil;t.exports=function createPadding(t,r){var i=(r=void 0===r?" ":u(r)).length;if(i<2)return i?a(r,t):r;var h=a(r,y(t/p(r)));return l(r)?c(d(h),0,t).join(""):h.slice(0,t)}},function(t,r){var i=Math.floor;t.exports=function baseRepeat(t,r){var a="";if(!t||r<1||r>9007199254740991)return a;do{r%2&&(a+=t),(r=i(r/2))&&(t+=t)}while(r);return a}},function(t,r,i){var a=i(275);t.exports=function castSlice(t,r,i){var u=t.length;return i=void 0===i?u:i,!r&&i>=u?t:a(t,r,i)}},function(t,r){t.exports=function baseSlice(t,r,i){var a=-1,u=t.length;r<0&&(r=-r>u?0:u+r),(i=i>u?u:i)<0&&(i+=u),u=r>i?0:i-r>>>0,r>>>=0;for(var c=Array(u);++a<u;)c[a]=t[a+r];return c}},function(t,r,i){var a=i(277)("length");t.exports=a},function(t,r){t.exports=function baseProperty(t){return function(r){return null==r?void 0:r[t]}}},function(t,r){var i="[\\ud800-\\udfff]",a="[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff]",u="\\ud83c[\\udffb-\\udfff]",c="[^\\ud800-\\udfff]",l="(?:\\ud83c[\\udde6-\\uddff]){2}",p="[\\ud800-\\udbff][\\udc00-\\udfff]",d="(?:"+a+"|"+u+")"+"?",y="[\\ufe0e\\ufe0f]?"+d+("(?:\\u200d(?:"+[c,l,p].join("|")+")[\\ufe0e\\ufe0f]?"+d+")*"),h="(?:"+[c+a+"?",a,l,p,i].join("|")+")",g=RegExp(u+"(?="+u+")|"+h+y,"g");t.exports=function unicodeSize(t){for(var r=g.lastIndex=0;g.test(t);)++r;return r}},function(t,r,i){var a=i(280),u=i(65),c=i(281);t.exports=function stringToArray(t){return u(t)?c(t):a(t)}},function(t,r){t.exports=function asciiToArray(t){return t.split("")}},function(t,r){var i="[\\ud800-\\udfff]",a="[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff]",u="\\ud83c[\\udffb-\\udfff]",c="[^\\ud800-\\udfff]",l="(?:\\ud83c[\\udde6-\\uddff]){2}",p="[\\ud800-\\udbff][\\udc00-\\udfff]",d="(?:"+a+"|"+u+")"+"?",y="[\\ufe0e\\ufe0f]?"+d+("(?:\\u200d(?:"+[c,l,p].join("|")+")[\\ufe0e\\ufe0f]?"+d+")*"),h="(?:"+[c+a+"?",a,l,p,i].join("|")+")",g=RegExp(u+"(?="+u+")|"+h+y,"g");t.exports=function unicodeToArray(t){return t.match(g)||[]}},function(t,r,i){var a=i(106);t.exports=function toString(t){return null==t?"":a(t)}},function(t){t.exports=JSON.parse('{"CHIEF":"0xbbffc76e94b34f72d96d054b31f6424249c1337d","VOTE_PROXY_FACTORY":"0x3e08741a68c2d964d172793cd0ad14292f658cd8","POLLING":"0x518a0702701BF98b5242E73b2368ae07562BEEA3","BATCH_POLLING":"0xD931E7c869618dB6FD30cfE4e89248CAA091Ea5f","MCD_ESM":"0x0c376764f585828ffb52471c1c35f855e312a06c","MCD_END":"0x24728acf2e2c403f5d2db4df6834b8998e56aa5f","GOV":"0xaaf64bfcc32d0f15873a02163e7e500671a4ffcd","IOU":"0x4D5d2F7E1284bc5c871ce3e1A997Bd8646c75ba5","PAUSE":"0x8754e6ecb4fe68daa5132c2886ab39297a5c7189"}')},function(t){t.exports=JSON.parse('{"CHIEF":"0x9eF05f7F6deB616fd37aC3c959a2dDD25A54E4F5","VOTE_PROXY_FACTORY":"0x868ba9aeacA5B73c7C27F3B01588bf4F1339F2bC","GOV":"0x9f8f72aa9304c8b593d555f12ef6589cc3a579a2","IOU":"0x496C67A4CEd9C453A60F3166AB4B329870c8E355","POLLING":"0xF9be8F0945acDdeeDaA64DFCA5Fe9629D0CF8E5D","BATCH_POLLING":"0xD3A9FE267852281a1e6307a1C37CDfD76d39b133","MCD_ESM":"0x0581a0abe32aae9b5f0f68defab77c6759100085","MCD_END":"0xab14d3ce3f733cacb76ec2abe7d2fcb00c99f3d5","PAUSE":"0xbe286431454714f511008713973d3b053a2d38f3"}')},function(t){t.exports=JSON.parse('{"IOU":"0x14f7e74A26a0e6791523451d85129babf01cFd44","CHIEF":"0x863d1CdF27146631585A274916C23A627Bd960C1","POLLING":"0x9A2810a12197CB844af4BA74a4b81bC1CA727130","BATCH_POLLING":"0xa9D33Ce18803b0742460ffb1b33B6c40f95178BC","VOTE_PROXY_FACTORY":"0x059B38F71E37F6f66572946e9cc7C8052A3f6626","MCD_ESM":"0x6D6e3B9B602a0a37c820F2383A1DD0EC02B5196d","MCD_END":"0x2d7f58ABB321ee1c63e8aBFF89A7CC100E7EEd01","PAUSE":"0x2125C30dA5DcA0819aEC5e4cdbF58Bfe91918e43","MCD_ADM":"0x5Ac5c0D0047A3F841D16eE1d8b0788f8d104F96b","MCD_IOU":"0x4E839c73FC50e6DF22Bfe1861b0dB1CEDC314C9f","SAI_GOV":"0x1c3ac7216250edc5b9daa5598da0579688b9dbd5"}')},function(t){t.exports=JSON.parse('[{"inputs":[{"internalType":"address","name":"gem_","type":"address"},{"internalType":"address","name":"end_","type":"address"},{"internalType":"address","name":"pit_","type":"address"},{"internalType":"uint256","name":"min_","type":"uint256"}],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"anonymous":true,"inputs":[{"indexed":true,"internalType":"bytes4","name":"sig","type":"bytes4"},{"indexed":true,"internalType":"address","name":"usr","type":"address"},{"indexed":true,"internalType":"bytes32","name":"arg1","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"arg2","type":"bytes32"},{"indexed":false,"internalType":"bytes","name":"data","type":"bytes"}],"name":"LogNote","type":"event"},{"constant":true,"inputs":[],"name":"Sum","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"end","outputs":[{"internalType":"contract EndLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"fire","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"fired","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"gem","outputs":[{"internalType":"contract GemLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"uint256","name":"wad","type":"uint256"}],"name":"join","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"min","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"pit","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"sum","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"}]')},function(t){t.exports=JSON.parse('[{"inputs":[],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"anonymous":true,"inputs":[{"indexed":true,"internalType":"bytes4","name":"sig","type":"bytes4"},{"indexed":true,"internalType":"address","name":"usr","type":"address"},{"indexed":true,"internalType":"bytes32","name":"arg1","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"arg2","type":"bytes32"},{"indexed":false,"internalType":"bytes","name":"data","type":"bytes"}],"name":"LogNote","type":"event"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"Art","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"bag","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"cage","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"}],"name":"cage","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"},{"internalType":"uint256","name":"wad","type":"uint256"}],"name":"cash","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"cat","outputs":[{"internalType":"contract CatLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"debt","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"guy","type":"address"}],"name":"deny","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"what","type":"bytes32"},{"internalType":"uint256","name":"data","type":"uint256"}],"name":"file","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"what","type":"bytes32"},{"internalType":"address","name":"data","type":"address"}],"name":"file","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"fix","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"}],"name":"flow","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"}],"name":"free","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"gap","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"live","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"},{"internalType":"address","name":"","type":"address"}],"name":"out","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"uint256","name":"wad","type":"uint256"}],"name":"pack","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"pot","outputs":[{"internalType":"contract PotLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"guy","type":"address"}],"name":"rely","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"},{"internalType":"address","name":"urn","type":"address"}],"name":"skim","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"},{"internalType":"uint256","name":"id","type":"uint256"}],"name":"skip","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"spot","outputs":[{"internalType":"contract Spotty","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"tag","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"thaw","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"vat","outputs":[{"internalType":"contract VatLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"vow","outputs":[{"internalType":"contract VowLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"wait","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"wards","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"when","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"}]')},function(t){t.exports=JSON.parse('[{"inputs":[{"internalType":"contract DSToken","name":"GOV","type":"address"},{"internalType":"contract DSToken","name":"IOU","type":"address"},{"internalType":"uint256","name":"MAX_YAYS","type":"uint256"}],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"slate","type":"bytes32"}],"name":"Etch","type":"event"},{"anonymous":true,"inputs":[{"indexed":true,"internalType":"bytes4","name":"sig","type":"bytes4"},{"indexed":true,"internalType":"address","name":"guy","type":"address"},{"indexed":true,"internalType":"bytes32","name":"foo","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"bar","type":"bytes32"},{"indexed":false,"internalType":"uint256","name":"wad","type":"uint256"},{"indexed":false,"internalType":"bytes","name":"fax","type":"bytes"}],"name":"LogNote","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"authority","type":"address"}],"name":"LogSetAuthority","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"}],"name":"LogSetOwner","type":"event"},{"constant":true,"inputs":[],"name":"GOV","outputs":[{"internalType":"contract DSToken","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"IOU","outputs":[{"internalType":"contract DSToken","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"MAX_YAYS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"approvals","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"authority","outputs":[{"internalType":"contract DSAuthority","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"caller","type":"address"},{"internalType":"address","name":"code","type":"address"},{"internalType":"bytes4","name":"sig","type":"bytes4"}],"name":"canCall","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"deposits","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address[]","name":"yays","type":"address[]"}],"name":"etch","outputs":[{"internalType":"bytes32","name":"slate","type":"bytes32"}],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"uint256","name":"wad","type":"uint256"}],"name":"free","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"code","type":"address"},{"internalType":"bytes4","name":"sig","type":"bytes4"}],"name":"getCapabilityRoles","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"who","type":"address"}],"name":"getUserRoles","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"who","type":"address"},{"internalType":"uint8","name":"role","type":"uint8"}],"name":"hasUserRole","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"hat","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"code","type":"address"},{"internalType":"bytes4","name":"sig","type":"bytes4"}],"name":"isCapabilityPublic","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"who","type":"address"}],"name":"isUserRoot","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"whom","type":"address"}],"name":"lift","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"uint256","name":"wad","type":"uint256"}],"name":"lock","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"contract DSAuthority","name":"authority_","type":"address"}],"name":"setAuthority","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"owner_","type":"address"}],"name":"setOwner","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"code","type":"address"},{"internalType":"bytes4","name":"sig","type":"bytes4"},{"internalType":"bool","name":"enabled","type":"bool"}],"name":"setPublicCapability","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"uint8","name":"role","type":"uint8"},{"internalType":"address","name":"code","type":"address"},{"internalType":"bytes4","name":"sig","type":"bytes4"},{"internalType":"bool","name":"enabled","type":"bool"}],"name":"setRoleCapability","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"who","type":"address"},{"internalType":"bool","name":"enabled","type":"bool"}],"name":"setRootUser","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"who","type":"address"},{"internalType":"uint8","name":"role","type":"uint8"},{"internalType":"bool","name":"enabled","type":"bool"}],"name":"setUserRole","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"},{"internalType":"uint256","name":"","type":"uint256"}],"name":"slates","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"slate","type":"bytes32"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address[]","name":"yays","type":"address[]"}],"name":"vote","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"votes","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"payable":false,"stateMutability":"view","type":"function"}]')},function(t){t.exports=JSON.parse('[{"inputs":[{"internalType":"contract DSChief","name":"chief_","type":"address"}],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"cold","type":"address"},{"indexed":true,"internalType":"address","name":"hot","type":"address"},{"indexed":true,"internalType":"address","name":"voteProxy","type":"address"}],"name":"LinkConfirmed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"cold","type":"address"},{"indexed":true,"internalType":"address","name":"hot","type":"address"}],"name":"LinkRequested","type":"event"},{"constant":false,"inputs":[{"internalType":"address","name":"cold","type":"address"}],"name":"approveLink","outputs":[{"internalType":"contract VoteProxy","name":"voteProxy","type":"address"}],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[],"name":"breakLink","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"chief","outputs":[{"internalType":"contract DSChief","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"coldMap","outputs":[{"internalType":"contract VoteProxy","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"guy","type":"address"}],"name":"hasProxy","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"hotMap","outputs":[{"internalType":"contract VoteProxy","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"hot","type":"address"}],"name":"initiateLink","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"linkRequests","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"linkSelf","outputs":[{"internalType":"contract VoteProxy","name":"voteProxy","type":"address"}],"payable":false,"stateMutability":"nonpayable","type":"function"}]')},function(t){t.exports=JSON.parse('[{"constant":false,"inputs":[{"name":"pollId","type":"uint256"}],"name":"withdrawPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollIds","type":"uint256[]"}],"name":"withdrawPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollIds","type":"uint256[]"},{"name":"optionIds","type":"uint256[]"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollId","type":"uint256"},{"name":"optionId","type":"uint256"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"npoll","outputs":[{"name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"name":"startDate","type":"uint256"},{"name":"endDate","type":"uint256"},{"name":"multiHash","type":"string"},{"name":"url","type":"string"}],"name":"createPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"anonymous":false,"inputs":[{"indexed":true,"name":"creator","type":"address"},{"indexed":false,"name":"blockCreated","type":"uint256"},{"indexed":true,"name":"pollId","type":"uint256"},{"indexed":false,"name":"startDate","type":"uint256"},{"indexed":false,"name":"endDate","type":"uint256"},{"indexed":false,"name":"multiHash","type":"string"},{"indexed":false,"name":"url","type":"string"}],"name":"PollCreated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"name":"creator","type":"address"},{"indexed":false,"name":"blockWithdrawn","type":"uint256"},{"indexed":false,"name":"pollId","type":"uint256"}],"name":"PollWithdrawn","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"name":"voter","type":"address"},{"indexed":true,"name":"pollId","type":"uint256"},{"indexed":true,"name":"optionId","type":"uint256"}],"name":"Voted","type":"event"}]')},function(t){t.exports=JSON.parse('[{"constant":false,"inputs":[{"name":"pollId","type":"uint256"}],"name":"withdrawPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollIds","type":"uint256[]"}],"name":"withdrawPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollIds","type":"uint256[]"},{"name":"optionIds","type":"uint256[]"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollId","type":"uint256"},{"name":"optionId","type":"uint256"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"npoll","outputs":[{"name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"name":"startDate","type":"uint256"},{"name":"endDate","type":"uint256"},{"name":"multiHash","type":"string"},{"name":"url","type":"string"}],"name":"createPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"anonymous":false,"inputs":[{"indexed":true,"name":"creator","type":"address"},{"indexed":false,"name":"blockCreated","type":"uint256"},{"indexed":true,"name":"pollId","type":"uint256"},{"indexed":false,"name":"startDate","type":"uint256"},{"indexed":false,"name":"endDate","type":"uint256"},{"indexed":false,"name":"multiHash","type":"string"},{"indexed":false,"name":"url","type":"string"}],"name":"PollCreated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"name":"creator","type":"address"},{"indexed":false,"name":"blockWithdrawn","type":"uint256"},{"indexed":false,"name":"pollId","type":"uint256"}],"name":"PollWithdrawn","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"name":"voter","type":"address"},{"indexed":true,"name":"pollId","type":"uint256"},{"indexed":true,"name":"optionId","type":"uint256"}],"name":"Voted","type":"event"}]')},function(t){t.exports=JSON.parse('[{"inputs":[{"internalType":"uint256","name":"delay_","type":"uint256"},{"internalType":"address","name":"owner_","type":"address"},{"internalType":"contract DSAuthority","name":"authority_","type":"address"}],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"anonymous":true,"inputs":[{"indexed":true,"internalType":"bytes4","name":"sig","type":"bytes4"},{"indexed":true,"internalType":"address","name":"guy","type":"address"},{"indexed":true,"internalType":"bytes32","name":"foo","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"bar","type":"bytes32"},{"indexed":false,"internalType":"uint256","name":"wad","type":"uint256"},{"indexed":false,"internalType":"bytes","name":"fax","type":"bytes"}],"name":"LogNote","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"authority","type":"address"}],"name":"LogSetAuthority","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"}],"name":"LogSetOwner","type":"event"},{"constant":true,"inputs":[],"name":"authority","outputs":[{"internalType":"contract DSAuthority","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"delay","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"usr","type":"address"},{"internalType":"bytes32","name":"tag","type":"bytes32"},{"internalType":"bytes","name":"fax","type":"bytes"},{"internalType":"uint256","name":"eta","type":"uint256"}],"name":"drop","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"usr","type":"address"},{"internalType":"bytes32","name":"tag","type":"bytes32"},{"internalType":"bytes","name":"fax","type":"bytes"},{"internalType":"uint256","name":"eta","type":"uint256"}],"name":"exec","outputs":[{"internalType":"bytes","name":"out","type":"bytes"}],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"plans","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"usr","type":"address"},{"internalType":"bytes32","name":"tag","type":"bytes32"},{"internalType":"bytes","name":"fax","type":"bytes"},{"internalType":"uint256","name":"eta","type":"uint256"}],"name":"plot","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"proxy","outputs":[{"internalType":"contract DSPauseProxy","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"contract DSAuthority","name":"authority_","type":"address"}],"name":"setAuthority","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"uint256","name":"delay_","type":"uint256"}],"name":"setDelay","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"owner_","type":"address"}],"name":"setOwner","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"}]')}])}));
+!function webpackUniversalModuleDefinition(t,r){"object"==typeof exports&&"object"==typeof module?module.exports=r():"function"==typeof define&&define.amd?define([],r):"object"==typeof exports?exports["@makerdao/dai-plugin-governance"]=r():t["@makerdao/dai-plugin-governance"]=r()}(window,(function(){return function(t){var r={};function __webpack_require__(i){if(r[i])return r[i].exports;var a=r[i]={i:i,l:!1,exports:{}};return t[i].call(a.exports,a,a.exports,__webpack_require__),a.l=!0,a.exports}return __webpack_require__.m=t,__webpack_require__.c=r,__webpack_require__.d=function(t,r,i){__webpack_require__.o(t,r)||Object.defineProperty(t,r,{enumerable:!0,get:i})},__webpack_require__.r=function(t){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})},__webpack_require__.t=function(t,r){if(1&r&&(t=__webpack_require__(t)),8&r)return t;if(4&r&&"object"==typeof t&&t&&t.__esModule)return t;var i=Object.create(null);if(__webpack_require__.r(i),Object.defineProperty(i,"default",{enumerable:!0,value:t}),2&r&&"string"!=typeof t)for(var a in t)__webpack_require__.d(i,a,function(r){return t[r]}.bind(null,a));return i},__webpack_require__.n=function(t){var r=t&&t.__esModule?function getDefault(){return t.default}:function getModuleExports(){return t};return __webpack_require__.d(r,"a",r),r},__webpack_require__.o=function(t,r){return Object.prototype.hasOwnProperty.call(t,r)},__webpack_require__.p="",__webpack_require__(__webpack_require__.s=109)}([function(t,r){t.exports=function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}},function(t,r){t.exports=function _classCallCheck(t,r){if(!(t instanceof r))throw new TypeError("Cannot call a class as a function")}},function(t,r){function _defineProperties(t,r){for(var i=0;i<r.length;i++){var a=r[i];a.enumerable=a.enumerable||!1,a.configurable=!0,"value"in a&&(a.writable=!0),Object.defineProperty(t,a.key,a)}}t.exports=function _createClass(t,r,i){return r&&_defineProperties(t.prototype,r),i&&_defineProperties(t,i),t}},function(t,r){function _getPrototypeOf(r){return t.exports=_getPrototypeOf=Object.setPrototypeOf?Object.getPrototypeOf:function _getPrototypeOf(t){return t.__proto__||Object.getPrototypeOf(t)},_getPrototypeOf(r)}t.exports=_getPrototypeOf},function(t,r){var i=t.exports={version:"2.6.11"};"number"==typeof __e&&(__e=i)},function(t,r,i){var a=i(55);t.exports=function _inherits(t,r){if("function"!=typeof r&&null!==r)throw new TypeError("Super expression must either be null or a function");t.prototype=Object.create(r&&r.prototype,{constructor:{value:t,writable:!0,configurable:!0}}),r&&a(t,r)}},function(t,r,i){var a=i(15),u=i(87);t.exports=function _possibleConstructorReturn(t,r){return!r||"object"!==a(r)&&"function"!=typeof r?u(t):r}},function(t,r,i){var a=i(47)("wks"),u=i(33),c=i(12).Symbol,l="function"==typeof c;(t.exports=function(t){return a[t]||(a[t]=l&&c[t]||(l?c:u)("Symbol."+t))}).store=a},function(t,r,i){t.exports=i(168)},function(t,r){function asyncGeneratorStep(t,r,i,a,u,c,l){try{var p=t[c](l),d=p.value}catch(t){return void i(t)}p.done?r(d):Promise.resolve(d).then(a,u)}t.exports=function _asyncToGenerator(t){return function(){var r=this,i=arguments;return new Promise((function(a,u){var c=t.apply(r,i);function _next(t){asyncGeneratorStep(c,a,u,_next,_throw,"next",t)}function _throw(t){asyncGeneratorStep(c,a,u,_next,_throw,"throw",t)}_next(void 0)}))}}},function(t,r,i){Object.defineProperty(r,"__esModule",{value:!0}),r.MAINNET_URL=r.STAGING_MAINNET_URL=r.KOVAN_URL=r.LOCAL_URL=r.ZERO_ADDRESS=r.PAUSE=r.END=r.ESM=r.CHIEF=r.BATCH_POLLING=r.POLLING=r.VOTE_PROXY_FACTORY=r.IOU=r.MKR=void 0;var a=i(66),u=(0,a.createCurrency)("MKR");r.MKR=u;var c=(0,a.createCurrency)("IOU");r.IOU=c;r.VOTE_PROXY_FACTORY="VOTE_PROXY_FACTORY";r.POLLING="POLLING";r.BATCH_POLLING="BATCH_POLLING";r.CHIEF="CHIEF";r.ESM="ESM";r.END="END";r.PAUSE="PAUSE";r.ZERO_ADDRESS="0x0000000000000000000000000000000000000000";r.LOCAL_URL="http://localhost:3001/v1";r.KOVAN_URL="https://staging-gov-db.makerfoundation.com/api/v1";r.STAGING_MAINNET_URL="https://qa-gov-db.makerfoundation.com/api/v1";r.MAINNET_URL="https://gov-db.makerfoundation.com/api/v1"},function(t,r,i){var a=i(12),u=i(4),c=i(41),l=i(19),p=i(17),$export=function(t,r,i){var d,y,h,g=t&$export.F,v=t&$export.G,m=t&$export.S,b=t&$export.P,_=t&$export.B,w=t&$export.W,x=v?u:u[r]||(u[r]={}),S=x.prototype,O=v?a:m?a[r]:(a[r]||{}).prototype;for(d in v&&(i=r),i)(y=!g&&O&&void 0!==O[d])&&p(x,d)||(h=y?O[d]:i[d],x[d]=v&&"function"!=typeof O[d]?i[d]:_&&y?c(h,a):w&&O[d]==h?function(t){var F=function(r,i,a){if(this instanceof t){switch(arguments.length){case 0:return new t;case 1:return new t(r);case 2:return new t(r,i)}return new t(r,i,a)}return t.apply(this,arguments)};return F.prototype=t.prototype,F}(h):b&&"function"==typeof h?c(Function.call,h):h,b&&((x.virtual||(x.virtual={}))[d]=h,t&$export.R&&S&&!S[d]&&l(S,d,h)))};$export.F=1,$export.G=2,$export.S=4,$export.P=8,$export.B=16,$export.W=32,$export.U=64,$export.R=128,t.exports=$export},function(t,r){var i=t.exports="undefined"!=typeof window&&window.Math==Math?window:"undefined"!=typeof self&&self.Math==Math?self:Function("return this")();"number"==typeof __g&&(__g=i)},function(t,r,i){var a=i(16),u=i(68),c=i(42),l=Object.defineProperty;r.f=i(14)?Object.defineProperty:function defineProperty(t,r,i){if(a(t),r=c(r,!0),a(i),u)try{return l(t,r,i)}catch(t){}if("get"in i||"set"in i)throw TypeError("Accessors not supported!");return"value"in i&&(t[r]=i.value),t}},function(t,r,i){t.exports=!i(21)((function(){return 7!=Object.defineProperty({},"a",{get:function(){return 7}}).a}))},function(t,r){function _typeof(r){return"function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?t.exports=_typeof=function _typeof(t){return typeof t}:t.exports=_typeof=function _typeof(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},_typeof(r)}t.exports=_typeof},function(t,r,i){var a=i(20);t.exports=function(t){if(!a(t))throw TypeError(t+" is not an object!");return t}},function(t,r){var i={}.hasOwnProperty;t.exports=function(t,r){return i.call(t,r)}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),Object.defineProperty(r,"standardizeConfig",{enumerable:!0,get:function get(){return u.default}}),Object.defineProperty(r,"ServiceProvider",{enumerable:!0,get:function get(){return c.default}}),Object.defineProperty(r,"Container",{enumerable:!0,get:function get(){return l.default}}),Object.defineProperty(r,"LocalService",{enumerable:!0,get:function get(){return p.default}}),Object.defineProperty(r,"PublicService",{enumerable:!0,get:function get(){return d.default}}),Object.defineProperty(r,"PrivateService",{enumerable:!0,get:function get(){return y.default}}),Object.defineProperty(r,"ServiceManager",{enumerable:!0,get:function get(){return h.default}}),Object.defineProperty(r,"StateMachine",{enumerable:!0,get:function get(){return g.default}});var u=a(i(88)),c=a(i(178)),l=a(i(95)),p=a(i(240)),d=a(i(241)),y=a(i(242)),h=a(i(56)),g=a(i(89))},function(t,r,i){var a=i(13),u=i(26);t.exports=i(14)?function(t,r,i){return a.f(t,r,u(1,i))}:function(t,r,i){return t[r]=i,t}},function(t,r){t.exports=function(t){return"object"==typeof t?null!==t:"function"==typeof t}},function(t,r){t.exports=function(t){try{return!!t()}catch(t){return!0}}},function(t,r,i){var a=i(71),u=i(44);t.exports=function(t){return a(u(t))}},function(t,r,i){var a=i(165),u=i(166),c=i(85),l=i(167);t.exports=function _slicedToArray(t,r){return a(t)||u(t,r)||c(t,r)||l()}},function(t,r,i){(function(t){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.fromBuffer=r.toBuffer=r.paddedArray=r.getCurrency=r.netIdtoSpockUrlStaging=r.netIdtoSpockUrl=r.netIdToName=void 0;var u=a(i(64)),c=i(66),l=a(i(101)),p=i(10);r.netIdToName=function netIdToName(t){switch(parseInt(t,10)){case 1:return"mainnet";case 42:return"kovan";case 999:return"ganache";default:return""}};r.netIdtoSpockUrl=function netIdtoSpockUrl(t){switch(parseInt(t,10)){case 1:return p.MAINNET_URL;case 42:return p.KOVAN_URL;default:return p.STAGING_MAINNET_URL}};r.netIdtoSpockUrlStaging=function netIdtoSpockUrlStaging(t){switch(parseInt(t,10)){case 1:return p.STAGING_MAINNET_URL;case 42:return p.KOVAN_URL;default:return p.STAGING_MAINNET_URL}};var d=(0,c.createGetCurrency)({MKR:p.MKR});r.getCurrency=d;r.paddedArray=function paddedArray(t,r){var i;return(i=Array.from({length:t}).map((function(){return 0}))).concat.apply(i,(0,u.default)(r))};r.toBuffer=function toBuffer(r,i){var a,u,c,p,d=new l.default(r).toString(16);if(i||(i={}),c={1:"big","-1":"little"}[i.endian]||i.endian||"big","-"===d.charAt(0))throw new Error("Converting negative numbers to Buffers not supported yet");for(p="auto"===i.size?Math.ceil(d.length/2):i.size||1,u=Math.ceil(d.length/(2*p))*p,a=t.alloc(u);d.length<2*u;)d="0".concat(d);return d.split(new RegExp("(.{".concat(2*p,"})"))).filter((function(t){return t.length>0})).forEach((function(t,r){for(var i=0;i<p;i++){a[r*p+("big"===c?i:p-i-1)]=parseInt(t.slice(2*i,2*i+2),16)}})),a};r.fromBuffer=function fromBuffer(t,r){r||(r={});var i={1:"big","-1":"little"}[r.endian]||r.endian||"big",a="auto"===r.size?Math.ceil(t.length):r.size||1;if(t.length%a!=0)throw new RangeError("Buffer length (".concat(t.length,") must be a multiple of size (").concat(a,")"));for(var u=[],c=0;c<t.length;c+=a){for(var p=[],d=0;d<a;d++)p.push(t[c+("big"===i?d:a-d-1)]);u.push(p.map((function(t){return(t<16?"0":"")+t.toString(16)})).join(""))}return new l.default(u.join(""),16)}}).call(this,i(243).Buffer)},function(t,r){t.exports=function _defineProperty(t,r,i){return r in t?Object.defineProperty(t,r,{value:i,enumerable:!0,configurable:!0,writable:!0}):t[r]=i,t}},function(t,r){t.exports=function(t,r){return{enumerable:!(1&t),configurable:!(2&t),writable:!(4&t),value:r}}},function(t,r,i){var a=i(44);t.exports=function(t){return Object(a(t))}},function(t,r){t.exports={}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.serviceTypeTransitions=r.default=void 0;var u=a(i(59));r.default={LOCAL:"LOCAL",PUBLIC:"PUBLIC",PRIVATE:"PRIVATE"};var c={LOCAL:{CREATED:[u.default.INITIALIZING],INITIALIZING:[u.default.CREATED,u.default.READY],READY:[u.default.ERROR],ERROR:[]},PUBLIC:{CREATED:[u.default.INITIALIZING],INITIALIZING:[u.default.CREATED,u.default.OFFLINE],OFFLINE:[u.default.CONNECTING],CONNECTING:[u.default.OFFLINE,u.default.READY],READY:[u.default.OFFLINE,u.default.ERROR],ERROR:[]},PRIVATE:{CREATED:[u.default.INITIALIZING],INITIALIZING:[u.default.CREATED,u.default.OFFLINE],OFFLINE:[u.default.CONNECTING],CONNECTING:[u.default.OFFLINE,u.default.ONLINE],ONLINE:[u.default.OFFLINE,u.default.AUTHENTICATING],AUTHENTICATING:[u.default.ONLINE,u.default.READY],READY:[u.default.OFFLINE,u.default.ONLINE,u.default.ERROR],ERROR:[]}};r.serviceTypeTransitions=c},function(t,r,i){var a=i(93),u="object"==typeof self&&self&&self.Object===Object&&self,c=a||u||Function("return this")();t.exports=c},function(t,r,i){var a=i(70),u=i(48);t.exports=Object.keys||function keys(t){return a(t,u)}},function(t,r){t.exports=!0},function(t,r){var i=0,a=Math.random();t.exports=function(t){return"Symbol(".concat(void 0===t?"":t,")_",(++i+a).toString(36))}},function(t,r){r.f={}.propertyIsEnumerable},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(2)),l=a(i(56)),p=a(i(29)),d=a(i(59));function _defineLifeCycleMethods(t){void 0===this.initialize&&(this.initialize=function(){}),t!==p.default.LOCAL&&(void 0===this.connect&&(this.connect=function(){}),this.disconnect=function(){}),t===p.default.PRIVATE&&(void 0===this.authenticate&&(this.authenticate=function(){}),this.deauthenticate=function(){})}function _buildServiceManager(t,r,i){var a=this,u=t===p.default.LOCAL?null:function(t){return a.disconnect=t,a.connect()},c=t!==p.default.PRIVATE?null:function(t){return a.deauthenticate=t,a.authenticate()};return new l.default(r,i,(function(t){return a.initialize(t)}),u,c)}function _installLifeCycleHooks(t){var r=this;t.onInitialized((function(){t.type()!==p.default.LOCAL&&t.dependencies().forEach((function(t){r.get(t).manager().onDisconnected((function(){return r.disconnect()}))})),t.type()===p.default.PRIVATE&&t.dependencies().forEach((function(t){r.get(t).manager().onDeauthenticated((function(){return r.deauthenticate()}))}))}))}function _guardLifeCycleMethods(){var t={initialize:this.initialize,connect:this.connect,authenticate:this.authenticate};this.initialize=function(r){if(this.manager().state()!==d.default.INITIALIZING)throw new Error("Expected state INITIALIZING, but got "+this.manager().state()+". Did you mean to call service.manager().initialize() instead of service.initialize()?");return t.initialize.apply(this,[r])},void 0!==t.connect&&(this.connect=function(){if(this.manager().state()!==d.default.CONNECTING)throw new Error("Expected state CONNECTING, but got "+this.manager().state()+". Did you mean to call service.manager().connect() instead of service.connect()?");return t.connect.apply(this)}),void 0!==t.authenticate&&(this.authenticate=function(){if(this.manager().state()!==d.default.AUTHENTICATING)throw new Error("Expected state AUTHENTICATING, but got "+this.manager().state()+". Did you mean to call service.manager().authenticate() instead of service.authenticate()?");return t.authenticate.apply(this)})}var y=function(){function ServiceBase(t,r){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:[];if((0,u.default)(this,ServiceBase),r||(r=this.constructor.role),this.constructor.dependencies&&(i=this.constructor.dependencies),void 0===p.default[t])throw new Error("Invalid ServiceType: "+t);_defineLifeCycleMethods.call(this,t),this._serviceManager=_buildServiceManager.call(this,t,r,i),_installLifeCycleHooks.call(this,this._serviceManager),_guardLifeCycleMethods.call(this)}return(0,c.default)(ServiceBase,[{key:"manager",value:function manager(){return this._serviceManager}},{key:"get",value:function get(t){return this._serviceManager.dependency(t)}}]),ServiceBase}();r.default=y},function(t,r,i){var a=i(60)(Object,"create");t.exports=a},function(t,r,i){var a=i(61),u=i(186),c=i(187),l=a?a.toStringTag:void 0;t.exports=function baseGetTag(t){return null==t?void 0===t?"[object Undefined]":"[object Null]":l&&l in Object(t)?u(t):c(t)}},function(t,r,i){var a=i(199);t.exports=function assocIndexOf(t,r){for(var i=t.length;i--;)if(a(t[i][0],r))return i;return-1}},function(t,r,i){var a=i(205);t.exports=function getMapData(t,r){var i=t.__data__;return a(r)?i["string"==typeof r?"string":"hash"]:i.map}},function(t,r){t.exports=function isObjectLike(t){return null!=t&&"object"==typeof t}},function(t,r,i){var a=i(113);t.exports=function(t,r,i){if(a(t),void 0===r)return t;switch(i){case 1:return function(i){return t.call(r,i)};case 2:return function(i,a){return t.call(r,i,a)};case 3:return function(i,a,u){return t.call(r,i,a,u)}}return function(){return t.apply(r,arguments)}}},function(t,r,i){var a=i(20);t.exports=function(t,r){if(!a(t))return t;var i,u;if(r&&"function"==typeof(i=t.toString)&&!a(u=i.call(t)))return u;if("function"==typeof(i=t.valueOf)&&!a(u=i.call(t)))return u;if(!r&&"function"==typeof(i=t.toString)&&!a(u=i.call(t)))return u;throw TypeError("Can't convert object to primitive value")}},function(t,r){var i={}.toString;t.exports=function(t){return i.call(t).slice(8,-1)}},function(t,r){t.exports=function(t){if(null==t)throw TypeError("Can't call method on  "+t);return t}},function(t,r){var i=Math.ceil,a=Math.floor;t.exports=function(t){return isNaN(t=+t)?0:(t>0?a:i)(t)}},function(t,r,i){var a=i(47)("keys"),u=i(33);t.exports=function(t){return a[t]||(a[t]=u(t))}},function(t,r,i){var a=i(4),u=i(12),c=u["__core-js_shared__"]||(u["__core-js_shared__"]={});(t.exports=function(t,r){return c[t]||(c[t]=void 0!==r?r:{})})("versions",[]).push({version:a.version,mode:i(32)?"pure":"global",copyright:"© 2019 Denis Pushkarev (zloirock.ru)"})},function(t,r){t.exports="constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf".split(",")},function(t,r){r.f=Object.getOwnPropertySymbols},function(t,r,i){var a=i(122)(!0);i(78)(String,"String",(function(t){this._t=String(t),this._i=0}),(function(){var t,r=this._t,i=this._i;return i>=r.length?{value:void 0,done:!0}:(t=a(r,i),this._i+=t.length,{value:t,done:!1})}))},function(t,r,i){var a=i(16),u=i(124),c=i(48),l=i(46)("IE_PROTO"),Empty=function(){},createDict=function(){var t,r=i(69)("iframe"),a=c.length;for(r.style.display="none",i(125).appendChild(r),r.src="javascript:",(t=r.contentWindow.document).open(),t.write("<script>document.F=Object<\/script>"),t.close(),createDict=t.F;a--;)delete createDict.prototype[c[a]];return createDict()};t.exports=Object.create||function create(t,r){var i;return null!==t?(Empty.prototype=a(t),i=new Empty,Empty.prototype=null,i[l]=t):i=createDict(),void 0===r?i:u(i,r)}},function(t,r,i){var a=i(13).f,u=i(17),c=i(7)("toStringTag");t.exports=function(t,r,i){t&&!u(t=i?t:t.prototype,c)&&a(t,c,{configurable:!0,value:r})}},function(t,r,i){r.f=i(7)},function(t,r,i){var a=i(12),u=i(4),c=i(32),l=i(53),p=i(13).f;t.exports=function(t){var r=u.Symbol||(u.Symbol=c?{}:a.Symbol||{});"_"==t.charAt(0)||t in r||p(r,t,{value:l.f(t)})}},function(t,r){function _setPrototypeOf(r,i){return t.exports=_setPrototypeOf=Object.setPrototypeOf||function _setPrototypeOf(t,r){return t.__proto__=r,t},_setPrototypeOf(r,i)}t.exports=_setPrototypeOf},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.DependencyNotResolvedError=r.UnknownDependencyError=r.InvalidServiceError=r.default=void 0;var u=a(i(15)),c=a(i(169)),l=a(i(2)),p=a(i(1)),d=a(i(5)),y=a(i(6)),h=a(i(3)),g=a(i(57)),v=a(i(174));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,h.default)(t);if(r){var u=(0,h.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,y.default)(this,i)}}var m=function(t){(0,d.default)(InvalidServiceError,t);var r=_createSuper(InvalidServiceError);function InvalidServiceError(t){return(0,p.default)(this,InvalidServiceError),r.call(this,t)}return InvalidServiceError}((0,g.default)(Error));r.InvalidServiceError=m;var b=function(t){(0,d.default)(UnknownDependencyError,t);var r=_createSuper(UnknownDependencyError);function UnknownDependencyError(t,i){return(0,p.default)(this,UnknownDependencyError),r.call(this,"Injected service "+i+" is not a dependency of "+t)}return UnknownDependencyError}((0,g.default)(Error));r.UnknownDependencyError=b;var _=function(t){(0,d.default)(DependencyNotResolvedError,t);var r=_createSuper(DependencyNotResolvedError);function DependencyNotResolvedError(t,i){return(0,p.default)(this,DependencyNotResolvedError),r.call(this,"Dependency "+i+" of service "+t+" is unavailable.")}return DependencyNotResolvedError}((0,g.default)(Error));function _waitForDependencies(t){return Promise.all(this.dependencies().map((function(r){return t(r)})))}r.DependencyNotResolvedError=_;var w=function(t){(0,d.default)(ServiceManager,t);var r=_createSuper(ServiceManager);function ServiceManager(t){var i,a=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[],u=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null,c=arguments.length>3&&void 0!==arguments[3]?arguments[3]:null,l=arguments.length>4&&void 0!==arguments[4]?arguments[4]:null;if((0,p.default)(this,ServiceManager),i=r.call(this,u,c,l),!t)throw new Error("Service name must not be empty.");return i._name=t,i._dependencies=a,i._injections={},a.forEach((function(t){return i._injections[t]=null})),i}return(0,l.default)(ServiceManager,null,[{key:"isValidService",value:function isValidService(t){return null!==t&&"object"===(0,u.default)(t)&&"function"==typeof t.manager}}]),(0,l.default)(ServiceManager,[{key:"name",value:function name(){return this._name}},{key:"dependencies",value:function dependencies(){return this._dependencies}},{key:"inject",value:function inject(t,r){if(void 0===this._injections[t])throw new b(this.name(),t);if(!ServiceManager.isValidService(r))throw new m("Cannot inject invalid service in "+this.name());return this._injections[t]=r,this}},{key:"dependency",value:function dependency(t){if(!this._injections[t])throw new _(this.name(),t);return this._injections[t]}},{key:"initialize",value:function initialize(){var t=this;return this.initializeDependencies().then((function(){return(0,c.default)((0,h.default)(ServiceManager.prototype),"initialize",t).call(t,t._settings)}))}},{key:"connect",value:function connect(){var t=this;return this.connectDependencies().then((function(){return(0,c.default)((0,h.default)(ServiceManager.prototype),"connect",t).call(t)}))}},{key:"authenticate",value:function authenticate(){var t=this;return this.authenticateDependencies().then((function(){return(0,c.default)((0,h.default)(ServiceManager.prototype),"authenticate",t).call(t)}))}},{key:"initializeDependencies",value:function initializeDependencies(){var t=this;return _waitForDependencies.call(this,(function(r){return t.dependency(r).manager().initialize()}))}},{key:"connectDependencies",value:function connectDependencies(){var t=this;return _waitForDependencies.call(this,(function(r){return t.dependency(r).manager().connect()}))}},{key:"authenticateDependencies",value:function authenticateDependencies(){var t=this;return _waitForDependencies.call(this,(function(r){return t.dependency(r).manager().authenticate()}))}},{key:"createService",value:function createService(){var t=this;return{manager:function manager(){return t}}}}]),ServiceManager}(v.default);r.default=w},function(t,r,i){var a=i(3),u=i(55),c=i(171),l=i(172);function _wrapNativeSuper(r){var i="function"==typeof Map?new Map:void 0;return t.exports=_wrapNativeSuper=function _wrapNativeSuper(t){if(null===t||!c(t))return t;if("function"!=typeof t)throw new TypeError("Super expression must either be null or a function");if(void 0!==i){if(i.has(t))return i.get(t);i.set(t,Wrapper)}function Wrapper(){return l(t,arguments,a(this).constructor)}return Wrapper.prototype=Object.create(t.prototype,{constructor:{value:Wrapper,enumerable:!1,writable:!0,configurable:!0}}),u(Wrapper,t)},_wrapNativeSuper(r)}t.exports=_wrapNativeSuper},function(t,r,i){var a=i(15);function _getRequireWildcardCache(){if("function"!=typeof WeakMap)return null;var t=new WeakMap;return _getRequireWildcardCache=function _getRequireWildcardCache(){return t},t}t.exports=function _interopRequireWildcard(t){if(t&&t.__esModule)return t;if(null===t||"object"!==a(t)&&"function"!=typeof t)return{default:t};var r=_getRequireWildcardCache();if(r&&r.has(t))return r.get(t);var i={},u=Object.defineProperty&&Object.getOwnPropertyDescriptor;for(var c in t)if(Object.prototype.hasOwnProperty.call(t,c)){var l=u?Object.getOwnPropertyDescriptor(t,c):null;l&&(l.get||l.set)?Object.defineProperty(i,c,l):i[c]=t[c]}return i.default=t,r&&r.set(t,i),i}},function(t,r,i){Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var a={CREATED:"CREATED",INITIALIZING:"INITIALIZING",OFFLINE:"OFFLINE",CONNECTING:"CONNECTING",ONLINE:"ONLINE",AUTHENTICATING:"AUTHENTICATING",READY:"READY",ERROR:"ERROR"};r.default=a},function(t,r,i){var a=i(185),u=i(191);t.exports=function getNative(t,r){var i=u(t,r);return a(i)?i:void 0}},function(t,r,i){var a=i(30).Symbol;t.exports=a},function(t,r){var i;i=function(){return this}();try{i=i||new Function("return this")()}catch(t){"object"==typeof window&&(i=window)}t.exports=i},function(t,r){t.exports=function isObject(t){var r=typeof t;return null!=t&&("object"==r||"function"==r)}},function(t,r,i){var a=i(247),u=i(248),c=i(85),l=i(249);t.exports=function _toConsumableArray(t){return a(t)||u(t)||c(t)||l()}},function(t,r){var i=RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");t.exports=function hasUnicode(t){return i.test(t)}},function(t,r,i){Object.defineProperty(r,"__esModule",{value:!0}),r.createGetCurrency=r.Currency=void 0;var a=_interopRequireDefault(i(67)),u=_interopRequireDefault(i(73)),c=_interopRequireDefault(i(75)),l=_interopRequireDefault(i(76)),p=_interopRequireDefault(i(83));r.createCurrency=function createCurrency(t){var r=function creatorFn(t,r){return new i(t,r)},i=function(i){function CurrencyX(i,a){(0,c.default)(this,CurrencyX);var p=(0,l.default)(this,(CurrencyX.__proto__||(0,u.default)(CurrencyX)).call(this,i,a));return p.symbol=t,p.type=r,p}return(0,p.default)(CurrencyX,i),CurrencyX}(y);return Object.defineProperty(i,"name",{value:t}),Object.defineProperty(i,"symbol",{value:t}),(0,a.default)(r,{wei:makeShiftedCreatorFn(r,t,"wei"),ray:makeShiftedCreatorFn(r,t,"ray"),rad:makeShiftedCreatorFn(r,t,"rad"),symbol:t,isInstance:function isInstance(t){return t instanceof i}}),(0,a.default)(i,{wei:r.wei,ray:r.ray}),r},r.createCurrencyRatio=function createCurrencyRatio(t,r){var i=t(0).constructor,u=r(0).constructor,c=function creatorFn(t,r){return new d.CurrencyRatio(t,i,u,r)},l=i.symbol+"/"+u.symbol;return(0,a.default)(c,{wei:makeShiftedCreatorFn(c,l,"wei"),ray:makeShiftedCreatorFn(c,l,"ray"),rad:makeShiftedCreatorFn(c,l,"rad"),symbol:l,isInstance:function isInstance(t){return t instanceof d.CurrencyRatio&&t.symbol===l}}),c};var d=i(146);function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}var y=r.Currency=d.Currency;function makeShiftedCreatorFn(t,r,i){var a=function fn(r){return t(r,i)};return a.symbol=r,a.shift=i,a}r.createGetCurrency=function createGetCurrency(t){return function(r,i){if(r instanceof y)return r;if(!i)throw new Error("Amount is not a Currency");var a="string"==typeof i?i.toUpperCase():i.symbol,u=t[a];if(!u)throw new Error("Couldn't find currency for \""+a+'"');return u(r,i.shift)}}},function(t,r,i){t.exports={default:i(111),__esModule:!0}},function(t,r,i){t.exports=!i(14)&&!i(21)((function(){return 7!=Object.defineProperty(i(69)("div"),"a",{get:function(){return 7}}).a}))},function(t,r,i){var a=i(20),u=i(12).document,c=a(u)&&a(u.createElement);t.exports=function(t){return c?u.createElement(t):{}}},function(t,r,i){var a=i(17),u=i(22),c=i(115)(!1),l=i(46)("IE_PROTO");t.exports=function(t,r){var i,p=u(t),d=0,y=[];for(i in p)i!=l&&a(p,i)&&y.push(i);for(;r.length>d;)a(p,i=r[d++])&&(~c(y,i)||y.push(i));return y}},function(t,r,i){var a=i(43);t.exports=Object("z").propertyIsEnumerable(0)?Object:function(t){return"String"==a(t)?t.split(""):Object(t)}},function(t,r,i){var a=i(45),u=Math.min;t.exports=function(t){return t>0?u(a(t),9007199254740991):0}},function(t,r,i){t.exports={default:i(117),__esModule:!0}},function(t,r,i){var a=i(17),u=i(27),c=i(46)("IE_PROTO"),l=Object.prototype;t.exports=Object.getPrototypeOf||function(t){return t=u(t),a(t,c)?t[c]:"function"==typeof t.constructor&&t instanceof t.constructor?t.constructor.prototype:t instanceof Object?l:null}},function(t,r,i){r.__esModule=!0,r.default=function(t,r){if(!(t instanceof r))throw new TypeError("Cannot call a class as a function")}},function(t,r,i){r.__esModule=!0;var a=function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}(i(77));r.default=function(t,r){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!r||"object"!==(void 0===r?"undefined":(0,a.default)(r))&&"function"!=typeof r?t:r}},function(t,r,i){r.__esModule=!0;var a=_interopRequireDefault(i(120)),u=_interopRequireDefault(i(129)),c="function"==typeof u.default&&"symbol"==typeof a.default?function(t){return typeof t}:function(t){return t&&"function"==typeof u.default&&t.constructor===u.default&&t!==u.default.prototype?"symbol":typeof t};function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}r.default="function"==typeof u.default&&"symbol"===c(a.default)?function(t){return void 0===t?"undefined":c(t)}:function(t){return t&&"function"==typeof u.default&&t.constructor===u.default&&t!==u.default.prototype?"symbol":void 0===t?"undefined":c(t)}},function(t,r,i){var a=i(32),u=i(11),c=i(79),l=i(19),p=i(28),d=i(123),y=i(52),h=i(74),g=i(7)("iterator"),v=!([].keys&&"next"in[].keys()),returnThis=function(){return this};t.exports=function(t,r,i,m,b,_,w){d(i,r,m);var x,S,O,getMethod=function(t){if(!v&&t in N)return N[t];switch(t){case"keys":return function keys(){return new i(this,t)};case"values":return function values(){return new i(this,t)}}return function entries(){return new i(this,t)}},E=r+" Iterator",k="values"==b,A=!1,N=t.prototype,T=N[g]||N["@@iterator"]||b&&N[b],P=T||getMethod(b),C=b?k?getMethod("entries"):P:void 0,B="Array"==r&&N.entries||T;if(B&&(O=h(B.call(new t)))!==Object.prototype&&O.next&&(y(O,E,!0),a||"function"==typeof O[g]||l(O,g,returnThis)),k&&T&&"values"!==T.name&&(A=!0,P=function values(){return T.call(this)}),a&&!w||!v&&!A&&N[g]||l(N,g,P),p[r]=P,p[E]=returnThis,b)if(x={values:k?P:getMethod("values"),keys:_?P:getMethod("keys"),entries:C},w)for(S in x)S in N||c(N,S,x[S]);else u(u.P+u.F*(v||A),r,x);return x}},function(t,r,i){t.exports=i(19)},function(t,r,i){i(126);for(var a=i(12),u=i(19),c=i(28),l=i(7)("toStringTag"),p="CSSRuleList,CSSStyleDeclaration,CSSValueList,ClientRectList,DOMRectList,DOMStringList,DOMTokenList,DataTransferItemList,FileList,HTMLAllCollection,HTMLCollection,HTMLFormElement,HTMLSelectElement,MediaList,MimeTypeArray,NamedNodeMap,NodeList,PaintRequestList,Plugin,PluginArray,SVGLengthList,SVGNumberList,SVGPathSegList,SVGPointList,SVGStringList,SVGTransformList,SourceBufferList,StyleSheetList,TextTrackCueList,TextTrackList,TouchList".split(","),d=0;d<p.length;d++){var y=p[d],h=a[y],g=h&&h.prototype;g&&!g[l]&&u(g,l,y),c[y]=c.Array}},function(t,r,i){var a=i(70),u=i(48).concat("length","prototype");r.f=Object.getOwnPropertyNames||function getOwnPropertyNames(t){return a(t,u)}},function(t,r,i){var a=i(34),u=i(26),c=i(22),l=i(42),p=i(17),d=i(68),y=Object.getOwnPropertyDescriptor;r.f=i(14)?y:function getOwnPropertyDescriptor(t,r){if(t=c(t),r=l(r,!0),d)try{return y(t,r)}catch(t){}if(p(t,r))return u(!a.f.call(t,r),t[r])}},function(t,r,i){r.__esModule=!0;var a=_interopRequireDefault(i(139)),u=_interopRequireDefault(i(143)),c=_interopRequireDefault(i(77));function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}r.default=function(t,r){if("function"!=typeof r&&null!==r)throw new TypeError("Super expression must either be null or a function, not "+(void 0===r?"undefined":(0,c.default)(r)));t.prototype=(0,u.default)(r&&r.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),r&&(a.default?(0,a.default)(t,r):t.__proto__=r)}},function(t,r,i){var a=i(150),u=i(7)("iterator"),c=i(28);t.exports=i(4).getIteratorMethod=function(t){if(null!=t)return t[u]||t["@@iterator"]||c[a(t)]}},function(t,r,i){var a=i(86);t.exports=function _unsupportedIterableToArray(t,r){if(t){if("string"==typeof t)return a(t,r);var i=Object.prototype.toString.call(t).slice(8,-1);return"Object"===i&&t.constructor&&(i=t.constructor.name),"Map"===i||"Set"===i?Array.from(t):"Arguments"===i||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(i)?a(t,r):void 0}}},function(t,r){t.exports=function _arrayLikeToArray(t,r){(null==r||r>t.length)&&(r=t.length);for(var i=0,a=new Array(r);i<r;i++)a[i]=t[i];return a}},function(t,r){t.exports=function _assertThisInitialized(t){if(void 0===t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return t}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=function standardizeConfig(t,r,i){if(r instanceof Array)return"boolean"==typeof r[0]&&i?[resolveNameForBoolean(t,r[0],i),r[1]]:r;var a,l={};switch((0,u.default)(r)){case"string":case"function":a=r;break;case"object":r instanceof c.default?a=r:(a=!i||resolveNameForBoolean(t,!0,i),l=r);break;case"boolean":a=i?resolveNameForBoolean(t,r,i):r;break;default:throw new Error("could not parse settings for ".concat(t,":"),r)}return[a,l]};var u=a(i(15)),c=a(i(35));function resolveNameForBoolean(t,r,i){var a,u=i.defaults,c=i.disabled;if(r){if(!(a=u[t]))throw new Error('The "'.concat(t,'" service has no default'))}else if(!(a=c[t]))throw new Error('The "'.concat(t,'" service cannot be disabled'));return a}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=r.IllegalStateError=void 0;var u=a(i(15)),c=a(i(2)),l=a(i(1)),p=a(i(5)),d=a(i(6)),y=a(i(3));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,y.default)(t);if(r){var u=(0,y.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,d.default)(this,i)}}var h=function(t){(0,p.default)(IllegalStateError,t);var r=_createSuper(IllegalStateError);function IllegalStateError(){return(0,l.default)(this,IllegalStateError),r.apply(this,arguments)}return IllegalStateError}((0,a(i(57)).default)(Error));r.IllegalStateError=h;var g=function(){function StateMachine(t,r){if((0,l.default)(this,StateMachine),"object"!==(0,u.default)(r))throw new Error("StateMachine transitions parameter must be an object.");if(Object.keys(r).filter((function(t){return r.hasOwnProperty(t)&&!(r[t]instanceof Array)})).length>0)throw new Error("Illegal StateMachine transition found: not an array.");if(Object.keys(r).filter((function(t){return r.hasOwnProperty(t)&&r[t].filter((function(t){return!r[t]})).length>0})).length>0)throw new Error("Illegal StateMachine transition found: target state not in transition map.");if(!(r[t]instanceof Array))throw new Error("Initial state "+t+" is not set in the transitions map.");this._state=t,this._nextStates=r,this._stateChangedHandlers=[]}return(0,c.default)(StateMachine,[{key:"onStateChanged",value:function onStateChanged(t){this._stateChangedHandlers.push(t)}},{key:"state",value:function state(){return this._state}},{key:"inState",value:function inState(t){return t instanceof Array||(t=[t]),t.indexOf(this._state)>=0}},{key:"assertState",value:function assertState(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"";if(!this.inState(t))throw new h("Illegal operation for state "+this._state+(r.length>0?": "+r:""))}},{key:"transitionTo",value:function transitionTo(t){if(void 0===this._nextStates[t])throw new h("Cannot set illegal state: "+t);if(t!==this._state){if(this._nextStates[this._state].indexOf(t)<0)throw new h("Illegal state transition: "+this._state+" to "+t);var r=this._state;this._state=t,this._stateChangedHandlers.forEach((function(i){return i(r,t)}))}return this}}]),StateMachine}();r.default=g},function(t,r){var i,a,u=t.exports={};function defaultSetTimout(){throw new Error("setTimeout has not been defined")}function defaultClearTimeout(){throw new Error("clearTimeout has not been defined")}function runTimeout(t){if(i===setTimeout)return setTimeout(t,0);if((i===defaultSetTimout||!i)&&setTimeout)return i=setTimeout,setTimeout(t,0);try{return i(t,0)}catch(r){try{return i.call(null,t,0)}catch(r){return i.call(this,t,0)}}}!function(){try{i="function"==typeof setTimeout?setTimeout:defaultSetTimout}catch(t){i=defaultSetTimout}try{a="function"==typeof clearTimeout?clearTimeout:defaultClearTimeout}catch(t){a=defaultClearTimeout}}();var c,l=[],p=!1,d=-1;function cleanUpNextTick(){p&&c&&(p=!1,c.length?l=c.concat(l):d=-1,l.length&&drainQueue())}function drainQueue(){if(!p){var t=runTimeout(cleanUpNextTick);p=!0;for(var r=l.length;r;){for(c=l,l=[];++d<r;)c&&c[d].run();d=-1,r=l.length}c=null,p=!1,function runClearTimeout(t){if(a===clearTimeout)return clearTimeout(t);if((a===defaultClearTimeout||!a)&&clearTimeout)return a=clearTimeout,clearTimeout(t);try{return a(t)}catch(r){try{return a.call(null,t)}catch(r){return a.call(this,t)}}}(t)}}function Item(t,r){this.fun=t,this.array=r}function noop(){}u.nextTick=function(t){var r=new Array(arguments.length-1);if(arguments.length>1)for(var i=1;i<arguments.length;i++)r[i-1]=arguments[i];l.push(new Item(t,r)),1!==l.length||p||runTimeout(drainQueue)},Item.prototype.run=function(){this.fun.apply(null,this.array)},u.title="browser",u.browser=!0,u.env={},u.argv=[],u.version="",u.versions={},u.on=noop,u.addListener=noop,u.once=noop,u.off=noop,u.removeListener=noop,u.removeAllListeners=noop,u.emit=noop,u.prependListener=noop,u.prependOnceListener=noop,u.listeners=function(t){return[]},u.binding=function(t){throw new Error("process.binding is not supported")},u.cwd=function(){return"/"},u.chdir=function(t){throw new Error("process.chdir is not supported")},u.umask=function(){return 0}},function(t,r,i){var a=i(179);t.exports=function uniq(t){return t&&t.length?a(t):[]}},function(t,r,i){var a=i(37),u=i(63);t.exports=function isFunction(t){if(!u(t))return!1;var r=a(t);return"[object Function]"==r||"[object GeneratorFunction]"==r||"[object AsyncFunction]"==r||"[object Proxy]"==r}},function(t,r,i){(function(r){var i="object"==typeof r&&r&&r.Object===Object&&r;t.exports=i}).call(this,i(62))},function(t,r){t.exports=function setToArray(t){var r=-1,i=Array(t.size);return t.forEach((function(t){i[++r]=t})),i}},function(t,r,i){var a=i(58),u=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.orderServices=orderServices,Object.defineProperty(r,"InvalidServiceError",{enumerable:!0,get:function get(){return _.InvalidServiceError}}),r.ServiceNotFoundError=r.ServiceAlreadyRegisteredError=r.ExtractedServiceError=r.default=void 0;var c=u(i(8)),l=u(i(9)),p=u(i(2)),d=u(i(1)),y=u(i(5)),h=u(i(6)),g=u(i(3)),v=u(i(57)),m=u(i(221)),b=u(i(91)),_=a(i(56)),w=u(i(239));function _createForOfIteratorHelper(t){if("undefined"==typeof Symbol||null==t[Symbol.iterator]){if(Array.isArray(t)||(t=function _unsupportedIterableToArray(t,r){if(!t)return;if("string"==typeof t)return _arrayLikeToArray(t,r);var i=Object.prototype.toString.call(t).slice(8,-1);"Object"===i&&t.constructor&&(i=t.constructor.name);if("Map"===i||"Set"===i)return Array.from(t);if("Arguments"===i||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(i))return _arrayLikeToArray(t,r)}(t))){var r=0,i=function F(){};return{s:i,n:function n(){return r>=t.length?{done:!0}:{done:!1,value:t[r++]}},e:function e(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,u,c=!0,l=!1;return{s:function s(){a=t[Symbol.iterator]()},n:function n(){var t=a.next();return c=t.done,t},e:function e(t){l=!0,u=t},f:function f(){try{c||null==a.return||a.return()}finally{if(l)throw u}}}}function _arrayLikeToArray(t,r){(null==r||r>t.length)&&(r=t.length);for(var i=0,a=new Array(r);i<r;i++)a[i]=t[i];return a}function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,g.default)(t);if(r){var u=(0,g.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,h.default)(this,i)}}var x=function(t){(0,y.default)(ServiceAlreadyRegisteredError,t);var r=_createSuper(ServiceAlreadyRegisteredError);function ServiceAlreadyRegisteredError(t){return(0,d.default)(this,ServiceAlreadyRegisteredError),r.call(this,"Service with name '"+t+"' is already registered with this container.")}return ServiceAlreadyRegisteredError}((0,v.default)(Error));r.ServiceAlreadyRegisteredError=x;var S=function(t){(0,y.default)(ServiceNotFoundError,t);var r=_createSuper(ServiceNotFoundError);function ServiceNotFoundError(t){return(0,d.default)(this,ServiceNotFoundError),r.call(this,"Service with name '"+t+"' cannot be found in this container.")}return ServiceNotFoundError}((0,v.default)(Error));r.ServiceNotFoundError=S;var O=function(t){(0,y.default)(ExtractedServiceError,t);var r=_createSuper(ExtractedServiceError);function ExtractedServiceError(t){return(0,d.default)(this,ExtractedServiceError),r.call(this,"Service with name '"+t+"' has been extracted from the core dai.js library into a discrete plugin. Please refer to the documentation here to install and add it to your configuration: \n\n https://github.com/makerdao/dai.js/wiki/Basic-Usage-(Plugins) \n\n")}return ExtractedServiceError}((0,v.default)(Error));function orderServices(t){var r,i=[],a=[],u=_createForOfIteratorHelper(t);try{var c=function _loop(){var t=r.value,u=t.manager().name(),c=t.manager().dependencies();0===c.length?a.push(u):c.forEach((function(t){return i.push([t,u])}))};for(u.s();!(r=u.n()).done;)c()}catch(t){u.e(t)}finally{u.f()}return(0,b.default)((0,w.default)(i).concat(a))}r.ExtractedServiceError=O;var E=function(){function Container(){(0,d.default)(this,Container),this._services={},this.isAuthenticated=!1}var t;return(0,p.default)(Container,[{key:"register",value:function register(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null;if(!_.default.isValidService(t))throw new _.InvalidServiceError("Service must be an object with manager() method returning a valid ServiceManager");r=r||t.manager().name();var i=this.service(r,!1);if(void 0!==i&&i!==t)throw new x(r);return this._services[r]=t,this}},{key:"service",value:function service(t){var r=!(arguments.length>1&&void 0!==arguments[1])||arguments[1],i=["exchange"];if(!t)throw new Error("Provide a service name.");if(!this._services[t]&&r&&i.includes(t))throw new O(t);if(!this._services[t]&&r)throw new S(t);return this._services[t]}},{key:"getRegisteredServiceNames",value:function getRegisteredServiceNames(){return Object.keys(this._services)}},{key:"injectDependencies",value:function injectDependencies(){var t,r=_createForOfIteratorHelper((0,m.default)(this._services));try{for(r.s();!(t=r.n()).done;){var i,a=t.value.manager(),u=_createForOfIteratorHelper(a.dependencies());try{for(u.s();!(i=u.n()).done;){var c=i.value;if(!this._services[c])throw new S(c);a.inject(c,this._services[c])}}catch(t){u.e(t)}finally{u.f()}}}catch(t){r.e(t)}finally{r.f()}}},{key:"initialize",value:function initialize(){return this._waitForServices((function(t){return t.manager().initialize()}))}},{key:"connect",value:function connect(){return this._waitForServices((function(t){return t.manager().connect()}))}},{key:"authenticate",value:function authenticate(){var t=this;return this._waitForServices((function(t){return t.manager().authenticate()})).then((function(){t.isAuthenticated=!0}))}},{key:"_waitForServices",value:(t=(0,l.default)(c.default.mark((function _callee(t){var r,i,a;return c.default.wrap((function _callee$(u){for(;;)switch(u.prev=u.next){case 0:this._orderedServiceNames||(this._orderedServiceNames=orderServices((0,m.default)(this._services))),r=_createForOfIteratorHelper(this._orderedServiceNames),u.prev=2,r.s();case 4:if((i=r.n()).done){u.next=13;break}if(a=i.value,this._services[a]){u.next=9;break}throw new Error("No service for ".concat(a));case 9:return u.next=11,t(this._services[a]);case 11:u.next=4;break;case 13:u.next=18;break;case 15:u.prev=15,u.t0=u.catch(2),r.e(u.t0);case 18:return u.prev=18,r.f(),u.finish(18);case 21:case"end":return u.stop()}}),_callee,this,[[2,15,18,21]])}))),function _waitForServices(r){return t.apply(this,arguments)})}]),Container}();r.default=E},function(t,r){t.exports=function arrayMap(t,r){for(var i=-1,a=null==t?0:t.length,u=Array(a);++i<a;)u[i]=r(t[i],i,t);return u}},function(t,r){t.exports=function baseTimes(t,r){for(var i=-1,a=Array(t);++i<t;)a[i]=r(i);return a}},function(t,r){var i=Array.isArray;t.exports=i},function(t,r){t.exports=function(t){return t.webpackPolyfill||(t.deprecate=function(){},t.paths=[],t.children||(t.children=[]),Object.defineProperty(t,"loaded",{enumerable:!0,get:function(){return t.l}}),Object.defineProperty(t,"id",{enumerable:!0,get:function(){return t.i}}),t.webpackPolyfill=1),t}},function(t,r){t.exports=function isLength(t){return"number"==typeof t&&t>-1&&t%1==0&&t<=9007199254740991}},function(t,r,i){var a;!function(u){var c,l=/^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i,p=Math.ceil,d=Math.floor,y="[BigNumber Error] ",h=y+"Number primitive has more than 15 significant digits: ",g=1e14,v=[1,10,100,1e3,1e4,1e5,1e6,1e7,1e8,1e9,1e10,1e11,1e12,1e13],m=1e9;function bitFloor(t){var r=0|t;return t>0||t===r?r:r-1}function coeffToString(t){for(var r,i,a=1,u=t.length,c=t[0]+"";a<u;){for(i=14-(r=t[a++]+"").length;i--;r="0"+r);c+=r}for(u=c.length;48===c.charCodeAt(--u););return c.slice(0,u+1||1)}function compare(t,r){var i,a,u=t.c,c=r.c,l=t.s,p=r.s,d=t.e,y=r.e;if(!l||!p)return null;if(i=u&&!u[0],a=c&&!c[0],i||a)return i?a?0:-p:l;if(l!=p)return l;if(i=l<0,a=d==y,!u||!c)return a?0:!u^i?1:-1;if(!a)return d>y^i?1:-1;for(p=(d=u.length)<(y=c.length)?d:y,l=0;l<p;l++)if(u[l]!=c[l])return u[l]>c[l]^i?1:-1;return d==y?0:d>y^i?1:-1}function intCheck(t,r,i,a){if(t<r||t>i||t!==(t<0?p(t):d(t)))throw Error(y+(a||"Argument")+("number"==typeof t?t<r||t>i?" out of range: ":" not an integer: ":" not a primitive number: ")+t)}function isArray(t){return"[object Array]"==Object.prototype.toString.call(t)}function isOdd(t){var r=t.c.length-1;return bitFloor(t.e/14)==r&&t.c[r]%2!=0}function toExponential(t,r){return(t.length>1?t.charAt(0)+"."+t.slice(1):t)+(r<0?"e":"e+")+r}function toFixedPoint(t,r,i){var a,u;if(r<0){for(u=i+".";++r;u+=i);t=u+t}else if(++r>(a=t.length)){for(u=i,r-=a;--r;u+=i);t+=u}else r<a&&(t=t.slice(0,r)+"."+t.slice(r));return t}(c=function clone(t){var r,i,a,u,c,b,_,w,x,S=BigNumber.prototype={constructor:BigNumber,toString:null,valueOf:null},O=new BigNumber(1),E=20,k=4,A=-7,N=21,T=-1e7,P=1e7,C=!1,B=1,I=0,R={decimalSeparator:".",groupSeparator:",",groupSize:3,secondaryGroupSize:0,fractionGroupSeparator:" ",fractionGroupSize:0},j="0123456789abcdefghijklmnopqrstuvwxyz";function BigNumber(t,r){var u,c,p,y,g,v,m,b,_=this;if(!(_ instanceof BigNumber))return new BigNumber(t,r);if(null==r){if(t instanceof BigNumber)return _.s=t.s,_.e=t.e,void(_.c=(t=t.c)?t.slice():t);if((v="number"==typeof t)&&0*t==0){if(_.s=1/t<0?(t=-t,-1):1,t===~~t){for(y=0,g=t;g>=10;g/=10,y++);return _.e=y,void(_.c=[t])}b=t+""}else{if(!l.test(b=t+""))return a(_,b,v);_.s=45==b.charCodeAt(0)?(b=b.slice(1),-1):1}(y=b.indexOf("."))>-1&&(b=b.replace(".","")),(g=b.search(/e/i))>0?(y<0&&(y=g),y+=+b.slice(g+1),b=b.substring(0,g)):y<0&&(y=b.length)}else{if(intCheck(r,2,j.length,"Base"),b=t+"",10==r)return round(_=new BigNumber(t instanceof BigNumber?t:b),E+_.e+1,k);if(v="number"==typeof t){if(0*t!=0)return a(_,b,v,r);if(_.s=1/t<0?(b=b.slice(1),-1):1,BigNumber.DEBUG&&b.replace(/^0\.0*|\./,"").length>15)throw Error(h+t);v=!1}else _.s=45===b.charCodeAt(0)?(b=b.slice(1),-1):1;for(u=j.slice(0,r),y=g=0,m=b.length;g<m;g++)if(u.indexOf(c=b.charAt(g))<0){if("."==c){if(g>y){y=m;continue}}else if(!p&&(b==b.toUpperCase()&&(b=b.toLowerCase())||b==b.toLowerCase()&&(b=b.toUpperCase()))){p=!0,g=-1,y=0;continue}return a(_,t+"",v,r)}(y=(b=i(b,r,10,_.s)).indexOf("."))>-1?b=b.replace(".",""):y=b.length}for(g=0;48===b.charCodeAt(g);g++);for(m=b.length;48===b.charCodeAt(--m););if(b=b.slice(g,++m)){if(m-=g,v&&BigNumber.DEBUG&&m>15&&(t>9007199254740991||t!==d(t)))throw Error(h+_.s*t);if((y=y-g-1)>P)_.c=_.e=null;else if(y<T)_.c=[_.e=0];else{if(_.e=y,_.c=[],g=(y+1)%14,y<0&&(g+=14),g<m){for(g&&_.c.push(+b.slice(0,g)),m-=14;g<m;)_.c.push(+b.slice(g,g+=14));g=14-(b=b.slice(g)).length}else g-=m;for(;g--;b+="0");_.c.push(+b)}}else _.c=[_.e=0]}function format(t,r,i,a){var u,c,l,p,d;if(null==i?i=k:intCheck(i,0,8),!t.c)return t.toString();if(u=t.c[0],l=t.e,null==r)d=coeffToString(t.c),d=1==a||2==a&&l<=A?toExponential(d,l):toFixedPoint(d,l,"0");else if(c=(t=round(new BigNumber(t),r,i)).e,p=(d=coeffToString(t.c)).length,1==a||2==a&&(r<=c||c<=A)){for(;p<r;d+="0",p++);d=toExponential(d,c)}else if(r-=l,d=toFixedPoint(d,c,"0"),c+1>p){if(--r>0)for(d+=".";r--;d+="0");}else if((r+=c-p)>0)for(c+1==p&&(d+=".");r--;d+="0");return t.s<0&&u?"-"+d:d}function maxOrMin(t,r){var i,a,u=0;for(isArray(t[0])&&(t=t[0]),i=new BigNumber(t[0]);++u<t.length;){if(!(a=new BigNumber(t[u])).s){i=a;break}r.call(i,a)&&(i=a)}return i}function normalise(t,r,i){for(var a=1,u=r.length;!r[--u];r.pop());for(u=r[0];u>=10;u/=10,a++);return(i=a+14*i-1)>P?t.c=t.e=null:i<T?t.c=[t.e=0]:(t.e=i,t.c=r),t}function round(t,r,i,a){var u,c,l,y,h,m,b,_=t.c,w=v;if(_){e:{for(u=1,y=_[0];y>=10;y/=10,u++);if((c=r-u)<0)c+=14,l=r,b=(h=_[m=0])/w[u-l-1]%10|0;else if((m=p((c+1)/14))>=_.length){if(!a)break e;for(;_.length<=m;_.push(0));h=b=0,u=1,l=(c%=14)-14+1}else{for(h=y=_[m],u=1;y>=10;y/=10,u++);b=(l=(c%=14)-14+u)<0?0:h/w[u-l-1]%10|0}if(a=a||r<0||null!=_[m+1]||(l<0?h:h%w[u-l-1]),a=i<4?(b||a)&&(0==i||i==(t.s<0?3:2)):b>5||5==b&&(4==i||a||6==i&&(c>0?l>0?h/w[u-l]:0:_[m-1])%10&1||i==(t.s<0?8:7)),r<1||!_[0])return _.length=0,a?(r-=t.e+1,_[0]=w[(14-r%14)%14],t.e=-r||0):_[0]=t.e=0,t;if(0==c?(_.length=m,y=1,m--):(_.length=m+1,y=w[14-c],_[m]=l>0?d(h/w[u-l]%w[l])*y:0),a)for(;;){if(0==m){for(c=1,l=_[0];l>=10;l/=10,c++);for(l=_[0]+=y,y=1;l>=10;l/=10,y++);c!=y&&(t.e++,_[0]==g&&(_[0]=1));break}if(_[m]+=y,_[m]!=g)break;_[m--]=0,y=1}for(c=_.length;0===_[--c];_.pop());}t.e>P?t.c=t.e=null:t.e<T&&(t.c=[t.e=0])}return t}return BigNumber.clone=clone,BigNumber.ROUND_UP=0,BigNumber.ROUND_DOWN=1,BigNumber.ROUND_CEIL=2,BigNumber.ROUND_FLOOR=3,BigNumber.ROUND_HALF_UP=4,BigNumber.ROUND_HALF_DOWN=5,BigNumber.ROUND_HALF_EVEN=6,BigNumber.ROUND_HALF_CEIL=7,BigNumber.ROUND_HALF_FLOOR=8,BigNumber.EUCLID=9,BigNumber.config=BigNumber.set=function(t){var r,i;if(null!=t){if("object"!=typeof t)throw Error(y+"Object expected: "+t);if(t.hasOwnProperty(r="DECIMAL_PLACES")&&(intCheck(i=t[r],0,m,r),E=i),t.hasOwnProperty(r="ROUNDING_MODE")&&(intCheck(i=t[r],0,8,r),k=i),t.hasOwnProperty(r="EXPONENTIAL_AT")&&(isArray(i=t[r])?(intCheck(i[0],-m,0,r),intCheck(i[1],0,m,r),A=i[0],N=i[1]):(intCheck(i,-m,m,r),A=-(N=i<0?-i:i))),t.hasOwnProperty(r="RANGE"))if(isArray(i=t[r]))intCheck(i[0],-m,-1,r),intCheck(i[1],1,m,r),T=i[0],P=i[1];else{if(intCheck(i,-m,m,r),!i)throw Error(y+r+" cannot be zero: "+i);T=-(P=i<0?-i:i)}if(t.hasOwnProperty(r="CRYPTO")){if((i=t[r])!==!!i)throw Error(y+r+" not true or false: "+i);if(i){if("undefined"==typeof crypto||!crypto||!crypto.getRandomValues&&!crypto.randomBytes)throw C=!i,Error(y+"crypto unavailable");C=i}else C=i}if(t.hasOwnProperty(r="MODULO_MODE")&&(intCheck(i=t[r],0,9,r),B=i),t.hasOwnProperty(r="POW_PRECISION")&&(intCheck(i=t[r],0,m,r),I=i),t.hasOwnProperty(r="FORMAT")){if("object"!=typeof(i=t[r]))throw Error(y+r+" not an object: "+i);R=i}if(t.hasOwnProperty(r="ALPHABET")){if("string"!=typeof(i=t[r])||/^.$|\.|(.).*\1/.test(i))throw Error(y+r+" invalid: "+i);j=i}}return{DECIMAL_PLACES:E,ROUNDING_MODE:k,EXPONENTIAL_AT:[A,N],RANGE:[T,P],CRYPTO:C,MODULO_MODE:B,POW_PRECISION:I,FORMAT:R,ALPHABET:j}},BigNumber.isBigNumber=function(t){return t instanceof BigNumber||t&&!0===t._isBigNumber||!1},BigNumber.maximum=BigNumber.max=function(){return maxOrMin(arguments,S.lt)},BigNumber.minimum=BigNumber.min=function(){return maxOrMin(arguments,S.gt)},BigNumber.random=(u=9007199254740992*Math.random()&2097151?function(){return d(9007199254740992*Math.random())}:function(){return 8388608*(1073741824*Math.random()|0)+(8388608*Math.random()|0)},function(t){var r,i,a,c,l,h=0,g=[],b=new BigNumber(O);if(null==t?t=E:intCheck(t,0,m),c=p(t/14),C)if(crypto.getRandomValues){for(r=crypto.getRandomValues(new Uint32Array(c*=2));h<c;)(l=131072*r[h]+(r[h+1]>>>11))>=9e15?(i=crypto.getRandomValues(new Uint32Array(2)),r[h]=i[0],r[h+1]=i[1]):(g.push(l%1e14),h+=2);h=c/2}else{if(!crypto.randomBytes)throw C=!1,Error(y+"crypto unavailable");for(r=crypto.randomBytes(c*=7);h<c;)(l=281474976710656*(31&r[h])+1099511627776*r[h+1]+4294967296*r[h+2]+16777216*r[h+3]+(r[h+4]<<16)+(r[h+5]<<8)+r[h+6])>=9e15?crypto.randomBytes(7).copy(r,h):(g.push(l%1e14),h+=7);h=c/7}if(!C)for(;h<c;)(l=u())<9e15&&(g[h++]=l%1e14);for(t%=14,(c=g[--h])&&t&&(l=v[14-t],g[h]=d(c/l)*l);0===g[h];g.pop(),h--);if(h<0)g=[a=0];else{for(a=-1;0===g[0];g.splice(0,1),a-=14);for(h=1,l=g[0];l>=10;l/=10,h++);h<14&&(a-=14-h)}return b.e=a,b.c=g,b}),i=function(){function toBaseOut(t,r,i,a){for(var u,c,l=[0],p=0,d=t.length;p<d;){for(c=l.length;c--;l[c]*=r);for(l[0]+=a.indexOf(t.charAt(p++)),u=0;u<l.length;u++)l[u]>i-1&&(null==l[u+1]&&(l[u+1]=0),l[u+1]+=l[u]/i|0,l[u]%=i)}return l.reverse()}return function(t,i,a,u,c){var l,p,d,y,h,g,v,m,b=t.indexOf("."),_=E,w=k;for(b>=0&&(y=I,I=0,t=t.replace(".",""),g=(m=new BigNumber(i)).pow(t.length-b),I=y,m.c=toBaseOut(toFixedPoint(coeffToString(g.c),g.e,"0"),10,a,"0123456789"),m.e=m.c.length),d=y=(v=toBaseOut(t,i,a,c?(l=j,"0123456789"):(l="0123456789",j))).length;0==v[--y];v.pop());if(!v[0])return l.charAt(0);if(b<0?--d:(g.c=v,g.e=d,g.s=u,v=(g=r(g,m,_,w,a)).c,h=g.r,d=g.e),b=v[p=d+_+1],y=a/2,h=h||p<0||null!=v[p+1],h=w<4?(null!=b||h)&&(0==w||w==(g.s<0?3:2)):b>y||b==y&&(4==w||h||6==w&&1&v[p-1]||w==(g.s<0?8:7)),p<1||!v[0])t=h?toFixedPoint(l.charAt(1),-_,l.charAt(0)):l.charAt(0);else{if(v.length=p,h)for(--a;++v[--p]>a;)v[p]=0,p||(++d,v=[1].concat(v));for(y=v.length;!v[--y];);for(b=0,t="";b<=y;t+=l.charAt(v[b++]));t=toFixedPoint(t,d,l.charAt(0))}return t}}(),r=function(){function multiply(t,r,i){var a,u,c,l,p=0,d=t.length,y=r%1e7,h=r/1e7|0;for(t=t.slice();d--;)p=((u=y*(c=t[d]%1e7)+(a=h*c+(l=t[d]/1e7|0)*y)%1e7*1e7+p)/i|0)+(a/1e7|0)+h*l,t[d]=u%i;return p&&(t=[p].concat(t)),t}function compare(t,r,i,a){var u,c;if(i!=a)c=i>a?1:-1;else for(u=c=0;u<i;u++)if(t[u]!=r[u]){c=t[u]>r[u]?1:-1;break}return c}function subtract(t,r,i,a){for(var u=0;i--;)t[i]-=u,u=t[i]<r[i]?1:0,t[i]=u*a+t[i]-r[i];for(;!t[0]&&t.length>1;t.splice(0,1));}return function(t,r,i,a,u){var c,l,p,y,h,v,m,b,_,w,x,S,O,E,k,A,N,T=t.s==r.s?1:-1,P=t.c,C=r.c;if(!(P&&P[0]&&C&&C[0]))return new BigNumber(t.s&&r.s&&(P?!C||P[0]!=C[0]:C)?P&&0==P[0]||!C?0*T:T/0:NaN);for(_=(b=new BigNumber(T)).c=[],T=i+(l=t.e-r.e)+1,u||(u=g,l=bitFloor(t.e/14)-bitFloor(r.e/14),T=T/14|0),p=0;C[p]==(P[p]||0);p++);if(C[p]>(P[p]||0)&&l--,T<0)_.push(1),y=!0;else{for(E=P.length,A=C.length,p=0,T+=2,(h=d(u/(C[0]+1)))>1&&(C=multiply(C,h,u),P=multiply(P,h,u),A=C.length,E=P.length),O=A,x=(w=P.slice(0,A)).length;x<A;w[x++]=0);N=C.slice(),N=[0].concat(N),k=C[0],C[1]>=u/2&&k++;do{if(h=0,(c=compare(C,w,A,x))<0){if(S=w[0],A!=x&&(S=S*u+(w[1]||0)),(h=d(S/k))>1)for(h>=u&&(h=u-1),m=(v=multiply(C,h,u)).length,x=w.length;1==compare(v,w,m,x);)h--,subtract(v,A<m?N:C,m,u),m=v.length,c=1;else 0==h&&(c=h=1),m=(v=C.slice()).length;if(m<x&&(v=[0].concat(v)),subtract(w,v,x,u),x=w.length,-1==c)for(;compare(C,w,A,x)<1;)h++,subtract(w,A<x?N:C,x,u),x=w.length}else 0===c&&(h++,w=[0]);_[p++]=h,w[0]?w[x++]=P[O]||0:(w=[P[O]],x=1)}while((O++<E||null!=w[0])&&T--);y=null!=w[0],_[0]||_.splice(0,1)}if(u==g){for(p=1,T=_[0];T>=10;T/=10,p++);round(b,i+(b.e=p+14*l-1)+1,a,y)}else b.e=l,b.r=+y;return b}}(),c=/^(-?)0([xbo])(?=\w[\w.]*$)/i,b=/^([^.]+)\.$/,_=/^\.([^.]+)$/,w=/^-?(Infinity|NaN)$/,x=/^\s*\+(?=[\w.])|^\s+|\s+$/g,a=function(t,r,i,a){var u,l=i?r:r.replace(x,"");if(w.test(l))t.s=isNaN(l)?null:l<0?-1:1,t.c=t.e=null;else{if(!i&&(l=l.replace(c,(function(t,r,i){return u="x"==(i=i.toLowerCase())?16:"b"==i?2:8,a&&a!=u?t:r})),a&&(u=a,l=l.replace(b,"$1").replace(_,"0.$1")),r!=l))return new BigNumber(l,u);if(BigNumber.DEBUG)throw Error(y+"Not a"+(a?" base "+a:"")+" number: "+r);t.c=t.e=t.s=null}},S.absoluteValue=S.abs=function(){var t=new BigNumber(this);return t.s<0&&(t.s=1),t},S.comparedTo=function(t,r){return compare(this,new BigNumber(t,r))},S.decimalPlaces=S.dp=function(t,r){var i,a,u,c=this;if(null!=t)return intCheck(t,0,m),null==r?r=k:intCheck(r,0,8),round(new BigNumber(c),t+c.e+1,r);if(!(i=c.c))return null;if(a=14*((u=i.length-1)-bitFloor(this.e/14)),u=i[u])for(;u%10==0;u/=10,a--);return a<0&&(a=0),a},S.dividedBy=S.div=function(t,i){return r(this,new BigNumber(t,i),E,k)},S.dividedToIntegerBy=S.idiv=function(t,i){return r(this,new BigNumber(t,i),0,1)},S.exponentiatedBy=S.pow=function(t,r){var i,a,u,c,l,h,g,v=this;if((t=new BigNumber(t)).c&&!t.isInteger())throw Error(y+"Exponent not an integer: "+t);if(null!=r&&(r=new BigNumber(r)),c=t.e>14,!v.c||!v.c[0]||1==v.c[0]&&!v.e&&1==v.c.length||!t.c||!t.c[0])return g=new BigNumber(Math.pow(+v.valueOf(),c?2-isOdd(t):+t)),r?g.mod(r):g;if(l=t.s<0,r){if(r.c?!r.c[0]:!r.s)return new BigNumber(NaN);(a=!l&&v.isInteger()&&r.isInteger())&&(v=v.mod(r))}else{if(t.e>9&&(v.e>0||v.e<-1||(0==v.e?v.c[0]>1||c&&v.c[1]>=24e7:v.c[0]<8e13||c&&v.c[0]<=9999975e7)))return u=v.s<0&&isOdd(t)?-0:0,v.e>-1&&(u=1/u),new BigNumber(l?1/u:u);I&&(u=p(I/14+2))}for(c?(i=new BigNumber(.5),h=isOdd(t)):h=t%2,l&&(t.s=1),g=new BigNumber(O);;){if(h){if(!(g=g.times(v)).c)break;u?g.c.length>u&&(g.c.length=u):a&&(g=g.mod(r))}if(c){if(round(t=t.times(i),t.e+1,1),!t.c[0])break;c=t.e>14,h=isOdd(t)}else{if(!(t=d(t/2)))break;h=t%2}v=v.times(v),u?v.c&&v.c.length>u&&(v.c.length=u):a&&(v=v.mod(r))}return a?g:(l&&(g=O.div(g)),r?g.mod(r):u?round(g,I,k,void 0):g)},S.integerValue=function(t){var r=new BigNumber(this);return null==t?t=k:intCheck(t,0,8),round(r,r.e+1,t)},S.isEqualTo=S.eq=function(t,r){return 0===compare(this,new BigNumber(t,r))},S.isFinite=function(){return!!this.c},S.isGreaterThan=S.gt=function(t,r){return compare(this,new BigNumber(t,r))>0},S.isGreaterThanOrEqualTo=S.gte=function(t,r){return 1===(r=compare(this,new BigNumber(t,r)))||0===r},S.isInteger=function(){return!!this.c&&bitFloor(this.e/14)>this.c.length-2},S.isLessThan=S.lt=function(t,r){return compare(this,new BigNumber(t,r))<0},S.isLessThanOrEqualTo=S.lte=function(t,r){return-1===(r=compare(this,new BigNumber(t,r)))||0===r},S.isNaN=function(){return!this.s},S.isNegative=function(){return this.s<0},S.isPositive=function(){return this.s>0},S.isZero=function(){return!!this.c&&0==this.c[0]},S.minus=function(t,r){var i,a,u,c,l=this,p=l.s;if(r=(t=new BigNumber(t,r)).s,!p||!r)return new BigNumber(NaN);if(p!=r)return t.s=-r,l.plus(t);var d=l.e/14,y=t.e/14,h=l.c,v=t.c;if(!d||!y){if(!h||!v)return h?(t.s=-r,t):new BigNumber(v?l:NaN);if(!h[0]||!v[0])return v[0]?(t.s=-r,t):new BigNumber(h[0]?l:3==k?-0:0)}if(d=bitFloor(d),y=bitFloor(y),h=h.slice(),p=d-y){for((c=p<0)?(p=-p,u=h):(y=d,u=v),u.reverse(),r=p;r--;u.push(0));u.reverse()}else for(a=(c=(p=h.length)<(r=v.length))?p:r,p=r=0;r<a;r++)if(h[r]!=v[r]){c=h[r]<v[r];break}if(c&&(u=h,h=v,v=u,t.s=-t.s),(r=(a=v.length)-(i=h.length))>0)for(;r--;h[i++]=0);for(r=g-1;a>p;){if(h[--a]<v[a]){for(i=a;i&&!h[--i];h[i]=r);--h[i],h[a]+=g}h[a]-=v[a]}for(;0==h[0];h.splice(0,1),--y);return h[0]?normalise(t,h,y):(t.s=3==k?-1:1,t.c=[t.e=0],t)},S.modulo=S.mod=function(t,i){var a,u,c=this;return t=new BigNumber(t,i),!c.c||!t.s||t.c&&!t.c[0]?new BigNumber(NaN):!t.c||c.c&&!c.c[0]?new BigNumber(c):(9==B?(u=t.s,t.s=1,a=r(c,t,0,3),t.s=u,a.s*=u):a=r(c,t,0,B),(t=c.minus(a.times(t))).c[0]||1!=B||(t.s=c.s),t)},S.multipliedBy=S.times=function(t,r){var i,a,u,c,l,p,d,y,h,v,m,b,_,w,x=this,S=x.c,O=(t=new BigNumber(t,r)).c;if(!(S&&O&&S[0]&&O[0]))return!x.s||!t.s||S&&!S[0]&&!O||O&&!O[0]&&!S?t.c=t.e=t.s=null:(t.s*=x.s,S&&O?(t.c=[0],t.e=0):t.c=t.e=null),t;for(a=bitFloor(x.e/14)+bitFloor(t.e/14),t.s*=x.s,(d=S.length)<(v=O.length)&&(_=S,S=O,O=_,u=d,d=v,v=u),u=d+v,_=[];u--;_.push(0));for(w=g,1e7,u=v;--u>=0;){for(i=0,m=O[u]%1e7,b=O[u]/1e7|0,c=u+(l=d);c>u;)i=((y=m*(y=S[--l]%1e7)+(p=b*y+(h=S[l]/1e7|0)*m)%1e7*1e7+_[c]+i)/w|0)+(p/1e7|0)+b*h,_[c--]=y%w;_[c]=i}return i?++a:_.splice(0,1),normalise(t,_,a)},S.negated=function(){var t=new BigNumber(this);return t.s=-t.s||null,t},S.plus=function(t,r){var i,a=this,u=a.s;if(r=(t=new BigNumber(t,r)).s,!u||!r)return new BigNumber(NaN);if(u!=r)return t.s=-r,a.minus(t);var c=a.e/14,l=t.e/14,p=a.c,d=t.c;if(!c||!l){if(!p||!d)return new BigNumber(u/0);if(!p[0]||!d[0])return d[0]?t:new BigNumber(p[0]?a:0*u)}if(c=bitFloor(c),l=bitFloor(l),p=p.slice(),u=c-l){for(u>0?(l=c,i=d):(u=-u,i=p),i.reverse();u--;i.push(0));i.reverse()}for((u=p.length)-(r=d.length)<0&&(i=d,d=p,p=i,r=u),u=0;r;)u=(p[--r]=p[r]+d[r]+u)/g|0,p[r]=g===p[r]?0:p[r]%g;return u&&(p=[u].concat(p),++l),normalise(t,p,l)},S.precision=S.sd=function(t,r){var i,a,u,c=this;if(null!=t&&t!==!!t)return intCheck(t,1,m),null==r?r=k:intCheck(r,0,8),round(new BigNumber(c),t,r);if(!(i=c.c))return null;if(a=14*(u=i.length-1)+1,u=i[u]){for(;u%10==0;u/=10,a--);for(u=i[0];u>=10;u/=10,a++);}return t&&c.e+1>a&&(a=c.e+1),a},S.shiftedBy=function(t){return intCheck(t,-9007199254740991,9007199254740991),this.times("1e"+t)},S.squareRoot=S.sqrt=function(){var t,i,a,u,c,l=this,p=l.c,d=l.s,y=l.e,h=E+4,g=new BigNumber("0.5");if(1!==d||!p||!p[0])return new BigNumber(!d||d<0&&(!p||p[0])?NaN:p?l:1/0);if(0==(d=Math.sqrt(+l))||d==1/0?(((i=coeffToString(p)).length+y)%2==0&&(i+="0"),d=Math.sqrt(i),y=bitFloor((y+1)/2)-(y<0||y%2),a=new BigNumber(i=d==1/0?"1e"+y:(i=d.toExponential()).slice(0,i.indexOf("e")+1)+y)):a=new BigNumber(d+""),a.c[0])for((d=(y=a.e)+h)<3&&(d=0);;)if(c=a,a=g.times(c.plus(r(l,c,h,1))),coeffToString(c.c).slice(0,d)===(i=coeffToString(a.c)).slice(0,d)){if(a.e<y&&--d,"9999"!=(i=i.slice(d-3,d+1))&&(u||"4999"!=i)){+i&&(+i.slice(1)||"5"!=i.charAt(0))||(round(a,a.e+E+2,1),t=!a.times(a).eq(l));break}if(!u&&(round(c,c.e+E+2,0),c.times(c).eq(l))){a=c;break}h+=4,d+=4,u=1}return round(a,a.e+E+1,k,t)},S.toExponential=function(t,r){return null!=t&&(intCheck(t,0,m),t++),format(this,t,r,1)},S.toFixed=function(t,r){return null!=t&&(intCheck(t,0,m),t=t+this.e+1),format(this,t,r)},S.toFormat=function(t,r){var i=this.toFixed(t,r);if(this.c){var a,u=i.split("."),c=+R.groupSize,l=+R.secondaryGroupSize,p=R.groupSeparator,d=u[0],y=u[1],h=this.s<0,g=h?d.slice(1):d,v=g.length;if(l&&(a=c,c=l,l=a,v-=a),c>0&&v>0){for(a=v%c||c,d=g.substr(0,a);a<v;a+=c)d+=p+g.substr(a,c);l>0&&(d+=p+g.slice(a)),h&&(d="-"+d)}i=y?d+R.decimalSeparator+((l=+R.fractionGroupSize)?y.replace(new RegExp("\\d{"+l+"}\\B","g"),"$&"+R.fractionGroupSeparator):y):d}return i},S.toFraction=function(t){var i,a,u,c,l,p,d,h,g,m,b,_,w=this,x=w.c;if(null!=t&&(!(h=new BigNumber(t)).isInteger()&&(h.c||1!==h.s)||h.lt(O)))throw Error(y+"Argument "+(h.isInteger()?"out of range: ":"not an integer: ")+t);if(!x)return w.toString();for(a=new BigNumber(O),m=u=new BigNumber(O),c=g=new BigNumber(O),_=coeffToString(x),p=a.e=_.length-w.e-1,a.c[0]=v[(d=p%14)<0?14+d:d],t=!t||h.comparedTo(a)>0?p>0?a:m:h,d=P,P=1/0,h=new BigNumber(_),g.c[0]=0;b=r(h,a,0,1),1!=(l=u.plus(b.times(c))).comparedTo(t);)u=c,c=l,m=g.plus(b.times(l=m)),g=l,a=h.minus(b.times(l=a)),h=l;return l=r(t.minus(u),c,0,1),g=g.plus(l.times(m)),u=u.plus(l.times(c)),g.s=m.s=w.s,i=r(m,c,p*=2,k).minus(w).abs().comparedTo(r(g,u,p,k).minus(w).abs())<1?[m.toString(),c.toString()]:[g.toString(),u.toString()],P=d,i},S.toNumber=function(){return+this},S.toPrecision=function(t,r){return null!=t&&intCheck(t,1,m),format(this,t,r,2)},S.toString=function(t){var r,a=this,u=a.s,c=a.e;return null===c?u?(r="Infinity",u<0&&(r="-"+r)):r="NaN":(r=coeffToString(a.c),null==t?r=c<=A||c>=N?toExponential(r,c):toFixedPoint(r,c,"0"):(intCheck(t,2,j.length,"Base"),r=i(toFixedPoint(r,c,"0"),10,t,u,!0)),u<0&&a.c[0]&&(r="-"+r)),r},S.valueOf=S.toJSON=function(){var t,r=this,i=r.e;return null===i?r.toString():(t=coeffToString(r.c),t=i<=A||i>=N?toExponential(t,i):toFixedPoint(t,i,"0"),r.s<0?"-"+t:t)},S._isBigNumber=!0,null!=t&&BigNumber.set(t),BigNumber}()).default=c.BigNumber=c,void 0===(a=function(){return c}.call(r,i,r,t))||(t.exports=a)}()},function(t){t.exports=JSON.parse('{"chief":{"inception_block":{"mainnet":"0x487813","kovan":"0x649575"},"events":{"etch":"0x4f0892983790f53eea39a7a496f6cb40e8811b313871337b6a761efc6c67bb1f","vote_slate":"0xa69beaba00000000000000000000000000000000000000000000000000000000","vote_addresses":"0xed08132900000000000000000000000000000000000000000000000000000000","lock":"0xdd46706400000000000000000000000000000000000000000000000000000000","free":"0xd8ccd0f300000000000000000000000000000000000000000000000000000000"}},"pause":{"inception_block":{"mainnet":"8928171","kovan":"14764552"},"events":{"exec":"0x168ccd6700000000000000000000000000000000000000000000000000000000","plot":"0x46d2fbbb00000000000000000000000000000000000000000000000000000000"}},"proxy_factory":{"initiate_link_gas":45840,"approve_link_gas":886503,"send_mkr_gas":46471,"total_link_gas":1123568}}')},function(t,r,i){(function(r){var a=i(257);function compare(t,r){if(t===r)return 0;for(var i=t.length,a=r.length,u=0,c=Math.min(i,a);u<c;++u)if(t[u]!==r[u]){i=t[u],a=r[u];break}return i<a?-1:a<i?1:0}function isBuffer(t){return r.Buffer&&"function"==typeof r.Buffer.isBuffer?r.Buffer.isBuffer(t):!(null==t||!t._isBuffer)}var u=i(258),c=Object.prototype.hasOwnProperty,l=Array.prototype.slice,p="foo"===function foo(){}.name;function pToString(t){return Object.prototype.toString.call(t)}function isView(t){return!isBuffer(t)&&("function"==typeof r.ArrayBuffer&&("function"==typeof ArrayBuffer.isView?ArrayBuffer.isView(t):!!t&&(t instanceof DataView||!!(t.buffer&&t.buffer instanceof ArrayBuffer))))}var d=t.exports=ok,y=/\s*function\s+([^\(\s]*)\s*/;function getName(t){if(u.isFunction(t)){if(p)return t.name;var r=t.toString().match(y);return r&&r[1]}}function truncate(t,r){return"string"==typeof t?t.length<r?t:t.slice(0,r):t}function inspect(t){if(p||!u.isFunction(t))return u.inspect(t);var r=getName(t);return"[Function"+(r?": "+r:"")+"]"}function fail(t,r,i,a,u){throw new d.AssertionError({message:i,actual:t,expected:r,operator:a,stackStartFunction:u})}function ok(t,r){t||fail(t,!0,r,"==",d.ok)}function _deepEqual(t,r,i,a){if(t===r)return!0;if(isBuffer(t)&&isBuffer(r))return 0===compare(t,r);if(u.isDate(t)&&u.isDate(r))return t.getTime()===r.getTime();if(u.isRegExp(t)&&u.isRegExp(r))return t.source===r.source&&t.global===r.global&&t.multiline===r.multiline&&t.lastIndex===r.lastIndex&&t.ignoreCase===r.ignoreCase;if(null!==t&&"object"==typeof t||null!==r&&"object"==typeof r){if(isView(t)&&isView(r)&&pToString(t)===pToString(r)&&!(t instanceof Float32Array||t instanceof Float64Array))return 0===compare(new Uint8Array(t.buffer),new Uint8Array(r.buffer));if(isBuffer(t)!==isBuffer(r))return!1;var c=(a=a||{actual:[],expected:[]}).actual.indexOf(t);return-1!==c&&c===a.expected.indexOf(r)||(a.actual.push(t),a.expected.push(r),function objEquiv(t,r,i,a){if(null==t||null==r)return!1;if(u.isPrimitive(t)||u.isPrimitive(r))return t===r;if(i&&Object.getPrototypeOf(t)!==Object.getPrototypeOf(r))return!1;var c=isArguments(t),p=isArguments(r);if(c&&!p||!c&&p)return!1;if(c)return t=l.call(t),r=l.call(r),_deepEqual(t,r,i);var d,y,g=h(t),v=h(r);if(g.length!==v.length)return!1;for(g.sort(),v.sort(),y=g.length-1;y>=0;y--)if(g[y]!==v[y])return!1;for(y=g.length-1;y>=0;y--)if(d=g[y],!_deepEqual(t[d],r[d],i,a))return!1;return!0}(t,r,i,a))}return i?t===r:t==r}function isArguments(t){return"[object Arguments]"==Object.prototype.toString.call(t)}function expectedException(t,r){if(!t||!r)return!1;if("[object RegExp]"==Object.prototype.toString.call(r))return r.test(t);try{if(t instanceof r)return!0}catch(t){}return!Error.isPrototypeOf(r)&&!0===r.call({},t)}function _throws(t,r,i,a){var c;if("function"!=typeof r)throw new TypeError('"block" argument must be a function');"string"==typeof i&&(a=i,i=null),c=function _tryBlock(t){var r;try{t()}catch(t){r=t}return r}(r),a=(i&&i.name?" ("+i.name+").":".")+(a?" "+a:"."),t&&!c&&fail(c,i,"Missing expected exception"+a);var l="string"==typeof a,p=!t&&c&&!i;if((!t&&u.isError(c)&&l&&expectedException(c,i)||p)&&fail(c,i,"Got unwanted exception"+a),t&&c&&i&&!expectedException(c,i)||!t&&c)throw c}d.AssertionError=function AssertionError(t){this.name="AssertionError",this.actual=t.actual,this.expected=t.expected,this.operator=t.operator,t.message?(this.message=t.message,this.generatedMessage=!1):(this.message=function getMessage(t){return truncate(inspect(t.actual),128)+" "+t.operator+" "+truncate(inspect(t.expected),128)}(this),this.generatedMessage=!0);var r=t.stackStartFunction||fail;if(Error.captureStackTrace)Error.captureStackTrace(this,r);else{var i=new Error;if(i.stack){var a=i.stack,u=getName(r),c=a.indexOf("\n"+u);if(c>=0){var l=a.indexOf("\n",c+1);a=a.substring(l+1)}this.stack=a}}},u.inherits(d.AssertionError,Error),d.fail=fail,d.ok=ok,d.equal=function equal(t,r,i){t!=r&&fail(t,r,i,"==",d.equal)},d.notEqual=function notEqual(t,r,i){t==r&&fail(t,r,i,"!=",d.notEqual)},d.deepEqual=function deepEqual(t,r,i){_deepEqual(t,r,!1)||fail(t,r,i,"deepEqual",d.deepEqual)},d.deepStrictEqual=function deepStrictEqual(t,r,i){_deepEqual(t,r,!0)||fail(t,r,i,"deepStrictEqual",d.deepStrictEqual)},d.notDeepEqual=function notDeepEqual(t,r,i){_deepEqual(t,r,!1)&&fail(t,r,i,"notDeepEqual",d.notDeepEqual)},d.notDeepStrictEqual=function notDeepStrictEqual(t,r,i){_deepEqual(t,r,!0)&&fail(t,r,i,"notDeepStrictEqual",notDeepStrictEqual)},d.strictEqual=function strictEqual(t,r,i){t!==r&&fail(t,r,i,"===",d.strictEqual)},d.notStrictEqual=function notStrictEqual(t,r,i){t===r&&fail(t,r,i,"!==",d.notStrictEqual)},d.throws=function(t,r,i){_throws(!0,t,r,i)},d.doesNotThrow=function(t,r,i){_throws(!1,t,r,i)},d.ifError=function(t){if(t)throw t},d.strict=a((function strict(t,r){t||fail(t,!0,r,"==",strict)}),d,{equal:d.strictEqual,deepEqual:d.deepStrictEqual,notEqual:d.notStrictEqual,notDeepEqual:d.notDeepStrictEqual}),d.strict.strict=d.strict;var h=Object.keys||function(t){var r=[];for(var i in t)c.call(t,i)&&r.push(i);return r}}).call(this,i(62))},function(t,r,i){var a=i(267);t.exports=function toInteger(t){var r=a(t),i=r%1;return r==r?i?r-i:r:0}},function(t,r,i){var a=i(37),u=i(40);t.exports=function isSymbol(t){return"symbol"==typeof t||u(t)&&"[object Symbol]"==a(t)}},function(t,r,i){var a=i(61),u=i(96),c=i(98),l=i(105),p=a?a.prototype:void 0,d=p?p.toString:void 0;t.exports=function baseToString(t){if("string"==typeof t)return t;if(c(t))return u(t,baseToString)+"";if(l(t))return d?d.call(t):"";var r=t+"";return"0"==r&&1/t==-1/0?"-0":r}},function(t,r,i){var a=i(276),u=i(65),c=i(278);t.exports=function stringSize(t){return u(t)?c(t):a(t)}},function(t,r,i){function _isPlaceholder(t){return null!=t&&"object"==typeof t&&!0===t["@@functional/placeholder"]}function _curry1(t){return function f1(r){return 0===arguments.length||_isPlaceholder(r)?f1:t.apply(this,arguments)}}i.r(r),i.d(r,"F",(function(){return u})),i.d(r,"T",(function(){return c})),i.d(r,"__",(function(){return l})),i.d(r,"add",(function(){return p})),i.d(r,"addIndex",(function(){return y})),i.d(r,"adjust",(function(){return h})),i.d(r,"all",(function(){return b})),i.d(r,"allPass",(function(){return L})),i.d(r,"always",(function(){return a})),i.d(r,"and",(function(){return U})),i.d(r,"any",(function(){return G})),i.d(r,"anyPass",(function(){return V})),i.d(r,"ap",(function(){return z})),i.d(r,"aperture",(function(){return H})),i.d(r,"append",(function(){return Y})),i.d(r,"apply",(function(){return $})),i.d(r,"applySpec",(function(){return Q})),i.d(r,"applyTo",(function(){return J})),i.d(r,"ascend",(function(){return Z})),i.d(r,"assoc",(function(){return ee})),i.d(r,"assocPath",(function(){return ne})),i.d(r,"binary",(function(){return oe})),i.d(r,"bind",(function(){return S})),i.d(r,"both",(function(){return ce})),i.d(r,"call",(function(){return fe})),i.d(r,"chain",(function(){return pe})),i.d(r,"clamp",(function(){return de})),i.d(r,"clone",(function(){return he})),i.d(r,"comparator",(function(){return ge})),i.d(r,"complement",(function(){return me})),i.d(r,"compose",(function(){return compose})),i.d(r,"composeK",(function(){return composeK})),i.d(r,"composeP",(function(){return composeP})),i.d(r,"concat",(function(){return Pe})),i.d(r,"cond",(function(){return Ce})),i.d(r,"construct",(function(){return Ie})),i.d(r,"constructN",(function(){return Be})),i.d(r,"contains",(function(){return Re})),i.d(r,"converge",(function(){return je})),i.d(r,"countBy",(function(){return Le})),i.d(r,"curry",(function(){return se})),i.d(r,"curryN",(function(){return d})),i.d(r,"dec",(function(){return Fe})),i.d(r,"defaultTo",(function(){return Ue})),i.d(r,"descend",(function(){return qe})),i.d(r,"difference",(function(){return We})),i.d(r,"differenceWith",(function(){return Ge})),i.d(r,"dissoc",(function(){return Ve})),i.d(r,"dissocPath",(function(){return He})),i.d(r,"divide",(function(){return Ye})),i.d(r,"drop",(function(){return Ke})),i.d(r,"dropLast",(function(){return et})),i.d(r,"dropLastWhile",(function(){return rt})),i.d(r,"dropRepeats",(function(){return ct})),i.d(r,"dropRepeatsWith",(function(){return ut})),i.d(r,"dropWhile",(function(){return ft})),i.d(r,"either",(function(){return dt})),i.d(r,"empty",(function(){return yt})),i.d(r,"endsWith",(function(){return vt})),i.d(r,"eqBy",(function(){return mt})),i.d(r,"eqProps",(function(){return bt})),i.d(r,"equals",(function(){return Se})),i.d(r,"evolve",(function(){return _t})),i.d(r,"filter",(function(){return Ae})),i.d(r,"find",(function(){return xt})),i.d(r,"findIndex",(function(){return Ot})),i.d(r,"findLast",(function(){return kt})),i.d(r,"findLastIndex",(function(){return Nt})),i.d(r,"flatten",(function(){return Tt})),i.d(r,"flip",(function(){return Pt})),i.d(r,"forEach",(function(){return Ct})),i.d(r,"forEachObjIndexed",(function(){return Bt})),i.d(r,"fromPairs",(function(){return It})),i.d(r,"groupBy",(function(){return Rt})),i.d(r,"groupWith",(function(){return jt})),i.d(r,"gt",(function(){return Mt})),i.d(r,"gte",(function(){return Dt})),i.d(r,"has",(function(){return Lt})),i.d(r,"hasIn",(function(){return Ft})),i.d(r,"head",(function(){return Ut})),i.d(r,"identical",(function(){return xe})),i.d(r,"identity",(function(){return qt})),i.d(r,"ifElse",(function(){return Wt})),i.d(r,"inc",(function(){return Gt})),i.d(r,"indexBy",(function(){return Vt})),i.d(r,"indexOf",(function(){return zt})),i.d(r,"init",(function(){return Xt})),i.d(r,"innerJoin",(function(){return Ht})),i.d(r,"insert",(function(){return Yt})),i.d(r,"insertAll",(function(){return $t})),i.d(r,"intersection",(function(){return Zt})),i.d(r,"intersperse",(function(){return er})),i.d(r,"into",(function(){return ur})),i.d(r,"invert",(function(){return cr})),i.d(r,"invertObj",(function(){return sr})),i.d(r,"invoker",(function(){return fr})),i.d(r,"is",(function(){return lr})),i.d(r,"isEmpty",(function(){return pr})),i.d(r,"isNil",(function(){return re})),i.d(r,"join",(function(){return dr})),i.d(r,"juxt",(function(){return yr})),i.d(r,"keys",(function(){return B})),i.d(r,"keysIn",(function(){return hr})),i.d(r,"last",(function(){return at})),i.d(r,"lastIndexOf",(function(){return gr})),i.d(r,"length",(function(){return vr})),i.d(r,"lens",(function(){return mr})),i.d(r,"lensIndex",(function(){return br})),i.d(r,"lensPath",(function(){return _r})),i.d(r,"lensProp",(function(){return wr})),i.d(r,"lift",(function(){return ue})),i.d(r,"liftN",(function(){return ae})),i.d(r,"lt",(function(){return xr})),i.d(r,"lte",(function(){return Sr})),i.d(r,"map",(function(){return I})),i.d(r,"mapAccum",(function(){return Or})),i.d(r,"mapAccumRight",(function(){return Er})),i.d(r,"mapObjIndexed",(function(){return kr})),i.d(r,"match",(function(){return Ar})),i.d(r,"mathMod",(function(){return Nr})),i.d(r,"max",(function(){return _})),i.d(r,"maxBy",(function(){return Tr})),i.d(r,"mean",(function(){return Cr})),i.d(r,"median",(function(){return Br})),i.d(r,"memoize",(function(){return Rr})),i.d(r,"memoizeWith",(function(){return Ir})),i.d(r,"merge",(function(){return jr})),i.d(r,"mergeAll",(function(){return Mr})),i.d(r,"mergeDeepLeft",(function(){return Fr})),i.d(r,"mergeDeepRight",(function(){return Ur})),i.d(r,"mergeDeepWith",(function(){return qr})),i.d(r,"mergeDeepWithKey",(function(){return Lr})),i.d(r,"mergeWith",(function(){return Wr})),i.d(r,"mergeWithKey",(function(){return Dr})),i.d(r,"min",(function(){return Gr})),i.d(r,"minBy",(function(){return Vr})),i.d(r,"modulo",(function(){return zr})),i.d(r,"multiply",(function(){return Xr})),i.d(r,"nAry",(function(){return ie})),i.d(r,"negate",(function(){return Hr})),i.d(r,"none",(function(){return Yr})),i.d(r,"not",(function(){return ve})),i.d(r,"nth",(function(){return ot})),i.d(r,"nthArg",(function(){return $r})),i.d(r,"o",(function(){return Kr})),i.d(r,"objOf",(function(){return rr})),i.d(r,"of",(function(){return Qr})),i.d(r,"omit",(function(){return Jr})),i.d(r,"once",(function(){return Zr})),i.d(r,"or",(function(){return pt})),i.d(r,"over",(function(){return en})),i.d(r,"pair",(function(){return tn})),i.d(r,"partial",(function(){return rn})),i.d(r,"partialRight",(function(){return nn})),i.d(r,"partition",(function(){return on})),i.d(r,"path",(function(){return R})),i.d(r,"pathEq",(function(){return an})),i.d(r,"pathOr",(function(){return un})),i.d(r,"pathSatisfies",(function(){return cn})),i.d(r,"pick",(function(){return sn})),i.d(r,"pickAll",(function(){return ln})),i.d(r,"pickBy",(function(){return pn})),i.d(r,"pipe",(function(){return pipe})),i.d(r,"pipeK",(function(){return pipeK})),i.d(r,"pipeP",(function(){return pipeP})),i.d(r,"pluck",(function(){return M})),i.d(r,"prepend",(function(){return dn})),i.d(r,"product",(function(){return yn})),i.d(r,"project",(function(){return gn})),i.d(r,"prop",(function(){return j})),i.d(r,"propEq",(function(){return vn})),i.d(r,"propIs",(function(){return mn})),i.d(r,"propOr",(function(){return bn})),i.d(r,"propSatisfies",(function(){return _n})),i.d(r,"props",(function(){return wn})),i.d(r,"range",(function(){return xn})),i.d(r,"reduce",(function(){return D})),i.d(r,"reduceBy",(function(){return De})),i.d(r,"reduceRight",(function(){return Sn})),i.d(r,"reduceWhile",(function(){return On})),i.d(r,"reduced",(function(){return En})),i.d(r,"reject",(function(){return Ne})),i.d(r,"remove",(function(){return ze})),i.d(r,"repeat",(function(){return An})),i.d(r,"replace",(function(){return Nn})),i.d(r,"reverse",(function(){return we})),i.d(r,"scan",(function(){return Tn})),i.d(r,"sequence",(function(){return Pn})),i.d(r,"set",(function(){return Cn})),i.d(r,"slice",(function(){return be})),i.d(r,"sort",(function(){return Bn})),i.d(r,"sortBy",(function(){return In})),i.d(r,"sortWith",(function(){return Rn})),i.d(r,"split",(function(){return jn})),i.d(r,"splitAt",(function(){return Mn})),i.d(r,"splitEvery",(function(){return Dn})),i.d(r,"splitWhen",(function(){return Ln})),i.d(r,"startsWith",(function(){return Fn})),i.d(r,"subtract",(function(){return Un})),i.d(r,"sum",(function(){return Pr})),i.d(r,"symmetricDifference",(function(){return qn})),i.d(r,"symmetricDifferenceWith",(function(){return Wn})),i.d(r,"tail",(function(){return _e})),i.d(r,"take",(function(){return Je})),i.d(r,"takeLast",(function(){return ht})),i.d(r,"takeLastWhile",(function(){return Gn})),i.d(r,"takeWhile",(function(){return zn})),i.d(r,"tap",(function(){return Hn})),i.d(r,"test",(function(){return Yn})),i.d(r,"times",(function(){return kn})),i.d(r,"toLower",(function(){return $n})),i.d(r,"toPairs",(function(){return Kn})),i.d(r,"toPairsIn",(function(){return Qn})),i.d(r,"toString",(function(){return Te})),i.d(r,"toUpper",(function(){return Jn})),i.d(r,"transduce",(function(){return Zn})),i.d(r,"transpose",(function(){return ei})),i.d(r,"traverse",(function(){return ti})),i.d(r,"trim",(function(){return ni})),i.d(r,"tryCatch",(function(){return ii})),i.d(r,"type",(function(){return ye})),i.d(r,"unapply",(function(){return oi})),i.d(r,"unary",(function(){return ai})),i.d(r,"uncurryN",(function(){return ui})),i.d(r,"unfold",(function(){return ci})),i.d(r,"union",(function(){return si})),i.d(r,"unionWith",(function(){return li})),i.d(r,"uniq",(function(){return Jt})),i.d(r,"uniqBy",(function(){return Qt})),i.d(r,"uniqWith",(function(){return fi})),i.d(r,"unless",(function(){return pi})),i.d(r,"unnest",(function(){return di})),i.d(r,"until",(function(){return yi})),i.d(r,"update",(function(){return Xe})),i.d(r,"useWith",(function(){return hn})),i.d(r,"values",(function(){return K})),i.d(r,"valuesIn",(function(){return hi})),i.d(r,"view",(function(){return gi})),i.d(r,"when",(function(){return vi})),i.d(r,"where",(function(){return mi})),i.d(r,"whereEq",(function(){return bi})),i.d(r,"without",(function(){return _i})),i.d(r,"xprod",(function(){return wi})),i.d(r,"zip",(function(){return xi})),i.d(r,"zipObj",(function(){return Si})),i.d(r,"zipWith",(function(){return Oi}));var a=_curry1((function always(t){return function(){return t}})),u=a(!1),c=a(!0),l={"@@functional/placeholder":!0};function _curry2(t){return function f2(r,i){switch(arguments.length){case 0:return f2;case 1:return _isPlaceholder(r)?f2:_curry1((function(i){return t(r,i)}));default:return _isPlaceholder(r)&&_isPlaceholder(i)?f2:_isPlaceholder(r)?_curry1((function(r){return t(r,i)})):_isPlaceholder(i)?_curry1((function(i){return t(r,i)})):t(r,i)}}}var p=_curry2((function add(t,r){return Number(t)+Number(r)}));function _concat(t,r){var i;r=r||[];var a=(t=t||[]).length,u=r.length,c=[];for(i=0;i<a;)c[c.length]=t[i],i+=1;for(i=0;i<u;)c[c.length]=r[i],i+=1;return c}function _arity(t,r){switch(t){case 0:return function(){return r.apply(this,arguments)};case 1:return function(t){return r.apply(this,arguments)};case 2:return function(t,i){return r.apply(this,arguments)};case 3:return function(t,i,a){return r.apply(this,arguments)};case 4:return function(t,i,a,u){return r.apply(this,arguments)};case 5:return function(t,i,a,u,c){return r.apply(this,arguments)};case 6:return function(t,i,a,u,c,l){return r.apply(this,arguments)};case 7:return function(t,i,a,u,c,l,p){return r.apply(this,arguments)};case 8:return function(t,i,a,u,c,l,p,d){return r.apply(this,arguments)};case 9:return function(t,i,a,u,c,l,p,d,y){return r.apply(this,arguments)};case 10:return function(t,i,a,u,c,l,p,d,y,h){return r.apply(this,arguments)};default:throw new Error("First argument to _arity must be a non-negative integer no greater than ten")}}function _curryN(t,r,i){return function(){for(var a=[],u=0,c=t,l=0;l<r.length||u<arguments.length;){var p;l<r.length&&(!_isPlaceholder(r[l])||u>=arguments.length)?p=r[l]:(p=arguments[u],u+=1),a[l]=p,_isPlaceholder(p)||(c-=1),l+=1}return c<=0?i.apply(this,a):_arity(c,_curryN(t,a,i))}}var d=_curry2((function curryN(t,r){return 1===t?_curry1(r):_arity(t,_curryN(t,[],r))})),y=_curry1((function addIndex(t){return d(t.length,(function(){var r=0,i=arguments[0],a=arguments[arguments.length-1],u=Array.prototype.slice.call(arguments,0);return u[0]=function(){var t=i.apply(this,_concat(arguments,[r,a]));return r+=1,t},t.apply(this,u)}))}));function _curry3(t){return function f3(r,i,a){switch(arguments.length){case 0:return f3;case 1:return _isPlaceholder(r)?f3:_curry2((function(i,a){return t(r,i,a)}));case 2:return _isPlaceholder(r)&&_isPlaceholder(i)?f3:_isPlaceholder(r)?_curry2((function(r,a){return t(r,i,a)})):_isPlaceholder(i)?_curry2((function(i,a){return t(r,i,a)})):_curry1((function(a){return t(r,i,a)}));default:return _isPlaceholder(r)&&_isPlaceholder(i)&&_isPlaceholder(a)?f3:_isPlaceholder(r)&&_isPlaceholder(i)?_curry2((function(r,i){return t(r,i,a)})):_isPlaceholder(r)&&_isPlaceholder(a)?_curry2((function(r,a){return t(r,i,a)})):_isPlaceholder(i)&&_isPlaceholder(a)?_curry2((function(i,a){return t(r,i,a)})):_isPlaceholder(r)?_curry1((function(r){return t(r,i,a)})):_isPlaceholder(i)?_curry1((function(i){return t(r,i,a)})):_isPlaceholder(a)?_curry1((function(a){return t(r,i,a)})):t(r,i,a)}}}var h=_curry3((function adjust(t,r,i){if(r>=i.length||r<-i.length)return i;var a=(r<0?i.length:0)+r,u=_concat(i);return u[a]=t(i[a]),u})),g=Array.isArray||function _isArray(t){return null!=t&&t.length>=0&&"[object Array]"===Object.prototype.toString.call(t)};function _isTransformer(t){return"function"==typeof t["@@transducer/step"]}function _dispatchable(t,r,i){return function(){if(0===arguments.length)return i();var a=Array.prototype.slice.call(arguments,0),u=a.pop();if(!g(u)){for(var c=0;c<t.length;){if("function"==typeof u[t[c]])return u[t[c]].apply(u,a);c+=1}if(_isTransformer(u)){var l=r.apply(null,a);return l(u)}}return i.apply(this,arguments)}}function _reduced(t){return t&&t["@@transducer/reduced"]?t:{"@@transducer/value":t,"@@transducer/reduced":!0}}var v={init:function(){return this.xf["@@transducer/init"]()},result:function(t){return this.xf["@@transducer/result"](t)}},m=function(){function XAll(t,r){this.xf=r,this.f=t,this.all=!0}return XAll.prototype["@@transducer/init"]=v.init,XAll.prototype["@@transducer/result"]=function(t){return this.all&&(t=this.xf["@@transducer/step"](t,!0)),this.xf["@@transducer/result"](t)},XAll.prototype["@@transducer/step"]=function(t,r){return this.f(r)||(this.all=!1,t=_reduced(this.xf["@@transducer/step"](t,!1))),t},XAll}(),b=_curry2(_dispatchable(["all"],_curry2((function _xall(t,r){return new m(t,r)})),(function all(t,r){for(var i=0;i<r.length;){if(!t(r[i]))return!1;i+=1}return!0}))),_=_curry2((function max(t,r){return r>t?r:t}));function _map(t,r){for(var i=0,a=r.length,u=Array(a);i<a;)u[i]=t(r[i]),i+=1;return u}function _isString(t){return"[object String]"===Object.prototype.toString.call(t)}var w=_curry1((function isArrayLike(t){return!!g(t)||!!t&&("object"==typeof t&&(!_isString(t)&&(1===t.nodeType?!!t.length:0===t.length||t.length>0&&(t.hasOwnProperty(0)&&t.hasOwnProperty(t.length-1)))))})),x=function(){function XWrap(t){this.f=t}return XWrap.prototype["@@transducer/init"]=function(){throw new Error("init not implemented on XWrap")},XWrap.prototype["@@transducer/result"]=function(t){return t},XWrap.prototype["@@transducer/step"]=function(t,r){return this.f(t,r)},XWrap}();function _xwrap(t){return new x(t)}var S=_curry2((function bind(t,r){return _arity(t.length,(function(){return t.apply(r,arguments)}))}));function _iterableReduce(t,r,i){for(var a=i.next();!a.done;){if((r=t["@@transducer/step"](r,a.value))&&r["@@transducer/reduced"]){r=r["@@transducer/value"];break}a=i.next()}return t["@@transducer/result"](r)}function _methodReduce(t,r,i,a){return t["@@transducer/result"](i[a](S(t["@@transducer/step"],t),r))}var O="undefined"!=typeof Symbol?Symbol.iterator:"@@iterator";function _reduce(t,r,i){if("function"==typeof t&&(t=_xwrap(t)),w(i))return function _arrayReduce(t,r,i){for(var a=0,u=i.length;a<u;){if((r=t["@@transducer/step"](r,i[a]))&&r["@@transducer/reduced"]){r=r["@@transducer/value"];break}a+=1}return t["@@transducer/result"](r)}(t,r,i);if("function"==typeof i["fantasy-land/reduce"])return _methodReduce(t,r,i,"fantasy-land/reduce");if(null!=i[O])return _iterableReduce(t,r,i[O]());if("function"==typeof i.next)return _iterableReduce(t,r,i);if("function"==typeof i.reduce)return _methodReduce(t,r,i,"reduce");throw new TypeError("reduce: list must be array or iterable")}var E=function(){function XMap(t,r){this.xf=r,this.f=t}return XMap.prototype["@@transducer/init"]=v.init,XMap.prototype["@@transducer/result"]=v.result,XMap.prototype["@@transducer/step"]=function(t,r){return this.xf["@@transducer/step"](t,this.f(r))},XMap}(),k=_curry2((function _xmap(t,r){return new E(t,r)}));function _has(t,r){return Object.prototype.hasOwnProperty.call(r,t)}var A=Object.prototype.toString,internal_isArguments=function(){return"[object Arguments]"===A.call(arguments)?function _isArguments(t){return"[object Arguments]"===A.call(t)}:function _isArguments(t){return _has("callee",t)}},N=!{toString:null}.propertyIsEnumerable("toString"),T=["constructor","valueOf","isPrototypeOf","toString","propertyIsEnumerable","hasOwnProperty","toLocaleString"],P=function(){return arguments.propertyIsEnumerable("length")}(),C=function contains(t,r){for(var i=0;i<t.length;){if(t[i]===r)return!0;i+=1}return!1},B=_curry1("function"!=typeof Object.keys||P?function keys(t){if(Object(t)!==t)return[];var r,i,a=[],u=P&&internal_isArguments(t);for(r in t)!_has(r,t)||u&&"length"===r||(a[a.length]=r);if(N)for(i=T.length-1;i>=0;)_has(r=T[i],t)&&!C(a,r)&&(a[a.length]=r),i-=1;return a}:function keys(t){return Object(t)!==t?[]:Object.keys(t)}),I=_curry2(_dispatchable(["fantasy-land/map","map"],k,(function map(t,r){switch(Object.prototype.toString.call(r)){case"[object Function]":return d(r.length,(function(){return t.call(this,r.apply(this,arguments))}));case"[object Object]":return _reduce((function(i,a){return i[a]=t(r[a]),i}),{},B(r));default:return _map(t,r)}}))),R=_curry2((function path(t,r){for(var i=r,a=0;a<t.length;){if(null==i)return;i=i[t[a]],a+=1}return i})),j=_curry2((function prop(t,r){return R([t],r)})),M=_curry2((function pluck(t,r){return I(j(t),r)})),D=_curry3(_reduce),L=_curry1((function allPass(t){return d(D(_,0,M("length",t)),(function(){for(var r=0,i=t.length;r<i;){if(!t[r].apply(this,arguments))return!1;r+=1}return!0}))})),U=_curry2((function and(t,r){return t&&r})),q=function(){function XAny(t,r){this.xf=r,this.f=t,this.any=!1}return XAny.prototype["@@transducer/init"]=v.init,XAny.prototype["@@transducer/result"]=function(t){return this.any||(t=this.xf["@@transducer/step"](t,!1)),this.xf["@@transducer/result"](t)},XAny.prototype["@@transducer/step"]=function(t,r){return this.f(r)&&(this.any=!0,t=_reduced(this.xf["@@transducer/step"](t,!0))),t},XAny}(),W=_curry2((function _xany(t,r){return new q(t,r)})),G=_curry2(_dispatchable(["any"],W,(function any(t,r){for(var i=0;i<r.length;){if(t(r[i]))return!0;i+=1}return!1}))),V=_curry1((function anyPass(t){return d(D(_,0,M("length",t)),(function(){for(var r=0,i=t.length;r<i;){if(t[r].apply(this,arguments))return!0;r+=1}return!1}))})),z=_curry2((function ap(t,r){return"function"==typeof r["fantasy-land/ap"]?r["fantasy-land/ap"](t):"function"==typeof t.ap?t.ap(r):"function"==typeof t?function(i){return t(i)(r(i))}:_reduce((function(t,i){return _concat(t,I(i,r))}),[],t)}));function _aperture(t,r){for(var i=0,a=r.length-(t-1),u=new Array(a>=0?a:0);i<a;)u[i]=Array.prototype.slice.call(r,i,i+t),i+=1;return u}var X=function(){function XAperture(t,r){this.xf=r,this.pos=0,this.full=!1,this.acc=new Array(t)}return XAperture.prototype["@@transducer/init"]=v.init,XAperture.prototype["@@transducer/result"]=function(t){return this.acc=null,this.xf["@@transducer/result"](t)},XAperture.prototype["@@transducer/step"]=function(t,r){return this.store(r),this.full?this.xf["@@transducer/step"](t,this.getCopy()):t},XAperture.prototype.store=function(t){this.acc[this.pos]=t,this.pos+=1,this.pos===this.acc.length&&(this.pos=0,this.full=!0)},XAperture.prototype.getCopy=function(){return _concat(Array.prototype.slice.call(this.acc,this.pos),Array.prototype.slice.call(this.acc,0,this.pos))},XAperture}(),H=_curry2(_dispatchable([],_curry2((function _xaperture(t,r){return new X(t,r)})),_aperture)),Y=_curry2((function append(t,r){return _concat(r,[t])})),$=_curry2((function apply(t,r){return t.apply(this,r)})),K=_curry1((function values(t){for(var r=B(t),i=r.length,a=[],u=0;u<i;)a[u]=t[r[u]],u+=1;return a})),Q=_curry1((function applySpec(t){return t=I((function(t){return"function"==typeof t?t:applySpec(t)}),t),d(D(_,0,M("length",K(t))),(function(){var r=arguments;return I((function(t){return $(t,r)}),t)}))})),J=_curry2((function applyTo(t,r){return r(t)})),Z=_curry3((function ascend(t,r,i){var a=t(r),u=t(i);return a<u?-1:a>u?1:0})),ee=_curry3((function assoc(t,r,i){var a={};for(var u in i)a[u]=i[u];return a[t]=r,a})),te=Number.isInteger||function _isInteger(t){return t<<0===t},re=_curry1((function isNil(t){return null==t})),ne=_curry3((function assocPath(t,r,i){if(0===t.length)return r;var a=t[0];if(t.length>1){var u=!re(i)&&_has(a,i)?i[a]:te(t[1])?[]:{};r=assocPath(Array.prototype.slice.call(t,1),r,u)}if(te(a)&&g(i)){var c=[].concat(i);return c[a]=r,c}return ee(a,r,i)})),ie=_curry2((function nAry(t,r){switch(t){case 0:return function(){return r.call(this)};case 1:return function(t){return r.call(this,t)};case 2:return function(t,i){return r.call(this,t,i)};case 3:return function(t,i,a){return r.call(this,t,i,a)};case 4:return function(t,i,a,u){return r.call(this,t,i,a,u)};case 5:return function(t,i,a,u,c){return r.call(this,t,i,a,u,c)};case 6:return function(t,i,a,u,c,l){return r.call(this,t,i,a,u,c,l)};case 7:return function(t,i,a,u,c,l,p){return r.call(this,t,i,a,u,c,l,p)};case 8:return function(t,i,a,u,c,l,p,d){return r.call(this,t,i,a,u,c,l,p,d)};case 9:return function(t,i,a,u,c,l,p,d,y){return r.call(this,t,i,a,u,c,l,p,d,y)};case 10:return function(t,i,a,u,c,l,p,d,y,h){return r.call(this,t,i,a,u,c,l,p,d,y,h)};default:throw new Error("First argument to nAry must be a non-negative integer no greater than ten")}})),oe=_curry1((function binary(t){return ie(2,t)}));function _isFunction(t){return"[object Function]"===Object.prototype.toString.call(t)}var ae=_curry2((function liftN(t,r){var i=d(t,r);return d(t,(function(){return _reduce(z,I(i,arguments[0]),Array.prototype.slice.call(arguments,1))}))})),ue=_curry1((function lift(t){return ae(t.length,t)})),ce=_curry2((function both(t,r){return _isFunction(t)?function _both(){return t.apply(this,arguments)&&r.apply(this,arguments)}:ue(U)(t,r)})),se=_curry1((function curry(t){return d(t.length,t)})),fe=se((function call(t){return t.apply(this,Array.prototype.slice.call(arguments,1))}));function _makeFlat(t){return function flatt(r){for(var i,a,u,c=[],l=0,p=r.length;l<p;){if(w(r[l]))for(u=0,a=(i=t?flatt(r[l]):r[l]).length;u<a;)c[c.length]=i[u],u+=1;else c[c.length]=r[l];l+=1}return c}}var le=function _xcat(t){var r=function(t){return{"@@transducer/init":v.init,"@@transducer/result":function(r){return t["@@transducer/result"](r)},"@@transducer/step":function(r,i){var a=t["@@transducer/step"](r,i);return a["@@transducer/reduced"]?function _forceReduced(t){return{"@@transducer/value":t,"@@transducer/reduced":!0}}(a):a}}}(t);return{"@@transducer/init":v.init,"@@transducer/result":function(t){return r["@@transducer/result"](t)},"@@transducer/step":function(t,i){return w(i)?_reduce(r,t,i):_reduce(r,t,[i])}}},pe=_curry2(_dispatchable(["fantasy-land/chain","chain"],_curry2((function _xchain(t,r){return I(t,le(r))})),(function chain(t,r){return"function"==typeof r?function(i){return t(r(i))(i)}:_makeFlat(!1)(I(t,r))}))),de=_curry3((function clamp(t,r,i){if(t>r)throw new Error("min must not be greater than max in clamp(min, max, value)");return i<t?t:i>r?r:i}));function _cloneRegExp(t){return new RegExp(t.source,(t.global?"g":"")+(t.ignoreCase?"i":"")+(t.multiline?"m":"")+(t.sticky?"y":"")+(t.unicode?"u":""))}var ye=_curry1((function type(t){return null===t?"Null":void 0===t?"Undefined":Object.prototype.toString.call(t).slice(8,-1)}));function _clone(t,r,i,a){var u=function copy(u){for(var c=r.length,l=0;l<c;){if(t===r[l])return i[l];l+=1}for(var p in r[l+1]=t,i[l+1]=u,t)u[p]=a?_clone(t[p],r,i,!0):t[p];return u};switch(ye(t)){case"Object":return u({});case"Array":return u([]);case"Date":return new Date(t.valueOf());case"RegExp":return _cloneRegExp(t);default:return t}}var he=_curry1((function clone(t){return null!=t&&"function"==typeof t.clone?t.clone():_clone(t,[],[],!0)})),ge=_curry1((function comparator(t){return function(r,i){return t(r,i)?-1:t(i,r)?1:0}})),ve=_curry1((function not(t){return!t})),me=ue(ve);function _pipe(t,r){return function(){return r.call(this,t.apply(this,arguments))}}function _checkForMethod(t,r){return function(){var i=arguments.length;if(0===i)return r();var a=arguments[i-1];return g(a)||"function"!=typeof a[t]?r.apply(this,arguments):a[t].apply(a,Array.prototype.slice.call(arguments,0,i-1))}}var be=_curry3(_checkForMethod("slice",(function slice(t,r,i){return Array.prototype.slice.call(i,t,r)}))),_e=_curry1(_checkForMethod("tail",be(1,1/0)));function pipe(){if(0===arguments.length)throw new Error("pipe requires at least one argument");return _arity(arguments[0].length,D(_pipe,arguments[0],_e(arguments)))}var we=_curry1((function reverse(t){return _isString(t)?t.split("").reverse().join(""):Array.prototype.slice.call(t,0).reverse()}));function compose(){if(0===arguments.length)throw new Error("compose requires at least one argument");return pipe.apply(this,we(arguments))}function composeK(){if(0===arguments.length)throw new Error("composeK requires at least one argument");var t=Array.prototype.slice.call(arguments),r=t.pop();return compose(compose.apply(this,I(pe,t)),r)}function _pipeP(t,r){return function(){var i=this;return t.apply(i,arguments).then((function(t){return r.call(i,t)}))}}function pipeP(){if(0===arguments.length)throw new Error("pipeP requires at least one argument");return _arity(arguments[0].length,D(_pipeP,arguments[0],_e(arguments)))}function composeP(){if(0===arguments.length)throw new Error("composeP requires at least one argument");return pipeP.apply(this,we(arguments))}function _arrayFromIterator(t){for(var r,i=[];!(r=t.next()).done;)i.push(r.value);return i}function _containsWith(t,r,i){for(var a=0,u=i.length;a<u;){if(t(r,i[a]))return!0;a+=1}return!1}var xe=_curry2((function identical(t,r){return t===r?0!==t||1/t==1/r:t!=t&&r!=r}));function _uniqContentEquals(t,r,i,a){var u=_arrayFromIterator(t);function eq(t,r){return _equals(t,r,i.slice(),a.slice())}return!_containsWith((function(t,r){return!_containsWith(eq,r,t)}),_arrayFromIterator(r),u)}function _equals(t,r,i,a){if(xe(t,r))return!0;var u=ye(t);if(u!==ye(r))return!1;if(null==t||null==r)return!1;if("function"==typeof t["fantasy-land/equals"]||"function"==typeof r["fantasy-land/equals"])return"function"==typeof t["fantasy-land/equals"]&&t["fantasy-land/equals"](r)&&"function"==typeof r["fantasy-land/equals"]&&r["fantasy-land/equals"](t);if("function"==typeof t.equals||"function"==typeof r.equals)return"function"==typeof t.equals&&t.equals(r)&&"function"==typeof r.equals&&r.equals(t);switch(u){case"Arguments":case"Array":case"Object":if("function"==typeof t.constructor&&"Promise"===function _functionName(t){var r=String(t).match(/^function (\w*)/);return null==r?"":r[1]}(t.constructor))return t===r;break;case"Boolean":case"Number":case"String":if(typeof t!=typeof r||!xe(t.valueOf(),r.valueOf()))return!1;break;case"Date":if(!xe(t.valueOf(),r.valueOf()))return!1;break;case"Error":return t.name===r.name&&t.message===r.message;case"RegExp":if(t.source!==r.source||t.global!==r.global||t.ignoreCase!==r.ignoreCase||t.multiline!==r.multiline||t.sticky!==r.sticky||t.unicode!==r.unicode)return!1}for(var c=i.length-1;c>=0;){if(i[c]===t)return a[c]===r;c-=1}switch(u){case"Map":return t.size===r.size&&_uniqContentEquals(t.entries(),r.entries(),i.concat([t]),a.concat([r]));case"Set":return t.size===r.size&&_uniqContentEquals(t.values(),r.values(),i.concat([t]),a.concat([r]));case"Arguments":case"Array":case"Object":case"Boolean":case"Number":case"String":case"Date":case"Error":case"RegExp":case"Int8Array":case"Uint8Array":case"Uint8ClampedArray":case"Int16Array":case"Uint16Array":case"Int32Array":case"Uint32Array":case"Float32Array":case"Float64Array":case"ArrayBuffer":break;default:return!1}var l=B(t);if(l.length!==B(r).length)return!1;var p=i.concat([t]),d=a.concat([r]);for(c=l.length-1;c>=0;){var y=l[c];if(!_has(y,r)||!_equals(r[y],t[y],p,d))return!1;c-=1}return!0}var Se=_curry2((function equals(t,r){return _equals(t,r,[],[])}));function _indexOf(t,r,i){var a,u;if("function"==typeof t.indexOf)switch(typeof r){case"number":if(0===r){for(a=1/r;i<t.length;){if(0===(u=t[i])&&1/u===a)return i;i+=1}return-1}if(r!=r){for(;i<t.length;){if("number"==typeof(u=t[i])&&u!=u)return i;i+=1}return-1}return t.indexOf(r,i);case"string":case"boolean":case"function":case"undefined":return t.indexOf(r,i);case"object":if(null===r)return t.indexOf(r,i)}for(;i<t.length;){if(Se(t[i],r))return i;i+=1}return-1}function _contains(t,r){return _indexOf(r,t,0)>=0}function _quote(t){return'"'+t.replace(/\\/g,"\\\\").replace(/[\b]/g,"\\b").replace(/\f/g,"\\f").replace(/\n/g,"\\n").replace(/\r/g,"\\r").replace(/\t/g,"\\t").replace(/\v/g,"\\v").replace(/\0/g,"\\0").replace(/"/g,'\\"')+'"'}var Oe=function pad(t){return(t<10?"0":"")+t},Ee="function"==typeof Date.prototype.toISOString?function _toISOString(t){return t.toISOString()}:function _toISOString(t){return t.getUTCFullYear()+"-"+Oe(t.getUTCMonth()+1)+"-"+Oe(t.getUTCDate())+"T"+Oe(t.getUTCHours())+":"+Oe(t.getUTCMinutes())+":"+Oe(t.getUTCSeconds())+"."+(t.getUTCMilliseconds()/1e3).toFixed(3).slice(2,5)+"Z"};function _complement(t){return function(){return!t.apply(this,arguments)}}function _filter(t,r){for(var i=0,a=r.length,u=[];i<a;)t(r[i])&&(u[u.length]=r[i]),i+=1;return u}function _isObject(t){return"[object Object]"===Object.prototype.toString.call(t)}var ke=function(){function XFilter(t,r){this.xf=r,this.f=t}return XFilter.prototype["@@transducer/init"]=v.init,XFilter.prototype["@@transducer/result"]=v.result,XFilter.prototype["@@transducer/step"]=function(t,r){return this.f(r)?this.xf["@@transducer/step"](t,r):t},XFilter}(),Ae=_curry2(_dispatchable(["filter"],_curry2((function _xfilter(t,r){return new ke(t,r)})),(function(t,r){return _isObject(r)?_reduce((function(i,a){return t(r[a])&&(i[a]=r[a]),i}),{},B(r)):_filter(t,r)}))),Ne=_curry2((function reject(t,r){return Ae(_complement(t),r)}));var Te=_curry1((function toString(t){return function _toString(t,r){var i=function recur(i){var a=r.concat([t]);return _contains(i,a)?"<Circular>":_toString(i,a)},mapPairs=function(t,r){return _map((function(r){return _quote(r)+": "+i(t[r])}),r.slice().sort())};switch(Object.prototype.toString.call(t)){case"[object Arguments]":return"(function() { return arguments; }("+_map(i,t).join(", ")+"))";case"[object Array]":return"["+_map(i,t).concat(mapPairs(t,Ne((function(t){return/^\d+$/.test(t)}),B(t)))).join(", ")+"]";case"[object Boolean]":return"object"==typeof t?"new Boolean("+i(t.valueOf())+")":t.toString();case"[object Date]":return"new Date("+(isNaN(t.valueOf())?i(NaN):_quote(Ee(t)))+")";case"[object Null]":return"null";case"[object Number]":return"object"==typeof t?"new Number("+i(t.valueOf())+")":1/t==-1/0?"-0":t.toString(10);case"[object String]":return"object"==typeof t?"new String("+i(t.valueOf())+")":_quote(t);case"[object Undefined]":return"undefined";default:if("function"==typeof t.toString){var a=t.toString();if("[object Object]"!==a)return a}return"{"+mapPairs(t,B(t)).join(", ")+"}"}}(t,[])})),Pe=_curry2((function concat(t,r){if(g(t)){if(g(r))return t.concat(r);throw new TypeError(Te(r)+" is not an array")}if(_isString(t)){if(_isString(r))return t+r;throw new TypeError(Te(r)+" is not a string")}if(null!=t&&_isFunction(t["fantasy-land/concat"]))return t["fantasy-land/concat"](r);if(null!=t&&_isFunction(t.concat))return t.concat(r);throw new TypeError(Te(t)+' does not have a method named "concat" or "fantasy-land/concat"')})),Ce=_curry1((function cond(t){return _arity(D(_,0,I((function(t){return t[0].length}),t)),(function(){for(var r=0;r<t.length;){if(t[r][0].apply(this,arguments))return t[r][1].apply(this,arguments);r+=1}}))})),Be=_curry2((function constructN(t,r){if(t>10)throw new Error("Constructor with greater than ten arguments");return 0===t?function(){return new r}:se(ie(t,(function(t,i,a,u,c,l,p,d,y,h){switch(arguments.length){case 1:return new r(t);case 2:return new r(t,i);case 3:return new r(t,i,a);case 4:return new r(t,i,a,u);case 5:return new r(t,i,a,u,c);case 6:return new r(t,i,a,u,c,l);case 7:return new r(t,i,a,u,c,l,p);case 8:return new r(t,i,a,u,c,l,p,d);case 9:return new r(t,i,a,u,c,l,p,d,y);case 10:return new r(t,i,a,u,c,l,p,d,y,h)}})))})),Ie=_curry1((function construct(t){return Be(t.length,t)})),Re=_curry2(_contains),je=_curry2((function converge(t,r){return d(D(_,0,M("length",r)),(function(){var i=arguments,a=this;return t.apply(a,_map((function(t){return t.apply(a,i)}),r))}))})),Me=function(){function XReduceBy(t,r,i,a){this.valueFn=t,this.valueAcc=r,this.keyFn=i,this.xf=a,this.inputs={}}return XReduceBy.prototype["@@transducer/init"]=v.init,XReduceBy.prototype["@@transducer/result"]=function(t){var r;for(r in this.inputs)if(_has(r,this.inputs)&&(t=this.xf["@@transducer/step"](t,this.inputs[r]))["@@transducer/reduced"]){t=t["@@transducer/value"];break}return this.inputs=null,this.xf["@@transducer/result"](t)},XReduceBy.prototype["@@transducer/step"]=function(t,r){var i=this.keyFn(r);return this.inputs[i]=this.inputs[i]||[i,this.valueAcc],this.inputs[i][1]=this.valueFn(this.inputs[i][1],r),t},XReduceBy}(),De=_curryN(4,[],_dispatchable([],_curryN(4,[],(function _xreduceBy(t,r,i,a){return new Me(t,r,i,a)})),(function reduceBy(t,r,i,a){return _reduce((function(a,u){var c=i(u);return a[c]=t(_has(c,a)?a[c]:r,u),a}),{},a)}))),Le=De((function(t,r){return t+1}),0),Fe=p(-1),Ue=_curry2((function defaultTo(t,r){return null==r||r!=r?t:r})),qe=_curry3((function descend(t,r,i){var a=t(r),u=t(i);return a>u?-1:a<u?1:0})),We=_curry2((function difference(t,r){for(var i=[],a=0,u=t.length;a<u;)_contains(t[a],r)||_contains(t[a],i)||(i[i.length]=t[a]),a+=1;return i})),Ge=_curry3((function differenceWith(t,r,i){for(var a=[],u=0,c=r.length;u<c;)_containsWith(t,r[u],i)||_containsWith(t,r[u],a)||a.push(r[u]),u+=1;return a})),Ve=_curry2((function dissoc(t,r){var i={};for(var a in r)i[a]=r[a];return delete i[t],i})),ze=_curry3((function remove(t,r,i){var a=Array.prototype.slice.call(i,0);return a.splice(t,r),a})),Xe=_curry3((function update(t,r,i){return h(a(r),t,i)})),He=_curry2((function dissocPath(t,r){switch(t.length){case 0:return r;case 1:return te(t[0])?ze(t[0],1,r):Ve(t[0],r);default:var i=t[0],a=Array.prototype.slice.call(t,1);return null==r[i]?r:te(t[0])?Xe(i,dissocPath(a,r[i]),r):ee(i,dissocPath(a,r[i]),r)}})),Ye=_curry2((function divide(t,r){return t/r})),$e=function(){function XDrop(t,r){this.xf=r,this.n=t}return XDrop.prototype["@@transducer/init"]=v.init,XDrop.prototype["@@transducer/result"]=v.result,XDrop.prototype["@@transducer/step"]=function(t,r){return this.n>0?(this.n-=1,t):this.xf["@@transducer/step"](t,r)},XDrop}(),Ke=_curry2(_dispatchable(["drop"],_curry2((function _xdrop(t,r){return new $e(t,r)})),(function drop(t,r){return be(Math.max(0,t),1/0,r)}))),Qe=function(){function XTake(t,r){this.xf=r,this.n=t,this.i=0}return XTake.prototype["@@transducer/init"]=v.init,XTake.prototype["@@transducer/result"]=v.result,XTake.prototype["@@transducer/step"]=function(t,r){this.i+=1;var i=0===this.n?t:this.xf["@@transducer/step"](t,r);return this.n>=0&&this.i>=this.n?_reduced(i):i},XTake}(),Je=_curry2(_dispatchable(["take"],_curry2((function _xtake(t,r){return new Qe(t,r)})),(function take(t,r){return be(0,t<0?1/0:t,r)})));function dropLast(t,r){return Je(t<r.length?r.length-t:0,r)}var Ze=function(){function XDropLast(t,r){this.xf=r,this.pos=0,this.full=!1,this.acc=new Array(t)}return XDropLast.prototype["@@transducer/init"]=v.init,XDropLast.prototype["@@transducer/result"]=function(t){return this.acc=null,this.xf["@@transducer/result"](t)},XDropLast.prototype["@@transducer/step"]=function(t,r){return this.full&&(t=this.xf["@@transducer/step"](t,this.acc[this.pos])),this.store(r),t},XDropLast.prototype.store=function(t){this.acc[this.pos]=t,this.pos+=1,this.pos===this.acc.length&&(this.pos=0,this.full=!0)},XDropLast}(),et=_curry2(_dispatchable([],_curry2((function _xdropLast(t,r){return new Ze(t,r)})),dropLast));function dropLastWhile(t,r){for(var i=r.length-1;i>=0&&t(r[i]);)i-=1;return be(0,i+1,r)}var tt=function(){function XDropLastWhile(t,r){this.f=t,this.retained=[],this.xf=r}return XDropLastWhile.prototype["@@transducer/init"]=v.init,XDropLastWhile.prototype["@@transducer/result"]=function(t){return this.retained=null,this.xf["@@transducer/result"](t)},XDropLastWhile.prototype["@@transducer/step"]=function(t,r){return this.f(r)?this.retain(t,r):this.flush(t,r)},XDropLastWhile.prototype.flush=function(t,r){return t=_reduce(this.xf["@@transducer/step"],t,this.retained),this.retained=[],this.xf["@@transducer/step"](t,r)},XDropLastWhile.prototype.retain=function(t,r){return this.retained.push(r),t},XDropLastWhile}(),rt=_curry2(_dispatchable([],_curry2((function _xdropLastWhile(t,r){return new tt(t,r)})),dropLastWhile)),nt=function(){function XDropRepeatsWith(t,r){this.xf=r,this.pred=t,this.lastValue=void 0,this.seenFirstValue=!1}return XDropRepeatsWith.prototype["@@transducer/init"]=v.init,XDropRepeatsWith.prototype["@@transducer/result"]=v.result,XDropRepeatsWith.prototype["@@transducer/step"]=function(t,r){var i=!1;return this.seenFirstValue?this.pred(this.lastValue,r)&&(i=!0):this.seenFirstValue=!0,this.lastValue=r,i?t:this.xf["@@transducer/step"](t,r)},XDropRepeatsWith}(),it=_curry2((function _xdropRepeatsWith(t,r){return new nt(t,r)})),ot=_curry2((function nth(t,r){var i=t<0?r.length+t:t;return _isString(r)?r.charAt(i):r[i]})),at=ot(-1),ut=_curry2(_dispatchable([],it,(function dropRepeatsWith(t,r){var i=[],a=1,u=r.length;if(0!==u)for(i[0]=r[0];a<u;)t(at(i),r[a])||(i[i.length]=r[a]),a+=1;return i}))),ct=_curry1(_dispatchable([],it(Se),ut(Se))),st=function(){function XDropWhile(t,r){this.xf=r,this.f=t}return XDropWhile.prototype["@@transducer/init"]=v.init,XDropWhile.prototype["@@transducer/result"]=v.result,XDropWhile.prototype["@@transducer/step"]=function(t,r){if(this.f){if(this.f(r))return t;this.f=null}return this.xf["@@transducer/step"](t,r)},XDropWhile}(),ft=_curry2(_dispatchable(["dropWhile"],_curry2((function _xdropWhile(t,r){return new st(t,r)})),(function dropWhile(t,r){for(var i=0,a=r.length;i<a&&t(r[i]);)i+=1;return be(i,1/0,r)}))),pt=_curry2((function or(t,r){return t||r})),dt=_curry2((function either(t,r){return _isFunction(t)?function _either(){return t.apply(this,arguments)||r.apply(this,arguments)}:ue(pt)(t,r)})),yt=_curry1((function empty(t){return null!=t&&"function"==typeof t["fantasy-land/empty"]?t["fantasy-land/empty"]():null!=t&&null!=t.constructor&&"function"==typeof t.constructor["fantasy-land/empty"]?t.constructor["fantasy-land/empty"]():null!=t&&"function"==typeof t.empty?t.empty():null!=t&&null!=t.constructor&&"function"==typeof t.constructor.empty?t.constructor.empty():g(t)?[]:_isString(t)?"":_isObject(t)?{}:internal_isArguments(t)?function(){return arguments}():void 0})),ht=_curry2((function takeLast(t,r){return Ke(t>=0?r.length-t:0,r)})),vt=_curry2((function(t,r){return Se(ht(t.length,r),t)})),mt=_curry3((function eqBy(t,r,i){return Se(t(r),t(i))})),bt=_curry3((function eqProps(t,r,i){return Se(r[t],i[t])})),_t=_curry2((function evolve(t,r){var i,a,u,c={};for(a in r)u=typeof(i=t[a]),c[a]="function"===u?i(r[a]):i&&"object"===u?evolve(i,r[a]):r[a];return c})),wt=function(){function XFind(t,r){this.xf=r,this.f=t,this.found=!1}return XFind.prototype["@@transducer/init"]=v.init,XFind.prototype["@@transducer/result"]=function(t){return this.found||(t=this.xf["@@transducer/step"](t,void 0)),this.xf["@@transducer/result"](t)},XFind.prototype["@@transducer/step"]=function(t,r){return this.f(r)&&(this.found=!0,t=_reduced(this.xf["@@transducer/step"](t,r))),t},XFind}(),xt=_curry2(_dispatchable(["find"],_curry2((function _xfind(t,r){return new wt(t,r)})),(function find(t,r){for(var i=0,a=r.length;i<a;){if(t(r[i]))return r[i];i+=1}}))),St=function(){function XFindIndex(t,r){this.xf=r,this.f=t,this.idx=-1,this.found=!1}return XFindIndex.prototype["@@transducer/init"]=v.init,XFindIndex.prototype["@@transducer/result"]=function(t){return this.found||(t=this.xf["@@transducer/step"](t,-1)),this.xf["@@transducer/result"](t)},XFindIndex.prototype["@@transducer/step"]=function(t,r){return this.idx+=1,this.f(r)&&(this.found=!0,t=_reduced(this.xf["@@transducer/step"](t,this.idx))),t},XFindIndex}(),Ot=_curry2(_dispatchable([],_curry2((function _xfindIndex(t,r){return new St(t,r)})),(function findIndex(t,r){for(var i=0,a=r.length;i<a;){if(t(r[i]))return i;i+=1}return-1}))),Et=function(){function XFindLast(t,r){this.xf=r,this.f=t}return XFindLast.prototype["@@transducer/init"]=v.init,XFindLast.prototype["@@transducer/result"]=function(t){return this.xf["@@transducer/result"](this.xf["@@transducer/step"](t,this.last))},XFindLast.prototype["@@transducer/step"]=function(t,r){return this.f(r)&&(this.last=r),t},XFindLast}(),kt=_curry2(_dispatchable([],_curry2((function _xfindLast(t,r){return new Et(t,r)})),(function findLast(t,r){for(var i=r.length-1;i>=0;){if(t(r[i]))return r[i];i-=1}}))),At=function(){function XFindLastIndex(t,r){this.xf=r,this.f=t,this.idx=-1,this.lastIdx=-1}return XFindLastIndex.prototype["@@transducer/init"]=v.init,XFindLastIndex.prototype["@@transducer/result"]=function(t){return this.xf["@@transducer/result"](this.xf["@@transducer/step"](t,this.lastIdx))},XFindLastIndex.prototype["@@transducer/step"]=function(t,r){return this.idx+=1,this.f(r)&&(this.lastIdx=this.idx),t},XFindLastIndex}(),Nt=_curry2(_dispatchable([],_curry2((function _xfindLastIndex(t,r){return new At(t,r)})),(function findLastIndex(t,r){for(var i=r.length-1;i>=0;){if(t(r[i]))return i;i-=1}return-1}))),Tt=_curry1(_makeFlat(!0)),Pt=_curry1((function flip(t){return d(t.length,(function(r,i){var a=Array.prototype.slice.call(arguments,0);return a[0]=i,a[1]=r,t.apply(this,a)}))})),Ct=_curry2(_checkForMethod("forEach",(function forEach(t,r){for(var i=r.length,a=0;a<i;)t(r[a]),a+=1;return r}))),Bt=_curry2((function forEachObjIndexed(t,r){for(var i=B(r),a=0;a<i.length;){var u=i[a];t(r[u],u,r),a+=1}return r})),It=_curry1((function fromPairs(t){for(var r={},i=0;i<t.length;)r[t[i][0]]=t[i][1],i+=1;return r})),Rt=_curry2(_checkForMethod("groupBy",De((function(t,r){return null==t&&(t=[]),t.push(r),t}),null))),jt=_curry2((function(t,r){for(var i=[],a=0,u=r.length;a<u;){for(var c=a+1;c<u&&t(r[c-1],r[c]);)c+=1;i.push(r.slice(a,c)),a=c}return i})),Mt=_curry2((function gt(t,r){return t>r})),Dt=_curry2((function gte(t,r){return t>=r})),Lt=_curry2(_has),Ft=_curry2((function hasIn(t,r){return t in r})),Ut=ot(0);function _identity(t){return t}var qt=_curry1(_identity),Wt=_curry3((function ifElse(t,r,i){return d(Math.max(t.length,r.length,i.length),(function _ifElse(){return t.apply(this,arguments)?r.apply(this,arguments):i.apply(this,arguments)}))})),Gt=p(1),Vt=De((function(t,r){return r}),null),zt=_curry2((function indexOf(t,r){return"function"!=typeof r.indexOf||g(r)?_indexOf(r,t,0):r.indexOf(t)})),Xt=be(0,-1),Ht=_curry3((function innerJoin(t,r,i){return _filter((function(r){return _containsWith(t,r,i)}),r)})),Yt=_curry3((function insert(t,r,i){t=t<i.length&&t>=0?t:i.length;var a=Array.prototype.slice.call(i,0);return a.splice(t,0,r),a})),$t=_curry3((function insertAll(t,r,i){return t=t<i.length&&t>=0?t:i.length,[].concat(Array.prototype.slice.call(i,0,t),r,Array.prototype.slice.call(i,t))}));function hasOrAdd(t,r,i){var a,u=typeof t;switch(u){case"string":case"number":return 0===t&&1/t==-1/0?!!i._items["-0"]||(r&&(i._items["-0"]=!0),!1):null!==i._nativeSet?r?(a=i._nativeSet.size,i._nativeSet.add(t),i._nativeSet.size===a):i._nativeSet.has(t):u in i._items?t in i._items[u]||(r&&(i._items[u][t]=!0),!1):(r&&(i._items[u]={},i._items[u][t]=!0),!1);case"boolean":if(u in i._items){var c=t?1:0;return!!i._items[u][c]||(r&&(i._items[u][c]=!0),!1)}return r&&(i._items[u]=t?[!1,!0]:[!0,!1]),!1;case"function":return null!==i._nativeSet?r?(a=i._nativeSet.size,i._nativeSet.add(t),i._nativeSet.size===a):i._nativeSet.has(t):u in i._items?!!_contains(t,i._items[u])||(r&&i._items[u].push(t),!1):(r&&(i._items[u]=[t]),!1);case"undefined":return!!i._items[u]||(r&&(i._items[u]=!0),!1);case"object":if(null===t)return!!i._items.null||(r&&(i._items.null=!0),!1);default:return(u=Object.prototype.toString.call(t))in i._items?!!_contains(t,i._items[u])||(r&&i._items[u].push(t),!1):(r&&(i._items[u]=[t]),!1)}}var Kt=function(){function _Set(){this._nativeSet="function"==typeof Set?new Set:null,this._items={}}return _Set.prototype.add=function(t){return!hasOrAdd(t,!0,this)},_Set.prototype.has=function(t){return hasOrAdd(t,!1,this)},_Set}(),Qt=_curry2((function uniqBy(t,r){for(var i,a,u=new Kt,c=[],l=0;l<r.length;)i=t(a=r[l]),u.add(i)&&c.push(a),l+=1;return c})),Jt=Qt(qt),Zt=_curry2((function intersection(t,r){var i,a;return t.length>r.length?(i=t,a=r):(i=r,a=t),Jt(_filter(Pt(_contains)(i),a))})),er=_curry2(_checkForMethod("intersperse",(function intersperse(t,r){for(var i=[],a=0,u=r.length;a<u;)a===u-1?i.push(r[a]):i.push(r[a],t),a+=1;return i})));var tr="function"==typeof Object.assign?Object.assign:function _objectAssign(t){if(null==t)throw new TypeError("Cannot convert undefined or null to object");for(var r=Object(t),i=1,a=arguments.length;i<a;){var u=arguments[i];if(null!=u)for(var c in u)_has(c,u)&&(r[c]=u[c]);i+=1}return r},rr=_curry2((function objOf(t,r){var i={};return i[t]=r,i})),nr={"@@transducer/init":Array,"@@transducer/step":function(t,r){return t.push(r),t},"@@transducer/result":_identity},ir={"@@transducer/init":String,"@@transducer/step":function(t,r){return t+r},"@@transducer/result":_identity},ar={"@@transducer/init":Object,"@@transducer/step":function(t,r){return tr(t,w(r)?rr(r[0],r[1]):r)},"@@transducer/result":_identity};var ur=_curry3((function into(t,r,i){return _isTransformer(t)?_reduce(r(t),t["@@transducer/init"](),i):_reduce(r(function _stepCat(t){if(_isTransformer(t))return t;if(w(t))return nr;if("string"==typeof t)return ir;if("object"==typeof t)return ar;throw new Error("Cannot create transformer for "+t)}(t)),_clone(t,[],[],!1),i)})),cr=_curry1((function invert(t){for(var r=B(t),i=r.length,a=0,u={};a<i;){var c=r[a],l=t[c],p=_has(l,u)?u[l]:u[l]=[];p[p.length]=c,a+=1}return u})),sr=_curry1((function invertObj(t){for(var r=B(t),i=r.length,a=0,u={};a<i;){var c=r[a];u[t[c]]=c,a+=1}return u})),fr=_curry2((function invoker(t,r){return d(t+1,(function(){var i=arguments[t];if(null!=i&&_isFunction(i[r]))return i[r].apply(i,Array.prototype.slice.call(arguments,0,t));throw new TypeError(Te(i)+' does not have a method named "'+r+'"')}))})),lr=_curry2((function is(t,r){return null!=r&&r.constructor===t||r instanceof t})),pr=_curry1((function isEmpty(t){return null!=t&&Se(t,yt(t))})),dr=fr(1,"join"),yr=_curry1((function juxt(t){return je((function(){return Array.prototype.slice.call(arguments,0)}),t)})),hr=_curry1((function keysIn(t){var r,i=[];for(r in t)i[i.length]=r;return i})),gr=_curry2((function lastIndexOf(t,r){if("function"!=typeof r.lastIndexOf||g(r)){for(var i=r.length-1;i>=0;){if(Se(r[i],t))return i;i-=1}return-1}return r.lastIndexOf(t)}));function _isNumber(t){return"[object Number]"===Object.prototype.toString.call(t)}var vr=_curry1((function length(t){return null!=t&&_isNumber(t.length)?t.length:NaN})),mr=_curry2((function lens(t,r){return function(i){return function(a){return I((function(t){return r(t,a)}),i(t(a)))}}})),br=_curry1((function lensIndex(t){return mr(ot(t),Xe(t))})),_r=_curry1((function lensPath(t){return mr(R(t),ne(t))})),wr=_curry1((function lensProp(t){return mr(j(t),ee(t))})),xr=_curry2((function lt(t,r){return t<r})),Sr=_curry2((function lte(t,r){return t<=r})),Or=_curry3((function mapAccum(t,r,i){for(var a=0,u=i.length,c=[],l=[r];a<u;)l=t(l[0],i[a]),c[a]=l[1],a+=1;return[l[0],c]})),Er=_curry3((function mapAccumRight(t,r,i){for(var a=i.length-1,u=[],c=[r];a>=0;)c=t(i[a],c[0]),u[a]=c[1],a-=1;return[u,c[0]]})),kr=_curry2((function mapObjIndexed(t,r){return _reduce((function(i,a){return i[a]=t(r[a],a,r),i}),{},B(r))})),Ar=_curry2((function match(t,r){return r.match(t)||[]})),Nr=_curry2((function mathMod(t,r){return te(t)?!te(r)||r<1?NaN:(t%r+r)%r:NaN})),Tr=_curry3((function maxBy(t,r,i){return t(i)>t(r)?i:r})),Pr=D(p,0),Cr=_curry1((function mean(t){return Pr(t)/t.length})),Br=_curry1((function median(t){var r=t.length;if(0===r)return NaN;var i=2-r%2,a=(r-i)/2;return Cr(Array.prototype.slice.call(t,0).sort((function(t,r){return t<r?-1:t>r?1:0})).slice(a,a+i))})),Ir=_curry2((function memoizeWith(t,r){var i={};return _arity(r.length,(function(){var a=t.apply(this,arguments);return _has(a,i)||(i[a]=r.apply(this,arguments)),i[a]}))})),Rr=Ir((function(){return Te(arguments)})),jr=_curry2((function merge(t,r){return tr({},t,r)})),Mr=_curry1((function mergeAll(t){return tr.apply(null,[{}].concat(t))})),Dr=_curry3((function mergeWithKey(t,r,i){var a,u={};for(a in r)_has(a,r)&&(u[a]=_has(a,i)?t(a,r[a],i[a]):r[a]);for(a in i)_has(a,i)&&!_has(a,u)&&(u[a]=i[a]);return u})),Lr=_curry3((function mergeDeepWithKey(t,r,i){return Dr((function(r,i,a){return _isObject(i)&&_isObject(a)?mergeDeepWithKey(t,i,a):t(r,i,a)}),r,i)})),Fr=_curry2((function mergeDeepLeft(t,r){return Lr((function(t,r,i){return r}),t,r)})),Ur=_curry2((function mergeDeepRight(t,r){return Lr((function(t,r,i){return i}),t,r)})),qr=_curry3((function mergeDeepWith(t,r,i){return Lr((function(r,i,a){return t(i,a)}),r,i)})),Wr=_curry3((function mergeWith(t,r,i){return Dr((function(r,i,a){return t(i,a)}),r,i)})),Gr=_curry2((function min(t,r){return r<t?r:t})),Vr=_curry3((function minBy(t,r,i){return t(i)<t(r)?i:r})),zr=_curry2((function modulo(t,r){return t%r})),Xr=_curry2((function multiply(t,r){return t*r})),Hr=_curry1((function negate(t){return-t})),Yr=_curry2(_complement(_dispatchable(["any"],W,G))),$r=_curry1((function nthArg(t){return d(t<0?1:t+1,(function(){return ot(t,arguments)}))})),Kr=_curry3((function o(t,r,i){return t(r(i))}));function _of(t){return[t]}var Qr=_curry1(_of),Jr=_curry2((function omit(t,r){for(var i={},a={},u=0,c=t.length;u<c;)a[t[u]]=1,u+=1;for(var l in r)a.hasOwnProperty(l)||(i[l]=r[l]);return i})),Zr=_curry1((function once(t){var r,i=!1;return _arity(t.length,(function(){return i?r:(i=!0,r=t.apply(this,arguments))}))})),Identity=function(t){return{value:t,map:function(r){return Identity(r(t))}}},en=_curry3((function over(t,r,i){return t((function(t){return Identity(r(t))}))(i).value})),tn=_curry2((function pair(t,r){return[t,r]}));function _createPartialApplicator(t){return _curry2((function(r,i){return _arity(Math.max(0,r.length-i.length),(function(){return r.apply(this,t(i,arguments))}))}))}var rn=_createPartialApplicator(_concat),nn=_createPartialApplicator(Pt(_concat)),on=yr([Ae,Ne]),an=_curry3((function pathEq(t,r,i){return Se(R(t,i),r)})),un=_curry3((function pathOr(t,r,i){return Ue(t,R(r,i))})),cn=_curry3((function pathSatisfies(t,r,i){return r.length>0&&t(R(r,i))})),sn=_curry2((function pick(t,r){for(var i={},a=0;a<t.length;)t[a]in r&&(i[t[a]]=r[t[a]]),a+=1;return i})),ln=_curry2((function pickAll(t,r){for(var i={},a=0,u=t.length;a<u;){var c=t[a];i[c]=r[c],a+=1}return i})),pn=_curry2((function pickBy(t,r){var i={};for(var a in r)t(r[a],a,r)&&(i[a]=r[a]);return i}));function pipeK(){if(0===arguments.length)throw new Error("pipeK requires at least one argument");return composeK.apply(this,we(arguments))}var dn=_curry2((function prepend(t,r){return _concat([t],r)})),yn=D(Xr,1),hn=_curry2((function useWith(t,r){return d(r.length,(function(){for(var i=[],a=0;a<r.length;)i.push(r[a].call(this,arguments[a])),a+=1;return t.apply(this,i.concat(Array.prototype.slice.call(arguments,r.length)))}))})),gn=hn(_map,[ln,qt]),vn=_curry3((function propEq(t,r,i){return Se(r,i[t])})),mn=_curry3((function propIs(t,r,i){return lr(t,i[r])})),bn=_curry3((function propOr(t,r,i){return null!=i&&_has(r,i)?i[r]:t})),_n=_curry3((function propSatisfies(t,r,i){return t(i[r])})),wn=_curry2((function props(t,r){for(var i=t.length,a=[],u=0;u<i;)a[u]=r[t[u]],u+=1;return a})),xn=_curry2((function range(t,r){if(!_isNumber(t)||!_isNumber(r))throw new TypeError("Both arguments to range must be numbers");for(var i=[],a=t;a<r;)i.push(a),a+=1;return i})),Sn=_curry3((function reduceRight(t,r,i){for(var a=i.length-1;a>=0;)r=t(i[a],r),a-=1;return r})),On=_curryN(4,[],(function _reduceWhile(t,r,i,a){return _reduce((function(i,a){return t(i,a)?r(i,a):_reduced(i)}),i,a)})),En=_curry1(_reduced),kn=_curry2((function times(t,r){var i,a=Number(r),u=0;if(a<0||isNaN(a))throw new RangeError("n must be a non-negative number");for(i=new Array(a);u<a;)i[u]=t(u),u+=1;return i})),An=_curry2((function repeat(t,r){return kn(a(t),r)})),Nn=_curry3((function replace(t,r,i){return i.replace(t,r)})),Tn=_curry3((function scan(t,r,i){for(var a=0,u=i.length,c=[r];a<u;)r=t(r,i[a]),c[a+1]=r,a+=1;return c})),Pn=_curry2((function sequence(t,r){return"function"==typeof r.sequence?r.sequence(t):Sn((function(t,r){return z(I(dn,t),r)}),t([]),r)})),Cn=_curry3((function set(t,r,i){return en(t,a(r),i)})),Bn=_curry2((function sort(t,r){return Array.prototype.slice.call(r,0).sort(t)})),In=_curry2((function sortBy(t,r){return Array.prototype.slice.call(r,0).sort((function(r,i){var a=t(r),u=t(i);return a<u?-1:a>u?1:0}))})),Rn=_curry2((function sortWith(t,r){return Array.prototype.slice.call(r,0).sort((function(r,i){for(var a=0,u=0;0===a&&u<t.length;)a=t[u](r,i),u+=1;return a}))})),jn=fr(1,"split"),Mn=_curry2((function splitAt(t,r){return[be(0,t,r),be(t,vr(r),r)]})),Dn=_curry2((function splitEvery(t,r){if(t<=0)throw new Error("First argument to splitEvery must be a positive integer");for(var i=[],a=0;a<r.length;)i.push(be(a,a+=t,r));return i})),Ln=_curry2((function splitWhen(t,r){for(var i=0,a=r.length,u=[];i<a&&!t(r[i]);)u.push(r[i]),i+=1;return[u,Array.prototype.slice.call(r,i)]})),Fn=_curry2((function(t,r){return Se(Je(t.length,r),t)})),Un=_curry2((function subtract(t,r){return Number(t)-Number(r)})),qn=_curry2((function symmetricDifference(t,r){return Pe(We(t,r),We(r,t))})),Wn=_curry3((function symmetricDifferenceWith(t,r,i){return Pe(Ge(t,r,i),Ge(t,i,r))})),Gn=_curry2((function takeLastWhile(t,r){for(var i=r.length-1;i>=0&&t(r[i]);)i-=1;return be(i+1,1/0,r)})),Vn=function(){function XTakeWhile(t,r){this.xf=r,this.f=t}return XTakeWhile.prototype["@@transducer/init"]=v.init,XTakeWhile.prototype["@@transducer/result"]=v.result,XTakeWhile.prototype["@@transducer/step"]=function(t,r){return this.f(r)?this.xf["@@transducer/step"](t,r):_reduced(t)},XTakeWhile}(),zn=_curry2(_dispatchable(["takeWhile"],_curry2((function _xtakeWhile(t,r){return new Vn(t,r)})),(function takeWhile(t,r){for(var i=0,a=r.length;i<a&&t(r[i]);)i+=1;return be(0,i,r)}))),Xn=function(){function XTap(t,r){this.xf=r,this.f=t}return XTap.prototype["@@transducer/init"]=v.init,XTap.prototype["@@transducer/result"]=v.result,XTap.prototype["@@transducer/step"]=function(t,r){return this.f(r),this.xf["@@transducer/step"](t,r)},XTap}(),Hn=_curry2(_dispatchable([],_curry2((function _xtap(t,r){return new Xn(t,r)})),(function tap(t,r){return t(r),r})));var Yn=_curry2((function test(t,r){if(!function _isRegExp(t){return"[object RegExp]"===Object.prototype.toString.call(t)}(t))throw new TypeError("‘test’ requires a value of type RegExp as its first argument; received "+Te(t));return _cloneRegExp(t).test(r)})),$n=fr(0,"toLowerCase"),Kn=_curry1((function toPairs(t){var r=[];for(var i in t)_has(i,t)&&(r[r.length]=[i,t[i]]);return r})),Qn=_curry1((function toPairsIn(t){var r=[];for(var i in t)r[r.length]=[i,t[i]];return r})),Jn=fr(0,"toUpperCase"),Zn=d(4,(function transduce(t,r,i,a){return _reduce(t("function"==typeof r?_xwrap(r):r),i,a)})),ei=_curry1((function transpose(t){for(var r=0,i=[];r<t.length;){for(var a=t[r],u=0;u<a.length;)void 0===i[u]&&(i[u]=[]),i[u].push(a[u]),u+=1;r+=1}return i})),ti=_curry3((function traverse(t,r,i){return"function"==typeof i["fantasy-land/traverse"]?i["fantasy-land/traverse"](r,t):Pn(t,I(r,i))})),ri="\t\n\v\f\r   ᠎             　\u2028\u2029\ufeff",ni=_curry1("function"==typeof String.prototype.trim&&!ri.trim()&&"​".trim()?function trim(t){return t.trim()}:function trim(t){var r=new RegExp("^["+ri+"]["+ri+"]*"),i=new RegExp("["+ri+"]["+ri+"]*$");return t.replace(r,"").replace(i,"")}),ii=_curry2((function _tryCatch(t,r){return _arity(t.length,(function(){try{return t.apply(this,arguments)}catch(t){return r.apply(this,_concat([t],arguments))}}))})),oi=_curry1((function unapply(t){return function(){return t(Array.prototype.slice.call(arguments,0))}})),ai=_curry1((function unary(t){return ie(1,t)})),ui=_curry2((function uncurryN(t,r){return d(t,(function(){for(var i,a=1,u=r,c=0;a<=t&&"function"==typeof u;)i=a===t?arguments.length:c+u.length,u=u.apply(this,Array.prototype.slice.call(arguments,c,i)),a+=1,c=i;return u}))})),ci=_curry2((function unfold(t,r){for(var i=t(r),a=[];i&&i.length;)a[a.length]=i[0],i=t(i[1]);return a})),si=_curry2(compose(Jt,_concat)),fi=_curry2((function uniqWith(t,r){for(var i,a=0,u=r.length,c=[];a<u;)_containsWith(t,i=r[a],c)||(c[c.length]=i),a+=1;return c})),li=_curry3((function unionWith(t,r,i){return fi(t,_concat(r,i))})),pi=_curry3((function unless(t,r,i){return t(i)?i:r(i)})),di=pe(_identity),yi=_curry3((function until(t,r,i){for(var a=i;!t(a);)a=r(a);return a})),hi=_curry1((function valuesIn(t){var r,i=[];for(r in t)i[i.length]=t[r];return i})),Const=function(t){return{value:t,"fantasy-land/map":function(){return this}}},gi=_curry2((function view(t,r){return t(Const)(r).value})),vi=_curry3((function when(t,r,i){return t(i)?r(i):i})),mi=_curry2((function where(t,r){for(var i in t)if(_has(i,t)&&!t[i](r[i]))return!1;return!0})),bi=_curry2((function whereEq(t,r){return mi(I(Se,t),r)})),_i=_curry2((function(t,r){return Ne(Pt(_contains)(t),r)})),wi=_curry2((function xprod(t,r){for(var i,a=0,u=t.length,c=r.length,l=[];a<u;){for(i=0;i<c;)l[l.length]=[t[a],r[i]],i+=1;a+=1}return l})),xi=_curry2((function zip(t,r){for(var i=[],a=0,u=Math.min(t.length,r.length);a<u;)i[a]=[t[a],r[a]],a+=1;return i})),Si=_curry2((function zipObj(t,r){for(var i=0,a=Math.min(t.length,r.length),u={};i<a;)u[t[i]]=r[i],i+=1;return u})),Oi=_curry3((function zipWith(t,r,i){for(var a=[],u=0,c=Math.min(r.length,i.length);u<c;)a[u]=t(r[u],i[u]),u+=1;return a}))},function(t,r,i){t.exports=i(110)},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(25)),c=i(108),l=i(10),p=a(i(164)),d=a(i(250)),y=a(i(253)),h=a(i(255)),g=a(i(256)),v=a(i(261)),m=a(i(269));function ownKeys(t,r){var i=Object.keys(t);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(t);r&&(a=a.filter((function(r){return Object.getOwnPropertyDescriptor(t,r).enumerable}))),i.push.apply(i,a)}return i}function _objectSpread(t){for(var r=1;r<arguments.length;r++){var i=null!=arguments[r]?arguments[r]:{};r%2?ownKeys(Object(i),!0).forEach((function(r){(0,u.default)(t,r,i[r])})):Object.getOwnPropertyDescriptors?Object.defineProperties(t,Object.getOwnPropertyDescriptors(i)):ownKeys(Object(i)).forEach((function(r){Object.defineProperty(t,r,Object.getOwnPropertyDescriptor(i,r))}))}return t}var b={addConfig:function addConfig(t,r){var a,b,_=r.network,w=void 0===_?"mainnet":_,x=r.staging,S=void 0!==x&&x,O={kovan:i(283),mainnet:i(284)};try{O.testnet=i(285)}catch(t){}var E="ganache"==w?"testnet":w,k=(a={},(0,u.default)(a,l.ESM,{address:(0,c.map)((0,c.prop)("MCD_ESM"),O),abi:i(286)}),(0,u.default)(a,l.END,{address:(0,c.map)((0,c.prop)("MCD_END"),O),abi:i(287)}),a),A=_objectSpread((b={},(0,u.default)(b,l.CHIEF,{address:(0,c.map)((0,c.prop)("MCD_ADM"),O),abi:i(288)}),(0,u.default)(b,l.VOTE_PROXY_FACTORY,{address:(0,c.map)((0,c.prop)("VOTE_PROXY_FACTORY"),O),abi:i(289)}),(0,u.default)(b,l.POLLING,{address:(0,c.map)((0,c.prop)("POLLING"),O),abi:i(290)}),(0,u.default)(b,l.BATCH_POLLING,{address:(0,c.map)((0,c.prop)("BATCH_POLLING"),O),abi:i(291)}),(0,u.default)(b,l.PAUSE,{address:(0,c.map)((0,c.prop)("PAUSE"),O),abi:i(292)}),b),k);return _objectSpread(_objectSpread({},t),{},{additionalServices:["chief","voteProxy","voteProxyFactory","govPolling","govQueryApi","esm","spell"],chief:[p.default],voteProxy:[d.default],voteProxyFactory:[y.default],govPolling:[h.default],govQueryApi:[g.default,{staging:S}],esm:[v.default],spell:[m.default],smartContract:{addContracts:A},token:{erc20:[{currency:l.MKR,symbol:l.MKR.symbol,address:O[E].SAI_GOV},{currency:l.IOU,symbol:l.IOU.symbol,address:O[E].MCD_IOU}]}})}};r.default=b},function(t,r,i){i(112),t.exports=i(4).Object.assign},function(t,r,i){var a=i(11);a(a.S+a.F,"Object",{assign:i(114)})},function(t,r){t.exports=function(t){if("function"!=typeof t)throw TypeError(t+" is not a function!");return t}},function(t,r,i){var a=i(14),u=i(31),c=i(49),l=i(34),p=i(27),d=i(71),y=Object.assign;t.exports=!y||i(21)((function(){var t={},r={},i=Symbol(),a="abcdefghijklmnopqrst";return t[i]=7,a.split("").forEach((function(t){r[t]=t})),7!=y({},t)[i]||Object.keys(y({},r)).join("")!=a}))?function assign(t,r){for(var i=p(t),y=arguments.length,h=1,g=c.f,v=l.f;y>h;)for(var m,b=d(arguments[h++]),_=g?u(b).concat(g(b)):u(b),w=_.length,x=0;w>x;)m=_[x++],a&&!v.call(b,m)||(i[m]=b[m]);return i}:y},function(t,r,i){var a=i(22),u=i(72),c=i(116);t.exports=function(t){return function(r,i,l){var p,d=a(r),y=u(d.length),h=c(l,y);if(t&&i!=i){for(;y>h;)if((p=d[h++])!=p)return!0}else for(;y>h;h++)if((t||h in d)&&d[h]===i)return t||h||0;return!t&&-1}}},function(t,r,i){var a=i(45),u=Math.max,c=Math.min;t.exports=function(t,r){return(t=a(t))<0?u(t+r,0):c(t,r)}},function(t,r,i){i(118),t.exports=i(4).Object.getPrototypeOf},function(t,r,i){var a=i(27),u=i(74);i(119)("getPrototypeOf",(function(){return function getPrototypeOf(t){return u(a(t))}}))},function(t,r,i){var a=i(11),u=i(4),c=i(21);t.exports=function(t,r){var i=(u.Object||{})[t]||Object[t],l={};l[t]=r(i),a(a.S+a.F*c((function(){i(1)})),"Object",l)}},function(t,r,i){t.exports={default:i(121),__esModule:!0}},function(t,r,i){i(50),i(80),t.exports=i(53).f("iterator")},function(t,r,i){var a=i(45),u=i(44);t.exports=function(t){return function(r,i){var c,l,p=String(u(r)),d=a(i),y=p.length;return d<0||d>=y?t?"":void 0:(c=p.charCodeAt(d))<55296||c>56319||d+1===y||(l=p.charCodeAt(d+1))<56320||l>57343?t?p.charAt(d):c:t?p.slice(d,d+2):l-56320+(c-55296<<10)+65536}}},function(t,r,i){var a=i(51),u=i(26),c=i(52),l={};i(19)(l,i(7)("iterator"),(function(){return this})),t.exports=function(t,r,i){t.prototype=a(l,{next:u(1,i)}),c(t,r+" Iterator")}},function(t,r,i){var a=i(13),u=i(16),c=i(31);t.exports=i(14)?Object.defineProperties:function defineProperties(t,r){u(t);for(var i,l=c(r),p=l.length,d=0;p>d;)a.f(t,i=l[d++],r[i]);return t}},function(t,r,i){var a=i(12).document;t.exports=a&&a.documentElement},function(t,r,i){var a=i(127),u=i(128),c=i(28),l=i(22);t.exports=i(78)(Array,"Array",(function(t,r){this._t=l(t),this._i=0,this._k=r}),(function(){var t=this._t,r=this._k,i=this._i++;return!t||i>=t.length?(this._t=void 0,u(1)):u(0,"keys"==r?i:"values"==r?t[i]:[i,t[i]])}),"values"),c.Arguments=c.Array,a("keys"),a("values"),a("entries")},function(t,r){t.exports=function(){}},function(t,r){t.exports=function(t,r){return{value:r,done:!!t}}},function(t,r,i){t.exports={default:i(130),__esModule:!0}},function(t,r,i){i(131),i(136),i(137),i(138),t.exports=i(4).Symbol},function(t,r,i){var a=i(12),u=i(17),c=i(14),l=i(11),p=i(79),d=i(132).KEY,y=i(21),h=i(47),g=i(52),v=i(33),m=i(7),b=i(53),_=i(54),w=i(133),x=i(134),S=i(16),O=i(20),E=i(27),k=i(22),A=i(42),N=i(26),T=i(51),P=i(135),C=i(82),B=i(49),I=i(13),R=i(31),j=C.f,M=I.f,D=P.f,L=a.Symbol,U=a.JSON,q=U&&U.stringify,W=m("_hidden"),G=m("toPrimitive"),V={}.propertyIsEnumerable,z=h("symbol-registry"),X=h("symbols"),H=h("op-symbols"),Y=Object.prototype,$="function"==typeof L&&!!B.f,K=a.QObject,Q=!K||!K.prototype||!K.prototype.findChild,J=c&&y((function(){return 7!=T(M({},"a",{get:function(){return M(this,"a",{value:7}).a}})).a}))?function(t,r,i){var a=j(Y,r);a&&delete Y[r],M(t,r,i),a&&t!==Y&&M(Y,r,a)}:M,wrap=function(t){var r=X[t]=T(L.prototype);return r._k=t,r},Z=$&&"symbol"==typeof L.iterator?function(t){return"symbol"==typeof t}:function(t){return t instanceof L},ee=function defineProperty(t,r,i){return t===Y&&ee(H,r,i),S(t),r=A(r,!0),S(i),u(X,r)?(i.enumerable?(u(t,W)&&t[W][r]&&(t[W][r]=!1),i=T(i,{enumerable:N(0,!1)})):(u(t,W)||M(t,W,N(1,{})),t[W][r]=!0),J(t,r,i)):M(t,r,i)},te=function defineProperties(t,r){S(t);for(var i,a=w(r=k(r)),u=0,c=a.length;c>u;)ee(t,i=a[u++],r[i]);return t},re=function propertyIsEnumerable(t){var r=V.call(this,t=A(t,!0));return!(this===Y&&u(X,t)&&!u(H,t))&&(!(r||!u(this,t)||!u(X,t)||u(this,W)&&this[W][t])||r)},ne=function getOwnPropertyDescriptor(t,r){if(t=k(t),r=A(r,!0),t!==Y||!u(X,r)||u(H,r)){var i=j(t,r);return!i||!u(X,r)||u(t,W)&&t[W][r]||(i.enumerable=!0),i}},ie=function getOwnPropertyNames(t){for(var r,i=D(k(t)),a=[],c=0;i.length>c;)u(X,r=i[c++])||r==W||r==d||a.push(r);return a},oe=function getOwnPropertySymbols(t){for(var r,i=t===Y,a=D(i?H:k(t)),c=[],l=0;a.length>l;)!u(X,r=a[l++])||i&&!u(Y,r)||c.push(X[r]);return c};$||(p((L=function Symbol(){if(this instanceof L)throw TypeError("Symbol is not a constructor!");var t=v(arguments.length>0?arguments[0]:void 0),$set=function(r){this===Y&&$set.call(H,r),u(this,W)&&u(this[W],t)&&(this[W][t]=!1),J(this,t,N(1,r))};return c&&Q&&J(Y,t,{configurable:!0,set:$set}),wrap(t)}).prototype,"toString",(function toString(){return this._k})),C.f=ne,I.f=ee,i(81).f=P.f=ie,i(34).f=re,B.f=oe,c&&!i(32)&&p(Y,"propertyIsEnumerable",re,!0),b.f=function(t){return wrap(m(t))}),l(l.G+l.W+l.F*!$,{Symbol:L});for(var ae="hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables".split(","),ue=0;ae.length>ue;)m(ae[ue++]);for(var ce=R(m.store),se=0;ce.length>se;)_(ce[se++]);l(l.S+l.F*!$,"Symbol",{for:function(t){return u(z,t+="")?z[t]:z[t]=L(t)},keyFor:function keyFor(t){if(!Z(t))throw TypeError(t+" is not a symbol!");for(var r in z)if(z[r]===t)return r},useSetter:function(){Q=!0},useSimple:function(){Q=!1}}),l(l.S+l.F*!$,"Object",{create:function create(t,r){return void 0===r?T(t):te(T(t),r)},defineProperty:ee,defineProperties:te,getOwnPropertyDescriptor:ne,getOwnPropertyNames:ie,getOwnPropertySymbols:oe});var fe=y((function(){B.f(1)}));l(l.S+l.F*fe,"Object",{getOwnPropertySymbols:function getOwnPropertySymbols(t){return B.f(E(t))}}),U&&l(l.S+l.F*(!$||y((function(){var t=L();return"[null]"!=q([t])||"{}"!=q({a:t})||"{}"!=q(Object(t))}))),"JSON",{stringify:function stringify(t){for(var r,i,a=[t],u=1;arguments.length>u;)a.push(arguments[u++]);if(i=r=a[1],(O(r)||void 0!==t)&&!Z(t))return x(r)||(r=function(t,r){if("function"==typeof i&&(r=i.call(this,t,r)),!Z(r))return r}),a[1]=r,q.apply(U,a)}}),L.prototype[G]||i(19)(L.prototype,G,L.prototype.valueOf),g(L,"Symbol"),g(Math,"Math",!0),g(a.JSON,"JSON",!0)},function(t,r,i){var a=i(33)("meta"),u=i(20),c=i(17),l=i(13).f,p=0,d=Object.isExtensible||function(){return!0},y=!i(21)((function(){return d(Object.preventExtensions({}))})),setMeta=function(t){l(t,a,{value:{i:"O"+ ++p,w:{}}})},h=t.exports={KEY:a,NEED:!1,fastKey:function(t,r){if(!u(t))return"symbol"==typeof t?t:("string"==typeof t?"S":"P")+t;if(!c(t,a)){if(!d(t))return"F";if(!r)return"E";setMeta(t)}return t[a].i},getWeak:function(t,r){if(!c(t,a)){if(!d(t))return!0;if(!r)return!1;setMeta(t)}return t[a].w},onFreeze:function(t){return y&&h.NEED&&d(t)&&!c(t,a)&&setMeta(t),t}}},function(t,r,i){var a=i(31),u=i(49),c=i(34);t.exports=function(t){var r=a(t),i=u.f;if(i)for(var l,p=i(t),d=c.f,y=0;p.length>y;)d.call(t,l=p[y++])&&r.push(l);return r}},function(t,r,i){var a=i(43);t.exports=Array.isArray||function isArray(t){return"Array"==a(t)}},function(t,r,i){var a=i(22),u=i(81).f,c={}.toString,l="object"==typeof window&&window&&Object.getOwnPropertyNames?Object.getOwnPropertyNames(window):[];t.exports.f=function getOwnPropertyNames(t){return l&&"[object Window]"==c.call(t)?function(t){try{return u(t)}catch(t){return l.slice()}}(t):u(a(t))}},function(t,r){},function(t,r,i){i(54)("asyncIterator")},function(t,r,i){i(54)("observable")},function(t,r,i){t.exports={default:i(140),__esModule:!0}},function(t,r,i){i(141),t.exports=i(4).Object.setPrototypeOf},function(t,r,i){var a=i(11);a(a.S,"Object",{setPrototypeOf:i(142).set})},function(t,r,i){var a=i(20),u=i(16),check=function(t,r){if(u(t),!a(r)&&null!==r)throw TypeError(r+": can't set as prototype!")};t.exports={set:Object.setPrototypeOf||("__proto__"in{}?function(t,r,a){try{(a=i(41)(Function.call,i(82).f(Object.prototype,"__proto__").set,2))(t,[]),r=!(t instanceof Array)}catch(t){r=!0}return function setPrototypeOf(t,i){return check(t,i),r?t.__proto__=i:a(t,i),t}}({},!1):void 0),check:check}},function(t,r,i){t.exports={default:i(144),__esModule:!0}},function(t,r,i){i(145);var a=i(4).Object;t.exports=function create(t,r){return a.create(t,r)}},function(t,r,i){var a=i(11);a(a.S,"Object",{create:i(51)})},function(t,r,i){Object.defineProperty(r,"__esModule",{value:!0}),r.CurrencyRatio=r.Currency=void 0;var a=_interopRequireDefault(i(147)),u=_interopRequireDefault(i(151)),c=_interopRequireDefault(i(67)),l=_interopRequireDefault(i(73)),p=_interopRequireDefault(i(76)),d=_interopRequireDefault(i(83)),y=_interopRequireDefault(i(75)),h=_interopRequireDefault(i(159)),g=_interopRequireDefault(i(163));function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}function amountToBigNumber(t){if(t instanceof v||"function"==typeof t.toBigNumber)return t.toBigNumber();var r=(0,g.default)(t);if(r.isNaN())throw new Error('amount "'+t+'" is not a number');return r}var v=r.Currency=function(){function Currency(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;(0,y.default)(this,Currency),"wei"===r&&(r=-18),"ray"===r&&(r=-27),"rad"===r&&(r=-45),this._amount=r?amountToBigNumber(t).shiftedBy(r):amountToBigNumber(t),this.symbol="???"}return(0,h.default)(Currency,[{key:"isEqual",value:function isEqual(t){return this._amount.eq(t._amount)&&this.symbol==t.symbol}},{key:"toString",value:function toString(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:2;return this._amount.toFixed(t)+" "+this.symbol}},{key:"toBigNumber",value:function toBigNumber(){return this._amount}},{key:"toNumber",value:function toNumber(){return this._amount.toNumber()}},{key:"toFixed",value:function toFixed(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:0;return"wei"===t&&(t=18),"ray"===t&&(t=27),"rad"===t&&(t=45),this._amount.shiftedBy(t).integerValue(g.default.ROUND_DOWN).toFixed()}},{key:"isSameType",value:function isSameType(t){return this.symbol===t.symbol}}]),Currency}(),m=r.CurrencyRatio=function(t){function CurrencyRatio(t,r,i,a){(0,y.default)(this,CurrencyRatio);var u=(0,p.default)(this,(CurrencyRatio.__proto__||(0,l.default)(CurrencyRatio)).call(this,t,a));return u.numerator=r,u.denominator=i,u.symbol=r.symbol+"/"+i.symbol,u}return(0,d.default)(CurrencyRatio,t),CurrencyRatio}(v);function bigNumberFnWrapper(t,r){return function(i){!function assertValidOperation(t,r,i){if(!i&&0!==i)throw new Error("Invalid operation: "+r.symbol+" "+t+" with no right operand");if(i instanceof v&&!r.isSameType(i)){if(i instanceof m)switch(t){case"times":if(r.isSameType(i.denominator))return;break;case"div":if(r.isSameType(i.numerator))return}else switch(t){case"div":return}throw new Error("Invalid operation: "+r.symbol+" "+t+" "+i.symbol)}}(t,this,i);var a=i instanceof v?i.toBigNumber():i,u=this.toBigNumber()[t](a);return r?u:function bigNumberFnResult(t,r,i,a){if(i instanceof m)switch(t){case"times":return new i.numerator(a);case"div":return new i.denominator(a)}return i instanceof v&&!r.isSameType(i)?new m(a,r.constructor,i.constructor):r instanceof m?new r.constructor(a,r.numerator,r.denominator,r.shift):new r.constructor(a)}(t,this,i,u)}}(0,c.default)(v.prototype,[["plus","add"],["minus","sub"],["times","multipliedBy","mul"],["div","dividedBy"],["shiftedBy"]].reduce((function(t,r){var i=(0,u.default)(r),c=i[0],l=i.slice(1);t[c]=bigNumberFnWrapper(c);var p=!0,d=!1,y=void 0;try{for(var h,g=(0,a.default)(l);!(p=(h=g.next()).done);p=!0){t[h.value]=t[c]}}catch(t){d=!0,y=t}finally{try{!p&&g.return&&g.return()}finally{if(d)throw y}}return t}),{}),[["isLessThan","lt"],["isLessThanOrEqualTo","lte"],["isGreaterThan","gt"],["isGreaterThanOrEqualTo","gte"],["eq"]].reduce((function(t,r){var i=(0,u.default)(r),c=i[0],l=i.slice(1);t[c]=bigNumberFnWrapper(c,!0);var p=!0,d=!1,y=void 0;try{for(var h,g=(0,a.default)(l);!(p=(h=g.next()).done);p=!0){t[h.value]=t[c]}}catch(t){d=!0,y=t}finally{try{!p&&g.return&&g.return()}finally{if(d)throw y}}return t}),{}))},function(t,r,i){t.exports={default:i(148),__esModule:!0}},function(t,r,i){i(80),i(50),t.exports=i(149)},function(t,r,i){var a=i(16),u=i(84);t.exports=i(4).getIterator=function(t){var r=u(t);if("function"!=typeof r)throw TypeError(t+" is not iterable!");return a(r.call(t))}},function(t,r,i){var a=i(43),u=i(7)("toStringTag"),c="Arguments"==a(function(){return arguments}());t.exports=function(t){var r,i,l;return void 0===t?"Undefined":null===t?"Null":"string"==typeof(i=function(t,r){try{return t[r]}catch(t){}}(r=Object(t),u))?i:c?a(r):"Object"==(l=a(r))&&"function"==typeof r.callee?"Arguments":l}},function(t,r,i){r.__esModule=!0;var a=function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}(i(152));r.default=function(t){return Array.isArray(t)?t:(0,a.default)(t)}},function(t,r,i){t.exports={default:i(153),__esModule:!0}},function(t,r,i){i(50),i(154),t.exports=i(4).Array.from},function(t,r,i){var a=i(41),u=i(11),c=i(27),l=i(155),p=i(156),d=i(72),y=i(157),h=i(84);u(u.S+u.F*!i(158)((function(t){Array.from(t)})),"Array",{from:function from(t){var r,i,u,g,v=c(t),m="function"==typeof this?this:Array,b=arguments.length,_=b>1?arguments[1]:void 0,w=void 0!==_,x=0,S=h(v);if(w&&(_=a(_,b>2?arguments[2]:void 0,2)),null==S||m==Array&&p(S))for(i=new m(r=d(v.length));r>x;x++)y(i,x,w?_(v[x],x):v[x]);else for(g=S.call(v),i=new m;!(u=g.next()).done;x++)y(i,x,w?l(g,_,[u.value,x],!0):u.value);return i.length=x,i}})},function(t,r,i){var a=i(16);t.exports=function(t,r,i,u){try{return u?r(a(i)[0],i[1]):r(i)}catch(r){var c=t.return;throw void 0!==c&&a(c.call(t)),r}}},function(t,r,i){var a=i(28),u=i(7)("iterator"),c=Array.prototype;t.exports=function(t){return void 0!==t&&(a.Array===t||c[u]===t)}},function(t,r,i){var a=i(13),u=i(26);t.exports=function(t,r,i){r in t?a.f(t,r,u(0,i)):t[r]=i}},function(t,r,i){var a=i(7)("iterator"),u=!1;try{var c=[7][a]();c.return=function(){u=!0},Array.from(c,(function(){throw 2}))}catch(t){}t.exports=function(t,r){if(!r&&!u)return!1;var i=!1;try{var c=[7],l=c[a]();l.next=function(){return{done:i=!0}},c[a]=function(){return l},t(c)}catch(t){}return i}},function(t,r,i){r.__esModule=!0;var a=function _interopRequireDefault(t){return t&&t.__esModule?t:{default:t}}(i(160));r.default=function(){function defineProperties(t,r){for(var i=0;i<r.length;i++){var u=r[i];u.enumerable=u.enumerable||!1,u.configurable=!0,"value"in u&&(u.writable=!0),(0,a.default)(t,u.key,u)}}return function(t,r,i){return r&&defineProperties(t.prototype,r),i&&defineProperties(t,i),t}}()},function(t,r,i){t.exports={default:i(161),__esModule:!0}},function(t,r,i){i(162);var a=i(4).Object;t.exports=function defineProperty(t,r,i){return a.defineProperty(t,r,i)}},function(t,r,i){var a=i(11);a(a.S+a.F*!i(14),"Object",{defineProperty:i(13).f})},function(t,r,i){var a;!function(u){var c,l=/^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i,p="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator,d=Math.ceil,y=Math.floor,h="[BigNumber Error] ",g=h+"Number primitive has more than 15 significant digits: ",v=1e14,m=[1,10,100,1e3,1e4,1e5,1e6,1e7,1e8,1e9,1e10,1e11,1e12,1e13],b=1e9;function bitFloor(t){var r=0|t;return t>0||t===r?r:r-1}function coeffToString(t){for(var r,i,a=1,u=t.length,c=t[0]+"";a<u;){for(i=14-(r=t[a++]+"").length;i--;r="0"+r);c+=r}for(u=c.length;48===c.charCodeAt(--u););return c.slice(0,u+1||1)}function compare(t,r){var i,a,u=t.c,c=r.c,l=t.s,p=r.s,d=t.e,y=r.e;if(!l||!p)return null;if(i=u&&!u[0],a=c&&!c[0],i||a)return i?a?0:-p:l;if(l!=p)return l;if(i=l<0,a=d==y,!u||!c)return a?0:!u^i?1:-1;if(!a)return d>y^i?1:-1;for(p=(d=u.length)<(y=c.length)?d:y,l=0;l<p;l++)if(u[l]!=c[l])return u[l]>c[l]^i?1:-1;return d==y?0:d>y^i?1:-1}function intCheck(t,r,i,a){if(t<r||t>i||t!==y(t))throw Error(h+(a||"Argument")+("number"==typeof t?t<r||t>i?" out of range: ":" not an integer: ":" not a primitive number: ")+String(t))}function isOdd(t){var r=t.c.length-1;return bitFloor(t.e/14)==r&&t.c[r]%2!=0}function toExponential(t,r){return(t.length>1?t.charAt(0)+"."+t.slice(1):t)+(r<0?"e":"e+")+r}function toFixedPoint(t,r,i){var a,u;if(r<0){for(u=i+".";++r;u+=i);t=u+t}else if(++r>(a=t.length)){for(u=i,r-=a;--r;u+=i);t+=u}else r<a&&(t=t.slice(0,r)+"."+t.slice(r));return t}(c=function clone(t){var r,i,a,u,c,_,w,x,S,O=BigNumber.prototype={constructor:BigNumber,toString:null,valueOf:null},E=new BigNumber(1),k=20,A=4,N=-7,T=21,P=-1e7,C=1e7,B=!1,I=1,R=0,j={prefix:"",groupSize:3,secondaryGroupSize:0,groupSeparator:",",decimalSeparator:".",fractionGroupSize:0,fractionGroupSeparator:" ",suffix:""},M="0123456789abcdefghijklmnopqrstuvwxyz";function BigNumber(t,r){var u,c,p,d,h,v,m,b,_=this;if(!(_ instanceof BigNumber))return new BigNumber(t,r);if(null==r){if(t&&!0===t._isBigNumber)return _.s=t.s,void(!t.c||t.e>C?_.c=_.e=null:t.e<P?_.c=[_.e=0]:(_.e=t.e,_.c=t.c.slice()));if((v="number"==typeof t)&&0*t==0){if(_.s=1/t<0?(t=-t,-1):1,t===~~t){for(d=0,h=t;h>=10;h/=10,d++);return void(d>C?_.c=_.e=null:(_.e=d,_.c=[t]))}b=String(t)}else{if(!l.test(b=String(t)))return a(_,b,v);_.s=45==b.charCodeAt(0)?(b=b.slice(1),-1):1}(d=b.indexOf("."))>-1&&(b=b.replace(".","")),(h=b.search(/e/i))>0?(d<0&&(d=h),d+=+b.slice(h+1),b=b.substring(0,h)):d<0&&(d=b.length)}else{if(intCheck(r,2,M.length,"Base"),10==r)return round(_=new BigNumber(t),k+_.e+1,A);if(b=String(t),v="number"==typeof t){if(0*t!=0)return a(_,b,v,r);if(_.s=1/t<0?(b=b.slice(1),-1):1,BigNumber.DEBUG&&b.replace(/^0\.0*|\./,"").length>15)throw Error(g+t)}else _.s=45===b.charCodeAt(0)?(b=b.slice(1),-1):1;for(u=M.slice(0,r),d=h=0,m=b.length;h<m;h++)if(u.indexOf(c=b.charAt(h))<0){if("."==c){if(h>d){d=m;continue}}else if(!p&&(b==b.toUpperCase()&&(b=b.toLowerCase())||b==b.toLowerCase()&&(b=b.toUpperCase()))){p=!0,h=-1,d=0;continue}return a(_,String(t),v,r)}v=!1,(d=(b=i(b,r,10,_.s)).indexOf("."))>-1?b=b.replace(".",""):d=b.length}for(h=0;48===b.charCodeAt(h);h++);for(m=b.length;48===b.charCodeAt(--m););if(b=b.slice(h,++m)){if(m-=h,v&&BigNumber.DEBUG&&m>15&&(t>9007199254740991||t!==y(t)))throw Error(g+_.s*t);if((d=d-h-1)>C)_.c=_.e=null;else if(d<P)_.c=[_.e=0];else{if(_.e=d,_.c=[],h=(d+1)%14,d<0&&(h+=14),h<m){for(h&&_.c.push(+b.slice(0,h)),m-=14;h<m;)_.c.push(+b.slice(h,h+=14));h=14-(b=b.slice(h)).length}else h-=m;for(;h--;b+="0");_.c.push(+b)}}else _.c=[_.e=0]}function format(t,r,i,a){var u,c,l,p,d;if(null==i?i=A:intCheck(i,0,8),!t.c)return t.toString();if(u=t.c[0],l=t.e,null==r)d=coeffToString(t.c),d=1==a||2==a&&(l<=N||l>=T)?toExponential(d,l):toFixedPoint(d,l,"0");else if(c=(t=round(new BigNumber(t),r,i)).e,p=(d=coeffToString(t.c)).length,1==a||2==a&&(r<=c||c<=N)){for(;p<r;d+="0",p++);d=toExponential(d,c)}else if(r-=l,d=toFixedPoint(d,c,"0"),c+1>p){if(--r>0)for(d+=".";r--;d+="0");}else if((r+=c-p)>0)for(c+1==p&&(d+=".");r--;d+="0");return t.s<0&&u?"-"+d:d}function maxOrMin(t,r){for(var i,a=1,u=new BigNumber(t[0]);a<t.length;a++){if(!(i=new BigNumber(t[a])).s){u=i;break}r.call(u,i)&&(u=i)}return u}function normalise(t,r,i){for(var a=1,u=r.length;!r[--u];r.pop());for(u=r[0];u>=10;u/=10,a++);return(i=a+14*i-1)>C?t.c=t.e=null:i<P?t.c=[t.e=0]:(t.e=i,t.c=r),t}function round(t,r,i,a){var u,c,l,p,h,g,b,_=t.c,w=m;if(_){e:{for(u=1,p=_[0];p>=10;p/=10,u++);if((c=r-u)<0)c+=14,l=r,b=(h=_[g=0])/w[u-l-1]%10|0;else if((g=d((c+1)/14))>=_.length){if(!a)break e;for(;_.length<=g;_.push(0));h=b=0,u=1,l=(c%=14)-14+1}else{for(h=p=_[g],u=1;p>=10;p/=10,u++);b=(l=(c%=14)-14+u)<0?0:h/w[u-l-1]%10|0}if(a=a||r<0||null!=_[g+1]||(l<0?h:h%w[u-l-1]),a=i<4?(b||a)&&(0==i||i==(t.s<0?3:2)):b>5||5==b&&(4==i||a||6==i&&(c>0?l>0?h/w[u-l]:0:_[g-1])%10&1||i==(t.s<0?8:7)),r<1||!_[0])return _.length=0,a?(r-=t.e+1,_[0]=w[(14-r%14)%14],t.e=-r||0):_[0]=t.e=0,t;if(0==c?(_.length=g,p=1,g--):(_.length=g+1,p=w[14-c],_[g]=l>0?y(h/w[u-l]%w[l])*p:0),a)for(;;){if(0==g){for(c=1,l=_[0];l>=10;l/=10,c++);for(l=_[0]+=p,p=1;l>=10;l/=10,p++);c!=p&&(t.e++,_[0]==v&&(_[0]=1));break}if(_[g]+=p,_[g]!=v)break;_[g--]=0,p=1}for(c=_.length;0===_[--c];_.pop());}t.e>C?t.c=t.e=null:t.e<P&&(t.c=[t.e=0])}return t}function valueOf(t){var r,i=t.e;return null===i?t.toString():(r=coeffToString(t.c),r=i<=N||i>=T?toExponential(r,i):toFixedPoint(r,i,"0"),t.s<0?"-"+r:r)}return BigNumber.clone=clone,BigNumber.ROUND_UP=0,BigNumber.ROUND_DOWN=1,BigNumber.ROUND_CEIL=2,BigNumber.ROUND_FLOOR=3,BigNumber.ROUND_HALF_UP=4,BigNumber.ROUND_HALF_DOWN=5,BigNumber.ROUND_HALF_EVEN=6,BigNumber.ROUND_HALF_CEIL=7,BigNumber.ROUND_HALF_FLOOR=8,BigNumber.EUCLID=9,BigNumber.config=BigNumber.set=function(t){var r,i;if(null!=t){if("object"!=typeof t)throw Error(h+"Object expected: "+t);if(t.hasOwnProperty(r="DECIMAL_PLACES")&&(intCheck(i=t[r],0,b,r),k=i),t.hasOwnProperty(r="ROUNDING_MODE")&&(intCheck(i=t[r],0,8,r),A=i),t.hasOwnProperty(r="EXPONENTIAL_AT")&&((i=t[r])&&i.pop?(intCheck(i[0],-b,0,r),intCheck(i[1],0,b,r),N=i[0],T=i[1]):(intCheck(i,-b,b,r),N=-(T=i<0?-i:i))),t.hasOwnProperty(r="RANGE"))if((i=t[r])&&i.pop)intCheck(i[0],-b,-1,r),intCheck(i[1],1,b,r),P=i[0],C=i[1];else{if(intCheck(i,-b,b,r),!i)throw Error(h+r+" cannot be zero: "+i);P=-(C=i<0?-i:i)}if(t.hasOwnProperty(r="CRYPTO")){if((i=t[r])!==!!i)throw Error(h+r+" not true or false: "+i);if(i){if("undefined"==typeof crypto||!crypto||!crypto.getRandomValues&&!crypto.randomBytes)throw B=!i,Error(h+"crypto unavailable");B=i}else B=i}if(t.hasOwnProperty(r="MODULO_MODE")&&(intCheck(i=t[r],0,9,r),I=i),t.hasOwnProperty(r="POW_PRECISION")&&(intCheck(i=t[r],0,b,r),R=i),t.hasOwnProperty(r="FORMAT")){if("object"!=typeof(i=t[r]))throw Error(h+r+" not an object: "+i);j=i}if(t.hasOwnProperty(r="ALPHABET")){if("string"!=typeof(i=t[r])||/^.$|[+-.\s]|(.).*\1/.test(i))throw Error(h+r+" invalid: "+i);M=i}}return{DECIMAL_PLACES:k,ROUNDING_MODE:A,EXPONENTIAL_AT:[N,T],RANGE:[P,C],CRYPTO:B,MODULO_MODE:I,POW_PRECISION:R,FORMAT:j,ALPHABET:M}},BigNumber.isBigNumber=function(t){if(!t||!0!==t._isBigNumber)return!1;if(!BigNumber.DEBUG)return!0;var r,i,a=t.c,u=t.e,c=t.s;e:if("[object Array]"=={}.toString.call(a)){if((1===c||-1===c)&&u>=-b&&u<=b&&u===y(u)){if(0===a[0]){if(0===u&&1===a.length)return!0;break e}if((r=(u+1)%14)<1&&(r+=14),String(a[0]).length==r){for(r=0;r<a.length;r++)if((i=a[r])<0||i>=v||i!==y(i))break e;if(0!==i)return!0}}}else if(null===a&&null===u&&(null===c||1===c||-1===c))return!0;throw Error(h+"Invalid BigNumber: "+t)},BigNumber.maximum=BigNumber.max=function(){return maxOrMin(arguments,O.lt)},BigNumber.minimum=BigNumber.min=function(){return maxOrMin(arguments,O.gt)},BigNumber.random=(u=9007199254740992*Math.random()&2097151?function(){return y(9007199254740992*Math.random())}:function(){return 8388608*(1073741824*Math.random()|0)+(8388608*Math.random()|0)},function(t){var r,i,a,c,l,p=0,g=[],v=new BigNumber(E);if(null==t?t=k:intCheck(t,0,b),c=d(t/14),B)if(crypto.getRandomValues){for(r=crypto.getRandomValues(new Uint32Array(c*=2));p<c;)(l=131072*r[p]+(r[p+1]>>>11))>=9e15?(i=crypto.getRandomValues(new Uint32Array(2)),r[p]=i[0],r[p+1]=i[1]):(g.push(l%1e14),p+=2);p=c/2}else{if(!crypto.randomBytes)throw B=!1,Error(h+"crypto unavailable");for(r=crypto.randomBytes(c*=7);p<c;)(l=281474976710656*(31&r[p])+1099511627776*r[p+1]+4294967296*r[p+2]+16777216*r[p+3]+(r[p+4]<<16)+(r[p+5]<<8)+r[p+6])>=9e15?crypto.randomBytes(7).copy(r,p):(g.push(l%1e14),p+=7);p=c/7}if(!B)for(;p<c;)(l=u())<9e15&&(g[p++]=l%1e14);for(t%=14,(c=g[--p])&&t&&(l=m[14-t],g[p]=y(c/l)*l);0===g[p];g.pop(),p--);if(p<0)g=[a=0];else{for(a=-1;0===g[0];g.splice(0,1),a-=14);for(p=1,l=g[0];l>=10;l/=10,p++);p<14&&(a-=14-p)}return v.e=a,v.c=g,v}),BigNumber.sum=function(){for(var t=1,r=arguments,i=new BigNumber(r[0]);t<r.length;)i=i.plus(r[t++]);return i},i=function(){function toBaseOut(t,r,i,a){for(var u,c,l=[0],p=0,d=t.length;p<d;){for(c=l.length;c--;l[c]*=r);for(l[0]+=a.indexOf(t.charAt(p++)),u=0;u<l.length;u++)l[u]>i-1&&(null==l[u+1]&&(l[u+1]=0),l[u+1]+=l[u]/i|0,l[u]%=i)}return l.reverse()}return function(t,i,a,u,c){var l,p,d,y,h,g,v,m,b=t.indexOf("."),_=k,w=A;for(b>=0&&(y=R,R=0,t=t.replace(".",""),g=(m=new BigNumber(i)).pow(t.length-b),R=y,m.c=toBaseOut(toFixedPoint(coeffToString(g.c),g.e,"0"),10,a,"0123456789"),m.e=m.c.length),d=y=(v=toBaseOut(t,i,a,c?(l=M,"0123456789"):(l="0123456789",M))).length;0==v[--y];v.pop());if(!v[0])return l.charAt(0);if(b<0?--d:(g.c=v,g.e=d,g.s=u,v=(g=r(g,m,_,w,a)).c,h=g.r,d=g.e),b=v[p=d+_+1],y=a/2,h=h||p<0||null!=v[p+1],h=w<4?(null!=b||h)&&(0==w||w==(g.s<0?3:2)):b>y||b==y&&(4==w||h||6==w&&1&v[p-1]||w==(g.s<0?8:7)),p<1||!v[0])t=h?toFixedPoint(l.charAt(1),-_,l.charAt(0)):l.charAt(0);else{if(v.length=p,h)for(--a;++v[--p]>a;)v[p]=0,p||(++d,v=[1].concat(v));for(y=v.length;!v[--y];);for(b=0,t="";b<=y;t+=l.charAt(v[b++]));t=toFixedPoint(t,d,l.charAt(0))}return t}}(),r=function(){function multiply(t,r,i){var a,u,c,l,p=0,d=t.length,y=r%1e7,h=r/1e7|0;for(t=t.slice();d--;)p=((u=y*(c=t[d]%1e7)+(a=h*c+(l=t[d]/1e7|0)*y)%1e7*1e7+p)/i|0)+(a/1e7|0)+h*l,t[d]=u%i;return p&&(t=[p].concat(t)),t}function compare(t,r,i,a){var u,c;if(i!=a)c=i>a?1:-1;else for(u=c=0;u<i;u++)if(t[u]!=r[u]){c=t[u]>r[u]?1:-1;break}return c}function subtract(t,r,i,a){for(var u=0;i--;)t[i]-=u,u=t[i]<r[i]?1:0,t[i]=u*a+t[i]-r[i];for(;!t[0]&&t.length>1;t.splice(0,1));}return function(t,r,i,a,u){var c,l,p,d,h,g,m,b,_,w,x,S,O,E,k,A,N,T=t.s==r.s?1:-1,P=t.c,C=r.c;if(!(P&&P[0]&&C&&C[0]))return new BigNumber(t.s&&r.s&&(P?!C||P[0]!=C[0]:C)?P&&0==P[0]||!C?0*T:T/0:NaN);for(_=(b=new BigNumber(T)).c=[],T=i+(l=t.e-r.e)+1,u||(u=v,l=bitFloor(t.e/14)-bitFloor(r.e/14),T=T/14|0),p=0;C[p]==(P[p]||0);p++);if(C[p]>(P[p]||0)&&l--,T<0)_.push(1),d=!0;else{for(E=P.length,A=C.length,p=0,T+=2,(h=y(u/(C[0]+1)))>1&&(C=multiply(C,h,u),P=multiply(P,h,u),A=C.length,E=P.length),O=A,x=(w=P.slice(0,A)).length;x<A;w[x++]=0);N=C.slice(),N=[0].concat(N),k=C[0],C[1]>=u/2&&k++;do{if(h=0,(c=compare(C,w,A,x))<0){if(S=w[0],A!=x&&(S=S*u+(w[1]||0)),(h=y(S/k))>1)for(h>=u&&(h=u-1),m=(g=multiply(C,h,u)).length,x=w.length;1==compare(g,w,m,x);)h--,subtract(g,A<m?N:C,m,u),m=g.length,c=1;else 0==h&&(c=h=1),m=(g=C.slice()).length;if(m<x&&(g=[0].concat(g)),subtract(w,g,x,u),x=w.length,-1==c)for(;compare(C,w,A,x)<1;)h++,subtract(w,A<x?N:C,x,u),x=w.length}else 0===c&&(h++,w=[0]);_[p++]=h,w[0]?w[x++]=P[O]||0:(w=[P[O]],x=1)}while((O++<E||null!=w[0])&&T--);d=null!=w[0],_[0]||_.splice(0,1)}if(u==v){for(p=1,T=_[0];T>=10;T/=10,p++);round(b,i+(b.e=p+14*l-1)+1,a,d)}else b.e=l,b.r=+d;return b}}(),c=/^(-?)0([xbo])(?=\w[\w.]*$)/i,_=/^([^.]+)\.$/,w=/^\.([^.]+)$/,x=/^-?(Infinity|NaN)$/,S=/^\s*\+(?=[\w.])|^\s+|\s+$/g,a=function(t,r,i,a){var u,l=i?r:r.replace(S,"");if(x.test(l))t.s=isNaN(l)?null:l<0?-1:1;else{if(!i&&(l=l.replace(c,(function(t,r,i){return u="x"==(i=i.toLowerCase())?16:"b"==i?2:8,a&&a!=u?t:r})),a&&(u=a,l=l.replace(_,"$1").replace(w,"0.$1")),r!=l))return new BigNumber(l,u);if(BigNumber.DEBUG)throw Error(h+"Not a"+(a?" base "+a:"")+" number: "+r);t.s=null}t.c=t.e=null},O.absoluteValue=O.abs=function(){var t=new BigNumber(this);return t.s<0&&(t.s=1),t},O.comparedTo=function(t,r){return compare(this,new BigNumber(t,r))},O.decimalPlaces=O.dp=function(t,r){var i,a,u,c=this;if(null!=t)return intCheck(t,0,b),null==r?r=A:intCheck(r,0,8),round(new BigNumber(c),t+c.e+1,r);if(!(i=c.c))return null;if(a=14*((u=i.length-1)-bitFloor(this.e/14)),u=i[u])for(;u%10==0;u/=10,a--);return a<0&&(a=0),a},O.dividedBy=O.div=function(t,i){return r(this,new BigNumber(t,i),k,A)},O.dividedToIntegerBy=O.idiv=function(t,i){return r(this,new BigNumber(t,i),0,1)},O.exponentiatedBy=O.pow=function(t,r){var i,a,u,c,l,p,g,v,m=this;if((t=new BigNumber(t)).c&&!t.isInteger())throw Error(h+"Exponent not an integer: "+valueOf(t));if(null!=r&&(r=new BigNumber(r)),l=t.e>14,!m.c||!m.c[0]||1==m.c[0]&&!m.e&&1==m.c.length||!t.c||!t.c[0])return v=new BigNumber(Math.pow(+valueOf(m),l?2-isOdd(t):+valueOf(t))),r?v.mod(r):v;if(p=t.s<0,r){if(r.c?!r.c[0]:!r.s)return new BigNumber(NaN);(a=!p&&m.isInteger()&&r.isInteger())&&(m=m.mod(r))}else{if(t.e>9&&(m.e>0||m.e<-1||(0==m.e?m.c[0]>1||l&&m.c[1]>=24e7:m.c[0]<8e13||l&&m.c[0]<=9999975e7)))return c=m.s<0&&isOdd(t)?-0:0,m.e>-1&&(c=1/c),new BigNumber(p?1/c:c);R&&(c=d(R/14+2))}for(l?(i=new BigNumber(.5),p&&(t.s=1),g=isOdd(t)):g=(u=Math.abs(+valueOf(t)))%2,v=new BigNumber(E);;){if(g){if(!(v=v.times(m)).c)break;c?v.c.length>c&&(v.c.length=c):a&&(v=v.mod(r))}if(u){if(0===(u=y(u/2)))break;g=u%2}else if(round(t=t.times(i),t.e+1,1),t.e>14)g=isOdd(t);else{if(0===(u=+valueOf(t)))break;g=u%2}m=m.times(m),c?m.c&&m.c.length>c&&(m.c.length=c):a&&(m=m.mod(r))}return a?v:(p&&(v=E.div(v)),r?v.mod(r):c?round(v,R,A,void 0):v)},O.integerValue=function(t){var r=new BigNumber(this);return null==t?t=A:intCheck(t,0,8),round(r,r.e+1,t)},O.isEqualTo=O.eq=function(t,r){return 0===compare(this,new BigNumber(t,r))},O.isFinite=function(){return!!this.c},O.isGreaterThan=O.gt=function(t,r){return compare(this,new BigNumber(t,r))>0},O.isGreaterThanOrEqualTo=O.gte=function(t,r){return 1===(r=compare(this,new BigNumber(t,r)))||0===r},O.isInteger=function(){return!!this.c&&bitFloor(this.e/14)>this.c.length-2},O.isLessThan=O.lt=function(t,r){return compare(this,new BigNumber(t,r))<0},O.isLessThanOrEqualTo=O.lte=function(t,r){return-1===(r=compare(this,new BigNumber(t,r)))||0===r},O.isNaN=function(){return!this.s},O.isNegative=function(){return this.s<0},O.isPositive=function(){return this.s>0},O.isZero=function(){return!!this.c&&0==this.c[0]},O.minus=function(t,r){var i,a,u,c,l=this,p=l.s;if(r=(t=new BigNumber(t,r)).s,!p||!r)return new BigNumber(NaN);if(p!=r)return t.s=-r,l.plus(t);var d=l.e/14,y=t.e/14,h=l.c,g=t.c;if(!d||!y){if(!h||!g)return h?(t.s=-r,t):new BigNumber(g?l:NaN);if(!h[0]||!g[0])return g[0]?(t.s=-r,t):new BigNumber(h[0]?l:3==A?-0:0)}if(d=bitFloor(d),y=bitFloor(y),h=h.slice(),p=d-y){for((c=p<0)?(p=-p,u=h):(y=d,u=g),u.reverse(),r=p;r--;u.push(0));u.reverse()}else for(a=(c=(p=h.length)<(r=g.length))?p:r,p=r=0;r<a;r++)if(h[r]!=g[r]){c=h[r]<g[r];break}if(c&&(u=h,h=g,g=u,t.s=-t.s),(r=(a=g.length)-(i=h.length))>0)for(;r--;h[i++]=0);for(r=v-1;a>p;){if(h[--a]<g[a]){for(i=a;i&&!h[--i];h[i]=r);--h[i],h[a]+=v}h[a]-=g[a]}for(;0==h[0];h.splice(0,1),--y);return h[0]?normalise(t,h,y):(t.s=3==A?-1:1,t.c=[t.e=0],t)},O.modulo=O.mod=function(t,i){var a,u,c=this;return t=new BigNumber(t,i),!c.c||!t.s||t.c&&!t.c[0]?new BigNumber(NaN):!t.c||c.c&&!c.c[0]?new BigNumber(c):(9==I?(u=t.s,t.s=1,a=r(c,t,0,3),t.s=u,a.s*=u):a=r(c,t,0,I),(t=c.minus(a.times(t))).c[0]||1!=I||(t.s=c.s),t)},O.multipliedBy=O.times=function(t,r){var i,a,u,c,l,p,d,y,h,g,m,b,_,w,x=this,S=x.c,O=(t=new BigNumber(t,r)).c;if(!(S&&O&&S[0]&&O[0]))return!x.s||!t.s||S&&!S[0]&&!O||O&&!O[0]&&!S?t.c=t.e=t.s=null:(t.s*=x.s,S&&O?(t.c=[0],t.e=0):t.c=t.e=null),t;for(a=bitFloor(x.e/14)+bitFloor(t.e/14),t.s*=x.s,(d=S.length)<(g=O.length)&&(_=S,S=O,O=_,u=d,d=g,g=u),u=d+g,_=[];u--;_.push(0));for(w=v,1e7,u=g;--u>=0;){for(i=0,m=O[u]%1e7,b=O[u]/1e7|0,c=u+(l=d);c>u;)i=((y=m*(y=S[--l]%1e7)+(p=b*y+(h=S[l]/1e7|0)*m)%1e7*1e7+_[c]+i)/w|0)+(p/1e7|0)+b*h,_[c--]=y%w;_[c]=i}return i?++a:_.splice(0,1),normalise(t,_,a)},O.negated=function(){var t=new BigNumber(this);return t.s=-t.s||null,t},O.plus=function(t,r){var i,a=this,u=a.s;if(r=(t=new BigNumber(t,r)).s,!u||!r)return new BigNumber(NaN);if(u!=r)return t.s=-r,a.minus(t);var c=a.e/14,l=t.e/14,p=a.c,d=t.c;if(!c||!l){if(!p||!d)return new BigNumber(u/0);if(!p[0]||!d[0])return d[0]?t:new BigNumber(p[0]?a:0*u)}if(c=bitFloor(c),l=bitFloor(l),p=p.slice(),u=c-l){for(u>0?(l=c,i=d):(u=-u,i=p),i.reverse();u--;i.push(0));i.reverse()}for((u=p.length)-(r=d.length)<0&&(i=d,d=p,p=i,r=u),u=0;r;)u=(p[--r]=p[r]+d[r]+u)/v|0,p[r]=v===p[r]?0:p[r]%v;return u&&(p=[u].concat(p),++l),normalise(t,p,l)},O.precision=O.sd=function(t,r){var i,a,u,c=this;if(null!=t&&t!==!!t)return intCheck(t,1,b),null==r?r=A:intCheck(r,0,8),round(new BigNumber(c),t,r);if(!(i=c.c))return null;if(a=14*(u=i.length-1)+1,u=i[u]){for(;u%10==0;u/=10,a--);for(u=i[0];u>=10;u/=10,a++);}return t&&c.e+1>a&&(a=c.e+1),a},O.shiftedBy=function(t){return intCheck(t,-9007199254740991,9007199254740991),this.times("1e"+t)},O.squareRoot=O.sqrt=function(){var t,i,a,u,c,l=this,p=l.c,d=l.s,y=l.e,h=k+4,g=new BigNumber("0.5");if(1!==d||!p||!p[0])return new BigNumber(!d||d<0&&(!p||p[0])?NaN:p?l:1/0);if(0==(d=Math.sqrt(+valueOf(l)))||d==1/0?(((i=coeffToString(p)).length+y)%2==0&&(i+="0"),d=Math.sqrt(+i),y=bitFloor((y+1)/2)-(y<0||y%2),a=new BigNumber(i=d==1/0?"1e"+y:(i=d.toExponential()).slice(0,i.indexOf("e")+1)+y)):a=new BigNumber(d+""),a.c[0])for((d=(y=a.e)+h)<3&&(d=0);;)if(c=a,a=g.times(c.plus(r(l,c,h,1))),coeffToString(c.c).slice(0,d)===(i=coeffToString(a.c)).slice(0,d)){if(a.e<y&&--d,"9999"!=(i=i.slice(d-3,d+1))&&(u||"4999"!=i)){+i&&(+i.slice(1)||"5"!=i.charAt(0))||(round(a,a.e+k+2,1),t=!a.times(a).eq(l));break}if(!u&&(round(c,c.e+k+2,0),c.times(c).eq(l))){a=c;break}h+=4,d+=4,u=1}return round(a,a.e+k+1,A,t)},O.toExponential=function(t,r){return null!=t&&(intCheck(t,0,b),t++),format(this,t,r,1)},O.toFixed=function(t,r){return null!=t&&(intCheck(t,0,b),t=t+this.e+1),format(this,t,r)},O.toFormat=function(t,r,i){var a,u=this;if(null==i)null!=t&&r&&"object"==typeof r?(i=r,r=null):t&&"object"==typeof t?(i=t,t=r=null):i=j;else if("object"!=typeof i)throw Error(h+"Argument not an object: "+i);if(a=u.toFixed(t,r),u.c){var c,l=a.split("."),p=+i.groupSize,d=+i.secondaryGroupSize,y=i.groupSeparator||"",g=l[0],v=l[1],m=u.s<0,b=m?g.slice(1):g,_=b.length;if(d&&(c=p,p=d,d=c,_-=c),p>0&&_>0){for(c=_%p||p,g=b.substr(0,c);c<_;c+=p)g+=y+b.substr(c,p);d>0&&(g+=y+b.slice(c)),m&&(g="-"+g)}a=v?g+(i.decimalSeparator||"")+((d=+i.fractionGroupSize)?v.replace(new RegExp("\\d{"+d+"}\\B","g"),"$&"+(i.fractionGroupSeparator||"")):v):g}return(i.prefix||"")+a+(i.suffix||"")},O.toFraction=function(t){var i,a,u,c,l,p,d,y,g,v,b,_,w=this,x=w.c;if(null!=t&&(!(d=new BigNumber(t)).isInteger()&&(d.c||1!==d.s)||d.lt(E)))throw Error(h+"Argument "+(d.isInteger()?"out of range: ":"not an integer: ")+valueOf(d));if(!x)return new BigNumber(w);for(i=new BigNumber(E),g=a=new BigNumber(E),u=y=new BigNumber(E),_=coeffToString(x),l=i.e=_.length-w.e-1,i.c[0]=m[(p=l%14)<0?14+p:p],t=!t||d.comparedTo(i)>0?l>0?i:g:d,p=C,C=1/0,d=new BigNumber(_),y.c[0]=0;v=r(d,i,0,1),1!=(c=a.plus(v.times(u))).comparedTo(t);)a=u,u=c,g=y.plus(v.times(c=g)),y=c,i=d.minus(v.times(c=i)),d=c;return c=r(t.minus(a),u,0,1),y=y.plus(c.times(g)),a=a.plus(c.times(u)),y.s=g.s=w.s,b=r(g,u,l*=2,A).minus(w).abs().comparedTo(r(y,a,l,A).minus(w).abs())<1?[g,u]:[y,a],C=p,b},O.toNumber=function(){return+valueOf(this)},O.toPrecision=function(t,r){return null!=t&&intCheck(t,1,b),format(this,t,r,2)},O.toString=function(t){var r,a=this,u=a.s,c=a.e;return null===c?u?(r="Infinity",u<0&&(r="-"+r)):r="NaN":(null==t?r=c<=N||c>=T?toExponential(coeffToString(a.c),c):toFixedPoint(coeffToString(a.c),c,"0"):10===t?r=toFixedPoint(coeffToString((a=round(new BigNumber(a),k+c+1,A)).c),a.e,"0"):(intCheck(t,2,M.length,"Base"),r=i(toFixedPoint(coeffToString(a.c),c,"0"),10,t,u,!0)),u<0&&a.c[0]&&(r="-"+r)),r},O.valueOf=O.toJSON=function(){return valueOf(this)},O._isBigNumber=!0,p&&(O[Symbol.toStringTag]="BigNumber",O[Symbol.for("nodejs.util.inspect.custom")]=O.valueOf),null!=t&&BigNumber.set(t),BigNumber}()).default=c.BigNumber=c,void 0===(a=function(){return c}.call(r,i,r,t))||(t.exports=a)}()},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(23)),c=a(i(8)),l=a(i(9)),p=a(i(1)),d=a(i(2)),y=a(i(87)),h=a(i(5)),g=a(i(6)),v=a(i(3)),m=a(i(25)),b=i(18),_=i(10),w=i(24),x=i(108);function _createForOfIteratorHelper(t){if("undefined"==typeof Symbol||null==t[Symbol.iterator]){if(Array.isArray(t)||(t=function _unsupportedIterableToArray(t,r){if(!t)return;if("string"==typeof t)return _arrayLikeToArray(t,r);var i=Object.prototype.toString.call(t).slice(8,-1);"Object"===i&&t.constructor&&(i=t.constructor.name);if("Map"===i||"Set"===i)return Array.from(t);if("Arguments"===i||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(i))return _arrayLikeToArray(t,r)}(t))){var r=0,i=function F(){};return{s:i,n:function n(){return r>=t.length?{done:!0}:{done:!1,value:t[r++]}},e:function e(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,u,c=!0,l=!1;return{s:function s(){a=t[Symbol.iterator]()},n:function n(){var t=a.next();return c=t.done,t},e:function e(t){l=!0,u=t},f:function f(){try{c||null==a.return||a.return()}finally{if(l)throw u}}}}function _arrayLikeToArray(t,r){(null==r||r>t.length)&&(r=t.length);for(var i=0,a=new Array(r);i<r;i++)a[i]=t[i];return a}function ownKeys(t,r){var i=Object.keys(t);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(t);r&&(a=a.filter((function(r){return Object.getOwnPropertyDescriptor(t,r).enumerable}))),i.push.apply(i,a)}return i}function _objectSpread(t){for(var r=1;r<arguments.length;r++){var i=null!=arguments[r]?arguments[r]:{};r%2?ownKeys(Object(i),!0).forEach((function(r){(0,m.default)(t,r,i[r])})):Object.getOwnPropertyDescriptors?Object.defineProperties(t,Object.getOwnPropertyDescriptors(i)):ownKeys(Object(i)).forEach((function(r){Object.defineProperty(t,r,Object.getOwnPropertyDescriptor(i,r))}))}return t}function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,v.default)(t);if(r){var u=(0,v.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,g.default)(this,i)}}var S=a(i(102)).default.chief,O=function(t){(0,h.default)(ChiefService,t);var r,i,a=_createSuper(ChiefService);function ChiefService(){var t,r=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"chief";return(0,p.default)(this,ChiefService),t=a.call(this,r,["smartContract","web3"]),(0,m.default)((0,y.default)(t),"paddedBytes32ToAddress",(function(t){return t.length>42?"0x"+(0,x.takeLast)(40,t):t})),(0,m.default)((0,y.default)(t),"parseVoteAddressData",(function(t){for(var r=[],i=t.substr(330),a=0;a<i.length/64;a++){var u="0x".concat(i.substring(64*a+24,64*(a+1)));42===u.length&&r.push(u)}return r})),(0,m.default)((0,y.default)(t),"memoizedGetSlateAddresses",(0,x.memoizeWith)(x.identity,t.getSlateAddresses)),(0,m.default)((0,y.default)(t),"getDetailedLockLogs",(0,l.default)(c.default.mark((function _callee(){var r,i,a,u,l;return c.default.wrap((function _callee$(c){for(;;)switch(c.prev=c.next){case 0:return r=t._chiefContract().address,i=t.get("web3"),a=i.network,u=(0,w.netIdToName)(a),c.next=6,i.getPastLogs({fromBlock:S.inception_block[u],toBlock:"latest",address:r,topics:[S.events.lock]});case 6:return l=c.sent,c.abrupt("return",l.map((function(r){return{blockNumber:r.blockNumber,sender:t.paddedBytes32ToAddress(r.topics[1]),amount:_.MKR.wei(r.topics[2])}})));case 8:case"end":return c.stop()}}),_callee)})))),(0,m.default)((0,y.default)(t),"getDetailedFreeLogs",(0,l.default)(c.default.mark((function _callee2(){var r,i,a,u,l;return c.default.wrap((function _callee2$(c){for(;;)switch(c.prev=c.next){case 0:return r=t._chiefContract().address,i=t.get("web3"),a=i.network,u=(0,w.netIdToName)(a),c.next=6,i.getPastLogs({fromBlock:S.inception_block[u],toBlock:"latest",address:r,topics:[S.events.free]});case 6:return l=c.sent,c.abrupt("return",l.map((function(r){return{blockNumber:r.blockNumber,sender:t.paddedBytes32ToAddress(r.topics[1]),amount:_.MKR.wei(r.topics[2])}})));case 8:case"end":return c.stop()}}),_callee2)})))),(0,m.default)((0,y.default)(t),"getLockLogs",(0,l.default)(c.default.mark((function _callee3(){var r,i,a,u,l;return c.default.wrap((function _callee3$(c){for(;;)switch(c.prev=c.next){case 0:return r=t._chiefContract().address,i=t.get("web3"),a=i.network,u=(0,w.netIdToName)(a),c.next=6,i.getPastLogs({fromBlock:S.inception_block[u],toBlock:"latest",address:r,topics:[S.events.lock]});case 6:return l=c.sent,c.abrupt("return",(0,x.uniq)(l.map((function(t){return(0,x.nth)(1,t.topics)})).map(t.paddedBytes32ToAddress)));case 8:case"end":return c.stop()}}),_callee3)})))),(0,m.default)((0,y.default)(t),"getVoteAddressLogs",(0,l.default)(c.default.mark((function _callee4(){var r,i,a,u,l;return c.default.wrap((function _callee4$(c){for(;;)switch(c.prev=c.next){case 0:return r=t._chiefContract().address,i=t.get("web3"),a=i.network,u=(0,w.netIdToName)(a),c.next=6,i.getPastLogs({fromBlock:S.inception_block[u],toBlock:"latest",address:r,topics:[S.events.vote_addresses]});case 6:return l=c.sent,c.abrupt("return",l.map((function(r){return{blockNumber:r.blockNumber,sender:t.paddedBytes32ToAddress(r.topics[1]),candidates:t.parseVoteAddressData(r.data)}})));case 8:case"end":return c.stop()}}),_callee4)})))),(0,m.default)((0,y.default)(t),"getVoteSlateLogs",(0,l.default)(c.default.mark((function _callee5(){var r,i,a,u,l;return c.default.wrap((function _callee5$(c){for(;;)switch(c.prev=c.next){case 0:return r=t._chiefContract().address,i=t.get("web3"),a=i.network,u=(0,w.netIdToName)(a),c.next=6,i.getPastLogs({fromBlock:S.inception_block[u],toBlock:"latest",address:r,topics:[S.events.vote_slate]});case 6:return l=c.sent,c.abrupt("return",l.map((function(r){return{blockNumber:r.blockNumber,sender:t.paddedBytes32ToAddress(r.topics[1]),slate:r.topics[2]}})));case 8:case"end":return c.stop()}}),_callee5)})))),t}return(0,d.default)(ChiefService,[{key:"etch",value:function etch(t){return this._chiefContract().etch(t)}},{key:"lift",value:function lift(t){return this._chiefContract().lift(t)}},{key:"vote",value:function vote(t){return Array.isArray(t)?this._chiefContract()["vote(address[])"](t):this._chiefContract()["vote(bytes32)"](t)}},{key:"lock",value:function lock(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:_.MKR,i=(0,w.getCurrency)(t,r).toFixed("wei");return this._chiefContract().lock(i)}},{key:"free",value:function free(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:_.MKR,i=(0,w.getCurrency)(t,r).toFixed("wei");return this._chiefContract().free(i)}},{key:"getVoteTally",value:(i=(0,l.default)(c.default.mark((function _callee6(){var t,r,i,a,l,p,d,y,h,g,v,m,b,_,w=this;return c.default.wrap((function _callee6$(c){for(;;)switch(c.prev=c.next){case 0:return c.next=2,this.getLockLogs();case 2:return t=c.sent,c.next=5,Promise.all(t.map((function(t){return w.getNumDeposits(t).then((function(r){return{address:t,deposits:parseFloat(r)}}))})));case 5:return r=c.sent,c.next=8,Promise.all(r.map((function(t){return w.getVotedSlate(t.address).then((function(r){return _objectSpread(_objectSpread({},t),{},{slate:r})}))})));case 8:return i=c.sent,c.next=11,Promise.all(i.map((function(t){return w.memoizedGetSlateAddresses(t.slate).then((function(r){return _objectSpread(_objectSpread({},t),{},{votes:r})}))})));case 11:a=c.sent,l={},p=_createForOfIteratorHelper(a);try{for(p.s();!(d=p.n()).done;){y=d.value,h=_createForOfIteratorHelper(y.votes);try{for(h.s();!(g=h.n()).done;)v=(v=g.value).toLowerCase(),void 0===l[v]?l[v]={approvals:y.deposits,addresses:[{address:y.address,deposits:y.deposits}]}:(l[v].approvals+=y.deposits,l[v].addresses.push({address:y.address,deposits:y.deposits}))}catch(t){h.e(t)}finally{h.f()}}}catch(t){p.e(t)}finally{p.f()}for(m=function _loop(){var t=(0,u.default)(_[b],2),r=t[0],i=t[1].addresses.sort((function(t,r){return r.deposits-t.deposits})),a=l[r].approvals,c=i.map((function(t){return _objectSpread(_objectSpread({},t),{},{percent:(100*t.deposits/a).toFixed(2)})}));l[r]=c},b=0,_=Object.entries(l);b<_.length;b++)m();return c.abrupt("return",l);case 18:case"end":return c.stop()}}),_callee6,this)}))),function getVoteTally(){return i.apply(this,arguments)})},{key:"getVotedSlate",value:function getVotedSlate(t){return this._chiefContract().votes(t)}},{key:"getNumDeposits",value:function getNumDeposits(t){return this._chiefContract().deposits(t).then(_.MKR.wei)}},{key:"getApprovalCount",value:function getApprovalCount(t){return this._chiefContract().approvals(t).then(_.MKR.wei)}},{key:"getHat",value:function getHat(){return this._chiefContract().hat()}},{key:"getSlateAddresses",value:(r=(0,l.default)(c.default.mark((function _callee7(t){var r,i=arguments;return c.default.wrap((function _callee7$(a){for(;;)switch(a.prev=a.next){case 0:return r=i.length>1&&void 0!==i[1]?i[1]:0,a.prev=1,a.next=4,this._chiefContract().slates(t,r);case 4:return a.t1=a.sent,a.t0=[a.t1],a.next=8,this.getSlateAddresses(t,r+1);case 8:return a.t2=a.sent,a.abrupt("return",a.t0.concat.call(a.t0,a.t2));case 12:return a.prev=12,a.t3=a.catch(1),a.abrupt("return",[]);case 15:case"end":return a.stop()}}),_callee7,this,[[1,12]])}))),function getSlateAddresses(t){return r.apply(this,arguments)})},{key:"getLockAddressLogs",value:function getLockAddressLogs(){var t=this;return new Promise((function(r,i){t._chiefContract({web3js:!0}).LogNote({sig:"0xdd467064"},{fromBlock:0,toBlock:"latest"}).get((function(t,a){t&&i(t),r(a.map((function(t){return t.args.guy})))}))}))}},{key:"getEtchSlateLogs",value:function getEtchSlateLogs(){var t=this;return new Promise((function(r,i){t._chiefContract({web3js:!0}).Etch({},{fromBlock:0,toBlock:"latest"}).get((function(t,a){t&&i(t),r(a.map((function(t){return t.args.slate})))}))}))}},{key:"_chiefContract",value:function _chiefContract(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{},r=t.web3js,i=void 0!==r&&r;return i?this.get("smartContract").getWeb3ContractByName(_.CHIEF):this.get("smartContract").getContractByName(_.CHIEF)}}]),ChiefService}(b.LocalService);r.default=O},function(t,r){t.exports=function _arrayWithHoles(t){if(Array.isArray(t))return t}},function(t,r){t.exports=function _iterableToArrayLimit(t,r){if("undefined"!=typeof Symbol&&Symbol.iterator in Object(t)){var i=[],a=!0,u=!1,c=void 0;try{for(var l,p=t[Symbol.iterator]();!(a=(l=p.next()).done)&&(i.push(l.value),!r||i.length!==r);a=!0);}catch(t){u=!0,c=t}finally{try{a||null==p.return||p.return()}finally{if(u)throw c}}return i}}},function(t,r){t.exports=function _nonIterableRest(){throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}},function(t,r,i){var a=function(t){var r=Object.prototype,i=r.hasOwnProperty,a="function"==typeof Symbol?Symbol:{},u=a.iterator||"@@iterator",c=a.asyncIterator||"@@asyncIterator",l=a.toStringTag||"@@toStringTag";function wrap(t,r,i,a){var u=r&&r.prototype instanceof Generator?r:Generator,c=Object.create(u.prototype),l=new Context(a||[]);return c._invoke=function makeInvokeMethod(t,r,i){var a="suspendedStart";return function invoke(u,c){if("executing"===a)throw new Error("Generator is already running");if("completed"===a){if("throw"===u)throw c;return doneResult()}for(i.method=u,i.arg=c;;){var l=i.delegate;if(l){var d=maybeInvokeDelegate(l,i);if(d){if(d===p)continue;return d}}if("next"===i.method)i.sent=i._sent=i.arg;else if("throw"===i.method){if("suspendedStart"===a)throw a="completed",i.arg;i.dispatchException(i.arg)}else"return"===i.method&&i.abrupt("return",i.arg);a="executing";var y=tryCatch(t,r,i);if("normal"===y.type){if(a=i.done?"completed":"suspendedYield",y.arg===p)continue;return{value:y.arg,done:i.done}}"throw"===y.type&&(a="completed",i.method="throw",i.arg=y.arg)}}}(t,i,l),c}function tryCatch(t,r,i){try{return{type:"normal",arg:t.call(r,i)}}catch(t){return{type:"throw",arg:t}}}t.wrap=wrap;var p={};function Generator(){}function GeneratorFunction(){}function GeneratorFunctionPrototype(){}var d={};d[u]=function(){return this};var y=Object.getPrototypeOf,h=y&&y(y(values([])));h&&h!==r&&i.call(h,u)&&(d=h);var g=GeneratorFunctionPrototype.prototype=Generator.prototype=Object.create(d);function defineIteratorMethods(t){["next","throw","return"].forEach((function(r){t[r]=function(t){return this._invoke(r,t)}}))}function AsyncIterator(t,r){var a;this._invoke=function enqueue(u,c){function callInvokeWithMethodAndArg(){return new r((function(a,l){!function invoke(a,u,c,l){var p=tryCatch(t[a],t,u);if("throw"!==p.type){var d=p.arg,y=d.value;return y&&"object"==typeof y&&i.call(y,"__await")?r.resolve(y.__await).then((function(t){invoke("next",t,c,l)}),(function(t){invoke("throw",t,c,l)})):r.resolve(y).then((function(t){d.value=t,c(d)}),(function(t){return invoke("throw",t,c,l)}))}l(p.arg)}(u,c,a,l)}))}return a=a?a.then(callInvokeWithMethodAndArg,callInvokeWithMethodAndArg):callInvokeWithMethodAndArg()}}function maybeInvokeDelegate(t,r){var i=t.iterator[r.method];if(void 0===i){if(r.delegate=null,"throw"===r.method){if(t.iterator.return&&(r.method="return",r.arg=void 0,maybeInvokeDelegate(t,r),"throw"===r.method))return p;r.method="throw",r.arg=new TypeError("The iterator does not provide a 'throw' method")}return p}var a=tryCatch(i,t.iterator,r.arg);if("throw"===a.type)return r.method="throw",r.arg=a.arg,r.delegate=null,p;var u=a.arg;return u?u.done?(r[t.resultName]=u.value,r.next=t.nextLoc,"return"!==r.method&&(r.method="next",r.arg=void 0),r.delegate=null,p):u:(r.method="throw",r.arg=new TypeError("iterator result is not an object"),r.delegate=null,p)}function pushTryEntry(t){var r={tryLoc:t[0]};1 in t&&(r.catchLoc=t[1]),2 in t&&(r.finallyLoc=t[2],r.afterLoc=t[3]),this.tryEntries.push(r)}function resetTryEntry(t){var r=t.completion||{};r.type="normal",delete r.arg,t.completion=r}function Context(t){this.tryEntries=[{tryLoc:"root"}],t.forEach(pushTryEntry,this),this.reset(!0)}function values(t){if(t){var r=t[u];if(r)return r.call(t);if("function"==typeof t.next)return t;if(!isNaN(t.length)){var a=-1,c=function next(){for(;++a<t.length;)if(i.call(t,a))return next.value=t[a],next.done=!1,next;return next.value=void 0,next.done=!0,next};return c.next=c}}return{next:doneResult}}function doneResult(){return{value:void 0,done:!0}}return GeneratorFunction.prototype=g.constructor=GeneratorFunctionPrototype,GeneratorFunctionPrototype.constructor=GeneratorFunction,GeneratorFunctionPrototype[l]=GeneratorFunction.displayName="GeneratorFunction",t.isGeneratorFunction=function(t){var r="function"==typeof t&&t.constructor;return!!r&&(r===GeneratorFunction||"GeneratorFunction"===(r.displayName||r.name))},t.mark=function(t){return Object.setPrototypeOf?Object.setPrototypeOf(t,GeneratorFunctionPrototype):(t.__proto__=GeneratorFunctionPrototype,l in t||(t[l]="GeneratorFunction")),t.prototype=Object.create(g),t},t.awrap=function(t){return{__await:t}},defineIteratorMethods(AsyncIterator.prototype),AsyncIterator.prototype[c]=function(){return this},t.AsyncIterator=AsyncIterator,t.async=function(r,i,a,u,c){void 0===c&&(c=Promise);var l=new AsyncIterator(wrap(r,i,a,u),c);return t.isGeneratorFunction(i)?l:l.next().then((function(t){return t.done?t.value:l.next()}))},defineIteratorMethods(g),g[l]="Generator",g[u]=function(){return this},g.toString=function(){return"[object Generator]"},t.keys=function(t){var r=[];for(var i in t)r.push(i);return r.reverse(),function next(){for(;r.length;){var i=r.pop();if(i in t)return next.value=i,next.done=!1,next}return next.done=!0,next}},t.values=values,Context.prototype={constructor:Context,reset:function(t){if(this.prev=0,this.next=0,this.sent=this._sent=void 0,this.done=!1,this.delegate=null,this.method="next",this.arg=void 0,this.tryEntries.forEach(resetTryEntry),!t)for(var r in this)"t"===r.charAt(0)&&i.call(this,r)&&!isNaN(+r.slice(1))&&(this[r]=void 0)},stop:function(){this.done=!0;var t=this.tryEntries[0].completion;if("throw"===t.type)throw t.arg;return this.rval},dispatchException:function(t){if(this.done)throw t;var r=this;function handle(i,a){return c.type="throw",c.arg=t,r.next=i,a&&(r.method="next",r.arg=void 0),!!a}for(var a=this.tryEntries.length-1;a>=0;--a){var u=this.tryEntries[a],c=u.completion;if("root"===u.tryLoc)return handle("end");if(u.tryLoc<=this.prev){var l=i.call(u,"catchLoc"),p=i.call(u,"finallyLoc");if(l&&p){if(this.prev<u.catchLoc)return handle(u.catchLoc,!0);if(this.prev<u.finallyLoc)return handle(u.finallyLoc)}else if(l){if(this.prev<u.catchLoc)return handle(u.catchLoc,!0)}else{if(!p)throw new Error("try statement without catch or finally");if(this.prev<u.finallyLoc)return handle(u.finallyLoc)}}}},abrupt:function(t,r){for(var a=this.tryEntries.length-1;a>=0;--a){var u=this.tryEntries[a];if(u.tryLoc<=this.prev&&i.call(u,"finallyLoc")&&this.prev<u.finallyLoc){var c=u;break}}c&&("break"===t||"continue"===t)&&c.tryLoc<=r&&r<=c.finallyLoc&&(c=null);var l=c?c.completion:{};return l.type=t,l.arg=r,c?(this.method="next",this.next=c.finallyLoc,p):this.complete(l)},complete:function(t,r){if("throw"===t.type)throw t.arg;return"break"===t.type||"continue"===t.type?this.next=t.arg:"return"===t.type?(this.rval=this.arg=t.arg,this.method="return",this.next="end"):"normal"===t.type&&r&&(this.next=r),p},finish:function(t){for(var r=this.tryEntries.length-1;r>=0;--r){var i=this.tryEntries[r];if(i.finallyLoc===t)return this.complete(i.completion,i.afterLoc),resetTryEntry(i),p}},catch:function(t){for(var r=this.tryEntries.length-1;r>=0;--r){var i=this.tryEntries[r];if(i.tryLoc===t){var a=i.completion;if("throw"===a.type){var u=a.arg;resetTryEntry(i)}return u}}throw new Error("illegal catch attempt")},delegateYield:function(t,r,i){return this.delegate={iterator:values(t),resultName:r,nextLoc:i},"next"===this.method&&(this.arg=void 0),p}},t}(t.exports);try{regeneratorRuntime=a}catch(t){Function("r","regeneratorRuntime = r")(a)}},function(t,r,i){var a=i(170);function _get(r,i,u){return"undefined"!=typeof Reflect&&Reflect.get?t.exports=_get=Reflect.get:t.exports=_get=function _get(t,r,i){var u=a(t,r);if(u){var c=Object.getOwnPropertyDescriptor(u,r);return c.get?c.get.call(i):c.value}},_get(r,i,u||r)}t.exports=_get},function(t,r,i){var a=i(3);t.exports=function _superPropBase(t,r){for(;!Object.prototype.hasOwnProperty.call(t,r)&&null!==(t=a(t)););return t}},function(t,r){t.exports=function _isNativeFunction(t){return-1!==Function.toString.call(t).indexOf("[native code]")}},function(t,r,i){var a=i(55),u=i(173);function _construct(r,i,c){return u()?t.exports=_construct=Reflect.construct:t.exports=_construct=function _construct(t,r,i){var u=[null];u.push.apply(u,r);var c=new(Function.bind.apply(t,u));return i&&a(c,i.prototype),c},_construct.apply(null,arguments)}t.exports=_construct},function(t,r){t.exports=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}},function(t,r,i){var a=i(58),u=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var c=u(i(1)),l=u(i(2)),p=u(i(89)),d=u(i(59)),y=a(i(29)),h=(0,u(i(175)).default)("dai:ServiceManagerBase");function _promisify(t){return new Promise((function(r,i){try{r(t())}catch(t){i(t.message)}}))}var g=function(){function ServiceManagerBase(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:null,r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null,i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:null;if((0,c.default)(this,ServiceManagerBase),null!==t&&"function"!=typeof t)throw new Error("Invalid argument init: not a function or null.");if(null===t&&(t=function init(){return Promise.resolve()}),null!==r&&"function"!=typeof r)throw new Error("Invalid argument connect: not a function or null.");if(null===r&&null!==i&&(r=function connect(){return Promise.resolve()}),null!==i&&"function"!=typeof i)throw new Error("Invalid argument auth: not a function or null.");this._init=t,this._connect=r,this._auth=i,this._type=null===i?null===r?y.default.LOCAL:y.default.PUBLIC:y.default.PRIVATE,this._state=new p.default(d.default.CREATED,y.serviceTypeTransitions[this._type]),this._initPromise=null,this._connectPromise=null,this._authPromise=null}return(0,l.default)(ServiceManagerBase,[{key:"initialize",value:function initialize(t){var r=this;if(this._state.inState(d.default.CREATED)){if(this._initPromise)throw new Error("Unexpected init promise in state CREATED.");this._state.transitionTo(d.default.INITIALIZING),this._initPromise=_promisify((function(){return r._init(t)})).then((function(){return r._state.transitionTo(r._type===y.default.LOCAL?d.default.READY:d.default.OFFLINE)}),(function(t){throw h(t),r._state.transitionTo(d.default.CREATED),t}))}return this._initPromise}},{key:"connect",value:function connect(){var t=this;return this._type===y.default.LOCAL?this.initialize():(this._state.inState([d.default.CREATED,d.default.INITIALIZING,d.default.OFFLINE])&&null===this._connectPromise&&(this._connectPromise=this.initialize().then((function(){return t._state.transitionTo(d.default.CONNECTING),_promisify((function(){return t._connect((function(){return t._disconnect()}))})).then((function(){t._state.inState(d.default.CONNECTING)&&t._state.transitionTo(t._type===y.default.PUBLIC?d.default.READY:d.default.ONLINE)}),(function(r){throw h("connect error:",r),t._state.inState(d.default.CONNECTING)&&t._state.transitionTo(d.default.OFFLINE),r}))}))),this._connectPromise)}},{key:"authenticate",value:function authenticate(){var t=this;return this._type!==y.default.PRIVATE?this.connect():(this._state.inState([d.default.CREATED,d.default.INITIALIZING,d.default.OFFLINE,d.default.CONNECTING,d.default.ONLINE])&&null===this._authPromise&&(this._authPromise=this.connect().then((function(){return t._state.transitionTo(d.default.AUTHENTICATING),_promisify((function(){return t._auth((function(){return t._deauthenticate()}))})).then((function(){t._state.inState(d.default.AUTHENTICATING)&&t._state.transitionTo(d.default.READY)}),(function(r){h("authenticate error: "+r),t._state.inState(d.default.AUTHENTICATING)&&t._state.transitionTo(d.default.ONLINE)}))}))),this._authPromise)}},{key:"settings",value:function settings(t){return this._settings=t,this}},{key:"state",value:function state(){return this._state.state()}},{key:"type",value:function type(){return this._type}},{key:"isInitialized",value:function isInitialized(){return!this._state.inState([d.default.CREATED,d.default.INITIALIZING])}},{key:"isConnected",value:function isConnected(){return this._type===y.default.LOCAL?null:this._state.inState([d.default.ONLINE,d.default.AUTHENTICATING,d.default.READY])}},{key:"isAuthenticated",value:function isAuthenticated(){return this._type===y.default.PRIVATE?this._state.inState(d.default.READY):null}},{key:"isReady",value:function isReady(){return this._state.inState(d.default.READY)}},{key:"onInitialized",value:function onInitialized(t){return this._state.onStateChanged((function(r,i){r!==d.default.INITIALIZING||i!==d.default.OFFLINE&&i!==d.default.READY||t()})),this}},{key:"onConnected",value:function onConnected(t){return this._state.onStateChanged((function(r,i){r!==d.default.CONNECTING||i!==d.default.ONLINE&&i!==d.default.READY||t()})),this}},{key:"onDisconnected",value:function onDisconnected(t){return this._state.onStateChanged((function(r,i){i!==d.default.OFFLINE||r!==d.default.ONLINE&&r!==d.default.READY||t()})),this}},{key:"onAuthenticated",value:function onAuthenticated(t){return this._state.onStateChanged((function(r,i){r===d.default.AUTHENTICATING&&i===d.default.READY&&t()})),this}},{key:"onDeauthenticated",value:function onDeauthenticated(t){return this.type()===y.default.PRIVATE&&this._state.onStateChanged((function(r,i){i!==d.default.OFFLINE&&i!==d.default.ONLINE||r!==d.default.READY||t()})),this}},{key:"onReady",value:function onReady(t){return this._state.onStateChanged((function(r,i){i===d.default.READY&&t()})),this}},{key:"onStateChanged",value:function onStateChanged(t){return this._state.onStateChanged(t),this}},{key:"_disconnect",value:function _disconnect(){if(this._type===y.default.LOCAL)throw new Error("_disconnect must not be called on a Local Service");this._state.inState(d.default.AUTHENTICATING)&&this._deauthenticate(),this._state.inState([d.default.READY,d.default.ONLINE,d.default.CONNECTING])&&(this._authPromise=null,this._connectPromise=null,this._state.transitionTo(d.default.OFFLINE))}},{key:"_deauthenticate",value:function _deauthenticate(){if(this._type!==y.default.PRIVATE)throw new Error("_deauthenticate must not be called on a Local or Public Service");this._state.inState([d.default.READY,d.default.AUTHENTICATING])&&(this._authPromise=null,this._state.transitionTo(d.default.ONLINE))}}]),ServiceManagerBase}();r.default=g},function(t,r,i){(function(a){function load(){var t;try{t=r.storage.debug}catch(t){}return!t&&void 0!==a&&"env"in a&&(t=a.env.DEBUG),t}(r=t.exports=i(176)).log=function log(){return"object"==typeof console&&console.log&&Function.prototype.apply.call(console.log,console,arguments)},r.formatArgs=function formatArgs(t){var i=this.useColors;if(t[0]=(i?"%c":"")+this.namespace+(i?" %c":" ")+t[0]+(i?"%c ":" ")+"+"+r.humanize(this.diff),!i)return;var a="color: "+this.color;t.splice(1,0,a,"color: inherit");var u=0,c=0;t[0].replace(/%[a-zA-Z%]/g,(function(t){"%%"!==t&&(u++,"%c"===t&&(c=u))})),t.splice(c,0,a)},r.save=function save(t){try{null==t?r.storage.removeItem("debug"):r.storage.debug=t}catch(t){}},r.load=load,r.useColors=function useColors(){if("undefined"!=typeof window&&window.process&&"renderer"===window.process.type)return!0;return"undefined"!=typeof document&&document.documentElement&&document.documentElement.style&&document.documentElement.style.WebkitAppearance||"undefined"!=typeof window&&window.console&&(window.console.firebug||window.console.exception&&window.console.table)||"undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/)&&parseInt(RegExp.$1,10)>=31||"undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/applewebkit\/(\d+)/)},r.storage="undefined"!=typeof chrome&&void 0!==chrome.storage?chrome.storage.local:function localstorage(){try{return window.localStorage}catch(t){}}(),r.colors=["lightseagreen","forestgreen","goldenrod","dodgerblue","darkorchid","crimson"],r.formatters.j=function(t){try{return JSON.stringify(t)}catch(t){return"[UnexpectedJSONParseError]: "+t.message}},r.enable(load())}).call(this,i(90))},function(t,r,i){var a;function createDebug(t){function debug(){if(debug.enabled){var t=debug,i=+new Date,u=i-(a||i);t.diff=u,t.prev=a,t.curr=i,a=i;for(var c=new Array(arguments.length),l=0;l<c.length;l++)c[l]=arguments[l];c[0]=r.coerce(c[0]),"string"!=typeof c[0]&&c.unshift("%O");var p=0;c[0]=c[0].replace(/%([a-zA-Z%])/g,(function(i,a){if("%%"===i)return i;p++;var u=r.formatters[a];if("function"==typeof u){var l=c[p];i=u.call(t,l),c.splice(p,1),p--}return i})),r.formatArgs.call(t,c);var d=debug.log||r.log||console.log.bind(console);d.apply(t,c)}}return debug.namespace=t,debug.enabled=r.enabled(t),debug.useColors=r.useColors(),debug.color=function selectColor(t){var i,a=0;for(i in t)a=(a<<5)-a+t.charCodeAt(i),a|=0;return r.colors[Math.abs(a)%r.colors.length]}(t),"function"==typeof r.init&&r.init(debug),debug}(r=t.exports=createDebug.debug=createDebug.default=createDebug).coerce=function coerce(t){return t instanceof Error?t.stack||t.message:t},r.disable=function disable(){r.enable("")},r.enable=function enable(t){r.save(t),r.names=[],r.skips=[];for(var i=("string"==typeof t?t:"").split(/[\s,]+/),a=i.length,u=0;u<a;u++)i[u]&&("-"===(t=i[u].replace(/\*/g,".*?"))[0]?r.skips.push(new RegExp("^"+t.substr(1)+"$")):r.names.push(new RegExp("^"+t+"$")))},r.enabled=function enabled(t){var i,a;for(i=0,a=r.skips.length;i<a;i++)if(r.skips[i].test(t))return!1;for(i=0,a=r.names.length;i<a;i++)if(r.names[i].test(t))return!0;return!1},r.humanize=i(177),r.names=[],r.skips=[],r.formatters={}},function(t,r){var i=1e3,a=6e4,u=60*a,c=24*u;function plural(t,r,i){if(!(t<r))return t<1.5*r?Math.floor(t/r)+" "+i:Math.ceil(t/r)+" "+i+"s"}t.exports=function(t,r){r=r||{};var l=typeof t;if("string"===l&&t.length>0)return function parse(t){if((t=String(t)).length>100)return;var r=/^((?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|years?|yrs?|y)?$/i.exec(t);if(!r)return;var l=parseFloat(r[1]);switch((r[2]||"ms").toLowerCase()){case"years":case"year":case"yrs":case"yr":case"y":return 315576e5*l;case"days":case"day":case"d":return l*c;case"hours":case"hour":case"hrs":case"hr":case"h":return l*u;case"minutes":case"minute":case"mins":case"min":case"m":return l*a;case"seconds":case"second":case"secs":case"sec":case"s":return l*i;case"milliseconds":case"millisecond":case"msecs":case"msec":case"ms":return l;default:return}}(t);if("number"===l&&!1===isNaN(t))return r.long?function fmtLong(t){return plural(t,c,"day")||plural(t,u,"hour")||plural(t,a,"minute")||plural(t,i,"second")||t+" ms"}(t):function fmtShort(t){if(t>=c)return Math.round(t/c)+"d";if(t>=u)return Math.round(t/u)+"h";if(t>=a)return Math.round(t/a)+"m";if(t>=i)return Math.round(t/i)+"s";return t+"ms"}(t);throw new Error("val is not a non-empty string or a valid number. val="+JSON.stringify(t))}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(15)),c=a(i(23)),l=a(i(1)),p=a(i(2)),d=a(i(91)),y=a(i(95)),h=a(i(88));function _createForOfIteratorHelper(t){if("undefined"==typeof Symbol||null==t[Symbol.iterator]){if(Array.isArray(t)||(t=function _unsupportedIterableToArray(t,r){if(!t)return;if("string"==typeof t)return _arrayLikeToArray(t,r);var i=Object.prototype.toString.call(t).slice(8,-1);"Object"===i&&t.constructor&&(i=t.constructor.name);if("Map"===i||"Set"===i)return Array.from(t);if("Arguments"===i||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(i))return _arrayLikeToArray(t,r)}(t))){var r=0,i=function F(){};return{s:i,n:function n(){return r>=t.length?{done:!0}:{done:!1,value:t[r++]}},e:function e(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,u,c=!0,l=!1;return{s:function s(){a=t[Symbol.iterator]()},n:function n(){var t=a.next();return c=t.done,t},e:function e(t){l=!0,u=t},f:function f(){try{c||null==a.return||a.return()}finally{if(l)throw u}}}}function _arrayLikeToArray(t,r){(null==r||r>t.length)&&(r=t.length);for(var i=0,a=new Array(r);i<r;i++)a[i]=t[i];return a}var g=function(){function ServiceProvider(t){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},i=r.services,a=void 0===i?{}:i,u=r.defaults,c=void 0===u?{}:u,p=r.disabled,d=void 0===p?{}:p;(0,l.default)(this,ServiceProvider),this._config=t,this._services=a,this._resolver={defaults:c,disabled:d}}return(0,p.default)(ServiceProvider,[{key:"supports",value:function supports(t){return!!this._services[t]}},{key:"buildContainer",value:function buildContainer(){var t=new y.default;for(var r in this._config){var i=(0,h.default)(r,this._config[r],this._resolver),a=(0,c.default)(i,2),l=a[0],p=a[1],d=void 0;if("object"==(0,u.default)(l))d=l;else if("function"==typeof l)d=new l;else{if(!this.supports(l)&&"exchange"===r)throw new Error("This service has been extracted from dai.js. Please refer to the documentation to add it as a plugin: \n\n https://github.com/makerdao/dai.js/wiki/Basic-Usage-(Plugins)");if(!this.supports(l))throw new Error("Unsupported service in configuration: "+l);d=new this._services[l]}var g=d.manager().name();if(g!==r)throw new Error('Role mismatch: "'.concat(g,'", "').concat(r,'"'));d.manager().settings(p),t.register(d,r)}return this._registerDependencies(t),t.injectDependencies(),this._container=t,t}},{key:"_registerDependencies",value:function _registerDependencies(t){var r=t.getRegisteredServiceNames(),i=r.reduce((function(r,i){var a=t.service(i).manager().dependencies();return(0,d.default)(r.concat(a))}),[]).filter((function(t){return!r.includes(t)}));if(0!==i.length){var a,u=_createForOfIteratorHelper(i);try{for(u.s();!(a=u.n()).done;){var c=a.value,l=this._resolver.defaults[c];if("string"==typeof l&&(l=this._services[l]),!l)throw new Error('No service found for "'.concat(c,'"'));t.register(new l,c)}}catch(t){u.e(t)}finally{u.f()}this._registerDependencies(t)}}},{key:"service",value:function service(t){return this._container||this.buildContainer(),this._container.service(t)}}]),ServiceProvider}();r.default=g},function(t,r,i){var a=i(180),u=i(211),c=i(216),l=i(217),p=i(218),d=i(94);t.exports=function baseUniq(t,r,i){var y=-1,h=u,g=t.length,v=!0,m=[],b=m;if(i)v=!1,h=c;else if(g>=200){var _=r?null:p(t);if(_)return d(_);v=!1,h=l,b=new a}else b=r?[]:m;e:for(;++y<g;){var w=t[y],x=r?r(w):w;if(w=i||0!==w?w:0,v&&x==x){for(var S=b.length;S--;)if(b[S]===x)continue e;r&&b.push(x),m.push(w)}else h(b,x,i)||(b!==m&&b.push(x),m.push(w))}return m}},function(t,r,i){var a=i(181),u=i(209),c=i(210);function SetCache(t){var r=-1,i=null==t?0:t.length;for(this.__data__=new a;++r<i;)this.add(t[r])}SetCache.prototype.add=SetCache.prototype.push=u,SetCache.prototype.has=c,t.exports=SetCache},function(t,r,i){var a=i(182),u=i(204),c=i(206),l=i(207),p=i(208);function MapCache(t){var r=-1,i=null==t?0:t.length;for(this.clear();++r<i;){var a=t[r];this.set(a[0],a[1])}}MapCache.prototype.clear=a,MapCache.prototype.delete=u,MapCache.prototype.get=c,MapCache.prototype.has=l,MapCache.prototype.set=p,t.exports=MapCache},function(t,r,i){var a=i(183),u=i(196),c=i(203);t.exports=function mapCacheClear(){this.size=0,this.__data__={hash:new a,map:new(c||u),string:new a}}},function(t,r,i){var a=i(184),u=i(192),c=i(193),l=i(194),p=i(195);function Hash(t){var r=-1,i=null==t?0:t.length;for(this.clear();++r<i;){var a=t[r];this.set(a[0],a[1])}}Hash.prototype.clear=a,Hash.prototype.delete=u,Hash.prototype.get=c,Hash.prototype.has=l,Hash.prototype.set=p,t.exports=Hash},function(t,r,i){var a=i(36);t.exports=function hashClear(){this.__data__=a?a(null):{},this.size=0}},function(t,r,i){var a=i(92),u=i(188),c=i(63),l=i(190),p=/^\[object .+?Constructor\]$/,d=Function.prototype,y=Object.prototype,h=d.toString,g=y.hasOwnProperty,v=RegExp("^"+h.call(g).replace(/[\\^$.*+?()[\]{}|]/g,"\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,"$1.*?")+"$");t.exports=function baseIsNative(t){return!(!c(t)||u(t))&&(a(t)?v:p).test(l(t))}},function(t,r,i){var a=i(61),u=Object.prototype,c=u.hasOwnProperty,l=u.toString,p=a?a.toStringTag:void 0;t.exports=function getRawTag(t){var r=c.call(t,p),i=t[p];try{t[p]=void 0;var a=!0}catch(t){}var u=l.call(t);return a&&(r?t[p]=i:delete t[p]),u}},function(t,r){var i=Object.prototype.toString;t.exports=function objectToString(t){return i.call(t)}},function(t,r,i){var a,u=i(189),c=(a=/[^.]+$/.exec(u&&u.keys&&u.keys.IE_PROTO||""))?"Symbol(src)_1."+a:"";t.exports=function isMasked(t){return!!c&&c in t}},function(t,r,i){var a=i(30)["__core-js_shared__"];t.exports=a},function(t,r){var i=Function.prototype.toString;t.exports=function toSource(t){if(null!=t){try{return i.call(t)}catch(t){}try{return t+""}catch(t){}}return""}},function(t,r){t.exports=function getValue(t,r){return null==t?void 0:t[r]}},function(t,r){t.exports=function hashDelete(t){var r=this.has(t)&&delete this.__data__[t];return this.size-=r?1:0,r}},function(t,r,i){var a=i(36),u=Object.prototype.hasOwnProperty;t.exports=function hashGet(t){var r=this.__data__;if(a){var i=r[t];return"__lodash_hash_undefined__"===i?void 0:i}return u.call(r,t)?r[t]:void 0}},function(t,r,i){var a=i(36),u=Object.prototype.hasOwnProperty;t.exports=function hashHas(t){var r=this.__data__;return a?void 0!==r[t]:u.call(r,t)}},function(t,r,i){var a=i(36);t.exports=function hashSet(t,r){var i=this.__data__;return this.size+=this.has(t)?0:1,i[t]=a&&void 0===r?"__lodash_hash_undefined__":r,this}},function(t,r,i){var a=i(197),u=i(198),c=i(200),l=i(201),p=i(202);function ListCache(t){var r=-1,i=null==t?0:t.length;for(this.clear();++r<i;){var a=t[r];this.set(a[0],a[1])}}ListCache.prototype.clear=a,ListCache.prototype.delete=u,ListCache.prototype.get=c,ListCache.prototype.has=l,ListCache.prototype.set=p,t.exports=ListCache},function(t,r){t.exports=function listCacheClear(){this.__data__=[],this.size=0}},function(t,r,i){var a=i(38),u=Array.prototype.splice;t.exports=function listCacheDelete(t){var r=this.__data__,i=a(r,t);return!(i<0)&&(i==r.length-1?r.pop():u.call(r,i,1),--this.size,!0)}},function(t,r){t.exports=function eq(t,r){return t===r||t!=t&&r!=r}},function(t,r,i){var a=i(38);t.exports=function listCacheGet(t){var r=this.__data__,i=a(r,t);return i<0?void 0:r[i][1]}},function(t,r,i){var a=i(38);t.exports=function listCacheHas(t){return a(this.__data__,t)>-1}},function(t,r,i){var a=i(38);t.exports=function listCacheSet(t,r){var i=this.__data__,u=a(i,t);return u<0?(++this.size,i.push([t,r])):i[u][1]=r,this}},function(t,r,i){var a=i(60)(i(30),"Map");t.exports=a},function(t,r,i){var a=i(39);t.exports=function mapCacheDelete(t){var r=a(this,t).delete(t);return this.size-=r?1:0,r}},function(t,r){t.exports=function isKeyable(t){var r=typeof t;return"string"==r||"number"==r||"symbol"==r||"boolean"==r?"__proto__"!==t:null===t}},function(t,r,i){var a=i(39);t.exports=function mapCacheGet(t){return a(this,t).get(t)}},function(t,r,i){var a=i(39);t.exports=function mapCacheHas(t){return a(this,t).has(t)}},function(t,r,i){var a=i(39);t.exports=function mapCacheSet(t,r){var i=a(this,t),u=i.size;return i.set(t,r),this.size+=i.size==u?0:1,this}},function(t,r){t.exports=function setCacheAdd(t){return this.__data__.set(t,"__lodash_hash_undefined__"),this}},function(t,r){t.exports=function setCacheHas(t){return this.__data__.has(t)}},function(t,r,i){var a=i(212);t.exports=function arrayIncludes(t,r){return!!(null==t?0:t.length)&&a(t,r,0)>-1}},function(t,r,i){var a=i(213),u=i(214),c=i(215);t.exports=function baseIndexOf(t,r,i){return r==r?c(t,r,i):a(t,u,i)}},function(t,r){t.exports=function baseFindIndex(t,r,i,a){for(var u=t.length,c=i+(a?1:-1);a?c--:++c<u;)if(r(t[c],c,t))return c;return-1}},function(t,r){t.exports=function baseIsNaN(t){return t!=t}},function(t,r){t.exports=function strictIndexOf(t,r,i){for(var a=i-1,u=t.length;++a<u;)if(t[a]===r)return a;return-1}},function(t,r){t.exports=function arrayIncludesWith(t,r,i){for(var a=-1,u=null==t?0:t.length;++a<u;)if(i(r,t[a]))return!0;return!1}},function(t,r){t.exports=function cacheHas(t,r){return t.has(r)}},function(t,r,i){var a=i(219),u=i(220),c=i(94),l=a&&1/c(new a([,-0]))[1]==1/0?function(t){return new a(t)}:u;t.exports=l},function(t,r,i){var a=i(60)(i(30),"Set");t.exports=a},function(t,r){t.exports=function noop(){}},function(t,r,i){var a=i(222),u=i(223);t.exports=function values(t){return null==t?[]:a(t,u(t))}},function(t,r,i){var a=i(96);t.exports=function baseValues(t,r){return a(r,(function(r){return t[r]}))}},function(t,r,i){var a=i(224),u=i(234),c=i(238);t.exports=function keys(t){return c(t)?a(t):u(t)}},function(t,r,i){var a=i(97),u=i(225),c=i(98),l=i(227),p=i(229),d=i(230),y=Object.prototype.hasOwnProperty;t.exports=function arrayLikeKeys(t,r){var i=c(t),h=!i&&u(t),g=!i&&!h&&l(t),v=!i&&!h&&!g&&d(t),m=i||h||g||v,b=m?a(t.length,String):[],_=b.length;for(var w in t)!r&&!y.call(t,w)||m&&("length"==w||g&&("offset"==w||"parent"==w)||v&&("buffer"==w||"byteLength"==w||"byteOffset"==w)||p(w,_))||b.push(w);return b}},function(t,r,i){var a=i(226),u=i(40),c=Object.prototype,l=c.hasOwnProperty,p=c.propertyIsEnumerable,d=a(function(){return arguments}())?a:function(t){return u(t)&&l.call(t,"callee")&&!p.call(t,"callee")};t.exports=d},function(t,r,i){var a=i(37),u=i(40);t.exports=function baseIsArguments(t){return u(t)&&"[object Arguments]"==a(t)}},function(t,r,i){(function(t){var a=i(30),u=i(228),c=r&&!r.nodeType&&r,l=c&&"object"==typeof t&&t&&!t.nodeType&&t,p=l&&l.exports===c?a.Buffer:void 0,d=(p?p.isBuffer:void 0)||u;t.exports=d}).call(this,i(99)(t))},function(t,r){t.exports=function stubFalse(){return!1}},function(t,r){var i=/^(?:0|[1-9]\d*)$/;t.exports=function isIndex(t,r){var a=typeof t;return!!(r=null==r?9007199254740991:r)&&("number"==a||"symbol"!=a&&i.test(t))&&t>-1&&t%1==0&&t<r}},function(t,r,i){var a=i(231),u=i(232),c=i(233),l=c&&c.isTypedArray,p=l?u(l):a;t.exports=p},function(t,r,i){var a=i(37),u=i(100),c=i(40),l={};l["[object Float32Array]"]=l["[object Float64Array]"]=l["[object Int8Array]"]=l["[object Int16Array]"]=l["[object Int32Array]"]=l["[object Uint8Array]"]=l["[object Uint8ClampedArray]"]=l["[object Uint16Array]"]=l["[object Uint32Array]"]=!0,l["[object Arguments]"]=l["[object Array]"]=l["[object ArrayBuffer]"]=l["[object Boolean]"]=l["[object DataView]"]=l["[object Date]"]=l["[object Error]"]=l["[object Function]"]=l["[object Map]"]=l["[object Number]"]=l["[object Object]"]=l["[object RegExp]"]=l["[object Set]"]=l["[object String]"]=l["[object WeakMap]"]=!1,t.exports=function baseIsTypedArray(t){return c(t)&&u(t.length)&&!!l[a(t)]}},function(t,r){t.exports=function baseUnary(t){return function(r){return t(r)}}},function(t,r,i){(function(t){var a=i(93),u=r&&!r.nodeType&&r,c=u&&"object"==typeof t&&t&&!t.nodeType&&t,l=c&&c.exports===u&&a.process,p=function(){try{var t=c&&c.require&&c.require("util").types;return t||l&&l.binding&&l.binding("util")}catch(t){}}();t.exports=p}).call(this,i(99)(t))},function(t,r,i){var a=i(235),u=i(236),c=Object.prototype.hasOwnProperty;t.exports=function baseKeys(t){if(!a(t))return u(t);var r=[];for(var i in Object(t))c.call(t,i)&&"constructor"!=i&&r.push(i);return r}},function(t,r){var i=Object.prototype;t.exports=function isPrototype(t){var r=t&&t.constructor;return t===("function"==typeof r&&r.prototype||i)}},function(t,r,i){var a=i(237)(Object.keys,Object);t.exports=a},function(t,r){t.exports=function overArg(t,r){return function(i){return t(r(i))}}},function(t,r,i){var a=i(92),u=i(100);t.exports=function isArrayLike(t){return null!=t&&u(t.length)&&!a(t)}},function(t,r){function toposort(t,r){var i=t.length,a=new Array(i),u={},c=i,l=function makeOutgoingEdges(t){for(var r=new Map,i=0,a=t.length;i<a;i++){var u=t[i];r.has(u[0])||r.set(u[0],new Set),r.has(u[1])||r.set(u[1],new Set),r.get(u[0]).add(u[1])}return r}(r),p=function makeNodesHash(t){for(var r=new Map,i=0,a=t.length;i<a;i++)r.set(t[i],i);return r}(t);for(r.forEach((function(t){if(!p.has(t[0])||!p.has(t[1]))throw new Error("Unknown node. There is an unknown node in the supplied edges.")}));c--;)u[c]||visit(t[c],c,new Set);return a;function visit(t,r,c){if(c.has(t)){var d;try{d=", node was:"+JSON.stringify(t)}catch(t){d=""}throw new Error("Cyclic dependency"+d)}if(!p.has(t))throw new Error("Found unknown node. Make sure to provided all involved nodes. Unknown node: "+JSON.stringify(t));if(!u[r]){u[r]=!0;var y=l.get(t)||new Set;if(r=(y=Array.from(y)).length){c.add(t);do{var h=y[--r];visit(h,p.get(h),c)}while(r);c.delete(t)}a[--i]=t}}}t.exports=function(t){return toposort(function uniqueNodes(t){for(var r=new Set,i=0,a=t.length;i<a;i++){var u=t[i];r.add(u[0]),r.add(u[1])}return Array.from(r)}(t),t)},t.exports.array=toposort},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(5)),l=a(i(6)),p=a(i(3)),d=a(i(29));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,p.default)(t);if(r){var u=(0,p.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,l.default)(this,i)}}var y=function(t){(0,c.default)(LocalService,t);var r=_createSuper(LocalService);function LocalService(t){var i=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];return(0,u.default)(this,LocalService),r.call(this,d.default.LOCAL,t,i)}return LocalService}(a(i(35)).default);r.default=y},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(5)),l=a(i(6)),p=a(i(3)),d=a(i(29));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,p.default)(t);if(r){var u=(0,p.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,l.default)(this,i)}}var y=function(t){(0,c.default)(PublicService,t);var r=_createSuper(PublicService);function PublicService(t){var i=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];return(0,u.default)(this,PublicService),r.call(this,d.default.PUBLIC,t,i)}return PublicService}(a(i(35)).default);r.default=y},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(5)),l=a(i(6)),p=a(i(3)),d=a(i(29));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,p.default)(t);if(r){var u=(0,p.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,l.default)(this,i)}}var y=function(t){(0,c.default)(PrivateService,t);var r=_createSuper(PrivateService);function PrivateService(t){var i=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];return(0,u.default)(this,PrivateService),r.call(this,d.default.PRIVATE,t,i)}return PrivateService}(a(i(35)).default);r.default=y},function(t,r,i){(function(t){var a=i(244),u=i(245),c=i(246);function kMaxLength(){return Buffer.TYPED_ARRAY_SUPPORT?2147483647:1073741823}function createBuffer(t,r){if(kMaxLength()<r)throw new RangeError("Invalid typed array length");return Buffer.TYPED_ARRAY_SUPPORT?(t=new Uint8Array(r)).__proto__=Buffer.prototype:(null===t&&(t=new Buffer(r)),t.length=r),t}function Buffer(t,r,i){if(!(Buffer.TYPED_ARRAY_SUPPORT||this instanceof Buffer))return new Buffer(t,r,i);if("number"==typeof t){if("string"==typeof r)throw new Error("If encoding is specified then the first argument must be a string");return allocUnsafe(this,t)}return from(this,t,r,i)}function from(t,r,i,a){if("number"==typeof r)throw new TypeError('"value" argument must not be a number');return"undefined"!=typeof ArrayBuffer&&r instanceof ArrayBuffer?function fromArrayBuffer(t,r,i,a){if(r.byteLength,i<0||r.byteLength<i)throw new RangeError("'offset' is out of bounds");if(r.byteLength<i+(a||0))throw new RangeError("'length' is out of bounds");r=void 0===i&&void 0===a?new Uint8Array(r):void 0===a?new Uint8Array(r,i):new Uint8Array(r,i,a);Buffer.TYPED_ARRAY_SUPPORT?(t=r).__proto__=Buffer.prototype:t=fromArrayLike(t,r);return t}(t,r,i,a):"string"==typeof r?function fromString(t,r,i){"string"==typeof i&&""!==i||(i="utf8");if(!Buffer.isEncoding(i))throw new TypeError('"encoding" must be a valid string encoding');var a=0|byteLength(r,i),u=(t=createBuffer(t,a)).write(r,i);u!==a&&(t=t.slice(0,u));return t}(t,r,i):function fromObject(t,r){if(Buffer.isBuffer(r)){var i=0|checked(r.length);return 0===(t=createBuffer(t,i)).length||r.copy(t,0,0,i),t}if(r){if("undefined"!=typeof ArrayBuffer&&r.buffer instanceof ArrayBuffer||"length"in r)return"number"!=typeof r.length||function isnan(t){return t!=t}(r.length)?createBuffer(t,0):fromArrayLike(t,r);if("Buffer"===r.type&&c(r.data))return fromArrayLike(t,r.data)}throw new TypeError("First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.")}(t,r)}function assertSize(t){if("number"!=typeof t)throw new TypeError('"size" argument must be a number');if(t<0)throw new RangeError('"size" argument must not be negative')}function allocUnsafe(t,r){if(assertSize(r),t=createBuffer(t,r<0?0:0|checked(r)),!Buffer.TYPED_ARRAY_SUPPORT)for(var i=0;i<r;++i)t[i]=0;return t}function fromArrayLike(t,r){var i=r.length<0?0:0|checked(r.length);t=createBuffer(t,i);for(var a=0;a<i;a+=1)t[a]=255&r[a];return t}function checked(t){if(t>=kMaxLength())throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x"+kMaxLength().toString(16)+" bytes");return 0|t}function byteLength(t,r){if(Buffer.isBuffer(t))return t.length;if("undefined"!=typeof ArrayBuffer&&"function"==typeof ArrayBuffer.isView&&(ArrayBuffer.isView(t)||t instanceof ArrayBuffer))return t.byteLength;"string"!=typeof t&&(t=""+t);var i=t.length;if(0===i)return 0;for(var a=!1;;)switch(r){case"ascii":case"latin1":case"binary":return i;case"utf8":case"utf-8":case void 0:return utf8ToBytes(t).length;case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return 2*i;case"hex":return i>>>1;case"base64":return base64ToBytes(t).length;default:if(a)return utf8ToBytes(t).length;r=(""+r).toLowerCase(),a=!0}}function slowToString(t,r,i){var a=!1;if((void 0===r||r<0)&&(r=0),r>this.length)return"";if((void 0===i||i>this.length)&&(i=this.length),i<=0)return"";if((i>>>=0)<=(r>>>=0))return"";for(t||(t="utf8");;)switch(t){case"hex":return hexSlice(this,r,i);case"utf8":case"utf-8":return utf8Slice(this,r,i);case"ascii":return asciiSlice(this,r,i);case"latin1":case"binary":return latin1Slice(this,r,i);case"base64":return base64Slice(this,r,i);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return utf16leSlice(this,r,i);default:if(a)throw new TypeError("Unknown encoding: "+t);t=(t+"").toLowerCase(),a=!0}}function swap(t,r,i){var a=t[r];t[r]=t[i],t[i]=a}function bidirectionalIndexOf(t,r,i,a,u){if(0===t.length)return-1;if("string"==typeof i?(a=i,i=0):i>2147483647?i=2147483647:i<-2147483648&&(i=-2147483648),i=+i,isNaN(i)&&(i=u?0:t.length-1),i<0&&(i=t.length+i),i>=t.length){if(u)return-1;i=t.length-1}else if(i<0){if(!u)return-1;i=0}if("string"==typeof r&&(r=Buffer.from(r,a)),Buffer.isBuffer(r))return 0===r.length?-1:arrayIndexOf(t,r,i,a,u);if("number"==typeof r)return r&=255,Buffer.TYPED_ARRAY_SUPPORT&&"function"==typeof Uint8Array.prototype.indexOf?u?Uint8Array.prototype.indexOf.call(t,r,i):Uint8Array.prototype.lastIndexOf.call(t,r,i):arrayIndexOf(t,[r],i,a,u);throw new TypeError("val must be string, number or Buffer")}function arrayIndexOf(t,r,i,a,u){var c,l=1,p=t.length,d=r.length;if(void 0!==a&&("ucs2"===(a=String(a).toLowerCase())||"ucs-2"===a||"utf16le"===a||"utf-16le"===a)){if(t.length<2||r.length<2)return-1;l=2,p/=2,d/=2,i/=2}function read(t,r){return 1===l?t[r]:t.readUInt16BE(r*l)}if(u){var y=-1;for(c=i;c<p;c++)if(read(t,c)===read(r,-1===y?0:c-y)){if(-1===y&&(y=c),c-y+1===d)return y*l}else-1!==y&&(c-=c-y),y=-1}else for(i+d>p&&(i=p-d),c=i;c>=0;c--){for(var h=!0,g=0;g<d;g++)if(read(t,c+g)!==read(r,g)){h=!1;break}if(h)return c}return-1}function hexWrite(t,r,i,a){i=Number(i)||0;var u=t.length-i;a?(a=Number(a))>u&&(a=u):a=u;var c=r.length;if(c%2!=0)throw new TypeError("Invalid hex string");a>c/2&&(a=c/2);for(var l=0;l<a;++l){var p=parseInt(r.substr(2*l,2),16);if(isNaN(p))return l;t[i+l]=p}return l}function utf8Write(t,r,i,a){return blitBuffer(utf8ToBytes(r,t.length-i),t,i,a)}function asciiWrite(t,r,i,a){return blitBuffer(function asciiToBytes(t){for(var r=[],i=0;i<t.length;++i)r.push(255&t.charCodeAt(i));return r}(r),t,i,a)}function latin1Write(t,r,i,a){return asciiWrite(t,r,i,a)}function base64Write(t,r,i,a){return blitBuffer(base64ToBytes(r),t,i,a)}function ucs2Write(t,r,i,a){return blitBuffer(function utf16leToBytes(t,r){for(var i,a,u,c=[],l=0;l<t.length&&!((r-=2)<0);++l)i=t.charCodeAt(l),a=i>>8,u=i%256,c.push(u),c.push(a);return c}(r,t.length-i),t,i,a)}function base64Slice(t,r,i){return 0===r&&i===t.length?a.fromByteArray(t):a.fromByteArray(t.slice(r,i))}function utf8Slice(t,r,i){i=Math.min(t.length,i);for(var a=[],u=r;u<i;){var c,l,p,d,y=t[u],h=null,g=y>239?4:y>223?3:y>191?2:1;if(u+g<=i)switch(g){case 1:y<128&&(h=y);break;case 2:128==(192&(c=t[u+1]))&&(d=(31&y)<<6|63&c)>127&&(h=d);break;case 3:c=t[u+1],l=t[u+2],128==(192&c)&&128==(192&l)&&(d=(15&y)<<12|(63&c)<<6|63&l)>2047&&(d<55296||d>57343)&&(h=d);break;case 4:c=t[u+1],l=t[u+2],p=t[u+3],128==(192&c)&&128==(192&l)&&128==(192&p)&&(d=(15&y)<<18|(63&c)<<12|(63&l)<<6|63&p)>65535&&d<1114112&&(h=d)}null===h?(h=65533,g=1):h>65535&&(h-=65536,a.push(h>>>10&1023|55296),h=56320|1023&h),a.push(h),u+=g}return function decodeCodePointsArray(t){var r=t.length;if(r<=4096)return String.fromCharCode.apply(String,t);var i="",a=0;for(;a<r;)i+=String.fromCharCode.apply(String,t.slice(a,a+=4096));return i}(a)}r.Buffer=Buffer,r.SlowBuffer=function SlowBuffer(t){+t!=t&&(t=0);return Buffer.alloc(+t)},r.INSPECT_MAX_BYTES=50,Buffer.TYPED_ARRAY_SUPPORT=void 0!==t.TYPED_ARRAY_SUPPORT?t.TYPED_ARRAY_SUPPORT:function typedArraySupport(){try{var t=new Uint8Array(1);return t.__proto__={__proto__:Uint8Array.prototype,foo:function(){return 42}},42===t.foo()&&"function"==typeof t.subarray&&0===t.subarray(1,1).byteLength}catch(t){return!1}}(),r.kMaxLength=kMaxLength(),Buffer.poolSize=8192,Buffer._augment=function(t){return t.__proto__=Buffer.prototype,t},Buffer.from=function(t,r,i){return from(null,t,r,i)},Buffer.TYPED_ARRAY_SUPPORT&&(Buffer.prototype.__proto__=Uint8Array.prototype,Buffer.__proto__=Uint8Array,"undefined"!=typeof Symbol&&Symbol.species&&Buffer[Symbol.species]===Buffer&&Object.defineProperty(Buffer,Symbol.species,{value:null,configurable:!0})),Buffer.alloc=function(t,r,i){return function alloc(t,r,i,a){return assertSize(r),r<=0?createBuffer(t,r):void 0!==i?"string"==typeof a?createBuffer(t,r).fill(i,a):createBuffer(t,r).fill(i):createBuffer(t,r)}(null,t,r,i)},Buffer.allocUnsafe=function(t){return allocUnsafe(null,t)},Buffer.allocUnsafeSlow=function(t){return allocUnsafe(null,t)},Buffer.isBuffer=function isBuffer(t){return!(null==t||!t._isBuffer)},Buffer.compare=function compare(t,r){if(!Buffer.isBuffer(t)||!Buffer.isBuffer(r))throw new TypeError("Arguments must be Buffers");if(t===r)return 0;for(var i=t.length,a=r.length,u=0,c=Math.min(i,a);u<c;++u)if(t[u]!==r[u]){i=t[u],a=r[u];break}return i<a?-1:a<i?1:0},Buffer.isEncoding=function isEncoding(t){switch(String(t).toLowerCase()){case"hex":case"utf8":case"utf-8":case"ascii":case"latin1":case"binary":case"base64":case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return!0;default:return!1}},Buffer.concat=function concat(t,r){if(!c(t))throw new TypeError('"list" argument must be an Array of Buffers');if(0===t.length)return Buffer.alloc(0);var i;if(void 0===r)for(r=0,i=0;i<t.length;++i)r+=t[i].length;var a=Buffer.allocUnsafe(r),u=0;for(i=0;i<t.length;++i){var l=t[i];if(!Buffer.isBuffer(l))throw new TypeError('"list" argument must be an Array of Buffers');l.copy(a,u),u+=l.length}return a},Buffer.byteLength=byteLength,Buffer.prototype._isBuffer=!0,Buffer.prototype.swap16=function swap16(){var t=this.length;if(t%2!=0)throw new RangeError("Buffer size must be a multiple of 16-bits");for(var r=0;r<t;r+=2)swap(this,r,r+1);return this},Buffer.prototype.swap32=function swap32(){var t=this.length;if(t%4!=0)throw new RangeError("Buffer size must be a multiple of 32-bits");for(var r=0;r<t;r+=4)swap(this,r,r+3),swap(this,r+1,r+2);return this},Buffer.prototype.swap64=function swap64(){var t=this.length;if(t%8!=0)throw new RangeError("Buffer size must be a multiple of 64-bits");for(var r=0;r<t;r+=8)swap(this,r,r+7),swap(this,r+1,r+6),swap(this,r+2,r+5),swap(this,r+3,r+4);return this},Buffer.prototype.toString=function toString(){var t=0|this.length;return 0===t?"":0===arguments.length?utf8Slice(this,0,t):slowToString.apply(this,arguments)},Buffer.prototype.equals=function equals(t){if(!Buffer.isBuffer(t))throw new TypeError("Argument must be a Buffer");return this===t||0===Buffer.compare(this,t)},Buffer.prototype.inspect=function inspect(){var t="",i=r.INSPECT_MAX_BYTES;return this.length>0&&(t=this.toString("hex",0,i).match(/.{2}/g).join(" "),this.length>i&&(t+=" ... ")),"<Buffer "+t+">"},Buffer.prototype.compare=function compare(t,r,i,a,u){if(!Buffer.isBuffer(t))throw new TypeError("Argument must be a Buffer");if(void 0===r&&(r=0),void 0===i&&(i=t?t.length:0),void 0===a&&(a=0),void 0===u&&(u=this.length),r<0||i>t.length||a<0||u>this.length)throw new RangeError("out of range index");if(a>=u&&r>=i)return 0;if(a>=u)return-1;if(r>=i)return 1;if(this===t)return 0;for(var c=(u>>>=0)-(a>>>=0),l=(i>>>=0)-(r>>>=0),p=Math.min(c,l),d=this.slice(a,u),y=t.slice(r,i),h=0;h<p;++h)if(d[h]!==y[h]){c=d[h],l=y[h];break}return c<l?-1:l<c?1:0},Buffer.prototype.includes=function includes(t,r,i){return-1!==this.indexOf(t,r,i)},Buffer.prototype.indexOf=function indexOf(t,r,i){return bidirectionalIndexOf(this,t,r,i,!0)},Buffer.prototype.lastIndexOf=function lastIndexOf(t,r,i){return bidirectionalIndexOf(this,t,r,i,!1)},Buffer.prototype.write=function write(t,r,i,a){if(void 0===r)a="utf8",i=this.length,r=0;else if(void 0===i&&"string"==typeof r)a=r,i=this.length,r=0;else{if(!isFinite(r))throw new Error("Buffer.write(string, encoding, offset[, length]) is no longer supported");r|=0,isFinite(i)?(i|=0,void 0===a&&(a="utf8")):(a=i,i=void 0)}var u=this.length-r;if((void 0===i||i>u)&&(i=u),t.length>0&&(i<0||r<0)||r>this.length)throw new RangeError("Attempt to write outside buffer bounds");a||(a="utf8");for(var c=!1;;)switch(a){case"hex":return hexWrite(this,t,r,i);case"utf8":case"utf-8":return utf8Write(this,t,r,i);case"ascii":return asciiWrite(this,t,r,i);case"latin1":case"binary":return latin1Write(this,t,r,i);case"base64":return base64Write(this,t,r,i);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return ucs2Write(this,t,r,i);default:if(c)throw new TypeError("Unknown encoding: "+a);a=(""+a).toLowerCase(),c=!0}},Buffer.prototype.toJSON=function toJSON(){return{type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}};function asciiSlice(t,r,i){var a="";i=Math.min(t.length,i);for(var u=r;u<i;++u)a+=String.fromCharCode(127&t[u]);return a}function latin1Slice(t,r,i){var a="";i=Math.min(t.length,i);for(var u=r;u<i;++u)a+=String.fromCharCode(t[u]);return a}function hexSlice(t,r,i){var a=t.length;(!r||r<0)&&(r=0),(!i||i<0||i>a)&&(i=a);for(var u="",c=r;c<i;++c)u+=toHex(t[c]);return u}function utf16leSlice(t,r,i){for(var a=t.slice(r,i),u="",c=0;c<a.length;c+=2)u+=String.fromCharCode(a[c]+256*a[c+1]);return u}function checkOffset(t,r,i){if(t%1!=0||t<0)throw new RangeError("offset is not uint");if(t+r>i)throw new RangeError("Trying to access beyond buffer length")}function checkInt(t,r,i,a,u,c){if(!Buffer.isBuffer(t))throw new TypeError('"buffer" argument must be a Buffer instance');if(r>u||r<c)throw new RangeError('"value" argument is out of bounds');if(i+a>t.length)throw new RangeError("Index out of range")}function objectWriteUInt16(t,r,i,a){r<0&&(r=65535+r+1);for(var u=0,c=Math.min(t.length-i,2);u<c;++u)t[i+u]=(r&255<<8*(a?u:1-u))>>>8*(a?u:1-u)}function objectWriteUInt32(t,r,i,a){r<0&&(r=4294967295+r+1);for(var u=0,c=Math.min(t.length-i,4);u<c;++u)t[i+u]=r>>>8*(a?u:3-u)&255}function checkIEEE754(t,r,i,a,u,c){if(i+a>t.length)throw new RangeError("Index out of range");if(i<0)throw new RangeError("Index out of range")}function writeFloat(t,r,i,a,c){return c||checkIEEE754(t,0,i,4),u.write(t,r,i,a,23,4),i+4}function writeDouble(t,r,i,a,c){return c||checkIEEE754(t,0,i,8),u.write(t,r,i,a,52,8),i+8}Buffer.prototype.slice=function slice(t,r){var i,a=this.length;if((t=~~t)<0?(t+=a)<0&&(t=0):t>a&&(t=a),(r=void 0===r?a:~~r)<0?(r+=a)<0&&(r=0):r>a&&(r=a),r<t&&(r=t),Buffer.TYPED_ARRAY_SUPPORT)(i=this.subarray(t,r)).__proto__=Buffer.prototype;else{var u=r-t;i=new Buffer(u,void 0);for(var c=0;c<u;++c)i[c]=this[c+t]}return i},Buffer.prototype.readUIntLE=function readUIntLE(t,r,i){t|=0,r|=0,i||checkOffset(t,r,this.length);for(var a=this[t],u=1,c=0;++c<r&&(u*=256);)a+=this[t+c]*u;return a},Buffer.prototype.readUIntBE=function readUIntBE(t,r,i){t|=0,r|=0,i||checkOffset(t,r,this.length);for(var a=this[t+--r],u=1;r>0&&(u*=256);)a+=this[t+--r]*u;return a},Buffer.prototype.readUInt8=function readUInt8(t,r){return r||checkOffset(t,1,this.length),this[t]},Buffer.prototype.readUInt16LE=function readUInt16LE(t,r){return r||checkOffset(t,2,this.length),this[t]|this[t+1]<<8},Buffer.prototype.readUInt16BE=function readUInt16BE(t,r){return r||checkOffset(t,2,this.length),this[t]<<8|this[t+1]},Buffer.prototype.readUInt32LE=function readUInt32LE(t,r){return r||checkOffset(t,4,this.length),(this[t]|this[t+1]<<8|this[t+2]<<16)+16777216*this[t+3]},Buffer.prototype.readUInt32BE=function readUInt32BE(t,r){return r||checkOffset(t,4,this.length),16777216*this[t]+(this[t+1]<<16|this[t+2]<<8|this[t+3])},Buffer.prototype.readIntLE=function readIntLE(t,r,i){t|=0,r|=0,i||checkOffset(t,r,this.length);for(var a=this[t],u=1,c=0;++c<r&&(u*=256);)a+=this[t+c]*u;return a>=(u*=128)&&(a-=Math.pow(2,8*r)),a},Buffer.prototype.readIntBE=function readIntBE(t,r,i){t|=0,r|=0,i||checkOffset(t,r,this.length);for(var a=r,u=1,c=this[t+--a];a>0&&(u*=256);)c+=this[t+--a]*u;return c>=(u*=128)&&(c-=Math.pow(2,8*r)),c},Buffer.prototype.readInt8=function readInt8(t,r){return r||checkOffset(t,1,this.length),128&this[t]?-1*(255-this[t]+1):this[t]},Buffer.prototype.readInt16LE=function readInt16LE(t,r){r||checkOffset(t,2,this.length);var i=this[t]|this[t+1]<<8;return 32768&i?4294901760|i:i},Buffer.prototype.readInt16BE=function readInt16BE(t,r){r||checkOffset(t,2,this.length);var i=this[t+1]|this[t]<<8;return 32768&i?4294901760|i:i},Buffer.prototype.readInt32LE=function readInt32LE(t,r){return r||checkOffset(t,4,this.length),this[t]|this[t+1]<<8|this[t+2]<<16|this[t+3]<<24},Buffer.prototype.readInt32BE=function readInt32BE(t,r){return r||checkOffset(t,4,this.length),this[t]<<24|this[t+1]<<16|this[t+2]<<8|this[t+3]},Buffer.prototype.readFloatLE=function readFloatLE(t,r){return r||checkOffset(t,4,this.length),u.read(this,t,!0,23,4)},Buffer.prototype.readFloatBE=function readFloatBE(t,r){return r||checkOffset(t,4,this.length),u.read(this,t,!1,23,4)},Buffer.prototype.readDoubleLE=function readDoubleLE(t,r){return r||checkOffset(t,8,this.length),u.read(this,t,!0,52,8)},Buffer.prototype.readDoubleBE=function readDoubleBE(t,r){return r||checkOffset(t,8,this.length),u.read(this,t,!1,52,8)},Buffer.prototype.writeUIntLE=function writeUIntLE(t,r,i,a){(t=+t,r|=0,i|=0,a)||checkInt(this,t,r,i,Math.pow(2,8*i)-1,0);var u=1,c=0;for(this[r]=255&t;++c<i&&(u*=256);)this[r+c]=t/u&255;return r+i},Buffer.prototype.writeUIntBE=function writeUIntBE(t,r,i,a){(t=+t,r|=0,i|=0,a)||checkInt(this,t,r,i,Math.pow(2,8*i)-1,0);var u=i-1,c=1;for(this[r+u]=255&t;--u>=0&&(c*=256);)this[r+u]=t/c&255;return r+i},Buffer.prototype.writeUInt8=function writeUInt8(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,1,255,0),Buffer.TYPED_ARRAY_SUPPORT||(t=Math.floor(t)),this[r]=255&t,r+1},Buffer.prototype.writeUInt16LE=function writeUInt16LE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,2,65535,0),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=255&t,this[r+1]=t>>>8):objectWriteUInt16(this,t,r,!0),r+2},Buffer.prototype.writeUInt16BE=function writeUInt16BE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,2,65535,0),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=t>>>8,this[r+1]=255&t):objectWriteUInt16(this,t,r,!1),r+2},Buffer.prototype.writeUInt32LE=function writeUInt32LE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,4,4294967295,0),Buffer.TYPED_ARRAY_SUPPORT?(this[r+3]=t>>>24,this[r+2]=t>>>16,this[r+1]=t>>>8,this[r]=255&t):objectWriteUInt32(this,t,r,!0),r+4},Buffer.prototype.writeUInt32BE=function writeUInt32BE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,4,4294967295,0),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=t>>>24,this[r+1]=t>>>16,this[r+2]=t>>>8,this[r+3]=255&t):objectWriteUInt32(this,t,r,!1),r+4},Buffer.prototype.writeIntLE=function writeIntLE(t,r,i,a){if(t=+t,r|=0,!a){var u=Math.pow(2,8*i-1);checkInt(this,t,r,i,u-1,-u)}var c=0,l=1,p=0;for(this[r]=255&t;++c<i&&(l*=256);)t<0&&0===p&&0!==this[r+c-1]&&(p=1),this[r+c]=(t/l>>0)-p&255;return r+i},Buffer.prototype.writeIntBE=function writeIntBE(t,r,i,a){if(t=+t,r|=0,!a){var u=Math.pow(2,8*i-1);checkInt(this,t,r,i,u-1,-u)}var c=i-1,l=1,p=0;for(this[r+c]=255&t;--c>=0&&(l*=256);)t<0&&0===p&&0!==this[r+c+1]&&(p=1),this[r+c]=(t/l>>0)-p&255;return r+i},Buffer.prototype.writeInt8=function writeInt8(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,1,127,-128),Buffer.TYPED_ARRAY_SUPPORT||(t=Math.floor(t)),t<0&&(t=255+t+1),this[r]=255&t,r+1},Buffer.prototype.writeInt16LE=function writeInt16LE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,2,32767,-32768),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=255&t,this[r+1]=t>>>8):objectWriteUInt16(this,t,r,!0),r+2},Buffer.prototype.writeInt16BE=function writeInt16BE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,2,32767,-32768),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=t>>>8,this[r+1]=255&t):objectWriteUInt16(this,t,r,!1),r+2},Buffer.prototype.writeInt32LE=function writeInt32LE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,4,2147483647,-2147483648),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=255&t,this[r+1]=t>>>8,this[r+2]=t>>>16,this[r+3]=t>>>24):objectWriteUInt32(this,t,r,!0),r+4},Buffer.prototype.writeInt32BE=function writeInt32BE(t,r,i){return t=+t,r|=0,i||checkInt(this,t,r,4,2147483647,-2147483648),t<0&&(t=4294967295+t+1),Buffer.TYPED_ARRAY_SUPPORT?(this[r]=t>>>24,this[r+1]=t>>>16,this[r+2]=t>>>8,this[r+3]=255&t):objectWriteUInt32(this,t,r,!1),r+4},Buffer.prototype.writeFloatLE=function writeFloatLE(t,r,i){return writeFloat(this,t,r,!0,i)},Buffer.prototype.writeFloatBE=function writeFloatBE(t,r,i){return writeFloat(this,t,r,!1,i)},Buffer.prototype.writeDoubleLE=function writeDoubleLE(t,r,i){return writeDouble(this,t,r,!0,i)},Buffer.prototype.writeDoubleBE=function writeDoubleBE(t,r,i){return writeDouble(this,t,r,!1,i)},Buffer.prototype.copy=function copy(t,r,i,a){if(i||(i=0),a||0===a||(a=this.length),r>=t.length&&(r=t.length),r||(r=0),a>0&&a<i&&(a=i),a===i)return 0;if(0===t.length||0===this.length)return 0;if(r<0)throw new RangeError("targetStart out of bounds");if(i<0||i>=this.length)throw new RangeError("sourceStart out of bounds");if(a<0)throw new RangeError("sourceEnd out of bounds");a>this.length&&(a=this.length),t.length-r<a-i&&(a=t.length-r+i);var u,c=a-i;if(this===t&&i<r&&r<a)for(u=c-1;u>=0;--u)t[u+r]=this[u+i];else if(c<1e3||!Buffer.TYPED_ARRAY_SUPPORT)for(u=0;u<c;++u)t[u+r]=this[u+i];else Uint8Array.prototype.set.call(t,this.subarray(i,i+c),r);return c},Buffer.prototype.fill=function fill(t,r,i,a){if("string"==typeof t){if("string"==typeof r?(a=r,r=0,i=this.length):"string"==typeof i&&(a=i,i=this.length),1===t.length){var u=t.charCodeAt(0);u<256&&(t=u)}if(void 0!==a&&"string"!=typeof a)throw new TypeError("encoding must be a string");if("string"==typeof a&&!Buffer.isEncoding(a))throw new TypeError("Unknown encoding: "+a)}else"number"==typeof t&&(t&=255);if(r<0||this.length<r||this.length<i)throw new RangeError("Out of range index");if(i<=r)return this;var c;if(r>>>=0,i=void 0===i?this.length:i>>>0,t||(t=0),"number"==typeof t)for(c=r;c<i;++c)this[c]=t;else{var l=Buffer.isBuffer(t)?t:utf8ToBytes(new Buffer(t,a).toString()),p=l.length;for(c=0;c<i-r;++c)this[c+r]=l[c%p]}return this};var l=/[^+\/0-9A-Za-z-_]/g;function toHex(t){return t<16?"0"+t.toString(16):t.toString(16)}function utf8ToBytes(t,r){var i;r=r||1/0;for(var a=t.length,u=null,c=[],l=0;l<a;++l){if((i=t.charCodeAt(l))>55295&&i<57344){if(!u){if(i>56319){(r-=3)>-1&&c.push(239,191,189);continue}if(l+1===a){(r-=3)>-1&&c.push(239,191,189);continue}u=i;continue}if(i<56320){(r-=3)>-1&&c.push(239,191,189),u=i;continue}i=65536+(u-55296<<10|i-56320)}else u&&(r-=3)>-1&&c.push(239,191,189);if(u=null,i<128){if((r-=1)<0)break;c.push(i)}else if(i<2048){if((r-=2)<0)break;c.push(i>>6|192,63&i|128)}else if(i<65536){if((r-=3)<0)break;c.push(i>>12|224,i>>6&63|128,63&i|128)}else{if(!(i<1114112))throw new Error("Invalid code point");if((r-=4)<0)break;c.push(i>>18|240,i>>12&63|128,i>>6&63|128,63&i|128)}}return c}function base64ToBytes(t){return a.toByteArray(function base64clean(t){if((t=function stringtrim(t){return t.trim?t.trim():t.replace(/^\s+|\s+$/g,"")}(t).replace(l,"")).length<2)return"";for(;t.length%4!=0;)t+="=";return t}(t))}function blitBuffer(t,r,i,a){for(var u=0;u<a&&!(u+i>=r.length||u>=t.length);++u)r[u+i]=t[u];return u}}).call(this,i(62))},function(t,r,i){r.byteLength=function byteLength(t){var r=getLens(t),i=r[0],a=r[1];return 3*(i+a)/4-a},r.toByteArray=function toByteArray(t){var r,i,a=getLens(t),l=a[0],p=a[1],d=new c(function _byteLength(t,r,i){return 3*(r+i)/4-i}(0,l,p)),y=0,h=p>0?l-4:l;for(i=0;i<h;i+=4)r=u[t.charCodeAt(i)]<<18|u[t.charCodeAt(i+1)]<<12|u[t.charCodeAt(i+2)]<<6|u[t.charCodeAt(i+3)],d[y++]=r>>16&255,d[y++]=r>>8&255,d[y++]=255&r;2===p&&(r=u[t.charCodeAt(i)]<<2|u[t.charCodeAt(i+1)]>>4,d[y++]=255&r);1===p&&(r=u[t.charCodeAt(i)]<<10|u[t.charCodeAt(i+1)]<<4|u[t.charCodeAt(i+2)]>>2,d[y++]=r>>8&255,d[y++]=255&r);return d},r.fromByteArray=function fromByteArray(t){for(var r,i=t.length,u=i%3,c=[],l=0,p=i-u;l<p;l+=16383)c.push(encodeChunk(t,l,l+16383>p?p:l+16383));1===u?(r=t[i-1],c.push(a[r>>2]+a[r<<4&63]+"==")):2===u&&(r=(t[i-2]<<8)+t[i-1],c.push(a[r>>10]+a[r>>4&63]+a[r<<2&63]+"="));return c.join("")};for(var a=[],u=[],c="undefined"!=typeof Uint8Array?Uint8Array:Array,l="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",p=0,d=l.length;p<d;++p)a[p]=l[p],u[l.charCodeAt(p)]=p;function getLens(t){var r=t.length;if(r%4>0)throw new Error("Invalid string. Length must be a multiple of 4");var i=t.indexOf("=");return-1===i&&(i=r),[i,i===r?0:4-i%4]}function encodeChunk(t,r,i){for(var u,c,l=[],p=r;p<i;p+=3)u=(t[p]<<16&16711680)+(t[p+1]<<8&65280)+(255&t[p+2]),l.push(a[(c=u)>>18&63]+a[c>>12&63]+a[c>>6&63]+a[63&c]);return l.join("")}u["-".charCodeAt(0)]=62,u["_".charCodeAt(0)]=63},function(t,r){r.read=function(t,r,i,a,u){var c,l,p=8*u-a-1,d=(1<<p)-1,y=d>>1,h=-7,g=i?u-1:0,v=i?-1:1,m=t[r+g];for(g+=v,c=m&(1<<-h)-1,m>>=-h,h+=p;h>0;c=256*c+t[r+g],g+=v,h-=8);for(l=c&(1<<-h)-1,c>>=-h,h+=a;h>0;l=256*l+t[r+g],g+=v,h-=8);if(0===c)c=1-y;else{if(c===d)return l?NaN:1/0*(m?-1:1);l+=Math.pow(2,a),c-=y}return(m?-1:1)*l*Math.pow(2,c-a)},r.write=function(t,r,i,a,u,c){var l,p,d,y=8*c-u-1,h=(1<<y)-1,g=h>>1,v=23===u?Math.pow(2,-24)-Math.pow(2,-77):0,m=a?0:c-1,b=a?1:-1,_=r<0||0===r&&1/r<0?1:0;for(r=Math.abs(r),isNaN(r)||r===1/0?(p=isNaN(r)?1:0,l=h):(l=Math.floor(Math.log(r)/Math.LN2),r*(d=Math.pow(2,-l))<1&&(l--,d*=2),(r+=l+g>=1?v/d:v*Math.pow(2,1-g))*d>=2&&(l++,d/=2),l+g>=h?(p=0,l=h):l+g>=1?(p=(r*d-1)*Math.pow(2,u),l+=g):(p=r*Math.pow(2,g-1)*Math.pow(2,u),l=0));u>=8;t[i+m]=255&p,m+=b,p/=256,u-=8);for(l=l<<u|p,y+=u;y>0;t[i+m]=255&l,m+=b,l/=256,y-=8);t[i+m-b]|=128*_}},function(t,r){var i={}.toString;t.exports=Array.isArray||function(t){return"[object Array]"==i.call(t)}},function(t,r,i){var a=i(86);t.exports=function _arrayWithoutHoles(t){if(Array.isArray(t))return a(t)}},function(t,r){t.exports=function _iterableToArray(t){if("undefined"!=typeof Symbol&&Symbol.iterator in Object(t))return Array.from(t)}},function(t,r){t.exports=function _nonIterableSpread(){throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(23)),c=a(i(25)),l=a(i(8)),p=a(i(9)),d=a(i(1)),y=a(i(2)),h=a(i(5)),g=a(i(6)),v=a(i(3)),m=i(18),b=a(i(251)),_=i(10),w=i(24),x=a(i(252));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,v.default)(t);if(r){var u=(0,v.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,g.default)(this,i)}}var S=function(t){(0,h.default)(VoteProxyService,t);var r,i,a,g=_createSuper(VoteProxyService);function VoteProxyService(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"voteProxy";return(0,d.default)(this,VoteProxyService),g.call(this,t,["smartContract","chief"])}return(0,y.default)(VoteProxyService,[{key:"lock",value:function lock(t,r){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:_.MKR,a=(0,w.getCurrency)(r,i).toFixed("wei");return this._proxyContract(t).lock(a)}},{key:"free",value:function free(t,r){var i=arguments.length>2&&void 0!==arguments[2]?arguments[2]:_.MKR,a=(0,w.getCurrency)(r,i).toFixed("wei");return this._proxyContract(t).free(a)}},{key:"freeAll",value:function freeAll(t){return this._proxyContract(t).freeAll()}},{key:"voteExec",value:function voteExec(t,r){return Array.isArray(r)?this._proxyContract(t)["vote(address[])"](r):this._proxyContract(t)["vote(bytes32)"](r)}},{key:"getVotedProposalAddresses",value:(a=(0,p.default)(l.default.mark((function _callee(t){var r;return l.default.wrap((function _callee$(i){for(;;)switch(i.prev=i.next){case 0:return i.next=2,this.get("chief").getVotedSlate(t);case 2:return r=i.sent,i.abrupt("return",this.get("chief").getSlateAddresses(r));case 4:case"end":return i.stop()}}),_callee,this)}))),function getVotedProposalAddresses(t){return a.apply(this,arguments)})},{key:"getVoteProxy",value:(i=(0,p.default)(l.default.mark((function _callee2(t){var r,i,a,u,p,d,y;return l.default.wrap((function _callee2$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,this._getProxyStatus(t);case 2:if(i=l.sent,a=i.hasProxy,u=i.role,p=i.address,a){l.next=8;break}return l.abrupt("return",{hasProxy:a,voteProxy:null});case 8:return d="hot"===u?"cold":"hot",l.next=11,this._getAddressOfRole(p,d);case 11:return y=l.sent,l.abrupt("return",{hasProxy:a,voteProxy:new b.default((r={voteProxyService:this,proxyAddress:p},(0,c.default)(r,"".concat(u,"Address"),t),(0,c.default)(r,"".concat(d,"Address"),y),r))});case 13:case"end":return l.stop()}}),_callee2,this)}))),function getVoteProxy(t){return i.apply(this,arguments)})},{key:"_proxyContract",value:function _proxyContract(t){return this.get("smartContract").getContractByAddressAndAbi(t,x.default)}},{key:"_proxyFactoryContract",value:function _proxyFactoryContract(){return this.get("smartContract").getContractByName(_.VOTE_PROXY_FACTORY)}},{key:"_getProxyStatus",value:(r=(0,p.default)(l.default.mark((function _callee3(t){var r,i,a,c;return l.default.wrap((function _callee3$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,Promise.all([this._proxyFactoryContract().coldMap(t),this._proxyFactoryContract().hotMap(t)]);case 2:if(r=l.sent,i=(0,u.default)(r,2),a=i[0],c=i[1],a===_.ZERO_ADDRESS){l.next=8;break}return l.abrupt("return",{role:"cold",address:a,hasProxy:!0});case 8:if(c===_.ZERO_ADDRESS){l.next=10;break}return l.abrupt("return",{role:"hot",address:c,hasProxy:!0});case 10:return l.abrupt("return",{role:null,address:"",hasProxy:!1});case 11:case"end":return l.stop()}}),_callee3,this)}))),function _getProxyStatus(t){return r.apply(this,arguments)})},{key:"_getAddressOfRole",value:function _getAddressOfRole(t,r){return"hot"===r?this._proxyContract(t).hot():"cold"===r?this._proxyContract(t).cold():null}}]),VoteProxyService}(m.LocalService);r.default=S,Object.assign(S.prototype,["getVotedSlate","getNumDeposits"].reduce((function(t,r){return t[r]=function(){var t;return(t=this.get("chief"))[r].apply(t,arguments)},t}),{}))},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(2)),l=function(){function VoteProxy(t){var r=t.voteProxyService,i=t.proxyAddress,a=t.coldAddress,c=t.hotAddress;(0,u.default)(this,VoteProxy),this._voteProxyService=r,this._proxyAddress=i,this._coldAddress=a,this._hotAddress=c}return(0,c.default)(VoteProxy,[{key:"getProxyAddress",value:function getProxyAddress(){return this._proxyAddress}},{key:"getColdAddress",value:function getColdAddress(){return this._coldAddress}},{key:"getHotAddress",value:function getHotAddress(){return this._hotAddress}}]),VoteProxy}();r.default=l;Object.assign(l.prototype,["lock","free","voteExec","getNumDeposits","getVotedProposalAddresses"].reduce((function(t,r){return t[r]=function(){for(var t,i=arguments.length,a=new Array(i),u=0;u<i;u++)a[u]=arguments[u];return(t=this._voteProxyService)[r].apply(t,[this._proxyAddress].concat(a))},t}),{}))},function(t){t.exports=JSON.parse('[{"constant":true,"inputs":[],"name":"gov","outputs":[{"name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"cold","outputs":[{"name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"freeAll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"iou","outputs":[{"name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"name":"slate","type":"bytes32"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"wad","type":"uint256"}],"name":"free","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"wad","type":"uint256"}],"name":"lock","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"hot","outputs":[{"name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"name":"yays","type":"address[]"}],"name":"vote","outputs":[{"name":"","type":"bytes32"}],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"chief","outputs":[{"name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"inputs":[{"name":"_chief","type":"address"},{"name":"_cold","type":"address"},{"name":"_hot","type":"address"}],"payable":false,"stateMutability":"nonpayable","type":"constructor"}]')},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(1)),c=a(i(2)),l=a(i(5)),p=a(i(6)),d=a(i(3)),y=i(18),h=i(10),g=a(i(254));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,d.default)(t);if(r){var u=(0,d.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,p.default)(this,i)}}var v=function(t){(0,l.default)(VoteProxyFactoryService,t);var r=_createSuper(VoteProxyFactoryService);function VoteProxyFactoryService(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"voteProxyFactory";return(0,u.default)(this,VoteProxyFactoryService),r.call(this,t,["smartContract","voteProxy","transactionManager"])}return(0,c.default)(VoteProxyFactoryService,[{key:"initiateLink",value:function initiateLink(t){return this._proxyFactoryContract().initiateLink(t)}},{key:"approveLink",value:function approveLink(t){return new g.default(this._proxyFactoryContract(),this.get("transactionManager")).build("approveLink",[t])}},{key:"breakLink",value:function breakLink(){return this._proxyFactoryContract().breakLink()}},{key:"getVoteProxy",value:function getVoteProxy(t){return this.get("voteProxy").getVoteProxy(t)}},{key:"_proxyFactoryContract",value:function _proxyFactoryContract(){return this.get("smartContract").getContractByName(h.VOTE_PROXY_FACTORY)}}]),VoteProxyFactoryService}(y.LocalService);r.default=v},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(8)),c=a(i(64)),l=a(i(9)),p=a(i(1)),d=a(i(2)),y=function(){function ApproveLinkTransaction(t,r){(0,p.default)(this,ApproveLinkTransaction),this._contract=t,this._txMgr=r}return(0,d.default)(ApproveLinkTransaction,[{key:"build",value:function build(t,r){var i=this,a=(0,l.default)(u.default.mark((function _callee(){var l,p;return u.default.wrap((function _callee$(u){for(;;)switch(u.prev=u.next){case 0:return u.next=2,0;case 2:return u.next=4,(l=i._contract)[t].apply(l,[].concat((0,c.default)(r),[{promise:a}]));case 4:return p=u.sent,i._parseLogs(p.receipt.logs),u.abrupt("return",i);case 7:case"end":return u.stop()}}),_callee)})))();return this.promise=a,a}},{key:"_parseLogs",value:function _parseLogs(t){var r=this._contract.interface.events.LinkConfirmed,i=this._txMgr.get("web3")._web3,a=i.utils.keccak256(i.utils.toHex(r.signature)),u=t.filter((function(t){return t.topics[0].toLowerCase()===a.toLowerCase()})),c=r.parse(u[0].topics,u[0].data);this.proxyAddress=c.voteProxy}},{key:"fees",get:function get(){return this._txMgr.getTransaction(this.promise).fees()}},{key:"timeStamp",get:function get(){return this._txMgr.getTransaction(this.promise).timeStamp()}},{key:"timeStampSubmitted",get:function get(){return this._txMgr.getTransaction(this.promise).timeStampSubmitted()}}]),ApproveLinkTransaction}();r.default=y},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(15)),c=a(i(23)),l=a(i(25)),p=a(i(8)),d=a(i(9)),y=a(i(1)),h=a(i(2)),g=a(i(5)),v=a(i(6)),m=a(i(3)),b=i(18),_=i(10),w=a(i(101)),x=i(24);function ownKeys(t,r){var i=Object.keys(t);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(t);r&&(a=a.filter((function(r){return Object.getOwnPropertyDescriptor(t,r).enumerable}))),i.push.apply(i,a)}return i}function _objectSpread(t){for(var r=1;r<arguments.length;r++){var i=null!=arguments[r]?arguments[r]:{};r%2?ownKeys(Object(i),!0).forEach((function(r){(0,l.default)(t,r,i[r])})):Object.getOwnPropertyDescriptors?Object.defineProperties(t,Object.getOwnPropertyDescriptors(i)):ownKeys(Object(i)).forEach((function(r){Object.defineProperty(t,r,Object.getOwnPropertyDescriptor(i,r))}))}return t}function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,m.default)(t);if(r){var u=(0,m.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,v.default)(this,i)}}var S=function(t){(0,g.default)(GovPollingService,t);var r,i,a,l,v,m,b,S,O,E,k,A,N,T,P,C=_createSuper(GovPollingService);function GovPollingService(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"govPolling";return(0,y.default)(this,GovPollingService),C.call(this,t,["smartContract","govQueryApi","token"])}return(0,h.default)(GovPollingService,[{key:"createPoll",value:(P=(0,d.default)(p.default.mark((function _callee(t,r,i,a){var u,c;return p.default.wrap((function _callee$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,this._pollingContract().createPoll(t,r,i,a);case 2:return u=l.sent,c=parseInt(u.receipt.logs[0].topics[2]),l.abrupt("return",c);case 5:case"end":return l.stop()}}),_callee,this)}))),function createPoll(t,r,i,a){return P.apply(this,arguments)})},{key:"withdrawPoll",value:function withdrawPoll(t){return this._pollingContract().withdrawPoll(t)}},{key:"vote",value:function vote(t,r){if(t.length!==r.length||0===t.length)throw new Error("poll id array and option id array must be the same length and have a non-zero number of elements");if(1===t.length){return this._batchPollingContract()["vote(uint256,uint256)"](t[0],r[0])}return this._batchPollingContract()["vote(uint256[],uint256[])"](t,r)}},{key:"voteRankedChoice",value:function voteRankedChoice(t,r){var i=new Uint8Array(32);r.forEach((function(t,r){i[i.length-r-1]=t+1}));var a=(0,x.fromBuffer)(i).toString();return this._batchPollingContract().vote(t,a)}},{key:"_pollingContract",value:function _pollingContract(){return this.get("smartContract").getContractByName(_.POLLING)}},{key:"_batchPollingContract",value:function _batchPollingContract(){return this.get("smartContract").getContractByName(_.BATCH_POLLING)}},{key:"getPoll",value:(T=(0,d.default)(p.default.mark((function _callee2(t){var r,i,a,u,c;return p.default.wrap((function _callee2$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,this.getAllWhitelistedPolls();case 2:for(r=l.sent,i=r.filter((function(r){return r.multiHash===t})),a=1/0,c=0;c<i.length;c++)i[c].pollId<a&&(a=i[c].pollId,u=i[c]);return l.abrupt("return",u);case 7:case"end":return l.stop()}}),_callee2,this)}))),function getPoll(t){return T.apply(this,arguments)})},{key:"_getPoll",value:(N=(0,d.default)(p.default.mark((function _callee3(t){var r;return p.default.wrap((function _callee3$(i){for(;;)switch(i.prev=i.next){case 0:return i.next=2,this.getAllWhitelistedPolls();case 2:return r=i.sent,i.abrupt("return",r.find((function(r){return parseInt(r.pollId)===parseInt(t)})));case 4:case"end":return i.stop()}}),_callee3,this)}))),function _getPoll(t){return N.apply(this,arguments)})},{key:"getAllWhitelistedPolls",value:(A=(0,d.default)(p.default.mark((function _callee4(){return p.default.wrap((function _callee4$(t){for(;;)switch(t.prev=t.next){case 0:if(!this.polls){t.next=2;break}return t.abrupt("return",this.polls);case 2:return t.next=4,this.get("govQueryApi").getAllWhitelistedPolls();case 4:return this.polls=t.sent,t.abrupt("return",this.polls);case 6:case"end":return t.stop()}}),_callee4,this)}))),function getAllWhitelistedPolls(){return A.apply(this,arguments)})},{key:"refresh",value:function refresh(){this.polls=null}},{key:"getOptionVotingFor",value:(k=(0,d.default)(p.default.mark((function _callee5(t,r){return p.default.wrap((function _callee5$(i){for(;;)switch(i.prev=i.next){case 0:return i.abrupt("return",this.get("govQueryApi").getOptionVotingFor(t.toLowerCase(),r));case 1:case"end":return i.stop()}}),_callee5,this)}))),function getOptionVotingFor(t,r){return k.apply(this,arguments)})},{key:"getOptionVotingForRankedChoice",value:(E=(0,d.default)(p.default.mark((function _callee6(t,r){var i,a,u;return p.default.wrap((function _callee6$(c){for(;;)switch(c.prev=c.next){case 0:return c.next=2,this.get("govQueryApi").getOptionVotingForRankedChoice(t.toLowerCase(),r);case 2:if(i=c.sent){c.next=5;break}return c.abrupt("return",[]);case 5:return a=(0,x.toBuffer)(i,{endian:"little"}),u=(0,x.paddedArray)(32-a.length,a),c.abrupt("return",u.reverse().filter((function(t){return 0!==t&&"0"!==t})));case 8:case"end":return c.stop()}}),_callee6,this)}))),function getOptionVotingForRankedChoice(t,r){return E.apply(this,arguments)})},{key:"getAllOptionsVotingFor",value:(O=(0,d.default)(p.default.mark((function _callee7(t){var r;return p.default.wrap((function _callee7$(i){for(;;)switch(i.prev=i.next){case 0:return i.next=2,this.get("govQueryApi").getAllOptionsVotingFor(t.toLowerCase());case 2:if(r=i.sent){i.next=5;break}return i.abrupt("return",[]);case 5:return i.abrupt("return",r.map((function(t){var r=null;if(t.optionIdRaw){var i=(0,x.toBuffer)(t.optionIdRaw,{endian:"little"});r=(0,x.paddedArray)(32-i.length,i).reverse().filter((function(t){return 0!==t&&"0"!==t}))}return{pollId:t.pollId,option:t.optionId,rankedChoiceOption:r}})));case 6:case"end":return i.stop()}}),_callee7,this)}))),function getAllOptionsVotingFor(t){return O.apply(this,arguments)})},{key:"getNumUniqueVoters",value:(S=(0,d.default)(p.default.mark((function _callee8(t){return p.default.wrap((function _callee8$(r){for(;;)switch(r.prev=r.next){case 0:return r.abrupt("return",this.get("govQueryApi").getNumUniqueVoters(t));case 1:case"end":return r.stop()}}),_callee8,this)}))),function getNumUniqueVoters(t){return S.apply(this,arguments)})},{key:"getMkrWeight",value:(b=(0,d.default)(p.default.mark((function _callee9(t){var r;return p.default.wrap((function _callee9$(i){for(;;)switch(i.prev=i.next){case 0:return i.next=2,this.get("govQueryApi").getMkrWeight(t.toLowerCase(),2147483647);case 2:return r=i.sent,i.abrupt("return",(0,_.MKR)(r));case 4:case"end":return i.stop()}}),_callee9,this)}))),function getMkrWeight(t){return b.apply(this,arguments)})},{key:"getMkrAmtVoted",value:(m=(0,d.default)(p.default.mark((function _callee10(t){var r,i,a,u;return p.default.wrap((function _callee10$(c){for(;;)switch(c.prev=c.next){case 0:return c.next=2,this._getPoll(t);case 2:return r=c.sent,i=r.endDate,a=Math.floor(i/1e3),c.next=7,this.get("govQueryApi").getMkrSupport(t,a);case 7:return u=c.sent,c.abrupt("return",(0,_.MKR)(u.reduce((function(t,r){return t+r.mkrSupport}),0)));case 9:case"end":return c.stop()}}),_callee10,this)}))),function getMkrAmtVoted(t){return m.apply(this,arguments)})},{key:"getMkrAmtVotedRankedChoice",value:(v=(0,d.default)(p.default.mark((function _callee11(t){var r,i,a,u;return p.default.wrap((function _callee11$(c){for(;;)switch(c.prev=c.next){case 0:return c.next=2,this._getPoll(t);case 2:return r=c.sent,i=r.endDate,a=Math.floor(i/1e3),c.next=7,this.get("govQueryApi").getMkrSupportRankedChoice(t,a);case 7:return u=c.sent,c.abrupt("return",(0,_.MKR)(u.reduce((function(t,r){return t+parseFloat(r.mkrSupport)}),0)));case 9:case"end":return c.stop()}}),_callee11,this)}))),function getMkrAmtVotedRankedChoice(t){return v.apply(this,arguments)})},{key:"getTallyRankedChoiceIrv",value:(l=(0,d.default)(p.default.mark((function _callee12(t){var r,i,a,l,d,y,h,g,v;return p.default.wrap((function _callee12$(p){for(;;)switch(p.prev=p.next){case 0:return p.next=2,this._getPoll(t);case 2:return r=p.sent,i=r.endDate,a=Math.floor(i/1e3),p.next=7,this.get("govQueryApi").getMkrSupportRankedChoice(t,a);case 7:if(l=p.sent,d=l.reduce((function(t,r){return(0,w.default)(r.mkrSupport||0).plus(t)}),(0,w.default)(0)),y={rounds:1,winner:null,totalMkrParticipation:d,options:{}},h={firstChoice:(0,w.default)(0),transfer:(0,w.default)(0),winner:!1,eliminated:!1},0!==l.length){p.next=13;break}return p.abrupt("return",y);case 13:if(l.forEach((function(t){t.choice=t.ballot.pop(),y.options[t.choice]||(y.options[t.choice]=_objectSpread({},h)),y.options[t.choice].firstChoice=(0,w.default)(y.options[t.choice].firstChoice).plus(t.mkrSupport||0)})),Object.entries(y.options).forEach((function(t){var r=(0,c.default)(t,2),i=r[0];r[1].firstChoice.gt(d.div(2))&&(y.winner=i)})),!y.winner){p.next=18;break}return y.options[y.winner].winner=!0,p.abrupt("return",y);case 18:g=function _loop(){y.rounds++;var t=Object.entries(y.options).filter((function(t){return!(0,c.default)(t,2)[1].eliminated})),r=t.reduce((function(t,r){var i=(0,c.default)(t,2)[1],a=(0,c.default)(r,2)[1];return a.firstChoice.plus(a.transfer).lt(i.firstChoice.plus(i.transfer))?r:t})),i=(0,c.default)(r,1)[0];if(y.options[i].eliminated=!0,y.options[i].transfer=(0,w.default)(0),l.map((function(t,r){return _objectSpread(_objectSpread({},t),{},{index:r})})).filter((function(t){return parseInt(t.choice)===parseInt(i)})).filter((function(t){return 0!==t.ballot[t.ballot.length-1]})).forEach((function(t){l[t.index].choice=l[t.index].ballot.pop(),y.options[l[t.index].choice].transfer=(0,w.default)(y.options[l[t.index].choice].transfer).plus(t.mkrSupport||0)})),Object.entries(y.options).forEach((function(t){var r=(0,c.default)(t,2),i=r[0],a=r[1],u=a.firstChoice,l=a.transfer;u.plus(l).gt(d.div(2))&&(y.winner=i)})),y.rounds>32&&!y.winner||(1===t.length||0===t.length)&&!y.winner){var a,u=(0,w.default)(0);Object.entries(y.options).forEach((function(t){var r=(0,c.default)(t,2),i=r[0],l=r[1],p=l.firstChoice,d=l.transfer;p.plus(d).gt(u)&&(u=p.plus(d),a=i)})),y.winner=a}if(2===Object.keys(y.options).length)return{v:y};if(1===Object.keys(y.options).length)throw new Error("Invalid ranked choice tally ".concat(y.options))};case 19:if(y.winner){p.next=25;break}if(v=g(),"object"!==(0,u.default)(v)){p.next=23;break}return p.abrupt("return",v.v);case 23:p.next=19;break;case 25:return y.options[y.winner].winner=!0,p.abrupt("return",y);case 27:case"end":return p.stop()}}),_callee12,this)}))),function getTallyRankedChoiceIrv(t){return l.apply(this,arguments)})},{key:"getPercentageMkrVoted",value:(a=(0,d.default)(p.default.mark((function _callee13(t){var r,i,a,u;return p.default.wrap((function _callee13$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,Promise.all([this.getMkrAmtVoted(t),this.get("token").getToken(_.MKR).totalSupply()]);case 2:return r=l.sent,i=(0,c.default)(r,2),a=i[0],u=i[1],l.abrupt("return",a.div(u).times(100).toNumber());case 7:case"end":return l.stop()}}),_callee13,this)}))),function getPercentageMkrVoted(t){return a.apply(this,arguments)})},{key:"getPercentageMkrVotedRankedChoice",value:(i=(0,d.default)(p.default.mark((function _callee14(t){var r,i,a,u;return p.default.wrap((function _callee14$(l){for(;;)switch(l.prev=l.next){case 0:return l.next=2,Promise.all([this.getMkrAmtVotedRankedChoice(t),this.get("token").getToken(_.MKR).totalSupply()]);case 2:return r=l.sent,i=(0,c.default)(r,2),a=i[0],u=i[1],l.abrupt("return",a.div(u).times(100).toNumber());case 7:case"end":return l.stop()}}),_callee14,this)}))),function getPercentageMkrVotedRankedChoice(t){return i.apply(this,arguments)})},{key:"getWinningProposal",value:(r=(0,d.default)(p.default.mark((function _callee15(t){var r,i,a,u,c,l;return p.default.wrap((function _callee15$(p){for(;;)switch(p.prev=p.next){case 0:return p.next=2,this._getPoll(t);case 2:return r=p.sent,i=r.endDate,a=Math.floor(i/1e3),p.next=7,this.get("govQueryApi").getMkrSupport(t,a);case 7:for(u=p.sent,c=u[0],l=1;l<u.length;l++)u[l].mkrSupport>c.mkrSupport&&(c=u[l]);return p.abrupt("return",c?c.optionId:0);case 11:case"end":return p.stop()}}),_callee15,this)}))),function getWinningProposal(t){return r.apply(this,arguments)})}]),GovPollingService}(b.PrivateService);r.default=S},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(25)),c=a(i(8)),l=a(i(9)),p=a(i(1)),d=a(i(2)),y=a(i(5)),h=a(i(6)),g=a(i(3)),v=i(18),m=a(i(103)),b=i(24);function ownKeys(t,r){var i=Object.keys(t);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(t);r&&(a=a.filter((function(r){return Object.getOwnPropertyDescriptor(t,r).enumerable}))),i.push.apply(i,a)}return i}function _objectSpread(t){for(var r=1;r<arguments.length;r++){var i=null!=arguments[r]?arguments[r]:{};r%2?ownKeys(Object(i),!0).forEach((function(r){(0,u.default)(t,r,i[r])})):Object.getOwnPropertyDescriptors?Object.defineProperties(t,Object.getOwnPropertyDescriptors(i)):ownKeys(Object(i)).forEach((function(r){Object.defineProperty(t,r,Object.getOwnPropertyDescriptor(i,r))}))}return t}function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,g.default)(t);if(r){var u=(0,g.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,h.default)(this,i)}}var _=function(t){(0,y.default)(QueryApi,t);var r,i,a,u,h,g,v,_,w,x,S,O,E=_createSuper(QueryApi);function QueryApi(){var t,r=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"govQueryApi";return(0,p.default)(this,QueryApi),(t=E.call(this,r,["web3"])).queryPromises={},t.staging=!1,t}return(0,d.default)(QueryApi,[{key:"getQueryResponse",value:(O=(0,l.default)(c.default.mark((function _callee(t,r){var i,a,u;return c.default.wrap((function _callee$(c){for(;;)switch(c.prev=c.next){case 0:return c.next=2,fetch(t,{method:"POST",headers:{Accept:"application/json","Content-Type":"application/json"},body:JSON.stringify({query:r})});case 2:return i=c.sent,c.next=5,i.json();case 5:return a=c.sent,u=a.data,(0,m.default)(u,"error fetching data from ".concat(t)),c.abrupt("return",u);case 9:case"end":return c.stop()}}),_callee)}))),function getQueryResponse(t,r){return O.apply(this,arguments)})},{key:"getQueryResponseMemoized",value:(S=(0,l.default)(c.default.mark((function _callee2(t,r){var i;return c.default.wrap((function _callee2$(a){for(;;)switch(a.prev=a.next){case 0:if(i="".concat(t,";").concat(r),!this.queryPromises[i]){a.next=3;break}return a.abrupt("return",this.queryPromises[i]);case 3:return this.queryPromises[i]=this.getQueryResponse(t,r),a.abrupt("return",this.queryPromises[i]);case 5:case"end":return a.stop()}}),_callee2,this)}))),function getQueryResponseMemoized(t,r){return S.apply(this,arguments)})},{key:"initialize",value:function initialize(t){t.staging&&(this.staging=!0)}},{key:"connect",value:function connect(){var t=this.get("web3").network;this.serverUrl=this.staging?(0,b.netIdtoSpockUrlStaging)(t):(0,b.netIdtoSpockUrl)(t)}},{key:"getAllWhitelistedPolls",value:(x=(0,l.default)(c.default.mark((function _callee3(){var t;return c.default.wrap((function _callee3$(r){for(;;)switch(r.prev=r.next){case 0:return r.next=3,this.getQueryResponse(this.serverUrl,"{activePolls {\n      nodes {\n          creator\n          pollId\n          blockCreated\n          startDate\n          endDate\n          multiHash\n          url\n        }\n      }\n    }");case 3:return t=r.sent,r.abrupt("return",t.activePolls.nodes.map((function(t){return t.startDate=new Date(1e3*t.startDate),t.endDate=new Date(1e3*t.endDate),t})));case 5:case"end":return r.stop()}}),_callee3,this)}))),function getAllWhitelistedPolls(){return x.apply(this,arguments)})},{key:"getNumUniqueVoters",value:(w=(0,l.default)(c.default.mark((function _callee4(t){var r,i;return c.default.wrap((function _callee4$(a){for(;;)switch(a.prev=a.next){case 0:return r="{uniqueVoters(argPollId:".concat(t,"){\n      nodes\n    }\n    }"),a.next=3,this.getQueryResponse(this.serverUrl,r);case 3:return i=a.sent,a.abrupt("return",parseInt(i.uniqueVoters.nodes[0]));case 5:case"end":return a.stop()}}),_callee4,this)}))),function getNumUniqueVoters(t){return w.apply(this,arguments)})},{key:"getMkrWeight",value:(_=(0,l.default)(c.default.mark((function _callee5(t,r){var i,a;return c.default.wrap((function _callee5$(u){for(;;)switch(u.prev=u.next){case 0:return i='{totalMkrWeightProxyAndNoProxyByAddressAtTime(argAddress: "'.concat(t,'", argUnix: ').concat(r,"){\n      nodes {\n        address\n        weight\n      }\n    }\n    }"),u.next=3,this.getQueryResponse(this.serverUrl,i);case 3:if((a=u.sent).totalMkrWeightProxyAndNoProxyByAddressAtTime.nodes[0]){u.next=6;break}return u.abrupt("return",0);case 6:return u.abrupt("return",a.totalMkrWeightProxyAndNoProxyByAddressAtTime.nodes[0].weight);case 7:case"end":return u.stop()}}),_callee5,this)}))),function getMkrWeight(t,r){return _.apply(this,arguments)})},{key:"getOptionVotingFor",value:(v=(0,l.default)(c.default.mark((function _callee6(t,r){var i,a;return c.default.wrap((function _callee6$(u){for(;;)switch(u.prev=u.next){case 0:return i='{\n      currentVote(argAddress: "'.concat(t,'", argPollId: ').concat(r,"){\n        nodes{\n          optionId\n        }\n      }\n    }"),u.next=3,this.getQueryResponse(this.serverUrl,i);case 3:if((a=u.sent).currentVote.nodes[0]){u.next=6;break}return u.abrupt("return",null);case 6:return u.abrupt("return",a.currentVote.nodes[0].optionId);case 7:case"end":return u.stop()}}),_callee6,this)}))),function getOptionVotingFor(t,r){return v.apply(this,arguments)})},{key:"getAllOptionsVotingFor",value:(g=(0,l.default)(c.default.mark((function _callee7(t){var r,i;return c.default.wrap((function _callee7$(a){for(;;)switch(a.prev=a.next){case 0:return r='{\n      allCurrentVotes(argAddress: "'.concat(t,'"){\n        nodes{\n          pollId\n          optionId\n          optionIdRaw\n        }\n      }\n    }'),a.next=3,this.getQueryResponse(this.serverUrl,r);case 3:if((i=a.sent).allCurrentVotes.nodes[0]){a.next=6;break}return a.abrupt("return",null);case 6:return a.abrupt("return",i.allCurrentVotes.nodes);case 7:case"end":return a.stop()}}),_callee7,this)}))),function getAllOptionsVotingFor(t){return g.apply(this,arguments)})},{key:"getOptionVotingForRankedChoice",value:(h=(0,l.default)(c.default.mark((function _callee8(t,r){var i,a;return c.default.wrap((function _callee8$(u){for(;;)switch(u.prev=u.next){case 0:return i='{\n      currentVoteRankedChoice(argAddress: "'.concat(t,'", argPollId: ').concat(r,"){\n        nodes{\n          optionIdRaw\n        }\n      }\n    }"),u.next=3,this.getQueryResponse(this.serverUrl,i);case 3:if((a=u.sent).currentVoteRankedChoice.nodes[0]){u.next=6;break}return u.abrupt("return",null);case 6:return u.abrupt("return",a.currentVoteRankedChoice.nodes[0].optionIdRaw);case 7:case"end":return u.stop()}}),_callee8,this)}))),function getOptionVotingForRankedChoice(t,r){return h.apply(this,arguments)})},{key:"getBlockNumber",value:(u=(0,l.default)(c.default.mark((function _callee9(t){var r,i;return c.default.wrap((function _callee9$(a){for(;;)switch(a.prev=a.next){case 0:return r="{\n      timeToBlockNumber(argUnix: ".concat(t,"){\n      nodes\n    }\n    }"),a.next=3,this.getQueryResponseMemoized(this.serverUrl,r);case 3:return i=a.sent,a.abrupt("return",i.timeToBlockNumber.nodes[0]);case 5:case"end":return a.stop()}}),_callee9,this)}))),function getBlockNumber(t){return u.apply(this,arguments)})},{key:"getMkrSupportRankedChoice",value:(a=(0,l.default)(c.default.mark((function _callee10(t,r){var i,a;return c.default.wrap((function _callee10$(u){for(;;)switch(u.prev=u.next){case 0:return i="{voteMkrWeightsAtTimeRankedChoice(argPollId: ".concat(t,", argUnix: ").concat(r,"){\n      nodes{\n        optionIdRaw\n        mkrSupport\n      }\n    }\n    }"),u.next=3,this.getQueryResponseMemoized(this.serverUrl,i);case 3:return a=u.sent,u.abrupt("return",a.voteMkrWeightsAtTimeRankedChoice.nodes.filter((function(t){return"0"!==t.optionIdRaw})).map((function(t){var r=(0,b.toBuffer)(t.optionIdRaw,{endian:"little"}),i=(0,b.paddedArray)(32-r.length,r);return _objectSpread(_objectSpread({},t),{},{ballot:i})})));case 5:case"end":return u.stop()}}),_callee10,this)}))),function getMkrSupportRankedChoice(t,r){return a.apply(this,arguments)})},{key:"getMkrSupport",value:(i=(0,l.default)(c.default.mark((function _callee11(t,r){var i,a,u,l;return c.default.wrap((function _callee11$(c){for(;;)switch(c.prev=c.next){case 0:return i="{voteOptionMkrWeightsAtTime(argPollId: ".concat(t,", argUnix: ").concat(r,"){\n    nodes{\n      optionId\n      mkrSupport\n    }\n  }\n  }"),c.next=3,this.getQueryResponseMemoized(this.serverUrl,i);case 3:return a=c.sent,u=(u=a.voteOptionMkrWeightsAtTime.nodes).filter((function(t){return 0!==t.optionId})),l=u.reduce((function(t,r){return t+(isNaN(parseFloat(r.mkrSupport))?0:parseFloat(r.mkrSupport))}),0),c.abrupt("return",u.map((function(t){var r=isNaN(parseFloat(t.mkrSupport))?0:parseFloat(t.mkrSupport);return t.mkrSupport=r,t.percentage=100*r/l,t})));case 8:case"end":return c.stop()}}),_callee11,this)}))),function getMkrSupport(t,r){return i.apply(this,arguments)})},{key:"getEsmJoins",value:(r=(0,l.default)(c.default.mark((function _callee12(){var t,r;return c.default.wrap((function _callee12$(i){for(;;)switch(i.prev=i.next){case 0:return i.next=3,this.getQueryResponse(this.serverUrl,"{allEsmJoins {\n      nodes {\n        txFrom\n        txHash\n        joinAmount\n        blockTimestamp\n      }\n  }\n  }");case 3:return t=i.sent,r=t.allEsmJoins.nodes,i.abrupt("return",r);case 6:case"end":return i.stop()}}),_callee12,this)}))),function getEsmJoins(){return r.apply(this,arguments)})}]),QueryApi}(v.PublicService);r.default=_},function(t,r,i){var a=Object.getOwnPropertySymbols,u=Object.prototype.hasOwnProperty,c=Object.prototype.propertyIsEnumerable;function toObject(t){if(null==t)throw new TypeError("Object.assign cannot be called with null or undefined");return Object(t)}t.exports=function shouldUseNative(){try{if(!Object.assign)return!1;var t=new String("abc");if(t[5]="de","5"===Object.getOwnPropertyNames(t)[0])return!1;for(var r={},i=0;i<10;i++)r["_"+String.fromCharCode(i)]=i;if("0123456789"!==Object.getOwnPropertyNames(r).map((function(t){return r[t]})).join(""))return!1;var a={};return"abcdefghijklmnopqrst".split("").forEach((function(t){a[t]=t})),"abcdefghijklmnopqrst"===Object.keys(Object.assign({},a)).join("")}catch(t){return!1}}()?Object.assign:function(t,r){for(var i,l,p=toObject(t),d=1;d<arguments.length;d++){for(var y in i=Object(arguments[d]))u.call(i,y)&&(p[y]=i[y]);if(a){l=a(i);for(var h=0;h<l.length;h++)c.call(i,l[h])&&(p[l[h]]=i[l[h]])}}return p}},function(t,r,i){(function(t){var a=Object.getOwnPropertyDescriptors||function getOwnPropertyDescriptors(t){for(var r=Object.keys(t),i={},a=0;a<r.length;a++)i[r[a]]=Object.getOwnPropertyDescriptor(t,r[a]);return i},u=/%[sdj%]/g;r.format=function(t){if(!isString(t)){for(var r=[],i=0;i<arguments.length;i++)r.push(inspect(arguments[i]));return r.join(" ")}i=1;for(var a=arguments,c=a.length,l=String(t).replace(u,(function(t){if("%%"===t)return"%";if(i>=c)return t;switch(t){case"%s":return String(a[i++]);case"%d":return Number(a[i++]);case"%j":try{return JSON.stringify(a[i++])}catch(t){return"[Circular]"}default:return t}})),p=a[i];i<c;p=a[++i])isNull(p)||!isObject(p)?l+=" "+p:l+=" "+inspect(p);return l},r.deprecate=function(i,a){if(void 0!==t&&!0===t.noDeprecation)return i;if(void 0===t)return function(){return r.deprecate(i,a).apply(this,arguments)};var u=!1;return function deprecated(){if(!u){if(t.throwDeprecation)throw new Error(a);t.traceDeprecation?console.trace(a):console.error(a),u=!0}return i.apply(this,arguments)}};var c,l={};function inspect(t,i){var a={seen:[],stylize:stylizeNoColor};return arguments.length>=3&&(a.depth=arguments[2]),arguments.length>=4&&(a.colors=arguments[3]),isBoolean(i)?a.showHidden=i:i&&r._extend(a,i),isUndefined(a.showHidden)&&(a.showHidden=!1),isUndefined(a.depth)&&(a.depth=2),isUndefined(a.colors)&&(a.colors=!1),isUndefined(a.customInspect)&&(a.customInspect=!0),a.colors&&(a.stylize=stylizeWithColor),formatValue(a,t,a.depth)}function stylizeWithColor(t,r){var i=inspect.styles[r];return i?"["+inspect.colors[i][0]+"m"+t+"["+inspect.colors[i][1]+"m":t}function stylizeNoColor(t,r){return t}function formatValue(t,i,a){if(t.customInspect&&i&&isFunction(i.inspect)&&i.inspect!==r.inspect&&(!i.constructor||i.constructor.prototype!==i)){var u=i.inspect(a,t);return isString(u)||(u=formatValue(t,u,a)),u}var c=function formatPrimitive(t,r){if(isUndefined(r))return t.stylize("undefined","undefined");if(isString(r)){var i="'"+JSON.stringify(r).replace(/^"|"$/g,"").replace(/'/g,"\\'").replace(/\\"/g,'"')+"'";return t.stylize(i,"string")}if(isNumber(r))return t.stylize(""+r,"number");if(isBoolean(r))return t.stylize(""+r,"boolean");if(isNull(r))return t.stylize("null","null")}(t,i);if(c)return c;var l=Object.keys(i),p=function arrayToHash(t){var r={};return t.forEach((function(t,i){r[t]=!0})),r}(l);if(t.showHidden&&(l=Object.getOwnPropertyNames(i)),isError(i)&&(l.indexOf("message")>=0||l.indexOf("description")>=0))return formatError(i);if(0===l.length){if(isFunction(i)){var d=i.name?": "+i.name:"";return t.stylize("[Function"+d+"]","special")}if(isRegExp(i))return t.stylize(RegExp.prototype.toString.call(i),"regexp");if(isDate(i))return t.stylize(Date.prototype.toString.call(i),"date");if(isError(i))return formatError(i)}var y,h="",g=!1,v=["{","}"];(isArray(i)&&(g=!0,v=["[","]"]),isFunction(i))&&(h=" [Function"+(i.name?": "+i.name:"")+"]");return isRegExp(i)&&(h=" "+RegExp.prototype.toString.call(i)),isDate(i)&&(h=" "+Date.prototype.toUTCString.call(i)),isError(i)&&(h=" "+formatError(i)),0!==l.length||g&&0!=i.length?a<0?isRegExp(i)?t.stylize(RegExp.prototype.toString.call(i),"regexp"):t.stylize("[Object]","special"):(t.seen.push(i),y=g?function formatArray(t,r,i,a,u){for(var c=[],l=0,p=r.length;l<p;++l)hasOwnProperty(r,String(l))?c.push(formatProperty(t,r,i,a,String(l),!0)):c.push("");return u.forEach((function(u){u.match(/^\d+$/)||c.push(formatProperty(t,r,i,a,u,!0))})),c}(t,i,a,p,l):l.map((function(r){return formatProperty(t,i,a,p,r,g)})),t.seen.pop(),function reduceToSingleString(t,r,i){if(t.reduce((function(t,r){return r.indexOf("\n")>=0&&0,t+r.replace(/\u001b\[\d\d?m/g,"").length+1}),0)>60)return i[0]+(""===r?"":r+"\n ")+" "+t.join(",\n  ")+" "+i[1];return i[0]+r+" "+t.join(", ")+" "+i[1]}(y,h,v)):v[0]+h+v[1]}function formatError(t){return"["+Error.prototype.toString.call(t)+"]"}function formatProperty(t,r,i,a,u,c){var l,p,d;if((d=Object.getOwnPropertyDescriptor(r,u)||{value:r[u]}).get?p=d.set?t.stylize("[Getter/Setter]","special"):t.stylize("[Getter]","special"):d.set&&(p=t.stylize("[Setter]","special")),hasOwnProperty(a,u)||(l="["+u+"]"),p||(t.seen.indexOf(d.value)<0?(p=isNull(i)?formatValue(t,d.value,null):formatValue(t,d.value,i-1)).indexOf("\n")>-1&&(p=c?p.split("\n").map((function(t){return"  "+t})).join("\n").substr(2):"\n"+p.split("\n").map((function(t){return"   "+t})).join("\n")):p=t.stylize("[Circular]","special")),isUndefined(l)){if(c&&u.match(/^\d+$/))return p;(l=JSON.stringify(""+u)).match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)?(l=l.substr(1,l.length-2),l=t.stylize(l,"name")):(l=l.replace(/'/g,"\\'").replace(/\\"/g,'"').replace(/(^"|"$)/g,"'"),l=t.stylize(l,"string"))}return l+": "+p}function isArray(t){return Array.isArray(t)}function isBoolean(t){return"boolean"==typeof t}function isNull(t){return null===t}function isNumber(t){return"number"==typeof t}function isString(t){return"string"==typeof t}function isUndefined(t){return void 0===t}function isRegExp(t){return isObject(t)&&"[object RegExp]"===objectToString(t)}function isObject(t){return"object"==typeof t&&null!==t}function isDate(t){return isObject(t)&&"[object Date]"===objectToString(t)}function isError(t){return isObject(t)&&("[object Error]"===objectToString(t)||t instanceof Error)}function isFunction(t){return"function"==typeof t}function objectToString(t){return Object.prototype.toString.call(t)}function pad(t){return t<10?"0"+t.toString(10):t.toString(10)}r.debuglog=function(i){if(isUndefined(c)&&(c=t.env.NODE_DEBUG||""),i=i.toUpperCase(),!l[i])if(new RegExp("\\b"+i+"\\b","i").test(c)){var a=t.pid;l[i]=function(){var t=r.format.apply(r,arguments);console.error("%s %d: %s",i,a,t)}}else l[i]=function(){};return l[i]},r.inspect=inspect,inspect.colors={bold:[1,22],italic:[3,23],underline:[4,24],inverse:[7,27],white:[37,39],grey:[90,39],black:[30,39],blue:[34,39],cyan:[36,39],green:[32,39],magenta:[35,39],red:[31,39],yellow:[33,39]},inspect.styles={special:"cyan",number:"yellow",boolean:"yellow",undefined:"grey",null:"bold",string:"green",date:"magenta",regexp:"red"},r.isArray=isArray,r.isBoolean=isBoolean,r.isNull=isNull,r.isNullOrUndefined=function isNullOrUndefined(t){return null==t},r.isNumber=isNumber,r.isString=isString,r.isSymbol=function isSymbol(t){return"symbol"==typeof t},r.isUndefined=isUndefined,r.isRegExp=isRegExp,r.isObject=isObject,r.isDate=isDate,r.isError=isError,r.isFunction=isFunction,r.isPrimitive=function isPrimitive(t){return null===t||"boolean"==typeof t||"number"==typeof t||"string"==typeof t||"symbol"==typeof t||void 0===t},r.isBuffer=i(259);var p=["Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"];function timestamp(){var t=new Date,r=[pad(t.getHours()),pad(t.getMinutes()),pad(t.getSeconds())].join(":");return[t.getDate(),p[t.getMonth()],r].join(" ")}function hasOwnProperty(t,r){return Object.prototype.hasOwnProperty.call(t,r)}r.log=function(){console.log("%s - %s",timestamp(),r.format.apply(r,arguments))},r.inherits=i(260),r._extend=function(t,r){if(!r||!isObject(r))return t;for(var i=Object.keys(r),a=i.length;a--;)t[i[a]]=r[i[a]];return t};var d="undefined"!=typeof Symbol?Symbol("util.promisify.custom"):void 0;function callbackifyOnRejected(t,r){if(!t){var i=new Error("Promise was rejected with a falsy value");i.reason=t,t=i}return r(t)}r.promisify=function promisify(t){if("function"!=typeof t)throw new TypeError('The "original" argument must be of type Function');if(d&&t[d]){var r;if("function"!=typeof(r=t[d]))throw new TypeError('The "util.promisify.custom" argument must be of type Function');return Object.defineProperty(r,d,{value:r,enumerable:!1,writable:!1,configurable:!0}),r}function r(){for(var r,i,a=new Promise((function(t,a){r=t,i=a})),u=[],c=0;c<arguments.length;c++)u.push(arguments[c]);u.push((function(t,a){t?i(t):r(a)}));try{t.apply(this,u)}catch(t){i(t)}return a}return Object.setPrototypeOf(r,Object.getPrototypeOf(t)),d&&Object.defineProperty(r,d,{value:r,enumerable:!1,writable:!1,configurable:!0}),Object.defineProperties(r,a(t))},r.promisify.custom=d,r.callbackify=function callbackify(r){if("function"!=typeof r)throw new TypeError('The "original" argument must be of type Function');function callbackified(){for(var i=[],a=0;a<arguments.length;a++)i.push(arguments[a]);var u=i.pop();if("function"!=typeof u)throw new TypeError("The last argument must be of type Function");var c=this,cb=function(){return u.apply(c,arguments)};r.apply(this,i).then((function(r){t.nextTick(cb,null,r)}),(function(r){t.nextTick(callbackifyOnRejected,r,cb)}))}return Object.setPrototypeOf(callbackified,Object.getPrototypeOf(r)),Object.defineProperties(callbackified,a(r)),callbackified}}).call(this,i(90))},function(t,r){t.exports=function isBuffer(t){return t&&"object"==typeof t&&"function"==typeof t.copy&&"function"==typeof t.fill&&"function"==typeof t.readUInt8}},function(t,r){"function"==typeof Object.create?t.exports=function inherits(t,r){t.super_=r,t.prototype=Object.create(r.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}})}:t.exports=function inherits(t,r){t.super_=r;var TempCtor=function(){};TempCtor.prototype=r.prototype,t.prototype=new TempCtor,t.prototype.constructor=t}},function(t,r,i){var a=i(0),u=i(58);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var c,l,p,d=a(i(23)),y=a(i(8)),h=a(i(9)),g=a(i(1)),v=a(i(2)),m=a(i(5)),b=a(i(6)),_=a(i(3)),w=a(i(262)),x=i(18),S=i(10),O=i(24),E=u(i(263));function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,_.default)(t);if(r){var u=(0,_.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,b.default)(this,i)}}var k=(c=(0,E.tracksTransactionsWithOptions)({numArguments:3}),l=(0,E.tracksTransactionsWithOptions)({numArguments:2}),p=function(t){(0,m.default)(EsmService,t);var r,i,a,u,c,l,p,b,_,w=_createSuper(EsmService);function EsmService(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"esm";return(0,g.default)(this,EsmService),w.call(this,t,["smartContract","web3","token","allowance","govQueryApi"])}return(0,v.default)(EsmService,[{key:"thresholdAmount",value:(_=(0,h.default)(y.default.mark((function _callee(){var t;return y.default.wrap((function _callee$(r){for(;;)switch(r.prev=r.next){case 0:return r.next=2,this._esmContract().min();case 2:return t=r.sent,r.abrupt("return",(0,O.getCurrency)(t,S.MKR).shiftedBy(-18));case 4:case"end":return r.stop()}}),_callee,this)}))),function thresholdAmount(){return _.apply(this,arguments)})},{key:"fired",value:(b=(0,h.default)(y.default.mark((function _callee2(){var t;return y.default.wrap((function _callee2$(r){for(;;)switch(r.prev=r.next){case 0:return r.next=2,this._esmContract().fired();case 2:return t=r.sent,r.abrupt("return",t.eq(1));case 4:case"end":return r.stop()}}),_callee2,this)}))),function fired(){return b.apply(this,arguments)})},{key:"emergencyShutdownActive",value:(p=(0,h.default)(y.default.mark((function _callee3(){var t;return y.default.wrap((function _callee3$(r){for(;;)switch(r.prev=r.next){case 0:return r.next=2,this._endContract().live();case 2:return t=r.sent,r.abrupt("return",t.eq(0));case 4:case"end":return r.stop()}}),_callee3,this)}))),function emergencyShutdownActive(){return p.apply(this,arguments)})},{key:"canFire",value:(l=(0,h.default)(y.default.mark((function _callee4(){var t,r,i,a;return y.default.wrap((function _callee4$(u){for(;;)switch(u.prev=u.next){case 0:return u.next=2,Promise.all([this.fired(),this.emergencyShutdownActive()]);case 2:return t=u.sent,r=(0,d.default)(t,2),i=r[0],a=r[1],u.abrupt("return",!i&&!a);case 7:case"end":return u.stop()}}),_callee4,this)}))),function canFire(){return l.apply(this,arguments)})},{key:"getTotalStaked",value:(c=(0,h.default)(y.default.mark((function _callee5(){var t;return y.default.wrap((function _callee5$(r){for(;;)switch(r.prev=r.next){case 0:return r.next=2,this._esmContract().Sum();case 2:return t=r.sent,r.abrupt("return",(0,O.getCurrency)(t,S.MKR).shiftedBy(-18));case 4:case"end":return r.stop()}}),_callee5,this)}))),function getTotalStaked(){return c.apply(this,arguments)})},{key:"getTotalStakedByAddress",value:(u=(0,h.default)(y.default.mark((function _callee6(){var t,r,i=arguments;return y.default.wrap((function _callee6$(a){for(;;)switch(a.prev=a.next){case 0:return(t=i.length>0&&void 0!==i[0]&&i[0])||(t=this.get("web3").currentAddress()),a.next=4,this._esmContract().sum(t);case 4:return r=a.sent,a.abrupt("return",(0,O.getCurrency)(r,S.MKR).shiftedBy(-18));case 6:case"end":return a.stop()}}),_callee6,this)}))),function getTotalStakedByAddress(){return u.apply(this,arguments)})},{key:"stake",value:(a=(0,h.default)(y.default.mark((function _callee7(t){var r,i,a,u,c,l,p,h,g=arguments;return y.default.wrap((function _callee7$(y){for(;;)switch(y.prev=y.next){case 0:if(r=g.length>1&&void 0!==g[1]&&g[1],i=g.length>2?g[2]:void 0,a=i.promise,u=(0,O.getCurrency)(t,S.MKR),r){y.next=14;break}return y.next=6,Promise.all([this.fired(),this.get("token").getToken(S.MKR).balance()]);case 6:if(c=y.sent,l=(0,d.default)(c,2),p=l[0],h=l[1],!p){y.next=12;break}throw new Error("cannot join when emergency shutdown has been fired");case 12:if(!h.lt(u)){y.next=14;break}throw new Error("amount to join is greater than the user balance");case 14:return y.abrupt("return",this._esmContract().join(u.toFixed("wei"),{promise:a}));case 15:case"end":return y.stop()}}),_callee7,this)}))),function stake(t){return a.apply(this,arguments)})},{key:"triggerEmergencyShutdown",value:(i=(0,h.default)(y.default.mark((function _callee8(){var t,r,i,a,u,c,l=arguments;return y.default.wrap((function _callee8$(p){for(;;)switch(p.prev=p.next){case 0:if(t=l.length>0&&void 0!==l[0]&&l[0],(l.length>1?l[1]:void 0).promise,t){p.next=14;break}return p.next=5,Promise.all([this.thresholdAmount(),this.getTotalStaked(),this.canFire()]);case 5:if(r=p.sent,i=(0,d.default)(r,3),a=i[0],u=i[1],c=i[2],!u.lt(a)){p.next=12;break}throw new Error("total amount of staked MKR has not reached the required threshold");case 12:if(c){p.next=14;break}throw new Error("emergency shutdown has already been initiated");case 14:return p.abrupt("return",this._esmContract().fire());case 15:case"end":return p.stop()}}),_callee8,this)}))),function triggerEmergencyShutdown(){return i.apply(this,arguments)})},{key:"getStakingHistory",value:(r=(0,h.default)(y.default.mark((function _callee9(){var t,r,i;return y.default.wrap((function _callee9$(a){for(;;)switch(a.prev=a.next){case 0:return a.next=2,this.get("govQueryApi").getEsmJoins();case 2:return t=a.sent,r=t.map((function(t){return{transactionHash:t.txHash,senderAddress:t.txFrom,amount:(0,S.MKR)(t.joinAmount),time:new Date(t.blockTimestamp)}})),i=r.sort((function(t,r){return r.time-t.time})),a.abrupt("return",i);case 6:case"end":return a.stop()}}),_callee9,this)}))),function getStakingHistory(){return r.apply(this,arguments)})},{key:"_esmContract",value:function _esmContract(){return this.get("smartContract").getContractByName(S.ESM)}},{key:"_endContract",value:function _endContract(){return this.get("smartContract").getContractByName(S.END)}}]),EsmService}(x.PrivateService),(0,w.default)(p.prototype,"stake",[c],Object.getOwnPropertyDescriptor(p.prototype,"stake"),p.prototype),(0,w.default)(p.prototype,"triggerEmergencyShutdown",[l],Object.getOwnPropertyDescriptor(p.prototype,"triggerEmergencyShutdown"),p.prototype),p);r.default=k},function(t,r){t.exports=function _applyDecoratedDescriptor(t,r,i,a,u){var c={};return Object.keys(a).forEach((function(t){c[t]=a[t]})),c.enumerable=!!c.enumerable,c.configurable=!!c.configurable,("value"in c||c.initializer)&&(c.writable=!0),c=i.slice().reverse().reduce((function(i,a){return a(t,r,i)||i}),c),u&&void 0!==c.initializer&&(c.value=c.initializer?c.initializer.call(u):void 0,c.initializer=void 0),void 0===c.initializer&&(Object.defineProperty(t,r,c),c=null),c}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.tracksTransactionsWithOptions=tracksTransactionsWithOptions,r.default=void 0;var u=a(i(8)),c=a(i(64)),l=a(i(9)),p=a(i(15)),d=a(i(264)),y=tracksTransactionsWithOptions({});function tracksTransactionsWithOptions(t){var r=t.numArguments;return function(t,i,a){var y=a.value,h=r||y.length;return a.value=function(){for(var t=this,r=arguments.length,i=new Array(r),a=0;a<r;a++)i[a]=arguments[a];var g,v=i[i.length-1];"object"===(0,p.default)(v)&&null!==v&&v.constructor===Object?(i=i.slice(0,i.length-1),g=v):g={};var m=(0,l.default)(u.default.mark((function _callee(){var r;return u.default.wrap((function _callee$(a){for(;;)switch(a.prev=a.next){case 0:return a.next=2,0;case 2:return g.promise||(g.promise=m),r=[].concat((0,c.default)(i),(0,c.default)((0,d.default)(h-1-i.length,(function(){}))),[g]),a.abrupt("return",y.apply(t,r));case 5:case"end":return a.stop()}}),_callee)})))();return m},a}}r.default=y},function(t,r,i){var a=i(97),u=i(265),c=i(104),l=Math.min;t.exports=function times(t,r){if((t=c(t))<1||t>9007199254740991)return[];var i=4294967295,p=l(t,4294967295);r=u(r),t-=4294967295;for(var d=a(p,r);++i<t;)r(i);return d}},function(t,r,i){var a=i(266);t.exports=function castFunction(t){return"function"==typeof t?t:a}},function(t,r){t.exports=function identity(t){return t}},function(t,r,i){var a=i(268);t.exports=function toFinite(t){return t?(t=a(t))===1/0||t===-1/0?17976931348623157e292*(t<0?-1:1):t==t?t:0:0===t?t:0}},function(t,r,i){var a=i(63),u=i(105),c=/^\s+|\s+$/g,l=/^[-+]0x[0-9a-f]+$/i,p=/^0b[01]+$/i,d=/^0o[0-7]+$/i,y=parseInt;t.exports=function toNumber(t){if("number"==typeof t)return t;if(u(t))return NaN;if(a(t)){var r="function"==typeof t.valueOf?t.valueOf():t;t=a(r)?r+"":r}if("string"!=typeof t)return 0===t?t:+t;t=t.replace(c,"");var i=p.test(t);return i||d.test(t)?y(t.slice(2),i?2:8):l.test(t)?NaN:+t}},function(t,r,i){var a=i(0);Object.defineProperty(r,"__esModule",{value:!0}),r.default=void 0;var u=a(i(23)),c=a(i(8)),l=a(i(9)),p=a(i(1)),d=a(i(2)),y=a(i(5)),h=a(i(6)),g=a(i(3)),v=i(18),m=i(10),b=a(i(270)),_=a(i(271)),w=a(i(103)),x=a(i(102)),S=i(24);function _createSuper(t){var r=function _isNativeReflectConstruct(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],(function(){}))),!0}catch(t){return!1}}();return function(){var i,a=(0,g.default)(t);if(r){var u=(0,g.default)(this).constructor;i=Reflect.construct(a,arguments,u)}else i=a.apply(this,arguments);return(0,h.default)(this,i)}}var O=x.default.pause,E=function(t){(0,y.default)(SpellService,t);var r,i,a,h,g,v=_createSuper(SpellService);function SpellService(){var t,r=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"spell";return(0,p.default)(this,SpellService),(t=v.call(this,r,["smartContract","web3"])).eta={},t.done={},t.action={},t.executionDate={},t.scheduledDate={},t}return(0,d.default)(SpellService,[{key:"getDelayInSeconds",value:function getDelayInSeconds(){return this.delay||(this.delay=this._pauseContract().delay()),this.delay}},{key:"getEta",value:(g=(0,l.default)(c.default.mark((function _callee(t){var r,i;return c.default.wrap((function _callee$(a){for(;;)switch(a.prev=a.next){case 0:if(!this.eta[t]){a.next=2;break}return a.abrupt("return",this.eta[t]);case 2:return r=this.get("smartContract").getContractByAddressAndAbi(t,b.default),a.next=5,r.eta();case 5:if((i=a.sent).toNumber()){a.next=8;break}return a.abrupt("return",void 0);case 8:return this.eta[t]=new Date(1e3*i.toNumber()),a.abrupt("return",this.eta[t]);case 10:case"end":return a.stop()}}),_callee,this)}))),function getEta(t){return g.apply(this,arguments)})},{key:"getScheduledDate",value:(h=(0,l.default)(c.default.mark((function _callee2(t){var r,i,a,l,p,d,y,h,g,v,m;return c.default.wrap((function _callee2$(c){for(;;)switch(c.prev=c.next){case 0:if(!this.scheduledDate[t]){c.next=2;break}return c.abrupt("return",this.scheduledDate[t]);case 2:return c.next=4,this.getEta(t);case 4:return r=c.sent,(0,w.default)(r,"spell ".concat(t," has not been scheduled")),i=this._pauseContract().address,a=this.get("web3"),l=a.network,p=(0,S.netIdToName)(l),d="0x"+(0,_.default)(t.replace(/^0x/,""),64,"0"),c.next=13,a.getPastLogs({fromBlock:O.inception_block[p],toBlock:"latest",address:i,topics:[O.events.plot,d]});case 13:return y=c.sent,h=(0,u.default)(y,1),g=h[0],c.next=18,a.getBlock(g.blockNumber);case 18:return v=c.sent,m=v.timestamp,this.scheduledDate[t]=new Date(1e3*m),c.abrupt("return",this.scheduledDate[t]);case 22:case"end":return c.stop()}}),_callee2,this)}))),function getScheduledDate(t){return h.apply(this,arguments)})},{key:"getDone",value:(a=(0,l.default)(c.default.mark((function _callee3(t){var r;return c.default.wrap((function _callee3$(i){for(;;)switch(i.prev=i.next){case 0:if(!this.done[t]){i.next=2;break}return i.abrupt("return",this.done[t]);case 2:return r=this.get("smartContract").getContractByAddressAndAbi(t,b.default),this.done[t]=r.done(),i.abrupt("return",this.done[t]);case 5:case"end":return i.stop()}}),_callee3,this)}))),function getDone(t){return a.apply(this,arguments)})},{key:"getAction",value:(i=(0,l.default)(c.default.mark((function _callee4(t){var r;return c.default.wrap((function _callee4$(i){for(;;)switch(i.prev=i.next){case 0:if(!this.action[t]){i.next=2;break}return i.abrupt("return",this.action[t]);case 2:return r=this.get("smartContract").getContractByAddressAndAbi(t,b.default),this.action[t]=r.action(),i.abrupt("return",this.action[t]);case 5:case"end":return i.stop()}}),_callee4,this)}))),function getAction(t){return i.apply(this,arguments)})},{key:"getExecutionDate",value:(r=(0,l.default)(c.default.mark((function _callee5(t){var r,i,a,l,p,d,y,h,g,v,m;return c.default.wrap((function _callee5$(c){for(;;)switch(c.prev=c.next){case 0:if(!this.executionDate[t]){c.next=2;break}return c.abrupt("return",this.executionDate[t]);case 2:return c.next=4,this.getDone(t);case 4:return r=c.sent,(0,w.default)(r,"spell ".concat(t," has not been executed")),i=this._pauseContract().address,a=this.get("web3"),l=a.network,p=(0,S.netIdToName)(l),d="0x"+(0,_.default)(t.replace(/^0x/,""),64,"0"),c.next=13,a.getPastLogs({fromBlock:O.inception_block[p],toBlock:"latest",address:i,topics:[O.events.exec,d]});case 13:return y=c.sent,h=(0,u.default)(y,1),g=h[0],c.next=18,a.getBlock(g.blockNumber);case 18:return v=c.sent,m=v.timestamp,this.executionDate[t]=new Date(1e3*m),c.abrupt("return",this.executionDate[t]);case 22:case"end":return c.stop()}}),_callee5,this)}))),function getExecutionDate(t){return r.apply(this,arguments)})},{key:"refresh",value:function refresh(){this.delay=null,this.eta={},this.done={},this.executionDate={},this.scheduledDate={}}},{key:"_pauseContract",value:function _pauseContract(){return this.get("smartContract").getContractByName(m.PAUSE)}}]),SpellService}(v.PublicService);r.default=E},function(t){t.exports=JSON.parse('[{"inputs":[],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"constant":true,"inputs":[],"name":"SAIMOM","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"SCDCAP","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"action","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"cast","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"done","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"eta","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"pause","outputs":[{"internalType":"contract DSPauseAbstract","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"schedule","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"sig","outputs":[{"internalType":"bytes","name":"","type":"bytes"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"tag","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"payable":false,"stateMutability":"view","type":"function"}]')},function(t,r,i){var a=i(272),u=i(107),c=i(104),l=i(282);t.exports=function padStart(t,r,i){t=l(t);var p=(r=c(r))?u(t):0;return r&&p<r?a(r-p,i)+t:t}},function(t,r,i){var a=i(273),u=i(106),c=i(274),l=i(65),p=i(107),d=i(279),y=Math.ceil;t.exports=function createPadding(t,r){var i=(r=void 0===r?" ":u(r)).length;if(i<2)return i?a(r,t):r;var h=a(r,y(t/p(r)));return l(r)?c(d(h),0,t).join(""):h.slice(0,t)}},function(t,r){var i=Math.floor;t.exports=function baseRepeat(t,r){var a="";if(!t||r<1||r>9007199254740991)return a;do{r%2&&(a+=t),(r=i(r/2))&&(t+=t)}while(r);return a}},function(t,r,i){var a=i(275);t.exports=function castSlice(t,r,i){var u=t.length;return i=void 0===i?u:i,!r&&i>=u?t:a(t,r,i)}},function(t,r){t.exports=function baseSlice(t,r,i){var a=-1,u=t.length;r<0&&(r=-r>u?0:u+r),(i=i>u?u:i)<0&&(i+=u),u=r>i?0:i-r>>>0,r>>>=0;for(var c=Array(u);++a<u;)c[a]=t[a+r];return c}},function(t,r,i){var a=i(277)("length");t.exports=a},function(t,r){t.exports=function baseProperty(t){return function(r){return null==r?void 0:r[t]}}},function(t,r){var i="[\\ud800-\\udfff]",a="[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff]",u="\\ud83c[\\udffb-\\udfff]",c="[^\\ud800-\\udfff]",l="(?:\\ud83c[\\udde6-\\uddff]){2}",p="[\\ud800-\\udbff][\\udc00-\\udfff]",d="(?:"+a+"|"+u+")"+"?",y="[\\ufe0e\\ufe0f]?"+d+("(?:\\u200d(?:"+[c,l,p].join("|")+")[\\ufe0e\\ufe0f]?"+d+")*"),h="(?:"+[c+a+"?",a,l,p,i].join("|")+")",g=RegExp(u+"(?="+u+")|"+h+y,"g");t.exports=function unicodeSize(t){for(var r=g.lastIndex=0;g.test(t);)++r;return r}},function(t,r,i){var a=i(280),u=i(65),c=i(281);t.exports=function stringToArray(t){return u(t)?c(t):a(t)}},function(t,r){t.exports=function asciiToArray(t){return t.split("")}},function(t,r){var i="[\\ud800-\\udfff]",a="[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff]",u="\\ud83c[\\udffb-\\udfff]",c="[^\\ud800-\\udfff]",l="(?:\\ud83c[\\udde6-\\uddff]){2}",p="[\\ud800-\\udbff][\\udc00-\\udfff]",d="(?:"+a+"|"+u+")"+"?",y="[\\ufe0e\\ufe0f]?"+d+("(?:\\u200d(?:"+[c,l,p].join("|")+")[\\ufe0e\\ufe0f]?"+d+")*"),h="(?:"+[c+a+"?",a,l,p,i].join("|")+")",g=RegExp(u+"(?="+u+")|"+h+y,"g");t.exports=function unicodeToArray(t){return t.match(g)||[]}},function(t,r,i){var a=i(106);t.exports=function toString(t){return null==t?"":a(t)}},function(t){t.exports=JSON.parse('{"MCD_ADM":"0xbbffc76e94b34f72d96d054b31f6424249c1337d","VOTE_PROXY_FACTORY":"0x3e08741a68c2d964d172793cd0ad14292f658cd8","POLLING":"0x518a0702701BF98b5242E73b2368ae07562BEEA3","BATCH_POLLING":"0xD931E7c869618dB6FD30cfE4e89248CAA091Ea5f","MCD_ESM":"0x0c376764f585828ffb52471c1c35f855e312a06c","MCD_END":"0x24728acf2e2c403f5d2db4df6834b8998e56aa5f","GOV":"0xaaf64bfcc32d0f15873a02163e7e500671a4ffcd","MCD_IOU":"0x4D5d2F7E1284bc5c871ce3e1A997Bd8646c75ba5","PAUSE":"0x8754e6ecb4fe68daa5132c2886ab39297a5c7189"}')},function(t){t.exports=JSON.parse('{"MCD_ADM":"0x9eF05f7F6deB616fd37aC3c959a2dDD25A54E4F5","VOTE_PROXY_FACTORY":"0x868ba9aeacA5B73c7C27F3B01588bf4F1339F2bC","GOV":"0x9f8f72aa9304c8b593d555f12ef6589cc3a579a2","MCD_IOU":"0x496C67A4CEd9C453A60F3166AB4B329870c8E355","POLLING":"0xF9be8F0945acDdeeDaA64DFCA5Fe9629D0CF8E5D","BATCH_POLLING":"0xD3A9FE267852281a1e6307a1C37CDfD76d39b133","MCD_ESM":"0x0581a0abe32aae9b5f0f68defab77c6759100085","MCD_END":"0xab14d3ce3f733cacb76ec2abe7d2fcb00c99f3d5","PAUSE":"0xbe286431454714f511008713973d3b053a2d38f3"}')},function(t){t.exports=JSON.parse('{"POLLING":"0x9A2810a12197CB844af4BA74a4b81bC1CA727130","BATCH_POLLING":"0xa9D33Ce18803b0742460ffb1b33B6c40f95178BC","VOTE_PROXY_FACTORY":"0x059B38F71E37F6f66572946e9cc7C8052A3f6626","MCD_ESM":"0x6D6e3B9B602a0a37c820F2383A1DD0EC02B5196d","MCD_END":"0x2d7f58ABB321ee1c63e8aBFF89A7CC100E7EEd01","PAUSE":"0x2125C30dA5DcA0819aEC5e4cdbF58Bfe91918e43","MCD_ADM":"0x5Ac5c0D0047A3F841D16eE1d8b0788f8d104F96b","MCD_IOU":"0x4E839c73FC50e6DF22Bfe1861b0dB1CEDC314C9f","SAI_GOV":"0x1c3ac7216250edc5b9daa5598da0579688b9dbd5"}')},function(t){t.exports=JSON.parse('[{"inputs":[{"internalType":"address","name":"gem_","type":"address"},{"internalType":"address","name":"end_","type":"address"},{"internalType":"address","name":"pit_","type":"address"},{"internalType":"uint256","name":"min_","type":"uint256"}],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"anonymous":true,"inputs":[{"indexed":true,"internalType":"bytes4","name":"sig","type":"bytes4"},{"indexed":true,"internalType":"address","name":"usr","type":"address"},{"indexed":true,"internalType":"bytes32","name":"arg1","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"arg2","type":"bytes32"},{"indexed":false,"internalType":"bytes","name":"data","type":"bytes"}],"name":"LogNote","type":"event"},{"constant":true,"inputs":[],"name":"Sum","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"end","outputs":[{"internalType":"contract EndLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"fire","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"fired","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"gem","outputs":[{"internalType":"contract GemLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"uint256","name":"wad","type":"uint256"}],"name":"join","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"min","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"pit","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"sum","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"}]')},function(t){t.exports=JSON.parse('[{"inputs":[],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"anonymous":true,"inputs":[{"indexed":true,"internalType":"bytes4","name":"sig","type":"bytes4"},{"indexed":true,"internalType":"address","name":"usr","type":"address"},{"indexed":true,"internalType":"bytes32","name":"arg1","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"arg2","type":"bytes32"},{"indexed":false,"internalType":"bytes","name":"data","type":"bytes"}],"name":"LogNote","type":"event"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"Art","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"bag","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"cage","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"}],"name":"cage","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"},{"internalType":"uint256","name":"wad","type":"uint256"}],"name":"cash","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"cat","outputs":[{"internalType":"contract CatLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"debt","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"guy","type":"address"}],"name":"deny","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"what","type":"bytes32"},{"internalType":"uint256","name":"data","type":"uint256"}],"name":"file","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"what","type":"bytes32"},{"internalType":"address","name":"data","type":"address"}],"name":"file","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"fix","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"}],"name":"flow","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"}],"name":"free","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"gap","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"live","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"},{"internalType":"address","name":"","type":"address"}],"name":"out","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"uint256","name":"wad","type":"uint256"}],"name":"pack","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"pot","outputs":[{"internalType":"contract PotLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"guy","type":"address"}],"name":"rely","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"},{"internalType":"address","name":"urn","type":"address"}],"name":"skim","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"ilk","type":"bytes32"},{"internalType":"uint256","name":"id","type":"uint256"}],"name":"skip","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"spot","outputs":[{"internalType":"contract Spotty","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"tag","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"thaw","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"vat","outputs":[{"internalType":"contract VatLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"vow","outputs":[{"internalType":"contract VowLike","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"wait","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"wards","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"when","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"}]')},function(t){t.exports=JSON.parse('[{"inputs":[{"internalType":"contract DSToken","name":"GOV","type":"address"},{"internalType":"contract DSToken","name":"IOU","type":"address"},{"internalType":"uint256","name":"MAX_YAYS","type":"uint256"}],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"slate","type":"bytes32"}],"name":"Etch","type":"event"},{"anonymous":true,"inputs":[{"indexed":true,"internalType":"bytes4","name":"sig","type":"bytes4"},{"indexed":true,"internalType":"address","name":"guy","type":"address"},{"indexed":true,"internalType":"bytes32","name":"foo","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"bar","type":"bytes32"},{"indexed":false,"internalType":"uint256","name":"wad","type":"uint256"},{"indexed":false,"internalType":"bytes","name":"fax","type":"bytes"}],"name":"LogNote","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"authority","type":"address"}],"name":"LogSetAuthority","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"}],"name":"LogSetOwner","type":"event"},{"constant":true,"inputs":[],"name":"GOV","outputs":[{"internalType":"contract DSToken","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"IOU","outputs":[{"internalType":"contract DSToken","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"MAX_YAYS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"approvals","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"authority","outputs":[{"internalType":"contract DSAuthority","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"caller","type":"address"},{"internalType":"address","name":"code","type":"address"},{"internalType":"bytes4","name":"sig","type":"bytes4"}],"name":"canCall","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"deposits","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address[]","name":"yays","type":"address[]"}],"name":"etch","outputs":[{"internalType":"bytes32","name":"slate","type":"bytes32"}],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"uint256","name":"wad","type":"uint256"}],"name":"free","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"code","type":"address"},{"internalType":"bytes4","name":"sig","type":"bytes4"}],"name":"getCapabilityRoles","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"who","type":"address"}],"name":"getUserRoles","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"who","type":"address"},{"internalType":"uint8","name":"role","type":"uint8"}],"name":"hasUserRole","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"hat","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"code","type":"address"},{"internalType":"bytes4","name":"sig","type":"bytes4"}],"name":"isCapabilityPublic","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"who","type":"address"}],"name":"isUserRoot","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"whom","type":"address"}],"name":"lift","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"uint256","name":"wad","type":"uint256"}],"name":"lock","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"contract DSAuthority","name":"authority_","type":"address"}],"name":"setAuthority","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"owner_","type":"address"}],"name":"setOwner","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"code","type":"address"},{"internalType":"bytes4","name":"sig","type":"bytes4"},{"internalType":"bool","name":"enabled","type":"bool"}],"name":"setPublicCapability","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"uint8","name":"role","type":"uint8"},{"internalType":"address","name":"code","type":"address"},{"internalType":"bytes4","name":"sig","type":"bytes4"},{"internalType":"bool","name":"enabled","type":"bool"}],"name":"setRoleCapability","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"who","type":"address"},{"internalType":"bool","name":"enabled","type":"bool"}],"name":"setRootUser","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"who","type":"address"},{"internalType":"uint8","name":"role","type":"uint8"},{"internalType":"bool","name":"enabled","type":"bool"}],"name":"setUserRole","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"},{"internalType":"uint256","name":"","type":"uint256"}],"name":"slates","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"bytes32","name":"slate","type":"bytes32"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address[]","name":"yays","type":"address[]"}],"name":"vote","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"votes","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"payable":false,"stateMutability":"view","type":"function"}]')},function(t){t.exports=JSON.parse('[{"inputs":[{"internalType":"contract DSChief","name":"chief_","type":"address"}],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"cold","type":"address"},{"indexed":true,"internalType":"address","name":"hot","type":"address"},{"indexed":true,"internalType":"address","name":"voteProxy","type":"address"}],"name":"LinkConfirmed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"cold","type":"address"},{"indexed":true,"internalType":"address","name":"hot","type":"address"}],"name":"LinkRequested","type":"event"},{"constant":false,"inputs":[{"internalType":"address","name":"cold","type":"address"}],"name":"approveLink","outputs":[{"internalType":"contract VoteProxy","name":"voteProxy","type":"address"}],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[],"name":"breakLink","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"chief","outputs":[{"internalType":"contract DSChief","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"coldMap","outputs":[{"internalType":"contract VoteProxy","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"guy","type":"address"}],"name":"hasProxy","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"hotMap","outputs":[{"internalType":"contract VoteProxy","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"hot","type":"address"}],"name":"initiateLink","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"linkRequests","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[],"name":"linkSelf","outputs":[{"internalType":"contract VoteProxy","name":"voteProxy","type":"address"}],"payable":false,"stateMutability":"nonpayable","type":"function"}]')},function(t){t.exports=JSON.parse('[{"constant":false,"inputs":[{"name":"pollId","type":"uint256"}],"name":"withdrawPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollIds","type":"uint256[]"}],"name":"withdrawPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollIds","type":"uint256[]"},{"name":"optionIds","type":"uint256[]"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollId","type":"uint256"},{"name":"optionId","type":"uint256"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"npoll","outputs":[{"name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"name":"startDate","type":"uint256"},{"name":"endDate","type":"uint256"},{"name":"multiHash","type":"string"},{"name":"url","type":"string"}],"name":"createPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"anonymous":false,"inputs":[{"indexed":true,"name":"creator","type":"address"},{"indexed":false,"name":"blockCreated","type":"uint256"},{"indexed":true,"name":"pollId","type":"uint256"},{"indexed":false,"name":"startDate","type":"uint256"},{"indexed":false,"name":"endDate","type":"uint256"},{"indexed":false,"name":"multiHash","type":"string"},{"indexed":false,"name":"url","type":"string"}],"name":"PollCreated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"name":"creator","type":"address"},{"indexed":false,"name":"blockWithdrawn","type":"uint256"},{"indexed":false,"name":"pollId","type":"uint256"}],"name":"PollWithdrawn","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"name":"voter","type":"address"},{"indexed":true,"name":"pollId","type":"uint256"},{"indexed":true,"name":"optionId","type":"uint256"}],"name":"Voted","type":"event"}]')},function(t){t.exports=JSON.parse('[{"constant":false,"inputs":[{"name":"pollId","type":"uint256"}],"name":"withdrawPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollIds","type":"uint256[]"}],"name":"withdrawPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollIds","type":"uint256[]"},{"name":"optionIds","type":"uint256[]"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"name":"pollId","type":"uint256"},{"name":"optionId","type":"uint256"}],"name":"vote","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"npoll","outputs":[{"name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"name":"startDate","type":"uint256"},{"name":"endDate","type":"uint256"},{"name":"multiHash","type":"string"},{"name":"url","type":"string"}],"name":"createPoll","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"anonymous":false,"inputs":[{"indexed":true,"name":"creator","type":"address"},{"indexed":false,"name":"blockCreated","type":"uint256"},{"indexed":true,"name":"pollId","type":"uint256"},{"indexed":false,"name":"startDate","type":"uint256"},{"indexed":false,"name":"endDate","type":"uint256"},{"indexed":false,"name":"multiHash","type":"string"},{"indexed":false,"name":"url","type":"string"}],"name":"PollCreated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"name":"creator","type":"address"},{"indexed":false,"name":"blockWithdrawn","type":"uint256"},{"indexed":false,"name":"pollId","type":"uint256"}],"name":"PollWithdrawn","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"name":"voter","type":"address"},{"indexed":true,"name":"pollId","type":"uint256"},{"indexed":true,"name":"optionId","type":"uint256"}],"name":"Voted","type":"event"}]')},function(t){t.exports=JSON.parse('[{"inputs":[{"internalType":"uint256","name":"delay_","type":"uint256"},{"internalType":"address","name":"owner_","type":"address"},{"internalType":"contract DSAuthority","name":"authority_","type":"address"}],"payable":false,"stateMutability":"nonpayable","type":"constructor"},{"anonymous":true,"inputs":[{"indexed":true,"internalType":"bytes4","name":"sig","type":"bytes4"},{"indexed":true,"internalType":"address","name":"guy","type":"address"},{"indexed":true,"internalType":"bytes32","name":"foo","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"bar","type":"bytes32"},{"indexed":false,"internalType":"uint256","name":"wad","type":"uint256"},{"indexed":false,"internalType":"bytes","name":"fax","type":"bytes"}],"name":"LogNote","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"authority","type":"address"}],"name":"LogSetAuthority","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"}],"name":"LogSetOwner","type":"event"},{"constant":true,"inputs":[],"name":"authority","outputs":[{"internalType":"contract DSAuthority","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[],"name":"delay","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"usr","type":"address"},{"internalType":"bytes32","name":"tag","type":"bytes32"},{"internalType":"bytes","name":"fax","type":"bytes"},{"internalType":"uint256","name":"eta","type":"uint256"}],"name":"drop","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"usr","type":"address"},{"internalType":"bytes32","name":"tag","type":"bytes32"},{"internalType":"bytes","name":"fax","type":"bytes"},{"internalType":"uint256","name":"eta","type":"uint256"}],"name":"exec","outputs":[{"internalType":"bytes","name":"out","type":"bytes"}],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":true,"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"plans","outputs":[{"internalType":"bool","name":"","type":"bool"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"usr","type":"address"},{"internalType":"bytes32","name":"tag","type":"bytes32"},{"internalType":"bytes","name":"fax","type":"bytes"},{"internalType":"uint256","name":"eta","type":"uint256"}],"name":"plot","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":true,"inputs":[],"name":"proxy","outputs":[{"internalType":"contract DSPauseProxy","name":"","type":"address"}],"payable":false,"stateMutability":"view","type":"function"},{"constant":false,"inputs":[{"internalType":"contract DSAuthority","name":"authority_","type":"address"}],"name":"setAuthority","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"uint256","name":"delay_","type":"uint256"}],"name":"setDelay","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"},{"constant":false,"inputs":[{"internalType":"address","name":"owner_","type":"address"}],"name":"setOwner","outputs":[],"payable":false,"stateMutability":"nonpayable","type":"function"}]')}])}));
 //# sourceMappingURL=index.js.map
\ No newline at end of file
diff --git a/packages/dai-plugin-governance/umd/index.js.map b/packages/dai-plugin-governance/umd/index.js.map
index b51544504..9cd677d63 100644
--- a/packages/dai-plugin-governance/umd/index.js.map
+++ b/packages/dai-plugin-governance/umd/index.js.map
@@ -1 +1 @@
-{"version":3,"sources":["webpack://@makerdao/dai-plugin-governance/webpack/universalModuleDefinition","webpack://@makerdao/dai-plugin-governance/webpack/bootstrap","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/interopRequireDefault.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/classCallCheck.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/createClass.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/getPrototypeOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_core.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/inherits.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/possibleConstructorReturn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_wks.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/regenerator/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/asyncToGenerator.js","webpack://@makerdao/dai-plugin-governance/./src/utils/constants.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_export.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_global.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-dp.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_descriptors.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/typeof.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_an-object.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_has.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_hide.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_is-object.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_fails.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-iobject.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/slicedToArray.js","webpack://@makerdao/dai-plugin-governance/./src/utils/helpers.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/defineProperty.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_property-desc.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-object.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iterators.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceType.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_root.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-keys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_library.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_uid.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-pie.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceBase.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_nativeCreate.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseGetTag.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_assocIndexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_getMapData.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isObjectLike.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_ctx.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-primitive.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_cof.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_defined.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-integer.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_shared-key.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_shared.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_enum-bug-keys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-gops.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.string.iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-create.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_set-to-string-tag.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_wks-ext.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_wks-define.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/setPrototypeOf.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceManager.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/wrapNativeSuper.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/interopRequireWildcard.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceState.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_getNative.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_Symbol.js","webpack://@makerdao/dai-plugin-governance/(webpack)/buildin/global.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isObject.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/toConsumableArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hasUnicode.js","webpack://@makerdao/dai-plugin-governance/./node_modules/@makerdao/currency/dist/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/object/assign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_ie8-dom-define.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_dom-create.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-keys-internal.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iobject.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-length.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/object/get-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-gpo.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/classCallCheck.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/possibleConstructorReturn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/typeof.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iter-define.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_redefine.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/web.dom.iterable.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-gopn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-gopd.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/inherits.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/core.get-iterator-method.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/unsupportedIterableToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/arrayLikeToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/assertThisInitialized.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/standardizeConfig.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/StateMachine.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/process/browser.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/uniq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isFunction.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_freeGlobal.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_setToArray.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/Container.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_arrayMap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseTimes.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isArray.js","webpack://@makerdao/dai-plugin-governance/(webpack)/buildin/module.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isLength.js","webpack://@makerdao/dai-plugin-governance/./node_modules/bignumber.js/bignumber.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/assert/assert.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/toInteger.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isSymbol.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseToString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_stringSize.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isPlaceholder.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_curry1.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/always.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/F.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/T.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/__.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_curry2.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/add.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_concat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_arity.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_curryN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/curryN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/addIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_curry3.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/adjust.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isTransformer.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_dispatchable.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_reduced.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfBase.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xall.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/all.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/max.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_map.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isArrayLike.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xwrap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/bind.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_reduce.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xmap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_has.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isArguments.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/keys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/map.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/path.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/prop.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pluck.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reduce.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/allPass.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/and.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xany.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/any.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/anyPass.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/ap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_aperture.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xaperture.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/aperture.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/append.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/apply.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/values.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/applySpec.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/applyTo.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/ascend.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/assoc.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isInteger.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/isNil.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/assocPath.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/nAry.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/binary.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isFunction.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/liftN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lift.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/both.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/curry.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/call.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_makeFlat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_flatCat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_forceReduced.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/chain.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xchain.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/clamp.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_cloneRegExp.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/type.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_clone.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/clone.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/comparator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/not.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/complement.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_pipe.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_checkForMethod.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/slice.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/tail.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pipe.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reverse.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/compose.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/composeK.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_pipeP.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pipeP.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/composeP.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_arrayFromIterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_containsWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/identical.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_equals.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_functionName.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/equals.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_indexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_contains.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_quote.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_toISOString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_complement.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_filter.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isObject.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfilter.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/filter.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reject.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/toString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_toString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/concat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/cond.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/constructN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/construct.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/contains.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/converge.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xreduceBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reduceBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/countBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dec.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/defaultTo.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/descend.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/difference.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/differenceWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dissoc.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/remove.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/update.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dissocPath.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/divide.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xdrop.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/drop.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xtake.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/take.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_dropLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xdropLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dropLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_dropLastWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xdropLastWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dropLastWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xdropRepeatsWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/nth.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/last.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dropRepeatsWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dropRepeats.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xdropWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dropWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/or.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/either.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/empty.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/takeLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/endsWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/eqBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/eqProps.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/evolve.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfind.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/find.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfindIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/findIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfindLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/findLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfindLastIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/findLastIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/flatten.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/flip.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/forEach.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/forEachObjIndexed.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/fromPairs.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/groupBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/groupWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/gt.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/gte.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/has.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/hasIn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/head.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_identity.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/identity.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/ifElse.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/inc.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/indexBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/indexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/init.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/innerJoin.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/insert.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/insertAll.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_Set.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/uniqBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/uniq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/intersection.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/intersperse.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_assign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_objectAssign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/objOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_stepCat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/into.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/invert.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/invertObj.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/invoker.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/is.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/isEmpty.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/join.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/juxt.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/keysIn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lastIndexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isNumber.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/length.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lens.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lensIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lensPath.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lensProp.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lt.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lte.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mapAccum.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mapAccumRight.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mapObjIndexed.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/match.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mathMod.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/maxBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/sum.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mean.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/median.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/memoizeWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/memoize.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/merge.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeAll.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeWithKey.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeDeepWithKey.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeDeepLeft.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeDeepRight.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeDeepWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/min.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/minBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/modulo.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/multiply.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/negate.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/none.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/nthArg.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/o.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/omit.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/once.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/over.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pair.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_createPartialApplicator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/partial.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/partialRight.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/partition.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pathEq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pathOr.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pathSatisfies.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pick.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pickAll.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pickBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pipeK.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/prepend.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/product.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/useWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/project.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/propEq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/propIs.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/propOr.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/propSatisfies.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/props.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/range.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reduceRight.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reduceWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reduced.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/times.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/repeat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/replace.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/scan.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/sequence.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/set.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/sort.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/sortBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/sortWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/split.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/splitAt.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/splitEvery.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/splitWhen.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/startsWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/subtract.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/symmetricDifference.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/symmetricDifferenceWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/takeLastWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xtakeWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/takeWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xtap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/tap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/test.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isRegExp.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/toLower.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/toPairs.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/toPairsIn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/toUpper.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/transduce.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/transpose.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/traverse.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/trim.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/tryCatch.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unapply.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unary.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/uncurryN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unfold.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/union.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/uniqWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unionWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unless.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unnest.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/until.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/valuesIn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/view.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/when.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/where.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/whereEq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/without.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/xprod.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/zip.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/zipObj.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/zipWith.js","webpack://@makerdao/dai-plugin-governance/./src/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/object/assign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.object.assign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_a-function.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-assign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_array-includes.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-absolute-index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/object/get-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.object.get-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-sap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/symbol/iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/symbol/iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_string-at.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iter-create.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-dps.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_html.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.array.iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_add-to-unscopables.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iter-step.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/symbol.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/symbol/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.symbol.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_meta.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_enum-keys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_is-array.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-gopn-ext.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es7.symbol.async-iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es7.symbol.observable.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/object/set-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/object/set-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.object.set-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_set-proto.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/object/create.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/object/create.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.object.create.js","webpack://@makerdao/dai-plugin-governance/./node_modules/@makerdao/currency/dist/Currency.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/get-iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/get-iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/core.get-iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_classof.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/toArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/array/from.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/array/from.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.array.from.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iter-call.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_is-array-iter.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_create-property.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iter-detect.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/createClass.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/object/define-property.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/object/define-property.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.object.define-property.js","webpack://@makerdao/dai-plugin-governance/./node_modules/@makerdao/currency/node_modules/bignumber.js/bignumber.js","webpack://@makerdao/dai-plugin-governance/./src/ChiefService.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/arrayWithHoles.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/iterableToArrayLimit.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/nonIterableRest.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/regenerator-runtime/runtime.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/get.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/superPropBase.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/isNativeFunction.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/construct.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/isNativeReflectConstruct.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceManagerBase.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/debug/src/browser.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/debug/src/debug.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/debug/node_modules/ms/index.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceProvider.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseUniq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_SetCache.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_MapCache.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_mapCacheClear.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_Hash.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hashClear.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseIsNative.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_getRawTag.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_objectToString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_isMasked.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_coreJsData.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_toSource.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_getValue.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hashDelete.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hashGet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hashHas.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hashSet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_ListCache.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_listCacheClear.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_listCacheDelete.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/eq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_listCacheGet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_listCacheHas.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_listCacheSet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_Map.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_mapCacheDelete.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_isKeyable.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_mapCacheGet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_mapCacheHas.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_mapCacheSet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_setCacheAdd.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_setCacheHas.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_arrayIncludes.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseIndexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseFindIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseIsNaN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_strictIndexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_arrayIncludesWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_cacheHas.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_createSet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_Set.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/noop.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/values.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseValues.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/keys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_arrayLikeKeys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isArguments.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseIsArguments.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isBuffer.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/stubFalse.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_isIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isTypedArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseIsTypedArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseUnary.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_nodeUtil.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseKeys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_isPrototype.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_nativeKeys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_overArg.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isArrayLike.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/toposort/index.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/LocalService.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/PublicService.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/PrivateService.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/node-libs-browser/node_modules/buffer/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/base64-js/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ieee754/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/isarray/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/arrayWithoutHoles.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/iterableToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/nonIterableSpread.js","webpack://@makerdao/dai-plugin-governance/./src/VoteProxyService.js","webpack://@makerdao/dai-plugin-governance/./src/VoteProxy.js","webpack://@makerdao/dai-plugin-governance/./src/VoteProxyFactoryService.js","webpack://@makerdao/dai-plugin-governance/./src/ApproveLinkTransaction.js","webpack://@makerdao/dai-plugin-governance/./src/GovPollingService.js","webpack://@makerdao/dai-plugin-governance/./src/GovQueryApiService.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/object-assign/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/node-libs-browser/node_modules/util/util.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/node-libs-browser/node_modules/util/support/isBufferBrowser.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/node-libs-browser/node_modules/inherits/inherits_browser.js","webpack://@makerdao/dai-plugin-governance/./src/EsmService.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/applyDecoratedDescriptor.js","webpack://@makerdao/dai-plugin-governance/./src/utils/tracksTransactions.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/times.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_castFunction.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/identity.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/toFinite.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/toNumber.js","webpack://@makerdao/dai-plugin-governance/./src/SpellService.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/padStart.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_createPadding.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseRepeat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_castSlice.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseSlice.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_asciiSize.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseProperty.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_unicodeSize.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_stringToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_asciiToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_unicodeToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/toString.js"],"names":["webpackUniversalModuleDefinition","root","factory","exports","module","define","amd","window","installedModules","__webpack_require__","moduleId","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","getDefault","getModuleExports","object","property","prototype","hasOwnProperty","p","s","_interopRequireDefault","obj","_classCallCheck","instance","Constructor","TypeError","_defineProperties","target","props","length","descriptor","configurable","writable","_createClass","protoProps","staticProps","_getPrototypeOf","setPrototypeOf","getPrototypeOf","__proto__","core","version","__e","_inherits","subClass","superClass","constructor","_typeof","assertThisInitialized","_possibleConstructorReturn","self","store","uid","USE_SYMBOL","asyncGeneratorStep","gen","resolve","reject","_next","_throw","arg","info","error","done","Promise","then","_asyncToGenerator","fn","this","args","arguments","apply","err","undefined","MKR","createCurrency","IOU","global","ctx","hide","has","$export","type","source","own","out","IS_FORCED","F","IS_GLOBAL","G","IS_STATIC","S","IS_PROTO","P","IS_BIND","B","IS_WRAP","W","expProto","C","a","b","Function","virtual","R","U","Math","__g","anObject","IE8_DOM_DEFINE","toPrimitive","dP","f","O","Attributes","e","iterator","isObject","it","require","_standardizeConfig","_ServiceProvider","_Container","_LocalService","_PublicService","_PrivateService","_ServiceManager","_StateMachine","createDesc","exec","IObject","defined","arrayWithHoles","iterableToArrayLimit","unsupportedIterableToArray","nonIterableRest","_slicedToArray","arr","netIdToName","id","parseInt","netIdtoSpockUrl","MAINNET_URL","KOVAN_URL","STAGING_MAINNET_URL","netIdtoSpockUrlStaging","getCurrency","createGetCurrency","paddedArray","k","Array","from","map","concat","toBuffer","number","opts","buf","len","endian","size","hex","BigNumber","toString","1","charAt","Error","ceil","Buffer","alloc","split","RegExp","filter","forEach","chunk","j","slice","fromBuffer","RangeError","push","join","_defineProperty","bitmap","serviceTypeTransitions","_ServiceState","LOCAL","PUBLIC","PRIVATE","CREATED","INITIALIZING","READY","ERROR","OFFLINE","CONNECTING","ONLINE","AUTHENTICATING","freeGlobal","freeSelf","$keys","enumBugKeys","keys","px","random","propertyIsEnumerable","_classCallCheck2","_createClass2","_ServiceType","_defineLifeCycleMethods","initialize","connect","disconnect","authenticate","deauthenticate","_buildServiceManager","dependencies","_this","auth","settings","_installLifeCycleHooks","mgr","_this2","onInitialized","manager","onDisconnected","onDeauthenticated","_guardLifeCycleMethods","original","state","_default","ServiceBase","role","_serviceManager","dependency","nativeCreate","getNative","getRawTag","objectToString","symToStringTag","baseGetTag","eq","assocIndexOf","array","isKeyable","getMapData","data","__data__","isObjectLike","aFunction","that","val","valueOf","floor","isNaN","shared","copyright","getOwnPropertySymbols","$at","String","iterated","_t","_i","point","index","dPs","IE_PROTO","Empty","createDict","iframeDocument","iframe","style","display","appendChild","src","contentWindow","document","open","write","lt","close","Properties","result","def","TAG","tag","stat","LIBRARY","wksExt","$Symbol","_setPrototypeOf","DependencyNotResolvedError","UnknownDependencyError","InvalidServiceError","_typeof2","_get2","_inherits2","_possibleConstructorReturn2","_getPrototypeOf2","_wrapNativeSuper2","_ServiceManagerBase2","_createSuper","Derived","hasNativeReflectConstruct","_isNativeReflectConstruct","Reflect","construct","sham","Proxy","Date","Super","NewTarget","_Error","_super","message","_Error2","_super2","service","_Error3","_super3","_waitForDependencies","callback","all","ServiceManager","_ServiceManagerBase","_super4","init","_name","_dependencies","_injections","isValidService","inject","initializeDependencies","_settings","_this3","connectDependencies","_this4","authenticateDependencies","_this5","_this6","_this7","createService","_this8","isNativeFunction","_wrapNativeSuper","Class","_cache","Map","set","Wrapper","_getRequireWildcardCache","WeakMap","cache","_interopRequireWildcard","newObj","hasPropertyDescriptor","getOwnPropertyDescriptor","desc","baseIsNative","getValue","g","arrayWithoutHoles","iterableToArray","nonIterableSpread","_toConsumableArray","reHasUnicode","hasUnicode","string","test","Currency","_assign2","_classCallCheck3","_possibleConstructorReturn3","_inherits3","symbol","creatorFn","amount","shift","CurrencyX","_Currency","default","wei","makeShiftedCreatorFn","ray","rad","isInstance","createCurrencyRatio","wrappedNumerator","wrappedDenominator","numerator","denominator","_Currency2","CurrencyRatio","currencies","unit","toUpperCase","ctor","is","createElement","toIObject","arrayIndexOf","names","cof","toInteger","min","toObject","ObjectProto","_typeof3","ReferenceError","_iterator2","_symbol2","redefine","Iterators","$iterCreate","setToStringTag","ITERATOR","BUGGY","returnThis","Base","NAME","next","DEFAULT","IS_SET","FORCED","methods","IteratorPrototype","getMethod","kind","proto","values","entries","DEF_VALUES","VALUES_BUG","$native","$default","$entries","$anyNative","TO_STRING_TAG","DOMIterables","Collection","hiddenKeys","getOwnPropertyNames","pIE","gOPD","_setPrototypeOf2","_create2","classof","getIteratorMethod","arrayLikeToArray","_unsupportedIterableToArray","minLen","_arrayLikeToArray","arr2","_assertThisInitialized","standardizeConfig","config","resolver","resolveNameForBoolean","className","_ServiceBase","bool","_ref","defaults","disabled","IllegalStateError","StateMachine","initialState","transitions","_state","_nextStates","_stateChangedHandlers","onStateChanged","inState","indexOf","assertState","operation","transitionTo","newState","oldState","cb","cachedSetTimeout","cachedClearTimeout","process","defaultSetTimout","defaultClearTimeout","runTimeout","fun","setTimeout","clearTimeout","currentQueue","queue","draining","queueIndex","cleanUpNextTick","drainQueue","timeout","run","runClearTimeout","marker","Item","noop","nextTick","title","browser","env","argv","versions","on","addListener","once","off","removeListener","removeAllListeners","emit","prependListener","prependOnceListener","listeners","binding","cwd","chdir","dir","umask","baseUniq","uniq","isFunction","setToArray","orderServices","ServiceNotFoundError","ServiceAlreadyRegisteredError","ExtractedServiceError","_regenerator","_asyncToGenerator2","_values","_uniq","_toposort","_createForOfIteratorHelper","isArray","_e","normalCompletion","didErr","step","_e2","services","_step","edges","servicesWithoutDeps","_iterator","_loop","depNames","dn","Container","_services","isAuthenticated","_waitForServices2","register","throwIfMissing","extractedServices","includes","getRegisteredServiceNames","injectDependencies","_step2","_step3","_iterator3","_waitForServices","mark","_callee","_iterator4","_step4","wrap","_callee$","_context","prev","_orderedServiceNames","t0","finish","stop","_x","arrayMap","iteratee","baseTimes","webpackPolyfill","deprecate","paths","children","isLength","globalObject","isNumeric","mathceil","mathfloor","bignumberError","tooManyDigits","BASE","POWS_TEN","MAX","bitFloor","coeffToString","z","charCodeAt","compare","x","y","xc","yc","intCheck","max","isOdd","toExponential","str","toFixedPoint","zs","clone","configObject","div","convertBase","parseNumeric","random53bitInt","basePrefix","dotAfter","dotBefore","isInfinityOrNaN","whitespaceOrPlus","ONE","DECIMAL_PLACES","ROUNDING_MODE","TO_EXP_NEG","TO_EXP_POS","MIN_EXP","MAX_EXP","CRYPTO","MODULO_MODE","POW_PRECISION","FORMAT","decimalSeparator","groupSeparator","groupSize","secondaryGroupSize","fractionGroupSeparator","fractionGroupSize","ALPHABET","alphabet","caseChanged","isNum","replace","search","substring","round","DEBUG","toLowerCase","format","rm","c0","ne","maxOrMin","method","normalise","pop","sd","ni","rd","pows10","ROUND_UP","ROUND_DOWN","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_UP","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","v","crypto","getRandomValues","randomBytes","EXPONENTIAL_AT","RANGE","isBigNumber","_isBigNumber","maximum","minimum","gt","dp","rand","Uint32Array","copy","splice","toBaseOut","baseIn","baseOut","arrL","reverse","sign","callerIsToString","pow","multiply","base","temp","xlo","xhi","carry","klo","khi","aL","bL","cmp","subtract","more","prod","prodL","q","qc","rem","remL","rem0","xi","xL","yc0","yL","yz","NaN","p1","p2","absoluteValue","abs","comparedTo","decimalPlaces","dividedBy","dividedToIntegerBy","idiv","exponentiatedBy","half","isModExp","nIsBig","nIsNeg","nIsOdd","isInteger","mod","times","integerValue","isEqualTo","isFinite","isGreaterThan","isGreaterThanOrEqualTo","gte","isLessThan","isLessThanOrEqualTo","lte","isNegative","isPositive","isZero","minus","xLTy","plus","xe","ye","modulo","multipliedBy","xcL","ycL","ylo","yhi","zc","negated","precision","shiftedBy","squareRoot","sqrt","rep","toFixed","toFormat","g1","g2","intPart","fractionPart","isNeg","intDigits","substr","toFraction","md","d0","d1","d2","exp","n0","n1","toNumber","toPrecision","toJSON","objectAssign","isBuffer","_isBuffer","util","hasOwn","pSlice","functionsHaveNames","foo","pToString","isView","arrbuf","ArrayBuffer","DataView","buffer","assert","ok","regex","getName","func","match","truncate","inspect","something","rawname","fail","actual","expected","operator","stackStartFunction","AssertionError","_deepEqual","strict","memos","isDate","getTime","isRegExp","multiline","lastIndex","ignoreCase","Float32Array","Float64Array","Uint8Array","actualIndex","objEquiv","actualVisitedObjects","isPrimitive","aIsArgs","isArguments","bIsArgs","ka","objectKeys","kb","sort","expectedException","isPrototypeOf","_throws","shouldThrow","block","_tryBlock","userProvidedMessage","isUnexpectedException","isError","options","generatedMessage","getMessage","captureStackTrace","stack","fn_name","idx","next_line","inherits","equal","notEqual","deepEqual","deepStrictEqual","notDeepEqual","notDeepStrictEqual","strictEqual","notStrictEqual","throws","doesNotThrow","ifError","toFinite","remainder","isSymbol","symbolProto","symbolToString","baseToString","asciiSize","unicodeSize","stringSize","_isPlaceholder","_curry1","f1","always","_curry2","f2","_b","_a","add","Number","_concat","set1","set2","len1","len2","_arity","a0","a1","a2","a3","a4","a5","a6","a7","a8","a9","_curryN","received","combined","argsIdx","left","combinedIdx","curryN","addIndex","origFn","list","_curry3","f3","_c","adjust","_idx","_list","_isTransformer","_dispatchable","methodNames","xf","_isArray","transducer","_reduced","XAll","_xfBase","input","_xall","_map","functor","_isString","isArrayLike","nodeType","XWrap","acc","_xwrap","thisObj","_iterableReduce","iter","_methodReduce","methodName","symIterator","_reduce","_arrayReduce","reduce","XMap","_xmap","_has","prop","_isArguments","hasEnumBug","nonEnumerableProps","hasArgsEnumBug","contains","item","nIdx","ks","checkArgsLength","path","pluck","allPass","preds","and","XAny","any","_xany","anyPass","ap","applyF","applyX","_aperture","limit","XAperture","pos","full","getCopy","_xaperture","append","el","vals","applySpec","spec","applyTo","ascend","aa","bb","assoc","isNil","assocPath","nextObj","_isInteger","nAry","binary","_isFunction","liftN","arity","lifted","lift","both","_both","curry","_makeFlat","recursive","flatt","jlen","ilen","_xcat","rxf","ret","_forceReduced","preservingReduced","_xchain","chain","monad","clamp","_cloneRegExp","pattern","sticky","unicode","_clone","refFrom","refTo","deep","copiedValue","comparator","pred","not","_pipe","_checkForMethod","methodname","fromIndex","toIndex","Infinity","pipe","compose","composeK","last","_pipeP","pipeP","composeP","_arrayFromIterator","_containsWith","identical","_uniqContentEquals","aIterator","bIterator","stackA","stackB","_equals","aItem","typeA","equals","_functionName","keysA","extendedStackA","extendedStackB","_indexOf","inf","_contains","_quote","pad","toISOString","_toISOString","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","getUTCMilliseconds","_complement","_filter","_isObject","XFilter","_xfilter","filterable","_toString","seen","recur","xs","mapPairs","repr","cond","pairs","pair","constructN","Fn","$0","$1","$2","$3","$4","$5","$6","$7","$8","$9","converge","after","fns","context","XReduceBy","valueFn","valueAcc","keyFn","inputs","_xreduceBy","reduceBy","elt","elem","defaultTo","descend","difference","first","second","firstLen","differenceWith","dissoc","remove","start","count","update","dissocPath","head","tail","divide","XDrop","_xdrop","drop","XTake","_xtake","take","dropLast","XDropLast","_xdropLast","dropLastWhile","XDropLastWhile","retained","retain","flush","_xdropLastWhile","XDropRepeatsWith","lastValue","seenFirstValue","sameAsLast","_xdropRepeatsWith","nth","offset","dropRepeatsWith","XDropWhile","_xdropWhile","dropWhile","or","either","_either","empty","takeLast","suffix","eqBy","eqProps","obj1","obj2","evolve","transformations","transformation","XFind","found","_xfind","find","XFindIndex","_xfindIndex","findIndex","XFindLast","_xfindLast","findLast","XFindLastIndex","lastIdx","_xfindLastIndex","findLastIndex","flip","forEachObjIndexed","keyList","fromPairs","res","nextidx","hasIn","_identity","ifElse","condition","onTrue","onFalse","_ifElse","innerJoin","ys","insert","insertAll","elts","hasOrAdd","shouldAdd","prevSize","_items","_nativeSet","bIdx","_Set","Set","uniqBy","appliedItem","intersection","list1","list2","lookupList","filteredList","intersperse","separator","_objectAssign","output","nextKey","objOf","_stepCatArray","_stepCatString","_stepCatObject","_assign","into","_stepCat","invert","invertObj","invoker","Ctor","isEmpty","juxt","keysIn","lastIndexOf","_isNumber","lens","setter","toFunctorFn","focus","lensIndex","lensPath","lensProp","mapAccum","tuple","mapAccumRight","mapObjIndexed","rx","mathMod","maxBy","mean","median","width","memoizeWith","mFn","merge","mergeAll","mergeWithKey","mergeDeepWithKey","lObj","rObj","lVal","rVal","mergeDeepLeft","mergeDeepRight","mergeDeepWith","mergeWith","_","_l","_r","minBy","negate","nthArg","_of","omit","called","Identity","over","fst","snd","_createPartialApplicator","pathEq","_path","pathOr","pathSatisfies","propPath","pick","pickAll","pickBy","pipeK","prepend","useWith","transformers","propEq","propIs","propOr","propSatisfies","ps","range","to","reduceRight","_reduceWhile","repeat","replacement","scan","sequence","of","traversable","sortBy","sortWith","splitAt","splitEvery","splitWhen","prefix","symmetricDifference","symmetricDifferenceWith","takeLastWhile","XTakeWhile","_xtakeWhile","takeWhile","XTap","_xtap","tap","_isRegExp","toPairs","toPairsIn","transduce","transpose","outerlist","innerlist","traverse","ws","trim","beginRx","endRx","_tryCatch","tryer","catcher","unapply","unary","uncurryN","depth","endIdx","currentDepth","unfold","seed","uniqWith","unionWith","unless","whenFalseFn","until","valuesIn","vs","Const","view","when","whenTrueFn","where","testObj","whereEq","xprod","zip","rv","zipObj","zipWith","addConfig","network","staging","contractAddresses","kovan","mainnet","testnet","addressKey","esmContracts","ESM","address","abi","END","addContracts","CHIEF","VOTE_PROXY_FACTORY","POLLING","BATCH_POLLING","PAUSE","additionalServices","chief","ChiefService","voteProxy","VoteProxyService","voteProxyFactory","VoteProxyFactoryService","govPolling","GovPollingService","govQueryApi","GovQueryApiService","esm","EsmService","spell","SpellService","smartContract","token","erc20","currency","SAI_GOV","assign","DESCRIPTORS","getKeys","gOPS","$assign","A","K","T","aLen","getSymbols","isEnum","toLength","toAbsoluteIndex","IS_INCLUDES","$this","$getPrototypeOf","fails","KEY","TO_STRING","defineProperties","documentElement","addToUnscopables","_k","Arguments","META","$fails","wks","wksDefine","enumKeys","_create","gOPNExt","$GOPD","$GOPS","$DP","gOPN","$JSON","JSON","_stringify","stringify","HIDDEN","TO_PRIMITIVE","SymbolRegistry","AllSymbols","OPSymbols","USE_NATIVE","QObject","findChild","setSymbolDesc","D","protoDesc","sym","$defineProperty","$defineProperties","$propertyIsEnumerable","E","$getOwnPropertyDescriptor","$getOwnPropertyNames","$getOwnPropertySymbols","IS_OP","$set","es6Symbols","wellKnownSymbols","keyFor","useSetter","useSimple","FAILS_ON_PRIMITIVES","replacer","$replacer","setDesc","isExtensible","FREEZE","preventExtensions","setMeta","w","meta","NEED","fastKey","getWeak","onFreeze","symbols","windowNames","getWindowNames","check","buggy","$Object","_getIterator3","_toArray3","_createClass3","_bignumber2","amountToBigNumber","toBigNumber","_amount","isEqual","other","decimals","isSameType","bigNumberFnWrapper","isBoolean","assertValidOperation","right","otherBigNumber","bigNumberFnResult","_ref2","aliases","_iteratorNormalCompletion","_didIteratorError","_iteratorError","return","_ref3","_ref4","_iteratorNormalCompletion2","_didIteratorError2","_iteratorError2","getIterator","iterFn","ARG","tryGet","callee","_from2","isArrayIter","createProperty","getIterFn","arrayLike","mapfn","mapping","ArrayProto","SAFE_CLOSING","riter","skipClosing","safe","_defineProperty2","hasSymbol","sum","for","chiefInfo","contractInfo","candidates","addressData","identity","getSlateAddresses","chiefAddress","_chiefContract","web3Service","netId","networkName","getPastLogs","fromBlock","inception_block","toBlock","topics","events","lock","locks","lockLog","blockNumber","sender","paddedBytes32ToAddress","free","frees","freeLog","logObj","vote_addresses","votes","voteLog","parseVoteAddressData","vote_slate","slate","addresses","etch","picks","amt","mkrAmt","getLockLogs","voters","voter","getNumDeposits","deposits","parseFloat","withDeposits","addressDeposit","getVotedSlate","withSlates","withSlate","memoizedGetSlateAddresses","withVotes","voteTally","voteObj","vote","approvals","sortedAddresses","withPercentages","shapedVoteObj","percent","hat","slateHash","slates","web3js","LogNote","sig","log","guy","Etch","getWeb3ContractByName","getContractByName","LocalService","_arrayWithHoles","_iterableToArrayLimit","_arr","_n","_d","_s","_nonIterableRest","runtime","Op","iteratorSymbol","asyncIteratorSymbol","asyncIterator","toStringTagSymbol","innerFn","outerFn","tryLocsList","protoGenerator","Generator","generator","Context","_invoke","makeInvokeMethod","invoke","doneResult","delegate","delegateResult","maybeInvokeDelegate","ContinueSentinel","sent","_sent","dispatchException","abrupt","record","tryCatch","GeneratorFunction","GeneratorFunctionPrototype","getProto","NativeIteratorPrototype","Gp","defineIteratorMethods","AsyncIterator","PromiseImpl","previousPromise","enqueue","callInvokeWithMethodAndArg","__await","unwrapped","resultName","nextLoc","pushTryEntry","locs","entry","tryLoc","catchLoc","finallyLoc","afterLoc","tryEntries","resetTryEntry","completion","reset","iterable","iteratorMethod","displayName","isGeneratorFunction","genFun","awrap","async","skipTempReset","rootRecord","rval","exception","handle","loc","caught","hasCatch","hasFinally","finallyEntry","complete","thrown","delegateYield","regeneratorRuntime","accidentalStrictMode","superPropBase","_get","receiver","_superPropBase","_isNativeFunction","isNativeReflectConstruct","_construct","Parent","_promisify","unsafeCallback","ServiceManagerBase","_init","_connect","_auth","_type","_initPromise","_connectPromise","_authPromise","reason","_disconnect","_deauthenticate","isInitialized","isConnected","isReady","handler","onConnected","onAuthenticated","onReady","load","storage","debug","console","formatArgs","useColors","namespace","humanize","diff","color","lastC","save","namespaces","removeItem","WebkitAppearance","firebug","table","navigator","userAgent","chrome","local","localstorage","localStorage","colors","formatters","enable","prevTime","createDebug","enabled","curr","ms","coerce","unshift","formatter","logFn","selectColor","hash","disable","skips","h","plural","parse","long","fmtLong","fmtShort","_slicedToArray2","_standardizeConfig3","ServiceProvider","_ref$services","_ref$defaults","_ref$disabled","_config","_resolver","supports","serviceName","buildContainer","container","_standardizeConfig2","instanceName","_registerDependencies","_container","newDeps","deps","SetCache","arrayIncludes","arrayIncludesWith","cacheHas","createSet","isCommon","outer","computed","seenIndex","MapCache","setCacheAdd","setCacheHas","mapCacheClear","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","clear","Hash","ListCache","hashClear","hashDelete","hashGet","hashHas","hashSet","isMasked","toSource","reIsHostCtor","funcProto","objectProto","funcToString","reIsNative","nativeObjectToString","isOwn","unmasked","coreJsData","maskSrcKey","listCacheClear","listCacheDelete","listCacheGet","listCacheHas","listCacheSet","baseIndexOf","baseFindIndex","baseIsNaN","strictIndexOf","predicate","fromRight","baseValues","arrayLikeKeys","baseKeys","isIndex","isTypedArray","inherited","isArr","isArg","isBuff","isType","skipIndexes","baseIsArguments","stubFalse","freeExports","freeModule","reIsUint","baseIsTypedArray","baseUnary","nodeUtil","nodeIsTypedArray","typedArrayTags","freeProcess","types","isPrototype","nativeKeys","overArg","transform","toposort","nodes","cursor","sorted","visited","outgoingEdges","makeOutgoingEdges","edge","nodesHash","makeNodesHash","visit","node","predecessors","nodeRep","outgoing","child","delete","uniqueNodes","PublicService","PrivateService","base64","ieee754","kMaxLength","TYPED_ARRAY_SUPPORT","createBuffer","encodingOrOffset","allocUnsafe","fromArrayBuffer","byteOffset","byteLength","fromArrayLike","fromString","encoding","isEncoding","fromObject","checked","isnan","assertSize","loweredCase","utf8ToBytes","base64ToBytes","slowToString","end","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","swap","bidirectionalIndexOf","indexSize","arrLength","valLength","read","readUInt16BE","foundIndex","hexWrite","remaining","strLen","parsed","utf8Write","blitBuffer","asciiWrite","asciiToBytes","byteArray","latin1Write","base64Write","ucs2Write","utf16leToBytes","units","hi","lo","fromByteArray","secondByte","thirdByte","fourthByte","tempCodePoint","firstByte","codePoint","bytesPerSequence","decodeCodePointsArray","codePoints","fromCharCode","SlowBuffer","INSPECT_MAX_BYTES","typedArraySupport","subarray","poolSize","_augment","species","fill","allocUnsafeSlow","swap16","swap32","swap64","thisStart","thisEnd","thisCopy","targetCopy","toHex","bytes","checkOffset","ext","checkInt","objectWriteUInt16","littleEndian","objectWriteUInt32","checkIEEE754","writeFloat","noAssert","writeDouble","newBuf","sliceLen","readUIntLE","mul","readUIntBE","readUInt8","readUInt16LE","readUInt32LE","readUInt32BE","readIntLE","readIntBE","readInt8","readInt16LE","readInt16BE","readInt32LE","readInt32BE","readFloatLE","readFloatBE","readDoubleLE","readDoubleBE","writeUIntLE","writeUIntBE","writeUInt8","writeUInt16LE","writeUInt16BE","writeUInt32LE","writeUInt32BE","writeIntLE","sub","writeIntBE","writeInt8","writeInt16LE","writeInt16BE","writeInt32LE","writeInt32BE","writeFloatLE","writeFloatBE","writeDoubleLE","writeDoubleBE","targetStart","code","INVALID_BASE64_RE","leadSurrogate","toByteArray","base64clean","stringtrim","dst","b64","getLens","validLen","placeHoldersLen","tmp","Arr","_byteLength","curByte","revLookup","uint8","extraBytes","parts","encodeChunk","lookup","num","isLE","mLen","nBytes","eLen","eMax","eBias","nBits","rt","LN2","_arrayWithoutHoles","_iterableToArray","_nonIterableSpread","proxyAddress","_proxyContract","freeAll","_slate","addressToCheck","_getProxyStatus","hasProxy","otherRole","_getAddressOfRole","otherAddress","VoteProxy","voteProxyService","getContractByAddressAndAbi","voteProxyAbi","_proxyFactoryContract","coldMap","hotMap","proxyAddressCold","proxyAddressHot","ZERO_ADDRESS","hot","cold","coldAddress","hotAddress","_voteProxyService","_proxyAddress","_coldAddress","_hotAddress","initiateLink","ApproveLinkTransaction","build","breakLink","getVoteProxy","contract","transactionManager","_contract","_txMgr","promise","txo","_parseLogs","receipt","logs","LinkConfirmed","web3","_web3","topic","utils","keccak256","signature","receiptEvent","parsedLog","getTransaction","fees","timeStamp","timeStampSubmitted","startDate","endDate","multiHash","url","_pollingContract","createPoll","pollId","withdrawPoll","pollIds","optionIds","_batchPollingContract","rankings","optionIndex","optionId","getAllWhitelistedPolls","polls","filtered","lowest","lowestPoll","getOptionVotingFor","getOptionVotingForRankedChoice","optionIdRaw","ballotBuffer","ballot","choice","getAllOptionsVotingFor","rankedChoiceOption","option","getNumUniqueVoters","getMkrWeight","weight","_getPoll","endUnix","getMkrSupport","weights","cur","mkrSupport","getMkrSupportRankedChoice","totalMkrParticipation","tally","rounds","winner","defaultOptionObj","firstChoice","transfer","eliminated","filteredOptions","prv","prvVotes","curVotes","optionToEliminate","maxOption","getMkrAmtVoted","getToken","totalSupply","voted","total","getMkrAmtVotedRankedChoice","currentVotes","QueryApi","queryPromises","serverUrl","query","fetch","headers","Accept","body","resp","json","cacheKey","getQueryResponse","response","activePolls","uniqueVoters","unixTime","totalMkrWeightProxyAndNoProxyByAddressAtTime","currentVote","allCurrentVotes","currentVoteRankedChoice","getQueryResponseMemoized","timeToBlockNumber","voteMkrWeightsAtTimeRankedChoice","voteOptionMkrWeightsAtTime","totalWeight","percentage","joins","allEsmJoins","propIsEnumerable","shouldUseNative","test1","test2","test3","letter","getOwnPropertyDescriptors","descriptors","formatRegExp","isString","objects","isNull","msg","noDeprecation","warned","deprecated","throwDeprecation","traceDeprecation","trace","debugEnviron","debugs","stylize","stylizeNoColor","showHidden","_extend","isUndefined","customInspect","stylizeWithColor","formatValue","styleType","styles","recurseTimes","primitive","formatPrimitive","simple","isNumber","visibleKeys","arrayToHash","formatError","braces","toUTCString","formatArray","formatProperty","reduceToSingleString","numLinesEst","line","ar","re","debuglog","NODE_DEBUG","pid","isNullOrUndefined","months","timestamp","time","getHours","getMinutes","getSeconds","getDate","getMonth","origin","kCustomPromisifiedSymbol","callbackifyOnRejected","newReason","promisify","promiseResolve","promiseReject","custom","callbackify","callbackified","maybeCb","rej","superCtor","super_","TempCtor","tracksTransactionsWithOptions","numArguments","_esmContract","fired","_fired","_endContract","live","active","emergencyShutdownActive","Sum","currentAddress","skipChecks","mkrAmount","balance","mkrBalance","thresholdAmount","getTotalStaked","canFire","totalStaked","fire","getEsmJoins","stakes","parsedStakes","transactionHash","txHash","senderAddress","txFrom","joinAmount","blockTimestamp","sortedParsedStakes","_applyDecoratedDescriptor","decorators","initializer","decorator","correctArgsLength","newArgs","castFunction","nativeMin","reTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","isBinary","pauseInfo","pause","eta","action","executionDate","scheduledDate","delay","_pauseContract","spellAddress","DsSpellAbi","getEta","pauseAddress","paddedSpellAddress","plot","plotEvent","getBlock","getDone","execEvent","createPadding","padStart","chars","strLength","baseRepeat","castSlice","stringToArray","nativeCeil","charsLength","nativeFloor","baseSlice","baseProperty","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsSeq","rsSymbol","reUnicode","asciiToArray","unicodeToArray"],"mappings":";CAAA,SAAUA,iCAAiCC,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAQ,mCAAqCD,IAE7CD,EAAK,mCAAqCC,IAR5C,CASGK,QAAQ,WACX,O,YCTE,IAAIC,EAAmB,GAGvB,SAASC,oBAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUP,QAGnC,IAAIC,EAASI,EAAiBE,GAAY,CACzCC,EAAGD,EACHE,GAAG,EACHT,QAAS,IAUV,OANAU,EAAQH,GAAUI,KAAKV,EAAOD,QAASC,EAAQA,EAAOD,QAASM,qBAG/DL,EAAOQ,GAAI,EAGJR,EAAOD,QA0Df,OArDAM,oBAAoBM,EAAIF,EAGxBJ,oBAAoBO,EAAIR,EAGxBC,oBAAoBQ,EAAI,SAASd,EAASe,EAAMC,GAC3CV,oBAAoBW,EAAEjB,EAASe,IAClCG,OAAOC,eAAenB,EAASe,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEV,oBAAoBgB,EAAI,SAAStB,GACX,oBAAXuB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAenB,EAASuB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAenB,EAAS,aAAc,CAAEyB,OAAO,KAQvDnB,oBAAoBoB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQnB,oBAAoBmB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFAxB,oBAAoBgB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOnB,oBAAoBQ,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRvB,oBAAoB2B,EAAI,SAAShC,GAChC,IAAIe,EAASf,GAAUA,EAAO2B,WAC7B,SAASM,aAAe,OAAOjC,EAAgB,SAC/C,SAASkC,mBAAqB,OAAOlC,GAEtC,OADAK,oBAAoBQ,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRV,oBAAoBW,EAAI,SAASmB,EAAQC,GAAY,OAAOnB,OAAOoB,UAAUC,eAAe5B,KAAKyB,EAAQC,IAGzG/B,oBAAoBkC,EAAI,GAIjBlC,oBAAoBA,oBAAoBmC,EAAI,K,gBC5ErDxC,EAAOD,QANP,SAAS0C,uBAAuBC,GAC9B,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CACnC,QAAWA,K,cCIf1C,EAAOD,QANP,SAAS4C,gBAAgBC,EAAUC,GACjC,KAAMD,aAAoBC,GACxB,MAAM,IAAIC,UAAU,uC,cCFxB,SAASC,kBAAkBC,EAAQC,GACjC,IAAK,IAAI1C,EAAI,EAAGA,EAAI0C,EAAMC,OAAQ3C,IAAK,CACrC,IAAI4C,EAAaF,EAAM1C,GACvB4C,EAAWhC,WAAagC,EAAWhC,aAAc,EACjDgC,EAAWC,cAAe,EACtB,UAAWD,IAAYA,EAAWE,UAAW,GACjDpC,OAAOC,eAAe8B,EAAQG,EAAWrB,IAAKqB,IAUlDnD,EAAOD,QANP,SAASuD,aAAaT,EAAaU,EAAYC,GAG7C,OAFID,GAAYR,kBAAkBF,EAAYR,UAAWkB,GACrDC,GAAaT,kBAAkBF,EAAaW,GACzCX,I,cCbT,SAASY,gBAAgBzC,GAIvB,OAHAhB,EAAOD,QAAU0D,gBAAkBxC,OAAOyC,eAAiBzC,OAAO0C,eAAiB,SAASF,gBAAgBzC,GAC1G,OAAOA,EAAE4C,WAAa3C,OAAO0C,eAAe3C,IAEvCyC,gBAAgBzC,GAGzBhB,EAAOD,QAAU0D,iB,cCPjB,IAAII,EAAO7D,EAAOD,QAAU,CAAE+D,QAAS,UACrB,iBAAPC,MAAiBA,IAAMF,I,gBCDlC,IAAIH,EAAiB,EAAQ,IAiB7B1D,EAAOD,QAfP,SAASiE,UAAUC,EAAUC,GAC3B,GAA0B,mBAAfA,GAA4C,OAAfA,EACtC,MAAM,IAAIpB,UAAU,sDAGtBmB,EAAS5B,UAAYpB,OAAOY,OAAOqC,GAAcA,EAAW7B,UAAW,CACrE8B,YAAa,CACX3C,MAAOyC,EACPZ,UAAU,EACVD,cAAc,KAGdc,GAAYR,EAAeO,EAAUC,K,gBCd3C,IAAIE,EAAU,EAAQ,IAElBC,EAAwB,EAAQ,IAUpCrE,EAAOD,QARP,SAASuE,2BAA2BC,EAAM7D,GACxC,OAAIA,GAA2B,WAAlB0D,EAAQ1D,IAAsC,mBAATA,EAI3C2D,EAAsBE,GAHpB7D,I,gBCNX,IAAI8D,EAAQ,EAAQ,GAAR,CAAqB,OAC7BC,EAAM,EAAQ,IACdnD,EAAS,EAAQ,IAAaA,OAC9BoD,EAA8B,mBAAVpD,GAETtB,EAAOD,QAAU,SAAUe,GACxC,OAAO0D,EAAM1D,KAAU0D,EAAM1D,GAC3B4D,GAAcpD,EAAOR,KAAU4D,EAAapD,EAASmD,GAAK,UAAY3D,MAGjE0D,MAAQA,G,gBCVjBxE,EAAOD,QAAU,EAAQ,M,cCAzB,SAAS4E,mBAAmBC,EAAKC,EAASC,EAAQC,EAAOC,EAAQlD,EAAKmD,GACpE,IACE,IAAIC,EAAON,EAAI9C,GAAKmD,GAChBzD,EAAQ0D,EAAK1D,MACjB,MAAO2D,GAEP,YADAL,EAAOK,GAILD,EAAKE,KACPP,EAAQrD,GAER6D,QAAQR,QAAQrD,GAAO8D,KAAKP,EAAOC,GAwBvChF,EAAOD,QApBP,SAASwF,kBAAkBC,GACzB,OAAO,WACL,IAAIjB,EAAOkB,KACPC,EAAOC,UACX,OAAO,IAAIN,SAAQ,SAAUR,EAASC,GACpC,IAAIF,EAAMY,EAAGI,MAAMrB,EAAMmB,GAEzB,SAASX,MAAMvD,GACbmD,mBAAmBC,EAAKC,EAASC,EAAQC,MAAOC,OAAQ,OAAQxD,GAGlE,SAASwD,OAAOa,GACdlB,mBAAmBC,EAAKC,EAASC,EAAQC,MAAOC,OAAQ,QAASa,GAGnEd,WAAMe,S,0OC/BZ,YAEaC,GAAM,IAAAC,gBAAe,O,QAC3B,IAAMC,GAAM,IAAAD,gBAAe,O,6BAGA,qB,UACX,U,gBACM,gB,QACR,Q,MACF,M,MACA,M,QACE,Q,eAGO,6C,YAGH,2B,YACA,oD,sBAEvB,+C,cACyB,6C,gBCtB3B,IAAIE,EAAS,EAAQ,IACjBrC,EAAO,EAAQ,GACfsC,EAAM,EAAQ,IACdC,EAAO,EAAQ,IACfC,EAAM,EAAQ,IAGdC,QAAU,SAAUC,EAAMzF,EAAM0F,GAClC,IASI1E,EAAK2E,EAAKC,EATVC,EAAYJ,EAAOD,QAAQM,EAC3BC,EAAYN,EAAOD,QAAQQ,EAC3BC,EAAYR,EAAOD,QAAQU,EAC3BC,EAAWV,EAAOD,QAAQY,EAC1BC,EAAUZ,EAAOD,QAAQc,EACzBC,EAAUd,EAAOD,QAAQgB,EACzBvH,EAAU8G,EAAYhD,EAAOA,EAAK/C,KAAU+C,EAAK/C,GAAQ,IACzDyG,EAAWxH,EAAiB,UAC5BiD,EAAS6D,EAAYX,EAASa,EAAYb,EAAOpF,IAASoF,EAAOpF,IAAS,IAAa,UAG3F,IAAKgB,KADD+E,IAAWL,EAAS1F,GACZ0F,GAEVC,GAAOE,GAAa3D,QAA0B8C,IAAhB9C,EAAOlB,KAC1BuE,EAAItG,EAAS+B,KAExB4E,EAAMD,EAAMzD,EAAOlB,GAAO0E,EAAO1E,GAEjC/B,EAAQ+B,GAAO+E,GAAmC,mBAAf7D,EAAOlB,GAAqB0E,EAAO1E,GAEpEqF,GAAWV,EAAMN,EAAIO,EAAKR,GAE1BmB,GAAWrE,EAAOlB,IAAQ4E,EAAM,SAAWc,GAC3C,IAAIZ,EAAI,SAAUa,EAAGC,EAAG9G,GACtB,GAAI6E,gBAAgB+B,EAAG,CACrB,OAAQ7B,UAAUzC,QAChB,KAAK,EAAG,OAAO,IAAIsE,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAEC,GACrB,KAAK,EAAG,OAAO,IAAID,EAAEC,EAAGC,GACxB,OAAO,IAAIF,EAAEC,EAAGC,EAAG9G,GACrB,OAAO4G,EAAE5B,MAAMH,KAAME,YAGzB,OADAiB,EAAW,UAAIY,EAAW,UACnBZ,EAXyB,CAa/BF,GAAOO,GAA0B,mBAAPP,EAAoBP,EAAIwB,SAASjH,KAAMgG,GAAOA,EAEvEO,KACDlH,EAAQ6H,UAAY7H,EAAQ6H,QAAU,KAAK9F,GAAO4E,EAE/CH,EAAOD,QAAQuB,GAAKN,IAAaA,EAASzF,IAAMsE,EAAKmB,EAAUzF,EAAK4E,MAK9EJ,QAAQM,EAAI,EACZN,QAAQQ,EAAI,EACZR,QAAQU,EAAI,EACZV,QAAQY,EAAI,EACZZ,QAAQc,EAAI,GACZd,QAAQgB,EAAI,GACZhB,QAAQwB,EAAI,GACZxB,QAAQuB,EAAI,IACZ7H,EAAOD,QAAUuG,S,cC5DjB,IAAIJ,EAASlG,EAAOD,QAA2B,oBAAVI,QAAyBA,OAAO4H,MAAQA,KACzE5H,OAAwB,oBAARoE,MAAuBA,KAAKwD,MAAQA,KAAOxD,KAE3DoD,SAAS,cAATA,GACc,iBAAPK,MAAiBA,IAAM9B,I,gBCLlC,IAAI+B,EAAW,EAAQ,IACnBC,EAAiB,EAAQ,IACzBC,EAAc,EAAQ,IACtBC,EAAKnH,OAAOC,eAEhBnB,EAAQsI,EAAI,EAAQ,IAAoBpH,OAAOC,eAAiB,SAASA,eAAeoH,EAAGpB,EAAGqB,GAI5F,GAHAN,EAASK,GACTpB,EAAIiB,EAAYjB,GAAG,GACnBe,EAASM,GACLL,EAAgB,IAClB,OAAOE,EAAGE,EAAGpB,EAAGqB,GAChB,MAAOC,IACT,GAAI,QAASD,GAAc,QAASA,EAAY,MAAMzF,UAAU,4BAEhE,MADI,UAAWyF,IAAYD,EAAEpB,GAAKqB,EAAW/G,OACtC8G,I,gBCbTtI,EAAOD,SAAW,EAAQ,GAAR,EAAoB,WACpC,OAA+E,GAAxEkB,OAAOC,eAAe,GAAI,IAAK,CAAEE,IAAK,WAAc,OAAO,KAAQqG,M,cCF5E,SAASrD,QAAQ1B,GAaf,MAVsB,mBAAXpB,QAAoD,iBAApBA,OAAOmH,SAChDzI,EAAOD,QAAUqE,QAAU,SAASA,QAAQ1B,GAC1C,cAAcA,GAGhB1C,EAAOD,QAAUqE,QAAU,SAASA,QAAQ1B,GAC1C,OAAOA,GAAyB,mBAAXpB,QAAyBoB,EAAIyB,cAAgB7C,QAAUoB,IAAQpB,OAAOe,UAAY,gBAAkBK,GAItH0B,QAAQ1B,GAGjB1C,EAAOD,QAAUqE,S,gBChBjB,IAAIsE,EAAW,EAAQ,IACvB1I,EAAOD,QAAU,SAAU4I,GACzB,IAAKD,EAASC,GAAK,MAAM7F,UAAU6F,EAAK,sBACxC,OAAOA,I,cCHT,IAAIrG,EAAiB,GAAGA,eACxBtC,EAAOD,QAAU,SAAU4I,EAAI7G,GAC7B,OAAOQ,EAAe5B,KAAKiI,EAAI7G,K,gBCAjC,IAAIW,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETP,OAAOC,eAAenB,EAAS,oBAAqB,CAClDoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAOyH,EAAkB,WAG7B5H,OAAOC,eAAenB,EAAS,kBAAmB,CAChDoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO0H,EAAgB,WAG3B7H,OAAOC,eAAenB,EAAS,YAAa,CAC1CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO2H,EAAU,WAGrB9H,OAAOC,eAAenB,EAAS,eAAgB,CAC7CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO4H,EAAa,WAGxB/H,OAAOC,eAAenB,EAAS,gBAAiB,CAC9CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO6H,EAAc,WAGzBhI,OAAOC,eAAenB,EAAS,iBAAkB,CAC/CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO8H,EAAe,WAG1BjI,OAAOC,eAAenB,EAAS,iBAAkB,CAC/CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO+H,EAAe,WAG1BlI,OAAOC,eAAenB,EAAS,eAAgB,CAC7CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAOgI,EAAa,WAIxB,IAAIP,EAAqBpG,EAAuBmG,EAAQ,KAEpDE,EAAmBrG,EAAuBmG,EAAQ,MAElDG,EAAatG,EAAuBmG,EAAQ,KAE5CI,EAAgBvG,EAAuBmG,EAAQ,MAE/CK,EAAiBxG,EAAuBmG,EAAQ,MAEhDM,EAAkBzG,EAAuBmG,EAAQ,MAEjDO,EAAkB1G,EAAuBmG,EAAQ,KAEjDQ,EAAgB3G,EAAuBmG,EAAQ,M,gBCtEnD,IAAIR,EAAK,EAAQ,IACbiB,EAAa,EAAQ,IACzBrJ,EAAOD,QAAU,EAAQ,IAAoB,SAAUoC,EAAQL,EAAKN,GAClE,OAAO4G,EAAGC,EAAElG,EAAQL,EAAKuH,EAAW,EAAG7H,KACrC,SAAUW,EAAQL,EAAKN,GAEzB,OADAW,EAAOL,GAAON,EACPW,I,cCNTnC,EAAOD,QAAU,SAAU4I,GACzB,MAAqB,iBAAPA,EAAyB,OAAPA,EAA4B,mBAAPA,I,cCDvD3I,EAAOD,QAAU,SAAUuJ,GACzB,IACE,QAASA,IACT,MAAOd,GACP,OAAO,K,gBCHX,IAAIe,EAAU,EAAQ,IAClBC,EAAU,EAAQ,IACtBxJ,EAAOD,QAAU,SAAU4I,GACzB,OAAOY,EAAQC,EAAQb,M,gBCJzB,IAAIc,EAAiB,EAAQ,KAEzBC,EAAuB,EAAQ,KAE/BC,EAA6B,EAAQ,IAErCC,EAAkB,EAAQ,KAM9B5J,EAAOD,QAJP,SAAS8J,eAAeC,EAAKvJ,GAC3B,OAAOkJ,EAAeK,IAAQJ,EAAqBI,EAAKvJ,IAAMoJ,EAA2BG,EAAKvJ,IAAMqJ,M,4NCTtG,QACA,YACA,Q,cAO2B,SAAdG,YAAcC,GACzB,OAAQC,SAASD,EAAI,KACnB,KAAK,EACH,MAAO,UACT,KAAK,GACH,MAAO,QACT,KAAK,IACH,MAAO,UACT,QACE,MAAO,K,kBAIkB,SAAlBE,gBAAkBF,GAC7B,OAAQC,SAASD,EAAI,KACnB,KAAK,EACH,OAAOG,cACT,KAAK,GACH,OAAOC,YACT,QACE,OAAOC,wB,yBAIyB,SAAzBC,uBAAyBN,GACpC,OAAQC,SAASD,EAAI,KACnB,KAAK,EACH,OAAOK,sBACT,KAAK,GACH,OAAOD,YACT,QACE,OAAOC,wBAIN,IAAME,GAAc,IAAAC,mBAAkB,CAAEzE,Y,8BAEpB,SAAd0E,YAAeC,EAAGlJ,GAAJ,aACzB,EAAAmJ,MAAMC,KAAK,CAAE1H,OAAQwH,IAClBG,KAAI,kBAAM,MACVC,OAFH,sBAEatJ,K,WAES,SAAXuJ,SAAYC,EAAQC,GAC/B,IAAIC,EACAC,EACAC,EAEAC,EADAC,EAAM,IAAIC,UAAUP,GAAQQ,SAAS,IAUzC,GANKP,IACHA,EAAO,IAGTG,EAAS,CAAEK,EAAG,MAAO,KAAM,UAAWR,EAAKG,SAAWH,EAAKG,QAAU,MAE/C,MAAlBE,EAAII,OAAO,GACb,MAAM,IAAIC,MAAM,4DASlB,IANAN,EAAqB,SAAdJ,EAAKI,KAAkBtD,KAAK6D,KAAKN,EAAIpI,OAAS,GAAK+H,EAAKI,MAAQ,EAEvEF,EAAMpD,KAAK6D,KAAKN,EAAIpI,QAAU,EAAImI,IAASA,EAC3CH,EAAMW,EAAOC,MAAMX,GAGZG,EAAIpI,OAAS,EAAIiI,GACtBG,EAAM,IAAH,OAAOA,GAYZ,OATKA,EAAIS,MAAM,IAAIC,OAAJ,aAAiB,EAAIX,EAArB,QAAgCY,QAAO,SAAAzJ,GAAC,OAAIA,EAAEU,OAAS,KAEnEgJ,SAAQ,SAACC,EAAO5L,GACjB,IAAK,IAAI6L,EAAI,EAAGA,EAAIf,EAAMe,IAAK,CAE7BlB,EADS3K,EAAI8K,GAAmB,QAAXD,EAAmBgB,EAAIf,EAAOe,EAAI,IAC7CnC,SAASkC,EAAME,MAAU,EAAJD,EAAW,EAAJA,EAAQ,GAAI,QAI/ClB,G,aAGiB,SAAboB,WAAcpB,EAAKD,GACzBA,IACHA,EAAO,IAGT,IAAIG,EACF,CAAEK,EAAG,MAAO,KAAM,UAAWR,EAAKG,SAAWH,EAAKG,QAAU,MAE1DC,EAAqB,SAAdJ,EAAKI,KAAkBtD,KAAK6D,KAAKV,EAAIhI,QAAU+H,EAAKI,MAAQ,EAEvE,GAAIH,EAAIhI,OAASmI,GAAS,EACxB,MAAM,IAAIkB,WAAJ,yBACcrB,EAAIhI,OADlB,yCACyDmI,EADzD,MAMR,IADA,IAAIC,EAAM,GACD/K,EAAI,EAAGA,EAAI2K,EAAIhI,OAAQ3C,GAAK8K,EAAM,CAEzC,IADA,IAAIc,EAAQ,GACHC,EAAI,EAAGA,EAAIf,EAAMe,IACxBD,EAAMK,KAAKtB,EAAI3K,GAAgB,QAAX6K,EAAmBgB,EAAIf,EAAOe,EAAI,KAGxDd,EAAIkB,KAAKL,EAAMtB,KAAI,SAAAjK,GAAC,OAAKA,EAAI,GAAK,IAAM,IAAMA,EAAE4K,SAAS,OAAKiB,KAAK,KAGrE,OAAO,IAAIlB,UAAUD,EAAImB,KAAK,IAAK,O,wCCtGrCzM,EAAOD,QAfP,SAAS2M,gBAAgBhK,EAAKZ,EAAKN,GAYjC,OAXIM,KAAOY,EACTzB,OAAOC,eAAewB,EAAKZ,EAAK,CAC9BN,MAAOA,EACPL,YAAY,EACZiC,cAAc,EACdC,UAAU,IAGZX,EAAIZ,GAAON,EAGNkB,I,cCZT1C,EAAOD,QAAU,SAAU4M,EAAQnL,GACjC,MAAO,CACLL,aAAuB,EAATwL,GACdvJ,eAAyB,EAATuJ,GAChBtJ,WAAqB,EAATsJ,GACZnL,MAAOA,K,gBCJX,IAAIgI,EAAU,EAAQ,IACtBxJ,EAAOD,QAAU,SAAU4I,GACzB,OAAO1H,OAAOuI,EAAQb,M,cCHxB3I,EAAOD,QAAU,I,gBCEjB,IAAI0C,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAQ6M,uBAAyB7M,EAAO,aAAc,EAEtD,IAAI8M,EAAgBpK,EAAuBmG,EAAQ,KAOnD7I,EAAO,QALW,CAChB+M,MAAO,QACPC,OAAQ,SACRC,QAAS,WAGX,IAwBIJ,EAAyB,CAC3BE,MAzB0B,CAC1BG,QAAS,CAACJ,EAAa,QAAYK,cACnCA,aAAc,CAACL,EAAa,QAAYI,QAASJ,EAAa,QAAYM,OAC1EA,MAAO,CAACN,EAAa,QAAYO,OACjCA,MAAO,IAsBPL,OApB2B,CAC3BE,QAAS,CAACJ,EAAa,QAAYK,cACnCA,aAAc,CAACL,EAAa,QAAYI,QAASJ,EAAa,QAAYQ,SAC1EA,QAAS,CAACR,EAAa,QAAYS,YACnCA,WAAY,CAACT,EAAa,QAAYQ,QAASR,EAAa,QAAYM,OACxEA,MAAO,CAACN,EAAa,QAAYQ,QAASR,EAAa,QAAYO,OACnEA,MAAO,IAePJ,QAb4B,CAC5BC,QAAS,CAACJ,EAAa,QAAYK,cACnCA,aAAc,CAACL,EAAa,QAAYI,QAASJ,EAAa,QAAYQ,SAC1EA,QAAS,CAACR,EAAa,QAAYS,YACnCA,WAAY,CAACT,EAAa,QAAYQ,QAASR,EAAa,QAAYU,QACxEA,OAAQ,CAACV,EAAa,QAAYQ,QAASR,EAAa,QAAYW,gBACpEA,eAAgB,CAACX,EAAa,QAAYU,OAAQV,EAAa,QAAYM,OAC3EA,MAAO,CAACN,EAAa,QAAYQ,QAASR,EAAa,QAAYU,OAAQV,EAAa,QAAYO,OACpGA,MAAO,KAOTrN,EAAQ6M,uBAAyBA,G,gBC9CjC,IAAIa,EAAa,EAAQ,IAGrBC,EAA0B,iBAARnJ,MAAoBA,MAAQA,KAAKtD,SAAWA,QAAUsD,KAGxE1E,EAAO4N,GAAcC,GAAY/F,SAAS,cAATA,GAErC3H,EAAOD,QAAUF,G,gBCPjB,IAAI8N,EAAQ,EAAQ,IAChBC,EAAc,EAAQ,IAE1B5N,EAAOD,QAAUkB,OAAO4M,MAAQ,SAASA,KAAKvF,GAC5C,OAAOqF,EAAMrF,EAAGsF,K,cCLlB5N,EAAOD,SAAU,G,cCAjB,IAAIiK,EAAK,EACL8D,EAAK/F,KAAKgG,SACd/N,EAAOD,QAAU,SAAU+B,GACzB,MAAO,UAAUgJ,YAAehF,IAARhE,EAAoB,GAAKA,EAAK,QAASkI,EAAK8D,GAAItC,SAAS,O,cCHnFzL,EAAQsI,EAAI,GAAG2F,sB,gBCEf,IAAIvL,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAIkO,EAAmBxL,EAAuBmG,EAAQ,IAElDsF,EAAgBzL,EAAuBmG,EAAQ,IAE/CO,EAAkB1G,EAAuBmG,EAAQ,KAEjDuF,EAAe1L,EAAuBmG,EAAQ,KAE9CiE,EAAgBpK,EAAuBmG,EAAQ,KAMnD,SAASwF,wBAAwB7H,QACA,IAApBd,KAAK4I,aACd5I,KAAK4I,WAAa,cAGhB9H,IAAS4H,EAAY,QAAYrB,aACP,IAAjBrH,KAAK6I,UACd7I,KAAK6I,QAAU,cAGjB7I,KAAK8I,WAAa,cAGhBhI,IAAS4H,EAAY,QAAYnB,eACF,IAAtBvH,KAAK+I,eACd/I,KAAK+I,aAAe,cAGtB/I,KAAKgJ,eAAiB,cAY1B,SAASC,qBAAqBnI,EAAMzF,EAAM6N,GACxC,IAAIC,EAAQnJ,KAER6I,EAAU/H,IAAS4H,EAAY,QAAYrB,MAAQ,KAAO,SAAUyB,GAEtE,OADAK,EAAML,WAAaA,EACZK,EAAMN,WAEXO,EAAOtI,IAAS4H,EAAY,QAAYnB,QAAU,KAAO,SAAUyB,GAErE,OADAG,EAAMH,eAAiBA,EAChBG,EAAMJ,gBAEf,OAAO,IAAIrF,EAAe,QAAYrI,EAAM6N,GAAc,SAAUG,GAClE,OAAOF,EAAMP,WAAWS,KACvBR,EAASO,GAQd,SAASE,uBAAuBC,GAC9B,IAAIC,EAASxJ,KAEbuJ,EAAIE,eAAc,WACZF,EAAIzI,SAAW4H,EAAY,QAAYrB,OACzCkC,EAAIL,eAAezC,SAAQ,SAAUrL,GACnCoO,EAAO7N,IAAIP,GAAGsO,UAAUC,gBAAe,WACrC,OAAOH,EAAOV,mBAKhBS,EAAIzI,SAAW4H,EAAY,QAAYnB,SACzCgC,EAAIL,eAAezC,SAAQ,SAAUrL,GACnCoO,EAAO7N,IAAIP,GAAGsO,UAAUE,mBAAkB,WACxC,OAAOJ,EAAOR,0BAWxB,SAASa,yBACP,IAAIC,EAAW,CACblB,WAAY5I,KAAK4I,WACjBC,QAAS7I,KAAK6I,QACdE,aAAc/I,KAAK+I,cAGrB/I,KAAK4I,WAAa,SAAUS,GAC1B,GAAIrJ,KAAK0J,UAAUK,UAAY3C,EAAa,QAAYK,aACtD,MAAM,IAAIvB,MAAM,wCAA0ClG,KAAK0J,UAAUK,QAAU,0FAGrF,OAAOD,EAASlB,WAAWzI,MAAMH,KAAM,CAACqJ,UAGV,IAArBS,EAASjB,UAClB7I,KAAK6I,QAAU,WACb,GAAI7I,KAAK0J,UAAUK,UAAY3C,EAAa,QAAYS,WACtD,MAAM,IAAI3B,MAAM,sCAAwClG,KAAK0J,UAAUK,QAAU,oFAGnF,OAAOD,EAASjB,QAAQ1I,MAAMH,aAIG,IAA1B8J,EAASf,eAClB/I,KAAK+I,aAAe,WAClB,GAAI/I,KAAK0J,UAAUK,UAAY3C,EAAa,QAAYW,eACtD,MAAM,IAAI7B,MAAM,0CAA4ClG,KAAK0J,UAAUK,QAAU,8FAGvF,OAAOD,EAASf,aAAa5I,MAAMH,QAKzC,IAmDIgK,EAnD2B,WAM7B,SAASC,YAAYnJ,EAAMzF,GACzB,IAAI6N,EAAehJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAQvF,IAPA,EAAIsI,EAAgB,SAAaxI,KAAMiK,aAClC5O,IAAMA,EAAO2E,KAAKtB,YAAYwL,MAE/BlK,KAAKtB,YAAYwK,eACnBA,EAAelJ,KAAKtB,YAAYwK,mBAGW,IAAlCR,EAAY,QAAY5H,GACjC,MAAM,IAAIoF,MAAM,wBAA0BpF,GAG5C6H,wBAAwB1N,KAAK+E,KAAMc,GAEnCd,KAAKmK,gBAAkBlB,qBAAqBhO,KAAK+E,KAAMc,EAAMzF,EAAM6N,GAEnEI,uBAAuBrO,KAAK+E,KAAMA,KAAKmK,iBAEvCN,uBAAuB5O,KAAK+E,MAuB9B,OAhBA,EAAIyI,EAAa,SAAawB,YAAa,CAAC,CAC1C5N,IAAK,UACLN,MAAO,SAAS2N,UACd,OAAO1J,KAAKmK,kBAOb,CACD9N,IAAK,MACLN,MAAO,SAASJ,IAAIyO,GAClB,OAAOpK,KAAKmK,gBAAgBC,WAAWA,OAGpCH,YAhDsB,GAoD/B3P,EAAO,QAAc0P,G,gBC5LrB,IAGIK,EAHY,EAAQ,GAGLC,CAAU9O,OAAQ,UAErCjB,EAAOD,QAAU+P,G,gBCLjB,IAAIxO,EAAS,EAAQ,IACjB0O,EAAY,EAAQ,KACpBC,EAAiB,EAAQ,KAOzBC,EAAiB5O,EAASA,EAAOC,iBAAcuE,EAkBnD9F,EAAOD,QATP,SAASoQ,WAAW3O,GAClB,OAAa,MAATA,OACesE,IAAVtE,EAdQ,qBADL,gBAiBJ0O,GAAkBA,KAAkBjP,OAAOO,GAC/CwO,EAAUxO,GACVyO,EAAezO,K,gBCxBrB,IAAI4O,EAAK,EAAQ,KAoBjBpQ,EAAOD,QAVP,SAASsQ,aAAaC,EAAOxO,GAE3B,IADA,IAAIoB,EAASoN,EAAMpN,OACZA,KACL,GAAIkN,EAAGE,EAAMpN,GAAQ,GAAIpB,GACvB,OAAOoB,EAGX,OAAQ,I,gBCjBV,IAAIqN,EAAY,EAAQ,KAiBxBvQ,EAAOD,QAPP,SAASyQ,WAAW3F,EAAK/I,GACvB,IAAI2O,EAAO5F,EAAI6F,SACf,OAAOH,EAAUzO,GACb2O,EAAmB,iBAAP3O,EAAkB,SAAW,QACzC2O,EAAK5F,M,cCcX7K,EAAOD,QAJP,SAAS4Q,aAAanP,GACpB,OAAgB,MAATA,GAAiC,iBAATA,I,gBCxBjC,IAAIoP,EAAY,EAAQ,KACxB5Q,EAAOD,QAAU,SAAUyF,EAAIqL,EAAM3N,GAEnC,GADA0N,EAAUpL,QACGM,IAAT+K,EAAoB,OAAOrL,EAC/B,OAAQtC,GACN,KAAK,EAAG,OAAO,SAAUuE,GACvB,OAAOjC,EAAG9E,KAAKmQ,EAAMpJ,IAEvB,KAAK,EAAG,OAAO,SAAUA,EAAGC,GAC1B,OAAOlC,EAAG9E,KAAKmQ,EAAMpJ,EAAGC,IAE1B,KAAK,EAAG,OAAO,SAAUD,EAAGC,EAAG9G,GAC7B,OAAO4E,EAAG9E,KAAKmQ,EAAMpJ,EAAGC,EAAG9G,IAG/B,OAAO,WACL,OAAO4E,EAAGI,MAAMiL,EAAMlL,c,gBChB1B,IAAI+C,EAAW,EAAQ,IAGvB1I,EAAOD,QAAU,SAAU4I,EAAI3B,GAC7B,IAAK0B,EAASC,GAAK,OAAOA,EAC1B,IAAInD,EAAIsL,EACR,GAAI9J,GAAkC,mBAArBxB,EAAKmD,EAAG6C,YAA4B9C,EAASoI,EAAMtL,EAAG9E,KAAKiI,IAAM,OAAOmI,EACzF,GAAgC,mBAApBtL,EAAKmD,EAAGoI,WAA2BrI,EAASoI,EAAMtL,EAAG9E,KAAKiI,IAAM,OAAOmI,EACnF,IAAK9J,GAAkC,mBAArBxB,EAAKmD,EAAG6C,YAA4B9C,EAASoI,EAAMtL,EAAG9E,KAAKiI,IAAM,OAAOmI,EAC1F,MAAMhO,UAAU,6C,cCVlB,IAAI0I,EAAW,GAAGA,SAElBxL,EAAOD,QAAU,SAAU4I,GACzB,OAAO6C,EAAS9K,KAAKiI,GAAI0D,MAAM,GAAI,K,cCFrCrM,EAAOD,QAAU,SAAU4I,GACzB,GAAU7C,MAAN6C,EAAiB,MAAM7F,UAAU,yBAA2B6F,GAChE,OAAOA,I,cCFT,IAAIiD,EAAO7D,KAAK6D,KACZoF,EAAQjJ,KAAKiJ,MACjBhR,EAAOD,QAAU,SAAU4I,GACzB,OAAOsI,MAAMtI,GAAMA,GAAM,GAAKA,EAAK,EAAIqI,EAAQpF,GAAMjD,K,gBCJvD,IAAIuI,EAAS,EAAQ,GAAR,CAAqB,QAC9BzM,EAAM,EAAQ,IAClBzE,EAAOD,QAAU,SAAU+B,GACzB,OAAOoP,EAAOpP,KAASoP,EAAOpP,GAAO2C,EAAI3C,M,gBCH3C,IAAI+B,EAAO,EAAQ,GACfqC,EAAS,EAAQ,IAEjB1B,EAAQ0B,EADC,wBACkBA,EADlB,sBACmC,KAE/ClG,EAAOD,QAAU,SAAU+B,EAAKN,GAC/B,OAAOgD,EAAM1C,KAAS0C,EAAM1C,QAAiBgE,IAAVtE,EAAsBA,EAAQ,MAChE,WAAY,IAAIgL,KAAK,CACtB1I,QAASD,EAAKC,QACdpC,KAAM,EAAQ,IAAgB,OAAS,SACvCyP,UAAW,0C,cCTbnR,EAAOD,QAAU,gGAEfgM,MAAM,M,cCHRhM,EAAQsI,EAAIpH,OAAOmQ,uB,gBCCnB,IAAIC,EAAM,EAAQ,IAAR,EAAwB,GAGlC,EAAQ,GAAR,CAA0BC,OAAQ,UAAU,SAAUC,GACpD9L,KAAK+L,GAAKF,OAAOC,GACjB9L,KAAKgM,GAAK,KAET,WACD,IAEIC,EAFApJ,EAAI7C,KAAK+L,GACTG,EAAQlM,KAAKgM,GAEjB,OAAIE,GAASrJ,EAAEpF,OAAe,CAAE1B,WAAOsE,EAAWV,MAAM,IACxDsM,EAAQL,EAAI/I,EAAGqJ,GACflM,KAAKgM,IAAMC,EAAMxO,OACV,CAAE1B,MAAOkQ,EAAOtM,MAAM,Q,gBCd/B,IAAI6C,EAAW,EAAQ,IACnB2J,EAAM,EAAQ,KACdhE,EAAc,EAAQ,IACtBiE,EAAW,EAAQ,GAAR,CAAyB,YACpCC,MAAQ,aAIRC,WAAa,WAEf,IAIIC,EAJAC,EAAS,EAAQ,GAAR,CAAyB,UAClC1R,EAAIqN,EAAY1K,OAcpB,IAVA+O,EAAOC,MAAMC,QAAU,OACvB,EAAQ,KAAWC,YAAYH,GAC/BA,EAAOI,IAAM,eAGbL,EAAiBC,EAAOK,cAAcC,UACvBC,OACfR,EAAeS,MAAMC,uCACrBV,EAAeW,QACfZ,WAAaC,EAAepL,EACrBrG,YAAYwR,WAAoB,UAAEnE,EAAYrN,IACrD,OAAOwR,cAGT/R,EAAOD,QAAUkB,OAAOY,QAAU,SAASA,OAAOyG,EAAGsK,GACnD,IAAIC,EAQJ,OAPU,OAANvK,GACFwJ,MAAe,UAAI7J,EAASK,GAC5BuK,EAAS,IAAIf,MACbA,MAAe,UAAI,KAEnBe,EAAOhB,GAAYvJ,GACduK,EAASd,kBACMjM,IAAf8M,EAA2BC,EAASjB,EAAIiB,EAAQD,K,gBCvCzD,IAAIE,EAAM,EAAQ,IAAgBzK,EAC9BhC,EAAM,EAAQ,IACd0M,EAAM,EAAQ,EAAR,CAAkB,eAE5B/S,EAAOD,QAAU,SAAU4I,EAAIqK,EAAKC,GAC9BtK,IAAOtC,EAAIsC,EAAKsK,EAAOtK,EAAKA,EAAGtG,UAAW0Q,IAAMD,EAAInK,EAAIoK,EAAK,CAAE3P,cAAc,EAAM5B,MAAOwR,M,gBCLhGjT,EAAQsI,EAAI,EAAQ,I,gBCApB,IAAInC,EAAS,EAAQ,IACjBrC,EAAO,EAAQ,GACfqP,EAAU,EAAQ,IAClBC,EAAS,EAAQ,IACjBjS,EAAiB,EAAQ,IAAgBmH,EAC7CrI,EAAOD,QAAU,SAAUe,GACzB,IAAIsS,EAAUvP,EAAKvC,SAAWuC,EAAKvC,OAAS4R,EAAU,GAAKhN,EAAO5E,QAAU,IACtD,KAAlBR,EAAK4K,OAAO,IAAe5K,KAAQsS,GAAUlS,EAAekS,EAAStS,EAAM,CAAEU,MAAO2R,EAAO9K,EAAEvH,O,cCPnG,SAASuS,gBAAgBrS,EAAGuB,GAM1B,OALAvC,EAAOD,QAAUsT,gBAAkBpS,OAAOyC,gBAAkB,SAAS2P,gBAAgBrS,EAAGuB,GAEtF,OADAvB,EAAE4C,UAAYrB,EACPvB,GAGFqS,gBAAgBrS,EAAGuB,GAG5BvC,EAAOD,QAAUsT,iB,gBCPjB,IAAI5Q,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAQuT,2BAA6BvT,EAAQwT,uBAAyBxT,EAAQyT,oBAAsBzT,EAAO,aAAc,EAEzH,IAAI0T,EAAWhR,EAAuBmG,EAAQ,KAE1C8K,EAAQjR,EAAuBmG,EAAQ,MAEvCsF,EAAgBzL,EAAuBmG,EAAQ,IAE/CqF,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAElDkL,EAAoBrR,EAAuBmG,EAAQ,KAEnDmL,EAAuBtR,EAAuBmG,EAAQ,MAE1D,SAASoL,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAO3b,IAAIW,EAAmC,SAAUmB,IAC/C,EAAIhB,EAAU,SAAaH,oBAAqBmB,GAEhD,IAAIC,EAASZ,aAAaR,qBAE1B,SAASA,oBAAoBqB,GAE3B,OADA,EAAI5G,EAAgB,SAAaxI,KAAM+N,qBAChCoB,EAAOlU,KAAK+E,KAAMoP,GAG3B,OAAOrB,oBAV8B,EAWvB,EAAIM,EAAiB,SAAanI,QAMlD5L,EAAQyT,oBAAsBA,EAE9B,IAAID,EAAsC,SAAUuB,IAClD,EAAInB,EAAU,SAAaJ,uBAAwBuB,GAEnD,IAAIC,EAAUf,aAAaT,wBAE3B,SAASA,uBAAuByB,EAASnF,GAEvC,OADA,EAAI5B,EAAgB,SAAaxI,KAAM8N,wBAChCwB,EAAQrU,KAAK+E,KAAM,oBAAsBoK,EAAa,2BAA6BmF,GAG5F,OAAOzB,uBAViC,EAW1B,EAAIO,EAAiB,SAAanI,QAMlD5L,EAAQwT,uBAAyBA,EAEjC,IAAID,EAA0C,SAAU2B,IACtD,EAAItB,EAAU,SAAaL,2BAA4B2B,GAEvD,IAAIC,EAAUlB,aAAaV,4BAE3B,SAASA,2BAA2B0B,EAASnF,GAE3C,OADA,EAAI5B,EAAgB,SAAaxI,KAAM6N,4BAChC4B,EAAQxU,KAAK+E,KAAM,cAAgBoK,EAAa,eAAiBmF,EAAU,oBAGpF,OAAO1B,2BAVqC,EAW9B,EAAIQ,EAAiB,SAAanI,QAUlD,SAASwJ,qBAAqBC,GAC5B,OAAO/P,QAAQgQ,IAAI5P,KAAKkJ,eAAe9D,KAAI,SAAUgF,GACnD,OAAOuF,EAASvF,OAJpB9P,EAAQuT,2BAA6BA,EAYrC,IAAIgC,EAA8B,SAAUC,IAC1C,EAAI5B,EAAU,SAAa2B,eAAgBC,GAE3C,IAAIC,EAAUxB,aAAasB,gBAsB3B,SAASA,eAAexU,GACtB,IAAI8N,EAEAD,EAAehJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GACnF8P,EAAO9P,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAC3E2I,EAAU3I,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAC9EkJ,EAAOlJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAI/E,IAHA,EAAIsI,EAAgB,SAAaxI,KAAM6P,gBACvC1G,EAAQ4G,EAAQ9U,KAAK+E,KAAMgQ,EAAMnH,EAASO,IAErC/N,EACH,MAAM,IAAI6K,MAAM,mCASlB,OANAiD,EAAM8G,MAAQ5U,EACd8N,EAAM+G,cAAgBhH,EACtBC,EAAMgH,YAAc,GACpBjH,EAAazC,SAAQ,SAAUrL,GAC7B,OAAO+N,EAAMgH,YAAY/U,GAAK,QAEzB+N,EAsGT,OA9IA,EAAIV,EAAa,SAAaoH,eAAgB,KAAM,CAAC,CACnDxT,IAAK,iBAMLN,MAAO,SAASqU,eAAeb,GAC7B,OAAmB,OAAZA,GAA0D,YAAtC,EAAIvB,EAAQ,SAAauB,IAAoD,mBAApBA,EAAQ7F,aAmChG,EAAIjB,EAAa,SAAaoH,eAAgB,CAAC,CAC7CxT,IAAK,OACLN,MAAO,SAASV,OACd,OAAO2E,KAAKiQ,QAEb,CACD5T,IAAK,eACLN,MAAO,SAASmN,eACd,OAAOlJ,KAAKkQ,gBAEb,CACD7T,IAAK,SACLN,MAAO,SAASsU,OAAOjG,EAAYmF,GACjC,QAA4C,IAAjCvP,KAAKmQ,YAAY/F,GAC1B,MAAM,IAAI0D,EAAuB9N,KAAK3E,OAAQ+O,GAGhD,IAAKyF,eAAeO,eAAeb,GACjC,MAAM,IAAIxB,EAAoB,oCAAsC/N,KAAK3E,QAI3E,OADA2E,KAAKmQ,YAAY/F,GAAcmF,EACxBvP,OAER,CACD3D,IAAK,aACLN,MAAO,SAASqO,WAAW/O,GACzB,IAAK2E,KAAKmQ,YAAY9U,GACpB,MAAM,IAAIwS,EAA2B7N,KAAK3E,OAAQA,GAGpD,OAAO2E,KAAKmQ,YAAY9U,KAEzB,CACDgB,IAAK,aACLN,MAAO,SAAS6M,aACd,IAAIY,EAASxJ,KAEb,OAAOA,KAAKsQ,yBAAyBzQ,MAAK,WACxC,OAAO,EAAIoO,EAAK,UAAa,EAAIG,EAAgB,SAAayB,eAAejT,WAAY,aAAc4M,GAAQvO,KAAKuO,EAAQA,EAAO+G,gBAGtI,CACDlU,IAAK,UACLN,MAAO,SAAS8M,UACd,IAAI2H,EAASxQ,KAEb,OAAOA,KAAKyQ,sBAAsB5Q,MAAK,WACrC,OAAO,EAAIoO,EAAK,UAAa,EAAIG,EAAgB,SAAayB,eAAejT,WAAY,UAAW4T,GAAQvV,KAAKuV,QAGpH,CACDnU,IAAK,eACLN,MAAO,SAASgN,eACd,IAAI2H,EAAS1Q,KAEb,OAAOA,KAAK2Q,2BAA2B9Q,MAAK,WAC1C,OAAO,EAAIoO,EAAK,UAAa,EAAIG,EAAgB,SAAayB,eAAejT,WAAY,eAAgB8T,GAAQzV,KAAKyV,QAGzH,CACDrU,IAAK,yBACLN,MAAO,SAASuU,yBACd,IAAIM,EAAS5Q,KAEb,OAAO0P,qBAAqBzU,KAAK+E,MAAM,SAAU5E,GAC/C,OAAOwV,EAAOxG,WAAWhP,GAAGsO,UAAUd,kBAGzC,CACDvM,IAAK,sBACLN,MAAO,SAAS0U,sBACd,IAAII,EAAS7Q,KAEb,OAAO0P,qBAAqBzU,KAAK+E,MAAM,SAAU5E,GAC/C,OAAOyV,EAAOzG,WAAWhP,GAAGsO,UAAUb,eAGzC,CACDxM,IAAK,2BACLN,MAAO,SAAS4U,2BACd,IAAIG,EAAS9Q,KAEb,OAAO0P,qBAAqBzU,KAAK+E,MAAM,SAAU5E,GAC/C,OAAO0V,EAAO1G,WAAWhP,GAAGsO,UAAUX,oBAGzC,CACD1M,IAAK,gBACLN,MAAO,SAASgV,gBACd,IAAIC,EAAShR,KAEb,MAAO,CACL0J,QAAS,SAASA,UAChB,OAAOsH,QAKRnB,eAnJyB,CAoJhCvB,EAAoB,SAEtBhU,EAAO,QAAcuV,G,gBC7PrB,IAAI3R,EAAiB,EAAQ,GAEzBD,EAAiB,EAAQ,IAEzBgT,EAAmB,EAAQ,KAE3BrC,EAAY,EAAQ,KAExB,SAASsC,iBAAiBC,GACxB,IAAIC,EAAwB,mBAARC,IAAqB,IAAIA,SAAQhR,EA8BrD,OA5BA9F,EAAOD,QAAU4W,iBAAmB,SAASA,iBAAiBC,GAC5D,GAAc,OAAVA,IAAmBF,EAAiBE,GAAQ,OAAOA,EAEvD,GAAqB,mBAAVA,EACT,MAAM,IAAI9T,UAAU,sDAGtB,QAAsB,IAAX+T,EAAwB,CACjC,GAAIA,EAAOxQ,IAAIuQ,GAAQ,OAAOC,EAAOzV,IAAIwV,GAEzCC,EAAOE,IAAIH,EAAOI,SAGpB,SAASA,UACP,OAAO3C,EAAUuC,EAAOjR,UAAWhC,EAAe8B,MAAMtB,aAW1D,OARA6S,QAAQ3U,UAAYpB,OAAOY,OAAO+U,EAAMvU,UAAW,CACjD8B,YAAa,CACX3C,MAAOwV,QACP7V,YAAY,EACZkC,UAAU,EACVD,cAAc,KAGXM,EAAesT,QAASJ,IAG1BD,iBAAiBC,GAG1B5W,EAAOD,QAAU4W,kB,gBC1CjB,IAAIvS,EAAU,EAAQ,IAEtB,SAAS6S,2BACP,GAAuB,mBAAZC,QAAwB,OAAO,KAC1C,IAAIC,EAAQ,IAAID,QAMhB,OAJAD,yBAA2B,SAASA,2BAClC,OAAOE,GAGFA,EA4CTnX,EAAOD,QAzCP,SAASqX,wBAAwB1U,GAC/B,GAAIA,GAAOA,EAAIf,WACb,OAAOe,EAGT,GAAY,OAARA,GAAiC,WAAjB0B,EAAQ1B,IAAoC,mBAARA,EACtD,MAAO,CACL,QAAWA,GAIf,IAAIyU,EAAQF,2BAEZ,GAAIE,GAASA,EAAM9Q,IAAI3D,GACrB,OAAOyU,EAAM/V,IAAIsB,GAGnB,IAAI2U,EAAS,GACTC,EAAwBrW,OAAOC,gBAAkBD,OAAOsW,yBAE5D,IAAK,IAAIzV,KAAOY,EACd,GAAIzB,OAAOoB,UAAUC,eAAe5B,KAAKgC,EAAKZ,GAAM,CAClD,IAAI0V,EAAOF,EAAwBrW,OAAOsW,yBAAyB7U,EAAKZ,GAAO,KAE3E0V,IAASA,EAAKpW,KAAOoW,EAAKT,KAC5B9V,OAAOC,eAAemW,EAAQvV,EAAK0V,GAEnCH,EAAOvV,GAAOY,EAAIZ,GAWxB,OANAuV,EAAgB,QAAI3U,EAEhByU,GACFA,EAAMJ,IAAIrU,EAAK2U,GAGVA,I,gBCjDTpW,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EACrB,IAUI0P,EAVe,CACjBxC,QAAS,UACTC,aAAc,eACdG,QAAS,UACTC,WAAY,aACZC,OAAQ,SACRC,eAAgB,iBAChBL,MAAO,QACPC,MAAO,SAGTrN,EAAO,QAAc0P,G,gBCjBrB,IAAIgI,EAAe,EAAQ,KACvBC,EAAW,EAAQ,KAevB1X,EAAOD,QALP,SAASgQ,UAAU5N,EAAQL,GACzB,IAAIN,EAAQkW,EAASvV,EAAQL,GAC7B,OAAO2V,EAAajW,GAASA,OAAQsE,I,gBCbvC,IAGIxE,EAHO,EAAQ,IAGDA,OAElBtB,EAAOD,QAAUuB,G,cCLjB,IAAIqW,EAGJA,EAAI,WACH,OAAOlS,KADJ,GAIJ,IAECkS,EAAIA,GAAK,IAAIhQ,SAAS,cAAb,GACR,MAAOa,GAEc,iBAAXrI,SAAqBwX,EAAIxX,QAOrCH,EAAOD,QAAU4X,G,cCWjB3X,EAAOD,QALP,SAAS2I,SAASlH,GAChB,IAAI+E,SAAc/E,EAClB,OAAgB,MAATA,IAA0B,UAAR+E,GAA4B,YAARA,K,gBC3B/C,IAAIqR,EAAoB,EAAQ,KAE5BC,EAAkB,EAAQ,KAE1BlO,EAA6B,EAAQ,IAErCmO,EAAoB,EAAQ,KAMhC9X,EAAOD,QAJP,SAASgY,mBAAmBjO,GAC1B,OAAO8N,EAAkB9N,IAAQ+N,EAAgB/N,IAAQH,EAA2BG,IAAQgO,M,cCR9F,IAWIE,EAAehM,OAAO,uFAa1BhM,EAAOD,QAJP,SAASkY,WAAWC,GAClB,OAAOF,EAAaG,KAAKD,K,gBCpB3BjX,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAQyK,kBAAoBzK,EAAQqY,cAAWtS,EAE/C,IAEIuS,EAAW5V,uBAFD,EAAQ,KAMlBoR,EAAmBpR,uBAFD,EAAQ,KAM1B6V,EAAmB7V,uBAFA,EAAQ,KAM3B8V,EAA8B9V,uBAFA,EAAQ,KAMtC+V,EAAa/V,uBAFA,EAAQ,KAIzB1C,EAAQiG,eASR,SAASA,eAAeyS,GAGtB,IAAIC,EAAY,SAASA,UAAUC,EAAQC,GACzC,OAAO,IAAIC,EAAUF,EAAQC,IAG3BC,EAAY,SAAUC,GAGxB,SAASD,UAAUF,EAAQC,IACzB,EAAIN,EAAiBS,SAAStT,KAAMoT,WAEpC,IAAIjK,GAAQ,EAAI2J,EAA4BQ,SAAStT,MAAOoT,UAAUjV,YAAa,EAAIiQ,EAAiBkF,SAASF,YAAYnY,KAAK+E,KAAMkT,EAAQC,IAYhJ,OAVAhK,EAAM6J,OAASA,EASf7J,EAAMrI,KAAOmS,EACN9J,EAGT,OApBA,EAAI4J,EAAWO,SAASF,UAAWC,GAoB5BD,UArBO,CAsBdT,GAmBF,OAdAnX,OAAOC,eAAe2X,EAAW,OAAQ,CAAErX,MAAOiX,IAClDxX,OAAOC,eAAe2X,EAAW,SAAU,CAAErX,MAAOiX,KAEpD,EAAIJ,EAASU,SAASL,EAAW,CAC/BM,IAAKC,qBAAqBP,EAAWD,EAAQ,OAC7CS,IAAKD,qBAAqBP,EAAWD,EAAQ,OAC7CU,IAAKF,qBAAqBP,EAAWD,EAAQ,OAC7CA,OAAQA,EACRW,WAAY,SAASA,WAAW1W,GAC9B,OAAOA,aAAemW,MAI1B,EAAIR,EAASU,SAASF,EAAW,CAAEG,IAAKN,EAAUM,IAAKE,IAAKR,EAAUQ,MAC/DR,GAxDT3Y,EAAQsZ,oBA2DR,SAASA,oBAAoBC,EAAkBC,GAC7C,IAAIC,EAAYF,EAAiB,GAAGnV,YAChCsV,EAAcF,EAAmB,GAAGpV,YAEpCuU,EAAY,SAASA,UAAUC,EAAQC,GACzC,OAAO,IAAIc,EAAWC,cAAchB,EAAQa,EAAWC,EAAab,IAGlEH,EAASe,EAAUf,OAAS,IAAMgB,EAAYhB,OAYlD,OAVA,EAAIJ,EAASU,SAASL,EAAW,CAC/BM,IAAKC,qBAAqBP,EAAWD,EAAQ,OAC7CS,IAAKD,qBAAqBP,EAAWD,EAAQ,OAC7CU,IAAKF,qBAAqBP,EAAWD,EAAQ,OAC7CA,OAAQA,EACRW,WAAY,SAASA,WAAW1W,GAC9B,OAAOA,aAAegX,EAAWC,eAAiBjX,EAAI+V,SAAWA,KAI9DC,GA7ET,IAAIgB,EAAa,EAAQ,KAEzB,SAASjX,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAEvF,IAAI0V,EAAWrY,EAAQqY,SAAWsB,EAAWtB,SA4E7C,SAASa,qBAAqBP,EAAWD,EAAQG,GAC/C,IAAIpT,EAAK,SAASA,GAAGmT,GACnB,OAAOD,EAAUC,EAAQC,IAK3B,OAFApT,EAAGiT,OAASA,EACZjT,EAAGoT,MAAQA,EACJpT,EAYezF,EAAQyK,kBAAoB,SAASA,kBAAkBoP,GAC7E,OAAO,SAAUjB,EAAQkB,GACvB,GAAIlB,aAAkBP,EAAU,OAAOO,EACvC,IAAKkB,EAAM,MAAM,IAAIlO,MAAM,4BAC3B,IAAI7J,EAAsB,iBAAT+X,EAAoBA,EAAKC,cAAgBD,EAAKpB,OAC3DsB,EAAOH,EAAW9X,GACtB,IAAKiY,EACH,MAAM,IAAIpO,MAAM,gCAAkC7J,EAAM,KAE1D,OAAOiY,EAAKpB,EAAQkB,EAAKjB,U,gBC1I7B5Y,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAAqC4B,YAAY,I,gBCAvF3B,EAAOD,SAAW,EAAQ,MAAsB,EAAQ,GAAR,EAAoB,WAClE,OAA4G,GAArGkB,OAAOC,eAAe,EAAQ,GAAR,CAAyB,OAAQ,IAAK,CAAEE,IAAK,WAAc,OAAO,KAAQqG,M,gBCDzG,IAAIiB,EAAW,EAAQ,IACnB6J,EAAW,EAAQ,IAAaA,SAEhCyH,EAAKtR,EAAS6J,IAAa7J,EAAS6J,EAAS0H,eACjDja,EAAOD,QAAU,SAAU4I,GACzB,OAAOqR,EAAKzH,EAAS0H,cAActR,GAAM,K,gBCL3C,IAAItC,EAAM,EAAQ,IACd6T,EAAY,EAAQ,IACpBC,EAAe,EAAQ,IAAR,EAA6B,GAC5CtI,EAAW,EAAQ,GAAR,CAAyB,YAExC7R,EAAOD,QAAU,SAAUoC,EAAQiY,GACjC,IAGItY,EAHAwG,EAAI4R,EAAU/X,GACd5B,EAAI,EACJsS,EAAS,GAEb,IAAK/Q,KAAOwG,EAAOxG,GAAO+P,GAAUxL,EAAIiC,EAAGxG,IAAQ+Q,EAAOrG,KAAK1K,GAE/D,KAAOsY,EAAMlX,OAAS3C,GAAO8F,EAAIiC,EAAGxG,EAAMsY,EAAM7Z,SAC7C4Z,EAAatH,EAAQ/Q,IAAQ+Q,EAAOrG,KAAK1K,IAE5C,OAAO+Q,I,gBCdT,IAAIwH,EAAM,EAAQ,IAElBra,EAAOD,QAAUkB,OAAO,KAAK+M,qBAAqB,GAAK/M,OAAS,SAAU0H,GACxE,MAAkB,UAAX0R,EAAI1R,GAAkBA,EAAGoD,MAAM,IAAM9K,OAAO0H,K,gBCHrD,IAAI2R,EAAY,EAAQ,IACpBC,EAAMxS,KAAKwS,IACfva,EAAOD,QAAU,SAAU4I,GACzB,OAAOA,EAAK,EAAI4R,EAAID,EAAU3R,GAAK,kBAAoB,I,gBCJzD3I,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAA+C4B,YAAY,I,gBCCjG,IAAI0E,EAAM,EAAQ,IACdmU,EAAW,EAAQ,IACnB3I,EAAW,EAAQ,GAAR,CAAyB,YACpC4I,EAAcxZ,OAAOoB,UAEzBrC,EAAOD,QAAUkB,OAAO0C,gBAAkB,SAAU2E,GAElD,OADAA,EAAIkS,EAASlS,GACTjC,EAAIiC,EAAGuJ,GAAkBvJ,EAAEuJ,GACH,mBAAjBvJ,EAAEnE,aAA6BmE,aAAaA,EAAEnE,YAChDmE,EAAEnE,YAAY9B,UACdiG,aAAarH,OAASwZ,EAAc,O,gBCT/C1a,EAAQ4B,YAAa,EAErB5B,EAAQgZ,QAAU,SAAUnW,EAAUC,GACpC,KAAMD,aAAoBC,GACxB,MAAM,IAAIC,UAAU,uC,gBCJxB/C,EAAQ4B,YAAa,EAErB,IAEI+Y,EAEJ,SAASjY,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAFxED,CAFA,EAAQ,KAMvB1C,EAAQgZ,QAAU,SAAUxU,EAAM7D,GAChC,IAAK6D,EACH,MAAM,IAAIoW,eAAe,6DAG3B,OAAOja,GAAuF,iBAA7D,IAATA,EAAuB,aAAc,EAAIga,EAAS3B,SAASrY,KAAuC,mBAATA,EAA8B6D,EAAP7D,I,gBCb1IX,EAAQ4B,YAAa,EAErB,IAEIiZ,EAAanY,uBAFD,EAAQ,MAMpBoY,EAAWpY,uBAFD,EAAQ,MAIlB2B,EAAsC,mBAArByW,EAAS9B,SAAwD,iBAAvB6B,EAAW7B,QAAuB,SAAUrW,GAAO,cAAcA,GAAS,SAAUA,GAAO,OAAOA,GAAmC,mBAArBmY,EAAS9B,SAA0BrW,EAAIyB,cAAgB0W,EAAS9B,SAAWrW,IAAQmY,EAAS9B,QAAQ1W,UAAY,gBAAkBK,GAEjT,SAASD,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAEvF3C,EAAQgZ,QAAsC,mBAArB8B,EAAS9B,SAA0D,WAAhC3U,EAAQwW,EAAW7B,SAAwB,SAAUrW,GAC/G,YAAsB,IAARA,EAAsB,YAAc0B,EAAQ1B,IACxD,SAAUA,GACZ,OAAOA,GAAmC,mBAArBmY,EAAS9B,SAA0BrW,EAAIyB,cAAgB0W,EAAS9B,SAAWrW,IAAQmY,EAAS9B,QAAQ1W,UAAY,cAA0B,IAARK,EAAsB,YAAc0B,EAAQ1B,K,gBClBrM,IAAIwQ,EAAU,EAAQ,IAClB5M,EAAU,EAAQ,IAClBwU,EAAW,EAAQ,IACnB1U,EAAO,EAAQ,IACf2U,EAAY,EAAQ,IACpBC,EAAc,EAAQ,KACtBC,EAAiB,EAAQ,IACzBtX,EAAiB,EAAQ,IACzBuX,EAAW,EAAQ,EAAR,CAAkB,YAC7BC,IAAU,GAAGtN,MAAQ,QAAU,GAAGA,QAKlCuN,WAAa,WAAc,OAAO3V,MAEtCzF,EAAOD,QAAU,SAAUsb,EAAMC,EAAMzY,EAAa0Y,EAAMC,EAASC,EAAQC,GACzEV,EAAYnY,EAAayY,EAAMC,GAC/B,IAeII,EAAS7Z,EAAK8Z,EAfdC,UAAY,SAAUC,GACxB,IAAKX,GAASW,KAAQC,EAAO,OAAOA,EAAMD,GAC1C,OAAQA,GACN,IAVK,OAUM,OAAO,SAASjO,OAAS,OAAO,IAAIhL,EAAY4C,KAAMqW,IACjE,IAVO,SAUM,OAAO,SAASE,SAAW,OAAO,IAAInZ,EAAY4C,KAAMqW,IACrE,OAAO,SAASG,UAAY,OAAO,IAAIpZ,EAAY4C,KAAMqW,KAEzD/I,EAAMuI,EAAO,YACbY,EAdO,UAcMV,EACbW,GAAa,EACbJ,EAAQV,EAAKhZ,UACb+Z,EAAUL,EAAMb,IAAaa,EAnBjB,eAmBuCP,GAAWO,EAAMP,GACpEa,EAAWD,GAAWP,UAAUL,GAChCc,EAAWd,EAAWU,EAAwBL,UAAU,WAArBQ,OAAkCvW,EACrEyW,EAAqB,SAARjB,GAAkBS,EAAME,SAAqBG,EAwB9D,GArBIG,IACFX,EAAoBjY,EAAe4Y,EAAW7b,KAAK,IAAI2a,OAC7Bpa,OAAOoB,WAAauZ,EAAkBL,OAE9DN,EAAeW,EAAmB7I,GAAK,GAElCG,GAAiD,mBAA/B0I,EAAkBV,IAAyB9U,EAAKwV,EAAmBV,EAAUE,aAIpGc,GAAcE,GAjCP,WAiCkBA,EAAQtb,OACnCqb,GAAa,EACbE,EAAW,SAASL,SAAW,OAAOI,EAAQ1b,KAAK+E,QAG/CyN,IAAWwI,IAAYP,IAASgB,GAAeJ,EAAMb,IACzD9U,EAAK2V,EAAOb,EAAUmB,GAGxBtB,EAAUO,GAAQe,EAClBtB,EAAUhI,GAAOqI,WACbI,EAMF,GALAG,EAAU,CACRK,OAAQE,EAAaG,EAAWR,UA9CzB,UA+CPhO,KAAM4N,EAASY,EAAWR,UAhDrB,QAiDLI,QAASK,GAEPZ,EAAQ,IAAK5Z,KAAO6Z,EAChB7Z,KAAOia,GAAQjB,EAASiB,EAAOja,EAAK6Z,EAAQ7Z,SAC7CwE,EAAQA,EAAQY,EAAIZ,EAAQM,GAAKuU,GAASgB,GAAab,EAAMK,GAEtE,OAAOA,I,gBCnET3b,EAAOD,QAAU,EAAQ,K,gBCAzB,EAAQ,KAYR,IAXA,IAAImG,EAAS,EAAQ,IACjBE,EAAO,EAAQ,IACf2U,EAAY,EAAQ,IACpByB,EAAgB,EAAQ,EAAR,CAAkB,eAElCC,EAAe,wbAIU1Q,MAAM,KAE1BxL,EAAI,EAAGA,EAAIkc,EAAavZ,OAAQ3C,IAAK,CAC5C,IAAI+a,EAAOmB,EAAalc,GACpBmc,EAAaxW,EAAOoV,GACpBS,EAAQW,GAAcA,EAAWra,UACjC0Z,IAAUA,EAAMS,IAAgBpW,EAAK2V,EAAOS,EAAelB,GAC/DP,EAAUO,GAAQP,EAAUpQ,Q,gBChB9B,IAAIgD,EAAQ,EAAQ,IAChBgP,EAAa,EAAQ,IAAoB7R,OAAO,SAAU,aAE9D/K,EAAQsI,EAAIpH,OAAO2b,qBAAuB,SAASA,oBAAoBtU,GACrE,OAAOqF,EAAMrF,EAAGqU,K,gBCLlB,IAAIE,EAAM,EAAQ,IACdxT,EAAa,EAAQ,IACrB6Q,EAAY,EAAQ,IACpB/R,EAAc,EAAQ,IACtB9B,EAAM,EAAQ,IACd6B,EAAiB,EAAQ,IACzB4U,EAAO7b,OAAOsW,yBAElBxX,EAAQsI,EAAI,EAAQ,IAAoByU,EAAO,SAASvF,yBAAyBjP,EAAGpB,GAGlF,GAFAoB,EAAI4R,EAAU5R,GACdpB,EAAIiB,EAAYjB,GAAG,GACfgB,EAAgB,IAClB,OAAO4U,EAAKxU,EAAGpB,GACf,MAAOsB,IACT,GAAInC,EAAIiC,EAAGpB,GAAI,OAAOmC,GAAYwT,EAAIxU,EAAE3H,KAAK4H,EAAGpB,GAAIoB,EAAEpB,M,gBCZxDnH,EAAQ4B,YAAa,EAErB,IAEIob,EAAmBta,uBAFD,EAAQ,MAM1Bua,EAAWva,uBAFD,EAAQ,MAMlBiY,EAAWjY,uBAFA,EAAQ,KAIvB,SAASA,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAEvF3C,EAAQgZ,QAAU,SAAU9U,EAAUC,GACpC,GAA0B,mBAAfA,GAA4C,OAAfA,EACtC,MAAM,IAAIpB,UAAU,iEAAoF,IAAfoB,EAA6B,aAAc,EAAIwW,EAAS3B,SAAS7U,KAG5JD,EAAS5B,WAAY,EAAI2a,EAASjE,SAAS7U,GAAcA,EAAW7B,UAAW,CAC7E8B,YAAa,CACX3C,MAAOyC,EACP9C,YAAY,EACZkC,UAAU,EACVD,cAAc,KAGdc,IAAY6Y,EAAiBhE,SAAU,EAAIgE,EAAiBhE,SAAS9U,EAAUC,GAAcD,EAASL,UAAYM,K,gBC/BxH,IAAI+Y,EAAU,EAAQ,KAClB/B,EAAW,EAAQ,EAAR,CAAkB,YAC7BH,EAAY,EAAQ,IACxB/a,EAAOD,QAAU,EAAQ,GAAWmd,kBAAoB,SAAUvU,GAChE,GAAU7C,MAAN6C,EAAiB,OAAOA,EAAGuS,IAC1BvS,EAAG,eACHoS,EAAUkC,EAAQtU,M,gBCNzB,IAAIwU,EAAmB,EAAQ,IAW/Bnd,EAAOD,QATP,SAASqd,4BAA4Bpc,EAAGqc,GACtC,GAAKrc,EAAL,CACA,GAAiB,iBAANA,EAAgB,OAAOmc,EAAiBnc,EAAGqc,GACtD,IAAIrb,EAAIf,OAAOoB,UAAUmJ,SAAS9K,KAAKM,GAAGqL,MAAM,GAAI,GAEpD,MADU,WAANrK,GAAkBhB,EAAEmD,cAAanC,EAAIhB,EAAEmD,YAAYrD,MAC7C,QAANkB,GAAqB,QAANA,EAAoB2I,MAAMC,KAAK5J,GACxC,cAANgB,GAAqB,2CAA2CmW,KAAKnW,GAAWmb,EAAiBnc,EAAGqc,QAAxG,K,cCEFrd,EAAOD,QAVP,SAASud,kBAAkBxT,EAAKqB,IACnB,MAAPA,GAAeA,EAAMrB,EAAI5G,UAAQiI,EAAMrB,EAAI5G,QAE/C,IAAK,IAAI3C,EAAI,EAAGgd,EAAO,IAAI5S,MAAMQ,GAAM5K,EAAI4K,EAAK5K,IAC9Cgd,EAAKhd,GAAKuJ,EAAIvJ,GAGhB,OAAOgd,I,cCCTvd,EAAOD,QARP,SAASyd,uBAAuBjZ,GAC9B,QAAa,IAATA,EACF,MAAM,IAAIoW,eAAe,6DAG3B,OAAOpW,I,gBCHT,IAAI9B,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,QAMP,SAAS0d,kBAAkB9N,EAAM+N,EAAQC,GACvC,GAAID,aAAkB/S,MACpB,MAAwB,kBAAb+S,EAAO,IAAmBC,EAC5B,CAACC,sBAAsBjO,EAAM+N,EAAO,GAAIC,GAAWD,EAAO,IAG5DA,EAGT,IAAIG,EACA/O,EAAW,GAEf,QAAQ,EAAI2E,EAAQ,SAAaiK,IAC/B,IAAK,SAKL,IAAK,WAEHG,EAAYH,EACZ,MAEF,IAAK,SACCA,aAAkBI,EAAY,QAEhCD,EAAYH,GAGZG,GAAYF,GAAWC,sBAAsBjO,GAAM,EAAMgO,GACzD7O,EAAW4O,GAGb,MAEF,IAAK,UACHG,EAAYF,EAAWC,sBAAsBjO,EAAM+N,EAAQC,GAAYD,EACvE,MAEF,QACE,MAAM,IAAI/R,MAAM,gCAAgCb,OAAO6E,EAAM,KAAM+N,GAGvE,MAAO,CAACG,EAAW/O,IA/CrB,IAAI2E,EAAWhR,EAAuBmG,EAAQ,KAE1CkV,EAAerb,EAAuBmG,EAAQ,KAgDlD,SAASgV,sBAAsBjO,EAAMoO,EAAMC,GACzC,IAEIld,EAFAmd,EAAWD,EAAKC,SAChBC,EAAWF,EAAKE,SAGpB,GAAIH,GAEF,KADAjd,EAAOmd,EAAStO,IACL,MAAM,IAAIhE,MAAM,QAASb,OAAO6E,EAAM,kCAGjD,KADA7O,EAAOod,EAASvO,IACL,MAAM,IAAIhE,MAAM,QAASb,OAAO6E,EAAM,iCAGnD,OAAO7O,I,gBCtET,IAAI2B,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,QAAcA,EAAQoe,uBAAoB,EAEjD,IAAI1K,EAAWhR,EAAuBmG,EAAQ,KAE1CsF,EAAgBzL,EAAuBmG,EAAQ,IAE/CqF,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAItD,SAASoL,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAI3b,IAAIsL,EAAiC,SAAUxJ,IAC7C,EAAIhB,EAAU,SAAawK,kBAAmBxJ,GAE9C,IAAIC,EAASZ,aAAamK,mBAE1B,SAASA,oBAEP,OADA,EAAIlQ,EAAgB,SAAaxI,KAAM0Y,mBAChCvJ,EAAOhP,MAAMH,KAAME,WAG5B,OAAOwY,kBAV4B,EAWrB,EAjBQ1b,EAAuBmG,EAAQ,KAiBlB,SAAa+C,QAElD5L,EAAQoe,kBAAoBA,EAE5B,IAAIC,EAA4B,WAC9B,SAASA,aAAaC,EAAcC,GAGlC,IAFA,EAAIrQ,EAAgB,SAAaxI,KAAM2Y,cAEO,YAA1C,EAAI3K,EAAQ,SAAa6K,GAC3B,MAAM,IAAI3S,MAAM,yDAGlB,GAAI1K,OAAO4M,KAAKyQ,GAAarS,QAAO,SAAUvB,GAC5C,OAAO4T,EAAYhc,eAAeoI,MAAQ4T,EAAY5T,aAAcC,UACnEzH,OAAS,EACV,MAAM,IAAIyI,MAAM,wDAGlB,GAAI1K,OAAO4M,KAAKyQ,GAAarS,QAAO,SAAUvB,GAC5C,OAAO4T,EAAYhc,eAAeoI,IAAM4T,EAAY5T,GAAGuB,QAAO,SAAUzJ,GACtE,OAAQ8b,EAAY9b,MACnBU,OAAS,KACXA,OAAS,EACV,MAAM,IAAIyI,MAAM,8EAGlB,KAAM2S,EAAYD,aAAyB1T,OACzC,MAAM,IAAIgB,MAAM,iBAAmB0S,EAAe,uCAGpD5Y,KAAK8Y,OAASF,EACd5Y,KAAK+Y,YAAcF,EACnB7Y,KAAKgZ,sBAAwB,GAsD/B,OAnDA,EAAIvQ,EAAa,SAAakQ,aAAc,CAAC,CAC3Ctc,IAAK,iBACLN,MAAO,SAASkd,eAAetJ,GAC7B3P,KAAKgZ,sBAAsBjS,KAAK4I,KAEjC,CACDtT,IAAK,QACLN,MAAO,SAASgO,QACd,OAAO/J,KAAK8Y,SAEb,CACDzc,IAAK,UACLN,MAAO,SAASmd,QAAQnP,GAKtB,OAJMA,aAAiB7E,QACrB6E,EAAQ,CAACA,IAGJA,EAAMoP,QAAQnZ,KAAK8Y,SAAW,IAEtC,CACDzc,IAAK,cACLN,MAAO,SAASqd,YAAYrP,GAC1B,IAAIsP,EAAYnZ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAEpF,IAAKF,KAAKkZ,QAAQnP,GAChB,MAAM,IAAI2O,EAAkB,+BAAiC1Y,KAAK8Y,QAAUO,EAAU5b,OAAS,EAAI,KAAO4b,EAAY,OAGzH,CACDhd,IAAK,eACLN,MAAO,SAASud,aAAaC,GAC3B,QAAmClZ,IAA/BL,KAAK+Y,YAAYQ,GACnB,MAAM,IAAIb,EAAkB,6BAA+Ba,GAG7D,GAAIA,IAAavZ,KAAK8Y,OAAQ,CAC5B,GAAI9Y,KAAK+Y,YAAY/Y,KAAK8Y,QAAQK,QAAQI,GAAY,EACpD,MAAM,IAAIb,EAAkB,6BAA+B1Y,KAAK8Y,OAAS,OAASS,GAGpF,IAAIC,EAAWxZ,KAAK8Y,OACpB9Y,KAAK8Y,OAASS,EAEdvZ,KAAKgZ,sBAAsBvS,SAAQ,SAAUgT,GAC3C,OAAOA,EAAGD,EAAUD,MAIxB,OAAOvZ,SAGJ2Y,aAlFuB,GAqFhCre,EAAO,QAAcqe,G,cC9HrB,IAOIe,EACAC,EARAC,EAAUrf,EAAOD,QAAU,GAU/B,SAASuf,mBACL,MAAM,IAAI3T,MAAM,mCAEpB,SAAS4T,sBACL,MAAM,IAAI5T,MAAM,qCAsBpB,SAAS6T,WAAWC,GAChB,GAAIN,IAAqBO,WAErB,OAAOA,WAAWD,EAAK,GAG3B,IAAKN,IAAqBG,mBAAqBH,IAAqBO,WAEhE,OADAP,EAAmBO,WACZA,WAAWD,EAAK,GAE3B,IAEI,OAAON,EAAiBM,EAAK,GAC/B,MAAMjX,GACJ,IAEI,OAAO2W,EAAiBze,KAAK,KAAM+e,EAAK,GAC1C,MAAMjX,GAEJ,OAAO2W,EAAiBze,KAAK+E,KAAMga,EAAK,MAvCnD,WACG,IAEQN,EADsB,mBAAfO,WACYA,WAEAJ,iBAEzB,MAAO9W,GACL2W,EAAmBG,iBAEvB,IAEQF,EADwB,mBAAjBO,aACcA,aAEAJ,oBAE3B,MAAO/W,GACL4W,EAAqBG,qBAjB7B,GAwEA,IAEIK,EAFAC,EAAQ,GACRC,GAAW,EAEXC,GAAc,EAElB,SAASC,kBACAF,GAAaF,IAGlBE,GAAW,EACPF,EAAa1c,OACb2c,EAAQD,EAAa9U,OAAO+U,GAE5BE,GAAc,EAEdF,EAAM3c,QACN+c,cAIR,SAASA,aACL,IAAIH,EAAJ,CAGA,IAAII,EAAUV,WAAWQ,iBACzBF,GAAW,EAGX,IADA,IAAI3U,EAAM0U,EAAM3c,OACViI,GAAK,CAGP,IAFAyU,EAAeC,EACfA,EAAQ,KACCE,EAAa5U,GACdyU,GACAA,EAAaG,GAAYI,MAGjCJ,GAAc,EACd5U,EAAM0U,EAAM3c,OAEhB0c,EAAe,KACfE,GAAW,EAnEf,SAASM,gBAAgBC,GACrB,GAAIjB,IAAuBO,aAEvB,OAAOA,aAAaU,GAGxB,IAAKjB,IAAuBG,sBAAwBH,IAAuBO,aAEvE,OADAP,EAAqBO,aACdA,aAAaU,GAExB,IAEI,OAAOjB,EAAmBiB,GAC5B,MAAO7X,GACL,IAEI,OAAO4W,EAAmB1e,KAAK,KAAM2f,GACvC,MAAO7X,GAGL,OAAO4W,EAAmB1e,KAAK+E,KAAM4a,KAgD7CD,CAAgBF,IAiBpB,SAASI,KAAKb,EAAKnP,GACf7K,KAAKga,IAAMA,EACXha,KAAK6K,MAAQA,EAYjB,SAASiQ,QA5BTlB,EAAQmB,SAAW,SAAUf,GACzB,IAAI/Z,EAAO,IAAIiF,MAAMhF,UAAUzC,OAAS,GACxC,GAAIyC,UAAUzC,OAAS,EACnB,IAAK,IAAI3C,EAAI,EAAGA,EAAIoF,UAAUzC,OAAQ3C,IAClCmF,EAAKnF,EAAI,GAAKoF,UAAUpF,GAGhCsf,EAAMrT,KAAK,IAAI8T,KAAKb,EAAK/Z,IACJ,IAAjBma,EAAM3c,QAAiB4c,GACvBN,WAAWS,aASnBK,KAAKje,UAAU8d,IAAM,WACjB1a,KAAKga,IAAI7Z,MAAM,KAAMH,KAAK6K,QAE9B+O,EAAQoB,MAAQ,UAChBpB,EAAQqB,SAAU,EAClBrB,EAAQsB,IAAM,GACdtB,EAAQuB,KAAO,GACfvB,EAAQvb,QAAU,GAClBub,EAAQwB,SAAW,GAInBxB,EAAQyB,GAAKP,KACblB,EAAQ0B,YAAcR,KACtBlB,EAAQ2B,KAAOT,KACflB,EAAQ4B,IAAMV,KACdlB,EAAQ6B,eAAiBX,KACzBlB,EAAQ8B,mBAAqBZ,KAC7BlB,EAAQ+B,KAAOb,KACflB,EAAQgC,gBAAkBd,KAC1BlB,EAAQiC,oBAAsBf,KAE9BlB,EAAQkC,UAAY,SAAUzgB,GAAQ,MAAO,IAE7Cue,EAAQmC,QAAU,SAAU1gB,GACxB,MAAM,IAAI6K,MAAM,qCAGpB0T,EAAQoC,IAAM,WAAc,MAAO,KACnCpC,EAAQqC,MAAQ,SAAUC,GACtB,MAAM,IAAIhW,MAAM,mCAEpB0T,EAAQuC,MAAQ,WAAa,OAAO,I,gBCvLpC,IAAIC,EAAW,EAAQ,KAwBvB7hB,EAAOD,QAJP,SAAS+hB,KAAKxR,GACZ,OAAQA,GAASA,EAAMpN,OAAU2e,EAASvR,GAAS,K,gBCrBrD,IAAIH,EAAa,EAAQ,IACrBzH,EAAW,EAAQ,IAmCvB1I,EAAOD,QAVP,SAASgiB,WAAWvgB,GAClB,IAAKkH,EAASlH,GACZ,OAAO,EAIT,IAAIwR,EAAM7C,EAAW3O,GACrB,MA5BY,qBA4BLwR,GA3BI,8BA2BcA,GA7BZ,0BA6B6BA,GA1B7B,kBA0BgDA,I,iBCjC/D,YACA,IAAIvF,EAA8B,iBAAVvH,GAAsBA,GAAUA,EAAOjF,SAAWA,QAAUiF,EAEpFlG,EAAOD,QAAU0N,I,gCCcjBzN,EAAOD,QAVP,SAASiiB,WAAWjL,GAClB,IAAIpF,GAAS,EACTkB,EAASlI,MAAMoM,EAAI1L,MAKvB,OAHA0L,EAAI7K,SAAQ,SAAS1K,GACnBqR,IAASlB,GAASnQ,KAEbqR,I,gBCZT,IAAIuE,EAA0BxO,EAAQ,IAElCnG,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAQkiB,cAAgBA,cACxBhhB,OAAOC,eAAenB,EAAS,sBAAuB,CACpDoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO+H,EAAgBqK,uBAG3BzT,EAAQmiB,qBAAuBniB,EAAQoiB,8BAAgCpiB,EAAQqiB,sBAAwBriB,EAAO,aAAc,EAE5H,IAAIsiB,EAAe5f,EAAuBmG,EAAQ,IAE9C0Z,EAAqB7f,EAAuBmG,EAAQ,IAEpDsF,EAAgBzL,EAAuBmG,EAAQ,IAE/CqF,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAElDkL,EAAoBrR,EAAuBmG,EAAQ,KAEnD2Z,EAAU9f,EAAuBmG,EAAQ,MAEzC4Z,EAAQ/f,EAAuBmG,EAAQ,KAEvCO,EAAkBiO,EAAwBxO,EAAQ,KAElD6Z,EAAYhgB,EAAuBmG,EAAQ,MAE/C,SAAS8Z,2BAA2B1hB,GAAK,GAAsB,oBAAXM,QAAgD,MAAtBN,EAAEM,OAAOmH,UAAmB,CAAE,GAAIkC,MAAMgY,QAAQ3hB,KAAOA,EAErI,SAASoc,4BAA4Bpc,EAAGqc,GAAU,IAAKrc,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOsc,kBAAkBtc,EAAGqc,GAAS,IAAIrb,EAAIf,OAAOoB,UAAUmJ,SAAS9K,KAAKM,GAAGqL,MAAM,GAAI,GAAc,WAANrK,GAAkBhB,EAAEmD,cAAanC,EAAIhB,EAAEmD,YAAYrD,MAAM,GAAU,QAANkB,GAAqB,QAANA,EAAa,OAAO2I,MAAMC,KAAK5J,GAAI,GAAU,cAANgB,GAAqB,2CAA2CmW,KAAKnW,GAAI,OAAOsb,kBAAkBtc,EAAGqc,GAF7QD,CAA4Bpc,IAAK,CAAE,IAAIT,EAAI,EAAOqG,EAAI,SAASA,MAAQ,MAAO,CAAEpE,EAAGoE,EAAG5E,EAAG,SAASA,IAAM,OAAIzB,GAAKS,EAAEkC,OAAe,CAAEkC,MAAM,GAAe,CAAEA,MAAM,EAAO5D,MAAOR,EAAET,OAAWiI,EAAG,SAASA,EAAEoa,GAAM,MAAMA,GAAOva,EAAGzB,GAAO,MAAM,IAAI9D,UAAU,yIAA4I,IAAI6F,EAA6C9C,EAAzCgd,GAAmB,EAAMC,GAAS,EAAY,MAAO,CAAEtgB,EAAG,SAASA,IAAMmG,EAAK3H,EAAEM,OAAOmH,aAAgBzG,EAAG,SAASA,IAAM,IAAI+gB,EAAOpa,EAAG4S,OAAsC,OAA9BsH,EAAmBE,EAAK3d,KAAa2d,GAASva,EAAG,SAASA,EAAEwa,GAAOF,GAAS,EAAMjd,EAAMmd,GAAQ3a,EAAG,SAASA,IAAM,IAAWwa,GAAoC,MAAhBla,EAAE,QAAoBA,EAAE,SAAvD,QAAiF,GAAIma,EAAQ,MAAMjd,KAI53B,SAASyX,kBAAkBxT,EAAKqB,IAAkB,MAAPA,GAAeA,EAAMrB,EAAI5G,UAAQiI,EAAMrB,EAAI5G,QAAQ,IAAK,IAAI3C,EAAI,EAAGgd,EAAO,IAAI5S,MAAMQ,GAAM5K,EAAI4K,EAAK5K,IAAOgd,EAAKhd,GAAKuJ,EAAIvJ,GAAM,OAAOgd,EAEhL,SAASvJ,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAI3b,IAAIsP,EAA6C,SAAUxN,IACzD,EAAIhB,EAAU,SAAawO,8BAA+BxN,GAE1D,IAAIC,EAASZ,aAAamO,+BAE1B,SAASA,8BAA8BrhB,GAGrC,OAFA,EAAImN,EAAgB,SAAaxI,KAAM0c,+BAEhCvN,EAAOlU,KAAK+E,KAAM,sBAAyB3E,EAAO,gDAG3D,OAAOqhB,8BAXwC,EAYjC,EAAIrO,EAAiB,SAAanI,QAElD5L,EAAQoiB,8BAAgCA,EAExC,IAAID,EAAoC,SAAUpN,IAChD,EAAInB,EAAU,SAAauO,qBAAsBpN,GAEjD,IAAIC,EAAUf,aAAakO,sBAE3B,SAASA,qBAAqBphB,GAG5B,OAFA,EAAImN,EAAgB,SAAaxI,KAAMyc,sBAEhCnN,EAAQrU,KAAK+E,KAAM,sBAAyB3E,EAAO,wCAG5D,OAAOohB,qBAX+B,EAYxB,EAAIpO,EAAiB,SAAanI,QAElD5L,EAAQmiB,qBAAuBA,EAE/B,IAAIE,EAAqC,SAAUnN,IACjD,EAAItB,EAAU,SAAayO,sBAAuBnN,GAElD,IAAIC,EAAUlB,aAAaoO,uBAE3B,SAASA,sBAAsBthB,GAG7B,OAFA,EAAImN,EAAgB,SAAaxI,KAAM2c,uBAEhClN,EAAQxU,KAAK+E,KAAM,sBAAyB3E,EAAO,yOAG5D,OAAOshB,sBAXgC,EAYzB,EAAItO,EAAiB,SAAanI,QAKlD,SAASsW,cAAcgB,GACrB,IAIIC,EAJAC,EAAQ,GACRC,EAAsB,GAEtBC,EAAYX,2BAA2BO,GAG3C,IACE,IAAIK,EAAQ,SAASA,QACnB,IAAItO,EAAUkO,EAAM1hB,MAChBV,EAAOkU,EAAQ7F,UAAUrO,OACzByiB,EAAWvO,EAAQ7F,UAAUR,eAET,IAApB4U,EAASrgB,OACXkgB,EAAoB5W,KAAK1L,GAEzByiB,EAASrX,SAAQ,SAAUsX,GACzB,OAAOL,EAAM3W,KAAK,CAACgX,EAAI1iB,QAK7B,IAAKuiB,EAAU7gB,MAAO0gB,EAAQG,EAAUrhB,KAAKoD,MAC3Cke,IAEF,MAAOzd,GACPwd,EAAU7a,EAAE3C,GAnBd,QAqBEwd,EAAUhb,IAGZ,OAAO,EAAIma,EAAK,UAAa,EAAIC,EAAS,SAAaU,GAAOrY,OAAOsY,IAjCvErjB,EAAQqiB,sBAAwBA,EAoChC,IAAIqB,EAAyB,WAC3B,SAASA,aACP,EAAIxV,EAAgB,SAAaxI,KAAMge,WACvChe,KAAKie,UAAY,GACjBje,KAAKke,iBAAkB,EA6GhB,IACDC,EAwER,OAnLA,EAAI1V,EAAa,SAAauV,UAAW,CAAC,CACxC3hB,IAAK,WACLN,MAAO,SAASqiB,SAAS7O,GACvB,IAAIlU,EAAO6E,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAE/E,IAAKwD,EAAe,QAAY0M,eAAeb,GAC7C,MAAM,IAAI7L,EAAgBqK,oBAAoB,oFAGhD1S,EAAOA,GAAQkU,EAAQ7F,UAAUrO,OACjC,IAAI0B,EAAIiD,KAAKuP,QAAQlU,GAAM,GAE3B,QAAUgF,IAANtD,GAAmBA,IAAMwS,EAC3B,MAAM,IAAImN,EAA8BrhB,GAI1C,OADA2E,KAAKie,UAAU5iB,GAAQkU,EAChBvP,OAER,CACD3D,IAAK,UACLN,MAAO,SAASwT,QAAQlU,GACtB,IAAIgjB,IAAiBne,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,KAAmBA,UAAU,GAChFoe,EAAoB,CAAC,YAEzB,IAAKjjB,EACH,MAAM,IAAI6K,MAAM,2BAGlB,IAAKlG,KAAKie,UAAU5iB,IAASgjB,GAAkBC,EAAkBC,SAASljB,GACxE,MAAM,IAAIshB,EAAsBthB,GAGlC,IAAK2E,KAAKie,UAAU5iB,IAASgjB,EAC3B,MAAM,IAAI5B,EAAqBphB,GAGjC,OAAO2E,KAAKie,UAAU5iB,KAEvB,CACDgB,IAAK,4BACLN,MAAO,SAASyiB,4BACd,OAAOhjB,OAAO4M,KAAKpI,KAAKie,aAEzB,CACD5hB,IAAK,qBACLN,MAAO,SAAS0iB,qBACd,IAGIC,EADAvJ,EAAa8H,4BAFF,EAAIH,EAAO,SAAa9c,KAAKie,YAK5C,IACE,IAAK9I,EAAWpY,MAAO2hB,EAASvJ,EAAW5Y,KAAKoD,MAAO,CACrD,IAIIgf,EAHAjV,EADUgV,EAAO3iB,MACC2N,UAElBkV,EAAa3B,2BAA2BvT,EAAQR,gBAGpD,IACE,IAAK0V,EAAW7hB,MAAO4hB,EAASC,EAAWriB,KAAKoD,MAAO,CACrD,IAAItE,EAAOsjB,EAAO5iB,MAElB,IADUiE,KAAKie,UAAU5iB,GACf,MAAM,IAAIohB,EAAqBphB,GACzCqO,EAAQ2G,OAAOhV,EAAM2E,KAAKie,UAAU5iB,KAEtC,MAAO+E,GACPwe,EAAW7b,EAAE3C,GARf,QAUEwe,EAAWhc,MAGf,MAAOxC,GACP+U,EAAWpS,EAAE3C,GAtBf,QAwBE+U,EAAWvS,OAGd,CACDvG,IAAK,aACLN,MAAO,SAAS6M,aACd,OAAO5I,KAAK6e,kBAAiB,SAAU9hB,GACrC,OAAOA,EAAE2M,UAAUd,kBAGtB,CACDvM,IAAK,UACLN,MAAO,SAAS8M,UACd,OAAO7I,KAAK6e,kBAAiB,SAAU9hB,GACrC,OAAOA,EAAE2M,UAAUb,eAGtB,CACDxM,IAAK,eACLN,MAAO,SAASgN,eACd,IAAII,EAAQnJ,KAEZ,OAAOA,KAAK6e,kBAAiB,SAAU9hB,GACrC,OAAOA,EAAE2M,UAAUX,kBAClBlJ,MAAK,WACNsJ,EAAM+U,iBAAkB,OAG3B,CACD7hB,IAAK,mBACLN,OACMoiB,GAAoB,EAAItB,EAAkB,SAA2BD,EAAY,QAAYkC,MAAK,SAASC,QAAQpP,GACrH,IAAIqP,EAAYC,EAAQ5jB,EAExB,OAAOuhB,EAAY,QAAYsC,MAAK,SAASC,SAASC,GACpD,OACE,OAAQA,EAASC,KAAOD,EAAStJ,MAC/B,KAAK,EACE9V,KAAKsf,uBACRtf,KAAKsf,qBAAuB9C,eAAc,EAAIM,EAAO,SAAa9c,KAAKie,aAGzEe,EAAa/B,2BAA2Bjd,KAAKsf,sBAC7CF,EAASC,KAAO,EAEhBL,EAAWjiB,IAEb,KAAK,EACH,IAAKkiB,EAASD,EAAWziB,KAAKoD,KAAM,CAClCyf,EAAStJ,KAAO,GAChB,MAMF,GAHAza,EAAO4jB,EAAOljB,MACJiE,KAAKie,UAAU5iB,GAEZ,CACX+jB,EAAStJ,KAAO,EAChB,MAGF,MAAM,IAAI5P,MAAM,kBAAkBb,OAAOhK,IAE3C,KAAK,EAEH,OADA+jB,EAAStJ,KAAO,GACTnG,EAAS3P,KAAKie,UAAU5iB,IAEjC,KAAK,GACH+jB,EAAStJ,KAAO,EAChB,MAEF,KAAK,GACHsJ,EAAStJ,KAAO,GAChB,MAEF,KAAK,GACHsJ,EAASC,KAAO,GAChBD,EAASG,GAAKH,EAAQ,MAAU,GAEhCJ,EAAWjc,EAAEqc,EAASG,IAExB,KAAK,GAKH,OAJAH,EAASC,KAAO,GAEhBL,EAAWpc,IAEJwc,EAASI,OAAO,IAEzB,KAAK,GACL,IAAK,MACH,OAAOJ,EAASK,UAGrBV,QAAS/e,KAAM,CAAC,CAAC,EAAG,GAAI,GAAI,UAGjC,SAAS6e,iBAAiBa,GACxB,OAAOvB,EAAkBhe,MAAMH,KAAME,gBAMpC8d,UA1LoB,GA6L7B1jB,EAAO,QAAc0jB,G,cChTrBzjB,EAAOD,QAXP,SAASqlB,SAAS9U,EAAO+U,GAKvB,IAJA,IAAI1T,GAAS,EACTzO,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACnC2P,EAASlI,MAAMzH,KAEVyO,EAAQzO,GACf2P,EAAOlB,GAAS0T,EAAS/U,EAAMqB,GAAQA,EAAOrB,GAEhD,OAAOuC,I,cCET7S,EAAOD,QAVP,SAASulB,UAAUtjB,EAAGqjB,GAIpB,IAHA,IAAI1T,GAAS,EACTkB,EAASlI,MAAM3I,KAEV2P,EAAQ3P,GACf6Q,EAAOlB,GAAS0T,EAAS1T,GAE3B,OAAOkB,I,cCOT,IAAI8P,EAAUhY,MAAMgY,QAEpB3iB,EAAOD,QAAU4iB,G,cCzBjB3iB,EAAOD,QAAU,SAASC,GAoBzB,OAnBKA,EAAOulB,kBACXvlB,EAAOwlB,UAAY,aACnBxlB,EAAOylB,MAAQ,GAEVzlB,EAAO0lB,WAAU1lB,EAAO0lB,SAAW,IACxCzkB,OAAOC,eAAelB,EAAQ,SAAU,CACvCmB,YAAY,EACZC,IAAK,WACJ,OAAOpB,EAAOQ,KAGhBS,OAAOC,eAAelB,EAAQ,KAAM,CACnCmB,YAAY,EACZC,IAAK,WACJ,OAAOpB,EAAOO,KAGhBP,EAAOulB,gBAAkB,GAEnBvlB,I,cCcRA,EAAOD,QALP,SAAS4lB,SAASnkB,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GA9Bb,mB,gBCDvB,OAAC,SAAWokB,GAmDV,IAAIra,EACFsa,EAAY,6CAEZC,EAAW/d,KAAK6D,KAChBma,EAAYhe,KAAKiJ,MAEjBgV,EAAiB,qBACjBC,EAAgBD,EAAiB,yDAEjCE,EAAO,KAIPC,EAAW,CAAC,EAAG,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,MAM7EC,EAAM,IAoiFR,SAASC,SAASrkB,GAChB,IAAIzB,EAAQ,EAAJyB,EACR,OAAOA,EAAI,GAAKA,IAAMzB,EAAIA,EAAIA,EAAI,EAKpC,SAAS+lB,cAAc7e,GAMrB,IALA,IAAIjF,EAAG+jB,EACLhmB,EAAI,EACJ6L,EAAI3E,EAAEvE,OACN7B,EAAIoG,EAAE,GAAK,GAENlH,EAAI6L,GAAI,CAGb,IADAma,EA5jFS,IA2jFT/jB,EAAIiF,EAAElH,KAAO,IACI2C,OACVqjB,IAAK/jB,EAAI,IAAMA,GACtBnB,GAAKmB,EAIP,IAAK4J,EAAI/K,EAAE6B,OAA8B,KAAtB7B,EAAEmlB,aAAapa,KAClC,OAAO/K,EAAEgL,MAAM,EAAGD,EAAI,GAAK,GAK7B,SAASqa,QAAQC,EAAGC,GAClB,IAAIlf,EAAGC,EACLkf,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EACPL,EAAImmB,EAAElkB,EACN4J,EAAIua,EAAEnkB,EACNkI,EAAIgc,EAAEle,EACNhI,EAAImmB,EAAEne,EAGR,IAAKjI,IAAM6L,EAAG,OAAO,KAMrB,GAJA3E,EAAImf,IAAOA,EAAG,GACdlf,EAAImf,IAAOA,EAAG,GAGVpf,GAAKC,EAAG,OAAOD,EAAIC,EAAI,GAAK0E,EAAI7L,EAGpC,GAAIA,GAAK6L,EAAG,OAAO7L,EAMnB,GAJAkH,EAAIlH,EAAI,EACRmH,EAAIgD,GAAKlK,GAGJomB,IAAOC,EAAI,OAAOnf,EAAI,GAAKkf,EAAKnf,EAAI,GAAK,EAG9C,IAAKC,EAAG,OAAOgD,EAAIlK,EAAIiH,EAAI,GAAK,EAKhC,IAHA2E,GAAK1B,EAAIkc,EAAG1jB,SAAW1C,EAAIqmB,EAAG3jB,QAAUwH,EAAIlK,EAGvCD,EAAI,EAAGA,EAAI6L,EAAG7L,IAAK,GAAIqmB,EAAGrmB,IAAMsmB,EAAGtmB,GAAI,OAAOqmB,EAAGrmB,GAAKsmB,EAAGtmB,GAAKkH,EAAI,GAAK,EAG5E,OAAOiD,GAAKlK,EAAI,EAAIkK,EAAIlK,EAAIiH,EAAI,GAAK,EAOvC,SAASqf,SAAS9kB,EAAGuY,EAAKwM,EAAKjmB,GAC7B,GAAIkB,EAAIuY,GAAOvY,EAAI+kB,GAAO/kB,KAAOA,EAAI,EAAI8jB,EAAS9jB,GAAK+jB,EAAU/jB,IAC/D,MAAM2J,MACJqa,GAAkBllB,GAAQ,aAA2B,iBAALkB,EAC7CA,EAAIuY,GAAOvY,EAAI+kB,EAAM,kBAAoB,oBACzC,6BAA+B/kB,GAKxC,SAAS2gB,QAAQjgB,GACf,MAA8C,kBAAvCzB,OAAOoB,UAAUmJ,SAAS9K,KAAKgC,GAKxC,SAASskB,MAAMhlB,GACb,IAAI0I,EAAI1I,EAAEpB,EAAEsC,OAAS,EACrB,OAAOmjB,SAASrkB,EAAEwG,EAroFP,KAqoFwBkC,GAAK1I,EAAEpB,EAAE8J,GAAK,GAAK,EAIxD,SAASuc,cAAcC,EAAK1e,GAC1B,OAAQ0e,EAAIhkB,OAAS,EAAIgkB,EAAIxb,OAAO,GAAK,IAAMwb,EAAI7a,MAAM,GAAK6a,IAC5D1e,EAAI,EAAI,IAAM,MAAQA,EAI1B,SAAS2e,aAAaD,EAAK1e,EAAG+d,GAC5B,IAAIpb,EAAKic,EAGT,GAAI5e,EAAI,EAAG,CAGT,IAAK4e,EAAKb,EAAI,MAAO/d,EAAG4e,GAAMb,GAC9BW,EAAME,EAAKF,OAOX,KAAM1e,GAHN2C,EAAM+b,EAAIhkB,QAGK,CACb,IAAKkkB,EAAKb,EAAG/d,GAAK2C,IAAO3C,EAAG4e,GAAMb,GAClCW,GAAOE,OACE5e,EAAI2C,IACb+b,EAAMA,EAAI7a,MAAM,EAAG7D,GAAK,IAAM0e,EAAI7a,MAAM7D,IAI5C,OAAO0e,GAOT3b,EA9pFA,SAAS8b,MAAMC,GACb,IAAIC,EAAKC,EAAaC,EA6hBhBC,EA6pBAC,EACFC,EACAC,EACAC,EACAC,EA7rCF7gB,EAAIqE,UAAUlJ,UAAY,CAAE8B,YAAaoH,UAAWC,SAAU,KAAMuF,QAAS,MAC7EiX,EAAM,IAAIzc,UAAU,GAUpB0c,EAAiB,GAajBC,EAAgB,EAMhBC,GAAc,EAIdC,EAAa,GAMbC,GAAW,IAKXC,EAAU,IAGVC,GAAS,EAkBTC,EAAc,EAIdC,EAAgB,EAGhBC,EAAS,CACPC,iBAAkB,IAClBC,eAAgB,IAChBC,UAAW,EACXC,mBAAoB,EACpBC,uBAAwB,IACxBC,kBAAmB,GAMrBC,EAAW,uCAgBb,SAAS1d,UAAUvJ,EAAG0F,GACpB,IAAIwhB,EAAUtoB,EAAGuoB,EAAa3gB,EAAGjI,EAAG6oB,EAAOje,EAAK+b,EAC9CR,EAAIjhB,KAGN,KAAMihB,aAAanb,WAKjB,OAAO,IAAIA,UAAUvJ,EAAG0F,GAG1B,GAAS,MAALA,EAAW,CAGb,GAAI1F,aAAauJ,UAIf,OAHAmb,EAAElkB,EAAIR,EAAEQ,EACRkkB,EAAEle,EAAIxG,EAAEwG,OACRke,EAAE9lB,GAAKoB,EAAIA,EAAEpB,GAAKoB,EAAEqK,QAAUrK,GAMhC,IAFAonB,EAAoB,iBAALpnB,IAEE,EAAJA,GAAS,EAAG,CAMvB,GAHA0kB,EAAElkB,EAAI,EAAIR,EAAI,GAAKA,GAAKA,GAAI,GAAK,EAG7BA,MAAQA,EAAG,CACb,IAAKwG,EAAI,EAAGjI,EAAIyB,EAAGzB,GAAK,GAAIA,GAAK,GAAIiI,KAGrC,OAFAke,EAAEle,EAAIA,OACNke,EAAE9lB,EAAI,CAACoB,IAITklB,EAAMllB,EAAI,OACL,CACL,IAAK6jB,EAAU1N,KAAK+O,EAAMllB,EAAI,IAAK,OAAOylB,EAAaf,EAAGQ,EAAKkC,GAC/D1C,EAAElkB,EAAyB,IAArB0kB,EAAIV,WAAW,IAAYU,EAAMA,EAAI7a,MAAM,IAAK,GAAK,GAIxD7D,EAAI0e,EAAItI,QAAQ,OAAS,IAAGsI,EAAMA,EAAImC,QAAQ,IAAK,MAGnD9oB,EAAI2mB,EAAIoC,OAAO,OAAS,GAGvB9gB,EAAI,IAAGA,EAAIjI,GACfiI,IAAM0e,EAAI7a,MAAM9L,EAAI,GACpB2mB,EAAMA,EAAIqC,UAAU,EAAGhpB,IACdiI,EAAI,IAGbA,EAAI0e,EAAIhkB,YAGL,CAQL,GALA4jB,SAASpf,EAAG,EAAGuhB,EAAS/lB,OAAQ,QAChCgkB,EAAMllB,EAAI,GAID,IAAL0F,EAEF,OAAO8hB,MADP9C,EAAI,IAAInb,UAAUvJ,aAAauJ,UAAYvJ,EAAIklB,GAC/Be,EAAiBvB,EAAEle,EAAI,EAAG0f,GAK5C,GAFAkB,EAAoB,iBAALpnB,EAEJ,CAGT,GAAQ,EAAJA,GAAS,EAAG,OAAOylB,EAAaf,EAAGQ,EAAKkC,EAAO1hB,GAKnD,GAHAgf,EAAElkB,EAAI,EAAIR,EAAI,GAAKklB,EAAMA,EAAI7a,MAAM,IAAK,GAAK,EAGzCd,UAAUke,OAASvC,EAAImC,QAAQ,YAAa,IAAInmB,OAAS,GAC3D,MAAMyI,MACJsa,EAAgBjkB,GAIpBonB,GAAQ,OAER1C,EAAElkB,EAA0B,KAAtB0kB,EAAIV,WAAW,IAAaU,EAAMA,EAAI7a,MAAM,IAAK,GAAK,EAQ9D,IALA6c,EAAWD,EAAS5c,MAAM,EAAG3E,GAC7Bc,EAAIjI,EAAI,EAIH4K,EAAM+b,EAAIhkB,OAAQ3C,EAAI4K,EAAK5K,IAC9B,GAAI2oB,EAAStK,QAAQhe,EAAIsmB,EAAIxb,OAAOnL,IAAM,EAAG,CAC3C,GAAS,KAALK,GAGF,GAAIL,EAAIiI,EAAG,CACTA,EAAI2C,EACJ,eAEG,IAAKge,IAGNjC,GAAOA,EAAIpN,gBAAkBoN,EAAMA,EAAIwC,gBACvCxC,GAAOA,EAAIwC,gBAAkBxC,EAAMA,EAAIpN,gBAAgB,CACzDqP,GAAc,EACd5oB,GAAK,EACLiI,EAAI,EACJ,SAIJ,OAAOif,EAAaf,EAAG1kB,EAAI,GAAIonB,EAAO1hB,IAOrCc,GAHL0e,EAAMM,EAAYN,EAAKxf,EAAG,GAAIgf,EAAElkB,IAGnBoc,QAAQ,OAAS,EAAGsI,EAAMA,EAAImC,QAAQ,IAAK,IACnD7gB,EAAI0e,EAAIhkB,OAIf,IAAK3C,EAAI,EAAyB,KAAtB2mB,EAAIV,WAAWjmB,GAAWA,KAGtC,IAAK4K,EAAM+b,EAAIhkB,OAAkC,KAA1BgkB,EAAIV,aAAarb,KAIxC,GAFA+b,EAAMA,EAAI7a,MAAM9L,IAAK4K,GAEZ,CAIP,GAHAA,GAAO5K,EAGH6oB,GAAS7d,UAAUke,OACrBte,EAAM,KAAOnJ,EArQA,kBAqQwBA,IAAM+jB,EAAU/jB,IACnD,MAAM2J,MACJsa,EAAiBS,EAAElkB,EAAIR,GAM7B,IAHAwG,EAAIA,EAAIjI,EAAI,GAGJ+nB,EAGN5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,UAGP,GAAIA,EAAI6f,EAGb3B,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,OACR,CAWL,GAVAke,EAAEle,EAAIA,EACNke,EAAE9lB,EAAI,GAMNL,GAAKiI,EAAI,GAhSJ,GAiSDA,EAAI,IAAGjI,GAjSN,IAmSDA,EAAI4K,EAAK,CAGX,IAFI5K,GAAGmmB,EAAE9lB,EAAE4L,MAAM0a,EAAI7a,MAAM,EAAG9L,IAEzB4K,GAtSF,GAsSmB5K,EAAI4K,GACxBub,EAAE9lB,EAAE4L,MAAM0a,EAAI7a,MAAM9L,EAAGA,GAvStB,KA2SHA,EA3SG,IA0SH2mB,EAAMA,EAAI7a,MAAM9L,IACG2C,YAEnB3C,GAAK4K,EAGP,KAAO5K,IAAK2mB,GAAO,KACnBR,EAAE9lB,EAAE4L,MAAM0a,SAKZR,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,GA8xBjB,SAASmhB,OAAO3nB,EAAGzB,EAAGqpB,EAAI5f,GACxB,IAAI6f,EAAIrhB,EAAGshB,EAAI3e,EAAK+b,EAKpB,GAHU,MAAN0C,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,IAEhB5nB,EAAEpB,EAAG,OAAOoB,EAAEwJ,WAKnB,GAHAqe,EAAK7nB,EAAEpB,EAAE,GACTkpB,EAAK9nB,EAAEwG,EAEE,MAALjI,EACF2mB,EAAMZ,cAActkB,EAAEpB,GACtBsmB,EAAY,GAANld,GAAiB,GAANA,GAAW8f,GAAM3B,EAC/BlB,cAAcC,EAAK4C,GACnB3C,aAAaD,EAAK4C,EAAI,UAezB,GAVAthB,GAHAxG,EAAIwnB,MAAM,IAAIje,UAAUvJ,GAAIzB,EAAGqpB,IAGzBphB,EAGN2C,GADA+b,EAAMZ,cAActkB,EAAEpB,IACZsC,OAOA,GAAN8G,GAAiB,GAANA,IAAYzJ,GAAKiI,GAAKA,GAAK2f,GAAa,CAGrD,KAAOhd,EAAM5K,EAAG2mB,GAAO,IAAK/b,KAC5B+b,EAAMD,cAAcC,EAAK1e,QAQzB,GAJAjI,GAAKupB,EACL5C,EAAMC,aAAaD,EAAK1e,EAAG,KAGvBA,EAAI,EAAI2C,GACV,KAAM5K,EAAI,EAAG,IAAK2mB,GAAO,IAAK3mB,IAAK2mB,GAAO,WAG1C,IADA3mB,GAAKiI,EAAI2C,GACD,EAEN,IADI3C,EAAI,GAAK2C,IAAK+b,GAAO,KAClB3mB,IAAK2mB,GAAO,KAM3B,OAAOllB,EAAEQ,EAAI,GAAKqnB,EAAK,IAAM3C,EAAMA,EAKrC,SAAS6C,SAASrkB,EAAMskB,GACtB,IAAIrpB,EAAGqB,EACLzB,EAAI,EAKN,IAHIoiB,QAAQjd,EAAK,MAAKA,EAAOA,EAAK,IAClC/E,EAAI,IAAI4K,UAAU7F,EAAK,MAEdnF,EAAImF,EAAKxC,QAAS,CAIzB,KAHAlB,EAAI,IAAIuJ,UAAU7F,EAAKnF,KAGhBiC,EAAG,CACR7B,EAAIqB,EACJ,MACSgoB,EAAOtpB,KAAKC,EAAGqB,KACxBrB,EAAIqB,GAIR,OAAOrB,EAQT,SAASspB,UAAUjoB,EAAGpB,EAAG4H,GAKvB,IAJA,IAAIjI,EAAI,EACN6L,EAAIxL,EAAEsC,QAGAtC,IAAIwL,GAAIxL,EAAEspB,OAGlB,IAAK9d,EAAIxL,EAAE,GAAIwL,GAAK,GAAIA,GAAK,GAAI7L,KAkBjC,OAfKiI,EAAIjI,EArrCA,GAqrCIiI,EAAe,GAAK8f,EAG/BtmB,EAAEpB,EAAIoB,EAAEwG,EAAI,KAGHA,EAAI6f,EAGbrmB,EAAEpB,EAAI,CAACoB,EAAEwG,EAAI,IAEbxG,EAAEwG,EAAIA,EACNxG,EAAEpB,EAAIA,GAGDoB,EAyDT,SAASwnB,MAAM9C,EAAGyD,EAAIP,EAAIvoB,GACxB,IAAIR,EAAGN,EAAG6L,EAAG1B,EAAG1I,EAAGooB,EAAIC,EACrBzD,EAAKF,EAAE9lB,EACP0pB,EAASnE,EAGX,GAAIS,EAAI,CAQNlgB,EAAK,CAGH,IAAK7F,EAAI,EAAG6J,EAAIkc,EAAG,GAAIlc,GAAK,GAAIA,GAAK,GAAI7J,KAIzC,IAHAN,EAAI4pB,EAAKtpB,GAGD,EACNN,GAnxCG,GAoxCH6L,EAAI+d,EAIJE,GAHAroB,EAAI4kB,EAAGwD,EAAK,IAGHE,EAAOzpB,EAAIuL,EAAI,GAAK,GAAK,OAIlC,IAFAge,EAAKtE,GAAUvlB,EAAI,GA1xChB,MA4xCOqmB,EAAG1jB,OAAQ,CAEnB,IAAI7B,EASF,MAAMqF,EANN,KAAOkgB,EAAG1jB,QAAUknB,EAAIxD,EAAGpa,KAAK,IAChCxK,EAAIqoB,EAAK,EACTxpB,EAAI,EAEJuL,GADA7L,GApyCD,OAqyCoB,MAIhB,CAIL,IAHAyB,EAAI0I,EAAIkc,EAAGwD,GAGNvpB,EAAI,EAAG6J,GAAK,GAAIA,GAAK,GAAI7J,KAU9BwpB,GAHAje,GAJA7L,GAhzCC,OAozCkBM,GAGV,EAAI,EAAImB,EAAIsoB,EAAOzpB,EAAIuL,EAAI,GAAK,GAAK,EAmBlD,GAfA/K,EAAIA,GAAK8oB,EAAK,GAKC,MAAdvD,EAAGwD,EAAK,KAAehe,EAAI,EAAIpK,EAAIA,EAAIsoB,EAAOzpB,EAAIuL,EAAI,IAEvD/K,EAAIuoB,EAAK,GACLS,GAAMhpB,KAAa,GAANuoB,GAAWA,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAC9C6nB,EAAK,GAAW,GAANA,IAAkB,GAANT,GAAWvoB,GAAW,GAANuoB,IAGrCrpB,EAAI,EAAI6L,EAAI,EAAIpK,EAAIsoB,EAAOzpB,EAAIuL,GAAK,EAAIwa,EAAGwD,EAAK,IAAM,GAAM,GAC7DR,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAEpB2nB,EAAK,IAAMvD,EAAG,GAiBhB,OAhBAA,EAAG1jB,OAAS,EAER7B,GAGF8oB,GAAMzD,EAAEle,EAAI,EAGZoe,EAAG,GAAK0D,GAn1CP,GAm1C0BH,EAn1C1B,QAo1CDzD,EAAEle,GAAK2hB,GAAM,GAIbvD,EAAG,GAAKF,EAAEle,EAAI,EAGTke,EAkBT,GAdS,GAALnmB,GACFqmB,EAAG1jB,OAASknB,EACZ1f,EAAI,EACJ0f,MAEAxD,EAAG1jB,OAASknB,EAAK,EACjB1f,EAAI4f,EAr2CD,GAq2CmB/pB,GAItBqmB,EAAGwD,GAAMhe,EAAI,EAAI2Z,EAAU/jB,EAAIsoB,EAAOzpB,EAAIuL,GAAKke,EAAOle,IAAM1B,EAAI,GAI9DrJ,EAEF,OAAU,CAGR,GAAU,GAAN+oB,EAAS,CAGX,IAAK7pB,EAAI,EAAG6L,EAAIwa,EAAG,GAAIxa,GAAK,GAAIA,GAAK,GAAI7L,KAEzC,IADA6L,EAAIwa,EAAG,IAAMlc,EACRA,EAAI,EAAG0B,GAAK,GAAIA,GAAK,GAAI1B,KAG1BnK,GAAKmK,IACPgc,EAAEle,IACEoe,EAAG,IAAMV,IAAMU,EAAG,GAAK,IAG7B,MAGA,GADAA,EAAGwD,IAAO1f,EACNkc,EAAGwD,IAAOlE,EAAM,MACpBU,EAAGwD,KAAQ,EACX1f,EAAI,EAMV,IAAKnK,EAAIqmB,EAAG1jB,OAAoB,IAAZ0jB,IAAKrmB,GAAUqmB,EAAGsD,QAIpCxD,EAAEle,EAAI8f,EACR5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,KAGHke,EAAEle,EAAI6f,IACf3B,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,IAIjB,OAAOke,EA+oCT,OAxuEAnb,UAAU8b,MAAQA,MAElB9b,UAAUgf,SAAW,EACrBhf,UAAUif,WAAa,EACvBjf,UAAUkf,WAAa,EACvBlf,UAAUmf,YAAc,EACxBnf,UAAUof,cAAgB,EAC1Bpf,UAAUqf,gBAAkB,EAC5Brf,UAAUsf,gBAAkB,EAC5Btf,UAAUuf,gBAAkB,EAC5Bvf,UAAUwf,iBAAmB,EAC7Bxf,UAAUyf,OAAS,EAmCnBzf,UAAUmS,OAASnS,UAAUwL,IAAM,SAAUrU,GAC3C,IAAIH,EAAG0oB,EAEP,GAAW,MAAPvoB,EAAa,CAEf,GAAkB,iBAAPA,EA0HT,MAAMiJ,MACJqa,EAAiB,oBAAsBtjB,GArFzC,GAlCIA,EAAIJ,eAAeC,EAAI,oBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG6jB,EAAK7jB,GACpB0lB,EAAiBgD,GAKfvoB,EAAIJ,eAAeC,EAAI,mBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG,EAAGA,GAClB2lB,EAAgB+C,GAOdvoB,EAAIJ,eAAeC,EAAI,oBAErBogB,QADJsI,EAAIvoB,EAAIH,KAENukB,SAASmE,EAAE,IAAK7E,EAAK,EAAG7jB,GACxBukB,SAASmE,EAAE,GAAI,EAAG7E,EAAK7jB,GACvB4lB,EAAa8C,EAAE,GACf7C,EAAa6C,EAAE,KAEfnE,SAASmE,GAAI7E,EAAKA,EAAK7jB,GACvB4lB,IAAeC,EAAa6C,EAAI,GAAKA,EAAIA,KAOzCvoB,EAAIJ,eAAeC,EAAI,SAEzB,GAAIogB,QADJsI,EAAIvoB,EAAIH,IAENukB,SAASmE,EAAE,IAAK7E,GAAM,EAAG7jB,GACzBukB,SAASmE,EAAE,GAAI,EAAG7E,EAAK7jB,GACvB8lB,EAAU4C,EAAE,GACZ3C,EAAU2C,EAAE,OACP,CAEL,GADAnE,SAASmE,GAAI7E,EAAKA,EAAK7jB,IACnB0oB,EAGF,MAAMtf,MACJqa,EAAiBzjB,EAAI,oBAAsB0oB,GAH7C5C,IAAYC,EAAU2C,EAAI,GAAKA,EAAIA,GAWzC,GAAIvoB,EAAIJ,eAAeC,EAAI,UAAW,CAEpC,IADA0oB,EAAIvoB,EAAIH,QACI0oB,EAcV,MAAMtf,MACJqa,EAAiBzjB,EAAI,uBAAyB0oB,GAdhD,GAAIA,EAAG,CACL,GAAqB,oBAAVC,SAAyBA,SAClCA,OAAOC,kBAAmBD,OAAOE,YAIjC,MADA7C,GAAU0C,EACJtf,MACJqa,EAAiB,sBAJnBuC,EAAS0C,OAOX1C,EAAS0C,EA0Bf,GAhBIvoB,EAAIJ,eAAeC,EAAI,iBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG,EAAGA,GAClBimB,EAAcyC,GAKZvoB,EAAIJ,eAAeC,EAAI,mBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG6jB,EAAK7jB,GACpBkmB,EAAgBwC,GAKdvoB,EAAIJ,eAAeC,EAAI,UAAW,CAEpC,GAAgB,iBADhB0oB,EAAIvoB,EAAIH,IAEH,MAAMoJ,MACTqa,EAAiBzjB,EAAI,mBAAqB0oB,GAFlBvC,EAASuC,EAOrC,GAAIvoB,EAAIJ,eAAeC,EAAI,YAAa,CAItC,GAAgB,iBAHhB0oB,EAAIvoB,EAAIH,KAGqB,iBAAiB4V,KAAK8S,GAGjD,MAAMtf,MACJqa,EAAiBzjB,EAAI,aAAe0oB,GAHtChC,EAAWgC,GAenB,MAAO,CACLhD,eAAgBA,EAChBC,cAAeA,EACfmD,eAAgB,CAAClD,EAAYC,GAC7BkD,MAAO,CAACjD,EAASC,GACjBC,OAAQA,EACRC,YAAaA,EACbC,cAAeA,EACfC,OAAQA,EACRO,SAAUA,IAUd1d,UAAUggB,YAAc,SAAUN,GAChC,OAAOA,aAAa1f,WAAa0f,IAAwB,IAAnBA,EAAEO,eAAyB,GASnEjgB,UAAUkgB,QAAUlgB,UAAUwb,IAAM,WAClC,OAAOgD,SAASpkB,UAAWuB,EAAEwL,KAS/BnH,UAAUmgB,QAAUngB,UAAUgP,IAAM,WAClC,OAAOwP,SAASpkB,UAAWuB,EAAEykB,KAc/BpgB,UAAUwC,QAOJ2Z,EANU,iBAMQ3f,KAAKgG,SAAsB,QAC9C,WAAc,OAAOgY,EAPV,iBAOoBhe,KAAKgG,WACpC,WAAc,OAA2C,SAAlB,WAAhBhG,KAAKgG,SAAwB,IACnC,QAAhBhG,KAAKgG,SAAsB,IAExB,SAAU6d,GACf,IAAInkB,EAAGC,EAAGc,EAAGkC,EAAGugB,EACd1qB,EAAI,EACJK,EAAI,GACJirB,EAAO,IAAItgB,UAAUyc,GAOvB,GALU,MAAN4D,EAAYA,EAAK3D,EAChBnB,SAAS8E,EAAI,EAAGxF,GAErB1b,EAAIob,EAAS8F,EA3jBN,IA6jBHrD,EAGF,GAAI2C,OAAOC,gBAAiB,CAI1B,IAFA1jB,EAAIyjB,OAAOC,gBAAgB,IAAIW,YAAYphB,GAAK,IAEzCnK,EAAImK,IAQTugB,EAAW,OAAPxjB,EAAElH,IAAgBkH,EAAElH,EAAI,KAAO,MAM1B,MACPmH,EAAIwjB,OAAOC,gBAAgB,IAAIW,YAAY,IAC3CrkB,EAAElH,GAAKmH,EAAE,GACTD,EAAElH,EAAI,GAAKmH,EAAE,KAKb9G,EAAE4L,KAAKye,EAAI,MACX1qB,GAAK,GAGTA,EAAImK,EAAI,MAGH,KAAIwgB,OAAOE,YA2BhB,MADA7C,GAAS,EACH5c,MACJqa,EAAiB,sBAvBnB,IAFAve,EAAIyjB,OAAOE,YAAY1gB,GAAK,GAErBnK,EAAImK,IAMTugB,EAAmB,iBAAN,GAAPxjB,EAAElH,IAA0C,cAAXkH,EAAElH,EAAI,GAC9B,WAAXkH,EAAElH,EAAI,GAAgC,SAAXkH,EAAElH,EAAI,IACjCkH,EAAElH,EAAI,IAAM,KAAOkH,EAAElH,EAAI,IAAM,GAAKkH,EAAElH,EAAI,KAErC,KACP2qB,OAAOE,YAAY,GAAGW,KAAKtkB,EAAGlH,IAI9BK,EAAE4L,KAAKye,EAAI,MACX1qB,GAAK,GAGTA,EAAImK,EAAI,EASZ,IAAK6d,EAEH,KAAOhoB,EAAImK,IACTugB,EAAIvD,KACI,OAAM9mB,EAAEL,KAAO0qB,EAAI,MAc/B,IATAW,GA3oBO,IA0oBPlhB,EAAI9J,IAAIL,KAICqrB,IACPX,EAAI9E,EA/oBC,GA+oBmByF,GACxBhrB,EAAEL,GAAKwlB,EAAUrb,EAAIugB,GAAKA,GAIZ,IAATrqB,EAAEL,GAAUK,EAAEspB,MAAO3pB,KAG5B,GAAIA,EAAI,EACNK,EAAI,CAAC4H,EAAI,OACJ,CAGL,IAAKA,GAAK,EAAa,IAAT5H,EAAE,GAAUA,EAAEorB,OAAO,EAAG,GAAIxjB,GA5pBrC,IA+pBL,IAAKjI,EAAI,EAAG0qB,EAAIrqB,EAAE,GAAIqqB,GAAK,GAAIA,GAAK,GAAI1qB,KAGpCA,EAlqBC,KAkqBaiI,GAlqBb,GAkqB6BjI,GAKpC,OAFAsrB,EAAKrjB,EAAIA,EACTqjB,EAAKjrB,EAAIA,EACFirB,IASXrE,EAAc,WAQZ,SAASyE,UAAU/E,EAAKgF,EAAQC,EAASjD,GAOvC,IANA,IAAI9c,EAEFggB,EADAtiB,EAAM,CAAC,GAEPvJ,EAAI,EACJ4K,EAAM+b,EAAIhkB,OAEL3C,EAAI4K,GAAM,CACf,IAAKihB,EAAOtiB,EAAI5G,OAAQkpB,IAAQtiB,EAAIsiB,IAASF,GAI7C,IAFApiB,EAAI,IAAMof,EAAStK,QAAQsI,EAAIxb,OAAOnL,MAEjC6L,EAAI,EAAGA,EAAItC,EAAI5G,OAAQkJ,IAEtBtC,EAAIsC,GAAK+f,EAAU,IACH,MAAdriB,EAAIsC,EAAI,KAAYtC,EAAIsC,EAAI,GAAK,GACrCtC,EAAIsC,EAAI,IAAMtC,EAAIsC,GAAK+f,EAAU,EACjCriB,EAAIsC,IAAM+f,GAKhB,OAAOriB,EAAIuiB,UAMb,OAAO,SAAUnF,EAAKgF,EAAQC,EAASG,EAAMC,GAC3C,IAAIrD,EAAUroB,EAAG2H,EAAGkC,EAAGrJ,EAAGqlB,EAAGE,EAAID,EAC/BpmB,EAAI2mB,EAAItI,QAAQ,KAChBgN,EAAK3D,EACL2B,EAAK1B,EA+BP,IA5BI3nB,GAAK,IACPmK,EAAI+d,EAGJA,EAAgB,EAChBvB,EAAMA,EAAImC,QAAQ,IAAK,IAEvB3C,GADAC,EAAI,IAAIpb,UAAU2gB,IACZM,IAAItF,EAAIhkB,OAAS3C,GACvBkoB,EAAgB/d,EAKhBic,EAAE/lB,EAAIqrB,UAAU9E,aAAab,cAAcI,EAAE9lB,GAAI8lB,EAAEle,EAAG,KACrD,GAAI2jB,EAxDK,cAyDVxF,EAAEne,EAAIme,EAAE/lB,EAAEsC,QAUZsF,EAAIkC,GALJkc,EAAKqF,UAAU/E,EAAKgF,EAAQC,EAASI,GACjCrD,EAAWD,EA/DH,eAgERC,EAhEQ,aAgEYD,KAGb/lB,OAGO,GAAX0jB,IAAKlc,GAASkc,EAAGsD,OAGxB,IAAKtD,EAAG,GAAI,OAAOsC,EAASxd,OAAO,GAqCnC,GAlCInL,EAAI,IACJiI,GAEFke,EAAE9lB,EAAIgmB,EACNF,EAAEle,EAAIA,EAGNke,EAAElkB,EAAI8pB,EAEN1F,GADAF,EAAIa,EAAIb,EAAGC,EAAGiF,EAAIhC,EAAIuC,IACfvrB,EACPS,EAAIqlB,EAAErlB,EACNmH,EAAIke,EAAEle,GASRjI,EAAIqmB,EAHJ/lB,EAAI2H,EAAIojB,EAAK,GAOblhB,EAAIyhB,EAAU,EACd9qB,EAAIA,GAAKR,EAAI,GAAkB,MAAb+lB,EAAG/lB,EAAI,GAEzBQ,EAAIuoB,EAAK,GAAU,MAALrpB,GAAac,KAAa,GAANuoB,GAAWA,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAC1DjC,EAAImK,GAAKnK,GAAKmK,IAAW,GAANkf,GAAWvoB,GAAW,GAANuoB,GAAuB,EAAZhD,EAAG/lB,EAAI,IACtD+oB,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAKxB3B,EAAI,IAAM+lB,EAAG,GAGfM,EAAM7lB,EAAI8lB,aAAa+B,EAASxd,OAAO,IAAKkgB,EAAI1C,EAASxd,OAAO,IAC1Dwd,EAASxd,OAAO,OACjB,CAML,GAHAkb,EAAG1jB,OAASrC,EAGRQ,EAGF,MAAO8qB,IAAWvF,IAAK/lB,GAAKsrB,GAC1BvF,EAAG/lB,GAAK,EAEHA,MACD2H,EACFoe,EAAK,CAAC,GAAG9b,OAAO8b,IAMtB,IAAKlc,EAAIkc,EAAG1jB,QAAS0jB,IAAKlc,KAG1B,IAAKnK,EAAI,EAAG2mB,EAAM,GAAI3mB,GAAKmK,EAAGwc,GAAOgC,EAASxd,OAAOkb,EAAGrmB,OAGxD2mB,EAAMC,aAAaD,EAAK1e,EAAG0gB,EAASxd,OAAO,IAI7C,OAAOwb,GAlJG,GAwJdK,EAAM,WAGJ,SAASkF,SAAS/F,EAAGhc,EAAGgiB,GACtB,IAAI/rB,EAAGgsB,EAAMC,EAAKC,EAChBC,EAAQ,EACRvsB,EAAImmB,EAAExjB,OACN6pB,EAAMriB,EA30BA,IA40BNsiB,EAAMtiB,EA50BA,IA40BgB,EAExB,IAAKgc,EAAIA,EAAEra,QAAS9L,KAKlBusB,IADAH,EAAOI,GAHPH,EAAMlG,EAAEnmB,GA/0BF,MAi1BNI,EAAIqsB,EAAMJ,GADVC,EAAMnG,EAAEnmB,GAh1BF,IAg1BmB,GACHwsB,GAj1BhB,QAk1B6CD,GACnCJ,EAAO,IAAM/rB,EAn1BvB,IAm1BuC,GAAKqsB,EAAMH,EACxDnG,EAAEnmB,GAAKosB,EAAOD,EAKhB,OAFII,IAAOpG,EAAI,CAACoG,GAAOhiB,OAAO4b,IAEvBA,EAGT,SAASD,QAAQhf,EAAGC,EAAGulB,EAAIC,GACzB,IAAI3sB,EAAG4sB,EAEP,GAAIF,GAAMC,EACRC,EAAMF,EAAKC,EAAK,GAAK,OAGrB,IAAK3sB,EAAI4sB,EAAM,EAAG5sB,EAAI0sB,EAAI1sB,IAExB,GAAIkH,EAAElH,IAAMmH,EAAEnH,GAAI,CAChB4sB,EAAM1lB,EAAElH,GAAKmH,EAAEnH,GAAK,GAAK,EACzB,MAKN,OAAO4sB,EAGT,SAASC,SAAS3lB,EAAGC,EAAGulB,EAAIP,GAI1B,IAHA,IAAInsB,EAAI,EAGD0sB,KACLxlB,EAAEwlB,IAAO1sB,EACTA,EAAIkH,EAAEwlB,GAAMvlB,EAAEulB,GAAM,EAAI,EACxBxlB,EAAEwlB,GAAM1sB,EAAImsB,EAAOjlB,EAAEwlB,GAAMvlB,EAAEulB,GAI/B,MAAQxlB,EAAE,IAAMA,EAAEvE,OAAS,EAAGuE,EAAEukB,OAAO,EAAG,KAI5C,OAAO,SAAUtF,EAAGC,EAAGiF,EAAIhC,EAAI8C,GAC7B,IAAIS,EAAK3kB,EAAGjI,EAAG8sB,EAAMrrB,EAAGsrB,EAAMC,EAAOC,EAAGC,EAAIC,EAAKC,EAAMC,EAAMC,EAAIC,EAAIC,EACnEC,EAAIC,EACJzrB,EAAIkkB,EAAElkB,GAAKmkB,EAAEnkB,EAAI,GAAK,EACtBokB,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAGT,KAAKgmB,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAItb,UAGTmb,EAAElkB,GAAMmkB,EAAEnkB,IAAMokB,GAAKC,GAAMD,EAAG,IAAMC,EAAG,GAAMA,GAG7CD,GAAe,GAATA,EAAG,KAAYC,EAAS,EAAJrkB,EAAQA,EAAI,EAHa0rB,KAoBvD,IAZAT,GADAD,EAAI,IAAIjiB,UAAU/I,IACX5B,EAAI,GAEX4B,EAAIopB,GADJpjB,EAAIke,EAAEle,EAAIme,EAAEne,GACC,EAERkkB,IACHA,EAAOxG,EACP1d,EAAI6d,SAASK,EAAEle,EA75BV,IA65B0B6d,SAASM,EAAEne,EA75BrC,IA85BLhG,EAAIA,EA95BC,GA85Bc,GAKhBjC,EAAI,EAAGsmB,EAAGtmB,KAAOqmB,EAAGrmB,IAAM,GAAIA,KAInC,GAFIsmB,EAAGtmB,IAAMqmB,EAAGrmB,IAAM,IAAIiI,IAEtBhG,EAAI,EACNirB,EAAGjhB,KAAK,GACR6gB,GAAO,MACF,CAwBL,IAvBAS,EAAKlH,EAAG1jB,OACR8qB,EAAKnH,EAAG3jB,OACR3C,EAAI,EACJiC,GAAK,GAILR,EAAI+jB,EAAU2G,GAAQ7F,EAAG,GAAK,KAItB,IACNA,EAAK4F,SAAS5F,EAAI7kB,EAAG0qB,GACrB9F,EAAK6F,SAAS7F,EAAI5kB,EAAG0qB,GACrBsB,EAAKnH,EAAG3jB,OACR4qB,EAAKlH,EAAG1jB,QAGV2qB,EAAKG,EAELL,GADAD,EAAM9G,EAAGva,MAAM,EAAG2hB,IACP9qB,OAGJyqB,EAAOK,EAAIN,EAAIC,KAAU,GAChCM,EAAKpH,EAAGxa,QACR4hB,EAAK,CAAC,GAAGnjB,OAAOmjB,GAChBF,EAAMlH,EAAG,GACLA,EAAG,IAAM6F,EAAO,GAAGqB,IAIvB,EAAG,CAOD,GANA/rB,EAAI,GAGJmrB,EAAM1G,QAAQI,EAAI6G,EAAKM,EAAIL,IAGjB,EAAG,CAqBX,GAjBAC,EAAOF,EAAI,GACPM,GAAML,IAAMC,EAAOA,EAAOlB,GAAQgB,EAAI,IAAM,KAGhD1rB,EAAI+jB,EAAU6H,EAAOG,IAab,EAcN,IAXI/rB,GAAK0qB,IAAM1qB,EAAI0qB,EAAO,GAI1Ba,GADAD,EAAOb,SAAS5F,EAAI7kB,EAAG0qB,IACVxpB,OACbyqB,EAAOD,EAAIxqB,OAM+B,GAAnCujB,QAAQ6G,EAAMI,EAAKH,EAAOI,IAC/B3rB,IAGAorB,SAASE,EAAMU,EAAKT,EAAQU,EAAKpH,EAAI0G,EAAOb,GAC5Ca,EAAQD,EAAKpqB,OACbiqB,EAAM,OAQC,GAALnrB,IAGFmrB,EAAMnrB,EAAI,GAKZurB,GADAD,EAAOzG,EAAGxa,SACGnJ,OAUf,GAPIqqB,EAAQI,IAAML,EAAO,CAAC,GAAGxiB,OAAOwiB,IAGpCF,SAASM,EAAKJ,EAAMK,EAAMjB,GAC1BiB,EAAOD,EAAIxqB,QAGC,GAARiqB,EAMF,KAAO1G,QAAQI,EAAI6G,EAAKM,EAAIL,GAAQ,GAClC3rB,IAGAorB,SAASM,EAAKM,EAAKL,EAAOM,EAAKpH,EAAI8G,EAAMjB,GACzCiB,EAAOD,EAAIxqB,YAGE,IAARiqB,IACTnrB,IACA0rB,EAAM,CAAC,IAITD,EAAGltB,KAAOyB,EAGN0rB,EAAI,GACNA,EAAIC,KAAU/G,EAAGiH,IAAO,GAExBH,EAAM,CAAC9G,EAAGiH,IACVF,EAAO,UAEDE,IAAOC,GAAgB,MAAVJ,EAAI,KAAelrB,KAE1C6qB,EAAiB,MAAVK,EAAI,GAGND,EAAG,IAAIA,EAAGzB,OAAO,EAAG,GAG3B,GAAIU,GAAQxG,EAAM,CAGhB,IAAK3lB,EAAI,EAAGiC,EAAIirB,EAAG,GAAIjrB,GAAK,GAAIA,GAAK,GAAIjC,KAEzCipB,MAAMgE,EAAG5B,GAAM4B,EAAEhlB,EAAIjI,EA9jChB,GA8jCoBiI,EAAe,GAAK,EAAGohB,EAAIyD,QAIpDG,EAAEhlB,EAAIA,EACNglB,EAAEnsB,GAAKgsB,EAGT,OAAOG,GA9PL,GAkYA7F,EAAa,8BACfC,EAAW,cACXC,EAAY,cACZC,EAAkB,qBAClBC,EAAmB,6BALvBN,EAOS,SAAUf,EAAGQ,EAAKkC,EAAO1hB,GAC9B,IAAIglB,EACFlqB,EAAI4mB,EAAQlC,EAAMA,EAAImC,QAAQtB,EAAkB,IAGlD,GAAID,EAAgB3P,KAAK3V,GACvBkkB,EAAElkB,EAAIyO,MAAMzO,GAAK,KAAOA,EAAI,GAAK,EAAI,EACrCkkB,EAAE9lB,EAAI8lB,EAAEle,EAAI,SACP,CACL,IAAK4gB,IAGH5mB,EAAIA,EAAE6mB,QAAQ1B,GAAY,SAAUhnB,EAAGwtB,EAAIC,GAEzC,OADA1B,EAAkC,MAA1B0B,EAAKA,EAAG1E,eAAwB,GAAW,KAAN0E,EAAY,EAAI,EACrD1mB,GAAKA,GAAKglB,EAAY/rB,EAALwtB,KAGvBzmB,IACFglB,EAAOhlB,EAGPlF,EAAIA,EAAE6mB,QAAQzB,EAAU,MAAMyB,QAAQxB,EAAW,SAG/CX,GAAO1kB,GAAG,OAAO,IAAI+I,UAAU/I,EAAGkqB,GAKxC,GAAInhB,UAAUke,MACZ,MAAM9d,MACHqa,EAAiB,SAAWte,EAAI,SAAWA,EAAI,IAAM,YAAcwf,GAIxER,EAAE9lB,EAAI8lB,EAAEle,EAAIke,EAAElkB,EAAI,OA8KxB0E,EAAEmnB,cAAgBnnB,EAAEonB,IAAM,WACxB,IAAI5H,EAAI,IAAInb,UAAU9F,MAEtB,OADIihB,EAAElkB,EAAI,IAAGkkB,EAAElkB,EAAI,GACZkkB,GAWTxf,EAAEqnB,WAAa,SAAU5H,EAAGjf,GAC1B,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,KAiBxCR,EAAEsnB,cAAgBtnB,EAAE0kB,GAAK,SAAUA,EAAIhC,GACrC,IAAIhpB,EAAGoB,EAAGipB,EACRvE,EAAIjhB,KAEN,GAAU,MAANmmB,EAKF,OAJA9E,SAAS8E,EAAI,EAAGxF,GACN,MAANwD,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GAEdJ,MAAM,IAAIje,UAAUmb,GAAIkF,EAAKlF,EAAEle,EAAI,EAAGohB,GAG/C,KAAMhpB,EAAI8lB,EAAE9lB,GAAI,OAAO,KAIvB,GAHAoB,EA98CS,KA88CHipB,EAAIrqB,EAAEsC,OAAS,GAAKmjB,SAAS5gB,KAAK+C,EA98C/B,KAi9CLyiB,EAAIrqB,EAAEqqB,GAAI,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIjpB,KAG3C,OAFIA,EAAI,IAAGA,EAAI,GAERA,GAwBTkF,EAAEunB,UAAYvnB,EAAEqgB,IAAM,SAAUZ,EAAGjf,GACjC,OAAO6f,EAAI9hB,KAAM,IAAI8F,UAAUob,EAAGjf,GAAIugB,EAAgBC,IAQxDhhB,EAAEwnB,mBAAqBxnB,EAAEynB,KAAO,SAAUhI,EAAGjf,GAC3C,OAAO6f,EAAI9hB,KAAM,IAAI8F,UAAUob,EAAGjf,GAAI,EAAG,IAmB3CR,EAAE0nB,gBAAkB1nB,EAAEslB,IAAM,SAAUxqB,EAAGrB,GACvC,IAAIkuB,EAAMC,EAAUpkB,EAASqkB,EAAQC,EAAQC,EAAQtI,EACnDD,EAAIjhB,KAKN,IAHAzD,EAAI,IAAIuJ,UAAUvJ,IAGZpB,IAAMoB,EAAEktB,YACZ,MAAMvjB,MACHqa,EAAiB,4BAA8BhkB,GASpD,GANS,MAALrB,IAAWA,EAAI,IAAI4K,UAAU5K,IAGjCouB,EAAS/sB,EAAEwG,EAAI,IAGVke,EAAE9lB,IAAM8lB,EAAE9lB,EAAE,IAAgB,GAAV8lB,EAAE9lB,EAAE,KAAY8lB,EAAEle,GAAmB,GAAdke,EAAE9lB,EAAEsC,SAAgBlB,EAAEpB,IAAMoB,EAAEpB,EAAE,GAK5E,OADA+lB,EAAI,IAAIpb,UAAUxD,KAAKykB,KAAK9F,EAAE3V,UAAWge,EAAS,EAAI/H,MAAMhlB,IAAMA,IAC3DrB,EAAIgmB,EAAEwI,IAAIxuB,GAAKgmB,EAKxB,GAFAqI,EAAShtB,EAAEQ,EAAI,EAEX7B,EAAG,CAGL,GAAIA,EAAEC,GAAKD,EAAEC,EAAE,IAAMD,EAAE6B,EAAG,OAAO,IAAI+I,UAAU2iB,MAE/CY,GAAYE,GAAUtI,EAAEwI,aAAevuB,EAAEuuB,eAE3BxI,EAAIA,EAAEyI,IAAIxuB,QAInB,IAAIqB,EAAEwG,EAAI,IAAMke,EAAEle,EAAI,GAAKke,EAAEle,GAAK,IAAa,GAAPke,EAAEle,EAE7Cke,EAAE9lB,EAAE,GAAK,GAAKmuB,GAAUrI,EAAE9lB,EAAE,IAAM,KAElC8lB,EAAE9lB,EAAE,GAAK,MAAQmuB,GAAUrI,EAAE9lB,EAAE,IAAM,YASvC,OANA8J,EAAIgc,EAAElkB,EAAI,GAAKwkB,MAAMhlB,IAAM,EAAI,EAG3B0kB,EAAEle,GAAK,IAAGkC,EAAI,EAAIA,GAGf,IAAIa,UAAUyjB,EAAS,EAAItkB,EAAIA,GAE7B+d,IAKT/d,EAAIob,EAAS2C,EApkDN,GAokDiC,IAe1C,IAZIsG,GACFF,EAAO,IAAItjB,UAAU,IACrB0jB,EAASjI,MAAMhlB,IAEfitB,EAASjtB,EAAI,EAGXgtB,IAAQhtB,EAAEQ,EAAI,GAElBmkB,EAAI,IAAIpb,UAAUyc,KAGR,CAER,GAAIiH,EAAQ,CAEV,KADAtI,EAAIA,EAAEyI,MAAM1I,IACL9lB,EAAG,MAEN8J,EACEic,EAAE/lB,EAAEsC,OAASwH,IAAGic,EAAE/lB,EAAEsC,OAASwH,GACxBokB,IACTnI,EAAIA,EAAEwI,IAAIxuB,IAId,GAAIouB,EAAQ,CAGV,GADAvF,MADAxnB,EAAIA,EAAEotB,MAAMP,GACH7sB,EAAEwG,EAAI,EAAG,IACbxG,EAAEpB,EAAE,GAAI,MACbmuB,EAAS/sB,EAAEwG,EAAI,GACfymB,EAASjI,MAAMhlB,OACV,CAEL,KADAA,EAAI+jB,EAAU/jB,EAAI,IACV,MACRitB,EAASjtB,EAAI,EAGf0kB,EAAIA,EAAE0I,MAAM1I,GAERhc,EACEgc,EAAE9lB,GAAK8lB,EAAE9lB,EAAEsC,OAASwH,IAAGgc,EAAE9lB,EAAEsC,OAASwH,GAC/BokB,IACTpI,EAAIA,EAAEyI,IAAIxuB,IAId,OAAImuB,EAAiBnI,GACjBqI,IAAQrI,EAAIqB,EAAIT,IAAIZ,IAEjBhmB,EAAIgmB,EAAEwI,IAAIxuB,GAAK+J,EAAI8e,MAAM7C,EAAG8B,EAAeP,OA9G3BmF,GA8GkD1G,IAY3Ezf,EAAEmoB,aAAe,SAAUzF,GACzB,IAAI5nB,EAAI,IAAIuJ,UAAU9F,MAGtB,OAFU,MAANmkB,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GACdJ,MAAMxnB,EAAGA,EAAEwG,EAAI,EAAGohB,IAQ3B1iB,EAAEooB,UAAYpoB,EAAEkJ,GAAK,SAAUuW,EAAGjf,GAChC,OAA8C,IAAvC+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,KAOxCR,EAAEqoB,SAAW,WACX,QAAS9pB,KAAK7E,GAQhBsG,EAAEsoB,cAAgBtoB,EAAEykB,GAAK,SAAUhF,EAAGjf,GACpC,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,IAAM,GAQ9CR,EAAEuoB,uBAAyBvoB,EAAEwoB,IAAM,SAAU/I,EAAGjf,GAC9C,OAAoD,KAA5CA,EAAI+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,MAAoB,IAANA,GAQ3DR,EAAEgoB,UAAY,WACZ,QAASzpB,KAAK7E,GAAKylB,SAAS5gB,KAAK+C,EAprDxB,IAorDwC/C,KAAK7E,EAAEsC,OAAS,GAQnEgE,EAAEyoB,WAAazoB,EAAEwL,GAAK,SAAUiU,EAAGjf,GACjC,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,IAAM,GAQ9CR,EAAE0oB,oBAAsB1oB,EAAE2oB,IAAM,SAAUlJ,EAAGjf,GAC3C,OAAqD,KAA7CA,EAAI+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,MAAqB,IAANA,GAO5DR,EAAE+J,MAAQ,WACR,OAAQxL,KAAKjD,GAOf0E,EAAE4oB,WAAa,WACb,OAAOrqB,KAAKjD,EAAI,GAOlB0E,EAAE6oB,WAAa,WACb,OAAOtqB,KAAKjD,EAAI,GAOlB0E,EAAE8oB,OAAS,WACT,QAASvqB,KAAK7E,GAAkB,GAAb6E,KAAK7E,EAAE,IAwB5BsG,EAAE+oB,MAAQ,SAAUtJ,EAAGjf,GACrB,IAAInH,EAAG6L,EAAG3K,EAAGyuB,EACXxJ,EAAIjhB,KACJgC,EAAIif,EAAElkB,EAMR,GAHAkF,GADAif,EAAI,IAAIpb,UAAUob,EAAGjf,IACflF,GAGDiF,IAAMC,EAAG,OAAO,IAAI6D,UAAU2iB,KAGnC,GAAIzmB,GAAKC,EAEP,OADAif,EAAEnkB,GAAKkF,EACAgf,EAAEyJ,KAAKxJ,GAGhB,IAAIyJ,EAAK1J,EAAEle,EA/wDF,GAgxDP6nB,EAAK1J,EAAEne,EAhxDA,GAixDPoe,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAET,IAAKwvB,IAAOC,EAAI,CAGd,IAAKzJ,IAAOC,EAAI,OAAOD,GAAMD,EAAEnkB,GAAKkF,EAAGif,GAAK,IAAIpb,UAAUsb,EAAKH,EAAIwH,KAGnE,IAAKtH,EAAG,KAAOC,EAAG,GAGhB,OAAOA,EAAG,IAAMF,EAAEnkB,GAAKkF,EAAGif,GAAK,IAAIpb,UAAUqb,EAAG,GAAKF,EAGnC,GAAjBwB,GAAsB,EAAI,GAS/B,GALAkI,EAAK/J,SAAS+J,GACdC,EAAKhK,SAASgK,GACdzJ,EAAKA,EAAGva,QAGJ5E,EAAI2oB,EAAKC,EAAI,CAaf,KAXIH,EAAOzoB,EAAI,IACbA,GAAKA,EACLhG,EAAImlB,IAEJyJ,EAAKD,EACL3uB,EAAIolB,GAGNplB,EAAE4qB,UAGG3kB,EAAID,EAAGC,IAAKjG,EAAE+K,KAAK,IACxB/K,EAAE4qB,eAMF,IAFAjgB,GAAK8jB,GAAQzoB,EAAImf,EAAG1jB,SAAWwE,EAAImf,EAAG3jB,SAAWuE,EAAIC,EAEhDD,EAAIC,EAAI,EAAGA,EAAI0E,EAAG1E,IAErB,GAAIkf,EAAGlf,IAAMmf,EAAGnf,GAAI,CAClBwoB,EAAOtJ,EAAGlf,GAAKmf,EAAGnf,GAClB,MAYN,GANIwoB,IAAMzuB,EAAImlB,EAAIA,EAAKC,EAAIA,EAAKplB,EAAGklB,EAAEnkB,GAAKmkB,EAAEnkB,IAE5CkF,GAAK0E,EAAIya,EAAG3jB,SAAW3C,EAAIqmB,EAAG1jB,SAItB,EAAG,KAAOwE,IAAKkf,EAAGrmB,KAAO,GAIjC,IAHAmH,EAAIwe,EAAO,EAGJ9Z,EAAI3E,GAAI,CAEb,GAAImf,IAAKxa,GAAKya,EAAGza,GAAI,CACnB,IAAK7L,EAAI6L,EAAG7L,IAAMqmB,IAAKrmB,GAAIqmB,EAAGrmB,GAAKmH,KACjCkf,EAAGrmB,GACLqmB,EAAGxa,IAAM8Z,EAGXU,EAAGxa,IAAMya,EAAGza,GAId,KAAgB,GAATwa,EAAG,GAASA,EAAGoF,OAAO,EAAG,KAAMqE,GAGtC,OAAKzJ,EAAG,GAWDqD,UAAUtD,EAAGC,EAAIyJ,IAPtB1J,EAAEnkB,EAAqB,GAAjB0lB,GAAsB,EAAI,EAChCvB,EAAE/lB,EAAI,CAAC+lB,EAAEne,EAAI,GACNme,IA8BXzf,EAAEopB,OAASppB,EAAEioB,IAAM,SAAUxI,EAAGjf,GAC9B,IAAI8lB,EAAGhrB,EACLkkB,EAAIjhB,KAKN,OAHAkhB,EAAI,IAAIpb,UAAUob,EAAGjf,IAGhBgf,EAAE9lB,IAAM+lB,EAAEnkB,GAAKmkB,EAAE/lB,IAAM+lB,EAAE/lB,EAAE,GACvB,IAAI2K,UAAU2iB,MAGXvH,EAAE/lB,GAAK8lB,EAAE9lB,IAAM8lB,EAAE9lB,EAAE,GACtB,IAAI2K,UAAUmb,IAGJ,GAAf8B,GAIFhmB,EAAImkB,EAAEnkB,EACNmkB,EAAEnkB,EAAI,EACNgrB,EAAIjG,EAAIb,EAAGC,EAAG,EAAG,GACjBA,EAAEnkB,EAAIA,EACNgrB,EAAEhrB,GAAKA,GAEPgrB,EAAIjG,EAAIb,EAAGC,EAAG,EAAG6B,IAGnB7B,EAAID,EAAEuJ,MAAMzC,EAAE4B,MAAMzI,KAGb/lB,EAAE,IAAqB,GAAf4nB,IAAkB7B,EAAEnkB,EAAIkkB,EAAElkB,GAElCmkB,IAwBTzf,EAAEqpB,aAAerpB,EAAEkoB,MAAQ,SAAUzI,EAAGjf,GACtC,IAAI9G,EAAG4H,EAAGjI,EAAG6L,EAAG1B,EAAG/J,EAAG6vB,EAAK5D,EAAKC,EAAK4D,EAAKC,EAAKC,EAAKC,EAClDlE,EACAhG,EAAIjhB,KACJmhB,EAAKF,EAAE9lB,EACPimB,GAAMF,EAAI,IAAIpb,UAAUob,EAAGjf,IAAI9G,EAGjC,KAAKgmB,GAAOC,GAAOD,EAAG,IAAOC,EAAG,IAmB9B,OAhBKH,EAAElkB,IAAMmkB,EAAEnkB,GAAKokB,IAAOA,EAAG,KAAOC,GAAMA,IAAOA,EAAG,KAAOD,EAC1DD,EAAE/lB,EAAI+lB,EAAEne,EAAIme,EAAEnkB,EAAI,MAElBmkB,EAAEnkB,GAAKkkB,EAAElkB,EAGJokB,GAAOC,GAKVF,EAAE/lB,EAAI,CAAC,GACP+lB,EAAEne,EAAI,GALNme,EAAE/lB,EAAI+lB,EAAEne,EAAI,MASTme,EAYT,IATAne,EAAI6d,SAASK,EAAEle,EA39DN,IA29DsB6d,SAASM,EAAEne,EA39DjC,IA49DTme,EAAEnkB,GAAKkkB,EAAElkB,GACTguB,EAAM5J,EAAG1jB,SACTutB,EAAM5J,EAAG3jB,UAGM0tB,EAAKhK,EAAIA,EAAKC,EAAIA,EAAK+J,EAAIrwB,EAAIiwB,EAAKA,EAAMC,EAAKA,EAAMlwB,GAG/DA,EAAIiwB,EAAMC,EAAKG,EAAK,GAAIrwB,IAAKqwB,EAAGpkB,KAAK,IAK1C,IAHAkgB,EAAOxG,EAl+DG,IAq+DL3lB,EAAIkwB,IAAOlwB,GAAK,GAAI,CAKvB,IAJAK,EAAI,EACJ8vB,EAAM7J,EAAGtmB,GAv+DD,IAw+DRowB,EAAM9J,EAAGtmB,GAx+DD,IAw+DiB,EAEX6L,EAAI7L,GAAbmK,EAAI8lB,GAAgBpkB,EAAI7L,GAK3BK,IADAgsB,EAAM8D,GAHN9D,EAAMhG,IAAKlc,GA3+DL,MA6+DN/J,EAAIgwB,EAAM/D,GADVC,EAAMjG,EAAGlc,GA5+DH,IA4+DmB,GACHgmB,GA7+DhB,QA8+D0CE,EAAGxkB,GAAKxL,GAC7C8rB,EAAO,IAAM/rB,EA/+DlB,IA++DiC,GAAKgwB,EAAM9D,EAClD+D,EAAGxkB,KAAOwgB,EAAMF,EAGlBkE,EAAGxkB,GAAKxL,EASV,OANIA,IACA4H,EAEFooB,EAAG5E,OAAO,EAAG,GAGR/B,UAAUtD,EAAGiK,EAAIpoB,IAQ1BtB,EAAE2pB,QAAU,WACV,IAAInK,EAAI,IAAInb,UAAU9F,MAEtB,OADAihB,EAAElkB,GAAKkkB,EAAElkB,GAAK,KACPkkB,GAwBTxf,EAAEipB,KAAO,SAAUxJ,EAAGjf,GACpB,IAAIjG,EACFilB,EAAIjhB,KACJgC,EAAIif,EAAElkB,EAMR,GAHAkF,GADAif,EAAI,IAAIpb,UAAUob,EAAGjf,IACflF,GAGDiF,IAAMC,EAAG,OAAO,IAAI6D,UAAU2iB,KAGlC,GAAIzmB,GAAKC,EAER,OADAif,EAAEnkB,GAAKkF,EACAgf,EAAEuJ,MAAMtJ,GAGjB,IAAIyJ,EAAK1J,EAAEle,EApjEF,GAqjEP6nB,EAAK1J,EAAEne,EArjEA,GAsjEPoe,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAET,IAAKwvB,IAAOC,EAAI,CAGd,IAAKzJ,IAAOC,EAAI,OAAO,IAAItb,UAAU9D,EAAI,GAIzC,IAAKmf,EAAG,KAAOC,EAAG,GAAI,OAAOA,EAAG,GAAKF,EAAI,IAAIpb,UAAUqb,EAAG,GAAKF,EAAQ,EAAJjf,GAQrE,GALA2oB,EAAK/J,SAAS+J,GACdC,EAAKhK,SAASgK,GACdzJ,EAAKA,EAAGva,QAGJ5E,EAAI2oB,EAAKC,EAAI,CAUf,IATI5oB,EAAI,GACN4oB,EAAKD,EACL3uB,EAAIolB,IAEJpf,GAAKA,EACLhG,EAAImlB,GAGNnlB,EAAE4qB,UACK5kB,IAAKhG,EAAE+K,KAAK,IACnB/K,EAAE4qB,UAUJ,KAPA5kB,EAAImf,EAAG1jB,SACPwE,EAAImf,EAAG3jB,QAGK,IAAGzB,EAAIolB,EAAIA,EAAKD,EAAIA,EAAKnlB,EAAGiG,EAAID,GAGvCA,EAAI,EAAGC,GACVD,GAAKmf,IAAKlf,GAAKkf,EAAGlf,GAAKmf,EAAGnf,GAAKD,GAAKye,EAAO,EAC3CU,EAAGlf,GAAKwe,IAASU,EAAGlf,GAAK,EAAIkf,EAAGlf,GAAKwe,EAUvC,OAPIze,IACFmf,EAAK,CAACnf,GAAGqD,OAAO8b,KACdyJ,GAKGpG,UAAUtD,EAAGC,EAAIyJ,IAmB1BnpB,EAAE4pB,UAAY5pB,EAAEijB,GAAK,SAAUA,EAAIP,GACjC,IAAIhpB,EAAGoB,EAAGipB,EACRvE,EAAIjhB,KAEN,GAAU,MAAN0kB,GAAcA,MAASA,EAKzB,OAJArD,SAASqD,EAAI,EAAG/D,GACN,MAANwD,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GAEdJ,MAAM,IAAIje,UAAUmb,GAAIyD,EAAIP,GAGrC,KAAMhpB,EAAI8lB,EAAE9lB,GAAI,OAAO,KAIvB,GAFAoB,EA1oES,IAyoETipB,EAAIrqB,EAAEsC,OAAS,GACI,EAEf+nB,EAAIrqB,EAAEqqB,GAAI,CAGZ,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIjpB,KAG7B,IAAKipB,EAAIrqB,EAAE,GAAIqqB,GAAK,GAAIA,GAAK,GAAIjpB,MAKnC,OAFImoB,GAAMzD,EAAEle,EAAI,EAAIxG,IAAGA,EAAI0kB,EAAEle,EAAI,GAE1BxG,GAYTkF,EAAE6pB,UAAY,SAAUrmB,GAEtB,OADAoc,SAASpc,GAnqEQ,mCAoqEVjF,KAAK2pB,MAAM,KAAO1kB,IAe3BxD,EAAE8pB,WAAa9pB,EAAE+pB,KAAO,WACtB,IAAItwB,EAAGqB,EAAGX,EAAG6vB,EAAKzvB,EAChBilB,EAAIjhB,KACJ7E,EAAI8lB,EAAE9lB,EACN4B,EAAIkkB,EAAElkB,EACNgG,EAAIke,EAAEle,EACNojB,EAAK3D,EAAiB,EACtB4G,EAAO,IAAItjB,UAAU,OAGvB,GAAU,IAAN/I,IAAY5B,IAAMA,EAAE,GACtB,OAAO,IAAI2K,WAAW/I,GAAKA,EAAI,KAAO5B,GAAKA,EAAE,IAAMstB,IAAMttB,EAAI8lB,EAAI,KA8BnE,GAtBS,IAJTlkB,EAAIuF,KAAKkpB,MAAMvK,KAIDlkB,GAAK,OACjBR,EAAIskB,cAAc1lB,IACXsC,OAASsF,GAAK,GAAK,IAAGxG,GAAK,KAClCQ,EAAIuF,KAAKkpB,KAAKjvB,GACdwG,EAAI6d,UAAU7d,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS1CnH,EAAI,IAAIkK,UANNvJ,EADEQ,GAAK,IACH,KAAOgG,GAEXxG,EAAIQ,EAAEykB,iBACA5a,MAAM,EAAGrK,EAAE4c,QAAQ,KAAO,GAAKpW,IAKvCnH,EAAI,IAAIkK,UAAU/I,EAAI,IAOpBnB,EAAET,EAAE,GAMN,KAJA4B,GADAgG,EAAInH,EAAEmH,GACEojB,GACA,IAAGppB,EAAI,KAOb,GAHAf,EAAIJ,EACJA,EAAIwtB,EAAKO,MAAM3tB,EAAE0uB,KAAK5I,EAAIb,EAAGjlB,EAAGmqB,EAAI,KAEhCtF,cAAc7kB,EAAEb,GAAKyL,MAAM,EAAG7J,MAAQR,EACvCskB,cAAcjlB,EAAET,IAAIyL,MAAM,EAAG7J,GAAI,CAWlC,GANInB,EAAEmH,EAAIA,KAAKhG,EAMN,SALTR,EAAIA,EAAEqK,MAAM7J,EAAI,EAAGA,EAAI,MAKH0uB,GAAY,QAALlvB,GAgBpB,EAICA,KAAOA,EAAEqK,MAAM,IAAqB,KAAfrK,EAAE0J,OAAO,MAGlC8d,MAAMnoB,EAAGA,EAAEmH,EAAIyf,EAAiB,EAAG,GACnCtnB,GAAKU,EAAE+tB,MAAM/tB,GAAG+O,GAAGsW,IAGrB,MAvBA,IAAKwK,IACH1H,MAAM/nB,EAAGA,EAAE+G,EAAIyf,EAAiB,EAAG,GAE/BxmB,EAAE2tB,MAAM3tB,GAAG2O,GAAGsW,IAAI,CACpBrlB,EAAII,EACJ,MAIJmqB,GAAM,EACNppB,GAAK,EACL0uB,EAAM,EAkBd,OAAO1H,MAAMnoB,EAAGA,EAAEmH,EAAIyf,EAAiB,EAAGC,EAAevnB,IAa3DuG,EAAE+f,cAAgB,SAAU2E,EAAIhC,GAK9B,OAJU,MAANgC,IACF9E,SAAS8E,EAAI,EAAGxF,GAChBwF,KAEKjC,OAAOlkB,KAAMmmB,EAAIhC,EAAI,IAgB9B1iB,EAAEiqB,QAAU,SAAUvF,EAAIhC,GAKxB,OAJU,MAANgC,IACF9E,SAAS8E,EAAI,EAAGxF,GAChBwF,EAAKA,EAAKnmB,KAAK+C,EAAI,GAEdmhB,OAAOlkB,KAAMmmB,EAAIhC,IAuB1B1iB,EAAEkqB,SAAW,SAAUxF,EAAIhC,GACzB,IAAI1C,EAAMzhB,KAAK0rB,QAAQvF,EAAIhC,GAE3B,GAAInkB,KAAK7E,EAAG,CACV,IAAIL,EACFuJ,EAAMod,EAAInb,MAAM,KAChBslB,GAAM3I,EAAOG,UACbyI,GAAM5I,EAAOI,mBACbF,EAAiBF,EAAOE,eACxB2I,EAAUznB,EAAI,GACd0nB,EAAe1nB,EAAI,GACnB2nB,EAAQhsB,KAAKjD,EAAI,EACjBkvB,EAAYD,EAAQF,EAAQllB,MAAM,GAAKklB,EACvCpmB,EAAMumB,EAAUxuB,OAIlB,GAFIouB,IAAI/wB,EAAI8wB,EAAIA,EAAKC,EAAIA,EAAK/wB,EAAG4K,GAAO5K,GAEpC8wB,EAAK,GAAKlmB,EAAM,EAAG,CAIrB,IAHA5K,EAAI4K,EAAMkmB,GAAMA,EAChBE,EAAUG,EAAUC,OAAO,EAAGpxB,GAEvBA,EAAI4K,EAAK5K,GAAK8wB,EACnBE,GAAW3I,EAAiB8I,EAAUC,OAAOpxB,EAAG8wB,GAG9CC,EAAK,IAAGC,GAAW3I,EAAiB8I,EAAUrlB,MAAM9L,IACpDkxB,IAAOF,EAAU,IAAMA,GAG7BrK,EAAMsK,EACHD,EAAU7I,EAAOC,mBAAqB2I,GAAM5I,EAAOM,mBAClDwI,EAAanI,QAAQ,IAAIrd,OAAO,OAASslB,EAAK,OAAQ,KACvD,KAAO5I,EAAOK,wBACbyI,GACDD,EAGL,OAAOrK,GAeThgB,EAAE0qB,WAAa,SAAUC,GACvB,IAAI/nB,EAAKjJ,EAAGixB,EAAIC,EAAIC,EAAIxpB,EAAGypB,EAAKjwB,EAAGkwB,EAAIC,EAAI3E,EAAGhrB,EAC5CkkB,EAAIjhB,KACJmhB,EAAKF,EAAE9lB,EAET,GAAU,MAANixB,MACF7vB,EAAI,IAAIuJ,UAAUsmB,IAGX3C,cAAgBltB,EAAEpB,GAAa,IAARoB,EAAEQ,IAAYR,EAAE0Q,GAAGsV,IAC/C,MAAMrc,MACHqa,EAAiB,aACfhkB,EAAEktB,YAAc,iBAAmB,oBAAsB2C,GAIlE,IAAKjL,EAAI,OAAOF,EAAElb,WAoBlB,IAlBA3K,EAAI,IAAI0K,UAAUyc,GAClBmK,EAAKL,EAAK,IAAIvmB,UAAUyc,GACxB+J,EAAKG,EAAK,IAAI3mB,UAAUyc,GACxBxlB,EAAI8jB,cAAcM,GAIlBpe,EAAI3H,EAAE2H,EAAIhG,EAAEU,OAASwjB,EAAEle,EAAI,EAC3B3H,EAAED,EAAE,GAAKulB,GAAU8L,EAAMzpB,EAh6EhB,IAg6EgC,EAh6EhC,GAg6E+CypB,EAAMA,GAC9DJ,GAAMA,GAAM7vB,EAAEusB,WAAW1tB,GAAK,EAAK2H,EAAI,EAAI3H,EAAIsxB,EAAMnwB,EAErDiwB,EAAM3J,EACNA,EAAU,IACVtmB,EAAI,IAAIuJ,UAAU/I,GAGlB0vB,EAAGtxB,EAAE,GAAK,EAGR4sB,EAAIjG,EAAIvlB,EAAGnB,EAAG,EAAG,GAEQ,IADzBmxB,EAAKF,EAAG3B,KAAK3C,EAAE4B,MAAM2C,KACdxD,WAAWsD,IAClBC,EAAKC,EACLA,EAAKC,EACLG,EAAKD,EAAG/B,KAAK3C,EAAE4B,MAAM4C,EAAKG,IAC1BD,EAAKF,EACLnxB,EAAImB,EAAEiuB,MAAMzC,EAAE4B,MAAM4C,EAAKnxB,IACzBmB,EAAIgwB,EAgBN,OAbAA,EAAKzK,EAAIsK,EAAG5B,MAAM6B,GAAKC,EAAI,EAAG,GAC9BG,EAAKA,EAAG/B,KAAK6B,EAAG5C,MAAM+C,IACtBL,EAAKA,EAAG3B,KAAK6B,EAAG5C,MAAM2C,IACtBG,EAAG1vB,EAAI2vB,EAAG3vB,EAAIkkB,EAAElkB,EAIhBsH,EAAMyd,EAAI4K,EAAIJ,EAHdvpB,GAAK,EAGgB0f,GAAe+H,MAAMvJ,GAAG4H,MAAMC,WAChDhH,EAAI2K,EAAIJ,EAAItpB,EAAG0f,GAAe+H,MAAMvJ,GAAG4H,OAAS,EAC7C,CAAC6D,EAAG3mB,WAAYumB,EAAGvmB,YACnB,CAAC0mB,EAAG1mB,WAAYsmB,EAAGtmB,YAEzB8c,EAAU2J,EACHnoB,GAOT5C,EAAEkrB,SAAW,WACX,OAAQ3sB,MAeVyB,EAAEmrB,YAAc,SAAUlI,EAAIP,GAE5B,OADU,MAANO,GAAYrD,SAASqD,EAAI,EAAG/D,GACzBuD,OAAOlkB,KAAM0kB,EAAIP,EAAI,IAe9B1iB,EAAEsE,SAAW,SAAU9D,GACrB,IAAIwf,EACFllB,EAAIyD,KACJjD,EAAIR,EAAEQ,EACNgG,EAAIxG,EAAEwG,EA0BR,OAvBU,OAANA,EAEEhG,GACF0kB,EAAM,WACF1kB,EAAI,IAAG0kB,EAAM,IAAMA,IAEvBA,EAAM,OAGRA,EAAMZ,cAActkB,EAAEpB,GAEb,MAAL8G,EACFwf,EAAM1e,GAAK2f,GAAc3f,GAAK4f,EAC3BnB,cAAcC,EAAK1e,GACnB2e,aAAaD,EAAK1e,EAAG,MAExBse,SAASpf,EAAG,EAAGuhB,EAAS/lB,OAAQ,QAChCgkB,EAAMM,EAAYL,aAAaD,EAAK1e,EAAG,KAAM,GAAId,EAAGlF,GAAG,IAGrDA,EAAI,GAAKR,EAAEpB,EAAE,KAAIsmB,EAAM,IAAMA,IAG5BA,GAQThgB,EAAE6J,QAAU7J,EAAEorB,OAAS,WACrB,IAAIpL,EACFllB,EAAIyD,KACJ+C,EAAIxG,EAAEwG,EAER,OAAU,OAANA,EAAmBxG,EAAEwJ,YAEzB0b,EAAMZ,cAActkB,EAAEpB,GAEtBsmB,EAAM1e,GAAK2f,GAAc3f,GAAK4f,EAC1BnB,cAAcC,EAAK1e,GACnB2e,aAAaD,EAAK1e,EAAG,KAElBxG,EAAEQ,EAAI,EAAI,IAAM0kB,EAAMA,IAI/BhgB,EAAEskB,cAAe,EAEG,MAAhBlE,GAAsB/b,UAAUwL,IAAIuQ,GAEjC/b,UAuIG8b,IACO,QAAI9b,EAAUA,UAAYA,OAIH,KAAxC,aAAqB,OAAOA,GAAY,8BA/uF3C,I,i3BCAD,YAEA,IAAIgnB,EAAe,EAAQ,KAW3B,SAAS9L,QAAQhf,EAAGC,GAClB,GAAID,IAAMC,EACR,OAAO,EAMT,IAHA,IAAIgf,EAAIjf,EAAEvE,OACNyjB,EAAIjf,EAAExE,OAED3C,EAAI,EAAG4K,EAAMpD,KAAKwS,IAAImM,EAAGC,GAAIpmB,EAAI4K,IAAO5K,EAC/C,GAAIkH,EAAElH,KAAOmH,EAAEnH,GAAI,CACjBmmB,EAAIjf,EAAElH,GACNomB,EAAIjf,EAAEnH,GACN,MAIJ,OAAImmB,EAAIC,GACE,EAENA,EAAID,EACC,EAEF,EAET,SAAS8L,SAAS9qB,GAChB,OAAIxB,EAAO2F,QAA4C,mBAA3B3F,EAAO2F,OAAO2mB,SACjCtsB,EAAO2F,OAAO2mB,SAAS9qB,KAEjB,MAALA,IAAaA,EAAE+qB,WA+B3B,IAAIC,EAAO,EAAQ,KACfC,EAAS1xB,OAAOoB,UAAUC,eAC1BswB,EAASjoB,MAAMtI,UAAUgK,MACzBwmB,EACgC,QAA3B,SAASC,QAAShyB,KAE3B,SAASiyB,UAAWrwB,GAClB,OAAOzB,OAAOoB,UAAUmJ,SAAS9K,KAAKgC,GAExC,SAASswB,OAAOC,GACd,OAAIT,SAASS,KAGqB,mBAAvB/sB,EAAOgtB,cAGgB,mBAAvBA,YAAYF,OACdE,YAAYF,OAAOC,KAEvBA,IAGDA,aAAkBE,aAGlBF,EAAOG,QAAUH,EAAOG,kBAAkBF,gBAShD,IAAIG,EAASrzB,EAAOD,QAAUuzB,GAO1BC,EAAQ,8BAEZ,SAASC,QAAQC,GACf,GAAKf,EAAK3Q,WAAW0R,GAArB,CAGA,GAAIZ,EACF,OAAOY,EAAK3yB,KAEd,IACI4yB,EADMD,EAAKjoB,WACCkoB,MAAMH,GACtB,OAAOG,GAASA,EAAM,IAyCxB,SAASC,SAASnxB,EAAGR,GACnB,MAAiB,iBAANQ,EACFA,EAAEU,OAASlB,EAAIQ,EAAIA,EAAE6J,MAAM,EAAGrK,GAE9BQ,EAGX,SAASoxB,QAAQC,GACf,GAAIhB,IAAuBH,EAAK3Q,WAAW8R,GACzC,OAAOnB,EAAKkB,QAAQC,GAEtB,IAAIC,EAAUN,QAAQK,GAEtB,MAAO,aADIC,EAAU,KAAOA,EAAU,IACT,IAmB/B,SAASC,KAAKC,EAAQC,EAAUpf,EAASqf,EAAUC,GACjD,MAAM,IAAId,EAAOe,eAAe,CAC9Bvf,QAASA,EACTmf,OAAQA,EACRC,SAAUA,EACVC,SAAUA,EACVC,mBAAoBA,IAcxB,SAASb,GAAG9xB,EAAOqT,GACZrT,GAAOuyB,KAAKvyB,GAAO,EAAMqT,EAAS,KAAMwe,EAAOC,IAoCtD,SAASe,WAAWL,EAAQC,EAAUK,EAAQC,GAE5C,GAAIP,IAAWC,EACb,OAAO,EACF,GAAIzB,SAASwB,IAAWxB,SAASyB,GACtC,OAAqC,IAA9BxN,QAAQuN,EAAQC,GAIlB,GAAIvB,EAAK8B,OAAOR,IAAWtB,EAAK8B,OAAOP,GAC5C,OAAOD,EAAOS,YAAcR,EAASQ,UAKhC,GAAI/B,EAAKgC,SAASV,IAAWtB,EAAKgC,SAAST,GAChD,OAAOD,EAAOxtB,SAAWytB,EAASztB,QAC3BwtB,EAAO9tB,SAAW+tB,EAAS/tB,QAC3B8tB,EAAOW,YAAcV,EAASU,WAC9BX,EAAOY,YAAcX,EAASW,WAC9BZ,EAAOa,aAAeZ,EAASY,WAIjC,GAAgB,OAAXb,GAAqC,iBAAXA,GACb,OAAbC,GAAyC,iBAAbA,EASjC,IAAIjB,OAAOgB,IAAWhB,OAAOiB,IACzBlB,UAAUiB,KAAYjB,UAAUkB,MAC9BD,aAAkBc,cAClBd,aAAkBe,cAC7B,OACoD,IAD7CtO,QAAQ,IAAIuO,WAAWhB,EAAOZ,QACtB,IAAI4B,WAAWf,EAASb,SAQlC,GAAIZ,SAASwB,KAAYxB,SAASyB,GACvC,OAAO,EAIP,IAAIgB,GAFJV,EAAQA,GAAS,CAACP,OAAQ,GAAIC,SAAU,KAEhBD,OAAOpV,QAAQoV,GACvC,OAAqB,IAAjBiB,GACEA,IAAgBV,EAAMN,SAASrV,QAAQqV,KAK7CM,EAAMP,OAAOxnB,KAAKwnB,GAClBO,EAAMN,SAASznB,KAAKynB,GAUxB,SAASiB,SAASztB,EAAGC,EAAG4sB,EAAQa,GAC9B,GAAI1tB,eAAiCC,EACnC,OAAO,EAET,GAAIgrB,EAAK0C,YAAY3tB,IAAMirB,EAAK0C,YAAY1tB,GAC1C,OAAOD,IAAMC,EACf,GAAI4sB,GAAUrzB,OAAO0C,eAAe8D,KAAOxG,OAAO0C,eAAe+D,GAC/D,OAAO,EACT,IAAI2tB,EAAUC,YAAY7tB,GACtB8tB,EAAUD,YAAY5tB,GAC1B,GAAK2tB,IAAYE,IAAcF,GAAWE,EACxC,OAAO,EACT,GAAIF,EAGF,OAFA5tB,EAAImrB,EAAOlyB,KAAK+G,GAChBC,EAAIkrB,EAAOlyB,KAAKgH,GACT2sB,WAAW5sB,EAAGC,EAAG4sB,GAE1B,IAEIxyB,EAAKvB,EAFLi1B,EAAKC,EAAWhuB,GAChBiuB,EAAKD,EAAW/tB,GAIpB,GAAI8tB,EAAGtyB,SAAWwyB,EAAGxyB,OACnB,OAAO,EAKT,IAHAsyB,EAAGG,OACHD,EAAGC,OAEEp1B,EAAIi1B,EAAGtyB,OAAS,EAAG3C,GAAK,EAAGA,IAC9B,GAAIi1B,EAAGj1B,KAAOm1B,EAAGn1B,GACf,OAAO,EAIX,IAAKA,EAAIi1B,EAAGtyB,OAAS,EAAG3C,GAAK,EAAGA,IAE9B,GADAuB,EAAM0zB,EAAGj1B,IACJ8zB,WAAW5sB,EAAE3F,GAAM4F,EAAE5F,GAAMwyB,EAAQa,GACtC,OAAO,EAEX,OAAO,EA/CED,CAASlB,EAAQC,EAAUK,EAAQC,IApC1C,OAAOD,EAASN,IAAWC,EAAWD,GAAUC,EAwCpD,SAASqB,YAAYnzB,GACnB,MAAiD,sBAA1ClB,OAAOoB,UAAUmJ,SAAS9K,KAAKyB,GAgFxC,SAASyzB,kBAAkB5B,EAAQC,GACjC,IAAKD,IAAWC,EACd,OAAO,EAGT,GAAgD,mBAA5ChzB,OAAOoB,UAAUmJ,SAAS9K,KAAKuzB,GACjC,OAAOA,EAAS9b,KAAK6b,GAGvB,IACE,GAAIA,aAAkBC,EACpB,OAAO,EAET,MAAOzrB,IAIT,OAAImD,MAAMkqB,cAAc5B,KAIa,IAA9BA,EAASvzB,KAAK,GAAIszB,GAa3B,SAAS8B,QAAQC,EAAaC,EAAO/B,EAAUpf,GAC7C,IAAImf,EAEJ,GAAqB,mBAAVgC,EACT,MAAM,IAAIlzB,UAAU,uCAGE,iBAAbmxB,IACTpf,EAAUof,EACVA,EAAW,MAGbD,EAtBF,SAASiC,UAAUD,GACjB,IAAI7wB,EACJ,IACE6wB,IACA,MAAOxtB,GACPrD,EAAQqD,EAEV,OAAOrD,EAeE8wB,CAAUD,GAEnBnhB,GAAWof,GAAYA,EAASnzB,KAAO,KAAOmzB,EAASnzB,KAAO,KAAO,MAC1D+T,EAAU,IAAMA,EAAU,KAEjCkhB,IAAgB/B,GAClBD,KAAKC,EAAQC,EAAU,6BAA+Bpf,GAGxD,IAAIqhB,EAAyC,iBAAZrhB,EAE7BshB,GAAyBJ,GAAe/B,IAAWC,EASvD,KAV2B8B,GAAerD,EAAK0D,QAAQpC,IAInDkC,GACAN,kBAAkB5B,EAAQC,IAC1BkC,IACFpC,KAAKC,EAAQC,EAAU,yBAA2Bpf,GAG/CkhB,GAAe/B,GAAUC,IACzB2B,kBAAkB5B,EAAQC,KAAgB8B,GAAe/B,EAC5D,MAAMA,EAvVVX,EAAOe,eAAiB,SAASA,eAAeiC,GAC9C5wB,KAAK3E,KAAO,iBACZ2E,KAAKuuB,OAASqC,EAAQrC,OACtBvuB,KAAKwuB,SAAWoC,EAAQpC,SACxBxuB,KAAKyuB,SAAWmC,EAAQnC,SACpBmC,EAAQxhB,SACVpP,KAAKoP,QAAUwhB,EAAQxhB,QACvBpP,KAAK6wB,kBAAmB,IAExB7wB,KAAKoP,QA6CT,SAAS0hB,WAAWhyB,GAClB,OAAOovB,SAASC,QAAQrvB,EAAKyvB,QAAS,KAAO,IACtCzvB,EAAK2vB,SAAW,IAChBP,SAASC,QAAQrvB,EAAK0vB,UAAW,KAhDvBsC,CAAW9wB,MAC1BA,KAAK6wB,kBAAmB,GAE1B,IAAInC,EAAqBkC,EAAQlC,oBAAsBJ,KACvD,GAAIpoB,MAAM6qB,kBACR7qB,MAAM6qB,kBAAkB/wB,KAAM0uB,OACzB,CAEL,IAAItuB,EAAM,IAAI8F,MACd,GAAI9F,EAAI4wB,MAAO,CACb,IAAI/vB,EAAMb,EAAI4wB,MAGVC,EAAUlD,QAAQW,GAClBwC,EAAMjwB,EAAIkY,QAAQ,KAAO8X,GAC7B,GAAIC,GAAO,EAAG,CAGZ,IAAIC,EAAYlwB,EAAIkY,QAAQ,KAAM+X,EAAM,GACxCjwB,EAAMA,EAAI6iB,UAAUqN,EAAY,GAGlCnxB,KAAKgxB,MAAQ/vB,KAMnBgsB,EAAKmE,SAASxD,EAAOe,eAAgBzoB,OA6CrC0nB,EAAOU,KAAOA,KAYdV,EAAOC,GAAKA,GAMZD,EAAOyD,MAAQ,SAASA,MAAM9C,EAAQC,EAAUpf,GAC1Cmf,GAAUC,GAAUF,KAAKC,EAAQC,EAAUpf,EAAS,KAAMwe,EAAOyD,QAMvEzD,EAAO0D,SAAW,SAASA,SAAS/C,EAAQC,EAAUpf,GAChDmf,GAAUC,GACZF,KAAKC,EAAQC,EAAUpf,EAAS,KAAMwe,EAAO0D,WAOjD1D,EAAO2D,UAAY,SAASA,UAAUhD,EAAQC,EAAUpf,GACjDwf,WAAWL,EAAQC,GAAU,IAChCF,KAAKC,EAAQC,EAAUpf,EAAS,YAAawe,EAAO2D,YAIxD3D,EAAO4D,gBAAkB,SAASA,gBAAgBjD,EAAQC,EAAUpf,GAC7Dwf,WAAWL,EAAQC,GAAU,IAChCF,KAAKC,EAAQC,EAAUpf,EAAS,kBAAmBwe,EAAO4D,kBAuH9D5D,EAAO6D,aAAe,SAASA,aAAalD,EAAQC,EAAUpf,GACxDwf,WAAWL,EAAQC,GAAU,IAC/BF,KAAKC,EAAQC,EAAUpf,EAAS,eAAgBwe,EAAO6D,eAI3D7D,EAAO8D,mBACP,SAASA,mBAAmBnD,EAAQC,EAAUpf,GACxCwf,WAAWL,EAAQC,GAAU,IAC/BF,KAAKC,EAAQC,EAAUpf,EAAS,qBAAsBsiB,qBAQ1D9D,EAAO+D,YAAc,SAASA,YAAYpD,EAAQC,EAAUpf,GACtDmf,IAAWC,GACbF,KAAKC,EAAQC,EAAUpf,EAAS,MAAOwe,EAAO+D,cAOlD/D,EAAOgE,eAAiB,SAASA,eAAerD,EAAQC,EAAUpf,GAC5Dmf,IAAWC,GACbF,KAAKC,EAAQC,EAAUpf,EAAS,MAAOwe,EAAOgE,iBA+ElDhE,EAAOiE,OAAS,SAAStB,EAAmB7wB,EAAmB0P,GAC7DihB,SAAQ,EAAME,EAAO7wB,EAAO0P,IAI9Bwe,EAAOkE,aAAe,SAASvB,EAAmB7wB,EAAmB0P,GACnEihB,SAAQ,EAAOE,EAAO7wB,EAAO0P,IAG/Bwe,EAAOmE,QAAU,SAAS3xB,GAAO,GAAIA,EAAK,MAAMA,GAMhDwtB,EAAOiB,OAAS/B,GAHhB,SAAS+B,OAAO9yB,EAAOqT,GAChBrT,GAAOuyB,KAAKvyB,GAAO,EAAMqT,EAAS,KAAMyf,UAEVjB,EAAQ,CAC3CyD,MAAOzD,EAAO+D,YACdJ,UAAW3D,EAAO4D,gBAClBF,SAAU1D,EAAOgE,eACjBH,aAAc7D,EAAO8D,qBAEvB9D,EAAOiB,OAAOA,OAASjB,EAAOiB,OAE9B,IAAImB,EAAax0B,OAAO4M,MAAQ,SAAUnL,GACxC,IAAImL,EAAO,GACX,IAAK,IAAI/L,KAAOY,EACViwB,EAAOjyB,KAAKgC,EAAKZ,IAAM+L,EAAKrB,KAAK1K,GAEvC,OAAO+L,K,kCCxfT,IAAI4pB,EAAW,EAAQ,KAmCvBz3B,EAAOD,QAPP,SAASua,UAAU9Y,GACjB,IAAIqR,EAAS4kB,EAASj2B,GAClBk2B,EAAY7kB,EAAS,EAEzB,OAAOA,GAAWA,EAAU6kB,EAAY7kB,EAAS6kB,EAAY7kB,EAAU,I,gBChCzE,IAAI1C,EAAa,EAAQ,IACrBQ,EAAe,EAAQ,IA2B3B3Q,EAAOD,QALP,SAAS43B,SAASn2B,GAChB,MAAuB,iBAATA,GACXmP,EAAanP,IArBF,mBAqBY2O,EAAW3O,K,gBCzBvC,IAAIF,EAAS,EAAQ,IACjB8jB,EAAW,EAAQ,IACnBzC,EAAU,EAAQ,IAClBgV,EAAW,EAAQ,KAMnBC,EAAct2B,EAASA,EAAOe,eAAYyD,EAC1C+xB,EAAiBD,EAAcA,EAAYpsB,cAAW1F,EA0B1D9F,EAAOD,QAhBP,SAAS+3B,aAAat2B,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAImhB,EAAQnhB,GAEV,OAAO4jB,EAAS5jB,EAAOs2B,cAAgB,GAEzC,GAAIH,EAASn2B,GACX,OAAOq2B,EAAiBA,EAAen3B,KAAKc,GAAS,GAEvD,IAAIqR,EAAUrR,EAAQ,GACtB,MAAkB,KAAVqR,GAAkB,EAAIrR,IA3BjB,IA2BwC,KAAOqR,I,gBCjC9D,IAAIklB,EAAY,EAAQ,KACpB9f,EAAa,EAAQ,IACrB+f,EAAc,EAAQ,KAe1Bh4B,EAAOD,QANP,SAASk4B,WAAW/f,GAClB,OAAOD,EAAWC,GACd8f,EAAY9f,GACZ6f,EAAU7f,K,gBCdD,SAASggB,eAAezwB,GAChC,OAAY,MAALA,GAA0B,iBAANA,IAAoD,IAAlCA,EAAE,4BCSvC,SAAS0wB,QAAQ3yB,GAC9B,OAAO,SAAS4yB,GAAG3wB,GACjB,OAAyB,IAArB9B,UAAUzC,QAAgBg1B,eAAezwB,GACpC2wB,GAEA5yB,EAAGI,MAAMH,KAAME,Y,qxTCM5B,IAKe,EALWwyB,SAAQ,SAASE,OAAOvnB,GAChD,OAAO,WACL,OAAOA,MCLI,EADM,GAAO,GCCb,EADM,GAAO,GCSb,GAAE,4BAA4B,GCf9B,SAASwnB,QAAQ9yB,GAC9B,OAAO,SAAS+yB,GAAG9wB,EAAGC,GACpB,OAAQ/B,UAAUzC,QAChB,KAAK,EACH,OAAOq1B,GACT,KAAK,EACH,OAAOL,eAAezwB,GAAK8wB,GAAKJ,SAAQ,SAAUK,GAChD,OAAOhzB,EAAGiC,EAAG+wB,MAEjB,QACE,OAAON,eAAezwB,IAAMywB,eAAexwB,GAAK6wB,GAAKL,eAAezwB,GAAK0wB,SAAQ,SAAUM,GACzF,OAAOjzB,EAAGizB,EAAI/wB,MACXwwB,eAAexwB,GAAKywB,SAAQ,SAAUK,GACzC,OAAOhzB,EAAGiC,EAAG+wB,MACVhzB,EAAGiC,EAAGC,KCNnB,IAGe,EAHQ4wB,SAAQ,SAASI,IAAIjxB,EAAGC,GAC7C,OAAOixB,OAAOlxB,GAAKkxB,OAAOjxB,MCTb,SAASkxB,QAAQC,EAAMC,GAGpC,IAAInC,EADJmC,EAAOA,GAAQ,GAEf,IAAIC,GAHJF,EAAOA,GAAQ,IAGC31B,OACZ81B,EAAOF,EAAK51B,OACZ2P,EAAS,GAGb,IADA8jB,EAAM,EACCA,EAAMoC,GACXlmB,EAAOA,EAAO3P,QAAU21B,EAAKlC,GAC7BA,GAAO,EAGT,IADAA,EAAM,EACCA,EAAMqC,GACXnmB,EAAOA,EAAO3P,QAAU41B,EAAKnC,GAC7BA,GAAO,EAET,OAAO9jB,EC7BM,SAASomB,OAAOj3B,EAAGwD,GAEhC,OAAQxD,GACN,KAAK,EACH,OAAO,WACL,OAAOwD,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,GACf,OAAO1zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,GACnB,OAAO3zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,GACvB,OAAO5zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,GAC3B,OAAO7zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,GAC/B,OAAO9zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACnC,OAAO/zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACvC,OAAOh0B,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC3C,OAAOj0B,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC/C,OAAOl0B,EAAGI,MAAMH,KAAME,YAE1B,KAAK,GACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACnD,OAAOn0B,EAAGI,MAAMH,KAAME,YAE1B,QACE,MAAM,IAAIgG,MAAM,gFCnCP,SAASiuB,QAAQ12B,EAAQ22B,EAAUr0B,GAChD,OAAO,WAKL,IAJA,IAAIs0B,EAAW,GACXC,EAAU,EACVC,EAAO92B,EACP+2B,EAAc,EACXA,EAAcJ,EAAS32B,QAAU62B,EAAUp0B,UAAUzC,QAAQ,CAClE,IAAI2P,EACAonB,EAAcJ,EAAS32B,UAAYg1B,eAAe2B,EAASI,KAAiBF,GAAWp0B,UAAUzC,QACnG2P,EAASgnB,EAASI,IAElBpnB,EAASlN,UAAUo0B,GACnBA,GAAW,GAEbD,EAASG,GAAepnB,EACnBqlB,eAAerlB,KAClBmnB,GAAQ,GAEVC,GAAe,EAEjB,OAAOD,GAAQ,EAAIx0B,EAAGI,MAAMH,KAAMq0B,GAAYb,OAAOe,EAAMJ,QAAQ12B,EAAQ42B,EAAUt0B,KCczF,IAMe,EANW8yB,SAAQ,SAAS4B,OAAOh3B,EAAQsC,GACxD,OAAe,IAAXtC,EACKi1B,QAAQ3yB,GAEVyzB,OAAO/1B,EAAQ02B,QAAQ12B,EAAQ,GAAIsC,OCT7B,EAda2yB,SAAQ,SAASgC,SAAS30B,GACpD,OAAO,EAAOA,EAAGtC,QAAQ,WACvB,IAAIyzB,EAAM,EACNyD,EAASz0B,UAAU,GACnB00B,EAAO10B,UAAUA,UAAUzC,OAAS,GACpCwC,EAAOiF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,GAMjD,OALAD,EAAK,GAAK,WACR,IAAImN,EAASunB,EAAOx0B,MAAMH,KAAMmzB,QAAQjzB,UAAW,CAACgxB,EAAK0D,KAEzD,OADA1D,GAAO,EACA9jB,GAEFrN,EAAGI,MAAMH,KAAMC,SC3BX,SAAS40B,QAAQ90B,GAC9B,OAAO,SAAS+0B,GAAG9yB,EAAGC,EAAG9G,GACvB,OAAQ+E,UAAUzC,QAChB,KAAK,EACH,OAAOq3B,GACT,KAAK,EACH,OAAOrC,eAAezwB,GAAK8yB,GAAKjC,SAAQ,SAAUE,EAAIgC,GACpD,OAAOh1B,EAAGiC,EAAG+wB,EAAIgC,MAErB,KAAK,EACH,OAAOtC,eAAezwB,IAAMywB,eAAexwB,GAAK6yB,GAAKrC,eAAezwB,GAAK6wB,SAAQ,SAAUG,EAAI+B,GAC7F,OAAOh1B,EAAGizB,EAAI/wB,EAAG8yB,MACdtC,eAAexwB,GAAK4wB,SAAQ,SAAUE,EAAIgC,GAC7C,OAAOh1B,EAAGiC,EAAG+wB,EAAIgC,MACdrC,SAAQ,SAAUqC,GACrB,OAAOh1B,EAAGiC,EAAGC,EAAG8yB,MAEpB,QACE,OAAOtC,eAAezwB,IAAMywB,eAAexwB,IAAMwwB,eAAet3B,GAAK25B,GAAKrC,eAAezwB,IAAMywB,eAAexwB,GAAK4wB,SAAQ,SAAUG,EAAID,GACvI,OAAOhzB,EAAGizB,EAAID,EAAI53B,MACfs3B,eAAezwB,IAAMywB,eAAet3B,GAAK03B,SAAQ,SAAUG,EAAI+B,GAClE,OAAOh1B,EAAGizB,EAAI/wB,EAAG8yB,MACdtC,eAAexwB,IAAMwwB,eAAet3B,GAAK03B,SAAQ,SAAUE,EAAIgC,GAClE,OAAOh1B,EAAGiC,EAAG+wB,EAAIgC,MACdtC,eAAezwB,GAAK0wB,SAAQ,SAAUM,GACzC,OAAOjzB,EAAGizB,EAAI/wB,EAAG9G,MACds3B,eAAexwB,GAAKywB,SAAQ,SAAUK,GACzC,OAAOhzB,EAAGiC,EAAG+wB,EAAI53B,MACds3B,eAAet3B,GAAKu3B,SAAQ,SAAUqC,GACzC,OAAOh1B,EAAGiC,EAAGC,EAAG8yB,MACbh1B,EAAGiC,EAAGC,EAAG9G,KCdtB,IAUe,EAVW05B,SAAQ,SAASG,OAAOj1B,EAAImxB,EAAK0D,GACzD,GAAI1D,GAAO0D,EAAKn3B,QAAUyzB,GAAO0D,EAAKn3B,OACpC,OAAOm3B,EAET,IACIK,GADQ/D,EAAM,EAAI0D,EAAKn3B,OAAS,GACjByzB,EACfgE,EAAQ/B,QAAQyB,GAEpB,OADAM,EAAMD,GAAQl1B,EAAG60B,EAAKK,IACfC,KCxBM,EAAAhwB,MAAA,8BACb,OAAc,MAAPmG,GAAeA,EAAI5N,QAAU,GAA6C,mBAAxCjC,OAAOoB,UAAUmJ,SAAS9K,KAAKoQ,ICb3D,SAAS8pB,eAAel4B,GACrC,MAA2C,mBAA7BA,EAAI,qBCgBL,SAASm4B,cAAcC,EAAaC,EAAIv1B,GACrD,OAAO,WACL,GAAyB,IAArBG,UAAUzC,OACZ,OAAOsC,IAET,IAAIE,EAAOiF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,GAC7CjD,EAAMgD,EAAKwkB,MACf,IAAK8Q,EAASt4B,GAAM,CAElB,IADA,IAAIi0B,EAAM,EACHA,EAAMmE,EAAY53B,QAAQ,CAC/B,GAAqC,mBAA1BR,EAAIo4B,EAAYnE,IACzB,OAAOj0B,EAAIo4B,EAAYnE,IAAM/wB,MAAMlD,EAAKgD,GAE1CixB,GAAO,EAET,GAAIiE,eAAel4B,GAAM,CACvB,IAAIu4B,EAAaF,EAAGn1B,MAAM,KAAMF,GAChC,OAAOu1B,EAAWv4B,IAGtB,OAAO8C,EAAGI,MAAMH,KAAME,YCrCX,SAASu1B,SAASxU,GAC/B,OAAOA,GAAKA,EAAE,wBAA0BA,EAAI,CAC1C,qBAAsBA,EACtB,wBAAwB,GCHb,OACbjR,KAAM,WACJ,OAAOhQ,KAAKs1B,GAAG,wBAEjBloB,OAAQ,SAAUA,GAChB,OAAOpN,KAAKs1B,GAAG,uBAAuBloB,KCDtC,EAAoB,WACtB,SAASsoB,KAAK9yB,EAAG0yB,GACft1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EACT5C,KAAK4P,KAAM,EAiBb,OAfA8lB,KAAK94B,UAAU,qBAAuB+4B,EAAQ3lB,KAC9C0lB,KAAK94B,UAAU,uBAAyB,SAAUwQ,GAIhD,OAHIpN,KAAK4P,MACPxC,EAASpN,KAAKs1B,GAAG,qBAAqBloB,GAAQ,IAEzCpN,KAAKs1B,GAAG,uBAAuBloB,IAExCsoB,KAAK94B,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAKtD,OAJK51B,KAAK4C,EAAEgzB,KACV51B,KAAK4P,KAAM,EACXxC,EAASqoB,SAASz1B,KAAKs1B,GAAG,qBAAqBloB,GAAQ,KAElDA,GAGFsoB,KArBe,GCkCT,EAVQ7C,QAAsBuC,cAAc,CAAC,ODAnCvC,SAAQ,SAASgD,MAAMjzB,EAAG0yB,GACjD,OAAO,IAAI,EAAK1yB,EAAG0yB,OCDsD,SAAS1lB,IAAI7P,EAAI60B,GAE1F,IADA,IAAI1D,EAAM,EACHA,EAAM0D,EAAKn3B,QAAQ,CACxB,IAAKsC,EAAG60B,EAAK1D,IACX,OAAO,EAETA,GAAO,EAET,OAAO,MCdM,EAHQ2B,SAAQ,SAASvR,IAAItf,EAAGC,GAC7C,OAAOA,EAAID,EAAIC,EAAID,KCpBN,SAAS8zB,KAAK/1B,EAAIg2B,GAI/B,IAHA,IAAI7E,EAAM,EACNxrB,EAAMqwB,EAAQt4B,OACd2P,EAASlI,MAAMQ,GACZwrB,EAAMxrB,GACX0H,EAAO8jB,GAAOnxB,EAAGg2B,EAAQ7E,IACzBA,GAAO,EAET,OAAO9jB,ECRM,SAAS4oB,UAAU/U,GAChC,MAA6C,oBAAtCzlB,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,GCoBxC,IAwBe,EAxBiByR,SAAQ,SAASuD,YAAYhV,GAC3D,QAAIsU,EAAStU,MAGRA,IAGY,iBAANA,KAGP+U,UAAU/U,KAGK,IAAfA,EAAEiV,WACKjV,EAAExjB,OAEI,IAAbwjB,EAAExjB,QAGFwjB,EAAExjB,OAAS,IACNwjB,EAAEpkB,eAAe,IAAMokB,EAAEpkB,eAAeokB,EAAExjB,OAAS,UCzC1D04B,EAAqB,WACvB,SAASA,MAAMp2B,GACbC,KAAK4C,EAAI7C,EAYX,OAVAo2B,MAAMv5B,UAAU,qBAAuB,WACrC,MAAM,IAAIsJ,MAAM,kCAElBiwB,MAAMv5B,UAAU,uBAAyB,SAAUw5B,GACjD,OAAOA,GAETD,MAAMv5B,UAAU,qBAAuB,SAAUw5B,EAAKnV,GACpD,OAAOjhB,KAAK4C,EAAEwzB,EAAKnV,IAGdkV,MAdgB,GAiBV,SAASE,OAAOt2B,GAC7B,OAAO,IAAIo2B,EAAMp2B,GCOnB,IAKe,EALS8yB,SAAQ,SAASv2B,KAAKyD,EAAIu2B,GAChD,OAAO9C,OAAOzzB,EAAGtC,QAAQ,WACvB,OAAOsC,EAAGI,MAAMm2B,EAASp2B,iBCT7B,SAASq2B,gBAAgBjB,EAAIc,EAAKI,GAEhC,IADA,IAAIlZ,EAAOkZ,EAAK1gB,QACRwH,EAAK3d,MAAM,CAEjB,IADAy2B,EAAMd,EAAG,qBAAqBc,EAAK9Y,EAAKvhB,SAC7Bq6B,EAAI,wBAAyB,CACtCA,EAAMA,EAAI,sBACV,MAEF9Y,EAAOkZ,EAAK1gB,OAEd,OAAOwf,EAAG,uBAAuBc,GAGnC,SAASK,cAAcnB,EAAIc,EAAKn5B,EAAKy5B,GACnC,OAAOpB,EAAG,uBAAuBr4B,EAAIy5B,GAAY,EAAKpB,EAAG,qBAAsBA,GAAKc,IAGtF,IAAIO,EAAgC,oBAAX96B,OAAyBA,OAAOmH,SAAW,aAErD,SAAS4zB,QAAQ72B,EAAIq2B,EAAKxB,GAIvC,GAHkB,mBAAP70B,IACTA,EAAKs2B,OAAOt2B,IAEV,EAAa60B,GACf,OAtCJ,SAASiC,aAAavB,EAAIc,EAAKxB,GAG7B,IAFA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACRyzB,EAAMxrB,GAAK,CAEhB,IADA0wB,EAAMd,EAAG,qBAAqBc,EAAKxB,EAAK1D,MAC7BkF,EAAI,wBAAyB,CACtCA,EAAMA,EAAI,sBACV,MAEFlF,GAAO,EAET,OAAOoE,EAAG,uBAAuBc,GA2BxBS,CAAa92B,EAAIq2B,EAAKxB,GAE/B,GAA2C,mBAAhCA,EAAK,uBACd,OAAO6B,cAAc12B,EAAIq2B,EAAKxB,EAAM,uBAEtC,GAAyB,MAArBA,EAAK+B,GACP,OAAOJ,gBAAgBx2B,EAAIq2B,EAAKxB,EAAK+B,MAEvC,GAAyB,mBAAd/B,EAAK9e,KACd,OAAOygB,gBAAgBx2B,EAAIq2B,EAAKxB,GAElC,GAA2B,mBAAhBA,EAAKkC,OACd,OAAOL,cAAc12B,EAAIq2B,EAAKxB,EAAM,UAGtC,MAAM,IAAIv3B,UAAU,0CCtDtB,IAAI,EAAoB,WACtB,SAAS05B,KAAKn0B,EAAG0yB,GACft1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EAQX,OANAm0B,KAAKn6B,UAAU,qBAAuB+4B,EAAQ3lB,KAC9C+mB,KAAKn6B,UAAU,uBAAyB+4B,EAAQvoB,OAChD2pB,KAAKn6B,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GACtD,OAAO51B,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAK4C,EAAEgzB,KAG9CmB,KAXe,GAiBT,EAHUlE,SAAQ,SAASmE,MAAMp0B,EAAG0yB,GACjD,OAAO,IAAI,EAAK1yB,EAAG0yB,MClBN,SAAS2B,KAAKC,EAAMj6B,GACjC,OAAOzB,OAAOoB,UAAUC,eAAe5B,KAAKgC,EAAKi6B,GCCnD,IAAI,EAAW17B,OAAOoB,UAAUmJ,SASjB,qBARI,WACjB,MAAoC,uBAA7B,EAAS9K,KAAKiF,WAAsC,SAASi3B,aAAalW,GAC/E,MAA4B,uBAArB,EAAShmB,KAAKgmB,IACnB,SAASkW,aAAalW,GACxB,OAAOgW,KAAK,SAAUhW,KCFtBmW,GAA4B,CAAErxB,SAAU,MAAOwC,qBAAqB,YACpE8uB,EAAqB,CAAC,cAAe,UAAW,gBAAiB,WAAY,uBAAwB,iBAAkB,kBAEvHC,EAA8B,WAGhC,OAAOp3B,UAAUqI,qBAAqB,UAHN,GAM9BgvB,EAAW,SAASA,SAAS3C,EAAM4C,GAErC,IADA,IAAItG,EAAM,EACHA,EAAM0D,EAAKn3B,QAAQ,CACxB,GAAIm3B,EAAK1D,KAASsG,EAChB,OAAO,EAETtG,GAAO,EAET,OAAO,GAgDM,EADSwB,QA1BW,mBAAhBl3B,OAAO4M,MAAwBkvB,EAE9C,SAASlvB,KAAKnL,GAChB,GAAIzB,OAAOyB,KAASA,EAClB,MAAO,GAET,IAAIi6B,EAAMO,EACNC,EAAK,GACLC,EAAkBL,GAAkB,qBAAar6B,GACrD,IAAKi6B,KAAQj6B,GACPg6B,KAAKC,EAAMj6B,IAAU06B,GAA4B,WAATT,IAC1CQ,EAAGA,EAAGj6B,QAAUy5B,GAGpB,GAAIE,EAEF,IADAK,EAAOJ,EAAmB55B,OAAS,EAC5Bg6B,GAAQ,GAETR,KADJC,EAAOG,EAAmBI,GACXx6B,KAASs6B,EAASG,EAAIR,KACnCQ,EAAGA,EAAGj6B,QAAUy5B,GAElBO,GAAQ,EAGZ,OAAOC,GAxB0D,SAAStvB,KAAKnL,GAC/E,OAAOzB,OAAOyB,KAASA,EAAM,GAAKzB,OAAO4M,KAAKnL,KCcjC,EAfQ41B,QAAsBuC,cAAc,CAAC,mBAAoB,OAAQ,GAAO,SAAShwB,IAAIrF,EAAIg2B,GAC9G,OAAQv6B,OAAOoB,UAAUmJ,SAAS9K,KAAK86B,IACrC,IAAK,oBACH,OAAO,EAAOA,EAAQt4B,QAAQ,WAC5B,OAAOsC,EAAG9E,KAAK+E,KAAM+1B,EAAQ51B,MAAMH,KAAME,eAE7C,IAAK,kBACH,OAAO02B,SAAQ,SAAUR,EAAK/5B,GAE5B,OADA+5B,EAAI/5B,GAAO0D,EAAGg2B,EAAQ15B,IACf+5B,IACN,GAAI,EAAKL,IACd,QACE,OAAOD,KAAK/1B,EAAIg2B,QCvBP,EAZSlD,SAAQ,SAAS+E,KAAK5X,EAAO/iB,GAGnD,IAFA,IAAIoO,EAAMpO,EACNi0B,EAAM,EACHA,EAAMlR,EAAMviB,QAAQ,CACzB,GAAW,MAAP4N,EACF,OAEFA,EAAMA,EAAI2U,EAAMkR,IAChBA,GAAO,EAET,OAAO7lB,KCLM,EAHSwnB,SAAQ,SAASqE,KAAKp6B,EAAGG,GAC/C,OAAO,EAAK,CAACH,GAAIG,MCSJ,EAHU41B,SAAQ,SAASgF,MAAM/6B,EAAG83B,GACjD,OAAO,EAAI,EAAK93B,GAAI83B,MCoBP,EADWC,QAAQ+B,SCLnB,EAbYlE,SAAQ,SAASoF,QAAQC,GAClD,OAAO,EAAO,EAAO,EAAK,EAAG,EAAM,SAAUA,KAAS,WAGpD,IAFA,IAAI7G,EAAM,EACNxrB,EAAMqyB,EAAMt6B,OACTyzB,EAAMxrB,GAAK,CAChB,IAAKqyB,EAAM7G,GAAK/wB,MAAMH,KAAME,WAC1B,OAAO,EAETgxB,GAAO,EAET,OAAO,QCjBI,EAHQ2B,SAAQ,SAASmF,IAAIh2B,EAAGC,GAC7C,OAAOD,GAAKC,KClBV,EAAoB,WACtB,SAASg2B,KAAKr1B,EAAG0yB,GACft1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EACT5C,KAAKk4B,KAAM,EAiBb,OAfAD,KAAKr7B,UAAU,qBAAuB+4B,EAAQ3lB,KAC9CioB,KAAKr7B,UAAU,uBAAyB,SAAUwQ,GAIhD,OAHKpN,KAAKk4B,MACR9qB,EAASpN,KAAKs1B,GAAG,qBAAqBloB,GAAQ,IAEzCpN,KAAKs1B,GAAG,uBAAuBloB,IAExC6qB,KAAKr7B,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAKtD,OAJI51B,KAAK4C,EAAEgzB,KACT51B,KAAKk4B,KAAM,EACX9qB,EAASqoB,SAASz1B,KAAKs1B,GAAG,qBAAqBloB,GAAQ,KAElDA,GAGF6qB,KArBe,GA2BT,EAHUpF,SAAQ,SAASsF,MAAMv1B,EAAG0yB,GACjD,OAAO,IAAI,EAAK1yB,EAAG0yB,MCUN,EAVQzC,QAAsBuC,cAAc,CAAC,OAAQ,GAAO,SAAS8C,IAAIn4B,EAAI60B,GAE1F,IADA,IAAI1D,EAAM,EACHA,EAAM0D,EAAKn3B,QAAQ,CACxB,GAAIsC,EAAG60B,EAAK1D,IACV,OAAO,EAETA,GAAO,EAET,OAAO,MCQM,EAbYwB,SAAQ,SAAS0F,QAAQL,GAClD,OAAO,EAAO,EAAO,EAAK,EAAG,EAAM,SAAUA,KAAS,WAGpD,IAFA,IAAI7G,EAAM,EACNxrB,EAAMqyB,EAAMt6B,OACTyzB,EAAMxrB,GAAK,CAChB,GAAIqyB,EAAM7G,GAAK/wB,MAAMH,KAAME,WACzB,OAAO,EAETgxB,GAAO,EAET,OAAO,QCFI,EATO2B,SAAQ,SAASwF,GAAGC,EAAQC,GAChD,MAA4C,mBAA9BA,EAAO,mBAAoCA,EAAO,mBAAmBD,GAA+B,mBAAdA,EAAOD,GAAoBC,EAAOD,GAAGE,GAA4B,mBAAXD,EAAwB,SAAUrX,GAC1L,OAAOqX,EAAOrX,EAAPqX,CAAUC,EAAOtX,KAG1B2V,SAAQ,SAAUR,EAAKxzB,GACrB,OAAOuwB,QAAQiD,EAAK,EAAIxzB,EAAG21B,MAC1B,GAAID,MCtCM,SAASE,UAAUj8B,EAAGq4B,GAInC,IAHA,IAAI1D,EAAM,EACNuH,EAAQ7D,EAAKn3B,QAAUlB,EAAI,GAC3B65B,EAAM,IAAIlxB,MAAMuzB,GAAS,EAAIA,EAAQ,GAClCvH,EAAMuH,GACXrC,EAAIlF,GAAOhsB,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM1D,EAAKA,EAAM30B,GACvD20B,GAAO,EAET,OAAOkF,ECJT,IAAI,EAAyB,WAC3B,SAASsC,UAAUn8B,EAAG+4B,GACpBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK24B,IAAM,EACX34B,KAAK44B,MAAO,EACZ54B,KAAKo2B,IAAM,IAAIlxB,MAAM3I,GAuBvB,OArBAm8B,UAAU97B,UAAU,qBAAuB+4B,EAAQ3lB,KACnD0oB,UAAU97B,UAAU,uBAAyB,SAAUwQ,GAErD,OADApN,KAAKo2B,IAAM,KACJp2B,KAAKs1B,GAAG,uBAAuBloB,IAExCsrB,UAAU97B,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAE3D,OADA51B,KAAKjB,MAAM62B,GACJ51B,KAAK44B,KAAO54B,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAK64B,WAAazrB,GAE5EsrB,UAAU97B,UAAUmC,MAAQ,SAAU62B,GACpC51B,KAAKo2B,IAAIp2B,KAAK24B,KAAO/C,EACrB51B,KAAK24B,KAAO,EACR34B,KAAK24B,MAAQ34B,KAAKo2B,IAAI34B,SACxBuC,KAAK24B,IAAM,EACX34B,KAAK44B,MAAO,IAGhBF,UAAU97B,UAAUi8B,QAAU,WAC5B,OAAO1F,QAAQjuB,MAAMtI,UAAUgK,MAAM3L,KAAK+E,KAAKo2B,IAAKp2B,KAAK24B,KAAMzzB,MAAMtI,UAAUgK,MAAM3L,KAAK+E,KAAKo2B,IAAK,EAAGp2B,KAAK24B,OAGvGD,UA5BoB,GCuBd,EADa7F,QAAsBuC,cAAc,GDSlCvC,SAAQ,SAASiG,WAAWv8B,EAAG+4B,GAC3D,OAAO,IAAI,EAAU/4B,EAAG+4B,MCVsDkD,YCAjE,EAHW3F,SAAQ,SAASkG,OAAOC,EAAIpE,GACpD,OAAOzB,QAAQyB,EAAM,CAACoE,OCCT,EAHUnG,SAAQ,SAAS1yB,MAAMJ,EAAIE,GAClD,OAAOF,EAAGI,MAAMH,KAAMC,MCQT,EAXWyyB,SAAQ,SAASnc,OAAOtZ,GAKhD,IAJA,IAAIO,EAAQ,EAAKP,GACbyI,EAAMlI,EAAMC,OACZw7B,EAAO,GACP/H,EAAM,EACHA,EAAMxrB,GACXuzB,EAAK/H,GAAOj0B,EAAIO,EAAM0zB,IACtBA,GAAO,EAET,OAAO+H,KCgBM,EAXcvG,SAAQ,SAASwG,UAAUC,GAItD,OAHAA,EAAO,GAAI,SAAU3T,GACnB,MAAmB,mBAALA,EAAkBA,EAAI0T,UAAU1T,KAC7C2T,GACI,EAAO,EAAO,EAAK,EAAG,EAAM,SAAU,EAAOA,MAAS,WAC3D,IAAIl5B,EAAOC,UACX,OAAO,GAAI,SAAU0C,GACnB,OAAO,EAAMA,EAAG3C,KACfk5B,SClBQ,EAHYtG,SAAQ,SAASuG,QAAQnY,EAAGre,GACrD,OAAOA,EAAEqe,MCOI,EALW4T,SAAQ,SAASwE,OAAOt5B,EAAIiC,EAAGC,GACvD,IAAIq3B,EAAKv5B,EAAGiC,GACRu3B,EAAKx5B,EAAGkC,GACZ,OAAOq3B,EAAKC,GAAM,EAAID,EAAKC,EAAK,EAAI,KCGvB,GARU1E,SAAQ,SAAS2E,MAAMtC,EAAM7rB,EAAKpO,GACzD,IAAImQ,EAAS,GACb,IAAK,IAAItQ,KAAKG,EACZmQ,EAAOtQ,GAAKG,EAAIH,GAGlB,OADAsQ,EAAO8pB,GAAQ7rB,EACR+B,KCpBM,GAAA8lB,OAAA,kCACb,OAAO32B,GAAK,IAAMA,GCaL,GAHUm2B,SAAQ,SAAS+G,MAAMxY,GAC9C,OAAY,MAALA,KC4BM,GAjBc4T,SAAQ,SAAS6E,UAAU9B,EAAMvsB,EAAKpO,GACjE,GAAoB,IAAhB26B,EAAKn6B,OACP,OAAO4N,EAET,IAAI6lB,EAAM0G,EAAK,GACf,GAAIA,EAAKn6B,OAAS,EAAG,CACnB,IAAIk8B,GAAW,GAAM18B,IAAQg6B,KAAK/F,EAAKj0B,GAAOA,EAAIi0B,GAAO0I,GAAWhC,EAAK,IAAM,GAAK,GACpFvsB,EAAMquB,UAAUx0B,MAAMtI,UAAUgK,MAAM3L,KAAK28B,EAAM,GAAIvsB,EAAKsuB,GAE5D,GAAIC,GAAW1I,IAAQqE,EAASt4B,GAAM,CACpC,IAAIoH,EAAM,GAAGgB,OAAOpI,GAEpB,OADAoH,EAAI6sB,GAAO7lB,EACJhH,EAEP,OAAO,GAAM6sB,EAAK7lB,EAAKpO,MCqCZ,GAlDS41B,SAAQ,SAASgH,KAAKt9B,EAAGwD,GAC/C,OAAQxD,GACN,KAAK,EACH,OAAO,WACL,OAAOwD,EAAG9E,KAAK+E,OAEnB,KAAK,EACH,OAAO,SAAUyzB,GACf,OAAO1zB,EAAG9E,KAAK+E,KAAMyzB,IAEzB,KAAK,EACH,OAAO,SAAUA,EAAIC,GACnB,OAAO3zB,EAAG9E,KAAK+E,KAAMyzB,EAAIC,IAE7B,KAAK,EACH,OAAO,SAAUD,EAAIC,EAAIC,GACvB,OAAO5zB,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,IAEjC,KAAK,EACH,OAAO,SAAUF,EAAIC,EAAIC,EAAIC,GAC3B,OAAO7zB,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,IAErC,KAAK,EACH,OAAO,SAAUH,EAAIC,EAAIC,EAAIC,EAAIC,GAC/B,OAAO9zB,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,IAEzC,KAAK,EACH,OAAO,SAAUJ,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACnC,OAAO/zB,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAE7C,KAAK,EACH,OAAO,SAAUL,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACvC,OAAOh0B,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAEjD,KAAK,EACH,OAAO,SAAUN,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC3C,OAAOj0B,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAErD,KAAK,EACH,OAAO,SAAUP,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC/C,OAAOl0B,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAEzD,KAAK,GACH,OAAO,SAAUR,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACnD,OAAOn0B,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAE7D,QACE,MAAM,IAAIhuB,MAAM,iFC7CP,GAHWwsB,SAAQ,SAASoH,OAAO/5B,GAChD,OAAO,GAAK,EAAGA,MChCF,SAASg6B,YAAY9Y,GAClC,MAA6C,sBAAtCzlB,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,GCsBxC,IAMe,GANU4R,SAAQ,SAASmH,MAAMC,EAAOl6B,GACrD,IAAIm6B,EAAS,EAAOD,EAAOl6B,GAC3B,OAAO,EAAOk6B,GAAO,WACnB,OAAOrD,QAAQ,EAAI,EAAIsD,EAAQh6B,UAAU,IAAKgF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,UCEzE,GAHSwyB,SAAQ,SAASyH,KAAKp6B,GAC5C,OAAO,GAAMA,EAAGtC,OAAQsC,MCYX,GALS8yB,SAAQ,SAASuH,KAAKx3B,EAAGsP,GAC/C,OAAO6nB,YAAYn3B,GAAK,SAASy3B,QAC/B,OAAOz3B,EAAEzC,MAAMH,KAAME,YAAcgS,EAAE/R,MAAMH,KAAME,YAC/C,GAAK,EAAL,CAAU0C,EAAGsP,MCWJ,GAHUwgB,SAAQ,SAAS4H,MAAMv6B,GAC9C,OAAO,EAAOA,EAAGtC,OAAQsC,MCRZ,GAHS,IAAM,SAAS9E,KAAK8E,GAC1C,OAAOA,EAAGI,MAAMH,KAAMkF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,OC3B/C,SAASq6B,UAAUC,GAChC,OAAO,SAASC,MAAM7F,GAMpB,IALA,IAAI74B,EAAO2+B,EAAM/zB,EACbyG,EAAS,GACT8jB,EAAM,EACNyJ,EAAO/F,EAAKn3B,OAETyzB,EAAMyJ,GAAM,CACjB,GAAI,EAAa/F,EAAK1D,IAIpB,IAFAvqB,EAAI,EACJ+zB,GAFA3+B,EAAQy+B,EAAYC,MAAM7F,EAAK1D,IAAQ0D,EAAK1D,IAE/BzzB,OACNkJ,EAAI+zB,GACTttB,EAAOA,EAAO3P,QAAU1B,EAAM4K,GAC9BA,GAAK,OAGPyG,EAAOA,EAAO3P,QAAUm3B,EAAK1D,GAE/BA,GAAO,EAET,OAAO9jB,GCxBX,IA0Be,GAbA,SAASwtB,MAAMtF,GAC5B,IAAIuF,EAdkB,SAAUvF,GAChC,MAAO,CACL,oBAAqBK,EAAQ3lB,KAC7B,sBAAuB,SAAU5C,GAC/B,OAAOkoB,EAAG,uBAAuBloB,IAEnC,oBAAqB,SAAUA,EAAQwoB,GACrC,IAAIkF,EAAMxF,EAAG,qBAAqBloB,EAAQwoB,GAC1C,OAAOkF,EAAI,wBCbF,SAASC,cAAc9Z,GACpC,MAAO,CACL,qBAAsBA,EACtB,wBAAwB,GDUe8Z,CAAcD,GAAOA,IAMpDE,CAAkB1F,GAC5B,MAAO,CACL,oBAAqBK,EAAQ3lB,KAC7B,sBAAuB,SAAU5C,GAC/B,OAAOytB,EAAI,uBAAuBztB,IAEpC,oBAAqB,SAAUA,EAAQwoB,GACrC,OAAQ,EAAaA,GAAyCgB,QAAQiE,EAAKztB,EAAQwoB,GAArDgB,QAAQiE,EAAKztB,EAAQ,CAACwoB,OEU3C,GARU/C,QAAsBuC,cAAc,CAAC,qBAAsB,SCxBzDvC,SAAQ,SAASoI,QAAQr4B,EAAG0yB,GACrD,OAAO,EAAI1yB,EAAG,GAAS0yB,QDuB8E,SAAS4F,MAAMn7B,EAAIo7B,GACxH,MAAqB,mBAAVA,EACF,SAAUla,GACf,OAAOlhB,EAAGo7B,EAAMla,GAATlhB,CAAakhB,IAGjBsZ,WAAU,EAAVA,CAAiB,EAAIx6B,EAAIo7B,QENnB,GANUtG,SAAQ,SAASuG,MAAMtmB,EAAKwM,EAAKvlB,GACxD,GAAI+Y,EAAMwM,EACR,MAAM,IAAIpb,MAAM,8DAElB,OAAOnK,EAAQ+Y,EAAMA,EAAM/Y,EAAQulB,EAAMA,EAAMvlB,KC1BlC,SAASs/B,aAAaC,GACH,OAAO,IAAI/0B,OAAO+0B,EAAQv6B,QAASu6B,EAAQ76B,OAAS,IAAM,KAAO66B,EAAQlM,WAAa,IAAM,KAAOkM,EAAQpM,UAAY,IAAM,KAAOoM,EAAQC,OAAS,IAAM,KAAOD,EAAQE,QAAU,IAAM,KC0B5N,IAGe,GAHS9I,SAAQ,SAAS5xB,KAAKuK,GAC5C,OAAe,OAARA,EAAe,YAAiBhL,IAARgL,EAAoB,YAAc7P,OAAOoB,UAAUmJ,SAAS9K,KAAKoQ,GAAKzE,MAAM,GAAI,MCflG,SAAS60B,OAAO1/B,EAAO2/B,EAASC,EAAOC,GACpD,IAAItV,EAAO,SAASA,KAAKuV,GAGvB,IAFA,IAAIn2B,EAAMg2B,EAAQj+B,OACdyzB,EAAM,EACHA,EAAMxrB,GAAK,CAChB,GAAI3J,IAAU2/B,EAAQxK,GACpB,OAAOyK,EAAMzK,GAEfA,GAAO,EAIT,IAAK,IAAI70B,KAFTq/B,EAAQxK,EAAM,GAAKn1B,EACnB4/B,EAAMzK,EAAM,GAAK2K,EACD9/B,EACd8/B,EAAYx/B,GAAOu/B,EAAOH,OAAO1/B,EAAMM,GAAMq/B,EAASC,GAAO,GAAQ5/B,EAAMM,GAE7E,OAAOw/B,GAET,OAAQ,GAAK9/B,IACX,IAAK,SACH,OAAOuqB,EAAK,IACd,IAAK,QACH,OAAOA,EAAK,IACd,IAAK,OACH,OAAO,IAAIvX,KAAKhT,EAAMuP,WACxB,IAAK,SACH,OAAO+vB,aAAat/B,GACtB,QACE,OAAOA,GChBb,IAGe,GAHU22B,SAAQ,SAAS9Q,MAAM7lB,GAC9C,OAAgB,MAATA,GAAwC,mBAAhBA,EAAM6lB,MAAuB7lB,EAAM6lB,QAAU6Z,OAAO1/B,EAAO,GAAI,IAAI,MCErF,GALe22B,SAAQ,SAASoJ,WAAWC,GACxD,OAAO,SAAU/5B,EAAGC,GAClB,OAAO85B,EAAK/5B,EAAGC,IAAM,EAAI85B,EAAK95B,EAAGD,GAAK,EAAI,MCA/B,GAHQ0wB,SAAQ,SAASsJ,IAAIh6B,GAC1C,OAAQA,KCIK,GADe,GAAK,ICzBpB,SAASi6B,MAAMr5B,EAAGsP,GAC/B,OAAO,WACL,OAAOA,EAAEjX,KAAK+E,KAAM4C,EAAEzC,MAAMH,KAAME,aCUvB,SAASg8B,gBAAgBC,EAAYp8B,GAClD,OAAO,WACL,IAAItC,EAASyC,UAAUzC,OACvB,GAAe,IAAXA,EACF,OAAOsC,IAET,IAAI9C,EAAMiD,UAAUzC,EAAS,GAC7B,OAAO83B,EAASt4B,IAAmC,mBAApBA,EAAIk/B,GAA6Bp8B,EAAGI,MAAMH,KAAME,WAAajD,EAAIk/B,GAAYh8B,MAAMlD,EAAKiI,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,EAAGzC,EAAS,KCQ7K,IAGe,GAHUo3B,QAAsBqH,gBAAgB,SAAS,SAASt1B,MAAMw1B,EAAWC,EAASzH,GACzG,OAAO1vB,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAMwH,EAAWC,OCItC,GADS3J,QAAsBwJ,gBAAgB,OAAqB,GAAM,EAAGI,OCH7E,SAASC,OACtB,GAAyB,IAArBr8B,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,uCAElB,OAAOstB,OAAOtzB,UAAU,GAAGzC,OAAQ,EAAOw+B,MAAO/7B,UAAU,GAAI,GAAKA,aCLtE,IAGe,GAHYwyB,SAAQ,SAAS9L,QAAQgO,GAClD,OAAOoB,UAAUpB,GAAQA,EAAKtuB,MAAM,IAAIsgB,UAAU5f,KAAK,IAAM9B,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAAGhO,aCDpF,SAAS4V,UACtB,GAAyB,IAArBt8B,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,0CAElB,OAAOq2B,KAAKp8B,MAAMH,KAAM,GAAQE,YCGnB,SAASu8B,WACtB,GAAyB,IAArBv8B,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,2CAElB,IAAI8J,EAAO9K,MAAMtI,UAAUgK,MAAM3L,KAAKiF,WAClCw8B,EAAO1sB,EAAKyU,MAChB,OAAO+X,QAAQA,QAAQr8B,MAAMH,KAAM,EAAI,GAAOgQ,IAAQ0sB,GCxCzC,SAASC,OAAO/5B,EAAGsP,GAChC,OAAO,WACL,IAAIxR,EAAMV,KACV,OAAO4C,EAAEzC,MAAMO,EAAKR,WAAWL,MAAK,SAAUohB,GAC5C,OAAO/O,EAAEjX,KAAKyF,EAAKugB,OCmBV,SAAS2b,QACtB,GAAyB,IAArB18B,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,wCAElB,OAAOstB,OAAOtzB,UAAU,GAAGzC,OAAQ,EAAOk/B,OAAQz8B,UAAU,GAAI,GAAKA,aCUxD,SAAS28B,WACtB,GAAyB,IAArB38B,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,2CAElB,OAAO02B,MAAMz8B,MAAMH,KAAM,GAAQE,YCzCpB,SAAS48B,mBAAmBtG,GAGzC,IAFA,IACI1gB,EADA8e,EAAO,KAEF9e,EAAO0gB,EAAK1gB,QAAQnW,MAC3Bi1B,EAAK7tB,KAAK+O,EAAK/Z,OAEjB,OAAO64B,ECNM,SAASmI,cAAchB,EAAM9a,EAAG2T,GAI7C,IAHA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OAERyzB,EAAMxrB,GAAK,CAChB,GAAIq2B,EAAK9a,EAAG2T,EAAK1D,IACf,OAAO,EAETA,GAAO,EAET,OAAO,ECeT,IAWe,GAXc2B,SAAQ,SAASmK,UAAUh7B,EAAGC,GAEzD,OAAID,IAAMC,EAGK,IAAND,GAAW,EAAIA,GAAM,EAAIC,EAGzBD,GAAMA,GAAKC,GAAMA,KCd5B,SAASg7B,mBAAmBC,EAAWC,EAAWC,EAAQC,GACxD,IAAIr7B,EAAI86B,mBAAmBI,GAG3B,SAASvyB,GAAGqoB,EAAID,GACd,OAAOuK,QAAQtK,EAAID,EAAIqK,EAAOx2B,QAASy2B,EAAOz2B,SAIhD,OAAQm2B,eAAc,SAAU96B,EAAGs7B,GACjC,OAAQR,cAAcpyB,GAAI4yB,EAAOt7B,KAR3B66B,mBAAmBK,GASrBn7B,GAGO,SAASs7B,QAAQt7B,EAAGC,EAAGm7B,EAAQC,GAC5C,GAAI,GAAUr7B,EAAGC,GACf,OAAO,EAGT,IAAIu7B,EAAQ,GAAKx7B,GAEjB,GAAIw7B,IAAU,GAAKv7B,GACjB,OAAO,EAGT,GAAS,MAALD,GAAkB,MAALC,EACf,OAAO,EAGT,GAAwC,mBAA7BD,EAAE,wBAA6E,mBAA7BC,EAAE,uBAC7D,MAA2C,mBAA7BD,EAAE,wBAAyCA,EAAE,uBAAuBC,IAA0C,mBAA7BA,EAAE,wBAAyCA,EAAE,uBAAuBD,GAGrK,GAAwB,mBAAbA,EAAEy7B,QAA6C,mBAAbx7B,EAAEw7B,OAC7C,MAA2B,mBAAbz7B,EAAEy7B,QAAyBz7B,EAAEy7B,OAAOx7B,IAA0B,mBAAbA,EAAEw7B,QAAyBx7B,EAAEw7B,OAAOz7B,GAGrG,OAAQw7B,GACN,IAAK,YACL,IAAK,QACL,IAAK,SACH,GAA6B,mBAAlBx7B,EAAEtD,aAA+D,YC5DnE,SAASg/B,cAAc96B,GAEpC,IAAIqrB,EAAQpiB,OAAOjJ,GAAGqrB,MAAM,mBAC5B,OAAgB,MAATA,EAAgB,GAAKA,EAAM,GDyDayP,CAAc17B,EAAEtD,aACzD,OAAOsD,IAAMC,EAEf,MACF,IAAK,UACL,IAAK,SACL,IAAK,SACH,UAAaD,UAAaC,IAAK,GAAUD,EAAEsJ,UAAWrJ,EAAEqJ,WACtD,OAAO,EAET,MACF,IAAK,OACH,IAAK,GAAUtJ,EAAEsJ,UAAWrJ,EAAEqJ,WAC5B,OAAO,EAET,MACF,IAAK,QACH,OAAOtJ,EAAE3G,OAAS4G,EAAE5G,MAAQ2G,EAAEoN,UAAYnN,EAAEmN,QAC9C,IAAK,SACH,GAAMpN,EAAEjB,SAAWkB,EAAElB,QAAUiB,EAAEvB,SAAWwB,EAAExB,QAAUuB,EAAEotB,aAAentB,EAAEmtB,YAAcptB,EAAEktB,YAAcjtB,EAAEitB,WAAaltB,EAAEu5B,SAAWt5B,EAAEs5B,QAAUv5B,EAAEw5B,UAAYv5B,EAAEu5B,QAC/J,OAAO,EAMb,IADA,IAAItK,EAAMkM,EAAO3/B,OAAS,EACnByzB,GAAO,GAAG,CACf,GAAIkM,EAAOlM,KAASlvB,EAClB,OAAOq7B,EAAOnM,KAASjvB,EAEzBivB,GAAO,EAGT,OAAQsM,GACN,IAAK,MACH,OAAIx7B,EAAE4D,OAAS3D,EAAE2D,MAIVq3B,mBAAmBj7B,EAAEwU,UAAWvU,EAAEuU,UAAW4mB,EAAO/3B,OAAO,CAACrD,IAAKq7B,EAAOh4B,OAAO,CAACpD,KACzF,IAAK,MACH,OAAID,EAAE4D,OAAS3D,EAAE2D,MAIVq3B,mBAAmBj7B,EAAEuU,SAAUtU,EAAEsU,SAAU6mB,EAAO/3B,OAAO,CAACrD,IAAKq7B,EAAOh4B,OAAO,CAACpD,KACvF,IAAK,YACL,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,SACL,IAAK,YACL,IAAK,aACL,IAAK,oBACL,IAAK,aACL,IAAK,cACL,IAAK,aACL,IAAK,cACL,IAAK,eACL,IAAK,eACL,IAAK,cACH,MACF,QAEE,OAAO,EAGX,IAAI07B,EAAQ,EAAK37B,GACjB,GAAI27B,EAAMlgC,SAAW,EAAKwE,GAAGxE,OAC3B,OAAO,EAGT,IAAImgC,EAAiBR,EAAO/3B,OAAO,CAACrD,IAChC67B,EAAiBR,EAAOh4B,OAAO,CAACpD,IAGpC,IADAivB,EAAMyM,EAAMlgC,OAAS,EACdyzB,GAAO,GAAG,CACf,IAAI70B,EAAMshC,EAAMzM,GAChB,IAAM+F,KAAK56B,EAAK4F,KAAMq7B,QAAQr7B,EAAE5F,GAAM2F,EAAE3F,GAAMuhC,EAAgBC,GAC5D,OAAO,EAET3M,GAAO,EAET,OAAO,EEvHT,IAGe,GAHW2B,SAAQ,SAAS4K,OAAOz7B,EAAGC,GACnD,OAAOq7B,QAAQt7B,EAAGC,EAAG,GAAI,OC3BZ,SAAS67B,SAASlJ,EAAM5yB,EAAGkvB,GACxC,IAAI6M,EAAKvG,EAET,GAA4B,mBAAjB5C,EAAKzb,QACd,cAAenX,GACb,IAAK,SACH,GAAU,IAANA,EAAS,CAGX,IADA+7B,EAAM,EAAI/7B,EACHkvB,EAAM0D,EAAKn3B,QAAQ,CAExB,GAAa,KADb+5B,EAAO5C,EAAK1D,KACM,EAAIsG,IAASuG,EAC7B,OAAO7M,EAETA,GAAO,EAET,OAAQ,EACH,GAAIlvB,GAAMA,EAAG,CAElB,KAAOkvB,EAAM0D,EAAKn3B,QAAQ,CAExB,GAAoB,iBADpB+5B,EAAO5C,EAAK1D,KACoBsG,GAASA,EACvC,OAAOtG,EAETA,GAAO,EAET,OAAQ,EAGV,OAAO0D,EAAKzb,QAAQnX,EAAGkvB,GAGzB,IAAK,SACL,IAAK,UACL,IAAK,WACL,IAAK,YACH,OAAO0D,EAAKzb,QAAQnX,EAAGkvB,GAEzB,IAAK,SACH,GAAU,OAANlvB,EAEF,OAAO4yB,EAAKzb,QAAQnX,EAAGkvB,GAK/B,KAAOA,EAAM0D,EAAKn3B,QAAQ,CACxB,GAAI,GAAOm3B,EAAK1D,GAAMlvB,GACpB,OAAOkvB,EAETA,GAAO,EAET,OAAQ,ECpDK,SAAS8M,UAAUh8B,EAAG4yB,GACnC,OAAOkJ,SAASlJ,EAAM5yB,EAAG,IAAM,ECHlB,SAASi8B,OAAOlhC,GAI7B,MAAO,IAHOA,EAAE6mB,QAAQ,MAAO,QAAQA,QAAQ,QAAS,OACvDA,QAAQ,MAAO,OAAOA,QAAQ,MAAO,OAAOA,QAAQ,MAAO,OAAOA,QAAQ,MAAO,OAAOA,QAAQ,MAAO,OAAOA,QAAQ,MAAO,OAEzGA,QAAQ,KAAM,OAAS,ICD9C,IAAIsa,GAAM,SAASA,IAAI3hC,GACrB,OAAQA,EAAI,GAAK,IAAM,IAAMA,GAShB,GAN0C,mBAA/BwS,KAAKnS,UAAUuhC,YAA6B,SAASC,aAAahjC,GAC1F,OAAOA,EAAE+iC,eACP,SAASC,aAAahjC,GACxB,OAAOA,EAAEijC,iBAAmB,IAAMH,GAAI9iC,EAAEkjC,cAAgB,GAAK,IAAMJ,GAAI9iC,EAAEmjC,cAAgB,IAAML,GAAI9iC,EAAEojC,eAAiB,IAAMN,GAAI9iC,EAAEqjC,iBAAmB,IAAMP,GAAI9iC,EAAEsjC,iBAAmB,KAAOtjC,EAAEujC,qBAAuB,KAAMjT,QAAQ,GAAG9kB,MAAM,EAAG,GAAK,KCVtO,SAASg4B,YAAYh8B,GAClC,OAAO,WACL,OAAQA,EAAEzC,MAAMH,KAAME,YCFX,SAAS2+B,QAAQ9+B,EAAI60B,GAKlC,IAJA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACX2P,EAAS,GAEN8jB,EAAMxrB,GACP3F,EAAG60B,EAAK1D,MACV9jB,EAAOA,EAAO3P,QAAUm3B,EAAK1D,IAE/BA,GAAO,EAET,OAAO9jB,ECXM,SAAS0xB,UAAU7d,GAChC,MAA6C,oBAAtCzlB,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,GCExC,IAAI,GAAuB,WACzB,SAAS8d,QAAQn8B,EAAG0yB,GAClBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EAQX,OANAm8B,QAAQniC,UAAU,qBAAuB+4B,EAAQ3lB,KACjD+uB,QAAQniC,UAAU,uBAAyB+4B,EAAQvoB,OACnD2xB,QAAQniC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GACzD,OAAO51B,KAAK4C,EAAEgzB,GAAS51B,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,GAASxoB,GAGhE2xB,QAXkB,GC0CZ,GAVWlM,QAAsBuC,cAAc,CAAC,UDlBnCvC,SAAQ,SAASmM,SAASp8B,EAAG0yB,GACvD,OAAO,IAAI,GAAQ1yB,EAAG0yB,OCiB4D,SAAUyG,EAAMkD,GAClG,OAAOH,UAAUG,GAAcrI,SAAQ,SAAUR,EAAK/5B,GAIpD,OAHI0/B,EAAKkD,EAAW5iC,MAClB+5B,EAAI/5B,GAAO4iC,EAAW5iC,IAEjB+5B,IACN,GAAI,EAAK6I,IAEZJ,QAAQ9C,EAAMkD,OCZD,GAHWpM,SAAQ,SAASxzB,OAAO08B,EAAMkD,GACtD,OAAO,GAAOL,YAAY7C,GAAOkD,MCUnC,IAGe,GAHavM,SAAQ,SAAS3sB,SAASsF,GACpD,OCjCa,SAAS6zB,UAAUje,EAAGke,GACnC,IAAIC,EAAQ,SAASA,MAAMle,GACzB,IAAIme,EAAKF,EAAK95B,OAAO,CAAC4b,IACtB,OAAO+c,UAAU9c,EAAGme,GAAM,aAAeH,UAAUhe,EAAGme,IAIpDC,SAAW,SAAUriC,EAAKmL,GAC5B,OAAO0tB,MAAK,SAAU7wB,GACpB,OAAOg5B,OAAOh5B,GAAK,KAAOm6B,EAAMniC,EAAIgI,MACnCmD,EAAKxB,QAAQspB,SAGlB,OAAQ10B,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,IACrC,IAAK,qBACH,MAAO,qCAAuC6U,KAAKsJ,EAAOne,GAAGja,KAAK,MAAQ,KAC5E,IAAK,iBACH,MAAO,IAAM8uB,KAAKsJ,EAAOne,GAAG5b,OAAOi6B,SAASre,EAAG,IAAO,SAAUhc,GAC9D,MAAQ,QAAQyN,KAAKzN,KAEpB,EAAKgc,MAAMja,KAAK,MAAQ,IAC7B,IAAK,mBACH,MAAoB,iBAANia,EAAiB,eAAiBme,EAAMne,EAAE3V,WAAa,IAAM2V,EAAElb,WAC/E,IAAK,gBACH,MAAO,aAAeyF,MAAMyV,EAAE3V,WAAa8zB,EAAM3W,KAAOwV,OAAO,GAAahd,KAAO,IACrF,IAAK,gBACH,MAAO,OACT,IAAK,kBACH,MAAoB,iBAANA,EAAiB,cAAgBme,EAAMne,EAAE3V,WAAa,IAAM,EAAI2V,IAAOqb,IAAW,KAAOrb,EAAElb,SAAS,IACpH,IAAK,kBACH,MAAoB,iBAANkb,EAAiB,cAAgBme,EAAMne,EAAE3V,WAAa,IAAM2yB,OAAOhd,GACnF,IAAK,qBACH,MAAO,YACT,QACE,GAA0B,mBAAfA,EAAElb,SAAyB,CACpC,IAAIw5B,EAAOte,EAAElb,WACb,GAAa,oBAATw5B,EACF,OAAOA,EAGX,MAAO,IAAMD,SAASre,EAAG,EAAKA,IAAIja,KAAK,MAAQ,KDP5Ck4B,CAAU7zB,EAAK,OEeT,GArBWwnB,SAAQ,SAASxtB,OAAOrD,EAAGC,GACnD,GAAIszB,EAASvzB,GAAI,CACf,GAAIuzB,EAAStzB,GACX,OAAOD,EAAEqD,OAAOpD,GAElB,MAAM,IAAI5E,UAAU,GAAS4E,GAAK,oBAEpC,GAAI+zB,UAAUh0B,GAAI,CAChB,GAAIg0B,UAAU/zB,GACZ,OAAOD,EAAIC,EAEb,MAAM,IAAI5E,UAAU,GAAS4E,GAAK,oBAEpC,GAAS,MAALD,GAAa+3B,YAAY/3B,EAAE,wBAC7B,OAAOA,EAAE,uBAAuBC,GAElC,GAAS,MAALD,GAAa+3B,YAAY/3B,EAAEqD,QAC7B,OAAOrD,EAAEqD,OAAOpD,GAElB,MAAM,IAAI5E,UAAU,GAAS2E,GAAK,sECPrB,GAdS0wB,SAAQ,SAAS8M,KAAKC,GAI5C,OAAOjM,OAHK,EAAO,EAAK,EAAG,GAAI,SAAUkM,GACvC,OAAOA,EAAK,GAAGjiC,SACdgiC,KACkB,WAEnB,IADA,IAAIvO,EAAM,EACHA,EAAMuO,EAAMhiC,QAAQ,CACzB,GAAIgiC,EAAMvO,GAAK,GAAG/wB,MAAMH,KAAME,WAC5B,OAAOu/B,EAAMvO,GAAK,GAAG/wB,MAAMH,KAAME,WAEnCgxB,GAAO,SC+BE,GAlCe2B,SAAQ,SAAS8M,WAAWpjC,EAAGqjC,GAC3D,GAAIrjC,EAAI,GACN,MAAM,IAAI2J,MAAM,+CAElB,OAAU,IAAN3J,EACK,WACL,OAAO,IAAIqjC,GAGR,GAAM,GAAKrjC,GAAG,SAAUsjC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,OAAQpgC,UAAUzC,QAChB,KAAK,EACH,OAAO,IAAImiC,EAAGC,GAChB,KAAK,EACH,OAAO,IAAID,EAAGC,EAAIC,GACpB,KAAK,EACH,OAAO,IAAIF,EAAGC,EAAIC,EAAIC,GACxB,KAAK,EACH,OAAO,IAAIH,EAAGC,EAAIC,EAAIC,EAAIC,GAC5B,KAAK,EACH,OAAO,IAAIJ,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,GAChC,KAAK,EACH,OAAO,IAAIL,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACpC,KAAK,EACH,OAAO,IAAIN,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACxC,KAAK,EACH,OAAO,IAAIP,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC5C,KAAK,EACH,OAAO,IAAIR,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAChD,KAAK,GACH,OAAO,IAAIT,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,WC/B3C,GAHc5N,SAAQ,SAAS9jB,UAAUgxB,GACtD,OAAO,GAAWA,EAAGniC,OAAQmiC,MCZhB,GADa/M,QAAQmL,WCoBrB,GATanL,SAAQ,SAAS0N,SAASC,EAAOC,GAC3D,OAAO,EAAO,EAAO,EAAK,EAAG,EAAM,SAAUA,KAAO,WAClD,IAAIxgC,EAAOC,UACPwgC,EAAU1gC,KACd,OAAOwgC,EAAMrgC,MAAMugC,EAAS5K,MAAK,SAAU/1B,GACzC,OAAOA,EAAGI,MAAMugC,EAASzgC,KACxBwgC,UCpCH,GAAyB,WAC3B,SAASE,UAAUC,EAASC,EAAUC,EAAOxL,GAC3Ct1B,KAAK4gC,QAAUA,EACf5gC,KAAK6gC,SAAWA,EAChB7gC,KAAK8gC,MAAQA,EACb9gC,KAAKs1B,GAAKA,EACVt1B,KAAK+gC,OAAS,GAwBhB,OAtBAJ,UAAU/jC,UAAU,qBAAuB+4B,EAAQ3lB,KACnD2wB,UAAU/jC,UAAU,uBAAyB,SAAUwQ,GACrD,IAAI/Q,EACJ,IAAKA,KAAO2D,KAAK+gC,OACf,GAAI9J,KAAK56B,EAAK2D,KAAK+gC,UACjB3zB,EAASpN,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAK+gC,OAAO1kC,KAC/C,wBAAyB,CAClC+Q,EAASA,EAAO,sBAChB,MAKN,OADApN,KAAK+gC,OAAS,KACP/gC,KAAKs1B,GAAG,uBAAuBloB,IAExCuzB,UAAU/jC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAC3D,IAAIv5B,EAAM2D,KAAK8gC,MAAMlL,GAGrB,OAFA51B,KAAK+gC,OAAO1kC,GAAO2D,KAAK+gC,OAAO1kC,IAAQ,CAACA,EAAK2D,KAAK6gC,UAClD7gC,KAAK+gC,OAAO1kC,GAAK,GAAK2D,KAAK4gC,QAAQ5gC,KAAK+gC,OAAO1kC,GAAK,GAAIu5B,GACjDxoB,GAGFuzB,UA9BoB,GCqDd,GAPaxM,QAAQ,EAAG,GAAiBiB,cAAc,GDbxCjB,QAAQ,EAAG,IAAI,SAAS6M,WAAWJ,EAASC,EAAUC,EAAOxL,GACzF,OAAO,IAAI,GAAUsL,EAASC,EAAUC,EAAOxL,OCYqC,SAAS2L,SAASL,EAASC,EAAUC,EAAOlM,GAChI,OAAOgC,SAAQ,SAAUR,EAAK8K,GAC5B,IAAI7kC,EAAMykC,EAAMI,GAEhB,OADA9K,EAAI/5B,GAAOukC,EAAQ3J,KAAK56B,EAAK+5B,GAAOA,EAAI/5B,GAAOwkC,EAAUK,GAClD9K,IACN,GAAIxB,OC1BM,GAHY,IAAS,SAAUwB,EAAK+K,GACjD,OAAO/K,EAAM,IACZ,GCVY,GADQ,GAAK,GCUb,GAHcvD,SAAQ,SAASuO,UAAUhmC,EAAGoqB,GACzD,OAAY,MAALA,GAAaA,GAAMA,EAAIpqB,EAAIoqB,KCIrB,GALYqP,SAAQ,SAASwM,QAAQthC,EAAIiC,EAAGC,GACzD,IAAIq3B,EAAKv5B,EAAGiC,GACRu3B,EAAKx5B,EAAGkC,GACZ,OAAOq3B,EAAKC,GAAM,EAAID,EAAKC,EAAK,EAAI,KCQvB,GAZe1G,SAAQ,SAASyO,WAAWC,EAAOC,GAI/D,IAHA,IAAIvgC,EAAM,GACNiwB,EAAM,EACNuQ,EAAWF,EAAM9jC,OACdyzB,EAAMuQ,GACNzD,UAAUuD,EAAMrQ,GAAMsQ,IAAYxD,UAAUuD,EAAMrQ,GAAMjwB,KAC3DA,EAAIA,EAAIxD,QAAU8jC,EAAMrQ,IAE1BA,GAAO,EAET,OAAOjwB,KCIM,GAZmB4zB,SAAQ,SAAS6M,eAAe3F,EAAMwF,EAAOC,GAI7E,IAHA,IAAIvgC,EAAM,GACNiwB,EAAM,EACNuQ,EAAWF,EAAM9jC,OACdyzB,EAAMuQ,GACN1E,cAAchB,EAAMwF,EAAMrQ,GAAMsQ,IAAYzE,cAAchB,EAAMwF,EAAMrQ,GAAMjwB,IAC/EA,EAAI8F,KAAKw6B,EAAMrQ,IAEjBA,GAAO,EAET,OAAOjwB,KCTM,GARW4xB,SAAQ,SAAS8O,OAAOzK,EAAMj6B,GACtD,IAAImQ,EAAS,GACb,IAAK,IAAItQ,KAAKG,EACZmQ,EAAOtQ,GAAKG,EAAIH,GAGlB,cADOsQ,EAAO8pB,GACP9pB,KCEM,GALWynB,SAAQ,SAAS+M,OAAOC,EAAOC,EAAOlN,GAC9D,IAAIxnB,EAASlI,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAE9C,OADAxnB,EAAOmZ,OAAOsb,EAAOC,GACd10B,KCKM,GAHWynB,SAAQ,SAASkN,OAAO7Q,EAAKjQ,EAAG2T,GACxD,OAAO,EAAO,EAAO3T,GAAIiQ,EAAK0D,MCiBjB,GAlBe/B,SAAQ,SAASmP,WAAWpK,EAAM36B,GAC9D,OAAQ26B,EAAKn6B,QACX,KAAK,EACH,OAAOR,EACT,KAAK,EACH,OAAO28B,GAAWhC,EAAK,IAAM,GAAOA,EAAK,GAAI,EAAG36B,GAAO,GAAO26B,EAAK,GAAI36B,GACzE,QACE,IAAIglC,EAAOrK,EAAK,GACZsK,EAAOh9B,MAAMtI,UAAUgK,MAAM3L,KAAK28B,EAAM,GAC5C,OAAiB,MAAb36B,EAAIglC,GACChlC,EACE28B,GAAWhC,EAAK,IAClB,GAAOqK,EAAMD,WAAWE,EAAMjlC,EAAIglC,IAAQhlC,GAE1C,GAAMglC,EAAMD,WAAWE,EAAMjlC,EAAIglC,IAAQhlC,OCbzC,GAHW41B,SAAQ,SAASsP,OAAOngC,EAAGC,GACnD,OAAOD,EAAIC,KCtBT,GAAqB,WACvB,SAASmgC,MAAM7lC,EAAG+4B,GAChBt1B,KAAKs1B,GAAKA,EACVt1B,KAAKzD,EAAIA,EAYX,OAVA6lC,MAAMxlC,UAAU,qBAAuB+4B,EAAQ3lB,KAC/CoyB,MAAMxlC,UAAU,uBAAyB+4B,EAAQvoB,OACjDg1B,MAAMxlC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GACvD,OAAI51B,KAAKzD,EAAI,GACXyD,KAAKzD,GAAK,EACH6Q,GAEFpN,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,IAGvCwM,MAfgB,GC6BV,GAHSvP,QAAsBuC,cAAc,CAAC,QDRnCvC,SAAQ,SAASwP,OAAO9lC,EAAG+4B,GACnD,OAAO,IAAI,GAAM/4B,EAAG+4B,OCOwD,SAASgN,KAAK/lC,EAAG8iC,GAC7F,OAAO,GAAM/8B,KAAKgf,IAAI,EAAG/kB,GAAI+/B,IAAU+C,OC1BrC,GAAqB,WACvB,SAASkD,MAAMhmC,EAAG+4B,GAChBt1B,KAAKs1B,GAAKA,EACVt1B,KAAKzD,EAAIA,EACTyD,KAAKlF,EAAI,EAUX,OARAynC,MAAM3lC,UAAU,qBAAuB+4B,EAAQ3lB,KAC/CuyB,MAAM3lC,UAAU,uBAAyB+4B,EAAQvoB,OACjDm1B,MAAM3lC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GACvD51B,KAAKlF,GAAK,EACV,IAAIggC,EAAiB,IAAX96B,KAAKzD,EAAU6Q,EAASpN,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,GACvE,OAAO51B,KAAKzD,GAAK,GAAKyD,KAAKlF,GAAKkF,KAAKzD,EAAIk5B,SAASqF,GAAOA,GAGpDyH,MAdgB,GC+CV,GAHS1P,QAAsBuC,cAAc,CAAC,QD3BnCvC,SAAQ,SAAS2P,OAAOjmC,EAAG+4B,GACnD,OAAO,IAAI,GAAM/4B,EAAG+4B,OC0BwD,SAASmN,KAAKlmC,EAAG8iC,GAC7F,OAAO,GAAM,EAAG9iC,EAAI,EAAI+/B,IAAW//B,EAAG8iC,OC/CzB,SAASqD,SAASnmC,EAAG8iC,GAClC,OAAO,GAAK9iC,EAAI8iC,EAAG5hC,OAAS4hC,EAAG5hC,OAASlB,EAAI,EAAG8iC,GCAjD,IAAI,GAAyB,WAC3B,SAASsD,UAAUpmC,EAAG+4B,GACpBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK24B,IAAM,EACX34B,KAAK44B,MAAO,EACZ54B,KAAKo2B,IAAM,IAAIlxB,MAAM3I,GAuBvB,OArBAomC,UAAU/lC,UAAU,qBAAuB+4B,EAAQ3lB,KACnD2yB,UAAU/lC,UAAU,uBAAyB,SAAUwQ,GAErD,OADApN,KAAKo2B,IAAM,KACJp2B,KAAKs1B,GAAG,uBAAuBloB,IAExCu1B,UAAU/lC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAK3D,OAJI51B,KAAK44B,OACPxrB,EAASpN,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAKo2B,IAAIp2B,KAAK24B,OAE9D34B,KAAKjB,MAAM62B,GACJxoB,GAETu1B,UAAU/lC,UAAUmC,MAAQ,SAAU62B,GACpC51B,KAAKo2B,IAAIp2B,KAAK24B,KAAO/C,EACrB51B,KAAK24B,KAAO,EACR34B,KAAK24B,MAAQ34B,KAAKo2B,IAAI34B,SACxBuC,KAAK24B,IAAM,EACX34B,KAAK44B,MAAO,IAIT+J,UA5BoB,GCwBd,GADa9P,QAAsBuC,cAAc,GDQlCvC,SAAQ,SAAS+P,WAAWrmC,EAAG+4B,GAC3D,OAAO,IAAI,GAAU/4B,EAAG+4B,MCTsD,WCxBjE,SAASuN,cAAc9G,EAAMsD,GAE1C,IADA,IAAInO,EAAMmO,EAAG5hC,OAAS,EACfyzB,GAAO,GAAK6K,EAAKsD,EAAGnO,KACzBA,GAAO,EAET,OAAO,GAAM,EAAGA,EAAM,EAAGmO,GCH3B,IAAI,GAA8B,WAChC,SAASyD,eAAe/iC,EAAIu1B,GAC1Bt1B,KAAK4C,EAAI7C,EACTC,KAAK+iC,SAAW,GAChB/iC,KAAKs1B,GAAKA,EAoBZ,OAlBAwN,eAAelmC,UAAU,qBAAuB+4B,EAAQ3lB,KACxD8yB,eAAelmC,UAAU,uBAAyB,SAAUwQ,GAE1D,OADApN,KAAK+iC,SAAW,KACT/iC,KAAKs1B,GAAG,uBAAuBloB,IAExC01B,eAAelmC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAChE,OAAO51B,KAAK4C,EAAEgzB,GAAS51B,KAAKgjC,OAAO51B,EAAQwoB,GAAS51B,KAAKijC,MAAM71B,EAAQwoB,IAEzEkN,eAAelmC,UAAUqmC,MAAQ,SAAU71B,EAAQwoB,GAGjD,OAFAxoB,EAASwpB,QAAQ52B,KAAKs1B,GAAG,qBAAsBloB,EAAQpN,KAAK+iC,UAC5D/iC,KAAK+iC,SAAW,GACT/iC,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,IAE9CkN,eAAelmC,UAAUomC,OAAS,SAAU51B,EAAQwoB,GAElD,OADA51B,KAAK+iC,SAASh8B,KAAK6uB,GACZxoB,GAGF01B,eAxByB,GC2BnB,GADkBjQ,QAAsBuC,cAAc,GDClCvC,SAAQ,SAASqQ,gBAAgBnjC,EAAIu1B,GACtE,OAAO,IAAI,GAAev1B,EAAIu1B,MCF0D,gBC3BtF,GAAgC,WAClC,SAAS6N,iBAAiBpH,EAAMzG,GAC9Bt1B,KAAKs1B,GAAKA,EACVt1B,KAAK+7B,KAAOA,EACZ/7B,KAAKojC,eAAY/iC,EACjBL,KAAKqjC,gBAAiB,EAgBxB,OAbAF,iBAAiBvmC,UAAU,qBAAuB+4B,EAAQ3lB,KAC1DmzB,iBAAiBvmC,UAAU,uBAAyB+4B,EAAQvoB,OAC5D+1B,iBAAiBvmC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAClE,IAAI0N,GAAa,EAOjB,OANKtjC,KAAKqjC,eAECrjC,KAAK+7B,KAAK/7B,KAAKojC,UAAWxN,KACnC0N,GAAa,GAFbtjC,KAAKqjC,gBAAiB,EAIxBrjC,KAAKojC,UAAYxN,EACV0N,EAAal2B,EAASpN,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,IAG7DuN,iBArB2B,GA2BrB,GAHsBtQ,SAAQ,SAAS0Q,kBAAkBxH,EAAMzG,GAC5E,OAAO,IAAI,GAAiByG,EAAMzG,MCKrB,GAJQzC,SAAQ,SAAS2Q,IAAIC,EAAQ7O,GAClD,IAAI1D,EAAMuS,EAAS,EAAI7O,EAAKn3B,OAASgmC,EAASA,EAC9C,OAAOzN,UAAUpB,GAAQA,EAAK3uB,OAAOirB,GAAO0D,EAAK1D,MCRpC,GADS,IAAK,GCmBd,GAfoB2B,QAAsBuC,cAAc,GAAI,IAAmB,SAASsO,gBAAgB3H,EAAMnH,GAC3H,IAAIxnB,EAAS,GACT8jB,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACf,GAAY,IAARiI,EAEF,IADA0H,EAAO,GAAKwnB,EAAK,GACV1D,EAAMxrB,GACNq2B,EAAK,GAAK3uB,GAASwnB,EAAK1D,MAC3B9jB,EAAOA,EAAO3P,QAAUm3B,EAAK1D,IAE/BA,GAAO,EAGX,OAAO9jB,MCdM,GADgBslB,QAAsB0C,cAAc,GAAiB,GAAkB,IAAsB,GAAgB,MCrBxI,GAA0B,WAC5B,SAASuO,WAAW/gC,EAAG0yB,GACrBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EAcX,OAZA+gC,WAAW/mC,UAAU,qBAAuB+4B,EAAQ3lB,KACpD2zB,WAAW/mC,UAAU,uBAAyB+4B,EAAQvoB,OACtDu2B,WAAW/mC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAC5D,GAAI51B,KAAK4C,EAAG,CACV,GAAI5C,KAAK4C,EAAEgzB,GACT,OAAOxoB,EAETpN,KAAK4C,EAAI,KAEX,OAAO5C,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,IAGvC+N,WAjBqB,GCsCf,GARc9Q,QAAsBuC,cAAc,CAAC,aDVnCvC,SAAQ,SAAS+Q,YAAYhhC,EAAG0yB,GAC7D,OAAO,IAAI,GAAW1yB,EAAG0yB,OCSkE,SAASuO,UAAU9H,EAAMsD,GAGpH,IAFA,IAAInO,EAAM,EACNxrB,EAAM25B,EAAG5hC,OACNyzB,EAAMxrB,GAAOq2B,EAAKsD,EAAGnO,KAC1BA,GAAO,EAET,OAAO,GAAMA,EAAKoL,IAAU+C,OCdf,GAHOxM,SAAQ,SAASiR,GAAG9hC,EAAGC,GAC3C,OAAOD,GAAKC,KCcC,GALW4wB,SAAQ,SAASkR,OAAOnhC,EAAGsP,GACnD,OAAO6nB,YAAYn3B,GAAK,SAASohC,UAC/B,OAAOphC,EAAEzC,MAAMH,KAAME,YAAcgS,EAAE/R,MAAMH,KAAME,YAC/C,GAAK,GAAL,CAAS0C,EAAGsP,MCCH,GAPUwgB,SAAQ,SAASuR,MAAMhjB,GAC9C,OAAY,MAALA,GAAgD,mBAA5BA,EAAE,sBAAuCA,EAAE,wBAA+B,MAALA,GAA8B,MAAjBA,EAAEviB,aAAsE,mBAAxCuiB,EAAEviB,YAAY,sBAAuCuiB,EAAEviB,YAAY,wBAA+B,MAALuiB,GAAgC,mBAAZA,EAAEgjB,MAAuBhjB,EAAEgjB,QAAe,MAALhjB,GAA8B,MAAjBA,EAAEviB,aAAsD,mBAAxBuiB,EAAEviB,YAAYulC,MAAuBhjB,EAAEviB,YAAYulC,QAAU1O,EAAStU,GAAK,GAAK+U,UAAU/U,GAAK,GAAK6d,UAAU7d,GAAK,GAAK,qBAAaA,GAAK,WACxd,OAAO/gB,UADid,QAI1d,KCNa,GAHa2yB,SAAQ,SAASqR,SAAS3nC,EAAG8iC,GACvD,OAAO,GAAK9iC,GAAK,EAAI8iC,EAAG5hC,OAASlB,EAAI,EAAG8iC,MCA3B,GAHaxM,SAAQ,SAAUsR,EAAQvP,GACpD,OAAO,GAAO,GAASuP,EAAO1mC,OAAQm3B,GAAOuP,MCDhC,GAHStP,SAAQ,SAASuP,KAAKxhC,EAAGqe,EAAGC,GAClD,OAAO,GAAOte,EAAEqe,GAAIre,EAAEse,OCMT,GAHY2T,SAAQ,SAASwP,QAAQnN,EAAMoN,EAAMC,GAC9D,OAAO,GAAOD,EAAKpN,GAAOqN,EAAKrN,OCclB,GAVWrE,SAAQ,SAAS2R,OAAOC,EAAiB/nC,GACjE,IACIgoC,EAAgBroC,EAAKyE,EADrBsM,EAAS,GAEb,IAAK/Q,KAAOK,EAEVoE,SADA4jC,EAAiBD,EAAgBpoC,IAEjC+Q,EAAO/Q,GAAgB,aAATyE,EAAsB4jC,EAAehoC,EAAOL,IAAQqoC,GAA2B,WAAT5jC,EAAoB0jC,OAAOE,EAAgBhoC,EAAOL,IAAQK,EAAOL,GAEvJ,OAAO+Q,KCjCL,GAAqB,WACvB,SAASu3B,MAAM/hC,EAAG0yB,GAChBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EACT5C,KAAK4kC,OAAQ,EAiBf,OAfAD,MAAM/nC,UAAU,qBAAuB+4B,EAAQ3lB,KAC/C20B,MAAM/nC,UAAU,uBAAyB,SAAUwQ,GAIjD,OAHKpN,KAAK4kC,QACRx3B,EAASpN,KAAKs1B,GAAG,qBAAqBloB,OAAQ,IAEzCpN,KAAKs1B,GAAG,uBAAuBloB,IAExCu3B,MAAM/nC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAKvD,OAJI51B,KAAK4C,EAAEgzB,KACT51B,KAAK4kC,OAAQ,EACbx3B,EAASqoB,SAASz1B,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,KAElDxoB,GAGFu3B,MArBgB,GCkCV,GAVS9R,QAAsBuC,cAAc,CAAC,QDAnCvC,SAAQ,SAASgS,OAAOjiC,EAAG0yB,GACnD,OAAO,IAAI,GAAM1yB,EAAG0yB,OCDwD,SAASwP,KAAK/kC,EAAI60B,GAG9F,IAFA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACRyzB,EAAMxrB,GAAK,CAChB,GAAI3F,EAAG60B,EAAK1D,IACV,OAAO0D,EAAK1D,GAEdA,GAAO,OC/BP,GAA0B,WAC5B,SAAS6T,WAAWniC,EAAG0yB,GACrBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EACT5C,KAAKkxB,KAAO,EACZlxB,KAAK4kC,OAAQ,EAkBf,OAhBAG,WAAWnoC,UAAU,qBAAuB+4B,EAAQ3lB,KACpD+0B,WAAWnoC,UAAU,uBAAyB,SAAUwQ,GAItD,OAHKpN,KAAK4kC,QACRx3B,EAASpN,KAAKs1B,GAAG,qBAAqBloB,GAAS,IAE1CpN,KAAKs1B,GAAG,uBAAuBloB,IAExC23B,WAAWnoC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAM5D,OALA51B,KAAKkxB,KAAO,EACRlxB,KAAK4C,EAAEgzB,KACT51B,KAAK4kC,OAAQ,EACbx3B,EAASqoB,SAASz1B,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAKkxB,OAEvD9jB,GAGF23B,WAvBqB,GCiCf,GAXclS,QAAsBuC,cAAc,GDIlCvC,SAAQ,SAASmS,YAAYpiC,EAAG0yB,GAC7D,OAAO,IAAI,GAAW1yB,EAAG0yB,OCLuD,SAAS2P,UAAUllC,EAAI60B,GAGvG,IAFA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACRyzB,EAAMxrB,GAAK,CAChB,GAAI3F,EAAG60B,EAAK1D,IACV,OAAOA,EAETA,GAAO,EAET,OAAQ,MChCN,GAAyB,WAC3B,SAASgU,UAAUtiC,EAAG0yB,GACpBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EAaX,OAXAsiC,UAAUtoC,UAAU,qBAAuB+4B,EAAQ3lB,KACnDk1B,UAAUtoC,UAAU,uBAAyB,SAAUwQ,GACrD,OAAOpN,KAAKs1B,GAAG,uBAAuBt1B,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAK08B,QAElFwI,UAAUtoC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAI3D,OAHI51B,KAAK4C,EAAEgzB,KACT51B,KAAK08B,KAAO9G,GAEPxoB,GAGF83B,UAhBoB,GCgCd,GATarS,QAAsBuC,cAAc,GDJlCvC,SAAQ,SAASsS,WAAWviC,EAAG0yB,GAC3D,OAAO,IAAI,GAAU1yB,EAAG0yB,OCGsD,SAAS8P,SAASrlC,EAAI60B,GAEpG,IADA,IAAI1D,EAAM0D,EAAKn3B,OAAS,EACjByzB,GAAO,GAAG,CACf,GAAInxB,EAAG60B,EAAK1D,IACV,OAAO0D,EAAK1D,GAEdA,GAAO,OC7BP,GAA8B,WAChC,SAASmU,eAAeziC,EAAG0yB,GACzBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EACT5C,KAAKkxB,KAAO,EACZlxB,KAAKslC,SAAW,EAclB,OAZAD,eAAezoC,UAAU,qBAAuB+4B,EAAQ3lB,KACxDq1B,eAAezoC,UAAU,uBAAyB,SAAUwQ,GAC1D,OAAOpN,KAAKs1B,GAAG,uBAAuBt1B,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAKslC,WAElFD,eAAezoC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAKhE,OAJA51B,KAAKkxB,KAAO,EACRlxB,KAAK4C,EAAEgzB,KACT51B,KAAKslC,QAAUtlC,KAAKkxB,KAEf9jB,GAGFi4B,eAnByB,GCiCnB,GAVkBxS,QAAsBuC,cAAc,GDDlCvC,SAAQ,SAAS0S,gBAAgB3iC,EAAG0yB,GACrE,OAAO,IAAI,GAAe1yB,EAAG0yB,OCA2D,SAASkQ,cAAczlC,EAAI60B,GAEnH,IADA,IAAI1D,EAAM0D,EAAKn3B,OAAS,EACjByzB,GAAO,GAAG,CACf,GAAInxB,EAAG60B,EAAK1D,IACV,OAAOA,EAETA,GAAO,EAET,OAAQ,MCbK,GADYwB,QAAsB6H,WAAU,ICW5C,GARS7H,SAAQ,SAAS+S,KAAK1lC,GAC5C,OAAO,EAAOA,EAAGtC,QAAQ,SAAUuE,EAAGC,GACpC,IAAIhC,EAAOiF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,GAGjD,OAFAD,EAAK,GAAKgC,EACVhC,EAAK,GAAK+B,EACHjC,EAAGI,MAAMH,KAAMC,SCkBX,GATY4yB,QAAsBqJ,gBAAgB,WAAW,SAASz1B,QAAQ1G,EAAI60B,GAG/F,IAFA,IAAIlvB,EAAMkvB,EAAKn3B,OACXyzB,EAAM,EACHA,EAAMxrB,GACX3F,EAAG60B,EAAK1D,IACRA,GAAO,EAET,OAAO0D,MCTM,GAVsB/B,SAAQ,SAAS6S,kBAAkB3lC,EAAI9C,GAG1E,IAFA,IAAI0oC,EAAU,EAAK1oC,GACfi0B,EAAM,EACHA,EAAMyU,EAAQloC,QAAQ,CAC3B,IAAIpB,EAAMspC,EAAQzU,GAClBnxB,EAAG9C,EAAIZ,GAAMA,EAAKY,GAClBi0B,GAAO,EAET,OAAOj0B,KCNM,GATcy1B,SAAQ,SAASkT,UAAUnG,GAGtD,IAFA,IAAIryB,EAAS,GACT8jB,EAAM,EACHA,EAAMuO,EAAMhiC,QACjB2P,EAAOqyB,EAAMvO,GAAK,IAAMuO,EAAMvO,GAAK,GACnCA,GAAO,EAET,OAAO9jB,KC0BM,GAPYylB,QAAsBqJ,gBAAgB,UAAwB,IAAS,SAAU9F,EAAKoB,GAK/G,OAJW,MAAPpB,IACFA,EAAM,IAERA,EAAIrvB,KAAKywB,GACFpB,IACN,QCJY,GAdcvD,SAAQ,SAAU9yB,EAAI60B,GAIjD,IAHA,IAAIiR,EAAM,GACN3U,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACRyzB,EAAMxrB,GAAK,CAEhB,IADA,IAAIogC,EAAU5U,EAAM,EACb4U,EAAUpgC,GAAO3F,EAAG60B,EAAKkR,EAAU,GAAIlR,EAAKkR,KACjDA,GAAW,EAEbD,EAAI9+B,KAAK6tB,EAAKhuB,MAAMsqB,EAAK4U,IACzB5U,EAAM4U,EAER,OAAOD,KClBM,GAHOhT,SAAQ,SAAS3M,GAAGlkB,EAAGC,GAC3C,OAAOD,EAAIC,KCEE,GAHQ4wB,SAAQ,SAAS5I,IAAIjoB,EAAGC,GAC7C,OAAOD,GAAKC,KCIC,GADQ4wB,QAAQoE,MCIhB,GAHUpE,SAAQ,SAASkT,MAAM7O,EAAMj6B,GACpD,OAAOi6B,KAAQj6B,KCLF,GADS,GAAI,GCvBb,SAAS+oC,UAAU/kB,GAChC,OAAOA,ECqBT,IACe,GADayR,QAAQsT,WCWrB,GALWnR,SAAQ,SAASoR,OAAOC,EAAWC,EAAQC,GACnE,OAAO,EAAO9jC,KAAKgf,IAAI4kB,EAAUzoC,OAAQ0oC,EAAO1oC,OAAQ2oC,EAAQ3oC,SAAS,SAAS4oC,UAChF,OAAOH,EAAU/lC,MAAMH,KAAME,WAAaimC,EAAOhmC,MAAMH,KAAME,WAAakmC,EAAQjmC,MAAMH,KAAME,iBCZnF,GADQ,EAAI,GCUZ,GAHY,IAAS,SAAUk2B,EAAK+K,GACjD,OAAOA,IACN,MCAY,GAHYtO,SAAQ,SAAS1Z,QAAQ5b,EAAQ8hC,GAC1D,MAA6B,mBAAfA,EAAGlmB,SAA2Boc,EAAS8J,GAA2BvB,SAASuB,EAAI9hC,EAAQ,GAA1C8hC,EAAGlmB,QAAQ5b,MCGzD,GADS,GAAM,GAAI,GCkBnB,GALcs3B,SAAQ,SAASyR,UAAUvK,EAAMsD,EAAIkH,GAChE,OAAO1H,SAAQ,SAAU5d,GACvB,OAAO8b,cAAchB,EAAM9a,EAAGslB,KAC7BlH,MCfU,GANWxK,SAAQ,SAAS2R,OAAOtV,EAAKgQ,EAAKtM,GAC1D1D,EAAMA,EAAM0D,EAAKn3B,QAAUyzB,GAAO,EAAIA,EAAM0D,EAAKn3B,OACjD,IAAI2P,EAASlI,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAE9C,OADAxnB,EAAOmZ,OAAO2K,EAAK,EAAGgQ,GACf9zB,KCDM,GAJcynB,SAAQ,SAAS4R,UAAUvV,EAAKwV,EAAM9R,GAEjE,OADA1D,EAAMA,EAAM0D,EAAKn3B,QAAUyzB,GAAO,EAAIA,EAAM0D,EAAKn3B,OAC1C,GAAG4H,OAAOH,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,EAAG1D,GAAMwV,EAAMxhC,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM1D,OCgBpG,SAASyV,SAASnP,EAAMoP,EAAWt1B,GACjC,IACIu1B,EADA/lC,SAAc02B,EAElB,OAAQ12B,GACN,IAAK,SACL,IAAK,SAEH,OAAa,IAAT02B,GAAc,EAAIA,IAAU8E,MAC1BhrB,EAAIw1B,OAAO,QAGTF,IACFt1B,EAAIw1B,OAAO,OAAQ,IAEd,GAIY,OAAnBx1B,EAAIy1B,WACFH,GACFC,EAAWv1B,EAAIy1B,WAAWnhC,KAC1B0L,EAAIy1B,WAAW9T,IAAIuE,GACTlmB,EAAIy1B,WAAWnhC,OACNihC,GAEZv1B,EAAIy1B,WAAWnmC,IAAI42B,GAGtB12B,KAAQwQ,EAAIw1B,OAMPtP,KAAQlmB,EAAIw1B,OAAOhmC,KAGxB8lC,IACFt1B,EAAIw1B,OAAOhmC,GAAM02B,IAAQ,IAEpB,IAXHoP,IACFt1B,EAAIw1B,OAAOhmC,GAAQ,GACnBwQ,EAAIw1B,OAAOhmC,GAAM02B,IAAQ,IAEpB,GAWb,IAAK,UAGH,GAAI12B,KAAQwQ,EAAIw1B,OAAQ,CACtB,IAAIE,EAAOxP,EAAO,EAAI,EACtB,QAAIlmB,EAAIw1B,OAAOhmC,GAAMkmC,KAGfJ,IACFt1B,EAAIw1B,OAAOhmC,GAAMkmC,IAAQ,IAEpB,GAMT,OAHIJ,IACFt1B,EAAIw1B,OAAOhmC,GAAQ02B,EAAO,EAAC,GAAO,GAAQ,EAAC,GAAM,KAE5C,EAGX,IAAK,WAEH,OAAuB,OAAnBlmB,EAAIy1B,WACFH,GACFC,EAAWv1B,EAAIy1B,WAAWnhC,KAC1B0L,EAAIy1B,WAAW9T,IAAIuE,GACTlmB,EAAIy1B,WAAWnhC,OACNihC,GAEZv1B,EAAIy1B,WAAWnmC,IAAI42B,GAGtB12B,KAAQwQ,EAAIw1B,SAMb9I,UAAUxG,EAAMlmB,EAAIw1B,OAAOhmC,MAC1B8lC,GACFt1B,EAAIw1B,OAAOhmC,GAAMiG,KAAKywB,IAEjB,IATHoP,IACFt1B,EAAIw1B,OAAOhmC,GAAQ,CAAC02B,KAEf,GAWb,IAAK,YACH,QAAIlmB,EAAIw1B,OAAOhmC,KAGT8lC,IACFt1B,EAAIw1B,OAAOhmC,IAAQ,IAEd,GAGX,IAAK,SACH,GAAa,OAAT02B,EACF,QAAKlmB,EAAIw1B,OAAa,OAChBF,IACFt1B,EAAIw1B,OAAa,MAAI,IAEhB,GAKb,QAIE,OADAhmC,EAAOtF,OAAOoB,UAAUmJ,SAAS9K,KAAKu8B,MACxBlmB,EAAIw1B,SAOb9I,UAAUxG,EAAMlmB,EAAIw1B,OAAOhmC,MAC1B8lC,GACFt1B,EAAIw1B,OAAOhmC,GAAMiG,KAAKywB,IAEjB,IAVHoP,IACFt1B,EAAIw1B,OAAOhmC,GAAQ,CAAC02B,KAEf,IAcA,OA1KS,WACtB,SAASyP,OAEPjnC,KAAK+mC,WAA4B,mBAARG,IAAqB,IAAIA,IAAQ,KAC1DlnC,KAAK8mC,OAAS,GA6BhB,OAtBAG,KAAKrqC,UAAUq2B,IAAM,SAAUuE,GAC7B,OAAQmP,SAASnP,GAAM,EAAMx3B,OAO/BinC,KAAKrqC,UAAUgE,IAAM,SAAU42B,GAC7B,OAAOmP,SAASnP,GAAM,EAAOx3B,OAaxBinC,KAjCe,GCmCT,GAhBWpU,SAAQ,SAASsU,OAAOpnC,EAAI60B,GAMpD,IALA,IAGIwS,EAAa5P,EAHblmB,EAAM,IAAI,GACVlE,EAAS,GACT8jB,EAAM,EAGHA,EAAM0D,EAAKn3B,QAEhB2pC,EAAcrnC,EADdy3B,EAAO5C,EAAK1D,IAER5f,EAAI2hB,IAAImU,IACVh6B,EAAOrG,KAAKywB,GAEdtG,GAAO,EAET,OAAO9jB,KCdM,GADS,GAAO,ICchB,GAXiBylB,SAAQ,SAASwU,aAAaC,EAAOC,GACnE,IAAIC,EAAYC,EAQhB,OAPIH,EAAM7pC,OAAS8pC,EAAM9pC,QACvB+pC,EAAaF,EACbG,EAAeF,IAEfC,EAAaD,EACbE,EAAeH,GAEV,GAAKzI,QAAQ,GAAKb,UAAL,CAAgBwJ,GAAaC,OCEpC,GAdgB5U,QAAsBqJ,gBAAgB,eAAe,SAASwL,YAAYC,EAAW/S,GAIlH,IAHA,IAAI3zB,EAAM,GACNiwB,EAAM,EACNzzB,EAASm3B,EAAKn3B,OACXyzB,EAAMzzB,GACPyzB,IAAQzzB,EAAS,EACnBwD,EAAI8F,KAAK6tB,EAAK1D,IAEdjwB,EAAI8F,KAAK6tB,EAAK1D,GAAMyW,GAEtBzW,GAAO,EAET,OAAOjwB,MC9BM,sDCCA,SAAS2mC,cAAcrqC,GACpC,GAAc,MAAVA,EACF,MAAM,IAAIF,UAAU,8CAMtB,IAHA,IAAIwqC,EAASrsC,OAAO+B,GAChB2zB,EAAM,EACNzzB,EAASyC,UAAUzC,OAChByzB,EAAMzzB,GAAQ,CACnB,IAAIsD,EAASb,UAAUgxB,GACvB,GAAc,MAAVnwB,EACF,IAAK,IAAI+mC,KAAW/mC,EACdk2B,KAAK6Q,EAAS/mC,KAChB8mC,EAAOC,GAAW/mC,EAAO+mC,IAI/B5W,GAAO,EAET,OAAO2W,GCKM,GALUhV,SAAQ,SAASkV,MAAM1rC,EAAKgP,GACnD,IAAIpO,EAAM,GAEV,OADAA,EAAIZ,GAAOgP,EACJpO,KCnBL+qC,GAAgB,CAClB,oBAAqB9iC,MACrB,oBAAqB,SAAUm6B,EAAIpe,GAEjC,OADAoe,EAAGt4B,KAAKka,GACDoe,GAET,sBAAuB2G,WAErBiC,GAAiB,CACnB,oBAAqBp8B,OACrB,oBAAqB,SAAU7J,EAAGC,GAChC,OAAOD,EAAIC,GAEb,sBAAuB+jC,WAErBkC,GAAiB,CACnB,oBAAqB1sC,OACrB,oBAAqB,SAAU4R,EAAQwoB,GACrC,OAAOuS,GAAQ/6B,EAAQ,EAAawoB,GAAS,GAAMA,EAAM,GAAIA,EAAM,IAAMA,IAE3E,sBAAuBoQ,WCkBzB,IAGe,GAHSnR,SAAQ,SAASuT,KAAKhS,EAAKd,EAAIV,GACrD,OAAOO,eAAeiB,GAAOQ,QAAQtB,EAAGc,GAAMA,EAAI,uBAAwBxB,GAAQgC,QAAQtB,EDhB7E,SAAS+S,SAASprC,GAC/B,GAAIk4B,eAAel4B,GACjB,OAAOA,EAET,GAAI,EAAaA,GACf,OAAO+qC,GAET,GAAmB,iBAAR/qC,EACT,OAAOgrC,GAET,GAAmB,iBAARhrC,EACT,OAAOirC,GAET,MAAM,IAAIhiC,MAAM,iCAAmCjJ,GCG0CorC,CAASjS,IAAOqF,OAAOrF,EAAK,GAAI,IAAI,GAAQxB,MCJ5H,GAfWlC,SAAQ,SAAS4V,OAAOrrC,GAMhD,IALA,IAAIO,EAAQ,EAAKP,GACbyI,EAAMlI,EAAMC,OACZyzB,EAAM,EACNjwB,EAAM,GAEHiwB,EAAMxrB,GAAK,CAChB,IAAIrJ,EAAMmB,EAAM0zB,GACZ7lB,EAAMpO,EAAIZ,GACVu4B,EAAOqC,KAAK5rB,EAAKpK,GAAOA,EAAIoK,GAAOpK,EAAIoK,GAAO,GAClDupB,EAAKA,EAAKn3B,QAAUpB,EACpB60B,GAAO,EAET,OAAOjwB,KCIM,GAbcyxB,SAAQ,SAAS6V,UAAUtrC,GAMtD,IALA,IAAIO,EAAQ,EAAKP,GACbyI,EAAMlI,EAAMC,OACZyzB,EAAM,EACNjwB,EAAM,GAEHiwB,EAAMxrB,GAAK,CAChB,IAAIrJ,EAAMmB,EAAM0zB,GAChBjwB,EAAIhE,EAAIZ,IAAQA,EAChB60B,GAAO,EAET,OAAOjwB,KCAM,GATY4xB,SAAQ,SAAS2V,QAAQvO,EAAO1V,GACzD,OAAO,EAAO0V,EAAQ,GAAG,WACvB,IAAI18B,EAAS2C,UAAU+5B,GACvB,GAAc,MAAV18B,GAAkBw8B,YAAYx8B,EAAOgnB,IACvC,OAAOhnB,EAAOgnB,GAAQpkB,MAAM5C,EAAQ2H,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,EAAG+5B,IAE/E,MAAM,IAAI58B,UAAU,GAASE,GAAU,kCAAoCgnB,EAAS,WCVzE,GAHOsO,SAAQ,SAASte,GAAGk0B,EAAMp9B,GAC9C,OAAc,MAAPA,GAAeA,EAAI3M,cAAgB+pC,GAAQp9B,aAAeo9B,KCEpD,GAHY/V,SAAQ,SAASgW,QAAQznB,GAClD,OAAY,MAALA,GAAa,GAAOA,EAAG,GAAMA,OCJvB,GADS,GAAQ,EAAG,QCIpB,GALSyR,SAAQ,SAASiW,KAAKlI,GAC5C,OAAO,IAAS,WACd,OAAOv7B,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,KAC5CugC,MCQU,GARW/N,SAAQ,SAASkW,OAAO3rC,GAChD,IAAIi6B,EACAQ,EAAK,GACT,IAAKR,KAAQj6B,EACXy6B,EAAGA,EAAGj6B,QAAUy5B,EAElB,OAAOQ,KCQM,GAdgB7E,SAAQ,SAASgW,YAAYtrC,EAAQ8hC,GAClE,GAA8B,mBAAnBA,EAAGwJ,aAA+BtT,EAAS8J,GAE/C,CAEL,IADA,IAAInO,EAAMmO,EAAG5hC,OAAS,EACfyzB,GAAO,GAAG,CACf,GAAI,GAAOmO,EAAGnO,GAAM3zB,GAClB,OAAO2zB,EAETA,GAAO,EAET,OAAQ,EATR,OAAOmO,EAAGwJ,YAAYtrC,MCzBX,SAASurC,UAAU7nB,GAChC,MAA6C,oBAAtCzlB,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,GCiBxC,IAGe,GAHWyR,SAAQ,SAASj1B,OAAOm3B,GAChD,OAAe,MAARA,GAAgBkU,UAAUlU,EAAKn3B,QAAUm3B,EAAKn3B,OAASgrB,OCgBjD,GATSoK,SAAQ,SAASkW,KAAKztC,EAAQ0tC,GACpD,OAAO,SAAUC,GACf,OAAO,SAAU1rC,GACf,OAAO,GAAI,SAAU2rC,GACnB,OAAOF,EAAOE,EAAO3rC,KACpB0rC,EAAY3tC,EAAOiC,UCHb,GAHcm1B,SAAQ,SAASyW,UAAU5sC,GACtD,OAAO,GAAK,GAAIA,GAAI,GAAOA,OCMd,GAHam2B,SAAQ,SAAS0W,SAAStsC,GACpD,OAAO,GAAK,EAAKA,GAAI,GAAUA,OCFlB,GAHa41B,SAAQ,SAAS2W,SAASpkC,GACpD,OAAO,GAAK,EAAKA,GAAI,GAAMA,OCAd,GAHO4tB,SAAQ,SAAS5lB,GAAGjL,EAAGC,GAC3C,OAAOD,EAAIC,KCEE,GAHQ4wB,SAAQ,SAASzI,IAAIpoB,EAAGC,GAC7C,OAAOD,GAAKC,KCwBC,GAZa4yB,SAAQ,SAASyU,SAASvpC,EAAIq2B,EAAKxB,GAK7D,IAJA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACX2P,EAAS,GACTm8B,EAAQ,CAACnT,GACNlF,EAAMxrB,GACX6jC,EAAQxpC,EAAGwpC,EAAM,GAAI3U,EAAK1D,IAC1B9jB,EAAO8jB,GAAOqY,EAAM,GACpBrY,GAAO,EAET,MAAO,CAACqY,EAAM,GAAIn8B,MCIL,GAXkBynB,SAAQ,SAAS2U,cAAczpC,EAAIq2B,EAAKxB,GAIvE,IAHA,IAAI1D,EAAM0D,EAAKn3B,OAAS,EACpB2P,EAAS,GACTm8B,EAAQ,CAACnT,GACNlF,GAAO,GACZqY,EAAQxpC,EAAG60B,EAAK1D,GAAMqY,EAAM,IAC5Bn8B,EAAO8jB,GAAOqY,EAAM,GACpBrY,GAAO,EAET,MAAO,CAAC9jB,EAAQm8B,EAAM,OCjBT,GANkB1W,SAAQ,SAAS4W,cAAc1pC,EAAI9C,GAClE,OAAO25B,SAAQ,SAAUR,EAAK/5B,GAE5B,OADA+5B,EAAI/5B,GAAO0D,EAAG9C,EAAIZ,GAAMA,EAAKY,GACtBm5B,IACN,GAAI,EAAKn5B,OCHC,GAHU41B,SAAQ,SAAS5E,MAAMyb,EAAIjoB,GAClD,OAAOA,EAAIwM,MAAMyb,IAAO,MCqBX,GATY7W,SAAQ,SAAS8W,QAAQzuC,EAAG4B,GACrD,OAAK88B,GAAW1+B,IAGX0+B,GAAW98B,IAAMA,EAAI,EACjB2rB,KAEDvtB,EAAI4B,EAAIA,GAAKA,EALZ2rB,OCTI,GAHUoM,SAAQ,SAAS+U,MAAMhnC,EAAGZ,EAAGC,GACpD,OAAOW,EAAEX,GAAKW,EAAEZ,GAAKC,EAAID,KCRZ,GADQ,EAAO,EAAK,GCIpB,GAHS0wB,SAAQ,SAASmX,KAAKjV,GAC5C,OAAO,GAAIA,GAAQA,EAAKn3B,UCWX,GAXWi1B,SAAQ,SAASoX,OAAOlV,GAChD,IAAIlvB,EAAMkvB,EAAKn3B,OACf,GAAY,IAARiI,EACF,OAAO+iB,IAET,IAAIshB,EAAQ,EAAIrkC,EAAM,EAClBwrB,GAAOxrB,EAAMqkC,GAAS,EAC1B,OAAO,GAAK7kC,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAAG1E,MAAK,SAAUluB,EAAGC,GAChE,OAAOD,EAAIC,GAAK,EAAID,EAAIC,EAAI,EAAI,KAC/B2E,MAAMsqB,EAAKA,EAAM6Y,OCcP,GAVgBlX,SAAQ,SAASmX,YAAYC,EAAKlqC,GAC/D,IAAI2R,EAAQ,GACZ,OAAO8hB,OAAOzzB,EAAGtC,QAAQ,WACvB,IAAIpB,EAAM4tC,EAAI9pC,MAAMH,KAAME,WAI1B,OAHK+2B,KAAK56B,EAAKqV,KACbA,EAAMrV,GAAO0D,EAAGI,MAAMH,KAAME,YAEvBwR,EAAMrV,SCNF,GAHY,IAAY,WACrC,OAAO,GAAS6D,cCHH,GAHU2yB,SAAQ,SAASqX,MAAMnvC,EAAGa,GACjD,OAAOusC,GAAQ,GAAIptC,EAAGa,MCJT,GAHa82B,SAAQ,SAASyX,SAASvV,GACpD,OAAOuT,GAAQhoC,MAAM,KAAM,CAAC,IAAIkF,OAAOuvB,OCyB1B,GAlBiBC,SAAQ,SAASuV,aAAarqC,EAAIhF,EAAGa,GACnE,IACIqJ,EADAmI,EAAS,GAGb,IAAKnI,KAAKlK,EACJk8B,KAAKhyB,EAAGlK,KACVqS,EAAOnI,GAAKgyB,KAAKhyB,EAAGrJ,GAAKmE,EAAGkF,EAAGlK,EAAEkK,GAAIrJ,EAAEqJ,IAAMlK,EAAEkK,IAInD,IAAKA,KAAKrJ,EACJq7B,KAAKhyB,EAAGrJ,KAAOq7B,KAAKhyB,EAAGmI,KACzBA,EAAOnI,GAAKrJ,EAAEqJ,IAIlB,OAAOmI,KCHM,GATqBynB,SAAQ,SAASwV,iBAAiBtqC,EAAIuqC,EAAMC,GAC9E,OAAO,IAAa,SAAUtlC,EAAGulC,EAAMC,GACrC,OAAI3L,UAAU0L,IAAS1L,UAAU2L,GACxBJ,iBAAiBtqC,EAAIyqC,EAAMC,GAE3B1qC,EAAGkF,EAAGulC,EAAMC,KAEpBH,EAAMC,MCVI,GALkB1X,SAAQ,SAAS6X,cAAcJ,EAAMC,GACpE,OAAO,IAAiB,SAAUtlC,EAAGulC,EAAMC,GACzC,OAAOD,IACNF,EAAMC,MCEI,GALmB1X,SAAQ,SAAS8X,eAAeL,EAAMC,GACtE,OAAO,IAAiB,SAAUtlC,EAAGulC,EAAMC,GACzC,OAAOA,IACNH,EAAMC,MCQI,GALkB1V,SAAQ,SAAS+V,cAAc7qC,EAAIuqC,EAAMC,GACxE,OAAO,IAAiB,SAAUtlC,EAAGulC,EAAMC,GACzC,OAAO1qC,EAAGyqC,EAAMC,KACfH,EAAMC,MCFI,GALc1V,SAAQ,SAASgW,UAAU9qC,EAAIhF,EAAGa,GAC7D,OAAO,IAAa,SAAUkvC,EAAGC,EAAIC,GACnC,OAAOjrC,EAAGgrC,EAAIC,KACbjwC,EAAGa,MCPO,GAHQi3B,SAAQ,SAAS/d,IAAI9S,EAAGC,GAC7C,OAAOA,EAAID,EAAIC,EAAID,KCSN,GAHU6yB,SAAQ,SAASoW,MAAMroC,EAAGZ,EAAGC,GACpD,OAAOW,EAAEX,GAAKW,EAAEZ,GAAKC,EAAID,KCGZ,GAHW6wB,SAAQ,SAAShI,OAAO7oB,EAAGC,GACnD,OAAOD,EAAIC,KCHE,GAHa4wB,SAAQ,SAAS7L,SAAShlB,EAAGC,GACvD,OAAOD,EAAIC,KCJE,GAHWywB,SAAQ,SAASwY,OAAO3uC,GAChD,OAAQA,KCaK,GADSs2B,QAAsB+L,YAA0BxJ,cAAc,CAAC,OAAQ,EAAO,KCDvF,GANW1C,SAAQ,SAASyY,OAAO5uC,GAEhD,OAAO,EADKA,EAAI,EAAI,EAAIA,EAAI,GACP,WACnB,OAAO,GAAIA,EAAG2D,iBCKH,GAHM20B,SAAQ,SAASt5B,EAAEqH,EAAGsP,EAAG+O,GAC5C,OAAOre,EAAEsP,EAAE+O,OC5BE,SAASmqB,IAAInqB,GAC1B,MAAO,CAACA,GCoBV,IACe,GADOyR,QAAQ0Y,KCef,GAlBSvY,SAAQ,SAASwY,KAAK12B,EAAO1X,GAMnD,IALA,IAAImQ,EAAS,GACTlB,EAAQ,GACRglB,EAAM,EACNxrB,EAAMiP,EAAMlX,OAETyzB,EAAMxrB,GACXwG,EAAMyI,EAAMuc,IAAQ,EACpBA,GAAO,EAGT,IAAK,IAAIgG,KAAQj6B,EACViP,EAAMrP,eAAeq6B,KACxB9pB,EAAO8pB,GAAQj6B,EAAIi6B,IAGvB,OAAO9pB,KCAM,GAZSslB,SAAQ,SAASnX,KAAKxb,GAC5C,IACIqN,EADAk+B,GAAS,EAEb,OAAO9X,OAAOzzB,EAAGtC,QAAQ,WACvB,OAAI6tC,EACKl+B,GAETk+B,GAAS,EACTl+B,EAASrN,EAAGI,MAAMH,KAAME,kBC1BxBqrC,SAAW,SAAUtqB,GACvB,MAAO,CAAEllB,MAAOklB,EAAG7b,IAAK,SAAUxC,GAC9B,OAAO2oC,SAAS3oC,EAAEqe,OAkCT,GARS4T,SAAQ,SAAS2W,KAAKzC,EAAMnmC,EAAGqe,GAIrD,OAAO8nB,GAAK,SAAU7nB,GACpB,OAAOqqB,SAAS3oC,EAAEse,MADb6nB,CAEJ9nB,GAAGllB,SCjBO,GAHS82B,SAAQ,SAAS6M,KAAK+L,EAAKC,GACjD,MAAO,CAACD,EAAKC,MChBA,SAASC,yBAAyBtmC,GAC/C,OAAOwtB,SAAQ,SAAU9yB,EAAIE,GAC3B,OAAOuzB,OAAOlxB,KAAKgf,IAAI,EAAGvhB,EAAGtC,OAASwC,EAAKxC,SAAS,WAClD,OAAOsC,EAAGI,MAAMH,KAAMqF,EAAOpF,EAAMC,kBCyBzC,IACe,GADYyrC,yBAAyBxY,SCFrC,GADiBwY,yBAAuC,GAAKxY,UCC7D,GADc,GAAK,CAAC,GAAQ,KCG5B,GAHW0B,SAAQ,SAAS+W,OAAOC,EAAOxgC,EAAKpO,GAC5D,OAAO,GAAO,EAAK4uC,EAAO5uC,GAAMoO,MCHnB,GAHWwpB,SAAQ,SAASiX,OAAO1wC,EAAG0B,EAAGG,GACtD,OAAO,GAAU7B,EAAG,EAAK0B,EAAGG,OCCf,GAHkB43B,SAAQ,SAASkX,cAAchQ,EAAMiQ,EAAU/uC,GAC9E,OAAO+uC,EAASvuC,OAAS,GAAKs+B,EAAK,EAAKiQ,EAAU/uC,OCQrC,GAXS41B,SAAQ,SAASoZ,KAAKt3B,EAAO1X,GAGnD,IAFA,IAAImQ,EAAS,GACT8jB,EAAM,EACHA,EAAMvc,EAAMlX,QACbkX,EAAMuc,KAAQj0B,IAChBmQ,EAAOuH,EAAMuc,IAAQj0B,EAAI0X,EAAMuc,KAEjCA,GAAO,EAET,OAAO9jB,KCEM,GAXYylB,SAAQ,SAASqZ,QAAQv3B,EAAO1X,GAIzD,IAHA,IAAImQ,EAAS,GACT8jB,EAAM,EACNxrB,EAAMiP,EAAMlX,OACTyzB,EAAMxrB,GAAK,CAChB,IAAIrK,EAAOsZ,EAAMuc,GACjB9jB,EAAO/R,GAAQ4B,EAAI5B,GACnB61B,GAAO,EAET,OAAO9jB,KCEM,GATWylB,SAAQ,SAASsZ,OAAOz5B,EAAMzV,GACtD,IAAImQ,EAAS,GACb,IAAK,IAAI8pB,KAAQj6B,EACXyV,EAAKzV,EAAIi6B,GAAOA,EAAMj6B,KACxBmQ,EAAO8pB,GAAQj6B,EAAIi6B,IAGvB,OAAO9pB,KCQM,SAASg/B,QACtB,GAAyB,IAArBlsC,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,wCAElB,OAAOu2B,SAASt8B,MAAMH,KAAM,GAAQE,YCrBtC,IAGe,GAHY2yB,SAAQ,SAASwZ,QAAQrT,EAAIpE,GACtD,OAAOzB,QAAQ,CAAC6F,GAAKpE,MCFR,GADY,EAAO,GAAU,GCyB7B,GAXY/B,SAAQ,SAASyZ,QAAQvsC,EAAIwsC,GACtD,OAAO,EAAOA,EAAa9uC,QAAQ,WAGjC,IAFA,IAAIwC,EAAO,GACPixB,EAAM,EACHA,EAAMqb,EAAa9uC,QACxBwC,EAAK8G,KAAKwlC,EAAarb,GAAKj2B,KAAK+E,KAAME,UAAUgxB,KACjDA,GAAO,EAET,OAAOnxB,EAAGI,MAAMH,KAAMC,EAAKoF,OAAOH,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAWqsC,EAAa9uC,gBCf1E,GADY,GAAQq4B,KAAM,CAAC,GAAS,KCOpC,GAHWjB,SAAQ,SAAS2X,OAAOnxC,EAAMgQ,EAAKpO,GAC3D,OAAO,GAAOoO,EAAKpO,EAAI5B,OCHV,GAHWw5B,SAAQ,SAAS4X,OAAO3rC,EAAMzF,EAAM4B,GAC5D,OAAO,GAAG6D,EAAM7D,EAAI5B,OCQP,GAHWw5B,SAAQ,SAAS6X,OAAOrhC,EAAKvO,EAAGG,GACxD,OAAc,MAAPA,GAAeg6B,KAAKn6B,EAAGG,GAAOA,EAAIH,GAAKuO,KCNjC,GAHkBwpB,SAAQ,SAAS8X,cAAc5Q,EAAM1gC,EAAM4B,GAC1E,OAAO8+B,EAAK9+B,EAAI5B,OCYH,GAZUw3B,SAAQ,SAASr1B,MAAMovC,EAAI3vC,GAKlD,IAJA,IAAIyI,EAAMknC,EAAGnvC,OACTwD,EAAM,GACNiwB,EAAM,EAEHA,EAAMxrB,GACXzE,EAAIiwB,GAAOj0B,EAAI2vC,EAAG1b,IAClBA,GAAO,EAGT,OAAOjwB,KCDM,GAZU4xB,SAAQ,SAASga,MAAM1nC,EAAM2nC,GACpD,IAAMhE,UAAU3jC,KAAS2jC,UAAUgE,GACjC,MAAM,IAAIzvC,UAAU,2CAItB,IAFA,IAAI+P,EAAS,GACT7Q,EAAI4I,EACD5I,EAAIuwC,GACT1/B,EAAOrG,KAAKxK,GACZA,GAAK,EAEP,OAAO6Q,KCuBM,GARgBynB,SAAQ,SAASkY,YAAYhtC,EAAIq2B,EAAKxB,GAEnE,IADA,IAAI1D,EAAM0D,EAAKn3B,OAAS,EACjByzB,GAAO,GACZkF,EAAMr2B,EAAG60B,EAAK1D,GAAMkF,GACpBlF,GAAO,EAET,OAAOkF,KCZM,GALgBjC,QAAQ,EAAG,IAAI,SAAS6Y,aAAajR,EAAMh8B,EAAIiC,EAAG4yB,GAC/E,OAAOgC,SAAQ,SAAUR,EAAKnV,GAC5B,OAAO8a,EAAK3F,EAAKnV,GAAKlhB,EAAGq2B,EAAKnV,GAAKwU,SAASW,KAC3Cp0B,EAAG4yB,MCRO,GADYlC,QAAQ+C,UCapB,GAfU5C,SAAQ,SAASlJ,MAAM5pB,EAAIxD,GAClD,IAEIq4B,EAFAlvB,EAAMwtB,OAAO32B,GACb20B,EAAM,EAGV,GAAIxrB,EAAM,GAAK8F,MAAM9F,GACnB,MAAM,IAAIoB,WAAW,mCAGvB,IADA8tB,EAAO,IAAI1vB,MAAMQ,GACVwrB,EAAMxrB,GACXkvB,EAAK1D,GAAOnxB,EAAGmxB,GACfA,GAAO,EAET,OAAO0D,KCRM,GAHW/B,SAAQ,SAASoa,OAAOlxC,EAAOQ,GACvD,OAAO,GAAM,EAAOR,GAAQQ,MCHf,GAHYs4B,SAAQ,SAASjR,QAAQkK,EAAOof,EAAazrB,GACtE,OAAOA,EAAImC,QAAQkK,EAAOof,MCWb,GAXSrY,SAAQ,SAASsY,KAAKptC,EAAIq2B,EAAKxB,GAIrD,IAHA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACX2P,EAAS,CAACgpB,GACPlF,EAAMxrB,GACX0wB,EAAMr2B,EAAGq2B,EAAKxB,EAAK1D,IACnB9jB,EAAO8jB,EAAM,GAAKkF,EAClBlF,GAAO,EAET,OAAO9jB,KCGM,GALaylB,SAAQ,SAASua,SAASC,EAAIC,GACxD,MAAuC,mBAAzBA,EAAYF,SAA0BE,EAAYF,SAASC,GAAM,IAAY,SAAUpsB,EAAGmV,GACtG,OAAO,EAAG,EAAI,GAASnV,GAAImV,KAC1BiX,EAAG,IAAKC,MCJE,GAHQzY,SAAQ,SAASvjB,IAAIy3B,EAAMvjB,EAAGvE,GACnD,OAAO,GAAK8nB,EAAM,EAAOvjB,GAAIvE,MCFhB,GAHS4R,SAAQ,SAAS3C,KAAK4L,EAAYlH,GACxD,OAAO1vB,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAAG1E,KAAK4L,MCkBnC,GAPWjJ,SAAQ,SAAS0a,OAAOxtC,EAAI60B,GACpD,OAAO1vB,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAAG1E,MAAK,SAAUluB,EAAGC,GAC3D,IAAIq3B,EAAKv5B,EAAGiC,GACRu3B,EAAKx5B,EAAGkC,GACZ,OAAOq3B,EAAKC,GAAM,EAAID,EAAKC,EAAK,EAAI,QCOzB,GAXa1G,SAAQ,SAAS2a,SAAS/M,EAAK7L,GACzD,OAAO1vB,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAAG1E,MAAK,SAAUluB,EAAGC,GAG3D,IAFA,IAAImL,EAAS,EACTtS,EAAI,EACU,IAAXsS,GAAgBtS,EAAI2lC,EAAIhjC,QAC7B2P,EAASqzB,EAAI3lC,GAAGkH,EAAGC,GACnBnH,GAAK,EAEP,OAAOsS,QCnBI,GADU,GAAQ,EAAG,SCGrB,GAHYylB,SAAQ,SAAS4a,QAAQvhC,EAAOrB,GACzD,MAAO,CAAC,GAAM,EAAGqB,EAAOrB,GAAQ,GAAMqB,EAAO,GAAOrB,GAAQA,OCQ/C,GAXegoB,SAAQ,SAAS6a,WAAWnxC,EAAGq4B,GAC3D,GAAIr4B,GAAK,EACP,MAAM,IAAI2J,MAAM,2DAIlB,IAFA,IAAIkH,EAAS,GACT8jB,EAAM,EACHA,EAAM0D,EAAKn3B,QAChB2P,EAAOrG,KAAK,GAAMmqB,EAAKA,GAAO30B,EAAGq4B,IAEnC,OAAOxnB,KCIM,GAZcylB,SAAQ,SAAS8a,UAAU5R,EAAMnH,GAK5D,IAJA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACXmwC,EAAS,GAEN1c,EAAMxrB,IAAQq2B,EAAKnH,EAAK1D,KAC7B0c,EAAO7mC,KAAK6tB,EAAK1D,IACjBA,GAAO,EAGT,MAAO,CAAC0c,EAAQ1oC,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM1D,OCLpC,GAHe2B,SAAQ,SAAU+a,EAAQhZ,GACtD,OAAO,GAAO,GAAKgZ,EAAOnwC,OAAQm3B,GAAOgZ,MCI5B,GAHa/a,SAAQ,SAASlL,SAAS3lB,EAAGC,GACvD,OAAOixB,OAAOlxB,GAAKkxB,OAAOjxB,MCDb,GAHwB4wB,SAAQ,SAASgb,oBAAoBvG,EAAOC,GACjF,OAAO,GAAO,GAAWD,EAAOC,GAAQ,GAAWA,EAAOD,OCM7C,GAH4BzS,SAAQ,SAASiZ,wBAAwB/R,EAAMuL,EAAOC,GAC/F,OAAO,GAAO,GAAexL,EAAMuL,EAAOC,GAAQ,GAAexL,EAAMwL,EAAOD,OCQjE,GAPkBzU,SAAQ,SAASkb,cAAchuC,EAAIs/B,GAElE,IADA,IAAInO,EAAMmO,EAAG5hC,OAAS,EACfyzB,GAAO,GAAKnxB,EAAGs/B,EAAGnO,KACvBA,GAAO,EAET,OAAO,GAAMA,EAAM,EAAGoL,IAAU+C,MC7B9B,GAA0B,WAC5B,SAAS2O,WAAWprC,EAAG0yB,GACrBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EAQX,OANAorC,WAAWpxC,UAAU,qBAAuB+4B,EAAQ3lB,KACpDg+B,WAAWpxC,UAAU,uBAAyB+4B,EAAQvoB,OACtD4gC,WAAWpxC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAC5D,OAAO51B,KAAK4C,EAAEgzB,GAAS51B,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,GAASH,SAASroB,IAGzE4gC,WAXqB,GCsCf,GARcnb,QAAsBuC,cAAc,CAAC,aDhBnCvC,SAAQ,SAASob,YAAYrrC,EAAG0yB,GAC7D,OAAO,IAAI,GAAW1yB,EAAG0yB,OCekE,SAAS4Y,UAAUnuC,EAAIs/B,GAGlH,IAFA,IAAInO,EAAM,EACNxrB,EAAM25B,EAAG5hC,OACNyzB,EAAMxrB,GAAO3F,EAAGs/B,EAAGnO,KACxBA,GAAO,EAET,OAAO,GAAM,EAAGA,EAAKmO,OCrCnB,GAAoB,WACtB,SAAS8O,KAAKvrC,EAAG0yB,GACft1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EASX,OAPAurC,KAAKvxC,UAAU,qBAAuB+4B,EAAQ3lB,KAC9Cm+B,KAAKvxC,UAAU,uBAAyB+4B,EAAQvoB,OAChD+gC,KAAKvxC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAEtD,OADA51B,KAAK4C,EAAEgzB,GACA51B,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,IAGvCuY,KAZe,GCyBT,GAJQtb,QAAsBuC,cAAc,GDNlCvC,SAAQ,SAASub,MAAMxrC,EAAG0yB,GACjD,OAAO,IAAI,GAAK1yB,EAAG0yB,OCKiD,SAAS+Y,IAAItuC,EAAIkhB,GAErF,OADAlhB,EAAGkhB,GACIA,MCJT,IAMe,GANS4R,SAAQ,SAASngB,KAAK4oB,EAAS7Z,GACrD,ICvBa,SAAS6sB,UAAUrtB,GAChC,MAA6C,oBAAtCzlB,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,GDsBjCqtB,CAAUhT,GACb,MAAM,IAAIj+B,UAAU,0EAA4E,GAASi+B,IAE3G,OAAOD,aAAaC,GAAS5oB,KAAK+O,MERrB,GADY,GAAQ,EAAG,eCavB,GATYiR,SAAQ,SAAS6b,QAAQtxC,GAClD,IAAIwiC,EAAQ,GACZ,IAAK,IAAIvI,KAAQj6B,EACXg6B,KAAKC,EAAMj6B,KACbwiC,EAAMA,EAAMhiC,QAAU,CAACy5B,EAAMj6B,EAAIi6B,KAGrC,OAAOuI,KCEM,GAPc/M,SAAQ,SAAS8b,UAAUvxC,GACtD,IAAIwiC,EAAQ,GACZ,IAAK,IAAIvI,KAAQj6B,EACfwiC,EAAMA,EAAMhiC,QAAU,CAACy5B,EAAMj6B,EAAIi6B,IAEnC,OAAOuI,KCVM,GADY,GAAQ,EAAG,eCqCvB,GAHc,EAAO,GAAG,SAASgP,UAAUnZ,EAAIv1B,EAAIq2B,EAAKxB,GACrE,OAAOgC,QAAQtB,EAAiB,mBAAPv1B,EAAoBs2B,OAAOt2B,GAAMA,GAAKq2B,EAAKxB,MCTvD,GAjBclC,SAAQ,SAASgc,UAAUC,GAGtD,IAFA,IAAI7zC,EAAI,EACJsS,EAAS,GACNtS,EAAI6zC,EAAUlxC,QAAQ,CAG3B,IAFA,IAAImxC,EAAYD,EAAU7zC,GACtB6L,EAAI,EACDA,EAAIioC,EAAUnxC,aACM,IAAd2P,EAAOzG,KAChByG,EAAOzG,GAAK,IAEdyG,EAAOzG,GAAGI,KAAK6nC,EAAUjoC,IACzBA,GAAK,EAEP7L,GAAK,EAEP,OAAOsS,KCRM,GAHaynB,SAAQ,SAASga,SAASxB,EAAIzqC,EAAG0qC,GAC3D,MAAuD,mBAAzCA,EAAY,yBAA0CA,EAAY,yBAAyB1qC,EAAGyqC,GAAM,GAASA,EAAI,EAAIzqC,EAAG0qC,OC7BpIwB,GAAK,iDA0BM,GADSpc,QAvB4B,mBAA1B7mB,OAAOjP,UAAUmyC,OAgBDD,GAAGC,QAjB7B,IAiBgEA,OAI5E,SAASA,KAAKttB,GAChB,OAAOA,EAAIstB,QAL4E,SAASA,KAAKttB,GACrG,IAAIutB,EAAU,IAAIzoC,OAAO,KAAOuoC,GAAK,KAAOA,GAAK,MAC7CG,EAAQ,IAAI1oC,OAAO,IAAMuoC,GAAK,KAAOA,GAAK,OAC9C,OAAOrtB,EAAImC,QAAQorB,EAAS,IAAIprB,QAAQqrB,EAAO,MCWlC,GATapc,SAAQ,SAASqc,UAAUC,EAAOC,GAC5D,OAAO5b,OAAO2b,EAAM1xC,QAAQ,WAC1B,IACE,OAAO0xC,EAAMhvC,MAAMH,KAAME,WACzB,MAAO6C,GACP,OAAOqsC,EAAQjvC,MAAMH,KAAMmzB,QAAQ,CAACpwB,GAAI7C,mBCC/B,GALYwyB,SAAQ,SAAS2c,QAAQtvC,GAClD,OAAO,WACL,OAAOA,EAAGmF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,QCMrC,GAHUwyB,SAAQ,SAAS4c,MAAMvvC,GAC9C,OAAO,GAAK,EAAGA,MCKF,GAfa8yB,SAAQ,SAAS0c,SAASC,EAAOzvC,GAC3D,OAAO,EAAOyvC,GAAO,WAKnB,IAJA,IAGIC,EAHAC,EAAe,EACf3zC,EAAQgE,EACRmxB,EAAM,EAEHwe,GAAgBF,GAA0B,mBAAVzzC,GACrC0zC,EAASC,IAAiBF,EAAQtvC,UAAUzC,OAASyzB,EAAMn1B,EAAM0B,OACjE1B,EAAQA,EAAMoE,MAAMH,KAAMkF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAWgxB,EAAKue,IACrEC,GAAgB,EAChBxe,EAAMue,EAER,OAAO1zC,QCEI,GATW82B,SAAQ,SAAS8c,OAAO5vC,EAAI6vC,GAGpD,IAFA,IAAIlQ,EAAO3/B,EAAG6vC,GACVxiC,EAAS,GACNsyB,GAAQA,EAAKjiC,QAClB2P,EAAOA,EAAO3P,QAAUiiC,EAAK,GAC7BA,EAAO3/B,EAAG2/B,EAAK,IAEjB,OAAOtyB,KCXM,GADUylB,QAAsB2J,QAAQ,GAAMrJ,UCiB9C,GAdaN,SAAQ,SAASgd,SAAS9T,EAAMnH,GAK1D,IAJA,IAGI4C,EAHAtG,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACX2P,EAAS,GAEN8jB,EAAMxrB,GAENq3B,cAAchB,EADnBvE,EAAO5C,EAAK1D,GACmB9jB,KAC7BA,EAAOA,EAAO3P,QAAU+5B,GAE1BtG,GAAO,EAET,OAAO9jB,KCRM,GAHcynB,SAAQ,SAASib,UAAU/T,EAAMuL,EAAOC,GACnE,OAAO,GAASxL,EAAM5I,QAAQmU,EAAOC,OCExB,GAHW1S,SAAQ,SAASkb,OAAOhU,EAAMiU,EAAa/uB,GACnE,OAAO8a,EAAK9a,GAAKA,EAAI+uB,EAAY/uB,MCNpB,GADW,GAAM+kB,WCQjB,GAPUnR,SAAQ,SAASob,MAAMlU,EAAMh8B,EAAIiQ,GAExD,IADA,IAAI3E,EAAM2E,GACF+rB,EAAK1wB,IACXA,EAAMtL,EAAGsL,GAEX,OAAOA,KCKM,GARaqnB,SAAQ,SAASwd,SAASjzC,GACpD,IAAIi6B,EACAiZ,EAAK,GACT,IAAKjZ,KAAQj6B,EACXkzC,EAAGA,EAAG1yC,QAAUR,EAAIi6B,GAEtB,OAAOiZ,KC1BLC,MAAQ,SAAUnvB,GACpB,MAAO,CAAEllB,MAAOklB,EAAG,mBAAoB,WACnC,OAAOjhB,QA8BE,GALS6yB,SAAQ,SAASwd,KAAKtH,EAAM9nB,GAGlD,OAAO8nB,EAAKqH,MAALrH,CAAY9nB,GAAGllB,SCAT,GAHS84B,SAAQ,SAASyb,KAAKvU,EAAMwU,EAAYtvB,GAC9D,OAAO8a,EAAK9a,GAAKsvB,EAAWtvB,GAAKA,KCepB,GARU4R,SAAQ,SAAS2d,MAAMrX,EAAMsX,GACpD,IAAK,IAAIvZ,KAAQiC,EACf,GAAIlC,KAAKC,EAAMiC,KAAUA,EAAKjC,GAAMuZ,EAAQvZ,IAC1C,OAAO,EAGX,OAAO,KCRM,GAHYrE,SAAQ,SAAS6d,QAAQvX,EAAMsX,GACxD,OAAO,GAAM,EAAI,GAAQtX,GAAOsX,MCPnB,GAHY5d,SAAQ,SAAUwM,EAAIzK,GAC/C,OAAO,GAAO,GAAKoJ,UAAL,CAAgBqB,GAAKzK,MCYtB,GAjBU/B,SAAQ,SAAS8d,MAAM3uC,EAAGC,GAOjD,IALA,IAEI0E,EAFAuqB,EAAM,EACNyJ,EAAO34B,EAAEvE,OAETi9B,EAAOz4B,EAAExE,OACT2P,EAAS,GACN8jB,EAAMyJ,GAAM,CAEjB,IADAh0B,EAAI,EACGA,EAAI+zB,GACTttB,EAAOA,EAAO3P,QAAU,CAACuE,EAAEkvB,GAAMjvB,EAAE0E,IACnCA,GAAK,EAEPuqB,GAAO,EAET,OAAO9jB,KCJM,GAVQylB,SAAQ,SAAS+d,IAAI5uC,EAAGC,GAI7C,IAHA,IAAI4uC,EAAK,GACL3f,EAAM,EACNxrB,EAAMpD,KAAKwS,IAAI9S,EAAEvE,OAAQwE,EAAExE,QACxByzB,EAAMxrB,GACXmrC,EAAG3f,GAAO,CAAClvB,EAAEkvB,GAAMjvB,EAAEivB,IACrBA,GAAO,EAET,OAAO2f,KCAM,GAVWhe,SAAQ,SAASie,OAAO1oC,EAAMmO,GAItD,IAHA,IAAI2a,EAAM,EACNxrB,EAAMpD,KAAKwS,IAAI1M,EAAK3K,OAAQ8Y,EAAO9Y,QACnCwD,EAAM,GACHiwB,EAAMxrB,GACXzE,EAAImH,EAAK8oB,IAAQ3a,EAAO2a,GACxBA,GAAO,EAET,OAAOjwB,KCSM,GAVY4zB,SAAQ,SAASkc,QAAQhxC,EAAIiC,EAAGC,GAIzD,IAHA,IAAI4uC,EAAK,GACL3f,EAAM,EACNxrB,EAAMpD,KAAKwS,IAAI9S,EAAEvE,OAAQwE,EAAExE,QACxByzB,EAAMxrB,GACXmrC,EAAG3f,GAAOnxB,EAAGiC,EAAEkvB,GAAMjvB,EAAEivB,IACvBA,GAAO,EAET,OAAO2f,M,8IClCT,SACA,QAYA,YACA,YACA,YACA,YACA,YACA,YACA,Y,+mBAEe,CACbG,UAAW,mBAAS/4B,EAAT,GAA2D,YAAxCg5B,eAAwC,MAA9B,UAA8B,MAAnBC,eAAmB,SAC9DC,EAAoB,CACxBC,MAAOjuC,EAAQ,KACfkuC,QAASluC,EAAQ,MAGnB,IACEguC,EAAkBG,QAAUnuC,EAAQ,KACpC,MAAO/C,IAIT,IAAMmxC,EAAwB,WAAXN,EAAuB,UAAYA,EAEhDO,GAAY,qBACfC,MAAM,CACLC,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,WAAYia,GAC9BQ,IAAKxuC,EAAQ,QAHC,eAKfyuC,MAAM,CACLF,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,WAAYia,GAC9BQ,IAAKxuC,EAAQ,OAPC,GAWZ0uC,EAAe,eAAH,qBACfC,QAAQ,CACPJ,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,SAAUia,GAE5BQ,IAAKxuC,EAAQ,QAJC,eAMf4uC,qBAAqB,CACpBL,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,sBAAuBia,GACzCQ,IAAKxuC,EAAQ,QARC,eAUf6uC,UAAU,CACTN,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,WAAYia,GAC9BQ,IAAKxuC,EAAQ,QAZC,eAcf8uC,gBAAgB,CACfP,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,iBAAkBia,GACpCQ,IAAKxuC,EAAQ,QAhBC,eAkBf+uC,QAAQ,CACPR,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,SAAUia,GAC5BQ,IAAKxuC,EAAQ,OApBC,GAsBbquC,GAsCL,OAnCoB,cAAH,iBACZv5B,GADY,IAEfk6B,mBAAoB,CAClB,QACA,YACA,mBACA,aACA,cACA,MACA,SAEFC,MAAO,CAACC,WACRC,UAAW,CAACC,WACZC,iBAAkB,CAACC,WACnBC,WAAY,CAACC,WACbC,YAAa,CAACC,UAAoB,CAAE3B,YACpC4B,IAAK,CAACC,WACNC,MAAO,CAACC,WACRC,cAAe,CAAErB,gBACjBsB,MAAO,CACLC,MAAO,CACL,CACEC,SAAU/yC,MACV0S,OAAQ1S,MAAI0S,OACZ0+B,QAASP,EAAkBI,GAAY+B,SAEzC,CACED,SAAU7yC,MACVwS,OAAQxS,MAAIwS,OACZ0+B,QAASP,EAAkBI,GAAY/wC,W,6BCrGnD,EAAQ,KACRjG,EAAOD,QAAU,EAAQ,GAAuBkB,OAAO+3C,Q,gBCAvD,IAAI1yC,EAAU,EAAQ,IAEtBA,EAAQA,EAAQU,EAAIV,EAAQM,EAAG,SAAU,CAAEoyC,OAAQ,EAAQ,Q,cCH3Dh5C,EAAOD,QAAU,SAAU4I,GACzB,GAAiB,mBAANA,EAAkB,MAAM7F,UAAU6F,EAAK,uBAClD,OAAOA,I,gBCAT,IAAIswC,EAAc,EAAQ,IACtBC,EAAU,EAAQ,IAClBC,EAAO,EAAQ,IACft8B,EAAM,EAAQ,IACdrC,EAAW,EAAQ,IACnBjR,EAAU,EAAQ,IAClB6vC,EAAUn4C,OAAO+3C,OAGrBh5C,EAAOD,SAAWq5C,GAAW,EAAQ,GAAR,EAAoB,WAC/C,IAAIC,EAAI,GACJjyC,EAAI,GAEJJ,EAAI1F,SACJg4C,EAAI,uBAGR,OAFAD,EAAEryC,GAAK,EACPsyC,EAAEvtC,MAAM,IAAIG,SAAQ,SAAUxB,GAAKtD,EAAEsD,GAAKA,KACd,GAArB0uC,EAAQ,GAAIC,GAAGryC,IAAW/F,OAAO4M,KAAKurC,EAAQ,GAAIhyC,IAAIqF,KAAK,KAAO6sC,KACtE,SAASN,OAAOh2C,EAAQwD,GAM3B,IALA,IAAI+yC,EAAI/+B,EAASxX,GACbw2C,EAAO7zC,UAAUzC,OACjByO,EAAQ,EACR8nC,EAAaN,EAAK9wC,EAClBqxC,EAAS78B,EAAIxU,EACVmxC,EAAO7nC,GAMZ,IALA,IAII7P,EAJAkF,EAAIuC,EAAQ5D,UAAUgM,MACtB9D,EAAO4rC,EAAaP,EAAQlyC,GAAG8D,OAAO2uC,EAAWzyC,IAAMkyC,EAAQlyC,GAC/D9D,EAAS2K,EAAK3K,OACdkJ,EAAI,EAEDlJ,EAASkJ,GACdtK,EAAM+L,EAAKzB,KACN6sC,IAAeS,EAAOh5C,KAAKsG,EAAGlF,KAAMy3C,EAAEz3C,GAAOkF,EAAElF,IAEtD,OAAOy3C,GACPH,G,gBCnCJ,IAAIl/B,EAAY,EAAQ,IACpBy/B,EAAW,EAAQ,IACnBC,EAAkB,EAAQ,KAC9B55C,EAAOD,QAAU,SAAU85C,GACzB,OAAO,SAAUC,EAAOrb,EAAIoD,GAC1B,IAGIrgC,EAHA8G,EAAI4R,EAAU4/B,GACd52C,EAASy2C,EAASrxC,EAAEpF,QACpByO,EAAQioC,EAAgB/X,EAAW3+B,GAIvC,GAAI22C,GAAepb,GAAMA,GAAI,KAAOv7B,EAASyO,GAG3C,IAFAnQ,EAAQ8G,EAAEqJ,OAEGnQ,EAAO,OAAO,OAEtB,KAAM0B,EAASyO,EAAOA,IAAS,IAAIkoC,GAAeloC,KAASrJ,IAC5DA,EAAEqJ,KAAW8sB,EAAI,OAAOob,GAAeloC,GAAS,EACpD,OAAQkoC,IAAgB,K,gBCpB9B,IAAIv/B,EAAY,EAAQ,IACpByM,EAAMhf,KAAKgf,IACXxM,EAAMxS,KAAKwS,IACfva,EAAOD,QAAU,SAAU4R,EAAOzO,GAEhC,OADAyO,EAAQ2I,EAAU3I,IACH,EAAIoV,EAAIpV,EAAQzO,EAAQ,GAAKqX,EAAI5I,EAAOzO,K,gBCLzD,EAAQ,KACRlD,EAAOD,QAAU,EAAQ,GAAuBkB,OAAO0C,gB,gBCAvD,IAAI6W,EAAW,EAAQ,IACnBu/B,EAAkB,EAAQ,IAE9B,EAAQ,IAAR,CAAyB,kBAAkB,WACzC,OAAO,SAASp2C,eAAegF,GAC7B,OAAOoxC,EAAgBv/B,EAAS7R,S,gBCLpC,IAAIrC,EAAU,EAAQ,IAClBzC,EAAO,EAAQ,GACfm2C,EAAQ,EAAQ,IACpBh6C,EAAOD,QAAU,SAAUk6C,EAAK3wC,GAC9B,IAAI9D,GAAM3B,EAAK5C,QAAU,IAAIg5C,IAAQh5C,OAAOg5C,GACxChoB,EAAM,GACVA,EAAIgoB,GAAO3wC,EAAK9D,GAChBc,EAAQA,EAAQU,EAAIV,EAAQM,EAAIozC,GAAM,WAAcx0C,EAAG,MAAQ,SAAUysB,K,gBCR3EjyB,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAAuC4B,YAAY,I,gBCAzF,EAAQ,IACR,EAAQ,IACR3B,EAAOD,QAAU,EAAQ,IAA0BsI,EAAE,a,gBCFrD,IAAIiS,EAAY,EAAQ,IACpB9Q,EAAU,EAAQ,IAGtBxJ,EAAOD,QAAU,SAAUm6C,GACzB,OAAO,SAAUrpC,EAAMutB,GACrB,IAGI32B,EAAGC,EAHHlF,EAAI8O,OAAO9H,EAAQqH,IACnBtQ,EAAI+Z,EAAU8jB,GACd59B,EAAIgC,EAAEU,OAEV,OAAI3C,EAAI,GAAKA,GAAKC,EAAU05C,EAAY,QAAKp0C,GAC7C2B,EAAIjF,EAAEgkB,WAAWjmB,IACN,OAAUkH,EAAI,OAAUlH,EAAI,IAAMC,IAAMkH,EAAIlF,EAAEgkB,WAAWjmB,EAAI,IAAM,OAAUmH,EAAI,MACxFwyC,EAAY13C,EAAEkJ,OAAOnL,GAAKkH,EAC1ByyC,EAAY13C,EAAE6J,MAAM9L,EAAGA,EAAI,GAA2BmH,EAAI,OAAzBD,EAAI,OAAU,IAAqB,S,gBCb5E,IAAI5F,EAAS,EAAQ,IACjBsB,EAAa,EAAQ,IACrB8X,EAAiB,EAAQ,IACzBW,EAAoB,GAGxB,EAAQ,GAAR,CAAmBA,EAAmB,EAAQ,EAAR,CAAkB,aAAa,WAAc,OAAOnW,QAE1FzF,EAAOD,QAAU,SAAU8C,EAAayY,EAAMC,GAC5C1Y,EAAYR,UAAYR,EAAO+Z,EAAmB,CAAEL,KAAMpY,EAAW,EAAGoY,KACxEN,EAAepY,EAAayY,EAAO,e,gBCXrC,IAAIlT,EAAK,EAAQ,IACbH,EAAW,EAAQ,IACnBixC,EAAU,EAAQ,IAEtBl5C,EAAOD,QAAU,EAAQ,IAAoBkB,OAAOk5C,iBAAmB,SAASA,iBAAiB7xC,EAAGsK,GAClG3K,EAASK,GAKT,IAJA,IAGIpB,EAHA2G,EAAOqrC,EAAQtmC,GACf1P,EAAS2K,EAAK3K,OACd3C,EAAI,EAED2C,EAAS3C,GAAG6H,EAAGC,EAAEC,EAAGpB,EAAI2G,EAAKtN,KAAMqS,EAAW1L,IACrD,OAAOoB,I,gBCXT,IAAIiK,EAAW,EAAQ,IAAaA,SACpCvS,EAAOD,QAAUwS,GAAYA,EAAS6nC,iB,gBCAtC,IAAIC,EAAmB,EAAQ,KAC3Bt3B,EAAO,EAAQ,KACfhI,EAAY,EAAQ,IACpBb,EAAY,EAAQ,IAMxBla,EAAOD,QAAU,EAAQ,GAAR,CAA0B4K,MAAO,SAAS,SAAU4G,EAAUuK,GAC7ErW,KAAK+L,GAAK0I,EAAU3I,GACpB9L,KAAKgM,GAAK,EACVhM,KAAK60C,GAAKx+B,KAET,WACD,IAAIxT,EAAI7C,KAAK+L,GACTsK,EAAOrW,KAAK60C,GACZ3oC,EAAQlM,KAAKgM,KACjB,OAAKnJ,GAAKqJ,GAASrJ,EAAEpF,QACnBuC,KAAK+L,QAAK1L,EACHid,EAAK,IAEaA,EAAK,EAApB,QAARjH,EAA+BnK,EACvB,UAARmK,EAAiCxT,EAAEqJ,GACxB,CAACA,EAAOrJ,EAAEqJ,OACxB,UAGHoJ,EAAUw/B,UAAYx/B,EAAUpQ,MAEhC0vC,EAAiB,QACjBA,EAAiB,UACjBA,EAAiB,Y,cCjCjBr6C,EAAOD,QAAU,c,cCAjBC,EAAOD,QAAU,SAAUqF,EAAM5D,GAC/B,MAAO,CAAEA,MAAOA,EAAO4D,OAAQA,K,gBCDjCpF,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAA8B4B,YAAY,I,gBCAhF,EAAQ,KACR,EAAQ,KACR,EAAQ,KACR,EAAQ,KACR3B,EAAOD,QAAU,EAAQ,GAAuBuB,Q,gBCFhD,IAAI4E,EAAS,EAAQ,IACjBG,EAAM,EAAQ,IACd4yC,EAAc,EAAQ,IACtB3yC,EAAU,EAAQ,IAClBwU,EAAW,EAAQ,IACnB0/B,EAAO,EAAQ,KAAWP,IAC1BQ,EAAS,EAAQ,IACjBvpC,EAAS,EAAQ,IACjB+J,EAAiB,EAAQ,IACzBxW,EAAM,EAAQ,IACdi2C,EAAM,EAAQ,GACdvnC,EAAS,EAAQ,IACjBwnC,EAAY,EAAQ,IACpBC,EAAW,EAAQ,KACnBj4B,EAAU,EAAQ,KAClB1a,EAAW,EAAQ,IACnBS,EAAW,EAAQ,IACnB8R,EAAW,EAAQ,IACnBN,EAAY,EAAQ,IACpB/R,EAAc,EAAQ,IACtBkB,EAAa,EAAQ,IACrBwxC,EAAU,EAAQ,IAClBC,EAAU,EAAQ,KAClBC,EAAQ,EAAQ,IAChBC,EAAQ,EAAQ,IAChBC,EAAM,EAAQ,IACdttC,EAAQ,EAAQ,IAChBmP,EAAOi+B,EAAM1yC,EACbD,EAAK6yC,EAAI5yC,EACT6yC,EAAOJ,EAAQzyC,EACf+K,EAAUlN,EAAO5E,OACjB65C,EAAQj1C,EAAOk1C,KACfC,EAAaF,GAASA,EAAMG,UAE5BC,EAASb,EAAI,WACbc,EAAed,EAAI,eACnBhB,EAAS,GAAG1rC,qBACZytC,EAAiBvqC,EAAO,mBACxBwqC,EAAaxqC,EAAO,WACpByqC,EAAYzqC,EAAO,cACnBuJ,EAAcxZ,OAAgB,UAC9B26C,EAA+B,mBAAXxoC,KAA2B4nC,EAAM3yC,EACrDwzC,EAAU31C,EAAO21C,QAEjBpN,GAAUoN,IAAYA,EAAiB,YAAMA,EAAiB,UAAEC,UAGhEC,EAAgB9C,GAAewB,GAAO,WACxC,OAES,GAFFI,EAAQzyC,EAAG,GAAI,IAAK,CACzBhH,IAAK,WAAc,OAAOgH,EAAG3C,KAAM,IAAK,CAAEjE,MAAO,IAAKiG,MACpDA,KACD,SAAUkB,EAAI7G,EAAKk6C,GACtB,IAAIC,EAAYn/B,EAAKrC,EAAa3Y,GAC9Bm6C,UAAkBxhC,EAAY3Y,GAClCsG,EAAGO,EAAI7G,EAAKk6C,GACRC,GAAatzC,IAAO8R,GAAarS,EAAGqS,EAAa3Y,EAAKm6C,IACxD7zC,EAEAuc,KAAO,SAAU3R,GACnB,IAAIkpC,EAAMR,EAAW1oC,GAAO6nC,EAAQznC,EAAiB,WAErD,OADA8oC,EAAI5B,GAAKtnC,EACFkpC,GAGLvkB,EAAWikB,GAAyC,iBAApBxoC,EAAQ3K,SAAuB,SAAUE,GAC3E,MAAoB,iBAANA,GACZ,SAAUA,GACZ,OAAOA,aAAcyK,GAGnB+oC,GAAkB,SAASj7C,eAAeyH,EAAI7G,EAAKk6C,GAKrD,OAJIrzC,IAAO8R,GAAa0hC,GAAgBR,EAAW75C,EAAKk6C,GACxD/zC,EAASU,GACT7G,EAAMqG,EAAYrG,GAAK,GACvBmG,EAAS+zC,GACL31C,EAAIq1C,EAAY55C,IACbk6C,EAAE76C,YAIDkF,EAAIsC,EAAI4yC,IAAW5yC,EAAG4yC,GAAQz5C,KAAM6G,EAAG4yC,GAAQz5C,IAAO,GAC1Dk6C,EAAInB,EAAQmB,EAAG,CAAE76C,WAAYkI,EAAW,GAAG,OAJtChD,EAAIsC,EAAI4yC,IAASnzC,EAAGO,EAAI4yC,EAAQlyC,EAAW,EAAG,KACnDV,EAAG4yC,GAAQz5C,IAAO,GAIXi6C,EAAcpzC,EAAI7G,EAAKk6C,IACzB5zC,EAAGO,EAAI7G,EAAKk6C,IAEnBI,GAAoB,SAASjC,iBAAiBxxC,EAAIzB,GACpDe,EAASU,GAKT,IAJA,IAGI7G,EAHA+L,EAAO+sC,EAAS1zC,EAAIgT,EAAUhT,IAC9B3G,EAAI,EACJC,EAAIqN,EAAK3K,OAEN1C,EAAID,GAAG47C,GAAgBxzC,EAAI7G,EAAM+L,EAAKtN,KAAM2G,EAAEpF,IACrD,OAAO6G,GAKL0zC,GAAwB,SAASruC,qBAAqBlM,GACxD,IAAIw6C,EAAI5C,EAAOh5C,KAAK+E,KAAM3D,EAAMqG,EAAYrG,GAAK,IACjD,QAAI2D,OAASgV,GAAepU,EAAIq1C,EAAY55C,KAASuE,EAAIs1C,EAAW75C,QAC7Dw6C,IAAMj2C,EAAIZ,KAAM3D,KAASuE,EAAIq1C,EAAY55C,IAAQuE,EAAIZ,KAAM81C,IAAW91C,KAAK81C,GAAQz5C,KAAOw6C,IAE/FC,GAA4B,SAAShlC,yBAAyB5O,EAAI7G,GAGpE,GAFA6G,EAAKuR,EAAUvR,GACf7G,EAAMqG,EAAYrG,GAAK,GACnB6G,IAAO8R,IAAepU,EAAIq1C,EAAY55C,IAASuE,EAAIs1C,EAAW75C,GAAlE,CACA,IAAIk6C,EAAIl/B,EAAKnU,EAAI7G,GAEjB,OADIk6C,IAAK31C,EAAIq1C,EAAY55C,IAAUuE,EAAIsC,EAAI4yC,IAAW5yC,EAAG4yC,GAAQz5C,KAAOk6C,EAAE76C,YAAa,GAChF66C,IAELQ,GAAuB,SAAS5/B,oBAAoBjU,GAKtD,IAJA,IAGI7G,EAHAsY,EAAQ8gC,EAAKhhC,EAAUvR,IACvBkK,EAAS,GACTtS,EAAI,EAED6Z,EAAMlX,OAAS3C,GACf8F,EAAIq1C,EAAY55C,EAAMsY,EAAM7Z,OAASuB,GAAOy5C,GAAUz5C,GAAO04C,GAAM3nC,EAAOrG,KAAK1K,GACpF,OAAO+Q,GAEP4pC,GAAyB,SAASrrC,sBAAsBzI,GAM1D,IALA,IAII7G,EAJA46C,EAAQ/zC,IAAO8R,EACfL,EAAQ8gC,EAAKwB,EAAQf,EAAYzhC,EAAUvR,IAC3CkK,EAAS,GACTtS,EAAI,EAED6Z,EAAMlX,OAAS3C,IAChB8F,EAAIq1C,EAAY55C,EAAMsY,EAAM7Z,OAAUm8C,IAAQr2C,EAAIoU,EAAa3Y,IAAc+Q,EAAOrG,KAAKkvC,EAAW55C,IACxG,OAAO+Q,GAIN+oC,IAYH9gC,GAXA1H,EAAU,SAAS9R,SACjB,GAAImE,gBAAgB2N,EAAS,MAAMtQ,UAAU,gCAC7C,IAAIkQ,EAAMvO,EAAIkB,UAAUzC,OAAS,EAAIyC,UAAU,QAAKG,GAChD62C,KAAO,SAAUn7C,GACfiE,OAASgV,GAAakiC,KAAKj8C,KAAKi7C,EAAWn6C,GAC3C6E,EAAIZ,KAAM81C,IAAWl1C,EAAIZ,KAAK81C,GAASvoC,KAAMvN,KAAK81C,GAAQvoC,IAAO,GACrE+oC,EAAct2C,KAAMuN,EAAK3J,EAAW,EAAG7H,KAGzC,OADIy3C,GAAexK,GAAQsN,EAActhC,EAAazH,EAAK,CAAE5P,cAAc,EAAM2T,IAAK4lC,OAC/Eh4B,KAAK3R,KAEY,UAAG,YAAY,SAASxH,WAChD,OAAO/F,KAAK60C,MAGdS,EAAM1yC,EAAIk0C,GACVtB,EAAI5yC,EAAI8zC,GACR,EAAQ,IAAkB9zC,EAAIyyC,EAAQzyC,EAAIm0C,GAC1C,EAAQ,IAAiBn0C,EAAIg0C,GAC7BrB,EAAM3yC,EAAIo0C,GAENxD,IAAgB,EAAQ,KAC1Bn+B,EAASL,EAAa,uBAAwB4hC,IAAuB,GAGvElpC,EAAO9K,EAAI,SAAUvH,GACnB,OAAO6jB,KAAK+1B,EAAI55C,MAIpBwF,EAAQA,EAAQQ,EAAIR,EAAQgB,EAAIhB,EAAQM,GAAKg1C,EAAY,CAAEt6C,OAAQ8R,IAEnE,IAAK,IAAIwpC,GAAa,iHAGpB7wC,MAAM,KAAMK,GAAI,EAAGwwC,GAAW15C,OAASkJ,IAAGsuC,EAAIkC,GAAWxwC,OAE3D,IAAK,IAAIywC,GAAmBlvC,EAAM+sC,EAAIl2C,OAAQkG,GAAI,EAAGmyC,GAAiB35C,OAASwH,IAAIiwC,EAAUkC,GAAiBnyC,OAE9GpE,EAAQA,EAAQU,EAAIV,EAAQM,GAAKg1C,EAAY,SAAU,CAErD,IAAO,SAAU95C,GACf,OAAOuE,EAAIo1C,EAAgB35C,GAAO,IAC9B25C,EAAe35C,GACf25C,EAAe35C,GAAOsR,EAAQtR,IAGpCg7C,OAAQ,SAASA,OAAOZ,GACtB,IAAKvkB,EAASukB,GAAM,MAAMp5C,UAAUo5C,EAAM,qBAC1C,IAAK,IAAIp6C,KAAO25C,EAAgB,GAAIA,EAAe35C,KAASo6C,EAAK,OAAOp6C,GAE1Ei7C,UAAW,WAActO,GAAS,GAClCuO,UAAW,WAAcvO,GAAS,KAGpCnoC,EAAQA,EAAQU,EAAIV,EAAQM,GAAKg1C,EAAY,SAAU,CAErD/5C,OA/FY,SAASA,OAAO8G,EAAIzB,GAChC,YAAapB,IAANoB,EAAkB2zC,EAAQlyC,GAAMyzC,GAAkBvB,EAAQlyC,GAAKzB,IAgGtEhG,eAAgBi7C,GAEhBhC,iBAAkBiC,GAElB7kC,yBAA0BglC,GAE1B3/B,oBAAqB4/B,GAErBprC,sBAAuBqrC,KAKzB,IAAIQ,GAAsBxC,GAAO,WAAcO,EAAM3yC,EAAE,MAEvD/B,EAAQA,EAAQU,EAAIV,EAAQM,EAAIq2C,GAAqB,SAAU,CAC7D7rC,sBAAuB,SAASA,sBAAsBzI,GACpD,OAAOqyC,EAAM3yC,EAAEmS,EAAS7R,OAK5BwyC,GAAS70C,EAAQA,EAAQU,EAAIV,EAAQM,IAAMg1C,GAAcnB,GAAO,WAC9D,IAAIzzC,EAAIoM,IAIR,MAA0B,UAAnBioC,EAAW,CAACr0C,KAA2C,MAAxBq0C,EAAW,CAAE5zC,EAAGT,KAAyC,MAAzBq0C,EAAWp6C,OAAO+F,QACrF,OAAQ,CACXs0C,UAAW,SAASA,UAAU3yC,GAI5B,IAHA,IAEIu0C,EAAUC,EAFVz3C,EAAO,CAACiD,GACRpI,EAAI,EAEDoF,UAAUzC,OAAS3C,GAAGmF,EAAK8G,KAAK7G,UAAUpF,MAEjD,GADA48C,EAAYD,EAAWx3C,EAAK,IACvBgD,EAASw0C,SAAoBp3C,IAAP6C,KAAoBgvB,EAAShvB,GAMxD,OALKga,EAAQu6B,KAAWA,EAAW,SAAUp7C,EAAKN,GAEhD,GADwB,mBAAb27C,IAAyB37C,EAAQ27C,EAAUz8C,KAAK+E,KAAM3D,EAAKN,KACjEm2B,EAASn2B,GAAQ,OAAOA,IAE/BkE,EAAK,GAAKw3C,EACH7B,EAAWz1C,MAAMu1C,EAAOz1C,MAKnC0N,EAAiB,UAAEooC,IAAiB,EAAQ,GAAR,CAAmBpoC,EAAiB,UAAGooC,EAAcpoC,EAAiB,UAAErC,SAE5GkK,EAAe7H,EAAS,UAExB6H,EAAelT,KAAM,QAAQ,GAE7BkT,EAAe/U,EAAOk1C,KAAM,QAAQ,I,gBCrPpC,IAAIZ,EAAO,EAAQ,GAAR,CAAkB,QACzB9xC,EAAW,EAAQ,IACnBrC,EAAM,EAAQ,IACd+2C,EAAU,EAAQ,IAAgB/0C,EAClC2B,EAAK,EACLqzC,EAAep8C,OAAOo8C,cAAgB,WACxC,OAAO,GAELC,GAAU,EAAQ,GAAR,EAAoB,WAChC,OAAOD,EAAap8C,OAAOs8C,kBAAkB,QAE3CC,QAAU,SAAU70C,GACtBy0C,EAAQz0C,EAAI6xC,EAAM,CAAEh5C,MAAO,CACzBjB,EAAG,OAAQyJ,EACXyzC,EAAG,OAgCHC,EAAO19C,EAAOD,QAAU,CAC1Bk6C,IAAKO,EACLmD,MAAM,EACNC,QAhCY,SAAUj1C,EAAI9G,GAE1B,IAAK6G,EAASC,GAAK,MAAoB,iBAANA,EAAiBA,GAAmB,iBAANA,EAAiB,IAAM,KAAOA,EAC7F,IAAKtC,EAAIsC,EAAI6xC,GAAO,CAElB,IAAK6C,EAAa10C,GAAK,MAAO,IAE9B,IAAK9G,EAAQ,MAAO,IAEpB27C,QAAQ70C,GAER,OAAOA,EAAG6xC,GAAMj6C,GAsBlBs9C,QApBY,SAAUl1C,EAAI9G,GAC1B,IAAKwE,EAAIsC,EAAI6xC,GAAO,CAElB,IAAK6C,EAAa10C,GAAK,OAAO,EAE9B,IAAK9G,EAAQ,OAAO,EAEpB27C,QAAQ70C,GAER,OAAOA,EAAG6xC,GAAMiD,GAYlBK,SATa,SAAUn1C,GAEvB,OADI20C,GAAUI,EAAKC,MAAQN,EAAa10C,KAAQtC,EAAIsC,EAAI6xC,IAAOgD,QAAQ70C,GAChEA,K,gBC3CT,IAAIuwC,EAAU,EAAQ,IAClBC,EAAO,EAAQ,IACft8B,EAAM,EAAQ,IAClB7c,EAAOD,QAAU,SAAU4I,GACzB,IAAIkK,EAASqmC,EAAQvwC,GACjB8wC,EAAaN,EAAK9wC,EACtB,GAAIoxC,EAKF,IAJA,IAGI33C,EAHAi8C,EAAUtE,EAAW9wC,GACrB+wC,EAAS78B,EAAIxU,EACb9H,EAAI,EAEDw9C,EAAQ76C,OAAS3C,GAAOm5C,EAAOh5C,KAAKiI,EAAI7G,EAAMi8C,EAAQx9C,OAAOsS,EAAOrG,KAAK1K,GAChF,OAAO+Q,I,gBCZX,IAAIwH,EAAM,EAAQ,IAClBra,EAAOD,QAAU4K,MAAMgY,SAAW,SAASA,QAAQ1d,GACjD,MAAmB,SAAZoV,EAAIpV,K,gBCFb,IAAIiV,EAAY,EAAQ,IACpBghC,EAAO,EAAQ,IAAkB7yC,EACjCmD,EAAW,GAAGA,SAEdwyC,EAA+B,iBAAV79C,QAAsBA,QAAUc,OAAO2b,oBAC5D3b,OAAO2b,oBAAoBzc,QAAU,GAUzCH,EAAOD,QAAQsI,EAAI,SAASuU,oBAAoBjU,GAC9C,OAAOq1C,GAAoC,mBAArBxyC,EAAS9K,KAAKiI,GATjB,SAAUA,GAC7B,IACE,OAAOuyC,EAAKvyC,GACZ,MAAOH,GACP,OAAOw1C,EAAY3xC,SAK0C4xC,CAAet1C,GAAMuyC,EAAKhhC,EAAUvR,M,gCCjBrG,EAAQ,GAAR,CAAyB,kB,gBCAzB,EAAQ,GAAR,CAAyB,e,gBCAzB3I,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAA+C4B,YAAY,I,gBCAjG,EAAQ,KACR3B,EAAOD,QAAU,EAAQ,GAAuBkB,OAAOyC,gB,gBCAvD,IAAI4C,EAAU,EAAQ,IACtBA,EAAQA,EAAQU,EAAG,SAAU,CAAEtD,eAAgB,EAAQ,KAAgBqT,O,gBCAvE,IAAIrO,EAAW,EAAQ,IACnBT,EAAW,EAAQ,IACnBi2C,MAAQ,SAAU51C,EAAGyT,GAEvB,GADA9T,EAASK,IACJI,EAASqT,IAAoB,OAAVA,EAAgB,MAAMjZ,UAAUiZ,EAAQ,8BAElE/b,EAAOD,QAAU,CACfgX,IAAK9V,OAAOyC,iBAAmB,aAAe,GAC5C,SAAUyU,EAAMgmC,EAAOpnC,GACrB,KACEA,EAAM,EAAQ,GAAR,CAAkBpP,SAASjH,KAAM,EAAQ,IAAkB2H,EAAEpH,OAAOoB,UAAW,aAAa0U,IAAK,IACnGoB,EAAM,IACVgmC,IAAUhmC,aAAgBxN,OAC1B,MAAOnC,GAAK21C,GAAQ,EACtB,OAAO,SAASz6C,eAAe4E,EAAGyT,GAIhC,OAHAmiC,MAAM51C,EAAGyT,GACLoiC,EAAO71C,EAAE1E,UAAYmY,EACpBhF,EAAIzO,EAAGyT,GACLzT,GAVX,CAYE,IAAI,QAASxC,GACjBo4C,MAAOA,Q,gBCvBTl+C,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAAqC4B,YAAY,I,gBCAvF,EAAQ,KACR,IAAIy8C,EAAU,EAAQ,GAAuBn9C,OAC7CjB,EAAOD,QAAU,SAAS8B,OAAOqF,EAAG80C,GAClC,OAAOoC,EAAQv8C,OAAOqF,EAAG80C,K,gBCH3B,IAAI11C,EAAU,EAAQ,IAEtBA,EAAQA,EAAQU,EAAG,SAAU,CAAEnF,OAAQ,EAAQ,O,gBCA/CZ,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAQ4Z,cAAgB5Z,EAAQqY,cAAWtS,EAE3C,IAEIu4C,EAAgB57C,uBAFA,EAAQ,MAMxB67C,EAAY77C,uBAFA,EAAQ,MAMpB4V,EAAW5V,uBAFD,EAAQ,KAMlBoR,EAAmBpR,uBAFD,EAAQ,KAM1B8V,EAA8B9V,uBAFA,EAAQ,KAMtC+V,EAAa/V,uBAFA,EAAQ,KAMrB6V,EAAmB7V,uBAFA,EAAQ,KAM3B87C,EAAgB97C,uBAFA,EAAQ,MAMxB+7C,EAAc/7C,uBAFD,EAAQ,MAIzB,SAASA,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAEvF,SAAS+7C,kBAAkB9lC,GACzB,GAAIA,aAAkBP,GAA0C,mBAAvBO,EAAO+lC,YAA4B,OAAO/lC,EAAO+lC,cAE1F,IAAIl9C,GAAQ,EAAIg9C,EAAYzlC,SAASJ,GACrC,GAAInX,EAAMyP,QAAS,MAAM,IAAItF,MAAM,WAAagN,EAAS,qBACzD,OAAOnX,EAGT,IAAI4W,EAAWrY,EAAQqY,SAAW,WAChC,SAASA,SAASO,GAChB,IAAIC,EAAQjT,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAChF,EAAI2S,EAAiBS,SAAStT,KAAM2S,UAEtB,QAAVQ,IAAiBA,GAAS,IAChB,QAAVA,IAAiBA,GAAS,IAChB,QAAVA,IAAiBA,GAAS,IAC9BnT,KAAKk5C,QAAU/lC,EAAQ6lC,kBAAkB9lC,GAAQoY,UAAUnY,GAAS6lC,kBAAkB9lC,GACtFlT,KAAKgT,OAAS,MA2ChB,OAxCA,EAAI8lC,EAAcxlC,SAASX,SAAU,CAAC,CACpCtW,IAAK,UACLN,MAAO,SAASo9C,QAAQC,GACtB,OAAOp5C,KAAKk5C,QAAQvuC,GAAGyuC,EAAMF,UAAYl5C,KAAKgT,QAAUomC,EAAMpmC,SAE/D,CACD3W,IAAK,WACLN,MAAO,SAASgK,WACd,IAAIszC,EAAWn5C,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,EAEnF,OAAOF,KAAKk5C,QAAQxtB,QAAQ2tB,GAAY,IAAMr5C,KAAKgT,SAEpD,CACD3W,IAAK,cACLN,MAAO,SAASk9C,cACd,OAAOj5C,KAAKk5C,UAEb,CACD78C,IAAK,WACLN,MAAO,SAAS4wB,WACd,OAAO3sB,KAAKk5C,QAAQvsB,aAErB,CACDtwB,IAAK,UACLN,MAAO,SAAS2vB,UACd,IAAIvY,EAAQjT,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,EAOhF,MALc,QAAViT,IAAiBA,EAAQ,IACf,QAAVA,IAAiBA,EAAQ,IACf,QAAVA,IAAiBA,EAAQ,IAGtBnT,KAAKk5C,QAAQ5tB,UAAUnY,GAAOyW,aAAamvB,EAAYzlC,QAAQyR,YAAY2G,YAEnF,CACDrvB,IAAK,aACLN,MAAO,SAASu9C,WAAWF,GACzB,OAAOp5C,KAAKgT,SAAWomC,EAAMpmC,WAG1BL,SApDyB,GA+D9BuB,EAAgB5Z,EAAQ4Z,cAAgB,SAAUb,GAGpD,SAASa,cAAchB,EAAQa,EAAWC,EAAab,IACrD,EAAIN,EAAiBS,SAAStT,KAAMkU,eAEpC,IAAI/K,GAAQ,EAAI2J,EAA4BQ,SAAStT,MAAOkU,cAAc/V,YAAa,EAAIiQ,EAAiBkF,SAASY,gBAAgBjZ,KAAK+E,KAAMkT,EAAQC,IAKxJ,OAHAhK,EAAM4K,UAAYA,EAClB5K,EAAM6K,YAAcA,EACpB7K,EAAM6J,OAASe,EAAUf,OAAS,IAAMgB,EAAYhB,OAC7C7J,EAGT,OAbA,EAAI4J,EAAWO,SAASY,cAAeb,GAahCa,cAdmC,CAe1CvB,GAuDF,SAAS4mC,mBAAmBh1B,EAAQi1B,GAClC,OAAO,SAAUJ,IAlDnB,SAASK,qBAAqBl1B,EAAQgQ,EAAMmlB,GAC1C,IAAKA,GAAmB,IAAVA,EACZ,MAAM,IAAIxzC,MAAM,sBAAwBquB,EAAKvhB,OAAS,IAAMuR,EAAS,0BAGvE,GAAMm1B,aAAiB/mC,IAAa4hB,EAAK+kB,WAAWI,GAApD,CAEA,GAAIA,aAAiBxlC,EAGnB,OAAQqQ,GACN,IAAK,QACH,GAAIgQ,EAAK+kB,WAAWI,EAAM1lC,aAAc,OACxC,MACF,IAAK,MACH,GAAIugB,EAAK+kB,WAAWI,EAAM3lC,WAAY,YAI1C,OAAQwQ,GAEN,IAAK,MACH,OAIN,MAAM,IAAIre,MAAM,sBAAwBquB,EAAKvhB,OAAS,IAAMuR,EAAS,IAAMm1B,EAAM1mC,SAyB/EymC,CAAqBl1B,EAAQvkB,KAAMo5C,GAEnC,IAAIO,EAAiBP,aAAiBzmC,EAAWymC,EAAMH,cAAgBG,EAEnEr9C,EAAQiE,KAAKi5C,cAAc10B,GAAQo1B,GACvC,OAAOH,EAAYz9C,EA3BvB,SAAS69C,kBAAkBr1B,EAAQgQ,EAAMmlB,EAAO39C,GAC9C,GAAI29C,aAAiBxlC,EACnB,OAAQqQ,GACN,IAAK,QACH,OAAO,IAAIm1B,EAAM3lC,UAAUhY,GAC7B,IAAK,MACH,OAAO,IAAI29C,EAAM1lC,YAAYjY,GAInC,OAAM29C,aAAiB/mC,IAAa4hB,EAAK+kB,WAAWI,GAO7C,IAAIxlC,EAAcnY,EAAOw4B,EAAK71B,YAAag7C,EAAMh7C,aANlD61B,aAAgBrgB,EACX,IAAIqgB,EAAK71B,YAAY3C,EAAOw4B,EAAKxgB,UAAWwgB,EAAKvgB,YAAaugB,EAAKphB,OAErE,IAAIohB,EAAK71B,YAAY3C,GAaD69C,CAAkBr1B,EAAQvkB,KAAMo5C,EAAOr9C,KAItE,EAAI6W,EAASU,SAASX,EAAS/V,UAhEX,CAAC,CAAC,OAAQ,OAAQ,CAAC,QAAS,OAAQ,CAAC,QAAS,eAAgB,OAAQ,CAAC,MAAO,aAAc,CAAC,cAgEzDk6B,QAAO,SAAU+Q,EAAQtvB,GAC/E,IAAIshC,GAAQ,EAAIhB,EAAUvlC,SAASiF,GAC/BgM,EAASs1B,EAAM,GACfC,EAAUD,EAAMjzC,MAAM,GAE1BihC,EAAOtjB,GAAUg1B,mBAAmBh1B,GACpC,IAAIw1B,GAA4B,EAC5BC,GAAoB,EACpBC,OAAiB55C,EAErB,IACE,IAAK,IAAqDod,EAAjDG,GAAY,EAAIg7B,EAActlC,SAASwmC,KAAmBC,GAA6Bt8B,EAAQG,EAAU9H,QAAQnW,MAAOo6C,GAA4B,EAAM,CAGjKlS,EAFYpqB,EAAM1hB,OAEF8rC,EAAOtjB,IAEzB,MAAOnkB,GACP45C,GAAoB,EACpBC,EAAiB75C,EACjB,QACA,KACO25C,GAA6Bn8B,EAAUs8B,QAC1Ct8B,EAAUs8B,SAEZ,QACA,GAAIF,EACF,MAAMC,GAKZ,OAAOpS,IACN,IA9FoB,CAAC,CAAC,aAAc,MAAO,CAAC,sBAAuB,OAAQ,CAAC,gBAAiB,MAAO,CAAC,yBAA0B,OAAQ,CAAC,OA8FlH/Q,QAAO,SAAU+Q,EAAQsS,GAChD,IAAIC,GAAQ,EAAIvB,EAAUvlC,SAAS6mC,GAC/B51B,EAAS61B,EAAM,GACfN,EAAUM,EAAMxzC,MAAM,GAE1BihC,EAAOtjB,GAAUg1B,mBAAmBh1B,GAAQ,GAC5C,IAAI81B,GAA6B,EAC7BC,GAAqB,EACrBC,OAAkBl6C,EAEtB,IACE,IAAK,IAAsDqe,EAAlDvJ,GAAa,EAAIyjC,EAActlC,SAASwmC,KAAoBO,GAA8B37B,EAASvJ,EAAWW,QAAQnW,MAAO06C,GAA6B,EAAM,CAGvKxS,EAFYnpB,EAAO3iB,OAEH8rC,EAAOtjB,IAEzB,MAAOnkB,GACPk6C,GAAqB,EACrBC,EAAkBn6C,EAClB,QACA,KACOi6C,GAA8BllC,EAAW+kC,QAC5C/kC,EAAW+kC,SAEb,QACA,GAAII,EACF,MAAMC,GAKZ,OAAO1S,IACN,M,gBCrQHttC,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAAoC4B,YAAY,I,gBCAtF,EAAQ,IACR,EAAQ,IACR3B,EAAOD,QAAU,EAAQ,M,gBCFzB,IAAIkI,EAAW,EAAQ,IACnB7G,EAAM,EAAQ,IAClBpB,EAAOD,QAAU,EAAQ,GAAWkgD,YAAc,SAAUt3C,GAC1D,IAAIu3C,EAAS9+C,EAAIuH,GACjB,GAAqB,mBAAVu3C,EAAsB,MAAMp9C,UAAU6F,EAAK,qBACtD,OAAOV,EAASi4C,EAAOx/C,KAAKiI,M,gBCJ9B,IAAI0R,EAAM,EAAQ,IACdtH,EAAM,EAAQ,EAAR,CAAkB,eAExBotC,EAAkD,aAA5C9lC,EAAI,WAAc,OAAO1U,UAArB,IASd3F,EAAOD,QAAU,SAAU4I,GACzB,IAAIL,EAAGixC,EAAGnyC,EACV,YAActB,IAAP6C,EAAmB,YAAqB,OAAPA,EAAc,OAEN,iBAApC4wC,EAVD,SAAU5wC,EAAI7G,GACzB,IACE,OAAO6G,EAAG7G,GACV,MAAO0G,KAOO43C,CAAO93C,EAAIrH,OAAO0H,GAAKoK,IAAoBwmC,EAEvD4G,EAAM9lC,EAAI/R,GAEM,WAAflB,EAAIiT,EAAI/R,KAAsC,mBAAZA,EAAE+3C,OAAuB,YAAcj5C,I,gBCnBhFrH,EAAQ4B,YAAa,EAErB,IAEI2+C,EAEJ,SAAS79C,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAF1ED,CAFD,EAAQ,MAMpB1C,EAAQgZ,QAAU,SAAUjP,GAC1B,OAAOa,MAAMgY,QAAQ7Y,GAAOA,GAAM,EAAIw2C,EAAOvnC,SAASjP,K,gBCXxD9J,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAAkC4B,YAAY,I,gBCApF,EAAQ,IACR,EAAQ,KACR3B,EAAOD,QAAU,EAAQ,GAAuB4K,MAAMC,M,gBCDtD,IAAIzE,EAAM,EAAQ,IACdG,EAAU,EAAQ,IAClBkU,EAAW,EAAQ,IACnB9Z,EAAO,EAAQ,KACf6/C,EAAc,EAAQ,KACtB5G,EAAW,EAAQ,IACnB6G,EAAiB,EAAQ,KACzBC,EAAY,EAAQ,IAExBn6C,EAAQA,EAAQU,EAAIV,EAAQM,GAAK,EAAQ,IAAR,EAA0B,SAAUq1B,GAAQtxB,MAAMC,KAAKqxB,MAAW,QAAS,CAE1GrxB,KAAM,SAASA,KAAK81C,GAClB,IAOIx9C,EAAQ2P,EAAQkQ,EAAMta,EAPtBH,EAAIkS,EAASkmC,GACbl5C,EAAmB,mBAAR/B,KAAqBA,KAAOkF,MACvC6uC,EAAO7zC,UAAUzC,OACjBy9C,EAAQnH,EAAO,EAAI7zC,UAAU,QAAKG,EAClC86C,OAAoB96C,IAAV66C,EACVhvC,EAAQ,EACRuuC,EAASO,EAAUn4C,GAIvB,GAFIs4C,IAASD,EAAQx6C,EAAIw6C,EAAOnH,EAAO,EAAI7zC,UAAU,QAAKG,EAAW,IAEvDA,MAAVo6C,GAAyB14C,GAAKmD,OAAS41C,EAAYL,GAMrD,IAAKrtC,EAAS,IAAIrL,EADlBtE,EAASy2C,EAASrxC,EAAEpF,SACSA,EAASyO,EAAOA,IAC3C6uC,EAAe3tC,EAAQlB,EAAOivC,EAAUD,EAAMr4C,EAAEqJ,GAAQA,GAASrJ,EAAEqJ,SANrE,IAAKlJ,EAAWy3C,EAAOx/C,KAAK4H,GAAIuK,EAAS,IAAIrL,IAAOub,EAAOta,EAAS8S,QAAQnW,KAAMuM,IAChF6uC,EAAe3tC,EAAQlB,EAAOivC,EAAUlgD,EAAK+H,EAAUk4C,EAAO,CAAC59B,EAAKvhB,MAAOmQ,IAAQ,GAAQoR,EAAKvhB,OASpG,OADAqR,EAAO3P,OAASyO,EACTkB,M,gBCjCX,IAAI5K,EAAW,EAAQ,IACvBjI,EAAOD,QAAU,SAAU0I,EAAUjD,EAAIhE,EAAOya,GAC9C,IACE,OAAOA,EAAUzW,EAAGyC,EAASzG,GAAO,GAAIA,EAAM,IAAMgE,EAAGhE,GAEvD,MAAOgH,GACP,IAAI+3B,EAAM93B,EAAiB,OAE3B,WADY3C,IAARy6B,GAAmBt4B,EAASs4B,EAAI7/B,KAAK+H,IACnCD,K,gBCRV,IAAIuS,EAAY,EAAQ,IACpBG,EAAW,EAAQ,EAAR,CAAkB,YAC7B2lC,EAAal2C,MAAMtI,UAEvBrC,EAAOD,QAAU,SAAU4I,GACzB,YAAc7C,IAAP6C,IAAqBoS,EAAUpQ,QAAUhC,GAAMk4C,EAAW3lC,KAAcvS,K,gBCLjF,IAAIwzC,EAAkB,EAAQ,IAC1B9yC,EAAa,EAAQ,IAEzBrJ,EAAOD,QAAU,SAAUoC,EAAQwP,EAAOnQ,GACpCmQ,KAASxP,EAAQg6C,EAAgB9zC,EAAElG,EAAQwP,EAAOtI,EAAW,EAAG7H,IAC/DW,EAAOwP,GAASnQ,I,gBCNvB,IAAI0Z,EAAW,EAAQ,EAAR,CAAkB,YAC7B4lC,GAAe,EAEnB,IACE,IAAIC,EAAQ,CAAC,GAAG7lC,KAChB6lC,EAAc,OAAI,WAAcD,GAAe,GAE/Cn2C,MAAMC,KAAKm2C,GAAO,WAAc,MAAM,KACtC,MAAOv4C,IAETxI,EAAOD,QAAU,SAAUuJ,EAAM03C,GAC/B,IAAKA,IAAgBF,EAAc,OAAO,EAC1C,IAAIG,GAAO,EACX,IACE,IAAIn3C,EAAM,CAAC,GACPmyB,EAAOnyB,EAAIoR,KACf+gB,EAAK1gB,KAAO,WAAc,MAAO,CAAEnW,KAAM67C,GAAO,IAChDn3C,EAAIoR,GAAY,WAAc,OAAO+gB,GACrC3yB,EAAKQ,GACL,MAAOtB,IACT,OAAOy4C,I,gBClBTlhD,EAAQ4B,YAAa,EAErB,IAEIu/C,EAEJ,SAASz+C,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAFhED,CAFD,EAAQ,MAM9B1C,EAAQgZ,QAAU,WAChB,SAASohC,iBAAiBn3C,EAAQC,GAChC,IAAK,IAAI1C,EAAI,EAAGA,EAAI0C,EAAMC,OAAQ3C,IAAK,CACrC,IAAI4C,EAAaF,EAAM1C,GACvB4C,EAAWhC,WAAagC,EAAWhC,aAAc,EACjDgC,EAAWC,cAAe,EACtB,UAAWD,IAAYA,EAAWE,UAAW,IACjD,EAAI69C,EAAiBnoC,SAAS/V,EAAQG,EAAWrB,IAAKqB,IAI1D,OAAO,SAAUN,EAAaU,EAAYC,GAGxC,OAFID,GAAY42C,iBAAiBt3C,EAAYR,UAAWkB,GACpDC,GAAa22C,iBAAiBt3C,EAAaW,GACxCX,GAdO,I,gBCVlB7C,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAA8C4B,YAAY,I,gBCAhG,EAAQ,KACR,IAAIy8C,EAAU,EAAQ,GAAuBn9C,OAC7CjB,EAAOD,QAAU,SAASmB,eAAeyH,EAAI7G,EAAK0V,GAChD,OAAO4mC,EAAQl9C,eAAeyH,EAAI7G,EAAK0V,K,gBCHzC,IAAIlR,EAAU,EAAQ,IAEtBA,EAAQA,EAAQU,EAAIV,EAAQM,GAAK,EAAQ,IAAmB,SAAU,CAAE1F,eAAgB,EAAQ,IAAgBmH,K,gBCFhH,OAAC,SAAWud,GAmDV,IAAIra,EACFsa,EAAY,6CACZs7B,EAA6B,mBAAV7/C,QAAkD,iBAAnBA,OAAOmH,SAEzDqd,EAAW/d,KAAK6D,KAChBma,EAAYhe,KAAKiJ,MAEjBgV,EAAiB,qBACjBC,EAAgBD,EAAiB,yDAEjCE,EAAO,KAIPC,EAAW,CAAC,EAAG,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,MAM7EC,EAAM,IAwoFR,SAASC,SAASrkB,GAChB,IAAIzB,EAAQ,EAAJyB,EACR,OAAOA,EAAI,GAAKA,IAAMzB,EAAIA,EAAIA,EAAI,EAKpC,SAAS+lB,cAAc7e,GAMrB,IALA,IAAIjF,EAAG+jB,EACLhmB,EAAI,EACJ6L,EAAI3E,EAAEvE,OACN7B,EAAIoG,EAAE,GAAK,GAENlH,EAAI6L,GAAI,CAGb,IADAma,EAhqFS,IA+pFT/jB,EAAIiF,EAAElH,KAAO,IACI2C,OACVqjB,IAAK/jB,EAAI,IAAMA,GACtBnB,GAAKmB,EAIP,IAAK4J,EAAI/K,EAAE6B,OAA8B,KAAtB7B,EAAEmlB,aAAapa,KAElC,OAAO/K,EAAEgL,MAAM,EAAGD,EAAI,GAAK,GAK7B,SAASqa,QAAQC,EAAGC,GAClB,IAAIlf,EAAGC,EACLkf,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EACPL,EAAImmB,EAAElkB,EACN4J,EAAIua,EAAEnkB,EACNkI,EAAIgc,EAAEle,EACNhI,EAAImmB,EAAEne,EAGR,IAAKjI,IAAM6L,EAAG,OAAO,KAMrB,GAJA3E,EAAImf,IAAOA,EAAG,GACdlf,EAAImf,IAAOA,EAAG,GAGVpf,GAAKC,EAAG,OAAOD,EAAIC,EAAI,GAAK0E,EAAI7L,EAGpC,GAAIA,GAAK6L,EAAG,OAAO7L,EAMnB,GAJAkH,EAAIlH,EAAI,EACRmH,EAAIgD,GAAKlK,GAGJomB,IAAOC,EAAI,OAAOnf,EAAI,GAAKkf,EAAKnf,EAAI,GAAK,EAG9C,IAAKC,EAAG,OAAOgD,EAAIlK,EAAIiH,EAAI,GAAK,EAKhC,IAHA2E,GAAK1B,EAAIkc,EAAG1jB,SAAW1C,EAAIqmB,EAAG3jB,QAAUwH,EAAIlK,EAGvCD,EAAI,EAAGA,EAAI6L,EAAG7L,IAAK,GAAIqmB,EAAGrmB,IAAMsmB,EAAGtmB,GAAI,OAAOqmB,EAAGrmB,GAAKsmB,EAAGtmB,GAAKkH,EAAI,GAAK,EAG5E,OAAOiD,GAAKlK,EAAI,EAAIkK,EAAIlK,EAAIiH,EAAI,GAAK,EAOvC,SAASqf,SAAS9kB,EAAGuY,EAAKwM,EAAKjmB,GAC7B,GAAIkB,EAAIuY,GAAOvY,EAAI+kB,GAAO/kB,IAAM+jB,EAAU/jB,GACxC,MAAM2J,MACJqa,GAAkBllB,GAAQ,aAA2B,iBAALkB,EAC7CA,EAAIuY,GAAOvY,EAAI+kB,EAAM,kBAAoB,oBACzC,6BAA+BzV,OAAOtP,IAM/C,SAASglB,MAAMhlB,GACb,IAAI0I,EAAI1I,EAAEpB,EAAEsC,OAAS,EACrB,OAAOmjB,SAASrkB,EAAEwG,EAruFP,KAquFwBkC,GAAK1I,EAAEpB,EAAE8J,GAAK,GAAK,EAIxD,SAASuc,cAAcC,EAAK1e,GAC1B,OAAQ0e,EAAIhkB,OAAS,EAAIgkB,EAAIxb,OAAO,GAAK,IAAMwb,EAAI7a,MAAM,GAAK6a,IAC5D1e,EAAI,EAAI,IAAM,MAAQA,EAI1B,SAAS2e,aAAaD,EAAK1e,EAAG+d,GAC5B,IAAIpb,EAAKic,EAGT,GAAI5e,EAAI,EAAG,CAGT,IAAK4e,EAAKb,EAAI,MAAO/d,EAAG4e,GAAMb,GAC9BW,EAAME,EAAKF,OAOX,KAAM1e,GAHN2C,EAAM+b,EAAIhkB,QAGK,CACb,IAAKkkB,EAAKb,EAAG/d,GAAK2C,IAAO3C,EAAG4e,GAAMb,GAClCW,GAAOE,OACE5e,EAAI2C,IACb+b,EAAMA,EAAI7a,MAAM,EAAG7D,GAAK,IAAM0e,EAAI7a,MAAM7D,IAI5C,OAAO0e,GAOT3b,EA9vFA,SAAS8b,MAAMC,GACb,IAAIC,EAAKC,EAAaC,EAglBhBC,EAwqBAC,EACFC,EACAC,EACAC,EACAC,EA3vCF7gB,EAAIqE,UAAUlJ,UAAY,CAAE8B,YAAaoH,UAAWC,SAAU,KAAMuF,QAAS,MAC7EiX,EAAM,IAAIzc,UAAU,GAUpB0c,EAAiB,GAajBC,EAAgB,EAMhBC,GAAc,EAIdC,EAAa,GAMbC,GAAW,IAKXC,EAAU,IAGVC,GAAS,EAkBTC,EAAc,EAIdC,EAAgB,EAGhBC,EAAS,CACP2qB,OAAQ,GACRxqB,UAAW,EACXC,mBAAoB,EACpBF,eAAgB,IAChBD,iBAAkB,IAClBK,kBAAmB,EACnBD,uBAAwB,IACxB6gB,OAAQ,IAMV3gB,EAAW,uCAgBb,SAAS1d,UAAU0f,EAAGvjB,GACpB,IAAIwhB,EAAUtoB,EAAGuoB,EAAa3gB,EAAGjI,EAAG6oB,EAAOje,EAAK+b,EAC9CR,EAAIjhB,KAGN,KAAMihB,aAAanb,WAAY,OAAO,IAAIA,UAAU0f,EAAGvjB,GAEvD,GAAS,MAALA,EAAW,CAEb,GAAIujB,IAAwB,IAAnBA,EAAEO,aAYT,OAXA9E,EAAElkB,EAAIyoB,EAAEzoB,QAEHyoB,EAAErqB,GAAKqqB,EAAEziB,EAAI8f,EAChB5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,KACHyiB,EAAEziB,EAAI6f,EACf3B,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,IAEbke,EAAEle,EAAIyiB,EAAEziB,EACRke,EAAE9lB,EAAIqqB,EAAErqB,EAAEyL,UAMd,IAAK+c,EAAoB,iBAAL6B,IAAsB,EAAJA,GAAS,EAAG,CAMhD,GAHAvE,EAAElkB,EAAI,EAAIyoB,EAAI,GAAKA,GAAKA,GAAI,GAAK,EAG7BA,MAAQA,EAAG,CACb,IAAKziB,EAAI,EAAGjI,EAAI0qB,EAAG1qB,GAAK,GAAIA,GAAK,GAAIiI,KASrC,YAPIA,EAAI8f,EACN5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,MAEZke,EAAEle,EAAIA,EACNke,EAAE9lB,EAAI,CAACqqB,KAMX/D,EAAM5V,OAAO2Z,OACR,CAEL,IAAKpF,EAAU1N,KAAK+O,EAAM5V,OAAO2Z,IAAK,OAAOxD,EAAaf,EAAGQ,EAAKkC,GAElE1C,EAAElkB,EAAyB,IAArB0kB,EAAIV,WAAW,IAAYU,EAAMA,EAAI7a,MAAM,IAAK,GAAK,GAIxD7D,EAAI0e,EAAItI,QAAQ,OAAS,IAAGsI,EAAMA,EAAImC,QAAQ,IAAK,MAGnD9oB,EAAI2mB,EAAIoC,OAAO,OAAS,GAGvB9gB,EAAI,IAAGA,EAAIjI,GACfiI,IAAM0e,EAAI7a,MAAM9L,EAAI,GACpB2mB,EAAMA,EAAIqC,UAAU,EAAGhpB,IACdiI,EAAI,IAGbA,EAAI0e,EAAIhkB,YAGL,CAOL,GAJA4jB,SAASpf,EAAG,EAAGuhB,EAAS/lB,OAAQ,QAIvB,IAALwE,EAEF,OAAO8hB,MADP9C,EAAI,IAAInb,UAAU0f,GACFhD,EAAiBvB,EAAEle,EAAI,EAAG0f,GAK5C,GAFAhB,EAAM5V,OAAO2Z,GAET7B,EAAoB,iBAAL6B,EAAe,CAGhC,GAAQ,EAAJA,GAAS,EAAG,OAAOxD,EAAaf,EAAGQ,EAAKkC,EAAO1hB,GAKnD,GAHAgf,EAAElkB,EAAI,EAAIyoB,EAAI,GAAK/D,EAAMA,EAAI7a,MAAM,IAAK,GAAK,EAGzCd,UAAUke,OAASvC,EAAImC,QAAQ,YAAa,IAAInmB,OAAS,GAC3D,MAAMyI,MACJsa,EAAgBgF,QAGpBvE,EAAElkB,EAA0B,KAAtB0kB,EAAIV,WAAW,IAAaU,EAAMA,EAAI7a,MAAM,IAAK,GAAK,EAQ9D,IALA6c,EAAWD,EAAS5c,MAAM,EAAG3E,GAC7Bc,EAAIjI,EAAI,EAIH4K,EAAM+b,EAAIhkB,OAAQ3C,EAAI4K,EAAK5K,IAC9B,GAAI2oB,EAAStK,QAAQhe,EAAIsmB,EAAIxb,OAAOnL,IAAM,EAAG,CAC3C,GAAS,KAALK,GAGF,GAAIL,EAAIiI,EAAG,CACTA,EAAI2C,EACJ,eAEG,IAAKge,IAGNjC,GAAOA,EAAIpN,gBAAkBoN,EAAMA,EAAIwC,gBACvCxC,GAAOA,EAAIwC,gBAAkBxC,EAAMA,EAAIpN,gBAAgB,CACzDqP,GAAc,EACd5oB,GAAK,EACLiI,EAAI,EACJ,SAIJ,OAAOif,EAAaf,EAAGpV,OAAO2Z,GAAI7B,EAAO1hB,GAK7C0hB,GAAQ,GAIH5gB,GAHL0e,EAAMM,EAAYN,EAAKxf,EAAG,GAAIgf,EAAElkB,IAGnBoc,QAAQ,OAAS,EAAGsI,EAAMA,EAAImC,QAAQ,IAAK,IACnD7gB,EAAI0e,EAAIhkB,OAIf,IAAK3C,EAAI,EAAyB,KAAtB2mB,EAAIV,WAAWjmB,GAAWA,KAGtC,IAAK4K,EAAM+b,EAAIhkB,OAAkC,KAA1BgkB,EAAIV,aAAarb,KAExC,GAAI+b,EAAMA,EAAI7a,MAAM9L,IAAK4K,GAAM,CAI7B,GAHAA,GAAO5K,EAGH6oB,GAAS7d,UAAUke,OACrBte,EAAM,KAAO8f,EA1QA,kBA0QwBA,IAAMlF,EAAUkF,IACnD,MAAMtf,MACJsa,EAAiBS,EAAElkB,EAAIyoB,GAI7B,IAAKziB,EAAIA,EAAIjI,EAAI,GAAK+nB,EAGpB5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,UAGP,GAAIA,EAAI6f,EAGb3B,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,OACR,CAWL,GAVAke,EAAEle,EAAIA,EACNke,EAAE9lB,EAAI,GAMNL,GAAKiI,EAAI,GAnSJ,GAoSDA,EAAI,IAAGjI,GApSN,IAsSDA,EAAI4K,EAAK,CAGX,IAFI5K,GAAGmmB,EAAE9lB,EAAE4L,MAAM0a,EAAI7a,MAAM,EAAG9L,IAEzB4K,GAzSF,GAySmB5K,EAAI4K,GACxBub,EAAE9lB,EAAE4L,MAAM0a,EAAI7a,MAAM9L,EAAGA,GA1StB,KA6SHA,EA7SG,IA6Sa2mB,EAAMA,EAAI7a,MAAM9L,IAAI2C,YAEpC3C,GAAK4K,EAGP,KAAO5K,IAAK2mB,GAAO,KACnBR,EAAE9lB,EAAE4L,MAAM0a,SAKZR,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,GA41BjB,SAASmhB,OAAO3nB,EAAGzB,EAAGqpB,EAAI5f,GACxB,IAAI6f,EAAIrhB,EAAGshB,EAAI3e,EAAK+b,EAKpB,GAHU,MAAN0C,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,IAEhB5nB,EAAEpB,EAAG,OAAOoB,EAAEwJ,WAKnB,GAHAqe,EAAK7nB,EAAEpB,EAAE,GACTkpB,EAAK9nB,EAAEwG,EAEE,MAALjI,EACF2mB,EAAMZ,cAActkB,EAAEpB,GACtBsmB,EAAY,GAANld,GAAiB,GAANA,IAAY8f,GAAM3B,GAAc2B,GAAM1B,GACpDnB,cAAcC,EAAK4C,GACnB3C,aAAaD,EAAK4C,EAAI,UAezB,GAVAthB,GAHAxG,EAAIwnB,MAAM,IAAIje,UAAUvJ,GAAIzB,EAAGqpB,IAGzBphB,EAGN2C,GADA+b,EAAMZ,cAActkB,EAAEpB,IACZsC,OAOA,GAAN8G,GAAiB,GAANA,IAAYzJ,GAAKiI,GAAKA,GAAK2f,GAAa,CAGrD,KAAOhd,EAAM5K,EAAG2mB,GAAO,IAAK/b,KAC5B+b,EAAMD,cAAcC,EAAK1e,QAQzB,GAJAjI,GAAKupB,EACL5C,EAAMC,aAAaD,EAAK1e,EAAG,KAGvBA,EAAI,EAAI2C,GACV,KAAM5K,EAAI,EAAG,IAAK2mB,GAAO,IAAK3mB,IAAK2mB,GAAO,WAG1C,IADA3mB,GAAKiI,EAAI2C,GACD,EAEN,IADI3C,EAAI,GAAK2C,IAAK+b,GAAO,KAClB3mB,IAAK2mB,GAAO,KAM3B,OAAOllB,EAAEQ,EAAI,GAAKqnB,EAAK,IAAM3C,EAAMA,EAKrC,SAAS6C,SAASrkB,EAAMskB,GAKtB,IAJA,IAAIhoB,EACFzB,EAAI,EACJI,EAAI,IAAI4K,UAAU7F,EAAK,IAElBnF,EAAImF,EAAKxC,OAAQ3C,IAAK,CAI3B,KAHAyB,EAAI,IAAIuJ,UAAU7F,EAAKnF,KAGhBiC,EAAG,CACR7B,EAAIqB,EACJ,MACSgoB,EAAOtpB,KAAKC,EAAGqB,KACxBrB,EAAIqB,GAIR,OAAOrB,EAQT,SAASspB,UAAUjoB,EAAGpB,EAAG4H,GAKvB,IAJA,IAAIjI,EAAI,EACN6L,EAAIxL,EAAEsC,QAGAtC,IAAIwL,GAAIxL,EAAEspB,OAGlB,IAAK9d,EAAIxL,EAAE,GAAIwL,GAAK,GAAIA,GAAK,GAAI7L,KAkBjC,OAfKiI,EAAIjI,EAnvCA,GAmvCIiI,EAAe,GAAK8f,EAG/BtmB,EAAEpB,EAAIoB,EAAEwG,EAAI,KAGHA,EAAI6f,EAGbrmB,EAAEpB,EAAI,CAACoB,EAAEwG,EAAI,IAEbxG,EAAEwG,EAAIA,EACNxG,EAAEpB,EAAIA,GAGDoB,EA0DT,SAASwnB,MAAM9C,EAAGyD,EAAIP,EAAIvoB,GACxB,IAAIR,EAAGN,EAAG6L,EAAG1B,EAAG1I,EAAGooB,EAAIC,EACrBzD,EAAKF,EAAE9lB,EACP0pB,EAASnE,EAGX,GAAIS,EAAI,CAQNlgB,EAAK,CAGH,IAAK7F,EAAI,EAAG6J,EAAIkc,EAAG,GAAIlc,GAAK,GAAIA,GAAK,GAAI7J,KAIzC,IAHAN,EAAI4pB,EAAKtpB,GAGD,EACNN,GAl1CG,GAm1CH6L,EAAI+d,EAIJE,GAHAroB,EAAI4kB,EAAGwD,EAAK,IAGHE,EAAOzpB,EAAIuL,EAAI,GAAK,GAAK,OAIlC,IAFAge,EAAKtE,GAAUvlB,EAAI,GAz1ChB,MA21COqmB,EAAG1jB,OAAQ,CAEnB,IAAI7B,EASF,MAAMqF,EANN,KAAOkgB,EAAG1jB,QAAUknB,EAAIxD,EAAGpa,KAAK,IAChCxK,EAAIqoB,EAAK,EACTxpB,EAAI,EAEJuL,GADA7L,GAn2CD,OAo2CoB,MAIhB,CAIL,IAHAyB,EAAI0I,EAAIkc,EAAGwD,GAGNvpB,EAAI,EAAG6J,GAAK,GAAIA,GAAK,GAAI7J,KAU9BwpB,GAHAje,GAJA7L,GA/2CC,OAm3CkBM,GAGV,EAAI,EAAImB,EAAIsoB,EAAOzpB,EAAIuL,EAAI,GAAK,GAAK,EAmBlD,GAfA/K,EAAIA,GAAK8oB,EAAK,GAKC,MAAdvD,EAAGwD,EAAK,KAAehe,EAAI,EAAIpK,EAAIA,EAAIsoB,EAAOzpB,EAAIuL,EAAI,IAEvD/K,EAAIuoB,EAAK,GACLS,GAAMhpB,KAAa,GAANuoB,GAAWA,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAC9C6nB,EAAK,GAAW,GAANA,IAAkB,GAANT,GAAWvoB,GAAW,GAANuoB,IAGrCrpB,EAAI,EAAI6L,EAAI,EAAIpK,EAAIsoB,EAAOzpB,EAAIuL,GAAK,EAAIwa,EAAGwD,EAAK,IAAM,GAAM,GAC7DR,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAEpB2nB,EAAK,IAAMvD,EAAG,GAiBhB,OAhBAA,EAAG1jB,OAAS,EAER7B,GAGF8oB,GAAMzD,EAAEle,EAAI,EAGZoe,EAAG,GAAK0D,GAl5CP,GAk5C0BH,EAl5C1B,QAm5CDzD,EAAEle,GAAK2hB,GAAM,GAIbvD,EAAG,GAAKF,EAAEle,EAAI,EAGTke,EAkBT,GAdS,GAALnmB,GACFqmB,EAAG1jB,OAASknB,EACZ1f,EAAI,EACJ0f,MAEAxD,EAAG1jB,OAASknB,EAAK,EACjB1f,EAAI4f,EAp6CD,GAo6CmB/pB,GAItBqmB,EAAGwD,GAAMhe,EAAI,EAAI2Z,EAAU/jB,EAAIsoB,EAAOzpB,EAAIuL,GAAKke,EAAOle,IAAM1B,EAAI,GAI9DrJ,EAEF,OAAU,CAGR,GAAU,GAAN+oB,EAAS,CAGX,IAAK7pB,EAAI,EAAG6L,EAAIwa,EAAG,GAAIxa,GAAK,GAAIA,GAAK,GAAI7L,KAEzC,IADA6L,EAAIwa,EAAG,IAAMlc,EACRA,EAAI,EAAG0B,GAAK,GAAIA,GAAK,GAAI1B,KAG1BnK,GAAKmK,IACPgc,EAAEle,IACEoe,EAAG,IAAMV,IAAMU,EAAG,GAAK,IAG7B,MAGA,GADAA,EAAGwD,IAAO1f,EACNkc,EAAGwD,IAAOlE,EAAM,MACpBU,EAAGwD,KAAQ,EACX1f,EAAI,EAMV,IAAKnK,EAAIqmB,EAAG1jB,OAAoB,IAAZ0jB,IAAKrmB,GAAUqmB,EAAGsD,QAIpCxD,EAAEle,EAAI8f,EACR5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,KAGHke,EAAEle,EAAI6f,IACf3B,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,IAIjB,OAAOke,EAIT,SAAS3V,QAAQ/O,GACf,IAAIklB,EACF1e,EAAIxG,EAAEwG,EAER,OAAU,OAANA,EAAmBxG,EAAEwJ,YAEzB0b,EAAMZ,cAActkB,EAAEpB,GAEtBsmB,EAAM1e,GAAK2f,GAAc3f,GAAK4f,EAC1BnB,cAAcC,EAAK1e,GACnB2e,aAAaD,EAAK1e,EAAG,KAElBxG,EAAEQ,EAAI,EAAI,IAAM0kB,EAAMA,GAiqC/B,OAv0EA3b,UAAU8b,MAAQA,MAElB9b,UAAUgf,SAAW,EACrBhf,UAAUif,WAAa,EACvBjf,UAAUkf,WAAa,EACvBlf,UAAUmf,YAAc,EACxBnf,UAAUof,cAAgB,EAC1Bpf,UAAUqf,gBAAkB,EAC5Brf,UAAUsf,gBAAkB,EAC5Btf,UAAUuf,gBAAkB,EAC5Bvf,UAAUwf,iBAAmB,EAC7Bxf,UAAUyf,OAAS,EAqCnBzf,UAAUmS,OAASnS,UAAUwL,IAAM,SAAUrU,GAC3C,IAAIH,EAAG0oB,EAEP,GAAW,MAAPvoB,EAAa,CAEf,GAAkB,iBAAPA,EA2HT,MAAMiJ,MACJqa,EAAiB,oBAAsBtjB,GAtFzC,GAlCIA,EAAIJ,eAAeC,EAAI,oBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG6jB,EAAK7jB,GACpB0lB,EAAiBgD,GAKfvoB,EAAIJ,eAAeC,EAAI,mBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG,EAAGA,GAClB2lB,EAAgB+C,GAOdvoB,EAAIJ,eAAeC,EAAI,qBACzB0oB,EAAIvoB,EAAIH,KACC0oB,EAAEf,KACTpD,SAASmE,EAAE,IAAK7E,EAAK,EAAG7jB,GACxBukB,SAASmE,EAAE,GAAI,EAAG7E,EAAK7jB,GACvB4lB,EAAa8C,EAAE,GACf7C,EAAa6C,EAAE,KAEfnE,SAASmE,GAAI7E,EAAKA,EAAK7jB,GACvB4lB,IAAeC,EAAa6C,EAAI,GAAKA,EAAIA,KAOzCvoB,EAAIJ,eAAeC,EAAI,SAEzB,IADA0oB,EAAIvoB,EAAIH,KACC0oB,EAAEf,IACTpD,SAASmE,EAAE,IAAK7E,GAAM,EAAG7jB,GACzBukB,SAASmE,EAAE,GAAI,EAAG7E,EAAK7jB,GACvB8lB,EAAU4C,EAAE,GACZ3C,EAAU2C,EAAE,OACP,CAEL,GADAnE,SAASmE,GAAI7E,EAAKA,EAAK7jB,IACnB0oB,EAGF,MAAMtf,MACJqa,EAAiBzjB,EAAI,oBAAsB0oB,GAH7C5C,IAAYC,EAAU2C,EAAI,GAAKA,EAAIA,GAWzC,GAAIvoB,EAAIJ,eAAeC,EAAI,UAAW,CAEpC,IADA0oB,EAAIvoB,EAAIH,QACI0oB,EAcV,MAAMtf,MACJqa,EAAiBzjB,EAAI,uBAAyB0oB,GAdhD,GAAIA,EAAG,CACL,GAAqB,oBAAVC,SAAyBA,SAClCA,OAAOC,kBAAmBD,OAAOE,YAIjC,MADA7C,GAAU0C,EACJtf,MACJqa,EAAiB,sBAJnBuC,EAAS0C,OAOX1C,EAAS0C,EA0Bf,GAhBIvoB,EAAIJ,eAAeC,EAAI,iBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG,EAAGA,GAClBimB,EAAcyC,GAKZvoB,EAAIJ,eAAeC,EAAI,mBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG6jB,EAAK7jB,GACpBkmB,EAAgBwC,GAKdvoB,EAAIJ,eAAeC,EAAI,UAAW,CAEpC,GAAgB,iBADhB0oB,EAAIvoB,EAAIH,IAEH,MAAMoJ,MACTqa,EAAiBzjB,EAAI,mBAAqB0oB,GAFlBvC,EAASuC,EAOrC,GAAIvoB,EAAIJ,eAAeC,EAAI,YAAa,CAKtC,GAAgB,iBAJhB0oB,EAAIvoB,EAAIH,KAIqB,sBAAsB4V,KAAK8S,GAGtD,MAAMtf,MACJqa,EAAiBzjB,EAAI,aAAe0oB,GAHtChC,EAAWgC,GAenB,MAAO,CACLhD,eAAgBA,EAChBC,cAAeA,EACfmD,eAAgB,CAAClD,EAAYC,GAC7BkD,MAAO,CAACjD,EAASC,GACjBC,OAAQA,EACRC,YAAaA,EACbC,cAAeA,EACfC,OAAQA,EACRO,SAAUA,IAcd1d,UAAUggB,YAAc,SAAUN,GAChC,IAAKA,IAAwB,IAAnBA,EAAEO,aAAuB,OAAO,EAC1C,IAAKjgB,UAAUke,MAAO,OAAO,EAE7B,IAAIlpB,EAAGyB,EACLpB,EAAIqqB,EAAErqB,EACN4H,EAAIyiB,EAAEziB,EACNhG,EAAIyoB,EAAEzoB,EAERkE,EAAK,GAA2B,kBAAvB,GAAG8E,SAAS9K,KAAKE,IAExB,IAAW,IAAN4B,IAAkB,IAAPA,IAAagG,IAAM4d,GAAO5d,GAAK4d,GAAO5d,IAAMud,EAAUvd,GAAI,CAGxE,GAAa,IAAT5H,EAAE,GAAU,CACd,GAAU,IAAN4H,GAAwB,IAAb5H,EAAEsC,OAAc,OAAO,EACtC,MAAMwD,EASR,IALAnG,GAAKiI,EAAI,GAhiBJ,IAiiBG,IAAGjI,GAjiBN,IAqiBD+Q,OAAO1Q,EAAE,IAAIsC,QAAU3C,EAAG,CAE5B,IAAKA,EAAI,EAAGA,EAAIK,EAAEsC,OAAQ3C,IAExB,IADAyB,EAAIpB,EAAEL,IACE,GAAKyB,GAAKkkB,GAAQlkB,IAAM+jB,EAAU/jB,GAAI,MAAM0E,EAItD,GAAU,IAAN1E,EAAS,OAAO,SAKnB,GAAU,OAANpB,GAAoB,OAAN4H,IAAqB,OAANhG,GAAoB,IAANA,IAAkB,IAAPA,GAC/D,OAAO,EAGT,MAAMmJ,MACHqa,EAAiB,sBAAwBiF,IAS9C1f,UAAUkgB,QAAUlgB,UAAUwb,IAAM,WAClC,OAAOgD,SAASpkB,UAAWuB,EAAEwL,KAS/BnH,UAAUmgB,QAAUngB,UAAUgP,IAAM,WAClC,OAAOwP,SAASpkB,UAAWuB,EAAEykB,KAc/BpgB,UAAUwC,QAOJ2Z,EANU,iBAMQ3f,KAAKgG,SAAsB,QAC9C,WAAc,OAAOgY,EAPV,iBAOoBhe,KAAKgG,WACpC,WAAc,OAA2C,SAAlB,WAAhBhG,KAAKgG,SAAwB,IACnC,QAAhBhG,KAAKgG,SAAsB,IAExB,SAAU6d,GACf,IAAInkB,EAAGC,EAAGc,EAAGkC,EAAGugB,EACd1qB,EAAI,EACJK,EAAI,GACJirB,EAAO,IAAItgB,UAAUyc,GAOvB,GALU,MAAN4D,EAAYA,EAAK3D,EAChBnB,SAAS8E,EAAI,EAAGxF,GAErB1b,EAAIob,EAAS8F,EA9mBN,IAgnBHrD,EAGF,GAAI2C,OAAOC,gBAAiB,CAI1B,IAFA1jB,EAAIyjB,OAAOC,gBAAgB,IAAIW,YAAYphB,GAAK,IAEzCnK,EAAImK,IAQTugB,EAAW,OAAPxjB,EAAElH,IAAgBkH,EAAElH,EAAI,KAAO,MAM1B,MACPmH,EAAIwjB,OAAOC,gBAAgB,IAAIW,YAAY,IAC3CrkB,EAAElH,GAAKmH,EAAE,GACTD,EAAElH,EAAI,GAAKmH,EAAE,KAKb9G,EAAE4L,KAAKye,EAAI,MACX1qB,GAAK,GAGTA,EAAImK,EAAI,MAGH,KAAIwgB,OAAOE,YA2BhB,MADA7C,GAAS,EACH5c,MACJqa,EAAiB,sBAvBnB,IAFAve,EAAIyjB,OAAOE,YAAY1gB,GAAK,GAErBnK,EAAImK,IAMTugB,EAAmB,iBAAN,GAAPxjB,EAAElH,IAA0C,cAAXkH,EAAElH,EAAI,GAC9B,WAAXkH,EAAElH,EAAI,GAAgC,SAAXkH,EAAElH,EAAI,IACjCkH,EAAElH,EAAI,IAAM,KAAOkH,EAAElH,EAAI,IAAM,GAAKkH,EAAElH,EAAI,KAErC,KACP2qB,OAAOE,YAAY,GAAGW,KAAKtkB,EAAGlH,IAI9BK,EAAE4L,KAAKye,EAAI,MACX1qB,GAAK,GAGTA,EAAImK,EAAI,EASZ,IAAK6d,EAEH,KAAOhoB,EAAImK,IACTugB,EAAIvD,KACI,OAAM9mB,EAAEL,KAAO0qB,EAAI,MAc/B,IATAW,GA9rBO,IA6rBPlhB,EAAI9J,IAAIL,KAICqrB,IACPX,EAAI9E,EAlsBC,GAksBmByF,GACxBhrB,EAAEL,GAAKwlB,EAAUrb,EAAIugB,GAAKA,GAIZ,IAATrqB,EAAEL,GAAUK,EAAEspB,MAAO3pB,KAG5B,GAAIA,EAAI,EACNK,EAAI,CAAC4H,EAAI,OACJ,CAGL,IAAKA,GAAK,EAAa,IAAT5H,EAAE,GAAUA,EAAEorB,OAAO,EAAG,GAAIxjB,GA/sBrC,IAktBL,IAAKjI,EAAI,EAAG0qB,EAAIrqB,EAAE,GAAIqqB,GAAK,GAAIA,GAAK,GAAI1qB,KAGpCA,EArtBC,KAqtBaiI,GArtBb,GAqtB6BjI,GAKpC,OAFAsrB,EAAKrjB,EAAIA,EACTqjB,EAAKjrB,EAAIA,EACFirB,IAUXtgB,UAAU61C,IAAM,WAId,IAHA,IAAI7gD,EAAI,EACNmF,EAAOC,UACPy7C,EAAM,IAAI71C,UAAU7F,EAAK,IACpBnF,EAAImF,EAAKxC,QAASk+C,EAAMA,EAAIjxB,KAAKzqB,EAAKnF,MAC7C,OAAO6gD,GAQT55B,EAAc,WAQZ,SAASyE,UAAU/E,EAAKgF,EAAQC,EAASjD,GAOvC,IANA,IAAI9c,EAEFggB,EADAtiB,EAAM,CAAC,GAEPvJ,EAAI,EACJ4K,EAAM+b,EAAIhkB,OAEL3C,EAAI4K,GAAM,CACf,IAAKihB,EAAOtiB,EAAI5G,OAAQkpB,IAAQtiB,EAAIsiB,IAASF,GAI7C,IAFApiB,EAAI,IAAMof,EAAStK,QAAQsI,EAAIxb,OAAOnL,MAEjC6L,EAAI,EAAGA,EAAItC,EAAI5G,OAAQkJ,IAEtBtC,EAAIsC,GAAK+f,EAAU,IACH,MAAdriB,EAAIsC,EAAI,KAAYtC,EAAIsC,EAAI,GAAK,GACrCtC,EAAIsC,EAAI,IAAMtC,EAAIsC,GAAK+f,EAAU,EACjCriB,EAAIsC,IAAM+f,GAKhB,OAAOriB,EAAIuiB,UAMb,OAAO,SAAUnF,EAAKgF,EAAQC,EAASG,EAAMC,GAC3C,IAAIrD,EAAUroB,EAAG2H,EAAGkC,EAAGrJ,EAAGqlB,EAAGE,EAAID,EAC/BpmB,EAAI2mB,EAAItI,QAAQ,KAChBgN,EAAK3D,EACL2B,EAAK1B,EA+BP,IA5BI3nB,GAAK,IACPmK,EAAI+d,EAGJA,EAAgB,EAChBvB,EAAMA,EAAImC,QAAQ,IAAK,IAEvB3C,GADAC,EAAI,IAAIpb,UAAU2gB,IACZM,IAAItF,EAAIhkB,OAAS3C,GACvBkoB,EAAgB/d,EAKhBic,EAAE/lB,EAAIqrB,UAAU9E,aAAab,cAAcI,EAAE9lB,GAAI8lB,EAAEle,EAAG,KACrD,GAAI2jB,EAxDK,cAyDVxF,EAAEne,EAAIme,EAAE/lB,EAAEsC,QAUZsF,EAAIkC,GALJkc,EAAKqF,UAAU/E,EAAKgF,EAAQC,EAASI,GACjCrD,EAAWD,EA/DH,eAgERC,EAhEQ,aAgEYD,KAGb/lB,OAGO,GAAX0jB,IAAKlc,GAASkc,EAAGsD,OAGxB,IAAKtD,EAAG,GAAI,OAAOsC,EAASxd,OAAO,GAqCnC,GAlCInL,EAAI,IACJiI,GAEFke,EAAE9lB,EAAIgmB,EACNF,EAAEle,EAAIA,EAGNke,EAAElkB,EAAI8pB,EAEN1F,GADAF,EAAIa,EAAIb,EAAGC,EAAGiF,EAAIhC,EAAIuC,IACfvrB,EACPS,EAAIqlB,EAAErlB,EACNmH,EAAIke,EAAEle,GASRjI,EAAIqmB,EAHJ/lB,EAAI2H,EAAIojB,EAAK,GAOblhB,EAAIyhB,EAAU,EACd9qB,EAAIA,GAAKR,EAAI,GAAkB,MAAb+lB,EAAG/lB,EAAI,GAEzBQ,EAAIuoB,EAAK,GAAU,MAALrpB,GAAac,KAAa,GAANuoB,GAAWA,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAC1DjC,EAAImK,GAAKnK,GAAKmK,IAAW,GAANkf,GAAWvoB,GAAW,GAANuoB,GAAuB,EAAZhD,EAAG/lB,EAAI,IACtD+oB,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAKxB3B,EAAI,IAAM+lB,EAAG,GAGfM,EAAM7lB,EAAI8lB,aAAa+B,EAASxd,OAAO,IAAKkgB,EAAI1C,EAASxd,OAAO,IAAMwd,EAASxd,OAAO,OACjF,CAML,GAHAkb,EAAG1jB,OAASrC,EAGRQ,EAGF,MAAO8qB,IAAWvF,IAAK/lB,GAAKsrB,GAC1BvF,EAAG/lB,GAAK,EAEHA,MACD2H,EACFoe,EAAK,CAAC,GAAG9b,OAAO8b,IAMtB,IAAKlc,EAAIkc,EAAG1jB,QAAS0jB,IAAKlc,KAG1B,IAAKnK,EAAI,EAAG2mB,EAAM,GAAI3mB,GAAKmK,EAAGwc,GAAOgC,EAASxd,OAAOkb,EAAGrmB,OAGxD2mB,EAAMC,aAAaD,EAAK1e,EAAG0gB,EAASxd,OAAO,IAI7C,OAAOwb,GAjJG,GAuJdK,EAAM,WAGJ,SAASkF,SAAS/F,EAAGhc,EAAGgiB,GACtB,IAAI/rB,EAAGgsB,EAAMC,EAAKC,EAChBC,EAAQ,EACRvsB,EAAImmB,EAAExjB,OACN6pB,EAAMriB,EA34BA,IA44BNsiB,EAAMtiB,EA54BA,IA44BgB,EAExB,IAAKgc,EAAIA,EAAEra,QAAS9L,KAKlBusB,IADAH,EAAOI,GAHPH,EAAMlG,EAAEnmB,GA/4BF,MAi5BNI,EAAIqsB,EAAMJ,GADVC,EAAMnG,EAAEnmB,GAh5BF,IAg5BmB,GACHwsB,GAj5BhB,QAk5B6CD,GACnCJ,EAAO,IAAM/rB,EAn5BvB,IAm5BuC,GAAKqsB,EAAMH,EACxDnG,EAAEnmB,GAAKosB,EAAOD,EAKhB,OAFII,IAAOpG,EAAI,CAACoG,GAAOhiB,OAAO4b,IAEvBA,EAGT,SAASD,QAAQhf,EAAGC,EAAGulB,EAAIC,GACzB,IAAI3sB,EAAG4sB,EAEP,GAAIF,GAAMC,EACRC,EAAMF,EAAKC,EAAK,GAAK,OAGrB,IAAK3sB,EAAI4sB,EAAM,EAAG5sB,EAAI0sB,EAAI1sB,IAExB,GAAIkH,EAAElH,IAAMmH,EAAEnH,GAAI,CAChB4sB,EAAM1lB,EAAElH,GAAKmH,EAAEnH,GAAK,GAAK,EACzB,MAKN,OAAO4sB,EAGT,SAASC,SAAS3lB,EAAGC,EAAGulB,EAAIP,GAI1B,IAHA,IAAInsB,EAAI,EAGD0sB,KACLxlB,EAAEwlB,IAAO1sB,EACTA,EAAIkH,EAAEwlB,GAAMvlB,EAAEulB,GAAM,EAAI,EACxBxlB,EAAEwlB,GAAM1sB,EAAImsB,EAAOjlB,EAAEwlB,GAAMvlB,EAAEulB,GAI/B,MAAQxlB,EAAE,IAAMA,EAAEvE,OAAS,EAAGuE,EAAEukB,OAAO,EAAG,KAI5C,OAAO,SAAUtF,EAAGC,EAAGiF,EAAIhC,EAAI8C,GAC7B,IAAIS,EAAK3kB,EAAGjI,EAAG8sB,EAAMrrB,EAAGsrB,EAAMC,EAAOC,EAAGC,EAAIC,EAAKC,EAAMC,EAAMC,EAAIC,EAAIC,EACnEC,EAAIC,EACJzrB,EAAIkkB,EAAElkB,GAAKmkB,EAAEnkB,EAAI,GAAK,EACtBokB,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAGT,KAAKgmB,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAItb,UAGTmb,EAAElkB,GAAMmkB,EAAEnkB,IAAMokB,GAAKC,GAAMD,EAAG,IAAMC,EAAG,GAAMA,GAG7CD,GAAe,GAATA,EAAG,KAAYC,EAAS,EAAJrkB,EAAQA,EAAI,EAHa0rB,KAoBvD,IAZAT,GADAD,EAAI,IAAIjiB,UAAU/I,IACX5B,EAAI,GAEX4B,EAAIopB,GADJpjB,EAAIke,EAAEle,EAAIme,EAAEne,GACC,EAERkkB,IACHA,EAAOxG,EACP1d,EAAI6d,SAASK,EAAEle,EA79BV,IA69B0B6d,SAASM,EAAEne,EA79BrC,IA89BLhG,EAAIA,EA99BC,GA89Bc,GAKhBjC,EAAI,EAAGsmB,EAAGtmB,KAAOqmB,EAAGrmB,IAAM,GAAIA,KAInC,GAFIsmB,EAAGtmB,IAAMqmB,EAAGrmB,IAAM,IAAIiI,IAEtBhG,EAAI,EACNirB,EAAGjhB,KAAK,GACR6gB,GAAO,MACF,CAwBL,IAvBAS,EAAKlH,EAAG1jB,OACR8qB,EAAKnH,EAAG3jB,OACR3C,EAAI,EACJiC,GAAK,GAILR,EAAI+jB,EAAU2G,GAAQ7F,EAAG,GAAK,KAItB,IACNA,EAAK4F,SAAS5F,EAAI7kB,EAAG0qB,GACrB9F,EAAK6F,SAAS7F,EAAI5kB,EAAG0qB,GACrBsB,EAAKnH,EAAG3jB,OACR4qB,EAAKlH,EAAG1jB,QAGV2qB,EAAKG,EAELL,GADAD,EAAM9G,EAAGva,MAAM,EAAG2hB,IACP9qB,OAGJyqB,EAAOK,EAAIN,EAAIC,KAAU,GAChCM,EAAKpH,EAAGxa,QACR4hB,EAAK,CAAC,GAAGnjB,OAAOmjB,GAChBF,EAAMlH,EAAG,GACLA,EAAG,IAAM6F,EAAO,GAAGqB,IAIvB,EAAG,CAOD,GANA/rB,EAAI,GAGJmrB,EAAM1G,QAAQI,EAAI6G,EAAKM,EAAIL,IAGjB,EAAG,CAqBX,GAjBAC,EAAOF,EAAI,GACPM,GAAML,IAAMC,EAAOA,EAAOlB,GAAQgB,EAAI,IAAM,KAGhD1rB,EAAI+jB,EAAU6H,EAAOG,IAab,EAcN,IAXI/rB,GAAK0qB,IAAM1qB,EAAI0qB,EAAO,GAI1Ba,GADAD,EAAOb,SAAS5F,EAAI7kB,EAAG0qB,IACVxpB,OACbyqB,EAAOD,EAAIxqB,OAM+B,GAAnCujB,QAAQ6G,EAAMI,EAAKH,EAAOI,IAC/B3rB,IAGAorB,SAASE,EAAMU,EAAKT,EAAQU,EAAKpH,EAAI0G,EAAOb,GAC5Ca,EAAQD,EAAKpqB,OACbiqB,EAAM,OAQC,GAALnrB,IAGFmrB,EAAMnrB,EAAI,GAKZurB,GADAD,EAAOzG,EAAGxa,SACGnJ,OAUf,GAPIqqB,EAAQI,IAAML,EAAO,CAAC,GAAGxiB,OAAOwiB,IAGpCF,SAASM,EAAKJ,EAAMK,EAAMjB,GAC1BiB,EAAOD,EAAIxqB,QAGC,GAARiqB,EAMF,KAAO1G,QAAQI,EAAI6G,EAAKM,EAAIL,GAAQ,GAClC3rB,IAGAorB,SAASM,EAAKM,EAAKL,EAAOM,EAAKpH,EAAI8G,EAAMjB,GACzCiB,EAAOD,EAAIxqB,YAGE,IAARiqB,IACTnrB,IACA0rB,EAAM,CAAC,IAITD,EAAGltB,KAAOyB,EAGN0rB,EAAI,GACNA,EAAIC,KAAU/G,EAAGiH,IAAO,GAExBH,EAAM,CAAC9G,EAAGiH,IACVF,EAAO,UAEDE,IAAOC,GAAgB,MAAVJ,EAAI,KAAelrB,KAE1C6qB,EAAiB,MAAVK,EAAI,GAGND,EAAG,IAAIA,EAAGzB,OAAO,EAAG,GAG3B,GAAIU,GAAQxG,EAAM,CAGhB,IAAK3lB,EAAI,EAAGiC,EAAIirB,EAAG,GAAIjrB,GAAK,GAAIA,GAAK,GAAIjC,KAEzCipB,MAAMgE,EAAG5B,GAAM4B,EAAEhlB,EAAIjI,EA9nChB,GA8nCoBiI,EAAe,GAAK,EAAGohB,EAAIyD,QAIpDG,EAAEhlB,EAAIA,EACNglB,EAAEnsB,GAAKgsB,EAGT,OAAOG,GA9PL,GAgYA7F,EAAa,8BACfC,EAAW,cACXC,EAAY,cACZC,EAAkB,qBAClBC,EAAmB,6BALvBN,EAOS,SAAUf,EAAGQ,EAAKkC,EAAO1hB,GAC9B,IAAIglB,EACFlqB,EAAI4mB,EAAQlC,EAAMA,EAAImC,QAAQtB,EAAkB,IAGlD,GAAID,EAAgB3P,KAAK3V,GACvBkkB,EAAElkB,EAAIyO,MAAMzO,GAAK,KAAOA,EAAI,GAAK,EAAI,MAChC,CACL,IAAK4mB,IAGH5mB,EAAIA,EAAE6mB,QAAQ1B,GAAY,SAAUhnB,EAAGwtB,EAAIC,GAEzC,OADA1B,EAAkC,MAA1B0B,EAAKA,EAAG1E,eAAwB,GAAW,KAAN0E,EAAY,EAAI,EACrD1mB,GAAKA,GAAKglB,EAAY/rB,EAALwtB,KAGvBzmB,IACFglB,EAAOhlB,EAGPlF,EAAIA,EAAE6mB,QAAQzB,EAAU,MAAMyB,QAAQxB,EAAW,SAG/CX,GAAO1kB,GAAG,OAAO,IAAI+I,UAAU/I,EAAGkqB,GAKxC,GAAInhB,UAAUke,MACZ,MAAM9d,MACHqa,EAAiB,SAAWte,EAAI,SAAWA,EAAI,IAAM,YAAcwf,GAIxER,EAAElkB,EAAI,KAGRkkB,EAAE9lB,EAAI8lB,EAAEle,EAAI,MA6LhBtB,EAAEmnB,cAAgBnnB,EAAEonB,IAAM,WACxB,IAAI5H,EAAI,IAAInb,UAAU9F,MAEtB,OADIihB,EAAElkB,EAAI,IAAGkkB,EAAElkB,EAAI,GACZkkB,GAWTxf,EAAEqnB,WAAa,SAAU5H,EAAGjf,GAC1B,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,KAiBxCR,EAAEsnB,cAAgBtnB,EAAE0kB,GAAK,SAAUA,EAAIhC,GACrC,IAAIhpB,EAAGoB,EAAGipB,EACRvE,EAAIjhB,KAEN,GAAU,MAANmmB,EAKF,OAJA9E,SAAS8E,EAAI,EAAGxF,GACN,MAANwD,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GAEdJ,MAAM,IAAIje,UAAUmb,GAAIkF,EAAKlF,EAAEle,EAAI,EAAGohB,GAG/C,KAAMhpB,EAAI8lB,EAAE9lB,GAAI,OAAO,KAIvB,GAHAoB,EA7hDS,KA6hDHipB,EAAIrqB,EAAEsC,OAAS,GAAKmjB,SAAS5gB,KAAK+C,EA7hD/B,KAgiDLyiB,EAAIrqB,EAAEqqB,GAAI,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIjpB,KAG3C,OAFIA,EAAI,IAAGA,EAAI,GAERA,GAwBTkF,EAAEunB,UAAYvnB,EAAEqgB,IAAM,SAAUZ,EAAGjf,GACjC,OAAO6f,EAAI9hB,KAAM,IAAI8F,UAAUob,EAAGjf,GAAIugB,EAAgBC,IAQxDhhB,EAAEwnB,mBAAqBxnB,EAAEynB,KAAO,SAAUhI,EAAGjf,GAC3C,OAAO6f,EAAI9hB,KAAM,IAAI8F,UAAUob,EAAGjf,GAAI,EAAG,IAmB3CR,EAAE0nB,gBAAkB1nB,EAAEslB,IAAM,SAAUxqB,EAAGrB,GACvC,IAAIkuB,EAAMC,EAAUvuB,EAAGmK,EAASqkB,EAAQC,EAAQC,EAAQtI,EACtDD,EAAIjhB,KAKN,IAHAzD,EAAI,IAAIuJ,UAAUvJ,IAGZpB,IAAMoB,EAAEktB,YACZ,MAAMvjB,MACHqa,EAAiB,4BAA8BjV,QAAQ/O,IAS5D,GANS,MAALrB,IAAWA,EAAI,IAAI4K,UAAU5K,IAGjCouB,EAAS/sB,EAAEwG,EAAI,IAGVke,EAAE9lB,IAAM8lB,EAAE9lB,EAAE,IAAgB,GAAV8lB,EAAE9lB,EAAE,KAAY8lB,EAAEle,GAAmB,GAAdke,EAAE9lB,EAAEsC,SAAgBlB,EAAEpB,IAAMoB,EAAEpB,EAAE,GAK5E,OADA+lB,EAAI,IAAIpb,UAAUxD,KAAKykB,KAAKzb,QAAQ2V,GAAIqI,EAAS,EAAI/H,MAAMhlB,IAAM+O,QAAQ/O,KAClErB,EAAIgmB,EAAEwI,IAAIxuB,GAAKgmB,EAKxB,GAFAqI,EAAShtB,EAAEQ,EAAI,EAEX7B,EAAG,CAGL,GAAIA,EAAEC,GAAKD,EAAEC,EAAE,IAAMD,EAAE6B,EAAG,OAAO,IAAI+I,UAAU2iB,MAE/CY,GAAYE,GAAUtI,EAAEwI,aAAevuB,EAAEuuB,eAE3BxI,EAAIA,EAAEyI,IAAIxuB,QAInB,IAAIqB,EAAEwG,EAAI,IAAMke,EAAEle,EAAI,GAAKke,EAAEle,GAAK,IAAa,GAAPke,EAAEle,EAE7Cke,EAAE9lB,EAAE,GAAK,GAAKmuB,GAAUrI,EAAE9lB,EAAE,IAAM,KAElC8lB,EAAE9lB,EAAE,GAAK,MAAQmuB,GAAUrI,EAAE9lB,EAAE,IAAM,YASvC,OANA8J,EAAIgc,EAAElkB,EAAI,GAAKwkB,MAAMhlB,IAAM,EAAI,EAG3B0kB,EAAEle,GAAK,IAAGkC,EAAI,EAAIA,GAGf,IAAIa,UAAUyjB,EAAS,EAAItkB,EAAIA,GAE7B+d,IAKT/d,EAAIob,EAAS2C,EAnpDN,GAmpDiC,IAe1C,IAZIsG,GACFF,EAAO,IAAItjB,UAAU,IACjByjB,IAAQhtB,EAAEQ,EAAI,GAClBysB,EAASjI,MAAMhlB,IAGfitB,GADA1uB,EAAIwH,KAAKumB,KAAKvd,QAAQ/O,KACT,EAGf2kB,EAAI,IAAIpb,UAAUyc,KAGR,CAER,GAAIiH,EAAQ,CAEV,KADAtI,EAAIA,EAAEyI,MAAM1I,IACL9lB,EAAG,MAEN8J,EACEic,EAAE/lB,EAAEsC,OAASwH,IAAGic,EAAE/lB,EAAEsC,OAASwH,GACxBokB,IACTnI,EAAIA,EAAEwI,IAAIxuB,IAId,GAAIJ,EAAG,CAEL,GAAU,KADVA,EAAIwlB,EAAUxlB,EAAI,IACL,MACb0uB,EAAS1uB,EAAI,OAKb,GAFAipB,MADAxnB,EAAIA,EAAEotB,MAAMP,GACH7sB,EAAEwG,EAAI,EAAG,GAEdxG,EAAEwG,EAAI,GACRymB,EAASjI,MAAMhlB,OACV,CAEL,GAAU,KADVzB,GAAKwQ,QAAQ/O,IACA,MACbitB,EAAS1uB,EAAI,EAIjBmmB,EAAIA,EAAE0I,MAAM1I,GAERhc,EACEgc,EAAE9lB,GAAK8lB,EAAE9lB,EAAEsC,OAASwH,IAAGgc,EAAE9lB,EAAEsC,OAASwH,GAC/BokB,IACTpI,EAAIA,EAAEyI,IAAIxuB,IAId,OAAImuB,EAAiBnI,GACjBqI,IAAQrI,EAAIqB,EAAIT,IAAIZ,IAEjBhmB,EAAIgmB,EAAEwI,IAAIxuB,GAAK+J,EAAI8e,MAAM7C,EAAG8B,EAAeP,OAnHxBmF,GAmH+C1G,IAY3Ezf,EAAEmoB,aAAe,SAAUzF,GACzB,IAAI5nB,EAAI,IAAIuJ,UAAU9F,MAGtB,OAFU,MAANmkB,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GACdJ,MAAMxnB,EAAGA,EAAEwG,EAAI,EAAGohB,IAQ3B1iB,EAAEooB,UAAYpoB,EAAEkJ,GAAK,SAAUuW,EAAGjf,GAChC,OAA8C,IAAvC+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,KAOxCR,EAAEqoB,SAAW,WACX,QAAS9pB,KAAK7E,GAQhBsG,EAAEsoB,cAAgBtoB,EAAEykB,GAAK,SAAUhF,EAAGjf,GACpC,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,IAAM,GAQ9CR,EAAEuoB,uBAAyBvoB,EAAEwoB,IAAM,SAAU/I,EAAGjf,GAC9C,OAAoD,KAA5CA,EAAI+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,MAAoB,IAANA,GAQ3DR,EAAEgoB,UAAY,WACZ,QAASzpB,KAAK7E,GAAKylB,SAAS5gB,KAAK+C,EAxwDxB,IAwwDwC/C,KAAK7E,EAAEsC,OAAS,GAQnEgE,EAAEyoB,WAAazoB,EAAEwL,GAAK,SAAUiU,EAAGjf,GACjC,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,IAAM,GAQ9CR,EAAE0oB,oBAAsB1oB,EAAE2oB,IAAM,SAAUlJ,EAAGjf,GAC3C,OAAqD,KAA7CA,EAAI+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,MAAqB,IAANA,GAO5DR,EAAE+J,MAAQ,WACR,OAAQxL,KAAKjD,GAOf0E,EAAE4oB,WAAa,WACb,OAAOrqB,KAAKjD,EAAI,GAOlB0E,EAAE6oB,WAAa,WACb,OAAOtqB,KAAKjD,EAAI,GAOlB0E,EAAE8oB,OAAS,WACT,QAASvqB,KAAK7E,GAAkB,GAAb6E,KAAK7E,EAAE,IAwB5BsG,EAAE+oB,MAAQ,SAAUtJ,EAAGjf,GACrB,IAAInH,EAAG6L,EAAG3K,EAAGyuB,EACXxJ,EAAIjhB,KACJgC,EAAIif,EAAElkB,EAMR,GAHAkF,GADAif,EAAI,IAAIpb,UAAUob,EAAGjf,IACflF,GAGDiF,IAAMC,EAAG,OAAO,IAAI6D,UAAU2iB,KAGnC,GAAIzmB,GAAKC,EAEP,OADAif,EAAEnkB,GAAKkF,EACAgf,EAAEyJ,KAAKxJ,GAGhB,IAAIyJ,EAAK1J,EAAEle,EAn2DF,GAo2DP6nB,EAAK1J,EAAEne,EAp2DA,GAq2DPoe,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAET,IAAKwvB,IAAOC,EAAI,CAGd,IAAKzJ,IAAOC,EAAI,OAAOD,GAAMD,EAAEnkB,GAAKkF,EAAGif,GAAK,IAAIpb,UAAUsb,EAAKH,EAAIwH,KAGnE,IAAKtH,EAAG,KAAOC,EAAG,GAGhB,OAAOA,EAAG,IAAMF,EAAEnkB,GAAKkF,EAAGif,GAAK,IAAIpb,UAAUqb,EAAG,GAAKF,EAGnC,GAAjBwB,GAAsB,EAAI,GAS/B,GALAkI,EAAK/J,SAAS+J,GACdC,EAAKhK,SAASgK,GACdzJ,EAAKA,EAAGva,QAGJ5E,EAAI2oB,EAAKC,EAAI,CAaf,KAXIH,EAAOzoB,EAAI,IACbA,GAAKA,EACLhG,EAAImlB,IAEJyJ,EAAKD,EACL3uB,EAAIolB,GAGNplB,EAAE4qB,UAGG3kB,EAAID,EAAGC,IAAKjG,EAAE+K,KAAK,IACxB/K,EAAE4qB,eAMF,IAFAjgB,GAAK8jB,GAAQzoB,EAAImf,EAAG1jB,SAAWwE,EAAImf,EAAG3jB,SAAWuE,EAAIC,EAEhDD,EAAIC,EAAI,EAAGA,EAAI0E,EAAG1E,IAErB,GAAIkf,EAAGlf,IAAMmf,EAAGnf,GAAI,CAClBwoB,EAAOtJ,EAAGlf,GAAKmf,EAAGnf,GAClB,MAYN,GANIwoB,IAAMzuB,EAAImlB,EAAIA,EAAKC,EAAIA,EAAKplB,EAAGklB,EAAEnkB,GAAKmkB,EAAEnkB,IAE5CkF,GAAK0E,EAAIya,EAAG3jB,SAAW3C,EAAIqmB,EAAG1jB,SAItB,EAAG,KAAOwE,IAAKkf,EAAGrmB,KAAO,GAIjC,IAHAmH,EAAIwe,EAAO,EAGJ9Z,EAAI3E,GAAI,CAEb,GAAImf,IAAKxa,GAAKya,EAAGza,GAAI,CACnB,IAAK7L,EAAI6L,EAAG7L,IAAMqmB,IAAKrmB,GAAIqmB,EAAGrmB,GAAKmH,KACjCkf,EAAGrmB,GACLqmB,EAAGxa,IAAM8Z,EAGXU,EAAGxa,IAAMya,EAAGza,GAId,KAAgB,GAATwa,EAAG,GAASA,EAAGoF,OAAO,EAAG,KAAMqE,GAGtC,OAAKzJ,EAAG,GAWDqD,UAAUtD,EAAGC,EAAIyJ,IAPtB1J,EAAEnkB,EAAqB,GAAjB0lB,GAAsB,EAAI,EAChCvB,EAAE/lB,EAAI,CAAC+lB,EAAEne,EAAI,GACNme,IA8BXzf,EAAEopB,OAASppB,EAAEioB,IAAM,SAAUxI,EAAGjf,GAC9B,IAAI8lB,EAAGhrB,EACLkkB,EAAIjhB,KAKN,OAHAkhB,EAAI,IAAIpb,UAAUob,EAAGjf,IAGhBgf,EAAE9lB,IAAM+lB,EAAEnkB,GAAKmkB,EAAE/lB,IAAM+lB,EAAE/lB,EAAE,GACvB,IAAI2K,UAAU2iB,MAGXvH,EAAE/lB,GAAK8lB,EAAE9lB,IAAM8lB,EAAE9lB,EAAE,GACtB,IAAI2K,UAAUmb,IAGJ,GAAf8B,GAIFhmB,EAAImkB,EAAEnkB,EACNmkB,EAAEnkB,EAAI,EACNgrB,EAAIjG,EAAIb,EAAGC,EAAG,EAAG,GACjBA,EAAEnkB,EAAIA,EACNgrB,EAAEhrB,GAAKA,GAEPgrB,EAAIjG,EAAIb,EAAGC,EAAG,EAAG6B,IAGnB7B,EAAID,EAAEuJ,MAAMzC,EAAE4B,MAAMzI,KAGb/lB,EAAE,IAAqB,GAAf4nB,IAAkB7B,EAAEnkB,EAAIkkB,EAAElkB,GAElCmkB,IAwBTzf,EAAEqpB,aAAerpB,EAAEkoB,MAAQ,SAAUzI,EAAGjf,GACtC,IAAI9G,EAAG4H,EAAGjI,EAAG6L,EAAG1B,EAAG/J,EAAG6vB,EAAK5D,EAAKC,EAAK4D,EAAKC,EAAKC,EAAKC,EAClDlE,EACAhG,EAAIjhB,KACJmhB,EAAKF,EAAE9lB,EACPimB,GAAMF,EAAI,IAAIpb,UAAUob,EAAGjf,IAAI9G,EAGjC,KAAKgmB,GAAOC,GAAOD,EAAG,IAAOC,EAAG,IAmB9B,OAhBKH,EAAElkB,IAAMmkB,EAAEnkB,GAAKokB,IAAOA,EAAG,KAAOC,GAAMA,IAAOA,EAAG,KAAOD,EAC1DD,EAAE/lB,EAAI+lB,EAAEne,EAAIme,EAAEnkB,EAAI,MAElBmkB,EAAEnkB,GAAKkkB,EAAElkB,EAGJokB,GAAOC,GAKVF,EAAE/lB,EAAI,CAAC,GACP+lB,EAAEne,EAAI,GALNme,EAAE/lB,EAAI+lB,EAAEne,EAAI,MASTme,EAYT,IATAne,EAAI6d,SAASK,EAAEle,EA/iEN,IA+iEsB6d,SAASM,EAAEne,EA/iEjC,IAgjETme,EAAEnkB,GAAKkkB,EAAElkB,GACTguB,EAAM5J,EAAG1jB,SACTutB,EAAM5J,EAAG3jB,UAGM0tB,EAAKhK,EAAIA,EAAKC,EAAIA,EAAK+J,EAAIrwB,EAAIiwB,EAAKA,EAAMC,EAAKA,EAAMlwB,GAG/DA,EAAIiwB,EAAMC,EAAKG,EAAK,GAAIrwB,IAAKqwB,EAAGpkB,KAAK,IAK1C,IAHAkgB,EAAOxG,EAtjEG,IAyjEL3lB,EAAIkwB,IAAOlwB,GAAK,GAAI,CAKvB,IAJAK,EAAI,EACJ8vB,EAAM7J,EAAGtmB,GA3jED,IA4jERowB,EAAM9J,EAAGtmB,GA5jED,IA4jEiB,EAEX6L,EAAI7L,GAAbmK,EAAI8lB,GAAgBpkB,EAAI7L,GAK3BK,IADAgsB,EAAM8D,GAHN9D,EAAMhG,IAAKlc,GA/jEL,MAikEN/J,EAAIgwB,EAAM/D,GADVC,EAAMjG,EAAGlc,GAhkEH,IAgkEmB,GACHgmB,GAjkEhB,QAkkE0CE,EAAGxkB,GAAKxL,GAC7C8rB,EAAO,IAAM/rB,EAnkElB,IAmkEiC,GAAKgwB,EAAM9D,EAClD+D,EAAGxkB,KAAOwgB,EAAMF,EAGlBkE,EAAGxkB,GAAKxL,EASV,OANIA,IACA4H,EAEFooB,EAAG5E,OAAO,EAAG,GAGR/B,UAAUtD,EAAGiK,EAAIpoB,IAQ1BtB,EAAE2pB,QAAU,WACV,IAAInK,EAAI,IAAInb,UAAU9F,MAEtB,OADAihB,EAAElkB,GAAKkkB,EAAElkB,GAAK,KACPkkB,GAwBTxf,EAAEipB,KAAO,SAAUxJ,EAAGjf,GACpB,IAAIjG,EACFilB,EAAIjhB,KACJgC,EAAIif,EAAElkB,EAMR,GAHAkF,GADAif,EAAI,IAAIpb,UAAUob,EAAGjf,IACflF,GAGDiF,IAAMC,EAAG,OAAO,IAAI6D,UAAU2iB,KAGlC,GAAIzmB,GAAKC,EAER,OADAif,EAAEnkB,GAAKkF,EACAgf,EAAEuJ,MAAMtJ,GAGjB,IAAIyJ,EAAK1J,EAAEle,EAxoEF,GAyoEP6nB,EAAK1J,EAAEne,EAzoEA,GA0oEPoe,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAET,IAAKwvB,IAAOC,EAAI,CAGd,IAAKzJ,IAAOC,EAAI,OAAO,IAAItb,UAAU9D,EAAI,GAIzC,IAAKmf,EAAG,KAAOC,EAAG,GAAI,OAAOA,EAAG,GAAKF,EAAI,IAAIpb,UAAUqb,EAAG,GAAKF,EAAQ,EAAJjf,GAQrE,GALA2oB,EAAK/J,SAAS+J,GACdC,EAAKhK,SAASgK,GACdzJ,EAAKA,EAAGva,QAGJ5E,EAAI2oB,EAAKC,EAAI,CAUf,IATI5oB,EAAI,GACN4oB,EAAKD,EACL3uB,EAAIolB,IAEJpf,GAAKA,EACLhG,EAAImlB,GAGNnlB,EAAE4qB,UACK5kB,IAAKhG,EAAE+K,KAAK,IACnB/K,EAAE4qB,UAUJ,KAPA5kB,EAAImf,EAAG1jB,SACPwE,EAAImf,EAAG3jB,QAGK,IAAGzB,EAAIolB,EAAIA,EAAKD,EAAIA,EAAKnlB,EAAGiG,EAAID,GAGvCA,EAAI,EAAGC,GACVD,GAAKmf,IAAKlf,GAAKkf,EAAGlf,GAAKmf,EAAGnf,GAAKD,GAAKye,EAAO,EAC3CU,EAAGlf,GAAKwe,IAASU,EAAGlf,GAAK,EAAIkf,EAAGlf,GAAKwe,EAUvC,OAPIze,IACFmf,EAAK,CAACnf,GAAGqD,OAAO8b,KACdyJ,GAKGpG,UAAUtD,EAAGC,EAAIyJ,IAmB1BnpB,EAAE4pB,UAAY5pB,EAAEijB,GAAK,SAAUA,EAAIP,GACjC,IAAIhpB,EAAGoB,EAAGipB,EACRvE,EAAIjhB,KAEN,GAAU,MAAN0kB,GAAcA,MAASA,EAKzB,OAJArD,SAASqD,EAAI,EAAG/D,GACN,MAANwD,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GAEdJ,MAAM,IAAIje,UAAUmb,GAAIyD,EAAIP,GAGrC,KAAMhpB,EAAI8lB,EAAE9lB,GAAI,OAAO,KAIvB,GAFAoB,EA9tES,IA6tETipB,EAAIrqB,EAAEsC,OAAS,GACI,EAEf+nB,EAAIrqB,EAAEqqB,GAAI,CAGZ,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIjpB,KAG7B,IAAKipB,EAAIrqB,EAAE,GAAIqqB,GAAK,GAAIA,GAAK,GAAIjpB,MAKnC,OAFImoB,GAAMzD,EAAEle,EAAI,EAAIxG,IAAGA,EAAI0kB,EAAEle,EAAI,GAE1BxG,GAYTkF,EAAE6pB,UAAY,SAAUrmB,GAEtB,OADAoc,SAASpc,GAvvEQ,mCAwvEVjF,KAAK2pB,MAAM,KAAO1kB,IAe3BxD,EAAE8pB,WAAa9pB,EAAE+pB,KAAO,WACtB,IAAItwB,EAAGqB,EAAGX,EAAG6vB,EAAKzvB,EAChBilB,EAAIjhB,KACJ7E,EAAI8lB,EAAE9lB,EACN4B,EAAIkkB,EAAElkB,EACNgG,EAAIke,EAAEle,EACNojB,EAAK3D,EAAiB,EACtB4G,EAAO,IAAItjB,UAAU,OAGvB,GAAU,IAAN/I,IAAY5B,IAAMA,EAAE,GACtB,OAAO,IAAI2K,WAAW/I,GAAKA,EAAI,KAAO5B,GAAKA,EAAE,IAAMstB,IAAMttB,EAAI8lB,EAAI,KA8BnE,GAtBS,IAJTlkB,EAAIuF,KAAKkpB,MAAMlgB,QAAQ2V,MAITlkB,GAAK,OACjBR,EAAIskB,cAAc1lB,IACXsC,OAASsF,GAAK,GAAK,IAAGxG,GAAK,KAClCQ,EAAIuF,KAAKkpB,MAAMjvB,GACfwG,EAAI6d,UAAU7d,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS1CnH,EAAI,IAAIkK,UANNvJ,EADEQ,GAAK,IACH,KAAOgG,GAEXxG,EAAIQ,EAAEykB,iBACA5a,MAAM,EAAGrK,EAAE4c,QAAQ,KAAO,GAAKpW,IAKvCnH,EAAI,IAAIkK,UAAU/I,EAAI,IAOpBnB,EAAET,EAAE,GAMN,KAJA4B,GADAgG,EAAInH,EAAEmH,GACEojB,GACA,IAAGppB,EAAI,KAOb,GAHAf,EAAIJ,EACJA,EAAIwtB,EAAKO,MAAM3tB,EAAE0uB,KAAK5I,EAAIb,EAAGjlB,EAAGmqB,EAAI,KAEhCtF,cAAc7kB,EAAEb,GAAGyL,MAAM,EAAG7J,MAAQR,EAAIskB,cAAcjlB,EAAET,IAAIyL,MAAM,EAAG7J,GAAI,CAW3E,GANInB,EAAEmH,EAAIA,KAAKhG,EAMN,SALTR,EAAIA,EAAEqK,MAAM7J,EAAI,EAAGA,EAAI,MAKH0uB,GAAY,QAALlvB,GAgBpB,EAICA,KAAOA,EAAEqK,MAAM,IAAqB,KAAfrK,EAAE0J,OAAO,MAGlC8d,MAAMnoB,EAAGA,EAAEmH,EAAIyf,EAAiB,EAAG,GACnCtnB,GAAKU,EAAE+tB,MAAM/tB,GAAG+O,GAAGsW,IAGrB,MAvBA,IAAKwK,IACH1H,MAAM/nB,EAAGA,EAAE+G,EAAIyf,EAAiB,EAAG,GAE/BxmB,EAAE2tB,MAAM3tB,GAAG2O,GAAGsW,IAAI,CACpBrlB,EAAII,EACJ,MAIJmqB,GAAM,EACNppB,GAAK,EACL0uB,EAAM,EAkBd,OAAO1H,MAAMnoB,EAAGA,EAAEmH,EAAIyf,EAAiB,EAAGC,EAAevnB,IAa3DuG,EAAE+f,cAAgB,SAAU2E,EAAIhC,GAK9B,OAJU,MAANgC,IACF9E,SAAS8E,EAAI,EAAGxF,GAChBwF,KAEKjC,OAAOlkB,KAAMmmB,EAAIhC,EAAI,IAgB9B1iB,EAAEiqB,QAAU,SAAUvF,EAAIhC,GAKxB,OAJU,MAANgC,IACF9E,SAAS8E,EAAI,EAAGxF,GAChBwF,EAAKA,EAAKnmB,KAAK+C,EAAI,GAEdmhB,OAAOlkB,KAAMmmB,EAAIhC,IA6B1B1iB,EAAEkqB,SAAW,SAAUxF,EAAIhC,EAAID,GAC7B,IAAIzC,EACFR,EAAIjhB,KAEN,GAAc,MAAVkkB,EACQ,MAANiC,GAAchC,GAAmB,iBAANA,GAC7BD,EAASC,EACTA,EAAK,MACIgC,GAAmB,iBAANA,GACtBjC,EAASiC,EACTA,EAAKhC,EAAK,MAEVD,EAASjB,OAEN,GAAqB,iBAAViB,EAChB,MAAMhe,MACHqa,EAAiB,2BAA6B2D,GAKnD,GAFAzC,EAAMR,EAAEyK,QAAQvF,EAAIhC,GAEhBlD,EAAE9lB,EAAG,CACP,IAAIL,EACFuJ,EAAMod,EAAInb,MAAM,KAChBslB,GAAM1H,EAAOd,UACbyI,GAAM3H,EAAOb,mBACbF,EAAiBe,EAAOf,gBAAkB,GAC1C2I,EAAUznB,EAAI,GACd0nB,EAAe1nB,EAAI,GACnB2nB,EAAQ/K,EAAElkB,EAAI,EACdkvB,EAAYD,EAAQF,EAAQllB,MAAM,GAAKklB,EACvCpmB,EAAMumB,EAAUxuB,OAIlB,GAFIouB,IAAI/wB,EAAI8wB,EAAIA,EAAKC,EAAIA,EAAK/wB,EAAG4K,GAAO5K,GAEpC8wB,EAAK,GAAKlmB,EAAM,EAAG,CAGrB,IAFA5K,EAAI4K,EAAMkmB,GAAMA,EAChBE,EAAUG,EAAUC,OAAO,EAAGpxB,GACvBA,EAAI4K,EAAK5K,GAAK8wB,EAAIE,GAAW3I,EAAiB8I,EAAUC,OAAOpxB,EAAG8wB,GACrEC,EAAK,IAAGC,GAAW3I,EAAiB8I,EAAUrlB,MAAM9L,IACpDkxB,IAAOF,EAAU,IAAMA,GAG7BrK,EAAMsK,EACHD,GAAW5H,EAAOhB,kBAAoB,MAAQ2I,GAAM3H,EAAOX,mBAC1DwI,EAAanI,QAAQ,IAAIrd,OAAO,OAASslB,EAAK,OAAQ,KACvD,MAAQ3H,EAAOZ,wBAA0B,KACxCyI,GACDD,EAGL,OAAQ5H,EAAO0pB,QAAU,IAAMnsB,GAAOyC,EAAOigB,QAAU,KAezD1iC,EAAE0qB,WAAa,SAAUC,GACvB,IAAIhxB,EAAGixB,EAAIC,EAAIC,EAAIxpB,EAAGypB,EAAKjwB,EAAGkwB,EAAIC,EAAI3E,EAAGnsB,EAAGmB,EAC1CkkB,EAAIjhB,KACJmhB,EAAKF,EAAE9lB,EAET,GAAU,MAANixB,MACF7vB,EAAI,IAAIuJ,UAAUsmB,IAGX3C,cAAgBltB,EAAEpB,GAAa,IAARoB,EAAEQ,IAAYR,EAAE0Q,GAAGsV,IAC/C,MAAMrc,MACHqa,EAAiB,aACfhkB,EAAEktB,YAAc,iBAAmB,oBAAsBne,QAAQ/O,IAI1E,IAAK4kB,EAAI,OAAO,IAAIrb,UAAUmb,GAoB9B,IAlBA7lB,EAAI,IAAI0K,UAAUyc,GAClBmK,EAAKL,EAAK,IAAIvmB,UAAUyc,GACxB+J,EAAKG,EAAK,IAAI3mB,UAAUyc,GACxBxlB,EAAI8jB,cAAcM,GAIlBpe,EAAI3H,EAAE2H,EAAIhG,EAAEU,OAASwjB,EAAEle,EAAI,EAC3B3H,EAAED,EAAE,GAAKulB,GAAU8L,EAAMzpB,EAvgFhB,IAugFgC,EAvgFhC,GAugF+CypB,EAAMA,GAC9DJ,GAAMA,GAAM7vB,EAAEusB,WAAW1tB,GAAK,EAAK2H,EAAI,EAAI3H,EAAIsxB,EAAMnwB,EAErDiwB,EAAM3J,EACNA,EAAU,IACVtmB,EAAI,IAAIuJ,UAAU/I,GAGlB0vB,EAAGtxB,EAAE,GAAK,EAGR4sB,EAAIjG,EAAIvlB,EAAGnB,EAAG,EAAG,GAEQ,IADzBmxB,EAAKF,EAAG3B,KAAK3C,EAAE4B,MAAM2C,KACdxD,WAAWsD,IAClBC,EAAKC,EACLA,EAAKC,EACLG,EAAKD,EAAG/B,KAAK3C,EAAE4B,MAAM4C,EAAKG,IAC1BD,EAAKF,EACLnxB,EAAImB,EAAEiuB,MAAMzC,EAAE4B,MAAM4C,EAAKnxB,IACzBmB,EAAIgwB,EAeN,OAZAA,EAAKzK,EAAIsK,EAAG5B,MAAM6B,GAAKC,EAAI,EAAG,GAC9BG,EAAKA,EAAG/B,KAAK6B,EAAG5C,MAAM+C,IACtBL,EAAKA,EAAG3B,KAAK6B,EAAG5C,MAAM2C,IACtBG,EAAG1vB,EAAI2vB,EAAG3vB,EAAIkkB,EAAElkB,EAIhBnB,EAAIkmB,EAAI4K,EAAIJ,EAHZvpB,GAAQ,EAGW0f,GAAe+H,MAAMvJ,GAAG4H,MAAMC,WAC7ChH,EAAI2K,EAAIJ,EAAItpB,EAAG0f,GAAe+H,MAAMvJ,GAAG4H,OAAS,EAAI,CAAC6D,EAAIJ,GAAM,CAACG,EAAIJ,GAExExJ,EAAU2J,EAEH5wB,GAOT6F,EAAEkrB,SAAW,WACX,OAAQrhB,QAAQtL,OAelByB,EAAEmrB,YAAc,SAAUlI,EAAIP,GAE5B,OADU,MAANO,GAAYrD,SAASqD,EAAI,EAAG/D,GACzBuD,OAAOlkB,KAAM0kB,EAAIP,EAAI,IAe9B1iB,EAAEsE,SAAW,SAAU9D,GACrB,IAAIwf,EACFllB,EAAIyD,KACJjD,EAAIR,EAAEQ,EACNgG,EAAIxG,EAAEwG,EA0BR,OAvBU,OAANA,EACEhG,GACF0kB,EAAM,WACF1kB,EAAI,IAAG0kB,EAAM,IAAMA,IAEvBA,EAAM,OAGC,MAALxf,EACFwf,EAAM1e,GAAK2f,GAAc3f,GAAK4f,EAC3BnB,cAAcX,cAActkB,EAAEpB,GAAI4H,GAClC2e,aAAab,cAActkB,EAAEpB,GAAI4H,EAAG,KACxB,KAANd,EAETwf,EAAMC,aAAab,eADnBtkB,EAAIwnB,MAAM,IAAIje,UAAUvJ,GAAIimB,EAAiBzf,EAAI,EAAG0f,IACjBtnB,GAAIoB,EAAEwG,EAAG,MAE5Cse,SAASpf,EAAG,EAAGuhB,EAAS/lB,OAAQ,QAChCgkB,EAAMM,EAAYL,aAAab,cAActkB,EAAEpB,GAAI4H,EAAG,KAAM,GAAId,EAAGlF,GAAG,IAGpEA,EAAI,GAAKR,EAAEpB,EAAE,KAAIsmB,EAAM,IAAMA,IAG5BA,GAQThgB,EAAE6J,QAAU7J,EAAEorB,OAAS,WACrB,OAAOvhB,QAAQtL,OAIjByB,EAAEskB,cAAe,EAEb21B,IACFj6C,EAAE5F,OAAOC,aAAe,YAGxB2F,EAAE5F,OAAO+/C,IAAI,+BAAiCn6C,EAAE6J,SAG9B,MAAhBuW,GAAsB/b,UAAUwL,IAAIuQ,GAEjC/b,UAsIG8b,IACO,QAAI9b,EAAUA,UAAYA,OAIH,KAAxC,aAAqB,OAAOA,GAAY,8BAh1F3C,I,wMCAD,QAEA,QACA,QAGA,S,uqEAEA,IAAM+1C,EADN,UACkBC,QAAa1J,MAEVC,E,+EACnB,wBAA4B,MAAhBh3C,EAAgB,uDAAT,QAAS,uCAC1B,cAAMA,EAAM,CAAC,gBAAiB,UADJ,wDAgCH,SAAAwK,GAAG,OAC1BA,EAAIpI,OAAS,GAAK,MAAO,IAAAymC,UAAS,GAAIr+B,GAAOA,MAjCnB,sDAmCL,SAAAmF,GAGrB,IAFA,IAAM+wC,EAAa,GACbC,EAAchxC,EAAKkhB,OAAO,KACvBpxB,EAAI,EAAGA,EAAIkhD,EAAYv+C,OAAS,GAAI3C,IAAK,CAChD,IAAM42C,EAAU,KAAH,OAAQsK,EAAYl4B,UAAc,GAAJhpB,EAAS,GAAc,IAATA,EAAI,KACtC,KAAnB42C,EAAQj0C,QAAes+C,EAAWh1C,KAAK2qC,GAE7C,OAAOqK,MA1CmB,2DA8CA,IAAA/R,aAAYiS,WAAU,EAAKC,qBA9C3B,kFAgDN,wHACdC,EAAe,EAAKC,iBAAiB1K,QACrC2K,EAAc,EAAK1gD,IAAI,QACvB2gD,EAAQD,EAAYpL,QACpBsL,GAAc,IAAAj4C,aAAYg4C,GAJZ,SAKAD,EAAYG,YAAY,CAC1CC,UAAWZ,EAAUa,gBAAgBH,GACrCI,QAAS,SACTjL,QAASyK,EACTS,OAAQ,CAACf,EAAUgB,OAAOC,QATR,cAKdC,EALc,yBAYbA,EAAM33C,KAAI,SAAA43C,GAAO,MAAK,CAC3BC,YAAaD,EAAQC,YACrBC,OAAQ,EAAKC,uBAAuBH,EAAQJ,OAAO,IACnD1pC,OAAQ5S,MAAIiT,IAAIypC,EAAQJ,OAAO,SAfb,mDAhDM,kFAmEN,0HACdT,EAAe,EAAKC,iBAAiB1K,QACrC2K,EAAc,EAAK1gD,IAAI,QACvB2gD,EAAQD,EAAYpL,QACpBsL,GAAc,IAAAj4C,aAAYg4C,GAJZ,SAKAD,EAAYG,YAAY,CAC1CC,UAAWZ,EAAUa,gBAAgBH,GACrCI,QAAS,SACTjL,QAASyK,EACTS,OAAQ,CAACf,EAAUgB,OAAOO,QATR,cAKdC,EALc,yBAYbA,EAAMj4C,KAAI,SAAAk4C,GAAO,MAAK,CAC3BL,YAAaK,EAAQL,YACrBC,OAAQ,EAAKC,uBAAuBG,EAAQV,OAAO,IACnD1pC,OAAQ5S,MAAIiT,IAAI+pC,EAAQV,OAAO,SAfb,oDAnEM,0EAsFd,0HACNT,EAAe,EAAKC,iBAAiB1K,QACrC2K,EAAc,EAAK1gD,IAAI,QACvB2gD,EAAQD,EAAYpL,QACpBsL,GAAc,IAAAj4C,aAAYg4C,GAJpB,SAKQD,EAAYG,YAAY,CAC1CC,UAAWZ,EAAUa,gBAAgBH,GACrCI,QAAS,SACTjL,QAASyK,EACTS,OAAQ,CAACf,EAAUgB,OAAOC,QAThB,cAKNC,EALM,0BAYL,IAAA1gC,MACL0gC,EACG33C,KAAI,SAAAm4C,GAAM,OAAI,IAAA/Z,KAAI,EAAG+Z,EAAOX,WAC5Bx3C,IAAI,EAAK+3C,0BAfF,oDAtFc,iFAyGP,0HACbhB,EAAe,EAAKC,iBAAiB1K,QACrC2K,EAAc,EAAK1gD,IAAI,QACvB2gD,EAAQD,EAAYpL,QACpBsL,GAAc,IAAAj4C,aAAYg4C,GAJb,SAKCD,EAAYG,YAAY,CAC1CC,UAAWZ,EAAUa,gBAAgBH,GACrCI,QAAS,SACTjL,QAASyK,EACTS,OAAQ,CAACf,EAAUgB,OAAOW,kBATT,cAKbC,EALa,yBAYZA,EAAMr4C,KAAI,SAAAs4C,GAAO,MAAK,CAC3BT,YAAaS,EAAQT,YACrBC,OAAQ,EAAKC,uBAAuBO,EAAQd,OAAO,IACnDb,WAAY,EAAK4B,qBAAqBD,EAAQ1yC,WAf7B,oDAzGO,+EA4HT,0HACXmxC,EAAe,EAAKC,iBAAiB1K,QACrC2K,EAAc,EAAK1gD,IAAI,QACvB2gD,EAAQD,EAAYpL,QACpBsL,GAAc,IAAAj4C,aAAYg4C,GAJf,SAKGD,EAAYG,YAAY,CAC1CC,UAAWZ,EAAUa,gBAAgBH,GACrCI,QAAS,SACTjL,QAASyK,EACTS,OAAQ,CAACf,EAAUgB,OAAOe,cATX,cAKXH,EALW,yBAYVA,EAAMr4C,KAAI,SAAAs4C,GAAO,MAAK,CAC3BT,YAAaS,EAAQT,YACrBC,OAAQ,EAAKC,uBAAuBO,EAAQd,OAAO,IACnDiB,MAAOH,EAAQd,OAAO,QAfP,mDA5HS,E,kEAMvBkB,GACH,OAAO99C,KAAKo8C,iBAAiB2B,KAAKD,K,gCAG/BpM,GACH,OAAO1xC,KAAKo8C,iBAAiBjiB,KAAKuX,K,gCAG/BsM,GACH,OAAI94C,MAAMgY,QAAQ8gC,GACTh+C,KAAKo8C,iBAAiB,mBAAmB4B,GAC3Ch+C,KAAKo8C,iBAAiB,iBAAiB4B,K,gCAG3CC,GAAiB,IAAZ7pC,EAAY,uDAAL9T,MACT49C,GAAS,IAAAp5C,aAAYm5C,EAAK7pC,GAAMsX,QAAQ,OAC9C,OAAO1rB,KAAKo8C,iBAAiBU,KAAKoB,K,gCAG/BD,GAAiB,IAAZ7pC,EAAY,uDAAL9T,MACT49C,GAAS,IAAAp5C,aAAYm5C,EAAK7pC,GAAMsX,QAAQ,OAC9C,OAAO1rB,KAAKo8C,iBAAiBgB,KAAKc,K,uNAqHbl+C,KAAKm+C,c,cAApBC,E,gBAEqBx+C,QAAQgQ,IACjCwuC,EAAOh5C,KAAI,SAAAi5C,GAAK,OACd,EAAKC,eAAeD,GAAOx+C,MAAK,SAAA0+C,GAAQ,MAAK,CAC3C7M,QAAS2M,EACTE,SAAUC,WAAWD,W,cAJrBE,E,gBASmB7+C,QAAQgQ,IAC/B6uC,EAAar5C,KAAI,SAAAs5C,GAAc,OAC7B,EAAKC,cAAcD,EAAehN,SAAS7xC,MAAK,SAAAg+C,GAAK,sCAChDa,GADgD,IAEnDb,iB,cAJAe,E,iBASkBh/C,QAAQgQ,IAC9BgvC,EAAWx5C,KAAI,SAAAy5C,GAAS,OACtB,EAAKC,0BAA0BD,EAAUhB,OAAOh+C,MAAK,SAAAi+C,GAAS,sCACzDe,GADyD,IAE5DpB,MAAOK,W,QAJPiB,E,OASAC,EAAY,G,6BACID,G,IAAtB,2BAAiC,CAAtBE,EAAsB,qCACdA,EAAQxB,OADM,IAC/B,2BACEyB,GADOA,EAAuB,SAClBj7B,mBACY5jB,IAApB2+C,EAAUE,GACZF,EAAUE,GAAQ,CAChBC,UAAWF,EAAQV,SACnBT,UAAW,CACT,CAAEpM,QAASuN,EAAQvN,QAAS6M,SAAUU,EAAQV,aAIlDS,EAAUE,GAAMC,WAAaF,EAAQV,SACrCS,EAAUE,GAAMpB,UAAU/2C,KAAK,CAC7B2qC,QAASuN,EAAQvN,QACjB6M,SAAUU,EAAQV,YAdO,gC,8BAmBjC,I,+CAAYliD,E,KACJ+iD,E,KAAwBtB,UAAU5tB,MACtC,SAACluB,EAAGC,GAAJ,OAAUA,EAAEs8C,SAAWv8C,EAAEu8C,YAErBY,EAAYH,EAAU3iD,GAAK8iD,UAC3BE,EAAkBD,EAAgBh6C,KAAI,SAAAk6C,GAAa,sCACpDA,GADoD,IAEvDC,SAAoC,IAAzBD,EAAcf,SAAkBY,GAAWzzB,QAAQ,QAEhEszB,EAAU3iD,GAAOgjD,GATnB,MAA2B7jD,OAAOgb,QAAQwoC,GAA1C,eAAsD,I,yBAW/CA,G,oKAGKtN,GACZ,OAAO1xC,KAAKo8C,iBAAiBqB,MAAM/L,K,oDAGtBA,GACb,OAAO1xC,KAAKo8C,iBACTmC,SAAS7M,GACT7xC,KAAKS,MAAIiT,O,wDAGGm+B,GACf,OAAO1xC,KAAKo8C,iBACT+C,UAAUzN,GACV7xC,KAAKS,MAAIiT,O,sCAIZ,OAAOvT,KAAKo8C,iBAAiBoD,Q,kFAGPC,G,0GAAW3kD,E,+BAAI,E,kBAErBkF,KAAKo8C,iBAAiBsD,OAAOD,EAAW3kD,G,+CAC9CkF,KAAKk8C,kBAAkBuD,EAAW3kD,EAAI,G,iDADYuK,O,4EAInD,I,+LAIU,WACnB,OAAO,IAAIzF,SAAQ,SAACR,EAASC,GAC3B,EAAK+8C,eAAe,CAAEuD,QAAQ,IAC3BC,QAAQ,CAAEC,IAAK,cAAgB,CAAEpD,UAAW,EAAGE,QAAS,WACxDhhD,KAAI,SAAC+D,EAAO0N,GACP1N,GAAOL,EAAOK,GAClBN,EAAQgO,EAAOhI,KAAI,SAAA06C,GAAG,OAAIA,EAAI7/C,KAAK8/C,gB,0DAKxB,WACjB,OAAO,IAAIngD,SAAQ,SAACR,EAASC,GAC3B,EAAK+8C,eAAe,CAAEuD,QAAQ,IAC3BK,KAAK,GAAI,CAAEvD,UAAW,EAAGE,QAAS,WAClChhD,KAAI,SAAC+D,EAAO0N,GACP1N,GAAOL,EAAOK,GAClBN,EAAQgO,EAAOhI,KAAI,SAAA06C,GAAG,OAAIA,EAAI7/C,KAAK49C,kB,sDAOH,6DAAJ,GAAI,IAAvB8B,cAAuB,SACtC,OAAIA,EAAe3/C,KAAKrE,IAAI,iBAAiBskD,sBAAsBnO,SAC5D9xC,KAAKrE,IAAI,iBAAiBukD,kBAAkBpO,a,cAxQbqO,gB,2BCN1C5lD,EAAOD,QAJP,SAAS8lD,gBAAgB/7C,GACvB,GAAIa,MAAMgY,QAAQ7Y,GAAM,OAAOA,I,cC0BjC9J,EAAOD,QA3BP,SAAS+lD,sBAAsBh8C,EAAKvJ,GAClC,GAAsB,oBAAXe,QAA4BA,OAAOmH,YAAYxH,OAAO6I,GAAjE,CACA,IAAIi8C,EAAO,GACPC,GAAK,EACLC,GAAK,EACLrjC,OAAK9c,EAET,IACE,IAAK,IAAiCogD,EAA7Bz0C,EAAK3H,EAAIxI,OAAOmH,cAAmBu9C,GAAME,EAAKz0C,EAAG8J,QAAQnW,QAChE2gD,EAAKv5C,KAAK05C,EAAG1kD,QAETjB,GAAKwlD,EAAK7iD,SAAW3C,GAH8CylD,GAAK,IAK9E,MAAOngD,GACPogD,GAAK,EACLrjC,EAAK/c,EACL,QACA,IACOmgD,GAAsB,MAAhBv0C,EAAW,QAAWA,EAAW,SAC5C,QACA,GAAIw0C,EAAI,MAAMrjC,GAIlB,OAAOmjC,K,cCpBT/lD,EAAOD,QAJP,SAASomD,mBACP,MAAM,IAAIrjD,UAAU,+I,gBCMtB,IAAIsjD,EAAW,SAAUrmD,GAGvB,IAAIsmD,EAAKplD,OAAOoB,UACZswB,EAAS0zB,EAAG/jD,eAEZ8Q,EAA4B,mBAAX9R,OAAwBA,OAAS,GAClDglD,EAAiBlzC,EAAQ3K,UAAY,aACrC89C,EAAsBnzC,EAAQozC,eAAiB,kBAC/CC,EAAoBrzC,EAAQ7R,aAAe,gBAE/C,SAASojB,KAAK+hC,EAASC,EAASpiD,EAAMqiD,GAEpC,IAAIC,EAAiBF,GAAWA,EAAQtkD,qBAAqBykD,UAAYH,EAAUG,UAC/EC,EAAY9lD,OAAOY,OAAOglD,EAAexkD,WACzC8jC,EAAU,IAAI6gB,QAAQJ,GAAe,IAMzC,OAFAG,EAAUE,QAqMZ,SAASC,iBAAiBR,EAASniD,EAAM4hC,GACvC,IAAI32B,EA9KuB,iBAgL3B,OAAO,SAAS23C,OAAOn9B,EAAQ/kB,GAC7B,GA/KoB,cA+KhBuK,EACF,MAAM,IAAI7D,MAAM,gCAGlB,GAlLoB,cAkLhB6D,EAA6B,CAC/B,GAAe,UAAXwa,EACF,MAAM/kB,EAKR,OAAOmiD,aAMT,IAHAjhB,EAAQnc,OAASA,EACjBmc,EAAQlhC,IAAMA,IAED,CACX,IAAIoiD,EAAWlhB,EAAQkhB,SACvB,GAAIA,EAAU,CACZ,IAAIC,EAAiBC,oBAAoBF,EAAUlhB,GACnD,GAAImhB,EAAgB,CAClB,GAAIA,IAAmBE,EAAkB,SACzC,OAAOF,GAIX,GAAuB,SAAnBnhB,EAAQnc,OAGVmc,EAAQshB,KAAOthB,EAAQuhB,MAAQvhB,EAAQlhC,SAElC,GAAuB,UAAnBkhC,EAAQnc,OAAoB,CACrC,GAlNqB,mBAkNjBxa,EAEF,MADAA,EAhNc,YAiNR22B,EAAQlhC,IAGhBkhC,EAAQwhB,kBAAkBxhB,EAAQlhC,SAEN,WAAnBkhC,EAAQnc,QACjBmc,EAAQyhB,OAAO,SAAUzhB,EAAQlhC,KAGnCuK,EA3NkB,YA6NlB,IAAIq4C,EAASC,SAASpB,EAASniD,EAAM4hC,GACrC,GAAoB,WAAhB0hB,EAAOthD,KAAmB,CAO5B,GAJAiJ,EAAQ22B,EAAQ/gC,KAhOA,YAFK,iBAsOjByiD,EAAO5iD,MAAQuiD,EACjB,SAGF,MAAO,CACLhmD,MAAOqmD,EAAO5iD,IACdG,KAAM+gC,EAAQ/gC,MAGS,UAAhByiD,EAAOthD,OAChBiJ,EA9OgB,YAiPhB22B,EAAQnc,OAAS,QACjBmc,EAAQlhC,IAAM4iD,EAAO5iD,OA7QPiiD,CAAiBR,EAASniD,EAAM4hC,GAE7C4gB,EAcT,SAASe,SAAStiD,EAAI9C,EAAKuC,GACzB,IACE,MAAO,CAAEsB,KAAM,SAAUtB,IAAKO,EAAG9E,KAAKgC,EAAKuC,IAC3C,MAAOY,GACP,MAAO,CAAEU,KAAM,QAAStB,IAAKY,IAhBjC9F,EAAQ4kB,KAAOA,KAoBf,IAOI6iC,EAAmB,GAMvB,SAASV,aACT,SAASiB,qBACT,SAASC,8BAIT,IAAIpsC,EAAoB,GACxBA,EAAkB0qC,GAAkB,WAClC,OAAO7gD,MAGT,IAAIwiD,EAAWhnD,OAAO0C,eAClBukD,EAA0BD,GAAYA,EAASA,EAASjsC,OAAO,MAC/DksC,GACAA,IAA4B7B,GAC5B1zB,EAAOjyB,KAAKwnD,EAAyB5B,KAGvC1qC,EAAoBssC,GAGtB,IAAIC,EAAKH,2BAA2B3lD,UAClCykD,UAAUzkD,UAAYpB,OAAOY,OAAO+Z,GAQtC,SAASwsC,sBAAsB/lD,GAC7B,CAAC,OAAQ,QAAS,UAAU6J,SAAQ,SAAS8d,GAC3C3nB,EAAU2nB,GAAU,SAAS/kB,GAC3B,OAAOQ,KAAKwhD,QAAQj9B,EAAQ/kB,OAoClC,SAASojD,cAActB,EAAWuB,GAgChC,IAAIC,EAgCJ9iD,KAAKwhD,QA9BL,SAASuB,QAAQx+B,EAAQ/kB,GACvB,SAASwjD,6BACP,OAAO,IAAIH,GAAY,SAASzjD,EAASC,IAnC7C,SAASqiD,OAAOn9B,EAAQ/kB,EAAKJ,EAASC,GACpC,IAAI+iD,EAASC,SAASf,EAAU/8B,GAAS+8B,EAAW9hD,GACpD,GAAoB,UAAhB4iD,EAAOthD,KAEJ,CACL,IAAIsM,EAASg1C,EAAO5iD,IAChBzD,EAAQqR,EAAOrR,MACnB,OAAIA,GACiB,iBAAVA,GACPmxB,EAAOjyB,KAAKc,EAAO,WACd8mD,EAAYzjD,QAAQrD,EAAMknD,SAASpjD,MAAK,SAAS9D,GACtD2lD,OAAO,OAAQ3lD,EAAOqD,EAASC,MAC9B,SAASe,GACVshD,OAAO,QAASthD,EAAKhB,EAASC,MAI3BwjD,EAAYzjD,QAAQrD,GAAO8D,MAAK,SAASqjD,GAI9C91C,EAAOrR,MAAQmnD,EACf9jD,EAAQgO,MACP,SAAS1N,GAGV,OAAOgiD,OAAO,QAAShiD,EAAON,EAASC,MAvBzCA,EAAO+iD,EAAO5iD,KAiCZkiD,CAAOn9B,EAAQ/kB,EAAKJ,EAASC,MAIjC,OAAOyjD,EAaLA,EAAkBA,EAAgBjjD,KAChCmjD,2BAGAA,4BACEA,8BAkHV,SAASlB,oBAAoBF,EAAUlhB,GACrC,IAAInc,EAASq9B,EAAS5+C,SAAS09B,EAAQnc,QACvC,QAvSElkB,IAuSEkkB,EAAsB,CAKxB,GAFAmc,EAAQkhB,SAAW,KAEI,UAAnBlhB,EAAQnc,OAAoB,CAE9B,GAAIq9B,EAAS5+C,SAAiB,SAG5B09B,EAAQnc,OAAS,SACjBmc,EAAQlhC,SAlTZa,EAmTIyhD,oBAAoBF,EAAUlhB,GAEP,UAAnBA,EAAQnc,QAGV,OAAOw9B,EAIXrhB,EAAQnc,OAAS,QACjBmc,EAAQlhC,IAAM,IAAInC,UAChB,kDAGJ,OAAO0kD,EAGT,IAAIK,EAASC,SAAS99B,EAAQq9B,EAAS5+C,SAAU09B,EAAQlhC,KAEzD,GAAoB,UAAhB4iD,EAAOthD,KAIT,OAHA4/B,EAAQnc,OAAS,QACjBmc,EAAQlhC,IAAM4iD,EAAO5iD,IACrBkhC,EAAQkhB,SAAW,KACZG,EAGT,IAAItiD,EAAO2iD,EAAO5iD,IAElB,OAAMC,EAOFA,EAAKE,MAGP+gC,EAAQkhB,EAASuB,YAAc1jD,EAAK1D,MAGpC2kC,EAAQ5qB,KAAO8rC,EAASwB,QAQD,WAAnB1iB,EAAQnc,SACVmc,EAAQnc,OAAS,OACjBmc,EAAQlhC,SAtWVa,GAgXFqgC,EAAQkhB,SAAW,KACZG,GANEtiD,GA3BPihC,EAAQnc,OAAS,QACjBmc,EAAQlhC,IAAM,IAAInC,UAAU,oCAC5BqjC,EAAQkhB,SAAW,KACZG,GAoDX,SAASsB,aAAaC,GACpB,IAAIC,EAAQ,CAAEC,OAAQF,EAAK,IAEvB,KAAKA,IACPC,EAAME,SAAWH,EAAK,IAGpB,KAAKA,IACPC,EAAMG,WAAaJ,EAAK,GACxBC,EAAMI,SAAWL,EAAK,IAGxBtjD,KAAK4jD,WAAW78C,KAAKw8C,GAGvB,SAASM,cAAcN,GACrB,IAAInB,EAASmB,EAAMO,YAAc,GACjC1B,EAAOthD,KAAO,gBACPshD,EAAO5iD,IACd+jD,EAAMO,WAAa1B,EAGrB,SAASb,QAAQJ,GAIfnhD,KAAK4jD,WAAa,CAAC,CAAEJ,OAAQ,SAC7BrC,EAAY16C,QAAQ48C,aAAcrjD,MAClCA,KAAK+jD,OAAM,GA8Bb,SAASxtC,OAAOytC,GACd,GAAIA,EAAU,CACZ,IAAIC,EAAiBD,EAASnD,GAC9B,GAAIoD,EACF,OAAOA,EAAehpD,KAAK+oD,GAG7B,GAA6B,mBAAlBA,EAASluC,KAClB,OAAOkuC,EAGT,IAAKx4C,MAAMw4C,EAASvmD,QAAS,CAC3B,IAAI3C,GAAK,EAAGgb,EAAO,SAASA,OAC1B,OAAShb,EAAIkpD,EAASvmD,QACpB,GAAIyvB,EAAOjyB,KAAK+oD,EAAUlpD,GAGxB,OAFAgb,KAAK/Z,MAAQioD,EAASlpD,GACtBgb,KAAKnW,MAAO,EACLmW,KAOX,OAHAA,KAAK/Z,WAtdTsE,EAudIyV,KAAKnW,MAAO,EAELmW,MAGT,OAAOA,EAAKA,KAAOA,GAKvB,MAAO,CAAEA,KAAM6rC,YAIjB,SAASA,aACP,MAAO,CAAE5lD,WAtePsE,EAseyBV,MAAM,GA+MnC,OA3mBA2iD,kBAAkB1lD,UAAY8lD,EAAGhkD,YAAc6jD,2BAC/CA,2BAA2B7jD,YAAc4jD,kBACzCC,2BAA2BvB,GACzBsB,kBAAkB4B,YAAc,oBAYlC5pD,EAAQ6pD,oBAAsB,SAASC,GACrC,IAAI9vC,EAAyB,mBAAX8vC,GAAyBA,EAAO1lD,YAClD,QAAO4V,IACHA,IAASguC,mBAG2B,uBAAnChuC,EAAK4vC,aAAe5vC,EAAKjZ,QAIhCf,EAAQwkB,KAAO,SAASslC,GAUtB,OATI5oD,OAAOyC,eACTzC,OAAOyC,eAAemmD,EAAQ7B,6BAE9B6B,EAAOjmD,UAAYokD,2BACbvB,KAAqBoD,IACzBA,EAAOpD,GAAqB,sBAGhCoD,EAAOxnD,UAAYpB,OAAOY,OAAOsmD,GAC1B0B,GAOT9pD,EAAQ+pD,MAAQ,SAAS7kD,GACvB,MAAO,CAAEyjD,QAASzjD,IAsEpBmjD,sBAAsBC,cAAchmD,WACpCgmD,cAAchmD,UAAUkkD,GAAuB,WAC7C,OAAO9gD,MAET1F,EAAQsoD,cAAgBA,cAKxBtoD,EAAQgqD,MAAQ,SAASrD,EAASC,EAASpiD,EAAMqiD,EAAa0B,QACxC,IAAhBA,IAAwBA,EAAcjjD,SAE1C,IAAI42B,EAAO,IAAIosB,cACb1jC,KAAK+hC,EAASC,EAASpiD,EAAMqiD,GAC7B0B,GAGF,OAAOvoD,EAAQ6pD,oBAAoBjD,GAC/B1qB,EACAA,EAAK1gB,OAAOjW,MAAK,SAASuN,GACxB,OAAOA,EAAOzN,KAAOyN,EAAOrR,MAAQy6B,EAAK1gB,WAuKjD6sC,sBAAsBD,GAEtBA,EAAG1B,GAAqB,YAOxB0B,EAAG7B,GAAkB,WACnB,OAAO7gD,MAGT0iD,EAAG38C,SAAW,WACZ,MAAO,sBAkCTzL,EAAQ8N,KAAO,SAAS1L,GACtB,IAAI0L,EAAO,GACX,IAAK,IAAI/L,KAAOK,EACd0L,EAAKrB,KAAK1K,GAMZ,OAJA+L,EAAKwe,UAIE,SAAS9Q,OACd,KAAO1N,EAAK3K,QAAQ,CAClB,IAAIpB,EAAM+L,EAAKqc,MACf,GAAIpoB,KAAOK,EAGT,OAFAoZ,KAAK/Z,MAAQM,EACbyZ,KAAKnW,MAAO,EACLmW,KAQX,OADAA,KAAKnW,MAAO,EACLmW,OAsCXxb,EAAQic,OAASA,OAMjBgrC,QAAQ3kD,UAAY,CAClB8B,YAAa6iD,QAEbwC,MAAO,SAASQ,GAcd,GAbAvkD,KAAKqf,KAAO,EACZrf,KAAK8V,KAAO,EAGZ9V,KAAKgiD,KAAOhiD,KAAKiiD,WAjfjB5hD,EAkfAL,KAAKL,MAAO,EACZK,KAAK4hD,SAAW,KAEhB5hD,KAAKukB,OAAS,OACdvkB,KAAKR,SAtfLa,EAwfAL,KAAK4jD,WAAWn9C,QAAQo9C,gBAEnBU,EACH,IAAK,IAAIlpD,KAAQ2E,KAEQ,MAAnB3E,EAAK4K,OAAO,IACZinB,EAAOjyB,KAAK+E,KAAM3E,KACjBmQ,OAAOnQ,EAAKuL,MAAM,MACrB5G,KAAK3E,QAhgBXgF,IAsgBFof,KAAM,WACJzf,KAAKL,MAAO,EAEZ,IACI6kD,EADYxkD,KAAK4jD,WAAW,GACLE,WAC3B,GAAwB,UAApBU,EAAW1jD,KACb,MAAM0jD,EAAWhlD,IAGnB,OAAOQ,KAAKykD,MAGdvC,kBAAmB,SAASwC,GAC1B,GAAI1kD,KAAKL,KACP,MAAM+kD,EAGR,IAAIhkB,EAAU1gC,KACd,SAAS2kD,OAAOC,EAAKC,GAYnB,OAXAzC,EAAOthD,KAAO,QACdshD,EAAO5iD,IAAMklD,EACbhkB,EAAQ5qB,KAAO8uC,EAEXC,IAGFnkB,EAAQnc,OAAS,OACjBmc,EAAQlhC,SAjiBZa,KAoiBYwkD,EAGZ,IAAK,IAAI/pD,EAAIkF,KAAK4jD,WAAWnmD,OAAS,EAAG3C,GAAK,IAAKA,EAAG,CACpD,IAAIyoD,EAAQvjD,KAAK4jD,WAAW9oD,GACxBsnD,EAASmB,EAAMO,WAEnB,GAAqB,SAAjBP,EAAMC,OAIR,OAAOmB,OAAO,OAGhB,GAAIpB,EAAMC,QAAUxjD,KAAKqf,KAAM,CAC7B,IAAIylC,EAAW53B,EAAOjyB,KAAKsoD,EAAO,YAC9BwB,EAAa73B,EAAOjyB,KAAKsoD,EAAO,cAEpC,GAAIuB,GAAYC,EAAY,CAC1B,GAAI/kD,KAAKqf,KAAOkkC,EAAME,SACpB,OAAOkB,OAAOpB,EAAME,UAAU,GACzB,GAAIzjD,KAAKqf,KAAOkkC,EAAMG,WAC3B,OAAOiB,OAAOpB,EAAMG,iBAGjB,GAAIoB,GACT,GAAI9kD,KAAKqf,KAAOkkC,EAAME,SACpB,OAAOkB,OAAOpB,EAAME,UAAU,OAG3B,KAAIsB,EAMT,MAAM,IAAI7+C,MAAM,0CALhB,GAAIlG,KAAKqf,KAAOkkC,EAAMG,WACpB,OAAOiB,OAAOpB,EAAMG,gBAU9BvB,OAAQ,SAASrhD,EAAMtB,GACrB,IAAK,IAAI1E,EAAIkF,KAAK4jD,WAAWnmD,OAAS,EAAG3C,GAAK,IAAKA,EAAG,CACpD,IAAIyoD,EAAQvjD,KAAK4jD,WAAW9oD,GAC5B,GAAIyoD,EAAMC,QAAUxjD,KAAKqf,MACrB6N,EAAOjyB,KAAKsoD,EAAO,eACnBvjD,KAAKqf,KAAOkkC,EAAMG,WAAY,CAChC,IAAIsB,EAAezB,EACnB,OAIAyB,IACU,UAATlkD,GACS,aAATA,IACDkkD,EAAaxB,QAAUhkD,GACvBA,GAAOwlD,EAAatB,aAGtBsB,EAAe,MAGjB,IAAI5C,EAAS4C,EAAeA,EAAalB,WAAa,GAItD,OAHA1B,EAAOthD,KAAOA,EACdshD,EAAO5iD,IAAMA,EAETwlD,GACFhlD,KAAKukB,OAAS,OACdvkB,KAAK8V,KAAOkvC,EAAatB,WAClB3B,GAGF/hD,KAAKilD,SAAS7C,IAGvB6C,SAAU,SAAS7C,EAAQuB,GACzB,GAAoB,UAAhBvB,EAAOthD,KACT,MAAMshD,EAAO5iD,IAcf,MAXoB,UAAhB4iD,EAAOthD,MACS,aAAhBshD,EAAOthD,KACTd,KAAK8V,KAAOssC,EAAO5iD,IACM,WAAhB4iD,EAAOthD,MAChBd,KAAKykD,KAAOzkD,KAAKR,IAAM4iD,EAAO5iD,IAC9BQ,KAAKukB,OAAS,SACdvkB,KAAK8V,KAAO,OACa,WAAhBssC,EAAOthD,MAAqB6iD,IACrC3jD,KAAK8V,KAAO6tC,GAGP5B,GAGTviC,OAAQ,SAASkkC,GACf,IAAK,IAAI5oD,EAAIkF,KAAK4jD,WAAWnmD,OAAS,EAAG3C,GAAK,IAAKA,EAAG,CACpD,IAAIyoD,EAAQvjD,KAAK4jD,WAAW9oD,GAC5B,GAAIyoD,EAAMG,aAAeA,EAGvB,OAFA1jD,KAAKilD,SAAS1B,EAAMO,WAAYP,EAAMI,UACtCE,cAAcN,GACPxB,IAKb,MAAS,SAASyB,GAChB,IAAK,IAAI1oD,EAAIkF,KAAK4jD,WAAWnmD,OAAS,EAAG3C,GAAK,IAAKA,EAAG,CACpD,IAAIyoD,EAAQvjD,KAAK4jD,WAAW9oD,GAC5B,GAAIyoD,EAAMC,SAAWA,EAAQ,CAC3B,IAAIpB,EAASmB,EAAMO,WACnB,GAAoB,UAAhB1B,EAAOthD,KAAkB,CAC3B,IAAIokD,EAAS9C,EAAO5iD,IACpBqkD,cAAcN,GAEhB,OAAO2B,GAMX,MAAM,IAAIh/C,MAAM,0BAGlBi/C,cAAe,SAASnB,EAAUb,EAAYC,GAa5C,OAZApjD,KAAK4hD,SAAW,CACd5+C,SAAUuT,OAAOytC,GACjBb,WAAYA,EACZC,QAASA,GAGS,SAAhBpjD,KAAKukB,SAGPvkB,KAAKR,SA1qBPa,GA6qBO0hD,IAQJznD,EA1rBK,CAisBiBC,EAAOD,SAGtC,IACE8qD,mBAAqBzE,EACrB,MAAO0E,GAUPnjD,SAAS,IAAK,yBAAdA,CAAwCy+C,K,gBCvtB1C,IAAI2E,EAAgB,EAAQ,KAE5B,SAASC,KAAKhoD,EAAQZ,EAAU6oD,GAiB9B,MAhBuB,oBAAZ72C,SAA2BA,QAAQhT,IAC5CpB,EAAOD,QAAUirD,KAAO52C,QAAQhT,IAEhCpB,EAAOD,QAAUirD,KAAO,SAASA,KAAKhoD,EAAQZ,EAAU6oD,GACtD,IAAIv+B,EAAOq+B,EAAc/nD,EAAQZ,GACjC,GAAKsqB,EAAL,CACA,IAAIlV,EAAOvW,OAAOsW,yBAAyBmV,EAAMtqB,GAEjD,OAAIoV,EAAKpW,IACAoW,EAAKpW,IAAIV,KAAKuqD,GAGhBzzC,EAAKhW,QAITwpD,KAAKhoD,EAAQZ,EAAU6oD,GAAYjoD,GAG5ChD,EAAOD,QAAUirD,M,gBCtBjB,IAAIrnD,EAAiB,EAAQ,GAW7B3D,EAAOD,QATP,SAASmrD,eAAe/oD,EAAQC,GAC9B,MAAQnB,OAAOoB,UAAUC,eAAe5B,KAAKyB,EAAQC,IAEpC,QADfD,EAASwB,EAAexB,MAI1B,OAAOA,I,cCJTnC,EAAOD,QAJP,SAASorD,kBAAkB3lD,GACzB,OAAgE,IAAzDmC,SAAS6D,SAAS9K,KAAK8E,GAAIoZ,QAAQ,mB,gBCD5C,IAAIlb,EAAiB,EAAQ,IAEzB0nD,EAA2B,EAAQ,KAEvC,SAASC,WAAWC,EAAQ5lD,EAAMkR,GAchC,OAbIw0C,IACFprD,EAAOD,QAAUsrD,WAAaj3C,QAAQC,UAEtCrU,EAAOD,QAAUsrD,WAAa,SAASA,WAAWC,EAAQ5lD,EAAMkR,GAC9D,IAAInP,EAAI,CAAC,MACTA,EAAE+E,KAAK5G,MAAM6B,EAAG/B,GAChB,IACI9C,EAAW,IADG+E,SAAS5F,KAAK6D,MAAM0lD,EAAQ7jD,IAG9C,OADImP,GAAOlT,EAAed,EAAUgU,EAAMvU,WACnCO,GAIJyoD,WAAWzlD,MAAM,KAAMD,WAGhC3F,EAAOD,QAAUsrD,Y,cCRjBrrD,EAAOD,QAbP,SAASoU,4BACP,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EACjE,GAAID,QAAQC,UAAUC,KAAM,OAAO,EACnC,GAAqB,mBAAVC,MAAsB,OAAO,EAExC,IAEE,OADAC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAClD,EACP,MAAOhM,GACP,OAAO,K,gBCPX,IAAI4O,EAA0BxO,EAAQ,IAElCnG,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAIkO,EAAmBxL,EAAuBmG,EAAQ,IAElDsF,EAAgBzL,EAAuBmG,EAAQ,IAE/CQ,EAAgB3G,EAAuBmG,EAAQ,KAE/CiE,EAAgBpK,EAAuBmG,EAAQ,KAE/CuF,EAAeiJ,EAAwBxO,EAAQ,KAI/C28C,GAAM,EAFG9iD,EAAuBmG,EAAQ,MAExB,SAAa,0BAEjC,SAAS2iD,WAAWC,GAClB,OAAO,IAAInmD,SAAQ,SAAUR,EAASC,GACpC,IACED,EAAQ2mD,KACR,MAAOhjD,GACP1D,EAAO0D,EAAEqM,aAKf,IA+YIpF,EA/YkC,WAMpC,SAASg8C,qBACP,IAAIh2C,EAAO9P,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAC3E2I,EAAU3I,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAC9EkJ,EAAOlJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAI/E,IAHA,EAAIsI,EAAgB,SAAaxI,KAAMgmD,oBAG1B,OAATh2C,GAAiC,mBAATA,EAC1B,MAAM,IAAI9J,MAAM,kDAQlB,GAPoB,OAAT8J,IACTA,EAAO,SAASA,OACd,OAAOpQ,QAAQR,YAKH,OAAZyJ,GAAuC,mBAAZA,EAC7B,MAAM,IAAI3C,MAAM,qDAQlB,GAPuB,OAAZ2C,GAA6B,OAATO,IAC7BP,EAAU,SAASA,UACjB,OAAOjJ,QAAQR,YAKN,OAATgK,GAAiC,mBAATA,EAC1B,MAAM,IAAIlD,MAAM,kDAIlBlG,KAAKimD,MAAQj2C,EACbhQ,KAAKkmD,SAAWr9C,EAChB7I,KAAKmmD,MAAQ/8C,EACbpJ,KAAKomD,MAAiB,OAATh9C,EAA4B,OAAZP,EAAmBH,EAAY,QAAYrB,MAAQqB,EAAY,QAAYpB,OAASoB,EAAY,QAAYnB,QACzIvH,KAAK8Y,OAAS,IAAInV,EAAa,QAAYyD,EAAa,QAAYI,QAASkB,EAAavB,uBAAuBnH,KAAKomD,QACtHpmD,KAAKqmD,aAAe,KACpBrmD,KAAKsmD,gBAAkB,KACvBtmD,KAAKumD,aAAe,KAiWtB,OA1VA,EAAI99C,EAAa,SAAau9C,mBAAoB,CAAC,CACjD3pD,IAAK,aACLN,MAAO,SAAS6M,WAAWS,GACzB,IAAIF,EAAQnJ,KAGZ,GAAIA,KAAK8Y,OAAOI,QAAQ9R,EAAa,QAAYI,SAAU,CAIzD,GAAIxH,KAAKqmD,aACP,MAAM,IAAIngD,MAAM,6CAIlBlG,KAAK8Y,OAAOQ,aAAalS,EAAa,QAAYK,cAGlDzH,KAAKqmD,aAAeP,YAAW,WAC7B,OAAO38C,EAAM88C,MAAM58C,MAClBxJ,MAAK,WACN,OAAOsJ,EAAM2P,OAAOQ,aAAanQ,EAAMi9C,QAAU19C,EAAY,QAAYrB,MAAQD,EAAa,QAAYM,MAAQN,EAAa,QAAYQ,YAC1I,SAAU4+C,GAKX,MAJA1G,EAAI0G,GAEJr9C,EAAM2P,OAAOQ,aAAalS,EAAa,QAAYI,SAE7Cg/C,KAIV,OAAOxmD,KAAKqmD,eAMb,CACDhqD,IAAK,UACLN,MAAO,SAAS8M,UACd,IAAIW,EAASxJ,KAGb,OAAIA,KAAKomD,QAAU19C,EAAY,QAAYrB,MAClCrH,KAAK4I,cAIV5I,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYI,QAASJ,EAAa,QAAYK,aAAcL,EAAa,QAAYQ,WAAsC,OAAzB5H,KAAKsmD,kBAE3ItmD,KAAKsmD,gBAAkBtmD,KAAK4I,aAAa/I,MAAK,WAK5C,OAHA2J,EAAOsP,OAAOQ,aAAalS,EAAa,QAAYS,YAG7Ci+C,YAAW,WAChB,OAAOt8C,EAAO08C,UAAS,WACrB,OAAO18C,EAAOi9C,oBAEf5mD,MAAK,WAEF2J,EAAOsP,OAAOI,QAAQ9R,EAAa,QAAYS,aACjD2B,EAAOsP,OAAOQ,aAAa9P,EAAO48C,QAAU19C,EAAY,QAAYpB,OAASF,EAAa,QAAYM,MAAQN,EAAa,QAAYU,WAExI,SAAUpI,GAOX,MANAogD,EAAI,iBAAkBpgD,GAElB8J,EAAOsP,OAAOI,QAAQ9R,EAAa,QAAYS,aACjD2B,EAAOsP,OAAOQ,aAAalS,EAAa,QAAYQ,SAGhDlI,SAKLM,KAAKsmD,mBAMb,CACDjqD,IAAK,eACLN,MAAO,SAASgN,eACd,IAAIyH,EAASxQ,KAGb,OAAIA,KAAKomD,QAAU19C,EAAY,QAAYnB,QAClCvH,KAAK6I,WAIV7I,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYI,QAASJ,EAAa,QAAYK,aAAcL,EAAa,QAAYQ,QAASR,EAAa,QAAYS,WAAYT,EAAa,QAAYU,UAAkC,OAAtB9H,KAAKumD,eAEjNvmD,KAAKumD,aAAevmD,KAAK6I,UAAUhJ,MAAK,WAKtC,OAHA2Q,EAAOsI,OAAOQ,aAAalS,EAAa,QAAYW,gBAG7C+9C,YAAW,WAChB,OAAOt1C,EAAO21C,OAAM,WAClB,OAAO31C,EAAOk2C,wBAEf7mD,MAAK,WAGF2Q,EAAOsI,OAAOI,QAAQ9R,EAAa,QAAYW,iBACjDyI,EAAOsI,OAAOQ,aAAalS,EAAa,QAAYM,UAErD,SAAU8+C,GACX1G,EAAI,uBAAyB0G,GAEzBh2C,EAAOsI,OAAOI,QAAQ9R,EAAa,QAAYW,iBACjDyI,EAAOsI,OAAOQ,aAAalS,EAAa,QAAYU,eAMrD9H,KAAKumD,gBAMb,CACDlqD,IAAK,WACLN,MAAO,SAASsN,SAASkH,GAEvB,OADAvQ,KAAKuQ,UAAYA,EACVvQ,OAMR,CACD3D,IAAK,QACLN,MAAO,SAASgO,QACd,OAAO/J,KAAK8Y,OAAO/O,UAMpB,CACD1N,IAAK,OACLN,MAAO,SAAS+E,OACd,OAAOd,KAAKomD,QAMb,CACD/pD,IAAK,gBACLN,MAAO,SAAS4qD,gBACd,OAAQ3mD,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYI,QAASJ,EAAa,QAAYK,iBAMzF,CACDpL,IAAK,cACLN,MAAO,SAAS6qD,cACd,OAAO5mD,KAAKomD,QAAU19C,EAAY,QAAYrB,MAAQ,KAAOrH,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYU,OAAQV,EAAa,QAAYW,eAAgBX,EAAa,QAAYM,UAMtL,CACDrL,IAAK,kBACLN,MAAO,SAASmiB,kBACd,OAAOle,KAAKomD,QAAU19C,EAAY,QAAYnB,QAAUvH,KAAK8Y,OAAOI,QAAQ9R,EAAa,QAAYM,OAAS,OAM/G,CACDrL,IAAK,UACLN,MAAO,SAAS8qD,UACd,OAAO7mD,KAAK8Y,OAAOI,QAAQ9R,EAAa,QAAYM,SAOrD,CACDrL,IAAK,gBACLN,MAAO,SAAS0N,cAAcq9C,GAO5B,OANA9mD,KAAK8Y,OAAOG,gBAAe,SAAUO,EAAUD,GACzCC,IAAapS,EAAa,QAAYK,cAAiB8R,IAAanS,EAAa,QAAYQ,SAAW2R,IAAanS,EAAa,QAAYM,OAChJo/C,OAIG9mD,OAOR,CACD3D,IAAK,cACLN,MAAO,SAASgrD,YAAYD,GAO1B,OANA9mD,KAAK8Y,OAAOG,gBAAe,SAAUO,EAAUD,GACzCC,IAAapS,EAAa,QAAYS,YAAe0R,IAAanS,EAAa,QAAYU,QAAUyR,IAAanS,EAAa,QAAYM,OAC7Io/C,OAIG9mD,OAOR,CACD3D,IAAK,iBACLN,MAAO,SAAS4N,eAAem9C,GAO7B,OANA9mD,KAAK8Y,OAAOG,gBAAe,SAAUO,EAAUD,GACzCA,IAAanS,EAAa,QAAYQ,SAAY4R,IAAapS,EAAa,QAAYU,QAAU0R,IAAapS,EAAa,QAAYM,OAC1Io/C,OAIG9mD,OAOR,CACD3D,IAAK,kBACLN,MAAO,SAASirD,gBAAgBF,GAO9B,OANA9mD,KAAK8Y,OAAOG,gBAAe,SAAUO,EAAUD,GACzCC,IAAapS,EAAa,QAAYW,gBAAkBwR,IAAanS,EAAa,QAAYM,OAChGo/C,OAIG9mD,OAOR,CACD3D,IAAK,oBACLN,MAAO,SAAS6N,kBAAkBk9C,GAShC,OARI9mD,KAAKc,SAAW4H,EAAY,QAAYnB,SAC1CvH,KAAK8Y,OAAOG,gBAAe,SAAUO,EAAUD,GACxCA,IAAanS,EAAa,QAAYQ,SAAW2R,IAAanS,EAAa,QAAYU,QAAW0R,IAAapS,EAAa,QAAYM,OAC3Io/C,OAKC9mD,OAOR,CACD3D,IAAK,UACLN,MAAO,SAASkrD,QAAQH,GAOtB,OANA9mD,KAAK8Y,OAAOG,gBAAe,SAAU6xB,EAAGvxB,GAClCA,IAAanS,EAAa,QAAYM,OACxCo/C,OAIG9mD,OAOR,CACD3D,IAAK,iBACLN,MAAO,SAASkd,eAAe6tC,GAG7B,OAFA9mD,KAAK8Y,OAAOG,eAAe6tC,GAEpB9mD,OAUR,CACD3D,IAAK,cACLN,MAAO,SAAS0qD,cAEd,GAAIzmD,KAAKomD,QAAU19C,EAAY,QAAYrB,MACzC,MAAM,IAAInB,MAAM,qDAGdlG,KAAK8Y,OAAOI,QAAQ9R,EAAa,QAAYW,iBAC/C/H,KAAK0mD,kBAGH1mD,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYM,MAAON,EAAa,QAAYU,OAAQV,EAAa,QAAYS,eACjH7H,KAAKumD,aAAe,KACpBvmD,KAAKsmD,gBAAkB,KAEvBtmD,KAAK8Y,OAAOQ,aAAalS,EAAa,QAAYQ,YAWrD,CACDvL,IAAK,kBACLN,MAAO,SAAS2qD,kBAEd,GAAI1mD,KAAKomD,QAAU19C,EAAY,QAAYnB,QACzC,MAAM,IAAIrB,MAAM,mEAGdlG,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYM,MAAON,EAAa,QAAYW,mBAChF/H,KAAKumD,aAAe,KAEpBvmD,KAAK8Y,OAAOQ,aAAalS,EAAa,QAAYU,aAIjDk+C,mBA5Y6B,GAgZtC1rD,EAAO,QAAc0P,G,iBCnbrB,YAqJA,SAASk9C,OACP,IAAItrD,EACJ,IACEA,EAAItB,EAAQ6sD,QAAQC,MACpB,MAAMrkD,IAOR,OAJKnH,QAAwB,IAAZge,GAA2B,QAASA,IACnDhe,EAAIge,EAAQsB,IAAI8I,OAGXpoB,GA1JTtB,EAAUC,EAAOD,QAAU,EAAQ,MAC3BwlD,IA8GR,SAASA,MAGP,MAAO,iBAAoBuH,SACtBA,QAAQvH,KACR59C,SAAStF,UAAUuD,MAAMlF,KAAKosD,QAAQvH,IAAKuH,QAASnnD,YAlH3D5F,EAAQgtD,WAqER,SAASA,WAAWrnD,GAClB,IAAIsnD,EAAYvnD,KAAKunD,UASrB,GAPAtnD,EAAK,IAAMsnD,EAAY,KAAO,IAC1BvnD,KAAKwnD,WACJD,EAAY,MAAQ,KACrBtnD,EAAK,IACJsnD,EAAY,MAAQ,KACrB,IAAMjtD,EAAQmtD,SAASznD,KAAK0nD,OAE3BH,EAAW,OAEhB,IAAIpsD,EAAI,UAAY6E,KAAK2nD,MACzB1nD,EAAKsmB,OAAO,EAAG,EAAGprB,EAAG,kBAKrB,IAAI+Q,EAAQ,EACR07C,EAAQ,EACZ3nD,EAAK,GAAG2jB,QAAQ,eAAe,SAASqK,GAClC,OAASA,IACb/hB,IACI,OAAS+hB,IAGX25B,EAAQ17C,OAIZjM,EAAKsmB,OAAOqhC,EAAO,EAAGzsD,IAlGxBb,EAAQutD,KA2HR,SAASA,KAAKC,GACZ,IACM,MAAQA,EACVxtD,EAAQ6sD,QAAQY,WAAW,SAE3BztD,EAAQ6sD,QAAQC,MAAQU,EAE1B,MAAM/kD,MAjIVzI,EAAQ4sD,KAAOA,KACf5sD,EAAQitD,UA2BR,SAASA,YAIP,GAAsB,oBAAX7sD,QAA0BA,OAAOkf,SAAmC,aAAxBlf,OAAOkf,QAAQ9Y,KACpE,OAAO,EAKT,MAA4B,oBAAbgM,UAA4BA,SAAS6nC,iBAAmB7nC,SAAS6nC,gBAAgBloC,OAASK,SAAS6nC,gBAAgBloC,MAAMu7C,kBAEnH,oBAAXttD,QAA0BA,OAAO2sD,UAAY3sD,OAAO2sD,QAAQY,SAAYvtD,OAAO2sD,QAAQ3C,WAAahqD,OAAO2sD,QAAQa,QAGrG,oBAAdC,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUnkC,cAAcgK,MAAM,mBAAqBzpB,SAAS+B,OAAOu5B,GAAI,KAAO,IAE9H,oBAAdqoB,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUnkC,cAAcgK,MAAM,uBA3CxG3zB,EAAQ6sD,QAAU,oBAAsBkB,aACtB,IAAsBA,OAAOlB,QAC3BkB,OAAOlB,QAAQmB,MAsKnC,SAASC,eACP,IACE,OAAO7tD,OAAO8tD,aACd,MAAOzlD,KAxKSwlD,GAMpBjuD,EAAQmuD,OAAS,CACf,gBACA,cACA,YACA,aACA,aACA,WAmCFnuD,EAAQouD,WAAW/hD,EAAI,SAAS6e,GAC9B,IACE,OAAOmwB,KAAKE,UAAUrwB,GACtB,MAAOplB,GACP,MAAO,+BAAiCA,EAAIgP,UAqGhD9U,EAAQquD,OAAOzB,U,kCCrIf,IAAI0B,EA4BJ,SAASC,YAAYrB,GAEnB,SAASJ,QAEP,GAAKA,MAAM0B,QAAX,CAEA,IAAIhqD,EAAOsoD,MAGP2B,GAAQ,IAAIh6C,KACZi6C,EAAKD,GAAQH,GAAYG,GAC7BjqD,EAAK4oD,KAAOsB,EACZlqD,EAAKugB,KAAOupC,EACZ9pD,EAAKiqD,KAAOA,EACZH,EAAWG,EAIX,IADA,IAAI9oD,EAAO,IAAIiF,MAAMhF,UAAUzC,QACtB3C,EAAI,EAAGA,EAAImF,EAAKxC,OAAQ3C,IAC/BmF,EAAKnF,GAAKoF,UAAUpF,GAGtBmF,EAAK,GAAK3F,EAAQ2uD,OAAOhpD,EAAK,IAE1B,iBAAoBA,EAAK,IAE3BA,EAAKipD,QAAQ,MAIf,IAAIh9C,EAAQ,EACZjM,EAAK,GAAKA,EAAK,GAAG2jB,QAAQ,iBAAiB,SAASqK,EAAO/J,GAEzD,GAAc,OAAV+J,EAAgB,OAAOA,EAC3B/hB,IACA,IAAIi9C,EAAY7uD,EAAQouD,WAAWxkC,GACnC,GAAI,mBAAsBilC,EAAW,CACnC,IAAI99C,EAAMpL,EAAKiM,GACf+hB,EAAQk7B,EAAUluD,KAAK6D,EAAMuM,GAG7BpL,EAAKsmB,OAAOra,EAAO,GACnBA,IAEF,OAAO+hB,KAIT3zB,EAAQgtD,WAAWrsD,KAAK6D,EAAMmB,GAE9B,IAAImpD,EAAQhC,MAAMtH,KAAOxlD,EAAQwlD,KAAOuH,QAAQvH,IAAIxjD,KAAK+qD,SACzD+B,EAAMjpD,MAAMrB,EAAMmB,IAapB,OAVAmnD,MAAMI,UAAYA,EAClBJ,MAAM0B,QAAUxuD,EAAQwuD,QAAQtB,GAChCJ,MAAMG,UAAYjtD,EAAQitD,YAC1BH,MAAMO,MA5ER,SAAS0B,YAAY7B,GACnB,IAAc1sD,EAAVwuD,EAAO,EAEX,IAAKxuD,KAAK0sD,EACR8B,GAAUA,GAAQ,GAAKA,EAAQ9B,EAAUzmC,WAAWjmB,GACpDwuD,GAAQ,EAGV,OAAOhvD,EAAQmuD,OAAOnmD,KAAKumB,IAAIygC,GAAQhvD,EAAQmuD,OAAOhrD,QAoExC4rD,CAAY7B,GAGtB,mBAAsBltD,EAAQ0V,MAChC1V,EAAQ0V,KAAKo3C,OAGRA,OAtHT9sD,EAAUC,EAAOD,QAAUuuD,YAAYzB,MAAQyB,YAAqB,QAAIA,aAChEI,OA6LR,SAASA,OAAO59C,GACd,OAAIA,aAAenF,MAAcmF,EAAI2lB,OAAS3lB,EAAI+D,QAC3C/D,GA9LT/Q,EAAQivD,QAyJR,SAASA,UACPjvD,EAAQquD,OAAO,KAzJjBruD,EAAQquD,OA8HR,SAASA,OAAOb,GACdxtD,EAAQutD,KAAKC,GAEbxtD,EAAQqa,MAAQ,GAChBra,EAAQkvD,MAAQ,GAKhB,IAHA,IAAIljD,GAA+B,iBAAfwhD,EAA0BA,EAAa,IAAIxhD,MAAM,UACjEZ,EAAMY,EAAM7I,OAEP3C,EAAI,EAAGA,EAAI4K,EAAK5K,IAClBwL,EAAMxL,KAEW,OADtBgtD,EAAaxhD,EAAMxL,GAAG8oB,QAAQ,MAAO,QACtB,GACbtpB,EAAQkvD,MAAMziD,KAAK,IAAIR,OAAO,IAAMuhD,EAAW57B,OAAO,GAAK,MAE3D5xB,EAAQqa,MAAM5N,KAAK,IAAIR,OAAO,IAAMuhD,EAAa,QA5IvDxtD,EAAQwuD,QAmKR,SAASA,QAAQztD,GACf,IAAIP,EAAG4K,EACP,IAAK5K,EAAI,EAAG4K,EAAMpL,EAAQkvD,MAAM/rD,OAAQ3C,EAAI4K,EAAK5K,IAC/C,GAAIR,EAAQkvD,MAAM1uD,GAAG4X,KAAKrX,GACxB,OAAO,EAGX,IAAKP,EAAI,EAAG4K,EAAMpL,EAAQqa,MAAMlX,OAAQ3C,EAAI4K,EAAK5K,IAC/C,GAAIR,EAAQqa,MAAM7Z,GAAG4X,KAAKrX,GACxB,OAAO,EAGX,OAAO,GA9KTf,EAAQmtD,SAAW,EAAQ,KAM3BntD,EAAQqa,MAAQ,GAChBra,EAAQkvD,MAAQ,GAQhBlvD,EAAQouD,WAAa,I,cCxBrB,IAAI3rD,EAAI,IACJ7B,EAAI6B,IACJ0sD,EAAQ,GAAJvuD,EACJE,EAAQ,GAAJquD,EAwIR,SAASC,OAAOV,EAAIzsD,EAAGlB,GACrB,KAAI2tD,EAAKzsD,GAGT,OAAIysD,EAAS,IAAJzsD,EACA+F,KAAKiJ,MAAMy9C,EAAKzsD,GAAK,IAAMlB,EAE7BiH,KAAK6D,KAAK6iD,EAAKzsD,GAAK,IAAMlB,EAAO,IA9H1Cd,EAAOD,QAAU,SAAS+Q,EAAKulB,GAC7BA,EAAUA,GAAW,GACrB,IAAI9vB,SAAcuK,EAClB,GAAa,WAATvK,GAAqBuK,EAAI5N,OAAS,EACpC,OAkBJ,SAASksD,MAAMloC,GAEb,IADAA,EAAM5V,OAAO4V,IACLhkB,OAAS,IACf,OAEF,IAAIwwB,EAAQ,wHAAwHpqB,KAClI4d,GAEF,IAAKwM,EACH,OAEF,IAAI1xB,EAAIiiD,WAAWvwB,EAAM,IAEzB,QADYA,EAAM,IAAM,MAAMhK,eAE5B,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAzDE7oB,SAyDKmB,EACT,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOA,EAAInB,EACb,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAAOmB,EAAIktD,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOltD,EAAIrB,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOqB,EAAIQ,EACb,IAAK,eACL,IAAK,cACL,IAAK,QACL,IAAK,OACL,IAAK,KACH,OAAOR,EACT,QACE,QAnEKotD,CAAMt+C,GACR,GAAa,WAATvK,IAAoC,IAAf0K,MAAMH,GACpC,OAAOulB,EAAQg5B,KAqGnB,SAASC,QAAQb,GACf,OAAOU,OAAOV,EAAI5tD,EAAG,QACnBsuD,OAAOV,EAAIS,EAAG,SACdC,OAAOV,EAAI9tD,EAAG,WACdwuD,OAAOV,EAAIjsD,EAAG,WACdisD,EAAK,MA1GiBa,CAAQx+C,GA6ElC,SAASy+C,SAASd,GAChB,GAAIA,GAAM5tD,EACR,OAAOkH,KAAKyhB,MAAMilC,EAAK5tD,GAAK,IAE9B,GAAI4tD,GAAMS,EACR,OAAOnnD,KAAKyhB,MAAMilC,EAAKS,GAAK,IAE9B,GAAIT,GAAM9tD,EACR,OAAOoH,KAAKyhB,MAAMilC,EAAK9tD,GAAK,IAE9B,GAAI8tD,GAAMjsD,EACR,OAAOuF,KAAKyhB,MAAMilC,EAAKjsD,GAAK,IAE9B,OAAOisD,EAAK,KA1F2Bc,CAASz+C,GAEhD,MAAM,IAAInF,MACR,wDACEyvC,KAAKE,UAAUxqC,M,gBChCrB,IAAIrO,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAI0T,EAAWhR,EAAuBmG,EAAQ,KAE1C4mD,EAAkB/sD,EAAuBmG,EAAQ,KAEjDqF,EAAmBxL,EAAuBmG,EAAQ,IAElDsF,EAAgBzL,EAAuBmG,EAAQ,IAE/C4Z,EAAQ/f,EAAuBmG,EAAQ,KAEvCG,EAAatG,EAAuBmG,EAAQ,KAE5C6mD,EAAsBhtD,EAAuBmG,EAAQ,KAEzD,SAAS8Z,2BAA2B1hB,GAAK,GAAsB,oBAAXM,QAAgD,MAAtBN,EAAEM,OAAOmH,UAAmB,CAAE,GAAIkC,MAAMgY,QAAQ3hB,KAAOA,EAErI,SAASoc,4BAA4Bpc,EAAGqc,GAAU,IAAKrc,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOsc,kBAAkBtc,EAAGqc,GAAS,IAAIrb,EAAIf,OAAOoB,UAAUmJ,SAAS9K,KAAKM,GAAGqL,MAAM,GAAI,GAAc,WAANrK,GAAkBhB,EAAEmD,cAAanC,EAAIhB,EAAEmD,YAAYrD,MAAM,GAAU,QAANkB,GAAqB,QAANA,EAAa,OAAO2I,MAAMC,KAAK5J,GAAI,GAAU,cAANgB,GAAqB,2CAA2CmW,KAAKnW,GAAI,OAAOsb,kBAAkBtc,EAAGqc,GAF7QD,CAA4Bpc,IAAK,CAAE,IAAIT,EAAI,EAAOqG,EAAI,SAASA,MAAQ,MAAO,CAAEpE,EAAGoE,EAAG5E,EAAG,SAASA,IAAM,OAAIzB,GAAKS,EAAEkC,OAAe,CAAEkC,MAAM,GAAe,CAAEA,MAAM,EAAO5D,MAAOR,EAAET,OAAWiI,EAAG,SAASA,EAAEoa,GAAM,MAAMA,GAAOva,EAAGzB,GAAO,MAAM,IAAI9D,UAAU,yIAA4I,IAAI6F,EAA6C9C,EAAzCgd,GAAmB,EAAMC,GAAS,EAAY,MAAO,CAAEtgB,EAAG,SAASA,IAAMmG,EAAK3H,EAAEM,OAAOmH,aAAgBzG,EAAG,SAASA,IAAM,IAAI+gB,EAAOpa,EAAG4S,OAAsC,OAA9BsH,EAAmBE,EAAK3d,KAAa2d,GAASva,EAAG,SAASA,EAAEwa,GAAOF,GAAS,EAAMjd,EAAMmd,GAAQ3a,EAAG,SAASA,IAAM,IAAWwa,GAAoC,MAAhBla,EAAE,QAAoBA,EAAE,SAAvD,QAAiF,GAAIma,EAAQ,MAAMjd,KAI53B,SAASyX,kBAAkBxT,EAAKqB,IAAkB,MAAPA,GAAeA,EAAMrB,EAAI5G,UAAQiI,EAAMrB,EAAI5G,QAAQ,IAAK,IAAI3C,EAAI,EAAGgd,EAAO,IAAI5S,MAAMQ,GAAM5K,EAAI4K,EAAK5K,IAAOgd,EAAKhd,GAAKuJ,EAAIvJ,GAAM,OAAOgd,EAEhL,IAAImyC,EAA+B,WACjC,SAASA,gBAAgBhyC,GACvB,IAAIM,EAAOrY,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAC3EgqD,EAAgB3xC,EAAKiF,SACrBA,OAA6B,IAAlB0sC,EAA2B,GAAKA,EAC3CC,EAAgB5xC,EAAKC,SACrBA,OAA6B,IAAlB2xC,EAA2B,GAAKA,EAC3CC,EAAgB7xC,EAAKE,SACrBA,OAA6B,IAAlB2xC,EAA2B,GAAKA,GAE/C,EAAI5hD,EAAgB,SAAaxI,KAAMiqD,iBACvCjqD,KAAKqqD,QAAUpyC,EAEfjY,KAAKie,UAAYT,EAGjBxd,KAAKsqD,UAAY,CACf9xC,SAAUA,EACVC,SAAUA,GA8Gd,OArGA,EAAIhQ,EAAa,SAAawhD,gBAAiB,CAAC,CAC9C5tD,IAAK,WACLN,MAAO,SAASwuD,SAASC,GACvB,QAASxqD,KAAKie,UAAUusC,KAOzB,CACDnuD,IAAK,iBACLN,MAAO,SAAS0uD,iBACd,IAAIC,EAAY,IAAIpnD,EAAU,QAE9B,IAAK,IAAI4G,KAAQlK,KAAKqqD,QAAS,CAC7B,IAAIjnD,GAAqB,EAAI4mD,EAAmB,SAAa9/C,EAAMlK,KAAKqqD,QAAQngD,GAAOlK,KAAKsqD,WACxFK,GAAsB,EAAIZ,EAAe,SAAa3mD,EAAoB,GAC1EmM,EAAUo7C,EAAoB,GAC9BthD,EAAWshD,EAAoB,GAE/BxtD,OAAW,EAEf,GAAyC,WAArC,EAAI6Q,EAAQ,SAAauB,GAE3BpS,EAAWoS,OACN,GAAsB,mBAAXA,EAEhBpS,EAAW,IAAIoS,MACV,CAEL,IAAKvP,KAAKuqD,SAASh7C,IAAqB,aAATrF,EAC7B,MAAM,IAAIhE,MAAM,4KAGlB,IAAKlG,KAAKuqD,SAASh7C,GACjB,MAAM,IAAIrJ,MAAM,yCAA2CqJ,GAG7DpS,EAAW,IAAI6C,KAAKie,UAAU1O,GAGhC,IAAIq7C,EAAeztD,EAASuM,UAAUrO,OAEtC,GAAIuvD,IAAiB1gD,EACnB,MAAM,IAAIhE,MAAM,mBAAoBb,OAAOulD,EAAc,QAAUvlD,OAAO6E,EAAM,MAGlF/M,EAASuM,UAAUL,SAASA,GAC5BqhD,EAAUtsC,SAASjhB,EAAU+M,GAO/B,OAJAlK,KAAK6qD,sBAAsBH,GAE3BA,EAAUjsC,qBACVze,KAAK8qD,WAAaJ,EACXA,IAER,CACDruD,IAAK,wBACLN,MAAO,SAAS8uD,sBAAsBH,GACpC,IAAI/1C,EAAQ+1C,EAAUlsC,4BAQlBusC,EANUp2C,EAAMmiB,QAAO,SAAUV,EAAK/6B,GACxC,IACI2vD,EADUN,EAAUn7C,QAAQlU,GACbqO,UAAUR,eAC7B,OAAO,EAAI6T,EAAK,SAAaqZ,EAAI/wB,OAAO2lD,MACvC,IAEmBxkD,QAAO,SAAUnL,GACrC,OAAQsZ,EAAM4J,SAASljB,MAEzB,GAAuB,IAAnB0vD,EAAQttD,OAAZ,CAEA,IACIggB,EADAG,EAAYX,2BAA2B8tC,GAG3C,IACE,IAAKntC,EAAU7gB,MAAO0gB,EAAQG,EAAUrhB,KAAKoD,MAAO,CAClD,IAAItE,EAAOoiB,EAAM1hB,MACbuY,EAAOtU,KAAKsqD,UAAU9xC,SAASnd,GAEnC,GADoB,iBAATiZ,IAAmBA,EAAOtU,KAAKie,UAAU3J,KAC/CA,EAAM,MAAM,IAAIpO,MAAM,yBAA0Bb,OAAOhK,EAAM,MAClEqvD,EAAUtsC,SAAS,IAAI9J,EAAQjZ,IAGjC,MAAO+E,GACPwd,EAAU7a,EAAE3C,GAVd,QAYEwd,EAAUhb,IAGZ5C,KAAK6qD,sBAAsBH,MAE5B,CACDruD,IAAK,UACLN,MAAO,SAASwT,QAAQlU,GAEtB,OADK2E,KAAK8qD,YAAY9qD,KAAKyqD,iBACpBzqD,KAAK8qD,WAAWv7C,QAAQlU,OAG5B4uD,gBAhI0B,GAmInC3vD,EAAO,QAAc2vD,G,gBChKrB,IAAIgB,EAAW,EAAQ,KACnBC,EAAgB,EAAQ,KACxBC,EAAoB,EAAQ,KAC5BC,EAAW,EAAQ,KACnBC,EAAY,EAAQ,KACpB9uC,EAAa,EAAQ,IAkEzBhiB,EAAOD,QApDP,SAAS8hB,SAASvR,EAAO+U,EAAUkc,GACjC,IAAI5vB,GAAS,EACTqS,EAAW2sC,EACXztD,EAASoN,EAAMpN,OACf6tD,GAAW,EACXl+C,EAAS,GACT+xB,EAAO/xB,EAEX,GAAI0uB,EACFwvB,GAAW,EACX/sC,EAAW4sC,OAER,GAAI1tD,GAvBY,IAuBgB,CACnC,IAAI6T,EAAMsO,EAAW,KAAOyrC,EAAUxgD,GACtC,GAAIyG,EACF,OAAOiL,EAAWjL,GAEpBg6C,GAAW,EACX/sC,EAAW6sC,EACXjsB,EAAO,IAAI8rB,OAGX9rB,EAAOvf,EAAW,GAAKxS,EAEzBm+C,EACA,OAASr/C,EAAQzO,GAAQ,CACvB,IAAI1B,EAAQ8O,EAAMqB,GACds/C,EAAW5rC,EAAWA,EAAS7jB,GAASA,EAG5C,GADAA,EAAS+/B,GAAwB,IAAV//B,EAAeA,EAAQ,EAC1CuvD,GAAYE,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAYtsB,EAAK1hC,OACdguD,KACL,GAAItsB,EAAKssB,KAAeD,EACtB,SAASD,EAGT3rC,GACFuf,EAAKp4B,KAAKykD,GAEZp+C,EAAOrG,KAAKhL,QAEJwiB,EAAS4gB,EAAMqsB,EAAU1vB,KAC7BqD,IAAS/xB,GACX+xB,EAAKp4B,KAAKykD,GAEZp+C,EAAOrG,KAAKhL,IAGhB,OAAOqR,I,gBCpET,IAAIs+C,EAAW,EAAQ,KACnBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,KAU1B,SAASX,SAAS10C,GAChB,IAAIrK,GAAS,EACTzO,EAAmB,MAAV8Y,EAAiB,EAAIA,EAAO9Y,OAGzC,IADAuC,KAAKiL,SAAW,IAAIygD,IACXx/C,EAAQzO,GACfuC,KAAKizB,IAAI1c,EAAOrK,IAKpB++C,SAASruD,UAAUq2B,IAAMg4B,SAASruD,UAAUmK,KAAO4kD,EACnDV,SAASruD,UAAUgE,IAAMgrD,EAEzBrxD,EAAOD,QAAU2wD,U,gBC1BjB,IAAIY,EAAgB,EAAQ,KACxBC,EAAiB,EAAQ,KACzBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,KAS1B,SAASP,SAASl1C,GAChB,IAAItK,GAAS,EACTzO,EAAoB,MAAX+Y,EAAkB,EAAIA,EAAQ/Y,OAG3C,IADAuC,KAAKksD,UACIhgD,EAAQzO,GAAQ,CACvB,IAAI8lD,EAAQ/sC,EAAQtK,GACpBlM,KAAKsR,IAAIiyC,EAAM,GAAIA,EAAM,KAK7BmI,SAAS9uD,UAAUsvD,MAAQL,EAC3BH,SAAS9uD,UAAkB,OAAIkvD,EAC/BJ,SAAS9uD,UAAUjB,IAAMowD,EACzBL,SAAS9uD,UAAUgE,IAAMorD,EACzBN,SAAS9uD,UAAU0U,IAAM26C,EAEzB1xD,EAAOD,QAAUoxD,U,gBC/BjB,IAAIS,EAAO,EAAQ,KACfC,EAAY,EAAQ,KACpB/6C,EAAM,EAAQ,KAkBlB9W,EAAOD,QATP,SAASuxD,gBACP7rD,KAAK4F,KAAO,EACZ5F,KAAKiL,SAAW,CACd,KAAQ,IAAIkhD,EACZ,IAAO,IAAK96C,GAAO+6C,GACnB,OAAU,IAAID,K,gBChBlB,IAAIE,EAAY,EAAQ,KACpBC,EAAa,EAAQ,KACrBC,EAAU,EAAQ,KAClBC,EAAU,EAAQ,KAClBC,EAAU,EAAQ,KAStB,SAASN,KAAK31C,GACZ,IAAItK,GAAS,EACTzO,EAAoB,MAAX+Y,EAAkB,EAAIA,EAAQ/Y,OAG3C,IADAuC,KAAKksD,UACIhgD,EAAQzO,GAAQ,CACvB,IAAI8lD,EAAQ/sC,EAAQtK,GACpBlM,KAAKsR,IAAIiyC,EAAM,GAAIA,EAAM,KAK7B4I,KAAKvvD,UAAUsvD,MAAQG,EACvBF,KAAKvvD,UAAkB,OAAI0vD,EAC3BH,KAAKvvD,UAAUjB,IAAM4wD,EACrBJ,KAAKvvD,UAAUgE,IAAM4rD,EACrBL,KAAKvvD,UAAU0U,IAAMm7C,EAErBlyD,EAAOD,QAAU6xD,M,gBC/BjB,IAAI9hD,EAAe,EAAQ,IAc3B9P,EAAOD,QALP,SAAS+xD,YACPrsD,KAAKiL,SAAWZ,EAAeA,EAAa,MAAQ,GACpDrK,KAAK4F,KAAO,I,gBCXd,IAAI0W,EAAa,EAAQ,IACrBowC,EAAW,EAAQ,KACnBzpD,EAAW,EAAQ,IACnB0pD,EAAW,EAAQ,KASnBC,EAAe,8BAGfC,EAAY3qD,SAAStF,UACrBkwD,EAActxD,OAAOoB,UAGrBmwD,EAAeF,EAAU9mD,SAGzBlJ,EAAiBiwD,EAAYjwD,eAG7BmwD,EAAazmD,OAAO,IACtBwmD,EAAa9xD,KAAK4B,GAAgB+mB,QAjBjB,sBAiBuC,QACvDA,QAAQ,yDAA0D,SAAW,KAmBhFrpB,EAAOD,QARP,SAAS0X,aAAajW,GACpB,SAAKkH,EAASlH,IAAU2wD,EAAS3wD,MAGnBugB,EAAWvgB,GAASixD,EAAaJ,GAChCl6C,KAAKi6C,EAAS5wD,M,gBC3C/B,IAAIF,EAAS,EAAQ,IAGjBixD,EAActxD,OAAOoB,UAGrBC,EAAiBiwD,EAAYjwD,eAO7BowD,EAAuBH,EAAY/mD,SAGnC0E,EAAiB5O,EAASA,EAAOC,iBAAcuE,EA6BnD9F,EAAOD,QApBP,SAASiQ,UAAUxO,GACjB,IAAImxD,EAAQrwD,EAAe5B,KAAKc,EAAO0O,GACnC8C,EAAMxR,EAAM0O,GAEhB,IACE1O,EAAM0O,QAAkBpK,EACxB,IAAI8sD,GAAW,EACf,MAAOpqD,IAET,IAAIqK,EAAS6/C,EAAqBhyD,KAAKc,GAQvC,OAPIoxD,IACED,EACFnxD,EAAM0O,GAAkB8C,SAEjBxR,EAAM0O,IAGV2C,I,cCzCT,IAOI6/C,EAPczxD,OAAOoB,UAOcmJ,SAavCxL,EAAOD,QAJP,SAASkQ,eAAezO,GACtB,OAAOkxD,EAAqBhyD,KAAKc,K,gBClBnC,IAIMiD,EAJFouD,EAAa,EAAQ,KAGrBC,GACEruD,EAAM,SAAS6E,KAAKupD,GAAcA,EAAWhlD,MAAQglD,EAAWhlD,KAAKgE,UAAY,KACvE,iBAAmBpN,EAAO,GAc1CzE,EAAOD,QAJP,SAASoyD,SAAS1+B,GAChB,QAASq/B,GAAeA,KAAcr/B,I,gBChBxC,IAGIo/B,EAHO,EAAQ,IAGG,sBAEtB7yD,EAAOD,QAAU8yD,G,cCJjB,IAGIL,EAHY7qD,SAAStF,UAGImJ,SAqB7BxL,EAAOD,QAZP,SAASqyD,SAAS3+B,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO++B,EAAa9xD,KAAK+yB,GACzB,MAAOjrB,IACT,IACE,OAAQirB,EAAO,GACf,MAAOjrB,KAEX,MAAO,K,cCVTxI,EAAOD,QAJP,SAAS2X,SAASvV,EAAQL,GACxB,OAAiB,MAAVK,OAAiB2D,EAAY3D,EAAOL,K,cCO7C9B,EAAOD,QANP,SAASgyD,WAAWjwD,GAClB,IAAI+Q,EAASpN,KAAKY,IAAIvE,WAAe2D,KAAKiL,SAAS5O,GAEnD,OADA2D,KAAK4F,MAAQwH,EAAS,EAAI,EACnBA,I,gBCbT,IAAI/C,EAAe,EAAQ,IASvBxN,EAHcrB,OAAOoB,UAGQC,eAoBjCtC,EAAOD,QATP,SAASiyD,QAAQlwD,GACf,IAAI2O,EAAOhL,KAAKiL,SAChB,GAAIZ,EAAc,CAChB,IAAI+C,EAASpC,EAAK3O,GAClB,MArBiB,8BAqBV+Q,OAA4B/M,EAAY+M,EAEjD,OAAOvQ,EAAe5B,KAAK+P,EAAM3O,GAAO2O,EAAK3O,QAAOgE,I,gBC1BtD,IAAIgK,EAAe,EAAQ,IAMvBxN,EAHcrB,OAAOoB,UAGQC,eAgBjCtC,EAAOD,QALP,SAASkyD,QAAQnwD,GACf,IAAI2O,EAAOhL,KAAKiL,SAChB,OAAOZ,OAA8BhK,IAAd2K,EAAK3O,GAAsBQ,EAAe5B,KAAK+P,EAAM3O,K,gBCnB9E,IAAIgO,EAAe,EAAQ,IAsB3B9P,EAAOD,QAPP,SAASmyD,QAAQpwD,EAAKN,GACpB,IAAIiP,EAAOhL,KAAKiL,SAGhB,OAFAjL,KAAK4F,MAAQ5F,KAAKY,IAAIvE,GAAO,EAAI,EACjC2O,EAAK3O,GAAQgO,QAA0BhK,IAAVtE,EAfV,4BAekDA,EAC9DiE,O,gBCnBT,IAAIstD,EAAiB,EAAQ,KACzBC,EAAkB,EAAQ,KAC1BC,EAAe,EAAQ,KACvBC,EAAe,EAAQ,KACvBC,EAAe,EAAQ,KAS3B,SAAStB,UAAU51C,GACjB,IAAItK,GAAS,EACTzO,EAAoB,MAAX+Y,EAAkB,EAAIA,EAAQ/Y,OAG3C,IADAuC,KAAKksD,UACIhgD,EAAQzO,GAAQ,CACvB,IAAI8lD,EAAQ/sC,EAAQtK,GACpBlM,KAAKsR,IAAIiyC,EAAM,GAAIA,EAAM,KAK7B6I,UAAUxvD,UAAUsvD,MAAQoB,EAC5BlB,UAAUxvD,UAAkB,OAAI2wD,EAChCnB,UAAUxvD,UAAUjB,IAAM6xD,EAC1BpB,UAAUxvD,UAAUgE,IAAM6sD,EAC1BrB,UAAUxvD,UAAU0U,IAAMo8C,EAE1BnzD,EAAOD,QAAU8xD,W,cCnBjB7xD,EAAOD,QALP,SAASgzD,iBACPttD,KAAKiL,SAAW,GAChBjL,KAAK4F,KAAO,I,gBCTd,IAAIgF,EAAe,EAAQ,IAMvB2b,EAHarhB,MAAMtI,UAGC2pB,OA4BxBhsB,EAAOD,QAjBP,SAASizD,gBAAgBlxD,GACvB,IAAI2O,EAAOhL,KAAKiL,SACZiB,EAAQtB,EAAaI,EAAM3O,GAE/B,QAAI6P,EAAQ,KAIRA,GADYlB,EAAKvN,OAAS,EAE5BuN,EAAKyZ,MAEL8B,EAAOtrB,KAAK+P,EAAMkB,EAAO,KAEzBlM,KAAK4F,MACA,K,cCKTrL,EAAOD,QAJP,SAASqQ,GAAG5O,EAAOq9C,GACjB,OAAOr9C,IAAUq9C,GAAUr9C,GAAUA,GAASq9C,GAAUA,I,gBCjC1D,IAAIxuC,EAAe,EAAQ,IAkB3BrQ,EAAOD,QAPP,SAASkzD,aAAanxD,GACpB,IAAI2O,EAAOhL,KAAKiL,SACZiB,EAAQtB,EAAaI,EAAM3O,GAE/B,OAAO6P,EAAQ,OAAI7L,EAAY2K,EAAKkB,GAAO,K,gBCf7C,IAAItB,EAAe,EAAQ,IAe3BrQ,EAAOD,QAJP,SAASmzD,aAAapxD,GACpB,OAAOuO,EAAa5K,KAAKiL,SAAU5O,IAAQ,I,gBCZ7C,IAAIuO,EAAe,EAAQ,IAyB3BrQ,EAAOD,QAbP,SAASozD,aAAarxD,EAAKN,GACzB,IAAIiP,EAAOhL,KAAKiL,SACZiB,EAAQtB,EAAaI,EAAM3O,GAQ/B,OANI6P,EAAQ,KACRlM,KAAK4F,KACPoF,EAAKjE,KAAK,CAAC1K,EAAKN,KAEhBiP,EAAKkB,GAAO,GAAKnQ,EAEZiE,O,gBCtBT,IAIIqR,EAJY,EAAQ,GAId/G,CAHC,EAAQ,IAGO,OAE1B/P,EAAOD,QAAU+W,G,gBCNjB,IAAItG,EAAa,EAAQ,IAiBzBxQ,EAAOD,QANP,SAASwxD,eAAezvD,GACtB,IAAI+Q,EAASrC,EAAW/K,KAAM3D,GAAa,OAAEA,GAE7C,OADA2D,KAAK4F,MAAQwH,EAAS,EAAI,EACnBA,I,cCAT7S,EAAOD,QAPP,SAASwQ,UAAU/O,GACjB,IAAI+E,SAAc/E,EAClB,MAAgB,UAAR+E,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV/E,EACU,OAAVA,I,gBCXP,IAAIgP,EAAa,EAAQ,IAezBxQ,EAAOD,QAJP,SAASyxD,YAAY1vD,GACnB,OAAO0O,EAAW/K,KAAM3D,GAAKV,IAAIU,K,gBCZnC,IAAI0O,EAAa,EAAQ,IAezBxQ,EAAOD,QAJP,SAAS0xD,YAAY3vD,GACnB,OAAO0O,EAAW/K,KAAM3D,GAAKuE,IAAIvE,K,gBCZnC,IAAI0O,EAAa,EAAQ,IAqBzBxQ,EAAOD,QATP,SAAS2xD,YAAY5vD,EAAKN,GACxB,IAAIiP,EAAOD,EAAW/K,KAAM3D,GACxBuJ,EAAOoF,EAAKpF,KAIhB,OAFAoF,EAAKsG,IAAIjV,EAAKN,GACdiE,KAAK4F,MAAQoF,EAAKpF,MAAQA,EAAO,EAAI,EAC9B5F,O,cCATzF,EAAOD,QALP,SAASqxD,YAAY5vD,GAEnB,OADAiE,KAAKiL,SAASqG,IAAIvV,EAbC,6BAcZiE,O,cCFTzF,EAAOD,QAJP,SAASsxD,YAAY7vD,GACnB,OAAOiE,KAAKiL,SAASrK,IAAI7E,K,gBCV3B,IAAI4xD,EAAc,EAAQ,KAgB1BpzD,EAAOD,QALP,SAAS4wD,cAAcrgD,EAAO9O,GAE5B,SADsB,MAAT8O,EAAgB,EAAIA,EAAMpN,SACpBkwD,EAAY9iD,EAAO9O,EAAO,IAAM,I,gBCbrD,IAAI6xD,EAAgB,EAAQ,KACxBC,EAAY,EAAQ,KACpBC,EAAgB,EAAQ,KAiB5BvzD,EAAOD,QANP,SAASqzD,YAAY9iD,EAAO9O,EAAOqgC,GACjC,OAAOrgC,GAAUA,EACb+xD,EAAcjjD,EAAO9O,EAAOqgC,GAC5BwxB,EAAc/iD,EAAOgjD,EAAWzxB,K,cCOtC7hC,EAAOD,QAZP,SAASszD,cAAc/iD,EAAOkjD,EAAW3xB,EAAW4xB,GAIlD,IAHA,IAAIvwD,EAASoN,EAAMpN,OACfyO,EAAQkwB,GAAa4xB,EAAY,GAAK,GAElCA,EAAY9hD,MAAYA,EAAQzO,GACtC,GAAIswD,EAAUljD,EAAMqB,GAAQA,EAAOrB,GACjC,OAAOqB,EAGX,OAAQ,I,cCTV3R,EAAOD,QAJP,SAASuzD,UAAU9xD,GACjB,OAAOA,GAAUA,I,cCcnBxB,EAAOD,QAZP,SAASwzD,cAAcjjD,EAAO9O,EAAOqgC,GAInC,IAHA,IAAIlwB,EAAQkwB,EAAY,EACpB3+B,EAASoN,EAAMpN,SAEVyO,EAAQzO,GACf,GAAIoN,EAAMqB,KAAWnQ,EACnB,OAAOmQ,EAGX,OAAQ,I,cCEV3R,EAAOD,QAZP,SAAS6wD,kBAAkBtgD,EAAO9O,EAAO+/B,GAIvC,IAHA,IAAI5vB,GAAS,EACTzO,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,SAE9ByO,EAAQzO,GACf,GAAIq+B,EAAW//B,EAAO8O,EAAMqB,IAC1B,OAAO,EAGX,OAAO,I,cCNT3R,EAAOD,QAJP,SAAS8wD,SAAS15C,EAAOrV,GACvB,OAAOqV,EAAM9Q,IAAIvE,K,gBCTnB,IAAI6qC,EAAM,EAAQ,KACdpsB,EAAO,EAAQ,KACfyB,EAAa,EAAQ,IAYrB8uC,EAAcnkB,GAAQ,EAAI3qB,EAAW,IAAI2qB,EAAI,CAAC,EAAE,KAAK,IAT1C,IASoE,SAAS3wB,GAC1F,OAAO,IAAI2wB,EAAI3wB,IAD2DuE,EAI5EvgB,EAAOD,QAAU+wD,G,gBClBjB,IAIInkB,EAJY,EAAQ,GAId58B,CAHC,EAAQ,IAGO,OAE1B/P,EAAOD,QAAU4sC,G,cCUjB3sC,EAAOD,QAJP,SAASwgB,U,gBCZT,IAAImzC,EAAa,EAAQ,KACrB7lD,EAAO,EAAQ,KAgCnB7N,EAAOD,QAJP,SAASic,OAAO7Z,GACd,OAAiB,MAAVA,EAAiB,GAAKuxD,EAAWvxD,EAAQ0L,EAAK1L,M,gBC9BvD,IAAIijB,EAAW,EAAQ,IAkBvBplB,EAAOD,QANP,SAAS2zD,WAAWvxD,EAAQc,GAC1B,OAAOmiB,EAASniB,GAAO,SAASnB,GAC9B,OAAOK,EAAOL,Q,gBCdlB,IAAI6xD,EAAgB,EAAQ,KACxBC,EAAW,EAAQ,KACnBl4B,EAAc,EAAQ,KAkC1B17B,EAAOD,QAJP,SAAS8N,KAAK1L,GACZ,OAAOu5B,EAAYv5B,GAAUwxD,EAAcxxD,GAAUyxD,EAASzxD,K,gBCjChE,IAAImjB,EAAY,EAAQ,IACpBgQ,EAAc,EAAQ,KACtB3S,EAAU,EAAQ,IAClB6P,EAAW,EAAQ,KACnBqhC,EAAU,EAAQ,KAClBC,EAAe,EAAQ,KAMvBxxD,EAHcrB,OAAOoB,UAGQC,eAqCjCtC,EAAOD,QA3BP,SAAS4zD,cAAcnyD,EAAOuyD,GAC5B,IAAIC,EAAQrxC,EAAQnhB,GAChByyD,GAASD,GAAS1+B,EAAY9zB,GAC9B0yD,GAAUF,IAAUC,GAASzhC,EAAShxB,GACtC2yD,GAAUH,IAAUC,IAAUC,GAAUJ,EAAatyD,GACrD4yD,EAAcJ,GAASC,GAASC,GAAUC,EAC1CthD,EAASuhD,EAAc9uC,EAAU9jB,EAAM0B,OAAQoO,QAAU,GACzDpO,EAAS2P,EAAO3P,OAEpB,IAAK,IAAIpB,KAAON,GACTuyD,IAAazxD,EAAe5B,KAAKc,EAAOM,IACvCsyD,IAEQ,UAAPtyD,GAECoyD,IAAkB,UAAPpyD,GAA0B,UAAPA,IAE9BqyD,IAAkB,UAAPryD,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD+xD,EAAQ/xD,EAAKoB,KAElB2P,EAAOrG,KAAK1K,GAGhB,OAAO+Q,I,gBC7CT,IAAIwhD,EAAkB,EAAQ,KAC1B1jD,EAAe,EAAQ,IAGvB4hD,EAActxD,OAAOoB,UAGrBC,EAAiBiwD,EAAYjwD,eAG7B0L,EAAuBukD,EAAYvkD,qBAoBnCsnB,EAAc++B,EAAgB,WAAa,OAAO1uD,UAApB,IAAsC0uD,EAAkB,SAAS7yD,GACjG,OAAOmP,EAAanP,IAAUc,EAAe5B,KAAKc,EAAO,YACtDwM,EAAqBtN,KAAKc,EAAO,WAGtCxB,EAAOD,QAAUu1B,G,gBCnCjB,IAAInlB,EAAa,EAAQ,IACrBQ,EAAe,EAAQ,IAgB3B3Q,EAAOD,QAJP,SAASs0D,gBAAgB7yD,GACvB,OAAOmP,EAAanP,IAVR,sBAUkB2O,EAAW3O,K,iBCd3C,kBAAW,EAAQ,IACf8yD,EAAY,EAAQ,KAGpBC,EAA4Cx0D,IAAYA,EAAQ47B,UAAY57B,EAG5Ey0D,EAAaD,GAAgC,iBAAVv0D,GAAsBA,IAAWA,EAAO27B,UAAY37B,EAMvF6L,EAHgB2oD,GAAcA,EAAWz0D,UAAYw0D,EAG5B10D,EAAKgM,YAAS/F,EAsBvC0sB,GAnBiB3mB,EAASA,EAAO2mB,cAAW1sB,IAmBfwuD,EAEjCt0D,EAAOD,QAAUyyB,I,mCCpBjBxyB,EAAOD,QAJP,SAASu0D,YACP,OAAO,I,cCbT,IAGIG,EAAW,mBAoBfz0D,EAAOD,QAVP,SAAS8zD,QAAQryD,EAAO0B,GACtB,IAAIqD,SAAc/E,EAGlB,SAFA0B,EAAmB,MAAVA,EAfY,iBAewBA,KAGlC,UAARqD,GACU,UAARA,GAAoBkuD,EAASt8C,KAAK3W,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ0B,I,gBCrBjD,IAAIwxD,EAAmB,EAAQ,KAC3BC,EAAY,EAAQ,KACpBC,EAAW,EAAQ,KAGnBC,EAAmBD,GAAYA,EAASd,aAmBxCA,EAAee,EAAmBF,EAAUE,GAAoBH,EAEpE10D,EAAOD,QAAU+zD,G,gBC1BjB,IAAI3jD,EAAa,EAAQ,IACrBwV,EAAW,EAAQ,KACnBhV,EAAe,EAAQ,IA8BvBmkD,EAAiB,GACrBA,EAZiB,yBAYYA,EAXZ,yBAYjBA,EAXc,sBAWYA,EAVX,uBAWfA,EAVe,uBAUYA,EATZ,uBAUfA,EATsB,8BASYA,EARlB,wBAShBA,EARgB,yBAQY,EAC5BA,EAjCc,sBAiCYA,EAhCX,kBAiCfA,EApBqB,wBAoBYA,EAhCnB,oBAiCdA,EApBkB,qBAoBYA,EAhChB,iBAiCdA,EAhCe,kBAgCYA,EA/Bb,qBAgCdA,EA/Ba,gBA+BYA,EA9BT,mBA+BhBA,EA9BgB,mBA8BYA,EA7BZ,mBA8BhBA,EA7Ba,gBA6BYA,EA5BT,mBA6BhBA,EA5BiB,qBA4BY,EAc7B90D,EAAOD,QALP,SAAS20D,iBAAiBlzD,GACxB,OAAOmP,EAAanP,IAClBmkB,EAASnkB,EAAM0B,WAAa4xD,EAAe3kD,EAAW3O,M,cC3C1DxB,EAAOD,QANP,SAAS40D,UAAUlhC,GACjB,OAAO,SAASjyB,GACd,OAAOiyB,EAAKjyB,M,iBCThB,kBAAiB,EAAQ,IAGrB+yD,EAA4Cx0D,IAAYA,EAAQ47B,UAAY57B,EAG5Ey0D,EAAaD,GAAgC,iBAAVv0D,GAAsBA,IAAWA,EAAO27B,UAAY37B,EAMvF+0D,EAHgBP,GAAcA,EAAWz0D,UAAYw0D,GAGtB9mD,EAAW4R,QAG1Cu1C,EAAY,WACd,IAEE,IAAII,EAAQR,GAAcA,EAAW5rD,SAAW4rD,EAAW5rD,QAAQ,QAAQosD,MAE3E,OAAIA,GAKGD,GAAeA,EAAYvzC,SAAWuzC,EAAYvzC,QAAQ,QACjE,MAAOhZ,KAXI,GAcfxI,EAAOD,QAAU60D,I,qCC7BjB,IAAIK,EAAc,EAAQ,KACtBC,EAAa,EAAQ,KAMrB5yD,EAHcrB,OAAOoB,UAGQC,eAsBjCtC,EAAOD,QAbP,SAAS6zD,SAASzxD,GAChB,IAAK8yD,EAAY9yD,GACf,OAAO+yD,EAAW/yD,GAEpB,IAAI0Q,EAAS,GACb,IAAK,IAAI/Q,KAAOb,OAAOkB,GACjBG,EAAe5B,KAAKyB,EAAQL,IAAe,eAAPA,GACtC+Q,EAAOrG,KAAK1K,GAGhB,OAAO+Q,I,cCzBT,IAAI0/C,EAActxD,OAAOoB,UAgBzBrC,EAAOD,QAPP,SAASk1D,YAAYzzD,GACnB,IAAI0sC,EAAO1sC,GAASA,EAAM2C,YAG1B,OAAO3C,KAFqB,mBAAR0sC,GAAsBA,EAAK7rC,WAAckwD,K,gBCZ/D,IAGI2C,EAHU,EAAQ,IAGLC,CAAQl0D,OAAO4M,KAAM5M,QAEtCjB,EAAOD,QAAUm1D,G,cCSjBl1D,EAAOD,QANP,SAASo1D,QAAQ1hC,EAAM2hC,GACrB,OAAO,SAASnwD,GACd,OAAOwuB,EAAK2hC,EAAUnwD,O,gBCV1B,IAAI8c,EAAa,EAAQ,IACrB4D,EAAW,EAAQ,KA+BvB3lB,EAAOD,QAJP,SAAS27B,YAAYl6B,GACnB,OAAgB,MAATA,GAAiBmkB,EAASnkB,EAAM0B,UAAY6e,EAAWvgB,K,cCfhE,SAAS6zD,SAASC,EAAOnyC,GACvB,IAAIoyC,EAASD,EAAMpyD,OACfsyD,EAAS,IAAI7qD,MAAM4qD,GACnBE,EAAU,GACVl1D,EAAIg1D,EAEJG,EA4DN,SAASC,kBAAkB7rD,GAEzB,IADA,IAAIqZ,EAAQ,IAAIrM,IACPvW,EAAI,EAAG4K,EAAMrB,EAAI5G,OAAQ3C,EAAI4K,EAAK5K,IAAK,CAC9C,IAAIq1D,EAAO9rD,EAAIvJ,GACV4iB,EAAM9c,IAAIuvD,EAAK,KAAKzyC,EAAMpM,IAAI6+C,EAAK,GAAI,IAAIjpB,KAC3CxpB,EAAM9c,IAAIuvD,EAAK,KAAKzyC,EAAMpM,IAAI6+C,EAAK,GAAI,IAAIjpB,KAChDxpB,EAAM/hB,IAAIw0D,EAAK,IAAIl9B,IAAIk9B,EAAK,IAE9B,OAAOzyC,EApEawyC,CAAkBxyC,GAClC0yC,EAsEN,SAASC,cAAchsD,GAErB,IADA,IAAIwhC,EAAM,IAAIx0B,IACLvW,EAAI,EAAG4K,EAAMrB,EAAI5G,OAAQ3C,EAAI4K,EAAK5K,IACzC+qC,EAAIv0B,IAAIjN,EAAIvJ,GAAIA,GAElB,OAAO+qC,EA3ESwqB,CAAcR,GAS9B,IANAnyC,EAAMjX,SAAQ,SAAS0pD,GACrB,IAAKC,EAAUxvD,IAAIuvD,EAAK,MAAQC,EAAUxvD,IAAIuvD,EAAK,IACjD,MAAM,IAAIjqD,MAAM,oEAIbpL,KACAk1D,EAAQl1D,IAAIw1D,MAAMT,EAAM/0D,GAAIA,EAAG,IAAIosC,KAG1C,OAAO6oB,EAEP,SAASO,MAAMC,EAAMz1D,EAAG01D,GACtB,GAAGA,EAAa5vD,IAAI2vD,GAAO,CACzB,IAAIE,EACJ,IACEA,EAAU,cAAgB9a,KAAKE,UAAU0a,GACzC,MAAMxtD,GACN0tD,EAAU,GAEZ,MAAM,IAAIvqD,MAAM,oBAAsBuqD,GAGxC,IAAKL,EAAUxvD,IAAI2vD,GACjB,MAAM,IAAIrqD,MAAM,+EAA+EyvC,KAAKE,UAAU0a,IAGhH,IAAIP,EAAQl1D,GAAZ,CACAk1D,EAAQl1D,IAAK,EAEb,IAAI41D,EAAWT,EAAct0D,IAAI40D,IAAS,IAAIrpB,IAG9C,GAAIpsC,GAFJ41D,EAAWxrD,MAAMC,KAAKurD,IAELjzD,OAAQ,CACvB+yD,EAAav9B,IAAIs9B,GACjB,EAAG,CACD,IAAII,EAAQD,IAAW51D,GACvBw1D,MAAMK,EAAOP,EAAUz0D,IAAIg1D,GAAQH,SAC5B11D,GACT01D,EAAaI,OAAOL,GAGtBR,IAASD,GAAUS,IA1DvBh2D,EAAOD,QAAU,SAASojB,GACxB,OAAOkyC,SA6DT,SAASiB,YAAYxsD,GAEnB,IADA,IAAIwhC,EAAM,IAAIqB,IACLpsC,EAAI,EAAG4K,EAAMrB,EAAI5G,OAAQ3C,EAAI4K,EAAK5K,IAAK,CAC9C,IAAIq1D,EAAO9rD,EAAIvJ,GACf+qC,EAAI5S,IAAIk9B,EAAK,IACbtqB,EAAI5S,IAAIk9B,EAAK,IAEf,OAAOjrD,MAAMC,KAAK0gC,GApEFgrB,CAAYnzC,GAAQA,IAGtCnjB,EAAOD,QAAQuQ,MAAQ+kD,U,gBCVvB,IAAI5yD,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAIkO,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAElDuF,EAAe1L,EAAuBmG,EAAQ,KAIlD,SAASoL,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAO3b,IAkBIpD,EAlB4B,SAAUqO,IACxC,EAAInK,EAAU,SAAaiyC,aAAc9nC,GAEzC,IAAIlJ,EAASZ,aAAa4xC,cAM1B,SAASA,aAAa9kD,GACpB,IAAI6N,EAAehJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAEvF,OADA,EAAIsI,EAAgB,SAAaxI,KAAMmgD,cAChChxC,EAAOlU,KAAK+E,KAAM0I,EAAY,QAAYrB,MAAOhM,EAAM6N,GAGhE,OAAOi3C,aAfuB,CATZnjD,EAAuBmG,EAAQ,KAyBpC,SAGf7I,EAAO,QAAc0P,G,gBC7CrB,IAAIhN,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAIkO,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAElDuF,EAAe1L,EAAuBmG,EAAQ,KAIlD,SAASoL,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAO3b,IAkBIpD,EAlB6B,SAAUqO,IACzC,EAAInK,EAAU,SAAa4iD,cAAez4C,GAE1C,IAAIlJ,EAASZ,aAAauiD,eAM1B,SAASA,cAAcz1D,GACrB,IAAI6N,EAAehJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAEvF,OADA,EAAIsI,EAAgB,SAAaxI,KAAM8wD,eAChC3hD,EAAOlU,KAAK+E,KAAM0I,EAAY,QAAYpB,OAAQjM,EAAM6N,GAGjE,OAAO4nD,cAfwB,CATb9zD,EAAuBmG,EAAQ,KAyBpC,SAGf7I,EAAO,QAAc0P,G,gBC7CrB,IAAIhN,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAIkO,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAElDuF,EAAe1L,EAAuBmG,EAAQ,KAIlD,SAASoL,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAO3b,IAkBIpD,EAlB8B,SAAUqO,IAC1C,EAAInK,EAAU,SAAa6iD,eAAgB14C,GAE3C,IAAIlJ,EAASZ,aAAawiD,gBAM1B,SAASA,eAAe11D,GACtB,IAAI6N,EAAehJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAEvF,OADA,EAAIsI,EAAgB,SAAaxI,KAAM+wD,gBAChC5hD,EAAOlU,KAAK+E,KAAM0I,EAAY,QAAYnB,QAASlM,EAAM6N,GAGlE,OAAO6nD,eAfyB,CATd/zD,EAAuBmG,EAAQ,KAyBpC,SAGf7I,EAAO,QAAc0P,G,iBC/CrB,YAUA,IAAIgnD,EAAS,EAAQ,KACjBC,EAAU,EAAQ,KAClB/zC,EAAU,EAAQ,KAmDtB,SAASg0C,aACP,OAAO9qD,OAAO+qD,oBACV,WACA,WAGN,SAASC,aAAchmD,EAAM3N,GAC3B,GAAIyzD,aAAezzD,EACjB,MAAM,IAAIqJ,WAAW,8BAcvB,OAZIV,OAAO+qD,qBAET/lD,EAAO,IAAImkB,WAAW9xB,IACjBU,UAAYiI,OAAOxJ,WAGX,OAATwO,IACFA,EAAO,IAAIhF,OAAO3I,IAEpB2N,EAAK3N,OAASA,GAGT2N,EAaT,SAAShF,OAAQ5G,EAAK6xD,EAAkB5zD,GACtC,KAAK2I,OAAO+qD,qBAAyBnxD,gBAAgBoG,QACnD,OAAO,IAAIA,OAAO5G,EAAK6xD,EAAkB5zD,GAI3C,GAAmB,iBAAR+B,EAAkB,CAC3B,GAAgC,iBAArB6xD,EACT,MAAM,IAAInrD,MACR,qEAGJ,OAAOorD,YAAYtxD,KAAMR,GAE3B,OAAO2F,KAAKnF,KAAMR,EAAK6xD,EAAkB5zD,GAW3C,SAAS0H,KAAMiG,EAAMrP,EAAOs1D,EAAkB5zD,GAC5C,GAAqB,iBAAV1B,EACT,MAAM,IAAIsB,UAAU,yCAGtB,MAA2B,oBAAhBowB,aAA+B1xB,aAAiB0xB,YA6H7D,SAAS8jC,gBAAiBnmD,EAAMP,EAAO2mD,EAAY/zD,GAGjD,GAFAoN,EAAM4mD,WAEFD,EAAa,GAAK3mD,EAAM4mD,WAAaD,EACvC,MAAM,IAAI1qD,WAAW,6BAGvB,GAAI+D,EAAM4mD,WAAaD,GAAc/zD,GAAU,GAC7C,MAAM,IAAIqJ,WAAW,6BAIrB+D,OADiBxK,IAAfmxD,QAAuCnxD,IAAX5C,EACtB,IAAI8xB,WAAW1kB,QACHxK,IAAX5C,EACD,IAAI8xB,WAAW1kB,EAAO2mD,GAEtB,IAAIjiC,WAAW1kB,EAAO2mD,EAAY/zD,GAGxC2I,OAAO+qD,qBAET/lD,EAAOP,GACF1M,UAAYiI,OAAOxJ,UAGxBwO,EAAOsmD,cAActmD,EAAMP,GAE7B,OAAOO,EAvJEmmD,CAAgBnmD,EAAMrP,EAAOs1D,EAAkB5zD,GAGnC,iBAAV1B,EAwFb,SAAS41D,WAAYvmD,EAAMqH,EAAQm/C,GACT,iBAAbA,GAAsC,KAAbA,IAClCA,EAAW,QAGb,IAAKxrD,OAAOyrD,WAAWD,GACrB,MAAM,IAAIv0D,UAAU,8CAGtB,IAAII,EAAwC,EAA/Bg0D,WAAWh/C,EAAQm/C,GAG5BrjC,GAFJnjB,EAAOgmD,aAAahmD,EAAM3N,IAERuP,MAAMyF,EAAQm/C,GAE5BrjC,IAAW9wB,IAIb2N,EAAOA,EAAKxE,MAAM,EAAG2nB,IAGvB,OAAOnjB,EA5GEumD,CAAWvmD,EAAMrP,EAAOs1D,GAsJnC,SAASS,WAAY1mD,EAAMnO,GACzB,GAAImJ,OAAO2mB,SAAS9vB,GAAM,CACxB,IAAIyI,EAA4B,EAAtBqsD,QAAQ90D,EAAIQ,QAGtB,OAAoB,KAFpB2N,EAAOgmD,aAAahmD,EAAM1F,IAEjBjI,QAITR,EAAIqpB,KAAKlb,EAAM,EAAG,EAAG1F,GAHZ0F,EAOX,GAAInO,EAAK,CACP,GAA4B,oBAAhBwwB,aACRxwB,EAAI0wB,kBAAkBF,aAAgB,WAAYxwB,EACpD,MAA0B,iBAAfA,EAAIQ,QA+8CrB,SAASu0D,MAAO3mD,GACd,OAAOA,GAAQA,EAh9C2B2mD,CAAM/0D,EAAIQ,QACvC2zD,aAAahmD,EAAM,GAErBsmD,cAActmD,EAAMnO,GAG7B,GAAiB,WAAbA,EAAI6D,MAAqBoc,EAAQjgB,EAAI+N,MACvC,OAAO0mD,cAActmD,EAAMnO,EAAI+N,MAInC,MAAM,IAAI3N,UAAU,sFA9Kby0D,CAAW1mD,EAAMrP,GA4B1B,SAASk2D,WAAYrsD,GACnB,GAAoB,iBAATA,EACT,MAAM,IAAIvI,UAAU,oCACf,GAAIuI,EAAO,EAChB,MAAM,IAAIkB,WAAW,wCA4BzB,SAASwqD,YAAalmD,EAAMxF,GAG1B,GAFAqsD,WAAWrsD,GACXwF,EAAOgmD,aAAahmD,EAAMxF,EAAO,EAAI,EAAoB,EAAhBmsD,QAAQnsD,KAC5CQ,OAAO+qD,oBACV,IAAK,IAAIr2D,EAAI,EAAGA,EAAI8K,IAAQ9K,EAC1BsQ,EAAKtQ,GAAK,EAGd,OAAOsQ,EAwCT,SAASsmD,cAAetmD,EAAMP,GAC5B,IAAIpN,EAASoN,EAAMpN,OAAS,EAAI,EAA4B,EAAxBs0D,QAAQlnD,EAAMpN,QAClD2N,EAAOgmD,aAAahmD,EAAM3N,GAC1B,IAAK,IAAI3C,EAAI,EAAGA,EAAI2C,EAAQ3C,GAAK,EAC/BsQ,EAAKtQ,GAAgB,IAAX+P,EAAM/P,GAElB,OAAOsQ,EA+DT,SAAS2mD,QAASt0D,GAGhB,GAAIA,GAAUyzD,aACZ,MAAM,IAAIpqD,WAAW,0DACaoqD,aAAanrD,SAAS,IAAM,UAEhE,OAAgB,EAATtI,EAsFT,SAASg0D,WAAYh/C,EAAQm/C,GAC3B,GAAIxrD,OAAO2mB,SAASta,GAClB,OAAOA,EAAOhV,OAEhB,GAA2B,oBAAhBgwB,aAA6D,mBAAvBA,YAAYF,SACxDE,YAAYF,OAAO9a,IAAWA,aAAkBgb,aACnD,OAAOhb,EAAOg/C,WAEM,iBAAXh/C,IACTA,EAAS,GAAKA,GAGhB,IAAI/M,EAAM+M,EAAOhV,OACjB,GAAY,IAARiI,EAAW,OAAO,EAItB,IADA,IAAIwsD,GAAc,IAEhB,OAAQN,GACN,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAOlsD,EACT,IAAK,OACL,IAAK,QACL,UAAKrF,EACH,OAAO8xD,YAAY1/C,GAAQhV,OAC7B,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAa,EAANiI,EACT,IAAK,MACH,OAAOA,IAAQ,EACjB,IAAK,SACH,OAAO0sD,cAAc3/C,GAAQhV,OAC/B,QACE,GAAIy0D,EAAa,OAAOC,YAAY1/C,GAAQhV,OAC5Cm0D,GAAY,GAAKA,GAAU3tC,cAC3BiuC,GAAc,GAMtB,SAASG,aAAcT,EAAU/vB,EAAOywB,GACtC,IAAIJ,GAAc,EAclB,SALc7xD,IAAVwhC,GAAuBA,EAAQ,KACjCA,EAAQ,GAINA,EAAQ7hC,KAAKvC,OACf,MAAO,GAOT,SAJY4C,IAARiyD,GAAqBA,EAAMtyD,KAAKvC,UAClC60D,EAAMtyD,KAAKvC,QAGT60D,GAAO,EACT,MAAO,GAOT,IAHAA,KAAS,KACTzwB,KAAW,GAGT,MAAO,GAKT,IAFK+vB,IAAUA,EAAW,UAGxB,OAAQA,GACN,IAAK,MACH,OAAOW,SAASvyD,KAAM6hC,EAAOywB,GAE/B,IAAK,OACL,IAAK,QACH,OAAOE,UAAUxyD,KAAM6hC,EAAOywB,GAEhC,IAAK,QACH,OAAOG,WAAWzyD,KAAM6hC,EAAOywB,GAEjC,IAAK,SACL,IAAK,SACH,OAAOI,YAAY1yD,KAAM6hC,EAAOywB,GAElC,IAAK,SACH,OAAOK,YAAY3yD,KAAM6hC,EAAOywB,GAElC,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOM,aAAa5yD,KAAM6hC,EAAOywB,GAEnC,QACE,GAAIJ,EAAa,MAAM,IAAI70D,UAAU,qBAAuBu0D,GAC5DA,GAAYA,EAAW,IAAI3tC,cAC3BiuC,GAAc,GAStB,SAASW,KAAM5wD,EAAG1F,EAAGrB,GACnB,IAAIJ,EAAImH,EAAE1F,GACV0F,EAAE1F,GAAK0F,EAAE/G,GACT+G,EAAE/G,GAAKJ,EAmIT,SAASg4D,qBAAsBnlC,EAAQtiB,EAAKmmD,EAAYI,EAAU11C,GAEhE,GAAsB,IAAlByR,EAAOlwB,OAAc,OAAQ,EAmBjC,GAhB0B,iBAAf+zD,GACTI,EAAWJ,EACXA,EAAa,GACJA,EAAa,WACtBA,EAAa,WACJA,GAAc,aACvBA,GAAc,YAEhBA,GAAcA,EACVhmD,MAAMgmD,KAERA,EAAat1C,EAAM,EAAKyR,EAAOlwB,OAAS,GAItC+zD,EAAa,IAAGA,EAAa7jC,EAAOlwB,OAAS+zD,GAC7CA,GAAc7jC,EAAOlwB,OAAQ,CAC/B,GAAIye,EAAK,OAAQ,EACZs1C,EAAa7jC,EAAOlwB,OAAS,OAC7B,GAAI+zD,EAAa,EAAG,CACzB,IAAIt1C,EACC,OAAQ,EADJs1C,EAAa,EAUxB,GALmB,iBAARnmD,IACTA,EAAMjF,OAAOjB,KAAKkG,EAAKumD,IAIrBxrD,OAAO2mB,SAAS1hB,GAElB,OAAmB,IAAfA,EAAI5N,QACE,EAEHiX,aAAaiZ,EAAQtiB,EAAKmmD,EAAYI,EAAU11C,GAClD,GAAmB,iBAAR7Q,EAEhB,OADAA,GAAY,IACRjF,OAAO+qD,qBACiC,mBAAjC5hC,WAAW3yB,UAAUuc,QAC1B+C,EACKqT,WAAW3yB,UAAUuc,QAAQle,KAAK0yB,EAAQtiB,EAAKmmD,GAE/CjiC,WAAW3yB,UAAUisC,YAAY5tC,KAAK0yB,EAAQtiB,EAAKmmD,GAGvD98C,aAAaiZ,EAAQ,CAAEtiB,GAAOmmD,EAAYI,EAAU11C,GAG7D,MAAM,IAAI7e,UAAU,wCAGtB,SAASqX,aAAcrQ,EAAKgH,EAAKmmD,EAAYI,EAAU11C,GACrD,IA0BIphB,EA1BAi4D,EAAY,EACZC,EAAY3uD,EAAI5G,OAChBw1D,EAAY5nD,EAAI5N,OAEpB,QAAiB4C,IAAbuxD,IAEe,UADjBA,EAAW/lD,OAAO+lD,GAAU3tC,gBACY,UAAb2tC,GACV,YAAbA,GAAuC,aAAbA,GAAyB,CACrD,GAAIvtD,EAAI5G,OAAS,GAAK4N,EAAI5N,OAAS,EACjC,OAAQ,EAEVs1D,EAAY,EACZC,GAAa,EACbC,GAAa,EACbzB,GAAc,EAIlB,SAAS0B,KAAMztD,EAAK3K,GAClB,OAAkB,IAAdi4D,EACKttD,EAAI3K,GAEJ2K,EAAI0tD,aAAar4D,EAAIi4D,GAKhC,GAAI72C,EAAK,CACP,IAAIk3C,GAAc,EAClB,IAAKt4D,EAAI02D,EAAY12D,EAAIk4D,EAAWl4D,IAClC,GAAIo4D,KAAK7uD,EAAKvJ,KAAOo4D,KAAK7nD,GAAqB,IAAhB+nD,EAAoB,EAAIt4D,EAAIs4D,IAEzD,IADoB,IAAhBA,IAAmBA,EAAat4D,GAChCA,EAAIs4D,EAAa,IAAMH,EAAW,OAAOG,EAAaL,OAEtC,IAAhBK,IAAmBt4D,GAAKA,EAAIs4D,GAChCA,GAAc,OAKlB,IADI5B,EAAayB,EAAYD,IAAWxB,EAAawB,EAAYC,GAC5Dn4D,EAAI02D,EAAY12D,GAAK,EAAGA,IAAK,CAEhC,IADA,IAAI8pC,GAAQ,EACHj+B,EAAI,EAAGA,EAAIssD,EAAWtsD,IAC7B,GAAIusD,KAAK7uD,EAAKvJ,EAAI6L,KAAOusD,KAAK7nD,EAAK1E,GAAI,CACrCi+B,GAAQ,EACR,MAGJ,GAAIA,EAAO,OAAO9pC,EAItB,OAAQ,EAeV,SAASu4D,SAAU5tD,EAAKgN,EAAQgxB,EAAQhmC,GACtCgmC,EAASvQ,OAAOuQ,IAAW,EAC3B,IAAI6vB,EAAY7tD,EAAIhI,OAASgmC,EACxBhmC,GAGHA,EAASy1B,OAAOz1B,IACH61D,IACX71D,EAAS61D,GAJX71D,EAAS61D,EASX,IAAIC,EAAS9gD,EAAOhV,OACpB,GAAI81D,EAAS,GAAM,EAAG,MAAM,IAAIl2D,UAAU,sBAEtCI,EAAS81D,EAAS,IACpB91D,EAAS81D,EAAS,GAEpB,IAAK,IAAIz4D,EAAI,EAAGA,EAAI2C,IAAU3C,EAAG,CAC/B,IAAI04D,EAAShvD,SAASiO,EAAOyZ,OAAW,EAAJpxB,EAAO,GAAI,IAC/C,GAAI0Q,MAAMgoD,GAAS,OAAO14D,EAC1B2K,EAAIg+B,EAAS3oC,GAAK04D,EAEpB,OAAO14D,EAGT,SAAS24D,UAAWhuD,EAAKgN,EAAQgxB,EAAQhmC,GACvC,OAAOi2D,WAAWvB,YAAY1/C,EAAQhN,EAAIhI,OAASgmC,GAASh+B,EAAKg+B,EAAQhmC,GAG3E,SAASk2D,WAAYluD,EAAKgN,EAAQgxB,EAAQhmC,GACxC,OAAOi2D,WAq6BT,SAASE,aAAcnyC,GAErB,IADA,IAAIoyC,EAAY,GACP/4D,EAAI,EAAGA,EAAI2mB,EAAIhkB,SAAU3C,EAEhC+4D,EAAU9sD,KAAyB,IAApB0a,EAAIV,WAAWjmB,IAEhC,OAAO+4D,EA36BWD,CAAanhD,GAAShN,EAAKg+B,EAAQhmC,GAGvD,SAASq2D,YAAaruD,EAAKgN,EAAQgxB,EAAQhmC,GACzC,OAAOk2D,WAAWluD,EAAKgN,EAAQgxB,EAAQhmC,GAGzC,SAASs2D,YAAatuD,EAAKgN,EAAQgxB,EAAQhmC,GACzC,OAAOi2D,WAAWtB,cAAc3/C,GAAShN,EAAKg+B,EAAQhmC,GAGxD,SAASu2D,UAAWvuD,EAAKgN,EAAQgxB,EAAQhmC,GACvC,OAAOi2D,WAk6BT,SAASO,eAAgBxyC,EAAKyyC,GAG5B,IAFA,IAAI/4D,EAAGg5D,EAAIC,EACPP,EAAY,GACP/4D,EAAI,EAAGA,EAAI2mB,EAAIhkB,WACjBy2D,GAAS,GAAK,KADap5D,EAGhCK,EAAIsmB,EAAIV,WAAWjmB,GACnBq5D,EAAKh5D,GAAK,EACVi5D,EAAKj5D,EAAI,IACT04D,EAAU9sD,KAAKqtD,GACfP,EAAU9sD,KAAKotD,GAGjB,OAAON,EA/6BWI,CAAexhD,EAAQhN,EAAIhI,OAASgmC,GAASh+B,EAAKg+B,EAAQhmC,GAkF9E,SAASk1D,YAAaltD,EAAKo8B,EAAOywB,GAChC,OAAc,IAAVzwB,GAAeywB,IAAQ7sD,EAAIhI,OACtBuzD,EAAOqD,cAAc5uD,GAErBurD,EAAOqD,cAAc5uD,EAAImB,MAAMi7B,EAAOywB,IAIjD,SAASE,UAAW/sD,EAAKo8B,EAAOywB,GAC9BA,EAAMhwD,KAAKwS,IAAIrP,EAAIhI,OAAQ60D,GAI3B,IAHA,IAAIzsB,EAAM,GAEN/qC,EAAI+mC,EACD/mC,EAAIw3D,GAAK,CACd,IAQMgC,EAAYC,EAAWC,EAAYC,EARrCC,EAAYjvD,EAAI3K,GAChB65D,EAAY,KACZC,EAAoBF,EAAY,IAAQ,EACvCA,EAAY,IAAQ,EACpBA,EAAY,IAAQ,EACrB,EAEJ,GAAI55D,EAAI85D,GAAoBtC,EAG1B,OAAQsC,GACN,KAAK,EACCF,EAAY,MACdC,EAAYD,GAEd,MACF,KAAK,EAEyB,MAAV,KADlBJ,EAAa7uD,EAAI3K,EAAI,OAEnB25D,GAA6B,GAAZC,IAAqB,EAAoB,GAAbJ,GACzB,MAClBK,EAAYF,GAGhB,MACF,KAAK,EACHH,EAAa7uD,EAAI3K,EAAI,GACrBy5D,EAAY9uD,EAAI3K,EAAI,GACQ,MAAV,IAAbw5D,IAAsD,MAAV,IAAZC,KACnCE,GAA6B,GAAZC,IAAoB,IAAoB,GAAbJ,IAAsB,EAAmB,GAAZC,GACrD,OAAUE,EAAgB,OAAUA,EAAgB,SACtEE,EAAYF,GAGhB,MACF,KAAK,EACHH,EAAa7uD,EAAI3K,EAAI,GACrBy5D,EAAY9uD,EAAI3K,EAAI,GACpB05D,EAAa/uD,EAAI3K,EAAI,GACO,MAAV,IAAbw5D,IAAsD,MAAV,IAAZC,IAAsD,MAAV,IAAbC,KAClEC,GAA6B,GAAZC,IAAoB,IAAqB,GAAbJ,IAAsB,IAAmB,GAAZC,IAAqB,EAAoB,GAAbC,GAClF,OAAUC,EAAgB,UAC5CE,EAAYF,GAMJ,OAAdE,GAGFA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACb9uB,EAAI9+B,KAAK4tD,IAAc,GAAK,KAAQ,OACpCA,EAAY,MAAqB,KAAZA,GAGvB9uB,EAAI9+B,KAAK4tD,GACT75D,GAAK85D,EAGP,OAQF,SAASC,sBAAuBC,GAC9B,IAAIpvD,EAAMovD,EAAWr3D,OACrB,GAAIiI,GAJqB,KAKvB,OAAOmG,OAAOkpD,aAAa50D,MAAM0L,OAAQipD,GAI3C,IAAIjvB,EAAM,GACN/qC,EAAI,EACR,KAAOA,EAAI4K,GACTmgC,GAAOh6B,OAAOkpD,aAAa50D,MACzB0L,OACAipD,EAAWluD,MAAM9L,EAAGA,GAdC,OAiBzB,OAAO+qC,EAvBAgvB,CAAsBhvB,GA98B/BvrC,EAAQ8L,OAASA,OACjB9L,EAAQ06D,WAoTR,SAASA,WAAYv3D,IACdA,GAAUA,IACbA,EAAS,GAEX,OAAO2I,OAAOC,OAAO5I,IAvTvBnD,EAAQ26D,kBAAoB,GA0B5B7uD,OAAO+qD,yBAAqD9wD,IAA/BI,EAAO0wD,oBAChC1wD,EAAO0wD,oBAQX,SAAS+D,oBACP,IACE,IAAI7wD,EAAM,IAAIkrB,WAAW,GAEzB,OADAlrB,EAAIlG,UAAY,CAACA,UAAWoxB,WAAW3yB,UAAWywB,IAAK,WAAc,OAAO,KACvD,KAAdhpB,EAAIgpB,OACiB,mBAAjBhpB,EAAI8wD,UACuB,IAAlC9wD,EAAI8wD,SAAS,EAAG,GAAG1D,WACvB,MAAO1uD,GACP,OAAO,GAfPmyD,GAKJ56D,EAAQ42D,WAAaA,aAkErB9qD,OAAOgvD,SAAW,KAGlBhvD,OAAOivD,SAAW,SAAUhxD,GAE1B,OADAA,EAAIlG,UAAYiI,OAAOxJ,UAChByH,GA2BT+B,OAAOjB,KAAO,SAAUpJ,EAAOs1D,EAAkB5zD,GAC/C,OAAO0H,KAAK,KAAMpJ,EAAOs1D,EAAkB5zD,IAGzC2I,OAAO+qD,sBACT/qD,OAAOxJ,UAAUuB,UAAYoxB,WAAW3yB,UACxCwJ,OAAOjI,UAAYoxB,WACG,oBAAX1zB,QAA0BA,OAAOy5D,SACxClvD,OAAOvK,OAAOy5D,WAAalvD,QAE7B5K,OAAOC,eAAe2K,OAAQvK,OAAOy5D,QAAS,CAC5Cv5D,MAAO,KACP4B,cAAc,KAiCpByI,OAAOC,MAAQ,SAAUT,EAAM2vD,EAAM3D,GACnC,OArBF,SAASvrD,MAAO+E,EAAMxF,EAAM2vD,EAAM3D,GAEhC,OADAK,WAAWrsD,GACPA,GAAQ,EACHwrD,aAAahmD,EAAMxF,QAEfvF,IAATk1D,EAIyB,iBAAb3D,EACVR,aAAahmD,EAAMxF,GAAM2vD,KAAKA,EAAM3D,GACpCR,aAAahmD,EAAMxF,GAAM2vD,KAAKA,GAE7BnE,aAAahmD,EAAMxF,GAQnBS,CAAM,KAAMT,EAAM2vD,EAAM3D,IAiBjCxrD,OAAOkrD,YAAc,SAAU1rD,GAC7B,OAAO0rD,YAAY,KAAM1rD,IAK3BQ,OAAOovD,gBAAkB,SAAU5vD,GACjC,OAAO0rD,YAAY,KAAM1rD,IAiH3BQ,OAAO2mB,SAAW,SAASA,SAAU9qB,GACnC,QAAe,MAALA,IAAaA,EAAE+qB,YAG3B5mB,OAAO4a,QAAU,SAASA,QAAShf,EAAGC,GACpC,IAAKmE,OAAO2mB,SAAS/qB,KAAOoE,OAAO2mB,SAAS9qB,GAC1C,MAAM,IAAI5E,UAAU,6BAGtB,GAAI2E,IAAMC,EAAG,OAAO,EAKpB,IAHA,IAAIgf,EAAIjf,EAAEvE,OACNyjB,EAAIjf,EAAExE,OAED3C,EAAI,EAAG4K,EAAMpD,KAAKwS,IAAImM,EAAGC,GAAIpmB,EAAI4K,IAAO5K,EAC/C,GAAIkH,EAAElH,KAAOmH,EAAEnH,GAAI,CACjBmmB,EAAIjf,EAAElH,GACNomB,EAAIjf,EAAEnH,GACN,MAIJ,OAAImmB,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,GAGT7a,OAAOyrD,WAAa,SAASA,WAAYD,GACvC,OAAQ/lD,OAAO+lD,GAAU3tC,eACvB,IAAK,MACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAO,EACT,QACE,OAAO,IAIb7d,OAAOf,OAAS,SAASA,OAAQuvB,EAAMn3B,GACrC,IAAKyf,EAAQ0X,GACX,MAAM,IAAIv3B,UAAU,+CAGtB,GAAoB,IAAhBu3B,EAAKn3B,OACP,OAAO2I,OAAOC,MAAM,GAGtB,IAAIvL,EACJ,QAAeuF,IAAX5C,EAEF,IADAA,EAAS,EACJ3C,EAAI,EAAGA,EAAI85B,EAAKn3B,SAAU3C,EAC7B2C,GAAUm3B,EAAK95B,GAAG2C,OAItB,IAAIkwB,EAASvnB,OAAOkrD,YAAY7zD,GAC5Bk7B,EAAM,EACV,IAAK79B,EAAI,EAAGA,EAAI85B,EAAKn3B,SAAU3C,EAAG,CAChC,IAAI2K,EAAMmvB,EAAK95B,GACf,IAAKsL,OAAO2mB,SAAStnB,GACnB,MAAM,IAAIpI,UAAU,+CAEtBoI,EAAI6gB,KAAKqH,EAAQgL,GACjBA,GAAOlzB,EAAIhI,OAEb,OAAOkwB,GA8CTvnB,OAAOqrD,WAAaA,WA0EpBrrD,OAAOxJ,UAAUowB,WAAY,EAQ7B5mB,OAAOxJ,UAAU64D,OAAS,SAASA,SACjC,IAAI/vD,EAAM1F,KAAKvC,OACf,GAAIiI,EAAM,GAAM,EACd,MAAM,IAAIoB,WAAW,6CAEvB,IAAK,IAAIhM,EAAI,EAAGA,EAAI4K,EAAK5K,GAAK,EAC5B+3D,KAAK7yD,KAAMlF,EAAGA,EAAI,GAEpB,OAAOkF,MAGToG,OAAOxJ,UAAU84D,OAAS,SAASA,SACjC,IAAIhwD,EAAM1F,KAAKvC,OACf,GAAIiI,EAAM,GAAM,EACd,MAAM,IAAIoB,WAAW,6CAEvB,IAAK,IAAIhM,EAAI,EAAGA,EAAI4K,EAAK5K,GAAK,EAC5B+3D,KAAK7yD,KAAMlF,EAAGA,EAAI,GAClB+3D,KAAK7yD,KAAMlF,EAAI,EAAGA,EAAI,GAExB,OAAOkF,MAGToG,OAAOxJ,UAAU+4D,OAAS,SAASA,SACjC,IAAIjwD,EAAM1F,KAAKvC,OACf,GAAIiI,EAAM,GAAM,EACd,MAAM,IAAIoB,WAAW,6CAEvB,IAAK,IAAIhM,EAAI,EAAGA,EAAI4K,EAAK5K,GAAK,EAC5B+3D,KAAK7yD,KAAMlF,EAAGA,EAAI,GAClB+3D,KAAK7yD,KAAMlF,EAAI,EAAGA,EAAI,GACtB+3D,KAAK7yD,KAAMlF,EAAI,EAAGA,EAAI,GACtB+3D,KAAK7yD,KAAMlF,EAAI,EAAGA,EAAI,GAExB,OAAOkF,MAGToG,OAAOxJ,UAAUmJ,SAAW,SAASA,WACnC,IAAItI,EAAuB,EAAduC,KAAKvC,OAClB,OAAe,IAAXA,EAAqB,GACA,IAArByC,UAAUzC,OAAqB+0D,UAAUxyD,KAAM,EAAGvC,GAC/C40D,aAAalyD,MAAMH,KAAME,YAGlCkG,OAAOxJ,UAAU6gC,OAAS,SAASA,OAAQx7B,GACzC,IAAKmE,OAAO2mB,SAAS9qB,GAAI,MAAM,IAAI5E,UAAU,6BAC7C,OAAI2C,OAASiC,GACsB,IAA5BmE,OAAO4a,QAAQhhB,KAAMiC,IAG9BmE,OAAOxJ,UAAUuxB,QAAU,SAASA,UAClC,IAAI1M,EAAM,GACNH,EAAMhnB,EAAQ26D,kBAKlB,OAJIj1D,KAAKvC,OAAS,IAChBgkB,EAAMzhB,KAAK+F,SAAS,MAAO,EAAGub,GAAK2M,MAAM,SAASjnB,KAAK,KACnDhH,KAAKvC,OAAS6jB,IAAKG,GAAO,UAEzB,WAAaA,EAAM,KAG5Brb,OAAOxJ,UAAUokB,QAAU,SAASA,QAASzjB,EAAQskC,EAAOywB,EAAKsD,EAAWC,GAC1E,IAAKzvD,OAAO2mB,SAASxvB,GACnB,MAAM,IAAIF,UAAU,6BAgBtB,QAbcgD,IAAVwhC,IACFA,EAAQ,QAEExhC,IAARiyD,IACFA,EAAM/0D,EAASA,EAAOE,OAAS,QAEf4C,IAAdu1D,IACFA,EAAY,QAEEv1D,IAAZw1D,IACFA,EAAU71D,KAAKvC,QAGbokC,EAAQ,GAAKywB,EAAM/0D,EAAOE,QAAUm4D,EAAY,GAAKC,EAAU71D,KAAKvC,OACtE,MAAM,IAAIqJ,WAAW,sBAGvB,GAAI8uD,GAAaC,GAAWh0B,GAASywB,EACnC,OAAO,EAET,GAAIsD,GAAaC,EACf,OAAQ,EAEV,GAAIh0B,GAASywB,EACX,OAAO,EAQT,GAAItyD,OAASzC,EAAQ,OAAO,EAS5B,IAPA,IAAI0jB,GAJJ40C,KAAa,IADbD,KAAe,GAMX10C,GAPJoxC,KAAS,IADTzwB,KAAW,GASPn8B,EAAMpD,KAAKwS,IAAImM,EAAGC,GAElB40C,EAAW91D,KAAK4G,MAAMgvD,EAAWC,GACjCE,EAAax4D,EAAOqJ,MAAMi7B,EAAOywB,GAE5Bx3D,EAAI,EAAGA,EAAI4K,IAAO5K,EACzB,GAAIg7D,EAASh7D,KAAOi7D,EAAWj7D,GAAI,CACjCmmB,EAAI60C,EAASh7D,GACbomB,EAAI60C,EAAWj7D,GACf,MAIJ,OAAImmB,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,GA6HT7a,OAAOxJ,UAAU2hB,SAAW,SAASA,SAAUlT,EAAKmmD,EAAYI,GAC9D,OAAoD,IAA7C5xD,KAAKmZ,QAAQ9N,EAAKmmD,EAAYI,IAGvCxrD,OAAOxJ,UAAUuc,QAAU,SAASA,QAAS9N,EAAKmmD,EAAYI,GAC5D,OAAOkB,qBAAqB9yD,KAAMqL,EAAKmmD,EAAYI,GAAU,IAG/DxrD,OAAOxJ,UAAUisC,YAAc,SAASA,YAAax9B,EAAKmmD,EAAYI,GACpE,OAAOkB,qBAAqB9yD,KAAMqL,EAAKmmD,EAAYI,GAAU,IAkD/DxrD,OAAOxJ,UAAUoQ,MAAQ,SAASA,MAAOyF,EAAQgxB,EAAQhmC,EAAQm0D,GAE/D,QAAevxD,IAAXojC,EACFmuB,EAAW,OACXn0D,EAASuC,KAAKvC,OACdgmC,EAAS,OAEJ,QAAepjC,IAAX5C,GAA0C,iBAAXgmC,EACxCmuB,EAAWnuB,EACXhmC,EAASuC,KAAKvC,OACdgmC,EAAS,MAEJ,KAAI3Z,SAAS2Z,GAWlB,MAAM,IAAIv9B,MACR,2EAXFu9B,GAAkB,EACd3Z,SAASrsB,IACXA,GAAkB,OACD4C,IAAbuxD,IAAwBA,EAAW,UAEvCA,EAAWn0D,EACXA,OAAS4C,GASb,IAAIizD,EAAYtzD,KAAKvC,OAASgmC,EAG9B,SAFepjC,IAAX5C,GAAwBA,EAAS61D,KAAW71D,EAAS61D,GAEpD7gD,EAAOhV,OAAS,IAAMA,EAAS,GAAKgmC,EAAS,IAAOA,EAASzjC,KAAKvC,OACrE,MAAM,IAAIqJ,WAAW,0CAGlB8qD,IAAUA,EAAW,QAG1B,IADA,IAAIM,GAAc,IAEhB,OAAQN,GACN,IAAK,MACH,OAAOyB,SAASrzD,KAAMyS,EAAQgxB,EAAQhmC,GAExC,IAAK,OACL,IAAK,QACH,OAAOg2D,UAAUzzD,KAAMyS,EAAQgxB,EAAQhmC,GAEzC,IAAK,QACH,OAAOk2D,WAAW3zD,KAAMyS,EAAQgxB,EAAQhmC,GAE1C,IAAK,SACL,IAAK,SACH,OAAOq2D,YAAY9zD,KAAMyS,EAAQgxB,EAAQhmC,GAE3C,IAAK,SAEH,OAAOs2D,YAAY/zD,KAAMyS,EAAQgxB,EAAQhmC,GAE3C,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOu2D,UAAUh0D,KAAMyS,EAAQgxB,EAAQhmC,GAEzC,QACE,GAAIy0D,EAAa,MAAM,IAAI70D,UAAU,qBAAuBu0D,GAC5DA,GAAY,GAAKA,GAAU3tC,cAC3BiuC,GAAc,IAKtB9rD,OAAOxJ,UAAUiwB,OAAS,SAASA,SACjC,MAAO,CACL/rB,KAAM,SACNkK,KAAM9F,MAAMtI,UAAUgK,MAAM3L,KAAK+E,KAAKsgD,MAAQtgD,KAAM,KA4GxD,SAASyyD,WAAYhtD,EAAKo8B,EAAOywB,GAC/B,IAAIx3B,EAAM,GACVw3B,EAAMhwD,KAAKwS,IAAIrP,EAAIhI,OAAQ60D,GAE3B,IAAK,IAAIx3D,EAAI+mC,EAAO/mC,EAAIw3D,IAAOx3D,EAC7BggC,GAAOjvB,OAAOkpD,aAAsB,IAATtvD,EAAI3K,IAEjC,OAAOggC,EAGT,SAAS43B,YAAajtD,EAAKo8B,EAAOywB,GAChC,IAAIx3B,EAAM,GACVw3B,EAAMhwD,KAAKwS,IAAIrP,EAAIhI,OAAQ60D,GAE3B,IAAK,IAAIx3D,EAAI+mC,EAAO/mC,EAAIw3D,IAAOx3D,EAC7BggC,GAAOjvB,OAAOkpD,aAAatvD,EAAI3K,IAEjC,OAAOggC,EAGT,SAASy3B,SAAU9sD,EAAKo8B,EAAOywB,GAC7B,IAAI5sD,EAAMD,EAAIhI,SAETokC,GAASA,EAAQ,KAAGA,EAAQ,KAC5BywB,GAAOA,EAAM,GAAKA,EAAM5sD,KAAK4sD,EAAM5sD,GAGxC,IADA,IAAIzE,EAAM,GACDnG,EAAI+mC,EAAO/mC,EAAIw3D,IAAOx3D,EAC7BmG,GAAO+0D,MAAMvwD,EAAI3K,IAEnB,OAAOmG,EAGT,SAAS2xD,aAAcntD,EAAKo8B,EAAOywB,GAGjC,IAFA,IAAI2D,EAAQxwD,EAAImB,MAAMi7B,EAAOywB,GACzBzsB,EAAM,GACD/qC,EAAI,EAAGA,EAAIm7D,EAAMx4D,OAAQ3C,GAAK,EACrC+qC,GAAOh6B,OAAOkpD,aAAakB,EAAMn7D,GAAoB,IAAfm7D,EAAMn7D,EAAI,IAElD,OAAO+qC,EA0CT,SAASqwB,YAAazyB,EAAQ0yB,EAAK14D,GACjC,GAAKgmC,EAAS,GAAO,GAAKA,EAAS,EAAG,MAAM,IAAI38B,WAAW,sBAC3D,GAAI28B,EAAS0yB,EAAM14D,EAAQ,MAAM,IAAIqJ,WAAW,yCA+JlD,SAASsvD,SAAU3wD,EAAK1J,EAAO0nC,EAAQ0yB,EAAK70C,EAAKxM,GAC/C,IAAK1O,OAAO2mB,SAAStnB,GAAM,MAAM,IAAIpI,UAAU,+CAC/C,GAAItB,EAAQulB,GAAOvlB,EAAQ+Y,EAAK,MAAM,IAAIhO,WAAW,qCACrD,GAAI28B,EAAS0yB,EAAM1wD,EAAIhI,OAAQ,MAAM,IAAIqJ,WAAW,sBAkDtD,SAASuvD,kBAAmB5wD,EAAK1J,EAAO0nC,EAAQ6yB,GAC1Cv6D,EAAQ,IAAGA,EAAQ,MAASA,EAAQ,GACxC,IAAK,IAAIjB,EAAI,EAAG6L,EAAIrE,KAAKwS,IAAIrP,EAAIhI,OAASgmC,EAAQ,GAAI3oC,EAAI6L,IAAK7L,EAC7D2K,EAAIg+B,EAAS3oC,IAAMiB,EAAS,KAAS,GAAKu6D,EAAex7D,EAAI,EAAIA,MAClC,GAA5Bw7D,EAAex7D,EAAI,EAAIA,GA8B9B,SAASy7D,kBAAmB9wD,EAAK1J,EAAO0nC,EAAQ6yB,GAC1Cv6D,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GAC5C,IAAK,IAAIjB,EAAI,EAAG6L,EAAIrE,KAAKwS,IAAIrP,EAAIhI,OAASgmC,EAAQ,GAAI3oC,EAAI6L,IAAK7L,EAC7D2K,EAAIg+B,EAAS3oC,GAAMiB,IAAuC,GAA5Bu6D,EAAex7D,EAAI,EAAIA,GAAU,IAmJnE,SAAS07D,aAAc/wD,EAAK1J,EAAO0nC,EAAQ0yB,EAAK70C,EAAKxM,GACnD,GAAI2uB,EAAS0yB,EAAM1wD,EAAIhI,OAAQ,MAAM,IAAIqJ,WAAW,sBACpD,GAAI28B,EAAS,EAAG,MAAM,IAAI38B,WAAW,sBAGvC,SAAS2vD,WAAYhxD,EAAK1J,EAAO0nC,EAAQ6yB,EAAcI,GAKrD,OAJKA,GACHF,aAAa/wD,EAAK1J,EAAO0nC,EAAQ,GAEnCwtB,EAAQjkD,MAAMvH,EAAK1J,EAAO0nC,EAAQ6yB,EAAc,GAAI,GAC7C7yB,EAAS,EAWlB,SAASkzB,YAAalxD,EAAK1J,EAAO0nC,EAAQ6yB,EAAcI,GAKtD,OAJKA,GACHF,aAAa/wD,EAAK1J,EAAO0nC,EAAQ,GAEnCwtB,EAAQjkD,MAAMvH,EAAK1J,EAAO0nC,EAAQ6yB,EAAc,GAAI,GAC7C7yB,EAAS,EA/clBr9B,OAAOxJ,UAAUgK,MAAQ,SAASA,MAAOi7B,EAAOywB,GAC9C,IAoBIsE,EApBAlxD,EAAM1F,KAAKvC,OAqBf,IApBAokC,IAAUA,GAGE,GACVA,GAASn8B,GACG,IAAGm8B,EAAQ,GACdA,EAAQn8B,IACjBm8B,EAAQn8B,IANV4sD,OAAcjyD,IAARiyD,EAAoB5sD,IAAQ4sD,GASxB,GACRA,GAAO5sD,GACG,IAAG4sD,EAAM,GACVA,EAAM5sD,IACf4sD,EAAM5sD,GAGJ4sD,EAAMzwB,IAAOywB,EAAMzwB,GAGnBz7B,OAAO+qD,qBACTyF,EAAS52D,KAAKm1D,SAAStzB,EAAOywB,IACvBn0D,UAAYiI,OAAOxJ,cACrB,CACL,IAAIi6D,EAAWvE,EAAMzwB,EACrB+0B,EAAS,IAAIxwD,OAAOywD,OAAUx2D,GAC9B,IAAK,IAAIvF,EAAI,EAAGA,EAAI+7D,IAAY/7D,EAC9B87D,EAAO97D,GAAKkF,KAAKlF,EAAI+mC,GAIzB,OAAO+0B,GAWTxwD,OAAOxJ,UAAUk6D,WAAa,SAASA,WAAYrzB,EAAQguB,EAAYiF,GACrEjzB,GAAkB,EAClBguB,GAA0B,EACrBiF,GAAUR,YAAYzyB,EAAQguB,EAAYzxD,KAAKvC,QAKpD,IAHA,IAAI4N,EAAMrL,KAAKyjC,GACXszB,EAAM,EACNj8D,EAAI,IACCA,EAAI22D,IAAesF,GAAO,MACjC1rD,GAAOrL,KAAKyjC,EAAS3oC,GAAKi8D,EAG5B,OAAO1rD,GAGTjF,OAAOxJ,UAAUo6D,WAAa,SAASA,WAAYvzB,EAAQguB,EAAYiF,GACrEjzB,GAAkB,EAClBguB,GAA0B,EACrBiF,GACHR,YAAYzyB,EAAQguB,EAAYzxD,KAAKvC,QAKvC,IAFA,IAAI4N,EAAMrL,KAAKyjC,IAAWguB,GACtBsF,EAAM,EACHtF,EAAa,IAAMsF,GAAO,MAC/B1rD,GAAOrL,KAAKyjC,IAAWguB,GAAcsF,EAGvC,OAAO1rD,GAGTjF,OAAOxJ,UAAUq6D,UAAY,SAASA,UAAWxzB,EAAQizB,GAEvD,OADKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QACpCuC,KAAKyjC,IAGdr9B,OAAOxJ,UAAUs6D,aAAe,SAASA,aAAczzB,EAAQizB,GAE7D,OADKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QACpCuC,KAAKyjC,GAAWzjC,KAAKyjC,EAAS,IAAM,GAG7Cr9B,OAAOxJ,UAAUu2D,aAAe,SAASA,aAAc1vB,EAAQizB,GAE7D,OADKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QACnCuC,KAAKyjC,IAAW,EAAKzjC,KAAKyjC,EAAS,IAG7Cr9B,OAAOxJ,UAAUu6D,aAAe,SAASA,aAAc1zB,EAAQizB,GAG7D,OAFKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,SAElCuC,KAAKyjC,GACTzjC,KAAKyjC,EAAS,IAAM,EACpBzjC,KAAKyjC,EAAS,IAAM,IACD,SAAnBzjC,KAAKyjC,EAAS,IAGrBr9B,OAAOxJ,UAAUw6D,aAAe,SAASA,aAAc3zB,EAAQizB,GAG7D,OAFKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QAEpB,SAAfuC,KAAKyjC,IACTzjC,KAAKyjC,EAAS,IAAM,GACrBzjC,KAAKyjC,EAAS,IAAM,EACrBzjC,KAAKyjC,EAAS,KAGlBr9B,OAAOxJ,UAAUy6D,UAAY,SAASA,UAAW5zB,EAAQguB,EAAYiF,GACnEjzB,GAAkB,EAClBguB,GAA0B,EACrBiF,GAAUR,YAAYzyB,EAAQguB,EAAYzxD,KAAKvC,QAKpD,IAHA,IAAI4N,EAAMrL,KAAKyjC,GACXszB,EAAM,EACNj8D,EAAI,IACCA,EAAI22D,IAAesF,GAAO,MACjC1rD,GAAOrL,KAAKyjC,EAAS3oC,GAAKi8D,EAM5B,OAFI1rD,IAFJ0rD,GAAO,OAES1rD,GAAO/I,KAAKykB,IAAI,EAAG,EAAI0qC,IAEhCpmD,GAGTjF,OAAOxJ,UAAU06D,UAAY,SAASA,UAAW7zB,EAAQguB,EAAYiF,GACnEjzB,GAAkB,EAClBguB,GAA0B,EACrBiF,GAAUR,YAAYzyB,EAAQguB,EAAYzxD,KAAKvC,QAKpD,IAHA,IAAI3C,EAAI22D,EACJsF,EAAM,EACN1rD,EAAMrL,KAAKyjC,IAAW3oC,GACnBA,EAAI,IAAMi8D,GAAO,MACtB1rD,GAAOrL,KAAKyjC,IAAW3oC,GAAKi8D,EAM9B,OAFI1rD,IAFJ0rD,GAAO,OAES1rD,GAAO/I,KAAKykB,IAAI,EAAG,EAAI0qC,IAEhCpmD,GAGTjF,OAAOxJ,UAAU26D,SAAW,SAASA,SAAU9zB,EAAQizB,GAErD,OADKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QACtB,IAAfuC,KAAKyjC,IAC0B,GAA5B,IAAOzjC,KAAKyjC,GAAU,GADKzjC,KAAKyjC,IAI3Cr9B,OAAOxJ,UAAU46D,YAAc,SAASA,YAAa/zB,EAAQizB,GACtDA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QAC3C,IAAI4N,EAAMrL,KAAKyjC,GAAWzjC,KAAKyjC,EAAS,IAAM,EAC9C,OAAc,MAANp4B,EAAsB,WAANA,EAAmBA,GAG7CjF,OAAOxJ,UAAU66D,YAAc,SAASA,YAAah0B,EAAQizB,GACtDA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QAC3C,IAAI4N,EAAMrL,KAAKyjC,EAAS,GAAMzjC,KAAKyjC,IAAW,EAC9C,OAAc,MAANp4B,EAAsB,WAANA,EAAmBA,GAG7CjF,OAAOxJ,UAAU86D,YAAc,SAASA,YAAaj0B,EAAQizB,GAG3D,OAFKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QAEnCuC,KAAKyjC,GACVzjC,KAAKyjC,EAAS,IAAM,EACpBzjC,KAAKyjC,EAAS,IAAM,GACpBzjC,KAAKyjC,EAAS,IAAM,IAGzBr9B,OAAOxJ,UAAU+6D,YAAc,SAASA,YAAal0B,EAAQizB,GAG3D,OAFKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QAEnCuC,KAAKyjC,IAAW,GACrBzjC,KAAKyjC,EAAS,IAAM,GACpBzjC,KAAKyjC,EAAS,IAAM,EACpBzjC,KAAKyjC,EAAS,IAGnBr9B,OAAOxJ,UAAUg7D,YAAc,SAASA,YAAan0B,EAAQizB,GAE3D,OADKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QACpCwzD,EAAQiC,KAAKlzD,KAAMyjC,GAAQ,EAAM,GAAI,IAG9Cr9B,OAAOxJ,UAAUi7D,YAAc,SAASA,YAAap0B,EAAQizB,GAE3D,OADKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QACpCwzD,EAAQiC,KAAKlzD,KAAMyjC,GAAQ,EAAO,GAAI,IAG/Cr9B,OAAOxJ,UAAUk7D,aAAe,SAASA,aAAcr0B,EAAQizB,GAE7D,OADKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QACpCwzD,EAAQiC,KAAKlzD,KAAMyjC,GAAQ,EAAM,GAAI,IAG9Cr9B,OAAOxJ,UAAUm7D,aAAe,SAASA,aAAct0B,EAAQizB,GAE7D,OADKA,GAAUR,YAAYzyB,EAAQ,EAAGzjC,KAAKvC,QACpCwzD,EAAQiC,KAAKlzD,KAAMyjC,GAAQ,EAAO,GAAI,IAS/Cr9B,OAAOxJ,UAAUo7D,YAAc,SAASA,YAAaj8D,EAAO0nC,EAAQguB,EAAYiF,IAC9E36D,GAASA,EACT0nC,GAAkB,EAClBguB,GAA0B,EACrBiF,IAEHN,SAASp2D,KAAMjE,EAAO0nC,EAAQguB,EADfnvD,KAAKykB,IAAI,EAAG,EAAI0qC,GAAc,EACO,GAGtD,IAAIsF,EAAM,EACNj8D,EAAI,EAER,IADAkF,KAAKyjC,GAAkB,IAAR1nC,IACNjB,EAAI22D,IAAesF,GAAO,MACjC/2D,KAAKyjC,EAAS3oC,GAAMiB,EAAQg7D,EAAO,IAGrC,OAAOtzB,EAASguB,GAGlBrrD,OAAOxJ,UAAUq7D,YAAc,SAASA,YAAal8D,EAAO0nC,EAAQguB,EAAYiF,IAC9E36D,GAASA,EACT0nC,GAAkB,EAClBguB,GAA0B,EACrBiF,IAEHN,SAASp2D,KAAMjE,EAAO0nC,EAAQguB,EADfnvD,KAAKykB,IAAI,EAAG,EAAI0qC,GAAc,EACO,GAGtD,IAAI32D,EAAI22D,EAAa,EACjBsF,EAAM,EAEV,IADA/2D,KAAKyjC,EAAS3oC,GAAa,IAARiB,IACVjB,GAAK,IAAMi8D,GAAO,MACzB/2D,KAAKyjC,EAAS3oC,GAAMiB,EAAQg7D,EAAO,IAGrC,OAAOtzB,EAASguB,GAGlBrrD,OAAOxJ,UAAUs7D,WAAa,SAASA,WAAYn8D,EAAO0nC,EAAQizB,GAMhE,OALA36D,GAASA,EACT0nC,GAAkB,EACbizB,GAAUN,SAASp2D,KAAMjE,EAAO0nC,EAAQ,EAAG,IAAM,GACjDr9B,OAAO+qD,sBAAqBp1D,EAAQuG,KAAKiJ,MAAMxP,IACpDiE,KAAKyjC,GAAmB,IAAR1nC,EACT0nC,EAAS,GAWlBr9B,OAAOxJ,UAAUu7D,cAAgB,SAASA,cAAep8D,EAAO0nC,EAAQizB,GAUtE,OATA36D,GAASA,EACT0nC,GAAkB,EACbizB,GAAUN,SAASp2D,KAAMjE,EAAO0nC,EAAQ,EAAG,MAAQ,GACpDr9B,OAAO+qD,qBACTnxD,KAAKyjC,GAAmB,IAAR1nC,EAChBiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAE9Bs6D,kBAAkBr2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAUw7D,cAAgB,SAASA,cAAer8D,EAAO0nC,EAAQizB,GAUtE,OATA36D,GAASA,EACT0nC,GAAkB,EACbizB,GAAUN,SAASp2D,KAAMjE,EAAO0nC,EAAQ,EAAG,MAAQ,GACpDr9B,OAAO+qD,qBACTnxD,KAAKyjC,GAAW1nC,IAAU,EAC1BiE,KAAKyjC,EAAS,GAAc,IAAR1nC,GAEpBs6D,kBAAkBr2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAUlBr9B,OAAOxJ,UAAUy7D,cAAgB,SAASA,cAAet8D,EAAO0nC,EAAQizB,GAYtE,OAXA36D,GAASA,EACT0nC,GAAkB,EACbizB,GAAUN,SAASp2D,KAAMjE,EAAO0nC,EAAQ,EAAG,WAAY,GACxDr9B,OAAO+qD,qBACTnxD,KAAKyjC,EAAS,GAAM1nC,IAAU,GAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,EAC9BiE,KAAKyjC,GAAmB,IAAR1nC,GAEhBw6D,kBAAkBv2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAU07D,cAAgB,SAASA,cAAev8D,EAAO0nC,EAAQizB,GAYtE,OAXA36D,GAASA,EACT0nC,GAAkB,EACbizB,GAAUN,SAASp2D,KAAMjE,EAAO0nC,EAAQ,EAAG,WAAY,GACxDr9B,OAAO+qD,qBACTnxD,KAAKyjC,GAAW1nC,IAAU,GAC1BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,EAC9BiE,KAAKyjC,EAAS,GAAc,IAAR1nC,GAEpBw6D,kBAAkBv2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAU27D,WAAa,SAASA,WAAYx8D,EAAO0nC,EAAQguB,EAAYiF,GAG5E,GAFA36D,GAASA,EACT0nC,GAAkB,GACbizB,EAAU,CACb,IAAIj+B,EAAQn2B,KAAKykB,IAAI,EAAG,EAAI0qC,EAAa,GAEzC2E,SAASp2D,KAAMjE,EAAO0nC,EAAQguB,EAAYh5B,EAAQ,GAAIA,GAGxD,IAAI39B,EAAI,EACJi8D,EAAM,EACNyB,EAAM,EAEV,IADAx4D,KAAKyjC,GAAkB,IAAR1nC,IACNjB,EAAI22D,IAAesF,GAAO,MAC7Bh7D,EAAQ,GAAa,IAARy8D,GAAsC,IAAzBx4D,KAAKyjC,EAAS3oC,EAAI,KAC9C09D,EAAM,GAERx4D,KAAKyjC,EAAS3oC,IAAOiB,EAAQg7D,GAAQ,GAAKyB,EAAM,IAGlD,OAAO/0B,EAASguB,GAGlBrrD,OAAOxJ,UAAU67D,WAAa,SAASA,WAAY18D,EAAO0nC,EAAQguB,EAAYiF,GAG5E,GAFA36D,GAASA,EACT0nC,GAAkB,GACbizB,EAAU,CACb,IAAIj+B,EAAQn2B,KAAKykB,IAAI,EAAG,EAAI0qC,EAAa,GAEzC2E,SAASp2D,KAAMjE,EAAO0nC,EAAQguB,EAAYh5B,EAAQ,GAAIA,GAGxD,IAAI39B,EAAI22D,EAAa,EACjBsF,EAAM,EACNyB,EAAM,EAEV,IADAx4D,KAAKyjC,EAAS3oC,GAAa,IAARiB,IACVjB,GAAK,IAAMi8D,GAAO,MACrBh7D,EAAQ,GAAa,IAARy8D,GAAsC,IAAzBx4D,KAAKyjC,EAAS3oC,EAAI,KAC9C09D,EAAM,GAERx4D,KAAKyjC,EAAS3oC,IAAOiB,EAAQg7D,GAAQ,GAAKyB,EAAM,IAGlD,OAAO/0B,EAASguB,GAGlBrrD,OAAOxJ,UAAU87D,UAAY,SAASA,UAAW38D,EAAO0nC,EAAQizB,GAO9D,OANA36D,GAASA,EACT0nC,GAAkB,EACbizB,GAAUN,SAASp2D,KAAMjE,EAAO0nC,EAAQ,EAAG,KAAO,KAClDr9B,OAAO+qD,sBAAqBp1D,EAAQuG,KAAKiJ,MAAMxP,IAChDA,EAAQ,IAAGA,EAAQ,IAAOA,EAAQ,GACtCiE,KAAKyjC,GAAmB,IAAR1nC,EACT0nC,EAAS,GAGlBr9B,OAAOxJ,UAAU+7D,aAAe,SAASA,aAAc58D,EAAO0nC,EAAQizB,GAUpE,OATA36D,GAASA,EACT0nC,GAAkB,EACbizB,GAAUN,SAASp2D,KAAMjE,EAAO0nC,EAAQ,EAAG,OAAS,OACrDr9B,OAAO+qD,qBACTnxD,KAAKyjC,GAAmB,IAAR1nC,EAChBiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAE9Bs6D,kBAAkBr2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAUg8D,aAAe,SAASA,aAAc78D,EAAO0nC,EAAQizB,GAUpE,OATA36D,GAASA,EACT0nC,GAAkB,EACbizB,GAAUN,SAASp2D,KAAMjE,EAAO0nC,EAAQ,EAAG,OAAS,OACrDr9B,OAAO+qD,qBACTnxD,KAAKyjC,GAAW1nC,IAAU,EAC1BiE,KAAKyjC,EAAS,GAAc,IAAR1nC,GAEpBs6D,kBAAkBr2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAUi8D,aAAe,SAASA,aAAc98D,EAAO0nC,EAAQizB,GAYpE,OAXA36D,GAASA,EACT0nC,GAAkB,EACbizB,GAAUN,SAASp2D,KAAMjE,EAAO0nC,EAAQ,EAAG,YAAa,YACzDr9B,OAAO+qD,qBACTnxD,KAAKyjC,GAAmB,IAAR1nC,EAChBiE,KAAKyjC,EAAS,GAAM1nC,IAAU,EAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,IAE9Bw6D,kBAAkBv2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAUk8D,aAAe,SAASA,aAAc/8D,EAAO0nC,EAAQizB,GAapE,OAZA36D,GAASA,EACT0nC,GAAkB,EACbizB,GAAUN,SAASp2D,KAAMjE,EAAO0nC,EAAQ,EAAG,YAAa,YACzD1nC,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GACxCqK,OAAO+qD,qBACTnxD,KAAKyjC,GAAW1nC,IAAU,GAC1BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,EAC9BiE,KAAKyjC,EAAS,GAAc,IAAR1nC,GAEpBw6D,kBAAkBv2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAgBlBr9B,OAAOxJ,UAAUm8D,aAAe,SAASA,aAAch9D,EAAO0nC,EAAQizB,GACpE,OAAOD,WAAWz2D,KAAMjE,EAAO0nC,GAAQ,EAAMizB,IAG/CtwD,OAAOxJ,UAAUo8D,aAAe,SAASA,aAAcj9D,EAAO0nC,EAAQizB,GACpE,OAAOD,WAAWz2D,KAAMjE,EAAO0nC,GAAQ,EAAOizB,IAWhDtwD,OAAOxJ,UAAUq8D,cAAgB,SAASA,cAAel9D,EAAO0nC,EAAQizB,GACtE,OAAOC,YAAY32D,KAAMjE,EAAO0nC,GAAQ,EAAMizB,IAGhDtwD,OAAOxJ,UAAUs8D,cAAgB,SAASA,cAAen9D,EAAO0nC,EAAQizB,GACtE,OAAOC,YAAY32D,KAAMjE,EAAO0nC,GAAQ,EAAOizB,IAIjDtwD,OAAOxJ,UAAU0pB,KAAO,SAASA,KAAM/oB,EAAQ47D,EAAat3B,EAAOywB,GAQjE,GAPKzwB,IAAOA,EAAQ,GACfywB,GAAe,IAARA,IAAWA,EAAMtyD,KAAKvC,QAC9B07D,GAAe57D,EAAOE,SAAQ07D,EAAc57D,EAAOE,QAClD07D,IAAaA,EAAc,GAC5B7G,EAAM,GAAKA,EAAMzwB,IAAOywB,EAAMzwB,GAG9BywB,IAAQzwB,EAAO,OAAO,EAC1B,GAAsB,IAAlBtkC,EAAOE,QAAgC,IAAhBuC,KAAKvC,OAAc,OAAO,EAGrD,GAAI07D,EAAc,EAChB,MAAM,IAAIryD,WAAW,6BAEvB,GAAI+6B,EAAQ,GAAKA,GAAS7hC,KAAKvC,OAAQ,MAAM,IAAIqJ,WAAW,6BAC5D,GAAIwrD,EAAM,EAAG,MAAM,IAAIxrD,WAAW,2BAG9BwrD,EAAMtyD,KAAKvC,SAAQ60D,EAAMtyD,KAAKvC,QAC9BF,EAAOE,OAAS07D,EAAc7G,EAAMzwB,IACtCywB,EAAM/0D,EAAOE,OAAS07D,EAAct3B,GAGtC,IACI/mC,EADA4K,EAAM4sD,EAAMzwB,EAGhB,GAAI7hC,OAASzC,GAAUskC,EAAQs3B,GAAeA,EAAc7G,EAE1D,IAAKx3D,EAAI4K,EAAM,EAAG5K,GAAK,IAAKA,EAC1ByC,EAAOzC,EAAIq+D,GAAen5D,KAAKlF,EAAI+mC,QAEhC,GAAIn8B,EAAM,MAASU,OAAO+qD,oBAE/B,IAAKr2D,EAAI,EAAGA,EAAI4K,IAAO5K,EACrByC,EAAOzC,EAAIq+D,GAAen5D,KAAKlF,EAAI+mC,QAGrCtS,WAAW3yB,UAAU0U,IAAIrW,KACvBsC,EACAyC,KAAKm1D,SAAStzB,EAAOA,EAAQn8B,GAC7ByzD,GAIJ,OAAOzzD,GAOTU,OAAOxJ,UAAU24D,KAAO,SAASA,KAAMlqD,EAAKw2B,EAAOywB,EAAKV,GAEtD,GAAmB,iBAARvmD,EAAkB,CAS3B,GARqB,iBAAVw2B,GACT+vB,EAAW/vB,EACXA,EAAQ,EACRywB,EAAMtyD,KAAKvC,QACa,iBAAR60D,IAChBV,EAAWU,EACXA,EAAMtyD,KAAKvC,QAEM,IAAf4N,EAAI5N,OAAc,CACpB,IAAI27D,EAAO/tD,EAAI0V,WAAW,GACtBq4C,EAAO,MACT/tD,EAAM+tD,GAGV,QAAiB/4D,IAAbuxD,GAA8C,iBAAbA,EACnC,MAAM,IAAIv0D,UAAU,6BAEtB,GAAwB,iBAAbu0D,IAA0BxrD,OAAOyrD,WAAWD,GACrD,MAAM,IAAIv0D,UAAU,qBAAuBu0D,OAErB,iBAARvmD,IAChBA,GAAY,KAId,GAAIw2B,EAAQ,GAAK7hC,KAAKvC,OAASokC,GAAS7hC,KAAKvC,OAAS60D,EACpD,MAAM,IAAIxrD,WAAW,sBAGvB,GAAIwrD,GAAOzwB,EACT,OAAO7hC,KAQT,IAAIlF,EACJ,GANA+mC,KAAkB,EAClBywB,OAAcjyD,IAARiyD,EAAoBtyD,KAAKvC,OAAS60D,IAAQ,EAE3CjnD,IAAKA,EAAM,GAGG,iBAARA,EACT,IAAKvQ,EAAI+mC,EAAO/mC,EAAIw3D,IAAOx3D,EACzBkF,KAAKlF,GAAKuQ,MAEP,CACL,IAAI4qD,EAAQ7vD,OAAO2mB,SAAS1hB,GACxBA,EACA8mD,YAAY,IAAI/rD,OAAOiF,EAAKumD,GAAU7rD,YACtCL,EAAMuwD,EAAMx4D,OAChB,IAAK3C,EAAI,EAAGA,EAAIw3D,EAAMzwB,IAAS/mC,EAC7BkF,KAAKlF,EAAI+mC,GAASo0B,EAAMn7D,EAAI4K,GAIhC,OAAO1F,MAMT,IAAIq5D,EAAoB,qBAmBxB,SAASrD,MAAOz5D,GACd,OAAIA,EAAI,GAAW,IAAMA,EAAEwJ,SAAS,IAC7BxJ,EAAEwJ,SAAS,IAGpB,SAASosD,YAAa1/C,EAAQyhD,GAE5B,IAAIS,EADJT,EAAQA,GAAS53B,IAMjB,IAJA,IAAI7+B,EAASgV,EAAOhV,OAChB67D,EAAgB,KAChBrD,EAAQ,GAEHn7D,EAAI,EAAGA,EAAI2C,IAAU3C,EAAG,CAI/B,IAHA65D,EAAYliD,EAAOsO,WAAWjmB,IAGd,OAAU65D,EAAY,MAAQ,CAE5C,IAAK2E,EAAe,CAElB,GAAI3E,EAAY,MAAQ,EAEjBT,GAAS,IAAM,GAAG+B,EAAMlvD,KAAK,IAAM,IAAM,KAC9C,SACK,GAAIjM,EAAI,IAAM2C,EAAQ,EAEtBy2D,GAAS,IAAM,GAAG+B,EAAMlvD,KAAK,IAAM,IAAM,KAC9C,SAIFuyD,EAAgB3E,EAEhB,SAIF,GAAIA,EAAY,MAAQ,EACjBT,GAAS,IAAM,GAAG+B,EAAMlvD,KAAK,IAAM,IAAM,KAC9CuyD,EAAgB3E,EAChB,SAIFA,EAAkE,OAArD2E,EAAgB,OAAU,GAAK3E,EAAY,YAC/C2E,IAEJpF,GAAS,IAAM,GAAG+B,EAAMlvD,KAAK,IAAM,IAAM,KAMhD,GAHAuyD,EAAgB,KAGZ3E,EAAY,IAAM,CACpB,IAAKT,GAAS,GAAK,EAAG,MACtB+B,EAAMlvD,KAAK4tD,QACN,GAAIA,EAAY,KAAO,CAC5B,IAAKT,GAAS,GAAK,EAAG,MACtB+B,EAAMlvD,KACJ4tD,GAAa,EAAM,IACP,GAAZA,EAAmB,UAEhB,GAAIA,EAAY,MAAS,CAC9B,IAAKT,GAAS,GAAK,EAAG,MACtB+B,EAAMlvD,KACJ4tD,GAAa,GAAM,IACnBA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,SAEhB,MAAIA,EAAY,SASrB,MAAM,IAAIzuD,MAAM,sBARhB,IAAKguD,GAAS,GAAK,EAAG,MACtB+B,EAAMlvD,KACJ4tD,GAAa,GAAO,IACpBA,GAAa,GAAM,GAAO,IAC1BA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,MAOzB,OAAOsB,EA4BT,SAAS7D,cAAe3wC,GACtB,OAAOuvC,EAAOuI,YAhIhB,SAASC,YAAa/3C,GAIpB,IAFAA,EAUF,SAASg4C,WAAYh4C,GACnB,OAAIA,EAAIstB,KAAattB,EAAIstB,OAClBttB,EAAImC,QAAQ,aAAc,IAZ3B61C,CAAWh4C,GAAKmC,QAAQy1C,EAAmB,KAEzC57D,OAAS,EAAG,MAAO,GAE3B,KAAOgkB,EAAIhkB,OAAS,GAAM,GACxBgkB,GAAY,IAEd,OAAOA,EAuHmB+3C,CAAY/3C,IAGxC,SAASiyC,WAAY9mD,EAAK8sD,EAAKj2B,EAAQhmC,GACrC,IAAK,IAAI3C,EAAI,EAAGA,EAAI2C,KACb3C,EAAI2oC,GAAUi2B,EAAIj8D,QAAY3C,GAAK8R,EAAInP,UADhB3C,EAE5B4+D,EAAI5+D,EAAI2oC,GAAU72B,EAAI9R,GAExB,OAAOA,K,kCCrvDTR,EAAQm3D,WAuCR,SAASA,WAAYkI,GACnB,IAAI5wB,EAAO6wB,QAAQD,GACfE,EAAW9wB,EAAK,GAChB+wB,EAAkB/wB,EAAK,GAC3B,OAAuC,GAA9B8wB,EAAWC,GAAuB,EAAKA,GA1ClDx/D,EAAQi/D,YAiDR,SAASA,YAAaI,GACpB,IAAII,EAcAj/D,EAbAiuC,EAAO6wB,QAAQD,GACfE,EAAW9wB,EAAK,GAChB+wB,EAAkB/wB,EAAK,GAEvB1kC,EAAM,IAAI21D,EAVhB,SAASC,YAAaN,EAAKE,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,EAS9BG,CAAYN,EAAKE,EAAUC,IAEzCI,EAAU,EAGVx0D,EAAMo0D,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAK/+D,EAAI,EAAGA,EAAI4K,EAAK5K,GAAK,EACxBi/D,EACGI,EAAUR,EAAI54C,WAAWjmB,KAAO,GAChCq/D,EAAUR,EAAI54C,WAAWjmB,EAAI,KAAO,GACpCq/D,EAAUR,EAAI54C,WAAWjmB,EAAI,KAAO,EACrCq/D,EAAUR,EAAI54C,WAAWjmB,EAAI,IAC/BuJ,EAAI61D,KAAcH,GAAO,GAAM,IAC/B11D,EAAI61D,KAAcH,GAAO,EAAK,IAC9B11D,EAAI61D,KAAmB,IAANH,EAGK,IAApBD,IACFC,EACGI,EAAUR,EAAI54C,WAAWjmB,KAAO,EAChCq/D,EAAUR,EAAI54C,WAAWjmB,EAAI,KAAO,EACvCuJ,EAAI61D,KAAmB,IAANH,GAGK,IAApBD,IACFC,EACGI,EAAUR,EAAI54C,WAAWjmB,KAAO,GAChCq/D,EAAUR,EAAI54C,WAAWjmB,EAAI,KAAO,EACpCq/D,EAAUR,EAAI54C,WAAWjmB,EAAI,KAAO,EACvCuJ,EAAI61D,KAAcH,GAAO,EAAK,IAC9B11D,EAAI61D,KAAmB,IAANH,GAGnB,OAAO11D,GA3FT/J,EAAQ+5D,cAkHR,SAASA,cAAe+F,GAQtB,IAPA,IAAIL,EACAr0D,EAAM00D,EAAM38D,OACZ48D,EAAa30D,EAAM,EACnB40D,EAAQ,GAIHx/D,EAAI,EAAGy4B,EAAO7tB,EAAM20D,EAAYv/D,EAAIy4B,EAAMz4B,GAH9B,MAInBw/D,EAAMvzD,KAAKwzD,YACTH,EAAOt/D,EAAIA,EALM,MAKgBy4B,EAAOA,EAAQz4B,EAL/B,QAUF,IAAfu/D,GACFN,EAAMK,EAAM10D,EAAM,GAClB40D,EAAMvzD,KACJyzD,EAAOT,GAAO,GACdS,EAAQT,GAAO,EAAK,IACpB,OAEsB,IAAfM,IACTN,GAAOK,EAAM10D,EAAM,IAAM,GAAK00D,EAAM10D,EAAM,GAC1C40D,EAAMvzD,KACJyzD,EAAOT,GAAO,IACdS,EAAQT,GAAO,EAAK,IACpBS,EAAQT,GAAO,EAAK,IACpB,MAIJ,OAAOO,EAAMtzD,KAAK,KA3IpB,IALA,IAAIwzD,EAAS,GACTL,EAAY,GACZH,EAA4B,oBAAfzqC,WAA6BA,WAAarqB,MAEvDk0D,EAAO,mEACFt+D,EAAI,EAAG4K,EAAM0zD,EAAK37D,OAAQ3C,EAAI4K,IAAO5K,EAC5C0/D,EAAO1/D,GAAKs+D,EAAKt+D,GACjBq/D,EAAUf,EAAKr4C,WAAWjmB,IAAMA,EAQlC,SAAS8+D,QAASD,GAChB,IAAIj0D,EAAMi0D,EAAIl8D,OAEd,GAAIiI,EAAM,EAAI,EACZ,MAAM,IAAIQ,MAAM,kDAKlB,IAAI2zD,EAAWF,EAAIxgD,QAAQ,KAO3B,OANkB,IAAd0gD,IAAiBA,EAAWn0D,GAMzB,CAACm0D,EAJcA,IAAan0D,EAC/B,EACA,EAAKm0D,EAAW,GAsEtB,SAASU,YAAaH,EAAOv4B,EAAOywB,GAGlC,IAFA,IAAIyH,EARoBU,EASpB5yB,EAAS,GACJ/sC,EAAI+mC,EAAO/mC,EAAIw3D,EAAKx3D,GAAK,EAChCi/D,GACIK,EAAMt/D,IAAM,GAAM,WAClBs/D,EAAMt/D,EAAI,IAAM,EAAK,QACP,IAAfs/D,EAAMt/D,EAAI,IACb+sC,EAAO9gC,KAdFyzD,GADiBC,EAeMV,IAdT,GAAK,IACxBS,EAAOC,GAAO,GAAK,IACnBD,EAAOC,GAAO,EAAI,IAClBD,EAAa,GAANC,IAaT,OAAO5yB,EAAO7gC,KAAK,IAjGrBmzD,EAAU,IAAIp5C,WAAW,IAAM,GAC/Bo5C,EAAU,IAAIp5C,WAAW,IAAM,I,cCnB/BzmB,EAAQ44D,KAAO,SAAUvlC,EAAQ8V,EAAQi3B,EAAMC,EAAMC,GACnD,IAAI73D,EAAG7H,EACH2/D,EAAiB,EAATD,EAAcD,EAAO,EAC7BG,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBE,GAAS,EACTlgE,EAAI4/D,EAAQE,EAAS,EAAK,EAC1Bx/D,EAAIs/D,GAAQ,EAAI,EAChB39D,EAAI4wB,EAAO8V,EAAS3oC,GAOxB,IALAA,GAAKM,EAEL2H,EAAIhG,GAAM,IAAOi+D,GAAU,EAC3Bj+D,KAAQi+D,EACRA,GAASH,EACFG,EAAQ,EAAGj4D,EAAS,IAAJA,EAAW4qB,EAAO8V,EAAS3oC,GAAIA,GAAKM,EAAG4/D,GAAS,GAKvE,IAHA9/D,EAAI6H,GAAM,IAAOi4D,GAAU,EAC3Bj4D,KAAQi4D,EACRA,GAASL,EACFK,EAAQ,EAAG9/D,EAAS,IAAJA,EAAWyyB,EAAO8V,EAAS3oC,GAAIA,GAAKM,EAAG4/D,GAAS,GAEvE,GAAU,IAANj4D,EACFA,EAAI,EAAIg4D,MACH,IAAIh4D,IAAM+3D,EACf,OAAO5/D,EAAIutB,IAAsB6T,KAAdv/B,GAAK,EAAI,GAE5B7B,GAAQoH,KAAKykB,IAAI,EAAG4zC,GACpB53D,GAAQg4D,EAEV,OAAQh+D,GAAK,EAAI,GAAK7B,EAAIoH,KAAKykB,IAAI,EAAGhkB,EAAI43D,IAG5CrgE,EAAQ0S,MAAQ,SAAU2gB,EAAQ5xB,EAAO0nC,EAAQi3B,EAAMC,EAAMC,GAC3D,IAAI73D,EAAG7H,EAAGC,EACN0/D,EAAiB,EAATD,EAAcD,EAAO,EAC7BG,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBG,EAAe,KAATN,EAAcr4D,KAAKykB,IAAI,GAAI,IAAMzkB,KAAKykB,IAAI,GAAI,IAAM,EAC1DjsB,EAAI4/D,EAAO,EAAKE,EAAS,EACzBx/D,EAAIs/D,EAAO,GAAK,EAChB39D,EAAIhB,EAAQ,GAAgB,IAAVA,GAAe,EAAIA,EAAQ,EAAK,EAAI,EAmC1D,IAjCAA,EAAQuG,KAAKumB,IAAI9sB,GAEbyP,MAAMzP,IAAUA,IAAUugC,KAC5BphC,EAAIsQ,MAAMzP,GAAS,EAAI,EACvBgH,EAAI+3D,IAEJ/3D,EAAIT,KAAKiJ,MAAMjJ,KAAKw9C,IAAI/jD,GAASuG,KAAK44D,KAClCn/D,GAASZ,EAAImH,KAAKykB,IAAI,GAAIhkB,IAAM,IAClCA,IACA5H,GAAK,IAGLY,GADEgH,EAAIg4D,GAAS,EACNE,EAAK9/D,EAEL8/D,EAAK34D,KAAKykB,IAAI,EAAG,EAAIg0C,IAEpB5/D,GAAK,IACf4H,IACA5H,GAAK,GAGH4H,EAAIg4D,GAASD,GACf5/D,EAAI,EACJ6H,EAAI+3D,GACK/3D,EAAIg4D,GAAS,GACtB7/D,GAAMa,EAAQZ,EAAK,GAAKmH,KAAKykB,IAAI,EAAG4zC,GACpC53D,GAAQg4D,IAER7/D,EAAIa,EAAQuG,KAAKykB,IAAI,EAAGg0C,EAAQ,GAAKz4D,KAAKykB,IAAI,EAAG4zC,GACjD53D,EAAI,IAID43D,GAAQ,EAAGhtC,EAAO8V,EAAS3oC,GAAS,IAAJI,EAAUJ,GAAKM,EAAGF,GAAK,IAAKy/D,GAAQ,GAI3E,IAFA53D,EAAKA,GAAK43D,EAAQz/D,EAClB2/D,GAAQF,EACDE,EAAO,EAAGltC,EAAO8V,EAAS3oC,GAAS,IAAJiI,EAAUjI,GAAKM,EAAG2H,GAAK,IAAK83D,GAAQ,GAE1EltC,EAAO8V,EAAS3oC,EAAIM,IAAU,IAAJ2B,I,cClF5B,IAAIgJ,EAAW,GAAGA,SAElBxL,EAAOD,QAAU4K,MAAMgY,SAAW,SAAU7Y,GAC1C,MAA6B,kBAAtB0B,EAAS9K,KAAKoJ,K,gBCHvB,IAAIqT,EAAmB,EAAQ,IAM/Bnd,EAAOD,QAJP,SAAS6gE,mBAAmB92D,GAC1B,GAAIa,MAAMgY,QAAQ7Y,GAAM,OAAOqT,EAAiBrT,K,cCClD9J,EAAOD,QAJP,SAAS8gE,iBAAiB5kC,GACxB,GAAsB,oBAAX36B,QAA0BA,OAAOmH,YAAYxH,OAAOg7B,GAAO,OAAOtxB,MAAMC,KAAKqxB,K,cCG1Fj8B,EAAOD,QAJP,SAAS+gE,qBACP,MAAM,IAAIh+D,UAAU,0I,6LCDtB,QACA,YACA,QAEA,QACA,Y,8eAEqBk1C,E,yFACnB,4BAAgC,IAApBl3C,EAAoB,uDAAb,YAAa,uDACxBA,EAAM,CAAC,gBAAiB,U,sEAK3BigE,EAAcrd,GAAiB,IAAZ7pC,EAAY,uDAAL9T,MACvB49C,GAAS,IAAAp5C,aAAYm5C,EAAK7pC,GAAMsX,QAAQ,OAC9C,OAAO1rB,KAAKu7D,eAAeD,GAAcxe,KAAKoB,K,gCAG3Cod,EAAcrd,GAAiB,IAAZ7pC,EAAY,uDAAL9T,MACvB49C,GAAS,IAAAp5C,aAAYm5C,EAAK7pC,GAAMsX,QAAQ,OAC9C,OAAO1rB,KAAKu7D,eAAeD,GAAcle,KAAKc,K,sCAGxCod,GACN,OAAOt7D,KAAKu7D,eAAeD,GAAcE,Y,wCAGlCF,EAActd,GACrB,OAAI94C,MAAMgY,QAAQ8gC,GACTh+C,KAAKu7D,eAAeD,GAAc,mBAAmBtd,GACvDh+C,KAAKu7D,eAAeD,GAAc,iBAAiBtd,K,yFAK5Bsd,G,sGACTt7D,KAAKrE,IAAI,SAASgjD,cAAc2c,G,cAA/CG,E,yBACCz7D,KAAKrE,IAAI,SAASugD,kBAAkBuf,I,2MAG1BC,G,mHAKP17D,KAAK27D,gBAAgBD,G,mBAH7BE,E,EAAAA,SACA1xD,E,EAAAA,KACSoxD,E,EAAT5pB,QAEGkqB,E,yCAAiB,CAAEA,WAAUtpB,UAAW,O,cACvCupB,EAAqB,QAAT3xD,EAAiB,OAAS,M,UACjBlK,KAAK87D,kBAAkBR,EAAcO,G,eAA1DE,E,yBACC,CACLH,WACAtpB,UAAW,IAAI0pB,WAAJ,GACTC,iBAAkBj8D,KAClBs7D,iBAFS,yBAGLpxD,EAHK,WAGWwxD,IAHX,yBAILG,EAJK,WAIgBE,GAJhB,M,uKAWArqB,GACb,OAAO1xC,KAAKrE,IAAI,iBAAiBugE,2BAC/BxqB,EACAyqB,a,oEAKF,OAAOn8D,KAAKrE,IAAI,iBAAiBukD,kBAAkBnO,wB,gFAG/BL,G,6GAC8B9xC,QAAQgQ,IAAI,CAC5D5P,KAAKo8D,wBAAwBC,QAAQ3qB,GACrC1xC,KAAKo8D,wBAAwBE,OAAO5qB,K,wCAF/B6qB,E,KAAkBC,E,KAIrBD,IAAqBE,e,yCAChB,CAAEvyD,KAAM,OAAQwnC,QAAS6qB,EAAkBX,UAAU,I,UAC1DY,IAAoBC,e,0CACf,CAAEvyD,KAAM,MAAOwnC,QAAS8qB,EAAiBZ,UAAU,I,iCACrD,CAAE1xD,KAAM,KAAMwnC,QAAS,GAAIkqB,UAAU,I,gLAG5BN,EAAcpxD,GAC9B,MAAa,QAATA,EAAuBlK,KAAKu7D,eAAeD,GAAcoB,MAC3C,SAATxyD,EAAwBlK,KAAKu7D,eAAeD,GAAcqB,OAC5D,S,kBAlFmCxc,gB,YAuF9C3kD,OAAO+3C,OACLhB,EAAiB31C,UACjB,CAAC,gBAAiB,kBAAkBk6B,QAAO,SAACV,EAAK/6B,GAI/C,OAHA+6B,EAAI/6B,GAAQ,WAAkB,MAC5B,OAAO,EAAA2E,KAAKrE,IAAI,UAASN,GAAlB,oBAEF+6B,IACN,M,qHCrGgB4lC,E,WACnB,sBAAyE,IAA3DC,EAA2D,EAA3DA,iBAAkBX,EAAyC,EAAzCA,aAAcsB,EAA2B,EAA3BA,YAAaC,EAAc,EAAdA,YAAc,6BACvE78D,KAAK88D,kBAAoBb,EACzBj8D,KAAK+8D,cAAgBzB,EACrBt7D,KAAKg9D,aAAeJ,EACpB58D,KAAKi9D,YAAcJ,E,uFAInB,OAAO78D,KAAK+8D,gB,sDAIZ,OAAO/8D,KAAKg9D,e,oDAIZ,OAAOh9D,KAAKi9D,gB,yBAYhBzhE,OAAO+3C,OACLyoB,EAAUp/D,UATe,CACzB,OACA,OACA,WACA,iBACA,6BAKmBk6B,QAAO,SAACV,EAAK/6B,GAI9B,OAHA+6B,EAAI/6B,GAAQ,WAAkB,6BAAN4E,EAAM,yBAANA,EAAM,gBAC5B,OAAO,EAAAD,KAAK88D,mBAAkBzhE,GAAvB,SAA6B2E,KAAK+8D,eAAlC,OAAoD98D,KAEtDm2B,IACN,M,s0DCpCL,QACA,QACA,Y,8eAEqBqc,E,iGACnB,mCAAuC,IAA3Bp3C,EAA2B,uDAApB,mBAAoB,8DAC/BA,EAAM,CAAC,gBAAiB,YAAa,uB,6FAGhCwhE,GACX,OAAO78D,KAAKo8D,wBAAwBc,aAAaL,K,8CAGvCD,GAKV,OAJW,IAAIO,UACbn9D,KAAKo8D,wBACLp8D,KAAKrE,IAAI,uBAEDyhE,MAAM,cAAe,CAACR,M,4CAIhC,OAAO58D,KAAKo8D,wBAAwBiB,c,gDAGzB3rB,GACX,OAAO1xC,KAAKrE,IAAI,aAAa2hE,aAAa5rB,K,oEAI1C,OAAO1xC,KAAKrE,IAAI,iBAAiBukD,kBAAkBnO,0B,yBA1BFoO,gB,iKCJhCgd,E,WACnB,gCAAYI,EAAUC,IAAoB,0CACxCx9D,KAAKy9D,UAAYF,EACjBv9D,KAAK09D,OAASF,E,8EAeVj5C,EAAQtkB,GAAM,WACZ09D,GAAU,6BAAC,2HACT,EADS,wBAEG,IAAKF,WAAUl5C,GAAf,gCAA8BtkB,GAA9B,CAAoC,CAAE09D,cAFzC,cAETC,EAFS,OAGf,EAAKC,WAAWD,EAAIE,QAAQC,MAHb,kBAIR,GAJQ,gDAAD,GAOhB,OADA/9D,KAAK29D,QAAUA,EACRA,I,4CAGEI,GAAM,IACPC,EAAkBh+D,KAAKy9D,UAAL,UAAyB5gB,OAA3CmhB,cACFC,EAAOj+D,KAAK09D,OAAO/hE,IAAI,QAAQuiE,MAC/BC,EAAQF,EAAKG,MAAMC,UACvBJ,EAAKG,MAAMpI,MAAMgI,EAAcM,YAE3BC,EAAeR,EAAKv3D,QACxB,SAAAzD,GAAC,OAAIA,EAAE65C,OAAO,GAAG34B,gBAAkBk6C,EAAMl6C,iBAErCu6C,EAAYR,EAAcrU,MAC9B4U,EAAa,GAAG3hB,OAChB2hB,EAAa,GAAGvzD,MAElBhL,KAAKs7D,aAAekD,EAAS,Y,+BAnC7B,OAAOx+D,KAAK09D,OAAOe,eAAez+D,KAAK29D,SAASe,S,oCAIhD,OAAO1+D,KAAK09D,OAAOe,eAAez+D,KAAK29D,SAASgB,c,6CAIhD,OAAO3+D,KAAK09D,OAAOe,eAAez+D,KAAK29D,SAASiB,yB,+OCfpD,QACA,QAEA,YACA,Q,mlCAEA,IAIqBjsB,E,mHACnB,6BAAiC,IAArBt3C,EAAqB,uDAAd,aAAc,wDACzBA,EAAM,CAAC,gBAAiB,cAAe,U,iHAG9BwjE,EAAWC,EAASC,EAAWC,G,wGAC5Bh/D,KAAKi/D,mBAAmBC,WACxCL,EACAC,EACAC,EACAC,G,cAJIpB,E,OAMAuB,EAAS36D,SAASo5D,EAAIE,QAAQC,KAAK,GAAGnhB,OAAO,I,kBAC5CuiB,G,qKAGIA,GACX,OAAOn/D,KAAKi/D,mBAAmBG,aAAaD,K,gCAGzCE,EAASC,GACZ,GAAID,EAAQ5hE,SAAW6hE,EAAU7hE,QAA6B,IAAnB4hE,EAAQ5hE,OACjD,MAAM,IAAIyI,MACR,oGAEJ,GAAuB,IAAnBm5D,EAAQ5hE,OAAc,CAExB,OAAOuC,KAAKu/D,wBADC,yBAC6BF,EAAQ,GAAIC,EAAU,IAGhE,OAAOt/D,KAAKu/D,wBADC,6BAC6BF,EAASC,K,wDAItCH,EAAQK,GACvB,IAAM3L,EAAY,IAAItkC,WAAW,IACjCiwC,EAAS/4D,SAAQ,SAACg5D,EAAa3kE,GAC7B+4D,EAAUA,EAAUp2D,OAAS3C,EAAI,GAAK2kE,EAAc,KAEtD,IAAMC,GAAW,IAAA74D,YAAWgtD,GAAW9tD,WACvC,OAAO/F,KAAKu/D,wBAAwBrgB,KAAKigB,EAAQO,K,0DAIjD,OAAO1/D,KAAKrE,IAAI,iBAAiBukD,kBAAkBlO,a,oEAInD,OAAOhyC,KAAKrE,IAAI,iBAAiBukD,kBAAkBjO,mB,wEAKvC8sB,G,+GACQ/+D,KAAK2/D,yB,OAIzB,IAJMC,E,OACAC,EAAWD,EAAMp5D,QAAO,SAAA1J,GAAC,OAAIA,EAAEiiE,YAAcA,KAC/Ce,EAASxjC,IAEJxhC,EAAI,EAAGA,EAAI+kE,EAASpiE,OAAQ3C,IAC/B+kE,EAAS/kE,GAAGqkE,OAASW,IACvBA,EAASD,EAAS/kE,GAAGqkE,OACrBY,EAAaF,EAAS/kE,I,yBAGnBilE,G,sLAGMZ,G,uGACOn/D,KAAK2/D,yB,cAAnBC,E,yBACCA,EAAM96B,MAAK,SAAAhoC,GAAC,OAAI0H,SAAS1H,EAAEqiE,UAAY36D,SAAS26D,O,4RAInDn/D,KAAK4/D,M,yCAAc5/D,KAAK4/D,O,uBACT5/D,KAAKrE,IAAI,eAAegkE,yB,cAA3C3/D,KAAK4/D,M,yBACE5/D,KAAK4/D,O,mKAIZ5/D,KAAK4/D,MAAQ,O,mFAGUluB,EAASytB,G,0GACzBn/D,KAAKrE,IAAI,eAAeqkE,mBAC7BtuB,EAAQztB,cACRk7C,I,yNAIiCztB,EAASytB,G,2GAClBn/D,KAAKrE,IAC7B,eACAskE,+BAA+BvuB,EAAQztB,cAAek7C,G,UAFlDe,E,gDAGmB,I,cACnBC,GAAe,IAAA76D,UAAS46D,EAAa,CAAEv6D,OAAQ,WAC/Cy6D,GAAS,IAAAp7D,aAAY,GAAKm7D,EAAa1iE,OAAQ0iE,G,kBAC9CC,EAAOx5C,UAAUpgB,QAAO,SAAA65D,GAAM,OAAe,IAAXA,GAA2B,MAAXA,M,6NAG9B3uB,G,uGACL1xC,KAAKrE,IAAI,eAAe2kE,uBAC5C5uB,EAAQztB,e,UADJ2M,E,gDAGe,I,gCACdA,EAAQxrB,KAAI,SAAA7J,GACjB,IAAIglE,EAAqB,KACzB,GAAIhlE,EAAE2kE,YAAa,CACjB,IAAMC,GAAe,IAAA76D,UAAS/J,EAAE2kE,YAAa,CAAEv6D,OAAQ,WAEvD46D,GADe,IAAAv7D,aAAY,GAAKm7D,EAAa1iE,OAAQ0iE,GAElDv5C,UACApgB,QAAO,SAAA65D,GAAM,OAAe,IAAXA,GAA2B,MAAXA,KAEtC,MAAO,CACLlB,OAAQ5jE,EAAE4jE,OACVqB,OAAQjlE,EAAEmkE,SACVa,0B,+MAKmBpB,G,0GAChBn/D,KAAKrE,IAAI,eAAe8kE,mBAAmBtB,I,qMAGjCztB,G,uGACI1xC,KAAKrE,IAAI,eAAe+kE,aAC3ChvB,EAAQztB,cAnIW,Y,cAkIf08C,E,0BAIC,IAAArgE,KAAIqgE,I,kMAGQxB,G,8GACOn/D,KAAK4gE,SAASzB,G,uBAAhCL,E,EAAAA,QACF+B,EAAUv+D,KAAKiJ,MAAMuzD,EAAU,K,SACf9+D,KAAKrE,IAAI,eAAemlE,cAC5C3B,EACA0B,G,cAFIE,E,0BAIC,IAAAzgE,KAAIygE,EAAQjqC,QAAO,SAACV,EAAK4qC,GAAN,OAAc5qC,EAAM4qC,EAAIC,aAAY,K,iNAG/B9B,G,8GACLn/D,KAAK4gE,SAASzB,G,uBAAhCL,E,EAAAA,QACF+B,EAAUv+D,KAAKiJ,MAAMuzD,EAAU,K,SACf9+D,KAAKrE,IAAI,eAAeulE,0BAC5C/B,EACA0B,G,cAFIE,E,0BAIC,IAAAzgE,KACLygE,EAAQjqC,QAAO,SAACV,EAAK4qC,GAAN,OAAc5qC,EAAMooB,WAAWwiB,EAAIC,cAAa,K,0NAIrC9B,G,wHACFn/D,KAAK4gE,SAASzB,G,uBAAhCL,E,EAAAA,QACF+B,EAAUv+D,KAAKiJ,MAAMuzD,EAAU,K,SACjB9+D,KAAKrE,IAAI,eAAeulE,0BAC1C/B,EACA0B,G,UAFIpjB,E,OAIA0jB,EAAwB1jB,EAAM3mB,QAClC,SAACV,EAAK4qC,GAAN,OAAc,aAAUA,EAAIC,YAAc,GAAGv2C,KAAK0L,MAClD,aAAU,IAGNgrC,EAAQ,CACZC,OAAQ,EACRC,OAAQ,KACRH,wBACAvwC,QAAS,IAEL2wC,EAAmB,CACvBC,aAAa,aAAU,GACvBC,UAAU,aAAU,GACpBH,QAAQ,EACRI,YAAY,GAGO,IAAjBjkB,EAAMhgD,O,0CACD2jE,G,WAIT3jB,EAAMh3C,SAAQ,SAAAy4C,GACZA,EAAKmhB,OAASnhB,EAAKkhB,OAAO37C,MACrB28C,EAAMxwC,QAAQsuB,EAAKmhB,UACtBe,EAAMxwC,QAAQsuB,EAAKmhB,QAAnB,iBAAkCkB,IAEpCH,EAAMxwC,QAAQsuB,EAAKmhB,QAAQmB,aAAc,aACvCJ,EAAMxwC,QAAQsuB,EAAKmhB,QAAQmB,aAC3B92C,KAAKw0B,EAAK+hB,YAAc,MAI5BzlE,OAAOgb,QAAQ4qD,EAAMxwC,SAASnqB,SAAQ,YAA+B,yBAA7B+5D,EAA6B,UAAnBgB,YAChCt7C,GAAGi7C,EAAsBr/C,IAAI,MAAKs/C,EAAME,OAASd,OAI/DY,EAAME,O,wBACRF,EAAMxwC,QAAQwwC,EAAME,QAAQA,QAAS,E,kBAC9BF,G,2BAKPA,EAAMC,SAGN,IAAMM,EAAkBnmE,OAAOgb,QAAQ4qD,EAAMxwC,SAASpqB,QACpD,yCAAsCk7D,c,EAGZC,EAAgB7qC,QAAO,SAAC8qC,EAAKZ,GAAQ,IACtDa,GADsD,aAC1CD,EAD0C,MAEtDE,GAFsD,aAE1Cd,EAF0C,MAG/D,OACEc,EAASN,YACN92C,KAAKo3C,EAASL,UACdx0D,GAAG40D,EAASL,YAAY92C,KAAKm3C,EAASJ,WAElCT,EACFY,KATFG,G,qBAyCP,GA7BAX,EAAMxwC,QAAQmxC,GAAmBL,YAAa,EAC9CN,EAAMxwC,QAAQmxC,GAAmBN,UAAW,aAAU,GAK/BhkB,EACpBr4C,KAAI,SAAC85C,EAAMhzC,GAAP,sCAAuBgzC,GAAvB,IAA6BhzC,aACjC1F,QAAO,SAAA04C,GAAI,OAAI16C,SAAS06C,EAAKmhB,UAAY77D,SAASu9D,MAClDv7D,QAAO,SAAA04C,GAAI,OAA4C,IAAxCA,EAAKkhB,OAAOlhB,EAAKkhB,OAAO3iE,OAAS,MAGpCgJ,SAAQ,SAAAy4C,GACrBzB,EAAMyB,EAAKhzC,OAAOm0D,OAAS5iB,EAAMyB,EAAKhzC,OAAOk0D,OAAO37C,MACpD28C,EAAMxwC,QAAQ6sB,EAAMyB,EAAKhzC,OAAOm0D,QAAQoB,UAAW,aACjDL,EAAMxwC,QAAQ6sB,EAAMyB,EAAKhzC,OAAOm0D,QAAQoB,UACxC/2C,KAAKw0B,EAAK+hB,YAAc,MAI5BzlE,OAAOgb,QAAQ4qD,EAAMxwC,SAASnqB,SAC5B,YAAyC,yBAAvC+5D,EAAuC,YAA7BgB,EAA6B,EAA7BA,YAAaC,EAAgB,EAAhBA,SACnBD,EAAY92C,KAAK+2C,GAAUv7C,GAAGi7C,EAAsBr/C,IAAI,MAC1Ds/C,EAAME,OAASd,MAOlBY,EAAMC,OAnQI,KAmQoBD,EAAME,SACR,IAA3BK,EAAgBlkE,QAA2C,IAA3BkkE,EAAgBlkE,UAC/C2jE,EAAME,OACT,CACA,IACIU,EADA1gD,GAAM,aAAU,GAEpB9lB,OAAOgb,QAAQ4qD,EAAMxwC,SAASnqB,SAC5B,YAAyC,yBAAvC+5D,EAAuC,YAA7BgB,EAA6B,EAA7BA,YAAaC,EAAgB,EAAhBA,SACnBD,EAAY92C,KAAK+2C,GAAUv7C,GAAG5E,KAChCA,EAAMkgD,EAAY92C,KAAK+2C,GACvBO,EAAYxB,MAIlBY,EAAME,OAASU,EAIjB,GAA0C,IAAtCxmE,OAAO4M,KAAKg5D,EAAMxwC,SAASnzB,OAG7B,SAAO2jE,GAET,GAA0C,IAAtC5lE,OAAO4M,KAAKg5D,EAAMxwC,SAASnzB,OAE7B,MAAM,IAAIyI,MAAJ,sCAAyCk7D,EAAMxwC,W,WA3EjDwwC,EAAME,O,4IAiFdF,EAAMxwC,QAAQwwC,EAAME,QAAQA,QAAS,E,kBAC9BF,G,sNAGmBjC,G,8GACGv/D,QAAQgQ,IAAI,CACvC5P,KAAKiiE,eAAe9C,GACpBn/D,KAAKrE,IAAI,SACNumE,SAAS5hE,OACT6hE,gB,4CAJEC,E,KAAOC,E,uBAMPD,EACJtgD,IAAIugD,GACJ14C,MAAM,KACNgD,Y,+NAGmCwyC,G,8GACTv/D,QAAQgQ,IAAI,CACvC5P,KAAKsiE,2BAA2BnD,GAChCn/D,KAAKrE,IAAI,SACNumE,SAAS5hE,OACT6hE,gB,4CAJEC,E,KAAOC,E,uBAMPD,EACJtgD,IAAIugD,GACJ14C,MAAM,KACNgD,Y,4NAGoBwyC,G,kHACGn/D,KAAK4gE,SAASzB,G,uBAAhCL,E,EAAAA,QACF+B,EAAUv+D,KAAKiJ,MAAMuzD,EAAU,K,SACV9+D,KAAKrE,IAAI,eAAemlE,cACjD3B,EACA0B,G,OAGF,IALM0B,E,OAIFjhD,EAAMihD,EAAa,GACdznE,EAAI,EAAGA,EAAIynE,EAAa9kE,OAAQ3C,IACnCynE,EAAaznE,GAAGmmE,WAAa3/C,EAAI2/C,aACnC3/C,EAAMihD,EAAaznE,I,yBAGhBwmB,EAAMA,EAAIo+C,SAAW,G,+IA3Ue3O,kB,+LCV/C,QACA,YACA,Q,ulCAOqByR,E,2FACnB,oBAAkC,MAAtBnnE,EAAsB,uDAAf,cAAe,oCAChC,cAAMA,EAAM,CAAC,UACRonE,cAAgB,GACrB,EAAKvxB,SAAU,EAHiB,E,8GAMXwxB,EAAWC,G,0GACbC,MAAMF,EAAW,CAClCn+C,OAAQ,OACRs+C,QAAS,CACPC,OAAQ,mBACR,eAAgB,oBAElBC,KAAMptB,KAAKE,UAAU,CACnB8sB,Y,cAPEK,E,gBAUiBA,EAAKC,O,uBAApBj4D,E,EAAAA,MACR,aAAOA,EAAP,mCAAyC03D,I,kBAClC13D,G,2MAGsB03D,EAAWC,G,0FACpCO,E,UAAcR,E,YAAaC,IAC3B3iE,KAAKyiE,cAAcS,G,yCAAkBljE,KAAKyiE,cAAcS,I,cAC5DljE,KAAKyiE,cAAcS,GAAYljE,KAAKmjE,iBAAiBT,EAAWC,G,kBACzD3iE,KAAKyiE,cAAcS,I,4KAGjB75D,GACLA,EAAS6nC,UACXlxC,KAAKkxC,SAAU,K,wCAKjB,IAAMD,EAAUjxC,KAAKrE,IAAI,QAAQs1C,QACjCjxC,KAAK0iE,UAAY1iE,KAAKkxC,SAClB,IAAArsC,wBAAuBosC,IACvB,IAAAxsC,iBAAgBwsC,K,gMAiBGjxC,KAAKmjE,iBAAiBnjE,KAAK0iE,U,mNAA5CU,E,yBACCA,EAASC,YAAYxT,MAAMzqD,KAAI,SAAAtI,GAGpC,OAFAA,EAAE+hE,UAAY,IAAI9vD,KAAmB,IAAdjS,EAAE+hE,WACzB/hE,EAAEgiE,QAAU,IAAI/vD,KAAiB,IAAZjS,EAAEgiE,SAChBhiE,M,8MAIcqiE,G,gGACjBwD,E,kCAAmCxD,E,0CAKlBn/D,KAAKmjE,iBAAiBnjE,KAAK0iE,UAAWC,G,cAAvDS,E,yBACC5+D,SAAS4+D,EAASE,aAAazT,MAAM,K,qMAG3Bne,EAAS6xB,G,gGACpBZ,E,qEAAsEjxB,E,uBAAsB6xB,E,sFAO3EvjE,KAAKmjE,iBAAiBnjE,KAAK0iE,UAAWC,G,WAAvDS,E,QACQI,6CAA6C3T,MAAM,G,yCACxD,G,gCACFuT,EAASI,6CAA6C3T,MAAM,GAChE8Q,Q,uMAGoBjvB,EAASytB,G,gGAC1BwD,E,4CACuBjxB,E,yBAAwBytB,E,8EAM9Bn/D,KAAKmjE,iBAAiBnjE,KAAK0iE,UAAWC,G,WAAvDS,E,QACQK,YAAY5T,MAAM,G,yCAAW,M,gCACpCuT,EAASK,YAAY5T,MAAM,GAAG6P,U,iNAGVhuB,G,gGACrBixB,E,gDAC2BjxB,E,wHAQV1xC,KAAKmjE,iBAAiBnjE,KAAK0iE,UAAWC,G,WAAvDS,E,QACQM,gBAAgB7T,MAAM,G,yCAAW,M,gCACxCuT,EAASM,gBAAgB7T,O,2NAGGne,EAASytB,G,gGACtCwD,E,wDACmCjxB,E,yBAAwBytB,E,iFAM1Cn/D,KAAKmjE,iBAAiBnjE,KAAK0iE,UAAWC,G,WAAvDS,E,QACQO,wBAAwB9T,MAAM,G,yCAAW,M,gCAChDuT,EAASO,wBAAwB9T,MAAM,GAAGqQ,a,qNAG9BqD,G,gGACbZ,E,8CACyBY,E,0CAIRvjE,KAAK4jE,yBAAyB5jE,KAAK0iE,UAAWC,G,cAA/DS,E,yBACCA,EAASS,kBAAkBhU,MAAM,I,+MAGVsP,EAAQoE,G,iGAChCZ,E,uDAAwDxD,E,sBAAoBoE,E,6FAO3DvjE,KAAK4jE,yBAAyB5jE,KAAK0iE,UAAWC,G,cAA/DS,E,yBAECA,EAASU,iCAAiCjU,MAC9CrpD,QAAO,SAAA04C,GAAI,MAAyB,MAArBA,EAAKghB,eACpB96D,KAAI,SAAA85C,GACH,IAAMihB,GAAe,IAAA76D,UAAS45C,EAAKghB,YAAa,CAAEv6D,OAAQ,WACpDy6D,GAAS,IAAAp7D,aAAY,GAAKm7D,EAAa1iE,OAAQ0iE,GACrD,sCACKjhB,GADL,IAEEkhB,e,iNAKYjB,EAAQoE,G,qGACpBZ,E,iDAAkDxD,E,sBAAoBoE,E,8EAOrDvjE,KAAK4jE,yBAAyB5jE,KAAK0iE,UAAWC,G,cAA/DS,E,OAGNrC,GAFIA,EAAUqC,EAASW,2BAA2BlU,OAEhCrpD,QAAO,SAAAjL,GAAC,OAAmB,IAAfA,EAAEmkE,YAC1BsE,EAAcjD,EAAQjqC,QAAO,SAACV,EAAK4qC,GAIvC,OAAO5qC,GAHY5qB,MAAMgzC,WAAWwiB,EAAIC,aACpC,EACAziB,WAAWwiB,EAAIC,eAElB,G,kBACIF,EAAQ37D,KAAI,SAAA7J,GACjB,IAAM0lE,EAAaz1D,MAAMgzC,WAAWjjD,EAAE0lE,aAClC,EACAziB,WAAWjjD,EAAE0lE,YAGjB,OAFA1lE,EAAE0lE,WAAaA,EACf1lE,EAAE0oE,WAAc,IAAMhD,EAAc+C,EAC7BzoE,M,+SAccyE,KAAKmjE,iBAAiBnjE,KAAK0iE,U,8IAA5CU,E,OACAc,EAAQd,EAASe,YAAYtU,M,kBAC5BqU,G,6HA3M2BpT,iB,6BCDtC,IAAInlD,EAAwBnQ,OAAOmQ,sBAC/B9O,EAAiBrB,OAAOoB,UAAUC,eAClCunE,EAAmB5oE,OAAOoB,UAAU2L,qBAExC,SAASwM,SAAS1J,GACjB,GAAIA,QACH,MAAM,IAAIhO,UAAU,yDAGrB,OAAO7B,OAAO6P,GA+Cf9Q,EAAOD,QA5CP,SAAS+pE,kBACR,IACC,IAAK7oE,OAAO+3C,OACX,OAAO,EAMR,IAAI+wB,EAAQ,IAAIz4D,OAAO,OAEvB,GADAy4D,EAAM,GAAK,KACkC,MAAzC9oE,OAAO2b,oBAAoBmtD,GAAO,GACrC,OAAO,EAKR,IADA,IAAIC,EAAQ,GACHzpE,EAAI,EAAGA,EAAI,GAAIA,IACvBypE,EAAM,IAAM14D,OAAOkpD,aAAaj6D,IAAMA,EAKvC,GAAwB,eAHXU,OAAO2b,oBAAoBotD,GAAOn/D,KAAI,SAAU7I,GAC5D,OAAOgoE,EAAMhoE,MAEHyK,KAAK,IACf,OAAO,EAIR,IAAIw9D,EAAQ,GAIZ,MAHA,uBAAuBl+D,MAAM,IAAIG,SAAQ,SAAUg+D,GAClDD,EAAMC,GAAUA,KAGf,yBADEjpE,OAAO4M,KAAK5M,OAAO+3C,OAAO,GAAIixB,IAAQx9D,KAAK,IAM9C,MAAO5G,GAER,OAAO,GAIQikE,GAAoB7oE,OAAO+3C,OAAS,SAAUh2C,EAAQwD,GAKtE,IAJA,IAAIoE,EAEAmzC,EADAxL,EAAK/3B,SAASxX,GAGTR,EAAI,EAAGA,EAAImD,UAAUzC,OAAQV,IAAK,CAG1C,IAAK,IAAIV,KAFT8I,EAAO3J,OAAO0E,UAAUnD,IAGnBF,EAAe5B,KAAKkK,EAAM9I,KAC7BywC,EAAGzwC,GAAO8I,EAAK9I,IAIjB,GAAIsP,EAAuB,CAC1B2sC,EAAU3sC,EAAsBxG,GAChC,IAAK,IAAIrK,EAAI,EAAGA,EAAIw9C,EAAQ76C,OAAQ3C,IAC/BspE,EAAiBnpE,KAAKkK,EAAMmzC,EAAQx9C,MACvCgyC,EAAGwL,EAAQx9C,IAAMqK,EAAKmzC,EAAQx9C,MAMlC,OAAOgyC,I,iBCxFR,YAqBA,IAAI43B,EAA4BlpE,OAAOkpE,2BACrC,SAASA,0BAA0BznE,GAGjC,IAFA,IAAImL,EAAO5M,OAAO4M,KAAKnL,GACnB0nE,EAAc,GACT7pE,EAAI,EAAGA,EAAIsN,EAAK3K,OAAQ3C,IAC/B6pE,EAAYv8D,EAAKtN,IAAMU,OAAOsW,yBAAyB7U,EAAKmL,EAAKtN,IAEnE,OAAO6pE,GAGPC,EAAe,WACnBtqE,EAAQ4pB,OAAS,SAASthB,GACxB,IAAKiiE,SAASjiE,GAAI,CAEhB,IADA,IAAIkiE,EAAU,GACLhqE,EAAI,EAAGA,EAAIoF,UAAUzC,OAAQ3C,IACpCgqE,EAAQ/9D,KAAKonB,QAAQjuB,UAAUpF,KAEjC,OAAOgqE,EAAQ99D,KAAK,KAGlBlM,EAAI,EAmBR,IAnBA,IACImF,EAAOC,UACPwF,EAAMzF,EAAKxC,OACXgkB,EAAM5V,OAAOjJ,GAAGghB,QAAQghD,GAAc,SAAS3jD,GACjD,GAAU,OAANA,EAAY,MAAO,IACvB,GAAInmB,GAAK4K,EAAK,OAAOub,EACrB,OAAQA,GACN,IAAK,KAAM,OAAOpV,OAAO5L,EAAKnF,MAC9B,IAAK,KAAM,OAAOo4B,OAAOjzB,EAAKnF,MAC9B,IAAK,KACH,IACE,OAAO66C,KAAKE,UAAU51C,EAAKnF,MAC3B,MAAOgwC,GACP,MAAO,aAEX,QACE,OAAO7pB,MAGJA,EAAIhhB,EAAKnF,GAAIA,EAAI4K,EAAKub,EAAIhhB,IAAOnF,GACpCiqE,OAAO9jD,KAAOhe,SAASge,GACzBQ,GAAO,IAAMR,EAEbQ,GAAO,IAAM0M,QAAQlN,GAGzB,OAAOQ,GAOTnnB,EAAQylB,UAAY,SAAShgB,EAAIilE,GAC/B,QAAuB,IAAZprD,IAAqD,IAA1BA,EAAQqrD,cAC5C,OAAOllE,EAIT,QAAuB,IAAZ6Z,EACT,OAAO,WACL,OAAOtf,EAAQylB,UAAUhgB,EAAIilE,GAAK7kE,MAAMH,KAAME,YAIlD,IAAIglE,GAAS,EAeb,OAdA,SAASC,aACP,IAAKD,EAAQ,CACX,GAAItrD,EAAQwrD,iBACV,MAAM,IAAIl/D,MAAM8+D,GACPprD,EAAQyrD,iBACjBhe,QAAQie,MAAMN,GAEd3d,QAAQ3nD,MAAMslE,GAEhBE,GAAS,EAEX,OAAOnlE,EAAGI,MAAMH,KAAME,aAO1B,IACIqlE,EADAC,EAAS,GA6Bb,SAASr3C,QAAQlxB,EAAKuI,GAEpB,IAAI9E,EAAM,CACRy+B,KAAM,GACNsmC,QAASC,gBAkBX,OAfIxlE,UAAUzC,QAAU,IAAGiD,EAAI8uC,MAAQtvC,UAAU,IAC7CA,UAAUzC,QAAU,IAAGiD,EAAI+nD,OAASvoD,UAAU,IAC9Cs5C,UAAUh0C,GAEZ9E,EAAIilE,WAAangE,EACRA,GAETlL,EAAQsrE,QAAQllE,EAAK8E,GAGnBqgE,YAAYnlE,EAAIilE,cAAajlE,EAAIilE,YAAa,GAC9CE,YAAYnlE,EAAI8uC,SAAQ9uC,EAAI8uC,MAAQ,GACpCq2B,YAAYnlE,EAAI+nD,UAAS/nD,EAAI+nD,QAAS,GACtCod,YAAYnlE,EAAIolE,iBAAgBplE,EAAIolE,eAAgB,GACpDplE,EAAI+nD,SAAQ/nD,EAAI+kE,QAAUM,kBACvBC,YAAYtlE,EAAKzD,EAAKyD,EAAI8uC,OAoCnC,SAASu2B,iBAAiBtkD,EAAKwkD,GAC7B,IAAIx5D,EAAQ0hB,QAAQ+3C,OAAOD,GAE3B,OAAIx5D,EACK,KAAY0hB,QAAQs6B,OAAOh8C,GAAO,GAAK,IAAMgV,EAC7C,KAAY0M,QAAQs6B,OAAOh8C,GAAO,GAAK,IAEvCgV,EAKX,SAASikD,eAAejkD,EAAKwkD,GAC3B,OAAOxkD,EAeT,SAASukD,YAAYtlE,EAAK3E,EAAOoqE,GAG/B,GAAIzlE,EAAIolE,eACJ/pE,GACAugB,WAAWvgB,EAAMoyB,UAEjBpyB,EAAMoyB,UAAY7zB,EAAQ6zB,WAExBpyB,EAAM2C,aAAe3C,EAAM2C,YAAY9B,YAAcb,GAAQ,CACjE,IAAI++B,EAAM/+B,EAAMoyB,QAAQg4C,EAAczlE,GAItC,OAHKmkE,SAAS/pC,KACZA,EAAMkrC,YAAYtlE,EAAKo6B,EAAKqrC,IAEvBrrC,EAIT,IAAIsrC,EA+FN,SAASC,gBAAgB3lE,EAAK3E,GAC5B,GAAI8pE,YAAY9pE,GACd,OAAO2E,EAAI+kE,QAAQ,YAAa,aAClC,GAAIZ,SAAS9oE,GAAQ,CACnB,IAAIuqE,EAAS,IAAO3wB,KAAKE,UAAU95C,GAAO6nB,QAAQ,SAAU,IAClBA,QAAQ,KAAM,OACdA,QAAQ,OAAQ,KAAO,IACjE,OAAOljB,EAAI+kE,QAAQa,EAAQ,UAE7B,GAAIC,SAASxqE,GACX,OAAO2E,EAAI+kE,QAAQ,GAAK1pE,EAAO,UACjC,GAAIy9C,UAAUz9C,GACZ,OAAO2E,EAAI+kE,QAAQ,GAAK1pE,EAAO,WAEjC,GAAIgpE,OAAOhpE,GACT,OAAO2E,EAAI+kE,QAAQ,OAAQ,QA9GbY,CAAgB3lE,EAAK3E,GACrC,GAAIqqE,EACF,OAAOA,EAIT,IAAIh+D,EAAO5M,OAAO4M,KAAKrM,GACnByqE,EApCN,SAASC,YAAY57D,GACnB,IAAIy+C,EAAO,GAMX,OAJAz+C,EAAMpE,SAAQ,SAAS4E,EAAK6lB,GAC1Bo4B,EAAKj+C,IAAO,KAGPi+C,EA6BWmd,CAAYr+D,GAQ9B,GANI1H,EAAIilE,aACNv9D,EAAO5M,OAAO2b,oBAAoBpb,IAKhC40B,QAAQ50B,KACJqM,EAAK+Q,QAAQ,YAAc,GAAK/Q,EAAK+Q,QAAQ,gBAAkB,GACrE,OAAOutD,YAAY3qE,GAIrB,GAAoB,IAAhBqM,EAAK3K,OAAc,CACrB,GAAI6e,WAAWvgB,GAAQ,CACrB,IAAIV,EAAOU,EAAMV,KAAO,KAAOU,EAAMV,KAAO,GAC5C,OAAOqF,EAAI+kE,QAAQ,YAAcpqE,EAAO,IAAK,WAE/C,GAAI4zB,SAASlzB,GACX,OAAO2E,EAAI+kE,QAAQl/D,OAAO3J,UAAUmJ,SAAS9K,KAAKc,GAAQ,UAE5D,GAAIgzB,OAAOhzB,GACT,OAAO2E,EAAI+kE,QAAQ12D,KAAKnS,UAAUmJ,SAAS9K,KAAKc,GAAQ,QAE1D,GAAI40B,QAAQ50B,GACV,OAAO2qE,YAAY3qE,GAIvB,IA2CI8rC,EA3CA5gB,EAAO,GAAIpc,GAAQ,EAAO87D,EAAS,CAAC,IAAK,MAGzCzpD,QAAQnhB,KACV8O,GAAQ,EACR87D,EAAS,CAAC,IAAK,MAIbrqD,WAAWvgB,MAEbkrB,EAAO,cADClrB,EAAMV,KAAO,KAAOU,EAAMV,KAAO,IACf,KAkB5B,OAdI4zB,SAASlzB,KACXkrB,EAAO,IAAM1gB,OAAO3J,UAAUmJ,SAAS9K,KAAKc,IAI1CgzB,OAAOhzB,KACTkrB,EAAO,IAAMlY,KAAKnS,UAAUgqE,YAAY3rE,KAAKc,IAI3C40B,QAAQ50B,KACVkrB,EAAO,IAAMy/C,YAAY3qE,IAGP,IAAhBqM,EAAK3K,QAAkBoN,GAAyB,GAAhB9O,EAAM0B,OAItC0oE,EAAe,EACbl3C,SAASlzB,GACJ2E,EAAI+kE,QAAQl/D,OAAO3J,UAAUmJ,SAAS9K,KAAKc,GAAQ,UAEnD2E,EAAI+kE,QAAQ,WAAY,YAInC/kE,EAAIy+B,KAAKp4B,KAAKhL,GAIZ8rC,EADEh9B,EAsCN,SAASg8D,YAAYnmE,EAAK3E,EAAOoqE,EAAcK,EAAap+D,GAE1D,IADA,IAAIy/B,EAAS,GACJ/sC,EAAI,EAAGC,EAAIgB,EAAM0B,OAAQ3C,EAAIC,IAAKD,EACrC+B,eAAed,EAAO8P,OAAO/Q,IAC/B+sC,EAAO9gC,KAAK+/D,eAAepmE,EAAK3E,EAAOoqE,EAAcK,EACjD36D,OAAO/Q,IAAI,IAEf+sC,EAAO9gC,KAAK,IAShB,OANAqB,EAAK3B,SAAQ,SAASpK,GACfA,EAAI4xB,MAAM,UACb4Z,EAAO9gC,KAAK+/D,eAAepmE,EAAK3E,EAAOoqE,EAAcK,EACjDnqE,GAAK,OAGNwrC,EArDIg/B,CAAYnmE,EAAK3E,EAAOoqE,EAAcK,EAAap+D,GAEnDA,EAAKhD,KAAI,SAAS/I,GACzB,OAAOyqE,eAAepmE,EAAK3E,EAAOoqE,EAAcK,EAAanqE,EAAKwO,MAItEnK,EAAIy+B,KAAK1a,MA6GX,SAASsiD,qBAAqBl/B,EAAQ5gB,EAAM0/C,GAQ1C,GANa9+B,EAAO/Q,QAAO,SAASzX,EAAM2hD,GAGxC,OADIA,EAAI7nD,QAAQ,OAAS,GAAG6tD,EACrB3nD,EAAO2hD,EAAIp9C,QAAQ,kBAAmB,IAAInmB,OAAS,IACzD,GAEU,GACX,OAAOkpE,EAAO,IACG,KAAT1/C,EAAc,GAAKA,EAAO,OAC3B,IACA4gB,EAAO7gC,KAAK,SACZ,IACA2/D,EAAO,GAGhB,OAAOA,EAAO,GAAK1/C,EAAO,IAAM4gB,EAAO7gC,KAAK,MAAQ,IAAM2/D,EAAO,GA5H1DI,CAAqBl/B,EAAQ5gB,EAAM0/C,IAxBjCA,EAAO,GAAK1/C,EAAO0/C,EAAO,GA+CrC,SAASD,YAAY3qE,GACnB,MAAO,IAAMmK,MAAMtJ,UAAUmJ,SAAS9K,KAAKc,GAAS,IAwBtD,SAAS+qE,eAAepmE,EAAK3E,EAAOoqE,EAAcK,EAAanqE,EAAKwO,GAClE,IAAIxP,EAAMomB,EAAK1P,EAsCf,IArCAA,EAAOvW,OAAOsW,yBAAyB/V,EAAOM,IAAQ,CAAEN,MAAOA,EAAMM,KAC5DV,IAEL8lB,EADE1P,EAAKT,IACD5Q,EAAI+kE,QAAQ,kBAAmB,WAE/B/kE,EAAI+kE,QAAQ,WAAY,WAG5B1zD,EAAKT,MACPmQ,EAAM/gB,EAAI+kE,QAAQ,WAAY,YAG7B5oE,eAAe2pE,EAAanqE,KAC/BhB,EAAO,IAAMgB,EAAM,KAEhBolB,IACC/gB,EAAIy+B,KAAKhmB,QAAQpH,EAAKhW,OAAS,GAE/B0lB,EADEsjD,OAAOoB,GACHH,YAAYtlE,EAAKqR,EAAKhW,MAAO,MAE7BiqE,YAAYtlE,EAAKqR,EAAKhW,MAAOoqE,EAAe,IAE5ChtD,QAAQ,OAAS,IAErBsI,EADE5W,EACI4W,EAAInb,MAAM,MAAMlB,KAAI,SAAS6hE,GACjC,MAAO,KAAOA,KACbjgE,KAAK,MAAMklB,OAAO,GAEf,KAAOzK,EAAInb,MAAM,MAAMlB,KAAI,SAAS6hE,GACxC,MAAO,MAAQA,KACdjgE,KAAK,OAIZya,EAAM/gB,EAAI+kE,QAAQ,aAAc,YAGhCI,YAAYxqE,GAAO,CACrB,GAAIwP,GAASxO,EAAI4xB,MAAM,SACrB,OAAOxM,GAETpmB,EAAOs6C,KAAKE,UAAU,GAAKx5C,IAClB4xB,MAAM,iCACb5yB,EAAOA,EAAK6wB,OAAO,EAAG7wB,EAAKoC,OAAS,GACpCpC,EAAOqF,EAAI+kE,QAAQpqE,EAAM,UAEzBA,EAAOA,EAAKuoB,QAAQ,KAAM,OACdA,QAAQ,OAAQ,KAChBA,QAAQ,WAAY,KAChCvoB,EAAOqF,EAAI+kE,QAAQpqE,EAAM,WAI7B,OAAOA,EAAO,KAAOomB,EA2BvB,SAASvE,QAAQgqD,GACf,OAAOhiE,MAAMgY,QAAQgqD,GAIvB,SAAS1tB,UAAUh6C,GACjB,MAAsB,kBAARA,EAIhB,SAASulE,OAAOvlE,GACd,OAAe,OAARA,EAST,SAAS+mE,SAAS/mE,GAChB,MAAsB,iBAARA,EAIhB,SAASqlE,SAASrlE,GAChB,MAAsB,iBAARA,EAShB,SAASqmE,YAAYrmE,GACnB,YAAe,IAARA,EAIT,SAASyvB,SAASk4C,GAChB,OAAOlkE,SAASkkE,IAA8B,oBAAvB38D,eAAe28D,GAIxC,SAASlkE,SAASzD,GAChB,MAAsB,iBAARA,GAA4B,OAARA,EAIpC,SAASuvB,OAAO3zB,GACd,OAAO6H,SAAS7H,IAA4B,kBAAtBoP,eAAepP,GAIvC,SAASu1B,QAAQ5tB,GACf,OAAOE,SAASF,KACW,mBAAtByH,eAAezH,IAA2BA,aAAamD,OAI9D,SAASoW,WAAW9c,GAClB,MAAsB,mBAARA,EAgBhB,SAASgL,eAAejP,GACtB,OAAOC,OAAOoB,UAAUmJ,SAAS9K,KAAKM,GAIxC,SAAS2iC,IAAI3hC,GACX,OAAOA,EAAI,GAAK,IAAMA,EAAEwJ,SAAS,IAAMxJ,EAAEwJ,SAAS,IApbpDzL,EAAQ8sE,SAAW,SAAS91D,GAI1B,GAHIu0D,YAAYN,KACdA,EAAe3rD,EAAQsB,IAAImsD,YAAc,IAC3C/1D,EAAMA,EAAI+C,eACLmxD,EAAOl0D,GACV,GAAI,IAAI/K,OAAO,MAAQ+K,EAAM,MAAO,KAAKoB,KAAK6yD,GAAe,CAC3D,IAAI+B,EAAM1tD,EAAQ0tD,IAClB9B,EAAOl0D,GAAO,WACZ,IAAI0zD,EAAM1qE,EAAQ4pB,OAAO/jB,MAAM7F,EAAS4F,WACxCmnD,QAAQ3nD,MAAM,YAAa4R,EAAKg2D,EAAKtC,SAGvCQ,EAAOl0D,GAAO,aAGlB,OAAOk0D,EAAOl0D,IAoChBhX,EAAQ6zB,QAAUA,QAIlBA,QAAQs6B,OAAS,CACf,KAAS,CAAC,EAAG,IACb,OAAW,CAAC,EAAG,IACf,UAAc,CAAC,EAAG,IAClB,QAAY,CAAC,EAAG,IAChB,MAAU,CAAC,GAAI,IACf,KAAS,CAAC,GAAI,IACd,MAAU,CAAC,GAAI,IACf,KAAS,CAAC,GAAI,IACd,KAAS,CAAC,GAAI,IACd,MAAU,CAAC,GAAI,IACf,QAAY,CAAC,GAAI,IACjB,IAAQ,CAAC,GAAI,IACb,OAAW,CAAC,GAAI,KAIlBt6B,QAAQ+3C,OAAS,CACf,QAAW,OACX,OAAU,SACV,QAAW,SACX,UAAa,OACb,KAAQ,OACR,OAAU,QACV,KAAQ,UAER,OAAU,OAkRZ5rE,EAAQ4iB,QAAUA,QAKlB5iB,EAAQk/C,UAAYA,UAKpBl/C,EAAQyqE,OAASA,OAKjBzqE,EAAQitE,kBAHR,SAASA,kBAAkB/nE,GACzB,OAAc,MAAPA,GAOTlF,EAAQisE,SAAWA,SAKnBjsE,EAAQuqE,SAAWA,SAKnBvqE,EAAQ43B,SAHR,SAASA,SAAS1yB,GAChB,MAAsB,iBAARA,GAOhBlF,EAAQurE,YAAcA,YAKtBvrE,EAAQ20B,SAAWA,SAKnB30B,EAAQ2I,SAAWA,SAKnB3I,EAAQy0B,OAASA,OAMjBz0B,EAAQq2B,QAAUA,QAKlBr2B,EAAQgiB,WAAaA,WAUrBhiB,EAAQq1B,YARR,SAASA,YAAYnwB,GACnB,OAAe,OAARA,GACe,kBAARA,GACQ,iBAARA,GACQ,iBAARA,GACQ,iBAARA,QACQ,IAARA,GAIhBlF,EAAQyyB,SAAW,EAAQ,KAY3B,IAAIy6C,EAAS,CAAC,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MACxD,MAAO,MAAO,OAG5B,SAASC,YACP,IAAIrsE,EAAI,IAAI2T,KACR24D,EAAO,CAACxpC,IAAI9iC,EAAEusE,YACNzpC,IAAI9iC,EAAEwsE,cACN1pC,IAAI9iC,EAAEysE,eAAe7gE,KAAK,KACtC,MAAO,CAAC5L,EAAE0sE,UAAWN,EAAOpsE,EAAE2sE,YAAaL,GAAM1gE,KAAK,KAqCxD,SAASnK,eAAeI,EAAKi6B,GAC3B,OAAO17B,OAAOoB,UAAUC,eAAe5B,KAAKgC,EAAKi6B,GAjCnD58B,EAAQwlD,IAAM,WACZuH,QAAQvH,IAAI,UAAW2nB,YAAantE,EAAQ4pB,OAAO/jB,MAAM7F,EAAS4F,aAiBpE5F,EAAQ82B,SAAW,EAAQ,KAE3B92B,EAAQsrE,QAAU,SAASoC,EAAQ/0C,GAEjC,IAAKA,IAAQhwB,SAASgwB,GAAM,OAAO+0C,EAInC,IAFA,IAAI5/D,EAAO5M,OAAO4M,KAAK6qB,GACnBn4B,EAAIsN,EAAK3K,OACN3C,KACLktE,EAAO5/D,EAAKtN,IAAMm4B,EAAI7qB,EAAKtN,IAE7B,OAAOktE,GAOT,IAAIC,EAA6C,oBAAXpsE,OAAyBA,OAAO,8BAA2BwE,EA0DjG,SAAS6nE,sBAAsB1hB,EAAQ/sC,GAKrC,IAAK+sC,EAAQ,CACX,IAAI2hB,EAAY,IAAIjiE,MAAM,2CAC1BiiE,EAAU3hB,OAASA,EACnBA,EAAS2hB,EAEX,OAAO1uD,EAAG+sC,GAlEZlsD,EAAQ8tE,UAAY,SAASA,UAAUt+D,GACrC,GAAwB,mBAAbA,EACT,MAAM,IAAIzM,UAAU,oDAEtB,GAAI4qE,GAA4Bn+D,EAASm+D,GAA2B,CAClE,IAAIloE,EACJ,GAAkB,mBADdA,EAAK+J,EAASm+D,IAEhB,MAAM,IAAI5qE,UAAU,iEAKtB,OAHA7B,OAAOC,eAAesE,EAAIkoE,EAA0B,CAClDlsE,MAAOgE,EAAIrE,YAAY,EAAOkC,UAAU,EAAOD,cAAc,IAExDoC,EAGT,SAASA,IAQP,IAPA,IAAIsoE,EAAgBC,EAChB3K,EAAU,IAAI/9D,SAAQ,SAAUR,EAASC,GAC3CgpE,EAAiBjpE,EACjBkpE,EAAgBjpE,KAGdY,EAAO,GACFnF,EAAI,EAAGA,EAAIoF,UAAUzC,OAAQ3C,IACpCmF,EAAK8G,KAAK7G,UAAUpF,IAEtBmF,EAAK8G,MAAK,SAAU3G,EAAKrE,GACnBqE,EACFkoE,EAAcloE,GAEdioE,EAAetsE,MAInB,IACE+N,EAAS3J,MAAMH,KAAMC,GACrB,MAAOG,GACPkoE,EAAcloE,GAGhB,OAAOu9D,EAQT,OALAniE,OAAOyC,eAAe8B,EAAIvE,OAAO0C,eAAe4L,IAE5Cm+D,GAA0BzsE,OAAOC,eAAesE,EAAIkoE,EAA0B,CAChFlsE,MAAOgE,EAAIrE,YAAY,EAAOkC,UAAU,EAAOD,cAAc,IAExDnC,OAAOk5C,iBACZ30C,EACA2kE,EAA0B56D,KAI9BxP,EAAQ8tE,UAAUG,OAASN,EAiD3B3tE,EAAQkuE,YAlCR,SAASA,YAAY1+D,GACnB,GAAwB,mBAAbA,EACT,MAAM,IAAIzM,UAAU,oDAMtB,SAASorE,gBAEP,IADA,IAAIxoE,EAAO,GACFnF,EAAI,EAAGA,EAAIoF,UAAUzC,OAAQ3C,IACpCmF,EAAK8G,KAAK7G,UAAUpF,IAGtB,IAAI4tE,EAAUzoE,EAAKwkB,MACnB,GAAuB,mBAAZikD,EACT,MAAM,IAAIrrE,UAAU,8CAEtB,IAAIyB,EAAOkB,KACPyZ,GAAK,WACP,OAAOivD,EAAQvoE,MAAMrB,EAAMoB,YAI7B4J,EAAS3J,MAAMH,KAAMC,GAClBJ,MAAK,SAASi7B,GAAOlhB,EAAQmB,SAAStB,GAAI,KAAMqhB,MAC3C,SAAS6tC,GAAO/uD,EAAQmB,SAASmtD,sBAAuBS,EAAKlvD,OAMvE,OAHAje,OAAOyC,eAAewqE,cAAejtE,OAAO0C,eAAe4L,IAC3DtO,OAAOk5C,iBAAiB+zB,cACA/D,EAA0B56D,IAC3C2+D,iB,gCC5rBTluE,EAAOD,QAAU,SAASyyB,SAASvtB,GACjC,OAAOA,GAAsB,iBAARA,GACI,mBAAbA,EAAI8mB,MACS,mBAAb9mB,EAAI+1D,MACc,mBAAlB/1D,EAAIy3D,Y,cCJW,mBAAlBz7D,OAAOY,OAEhB7B,EAAOD,QAAU,SAAS82B,SAAS9c,EAAMs0D,GACvCt0D,EAAKu0D,OAASD,EACdt0D,EAAK1X,UAAYpB,OAAOY,OAAOwsE,EAAUhsE,UAAW,CAClD8B,YAAa,CACX3C,MAAOuY,EACP5Y,YAAY,EACZkC,UAAU,EACVD,cAAc,MAMpBpD,EAAOD,QAAU,SAAS82B,SAAS9c,EAAMs0D,GACvCt0D,EAAKu0D,OAASD,EACd,IAAIE,SAAW,aACfA,SAASlsE,UAAYgsE,EAAUhsE,UAC/B0X,EAAK1X,UAAY,IAAIksE,SACrBx0D,EAAK1X,UAAU8B,YAAc4V,I,4MCpBjC,QACA,QACA,QACA,Y,8eAIqBy+B,G,GAyClB,IAAAg2B,+BAA8B,CAAEC,aAAc,I,GAoB9C,IAAAD,+BAA8B,CAAEC,aAAc,I,2FA5D/C,sBAA0B,IAAd3tE,EAAc,uDAAP,MAAO,iDAClBA,EAAM,CAAC,gBAAiB,OAAQ,QAAS,YAAa,gB,uNAI1C2E,KAAKipE,eAAen0D,M,cAAhCA,E,0BACC,IAAAhQ,aAAYgQ,EAAKxU,OAAKgrB,WAAW,K,kSAInBtrB,KAAKipE,eAAeC,Q,cAAnCC,E,yBACCA,EAAOx+D,GAAG,I,2SAII3K,KAAKopE,eAAeC,O,cAAnCC,E,yBACCA,EAAO3+D,GAAG,I,mTAIW/K,QAAQgQ,IAAI,CACtC5P,KAAKkpE,QACLlpE,KAAKupE,4B,4CAFAL,E,KAAOG,E,wBAINH,IAAUG,G,oSAIErpE,KAAKipE,eAAeO,M,cAAlCnH,E,0BACC,IAAAv9D,aAAYu9D,EAAO/hE,OAAKgrB,WAAW,K,yTAGdomB,E,mCAE1BA,EAAU1xC,KAAKrE,IAAI,QAAQ8tE,kB,SAETzpE,KAAKipE,eAAettB,IAAIjK,G,cAAtC2wB,E,0BACC,IAAAv9D,aAAYu9D,EAAO/hE,OAAKgrB,WAAW,K,kMAIhCpY,G,oHAAQw2D,E,yDAAsB/L,E,EAAAA,QAClCgM,GAAY,IAAA7kE,aAAYoO,EAAQ5S,OACjCopE,E,iCAC+B9pE,QAAQgQ,IAAI,CAC5C5P,KAAKkpE,QACLlpE,KAAKrE,IAAI,SACNumE,SAAS5hE,OACTspE,Y,wCAJEV,E,KAAOW,E,MAMVX,E,uBACI,IAAIhjE,MAAM,sD,YAEd2jE,EAAW58D,GAAG08D,G,uBACV,IAAIzjE,MAAM,mD,iCAGblG,KAAKipE,eAAejiE,KAAK2iE,EAAUj+C,QAAQ,OAAQ,CAAEiyC,a,uTAI/B+L,E,yDAAsB/L,QAC9C+L,E,iCACmD9pE,QAAQgQ,IAAI,CAChE5P,KAAK8pE,kBACL9pE,KAAK+pE,iBACL/pE,KAAKgqE,Y,wCAHAF,E,KAAiBG,E,KAAaD,E,MAKjCC,EAAYh9D,GAAG68D,G,uBACX,IAAI5jE,MACR,qE,WAGC8jE,E,uBACG,IAAI9jE,MAAM,iD,iCAGblG,KAAKipE,eAAeiB,Q,6TAINlqE,KAAKrE,IAAI,eAAewuE,c,cAAvCC,E,OACAC,EAAeD,EAAOhlE,KAAI,SAAArC,GAK9B,MAAO,CACLunE,gBALsBvnE,EAAEwnE,OAMxBC,cALoBznE,EAAE0nE,OAMtBv3D,QALa,IAAA5S,KAAIyC,EAAE2nE,YAMnBhD,KALW,IAAI34D,KAAKhM,EAAE4nE,oBAQpBC,EAAqBP,EAAan6C,MAAK,SAACluB,EAAGC,GAE/C,OAAOA,EAAEylE,KAAO1lE,EAAE0lE,Q,kBAEbkD,G,wKAIP,OAAO5qE,KAAKrE,IAAI,iBAAiBukD,kBAAkBzO,S,kDAInD,OAAOzxC,KAAKrE,IAAI,iBAAiBukD,kBAAkBtO,W,YA3Gfmf,mB,mRCsBxCx2D,EAAOD,QA7BP,SAASuwE,0BAA0BttE,EAAQZ,EAAUmuE,EAAYptE,EAAYgjC,GAC3E,IAAI3uB,EAAO,GAyBX,OAxBAvW,OAAO4M,KAAK1K,GAAY+I,SAAQ,SAAUpK,GACxC0V,EAAK1V,GAAOqB,EAAWrB,MAEzB0V,EAAKrW,aAAeqW,EAAKrW,WACzBqW,EAAKpU,eAAiBoU,EAAKpU,cAEvB,UAAWoU,GAAQA,EAAKg5D,eAC1Bh5D,EAAKnU,UAAW,GAGlBmU,EAAO+4D,EAAWlkE,QAAQggB,UAAUkQ,QAAO,SAAU/kB,EAAMi5D,GACzD,OAAOA,EAAUztE,EAAQZ,EAAUoV,IAASA,IAC3CA,GAEC2uB,QAAgC,IAArB3uB,EAAKg5D,cAClBh5D,EAAKhW,MAAQgW,EAAKg5D,YAAch5D,EAAKg5D,YAAY9vE,KAAKylC,QAAW,EACjE3uB,EAAKg5D,iBAAc1qE,QAGI,IAArB0R,EAAKg5D,cACPvvE,OAAOC,eAAe8B,EAAQZ,EAAUoV,GACxCA,EAAO,MAGFA,I,yMCtBT,Y,EA6B2Bg3D,8BAA8B,IAGlD,SAASA,8BAAT,GAAyD,IAAhBC,EAAgB,EAAhBA,aAC9C,OAAO,SAACzrE,EAAQlC,EAAMqC,GACpB,IAAMoM,EAAWpM,EAAW3B,MACtBkvE,EAAoBjC,GAAgBl/D,EAASrM,OAqCnD,OApCAC,EAAW3B,MAAQ,WAAkB,kCAANkE,EAAM,yBAANA,EAAM,gBACnC,IACI2wB,EADE8L,EAAOz8B,EAAKA,EAAKxC,OAAS,GAGd,YAAhB,aAAOi/B,IACE,OAATA,GACAA,EAAKh+B,cAAgBlD,QAErByE,EAAOA,EAAK2G,MAAM,EAAG3G,EAAKxC,OAAS,GACnCmzB,EAAU8L,GAEV9L,EAAU,GAGZ,IAAM+sC,GAAU,6BAAC,yHAGT,EAHS,cAQV/sC,EAAQ+sC,UAAS/sC,EAAQ+sC,QAAUA,GAIlCuN,EAZS,wBAaVjrE,IAbU,cAcV,aAAMgrE,EAAoB,EAAIhrE,EAAKxC,QAAQ,gBAdjC,CAebmzB,IAfa,kBAkBR9mB,EAAS3J,MAAM,EAAM+qE,IAlBb,gDAAD,GAoBhB,OAAOvN,GAEFjgE,G,6BC5EX,IAAImiB,EAAY,EAAQ,IACpBsrD,EAAe,EAAQ,KACvBt2D,EAAY,EAAQ,KASpBu2D,EAAY9oE,KAAKwS,IAuCrBva,EAAOD,QAlBP,SAASqvB,MAAMptB,EAAGqjB,GAEhB,IADArjB,EAAIsY,EAAUtY,IACN,GAAKA,EA7BQ,iBA8BnB,MAAO,GAET,IAAI2P,EA7BiB,WA8BjBzO,EAAS2tE,EAAU7uE,EA9BF,YAgCrBqjB,EAAWurD,EAAavrD,GACxBrjB,GAjCqB,WAoCrB,IADA,IAAI6Q,EAASyS,EAAUpiB,EAAQmiB,KACtB1T,EAAQ3P,GACfqjB,EAAS1T,GAEX,OAAOkB,I,gBC/CT,IAAI6uC,EAAW,EAAQ,KAavB1hD,EAAOD,QAJP,SAAS6wE,aAAapvE,GACpB,MAAuB,mBAATA,EAAsBA,EAAQkgD,I,cCU9C1hD,EAAOD,QAJP,SAAS2hD,SAASlgD,GAChB,OAAOA,I,gBCjBT,IAAI4wB,EAAW,EAAQ,KAyCvBpyB,EAAOD,QAZP,SAAS03B,SAASj2B,GAChB,OAAKA,GAGLA,EAAQ4wB,EAAS5wB,MA9BJ,KA+BaA,KA/Bb,IACG,uBA+BFA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,I,gBC/BjC,IAAIkH,EAAW,EAAQ,IACnBivB,EAAW,EAAQ,KAMnBm5C,EAAS,aAGTC,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAejnE,SA8CnBjK,EAAOD,QArBP,SAASqyB,SAAS5wB,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIm2B,EAASn2B,GACX,OA7CM,IA+CR,GAAIkH,EAASlH,GAAQ,CACnB,IAAIq9C,EAAgC,mBAAjBr9C,EAAMuP,QAAwBvP,EAAMuP,UAAYvP,EACnEA,EAAQkH,EAASm2C,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATr9C,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQA,EAAM6nB,QAAQynD,EAAQ,IAC9B,IAAIK,EAAWH,EAAW74D,KAAK3W,GAC/B,OAAQ2vE,GAAYF,EAAU94D,KAAK3W,GAC/B0vE,EAAa1vE,EAAM6K,MAAM,GAAI8kE,EAAW,EAAI,GAC3CJ,EAAW54D,KAAK3W,GA1Db,KA0D6BA,I,kLC9DvC,QACA,QACA,YACA,YACA,YACA,YAEA,Q,0eADA,IAAM4vE,EAAY7vB,UAAa8vB,MAGV34B,E,qFACnB,wBAA4B,MAAhB53C,EAAgB,uDAAT,QAAS,wCAC1B,cAAMA,EAAM,CAAC,gBAAiB,UACzBwwE,IAAM,GACX,EAAKlsE,KAAO,GACZ,EAAKmsE,OAAS,GACd,EAAKC,cAAgB,GACrB,EAAKC,cAAgB,GANK,E,8FAU1B,OAAIhsE,KAAKisE,QACTjsE,KAAKisE,MAAQjsE,KAAKksE,iBAAiBD,SADZjsE,KAAKisE,Q,sEAKjBE,G,4FACPnsE,KAAK6rE,IAAIM,G,yCAAsBnsE,KAAK6rE,IAAIM,I,cACtCn5B,EAAQhzC,KAAKrE,IAAI,iBAAiBugE,2BACtCiQ,EACAC,W,SAEgBp5B,EAAM64B,M,WAAlBA,E,QACGl/C,W,8CAAmBtsB,G,cAC5BL,KAAK6rE,IAAIM,GAAgB,IAAIp9D,KAAsB,IAAjB88D,EAAIl/C,Y,kBAC/B3sB,KAAK6rE,IAAIM,I,6LAGKA,G,+GACjBnsE,KAAKgsE,cAAcG,G,yCACdnsE,KAAKgsE,cAAcG,I,uBACVnsE,KAAKqsE,OAAOF,G,cAAxBN,E,QACN,aAAOA,EAAP,gBAAqBM,EAArB,4BACMG,EAAetsE,KAAKksE,iBAAiBx6B,QACrC2K,EAAcr8C,KAAKrE,IAAI,QACvB2gD,EAAQD,EAAYpL,QACpBsL,GAAc,IAAAj4C,aAAYg4C,GAC1BiwB,EACJ,MAAO,aAASJ,EAAavoD,QAAQ,MAAO,IAAK,GAAI,K,UAC7By4B,EAAYG,YAAY,CAChDC,UAAWkvB,EAAUjvB,gBAAgBH,GACrCI,QAAS,SACTjL,QAAS46B,EACT1vB,OAAQ,CAAC+uB,EAAU9uB,OAAO2vB,KAAMD,K,6CAJ3BE,E,eAMqBpwB,EAAYqwB,SAASD,EAAUxvB,a,wBAAnDwqB,E,EAAAA,UACRznE,KAAKgsE,cAAcG,GAAgB,IAAIp9D,KAAiB,IAAZ04D,G,kBACrCznE,KAAKgsE,cAAcG,I,+LAGdA,G,2FACRnsE,KAAKL,KAAKwsE,G,yCAAsBnsE,KAAKL,KAAKwsE,I,cACxCn5B,EAAQhzC,KAAKrE,IAAI,iBAAiBugE,2BACtCiQ,EACAC,WAEFpsE,KAAKL,KAAKwsE,GAAgBn5B,EAAMrzC,O,kBACzBK,KAAKL,KAAKwsE,I,uLAGHA,G,2FACVnsE,KAAK8rE,OAAOK,G,yCAAsBnsE,KAAK8rE,OAAOK,I,cAC5Cn5B,EAAQhzC,KAAKrE,IAAI,iBAAiBugE,2BACtCiQ,EACAC,WAEFpsE,KAAK8rE,OAAOK,GAAgBn5B,EAAM84B,S,kBAC3B9rE,KAAK8rE,OAAOK,I,gMAGEA,G,+GACjBnsE,KAAK+rE,cAAcI,G,yCACdnsE,KAAK+rE,cAAcI,I,uBACTnsE,KAAK2sE,QAAQR,G,cAA1BxsE,E,QACN,aAAOA,EAAP,gBAAsBwsE,EAAtB,2BACMG,EAAetsE,KAAKksE,iBAAiBx6B,QACrC2K,EAAcr8C,KAAKrE,IAAI,QACvB2gD,EAAQD,EAAYpL,QACpBsL,GAAc,IAAAj4C,aAAYg4C,GAC1BiwB,EACJ,MAAO,aAASJ,EAAavoD,QAAQ,MAAO,IAAK,GAAI,K,UAC7By4B,EAAYG,YAAY,CAChDC,UAAWkvB,EAAUjvB,gBAAgBH,GACrCI,QAAS,SACTjL,QAAS46B,EACT1vB,OAAQ,CAAC+uB,EAAU9uB,OAAOh5C,KAAM0oE,K,6CAJ3BK,E,eAMqBvwB,EAAYqwB,SAASE,EAAU3vB,a,wBAAnDwqB,E,EAAAA,UACRznE,KAAK+rE,cAAcI,GAAgB,IAAIp9D,KAAiB,IAAZ04D,G,kBACrCznE,KAAK+rE,cAAcI,I,+JAI1BnsE,KAAKisE,MAAQ,KACbjsE,KAAK6rE,IAAM,GACX7rE,KAAKL,KAAO,GACZK,KAAK+rE,cAAgB,GACrB/rE,KAAKgsE,cAAgB,K,sDAIrB,OAAOhsE,KAAKrE,IAAI,iBAAiBukD,kBAAkBhO,a,cArGb4e,iB,muDCT1C,IAAI+b,EAAgB,EAAQ,KACxBr6C,EAAa,EAAQ,KACrB3d,EAAY,EAAQ,KACpB9O,EAAW,EAAQ,KAmCvBxL,EAAOD,QAVP,SAASwyE,SAASr6D,EAAQhV,EAAQsvE,GAChCt6D,EAAS1M,EAAS0M,GAGlB,IAAIu6D,GAFJvvE,EAASoX,EAAUpX,IAEM+0B,EAAW/f,GAAU,EAC9C,OAAQhV,GAAUuvE,EAAYvvE,EACzBovE,EAAcpvE,EAASuvE,EAAWD,GAASt6D,EAC5CA,I,gBCnCN,IAAIw6D,EAAa,EAAQ,KACrB56C,EAAe,EAAQ,KACvB66C,EAAY,EAAQ,KACpB16D,EAAa,EAAQ,IACrBggB,EAAa,EAAQ,KACrB26C,EAAgB,EAAQ,KAGxBC,EAAa9qE,KAAK6D,KAwBtB5L,EAAOD,QAbP,SAASuyE,cAAcpvE,EAAQsvE,GAG7B,IAAIM,GAFJN,OAAkB1sE,IAAV0sE,EAAsB,IAAM16C,EAAa06C,IAEzBtvE,OACxB,GAAI4vE,EAAc,EAChB,OAAOA,EAAcJ,EAAWF,EAAOtvE,GAAUsvE,EAEnD,IAAI3/D,EAAS6/D,EAAWF,EAAOK,EAAW3vE,EAAS+0B,EAAWu6C,KAC9D,OAAOv6D,EAAWu6D,GACdG,EAAUC,EAAc//D,GAAS,EAAG3P,GAAQuJ,KAAK,IACjDoG,EAAOxG,MAAM,EAAGnJ,K,cC5BtB,IAGI6vE,EAAchrE,KAAKiJ,MA8BvBhR,EAAOD,QApBP,SAAS2yE,WAAWx6D,EAAQlW,GAC1B,IAAI6Q,EAAS,GACb,IAAKqF,GAAUlW,EAAI,GAAKA,EAfH,iBAgBnB,OAAO6Q,EAIT,GACM7Q,EAAI,IACN6Q,GAAUqF,IAEZlW,EAAI+wE,EAAY/wE,EAAI,MAElBkW,GAAUA,SAELlW,GAET,OAAO6Q,I,gBC/BT,IAAImgE,EAAY,EAAQ,KAiBxBhzE,EAAOD,QANP,SAAS4yE,UAAUriE,EAAOg3B,EAAOywB,GAC/B,IAAI70D,EAASoN,EAAMpN,OAEnB,OADA60D,OAAcjyD,IAARiyD,EAAoB70D,EAAS60D,GAC1BzwB,GAASywB,GAAO70D,EAAUoN,EAAQ0iE,EAAU1iE,EAAOg3B,EAAOywB,K,cCgBrE/3D,EAAOD,QArBP,SAASizE,UAAU1iE,EAAOg3B,EAAOywB,GAC/B,IAAIpmD,GAAS,EACTzO,EAASoN,EAAMpN,OAEfokC,EAAQ,IACVA,GAASA,EAAQpkC,EAAS,EAAKA,EAASokC,IAE1CywB,EAAMA,EAAM70D,EAASA,EAAS60D,GACpB,IACRA,GAAO70D,GAETA,EAASokC,EAAQywB,EAAM,EAAMA,EAAMzwB,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIz0B,EAASlI,MAAMzH,KACVyO,EAAQzO,GACf2P,EAAOlB,GAASrB,EAAMqB,EAAQ21B,GAEhC,OAAOz0B,I,gBC3BT,IASIklB,EATe,EAAQ,IASXk7C,CAAa,UAE7BjzE,EAAOD,QAAUg4B,G,cCEjB/3B,EAAOD,QANP,SAASkzE,aAAanxE,GACpB,OAAO,SAASK,GACd,OAAiB,MAAVA,OAAiB2D,EAAY3D,EAAOL,M,cCR/C,IAQIoxE,EAAW,oBACXC,EAAU,kDACVC,EAAS,2BAETC,EAAc,qBACdC,EAAa,kCACbC,EAAa,qCAIbC,EAPa,MAAQL,EAAU,IAAMC,EAAS,IAOtB,IAGxBK,EAFW,oBAEQD,GADP,gBAAwB,CAACH,EAAaC,EAAYC,GAAY9mE,KAAK,KAAnE,qBAA2F+mE,EAAW,MAElHE,EAAW,MAAQ,CAACL,EAAcF,EAAU,IAAKA,EAASG,EAAYC,EAAYL,GAAUzmE,KAAK,KAAO,IAGxGknE,EAAY3nE,OAAOonE,EAAS,MAAQA,EAAS,KAAOM,EAAWD,EAAO,KAiB1EzzE,EAAOD,QARP,SAASi4B,YAAY9f,GAEnB,IADA,IAAIrF,EAAS8gE,EAAU/+C,UAAY,EAC5B++C,EAAUx7D,KAAKD,MAClBrF,EAEJ,OAAOA,I,gBCxCT,IAAI+gE,EAAe,EAAQ,KACvB37D,EAAa,EAAQ,IACrB47D,EAAiB,EAAQ,KAe7B7zE,EAAOD,QANP,SAAS6yE,cAAc16D,GACrB,OAAOD,EAAWC,GACd27D,EAAe37D,GACf07D,EAAa17D,K,cCHnBlY,EAAOD,QAJP,SAAS6zE,aAAa17D,GACpB,OAAOA,EAAOnM,MAAM,M,cCPtB,IAQImnE,EAAW,oBACXC,EAAU,kDACVC,EAAS,2BAETC,EAAc,qBACdC,EAAa,kCACbC,EAAa,qCAIbC,EAPa,MAAQL,EAAU,IAAMC,EAAS,IAOtB,IAGxBK,EAFW,oBAEQD,GADP,gBAAwB,CAACH,EAAaC,EAAYC,GAAY9mE,KAAK,KAAnE,qBAA2F+mE,EAAW,MAElHE,EAAW,MAAQ,CAACL,EAAcF,EAAU,IAAKA,EAASG,EAAYC,EAAYL,GAAUzmE,KAAK,KAAO,IAGxGknE,EAAY3nE,OAAOonE,EAAS,MAAQA,EAAS,KAAOM,EAAWD,EAAO,KAa1EzzE,EAAOD,QAJP,SAAS8zE,eAAe37D,GACtB,OAAOA,EAAOwb,MAAMigD,IAAc,K,gBCpCpC,IAAI77C,EAAe,EAAQ,KA2B3B93B,EAAOD,QAJP,SAASyL,SAAShK,GAChB,OAAgB,MAATA,EAAgB,GAAKs2B,EAAat2B,K","file":"index.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"@makerdao/dai-plugin-governance\"] = factory();\n\telse\n\t\troot[\"@makerdao/dai-plugin-governance\"] = factory();\n})(window, function() {\nreturn "," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 109);\n","function _interopRequireDefault(obj) {\n  return obj && obj.__esModule ? obj : {\n    \"default\": obj\n  };\n}\n\nmodule.exports = _interopRequireDefault;","function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}\n\nmodule.exports = _classCallCheck;","function _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, descriptor.key, descriptor);\n  }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  return Constructor;\n}\n\nmodule.exports = _createClass;","function _getPrototypeOf(o) {\n  module.exports = _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  };\n  return _getPrototypeOf(o);\n}\n\nmodule.exports = _getPrototypeOf;","var core = module.exports = { version: '2.6.11' };\nif (typeof __e == 'number') __e = core; // eslint-disable-line no-undef\n","var setPrototypeOf = require(\"./setPrototypeOf\");\n\nfunction _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  if (superClass) setPrototypeOf(subClass, superClass);\n}\n\nmodule.exports = _inherits;","var _typeof = require(\"../helpers/typeof\");\n\nvar assertThisInitialized = require(\"./assertThisInitialized\");\n\nfunction _possibleConstructorReturn(self, call) {\n  if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) {\n    return call;\n  }\n\n  return assertThisInitialized(self);\n}\n\nmodule.exports = _possibleConstructorReturn;","var store = require('./_shared')('wks');\nvar uid = require('./_uid');\nvar Symbol = require('./_global').Symbol;\nvar USE_SYMBOL = typeof Symbol == 'function';\n\nvar $exports = module.exports = function (name) {\n  return store[name] || (store[name] =\n    USE_SYMBOL && Symbol[name] || (USE_SYMBOL ? Symbol : uid)('Symbol.' + name));\n};\n\n$exports.store = store;\n","module.exports = require(\"regenerator-runtime\");\n","function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {\n  try {\n    var info = gen[key](arg);\n    var value = info.value;\n  } catch (error) {\n    reject(error);\n    return;\n  }\n\n  if (info.done) {\n    resolve(value);\n  } else {\n    Promise.resolve(value).then(_next, _throw);\n  }\n}\n\nfunction _asyncToGenerator(fn) {\n  return function () {\n    var self = this,\n        args = arguments;\n    return new Promise(function (resolve, reject) {\n      var gen = fn.apply(self, args);\n\n      function _next(value) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"next\", value);\n      }\n\n      function _throw(err) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"throw\", err);\n      }\n\n      _next(undefined);\n    });\n  };\n}\n\nmodule.exports = _asyncToGenerator;","import { createCurrency } from '@makerdao/currency';\n\nexport const MKR = createCurrency('MKR');\nexport const IOU = createCurrency('IOU');\n\n/* Contracts */\nexport const VOTE_PROXY_FACTORY = 'VOTE_PROXY_FACTORY';\nexport const POLLING = 'POLLING';\nexport const BATCH_POLLING = 'BATCH_POLLING';\nexport const CHIEF = 'CHIEF';\nexport const ESM = 'ESM';\nexport const END = 'END';\nexport const PAUSE = 'PAUSE';\n\n/* Addresses */\nexport const ZERO_ADDRESS = '0x0000000000000000000000000000000000000000';\n\n/* Spock URLs */\nexport const LOCAL_URL = 'http://localhost:3001/v1';\nexport const KOVAN_URL = 'https://staging-gov-db.makerfoundation.com/api/v1';\nexport const STAGING_MAINNET_URL =\n  'https://qa-gov-db.makerfoundation.com/api/v1';\nexport const MAINNET_URL = 'https://gov-db.makerfoundation.com/api/v1';\n","var global = require('./_global');\nvar core = require('./_core');\nvar ctx = require('./_ctx');\nvar hide = require('./_hide');\nvar has = require('./_has');\nvar PROTOTYPE = 'prototype';\n\nvar $export = function (type, name, source) {\n  var IS_FORCED = type & $export.F;\n  var IS_GLOBAL = type & $export.G;\n  var IS_STATIC = type & $export.S;\n  var IS_PROTO = type & $export.P;\n  var IS_BIND = type & $export.B;\n  var IS_WRAP = type & $export.W;\n  var exports = IS_GLOBAL ? core : core[name] || (core[name] = {});\n  var expProto = exports[PROTOTYPE];\n  var target = IS_GLOBAL ? global : IS_STATIC ? global[name] : (global[name] || {})[PROTOTYPE];\n  var key, own, out;\n  if (IS_GLOBAL) source = name;\n  for (key in source) {\n    // contains in native\n    own = !IS_FORCED && target && target[key] !== undefined;\n    if (own && has(exports, key)) continue;\n    // export native or passed\n    out = own ? target[key] : source[key];\n    // prevent global pollution for namespaces\n    exports[key] = IS_GLOBAL && typeof target[key] != 'function' ? source[key]\n    // bind timers to global for call from export context\n    : IS_BIND && own ? ctx(out, global)\n    // wrap global constructors for prevent change them in library\n    : IS_WRAP && target[key] == out ? (function (C) {\n      var F = function (a, b, c) {\n        if (this instanceof C) {\n          switch (arguments.length) {\n            case 0: return new C();\n            case 1: return new C(a);\n            case 2: return new C(a, b);\n          } return new C(a, b, c);\n        } return C.apply(this, arguments);\n      };\n      F[PROTOTYPE] = C[PROTOTYPE];\n      return F;\n    // make static versions for prototype methods\n    })(out) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out;\n    // export proto methods to core.%CONSTRUCTOR%.methods.%NAME%\n    if (IS_PROTO) {\n      (exports.virtual || (exports.virtual = {}))[key] = out;\n      // export proto methods to core.%CONSTRUCTOR%.prototype.%NAME%\n      if (type & $export.R && expProto && !expProto[key]) hide(expProto, key, out);\n    }\n  }\n};\n// type bitmap\n$export.F = 1;   // forced\n$export.G = 2;   // global\n$export.S = 4;   // static\n$export.P = 8;   // proto\n$export.B = 16;  // bind\n$export.W = 32;  // wrap\n$export.U = 64;  // safe\n$export.R = 128; // real proto method for `library`\nmodule.exports = $export;\n","// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\nvar global = module.exports = typeof window != 'undefined' && window.Math == Math\n  ? window : typeof self != 'undefined' && self.Math == Math ? self\n  // eslint-disable-next-line no-new-func\n  : Function('return this')();\nif (typeof __g == 'number') __g = global; // eslint-disable-line no-undef\n","var anObject = require('./_an-object');\nvar IE8_DOM_DEFINE = require('./_ie8-dom-define');\nvar toPrimitive = require('./_to-primitive');\nvar dP = Object.defineProperty;\n\nexports.f = require('./_descriptors') ? Object.defineProperty : function defineProperty(O, P, Attributes) {\n  anObject(O);\n  P = toPrimitive(P, true);\n  anObject(Attributes);\n  if (IE8_DOM_DEFINE) try {\n    return dP(O, P, Attributes);\n  } catch (e) { /* empty */ }\n  if ('get' in Attributes || 'set' in Attributes) throw TypeError('Accessors not supported!');\n  if ('value' in Attributes) O[P] = Attributes.value;\n  return O;\n};\n","// Thank's IE8 for his funny defineProperty\nmodule.exports = !require('./_fails')(function () {\n  return Object.defineProperty({}, 'a', { get: function () { return 7; } }).a != 7;\n});\n","function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    module.exports = _typeof = function _typeof(obj) {\n      return typeof obj;\n    };\n  } else {\n    module.exports = _typeof = function _typeof(obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n  }\n\n  return _typeof(obj);\n}\n\nmodule.exports = _typeof;","var isObject = require('./_is-object');\nmodule.exports = function (it) {\n  if (!isObject(it)) throw TypeError(it + ' is not an object!');\n  return it;\n};\n","var hasOwnProperty = {}.hasOwnProperty;\nmodule.exports = function (it, key) {\n  return hasOwnProperty.call(it, key);\n};\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nObject.defineProperty(exports, \"standardizeConfig\", {\n  enumerable: true,\n  get: function get() {\n    return _standardizeConfig[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"ServiceProvider\", {\n  enumerable: true,\n  get: function get() {\n    return _ServiceProvider[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"Container\", {\n  enumerable: true,\n  get: function get() {\n    return _Container[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"LocalService\", {\n  enumerable: true,\n  get: function get() {\n    return _LocalService[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"PublicService\", {\n  enumerable: true,\n  get: function get() {\n    return _PublicService[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"PrivateService\", {\n  enumerable: true,\n  get: function get() {\n    return _PrivateService[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"ServiceManager\", {\n  enumerable: true,\n  get: function get() {\n    return _ServiceManager[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"StateMachine\", {\n  enumerable: true,\n  get: function get() {\n    return _StateMachine[\"default\"];\n  }\n});\n\nvar _standardizeConfig = _interopRequireDefault(require(\"./standardizeConfig\"));\n\nvar _ServiceProvider = _interopRequireDefault(require(\"./ServiceProvider\"));\n\nvar _Container = _interopRequireDefault(require(\"./Container\"));\n\nvar _LocalService = _interopRequireDefault(require(\"./LocalService\"));\n\nvar _PublicService = _interopRequireDefault(require(\"./PublicService\"));\n\nvar _PrivateService = _interopRequireDefault(require(\"./PrivateService\"));\n\nvar _ServiceManager = _interopRequireDefault(require(\"./ServiceManager\"));\n\nvar _StateMachine = _interopRequireDefault(require(\"./StateMachine\"));","var dP = require('./_object-dp');\nvar createDesc = require('./_property-desc');\nmodule.exports = require('./_descriptors') ? function (object, key, value) {\n  return dP.f(object, key, createDesc(1, value));\n} : function (object, key, value) {\n  object[key] = value;\n  return object;\n};\n","module.exports = function (it) {\n  return typeof it === 'object' ? it !== null : typeof it === 'function';\n};\n","module.exports = function (exec) {\n  try {\n    return !!exec();\n  } catch (e) {\n    return true;\n  }\n};\n","// to indexed object, toObject with fallback for non-array-like ES3 strings\nvar IObject = require('./_iobject');\nvar defined = require('./_defined');\nmodule.exports = function (it) {\n  return IObject(defined(it));\n};\n","var arrayWithHoles = require(\"./arrayWithHoles\");\n\nvar iterableToArrayLimit = require(\"./iterableToArrayLimit\");\n\nvar unsupportedIterableToArray = require(\"./unsupportedIterableToArray\");\n\nvar nonIterableRest = require(\"./nonIterableRest\");\n\nfunction _slicedToArray(arr, i) {\n  return arrayWithHoles(arr) || iterableToArrayLimit(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();\n}\n\nmodule.exports = _slicedToArray;","import { createGetCurrency } from '@makerdao/currency';\nimport BigNumber from 'bignumber.js';\nimport { MKR, STAGING_MAINNET_URL, KOVAN_URL, MAINNET_URL } from './constants';\n\n/**\n * @desc get network name\n * @param  {Number|String} id\n * @return {String}\n */\nexport const netIdToName = id => {\n  switch (parseInt(id, 10)) {\n    case 1:\n      return 'mainnet';\n    case 42:\n      return 'kovan';\n    case 999:\n      return 'ganache';\n    default:\n      return '';\n  }\n};\n\nexport const netIdtoSpockUrl = id => {\n  switch (parseInt(id, 10)) {\n    case 1:\n      return MAINNET_URL;\n    case 42:\n      return KOVAN_URL;\n    default:\n      return STAGING_MAINNET_URL;\n  }\n};\n\nexport const netIdtoSpockUrlStaging = id => {\n  switch (parseInt(id, 10)) {\n    case 1:\n      return STAGING_MAINNET_URL;\n    case 42:\n      return KOVAN_URL;\n    default:\n      return STAGING_MAINNET_URL;\n  }\n};\n\nexport const getCurrency = createGetCurrency({ MKR });\n\nexport const paddedArray = (k, value) =>\n  Array.from({ length: k })\n    .map(() => 0)\n    .concat(...value);\n\nexport const toBuffer = (number, opts) => {\n  let buf;\n  let len;\n  let endian;\n  let hex = new BigNumber(number).toString(16);\n  let size;\n  let hx;\n\n  if (!opts) {\n    opts = {};\n  }\n\n  endian = { 1: 'big', '-1': 'little' }[opts.endian] || opts.endian || 'big';\n\n  if (hex.charAt(0) === '-') {\n    throw new Error('Converting negative numbers to Buffers not supported yet');\n  }\n\n  size = opts.size === 'auto' ? Math.ceil(hex.length / 2) : opts.size || 1;\n\n  len = Math.ceil(hex.length / (2 * size)) * size;\n  buf = Buffer.alloc(len);\n\n  // Zero-pad the hex string so the chunks are all `size` long\n  while (hex.length < 2 * len) {\n    hex = `0${hex}`;\n  }\n\n  hx = hex.split(new RegExp(`(.{${2 * size}})`)).filter(s => s.length > 0);\n\n  hx.forEach((chunk, i) => {\n    for (var j = 0; j < size; j++) {\n      var ix = i * size + (endian === 'big' ? j : size - j - 1);\n      buf[ix] = parseInt(chunk.slice(j * 2, j * 2 + 2), 16);\n    }\n  });\n\n  return buf;\n};\n\nexport const fromBuffer = (buf, opts) => {\n  if (!opts) {\n    opts = {};\n  }\n\n  var endian =\n    { 1: 'big', '-1': 'little' }[opts.endian] || opts.endian || 'big';\n\n  var size = opts.size === 'auto' ? Math.ceil(buf.length) : opts.size || 1;\n\n  if (buf.length % size !== 0) {\n    throw new RangeError(\n      `Buffer length (${buf.length}) must be a multiple of size (${size})`\n    );\n  }\n\n  var hex = [];\n  for (var i = 0; i < buf.length; i += size) {\n    var chunk = [];\n    for (var j = 0; j < size; j++) {\n      chunk.push(buf[i + (endian === 'big' ? j : size - j - 1)]);\n    }\n\n    hex.push(chunk.map(c => (c < 16 ? '0' : '') + c.toString(16)).join(''));\n  }\n\n  return new BigNumber(hex.join(''), 16);\n};\n","function _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n\nmodule.exports = _defineProperty;","module.exports = function (bitmap, value) {\n  return {\n    enumerable: !(bitmap & 1),\n    configurable: !(bitmap & 2),\n    writable: !(bitmap & 4),\n    value: value\n  };\n};\n","// 7.1.13 ToObject(argument)\nvar defined = require('./_defined');\nmodule.exports = function (it) {\n  return Object(defined(it));\n};\n","module.exports = {};\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.serviceTypeTransitions = exports[\"default\"] = void 0;\n\nvar _ServiceState = _interopRequireDefault(require(\"./ServiceState\"));\n\nvar ServiceType = {\n  LOCAL: 'LOCAL',\n  PUBLIC: 'PUBLIC',\n  PRIVATE: 'PRIVATE'\n};\nexports[\"default\"] = ServiceType;\nvar localServiceLifeCycle = {\n  CREATED: [_ServiceState[\"default\"].INITIALIZING],\n  INITIALIZING: [_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].READY],\n  READY: [_ServiceState[\"default\"].ERROR],\n  ERROR: []\n};\nvar publicServiceLifeCycle = {\n  CREATED: [_ServiceState[\"default\"].INITIALIZING],\n  INITIALIZING: [_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].OFFLINE],\n  OFFLINE: [_ServiceState[\"default\"].CONNECTING],\n  CONNECTING: [_ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].READY],\n  READY: [_ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].ERROR],\n  ERROR: []\n};\nvar privateServiceLifeCycle = {\n  CREATED: [_ServiceState[\"default\"].INITIALIZING],\n  INITIALIZING: [_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].OFFLINE],\n  OFFLINE: [_ServiceState[\"default\"].CONNECTING],\n  CONNECTING: [_ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].ONLINE],\n  ONLINE: [_ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].AUTHENTICATING],\n  AUTHENTICATING: [_ServiceState[\"default\"].ONLINE, _ServiceState[\"default\"].READY],\n  READY: [_ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].ONLINE, _ServiceState[\"default\"].ERROR],\n  ERROR: []\n};\nvar serviceTypeTransitions = {\n  LOCAL: localServiceLifeCycle,\n  PUBLIC: publicServiceLifeCycle,\n  PRIVATE: privateServiceLifeCycle\n};\nexports.serviceTypeTransitions = serviceTypeTransitions;","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nmodule.exports = root;\n","// 19.1.2.14 / 15.2.3.14 Object.keys(O)\nvar $keys = require('./_object-keys-internal');\nvar enumBugKeys = require('./_enum-bug-keys');\n\nmodule.exports = Object.keys || function keys(O) {\n  return $keys(O, enumBugKeys);\n};\n","module.exports = true;\n","var id = 0;\nvar px = Math.random();\nmodule.exports = function (key) {\n  return 'Symbol('.concat(key === undefined ? '' : key, ')_', (++id + px).toString(36));\n};\n","exports.f = {}.propertyIsEnumerable;\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _ServiceManager = _interopRequireDefault(require(\"./ServiceManager\"));\n\nvar _ServiceType = _interopRequireDefault(require(\"./ServiceType\"));\n\nvar _ServiceState = _interopRequireDefault(require(\"./ServiceState\"));\n\n/**\n * @param {string} type\n * @private\n */\nfunction _defineLifeCycleMethods(type) {\n  if (typeof this.initialize === 'undefined') {\n    this.initialize = function () {};\n  }\n\n  if (type !== _ServiceType[\"default\"].LOCAL) {\n    if (typeof this.connect === 'undefined') {\n      this.connect = function () {};\n    }\n\n    this.disconnect = function () {};\n  }\n\n  if (type === _ServiceType[\"default\"].PRIVATE) {\n    if (typeof this.authenticate === 'undefined') {\n      this.authenticate = function () {};\n    }\n\n    this.deauthenticate = function () {};\n  }\n}\n/**\n * @param {string} type\n * @param {string} name\n * @param {string[]} dependencies\n * @returns {ServiceManager}\n * @private\n */\n\n\nfunction _buildServiceManager(type, name, dependencies) {\n  var _this = this;\n\n  var connect = type === _ServiceType[\"default\"].LOCAL ? null : function (disconnect) {\n    _this.disconnect = disconnect;\n    return _this.connect();\n  };\n  var auth = type !== _ServiceType[\"default\"].PRIVATE ? null : function (deauthenticate) {\n    _this.deauthenticate = deauthenticate;\n    return _this.authenticate();\n  };\n  return new _ServiceManager[\"default\"](name, dependencies, function (settings) {\n    return _this.initialize(settings);\n  }, connect, auth);\n}\n/**\n * @param {ServiceManager} mgr\n * @private\n */\n\n\nfunction _installLifeCycleHooks(mgr) {\n  var _this2 = this;\n\n  mgr.onInitialized(function () {\n    if (mgr.type() !== _ServiceType[\"default\"].LOCAL) {\n      mgr.dependencies().forEach(function (d) {\n        _this2.get(d).manager().onDisconnected(function () {\n          return _this2.disconnect();\n        });\n      });\n    }\n\n    if (mgr.type() === _ServiceType[\"default\"].PRIVATE) {\n      mgr.dependencies().forEach(function (d) {\n        _this2.get(d).manager().onDeauthenticated(function () {\n          return _this2.deauthenticate();\n        });\n      });\n    }\n  });\n}\n/**\n * @private\n */\n\n\nfunction _guardLifeCycleMethods() {\n  var original = {\n    initialize: this.initialize,\n    connect: this.connect,\n    authenticate: this.authenticate\n  };\n\n  this.initialize = function (settings) {\n    if (this.manager().state() !== _ServiceState[\"default\"].INITIALIZING) {\n      throw new Error('Expected state INITIALIZING, but got ' + this.manager().state() + '. Did you mean to call service.manager().initialize() instead of service.initialize()?');\n    }\n\n    return original.initialize.apply(this, [settings]);\n  };\n\n  if (typeof original.connect !== 'undefined') {\n    this.connect = function () {\n      if (this.manager().state() !== _ServiceState[\"default\"].CONNECTING) {\n        throw new Error('Expected state CONNECTING, but got ' + this.manager().state() + '. Did you mean to call service.manager().connect() instead of service.connect()?');\n      }\n\n      return original.connect.apply(this);\n    };\n  }\n\n  if (typeof original.authenticate !== 'undefined') {\n    this.authenticate = function () {\n      if (this.manager().state() !== _ServiceState[\"default\"].AUTHENTICATING) {\n        throw new Error('Expected state AUTHENTICATING, but got ' + this.manager().state() + '. Did you mean to call service.manager().authenticate() instead of service.authenticate()?');\n      }\n\n      return original.authenticate.apply(this);\n    };\n  }\n}\n\nvar ServiceBase = /*#__PURE__*/function () {\n  /**\n   * @param {string} type\n   * @param {string} name\n   * @param {string[]} dependencies\n   */\n  function ServiceBase(type, name) {\n    var dependencies = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];\n    (0, _classCallCheck2[\"default\"])(this, ServiceBase);\n    if (!name) name = this.constructor.role;\n\n    if (this.constructor.dependencies) {\n      dependencies = this.constructor.dependencies;\n    }\n\n    if (typeof _ServiceType[\"default\"][type] === 'undefined') {\n      throw new Error('Invalid ServiceType: ' + type);\n    }\n\n    _defineLifeCycleMethods.call(this, type);\n\n    this._serviceManager = _buildServiceManager.call(this, type, name, dependencies);\n\n    _installLifeCycleHooks.call(this, this._serviceManager);\n\n    _guardLifeCycleMethods.call(this);\n  }\n  /**\n   * @returns {ServiceManager}\n   */\n\n\n  (0, _createClass2[\"default\"])(ServiceBase, [{\n    key: \"manager\",\n    value: function manager() {\n      return this._serviceManager;\n    }\n    /**\n     * @param {string} dependency\n     * @returns {ServiceBase}\n     */\n\n  }, {\n    key: \"get\",\n    value: function get(dependency) {\n      return this._serviceManager.dependency(dependency);\n    }\n  }]);\n  return ServiceBase;\n}();\n\nvar _default = ServiceBase;\nexports[\"default\"] = _default;","var getNative = require('./_getNative');\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nmodule.exports = nativeCreate;\n","var Symbol = require('./_Symbol'),\n    getRawTag = require('./_getRawTag'),\n    objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n","var eq = require('./eq');\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = assocIndexOf;\n","var isKeyable = require('./_isKeyable');\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nmodule.exports = getMapData;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","// optional / simple context binding\nvar aFunction = require('./_a-function');\nmodule.exports = function (fn, that, length) {\n  aFunction(fn);\n  if (that === undefined) return fn;\n  switch (length) {\n    case 1: return function (a) {\n      return fn.call(that, a);\n    };\n    case 2: return function (a, b) {\n      return fn.call(that, a, b);\n    };\n    case 3: return function (a, b, c) {\n      return fn.call(that, a, b, c);\n    };\n  }\n  return function (/* ...args */) {\n    return fn.apply(that, arguments);\n  };\n};\n","// 7.1.1 ToPrimitive(input [, PreferredType])\nvar isObject = require('./_is-object');\n// instead of the ES6 spec version, we didn't implement @@toPrimitive case\n// and the second argument - flag - preferred type is a string\nmodule.exports = function (it, S) {\n  if (!isObject(it)) return it;\n  var fn, val;\n  if (S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it))) return val;\n  if (typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it))) return val;\n  if (!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it))) return val;\n  throw TypeError(\"Can't convert object to primitive value\");\n};\n","var toString = {}.toString;\n\nmodule.exports = function (it) {\n  return toString.call(it).slice(8, -1);\n};\n","// 7.2.1 RequireObjectCoercible(argument)\nmodule.exports = function (it) {\n  if (it == undefined) throw TypeError(\"Can't call method on  \" + it);\n  return it;\n};\n","// 7.1.4 ToInteger\nvar ceil = Math.ceil;\nvar floor = Math.floor;\nmodule.exports = function (it) {\n  return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it);\n};\n","var shared = require('./_shared')('keys');\nvar uid = require('./_uid');\nmodule.exports = function (key) {\n  return shared[key] || (shared[key] = uid(key));\n};\n","var core = require('./_core');\nvar global = require('./_global');\nvar SHARED = '__core-js_shared__';\nvar store = global[SHARED] || (global[SHARED] = {});\n\n(module.exports = function (key, value) {\n  return store[key] || (store[key] = value !== undefined ? value : {});\n})('versions', []).push({\n  version: core.version,\n  mode: require('./_library') ? 'pure' : 'global',\n  copyright: '© 2019 Denis Pushkarev (zloirock.ru)'\n});\n","// IE 8- don't enum bug keys\nmodule.exports = (\n  'constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf'\n).split(',');\n","exports.f = Object.getOwnPropertySymbols;\n","'use strict';\nvar $at = require('./_string-at')(true);\n\n// 21.1.3.27 String.prototype[@@iterator]()\nrequire('./_iter-define')(String, 'String', function (iterated) {\n  this._t = String(iterated); // target\n  this._i = 0;                // next index\n// 21.1.5.2.1 %StringIteratorPrototype%.next()\n}, function () {\n  var O = this._t;\n  var index = this._i;\n  var point;\n  if (index >= O.length) return { value: undefined, done: true };\n  point = $at(O, index);\n  this._i += point.length;\n  return { value: point, done: false };\n});\n","// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\nvar anObject = require('./_an-object');\nvar dPs = require('./_object-dps');\nvar enumBugKeys = require('./_enum-bug-keys');\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\nvar Empty = function () { /* empty */ };\nvar PROTOTYPE = 'prototype';\n\n// Create object with fake `null` prototype: use iframe Object with cleared prototype\nvar createDict = function () {\n  // Thrash, waste and sodomy: IE GC bug\n  var iframe = require('./_dom-create')('iframe');\n  var i = enumBugKeys.length;\n  var lt = '<';\n  var gt = '>';\n  var iframeDocument;\n  iframe.style.display = 'none';\n  require('./_html').appendChild(iframe);\n  iframe.src = 'javascript:'; // eslint-disable-line no-script-url\n  // createDict = iframe.contentWindow.Object;\n  // html.removeChild(iframe);\n  iframeDocument = iframe.contentWindow.document;\n  iframeDocument.open();\n  iframeDocument.write(lt + 'script' + gt + 'document.F=Object' + lt + '/script' + gt);\n  iframeDocument.close();\n  createDict = iframeDocument.F;\n  while (i--) delete createDict[PROTOTYPE][enumBugKeys[i]];\n  return createDict();\n};\n\nmodule.exports = Object.create || function create(O, Properties) {\n  var result;\n  if (O !== null) {\n    Empty[PROTOTYPE] = anObject(O);\n    result = new Empty();\n    Empty[PROTOTYPE] = null;\n    // add \"__proto__\" for Object.getPrototypeOf polyfill\n    result[IE_PROTO] = O;\n  } else result = createDict();\n  return Properties === undefined ? result : dPs(result, Properties);\n};\n","var def = require('./_object-dp').f;\nvar has = require('./_has');\nvar TAG = require('./_wks')('toStringTag');\n\nmodule.exports = function (it, tag, stat) {\n  if (it && !has(it = stat ? it : it.prototype, TAG)) def(it, TAG, { configurable: true, value: tag });\n};\n","exports.f = require('./_wks');\n","var global = require('./_global');\nvar core = require('./_core');\nvar LIBRARY = require('./_library');\nvar wksExt = require('./_wks-ext');\nvar defineProperty = require('./_object-dp').f;\nmodule.exports = function (name) {\n  var $Symbol = core.Symbol || (core.Symbol = LIBRARY ? {} : global.Symbol || {});\n  if (name.charAt(0) != '_' && !(name in $Symbol)) defineProperty($Symbol, name, { value: wksExt.f(name) });\n};\n","function _setPrototypeOf(o, p) {\n  module.exports = _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n\n  return _setPrototypeOf(o, p);\n}\n\nmodule.exports = _setPrototypeOf;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.DependencyNotResolvedError = exports.UnknownDependencyError = exports.InvalidServiceError = exports[\"default\"] = void 0;\n\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\n\nvar _get2 = _interopRequireDefault(require(\"@babel/runtime/helpers/get\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _wrapNativeSuper2 = _interopRequireDefault(require(\"@babel/runtime/helpers/wrapNativeSuper\"));\n\nvar _ServiceManagerBase2 = _interopRequireDefault(require(\"./ServiceManagerBase\"));\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\n/**\n *\n */\nvar InvalidServiceError = /*#__PURE__*/function (_Error) {\n  (0, _inherits2[\"default\"])(InvalidServiceError, _Error);\n\n  var _super = _createSuper(InvalidServiceError);\n\n  function InvalidServiceError(message) {\n    (0, _classCallCheck2[\"default\"])(this, InvalidServiceError);\n    return _super.call(this, message);\n  }\n\n  return InvalidServiceError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n/**\n *\n */\n\n\nexports.InvalidServiceError = InvalidServiceError;\n\nvar UnknownDependencyError = /*#__PURE__*/function (_Error2) {\n  (0, _inherits2[\"default\"])(UnknownDependencyError, _Error2);\n\n  var _super2 = _createSuper(UnknownDependencyError);\n\n  function UnknownDependencyError(service, dependency) {\n    (0, _classCallCheck2[\"default\"])(this, UnknownDependencyError);\n    return _super2.call(this, 'Injected service ' + dependency + ' is not a dependency of ' + service);\n  }\n\n  return UnknownDependencyError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n/**\n *\n */\n\n\nexports.UnknownDependencyError = UnknownDependencyError;\n\nvar DependencyNotResolvedError = /*#__PURE__*/function (_Error3) {\n  (0, _inherits2[\"default\"])(DependencyNotResolvedError, _Error3);\n\n  var _super3 = _createSuper(DependencyNotResolvedError);\n\n  function DependencyNotResolvedError(service, dependency) {\n    (0, _classCallCheck2[\"default\"])(this, DependencyNotResolvedError);\n    return _super3.call(this, 'Dependency ' + dependency + ' of service ' + service + ' is unavailable.');\n  }\n\n  return DependencyNotResolvedError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n/**\n * @param callback\n * @returns {Promise}\n * @private\n */\n\n\nexports.DependencyNotResolvedError = DependencyNotResolvedError;\n\nfunction _waitForDependencies(callback) {\n  return Promise.all(this.dependencies().map(function (dependency) {\n    return callback(dependency);\n  }));\n}\n/**\n *\n */\n\n\nvar ServiceManager = /*#__PURE__*/function (_ServiceManagerBase) {\n  (0, _inherits2[\"default\"])(ServiceManager, _ServiceManagerBase);\n\n  var _super4 = _createSuper(ServiceManager);\n\n  (0, _createClass2[\"default\"])(ServiceManager, null, [{\n    key: \"isValidService\",\n\n    /**\n     * @param {*} service\n     * @returns {boolean}\n     */\n    value: function isValidService(service) {\n      return service !== null && (0, _typeof2[\"default\"])(service) === 'object' && typeof service.manager === 'function';\n    }\n    /**\n     * @param {string} name\n     * @param {string[]} dependencies\n     * @param {function|null} init\n     * @param {function|null} connect\n     * @param {function|null} auth\n     */\n\n  }]);\n\n  function ServiceManager(name) {\n    var _this;\n\n    var dependencies = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n    var init = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;\n    var connect = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : null;\n    var auth = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : null;\n    (0, _classCallCheck2[\"default\"])(this, ServiceManager);\n    _this = _super4.call(this, init, connect, auth);\n\n    if (!name) {\n      throw new Error('Service name must not be empty.');\n    }\n\n    _this._name = name;\n    _this._dependencies = dependencies;\n    _this._injections = {};\n    dependencies.forEach(function (d) {\n      return _this._injections[d] = null;\n    });\n    return _this;\n  }\n\n  (0, _createClass2[\"default\"])(ServiceManager, [{\n    key: \"name\",\n    value: function name() {\n      return this._name;\n    }\n  }, {\n    key: \"dependencies\",\n    value: function dependencies() {\n      return this._dependencies;\n    }\n  }, {\n    key: \"inject\",\n    value: function inject(dependency, service) {\n      if (typeof this._injections[dependency] === 'undefined') {\n        throw new UnknownDependencyError(this.name(), dependency);\n      }\n\n      if (!ServiceManager.isValidService(service)) {\n        throw new InvalidServiceError('Cannot inject invalid service in ' + this.name());\n      }\n\n      this._injections[dependency] = service;\n      return this;\n    }\n  }, {\n    key: \"dependency\",\n    value: function dependency(name) {\n      if (!this._injections[name]) {\n        throw new DependencyNotResolvedError(this.name(), name);\n      }\n\n      return this._injections[name];\n    }\n  }, {\n    key: \"initialize\",\n    value: function initialize() {\n      var _this2 = this;\n\n      return this.initializeDependencies().then(function () {\n        return (0, _get2[\"default\"])((0, _getPrototypeOf2[\"default\"])(ServiceManager.prototype), \"initialize\", _this2).call(_this2, _this2._settings);\n      });\n    }\n  }, {\n    key: \"connect\",\n    value: function connect() {\n      var _this3 = this;\n\n      return this.connectDependencies().then(function () {\n        return (0, _get2[\"default\"])((0, _getPrototypeOf2[\"default\"])(ServiceManager.prototype), \"connect\", _this3).call(_this3);\n      });\n    }\n  }, {\n    key: \"authenticate\",\n    value: function authenticate() {\n      var _this4 = this;\n\n      return this.authenticateDependencies().then(function () {\n        return (0, _get2[\"default\"])((0, _getPrototypeOf2[\"default\"])(ServiceManager.prototype), \"authenticate\", _this4).call(_this4);\n      });\n    }\n  }, {\n    key: \"initializeDependencies\",\n    value: function initializeDependencies() {\n      var _this5 = this;\n\n      return _waitForDependencies.call(this, function (d) {\n        return _this5.dependency(d).manager().initialize();\n      });\n    }\n  }, {\n    key: \"connectDependencies\",\n    value: function connectDependencies() {\n      var _this6 = this;\n\n      return _waitForDependencies.call(this, function (d) {\n        return _this6.dependency(d).manager().connect();\n      });\n    }\n  }, {\n    key: \"authenticateDependencies\",\n    value: function authenticateDependencies() {\n      var _this7 = this;\n\n      return _waitForDependencies.call(this, function (d) {\n        return _this7.dependency(d).manager().authenticate();\n      });\n    }\n  }, {\n    key: \"createService\",\n    value: function createService() {\n      var _this8 = this;\n\n      return {\n        manager: function manager() {\n          return _this8;\n        }\n      };\n    }\n  }]);\n  return ServiceManager;\n}(_ServiceManagerBase2[\"default\"]);\n\nexports[\"default\"] = ServiceManager;","var getPrototypeOf = require(\"./getPrototypeOf\");\n\nvar setPrototypeOf = require(\"./setPrototypeOf\");\n\nvar isNativeFunction = require(\"./isNativeFunction\");\n\nvar construct = require(\"./construct\");\n\nfunction _wrapNativeSuper(Class) {\n  var _cache = typeof Map === \"function\" ? new Map() : undefined;\n\n  module.exports = _wrapNativeSuper = function _wrapNativeSuper(Class) {\n    if (Class === null || !isNativeFunction(Class)) return Class;\n\n    if (typeof Class !== \"function\") {\n      throw new TypeError(\"Super expression must either be null or a function\");\n    }\n\n    if (typeof _cache !== \"undefined\") {\n      if (_cache.has(Class)) return _cache.get(Class);\n\n      _cache.set(Class, Wrapper);\n    }\n\n    function Wrapper() {\n      return construct(Class, arguments, getPrototypeOf(this).constructor);\n    }\n\n    Wrapper.prototype = Object.create(Class.prototype, {\n      constructor: {\n        value: Wrapper,\n        enumerable: false,\n        writable: true,\n        configurable: true\n      }\n    });\n    return setPrototypeOf(Wrapper, Class);\n  };\n\n  return _wrapNativeSuper(Class);\n}\n\nmodule.exports = _wrapNativeSuper;","var _typeof = require(\"../helpers/typeof\");\n\nfunction _getRequireWildcardCache() {\n  if (typeof WeakMap !== \"function\") return null;\n  var cache = new WeakMap();\n\n  _getRequireWildcardCache = function _getRequireWildcardCache() {\n    return cache;\n  };\n\n  return cache;\n}\n\nfunction _interopRequireWildcard(obj) {\n  if (obj && obj.__esModule) {\n    return obj;\n  }\n\n  if (obj === null || _typeof(obj) !== \"object\" && typeof obj !== \"function\") {\n    return {\n      \"default\": obj\n    };\n  }\n\n  var cache = _getRequireWildcardCache();\n\n  if (cache && cache.has(obj)) {\n    return cache.get(obj);\n  }\n\n  var newObj = {};\n  var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor;\n\n  for (var key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null;\n\n      if (desc && (desc.get || desc.set)) {\n        Object.defineProperty(newObj, key, desc);\n      } else {\n        newObj[key] = obj[key];\n      }\n    }\n  }\n\n  newObj[\"default\"] = obj;\n\n  if (cache) {\n    cache.set(obj, newObj);\n  }\n\n  return newObj;\n}\n\nmodule.exports = _interopRequireWildcard;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\nvar ServiceState = {\n  CREATED: 'CREATED',\n  INITIALIZING: 'INITIALIZING',\n  OFFLINE: 'OFFLINE',\n  CONNECTING: 'CONNECTING',\n  ONLINE: 'ONLINE',\n  AUTHENTICATING: 'AUTHENTICATING',\n  READY: 'READY',\n  ERROR: 'ERROR'\n};\nvar _default = ServiceState;\nexports[\"default\"] = _default;","var baseIsNative = require('./_baseIsNative'),\n    getValue = require('./_getValue');\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n","var arrayWithoutHoles = require(\"./arrayWithoutHoles\");\n\nvar iterableToArray = require(\"./iterableToArray\");\n\nvar unsupportedIterableToArray = require(\"./unsupportedIterableToArray\");\n\nvar nonIterableSpread = require(\"./nonIterableSpread\");\n\nfunction _toConsumableArray(arr) {\n  return arrayWithoutHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableSpread();\n}\n\nmodule.exports = _toConsumableArray;","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsZWJ = '\\\\u200d';\n\n/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n/**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\nfunction hasUnicode(string) {\n  return reHasUnicode.test(string);\n}\n\nmodule.exports = hasUnicode;\n","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createGetCurrency = exports.Currency = undefined;\n\nvar _assign = require('babel-runtime/core-js/object/assign');\n\nvar _assign2 = _interopRequireDefault(_assign);\n\nvar _getPrototypeOf = require('babel-runtime/core-js/object/get-prototype-of');\n\nvar _getPrototypeOf2 = _interopRequireDefault(_getPrototypeOf);\n\nvar _classCallCheck2 = require('babel-runtime/helpers/classCallCheck');\n\nvar _classCallCheck3 = _interopRequireDefault(_classCallCheck2);\n\nvar _possibleConstructorReturn2 = require('babel-runtime/helpers/possibleConstructorReturn');\n\nvar _possibleConstructorReturn3 = _interopRequireDefault(_possibleConstructorReturn2);\n\nvar _inherits2 = require('babel-runtime/helpers/inherits');\n\nvar _inherits3 = _interopRequireDefault(_inherits2);\n\nexports.createCurrency = createCurrency;\nexports.createCurrencyRatio = createCurrencyRatio;\n\nvar _Currency2 = require('./Currency');\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar Currency = exports.Currency = _Currency2.Currency;\n\nfunction createCurrency(symbol) {\n  // This provides short syntax, e.g. ETH(6). We need a wrapper function because\n  // you can't call an ES6 class consructor without `new`\n  var creatorFn = function creatorFn(amount, shift) {\n    return new CurrencyX(amount, shift);\n  };\n\n  var CurrencyX = function (_Currency) {\n    (0, _inherits3.default)(CurrencyX, _Currency);\n\n    function CurrencyX(amount, shift) {\n      (0, _classCallCheck3.default)(this, CurrencyX);\n\n      var _this = (0, _possibleConstructorReturn3.default)(this, (CurrencyX.__proto__ || (0, _getPrototypeOf2.default)(CurrencyX)).call(this, amount, shift));\n\n      _this.symbol = symbol;\n\n      // this.type can be used an alternative to `this.constructor` when you\n      // want to use the short syntax, e.g.:\n      //\n      //   var foo = ETH(1);\n      //   var bar = foo.type(2);\n      //   assert(foo.plus(bar).eq(ETH(3)));\n      //\n      _this.type = creatorFn;\n      return _this;\n    }\n\n    return CurrencyX;\n  }(Currency);\n\n  // this changes the name of the class in stack traces\n\n\n  Object.defineProperty(CurrencyX, 'name', { value: symbol });\n  Object.defineProperty(CurrencyX, 'symbol', { value: symbol });\n\n  (0, _assign2.default)(creatorFn, {\n    wei: makeShiftedCreatorFn(creatorFn, symbol, 'wei'),\n    ray: makeShiftedCreatorFn(creatorFn, symbol, 'ray'),\n    rad: makeShiftedCreatorFn(creatorFn, symbol, 'rad'),\n    symbol: symbol,\n    isInstance: function isInstance(obj) {\n      return obj instanceof CurrencyX;\n    }\n  });\n\n  (0, _assign2.default)(CurrencyX, { wei: creatorFn.wei, ray: creatorFn.ray });\n  return creatorFn;\n}\n\nfunction createCurrencyRatio(wrappedNumerator, wrappedDenominator) {\n  var numerator = wrappedNumerator(0).constructor;\n  var denominator = wrappedDenominator(0).constructor;\n\n  var creatorFn = function creatorFn(amount, shift) {\n    return new _Currency2.CurrencyRatio(amount, numerator, denominator, shift);\n  };\n\n  var symbol = numerator.symbol + '/' + denominator.symbol;\n\n  (0, _assign2.default)(creatorFn, {\n    wei: makeShiftedCreatorFn(creatorFn, symbol, 'wei'),\n    ray: makeShiftedCreatorFn(creatorFn, symbol, 'ray'),\n    rad: makeShiftedCreatorFn(creatorFn, symbol, 'rad'),\n    symbol: symbol,\n    isInstance: function isInstance(obj) {\n      return obj instanceof _Currency2.CurrencyRatio && obj.symbol === symbol;\n    }\n  });\n\n  return creatorFn;\n}\n\nfunction makeShiftedCreatorFn(creatorFn, symbol, shift) {\n  var fn = function fn(amount) {\n    return creatorFn(amount, shift);\n  };\n  // these two properties are used by getCurrency\n  fn.symbol = symbol;\n  fn.shift = shift;\n  return fn;\n}\n\n/*\nthis factory function produces a function that will check input values against a\nwhitelist; it's useful if you want to accept a variety of inputs, e.g.:\n\n  foo(ETH(1))\n  foo(1, ETH)\n  foo(1)      // if you set a default unit argument\n  foo('1')    // if you set a default unit argument\n*/\nvar createGetCurrency = exports.createGetCurrency = function createGetCurrency(currencies) {\n  return function (amount, unit) {\n    if (amount instanceof Currency) return amount;\n    if (!unit) throw new Error('Amount is not a Currency');\n    var key = typeof unit === 'string' ? unit.toUpperCase() : unit.symbol;\n    var ctor = currencies[key];\n    if (!ctor) {\n      throw new Error('Couldn\\'t find currency for \"' + key + '\"');\n    }\n    return ctor(amount, unit.shift);\n  };\n};","module.exports = { \"default\": require(\"core-js/library/fn/object/assign\"), __esModule: true };","module.exports = !require('./_descriptors') && !require('./_fails')(function () {\n  return Object.defineProperty(require('./_dom-create')('div'), 'a', { get: function () { return 7; } }).a != 7;\n});\n","var isObject = require('./_is-object');\nvar document = require('./_global').document;\n// typeof document.createElement is 'object' in old IE\nvar is = isObject(document) && isObject(document.createElement);\nmodule.exports = function (it) {\n  return is ? document.createElement(it) : {};\n};\n","var has = require('./_has');\nvar toIObject = require('./_to-iobject');\nvar arrayIndexOf = require('./_array-includes')(false);\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\n\nmodule.exports = function (object, names) {\n  var O = toIObject(object);\n  var i = 0;\n  var result = [];\n  var key;\n  for (key in O) if (key != IE_PROTO) has(O, key) && result.push(key);\n  // Don't enum bug & hidden keys\n  while (names.length > i) if (has(O, key = names[i++])) {\n    ~arrayIndexOf(result, key) || result.push(key);\n  }\n  return result;\n};\n","// fallback for non-array-like ES3 and non-enumerable old V8 strings\nvar cof = require('./_cof');\n// eslint-disable-next-line no-prototype-builtins\nmodule.exports = Object('z').propertyIsEnumerable(0) ? Object : function (it) {\n  return cof(it) == 'String' ? it.split('') : Object(it);\n};\n","// 7.1.15 ToLength\nvar toInteger = require('./_to-integer');\nvar min = Math.min;\nmodule.exports = function (it) {\n  return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991\n};\n","module.exports = { \"default\": require(\"core-js/library/fn/object/get-prototype-of\"), __esModule: true };","// 19.1.2.9 / 15.2.3.2 Object.getPrototypeOf(O)\nvar has = require('./_has');\nvar toObject = require('./_to-object');\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\nvar ObjectProto = Object.prototype;\n\nmodule.exports = Object.getPrototypeOf || function (O) {\n  O = toObject(O);\n  if (has(O, IE_PROTO)) return O[IE_PROTO];\n  if (typeof O.constructor == 'function' && O instanceof O.constructor) {\n    return O.constructor.prototype;\n  } return O instanceof Object ? ObjectProto : null;\n};\n","\"use strict\";\n\nexports.__esModule = true;\n\nexports.default = function (instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n};","\"use strict\";\n\nexports.__esModule = true;\n\nvar _typeof2 = require(\"../helpers/typeof\");\n\nvar _typeof3 = _interopRequireDefault(_typeof2);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.default = function (self, call) {\n  if (!self) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n\n  return call && ((typeof call === \"undefined\" ? \"undefined\" : (0, _typeof3.default)(call)) === \"object\" || typeof call === \"function\") ? call : self;\n};","\"use strict\";\n\nexports.__esModule = true;\n\nvar _iterator = require(\"../core-js/symbol/iterator\");\n\nvar _iterator2 = _interopRequireDefault(_iterator);\n\nvar _symbol = require(\"../core-js/symbol\");\n\nvar _symbol2 = _interopRequireDefault(_symbol);\n\nvar _typeof = typeof _symbol2.default === \"function\" && typeof _iterator2.default === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof _symbol2.default === \"function\" && obj.constructor === _symbol2.default && obj !== _symbol2.default.prototype ? \"symbol\" : typeof obj; };\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.default = typeof _symbol2.default === \"function\" && _typeof(_iterator2.default) === \"symbol\" ? function (obj) {\n  return typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj);\n} : function (obj) {\n  return obj && typeof _symbol2.default === \"function\" && obj.constructor === _symbol2.default && obj !== _symbol2.default.prototype ? \"symbol\" : typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj);\n};","'use strict';\nvar LIBRARY = require('./_library');\nvar $export = require('./_export');\nvar redefine = require('./_redefine');\nvar hide = require('./_hide');\nvar Iterators = require('./_iterators');\nvar $iterCreate = require('./_iter-create');\nvar setToStringTag = require('./_set-to-string-tag');\nvar getPrototypeOf = require('./_object-gpo');\nvar ITERATOR = require('./_wks')('iterator');\nvar BUGGY = !([].keys && 'next' in [].keys()); // Safari has buggy iterators w/o `next`\nvar FF_ITERATOR = '@@iterator';\nvar KEYS = 'keys';\nvar VALUES = 'values';\n\nvar returnThis = function () { return this; };\n\nmodule.exports = function (Base, NAME, Constructor, next, DEFAULT, IS_SET, FORCED) {\n  $iterCreate(Constructor, NAME, next);\n  var getMethod = function (kind) {\n    if (!BUGGY && kind in proto) return proto[kind];\n    switch (kind) {\n      case KEYS: return function keys() { return new Constructor(this, kind); };\n      case VALUES: return function values() { return new Constructor(this, kind); };\n    } return function entries() { return new Constructor(this, kind); };\n  };\n  var TAG = NAME + ' Iterator';\n  var DEF_VALUES = DEFAULT == VALUES;\n  var VALUES_BUG = false;\n  var proto = Base.prototype;\n  var $native = proto[ITERATOR] || proto[FF_ITERATOR] || DEFAULT && proto[DEFAULT];\n  var $default = $native || getMethod(DEFAULT);\n  var $entries = DEFAULT ? !DEF_VALUES ? $default : getMethod('entries') : undefined;\n  var $anyNative = NAME == 'Array' ? proto.entries || $native : $native;\n  var methods, key, IteratorPrototype;\n  // Fix native\n  if ($anyNative) {\n    IteratorPrototype = getPrototypeOf($anyNative.call(new Base()));\n    if (IteratorPrototype !== Object.prototype && IteratorPrototype.next) {\n      // Set @@toStringTag to native iterators\n      setToStringTag(IteratorPrototype, TAG, true);\n      // fix for some old engines\n      if (!LIBRARY && typeof IteratorPrototype[ITERATOR] != 'function') hide(IteratorPrototype, ITERATOR, returnThis);\n    }\n  }\n  // fix Array#{values, @@iterator}.name in V8 / FF\n  if (DEF_VALUES && $native && $native.name !== VALUES) {\n    VALUES_BUG = true;\n    $default = function values() { return $native.call(this); };\n  }\n  // Define iterator\n  if ((!LIBRARY || FORCED) && (BUGGY || VALUES_BUG || !proto[ITERATOR])) {\n    hide(proto, ITERATOR, $default);\n  }\n  // Plug for library\n  Iterators[NAME] = $default;\n  Iterators[TAG] = returnThis;\n  if (DEFAULT) {\n    methods = {\n      values: DEF_VALUES ? $default : getMethod(VALUES),\n      keys: IS_SET ? $default : getMethod(KEYS),\n      entries: $entries\n    };\n    if (FORCED) for (key in methods) {\n      if (!(key in proto)) redefine(proto, key, methods[key]);\n    } else $export($export.P + $export.F * (BUGGY || VALUES_BUG), NAME, methods);\n  }\n  return methods;\n};\n","module.exports = require('./_hide');\n","require('./es6.array.iterator');\nvar global = require('./_global');\nvar hide = require('./_hide');\nvar Iterators = require('./_iterators');\nvar TO_STRING_TAG = require('./_wks')('toStringTag');\n\nvar DOMIterables = ('CSSRuleList,CSSStyleDeclaration,CSSValueList,ClientRectList,DOMRectList,DOMStringList,' +\n  'DOMTokenList,DataTransferItemList,FileList,HTMLAllCollection,HTMLCollection,HTMLFormElement,HTMLSelectElement,' +\n  'MediaList,MimeTypeArray,NamedNodeMap,NodeList,PaintRequestList,Plugin,PluginArray,SVGLengthList,SVGNumberList,' +\n  'SVGPathSegList,SVGPointList,SVGStringList,SVGTransformList,SourceBufferList,StyleSheetList,TextTrackCueList,' +\n  'TextTrackList,TouchList').split(',');\n\nfor (var i = 0; i < DOMIterables.length; i++) {\n  var NAME = DOMIterables[i];\n  var Collection = global[NAME];\n  var proto = Collection && Collection.prototype;\n  if (proto && !proto[TO_STRING_TAG]) hide(proto, TO_STRING_TAG, NAME);\n  Iterators[NAME] = Iterators.Array;\n}\n","// 19.1.2.7 / 15.2.3.4 Object.getOwnPropertyNames(O)\nvar $keys = require('./_object-keys-internal');\nvar hiddenKeys = require('./_enum-bug-keys').concat('length', 'prototype');\n\nexports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\n  return $keys(O, hiddenKeys);\n};\n","var pIE = require('./_object-pie');\nvar createDesc = require('./_property-desc');\nvar toIObject = require('./_to-iobject');\nvar toPrimitive = require('./_to-primitive');\nvar has = require('./_has');\nvar IE8_DOM_DEFINE = require('./_ie8-dom-define');\nvar gOPD = Object.getOwnPropertyDescriptor;\n\nexports.f = require('./_descriptors') ? gOPD : function getOwnPropertyDescriptor(O, P) {\n  O = toIObject(O);\n  P = toPrimitive(P, true);\n  if (IE8_DOM_DEFINE) try {\n    return gOPD(O, P);\n  } catch (e) { /* empty */ }\n  if (has(O, P)) return createDesc(!pIE.f.call(O, P), O[P]);\n};\n","\"use strict\";\n\nexports.__esModule = true;\n\nvar _setPrototypeOf = require(\"../core-js/object/set-prototype-of\");\n\nvar _setPrototypeOf2 = _interopRequireDefault(_setPrototypeOf);\n\nvar _create = require(\"../core-js/object/create\");\n\nvar _create2 = _interopRequireDefault(_create);\n\nvar _typeof2 = require(\"../helpers/typeof\");\n\nvar _typeof3 = _interopRequireDefault(_typeof2);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.default = function (subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function, not \" + (typeof superClass === \"undefined\" ? \"undefined\" : (0, _typeof3.default)(superClass)));\n  }\n\n  subClass.prototype = (0, _create2.default)(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      enumerable: false,\n      writable: true,\n      configurable: true\n    }\n  });\n  if (superClass) _setPrototypeOf2.default ? (0, _setPrototypeOf2.default)(subClass, superClass) : subClass.__proto__ = superClass;\n};","var classof = require('./_classof');\nvar ITERATOR = require('./_wks')('iterator');\nvar Iterators = require('./_iterators');\nmodule.exports = require('./_core').getIteratorMethod = function (it) {\n  if (it != undefined) return it[ITERATOR]\n    || it['@@iterator']\n    || Iterators[classof(it)];\n};\n","var arrayLikeToArray = require(\"./arrayLikeToArray\");\n\nfunction _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);\n}\n\nmodule.exports = _unsupportedIterableToArray;","function _arrayLikeToArray(arr, len) {\n  if (len == null || len > arr.length) len = arr.length;\n\n  for (var i = 0, arr2 = new Array(len); i < len; i++) {\n    arr2[i] = arr[i];\n  }\n\n  return arr2;\n}\n\nmodule.exports = _arrayLikeToArray;","function _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n\n  return self;\n}\n\nmodule.exports = _assertThisInitialized;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = standardizeConfig;\n\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\n\nvar _ServiceBase = _interopRequireDefault(require(\"./ServiceBase\"));\n\nfunction standardizeConfig(role, config, resolver) {\n  if (config instanceof Array) {\n    if (typeof config[0] == 'boolean' && resolver) {\n      return [resolveNameForBoolean(role, config[0], resolver), config[1]];\n    }\n\n    return config;\n  }\n\n  var className,\n      settings = {};\n\n  switch ((0, _typeof2[\"default\"])(config)) {\n    case 'string':\n      // handle a string that refers to a class name\n      className = config;\n      break;\n\n    case 'function':\n      // handle a service constructor\n      className = config;\n      break;\n\n    case 'object':\n      if (config instanceof _ServiceBase[\"default\"]) {\n        // handle a service instance\n        className = config;\n      } else {\n        // handle a settings object -- use the default version\n        className = resolver ? resolveNameForBoolean(role, true, resolver) : true;\n        settings = config;\n      }\n\n      break;\n\n    case 'boolean':\n      className = resolver ? resolveNameForBoolean(role, config, resolver) : config;\n      break;\n\n    default:\n      throw new Error(\"could not parse settings for \".concat(role, \":\"), config);\n  }\n\n  return [className, settings];\n}\n\nfunction resolveNameForBoolean(role, bool, _ref) {\n  var defaults = _ref.defaults,\n      disabled = _ref.disabled;\n  var name;\n\n  if (bool) {\n    name = defaults[role];\n    if (!name) throw new Error(\"The \\\"\".concat(role, \"\\\" service has no default\"));\n  } else {\n    name = disabled[role];\n    if (!name) throw new Error(\"The \\\"\".concat(role, \"\\\" service cannot be disabled\"));\n  }\n\n  return name;\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = exports.IllegalStateError = void 0;\n\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _wrapNativeSuper2 = _interopRequireDefault(require(\"@babel/runtime/helpers/wrapNativeSuper\"));\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nvar IllegalStateError = /*#__PURE__*/function (_Error) {\n  (0, _inherits2[\"default\"])(IllegalStateError, _Error);\n\n  var _super = _createSuper(IllegalStateError);\n\n  function IllegalStateError() {\n    (0, _classCallCheck2[\"default\"])(this, IllegalStateError);\n    return _super.apply(this, arguments);\n  }\n\n  return IllegalStateError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n\nexports.IllegalStateError = IllegalStateError;\n\nvar StateMachine = /*#__PURE__*/function () {\n  function StateMachine(initialState, transitions) {\n    (0, _classCallCheck2[\"default\"])(this, StateMachine);\n\n    if ((0, _typeof2[\"default\"])(transitions) !== 'object') {\n      throw new Error('StateMachine transitions parameter must be an object.');\n    }\n\n    if (Object.keys(transitions).filter(function (k) {\n      return transitions.hasOwnProperty(k) && !(transitions[k] instanceof Array);\n    }).length > 0) {\n      throw new Error('Illegal StateMachine transition found: not an array.');\n    }\n\n    if (Object.keys(transitions).filter(function (k) {\n      return transitions.hasOwnProperty(k) && transitions[k].filter(function (s) {\n        return !transitions[s];\n      }).length > 0;\n    }).length > 0) {\n      throw new Error('Illegal StateMachine transition found: target state not in transition map.');\n    }\n\n    if (!(transitions[initialState] instanceof Array)) {\n      throw new Error('Initial state ' + initialState + ' is not set in the transitions map.');\n    }\n\n    this._state = initialState;\n    this._nextStates = transitions;\n    this._stateChangedHandlers = [];\n  }\n\n  (0, _createClass2[\"default\"])(StateMachine, [{\n    key: \"onStateChanged\",\n    value: function onStateChanged(callback) {\n      this._stateChangedHandlers.push(callback);\n    }\n  }, {\n    key: \"state\",\n    value: function state() {\n      return this._state;\n    }\n  }, {\n    key: \"inState\",\n    value: function inState(state) {\n      if (!(state instanceof Array)) {\n        state = [state];\n      }\n\n      return state.indexOf(this._state) >= 0;\n    }\n  }, {\n    key: \"assertState\",\n    value: function assertState(state) {\n      var operation = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';\n\n      if (!this.inState(state)) {\n        throw new IllegalStateError('Illegal operation for state ' + this._state + (operation.length > 0 ? ': ' + operation : ''));\n      }\n    }\n  }, {\n    key: \"transitionTo\",\n    value: function transitionTo(newState) {\n      if (this._nextStates[newState] === undefined) {\n        throw new IllegalStateError('Cannot set illegal state: ' + newState);\n      }\n\n      if (newState !== this._state) {\n        if (this._nextStates[this._state].indexOf(newState) < 0) {\n          throw new IllegalStateError('Illegal state transition: ' + this._state + ' to ' + newState);\n        }\n\n        var oldState = this._state;\n        this._state = newState;\n\n        this._stateChangedHandlers.forEach(function (cb) {\n          return cb(oldState, newState);\n        });\n      }\n\n      return this;\n    }\n  }]);\n  return StateMachine;\n}();\n\nexports[\"default\"] = StateMachine;","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","var baseUniq = require('./_baseUniq');\n\n/**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\nfunction uniq(array) {\n  return (array && array.length) ? baseUniq(array) : [];\n}\n\nmodule.exports = uniq;\n","var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nmodule.exports = setToArray;\n","\"use strict\";\n\nvar _interopRequireWildcard = require(\"@babel/runtime/helpers/interopRequireWildcard\");\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.orderServices = orderServices;\nObject.defineProperty(exports, \"InvalidServiceError\", {\n  enumerable: true,\n  get: function get() {\n    return _ServiceManager.InvalidServiceError;\n  }\n});\nexports.ServiceNotFoundError = exports.ServiceAlreadyRegisteredError = exports.ExtractedServiceError = exports[\"default\"] = void 0;\n\nvar _regenerator = _interopRequireDefault(require(\"@babel/runtime/regenerator\"));\n\nvar _asyncToGenerator2 = _interopRequireDefault(require(\"@babel/runtime/helpers/asyncToGenerator\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _wrapNativeSuper2 = _interopRequireDefault(require(\"@babel/runtime/helpers/wrapNativeSuper\"));\n\nvar _values = _interopRequireDefault(require(\"lodash/values\"));\n\nvar _uniq = _interopRequireDefault(require(\"lodash/uniq\"));\n\nvar _ServiceManager = _interopRequireWildcard(require(\"./ServiceManager\"));\n\nvar _toposort = _interopRequireDefault(require(\"toposort\"));\n\nfunction _createForOfIteratorHelper(o) { if (typeof Symbol === \"undefined\" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (o = _unsupportedIterableToArray(o))) { var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var it, normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\n\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\n\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nvar ServiceAlreadyRegisteredError = /*#__PURE__*/function (_Error) {\n  (0, _inherits2[\"default\"])(ServiceAlreadyRegisteredError, _Error);\n\n  var _super = _createSuper(ServiceAlreadyRegisteredError);\n\n  function ServiceAlreadyRegisteredError(name) {\n    (0, _classCallCheck2[\"default\"])(this, ServiceAlreadyRegisteredError);\n    // prettier-ignore\n    return _super.call(this, 'Service with name \\'' + name + '\\' is already registered with this container.');\n  }\n\n  return ServiceAlreadyRegisteredError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n\nexports.ServiceAlreadyRegisteredError = ServiceAlreadyRegisteredError;\n\nvar ServiceNotFoundError = /*#__PURE__*/function (_Error2) {\n  (0, _inherits2[\"default\"])(ServiceNotFoundError, _Error2);\n\n  var _super2 = _createSuper(ServiceNotFoundError);\n\n  function ServiceNotFoundError(name) {\n    (0, _classCallCheck2[\"default\"])(this, ServiceNotFoundError);\n    // prettier-ignore\n    return _super2.call(this, 'Service with name \\'' + name + '\\' cannot be found in this container.');\n  }\n\n  return ServiceNotFoundError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n\nexports.ServiceNotFoundError = ServiceNotFoundError;\n\nvar ExtractedServiceError = /*#__PURE__*/function (_Error3) {\n  (0, _inherits2[\"default\"])(ExtractedServiceError, _Error3);\n\n  var _super3 = _createSuper(ExtractedServiceError);\n\n  function ExtractedServiceError(name) {\n    (0, _classCallCheck2[\"default\"])(this, ExtractedServiceError);\n    // prettier-ignore\n    return _super3.call(this, 'Service with name \\'' + name + '\\' has been extracted from the core dai.js library into a discrete plugin. Please refer to the documentation here to install and add it to your configuration: \\n\\n https://github.com/makerdao/dai.js/wiki/Basic-Usage-(Plugins) \\n\\n');\n  }\n\n  return ExtractedServiceError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error)); // exported just for testing\n\n\nexports.ExtractedServiceError = ExtractedServiceError;\n\nfunction orderServices(services) {\n  var edges = [];\n  var servicesWithoutDeps = [];\n\n  var _iterator = _createForOfIteratorHelper(services),\n      _step;\n\n  try {\n    var _loop = function _loop() {\n      var service = _step.value;\n      var name = service.manager().name();\n      var depNames = service.manager().dependencies();\n\n      if (depNames.length === 0) {\n        servicesWithoutDeps.push(name);\n      } else {\n        depNames.forEach(function (dn) {\n          return edges.push([dn, name]);\n        });\n      }\n    };\n\n    for (_iterator.s(); !(_step = _iterator.n()).done;) {\n      _loop();\n    }\n  } catch (err) {\n    _iterator.e(err);\n  } finally {\n    _iterator.f();\n  }\n\n  return (0, _uniq[\"default\"])((0, _toposort[\"default\"])(edges).concat(servicesWithoutDeps));\n}\n\nvar Container = /*#__PURE__*/function () {\n  function Container() {\n    (0, _classCallCheck2[\"default\"])(this, Container);\n    this._services = {};\n    this.isAuthenticated = false;\n  }\n\n  (0, _createClass2[\"default\"])(Container, [{\n    key: \"register\",\n    value: function register(service) {\n      var name = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n\n      if (!_ServiceManager[\"default\"].isValidService(service)) {\n        throw new _ServiceManager.InvalidServiceError('Service must be an object with manager() method returning a valid ServiceManager');\n      }\n\n      name = name || service.manager().name();\n      var s = this.service(name, false);\n\n      if (s !== undefined && s !== service) {\n        throw new ServiceAlreadyRegisteredError(name);\n      }\n\n      this._services[name] = service;\n      return this;\n    }\n  }, {\n    key: \"service\",\n    value: function service(name) {\n      var throwIfMissing = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;\n      var extractedServices = ['exchange'];\n\n      if (!name) {\n        throw new Error('Provide a service name.');\n      }\n\n      if (!this._services[name] && throwIfMissing && extractedServices.includes(name)) {\n        throw new ExtractedServiceError(name);\n      }\n\n      if (!this._services[name] && throwIfMissing) {\n        throw new ServiceNotFoundError(name);\n      }\n\n      return this._services[name];\n    }\n  }, {\n    key: \"getRegisteredServiceNames\",\n    value: function getRegisteredServiceNames() {\n      return Object.keys(this._services);\n    }\n  }, {\n    key: \"injectDependencies\",\n    value: function injectDependencies() {\n      var services = (0, _values[\"default\"])(this._services);\n\n      var _iterator2 = _createForOfIteratorHelper(services),\n          _step2;\n\n      try {\n        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {\n          var service = _step2.value;\n          var manager = service.manager();\n\n          var _iterator3 = _createForOfIteratorHelper(manager.dependencies()),\n              _step3;\n\n          try {\n            for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {\n              var name = _step3.value;\n              var dep = this._services[name];\n              if (!dep) throw new ServiceNotFoundError(name);\n              manager.inject(name, this._services[name]);\n            }\n          } catch (err) {\n            _iterator3.e(err);\n          } finally {\n            _iterator3.f();\n          }\n        }\n      } catch (err) {\n        _iterator2.e(err);\n      } finally {\n        _iterator2.f();\n      }\n    }\n  }, {\n    key: \"initialize\",\n    value: function initialize() {\n      return this._waitForServices(function (s) {\n        return s.manager().initialize();\n      });\n    }\n  }, {\n    key: \"connect\",\n    value: function connect() {\n      return this._waitForServices(function (s) {\n        return s.manager().connect();\n      });\n    }\n  }, {\n    key: \"authenticate\",\n    value: function authenticate() {\n      var _this = this;\n\n      return this._waitForServices(function (s) {\n        return s.manager().authenticate();\n      }).then(function () {\n        _this.isAuthenticated = true;\n      });\n    }\n  }, {\n    key: \"_waitForServices\",\n    value: function () {\n      var _waitForServices2 = (0, _asyncToGenerator2[\"default\"])( /*#__PURE__*/_regenerator[\"default\"].mark(function _callee(callback) {\n        var _iterator4, _step4, name, service;\n\n        return _regenerator[\"default\"].wrap(function _callee$(_context) {\n          while (1) {\n            switch (_context.prev = _context.next) {\n              case 0:\n                if (!this._orderedServiceNames) {\n                  this._orderedServiceNames = orderServices((0, _values[\"default\"])(this._services));\n                }\n\n                _iterator4 = _createForOfIteratorHelper(this._orderedServiceNames);\n                _context.prev = 2;\n\n                _iterator4.s();\n\n              case 4:\n                if ((_step4 = _iterator4.n()).done) {\n                  _context.next = 13;\n                  break;\n                }\n\n                name = _step4.value;\n                service = this._services[name];\n\n                if (service) {\n                  _context.next = 9;\n                  break;\n                }\n\n                throw new Error(\"No service for \".concat(name));\n\n              case 9:\n                _context.next = 11;\n                return callback(this._services[name]);\n\n              case 11:\n                _context.next = 4;\n                break;\n\n              case 13:\n                _context.next = 18;\n                break;\n\n              case 15:\n                _context.prev = 15;\n                _context.t0 = _context[\"catch\"](2);\n\n                _iterator4.e(_context.t0);\n\n              case 18:\n                _context.prev = 18;\n\n                _iterator4.f();\n\n                return _context.finish(18);\n\n              case 21:\n              case \"end\":\n                return _context.stop();\n            }\n          }\n        }, _callee, this, [[2, 15, 18, 21]]);\n      }));\n\n      function _waitForServices(_x) {\n        return _waitForServices2.apply(this, arguments);\n      }\n\n      return _waitForServices;\n    }()\n  }]);\n  return Container;\n}();\n\nexports[\"default\"] = Container;","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nmodule.exports = arrayMap;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n","module.exports = function(module) {\n\tif (!module.webpackPolyfill) {\n\t\tmodule.deprecate = function() {};\n\t\tmodule.paths = [];\n\t\t// module.parent = undefined by default\n\t\tif (!module.children) module.children = [];\n\t\tObject.defineProperty(module, \"loaded\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.l;\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(module, \"id\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.i;\n\t\t\t}\n\t\t});\n\t\tmodule.webpackPolyfill = 1;\n\t}\n\treturn module;\n};\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nmodule.exports = isLength;\n",";(function (globalObject) {\r\n  'use strict';\r\n\r\n/*\r\n *      bignumber.js v7.2.1\r\n *      A JavaScript library for arbitrary-precision arithmetic.\r\n *      https://github.com/MikeMcl/bignumber.js\r\n *      Copyright (c) 2018 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *      MIT Licensed.\r\n *\r\n *      BigNumber.prototype methods     |  BigNumber methods\r\n *                                      |\r\n *      absoluteValue            abs    |  clone\r\n *      comparedTo                      |  config               set\r\n *      decimalPlaces            dp     |      DECIMAL_PLACES\r\n *      dividedBy                div    |      ROUNDING_MODE\r\n *      dividedToIntegerBy       idiv   |      EXPONENTIAL_AT\r\n *      exponentiatedBy          pow    |      RANGE\r\n *      integerValue                    |      CRYPTO\r\n *      isEqualTo                eq     |      MODULO_MODE\r\n *      isFinite                        |      POW_PRECISION\r\n *      isGreaterThan            gt     |      FORMAT\r\n *      isGreaterThanOrEqualTo   gte    |      ALPHABET\r\n *      isInteger                       |  isBigNumber\r\n *      isLessThan               lt     |  maximum              max\r\n *      isLessThanOrEqualTo      lte    |  minimum              min\r\n *      isNaN                           |  random\r\n *      isNegative                      |\r\n *      isPositive                      |\r\n *      isZero                          |\r\n *      minus                           |\r\n *      modulo                   mod    |\r\n *      multipliedBy             times  |\r\n *      negated                         |\r\n *      plus                            |\r\n *      precision                sd     |\r\n *      shiftedBy                       |\r\n *      squareRoot               sqrt   |\r\n *      toExponential                   |\r\n *      toFixed                         |\r\n *      toFormat                        |\r\n *      toFraction                      |\r\n *      toJSON                          |\r\n *      toNumber                        |\r\n *      toPrecision                     |\r\n *      toString                        |\r\n *      valueOf                         |\r\n *\r\n */\r\n\r\n\r\n  var BigNumber,\r\n    isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n\r\n    mathceil = Math.ceil,\r\n    mathfloor = Math.floor,\r\n\r\n    bignumberError = '[BigNumber Error] ',\r\n    tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n    BASE = 1e14,\r\n    LOG_BASE = 14,\r\n    MAX_SAFE_INTEGER = 0x1fffffffffffff,         // 2^53 - 1\r\n    // MAX_INT32 = 0x7fffffff,                   // 2^31 - 1\r\n    POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n    SQRT_BASE = 1e7,\r\n\r\n    // EDITABLE\r\n    // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n    // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n    MAX = 1E9;                                   // 0 to MAX_INT32\r\n\r\n\r\n  /*\r\n   * Create and return a BigNumber constructor.\r\n   */\r\n  function clone(configObject) {\r\n    var div, convertBase, parseNumeric,\r\n      P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n      ONE = new BigNumber(1),\r\n\r\n\r\n      //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n      // The default values below must be integers within the inclusive ranges stated.\r\n      // The values can also be changed at run-time using BigNumber.set.\r\n\r\n      // The maximum number of decimal places for operations involving division.\r\n      DECIMAL_PLACES = 20,                     // 0 to MAX\r\n\r\n      // The rounding mode used when rounding to the above decimal places, and when using\r\n      // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n      // UP         0 Away from zero.\r\n      // DOWN       1 Towards zero.\r\n      // CEIL       2 Towards +Infinity.\r\n      // FLOOR      3 Towards -Infinity.\r\n      // HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      ROUNDING_MODE = 4,                       // 0 to 8\r\n\r\n      // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n      // The exponent value at and beneath which toString returns exponential notation.\r\n      // Number type: -7\r\n      TO_EXP_NEG = -7,                         // 0 to -MAX\r\n\r\n      // The exponent value at and above which toString returns exponential notation.\r\n      // Number type: 21\r\n      TO_EXP_POS = 21,                         // 0 to MAX\r\n\r\n      // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // Number type: -324  (5e-324)\r\n      MIN_EXP = -1e7,                          // -1 to -MAX\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // Number type:  308  (1.7976931348623157e+308)\r\n      // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n      MAX_EXP = 1e7,                           // 1 to MAX\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      CRYPTO = false,                          // true or false\r\n\r\n      // The modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP        0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN      1 The remainder has the same sign as the dividend.\r\n      //             This modulo mode is commonly known as 'truncated division' and is\r\n      //             equivalent to (a % n) in JavaScript.\r\n      // FLOOR     3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n      // EUCLID    9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n      //             The remainder is always positive.\r\n      //\r\n      // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n      // modes are commonly used for the modulus operation.\r\n      // Although the other rounding modes can also be used, they may not give useful results.\r\n      MODULO_MODE = 1,                         // 0 to 9\r\n\r\n      // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n      // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n      POW_PRECISION = 0,                    // 0 to MAX\r\n\r\n      // The format specification used by the BigNumber.prototype.toFormat method.\r\n      FORMAT = {\r\n        decimalSeparator: '.',\r\n        groupSeparator: ',',\r\n        groupSize: 3,\r\n        secondaryGroupSize: 0,\r\n        fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n        fractionGroupSize: 0\r\n      },\r\n\r\n      // The alphabet used for base conversion.\r\n      // It must be at least 2 characters long, with no '.' or repeated character.\r\n      // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n      ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz';\r\n\r\n\r\n    //------------------------------------------------------------------------------------------\r\n\r\n\r\n    // CONSTRUCTOR\r\n\r\n\r\n    /*\r\n     * The BigNumber constructor and exported function.\r\n     * Create and return a new instance of a BigNumber object.\r\n     *\r\n     * n {number|string|BigNumber} A numeric value.\r\n     * [b] {number} The base of n. Integer, 2 to ALPHABET.length inclusive.\r\n     */\r\n    function BigNumber(n, b) {\r\n      var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n        x = this;\r\n\r\n      // Enable constructor usage without new.\r\n      if (!(x instanceof BigNumber)) {\r\n\r\n        // Don't throw on constructor call without new (#81).\r\n        // '[BigNumber Error] Constructor call without new: {n}'\r\n        //throw Error(bignumberError + ' Constructor call without new: ' + n);\r\n        return new BigNumber(n, b);\r\n      }\r\n\r\n      if (b == null) {\r\n\r\n        // Duplicate.\r\n        if (n instanceof BigNumber) {\r\n          x.s = n.s;\r\n          x.e = n.e;\r\n          x.c = (n = n.c) ? n.slice() : n;\r\n          return;\r\n        }\r\n\r\n        isNum = typeof n == 'number';\r\n\r\n        if (isNum && n * 0 == 0) {\r\n\r\n          // Use `1 / n` to handle minus zero also.\r\n          x.s = 1 / n < 0 ? (n = -n, -1) : 1;\r\n\r\n          // Faster path for integers.\r\n          if (n === ~~n) {\r\n            for (e = 0, i = n; i >= 10; i /= 10, e++);\r\n            x.e = e;\r\n            x.c = [n];\r\n            return;\r\n          }\r\n\r\n          str = n + '';\r\n        } else {\r\n          if (!isNumeric.test(str = n + '')) return parseNumeric(x, str, isNum);\r\n          x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n        // Exponential form?\r\n        if ((i = str.search(/e/i)) > 0) {\r\n\r\n          // Determine exponent.\r\n          if (e < 0) e = i;\r\n          e += +str.slice(i + 1);\r\n          str = str.substring(0, i);\r\n        } else if (e < 0) {\r\n\r\n          // Integer.\r\n          e = str.length;\r\n        }\r\n\r\n      } else {\r\n\r\n        // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n        intCheck(b, 2, ALPHABET.length, 'Base');\r\n        str = n + '';\r\n\r\n        // Allow exponential notation to be used with base 10 argument, while\r\n        // also rounding to DECIMAL_PLACES as with other bases.\r\n        if (b == 10) {\r\n          x = new BigNumber(n instanceof BigNumber ? n : str);\r\n          return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n        }\r\n\r\n        isNum = typeof n == 'number';\r\n\r\n        if (isNum) {\r\n\r\n          // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n          if (n * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n          x.s = 1 / n < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n          // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n          if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n            throw Error\r\n             (tooManyDigits + n);\r\n          }\r\n\r\n          // Prevent later check for length on converted number.\r\n          isNum = false;\r\n        } else {\r\n          x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        alphabet = ALPHABET.slice(0, b);\r\n        e = i = 0;\r\n\r\n        // Check that str is a valid base b number.\r\n        // Don't use RegExp so alphabet can contain special characters.\r\n        for (len = str.length; i < len; i++) {\r\n          if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n            if (c == '.') {\r\n\r\n              // If '.' is not the first character and it has not be found before.\r\n              if (i > e) {\r\n                e = len;\r\n                continue;\r\n              }\r\n            } else if (!caseChanged) {\r\n\r\n              // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n              if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n                  str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n                caseChanged = true;\r\n                i = -1;\r\n                e = 0;\r\n                continue;\r\n              }\r\n            }\r\n\r\n            return parseNumeric(x, n + '', isNum, b);\r\n          }\r\n        }\r\n\r\n        str = convertBase(str, b, 10, x.s);\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n        else e = str.length;\r\n      }\r\n\r\n      // Determine leading zeros.\r\n      for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n      // Determine trailing zeros.\r\n      for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n      str = str.slice(i, ++len);\r\n\r\n      if (str) {\r\n        len -= i;\r\n\r\n        // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n        if (isNum && BigNumber.DEBUG &&\r\n          len > 15 && (n > MAX_SAFE_INTEGER || n !== mathfloor(n))) {\r\n            throw Error\r\n             (tooManyDigits + (x.s * n));\r\n        }\r\n\r\n        e = e - i - 1;\r\n\r\n         // Overflow?\r\n        if (e > MAX_EXP) {\r\n\r\n          // Infinity.\r\n          x.c = x.e = null;\r\n\r\n        // Underflow?\r\n        } else if (e < MIN_EXP) {\r\n\r\n          // Zero.\r\n          x.c = [x.e = 0];\r\n        } else {\r\n          x.e = e;\r\n          x.c = [];\r\n\r\n          // Transform base\r\n\r\n          // e is the base 10 exponent.\r\n          // i is where to slice str to get the first element of the coefficient array.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (e < 0) i += LOG_BASE;\r\n\r\n          if (i < len) {\r\n            if (i) x.c.push(+str.slice(0, i));\r\n\r\n            for (len -= LOG_BASE; i < len;) {\r\n              x.c.push(+str.slice(i, i += LOG_BASE));\r\n            }\r\n\r\n            str = str.slice(i);\r\n            i = LOG_BASE - str.length;\r\n          } else {\r\n            i -= len;\r\n          }\r\n\r\n          for (; i--; str += '0');\r\n          x.c.push(+str);\r\n        }\r\n      } else {\r\n\r\n        // Zero.\r\n        x.c = [x.e = 0];\r\n      }\r\n    }\r\n\r\n\r\n    // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n    BigNumber.clone = clone;\r\n\r\n    BigNumber.ROUND_UP = 0;\r\n    BigNumber.ROUND_DOWN = 1;\r\n    BigNumber.ROUND_CEIL = 2;\r\n    BigNumber.ROUND_FLOOR = 3;\r\n    BigNumber.ROUND_HALF_UP = 4;\r\n    BigNumber.ROUND_HALF_DOWN = 5;\r\n    BigNumber.ROUND_HALF_EVEN = 6;\r\n    BigNumber.ROUND_HALF_CEIL = 7;\r\n    BigNumber.ROUND_HALF_FLOOR = 8;\r\n    BigNumber.EUCLID = 9;\r\n\r\n\r\n    /*\r\n     * Configure infrequently-changing library-wide settings.\r\n     *\r\n     * Accept an object with the following optional properties (if the value of a property is\r\n     * a number, it must be an integer within the inclusive range stated):\r\n     *\r\n     *   DECIMAL_PLACES   {number}           0 to MAX\r\n     *   ROUNDING_MODE    {number}           0 to 8\r\n     *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]\r\n     *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]\r\n     *   CRYPTO           {boolean}          true or false\r\n     *   MODULO_MODE      {number}           0 to 9\r\n     *   POW_PRECISION       {number}           0 to MAX\r\n     *   ALPHABET         {string}           A string of two or more unique characters which does\r\n     *                                       not contain '.'.\r\n     *   FORMAT           {object}           An object with some of the following properties:\r\n     *      decimalSeparator       {string}\r\n     *      groupSeparator         {string}\r\n     *      groupSize              {number}\r\n     *      secondaryGroupSize     {number}\r\n     *      fractionGroupSeparator {string}\r\n     *      fractionGroupSize      {number}\r\n     *\r\n     * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n     *\r\n     * E.g.\r\n     * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n     *\r\n     * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n     *\r\n     * Return an object with the properties current values.\r\n     */\r\n    BigNumber.config = BigNumber.set = function (obj) {\r\n      var p, v;\r\n\r\n      if (obj != null) {\r\n\r\n        if (typeof obj == 'object') {\r\n\r\n          // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            DECIMAL_PLACES = v;\r\n          }\r\n\r\n          // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n          // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 8, p);\r\n            ROUNDING_MODE = v;\r\n          }\r\n\r\n          // EXPONENTIAL_AT {number|number[]}\r\n          // Integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n          // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n            v = obj[p];\r\n            if (isArray(v)) {\r\n              intCheck(v[0], -MAX, 0, p);\r\n              intCheck(v[1], 0, MAX, p);\r\n              TO_EXP_NEG = v[0];\r\n              TO_EXP_POS = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n            }\r\n          }\r\n\r\n          // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n          // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n          if (obj.hasOwnProperty(p = 'RANGE')) {\r\n            v = obj[p];\r\n            if (isArray(v)) {\r\n              intCheck(v[0], -MAX, -1, p);\r\n              intCheck(v[1], 1, MAX, p);\r\n              MIN_EXP = v[0];\r\n              MAX_EXP = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              if (v) {\r\n                MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n              } else {\r\n                throw Error\r\n                 (bignumberError + p + ' cannot be zero: ' + v);\r\n              }\r\n            }\r\n          }\r\n\r\n          // CRYPTO {boolean} true or false.\r\n          // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n          // '[BigNumber Error] crypto unavailable'\r\n          if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n            v = obj[p];\r\n            if (v === !!v) {\r\n              if (v) {\r\n                if (typeof crypto != 'undefined' && crypto &&\r\n                 (crypto.getRandomValues || crypto.randomBytes)) {\r\n                  CRYPTO = v;\r\n                } else {\r\n                  CRYPTO = !v;\r\n                  throw Error\r\n                   (bignumberError + 'crypto unavailable');\r\n                }\r\n              } else {\r\n                CRYPTO = v;\r\n              }\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' not true or false: ' + v);\r\n            }\r\n          }\r\n\r\n          // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n          // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 9, p);\r\n            MODULO_MODE = v;\r\n          }\r\n\r\n          // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            POW_PRECISION = v;\r\n          }\r\n\r\n          // FORMAT {object}\r\n          // '[BigNumber Error] FORMAT not an object: {v}'\r\n          if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n            v = obj[p];\r\n            if (typeof v == 'object') FORMAT = v;\r\n            else throw Error\r\n             (bignumberError + p + ' not an object: ' + v);\r\n          }\r\n\r\n          // ALPHABET {string}\r\n          // '[BigNumber Error] ALPHABET invalid: {v}'\r\n          if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n            v = obj[p];\r\n\r\n            // Disallow if only one character, or contains '.' or a repeated character.\r\n            if (typeof v == 'string' && !/^.$|\\.|(.).*\\1/.test(v)) {\r\n              ALPHABET = v;\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' invalid: ' + v);\r\n            }\r\n          }\r\n\r\n        } else {\r\n\r\n          // '[BigNumber Error] Object expected: {v}'\r\n          throw Error\r\n           (bignumberError + 'Object expected: ' + obj);\r\n        }\r\n      }\r\n\r\n      return {\r\n        DECIMAL_PLACES: DECIMAL_PLACES,\r\n        ROUNDING_MODE: ROUNDING_MODE,\r\n        EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n        RANGE: [MIN_EXP, MAX_EXP],\r\n        CRYPTO: CRYPTO,\r\n        MODULO_MODE: MODULO_MODE,\r\n        POW_PRECISION: POW_PRECISION,\r\n        FORMAT: FORMAT,\r\n        ALPHABET: ALPHABET\r\n      };\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if v is a BigNumber instance, otherwise return false.\r\n     *\r\n     * v {any}\r\n     */\r\n    BigNumber.isBigNumber = function (v) {\r\n      return v instanceof BigNumber || v && v._isBigNumber === true || false;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the maximum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.maximum = BigNumber.max = function () {\r\n      return maxOrMin(arguments, P.lt);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the minimum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.minimum = BigNumber.min = function () {\r\n      return maxOrMin(arguments, P.gt);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n     * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n     * zeros are produced).\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n     * '[BigNumber Error] crypto unavailable'\r\n     */\r\n    BigNumber.random = (function () {\r\n      var pow2_53 = 0x20000000000000;\r\n\r\n      // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n      // Check if Math.random() produces more than 32 bits of randomness.\r\n      // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n      // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n      var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n       ? function () { return mathfloor(Math.random() * pow2_53); }\r\n       : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n         (Math.random() * 0x800000 | 0); };\r\n\r\n      return function (dp) {\r\n        var a, b, e, k, v,\r\n          i = 0,\r\n          c = [],\r\n          rand = new BigNumber(ONE);\r\n\r\n        if (dp == null) dp = DECIMAL_PLACES;\r\n        else intCheck(dp, 0, MAX);\r\n\r\n        k = mathceil(dp / LOG_BASE);\r\n\r\n        if (CRYPTO) {\r\n\r\n          // Browsers supporting crypto.getRandomValues.\r\n          if (crypto.getRandomValues) {\r\n\r\n            a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n            for (; i < k;) {\r\n\r\n              // 53 bits:\r\n              // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n              // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n              // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n              //                                     11111 11111111 11111111\r\n              // 0x20000 is 2^21.\r\n              v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n              // Rejection sampling:\r\n              // 0 <= v < 9007199254740992\r\n              // Probability that v >= 9e15, is\r\n              // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n              if (v >= 9e15) {\r\n                b = crypto.getRandomValues(new Uint32Array(2));\r\n                a[i] = b[0];\r\n                a[i + 1] = b[1];\r\n              } else {\r\n\r\n                // 0 <= v <= 8999999999999999\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 2;\r\n              }\r\n            }\r\n            i = k / 2;\r\n\r\n          // Node.js supporting crypto.randomBytes.\r\n          } else if (crypto.randomBytes) {\r\n\r\n            // buffer\r\n            a = crypto.randomBytes(k *= 7);\r\n\r\n            for (; i < k;) {\r\n\r\n              // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n              // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n              // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n              // 0 <= v < 9007199254740992\r\n              v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n                 (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n                 (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n              if (v >= 9e15) {\r\n                crypto.randomBytes(7).copy(a, i);\r\n              } else {\r\n\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 7;\r\n              }\r\n            }\r\n            i = k / 7;\r\n          } else {\r\n            CRYPTO = false;\r\n            throw Error\r\n             (bignumberError + 'crypto unavailable');\r\n          }\r\n        }\r\n\r\n        // Use Math.random.\r\n        if (!CRYPTO) {\r\n\r\n          for (; i < k;) {\r\n            v = random53bitInt();\r\n            if (v < 9e15) c[i++] = v % 1e14;\r\n          }\r\n        }\r\n\r\n        k = c[--i];\r\n        dp %= LOG_BASE;\r\n\r\n        // Convert trailing digits to zeros according to dp.\r\n        if (k && dp) {\r\n          v = POWS_TEN[LOG_BASE - dp];\r\n          c[i] = mathfloor(k / v) * v;\r\n        }\r\n\r\n        // Remove trailing elements which are zero.\r\n        for (; c[i] === 0; c.pop(), i--);\r\n\r\n        // Zero?\r\n        if (i < 0) {\r\n          c = [e = 0];\r\n        } else {\r\n\r\n          // Remove leading elements which are zero and adjust exponent accordingly.\r\n          for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n          // Count the digits of the first element of c to determine leading zeros, and...\r\n          for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n          // adjust the exponent accordingly.\r\n          if (i < LOG_BASE) e -= LOG_BASE - i;\r\n        }\r\n\r\n        rand.e = e;\r\n        rand.c = c;\r\n        return rand;\r\n      };\r\n    })();\r\n\r\n\r\n    // PRIVATE FUNCTIONS\r\n\r\n\r\n    // Called by BigNumber and BigNumber.prototype.toString.\r\n    convertBase = (function () {\r\n      var decimal = '0123456789';\r\n\r\n      /*\r\n       * Convert string of baseIn to an array of numbers of baseOut.\r\n       * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n       * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n       */\r\n      function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n        var j,\r\n          arr = [0],\r\n          arrL,\r\n          i = 0,\r\n          len = str.length;\r\n\r\n        for (; i < len;) {\r\n          for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n          arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n          for (j = 0; j < arr.length; j++) {\r\n\r\n            if (arr[j] > baseOut - 1) {\r\n              if (arr[j + 1] == null) arr[j + 1] = 0;\r\n              arr[j + 1] += arr[j] / baseOut | 0;\r\n              arr[j] %= baseOut;\r\n            }\r\n          }\r\n        }\r\n\r\n        return arr.reverse();\r\n      }\r\n\r\n      // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n      // If the caller is toString, we are converting from base 10 to baseOut.\r\n      // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n      return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n        var alphabet, d, e, k, r, x, xc, y,\r\n          i = str.indexOf('.'),\r\n          dp = DECIMAL_PLACES,\r\n          rm = ROUNDING_MODE;\r\n\r\n        // Non-integer.\r\n        if (i >= 0) {\r\n          k = POW_PRECISION;\r\n\r\n          // Unlimited precision.\r\n          POW_PRECISION = 0;\r\n          str = str.replace('.', '');\r\n          y = new BigNumber(baseIn);\r\n          x = y.pow(str.length - i);\r\n          POW_PRECISION = k;\r\n\r\n          // Convert str as if an integer, then restore the fraction part by dividing the\r\n          // result by its base raised to a power.\r\n\r\n          y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n           10, baseOut, decimal);\r\n          y.e = y.c.length;\r\n        }\r\n\r\n        // Convert the number as integer.\r\n\r\n        xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n         ? (alphabet = ALPHABET, decimal)\r\n         : (alphabet = decimal, ALPHABET));\r\n\r\n        // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n        e = k = xc.length;\r\n\r\n        // Remove trailing zeros.\r\n        for (; xc[--k] == 0; xc.pop());\r\n\r\n        // Zero?\r\n        if (!xc[0]) return alphabet.charAt(0);\r\n\r\n        // Does str represent an integer? If so, no need for the division.\r\n        if (i < 0) {\r\n          --e;\r\n        } else {\r\n          x.c = xc;\r\n          x.e = e;\r\n\r\n          // The sign is needed for correct rounding.\r\n          x.s = sign;\r\n          x = div(x, y, dp, rm, baseOut);\r\n          xc = x.c;\r\n          r = x.r;\r\n          e = x.e;\r\n        }\r\n\r\n        // xc now represents str converted to baseOut.\r\n\r\n        // THe index of the rounding digit.\r\n        d = e + dp + 1;\r\n\r\n        // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n        i = xc[d];\r\n\r\n        // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n        k = baseOut / 2;\r\n        r = r || d < 0 || xc[d + 1] != null;\r\n\r\n        r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n              : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n               rm == (x.s < 0 ? 8 : 7));\r\n\r\n        // If the index of the rounding digit is not greater than zero, or xc represents\r\n        // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n        // such as 0.00001.\r\n        if (d < 1 || !xc[0]) {\r\n\r\n          // 1^-dp or 0\r\n          str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0))\r\n              : alphabet.charAt(0);\r\n        } else {\r\n\r\n          // Truncate xc to the required number of decimal places.\r\n          xc.length = d;\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            // Rounding up may mean the previous digit has to be rounded up and so on.\r\n            for (--baseOut; ++xc[--d] > baseOut;) {\r\n              xc[d] = 0;\r\n\r\n              if (!d) {\r\n                ++e;\r\n                xc = [1].concat(xc);\r\n              }\r\n            }\r\n          }\r\n\r\n          // Determine trailing zeros.\r\n          for (k = xc.length; !xc[--k];);\r\n\r\n          // E.g. [4, 11, 15] becomes 4bf.\r\n          for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n          // Add leading zeros, decimal point and trailing zeros as required.\r\n          str = toFixedPoint(str, e, alphabet.charAt(0));\r\n        }\r\n\r\n        // The caller will add the sign.\r\n        return str;\r\n      };\r\n    })();\r\n\r\n\r\n    // Perform division in the specified base. Called by div and convertBase.\r\n    div = (function () {\r\n\r\n      // Assume non-zero x and k.\r\n      function multiply(x, k, base) {\r\n        var m, temp, xlo, xhi,\r\n          carry = 0,\r\n          i = x.length,\r\n          klo = k % SQRT_BASE,\r\n          khi = k / SQRT_BASE | 0;\r\n\r\n        for (x = x.slice(); i--;) {\r\n          xlo = x[i] % SQRT_BASE;\r\n          xhi = x[i] / SQRT_BASE | 0;\r\n          m = khi * xlo + xhi * klo;\r\n          temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n          carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n          x[i] = temp % base;\r\n        }\r\n\r\n        if (carry) x = [carry].concat(x);\r\n\r\n        return x;\r\n      }\r\n\r\n      function compare(a, b, aL, bL) {\r\n        var i, cmp;\r\n\r\n        if (aL != bL) {\r\n          cmp = aL > bL ? 1 : -1;\r\n        } else {\r\n\r\n          for (i = cmp = 0; i < aL; i++) {\r\n\r\n            if (a[i] != b[i]) {\r\n              cmp = a[i] > b[i] ? 1 : -1;\r\n              break;\r\n            }\r\n          }\r\n        }\r\n\r\n        return cmp;\r\n      }\r\n\r\n      function subtract(a, b, aL, base) {\r\n        var i = 0;\r\n\r\n        // Subtract b from a.\r\n        for (; aL--;) {\r\n          a[aL] -= i;\r\n          i = a[aL] < b[aL] ? 1 : 0;\r\n          a[aL] = i * base + a[aL] - b[aL];\r\n        }\r\n\r\n        // Remove leading zeros.\r\n        for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n      }\r\n\r\n      // x: dividend, y: divisor.\r\n      return function (x, y, dp, rm, base) {\r\n        var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n          yL, yz,\r\n          s = x.s == y.s ? 1 : -1,\r\n          xc = x.c,\r\n          yc = y.c;\r\n\r\n        // Either NaN, Infinity or 0?\r\n        if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n          return new BigNumber(\r\n\r\n           // Return NaN if either NaN, or both Infinity or 0.\r\n           !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n            // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n            xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n         );\r\n        }\r\n\r\n        q = new BigNumber(s);\r\n        qc = q.c = [];\r\n        e = x.e - y.e;\r\n        s = dp + e + 1;\r\n\r\n        if (!base) {\r\n          base = BASE;\r\n          e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n          s = s / LOG_BASE | 0;\r\n        }\r\n\r\n        // Result exponent may be one less then the current value of e.\r\n        // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n        for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n        if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n        if (s < 0) {\r\n          qc.push(1);\r\n          more = true;\r\n        } else {\r\n          xL = xc.length;\r\n          yL = yc.length;\r\n          i = 0;\r\n          s += 2;\r\n\r\n          // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n          n = mathfloor(base / (yc[0] + 1));\r\n\r\n          // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n          // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n          if (n > 1) {\r\n            yc = multiply(yc, n, base);\r\n            xc = multiply(xc, n, base);\r\n            yL = yc.length;\r\n            xL = xc.length;\r\n          }\r\n\r\n          xi = yL;\r\n          rem = xc.slice(0, yL);\r\n          remL = rem.length;\r\n\r\n          // Add zeros to make remainder as long as divisor.\r\n          for (; remL < yL; rem[remL++] = 0);\r\n          yz = yc.slice();\r\n          yz = [0].concat(yz);\r\n          yc0 = yc[0];\r\n          if (yc[1] >= base / 2) yc0++;\r\n          // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n          // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n          do {\r\n            n = 0;\r\n\r\n            // Compare divisor and remainder.\r\n            cmp = compare(yc, rem, yL, remL);\r\n\r\n            // If divisor < remainder.\r\n            if (cmp < 0) {\r\n\r\n              // Calculate trial digit, n.\r\n\r\n              rem0 = rem[0];\r\n              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n              // n is how many times the divisor goes into the current remainder.\r\n              n = mathfloor(rem0 / yc0);\r\n\r\n              //  Algorithm:\r\n              //  product = divisor multiplied by trial digit (n).\r\n              //  Compare product and remainder.\r\n              //  If product is greater than remainder:\r\n              //    Subtract divisor from product, decrement trial digit.\r\n              //  Subtract product from remainder.\r\n              //  If product was less than remainder at the last compare:\r\n              //    Compare new remainder and divisor.\r\n              //    If remainder is greater than divisor:\r\n              //      Subtract divisor from remainder, increment trial digit.\r\n\r\n              if (n > 1) {\r\n\r\n                // n may be > base only when base is 3.\r\n                if (n >= base) n = base - 1;\r\n\r\n                // product = divisor * trial digit.\r\n                prod = multiply(yc, n, base);\r\n                prodL = prod.length;\r\n                remL = rem.length;\r\n\r\n                // Compare product and remainder.\r\n                // If product > remainder then trial digit n too high.\r\n                // n is 1 too high about 5% of the time, and is not known to have\r\n                // ever been more than 1 too high.\r\n                while (compare(prod, rem, prodL, remL) == 1) {\r\n                  n--;\r\n\r\n                  // Subtract divisor from product.\r\n                  subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n                  prodL = prod.length;\r\n                  cmp = 1;\r\n                }\r\n              } else {\r\n\r\n                // n is 0 or 1, cmp is -1.\r\n                // If n is 0, there is no need to compare yc and rem again below,\r\n                // so change cmp to 1 to avoid it.\r\n                // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n                if (n == 0) {\r\n\r\n                  // divisor < remainder, so n must be at least 1.\r\n                  cmp = n = 1;\r\n                }\r\n\r\n                // product = divisor\r\n                prod = yc.slice();\r\n                prodL = prod.length;\r\n              }\r\n\r\n              if (prodL < remL) prod = [0].concat(prod);\r\n\r\n              // Subtract product from remainder.\r\n              subtract(rem, prod, remL, base);\r\n              remL = rem.length;\r\n\r\n               // If product was < remainder.\r\n              if (cmp == -1) {\r\n\r\n                // Compare divisor and new remainder.\r\n                // If divisor < new remainder, subtract divisor from remainder.\r\n                // Trial digit n too low.\r\n                // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n                while (compare(yc, rem, yL, remL) < 1) {\r\n                  n++;\r\n\r\n                  // Subtract divisor from remainder.\r\n                  subtract(rem, yL < remL ? yz : yc, remL, base);\r\n                  remL = rem.length;\r\n                }\r\n              }\r\n            } else if (cmp === 0) {\r\n              n++;\r\n              rem = [0];\r\n            } // else cmp === 1 and n will be 0\r\n\r\n            // Add the next digit, n, to the result array.\r\n            qc[i++] = n;\r\n\r\n            // Update the remainder.\r\n            if (rem[0]) {\r\n              rem[remL++] = xc[xi] || 0;\r\n            } else {\r\n              rem = [xc[xi]];\r\n              remL = 1;\r\n            }\r\n          } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n          more = rem[0] != null;\r\n\r\n          // Leading zero?\r\n          if (!qc[0]) qc.splice(0, 1);\r\n        }\r\n\r\n        if (base == BASE) {\r\n\r\n          // To calculate q.e, first get the number of digits of qc[0].\r\n          for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n          round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n        // Caller is convertBase.\r\n        } else {\r\n          q.e = e;\r\n          q.r = +more;\r\n        }\r\n\r\n        return q;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n     * notation rounded to the specified decimal places or significant digits.\r\n     *\r\n     * n: a BigNumber.\r\n     * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n     * rm: the rounding mode.\r\n     * id: 1 (toExponential) or 2 (toPrecision).\r\n     */\r\n    function format(n, i, rm, id) {\r\n      var c0, e, ne, len, str;\r\n\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      if (!n.c) return n.toString();\r\n\r\n      c0 = n.c[0];\r\n      ne = n.e;\r\n\r\n      if (i == null) {\r\n        str = coeffToString(n.c);\r\n        str = id == 1 || id == 2 && ne <= TO_EXP_NEG\r\n         ? toExponential(str, ne)\r\n         : toFixedPoint(str, ne, '0');\r\n      } else {\r\n        n = round(new BigNumber(n), i, rm);\r\n\r\n        // n.e may have changed if the value was rounded up.\r\n        e = n.e;\r\n\r\n        str = coeffToString(n.c);\r\n        len = str.length;\r\n\r\n        // toPrecision returns exponential notation if the number of significant digits\r\n        // specified is less than the number of digits necessary to represent the integer\r\n        // part of the value in fixed-point notation.\r\n\r\n        // Exponential notation.\r\n        if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n          // Append zeros?\r\n          for (; len < i; str += '0', len++);\r\n          str = toExponential(str, e);\r\n\r\n        // Fixed-point notation.\r\n        } else {\r\n          i -= ne;\r\n          str = toFixedPoint(str, e, '0');\r\n\r\n          // Append zeros?\r\n          if (e + 1 > len) {\r\n            if (--i > 0) for (str += '.'; i--; str += '0');\r\n          } else {\r\n            i += e - len;\r\n            if (i > 0) {\r\n              if (e + 1 == len) str += '.';\r\n              for (; i--; str += '0');\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return n.s < 0 && c0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // Handle BigNumber.max and BigNumber.min.\r\n    function maxOrMin(args, method) {\r\n      var m, n,\r\n        i = 0;\r\n\r\n      if (isArray(args[0])) args = args[0];\r\n      m = new BigNumber(args[0]);\r\n\r\n      for (; ++i < args.length;) {\r\n        n = new BigNumber(args[i]);\r\n\r\n        // If any number is NaN, return NaN.\r\n        if (!n.s) {\r\n          m = n;\r\n          break;\r\n        } else if (method.call(m, n)) {\r\n          m = n;\r\n        }\r\n      }\r\n\r\n      return m;\r\n    }\r\n\r\n\r\n    /*\r\n     * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n     * Called by minus, plus and times.\r\n     */\r\n    function normalise(n, c, e) {\r\n      var i = 1,\r\n        j = c.length;\r\n\r\n       // Remove trailing zeros.\r\n      for (; !c[--j]; c.pop());\r\n\r\n      // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n      for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n      // Overflow?\r\n      if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n        // Infinity.\r\n        n.c = n.e = null;\r\n\r\n      // Underflow?\r\n      } else if (e < MIN_EXP) {\r\n\r\n        // Zero.\r\n        n.c = [n.e = 0];\r\n      } else {\r\n        n.e = e;\r\n        n.c = c;\r\n      }\r\n\r\n      return n;\r\n    }\r\n\r\n\r\n    // Handle values that fail the validity test in BigNumber.\r\n    parseNumeric = (function () {\r\n      var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n        dotAfter = /^([^.]+)\\.$/,\r\n        dotBefore = /^\\.([^.]+)$/,\r\n        isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n        whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n      return function (x, str, isNum, b) {\r\n        var base,\r\n          s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n        // No exception on ±Infinity or NaN.\r\n        if (isInfinityOrNaN.test(s)) {\r\n          x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n          x.c = x.e = null;\r\n        } else {\r\n          if (!isNum) {\r\n\r\n            // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n            s = s.replace(basePrefix, function (m, p1, p2) {\r\n              base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n              return !b || b == base ? p1 : m;\r\n            });\r\n\r\n            if (b) {\r\n              base = b;\r\n\r\n              // E.g. '1.' to '1', '.1' to '0.1'\r\n              s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n            }\r\n\r\n            if (str != s) return new BigNumber(s, base);\r\n          }\r\n\r\n          // '[BigNumber Error] Not a number: {n}'\r\n          // '[BigNumber Error] Not a base {b} number: {n}'\r\n          if (BigNumber.DEBUG) {\r\n            throw Error\r\n              (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n          }\r\n\r\n          // NaN\r\n          x.c = x.e = x.s = null;\r\n        }\r\n      }\r\n    })();\r\n\r\n\r\n    /*\r\n     * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n     * If r is truthy, it is known that there are more digits after the rounding digit.\r\n     */\r\n    function round(x, sd, rm, r) {\r\n      var d, i, j, k, n, ni, rd,\r\n        xc = x.c,\r\n        pows10 = POWS_TEN;\r\n\r\n      // if x is not Infinity or NaN...\r\n      if (xc) {\r\n\r\n        // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n        // ni is the index of n within x.c.\r\n        // d is the number of digits of n.\r\n        // i is the index of rd within n including leading zeros.\r\n        // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n        out: {\r\n\r\n          // Get the number of digits of the first element of xc.\r\n          for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n          i = sd - d;\r\n\r\n          // If the rounding digit is in the first element of xc...\r\n          if (i < 0) {\r\n            i += LOG_BASE;\r\n            j = sd;\r\n            n = xc[ni = 0];\r\n\r\n            // Get the rounding digit at index j of n.\r\n            rd = n / pows10[d - j - 1] % 10 | 0;\r\n          } else {\r\n            ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n            if (ni >= xc.length) {\r\n\r\n              if (r) {\r\n\r\n                // Needed by sqrt.\r\n                for (; xc.length <= ni; xc.push(0));\r\n                n = rd = 0;\r\n                d = 1;\r\n                i %= LOG_BASE;\r\n                j = i - LOG_BASE + 1;\r\n              } else {\r\n                break out;\r\n              }\r\n            } else {\r\n              n = k = xc[ni];\r\n\r\n              // Get the number of digits of n.\r\n              for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n              // Get the index of rd within n.\r\n              i %= LOG_BASE;\r\n\r\n              // Get the index of rd within n, adjusted for leading zeros.\r\n              // The number of leading zeros of n is given by LOG_BASE - d.\r\n              j = i - LOG_BASE + d;\r\n\r\n              // Get the rounding digit at index j of n.\r\n              rd = j < 0 ? 0 : n / pows10[d - j - 1] % 10 | 0;\r\n            }\r\n          }\r\n\r\n          r = r || sd < 0 ||\r\n\r\n          // Are there any non-zero digits after the rounding digit?\r\n          // The expression  n % pows10[d - j - 1]  returns all digits of n to the right\r\n          // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n           xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n          r = rm < 4\r\n           ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n           : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n            // Check whether the digit to the left of the rounding digit is odd.\r\n            ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n             rm == (x.s < 0 ? 8 : 7));\r\n\r\n          if (sd < 1 || !xc[0]) {\r\n            xc.length = 0;\r\n\r\n            if (r) {\r\n\r\n              // Convert sd to decimal places.\r\n              sd -= x.e + 1;\r\n\r\n              // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n              xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n              x.e = -sd || 0;\r\n            } else {\r\n\r\n              // Zero.\r\n              xc[0] = x.e = 0;\r\n            }\r\n\r\n            return x;\r\n          }\r\n\r\n          // Remove excess digits.\r\n          if (i == 0) {\r\n            xc.length = ni;\r\n            k = 1;\r\n            ni--;\r\n          } else {\r\n            xc.length = ni + 1;\r\n            k = pows10[LOG_BASE - i];\r\n\r\n            // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n            // j > 0 means i > number of leading zeros of n.\r\n            xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n          }\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            for (; ;) {\r\n\r\n              // If the digit to be rounded up is in the first element of xc...\r\n              if (ni == 0) {\r\n\r\n                // i will be the length of xc[0] before k is added.\r\n                for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n                j = xc[0] += k;\r\n                for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n                // if i != k the length has increased.\r\n                if (i != k) {\r\n                  x.e++;\r\n                  if (xc[0] == BASE) xc[0] = 1;\r\n                }\r\n\r\n                break;\r\n              } else {\r\n                xc[ni] += k;\r\n                if (xc[ni] != BASE) break;\r\n                xc[ni--] = 0;\r\n                k = 1;\r\n              }\r\n            }\r\n          }\r\n\r\n          // Remove trailing zeros.\r\n          for (i = xc.length; xc[--i] === 0; xc.pop());\r\n        }\r\n\r\n        // Overflow? Infinity.\r\n        if (x.e > MAX_EXP) {\r\n          x.c = x.e = null;\r\n\r\n        // Underflow? Zero.\r\n        } else if (x.e < MIN_EXP) {\r\n          x.c = [x.e = 0];\r\n        }\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n\r\n    // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n     */\r\n    P.absoluteValue = P.abs = function () {\r\n      var x = new BigNumber(this);\r\n      if (x.s < 0) x.s = 1;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return\r\n     *   1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     *   -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     *   0 if they have the same value,\r\n     *   or null if the value of either is NaN.\r\n     */\r\n    P.comparedTo = function (y, b) {\r\n      return compare(this, new BigNumber(y, b));\r\n    };\r\n\r\n\r\n    /*\r\n     * If dp is undefined or null or true or false, return the number of decimal places of the\r\n     * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     *\r\n     * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.decimalPlaces = P.dp = function (dp, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), dp + x.e + 1, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last number.\r\n      if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n      if (n < 0) n = 0;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n / 0 = I\r\n     *  n / N = N\r\n     *  n / I = 0\r\n     *  0 / n = 0\r\n     *  0 / 0 = N\r\n     *  0 / N = N\r\n     *  0 / I = 0\r\n     *  N / n = N\r\n     *  N / 0 = N\r\n     *  N / N = N\r\n     *  N / I = N\r\n     *  I / n = I\r\n     *  I / 0 = I\r\n     *  I / N = N\r\n     *  I / I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n     * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.dividedBy = P.div = function (y, b) {\r\n      return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n     * BigNumber by the value of BigNumber(y, b).\r\n     */\r\n    P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n      return div(this, new BigNumber(y, b), 0, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n     *\r\n     * If m is present, return the result modulo m.\r\n     * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n     *\r\n     * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n     * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n     *\r\n     * n {number|string|BigNumber} The exponent. An integer.\r\n     * [m] {number|string|BigNumber} The modulus.\r\n     *\r\n     * '[BigNumber Error] Exponent not an integer: {n}'\r\n     */\r\n    P.exponentiatedBy = P.pow = function (n, m) {\r\n      var half, isModExp, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n        x = this;\r\n\r\n      n = new BigNumber(n);\r\n\r\n      // Allow NaN and ±Infinity, but not other non-integers.\r\n      if (n.c && !n.isInteger()) {\r\n        throw Error\r\n          (bignumberError + 'Exponent not an integer: ' + n);\r\n      }\r\n\r\n      if (m != null) m = new BigNumber(m);\r\n\r\n      // Exponent of MAX_SAFE_INTEGER is 15.\r\n      nIsBig = n.e > 14;\r\n\r\n      // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n      if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n        // The sign of the result of pow when x is negative depends on the evenness of n.\r\n        // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n        y = new BigNumber(Math.pow(+x.valueOf(), nIsBig ? 2 - isOdd(n) : +n));\r\n        return m ? y.mod(m) : y;\r\n      }\r\n\r\n      nIsNeg = n.s < 0;\r\n\r\n      if (m) {\r\n\r\n        // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n        if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n        isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n        if (isModExp) x = x.mod(m);\r\n\r\n      // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n      // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n      } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n        // [1, 240000000]\r\n        ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n        // [80000000000000]  [99999750000000]\r\n        : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n        // If x is negative and n is odd, k = -0, else k = 0.\r\n        k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n        // If x >= 1, k = ±Infinity.\r\n        if (x.e > -1) k = 1 / k;\r\n\r\n        // If n is negative return ±0, else return ±Infinity.\r\n        return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n      } else if (POW_PRECISION) {\r\n\r\n        // Truncating each coefficient array to a length of k after each multiplication\r\n        // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n        // i.e. there will be a minimum of 28 guard digits retained.\r\n        k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n      }\r\n\r\n      if (nIsBig) {\r\n        half = new BigNumber(0.5);\r\n        nIsOdd = isOdd(n);\r\n      } else {\r\n        nIsOdd = n % 2;\r\n      }\r\n\r\n      if (nIsNeg) n.s = 1;\r\n\r\n      y = new BigNumber(ONE);\r\n\r\n      // Performs 54 loop iterations for n of 9007199254740991.\r\n      for (; ;) {\r\n\r\n        if (nIsOdd) {\r\n          y = y.times(x);\r\n          if (!y.c) break;\r\n\r\n          if (k) {\r\n            if (y.c.length > k) y.c.length = k;\r\n          } else if (isModExp) {\r\n            y = y.mod(m);    //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n          }\r\n        }\r\n\r\n        if (nIsBig) {\r\n          n = n.times(half);\r\n          round(n, n.e + 1, 1);\r\n          if (!n.c[0]) break;\r\n          nIsBig = n.e > 14;\r\n          nIsOdd = isOdd(n);\r\n        } else {\r\n          n = mathfloor(n / 2);\r\n          if (!n) break;\r\n          nIsOdd = n % 2;\r\n        }\r\n\r\n        x = x.times(x);\r\n\r\n        if (k) {\r\n          if (x.c && x.c.length > k) x.c.length = k;\r\n        } else if (isModExp) {\r\n          x = x.mod(m);    //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n        }\r\n      }\r\n\r\n      if (isModExp) return y;\r\n      if (nIsNeg) y = ONE.div(y);\r\n\r\n      return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n     * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n     */\r\n    P.integerValue = function (rm) {\r\n      var n = new BigNumber(this);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n      return round(n, n.e + 1, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isEqualTo = P.eq = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n     */\r\n    P.isFinite = function () {\r\n      return !!this.c;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isGreaterThan = P.gt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n     */\r\n    P.isInteger = function () {\r\n      return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isLessThan = P.lt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n     */\r\n    P.isNaN = function () {\r\n      return !this.s;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is negative, otherwise return false.\r\n     */\r\n    P.isNegative = function () {\r\n      return this.s < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is positive, otherwise return false.\r\n     */\r\n    P.isPositive = function () {\r\n      return this.s > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n     */\r\n    P.isZero = function () {\r\n      return !!this.c && this.c[0] == 0;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n - 0 = n\r\n     *  n - N = N\r\n     *  n - I = -I\r\n     *  0 - n = -n\r\n     *  0 - 0 = 0\r\n     *  0 - N = N\r\n     *  0 - I = -I\r\n     *  N - n = N\r\n     *  N - 0 = N\r\n     *  N - N = N\r\n     *  N - I = N\r\n     *  I - n = I\r\n     *  I - 0 = I\r\n     *  I - N = N\r\n     *  I - I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.minus = function (y, b) {\r\n      var i, j, t, xLTy,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n      if (a != b) {\r\n        y.s = -b;\r\n        return x.plus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Either Infinity?\r\n        if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n        // Either zero?\r\n        if (!xc[0] || !yc[0]) {\r\n\r\n          // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n          return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n           ROUNDING_MODE == 3 ? -0 : 0);\r\n        }\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Determine which is the bigger number.\r\n      if (a = xe - ye) {\r\n\r\n        if (xLTy = a < 0) {\r\n          a = -a;\r\n          t = xc;\r\n        } else {\r\n          ye = xe;\r\n          t = yc;\r\n        }\r\n\r\n        t.reverse();\r\n\r\n        // Prepend zeros to equalise exponents.\r\n        for (b = a; b--; t.push(0));\r\n        t.reverse();\r\n      } else {\r\n\r\n        // Exponents equal. Check digit by digit.\r\n        j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n        for (a = b = 0; b < j; b++) {\r\n\r\n          if (xc[b] != yc[b]) {\r\n            xLTy = xc[b] < yc[b];\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      // x < y? Point xc to the array of the bigger number.\r\n      if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s;\r\n\r\n      b = (j = yc.length) - (i = xc.length);\r\n\r\n      // Append zeros to xc if shorter.\r\n      // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n      if (b > 0) for (; b--; xc[i++] = 0);\r\n      b = BASE - 1;\r\n\r\n      // Subtract yc from xc.\r\n      for (; j > a;) {\r\n\r\n        if (xc[--j] < yc[j]) {\r\n          for (i = j; i && !xc[--i]; xc[i] = b);\r\n          --xc[i];\r\n          xc[j] += BASE;\r\n        }\r\n\r\n        xc[j] -= yc[j];\r\n      }\r\n\r\n      // Remove leading zeros and adjust exponent accordingly.\r\n      for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n      // Zero?\r\n      if (!xc[0]) {\r\n\r\n        // Following IEEE 754 (2008) 6.3,\r\n        // n - n = +0  but  n - n = -0  when rounding towards -Infinity.\r\n        y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n        y.c = [y.e = 0];\r\n        return y;\r\n      }\r\n\r\n      // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n      // for finite x and y.\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     *   n % 0 =  N\r\n     *   n % N =  N\r\n     *   n % I =  n\r\n     *   0 % n =  0\r\n     *  -0 % n = -0\r\n     *   0 % 0 =  N\r\n     *   0 % N =  N\r\n     *   0 % I =  0\r\n     *   N % n =  N\r\n     *   N % 0 =  N\r\n     *   N % N =  N\r\n     *   N % I =  N\r\n     *   I % n =  N\r\n     *   I % 0 =  N\r\n     *   I % N =  N\r\n     *   I % I =  N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n     * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n     */\r\n    P.modulo = P.mod = function (y, b) {\r\n      var q, s,\r\n        x = this;\r\n\r\n      y = new BigNumber(y, b);\r\n\r\n      // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n      if (!x.c || !y.s || y.c && !y.c[0]) {\r\n        return new BigNumber(NaN);\r\n\r\n      // Return x if y is Infinity or x is zero.\r\n      } else if (!y.c || x.c && !x.c[0]) {\r\n        return new BigNumber(x);\r\n      }\r\n\r\n      if (MODULO_MODE == 9) {\r\n\r\n        // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n        // r = x - qy    where  0 <= r < abs(y)\r\n        s = y.s;\r\n        y.s = 1;\r\n        q = div(x, y, 0, 3);\r\n        y.s = s;\r\n        q.s *= s;\r\n      } else {\r\n        q = div(x, y, 0, MODULO_MODE);\r\n      }\r\n\r\n      y = x.minus(q.times(y));\r\n\r\n      // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n      if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n      return y;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n * 0 = 0\r\n     *  n * N = N\r\n     *  n * I = I\r\n     *  0 * n = 0\r\n     *  0 * 0 = 0\r\n     *  0 * N = N\r\n     *  0 * I = N\r\n     *  N * n = N\r\n     *  N * 0 = N\r\n     *  N * N = N\r\n     *  N * I = N\r\n     *  I * n = I\r\n     *  I * 0 = N\r\n     *  I * N = N\r\n     *  I * I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n     * of BigNumber(y, b).\r\n     */\r\n    P.multipliedBy = P.times = function (y, b) {\r\n      var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n        base, sqrtBase,\r\n        x = this,\r\n        xc = x.c,\r\n        yc = (y = new BigNumber(y, b)).c;\r\n\r\n      // Either NaN, ±Infinity or ±0?\r\n      if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n        // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n        if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n          y.c = y.e = y.s = null;\r\n        } else {\r\n          y.s *= x.s;\r\n\r\n          // Return ±Infinity if either is ±Infinity.\r\n          if (!xc || !yc) {\r\n            y.c = y.e = null;\r\n\r\n          // Return ±0 if either is ±0.\r\n          } else {\r\n            y.c = [0];\r\n            y.e = 0;\r\n          }\r\n        }\r\n\r\n        return y;\r\n      }\r\n\r\n      e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n      y.s *= x.s;\r\n      xcL = xc.length;\r\n      ycL = yc.length;\r\n\r\n      // Ensure xc points to longer array and xcL to its length.\r\n      if (xcL < ycL) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i;\r\n\r\n      // Initialise the result array with zeros.\r\n      for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n      base = BASE;\r\n      sqrtBase = SQRT_BASE;\r\n\r\n      for (i = ycL; --i >= 0;) {\r\n        c = 0;\r\n        ylo = yc[i] % sqrtBase;\r\n        yhi = yc[i] / sqrtBase | 0;\r\n\r\n        for (k = xcL, j = i + k; j > i;) {\r\n          xlo = xc[--k] % sqrtBase;\r\n          xhi = xc[k] / sqrtBase | 0;\r\n          m = yhi * xlo + xhi * ylo;\r\n          xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n          c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n          zc[j--] = xlo % base;\r\n        }\r\n\r\n        zc[j] = c;\r\n      }\r\n\r\n      if (c) {\r\n        ++e;\r\n      } else {\r\n        zc.splice(0, 1);\r\n      }\r\n\r\n      return normalise(y, zc, e);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n     * i.e. multiplied by -1.\r\n     */\r\n    P.negated = function () {\r\n      var x = new BigNumber(this);\r\n      x.s = -x.s || null;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n + 0 = n\r\n     *  n + N = N\r\n     *  n + I = I\r\n     *  0 + n = n\r\n     *  0 + 0 = 0\r\n     *  0 + N = N\r\n     *  0 + I = I\r\n     *  N + n = N\r\n     *  N + 0 = N\r\n     *  N + N = N\r\n     *  N + I = N\r\n     *  I + n = I\r\n     *  I + 0 = I\r\n     *  I + N = N\r\n     *  I + I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.plus = function (y, b) {\r\n      var t,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n       if (a != b) {\r\n        y.s = -b;\r\n        return x.minus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Return ±Infinity if either ±Infinity.\r\n        if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n        // Either zero?\r\n        // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n        if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n      if (a = xe - ye) {\r\n        if (a > 0) {\r\n          ye = xe;\r\n          t = yc;\r\n        } else {\r\n          a = -a;\r\n          t = xc;\r\n        }\r\n\r\n        t.reverse();\r\n        for (; a--; t.push(0));\r\n        t.reverse();\r\n      }\r\n\r\n      a = xc.length;\r\n      b = yc.length;\r\n\r\n      // Point xc to the longer array, and b to the shorter length.\r\n      if (a - b < 0) t = yc, yc = xc, xc = t, b = a;\r\n\r\n      // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n      for (a = 0; b;) {\r\n        a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n        xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n      }\r\n\r\n      if (a) {\r\n        xc = [a].concat(xc);\r\n        ++ye;\r\n      }\r\n\r\n      // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n      // ye = MAX_EXP + 1 possible\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     * If sd is undefined or null or true or false, return the number of significant digits of\r\n     * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     * If sd is true include integer-part trailing zeros in the count.\r\n     *\r\n     * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n     *                     boolean: whether to count integer-part trailing zeros: true or false.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.precision = P.sd = function (sd, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (sd != null && sd !== !!sd) {\r\n        intCheck(sd, 1, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), sd, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      v = c.length - 1;\r\n      n = v * LOG_BASE + 1;\r\n\r\n      if (v = c[v]) {\r\n\r\n        // Subtract the number of trailing zeros of the last element.\r\n        for (; v % 10 == 0; v /= 10, n--);\r\n\r\n        // Add the number of digits of the first element.\r\n        for (v = c[0]; v >= 10; v /= 10, n++);\r\n      }\r\n\r\n      if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n     * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n     *\r\n     * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n     */\r\n    P.shiftedBy = function (k) {\r\n      intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n      return this.times('1e' + k);\r\n    };\r\n\r\n\r\n    /*\r\n     *  sqrt(-n) =  N\r\n     *  sqrt(N) =  N\r\n     *  sqrt(-I) =  N\r\n     *  sqrt(I) =  I\r\n     *  sqrt(0) =  0\r\n     *  sqrt(-0) = -0\r\n     *\r\n     * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n     * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.squareRoot = P.sqrt = function () {\r\n      var m, n, r, rep, t,\r\n        x = this,\r\n        c = x.c,\r\n        s = x.s,\r\n        e = x.e,\r\n        dp = DECIMAL_PLACES + 4,\r\n        half = new BigNumber('0.5');\r\n\r\n      // Negative/NaN/Infinity/zero?\r\n      if (s !== 1 || !c || !c[0]) {\r\n        return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n      }\r\n\r\n      // Initial estimate.\r\n      s = Math.sqrt(+x);\r\n\r\n      // Math.sqrt underflow/overflow?\r\n      // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n      if (s == 0 || s == 1 / 0) {\r\n        n = coeffToString(c);\r\n        if ((n.length + e) % 2 == 0) n += '0';\r\n        s = Math.sqrt(n);\r\n        e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n        if (s == 1 / 0) {\r\n          n = '1e' + e;\r\n        } else {\r\n          n = s.toExponential();\r\n          n = n.slice(0, n.indexOf('e') + 1) + e;\r\n        }\r\n\r\n        r = new BigNumber(n);\r\n      } else {\r\n        r = new BigNumber(s + '');\r\n      }\r\n\r\n      // Check for zero.\r\n      // r could be zero if MIN_EXP is changed after the this value was created.\r\n      // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n      // coeffToString to throw.\r\n      if (r.c[0]) {\r\n        e = r.e;\r\n        s = e + dp;\r\n        if (s < 3) s = 0;\r\n\r\n        // Newton-Raphson iteration.\r\n        for (; ;) {\r\n          t = r;\r\n          r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n          if (coeffToString(t.c  ).slice(0, s) === (n =\r\n             coeffToString(r.c)).slice(0, s)) {\r\n\r\n            // The exponent of r may here be one less than the final result exponent,\r\n            // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n            // are indexed correctly.\r\n            if (r.e < e) --s;\r\n            n = n.slice(s - 3, s + 1);\r\n\r\n            // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n            // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n            // iteration.\r\n            if (n == '9999' || !rep && n == '4999') {\r\n\r\n              // On the first iteration only, check to see if rounding up gives the\r\n              // exact result as the nines may infinitely repeat.\r\n              if (!rep) {\r\n                round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n                if (t.times(t).eq(x)) {\r\n                  r = t;\r\n                  break;\r\n                }\r\n              }\r\n\r\n              dp += 4;\r\n              s += 4;\r\n              rep = 1;\r\n            } else {\r\n\r\n              // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n              // result. If not, then there are further digits and m will be truthy.\r\n              if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n                // Truncate to the first rounding digit.\r\n                round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n                m = !r.times(r).eq(x);\r\n              }\r\n\r\n              break;\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in exponential notation and\r\n     * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toExponential = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp++;\r\n      }\r\n      return format(this, dp, rm, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n     * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n     * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toFixed = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp = dp + this.e + 1;\r\n      }\r\n      return format(this, dp, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n     * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n     * of the FORMAT object (see BigNumber.set).\r\n     *\r\n     * FORMAT = {\r\n     *      decimalSeparator : '.',\r\n     *      groupSeparator : ',',\r\n     *      groupSize : 3,\r\n     *      secondaryGroupSize : 0,\r\n     *      fractionGroupSeparator : '\\xA0',    // non-breaking space\r\n     *      fractionGroupSize : 0\r\n     * };\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toFormat = function (dp, rm) {\r\n      var str = this.toFixed(dp, rm);\r\n\r\n      if (this.c) {\r\n        var i,\r\n          arr = str.split('.'),\r\n          g1 = +FORMAT.groupSize,\r\n          g2 = +FORMAT.secondaryGroupSize,\r\n          groupSeparator = FORMAT.groupSeparator,\r\n          intPart = arr[0],\r\n          fractionPart = arr[1],\r\n          isNeg = this.s < 0,\r\n          intDigits = isNeg ? intPart.slice(1) : intPart,\r\n          len = intDigits.length;\r\n\r\n        if (g2) i = g1, g1 = g2, g2 = i, len -= i;\r\n\r\n        if (g1 > 0 && len > 0) {\r\n          i = len % g1 || g1;\r\n          intPart = intDigits.substr(0, i);\r\n\r\n          for (; i < len; i += g1) {\r\n            intPart += groupSeparator + intDigits.substr(i, g1);\r\n          }\r\n\r\n          if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n          if (isNeg) intPart = '-' + intPart;\r\n        }\r\n\r\n        str = fractionPart\r\n         ? intPart + FORMAT.decimalSeparator + ((g2 = +FORMAT.fractionGroupSize)\r\n          ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n           '$&' + FORMAT.fractionGroupSeparator)\r\n          : fractionPart)\r\n         : intPart;\r\n      }\r\n\r\n      return str;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string array representing the value of this BigNumber as a simple fraction with\r\n     * an integer numerator and an integer denominator. The denominator will be a positive\r\n     * non-zero value less than or equal to the specified maximum denominator. If a maximum\r\n     * denominator is not specified, the denominator will be the lowest value necessary to\r\n     * represent the number exactly.\r\n     *\r\n     * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n     *\r\n     * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n     */\r\n    P.toFraction = function (md) {\r\n      var arr, d, d0, d1, d2, e, exp, n, n0, n1, q, s,\r\n        x = this,\r\n        xc = x.c;\r\n\r\n      if (md != null) {\r\n        n = new BigNumber(md);\r\n\r\n        // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n        if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n          throw Error\r\n            (bignumberError + 'Argument ' +\r\n              (n.isInteger() ? 'out of range: ' : 'not an integer: ') + md);\r\n        }\r\n      }\r\n\r\n      if (!xc) return x.toString();\r\n\r\n      d = new BigNumber(ONE);\r\n      n1 = d0 = new BigNumber(ONE);\r\n      d1 = n0 = new BigNumber(ONE);\r\n      s = coeffToString(xc);\r\n\r\n      // Determine initial denominator.\r\n      // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n      e = d.e = s.length - x.e - 1;\r\n      d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n      md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n      exp = MAX_EXP;\r\n      MAX_EXP = 1 / 0;\r\n      n = new BigNumber(s);\r\n\r\n      // n0 = d1 = 0\r\n      n0.c[0] = 0;\r\n\r\n      for (; ;)  {\r\n        q = div(n, d, 0, 1);\r\n        d2 = d0.plus(q.times(d1));\r\n        if (d2.comparedTo(md) == 1) break;\r\n        d0 = d1;\r\n        d1 = d2;\r\n        n1 = n0.plus(q.times(d2 = n1));\r\n        n0 = d2;\r\n        d = n.minus(q.times(d2 = d));\r\n        n = d2;\r\n      }\r\n\r\n      d2 = div(md.minus(d0), d1, 0, 1);\r\n      n0 = n0.plus(d2.times(n1));\r\n      d0 = d0.plus(d2.times(d1));\r\n      n0.s = n1.s = x.s;\r\n      e *= 2;\r\n\r\n      // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n      arr = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n         div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1\r\n          ? [n1.toString(), d1.toString()]\r\n          : [n0.toString(), d0.toString()];\r\n\r\n      MAX_EXP = exp;\r\n      return arr;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return the value of this BigNumber converted to a number primitive.\r\n     */\r\n    P.toNumber = function () {\r\n      return +this;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n     * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n     * necessary to represent the integer part of the value in fixed-point notation, then use\r\n     * exponential notation.\r\n     *\r\n     * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.toPrecision = function (sd, rm) {\r\n      if (sd != null) intCheck(sd, 1, MAX);\r\n      return format(this, sd, rm, 2);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n     * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n     * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n     * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n     * TO_EXP_NEG, return exponential notation.\r\n     *\r\n     * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n     *\r\n     * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n     */\r\n    P.toString = function (b) {\r\n      var str,\r\n        n = this,\r\n        s = n.s,\r\n        e = n.e;\r\n\r\n      // Infinity or NaN?\r\n      if (e === null) {\r\n\r\n        if (s) {\r\n          str = 'Infinity';\r\n          if (s < 0) str = '-' + str;\r\n        } else {\r\n          str = 'NaN';\r\n        }\r\n      } else {\r\n        str = coeffToString(n.c);\r\n\r\n        if (b == null) {\r\n          str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n           ? toExponential(str, e)\r\n           : toFixedPoint(str, e, '0');\r\n        } else {\r\n          intCheck(b, 2, ALPHABET.length, 'Base');\r\n          str = convertBase(toFixedPoint(str, e, '0'), 10, b, s, true);\r\n        }\r\n\r\n        if (s < 0 && n.c[0]) str = '-' + str;\r\n      }\r\n\r\n      return str;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return as toString, but do not accept a base argument, and include the minus sign for\r\n     * negative zero.\r\n     */\r\n    P.valueOf = P.toJSON = function () {\r\n      var str,\r\n        n = this,\r\n        e = n.e;\r\n\r\n      if (e === null) return n.toString();\r\n\r\n      str = coeffToString(n.c);\r\n\r\n      str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n        ? toExponential(str, e)\r\n        : toFixedPoint(str, e, '0');\r\n\r\n      return n.s < 0 ? '-' + str : str;\r\n    };\r\n\r\n\r\n    P._isBigNumber = true;\r\n\r\n    if (configObject != null) BigNumber.set(configObject);\r\n\r\n    return BigNumber;\r\n  }\r\n\r\n\r\n  // PRIVATE HELPER FUNCTIONS\r\n\r\n\r\n  function bitFloor(n) {\r\n    var i = n | 0;\r\n    return n > 0 || n === i ? i : i - 1;\r\n  }\r\n\r\n\r\n  // Return a coefficient array as a string of base 10 digits.\r\n  function coeffToString(a) {\r\n    var s, z,\r\n      i = 1,\r\n      j = a.length,\r\n      r = a[0] + '';\r\n\r\n    for (; i < j;) {\r\n      s = a[i++] + '';\r\n      z = LOG_BASE - s.length;\r\n      for (; z--; s = '0' + s);\r\n      r += s;\r\n    }\r\n\r\n    // Determine trailing zeros.\r\n    for (j = r.length; r.charCodeAt(--j) === 48;);\r\n    return r.slice(0, j + 1 || 1);\r\n  }\r\n\r\n\r\n  // Compare the value of BigNumbers x and y.\r\n  function compare(x, y) {\r\n    var a, b,\r\n      xc = x.c,\r\n      yc = y.c,\r\n      i = x.s,\r\n      j = y.s,\r\n      k = x.e,\r\n      l = y.e;\r\n\r\n    // Either NaN?\r\n    if (!i || !j) return null;\r\n\r\n    a = xc && !xc[0];\r\n    b = yc && !yc[0];\r\n\r\n    // Either zero?\r\n    if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n    // Signs differ?\r\n    if (i != j) return i;\r\n\r\n    a = i < 0;\r\n    b = k == l;\r\n\r\n    // Either Infinity?\r\n    if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n    // Compare exponents.\r\n    if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n    j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n    // Compare lengths.\r\n    return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n   */\r\n  function intCheck(n, min, max, name) {\r\n    if (n < min || n > max || n !== (n < 0 ? mathceil(n) : mathfloor(n))) {\r\n      throw Error\r\n       (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n         ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n         : ' not a primitive number: ') + n);\r\n    }\r\n  }\r\n\r\n\r\n  function isArray(obj) {\r\n    return Object.prototype.toString.call(obj) == '[object Array]';\r\n  }\r\n\r\n\r\n  // Assumes finite n.\r\n  function isOdd(n) {\r\n    var k = n.c.length - 1;\r\n    return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n  }\r\n\r\n\r\n  function toExponential(str, e) {\r\n    return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n     (e < 0 ? 'e' : 'e+') + e;\r\n  }\r\n\r\n\r\n  function toFixedPoint(str, e, z) {\r\n    var len, zs;\r\n\r\n    // Negative exponent?\r\n    if (e < 0) {\r\n\r\n      // Prepend zeros.\r\n      for (zs = z + '.'; ++e; zs += z);\r\n      str = zs + str;\r\n\r\n    // Positive exponent\r\n    } else {\r\n      len = str.length;\r\n\r\n      // Append zeros.\r\n      if (++e > len) {\r\n        for (zs = z, e -= len; --e; zs += z);\r\n        str += zs;\r\n      } else if (e < len) {\r\n        str = str.slice(0, e) + '.' + str.slice(e);\r\n      }\r\n    }\r\n\r\n    return str;\r\n  }\r\n\r\n\r\n  // EXPORT\r\n\r\n\r\n  BigNumber = clone();\r\n  BigNumber['default'] = BigNumber.BigNumber = BigNumber;\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () { return BigNumber; });\r\n\r\n  // Node.js and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    module.exports = BigNumber;\r\n\r\n  // Browser.\r\n  } else {\r\n    if (!globalObject) {\r\n      globalObject = typeof self != 'undefined' && self ? self : window;\r\n    }\r\n\r\n    globalObject.BigNumber = BigNumber;\r\n  }\r\n})(this);\r\n","'use strict';\n\nvar objectAssign = require('object-assign');\n\n// compare and isBuffer taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js\n// original notice:\n\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>\n * @license  MIT\n */\nfunction compare(a, b) {\n  if (a === b) {\n    return 0;\n  }\n\n  var x = a.length;\n  var y = b.length;\n\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i];\n      y = b[i];\n      break;\n    }\n  }\n\n  if (x < y) {\n    return -1;\n  }\n  if (y < x) {\n    return 1;\n  }\n  return 0;\n}\nfunction isBuffer(b) {\n  if (global.Buffer && typeof global.Buffer.isBuffer === 'function') {\n    return global.Buffer.isBuffer(b);\n  }\n  return !!(b != null && b._isBuffer);\n}\n\n// based on node assert, original notice:\n// NB: The URL to the CommonJS spec is kept just for tradition.\n//     node-assert has evolved a lot since then, both in API and behavior.\n\n// http://wiki.commonjs.org/wiki/Unit_Testing/1.0\n//\n// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8!\n//\n// Originally from narwhal.js (http://narwhaljs.org)\n// Copyright (c) 2009 Thomas Robinson <280north.com>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the 'Software'), to\n// deal in the Software without restriction, including without limitation the\n// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n// sell copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar util = require('util/');\nvar hasOwn = Object.prototype.hasOwnProperty;\nvar pSlice = Array.prototype.slice;\nvar functionsHaveNames = (function () {\n  return function foo() {}.name === 'foo';\n}());\nfunction pToString (obj) {\n  return Object.prototype.toString.call(obj);\n}\nfunction isView(arrbuf) {\n  if (isBuffer(arrbuf)) {\n    return false;\n  }\n  if (typeof global.ArrayBuffer !== 'function') {\n    return false;\n  }\n  if (typeof ArrayBuffer.isView === 'function') {\n    return ArrayBuffer.isView(arrbuf);\n  }\n  if (!arrbuf) {\n    return false;\n  }\n  if (arrbuf instanceof DataView) {\n    return true;\n  }\n  if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) {\n    return true;\n  }\n  return false;\n}\n// 1. The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nvar assert = module.exports = ok;\n\n// 2. The AssertionError is defined in assert.\n// new assert.AssertionError({ message: message,\n//                             actual: actual,\n//                             expected: expected })\n\nvar regex = /\\s*function\\s+([^\\(\\s]*)\\s*/;\n// based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js\nfunction getName(func) {\n  if (!util.isFunction(func)) {\n    return;\n  }\n  if (functionsHaveNames) {\n    return func.name;\n  }\n  var str = func.toString();\n  var match = str.match(regex);\n  return match && match[1];\n}\nassert.AssertionError = function AssertionError(options) {\n  this.name = 'AssertionError';\n  this.actual = options.actual;\n  this.expected = options.expected;\n  this.operator = options.operator;\n  if (options.message) {\n    this.message = options.message;\n    this.generatedMessage = false;\n  } else {\n    this.message = getMessage(this);\n    this.generatedMessage = true;\n  }\n  var stackStartFunction = options.stackStartFunction || fail;\n  if (Error.captureStackTrace) {\n    Error.captureStackTrace(this, stackStartFunction);\n  } else {\n    // non v8 browsers so we can have a stacktrace\n    var err = new Error();\n    if (err.stack) {\n      var out = err.stack;\n\n      // try to strip useless frames\n      var fn_name = getName(stackStartFunction);\n      var idx = out.indexOf('\\n' + fn_name);\n      if (idx >= 0) {\n        // once we have located the function frame\n        // we need to strip out everything before it (and its line)\n        var next_line = out.indexOf('\\n', idx + 1);\n        out = out.substring(next_line + 1);\n      }\n\n      this.stack = out;\n    }\n  }\n};\n\n// assert.AssertionError instanceof Error\nutil.inherits(assert.AssertionError, Error);\n\nfunction truncate(s, n) {\n  if (typeof s === 'string') {\n    return s.length < n ? s : s.slice(0, n);\n  } else {\n    return s;\n  }\n}\nfunction inspect(something) {\n  if (functionsHaveNames || !util.isFunction(something)) {\n    return util.inspect(something);\n  }\n  var rawname = getName(something);\n  var name = rawname ? ': ' + rawname : '';\n  return '[Function' +  name + ']';\n}\nfunction getMessage(self) {\n  return truncate(inspect(self.actual), 128) + ' ' +\n         self.operator + ' ' +\n         truncate(inspect(self.expected), 128);\n}\n\n// At present only the three keys mentioned above are used and\n// understood by the spec. Implementations or sub modules can pass\n// other keys to the AssertionError's constructor - they will be\n// ignored.\n\n// 3. All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided.  All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction fail(actual, expected, message, operator, stackStartFunction) {\n  throw new assert.AssertionError({\n    message: message,\n    actual: actual,\n    expected: expected,\n    operator: operator,\n    stackStartFunction: stackStartFunction\n  });\n}\n\n// EXTENSION! allows for well behaved errors defined elsewhere.\nassert.fail = fail;\n\n// 4. Pure assertion tests whether a value is truthy, as determined\n// by !!guard.\n// assert.ok(guard, message_opt);\n// This statement is equivalent to assert.equal(true, !!guard,\n// message_opt);. To test strictly for the value true, use\n// assert.strictEqual(true, guard, message_opt);.\n\nfunction ok(value, message) {\n  if (!value) fail(value, true, message, '==', assert.ok);\n}\nassert.ok = ok;\n\n// 5. The equality assertion tests shallow, coercive equality with\n// ==.\n// assert.equal(actual, expected, message_opt);\n\nassert.equal = function equal(actual, expected, message) {\n  if (actual != expected) fail(actual, expected, message, '==', assert.equal);\n};\n\n// 6. The non-equality assertion tests for whether two objects are not equal\n// with != assert.notEqual(actual, expected, message_opt);\n\nassert.notEqual = function notEqual(actual, expected, message) {\n  if (actual == expected) {\n    fail(actual, expected, message, '!=', assert.notEqual);\n  }\n};\n\n// 7. The equivalence assertion tests a deep equality relation.\n// assert.deepEqual(actual, expected, message_opt);\n\nassert.deepEqual = function deepEqual(actual, expected, message) {\n  if (!_deepEqual(actual, expected, false)) {\n    fail(actual, expected, message, 'deepEqual', assert.deepEqual);\n  }\n};\n\nassert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {\n  if (!_deepEqual(actual, expected, true)) {\n    fail(actual, expected, message, 'deepStrictEqual', assert.deepStrictEqual);\n  }\n};\n\nfunction _deepEqual(actual, expected, strict, memos) {\n  // 7.1. All identical values are equivalent, as determined by ===.\n  if (actual === expected) {\n    return true;\n  } else if (isBuffer(actual) && isBuffer(expected)) {\n    return compare(actual, expected) === 0;\n\n  // 7.2. If the expected value is a Date object, the actual value is\n  // equivalent if it is also a Date object that refers to the same time.\n  } else if (util.isDate(actual) && util.isDate(expected)) {\n    return actual.getTime() === expected.getTime();\n\n  // 7.3 If the expected value is a RegExp object, the actual value is\n  // equivalent if it is also a RegExp object with the same source and\n  // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).\n  } else if (util.isRegExp(actual) && util.isRegExp(expected)) {\n    return actual.source === expected.source &&\n           actual.global === expected.global &&\n           actual.multiline === expected.multiline &&\n           actual.lastIndex === expected.lastIndex &&\n           actual.ignoreCase === expected.ignoreCase;\n\n  // 7.4. Other pairs that do not both pass typeof value == 'object',\n  // equivalence is determined by ==.\n  } else if ((actual === null || typeof actual !== 'object') &&\n             (expected === null || typeof expected !== 'object')) {\n    return strict ? actual === expected : actual == expected;\n\n  // If both values are instances of typed arrays, wrap their underlying\n  // ArrayBuffers in a Buffer each to increase performance\n  // This optimization requires the arrays to have the same type as checked by\n  // Object.prototype.toString (aka pToString). Never perform binary\n  // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their\n  // bit patterns are not identical.\n  } else if (isView(actual) && isView(expected) &&\n             pToString(actual) === pToString(expected) &&\n             !(actual instanceof Float32Array ||\n               actual instanceof Float64Array)) {\n    return compare(new Uint8Array(actual.buffer),\n                   new Uint8Array(expected.buffer)) === 0;\n\n  // 7.5 For all other Object pairs, including Array objects, equivalence is\n  // determined by having the same number of owned properties (as verified\n  // with Object.prototype.hasOwnProperty.call), the same set of keys\n  // (although not necessarily the same order), equivalent values for every\n  // corresponding key, and an identical 'prototype' property. Note: this\n  // accounts for both named and indexed properties on Arrays.\n  } else if (isBuffer(actual) !== isBuffer(expected)) {\n    return false;\n  } else {\n    memos = memos || {actual: [], expected: []};\n\n    var actualIndex = memos.actual.indexOf(actual);\n    if (actualIndex !== -1) {\n      if (actualIndex === memos.expected.indexOf(expected)) {\n        return true;\n      }\n    }\n\n    memos.actual.push(actual);\n    memos.expected.push(expected);\n\n    return objEquiv(actual, expected, strict, memos);\n  }\n}\n\nfunction isArguments(object) {\n  return Object.prototype.toString.call(object) == '[object Arguments]';\n}\n\nfunction objEquiv(a, b, strict, actualVisitedObjects) {\n  if (a === null || a === undefined || b === null || b === undefined)\n    return false;\n  // if one is a primitive, the other must be same\n  if (util.isPrimitive(a) || util.isPrimitive(b))\n    return a === b;\n  if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))\n    return false;\n  var aIsArgs = isArguments(a);\n  var bIsArgs = isArguments(b);\n  if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))\n    return false;\n  if (aIsArgs) {\n    a = pSlice.call(a);\n    b = pSlice.call(b);\n    return _deepEqual(a, b, strict);\n  }\n  var ka = objectKeys(a);\n  var kb = objectKeys(b);\n  var key, i;\n  // having the same number of owned properties (keys incorporates\n  // hasOwnProperty)\n  if (ka.length !== kb.length)\n    return false;\n  //the same set of keys (although not necessarily the same order),\n  ka.sort();\n  kb.sort();\n  //~~~cheap key test\n  for (i = ka.length - 1; i >= 0; i--) {\n    if (ka[i] !== kb[i])\n      return false;\n  }\n  //equivalent values for every corresponding key, and\n  //~~~possibly expensive deep test\n  for (i = ka.length - 1; i >= 0; i--) {\n    key = ka[i];\n    if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects))\n      return false;\n  }\n  return true;\n}\n\n// 8. The non-equivalence assertion tests for any deep inequality.\n// assert.notDeepEqual(actual, expected, message_opt);\n\nassert.notDeepEqual = function notDeepEqual(actual, expected, message) {\n  if (_deepEqual(actual, expected, false)) {\n    fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual);\n  }\n};\n\nassert.notDeepStrictEqual = notDeepStrictEqual;\nfunction notDeepStrictEqual(actual, expected, message) {\n  if (_deepEqual(actual, expected, true)) {\n    fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual);\n  }\n}\n\n\n// 9. The strict equality assertion tests strict equality, as determined by ===.\n// assert.strictEqual(actual, expected, message_opt);\n\nassert.strictEqual = function strictEqual(actual, expected, message) {\n  if (actual !== expected) {\n    fail(actual, expected, message, '===', assert.strictEqual);\n  }\n};\n\n// 10. The strict non-equality assertion tests for strict inequality, as\n// determined by !==.  assert.notStrictEqual(actual, expected, message_opt);\n\nassert.notStrictEqual = function notStrictEqual(actual, expected, message) {\n  if (actual === expected) {\n    fail(actual, expected, message, '!==', assert.notStrictEqual);\n  }\n};\n\nfunction expectedException(actual, expected) {\n  if (!actual || !expected) {\n    return false;\n  }\n\n  if (Object.prototype.toString.call(expected) == '[object RegExp]') {\n    return expected.test(actual);\n  }\n\n  try {\n    if (actual instanceof expected) {\n      return true;\n    }\n  } catch (e) {\n    // Ignore.  The instanceof check doesn't work for arrow functions.\n  }\n\n  if (Error.isPrototypeOf(expected)) {\n    return false;\n  }\n\n  return expected.call({}, actual) === true;\n}\n\nfunction _tryBlock(block) {\n  var error;\n  try {\n    block();\n  } catch (e) {\n    error = e;\n  }\n  return error;\n}\n\nfunction _throws(shouldThrow, block, expected, message) {\n  var actual;\n\n  if (typeof block !== 'function') {\n    throw new TypeError('\"block\" argument must be a function');\n  }\n\n  if (typeof expected === 'string') {\n    message = expected;\n    expected = null;\n  }\n\n  actual = _tryBlock(block);\n\n  message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +\n            (message ? ' ' + message : '.');\n\n  if (shouldThrow && !actual) {\n    fail(actual, expected, 'Missing expected exception' + message);\n  }\n\n  var userProvidedMessage = typeof message === 'string';\n  var isUnwantedException = !shouldThrow && util.isError(actual);\n  var isUnexpectedException = !shouldThrow && actual && !expected;\n\n  if ((isUnwantedException &&\n      userProvidedMessage &&\n      expectedException(actual, expected)) ||\n      isUnexpectedException) {\n    fail(actual, expected, 'Got unwanted exception' + message);\n  }\n\n  if ((shouldThrow && actual && expected &&\n      !expectedException(actual, expected)) || (!shouldThrow && actual)) {\n    throw actual;\n  }\n}\n\n// 11. Expected to throw an error:\n// assert.throws(block, Error_opt, message_opt);\n\nassert.throws = function(block, /*optional*/error, /*optional*/message) {\n  _throws(true, block, error, message);\n};\n\n// EXTENSION! This is annoying to write outside this module.\nassert.doesNotThrow = function(block, /*optional*/error, /*optional*/message) {\n  _throws(false, block, error, message);\n};\n\nassert.ifError = function(err) { if (err) throw err; };\n\n// Expose a strict only variant of assert\nfunction strict(value, message) {\n  if (!value) fail(value, true, message, '==', strict);\n}\nassert.strict = objectAssign(strict, assert, {\n  equal: assert.strictEqual,\n  deepEqual: assert.deepStrictEqual,\n  notEqual: assert.notStrictEqual,\n  notDeepEqual: assert.notDeepStrictEqual\n});\nassert.strict.strict = assert.strict;\n\nvar objectKeys = Object.keys || function (obj) {\n  var keys = [];\n  for (var key in obj) {\n    if (hasOwn.call(obj, key)) keys.push(key);\n  }\n  return keys;\n};\n","var toFinite = require('./toFinite');\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var asciiSize = require('./_asciiSize'),\n    hasUnicode = require('./_hasUnicode'),\n    unicodeSize = require('./_unicodeSize');\n\n/**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\nfunction stringSize(string) {\n  return hasUnicode(string)\n    ? unicodeSize(string)\n    : asciiSize(string);\n}\n\nmodule.exports = stringSize;\n","export default function _isPlaceholder(a) {\n       return a != null && typeof a === 'object' && a['@@functional/placeholder'] === true;\n}","import _isPlaceholder from './_isPlaceholder';\n\n/**\n * Optimized internal one-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curry1(fn) {\n  return function f1(a) {\n    if (arguments.length === 0 || _isPlaceholder(a)) {\n      return f1;\n    } else {\n      return fn.apply(this, arguments);\n    }\n  };\n}","import _curry1 from './internal/_curry1';\n\n/**\n * Returns a function that always returns the given value. Note that for\n * non-primitives the value returned is a reference to the original value.\n *\n * This function is known as `const`, `constant`, or `K` (for K combinator) in\n * other languages and libraries.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig a -> (* -> a)\n * @param {*} val The value to wrap in a function\n * @return {Function} A Function :: * -> val.\n * @example\n *\n *      var t = R.always('Tee');\n *      t(); //=> 'Tee'\n */\nvar always = /*#__PURE__*/_curry1(function always(val) {\n  return function () {\n    return val;\n  };\n});\nexport default always;","import always from './always';\n\n/**\n * A function that always returns `false`. Any passed in parameters are ignored.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig * -> Boolean\n * @param {*}\n * @return {Boolean}\n * @see R.always, R.T\n * @example\n *\n *      R.F(); //=> false\n */\nvar F = /*#__PURE__*/always(false);\nexport default F;","import always from './always';\n\n/**\n * A function that always returns `true`. Any passed in parameters are ignored.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig * -> Boolean\n * @param {*}\n * @return {Boolean}\n * @see R.always, R.F\n * @example\n *\n *      R.T(); //=> true\n */\nvar T = /*#__PURE__*/always(true);\nexport default T;","/**\n * A special placeholder value used to specify \"gaps\" within curried functions,\n * allowing partial application of any combination of arguments, regardless of\n * their positions.\n *\n * If `g` is a curried ternary function and `_` is `R.__`, the following are\n * equivalent:\n *\n *   - `g(1, 2, 3)`\n *   - `g(_, 2, 3)(1)`\n *   - `g(_, _, 3)(1)(2)`\n *   - `g(_, _, 3)(1, 2)`\n *   - `g(_, 2, _)(1, 3)`\n *   - `g(_, 2)(1)(3)`\n *   - `g(_, 2)(1, 3)`\n *   - `g(_, 2)(_, 3)(1)`\n *\n * @constant\n * @memberOf R\n * @since v0.6.0\n * @category Function\n * @example\n *\n *      var greet = R.replace('{name}', R.__, 'Hello, {name}!');\n *      greet('Alice'); //=> 'Hello, Alice!'\n */\nexport default { '@@functional/placeholder': true };","import _curry1 from './_curry1';\nimport _isPlaceholder from './_isPlaceholder';\n\n/**\n * Optimized internal two-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curry2(fn) {\n  return function f2(a, b) {\n    switch (arguments.length) {\n      case 0:\n        return f2;\n      case 1:\n        return _isPlaceholder(a) ? f2 : _curry1(function (_b) {\n          return fn(a, _b);\n        });\n      default:\n        return _isPlaceholder(a) && _isPlaceholder(b) ? f2 : _isPlaceholder(a) ? _curry1(function (_a) {\n          return fn(_a, b);\n        }) : _isPlaceholder(b) ? _curry1(function (_b) {\n          return fn(a, _b);\n        }) : fn(a, b);\n    }\n  };\n}","import _curry2 from './internal/_curry2';\n\n/**\n * Adds two values.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a\n * @param {Number} b\n * @return {Number}\n * @see R.subtract\n * @example\n *\n *      R.add(2, 3);       //=>  5\n *      R.add(7)(10);      //=> 17\n */\nvar add = /*#__PURE__*/_curry2(function add(a, b) {\n  return Number(a) + Number(b);\n});\nexport default add;","/**\n * Private `concat` function to merge two array-like objects.\n *\n * @private\n * @param {Array|Arguments} [set1=[]] An array-like object.\n * @param {Array|Arguments} [set2=[]] An array-like object.\n * @return {Array} A new, merged array.\n * @example\n *\n *      _concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]\n */\nexport default function _concat(set1, set2) {\n  set1 = set1 || [];\n  set2 = set2 || [];\n  var idx;\n  var len1 = set1.length;\n  var len2 = set2.length;\n  var result = [];\n\n  idx = 0;\n  while (idx < len1) {\n    result[result.length] = set1[idx];\n    idx += 1;\n  }\n  idx = 0;\n  while (idx < len2) {\n    result[result.length] = set2[idx];\n    idx += 1;\n  }\n  return result;\n}","export default function _arity(n, fn) {\n  /* eslint-disable no-unused-vars */\n  switch (n) {\n    case 0:\n      return function () {\n        return fn.apply(this, arguments);\n      };\n    case 1:\n      return function (a0) {\n        return fn.apply(this, arguments);\n      };\n    case 2:\n      return function (a0, a1) {\n        return fn.apply(this, arguments);\n      };\n    case 3:\n      return function (a0, a1, a2) {\n        return fn.apply(this, arguments);\n      };\n    case 4:\n      return function (a0, a1, a2, a3) {\n        return fn.apply(this, arguments);\n      };\n    case 5:\n      return function (a0, a1, a2, a3, a4) {\n        return fn.apply(this, arguments);\n      };\n    case 6:\n      return function (a0, a1, a2, a3, a4, a5) {\n        return fn.apply(this, arguments);\n      };\n    case 7:\n      return function (a0, a1, a2, a3, a4, a5, a6) {\n        return fn.apply(this, arguments);\n      };\n    case 8:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7) {\n        return fn.apply(this, arguments);\n      };\n    case 9:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {\n        return fn.apply(this, arguments);\n      };\n    case 10:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {\n        return fn.apply(this, arguments);\n      };\n    default:\n      throw new Error('First argument to _arity must be a non-negative integer no greater than ten');\n  }\n}","import _arity from './_arity';\nimport _isPlaceholder from './_isPlaceholder';\n\n/**\n * Internal curryN function.\n *\n * @private\n * @category Function\n * @param {Number} length The arity of the curried function.\n * @param {Array} received An array of arguments received thus far.\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curryN(length, received, fn) {\n  return function () {\n    var combined = [];\n    var argsIdx = 0;\n    var left = length;\n    var combinedIdx = 0;\n    while (combinedIdx < received.length || argsIdx < arguments.length) {\n      var result;\n      if (combinedIdx < received.length && (!_isPlaceholder(received[combinedIdx]) || argsIdx >= arguments.length)) {\n        result = received[combinedIdx];\n      } else {\n        result = arguments[argsIdx];\n        argsIdx += 1;\n      }\n      combined[combinedIdx] = result;\n      if (!_isPlaceholder(result)) {\n        left -= 1;\n      }\n      combinedIdx += 1;\n    }\n    return left <= 0 ? fn.apply(this, combined) : _arity(left, _curryN(length, combined, fn));\n  };\n}","import _arity from './internal/_arity';\nimport _curry1 from './internal/_curry1';\nimport _curry2 from './internal/_curry2';\nimport _curryN from './internal/_curryN';\n\n/**\n * Returns a curried equivalent of the provided function, with the specified\n * arity. The curried function has two unusual capabilities. First, its\n * arguments needn't be provided one at a time. If `g` is `R.curryN(3, f)`, the\n * following are equivalent:\n *\n *   - `g(1)(2)(3)`\n *   - `g(1)(2, 3)`\n *   - `g(1, 2)(3)`\n *   - `g(1, 2, 3)`\n *\n * Secondly, the special placeholder value [`R.__`](#__) may be used to specify\n * \"gaps\", allowing partial application of any combination of arguments,\n * regardless of their positions. If `g` is as above and `_` is [`R.__`](#__),\n * the following are equivalent:\n *\n *   - `g(1, 2, 3)`\n *   - `g(_, 2, 3)(1)`\n *   - `g(_, _, 3)(1)(2)`\n *   - `g(_, _, 3)(1, 2)`\n *   - `g(_, 2)(1)(3)`\n *   - `g(_, 2)(1, 3)`\n *   - `g(_, 2)(_, 3)(1)`\n *\n * @func\n * @memberOf R\n * @since v0.5.0\n * @category Function\n * @sig Number -> (* -> a) -> (* -> a)\n * @param {Number} length The arity for the returned function.\n * @param {Function} fn The function to curry.\n * @return {Function} A new, curried function.\n * @see R.curry\n * @example\n *\n *      var sumArgs = (...args) => R.sum(args);\n *\n *      var curriedAddFourNumbers = R.curryN(4, sumArgs);\n *      var f = curriedAddFourNumbers(1, 2);\n *      var g = f(3);\n *      g(4); //=> 10\n */\nvar curryN = /*#__PURE__*/_curry2(function curryN(length, fn) {\n  if (length === 1) {\n    return _curry1(fn);\n  }\n  return _arity(length, _curryN(length, [], fn));\n});\nexport default curryN;","import _concat from './internal/_concat';\nimport _curry1 from './internal/_curry1';\nimport curryN from './curryN';\n\n/**\n * Creates a new list iteration function from an existing one by adding two new\n * parameters to its callback function: the current index, and the entire list.\n *\n * This would turn, for instance, [`R.map`](#map) function into one that\n * more closely resembles `Array.prototype.map`. Note that this will only work\n * for functions in which the iteration callback function is the first\n * parameter, and where the list is the last parameter. (This latter might be\n * unimportant if the list parameter is not used.)\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Function\n * @category List\n * @sig ((a ... -> b) ... -> [a] -> *) -> (a ..., Int, [a] -> b) ... -> [a] -> *)\n * @param {Function} fn A list iteration function that does not pass index or list to its callback\n * @return {Function} An altered list iteration function that passes (item, index, list) to its callback\n * @example\n *\n *      var mapIndexed = R.addIndex(R.map);\n *      mapIndexed((val, idx) => idx + '-' + val, ['f', 'o', 'o', 'b', 'a', 'r']);\n *      //=> ['0-f', '1-o', '2-o', '3-b', '4-a', '5-r']\n */\nvar addIndex = /*#__PURE__*/_curry1(function addIndex(fn) {\n  return curryN(fn.length, function () {\n    var idx = 0;\n    var origFn = arguments[0];\n    var list = arguments[arguments.length - 1];\n    var args = Array.prototype.slice.call(arguments, 0);\n    args[0] = function () {\n      var result = origFn.apply(this, _concat(arguments, [idx, list]));\n      idx += 1;\n      return result;\n    };\n    return fn.apply(this, args);\n  });\n});\nexport default addIndex;","import _curry1 from './_curry1';\nimport _curry2 from './_curry2';\nimport _isPlaceholder from './_isPlaceholder';\n\n/**\n * Optimized internal three-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curry3(fn) {\n  return function f3(a, b, c) {\n    switch (arguments.length) {\n      case 0:\n        return f3;\n      case 1:\n        return _isPlaceholder(a) ? f3 : _curry2(function (_b, _c) {\n          return fn(a, _b, _c);\n        });\n      case 2:\n        return _isPlaceholder(a) && _isPlaceholder(b) ? f3 : _isPlaceholder(a) ? _curry2(function (_a, _c) {\n          return fn(_a, b, _c);\n        }) : _isPlaceholder(b) ? _curry2(function (_b, _c) {\n          return fn(a, _b, _c);\n        }) : _curry1(function (_c) {\n          return fn(a, b, _c);\n        });\n      default:\n        return _isPlaceholder(a) && _isPlaceholder(b) && _isPlaceholder(c) ? f3 : _isPlaceholder(a) && _isPlaceholder(b) ? _curry2(function (_a, _b) {\n          return fn(_a, _b, c);\n        }) : _isPlaceholder(a) && _isPlaceholder(c) ? _curry2(function (_a, _c) {\n          return fn(_a, b, _c);\n        }) : _isPlaceholder(b) && _isPlaceholder(c) ? _curry2(function (_b, _c) {\n          return fn(a, _b, _c);\n        }) : _isPlaceholder(a) ? _curry1(function (_a) {\n          return fn(_a, b, c);\n        }) : _isPlaceholder(b) ? _curry1(function (_b) {\n          return fn(a, _b, c);\n        }) : _isPlaceholder(c) ? _curry1(function (_c) {\n          return fn(a, b, _c);\n        }) : fn(a, b, c);\n    }\n  };\n}","import _concat from './internal/_concat';\nimport _curry3 from './internal/_curry3';\n\n/**\n * Applies a function to the value at the given index of an array, returning a\n * new copy of the array with the element at the given index replaced with the\n * result of the function application.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig (a -> a) -> Number -> [a] -> [a]\n * @param {Function} fn The function to apply.\n * @param {Number} idx The index.\n * @param {Array|Arguments} list An array-like object whose value\n *        at the supplied index will be replaced.\n * @return {Array} A copy of the supplied array-like object with\n *         the element at index `idx` replaced with the value\n *         returned by applying `fn` to the existing element.\n * @see R.update\n * @example\n *\n *      R.adjust(R.add(10), 1, [1, 2, 3]);     //=> [1, 12, 3]\n *      R.adjust(R.add(10))(1)([1, 2, 3]);     //=> [1, 12, 3]\n * @symb R.adjust(f, -1, [a, b]) = [a, f(b)]\n * @symb R.adjust(f, 0, [a, b]) = [f(a), b]\n */\nvar adjust = /*#__PURE__*/_curry3(function adjust(fn, idx, list) {\n  if (idx >= list.length || idx < -list.length) {\n    return list;\n  }\n  var start = idx < 0 ? list.length : 0;\n  var _idx = start + idx;\n  var _list = _concat(list);\n  _list[_idx] = fn(list[_idx]);\n  return _list;\n});\nexport default adjust;","/**\n * Tests whether or not an object is an array.\n *\n * @private\n * @param {*} val The object to test.\n * @return {Boolean} `true` if `val` is an array, `false` otherwise.\n * @example\n *\n *      _isArray([]); //=> true\n *      _isArray(null); //=> false\n *      _isArray({}); //=> false\n */\nexport default Array.isArray || function _isArray(val) {\n  return val != null && val.length >= 0 && Object.prototype.toString.call(val) === '[object Array]';\n};","export default function _isTransformer(obj) {\n  return typeof obj['@@transducer/step'] === 'function';\n}","import _isArray from './_isArray';\nimport _isTransformer from './_isTransformer';\n\n/**\n * Returns a function that dispatches with different strategies based on the\n * object in list position (last argument). If it is an array, executes [fn].\n * Otherwise, if it has a function with one of the given method names, it will\n * execute that function (functor case). Otherwise, if it is a transformer,\n * uses transducer [xf] to return a new transformer (transducer case).\n * Otherwise, it will default to executing [fn].\n *\n * @private\n * @param {Array} methodNames properties to check for a custom implementation\n * @param {Function} xf transducer to initialize if object is transformer\n * @param {Function} fn default ramda implementation\n * @return {Function} A function that dispatches on object in list position\n */\nexport default function _dispatchable(methodNames, xf, fn) {\n  return function () {\n    if (arguments.length === 0) {\n      return fn();\n    }\n    var args = Array.prototype.slice.call(arguments, 0);\n    var obj = args.pop();\n    if (!_isArray(obj)) {\n      var idx = 0;\n      while (idx < methodNames.length) {\n        if (typeof obj[methodNames[idx]] === 'function') {\n          return obj[methodNames[idx]].apply(obj, args);\n        }\n        idx += 1;\n      }\n      if (_isTransformer(obj)) {\n        var transducer = xf.apply(null, args);\n        return transducer(obj);\n      }\n    }\n    return fn.apply(this, arguments);\n  };\n}","export default function _reduced(x) {\n  return x && x['@@transducer/reduced'] ? x : {\n    '@@transducer/value': x,\n    '@@transducer/reduced': true\n  };\n}","export default {\n  init: function () {\n    return this.xf['@@transducer/init']();\n  },\n  result: function (result) {\n    return this.xf['@@transducer/result'](result);\n  }\n};","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XAll = /*#__PURE__*/function () {\n  function XAll(f, xf) {\n    this.xf = xf;\n    this.f = f;\n    this.all = true;\n  }\n  XAll.prototype['@@transducer/init'] = _xfBase.init;\n  XAll.prototype['@@transducer/result'] = function (result) {\n    if (this.all) {\n      result = this.xf['@@transducer/step'](result, true);\n    }\n    return this.xf['@@transducer/result'](result);\n  };\n  XAll.prototype['@@transducer/step'] = function (result, input) {\n    if (!this.f(input)) {\n      this.all = false;\n      result = _reduced(this.xf['@@transducer/step'](result, false));\n    }\n    return result;\n  };\n\n  return XAll;\n}();\n\nvar _xall = /*#__PURE__*/_curry2(function _xall(f, xf) {\n  return new XAll(f, xf);\n});\nexport default _xall;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xall from './internal/_xall';\n\n/**\n * Returns `true` if all elements of the list match the predicate, `false` if\n * there are any that don't.\n *\n * Dispatches to the `all` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is satisfied by every element, `false`\n *         otherwise.\n * @see R.any, R.none, R.transduce\n * @example\n *\n *      var equals3 = R.equals(3);\n *      R.all(equals3)([3, 3, 3, 3]); //=> true\n *      R.all(equals3)([3, 3, 1, 3]); //=> false\n */\nvar all = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['all'], _xall, function all(fn, list) {\n  var idx = 0;\n  while (idx < list.length) {\n    if (!fn(list[idx])) {\n      return false;\n    }\n    idx += 1;\n  }\n  return true;\n}));\nexport default all;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns the larger of its two arguments.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> a\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.maxBy, R.min\n * @example\n *\n *      R.max(789, 123); //=> 789\n *      R.max('a', 'b'); //=> 'b'\n */\nvar max = /*#__PURE__*/_curry2(function max(a, b) {\n  return b > a ? b : a;\n});\nexport default max;","export default function _map(fn, functor) {\n  var idx = 0;\n  var len = functor.length;\n  var result = Array(len);\n  while (idx < len) {\n    result[idx] = fn(functor[idx]);\n    idx += 1;\n  }\n  return result;\n}","export default function _isString(x) {\n  return Object.prototype.toString.call(x) === '[object String]';\n}","import _curry1 from './_curry1';\nimport _isArray from './_isArray';\nimport _isString from './_isString';\n\n/**\n * Tests whether or not an object is similar to an array.\n *\n * @private\n * @category Type\n * @category List\n * @sig * -> Boolean\n * @param {*} x The object to test.\n * @return {Boolean} `true` if `x` has a numeric length property and extreme indices defined; `false` otherwise.\n * @example\n *\n *      _isArrayLike([]); //=> true\n *      _isArrayLike(true); //=> false\n *      _isArrayLike({}); //=> false\n *      _isArrayLike({length: 10}); //=> false\n *      _isArrayLike({0: 'zero', 9: 'nine', length: 10}); //=> true\n */\nvar _isArrayLike = /*#__PURE__*/_curry1(function isArrayLike(x) {\n  if (_isArray(x)) {\n    return true;\n  }\n  if (!x) {\n    return false;\n  }\n  if (typeof x !== 'object') {\n    return false;\n  }\n  if (_isString(x)) {\n    return false;\n  }\n  if (x.nodeType === 1) {\n    return !!x.length;\n  }\n  if (x.length === 0) {\n    return true;\n  }\n  if (x.length > 0) {\n    return x.hasOwnProperty(0) && x.hasOwnProperty(x.length - 1);\n  }\n  return false;\n});\nexport default _isArrayLike;","var XWrap = /*#__PURE__*/function () {\n  function XWrap(fn) {\n    this.f = fn;\n  }\n  XWrap.prototype['@@transducer/init'] = function () {\n    throw new Error('init not implemented on XWrap');\n  };\n  XWrap.prototype['@@transducer/result'] = function (acc) {\n    return acc;\n  };\n  XWrap.prototype['@@transducer/step'] = function (acc, x) {\n    return this.f(acc, x);\n  };\n\n  return XWrap;\n}();\n\nexport default function _xwrap(fn) {\n  return new XWrap(fn);\n}","import _arity from './internal/_arity';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Creates a function that is bound to a context.\n * Note: `R.bind` does not provide the additional argument-binding capabilities of\n * [Function.prototype.bind](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/bind).\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Function\n * @category Object\n * @sig (* -> *) -> {*} -> (* -> *)\n * @param {Function} fn The function to bind to context\n * @param {Object} thisObj The context to bind `fn` to\n * @return {Function} A function that will execute in the context of `thisObj`.\n * @see R.partial\n * @example\n *\n *      var log = R.bind(console.log, console);\n *      R.pipe(R.assoc('a', 2), R.tap(log), R.assoc('a', 3))({a: 1}); //=> {a: 3}\n *      // logs {a: 2}\n * @symb R.bind(f, o)(a, b) = f.call(o, a, b)\n */\nvar bind = /*#__PURE__*/_curry2(function bind(fn, thisObj) {\n  return _arity(fn.length, function () {\n    return fn.apply(thisObj, arguments);\n  });\n});\nexport default bind;","import _isArrayLike from './_isArrayLike';\nimport _xwrap from './_xwrap';\nimport bind from '../bind';\n\nfunction _arrayReduce(xf, acc, list) {\n  var idx = 0;\n  var len = list.length;\n  while (idx < len) {\n    acc = xf['@@transducer/step'](acc, list[idx]);\n    if (acc && acc['@@transducer/reduced']) {\n      acc = acc['@@transducer/value'];\n      break;\n    }\n    idx += 1;\n  }\n  return xf['@@transducer/result'](acc);\n}\n\nfunction _iterableReduce(xf, acc, iter) {\n  var step = iter.next();\n  while (!step.done) {\n    acc = xf['@@transducer/step'](acc, step.value);\n    if (acc && acc['@@transducer/reduced']) {\n      acc = acc['@@transducer/value'];\n      break;\n    }\n    step = iter.next();\n  }\n  return xf['@@transducer/result'](acc);\n}\n\nfunction _methodReduce(xf, acc, obj, methodName) {\n  return xf['@@transducer/result'](obj[methodName](bind(xf['@@transducer/step'], xf), acc));\n}\n\nvar symIterator = typeof Symbol !== 'undefined' ? Symbol.iterator : '@@iterator';\n\nexport default function _reduce(fn, acc, list) {\n  if (typeof fn === 'function') {\n    fn = _xwrap(fn);\n  }\n  if (_isArrayLike(list)) {\n    return _arrayReduce(fn, acc, list);\n  }\n  if (typeof list['fantasy-land/reduce'] === 'function') {\n    return _methodReduce(fn, acc, list, 'fantasy-land/reduce');\n  }\n  if (list[symIterator] != null) {\n    return _iterableReduce(fn, acc, list[symIterator]());\n  }\n  if (typeof list.next === 'function') {\n    return _iterableReduce(fn, acc, list);\n  }\n  if (typeof list.reduce === 'function') {\n    return _methodReduce(fn, acc, list, 'reduce');\n  }\n\n  throw new TypeError('reduce: list must be array or iterable');\n}","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XMap = /*#__PURE__*/function () {\n  function XMap(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XMap.prototype['@@transducer/init'] = _xfBase.init;\n  XMap.prototype['@@transducer/result'] = _xfBase.result;\n  XMap.prototype['@@transducer/step'] = function (result, input) {\n    return this.xf['@@transducer/step'](result, this.f(input));\n  };\n\n  return XMap;\n}();\n\nvar _xmap = /*#__PURE__*/_curry2(function _xmap(f, xf) {\n  return new XMap(f, xf);\n});\nexport default _xmap;","export default function _has(prop, obj) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}","import _has from './_has';\n\nvar toString = Object.prototype.toString;\nvar _isArguments = function () {\n  return toString.call(arguments) === '[object Arguments]' ? function _isArguments(x) {\n    return toString.call(x) === '[object Arguments]';\n  } : function _isArguments(x) {\n    return _has('callee', x);\n  };\n};\n\nexport default _isArguments;","import _curry1 from './internal/_curry1';\nimport _has from './internal/_has';\nimport _isArguments from './internal/_isArguments';\n\n// cover IE < 9 keys issues\nvar hasEnumBug = ! /*#__PURE__*/{ toString: null }.propertyIsEnumerable('toString');\nvar nonEnumerableProps = ['constructor', 'valueOf', 'isPrototypeOf', 'toString', 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];\n// Safari bug\nvar hasArgsEnumBug = /*#__PURE__*/function () {\n  'use strict';\n\n  return arguments.propertyIsEnumerable('length');\n}();\n\nvar contains = function contains(list, item) {\n  var idx = 0;\n  while (idx < list.length) {\n    if (list[idx] === item) {\n      return true;\n    }\n    idx += 1;\n  }\n  return false;\n};\n\n/**\n * Returns a list containing the names of all the enumerable own properties of\n * the supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own properties.\n * @see R.keysIn, R.values\n * @example\n *\n *      R.keys({a: 1, b: 2, c: 3}); //=> ['a', 'b', 'c']\n */\nvar _keys = typeof Object.keys === 'function' && !hasArgsEnumBug ? function keys(obj) {\n  return Object(obj) !== obj ? [] : Object.keys(obj);\n} : function keys(obj) {\n  if (Object(obj) !== obj) {\n    return [];\n  }\n  var prop, nIdx;\n  var ks = [];\n  var checkArgsLength = hasArgsEnumBug && _isArguments(obj);\n  for (prop in obj) {\n    if (_has(prop, obj) && (!checkArgsLength || prop !== 'length')) {\n      ks[ks.length] = prop;\n    }\n  }\n  if (hasEnumBug) {\n    nIdx = nonEnumerableProps.length - 1;\n    while (nIdx >= 0) {\n      prop = nonEnumerableProps[nIdx];\n      if (_has(prop, obj) && !contains(ks, prop)) {\n        ks[ks.length] = prop;\n      }\n      nIdx -= 1;\n    }\n  }\n  return ks;\n};\nvar keys = /*#__PURE__*/_curry1(_keys);\nexport default keys;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _map from './internal/_map';\nimport _reduce from './internal/_reduce';\nimport _xmap from './internal/_xmap';\nimport curryN from './curryN';\nimport keys from './keys';\n\n/**\n * Takes a function and\n * a [functor](https://github.com/fantasyland/fantasy-land#functor),\n * applies the function to each of the functor's values, and returns\n * a functor of the same shape.\n *\n * Ramda provides suitable `map` implementations for `Array` and `Object`,\n * so this function may be applied to `[1, 2, 3]` or `{x: 1, y: 2, z: 3}`.\n *\n * Dispatches to the `map` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * Also treats functions as functors and will compose them together.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Functor f => (a -> b) -> f a -> f b\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {Array} list The list to be iterated over.\n * @return {Array} The new list.\n * @see R.transduce, R.addIndex\n * @example\n *\n *      var double = x => x * 2;\n *\n *      R.map(double, [1, 2, 3]); //=> [2, 4, 6]\n *\n *      R.map(double, {x: 1, y: 2, z: 3}); //=> {x: 2, y: 4, z: 6}\n * @symb R.map(f, [a, b]) = [f(a), f(b)]\n * @symb R.map(f, { x: a, y: b }) = { x: f(a), y: f(b) }\n * @symb R.map(f, functor_o) = functor_o.map(f)\n */\nvar map = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['fantasy-land/map', 'map'], _xmap, function map(fn, functor) {\n  switch (Object.prototype.toString.call(functor)) {\n    case '[object Function]':\n      return curryN(functor.length, function () {\n        return fn.call(this, functor.apply(this, arguments));\n      });\n    case '[object Object]':\n      return _reduce(function (acc, key) {\n        acc[key] = fn(functor[key]);\n        return acc;\n      }, {}, keys(functor));\n    default:\n      return _map(fn, functor);\n  }\n}));\nexport default map;","import _curry2 from './internal/_curry2';\n\n/**\n * Retrieve the value at a given path.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @typedefn Idx = String | Int\n * @sig [Idx] -> {a} -> a | Undefined\n * @param {Array} path The path to use.\n * @param {Object} obj The object to retrieve the nested property from.\n * @return {*} The data at `path`.\n * @see R.prop\n * @example\n *\n *      R.path(['a', 'b'], {a: {b: 2}}); //=> 2\n *      R.path(['a', 'b'], {c: {b: 2}}); //=> undefined\n */\nvar path = /*#__PURE__*/_curry2(function path(paths, obj) {\n  var val = obj;\n  var idx = 0;\n  while (idx < paths.length) {\n    if (val == null) {\n      return;\n    }\n    val = val[paths[idx]];\n    idx += 1;\n  }\n  return val;\n});\nexport default path;","import _curry2 from './internal/_curry2';\nimport path from './path';\n\n/**\n * Returns a function that when supplied an object returns the indicated\n * property of that object, if it exists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig s -> {s: a} -> a | Undefined\n * @param {String} p The property name\n * @param {Object} obj The object to query\n * @return {*} The value at `obj.p`.\n * @see R.path\n * @example\n *\n *      R.prop('x', {x: 100}); //=> 100\n *      R.prop('x', {}); //=> undefined\n */\n\nvar prop = /*#__PURE__*/_curry2(function prop(p, obj) {\n  return path([p], obj);\n});\nexport default prop;","import _curry2 from './internal/_curry2';\nimport map from './map';\nimport prop from './prop';\n\n/**\n * Returns a new list by plucking the same named property off all objects in\n * the list supplied.\n *\n * `pluck` will work on\n * any [functor](https://github.com/fantasyland/fantasy-land#functor) in\n * addition to arrays, as it is equivalent to `R.map(R.prop(k), f)`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Functor f => k -> f {k: v} -> f v\n * @param {Number|String} key The key name to pluck off of each object.\n * @param {Array} f The array or functor to consider.\n * @return {Array} The list of values for the given key.\n * @see R.props\n * @example\n *\n *      R.pluck('a')([{a: 1}, {a: 2}]); //=> [1, 2]\n *      R.pluck(0)([[1, 2], [3, 4]]);   //=> [1, 3]\n *      R.pluck('val', {a: {val: 3}, b: {val: 5}}); //=> {a: 3, b: 5}\n * @symb R.pluck('x', [{x: 1, y: 2}, {x: 3, y: 4}, {x: 5, y: 6}]) = [1, 3, 5]\n * @symb R.pluck(0, [[1, 2], [3, 4], [5, 6]]) = [1, 3, 5]\n */\nvar pluck = /*#__PURE__*/_curry2(function pluck(p, list) {\n  return map(prop(p), list);\n});\nexport default pluck;","import _curry3 from './internal/_curry3';\nimport _reduce from './internal/_reduce';\n\n/**\n * Returns a single item by iterating through the list, successively calling\n * the iterator function and passing it an accumulator value and the current\n * value from the array, and then passing the result to the next call.\n *\n * The iterator function receives two values: *(acc, value)*. It may use\n * [`R.reduced`](#reduced) to shortcut the iteration.\n *\n * The arguments' order of [`reduceRight`](#reduceRight)'s iterator function\n * is *(value, acc)*.\n *\n * Note: `R.reduce` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.reduce` method. For more details\n * on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce#Description\n *\n * Dispatches to the `reduce` method of the third argument, if present. When\n * doing so, it is up to the user to handle the [`R.reduced`](#reduced)\n * shortcuting, as this is not implemented by `reduce`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, b) -> a) -> a -> [b] -> a\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n *        current element from the array.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduced, R.addIndex, R.reduceRight\n * @example\n *\n *      R.reduce(R.subtract, 0, [1, 2, 3, 4]) // => ((((0 - 1) - 2) - 3) - 4) = -10\n *      //          -               -10\n *      //         / \\              / \\\n *      //        -   4           -6   4\n *      //       / \\              / \\\n *      //      -   3   ==>     -3   3\n *      //     / \\              / \\\n *      //    -   2           -1   2\n *      //   / \\              / \\\n *      //  0   1            0   1\n *\n * @symb R.reduce(f, a, [b, c, d]) = f(f(f(a, b), c), d)\n */\nvar reduce = /*#__PURE__*/_curry3(_reduce);\nexport default reduce;","import _curry1 from './internal/_curry1';\nimport curryN from './curryN';\nimport max from './max';\nimport pluck from './pluck';\nimport reduce from './reduce';\n\n/**\n * Takes a list of predicates and returns a predicate that returns true for a\n * given list of arguments if every one of the provided predicates is satisfied\n * by those arguments.\n *\n * The function returned is a curried function whose arity matches that of the\n * highest-arity predicate.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Logic\n * @sig [(*... -> Boolean)] -> (*... -> Boolean)\n * @param {Array} predicates An array of predicates to check\n * @return {Function} The combined predicate\n * @see R.anyPass\n * @example\n *\n *      var isQueen = R.propEq('rank', 'Q');\n *      var isSpade = R.propEq('suit', '♠︎');\n *      var isQueenOfSpades = R.allPass([isQueen, isSpade]);\n *\n *      isQueenOfSpades({rank: 'Q', suit: '♣︎'}); //=> false\n *      isQueenOfSpades({rank: 'Q', suit: '♠︎'}); //=> true\n */\nvar allPass = /*#__PURE__*/_curry1(function allPass(preds) {\n  return curryN(reduce(max, 0, pluck('length', preds)), function () {\n    var idx = 0;\n    var len = preds.length;\n    while (idx < len) {\n      if (!preds[idx].apply(this, arguments)) {\n        return false;\n      }\n      idx += 1;\n    }\n    return true;\n  });\n});\nexport default allPass;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if both arguments are `true`; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig a -> b -> a | b\n * @param {Any} a\n * @param {Any} b\n * @return {Any} the first argument if it is falsy, otherwise the second argument.\n * @see R.both\n * @example\n *\n *      R.and(true, true); //=> true\n *      R.and(true, false); //=> false\n *      R.and(false, true); //=> false\n *      R.and(false, false); //=> false\n */\nvar and = /*#__PURE__*/_curry2(function and(a, b) {\n  return a && b;\n});\nexport default and;","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XAny = /*#__PURE__*/function () {\n  function XAny(f, xf) {\n    this.xf = xf;\n    this.f = f;\n    this.any = false;\n  }\n  XAny.prototype['@@transducer/init'] = _xfBase.init;\n  XAny.prototype['@@transducer/result'] = function (result) {\n    if (!this.any) {\n      result = this.xf['@@transducer/step'](result, false);\n    }\n    return this.xf['@@transducer/result'](result);\n  };\n  XAny.prototype['@@transducer/step'] = function (result, input) {\n    if (this.f(input)) {\n      this.any = true;\n      result = _reduced(this.xf['@@transducer/step'](result, true));\n    }\n    return result;\n  };\n\n  return XAny;\n}();\n\nvar _xany = /*#__PURE__*/_curry2(function _xany(f, xf) {\n  return new XAny(f, xf);\n});\nexport default _xany;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xany from './internal/_xany';\n\n/**\n * Returns `true` if at least one of elements of the list match the predicate,\n * `false` otherwise.\n *\n * Dispatches to the `any` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is satisfied by at least one element, `false`\n *         otherwise.\n * @see R.all, R.none, R.transduce\n * @example\n *\n *      var lessThan0 = R.flip(R.lt)(0);\n *      var lessThan2 = R.flip(R.lt)(2);\n *      R.any(lessThan0)([1, 2]); //=> false\n *      R.any(lessThan2)([1, 2]); //=> true\n */\nvar any = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['any'], _xany, function any(fn, list) {\n  var idx = 0;\n  while (idx < list.length) {\n    if (fn(list[idx])) {\n      return true;\n    }\n    idx += 1;\n  }\n  return false;\n}));\nexport default any;","import _curry1 from './internal/_curry1';\nimport curryN from './curryN';\nimport max from './max';\nimport pluck from './pluck';\nimport reduce from './reduce';\n\n/**\n * Takes a list of predicates and returns a predicate that returns true for a\n * given list of arguments if at least one of the provided predicates is\n * satisfied by those arguments.\n *\n * The function returned is a curried function whose arity matches that of the\n * highest-arity predicate.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Logic\n * @sig [(*... -> Boolean)] -> (*... -> Boolean)\n * @param {Array} predicates An array of predicates to check\n * @return {Function} The combined predicate\n * @see R.allPass\n * @example\n *\n *      var isClub = R.propEq('suit', '♣');\n *      var isSpade = R.propEq('suit', '♠');\n *      var isBlackCard = R.anyPass([isClub, isSpade]);\n *\n *      isBlackCard({rank: '10', suit: '♣'}); //=> true\n *      isBlackCard({rank: 'Q', suit: '♠'}); //=> true\n *      isBlackCard({rank: 'Q', suit: '♦'}); //=> false\n */\nvar anyPass = /*#__PURE__*/_curry1(function anyPass(preds) {\n  return curryN(reduce(max, 0, pluck('length', preds)), function () {\n    var idx = 0;\n    var len = preds.length;\n    while (idx < len) {\n      if (preds[idx].apply(this, arguments)) {\n        return true;\n      }\n      idx += 1;\n    }\n    return false;\n  });\n});\nexport default anyPass;","import _concat from './internal/_concat';\nimport _curry2 from './internal/_curry2';\nimport _reduce from './internal/_reduce';\nimport map from './map';\n\n/**\n * ap applies a list of functions to a list of values.\n *\n * Dispatches to the `ap` method of the second argument, if present. Also\n * treats curried functions as applicatives.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig [a -> b] -> [a] -> [b]\n * @sig Apply f => f (a -> b) -> f a -> f b\n * @sig (a -> b -> c) -> (a -> b) -> (a -> c)\n * @param {*} applyF\n * @param {*} applyX\n * @return {*}\n * @example\n *\n *      R.ap([R.multiply(2), R.add(3)], [1,2,3]); //=> [2, 4, 6, 4, 5, 6]\n *      R.ap([R.concat('tasty '), R.toUpper], ['pizza', 'salad']); //=> [\"tasty pizza\", \"tasty salad\", \"PIZZA\", \"SALAD\"]\n *\n *      // R.ap can also be used as S combinator\n *      // when only two functions are passed\n *      R.ap(R.concat, R.toUpper)('Ramda') //=> 'RamdaRAMDA'\n * @symb R.ap([f, g], [a, b]) = [f(a), f(b), g(a), g(b)]\n */\nvar ap = /*#__PURE__*/_curry2(function ap(applyF, applyX) {\n  return typeof applyX['fantasy-land/ap'] === 'function' ? applyX['fantasy-land/ap'](applyF) : typeof applyF.ap === 'function' ? applyF.ap(applyX) : typeof applyF === 'function' ? function (x) {\n    return applyF(x)(applyX(x));\n  } :\n  // else\n  _reduce(function (acc, f) {\n    return _concat(acc, map(f, applyX));\n  }, [], applyF);\n});\nexport default ap;","export default function _aperture(n, list) {\n  var idx = 0;\n  var limit = list.length - (n - 1);\n  var acc = new Array(limit >= 0 ? limit : 0);\n  while (idx < limit) {\n    acc[idx] = Array.prototype.slice.call(list, idx, idx + n);\n    idx += 1;\n  }\n  return acc;\n}","import _concat from './_concat';\nimport _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XAperture = /*#__PURE__*/function () {\n  function XAperture(n, xf) {\n    this.xf = xf;\n    this.pos = 0;\n    this.full = false;\n    this.acc = new Array(n);\n  }\n  XAperture.prototype['@@transducer/init'] = _xfBase.init;\n  XAperture.prototype['@@transducer/result'] = function (result) {\n    this.acc = null;\n    return this.xf['@@transducer/result'](result);\n  };\n  XAperture.prototype['@@transducer/step'] = function (result, input) {\n    this.store(input);\n    return this.full ? this.xf['@@transducer/step'](result, this.getCopy()) : result;\n  };\n  XAperture.prototype.store = function (input) {\n    this.acc[this.pos] = input;\n    this.pos += 1;\n    if (this.pos === this.acc.length) {\n      this.pos = 0;\n      this.full = true;\n    }\n  };\n  XAperture.prototype.getCopy = function () {\n    return _concat(Array.prototype.slice.call(this.acc, this.pos), Array.prototype.slice.call(this.acc, 0, this.pos));\n  };\n\n  return XAperture;\n}();\n\nvar _xaperture = /*#__PURE__*/_curry2(function _xaperture(n, xf) {\n  return new XAperture(n, xf);\n});\nexport default _xaperture;","import _aperture from './internal/_aperture';\nimport _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xaperture from './internal/_xaperture';\n\n/**\n * Returns a new list, composed of n-tuples of consecutive elements. If `n` is\n * greater than the length of the list, an empty list is returned.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig Number -> [a] -> [[a]]\n * @param {Number} n The size of the tuples to create\n * @param {Array} list The list to split into `n`-length tuples\n * @return {Array} The resulting list of `n`-length tuples\n * @see R.transduce\n * @example\n *\n *      R.aperture(2, [1, 2, 3, 4, 5]); //=> [[1, 2], [2, 3], [3, 4], [4, 5]]\n *      R.aperture(3, [1, 2, 3, 4, 5]); //=> [[1, 2, 3], [2, 3, 4], [3, 4, 5]]\n *      R.aperture(7, [1, 2, 3, 4, 5]); //=> []\n */\nvar aperture = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xaperture, _aperture));\nexport default aperture;","import _concat from './internal/_concat';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Returns a new list containing the contents of the given list, followed by\n * the given element.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} el The element to add to the end of the new list.\n * @param {Array} list The list of elements to add a new item to.\n *        list.\n * @return {Array} A new list containing the elements of the old list followed by `el`.\n * @see R.prepend\n * @example\n *\n *      R.append('tests', ['write', 'more']); //=> ['write', 'more', 'tests']\n *      R.append('tests', []); //=> ['tests']\n *      R.append(['tests'], ['write', 'more']); //=> ['write', 'more', ['tests']]\n */\nvar append = /*#__PURE__*/_curry2(function append(el, list) {\n  return _concat(list, [el]);\n});\nexport default append;","import _curry2 from './internal/_curry2';\n\n/**\n * Applies function `fn` to the argument list `args`. This is useful for\n * creating a fixed-arity function from a variadic function. `fn` should be a\n * bound function if context is significant.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig (*... -> a) -> [*] -> a\n * @param {Function} fn The function which will be called with `args`\n * @param {Array} args The arguments to call `fn` with\n * @return {*} result The result, equivalent to `fn(...args)`\n * @see R.call, R.unapply\n * @example\n *\n *      var nums = [1, 2, 3, -99, 42, 6, 7];\n *      R.apply(Math.max, nums); //=> 42\n * @symb R.apply(f, [a, b, c]) = f(a, b, c)\n */\nvar apply = /*#__PURE__*/_curry2(function apply(fn, args) {\n  return fn.apply(this, args);\n});\nexport default apply;","import _curry1 from './internal/_curry1';\nimport keys from './keys';\n\n/**\n * Returns a list of all the enumerable own properties of the supplied object.\n * Note that the order of the output array is not guaranteed across different\n * JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [v]\n * @param {Object} obj The object to extract values from\n * @return {Array} An array of the values of the object's own properties.\n * @see R.valuesIn, R.keys\n * @example\n *\n *      R.values({a: 1, b: 2, c: 3}); //=> [1, 2, 3]\n */\nvar values = /*#__PURE__*/_curry1(function values(obj) {\n  var props = keys(obj);\n  var len = props.length;\n  var vals = [];\n  var idx = 0;\n  while (idx < len) {\n    vals[idx] = obj[props[idx]];\n    idx += 1;\n  }\n  return vals;\n});\nexport default values;","import _curry1 from './internal/_curry1';\nimport apply from './apply';\nimport curryN from './curryN';\nimport map from './map';\nimport max from './max';\nimport pluck from './pluck';\nimport reduce from './reduce';\nimport values from './values';\n\n/**\n * Given a spec object recursively mapping properties to functions, creates a\n * function producing an object of the same structure, by mapping each property\n * to the result of calling its associated function with the supplied arguments.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Function\n * @sig {k: ((a, b, ..., m) -> v)} -> ((a, b, ..., m) -> {k: v})\n * @param {Object} spec an object recursively mapping properties to functions for\n *        producing the values for these properties.\n * @return {Function} A function that returns an object of the same structure\n * as `spec', with each property set to the value returned by calling its\n * associated function with the supplied arguments.\n * @see R.converge, R.juxt\n * @example\n *\n *      var getMetrics = R.applySpec({\n *        sum: R.add,\n *        nested: { mul: R.multiply }\n *      });\n *      getMetrics(2, 4); // => { sum: 6, nested: { mul: 8 } }\n * @symb R.applySpec({ x: f, y: { z: g } })(a, b) = { x: f(a, b), y: { z: g(a, b) } }\n */\nvar applySpec = /*#__PURE__*/_curry1(function applySpec(spec) {\n  spec = map(function (v) {\n    return typeof v == 'function' ? v : applySpec(v);\n  }, spec);\n  return curryN(reduce(max, 0, pluck('length', values(spec))), function () {\n    var args = arguments;\n    return map(function (f) {\n      return apply(f, args);\n    }, spec);\n  });\n});\nexport default applySpec;","import _curry2 from './internal/_curry2';\n\n/**\n* Takes a value and applies a function to it.\n*\n* This function is also known as the `thrush` combinator.\n*\n* @func\n* @memberOf R\n * @since v0.25.0\n* @category Function\n* @sig a -> (a -> b) -> b\n* @param {*} x The value\n* @param {Function} f The function to apply\n* @return {*} The result of applying `f` to `x`\n* @example\n*\n*      var t42 = R.applyTo(42);\n*      t42(R.identity); //=> 42\n*      t42(R.add(1)); //=> 43\n*/\nvar applyTo = /*#__PURE__*/_curry2(function applyTo(x, f) {\n  return f(x);\n});\nexport default applyTo;","import _curry3 from './internal/_curry3';\n\n/**\n * Makes an ascending comparator function out of a function that returns a value\n * that can be compared with `<` and `>`.\n *\n * @func\n * @memberOf R\n * @since v0.23.0\n * @category Function\n * @sig Ord b => (a -> b) -> a -> a -> Number\n * @param {Function} fn A function of arity one that returns a value that can be compared\n * @param {*} a The first item to be compared.\n * @param {*} b The second item to be compared.\n * @return {Number} `-1` if fn(a) < fn(b), `1` if fn(b) < fn(a), otherwise `0`\n * @see R.descend\n * @example\n *\n *      var byAge = R.ascend(R.prop('age'));\n *      var people = [\n *        // ...\n *      ];\n *      var peopleByYoungestFirst = R.sort(byAge, people);\n */\nvar ascend = /*#__PURE__*/_curry3(function ascend(fn, a, b) {\n  var aa = fn(a);\n  var bb = fn(b);\n  return aa < bb ? -1 : aa > bb ? 1 : 0;\n});\nexport default ascend;","import _curry3 from './internal/_curry3';\n\n/**\n * Makes a shallow clone of an object, setting or overriding the specified\n * property with the given value. Note that this copies and flattens prototype\n * properties onto the new object as well. All non-primitive properties are\n * copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @sig String -> a -> {k: v} -> {k: v}\n * @param {String} prop The property name to set\n * @param {*} val The new value\n * @param {Object} obj The object to clone\n * @return {Object} A new object equivalent to the original except for the changed property.\n * @see R.dissoc\n * @example\n *\n *      R.assoc('c', 3, {a: 1, b: 2}); //=> {a: 1, b: 2, c: 3}\n */\nvar assoc = /*#__PURE__*/_curry3(function assoc(prop, val, obj) {\n  var result = {};\n  for (var p in obj) {\n    result[p] = obj[p];\n  }\n  result[prop] = val;\n  return result;\n});\nexport default assoc;","/**\n * Determine if the passed argument is an integer.\n *\n * @private\n * @param {*} n\n * @category Type\n * @return {Boolean}\n */\nexport default Number.isInteger || function _isInteger(n) {\n  return n << 0 === n;\n};","import _curry1 from './internal/_curry1';\n\n/**\n * Checks if the input value is `null` or `undefined`.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Type\n * @sig * -> Boolean\n * @param {*} x The value to test.\n * @return {Boolean} `true` if `x` is `undefined` or `null`, otherwise `false`.\n * @example\n *\n *      R.isNil(null); //=> true\n *      R.isNil(undefined); //=> true\n *      R.isNil(0); //=> false\n *      R.isNil([]); //=> false\n */\nvar isNil = /*#__PURE__*/_curry1(function isNil(x) {\n  return x == null;\n});\nexport default isNil;","import _curry3 from './internal/_curry3';\nimport _has from './internal/_has';\nimport _isArray from './internal/_isArray';\nimport _isInteger from './internal/_isInteger';\nimport assoc from './assoc';\nimport isNil from './isNil';\n\n/**\n * Makes a shallow clone of an object, setting or overriding the nodes required\n * to create the given path, and placing the specific value at the tail end of\n * that path. Note that this copies and flattens prototype properties onto the\n * new object as well. All non-primitive properties are copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @typedefn Idx = String | Int\n * @sig [Idx] -> a -> {a} -> {a}\n * @param {Array} path the path to set\n * @param {*} val The new value\n * @param {Object} obj The object to clone\n * @return {Object} A new object equivalent to the original except along the specified path.\n * @see R.dissocPath\n * @example\n *\n *      R.assocPath(['a', 'b', 'c'], 42, {a: {b: {c: 0}}}); //=> {a: {b: {c: 42}}}\n *\n *      // Any missing or non-object keys in path will be overridden\n *      R.assocPath(['a', 'b', 'c'], 42, {a: 5}); //=> {a: {b: {c: 42}}}\n */\nvar assocPath = /*#__PURE__*/_curry3(function assocPath(path, val, obj) {\n  if (path.length === 0) {\n    return val;\n  }\n  var idx = path[0];\n  if (path.length > 1) {\n    var nextObj = !isNil(obj) && _has(idx, obj) ? obj[idx] : _isInteger(path[1]) ? [] : {};\n    val = assocPath(Array.prototype.slice.call(path, 1), val, nextObj);\n  }\n  if (_isInteger(idx) && _isArray(obj)) {\n    var arr = [].concat(obj);\n    arr[idx] = val;\n    return arr;\n  } else {\n    return assoc(idx, val, obj);\n  }\n});\nexport default assocPath;","import _curry2 from './internal/_curry2';\n\n/**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly `n` parameters. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig Number -> (* -> a) -> (* -> a)\n * @param {Number} n The desired arity of the new function.\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n *         arity `n`.\n * @see R.binary, R.unary\n * @example\n *\n *      var takesTwoArgs = (a, b) => [a, b];\n *\n *      takesTwoArgs.length; //=> 2\n *      takesTwoArgs(1, 2); //=> [1, 2]\n *\n *      var takesOneArg = R.nAry(1, takesTwoArgs);\n *      takesOneArg.length; //=> 1\n *      // Only `n` arguments are passed to the wrapped function\n *      takesOneArg(1, 2); //=> [1, undefined]\n * @symb R.nAry(0, f)(a, b) = f()\n * @symb R.nAry(1, f)(a, b) = f(a)\n * @symb R.nAry(2, f)(a, b) = f(a, b)\n */\nvar nAry = /*#__PURE__*/_curry2(function nAry(n, fn) {\n  switch (n) {\n    case 0:\n      return function () {\n        return fn.call(this);\n      };\n    case 1:\n      return function (a0) {\n        return fn.call(this, a0);\n      };\n    case 2:\n      return function (a0, a1) {\n        return fn.call(this, a0, a1);\n      };\n    case 3:\n      return function (a0, a1, a2) {\n        return fn.call(this, a0, a1, a2);\n      };\n    case 4:\n      return function (a0, a1, a2, a3) {\n        return fn.call(this, a0, a1, a2, a3);\n      };\n    case 5:\n      return function (a0, a1, a2, a3, a4) {\n        return fn.call(this, a0, a1, a2, a3, a4);\n      };\n    case 6:\n      return function (a0, a1, a2, a3, a4, a5) {\n        return fn.call(this, a0, a1, a2, a3, a4, a5);\n      };\n    case 7:\n      return function (a0, a1, a2, a3, a4, a5, a6) {\n        return fn.call(this, a0, a1, a2, a3, a4, a5, a6);\n      };\n    case 8:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7) {\n        return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7);\n      };\n    case 9:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {\n        return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7, a8);\n      };\n    case 10:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {\n        return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7, a8, a9);\n      };\n    default:\n      throw new Error('First argument to nAry must be a non-negative integer no greater than ten');\n  }\n});\nexport default nAry;","import _curry1 from './internal/_curry1';\nimport nAry from './nAry';\n\n/**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly 2 parameters. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Function\n * @sig (* -> c) -> (a, b -> c)\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n *         arity 2.\n * @see R.nAry, R.unary\n * @example\n *\n *      var takesThreeArgs = function(a, b, c) {\n *        return [a, b, c];\n *      };\n *      takesThreeArgs.length; //=> 3\n *      takesThreeArgs(1, 2, 3); //=> [1, 2, 3]\n *\n *      var takesTwoArgs = R.binary(takesThreeArgs);\n *      takesTwoArgs.length; //=> 2\n *      // Only 2 arguments are passed to the wrapped function\n *      takesTwoArgs(1, 2, 3); //=> [1, 2, undefined]\n * @symb R.binary(f)(a, b, c) = f(a, b)\n */\nvar binary = /*#__PURE__*/_curry1(function binary(fn) {\n  return nAry(2, fn);\n});\nexport default binary;","export default function _isFunction(x) {\n  return Object.prototype.toString.call(x) === '[object Function]';\n}","import _curry2 from './internal/_curry2';\nimport _reduce from './internal/_reduce';\nimport ap from './ap';\nimport curryN from './curryN';\nimport map from './map';\n\n/**\n * \"lifts\" a function to be the specified arity, so that it may \"map over\" that\n * many lists, Functions or other objects that satisfy the [FantasyLand Apply spec](https://github.com/fantasyland/fantasy-land#apply).\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig Number -> (*... -> *) -> ([*]... -> [*])\n * @param {Function} fn The function to lift into higher context\n * @return {Function} The lifted function.\n * @see R.lift, R.ap\n * @example\n *\n *      var madd3 = R.liftN(3, (...args) => R.sum(args));\n *      madd3([1,2,3], [1,2,3], [1]); //=> [3, 4, 5, 4, 5, 6, 5, 6, 7]\n */\nvar liftN = /*#__PURE__*/_curry2(function liftN(arity, fn) {\n  var lifted = curryN(arity, fn);\n  return curryN(arity, function () {\n    return _reduce(ap, map(lifted, arguments[0]), Array.prototype.slice.call(arguments, 1));\n  });\n});\nexport default liftN;","import _curry1 from './internal/_curry1';\nimport liftN from './liftN';\n\n/**\n * \"lifts\" a function of arity > 1 so that it may \"map over\" a list, Function or other\n * object that satisfies the [FantasyLand Apply spec](https://github.com/fantasyland/fantasy-land#apply).\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig (*... -> *) -> ([*]... -> [*])\n * @param {Function} fn The function to lift into higher context\n * @return {Function} The lifted function.\n * @see R.liftN\n * @example\n *\n *      var madd3 = R.lift((a, b, c) => a + b + c);\n *\n *      madd3([1,2,3], [1,2,3], [1]); //=> [3, 4, 5, 4, 5, 6, 5, 6, 7]\n *\n *      var madd5 = R.lift((a, b, c, d, e) => a + b + c + d + e);\n *\n *      madd5([1,2], [3], [4, 5], [6], [7, 8]); //=> [21, 22, 22, 23, 22, 23, 23, 24]\n */\nvar lift = /*#__PURE__*/_curry1(function lift(fn) {\n  return liftN(fn.length, fn);\n});\nexport default lift;","import _curry2 from './internal/_curry2';\nimport _isFunction from './internal/_isFunction';\nimport and from './and';\nimport lift from './lift';\n\n/**\n * A function which calls the two provided functions and returns the `&&`\n * of the results.\n * It returns the result of the first function if it is false-y and the result\n * of the second function otherwise. Note that this is short-circuited,\n * meaning that the second function will not be invoked if the first returns a\n * false-y value.\n *\n * In addition to functions, `R.both` also accepts any fantasy-land compatible\n * applicative functor.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> Boolean) -> (*... -> Boolean)\n * @param {Function} f A predicate\n * @param {Function} g Another predicate\n * @return {Function} a function that applies its arguments to `f` and `g` and `&&`s their outputs together.\n * @see R.and\n * @example\n *\n *      var gt10 = R.gt(R.__, 10)\n *      var lt20 = R.lt(R.__, 20)\n *      var f = R.both(gt10, lt20);\n *      f(15); //=> true\n *      f(30); //=> false\n */\nvar both = /*#__PURE__*/_curry2(function both(f, g) {\n  return _isFunction(f) ? function _both() {\n    return f.apply(this, arguments) && g.apply(this, arguments);\n  } : lift(and)(f, g);\n});\nexport default both;","import _curry1 from './internal/_curry1';\nimport curryN from './curryN';\n\n/**\n * Returns a curried equivalent of the provided function. The curried function\n * has two unusual capabilities. First, its arguments needn't be provided one\n * at a time. If `f` is a ternary function and `g` is `R.curry(f)`, the\n * following are equivalent:\n *\n *   - `g(1)(2)(3)`\n *   - `g(1)(2, 3)`\n *   - `g(1, 2)(3)`\n *   - `g(1, 2, 3)`\n *\n * Secondly, the special placeholder value [`R.__`](#__) may be used to specify\n * \"gaps\", allowing partial application of any combination of arguments,\n * regardless of their positions. If `g` is as above and `_` is [`R.__`](#__),\n * the following are equivalent:\n *\n *   - `g(1, 2, 3)`\n *   - `g(_, 2, 3)(1)`\n *   - `g(_, _, 3)(1)(2)`\n *   - `g(_, _, 3)(1, 2)`\n *   - `g(_, 2)(1)(3)`\n *   - `g(_, 2)(1, 3)`\n *   - `g(_, 2)(_, 3)(1)`\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (* -> a) -> (* -> a)\n * @param {Function} fn The function to curry.\n * @return {Function} A new, curried function.\n * @see R.curryN\n * @example\n *\n *      var addFourNumbers = (a, b, c, d) => a + b + c + d;\n *\n *      var curriedAddFourNumbers = R.curry(addFourNumbers);\n *      var f = curriedAddFourNumbers(1, 2);\n *      var g = f(3);\n *      g(4); //=> 10\n */\nvar curry = /*#__PURE__*/_curry1(function curry(fn) {\n  return curryN(fn.length, fn);\n});\nexport default curry;","import curry from './curry';\n\n/**\n * Returns the result of calling its first argument with the remaining\n * arguments. This is occasionally useful as a converging function for\n * [`R.converge`](#converge): the first branch can produce a function while the\n * remaining branches produce values to be passed to that function as its\n * arguments.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig (*... -> a),*... -> a\n * @param {Function} fn The function to apply to the remaining arguments.\n * @param {...*} args Any number of positional arguments.\n * @return {*}\n * @see R.apply\n * @example\n *\n *      R.call(R.add, 1, 2); //=> 3\n *\n *      var indentN = R.pipe(R.repeat(' '),\n *                           R.join(''),\n *                           R.replace(/^(?!$)/gm));\n *\n *      var format = R.converge(R.call, [\n *                                  R.pipe(R.prop('indent'), indentN),\n *                                  R.prop('value')\n *                              ]);\n *\n *      format({indent: 2, value: 'foo\\nbar\\nbaz\\n'}); //=> '  foo\\n  bar\\n  baz\\n'\n * @symb R.call(f, a, b) = f(a, b)\n */\nvar call = /*#__PURE__*/curry(function call(fn) {\n  return fn.apply(this, Array.prototype.slice.call(arguments, 1));\n});\nexport default call;","import _isArrayLike from './_isArrayLike';\n\n/**\n * `_makeFlat` is a helper function that returns a one-level or fully recursive\n * function based on the flag passed in.\n *\n * @private\n */\nexport default function _makeFlat(recursive) {\n  return function flatt(list) {\n    var value, jlen, j;\n    var result = [];\n    var idx = 0;\n    var ilen = list.length;\n\n    while (idx < ilen) {\n      if (_isArrayLike(list[idx])) {\n        value = recursive ? flatt(list[idx]) : list[idx];\n        j = 0;\n        jlen = value.length;\n        while (j < jlen) {\n          result[result.length] = value[j];\n          j += 1;\n        }\n      } else {\n        result[result.length] = list[idx];\n      }\n      idx += 1;\n    }\n    return result;\n  };\n}","import _forceReduced from './_forceReduced';\nimport _isArrayLike from './_isArrayLike';\nimport _reduce from './_reduce';\nimport _xfBase from './_xfBase';\n\nvar preservingReduced = function (xf) {\n  return {\n    '@@transducer/init': _xfBase.init,\n    '@@transducer/result': function (result) {\n      return xf['@@transducer/result'](result);\n    },\n    '@@transducer/step': function (result, input) {\n      var ret = xf['@@transducer/step'](result, input);\n      return ret['@@transducer/reduced'] ? _forceReduced(ret) : ret;\n    }\n  };\n};\n\nvar _flatCat = function _xcat(xf) {\n  var rxf = preservingReduced(xf);\n  return {\n    '@@transducer/init': _xfBase.init,\n    '@@transducer/result': function (result) {\n      return rxf['@@transducer/result'](result);\n    },\n    '@@transducer/step': function (result, input) {\n      return !_isArrayLike(input) ? _reduce(rxf, result, [input]) : _reduce(rxf, result, input);\n    }\n  };\n};\n\nexport default _flatCat;","export default function _forceReduced(x) {\n  return {\n    '@@transducer/value': x,\n    '@@transducer/reduced': true\n  };\n}","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _makeFlat from './internal/_makeFlat';\nimport _xchain from './internal/_xchain';\nimport map from './map';\n\n/**\n * `chain` maps a function over a list and concatenates the results. `chain`\n * is also known as `flatMap` in some libraries\n *\n * Dispatches to the `chain` method of the second argument, if present,\n * according to the [FantasyLand Chain spec](https://github.com/fantasyland/fantasy-land#chain).\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig Chain m => (a -> m b) -> m a -> m b\n * @param {Function} fn The function to map with\n * @param {Array} list The list to map over\n * @return {Array} The result of flat-mapping `list` with `fn`\n * @example\n *\n *      var duplicate = n => [n, n];\n *      R.chain(duplicate, [1, 2, 3]); //=> [1, 1, 2, 2, 3, 3]\n *\n *      R.chain(R.append, R.head)([1, 2, 3]); //=> [1, 2, 3, 1]\n */\nvar chain = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['fantasy-land/chain', 'chain'], _xchain, function chain(fn, monad) {\n  if (typeof monad === 'function') {\n    return function (x) {\n      return fn(monad(x))(x);\n    };\n  }\n  return _makeFlat(false)(map(fn, monad));\n}));\nexport default chain;","import _curry2 from './_curry2';\nimport _flatCat from './_flatCat';\nimport map from '../map';\n\nvar _xchain = /*#__PURE__*/_curry2(function _xchain(f, xf) {\n  return map(f, _flatCat(xf));\n});\nexport default _xchain;","import _curry3 from './internal/_curry3';\n\n/**\n * Restricts a number to be within a range.\n *\n * Also works for other ordered types such as Strings and Dates.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Relation\n * @sig Ord a => a -> a -> a -> a\n * @param {Number} minimum The lower limit of the clamp (inclusive)\n * @param {Number} maximum The upper limit of the clamp (inclusive)\n * @param {Number} value Value to be clamped\n * @return {Number} Returns `minimum` when `val < minimum`, `maximum` when `val > maximum`, returns `val` otherwise\n * @example\n *\n *      R.clamp(1, 10, -5) // => 1\n *      R.clamp(1, 10, 15) // => 10\n *      R.clamp(1, 10, 4)  // => 4\n */\nvar clamp = /*#__PURE__*/_curry3(function clamp(min, max, value) {\n  if (min > max) {\n    throw new Error('min must not be greater than max in clamp(min, max, value)');\n  }\n  return value < min ? min : value > max ? max : value;\n});\nexport default clamp;","export default function _cloneRegExp(pattern) {\n                                  return new RegExp(pattern.source, (pattern.global ? 'g' : '') + (pattern.ignoreCase ? 'i' : '') + (pattern.multiline ? 'm' : '') + (pattern.sticky ? 'y' : '') + (pattern.unicode ? 'u' : ''));\n}","import _curry1 from './internal/_curry1';\n\n/**\n * Gives a single-word string description of the (native) type of a value,\n * returning such answers as 'Object', 'Number', 'Array', or 'Null'. Does not\n * attempt to distinguish user Object types any further, reporting them all as\n * 'Object'.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Type\n * @sig (* -> {*}) -> String\n * @param {*} val The value to test\n * @return {String}\n * @example\n *\n *      R.type({}); //=> \"Object\"\n *      R.type(1); //=> \"Number\"\n *      R.type(false); //=> \"Boolean\"\n *      R.type('s'); //=> \"String\"\n *      R.type(null); //=> \"Null\"\n *      R.type([]); //=> \"Array\"\n *      R.type(/[A-z]/); //=> \"RegExp\"\n *      R.type(() => {}); //=> \"Function\"\n *      R.type(undefined); //=> \"Undefined\"\n */\nvar type = /*#__PURE__*/_curry1(function type(val) {\n  return val === null ? 'Null' : val === undefined ? 'Undefined' : Object.prototype.toString.call(val).slice(8, -1);\n});\nexport default type;","import _cloneRegExp from './_cloneRegExp';\nimport type from '../type';\n\n/**\n * Copies an object.\n *\n * @private\n * @param {*} value The value to be copied\n * @param {Array} refFrom Array containing the source references\n * @param {Array} refTo Array containing the copied source references\n * @param {Boolean} deep Whether or not to perform deep cloning.\n * @return {*} The copied value.\n */\nexport default function _clone(value, refFrom, refTo, deep) {\n  var copy = function copy(copiedValue) {\n    var len = refFrom.length;\n    var idx = 0;\n    while (idx < len) {\n      if (value === refFrom[idx]) {\n        return refTo[idx];\n      }\n      idx += 1;\n    }\n    refFrom[idx + 1] = value;\n    refTo[idx + 1] = copiedValue;\n    for (var key in value) {\n      copiedValue[key] = deep ? _clone(value[key], refFrom, refTo, true) : value[key];\n    }\n    return copiedValue;\n  };\n  switch (type(value)) {\n    case 'Object':\n      return copy({});\n    case 'Array':\n      return copy([]);\n    case 'Date':\n      return new Date(value.valueOf());\n    case 'RegExp':\n      return _cloneRegExp(value);\n    default:\n      return value;\n  }\n}","import _clone from './internal/_clone';\nimport _curry1 from './internal/_curry1';\n\n/**\n * Creates a deep copy of the value which may contain (nested) `Array`s and\n * `Object`s, `Number`s, `String`s, `Boolean`s and `Date`s. `Function`s are\n * assigned by reference rather than copied\n *\n * Dispatches to a `clone` method if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {*} -> {*}\n * @param {*} value The object or array to clone\n * @return {*} A deeply cloned copy of `val`\n * @example\n *\n *      var objects = [{}, {}, {}];\n *      var objectsClone = R.clone(objects);\n *      objects === objectsClone; //=> false\n *      objects[0] === objectsClone[0]; //=> false\n */\nvar clone = /*#__PURE__*/_curry1(function clone(value) {\n  return value != null && typeof value.clone === 'function' ? value.clone() : _clone(value, [], [], true);\n});\nexport default clone;","import _curry1 from './internal/_curry1';\n\n/**\n * Makes a comparator function out of a function that reports whether the first\n * element is less than the second.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig ((a, b) -> Boolean) -> ((a, b) -> Number)\n * @param {Function} pred A predicate function of arity two which will return `true` if the first argument\n * is less than the second, `false` otherwise\n * @return {Function} A Function :: a -> b -> Int that returns `-1` if a < b, `1` if b < a, otherwise `0`\n * @example\n *\n *      var byAge = R.comparator((a, b) => a.age < b.age);\n *      var people = [\n *        // ...\n *      ];\n *      var peopleByIncreasingAge = R.sort(byAge, people);\n */\nvar comparator = /*#__PURE__*/_curry1(function comparator(pred) {\n  return function (a, b) {\n    return pred(a, b) ? -1 : pred(b, a) ? 1 : 0;\n  };\n});\nexport default comparator;","import _curry1 from './internal/_curry1';\n\n/**\n * A function that returns the `!` of its argument. It will return `true` when\n * passed false-y value, and `false` when passed a truth-y one.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig * -> Boolean\n * @param {*} a any value\n * @return {Boolean} the logical inverse of passed argument.\n * @see R.complement\n * @example\n *\n *      R.not(true); //=> false\n *      R.not(false); //=> true\n *      R.not(0); //=> true\n *      R.not(1); //=> false\n */\nvar not = /*#__PURE__*/_curry1(function not(a) {\n  return !a;\n});\nexport default not;","import lift from './lift';\nimport not from './not';\n\n/**\n * Takes a function `f` and returns a function `g` such that if called with the same arguments\n * when `f` returns a \"truthy\" value, `g` returns `false` and when `f` returns a \"falsy\" value `g` returns `true`.\n *\n * `R.complement` may be applied to any functor\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> *) -> (*... -> Boolean)\n * @param {Function} f\n * @return {Function}\n * @see R.not\n * @example\n *\n *      var isNotNil = R.complement(R.isNil);\n *      isNil(null); //=> true\n *      isNotNil(null); //=> false\n *      isNil(7); //=> false\n *      isNotNil(7); //=> true\n */\nvar complement = /*#__PURE__*/lift(not);\nexport default complement;","export default function _pipe(f, g) {\n  return function () {\n    return g.call(this, f.apply(this, arguments));\n  };\n}","import _isArray from './_isArray';\n\n/**\n * This checks whether a function has a [methodname] function. If it isn't an\n * array it will execute that function otherwise it will default to the ramda\n * implementation.\n *\n * @private\n * @param {Function} fn ramda implemtation\n * @param {String} methodname property to check for a custom implementation\n * @return {Object} Whatever the return value of the method is.\n */\nexport default function _checkForMethod(methodname, fn) {\n  return function () {\n    var length = arguments.length;\n    if (length === 0) {\n      return fn();\n    }\n    var obj = arguments[length - 1];\n    return _isArray(obj) || typeof obj[methodname] !== 'function' ? fn.apply(this, arguments) : obj[methodname].apply(obj, Array.prototype.slice.call(arguments, 0, length - 1));\n  };\n}","import _checkForMethod from './internal/_checkForMethod';\nimport _curry3 from './internal/_curry3';\n\n/**\n * Returns the elements of the given list or string (or object with a `slice`\n * method) from `fromIndex` (inclusive) to `toIndex` (exclusive).\n *\n * Dispatches to the `slice` method of the third argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig Number -> Number -> [a] -> [a]\n * @sig Number -> Number -> String -> String\n * @param {Number} fromIndex The start index (inclusive).\n * @param {Number} toIndex The end index (exclusive).\n * @param {*} list\n * @return {*}\n * @example\n *\n *      R.slice(1, 3, ['a', 'b', 'c', 'd']);        //=> ['b', 'c']\n *      R.slice(1, Infinity, ['a', 'b', 'c', 'd']); //=> ['b', 'c', 'd']\n *      R.slice(0, -1, ['a', 'b', 'c', 'd']);       //=> ['a', 'b', 'c']\n *      R.slice(-3, -1, ['a', 'b', 'c', 'd']);      //=> ['b', 'c']\n *      R.slice(0, 3, 'ramda');                     //=> 'ram'\n */\nvar slice = /*#__PURE__*/_curry3( /*#__PURE__*/_checkForMethod('slice', function slice(fromIndex, toIndex, list) {\n  return Array.prototype.slice.call(list, fromIndex, toIndex);\n}));\nexport default slice;","import _checkForMethod from './internal/_checkForMethod';\nimport _curry1 from './internal/_curry1';\nimport slice from './slice';\n\n/**\n * Returns all but the first element of the given list or string (or object\n * with a `tail` method).\n *\n * Dispatches to the `slice` method of the first argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.head, R.init, R.last\n * @example\n *\n *      R.tail([1, 2, 3]);  //=> [2, 3]\n *      R.tail([1, 2]);     //=> [2]\n *      R.tail([1]);        //=> []\n *      R.tail([]);         //=> []\n *\n *      R.tail('abc');  //=> 'bc'\n *      R.tail('ab');   //=> 'b'\n *      R.tail('a');    //=> ''\n *      R.tail('');     //=> ''\n */\nvar tail = /*#__PURE__*/_curry1( /*#__PURE__*/_checkForMethod('tail', /*#__PURE__*/slice(1, Infinity)));\nexport default tail;","import _arity from './internal/_arity';\nimport _pipe from './internal/_pipe';\nimport reduce from './reduce';\nimport tail from './tail';\n\n/**\n * Performs left-to-right function composition. The leftmost function may have\n * any arity; the remaining functions must be unary.\n *\n * In some libraries this function is named `sequence`.\n *\n * **Note:** The result of pipe is not automatically curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (((a, b, ..., n) -> o), (o -> p), ..., (x -> y), (y -> z)) -> ((a, b, ..., n) -> z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.compose\n * @example\n *\n *      var f = R.pipe(Math.pow, R.negate, R.inc);\n *\n *      f(3, 4); // -(3^4) + 1\n * @symb R.pipe(f, g, h)(a, b) = h(g(f(a, b)))\n */\nexport default function pipe() {\n  if (arguments.length === 0) {\n    throw new Error('pipe requires at least one argument');\n  }\n  return _arity(arguments[0].length, reduce(_pipe, arguments[0], tail(arguments)));\n}","import _curry1 from './internal/_curry1';\nimport _isString from './internal/_isString';\n\n/**\n * Returns a new list or string with the elements or characters in reverse\n * order.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {Array|String} list\n * @return {Array|String}\n * @example\n *\n *      R.reverse([1, 2, 3]);  //=> [3, 2, 1]\n *      R.reverse([1, 2]);     //=> [2, 1]\n *      R.reverse([1]);        //=> [1]\n *      R.reverse([]);         //=> []\n *\n *      R.reverse('abc');      //=> 'cba'\n *      R.reverse('ab');       //=> 'ba'\n *      R.reverse('a');        //=> 'a'\n *      R.reverse('');         //=> ''\n */\nvar reverse = /*#__PURE__*/_curry1(function reverse(list) {\n  return _isString(list) ? list.split('').reverse().join('') : Array.prototype.slice.call(list, 0).reverse();\n});\nexport default reverse;","import pipe from './pipe';\nimport reverse from './reverse';\n\n/**\n * Performs right-to-left function composition. The rightmost function may have\n * any arity; the remaining functions must be unary.\n *\n * **Note:** The result of compose is not automatically curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig ((y -> z), (x -> y), ..., (o -> p), ((a, b, ..., n) -> o)) -> ((a, b, ..., n) -> z)\n * @param {...Function} ...functions The functions to compose\n * @return {Function}\n * @see R.pipe\n * @example\n *\n *      var classyGreeting = (firstName, lastName) => \"The name's \" + lastName + \", \" + firstName + \" \" + lastName\n *      var yellGreeting = R.compose(R.toUpper, classyGreeting);\n *      yellGreeting('James', 'Bond'); //=> \"THE NAME'S BOND, JAMES BOND\"\n *\n *      R.compose(Math.abs, R.add(1), R.multiply(2))(-4) //=> 7\n *\n * @symb R.compose(f, g, h)(a, b) = f(g(h(a, b)))\n */\nexport default function compose() {\n  if (arguments.length === 0) {\n    throw new Error('compose requires at least one argument');\n  }\n  return pipe.apply(this, reverse(arguments));\n}","import chain from './chain';\nimport compose from './compose';\nimport map from './map';\n\n/**\n * Returns the right-to-left Kleisli composition of the provided functions,\n * each of which must return a value of a type supported by [`chain`](#chain).\n *\n * `R.composeK(h, g, f)` is equivalent to `R.compose(R.chain(h), R.chain(g), f)`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Function\n * @sig Chain m => ((y -> m z), (x -> m y), ..., (a -> m b)) -> (a -> m z)\n * @param {...Function} ...functions The functions to compose\n * @return {Function}\n * @see R.pipeK\n * @example\n *\n *       //  get :: String -> Object -> Maybe *\n *       var get = R.curry((propName, obj) => Maybe(obj[propName]))\n *\n *       //  getStateCode :: Maybe String -> Maybe String\n *       var getStateCode = R.composeK(\n *         R.compose(Maybe.of, R.toUpper),\n *         get('state'),\n *         get('address'),\n *         get('user'),\n *       );\n *       getStateCode({\"user\":{\"address\":{\"state\":\"ny\"}}}); //=> Maybe.Just(\"NY\")\n *       getStateCode({}); //=> Maybe.Nothing()\n * @symb R.composeK(f, g, h)(a) = R.chain(f, R.chain(g, h(a)))\n */\nexport default function composeK() {\n  if (arguments.length === 0) {\n    throw new Error('composeK requires at least one argument');\n  }\n  var init = Array.prototype.slice.call(arguments);\n  var last = init.pop();\n  return compose(compose.apply(this, map(chain, init)), last);\n}","export default function _pipeP(f, g) {\n  return function () {\n    var ctx = this;\n    return f.apply(ctx, arguments).then(function (x) {\n      return g.call(ctx, x);\n    });\n  };\n}","import _arity from './internal/_arity';\nimport _pipeP from './internal/_pipeP';\nimport reduce from './reduce';\nimport tail from './tail';\n\n/**\n * Performs left-to-right composition of one or more Promise-returning\n * functions. The leftmost function may have any arity; the remaining functions\n * must be unary.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a -> Promise b), (b -> Promise c), ..., (y -> Promise z)) -> (a -> Promise z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.composeP\n * @example\n *\n *      //  followersForUser :: String -> Promise [User]\n *      var followersForUser = R.pipeP(db.getUserById, db.getFollowers);\n */\nexport default function pipeP() {\n  if (arguments.length === 0) {\n    throw new Error('pipeP requires at least one argument');\n  }\n  return _arity(arguments[0].length, reduce(_pipeP, arguments[0], tail(arguments)));\n}","import pipeP from './pipeP';\nimport reverse from './reverse';\n\n/**\n * Performs right-to-left composition of one or more Promise-returning\n * functions. The rightmost function may have any arity; the remaining\n * functions must be unary.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((y -> Promise z), (x -> Promise y), ..., (a -> Promise b)) -> (a -> Promise z)\n * @param {...Function} functions The functions to compose\n * @return {Function}\n * @see R.pipeP\n * @example\n *\n *      var db = {\n *        users: {\n *          JOE: {\n *            name: 'Joe',\n *            followers: ['STEVE', 'SUZY']\n *          }\n *        }\n *      }\n *\n *      // We'll pretend to do a db lookup which returns a promise\n *      var lookupUser = (userId) => Promise.resolve(db.users[userId])\n *      var lookupFollowers = (user) => Promise.resolve(user.followers)\n *      lookupUser('JOE').then(lookupFollowers)\n *\n *      //  followersForUser :: String -> Promise [UserId]\n *      var followersForUser = R.composeP(lookupFollowers, lookupUser);\n *      followersForUser('JOE').then(followers => console.log('Followers:', followers))\n *      // Followers: [\"STEVE\",\"SUZY\"]\n */\nexport default function composeP() {\n  if (arguments.length === 0) {\n    throw new Error('composeP requires at least one argument');\n  }\n  return pipeP.apply(this, reverse(arguments));\n}","export default function _arrayFromIterator(iter) {\n  var list = [];\n  var next;\n  while (!(next = iter.next()).done) {\n    list.push(next.value);\n  }\n  return list;\n}","export default function _containsWith(pred, x, list) {\n  var idx = 0;\n  var len = list.length;\n\n  while (idx < len) {\n    if (pred(x, list[idx])) {\n      return true;\n    }\n    idx += 1;\n  }\n  return false;\n}","import _curry2 from './internal/_curry2';\n\n/**\n * Returns true if its arguments are identical, false otherwise. Values are\n * identical if they reference the same memory. `NaN` is identical to `NaN`;\n * `0` and `-0` are not identical.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n *      var o = {};\n *      R.identical(o, o); //=> true\n *      R.identical(1, 1); //=> true\n *      R.identical(1, '1'); //=> false\n *      R.identical([], []); //=> false\n *      R.identical(0, -0); //=> false\n *      R.identical(NaN, NaN); //=> true\n */\nvar identical = /*#__PURE__*/_curry2(function identical(a, b) {\n  // SameValue algorithm\n  if (a === b) {\n    // Steps 1-5, 7-10\n    // Steps 6.b-6.e: +0 != -0\n    return a !== 0 || 1 / a === 1 / b;\n  } else {\n    // Step 6.a: NaN == NaN\n    return a !== a && b !== b;\n  }\n});\nexport default identical;","import _arrayFromIterator from './_arrayFromIterator';\nimport _containsWith from './_containsWith';\nimport _functionName from './_functionName';\nimport _has from './_has';\nimport identical from '../identical';\nimport keys from '../keys';\nimport type from '../type';\n\n/**\n * private _uniqContentEquals function.\n * That function is checking equality of 2 iterator contents with 2 assumptions\n * - iterators lengths are the same\n * - iterators values are unique\n *\n * false-positive result will be returned for comparision of, e.g.\n * - [1,2,3] and [1,2,3,4]\n * - [1,1,1] and [1,2,3]\n * */\n\nfunction _uniqContentEquals(aIterator, bIterator, stackA, stackB) {\n  var a = _arrayFromIterator(aIterator);\n  var b = _arrayFromIterator(bIterator);\n\n  function eq(_a, _b) {\n    return _equals(_a, _b, stackA.slice(), stackB.slice());\n  }\n\n  // if *a* array contains any element that is not included in *b*\n  return !_containsWith(function (b, aItem) {\n    return !_containsWith(eq, aItem, b);\n  }, b, a);\n}\n\nexport default function _equals(a, b, stackA, stackB) {\n  if (identical(a, b)) {\n    return true;\n  }\n\n  var typeA = type(a);\n\n  if (typeA !== type(b)) {\n    return false;\n  }\n\n  if (a == null || b == null) {\n    return false;\n  }\n\n  if (typeof a['fantasy-land/equals'] === 'function' || typeof b['fantasy-land/equals'] === 'function') {\n    return typeof a['fantasy-land/equals'] === 'function' && a['fantasy-land/equals'](b) && typeof b['fantasy-land/equals'] === 'function' && b['fantasy-land/equals'](a);\n  }\n\n  if (typeof a.equals === 'function' || typeof b.equals === 'function') {\n    return typeof a.equals === 'function' && a.equals(b) && typeof b.equals === 'function' && b.equals(a);\n  }\n\n  switch (typeA) {\n    case 'Arguments':\n    case 'Array':\n    case 'Object':\n      if (typeof a.constructor === 'function' && _functionName(a.constructor) === 'Promise') {\n        return a === b;\n      }\n      break;\n    case 'Boolean':\n    case 'Number':\n    case 'String':\n      if (!(typeof a === typeof b && identical(a.valueOf(), b.valueOf()))) {\n        return false;\n      }\n      break;\n    case 'Date':\n      if (!identical(a.valueOf(), b.valueOf())) {\n        return false;\n      }\n      break;\n    case 'Error':\n      return a.name === b.name && a.message === b.message;\n    case 'RegExp':\n      if (!(a.source === b.source && a.global === b.global && a.ignoreCase === b.ignoreCase && a.multiline === b.multiline && a.sticky === b.sticky && a.unicode === b.unicode)) {\n        return false;\n      }\n      break;\n  }\n\n  var idx = stackA.length - 1;\n  while (idx >= 0) {\n    if (stackA[idx] === a) {\n      return stackB[idx] === b;\n    }\n    idx -= 1;\n  }\n\n  switch (typeA) {\n    case 'Map':\n      if (a.size !== b.size) {\n        return false;\n      }\n\n      return _uniqContentEquals(a.entries(), b.entries(), stackA.concat([a]), stackB.concat([b]));\n    case 'Set':\n      if (a.size !== b.size) {\n        return false;\n      }\n\n      return _uniqContentEquals(a.values(), b.values(), stackA.concat([a]), stackB.concat([b]));\n    case 'Arguments':\n    case 'Array':\n    case 'Object':\n    case 'Boolean':\n    case 'Number':\n    case 'String':\n    case 'Date':\n    case 'Error':\n    case 'RegExp':\n    case 'Int8Array':\n    case 'Uint8Array':\n    case 'Uint8ClampedArray':\n    case 'Int16Array':\n    case 'Uint16Array':\n    case 'Int32Array':\n    case 'Uint32Array':\n    case 'Float32Array':\n    case 'Float64Array':\n    case 'ArrayBuffer':\n      break;\n    default:\n      // Values of other types are only equal if identical.\n      return false;\n  }\n\n  var keysA = keys(a);\n  if (keysA.length !== keys(b).length) {\n    return false;\n  }\n\n  var extendedStackA = stackA.concat([a]);\n  var extendedStackB = stackB.concat([b]);\n\n  idx = keysA.length - 1;\n  while (idx >= 0) {\n    var key = keysA[idx];\n    if (!(_has(key, b) && _equals(b[key], a[key], extendedStackA, extendedStackB))) {\n      return false;\n    }\n    idx -= 1;\n  }\n  return true;\n}","export default function _functionName(f) {\n  // String(x => x) evaluates to \"x => x\", so the pattern may not match.\n  var match = String(f).match(/^function (\\w*)/);\n  return match == null ? '' : match[1];\n}","import _curry2 from './internal/_curry2';\nimport _equals from './internal/_equals';\n\n/**\n * Returns `true` if its arguments are equivalent, `false` otherwise. Handles\n * cyclical data structures.\n *\n * Dispatches symmetrically to the `equals` methods of both arguments, if\n * present.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> b -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n *      R.equals(1, 1); //=> true\n *      R.equals(1, '1'); //=> false\n *      R.equals([1, 2, 3], [1, 2, 3]); //=> true\n *\n *      var a = {}; a.v = a;\n *      var b = {}; b.v = b;\n *      R.equals(a, b); //=> true\n */\nvar equals = /*#__PURE__*/_curry2(function equals(a, b) {\n  return _equals(a, b, [], []);\n});\nexport default equals;","import equals from '../equals';\n\nexport default function _indexOf(list, a, idx) {\n  var inf, item;\n  // Array.prototype.indexOf doesn't exist below IE9\n  if (typeof list.indexOf === 'function') {\n    switch (typeof a) {\n      case 'number':\n        if (a === 0) {\n          // manually crawl the list to distinguish between +0 and -0\n          inf = 1 / a;\n          while (idx < list.length) {\n            item = list[idx];\n            if (item === 0 && 1 / item === inf) {\n              return idx;\n            }\n            idx += 1;\n          }\n          return -1;\n        } else if (a !== a) {\n          // NaN\n          while (idx < list.length) {\n            item = list[idx];\n            if (typeof item === 'number' && item !== item) {\n              return idx;\n            }\n            idx += 1;\n          }\n          return -1;\n        }\n        // non-zero numbers can utilise Set\n        return list.indexOf(a, idx);\n\n      // all these types can utilise Set\n      case 'string':\n      case 'boolean':\n      case 'function':\n      case 'undefined':\n        return list.indexOf(a, idx);\n\n      case 'object':\n        if (a === null) {\n          // null can utilise Set\n          return list.indexOf(a, idx);\n        }\n    }\n  }\n  // anything else not covered above, defer to R.equals\n  while (idx < list.length) {\n    if (equals(list[idx], a)) {\n      return idx;\n    }\n    idx += 1;\n  }\n  return -1;\n}","import _indexOf from './_indexOf';\n\nexport default function _contains(a, list) {\n  return _indexOf(list, a, 0) >= 0;\n}","export default function _quote(s) {\n  var escaped = s.replace(/\\\\/g, '\\\\\\\\').replace(/[\\b]/g, '\\\\b') // \\b matches word boundary; [\\b] matches backspace\n  .replace(/\\f/g, '\\\\f').replace(/\\n/g, '\\\\n').replace(/\\r/g, '\\\\r').replace(/\\t/g, '\\\\t').replace(/\\v/g, '\\\\v').replace(/\\0/g, '\\\\0');\n\n  return '\"' + escaped.replace(/\"/g, '\\\\\"') + '\"';\n}","/**\n * Polyfill from <https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toISOString>.\n */\nvar pad = function pad(n) {\n  return (n < 10 ? '0' : '') + n;\n};\n\nvar _toISOString = typeof Date.prototype.toISOString === 'function' ? function _toISOString(d) {\n  return d.toISOString();\n} : function _toISOString(d) {\n  return d.getUTCFullYear() + '-' + pad(d.getUTCMonth() + 1) + '-' + pad(d.getUTCDate()) + 'T' + pad(d.getUTCHours()) + ':' + pad(d.getUTCMinutes()) + ':' + pad(d.getUTCSeconds()) + '.' + (d.getUTCMilliseconds() / 1000).toFixed(3).slice(2, 5) + 'Z';\n};\n\nexport default _toISOString;","export default function _complement(f) {\n  return function () {\n    return !f.apply(this, arguments);\n  };\n}","export default function _filter(fn, list) {\n  var idx = 0;\n  var len = list.length;\n  var result = [];\n\n  while (idx < len) {\n    if (fn(list[idx])) {\n      result[result.length] = list[idx];\n    }\n    idx += 1;\n  }\n  return result;\n}","export default function _isObject(x) {\n  return Object.prototype.toString.call(x) === '[object Object]';\n}","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XFilter = /*#__PURE__*/function () {\n  function XFilter(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XFilter.prototype['@@transducer/init'] = _xfBase.init;\n  XFilter.prototype['@@transducer/result'] = _xfBase.result;\n  XFilter.prototype['@@transducer/step'] = function (result, input) {\n    return this.f(input) ? this.xf['@@transducer/step'](result, input) : result;\n  };\n\n  return XFilter;\n}();\n\nvar _xfilter = /*#__PURE__*/_curry2(function _xfilter(f, xf) {\n  return new XFilter(f, xf);\n});\nexport default _xfilter;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _filter from './internal/_filter';\nimport _isObject from './internal/_isObject';\nimport _reduce from './internal/_reduce';\nimport _xfilter from './internal/_xfilter';\nimport keys from './keys';\n\n/**\n * Takes a predicate and a `Filterable`, and returns a new filterable of the\n * same type containing the members of the given filterable which satisfy the\n * given predicate. Filterable objects include plain objects or any object\n * that has a filter method such as `Array`.\n *\n * Dispatches to the `filter` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> f a\n * @param {Function} pred\n * @param {Array} filterable\n * @return {Array} Filterable\n * @see R.reject, R.transduce, R.addIndex\n * @example\n *\n *      var isEven = n => n % 2 === 0;\n *\n *      R.filter(isEven, [1, 2, 3, 4]); //=> [2, 4]\n *\n *      R.filter(isEven, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}\n */\nvar filter = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['filter'], _xfilter, function (pred, filterable) {\n  return _isObject(filterable) ? _reduce(function (acc, key) {\n    if (pred(filterable[key])) {\n      acc[key] = filterable[key];\n    }\n    return acc;\n  }, {}, keys(filterable)) :\n  // else\n  _filter(pred, filterable);\n}));\nexport default filter;","import _complement from './internal/_complement';\nimport _curry2 from './internal/_curry2';\nimport filter from './filter';\n\n/**\n * The complement of [`filter`](#filter).\n *\n * Acts as a transducer if a transformer is given in list position. Filterable\n * objects include plain objects or any object that has a filter method such\n * as `Array`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> f a\n * @param {Function} pred\n * @param {Array} filterable\n * @return {Array}\n * @see R.filter, R.transduce, R.addIndex\n * @example\n *\n *      var isOdd = (n) => n % 2 === 1;\n *\n *      R.reject(isOdd, [1, 2, 3, 4]); //=> [2, 4]\n *\n *      R.reject(isOdd, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}\n */\nvar reject = /*#__PURE__*/_curry2(function reject(pred, filterable) {\n  return filter(_complement(pred), filterable);\n});\nexport default reject;","import _curry1 from './internal/_curry1';\nimport _toString from './internal/_toString';\n\n/**\n * Returns the string representation of the given value. `eval`'ing the output\n * should result in a value equivalent to the input value. Many of the built-in\n * `toString` methods do not satisfy this requirement.\n *\n * If the given value is an `[object Object]` with a `toString` method other\n * than `Object.prototype.toString`, this method is invoked with no arguments\n * to produce the return value. This means user-defined constructor functions\n * can provide a suitable `toString` method. For example:\n *\n *     function Point(x, y) {\n *       this.x = x;\n *       this.y = y;\n *     }\n *\n *     Point.prototype.toString = function() {\n *       return 'new Point(' + this.x + ', ' + this.y + ')';\n *     };\n *\n *     R.toString(new Point(1, 2)); //=> 'new Point(1, 2)'\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category String\n * @sig * -> String\n * @param {*} val\n * @return {String}\n * @example\n *\n *      R.toString(42); //=> '42'\n *      R.toString('abc'); //=> '\"abc\"'\n *      R.toString([1, 2, 3]); //=> '[1, 2, 3]'\n *      R.toString({foo: 1, bar: 2, baz: 3}); //=> '{\"bar\": 2, \"baz\": 3, \"foo\": 1}'\n *      R.toString(new Date('2001-02-03T04:05:06Z')); //=> 'new Date(\"2001-02-03T04:05:06.000Z\")'\n */\nvar toString = /*#__PURE__*/_curry1(function toString(val) {\n  return _toString(val, []);\n});\nexport default toString;","import _contains from './_contains';\nimport _map from './_map';\nimport _quote from './_quote';\nimport _toISOString from './_toISOString';\nimport keys from '../keys';\nimport reject from '../reject';\n\nexport default function _toString(x, seen) {\n  var recur = function recur(y) {\n    var xs = seen.concat([x]);\n    return _contains(y, xs) ? '<Circular>' : _toString(y, xs);\n  };\n\n  //  mapPairs :: (Object, [String]) -> [String]\n  var mapPairs = function (obj, keys) {\n    return _map(function (k) {\n      return _quote(k) + ': ' + recur(obj[k]);\n    }, keys.slice().sort());\n  };\n\n  switch (Object.prototype.toString.call(x)) {\n    case '[object Arguments]':\n      return '(function() { return arguments; }(' + _map(recur, x).join(', ') + '))';\n    case '[object Array]':\n      return '[' + _map(recur, x).concat(mapPairs(x, reject(function (k) {\n        return (/^\\d+$/.test(k)\n        );\n      }, keys(x)))).join(', ') + ']';\n    case '[object Boolean]':\n      return typeof x === 'object' ? 'new Boolean(' + recur(x.valueOf()) + ')' : x.toString();\n    case '[object Date]':\n      return 'new Date(' + (isNaN(x.valueOf()) ? recur(NaN) : _quote(_toISOString(x))) + ')';\n    case '[object Null]':\n      return 'null';\n    case '[object Number]':\n      return typeof x === 'object' ? 'new Number(' + recur(x.valueOf()) + ')' : 1 / x === -Infinity ? '-0' : x.toString(10);\n    case '[object String]':\n      return typeof x === 'object' ? 'new String(' + recur(x.valueOf()) + ')' : _quote(x);\n    case '[object Undefined]':\n      return 'undefined';\n    default:\n      if (typeof x.toString === 'function') {\n        var repr = x.toString();\n        if (repr !== '[object Object]') {\n          return repr;\n        }\n      }\n      return '{' + mapPairs(x, keys(x)).join(', ') + '}';\n  }\n}","import _curry2 from './internal/_curry2';\nimport _isArray from './internal/_isArray';\nimport _isFunction from './internal/_isFunction';\nimport _isString from './internal/_isString';\nimport toString from './toString';\n\n/**\n * Returns the result of concatenating the given lists or strings.\n *\n * Note: `R.concat` expects both arguments to be of the same type,\n * unlike the native `Array.prototype.concat` method. It will throw\n * an error if you `concat` an Array with a non-Array value.\n *\n * Dispatches to the `concat` method of the first argument, if present.\n * Can also concatenate two members of a [fantasy-land\n * compatible semigroup](https://github.com/fantasyland/fantasy-land#semigroup).\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a] -> [a]\n * @sig String -> String -> String\n * @param {Array|String} firstList The first list\n * @param {Array|String} secondList The second list\n * @return {Array|String} A list consisting of the elements of `firstList` followed by the elements of\n * `secondList`.\n *\n * @example\n *\n *      R.concat('ABC', 'DEF'); // 'ABCDEF'\n *      R.concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]\n *      R.concat([], []); //=> []\n */\nvar concat = /*#__PURE__*/_curry2(function concat(a, b) {\n  if (_isArray(a)) {\n    if (_isArray(b)) {\n      return a.concat(b);\n    }\n    throw new TypeError(toString(b) + ' is not an array');\n  }\n  if (_isString(a)) {\n    if (_isString(b)) {\n      return a + b;\n    }\n    throw new TypeError(toString(b) + ' is not a string');\n  }\n  if (a != null && _isFunction(a['fantasy-land/concat'])) {\n    return a['fantasy-land/concat'](b);\n  }\n  if (a != null && _isFunction(a.concat)) {\n    return a.concat(b);\n  }\n  throw new TypeError(toString(a) + ' does not have a method named \"concat\" or \"fantasy-land/concat\"');\n});\nexport default concat;","import _arity from './internal/_arity';\nimport _curry1 from './internal/_curry1';\nimport map from './map';\nimport max from './max';\nimport reduce from './reduce';\n\n/**\n * Returns a function, `fn`, which encapsulates `if/else, if/else, ...` logic.\n * `R.cond` takes a list of [predicate, transformer] pairs. All of the arguments\n * to `fn` are applied to each of the predicates in turn until one returns a\n * \"truthy\" value, at which point `fn` returns the result of applying its\n * arguments to the corresponding transformer. If none of the predicates\n * matches, `fn` returns undefined.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Logic\n * @sig [[(*... -> Boolean),(*... -> *)]] -> (*... -> *)\n * @param {Array} pairs A list of [predicate, transformer]\n * @return {Function}\n * @example\n *\n *      var fn = R.cond([\n *        [R.equals(0),   R.always('water freezes at 0°C')],\n *        [R.equals(100), R.always('water boils at 100°C')],\n *        [R.T,           temp => 'nothing special happens at ' + temp + '°C']\n *      ]);\n *      fn(0); //=> 'water freezes at 0°C'\n *      fn(50); //=> 'nothing special happens at 50°C'\n *      fn(100); //=> 'water boils at 100°C'\n */\nvar cond = /*#__PURE__*/_curry1(function cond(pairs) {\n  var arity = reduce(max, 0, map(function (pair) {\n    return pair[0].length;\n  }, pairs));\n  return _arity(arity, function () {\n    var idx = 0;\n    while (idx < pairs.length) {\n      if (pairs[idx][0].apply(this, arguments)) {\n        return pairs[idx][1].apply(this, arguments);\n      }\n      idx += 1;\n    }\n  });\n});\nexport default cond;","import _curry2 from './internal/_curry2';\nimport curry from './curry';\nimport nAry from './nAry';\n\n/**\n * Wraps a constructor function inside a curried function that can be called\n * with the same arguments and returns the same type. The arity of the function\n * returned is specified to allow using variadic constructor functions.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Function\n * @sig Number -> (* -> {*}) -> (* -> {*})\n * @param {Number} n The arity of the constructor function.\n * @param {Function} Fn The constructor function to wrap.\n * @return {Function} A wrapped, curried constructor function.\n * @example\n *\n *      // Variadic Constructor function\n *      function Salad() {\n *        this.ingredients = arguments;\n *      }\n *\n *      Salad.prototype.recipe = function() {\n *        var instructions = R.map(ingredient => 'Add a dollop of ' + ingredient, this.ingredients);\n *        return R.join('\\n', instructions);\n *      };\n *\n *      var ThreeLayerSalad = R.constructN(3, Salad);\n *\n *      // Notice we no longer need the 'new' keyword, and the constructor is curried for 3 arguments.\n *      var salad = ThreeLayerSalad('Mayonnaise')('Potato Chips')('Ketchup');\n *\n *      console.log(salad.recipe());\n *      // Add a dollop of Mayonnaise\n *      // Add a dollop of Potato Chips\n *      // Add a dollop of Ketchup\n */\nvar constructN = /*#__PURE__*/_curry2(function constructN(n, Fn) {\n  if (n > 10) {\n    throw new Error('Constructor with greater than ten arguments');\n  }\n  if (n === 0) {\n    return function () {\n      return new Fn();\n    };\n  }\n  return curry(nAry(n, function ($0, $1, $2, $3, $4, $5, $6, $7, $8, $9) {\n    switch (arguments.length) {\n      case 1:\n        return new Fn($0);\n      case 2:\n        return new Fn($0, $1);\n      case 3:\n        return new Fn($0, $1, $2);\n      case 4:\n        return new Fn($0, $1, $2, $3);\n      case 5:\n        return new Fn($0, $1, $2, $3, $4);\n      case 6:\n        return new Fn($0, $1, $2, $3, $4, $5);\n      case 7:\n        return new Fn($0, $1, $2, $3, $4, $5, $6);\n      case 8:\n        return new Fn($0, $1, $2, $3, $4, $5, $6, $7);\n      case 9:\n        return new Fn($0, $1, $2, $3, $4, $5, $6, $7, $8);\n      case 10:\n        return new Fn($0, $1, $2, $3, $4, $5, $6, $7, $8, $9);\n    }\n  }));\n});\nexport default constructN;","import _curry1 from './internal/_curry1';\nimport constructN from './constructN';\n\n/**\n * Wraps a constructor function inside a curried function that can be called\n * with the same arguments and returns the same type.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (* -> {*}) -> (* -> {*})\n * @param {Function} fn The constructor function to wrap.\n * @return {Function} A wrapped, curried constructor function.\n * @see R.invoker\n * @example\n *\n *      // Constructor function\n *      function Animal(kind) {\n *        this.kind = kind;\n *      };\n *      Animal.prototype.sighting = function() {\n *        return \"It's a \" + this.kind + \"!\";\n *      }\n *\n *      var AnimalConstructor = R.construct(Animal)\n *\n *      // Notice we no longer need the 'new' keyword:\n *      AnimalConstructor('Pig'); //=> {\"kind\": \"Pig\", \"sighting\": function (){...}};\n *\n *      var animalTypes = [\"Lion\", \"Tiger\", \"Bear\"];\n *      var animalSighting = R.invoker(0, 'sighting');\n *      var sightNewAnimal = R.compose(animalSighting, AnimalConstructor);\n *      R.map(sightNewAnimal, animalTypes); //=> [\"It's a Lion!\", \"It's a Tiger!\", \"It's a Bear!\"]\n */\nvar construct = /*#__PURE__*/_curry1(function construct(Fn) {\n  return constructN(Fn.length, Fn);\n});\nexport default construct;","import _contains from './internal/_contains';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if the specified value is equal, in [`R.equals`](#equals)\n * terms, to at least one element of the given list; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Boolean\n * @param {Object} a The item to compare against.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if an equivalent item is in the list, `false` otherwise.\n * @see R.any\n * @example\n *\n *      R.contains(3, [1, 2, 3]); //=> true\n *      R.contains(4, [1, 2, 3]); //=> false\n *      R.contains({ name: 'Fred' }, [{ name: 'Fred' }]); //=> true\n *      R.contains([42], [[42]]); //=> true\n */\nvar contains = /*#__PURE__*/_curry2(_contains);\nexport default contains;","import _curry2 from './internal/_curry2';\nimport _map from './internal/_map';\nimport curryN from './curryN';\nimport max from './max';\nimport pluck from './pluck';\nimport reduce from './reduce';\n\n/**\n * Accepts a converging function and a list of branching functions and returns\n * a new function. When invoked, this new function is applied to some\n * arguments, each branching function is applied to those same arguments. The\n * results of each branching function are passed as arguments to the converging\n * function to produce the return value.\n *\n * @func\n * @memberOf R\n * @since v0.4.2\n * @category Function\n * @sig ((x1, x2, ...) -> z) -> [((a, b, ...) -> x1), ((a, b, ...) -> x2), ...] -> (a -> b -> ... -> z)\n * @param {Function} after A function. `after` will be invoked with the return values of\n *        `fn1` and `fn2` as its arguments.\n * @param {Array} functions A list of functions.\n * @return {Function} A new function.\n * @see R.useWith\n * @example\n *\n *      var average = R.converge(R.divide, [R.sum, R.length])\n *      average([1, 2, 3, 4, 5, 6, 7]) //=> 4\n *\n *      var strangeConcat = R.converge(R.concat, [R.toUpper, R.toLower])\n *      strangeConcat(\"Yodel\") //=> \"YODELyodel\"\n *\n * @symb R.converge(f, [g, h])(a, b) = f(g(a, b), h(a, b))\n */\nvar converge = /*#__PURE__*/_curry2(function converge(after, fns) {\n  return curryN(reduce(max, 0, pluck('length', fns)), function () {\n    var args = arguments;\n    var context = this;\n    return after.apply(context, _map(function (fn) {\n      return fn.apply(context, args);\n    }, fns));\n  });\n});\nexport default converge;","import _curryN from './_curryN';\nimport _has from './_has';\nimport _xfBase from './_xfBase';\n\nvar XReduceBy = /*#__PURE__*/function () {\n  function XReduceBy(valueFn, valueAcc, keyFn, xf) {\n    this.valueFn = valueFn;\n    this.valueAcc = valueAcc;\n    this.keyFn = keyFn;\n    this.xf = xf;\n    this.inputs = {};\n  }\n  XReduceBy.prototype['@@transducer/init'] = _xfBase.init;\n  XReduceBy.prototype['@@transducer/result'] = function (result) {\n    var key;\n    for (key in this.inputs) {\n      if (_has(key, this.inputs)) {\n        result = this.xf['@@transducer/step'](result, this.inputs[key]);\n        if (result['@@transducer/reduced']) {\n          result = result['@@transducer/value'];\n          break;\n        }\n      }\n    }\n    this.inputs = null;\n    return this.xf['@@transducer/result'](result);\n  };\n  XReduceBy.prototype['@@transducer/step'] = function (result, input) {\n    var key = this.keyFn(input);\n    this.inputs[key] = this.inputs[key] || [key, this.valueAcc];\n    this.inputs[key][1] = this.valueFn(this.inputs[key][1], input);\n    return result;\n  };\n\n  return XReduceBy;\n}();\n\nvar _xreduceBy = /*#__PURE__*/_curryN(4, [], function _xreduceBy(valueFn, valueAcc, keyFn, xf) {\n  return new XReduceBy(valueFn, valueAcc, keyFn, xf);\n});\nexport default _xreduceBy;","import _curryN from './internal/_curryN';\nimport _dispatchable from './internal/_dispatchable';\nimport _has from './internal/_has';\nimport _reduce from './internal/_reduce';\nimport _xreduceBy from './internal/_xreduceBy';\n\n/**\n * Groups the elements of the list according to the result of calling\n * the String-returning function `keyFn` on each element and reduces the elements\n * of each group to a single value via the reducer function `valueFn`.\n *\n * This function is basically a more general [`groupBy`](#groupBy) function.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category List\n * @sig ((a, b) -> a) -> a -> (b -> String) -> [b] -> {String: a}\n * @param {Function} valueFn The function that reduces the elements of each group to a single\n *        value. Receives two values, accumulator for a particular group and the current element.\n * @param {*} acc The (initial) accumulator value for each group.\n * @param {Function} keyFn The function that maps the list's element into a key.\n * @param {Array} list The array to group.\n * @return {Object} An object with the output of `keyFn` for keys, mapped to the output of\n *         `valueFn` for elements which produced that key when passed to `keyFn`.\n * @see R.groupBy, R.reduce\n * @example\n *\n *      var reduceToNamesBy = R.reduceBy((acc, student) => acc.concat(student.name), []);\n *      var namesByGrade = reduceToNamesBy(function(student) {\n *        var score = student.score;\n *        return score < 65 ? 'F' :\n *               score < 70 ? 'D' :\n *               score < 80 ? 'C' :\n *               score < 90 ? 'B' : 'A';\n *      });\n *      var students = [{name: 'Lucy', score: 92},\n *                      {name: 'Drew', score: 85},\n *                      // ...\n *                      {name: 'Bart', score: 62}];\n *      namesByGrade(students);\n *      // {\n *      //   'A': ['Lucy'],\n *      //   'B': ['Drew']\n *      //   // ...,\n *      //   'F': ['Bart']\n *      // }\n */\nvar reduceBy = /*#__PURE__*/_curryN(4, [], /*#__PURE__*/_dispatchable([], _xreduceBy, function reduceBy(valueFn, valueAcc, keyFn, list) {\n  return _reduce(function (acc, elt) {\n    var key = keyFn(elt);\n    acc[key] = valueFn(_has(key, acc) ? acc[key] : valueAcc, elt);\n    return acc;\n  }, {}, list);\n}));\nexport default reduceBy;","import reduceBy from './reduceBy';\n\n/**\n * Counts the elements of a list according to how many match each value of a\n * key generated by the supplied function. Returns an object mapping the keys\n * produced by `fn` to the number of occurrences in the list. Note that all\n * keys are coerced to strings because of how JavaScript objects work.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig (a -> String) -> [a] -> {*}\n * @param {Function} fn The function used to map values to keys.\n * @param {Array} list The list to count elements from.\n * @return {Object} An object mapping keys to number of occurrences in the list.\n * @example\n *\n *      var numbers = [1.0, 1.1, 1.2, 2.0, 3.0, 2.2];\n *      R.countBy(Math.floor)(numbers);    //=> {'1': 3, '2': 2, '3': 1}\n *\n *      var letters = ['a', 'b', 'A', 'a', 'B', 'c'];\n *      R.countBy(R.toLower)(letters);   //=> {'a': 3, 'b': 2, 'c': 1}\n */\nvar countBy = /*#__PURE__*/reduceBy(function (acc, elem) {\n  return acc + 1;\n}, 0);\nexport default countBy;","import add from './add';\n\n/**\n * Decrements its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number} n - 1\n * @see R.inc\n * @example\n *\n *      R.dec(42); //=> 41\n */\nvar dec = /*#__PURE__*/add(-1);\nexport default dec;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns the second argument if it is not `null`, `undefined` or `NaN`;\n * otherwise the first argument is returned.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Logic\n * @sig a -> b -> a | b\n * @param {a} default The default value.\n * @param {b} val `val` will be returned instead of `default` unless `val` is `null`, `undefined` or `NaN`.\n * @return {*} The second value if it is not `null`, `undefined` or `NaN`, otherwise the default value\n * @example\n *\n *      var defaultTo42 = R.defaultTo(42);\n *\n *      defaultTo42(null);  //=> 42\n *      defaultTo42(undefined);  //=> 42\n *      defaultTo42('Ramda');  //=> 'Ramda'\n *      // parseInt('string') results in NaN\n *      defaultTo42(parseInt('string')); //=> 42\n */\nvar defaultTo = /*#__PURE__*/_curry2(function defaultTo(d, v) {\n  return v == null || v !== v ? d : v;\n});\nexport default defaultTo;","import _curry3 from './internal/_curry3';\n\n/**\n * Makes a descending comparator function out of a function that returns a value\n * that can be compared with `<` and `>`.\n *\n * @func\n * @memberOf R\n * @since v0.23.0\n * @category Function\n * @sig Ord b => (a -> b) -> a -> a -> Number\n * @param {Function} fn A function of arity one that returns a value that can be compared\n * @param {*} a The first item to be compared.\n * @param {*} b The second item to be compared.\n * @return {Number} `-1` if fn(a) > fn(b), `1` if fn(b) > fn(a), otherwise `0`\n * @see R.ascend\n * @example\n *\n *      var byAge = R.descend(R.prop('age'));\n *      var people = [\n *        // ...\n *      ];\n *      var peopleByOldestFirst = R.sort(byAge, people);\n */\nvar descend = /*#__PURE__*/_curry3(function descend(fn, a, b) {\n  var aa = fn(a);\n  var bb = fn(b);\n  return aa > bb ? -1 : aa < bb ? 1 : 0;\n});\nexport default descend;","import _contains from './internal/_contains';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Finds the set (i.e. no duplicates) of all elements in the first list not\n * contained in the second list. Objects and Arrays are compared in terms of\n * value equality, not reference equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` that are not in `list2`.\n * @see R.differenceWith, R.symmetricDifference, R.symmetricDifferenceWith, R.without\n * @example\n *\n *      R.difference([1,2,3,4], [7,6,5,4,3]); //=> [1,2]\n *      R.difference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5]\n *      R.difference([{a: 1}, {b: 2}], [{a: 1}, {c: 3}]) //=> [{b: 2}]\n */\nvar difference = /*#__PURE__*/_curry2(function difference(first, second) {\n  var out = [];\n  var idx = 0;\n  var firstLen = first.length;\n  while (idx < firstLen) {\n    if (!_contains(first[idx], second) && !_contains(first[idx], out)) {\n      out[out.length] = first[idx];\n    }\n    idx += 1;\n  }\n  return out;\n});\nexport default difference;","import _containsWith from './internal/_containsWith';\nimport _curry3 from './internal/_curry3';\n\n/**\n * Finds the set (i.e. no duplicates) of all elements in the first list not\n * contained in the second list. Duplication is determined according to the\n * value returned by applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig ((a, a) -> Boolean) -> [a] -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` that are not in `list2`.\n * @see R.difference, R.symmetricDifference, R.symmetricDifferenceWith\n * @example\n *\n *      var cmp = (x, y) => x.a === y.a;\n *      var l1 = [{a: 1}, {a: 2}, {a: 3}];\n *      var l2 = [{a: 3}, {a: 4}];\n *      R.differenceWith(cmp, l1, l2); //=> [{a: 1}, {a: 2}]\n */\nvar differenceWith = /*#__PURE__*/_curry3(function differenceWith(pred, first, second) {\n  var out = [];\n  var idx = 0;\n  var firstLen = first.length;\n  while (idx < firstLen) {\n    if (!_containsWith(pred, first[idx], second) && !_containsWith(pred, first[idx], out)) {\n      out.push(first[idx]);\n    }\n    idx += 1;\n  }\n  return out;\n});\nexport default differenceWith;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns a new object that does not contain a `prop` property.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Object\n * @sig String -> {k: v} -> {k: v}\n * @param {String} prop The name of the property to dissociate\n * @param {Object} obj The object to clone\n * @return {Object} A new object equivalent to the original but without the specified property\n * @see R.assoc\n * @example\n *\n *      R.dissoc('b', {a: 1, b: 2, c: 3}); //=> {a: 1, c: 3}\n */\nvar dissoc = /*#__PURE__*/_curry2(function dissoc(prop, obj) {\n  var result = {};\n  for (var p in obj) {\n    result[p] = obj[p];\n  }\n  delete result[prop];\n  return result;\n});\nexport default dissoc;","import _curry3 from './internal/_curry3';\n\n/**\n * Removes the sub-list of `list` starting at index `start` and containing\n * `count` elements. _Note that this is not destructive_: it returns a copy of\n * the list with the changes.\n * <small>No lists have been harmed in the application of this function.</small>\n *\n * @func\n * @memberOf R\n * @since v0.2.2\n * @category List\n * @sig Number -> Number -> [a] -> [a]\n * @param {Number} start The position to start removing elements\n * @param {Number} count The number of elements to remove\n * @param {Array} list The list to remove from\n * @return {Array} A new Array with `count` elements from `start` removed.\n * @example\n *\n *      R.remove(2, 3, [1,2,3,4,5,6,7,8]); //=> [1,2,6,7,8]\n */\nvar remove = /*#__PURE__*/_curry3(function remove(start, count, list) {\n  var result = Array.prototype.slice.call(list, 0);\n  result.splice(start, count);\n  return result;\n});\nexport default remove;","import _curry3 from './internal/_curry3';\nimport adjust from './adjust';\nimport always from './always';\n\n/**\n * Returns a new copy of the array with the element at the provided index\n * replaced with the given value.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig Number -> a -> [a] -> [a]\n * @param {Number} idx The index to update.\n * @param {*} x The value to exist at the given index of the returned array.\n * @param {Array|Arguments} list The source array-like object to be updated.\n * @return {Array} A copy of `list` with the value at index `idx` replaced with `x`.\n * @see R.adjust\n * @example\n *\n *      R.update(1, 11, [0, 1, 2]);     //=> [0, 11, 2]\n *      R.update(1)(11)([0, 1, 2]);     //=> [0, 11, 2]\n * @symb R.update(-1, a, [b, c]) = [b, a]\n * @symb R.update(0, a, [b, c]) = [a, c]\n * @symb R.update(1, a, [b, c]) = [b, a]\n */\nvar update = /*#__PURE__*/_curry3(function update(idx, x, list) {\n  return adjust(always(x), idx, list);\n});\nexport default update;","import _curry2 from './internal/_curry2';\nimport _isInteger from './internal/_isInteger';\nimport assoc from './assoc';\nimport dissoc from './dissoc';\nimport remove from './remove';\nimport update from './update';\n\n/**\n * Makes a shallow clone of an object, omitting the property at the given path.\n * Note that this copies and flattens prototype properties onto the new object\n * as well. All non-primitive properties are copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.11.0\n * @category Object\n * @typedefn Idx = String | Int\n * @sig [Idx] -> {k: v} -> {k: v}\n * @param {Array} path The path to the value to omit\n * @param {Object} obj The object to clone\n * @return {Object} A new object without the property at path\n * @see R.assocPath\n * @example\n *\n *      R.dissocPath(['a', 'b', 'c'], {a: {b: {c: 42}}}); //=> {a: {b: {}}}\n */\nvar dissocPath = /*#__PURE__*/_curry2(function dissocPath(path, obj) {\n  switch (path.length) {\n    case 0:\n      return obj;\n    case 1:\n      return _isInteger(path[0]) ? remove(path[0], 1, obj) : dissoc(path[0], obj);\n    default:\n      var head = path[0];\n      var tail = Array.prototype.slice.call(path, 1);\n      if (obj[head] == null) {\n        return obj;\n      } else if (_isInteger(path[0])) {\n        return update(head, dissocPath(tail, obj[head]), obj);\n      } else {\n        return assoc(head, dissocPath(tail, obj[head]), obj);\n      }\n  }\n});\nexport default dissocPath;","import _curry2 from './internal/_curry2';\n\n/**\n * Divides two numbers. Equivalent to `a / b`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a / b`.\n * @see R.multiply\n * @example\n *\n *      R.divide(71, 100); //=> 0.71\n *\n *      var half = R.divide(R.__, 2);\n *      half(42); //=> 21\n *\n *      var reciprocal = R.divide(1);\n *      reciprocal(4);   //=> 0.25\n */\nvar divide = /*#__PURE__*/_curry2(function divide(a, b) {\n  return a / b;\n});\nexport default divide;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XDrop = /*#__PURE__*/function () {\n  function XDrop(n, xf) {\n    this.xf = xf;\n    this.n = n;\n  }\n  XDrop.prototype['@@transducer/init'] = _xfBase.init;\n  XDrop.prototype['@@transducer/result'] = _xfBase.result;\n  XDrop.prototype['@@transducer/step'] = function (result, input) {\n    if (this.n > 0) {\n      this.n -= 1;\n      return result;\n    }\n    return this.xf['@@transducer/step'](result, input);\n  };\n\n  return XDrop;\n}();\n\nvar _xdrop = /*#__PURE__*/_curry2(function _xdrop(n, xf) {\n  return new XDrop(n, xf);\n});\nexport default _xdrop;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xdrop from './internal/_xdrop';\nimport slice from './slice';\n\n/**\n * Returns all but the first `n` elements of the given list, string, or\n * transducer/transformer (or object with a `drop` method).\n *\n * Dispatches to the `drop` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n\n * @param {*} list\n * @return {*} A copy of list without the first `n` elements\n * @see R.take, R.transduce, R.dropLast, R.dropWhile\n * @example\n *\n *      R.drop(1, ['foo', 'bar', 'baz']); //=> ['bar', 'baz']\n *      R.drop(2, ['foo', 'bar', 'baz']); //=> ['baz']\n *      R.drop(3, ['foo', 'bar', 'baz']); //=> []\n *      R.drop(4, ['foo', 'bar', 'baz']); //=> []\n *      R.drop(3, 'ramda');               //=> 'da'\n */\nvar drop = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['drop'], _xdrop, function drop(n, xs) {\n  return slice(Math.max(0, n), Infinity, xs);\n}));\nexport default drop;","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XTake = /*#__PURE__*/function () {\n  function XTake(n, xf) {\n    this.xf = xf;\n    this.n = n;\n    this.i = 0;\n  }\n  XTake.prototype['@@transducer/init'] = _xfBase.init;\n  XTake.prototype['@@transducer/result'] = _xfBase.result;\n  XTake.prototype['@@transducer/step'] = function (result, input) {\n    this.i += 1;\n    var ret = this.n === 0 ? result : this.xf['@@transducer/step'](result, input);\n    return this.n >= 0 && this.i >= this.n ? _reduced(ret) : ret;\n  };\n\n  return XTake;\n}();\n\nvar _xtake = /*#__PURE__*/_curry2(function _xtake(n, xf) {\n  return new XTake(n, xf);\n});\nexport default _xtake;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xtake from './internal/_xtake';\nimport slice from './slice';\n\n/**\n * Returns the first `n` elements of the given list, string, or\n * transducer/transformer (or object with a `take` method).\n *\n * Dispatches to the `take` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n\n * @param {*} list\n * @return {*}\n * @see R.drop\n * @example\n *\n *      R.take(1, ['foo', 'bar', 'baz']); //=> ['foo']\n *      R.take(2, ['foo', 'bar', 'baz']); //=> ['foo', 'bar']\n *      R.take(3, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n *      R.take(4, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n *      R.take(3, 'ramda');               //=> 'ram'\n *\n *      var personnel = [\n *        'Dave Brubeck',\n *        'Paul Desmond',\n *        'Eugene Wright',\n *        'Joe Morello',\n *        'Gerry Mulligan',\n *        'Bob Bates',\n *        'Joe Dodge',\n *        'Ron Crotty'\n *      ];\n *\n *      var takeFive = R.take(5);\n *      takeFive(personnel);\n *      //=> ['Dave Brubeck', 'Paul Desmond', 'Eugene Wright', 'Joe Morello', 'Gerry Mulligan']\n * @symb R.take(-1, [a, b]) = [a, b]\n * @symb R.take(0, [a, b]) = []\n * @symb R.take(1, [a, b]) = [a]\n * @symb R.take(2, [a, b]) = [a, b]\n */\nvar take = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['take'], _xtake, function take(n, xs) {\n  return slice(0, n < 0 ? Infinity : n, xs);\n}));\nexport default take;","import take from '../take';\n\nexport default function dropLast(n, xs) {\n  return take(n < xs.length ? xs.length - n : 0, xs);\n}","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XDropLast = /*#__PURE__*/function () {\n  function XDropLast(n, xf) {\n    this.xf = xf;\n    this.pos = 0;\n    this.full = false;\n    this.acc = new Array(n);\n  }\n  XDropLast.prototype['@@transducer/init'] = _xfBase.init;\n  XDropLast.prototype['@@transducer/result'] = function (result) {\n    this.acc = null;\n    return this.xf['@@transducer/result'](result);\n  };\n  XDropLast.prototype['@@transducer/step'] = function (result, input) {\n    if (this.full) {\n      result = this.xf['@@transducer/step'](result, this.acc[this.pos]);\n    }\n    this.store(input);\n    return result;\n  };\n  XDropLast.prototype.store = function (input) {\n    this.acc[this.pos] = input;\n    this.pos += 1;\n    if (this.pos === this.acc.length) {\n      this.pos = 0;\n      this.full = true;\n    }\n  };\n\n  return XDropLast;\n}();\n\nvar _xdropLast = /*#__PURE__*/_curry2(function _xdropLast(n, xf) {\n  return new XDropLast(n, xf);\n});\nexport default _xdropLast;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _dropLast from './internal/_dropLast';\nimport _xdropLast from './internal/_xdropLast';\n\n/**\n * Returns a list containing all but the last `n` elements of the given `list`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n The number of elements of `list` to skip.\n * @param {Array} list The list of elements to consider.\n * @return {Array} A copy of the list with only the first `list.length - n` elements\n * @see R.takeLast, R.drop, R.dropWhile, R.dropLastWhile\n * @example\n *\n *      R.dropLast(1, ['foo', 'bar', 'baz']); //=> ['foo', 'bar']\n *      R.dropLast(2, ['foo', 'bar', 'baz']); //=> ['foo']\n *      R.dropLast(3, ['foo', 'bar', 'baz']); //=> []\n *      R.dropLast(4, ['foo', 'bar', 'baz']); //=> []\n *      R.dropLast(3, 'ramda');               //=> 'ra'\n */\nvar dropLast = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xdropLast, _dropLast));\nexport default dropLast;","import slice from '../slice';\n\nexport default function dropLastWhile(pred, xs) {\n  var idx = xs.length - 1;\n  while (idx >= 0 && pred(xs[idx])) {\n    idx -= 1;\n  }\n  return slice(0, idx + 1, xs);\n}","import _curry2 from './_curry2';\nimport _reduce from './_reduce';\nimport _xfBase from './_xfBase';\n\nvar XDropLastWhile = /*#__PURE__*/function () {\n  function XDropLastWhile(fn, xf) {\n    this.f = fn;\n    this.retained = [];\n    this.xf = xf;\n  }\n  XDropLastWhile.prototype['@@transducer/init'] = _xfBase.init;\n  XDropLastWhile.prototype['@@transducer/result'] = function (result) {\n    this.retained = null;\n    return this.xf['@@transducer/result'](result);\n  };\n  XDropLastWhile.prototype['@@transducer/step'] = function (result, input) {\n    return this.f(input) ? this.retain(result, input) : this.flush(result, input);\n  };\n  XDropLastWhile.prototype.flush = function (result, input) {\n    result = _reduce(this.xf['@@transducer/step'], result, this.retained);\n    this.retained = [];\n    return this.xf['@@transducer/step'](result, input);\n  };\n  XDropLastWhile.prototype.retain = function (result, input) {\n    this.retained.push(input);\n    return result;\n  };\n\n  return XDropLastWhile;\n}();\n\nvar _xdropLastWhile = /*#__PURE__*/_curry2(function _xdropLastWhile(fn, xf) {\n  return new XDropLastWhile(fn, xf);\n});\nexport default _xdropLastWhile;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _dropLastWhile from './internal/_dropLastWhile';\nimport _xdropLastWhile from './internal/_xdropLastWhile';\n\n/**\n * Returns a new list excluding all the tailing elements of a given list which\n * satisfy the supplied predicate function. It passes each value from the right\n * to the supplied predicate function, skipping elements until the predicate\n * function returns a `falsy` value. The predicate function is applied to one argument:\n * *(value)*.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @sig (a -> Boolean) -> String -> String\n * @param {Function} predicate The function to be called on each element\n * @param {Array} xs The collection to iterate over.\n * @return {Array} A new array without any trailing elements that return `falsy` values from the `predicate`.\n * @see R.takeLastWhile, R.addIndex, R.drop, R.dropWhile\n * @example\n *\n *      var lteThree = x => x <= 3;\n *\n *      R.dropLastWhile(lteThree, [1, 2, 3, 4, 3, 2, 1]); //=> [1, 2, 3, 4]\n *\n *      R.dropLastWhile(x => x !== 'd' , 'Ramda'); //=> 'Ramd'\n */\nvar dropLastWhile = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xdropLastWhile, _dropLastWhile));\nexport default dropLastWhile;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XDropRepeatsWith = /*#__PURE__*/function () {\n  function XDropRepeatsWith(pred, xf) {\n    this.xf = xf;\n    this.pred = pred;\n    this.lastValue = undefined;\n    this.seenFirstValue = false;\n  }\n\n  XDropRepeatsWith.prototype['@@transducer/init'] = _xfBase.init;\n  XDropRepeatsWith.prototype['@@transducer/result'] = _xfBase.result;\n  XDropRepeatsWith.prototype['@@transducer/step'] = function (result, input) {\n    var sameAsLast = false;\n    if (!this.seenFirstValue) {\n      this.seenFirstValue = true;\n    } else if (this.pred(this.lastValue, input)) {\n      sameAsLast = true;\n    }\n    this.lastValue = input;\n    return sameAsLast ? result : this.xf['@@transducer/step'](result, input);\n  };\n\n  return XDropRepeatsWith;\n}();\n\nvar _xdropRepeatsWith = /*#__PURE__*/_curry2(function _xdropRepeatsWith(pred, xf) {\n  return new XDropRepeatsWith(pred, xf);\n});\nexport default _xdropRepeatsWith;","import _curry2 from './internal/_curry2';\nimport _isString from './internal/_isString';\n\n/**\n * Returns the nth element of the given list or string. If n is negative the\n * element at index length + n is returned.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> a | Undefined\n * @sig Number -> String -> String\n * @param {Number} offset\n * @param {*} list\n * @return {*}\n * @example\n *\n *      var list = ['foo', 'bar', 'baz', 'quux'];\n *      R.nth(1, list); //=> 'bar'\n *      R.nth(-1, list); //=> 'quux'\n *      R.nth(-99, list); //=> undefined\n *\n *      R.nth(2, 'abc'); //=> 'c'\n *      R.nth(3, 'abc'); //=> ''\n * @symb R.nth(-1, [a, b, c]) = c\n * @symb R.nth(0, [a, b, c]) = a\n * @symb R.nth(1, [a, b, c]) = b\n */\nvar nth = /*#__PURE__*/_curry2(function nth(offset, list) {\n  var idx = offset < 0 ? list.length + offset : offset;\n  return _isString(list) ? list.charAt(idx) : list[idx];\n});\nexport default nth;","import nth from './nth';\n\n/**\n * Returns the last element of the given list or string.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig [a] -> a | Undefined\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.init, R.head, R.tail\n * @example\n *\n *      R.last(['fi', 'fo', 'fum']); //=> 'fum'\n *      R.last([]); //=> undefined\n *\n *      R.last('abc'); //=> 'c'\n *      R.last(''); //=> ''\n */\nvar last = /*#__PURE__*/nth(-1);\nexport default last;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xdropRepeatsWith from './internal/_xdropRepeatsWith';\nimport last from './last';\n\n/**\n * Returns a new list without any consecutively repeating elements. Equality is\n * determined by applying the supplied predicate to each pair of consecutive elements. The\n * first element in a series of equal elements will be preserved.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig ((a, a) -> Boolean) -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list The array to consider.\n * @return {Array} `list` without repeating elements.\n * @see R.transduce\n * @example\n *\n *      var l = [1, -1, 1, 3, 4, -4, -4, -5, 5, 3, 3];\n *      R.dropRepeatsWith(R.eqBy(Math.abs), l); //=> [1, 3, 4, -5, 3]\n */\nvar dropRepeatsWith = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xdropRepeatsWith, function dropRepeatsWith(pred, list) {\n  var result = [];\n  var idx = 1;\n  var len = list.length;\n  if (len !== 0) {\n    result[0] = list[0];\n    while (idx < len) {\n      if (!pred(last(result), list[idx])) {\n        result[result.length] = list[idx];\n      }\n      idx += 1;\n    }\n  }\n  return result;\n}));\nexport default dropRepeatsWith;","import _curry1 from './internal/_curry1';\nimport _dispatchable from './internal/_dispatchable';\nimport _xdropRepeatsWith from './internal/_xdropRepeatsWith';\nimport dropRepeatsWith from './dropRepeatsWith';\nimport equals from './equals';\n\n/**\n * Returns a new list without any consecutively repeating elements.\n * [`R.equals`](#equals) is used to determine equality.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig [a] -> [a]\n * @param {Array} list The array to consider.\n * @return {Array} `list` without repeating elements.\n * @see R.transduce\n * @example\n *\n *     R.dropRepeats([1, 1, 1, 2, 3, 4, 4, 2, 2]); //=> [1, 2, 3, 4, 2]\n */\nvar dropRepeats = /*#__PURE__*/_curry1( /*#__PURE__*/_dispatchable([], /*#__PURE__*/_xdropRepeatsWith(equals), /*#__PURE__*/dropRepeatsWith(equals)));\nexport default dropRepeats;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XDropWhile = /*#__PURE__*/function () {\n  function XDropWhile(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XDropWhile.prototype['@@transducer/init'] = _xfBase.init;\n  XDropWhile.prototype['@@transducer/result'] = _xfBase.result;\n  XDropWhile.prototype['@@transducer/step'] = function (result, input) {\n    if (this.f) {\n      if (this.f(input)) {\n        return result;\n      }\n      this.f = null;\n    }\n    return this.xf['@@transducer/step'](result, input);\n  };\n\n  return XDropWhile;\n}();\n\nvar _xdropWhile = /*#__PURE__*/_curry2(function _xdropWhile(f, xf) {\n  return new XDropWhile(f, xf);\n});\nexport default _xdropWhile;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xdropWhile from './internal/_xdropWhile';\nimport slice from './slice';\n\n/**\n * Returns a new list excluding the leading elements of a given list which\n * satisfy the supplied predicate function. It passes each value to the supplied\n * predicate function, skipping elements while the predicate function returns\n * `true`. The predicate function is applied to one argument: *(value)*.\n *\n * Dispatches to the `dropWhile` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @sig (a -> Boolean) -> String -> String\n * @param {Function} fn The function called per iteration.\n * @param {Array} xs The collection to iterate over.\n * @return {Array} A new array.\n * @see R.takeWhile, R.transduce, R.addIndex\n * @example\n *\n *      var lteTwo = x => x <= 2;\n *\n *      R.dropWhile(lteTwo, [1, 2, 3, 4, 3, 2, 1]); //=> [3, 4, 3, 2, 1]\n *\n *      R.dropWhile(x => x !== 'd' , 'Ramda'); //=> 'da'\n */\nvar dropWhile = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['dropWhile'], _xdropWhile, function dropWhile(pred, xs) {\n  var idx = 0;\n  var len = xs.length;\n  while (idx < len && pred(xs[idx])) {\n    idx += 1;\n  }\n  return slice(idx, Infinity, xs);\n}));\nexport default dropWhile;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if one or both of its arguments are `true`. Returns `false`\n * if both arguments are `false`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig a -> b -> a | b\n * @param {Any} a\n * @param {Any} b\n * @return {Any} the first argument if truthy, otherwise the second argument.\n * @see R.either\n * @example\n *\n *      R.or(true, true); //=> true\n *      R.or(true, false); //=> true\n *      R.or(false, true); //=> true\n *      R.or(false, false); //=> false\n */\nvar or = /*#__PURE__*/_curry2(function or(a, b) {\n  return a || b;\n});\nexport default or;","import _curry2 from './internal/_curry2';\nimport _isFunction from './internal/_isFunction';\nimport lift from './lift';\nimport or from './or';\n\n/**\n * A function wrapping calls to the two functions in an `||` operation,\n * returning the result of the first function if it is truth-y and the result\n * of the second function otherwise. Note that this is short-circuited,\n * meaning that the second function will not be invoked if the first returns a\n * truth-y value.\n *\n * In addition to functions, `R.either` also accepts any fantasy-land compatible\n * applicative functor.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> Boolean) -> (*... -> Boolean)\n * @param {Function} f a predicate\n * @param {Function} g another predicate\n * @return {Function} a function that applies its arguments to `f` and `g` and `||`s their outputs together.\n * @see R.or\n * @example\n *\n *      var gt10 = x => x > 10;\n *      var even = x => x % 2 === 0;\n *      var f = R.either(gt10, even);\n *      f(101); //=> true\n *      f(8); //=> true\n */\nvar either = /*#__PURE__*/_curry2(function either(f, g) {\n  return _isFunction(f) ? function _either() {\n    return f.apply(this, arguments) || g.apply(this, arguments);\n  } : lift(or)(f, g);\n});\nexport default either;","import _curry1 from './internal/_curry1';\nimport _isArguments from './internal/_isArguments';\nimport _isArray from './internal/_isArray';\nimport _isObject from './internal/_isObject';\nimport _isString from './internal/_isString';\n\n/**\n * Returns the empty value of its argument's type. Ramda defines the empty\n * value of Array (`[]`), Object (`{}`), String (`''`), and Arguments. Other\n * types are supported if they define `<Type>.empty`,\n * `<Type>.prototype.empty` or implement the\n * [FantasyLand Monoid spec](https://github.com/fantasyland/fantasy-land#monoid).\n *\n * Dispatches to the `empty` method of the first argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig a -> a\n * @param {*} x\n * @return {*}\n * @example\n *\n *      R.empty(Just(42));      //=> Nothing()\n *      R.empty([1, 2, 3]);     //=> []\n *      R.empty('unicorns');    //=> ''\n *      R.empty({x: 1, y: 2});  //=> {}\n */\nvar empty = /*#__PURE__*/_curry1(function empty(x) {\n  return x != null && typeof x['fantasy-land/empty'] === 'function' ? x['fantasy-land/empty']() : x != null && x.constructor != null && typeof x.constructor['fantasy-land/empty'] === 'function' ? x.constructor['fantasy-land/empty']() : x != null && typeof x.empty === 'function' ? x.empty() : x != null && x.constructor != null && typeof x.constructor.empty === 'function' ? x.constructor.empty() : _isArray(x) ? [] : _isString(x) ? '' : _isObject(x) ? {} : _isArguments(x) ? function () {\n    return arguments;\n  }() :\n  // else\n  void 0;\n});\nexport default empty;","import _curry2 from './internal/_curry2';\nimport drop from './drop';\n\n/**\n * Returns a new list containing the last `n` elements of the given list.\n * If `n > list.length`, returns a list of `list.length` elements.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n The number of elements to return.\n * @param {Array} xs The collection to consider.\n * @return {Array}\n * @see R.dropLast\n * @example\n *\n *      R.takeLast(1, ['foo', 'bar', 'baz']); //=> ['baz']\n *      R.takeLast(2, ['foo', 'bar', 'baz']); //=> ['bar', 'baz']\n *      R.takeLast(3, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n *      R.takeLast(4, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n *      R.takeLast(3, 'ramda');               //=> 'mda'\n */\nvar takeLast = /*#__PURE__*/_curry2(function takeLast(n, xs) {\n  return drop(n >= 0 ? xs.length - n : 0, xs);\n});\nexport default takeLast;","import _curry2 from './internal/_curry2';\nimport equals from './equals';\nimport takeLast from './takeLast';\n\n/**\n * Checks if a list ends with the provided values\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category List\n * @sig [a] -> Boolean\n * @sig String -> Boolean\n * @param {*} suffix\n * @param {*} list\n * @return {Boolean}\n * @example\n *\n *      R.endsWith('c', 'abc')                //=> true\n *      R.endsWith('b', 'abc')                //=> false\n *      R.endsWith(['c'], ['a', 'b', 'c'])    //=> true\n *      R.endsWith(['b'], ['a', 'b', 'c'])    //=> false\n */\nvar endsWith = /*#__PURE__*/_curry2(function (suffix, list) {\n  return equals(takeLast(suffix.length, list), suffix);\n});\nexport default endsWith;","import _curry3 from './internal/_curry3';\nimport equals from './equals';\n\n/**\n * Takes a function and two values in its domain and returns `true` if the\n * values map to the same value in the codomain; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Relation\n * @sig (a -> b) -> a -> a -> Boolean\n * @param {Function} f\n * @param {*} x\n * @param {*} y\n * @return {Boolean}\n * @example\n *\n *      R.eqBy(Math.abs, 5, -5); //=> true\n */\nvar eqBy = /*#__PURE__*/_curry3(function eqBy(f, x, y) {\n  return equals(f(x), f(y));\n});\nexport default eqBy;","import _curry3 from './internal/_curry3';\nimport equals from './equals';\n\n/**\n * Reports whether two objects have the same value, in [`R.equals`](#equals)\n * terms, for the specified property. Useful as a curried predicate.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig k -> {k: v} -> {k: v} -> Boolean\n * @param {String} prop The name of the property to compare\n * @param {Object} obj1\n * @param {Object} obj2\n * @return {Boolean}\n *\n * @example\n *\n *      var o1 = { a: 1, b: 2, c: 3, d: 4 };\n *      var o2 = { a: 10, b: 20, c: 3, d: 40 };\n *      R.eqProps('a', o1, o2); //=> false\n *      R.eqProps('c', o1, o2); //=> true\n */\nvar eqProps = /*#__PURE__*/_curry3(function eqProps(prop, obj1, obj2) {\n  return equals(obj1[prop], obj2[prop]);\n});\nexport default eqProps;","import _curry2 from './internal/_curry2';\n\n/**\n * Creates a new object by recursively evolving a shallow copy of `object`,\n * according to the `transformation` functions. All non-primitive properties\n * are copied by reference.\n *\n * A `transformation` function will not be invoked if its corresponding key\n * does not exist in the evolved object.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {k: (v -> v)} -> {k: v} -> {k: v}\n * @param {Object} transformations The object specifying transformation functions to apply\n *        to the object.\n * @param {Object} object The object to be transformed.\n * @return {Object} The transformed object.\n * @example\n *\n *      var tomato  = {firstName: '  Tomato ', data: {elapsed: 100, remaining: 1400}, id:123};\n *      var transformations = {\n *        firstName: R.trim,\n *        lastName: R.trim, // Will not get invoked.\n *        data: {elapsed: R.add(1), remaining: R.add(-1)}\n *      };\n *      R.evolve(transformations, tomato); //=> {firstName: 'Tomato', data: {elapsed: 101, remaining: 1399}, id:123}\n */\nvar evolve = /*#__PURE__*/_curry2(function evolve(transformations, object) {\n  var result = {};\n  var transformation, key, type;\n  for (key in object) {\n    transformation = transformations[key];\n    type = typeof transformation;\n    result[key] = type === 'function' ? transformation(object[key]) : transformation && type === 'object' ? evolve(transformation, object[key]) : object[key];\n  }\n  return result;\n});\nexport default evolve;","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XFind = /*#__PURE__*/function () {\n  function XFind(f, xf) {\n    this.xf = xf;\n    this.f = f;\n    this.found = false;\n  }\n  XFind.prototype['@@transducer/init'] = _xfBase.init;\n  XFind.prototype['@@transducer/result'] = function (result) {\n    if (!this.found) {\n      result = this.xf['@@transducer/step'](result, void 0);\n    }\n    return this.xf['@@transducer/result'](result);\n  };\n  XFind.prototype['@@transducer/step'] = function (result, input) {\n    if (this.f(input)) {\n      this.found = true;\n      result = _reduced(this.xf['@@transducer/step'](result, input));\n    }\n    return result;\n  };\n\n  return XFind;\n}();\n\nvar _xfind = /*#__PURE__*/_curry2(function _xfind(f, xf) {\n  return new XFind(f, xf);\n});\nexport default _xfind;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xfind from './internal/_xfind';\n\n/**\n * Returns the first element of the list which matches the predicate, or\n * `undefined` if no element matches.\n *\n * Dispatches to the `find` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> a | undefined\n * @param {Function} fn The predicate function used to determine if the element is the\n *        desired one.\n * @param {Array} list The array to consider.\n * @return {Object} The element found, or `undefined`.\n * @see R.transduce\n * @example\n *\n *      var xs = [{a: 1}, {a: 2}, {a: 3}];\n *      R.find(R.propEq('a', 2))(xs); //=> {a: 2}\n *      R.find(R.propEq('a', 4))(xs); //=> undefined\n */\nvar find = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['find'], _xfind, function find(fn, list) {\n  var idx = 0;\n  var len = list.length;\n  while (idx < len) {\n    if (fn(list[idx])) {\n      return list[idx];\n    }\n    idx += 1;\n  }\n}));\nexport default find;","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XFindIndex = /*#__PURE__*/function () {\n  function XFindIndex(f, xf) {\n    this.xf = xf;\n    this.f = f;\n    this.idx = -1;\n    this.found = false;\n  }\n  XFindIndex.prototype['@@transducer/init'] = _xfBase.init;\n  XFindIndex.prototype['@@transducer/result'] = function (result) {\n    if (!this.found) {\n      result = this.xf['@@transducer/step'](result, -1);\n    }\n    return this.xf['@@transducer/result'](result);\n  };\n  XFindIndex.prototype['@@transducer/step'] = function (result, input) {\n    this.idx += 1;\n    if (this.f(input)) {\n      this.found = true;\n      result = _reduced(this.xf['@@transducer/step'](result, this.idx));\n    }\n    return result;\n  };\n\n  return XFindIndex;\n}();\n\nvar _xfindIndex = /*#__PURE__*/_curry2(function _xfindIndex(f, xf) {\n  return new XFindIndex(f, xf);\n});\nexport default _xfindIndex;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xfindIndex from './internal/_xfindIndex';\n\n/**\n * Returns the index of the first element of the list which matches the\n * predicate, or `-1` if no element matches.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> Number\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Number} The index of the element found, or `-1`.\n * @see R.transduce\n * @example\n *\n *      var xs = [{a: 1}, {a: 2}, {a: 3}];\n *      R.findIndex(R.propEq('a', 2))(xs); //=> 1\n *      R.findIndex(R.propEq('a', 4))(xs); //=> -1\n */\nvar findIndex = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xfindIndex, function findIndex(fn, list) {\n  var idx = 0;\n  var len = list.length;\n  while (idx < len) {\n    if (fn(list[idx])) {\n      return idx;\n    }\n    idx += 1;\n  }\n  return -1;\n}));\nexport default findIndex;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XFindLast = /*#__PURE__*/function () {\n  function XFindLast(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XFindLast.prototype['@@transducer/init'] = _xfBase.init;\n  XFindLast.prototype['@@transducer/result'] = function (result) {\n    return this.xf['@@transducer/result'](this.xf['@@transducer/step'](result, this.last));\n  };\n  XFindLast.prototype['@@transducer/step'] = function (result, input) {\n    if (this.f(input)) {\n      this.last = input;\n    }\n    return result;\n  };\n\n  return XFindLast;\n}();\n\nvar _xfindLast = /*#__PURE__*/_curry2(function _xfindLast(f, xf) {\n  return new XFindLast(f, xf);\n});\nexport default _xfindLast;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xfindLast from './internal/_xfindLast';\n\n/**\n * Returns the last element of the list which matches the predicate, or\n * `undefined` if no element matches.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> a | undefined\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Object} The element found, or `undefined`.\n * @see R.transduce\n * @example\n *\n *      var xs = [{a: 1, b: 0}, {a:1, b: 1}];\n *      R.findLast(R.propEq('a', 1))(xs); //=> {a: 1, b: 1}\n *      R.findLast(R.propEq('a', 4))(xs); //=> undefined\n */\nvar findLast = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xfindLast, function findLast(fn, list) {\n  var idx = list.length - 1;\n  while (idx >= 0) {\n    if (fn(list[idx])) {\n      return list[idx];\n    }\n    idx -= 1;\n  }\n}));\nexport default findLast;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XFindLastIndex = /*#__PURE__*/function () {\n  function XFindLastIndex(f, xf) {\n    this.xf = xf;\n    this.f = f;\n    this.idx = -1;\n    this.lastIdx = -1;\n  }\n  XFindLastIndex.prototype['@@transducer/init'] = _xfBase.init;\n  XFindLastIndex.prototype['@@transducer/result'] = function (result) {\n    return this.xf['@@transducer/result'](this.xf['@@transducer/step'](result, this.lastIdx));\n  };\n  XFindLastIndex.prototype['@@transducer/step'] = function (result, input) {\n    this.idx += 1;\n    if (this.f(input)) {\n      this.lastIdx = this.idx;\n    }\n    return result;\n  };\n\n  return XFindLastIndex;\n}();\n\nvar _xfindLastIndex = /*#__PURE__*/_curry2(function _xfindLastIndex(f, xf) {\n  return new XFindLastIndex(f, xf);\n});\nexport default _xfindLastIndex;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xfindLastIndex from './internal/_xfindLastIndex';\n\n/**\n * Returns the index of the last element of the list which matches the\n * predicate, or `-1` if no element matches.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> Number\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Number} The index of the element found, or `-1`.\n * @see R.transduce\n * @example\n *\n *      var xs = [{a: 1, b: 0}, {a:1, b: 1}];\n *      R.findLastIndex(R.propEq('a', 1))(xs); //=> 1\n *      R.findLastIndex(R.propEq('a', 4))(xs); //=> -1\n */\nvar findLastIndex = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xfindLastIndex, function findLastIndex(fn, list) {\n  var idx = list.length - 1;\n  while (idx >= 0) {\n    if (fn(list[idx])) {\n      return idx;\n    }\n    idx -= 1;\n  }\n  return -1;\n}));\nexport default findLastIndex;","import _curry1 from './internal/_curry1';\nimport _makeFlat from './internal/_makeFlat';\n\n/**\n * Returns a new list by pulling every item out of it (and all its sub-arrays)\n * and putting them in a new array, depth-first.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b]\n * @param {Array} list The array to consider.\n * @return {Array} The flattened list.\n * @see R.unnest\n * @example\n *\n *      R.flatten([1, 2, [3, 4], 5, [6, [7, 8, [9, [10, 11], 12]]]]);\n *      //=> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]\n */\nvar flatten = /*#__PURE__*/_curry1( /*#__PURE__*/_makeFlat(true));\nexport default flatten;","import _curry1 from './internal/_curry1';\nimport curryN from './curryN';\n\n/**\n * Returns a new function much like the supplied one, except that the first two\n * arguments' order is reversed.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig ((a, b, c, ...) -> z) -> (b -> a -> c -> ... -> z)\n * @param {Function} fn The function to invoke with its first two parameters reversed.\n * @return {*} The result of invoking `fn` with its first two parameters' order reversed.\n * @example\n *\n *      var mergeThree = (a, b, c) => [].concat(a, b, c);\n *\n *      mergeThree(1, 2, 3); //=> [1, 2, 3]\n *\n *      R.flip(mergeThree)(1, 2, 3); //=> [2, 1, 3]\n * @symb R.flip(f)(a, b, c) = f(b, a, c)\n */\nvar flip = /*#__PURE__*/_curry1(function flip(fn) {\n  return curryN(fn.length, function (a, b) {\n    var args = Array.prototype.slice.call(arguments, 0);\n    args[0] = b;\n    args[1] = a;\n    return fn.apply(this, args);\n  });\n});\nexport default flip;","import _checkForMethod from './internal/_checkForMethod';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Iterate over an input `list`, calling a provided function `fn` for each\n * element in the list.\n *\n * `fn` receives one argument: *(value)*.\n *\n * Note: `R.forEach` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.forEach` method. For more\n * details on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/forEach#Description\n *\n * Also note that, unlike `Array.prototype.forEach`, Ramda's `forEach` returns\n * the original array. In some libraries this function is named `each`.\n *\n * Dispatches to the `forEach` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> *) -> [a] -> [a]\n * @param {Function} fn The function to invoke. Receives one argument, `value`.\n * @param {Array} list The list to iterate over.\n * @return {Array} The original list.\n * @see R.addIndex\n * @example\n *\n *      var printXPlusFive = x => console.log(x + 5);\n *      R.forEach(printXPlusFive, [1, 2, 3]); //=> [1, 2, 3]\n *      // logs 6\n *      // logs 7\n *      // logs 8\n * @symb R.forEach(f, [a, b, c]) = [a, b, c]\n */\nvar forEach = /*#__PURE__*/_curry2( /*#__PURE__*/_checkForMethod('forEach', function forEach(fn, list) {\n  var len = list.length;\n  var idx = 0;\n  while (idx < len) {\n    fn(list[idx]);\n    idx += 1;\n  }\n  return list;\n}));\nexport default forEach;","import _curry2 from './internal/_curry2';\nimport keys from './keys';\n\n/**\n * Iterate over an input `object`, calling a provided function `fn` for each\n * key and value in the object.\n *\n * `fn` receives three argument: *(value, key, obj)*.\n *\n * @func\n * @memberOf R\n * @since v0.23.0\n * @category Object\n * @sig ((a, String, StrMap a) -> Any) -> StrMap a -> StrMap a\n * @param {Function} fn The function to invoke. Receives three argument, `value`, `key`, `obj`.\n * @param {Object} obj The object to iterate over.\n * @return {Object} The original object.\n * @example\n *\n *      var printKeyConcatValue = (value, key) => console.log(key + ':' + value);\n *      R.forEachObjIndexed(printKeyConcatValue, {x: 1, y: 2}); //=> {x: 1, y: 2}\n *      // logs x:1\n *      // logs y:2\n * @symb R.forEachObjIndexed(f, {x: a, y: b}) = {x: a, y: b}\n */\nvar forEachObjIndexed = /*#__PURE__*/_curry2(function forEachObjIndexed(fn, obj) {\n  var keyList = keys(obj);\n  var idx = 0;\n  while (idx < keyList.length) {\n    var key = keyList[idx];\n    fn(obj[key], key, obj);\n    idx += 1;\n  }\n  return obj;\n});\nexport default forEachObjIndexed;","import _curry1 from './internal/_curry1';\n\n/**\n * Creates a new object from a list key-value pairs. If a key appears in\n * multiple pairs, the rightmost pair is included in the object.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [[k,v]] -> {k: v}\n * @param {Array} pairs An array of two-element arrays that will be the keys and values of the output object.\n * @return {Object} The object made by pairing up `keys` and `values`.\n * @see R.toPairs, R.pair\n * @example\n *\n *      R.fromPairs([['a', 1], ['b', 2], ['c', 3]]); //=> {a: 1, b: 2, c: 3}\n */\nvar fromPairs = /*#__PURE__*/_curry1(function fromPairs(pairs) {\n  var result = {};\n  var idx = 0;\n  while (idx < pairs.length) {\n    result[pairs[idx][0]] = pairs[idx][1];\n    idx += 1;\n  }\n  return result;\n});\nexport default fromPairs;","import _checkForMethod from './internal/_checkForMethod';\nimport _curry2 from './internal/_curry2';\nimport reduceBy from './reduceBy';\n\n/**\n * Splits a list into sub-lists stored in an object, based on the result of\n * calling a String-returning function on each element, and grouping the\n * results according to values returned.\n *\n * Dispatches to the `groupBy` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> String) -> [a] -> {String: [a]}\n * @param {Function} fn Function :: a -> String\n * @param {Array} list The array to group\n * @return {Object} An object with the output of `fn` for keys, mapped to arrays of elements\n *         that produced that key when passed to `fn`.\n * @see R.transduce\n * @example\n *\n *      var byGrade = R.groupBy(function(student) {\n *        var score = student.score;\n *        return score < 65 ? 'F' :\n *               score < 70 ? 'D' :\n *               score < 80 ? 'C' :\n *               score < 90 ? 'B' : 'A';\n *      });\n *      var students = [{name: 'Abby', score: 84},\n *                      {name: 'Eddy', score: 58},\n *                      // ...\n *                      {name: 'Jack', score: 69}];\n *      byGrade(students);\n *      // {\n *      //   'A': [{name: 'Dianne', score: 99}],\n *      //   'B': [{name: 'Abby', score: 84}]\n *      //   // ...,\n *      //   'F': [{name: 'Eddy', score: 58}]\n *      // }\n */\nvar groupBy = /*#__PURE__*/_curry2( /*#__PURE__*/_checkForMethod('groupBy', /*#__PURE__*/reduceBy(function (acc, item) {\n  if (acc == null) {\n    acc = [];\n  }\n  acc.push(item);\n  return acc;\n}, null)));\nexport default groupBy;","import _curry2 from './internal/_curry2';\n\n/**\n * Takes a list and returns a list of lists where each sublist's elements are\n * all satisfied pairwise comparison according to the provided function.\n * Only adjacent elements are passed to the comparison function.\n *\n * @func\n * @memberOf R\n * @since v0.21.0\n * @category List\n * @sig ((a, a) → Boolean) → [a] → [[a]]\n * @param {Function} fn Function for determining whether two given (adjacent)\n *        elements should be in the same group\n * @param {Array} list The array to group. Also accepts a string, which will be\n *        treated as a list of characters.\n * @return {List} A list that contains sublists of elements,\n *         whose concatenations are equal to the original list.\n * @example\n *\n * R.groupWith(R.equals, [0, 1, 1, 2, 3, 5, 8, 13, 21])\n * //=> [[0], [1, 1], [2], [3], [5], [8], [13], [21]]\n *\n * R.groupWith((a, b) => a + 1 === b, [0, 1, 1, 2, 3, 5, 8, 13, 21])\n * //=> [[0, 1], [1, 2, 3], [5], [8], [13], [21]]\n *\n * R.groupWith((a, b) => a % 2 === b % 2, [0, 1, 1, 2, 3, 5, 8, 13, 21])\n * //=> [[0], [1, 1], [2], [3, 5], [8], [13, 21]]\n *\n * R.groupWith(R.eqBy(isVowel), 'aestiou')\n * //=> ['ae', 'st', 'iou']\n */\nvar groupWith = /*#__PURE__*/_curry2(function (fn, list) {\n  var res = [];\n  var idx = 0;\n  var len = list.length;\n  while (idx < len) {\n    var nextidx = idx + 1;\n    while (nextidx < len && fn(list[nextidx - 1], list[nextidx])) {\n      nextidx += 1;\n    }\n    res.push(list.slice(idx, nextidx));\n    idx = nextidx;\n  }\n  return res;\n});\nexport default groupWith;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if the first argument is greater than the second; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @see R.lt\n * @example\n *\n *      R.gt(2, 1); //=> true\n *      R.gt(2, 2); //=> false\n *      R.gt(2, 3); //=> false\n *      R.gt('a', 'z'); //=> false\n *      R.gt('z', 'a'); //=> true\n */\nvar gt = /*#__PURE__*/_curry2(function gt(a, b) {\n  return a > b;\n});\nexport default gt;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if the first argument is greater than or equal to the second;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {Number} a\n * @param {Number} b\n * @return {Boolean}\n * @see R.lte\n * @example\n *\n *      R.gte(2, 1); //=> true\n *      R.gte(2, 2); //=> true\n *      R.gte(2, 3); //=> false\n *      R.gte('a', 'z'); //=> false\n *      R.gte('z', 'a'); //=> true\n */\nvar gte = /*#__PURE__*/_curry2(function gte(a, b) {\n  return a >= b;\n});\nexport default gte;","import _curry2 from './internal/_curry2';\nimport _has from './internal/_has';\n\n/**\n * Returns whether or not an object has an own property with the specified name\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Object\n * @sig s -> {s: x} -> Boolean\n * @param {String} prop The name of the property to check for.\n * @param {Object} obj The object to query.\n * @return {Boolean} Whether the property exists.\n * @example\n *\n *      var hasName = R.has('name');\n *      hasName({name: 'alice'});   //=> true\n *      hasName({name: 'bob'});     //=> true\n *      hasName({});                //=> false\n *\n *      var point = {x: 0, y: 0};\n *      var pointHas = R.has(R.__, point);\n *      pointHas('x');  //=> true\n *      pointHas('y');  //=> true\n *      pointHas('z');  //=> false\n */\nvar has = /*#__PURE__*/_curry2(_has);\nexport default has;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns whether or not an object or its prototype chain has a property with\n * the specified name\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Object\n * @sig s -> {s: x} -> Boolean\n * @param {String} prop The name of the property to check for.\n * @param {Object} obj The object to query.\n * @return {Boolean} Whether the property exists.\n * @example\n *\n *      function Rectangle(width, height) {\n *        this.width = width;\n *        this.height = height;\n *      }\n *      Rectangle.prototype.area = function() {\n *        return this.width * this.height;\n *      };\n *\n *      var square = new Rectangle(2, 2);\n *      R.hasIn('width', square);  //=> true\n *      R.hasIn('area', square);  //=> true\n */\nvar hasIn = /*#__PURE__*/_curry2(function hasIn(prop, obj) {\n  return prop in obj;\n});\nexport default hasIn;","import nth from './nth';\n\n/**\n * Returns the first element of the given list or string. In some libraries\n * this function is named `first`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> a | Undefined\n * @sig String -> String\n * @param {Array|String} list\n * @return {*}\n * @see R.tail, R.init, R.last\n * @example\n *\n *      R.head(['fi', 'fo', 'fum']); //=> 'fi'\n *      R.head([]); //=> undefined\n *\n *      R.head('abc'); //=> 'a'\n *      R.head(''); //=> ''\n */\nvar head = /*#__PURE__*/nth(0);\nexport default head;","export default function _identity(x) {\n  return x;\n}","import _curry1 from './internal/_curry1';\nimport _identity from './internal/_identity';\n\n/**\n * A function that does nothing but return the parameter supplied to it. Good\n * as a default or placeholder function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig a -> a\n * @param {*} x The value to return.\n * @return {*} The input value, `x`.\n * @example\n *\n *      R.identity(1); //=> 1\n *\n *      var obj = {};\n *      R.identity(obj) === obj; //=> true\n * @symb R.identity(a) = a\n */\nvar identity = /*#__PURE__*/_curry1(_identity);\nexport default identity;","import _curry3 from './internal/_curry3';\nimport curryN from './curryN';\n\n/**\n * Creates a function that will process either the `onTrue` or the `onFalse`\n * function depending upon the result of the `condition` predicate.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> *) -> (*... -> *) -> (*... -> *)\n * @param {Function} condition A predicate function\n * @param {Function} onTrue A function to invoke when the `condition` evaluates to a truthy value.\n * @param {Function} onFalse A function to invoke when the `condition` evaluates to a falsy value.\n * @return {Function} A new unary function that will process either the `onTrue` or the `onFalse`\n *                    function depending upon the result of the `condition` predicate.\n * @see R.unless, R.when\n * @example\n *\n *      var incCount = R.ifElse(\n *        R.has('count'),\n *        R.over(R.lensProp('count'), R.inc),\n *        R.assoc('count', 1)\n *      );\n *      incCount({});           //=> { count: 1 }\n *      incCount({ count: 1 }); //=> { count: 2 }\n */\nvar ifElse = /*#__PURE__*/_curry3(function ifElse(condition, onTrue, onFalse) {\n  return curryN(Math.max(condition.length, onTrue.length, onFalse.length), function _ifElse() {\n    return condition.apply(this, arguments) ? onTrue.apply(this, arguments) : onFalse.apply(this, arguments);\n  });\n});\nexport default ifElse;","import add from './add';\n\n/**\n * Increments its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number} n + 1\n * @see R.dec\n * @example\n *\n *      R.inc(42); //=> 43\n */\nvar inc = /*#__PURE__*/add(1);\nexport default inc;","import reduceBy from './reduceBy';\n\n/**\n * Given a function that generates a key, turns a list of objects into an\n * object indexing the objects by the given key. Note that if multiple\n * objects generate the same value for the indexing key only the last value\n * will be included in the generated object.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (a -> String) -> [{k: v}] -> {k: {k: v}}\n * @param {Function} fn Function :: a -> String\n * @param {Array} array The array of objects to index\n * @return {Object} An object indexing each array element by the given property.\n * @example\n *\n *      var list = [{id: 'xyz', title: 'A'}, {id: 'abc', title: 'B'}];\n *      R.indexBy(R.prop('id'), list);\n *      //=> {abc: {id: 'abc', title: 'B'}, xyz: {id: 'xyz', title: 'A'}}\n */\nvar indexBy = /*#__PURE__*/reduceBy(function (acc, elem) {\n  return elem;\n}, null);\nexport default indexBy;","import _curry2 from './internal/_curry2';\nimport _indexOf from './internal/_indexOf';\nimport _isArray from './internal/_isArray';\n\n/**\n * Returns the position of the first occurrence of an item in an array, or -1\n * if the item is not included in the array. [`R.equals`](#equals) is used to\n * determine equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Number\n * @param {*} target The item to find.\n * @param {Array} xs The array to search in.\n * @return {Number} the index of the target, or -1 if the target is not found.\n * @see R.lastIndexOf\n * @example\n *\n *      R.indexOf(3, [1,2,3,4]); //=> 2\n *      R.indexOf(10, [1,2,3,4]); //=> -1\n */\nvar indexOf = /*#__PURE__*/_curry2(function indexOf(target, xs) {\n  return typeof xs.indexOf === 'function' && !_isArray(xs) ? xs.indexOf(target) : _indexOf(xs, target, 0);\n});\nexport default indexOf;","import slice from './slice';\n\n/**\n * Returns all but the last element of the given list or string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.last, R.head, R.tail\n * @example\n *\n *      R.init([1, 2, 3]);  //=> [1, 2]\n *      R.init([1, 2]);     //=> [1]\n *      R.init([1]);        //=> []\n *      R.init([]);         //=> []\n *\n *      R.init('abc');  //=> 'ab'\n *      R.init('ab');   //=> 'a'\n *      R.init('a');    //=> ''\n *      R.init('');     //=> ''\n */\nvar init = /*#__PURE__*/slice(0, -1);\nexport default init;","import _containsWith from './internal/_containsWith';\nimport _curry3 from './internal/_curry3';\nimport _filter from './internal/_filter';\n\n/**\n * Takes a predicate `pred`, a list `xs`, and a list `ys`, and returns a list\n * `xs'` comprising each of the elements of `xs` which is equal to one or more\n * elements of `ys` according to `pred`.\n *\n * `pred` must be a binary function expecting an element from each list.\n *\n * `xs`, `ys`, and `xs'` are treated as sets, semantically, so ordering should\n * not be significant, but since `xs'` is ordered the implementation guarantees\n * that its values are in the same order as they appear in `xs`. Duplicates are\n * not removed, so `xs'` may contain duplicates if `xs` contains duplicates.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Relation\n * @sig ((a, b) -> Boolean) -> [a] -> [b] -> [a]\n * @param {Function} pred\n * @param {Array} xs\n * @param {Array} ys\n * @return {Array}\n * @see R.intersection\n * @example\n *\n *      R.innerJoin(\n *        (record, id) => record.id === id,\n *        [{id: 824, name: 'Richie Furay'},\n *         {id: 956, name: 'Dewey Martin'},\n *         {id: 313, name: 'Bruce Palmer'},\n *         {id: 456, name: 'Stephen Stills'},\n *         {id: 177, name: 'Neil Young'}],\n *        [177, 456, 999]\n *      );\n *      //=> [{id: 456, name: 'Stephen Stills'}, {id: 177, name: 'Neil Young'}]\n */\nvar innerJoin = /*#__PURE__*/_curry3(function innerJoin(pred, xs, ys) {\n  return _filter(function (x) {\n    return _containsWith(pred, x, ys);\n  }, xs);\n});\nexport default innerJoin;","import _curry3 from './internal/_curry3';\n\n/**\n * Inserts the supplied element into the list, at the specified `index`. _Note that\n\n * this is not destructive_: it returns a copy of the list with the changes.\n * <small>No lists have been harmed in the application of this function.</small>\n *\n * @func\n * @memberOf R\n * @since v0.2.2\n * @category List\n * @sig Number -> a -> [a] -> [a]\n * @param {Number} index The position to insert the element\n * @param {*} elt The element to insert into the Array\n * @param {Array} list The list to insert into\n * @return {Array} A new Array with `elt` inserted at `index`.\n * @example\n *\n *      R.insert(2, 'x', [1,2,3,4]); //=> [1,2,'x',3,4]\n */\nvar insert = /*#__PURE__*/_curry3(function insert(idx, elt, list) {\n  idx = idx < list.length && idx >= 0 ? idx : list.length;\n  var result = Array.prototype.slice.call(list, 0);\n  result.splice(idx, 0, elt);\n  return result;\n});\nexport default insert;","import _curry3 from './internal/_curry3';\n\n/**\n * Inserts the sub-list into the list, at the specified `index`. _Note that this is not\n * destructive_: it returns a copy of the list with the changes.\n * <small>No lists have been harmed in the application of this function.</small>\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig Number -> [a] -> [a] -> [a]\n * @param {Number} index The position to insert the sub-list\n * @param {Array} elts The sub-list to insert into the Array\n * @param {Array} list The list to insert the sub-list into\n * @return {Array} A new Array with `elts` inserted starting at `index`.\n * @example\n *\n *      R.insertAll(2, ['x','y','z'], [1,2,3,4]); //=> [1,2,'x','y','z',3,4]\n */\nvar insertAll = /*#__PURE__*/_curry3(function insertAll(idx, elts, list) {\n  idx = idx < list.length && idx >= 0 ? idx : list.length;\n  return [].concat(Array.prototype.slice.call(list, 0, idx), elts, Array.prototype.slice.call(list, idx));\n});\nexport default insertAll;","import _contains from './_contains';\n\nvar _Set = /*#__PURE__*/function () {\n  function _Set() {\n    /* globals Set */\n    this._nativeSet = typeof Set === 'function' ? new Set() : null;\n    this._items = {};\n  }\n\n  // until we figure out why jsdoc chokes on this\n  // @param item The item to add to the Set\n  // @returns {boolean} true if the item did not exist prior, otherwise false\n  //\n  _Set.prototype.add = function (item) {\n    return !hasOrAdd(item, true, this);\n  };\n\n  //\n  // @param item The item to check for existence in the Set\n  // @returns {boolean} true if the item exists in the Set, otherwise false\n  //\n  _Set.prototype.has = function (item) {\n    return hasOrAdd(item, false, this);\n  };\n\n  //\n  // Combines the logic for checking whether an item is a member of the set and\n  // for adding a new item to the set.\n  //\n  // @param item       The item to check or add to the Set instance.\n  // @param shouldAdd  If true, the item will be added to the set if it doesn't\n  //                   already exist.\n  // @param set        The set instance to check or add to.\n  // @return {boolean} true if the item already existed, otherwise false.\n  //\n  return _Set;\n}();\n\nfunction hasOrAdd(item, shouldAdd, set) {\n  var type = typeof item;\n  var prevSize, newSize;\n  switch (type) {\n    case 'string':\n    case 'number':\n      // distinguish between +0 and -0\n      if (item === 0 && 1 / item === -Infinity) {\n        if (set._items['-0']) {\n          return true;\n        } else {\n          if (shouldAdd) {\n            set._items['-0'] = true;\n          }\n          return false;\n        }\n      }\n      // these types can all utilise the native Set\n      if (set._nativeSet !== null) {\n        if (shouldAdd) {\n          prevSize = set._nativeSet.size;\n          set._nativeSet.add(item);\n          newSize = set._nativeSet.size;\n          return newSize === prevSize;\n        } else {\n          return set._nativeSet.has(item);\n        }\n      } else {\n        if (!(type in set._items)) {\n          if (shouldAdd) {\n            set._items[type] = {};\n            set._items[type][item] = true;\n          }\n          return false;\n        } else if (item in set._items[type]) {\n          return true;\n        } else {\n          if (shouldAdd) {\n            set._items[type][item] = true;\n          }\n          return false;\n        }\n      }\n\n    case 'boolean':\n      // set._items['boolean'] holds a two element array\n      // representing [ falseExists, trueExists ]\n      if (type in set._items) {\n        var bIdx = item ? 1 : 0;\n        if (set._items[type][bIdx]) {\n          return true;\n        } else {\n          if (shouldAdd) {\n            set._items[type][bIdx] = true;\n          }\n          return false;\n        }\n      } else {\n        if (shouldAdd) {\n          set._items[type] = item ? [false, true] : [true, false];\n        }\n        return false;\n      }\n\n    case 'function':\n      // compare functions for reference equality\n      if (set._nativeSet !== null) {\n        if (shouldAdd) {\n          prevSize = set._nativeSet.size;\n          set._nativeSet.add(item);\n          newSize = set._nativeSet.size;\n          return newSize === prevSize;\n        } else {\n          return set._nativeSet.has(item);\n        }\n      } else {\n        if (!(type in set._items)) {\n          if (shouldAdd) {\n            set._items[type] = [item];\n          }\n          return false;\n        }\n        if (!_contains(item, set._items[type])) {\n          if (shouldAdd) {\n            set._items[type].push(item);\n          }\n          return false;\n        }\n        return true;\n      }\n\n    case 'undefined':\n      if (set._items[type]) {\n        return true;\n      } else {\n        if (shouldAdd) {\n          set._items[type] = true;\n        }\n        return false;\n      }\n\n    case 'object':\n      if (item === null) {\n        if (!set._items['null']) {\n          if (shouldAdd) {\n            set._items['null'] = true;\n          }\n          return false;\n        }\n        return true;\n      }\n    /* falls through */\n    default:\n      // reduce the search size of heterogeneous sets by creating buckets\n      // for each type.\n      type = Object.prototype.toString.call(item);\n      if (!(type in set._items)) {\n        if (shouldAdd) {\n          set._items[type] = [item];\n        }\n        return false;\n      }\n      // scan through all previously applied items\n      if (!_contains(item, set._items[type])) {\n        if (shouldAdd) {\n          set._items[type].push(item);\n        }\n        return false;\n      }\n      return true;\n  }\n}\n\n// A simple Set type that honours R.equals semantics\nexport default _Set;","import _Set from './internal/_Set';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Returns a new list containing only one copy of each element in the original\n * list, based upon the value returned by applying the supplied function to\n * each list element. Prefers the first item if the supplied function produces\n * the same value on two items. [`R.equals`](#equals) is used for comparison.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> b) -> [a] -> [a]\n * @param {Function} fn A function used to produce a value to use during comparisons.\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n *      R.uniqBy(Math.abs, [-1, -5, 2, 10, 1, 2]); //=> [-1, -5, 2, 10]\n */\nvar uniqBy = /*#__PURE__*/_curry2(function uniqBy(fn, list) {\n  var set = new _Set();\n  var result = [];\n  var idx = 0;\n  var appliedItem, item;\n\n  while (idx < list.length) {\n    item = list[idx];\n    appliedItem = fn(item);\n    if (set.add(appliedItem)) {\n      result.push(item);\n    }\n    idx += 1;\n  }\n  return result;\n});\nexport default uniqBy;","import identity from './identity';\nimport uniqBy from './uniqBy';\n\n/**\n * Returns a new list containing only one copy of each element in the original\n * list. [`R.equals`](#equals) is used to determine equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n *      R.uniq([1, 1, 2, 1]); //=> [1, 2]\n *      R.uniq([1, '1']);     //=> [1, '1']\n *      R.uniq([[42], [42]]); //=> [[42]]\n */\nvar uniq = /*#__PURE__*/uniqBy(identity);\nexport default uniq;","import _contains from './internal/_contains';\nimport _curry2 from './internal/_curry2';\nimport _filter from './internal/_filter';\nimport flip from './flip';\nimport uniq from './uniq';\n\n/**\n * Combines two lists into a set (i.e. no duplicates) composed of those\n * elements common to both lists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The list of elements found in both `list1` and `list2`.\n * @see R.innerJoin\n * @example\n *\n *      R.intersection([1,2,3,4], [7,6,5,4,3]); //=> [4, 3]\n */\nvar intersection = /*#__PURE__*/_curry2(function intersection(list1, list2) {\n  var lookupList, filteredList;\n  if (list1.length > list2.length) {\n    lookupList = list1;\n    filteredList = list2;\n  } else {\n    lookupList = list2;\n    filteredList = list1;\n  }\n  return uniq(_filter(flip(_contains)(lookupList), filteredList));\n});\nexport default intersection;","import _checkForMethod from './internal/_checkForMethod';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Creates a new list with the separator interposed between elements.\n *\n * Dispatches to the `intersperse` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} separator The element to add to the list.\n * @param {Array} list The list to be interposed.\n * @return {Array} The new list.\n * @example\n *\n *      R.intersperse('n', ['ba', 'a', 'a']); //=> ['ba', 'n', 'a', 'n', 'a']\n */\nvar intersperse = /*#__PURE__*/_curry2( /*#__PURE__*/_checkForMethod('intersperse', function intersperse(separator, list) {\n  var out = [];\n  var idx = 0;\n  var length = list.length;\n  while (idx < length) {\n    if (idx === length - 1) {\n      out.push(list[idx]);\n    } else {\n      out.push(list[idx], separator);\n    }\n    idx += 1;\n  }\n  return out;\n}));\nexport default intersperse;","import _objectAssign from './_objectAssign';\n\nexport default typeof Object.assign === 'function' ? Object.assign : _objectAssign;","import _has from './_has';\n\n// Based on https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Object/assign\nexport default function _objectAssign(target) {\n  if (target == null) {\n    throw new TypeError('Cannot convert undefined or null to object');\n  }\n\n  var output = Object(target);\n  var idx = 1;\n  var length = arguments.length;\n  while (idx < length) {\n    var source = arguments[idx];\n    if (source != null) {\n      for (var nextKey in source) {\n        if (_has(nextKey, source)) {\n          output[nextKey] = source[nextKey];\n        }\n      }\n    }\n    idx += 1;\n  }\n  return output;\n}","import _curry2 from './internal/_curry2';\n\n/**\n * Creates an object containing a single key:value pair.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Object\n * @sig String -> a -> {String:a}\n * @param {String} key\n * @param {*} val\n * @return {Object}\n * @see R.pair\n * @example\n *\n *      var matchPhrases = R.compose(\n *        R.objOf('must'),\n *        R.map(R.objOf('match_phrase'))\n *      );\n *      matchPhrases(['foo', 'bar', 'baz']); //=> {must: [{match_phrase: 'foo'}, {match_phrase: 'bar'}, {match_phrase: 'baz'}]}\n */\nvar objOf = /*#__PURE__*/_curry2(function objOf(key, val) {\n  var obj = {};\n  obj[key] = val;\n  return obj;\n});\nexport default objOf;","import _assign from './_assign';\nimport _identity from './_identity';\nimport _isArrayLike from './_isArrayLike';\nimport _isTransformer from './_isTransformer';\nimport objOf from '../objOf';\n\nvar _stepCatArray = {\n  '@@transducer/init': Array,\n  '@@transducer/step': function (xs, x) {\n    xs.push(x);\n    return xs;\n  },\n  '@@transducer/result': _identity\n};\nvar _stepCatString = {\n  '@@transducer/init': String,\n  '@@transducer/step': function (a, b) {\n    return a + b;\n  },\n  '@@transducer/result': _identity\n};\nvar _stepCatObject = {\n  '@@transducer/init': Object,\n  '@@transducer/step': function (result, input) {\n    return _assign(result, _isArrayLike(input) ? objOf(input[0], input[1]) : input);\n  },\n  '@@transducer/result': _identity\n};\n\nexport default function _stepCat(obj) {\n  if (_isTransformer(obj)) {\n    return obj;\n  }\n  if (_isArrayLike(obj)) {\n    return _stepCatArray;\n  }\n  if (typeof obj === 'string') {\n    return _stepCatString;\n  }\n  if (typeof obj === 'object') {\n    return _stepCatObject;\n  }\n  throw new Error('Cannot create transformer for ' + obj);\n}","import _clone from './internal/_clone';\nimport _curry3 from './internal/_curry3';\nimport _isTransformer from './internal/_isTransformer';\nimport _reduce from './internal/_reduce';\nimport _stepCat from './internal/_stepCat';\n\n/**\n * Transforms the items of the list with the transducer and appends the\n * transformed items to the accumulator using an appropriate iterator function\n * based on the accumulator type.\n *\n * The accumulator can be an array, string, object or a transformer. Iterated\n * items will be appended to arrays and concatenated to strings. Objects will\n * be merged directly or 2-item arrays will be merged as key, value pairs.\n *\n * The accumulator can also be a transformer object that provides a 2-arity\n * reducing iterator function, step, 0-arity initial value function, init, and\n * 1-arity result extraction function result. The step function is used as the\n * iterator function in reduce. The result function is used to convert the\n * final accumulator into the return type and in most cases is R.identity. The\n * init function is used to provide the initial accumulator.\n *\n * The iteration is performed with [`R.reduce`](#reduce) after initializing the\n * transducer.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig a -> (b -> b) -> [c] -> a\n * @param {*} acc The initial accumulator value.\n * @param {Function} xf The transducer function. Receives a transformer and returns a transformer.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @example\n *\n *      var numbers = [1, 2, 3, 4];\n *      var transducer = R.compose(R.map(R.add(1)), R.take(2));\n *\n *      R.into([], transducer, numbers); //=> [2, 3]\n *\n *      var intoArray = R.into([]);\n *      intoArray(transducer, numbers); //=> [2, 3]\n */\nvar into = /*#__PURE__*/_curry3(function into(acc, xf, list) {\n  return _isTransformer(acc) ? _reduce(xf(acc), acc['@@transducer/init'](), list) : _reduce(xf(_stepCat(acc)), _clone(acc, [], [], false), list);\n});\nexport default into;","import _curry1 from './internal/_curry1';\nimport _has from './internal/_has';\nimport keys from './keys';\n\n/**\n * Same as [`R.invertObj`](#invertObj), however this accounts for objects with\n * duplicate values by putting the values into an array.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {s: x} -> {x: [ s, ... ]}\n * @param {Object} obj The object or array to invert\n * @return {Object} out A new object with keys in an array.\n * @see R.invertObj\n * @example\n *\n *      var raceResultsByFirstName = {\n *        first: 'alice',\n *        second: 'jake',\n *        third: 'alice',\n *      };\n *      R.invert(raceResultsByFirstName);\n *      //=> { 'alice': ['first', 'third'], 'jake':['second'] }\n */\nvar invert = /*#__PURE__*/_curry1(function invert(obj) {\n  var props = keys(obj);\n  var len = props.length;\n  var idx = 0;\n  var out = {};\n\n  while (idx < len) {\n    var key = props[idx];\n    var val = obj[key];\n    var list = _has(val, out) ? out[val] : out[val] = [];\n    list[list.length] = key;\n    idx += 1;\n  }\n  return out;\n});\nexport default invert;","import _curry1 from './internal/_curry1';\nimport keys from './keys';\n\n/**\n * Returns a new object with the keys of the given object as values, and the\n * values of the given object, which are coerced to strings, as keys. Note\n * that the last key found is preferred when handling the same value.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {s: x} -> {x: s}\n * @param {Object} obj The object or array to invert\n * @return {Object} out A new object\n * @see R.invert\n * @example\n *\n *      var raceResults = {\n *        first: 'alice',\n *        second: 'jake'\n *      };\n *      R.invertObj(raceResults);\n *      //=> { 'alice': 'first', 'jake':'second' }\n *\n *      // Alternatively:\n *      var raceResults = ['alice', 'jake'];\n *      R.invertObj(raceResults);\n *      //=> { 'alice': '0', 'jake':'1' }\n */\nvar invertObj = /*#__PURE__*/_curry1(function invertObj(obj) {\n  var props = keys(obj);\n  var len = props.length;\n  var idx = 0;\n  var out = {};\n\n  while (idx < len) {\n    var key = props[idx];\n    out[obj[key]] = key;\n    idx += 1;\n  }\n  return out;\n});\nexport default invertObj;","import _curry2 from './internal/_curry2';\nimport _isFunction from './internal/_isFunction';\nimport curryN from './curryN';\nimport toString from './toString';\n\n/**\n * Turns a named method with a specified arity into a function that can be\n * called directly supplied with arguments and a target object.\n *\n * The returned function is curried and accepts `arity + 1` parameters where\n * the final parameter is the target object.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig Number -> String -> (a -> b -> ... -> n -> Object -> *)\n * @param {Number} arity Number of arguments the returned function should take\n *        before the target object.\n * @param {String} method Name of the method to call.\n * @return {Function} A new curried function.\n * @see R.construct\n * @example\n *\n *      var sliceFrom = R.invoker(1, 'slice');\n *      sliceFrom(6, 'abcdefghijklm'); //=> 'ghijklm'\n *      var sliceFrom6 = R.invoker(2, 'slice')(6);\n *      sliceFrom6(8, 'abcdefghijklm'); //=> 'gh'\n * @symb R.invoker(0, 'method')(o) = o['method']()\n * @symb R.invoker(1, 'method')(a, o) = o['method'](a)\n * @symb R.invoker(2, 'method')(a, b, o) = o['method'](a, b)\n */\nvar invoker = /*#__PURE__*/_curry2(function invoker(arity, method) {\n  return curryN(arity + 1, function () {\n    var target = arguments[arity];\n    if (target != null && _isFunction(target[method])) {\n      return target[method].apply(target, Array.prototype.slice.call(arguments, 0, arity));\n    }\n    throw new TypeError(toString(target) + ' does not have a method named \"' + method + '\"');\n  });\n});\nexport default invoker;","import _curry2 from './internal/_curry2';\n\n/**\n * See if an object (`val`) is an instance of the supplied constructor. This\n * function will check up the inheritance chain, if any.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Type\n * @sig (* -> {*}) -> a -> Boolean\n * @param {Object} ctor A constructor\n * @param {*} val The value to test\n * @return {Boolean}\n * @example\n *\n *      R.is(Object, {}); //=> true\n *      R.is(Number, 1); //=> true\n *      R.is(Object, 1); //=> false\n *      R.is(String, 's'); //=> true\n *      R.is(String, new String('')); //=> true\n *      R.is(Object, new String('')); //=> true\n *      R.is(Object, 's'); //=> false\n *      R.is(Number, {}); //=> false\n */\nvar is = /*#__PURE__*/_curry2(function is(Ctor, val) {\n  return val != null && val.constructor === Ctor || val instanceof Ctor;\n});\nexport default is;","import _curry1 from './internal/_curry1';\nimport empty from './empty';\nimport equals from './equals';\n\n/**\n * Returns `true` if the given value is its type's empty value; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig a -> Boolean\n * @param {*} x\n * @return {Boolean}\n * @see R.empty\n * @example\n *\n *      R.isEmpty([1, 2, 3]);   //=> false\n *      R.isEmpty([]);          //=> true\n *      R.isEmpty('');          //=> true\n *      R.isEmpty(null);        //=> false\n *      R.isEmpty({});          //=> true\n *      R.isEmpty({length: 0}); //=> false\n */\nvar isEmpty = /*#__PURE__*/_curry1(function isEmpty(x) {\n  return x != null && equals(x, empty(x));\n});\nexport default isEmpty;","import invoker from './invoker';\n\n/**\n * Returns a string made by inserting the `separator` between each element and\n * concatenating all the elements into a single string.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig String -> [a] -> String\n * @param {Number|String} separator The string used to separate the elements.\n * @param {Array} xs The elements to join into a string.\n * @return {String} str The string made by concatenating `xs` with `separator`.\n * @see R.split\n * @example\n *\n *      var spacer = R.join(' ');\n *      spacer(['a', 2, 3.4]);   //=> 'a 2 3.4'\n *      R.join('|', [1, 2, 3]);    //=> '1|2|3'\n */\nvar join = /*#__PURE__*/invoker(1, 'join');\nexport default join;","import _curry1 from './internal/_curry1';\nimport converge from './converge';\n\n/**\n * juxt applies a list of functions to a list of values.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Function\n * @sig [(a, b, ..., m) -> n] -> ((a, b, ..., m) -> [n])\n * @param {Array} fns An array of functions\n * @return {Function} A function that returns a list of values after applying each of the original `fns` to its parameters.\n * @see R.applySpec\n * @example\n *\n *      var getRange = R.juxt([Math.min, Math.max]);\n *      getRange(3, 4, 9, -3); //=> [-3, 9]\n * @symb R.juxt([f, g, h])(a, b) = [f(a, b), g(a, b), h(a, b)]\n */\nvar juxt = /*#__PURE__*/_curry1(function juxt(fns) {\n  return converge(function () {\n    return Array.prototype.slice.call(arguments, 0);\n  }, fns);\n});\nexport default juxt;","import _curry1 from './internal/_curry1';\n\n/**\n * Returns a list containing the names of all the properties of the supplied\n * object, including prototype properties.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own and prototype properties.\n * @see R.keys, R.valuesIn\n * @example\n *\n *      var F = function() { this.x = 'X'; };\n *      F.prototype.y = 'Y';\n *      var f = new F();\n *      R.keysIn(f); //=> ['x', 'y']\n */\nvar keysIn = /*#__PURE__*/_curry1(function keysIn(obj) {\n  var prop;\n  var ks = [];\n  for (prop in obj) {\n    ks[ks.length] = prop;\n  }\n  return ks;\n});\nexport default keysIn;","import _curry2 from './internal/_curry2';\nimport _isArray from './internal/_isArray';\nimport equals from './equals';\n\n/**\n * Returns the position of the last occurrence of an item in an array, or -1 if\n * the item is not included in the array. [`R.equals`](#equals) is used to\n * determine equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Number\n * @param {*} target The item to find.\n * @param {Array} xs The array to search in.\n * @return {Number} the index of the target, or -1 if the target is not found.\n * @see R.indexOf\n * @example\n *\n *      R.lastIndexOf(3, [-1,3,3,0,1,2,3,4]); //=> 6\n *      R.lastIndexOf(10, [1,2,3,4]); //=> -1\n */\nvar lastIndexOf = /*#__PURE__*/_curry2(function lastIndexOf(target, xs) {\n  if (typeof xs.lastIndexOf === 'function' && !_isArray(xs)) {\n    return xs.lastIndexOf(target);\n  } else {\n    var idx = xs.length - 1;\n    while (idx >= 0) {\n      if (equals(xs[idx], target)) {\n        return idx;\n      }\n      idx -= 1;\n    }\n    return -1;\n  }\n});\nexport default lastIndexOf;","export default function _isNumber(x) {\n  return Object.prototype.toString.call(x) === '[object Number]';\n}","import _curry1 from './internal/_curry1';\nimport _isNumber from './internal/_isNumber';\n\n/**\n * Returns the number of elements in the array by returning `list.length`.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [a] -> Number\n * @param {Array} list The array to inspect.\n * @return {Number} The length of the array.\n * @example\n *\n *      R.length([]); //=> 0\n *      R.length([1, 2, 3]); //=> 3\n */\nvar length = /*#__PURE__*/_curry1(function length(list) {\n  return list != null && _isNumber(list.length) ? list.length : NaN;\n});\nexport default length;","import _curry2 from './internal/_curry2';\nimport map from './map';\n\n/**\n * Returns a lens for the given getter and setter functions. The getter \"gets\"\n * the value of the focus; the setter \"sets\" the value of the focus. The setter\n * should not mutate the data structure.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig (s -> a) -> ((a, s) -> s) -> Lens s a\n * @param {Function} getter\n * @param {Function} setter\n * @return {Lens}\n * @see R.view, R.set, R.over, R.lensIndex, R.lensProp\n * @example\n *\n *      var xLens = R.lens(R.prop('x'), R.assoc('x'));\n *\n *      R.view(xLens, {x: 1, y: 2});            //=> 1\n *      R.set(xLens, 4, {x: 1, y: 2});          //=> {x: 4, y: 2}\n *      R.over(xLens, R.negate, {x: 1, y: 2});  //=> {x: -1, y: 2}\n */\nvar lens = /*#__PURE__*/_curry2(function lens(getter, setter) {\n  return function (toFunctorFn) {\n    return function (target) {\n      return map(function (focus) {\n        return setter(focus, target);\n      }, toFunctorFn(getter(target)));\n    };\n  };\n});\nexport default lens;","import _curry1 from './internal/_curry1';\nimport lens from './lens';\nimport nth from './nth';\nimport update from './update';\n\n/**\n * Returns a lens whose focus is the specified index.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Number -> Lens s a\n * @param {Number} n\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n *      var headLens = R.lensIndex(0);\n *\n *      R.view(headLens, ['a', 'b', 'c']);            //=> 'a'\n *      R.set(headLens, 'x', ['a', 'b', 'c']);        //=> ['x', 'b', 'c']\n *      R.over(headLens, R.toUpper, ['a', 'b', 'c']); //=> ['A', 'b', 'c']\n */\nvar lensIndex = /*#__PURE__*/_curry1(function lensIndex(n) {\n  return lens(nth(n), update(n));\n});\nexport default lensIndex;","import _curry1 from './internal/_curry1';\nimport assocPath from './assocPath';\nimport lens from './lens';\nimport path from './path';\n\n/**\n * Returns a lens whose focus is the specified path.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @typedefn Idx = String | Int\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig [Idx] -> Lens s a\n * @param {Array} path The path to use.\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n *      var xHeadYLens = R.lensPath(['x', 0, 'y']);\n *\n *      R.view(xHeadYLens, {x: [{y: 2, z: 3}, {y: 4, z: 5}]});\n *      //=> 2\n *      R.set(xHeadYLens, 1, {x: [{y: 2, z: 3}, {y: 4, z: 5}]});\n *      //=> {x: [{y: 1, z: 3}, {y: 4, z: 5}]}\n *      R.over(xHeadYLens, R.negate, {x: [{y: 2, z: 3}, {y: 4, z: 5}]});\n *      //=> {x: [{y: -2, z: 3}, {y: 4, z: 5}]}\n */\nvar lensPath = /*#__PURE__*/_curry1(function lensPath(p) {\n  return lens(path(p), assocPath(p));\n});\nexport default lensPath;","import _curry1 from './internal/_curry1';\nimport assoc from './assoc';\nimport lens from './lens';\nimport prop from './prop';\n\n/**\n * Returns a lens whose focus is the specified property.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig String -> Lens s a\n * @param {String} k\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n *      var xLens = R.lensProp('x');\n *\n *      R.view(xLens, {x: 1, y: 2});            //=> 1\n *      R.set(xLens, 4, {x: 1, y: 2});          //=> {x: 4, y: 2}\n *      R.over(xLens, R.negate, {x: 1, y: 2});  //=> {x: -1, y: 2}\n */\nvar lensProp = /*#__PURE__*/_curry1(function lensProp(k) {\n  return lens(prop(k), assoc(k));\n});\nexport default lensProp;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if the first argument is less than the second; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @see R.gt\n * @example\n *\n *      R.lt(2, 1); //=> false\n *      R.lt(2, 2); //=> false\n *      R.lt(2, 3); //=> true\n *      R.lt('a', 'z'); //=> true\n *      R.lt('z', 'a'); //=> false\n */\nvar lt = /*#__PURE__*/_curry2(function lt(a, b) {\n  return a < b;\n});\nexport default lt;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if the first argument is less than or equal to the second;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {Number} a\n * @param {Number} b\n * @return {Boolean}\n * @see R.gte\n * @example\n *\n *      R.lte(2, 1); //=> false\n *      R.lte(2, 2); //=> true\n *      R.lte(2, 3); //=> true\n *      R.lte('a', 'z'); //=> true\n *      R.lte('z', 'a'); //=> false\n */\nvar lte = /*#__PURE__*/_curry2(function lte(a, b) {\n  return a <= b;\n});\nexport default lte;","import _curry3 from './internal/_curry3';\n\n/**\n * The `mapAccum` function behaves like a combination of map and reduce; it\n * applies a function to each element of a list, passing an accumulating\n * parameter from left to right, and returning a final value of this\n * accumulator together with the new list.\n *\n * The iterator function receives two arguments, *acc* and *value*, and should\n * return a tuple *[acc, value]*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig ((acc, x) -> (acc, y)) -> acc -> [x] -> (acc, [y])\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.addIndex, R.mapAccumRight\n * @example\n *\n *      var digits = ['1', '2', '3', '4'];\n *      var appender = (a, b) => [a + b, a + b];\n *\n *      R.mapAccum(appender, 0, digits); //=> ['01234', ['01', '012', '0123', '01234']]\n * @symb R.mapAccum(f, a, [b, c, d]) = [\n *   f(f(f(a, b)[0], c)[0], d)[0],\n *   [\n *     f(a, b)[1],\n *     f(f(a, b)[0], c)[1],\n *     f(f(f(a, b)[0], c)[0], d)[1]\n *   ]\n * ]\n */\nvar mapAccum = /*#__PURE__*/_curry3(function mapAccum(fn, acc, list) {\n  var idx = 0;\n  var len = list.length;\n  var result = [];\n  var tuple = [acc];\n  while (idx < len) {\n    tuple = fn(tuple[0], list[idx]);\n    result[idx] = tuple[1];\n    idx += 1;\n  }\n  return [tuple[0], result];\n});\nexport default mapAccum;","import _curry3 from './internal/_curry3';\n\n/**\n * The `mapAccumRight` function behaves like a combination of map and reduce; it\n * applies a function to each element of a list, passing an accumulating\n * parameter from right to left, and returning a final value of this\n * accumulator together with the new list.\n *\n * Similar to [`mapAccum`](#mapAccum), except moves through the input list from\n * the right to the left.\n *\n * The iterator function receives two arguments, *value* and *acc*, and should\n * return a tuple *[value, acc]*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig ((x, acc) -> (y, acc)) -> acc -> [x] -> ([y], acc)\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.addIndex, R.mapAccum\n * @example\n *\n *      var digits = ['1', '2', '3', '4'];\n *      var append = (a, b) => [a + b, a + b];\n *\n *      R.mapAccumRight(append, 5, digits); //=> [['12345', '2345', '345', '45'], '12345']\n * @symb R.mapAccumRight(f, a, [b, c, d]) = [\n *   [\n *     f(b, f(c, f(d, a)[0])[0])[1],\n *     f(c, f(d, a)[0])[1],\n *     f(d, a)[1],\n *   ]\n *   f(b, f(c, f(d, a)[0])[0])[0],\n * ]\n */\nvar mapAccumRight = /*#__PURE__*/_curry3(function mapAccumRight(fn, acc, list) {\n  var idx = list.length - 1;\n  var result = [];\n  var tuple = [acc];\n  while (idx >= 0) {\n    tuple = fn(list[idx], tuple[0]);\n    result[idx] = tuple[1];\n    idx -= 1;\n  }\n  return [result, tuple[0]];\n});\nexport default mapAccumRight;","import _curry2 from './internal/_curry2';\nimport _reduce from './internal/_reduce';\nimport keys from './keys';\n\n/**\n * An Object-specific version of [`map`](#map). The function is applied to three\n * arguments: *(value, key, obj)*. If only the value is significant, use\n * [`map`](#map) instead.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig ((*, String, Object) -> *) -> Object -> Object\n * @param {Function} fn\n * @param {Object} obj\n * @return {Object}\n * @see R.map\n * @example\n *\n *      var values = { x: 1, y: 2, z: 3 };\n *      var prependKeyAndDouble = (num, key, obj) => key + (num * 2);\n *\n *      R.mapObjIndexed(prependKeyAndDouble, values); //=> { x: 'x2', y: 'y4', z: 'z6' }\n */\nvar mapObjIndexed = /*#__PURE__*/_curry2(function mapObjIndexed(fn, obj) {\n  return _reduce(function (acc, key) {\n    acc[key] = fn(obj[key], key, obj);\n    return acc;\n  }, {}, keys(obj));\n});\nexport default mapObjIndexed;","import _curry2 from './internal/_curry2';\n\n/**\n * Tests a regular expression against a String. Note that this function will\n * return an empty array when there are no matches. This differs from\n * [`String.prototype.match`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/match)\n * which returns `null` when there are no matches.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category String\n * @sig RegExp -> String -> [String | Undefined]\n * @param {RegExp} rx A regular expression.\n * @param {String} str The string to match against\n * @return {Array} The list of matches or empty array.\n * @see R.test\n * @example\n *\n *      R.match(/([a-z]a)/g, 'bananas'); //=> ['ba', 'na', 'na']\n *      R.match(/a/, 'b'); //=> []\n *      R.match(/a/, null); //=> TypeError: null does not have a method named \"match\"\n */\nvar match = /*#__PURE__*/_curry2(function match(rx, str) {\n  return str.match(rx) || [];\n});\nexport default match;","import _curry2 from './internal/_curry2';\nimport _isInteger from './internal/_isInteger';\n\n/**\n * `mathMod` behaves like the modulo operator should mathematically, unlike the\n * `%` operator (and by extension, [`R.modulo`](#modulo)). So while\n * `-17 % 5` is `-2`, `mathMod(-17, 5)` is `3`. `mathMod` requires Integer\n * arguments, and returns NaN when the modulus is zero or negative.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} m The dividend.\n * @param {Number} p the modulus.\n * @return {Number} The result of `b mod a`.\n * @see R.modulo\n * @example\n *\n *      R.mathMod(-17, 5);  //=> 3\n *      R.mathMod(17, 5);   //=> 2\n *      R.mathMod(17, -5);  //=> NaN\n *      R.mathMod(17, 0);   //=> NaN\n *      R.mathMod(17.2, 5); //=> NaN\n *      R.mathMod(17, 5.3); //=> NaN\n *\n *      var clock = R.mathMod(R.__, 12);\n *      clock(15); //=> 3\n *      clock(24); //=> 0\n *\n *      var seventeenMod = R.mathMod(17);\n *      seventeenMod(3);  //=> 2\n *      seventeenMod(4);  //=> 1\n *      seventeenMod(10); //=> 7\n */\nvar mathMod = /*#__PURE__*/_curry2(function mathMod(m, p) {\n  if (!_isInteger(m)) {\n    return NaN;\n  }\n  if (!_isInteger(p) || p < 1) {\n    return NaN;\n  }\n  return (m % p + p) % p;\n});\nexport default mathMod;","import _curry3 from './internal/_curry3';\n\n/**\n * Takes a function and two values, and returns whichever value produces the\n * larger result when passed to the provided function.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Relation\n * @sig Ord b => (a -> b) -> a -> a -> a\n * @param {Function} f\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.max, R.minBy\n * @example\n *\n *      //  square :: Number -> Number\n *      var square = n => n * n;\n *\n *      R.maxBy(square, -3, 2); //=> -3\n *\n *      R.reduce(R.maxBy(square), 0, [3, -5, 4, 1, -2]); //=> -5\n *      R.reduce(R.maxBy(square), 0, []); //=> 0\n */\nvar maxBy = /*#__PURE__*/_curry3(function maxBy(f, a, b) {\n  return f(b) > f(a) ? b : a;\n});\nexport default maxBy;","import add from './add';\nimport reduce from './reduce';\n\n/**\n * Adds together all the elements of a list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list An array of numbers\n * @return {Number} The sum of all the numbers in the list.\n * @see R.reduce\n * @example\n *\n *      R.sum([2,4,6,8,100,1]); //=> 121\n */\nvar sum = /*#__PURE__*/reduce(add, 0);\nexport default sum;","import _curry1 from './internal/_curry1';\nimport sum from './sum';\n\n/**\n * Returns the mean of the given list of numbers.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list\n * @return {Number}\n * @see R.median\n * @example\n *\n *      R.mean([2, 7, 9]); //=> 6\n *      R.mean([]); //=> NaN\n */\nvar mean = /*#__PURE__*/_curry1(function mean(list) {\n  return sum(list) / list.length;\n});\nexport default mean;","import _curry1 from './internal/_curry1';\nimport mean from './mean';\n\n/**\n * Returns the median of the given list of numbers.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list\n * @return {Number}\n * @see R.mean\n * @example\n *\n *      R.median([2, 9, 7]); //=> 7\n *      R.median([7, 2, 10, 9]); //=> 8\n *      R.median([]); //=> NaN\n */\nvar median = /*#__PURE__*/_curry1(function median(list) {\n  var len = list.length;\n  if (len === 0) {\n    return NaN;\n  }\n  var width = 2 - len % 2;\n  var idx = (len - width) / 2;\n  return mean(Array.prototype.slice.call(list, 0).sort(function (a, b) {\n    return a < b ? -1 : a > b ? 1 : 0;\n  }).slice(idx, idx + width));\n});\nexport default median;","import _arity from './internal/_arity';\nimport _curry2 from './internal/_curry2';\nimport _has from './internal/_has';\n\n/**\n * A customisable version of [`R.memoize`](#memoize). `memoizeWith` takes an\n * additional function that will be applied to a given argument set and used to\n * create the cache key under which the results of the function to be memoized\n * will be stored. Care must be taken when implementing key generation to avoid\n * clashes that may overwrite previous entries erroneously.\n *\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Function\n * @sig (*... -> String) -> (*... -> a) -> (*... -> a)\n * @param {Function} fn The function to generate the cache key.\n * @param {Function} fn The function to memoize.\n * @return {Function} Memoized version of `fn`.\n * @see R.memoize\n * @example\n *\n *      let count = 0;\n *      const factorial = R.memoizeWith(R.identity, n => {\n *        count += 1;\n *        return R.product(R.range(1, n + 1));\n *      });\n *      factorial(5); //=> 120\n *      factorial(5); //=> 120\n *      factorial(5); //=> 120\n *      count; //=> 1\n */\nvar memoizeWith = /*#__PURE__*/_curry2(function memoizeWith(mFn, fn) {\n  var cache = {};\n  return _arity(fn.length, function () {\n    var key = mFn.apply(this, arguments);\n    if (!_has(key, cache)) {\n      cache[key] = fn.apply(this, arguments);\n    }\n    return cache[key];\n  });\n});\nexport default memoizeWith;","import memoizeWith from './memoizeWith';\nimport toString from './toString';\n\n/**\n * Creates a new function that, when invoked, caches the result of calling `fn`\n * for a given argument set and returns the result. Subsequent calls to the\n * memoized `fn` with the same argument set will not result in an additional\n * call to `fn`; instead, the cached result for that set of arguments will be\n * returned.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (*... -> a) -> (*... -> a)\n * @param {Function} fn The function to memoize.\n * @return {Function} Memoized version of `fn`.\n * @see R.memoizeWith\n * @deprecated since v0.25.0\n * @example\n *\n *      let count = 0;\n *      const factorial = R.memoize(n => {\n *        count += 1;\n *        return R.product(R.range(1, n + 1));\n *      });\n *      factorial(5); //=> 120\n *      factorial(5); //=> 120\n *      factorial(5); //=> 120\n *      count; //=> 1\n */\nvar memoize = /*#__PURE__*/memoizeWith(function () {\n  return toString(arguments);\n});\nexport default memoize;","import _assign from './internal/_assign';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Create a new object with the own properties of the first object merged with\n * the own properties of the second object. If a key exists in both objects,\n * the value from the second object will be used.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> {k: v} -> {k: v}\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.mergeDeepRight, R.mergeWith, R.mergeWithKey\n * @example\n *\n *      R.merge({ 'name': 'fred', 'age': 10 }, { 'age': 40 });\n *      //=> { 'name': 'fred', 'age': 40 }\n *\n *      var resetToDefault = R.merge(R.__, {x: 0});\n *      resetToDefault({x: 5, y: 2}); //=> {x: 0, y: 2}\n * @symb R.merge({ x: 1, y: 2 }, { y: 5, z: 3 }) = { x: 1, y: 5, z: 3 }\n */\nvar merge = /*#__PURE__*/_curry2(function merge(l, r) {\n  return _assign({}, l, r);\n});\nexport default merge;","import _assign from './internal/_assign';\nimport _curry1 from './internal/_curry1';\n\n/**\n * Merges a list of objects together into one object.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig [{k: v}] -> {k: v}\n * @param {Array} list An array of objects\n * @return {Object} A merged object.\n * @see R.reduce\n * @example\n *\n *      R.mergeAll([{foo:1},{bar:2},{baz:3}]); //=> {foo:1,bar:2,baz:3}\n *      R.mergeAll([{foo:1},{foo:2},{bar:2}]); //=> {foo:2,bar:2}\n * @symb R.mergeAll([{ x: 1 }, { y: 2 }, { z: 3 }]) = { x: 1, y: 2, z: 3 }\n */\nvar mergeAll = /*#__PURE__*/_curry1(function mergeAll(list) {\n  return _assign.apply(null, [{}].concat(list));\n});\nexport default mergeAll;","import _curry3 from './internal/_curry3';\nimport _has from './internal/_has';\n\n/**\n * Creates a new object with the own properties of the two provided objects. If\n * a key exists in both objects, the provided function is applied to the key\n * and the values associated with the key in each object, with the result being\n * used as the value associated with the key in the returned object.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.mergeDeepWithKey, R.merge, R.mergeWith\n * @example\n *\n *      let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r\n *      R.mergeWithKey(concatValues,\n *                     { a: true, thing: 'foo', values: [10, 20] },\n *                     { b: true, thing: 'bar', values: [15, 35] });\n *      //=> { a: true, b: true, thing: 'bar', values: [10, 20, 15, 35] }\n * @symb R.mergeWithKey(f, { x: 1, y: 2 }, { y: 5, z: 3 }) = { x: 1, y: f('y', 2, 5), z: 3 }\n */\nvar mergeWithKey = /*#__PURE__*/_curry3(function mergeWithKey(fn, l, r) {\n  var result = {};\n  var k;\n\n  for (k in l) {\n    if (_has(k, l)) {\n      result[k] = _has(k, r) ? fn(k, l[k], r[k]) : l[k];\n    }\n  }\n\n  for (k in r) {\n    if (_has(k, r) && !_has(k, result)) {\n      result[k] = r[k];\n    }\n  }\n\n  return result;\n});\nexport default mergeWithKey;","import _curry3 from './internal/_curry3';\nimport _isObject from './internal/_isObject';\nimport mergeWithKey from './mergeWithKey';\n\n/**\n * Creates a new object with the own properties of the two provided objects.\n * If a key exists in both objects:\n * - and both associated values are also objects then the values will be\n *   recursively merged.\n * - otherwise the provided function is applied to the key and associated values\n *   using the resulting value as the new value associated with the key.\n * If a key only exists in one object, the value will be associated with the key\n * of the resulting object.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Object\n * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} lObj\n * @param {Object} rObj\n * @return {Object}\n * @see R.mergeWithKey, R.mergeDeep, R.mergeDeepWith\n * @example\n *\n *      let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r\n *      R.mergeDeepWithKey(concatValues,\n *                         { a: true, c: { thing: 'foo', values: [10, 20] }},\n *                         { b: true, c: { thing: 'bar', values: [15, 35] }});\n *      //=> { a: true, b: true, c: { thing: 'bar', values: [10, 20, 15, 35] }}\n */\nvar mergeDeepWithKey = /*#__PURE__*/_curry3(function mergeDeepWithKey(fn, lObj, rObj) {\n  return mergeWithKey(function (k, lVal, rVal) {\n    if (_isObject(lVal) && _isObject(rVal)) {\n      return mergeDeepWithKey(fn, lVal, rVal);\n    } else {\n      return fn(k, lVal, rVal);\n    }\n  }, lObj, rObj);\n});\nexport default mergeDeepWithKey;","import _curry2 from './internal/_curry2';\nimport mergeDeepWithKey from './mergeDeepWithKey';\n\n/**\n * Creates a new object with the own properties of the first object merged with\n * the own properties of the second object. If a key exists in both objects:\n * - and both values are objects, the two values will be recursively merged\n * - otherwise the value from the first object will be used.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Object\n * @sig {a} -> {a} -> {a}\n * @param {Object} lObj\n * @param {Object} rObj\n * @return {Object}\n * @see R.merge, R.mergeDeepRight, R.mergeDeepWith, R.mergeDeepWithKey\n * @example\n *\n *      R.mergeDeepLeft({ name: 'fred', age: 10, contact: { email: 'moo@example.com' }},\n *                      { age: 40, contact: { email: 'baa@example.com' }});\n *      //=> { name: 'fred', age: 10, contact: { email: 'moo@example.com' }}\n */\nvar mergeDeepLeft = /*#__PURE__*/_curry2(function mergeDeepLeft(lObj, rObj) {\n  return mergeDeepWithKey(function (k, lVal, rVal) {\n    return lVal;\n  }, lObj, rObj);\n});\nexport default mergeDeepLeft;","import _curry2 from './internal/_curry2';\nimport mergeDeepWithKey from './mergeDeepWithKey';\n\n/**\n * Creates a new object with the own properties of the first object merged with\n * the own properties of the second object. If a key exists in both objects:\n * - and both values are objects, the two values will be recursively merged\n * - otherwise the value from the second object will be used.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Object\n * @sig {a} -> {a} -> {a}\n * @param {Object} lObj\n * @param {Object} rObj\n * @return {Object}\n * @see R.merge, R.mergeDeepLeft, R.mergeDeepWith, R.mergeDeepWithKey\n * @example\n *\n *      R.mergeDeepRight({ name: 'fred', age: 10, contact: { email: 'moo@example.com' }},\n *                       { age: 40, contact: { email: 'baa@example.com' }});\n *      //=> { name: 'fred', age: 40, contact: { email: 'baa@example.com' }}\n */\nvar mergeDeepRight = /*#__PURE__*/_curry2(function mergeDeepRight(lObj, rObj) {\n  return mergeDeepWithKey(function (k, lVal, rVal) {\n    return rVal;\n  }, lObj, rObj);\n});\nexport default mergeDeepRight;","import _curry3 from './internal/_curry3';\nimport mergeDeepWithKey from './mergeDeepWithKey';\n\n/**\n * Creates a new object with the own properties of the two provided objects.\n * If a key exists in both objects:\n * - and both associated values are also objects then the values will be\n *   recursively merged.\n * - otherwise the provided function is applied to associated values using the\n *   resulting value as the new value associated with the key.\n * If a key only exists in one object, the value will be associated with the key\n * of the resulting object.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Object\n * @sig ((a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} lObj\n * @param {Object} rObj\n * @return {Object}\n * @see R.mergeWith, R.mergeDeep, R.mergeDeepWithKey\n * @example\n *\n *      R.mergeDeepWith(R.concat,\n *                      { a: true, c: { values: [10, 20] }},\n *                      { b: true, c: { values: [15, 35] }});\n *      //=> { a: true, b: true, c: { values: [10, 20, 15, 35] }}\n */\nvar mergeDeepWith = /*#__PURE__*/_curry3(function mergeDeepWith(fn, lObj, rObj) {\n  return mergeDeepWithKey(function (k, lVal, rVal) {\n    return fn(lVal, rVal);\n  }, lObj, rObj);\n});\nexport default mergeDeepWith;","import _curry3 from './internal/_curry3';\nimport mergeWithKey from './mergeWithKey';\n\n/**\n * Creates a new object with the own properties of the two provided objects. If\n * a key exists in both objects, the provided function is applied to the values\n * associated with the key in each object, with the result being used as the\n * value associated with the key in the returned object.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @sig ((a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.mergeDeepWith, R.merge, R.mergeWithKey\n * @example\n *\n *      R.mergeWith(R.concat,\n *                  { a: true, values: [10, 20] },\n *                  { b: true, values: [15, 35] });\n *      //=> { a: true, b: true, values: [10, 20, 15, 35] }\n */\nvar mergeWith = /*#__PURE__*/_curry3(function mergeWith(fn, l, r) {\n  return mergeWithKey(function (_, _l, _r) {\n    return fn(_l, _r);\n  }, l, r);\n});\nexport default mergeWith;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns the smaller of its two arguments.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> a\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.minBy, R.max\n * @example\n *\n *      R.min(789, 123); //=> 123\n *      R.min('a', 'b'); //=> 'a'\n */\nvar min = /*#__PURE__*/_curry2(function min(a, b) {\n  return b < a ? b : a;\n});\nexport default min;","import _curry3 from './internal/_curry3';\n\n/**\n * Takes a function and two values, and returns whichever value produces the\n * smaller result when passed to the provided function.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Relation\n * @sig Ord b => (a -> b) -> a -> a -> a\n * @param {Function} f\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.min, R.maxBy\n * @example\n *\n *      //  square :: Number -> Number\n *      var square = n => n * n;\n *\n *      R.minBy(square, -3, 2); //=> 2\n *\n *      R.reduce(R.minBy(square), Infinity, [3, -5, 4, 1, -2]); //=> 1\n *      R.reduce(R.minBy(square), Infinity, []); //=> Infinity\n */\nvar minBy = /*#__PURE__*/_curry3(function minBy(f, a, b) {\n  return f(b) < f(a) ? b : a;\n});\nexport default minBy;","import _curry2 from './internal/_curry2';\n\n/**\n * Divides the first parameter by the second and returns the remainder. Note\n * that this function preserves the JavaScript-style behavior for modulo. For\n * mathematical modulo see [`mathMod`](#mathMod).\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The value to the divide.\n * @param {Number} b The pseudo-modulus\n * @return {Number} The result of `b % a`.\n * @see R.mathMod\n * @example\n *\n *      R.modulo(17, 3); //=> 2\n *      // JS behavior:\n *      R.modulo(-17, 3); //=> -2\n *      R.modulo(17, -3); //=> 2\n *\n *      var isOdd = R.modulo(R.__, 2);\n *      isOdd(42); //=> 0\n *      isOdd(21); //=> 1\n */\nvar modulo = /*#__PURE__*/_curry2(function modulo(a, b) {\n  return a % b;\n});\nexport default modulo;","import _curry2 from './internal/_curry2';\n\n/**\n * Multiplies two numbers. Equivalent to `a * b` but curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a * b`.\n * @see R.divide\n * @example\n *\n *      var double = R.multiply(2);\n *      var triple = R.multiply(3);\n *      double(3);       //=>  6\n *      triple(4);       //=> 12\n *      R.multiply(2, 5);  //=> 10\n */\nvar multiply = /*#__PURE__*/_curry2(function multiply(a, b) {\n  return a * b;\n});\nexport default multiply;","import _curry1 from './internal/_curry1';\n\n/**\n * Negates its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number}\n * @example\n *\n *      R.negate(42); //=> -42\n */\nvar negate = /*#__PURE__*/_curry1(function negate(n) {\n  return -n;\n});\nexport default negate;","import _complement from './internal/_complement';\nimport _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xany from './internal/_xany';\nimport any from './any';\n\n/**\n * Returns `true` if no elements of the list match the predicate, `false`\n * otherwise.\n *\n * Dispatches to the `any` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is not satisfied by every element, `false` otherwise.\n * @see R.all, R.any\n * @example\n *\n *      var isEven = n => n % 2 === 0;\n *      var isOdd = n => n % 2 === 1;\n *\n *      R.none(isEven, [1, 3, 5, 7, 9, 11]); //=> true\n *      R.none(isOdd, [1, 3, 5, 7, 8, 11]); //=> false\n */\nvar none = /*#__PURE__*/_curry2( /*#__PURE__*/_complement( /*#__PURE__*/_dispatchable(['any'], _xany, any)));\nexport default none;","import _curry1 from './internal/_curry1';\nimport curryN from './curryN';\nimport nth from './nth';\n\n/**\n * Returns a function which returns its nth argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig Number -> *... -> *\n * @param {Number} n\n * @return {Function}\n * @example\n *\n *      R.nthArg(1)('a', 'b', 'c'); //=> 'b'\n *      R.nthArg(-1)('a', 'b', 'c'); //=> 'c'\n * @symb R.nthArg(-1)(a, b, c) = c\n * @symb R.nthArg(0)(a, b, c) = a\n * @symb R.nthArg(1)(a, b, c) = b\n */\nvar nthArg = /*#__PURE__*/_curry1(function nthArg(n) {\n  var arity = n < 0 ? 1 : n + 1;\n  return curryN(arity, function () {\n    return nth(n, arguments);\n  });\n});\nexport default nthArg;","import _curry3 from './internal/_curry3';\n\n/**\n * `o` is a curried composition function that returns a unary function.\n * Like [`compose`](#compose), `o` performs right-to-left function composition.\n * Unlike [`compose`](#compose), the rightmost function passed to `o` will be\n * invoked with only one argument.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Function\n * @sig (b -> c) -> (a -> b) -> a -> c\n * @param {Function} f\n * @param {Function} g\n * @return {Function}\n * @see R.compose, R.pipe\n * @example\n *\n *      var classyGreeting = name => \"The name's \" + name.last + \", \" + name.first + \" \" + name.last\n *      var yellGreeting = R.o(R.toUpper, classyGreeting);\n *      yellGreeting({first: 'James', last: 'Bond'}); //=> \"THE NAME'S BOND, JAMES BOND\"\n *\n *      R.o(R.multiply(10), R.add(10))(-4) //=> 60\n *\n * @symb R.o(f, g, x) = f(g(x))\n */\nvar o = /*#__PURE__*/_curry3(function o(f, g, x) {\n  return f(g(x));\n});\nexport default o;","export default function _of(x) {\n  return [x];\n}","import _curry1 from './internal/_curry1';\nimport _of from './internal/_of';\n\n/**\n * Returns a singleton array containing the value provided.\n *\n * Note this `of` is different from the ES6 `of`; See\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/of\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig a -> [a]\n * @param {*} x any value\n * @return {Array} An array wrapping `x`.\n * @example\n *\n *      R.of(null); //=> [null]\n *      R.of([42]); //=> [[42]]\n */\nvar of = /*#__PURE__*/_curry1(_of);\nexport default of;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns a partial copy of an object omitting the keys specified.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [String] -> {String: *} -> {String: *}\n * @param {Array} names an array of String property names to omit from the new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with properties from `names` not on it.\n * @see R.pick\n * @example\n *\n *      R.omit(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, c: 3}\n */\nvar omit = /*#__PURE__*/_curry2(function omit(names, obj) {\n  var result = {};\n  var index = {};\n  var idx = 0;\n  var len = names.length;\n\n  while (idx < len) {\n    index[names[idx]] = 1;\n    idx += 1;\n  }\n\n  for (var prop in obj) {\n    if (!index.hasOwnProperty(prop)) {\n      result[prop] = obj[prop];\n    }\n  }\n  return result;\n});\nexport default omit;","import _arity from './internal/_arity';\nimport _curry1 from './internal/_curry1';\n\n/**\n * Accepts a function `fn` and returns a function that guards invocation of\n * `fn` such that `fn` can only ever be called once, no matter how many times\n * the returned function is invoked. The first value calculated is returned in\n * subsequent invocations.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a... -> b) -> (a... -> b)\n * @param {Function} fn The function to wrap in a call-only-once wrapper.\n * @return {Function} The wrapped function.\n * @example\n *\n *      var addOneOnce = R.once(x => x + 1);\n *      addOneOnce(10); //=> 11\n *      addOneOnce(addOneOnce(50)); //=> 11\n */\nvar once = /*#__PURE__*/_curry1(function once(fn) {\n  var called = false;\n  var result;\n  return _arity(fn.length, function () {\n    if (called) {\n      return result;\n    }\n    called = true;\n    result = fn.apply(this, arguments);\n    return result;\n  });\n});\nexport default once;","import _curry3 from './internal/_curry3';\n\n// `Identity` is a functor that holds a single value, where `map` simply\n// transforms the held value with the provided function.\nvar Identity = function (x) {\n  return { value: x, map: function (f) {\n      return Identity(f(x));\n    } };\n};\n\n/**\n * Returns the result of \"setting\" the portion of the given data structure\n * focused by the given lens to the result of applying the given function to\n * the focused value.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> (a -> a) -> s -> s\n * @param {Lens} lens\n * @param {*} v\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n *      var headLens = R.lensIndex(0);\n *\n *      R.over(headLens, R.toUpper, ['foo', 'bar', 'baz']); //=> ['FOO', 'bar', 'baz']\n */\nvar over = /*#__PURE__*/_curry3(function over(lens, f, x) {\n  // The value returned by the getter function is first transformed with `f`,\n  // then set as the value of an `Identity`. This is then mapped over with the\n  // setter function of the lens.\n  return lens(function (y) {\n    return Identity(f(y));\n  })(x).value;\n});\nexport default over;","import _curry2 from './internal/_curry2';\n\n/**\n * Takes two arguments, `fst` and `snd`, and returns `[fst, snd]`.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category List\n * @sig a -> b -> (a,b)\n * @param {*} fst\n * @param {*} snd\n * @return {Array}\n * @see R.objOf, R.of\n * @example\n *\n *      R.pair('foo', 'bar'); //=> ['foo', 'bar']\n */\nvar pair = /*#__PURE__*/_curry2(function pair(fst, snd) {\n  return [fst, snd];\n});\nexport default pair;","import _arity from './_arity';\nimport _curry2 from './_curry2';\n\nexport default function _createPartialApplicator(concat) {\n  return _curry2(function (fn, args) {\n    return _arity(Math.max(0, fn.length - args.length), function () {\n      return fn.apply(this, concat(args, arguments));\n    });\n  });\n}","import _concat from './internal/_concat';\nimport _createPartialApplicator from './internal/_createPartialApplicator';\n\n/**\n * Takes a function `f` and a list of arguments, and returns a function `g`.\n * When applied, `g` returns the result of applying `f` to the arguments\n * provided initially followed by the arguments provided to `g`.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a, b, c, ..., n) -> x) -> [a, b, c, ...] -> ((d, e, f, ..., n) -> x)\n * @param {Function} f\n * @param {Array} args\n * @return {Function}\n * @see R.partialRight\n * @example\n *\n *      var multiply2 = (a, b) => a * b;\n *      var double = R.partial(multiply2, [2]);\n *      double(2); //=> 4\n *\n *      var greet = (salutation, title, firstName, lastName) =>\n *        salutation + ', ' + title + ' ' + firstName + ' ' + lastName + '!';\n *\n *      var sayHello = R.partial(greet, ['Hello']);\n *      var sayHelloToMs = R.partial(sayHello, ['Ms.']);\n *      sayHelloToMs('Jane', 'Jones'); //=> 'Hello, Ms. Jane Jones!'\n * @symb R.partial(f, [a, b])(c, d) = f(a, b, c, d)\n */\nvar partial = /*#__PURE__*/_createPartialApplicator(_concat);\nexport default partial;","import _concat from './internal/_concat';\nimport _createPartialApplicator from './internal/_createPartialApplicator';\nimport flip from './flip';\n\n/**\n * Takes a function `f` and a list of arguments, and returns a function `g`.\n * When applied, `g` returns the result of applying `f` to the arguments\n * provided to `g` followed by the arguments provided initially.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a, b, c, ..., n) -> x) -> [d, e, f, ..., n] -> ((a, b, c, ...) -> x)\n * @param {Function} f\n * @param {Array} args\n * @return {Function}\n * @see R.partial\n * @example\n *\n *      var greet = (salutation, title, firstName, lastName) =>\n *        salutation + ', ' + title + ' ' + firstName + ' ' + lastName + '!';\n *\n *      var greetMsJaneJones = R.partialRight(greet, ['Ms.', 'Jane', 'Jones']);\n *\n *      greetMsJaneJones('Hello'); //=> 'Hello, Ms. Jane Jones!'\n * @symb R.partialRight(f, [a, b])(c, d) = f(c, d, a, b)\n */\nvar partialRight = /*#__PURE__*/_createPartialApplicator( /*#__PURE__*/flip(_concat));\nexport default partialRight;","import filter from './filter';\nimport juxt from './juxt';\nimport reject from './reject';\n\n/**\n * Takes a predicate and a list or other `Filterable` object and returns the\n * pair of filterable objects of the same type of elements which do and do not\n * satisfy, the predicate, respectively. Filterable objects include plain objects or any object\n * that has a filter method such as `Array`.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> [f a, f a]\n * @param {Function} pred A predicate to determine which side the element belongs to.\n * @param {Array} filterable the list (or other filterable) to partition.\n * @return {Array} An array, containing first the subset of elements that satisfy the\n *         predicate, and second the subset of elements that do not satisfy.\n * @see R.filter, R.reject\n * @example\n *\n *      R.partition(R.contains('s'), ['sss', 'ttt', 'foo', 'bars']);\n *      // => [ [ 'sss', 'bars' ],  [ 'ttt', 'foo' ] ]\n *\n *      R.partition(R.contains('s'), { a: 'sss', b: 'ttt', foo: 'bars' });\n *      // => [ { a: 'sss', foo: 'bars' }, { b: 'ttt' }  ]\n */\nvar partition = /*#__PURE__*/juxt([filter, reject]);\nexport default partition;","import _curry3 from './internal/_curry3';\nimport equals from './equals';\nimport path from './path';\n\n/**\n * Determines whether a nested path on an object has a specific value, in\n * [`R.equals`](#equals) terms. Most likely used to filter a list.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Relation\n * @typedefn Idx = String | Int\n * @sig [Idx] -> a -> {a} -> Boolean\n * @param {Array} path The path of the nested property to use\n * @param {*} val The value to compare the nested property with\n * @param {Object} obj The object to check the nested property in\n * @return {Boolean} `true` if the value equals the nested object property,\n *         `false` otherwise.\n * @example\n *\n *      var user1 = { address: { zipCode: 90210 } };\n *      var user2 = { address: { zipCode: 55555 } };\n *      var user3 = { name: 'Bob' };\n *      var users = [ user1, user2, user3 ];\n *      var isFamous = R.pathEq(['address', 'zipCode'], 90210);\n *      R.filter(isFamous, users); //=> [ user1 ]\n */\nvar pathEq = /*#__PURE__*/_curry3(function pathEq(_path, val, obj) {\n  return equals(path(_path, obj), val);\n});\nexport default pathEq;","import _curry3 from './internal/_curry3';\nimport defaultTo from './defaultTo';\nimport path from './path';\n\n/**\n * If the given, non-null object has a value at the given path, returns the\n * value at that path. Otherwise returns the provided default value.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Object\n * @typedefn Idx = String | Int\n * @sig a -> [Idx] -> {a} -> a\n * @param {*} d The default value.\n * @param {Array} p The path to use.\n * @param {Object} obj The object to retrieve the nested property from.\n * @return {*} The data at `path` of the supplied object or the default value.\n * @example\n *\n *      R.pathOr('N/A', ['a', 'b'], {a: {b: 2}}); //=> 2\n *      R.pathOr('N/A', ['a', 'b'], {c: {b: 2}}); //=> \"N/A\"\n */\nvar pathOr = /*#__PURE__*/_curry3(function pathOr(d, p, obj) {\n  return defaultTo(d, path(p, obj));\n});\nexport default pathOr;","import _curry3 from './internal/_curry3';\nimport path from './path';\n\n/**\n * Returns `true` if the specified object property at given path satisfies the\n * given predicate; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Logic\n * @typedefn Idx = String | Int\n * @sig (a -> Boolean) -> [Idx] -> {a} -> Boolean\n * @param {Function} pred\n * @param {Array} propPath\n * @param {*} obj\n * @return {Boolean}\n * @see R.propSatisfies, R.path\n * @example\n *\n *      R.pathSatisfies(y => y > 0, ['x', 'y'], {x: {y: 2}}); //=> true\n */\nvar pathSatisfies = /*#__PURE__*/_curry3(function pathSatisfies(pred, propPath, obj) {\n  return propPath.length > 0 && pred(path(propPath, obj));\n});\nexport default pathSatisfies;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns a partial copy of an object containing only the keys specified. If\n * the key does not exist, the property is ignored.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> {k: v}\n * @param {Array} names an array of String property names to copy onto a new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties from `names` on it.\n * @see R.omit, R.props\n * @example\n *\n *      R.pick(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}\n *      R.pick(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1}\n */\nvar pick = /*#__PURE__*/_curry2(function pick(names, obj) {\n  var result = {};\n  var idx = 0;\n  while (idx < names.length) {\n    if (names[idx] in obj) {\n      result[names[idx]] = obj[names[idx]];\n    }\n    idx += 1;\n  }\n  return result;\n});\nexport default pick;","import _curry2 from './internal/_curry2';\n\n/**\n * Similar to `pick` except that this one includes a `key: undefined` pair for\n * properties that don't exist.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> {k: v}\n * @param {Array} names an array of String property names to copy onto a new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties from `names` on it.\n * @see R.pick\n * @example\n *\n *      R.pickAll(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}\n *      R.pickAll(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, e: undefined, f: undefined}\n */\nvar pickAll = /*#__PURE__*/_curry2(function pickAll(names, obj) {\n  var result = {};\n  var idx = 0;\n  var len = names.length;\n  while (idx < len) {\n    var name = names[idx];\n    result[name] = obj[name];\n    idx += 1;\n  }\n  return result;\n});\nexport default pickAll;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns a partial copy of an object containing only the keys that satisfy\n * the supplied predicate.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @sig ((v, k) -> Boolean) -> {k: v} -> {k: v}\n * @param {Function} pred A predicate to determine whether or not a key\n *        should be included on the output object.\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties that satisfy `pred`\n *         on it.\n * @see R.pick, R.filter\n * @example\n *\n *      var isUpperCase = (val, key) => key.toUpperCase() === key;\n *      R.pickBy(isUpperCase, {a: 1, b: 2, A: 3, B: 4}); //=> {A: 3, B: 4}\n */\nvar pickBy = /*#__PURE__*/_curry2(function pickBy(test, obj) {\n  var result = {};\n  for (var prop in obj) {\n    if (test(obj[prop], prop, obj)) {\n      result[prop] = obj[prop];\n    }\n  }\n  return result;\n});\nexport default pickBy;","import composeK from './composeK';\nimport reverse from './reverse';\n\n/**\n * Returns the left-to-right Kleisli composition of the provided functions,\n * each of which must return a value of a type supported by [`chain`](#chain).\n *\n * `R.pipeK(f, g, h)` is equivalent to `R.pipe(f, R.chain(g), R.chain(h))`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Function\n * @sig Chain m => ((a -> m b), (b -> m c), ..., (y -> m z)) -> (a -> m z)\n * @param {...Function}\n * @return {Function}\n * @see R.composeK\n * @example\n *\n *      //  parseJson :: String -> Maybe *\n *      //  get :: String -> Object -> Maybe *\n *\n *      //  getStateCode :: Maybe String -> Maybe String\n *      var getStateCode = R.pipeK(\n *        parseJson,\n *        get('user'),\n *        get('address'),\n *        get('state'),\n *        R.compose(Maybe.of, R.toUpper)\n *      );\n *\n *      getStateCode('{\"user\":{\"address\":{\"state\":\"ny\"}}}');\n *      //=> Just('NY')\n *      getStateCode('[Invalid JSON]');\n *      //=> Nothing()\n * @symb R.pipeK(f, g, h)(a) = R.chain(h, R.chain(g, f(a)))\n */\nexport default function pipeK() {\n  if (arguments.length === 0) {\n    throw new Error('pipeK requires at least one argument');\n  }\n  return composeK.apply(this, reverse(arguments));\n}","import _concat from './internal/_concat';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Returns a new list with the given element at the front, followed by the\n * contents of the list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} el The item to add to the head of the output list.\n * @param {Array} list The array to add to the tail of the output list.\n * @return {Array} A new array.\n * @see R.append\n * @example\n *\n *      R.prepend('fee', ['fi', 'fo', 'fum']); //=> ['fee', 'fi', 'fo', 'fum']\n */\nvar prepend = /*#__PURE__*/_curry2(function prepend(el, list) {\n  return _concat([el], list);\n});\nexport default prepend;","import multiply from './multiply';\nimport reduce from './reduce';\n\n/**\n * Multiplies together all the elements of a list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list An array of numbers\n * @return {Number} The product of all the numbers in the list.\n * @see R.reduce\n * @example\n *\n *      R.product([2,4,6,8,100,1]); //=> 38400\n */\nvar product = /*#__PURE__*/reduce(multiply, 1);\nexport default product;","import _curry2 from './internal/_curry2';\nimport curryN from './curryN';\n\n/**\n * Accepts a function `fn` and a list of transformer functions and returns a\n * new curried function. When the new function is invoked, it calls the\n * function `fn` with parameters consisting of the result of calling each\n * supplied handler on successive arguments to the new function.\n *\n * If more arguments are passed to the returned function than transformer\n * functions, those arguments are passed directly to `fn` as additional\n * parameters. If you expect additional arguments that don't need to be\n * transformed, although you can ignore them, it's best to pass an identity\n * function so that the new function reports the correct arity.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig ((x1, x2, ...) -> z) -> [(a -> x1), (b -> x2), ...] -> (a -> b -> ... -> z)\n * @param {Function} fn The function to wrap.\n * @param {Array} transformers A list of transformer functions\n * @return {Function} The wrapped function.\n * @see R.converge\n * @example\n *\n *      R.useWith(Math.pow, [R.identity, R.identity])(3, 4); //=> 81\n *      R.useWith(Math.pow, [R.identity, R.identity])(3)(4); //=> 81\n *      R.useWith(Math.pow, [R.dec, R.inc])(3, 4); //=> 32\n *      R.useWith(Math.pow, [R.dec, R.inc])(3)(4); //=> 32\n * @symb R.useWith(f, [g, h])(a, b) = f(g(a), h(b))\n */\nvar useWith = /*#__PURE__*/_curry2(function useWith(fn, transformers) {\n  return curryN(transformers.length, function () {\n    var args = [];\n    var idx = 0;\n    while (idx < transformers.length) {\n      args.push(transformers[idx].call(this, arguments[idx]));\n      idx += 1;\n    }\n    return fn.apply(this, args.concat(Array.prototype.slice.call(arguments, transformers.length)));\n  });\n});\nexport default useWith;","import _map from './internal/_map';\nimport identity from './identity';\nimport pickAll from './pickAll';\nimport useWith from './useWith';\n\n/**\n * Reasonable analog to SQL `select` statement.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @category Relation\n * @sig [k] -> [{k: v}] -> [{k: v}]\n * @param {Array} props The property names to project\n * @param {Array} objs The objects to query\n * @return {Array} An array of objects with just the `props` properties.\n * @example\n *\n *      var abby = {name: 'Abby', age: 7, hair: 'blond', grade: 2};\n *      var fred = {name: 'Fred', age: 12, hair: 'brown', grade: 7};\n *      var kids = [abby, fred];\n *      R.project(['name', 'grade'], kids); //=> [{name: 'Abby', grade: 2}, {name: 'Fred', grade: 7}]\n */\nvar project = /*#__PURE__*/useWith(_map, [pickAll, identity]); // passing `identity` gives correct arity\nexport default project;","import _curry3 from './internal/_curry3';\nimport equals from './equals';\n\n/**\n * Returns `true` if the specified object property is equal, in\n * [`R.equals`](#equals) terms, to the given value; `false` otherwise.\n * You can test multiple properties with [`R.where`](#where).\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig String -> a -> Object -> Boolean\n * @param {String} name\n * @param {*} val\n * @param {*} obj\n * @return {Boolean}\n * @see R.whereEq, R.propSatisfies, R.equals\n * @example\n *\n *      var abby = {name: 'Abby', age: 7, hair: 'blond'};\n *      var fred = {name: 'Fred', age: 12, hair: 'brown'};\n *      var rusty = {name: 'Rusty', age: 10, hair: 'brown'};\n *      var alois = {name: 'Alois', age: 15, disposition: 'surly'};\n *      var kids = [abby, fred, rusty, alois];\n *      var hasBrownHair = R.propEq('hair', 'brown');\n *      R.filter(hasBrownHair, kids); //=> [fred, rusty]\n */\nvar propEq = /*#__PURE__*/_curry3(function propEq(name, val, obj) {\n  return equals(val, obj[name]);\n});\nexport default propEq;","import _curry3 from './internal/_curry3';\nimport is from './is';\n\n/**\n * Returns `true` if the specified object property is of the given type;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Type\n * @sig Type -> String -> Object -> Boolean\n * @param {Function} type\n * @param {String} name\n * @param {*} obj\n * @return {Boolean}\n * @see R.is, R.propSatisfies\n * @example\n *\n *      R.propIs(Number, 'x', {x: 1, y: 2});  //=> true\n *      R.propIs(Number, 'x', {x: 'foo'});    //=> false\n *      R.propIs(Number, 'x', {});            //=> false\n */\nvar propIs = /*#__PURE__*/_curry3(function propIs(type, name, obj) {\n  return is(type, obj[name]);\n});\nexport default propIs;","import _curry3 from './internal/_curry3';\nimport _has from './internal/_has';\n\n/**\n * If the given, non-null object has an own property with the specified name,\n * returns the value of that property. Otherwise returns the provided default\n * value.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Object\n * @sig a -> String -> Object -> a\n * @param {*} val The default value.\n * @param {String} p The name of the property to return.\n * @param {Object} obj The object to query.\n * @return {*} The value of given property of the supplied object or the default value.\n * @example\n *\n *      var alice = {\n *        name: 'ALICE',\n *        age: 101\n *      };\n *      var favorite = R.prop('favoriteLibrary');\n *      var favoriteWithDefault = R.propOr('Ramda', 'favoriteLibrary');\n *\n *      favorite(alice);  //=> undefined\n *      favoriteWithDefault(alice);  //=> 'Ramda'\n */\nvar propOr = /*#__PURE__*/_curry3(function propOr(val, p, obj) {\n  return obj != null && _has(p, obj) ? obj[p] : val;\n});\nexport default propOr;","import _curry3 from './internal/_curry3';\n\n/**\n * Returns `true` if the specified object property satisfies the given\n * predicate; `false` otherwise. You can test multiple properties with\n * [`R.where`](#where).\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Logic\n * @sig (a -> Boolean) -> String -> {String: a} -> Boolean\n * @param {Function} pred\n * @param {String} name\n * @param {*} obj\n * @return {Boolean}\n * @see R.where, R.propEq, R.propIs\n * @example\n *\n *      R.propSatisfies(x => x > 0, 'x', {x: 1, y: 2}); //=> true\n */\nvar propSatisfies = /*#__PURE__*/_curry3(function propSatisfies(pred, name, obj) {\n  return pred(obj[name]);\n});\nexport default propSatisfies;","import _curry2 from './internal/_curry2';\n\n/**\n * Acts as multiple `prop`: array of keys in, array of values out. Preserves\n * order.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> [v]\n * @param {Array} ps The property names to fetch\n * @param {Object} obj The object to query\n * @return {Array} The corresponding values or partially applied function.\n * @example\n *\n *      R.props(['x', 'y'], {x: 1, y: 2}); //=> [1, 2]\n *      R.props(['c', 'a', 'b'], {b: 2, a: 1}); //=> [undefined, 1, 2]\n *\n *      var fullName = R.compose(R.join(' '), R.props(['first', 'last']));\n *      fullName({last: 'Bullet-Tooth', age: 33, first: 'Tony'}); //=> 'Tony Bullet-Tooth'\n */\nvar props = /*#__PURE__*/_curry2(function props(ps, obj) {\n  var len = ps.length;\n  var out = [];\n  var idx = 0;\n\n  while (idx < len) {\n    out[idx] = obj[ps[idx]];\n    idx += 1;\n  }\n\n  return out;\n});\nexport default props;","import _curry2 from './internal/_curry2';\nimport _isNumber from './internal/_isNumber';\n\n/**\n * Returns a list of numbers from `from` (inclusive) to `to` (exclusive).\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> Number -> [Number]\n * @param {Number} from The first number in the list.\n * @param {Number} to One more than the last number in the list.\n * @return {Array} The list of numbers in tthe set `[a, b)`.\n * @example\n *\n *      R.range(1, 5);    //=> [1, 2, 3, 4]\n *      R.range(50, 53);  //=> [50, 51, 52]\n */\nvar range = /*#__PURE__*/_curry2(function range(from, to) {\n  if (!(_isNumber(from) && _isNumber(to))) {\n    throw new TypeError('Both arguments to range must be numbers');\n  }\n  var result = [];\n  var n = from;\n  while (n < to) {\n    result.push(n);\n    n += 1;\n  }\n  return result;\n});\nexport default range;","import _curry3 from './internal/_curry3';\n\n/**\n * Returns a single item by iterating through the list, successively calling\n * the iterator function and passing it an accumulator value and the current\n * value from the array, and then passing the result to the next call.\n *\n * Similar to [`reduce`](#reduce), except moves through the input list from the\n * right to the left.\n *\n * The iterator function receives two values: *(value, acc)*, while the arguments'\n * order of `reduce`'s iterator function is *(acc, value)*.\n *\n * Note: `R.reduceRight` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.reduceRight` method. For more details\n * on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduceRight#Description\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, b) -> b) -> b -> [a] -> b\n * @param {Function} fn The iterator function. Receives two values, the current element from the array\n *        and the accumulator.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduce, R.addIndex\n * @example\n *\n *      R.reduceRight(R.subtract, 0, [1, 2, 3, 4]) // => (1 - (2 - (3 - (4 - 0)))) = -2\n *      //    -               -2\n *      //   / \\              / \\\n *      //  1   -            1   3\n *      //     / \\              / \\\n *      //    2   -     ==>    2  -1\n *      //       / \\              / \\\n *      //      3   -            3   4\n *      //         / \\              / \\\n *      //        4   0            4   0\n *\n * @symb R.reduceRight(f, a, [b, c, d]) = f(b, f(c, f(d, a)))\n */\nvar reduceRight = /*#__PURE__*/_curry3(function reduceRight(fn, acc, list) {\n  var idx = list.length - 1;\n  while (idx >= 0) {\n    acc = fn(list[idx], acc);\n    idx -= 1;\n  }\n  return acc;\n});\nexport default reduceRight;","import _curryN from './internal/_curryN';\nimport _reduce from './internal/_reduce';\nimport _reduced from './internal/_reduced';\n\n/**\n * Like [`reduce`](#reduce), `reduceWhile` returns a single item by iterating\n * through the list, successively calling the iterator function. `reduceWhile`\n * also takes a predicate that is evaluated before each step. If the predicate\n * returns `false`, it \"short-circuits\" the iteration and returns the current\n * value of the accumulator.\n *\n * @func\n * @memberOf R\n * @since v0.22.0\n * @category List\n * @sig ((a, b) -> Boolean) -> ((a, b) -> a) -> a -> [b] -> a\n * @param {Function} pred The predicate. It is passed the accumulator and the\n *        current element.\n * @param {Function} fn The iterator function. Receives two values, the\n *        accumulator and the current element.\n * @param {*} a The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduce, R.reduced\n * @example\n *\n *      var isOdd = (acc, x) => x % 2 === 1;\n *      var xs = [1, 3, 5, 60, 777, 800];\n *      R.reduceWhile(isOdd, R.add, 0, xs); //=> 9\n *\n *      var ys = [2, 4, 6]\n *      R.reduceWhile(isOdd, R.add, 111, ys); //=> 111\n */\nvar reduceWhile = /*#__PURE__*/_curryN(4, [], function _reduceWhile(pred, fn, a, list) {\n  return _reduce(function (acc, x) {\n    return pred(acc, x) ? fn(acc, x) : _reduced(acc);\n  }, a, list);\n});\nexport default reduceWhile;","import _curry1 from './internal/_curry1';\nimport _reduced from './internal/_reduced';\n\n/**\n * Returns a value wrapped to indicate that it is the final value of the reduce\n * and transduce functions. The returned value should be considered a black\n * box: the internal structure is not guaranteed to be stable.\n *\n * Note: this optimization is unavailable to functions not explicitly listed\n * above. For instance, it is not currently supported by\n * [`reduceRight`](#reduceRight).\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category List\n * @sig a -> *\n * @param {*} x The final value of the reduce.\n * @return {*} The wrapped value.\n * @see R.reduce, R.transduce\n * @example\n *\n *     R.reduce(\n *       (acc, item) => item > 3 ? R.reduced(acc) : acc.concat(item),\n *       [],\n *       [1, 2, 3, 4, 5]) // [1, 2, 3]\n */\nvar reduced = /*#__PURE__*/_curry1(_reduced);\nexport default reduced;","import _curry2 from './internal/_curry2';\n\n/**\n * Calls an input function `n` times, returning an array containing the results\n * of those function calls.\n *\n * `fn` is passed one argument: The current value of `n`, which begins at `0`\n * and is gradually incremented to `n - 1`.\n *\n * @func\n * @memberOf R\n * @since v0.2.3\n * @category List\n * @sig (Number -> a) -> Number -> [a]\n * @param {Function} fn The function to invoke. Passed one argument, the current value of `n`.\n * @param {Number} n A value between `0` and `n - 1`. Increments after each function call.\n * @return {Array} An array containing the return values of all calls to `fn`.\n * @see R.repeat\n * @example\n *\n *      R.times(R.identity, 5); //=> [0, 1, 2, 3, 4]\n * @symb R.times(f, 0) = []\n * @symb R.times(f, 1) = [f(0)]\n * @symb R.times(f, 2) = [f(0), f(1)]\n */\nvar times = /*#__PURE__*/_curry2(function times(fn, n) {\n  var len = Number(n);\n  var idx = 0;\n  var list;\n\n  if (len < 0 || isNaN(len)) {\n    throw new RangeError('n must be a non-negative number');\n  }\n  list = new Array(len);\n  while (idx < len) {\n    list[idx] = fn(idx);\n    idx += 1;\n  }\n  return list;\n});\nexport default times;","import _curry2 from './internal/_curry2';\nimport always from './always';\nimport times from './times';\n\n/**\n * Returns a fixed list of size `n` containing a specified identical value.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig a -> n -> [a]\n * @param {*} value The value to repeat.\n * @param {Number} n The desired size of the output list.\n * @return {Array} A new array containing `n` `value`s.\n * @see R.times\n * @example\n *\n *      R.repeat('hi', 5); //=> ['hi', 'hi', 'hi', 'hi', 'hi']\n *\n *      var obj = {};\n *      var repeatedObjs = R.repeat(obj, 5); //=> [{}, {}, {}, {}, {}]\n *      repeatedObjs[0] === repeatedObjs[1]; //=> true\n * @symb R.repeat(a, 0) = []\n * @symb R.repeat(a, 1) = [a]\n * @symb R.repeat(a, 2) = [a, a]\n */\nvar repeat = /*#__PURE__*/_curry2(function repeat(value, n) {\n  return times(always(value), n);\n});\nexport default repeat;","import _curry3 from './internal/_curry3';\n\n/**\n * Replace a substring or regex match in a string with a replacement.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category String\n * @sig RegExp|String -> String -> String -> String\n * @param {RegExp|String} pattern A regular expression or a substring to match.\n * @param {String} replacement The string to replace the matches with.\n * @param {String} str The String to do the search and replacement in.\n * @return {String} The result.\n * @example\n *\n *      R.replace('foo', 'bar', 'foo foo foo'); //=> 'bar foo foo'\n *      R.replace(/foo/, 'bar', 'foo foo foo'); //=> 'bar foo foo'\n *\n *      // Use the \"g\" (global) flag to replace all occurrences:\n *      R.replace(/foo/g, 'bar', 'foo foo foo'); //=> 'bar bar bar'\n */\nvar replace = /*#__PURE__*/_curry3(function replace(regex, replacement, str) {\n  return str.replace(regex, replacement);\n});\nexport default replace;","import _curry3 from './internal/_curry3';\n\n/**\n * Scan is similar to [`reduce`](#reduce), but returns a list of successively\n * reduced values from the left\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig ((a, b) -> a) -> a -> [b] -> [a]\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n *        current element from the array\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {Array} A list of all intermediately reduced values.\n * @see R.reduce\n * @example\n *\n *      var numbers = [1, 2, 3, 4];\n *      var factorials = R.scan(R.multiply, 1, numbers); //=> [1, 1, 2, 6, 24]\n * @symb R.scan(f, a, [b, c]) = [a, f(a, b), f(f(a, b), c)]\n */\nvar scan = /*#__PURE__*/_curry3(function scan(fn, acc, list) {\n  var idx = 0;\n  var len = list.length;\n  var result = [acc];\n  while (idx < len) {\n    acc = fn(acc, list[idx]);\n    result[idx + 1] = acc;\n    idx += 1;\n  }\n  return result;\n});\nexport default scan;","import _curry2 from './internal/_curry2';\nimport ap from './ap';\nimport map from './map';\nimport prepend from './prepend';\nimport reduceRight from './reduceRight';\n\n/**\n * Transforms a [Traversable](https://github.com/fantasyland/fantasy-land#traversable)\n * of [Applicative](https://github.com/fantasyland/fantasy-land#applicative) into an\n * Applicative of Traversable.\n *\n * Dispatches to the `sequence` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (Applicative f, Traversable t) => (a -> f a) -> t (f a) -> f (t a)\n * @param {Function} of\n * @param {*} traversable\n * @return {*}\n * @see R.traverse\n * @example\n *\n *      R.sequence(Maybe.of, [Just(1), Just(2), Just(3)]);   //=> Just([1, 2, 3])\n *      R.sequence(Maybe.of, [Just(1), Just(2), Nothing()]); //=> Nothing()\n *\n *      R.sequence(R.of, Just([1, 2, 3])); //=> [Just(1), Just(2), Just(3)]\n *      R.sequence(R.of, Nothing());       //=> [Nothing()]\n */\nvar sequence = /*#__PURE__*/_curry2(function sequence(of, traversable) {\n  return typeof traversable.sequence === 'function' ? traversable.sequence(of) : reduceRight(function (x, acc) {\n    return ap(map(prepend, x), acc);\n  }, of([]), traversable);\n});\nexport default sequence;","import _curry3 from './internal/_curry3';\nimport always from './always';\nimport over from './over';\n\n/**\n * Returns the result of \"setting\" the portion of the given data structure\n * focused by the given lens to the given value.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> a -> s -> s\n * @param {Lens} lens\n * @param {*} v\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n *      var xLens = R.lensProp('x');\n *\n *      R.set(xLens, 4, {x: 1, y: 2});  //=> {x: 4, y: 2}\n *      R.set(xLens, 8, {x: 1, y: 2});  //=> {x: 8, y: 2}\n */\nvar set = /*#__PURE__*/_curry3(function set(lens, v, x) {\n  return over(lens, always(v), x);\n});\nexport default set;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns a copy of the list, sorted according to the comparator function,\n * which should accept two values at a time and return a negative number if the\n * first value is smaller, a positive number if it's larger, and zero if they\n * are equal. Please note that this is a **copy** of the list. It does not\n * modify the original.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, a) -> Number) -> [a] -> [a]\n * @param {Function} comparator A sorting function :: a -> b -> Int\n * @param {Array} list The list to sort\n * @return {Array} a new array with its elements sorted by the comparator function.\n * @example\n *\n *      var diff = function(a, b) { return a - b; };\n *      R.sort(diff, [4,2,7,5]); //=> [2, 4, 5, 7]\n */\nvar sort = /*#__PURE__*/_curry2(function sort(comparator, list) {\n  return Array.prototype.slice.call(list, 0).sort(comparator);\n});\nexport default sort;","import _curry2 from './internal/_curry2';\n\n/**\n * Sorts the list according to the supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord b => (a -> b) -> [a] -> [a]\n * @param {Function} fn\n * @param {Array} list The list to sort.\n * @return {Array} A new list sorted by the keys generated by `fn`.\n * @example\n *\n *      var sortByFirstItem = R.sortBy(R.prop(0));\n *      var sortByNameCaseInsensitive = R.sortBy(R.compose(R.toLower, R.prop('name')));\n *      var pairs = [[-1, 1], [-2, 2], [-3, 3]];\n *      sortByFirstItem(pairs); //=> [[-3, 3], [-2, 2], [-1, 1]]\n *      var alice = {\n *        name: 'ALICE',\n *        age: 101\n *      };\n *      var bob = {\n *        name: 'Bob',\n *        age: -10\n *      };\n *      var clara = {\n *        name: 'clara',\n *        age: 314.159\n *      };\n *      var people = [clara, bob, alice];\n *      sortByNameCaseInsensitive(people); //=> [alice, bob, clara]\n */\nvar sortBy = /*#__PURE__*/_curry2(function sortBy(fn, list) {\n  return Array.prototype.slice.call(list, 0).sort(function (a, b) {\n    var aa = fn(a);\n    var bb = fn(b);\n    return aa < bb ? -1 : aa > bb ? 1 : 0;\n  });\n});\nexport default sortBy;","import _curry2 from './internal/_curry2';\n\n/**\n * Sorts a list according to a list of comparators.\n *\n * @func\n * @memberOf R\n * @since v0.23.0\n * @category Relation\n * @sig [(a, a) -> Number] -> [a] -> [a]\n * @param {Array} functions A list of comparator functions.\n * @param {Array} list The list to sort.\n * @return {Array} A new list sorted according to the comarator functions.\n * @example\n *\n *      var alice = {\n *        name: 'alice',\n *        age: 40\n *      };\n *      var bob = {\n *        name: 'bob',\n *        age: 30\n *      };\n *      var clara = {\n *        name: 'clara',\n *        age: 40\n *      };\n *      var people = [clara, bob, alice];\n *      var ageNameSort = R.sortWith([\n *        R.descend(R.prop('age')),\n *        R.ascend(R.prop('name'))\n *      ]);\n *      ageNameSort(people); //=> [alice, clara, bob]\n */\nvar sortWith = /*#__PURE__*/_curry2(function sortWith(fns, list) {\n  return Array.prototype.slice.call(list, 0).sort(function (a, b) {\n    var result = 0;\n    var i = 0;\n    while (result === 0 && i < fns.length) {\n      result = fns[i](a, b);\n      i += 1;\n    }\n    return result;\n  });\n});\nexport default sortWith;","import invoker from './invoker';\n\n/**\n * Splits a string into an array of strings based on the given\n * separator.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category String\n * @sig (String | RegExp) -> String -> [String]\n * @param {String|RegExp} sep The pattern.\n * @param {String} str The string to separate into an array.\n * @return {Array} The array of strings from `str` separated by `str`.\n * @see R.join\n * @example\n *\n *      var pathComponents = R.split('/');\n *      R.tail(pathComponents('/usr/local/bin/node')); //=> ['usr', 'local', 'bin', 'node']\n *\n *      R.split('.', 'a.b.c.xyz.d'); //=> ['a', 'b', 'c', 'xyz', 'd']\n */\nvar split = /*#__PURE__*/invoker(1, 'split');\nexport default split;","import _curry2 from './internal/_curry2';\nimport length from './length';\nimport slice from './slice';\n\n/**\n * Splits a given list or string at a given index.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig Number -> [a] -> [[a], [a]]\n * @sig Number -> String -> [String, String]\n * @param {Number} index The index where the array/string is split.\n * @param {Array|String} array The array/string to be split.\n * @return {Array}\n * @example\n *\n *      R.splitAt(1, [1, 2, 3]);          //=> [[1], [2, 3]]\n *      R.splitAt(5, 'hello world');      //=> ['hello', ' world']\n *      R.splitAt(-1, 'foobar');          //=> ['fooba', 'r']\n */\nvar splitAt = /*#__PURE__*/_curry2(function splitAt(index, array) {\n  return [slice(0, index, array), slice(index, length(array), array)];\n});\nexport default splitAt;","import _curry2 from './internal/_curry2';\nimport slice from './slice';\n\n/**\n * Splits a collection into slices of the specified length.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [[a]]\n * @sig Number -> String -> [String]\n * @param {Number} n\n * @param {Array} list\n * @return {Array}\n * @example\n *\n *      R.splitEvery(3, [1, 2, 3, 4, 5, 6, 7]); //=> [[1, 2, 3], [4, 5, 6], [7]]\n *      R.splitEvery(3, 'foobarbaz'); //=> ['foo', 'bar', 'baz']\n */\nvar splitEvery = /*#__PURE__*/_curry2(function splitEvery(n, list) {\n  if (n <= 0) {\n    throw new Error('First argument to splitEvery must be a positive integer');\n  }\n  var result = [];\n  var idx = 0;\n  while (idx < list.length) {\n    result.push(slice(idx, idx += n, list));\n  }\n  return result;\n});\nexport default splitEvery;","import _curry2 from './internal/_curry2';\n\n/**\n * Takes a list and a predicate and returns a pair of lists with the following properties:\n *\n *  - the result of concatenating the two output lists is equivalent to the input list;\n *  - none of the elements of the first output list satisfies the predicate; and\n *  - if the second output list is non-empty, its first element satisfies the predicate.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [[a], [a]]\n * @param {Function} pred The predicate that determines where the array is split.\n * @param {Array} list The array to be split.\n * @return {Array}\n * @example\n *\n *      R.splitWhen(R.equals(2), [1, 2, 3, 1, 2, 3]);   //=> [[1], [2, 3, 1, 2, 3]]\n */\nvar splitWhen = /*#__PURE__*/_curry2(function splitWhen(pred, list) {\n  var idx = 0;\n  var len = list.length;\n  var prefix = [];\n\n  while (idx < len && !pred(list[idx])) {\n    prefix.push(list[idx]);\n    idx += 1;\n  }\n\n  return [prefix, Array.prototype.slice.call(list, idx)];\n});\nexport default splitWhen;","import _curry2 from './internal/_curry2';\nimport equals from './equals';\nimport take from './take';\n\n/**\n * Checks if a list starts with the provided values\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category List\n * @sig [a] -> Boolean\n * @sig String -> Boolean\n * @param {*} prefix\n * @param {*} list\n * @return {Boolean}\n * @example\n *\n *      R.startsWith('a', 'abc')                //=> true\n *      R.startsWith('b', 'abc')                //=> false\n *      R.startsWith(['a'], ['a', 'b', 'c'])    //=> true\n *      R.startsWith(['b'], ['a', 'b', 'c'])    //=> false\n */\nvar startsWith = /*#__PURE__*/_curry2(function (prefix, list) {\n  return equals(take(prefix.length, list), prefix);\n});\nexport default startsWith;","import _curry2 from './internal/_curry2';\n\n/**\n * Subtracts its second argument from its first argument.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a - b`.\n * @see R.add\n * @example\n *\n *      R.subtract(10, 8); //=> 2\n *\n *      var minus5 = R.subtract(R.__, 5);\n *      minus5(17); //=> 12\n *\n *      var complementaryAngle = R.subtract(90);\n *      complementaryAngle(30); //=> 60\n *      complementaryAngle(72); //=> 18\n */\nvar subtract = /*#__PURE__*/_curry2(function subtract(a, b) {\n  return Number(a) - Number(b);\n});\nexport default subtract;","import _curry2 from './internal/_curry2';\nimport concat from './concat';\nimport difference from './difference';\n\n/**\n * Finds the set (i.e. no duplicates) of all elements contained in the first or\n * second list, but not both.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` or `list2`, but not both.\n * @see R.symmetricDifferenceWith, R.difference, R.differenceWith\n * @example\n *\n *      R.symmetricDifference([1,2,3,4], [7,6,5,4,3]); //=> [1,2,7,6,5]\n *      R.symmetricDifference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5,1,2]\n */\nvar symmetricDifference = /*#__PURE__*/_curry2(function symmetricDifference(list1, list2) {\n  return concat(difference(list1, list2), difference(list2, list1));\n});\nexport default symmetricDifference;","import _curry3 from './internal/_curry3';\nimport concat from './concat';\nimport differenceWith from './differenceWith';\n\n/**\n * Finds the set (i.e. no duplicates) of all elements contained in the first or\n * second list, but not both. Duplication is determined according to the value\n * returned by applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Relation\n * @sig ((a, a) -> Boolean) -> [a] -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` or `list2`, but not both.\n * @see R.symmetricDifference, R.difference, R.differenceWith\n * @example\n *\n *      var eqA = R.eqBy(R.prop('a'));\n *      var l1 = [{a: 1}, {a: 2}, {a: 3}, {a: 4}];\n *      var l2 = [{a: 3}, {a: 4}, {a: 5}, {a: 6}];\n *      R.symmetricDifferenceWith(eqA, l1, l2); //=> [{a: 1}, {a: 2}, {a: 5}, {a: 6}]\n */\nvar symmetricDifferenceWith = /*#__PURE__*/_curry3(function symmetricDifferenceWith(pred, list1, list2) {\n  return concat(differenceWith(pred, list1, list2), differenceWith(pred, list2, list1));\n});\nexport default symmetricDifferenceWith;","import _curry2 from './internal/_curry2';\nimport slice from './slice';\n\n/**\n * Returns a new list containing the last `n` elements of a given list, passing\n * each value to the supplied predicate function, and terminating when the\n * predicate function returns `false`. Excludes the element that caused the\n * predicate function to fail. The predicate function is passed one argument:\n * *(value)*.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @sig (a -> Boolean) -> String -> String\n * @param {Function} fn The function called per iteration.\n * @param {Array} xs The collection to iterate over.\n * @return {Array} A new array.\n * @see R.dropLastWhile, R.addIndex\n * @example\n *\n *      var isNotOne = x => x !== 1;\n *\n *      R.takeLastWhile(isNotOne, [1, 2, 3, 4]); //=> [2, 3, 4]\n *\n *      R.takeLastWhile(x => x !== 'R' , 'Ramda'); //=> 'amda'\n */\nvar takeLastWhile = /*#__PURE__*/_curry2(function takeLastWhile(fn, xs) {\n  var idx = xs.length - 1;\n  while (idx >= 0 && fn(xs[idx])) {\n    idx -= 1;\n  }\n  return slice(idx + 1, Infinity, xs);\n});\nexport default takeLastWhile;","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XTakeWhile = /*#__PURE__*/function () {\n  function XTakeWhile(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XTakeWhile.prototype['@@transducer/init'] = _xfBase.init;\n  XTakeWhile.prototype['@@transducer/result'] = _xfBase.result;\n  XTakeWhile.prototype['@@transducer/step'] = function (result, input) {\n    return this.f(input) ? this.xf['@@transducer/step'](result, input) : _reduced(result);\n  };\n\n  return XTakeWhile;\n}();\n\nvar _xtakeWhile = /*#__PURE__*/_curry2(function _xtakeWhile(f, xf) {\n  return new XTakeWhile(f, xf);\n});\nexport default _xtakeWhile;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xtakeWhile from './internal/_xtakeWhile';\nimport slice from './slice';\n\n/**\n * Returns a new list containing the first `n` elements of a given list,\n * passing each value to the supplied predicate function, and terminating when\n * the predicate function returns `false`. Excludes the element that caused the\n * predicate function to fail. The predicate function is passed one argument:\n * *(value)*.\n *\n * Dispatches to the `takeWhile` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @sig (a -> Boolean) -> String -> String\n * @param {Function} fn The function called per iteration.\n * @param {Array} xs The collection to iterate over.\n * @return {Array} A new array.\n * @see R.dropWhile, R.transduce, R.addIndex\n * @example\n *\n *      var isNotFour = x => x !== 4;\n *\n *      R.takeWhile(isNotFour, [1, 2, 3, 4, 3, 2, 1]); //=> [1, 2, 3]\n *\n *      R.takeWhile(x => x !== 'd' , 'Ramda'); //=> 'Ram'\n */\nvar takeWhile = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['takeWhile'], _xtakeWhile, function takeWhile(fn, xs) {\n  var idx = 0;\n  var len = xs.length;\n  while (idx < len && fn(xs[idx])) {\n    idx += 1;\n  }\n  return slice(0, idx, xs);\n}));\nexport default takeWhile;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XTap = /*#__PURE__*/function () {\n  function XTap(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XTap.prototype['@@transducer/init'] = _xfBase.init;\n  XTap.prototype['@@transducer/result'] = _xfBase.result;\n  XTap.prototype['@@transducer/step'] = function (result, input) {\n    this.f(input);\n    return this.xf['@@transducer/step'](result, input);\n  };\n\n  return XTap;\n}();\n\nvar _xtap = /*#__PURE__*/_curry2(function _xtap(f, xf) {\n  return new XTap(f, xf);\n});\nexport default _xtap;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xtap from './internal/_xtap';\n\n/**\n * Runs the given function with the supplied object, then returns the object.\n *\n * Acts as a transducer if a transformer is given as second parameter.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a -> *) -> a -> a\n * @param {Function} fn The function to call with `x`. The return value of `fn` will be thrown away.\n * @param {*} x\n * @return {*} `x`.\n * @example\n *\n *      var sayX = x => console.log('x is ' + x);\n *      R.tap(sayX, 100); //=> 100\n *      // logs 'x is 100'\n * @symb R.tap(f, a) = a\n */\nvar tap = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xtap, function tap(fn, x) {\n  fn(x);\n  return x;\n}));\nexport default tap;","import _cloneRegExp from './internal/_cloneRegExp';\nimport _curry2 from './internal/_curry2';\nimport _isRegExp from './internal/_isRegExp';\nimport toString from './toString';\n\n/**\n * Determines whether a given string matches a given regular expression.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category String\n * @sig RegExp -> String -> Boolean\n * @param {RegExp} pattern\n * @param {String} str\n * @return {Boolean}\n * @see R.match\n * @example\n *\n *      R.test(/^x/, 'xyz'); //=> true\n *      R.test(/^y/, 'xyz'); //=> false\n */\nvar test = /*#__PURE__*/_curry2(function test(pattern, str) {\n  if (!_isRegExp(pattern)) {\n    throw new TypeError('‘test’ requires a value of type RegExp as its first argument; received ' + toString(pattern));\n  }\n  return _cloneRegExp(pattern).test(str);\n});\nexport default test;","export default function _isRegExp(x) {\n  return Object.prototype.toString.call(x) === '[object RegExp]';\n}","import invoker from './invoker';\n\n/**\n * The lower case version of a string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to lower case.\n * @return {String} The lower case version of `str`.\n * @see R.toUpper\n * @example\n *\n *      R.toLower('XYZ'); //=> 'xyz'\n */\nvar toLower = /*#__PURE__*/invoker(0, 'toLowerCase');\nexport default toLower;","import _curry1 from './internal/_curry1';\nimport _has from './internal/_has';\n\n/**\n * Converts an object into an array of key, value arrays. Only the object's\n * own properties are used.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Object\n * @sig {String: *} -> [[String,*]]\n * @param {Object} obj The object to extract from\n * @return {Array} An array of key, value arrays from the object's own properties.\n * @see R.fromPairs\n * @example\n *\n *      R.toPairs({a: 1, b: 2, c: 3}); //=> [['a', 1], ['b', 2], ['c', 3]]\n */\nvar toPairs = /*#__PURE__*/_curry1(function toPairs(obj) {\n  var pairs = [];\n  for (var prop in obj) {\n    if (_has(prop, obj)) {\n      pairs[pairs.length] = [prop, obj[prop]];\n    }\n  }\n  return pairs;\n});\nexport default toPairs;","import _curry1 from './internal/_curry1';\n\n/**\n * Converts an object into an array of key, value arrays. The object's own\n * properties and prototype properties are used. Note that the order of the\n * output array is not guaranteed to be consistent across different JS\n * platforms.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Object\n * @sig {String: *} -> [[String,*]]\n * @param {Object} obj The object to extract from\n * @return {Array} An array of key, value arrays from the object's own\n *         and prototype properties.\n * @example\n *\n *      var F = function() { this.x = 'X'; };\n *      F.prototype.y = 'Y';\n *      var f = new F();\n *      R.toPairsIn(f); //=> [['x','X'], ['y','Y']]\n */\nvar toPairsIn = /*#__PURE__*/_curry1(function toPairsIn(obj) {\n  var pairs = [];\n  for (var prop in obj) {\n    pairs[pairs.length] = [prop, obj[prop]];\n  }\n  return pairs;\n});\nexport default toPairsIn;","import invoker from './invoker';\n\n/**\n * The upper case version of a string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to upper case.\n * @return {String} The upper case version of `str`.\n * @see R.toLower\n * @example\n *\n *      R.toUpper('abc'); //=> 'ABC'\n */\nvar toUpper = /*#__PURE__*/invoker(0, 'toUpperCase');\nexport default toUpper;","import _reduce from './internal/_reduce';\nimport _xwrap from './internal/_xwrap';\nimport curryN from './curryN';\n\n/**\n * Initializes a transducer using supplied iterator function. Returns a single\n * item by iterating through the list, successively calling the transformed\n * iterator function and passing it an accumulator value and the current value\n * from the array, and then passing the result to the next call.\n *\n * The iterator function receives two values: *(acc, value)*. It will be\n * wrapped as a transformer to initialize the transducer. A transformer can be\n * passed directly in place of an iterator function. In both cases, iteration\n * may be stopped early with the [`R.reduced`](#reduced) function.\n *\n * A transducer is a function that accepts a transformer and returns a\n * transformer and can be composed directly.\n *\n * A transformer is an an object that provides a 2-arity reducing iterator\n * function, step, 0-arity initial value function, init, and 1-arity result\n * extraction function, result. The step function is used as the iterator\n * function in reduce. The result function is used to convert the final\n * accumulator into the return type and in most cases is\n * [`R.identity`](#identity). The init function can be used to provide an\n * initial accumulator, but is ignored by transduce.\n *\n * The iteration is performed with [`R.reduce`](#reduce) after initializing the transducer.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig (c -> c) -> ((a, b) -> a) -> a -> [b] -> a\n * @param {Function} xf The transducer function. Receives a transformer and returns a transformer.\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n *        current element from the array. Wrapped as transformer, if necessary, and used to\n *        initialize the transducer\n * @param {*} acc The initial accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduce, R.reduced, R.into\n * @example\n *\n *      var numbers = [1, 2, 3, 4];\n *      var transducer = R.compose(R.map(R.add(1)), R.take(2));\n *      R.transduce(transducer, R.flip(R.append), [], numbers); //=> [2, 3]\n *\n *      var isOdd = (x) => x % 2 === 1;\n *      var firstOddTransducer = R.compose(R.filter(isOdd), R.take(1));\n *      R.transduce(firstOddTransducer, R.flip(R.append), [], R.range(0, 100)); //=> [1]\n */\nvar transduce = /*#__PURE__*/curryN(4, function transduce(xf, fn, acc, list) {\n  return _reduce(xf(typeof fn === 'function' ? _xwrap(fn) : fn), acc, list);\n});\nexport default transduce;","import _curry1 from './internal/_curry1';\n\n/**\n * Transposes the rows and columns of a 2D list.\n * When passed a list of `n` lists of length `x`,\n * returns a list of `x` lists of length `n`.\n *\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig [[a]] -> [[a]]\n * @param {Array} list A 2D list\n * @return {Array} A 2D list\n * @example\n *\n *      R.transpose([[1, 'a'], [2, 'b'], [3, 'c']]) //=> [[1, 2, 3], ['a', 'b', 'c']]\n *      R.transpose([[1, 2, 3], ['a', 'b', 'c']]) //=> [[1, 'a'], [2, 'b'], [3, 'c']]\n *\n *      // If some of the rows are shorter than the following rows, their elements are skipped:\n *      R.transpose([[10, 11], [20], [], [30, 31, 32]]) //=> [[10, 20, 30], [11, 31], [32]]\n * @symb R.transpose([[a], [b], [c]]) = [a, b, c]\n * @symb R.transpose([[a, b], [c, d]]) = [[a, c], [b, d]]\n * @symb R.transpose([[a, b], [c]]) = [[a, c], [b]]\n */\nvar transpose = /*#__PURE__*/_curry1(function transpose(outerlist) {\n  var i = 0;\n  var result = [];\n  while (i < outerlist.length) {\n    var innerlist = outerlist[i];\n    var j = 0;\n    while (j < innerlist.length) {\n      if (typeof result[j] === 'undefined') {\n        result[j] = [];\n      }\n      result[j].push(innerlist[j]);\n      j += 1;\n    }\n    i += 1;\n  }\n  return result;\n});\nexport default transpose;","import _curry3 from './internal/_curry3';\nimport map from './map';\nimport sequence from './sequence';\n\n/**\n * Maps an [Applicative](https://github.com/fantasyland/fantasy-land#applicative)-returning\n * function over a [Traversable](https://github.com/fantasyland/fantasy-land#traversable),\n * then uses [`sequence`](#sequence) to transform the resulting Traversable of Applicative\n * into an Applicative of Traversable.\n *\n * Dispatches to the `traverse` method of the third argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (Applicative f, Traversable t) => (a -> f a) -> (a -> f b) -> t a -> f (t b)\n * @param {Function} of\n * @param {Function} f\n * @param {*} traversable\n * @return {*}\n * @see R.sequence\n * @example\n *\n *      // Returns `Nothing` if the given divisor is `0`\n *      safeDiv = n => d => d === 0 ? Nothing() : Just(n / d)\n *\n *      R.traverse(Maybe.of, safeDiv(10), [2, 4, 5]); //=> Just([5, 2.5, 2])\n *      R.traverse(Maybe.of, safeDiv(10), [2, 0, 5]); //=> Nothing\n */\nvar traverse = /*#__PURE__*/_curry3(function traverse(of, f, traversable) {\n  return typeof traversable['fantasy-land/traverse'] === 'function' ? traversable['fantasy-land/traverse'](f, of) : sequence(of, map(f, traversable));\n});\nexport default traverse;","import _curry1 from './internal/_curry1';\n\nvar ws = '\\x09\\x0A\\x0B\\x0C\\x0D\\x20\\xA0\\u1680\\u180E\\u2000\\u2001\\u2002\\u2003' + '\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200A\\u202F\\u205F\\u3000\\u2028' + '\\u2029\\uFEFF';\nvar zeroWidth = '\\u200b';\nvar hasProtoTrim = typeof String.prototype.trim === 'function';\n/**\n * Removes (strips) whitespace from both ends of the string.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to trim.\n * @return {String} Trimmed version of `str`.\n * @example\n *\n *      R.trim('   xyz  '); //=> 'xyz'\n *      R.map(R.trim, R.split(',', 'x, y, z')); //=> ['x', 'y', 'z']\n */\nvar _trim = !hasProtoTrim || /*#__PURE__*/ws.trim() || ! /*#__PURE__*/zeroWidth.trim() ? function trim(str) {\n  var beginRx = new RegExp('^[' + ws + '][' + ws + ']*');\n  var endRx = new RegExp('[' + ws + '][' + ws + ']*$');\n  return str.replace(beginRx, '').replace(endRx, '');\n} : function trim(str) {\n  return str.trim();\n};\nvar trim = /*#__PURE__*/_curry1(_trim);\nexport default trim;","import _arity from './internal/_arity';\nimport _concat from './internal/_concat';\nimport _curry2 from './internal/_curry2';\n\n/**\n * `tryCatch` takes two functions, a `tryer` and a `catcher`. The returned\n * function evaluates the `tryer`; if it does not throw, it simply returns the\n * result. If the `tryer` *does* throw, the returned function evaluates the\n * `catcher` function and returns its result. Note that for effective\n * composition with this function, both the `tryer` and `catcher` functions\n * must return the same type of results.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Function\n * @sig (...x -> a) -> ((e, ...x) -> a) -> (...x -> a)\n * @param {Function} tryer The function that may throw.\n * @param {Function} catcher The function that will be evaluated if `tryer` throws.\n * @return {Function} A new function that will catch exceptions and send then to the catcher.\n * @example\n *\n *      R.tryCatch(R.prop('x'), R.F)({x: true}); //=> true\n *      R.tryCatch(R.prop('x'), R.F)(null);      //=> false\n */\nvar tryCatch = /*#__PURE__*/_curry2(function _tryCatch(tryer, catcher) {\n  return _arity(tryer.length, function () {\n    try {\n      return tryer.apply(this, arguments);\n    } catch (e) {\n      return catcher.apply(this, _concat([e], arguments));\n    }\n  });\n});\nexport default tryCatch;","import _curry1 from './internal/_curry1';\n\n/**\n * Takes a function `fn`, which takes a single array argument, and returns a\n * function which:\n *\n *   - takes any number of positional arguments;\n *   - passes these arguments to `fn` as an array; and\n *   - returns the result.\n *\n * In other words, `R.unapply` derives a variadic function from a function which\n * takes an array. `R.unapply` is the inverse of [`R.apply`](#apply).\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Function\n * @sig ([*...] -> a) -> (*... -> a)\n * @param {Function} fn\n * @return {Function}\n * @see R.apply\n * @example\n *\n *      R.unapply(JSON.stringify)(1, 2, 3); //=> '[1,2,3]'\n * @symb R.unapply(f)(a, b) = f([a, b])\n */\nvar unapply = /*#__PURE__*/_curry1(function unapply(fn) {\n  return function () {\n    return fn(Array.prototype.slice.call(arguments, 0));\n  };\n});\nexport default unapply;","import _curry1 from './internal/_curry1';\nimport nAry from './nAry';\n\n/**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly 1 parameter. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Function\n * @sig (* -> b) -> (a -> b)\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n *         arity 1.\n * @see R.binary, R.nAry\n * @example\n *\n *      var takesTwoArgs = function(a, b) {\n *        return [a, b];\n *      };\n *      takesTwoArgs.length; //=> 2\n *      takesTwoArgs(1, 2); //=> [1, 2]\n *\n *      var takesOneArg = R.unary(takesTwoArgs);\n *      takesOneArg.length; //=> 1\n *      // Only 1 argument is passed to the wrapped function\n *      takesOneArg(1, 2); //=> [1, undefined]\n * @symb R.unary(f)(a, b, c) = f(a)\n */\nvar unary = /*#__PURE__*/_curry1(function unary(fn) {\n  return nAry(1, fn);\n});\nexport default unary;","import _curry2 from './internal/_curry2';\nimport curryN from './curryN';\n\n/**\n * Returns a function of arity `n` from a (manually) curried function.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Function\n * @sig Number -> (a -> b) -> (a -> c)\n * @param {Number} length The arity for the returned function.\n * @param {Function} fn The function to uncurry.\n * @return {Function} A new function.\n * @see R.curry\n * @example\n *\n *      var addFour = a => b => c => d => a + b + c + d;\n *\n *      var uncurriedAddFour = R.uncurryN(4, addFour);\n *      uncurriedAddFour(1, 2, 3, 4); //=> 10\n */\nvar uncurryN = /*#__PURE__*/_curry2(function uncurryN(depth, fn) {\n  return curryN(depth, function () {\n    var currentDepth = 1;\n    var value = fn;\n    var idx = 0;\n    var endIdx;\n    while (currentDepth <= depth && typeof value === 'function') {\n      endIdx = currentDepth === depth ? arguments.length : idx + value.length;\n      value = value.apply(this, Array.prototype.slice.call(arguments, idx, endIdx));\n      currentDepth += 1;\n      idx = endIdx;\n    }\n    return value;\n  });\n});\nexport default uncurryN;","import _curry2 from './internal/_curry2';\n\n/**\n * Builds a list from a seed value. Accepts an iterator function, which returns\n * either false to stop iteration or an array of length 2 containing the value\n * to add to the resulting list and the seed to be used in the next call to the\n * iterator function.\n *\n * The iterator function receives one argument: *(seed)*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig (a -> [b]) -> * -> [b]\n * @param {Function} fn The iterator function. receives one argument, `seed`, and returns\n *        either false to quit iteration or an array of length two to proceed. The element\n *        at index 0 of this array will be added to the resulting array, and the element\n *        at index 1 will be passed to the next call to `fn`.\n * @param {*} seed The seed value.\n * @return {Array} The final list.\n * @example\n *\n *      var f = n => n > 50 ? false : [-n, n + 10];\n *      R.unfold(f, 10); //=> [-10, -20, -30, -40, -50]\n * @symb R.unfold(f, x) = [f(x)[0], f(f(x)[1])[0], f(f(f(x)[1])[1])[0], ...]\n */\nvar unfold = /*#__PURE__*/_curry2(function unfold(fn, seed) {\n  var pair = fn(seed);\n  var result = [];\n  while (pair && pair.length) {\n    result[result.length] = pair[0];\n    pair = fn(pair[1]);\n  }\n  return result;\n});\nexport default unfold;","import _concat from './internal/_concat';\nimport _curry2 from './internal/_curry2';\nimport compose from './compose';\nimport uniq from './uniq';\n\n/**\n * Combines two lists into a set (i.e. no duplicates) composed of the elements\n * of each list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} as The first list.\n * @param {Array} bs The second list.\n * @return {Array} The first and second lists concatenated, with\n *         duplicates removed.\n * @example\n *\n *      R.union([1, 2, 3], [2, 3, 4]); //=> [1, 2, 3, 4]\n */\nvar union = /*#__PURE__*/_curry2( /*#__PURE__*/compose(uniq, _concat));\nexport default union;","import _containsWith from './internal/_containsWith';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Returns a new list containing only one copy of each element in the original\n * list, based upon the value returned by applying the supplied predicate to\n * two list elements. Prefers the first item if two items compare equal based\n * on the predicate.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category List\n * @sig ((a, a) -> Boolean) -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n *      var strEq = R.eqBy(String);\n *      R.uniqWith(strEq)([1, '1', 2, 1]); //=> [1, 2]\n *      R.uniqWith(strEq)([{}, {}]);       //=> [{}]\n *      R.uniqWith(strEq)([1, '1', 1]);    //=> [1]\n *      R.uniqWith(strEq)(['1', 1, 1]);    //=> ['1']\n */\nvar uniqWith = /*#__PURE__*/_curry2(function uniqWith(pred, list) {\n  var idx = 0;\n  var len = list.length;\n  var result = [];\n  var item;\n  while (idx < len) {\n    item = list[idx];\n    if (!_containsWith(pred, item, result)) {\n      result[result.length] = item;\n    }\n    idx += 1;\n  }\n  return result;\n});\nexport default uniqWith;","import _concat from './internal/_concat';\nimport _curry3 from './internal/_curry3';\nimport uniqWith from './uniqWith';\n\n/**\n * Combines two lists into a set (i.e. no duplicates) composed of the elements\n * of each list. Duplication is determined according to the value returned by\n * applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig ((a, a) -> Boolean) -> [*] -> [*] -> [*]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The first and second lists concatenated, with\n *         duplicates removed.\n * @see R.union\n * @example\n *\n *      var l1 = [{a: 1}, {a: 2}];\n *      var l2 = [{a: 1}, {a: 4}];\n *      R.unionWith(R.eqBy(R.prop('a')), l1, l2); //=> [{a: 1}, {a: 2}, {a: 4}]\n */\nvar unionWith = /*#__PURE__*/_curry3(function unionWith(pred, list1, list2) {\n  return uniqWith(pred, _concat(list1, list2));\n});\nexport default unionWith;","import _curry3 from './internal/_curry3';\n\n/**\n * Tests the final argument by passing it to the given predicate function. If\n * the predicate is not satisfied, the function will return the result of\n * calling the `whenFalseFn` function with the same argument. If the predicate\n * is satisfied, the argument is returned as is.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred        A predicate function\n * @param {Function} whenFalseFn A function to invoke when the `pred` evaluates\n *                               to a falsy value.\n * @param {*}        x           An object to test with the `pred` function and\n *                               pass to `whenFalseFn` if necessary.\n * @return {*} Either `x` or the result of applying `x` to `whenFalseFn`.\n * @see R.ifElse, R.when\n * @example\n *\n *      let safeInc = R.unless(R.isNil, R.inc);\n *      safeInc(null); //=> null\n *      safeInc(1); //=> 2\n */\nvar unless = /*#__PURE__*/_curry3(function unless(pred, whenFalseFn, x) {\n  return pred(x) ? x : whenFalseFn(x);\n});\nexport default unless;","import _identity from './internal/_identity';\nimport chain from './chain';\n\n/**\n * Shorthand for `R.chain(R.identity)`, which removes one level of nesting from\n * any [Chain](https://github.com/fantasyland/fantasy-land#chain).\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig Chain c => c (c a) -> c a\n * @param {*} list\n * @return {*}\n * @see R.flatten, R.chain\n * @example\n *\n *      R.unnest([1, [2], [[3]]]); //=> [1, 2, [3]]\n *      R.unnest([[1, 2], [3, 4], [5, 6]]); //=> [1, 2, 3, 4, 5, 6]\n */\nvar unnest = /*#__PURE__*/chain(_identity);\nexport default unnest;","import _curry3 from './internal/_curry3';\n\n/**\n * Takes a predicate, a transformation function, and an initial value,\n * and returns a value of the same type as the initial value.\n * It does so by applying the transformation until the predicate is satisfied,\n * at which point it returns the satisfactory value.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred A predicate function\n * @param {Function} fn The iterator function\n * @param {*} init Initial value\n * @return {*} Final value that satisfies predicate\n * @example\n *\n *      R.until(R.gt(R.__, 100), R.multiply(2))(1) // => 128\n */\nvar until = /*#__PURE__*/_curry3(function until(pred, fn, init) {\n  var val = init;\n  while (!pred(val)) {\n    val = fn(val);\n  }\n  return val;\n});\nexport default until;","import _curry1 from './internal/_curry1';\n\n/**\n * Returns a list of all the properties, including prototype properties, of the\n * supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @sig {k: v} -> [v]\n * @param {Object} obj The object to extract values from\n * @return {Array} An array of the values of the object's own and prototype properties.\n * @see R.values, R.keysIn\n * @example\n *\n *      var F = function() { this.x = 'X'; };\n *      F.prototype.y = 'Y';\n *      var f = new F();\n *      R.valuesIn(f); //=> ['X', 'Y']\n */\nvar valuesIn = /*#__PURE__*/_curry1(function valuesIn(obj) {\n  var prop;\n  var vs = [];\n  for (prop in obj) {\n    vs[vs.length] = obj[prop];\n  }\n  return vs;\n});\nexport default valuesIn;","import _curry2 from './internal/_curry2';\n\n// `Const` is a functor that effectively ignores the function given to `map`.\nvar Const = function (x) {\n  return { value: x, 'fantasy-land/map': function () {\n      return this;\n    } };\n};\n\n/**\n * Returns a \"view\" of the given data structure, determined by the given lens.\n * The lens's focus determines which portion of the data structure is visible.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> s -> a\n * @param {Lens} lens\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n *      var xLens = R.lensProp('x');\n *\n *      R.view(xLens, {x: 1, y: 2});  //=> 1\n *      R.view(xLens, {x: 4, y: 2});  //=> 4\n */\nvar view = /*#__PURE__*/_curry2(function view(lens, x) {\n  // Using `Const` effectively ignores the setter function of the `lens`,\n  // leaving the value returned by the getter function unmodified.\n  return lens(Const)(x).value;\n});\nexport default view;","import _curry3 from './internal/_curry3';\n\n/**\n * Tests the final argument by passing it to the given predicate function. If\n * the predicate is satisfied, the function will return the result of calling\n * the `whenTrueFn` function with the same argument. If the predicate is not\n * satisfied, the argument is returned as is.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred       A predicate function\n * @param {Function} whenTrueFn A function to invoke when the `condition`\n *                              evaluates to a truthy value.\n * @param {*}        x          An object to test with the `pred` function and\n *                              pass to `whenTrueFn` if necessary.\n * @return {*} Either `x` or the result of applying `x` to `whenTrueFn`.\n * @see R.ifElse, R.unless\n * @example\n *\n *      // truncate :: String -> String\n *      var truncate = R.when(\n *        R.propSatisfies(R.gt(R.__, 10), 'length'),\n *        R.pipe(R.take(10), R.append('…'), R.join(''))\n *      );\n *      truncate('12345');         //=> '12345'\n *      truncate('0123456789ABC'); //=> '0123456789…'\n */\nvar when = /*#__PURE__*/_curry3(function when(pred, whenTrueFn, x) {\n  return pred(x) ? whenTrueFn(x) : x;\n});\nexport default when;","import _curry2 from './internal/_curry2';\nimport _has from './internal/_has';\n\n/**\n * Takes a spec object and a test object; returns true if the test satisfies\n * the spec. Each of the spec's own properties must be a predicate function.\n * Each predicate is applied to the value of the corresponding property of the\n * test object. `where` returns true if all the predicates return true, false\n * otherwise.\n *\n * `where` is well suited to declaratively expressing constraints for other\n * functions such as [`filter`](#filter) and [`find`](#find).\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category Object\n * @sig {String: (* -> Boolean)} -> {String: *} -> Boolean\n * @param {Object} spec\n * @param {Object} testObj\n * @return {Boolean}\n * @see R.propSatisfies, R.whereEq\n * @example\n *\n *      // pred :: Object -> Boolean\n *      var pred = R.where({\n *        a: R.equals('foo'),\n *        b: R.complement(R.equals('bar')),\n *        x: R.gt(R.__, 10),\n *        y: R.lt(R.__, 20)\n *      });\n *\n *      pred({a: 'foo', b: 'xxx', x: 11, y: 19}); //=> true\n *      pred({a: 'xxx', b: 'xxx', x: 11, y: 19}); //=> false\n *      pred({a: 'foo', b: 'bar', x: 11, y: 19}); //=> false\n *      pred({a: 'foo', b: 'xxx', x: 10, y: 19}); //=> false\n *      pred({a: 'foo', b: 'xxx', x: 11, y: 20}); //=> false\n */\nvar where = /*#__PURE__*/_curry2(function where(spec, testObj) {\n  for (var prop in spec) {\n    if (_has(prop, spec) && !spec[prop](testObj[prop])) {\n      return false;\n    }\n  }\n  return true;\n});\nexport default where;","import _curry2 from './internal/_curry2';\nimport equals from './equals';\nimport map from './map';\nimport where from './where';\n\n/**\n * Takes a spec object and a test object; returns true if the test satisfies\n * the spec, false otherwise. An object satisfies the spec if, for each of the\n * spec's own properties, accessing that property of the object gives the same\n * value (in [`R.equals`](#equals) terms) as accessing that property of the\n * spec.\n *\n * `whereEq` is a specialization of [`where`](#where).\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @sig {String: *} -> {String: *} -> Boolean\n * @param {Object} spec\n * @param {Object} testObj\n * @return {Boolean}\n * @see R.propEq, R.where\n * @example\n *\n *      // pred :: Object -> Boolean\n *      var pred = R.whereEq({a: 1, b: 2});\n *\n *      pred({a: 1});              //=> false\n *      pred({a: 1, b: 2});        //=> true\n *      pred({a: 1, b: 2, c: 3});  //=> true\n *      pred({a: 1, b: 1});        //=> false\n */\nvar whereEq = /*#__PURE__*/_curry2(function whereEq(spec, testObj) {\n  return where(map(equals, spec), testObj);\n});\nexport default whereEq;","import _contains from './internal/_contains';\nimport _curry2 from './internal/_curry2';\nimport flip from './flip';\nimport reject from './reject';\n\n/**\n * Returns a new list without values in the first argument.\n * [`R.equals`](#equals) is used to determine equality.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig [a] -> [a] -> [a]\n * @param {Array} list1 The values to be removed from `list2`.\n * @param {Array} list2 The array to remove values from.\n * @return {Array} The new array without values in `list1`.\n * @see R.transduce, R.difference\n * @example\n *\n *      R.without([1, 2], [1, 2, 1, 3, 4]); //=> [3, 4]\n */\nvar without = /*#__PURE__*/_curry2(function (xs, list) {\n  return reject(flip(_contains)(xs), list);\n});\nexport default without;","import _curry2 from './internal/_curry2';\n\n/**\n * Creates a new list out of the two supplied by creating each possible pair\n * from the lists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b] -> [[a,b]]\n * @param {Array} as The first list.\n * @param {Array} bs The second list.\n * @return {Array} The list made by combining each possible pair from\n *         `as` and `bs` into pairs (`[a, b]`).\n * @example\n *\n *      R.xprod([1, 2], ['a', 'b']); //=> [[1, 'a'], [1, 'b'], [2, 'a'], [2, 'b']]\n * @symb R.xprod([a, b], [c, d]) = [[a, c], [a, d], [b, c], [b, d]]\n */\nvar xprod = /*#__PURE__*/_curry2(function xprod(a, b) {\n  // = xprodWith(prepend); (takes about 3 times as long...)\n  var idx = 0;\n  var ilen = a.length;\n  var j;\n  var jlen = b.length;\n  var result = [];\n  while (idx < ilen) {\n    j = 0;\n    while (j < jlen) {\n      result[result.length] = [a[idx], b[j]];\n      j += 1;\n    }\n    idx += 1;\n  }\n  return result;\n});\nexport default xprod;","import _curry2 from './internal/_curry2';\n\n/**\n * Creates a new list out of the two supplied by pairing up equally-positioned\n * items from both lists. The returned list is truncated to the length of the\n * shorter of the two input lists.\n * Note: `zip` is equivalent to `zipWith(function(a, b) { return [a, b] })`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b] -> [[a,b]]\n * @param {Array} list1 The first array to consider.\n * @param {Array} list2 The second array to consider.\n * @return {Array} The list made by pairing up same-indexed elements of `list1` and `list2`.\n * @example\n *\n *      R.zip([1, 2, 3], ['a', 'b', 'c']); //=> [[1, 'a'], [2, 'b'], [3, 'c']]\n * @symb R.zip([a, b, c], [d, e, f]) = [[a, d], [b, e], [c, f]]\n */\nvar zip = /*#__PURE__*/_curry2(function zip(a, b) {\n  var rv = [];\n  var idx = 0;\n  var len = Math.min(a.length, b.length);\n  while (idx < len) {\n    rv[idx] = [a[idx], b[idx]];\n    idx += 1;\n  }\n  return rv;\n});\nexport default zip;","import _curry2 from './internal/_curry2';\n\n/**\n * Creates a new object out of a list of keys and a list of values.\n * Key/value pairing is truncated to the length of the shorter of the two lists.\n * Note: `zipObj` is equivalent to `pipe(zip, fromPairs)`.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [String] -> [*] -> {String: *}\n * @param {Array} keys The array that will be properties on the output object.\n * @param {Array} values The list of values on the output object.\n * @return {Object} The object made by pairing up same-indexed elements of `keys` and `values`.\n * @example\n *\n *      R.zipObj(['a', 'b', 'c'], [1, 2, 3]); //=> {a: 1, b: 2, c: 3}\n */\nvar zipObj = /*#__PURE__*/_curry2(function zipObj(keys, values) {\n  var idx = 0;\n  var len = Math.min(keys.length, values.length);\n  var out = {};\n  while (idx < len) {\n    out[keys[idx]] = values[idx];\n    idx += 1;\n  }\n  return out;\n});\nexport default zipObj;","import _curry3 from './internal/_curry3';\n\n/**\n * Creates a new list out of the two supplied by applying the function to each\n * equally-positioned pair in the lists. The returned list is truncated to the\n * length of the shorter of the two input lists.\n *\n * @function\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, b) -> c) -> [a] -> [b] -> [c]\n * @param {Function} fn The function used to combine the two elements into one value.\n * @param {Array} list1 The first array to consider.\n * @param {Array} list2 The second array to consider.\n * @return {Array} The list made by combining same-indexed elements of `list1` and `list2`\n *         using `fn`.\n * @example\n *\n *      var f = (x, y) => {\n *        // ...\n *      };\n *      R.zipWith(f, [1, 2, 3], ['a', 'b', 'c']);\n *      //=> [f(1, 'a'), f(2, 'b'), f(3, 'c')]\n * @symb R.zipWith(fn, [a, b, c], [d, e, f]) = [fn(a, d), fn(b, e), fn(c, f)]\n */\nvar zipWith = /*#__PURE__*/_curry3(function zipWith(fn, a, b) {\n  var rv = [];\n  var idx = 0;\n  var len = Math.min(a.length, b.length);\n  while (idx < len) {\n    rv[idx] = fn(a[idx], b[idx]);\n    idx += 1;\n  }\n  return rv;\n});\nexport default zipWith;","import { map, prop } from 'ramda';\nimport {\n  VOTE_PROXY_FACTORY,\n  CHIEF,\n  POLLING,\n  BATCH_POLLING,\n  ESM,\n  END,\n  PAUSE,\n  MKR,\n  IOU\n} from './utils/constants';\n\nimport ChiefService from './ChiefService';\nimport VoteProxyService from './VoteProxyService';\nimport VoteProxyFactoryService from './VoteProxyFactoryService';\nimport GovPollingService from './GovPollingService';\nimport GovQueryApiService from './GovQueryApiService';\nimport EsmService from './EsmService';\nimport SpellService from './SpellService';\n\nexport default {\n  addConfig: function(config, { network = 'mainnet', staging = false }) {\n    const contractAddresses = {\n      kovan: require('../contracts/addresses/kovan.json'),\n      mainnet: require('../contracts/addresses/mainnet.json')\n    };\n\n    try {\n      contractAddresses.testnet = require('../contracts/addresses/testnet.json');\n    } catch (err) {\n      // do nothing here; throw an error only if we later attempt to use ganache\n    }\n\n    const addressKey = network == 'ganache' ? 'testnet' : network;\n\n    const esmContracts = {\n      [ESM]: {\n        address: map(prop('MCD_ESM'), contractAddresses),\n        abi: require('../contracts/abis/ESM.json')\n      },\n      [END]: {\n        address: map(prop('MCD_END'), contractAddresses),\n        abi: require('../contracts/abis/End.json')\n      }\n    };\n\n    const addContracts = {\n      [CHIEF]: {\n        address: map(prop('CHIEF'), contractAddresses),\n        // TODO check for MCD-specific version of DSChief\n        abi: require('../contracts/abis/DSChief.json')\n      },\n      [VOTE_PROXY_FACTORY]: {\n        address: map(prop('VOTE_PROXY_FACTORY'), contractAddresses),\n        abi: require('../contracts/abis/VoteProxyFactory.json')\n      },\n      [POLLING]: {\n        address: map(prop('POLLING'), contractAddresses),\n        abi: require('../contracts/abis/PollingEmitter.json')\n      },\n      [BATCH_POLLING]: {\n        address: map(prop('BATCH_POLLING'), contractAddresses),\n        abi: require('../contracts/abis/BatchPollingEmitter.json')\n      },\n      [PAUSE]: {\n        address: map(prop('PAUSE'), contractAddresses),\n        abi: require('../contracts/abis/DSPause.json')\n      },\n      ...esmContracts\n    };\n\n    const makerConfig = {\n      ...config,\n      additionalServices: [\n        'chief',\n        'voteProxy',\n        'voteProxyFactory',\n        'govPolling',\n        'govQueryApi',\n        'esm',\n        'spell'\n      ],\n      chief: [ChiefService],\n      voteProxy: [VoteProxyService],\n      voteProxyFactory: [VoteProxyFactoryService],\n      govPolling: [GovPollingService],\n      govQueryApi: [GovQueryApiService, { staging }],\n      esm: [EsmService],\n      spell: [SpellService],\n      smartContract: { addContracts },\n      token: {\n        erc20: [\n          {\n            currency: MKR,\n            symbol: MKR.symbol,\n            address: contractAddresses[addressKey].SAI_GOV\n          },\n          {\n            currency: IOU,\n            symbol: IOU.symbol,\n            address: contractAddresses[addressKey].IOU\n          }\n        ]\n      }\n    };\n\n    return makerConfig;\n  }\n};\n","require('../../modules/es6.object.assign');\nmodule.exports = require('../../modules/_core').Object.assign;\n","// 19.1.3.1 Object.assign(target, source)\nvar $export = require('./_export');\n\n$export($export.S + $export.F, 'Object', { assign: require('./_object-assign') });\n","module.exports = function (it) {\n  if (typeof it != 'function') throw TypeError(it + ' is not a function!');\n  return it;\n};\n","'use strict';\n// 19.1.2.1 Object.assign(target, source, ...)\nvar DESCRIPTORS = require('./_descriptors');\nvar getKeys = require('./_object-keys');\nvar gOPS = require('./_object-gops');\nvar pIE = require('./_object-pie');\nvar toObject = require('./_to-object');\nvar IObject = require('./_iobject');\nvar $assign = Object.assign;\n\n// should work with symbols and should have deterministic property order (V8 bug)\nmodule.exports = !$assign || require('./_fails')(function () {\n  var A = {};\n  var B = {};\n  // eslint-disable-next-line no-undef\n  var S = Symbol();\n  var K = 'abcdefghijklmnopqrst';\n  A[S] = 7;\n  K.split('').forEach(function (k) { B[k] = k; });\n  return $assign({}, A)[S] != 7 || Object.keys($assign({}, B)).join('') != K;\n}) ? function assign(target, source) { // eslint-disable-line no-unused-vars\n  var T = toObject(target);\n  var aLen = arguments.length;\n  var index = 1;\n  var getSymbols = gOPS.f;\n  var isEnum = pIE.f;\n  while (aLen > index) {\n    var S = IObject(arguments[index++]);\n    var keys = getSymbols ? getKeys(S).concat(getSymbols(S)) : getKeys(S);\n    var length = keys.length;\n    var j = 0;\n    var key;\n    while (length > j) {\n      key = keys[j++];\n      if (!DESCRIPTORS || isEnum.call(S, key)) T[key] = S[key];\n    }\n  } return T;\n} : $assign;\n","// false -> Array#indexOf\n// true  -> Array#includes\nvar toIObject = require('./_to-iobject');\nvar toLength = require('./_to-length');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nmodule.exports = function (IS_INCLUDES) {\n  return function ($this, el, fromIndex) {\n    var O = toIObject($this);\n    var length = toLength(O.length);\n    var index = toAbsoluteIndex(fromIndex, length);\n    var value;\n    // Array#includes uses SameValueZero equality algorithm\n    // eslint-disable-next-line no-self-compare\n    if (IS_INCLUDES && el != el) while (length > index) {\n      value = O[index++];\n      // eslint-disable-next-line no-self-compare\n      if (value != value) return true;\n    // Array#indexOf ignores holes, Array#includes - not\n    } else for (;length > index; index++) if (IS_INCLUDES || index in O) {\n      if (O[index] === el) return IS_INCLUDES || index || 0;\n    } return !IS_INCLUDES && -1;\n  };\n};\n","var toInteger = require('./_to-integer');\nvar max = Math.max;\nvar min = Math.min;\nmodule.exports = function (index, length) {\n  index = toInteger(index);\n  return index < 0 ? max(index + length, 0) : min(index, length);\n};\n","require('../../modules/es6.object.get-prototype-of');\nmodule.exports = require('../../modules/_core').Object.getPrototypeOf;\n","// 19.1.2.9 Object.getPrototypeOf(O)\nvar toObject = require('./_to-object');\nvar $getPrototypeOf = require('./_object-gpo');\n\nrequire('./_object-sap')('getPrototypeOf', function () {\n  return function getPrototypeOf(it) {\n    return $getPrototypeOf(toObject(it));\n  };\n});\n","// most Object methods by ES6 should accept primitives\nvar $export = require('./_export');\nvar core = require('./_core');\nvar fails = require('./_fails');\nmodule.exports = function (KEY, exec) {\n  var fn = (core.Object || {})[KEY] || Object[KEY];\n  var exp = {};\n  exp[KEY] = exec(fn);\n  $export($export.S + $export.F * fails(function () { fn(1); }), 'Object', exp);\n};\n","module.exports = { \"default\": require(\"core-js/library/fn/symbol/iterator\"), __esModule: true };","require('../../modules/es6.string.iterator');\nrequire('../../modules/web.dom.iterable');\nmodule.exports = require('../../modules/_wks-ext').f('iterator');\n","var toInteger = require('./_to-integer');\nvar defined = require('./_defined');\n// true  -> String#at\n// false -> String#codePointAt\nmodule.exports = function (TO_STRING) {\n  return function (that, pos) {\n    var s = String(defined(that));\n    var i = toInteger(pos);\n    var l = s.length;\n    var a, b;\n    if (i < 0 || i >= l) return TO_STRING ? '' : undefined;\n    a = s.charCodeAt(i);\n    return a < 0xd800 || a > 0xdbff || i + 1 === l || (b = s.charCodeAt(i + 1)) < 0xdc00 || b > 0xdfff\n      ? TO_STRING ? s.charAt(i) : a\n      : TO_STRING ? s.slice(i, i + 2) : (a - 0xd800 << 10) + (b - 0xdc00) + 0x10000;\n  };\n};\n","'use strict';\nvar create = require('./_object-create');\nvar descriptor = require('./_property-desc');\nvar setToStringTag = require('./_set-to-string-tag');\nvar IteratorPrototype = {};\n\n// 25.1.2.1.1 %IteratorPrototype%[@@iterator]()\nrequire('./_hide')(IteratorPrototype, require('./_wks')('iterator'), function () { return this; });\n\nmodule.exports = function (Constructor, NAME, next) {\n  Constructor.prototype = create(IteratorPrototype, { next: descriptor(1, next) });\n  setToStringTag(Constructor, NAME + ' Iterator');\n};\n","var dP = require('./_object-dp');\nvar anObject = require('./_an-object');\nvar getKeys = require('./_object-keys');\n\nmodule.exports = require('./_descriptors') ? Object.defineProperties : function defineProperties(O, Properties) {\n  anObject(O);\n  var keys = getKeys(Properties);\n  var length = keys.length;\n  var i = 0;\n  var P;\n  while (length > i) dP.f(O, P = keys[i++], Properties[P]);\n  return O;\n};\n","var document = require('./_global').document;\nmodule.exports = document && document.documentElement;\n","'use strict';\nvar addToUnscopables = require('./_add-to-unscopables');\nvar step = require('./_iter-step');\nvar Iterators = require('./_iterators');\nvar toIObject = require('./_to-iobject');\n\n// 22.1.3.4 Array.prototype.entries()\n// 22.1.3.13 Array.prototype.keys()\n// 22.1.3.29 Array.prototype.values()\n// 22.1.3.30 Array.prototype[@@iterator]()\nmodule.exports = require('./_iter-define')(Array, 'Array', function (iterated, kind) {\n  this._t = toIObject(iterated); // target\n  this._i = 0;                   // next index\n  this._k = kind;                // kind\n// 22.1.5.2.1 %ArrayIteratorPrototype%.next()\n}, function () {\n  var O = this._t;\n  var kind = this._k;\n  var index = this._i++;\n  if (!O || index >= O.length) {\n    this._t = undefined;\n    return step(1);\n  }\n  if (kind == 'keys') return step(0, index);\n  if (kind == 'values') return step(0, O[index]);\n  return step(0, [index, O[index]]);\n}, 'values');\n\n// argumentsList[@@iterator] is %ArrayProto_values% (9.4.4.6, 9.4.4.7)\nIterators.Arguments = Iterators.Array;\n\naddToUnscopables('keys');\naddToUnscopables('values');\naddToUnscopables('entries');\n","module.exports = function () { /* empty */ };\n","module.exports = function (done, value) {\n  return { value: value, done: !!done };\n};\n","module.exports = { \"default\": require(\"core-js/library/fn/symbol\"), __esModule: true };","require('../../modules/es6.symbol');\nrequire('../../modules/es6.object.to-string');\nrequire('../../modules/es7.symbol.async-iterator');\nrequire('../../modules/es7.symbol.observable');\nmodule.exports = require('../../modules/_core').Symbol;\n","'use strict';\n// ECMAScript 6 symbols shim\nvar global = require('./_global');\nvar has = require('./_has');\nvar DESCRIPTORS = require('./_descriptors');\nvar $export = require('./_export');\nvar redefine = require('./_redefine');\nvar META = require('./_meta').KEY;\nvar $fails = require('./_fails');\nvar shared = require('./_shared');\nvar setToStringTag = require('./_set-to-string-tag');\nvar uid = require('./_uid');\nvar wks = require('./_wks');\nvar wksExt = require('./_wks-ext');\nvar wksDefine = require('./_wks-define');\nvar enumKeys = require('./_enum-keys');\nvar isArray = require('./_is-array');\nvar anObject = require('./_an-object');\nvar isObject = require('./_is-object');\nvar toObject = require('./_to-object');\nvar toIObject = require('./_to-iobject');\nvar toPrimitive = require('./_to-primitive');\nvar createDesc = require('./_property-desc');\nvar _create = require('./_object-create');\nvar gOPNExt = require('./_object-gopn-ext');\nvar $GOPD = require('./_object-gopd');\nvar $GOPS = require('./_object-gops');\nvar $DP = require('./_object-dp');\nvar $keys = require('./_object-keys');\nvar gOPD = $GOPD.f;\nvar dP = $DP.f;\nvar gOPN = gOPNExt.f;\nvar $Symbol = global.Symbol;\nvar $JSON = global.JSON;\nvar _stringify = $JSON && $JSON.stringify;\nvar PROTOTYPE = 'prototype';\nvar HIDDEN = wks('_hidden');\nvar TO_PRIMITIVE = wks('toPrimitive');\nvar isEnum = {}.propertyIsEnumerable;\nvar SymbolRegistry = shared('symbol-registry');\nvar AllSymbols = shared('symbols');\nvar OPSymbols = shared('op-symbols');\nvar ObjectProto = Object[PROTOTYPE];\nvar USE_NATIVE = typeof $Symbol == 'function' && !!$GOPS.f;\nvar QObject = global.QObject;\n// Don't use setters in Qt Script, https://github.com/zloirock/core-js/issues/173\nvar setter = !QObject || !QObject[PROTOTYPE] || !QObject[PROTOTYPE].findChild;\n\n// fallback for old Android, https://code.google.com/p/v8/issues/detail?id=687\nvar setSymbolDesc = DESCRIPTORS && $fails(function () {\n  return _create(dP({}, 'a', {\n    get: function () { return dP(this, 'a', { value: 7 }).a; }\n  })).a != 7;\n}) ? function (it, key, D) {\n  var protoDesc = gOPD(ObjectProto, key);\n  if (protoDesc) delete ObjectProto[key];\n  dP(it, key, D);\n  if (protoDesc && it !== ObjectProto) dP(ObjectProto, key, protoDesc);\n} : dP;\n\nvar wrap = function (tag) {\n  var sym = AllSymbols[tag] = _create($Symbol[PROTOTYPE]);\n  sym._k = tag;\n  return sym;\n};\n\nvar isSymbol = USE_NATIVE && typeof $Symbol.iterator == 'symbol' ? function (it) {\n  return typeof it == 'symbol';\n} : function (it) {\n  return it instanceof $Symbol;\n};\n\nvar $defineProperty = function defineProperty(it, key, D) {\n  if (it === ObjectProto) $defineProperty(OPSymbols, key, D);\n  anObject(it);\n  key = toPrimitive(key, true);\n  anObject(D);\n  if (has(AllSymbols, key)) {\n    if (!D.enumerable) {\n      if (!has(it, HIDDEN)) dP(it, HIDDEN, createDesc(1, {}));\n      it[HIDDEN][key] = true;\n    } else {\n      if (has(it, HIDDEN) && it[HIDDEN][key]) it[HIDDEN][key] = false;\n      D = _create(D, { enumerable: createDesc(0, false) });\n    } return setSymbolDesc(it, key, D);\n  } return dP(it, key, D);\n};\nvar $defineProperties = function defineProperties(it, P) {\n  anObject(it);\n  var keys = enumKeys(P = toIObject(P));\n  var i = 0;\n  var l = keys.length;\n  var key;\n  while (l > i) $defineProperty(it, key = keys[i++], P[key]);\n  return it;\n};\nvar $create = function create(it, P) {\n  return P === undefined ? _create(it) : $defineProperties(_create(it), P);\n};\nvar $propertyIsEnumerable = function propertyIsEnumerable(key) {\n  var E = isEnum.call(this, key = toPrimitive(key, true));\n  if (this === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key)) return false;\n  return E || !has(this, key) || !has(AllSymbols, key) || has(this, HIDDEN) && this[HIDDEN][key] ? E : true;\n};\nvar $getOwnPropertyDescriptor = function getOwnPropertyDescriptor(it, key) {\n  it = toIObject(it);\n  key = toPrimitive(key, true);\n  if (it === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key)) return;\n  var D = gOPD(it, key);\n  if (D && has(AllSymbols, key) && !(has(it, HIDDEN) && it[HIDDEN][key])) D.enumerable = true;\n  return D;\n};\nvar $getOwnPropertyNames = function getOwnPropertyNames(it) {\n  var names = gOPN(toIObject(it));\n  var result = [];\n  var i = 0;\n  var key;\n  while (names.length > i) {\n    if (!has(AllSymbols, key = names[i++]) && key != HIDDEN && key != META) result.push(key);\n  } return result;\n};\nvar $getOwnPropertySymbols = function getOwnPropertySymbols(it) {\n  var IS_OP = it === ObjectProto;\n  var names = gOPN(IS_OP ? OPSymbols : toIObject(it));\n  var result = [];\n  var i = 0;\n  var key;\n  while (names.length > i) {\n    if (has(AllSymbols, key = names[i++]) && (IS_OP ? has(ObjectProto, key) : true)) result.push(AllSymbols[key]);\n  } return result;\n};\n\n// 19.4.1.1 Symbol([description])\nif (!USE_NATIVE) {\n  $Symbol = function Symbol() {\n    if (this instanceof $Symbol) throw TypeError('Symbol is not a constructor!');\n    var tag = uid(arguments.length > 0 ? arguments[0] : undefined);\n    var $set = function (value) {\n      if (this === ObjectProto) $set.call(OPSymbols, value);\n      if (has(this, HIDDEN) && has(this[HIDDEN], tag)) this[HIDDEN][tag] = false;\n      setSymbolDesc(this, tag, createDesc(1, value));\n    };\n    if (DESCRIPTORS && setter) setSymbolDesc(ObjectProto, tag, { configurable: true, set: $set });\n    return wrap(tag);\n  };\n  redefine($Symbol[PROTOTYPE], 'toString', function toString() {\n    return this._k;\n  });\n\n  $GOPD.f = $getOwnPropertyDescriptor;\n  $DP.f = $defineProperty;\n  require('./_object-gopn').f = gOPNExt.f = $getOwnPropertyNames;\n  require('./_object-pie').f = $propertyIsEnumerable;\n  $GOPS.f = $getOwnPropertySymbols;\n\n  if (DESCRIPTORS && !require('./_library')) {\n    redefine(ObjectProto, 'propertyIsEnumerable', $propertyIsEnumerable, true);\n  }\n\n  wksExt.f = function (name) {\n    return wrap(wks(name));\n  };\n}\n\n$export($export.G + $export.W + $export.F * !USE_NATIVE, { Symbol: $Symbol });\n\nfor (var es6Symbols = (\n  // 19.4.2.2, 19.4.2.3, 19.4.2.4, 19.4.2.6, 19.4.2.8, 19.4.2.9, 19.4.2.10, 19.4.2.11, 19.4.2.12, 19.4.2.13, 19.4.2.14\n  'hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables'\n).split(','), j = 0; es6Symbols.length > j;)wks(es6Symbols[j++]);\n\nfor (var wellKnownSymbols = $keys(wks.store), k = 0; wellKnownSymbols.length > k;) wksDefine(wellKnownSymbols[k++]);\n\n$export($export.S + $export.F * !USE_NATIVE, 'Symbol', {\n  // 19.4.2.1 Symbol.for(key)\n  'for': function (key) {\n    return has(SymbolRegistry, key += '')\n      ? SymbolRegistry[key]\n      : SymbolRegistry[key] = $Symbol(key);\n  },\n  // 19.4.2.5 Symbol.keyFor(sym)\n  keyFor: function keyFor(sym) {\n    if (!isSymbol(sym)) throw TypeError(sym + ' is not a symbol!');\n    for (var key in SymbolRegistry) if (SymbolRegistry[key] === sym) return key;\n  },\n  useSetter: function () { setter = true; },\n  useSimple: function () { setter = false; }\n});\n\n$export($export.S + $export.F * !USE_NATIVE, 'Object', {\n  // 19.1.2.2 Object.create(O [, Properties])\n  create: $create,\n  // 19.1.2.4 Object.defineProperty(O, P, Attributes)\n  defineProperty: $defineProperty,\n  // 19.1.2.3 Object.defineProperties(O, Properties)\n  defineProperties: $defineProperties,\n  // 19.1.2.6 Object.getOwnPropertyDescriptor(O, P)\n  getOwnPropertyDescriptor: $getOwnPropertyDescriptor,\n  // 19.1.2.7 Object.getOwnPropertyNames(O)\n  getOwnPropertyNames: $getOwnPropertyNames,\n  // 19.1.2.8 Object.getOwnPropertySymbols(O)\n  getOwnPropertySymbols: $getOwnPropertySymbols\n});\n\n// Chrome 38 and 39 `Object.getOwnPropertySymbols` fails on primitives\n// https://bugs.chromium.org/p/v8/issues/detail?id=3443\nvar FAILS_ON_PRIMITIVES = $fails(function () { $GOPS.f(1); });\n\n$export($export.S + $export.F * FAILS_ON_PRIMITIVES, 'Object', {\n  getOwnPropertySymbols: function getOwnPropertySymbols(it) {\n    return $GOPS.f(toObject(it));\n  }\n});\n\n// 24.3.2 JSON.stringify(value [, replacer [, space]])\n$JSON && $export($export.S + $export.F * (!USE_NATIVE || $fails(function () {\n  var S = $Symbol();\n  // MS Edge converts symbol values to JSON as {}\n  // WebKit converts symbol values to JSON as null\n  // V8 throws on boxed symbols\n  return _stringify([S]) != '[null]' || _stringify({ a: S }) != '{}' || _stringify(Object(S)) != '{}';\n})), 'JSON', {\n  stringify: function stringify(it) {\n    var args = [it];\n    var i = 1;\n    var replacer, $replacer;\n    while (arguments.length > i) args.push(arguments[i++]);\n    $replacer = replacer = args[1];\n    if (!isObject(replacer) && it === undefined || isSymbol(it)) return; // IE8 returns string on undefined\n    if (!isArray(replacer)) replacer = function (key, value) {\n      if (typeof $replacer == 'function') value = $replacer.call(this, key, value);\n      if (!isSymbol(value)) return value;\n    };\n    args[1] = replacer;\n    return _stringify.apply($JSON, args);\n  }\n});\n\n// 19.4.3.4 Symbol.prototype[@@toPrimitive](hint)\n$Symbol[PROTOTYPE][TO_PRIMITIVE] || require('./_hide')($Symbol[PROTOTYPE], TO_PRIMITIVE, $Symbol[PROTOTYPE].valueOf);\n// 19.4.3.5 Symbol.prototype[@@toStringTag]\nsetToStringTag($Symbol, 'Symbol');\n// 20.2.1.9 Math[@@toStringTag]\nsetToStringTag(Math, 'Math', true);\n// 24.3.3 JSON[@@toStringTag]\nsetToStringTag(global.JSON, 'JSON', true);\n","var META = require('./_uid')('meta');\nvar isObject = require('./_is-object');\nvar has = require('./_has');\nvar setDesc = require('./_object-dp').f;\nvar id = 0;\nvar isExtensible = Object.isExtensible || function () {\n  return true;\n};\nvar FREEZE = !require('./_fails')(function () {\n  return isExtensible(Object.preventExtensions({}));\n});\nvar setMeta = function (it) {\n  setDesc(it, META, { value: {\n    i: 'O' + ++id, // object ID\n    w: {}          // weak collections IDs\n  } });\n};\nvar fastKey = function (it, create) {\n  // return primitive with prefix\n  if (!isObject(it)) return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it;\n  if (!has(it, META)) {\n    // can't set metadata to uncaught frozen object\n    if (!isExtensible(it)) return 'F';\n    // not necessary to add metadata\n    if (!create) return 'E';\n    // add missing metadata\n    setMeta(it);\n  // return object ID\n  } return it[META].i;\n};\nvar getWeak = function (it, create) {\n  if (!has(it, META)) {\n    // can't set metadata to uncaught frozen object\n    if (!isExtensible(it)) return true;\n    // not necessary to add metadata\n    if (!create) return false;\n    // add missing metadata\n    setMeta(it);\n  // return hash weak collections IDs\n  } return it[META].w;\n};\n// add metadata on freeze-family methods calling\nvar onFreeze = function (it) {\n  if (FREEZE && meta.NEED && isExtensible(it) && !has(it, META)) setMeta(it);\n  return it;\n};\nvar meta = module.exports = {\n  KEY: META,\n  NEED: false,\n  fastKey: fastKey,\n  getWeak: getWeak,\n  onFreeze: onFreeze\n};\n","// all enumerable object keys, includes symbols\nvar getKeys = require('./_object-keys');\nvar gOPS = require('./_object-gops');\nvar pIE = require('./_object-pie');\nmodule.exports = function (it) {\n  var result = getKeys(it);\n  var getSymbols = gOPS.f;\n  if (getSymbols) {\n    var symbols = getSymbols(it);\n    var isEnum = pIE.f;\n    var i = 0;\n    var key;\n    while (symbols.length > i) if (isEnum.call(it, key = symbols[i++])) result.push(key);\n  } return result;\n};\n","// 7.2.2 IsArray(argument)\nvar cof = require('./_cof');\nmodule.exports = Array.isArray || function isArray(arg) {\n  return cof(arg) == 'Array';\n};\n","// fallback for IE11 buggy Object.getOwnPropertyNames with iframe and window\nvar toIObject = require('./_to-iobject');\nvar gOPN = require('./_object-gopn').f;\nvar toString = {}.toString;\n\nvar windowNames = typeof window == 'object' && window && Object.getOwnPropertyNames\n  ? Object.getOwnPropertyNames(window) : [];\n\nvar getWindowNames = function (it) {\n  try {\n    return gOPN(it);\n  } catch (e) {\n    return windowNames.slice();\n  }\n};\n\nmodule.exports.f = function getOwnPropertyNames(it) {\n  return windowNames && toString.call(it) == '[object Window]' ? getWindowNames(it) : gOPN(toIObject(it));\n};\n","require('./_wks-define')('asyncIterator');\n","require('./_wks-define')('observable');\n","module.exports = { \"default\": require(\"core-js/library/fn/object/set-prototype-of\"), __esModule: true };","require('../../modules/es6.object.set-prototype-of');\nmodule.exports = require('../../modules/_core').Object.setPrototypeOf;\n","// 19.1.3.19 Object.setPrototypeOf(O, proto)\nvar $export = require('./_export');\n$export($export.S, 'Object', { setPrototypeOf: require('./_set-proto').set });\n","// Works with __proto__ only. Old v8 can't work with null proto objects.\n/* eslint-disable no-proto */\nvar isObject = require('./_is-object');\nvar anObject = require('./_an-object');\nvar check = function (O, proto) {\n  anObject(O);\n  if (!isObject(proto) && proto !== null) throw TypeError(proto + \": can't set as prototype!\");\n};\nmodule.exports = {\n  set: Object.setPrototypeOf || ('__proto__' in {} ? // eslint-disable-line\n    function (test, buggy, set) {\n      try {\n        set = require('./_ctx')(Function.call, require('./_object-gopd').f(Object.prototype, '__proto__').set, 2);\n        set(test, []);\n        buggy = !(test instanceof Array);\n      } catch (e) { buggy = true; }\n      return function setPrototypeOf(O, proto) {\n        check(O, proto);\n        if (buggy) O.__proto__ = proto;\n        else set(O, proto);\n        return O;\n      };\n    }({}, false) : undefined),\n  check: check\n};\n","module.exports = { \"default\": require(\"core-js/library/fn/object/create\"), __esModule: true };","require('../../modules/es6.object.create');\nvar $Object = require('../../modules/_core').Object;\nmodule.exports = function create(P, D) {\n  return $Object.create(P, D);\n};\n","var $export = require('./_export');\n// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\n$export($export.S, 'Object', { create: require('./_object-create') });\n","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.CurrencyRatio = exports.Currency = undefined;\n\nvar _getIterator2 = require('babel-runtime/core-js/get-iterator');\n\nvar _getIterator3 = _interopRequireDefault(_getIterator2);\n\nvar _toArray2 = require('babel-runtime/helpers/toArray');\n\nvar _toArray3 = _interopRequireDefault(_toArray2);\n\nvar _assign = require('babel-runtime/core-js/object/assign');\n\nvar _assign2 = _interopRequireDefault(_assign);\n\nvar _getPrototypeOf = require('babel-runtime/core-js/object/get-prototype-of');\n\nvar _getPrototypeOf2 = _interopRequireDefault(_getPrototypeOf);\n\nvar _possibleConstructorReturn2 = require('babel-runtime/helpers/possibleConstructorReturn');\n\nvar _possibleConstructorReturn3 = _interopRequireDefault(_possibleConstructorReturn2);\n\nvar _inherits2 = require('babel-runtime/helpers/inherits');\n\nvar _inherits3 = _interopRequireDefault(_inherits2);\n\nvar _classCallCheck2 = require('babel-runtime/helpers/classCallCheck');\n\nvar _classCallCheck3 = _interopRequireDefault(_classCallCheck2);\n\nvar _createClass2 = require('babel-runtime/helpers/createClass');\n\nvar _createClass3 = _interopRequireDefault(_createClass2);\n\nvar _bignumber = require('bignumber.js');\n\nvar _bignumber2 = _interopRequireDefault(_bignumber);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction amountToBigNumber(amount) {\n  if (amount instanceof Currency || typeof amount.toBigNumber === 'function') return amount.toBigNumber();\n\n  var value = (0, _bignumber2.default)(amount);\n  if (value.isNaN()) throw new Error('amount \"' + amount + '\" is not a number');\n  return value;\n}\n\nvar Currency = exports.Currency = function () {\n  function Currency(amount) {\n    var shift = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n    (0, _classCallCheck3.default)(this, Currency);\n\n    if (shift === 'wei') shift = -18;\n    if (shift === 'ray') shift = -27;\n    if (shift === 'rad') shift = -45;\n    this._amount = shift ? amountToBigNumber(amount).shiftedBy(shift) : amountToBigNumber(amount);\n    this.symbol = '???';\n  }\n\n  (0, _createClass3.default)(Currency, [{\n    key: 'isEqual',\n    value: function isEqual(other) {\n      return this._amount.eq(other._amount) && this.symbol == other.symbol;\n    }\n  }, {\n    key: 'toString',\n    value: function toString() {\n      var decimals = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 2;\n\n      return this._amount.toFixed(decimals) + ' ' + this.symbol;\n    }\n  }, {\n    key: 'toBigNumber',\n    value: function toBigNumber() {\n      return this._amount;\n    }\n  }, {\n    key: 'toNumber',\n    value: function toNumber() {\n      return this._amount.toNumber();\n    }\n  }, {\n    key: 'toFixed',\n    value: function toFixed() {\n      var shift = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 0;\n\n      if (shift === 'wei') shift = 18;\n      if (shift === 'ray') shift = 27;\n      if (shift === 'rad') shift = 45;\n\n      // always round down so that we never attempt to spend more than we have\n      return this._amount.shiftedBy(shift).integerValue(_bignumber2.default.ROUND_DOWN).toFixed();\n    }\n  }, {\n    key: 'isSameType',\n    value: function isSameType(other) {\n      return this.symbol === other.symbol;\n    }\n  }]);\n  return Currency;\n}();\n\n// FIXME: this is not exactly analogous to Currency above, because all the\n// different pairs are instances of the same class rather than subclasses in\n// their own right. but for now it works fine, because it's the wrapper\n// functions that are used externally anyway. so if we want to be consistent, we\n// could either create subclasses for each ratio, or refactor Currency so it\n// also just stores its symbol in the instance rather than the subclass.\n\n\nvar CurrencyRatio = exports.CurrencyRatio = function (_Currency) {\n  (0, _inherits3.default)(CurrencyRatio, _Currency);\n\n  function CurrencyRatio(amount, numerator, denominator, shift) {\n    (0, _classCallCheck3.default)(this, CurrencyRatio);\n\n    var _this = (0, _possibleConstructorReturn3.default)(this, (CurrencyRatio.__proto__ || (0, _getPrototypeOf2.default)(CurrencyRatio)).call(this, amount, shift));\n\n    _this.numerator = numerator;\n    _this.denominator = denominator;\n    _this.symbol = numerator.symbol + '/' + denominator.symbol;\n    return _this;\n  }\n\n  return CurrencyRatio;\n}(Currency);\n\nvar mathFunctions = [['plus', 'add'], ['minus', 'sub'], ['times', 'multipliedBy', 'mul'], ['div', 'dividedBy'], ['shiftedBy']];\n\nvar booleanFunctions = [['isLessThan', 'lt'], ['isLessThanOrEqualTo', 'lte'], ['isGreaterThan', 'gt'], ['isGreaterThanOrEqualTo', 'gte'], ['eq']];\n\nfunction assertValidOperation(method, left, right) {\n  if (!right && right !== 0) {\n    throw new Error('Invalid operation: ' + left.symbol + ' ' + method + ' with no right operand');\n  }\n\n  if (!(right instanceof Currency) || left.isSameType(right)) return;\n\n  if (right instanceof CurrencyRatio) {\n    // only supporting Currency as a left operand for now, though we could\n    // extend this to support ratio-ratio math if needed\n    switch (method) {\n      case 'times':\n        if (left.isSameType(right.denominator)) return;\n        break;\n      case 'div':\n        if (left.isSameType(right.numerator)) return;\n        break;\n    }\n  } else {\n    switch (method) {\n      // division between two different units results in a ratio, e.g. USD/DAI\n      case 'div':\n        return;\n    }\n  }\n\n  throw new Error('Invalid operation: ' + left.symbol + ' ' + method + ' ' + right.symbol);\n}\n\nfunction bigNumberFnResult(method, left, right, value) {\n  if (right instanceof CurrencyRatio) {\n    switch (method) {\n      case 'times':\n        return new right.numerator(value);\n      case 'div':\n        return new right.denominator(value);\n    }\n  }\n\n  if (!(right instanceof Currency) || left.isSameType(right)) {\n    if (left instanceof CurrencyRatio) {\n      return new left.constructor(value, left.numerator, left.denominator, left.shift);\n    }\n    return new left.constructor(value);\n  }\n\n  return new CurrencyRatio(value, left.constructor, right.constructor);\n}\n\nfunction bigNumberFnWrapper(method, isBoolean) {\n  return function (other) {\n    assertValidOperation(method, this, other);\n\n    var otherBigNumber = other instanceof Currency ? other.toBigNumber() : other;\n\n    var value = this.toBigNumber()[method](otherBigNumber);\n    return isBoolean ? value : bigNumberFnResult(method, this, other, value);\n  };\n}\n\n(0, _assign2.default)(Currency.prototype, mathFunctions.reduce(function (output, _ref) {\n  var _ref2 = (0, _toArray3.default)(_ref),\n      method = _ref2[0],\n      aliases = _ref2.slice(1);\n\n  output[method] = bigNumberFnWrapper(method);\n  var _iteratorNormalCompletion = true;\n  var _didIteratorError = false;\n  var _iteratorError = undefined;\n\n  try {\n    for (var _iterator = (0, _getIterator3.default)(aliases), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n      var alias = _step.value;\n\n      output[alias] = output[method];\n    }\n  } catch (err) {\n    _didIteratorError = true;\n    _iteratorError = err;\n  } finally {\n    try {\n      if (!_iteratorNormalCompletion && _iterator.return) {\n        _iterator.return();\n      }\n    } finally {\n      if (_didIteratorError) {\n        throw _iteratorError;\n      }\n    }\n  }\n\n  return output;\n}, {}), booleanFunctions.reduce(function (output, _ref3) {\n  var _ref4 = (0, _toArray3.default)(_ref3),\n      method = _ref4[0],\n      aliases = _ref4.slice(1);\n\n  output[method] = bigNumberFnWrapper(method, true);\n  var _iteratorNormalCompletion2 = true;\n  var _didIteratorError2 = false;\n  var _iteratorError2 = undefined;\n\n  try {\n    for (var _iterator2 = (0, _getIterator3.default)(aliases), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n      var alias = _step2.value;\n\n      output[alias] = output[method];\n    }\n  } catch (err) {\n    _didIteratorError2 = true;\n    _iteratorError2 = err;\n  } finally {\n    try {\n      if (!_iteratorNormalCompletion2 && _iterator2.return) {\n        _iterator2.return();\n      }\n    } finally {\n      if (_didIteratorError2) {\n        throw _iteratorError2;\n      }\n    }\n  }\n\n  return output;\n}, {}));","module.exports = { \"default\": require(\"core-js/library/fn/get-iterator\"), __esModule: true };","require('../modules/web.dom.iterable');\nrequire('../modules/es6.string.iterator');\nmodule.exports = require('../modules/core.get-iterator');\n","var anObject = require('./_an-object');\nvar get = require('./core.get-iterator-method');\nmodule.exports = require('./_core').getIterator = function (it) {\n  var iterFn = get(it);\n  if (typeof iterFn != 'function') throw TypeError(it + ' is not iterable!');\n  return anObject(iterFn.call(it));\n};\n","// getting tag from 19.1.3.6 Object.prototype.toString()\nvar cof = require('./_cof');\nvar TAG = require('./_wks')('toStringTag');\n// ES3 wrong here\nvar ARG = cof(function () { return arguments; }()) == 'Arguments';\n\n// fallback for IE11 Script Access Denied error\nvar tryGet = function (it, key) {\n  try {\n    return it[key];\n  } catch (e) { /* empty */ }\n};\n\nmodule.exports = function (it) {\n  var O, T, B;\n  return it === undefined ? 'Undefined' : it === null ? 'Null'\n    // @@toStringTag case\n    : typeof (T = tryGet(O = Object(it), TAG)) == 'string' ? T\n    // builtinTag case\n    : ARG ? cof(O)\n    // ES3 arguments fallback\n    : (B = cof(O)) == 'Object' && typeof O.callee == 'function' ? 'Arguments' : B;\n};\n","\"use strict\";\n\nexports.__esModule = true;\n\nvar _from = require(\"../core-js/array/from\");\n\nvar _from2 = _interopRequireDefault(_from);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.default = function (arr) {\n  return Array.isArray(arr) ? arr : (0, _from2.default)(arr);\n};","module.exports = { \"default\": require(\"core-js/library/fn/array/from\"), __esModule: true };","require('../../modules/es6.string.iterator');\nrequire('../../modules/es6.array.from');\nmodule.exports = require('../../modules/_core').Array.from;\n","'use strict';\nvar ctx = require('./_ctx');\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar call = require('./_iter-call');\nvar isArrayIter = require('./_is-array-iter');\nvar toLength = require('./_to-length');\nvar createProperty = require('./_create-property');\nvar getIterFn = require('./core.get-iterator-method');\n\n$export($export.S + $export.F * !require('./_iter-detect')(function (iter) { Array.from(iter); }), 'Array', {\n  // 22.1.2.1 Array.from(arrayLike, mapfn = undefined, thisArg = undefined)\n  from: function from(arrayLike /* , mapfn = undefined, thisArg = undefined */) {\n    var O = toObject(arrayLike);\n    var C = typeof this == 'function' ? this : Array;\n    var aLen = arguments.length;\n    var mapfn = aLen > 1 ? arguments[1] : undefined;\n    var mapping = mapfn !== undefined;\n    var index = 0;\n    var iterFn = getIterFn(O);\n    var length, result, step, iterator;\n    if (mapping) mapfn = ctx(mapfn, aLen > 2 ? arguments[2] : undefined, 2);\n    // if object isn't iterable or it's array with default iterator - use simple case\n    if (iterFn != undefined && !(C == Array && isArrayIter(iterFn))) {\n      for (iterator = iterFn.call(O), result = new C(); !(step = iterator.next()).done; index++) {\n        createProperty(result, index, mapping ? call(iterator, mapfn, [step.value, index], true) : step.value);\n      }\n    } else {\n      length = toLength(O.length);\n      for (result = new C(length); length > index; index++) {\n        createProperty(result, index, mapping ? mapfn(O[index], index) : O[index]);\n      }\n    }\n    result.length = index;\n    return result;\n  }\n});\n","// call something on iterator step with safe closing on error\nvar anObject = require('./_an-object');\nmodule.exports = function (iterator, fn, value, entries) {\n  try {\n    return entries ? fn(anObject(value)[0], value[1]) : fn(value);\n  // 7.4.6 IteratorClose(iterator, completion)\n  } catch (e) {\n    var ret = iterator['return'];\n    if (ret !== undefined) anObject(ret.call(iterator));\n    throw e;\n  }\n};\n","// check on default Array iterator\nvar Iterators = require('./_iterators');\nvar ITERATOR = require('./_wks')('iterator');\nvar ArrayProto = Array.prototype;\n\nmodule.exports = function (it) {\n  return it !== undefined && (Iterators.Array === it || ArrayProto[ITERATOR] === it);\n};\n","'use strict';\nvar $defineProperty = require('./_object-dp');\nvar createDesc = require('./_property-desc');\n\nmodule.exports = function (object, index, value) {\n  if (index in object) $defineProperty.f(object, index, createDesc(0, value));\n  else object[index] = value;\n};\n","var ITERATOR = require('./_wks')('iterator');\nvar SAFE_CLOSING = false;\n\ntry {\n  var riter = [7][ITERATOR]();\n  riter['return'] = function () { SAFE_CLOSING = true; };\n  // eslint-disable-next-line no-throw-literal\n  Array.from(riter, function () { throw 2; });\n} catch (e) { /* empty */ }\n\nmodule.exports = function (exec, skipClosing) {\n  if (!skipClosing && !SAFE_CLOSING) return false;\n  var safe = false;\n  try {\n    var arr = [7];\n    var iter = arr[ITERATOR]();\n    iter.next = function () { return { done: safe = true }; };\n    arr[ITERATOR] = function () { return iter; };\n    exec(arr);\n  } catch (e) { /* empty */ }\n  return safe;\n};\n","\"use strict\";\n\nexports.__esModule = true;\n\nvar _defineProperty = require(\"../core-js/object/define-property\");\n\nvar _defineProperty2 = _interopRequireDefault(_defineProperty);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.default = function () {\n  function defineProperties(target, props) {\n    for (var i = 0; i < props.length; i++) {\n      var descriptor = props[i];\n      descriptor.enumerable = descriptor.enumerable || false;\n      descriptor.configurable = true;\n      if (\"value\" in descriptor) descriptor.writable = true;\n      (0, _defineProperty2.default)(target, descriptor.key, descriptor);\n    }\n  }\n\n  return function (Constructor, protoProps, staticProps) {\n    if (protoProps) defineProperties(Constructor.prototype, protoProps);\n    if (staticProps) defineProperties(Constructor, staticProps);\n    return Constructor;\n  };\n}();","module.exports = { \"default\": require(\"core-js/library/fn/object/define-property\"), __esModule: true };","require('../../modules/es6.object.define-property');\nvar $Object = require('../../modules/_core').Object;\nmodule.exports = function defineProperty(it, key, desc) {\n  return $Object.defineProperty(it, key, desc);\n};\n","var $export = require('./_export');\n// 19.1.2.4 / 15.2.3.6 Object.defineProperty(O, P, Attributes)\n$export($export.S + $export.F * !require('./_descriptors'), 'Object', { defineProperty: require('./_object-dp').f });\n",";(function (globalObject) {\r\n  'use strict';\r\n\r\n/*\r\n *      bignumber.js v8.1.1\r\n *      A JavaScript library for arbitrary-precision arithmetic.\r\n *      https://github.com/MikeMcl/bignumber.js\r\n *      Copyright (c) 2019 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *      MIT Licensed.\r\n *\r\n *      BigNumber.prototype methods     |  BigNumber methods\r\n *                                      |\r\n *      absoluteValue            abs    |  clone\r\n *      comparedTo                      |  config               set\r\n *      decimalPlaces            dp     |      DECIMAL_PLACES\r\n *      dividedBy                div    |      ROUNDING_MODE\r\n *      dividedToIntegerBy       idiv   |      EXPONENTIAL_AT\r\n *      exponentiatedBy          pow    |      RANGE\r\n *      integerValue                    |      CRYPTO\r\n *      isEqualTo                eq     |      MODULO_MODE\r\n *      isFinite                        |      POW_PRECISION\r\n *      isGreaterThan            gt     |      FORMAT\r\n *      isGreaterThanOrEqualTo   gte    |      ALPHABET\r\n *      isInteger                       |  isBigNumber\r\n *      isLessThan               lt     |  maximum              max\r\n *      isLessThanOrEqualTo      lte    |  minimum              min\r\n *      isNaN                           |  random\r\n *      isNegative                      |  sum\r\n *      isPositive                      |\r\n *      isZero                          |\r\n *      minus                           |\r\n *      modulo                   mod    |\r\n *      multipliedBy             times  |\r\n *      negated                         |\r\n *      plus                            |\r\n *      precision                sd     |\r\n *      shiftedBy                       |\r\n *      squareRoot               sqrt   |\r\n *      toExponential                   |\r\n *      toFixed                         |\r\n *      toFormat                        |\r\n *      toFraction                      |\r\n *      toJSON                          |\r\n *      toNumber                        |\r\n *      toPrecision                     |\r\n *      toString                        |\r\n *      valueOf                         |\r\n *\r\n */\r\n\r\n\r\n  var BigNumber,\r\n    isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n    hasSymbol = typeof Symbol == 'function' && typeof Symbol.iterator == 'symbol',\r\n\r\n    mathceil = Math.ceil,\r\n    mathfloor = Math.floor,\r\n\r\n    bignumberError = '[BigNumber Error] ',\r\n    tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n    BASE = 1e14,\r\n    LOG_BASE = 14,\r\n    MAX_SAFE_INTEGER = 0x1fffffffffffff,         // 2^53 - 1\r\n    // MAX_INT32 = 0x7fffffff,                   // 2^31 - 1\r\n    POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n    SQRT_BASE = 1e7,\r\n\r\n    // EDITABLE\r\n    // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n    // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n    MAX = 1E9;                                   // 0 to MAX_INT32\r\n\r\n\r\n  /*\r\n   * Create and return a BigNumber constructor.\r\n   */\r\n  function clone(configObject) {\r\n    var div, convertBase, parseNumeric,\r\n      P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n      ONE = new BigNumber(1),\r\n\r\n\r\n      //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n      // The default values below must be integers within the inclusive ranges stated.\r\n      // The values can also be changed at run-time using BigNumber.set.\r\n\r\n      // The maximum number of decimal places for operations involving division.\r\n      DECIMAL_PLACES = 20,                     // 0 to MAX\r\n\r\n      // The rounding mode used when rounding to the above decimal places, and when using\r\n      // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n      // UP         0 Away from zero.\r\n      // DOWN       1 Towards zero.\r\n      // CEIL       2 Towards +Infinity.\r\n      // FLOOR      3 Towards -Infinity.\r\n      // HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      ROUNDING_MODE = 4,                       // 0 to 8\r\n\r\n      // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n      // The exponent value at and beneath which toString returns exponential notation.\r\n      // Number type: -7\r\n      TO_EXP_NEG = -7,                         // 0 to -MAX\r\n\r\n      // The exponent value at and above which toString returns exponential notation.\r\n      // Number type: 21\r\n      TO_EXP_POS = 21,                         // 0 to MAX\r\n\r\n      // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // Number type: -324  (5e-324)\r\n      MIN_EXP = -1e7,                          // -1 to -MAX\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // Number type:  308  (1.7976931348623157e+308)\r\n      // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n      MAX_EXP = 1e7,                           // 1 to MAX\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      CRYPTO = false,                          // true or false\r\n\r\n      // The modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP        0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN      1 The remainder has the same sign as the dividend.\r\n      //             This modulo mode is commonly known as 'truncated division' and is\r\n      //             equivalent to (a % n) in JavaScript.\r\n      // FLOOR     3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n      // EUCLID    9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n      //             The remainder is always positive.\r\n      //\r\n      // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n      // modes are commonly used for the modulus operation.\r\n      // Although the other rounding modes can also be used, they may not give useful results.\r\n      MODULO_MODE = 1,                         // 0 to 9\r\n\r\n      // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n      // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n      POW_PRECISION = 0,                    // 0 to MAX\r\n\r\n      // The format specification used by the BigNumber.prototype.toFormat method.\r\n      FORMAT = {\r\n        prefix: '',\r\n        groupSize: 3,\r\n        secondaryGroupSize: 0,\r\n        groupSeparator: ',',\r\n        decimalSeparator: '.',\r\n        fractionGroupSize: 0,\r\n        fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n        suffix: ''\r\n      },\r\n\r\n      // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n      // '-', '.', whitespace, or repeated character.\r\n      // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n      ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz';\r\n\r\n\r\n    //------------------------------------------------------------------------------------------\r\n\r\n\r\n    // CONSTRUCTOR\r\n\r\n\r\n    /*\r\n     * The BigNumber constructor and exported function.\r\n     * Create and return a new instance of a BigNumber object.\r\n     *\r\n     * v {number|string|BigNumber} A numeric value.\r\n     * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n     */\r\n    function BigNumber(v, b) {\r\n      var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n        x = this;\r\n\r\n      // Enable constructor call without `new`.\r\n      if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n      if (b == null) {\r\n\r\n        if (v && v._isBigNumber === true) {\r\n          x.s = v.s;\r\n\r\n          if (!v.c || v.e > MAX_EXP) {\r\n            x.c = x.e = null;\r\n          } else if (v.e < MIN_EXP) {\r\n            x.c = [x.e = 0];\r\n          } else {\r\n            x.e = v.e;\r\n            x.c = v.c.slice();\r\n          }\r\n\r\n          return;\r\n        }\r\n\r\n        if ((isNum = typeof v == 'number') && v * 0 == 0) {\r\n\r\n          // Use `1 / n` to handle minus zero also.\r\n          x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n          // Fast path for integers, where n < 2147483648 (2**31).\r\n          if (v === ~~v) {\r\n            for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n            if (e > MAX_EXP) {\r\n              x.c = x.e = null;\r\n            } else {\r\n              x.e = e;\r\n              x.c = [v];\r\n            }\r\n\r\n            return;\r\n          }\r\n\r\n          str = String(v);\r\n        } else {\r\n\r\n          if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n          x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n        // Exponential form?\r\n        if ((i = str.search(/e/i)) > 0) {\r\n\r\n          // Determine exponent.\r\n          if (e < 0) e = i;\r\n          e += +str.slice(i + 1);\r\n          str = str.substring(0, i);\r\n        } else if (e < 0) {\r\n\r\n          // Integer.\r\n          e = str.length;\r\n        }\r\n\r\n      } else {\r\n\r\n        // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n        intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n        // Allow exponential notation to be used with base 10 argument, while\r\n        // also rounding to DECIMAL_PLACES as with other bases.\r\n        if (b == 10) {\r\n          x = new BigNumber(v);\r\n          return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n        }\r\n\r\n        str = String(v);\r\n\r\n        if (isNum = typeof v == 'number') {\r\n\r\n          // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n          if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n          x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n          // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n          if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n            throw Error\r\n             (tooManyDigits + v);\r\n          }\r\n        } else {\r\n          x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        alphabet = ALPHABET.slice(0, b);\r\n        e = i = 0;\r\n\r\n        // Check that str is a valid base b number.\r\n        // Don't use RegExp, so alphabet can contain special characters.\r\n        for (len = str.length; i < len; i++) {\r\n          if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n            if (c == '.') {\r\n\r\n              // If '.' is not the first character and it has not be found before.\r\n              if (i > e) {\r\n                e = len;\r\n                continue;\r\n              }\r\n            } else if (!caseChanged) {\r\n\r\n              // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n              if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n                  str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n                caseChanged = true;\r\n                i = -1;\r\n                e = 0;\r\n                continue;\r\n              }\r\n            }\r\n\r\n            return parseNumeric(x, String(v), isNum, b);\r\n          }\r\n        }\r\n\r\n        // Prevent later check for length on converted number.\r\n        isNum = false;\r\n        str = convertBase(str, b, 10, x.s);\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n        else e = str.length;\r\n      }\r\n\r\n      // Determine leading zeros.\r\n      for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n      // Determine trailing zeros.\r\n      for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n      if (str = str.slice(i, ++len)) {\r\n        len -= i;\r\n\r\n        // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n        if (isNum && BigNumber.DEBUG &&\r\n          len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r\n            throw Error\r\n             (tooManyDigits + (x.s * v));\r\n        }\r\n\r\n         // Overflow?\r\n        if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n          // Infinity.\r\n          x.c = x.e = null;\r\n\r\n        // Underflow?\r\n        } else if (e < MIN_EXP) {\r\n\r\n          // Zero.\r\n          x.c = [x.e = 0];\r\n        } else {\r\n          x.e = e;\r\n          x.c = [];\r\n\r\n          // Transform base\r\n\r\n          // e is the base 10 exponent.\r\n          // i is where to slice str to get the first element of the coefficient array.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (e < 0) i += LOG_BASE;  // i < 1\r\n\r\n          if (i < len) {\r\n            if (i) x.c.push(+str.slice(0, i));\r\n\r\n            for (len -= LOG_BASE; i < len;) {\r\n              x.c.push(+str.slice(i, i += LOG_BASE));\r\n            }\r\n\r\n            i = LOG_BASE - (str = str.slice(i)).length;\r\n          } else {\r\n            i -= len;\r\n          }\r\n\r\n          for (; i--; str += '0');\r\n          x.c.push(+str);\r\n        }\r\n      } else {\r\n\r\n        // Zero.\r\n        x.c = [x.e = 0];\r\n      }\r\n    }\r\n\r\n\r\n    // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n    BigNumber.clone = clone;\r\n\r\n    BigNumber.ROUND_UP = 0;\r\n    BigNumber.ROUND_DOWN = 1;\r\n    BigNumber.ROUND_CEIL = 2;\r\n    BigNumber.ROUND_FLOOR = 3;\r\n    BigNumber.ROUND_HALF_UP = 4;\r\n    BigNumber.ROUND_HALF_DOWN = 5;\r\n    BigNumber.ROUND_HALF_EVEN = 6;\r\n    BigNumber.ROUND_HALF_CEIL = 7;\r\n    BigNumber.ROUND_HALF_FLOOR = 8;\r\n    BigNumber.EUCLID = 9;\r\n\r\n\r\n    /*\r\n     * Configure infrequently-changing library-wide settings.\r\n     *\r\n     * Accept an object with the following optional properties (if the value of a property is\r\n     * a number, it must be an integer within the inclusive range stated):\r\n     *\r\n     *   DECIMAL_PLACES   {number}           0 to MAX\r\n     *   ROUNDING_MODE    {number}           0 to 8\r\n     *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]\r\n     *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]\r\n     *   CRYPTO           {boolean}          true or false\r\n     *   MODULO_MODE      {number}           0 to 9\r\n     *   POW_PRECISION       {number}           0 to MAX\r\n     *   ALPHABET         {string}           A string of two or more unique characters which does\r\n     *                                       not contain '.'.\r\n     *   FORMAT           {object}           An object with some of the following properties:\r\n     *     prefix                 {string}\r\n     *     groupSize              {number}\r\n     *     secondaryGroupSize     {number}\r\n     *     groupSeparator         {string}\r\n     *     decimalSeparator       {string}\r\n     *     fractionGroupSize      {number}\r\n     *     fractionGroupSeparator {string}\r\n     *     suffix                 {string}\r\n     *\r\n     * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n     *\r\n     * E.g.\r\n     * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n     *\r\n     * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n     *\r\n     * Return an object with the properties current values.\r\n     */\r\n    BigNumber.config = BigNumber.set = function (obj) {\r\n      var p, v;\r\n\r\n      if (obj != null) {\r\n\r\n        if (typeof obj == 'object') {\r\n\r\n          // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            DECIMAL_PLACES = v;\r\n          }\r\n\r\n          // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n          // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 8, p);\r\n            ROUNDING_MODE = v;\r\n          }\r\n\r\n          // EXPONENTIAL_AT {number|number[]}\r\n          // Integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n          // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n            v = obj[p];\r\n            if (v && v.pop) {\r\n              intCheck(v[0], -MAX, 0, p);\r\n              intCheck(v[1], 0, MAX, p);\r\n              TO_EXP_NEG = v[0];\r\n              TO_EXP_POS = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n            }\r\n          }\r\n\r\n          // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n          // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n          if (obj.hasOwnProperty(p = 'RANGE')) {\r\n            v = obj[p];\r\n            if (v && v.pop) {\r\n              intCheck(v[0], -MAX, -1, p);\r\n              intCheck(v[1], 1, MAX, p);\r\n              MIN_EXP = v[0];\r\n              MAX_EXP = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              if (v) {\r\n                MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n              } else {\r\n                throw Error\r\n                 (bignumberError + p + ' cannot be zero: ' + v);\r\n              }\r\n            }\r\n          }\r\n\r\n          // CRYPTO {boolean} true or false.\r\n          // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n          // '[BigNumber Error] crypto unavailable'\r\n          if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n            v = obj[p];\r\n            if (v === !!v) {\r\n              if (v) {\r\n                if (typeof crypto != 'undefined' && crypto &&\r\n                 (crypto.getRandomValues || crypto.randomBytes)) {\r\n                  CRYPTO = v;\r\n                } else {\r\n                  CRYPTO = !v;\r\n                  throw Error\r\n                   (bignumberError + 'crypto unavailable');\r\n                }\r\n              } else {\r\n                CRYPTO = v;\r\n              }\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' not true or false: ' + v);\r\n            }\r\n          }\r\n\r\n          // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n          // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 9, p);\r\n            MODULO_MODE = v;\r\n          }\r\n\r\n          // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            POW_PRECISION = v;\r\n          }\r\n\r\n          // FORMAT {object}\r\n          // '[BigNumber Error] FORMAT not an object: {v}'\r\n          if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n            v = obj[p];\r\n            if (typeof v == 'object') FORMAT = v;\r\n            else throw Error\r\n             (bignumberError + p + ' not an object: ' + v);\r\n          }\r\n\r\n          // ALPHABET {string}\r\n          // '[BigNumber Error] ALPHABET invalid: {v}'\r\n          if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n            v = obj[p];\r\n\r\n            // Disallow if only one character,\r\n            // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n            if (typeof v == 'string' && !/^.$|[+-.\\s]|(.).*\\1/.test(v)) {\r\n              ALPHABET = v;\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' invalid: ' + v);\r\n            }\r\n          }\r\n\r\n        } else {\r\n\r\n          // '[BigNumber Error] Object expected: {v}'\r\n          throw Error\r\n           (bignumberError + 'Object expected: ' + obj);\r\n        }\r\n      }\r\n\r\n      return {\r\n        DECIMAL_PLACES: DECIMAL_PLACES,\r\n        ROUNDING_MODE: ROUNDING_MODE,\r\n        EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n        RANGE: [MIN_EXP, MAX_EXP],\r\n        CRYPTO: CRYPTO,\r\n        MODULO_MODE: MODULO_MODE,\r\n        POW_PRECISION: POW_PRECISION,\r\n        FORMAT: FORMAT,\r\n        ALPHABET: ALPHABET\r\n      };\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if v is a BigNumber instance, otherwise return false.\r\n     *\r\n     * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n     *\r\n     * v {any}\r\n     *\r\n     * '[BigNumber Error] Invalid BigNumber: {v}'\r\n     */\r\n    BigNumber.isBigNumber = function (v) {\r\n      if (!v || v._isBigNumber !== true) return false;\r\n      if (!BigNumber.DEBUG) return true;\r\n\r\n      var i, n,\r\n        c = v.c,\r\n        e = v.e,\r\n        s = v.s;\r\n\r\n      out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n        if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n          // If the first element is zero, the BigNumber value must be zero.\r\n          if (c[0] === 0) {\r\n            if (e === 0 && c.length === 1) return true;\r\n            break out;\r\n          }\r\n\r\n          // Calculate number of digits that c[0] should have, based on the exponent.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (i < 1) i += LOG_BASE;\r\n\r\n          // Calculate number of digits of c[0].\r\n          //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n          if (String(c[0]).length == i) {\r\n\r\n            for (i = 0; i < c.length; i++) {\r\n              n = c[i];\r\n              if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r\n            }\r\n\r\n            // Last element cannot be zero, unless it is the only element.\r\n            if (n !== 0) return true;\r\n          }\r\n        }\r\n\r\n      // Infinity/NaN\r\n      } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r\n        return true;\r\n      }\r\n\r\n      throw Error\r\n        (bignumberError + 'Invalid BigNumber: ' + v);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the maximum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.maximum = BigNumber.max = function () {\r\n      return maxOrMin(arguments, P.lt);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the minimum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.minimum = BigNumber.min = function () {\r\n      return maxOrMin(arguments, P.gt);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n     * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n     * zeros are produced).\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n     * '[BigNumber Error] crypto unavailable'\r\n     */\r\n    BigNumber.random = (function () {\r\n      var pow2_53 = 0x20000000000000;\r\n\r\n      // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n      // Check if Math.random() produces more than 32 bits of randomness.\r\n      // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n      // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n      var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n       ? function () { return mathfloor(Math.random() * pow2_53); }\r\n       : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n         (Math.random() * 0x800000 | 0); };\r\n\r\n      return function (dp) {\r\n        var a, b, e, k, v,\r\n          i = 0,\r\n          c = [],\r\n          rand = new BigNumber(ONE);\r\n\r\n        if (dp == null) dp = DECIMAL_PLACES;\r\n        else intCheck(dp, 0, MAX);\r\n\r\n        k = mathceil(dp / LOG_BASE);\r\n\r\n        if (CRYPTO) {\r\n\r\n          // Browsers supporting crypto.getRandomValues.\r\n          if (crypto.getRandomValues) {\r\n\r\n            a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n            for (; i < k;) {\r\n\r\n              // 53 bits:\r\n              // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n              // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n              // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n              //                                     11111 11111111 11111111\r\n              // 0x20000 is 2^21.\r\n              v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n              // Rejection sampling:\r\n              // 0 <= v < 9007199254740992\r\n              // Probability that v >= 9e15, is\r\n              // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n              if (v >= 9e15) {\r\n                b = crypto.getRandomValues(new Uint32Array(2));\r\n                a[i] = b[0];\r\n                a[i + 1] = b[1];\r\n              } else {\r\n\r\n                // 0 <= v <= 8999999999999999\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 2;\r\n              }\r\n            }\r\n            i = k / 2;\r\n\r\n          // Node.js supporting crypto.randomBytes.\r\n          } else if (crypto.randomBytes) {\r\n\r\n            // buffer\r\n            a = crypto.randomBytes(k *= 7);\r\n\r\n            for (; i < k;) {\r\n\r\n              // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n              // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n              // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n              // 0 <= v < 9007199254740992\r\n              v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n                 (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n                 (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n              if (v >= 9e15) {\r\n                crypto.randomBytes(7).copy(a, i);\r\n              } else {\r\n\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 7;\r\n              }\r\n            }\r\n            i = k / 7;\r\n          } else {\r\n            CRYPTO = false;\r\n            throw Error\r\n             (bignumberError + 'crypto unavailable');\r\n          }\r\n        }\r\n\r\n        // Use Math.random.\r\n        if (!CRYPTO) {\r\n\r\n          for (; i < k;) {\r\n            v = random53bitInt();\r\n            if (v < 9e15) c[i++] = v % 1e14;\r\n          }\r\n        }\r\n\r\n        k = c[--i];\r\n        dp %= LOG_BASE;\r\n\r\n        // Convert trailing digits to zeros according to dp.\r\n        if (k && dp) {\r\n          v = POWS_TEN[LOG_BASE - dp];\r\n          c[i] = mathfloor(k / v) * v;\r\n        }\r\n\r\n        // Remove trailing elements which are zero.\r\n        for (; c[i] === 0; c.pop(), i--);\r\n\r\n        // Zero?\r\n        if (i < 0) {\r\n          c = [e = 0];\r\n        } else {\r\n\r\n          // Remove leading elements which are zero and adjust exponent accordingly.\r\n          for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n          // Count the digits of the first element of c to determine leading zeros, and...\r\n          for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n          // adjust the exponent accordingly.\r\n          if (i < LOG_BASE) e -= LOG_BASE - i;\r\n        }\r\n\r\n        rand.e = e;\r\n        rand.c = c;\r\n        return rand;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the sum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.sum = function () {\r\n      var i = 1,\r\n        args = arguments,\r\n        sum = new BigNumber(args[0]);\r\n      for (; i < args.length;) sum = sum.plus(args[i++]);\r\n      return sum;\r\n    };\r\n\r\n\r\n    // PRIVATE FUNCTIONS\r\n\r\n\r\n    // Called by BigNumber and BigNumber.prototype.toString.\r\n    convertBase = (function () {\r\n      var decimal = '0123456789';\r\n\r\n      /*\r\n       * Convert string of baseIn to an array of numbers of baseOut.\r\n       * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n       * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n       */\r\n      function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n        var j,\r\n          arr = [0],\r\n          arrL,\r\n          i = 0,\r\n          len = str.length;\r\n\r\n        for (; i < len;) {\r\n          for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n          arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n          for (j = 0; j < arr.length; j++) {\r\n\r\n            if (arr[j] > baseOut - 1) {\r\n              if (arr[j + 1] == null) arr[j + 1] = 0;\r\n              arr[j + 1] += arr[j] / baseOut | 0;\r\n              arr[j] %= baseOut;\r\n            }\r\n          }\r\n        }\r\n\r\n        return arr.reverse();\r\n      }\r\n\r\n      // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n      // If the caller is toString, we are converting from base 10 to baseOut.\r\n      // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n      return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n        var alphabet, d, e, k, r, x, xc, y,\r\n          i = str.indexOf('.'),\r\n          dp = DECIMAL_PLACES,\r\n          rm = ROUNDING_MODE;\r\n\r\n        // Non-integer.\r\n        if (i >= 0) {\r\n          k = POW_PRECISION;\r\n\r\n          // Unlimited precision.\r\n          POW_PRECISION = 0;\r\n          str = str.replace('.', '');\r\n          y = new BigNumber(baseIn);\r\n          x = y.pow(str.length - i);\r\n          POW_PRECISION = k;\r\n\r\n          // Convert str as if an integer, then restore the fraction part by dividing the\r\n          // result by its base raised to a power.\r\n\r\n          y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n           10, baseOut, decimal);\r\n          y.e = y.c.length;\r\n        }\r\n\r\n        // Convert the number as integer.\r\n\r\n        xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n         ? (alphabet = ALPHABET, decimal)\r\n         : (alphabet = decimal, ALPHABET));\r\n\r\n        // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n        e = k = xc.length;\r\n\r\n        // Remove trailing zeros.\r\n        for (; xc[--k] == 0; xc.pop());\r\n\r\n        // Zero?\r\n        if (!xc[0]) return alphabet.charAt(0);\r\n\r\n        // Does str represent an integer? If so, no need for the division.\r\n        if (i < 0) {\r\n          --e;\r\n        } else {\r\n          x.c = xc;\r\n          x.e = e;\r\n\r\n          // The sign is needed for correct rounding.\r\n          x.s = sign;\r\n          x = div(x, y, dp, rm, baseOut);\r\n          xc = x.c;\r\n          r = x.r;\r\n          e = x.e;\r\n        }\r\n\r\n        // xc now represents str converted to baseOut.\r\n\r\n        // THe index of the rounding digit.\r\n        d = e + dp + 1;\r\n\r\n        // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n        i = xc[d];\r\n\r\n        // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n        k = baseOut / 2;\r\n        r = r || d < 0 || xc[d + 1] != null;\r\n\r\n        r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n              : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n               rm == (x.s < 0 ? 8 : 7));\r\n\r\n        // If the index of the rounding digit is not greater than zero, or xc represents\r\n        // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n        // such as 0.00001.\r\n        if (d < 1 || !xc[0]) {\r\n\r\n          // 1^-dp or 0\r\n          str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n        } else {\r\n\r\n          // Truncate xc to the required number of decimal places.\r\n          xc.length = d;\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            // Rounding up may mean the previous digit has to be rounded up and so on.\r\n            for (--baseOut; ++xc[--d] > baseOut;) {\r\n              xc[d] = 0;\r\n\r\n              if (!d) {\r\n                ++e;\r\n                xc = [1].concat(xc);\r\n              }\r\n            }\r\n          }\r\n\r\n          // Determine trailing zeros.\r\n          for (k = xc.length; !xc[--k];);\r\n\r\n          // E.g. [4, 11, 15] becomes 4bf.\r\n          for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n          // Add leading zeros, decimal point and trailing zeros as required.\r\n          str = toFixedPoint(str, e, alphabet.charAt(0));\r\n        }\r\n\r\n        // The caller will add the sign.\r\n        return str;\r\n      };\r\n    })();\r\n\r\n\r\n    // Perform division in the specified base. Called by div and convertBase.\r\n    div = (function () {\r\n\r\n      // Assume non-zero x and k.\r\n      function multiply(x, k, base) {\r\n        var m, temp, xlo, xhi,\r\n          carry = 0,\r\n          i = x.length,\r\n          klo = k % SQRT_BASE,\r\n          khi = k / SQRT_BASE | 0;\r\n\r\n        for (x = x.slice(); i--;) {\r\n          xlo = x[i] % SQRT_BASE;\r\n          xhi = x[i] / SQRT_BASE | 0;\r\n          m = khi * xlo + xhi * klo;\r\n          temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n          carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n          x[i] = temp % base;\r\n        }\r\n\r\n        if (carry) x = [carry].concat(x);\r\n\r\n        return x;\r\n      }\r\n\r\n      function compare(a, b, aL, bL) {\r\n        var i, cmp;\r\n\r\n        if (aL != bL) {\r\n          cmp = aL > bL ? 1 : -1;\r\n        } else {\r\n\r\n          for (i = cmp = 0; i < aL; i++) {\r\n\r\n            if (a[i] != b[i]) {\r\n              cmp = a[i] > b[i] ? 1 : -1;\r\n              break;\r\n            }\r\n          }\r\n        }\r\n\r\n        return cmp;\r\n      }\r\n\r\n      function subtract(a, b, aL, base) {\r\n        var i = 0;\r\n\r\n        // Subtract b from a.\r\n        for (; aL--;) {\r\n          a[aL] -= i;\r\n          i = a[aL] < b[aL] ? 1 : 0;\r\n          a[aL] = i * base + a[aL] - b[aL];\r\n        }\r\n\r\n        // Remove leading zeros.\r\n        for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n      }\r\n\r\n      // x: dividend, y: divisor.\r\n      return function (x, y, dp, rm, base) {\r\n        var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n          yL, yz,\r\n          s = x.s == y.s ? 1 : -1,\r\n          xc = x.c,\r\n          yc = y.c;\r\n\r\n        // Either NaN, Infinity or 0?\r\n        if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n          return new BigNumber(\r\n\r\n           // Return NaN if either NaN, or both Infinity or 0.\r\n           !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n            // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n            xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n         );\r\n        }\r\n\r\n        q = new BigNumber(s);\r\n        qc = q.c = [];\r\n        e = x.e - y.e;\r\n        s = dp + e + 1;\r\n\r\n        if (!base) {\r\n          base = BASE;\r\n          e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n          s = s / LOG_BASE | 0;\r\n        }\r\n\r\n        // Result exponent may be one less then the current value of e.\r\n        // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n        for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n        if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n        if (s < 0) {\r\n          qc.push(1);\r\n          more = true;\r\n        } else {\r\n          xL = xc.length;\r\n          yL = yc.length;\r\n          i = 0;\r\n          s += 2;\r\n\r\n          // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n          n = mathfloor(base / (yc[0] + 1));\r\n\r\n          // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n          // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n          if (n > 1) {\r\n            yc = multiply(yc, n, base);\r\n            xc = multiply(xc, n, base);\r\n            yL = yc.length;\r\n            xL = xc.length;\r\n          }\r\n\r\n          xi = yL;\r\n          rem = xc.slice(0, yL);\r\n          remL = rem.length;\r\n\r\n          // Add zeros to make remainder as long as divisor.\r\n          for (; remL < yL; rem[remL++] = 0);\r\n          yz = yc.slice();\r\n          yz = [0].concat(yz);\r\n          yc0 = yc[0];\r\n          if (yc[1] >= base / 2) yc0++;\r\n          // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n          // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n          do {\r\n            n = 0;\r\n\r\n            // Compare divisor and remainder.\r\n            cmp = compare(yc, rem, yL, remL);\r\n\r\n            // If divisor < remainder.\r\n            if (cmp < 0) {\r\n\r\n              // Calculate trial digit, n.\r\n\r\n              rem0 = rem[0];\r\n              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n              // n is how many times the divisor goes into the current remainder.\r\n              n = mathfloor(rem0 / yc0);\r\n\r\n              //  Algorithm:\r\n              //  product = divisor multiplied by trial digit (n).\r\n              //  Compare product and remainder.\r\n              //  If product is greater than remainder:\r\n              //    Subtract divisor from product, decrement trial digit.\r\n              //  Subtract product from remainder.\r\n              //  If product was less than remainder at the last compare:\r\n              //    Compare new remainder and divisor.\r\n              //    If remainder is greater than divisor:\r\n              //      Subtract divisor from remainder, increment trial digit.\r\n\r\n              if (n > 1) {\r\n\r\n                // n may be > base only when base is 3.\r\n                if (n >= base) n = base - 1;\r\n\r\n                // product = divisor * trial digit.\r\n                prod = multiply(yc, n, base);\r\n                prodL = prod.length;\r\n                remL = rem.length;\r\n\r\n                // Compare product and remainder.\r\n                // If product > remainder then trial digit n too high.\r\n                // n is 1 too high about 5% of the time, and is not known to have\r\n                // ever been more than 1 too high.\r\n                while (compare(prod, rem, prodL, remL) == 1) {\r\n                  n--;\r\n\r\n                  // Subtract divisor from product.\r\n                  subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n                  prodL = prod.length;\r\n                  cmp = 1;\r\n                }\r\n              } else {\r\n\r\n                // n is 0 or 1, cmp is -1.\r\n                // If n is 0, there is no need to compare yc and rem again below,\r\n                // so change cmp to 1 to avoid it.\r\n                // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n                if (n == 0) {\r\n\r\n                  // divisor < remainder, so n must be at least 1.\r\n                  cmp = n = 1;\r\n                }\r\n\r\n                // product = divisor\r\n                prod = yc.slice();\r\n                prodL = prod.length;\r\n              }\r\n\r\n              if (prodL < remL) prod = [0].concat(prod);\r\n\r\n              // Subtract product from remainder.\r\n              subtract(rem, prod, remL, base);\r\n              remL = rem.length;\r\n\r\n               // If product was < remainder.\r\n              if (cmp == -1) {\r\n\r\n                // Compare divisor and new remainder.\r\n                // If divisor < new remainder, subtract divisor from remainder.\r\n                // Trial digit n too low.\r\n                // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n                while (compare(yc, rem, yL, remL) < 1) {\r\n                  n++;\r\n\r\n                  // Subtract divisor from remainder.\r\n                  subtract(rem, yL < remL ? yz : yc, remL, base);\r\n                  remL = rem.length;\r\n                }\r\n              }\r\n            } else if (cmp === 0) {\r\n              n++;\r\n              rem = [0];\r\n            } // else cmp === 1 and n will be 0\r\n\r\n            // Add the next digit, n, to the result array.\r\n            qc[i++] = n;\r\n\r\n            // Update the remainder.\r\n            if (rem[0]) {\r\n              rem[remL++] = xc[xi] || 0;\r\n            } else {\r\n              rem = [xc[xi]];\r\n              remL = 1;\r\n            }\r\n          } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n          more = rem[0] != null;\r\n\r\n          // Leading zero?\r\n          if (!qc[0]) qc.splice(0, 1);\r\n        }\r\n\r\n        if (base == BASE) {\r\n\r\n          // To calculate q.e, first get the number of digits of qc[0].\r\n          for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n          round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n        // Caller is convertBase.\r\n        } else {\r\n          q.e = e;\r\n          q.r = +more;\r\n        }\r\n\r\n        return q;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n     * notation rounded to the specified decimal places or significant digits.\r\n     *\r\n     * n: a BigNumber.\r\n     * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n     * rm: the rounding mode.\r\n     * id: 1 (toExponential) or 2 (toPrecision).\r\n     */\r\n    function format(n, i, rm, id) {\r\n      var c0, e, ne, len, str;\r\n\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      if (!n.c) return n.toString();\r\n\r\n      c0 = n.c[0];\r\n      ne = n.e;\r\n\r\n      if (i == null) {\r\n        str = coeffToString(n.c);\r\n        str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r\n         ? toExponential(str, ne)\r\n         : toFixedPoint(str, ne, '0');\r\n      } else {\r\n        n = round(new BigNumber(n), i, rm);\r\n\r\n        // n.e may have changed if the value was rounded up.\r\n        e = n.e;\r\n\r\n        str = coeffToString(n.c);\r\n        len = str.length;\r\n\r\n        // toPrecision returns exponential notation if the number of significant digits\r\n        // specified is less than the number of digits necessary to represent the integer\r\n        // part of the value in fixed-point notation.\r\n\r\n        // Exponential notation.\r\n        if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n          // Append zeros?\r\n          for (; len < i; str += '0', len++);\r\n          str = toExponential(str, e);\r\n\r\n        // Fixed-point notation.\r\n        } else {\r\n          i -= ne;\r\n          str = toFixedPoint(str, e, '0');\r\n\r\n          // Append zeros?\r\n          if (e + 1 > len) {\r\n            if (--i > 0) for (str += '.'; i--; str += '0');\r\n          } else {\r\n            i += e - len;\r\n            if (i > 0) {\r\n              if (e + 1 == len) str += '.';\r\n              for (; i--; str += '0');\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return n.s < 0 && c0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // Handle BigNumber.max and BigNumber.min.\r\n    function maxOrMin(args, method) {\r\n      var n,\r\n        i = 1,\r\n        m = new BigNumber(args[0]);\r\n\r\n      for (; i < args.length; i++) {\r\n        n = new BigNumber(args[i]);\r\n\r\n        // If any number is NaN, return NaN.\r\n        if (!n.s) {\r\n          m = n;\r\n          break;\r\n        } else if (method.call(m, n)) {\r\n          m = n;\r\n        }\r\n      }\r\n\r\n      return m;\r\n    }\r\n\r\n\r\n    /*\r\n     * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n     * Called by minus, plus and times.\r\n     */\r\n    function normalise(n, c, e) {\r\n      var i = 1,\r\n        j = c.length;\r\n\r\n       // Remove trailing zeros.\r\n      for (; !c[--j]; c.pop());\r\n\r\n      // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n      for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n      // Overflow?\r\n      if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n        // Infinity.\r\n        n.c = n.e = null;\r\n\r\n      // Underflow?\r\n      } else if (e < MIN_EXP) {\r\n\r\n        // Zero.\r\n        n.c = [n.e = 0];\r\n      } else {\r\n        n.e = e;\r\n        n.c = c;\r\n      }\r\n\r\n      return n;\r\n    }\r\n\r\n\r\n    // Handle values that fail the validity test in BigNumber.\r\n    parseNumeric = (function () {\r\n      var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n        dotAfter = /^([^.]+)\\.$/,\r\n        dotBefore = /^\\.([^.]+)$/,\r\n        isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n        whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n      return function (x, str, isNum, b) {\r\n        var base,\r\n          s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n        // No exception on ±Infinity or NaN.\r\n        if (isInfinityOrNaN.test(s)) {\r\n          x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n        } else {\r\n          if (!isNum) {\r\n\r\n            // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n            s = s.replace(basePrefix, function (m, p1, p2) {\r\n              base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n              return !b || b == base ? p1 : m;\r\n            });\r\n\r\n            if (b) {\r\n              base = b;\r\n\r\n              // E.g. '1.' to '1', '.1' to '0.1'\r\n              s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n            }\r\n\r\n            if (str != s) return new BigNumber(s, base);\r\n          }\r\n\r\n          // '[BigNumber Error] Not a number: {n}'\r\n          // '[BigNumber Error] Not a base {b} number: {n}'\r\n          if (BigNumber.DEBUG) {\r\n            throw Error\r\n              (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n          }\r\n\r\n          // NaN\r\n          x.s = null;\r\n        }\r\n\r\n        x.c = x.e = null;\r\n      }\r\n    })();\r\n\r\n\r\n    /*\r\n     * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n     * If r is truthy, it is known that there are more digits after the rounding digit.\r\n     */\r\n    function round(x, sd, rm, r) {\r\n      var d, i, j, k, n, ni, rd,\r\n        xc = x.c,\r\n        pows10 = POWS_TEN;\r\n\r\n      // if x is not Infinity or NaN...\r\n      if (xc) {\r\n\r\n        // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n        // ni is the index of n within x.c.\r\n        // d is the number of digits of n.\r\n        // i is the index of rd within n including leading zeros.\r\n        // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n        out: {\r\n\r\n          // Get the number of digits of the first element of xc.\r\n          for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n          i = sd - d;\r\n\r\n          // If the rounding digit is in the first element of xc...\r\n          if (i < 0) {\r\n            i += LOG_BASE;\r\n            j = sd;\r\n            n = xc[ni = 0];\r\n\r\n            // Get the rounding digit at index j of n.\r\n            rd = n / pows10[d - j - 1] % 10 | 0;\r\n          } else {\r\n            ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n            if (ni >= xc.length) {\r\n\r\n              if (r) {\r\n\r\n                // Needed by sqrt.\r\n                for (; xc.length <= ni; xc.push(0));\r\n                n = rd = 0;\r\n                d = 1;\r\n                i %= LOG_BASE;\r\n                j = i - LOG_BASE + 1;\r\n              } else {\r\n                break out;\r\n              }\r\n            } else {\r\n              n = k = xc[ni];\r\n\r\n              // Get the number of digits of n.\r\n              for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n              // Get the index of rd within n.\r\n              i %= LOG_BASE;\r\n\r\n              // Get the index of rd within n, adjusted for leading zeros.\r\n              // The number of leading zeros of n is given by LOG_BASE - d.\r\n              j = i - LOG_BASE + d;\r\n\r\n              // Get the rounding digit at index j of n.\r\n              rd = j < 0 ? 0 : n / pows10[d - j - 1] % 10 | 0;\r\n            }\r\n          }\r\n\r\n          r = r || sd < 0 ||\r\n\r\n          // Are there any non-zero digits after the rounding digit?\r\n          // The expression  n % pows10[d - j - 1]  returns all digits of n to the right\r\n          // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n           xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n          r = rm < 4\r\n           ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n           : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n            // Check whether the digit to the left of the rounding digit is odd.\r\n            ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n             rm == (x.s < 0 ? 8 : 7));\r\n\r\n          if (sd < 1 || !xc[0]) {\r\n            xc.length = 0;\r\n\r\n            if (r) {\r\n\r\n              // Convert sd to decimal places.\r\n              sd -= x.e + 1;\r\n\r\n              // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n              xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n              x.e = -sd || 0;\r\n            } else {\r\n\r\n              // Zero.\r\n              xc[0] = x.e = 0;\r\n            }\r\n\r\n            return x;\r\n          }\r\n\r\n          // Remove excess digits.\r\n          if (i == 0) {\r\n            xc.length = ni;\r\n            k = 1;\r\n            ni--;\r\n          } else {\r\n            xc.length = ni + 1;\r\n            k = pows10[LOG_BASE - i];\r\n\r\n            // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n            // j > 0 means i > number of leading zeros of n.\r\n            xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n          }\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            for (; ;) {\r\n\r\n              // If the digit to be rounded up is in the first element of xc...\r\n              if (ni == 0) {\r\n\r\n                // i will be the length of xc[0] before k is added.\r\n                for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n                j = xc[0] += k;\r\n                for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n                // if i != k the length has increased.\r\n                if (i != k) {\r\n                  x.e++;\r\n                  if (xc[0] == BASE) xc[0] = 1;\r\n                }\r\n\r\n                break;\r\n              } else {\r\n                xc[ni] += k;\r\n                if (xc[ni] != BASE) break;\r\n                xc[ni--] = 0;\r\n                k = 1;\r\n              }\r\n            }\r\n          }\r\n\r\n          // Remove trailing zeros.\r\n          for (i = xc.length; xc[--i] === 0; xc.pop());\r\n        }\r\n\r\n        // Overflow? Infinity.\r\n        if (x.e > MAX_EXP) {\r\n          x.c = x.e = null;\r\n\r\n        // Underflow? Zero.\r\n        } else if (x.e < MIN_EXP) {\r\n          x.c = [x.e = 0];\r\n        }\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n\r\n    function valueOf(n) {\r\n      var str,\r\n        e = n.e;\r\n\r\n      if (e === null) return n.toString();\r\n\r\n      str = coeffToString(n.c);\r\n\r\n      str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n        ? toExponential(str, e)\r\n        : toFixedPoint(str, e, '0');\r\n\r\n      return n.s < 0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n     */\r\n    P.absoluteValue = P.abs = function () {\r\n      var x = new BigNumber(this);\r\n      if (x.s < 0) x.s = 1;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return\r\n     *   1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     *   -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     *   0 if they have the same value,\r\n     *   or null if the value of either is NaN.\r\n     */\r\n    P.comparedTo = function (y, b) {\r\n      return compare(this, new BigNumber(y, b));\r\n    };\r\n\r\n\r\n    /*\r\n     * If dp is undefined or null or true or false, return the number of decimal places of the\r\n     * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     *\r\n     * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.decimalPlaces = P.dp = function (dp, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), dp + x.e + 1, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last number.\r\n      if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n      if (n < 0) n = 0;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n / 0 = I\r\n     *  n / N = N\r\n     *  n / I = 0\r\n     *  0 / n = 0\r\n     *  0 / 0 = N\r\n     *  0 / N = N\r\n     *  0 / I = 0\r\n     *  N / n = N\r\n     *  N / 0 = N\r\n     *  N / N = N\r\n     *  N / I = N\r\n     *  I / n = I\r\n     *  I / 0 = I\r\n     *  I / N = N\r\n     *  I / I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n     * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.dividedBy = P.div = function (y, b) {\r\n      return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n     * BigNumber by the value of BigNumber(y, b).\r\n     */\r\n    P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n      return div(this, new BigNumber(y, b), 0, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n     *\r\n     * If m is present, return the result modulo m.\r\n     * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n     *\r\n     * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n     * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n     *\r\n     * n {number|string|BigNumber} The exponent. An integer.\r\n     * [m] {number|string|BigNumber} The modulus.\r\n     *\r\n     * '[BigNumber Error] Exponent not an integer: {n}'\r\n     */\r\n    P.exponentiatedBy = P.pow = function (n, m) {\r\n      var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n        x = this;\r\n\r\n      n = new BigNumber(n);\r\n\r\n      // Allow NaN and ±Infinity, but not other non-integers.\r\n      if (n.c && !n.isInteger()) {\r\n        throw Error\r\n          (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n      }\r\n\r\n      if (m != null) m = new BigNumber(m);\r\n\r\n      // Exponent of MAX_SAFE_INTEGER is 15.\r\n      nIsBig = n.e > 14;\r\n\r\n      // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n      if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n        // The sign of the result of pow when x is negative depends on the evenness of n.\r\n        // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n        y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? 2 - isOdd(n) : +valueOf(n)));\r\n        return m ? y.mod(m) : y;\r\n      }\r\n\r\n      nIsNeg = n.s < 0;\r\n\r\n      if (m) {\r\n\r\n        // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n        if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n        isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n        if (isModExp) x = x.mod(m);\r\n\r\n      // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n      // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n      } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n        // [1, 240000000]\r\n        ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n        // [80000000000000]  [99999750000000]\r\n        : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n        // If x is negative and n is odd, k = -0, else k = 0.\r\n        k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n        // If x >= 1, k = ±Infinity.\r\n        if (x.e > -1) k = 1 / k;\r\n\r\n        // If n is negative return ±0, else return ±Infinity.\r\n        return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n      } else if (POW_PRECISION) {\r\n\r\n        // Truncating each coefficient array to a length of k after each multiplication\r\n        // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n        // i.e. there will be a minimum of 28 guard digits retained.\r\n        k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n      }\r\n\r\n      if (nIsBig) {\r\n        half = new BigNumber(0.5);\r\n        if (nIsNeg) n.s = 1;\r\n        nIsOdd = isOdd(n);\r\n      } else {\r\n        i = Math.abs(+valueOf(n));\r\n        nIsOdd = i % 2;\r\n      }\r\n\r\n      y = new BigNumber(ONE);\r\n\r\n      // Performs 54 loop iterations for n of 9007199254740991.\r\n      for (; ;) {\r\n\r\n        if (nIsOdd) {\r\n          y = y.times(x);\r\n          if (!y.c) break;\r\n\r\n          if (k) {\r\n            if (y.c.length > k) y.c.length = k;\r\n          } else if (isModExp) {\r\n            y = y.mod(m);    //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n          }\r\n        }\r\n\r\n        if (i) {\r\n          i = mathfloor(i / 2);\r\n          if (i === 0) break;\r\n          nIsOdd = i % 2;\r\n        } else {\r\n          n = n.times(half);\r\n          round(n, n.e + 1, 1);\r\n\r\n          if (n.e > 14) {\r\n            nIsOdd = isOdd(n);\r\n          } else {\r\n            i = +valueOf(n);\r\n            if (i === 0) break;\r\n            nIsOdd = i % 2;\r\n          }\r\n        }\r\n\r\n        x = x.times(x);\r\n\r\n        if (k) {\r\n          if (x.c && x.c.length > k) x.c.length = k;\r\n        } else if (isModExp) {\r\n          x = x.mod(m);    //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n        }\r\n      }\r\n\r\n      if (isModExp) return y;\r\n      if (nIsNeg) y = ONE.div(y);\r\n\r\n      return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n     * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n     */\r\n    P.integerValue = function (rm) {\r\n      var n = new BigNumber(this);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n      return round(n, n.e + 1, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isEqualTo = P.eq = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n     */\r\n    P.isFinite = function () {\r\n      return !!this.c;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isGreaterThan = P.gt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n     */\r\n    P.isInteger = function () {\r\n      return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isLessThan = P.lt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n     */\r\n    P.isNaN = function () {\r\n      return !this.s;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is negative, otherwise return false.\r\n     */\r\n    P.isNegative = function () {\r\n      return this.s < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is positive, otherwise return false.\r\n     */\r\n    P.isPositive = function () {\r\n      return this.s > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n     */\r\n    P.isZero = function () {\r\n      return !!this.c && this.c[0] == 0;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n - 0 = n\r\n     *  n - N = N\r\n     *  n - I = -I\r\n     *  0 - n = -n\r\n     *  0 - 0 = 0\r\n     *  0 - N = N\r\n     *  0 - I = -I\r\n     *  N - n = N\r\n     *  N - 0 = N\r\n     *  N - N = N\r\n     *  N - I = N\r\n     *  I - n = I\r\n     *  I - 0 = I\r\n     *  I - N = N\r\n     *  I - I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.minus = function (y, b) {\r\n      var i, j, t, xLTy,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n      if (a != b) {\r\n        y.s = -b;\r\n        return x.plus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Either Infinity?\r\n        if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n        // Either zero?\r\n        if (!xc[0] || !yc[0]) {\r\n\r\n          // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n          return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n           ROUNDING_MODE == 3 ? -0 : 0);\r\n        }\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Determine which is the bigger number.\r\n      if (a = xe - ye) {\r\n\r\n        if (xLTy = a < 0) {\r\n          a = -a;\r\n          t = xc;\r\n        } else {\r\n          ye = xe;\r\n          t = yc;\r\n        }\r\n\r\n        t.reverse();\r\n\r\n        // Prepend zeros to equalise exponents.\r\n        for (b = a; b--; t.push(0));\r\n        t.reverse();\r\n      } else {\r\n\r\n        // Exponents equal. Check digit by digit.\r\n        j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n        for (a = b = 0; b < j; b++) {\r\n\r\n          if (xc[b] != yc[b]) {\r\n            xLTy = xc[b] < yc[b];\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      // x < y? Point xc to the array of the bigger number.\r\n      if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s;\r\n\r\n      b = (j = yc.length) - (i = xc.length);\r\n\r\n      // Append zeros to xc if shorter.\r\n      // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n      if (b > 0) for (; b--; xc[i++] = 0);\r\n      b = BASE - 1;\r\n\r\n      // Subtract yc from xc.\r\n      for (; j > a;) {\r\n\r\n        if (xc[--j] < yc[j]) {\r\n          for (i = j; i && !xc[--i]; xc[i] = b);\r\n          --xc[i];\r\n          xc[j] += BASE;\r\n        }\r\n\r\n        xc[j] -= yc[j];\r\n      }\r\n\r\n      // Remove leading zeros and adjust exponent accordingly.\r\n      for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n      // Zero?\r\n      if (!xc[0]) {\r\n\r\n        // Following IEEE 754 (2008) 6.3,\r\n        // n - n = +0  but  n - n = -0  when rounding towards -Infinity.\r\n        y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n        y.c = [y.e = 0];\r\n        return y;\r\n      }\r\n\r\n      // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n      // for finite x and y.\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     *   n % 0 =  N\r\n     *   n % N =  N\r\n     *   n % I =  n\r\n     *   0 % n =  0\r\n     *  -0 % n = -0\r\n     *   0 % 0 =  N\r\n     *   0 % N =  N\r\n     *   0 % I =  0\r\n     *   N % n =  N\r\n     *   N % 0 =  N\r\n     *   N % N =  N\r\n     *   N % I =  N\r\n     *   I % n =  N\r\n     *   I % 0 =  N\r\n     *   I % N =  N\r\n     *   I % I =  N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n     * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n     */\r\n    P.modulo = P.mod = function (y, b) {\r\n      var q, s,\r\n        x = this;\r\n\r\n      y = new BigNumber(y, b);\r\n\r\n      // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n      if (!x.c || !y.s || y.c && !y.c[0]) {\r\n        return new BigNumber(NaN);\r\n\r\n      // Return x if y is Infinity or x is zero.\r\n      } else if (!y.c || x.c && !x.c[0]) {\r\n        return new BigNumber(x);\r\n      }\r\n\r\n      if (MODULO_MODE == 9) {\r\n\r\n        // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n        // r = x - qy    where  0 <= r < abs(y)\r\n        s = y.s;\r\n        y.s = 1;\r\n        q = div(x, y, 0, 3);\r\n        y.s = s;\r\n        q.s *= s;\r\n      } else {\r\n        q = div(x, y, 0, MODULO_MODE);\r\n      }\r\n\r\n      y = x.minus(q.times(y));\r\n\r\n      // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n      if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n      return y;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n * 0 = 0\r\n     *  n * N = N\r\n     *  n * I = I\r\n     *  0 * n = 0\r\n     *  0 * 0 = 0\r\n     *  0 * N = N\r\n     *  0 * I = N\r\n     *  N * n = N\r\n     *  N * 0 = N\r\n     *  N * N = N\r\n     *  N * I = N\r\n     *  I * n = I\r\n     *  I * 0 = N\r\n     *  I * N = N\r\n     *  I * I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n     * of BigNumber(y, b).\r\n     */\r\n    P.multipliedBy = P.times = function (y, b) {\r\n      var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n        base, sqrtBase,\r\n        x = this,\r\n        xc = x.c,\r\n        yc = (y = new BigNumber(y, b)).c;\r\n\r\n      // Either NaN, ±Infinity or ±0?\r\n      if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n        // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n        if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n          y.c = y.e = y.s = null;\r\n        } else {\r\n          y.s *= x.s;\r\n\r\n          // Return ±Infinity if either is ±Infinity.\r\n          if (!xc || !yc) {\r\n            y.c = y.e = null;\r\n\r\n          // Return ±0 if either is ±0.\r\n          } else {\r\n            y.c = [0];\r\n            y.e = 0;\r\n          }\r\n        }\r\n\r\n        return y;\r\n      }\r\n\r\n      e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n      y.s *= x.s;\r\n      xcL = xc.length;\r\n      ycL = yc.length;\r\n\r\n      // Ensure xc points to longer array and xcL to its length.\r\n      if (xcL < ycL) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i;\r\n\r\n      // Initialise the result array with zeros.\r\n      for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n      base = BASE;\r\n      sqrtBase = SQRT_BASE;\r\n\r\n      for (i = ycL; --i >= 0;) {\r\n        c = 0;\r\n        ylo = yc[i] % sqrtBase;\r\n        yhi = yc[i] / sqrtBase | 0;\r\n\r\n        for (k = xcL, j = i + k; j > i;) {\r\n          xlo = xc[--k] % sqrtBase;\r\n          xhi = xc[k] / sqrtBase | 0;\r\n          m = yhi * xlo + xhi * ylo;\r\n          xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n          c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n          zc[j--] = xlo % base;\r\n        }\r\n\r\n        zc[j] = c;\r\n      }\r\n\r\n      if (c) {\r\n        ++e;\r\n      } else {\r\n        zc.splice(0, 1);\r\n      }\r\n\r\n      return normalise(y, zc, e);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n     * i.e. multiplied by -1.\r\n     */\r\n    P.negated = function () {\r\n      var x = new BigNumber(this);\r\n      x.s = -x.s || null;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n + 0 = n\r\n     *  n + N = N\r\n     *  n + I = I\r\n     *  0 + n = n\r\n     *  0 + 0 = 0\r\n     *  0 + N = N\r\n     *  0 + I = I\r\n     *  N + n = N\r\n     *  N + 0 = N\r\n     *  N + N = N\r\n     *  N + I = N\r\n     *  I + n = I\r\n     *  I + 0 = I\r\n     *  I + N = N\r\n     *  I + I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.plus = function (y, b) {\r\n      var t,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n       if (a != b) {\r\n        y.s = -b;\r\n        return x.minus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Return ±Infinity if either ±Infinity.\r\n        if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n        // Either zero?\r\n        // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n        if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n      if (a = xe - ye) {\r\n        if (a > 0) {\r\n          ye = xe;\r\n          t = yc;\r\n        } else {\r\n          a = -a;\r\n          t = xc;\r\n        }\r\n\r\n        t.reverse();\r\n        for (; a--; t.push(0));\r\n        t.reverse();\r\n      }\r\n\r\n      a = xc.length;\r\n      b = yc.length;\r\n\r\n      // Point xc to the longer array, and b to the shorter length.\r\n      if (a - b < 0) t = yc, yc = xc, xc = t, b = a;\r\n\r\n      // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n      for (a = 0; b;) {\r\n        a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n        xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n      }\r\n\r\n      if (a) {\r\n        xc = [a].concat(xc);\r\n        ++ye;\r\n      }\r\n\r\n      // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n      // ye = MAX_EXP + 1 possible\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     * If sd is undefined or null or true or false, return the number of significant digits of\r\n     * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     * If sd is true include integer-part trailing zeros in the count.\r\n     *\r\n     * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n     *                     boolean: whether to count integer-part trailing zeros: true or false.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.precision = P.sd = function (sd, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (sd != null && sd !== !!sd) {\r\n        intCheck(sd, 1, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), sd, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      v = c.length - 1;\r\n      n = v * LOG_BASE + 1;\r\n\r\n      if (v = c[v]) {\r\n\r\n        // Subtract the number of trailing zeros of the last element.\r\n        for (; v % 10 == 0; v /= 10, n--);\r\n\r\n        // Add the number of digits of the first element.\r\n        for (v = c[0]; v >= 10; v /= 10, n++);\r\n      }\r\n\r\n      if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n     * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n     *\r\n     * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n     */\r\n    P.shiftedBy = function (k) {\r\n      intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n      return this.times('1e' + k);\r\n    };\r\n\r\n\r\n    /*\r\n     *  sqrt(-n) =  N\r\n     *  sqrt(N) =  N\r\n     *  sqrt(-I) =  N\r\n     *  sqrt(I) =  I\r\n     *  sqrt(0) =  0\r\n     *  sqrt(-0) = -0\r\n     *\r\n     * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n     * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.squareRoot = P.sqrt = function () {\r\n      var m, n, r, rep, t,\r\n        x = this,\r\n        c = x.c,\r\n        s = x.s,\r\n        e = x.e,\r\n        dp = DECIMAL_PLACES + 4,\r\n        half = new BigNumber('0.5');\r\n\r\n      // Negative/NaN/Infinity/zero?\r\n      if (s !== 1 || !c || !c[0]) {\r\n        return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n      }\r\n\r\n      // Initial estimate.\r\n      s = Math.sqrt(+valueOf(x));\r\n\r\n      // Math.sqrt underflow/overflow?\r\n      // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n      if (s == 0 || s == 1 / 0) {\r\n        n = coeffToString(c);\r\n        if ((n.length + e) % 2 == 0) n += '0';\r\n        s = Math.sqrt(+n);\r\n        e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n        if (s == 1 / 0) {\r\n          n = '1e' + e;\r\n        } else {\r\n          n = s.toExponential();\r\n          n = n.slice(0, n.indexOf('e') + 1) + e;\r\n        }\r\n\r\n        r = new BigNumber(n);\r\n      } else {\r\n        r = new BigNumber(s + '');\r\n      }\r\n\r\n      // Check for zero.\r\n      // r could be zero if MIN_EXP is changed after the this value was created.\r\n      // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n      // coeffToString to throw.\r\n      if (r.c[0]) {\r\n        e = r.e;\r\n        s = e + dp;\r\n        if (s < 3) s = 0;\r\n\r\n        // Newton-Raphson iteration.\r\n        for (; ;) {\r\n          t = r;\r\n          r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n          if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n            // The exponent of r may here be one less than the final result exponent,\r\n            // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n            // are indexed correctly.\r\n            if (r.e < e) --s;\r\n            n = n.slice(s - 3, s + 1);\r\n\r\n            // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n            // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n            // iteration.\r\n            if (n == '9999' || !rep && n == '4999') {\r\n\r\n              // On the first iteration only, check to see if rounding up gives the\r\n              // exact result as the nines may infinitely repeat.\r\n              if (!rep) {\r\n                round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n                if (t.times(t).eq(x)) {\r\n                  r = t;\r\n                  break;\r\n                }\r\n              }\r\n\r\n              dp += 4;\r\n              s += 4;\r\n              rep = 1;\r\n            } else {\r\n\r\n              // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n              // result. If not, then there are further digits and m will be truthy.\r\n              if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n                // Truncate to the first rounding digit.\r\n                round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n                m = !r.times(r).eq(x);\r\n              }\r\n\r\n              break;\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in exponential notation and\r\n     * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toExponential = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp++;\r\n      }\r\n      return format(this, dp, rm, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n     * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n     * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toFixed = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp = dp + this.e + 1;\r\n      }\r\n      return format(this, dp, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n     * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n     * of the format or FORMAT object (see BigNumber.set).\r\n     *\r\n     * The formatting object may contain some or all of the properties shown below.\r\n     *\r\n     * FORMAT = {\r\n     *   prefix: '',\r\n     *   groupSize: 3,\r\n     *   secondaryGroupSize: 0,\r\n     *   groupSeparator: ',',\r\n     *   decimalSeparator: '.',\r\n     *   fractionGroupSize: 0,\r\n     *   fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n     *   suffix: ''\r\n     * };\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     * [format] {object} Formatting options. See FORMAT pbject above.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     * '[BigNumber Error] Argument not an object: {format}'\r\n     */\r\n    P.toFormat = function (dp, rm, format) {\r\n      var str,\r\n        x = this;\r\n\r\n      if (format == null) {\r\n        if (dp != null && rm && typeof rm == 'object') {\r\n          format = rm;\r\n          rm = null;\r\n        } else if (dp && typeof dp == 'object') {\r\n          format = dp;\r\n          dp = rm = null;\r\n        } else {\r\n          format = FORMAT;\r\n        }\r\n      } else if (typeof format != 'object') {\r\n        throw Error\r\n          (bignumberError + 'Argument not an object: ' + format);\r\n      }\r\n\r\n      str = x.toFixed(dp, rm);\r\n\r\n      if (x.c) {\r\n        var i,\r\n          arr = str.split('.'),\r\n          g1 = +format.groupSize,\r\n          g2 = +format.secondaryGroupSize,\r\n          groupSeparator = format.groupSeparator || '',\r\n          intPart = arr[0],\r\n          fractionPart = arr[1],\r\n          isNeg = x.s < 0,\r\n          intDigits = isNeg ? intPart.slice(1) : intPart,\r\n          len = intDigits.length;\r\n\r\n        if (g2) i = g1, g1 = g2, g2 = i, len -= i;\r\n\r\n        if (g1 > 0 && len > 0) {\r\n          i = len % g1 || g1;\r\n          intPart = intDigits.substr(0, i);\r\n          for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n          if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n          if (isNeg) intPart = '-' + intPart;\r\n        }\r\n\r\n        str = fractionPart\r\n         ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r\n          ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n           '$&' + (format.fractionGroupSeparator || ''))\r\n          : fractionPart)\r\n         : intPart;\r\n      }\r\n\r\n      return (format.prefix || '') + str + (format.suffix || '');\r\n    };\r\n\r\n\r\n    /*\r\n     * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n     * fraction with an integer numerator and an integer denominator.\r\n     * The denominator will be a positive non-zero value less than or equal to the specified\r\n     * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n     * the lowest value necessary to represent the number exactly.\r\n     *\r\n     * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n     *\r\n     * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n     */\r\n    P.toFraction = function (md) {\r\n      var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n        x = this,\r\n        xc = x.c;\r\n\r\n      if (md != null) {\r\n        n = new BigNumber(md);\r\n\r\n        // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n        if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n          throw Error\r\n            (bignumberError + 'Argument ' +\r\n              (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n        }\r\n      }\r\n\r\n      if (!xc) return new BigNumber(x);\r\n\r\n      d = new BigNumber(ONE);\r\n      n1 = d0 = new BigNumber(ONE);\r\n      d1 = n0 = new BigNumber(ONE);\r\n      s = coeffToString(xc);\r\n\r\n      // Determine initial denominator.\r\n      // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n      e = d.e = s.length - x.e - 1;\r\n      d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n      md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n      exp = MAX_EXP;\r\n      MAX_EXP = 1 / 0;\r\n      n = new BigNumber(s);\r\n\r\n      // n0 = d1 = 0\r\n      n0.c[0] = 0;\r\n\r\n      for (; ;)  {\r\n        q = div(n, d, 0, 1);\r\n        d2 = d0.plus(q.times(d1));\r\n        if (d2.comparedTo(md) == 1) break;\r\n        d0 = d1;\r\n        d1 = d2;\r\n        n1 = n0.plus(q.times(d2 = n1));\r\n        n0 = d2;\r\n        d = n.minus(q.times(d2 = d));\r\n        n = d2;\r\n      }\r\n\r\n      d2 = div(md.minus(d0), d1, 0, 1);\r\n      n0 = n0.plus(d2.times(n1));\r\n      d0 = d0.plus(d2.times(d1));\r\n      n0.s = n1.s = x.s;\r\n      e = e * 2;\r\n\r\n      // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n      r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n          div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n      MAX_EXP = exp;\r\n\r\n      return r;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return the value of this BigNumber converted to a number primitive.\r\n     */\r\n    P.toNumber = function () {\r\n      return +valueOf(this);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n     * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n     * necessary to represent the integer part of the value in fixed-point notation, then use\r\n     * exponential notation.\r\n     *\r\n     * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.toPrecision = function (sd, rm) {\r\n      if (sd != null) intCheck(sd, 1, MAX);\r\n      return format(this, sd, rm, 2);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n     * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n     * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n     * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n     * TO_EXP_NEG, return exponential notation.\r\n     *\r\n     * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n     *\r\n     * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n     */\r\n    P.toString = function (b) {\r\n      var str,\r\n        n = this,\r\n        s = n.s,\r\n        e = n.e;\r\n\r\n      // Infinity or NaN?\r\n      if (e === null) {\r\n        if (s) {\r\n          str = 'Infinity';\r\n          if (s < 0) str = '-' + str;\r\n        } else {\r\n          str = 'NaN';\r\n        }\r\n      } else {\r\n        if (b == null) {\r\n          str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n           ? toExponential(coeffToString(n.c), e)\r\n           : toFixedPoint(coeffToString(n.c), e, '0');\r\n        } else if (b === 10) {\r\n          n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n          str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n        } else {\r\n          intCheck(b, 2, ALPHABET.length, 'Base');\r\n          str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n        }\r\n\r\n        if (s < 0 && n.c[0]) str = '-' + str;\r\n      }\r\n\r\n      return str;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return as toString, but do not accept a base argument, and include the minus sign for\r\n     * negative zero.\r\n     */\r\n    P.valueOf = P.toJSON = function () {\r\n      return valueOf(this);\r\n    };\r\n\r\n\r\n    P._isBigNumber = true;\r\n\r\n    if (hasSymbol) {\r\n      P[Symbol.toStringTag] = 'BigNumber';\r\n\r\n      // Node.js v10.12.0+\r\n      P[Symbol.for('nodejs.util.inspect.custom')] = P.valueOf;\r\n    }\r\n\r\n    if (configObject != null) BigNumber.set(configObject);\r\n\r\n    return BigNumber;\r\n  }\r\n\r\n\r\n  // PRIVATE HELPER FUNCTIONS\r\n\r\n  // These functions don't need access to variables,\r\n  // e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\n  function bitFloor(n) {\r\n    var i = n | 0;\r\n    return n > 0 || n === i ? i : i - 1;\r\n  }\r\n\r\n\r\n  // Return a coefficient array as a string of base 10 digits.\r\n  function coeffToString(a) {\r\n    var s, z,\r\n      i = 1,\r\n      j = a.length,\r\n      r = a[0] + '';\r\n\r\n    for (; i < j;) {\r\n      s = a[i++] + '';\r\n      z = LOG_BASE - s.length;\r\n      for (; z--; s = '0' + s);\r\n      r += s;\r\n    }\r\n\r\n    // Determine trailing zeros.\r\n    for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n    return r.slice(0, j + 1 || 1);\r\n  }\r\n\r\n\r\n  // Compare the value of BigNumbers x and y.\r\n  function compare(x, y) {\r\n    var a, b,\r\n      xc = x.c,\r\n      yc = y.c,\r\n      i = x.s,\r\n      j = y.s,\r\n      k = x.e,\r\n      l = y.e;\r\n\r\n    // Either NaN?\r\n    if (!i || !j) return null;\r\n\r\n    a = xc && !xc[0];\r\n    b = yc && !yc[0];\r\n\r\n    // Either zero?\r\n    if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n    // Signs differ?\r\n    if (i != j) return i;\r\n\r\n    a = i < 0;\r\n    b = k == l;\r\n\r\n    // Either Infinity?\r\n    if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n    // Compare exponents.\r\n    if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n    j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n    // Compare lengths.\r\n    return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n   */\r\n  function intCheck(n, min, max, name) {\r\n    if (n < min || n > max || n !== mathfloor(n)) {\r\n      throw Error\r\n       (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n         ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n         : ' not a primitive number: ') + String(n));\r\n    }\r\n  }\r\n\r\n\r\n  // Assumes finite n.\r\n  function isOdd(n) {\r\n    var k = n.c.length - 1;\r\n    return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n  }\r\n\r\n\r\n  function toExponential(str, e) {\r\n    return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n     (e < 0 ? 'e' : 'e+') + e;\r\n  }\r\n\r\n\r\n  function toFixedPoint(str, e, z) {\r\n    var len, zs;\r\n\r\n    // Negative exponent?\r\n    if (e < 0) {\r\n\r\n      // Prepend zeros.\r\n      for (zs = z + '.'; ++e; zs += z);\r\n      str = zs + str;\r\n\r\n    // Positive exponent\r\n    } else {\r\n      len = str.length;\r\n\r\n      // Append zeros.\r\n      if (++e > len) {\r\n        for (zs = z, e -= len; --e; zs += z);\r\n        str += zs;\r\n      } else if (e < len) {\r\n        str = str.slice(0, e) + '.' + str.slice(e);\r\n      }\r\n    }\r\n\r\n    return str;\r\n  }\r\n\r\n\r\n  // EXPORT\r\n\r\n\r\n  BigNumber = clone();\r\n  BigNumber['default'] = BigNumber.BigNumber = BigNumber;\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () { return BigNumber; });\r\n\r\n  // Node.js and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    module.exports = BigNumber;\r\n\r\n  // Browser.\r\n  } else {\r\n    if (!globalObject) {\r\n      globalObject = typeof self != 'undefined' && self ? self : window;\r\n    }\r\n\r\n    globalObject.BigNumber = BigNumber;\r\n  }\r\n})(this);\r\n","import { LocalService } from '@makerdao/services-core';\n// maybe a \"dai.js developer utils\" package is useful?\nimport { MKR, CHIEF } from './utils/constants';\nimport { getCurrency, netIdToName } from './utils/helpers';\n\n// imports from 'reads'\nimport { memoizeWith, uniq, nth, takeLast, identity } from 'ramda';\nimport contractInfo from '../contracts/contract-info.json';\nconst chiefInfo = contractInfo.chief;\n\nexport default class ChiefService extends LocalService {\n  constructor(name = 'chief') {\n    super(name, ['smartContract', 'web3']);\n  }\n\n  // Writes -----------------------------------------------\n\n  etch(addresses) {\n    return this._chiefContract().etch(addresses);\n  }\n\n  lift(address) {\n    return this._chiefContract().lift(address);\n  }\n\n  vote(picks) {\n    if (Array.isArray(picks))\n      return this._chiefContract()['vote(address[])'](picks);\n    return this._chiefContract()['vote(bytes32)'](picks);\n  }\n\n  lock(amt, unit = MKR) {\n    const mkrAmt = getCurrency(amt, unit).toFixed('wei');\n    return this._chiefContract().lock(mkrAmt);\n  }\n\n  free(amt, unit = MKR) {\n    const mkrAmt = getCurrency(amt, unit).toFixed('wei');\n    return this._chiefContract().free(mkrAmt);\n  }\n\n  // Reads ------------------------------------------------\n\n  paddedBytes32ToAddress = hex =>\n    hex.length > 42 ? '0x' + takeLast(40, hex) : hex;\n\n  parseVoteAddressData = data => {\n    const candidates = [];\n    const addressData = data.substr(330);\n    for (let i = 0; i < addressData.length / 64; i++) {\n      const address = `0x${addressData.substring(i * 64 + 24, (i + 1) * 64)}`;\n      if (address.length === 42) candidates.push(address);\n    }\n    return candidates;\n  };\n\n  // helper for when we might call getSlateAddresses with the same slate several times\n  memoizedGetSlateAddresses = memoizeWith(identity, this.getSlateAddresses);\n\n  getDetailedLockLogs = async () => {\n    const chiefAddress = this._chiefContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const locks = await web3Service.getPastLogs({\n      fromBlock: chiefInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: chiefAddress,\n      topics: [chiefInfo.events.lock]\n    });\n\n    return locks.map(lockLog => ({\n      blockNumber: lockLog.blockNumber,\n      sender: this.paddedBytes32ToAddress(lockLog.topics[1]),\n      amount: MKR.wei(lockLog.topics[2])\n    }));\n  };\n\n  getDetailedFreeLogs = async () => {\n    const chiefAddress = this._chiefContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const frees = await web3Service.getPastLogs({\n      fromBlock: chiefInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: chiefAddress,\n      topics: [chiefInfo.events.free]\n    });\n\n    return frees.map(freeLog => ({\n      blockNumber: freeLog.blockNumber,\n      sender: this.paddedBytes32ToAddress(freeLog.topics[1]),\n      amount: MKR.wei(freeLog.topics[2])\n    }));\n  };\n\n  getLockLogs = async () => {\n    const chiefAddress = this._chiefContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const locks = await web3Service.getPastLogs({\n      fromBlock: chiefInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: chiefAddress,\n      topics: [chiefInfo.events.lock]\n    });\n\n    return uniq(\n      locks\n        .map(logObj => nth(1, logObj.topics))\n        .map(this.paddedBytes32ToAddress)\n    );\n  };\n\n  getVoteAddressLogs = async () => {\n    const chiefAddress = this._chiefContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const votes = await web3Service.getPastLogs({\n      fromBlock: chiefInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: chiefAddress,\n      topics: [chiefInfo.events.vote_addresses]\n    });\n\n    return votes.map(voteLog => ({\n      blockNumber: voteLog.blockNumber,\n      sender: this.paddedBytes32ToAddress(voteLog.topics[1]),\n      candidates: this.parseVoteAddressData(voteLog.data)\n    }));\n  };\n\n  getVoteSlateLogs = async () => {\n    const chiefAddress = this._chiefContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const votes = await web3Service.getPastLogs({\n      fromBlock: chiefInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: chiefAddress,\n      topics: [chiefInfo.events.vote_slate]\n    });\n\n    return votes.map(voteLog => ({\n      blockNumber: voteLog.blockNumber,\n      sender: this.paddedBytes32ToAddress(voteLog.topics[1]),\n      slate: voteLog.topics[2]\n    }));\n  };\n\n  async getVoteTally() {\n    const voters = await this.getLockLogs();\n\n    const withDeposits = await Promise.all(\n      voters.map(voter =>\n        this.getNumDeposits(voter).then(deposits => ({\n          address: voter,\n          deposits: parseFloat(deposits)\n        }))\n      )\n    );\n\n    const withSlates = await Promise.all(\n      withDeposits.map(addressDeposit =>\n        this.getVotedSlate(addressDeposit.address).then(slate => ({\n          ...addressDeposit,\n          slate\n        }))\n      )\n    );\n\n    const withVotes = await Promise.all(\n      withSlates.map(withSlate =>\n        this.memoizedGetSlateAddresses(withSlate.slate).then(addresses => ({\n          ...withSlate,\n          votes: addresses\n        }))\n      )\n    );\n\n    const voteTally = {};\n    for (const voteObj of withVotes) {\n      for (let vote of voteObj.votes) {\n        vote = vote.toLowerCase();\n        if (voteTally[vote] === undefined) {\n          voteTally[vote] = {\n            approvals: voteObj.deposits,\n            addresses: [\n              { address: voteObj.address, deposits: voteObj.deposits }\n            ]\n          };\n        } else {\n          voteTally[vote].approvals += voteObj.deposits;\n          voteTally[vote].addresses.push({\n            address: voteObj.address,\n            deposits: voteObj.deposits\n          });\n        }\n      }\n    }\n    for (const [key, value] of Object.entries(voteTally)) {\n      const sortedAddresses = value.addresses.sort(\n        (a, b) => b.deposits - a.deposits\n      );\n      const approvals = voteTally[key].approvals;\n      const withPercentages = sortedAddresses.map(shapedVoteObj => ({\n        ...shapedVoteObj,\n        percent: ((shapedVoteObj.deposits * 100) / approvals).toFixed(2)\n      }));\n      voteTally[key] = withPercentages;\n    }\n    return voteTally;\n  }\n\n  getVotedSlate(address) {\n    return this._chiefContract().votes(address);\n  }\n\n  getNumDeposits(address) {\n    return this._chiefContract()\n      .deposits(address)\n      .then(MKR.wei);\n  }\n\n  getApprovalCount(address) {\n    return this._chiefContract()\n      .approvals(address)\n      .then(MKR.wei);\n  }\n\n  getHat() {\n    return this._chiefContract().hat();\n  }\n\n  async getSlateAddresses(slateHash, i = 0) {\n    try {\n      return [await this._chiefContract().slates(slateHash, i)].concat(\n        await this.getSlateAddresses(slateHash, i + 1)\n      );\n    } catch (_) {\n      return [];\n    }\n  }\n\n  getLockAddressLogs() {\n    return new Promise((resolve, reject) => {\n      this._chiefContract({ web3js: true })\n        .LogNote({ sig: '0xdd467064' }, { fromBlock: 0, toBlock: 'latest' })\n        .get((error, result) => {\n          if (error) reject(error);\n          resolve(result.map(log => log.args.guy));\n        });\n    });\n  }\n\n  getEtchSlateLogs() {\n    return new Promise((resolve, reject) => {\n      this._chiefContract({ web3js: true })\n        .Etch({}, { fromBlock: 0, toBlock: 'latest' })\n        .get((error, result) => {\n          if (error) reject(error);\n          resolve(result.map(log => log.args.slate));\n        });\n    });\n  }\n\n  // Internal --------------------------------------------\n\n  _chiefContract({ web3js = false } = {}) {\n    if (web3js) return this.get('smartContract').getWeb3ContractByName(CHIEF);\n    return this.get('smartContract').getContractByName(CHIEF);\n  }\n}\n","function _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}\n\nmodule.exports = _arrayWithHoles;","function _iterableToArrayLimit(arr, i) {\n  if (typeof Symbol === \"undefined\" || !(Symbol.iterator in Object(arr))) return;\n  var _arr = [];\n  var _n = true;\n  var _d = false;\n  var _e = undefined;\n\n  try {\n    for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) {\n      _arr.push(_s.value);\n\n      if (i && _arr.length === i) break;\n    }\n  } catch (err) {\n    _d = true;\n    _e = err;\n  } finally {\n    try {\n      if (!_n && _i[\"return\"] != null) _i[\"return\"]();\n    } finally {\n      if (_d) throw _e;\n    }\n  }\n\n  return _arr;\n}\n\nmodule.exports = _iterableToArrayLimit;","function _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nmodule.exports = _nonIterableRest;","/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nvar runtime = (function (exports) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  exports.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  IteratorPrototype[iteratorSymbol] = function () {\n    return this;\n  };\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype &&\n      NativeIteratorPrototype !== Op &&\n      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype =\n    Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n  GeneratorFunctionPrototype.constructor = GeneratorFunction;\n  GeneratorFunctionPrototype[toStringTagSymbol] =\n    GeneratorFunction.displayName = \"GeneratorFunction\";\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function(method) {\n      prototype[method] = function(arg) {\n        return this._invoke(method, arg);\n      };\n    });\n  }\n\n  exports.isGeneratorFunction = function(genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor\n      ? ctor === GeneratorFunction ||\n        // For the native GeneratorFunction constructor, the best we can\n        // do is to check its .name property.\n        (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n      : false;\n  };\n\n  exports.mark = function(genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      if (!(toStringTagSymbol in genFun)) {\n        genFun[toStringTagSymbol] = \"GeneratorFunction\";\n      }\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  exports.awrap = function(arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator, PromiseImpl) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value &&\n            typeof value === \"object\" &&\n            hasOwn.call(value, \"__await\")) {\n          return PromiseImpl.resolve(value.__await).then(function(value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function(err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return PromiseImpl.resolve(value).then(function(unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration.\n          result.value = unwrapped;\n          resolve(result);\n        }, function(error) {\n          // If a rejected Promise was yielded, throw the rejection back\n          // into the async generator function so it can be handled there.\n          return invoke(\"throw\", error, resolve, reject);\n        });\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new PromiseImpl(function(resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n        // If enqueue has been called before, then we want to wait until\n        // all previous Promises have been resolved before calling invoke,\n        // so that results are always delivered in the correct order. If\n        // enqueue has not been called before, then it is important to\n        // call invoke immediately, without waiting on a callback to fire,\n        // so that the async generator function has the opportunity to do\n        // any necessary setup in a predictable way. This predictability\n        // is why the Promise constructor synchronously invokes its\n        // executor callback, and why async functions synchronously\n        // execute code before the first await. Since we implement simple\n        // async functions in terms of async generators, it is especially\n        // important to get this right, even though it requires care.\n        previousPromise ? previousPromise.then(\n          callInvokeWithMethodAndArg,\n          // Avoid propagating failures to Promises returned by later\n          // invocations of the iterator.\n          callInvokeWithMethodAndArg\n        ) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n    return this;\n  };\n  exports.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  exports.async = function(innerFn, outerFn, self, tryLocsList, PromiseImpl) {\n    if (PromiseImpl === void 0) PromiseImpl = Promise;\n\n    var iter = new AsyncIterator(\n      wrap(innerFn, outerFn, self, tryLocsList),\n      PromiseImpl\n    );\n\n    return exports.isGeneratorFunction(outerFn)\n      ? iter // If outerFn is a generator, return the full iterator.\n      : iter.next().then(function(result) {\n          return result.done ? result.value : iter.next();\n        });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done\n            ? GenStateCompleted\n            : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        // Note: [\"return\"] must be used for ES3 parsing compatibility.\n        if (delegate.iterator[\"return\"]) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\n          \"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (! info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  Gp[toStringTagSymbol] = \"Generator\";\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  Gp[iteratorSymbol] = function() {\n    return this;\n  };\n\n  Gp.toString = function() {\n    return \"[object Generator]\";\n  };\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  exports.keys = function(object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1, next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  exports.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" &&\n              hasOwn.call(this, name) &&\n              !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !! caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev &&\n            hasOwn.call(entry, \"finallyLoc\") &&\n            this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry &&\n          (type === \"break\" ||\n           type === \"continue\") &&\n          finallyEntry.tryLoc <= arg &&\n          arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" ||\n          record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n\n  // Regardless of whether this script is executing as a CommonJS module\n  // or not, return the runtime object so that we can declare the variable\n  // regeneratorRuntime in the outer scope, which allows this module to be\n  // injected easily by `bin/regenerator --include-runtime script.js`.\n  return exports;\n\n}(\n  // If this script is executing as a CommonJS module, use module.exports\n  // as the regeneratorRuntime namespace. Otherwise create a new empty\n  // object. Either way, the resulting object will be used to initialize\n  // the regeneratorRuntime variable at the top of this file.\n  typeof module === \"object\" ? module.exports : {}\n));\n\ntry {\n  regeneratorRuntime = runtime;\n} catch (accidentalStrictMode) {\n  // This module should not be running in strict mode, so the above\n  // assignment should always work unless something is misconfigured. Just\n  // in case runtime.js accidentally runs in strict mode, we can escape\n  // strict mode using a global Function call. This could conceivably fail\n  // if a Content Security Policy forbids using Function, but in that case\n  // the proper solution is to fix the accidental strict mode problem. If\n  // you've misconfigured your bundler to force strict mode and applied a\n  // CSP to forbid Function, and you're not willing to fix either of those\n  // problems, please detail your unique predicament in a GitHub issue.\n  Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n}\n","var superPropBase = require(\"./superPropBase\");\n\nfunction _get(target, property, receiver) {\n  if (typeof Reflect !== \"undefined\" && Reflect.get) {\n    module.exports = _get = Reflect.get;\n  } else {\n    module.exports = _get = function _get(target, property, receiver) {\n      var base = superPropBase(target, property);\n      if (!base) return;\n      var desc = Object.getOwnPropertyDescriptor(base, property);\n\n      if (desc.get) {\n        return desc.get.call(receiver);\n      }\n\n      return desc.value;\n    };\n  }\n\n  return _get(target, property, receiver || target);\n}\n\nmodule.exports = _get;","var getPrototypeOf = require(\"./getPrototypeOf\");\n\nfunction _superPropBase(object, property) {\n  while (!Object.prototype.hasOwnProperty.call(object, property)) {\n    object = getPrototypeOf(object);\n    if (object === null) break;\n  }\n\n  return object;\n}\n\nmodule.exports = _superPropBase;","function _isNativeFunction(fn) {\n  return Function.toString.call(fn).indexOf(\"[native code]\") !== -1;\n}\n\nmodule.exports = _isNativeFunction;","var setPrototypeOf = require(\"./setPrototypeOf\");\n\nvar isNativeReflectConstruct = require(\"./isNativeReflectConstruct\");\n\nfunction _construct(Parent, args, Class) {\n  if (isNativeReflectConstruct()) {\n    module.exports = _construct = Reflect.construct;\n  } else {\n    module.exports = _construct = function _construct(Parent, args, Class) {\n      var a = [null];\n      a.push.apply(a, args);\n      var Constructor = Function.bind.apply(Parent, a);\n      var instance = new Constructor();\n      if (Class) setPrototypeOf(instance, Class.prototype);\n      return instance;\n    };\n  }\n\n  return _construct.apply(null, arguments);\n}\n\nmodule.exports = _construct;","function _isNativeReflectConstruct() {\n  if (typeof Reflect === \"undefined\" || !Reflect.construct) return false;\n  if (Reflect.construct.sham) return false;\n  if (typeof Proxy === \"function\") return true;\n\n  try {\n    Date.prototype.toString.call(Reflect.construct(Date, [], function () {}));\n    return true;\n  } catch (e) {\n    return false;\n  }\n}\n\nmodule.exports = _isNativeReflectConstruct;","\"use strict\";\n\nvar _interopRequireWildcard = require(\"@babel/runtime/helpers/interopRequireWildcard\");\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _StateMachine = _interopRequireDefault(require(\"./StateMachine\"));\n\nvar _ServiceState = _interopRequireDefault(require(\"./ServiceState\"));\n\nvar _ServiceType = _interopRequireWildcard(require(\"./ServiceType\"));\n\nvar _debug = _interopRequireDefault(require(\"debug\"));\n\nvar log = (0, _debug[\"default\"])('dai:ServiceManagerBase');\n\nfunction _promisify(unsafeCallback) {\n  return new Promise(function (resolve, reject) {\n    try {\n      resolve(unsafeCallback());\n    } catch (e) {\n      reject(e.message);\n    }\n  });\n}\n\nvar ServiceManagerBase = /*#__PURE__*/function () {\n  /**\n   * @param init {function|null}\n   * @param connect {function|null}\n   * @param auth {function|null}\n   */\n  function ServiceManagerBase() {\n    var init = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n    var connect = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n    var auth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;\n    (0, _classCallCheck2[\"default\"])(this, ServiceManagerBase);\n\n    // Validate init\n    if (init !== null && typeof init !== 'function') {\n      throw new Error('Invalid argument init: not a function or null.');\n    } else if (init === null) {\n      init = function init() {\n        return Promise.resolve();\n      };\n    } // Validate connect\n\n\n    if (connect !== null && typeof connect !== 'function') {\n      throw new Error('Invalid argument connect: not a function or null.');\n    } else if (connect === null && auth !== null) {\n      connect = function connect() {\n        return Promise.resolve();\n      };\n    } // Validate auth\n\n\n    if (auth !== null && typeof auth !== 'function') {\n      throw new Error('Invalid argument auth: not a function or null.');\n    } // Set initial props\n\n\n    this._init = init;\n    this._connect = connect;\n    this._auth = auth;\n    this._type = auth === null ? connect === null ? _ServiceType[\"default\"].LOCAL : _ServiceType[\"default\"].PUBLIC : _ServiceType[\"default\"].PRIVATE;\n    this._state = new _StateMachine[\"default\"](_ServiceState[\"default\"].CREATED, _ServiceType.serviceTypeTransitions[this._type]);\n    this._initPromise = null;\n    this._connectPromise = null;\n    this._authPromise = null;\n  }\n  /**\n   * @returns {Promise}\n   */\n\n\n  (0, _createClass2[\"default\"])(ServiceManagerBase, [{\n    key: \"initialize\",\n    value: function initialize(settings) {\n      var _this = this;\n\n      // If our current state is preceding the INITIALIZING state, we need to set up initialization\n      if (this._state.inState(_ServiceState[\"default\"].CREATED)) {\n        // Assert that there is no initPromise at this point\n\n        /* istanbul ignore next */\n        if (this._initPromise) {\n          throw new Error('Unexpected init promise in state CREATED.');\n        } // Enter the INITIALIZING state\n\n\n        this._state.transitionTo(_ServiceState[\"default\"].INITIALIZING); // After trying to initialize, transition to the success state (READY/OFFLINE) or revert to CREATED\n\n\n        this._initPromise = _promisify(function () {\n          return _this._init(settings);\n        }).then(function () {\n          return _this._state.transitionTo(_this._type === _ServiceType[\"default\"].LOCAL ? _ServiceState[\"default\"].READY : _ServiceState[\"default\"].OFFLINE);\n        }, function (reason) {\n          log(reason);\n\n          _this._state.transitionTo(_ServiceState[\"default\"].CREATED);\n\n          throw reason;\n        });\n      }\n\n      return this._initPromise;\n    }\n    /**\n     * @returns {Promise}\n     */\n\n  }, {\n    key: \"connect\",\n    value: function connect() {\n      var _this2 = this;\n\n      // Local Services are 'connected' whenever they are initialized\n      if (this._type === _ServiceType[\"default\"].LOCAL) {\n        return this.initialize();\n      } // If our current state is preceding the CONNECTING state, we need to set up a new connection\n\n\n      if (this._state.inState([_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].INITIALIZING, _ServiceState[\"default\"].OFFLINE]) && this._connectPromise === null) {\n        // Make sure to be initialized before trying to connect\n        this._connectPromise = this.initialize().then(function () {\n          // Enter the CONNECTING state\n          _this2._state.transitionTo(_ServiceState[\"default\"].CONNECTING); // After trying to connect, transition to the success state (ONLINE/READY) or revert to OFFLINE.\n\n\n          return _promisify(function () {\n            return _this2._connect(function () {\n              return _this2._disconnect();\n            });\n          }).then(function () {\n            // Check if we are still CONNECTING, because another process might have come in between\n            if (_this2._state.inState(_ServiceState[\"default\"].CONNECTING)) {\n              _this2._state.transitionTo(_this2._type === _ServiceType[\"default\"].PUBLIC ? _ServiceState[\"default\"].READY : _ServiceState[\"default\"].ONLINE);\n            }\n          }, function (error) {\n            log('connect error:', error); // Check if we are still CONNECTING, because another process might have come in between\n\n            if (_this2._state.inState(_ServiceState[\"default\"].CONNECTING)) {\n              _this2._state.transitionTo(_ServiceState[\"default\"].OFFLINE);\n            }\n\n            throw error;\n          });\n        });\n      }\n\n      return this._connectPromise;\n    }\n    /**\n     * @returns {Promise}\n     */\n\n  }, {\n    key: \"authenticate\",\n    value: function authenticate() {\n      var _this3 = this;\n\n      // Public and Local Services are 'authenticated' whenever they are connected (/initialized)\n      if (this._type !== _ServiceType[\"default\"].PRIVATE) {\n        return this.connect();\n      } // If our current state is preceding the AUTHENTICATING state, we need to set up a new authentication\n\n\n      if (this._state.inState([_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].INITIALIZING, _ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].CONNECTING, _ServiceState[\"default\"].ONLINE]) && this._authPromise === null) {\n        // Make sure to be connected before trying to authenticate\n        this._authPromise = this.connect().then(function () {\n          // Enter the AUTHENTICATING state\n          _this3._state.transitionTo(_ServiceState[\"default\"].AUTHENTICATING); // After trying to authenticate, transition to the success state (READY) or revert to ONLINE\n\n\n          return _promisify(function () {\n            return _this3._auth(function () {\n              return _this3._deauthenticate();\n            });\n          }).then(function () {\n            // Check if we are still AUTHENTICATING, because another process might have come in between\n            // (Most notably, a disconnect may have transitioned us into OFFLINE state).\n            if (_this3._state.inState(_ServiceState[\"default\"].AUTHENTICATING)) {\n              _this3._state.transitionTo(_ServiceState[\"default\"].READY);\n            }\n          }, function (reason) {\n            log('authenticate error: ' + reason); // Check if we are still AUTHENTICATING, because another process might have come in between\n\n            if (_this3._state.inState(_ServiceState[\"default\"].AUTHENTICATING)) {\n              _this3._state.transitionTo(_ServiceState[\"default\"].ONLINE);\n            }\n          });\n        });\n      }\n\n      return this._authPromise;\n    }\n    /**\n     * @returns { ServiceManagerBase }\n     */\n\n  }, {\n    key: \"settings\",\n    value: function settings(_settings) {\n      this._settings = _settings;\n      return this;\n    }\n    /**\n     * @returns {string}\n     */\n\n  }, {\n    key: \"state\",\n    value: function state() {\n      return this._state.state();\n    }\n    /**\n     * @returns {string}\n     */\n\n  }, {\n    key: \"type\",\n    value: function type() {\n      return this._type;\n    }\n    /**\n     * @returns {boolean}\n     */\n\n  }, {\n    key: \"isInitialized\",\n    value: function isInitialized() {\n      return !this._state.inState([_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].INITIALIZING]);\n    }\n    /**\n     * @returns {boolean|null}\n     */\n\n  }, {\n    key: \"isConnected\",\n    value: function isConnected() {\n      return this._type === _ServiceType[\"default\"].LOCAL ? null : this._state.inState([_ServiceState[\"default\"].ONLINE, _ServiceState[\"default\"].AUTHENTICATING, _ServiceState[\"default\"].READY]);\n    }\n    /**\n     * @returns {boolean|null}\n     */\n\n  }, {\n    key: \"isAuthenticated\",\n    value: function isAuthenticated() {\n      return this._type === _ServiceType[\"default\"].PRIVATE ? this._state.inState(_ServiceState[\"default\"].READY) : null;\n    }\n    /**\n     * @returns {boolean}\n     */\n\n  }, {\n    key: \"isReady\",\n    value: function isReady() {\n      return this._state.inState(_ServiceState[\"default\"].READY);\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onInitialized\",\n    value: function onInitialized(handler) {\n      this._state.onStateChanged(function (oldState, newState) {\n        if (oldState === _ServiceState[\"default\"].INITIALIZING && (newState === _ServiceState[\"default\"].OFFLINE || newState === _ServiceState[\"default\"].READY)) {\n          handler();\n        }\n      });\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onConnected\",\n    value: function onConnected(handler) {\n      this._state.onStateChanged(function (oldState, newState) {\n        if (oldState === _ServiceState[\"default\"].CONNECTING && (newState === _ServiceState[\"default\"].ONLINE || newState === _ServiceState[\"default\"].READY)) {\n          handler();\n        }\n      });\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onDisconnected\",\n    value: function onDisconnected(handler) {\n      this._state.onStateChanged(function (oldState, newState) {\n        if (newState === _ServiceState[\"default\"].OFFLINE && (oldState === _ServiceState[\"default\"].ONLINE || oldState === _ServiceState[\"default\"].READY)) {\n          handler();\n        }\n      });\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onAuthenticated\",\n    value: function onAuthenticated(handler) {\n      this._state.onStateChanged(function (oldState, newState) {\n        if (oldState === _ServiceState[\"default\"].AUTHENTICATING && newState === _ServiceState[\"default\"].READY) {\n          handler();\n        }\n      });\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onDeauthenticated\",\n    value: function onDeauthenticated(handler) {\n      if (this.type() === _ServiceType[\"default\"].PRIVATE) {\n        this._state.onStateChanged(function (oldState, newState) {\n          if ((newState === _ServiceState[\"default\"].OFFLINE || newState === _ServiceState[\"default\"].ONLINE) && oldState === _ServiceState[\"default\"].READY) {\n            handler();\n          }\n        });\n      }\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onReady\",\n    value: function onReady(handler) {\n      this._state.onStateChanged(function (_, newState) {\n        if (newState === _ServiceState[\"default\"].READY) {\n          handler();\n        }\n      });\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onStateChanged\",\n    value: function onStateChanged(handler) {\n      this._state.onStateChanged(handler);\n\n      return this;\n    }\n    /**\n     * This is called by the service implementation object, which is the only authority with knowledge on the true\n     * connection status. This will e.g. get called when a ping signal is no longer returned by the back-end and the\n     * service implementation object concludes that we are therefore offline.\n     *\n     * @private\n     */\n\n  }, {\n    key: \"_disconnect\",\n    value: function _disconnect() {\n      /* istanbul ignore next */\n      if (this._type === _ServiceType[\"default\"].LOCAL) {\n        throw new Error('_disconnect must not be called on a Local Service');\n      }\n\n      if (this._state.inState(_ServiceState[\"default\"].AUTHENTICATING)) {\n        this._deauthenticate();\n      }\n\n      if (this._state.inState([_ServiceState[\"default\"].READY, _ServiceState[\"default\"].ONLINE, _ServiceState[\"default\"].CONNECTING])) {\n        this._authPromise = null;\n        this._connectPromise = null;\n\n        this._state.transitionTo(_ServiceState[\"default\"].OFFLINE);\n      }\n    }\n    /**\n     * This is called by the service implementation object, which is the only authority with knowledge on the true\n     * authentication status. This will e.g. get called when an authentication token expires or a user logs out, and the\n     * service implementation object concludes that we are therefore no longer authenticated.\n     *\n     * @private\n     */\n\n  }, {\n    key: \"_deauthenticate\",\n    value: function _deauthenticate() {\n      /* istanbul ignore next */\n      if (this._type !== _ServiceType[\"default\"].PRIVATE) {\n        throw new Error('_deauthenticate must not be called on a Local or Public Service');\n      }\n\n      if (this._state.inState([_ServiceState[\"default\"].READY, _ServiceState[\"default\"].AUTHENTICATING])) {\n        this._authPromise = null;\n\n        this._state.transitionTo(_ServiceState[\"default\"].ONLINE);\n      }\n    }\n  }]);\n  return ServiceManagerBase;\n}();\n\nvar _default = ServiceManagerBase;\nexports[\"default\"] = _default;","/**\n * This is the web browser implementation of `debug()`.\n *\n * Expose `debug()` as the module.\n */\n\nexports = module.exports = require('./debug');\nexports.log = log;\nexports.formatArgs = formatArgs;\nexports.save = save;\nexports.load = load;\nexports.useColors = useColors;\nexports.storage = 'undefined' != typeof chrome\n               && 'undefined' != typeof chrome.storage\n                  ? chrome.storage.local\n                  : localstorage();\n\n/**\n * Colors.\n */\n\nexports.colors = [\n  'lightseagreen',\n  'forestgreen',\n  'goldenrod',\n  'dodgerblue',\n  'darkorchid',\n  'crimson'\n];\n\n/**\n * Currently only WebKit-based Web Inspectors, Firefox >= v31,\n * and the Firebug extension (any Firefox version) are known\n * to support \"%c\" CSS customizations.\n *\n * TODO: add a `localStorage` variable to explicitly enable/disable colors\n */\n\nfunction useColors() {\n  // NB: In an Electron preload script, document will be defined but not fully\n  // initialized. Since we know we're in Chrome, we'll just detect this case\n  // explicitly\n  if (typeof window !== 'undefined' && window.process && window.process.type === 'renderer') {\n    return true;\n  }\n\n  // is webkit? http://stackoverflow.com/a/16459606/376773\n  // document is undefined in react-native: https://github.com/facebook/react-native/pull/1632\n  return (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) ||\n    // is firebug? http://stackoverflow.com/a/398120/376773\n    (typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||\n    // is firefox >= v31?\n    // https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages\n    (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/firefox\\/(\\d+)/) && parseInt(RegExp.$1, 10) >= 31) ||\n    // double check webkit in userAgent just in case we are in a worker\n    (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\\/(\\d+)/));\n}\n\n/**\n * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.\n */\n\nexports.formatters.j = function(v) {\n  try {\n    return JSON.stringify(v);\n  } catch (err) {\n    return '[UnexpectedJSONParseError]: ' + err.message;\n  }\n};\n\n\n/**\n * Colorize log arguments if enabled.\n *\n * @api public\n */\n\nfunction formatArgs(args) {\n  var useColors = this.useColors;\n\n  args[0] = (useColors ? '%c' : '')\n    + this.namespace\n    + (useColors ? ' %c' : ' ')\n    + args[0]\n    + (useColors ? '%c ' : ' ')\n    + '+' + exports.humanize(this.diff);\n\n  if (!useColors) return;\n\n  var c = 'color: ' + this.color;\n  args.splice(1, 0, c, 'color: inherit')\n\n  // the final \"%c\" is somewhat tricky, because there could be other\n  // arguments passed either before or after the %c, so we need to\n  // figure out the correct index to insert the CSS into\n  var index = 0;\n  var lastC = 0;\n  args[0].replace(/%[a-zA-Z%]/g, function(match) {\n    if ('%%' === match) return;\n    index++;\n    if ('%c' === match) {\n      // we only are interested in the *last* %c\n      // (the user may have provided their own)\n      lastC = index;\n    }\n  });\n\n  args.splice(lastC, 0, c);\n}\n\n/**\n * Invokes `console.log()` when available.\n * No-op when `console.log` is not a \"function\".\n *\n * @api public\n */\n\nfunction log() {\n  // this hackery is required for IE8/9, where\n  // the `console.log` function doesn't have 'apply'\n  return 'object' === typeof console\n    && console.log\n    && Function.prototype.apply.call(console.log, console, arguments);\n}\n\n/**\n * Save `namespaces`.\n *\n * @param {String} namespaces\n * @api private\n */\n\nfunction save(namespaces) {\n  try {\n    if (null == namespaces) {\n      exports.storage.removeItem('debug');\n    } else {\n      exports.storage.debug = namespaces;\n    }\n  } catch(e) {}\n}\n\n/**\n * Load `namespaces`.\n *\n * @return {String} returns the previously persisted debug modes\n * @api private\n */\n\nfunction load() {\n  var r;\n  try {\n    r = exports.storage.debug;\n  } catch(e) {}\n\n  // If debug isn't set in LS, and we're in Electron, try to load $DEBUG\n  if (!r && typeof process !== 'undefined' && 'env' in process) {\n    r = process.env.DEBUG;\n  }\n\n  return r;\n}\n\n/**\n * Enable namespaces listed in `localStorage.debug` initially.\n */\n\nexports.enable(load());\n\n/**\n * Localstorage attempts to return the localstorage.\n *\n * This is necessary because safari throws\n * when a user disables cookies/localstorage\n * and you attempt to access it.\n *\n * @return {LocalStorage}\n * @api private\n */\n\nfunction localstorage() {\n  try {\n    return window.localStorage;\n  } catch (e) {}\n}\n","\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n *\n * Expose `debug()` as the module.\n */\n\nexports = module.exports = createDebug.debug = createDebug['default'] = createDebug;\nexports.coerce = coerce;\nexports.disable = disable;\nexports.enable = enable;\nexports.enabled = enabled;\nexports.humanize = require('ms');\n\n/**\n * The currently active debug mode names, and names to skip.\n */\n\nexports.names = [];\nexports.skips = [];\n\n/**\n * Map of special \"%n\" handling functions, for the debug \"format\" argument.\n *\n * Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n */\n\nexports.formatters = {};\n\n/**\n * Previous log timestamp.\n */\n\nvar prevTime;\n\n/**\n * Select a color.\n * @param {String} namespace\n * @return {Number}\n * @api private\n */\n\nfunction selectColor(namespace) {\n  var hash = 0, i;\n\n  for (i in namespace) {\n    hash  = ((hash << 5) - hash) + namespace.charCodeAt(i);\n    hash |= 0; // Convert to 32bit integer\n  }\n\n  return exports.colors[Math.abs(hash) % exports.colors.length];\n}\n\n/**\n * Create a debugger with the given `namespace`.\n *\n * @param {String} namespace\n * @return {Function}\n * @api public\n */\n\nfunction createDebug(namespace) {\n\n  function debug() {\n    // disabled?\n    if (!debug.enabled) return;\n\n    var self = debug;\n\n    // set `diff` timestamp\n    var curr = +new Date();\n    var ms = curr - (prevTime || curr);\n    self.diff = ms;\n    self.prev = prevTime;\n    self.curr = curr;\n    prevTime = curr;\n\n    // turn the `arguments` into a proper Array\n    var args = new Array(arguments.length);\n    for (var i = 0; i < args.length; i++) {\n      args[i] = arguments[i];\n    }\n\n    args[0] = exports.coerce(args[0]);\n\n    if ('string' !== typeof args[0]) {\n      // anything else let's inspect with %O\n      args.unshift('%O');\n    }\n\n    // apply any `formatters` transformations\n    var index = 0;\n    args[0] = args[0].replace(/%([a-zA-Z%])/g, function(match, format) {\n      // if we encounter an escaped % then don't increase the array index\n      if (match === '%%') return match;\n      index++;\n      var formatter = exports.formatters[format];\n      if ('function' === typeof formatter) {\n        var val = args[index];\n        match = formatter.call(self, val);\n\n        // now we need to remove `args[index]` since it's inlined in the `format`\n        args.splice(index, 1);\n        index--;\n      }\n      return match;\n    });\n\n    // apply env-specific formatting (colors, etc.)\n    exports.formatArgs.call(self, args);\n\n    var logFn = debug.log || exports.log || console.log.bind(console);\n    logFn.apply(self, args);\n  }\n\n  debug.namespace = namespace;\n  debug.enabled = exports.enabled(namespace);\n  debug.useColors = exports.useColors();\n  debug.color = selectColor(namespace);\n\n  // env-specific initialization logic for debug instances\n  if ('function' === typeof exports.init) {\n    exports.init(debug);\n  }\n\n  return debug;\n}\n\n/**\n * Enables a debug mode by namespaces. This can include modes\n * separated by a colon and wildcards.\n *\n * @param {String} namespaces\n * @api public\n */\n\nfunction enable(namespaces) {\n  exports.save(namespaces);\n\n  exports.names = [];\n  exports.skips = [];\n\n  var split = (typeof namespaces === 'string' ? namespaces : '').split(/[\\s,]+/);\n  var len = split.length;\n\n  for (var i = 0; i < len; i++) {\n    if (!split[i]) continue; // ignore empty strings\n    namespaces = split[i].replace(/\\*/g, '.*?');\n    if (namespaces[0] === '-') {\n      exports.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));\n    } else {\n      exports.names.push(new RegExp('^' + namespaces + '$'));\n    }\n  }\n}\n\n/**\n * Disable debug output.\n *\n * @api public\n */\n\nfunction disable() {\n  exports.enable('');\n}\n\n/**\n * Returns true if the given mode name is enabled, false otherwise.\n *\n * @param {String} name\n * @return {Boolean}\n * @api public\n */\n\nfunction enabled(name) {\n  var i, len;\n  for (i = 0, len = exports.skips.length; i < len; i++) {\n    if (exports.skips[i].test(name)) {\n      return false;\n    }\n  }\n  for (i = 0, len = exports.names.length; i < len; i++) {\n    if (exports.names[i].test(name)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Coerce `val`.\n *\n * @param {Mixed} val\n * @return {Mixed}\n * @api private\n */\n\nfunction coerce(val) {\n  if (val instanceof Error) return val.stack || val.message;\n  return val;\n}\n","/**\n * Helpers.\n */\n\nvar s = 1000;\nvar m = s * 60;\nvar h = m * 60;\nvar d = h * 24;\nvar y = d * 365.25;\n\n/**\n * Parse or format the given `val`.\n *\n * Options:\n *\n *  - `long` verbose formatting [false]\n *\n * @param {String|Number} val\n * @param {Object} [options]\n * @throws {Error} throw an error if val is not a non-empty string or a number\n * @return {String|Number}\n * @api public\n */\n\nmodule.exports = function(val, options) {\n  options = options || {};\n  var type = typeof val;\n  if (type === 'string' && val.length > 0) {\n    return parse(val);\n  } else if (type === 'number' && isNaN(val) === false) {\n    return options.long ? fmtLong(val) : fmtShort(val);\n  }\n  throw new Error(\n    'val is not a non-empty string or a valid number. val=' +\n      JSON.stringify(val)\n  );\n};\n\n/**\n * Parse the given `str` and return milliseconds.\n *\n * @param {String} str\n * @return {Number}\n * @api private\n */\n\nfunction parse(str) {\n  str = String(str);\n  if (str.length > 100) {\n    return;\n  }\n  var match = /^((?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|years?|yrs?|y)?$/i.exec(\n    str\n  );\n  if (!match) {\n    return;\n  }\n  var n = parseFloat(match[1]);\n  var type = (match[2] || 'ms').toLowerCase();\n  switch (type) {\n    case 'years':\n    case 'year':\n    case 'yrs':\n    case 'yr':\n    case 'y':\n      return n * y;\n    case 'days':\n    case 'day':\n    case 'd':\n      return n * d;\n    case 'hours':\n    case 'hour':\n    case 'hrs':\n    case 'hr':\n    case 'h':\n      return n * h;\n    case 'minutes':\n    case 'minute':\n    case 'mins':\n    case 'min':\n    case 'm':\n      return n * m;\n    case 'seconds':\n    case 'second':\n    case 'secs':\n    case 'sec':\n    case 's':\n      return n * s;\n    case 'milliseconds':\n    case 'millisecond':\n    case 'msecs':\n    case 'msec':\n    case 'ms':\n      return n;\n    default:\n      return undefined;\n  }\n}\n\n/**\n * Short format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtShort(ms) {\n  if (ms >= d) {\n    return Math.round(ms / d) + 'd';\n  }\n  if (ms >= h) {\n    return Math.round(ms / h) + 'h';\n  }\n  if (ms >= m) {\n    return Math.round(ms / m) + 'm';\n  }\n  if (ms >= s) {\n    return Math.round(ms / s) + 's';\n  }\n  return ms + 'ms';\n}\n\n/**\n * Long format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtLong(ms) {\n  return plural(ms, d, 'day') ||\n    plural(ms, h, 'hour') ||\n    plural(ms, m, 'minute') ||\n    plural(ms, s, 'second') ||\n    ms + ' ms';\n}\n\n/**\n * Pluralization helper.\n */\n\nfunction plural(ms, n, name) {\n  if (ms < n) {\n    return;\n  }\n  if (ms < n * 1.5) {\n    return Math.floor(ms / n) + ' ' + name;\n  }\n  return Math.ceil(ms / n) + ' ' + name + 's';\n}\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\n\nvar _slicedToArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/slicedToArray\"));\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _uniq = _interopRequireDefault(require(\"lodash/uniq\"));\n\nvar _Container = _interopRequireDefault(require(\"./Container\"));\n\nvar _standardizeConfig3 = _interopRequireDefault(require(\"./standardizeConfig\"));\n\nfunction _createForOfIteratorHelper(o) { if (typeof Symbol === \"undefined\" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (o = _unsupportedIterableToArray(o))) { var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var it, normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\n\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\n\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\n\nvar ServiceProvider = /*#__PURE__*/function () {\n  function ServiceProvider(config) {\n    var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n        _ref$services = _ref.services,\n        services = _ref$services === void 0 ? {} : _ref$services,\n        _ref$defaults = _ref.defaults,\n        defaults = _ref$defaults === void 0 ? {} : _ref$defaults,\n        _ref$disabled = _ref.disabled,\n        disabled = _ref$disabled === void 0 ? {} : _ref$disabled;\n\n    (0, _classCallCheck2[\"default\"])(this, ServiceProvider);\n    this._config = config; // all the service classes that this provider should support\n\n    this._services = services; // the services (as string names) that should be used for each role by\n    // default, or when that role is disabled\n\n    this._resolver = {\n      defaults: defaults,\n      disabled: disabled\n    };\n  }\n  /**\n   * @param {string} serviceName\n   * @returns {boolean}\n   */\n\n\n  (0, _createClass2[\"default\"])(ServiceProvider, [{\n    key: \"supports\",\n    value: function supports(serviceName) {\n      return !!this._services[serviceName];\n    }\n    /**\n     * @param {object} servicesConfig\n     * @returns {Container}\n     */\n\n  }, {\n    key: \"buildContainer\",\n    value: function buildContainer() {\n      var container = new _Container[\"default\"]();\n\n      for (var role in this._config) {\n        var _standardizeConfig = (0, _standardizeConfig3[\"default\"])(role, this._config[role], this._resolver),\n            _standardizeConfig2 = (0, _slicedToArray2[\"default\"])(_standardizeConfig, 2),\n            service = _standardizeConfig2[0],\n            settings = _standardizeConfig2[1];\n\n        var instance = void 0; // each config can contain a service descriptor in one of several forms:\n\n        if ((0, _typeof2[\"default\"])(service) == 'object') {\n          // instance\n          instance = service;\n        } else if (typeof service == 'function') {\n          // constructor\n          instance = new service();\n        } else {\n          // string\n          if (!this.supports(service) && role === 'exchange') {\n            throw new Error('This service has been extracted from dai.js. Please refer to the documentation to add it as a plugin: \\n\\n https://github.com/makerdao/dai.js/wiki/Basic-Usage-(Plugins)');\n          }\n\n          if (!this.supports(service)) {\n            throw new Error('Unsupported service in configuration: ' + service);\n          }\n\n          instance = new this._services[service]();\n        }\n\n        var instanceName = instance.manager().name();\n\n        if (instanceName !== role) {\n          throw new Error(\"Role mismatch: \\\"\".concat(instanceName, \"\\\", \\\"\").concat(role, \"\\\"\"));\n        }\n\n        instance.manager().settings(settings);\n        container.register(instance, role);\n      }\n\n      this._registerDependencies(container);\n\n      container.injectDependencies();\n      this._container = container;\n      return container;\n    }\n  }, {\n    key: \"_registerDependencies\",\n    value: function _registerDependencies(container) {\n      var names = container.getRegisteredServiceNames(); // get the names of all dependencies\n\n      var allDeps = names.reduce(function (acc, name) {\n        var service = container.service(name);\n        var deps = service.manager().dependencies();\n        return (0, _uniq[\"default\"])(acc.concat(deps));\n      }, []); // filter out the ones that are already registered\n\n      var newDeps = allDeps.filter(function (name) {\n        return !names.includes(name);\n      });\n      if (newDeps.length === 0) return; // register any remaining ones\n\n      var _iterator = _createForOfIteratorHelper(newDeps),\n          _step;\n\n      try {\n        for (_iterator.s(); !(_step = _iterator.n()).done;) {\n          var name = _step.value;\n          var ctor = this._resolver.defaults[name];\n          if (typeof ctor === 'string') ctor = this._services[ctor];\n          if (!ctor) throw new Error(\"No service found for \\\"\".concat(name, \"\\\"\"));\n          container.register(new ctor(), name);\n        } // repeat, to find any dependencies for services that were just added\n\n      } catch (err) {\n        _iterator.e(err);\n      } finally {\n        _iterator.f();\n      }\n\n      this._registerDependencies(container);\n    }\n  }, {\n    key: \"service\",\n    value: function service(name) {\n      if (!this._container) this.buildContainer();\n      return this._container.service(name);\n    }\n  }]);\n  return ServiceProvider;\n}();\n\nexports[\"default\"] = ServiceProvider;","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    cacheHas = require('./_cacheHas'),\n    createSet = require('./_createSet'),\n    setToArray = require('./_setToArray');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseUniq;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","var mapCacheClear = require('./_mapCacheClear'),\n    mapCacheDelete = require('./_mapCacheDelete'),\n    mapCacheGet = require('./_mapCacheGet'),\n    mapCacheHas = require('./_mapCacheHas'),\n    mapCacheSet = require('./_mapCacheSet');\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n","var Hash = require('./_Hash'),\n    ListCache = require('./_ListCache'),\n    Map = require('./_Map');\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nmodule.exports = mapCacheClear;\n","var hashClear = require('./_hashClear'),\n    hashDelete = require('./_hashDelete'),\n    hashGet = require('./_hashGet'),\n    hashHas = require('./_hashHas'),\n    hashSet = require('./_hashSet');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n","var nativeCreate = require('./_nativeCreate');\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nmodule.exports = hashClear;\n","var isFunction = require('./isFunction'),\n    isMasked = require('./_isMasked'),\n    isObject = require('./isObject'),\n    toSource = require('./_toSource');\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","var Symbol = require('./_Symbol');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nmodule.exports = getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","var coreJsData = require('./_coreJsData');\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","var root = require('./_root');\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nmodule.exports = toSource;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = hashDelete;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nmodule.exports = hashGet;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nmodule.exports = hashHas;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nmodule.exports = hashSet;\n","var listCacheClear = require('./_listCacheClear'),\n    listCacheDelete = require('./_listCacheDelete'),\n    listCacheGet = require('./_listCacheGet'),\n    listCacheHas = require('./_listCacheHas'),\n    listCacheSet = require('./_listCacheSet');\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nmodule.exports = listCacheClear;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nmodule.exports = listCacheDelete;\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nmodule.exports = listCacheGet;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nmodule.exports = listCacheHas;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nmodule.exports = listCacheSet;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n","var getMapData = require('./_getMapData');\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = mapCacheDelete;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nmodule.exports = isKeyable;\n","var getMapData = require('./_getMapData');\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nmodule.exports = mapCacheGet;\n","var getMapData = require('./_getMapData');\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nmodule.exports = mapCacheHas;\n","var getMapData = require('./_getMapData');\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nmodule.exports = mapCacheSet;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","var Set = require('./_Set'),\n    noop = require('./noop'),\n    setToArray = require('./_setToArray');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nmodule.exports = createSet;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n","/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nmodule.exports = noop;\n","var baseValues = require('./_baseValues'),\n    keys = require('./keys');\n\n/**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\nfunction values(object) {\n  return object == null ? [] : baseValues(object, keys(object));\n}\n\nmodule.exports = values;\n","var arrayMap = require('./_arrayMap');\n\n/**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\nfunction baseValues(object, props) {\n  return arrayMap(props, function(key) {\n    return object[key];\n  });\n}\n\nmodule.exports = baseValues;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeys = require('./_baseKeys'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","var baseTimes = require('./_baseTimes'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isIndex = require('./_isIndex'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","var baseIsArguments = require('./_baseIsArguments'),\n    isObjectLike = require('./isObjectLike');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","var root = require('./_root'),\n    stubFalse = require('./stubFalse');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nmodule.exports = isBuffer;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = stubFalse;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n","var baseIsTypedArray = require('./_baseIsTypedArray'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nmodule.exports = isTypedArray;\n","var baseGetTag = require('./_baseGetTag'),\n    isLength = require('./isLength'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nmodule.exports = baseIsTypedArray;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nmodule.exports = baseUnary;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n","var isPrototype = require('./_isPrototype'),\n    nativeKeys = require('./_nativeKeys');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeys;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nmodule.exports = isPrototype;\n","var overArg = require('./_overArg');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nmodule.exports = nativeKeys;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nmodule.exports = overArg;\n","var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n","\n/**\n * Topological sorting function\n *\n * @param {Array} edges\n * @returns {Array}\n */\n\nmodule.exports = function(edges) {\n  return toposort(uniqueNodes(edges), edges)\n}\n\nmodule.exports.array = toposort\n\nfunction toposort(nodes, edges) {\n  var cursor = nodes.length\n    , sorted = new Array(cursor)\n    , visited = {}\n    , i = cursor\n    // Better data structures make algorithm much faster.\n    , outgoingEdges = makeOutgoingEdges(edges)\n    , nodesHash = makeNodesHash(nodes)\n\n  // check for unknown nodes\n  edges.forEach(function(edge) {\n    if (!nodesHash.has(edge[0]) || !nodesHash.has(edge[1])) {\n      throw new Error('Unknown node. There is an unknown node in the supplied edges.')\n    }\n  })\n\n  while (i--) {\n    if (!visited[i]) visit(nodes[i], i, new Set())\n  }\n\n  return sorted\n\n  function visit(node, i, predecessors) {\n    if(predecessors.has(node)) {\n      var nodeRep\n      try {\n        nodeRep = \", node was:\" + JSON.stringify(node)\n      } catch(e) {\n        nodeRep = \"\"\n      }\n      throw new Error('Cyclic dependency' + nodeRep)\n    }\n\n    if (!nodesHash.has(node)) {\n      throw new Error('Found unknown node. Make sure to provided all involved nodes. Unknown node: '+JSON.stringify(node))\n    }\n\n    if (visited[i]) return;\n    visited[i] = true\n\n    var outgoing = outgoingEdges.get(node) || new Set()\n    outgoing = Array.from(outgoing)\n\n    if (i = outgoing.length) {\n      predecessors.add(node)\n      do {\n        var child = outgoing[--i]\n        visit(child, nodesHash.get(child), predecessors)\n      } while (i)\n      predecessors.delete(node)\n    }\n\n    sorted[--cursor] = node\n  }\n}\n\nfunction uniqueNodes(arr){\n  var res = new Set()\n  for (var i = 0, len = arr.length; i < len; i++) {\n    var edge = arr[i]\n    res.add(edge[0])\n    res.add(edge[1])\n  }\n  return Array.from(res)\n}\n\nfunction makeOutgoingEdges(arr){\n  var edges = new Map()\n  for (var i = 0, len = arr.length; i < len; i++) {\n    var edge = arr[i]\n    if (!edges.has(edge[0])) edges.set(edge[0], new Set())\n    if (!edges.has(edge[1])) edges.set(edge[1], new Set())\n    edges.get(edge[0]).add(edge[1])\n  }\n  return edges\n}\n\nfunction makeNodesHash(arr){\n  var res = new Map()\n  for (var i = 0, len = arr.length; i < len; i++) {\n    res.set(arr[i], i)\n  }\n  return res\n}\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _ServiceType = _interopRequireDefault(require(\"./ServiceType\"));\n\nvar _ServiceBase2 = _interopRequireDefault(require(\"./ServiceBase\"));\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\n/**\n *\n */\nvar LocalService = /*#__PURE__*/function (_ServiceBase) {\n  (0, _inherits2[\"default\"])(LocalService, _ServiceBase);\n\n  var _super = _createSuper(LocalService);\n\n  /**\n   * @param {string} name\n   * @param {string[]} dependencies\n   */\n  function LocalService(name) {\n    var dependencies = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n    (0, _classCallCheck2[\"default\"])(this, LocalService);\n    return _super.call(this, _ServiceType[\"default\"].LOCAL, name, dependencies);\n  }\n\n  return LocalService;\n}(_ServiceBase2[\"default\"]);\n\nvar _default = LocalService;\nexports[\"default\"] = _default;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _ServiceType = _interopRequireDefault(require(\"./ServiceType\"));\n\nvar _ServiceBase2 = _interopRequireDefault(require(\"./ServiceBase\"));\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\n/**\n *\n */\nvar PublicService = /*#__PURE__*/function (_ServiceBase) {\n  (0, _inherits2[\"default\"])(PublicService, _ServiceBase);\n\n  var _super = _createSuper(PublicService);\n\n  /**\n   * @param {string} name\n   * @param {string[]} dependencies\n   */\n  function PublicService(name) {\n    var dependencies = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n    (0, _classCallCheck2[\"default\"])(this, PublicService);\n    return _super.call(this, _ServiceType[\"default\"].PUBLIC, name, dependencies);\n  }\n\n  return PublicService;\n}(_ServiceBase2[\"default\"]);\n\nvar _default = PublicService;\nexports[\"default\"] = _default;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _ServiceType = _interopRequireDefault(require(\"./ServiceType\"));\n\nvar _ServiceBase2 = _interopRequireDefault(require(\"./ServiceBase\"));\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\n/**\n *\n */\nvar PrivateService = /*#__PURE__*/function (_ServiceBase) {\n  (0, _inherits2[\"default\"])(PrivateService, _ServiceBase);\n\n  var _super = _createSuper(PrivateService);\n\n  /**\n   * @param {string} name\n   * @param {string[]} dependencies\n   */\n  function PrivateService(name) {\n    var dependencies = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n    (0, _classCallCheck2[\"default\"])(this, PrivateService);\n    return _super.call(this, _ServiceType[\"default\"].PRIVATE, name, dependencies);\n  }\n\n  return PrivateService;\n}(_ServiceBase2[\"default\"]);\n\nvar _default = PrivateService;\nexports[\"default\"] = _default;","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <http://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nvar base64 = require('base64-js')\nvar ieee754 = require('ieee754')\nvar isArray = require('isarray')\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Use Object implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * Due to various browser bugs, sometimes the Object implementation will be used even\n * when the browser supports typed arrays.\n *\n * Note:\n *\n *   - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,\n *     See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.\n *\n *   - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.\n *\n *   - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of\n *     incorrect length in some situations.\n\n * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they\n * get the Object implementation, which is slower but behaves correctly.\n */\nBuffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined\n  ? global.TYPED_ARRAY_SUPPORT\n  : typedArraySupport()\n\n/*\n * Export kMaxLength after typed array support is determined.\n */\nexports.kMaxLength = kMaxLength()\n\nfunction typedArraySupport () {\n  try {\n    var arr = new Uint8Array(1)\n    arr.__proto__ = {__proto__: Uint8Array.prototype, foo: function () { return 42 }}\n    return arr.foo() === 42 && // typed array instances can be augmented\n        typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`\n        arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray`\n  } catch (e) {\n    return false\n  }\n}\n\nfunction kMaxLength () {\n  return Buffer.TYPED_ARRAY_SUPPORT\n    ? 0x7fffffff\n    : 0x3fffffff\n}\n\nfunction createBuffer (that, length) {\n  if (kMaxLength() < length) {\n    throw new RangeError('Invalid typed array length')\n  }\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    // Return an augmented `Uint8Array` instance, for best performance\n    that = new Uint8Array(length)\n    that.__proto__ = Buffer.prototype\n  } else {\n    // Fallback: Return an object instance of the Buffer class\n    if (that === null) {\n      that = new Buffer(length)\n    }\n    that.length = length\n  }\n\n  return that\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n    return new Buffer(arg, encodingOrOffset, length)\n  }\n\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new Error(\n        'If encoding is specified then the first argument must be a string'\n      )\n    }\n    return allocUnsafe(this, arg)\n  }\n  return from(this, arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\n// TODO: Legacy, not needed anymore. Remove in next major version.\nBuffer._augment = function (arr) {\n  arr.__proto__ = Buffer.prototype\n  return arr\n}\n\nfunction from (that, value, encodingOrOffset, length) {\n  if (typeof value === 'number') {\n    throw new TypeError('\"value\" argument must not be a number')\n  }\n\n  if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {\n    return fromArrayBuffer(that, value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'string') {\n    return fromString(that, value, encodingOrOffset)\n  }\n\n  return fromObject(that, value)\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(null, value, encodingOrOffset, length)\n}\n\nif (Buffer.TYPED_ARRAY_SUPPORT) {\n  Buffer.prototype.__proto__ = Uint8Array.prototype\n  Buffer.__proto__ = Uint8Array\n  if (typeof Symbol !== 'undefined' && Symbol.species &&\n      Buffer[Symbol.species] === Buffer) {\n    // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\n    Object.defineProperty(Buffer, Symbol.species, {\n      value: null,\n      configurable: true\n    })\n  }\n}\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be a number')\n  } else if (size < 0) {\n    throw new RangeError('\"size\" argument must not be negative')\n  }\n}\n\nfunction alloc (that, size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(that, size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpretted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(that, size).fill(fill, encoding)\n      : createBuffer(that, size).fill(fill)\n  }\n  return createBuffer(that, size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(null, size, fill, encoding)\n}\n\nfunction allocUnsafe (that, size) {\n  assertSize(size)\n  that = createBuffer(that, size < 0 ? 0 : checked(size) | 0)\n  if (!Buffer.TYPED_ARRAY_SUPPORT) {\n    for (var i = 0; i < size; ++i) {\n      that[i] = 0\n    }\n  }\n  return that\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(null, size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(null, size)\n}\n\nfunction fromString (that, string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('\"encoding\" must be a valid string encoding')\n  }\n\n  var length = byteLength(string, encoding) | 0\n  that = createBuffer(that, length)\n\n  var actual = that.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    that = that.slice(0, actual)\n  }\n\n  return that\n}\n\nfunction fromArrayLike (that, array) {\n  var length = array.length < 0 ? 0 : checked(array.length) | 0\n  that = createBuffer(that, length)\n  for (var i = 0; i < length; i += 1) {\n    that[i] = array[i] & 255\n  }\n  return that\n}\n\nfunction fromArrayBuffer (that, array, byteOffset, length) {\n  array.byteLength // this throws if `array` is not a valid ArrayBuffer\n\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\\'offset\\' is out of bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\\'length\\' is out of bounds')\n  }\n\n  if (byteOffset === undefined && length === undefined) {\n    array = new Uint8Array(array)\n  } else if (length === undefined) {\n    array = new Uint8Array(array, byteOffset)\n  } else {\n    array = new Uint8Array(array, byteOffset, length)\n  }\n\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    // Return an augmented `Uint8Array` instance, for best performance\n    that = array\n    that.__proto__ = Buffer.prototype\n  } else {\n    // Fallback: Return an object instance of the Buffer class\n    that = fromArrayLike(that, array)\n  }\n  return that\n}\n\nfunction fromObject (that, obj) {\n  if (Buffer.isBuffer(obj)) {\n    var len = checked(obj.length) | 0\n    that = createBuffer(that, len)\n\n    if (that.length === 0) {\n      return that\n    }\n\n    obj.copy(that, 0, 0, len)\n    return that\n  }\n\n  if (obj) {\n    if ((typeof ArrayBuffer !== 'undefined' &&\n        obj.buffer instanceof ArrayBuffer) || 'length' in obj) {\n      if (typeof obj.length !== 'number' || isnan(obj.length)) {\n        return createBuffer(that, 0)\n      }\n      return fromArrayLike(that, obj)\n    }\n\n    if (obj.type === 'Buffer' && isArray(obj.data)) {\n      return fromArrayLike(that, obj.data)\n    }\n  }\n\n  throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < kMaxLength()` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= kMaxLength()) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + kMaxLength().toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return !!(b != null && b._isBuffer)\n}\n\nBuffer.compare = function compare (a, b) {\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError('Arguments must be Buffers')\n  }\n\n  if (a === b) return 0\n\n  var x = a.length\n  var y = b.length\n\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  var i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  var buffer = Buffer.allocUnsafe(length)\n  var pos = 0\n  for (i = 0; i < list.length; ++i) {\n    var buf = list[i]\n    if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    }\n    buf.copy(buffer, pos)\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&\n      (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    string = '' + string\n  }\n\n  var len = string.length\n  if (len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  var loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n      case undefined:\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) return utf8ToBytes(string).length // assume utf8\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  var loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coersion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect\n// Buffer instances.\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  var i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  var len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (var i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  var len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (var i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  var len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (var i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  var length = this.length | 0\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  var str = ''\n  var max = exports.INSPECT_MAX_BYTES\n  if (this.length > 0) {\n    str = this.toString('hex', 0, max).match(/.{2}/g).join(' ')\n    if (this.length > max) str += ' ... '\n  }\n  return '<Buffer ' + str + '>'\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError('Argument must be a Buffer')\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  var x = thisEnd - thisStart\n  var y = end - start\n  var len = Math.min(x, y)\n\n  var thisCopy = this.slice(thisStart, thisEnd)\n  var targetCopy = target.slice(start, end)\n\n  for (var i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset  // Coerce to Number.\n  if (isNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (Buffer.TYPED_ARRAY_SUPPORT &&\n        typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  var indexSize = 1\n  var arrLength = arr.length\n  var valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  var i\n  if (dir) {\n    var foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      var found = true\n      for (var j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  var remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  // must be an even number of digits\n  var strLen = string.length\n  if (strLen % 2 !== 0) throw new TypeError('Invalid hex string')\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  for (var i = 0; i < length; ++i) {\n    var parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (isNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction latin1Write (buf, string, offset, length) {\n  return asciiWrite(buf, string, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset | 0\n    if (isFinite(length)) {\n      length = length | 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  // legacy write(string, encoding, offset, length) - remove in v0.13\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  var remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  var loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n        return asciiWrite(this, string, offset, length)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Write(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  var res = []\n\n  var i = start\n  while (i < end) {\n    var firstByte = buf[i]\n    var codePoint = null\n    var bytesPerSequence = (firstByte > 0xEF) ? 4\n      : (firstByte > 0xDF) ? 3\n      : (firstByte > 0xBF) ? 2\n      : 1\n\n    if (i + bytesPerSequence <= end) {\n      var secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nvar MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  var len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  var res = ''\n  var i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  var ret = ''\n  end = Math.min(buf.length, end)\n\n  for (var i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  var ret = ''\n  end = Math.min(buf.length, end)\n\n  for (var i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  var len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  var out = ''\n  for (var i = start; i < end; ++i) {\n    out += toHex(buf[i])\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  var bytes = buf.slice(start, end)\n  var res = ''\n  for (var i = 0; i < bytes.length; i += 2) {\n    res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256)\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  var len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  var newBuf\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    newBuf = this.subarray(start, end)\n    newBuf.__proto__ = Buffer.prototype\n  } else {\n    var sliceLen = end - start\n    newBuf = new Buffer(sliceLen, undefined)\n    for (var i = 0; i < sliceLen; ++i) {\n      newBuf[i] = this[i + start]\n    }\n  }\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var val = this[offset]\n  var mul = 1\n  var i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  var val = this[offset + --byteLength]\n  var mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var val = this[offset]\n  var mul = 1\n  var i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var i = byteLength\n  var mul = 1\n  var val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  var val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  var val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) {\n    var maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  var mul = 1\n  var i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) {\n    var maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  var i = byteLength - 1\n  var mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nfunction objectWriteUInt16 (buf, value, offset, littleEndian) {\n  if (value < 0) value = 0xffff + value + 1\n  for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) {\n    buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>\n      (littleEndian ? i : 1 - i) * 8\n  }\n}\n\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value & 0xff)\n    this[offset + 1] = (value >>> 8)\n  } else {\n    objectWriteUInt16(this, value, offset, true)\n  }\n  return offset + 2\n}\n\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 8)\n    this[offset + 1] = (value & 0xff)\n  } else {\n    objectWriteUInt16(this, value, offset, false)\n  }\n  return offset + 2\n}\n\nfunction objectWriteUInt32 (buf, value, offset, littleEndian) {\n  if (value < 0) value = 0xffffffff + value + 1\n  for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) {\n    buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff\n  }\n}\n\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset + 3] = (value >>> 24)\n    this[offset + 2] = (value >>> 16)\n    this[offset + 1] = (value >>> 8)\n    this[offset] = (value & 0xff)\n  } else {\n    objectWriteUInt32(this, value, offset, true)\n  }\n  return offset + 4\n}\n\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 24)\n    this[offset + 1] = (value >>> 16)\n    this[offset + 2] = (value >>> 8)\n    this[offset + 3] = (value & 0xff)\n  } else {\n    objectWriteUInt32(this, value, offset, false)\n  }\n  return offset + 4\n}\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) {\n    var limit = Math.pow(2, 8 * byteLength - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  var i = 0\n  var mul = 1\n  var sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) {\n    var limit = Math.pow(2, 8 * byteLength - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  var i = byteLength - 1\n  var mul = 1\n  var sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value & 0xff)\n    this[offset + 1] = (value >>> 8)\n  } else {\n    objectWriteUInt16(this, value, offset, true)\n  }\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 8)\n    this[offset + 1] = (value & 0xff)\n  } else {\n    objectWriteUInt16(this, value, offset, false)\n  }\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value & 0xff)\n    this[offset + 1] = (value >>> 8)\n    this[offset + 2] = (value >>> 16)\n    this[offset + 3] = (value >>> 24)\n  } else {\n    objectWriteUInt32(this, value, offset, true)\n  }\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 24)\n    this[offset + 1] = (value >>> 16)\n    this[offset + 2] = (value >>> 8)\n    this[offset + 3] = (value & 0xff)\n  } else {\n    objectWriteUInt32(this, value, offset, false)\n  }\n  return offset + 4\n}\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  var len = end - start\n  var i\n\n  if (this === target && start < targetStart && targetStart < end) {\n    // descending copy from end\n    for (i = len - 1; i >= 0; --i) {\n      target[i + targetStart] = this[i + start]\n    }\n  } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {\n    // ascending copy from start\n    for (i = 0; i < len; ++i) {\n      target[i + targetStart] = this[i + start]\n    }\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, start + len),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (val.length === 1) {\n      var code = val.charCodeAt(0)\n      if (code < 256) {\n        val = code\n      }\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  var i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    var bytes = Buffer.isBuffer(val)\n      ? val\n      : utf8ToBytes(new Buffer(val, encoding).toString())\n    var len = bytes.length\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// HELPER FUNCTIONS\n// ================\n\nvar INVALID_BASE64_RE = /[^+\\/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = stringtrim(str).replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction stringtrim (str) {\n  if (str.trim) return str.trim()\n  return str.replace(/^\\s+|\\s+$/g, '')\n}\n\nfunction toHex (n) {\n  if (n < 16) return '0' + n.toString(16)\n  return n.toString(16)\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  var codePoint\n  var length = string.length\n  var leadSurrogate = null\n  var bytes = []\n\n  for (var i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  var byteArray = []\n  for (var i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  var c, hi, lo\n  var byteArray = []\n  for (var i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  for (var i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\nfunction isnan (val) {\n  return val !== val // eslint-disable-line no-self-compare\n}\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(\n      uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)\n    ))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n","exports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n  return toString.call(arr) == '[object Array]';\n};\n","var arrayLikeToArray = require(\"./arrayLikeToArray\");\n\nfunction _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) return arrayLikeToArray(arr);\n}\n\nmodule.exports = _arrayWithoutHoles;","function _iterableToArray(iter) {\n  if (typeof Symbol !== \"undefined\" && Symbol.iterator in Object(iter)) return Array.from(iter);\n}\n\nmodule.exports = _iterableToArray;","function _nonIterableSpread() {\n  throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nmodule.exports = _nonIterableSpread;","import { LocalService } from '@makerdao/services-core';\nimport VoteProxy from './VoteProxy';\nimport { MKR, VOTE_PROXY_FACTORY, ZERO_ADDRESS } from './utils/constants';\n// maybe a \"dai.js developer utils\" package is useful?\nimport { getCurrency } from './utils/helpers';\nimport voteProxyAbi from '../contracts/abis/VoteProxy.json';\n\nexport default class VoteProxyService extends LocalService {\n  constructor(name = 'voteProxy') {\n    super(name, ['smartContract', 'chief']);\n  }\n\n  // Writes -----------------------------------------------\n\n  lock(proxyAddress, amt, unit = MKR) {\n    const mkrAmt = getCurrency(amt, unit).toFixed('wei');\n    return this._proxyContract(proxyAddress).lock(mkrAmt);\n  }\n\n  free(proxyAddress, amt, unit = MKR) {\n    const mkrAmt = getCurrency(amt, unit).toFixed('wei');\n    return this._proxyContract(proxyAddress).free(mkrAmt);\n  }\n\n  freeAll(proxyAddress) {\n    return this._proxyContract(proxyAddress).freeAll();\n  }\n\n  voteExec(proxyAddress, picks) {\n    if (Array.isArray(picks))\n      return this._proxyContract(proxyAddress)['vote(address[])'](picks);\n    return this._proxyContract(proxyAddress)['vote(bytes32)'](picks);\n  }\n\n  // Reads ------------------------------------------------\n\n  async getVotedProposalAddresses(proxyAddress) {\n    const _slate = await this.get('chief').getVotedSlate(proxyAddress);\n    return this.get('chief').getSlateAddresses(_slate);\n  }\n\n  async getVoteProxy(addressToCheck) {\n    const {\n      hasProxy,\n      role,\n      address: proxyAddress\n    } = await this._getProxyStatus(addressToCheck);\n    if (!hasProxy) return { hasProxy, voteProxy: null };\n    const otherRole = role === 'hot' ? 'cold' : 'hot';\n    const otherAddress = await this._getAddressOfRole(proxyAddress, otherRole);\n    return {\n      hasProxy,\n      voteProxy: new VoteProxy({\n        voteProxyService: this,\n        proxyAddress,\n        [`${role}Address`]: addressToCheck,\n        [`${otherRole}Address`]: otherAddress\n      })\n    };\n  }\n\n  // Internal --------------------------------------------\n\n  _proxyContract(address) {\n    return this.get('smartContract').getContractByAddressAndAbi(\n      address,\n      voteProxyAbi\n    );\n  }\n\n  _proxyFactoryContract() {\n    return this.get('smartContract').getContractByName(VOTE_PROXY_FACTORY);\n  }\n\n  async _getProxyStatus(address) {\n    const [proxyAddressCold, proxyAddressHot] = await Promise.all([\n      this._proxyFactoryContract().coldMap(address),\n      this._proxyFactoryContract().hotMap(address)\n    ]);\n    if (proxyAddressCold !== ZERO_ADDRESS)\n      return { role: 'cold', address: proxyAddressCold, hasProxy: true };\n    if (proxyAddressHot !== ZERO_ADDRESS)\n      return { role: 'hot', address: proxyAddressHot, hasProxy: true };\n    return { role: null, address: '', hasProxy: false };\n  }\n\n  _getAddressOfRole(proxyAddress, role) {\n    if (role === 'hot') return this._proxyContract(proxyAddress).hot();\n    else if (role === 'cold') return this._proxyContract(proxyAddress).cold();\n    return null;\n  }\n}\n\n// add a few Chief Service methods to the Vote Proxy Service\nObject.assign(\n  VoteProxyService.prototype,\n  ['getVotedSlate', 'getNumDeposits'].reduce((acc, name) => {\n    acc[name] = function(...args) {\n      return this.get('chief')[name](...args);\n    };\n    return acc;\n  }, {})\n);\n","export default class VoteProxy {\n  constructor({ voteProxyService, proxyAddress, coldAddress, hotAddress }) {\n    this._voteProxyService = voteProxyService;\n    this._proxyAddress = proxyAddress;\n    this._coldAddress = coldAddress;\n    this._hotAddress = hotAddress;\n  }\n\n  getProxyAddress() {\n    return this._proxyAddress;\n  }\n\n  getColdAddress() {\n    return this._coldAddress;\n  }\n\n  getHotAddress() {\n    return this._hotAddress;\n  }\n}\n\nconst passthroughMethods = [\n  'lock',\n  'free',\n  'voteExec',\n  'getNumDeposits',\n  'getVotedProposalAddresses'\n];\n\nObject.assign(\n  VoteProxy.prototype,\n  passthroughMethods.reduce((acc, name) => {\n    acc[name] = function(...args) {\n      return this._voteProxyService[name](this._proxyAddress, ...args);\n    };\n    return acc;\n  }, {})\n);\n","import { LocalService } from '@makerdao/services-core';\nimport { VOTE_PROXY_FACTORY } from './utils/constants';\nimport ApproveLinkTransaction from './ApproveLinkTransaction';\n\nexport default class VoteProxyFactoryService extends LocalService {\n  constructor(name = 'voteProxyFactory') {\n    super(name, ['smartContract', 'voteProxy', 'transactionManager']);\n  }\n\n  initiateLink(hotAddress) {\n    return this._proxyFactoryContract().initiateLink(hotAddress);\n  }\n\n  approveLink(coldAddress) {\n    const tx = new ApproveLinkTransaction(\n      this._proxyFactoryContract(),\n      this.get('transactionManager')\n    );\n    return tx.build('approveLink', [coldAddress]);\n  }\n\n  breakLink() {\n    return this._proxyFactoryContract().breakLink();\n  }\n\n  getVoteProxy(address) {\n    return this.get('voteProxy').getVoteProxy(address);\n  }\n\n  _proxyFactoryContract() {\n    return this.get('smartContract').getContractByName(VOTE_PROXY_FACTORY);\n  }\n}\n","export default class ApproveLinkTransaction {\n  constructor(contract, transactionManager) {\n    this._contract = contract;\n    this._txMgr = transactionManager;\n  }\n\n  get fees() {\n    return this._txMgr.getTransaction(this.promise).fees();\n  }\n\n  get timeStamp() {\n    return this._txMgr.getTransaction(this.promise).timeStamp();\n  }\n\n  get timeStampSubmitted() {\n    return this._txMgr.getTransaction(this.promise).timeStampSubmitted();\n  }\n\n  build(method, args) {\n    const promise = (async () => {\n      await 0;\n      const txo = await this._contract[method](...[...args, { promise }]);\n      this._parseLogs(txo.receipt.logs);\n      return this;\n    })();\n    this.promise = promise;\n    return promise;\n  }\n\n  _parseLogs(logs) {\n    const { LinkConfirmed } = this._contract.interface.events;\n    const web3 = this._txMgr.get('web3')._web3;\n    const topic = web3.utils.keccak256(\n      web3.utils.toHex(LinkConfirmed.signature)\n    );\n    const receiptEvent = logs.filter(\n      e => e.topics[0].toLowerCase() === topic.toLowerCase() //filter for LinkConfirmed events\n    );\n    const parsedLog = LinkConfirmed.parse(\n      receiptEvent[0].topics,\n      receiptEvent[0].data\n    );\n    this.proxyAddress = parsedLog['voteProxy'];\n  }\n}\n","import { PrivateService } from '@makerdao/services-core';\nimport { POLLING, BATCH_POLLING } from './utils/constants';\nimport { MKR } from './utils/constants';\nimport BigNumber from 'bignumber.js';\nimport { fromBuffer, toBuffer, paddedArray } from './utils/helpers';\n\nconst POSTGRES_MAX_INT = 2147483647;\n\nconst MAX_ROUNDS = 32;\n\nexport default class GovPollingService extends PrivateService {\n  constructor(name = 'govPolling') {\n    super(name, ['smartContract', 'govQueryApi', 'token']);\n  }\n\n  async createPoll(startDate, endDate, multiHash, url) {\n    const txo = await this._pollingContract().createPoll(\n      startDate,\n      endDate,\n      multiHash,\n      url\n    );\n    const pollId = parseInt(txo.receipt.logs[0].topics[2]);\n    return pollId;\n  }\n\n  withdrawPoll(pollId) {\n    return this._pollingContract().withdrawPoll(pollId);\n  }\n\n  vote(pollIds, optionIds) {\n    if (pollIds.length !== optionIds.length || pollIds.length === 0)\n      throw new Error(\n        'poll id array and option id array must be the same length and have a non-zero number of elements'\n      );\n    if (pollIds.length === 1) {\n      const func = 'vote(uint256,uint256)';\n      return this._batchPollingContract()[func](pollIds[0], optionIds[0]);\n    } else {\n      const func = 'vote(uint256[],uint256[])';\n      return this._batchPollingContract()[func](pollIds, optionIds);\n    }\n  }\n\n  voteRankedChoice(pollId, rankings) {\n    const byteArray = new Uint8Array(32);\n    rankings.forEach((optionIndex, i) => {\n      byteArray[byteArray.length - i - 1] = optionIndex + 1;\n    });\n    const optionId = fromBuffer(byteArray).toString();\n    return this._batchPollingContract().vote(pollId, optionId);\n  }\n\n  _pollingContract() {\n    return this.get('smartContract').getContractByName(POLLING);\n  }\n\n  _batchPollingContract() {\n    return this.get('smartContract').getContractByName(BATCH_POLLING);\n  }\n\n  //--- cache queries\n\n  async getPoll(multiHash) {\n    const polls = await this.getAllWhitelistedPolls();\n    const filtered = polls.filter(p => p.multiHash === multiHash);\n    let lowest = Infinity;\n    let lowestPoll;\n    for (let i = 0; i < filtered.length; i++) {\n      if (filtered[i].pollId < lowest) {\n        lowest = filtered[i].pollId;\n        lowestPoll = filtered[i];\n      }\n    }\n    return lowestPoll;\n  }\n\n  async _getPoll(pollId) {\n    const polls = await this.getAllWhitelistedPolls();\n    return polls.find(p => parseInt(p.pollId) === parseInt(pollId));\n  }\n\n  async getAllWhitelistedPolls() {\n    if (this.polls) return this.polls;\n    this.polls = await this.get('govQueryApi').getAllWhitelistedPolls();\n    return this.polls;\n  }\n\n  refresh() {\n    this.polls = null;\n  }\n\n  async getOptionVotingFor(address, pollId) {\n    return this.get('govQueryApi').getOptionVotingFor(\n      address.toLowerCase(),\n      pollId\n    );\n  }\n\n  async getOptionVotingForRankedChoice(address, pollId) {\n    const optionIdRaw = await this.get(\n      'govQueryApi'\n    ).getOptionVotingForRankedChoice(address.toLowerCase(), pollId);\n    if (!optionIdRaw) return [];\n    const ballotBuffer = toBuffer(optionIdRaw, { endian: 'little' });\n    const ballot = paddedArray(32 - ballotBuffer.length, ballotBuffer);\n    return ballot.reverse().filter(choice => choice !== 0 && choice !== '0');\n  }\n\n  async getAllOptionsVotingFor(address) {\n    const options = await this.get('govQueryApi').getAllOptionsVotingFor(\n      address.toLowerCase()\n    );\n    if (!options) return [];\n    return options.map(o => {\n      let rankedChoiceOption = null;\n      if (o.optionIdRaw) {\n        const ballotBuffer = toBuffer(o.optionIdRaw, { endian: 'little' });\n        const ballot = paddedArray(32 - ballotBuffer.length, ballotBuffer);\n        rankedChoiceOption = ballot\n          .reverse()\n          .filter(choice => choice !== 0 && choice !== '0');\n      }\n      return {\n        pollId: o.pollId,\n        option: o.optionId,\n        rankedChoiceOption\n      };\n    });\n  }\n\n  async getNumUniqueVoters(pollId) {\n    return this.get('govQueryApi').getNumUniqueVoters(pollId);\n  }\n\n  async getMkrWeight(address) {\n    const weight = await this.get('govQueryApi').getMkrWeight(\n      address.toLowerCase(),\n      POSTGRES_MAX_INT\n    );\n    return MKR(weight);\n  }\n\n  async getMkrAmtVoted(pollId) {\n    const { endDate } = await this._getPoll(pollId);\n    const endUnix = Math.floor(endDate / 1000);\n    const weights = await this.get('govQueryApi').getMkrSupport(\n      pollId,\n      endUnix\n    );\n    return MKR(weights.reduce((acc, cur) => acc + cur.mkrSupport, 0));\n  }\n\n  async getMkrAmtVotedRankedChoice(pollId) {\n    const { endDate } = await this._getPoll(pollId);\n    const endUnix = Math.floor(endDate / 1000);\n    const weights = await this.get('govQueryApi').getMkrSupportRankedChoice(\n      pollId,\n      endUnix\n    );\n    return MKR(\n      weights.reduce((acc, cur) => acc + parseFloat(cur.mkrSupport), 0)\n    );\n  }\n\n  async getTallyRankedChoiceIrv(pollId) {\n    const { endDate } = await this._getPoll(pollId);\n    const endUnix = Math.floor(endDate / 1000);\n    const votes = await this.get('govQueryApi').getMkrSupportRankedChoice(\n      pollId,\n      endUnix\n    );\n    const totalMkrParticipation = votes.reduce(\n      (acc, cur) => BigNumber(cur.mkrSupport || 0).plus(acc),\n      BigNumber(0)\n    );\n\n    const tally = {\n      rounds: 1,\n      winner: null,\n      totalMkrParticipation,\n      options: {}\n    };\n    const defaultOptionObj = {\n      firstChoice: BigNumber(0),\n      transfer: BigNumber(0),\n      winner: false,\n      eliminated: false\n    };\n\n    if (votes.length === 0) {\n      return tally;\n    }\n\n    // run the first round\n    votes.forEach(vote => {\n      vote.choice = vote.ballot.pop();\n      if (!tally.options[vote.choice])\n        tally.options[vote.choice] = { ...defaultOptionObj };\n\n      tally.options[vote.choice].firstChoice = BigNumber(\n        tally.options[vote.choice].firstChoice\n      ).plus(vote.mkrSupport || 0);\n    });\n\n    // does any candidate have the majority after the first round?\n    Object.entries(tally.options).forEach(([option, { firstChoice }]) => {\n      if (firstChoice.gt(totalMkrParticipation.div(2))) tally.winner = option;\n    });\n\n    // if so, we're done. Return the winner\n    if (tally.winner) {\n      tally.options[tally.winner].winner = true;\n      return tally;\n    }\n\n    // if we couldn't find a winner based on first preferences, run additionaly irv rounds until we find one\n    while (!tally.winner) {\n      tally.rounds++;\n\n      // eliminate the weakest candidate\n      const filteredOptions = Object.entries(tally.options).filter(\n        ([, optionDetails]) => !optionDetails.eliminated\n      );\n\n      const [optionToEliminate] = filteredOptions.reduce((prv, cur) => {\n        const [, prvVotes] = prv;\n        const [, curVotes] = cur;\n        if (\n          curVotes.firstChoice\n            .plus(curVotes.transfer)\n            .lt(prvVotes.firstChoice.plus(prvVotes.transfer))\n        )\n          return cur;\n        return prv;\n      });\n\n      tally.options[optionToEliminate].eliminated = true;\n      tally.options[optionToEliminate].transfer = BigNumber(0);\n\n      // a vote needs to be moved if...\n      // 1) it's currently for the eliminated candidate\n      // 2) there's another choice further down in the voter's preference list\n      const votesToBeMoved = votes\n        .map((vote, index) => ({ ...vote, index }))\n        .filter(vote => parseInt(vote.choice) === parseInt(optionToEliminate))\n        .filter(vote => vote.ballot[vote.ballot.length - 1] !== 0);\n\n      // move votes to the next choice on their preference list\n      votesToBeMoved.forEach(vote => {\n        votes[vote.index].choice = votes[vote.index].ballot.pop();\n        tally.options[votes[vote.index].choice].transfer = BigNumber(\n          tally.options[votes[vote.index].choice].transfer\n        ).plus(vote.mkrSupport || 0);\n      });\n\n      // look for a candidate with the majority\n      Object.entries(tally.options).forEach(\n        ([option, { firstChoice, transfer }]) => {\n          if (firstChoice.plus(transfer).gt(totalMkrParticipation.div(2)))\n            tally.winner = option;\n        }\n      );\n\n      //if there's no more rounds, or if there is one or fewer options that haven't been eliminated\n      // the winner is the option with the most votes\n      if (\n        (tally.rounds > MAX_ROUNDS && !tally.winner) ||\n        ((filteredOptions.length === 1 || filteredOptions.length === 0) &&\n          !tally.winner)\n      ) {\n        let max = BigNumber(0);\n        let maxOption;\n        Object.entries(tally.options).forEach(\n          ([option, { firstChoice, transfer }]) => {\n            if (firstChoice.plus(transfer).gt(max)) {\n              max = firstChoice.plus(transfer);\n              maxOption = option;\n            }\n          }\n        );\n        tally.winner = maxOption;\n      }\n\n      // sanity checks\n      if (Object.keys(tally.options).length === 2) {\n        // dead tie. this seems super unlikely, but it should be here for completeness\n        // return the tally without declaring a winner\n        return tally;\n      }\n      if (Object.keys(tally.options).length === 1) {\n        // this shouldn't happen\n        throw new Error(`Invalid ranked choice tally ${tally.options}`);\n      }\n\n      // if we couldn't find one, go for another round\n    }\n\n    tally.options[tally.winner].winner = true;\n    return tally;\n  }\n\n  async getPercentageMkrVoted(pollId) {\n    const [voted, total] = await Promise.all([\n      this.getMkrAmtVoted(pollId),\n      this.get('token')\n        .getToken(MKR)\n        .totalSupply()\n    ]);\n    return voted\n      .div(total)\n      .times(100)\n      .toNumber();\n  }\n\n  async getPercentageMkrVotedRankedChoice(pollId) {\n    const [voted, total] = await Promise.all([\n      this.getMkrAmtVotedRankedChoice(pollId),\n      this.get('token')\n        .getToken(MKR)\n        .totalSupply()\n    ]);\n    return voted\n      .div(total)\n      .times(100)\n      .toNumber();\n  }\n\n  async getWinningProposal(pollId) {\n    const { endDate } = await this._getPoll(pollId);\n    const endUnix = Math.floor(endDate / 1000);\n    const currentVotes = await this.get('govQueryApi').getMkrSupport(\n      pollId,\n      endUnix\n    );\n    let max = currentVotes[0];\n    for (let i = 1; i < currentVotes.length; i++) {\n      if (currentVotes[i].mkrSupport > max.mkrSupport) {\n        max = currentVotes[i];\n      }\n    }\n    return max ? max.optionId : 0;\n  }\n}\n","import { PublicService } from '@makerdao/services-core';\nimport assert from 'assert';\nimport {\n  netIdtoSpockUrl,\n  netIdtoSpockUrlStaging,\n  toBuffer,\n  paddedArray\n} from './utils/helpers';\n\nexport default class QueryApi extends PublicService {\n  constructor(name = 'govQueryApi') {\n    super(name, ['web3']);\n    this.queryPromises = {};\n    this.staging = false;\n  }\n\n  async getQueryResponse(serverUrl, query) {\n    const resp = await fetch(serverUrl, {\n      method: 'POST',\n      headers: {\n        Accept: 'application/json',\n        'Content-Type': 'application/json'\n      },\n      body: JSON.stringify({\n        query\n      })\n    });\n    const { data } = await resp.json();\n    assert(data, `error fetching data from ${serverUrl}`);\n    return data;\n  }\n\n  async getQueryResponseMemoized(serverUrl, query) {\n    let cacheKey = `${serverUrl};${query}`;\n    if (this.queryPromises[cacheKey]) return this.queryPromises[cacheKey];\n    this.queryPromises[cacheKey] = this.getQueryResponse(serverUrl, query);\n    return this.queryPromises[cacheKey];\n  }\n\n  initialize(settings) {\n    if (settings.staging) {\n      this.staging = true;\n    }\n  }\n\n  connect() {\n    const network = this.get('web3').network;\n    this.serverUrl = this.staging\n      ? netIdtoSpockUrlStaging(network)\n      : netIdtoSpockUrl(network);\n  }\n\n  async getAllWhitelistedPolls() {\n    const query = `{activePolls {\n      nodes {\n          creator\n          pollId\n          blockCreated\n          startDate\n          endDate\n          multiHash\n          url\n        }\n      }\n    }`;\n\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    return response.activePolls.nodes.map(p => {\n      p.startDate = new Date(p.startDate * 1000);\n      p.endDate = new Date(p.endDate * 1000);\n      return p;\n    });\n  }\n\n  async getNumUniqueVoters(pollId) {\n    const query = `{uniqueVoters(argPollId:${pollId}){\n      nodes\n    }\n    }`;\n\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    return parseInt(response.uniqueVoters.nodes[0]);\n  }\n\n  async getMkrWeight(address, unixTime) {\n    const query = `{totalMkrWeightProxyAndNoProxyByAddressAtTime(argAddress: \"${address}\", argUnix: ${unixTime}){\n      nodes {\n        address\n        weight\n      }\n    }\n    }`;\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    if (!response.totalMkrWeightProxyAndNoProxyByAddressAtTime.nodes[0])\n      return 0;\n    return response.totalMkrWeightProxyAndNoProxyByAddressAtTime.nodes[0]\n      .weight;\n  }\n\n  async getOptionVotingFor(address, pollId) {\n    const query = `{\n      currentVote(argAddress: \"${address}\", argPollId: ${pollId}){\n        nodes{\n          optionId\n        }\n      }\n    }`;\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    if (!response.currentVote.nodes[0]) return null;\n    return response.currentVote.nodes[0].optionId;\n  }\n\n  async getAllOptionsVotingFor(address) {\n    const query = `{\n      allCurrentVotes(argAddress: \"${address}\"){\n        nodes{\n          pollId\n          optionId\n          optionIdRaw\n        }\n      }\n    }`;\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    if (!response.allCurrentVotes.nodes[0]) return null;\n    return response.allCurrentVotes.nodes;\n  }\n\n  async getOptionVotingForRankedChoice(address, pollId) {\n    const query = `{\n      currentVoteRankedChoice(argAddress: \"${address}\", argPollId: ${pollId}){\n        nodes{\n          optionIdRaw\n        }\n      }\n    }`;\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    if (!response.currentVoteRankedChoice.nodes[0]) return null;\n    return response.currentVoteRankedChoice.nodes[0].optionIdRaw;\n  }\n\n  async getBlockNumber(unixTime) {\n    const query = `{\n      timeToBlockNumber(argUnix: ${unixTime}){\n      nodes\n    }\n    }`;\n    const response = await this.getQueryResponseMemoized(this.serverUrl, query);\n    return response.timeToBlockNumber.nodes[0];\n  }\n\n  async getMkrSupportRankedChoice(pollId, unixTime) {\n    const query = `{voteMkrWeightsAtTimeRankedChoice(argPollId: ${pollId}, argUnix: ${unixTime}){\n      nodes{\n        optionIdRaw\n        mkrSupport\n      }\n    }\n    }`;\n    const response = await this.getQueryResponseMemoized(this.serverUrl, query);\n\n    return response.voteMkrWeightsAtTimeRankedChoice.nodes\n      .filter(vote => vote.optionIdRaw !== '0')\n      .map(vote => {\n        const ballotBuffer = toBuffer(vote.optionIdRaw, { endian: 'little' });\n        const ballot = paddedArray(32 - ballotBuffer.length, ballotBuffer);\n        return {\n          ...vote,\n          ballot\n        };\n      });\n  }\n\n  async getMkrSupport(pollId, unixTime) {\n    const query = `{voteOptionMkrWeightsAtTime(argPollId: ${pollId}, argUnix: ${unixTime}){\n    nodes{\n      optionId\n      mkrSupport\n    }\n  }\n  }`;\n    const response = await this.getQueryResponseMemoized(this.serverUrl, query);\n    let weights = response.voteOptionMkrWeightsAtTime.nodes;\n    // We don't want to calculate votes for 0:abstain\n    weights = weights.filter(o => o.optionId !== 0);\n    const totalWeight = weights.reduce((acc, cur) => {\n      const mkrSupport = isNaN(parseFloat(cur.mkrSupport))\n        ? 0\n        : parseFloat(cur.mkrSupport);\n      return acc + mkrSupport;\n    }, 0);\n    return weights.map(o => {\n      const mkrSupport = isNaN(parseFloat(o.mkrSupport))\n        ? 0\n        : parseFloat(o.mkrSupport);\n      o.mkrSupport = mkrSupport;\n      o.percentage = (100 * mkrSupport) / totalWeight;\n      return o;\n    });\n  }\n\n  async getEsmJoins() {\n    const query = `{allEsmJoins {\n      nodes {\n        txFrom\n        txHash\n        joinAmount\n        blockTimestamp\n      }\n  }\n  }`;\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    const joins = response.allEsmJoins.nodes;\n    return joins;\n  }\n}\n","/*\nobject-assign\n(c) Sindre Sorhus\n@license MIT\n*/\n\n'use strict';\n/* eslint-disable no-unused-vars */\nvar getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nvar propIsEnumerable = Object.prototype.propertyIsEnumerable;\n\nfunction toObject(val) {\n\tif (val === null || val === undefined) {\n\t\tthrow new TypeError('Object.assign cannot be called with null or undefined');\n\t}\n\n\treturn Object(val);\n}\n\nfunction shouldUseNative() {\n\ttry {\n\t\tif (!Object.assign) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Detect buggy property enumeration order in older V8 versions.\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=4118\n\t\tvar test1 = new String('abc');  // eslint-disable-line no-new-wrappers\n\t\ttest1[5] = 'de';\n\t\tif (Object.getOwnPropertyNames(test1)[0] === '5') {\n\t\t\treturn false;\n\t\t}\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\t\tvar test2 = {};\n\t\tfor (var i = 0; i < 10; i++) {\n\t\t\ttest2['_' + String.fromCharCode(i)] = i;\n\t\t}\n\t\tvar order2 = Object.getOwnPropertyNames(test2).map(function (n) {\n\t\t\treturn test2[n];\n\t\t});\n\t\tif (order2.join('') !== '0123456789') {\n\t\t\treturn false;\n\t\t}\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\t\tvar test3 = {};\n\t\t'abcdefghijklmnopqrst'.split('').forEach(function (letter) {\n\t\t\ttest3[letter] = letter;\n\t\t});\n\t\tif (Object.keys(Object.assign({}, test3)).join('') !==\n\t\t\t\t'abcdefghijklmnopqrst') {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t} catch (err) {\n\t\t// We don't expect any of the above to throw, but better to be safe.\n\t\treturn false;\n\t}\n}\n\nmodule.exports = shouldUseNative() ? Object.assign : function (target, source) {\n\tvar from;\n\tvar to = toObject(target);\n\tvar symbols;\n\n\tfor (var s = 1; s < arguments.length; s++) {\n\t\tfrom = Object(arguments[s]);\n\n\t\tfor (var key in from) {\n\t\t\tif (hasOwnProperty.call(from, key)) {\n\t\t\t\tto[key] = from[key];\n\t\t\t}\n\t\t}\n\n\t\tif (getOwnPropertySymbols) {\n\t\t\tsymbols = getOwnPropertySymbols(from);\n\t\t\tfor (var i = 0; i < symbols.length; i++) {\n\t\t\t\tif (propIsEnumerable.call(from, symbols[i])) {\n\t\t\t\t\tto[symbols[i]] = from[symbols[i]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn to;\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar getOwnPropertyDescriptors = Object.getOwnPropertyDescriptors ||\n  function getOwnPropertyDescriptors(obj) {\n    var keys = Object.keys(obj);\n    var descriptors = {};\n    for (var i = 0; i < keys.length; i++) {\n      descriptors[keys[i]] = Object.getOwnPropertyDescriptor(obj, keys[i]);\n    }\n    return descriptors;\n  };\n\nvar formatRegExp = /%[sdj%]/g;\nexports.format = function(f) {\n  if (!isString(f)) {\n    var objects = [];\n    for (var i = 0; i < arguments.length; i++) {\n      objects.push(inspect(arguments[i]));\n    }\n    return objects.join(' ');\n  }\n\n  var i = 1;\n  var args = arguments;\n  var len = args.length;\n  var str = String(f).replace(formatRegExp, function(x) {\n    if (x === '%%') return '%';\n    if (i >= len) return x;\n    switch (x) {\n      case '%s': return String(args[i++]);\n      case '%d': return Number(args[i++]);\n      case '%j':\n        try {\n          return JSON.stringify(args[i++]);\n        } catch (_) {\n          return '[Circular]';\n        }\n      default:\n        return x;\n    }\n  });\n  for (var x = args[i]; i < len; x = args[++i]) {\n    if (isNull(x) || !isObject(x)) {\n      str += ' ' + x;\n    } else {\n      str += ' ' + inspect(x);\n    }\n  }\n  return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexports.deprecate = function(fn, msg) {\n  if (typeof process !== 'undefined' && process.noDeprecation === true) {\n    return fn;\n  }\n\n  // Allow for deprecating things in the process of starting up.\n  if (typeof process === 'undefined') {\n    return function() {\n      return exports.deprecate(fn, msg).apply(this, arguments);\n    };\n  }\n\n  var warned = false;\n  function deprecated() {\n    if (!warned) {\n      if (process.throwDeprecation) {\n        throw new Error(msg);\n      } else if (process.traceDeprecation) {\n        console.trace(msg);\n      } else {\n        console.error(msg);\n      }\n      warned = true;\n    }\n    return fn.apply(this, arguments);\n  }\n\n  return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnviron;\nexports.debuglog = function(set) {\n  if (isUndefined(debugEnviron))\n    debugEnviron = process.env.NODE_DEBUG || '';\n  set = set.toUpperCase();\n  if (!debugs[set]) {\n    if (new RegExp('\\\\b' + set + '\\\\b', 'i').test(debugEnviron)) {\n      var pid = process.pid;\n      debugs[set] = function() {\n        var msg = exports.format.apply(exports, arguments);\n        console.error('%s %d: %s', set, pid, msg);\n      };\n    } else {\n      debugs[set] = function() {};\n    }\n  }\n  return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect(obj, opts) {\n  // default options\n  var ctx = {\n    seen: [],\n    stylize: stylizeNoColor\n  };\n  // legacy...\n  if (arguments.length >= 3) ctx.depth = arguments[2];\n  if (arguments.length >= 4) ctx.colors = arguments[3];\n  if (isBoolean(opts)) {\n    // legacy...\n    ctx.showHidden = opts;\n  } else if (opts) {\n    // got an \"options\" object\n    exports._extend(ctx, opts);\n  }\n  // set default options\n  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n  if (isUndefined(ctx.depth)) ctx.depth = 2;\n  if (isUndefined(ctx.colors)) ctx.colors = false;\n  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n  if (ctx.colors) ctx.stylize = stylizeWithColor;\n  return formatValue(ctx, obj, ctx.depth);\n}\nexports.inspect = inspect;\n\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n  'bold' : [1, 22],\n  'italic' : [3, 23],\n  'underline' : [4, 24],\n  'inverse' : [7, 27],\n  'white' : [37, 39],\n  'grey' : [90, 39],\n  'black' : [30, 39],\n  'blue' : [34, 39],\n  'cyan' : [36, 39],\n  'green' : [32, 39],\n  'magenta' : [35, 39],\n  'red' : [31, 39],\n  'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n  'special': 'cyan',\n  'number': 'yellow',\n  'boolean': 'yellow',\n  'undefined': 'grey',\n  'null': 'bold',\n  'string': 'green',\n  'date': 'magenta',\n  // \"name\": intentionally not styling\n  'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n  var style = inspect.styles[styleType];\n\n  if (style) {\n    return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n           '\\u001b[' + inspect.colors[style][1] + 'm';\n  } else {\n    return str;\n  }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n  return str;\n}\n\n\nfunction arrayToHash(array) {\n  var hash = {};\n\n  array.forEach(function(val, idx) {\n    hash[val] = true;\n  });\n\n  return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n  // Provide a hook for user-specified inspect functions.\n  // Check that value is an object with an inspect function on it\n  if (ctx.customInspect &&\n      value &&\n      isFunction(value.inspect) &&\n      // Filter out the util module, it's inspect function is special\n      value.inspect !== exports.inspect &&\n      // Also filter out any prototype objects using the circular check.\n      !(value.constructor && value.constructor.prototype === value)) {\n    var ret = value.inspect(recurseTimes, ctx);\n    if (!isString(ret)) {\n      ret = formatValue(ctx, ret, recurseTimes);\n    }\n    return ret;\n  }\n\n  // Primitive types cannot have properties\n  var primitive = formatPrimitive(ctx, value);\n  if (primitive) {\n    return primitive;\n  }\n\n  // Look up the keys of the object.\n  var keys = Object.keys(value);\n  var visibleKeys = arrayToHash(keys);\n\n  if (ctx.showHidden) {\n    keys = Object.getOwnPropertyNames(value);\n  }\n\n  // IE doesn't make error fields non-enumerable\n  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n  if (isError(value)\n      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n    return formatError(value);\n  }\n\n  // Some type of object without properties can be shortcutted.\n  if (keys.length === 0) {\n    if (isFunction(value)) {\n      var name = value.name ? ': ' + value.name : '';\n      return ctx.stylize('[Function' + name + ']', 'special');\n    }\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    }\n    if (isDate(value)) {\n      return ctx.stylize(Date.prototype.toString.call(value), 'date');\n    }\n    if (isError(value)) {\n      return formatError(value);\n    }\n  }\n\n  var base = '', array = false, braces = ['{', '}'];\n\n  // Make Array say that they are Array\n  if (isArray(value)) {\n    array = true;\n    braces = ['[', ']'];\n  }\n\n  // Make functions say that they are functions\n  if (isFunction(value)) {\n    var n = value.name ? ': ' + value.name : '';\n    base = ' [Function' + n + ']';\n  }\n\n  // Make RegExps say that they are RegExps\n  if (isRegExp(value)) {\n    base = ' ' + RegExp.prototype.toString.call(value);\n  }\n\n  // Make dates with properties first say the date\n  if (isDate(value)) {\n    base = ' ' + Date.prototype.toUTCString.call(value);\n  }\n\n  // Make error with message first say the error\n  if (isError(value)) {\n    base = ' ' + formatError(value);\n  }\n\n  if (keys.length === 0 && (!array || value.length == 0)) {\n    return braces[0] + base + braces[1];\n  }\n\n  if (recurseTimes < 0) {\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    } else {\n      return ctx.stylize('[Object]', 'special');\n    }\n  }\n\n  ctx.seen.push(value);\n\n  var output;\n  if (array) {\n    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n  } else {\n    output = keys.map(function(key) {\n      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n    });\n  }\n\n  ctx.seen.pop();\n\n  return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n  if (isUndefined(value))\n    return ctx.stylize('undefined', 'undefined');\n  if (isString(value)) {\n    var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n                                             .replace(/'/g, \"\\\\'\")\n                                             .replace(/\\\\\"/g, '\"') + '\\'';\n    return ctx.stylize(simple, 'string');\n  }\n  if (isNumber(value))\n    return ctx.stylize('' + value, 'number');\n  if (isBoolean(value))\n    return ctx.stylize('' + value, 'boolean');\n  // For some reason typeof null is \"object\", so special case here.\n  if (isNull(value))\n    return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n  return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n  var output = [];\n  for (var i = 0, l = value.length; i < l; ++i) {\n    if (hasOwnProperty(value, String(i))) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          String(i), true));\n    } else {\n      output.push('');\n    }\n  }\n  keys.forEach(function(key) {\n    if (!key.match(/^\\d+$/)) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          key, true));\n    }\n  });\n  return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n  var name, str, desc;\n  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n  if (desc.get) {\n    if (desc.set) {\n      str = ctx.stylize('[Getter/Setter]', 'special');\n    } else {\n      str = ctx.stylize('[Getter]', 'special');\n    }\n  } else {\n    if (desc.set) {\n      str = ctx.stylize('[Setter]', 'special');\n    }\n  }\n  if (!hasOwnProperty(visibleKeys, key)) {\n    name = '[' + key + ']';\n  }\n  if (!str) {\n    if (ctx.seen.indexOf(desc.value) < 0) {\n      if (isNull(recurseTimes)) {\n        str = formatValue(ctx, desc.value, null);\n      } else {\n        str = formatValue(ctx, desc.value, recurseTimes - 1);\n      }\n      if (str.indexOf('\\n') > -1) {\n        if (array) {\n          str = str.split('\\n').map(function(line) {\n            return '  ' + line;\n          }).join('\\n').substr(2);\n        } else {\n          str = '\\n' + str.split('\\n').map(function(line) {\n            return '   ' + line;\n          }).join('\\n');\n        }\n      }\n    } else {\n      str = ctx.stylize('[Circular]', 'special');\n    }\n  }\n  if (isUndefined(name)) {\n    if (array && key.match(/^\\d+$/)) {\n      return str;\n    }\n    name = JSON.stringify('' + key);\n    if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n      name = name.substr(1, name.length - 2);\n      name = ctx.stylize(name, 'name');\n    } else {\n      name = name.replace(/'/g, \"\\\\'\")\n                 .replace(/\\\\\"/g, '\"')\n                 .replace(/(^\"|\"$)/g, \"'\");\n      name = ctx.stylize(name, 'string');\n    }\n  }\n\n  return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n  var numLinesEst = 0;\n  var length = output.reduce(function(prev, cur) {\n    numLinesEst++;\n    if (cur.indexOf('\\n') >= 0) numLinesEst++;\n    return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n  }, 0);\n\n  if (length > 60) {\n    return braces[0] +\n           (base === '' ? '' : base + '\\n ') +\n           ' ' +\n           output.join(',\\n  ') +\n           ' ' +\n           braces[1];\n  }\n\n  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nfunction isArray(ar) {\n  return Array.isArray(ar);\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n  return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n  return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n  return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n  return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n  return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n  return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n  return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n  return isObject(re) && objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n  return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n  return isObject(d) && objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\n\nfunction isError(e) {\n  return isObject(e) &&\n      (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\n\nfunction isFunction(arg) {\n  return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n  return arg === null ||\n         typeof arg === 'boolean' ||\n         typeof arg === 'number' ||\n         typeof arg === 'string' ||\n         typeof arg === 'symbol' ||  // ES6 symbol\n         typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = require('./support/isBuffer');\n\nfunction objectToString(o) {\n  return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n  return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n              'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n  var d = new Date();\n  var time = [pad(d.getHours()),\n              pad(d.getMinutes()),\n              pad(d.getSeconds())].join(':');\n  return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexports.log = function() {\n  console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n *     prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nexports.inherits = require('inherits');\n\nexports._extend = function(origin, add) {\n  // Don't do anything if add isn't an object\n  if (!add || !isObject(add)) return origin;\n\n  var keys = Object.keys(add);\n  var i = keys.length;\n  while (i--) {\n    origin[keys[i]] = add[keys[i]];\n  }\n  return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nvar kCustomPromisifiedSymbol = typeof Symbol !== 'undefined' ? Symbol('util.promisify.custom') : undefined;\n\nexports.promisify = function promisify(original) {\n  if (typeof original !== 'function')\n    throw new TypeError('The \"original\" argument must be of type Function');\n\n  if (kCustomPromisifiedSymbol && original[kCustomPromisifiedSymbol]) {\n    var fn = original[kCustomPromisifiedSymbol];\n    if (typeof fn !== 'function') {\n      throw new TypeError('The \"util.promisify.custom\" argument must be of type Function');\n    }\n    Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n      value: fn, enumerable: false, writable: false, configurable: true\n    });\n    return fn;\n  }\n\n  function fn() {\n    var promiseResolve, promiseReject;\n    var promise = new Promise(function (resolve, reject) {\n      promiseResolve = resolve;\n      promiseReject = reject;\n    });\n\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args.push(arguments[i]);\n    }\n    args.push(function (err, value) {\n      if (err) {\n        promiseReject(err);\n      } else {\n        promiseResolve(value);\n      }\n    });\n\n    try {\n      original.apply(this, args);\n    } catch (err) {\n      promiseReject(err);\n    }\n\n    return promise;\n  }\n\n  Object.setPrototypeOf(fn, Object.getPrototypeOf(original));\n\n  if (kCustomPromisifiedSymbol) Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n    value: fn, enumerable: false, writable: false, configurable: true\n  });\n  return Object.defineProperties(\n    fn,\n    getOwnPropertyDescriptors(original)\n  );\n}\n\nexports.promisify.custom = kCustomPromisifiedSymbol\n\nfunction callbackifyOnRejected(reason, cb) {\n  // `!reason` guard inspired by bluebird (Ref: https://goo.gl/t5IS6M).\n  // Because `null` is a special error value in callbacks which means \"no error\n  // occurred\", we error-wrap so the callback consumer can distinguish between\n  // \"the promise rejected with null\" or \"the promise fulfilled with undefined\".\n  if (!reason) {\n    var newReason = new Error('Promise was rejected with a falsy value');\n    newReason.reason = reason;\n    reason = newReason;\n  }\n  return cb(reason);\n}\n\nfunction callbackify(original) {\n  if (typeof original !== 'function') {\n    throw new TypeError('The \"original\" argument must be of type Function');\n  }\n\n  // We DO NOT return the promise as it gives the user a false sense that\n  // the promise is actually somehow related to the callback's execution\n  // and that the callback throwing will reject the promise.\n  function callbackified() {\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args.push(arguments[i]);\n    }\n\n    var maybeCb = args.pop();\n    if (typeof maybeCb !== 'function') {\n      throw new TypeError('The last argument must be of type Function');\n    }\n    var self = this;\n    var cb = function() {\n      return maybeCb.apply(self, arguments);\n    };\n    // In true node style we process the callback on `nextTick` with all the\n    // implications (stack, `uncaughtException`, `async_hooks`)\n    original.apply(this, args)\n      .then(function(ret) { process.nextTick(cb, null, ret) },\n            function(rej) { process.nextTick(callbackifyOnRejected, rej, cb) });\n  }\n\n  Object.setPrototypeOf(callbackified, Object.getPrototypeOf(original));\n  Object.defineProperties(callbackified,\n                          getOwnPropertyDescriptors(original));\n  return callbackified;\n}\nexports.callbackify = callbackify;\n","module.exports = function isBuffer(arg) {\n  return arg && typeof arg === 'object'\n    && typeof arg.copy === 'function'\n    && typeof arg.fill === 'function'\n    && typeof arg.readUInt8 === 'function';\n}","if (typeof Object.create === 'function') {\n  // implementation from standard node.js 'util' module\n  module.exports = function inherits(ctor, superCtor) {\n    ctor.super_ = superCtor\n    ctor.prototype = Object.create(superCtor.prototype, {\n      constructor: {\n        value: ctor,\n        enumerable: false,\n        writable: true,\n        configurable: true\n      }\n    });\n  };\n} else {\n  // old school shim for old browsers\n  module.exports = function inherits(ctor, superCtor) {\n    ctor.super_ = superCtor\n    var TempCtor = function () {}\n    TempCtor.prototype = superCtor.prototype\n    ctor.prototype = new TempCtor()\n    ctor.prototype.constructor = ctor\n  }\n}\n","import { PrivateService } from '@makerdao/services-core';\nimport { MKR, ESM, END } from './utils/constants';\nimport { getCurrency } from './utils/helpers';\nimport tracksTransactions, {\n  tracksTransactionsWithOptions\n} from './utils/tracksTransactions';\n\nexport default class EsmService extends PrivateService {\n  constructor(name = 'esm') {\n    super(name, ['smartContract', 'web3', 'token', 'allowance', 'govQueryApi']);\n  }\n\n  async thresholdAmount() {\n    const min = await this._esmContract().min();\n    return getCurrency(min, MKR).shiftedBy(-18);\n  }\n\n  async fired() {\n    const _fired = await this._esmContract().fired();\n    return _fired.eq(1);\n  }\n\n  async emergencyShutdownActive() {\n    const active = await this._endContract().live();\n    return active.eq(0);\n  }\n\n  async canFire() {\n    const [fired, live] = await Promise.all([\n      this.fired(),\n      this.emergencyShutdownActive()\n    ]);\n    return !fired && !live;\n  }\n\n  async getTotalStaked() {\n    const total = await this._esmContract().Sum();\n    return getCurrency(total, MKR).shiftedBy(-18);\n  }\n\n  async getTotalStakedByAddress(address = false) {\n    if (!address) {\n      address = this.get('web3').currentAddress();\n    }\n    const total = await this._esmContract().sum(address);\n    return getCurrency(total, MKR).shiftedBy(-18);\n  }\n\n  @tracksTransactionsWithOptions({ numArguments: 3 })\n  async stake(amount, skipChecks = false, { promise }) {\n    const mkrAmount = getCurrency(amount, MKR);\n    if (!skipChecks) {\n      const [fired, mkrBalance] = await Promise.all([\n        this.fired(),\n        this.get('token')\n          .getToken(MKR)\n          .balance()\n      ]);\n      if (fired) {\n        throw new Error('cannot join when emergency shutdown has been fired');\n      }\n      if (mkrBalance.lt(mkrAmount)) {\n        throw new Error('amount to join is greater than the user balance');\n      }\n    }\n    return this._esmContract().join(mkrAmount.toFixed('wei'), { promise });\n  }\n\n  @tracksTransactionsWithOptions({ numArguments: 2 })\n  async triggerEmergencyShutdown(skipChecks = false, { promise }) {\n    if (!skipChecks) {\n      const [thresholdAmount, totalStaked, canFire] = await Promise.all([\n        this.thresholdAmount(),\n        this.getTotalStaked(),\n        this.canFire()\n      ]);\n      if (totalStaked.lt(thresholdAmount)) {\n        throw new Error(\n          'total amount of staked MKR has not reached the required threshold'\n        );\n      }\n      if (!canFire) {\n        throw new Error('emergency shutdown has already been initiated');\n      }\n    }\n    return this._esmContract().fire();\n  }\n\n  async getStakingHistory() {\n    const stakes = await this.get('govQueryApi').getEsmJoins();\n    const parsedStakes = stakes.map(e => {\n      const transactionHash = e.txHash;\n      const senderAddress = e.txFrom;\n      const amount = MKR(e.joinAmount);\n      const time = new Date(e.blockTimestamp);\n      return {\n        transactionHash,\n        senderAddress,\n        amount,\n        time\n      };\n    });\n    const sortedParsedStakes = parsedStakes.sort((a, b) => {\n      //sort by date descending\n      return b.time - a.time;\n    });\n    return sortedParsedStakes;\n  }\n\n  _esmContract() {\n    return this.get('smartContract').getContractByName(ESM);\n  }\n\n  _endContract() {\n    return this.get('smartContract').getContractByName(END);\n  }\n}\n","function _applyDecoratedDescriptor(target, property, decorators, descriptor, context) {\n  var desc = {};\n  Object.keys(descriptor).forEach(function (key) {\n    desc[key] = descriptor[key];\n  });\n  desc.enumerable = !!desc.enumerable;\n  desc.configurable = !!desc.configurable;\n\n  if ('value' in desc || desc.initializer) {\n    desc.writable = true;\n  }\n\n  desc = decorators.slice().reverse().reduce(function (desc, decorator) {\n    return decorator(target, property, desc) || desc;\n  }, desc);\n\n  if (context && desc.initializer !== void 0) {\n    desc.value = desc.initializer ? desc.initializer.call(context) : void 0;\n    desc.initializer = undefined;\n  }\n\n  if (desc.initializer === void 0) {\n    Object.defineProperty(target, property, desc);\n    desc = null;\n  }\n\n  return desc;\n}\n\nmodule.exports = _applyDecoratedDescriptor;","// FIXME this is a duplicate of the file in the main dai.js source -- it should\n// be moved to a utility library or something, but for now, this is the simplest\n// way to avoid any issues with importing\n\nimport times from 'lodash/times';\n\n/*\n\nThe default export is a decorator definition.\n\nIf a function is decorated with `@tracksTransactions`, it should expect its last\nargument to be an object with a key named `promise`. It should pass that\n`promise` argument along as a key in the last argument to any non-constant\nfunction calls it makes to a smart contract (i.e. an instance returned from the\ngetContract method in SmartContractService), or any calls it makes to other\nfunctions that will eventually call such smart contract functions.\n\nThis allows TransactionManager to let users input a promise and attach lifecycle\ncallbacks to all transactions that were created in the course of executing that\npromise.\n\n@tracksTransactions is only necessary when the function is async. If the\nfunction returns a contract call and does not make any async calls before that,\nthen the async keyword can be removed, and it just needs to have an `options`\nargument that it passes to its contract call.\n\nIf you need to apply this to a function that has any arguments with default\nvalues, use `@tracksTransactionsWithOptions({ numArguments })` instead, where\n`numArguments` is the total number of arguments to the function, including the\nlast object which contains a key named `promise`.\n\n*/\n\nconst tracksTransactions = tracksTransactionsWithOptions({});\nexport default tracksTransactions;\n\nexport function tracksTransactionsWithOptions({ numArguments }) {\n  return (target, name, descriptor) => {\n    const original = descriptor.value;\n    const correctArgsLength = numArguments || original.length;\n    descriptor.value = function(...args) {\n      const last = args[args.length - 1];\n      let options;\n      if (\n        typeof last === 'object' &&\n        last !== null &&\n        last.constructor === Object\n      ) {\n        args = args.slice(0, args.length - 1);\n        options = last;\n      } else {\n        options = {};\n      }\n\n      const promise = (async () => {\n        // this \"no-op await\" is necessary for the inner reference to the\n        // outer promise to become valid.\n        await 0;\n\n        // if there's already a promise, reuse it instead of setting this one--\n        // this allows the function we're running to behave differently when\n        // it's called directly vs. by another function. e.g. lockWeth\n        if (!options.promise) options.promise = promise;\n\n        // pad the list of arguments with `undefined` to account for any missing\n        // ones with default values.\n        const newArgs = [\n          ...args,\n          ...times(correctArgsLength - 1 - args.length, () => undefined),\n          options\n        ];\n\n        return original.apply(this, newArgs);\n      })();\n      return promise;\n    };\n    return descriptor;\n  };\n}\n","var baseTimes = require('./_baseTimes'),\n    castFunction = require('./_castFunction'),\n    toInteger = require('./toInteger');\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used as references for the maximum length and index of an array. */\nvar MAX_ARRAY_LENGTH = 4294967295;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMin = Math.min;\n\n/**\n * Invokes the iteratee `n` times, returning an array of the results of\n * each invocation. The iteratee is invoked with one argument; (index).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.times(3, String);\n * // => ['0', '1', '2']\n *\n *  _.times(4, _.constant(0));\n * // => [0, 0, 0, 0]\n */\nfunction times(n, iteratee) {\n  n = toInteger(n);\n  if (n < 1 || n > MAX_SAFE_INTEGER) {\n    return [];\n  }\n  var index = MAX_ARRAY_LENGTH,\n      length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n  iteratee = castFunction(iteratee);\n  n -= MAX_ARRAY_LENGTH;\n\n  var result = baseTimes(length, iteratee);\n  while (++index < n) {\n    iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = times;\n","var identity = require('./identity');\n\n/**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\nfunction castFunction(value) {\n  return typeof value == 'function' ? value : identity;\n}\n\nmodule.exports = castFunction;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nmodule.exports = identity;\n","var toNumber = require('./toNumber');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = value.replace(reTrim, '');\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n","import { PublicService } from '@makerdao/services-core';\nimport { PAUSE } from './utils/constants';\nimport DsSpellAbi from '../contracts/abis/DSSpell.json';\nimport padStart from 'lodash/padStart';\nimport assert from 'assert';\nimport contractInfo from '../contracts/contract-info.json';\nconst pauseInfo = contractInfo.pause;\nimport { netIdToName } from './utils/helpers';\n\nexport default class SpellService extends PublicService {\n  constructor(name = 'spell') {\n    super(name, ['smartContract', 'web3']);\n    this.eta = {};\n    this.done = {};\n    this.action = {};\n    this.executionDate = {};\n    this.scheduledDate = {};\n  }\n\n  getDelayInSeconds() {\n    if (this.delay) return this.delay;\n    this.delay = this._pauseContract().delay();\n    return this.delay;\n  }\n\n  async getEta(spellAddress) {\n    if (this.eta[spellAddress]) return this.eta[spellAddress];\n    const spell = this.get('smartContract').getContractByAddressAndAbi(\n      spellAddress,\n      DsSpellAbi\n    );\n    const eta = await spell.eta();\n    if (!eta.toNumber()) return undefined;\n    this.eta[spellAddress] = new Date(eta.toNumber() * 1000);\n    return this.eta[spellAddress];\n  }\n\n  async getScheduledDate(spellAddress) {\n    if (this.scheduledDate[spellAddress])\n      return this.scheduledDate[spellAddress];\n    const eta = await this.getEta(spellAddress);\n    assert(eta, `spell ${spellAddress} has not been scheduled`);\n    const pauseAddress = this._pauseContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const paddedSpellAddress =\n      '0x' + padStart(spellAddress.replace(/^0x/, ''), 64, '0');\n    const [plotEvent] = await web3Service.getPastLogs({\n      fromBlock: pauseInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: pauseAddress,\n      topics: [pauseInfo.events.plot, paddedSpellAddress]\n    });\n    const { timestamp } = await web3Service.getBlock(plotEvent.blockNumber);\n    this.scheduledDate[spellAddress] = new Date(timestamp * 1000);\n    return this.scheduledDate[spellAddress];\n  }\n\n  async getDone(spellAddress) {\n    if (this.done[spellAddress]) return this.done[spellAddress];\n    const spell = this.get('smartContract').getContractByAddressAndAbi(\n      spellAddress,\n      DsSpellAbi\n    );\n    this.done[spellAddress] = spell.done();\n    return this.done[spellAddress];\n  }\n\n  async getAction(spellAddress) {\n    if (this.action[spellAddress]) return this.action[spellAddress];\n    const spell = this.get('smartContract').getContractByAddressAndAbi(\n      spellAddress,\n      DsSpellAbi\n    );\n    this.action[spellAddress] = spell.action();\n    return this.action[spellAddress];\n  }\n\n  async getExecutionDate(spellAddress) {\n    if (this.executionDate[spellAddress])\n      return this.executionDate[spellAddress];\n    const done = await this.getDone(spellAddress);\n    assert(done, `spell ${spellAddress} has not been executed`);\n    const pauseAddress = this._pauseContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const paddedSpellAddress =\n      '0x' + padStart(spellAddress.replace(/^0x/, ''), 64, '0');\n    const [execEvent] = await web3Service.getPastLogs({\n      fromBlock: pauseInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: pauseAddress,\n      topics: [pauseInfo.events.exec, paddedSpellAddress]\n    });\n    const { timestamp } = await web3Service.getBlock(execEvent.blockNumber);\n    this.executionDate[spellAddress] = new Date(timestamp * 1000);\n    return this.executionDate[spellAddress];\n  }\n\n  refresh() {\n    this.delay = null;\n    this.eta = {};\n    this.done = {};\n    this.executionDate = {};\n    this.scheduledDate = {};\n  }\n\n  _pauseContract() {\n    return this.get('smartContract').getContractByName(PAUSE);\n  }\n}\n","var createPadding = require('./_createPadding'),\n    stringSize = require('./_stringSize'),\n    toInteger = require('./toInteger'),\n    toString = require('./toString');\n\n/**\n * Pads `string` on the left side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padStart('abc', 6);\n * // => '   abc'\n *\n * _.padStart('abc', 6, '_-');\n * // => '_-_abc'\n *\n * _.padStart('abc', 3);\n * // => 'abc'\n */\nfunction padStart(string, length, chars) {\n  string = toString(string);\n  length = toInteger(length);\n\n  var strLength = length ? stringSize(string) : 0;\n  return (length && strLength < length)\n    ? (createPadding(length - strLength, chars) + string)\n    : string;\n}\n\nmodule.exports = padStart;\n","var baseRepeat = require('./_baseRepeat'),\n    baseToString = require('./_baseToString'),\n    castSlice = require('./_castSlice'),\n    hasUnicode = require('./_hasUnicode'),\n    stringSize = require('./_stringSize'),\n    stringToArray = require('./_stringToArray');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil;\n\n/**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\nfunction createPadding(length, chars) {\n  chars = chars === undefined ? ' ' : baseToString(chars);\n\n  var charsLength = chars.length;\n  if (charsLength < 2) {\n    return charsLength ? baseRepeat(chars, length) : chars;\n  }\n  var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n  return hasUnicode(chars)\n    ? castSlice(stringToArray(result), 0, length).join('')\n    : result.slice(0, length);\n}\n\nmodule.exports = createPadding;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeFloor = Math.floor;\n\n/**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\nfunction baseRepeat(string, n) {\n  var result = '';\n  if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n    return result;\n  }\n  // Leverage the exponentiation by squaring algorithm for a faster repeat.\n  // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n  do {\n    if (n % 2) {\n      result += string;\n    }\n    n = nativeFloor(n / 2);\n    if (n) {\n      string += string;\n    }\n  } while (n);\n\n  return result;\n}\n\nmodule.exports = baseRepeat;\n","var baseSlice = require('./_baseSlice');\n\n/**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\nfunction castSlice(array, start, end) {\n  var length = array.length;\n  end = end === undefined ? length : end;\n  return (!start && end >= length) ? array : baseSlice(array, start, end);\n}\n\nmodule.exports = castSlice;\n","/**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\nfunction baseSlice(array, start, end) {\n  var index = -1,\n      length = array.length;\n\n  if (start < 0) {\n    start = -start > length ? 0 : (length + start);\n  }\n  end = end > length ? length : end;\n  if (end < 0) {\n    end += length;\n  }\n  length = start > end ? 0 : ((end - start) >>> 0);\n  start >>>= 0;\n\n  var result = Array(length);\n  while (++index < length) {\n    result[index] = array[index + start];\n  }\n  return result;\n}\n\nmodule.exports = baseSlice;\n","var baseProperty = require('./_baseProperty');\n\n/**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nvar asciiSize = baseProperty('length');\n\nmodule.exports = asciiSize;\n","/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nmodule.exports = baseProperty;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nfunction unicodeSize(string) {\n  var result = reUnicode.lastIndex = 0;\n  while (reUnicode.test(string)) {\n    ++result;\n  }\n  return result;\n}\n\nmodule.exports = unicodeSize;\n","var asciiToArray = require('./_asciiToArray'),\n    hasUnicode = require('./_hasUnicode'),\n    unicodeToArray = require('./_unicodeToArray');\n\n/**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction stringToArray(string) {\n  return hasUnicode(string)\n    ? unicodeToArray(string)\n    : asciiToArray(string);\n}\n\nmodule.exports = stringToArray;\n","/**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction asciiToArray(string) {\n  return string.split('');\n}\n\nmodule.exports = asciiToArray;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction unicodeToArray(string) {\n  return string.match(reUnicode) || [];\n}\n\nmodule.exports = unicodeToArray;\n","var baseToString = require('./_baseToString');\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n"],"sourceRoot":""}
\ No newline at end of file
+{"version":3,"sources":["webpack://@makerdao/dai-plugin-governance/webpack/universalModuleDefinition","webpack://@makerdao/dai-plugin-governance/webpack/bootstrap","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/interopRequireDefault.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/classCallCheck.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/createClass.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/getPrototypeOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_core.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/inherits.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/possibleConstructorReturn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_wks.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/regenerator/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/asyncToGenerator.js","webpack://@makerdao/dai-plugin-governance/./src/utils/constants.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_export.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_global.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-dp.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_descriptors.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/typeof.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_an-object.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_has.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_hide.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_is-object.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_fails.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-iobject.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/slicedToArray.js","webpack://@makerdao/dai-plugin-governance/./src/utils/helpers.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/defineProperty.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_property-desc.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-object.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iterators.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceType.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_root.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-keys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_library.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_uid.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-pie.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceBase.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_nativeCreate.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseGetTag.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_assocIndexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_getMapData.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isObjectLike.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_ctx.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-primitive.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_cof.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_defined.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-integer.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_shared-key.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_shared.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_enum-bug-keys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-gops.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.string.iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-create.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_set-to-string-tag.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_wks-ext.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_wks-define.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/setPrototypeOf.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceManager.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/wrapNativeSuper.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/interopRequireWildcard.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceState.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_getNative.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_Symbol.js","webpack://@makerdao/dai-plugin-governance/(webpack)/buildin/global.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isObject.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/toConsumableArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hasUnicode.js","webpack://@makerdao/dai-plugin-governance/./node_modules/@makerdao/currency/dist/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/object/assign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_ie8-dom-define.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_dom-create.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-keys-internal.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iobject.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-length.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/object/get-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-gpo.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/classCallCheck.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/possibleConstructorReturn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/typeof.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iter-define.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_redefine.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/web.dom.iterable.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-gopn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-gopd.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/inherits.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/core.get-iterator-method.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/unsupportedIterableToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/arrayLikeToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/assertThisInitialized.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/standardizeConfig.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/StateMachine.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/process/browser.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/uniq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isFunction.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_freeGlobal.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_setToArray.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/Container.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_arrayMap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseTimes.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isArray.js","webpack://@makerdao/dai-plugin-governance/(webpack)/buildin/module.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isLength.js","webpack://@makerdao/dai-plugin-governance/./node_modules/bignumber.js/bignumber.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/assert/assert.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/toInteger.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isSymbol.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseToString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_stringSize.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isPlaceholder.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_curry1.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/always.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/F.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/T.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/__.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_curry2.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/add.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_concat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_arity.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_curryN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/curryN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/addIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_curry3.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/adjust.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isTransformer.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_dispatchable.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_reduced.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfBase.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xall.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/all.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/max.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_map.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isArrayLike.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xwrap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/bind.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_reduce.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xmap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_has.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isArguments.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/keys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/map.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/path.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/prop.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pluck.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reduce.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/allPass.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/and.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xany.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/any.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/anyPass.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/ap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_aperture.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xaperture.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/aperture.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/append.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/apply.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/values.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/applySpec.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/applyTo.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/ascend.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/assoc.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isInteger.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/isNil.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/assocPath.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/nAry.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/binary.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isFunction.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/liftN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lift.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/both.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/curry.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/call.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_makeFlat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_flatCat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_forceReduced.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/chain.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xchain.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/clamp.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_cloneRegExp.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/type.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_clone.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/clone.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/comparator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/not.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/complement.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_pipe.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_checkForMethod.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/slice.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/tail.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pipe.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reverse.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/compose.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/composeK.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_pipeP.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pipeP.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/composeP.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_arrayFromIterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_containsWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/identical.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_equals.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_functionName.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/equals.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_indexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_contains.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_quote.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_toISOString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_complement.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_filter.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isObject.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfilter.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/filter.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reject.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/toString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_toString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/concat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/cond.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/constructN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/construct.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/contains.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/converge.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xreduceBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reduceBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/countBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dec.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/defaultTo.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/descend.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/difference.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/differenceWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dissoc.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/remove.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/update.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dissocPath.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/divide.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xdrop.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/drop.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xtake.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/take.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_dropLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xdropLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dropLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_dropLastWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xdropLastWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dropLastWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xdropRepeatsWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/nth.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/last.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dropRepeatsWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dropRepeats.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xdropWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/dropWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/or.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/either.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/empty.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/takeLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/endsWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/eqBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/eqProps.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/evolve.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfind.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/find.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfindIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/findIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfindLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/findLast.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xfindLastIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/findLastIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/flatten.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/flip.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/forEach.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/forEachObjIndexed.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/fromPairs.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/groupBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/groupWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/gt.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/gte.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/has.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/hasIn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/head.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_identity.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/identity.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/ifElse.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/inc.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/indexBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/indexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/init.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/innerJoin.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/insert.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/insertAll.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_Set.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/uniqBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/uniq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/intersection.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/intersperse.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_assign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_objectAssign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/objOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_stepCat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/into.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/invert.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/invertObj.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/invoker.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/is.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/isEmpty.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/join.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/juxt.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/keysIn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lastIndexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isNumber.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/length.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lens.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lensIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lensPath.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lensProp.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lt.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/lte.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mapAccum.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mapAccumRight.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mapObjIndexed.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/match.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mathMod.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/maxBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/sum.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mean.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/median.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/memoizeWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/memoize.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/merge.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeAll.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeWithKey.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeDeepWithKey.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeDeepLeft.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeDeepRight.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeDeepWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/mergeWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/min.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/minBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/modulo.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/multiply.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/negate.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/none.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/nthArg.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/o.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/omit.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/once.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/over.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pair.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_createPartialApplicator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/partial.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/partialRight.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/partition.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pathEq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pathOr.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pathSatisfies.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pick.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pickAll.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pickBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/pipeK.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/prepend.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/product.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/useWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/project.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/propEq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/propIs.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/propOr.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/propSatisfies.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/props.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/range.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reduceRight.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reduceWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/reduced.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/times.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/repeat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/replace.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/scan.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/sequence.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/set.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/sort.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/sortBy.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/sortWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/split.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/splitAt.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/splitEvery.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/splitWhen.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/startsWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/subtract.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/symmetricDifference.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/symmetricDifferenceWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/takeLastWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xtakeWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/takeWhile.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_xtap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/tap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/test.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/internal/_isRegExp.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/toLower.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/toPairs.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/toPairsIn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/toUpper.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/transduce.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/transpose.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/traverse.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/trim.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/tryCatch.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unapply.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unary.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/uncurryN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unfold.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/union.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/uniqWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unionWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unless.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/unnest.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/until.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/valuesIn.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/view.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/when.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/where.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/whereEq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/without.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/xprod.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/zip.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/zipObj.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ramda/es/zipWith.js","webpack://@makerdao/dai-plugin-governance/./src/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/object/assign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.object.assign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_a-function.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-assign.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_array-includes.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_to-absolute-index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/object/get-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.object.get-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-sap.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/symbol/iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/symbol/iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_string-at.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iter-create.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-dps.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_html.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.array.iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_add-to-unscopables.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iter-step.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/symbol.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/symbol/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.symbol.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_meta.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_enum-keys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_is-array.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_object-gopn-ext.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es7.symbol.async-iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es7.symbol.observable.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/object/set-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/object/set-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.object.set-prototype-of.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_set-proto.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/object/create.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/object/create.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.object.create.js","webpack://@makerdao/dai-plugin-governance/./node_modules/@makerdao/currency/dist/Currency.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/get-iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/get-iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/core.get-iterator.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_classof.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/toArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/array/from.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/array/from.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.array.from.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iter-call.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_is-array-iter.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_create-property.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/_iter-detect.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/helpers/createClass.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/babel-runtime/core-js/object/define-property.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/fn/object/define-property.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/core-js/library/modules/es6.object.define-property.js","webpack://@makerdao/dai-plugin-governance/./node_modules/@makerdao/currency/node_modules/bignumber.js/bignumber.js","webpack://@makerdao/dai-plugin-governance/./src/ChiefService.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/arrayWithHoles.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/iterableToArrayLimit.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/nonIterableRest.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/regenerator-runtime/runtime.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/get.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/superPropBase.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/isNativeFunction.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/construct.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/isNativeReflectConstruct.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceManagerBase.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/debug/src/browser.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/debug/src/debug.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/debug/node_modules/ms/index.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/ServiceProvider.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseUniq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_SetCache.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_MapCache.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_mapCacheClear.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_Hash.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hashClear.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseIsNative.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_getRawTag.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_objectToString.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_isMasked.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_coreJsData.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_toSource.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_getValue.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hashDelete.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hashGet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hashHas.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_hashSet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_ListCache.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_listCacheClear.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_listCacheDelete.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/eq.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_listCacheGet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_listCacheHas.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_listCacheSet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_Map.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_mapCacheDelete.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_isKeyable.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_mapCacheGet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_mapCacheHas.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_mapCacheSet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_setCacheAdd.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_setCacheHas.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_arrayIncludes.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseIndexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseFindIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseIsNaN.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_strictIndexOf.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_arrayIncludesWith.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_cacheHas.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_createSet.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_Set.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/noop.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/values.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseValues.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/keys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_arrayLikeKeys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isArguments.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseIsArguments.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isBuffer.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/stubFalse.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_isIndex.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isTypedArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseIsTypedArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseUnary.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_nodeUtil.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseKeys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_isPrototype.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_nativeKeys.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_overArg.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/isArrayLike.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/toposort/index.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/LocalService.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/PublicService.js","webpack://@makerdao/dai-plugin-governance/../services-core/dist/PrivateService.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/node-libs-browser/node_modules/buffer/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/base64-js/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/ieee754/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/isarray/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/arrayWithoutHoles.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/iterableToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/nonIterableSpread.js","webpack://@makerdao/dai-plugin-governance/./src/VoteProxyService.js","webpack://@makerdao/dai-plugin-governance/./src/VoteProxy.js","webpack://@makerdao/dai-plugin-governance/./src/VoteProxyFactoryService.js","webpack://@makerdao/dai-plugin-governance/./src/ApproveLinkTransaction.js","webpack://@makerdao/dai-plugin-governance/./src/GovPollingService.js","webpack://@makerdao/dai-plugin-governance/./src/GovQueryApiService.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/object-assign/index.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/node-libs-browser/node_modules/util/util.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/node-libs-browser/node_modules/util/support/isBufferBrowser.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/node-libs-browser/node_modules/inherits/inherits_browser.js","webpack://@makerdao/dai-plugin-governance/./src/EsmService.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/@babel/runtime/helpers/applyDecoratedDescriptor.js","webpack://@makerdao/dai-plugin-governance/./src/utils/tracksTransactions.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/times.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_castFunction.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/identity.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/toFinite.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/toNumber.js","webpack://@makerdao/dai-plugin-governance/./src/SpellService.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/padStart.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_createPadding.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseRepeat.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_castSlice.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseSlice.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_asciiSize.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_baseProperty.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_unicodeSize.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_stringToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_asciiToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/_unicodeToArray.js","webpack://@makerdao/dai-plugin-governance//Users/ethanbennett/Maker/dai.js/node_modules/lodash/toString.js"],"names":["webpackUniversalModuleDefinition","root","factory","exports","module","define","amd","window","installedModules","__webpack_require__","moduleId","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","getDefault","getModuleExports","object","property","prototype","hasOwnProperty","p","s","_interopRequireDefault","obj","_classCallCheck","instance","Constructor","TypeError","_defineProperties","target","props","length","descriptor","configurable","writable","_createClass","protoProps","staticProps","_getPrototypeOf","setPrototypeOf","getPrototypeOf","__proto__","core","version","__e","_inherits","subClass","superClass","constructor","_typeof","assertThisInitialized","_possibleConstructorReturn","self","store","uid","USE_SYMBOL","asyncGeneratorStep","gen","resolve","reject","_next","_throw","arg","info","error","done","Promise","then","_asyncToGenerator","fn","this","args","arguments","apply","err","undefined","MKR","createCurrency","IOU","global","ctx","hide","has","$export","type","source","own","out","IS_FORCED","F","IS_GLOBAL","G","IS_STATIC","S","IS_PROTO","P","IS_BIND","B","IS_WRAP","W","expProto","C","a","b","Function","virtual","R","U","Math","__g","anObject","IE8_DOM_DEFINE","toPrimitive","dP","f","O","Attributes","e","iterator","isObject","it","require","_standardizeConfig","_ServiceProvider","_Container","_LocalService","_PublicService","_PrivateService","_ServiceManager","_StateMachine","createDesc","exec","IObject","defined","arrayWithHoles","iterableToArrayLimit","unsupportedIterableToArray","nonIterableRest","_slicedToArray","arr","netIdToName","id","parseInt","netIdtoSpockUrl","MAINNET_URL","KOVAN_URL","STAGING_MAINNET_URL","netIdtoSpockUrlStaging","getCurrency","createGetCurrency","paddedArray","k","Array","from","map","concat","toBuffer","number","opts","buf","len","endian","size","hex","BigNumber","toString","1","charAt","Error","ceil","Buffer","alloc","split","RegExp","filter","forEach","chunk","j","slice","fromBuffer","RangeError","push","join","_defineProperty","bitmap","serviceTypeTransitions","_ServiceState","LOCAL","PUBLIC","PRIVATE","CREATED","INITIALIZING","READY","ERROR","OFFLINE","CONNECTING","ONLINE","AUTHENTICATING","freeGlobal","freeSelf","$keys","enumBugKeys","keys","px","random","propertyIsEnumerable","_classCallCheck2","_createClass2","_ServiceType","_defineLifeCycleMethods","initialize","connect","disconnect","authenticate","deauthenticate","_buildServiceManager","dependencies","_this","auth","settings","_installLifeCycleHooks","mgr","_this2","onInitialized","manager","onDisconnected","onDeauthenticated","_guardLifeCycleMethods","original","state","_default","ServiceBase","role","_serviceManager","dependency","nativeCreate","getNative","getRawTag","objectToString","symToStringTag","baseGetTag","eq","assocIndexOf","array","isKeyable","getMapData","data","__data__","isObjectLike","aFunction","that","val","valueOf","floor","isNaN","shared","copyright","getOwnPropertySymbols","$at","String","iterated","_t","_i","point","index","dPs","IE_PROTO","Empty","createDict","iframeDocument","iframe","style","display","appendChild","src","contentWindow","document","open","write","lt","close","Properties","result","def","TAG","tag","stat","LIBRARY","wksExt","$Symbol","_setPrototypeOf","DependencyNotResolvedError","UnknownDependencyError","InvalidServiceError","_typeof2","_get2","_inherits2","_possibleConstructorReturn2","_getPrototypeOf2","_wrapNativeSuper2","_ServiceManagerBase2","_createSuper","Derived","hasNativeReflectConstruct","_isNativeReflectConstruct","Reflect","construct","sham","Proxy","Date","Super","NewTarget","_Error","_super","message","_Error2","_super2","service","_Error3","_super3","_waitForDependencies","callback","all","ServiceManager","_ServiceManagerBase","_super4","init","_name","_dependencies","_injections","isValidService","inject","initializeDependencies","_settings","_this3","connectDependencies","_this4","authenticateDependencies","_this5","_this6","_this7","createService","_this8","isNativeFunction","_wrapNativeSuper","Class","_cache","Map","set","Wrapper","_getRequireWildcardCache","WeakMap","cache","_interopRequireWildcard","newObj","hasPropertyDescriptor","getOwnPropertyDescriptor","desc","baseIsNative","getValue","g","arrayWithoutHoles","iterableToArray","nonIterableSpread","_toConsumableArray","reHasUnicode","hasUnicode","string","test","Currency","_assign2","_classCallCheck3","_possibleConstructorReturn3","_inherits3","symbol","creatorFn","amount","shift","CurrencyX","_Currency","default","wei","makeShiftedCreatorFn","ray","rad","isInstance","createCurrencyRatio","wrappedNumerator","wrappedDenominator","numerator","denominator","_Currency2","CurrencyRatio","currencies","unit","toUpperCase","ctor","is","createElement","toIObject","arrayIndexOf","names","cof","toInteger","min","toObject","ObjectProto","_typeof3","ReferenceError","_iterator2","_symbol2","redefine","Iterators","$iterCreate","setToStringTag","ITERATOR","BUGGY","returnThis","Base","NAME","next","DEFAULT","IS_SET","FORCED","methods","IteratorPrototype","getMethod","kind","proto","values","entries","DEF_VALUES","VALUES_BUG","$native","$default","$entries","$anyNative","TO_STRING_TAG","DOMIterables","Collection","hiddenKeys","getOwnPropertyNames","pIE","gOPD","_setPrototypeOf2","_create2","classof","getIteratorMethod","arrayLikeToArray","_unsupportedIterableToArray","minLen","_arrayLikeToArray","arr2","_assertThisInitialized","standardizeConfig","config","resolver","resolveNameForBoolean","className","_ServiceBase","bool","_ref","defaults","disabled","IllegalStateError","StateMachine","initialState","transitions","_state","_nextStates","_stateChangedHandlers","onStateChanged","inState","indexOf","assertState","operation","transitionTo","newState","oldState","cb","cachedSetTimeout","cachedClearTimeout","process","defaultSetTimout","defaultClearTimeout","runTimeout","fun","setTimeout","clearTimeout","currentQueue","queue","draining","queueIndex","cleanUpNextTick","drainQueue","timeout","run","runClearTimeout","marker","Item","noop","nextTick","title","browser","env","argv","versions","on","addListener","once","off","removeListener","removeAllListeners","emit","prependListener","prependOnceListener","listeners","binding","cwd","chdir","dir","umask","baseUniq","uniq","isFunction","setToArray","orderServices","ServiceNotFoundError","ServiceAlreadyRegisteredError","ExtractedServiceError","_regenerator","_asyncToGenerator2","_values","_uniq","_toposort","_createForOfIteratorHelper","isArray","_e","normalCompletion","didErr","step","_e2","services","_step","edges","servicesWithoutDeps","_iterator","_loop","depNames","dn","Container","_services","isAuthenticated","_waitForServices2","register","throwIfMissing","extractedServices","includes","getRegisteredServiceNames","injectDependencies","_step2","_step3","_iterator3","_waitForServices","mark","_callee","_iterator4","_step4","wrap","_callee$","_context","prev","_orderedServiceNames","t0","finish","stop","_x","arrayMap","iteratee","baseTimes","webpackPolyfill","deprecate","paths","children","isLength","globalObject","isNumeric","mathceil","mathfloor","bignumberError","tooManyDigits","BASE","POWS_TEN","MAX","bitFloor","coeffToString","z","charCodeAt","compare","x","y","xc","yc","intCheck","max","isOdd","toExponential","str","toFixedPoint","zs","clone","configObject","div","convertBase","parseNumeric","random53bitInt","basePrefix","dotAfter","dotBefore","isInfinityOrNaN","whitespaceOrPlus","ONE","DECIMAL_PLACES","ROUNDING_MODE","TO_EXP_NEG","TO_EXP_POS","MIN_EXP","MAX_EXP","CRYPTO","MODULO_MODE","POW_PRECISION","FORMAT","decimalSeparator","groupSeparator","groupSize","secondaryGroupSize","fractionGroupSeparator","fractionGroupSize","ALPHABET","alphabet","caseChanged","isNum","replace","search","substring","round","DEBUG","toLowerCase","format","rm","c0","ne","maxOrMin","method","normalise","pop","sd","ni","rd","pows10","ROUND_UP","ROUND_DOWN","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_UP","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","v","crypto","getRandomValues","randomBytes","EXPONENTIAL_AT","RANGE","isBigNumber","_isBigNumber","maximum","minimum","gt","dp","rand","Uint32Array","copy","splice","toBaseOut","baseIn","baseOut","arrL","reverse","sign","callerIsToString","pow","multiply","base","temp","xlo","xhi","carry","klo","khi","aL","bL","cmp","subtract","more","prod","prodL","q","qc","rem","remL","rem0","xi","xL","yc0","yL","yz","NaN","p1","p2","absoluteValue","abs","comparedTo","decimalPlaces","dividedBy","dividedToIntegerBy","idiv","exponentiatedBy","half","isModExp","nIsBig","nIsNeg","nIsOdd","isInteger","mod","times","integerValue","isEqualTo","isFinite","isGreaterThan","isGreaterThanOrEqualTo","gte","isLessThan","isLessThanOrEqualTo","lte","isNegative","isPositive","isZero","minus","xLTy","plus","xe","ye","modulo","multipliedBy","xcL","ycL","ylo","yhi","zc","negated","precision","shiftedBy","squareRoot","sqrt","rep","toFixed","toFormat","g1","g2","intPart","fractionPart","isNeg","intDigits","substr","toFraction","md","d0","d1","d2","exp","n0","n1","toNumber","toPrecision","toJSON","objectAssign","isBuffer","_isBuffer","util","hasOwn","pSlice","functionsHaveNames","foo","pToString","isView","arrbuf","ArrayBuffer","DataView","buffer","assert","ok","regex","getName","func","match","truncate","inspect","something","rawname","fail","actual","expected","operator","stackStartFunction","AssertionError","_deepEqual","strict","memos","isDate","getTime","isRegExp","multiline","lastIndex","ignoreCase","Float32Array","Float64Array","Uint8Array","actualIndex","objEquiv","actualVisitedObjects","isPrimitive","aIsArgs","isArguments","bIsArgs","ka","objectKeys","kb","sort","expectedException","isPrototypeOf","_throws","shouldThrow","block","_tryBlock","userProvidedMessage","isUnexpectedException","isError","options","generatedMessage","getMessage","captureStackTrace","stack","fn_name","idx","next_line","inherits","equal","notEqual","deepEqual","deepStrictEqual","notDeepEqual","notDeepStrictEqual","strictEqual","notStrictEqual","throws","doesNotThrow","ifError","toFinite","remainder","isSymbol","symbolProto","symbolToString","baseToString","asciiSize","unicodeSize","stringSize","_isPlaceholder","_curry1","f1","always","_curry2","f2","_b","_a","add","Number","_concat","set1","set2","len1","len2","_arity","a0","a1","a2","a3","a4","a5","a6","a7","a8","a9","_curryN","received","combined","argsIdx","left","combinedIdx","curryN","addIndex","origFn","list","_curry3","f3","_c","adjust","_idx","_list","_isTransformer","_dispatchable","methodNames","xf","_isArray","transducer","_reduced","XAll","_xfBase","input","_xall","_map","functor","_isString","isArrayLike","nodeType","XWrap","acc","_xwrap","thisObj","_iterableReduce","iter","_methodReduce","methodName","symIterator","_reduce","_arrayReduce","reduce","XMap","_xmap","_has","prop","_isArguments","hasEnumBug","nonEnumerableProps","hasArgsEnumBug","contains","item","nIdx","ks","checkArgsLength","path","pluck","allPass","preds","and","XAny","any","_xany","anyPass","ap","applyF","applyX","_aperture","limit","XAperture","pos","full","getCopy","_xaperture","append","el","vals","applySpec","spec","applyTo","ascend","aa","bb","assoc","isNil","assocPath","nextObj","_isInteger","nAry","binary","_isFunction","liftN","arity","lifted","lift","both","_both","curry","_makeFlat","recursive","flatt","jlen","ilen","_xcat","rxf","ret","_forceReduced","preservingReduced","_xchain","chain","monad","clamp","_cloneRegExp","pattern","sticky","unicode","_clone","refFrom","refTo","deep","copiedValue","comparator","pred","not","_pipe","_checkForMethod","methodname","fromIndex","toIndex","Infinity","pipe","compose","composeK","last","_pipeP","pipeP","composeP","_arrayFromIterator","_containsWith","identical","_uniqContentEquals","aIterator","bIterator","stackA","stackB","_equals","aItem","typeA","equals","_functionName","keysA","extendedStackA","extendedStackB","_indexOf","inf","_contains","_quote","pad","toISOString","_toISOString","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","getUTCMilliseconds","_complement","_filter","_isObject","XFilter","_xfilter","filterable","_toString","seen","recur","xs","mapPairs","repr","cond","pairs","pair","constructN","Fn","$0","$1","$2","$3","$4","$5","$6","$7","$8","$9","converge","after","fns","context","XReduceBy","valueFn","valueAcc","keyFn","inputs","_xreduceBy","reduceBy","elt","elem","defaultTo","descend","difference","first","second","firstLen","differenceWith","dissoc","remove","start","count","update","dissocPath","head","tail","divide","XDrop","_xdrop","drop","XTake","_xtake","take","dropLast","XDropLast","_xdropLast","dropLastWhile","XDropLastWhile","retained","retain","flush","_xdropLastWhile","XDropRepeatsWith","lastValue","seenFirstValue","sameAsLast","_xdropRepeatsWith","nth","offset","dropRepeatsWith","XDropWhile","_xdropWhile","dropWhile","or","either","_either","empty","takeLast","suffix","eqBy","eqProps","obj1","obj2","evolve","transformations","transformation","XFind","found","_xfind","find","XFindIndex","_xfindIndex","findIndex","XFindLast","_xfindLast","findLast","XFindLastIndex","lastIdx","_xfindLastIndex","findLastIndex","flip","forEachObjIndexed","keyList","fromPairs","res","nextidx","hasIn","_identity","ifElse","condition","onTrue","onFalse","_ifElse","innerJoin","ys","insert","insertAll","elts","hasOrAdd","shouldAdd","prevSize","_items","_nativeSet","bIdx","_Set","Set","uniqBy","appliedItem","intersection","list1","list2","lookupList","filteredList","intersperse","separator","_objectAssign","output","nextKey","objOf","_stepCatArray","_stepCatString","_stepCatObject","_assign","into","_stepCat","invert","invertObj","invoker","Ctor","isEmpty","juxt","keysIn","lastIndexOf","_isNumber","lens","setter","toFunctorFn","focus","lensIndex","lensPath","lensProp","mapAccum","tuple","mapAccumRight","mapObjIndexed","rx","mathMod","maxBy","mean","median","width","memoizeWith","mFn","merge","mergeAll","mergeWithKey","mergeDeepWithKey","lObj","rObj","lVal","rVal","mergeDeepLeft","mergeDeepRight","mergeDeepWith","mergeWith","_","_l","_r","minBy","negate","nthArg","_of","omit","called","Identity","over","fst","snd","_createPartialApplicator","pathEq","_path","pathOr","pathSatisfies","propPath","pick","pickAll","pickBy","pipeK","prepend","useWith","transformers","propEq","propIs","propOr","propSatisfies","ps","range","to","reduceRight","_reduceWhile","repeat","replacement","scan","sequence","of","traversable","sortBy","sortWith","splitAt","splitEvery","splitWhen","prefix","symmetricDifference","symmetricDifferenceWith","takeLastWhile","XTakeWhile","_xtakeWhile","takeWhile","XTap","_xtap","tap","_isRegExp","toPairs","toPairsIn","transduce","transpose","outerlist","innerlist","traverse","ws","trim","beginRx","endRx","_tryCatch","tryer","catcher","unapply","unary","uncurryN","depth","endIdx","currentDepth","unfold","seed","uniqWith","unionWith","unless","whenFalseFn","until","valuesIn","vs","Const","view","when","whenTrueFn","where","testObj","whereEq","xprod","zip","rv","zipObj","zipWith","addConfig","network","staging","contractAddresses","kovan","mainnet","testnet","addressKey","esmContracts","ESM","address","abi","END","addContracts","CHIEF","VOTE_PROXY_FACTORY","POLLING","BATCH_POLLING","PAUSE","additionalServices","chief","ChiefService","voteProxy","VoteProxyService","voteProxyFactory","VoteProxyFactoryService","govPolling","GovPollingService","govQueryApi","GovQueryApiService","esm","EsmService","spell","SpellService","smartContract","token","erc20","currency","SAI_GOV","MCD_IOU","assign","DESCRIPTORS","getKeys","gOPS","$assign","A","K","T","aLen","getSymbols","isEnum","toLength","toAbsoluteIndex","IS_INCLUDES","$this","$getPrototypeOf","fails","KEY","TO_STRING","defineProperties","documentElement","addToUnscopables","_k","Arguments","META","$fails","wks","wksDefine","enumKeys","_create","gOPNExt","$GOPD","$GOPS","$DP","gOPN","$JSON","JSON","_stringify","stringify","HIDDEN","TO_PRIMITIVE","SymbolRegistry","AllSymbols","OPSymbols","USE_NATIVE","QObject","findChild","setSymbolDesc","D","protoDesc","sym","$defineProperty","$defineProperties","$propertyIsEnumerable","E","$getOwnPropertyDescriptor","$getOwnPropertyNames","$getOwnPropertySymbols","IS_OP","$set","es6Symbols","wellKnownSymbols","keyFor","useSetter","useSimple","FAILS_ON_PRIMITIVES","replacer","$replacer","setDesc","isExtensible","FREEZE","preventExtensions","setMeta","w","meta","NEED","fastKey","getWeak","onFreeze","symbols","windowNames","getWindowNames","check","buggy","$Object","_getIterator3","_toArray3","_createClass3","_bignumber2","amountToBigNumber","toBigNumber","_amount","isEqual","other","decimals","isSameType","bigNumberFnWrapper","isBoolean","assertValidOperation","right","otherBigNumber","bigNumberFnResult","_ref2","aliases","_iteratorNormalCompletion","_didIteratorError","_iteratorError","return","_ref3","_ref4","_iteratorNormalCompletion2","_didIteratorError2","_iteratorError2","getIterator","iterFn","ARG","tryGet","callee","_from2","isArrayIter","createProperty","getIterFn","arrayLike","mapfn","mapping","ArrayProto","SAFE_CLOSING","riter","skipClosing","safe","_defineProperty2","hasSymbol","sum","for","chiefInfo","contractInfo","candidates","addressData","identity","getSlateAddresses","chiefAddress","_chiefContract","web3Service","netId","networkName","getPastLogs","fromBlock","inception_block","toBlock","topics","events","lock","locks","lockLog","blockNumber","sender","paddedBytes32ToAddress","free","frees","freeLog","logObj","vote_addresses","votes","voteLog","parseVoteAddressData","vote_slate","slate","addresses","etch","picks","amt","mkrAmt","getLockLogs","voters","voter","getNumDeposits","deposits","parseFloat","withDeposits","addressDeposit","getVotedSlate","withSlates","withSlate","memoizedGetSlateAddresses","withVotes","voteTally","voteObj","vote","approvals","sortedAddresses","withPercentages","shapedVoteObj","percent","hat","slateHash","slates","web3js","LogNote","sig","log","guy","Etch","getWeb3ContractByName","getContractByName","LocalService","_arrayWithHoles","_iterableToArrayLimit","_arr","_n","_d","_s","_nonIterableRest","runtime","Op","iteratorSymbol","asyncIteratorSymbol","asyncIterator","toStringTagSymbol","innerFn","outerFn","tryLocsList","protoGenerator","Generator","generator","Context","_invoke","makeInvokeMethod","invoke","doneResult","delegate","delegateResult","maybeInvokeDelegate","ContinueSentinel","sent","_sent","dispatchException","abrupt","record","tryCatch","GeneratorFunction","GeneratorFunctionPrototype","getProto","NativeIteratorPrototype","Gp","defineIteratorMethods","AsyncIterator","PromiseImpl","previousPromise","enqueue","callInvokeWithMethodAndArg","__await","unwrapped","resultName","nextLoc","pushTryEntry","locs","entry","tryLoc","catchLoc","finallyLoc","afterLoc","tryEntries","resetTryEntry","completion","reset","iterable","iteratorMethod","displayName","isGeneratorFunction","genFun","awrap","async","skipTempReset","rootRecord","rval","exception","handle","loc","caught","hasCatch","hasFinally","finallyEntry","complete","thrown","delegateYield","regeneratorRuntime","accidentalStrictMode","superPropBase","_get","receiver","_superPropBase","_isNativeFunction","isNativeReflectConstruct","_construct","Parent","_promisify","unsafeCallback","ServiceManagerBase","_init","_connect","_auth","_type","_initPromise","_connectPromise","_authPromise","reason","_disconnect","_deauthenticate","isInitialized","isConnected","isReady","handler","onConnected","onAuthenticated","onReady","load","storage","debug","console","formatArgs","useColors","namespace","humanize","diff","color","lastC","save","namespaces","removeItem","WebkitAppearance","firebug","table","navigator","userAgent","chrome","local","localstorage","localStorage","colors","formatters","enable","prevTime","createDebug","enabled","curr","ms","coerce","unshift","formatter","logFn","selectColor","hash","disable","skips","h","plural","parse","long","fmtLong","fmtShort","_slicedToArray2","_standardizeConfig3","ServiceProvider","_ref$services","_ref$defaults","_ref$disabled","_config","_resolver","supports","serviceName","buildContainer","container","_standardizeConfig2","instanceName","_registerDependencies","_container","newDeps","deps","SetCache","arrayIncludes","arrayIncludesWith","cacheHas","createSet","isCommon","outer","computed","seenIndex","MapCache","setCacheAdd","setCacheHas","mapCacheClear","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","clear","Hash","ListCache","hashClear","hashDelete","hashGet","hashHas","hashSet","isMasked","toSource","reIsHostCtor","funcProto","objectProto","funcToString","reIsNative","nativeObjectToString","isOwn","unmasked","coreJsData","maskSrcKey","listCacheClear","listCacheDelete","listCacheGet","listCacheHas","listCacheSet","baseIndexOf","baseFindIndex","baseIsNaN","strictIndexOf","predicate","fromRight","baseValues","arrayLikeKeys","baseKeys","isIndex","isTypedArray","inherited","isArr","isArg","isBuff","isType","skipIndexes","baseIsArguments","stubFalse","freeExports","freeModule","reIsUint","baseIsTypedArray","baseUnary","nodeUtil","nodeIsTypedArray","typedArrayTags","freeProcess","types","isPrototype","nativeKeys","overArg","transform","toposort","nodes","cursor","sorted","visited","outgoingEdges","makeOutgoingEdges","edge","nodesHash","makeNodesHash","visit","node","predecessors","nodeRep","outgoing","child","delete","uniqueNodes","PublicService","PrivateService","base64","ieee754","kMaxLength","TYPED_ARRAY_SUPPORT","createBuffer","encodingOrOffset","allocUnsafe","fromArrayBuffer","byteOffset","byteLength","fromArrayLike","fromString","encoding","isEncoding","fromObject","checked","isnan","assertSize","loweredCase","utf8ToBytes","base64ToBytes","slowToString","end","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","swap","bidirectionalIndexOf","indexSize","arrLength","valLength","read","readUInt16BE","foundIndex","hexWrite","remaining","strLen","parsed","utf8Write","blitBuffer","asciiWrite","asciiToBytes","byteArray","latin1Write","base64Write","ucs2Write","utf16leToBytes","units","hi","lo","fromByteArray","secondByte","thirdByte","fourthByte","tempCodePoint","firstByte","codePoint","bytesPerSequence","decodeCodePointsArray","codePoints","fromCharCode","SlowBuffer","INSPECT_MAX_BYTES","typedArraySupport","subarray","poolSize","_augment","species","fill","allocUnsafeSlow","swap16","swap32","swap64","thisStart","thisEnd","thisCopy","targetCopy","toHex","bytes","checkOffset","ext","checkInt","objectWriteUInt16","littleEndian","objectWriteUInt32","checkIEEE754","writeFloat","noAssert","writeDouble","newBuf","sliceLen","readUIntLE","mul","readUIntBE","readUInt8","readUInt16LE","readUInt32LE","readUInt32BE","readIntLE","readIntBE","readInt8","readInt16LE","readInt16BE","readInt32LE","readInt32BE","readFloatLE","readFloatBE","readDoubleLE","readDoubleBE","writeUIntLE","writeUIntBE","writeUInt8","writeUInt16LE","writeUInt16BE","writeUInt32LE","writeUInt32BE","writeIntLE","sub","writeIntBE","writeInt8","writeInt16LE","writeInt16BE","writeInt32LE","writeInt32BE","writeFloatLE","writeFloatBE","writeDoubleLE","writeDoubleBE","targetStart","code","INVALID_BASE64_RE","leadSurrogate","toByteArray","base64clean","stringtrim","dst","b64","getLens","validLen","placeHoldersLen","tmp","Arr","_byteLength","curByte","revLookup","uint8","extraBytes","parts","encodeChunk","lookup","num","isLE","mLen","nBytes","eLen","eMax","eBias","nBits","rt","LN2","_arrayWithoutHoles","_iterableToArray","_nonIterableSpread","proxyAddress","_proxyContract","freeAll","_slate","addressToCheck","_getProxyStatus","hasProxy","otherRole","_getAddressOfRole","otherAddress","VoteProxy","voteProxyService","getContractByAddressAndAbi","voteProxyAbi","_proxyFactoryContract","coldMap","hotMap","proxyAddressCold","proxyAddressHot","ZERO_ADDRESS","hot","cold","coldAddress","hotAddress","_voteProxyService","_proxyAddress","_coldAddress","_hotAddress","initiateLink","ApproveLinkTransaction","build","breakLink","getVoteProxy","contract","transactionManager","_contract","_txMgr","promise","txo","_parseLogs","receipt","logs","LinkConfirmed","web3","_web3","topic","utils","keccak256","signature","receiptEvent","parsedLog","getTransaction","fees","timeStamp","timeStampSubmitted","startDate","endDate","multiHash","url","_pollingContract","createPoll","pollId","withdrawPoll","pollIds","optionIds","_batchPollingContract","rankings","optionIndex","optionId","getAllWhitelistedPolls","polls","filtered","lowest","lowestPoll","getOptionVotingFor","getOptionVotingForRankedChoice","optionIdRaw","ballotBuffer","ballot","choice","getAllOptionsVotingFor","rankedChoiceOption","option","getNumUniqueVoters","getMkrWeight","weight","_getPoll","endUnix","getMkrSupport","weights","cur","mkrSupport","getMkrSupportRankedChoice","totalMkrParticipation","tally","rounds","winner","defaultOptionObj","firstChoice","transfer","eliminated","filteredOptions","prv","prvVotes","curVotes","optionToEliminate","maxOption","getMkrAmtVoted","getToken","totalSupply","voted","total","getMkrAmtVotedRankedChoice","currentVotes","QueryApi","queryPromises","serverUrl","query","fetch","headers","Accept","body","resp","json","cacheKey","getQueryResponse","response","activePolls","uniqueVoters","unixTime","totalMkrWeightProxyAndNoProxyByAddressAtTime","currentVote","allCurrentVotes","currentVoteRankedChoice","getQueryResponseMemoized","timeToBlockNumber","voteMkrWeightsAtTimeRankedChoice","voteOptionMkrWeightsAtTime","totalWeight","percentage","joins","allEsmJoins","propIsEnumerable","shouldUseNative","test1","test2","test3","letter","getOwnPropertyDescriptors","descriptors","formatRegExp","isString","objects","isNull","msg","noDeprecation","warned","deprecated","throwDeprecation","traceDeprecation","trace","debugEnviron","debugs","stylize","stylizeNoColor","showHidden","_extend","isUndefined","customInspect","stylizeWithColor","formatValue","styleType","styles","recurseTimes","primitive","formatPrimitive","simple","isNumber","visibleKeys","arrayToHash","formatError","braces","toUTCString","formatArray","formatProperty","reduceToSingleString","numLinesEst","line","ar","re","debuglog","NODE_DEBUG","pid","isNullOrUndefined","months","timestamp","time","getHours","getMinutes","getSeconds","getDate","getMonth","origin","kCustomPromisifiedSymbol","callbackifyOnRejected","newReason","promisify","promiseResolve","promiseReject","custom","callbackify","callbackified","maybeCb","rej","superCtor","super_","TempCtor","tracksTransactionsWithOptions","numArguments","_esmContract","fired","_fired","_endContract","live","active","emergencyShutdownActive","Sum","currentAddress","skipChecks","mkrAmount","balance","mkrBalance","thresholdAmount","getTotalStaked","canFire","totalStaked","fire","getEsmJoins","stakes","parsedStakes","transactionHash","txHash","senderAddress","txFrom","joinAmount","blockTimestamp","sortedParsedStakes","_applyDecoratedDescriptor","decorators","initializer","decorator","correctArgsLength","newArgs","castFunction","nativeMin","reTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","isBinary","pauseInfo","pause","eta","action","executionDate","scheduledDate","delay","_pauseContract","spellAddress","DsSpellAbi","getEta","pauseAddress","paddedSpellAddress","plot","plotEvent","getBlock","getDone","execEvent","createPadding","padStart","chars","strLength","baseRepeat","castSlice","stringToArray","nativeCeil","charsLength","nativeFloor","baseSlice","baseProperty","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsSeq","rsSymbol","reUnicode","asciiToArray","unicodeToArray"],"mappings":";CAAA,SAAUA,iCAAiCC,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAQ,mCAAqCD,IAE7CD,EAAK,mCAAqCC,IAR5C,CASGK,QAAQ,WACX,O,YCTE,IAAIC,EAAmB,GAGvB,SAASC,oBAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUP,QAGnC,IAAIC,EAASI,EAAiBE,GAAY,CACzCC,EAAGD,EACHE,GAAG,EACHT,QAAS,IAUV,OANAU,EAAQH,GAAUI,KAAKV,EAAOD,QAASC,EAAQA,EAAOD,QAASM,qBAG/DL,EAAOQ,GAAI,EAGJR,EAAOD,QA0Df,OArDAM,oBAAoBM,EAAIF,EAGxBJ,oBAAoBO,EAAIR,EAGxBC,oBAAoBQ,EAAI,SAASd,EAASe,EAAMC,GAC3CV,oBAAoBW,EAAEjB,EAASe,IAClCG,OAAOC,eAAenB,EAASe,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEV,oBAAoBgB,EAAI,SAAStB,GACX,oBAAXuB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAenB,EAASuB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAenB,EAAS,aAAc,CAAEyB,OAAO,KAQvDnB,oBAAoBoB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQnB,oBAAoBmB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFAxB,oBAAoBgB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOnB,oBAAoBQ,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRvB,oBAAoB2B,EAAI,SAAShC,GAChC,IAAIe,EAASf,GAAUA,EAAO2B,WAC7B,SAASM,aAAe,OAAOjC,EAAgB,SAC/C,SAASkC,mBAAqB,OAAOlC,GAEtC,OADAK,oBAAoBQ,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRV,oBAAoBW,EAAI,SAASmB,EAAQC,GAAY,OAAOnB,OAAOoB,UAAUC,eAAe5B,KAAKyB,EAAQC,IAGzG/B,oBAAoBkC,EAAI,GAIjBlC,oBAAoBA,oBAAoBmC,EAAI,K,gBC5ErDxC,EAAOD,QANP,SAAS0C,uBAAuBC,GAC9B,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CACnC,QAAWA,K,cCIf1C,EAAOD,QANP,SAAS4C,gBAAgBC,EAAUC,GACjC,KAAMD,aAAoBC,GACxB,MAAM,IAAIC,UAAU,uC,cCFxB,SAASC,kBAAkBC,EAAQC,GACjC,IAAK,IAAI1C,EAAI,EAAGA,EAAI0C,EAAMC,OAAQ3C,IAAK,CACrC,IAAI4C,EAAaF,EAAM1C,GACvB4C,EAAWhC,WAAagC,EAAWhC,aAAc,EACjDgC,EAAWC,cAAe,EACtB,UAAWD,IAAYA,EAAWE,UAAW,GACjDpC,OAAOC,eAAe8B,EAAQG,EAAWrB,IAAKqB,IAUlDnD,EAAOD,QANP,SAASuD,aAAaT,EAAaU,EAAYC,GAG7C,OAFID,GAAYR,kBAAkBF,EAAYR,UAAWkB,GACrDC,GAAaT,kBAAkBF,EAAaW,GACzCX,I,cCbT,SAASY,gBAAgBzC,GAIvB,OAHAhB,EAAOD,QAAU0D,gBAAkBxC,OAAOyC,eAAiBzC,OAAO0C,eAAiB,SAASF,gBAAgBzC,GAC1G,OAAOA,EAAE4C,WAAa3C,OAAO0C,eAAe3C,IAEvCyC,gBAAgBzC,GAGzBhB,EAAOD,QAAU0D,iB,cCPjB,IAAII,EAAO7D,EAAOD,QAAU,CAAE+D,QAAS,UACrB,iBAAPC,MAAiBA,IAAMF,I,gBCDlC,IAAIH,EAAiB,EAAQ,IAiB7B1D,EAAOD,QAfP,SAASiE,UAAUC,EAAUC,GAC3B,GAA0B,mBAAfA,GAA4C,OAAfA,EACtC,MAAM,IAAIpB,UAAU,sDAGtBmB,EAAS5B,UAAYpB,OAAOY,OAAOqC,GAAcA,EAAW7B,UAAW,CACrE8B,YAAa,CACX3C,MAAOyC,EACPZ,UAAU,EACVD,cAAc,KAGdc,GAAYR,EAAeO,EAAUC,K,gBCd3C,IAAIE,EAAU,EAAQ,IAElBC,EAAwB,EAAQ,IAUpCrE,EAAOD,QARP,SAASuE,2BAA2BC,EAAM7D,GACxC,OAAIA,GAA2B,WAAlB0D,EAAQ1D,IAAsC,mBAATA,EAI3C2D,EAAsBE,GAHpB7D,I,gBCNX,IAAI8D,EAAQ,EAAQ,GAAR,CAAqB,OAC7BC,EAAM,EAAQ,IACdnD,EAAS,EAAQ,IAAaA,OAC9BoD,EAA8B,mBAAVpD,GAETtB,EAAOD,QAAU,SAAUe,GACxC,OAAO0D,EAAM1D,KAAU0D,EAAM1D,GAC3B4D,GAAcpD,EAAOR,KAAU4D,EAAapD,EAASmD,GAAK,UAAY3D,MAGjE0D,MAAQA,G,gBCVjBxE,EAAOD,QAAU,EAAQ,M,cCAzB,SAAS4E,mBAAmBC,EAAKC,EAASC,EAAQC,EAAOC,EAAQlD,EAAKmD,GACpE,IACE,IAAIC,EAAON,EAAI9C,GAAKmD,GAChBzD,EAAQ0D,EAAK1D,MACjB,MAAO2D,GAEP,YADAL,EAAOK,GAILD,EAAKE,KACPP,EAAQrD,GAER6D,QAAQR,QAAQrD,GAAO8D,KAAKP,EAAOC,GAwBvChF,EAAOD,QApBP,SAASwF,kBAAkBC,GACzB,OAAO,WACL,IAAIjB,EAAOkB,KACPC,EAAOC,UACX,OAAO,IAAIN,SAAQ,SAAUR,EAASC,GACpC,IAAIF,EAAMY,EAAGI,MAAMrB,EAAMmB,GAEzB,SAASX,MAAMvD,GACbmD,mBAAmBC,EAAKC,EAASC,EAAQC,MAAOC,OAAQ,OAAQxD,GAGlE,SAASwD,OAAOa,GACdlB,mBAAmBC,EAAKC,EAASC,EAAQC,MAAOC,OAAQ,QAASa,GAGnEd,WAAMe,S,0OC/BZ,YAEaC,GAAM,IAAAC,gBAAe,O,QAC3B,IAAMC,GAAM,IAAAD,gBAAe,O,6BAGA,qB,UACX,U,gBACM,gB,QACR,Q,MACF,M,MACA,M,QACE,Q,eAGO,6C,YAGH,2B,YACA,oD,sBAEvB,+C,cACyB,6C,gBCtB3B,IAAIE,EAAS,EAAQ,IACjBrC,EAAO,EAAQ,GACfsC,EAAM,EAAQ,IACdC,EAAO,EAAQ,IACfC,EAAM,EAAQ,IAGdC,QAAU,SAAUC,EAAMzF,EAAM0F,GAClC,IASI1E,EAAK2E,EAAKC,EATVC,EAAYJ,EAAOD,QAAQM,EAC3BC,EAAYN,EAAOD,QAAQQ,EAC3BC,EAAYR,EAAOD,QAAQU,EAC3BC,EAAWV,EAAOD,QAAQY,EAC1BC,EAAUZ,EAAOD,QAAQc,EACzBC,EAAUd,EAAOD,QAAQgB,EACzBvH,EAAU8G,EAAYhD,EAAOA,EAAK/C,KAAU+C,EAAK/C,GAAQ,IACzDyG,EAAWxH,EAAiB,UAC5BiD,EAAS6D,EAAYX,EAASa,EAAYb,EAAOpF,IAASoF,EAAOpF,IAAS,IAAa,UAG3F,IAAKgB,KADD+E,IAAWL,EAAS1F,GACZ0F,GAEVC,GAAOE,GAAa3D,QAA0B8C,IAAhB9C,EAAOlB,KAC1BuE,EAAItG,EAAS+B,KAExB4E,EAAMD,EAAMzD,EAAOlB,GAAO0E,EAAO1E,GAEjC/B,EAAQ+B,GAAO+E,GAAmC,mBAAf7D,EAAOlB,GAAqB0E,EAAO1E,GAEpEqF,GAAWV,EAAMN,EAAIO,EAAKR,GAE1BmB,GAAWrE,EAAOlB,IAAQ4E,EAAM,SAAWc,GAC3C,IAAIZ,EAAI,SAAUa,EAAGC,EAAG9G,GACtB,GAAI6E,gBAAgB+B,EAAG,CACrB,OAAQ7B,UAAUzC,QAChB,KAAK,EAAG,OAAO,IAAIsE,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAEC,GACrB,KAAK,EAAG,OAAO,IAAID,EAAEC,EAAGC,GACxB,OAAO,IAAIF,EAAEC,EAAGC,EAAG9G,GACrB,OAAO4G,EAAE5B,MAAMH,KAAME,YAGzB,OADAiB,EAAW,UAAIY,EAAW,UACnBZ,EAXyB,CAa/BF,GAAOO,GAA0B,mBAAPP,EAAoBP,EAAIwB,SAASjH,KAAMgG,GAAOA,EAEvEO,KACDlH,EAAQ6H,UAAY7H,EAAQ6H,QAAU,KAAK9F,GAAO4E,EAE/CH,EAAOD,QAAQuB,GAAKN,IAAaA,EAASzF,IAAMsE,EAAKmB,EAAUzF,EAAK4E,MAK9EJ,QAAQM,EAAI,EACZN,QAAQQ,EAAI,EACZR,QAAQU,EAAI,EACZV,QAAQY,EAAI,EACZZ,QAAQc,EAAI,GACZd,QAAQgB,EAAI,GACZhB,QAAQwB,EAAI,GACZxB,QAAQuB,EAAI,IACZ7H,EAAOD,QAAUuG,S,cC5DjB,IAAIJ,EAASlG,EAAOD,QAA2B,oBAAVI,QAAyBA,OAAO4H,MAAQA,KACzE5H,OAAwB,oBAARoE,MAAuBA,KAAKwD,MAAQA,KAAOxD,KAE3DoD,SAAS,cAATA,GACc,iBAAPK,MAAiBA,IAAM9B,I,gBCLlC,IAAI+B,EAAW,EAAQ,IACnBC,EAAiB,EAAQ,IACzBC,EAAc,EAAQ,IACtBC,EAAKnH,OAAOC,eAEhBnB,EAAQsI,EAAI,EAAQ,IAAoBpH,OAAOC,eAAiB,SAASA,eAAeoH,EAAGpB,EAAGqB,GAI5F,GAHAN,EAASK,GACTpB,EAAIiB,EAAYjB,GAAG,GACnBe,EAASM,GACLL,EAAgB,IAClB,OAAOE,EAAGE,EAAGpB,EAAGqB,GAChB,MAAOC,IACT,GAAI,QAASD,GAAc,QAASA,EAAY,MAAMzF,UAAU,4BAEhE,MADI,UAAWyF,IAAYD,EAAEpB,GAAKqB,EAAW/G,OACtC8G,I,gBCbTtI,EAAOD,SAAW,EAAQ,GAAR,EAAoB,WACpC,OAA+E,GAAxEkB,OAAOC,eAAe,GAAI,IAAK,CAAEE,IAAK,WAAc,OAAO,KAAQqG,M,cCF5E,SAASrD,QAAQ1B,GAaf,MAVsB,mBAAXpB,QAAoD,iBAApBA,OAAOmH,SAChDzI,EAAOD,QAAUqE,QAAU,SAASA,QAAQ1B,GAC1C,cAAcA,GAGhB1C,EAAOD,QAAUqE,QAAU,SAASA,QAAQ1B,GAC1C,OAAOA,GAAyB,mBAAXpB,QAAyBoB,EAAIyB,cAAgB7C,QAAUoB,IAAQpB,OAAOe,UAAY,gBAAkBK,GAItH0B,QAAQ1B,GAGjB1C,EAAOD,QAAUqE,S,gBChBjB,IAAIsE,EAAW,EAAQ,IACvB1I,EAAOD,QAAU,SAAU4I,GACzB,IAAKD,EAASC,GAAK,MAAM7F,UAAU6F,EAAK,sBACxC,OAAOA,I,cCHT,IAAIrG,EAAiB,GAAGA,eACxBtC,EAAOD,QAAU,SAAU4I,EAAI7G,GAC7B,OAAOQ,EAAe5B,KAAKiI,EAAI7G,K,gBCAjC,IAAIW,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETP,OAAOC,eAAenB,EAAS,oBAAqB,CAClDoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAOyH,EAAkB,WAG7B5H,OAAOC,eAAenB,EAAS,kBAAmB,CAChDoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO0H,EAAgB,WAG3B7H,OAAOC,eAAenB,EAAS,YAAa,CAC1CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO2H,EAAU,WAGrB9H,OAAOC,eAAenB,EAAS,eAAgB,CAC7CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO4H,EAAa,WAGxB/H,OAAOC,eAAenB,EAAS,gBAAiB,CAC9CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO6H,EAAc,WAGzBhI,OAAOC,eAAenB,EAAS,iBAAkB,CAC/CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO8H,EAAe,WAG1BjI,OAAOC,eAAenB,EAAS,iBAAkB,CAC/CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO+H,EAAe,WAG1BlI,OAAOC,eAAenB,EAAS,eAAgB,CAC7CoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAOgI,EAAa,WAIxB,IAAIP,EAAqBpG,EAAuBmG,EAAQ,KAEpDE,EAAmBrG,EAAuBmG,EAAQ,MAElDG,EAAatG,EAAuBmG,EAAQ,KAE5CI,EAAgBvG,EAAuBmG,EAAQ,MAE/CK,EAAiBxG,EAAuBmG,EAAQ,MAEhDM,EAAkBzG,EAAuBmG,EAAQ,MAEjDO,EAAkB1G,EAAuBmG,EAAQ,KAEjDQ,EAAgB3G,EAAuBmG,EAAQ,M,gBCtEnD,IAAIR,EAAK,EAAQ,IACbiB,EAAa,EAAQ,IACzBrJ,EAAOD,QAAU,EAAQ,IAAoB,SAAUoC,EAAQL,EAAKN,GAClE,OAAO4G,EAAGC,EAAElG,EAAQL,EAAKuH,EAAW,EAAG7H,KACrC,SAAUW,EAAQL,EAAKN,GAEzB,OADAW,EAAOL,GAAON,EACPW,I,cCNTnC,EAAOD,QAAU,SAAU4I,GACzB,MAAqB,iBAAPA,EAAyB,OAAPA,EAA4B,mBAAPA,I,cCDvD3I,EAAOD,QAAU,SAAUuJ,GACzB,IACE,QAASA,IACT,MAAOd,GACP,OAAO,K,gBCHX,IAAIe,EAAU,EAAQ,IAClBC,EAAU,EAAQ,IACtBxJ,EAAOD,QAAU,SAAU4I,GACzB,OAAOY,EAAQC,EAAQb,M,gBCJzB,IAAIc,EAAiB,EAAQ,KAEzBC,EAAuB,EAAQ,KAE/BC,EAA6B,EAAQ,IAErCC,EAAkB,EAAQ,KAM9B5J,EAAOD,QAJP,SAAS8J,eAAeC,EAAKvJ,GAC3B,OAAOkJ,EAAeK,IAAQJ,EAAqBI,EAAKvJ,IAAMoJ,EAA2BG,EAAKvJ,IAAMqJ,M,4NCTtG,QACA,YACA,Q,cAO2B,SAAdG,YAAcC,GACzB,OAAQC,SAASD,EAAI,KACnB,KAAK,EACH,MAAO,UACT,KAAK,GACH,MAAO,QACT,KAAK,IACH,MAAO,UACT,QACE,MAAO,K,kBAIkB,SAAlBE,gBAAkBF,GAC7B,OAAQC,SAASD,EAAI,KACnB,KAAK,EACH,OAAOG,cACT,KAAK,GACH,OAAOC,YACT,QACE,OAAOC,wB,yBAIyB,SAAzBC,uBAAyBN,GACpC,OAAQC,SAASD,EAAI,KACnB,KAAK,EACH,OAAOK,sBACT,KAAK,GACH,OAAOD,YACT,QACE,OAAOC,wBAIN,IAAME,GAAc,IAAAC,mBAAkB,CAAEzE,Y,8BAEpB,SAAd0E,YAAeC,EAAGlJ,GAAJ,aACzB,EAAAmJ,MAAMC,KAAK,CAAE1H,OAAQwH,IAClBG,KAAI,kBAAM,MACVC,OAFH,sBAEatJ,K,WAES,SAAXuJ,SAAYC,EAAQC,GAC/B,IAAIC,EACAC,EACAC,EAEAC,EADAC,EAAM,IAAIC,UAAUP,GAAQQ,SAAS,IAUzC,GANKP,IACHA,EAAO,IAGTG,EAAS,CAAEK,EAAG,MAAO,KAAM,UAAWR,EAAKG,SAAWH,EAAKG,QAAU,MAE/C,MAAlBE,EAAII,OAAO,GACb,MAAM,IAAIC,MAAM,4DASlB,IANAN,EAAqB,SAAdJ,EAAKI,KAAkBtD,KAAK6D,KAAKN,EAAIpI,OAAS,GAAK+H,EAAKI,MAAQ,EAEvEF,EAAMpD,KAAK6D,KAAKN,EAAIpI,QAAU,EAAImI,IAASA,EAC3CH,EAAMW,EAAOC,MAAMX,GAGZG,EAAIpI,OAAS,EAAIiI,GACtBG,EAAM,IAAH,OAAOA,GAYZ,OATKA,EAAIS,MAAM,IAAIC,OAAJ,aAAiB,EAAIX,EAArB,QAAgCY,QAAO,SAAAzJ,GAAC,OAAIA,EAAEU,OAAS,KAEnEgJ,SAAQ,SAACC,EAAO5L,GACjB,IAAK,IAAI6L,EAAI,EAAGA,EAAIf,EAAMe,IAAK,CAE7BlB,EADS3K,EAAI8K,GAAmB,QAAXD,EAAmBgB,EAAIf,EAAOe,EAAI,IAC7CnC,SAASkC,EAAME,MAAU,EAAJD,EAAW,EAAJA,EAAQ,GAAI,QAI/ClB,G,aAGiB,SAAboB,WAAcpB,EAAKD,GACzBA,IACHA,EAAO,IAGT,IAAIG,EACF,CAAEK,EAAG,MAAO,KAAM,UAAWR,EAAKG,SAAWH,EAAKG,QAAU,MAE1DC,EAAqB,SAAdJ,EAAKI,KAAkBtD,KAAK6D,KAAKV,EAAIhI,QAAU+H,EAAKI,MAAQ,EAEvE,GAAIH,EAAIhI,OAASmI,GAAS,EACxB,MAAM,IAAIkB,WAAJ,yBACcrB,EAAIhI,OADlB,yCACyDmI,EADzD,MAMR,IADA,IAAIC,EAAM,GACD/K,EAAI,EAAGA,EAAI2K,EAAIhI,OAAQ3C,GAAK8K,EAAM,CAEzC,IADA,IAAIc,EAAQ,GACHC,EAAI,EAAGA,EAAIf,EAAMe,IACxBD,EAAMK,KAAKtB,EAAI3K,GAAgB,QAAX6K,EAAmBgB,EAAIf,EAAOe,EAAI,KAGxDd,EAAIkB,KAAKL,EAAMtB,KAAI,SAAAjK,GAAC,OAAKA,EAAI,GAAK,IAAM,IAAMA,EAAE4K,SAAS,OAAKiB,KAAK,KAGrE,OAAO,IAAIlB,UAAUD,EAAImB,KAAK,IAAK,O,wCCtGrCzM,EAAOD,QAfP,SAAS2M,gBAAgBhK,EAAKZ,EAAKN,GAYjC,OAXIM,KAAOY,EACTzB,OAAOC,eAAewB,EAAKZ,EAAK,CAC9BN,MAAOA,EACPL,YAAY,EACZiC,cAAc,EACdC,UAAU,IAGZX,EAAIZ,GAAON,EAGNkB,I,cCZT1C,EAAOD,QAAU,SAAU4M,EAAQnL,GACjC,MAAO,CACLL,aAAuB,EAATwL,GACdvJ,eAAyB,EAATuJ,GAChBtJ,WAAqB,EAATsJ,GACZnL,MAAOA,K,gBCJX,IAAIgI,EAAU,EAAQ,IACtBxJ,EAAOD,QAAU,SAAU4I,GACzB,OAAO1H,OAAOuI,EAAQb,M,cCHxB3I,EAAOD,QAAU,I,gBCEjB,IAAI0C,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAQ6M,uBAAyB7M,EAAO,aAAc,EAEtD,IAAI8M,EAAgBpK,EAAuBmG,EAAQ,KAOnD7I,EAAO,QALW,CAChB+M,MAAO,QACPC,OAAQ,SACRC,QAAS,WAGX,IAwBIJ,EAAyB,CAC3BE,MAzB0B,CAC1BG,QAAS,CAACJ,EAAa,QAAYK,cACnCA,aAAc,CAACL,EAAa,QAAYI,QAASJ,EAAa,QAAYM,OAC1EA,MAAO,CAACN,EAAa,QAAYO,OACjCA,MAAO,IAsBPL,OApB2B,CAC3BE,QAAS,CAACJ,EAAa,QAAYK,cACnCA,aAAc,CAACL,EAAa,QAAYI,QAASJ,EAAa,QAAYQ,SAC1EA,QAAS,CAACR,EAAa,QAAYS,YACnCA,WAAY,CAACT,EAAa,QAAYQ,QAASR,EAAa,QAAYM,OACxEA,MAAO,CAACN,EAAa,QAAYQ,QAASR,EAAa,QAAYO,OACnEA,MAAO,IAePJ,QAb4B,CAC5BC,QAAS,CAACJ,EAAa,QAAYK,cACnCA,aAAc,CAACL,EAAa,QAAYI,QAASJ,EAAa,QAAYQ,SAC1EA,QAAS,CAACR,EAAa,QAAYS,YACnCA,WAAY,CAACT,EAAa,QAAYQ,QAASR,EAAa,QAAYU,QACxEA,OAAQ,CAACV,EAAa,QAAYQ,QAASR,EAAa,QAAYW,gBACpEA,eAAgB,CAACX,EAAa,QAAYU,OAAQV,EAAa,QAAYM,OAC3EA,MAAO,CAACN,EAAa,QAAYQ,QAASR,EAAa,QAAYU,OAAQV,EAAa,QAAYO,OACpGA,MAAO,KAOTrN,EAAQ6M,uBAAyBA,G,gBC9CjC,IAAIa,EAAa,EAAQ,IAGrBC,EAA0B,iBAARnJ,MAAoBA,MAAQA,KAAKtD,SAAWA,QAAUsD,KAGxE1E,EAAO4N,GAAcC,GAAY/F,SAAS,cAATA,GAErC3H,EAAOD,QAAUF,G,gBCPjB,IAAI8N,EAAQ,EAAQ,IAChBC,EAAc,EAAQ,IAE1B5N,EAAOD,QAAUkB,OAAO4M,MAAQ,SAASA,KAAKvF,GAC5C,OAAOqF,EAAMrF,EAAGsF,K,cCLlB5N,EAAOD,SAAU,G,cCAjB,IAAIiK,EAAK,EACL8D,EAAK/F,KAAKgG,SACd/N,EAAOD,QAAU,SAAU+B,GACzB,MAAO,UAAUgJ,YAAehF,IAARhE,EAAoB,GAAKA,EAAK,QAASkI,EAAK8D,GAAItC,SAAS,O,cCHnFzL,EAAQsI,EAAI,GAAG2F,sB,gBCEf,IAAIvL,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAIkO,EAAmBxL,EAAuBmG,EAAQ,IAElDsF,EAAgBzL,EAAuBmG,EAAQ,IAE/CO,EAAkB1G,EAAuBmG,EAAQ,KAEjDuF,EAAe1L,EAAuBmG,EAAQ,KAE9CiE,EAAgBpK,EAAuBmG,EAAQ,KAMnD,SAASwF,wBAAwB7H,QACA,IAApBd,KAAK4I,aACd5I,KAAK4I,WAAa,cAGhB9H,IAAS4H,EAAY,QAAYrB,aACP,IAAjBrH,KAAK6I,UACd7I,KAAK6I,QAAU,cAGjB7I,KAAK8I,WAAa,cAGhBhI,IAAS4H,EAAY,QAAYnB,eACF,IAAtBvH,KAAK+I,eACd/I,KAAK+I,aAAe,cAGtB/I,KAAKgJ,eAAiB,cAY1B,SAASC,qBAAqBnI,EAAMzF,EAAM6N,GACxC,IAAIC,EAAQnJ,KAER6I,EAAU/H,IAAS4H,EAAY,QAAYrB,MAAQ,KAAO,SAAUyB,GAEtE,OADAK,EAAML,WAAaA,EACZK,EAAMN,WAEXO,EAAOtI,IAAS4H,EAAY,QAAYnB,QAAU,KAAO,SAAUyB,GAErE,OADAG,EAAMH,eAAiBA,EAChBG,EAAMJ,gBAEf,OAAO,IAAIrF,EAAe,QAAYrI,EAAM6N,GAAc,SAAUG,GAClE,OAAOF,EAAMP,WAAWS,KACvBR,EAASO,GAQd,SAASE,uBAAuBC,GAC9B,IAAIC,EAASxJ,KAEbuJ,EAAIE,eAAc,WACZF,EAAIzI,SAAW4H,EAAY,QAAYrB,OACzCkC,EAAIL,eAAezC,SAAQ,SAAUrL,GACnCoO,EAAO7N,IAAIP,GAAGsO,UAAUC,gBAAe,WACrC,OAAOH,EAAOV,mBAKhBS,EAAIzI,SAAW4H,EAAY,QAAYnB,SACzCgC,EAAIL,eAAezC,SAAQ,SAAUrL,GACnCoO,EAAO7N,IAAIP,GAAGsO,UAAUE,mBAAkB,WACxC,OAAOJ,EAAOR,0BAWxB,SAASa,yBACP,IAAIC,EAAW,CACblB,WAAY5I,KAAK4I,WACjBC,QAAS7I,KAAK6I,QACdE,aAAc/I,KAAK+I,cAGrB/I,KAAK4I,WAAa,SAAUS,GAC1B,GAAIrJ,KAAK0J,UAAUK,UAAY3C,EAAa,QAAYK,aACtD,MAAM,IAAIvB,MAAM,wCAA0ClG,KAAK0J,UAAUK,QAAU,0FAGrF,OAAOD,EAASlB,WAAWzI,MAAMH,KAAM,CAACqJ,UAGV,IAArBS,EAASjB,UAClB7I,KAAK6I,QAAU,WACb,GAAI7I,KAAK0J,UAAUK,UAAY3C,EAAa,QAAYS,WACtD,MAAM,IAAI3B,MAAM,sCAAwClG,KAAK0J,UAAUK,QAAU,oFAGnF,OAAOD,EAASjB,QAAQ1I,MAAMH,aAIG,IAA1B8J,EAASf,eAClB/I,KAAK+I,aAAe,WAClB,GAAI/I,KAAK0J,UAAUK,UAAY3C,EAAa,QAAYW,eACtD,MAAM,IAAI7B,MAAM,0CAA4ClG,KAAK0J,UAAUK,QAAU,8FAGvF,OAAOD,EAASf,aAAa5I,MAAMH,QAKzC,IAmDIgK,EAnD2B,WAM7B,SAASC,YAAYnJ,EAAMzF,GACzB,IAAI6N,EAAehJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAQvF,IAPA,EAAIsI,EAAgB,SAAaxI,KAAMiK,aAClC5O,IAAMA,EAAO2E,KAAKtB,YAAYwL,MAE/BlK,KAAKtB,YAAYwK,eACnBA,EAAelJ,KAAKtB,YAAYwK,mBAGW,IAAlCR,EAAY,QAAY5H,GACjC,MAAM,IAAIoF,MAAM,wBAA0BpF,GAG5C6H,wBAAwB1N,KAAK+E,KAAMc,GAEnCd,KAAKmK,gBAAkBlB,qBAAqBhO,KAAK+E,KAAMc,EAAMzF,EAAM6N,GAEnEI,uBAAuBrO,KAAK+E,KAAMA,KAAKmK,iBAEvCN,uBAAuB5O,KAAK+E,MAuB9B,OAhBA,EAAIyI,EAAa,SAAawB,YAAa,CAAC,CAC1C5N,IAAK,UACLN,MAAO,SAAS2N,UACd,OAAO1J,KAAKmK,kBAOb,CACD9N,IAAK,MACLN,MAAO,SAASJ,IAAIyO,GAClB,OAAOpK,KAAKmK,gBAAgBC,WAAWA,OAGpCH,YAhDsB,GAoD/B3P,EAAO,QAAc0P,G,gBC5LrB,IAGIK,EAHY,EAAQ,GAGLC,CAAU9O,OAAQ,UAErCjB,EAAOD,QAAU+P,G,gBCLjB,IAAIxO,EAAS,EAAQ,IACjB0O,EAAY,EAAQ,KACpBC,EAAiB,EAAQ,KAOzBC,EAAiB5O,EAASA,EAAOC,iBAAcuE,EAkBnD9F,EAAOD,QATP,SAASoQ,WAAW3O,GAClB,OAAa,MAATA,OACesE,IAAVtE,EAdQ,qBADL,gBAiBJ0O,GAAkBA,KAAkBjP,OAAOO,GAC/CwO,EAAUxO,GACVyO,EAAezO,K,gBCxBrB,IAAI4O,EAAK,EAAQ,KAoBjBpQ,EAAOD,QAVP,SAASsQ,aAAaC,EAAOxO,GAE3B,IADA,IAAIoB,EAASoN,EAAMpN,OACZA,KACL,GAAIkN,EAAGE,EAAMpN,GAAQ,GAAIpB,GACvB,OAAOoB,EAGX,OAAQ,I,gBCjBV,IAAIqN,EAAY,EAAQ,KAiBxBvQ,EAAOD,QAPP,SAASyQ,WAAW3F,EAAK/I,GACvB,IAAI2O,EAAO5F,EAAI6F,SACf,OAAOH,EAAUzO,GACb2O,EAAmB,iBAAP3O,EAAkB,SAAW,QACzC2O,EAAK5F,M,cCcX7K,EAAOD,QAJP,SAAS4Q,aAAanP,GACpB,OAAgB,MAATA,GAAiC,iBAATA,I,gBCxBjC,IAAIoP,EAAY,EAAQ,KACxB5Q,EAAOD,QAAU,SAAUyF,EAAIqL,EAAM3N,GAEnC,GADA0N,EAAUpL,QACGM,IAAT+K,EAAoB,OAAOrL,EAC/B,OAAQtC,GACN,KAAK,EAAG,OAAO,SAAUuE,GACvB,OAAOjC,EAAG9E,KAAKmQ,EAAMpJ,IAEvB,KAAK,EAAG,OAAO,SAAUA,EAAGC,GAC1B,OAAOlC,EAAG9E,KAAKmQ,EAAMpJ,EAAGC,IAE1B,KAAK,EAAG,OAAO,SAAUD,EAAGC,EAAG9G,GAC7B,OAAO4E,EAAG9E,KAAKmQ,EAAMpJ,EAAGC,EAAG9G,IAG/B,OAAO,WACL,OAAO4E,EAAGI,MAAMiL,EAAMlL,c,gBChB1B,IAAI+C,EAAW,EAAQ,IAGvB1I,EAAOD,QAAU,SAAU4I,EAAI3B,GAC7B,IAAK0B,EAASC,GAAK,OAAOA,EAC1B,IAAInD,EAAIsL,EACR,GAAI9J,GAAkC,mBAArBxB,EAAKmD,EAAG6C,YAA4B9C,EAASoI,EAAMtL,EAAG9E,KAAKiI,IAAM,OAAOmI,EACzF,GAAgC,mBAApBtL,EAAKmD,EAAGoI,WAA2BrI,EAASoI,EAAMtL,EAAG9E,KAAKiI,IAAM,OAAOmI,EACnF,IAAK9J,GAAkC,mBAArBxB,EAAKmD,EAAG6C,YAA4B9C,EAASoI,EAAMtL,EAAG9E,KAAKiI,IAAM,OAAOmI,EAC1F,MAAMhO,UAAU,6C,cCVlB,IAAI0I,EAAW,GAAGA,SAElBxL,EAAOD,QAAU,SAAU4I,GACzB,OAAO6C,EAAS9K,KAAKiI,GAAI0D,MAAM,GAAI,K,cCFrCrM,EAAOD,QAAU,SAAU4I,GACzB,GAAU7C,MAAN6C,EAAiB,MAAM7F,UAAU,yBAA2B6F,GAChE,OAAOA,I,cCFT,IAAIiD,EAAO7D,KAAK6D,KACZoF,EAAQjJ,KAAKiJ,MACjBhR,EAAOD,QAAU,SAAU4I,GACzB,OAAOsI,MAAMtI,GAAMA,GAAM,GAAKA,EAAK,EAAIqI,EAAQpF,GAAMjD,K,gBCJvD,IAAIuI,EAAS,EAAQ,GAAR,CAAqB,QAC9BzM,EAAM,EAAQ,IAClBzE,EAAOD,QAAU,SAAU+B,GACzB,OAAOoP,EAAOpP,KAASoP,EAAOpP,GAAO2C,EAAI3C,M,gBCH3C,IAAI+B,EAAO,EAAQ,GACfqC,EAAS,EAAQ,IAEjB1B,EAAQ0B,EADC,wBACkBA,EADlB,sBACmC,KAE/ClG,EAAOD,QAAU,SAAU+B,EAAKN,GAC/B,OAAOgD,EAAM1C,KAAS0C,EAAM1C,QAAiBgE,IAAVtE,EAAsBA,EAAQ,MAChE,WAAY,IAAIgL,KAAK,CACtB1I,QAASD,EAAKC,QACdpC,KAAM,EAAQ,IAAgB,OAAS,SACvCyP,UAAW,0C,cCTbnR,EAAOD,QAAU,gGAEfgM,MAAM,M,cCHRhM,EAAQsI,EAAIpH,OAAOmQ,uB,gBCCnB,IAAIC,EAAM,EAAQ,IAAR,EAAwB,GAGlC,EAAQ,GAAR,CAA0BC,OAAQ,UAAU,SAAUC,GACpD9L,KAAK+L,GAAKF,OAAOC,GACjB9L,KAAKgM,GAAK,KAET,WACD,IAEIC,EAFApJ,EAAI7C,KAAK+L,GACTG,EAAQlM,KAAKgM,GAEjB,OAAIE,GAASrJ,EAAEpF,OAAe,CAAE1B,WAAOsE,EAAWV,MAAM,IACxDsM,EAAQL,EAAI/I,EAAGqJ,GACflM,KAAKgM,IAAMC,EAAMxO,OACV,CAAE1B,MAAOkQ,EAAOtM,MAAM,Q,gBCd/B,IAAI6C,EAAW,EAAQ,IACnB2J,EAAM,EAAQ,KACdhE,EAAc,EAAQ,IACtBiE,EAAW,EAAQ,GAAR,CAAyB,YACpCC,MAAQ,aAIRC,WAAa,WAEf,IAIIC,EAJAC,EAAS,EAAQ,GAAR,CAAyB,UAClC1R,EAAIqN,EAAY1K,OAcpB,IAVA+O,EAAOC,MAAMC,QAAU,OACvB,EAAQ,KAAWC,YAAYH,GAC/BA,EAAOI,IAAM,eAGbL,EAAiBC,EAAOK,cAAcC,UACvBC,OACfR,EAAeS,MAAMC,uCACrBV,EAAeW,QACfZ,WAAaC,EAAepL,EACrBrG,YAAYwR,WAAoB,UAAEnE,EAAYrN,IACrD,OAAOwR,cAGT/R,EAAOD,QAAUkB,OAAOY,QAAU,SAASA,OAAOyG,EAAGsK,GACnD,IAAIC,EAQJ,OAPU,OAANvK,GACFwJ,MAAe,UAAI7J,EAASK,GAC5BuK,EAAS,IAAIf,MACbA,MAAe,UAAI,KAEnBe,EAAOhB,GAAYvJ,GACduK,EAASd,kBACMjM,IAAf8M,EAA2BC,EAASjB,EAAIiB,EAAQD,K,gBCvCzD,IAAIE,EAAM,EAAQ,IAAgBzK,EAC9BhC,EAAM,EAAQ,IACd0M,EAAM,EAAQ,EAAR,CAAkB,eAE5B/S,EAAOD,QAAU,SAAU4I,EAAIqK,EAAKC,GAC9BtK,IAAOtC,EAAIsC,EAAKsK,EAAOtK,EAAKA,EAAGtG,UAAW0Q,IAAMD,EAAInK,EAAIoK,EAAK,CAAE3P,cAAc,EAAM5B,MAAOwR,M,gBCLhGjT,EAAQsI,EAAI,EAAQ,I,gBCApB,IAAInC,EAAS,EAAQ,IACjBrC,EAAO,EAAQ,GACfqP,EAAU,EAAQ,IAClBC,EAAS,EAAQ,IACjBjS,EAAiB,EAAQ,IAAgBmH,EAC7CrI,EAAOD,QAAU,SAAUe,GACzB,IAAIsS,EAAUvP,EAAKvC,SAAWuC,EAAKvC,OAAS4R,EAAU,GAAKhN,EAAO5E,QAAU,IACtD,KAAlBR,EAAK4K,OAAO,IAAe5K,KAAQsS,GAAUlS,EAAekS,EAAStS,EAAM,CAAEU,MAAO2R,EAAO9K,EAAEvH,O,cCPnG,SAASuS,gBAAgBrS,EAAGuB,GAM1B,OALAvC,EAAOD,QAAUsT,gBAAkBpS,OAAOyC,gBAAkB,SAAS2P,gBAAgBrS,EAAGuB,GAEtF,OADAvB,EAAE4C,UAAYrB,EACPvB,GAGFqS,gBAAgBrS,EAAGuB,GAG5BvC,EAAOD,QAAUsT,iB,gBCPjB,IAAI5Q,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAQuT,2BAA6BvT,EAAQwT,uBAAyBxT,EAAQyT,oBAAsBzT,EAAO,aAAc,EAEzH,IAAI0T,EAAWhR,EAAuBmG,EAAQ,KAE1C8K,EAAQjR,EAAuBmG,EAAQ,MAEvCsF,EAAgBzL,EAAuBmG,EAAQ,IAE/CqF,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAElDkL,EAAoBrR,EAAuBmG,EAAQ,KAEnDmL,EAAuBtR,EAAuBmG,EAAQ,MAE1D,SAASoL,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAO3b,IAAIW,EAAmC,SAAUmB,IAC/C,EAAIhB,EAAU,SAAaH,oBAAqBmB,GAEhD,IAAIC,EAASZ,aAAaR,qBAE1B,SAASA,oBAAoBqB,GAE3B,OADA,EAAI5G,EAAgB,SAAaxI,KAAM+N,qBAChCoB,EAAOlU,KAAK+E,KAAMoP,GAG3B,OAAOrB,oBAV8B,EAWvB,EAAIM,EAAiB,SAAanI,QAMlD5L,EAAQyT,oBAAsBA,EAE9B,IAAID,EAAsC,SAAUuB,IAClD,EAAInB,EAAU,SAAaJ,uBAAwBuB,GAEnD,IAAIC,EAAUf,aAAaT,wBAE3B,SAASA,uBAAuByB,EAASnF,GAEvC,OADA,EAAI5B,EAAgB,SAAaxI,KAAM8N,wBAChCwB,EAAQrU,KAAK+E,KAAM,oBAAsBoK,EAAa,2BAA6BmF,GAG5F,OAAOzB,uBAViC,EAW1B,EAAIO,EAAiB,SAAanI,QAMlD5L,EAAQwT,uBAAyBA,EAEjC,IAAID,EAA0C,SAAU2B,IACtD,EAAItB,EAAU,SAAaL,2BAA4B2B,GAEvD,IAAIC,EAAUlB,aAAaV,4BAE3B,SAASA,2BAA2B0B,EAASnF,GAE3C,OADA,EAAI5B,EAAgB,SAAaxI,KAAM6N,4BAChC4B,EAAQxU,KAAK+E,KAAM,cAAgBoK,EAAa,eAAiBmF,EAAU,oBAGpF,OAAO1B,2BAVqC,EAW9B,EAAIQ,EAAiB,SAAanI,QAUlD,SAASwJ,qBAAqBC,GAC5B,OAAO/P,QAAQgQ,IAAI5P,KAAKkJ,eAAe9D,KAAI,SAAUgF,GACnD,OAAOuF,EAASvF,OAJpB9P,EAAQuT,2BAA6BA,EAYrC,IAAIgC,EAA8B,SAAUC,IAC1C,EAAI5B,EAAU,SAAa2B,eAAgBC,GAE3C,IAAIC,EAAUxB,aAAasB,gBAsB3B,SAASA,eAAexU,GACtB,IAAI8N,EAEAD,EAAehJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GACnF8P,EAAO9P,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAC3E2I,EAAU3I,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAC9EkJ,EAAOlJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAI/E,IAHA,EAAIsI,EAAgB,SAAaxI,KAAM6P,gBACvC1G,EAAQ4G,EAAQ9U,KAAK+E,KAAMgQ,EAAMnH,EAASO,IAErC/N,EACH,MAAM,IAAI6K,MAAM,mCASlB,OANAiD,EAAM8G,MAAQ5U,EACd8N,EAAM+G,cAAgBhH,EACtBC,EAAMgH,YAAc,GACpBjH,EAAazC,SAAQ,SAAUrL,GAC7B,OAAO+N,EAAMgH,YAAY/U,GAAK,QAEzB+N,EAsGT,OA9IA,EAAIV,EAAa,SAAaoH,eAAgB,KAAM,CAAC,CACnDxT,IAAK,iBAMLN,MAAO,SAASqU,eAAeb,GAC7B,OAAmB,OAAZA,GAA0D,YAAtC,EAAIvB,EAAQ,SAAauB,IAAoD,mBAApBA,EAAQ7F,aAmChG,EAAIjB,EAAa,SAAaoH,eAAgB,CAAC,CAC7CxT,IAAK,OACLN,MAAO,SAASV,OACd,OAAO2E,KAAKiQ,QAEb,CACD5T,IAAK,eACLN,MAAO,SAASmN,eACd,OAAOlJ,KAAKkQ,gBAEb,CACD7T,IAAK,SACLN,MAAO,SAASsU,OAAOjG,EAAYmF,GACjC,QAA4C,IAAjCvP,KAAKmQ,YAAY/F,GAC1B,MAAM,IAAI0D,EAAuB9N,KAAK3E,OAAQ+O,GAGhD,IAAKyF,eAAeO,eAAeb,GACjC,MAAM,IAAIxB,EAAoB,oCAAsC/N,KAAK3E,QAI3E,OADA2E,KAAKmQ,YAAY/F,GAAcmF,EACxBvP,OAER,CACD3D,IAAK,aACLN,MAAO,SAASqO,WAAW/O,GACzB,IAAK2E,KAAKmQ,YAAY9U,GACpB,MAAM,IAAIwS,EAA2B7N,KAAK3E,OAAQA,GAGpD,OAAO2E,KAAKmQ,YAAY9U,KAEzB,CACDgB,IAAK,aACLN,MAAO,SAAS6M,aACd,IAAIY,EAASxJ,KAEb,OAAOA,KAAKsQ,yBAAyBzQ,MAAK,WACxC,OAAO,EAAIoO,EAAK,UAAa,EAAIG,EAAgB,SAAayB,eAAejT,WAAY,aAAc4M,GAAQvO,KAAKuO,EAAQA,EAAO+G,gBAGtI,CACDlU,IAAK,UACLN,MAAO,SAAS8M,UACd,IAAI2H,EAASxQ,KAEb,OAAOA,KAAKyQ,sBAAsB5Q,MAAK,WACrC,OAAO,EAAIoO,EAAK,UAAa,EAAIG,EAAgB,SAAayB,eAAejT,WAAY,UAAW4T,GAAQvV,KAAKuV,QAGpH,CACDnU,IAAK,eACLN,MAAO,SAASgN,eACd,IAAI2H,EAAS1Q,KAEb,OAAOA,KAAK2Q,2BAA2B9Q,MAAK,WAC1C,OAAO,EAAIoO,EAAK,UAAa,EAAIG,EAAgB,SAAayB,eAAejT,WAAY,eAAgB8T,GAAQzV,KAAKyV,QAGzH,CACDrU,IAAK,yBACLN,MAAO,SAASuU,yBACd,IAAIM,EAAS5Q,KAEb,OAAO0P,qBAAqBzU,KAAK+E,MAAM,SAAU5E,GAC/C,OAAOwV,EAAOxG,WAAWhP,GAAGsO,UAAUd,kBAGzC,CACDvM,IAAK,sBACLN,MAAO,SAAS0U,sBACd,IAAII,EAAS7Q,KAEb,OAAO0P,qBAAqBzU,KAAK+E,MAAM,SAAU5E,GAC/C,OAAOyV,EAAOzG,WAAWhP,GAAGsO,UAAUb,eAGzC,CACDxM,IAAK,2BACLN,MAAO,SAAS4U,2BACd,IAAIG,EAAS9Q,KAEb,OAAO0P,qBAAqBzU,KAAK+E,MAAM,SAAU5E,GAC/C,OAAO0V,EAAO1G,WAAWhP,GAAGsO,UAAUX,oBAGzC,CACD1M,IAAK,gBACLN,MAAO,SAASgV,gBACd,IAAIC,EAAShR,KAEb,MAAO,CACL0J,QAAS,SAASA,UAChB,OAAOsH,QAKRnB,eAnJyB,CAoJhCvB,EAAoB,SAEtBhU,EAAO,QAAcuV,G,gBC7PrB,IAAI3R,EAAiB,EAAQ,GAEzBD,EAAiB,EAAQ,IAEzBgT,EAAmB,EAAQ,KAE3BrC,EAAY,EAAQ,KAExB,SAASsC,iBAAiBC,GACxB,IAAIC,EAAwB,mBAARC,IAAqB,IAAIA,SAAQhR,EA8BrD,OA5BA9F,EAAOD,QAAU4W,iBAAmB,SAASA,iBAAiBC,GAC5D,GAAc,OAAVA,IAAmBF,EAAiBE,GAAQ,OAAOA,EAEvD,GAAqB,mBAAVA,EACT,MAAM,IAAI9T,UAAU,sDAGtB,QAAsB,IAAX+T,EAAwB,CACjC,GAAIA,EAAOxQ,IAAIuQ,GAAQ,OAAOC,EAAOzV,IAAIwV,GAEzCC,EAAOE,IAAIH,EAAOI,SAGpB,SAASA,UACP,OAAO3C,EAAUuC,EAAOjR,UAAWhC,EAAe8B,MAAMtB,aAW1D,OARA6S,QAAQ3U,UAAYpB,OAAOY,OAAO+U,EAAMvU,UAAW,CACjD8B,YAAa,CACX3C,MAAOwV,QACP7V,YAAY,EACZkC,UAAU,EACVD,cAAc,KAGXM,EAAesT,QAASJ,IAG1BD,iBAAiBC,GAG1B5W,EAAOD,QAAU4W,kB,gBC1CjB,IAAIvS,EAAU,EAAQ,IAEtB,SAAS6S,2BACP,GAAuB,mBAAZC,QAAwB,OAAO,KAC1C,IAAIC,EAAQ,IAAID,QAMhB,OAJAD,yBAA2B,SAASA,2BAClC,OAAOE,GAGFA,EA4CTnX,EAAOD,QAzCP,SAASqX,wBAAwB1U,GAC/B,GAAIA,GAAOA,EAAIf,WACb,OAAOe,EAGT,GAAY,OAARA,GAAiC,WAAjB0B,EAAQ1B,IAAoC,mBAARA,EACtD,MAAO,CACL,QAAWA,GAIf,IAAIyU,EAAQF,2BAEZ,GAAIE,GAASA,EAAM9Q,IAAI3D,GACrB,OAAOyU,EAAM/V,IAAIsB,GAGnB,IAAI2U,EAAS,GACTC,EAAwBrW,OAAOC,gBAAkBD,OAAOsW,yBAE5D,IAAK,IAAIzV,KAAOY,EACd,GAAIzB,OAAOoB,UAAUC,eAAe5B,KAAKgC,EAAKZ,GAAM,CAClD,IAAI0V,EAAOF,EAAwBrW,OAAOsW,yBAAyB7U,EAAKZ,GAAO,KAE3E0V,IAASA,EAAKpW,KAAOoW,EAAKT,KAC5B9V,OAAOC,eAAemW,EAAQvV,EAAK0V,GAEnCH,EAAOvV,GAAOY,EAAIZ,GAWxB,OANAuV,EAAgB,QAAI3U,EAEhByU,GACFA,EAAMJ,IAAIrU,EAAK2U,GAGVA,I,gBCjDTpW,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EACrB,IAUI0P,EAVe,CACjBxC,QAAS,UACTC,aAAc,eACdG,QAAS,UACTC,WAAY,aACZC,OAAQ,SACRC,eAAgB,iBAChBL,MAAO,QACPC,MAAO,SAGTrN,EAAO,QAAc0P,G,gBCjBrB,IAAIgI,EAAe,EAAQ,KACvBC,EAAW,EAAQ,KAevB1X,EAAOD,QALP,SAASgQ,UAAU5N,EAAQL,GACzB,IAAIN,EAAQkW,EAASvV,EAAQL,GAC7B,OAAO2V,EAAajW,GAASA,OAAQsE,I,gBCbvC,IAGIxE,EAHO,EAAQ,IAGDA,OAElBtB,EAAOD,QAAUuB,G,cCLjB,IAAIqW,EAGJA,EAAI,WACH,OAAOlS,KADJ,GAIJ,IAECkS,EAAIA,GAAK,IAAIhQ,SAAS,cAAb,GACR,MAAOa,GAEc,iBAAXrI,SAAqBwX,EAAIxX,QAOrCH,EAAOD,QAAU4X,G,cCWjB3X,EAAOD,QALP,SAAS2I,SAASlH,GAChB,IAAI+E,SAAc/E,EAClB,OAAgB,MAATA,IAA0B,UAAR+E,GAA4B,YAARA,K,gBC3B/C,IAAIqR,EAAoB,EAAQ,KAE5BC,EAAkB,EAAQ,KAE1BlO,EAA6B,EAAQ,IAErCmO,EAAoB,EAAQ,KAMhC9X,EAAOD,QAJP,SAASgY,mBAAmBjO,GAC1B,OAAO8N,EAAkB9N,IAAQ+N,EAAgB/N,IAAQH,EAA2BG,IAAQgO,M,cCR9F,IAWIE,EAAehM,OAAO,uFAa1BhM,EAAOD,QAJP,SAASkY,WAAWC,GAClB,OAAOF,EAAaG,KAAKD,K,gBCpB3BjX,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAQyK,kBAAoBzK,EAAQqY,cAAWtS,EAE/C,IAEIuS,EAAW5V,uBAFD,EAAQ,KAMlBoR,EAAmBpR,uBAFD,EAAQ,KAM1B6V,EAAmB7V,uBAFA,EAAQ,KAM3B8V,EAA8B9V,uBAFA,EAAQ,KAMtC+V,EAAa/V,uBAFA,EAAQ,KAIzB1C,EAAQiG,eASR,SAASA,eAAeyS,GAGtB,IAAIC,EAAY,SAASA,UAAUC,EAAQC,GACzC,OAAO,IAAIC,EAAUF,EAAQC,IAG3BC,EAAY,SAAUC,GAGxB,SAASD,UAAUF,EAAQC,IACzB,EAAIN,EAAiBS,SAAStT,KAAMoT,WAEpC,IAAIjK,GAAQ,EAAI2J,EAA4BQ,SAAStT,MAAOoT,UAAUjV,YAAa,EAAIiQ,EAAiBkF,SAASF,YAAYnY,KAAK+E,KAAMkT,EAAQC,IAYhJ,OAVAhK,EAAM6J,OAASA,EASf7J,EAAMrI,KAAOmS,EACN9J,EAGT,OApBA,EAAI4J,EAAWO,SAASF,UAAWC,GAoB5BD,UArBO,CAsBdT,GAmBF,OAdAnX,OAAOC,eAAe2X,EAAW,OAAQ,CAAErX,MAAOiX,IAClDxX,OAAOC,eAAe2X,EAAW,SAAU,CAAErX,MAAOiX,KAEpD,EAAIJ,EAASU,SAASL,EAAW,CAC/BM,IAAKC,qBAAqBP,EAAWD,EAAQ,OAC7CS,IAAKD,qBAAqBP,EAAWD,EAAQ,OAC7CU,IAAKF,qBAAqBP,EAAWD,EAAQ,OAC7CA,OAAQA,EACRW,WAAY,SAASA,WAAW1W,GAC9B,OAAOA,aAAemW,MAI1B,EAAIR,EAASU,SAASF,EAAW,CAAEG,IAAKN,EAAUM,IAAKE,IAAKR,EAAUQ,MAC/DR,GAxDT3Y,EAAQsZ,oBA2DR,SAASA,oBAAoBC,EAAkBC,GAC7C,IAAIC,EAAYF,EAAiB,GAAGnV,YAChCsV,EAAcF,EAAmB,GAAGpV,YAEpCuU,EAAY,SAASA,UAAUC,EAAQC,GACzC,OAAO,IAAIc,EAAWC,cAAchB,EAAQa,EAAWC,EAAab,IAGlEH,EAASe,EAAUf,OAAS,IAAMgB,EAAYhB,OAYlD,OAVA,EAAIJ,EAASU,SAASL,EAAW,CAC/BM,IAAKC,qBAAqBP,EAAWD,EAAQ,OAC7CS,IAAKD,qBAAqBP,EAAWD,EAAQ,OAC7CU,IAAKF,qBAAqBP,EAAWD,EAAQ,OAC7CA,OAAQA,EACRW,WAAY,SAASA,WAAW1W,GAC9B,OAAOA,aAAegX,EAAWC,eAAiBjX,EAAI+V,SAAWA,KAI9DC,GA7ET,IAAIgB,EAAa,EAAQ,KAEzB,SAASjX,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAEvF,IAAI0V,EAAWrY,EAAQqY,SAAWsB,EAAWtB,SA4E7C,SAASa,qBAAqBP,EAAWD,EAAQG,GAC/C,IAAIpT,EAAK,SAASA,GAAGmT,GACnB,OAAOD,EAAUC,EAAQC,IAK3B,OAFApT,EAAGiT,OAASA,EACZjT,EAAGoT,MAAQA,EACJpT,EAYezF,EAAQyK,kBAAoB,SAASA,kBAAkBoP,GAC7E,OAAO,SAAUjB,EAAQkB,GACvB,GAAIlB,aAAkBP,EAAU,OAAOO,EACvC,IAAKkB,EAAM,MAAM,IAAIlO,MAAM,4BAC3B,IAAI7J,EAAsB,iBAAT+X,EAAoBA,EAAKC,cAAgBD,EAAKpB,OAC3DsB,EAAOH,EAAW9X,GACtB,IAAKiY,EACH,MAAM,IAAIpO,MAAM,gCAAkC7J,EAAM,KAE1D,OAAOiY,EAAKpB,EAAQkB,EAAKjB,U,gBC1I7B5Y,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAAqC4B,YAAY,I,gBCAvF3B,EAAOD,SAAW,EAAQ,MAAsB,EAAQ,GAAR,EAAoB,WAClE,OAA4G,GAArGkB,OAAOC,eAAe,EAAQ,GAAR,CAAyB,OAAQ,IAAK,CAAEE,IAAK,WAAc,OAAO,KAAQqG,M,gBCDzG,IAAIiB,EAAW,EAAQ,IACnB6J,EAAW,EAAQ,IAAaA,SAEhCyH,EAAKtR,EAAS6J,IAAa7J,EAAS6J,EAAS0H,eACjDja,EAAOD,QAAU,SAAU4I,GACzB,OAAOqR,EAAKzH,EAAS0H,cAActR,GAAM,K,gBCL3C,IAAItC,EAAM,EAAQ,IACd6T,EAAY,EAAQ,IACpBC,EAAe,EAAQ,IAAR,EAA6B,GAC5CtI,EAAW,EAAQ,GAAR,CAAyB,YAExC7R,EAAOD,QAAU,SAAUoC,EAAQiY,GACjC,IAGItY,EAHAwG,EAAI4R,EAAU/X,GACd5B,EAAI,EACJsS,EAAS,GAEb,IAAK/Q,KAAOwG,EAAOxG,GAAO+P,GAAUxL,EAAIiC,EAAGxG,IAAQ+Q,EAAOrG,KAAK1K,GAE/D,KAAOsY,EAAMlX,OAAS3C,GAAO8F,EAAIiC,EAAGxG,EAAMsY,EAAM7Z,SAC7C4Z,EAAatH,EAAQ/Q,IAAQ+Q,EAAOrG,KAAK1K,IAE5C,OAAO+Q,I,gBCdT,IAAIwH,EAAM,EAAQ,IAElBra,EAAOD,QAAUkB,OAAO,KAAK+M,qBAAqB,GAAK/M,OAAS,SAAU0H,GACxE,MAAkB,UAAX0R,EAAI1R,GAAkBA,EAAGoD,MAAM,IAAM9K,OAAO0H,K,gBCHrD,IAAI2R,EAAY,EAAQ,IACpBC,EAAMxS,KAAKwS,IACfva,EAAOD,QAAU,SAAU4I,GACzB,OAAOA,EAAK,EAAI4R,EAAID,EAAU3R,GAAK,kBAAoB,I,gBCJzD3I,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAA+C4B,YAAY,I,gBCCjG,IAAI0E,EAAM,EAAQ,IACdmU,EAAW,EAAQ,IACnB3I,EAAW,EAAQ,GAAR,CAAyB,YACpC4I,EAAcxZ,OAAOoB,UAEzBrC,EAAOD,QAAUkB,OAAO0C,gBAAkB,SAAU2E,GAElD,OADAA,EAAIkS,EAASlS,GACTjC,EAAIiC,EAAGuJ,GAAkBvJ,EAAEuJ,GACH,mBAAjBvJ,EAAEnE,aAA6BmE,aAAaA,EAAEnE,YAChDmE,EAAEnE,YAAY9B,UACdiG,aAAarH,OAASwZ,EAAc,O,gBCT/C1a,EAAQ4B,YAAa,EAErB5B,EAAQgZ,QAAU,SAAUnW,EAAUC,GACpC,KAAMD,aAAoBC,GACxB,MAAM,IAAIC,UAAU,uC,gBCJxB/C,EAAQ4B,YAAa,EAErB,IAEI+Y,EAEJ,SAASjY,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAFxED,CAFA,EAAQ,KAMvB1C,EAAQgZ,QAAU,SAAUxU,EAAM7D,GAChC,IAAK6D,EACH,MAAM,IAAIoW,eAAe,6DAG3B,OAAOja,GAAuF,iBAA7D,IAATA,EAAuB,aAAc,EAAIga,EAAS3B,SAASrY,KAAuC,mBAATA,EAA8B6D,EAAP7D,I,gBCb1IX,EAAQ4B,YAAa,EAErB,IAEIiZ,EAAanY,uBAFD,EAAQ,MAMpBoY,EAAWpY,uBAFD,EAAQ,MAIlB2B,EAAsC,mBAArByW,EAAS9B,SAAwD,iBAAvB6B,EAAW7B,QAAuB,SAAUrW,GAAO,cAAcA,GAAS,SAAUA,GAAO,OAAOA,GAAmC,mBAArBmY,EAAS9B,SAA0BrW,EAAIyB,cAAgB0W,EAAS9B,SAAWrW,IAAQmY,EAAS9B,QAAQ1W,UAAY,gBAAkBK,GAEjT,SAASD,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAEvF3C,EAAQgZ,QAAsC,mBAArB8B,EAAS9B,SAA0D,WAAhC3U,EAAQwW,EAAW7B,SAAwB,SAAUrW,GAC/G,YAAsB,IAARA,EAAsB,YAAc0B,EAAQ1B,IACxD,SAAUA,GACZ,OAAOA,GAAmC,mBAArBmY,EAAS9B,SAA0BrW,EAAIyB,cAAgB0W,EAAS9B,SAAWrW,IAAQmY,EAAS9B,QAAQ1W,UAAY,cAA0B,IAARK,EAAsB,YAAc0B,EAAQ1B,K,gBClBrM,IAAIwQ,EAAU,EAAQ,IAClB5M,EAAU,EAAQ,IAClBwU,EAAW,EAAQ,IACnB1U,EAAO,EAAQ,IACf2U,EAAY,EAAQ,IACpBC,EAAc,EAAQ,KACtBC,EAAiB,EAAQ,IACzBtX,EAAiB,EAAQ,IACzBuX,EAAW,EAAQ,EAAR,CAAkB,YAC7BC,IAAU,GAAGtN,MAAQ,QAAU,GAAGA,QAKlCuN,WAAa,WAAc,OAAO3V,MAEtCzF,EAAOD,QAAU,SAAUsb,EAAMC,EAAMzY,EAAa0Y,EAAMC,EAASC,EAAQC,GACzEV,EAAYnY,EAAayY,EAAMC,GAC/B,IAeII,EAAS7Z,EAAK8Z,EAfdC,UAAY,SAAUC,GACxB,IAAKX,GAASW,KAAQC,EAAO,OAAOA,EAAMD,GAC1C,OAAQA,GACN,IAVK,OAUM,OAAO,SAASjO,OAAS,OAAO,IAAIhL,EAAY4C,KAAMqW,IACjE,IAVO,SAUM,OAAO,SAASE,SAAW,OAAO,IAAInZ,EAAY4C,KAAMqW,IACrE,OAAO,SAASG,UAAY,OAAO,IAAIpZ,EAAY4C,KAAMqW,KAEzD/I,EAAMuI,EAAO,YACbY,EAdO,UAcMV,EACbW,GAAa,EACbJ,EAAQV,EAAKhZ,UACb+Z,EAAUL,EAAMb,IAAaa,EAnBjB,eAmBuCP,GAAWO,EAAMP,GACpEa,EAAWD,GAAWP,UAAUL,GAChCc,EAAWd,EAAWU,EAAwBL,UAAU,WAArBQ,OAAkCvW,EACrEyW,EAAqB,SAARjB,GAAkBS,EAAME,SAAqBG,EAwB9D,GArBIG,IACFX,EAAoBjY,EAAe4Y,EAAW7b,KAAK,IAAI2a,OAC7Bpa,OAAOoB,WAAauZ,EAAkBL,OAE9DN,EAAeW,EAAmB7I,GAAK,GAElCG,GAAiD,mBAA/B0I,EAAkBV,IAAyB9U,EAAKwV,EAAmBV,EAAUE,aAIpGc,GAAcE,GAjCP,WAiCkBA,EAAQtb,OACnCqb,GAAa,EACbE,EAAW,SAASL,SAAW,OAAOI,EAAQ1b,KAAK+E,QAG/CyN,IAAWwI,IAAYP,IAASgB,GAAeJ,EAAMb,IACzD9U,EAAK2V,EAAOb,EAAUmB,GAGxBtB,EAAUO,GAAQe,EAClBtB,EAAUhI,GAAOqI,WACbI,EAMF,GALAG,EAAU,CACRK,OAAQE,EAAaG,EAAWR,UA9CzB,UA+CPhO,KAAM4N,EAASY,EAAWR,UAhDrB,QAiDLI,QAASK,GAEPZ,EAAQ,IAAK5Z,KAAO6Z,EAChB7Z,KAAOia,GAAQjB,EAASiB,EAAOja,EAAK6Z,EAAQ7Z,SAC7CwE,EAAQA,EAAQY,EAAIZ,EAAQM,GAAKuU,GAASgB,GAAab,EAAMK,GAEtE,OAAOA,I,gBCnET3b,EAAOD,QAAU,EAAQ,K,gBCAzB,EAAQ,KAYR,IAXA,IAAImG,EAAS,EAAQ,IACjBE,EAAO,EAAQ,IACf2U,EAAY,EAAQ,IACpByB,EAAgB,EAAQ,EAAR,CAAkB,eAElCC,EAAe,wbAIU1Q,MAAM,KAE1BxL,EAAI,EAAGA,EAAIkc,EAAavZ,OAAQ3C,IAAK,CAC5C,IAAI+a,EAAOmB,EAAalc,GACpBmc,EAAaxW,EAAOoV,GACpBS,EAAQW,GAAcA,EAAWra,UACjC0Z,IAAUA,EAAMS,IAAgBpW,EAAK2V,EAAOS,EAAelB,GAC/DP,EAAUO,GAAQP,EAAUpQ,Q,gBChB9B,IAAIgD,EAAQ,EAAQ,IAChBgP,EAAa,EAAQ,IAAoB7R,OAAO,SAAU,aAE9D/K,EAAQsI,EAAIpH,OAAO2b,qBAAuB,SAASA,oBAAoBtU,GACrE,OAAOqF,EAAMrF,EAAGqU,K,gBCLlB,IAAIE,EAAM,EAAQ,IACdxT,EAAa,EAAQ,IACrB6Q,EAAY,EAAQ,IACpB/R,EAAc,EAAQ,IACtB9B,EAAM,EAAQ,IACd6B,EAAiB,EAAQ,IACzB4U,EAAO7b,OAAOsW,yBAElBxX,EAAQsI,EAAI,EAAQ,IAAoByU,EAAO,SAASvF,yBAAyBjP,EAAGpB,GAGlF,GAFAoB,EAAI4R,EAAU5R,GACdpB,EAAIiB,EAAYjB,GAAG,GACfgB,EAAgB,IAClB,OAAO4U,EAAKxU,EAAGpB,GACf,MAAOsB,IACT,GAAInC,EAAIiC,EAAGpB,GAAI,OAAOmC,GAAYwT,EAAIxU,EAAE3H,KAAK4H,EAAGpB,GAAIoB,EAAEpB,M,gBCZxDnH,EAAQ4B,YAAa,EAErB,IAEIob,EAAmBta,uBAFD,EAAQ,MAM1Bua,EAAWva,uBAFD,EAAQ,MAMlBiY,EAAWjY,uBAFA,EAAQ,KAIvB,SAASA,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAEvF3C,EAAQgZ,QAAU,SAAU9U,EAAUC,GACpC,GAA0B,mBAAfA,GAA4C,OAAfA,EACtC,MAAM,IAAIpB,UAAU,iEAAoF,IAAfoB,EAA6B,aAAc,EAAIwW,EAAS3B,SAAS7U,KAG5JD,EAAS5B,WAAY,EAAI2a,EAASjE,SAAS7U,GAAcA,EAAW7B,UAAW,CAC7E8B,YAAa,CACX3C,MAAOyC,EACP9C,YAAY,EACZkC,UAAU,EACVD,cAAc,KAGdc,IAAY6Y,EAAiBhE,SAAU,EAAIgE,EAAiBhE,SAAS9U,EAAUC,GAAcD,EAASL,UAAYM,K,gBC/BxH,IAAI+Y,EAAU,EAAQ,KAClB/B,EAAW,EAAQ,EAAR,CAAkB,YAC7BH,EAAY,EAAQ,IACxB/a,EAAOD,QAAU,EAAQ,GAAWmd,kBAAoB,SAAUvU,GAChE,GAAU7C,MAAN6C,EAAiB,OAAOA,EAAGuS,IAC1BvS,EAAG,eACHoS,EAAUkC,EAAQtU,M,gBCNzB,IAAIwU,EAAmB,EAAQ,IAW/Bnd,EAAOD,QATP,SAASqd,4BAA4Bpc,EAAGqc,GACtC,GAAKrc,EAAL,CACA,GAAiB,iBAANA,EAAgB,OAAOmc,EAAiBnc,EAAGqc,GACtD,IAAIrb,EAAIf,OAAOoB,UAAUmJ,SAAS9K,KAAKM,GAAGqL,MAAM,GAAI,GAEpD,MADU,WAANrK,GAAkBhB,EAAEmD,cAAanC,EAAIhB,EAAEmD,YAAYrD,MAC7C,QAANkB,GAAqB,QAANA,EAAoB2I,MAAMC,KAAK5J,GACxC,cAANgB,GAAqB,2CAA2CmW,KAAKnW,GAAWmb,EAAiBnc,EAAGqc,QAAxG,K,cCEFrd,EAAOD,QAVP,SAASud,kBAAkBxT,EAAKqB,IACnB,MAAPA,GAAeA,EAAMrB,EAAI5G,UAAQiI,EAAMrB,EAAI5G,QAE/C,IAAK,IAAI3C,EAAI,EAAGgd,EAAO,IAAI5S,MAAMQ,GAAM5K,EAAI4K,EAAK5K,IAC9Cgd,EAAKhd,GAAKuJ,EAAIvJ,GAGhB,OAAOgd,I,cCCTvd,EAAOD,QARP,SAASyd,uBAAuBjZ,GAC9B,QAAa,IAATA,EACF,MAAM,IAAIoW,eAAe,6DAG3B,OAAOpW,I,gBCHT,IAAI9B,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,QAMP,SAAS0d,kBAAkB9N,EAAM+N,EAAQC,GACvC,GAAID,aAAkB/S,MACpB,MAAwB,kBAAb+S,EAAO,IAAmBC,EAC5B,CAACC,sBAAsBjO,EAAM+N,EAAO,GAAIC,GAAWD,EAAO,IAG5DA,EAGT,IAAIG,EACA/O,EAAW,GAEf,QAAQ,EAAI2E,EAAQ,SAAaiK,IAC/B,IAAK,SAKL,IAAK,WAEHG,EAAYH,EACZ,MAEF,IAAK,SACCA,aAAkBI,EAAY,QAEhCD,EAAYH,GAGZG,GAAYF,GAAWC,sBAAsBjO,GAAM,EAAMgO,GACzD7O,EAAW4O,GAGb,MAEF,IAAK,UACHG,EAAYF,EAAWC,sBAAsBjO,EAAM+N,EAAQC,GAAYD,EACvE,MAEF,QACE,MAAM,IAAI/R,MAAM,gCAAgCb,OAAO6E,EAAM,KAAM+N,GAGvE,MAAO,CAACG,EAAW/O,IA/CrB,IAAI2E,EAAWhR,EAAuBmG,EAAQ,KAE1CkV,EAAerb,EAAuBmG,EAAQ,KAgDlD,SAASgV,sBAAsBjO,EAAMoO,EAAMC,GACzC,IAEIld,EAFAmd,EAAWD,EAAKC,SAChBC,EAAWF,EAAKE,SAGpB,GAAIH,GAEF,KADAjd,EAAOmd,EAAStO,IACL,MAAM,IAAIhE,MAAM,QAASb,OAAO6E,EAAM,kCAGjD,KADA7O,EAAOod,EAASvO,IACL,MAAM,IAAIhE,MAAM,QAASb,OAAO6E,EAAM,iCAGnD,OAAO7O,I,gBCtET,IAAI2B,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,QAAcA,EAAQoe,uBAAoB,EAEjD,IAAI1K,EAAWhR,EAAuBmG,EAAQ,KAE1CsF,EAAgBzL,EAAuBmG,EAAQ,IAE/CqF,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAItD,SAASoL,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAI3b,IAAIsL,EAAiC,SAAUxJ,IAC7C,EAAIhB,EAAU,SAAawK,kBAAmBxJ,GAE9C,IAAIC,EAASZ,aAAamK,mBAE1B,SAASA,oBAEP,OADA,EAAIlQ,EAAgB,SAAaxI,KAAM0Y,mBAChCvJ,EAAOhP,MAAMH,KAAME,WAG5B,OAAOwY,kBAV4B,EAWrB,EAjBQ1b,EAAuBmG,EAAQ,KAiBlB,SAAa+C,QAElD5L,EAAQoe,kBAAoBA,EAE5B,IAAIC,EAA4B,WAC9B,SAASA,aAAaC,EAAcC,GAGlC,IAFA,EAAIrQ,EAAgB,SAAaxI,KAAM2Y,cAEO,YAA1C,EAAI3K,EAAQ,SAAa6K,GAC3B,MAAM,IAAI3S,MAAM,yDAGlB,GAAI1K,OAAO4M,KAAKyQ,GAAarS,QAAO,SAAUvB,GAC5C,OAAO4T,EAAYhc,eAAeoI,MAAQ4T,EAAY5T,aAAcC,UACnEzH,OAAS,EACV,MAAM,IAAIyI,MAAM,wDAGlB,GAAI1K,OAAO4M,KAAKyQ,GAAarS,QAAO,SAAUvB,GAC5C,OAAO4T,EAAYhc,eAAeoI,IAAM4T,EAAY5T,GAAGuB,QAAO,SAAUzJ,GACtE,OAAQ8b,EAAY9b,MACnBU,OAAS,KACXA,OAAS,EACV,MAAM,IAAIyI,MAAM,8EAGlB,KAAM2S,EAAYD,aAAyB1T,OACzC,MAAM,IAAIgB,MAAM,iBAAmB0S,EAAe,uCAGpD5Y,KAAK8Y,OAASF,EACd5Y,KAAK+Y,YAAcF,EACnB7Y,KAAKgZ,sBAAwB,GAsD/B,OAnDA,EAAIvQ,EAAa,SAAakQ,aAAc,CAAC,CAC3Ctc,IAAK,iBACLN,MAAO,SAASkd,eAAetJ,GAC7B3P,KAAKgZ,sBAAsBjS,KAAK4I,KAEjC,CACDtT,IAAK,QACLN,MAAO,SAASgO,QACd,OAAO/J,KAAK8Y,SAEb,CACDzc,IAAK,UACLN,MAAO,SAASmd,QAAQnP,GAKtB,OAJMA,aAAiB7E,QACrB6E,EAAQ,CAACA,IAGJA,EAAMoP,QAAQnZ,KAAK8Y,SAAW,IAEtC,CACDzc,IAAK,cACLN,MAAO,SAASqd,YAAYrP,GAC1B,IAAIsP,EAAYnZ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAEpF,IAAKF,KAAKkZ,QAAQnP,GAChB,MAAM,IAAI2O,EAAkB,+BAAiC1Y,KAAK8Y,QAAUO,EAAU5b,OAAS,EAAI,KAAO4b,EAAY,OAGzH,CACDhd,IAAK,eACLN,MAAO,SAASud,aAAaC,GAC3B,QAAmClZ,IAA/BL,KAAK+Y,YAAYQ,GACnB,MAAM,IAAIb,EAAkB,6BAA+Ba,GAG7D,GAAIA,IAAavZ,KAAK8Y,OAAQ,CAC5B,GAAI9Y,KAAK+Y,YAAY/Y,KAAK8Y,QAAQK,QAAQI,GAAY,EACpD,MAAM,IAAIb,EAAkB,6BAA+B1Y,KAAK8Y,OAAS,OAASS,GAGpF,IAAIC,EAAWxZ,KAAK8Y,OACpB9Y,KAAK8Y,OAASS,EAEdvZ,KAAKgZ,sBAAsBvS,SAAQ,SAAUgT,GAC3C,OAAOA,EAAGD,EAAUD,MAIxB,OAAOvZ,SAGJ2Y,aAlFuB,GAqFhCre,EAAO,QAAcqe,G,cC9HrB,IAOIe,EACAC,EARAC,EAAUrf,EAAOD,QAAU,GAU/B,SAASuf,mBACL,MAAM,IAAI3T,MAAM,mCAEpB,SAAS4T,sBACL,MAAM,IAAI5T,MAAM,qCAsBpB,SAAS6T,WAAWC,GAChB,GAAIN,IAAqBO,WAErB,OAAOA,WAAWD,EAAK,GAG3B,IAAKN,IAAqBG,mBAAqBH,IAAqBO,WAEhE,OADAP,EAAmBO,WACZA,WAAWD,EAAK,GAE3B,IAEI,OAAON,EAAiBM,EAAK,GAC/B,MAAMjX,GACJ,IAEI,OAAO2W,EAAiBze,KAAK,KAAM+e,EAAK,GAC1C,MAAMjX,GAEJ,OAAO2W,EAAiBze,KAAK+E,KAAMga,EAAK,MAvCnD,WACG,IAEQN,EADsB,mBAAfO,WACYA,WAEAJ,iBAEzB,MAAO9W,GACL2W,EAAmBG,iBAEvB,IAEQF,EADwB,mBAAjBO,aACcA,aAEAJ,oBAE3B,MAAO/W,GACL4W,EAAqBG,qBAjB7B,GAwEA,IAEIK,EAFAC,EAAQ,GACRC,GAAW,EAEXC,GAAc,EAElB,SAASC,kBACAF,GAAaF,IAGlBE,GAAW,EACPF,EAAa1c,OACb2c,EAAQD,EAAa9U,OAAO+U,GAE5BE,GAAc,EAEdF,EAAM3c,QACN+c,cAIR,SAASA,aACL,IAAIH,EAAJ,CAGA,IAAII,EAAUV,WAAWQ,iBACzBF,GAAW,EAGX,IADA,IAAI3U,EAAM0U,EAAM3c,OACViI,GAAK,CAGP,IAFAyU,EAAeC,EACfA,EAAQ,KACCE,EAAa5U,GACdyU,GACAA,EAAaG,GAAYI,MAGjCJ,GAAc,EACd5U,EAAM0U,EAAM3c,OAEhB0c,EAAe,KACfE,GAAW,EAnEf,SAASM,gBAAgBC,GACrB,GAAIjB,IAAuBO,aAEvB,OAAOA,aAAaU,GAGxB,IAAKjB,IAAuBG,sBAAwBH,IAAuBO,aAEvE,OADAP,EAAqBO,aACdA,aAAaU,GAExB,IAEI,OAAOjB,EAAmBiB,GAC5B,MAAO7X,GACL,IAEI,OAAO4W,EAAmB1e,KAAK,KAAM2f,GACvC,MAAO7X,GAGL,OAAO4W,EAAmB1e,KAAK+E,KAAM4a,KAgD7CD,CAAgBF,IAiBpB,SAASI,KAAKb,EAAKnP,GACf7K,KAAKga,IAAMA,EACXha,KAAK6K,MAAQA,EAYjB,SAASiQ,QA5BTlB,EAAQmB,SAAW,SAAUf,GACzB,IAAI/Z,EAAO,IAAIiF,MAAMhF,UAAUzC,OAAS,GACxC,GAAIyC,UAAUzC,OAAS,EACnB,IAAK,IAAI3C,EAAI,EAAGA,EAAIoF,UAAUzC,OAAQ3C,IAClCmF,EAAKnF,EAAI,GAAKoF,UAAUpF,GAGhCsf,EAAMrT,KAAK,IAAI8T,KAAKb,EAAK/Z,IACJ,IAAjBma,EAAM3c,QAAiB4c,GACvBN,WAAWS,aASnBK,KAAKje,UAAU8d,IAAM,WACjB1a,KAAKga,IAAI7Z,MAAM,KAAMH,KAAK6K,QAE9B+O,EAAQoB,MAAQ,UAChBpB,EAAQqB,SAAU,EAClBrB,EAAQsB,IAAM,GACdtB,EAAQuB,KAAO,GACfvB,EAAQvb,QAAU,GAClBub,EAAQwB,SAAW,GAInBxB,EAAQyB,GAAKP,KACblB,EAAQ0B,YAAcR,KACtBlB,EAAQ2B,KAAOT,KACflB,EAAQ4B,IAAMV,KACdlB,EAAQ6B,eAAiBX,KACzBlB,EAAQ8B,mBAAqBZ,KAC7BlB,EAAQ+B,KAAOb,KACflB,EAAQgC,gBAAkBd,KAC1BlB,EAAQiC,oBAAsBf,KAE9BlB,EAAQkC,UAAY,SAAUzgB,GAAQ,MAAO,IAE7Cue,EAAQmC,QAAU,SAAU1gB,GACxB,MAAM,IAAI6K,MAAM,qCAGpB0T,EAAQoC,IAAM,WAAc,MAAO,KACnCpC,EAAQqC,MAAQ,SAAUC,GACtB,MAAM,IAAIhW,MAAM,mCAEpB0T,EAAQuC,MAAQ,WAAa,OAAO,I,gBCvLpC,IAAIC,EAAW,EAAQ,KAwBvB7hB,EAAOD,QAJP,SAAS+hB,KAAKxR,GACZ,OAAQA,GAASA,EAAMpN,OAAU2e,EAASvR,GAAS,K,gBCrBrD,IAAIH,EAAa,EAAQ,IACrBzH,EAAW,EAAQ,IAmCvB1I,EAAOD,QAVP,SAASgiB,WAAWvgB,GAClB,IAAKkH,EAASlH,GACZ,OAAO,EAIT,IAAIwR,EAAM7C,EAAW3O,GACrB,MA5BY,qBA4BLwR,GA3BI,8BA2BcA,GA7BZ,0BA6B6BA,GA1B7B,kBA0BgDA,I,iBCjC/D,YACA,IAAIvF,EAA8B,iBAAVvH,GAAsBA,GAAUA,EAAOjF,SAAWA,QAAUiF,EAEpFlG,EAAOD,QAAU0N,I,gCCcjBzN,EAAOD,QAVP,SAASiiB,WAAWjL,GAClB,IAAIpF,GAAS,EACTkB,EAASlI,MAAMoM,EAAI1L,MAKvB,OAHA0L,EAAI7K,SAAQ,SAAS1K,GACnBqR,IAASlB,GAASnQ,KAEbqR,I,gBCZT,IAAIuE,EAA0BxO,EAAQ,IAElCnG,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAQkiB,cAAgBA,cACxBhhB,OAAOC,eAAenB,EAAS,sBAAuB,CACpDoB,YAAY,EACZC,IAAK,SAASA,MACZ,OAAO+H,EAAgBqK,uBAG3BzT,EAAQmiB,qBAAuBniB,EAAQoiB,8BAAgCpiB,EAAQqiB,sBAAwBriB,EAAO,aAAc,EAE5H,IAAIsiB,EAAe5f,EAAuBmG,EAAQ,IAE9C0Z,EAAqB7f,EAAuBmG,EAAQ,IAEpDsF,EAAgBzL,EAAuBmG,EAAQ,IAE/CqF,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAElDkL,EAAoBrR,EAAuBmG,EAAQ,KAEnD2Z,EAAU9f,EAAuBmG,EAAQ,MAEzC4Z,EAAQ/f,EAAuBmG,EAAQ,KAEvCO,EAAkBiO,EAAwBxO,EAAQ,KAElD6Z,EAAYhgB,EAAuBmG,EAAQ,MAE/C,SAAS8Z,2BAA2B1hB,GAAK,GAAsB,oBAAXM,QAAgD,MAAtBN,EAAEM,OAAOmH,UAAmB,CAAE,GAAIkC,MAAMgY,QAAQ3hB,KAAOA,EAErI,SAASoc,4BAA4Bpc,EAAGqc,GAAU,IAAKrc,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOsc,kBAAkBtc,EAAGqc,GAAS,IAAIrb,EAAIf,OAAOoB,UAAUmJ,SAAS9K,KAAKM,GAAGqL,MAAM,GAAI,GAAc,WAANrK,GAAkBhB,EAAEmD,cAAanC,EAAIhB,EAAEmD,YAAYrD,MAAM,GAAU,QAANkB,GAAqB,QAANA,EAAa,OAAO2I,MAAMC,KAAK5J,GAAI,GAAU,cAANgB,GAAqB,2CAA2CmW,KAAKnW,GAAI,OAAOsb,kBAAkBtc,EAAGqc,GAF7QD,CAA4Bpc,IAAK,CAAE,IAAIT,EAAI,EAAOqG,EAAI,SAASA,MAAQ,MAAO,CAAEpE,EAAGoE,EAAG5E,EAAG,SAASA,IAAM,OAAIzB,GAAKS,EAAEkC,OAAe,CAAEkC,MAAM,GAAe,CAAEA,MAAM,EAAO5D,MAAOR,EAAET,OAAWiI,EAAG,SAASA,EAAEoa,GAAM,MAAMA,GAAOva,EAAGzB,GAAO,MAAM,IAAI9D,UAAU,yIAA4I,IAAI6F,EAA6C9C,EAAzCgd,GAAmB,EAAMC,GAAS,EAAY,MAAO,CAAEtgB,EAAG,SAASA,IAAMmG,EAAK3H,EAAEM,OAAOmH,aAAgBzG,EAAG,SAASA,IAAM,IAAI+gB,EAAOpa,EAAG4S,OAAsC,OAA9BsH,EAAmBE,EAAK3d,KAAa2d,GAASva,EAAG,SAASA,EAAEwa,GAAOF,GAAS,EAAMjd,EAAMmd,GAAQ3a,EAAG,SAASA,IAAM,IAAWwa,GAAoC,MAAhBla,EAAE,QAAoBA,EAAE,SAAvD,QAAiF,GAAIma,EAAQ,MAAMjd,KAI53B,SAASyX,kBAAkBxT,EAAKqB,IAAkB,MAAPA,GAAeA,EAAMrB,EAAI5G,UAAQiI,EAAMrB,EAAI5G,QAAQ,IAAK,IAAI3C,EAAI,EAAGgd,EAAO,IAAI5S,MAAMQ,GAAM5K,EAAI4K,EAAK5K,IAAOgd,EAAKhd,GAAKuJ,EAAIvJ,GAAM,OAAOgd,EAEhL,SAASvJ,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAI3b,IAAIsP,EAA6C,SAAUxN,IACzD,EAAIhB,EAAU,SAAawO,8BAA+BxN,GAE1D,IAAIC,EAASZ,aAAamO,+BAE1B,SAASA,8BAA8BrhB,GAGrC,OAFA,EAAImN,EAAgB,SAAaxI,KAAM0c,+BAEhCvN,EAAOlU,KAAK+E,KAAM,sBAAyB3E,EAAO,gDAG3D,OAAOqhB,8BAXwC,EAYjC,EAAIrO,EAAiB,SAAanI,QAElD5L,EAAQoiB,8BAAgCA,EAExC,IAAID,EAAoC,SAAUpN,IAChD,EAAInB,EAAU,SAAauO,qBAAsBpN,GAEjD,IAAIC,EAAUf,aAAakO,sBAE3B,SAASA,qBAAqBphB,GAG5B,OAFA,EAAImN,EAAgB,SAAaxI,KAAMyc,sBAEhCnN,EAAQrU,KAAK+E,KAAM,sBAAyB3E,EAAO,wCAG5D,OAAOohB,qBAX+B,EAYxB,EAAIpO,EAAiB,SAAanI,QAElD5L,EAAQmiB,qBAAuBA,EAE/B,IAAIE,EAAqC,SAAUnN,IACjD,EAAItB,EAAU,SAAayO,sBAAuBnN,GAElD,IAAIC,EAAUlB,aAAaoO,uBAE3B,SAASA,sBAAsBthB,GAG7B,OAFA,EAAImN,EAAgB,SAAaxI,KAAM2c,uBAEhClN,EAAQxU,KAAK+E,KAAM,sBAAyB3E,EAAO,yOAG5D,OAAOshB,sBAXgC,EAYzB,EAAItO,EAAiB,SAAanI,QAKlD,SAASsW,cAAcgB,GACrB,IAIIC,EAJAC,EAAQ,GACRC,EAAsB,GAEtBC,EAAYX,2BAA2BO,GAG3C,IACE,IAAIK,EAAQ,SAASA,QACnB,IAAItO,EAAUkO,EAAM1hB,MAChBV,EAAOkU,EAAQ7F,UAAUrO,OACzByiB,EAAWvO,EAAQ7F,UAAUR,eAET,IAApB4U,EAASrgB,OACXkgB,EAAoB5W,KAAK1L,GAEzByiB,EAASrX,SAAQ,SAAUsX,GACzB,OAAOL,EAAM3W,KAAK,CAACgX,EAAI1iB,QAK7B,IAAKuiB,EAAU7gB,MAAO0gB,EAAQG,EAAUrhB,KAAKoD,MAC3Cke,IAEF,MAAOzd,GACPwd,EAAU7a,EAAE3C,GAnBd,QAqBEwd,EAAUhb,IAGZ,OAAO,EAAIma,EAAK,UAAa,EAAIC,EAAS,SAAaU,GAAOrY,OAAOsY,IAjCvErjB,EAAQqiB,sBAAwBA,EAoChC,IAAIqB,EAAyB,WAC3B,SAASA,aACP,EAAIxV,EAAgB,SAAaxI,KAAMge,WACvChe,KAAKie,UAAY,GACjBje,KAAKke,iBAAkB,EA6GhB,IACDC,EAwER,OAnLA,EAAI1V,EAAa,SAAauV,UAAW,CAAC,CACxC3hB,IAAK,WACLN,MAAO,SAASqiB,SAAS7O,GACvB,IAAIlU,EAAO6E,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAE/E,IAAKwD,EAAe,QAAY0M,eAAeb,GAC7C,MAAM,IAAI7L,EAAgBqK,oBAAoB,oFAGhD1S,EAAOA,GAAQkU,EAAQ7F,UAAUrO,OACjC,IAAI0B,EAAIiD,KAAKuP,QAAQlU,GAAM,GAE3B,QAAUgF,IAANtD,GAAmBA,IAAMwS,EAC3B,MAAM,IAAImN,EAA8BrhB,GAI1C,OADA2E,KAAKie,UAAU5iB,GAAQkU,EAChBvP,OAER,CACD3D,IAAK,UACLN,MAAO,SAASwT,QAAQlU,GACtB,IAAIgjB,IAAiBne,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,KAAmBA,UAAU,GAChFoe,EAAoB,CAAC,YAEzB,IAAKjjB,EACH,MAAM,IAAI6K,MAAM,2BAGlB,IAAKlG,KAAKie,UAAU5iB,IAASgjB,GAAkBC,EAAkBC,SAASljB,GACxE,MAAM,IAAIshB,EAAsBthB,GAGlC,IAAK2E,KAAKie,UAAU5iB,IAASgjB,EAC3B,MAAM,IAAI5B,EAAqBphB,GAGjC,OAAO2E,KAAKie,UAAU5iB,KAEvB,CACDgB,IAAK,4BACLN,MAAO,SAASyiB,4BACd,OAAOhjB,OAAO4M,KAAKpI,KAAKie,aAEzB,CACD5hB,IAAK,qBACLN,MAAO,SAAS0iB,qBACd,IAGIC,EADAvJ,EAAa8H,4BAFF,EAAIH,EAAO,SAAa9c,KAAKie,YAK5C,IACE,IAAK9I,EAAWpY,MAAO2hB,EAASvJ,EAAW5Y,KAAKoD,MAAO,CACrD,IAIIgf,EAHAjV,EADUgV,EAAO3iB,MACC2N,UAElBkV,EAAa3B,2BAA2BvT,EAAQR,gBAGpD,IACE,IAAK0V,EAAW7hB,MAAO4hB,EAASC,EAAWriB,KAAKoD,MAAO,CACrD,IAAItE,EAAOsjB,EAAO5iB,MAElB,IADUiE,KAAKie,UAAU5iB,GACf,MAAM,IAAIohB,EAAqBphB,GACzCqO,EAAQ2G,OAAOhV,EAAM2E,KAAKie,UAAU5iB,KAEtC,MAAO+E,GACPwe,EAAW7b,EAAE3C,GARf,QAUEwe,EAAWhc,MAGf,MAAOxC,GACP+U,EAAWpS,EAAE3C,GAtBf,QAwBE+U,EAAWvS,OAGd,CACDvG,IAAK,aACLN,MAAO,SAAS6M,aACd,OAAO5I,KAAK6e,kBAAiB,SAAU9hB,GACrC,OAAOA,EAAE2M,UAAUd,kBAGtB,CACDvM,IAAK,UACLN,MAAO,SAAS8M,UACd,OAAO7I,KAAK6e,kBAAiB,SAAU9hB,GACrC,OAAOA,EAAE2M,UAAUb,eAGtB,CACDxM,IAAK,eACLN,MAAO,SAASgN,eACd,IAAII,EAAQnJ,KAEZ,OAAOA,KAAK6e,kBAAiB,SAAU9hB,GACrC,OAAOA,EAAE2M,UAAUX,kBAClBlJ,MAAK,WACNsJ,EAAM+U,iBAAkB,OAG3B,CACD7hB,IAAK,mBACLN,OACMoiB,GAAoB,EAAItB,EAAkB,SAA2BD,EAAY,QAAYkC,MAAK,SAASC,QAAQpP,GACrH,IAAIqP,EAAYC,EAAQ5jB,EAExB,OAAOuhB,EAAY,QAAYsC,MAAK,SAASC,SAASC,GACpD,OACE,OAAQA,EAASC,KAAOD,EAAStJ,MAC/B,KAAK,EACE9V,KAAKsf,uBACRtf,KAAKsf,qBAAuB9C,eAAc,EAAIM,EAAO,SAAa9c,KAAKie,aAGzEe,EAAa/B,2BAA2Bjd,KAAKsf,sBAC7CF,EAASC,KAAO,EAEhBL,EAAWjiB,IAEb,KAAK,EACH,IAAKkiB,EAASD,EAAWziB,KAAKoD,KAAM,CAClCyf,EAAStJ,KAAO,GAChB,MAMF,GAHAza,EAAO4jB,EAAOljB,MACJiE,KAAKie,UAAU5iB,GAEZ,CACX+jB,EAAStJ,KAAO,EAChB,MAGF,MAAM,IAAI5P,MAAM,kBAAkBb,OAAOhK,IAE3C,KAAK,EAEH,OADA+jB,EAAStJ,KAAO,GACTnG,EAAS3P,KAAKie,UAAU5iB,IAEjC,KAAK,GACH+jB,EAAStJ,KAAO,EAChB,MAEF,KAAK,GACHsJ,EAAStJ,KAAO,GAChB,MAEF,KAAK,GACHsJ,EAASC,KAAO,GAChBD,EAASG,GAAKH,EAAQ,MAAU,GAEhCJ,EAAWjc,EAAEqc,EAASG,IAExB,KAAK,GAKH,OAJAH,EAASC,KAAO,GAEhBL,EAAWpc,IAEJwc,EAASI,OAAO,IAEzB,KAAK,GACL,IAAK,MACH,OAAOJ,EAASK,UAGrBV,QAAS/e,KAAM,CAAC,CAAC,EAAG,GAAI,GAAI,UAGjC,SAAS6e,iBAAiBa,GACxB,OAAOvB,EAAkBhe,MAAMH,KAAME,gBAMpC8d,UA1LoB,GA6L7B1jB,EAAO,QAAc0jB,G,cChTrBzjB,EAAOD,QAXP,SAASqlB,SAAS9U,EAAO+U,GAKvB,IAJA,IAAI1T,GAAS,EACTzO,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACnC2P,EAASlI,MAAMzH,KAEVyO,EAAQzO,GACf2P,EAAOlB,GAAS0T,EAAS/U,EAAMqB,GAAQA,EAAOrB,GAEhD,OAAOuC,I,cCET7S,EAAOD,QAVP,SAASulB,UAAUtjB,EAAGqjB,GAIpB,IAHA,IAAI1T,GAAS,EACTkB,EAASlI,MAAM3I,KAEV2P,EAAQ3P,GACf6Q,EAAOlB,GAAS0T,EAAS1T,GAE3B,OAAOkB,I,cCOT,IAAI8P,EAAUhY,MAAMgY,QAEpB3iB,EAAOD,QAAU4iB,G,cCzBjB3iB,EAAOD,QAAU,SAASC,GAoBzB,OAnBKA,EAAOulB,kBACXvlB,EAAOwlB,UAAY,aACnBxlB,EAAOylB,MAAQ,GAEVzlB,EAAO0lB,WAAU1lB,EAAO0lB,SAAW,IACxCzkB,OAAOC,eAAelB,EAAQ,SAAU,CACvCmB,YAAY,EACZC,IAAK,WACJ,OAAOpB,EAAOQ,KAGhBS,OAAOC,eAAelB,EAAQ,KAAM,CACnCmB,YAAY,EACZC,IAAK,WACJ,OAAOpB,EAAOO,KAGhBP,EAAOulB,gBAAkB,GAEnBvlB,I,cCcRA,EAAOD,QALP,SAAS4lB,SAASnkB,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GA9Bb,mB,gBCDvB,OAAC,SAAWokB,GAmDV,IAAIra,EACFsa,EAAY,6CAEZC,EAAW/d,KAAK6D,KAChBma,EAAYhe,KAAKiJ,MAEjBgV,EAAiB,qBACjBC,EAAgBD,EAAiB,yDAEjCE,EAAO,KAIPC,EAAW,CAAC,EAAG,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,MAM7EC,EAAM,IAoiFR,SAASC,SAASrkB,GAChB,IAAIzB,EAAQ,EAAJyB,EACR,OAAOA,EAAI,GAAKA,IAAMzB,EAAIA,EAAIA,EAAI,EAKpC,SAAS+lB,cAAc7e,GAMrB,IALA,IAAIjF,EAAG+jB,EACLhmB,EAAI,EACJ6L,EAAI3E,EAAEvE,OACN7B,EAAIoG,EAAE,GAAK,GAENlH,EAAI6L,GAAI,CAGb,IADAma,EA5jFS,IA2jFT/jB,EAAIiF,EAAElH,KAAO,IACI2C,OACVqjB,IAAK/jB,EAAI,IAAMA,GACtBnB,GAAKmB,EAIP,IAAK4J,EAAI/K,EAAE6B,OAA8B,KAAtB7B,EAAEmlB,aAAapa,KAClC,OAAO/K,EAAEgL,MAAM,EAAGD,EAAI,GAAK,GAK7B,SAASqa,QAAQC,EAAGC,GAClB,IAAIlf,EAAGC,EACLkf,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EACPL,EAAImmB,EAAElkB,EACN4J,EAAIua,EAAEnkB,EACNkI,EAAIgc,EAAEle,EACNhI,EAAImmB,EAAEne,EAGR,IAAKjI,IAAM6L,EAAG,OAAO,KAMrB,GAJA3E,EAAImf,IAAOA,EAAG,GACdlf,EAAImf,IAAOA,EAAG,GAGVpf,GAAKC,EAAG,OAAOD,EAAIC,EAAI,GAAK0E,EAAI7L,EAGpC,GAAIA,GAAK6L,EAAG,OAAO7L,EAMnB,GAJAkH,EAAIlH,EAAI,EACRmH,EAAIgD,GAAKlK,GAGJomB,IAAOC,EAAI,OAAOnf,EAAI,GAAKkf,EAAKnf,EAAI,GAAK,EAG9C,IAAKC,EAAG,OAAOgD,EAAIlK,EAAIiH,EAAI,GAAK,EAKhC,IAHA2E,GAAK1B,EAAIkc,EAAG1jB,SAAW1C,EAAIqmB,EAAG3jB,QAAUwH,EAAIlK,EAGvCD,EAAI,EAAGA,EAAI6L,EAAG7L,IAAK,GAAIqmB,EAAGrmB,IAAMsmB,EAAGtmB,GAAI,OAAOqmB,EAAGrmB,GAAKsmB,EAAGtmB,GAAKkH,EAAI,GAAK,EAG5E,OAAOiD,GAAKlK,EAAI,EAAIkK,EAAIlK,EAAIiH,EAAI,GAAK,EAOvC,SAASqf,SAAS9kB,EAAGuY,EAAKwM,EAAKjmB,GAC7B,GAAIkB,EAAIuY,GAAOvY,EAAI+kB,GAAO/kB,KAAOA,EAAI,EAAI8jB,EAAS9jB,GAAK+jB,EAAU/jB,IAC/D,MAAM2J,MACJqa,GAAkBllB,GAAQ,aAA2B,iBAALkB,EAC7CA,EAAIuY,GAAOvY,EAAI+kB,EAAM,kBAAoB,oBACzC,6BAA+B/kB,GAKxC,SAAS2gB,QAAQjgB,GACf,MAA8C,kBAAvCzB,OAAOoB,UAAUmJ,SAAS9K,KAAKgC,GAKxC,SAASskB,MAAMhlB,GACb,IAAI0I,EAAI1I,EAAEpB,EAAEsC,OAAS,EACrB,OAAOmjB,SAASrkB,EAAEwG,EAroFP,KAqoFwBkC,GAAK1I,EAAEpB,EAAE8J,GAAK,GAAK,EAIxD,SAASuc,cAAcC,EAAK1e,GAC1B,OAAQ0e,EAAIhkB,OAAS,EAAIgkB,EAAIxb,OAAO,GAAK,IAAMwb,EAAI7a,MAAM,GAAK6a,IAC5D1e,EAAI,EAAI,IAAM,MAAQA,EAI1B,SAAS2e,aAAaD,EAAK1e,EAAG+d,GAC5B,IAAIpb,EAAKic,EAGT,GAAI5e,EAAI,EAAG,CAGT,IAAK4e,EAAKb,EAAI,MAAO/d,EAAG4e,GAAMb,GAC9BW,EAAME,EAAKF,OAOX,KAAM1e,GAHN2C,EAAM+b,EAAIhkB,QAGK,CACb,IAAKkkB,EAAKb,EAAG/d,GAAK2C,IAAO3C,EAAG4e,GAAMb,GAClCW,GAAOE,OACE5e,EAAI2C,IACb+b,EAAMA,EAAI7a,MAAM,EAAG7D,GAAK,IAAM0e,EAAI7a,MAAM7D,IAI5C,OAAO0e,GAOT3b,EA9pFA,SAAS8b,MAAMC,GACb,IAAIC,EAAKC,EAAaC,EA6hBhBC,EA6pBAC,EACFC,EACAC,EACAC,EACAC,EA7rCF7gB,EAAIqE,UAAUlJ,UAAY,CAAE8B,YAAaoH,UAAWC,SAAU,KAAMuF,QAAS,MAC7EiX,EAAM,IAAIzc,UAAU,GAUpB0c,EAAiB,GAajBC,EAAgB,EAMhBC,GAAc,EAIdC,EAAa,GAMbC,GAAW,IAKXC,EAAU,IAGVC,GAAS,EAkBTC,EAAc,EAIdC,EAAgB,EAGhBC,EAAS,CACPC,iBAAkB,IAClBC,eAAgB,IAChBC,UAAW,EACXC,mBAAoB,EACpBC,uBAAwB,IACxBC,kBAAmB,GAMrBC,EAAW,uCAgBb,SAAS1d,UAAUvJ,EAAG0F,GACpB,IAAIwhB,EAAUtoB,EAAGuoB,EAAa3gB,EAAGjI,EAAG6oB,EAAOje,EAAK+b,EAC9CR,EAAIjhB,KAGN,KAAMihB,aAAanb,WAKjB,OAAO,IAAIA,UAAUvJ,EAAG0F,GAG1B,GAAS,MAALA,EAAW,CAGb,GAAI1F,aAAauJ,UAIf,OAHAmb,EAAElkB,EAAIR,EAAEQ,EACRkkB,EAAEle,EAAIxG,EAAEwG,OACRke,EAAE9lB,GAAKoB,EAAIA,EAAEpB,GAAKoB,EAAEqK,QAAUrK,GAMhC,IAFAonB,EAAoB,iBAALpnB,IAEE,EAAJA,GAAS,EAAG,CAMvB,GAHA0kB,EAAElkB,EAAI,EAAIR,EAAI,GAAKA,GAAKA,GAAI,GAAK,EAG7BA,MAAQA,EAAG,CACb,IAAKwG,EAAI,EAAGjI,EAAIyB,EAAGzB,GAAK,GAAIA,GAAK,GAAIiI,KAGrC,OAFAke,EAAEle,EAAIA,OACNke,EAAE9lB,EAAI,CAACoB,IAITklB,EAAMllB,EAAI,OACL,CACL,IAAK6jB,EAAU1N,KAAK+O,EAAMllB,EAAI,IAAK,OAAOylB,EAAaf,EAAGQ,EAAKkC,GAC/D1C,EAAElkB,EAAyB,IAArB0kB,EAAIV,WAAW,IAAYU,EAAMA,EAAI7a,MAAM,IAAK,GAAK,GAIxD7D,EAAI0e,EAAItI,QAAQ,OAAS,IAAGsI,EAAMA,EAAImC,QAAQ,IAAK,MAGnD9oB,EAAI2mB,EAAIoC,OAAO,OAAS,GAGvB9gB,EAAI,IAAGA,EAAIjI,GACfiI,IAAM0e,EAAI7a,MAAM9L,EAAI,GACpB2mB,EAAMA,EAAIqC,UAAU,EAAGhpB,IACdiI,EAAI,IAGbA,EAAI0e,EAAIhkB,YAGL,CAQL,GALA4jB,SAASpf,EAAG,EAAGuhB,EAAS/lB,OAAQ,QAChCgkB,EAAMllB,EAAI,GAID,IAAL0F,EAEF,OAAO8hB,MADP9C,EAAI,IAAInb,UAAUvJ,aAAauJ,UAAYvJ,EAAIklB,GAC/Be,EAAiBvB,EAAEle,EAAI,EAAG0f,GAK5C,GAFAkB,EAAoB,iBAALpnB,EAEJ,CAGT,GAAQ,EAAJA,GAAS,EAAG,OAAOylB,EAAaf,EAAGQ,EAAKkC,EAAO1hB,GAKnD,GAHAgf,EAAElkB,EAAI,EAAIR,EAAI,GAAKklB,EAAMA,EAAI7a,MAAM,IAAK,GAAK,EAGzCd,UAAUke,OAASvC,EAAImC,QAAQ,YAAa,IAAInmB,OAAS,GAC3D,MAAMyI,MACJsa,EAAgBjkB,GAIpBonB,GAAQ,OAER1C,EAAElkB,EAA0B,KAAtB0kB,EAAIV,WAAW,IAAaU,EAAMA,EAAI7a,MAAM,IAAK,GAAK,EAQ9D,IALA6c,EAAWD,EAAS5c,MAAM,EAAG3E,GAC7Bc,EAAIjI,EAAI,EAIH4K,EAAM+b,EAAIhkB,OAAQ3C,EAAI4K,EAAK5K,IAC9B,GAAI2oB,EAAStK,QAAQhe,EAAIsmB,EAAIxb,OAAOnL,IAAM,EAAG,CAC3C,GAAS,KAALK,GAGF,GAAIL,EAAIiI,EAAG,CACTA,EAAI2C,EACJ,eAEG,IAAKge,IAGNjC,GAAOA,EAAIpN,gBAAkBoN,EAAMA,EAAIwC,gBACvCxC,GAAOA,EAAIwC,gBAAkBxC,EAAMA,EAAIpN,gBAAgB,CACzDqP,GAAc,EACd5oB,GAAK,EACLiI,EAAI,EACJ,SAIJ,OAAOif,EAAaf,EAAG1kB,EAAI,GAAIonB,EAAO1hB,IAOrCc,GAHL0e,EAAMM,EAAYN,EAAKxf,EAAG,GAAIgf,EAAElkB,IAGnBoc,QAAQ,OAAS,EAAGsI,EAAMA,EAAImC,QAAQ,IAAK,IACnD7gB,EAAI0e,EAAIhkB,OAIf,IAAK3C,EAAI,EAAyB,KAAtB2mB,EAAIV,WAAWjmB,GAAWA,KAGtC,IAAK4K,EAAM+b,EAAIhkB,OAAkC,KAA1BgkB,EAAIV,aAAarb,KAIxC,GAFA+b,EAAMA,EAAI7a,MAAM9L,IAAK4K,GAEZ,CAIP,GAHAA,GAAO5K,EAGH6oB,GAAS7d,UAAUke,OACrBte,EAAM,KAAOnJ,EArQA,kBAqQwBA,IAAM+jB,EAAU/jB,IACnD,MAAM2J,MACJsa,EAAiBS,EAAElkB,EAAIR,GAM7B,IAHAwG,EAAIA,EAAIjI,EAAI,GAGJ+nB,EAGN5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,UAGP,GAAIA,EAAI6f,EAGb3B,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,OACR,CAWL,GAVAke,EAAEle,EAAIA,EACNke,EAAE9lB,EAAI,GAMNL,GAAKiI,EAAI,GAhSJ,GAiSDA,EAAI,IAAGjI,GAjSN,IAmSDA,EAAI4K,EAAK,CAGX,IAFI5K,GAAGmmB,EAAE9lB,EAAE4L,MAAM0a,EAAI7a,MAAM,EAAG9L,IAEzB4K,GAtSF,GAsSmB5K,EAAI4K,GACxBub,EAAE9lB,EAAE4L,MAAM0a,EAAI7a,MAAM9L,EAAGA,GAvStB,KA2SHA,EA3SG,IA0SH2mB,EAAMA,EAAI7a,MAAM9L,IACG2C,YAEnB3C,GAAK4K,EAGP,KAAO5K,IAAK2mB,GAAO,KACnBR,EAAE9lB,EAAE4L,MAAM0a,SAKZR,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,GA8xBjB,SAASmhB,OAAO3nB,EAAGzB,EAAGqpB,EAAI5f,GACxB,IAAI6f,EAAIrhB,EAAGshB,EAAI3e,EAAK+b,EAKpB,GAHU,MAAN0C,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,IAEhB5nB,EAAEpB,EAAG,OAAOoB,EAAEwJ,WAKnB,GAHAqe,EAAK7nB,EAAEpB,EAAE,GACTkpB,EAAK9nB,EAAEwG,EAEE,MAALjI,EACF2mB,EAAMZ,cAActkB,EAAEpB,GACtBsmB,EAAY,GAANld,GAAiB,GAANA,GAAW8f,GAAM3B,EAC/BlB,cAAcC,EAAK4C,GACnB3C,aAAaD,EAAK4C,EAAI,UAezB,GAVAthB,GAHAxG,EAAIwnB,MAAM,IAAIje,UAAUvJ,GAAIzB,EAAGqpB,IAGzBphB,EAGN2C,GADA+b,EAAMZ,cAActkB,EAAEpB,IACZsC,OAOA,GAAN8G,GAAiB,GAANA,IAAYzJ,GAAKiI,GAAKA,GAAK2f,GAAa,CAGrD,KAAOhd,EAAM5K,EAAG2mB,GAAO,IAAK/b,KAC5B+b,EAAMD,cAAcC,EAAK1e,QAQzB,GAJAjI,GAAKupB,EACL5C,EAAMC,aAAaD,EAAK1e,EAAG,KAGvBA,EAAI,EAAI2C,GACV,KAAM5K,EAAI,EAAG,IAAK2mB,GAAO,IAAK3mB,IAAK2mB,GAAO,WAG1C,IADA3mB,GAAKiI,EAAI2C,GACD,EAEN,IADI3C,EAAI,GAAK2C,IAAK+b,GAAO,KAClB3mB,IAAK2mB,GAAO,KAM3B,OAAOllB,EAAEQ,EAAI,GAAKqnB,EAAK,IAAM3C,EAAMA,EAKrC,SAAS6C,SAASrkB,EAAMskB,GACtB,IAAIrpB,EAAGqB,EACLzB,EAAI,EAKN,IAHIoiB,QAAQjd,EAAK,MAAKA,EAAOA,EAAK,IAClC/E,EAAI,IAAI4K,UAAU7F,EAAK,MAEdnF,EAAImF,EAAKxC,QAAS,CAIzB,KAHAlB,EAAI,IAAIuJ,UAAU7F,EAAKnF,KAGhBiC,EAAG,CACR7B,EAAIqB,EACJ,MACSgoB,EAAOtpB,KAAKC,EAAGqB,KACxBrB,EAAIqB,GAIR,OAAOrB,EAQT,SAASspB,UAAUjoB,EAAGpB,EAAG4H,GAKvB,IAJA,IAAIjI,EAAI,EACN6L,EAAIxL,EAAEsC,QAGAtC,IAAIwL,GAAIxL,EAAEspB,OAGlB,IAAK9d,EAAIxL,EAAE,GAAIwL,GAAK,GAAIA,GAAK,GAAI7L,KAkBjC,OAfKiI,EAAIjI,EArrCA,GAqrCIiI,EAAe,GAAK8f,EAG/BtmB,EAAEpB,EAAIoB,EAAEwG,EAAI,KAGHA,EAAI6f,EAGbrmB,EAAEpB,EAAI,CAACoB,EAAEwG,EAAI,IAEbxG,EAAEwG,EAAIA,EACNxG,EAAEpB,EAAIA,GAGDoB,EAyDT,SAASwnB,MAAM9C,EAAGyD,EAAIP,EAAIvoB,GACxB,IAAIR,EAAGN,EAAG6L,EAAG1B,EAAG1I,EAAGooB,EAAIC,EACrBzD,EAAKF,EAAE9lB,EACP0pB,EAASnE,EAGX,GAAIS,EAAI,CAQNlgB,EAAK,CAGH,IAAK7F,EAAI,EAAG6J,EAAIkc,EAAG,GAAIlc,GAAK,GAAIA,GAAK,GAAI7J,KAIzC,IAHAN,EAAI4pB,EAAKtpB,GAGD,EACNN,GAnxCG,GAoxCH6L,EAAI+d,EAIJE,GAHAroB,EAAI4kB,EAAGwD,EAAK,IAGHE,EAAOzpB,EAAIuL,EAAI,GAAK,GAAK,OAIlC,IAFAge,EAAKtE,GAAUvlB,EAAI,GA1xChB,MA4xCOqmB,EAAG1jB,OAAQ,CAEnB,IAAI7B,EASF,MAAMqF,EANN,KAAOkgB,EAAG1jB,QAAUknB,EAAIxD,EAAGpa,KAAK,IAChCxK,EAAIqoB,EAAK,EACTxpB,EAAI,EAEJuL,GADA7L,GApyCD,OAqyCoB,MAIhB,CAIL,IAHAyB,EAAI0I,EAAIkc,EAAGwD,GAGNvpB,EAAI,EAAG6J,GAAK,GAAIA,GAAK,GAAI7J,KAU9BwpB,GAHAje,GAJA7L,GAhzCC,OAozCkBM,GAGV,EAAI,EAAImB,EAAIsoB,EAAOzpB,EAAIuL,EAAI,GAAK,GAAK,EAmBlD,GAfA/K,EAAIA,GAAK8oB,EAAK,GAKC,MAAdvD,EAAGwD,EAAK,KAAehe,EAAI,EAAIpK,EAAIA,EAAIsoB,EAAOzpB,EAAIuL,EAAI,IAEvD/K,EAAIuoB,EAAK,GACLS,GAAMhpB,KAAa,GAANuoB,GAAWA,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAC9C6nB,EAAK,GAAW,GAANA,IAAkB,GAANT,GAAWvoB,GAAW,GAANuoB,IAGrCrpB,EAAI,EAAI6L,EAAI,EAAIpK,EAAIsoB,EAAOzpB,EAAIuL,GAAK,EAAIwa,EAAGwD,EAAK,IAAM,GAAM,GAC7DR,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAEpB2nB,EAAK,IAAMvD,EAAG,GAiBhB,OAhBAA,EAAG1jB,OAAS,EAER7B,GAGF8oB,GAAMzD,EAAEle,EAAI,EAGZoe,EAAG,GAAK0D,GAn1CP,GAm1C0BH,EAn1C1B,QAo1CDzD,EAAEle,GAAK2hB,GAAM,GAIbvD,EAAG,GAAKF,EAAEle,EAAI,EAGTke,EAkBT,GAdS,GAALnmB,GACFqmB,EAAG1jB,OAASknB,EACZ1f,EAAI,EACJ0f,MAEAxD,EAAG1jB,OAASknB,EAAK,EACjB1f,EAAI4f,EAr2CD,GAq2CmB/pB,GAItBqmB,EAAGwD,GAAMhe,EAAI,EAAI2Z,EAAU/jB,EAAIsoB,EAAOzpB,EAAIuL,GAAKke,EAAOle,IAAM1B,EAAI,GAI9DrJ,EAEF,OAAU,CAGR,GAAU,GAAN+oB,EAAS,CAGX,IAAK7pB,EAAI,EAAG6L,EAAIwa,EAAG,GAAIxa,GAAK,GAAIA,GAAK,GAAI7L,KAEzC,IADA6L,EAAIwa,EAAG,IAAMlc,EACRA,EAAI,EAAG0B,GAAK,GAAIA,GAAK,GAAI1B,KAG1BnK,GAAKmK,IACPgc,EAAEle,IACEoe,EAAG,IAAMV,IAAMU,EAAG,GAAK,IAG7B,MAGA,GADAA,EAAGwD,IAAO1f,EACNkc,EAAGwD,IAAOlE,EAAM,MACpBU,EAAGwD,KAAQ,EACX1f,EAAI,EAMV,IAAKnK,EAAIqmB,EAAG1jB,OAAoB,IAAZ0jB,IAAKrmB,GAAUqmB,EAAGsD,QAIpCxD,EAAEle,EAAI8f,EACR5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,KAGHke,EAAEle,EAAI6f,IACf3B,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,IAIjB,OAAOke,EA+oCT,OAxuEAnb,UAAU8b,MAAQA,MAElB9b,UAAUgf,SAAW,EACrBhf,UAAUif,WAAa,EACvBjf,UAAUkf,WAAa,EACvBlf,UAAUmf,YAAc,EACxBnf,UAAUof,cAAgB,EAC1Bpf,UAAUqf,gBAAkB,EAC5Brf,UAAUsf,gBAAkB,EAC5Btf,UAAUuf,gBAAkB,EAC5Bvf,UAAUwf,iBAAmB,EAC7Bxf,UAAUyf,OAAS,EAmCnBzf,UAAUmS,OAASnS,UAAUwL,IAAM,SAAUrU,GAC3C,IAAIH,EAAG0oB,EAEP,GAAW,MAAPvoB,EAAa,CAEf,GAAkB,iBAAPA,EA0HT,MAAMiJ,MACJqa,EAAiB,oBAAsBtjB,GArFzC,GAlCIA,EAAIJ,eAAeC,EAAI,oBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG6jB,EAAK7jB,GACpB0lB,EAAiBgD,GAKfvoB,EAAIJ,eAAeC,EAAI,mBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG,EAAGA,GAClB2lB,EAAgB+C,GAOdvoB,EAAIJ,eAAeC,EAAI,oBAErBogB,QADJsI,EAAIvoB,EAAIH,KAENukB,SAASmE,EAAE,IAAK7E,EAAK,EAAG7jB,GACxBukB,SAASmE,EAAE,GAAI,EAAG7E,EAAK7jB,GACvB4lB,EAAa8C,EAAE,GACf7C,EAAa6C,EAAE,KAEfnE,SAASmE,GAAI7E,EAAKA,EAAK7jB,GACvB4lB,IAAeC,EAAa6C,EAAI,GAAKA,EAAIA,KAOzCvoB,EAAIJ,eAAeC,EAAI,SAEzB,GAAIogB,QADJsI,EAAIvoB,EAAIH,IAENukB,SAASmE,EAAE,IAAK7E,GAAM,EAAG7jB,GACzBukB,SAASmE,EAAE,GAAI,EAAG7E,EAAK7jB,GACvB8lB,EAAU4C,EAAE,GACZ3C,EAAU2C,EAAE,OACP,CAEL,GADAnE,SAASmE,GAAI7E,EAAKA,EAAK7jB,IACnB0oB,EAGF,MAAMtf,MACJqa,EAAiBzjB,EAAI,oBAAsB0oB,GAH7C5C,IAAYC,EAAU2C,EAAI,GAAKA,EAAIA,GAWzC,GAAIvoB,EAAIJ,eAAeC,EAAI,UAAW,CAEpC,IADA0oB,EAAIvoB,EAAIH,QACI0oB,EAcV,MAAMtf,MACJqa,EAAiBzjB,EAAI,uBAAyB0oB,GAdhD,GAAIA,EAAG,CACL,GAAqB,oBAAVC,SAAyBA,SAClCA,OAAOC,kBAAmBD,OAAOE,YAIjC,MADA7C,GAAU0C,EACJtf,MACJqa,EAAiB,sBAJnBuC,EAAS0C,OAOX1C,EAAS0C,EA0Bf,GAhBIvoB,EAAIJ,eAAeC,EAAI,iBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG,EAAGA,GAClBimB,EAAcyC,GAKZvoB,EAAIJ,eAAeC,EAAI,mBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG6jB,EAAK7jB,GACpBkmB,EAAgBwC,GAKdvoB,EAAIJ,eAAeC,EAAI,UAAW,CAEpC,GAAgB,iBADhB0oB,EAAIvoB,EAAIH,IAEH,MAAMoJ,MACTqa,EAAiBzjB,EAAI,mBAAqB0oB,GAFlBvC,EAASuC,EAOrC,GAAIvoB,EAAIJ,eAAeC,EAAI,YAAa,CAItC,GAAgB,iBAHhB0oB,EAAIvoB,EAAIH,KAGqB,iBAAiB4V,KAAK8S,GAGjD,MAAMtf,MACJqa,EAAiBzjB,EAAI,aAAe0oB,GAHtChC,EAAWgC,GAenB,MAAO,CACLhD,eAAgBA,EAChBC,cAAeA,EACfmD,eAAgB,CAAClD,EAAYC,GAC7BkD,MAAO,CAACjD,EAASC,GACjBC,OAAQA,EACRC,YAAaA,EACbC,cAAeA,EACfC,OAAQA,EACRO,SAAUA,IAUd1d,UAAUggB,YAAc,SAAUN,GAChC,OAAOA,aAAa1f,WAAa0f,IAAwB,IAAnBA,EAAEO,eAAyB,GASnEjgB,UAAUkgB,QAAUlgB,UAAUwb,IAAM,WAClC,OAAOgD,SAASpkB,UAAWuB,EAAEwL,KAS/BnH,UAAUmgB,QAAUngB,UAAUgP,IAAM,WAClC,OAAOwP,SAASpkB,UAAWuB,EAAEykB,KAc/BpgB,UAAUwC,QAOJ2Z,EANU,iBAMQ3f,KAAKgG,SAAsB,QAC9C,WAAc,OAAOgY,EAPV,iBAOoBhe,KAAKgG,WACpC,WAAc,OAA2C,SAAlB,WAAhBhG,KAAKgG,SAAwB,IACnC,QAAhBhG,KAAKgG,SAAsB,IAExB,SAAU6d,GACf,IAAInkB,EAAGC,EAAGc,EAAGkC,EAAGugB,EACd1qB,EAAI,EACJK,EAAI,GACJirB,EAAO,IAAItgB,UAAUyc,GAOvB,GALU,MAAN4D,EAAYA,EAAK3D,EAChBnB,SAAS8E,EAAI,EAAGxF,GAErB1b,EAAIob,EAAS8F,EA3jBN,IA6jBHrD,EAGF,GAAI2C,OAAOC,gBAAiB,CAI1B,IAFA1jB,EAAIyjB,OAAOC,gBAAgB,IAAIW,YAAYphB,GAAK,IAEzCnK,EAAImK,IAQTugB,EAAW,OAAPxjB,EAAElH,IAAgBkH,EAAElH,EAAI,KAAO,MAM1B,MACPmH,EAAIwjB,OAAOC,gBAAgB,IAAIW,YAAY,IAC3CrkB,EAAElH,GAAKmH,EAAE,GACTD,EAAElH,EAAI,GAAKmH,EAAE,KAKb9G,EAAE4L,KAAKye,EAAI,MACX1qB,GAAK,GAGTA,EAAImK,EAAI,MAGH,KAAIwgB,OAAOE,YA2BhB,MADA7C,GAAS,EACH5c,MACJqa,EAAiB,sBAvBnB,IAFAve,EAAIyjB,OAAOE,YAAY1gB,GAAK,GAErBnK,EAAImK,IAMTugB,EAAmB,iBAAN,GAAPxjB,EAAElH,IAA0C,cAAXkH,EAAElH,EAAI,GAC9B,WAAXkH,EAAElH,EAAI,GAAgC,SAAXkH,EAAElH,EAAI,IACjCkH,EAAElH,EAAI,IAAM,KAAOkH,EAAElH,EAAI,IAAM,GAAKkH,EAAElH,EAAI,KAErC,KACP2qB,OAAOE,YAAY,GAAGW,KAAKtkB,EAAGlH,IAI9BK,EAAE4L,KAAKye,EAAI,MACX1qB,GAAK,GAGTA,EAAImK,EAAI,EASZ,IAAK6d,EAEH,KAAOhoB,EAAImK,IACTugB,EAAIvD,KACI,OAAM9mB,EAAEL,KAAO0qB,EAAI,MAc/B,IATAW,GA3oBO,IA0oBPlhB,EAAI9J,IAAIL,KAICqrB,IACPX,EAAI9E,EA/oBC,GA+oBmByF,GACxBhrB,EAAEL,GAAKwlB,EAAUrb,EAAIugB,GAAKA,GAIZ,IAATrqB,EAAEL,GAAUK,EAAEspB,MAAO3pB,KAG5B,GAAIA,EAAI,EACNK,EAAI,CAAC4H,EAAI,OACJ,CAGL,IAAKA,GAAK,EAAa,IAAT5H,EAAE,GAAUA,EAAEorB,OAAO,EAAG,GAAIxjB,GA5pBrC,IA+pBL,IAAKjI,EAAI,EAAG0qB,EAAIrqB,EAAE,GAAIqqB,GAAK,GAAIA,GAAK,GAAI1qB,KAGpCA,EAlqBC,KAkqBaiI,GAlqBb,GAkqB6BjI,GAKpC,OAFAsrB,EAAKrjB,EAAIA,EACTqjB,EAAKjrB,EAAIA,EACFirB,IASXrE,EAAc,WAQZ,SAASyE,UAAU/E,EAAKgF,EAAQC,EAASjD,GAOvC,IANA,IAAI9c,EAEFggB,EADAtiB,EAAM,CAAC,GAEPvJ,EAAI,EACJ4K,EAAM+b,EAAIhkB,OAEL3C,EAAI4K,GAAM,CACf,IAAKihB,EAAOtiB,EAAI5G,OAAQkpB,IAAQtiB,EAAIsiB,IAASF,GAI7C,IAFApiB,EAAI,IAAMof,EAAStK,QAAQsI,EAAIxb,OAAOnL,MAEjC6L,EAAI,EAAGA,EAAItC,EAAI5G,OAAQkJ,IAEtBtC,EAAIsC,GAAK+f,EAAU,IACH,MAAdriB,EAAIsC,EAAI,KAAYtC,EAAIsC,EAAI,GAAK,GACrCtC,EAAIsC,EAAI,IAAMtC,EAAIsC,GAAK+f,EAAU,EACjCriB,EAAIsC,IAAM+f,GAKhB,OAAOriB,EAAIuiB,UAMb,OAAO,SAAUnF,EAAKgF,EAAQC,EAASG,EAAMC,GAC3C,IAAIrD,EAAUroB,EAAG2H,EAAGkC,EAAGrJ,EAAGqlB,EAAGE,EAAID,EAC/BpmB,EAAI2mB,EAAItI,QAAQ,KAChBgN,EAAK3D,EACL2B,EAAK1B,EA+BP,IA5BI3nB,GAAK,IACPmK,EAAI+d,EAGJA,EAAgB,EAChBvB,EAAMA,EAAImC,QAAQ,IAAK,IAEvB3C,GADAC,EAAI,IAAIpb,UAAU2gB,IACZM,IAAItF,EAAIhkB,OAAS3C,GACvBkoB,EAAgB/d,EAKhBic,EAAE/lB,EAAIqrB,UAAU9E,aAAab,cAAcI,EAAE9lB,GAAI8lB,EAAEle,EAAG,KACrD,GAAI2jB,EAxDK,cAyDVxF,EAAEne,EAAIme,EAAE/lB,EAAEsC,QAUZsF,EAAIkC,GALJkc,EAAKqF,UAAU/E,EAAKgF,EAAQC,EAASI,GACjCrD,EAAWD,EA/DH,eAgERC,EAhEQ,aAgEYD,KAGb/lB,OAGO,GAAX0jB,IAAKlc,GAASkc,EAAGsD,OAGxB,IAAKtD,EAAG,GAAI,OAAOsC,EAASxd,OAAO,GAqCnC,GAlCInL,EAAI,IACJiI,GAEFke,EAAE9lB,EAAIgmB,EACNF,EAAEle,EAAIA,EAGNke,EAAElkB,EAAI8pB,EAEN1F,GADAF,EAAIa,EAAIb,EAAGC,EAAGiF,EAAIhC,EAAIuC,IACfvrB,EACPS,EAAIqlB,EAAErlB,EACNmH,EAAIke,EAAEle,GASRjI,EAAIqmB,EAHJ/lB,EAAI2H,EAAIojB,EAAK,GAOblhB,EAAIyhB,EAAU,EACd9qB,EAAIA,GAAKR,EAAI,GAAkB,MAAb+lB,EAAG/lB,EAAI,GAEzBQ,EAAIuoB,EAAK,GAAU,MAALrpB,GAAac,KAAa,GAANuoB,GAAWA,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAC1DjC,EAAImK,GAAKnK,GAAKmK,IAAW,GAANkf,GAAWvoB,GAAW,GAANuoB,GAAuB,EAAZhD,EAAG/lB,EAAI,IACtD+oB,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAKxB3B,EAAI,IAAM+lB,EAAG,GAGfM,EAAM7lB,EAAI8lB,aAAa+B,EAASxd,OAAO,IAAKkgB,EAAI1C,EAASxd,OAAO,IAC1Dwd,EAASxd,OAAO,OACjB,CAML,GAHAkb,EAAG1jB,OAASrC,EAGRQ,EAGF,MAAO8qB,IAAWvF,IAAK/lB,GAAKsrB,GAC1BvF,EAAG/lB,GAAK,EAEHA,MACD2H,EACFoe,EAAK,CAAC,GAAG9b,OAAO8b,IAMtB,IAAKlc,EAAIkc,EAAG1jB,QAAS0jB,IAAKlc,KAG1B,IAAKnK,EAAI,EAAG2mB,EAAM,GAAI3mB,GAAKmK,EAAGwc,GAAOgC,EAASxd,OAAOkb,EAAGrmB,OAGxD2mB,EAAMC,aAAaD,EAAK1e,EAAG0gB,EAASxd,OAAO,IAI7C,OAAOwb,GAlJG,GAwJdK,EAAM,WAGJ,SAASkF,SAAS/F,EAAGhc,EAAGgiB,GACtB,IAAI/rB,EAAGgsB,EAAMC,EAAKC,EAChBC,EAAQ,EACRvsB,EAAImmB,EAAExjB,OACN6pB,EAAMriB,EA30BA,IA40BNsiB,EAAMtiB,EA50BA,IA40BgB,EAExB,IAAKgc,EAAIA,EAAEra,QAAS9L,KAKlBusB,IADAH,EAAOI,GAHPH,EAAMlG,EAAEnmB,GA/0BF,MAi1BNI,EAAIqsB,EAAMJ,GADVC,EAAMnG,EAAEnmB,GAh1BF,IAg1BmB,GACHwsB,GAj1BhB,QAk1B6CD,GACnCJ,EAAO,IAAM/rB,EAn1BvB,IAm1BuC,GAAKqsB,EAAMH,EACxDnG,EAAEnmB,GAAKosB,EAAOD,EAKhB,OAFII,IAAOpG,EAAI,CAACoG,GAAOhiB,OAAO4b,IAEvBA,EAGT,SAASD,QAAQhf,EAAGC,EAAGulB,EAAIC,GACzB,IAAI3sB,EAAG4sB,EAEP,GAAIF,GAAMC,EACRC,EAAMF,EAAKC,EAAK,GAAK,OAGrB,IAAK3sB,EAAI4sB,EAAM,EAAG5sB,EAAI0sB,EAAI1sB,IAExB,GAAIkH,EAAElH,IAAMmH,EAAEnH,GAAI,CAChB4sB,EAAM1lB,EAAElH,GAAKmH,EAAEnH,GAAK,GAAK,EACzB,MAKN,OAAO4sB,EAGT,SAASC,SAAS3lB,EAAGC,EAAGulB,EAAIP,GAI1B,IAHA,IAAInsB,EAAI,EAGD0sB,KACLxlB,EAAEwlB,IAAO1sB,EACTA,EAAIkH,EAAEwlB,GAAMvlB,EAAEulB,GAAM,EAAI,EACxBxlB,EAAEwlB,GAAM1sB,EAAImsB,EAAOjlB,EAAEwlB,GAAMvlB,EAAEulB,GAI/B,MAAQxlB,EAAE,IAAMA,EAAEvE,OAAS,EAAGuE,EAAEukB,OAAO,EAAG,KAI5C,OAAO,SAAUtF,EAAGC,EAAGiF,EAAIhC,EAAI8C,GAC7B,IAAIS,EAAK3kB,EAAGjI,EAAG8sB,EAAMrrB,EAAGsrB,EAAMC,EAAOC,EAAGC,EAAIC,EAAKC,EAAMC,EAAMC,EAAIC,EAAIC,EACnEC,EAAIC,EACJzrB,EAAIkkB,EAAElkB,GAAKmkB,EAAEnkB,EAAI,GAAK,EACtBokB,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAGT,KAAKgmB,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAItb,UAGTmb,EAAElkB,GAAMmkB,EAAEnkB,IAAMokB,GAAKC,GAAMD,EAAG,IAAMC,EAAG,GAAMA,GAG7CD,GAAe,GAATA,EAAG,KAAYC,EAAS,EAAJrkB,EAAQA,EAAI,EAHa0rB,KAoBvD,IAZAT,GADAD,EAAI,IAAIjiB,UAAU/I,IACX5B,EAAI,GAEX4B,EAAIopB,GADJpjB,EAAIke,EAAEle,EAAIme,EAAEne,GACC,EAERkkB,IACHA,EAAOxG,EACP1d,EAAI6d,SAASK,EAAEle,EA75BV,IA65B0B6d,SAASM,EAAEne,EA75BrC,IA85BLhG,EAAIA,EA95BC,GA85Bc,GAKhBjC,EAAI,EAAGsmB,EAAGtmB,KAAOqmB,EAAGrmB,IAAM,GAAIA,KAInC,GAFIsmB,EAAGtmB,IAAMqmB,EAAGrmB,IAAM,IAAIiI,IAEtBhG,EAAI,EACNirB,EAAGjhB,KAAK,GACR6gB,GAAO,MACF,CAwBL,IAvBAS,EAAKlH,EAAG1jB,OACR8qB,EAAKnH,EAAG3jB,OACR3C,EAAI,EACJiC,GAAK,GAILR,EAAI+jB,EAAU2G,GAAQ7F,EAAG,GAAK,KAItB,IACNA,EAAK4F,SAAS5F,EAAI7kB,EAAG0qB,GACrB9F,EAAK6F,SAAS7F,EAAI5kB,EAAG0qB,GACrBsB,EAAKnH,EAAG3jB,OACR4qB,EAAKlH,EAAG1jB,QAGV2qB,EAAKG,EAELL,GADAD,EAAM9G,EAAGva,MAAM,EAAG2hB,IACP9qB,OAGJyqB,EAAOK,EAAIN,EAAIC,KAAU,GAChCM,EAAKpH,EAAGxa,QACR4hB,EAAK,CAAC,GAAGnjB,OAAOmjB,GAChBF,EAAMlH,EAAG,GACLA,EAAG,IAAM6F,EAAO,GAAGqB,IAIvB,EAAG,CAOD,GANA/rB,EAAI,GAGJmrB,EAAM1G,QAAQI,EAAI6G,EAAKM,EAAIL,IAGjB,EAAG,CAqBX,GAjBAC,EAAOF,EAAI,GACPM,GAAML,IAAMC,EAAOA,EAAOlB,GAAQgB,EAAI,IAAM,KAGhD1rB,EAAI+jB,EAAU6H,EAAOG,IAab,EAcN,IAXI/rB,GAAK0qB,IAAM1qB,EAAI0qB,EAAO,GAI1Ba,GADAD,EAAOb,SAAS5F,EAAI7kB,EAAG0qB,IACVxpB,OACbyqB,EAAOD,EAAIxqB,OAM+B,GAAnCujB,QAAQ6G,EAAMI,EAAKH,EAAOI,IAC/B3rB,IAGAorB,SAASE,EAAMU,EAAKT,EAAQU,EAAKpH,EAAI0G,EAAOb,GAC5Ca,EAAQD,EAAKpqB,OACbiqB,EAAM,OAQC,GAALnrB,IAGFmrB,EAAMnrB,EAAI,GAKZurB,GADAD,EAAOzG,EAAGxa,SACGnJ,OAUf,GAPIqqB,EAAQI,IAAML,EAAO,CAAC,GAAGxiB,OAAOwiB,IAGpCF,SAASM,EAAKJ,EAAMK,EAAMjB,GAC1BiB,EAAOD,EAAIxqB,QAGC,GAARiqB,EAMF,KAAO1G,QAAQI,EAAI6G,EAAKM,EAAIL,GAAQ,GAClC3rB,IAGAorB,SAASM,EAAKM,EAAKL,EAAOM,EAAKpH,EAAI8G,EAAMjB,GACzCiB,EAAOD,EAAIxqB,YAGE,IAARiqB,IACTnrB,IACA0rB,EAAM,CAAC,IAITD,EAAGltB,KAAOyB,EAGN0rB,EAAI,GACNA,EAAIC,KAAU/G,EAAGiH,IAAO,GAExBH,EAAM,CAAC9G,EAAGiH,IACVF,EAAO,UAEDE,IAAOC,GAAgB,MAAVJ,EAAI,KAAelrB,KAE1C6qB,EAAiB,MAAVK,EAAI,GAGND,EAAG,IAAIA,EAAGzB,OAAO,EAAG,GAG3B,GAAIU,GAAQxG,EAAM,CAGhB,IAAK3lB,EAAI,EAAGiC,EAAIirB,EAAG,GAAIjrB,GAAK,GAAIA,GAAK,GAAIjC,KAEzCipB,MAAMgE,EAAG5B,GAAM4B,EAAEhlB,EAAIjI,EA9jChB,GA8jCoBiI,EAAe,GAAK,EAAGohB,EAAIyD,QAIpDG,EAAEhlB,EAAIA,EACNglB,EAAEnsB,GAAKgsB,EAGT,OAAOG,GA9PL,GAkYA7F,EAAa,8BACfC,EAAW,cACXC,EAAY,cACZC,EAAkB,qBAClBC,EAAmB,6BALvBN,EAOS,SAAUf,EAAGQ,EAAKkC,EAAO1hB,GAC9B,IAAIglB,EACFlqB,EAAI4mB,EAAQlC,EAAMA,EAAImC,QAAQtB,EAAkB,IAGlD,GAAID,EAAgB3P,KAAK3V,GACvBkkB,EAAElkB,EAAIyO,MAAMzO,GAAK,KAAOA,EAAI,GAAK,EAAI,EACrCkkB,EAAE9lB,EAAI8lB,EAAEle,EAAI,SACP,CACL,IAAK4gB,IAGH5mB,EAAIA,EAAE6mB,QAAQ1B,GAAY,SAAUhnB,EAAGwtB,EAAIC,GAEzC,OADA1B,EAAkC,MAA1B0B,EAAKA,EAAG1E,eAAwB,GAAW,KAAN0E,EAAY,EAAI,EACrD1mB,GAAKA,GAAKglB,EAAY/rB,EAALwtB,KAGvBzmB,IACFglB,EAAOhlB,EAGPlF,EAAIA,EAAE6mB,QAAQzB,EAAU,MAAMyB,QAAQxB,EAAW,SAG/CX,GAAO1kB,GAAG,OAAO,IAAI+I,UAAU/I,EAAGkqB,GAKxC,GAAInhB,UAAUke,MACZ,MAAM9d,MACHqa,EAAiB,SAAWte,EAAI,SAAWA,EAAI,IAAM,YAAcwf,GAIxER,EAAE9lB,EAAI8lB,EAAEle,EAAIke,EAAElkB,EAAI,OA8KxB0E,EAAEmnB,cAAgBnnB,EAAEonB,IAAM,WACxB,IAAI5H,EAAI,IAAInb,UAAU9F,MAEtB,OADIihB,EAAElkB,EAAI,IAAGkkB,EAAElkB,EAAI,GACZkkB,GAWTxf,EAAEqnB,WAAa,SAAU5H,EAAGjf,GAC1B,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,KAiBxCR,EAAEsnB,cAAgBtnB,EAAE0kB,GAAK,SAAUA,EAAIhC,GACrC,IAAIhpB,EAAGoB,EAAGipB,EACRvE,EAAIjhB,KAEN,GAAU,MAANmmB,EAKF,OAJA9E,SAAS8E,EAAI,EAAGxF,GACN,MAANwD,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GAEdJ,MAAM,IAAIje,UAAUmb,GAAIkF,EAAKlF,EAAEle,EAAI,EAAGohB,GAG/C,KAAMhpB,EAAI8lB,EAAE9lB,GAAI,OAAO,KAIvB,GAHAoB,EA98CS,KA88CHipB,EAAIrqB,EAAEsC,OAAS,GAAKmjB,SAAS5gB,KAAK+C,EA98C/B,KAi9CLyiB,EAAIrqB,EAAEqqB,GAAI,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIjpB,KAG3C,OAFIA,EAAI,IAAGA,EAAI,GAERA,GAwBTkF,EAAEunB,UAAYvnB,EAAEqgB,IAAM,SAAUZ,EAAGjf,GACjC,OAAO6f,EAAI9hB,KAAM,IAAI8F,UAAUob,EAAGjf,GAAIugB,EAAgBC,IAQxDhhB,EAAEwnB,mBAAqBxnB,EAAEynB,KAAO,SAAUhI,EAAGjf,GAC3C,OAAO6f,EAAI9hB,KAAM,IAAI8F,UAAUob,EAAGjf,GAAI,EAAG,IAmB3CR,EAAE0nB,gBAAkB1nB,EAAEslB,IAAM,SAAUxqB,EAAGrB,GACvC,IAAIkuB,EAAMC,EAAUpkB,EAASqkB,EAAQC,EAAQC,EAAQtI,EACnDD,EAAIjhB,KAKN,IAHAzD,EAAI,IAAIuJ,UAAUvJ,IAGZpB,IAAMoB,EAAEktB,YACZ,MAAMvjB,MACHqa,EAAiB,4BAA8BhkB,GASpD,GANS,MAALrB,IAAWA,EAAI,IAAI4K,UAAU5K,IAGjCouB,EAAS/sB,EAAEwG,EAAI,IAGVke,EAAE9lB,IAAM8lB,EAAE9lB,EAAE,IAAgB,GAAV8lB,EAAE9lB,EAAE,KAAY8lB,EAAEle,GAAmB,GAAdke,EAAE9lB,EAAEsC,SAAgBlB,EAAEpB,IAAMoB,EAAEpB,EAAE,GAK5E,OADA+lB,EAAI,IAAIpb,UAAUxD,KAAKykB,KAAK9F,EAAE3V,UAAWge,EAAS,EAAI/H,MAAMhlB,IAAMA,IAC3DrB,EAAIgmB,EAAEwI,IAAIxuB,GAAKgmB,EAKxB,GAFAqI,EAAShtB,EAAEQ,EAAI,EAEX7B,EAAG,CAGL,GAAIA,EAAEC,GAAKD,EAAEC,EAAE,IAAMD,EAAE6B,EAAG,OAAO,IAAI+I,UAAU2iB,MAE/CY,GAAYE,GAAUtI,EAAEwI,aAAevuB,EAAEuuB,eAE3BxI,EAAIA,EAAEyI,IAAIxuB,QAInB,IAAIqB,EAAEwG,EAAI,IAAMke,EAAEle,EAAI,GAAKke,EAAEle,GAAK,IAAa,GAAPke,EAAEle,EAE7Cke,EAAE9lB,EAAE,GAAK,GAAKmuB,GAAUrI,EAAE9lB,EAAE,IAAM,KAElC8lB,EAAE9lB,EAAE,GAAK,MAAQmuB,GAAUrI,EAAE9lB,EAAE,IAAM,YASvC,OANA8J,EAAIgc,EAAElkB,EAAI,GAAKwkB,MAAMhlB,IAAM,EAAI,EAG3B0kB,EAAEle,GAAK,IAAGkC,EAAI,EAAIA,GAGf,IAAIa,UAAUyjB,EAAS,EAAItkB,EAAIA,GAE7B+d,IAKT/d,EAAIob,EAAS2C,EApkDN,GAokDiC,IAe1C,IAZIsG,GACFF,EAAO,IAAItjB,UAAU,IACrB0jB,EAASjI,MAAMhlB,IAEfitB,EAASjtB,EAAI,EAGXgtB,IAAQhtB,EAAEQ,EAAI,GAElBmkB,EAAI,IAAIpb,UAAUyc,KAGR,CAER,GAAIiH,EAAQ,CAEV,KADAtI,EAAIA,EAAEyI,MAAM1I,IACL9lB,EAAG,MAEN8J,EACEic,EAAE/lB,EAAEsC,OAASwH,IAAGic,EAAE/lB,EAAEsC,OAASwH,GACxBokB,IACTnI,EAAIA,EAAEwI,IAAIxuB,IAId,GAAIouB,EAAQ,CAGV,GADAvF,MADAxnB,EAAIA,EAAEotB,MAAMP,GACH7sB,EAAEwG,EAAI,EAAG,IACbxG,EAAEpB,EAAE,GAAI,MACbmuB,EAAS/sB,EAAEwG,EAAI,GACfymB,EAASjI,MAAMhlB,OACV,CAEL,KADAA,EAAI+jB,EAAU/jB,EAAI,IACV,MACRitB,EAASjtB,EAAI,EAGf0kB,EAAIA,EAAE0I,MAAM1I,GAERhc,EACEgc,EAAE9lB,GAAK8lB,EAAE9lB,EAAEsC,OAASwH,IAAGgc,EAAE9lB,EAAEsC,OAASwH,GAC/BokB,IACTpI,EAAIA,EAAEyI,IAAIxuB,IAId,OAAImuB,EAAiBnI,GACjBqI,IAAQrI,EAAIqB,EAAIT,IAAIZ,IAEjBhmB,EAAIgmB,EAAEwI,IAAIxuB,GAAK+J,EAAI8e,MAAM7C,EAAG8B,EAAeP,OA9G3BmF,GA8GkD1G,IAY3Ezf,EAAEmoB,aAAe,SAAUzF,GACzB,IAAI5nB,EAAI,IAAIuJ,UAAU9F,MAGtB,OAFU,MAANmkB,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GACdJ,MAAMxnB,EAAGA,EAAEwG,EAAI,EAAGohB,IAQ3B1iB,EAAEooB,UAAYpoB,EAAEkJ,GAAK,SAAUuW,EAAGjf,GAChC,OAA8C,IAAvC+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,KAOxCR,EAAEqoB,SAAW,WACX,QAAS9pB,KAAK7E,GAQhBsG,EAAEsoB,cAAgBtoB,EAAEykB,GAAK,SAAUhF,EAAGjf,GACpC,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,IAAM,GAQ9CR,EAAEuoB,uBAAyBvoB,EAAEwoB,IAAM,SAAU/I,EAAGjf,GAC9C,OAAoD,KAA5CA,EAAI+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,MAAoB,IAANA,GAQ3DR,EAAEgoB,UAAY,WACZ,QAASzpB,KAAK7E,GAAKylB,SAAS5gB,KAAK+C,EAprDxB,IAorDwC/C,KAAK7E,EAAEsC,OAAS,GAQnEgE,EAAEyoB,WAAazoB,EAAEwL,GAAK,SAAUiU,EAAGjf,GACjC,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,IAAM,GAQ9CR,EAAE0oB,oBAAsB1oB,EAAE2oB,IAAM,SAAUlJ,EAAGjf,GAC3C,OAAqD,KAA7CA,EAAI+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,MAAqB,IAANA,GAO5DR,EAAE+J,MAAQ,WACR,OAAQxL,KAAKjD,GAOf0E,EAAE4oB,WAAa,WACb,OAAOrqB,KAAKjD,EAAI,GAOlB0E,EAAE6oB,WAAa,WACb,OAAOtqB,KAAKjD,EAAI,GAOlB0E,EAAE8oB,OAAS,WACT,QAASvqB,KAAK7E,GAAkB,GAAb6E,KAAK7E,EAAE,IAwB5BsG,EAAE+oB,MAAQ,SAAUtJ,EAAGjf,GACrB,IAAInH,EAAG6L,EAAG3K,EAAGyuB,EACXxJ,EAAIjhB,KACJgC,EAAIif,EAAElkB,EAMR,GAHAkF,GADAif,EAAI,IAAIpb,UAAUob,EAAGjf,IACflF,GAGDiF,IAAMC,EAAG,OAAO,IAAI6D,UAAU2iB,KAGnC,GAAIzmB,GAAKC,EAEP,OADAif,EAAEnkB,GAAKkF,EACAgf,EAAEyJ,KAAKxJ,GAGhB,IAAIyJ,EAAK1J,EAAEle,EA/wDF,GAgxDP6nB,EAAK1J,EAAEne,EAhxDA,GAixDPoe,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAET,IAAKwvB,IAAOC,EAAI,CAGd,IAAKzJ,IAAOC,EAAI,OAAOD,GAAMD,EAAEnkB,GAAKkF,EAAGif,GAAK,IAAIpb,UAAUsb,EAAKH,EAAIwH,KAGnE,IAAKtH,EAAG,KAAOC,EAAG,GAGhB,OAAOA,EAAG,IAAMF,EAAEnkB,GAAKkF,EAAGif,GAAK,IAAIpb,UAAUqb,EAAG,GAAKF,EAGnC,GAAjBwB,GAAsB,EAAI,GAS/B,GALAkI,EAAK/J,SAAS+J,GACdC,EAAKhK,SAASgK,GACdzJ,EAAKA,EAAGva,QAGJ5E,EAAI2oB,EAAKC,EAAI,CAaf,KAXIH,EAAOzoB,EAAI,IACbA,GAAKA,EACLhG,EAAImlB,IAEJyJ,EAAKD,EACL3uB,EAAIolB,GAGNplB,EAAE4qB,UAGG3kB,EAAID,EAAGC,IAAKjG,EAAE+K,KAAK,IACxB/K,EAAE4qB,eAMF,IAFAjgB,GAAK8jB,GAAQzoB,EAAImf,EAAG1jB,SAAWwE,EAAImf,EAAG3jB,SAAWuE,EAAIC,EAEhDD,EAAIC,EAAI,EAAGA,EAAI0E,EAAG1E,IAErB,GAAIkf,EAAGlf,IAAMmf,EAAGnf,GAAI,CAClBwoB,EAAOtJ,EAAGlf,GAAKmf,EAAGnf,GAClB,MAYN,GANIwoB,IAAMzuB,EAAImlB,EAAIA,EAAKC,EAAIA,EAAKplB,EAAGklB,EAAEnkB,GAAKmkB,EAAEnkB,IAE5CkF,GAAK0E,EAAIya,EAAG3jB,SAAW3C,EAAIqmB,EAAG1jB,SAItB,EAAG,KAAOwE,IAAKkf,EAAGrmB,KAAO,GAIjC,IAHAmH,EAAIwe,EAAO,EAGJ9Z,EAAI3E,GAAI,CAEb,GAAImf,IAAKxa,GAAKya,EAAGza,GAAI,CACnB,IAAK7L,EAAI6L,EAAG7L,IAAMqmB,IAAKrmB,GAAIqmB,EAAGrmB,GAAKmH,KACjCkf,EAAGrmB,GACLqmB,EAAGxa,IAAM8Z,EAGXU,EAAGxa,IAAMya,EAAGza,GAId,KAAgB,GAATwa,EAAG,GAASA,EAAGoF,OAAO,EAAG,KAAMqE,GAGtC,OAAKzJ,EAAG,GAWDqD,UAAUtD,EAAGC,EAAIyJ,IAPtB1J,EAAEnkB,EAAqB,GAAjB0lB,GAAsB,EAAI,EAChCvB,EAAE/lB,EAAI,CAAC+lB,EAAEne,EAAI,GACNme,IA8BXzf,EAAEopB,OAASppB,EAAEioB,IAAM,SAAUxI,EAAGjf,GAC9B,IAAI8lB,EAAGhrB,EACLkkB,EAAIjhB,KAKN,OAHAkhB,EAAI,IAAIpb,UAAUob,EAAGjf,IAGhBgf,EAAE9lB,IAAM+lB,EAAEnkB,GAAKmkB,EAAE/lB,IAAM+lB,EAAE/lB,EAAE,GACvB,IAAI2K,UAAU2iB,MAGXvH,EAAE/lB,GAAK8lB,EAAE9lB,IAAM8lB,EAAE9lB,EAAE,GACtB,IAAI2K,UAAUmb,IAGJ,GAAf8B,GAIFhmB,EAAImkB,EAAEnkB,EACNmkB,EAAEnkB,EAAI,EACNgrB,EAAIjG,EAAIb,EAAGC,EAAG,EAAG,GACjBA,EAAEnkB,EAAIA,EACNgrB,EAAEhrB,GAAKA,GAEPgrB,EAAIjG,EAAIb,EAAGC,EAAG,EAAG6B,IAGnB7B,EAAID,EAAEuJ,MAAMzC,EAAE4B,MAAMzI,KAGb/lB,EAAE,IAAqB,GAAf4nB,IAAkB7B,EAAEnkB,EAAIkkB,EAAElkB,GAElCmkB,IAwBTzf,EAAEqpB,aAAerpB,EAAEkoB,MAAQ,SAAUzI,EAAGjf,GACtC,IAAI9G,EAAG4H,EAAGjI,EAAG6L,EAAG1B,EAAG/J,EAAG6vB,EAAK5D,EAAKC,EAAK4D,EAAKC,EAAKC,EAAKC,EAClDlE,EACAhG,EAAIjhB,KACJmhB,EAAKF,EAAE9lB,EACPimB,GAAMF,EAAI,IAAIpb,UAAUob,EAAGjf,IAAI9G,EAGjC,KAAKgmB,GAAOC,GAAOD,EAAG,IAAOC,EAAG,IAmB9B,OAhBKH,EAAElkB,IAAMmkB,EAAEnkB,GAAKokB,IAAOA,EAAG,KAAOC,GAAMA,IAAOA,EAAG,KAAOD,EAC1DD,EAAE/lB,EAAI+lB,EAAEne,EAAIme,EAAEnkB,EAAI,MAElBmkB,EAAEnkB,GAAKkkB,EAAElkB,EAGJokB,GAAOC,GAKVF,EAAE/lB,EAAI,CAAC,GACP+lB,EAAEne,EAAI,GALNme,EAAE/lB,EAAI+lB,EAAEne,EAAI,MASTme,EAYT,IATAne,EAAI6d,SAASK,EAAEle,EA39DN,IA29DsB6d,SAASM,EAAEne,EA39DjC,IA49DTme,EAAEnkB,GAAKkkB,EAAElkB,GACTguB,EAAM5J,EAAG1jB,SACTutB,EAAM5J,EAAG3jB,UAGM0tB,EAAKhK,EAAIA,EAAKC,EAAIA,EAAK+J,EAAIrwB,EAAIiwB,EAAKA,EAAMC,EAAKA,EAAMlwB,GAG/DA,EAAIiwB,EAAMC,EAAKG,EAAK,GAAIrwB,IAAKqwB,EAAGpkB,KAAK,IAK1C,IAHAkgB,EAAOxG,EAl+DG,IAq+DL3lB,EAAIkwB,IAAOlwB,GAAK,GAAI,CAKvB,IAJAK,EAAI,EACJ8vB,EAAM7J,EAAGtmB,GAv+DD,IAw+DRowB,EAAM9J,EAAGtmB,GAx+DD,IAw+DiB,EAEX6L,EAAI7L,GAAbmK,EAAI8lB,GAAgBpkB,EAAI7L,GAK3BK,IADAgsB,EAAM8D,GAHN9D,EAAMhG,IAAKlc,GA3+DL,MA6+DN/J,EAAIgwB,EAAM/D,GADVC,EAAMjG,EAAGlc,GA5+DH,IA4+DmB,GACHgmB,GA7+DhB,QA8+D0CE,EAAGxkB,GAAKxL,GAC7C8rB,EAAO,IAAM/rB,EA/+DlB,IA++DiC,GAAKgwB,EAAM9D,EAClD+D,EAAGxkB,KAAOwgB,EAAMF,EAGlBkE,EAAGxkB,GAAKxL,EASV,OANIA,IACA4H,EAEFooB,EAAG5E,OAAO,EAAG,GAGR/B,UAAUtD,EAAGiK,EAAIpoB,IAQ1BtB,EAAE2pB,QAAU,WACV,IAAInK,EAAI,IAAInb,UAAU9F,MAEtB,OADAihB,EAAElkB,GAAKkkB,EAAElkB,GAAK,KACPkkB,GAwBTxf,EAAEipB,KAAO,SAAUxJ,EAAGjf,GACpB,IAAIjG,EACFilB,EAAIjhB,KACJgC,EAAIif,EAAElkB,EAMR,GAHAkF,GADAif,EAAI,IAAIpb,UAAUob,EAAGjf,IACflF,GAGDiF,IAAMC,EAAG,OAAO,IAAI6D,UAAU2iB,KAGlC,GAAIzmB,GAAKC,EAER,OADAif,EAAEnkB,GAAKkF,EACAgf,EAAEuJ,MAAMtJ,GAGjB,IAAIyJ,EAAK1J,EAAEle,EApjEF,GAqjEP6nB,EAAK1J,EAAEne,EArjEA,GAsjEPoe,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAET,IAAKwvB,IAAOC,EAAI,CAGd,IAAKzJ,IAAOC,EAAI,OAAO,IAAItb,UAAU9D,EAAI,GAIzC,IAAKmf,EAAG,KAAOC,EAAG,GAAI,OAAOA,EAAG,GAAKF,EAAI,IAAIpb,UAAUqb,EAAG,GAAKF,EAAQ,EAAJjf,GAQrE,GALA2oB,EAAK/J,SAAS+J,GACdC,EAAKhK,SAASgK,GACdzJ,EAAKA,EAAGva,QAGJ5E,EAAI2oB,EAAKC,EAAI,CAUf,IATI5oB,EAAI,GACN4oB,EAAKD,EACL3uB,EAAIolB,IAEJpf,GAAKA,EACLhG,EAAImlB,GAGNnlB,EAAE4qB,UACK5kB,IAAKhG,EAAE+K,KAAK,IACnB/K,EAAE4qB,UAUJ,KAPA5kB,EAAImf,EAAG1jB,SACPwE,EAAImf,EAAG3jB,QAGK,IAAGzB,EAAIolB,EAAIA,EAAKD,EAAIA,EAAKnlB,EAAGiG,EAAID,GAGvCA,EAAI,EAAGC,GACVD,GAAKmf,IAAKlf,GAAKkf,EAAGlf,GAAKmf,EAAGnf,GAAKD,GAAKye,EAAO,EAC3CU,EAAGlf,GAAKwe,IAASU,EAAGlf,GAAK,EAAIkf,EAAGlf,GAAKwe,EAUvC,OAPIze,IACFmf,EAAK,CAACnf,GAAGqD,OAAO8b,KACdyJ,GAKGpG,UAAUtD,EAAGC,EAAIyJ,IAmB1BnpB,EAAE4pB,UAAY5pB,EAAEijB,GAAK,SAAUA,EAAIP,GACjC,IAAIhpB,EAAGoB,EAAGipB,EACRvE,EAAIjhB,KAEN,GAAU,MAAN0kB,GAAcA,MAASA,EAKzB,OAJArD,SAASqD,EAAI,EAAG/D,GACN,MAANwD,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GAEdJ,MAAM,IAAIje,UAAUmb,GAAIyD,EAAIP,GAGrC,KAAMhpB,EAAI8lB,EAAE9lB,GAAI,OAAO,KAIvB,GAFAoB,EA1oES,IAyoETipB,EAAIrqB,EAAEsC,OAAS,GACI,EAEf+nB,EAAIrqB,EAAEqqB,GAAI,CAGZ,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIjpB,KAG7B,IAAKipB,EAAIrqB,EAAE,GAAIqqB,GAAK,GAAIA,GAAK,GAAIjpB,MAKnC,OAFImoB,GAAMzD,EAAEle,EAAI,EAAIxG,IAAGA,EAAI0kB,EAAEle,EAAI,GAE1BxG,GAYTkF,EAAE6pB,UAAY,SAAUrmB,GAEtB,OADAoc,SAASpc,GAnqEQ,mCAoqEVjF,KAAK2pB,MAAM,KAAO1kB,IAe3BxD,EAAE8pB,WAAa9pB,EAAE+pB,KAAO,WACtB,IAAItwB,EAAGqB,EAAGX,EAAG6vB,EAAKzvB,EAChBilB,EAAIjhB,KACJ7E,EAAI8lB,EAAE9lB,EACN4B,EAAIkkB,EAAElkB,EACNgG,EAAIke,EAAEle,EACNojB,EAAK3D,EAAiB,EACtB4G,EAAO,IAAItjB,UAAU,OAGvB,GAAU,IAAN/I,IAAY5B,IAAMA,EAAE,GACtB,OAAO,IAAI2K,WAAW/I,GAAKA,EAAI,KAAO5B,GAAKA,EAAE,IAAMstB,IAAMttB,EAAI8lB,EAAI,KA8BnE,GAtBS,IAJTlkB,EAAIuF,KAAKkpB,MAAMvK,KAIDlkB,GAAK,OACjBR,EAAIskB,cAAc1lB,IACXsC,OAASsF,GAAK,GAAK,IAAGxG,GAAK,KAClCQ,EAAIuF,KAAKkpB,KAAKjvB,GACdwG,EAAI6d,UAAU7d,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS1CnH,EAAI,IAAIkK,UANNvJ,EADEQ,GAAK,IACH,KAAOgG,GAEXxG,EAAIQ,EAAEykB,iBACA5a,MAAM,EAAGrK,EAAE4c,QAAQ,KAAO,GAAKpW,IAKvCnH,EAAI,IAAIkK,UAAU/I,EAAI,IAOpBnB,EAAET,EAAE,GAMN,KAJA4B,GADAgG,EAAInH,EAAEmH,GACEojB,GACA,IAAGppB,EAAI,KAOb,GAHAf,EAAIJ,EACJA,EAAIwtB,EAAKO,MAAM3tB,EAAE0uB,KAAK5I,EAAIb,EAAGjlB,EAAGmqB,EAAI,KAEhCtF,cAAc7kB,EAAEb,GAAKyL,MAAM,EAAG7J,MAAQR,EACvCskB,cAAcjlB,EAAET,IAAIyL,MAAM,EAAG7J,GAAI,CAWlC,GANInB,EAAEmH,EAAIA,KAAKhG,EAMN,SALTR,EAAIA,EAAEqK,MAAM7J,EAAI,EAAGA,EAAI,MAKH0uB,GAAY,QAALlvB,GAgBpB,EAICA,KAAOA,EAAEqK,MAAM,IAAqB,KAAfrK,EAAE0J,OAAO,MAGlC8d,MAAMnoB,EAAGA,EAAEmH,EAAIyf,EAAiB,EAAG,GACnCtnB,GAAKU,EAAE+tB,MAAM/tB,GAAG+O,GAAGsW,IAGrB,MAvBA,IAAKwK,IACH1H,MAAM/nB,EAAGA,EAAE+G,EAAIyf,EAAiB,EAAG,GAE/BxmB,EAAE2tB,MAAM3tB,GAAG2O,GAAGsW,IAAI,CACpBrlB,EAAII,EACJ,MAIJmqB,GAAM,EACNppB,GAAK,EACL0uB,EAAM,EAkBd,OAAO1H,MAAMnoB,EAAGA,EAAEmH,EAAIyf,EAAiB,EAAGC,EAAevnB,IAa3DuG,EAAE+f,cAAgB,SAAU2E,EAAIhC,GAK9B,OAJU,MAANgC,IACF9E,SAAS8E,EAAI,EAAGxF,GAChBwF,KAEKjC,OAAOlkB,KAAMmmB,EAAIhC,EAAI,IAgB9B1iB,EAAEiqB,QAAU,SAAUvF,EAAIhC,GAKxB,OAJU,MAANgC,IACF9E,SAAS8E,EAAI,EAAGxF,GAChBwF,EAAKA,EAAKnmB,KAAK+C,EAAI,GAEdmhB,OAAOlkB,KAAMmmB,EAAIhC,IAuB1B1iB,EAAEkqB,SAAW,SAAUxF,EAAIhC,GACzB,IAAI1C,EAAMzhB,KAAK0rB,QAAQvF,EAAIhC,GAE3B,GAAInkB,KAAK7E,EAAG,CACV,IAAIL,EACFuJ,EAAMod,EAAInb,MAAM,KAChBslB,GAAM3I,EAAOG,UACbyI,GAAM5I,EAAOI,mBACbF,EAAiBF,EAAOE,eACxB2I,EAAUznB,EAAI,GACd0nB,EAAe1nB,EAAI,GACnB2nB,EAAQhsB,KAAKjD,EAAI,EACjBkvB,EAAYD,EAAQF,EAAQllB,MAAM,GAAKklB,EACvCpmB,EAAMumB,EAAUxuB,OAIlB,GAFIouB,IAAI/wB,EAAI8wB,EAAIA,EAAKC,EAAIA,EAAK/wB,EAAG4K,GAAO5K,GAEpC8wB,EAAK,GAAKlmB,EAAM,EAAG,CAIrB,IAHA5K,EAAI4K,EAAMkmB,GAAMA,EAChBE,EAAUG,EAAUC,OAAO,EAAGpxB,GAEvBA,EAAI4K,EAAK5K,GAAK8wB,EACnBE,GAAW3I,EAAiB8I,EAAUC,OAAOpxB,EAAG8wB,GAG9CC,EAAK,IAAGC,GAAW3I,EAAiB8I,EAAUrlB,MAAM9L,IACpDkxB,IAAOF,EAAU,IAAMA,GAG7BrK,EAAMsK,EACHD,EAAU7I,EAAOC,mBAAqB2I,GAAM5I,EAAOM,mBAClDwI,EAAanI,QAAQ,IAAIrd,OAAO,OAASslB,EAAK,OAAQ,KACvD,KAAO5I,EAAOK,wBACbyI,GACDD,EAGL,OAAOrK,GAeThgB,EAAE0qB,WAAa,SAAUC,GACvB,IAAI/nB,EAAKjJ,EAAGixB,EAAIC,EAAIC,EAAIxpB,EAAGypB,EAAKjwB,EAAGkwB,EAAIC,EAAI3E,EAAGhrB,EAC5CkkB,EAAIjhB,KACJmhB,EAAKF,EAAE9lB,EAET,GAAU,MAANixB,MACF7vB,EAAI,IAAIuJ,UAAUsmB,IAGX3C,cAAgBltB,EAAEpB,GAAa,IAARoB,EAAEQ,IAAYR,EAAE0Q,GAAGsV,IAC/C,MAAMrc,MACHqa,EAAiB,aACfhkB,EAAEktB,YAAc,iBAAmB,oBAAsB2C,GAIlE,IAAKjL,EAAI,OAAOF,EAAElb,WAoBlB,IAlBA3K,EAAI,IAAI0K,UAAUyc,GAClBmK,EAAKL,EAAK,IAAIvmB,UAAUyc,GACxB+J,EAAKG,EAAK,IAAI3mB,UAAUyc,GACxBxlB,EAAI8jB,cAAcM,GAIlBpe,EAAI3H,EAAE2H,EAAIhG,EAAEU,OAASwjB,EAAEle,EAAI,EAC3B3H,EAAED,EAAE,GAAKulB,GAAU8L,EAAMzpB,EAh6EhB,IAg6EgC,EAh6EhC,GAg6E+CypB,EAAMA,GAC9DJ,GAAMA,GAAM7vB,EAAEusB,WAAW1tB,GAAK,EAAK2H,EAAI,EAAI3H,EAAIsxB,EAAMnwB,EAErDiwB,EAAM3J,EACNA,EAAU,IACVtmB,EAAI,IAAIuJ,UAAU/I,GAGlB0vB,EAAGtxB,EAAE,GAAK,EAGR4sB,EAAIjG,EAAIvlB,EAAGnB,EAAG,EAAG,GAEQ,IADzBmxB,EAAKF,EAAG3B,KAAK3C,EAAE4B,MAAM2C,KACdxD,WAAWsD,IAClBC,EAAKC,EACLA,EAAKC,EACLG,EAAKD,EAAG/B,KAAK3C,EAAE4B,MAAM4C,EAAKG,IAC1BD,EAAKF,EACLnxB,EAAImB,EAAEiuB,MAAMzC,EAAE4B,MAAM4C,EAAKnxB,IACzBmB,EAAIgwB,EAgBN,OAbAA,EAAKzK,EAAIsK,EAAG5B,MAAM6B,GAAKC,EAAI,EAAG,GAC9BG,EAAKA,EAAG/B,KAAK6B,EAAG5C,MAAM+C,IACtBL,EAAKA,EAAG3B,KAAK6B,EAAG5C,MAAM2C,IACtBG,EAAG1vB,EAAI2vB,EAAG3vB,EAAIkkB,EAAElkB,EAIhBsH,EAAMyd,EAAI4K,EAAIJ,EAHdvpB,GAAK,EAGgB0f,GAAe+H,MAAMvJ,GAAG4H,MAAMC,WAChDhH,EAAI2K,EAAIJ,EAAItpB,EAAG0f,GAAe+H,MAAMvJ,GAAG4H,OAAS,EAC7C,CAAC6D,EAAG3mB,WAAYumB,EAAGvmB,YACnB,CAAC0mB,EAAG1mB,WAAYsmB,EAAGtmB,YAEzB8c,EAAU2J,EACHnoB,GAOT5C,EAAEkrB,SAAW,WACX,OAAQ3sB,MAeVyB,EAAEmrB,YAAc,SAAUlI,EAAIP,GAE5B,OADU,MAANO,GAAYrD,SAASqD,EAAI,EAAG/D,GACzBuD,OAAOlkB,KAAM0kB,EAAIP,EAAI,IAe9B1iB,EAAEsE,SAAW,SAAU9D,GACrB,IAAIwf,EACFllB,EAAIyD,KACJjD,EAAIR,EAAEQ,EACNgG,EAAIxG,EAAEwG,EA0BR,OAvBU,OAANA,EAEEhG,GACF0kB,EAAM,WACF1kB,EAAI,IAAG0kB,EAAM,IAAMA,IAEvBA,EAAM,OAGRA,EAAMZ,cAActkB,EAAEpB,GAEb,MAAL8G,EACFwf,EAAM1e,GAAK2f,GAAc3f,GAAK4f,EAC3BnB,cAAcC,EAAK1e,GACnB2e,aAAaD,EAAK1e,EAAG,MAExBse,SAASpf,EAAG,EAAGuhB,EAAS/lB,OAAQ,QAChCgkB,EAAMM,EAAYL,aAAaD,EAAK1e,EAAG,KAAM,GAAId,EAAGlF,GAAG,IAGrDA,EAAI,GAAKR,EAAEpB,EAAE,KAAIsmB,EAAM,IAAMA,IAG5BA,GAQThgB,EAAE6J,QAAU7J,EAAEorB,OAAS,WACrB,IAAIpL,EACFllB,EAAIyD,KACJ+C,EAAIxG,EAAEwG,EAER,OAAU,OAANA,EAAmBxG,EAAEwJ,YAEzB0b,EAAMZ,cAActkB,EAAEpB,GAEtBsmB,EAAM1e,GAAK2f,GAAc3f,GAAK4f,EAC1BnB,cAAcC,EAAK1e,GACnB2e,aAAaD,EAAK1e,EAAG,KAElBxG,EAAEQ,EAAI,EAAI,IAAM0kB,EAAMA,IAI/BhgB,EAAEskB,cAAe,EAEG,MAAhBlE,GAAsB/b,UAAUwL,IAAIuQ,GAEjC/b,UAuIG8b,IACO,QAAI9b,EAAUA,UAAYA,OAIH,KAAxC,aAAqB,OAAOA,GAAY,8BA/uF3C,I,i3BCAD,YAEA,IAAIgnB,EAAe,EAAQ,KAW3B,SAAS9L,QAAQhf,EAAGC,GAClB,GAAID,IAAMC,EACR,OAAO,EAMT,IAHA,IAAIgf,EAAIjf,EAAEvE,OACNyjB,EAAIjf,EAAExE,OAED3C,EAAI,EAAG4K,EAAMpD,KAAKwS,IAAImM,EAAGC,GAAIpmB,EAAI4K,IAAO5K,EAC/C,GAAIkH,EAAElH,KAAOmH,EAAEnH,GAAI,CACjBmmB,EAAIjf,EAAElH,GACNomB,EAAIjf,EAAEnH,GACN,MAIJ,OAAImmB,EAAIC,GACE,EAENA,EAAID,EACC,EAEF,EAET,SAAS8L,SAAS9qB,GAChB,OAAIxB,EAAO2F,QAA4C,mBAA3B3F,EAAO2F,OAAO2mB,SACjCtsB,EAAO2F,OAAO2mB,SAAS9qB,KAEjB,MAALA,IAAaA,EAAE+qB,WA+B3B,IAAIC,EAAO,EAAQ,KACfC,EAAS1xB,OAAOoB,UAAUC,eAC1BswB,EAASjoB,MAAMtI,UAAUgK,MACzBwmB,EACgC,QAA3B,SAASC,QAAShyB,KAE3B,SAASiyB,UAAWrwB,GAClB,OAAOzB,OAAOoB,UAAUmJ,SAAS9K,KAAKgC,GAExC,SAASswB,OAAOC,GACd,OAAIT,SAASS,KAGqB,mBAAvB/sB,EAAOgtB,cAGgB,mBAAvBA,YAAYF,OACdE,YAAYF,OAAOC,KAEvBA,IAGDA,aAAkBE,aAGlBF,EAAOG,QAAUH,EAAOG,kBAAkBF,gBAShD,IAAIG,EAASrzB,EAAOD,QAAUuzB,GAO1BC,EAAQ,8BAEZ,SAASC,QAAQC,GACf,GAAKf,EAAK3Q,WAAW0R,GAArB,CAGA,GAAIZ,EACF,OAAOY,EAAK3yB,KAEd,IACI4yB,EADMD,EAAKjoB,WACCkoB,MAAMH,GACtB,OAAOG,GAASA,EAAM,IAyCxB,SAASC,SAASnxB,EAAGR,GACnB,MAAiB,iBAANQ,EACFA,EAAEU,OAASlB,EAAIQ,EAAIA,EAAE6J,MAAM,EAAGrK,GAE9BQ,EAGX,SAASoxB,QAAQC,GACf,GAAIhB,IAAuBH,EAAK3Q,WAAW8R,GACzC,OAAOnB,EAAKkB,QAAQC,GAEtB,IAAIC,EAAUN,QAAQK,GAEtB,MAAO,aADIC,EAAU,KAAOA,EAAU,IACT,IAmB/B,SAASC,KAAKC,EAAQC,EAAUpf,EAASqf,EAAUC,GACjD,MAAM,IAAId,EAAOe,eAAe,CAC9Bvf,QAASA,EACTmf,OAAQA,EACRC,SAAUA,EACVC,SAAUA,EACVC,mBAAoBA,IAcxB,SAASb,GAAG9xB,EAAOqT,GACZrT,GAAOuyB,KAAKvyB,GAAO,EAAMqT,EAAS,KAAMwe,EAAOC,IAoCtD,SAASe,WAAWL,EAAQC,EAAUK,EAAQC,GAE5C,GAAIP,IAAWC,EACb,OAAO,EACF,GAAIzB,SAASwB,IAAWxB,SAASyB,GACtC,OAAqC,IAA9BxN,QAAQuN,EAAQC,GAIlB,GAAIvB,EAAK8B,OAAOR,IAAWtB,EAAK8B,OAAOP,GAC5C,OAAOD,EAAOS,YAAcR,EAASQ,UAKhC,GAAI/B,EAAKgC,SAASV,IAAWtB,EAAKgC,SAAST,GAChD,OAAOD,EAAOxtB,SAAWytB,EAASztB,QAC3BwtB,EAAO9tB,SAAW+tB,EAAS/tB,QAC3B8tB,EAAOW,YAAcV,EAASU,WAC9BX,EAAOY,YAAcX,EAASW,WAC9BZ,EAAOa,aAAeZ,EAASY,WAIjC,GAAgB,OAAXb,GAAqC,iBAAXA,GACb,OAAbC,GAAyC,iBAAbA,EASjC,IAAIjB,OAAOgB,IAAWhB,OAAOiB,IACzBlB,UAAUiB,KAAYjB,UAAUkB,MAC9BD,aAAkBc,cAClBd,aAAkBe,cAC7B,OACoD,IAD7CtO,QAAQ,IAAIuO,WAAWhB,EAAOZ,QACtB,IAAI4B,WAAWf,EAASb,SAQlC,GAAIZ,SAASwB,KAAYxB,SAASyB,GACvC,OAAO,EAIP,IAAIgB,GAFJV,EAAQA,GAAS,CAACP,OAAQ,GAAIC,SAAU,KAEhBD,OAAOpV,QAAQoV,GACvC,OAAqB,IAAjBiB,GACEA,IAAgBV,EAAMN,SAASrV,QAAQqV,KAK7CM,EAAMP,OAAOxnB,KAAKwnB,GAClBO,EAAMN,SAASznB,KAAKynB,GAUxB,SAASiB,SAASztB,EAAGC,EAAG4sB,EAAQa,GAC9B,GAAI1tB,eAAiCC,EACnC,OAAO,EAET,GAAIgrB,EAAK0C,YAAY3tB,IAAMirB,EAAK0C,YAAY1tB,GAC1C,OAAOD,IAAMC,EACf,GAAI4sB,GAAUrzB,OAAO0C,eAAe8D,KAAOxG,OAAO0C,eAAe+D,GAC/D,OAAO,EACT,IAAI2tB,EAAUC,YAAY7tB,GACtB8tB,EAAUD,YAAY5tB,GAC1B,GAAK2tB,IAAYE,IAAcF,GAAWE,EACxC,OAAO,EACT,GAAIF,EAGF,OAFA5tB,EAAImrB,EAAOlyB,KAAK+G,GAChBC,EAAIkrB,EAAOlyB,KAAKgH,GACT2sB,WAAW5sB,EAAGC,EAAG4sB,GAE1B,IAEIxyB,EAAKvB,EAFLi1B,EAAKC,EAAWhuB,GAChBiuB,EAAKD,EAAW/tB,GAIpB,GAAI8tB,EAAGtyB,SAAWwyB,EAAGxyB,OACnB,OAAO,EAKT,IAHAsyB,EAAGG,OACHD,EAAGC,OAEEp1B,EAAIi1B,EAAGtyB,OAAS,EAAG3C,GAAK,EAAGA,IAC9B,GAAIi1B,EAAGj1B,KAAOm1B,EAAGn1B,GACf,OAAO,EAIX,IAAKA,EAAIi1B,EAAGtyB,OAAS,EAAG3C,GAAK,EAAGA,IAE9B,GADAuB,EAAM0zB,EAAGj1B,IACJ8zB,WAAW5sB,EAAE3F,GAAM4F,EAAE5F,GAAMwyB,EAAQa,GACtC,OAAO,EAEX,OAAO,EA/CED,CAASlB,EAAQC,EAAUK,EAAQC,IApC1C,OAAOD,EAASN,IAAWC,EAAWD,GAAUC,EAwCpD,SAASqB,YAAYnzB,GACnB,MAAiD,sBAA1ClB,OAAOoB,UAAUmJ,SAAS9K,KAAKyB,GAgFxC,SAASyzB,kBAAkB5B,EAAQC,GACjC,IAAKD,IAAWC,EACd,OAAO,EAGT,GAAgD,mBAA5ChzB,OAAOoB,UAAUmJ,SAAS9K,KAAKuzB,GACjC,OAAOA,EAAS9b,KAAK6b,GAGvB,IACE,GAAIA,aAAkBC,EACpB,OAAO,EAET,MAAOzrB,IAIT,OAAImD,MAAMkqB,cAAc5B,KAIa,IAA9BA,EAASvzB,KAAK,GAAIszB,GAa3B,SAAS8B,QAAQC,EAAaC,EAAO/B,EAAUpf,GAC7C,IAAImf,EAEJ,GAAqB,mBAAVgC,EACT,MAAM,IAAIlzB,UAAU,uCAGE,iBAAbmxB,IACTpf,EAAUof,EACVA,EAAW,MAGbD,EAtBF,SAASiC,UAAUD,GACjB,IAAI7wB,EACJ,IACE6wB,IACA,MAAOxtB,GACPrD,EAAQqD,EAEV,OAAOrD,EAeE8wB,CAAUD,GAEnBnhB,GAAWof,GAAYA,EAASnzB,KAAO,KAAOmzB,EAASnzB,KAAO,KAAO,MAC1D+T,EAAU,IAAMA,EAAU,KAEjCkhB,IAAgB/B,GAClBD,KAAKC,EAAQC,EAAU,6BAA+Bpf,GAGxD,IAAIqhB,EAAyC,iBAAZrhB,EAE7BshB,GAAyBJ,GAAe/B,IAAWC,EASvD,KAV2B8B,GAAerD,EAAK0D,QAAQpC,IAInDkC,GACAN,kBAAkB5B,EAAQC,IAC1BkC,IACFpC,KAAKC,EAAQC,EAAU,yBAA2Bpf,GAG/CkhB,GAAe/B,GAAUC,IACzB2B,kBAAkB5B,EAAQC,KAAgB8B,GAAe/B,EAC5D,MAAMA,EAvVVX,EAAOe,eAAiB,SAASA,eAAeiC,GAC9C5wB,KAAK3E,KAAO,iBACZ2E,KAAKuuB,OAASqC,EAAQrC,OACtBvuB,KAAKwuB,SAAWoC,EAAQpC,SACxBxuB,KAAKyuB,SAAWmC,EAAQnC,SACpBmC,EAAQxhB,SACVpP,KAAKoP,QAAUwhB,EAAQxhB,QACvBpP,KAAK6wB,kBAAmB,IAExB7wB,KAAKoP,QA6CT,SAAS0hB,WAAWhyB,GAClB,OAAOovB,SAASC,QAAQrvB,EAAKyvB,QAAS,KAAO,IACtCzvB,EAAK2vB,SAAW,IAChBP,SAASC,QAAQrvB,EAAK0vB,UAAW,KAhDvBsC,CAAW9wB,MAC1BA,KAAK6wB,kBAAmB,GAE1B,IAAInC,EAAqBkC,EAAQlC,oBAAsBJ,KACvD,GAAIpoB,MAAM6qB,kBACR7qB,MAAM6qB,kBAAkB/wB,KAAM0uB,OACzB,CAEL,IAAItuB,EAAM,IAAI8F,MACd,GAAI9F,EAAI4wB,MAAO,CACb,IAAI/vB,EAAMb,EAAI4wB,MAGVC,EAAUlD,QAAQW,GAClBwC,EAAMjwB,EAAIkY,QAAQ,KAAO8X,GAC7B,GAAIC,GAAO,EAAG,CAGZ,IAAIC,EAAYlwB,EAAIkY,QAAQ,KAAM+X,EAAM,GACxCjwB,EAAMA,EAAI6iB,UAAUqN,EAAY,GAGlCnxB,KAAKgxB,MAAQ/vB,KAMnBgsB,EAAKmE,SAASxD,EAAOe,eAAgBzoB,OA6CrC0nB,EAAOU,KAAOA,KAYdV,EAAOC,GAAKA,GAMZD,EAAOyD,MAAQ,SAASA,MAAM9C,EAAQC,EAAUpf,GAC1Cmf,GAAUC,GAAUF,KAAKC,EAAQC,EAAUpf,EAAS,KAAMwe,EAAOyD,QAMvEzD,EAAO0D,SAAW,SAASA,SAAS/C,EAAQC,EAAUpf,GAChDmf,GAAUC,GACZF,KAAKC,EAAQC,EAAUpf,EAAS,KAAMwe,EAAO0D,WAOjD1D,EAAO2D,UAAY,SAASA,UAAUhD,EAAQC,EAAUpf,GACjDwf,WAAWL,EAAQC,GAAU,IAChCF,KAAKC,EAAQC,EAAUpf,EAAS,YAAawe,EAAO2D,YAIxD3D,EAAO4D,gBAAkB,SAASA,gBAAgBjD,EAAQC,EAAUpf,GAC7Dwf,WAAWL,EAAQC,GAAU,IAChCF,KAAKC,EAAQC,EAAUpf,EAAS,kBAAmBwe,EAAO4D,kBAuH9D5D,EAAO6D,aAAe,SAASA,aAAalD,EAAQC,EAAUpf,GACxDwf,WAAWL,EAAQC,GAAU,IAC/BF,KAAKC,EAAQC,EAAUpf,EAAS,eAAgBwe,EAAO6D,eAI3D7D,EAAO8D,mBACP,SAASA,mBAAmBnD,EAAQC,EAAUpf,GACxCwf,WAAWL,EAAQC,GAAU,IAC/BF,KAAKC,EAAQC,EAAUpf,EAAS,qBAAsBsiB,qBAQ1D9D,EAAO+D,YAAc,SAASA,YAAYpD,EAAQC,EAAUpf,GACtDmf,IAAWC,GACbF,KAAKC,EAAQC,EAAUpf,EAAS,MAAOwe,EAAO+D,cAOlD/D,EAAOgE,eAAiB,SAASA,eAAerD,EAAQC,EAAUpf,GAC5Dmf,IAAWC,GACbF,KAAKC,EAAQC,EAAUpf,EAAS,MAAOwe,EAAOgE,iBA+ElDhE,EAAOiE,OAAS,SAAStB,EAAmB7wB,EAAmB0P,GAC7DihB,SAAQ,EAAME,EAAO7wB,EAAO0P,IAI9Bwe,EAAOkE,aAAe,SAASvB,EAAmB7wB,EAAmB0P,GACnEihB,SAAQ,EAAOE,EAAO7wB,EAAO0P,IAG/Bwe,EAAOmE,QAAU,SAAS3xB,GAAO,GAAIA,EAAK,MAAMA,GAMhDwtB,EAAOiB,OAAS/B,GAHhB,SAAS+B,OAAO9yB,EAAOqT,GAChBrT,GAAOuyB,KAAKvyB,GAAO,EAAMqT,EAAS,KAAMyf,UAEVjB,EAAQ,CAC3CyD,MAAOzD,EAAO+D,YACdJ,UAAW3D,EAAO4D,gBAClBF,SAAU1D,EAAOgE,eACjBH,aAAc7D,EAAO8D,qBAEvB9D,EAAOiB,OAAOA,OAASjB,EAAOiB,OAE9B,IAAImB,EAAax0B,OAAO4M,MAAQ,SAAUnL,GACxC,IAAImL,EAAO,GACX,IAAK,IAAI/L,KAAOY,EACViwB,EAAOjyB,KAAKgC,EAAKZ,IAAM+L,EAAKrB,KAAK1K,GAEvC,OAAO+L,K,kCCxfT,IAAI4pB,EAAW,EAAQ,KAmCvBz3B,EAAOD,QAPP,SAASua,UAAU9Y,GACjB,IAAIqR,EAAS4kB,EAASj2B,GAClBk2B,EAAY7kB,EAAS,EAEzB,OAAOA,GAAWA,EAAU6kB,EAAY7kB,EAAS6kB,EAAY7kB,EAAU,I,gBChCzE,IAAI1C,EAAa,EAAQ,IACrBQ,EAAe,EAAQ,IA2B3B3Q,EAAOD,QALP,SAAS43B,SAASn2B,GAChB,MAAuB,iBAATA,GACXmP,EAAanP,IArBF,mBAqBY2O,EAAW3O,K,gBCzBvC,IAAIF,EAAS,EAAQ,IACjB8jB,EAAW,EAAQ,IACnBzC,EAAU,EAAQ,IAClBgV,EAAW,EAAQ,KAMnBC,EAAct2B,EAASA,EAAOe,eAAYyD,EAC1C+xB,EAAiBD,EAAcA,EAAYpsB,cAAW1F,EA0B1D9F,EAAOD,QAhBP,SAAS+3B,aAAat2B,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAImhB,EAAQnhB,GAEV,OAAO4jB,EAAS5jB,EAAOs2B,cAAgB,GAEzC,GAAIH,EAASn2B,GACX,OAAOq2B,EAAiBA,EAAen3B,KAAKc,GAAS,GAEvD,IAAIqR,EAAUrR,EAAQ,GACtB,MAAkB,KAAVqR,GAAkB,EAAIrR,IA3BjB,IA2BwC,KAAOqR,I,gBCjC9D,IAAIklB,EAAY,EAAQ,KACpB9f,EAAa,EAAQ,IACrB+f,EAAc,EAAQ,KAe1Bh4B,EAAOD,QANP,SAASk4B,WAAW/f,GAClB,OAAOD,EAAWC,GACd8f,EAAY9f,GACZ6f,EAAU7f,K,gBCdD,SAASggB,eAAezwB,GAChC,OAAY,MAALA,GAA0B,iBAANA,IAAoD,IAAlCA,EAAE,4BCSvC,SAAS0wB,QAAQ3yB,GAC9B,OAAO,SAAS4yB,GAAG3wB,GACjB,OAAyB,IAArB9B,UAAUzC,QAAgBg1B,eAAezwB,GACpC2wB,GAEA5yB,EAAGI,MAAMH,KAAME,Y,qxTCM5B,IAKe,EALWwyB,SAAQ,SAASE,OAAOvnB,GAChD,OAAO,WACL,OAAOA,MCLI,EADM,GAAO,GCCb,EADM,GAAO,GCSb,GAAE,4BAA4B,GCf9B,SAASwnB,QAAQ9yB,GAC9B,OAAO,SAAS+yB,GAAG9wB,EAAGC,GACpB,OAAQ/B,UAAUzC,QAChB,KAAK,EACH,OAAOq1B,GACT,KAAK,EACH,OAAOL,eAAezwB,GAAK8wB,GAAKJ,SAAQ,SAAUK,GAChD,OAAOhzB,EAAGiC,EAAG+wB,MAEjB,QACE,OAAON,eAAezwB,IAAMywB,eAAexwB,GAAK6wB,GAAKL,eAAezwB,GAAK0wB,SAAQ,SAAUM,GACzF,OAAOjzB,EAAGizB,EAAI/wB,MACXwwB,eAAexwB,GAAKywB,SAAQ,SAAUK,GACzC,OAAOhzB,EAAGiC,EAAG+wB,MACVhzB,EAAGiC,EAAGC,KCNnB,IAGe,EAHQ4wB,SAAQ,SAASI,IAAIjxB,EAAGC,GAC7C,OAAOixB,OAAOlxB,GAAKkxB,OAAOjxB,MCTb,SAASkxB,QAAQC,EAAMC,GAGpC,IAAInC,EADJmC,EAAOA,GAAQ,GAEf,IAAIC,GAHJF,EAAOA,GAAQ,IAGC31B,OACZ81B,EAAOF,EAAK51B,OACZ2P,EAAS,GAGb,IADA8jB,EAAM,EACCA,EAAMoC,GACXlmB,EAAOA,EAAO3P,QAAU21B,EAAKlC,GAC7BA,GAAO,EAGT,IADAA,EAAM,EACCA,EAAMqC,GACXnmB,EAAOA,EAAO3P,QAAU41B,EAAKnC,GAC7BA,GAAO,EAET,OAAO9jB,EC7BM,SAASomB,OAAOj3B,EAAGwD,GAEhC,OAAQxD,GACN,KAAK,EACH,OAAO,WACL,OAAOwD,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,GACf,OAAO1zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,GACnB,OAAO3zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,GACvB,OAAO5zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,GAC3B,OAAO7zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,GAC/B,OAAO9zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACnC,OAAO/zB,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACvC,OAAOh0B,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC3C,OAAOj0B,EAAGI,MAAMH,KAAME,YAE1B,KAAK,EACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC/C,OAAOl0B,EAAGI,MAAMH,KAAME,YAE1B,KAAK,GACH,OAAO,SAAUuzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACnD,OAAOn0B,EAAGI,MAAMH,KAAME,YAE1B,QACE,MAAM,IAAIgG,MAAM,gFCnCP,SAASiuB,QAAQ12B,EAAQ22B,EAAUr0B,GAChD,OAAO,WAKL,IAJA,IAAIs0B,EAAW,GACXC,EAAU,EACVC,EAAO92B,EACP+2B,EAAc,EACXA,EAAcJ,EAAS32B,QAAU62B,EAAUp0B,UAAUzC,QAAQ,CAClE,IAAI2P,EACAonB,EAAcJ,EAAS32B,UAAYg1B,eAAe2B,EAASI,KAAiBF,GAAWp0B,UAAUzC,QACnG2P,EAASgnB,EAASI,IAElBpnB,EAASlN,UAAUo0B,GACnBA,GAAW,GAEbD,EAASG,GAAepnB,EACnBqlB,eAAerlB,KAClBmnB,GAAQ,GAEVC,GAAe,EAEjB,OAAOD,GAAQ,EAAIx0B,EAAGI,MAAMH,KAAMq0B,GAAYb,OAAOe,EAAMJ,QAAQ12B,EAAQ42B,EAAUt0B,KCczF,IAMe,EANW8yB,SAAQ,SAAS4B,OAAOh3B,EAAQsC,GACxD,OAAe,IAAXtC,EACKi1B,QAAQ3yB,GAEVyzB,OAAO/1B,EAAQ02B,QAAQ12B,EAAQ,GAAIsC,OCT7B,EAda2yB,SAAQ,SAASgC,SAAS30B,GACpD,OAAO,EAAOA,EAAGtC,QAAQ,WACvB,IAAIyzB,EAAM,EACNyD,EAASz0B,UAAU,GACnB00B,EAAO10B,UAAUA,UAAUzC,OAAS,GACpCwC,EAAOiF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,GAMjD,OALAD,EAAK,GAAK,WACR,IAAImN,EAASunB,EAAOx0B,MAAMH,KAAMmzB,QAAQjzB,UAAW,CAACgxB,EAAK0D,KAEzD,OADA1D,GAAO,EACA9jB,GAEFrN,EAAGI,MAAMH,KAAMC,SC3BX,SAAS40B,QAAQ90B,GAC9B,OAAO,SAAS+0B,GAAG9yB,EAAGC,EAAG9G,GACvB,OAAQ+E,UAAUzC,QAChB,KAAK,EACH,OAAOq3B,GACT,KAAK,EACH,OAAOrC,eAAezwB,GAAK8yB,GAAKjC,SAAQ,SAAUE,EAAIgC,GACpD,OAAOh1B,EAAGiC,EAAG+wB,EAAIgC,MAErB,KAAK,EACH,OAAOtC,eAAezwB,IAAMywB,eAAexwB,GAAK6yB,GAAKrC,eAAezwB,GAAK6wB,SAAQ,SAAUG,EAAI+B,GAC7F,OAAOh1B,EAAGizB,EAAI/wB,EAAG8yB,MACdtC,eAAexwB,GAAK4wB,SAAQ,SAAUE,EAAIgC,GAC7C,OAAOh1B,EAAGiC,EAAG+wB,EAAIgC,MACdrC,SAAQ,SAAUqC,GACrB,OAAOh1B,EAAGiC,EAAGC,EAAG8yB,MAEpB,QACE,OAAOtC,eAAezwB,IAAMywB,eAAexwB,IAAMwwB,eAAet3B,GAAK25B,GAAKrC,eAAezwB,IAAMywB,eAAexwB,GAAK4wB,SAAQ,SAAUG,EAAID,GACvI,OAAOhzB,EAAGizB,EAAID,EAAI53B,MACfs3B,eAAezwB,IAAMywB,eAAet3B,GAAK03B,SAAQ,SAAUG,EAAI+B,GAClE,OAAOh1B,EAAGizB,EAAI/wB,EAAG8yB,MACdtC,eAAexwB,IAAMwwB,eAAet3B,GAAK03B,SAAQ,SAAUE,EAAIgC,GAClE,OAAOh1B,EAAGiC,EAAG+wB,EAAIgC,MACdtC,eAAezwB,GAAK0wB,SAAQ,SAAUM,GACzC,OAAOjzB,EAAGizB,EAAI/wB,EAAG9G,MACds3B,eAAexwB,GAAKywB,SAAQ,SAAUK,GACzC,OAAOhzB,EAAGiC,EAAG+wB,EAAI53B,MACds3B,eAAet3B,GAAKu3B,SAAQ,SAAUqC,GACzC,OAAOh1B,EAAGiC,EAAGC,EAAG8yB,MACbh1B,EAAGiC,EAAGC,EAAG9G,KCdtB,IAUe,EAVW05B,SAAQ,SAASG,OAAOj1B,EAAImxB,EAAK0D,GACzD,GAAI1D,GAAO0D,EAAKn3B,QAAUyzB,GAAO0D,EAAKn3B,OACpC,OAAOm3B,EAET,IACIK,GADQ/D,EAAM,EAAI0D,EAAKn3B,OAAS,GACjByzB,EACfgE,EAAQ/B,QAAQyB,GAEpB,OADAM,EAAMD,GAAQl1B,EAAG60B,EAAKK,IACfC,KCxBM,EAAAhwB,MAAA,8BACb,OAAc,MAAPmG,GAAeA,EAAI5N,QAAU,GAA6C,mBAAxCjC,OAAOoB,UAAUmJ,SAAS9K,KAAKoQ,ICb3D,SAAS8pB,eAAel4B,GACrC,MAA2C,mBAA7BA,EAAI,qBCgBL,SAASm4B,cAAcC,EAAaC,EAAIv1B,GACrD,OAAO,WACL,GAAyB,IAArBG,UAAUzC,OACZ,OAAOsC,IAET,IAAIE,EAAOiF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,GAC7CjD,EAAMgD,EAAKwkB,MACf,IAAK8Q,EAASt4B,GAAM,CAElB,IADA,IAAIi0B,EAAM,EACHA,EAAMmE,EAAY53B,QAAQ,CAC/B,GAAqC,mBAA1BR,EAAIo4B,EAAYnE,IACzB,OAAOj0B,EAAIo4B,EAAYnE,IAAM/wB,MAAMlD,EAAKgD,GAE1CixB,GAAO,EAET,GAAIiE,eAAel4B,GAAM,CACvB,IAAIu4B,EAAaF,EAAGn1B,MAAM,KAAMF,GAChC,OAAOu1B,EAAWv4B,IAGtB,OAAO8C,EAAGI,MAAMH,KAAME,YCrCX,SAASu1B,SAASxU,GAC/B,OAAOA,GAAKA,EAAE,wBAA0BA,EAAI,CAC1C,qBAAsBA,EACtB,wBAAwB,GCHb,OACbjR,KAAM,WACJ,OAAOhQ,KAAKs1B,GAAG,wBAEjBloB,OAAQ,SAAUA,GAChB,OAAOpN,KAAKs1B,GAAG,uBAAuBloB,KCDtC,EAAoB,WACtB,SAASsoB,KAAK9yB,EAAG0yB,GACft1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EACT5C,KAAK4P,KAAM,EAiBb,OAfA8lB,KAAK94B,UAAU,qBAAuB+4B,EAAQ3lB,KAC9C0lB,KAAK94B,UAAU,uBAAyB,SAAUwQ,GAIhD,OAHIpN,KAAK4P,MACPxC,EAASpN,KAAKs1B,GAAG,qBAAqBloB,GAAQ,IAEzCpN,KAAKs1B,GAAG,uBAAuBloB,IAExCsoB,KAAK94B,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAKtD,OAJK51B,KAAK4C,EAAEgzB,KACV51B,KAAK4P,KAAM,EACXxC,EAASqoB,SAASz1B,KAAKs1B,GAAG,qBAAqBloB,GAAQ,KAElDA,GAGFsoB,KArBe,GCkCT,EAVQ7C,QAAsBuC,cAAc,CAAC,ODAnCvC,SAAQ,SAASgD,MAAMjzB,EAAG0yB,GACjD,OAAO,IAAI,EAAK1yB,EAAG0yB,OCDsD,SAAS1lB,IAAI7P,EAAI60B,GAE1F,IADA,IAAI1D,EAAM,EACHA,EAAM0D,EAAKn3B,QAAQ,CACxB,IAAKsC,EAAG60B,EAAK1D,IACX,OAAO,EAETA,GAAO,EAET,OAAO,MCdM,EAHQ2B,SAAQ,SAASvR,IAAItf,EAAGC,GAC7C,OAAOA,EAAID,EAAIC,EAAID,KCpBN,SAAS8zB,KAAK/1B,EAAIg2B,GAI/B,IAHA,IAAI7E,EAAM,EACNxrB,EAAMqwB,EAAQt4B,OACd2P,EAASlI,MAAMQ,GACZwrB,EAAMxrB,GACX0H,EAAO8jB,GAAOnxB,EAAGg2B,EAAQ7E,IACzBA,GAAO,EAET,OAAO9jB,ECRM,SAAS4oB,UAAU/U,GAChC,MAA6C,oBAAtCzlB,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,GCoBxC,IAwBe,EAxBiByR,SAAQ,SAASuD,YAAYhV,GAC3D,QAAIsU,EAAStU,MAGRA,IAGY,iBAANA,KAGP+U,UAAU/U,KAGK,IAAfA,EAAEiV,WACKjV,EAAExjB,OAEI,IAAbwjB,EAAExjB,QAGFwjB,EAAExjB,OAAS,IACNwjB,EAAEpkB,eAAe,IAAMokB,EAAEpkB,eAAeokB,EAAExjB,OAAS,UCzC1D04B,EAAqB,WACvB,SAASA,MAAMp2B,GACbC,KAAK4C,EAAI7C,EAYX,OAVAo2B,MAAMv5B,UAAU,qBAAuB,WACrC,MAAM,IAAIsJ,MAAM,kCAElBiwB,MAAMv5B,UAAU,uBAAyB,SAAUw5B,GACjD,OAAOA,GAETD,MAAMv5B,UAAU,qBAAuB,SAAUw5B,EAAKnV,GACpD,OAAOjhB,KAAK4C,EAAEwzB,EAAKnV,IAGdkV,MAdgB,GAiBV,SAASE,OAAOt2B,GAC7B,OAAO,IAAIo2B,EAAMp2B,GCOnB,IAKe,EALS8yB,SAAQ,SAASv2B,KAAKyD,EAAIu2B,GAChD,OAAO9C,OAAOzzB,EAAGtC,QAAQ,WACvB,OAAOsC,EAAGI,MAAMm2B,EAASp2B,iBCT7B,SAASq2B,gBAAgBjB,EAAIc,EAAKI,GAEhC,IADA,IAAIlZ,EAAOkZ,EAAK1gB,QACRwH,EAAK3d,MAAM,CAEjB,IADAy2B,EAAMd,EAAG,qBAAqBc,EAAK9Y,EAAKvhB,SAC7Bq6B,EAAI,wBAAyB,CACtCA,EAAMA,EAAI,sBACV,MAEF9Y,EAAOkZ,EAAK1gB,OAEd,OAAOwf,EAAG,uBAAuBc,GAGnC,SAASK,cAAcnB,EAAIc,EAAKn5B,EAAKy5B,GACnC,OAAOpB,EAAG,uBAAuBr4B,EAAIy5B,GAAY,EAAKpB,EAAG,qBAAsBA,GAAKc,IAGtF,IAAIO,EAAgC,oBAAX96B,OAAyBA,OAAOmH,SAAW,aAErD,SAAS4zB,QAAQ72B,EAAIq2B,EAAKxB,GAIvC,GAHkB,mBAAP70B,IACTA,EAAKs2B,OAAOt2B,IAEV,EAAa60B,GACf,OAtCJ,SAASiC,aAAavB,EAAIc,EAAKxB,GAG7B,IAFA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACRyzB,EAAMxrB,GAAK,CAEhB,IADA0wB,EAAMd,EAAG,qBAAqBc,EAAKxB,EAAK1D,MAC7BkF,EAAI,wBAAyB,CACtCA,EAAMA,EAAI,sBACV,MAEFlF,GAAO,EAET,OAAOoE,EAAG,uBAAuBc,GA2BxBS,CAAa92B,EAAIq2B,EAAKxB,GAE/B,GAA2C,mBAAhCA,EAAK,uBACd,OAAO6B,cAAc12B,EAAIq2B,EAAKxB,EAAM,uBAEtC,GAAyB,MAArBA,EAAK+B,GACP,OAAOJ,gBAAgBx2B,EAAIq2B,EAAKxB,EAAK+B,MAEvC,GAAyB,mBAAd/B,EAAK9e,KACd,OAAOygB,gBAAgBx2B,EAAIq2B,EAAKxB,GAElC,GAA2B,mBAAhBA,EAAKkC,OACd,OAAOL,cAAc12B,EAAIq2B,EAAKxB,EAAM,UAGtC,MAAM,IAAIv3B,UAAU,0CCtDtB,IAAI,EAAoB,WACtB,SAAS05B,KAAKn0B,EAAG0yB,GACft1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EAQX,OANAm0B,KAAKn6B,UAAU,qBAAuB+4B,EAAQ3lB,KAC9C+mB,KAAKn6B,UAAU,uBAAyB+4B,EAAQvoB,OAChD2pB,KAAKn6B,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GACtD,OAAO51B,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAK4C,EAAEgzB,KAG9CmB,KAXe,GAiBT,EAHUlE,SAAQ,SAASmE,MAAMp0B,EAAG0yB,GACjD,OAAO,IAAI,EAAK1yB,EAAG0yB,MClBN,SAAS2B,KAAKC,EAAMj6B,GACjC,OAAOzB,OAAOoB,UAAUC,eAAe5B,KAAKgC,EAAKi6B,GCCnD,IAAI,EAAW17B,OAAOoB,UAAUmJ,SASjB,qBARI,WACjB,MAAoC,uBAA7B,EAAS9K,KAAKiF,WAAsC,SAASi3B,aAAalW,GAC/E,MAA4B,uBAArB,EAAShmB,KAAKgmB,IACnB,SAASkW,aAAalW,GACxB,OAAOgW,KAAK,SAAUhW,KCFtBmW,GAA4B,CAAErxB,SAAU,MAAOwC,qBAAqB,YACpE8uB,EAAqB,CAAC,cAAe,UAAW,gBAAiB,WAAY,uBAAwB,iBAAkB,kBAEvHC,EAA8B,WAGhC,OAAOp3B,UAAUqI,qBAAqB,UAHN,GAM9BgvB,EAAW,SAASA,SAAS3C,EAAM4C,GAErC,IADA,IAAItG,EAAM,EACHA,EAAM0D,EAAKn3B,QAAQ,CACxB,GAAIm3B,EAAK1D,KAASsG,EAChB,OAAO,EAETtG,GAAO,EAET,OAAO,GAgDM,EADSwB,QA1BW,mBAAhBl3B,OAAO4M,MAAwBkvB,EAE9C,SAASlvB,KAAKnL,GAChB,GAAIzB,OAAOyB,KAASA,EAClB,MAAO,GAET,IAAIi6B,EAAMO,EACNC,EAAK,GACLC,EAAkBL,GAAkB,qBAAar6B,GACrD,IAAKi6B,KAAQj6B,GACPg6B,KAAKC,EAAMj6B,IAAU06B,GAA4B,WAATT,IAC1CQ,EAAGA,EAAGj6B,QAAUy5B,GAGpB,GAAIE,EAEF,IADAK,EAAOJ,EAAmB55B,OAAS,EAC5Bg6B,GAAQ,GAETR,KADJC,EAAOG,EAAmBI,GACXx6B,KAASs6B,EAASG,EAAIR,KACnCQ,EAAGA,EAAGj6B,QAAUy5B,GAElBO,GAAQ,EAGZ,OAAOC,GAxB0D,SAAStvB,KAAKnL,GAC/E,OAAOzB,OAAOyB,KAASA,EAAM,GAAKzB,OAAO4M,KAAKnL,KCcjC,EAfQ41B,QAAsBuC,cAAc,CAAC,mBAAoB,OAAQ,GAAO,SAAShwB,IAAIrF,EAAIg2B,GAC9G,OAAQv6B,OAAOoB,UAAUmJ,SAAS9K,KAAK86B,IACrC,IAAK,oBACH,OAAO,EAAOA,EAAQt4B,QAAQ,WAC5B,OAAOsC,EAAG9E,KAAK+E,KAAM+1B,EAAQ51B,MAAMH,KAAME,eAE7C,IAAK,kBACH,OAAO02B,SAAQ,SAAUR,EAAK/5B,GAE5B,OADA+5B,EAAI/5B,GAAO0D,EAAGg2B,EAAQ15B,IACf+5B,IACN,GAAI,EAAKL,IACd,QACE,OAAOD,KAAK/1B,EAAIg2B,QCvBP,EAZSlD,SAAQ,SAAS+E,KAAK5X,EAAO/iB,GAGnD,IAFA,IAAIoO,EAAMpO,EACNi0B,EAAM,EACHA,EAAMlR,EAAMviB,QAAQ,CACzB,GAAW,MAAP4N,EACF,OAEFA,EAAMA,EAAI2U,EAAMkR,IAChBA,GAAO,EAET,OAAO7lB,KCLM,EAHSwnB,SAAQ,SAASqE,KAAKp6B,EAAGG,GAC/C,OAAO,EAAK,CAACH,GAAIG,MCSJ,EAHU41B,SAAQ,SAASgF,MAAM/6B,EAAG83B,GACjD,OAAO,EAAI,EAAK93B,GAAI83B,MCoBP,EADWC,QAAQ+B,SCLnB,EAbYlE,SAAQ,SAASoF,QAAQC,GAClD,OAAO,EAAO,EAAO,EAAK,EAAG,EAAM,SAAUA,KAAS,WAGpD,IAFA,IAAI7G,EAAM,EACNxrB,EAAMqyB,EAAMt6B,OACTyzB,EAAMxrB,GAAK,CAChB,IAAKqyB,EAAM7G,GAAK/wB,MAAMH,KAAME,WAC1B,OAAO,EAETgxB,GAAO,EAET,OAAO,QCjBI,EAHQ2B,SAAQ,SAASmF,IAAIh2B,EAAGC,GAC7C,OAAOD,GAAKC,KClBV,EAAoB,WACtB,SAASg2B,KAAKr1B,EAAG0yB,GACft1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EACT5C,KAAKk4B,KAAM,EAiBb,OAfAD,KAAKr7B,UAAU,qBAAuB+4B,EAAQ3lB,KAC9CioB,KAAKr7B,UAAU,uBAAyB,SAAUwQ,GAIhD,OAHKpN,KAAKk4B,MACR9qB,EAASpN,KAAKs1B,GAAG,qBAAqBloB,GAAQ,IAEzCpN,KAAKs1B,GAAG,uBAAuBloB,IAExC6qB,KAAKr7B,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAKtD,OAJI51B,KAAK4C,EAAEgzB,KACT51B,KAAKk4B,KAAM,EACX9qB,EAASqoB,SAASz1B,KAAKs1B,GAAG,qBAAqBloB,GAAQ,KAElDA,GAGF6qB,KArBe,GA2BT,EAHUpF,SAAQ,SAASsF,MAAMv1B,EAAG0yB,GACjD,OAAO,IAAI,EAAK1yB,EAAG0yB,MCUN,EAVQzC,QAAsBuC,cAAc,CAAC,OAAQ,GAAO,SAAS8C,IAAIn4B,EAAI60B,GAE1F,IADA,IAAI1D,EAAM,EACHA,EAAM0D,EAAKn3B,QAAQ,CACxB,GAAIsC,EAAG60B,EAAK1D,IACV,OAAO,EAETA,GAAO,EAET,OAAO,MCQM,EAbYwB,SAAQ,SAAS0F,QAAQL,GAClD,OAAO,EAAO,EAAO,EAAK,EAAG,EAAM,SAAUA,KAAS,WAGpD,IAFA,IAAI7G,EAAM,EACNxrB,EAAMqyB,EAAMt6B,OACTyzB,EAAMxrB,GAAK,CAChB,GAAIqyB,EAAM7G,GAAK/wB,MAAMH,KAAME,WACzB,OAAO,EAETgxB,GAAO,EAET,OAAO,QCFI,EATO2B,SAAQ,SAASwF,GAAGC,EAAQC,GAChD,MAA4C,mBAA9BA,EAAO,mBAAoCA,EAAO,mBAAmBD,GAA+B,mBAAdA,EAAOD,GAAoBC,EAAOD,GAAGE,GAA4B,mBAAXD,EAAwB,SAAUrX,GAC1L,OAAOqX,EAAOrX,EAAPqX,CAAUC,EAAOtX,KAG1B2V,SAAQ,SAAUR,EAAKxzB,GACrB,OAAOuwB,QAAQiD,EAAK,EAAIxzB,EAAG21B,MAC1B,GAAID,MCtCM,SAASE,UAAUj8B,EAAGq4B,GAInC,IAHA,IAAI1D,EAAM,EACNuH,EAAQ7D,EAAKn3B,QAAUlB,EAAI,GAC3B65B,EAAM,IAAIlxB,MAAMuzB,GAAS,EAAIA,EAAQ,GAClCvH,EAAMuH,GACXrC,EAAIlF,GAAOhsB,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM1D,EAAKA,EAAM30B,GACvD20B,GAAO,EAET,OAAOkF,ECJT,IAAI,EAAyB,WAC3B,SAASsC,UAAUn8B,EAAG+4B,GACpBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK24B,IAAM,EACX34B,KAAK44B,MAAO,EACZ54B,KAAKo2B,IAAM,IAAIlxB,MAAM3I,GAuBvB,OArBAm8B,UAAU97B,UAAU,qBAAuB+4B,EAAQ3lB,KACnD0oB,UAAU97B,UAAU,uBAAyB,SAAUwQ,GAErD,OADApN,KAAKo2B,IAAM,KACJp2B,KAAKs1B,GAAG,uBAAuBloB,IAExCsrB,UAAU97B,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAE3D,OADA51B,KAAKjB,MAAM62B,GACJ51B,KAAK44B,KAAO54B,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAK64B,WAAazrB,GAE5EsrB,UAAU97B,UAAUmC,MAAQ,SAAU62B,GACpC51B,KAAKo2B,IAAIp2B,KAAK24B,KAAO/C,EACrB51B,KAAK24B,KAAO,EACR34B,KAAK24B,MAAQ34B,KAAKo2B,IAAI34B,SACxBuC,KAAK24B,IAAM,EACX34B,KAAK44B,MAAO,IAGhBF,UAAU97B,UAAUi8B,QAAU,WAC5B,OAAO1F,QAAQjuB,MAAMtI,UAAUgK,MAAM3L,KAAK+E,KAAKo2B,IAAKp2B,KAAK24B,KAAMzzB,MAAMtI,UAAUgK,MAAM3L,KAAK+E,KAAKo2B,IAAK,EAAGp2B,KAAK24B,OAGvGD,UA5BoB,GCuBd,EADa7F,QAAsBuC,cAAc,GDSlCvC,SAAQ,SAASiG,WAAWv8B,EAAG+4B,GAC3D,OAAO,IAAI,EAAU/4B,EAAG+4B,MCVsDkD,YCAjE,EAHW3F,SAAQ,SAASkG,OAAOC,EAAIpE,GACpD,OAAOzB,QAAQyB,EAAM,CAACoE,OCCT,EAHUnG,SAAQ,SAAS1yB,MAAMJ,EAAIE,GAClD,OAAOF,EAAGI,MAAMH,KAAMC,MCQT,EAXWyyB,SAAQ,SAASnc,OAAOtZ,GAKhD,IAJA,IAAIO,EAAQ,EAAKP,GACbyI,EAAMlI,EAAMC,OACZw7B,EAAO,GACP/H,EAAM,EACHA,EAAMxrB,GACXuzB,EAAK/H,GAAOj0B,EAAIO,EAAM0zB,IACtBA,GAAO,EAET,OAAO+H,KCgBM,EAXcvG,SAAQ,SAASwG,UAAUC,GAItD,OAHAA,EAAO,GAAI,SAAU3T,GACnB,MAAmB,mBAALA,EAAkBA,EAAI0T,UAAU1T,KAC7C2T,GACI,EAAO,EAAO,EAAK,EAAG,EAAM,SAAU,EAAOA,MAAS,WAC3D,IAAIl5B,EAAOC,UACX,OAAO,GAAI,SAAU0C,GACnB,OAAO,EAAMA,EAAG3C,KACfk5B,SClBQ,EAHYtG,SAAQ,SAASuG,QAAQnY,EAAGre,GACrD,OAAOA,EAAEqe,MCOI,EALW4T,SAAQ,SAASwE,OAAOt5B,EAAIiC,EAAGC,GACvD,IAAIq3B,EAAKv5B,EAAGiC,GACRu3B,EAAKx5B,EAAGkC,GACZ,OAAOq3B,EAAKC,GAAM,EAAID,EAAKC,EAAK,EAAI,KCGvB,GARU1E,SAAQ,SAAS2E,MAAMtC,EAAM7rB,EAAKpO,GACzD,IAAImQ,EAAS,GACb,IAAK,IAAItQ,KAAKG,EACZmQ,EAAOtQ,GAAKG,EAAIH,GAGlB,OADAsQ,EAAO8pB,GAAQ7rB,EACR+B,KCpBM,GAAA8lB,OAAA,kCACb,OAAO32B,GAAK,IAAMA,GCaL,GAHUm2B,SAAQ,SAAS+G,MAAMxY,GAC9C,OAAY,MAALA,KC4BM,GAjBc4T,SAAQ,SAAS6E,UAAU9B,EAAMvsB,EAAKpO,GACjE,GAAoB,IAAhB26B,EAAKn6B,OACP,OAAO4N,EAET,IAAI6lB,EAAM0G,EAAK,GACf,GAAIA,EAAKn6B,OAAS,EAAG,CACnB,IAAIk8B,GAAW,GAAM18B,IAAQg6B,KAAK/F,EAAKj0B,GAAOA,EAAIi0B,GAAO0I,GAAWhC,EAAK,IAAM,GAAK,GACpFvsB,EAAMquB,UAAUx0B,MAAMtI,UAAUgK,MAAM3L,KAAK28B,EAAM,GAAIvsB,EAAKsuB,GAE5D,GAAIC,GAAW1I,IAAQqE,EAASt4B,GAAM,CACpC,IAAIoH,EAAM,GAAGgB,OAAOpI,GAEpB,OADAoH,EAAI6sB,GAAO7lB,EACJhH,EAEP,OAAO,GAAM6sB,EAAK7lB,EAAKpO,MCqCZ,GAlDS41B,SAAQ,SAASgH,KAAKt9B,EAAGwD,GAC/C,OAAQxD,GACN,KAAK,EACH,OAAO,WACL,OAAOwD,EAAG9E,KAAK+E,OAEnB,KAAK,EACH,OAAO,SAAUyzB,GACf,OAAO1zB,EAAG9E,KAAK+E,KAAMyzB,IAEzB,KAAK,EACH,OAAO,SAAUA,EAAIC,GACnB,OAAO3zB,EAAG9E,KAAK+E,KAAMyzB,EAAIC,IAE7B,KAAK,EACH,OAAO,SAAUD,EAAIC,EAAIC,GACvB,OAAO5zB,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,IAEjC,KAAK,EACH,OAAO,SAAUF,EAAIC,EAAIC,EAAIC,GAC3B,OAAO7zB,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,IAErC,KAAK,EACH,OAAO,SAAUH,EAAIC,EAAIC,EAAIC,EAAIC,GAC/B,OAAO9zB,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,IAEzC,KAAK,EACH,OAAO,SAAUJ,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACnC,OAAO/zB,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAE7C,KAAK,EACH,OAAO,SAAUL,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACvC,OAAOh0B,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAEjD,KAAK,EACH,OAAO,SAAUN,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC3C,OAAOj0B,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAErD,KAAK,EACH,OAAO,SAAUP,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC/C,OAAOl0B,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAEzD,KAAK,GACH,OAAO,SAAUR,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACnD,OAAOn0B,EAAG9E,KAAK+E,KAAMyzB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAE7D,QACE,MAAM,IAAIhuB,MAAM,iFC7CP,GAHWwsB,SAAQ,SAASoH,OAAO/5B,GAChD,OAAO,GAAK,EAAGA,MChCF,SAASg6B,YAAY9Y,GAClC,MAA6C,sBAAtCzlB,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,GCsBxC,IAMe,GANU4R,SAAQ,SAASmH,MAAMC,EAAOl6B,GACrD,IAAIm6B,EAAS,EAAOD,EAAOl6B,GAC3B,OAAO,EAAOk6B,GAAO,WACnB,OAAOrD,QAAQ,EAAI,EAAIsD,EAAQh6B,UAAU,IAAKgF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,UCEzE,GAHSwyB,SAAQ,SAASyH,KAAKp6B,GAC5C,OAAO,GAAMA,EAAGtC,OAAQsC,MCYX,GALS8yB,SAAQ,SAASuH,KAAKx3B,EAAGsP,GAC/C,OAAO6nB,YAAYn3B,GAAK,SAASy3B,QAC/B,OAAOz3B,EAAEzC,MAAMH,KAAME,YAAcgS,EAAE/R,MAAMH,KAAME,YAC/C,GAAK,EAAL,CAAU0C,EAAGsP,MCWJ,GAHUwgB,SAAQ,SAAS4H,MAAMv6B,GAC9C,OAAO,EAAOA,EAAGtC,OAAQsC,MCRZ,GAHS,IAAM,SAAS9E,KAAK8E,GAC1C,OAAOA,EAAGI,MAAMH,KAAMkF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,OC3B/C,SAASq6B,UAAUC,GAChC,OAAO,SAASC,MAAM7F,GAMpB,IALA,IAAI74B,EAAO2+B,EAAM/zB,EACbyG,EAAS,GACT8jB,EAAM,EACNyJ,EAAO/F,EAAKn3B,OAETyzB,EAAMyJ,GAAM,CACjB,GAAI,EAAa/F,EAAK1D,IAIpB,IAFAvqB,EAAI,EACJ+zB,GAFA3+B,EAAQy+B,EAAYC,MAAM7F,EAAK1D,IAAQ0D,EAAK1D,IAE/BzzB,OACNkJ,EAAI+zB,GACTttB,EAAOA,EAAO3P,QAAU1B,EAAM4K,GAC9BA,GAAK,OAGPyG,EAAOA,EAAO3P,QAAUm3B,EAAK1D,GAE/BA,GAAO,EAET,OAAO9jB,GCxBX,IA0Be,GAbA,SAASwtB,MAAMtF,GAC5B,IAAIuF,EAdkB,SAAUvF,GAChC,MAAO,CACL,oBAAqBK,EAAQ3lB,KAC7B,sBAAuB,SAAU5C,GAC/B,OAAOkoB,EAAG,uBAAuBloB,IAEnC,oBAAqB,SAAUA,EAAQwoB,GACrC,IAAIkF,EAAMxF,EAAG,qBAAqBloB,EAAQwoB,GAC1C,OAAOkF,EAAI,wBCbF,SAASC,cAAc9Z,GACpC,MAAO,CACL,qBAAsBA,EACtB,wBAAwB,GDUe8Z,CAAcD,GAAOA,IAMpDE,CAAkB1F,GAC5B,MAAO,CACL,oBAAqBK,EAAQ3lB,KAC7B,sBAAuB,SAAU5C,GAC/B,OAAOytB,EAAI,uBAAuBztB,IAEpC,oBAAqB,SAAUA,EAAQwoB,GACrC,OAAQ,EAAaA,GAAyCgB,QAAQiE,EAAKztB,EAAQwoB,GAArDgB,QAAQiE,EAAKztB,EAAQ,CAACwoB,OEU3C,GARU/C,QAAsBuC,cAAc,CAAC,qBAAsB,SCxBzDvC,SAAQ,SAASoI,QAAQr4B,EAAG0yB,GACrD,OAAO,EAAI1yB,EAAG,GAAS0yB,QDuB8E,SAAS4F,MAAMn7B,EAAIo7B,GACxH,MAAqB,mBAAVA,EACF,SAAUla,GACf,OAAOlhB,EAAGo7B,EAAMla,GAATlhB,CAAakhB,IAGjBsZ,WAAU,EAAVA,CAAiB,EAAIx6B,EAAIo7B,QENnB,GANUtG,SAAQ,SAASuG,MAAMtmB,EAAKwM,EAAKvlB,GACxD,GAAI+Y,EAAMwM,EACR,MAAM,IAAIpb,MAAM,8DAElB,OAAOnK,EAAQ+Y,EAAMA,EAAM/Y,EAAQulB,EAAMA,EAAMvlB,KC1BlC,SAASs/B,aAAaC,GACH,OAAO,IAAI/0B,OAAO+0B,EAAQv6B,QAASu6B,EAAQ76B,OAAS,IAAM,KAAO66B,EAAQlM,WAAa,IAAM,KAAOkM,EAAQpM,UAAY,IAAM,KAAOoM,EAAQC,OAAS,IAAM,KAAOD,EAAQE,QAAU,IAAM,KC0B5N,IAGe,GAHS9I,SAAQ,SAAS5xB,KAAKuK,GAC5C,OAAe,OAARA,EAAe,YAAiBhL,IAARgL,EAAoB,YAAc7P,OAAOoB,UAAUmJ,SAAS9K,KAAKoQ,GAAKzE,MAAM,GAAI,MCflG,SAAS60B,OAAO1/B,EAAO2/B,EAASC,EAAOC,GACpD,IAAItV,EAAO,SAASA,KAAKuV,GAGvB,IAFA,IAAIn2B,EAAMg2B,EAAQj+B,OACdyzB,EAAM,EACHA,EAAMxrB,GAAK,CAChB,GAAI3J,IAAU2/B,EAAQxK,GACpB,OAAOyK,EAAMzK,GAEfA,GAAO,EAIT,IAAK,IAAI70B,KAFTq/B,EAAQxK,EAAM,GAAKn1B,EACnB4/B,EAAMzK,EAAM,GAAK2K,EACD9/B,EACd8/B,EAAYx/B,GAAOu/B,EAAOH,OAAO1/B,EAAMM,GAAMq/B,EAASC,GAAO,GAAQ5/B,EAAMM,GAE7E,OAAOw/B,GAET,OAAQ,GAAK9/B,IACX,IAAK,SACH,OAAOuqB,EAAK,IACd,IAAK,QACH,OAAOA,EAAK,IACd,IAAK,OACH,OAAO,IAAIvX,KAAKhT,EAAMuP,WACxB,IAAK,SACH,OAAO+vB,aAAat/B,GACtB,QACE,OAAOA,GChBb,IAGe,GAHU22B,SAAQ,SAAS9Q,MAAM7lB,GAC9C,OAAgB,MAATA,GAAwC,mBAAhBA,EAAM6lB,MAAuB7lB,EAAM6lB,QAAU6Z,OAAO1/B,EAAO,GAAI,IAAI,MCErF,GALe22B,SAAQ,SAASoJ,WAAWC,GACxD,OAAO,SAAU/5B,EAAGC,GAClB,OAAO85B,EAAK/5B,EAAGC,IAAM,EAAI85B,EAAK95B,EAAGD,GAAK,EAAI,MCA/B,GAHQ0wB,SAAQ,SAASsJ,IAAIh6B,GAC1C,OAAQA,KCIK,GADe,GAAK,ICzBpB,SAASi6B,MAAMr5B,EAAGsP,GAC/B,OAAO,WACL,OAAOA,EAAEjX,KAAK+E,KAAM4C,EAAEzC,MAAMH,KAAME,aCUvB,SAASg8B,gBAAgBC,EAAYp8B,GAClD,OAAO,WACL,IAAItC,EAASyC,UAAUzC,OACvB,GAAe,IAAXA,EACF,OAAOsC,IAET,IAAI9C,EAAMiD,UAAUzC,EAAS,GAC7B,OAAO83B,EAASt4B,IAAmC,mBAApBA,EAAIk/B,GAA6Bp8B,EAAGI,MAAMH,KAAME,WAAajD,EAAIk/B,GAAYh8B,MAAMlD,EAAKiI,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,EAAGzC,EAAS,KCQ7K,IAGe,GAHUo3B,QAAsBqH,gBAAgB,SAAS,SAASt1B,MAAMw1B,EAAWC,EAASzH,GACzG,OAAO1vB,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAMwH,EAAWC,OCItC,GADS3J,QAAsBwJ,gBAAgB,OAAqB,GAAM,EAAGI,OCH7E,SAASC,OACtB,GAAyB,IAArBr8B,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,uCAElB,OAAOstB,OAAOtzB,UAAU,GAAGzC,OAAQ,EAAOw+B,MAAO/7B,UAAU,GAAI,GAAKA,aCLtE,IAGe,GAHYwyB,SAAQ,SAAS9L,QAAQgO,GAClD,OAAOoB,UAAUpB,GAAQA,EAAKtuB,MAAM,IAAIsgB,UAAU5f,KAAK,IAAM9B,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAAGhO,aCDpF,SAAS4V,UACtB,GAAyB,IAArBt8B,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,0CAElB,OAAOq2B,KAAKp8B,MAAMH,KAAM,GAAQE,YCGnB,SAASu8B,WACtB,GAAyB,IAArBv8B,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,2CAElB,IAAI8J,EAAO9K,MAAMtI,UAAUgK,MAAM3L,KAAKiF,WAClCw8B,EAAO1sB,EAAKyU,MAChB,OAAO+X,QAAQA,QAAQr8B,MAAMH,KAAM,EAAI,GAAOgQ,IAAQ0sB,GCxCzC,SAASC,OAAO/5B,EAAGsP,GAChC,OAAO,WACL,IAAIxR,EAAMV,KACV,OAAO4C,EAAEzC,MAAMO,EAAKR,WAAWL,MAAK,SAAUohB,GAC5C,OAAO/O,EAAEjX,KAAKyF,EAAKugB,OCmBV,SAAS2b,QACtB,GAAyB,IAArB18B,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,wCAElB,OAAOstB,OAAOtzB,UAAU,GAAGzC,OAAQ,EAAOk/B,OAAQz8B,UAAU,GAAI,GAAKA,aCUxD,SAAS28B,WACtB,GAAyB,IAArB38B,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,2CAElB,OAAO02B,MAAMz8B,MAAMH,KAAM,GAAQE,YCzCpB,SAAS48B,mBAAmBtG,GAGzC,IAFA,IACI1gB,EADA8e,EAAO,KAEF9e,EAAO0gB,EAAK1gB,QAAQnW,MAC3Bi1B,EAAK7tB,KAAK+O,EAAK/Z,OAEjB,OAAO64B,ECNM,SAASmI,cAAchB,EAAM9a,EAAG2T,GAI7C,IAHA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OAERyzB,EAAMxrB,GAAK,CAChB,GAAIq2B,EAAK9a,EAAG2T,EAAK1D,IACf,OAAO,EAETA,GAAO,EAET,OAAO,ECeT,IAWe,GAXc2B,SAAQ,SAASmK,UAAUh7B,EAAGC,GAEzD,OAAID,IAAMC,EAGK,IAAND,GAAW,EAAIA,GAAM,EAAIC,EAGzBD,GAAMA,GAAKC,GAAMA,KCd5B,SAASg7B,mBAAmBC,EAAWC,EAAWC,EAAQC,GACxD,IAAIr7B,EAAI86B,mBAAmBI,GAG3B,SAASvyB,GAAGqoB,EAAID,GACd,OAAOuK,QAAQtK,EAAID,EAAIqK,EAAOx2B,QAASy2B,EAAOz2B,SAIhD,OAAQm2B,eAAc,SAAU96B,EAAGs7B,GACjC,OAAQR,cAAcpyB,GAAI4yB,EAAOt7B,KAR3B66B,mBAAmBK,GASrBn7B,GAGO,SAASs7B,QAAQt7B,EAAGC,EAAGm7B,EAAQC,GAC5C,GAAI,GAAUr7B,EAAGC,GACf,OAAO,EAGT,IAAIu7B,EAAQ,GAAKx7B,GAEjB,GAAIw7B,IAAU,GAAKv7B,GACjB,OAAO,EAGT,GAAS,MAALD,GAAkB,MAALC,EACf,OAAO,EAGT,GAAwC,mBAA7BD,EAAE,wBAA6E,mBAA7BC,EAAE,uBAC7D,MAA2C,mBAA7BD,EAAE,wBAAyCA,EAAE,uBAAuBC,IAA0C,mBAA7BA,EAAE,wBAAyCA,EAAE,uBAAuBD,GAGrK,GAAwB,mBAAbA,EAAEy7B,QAA6C,mBAAbx7B,EAAEw7B,OAC7C,MAA2B,mBAAbz7B,EAAEy7B,QAAyBz7B,EAAEy7B,OAAOx7B,IAA0B,mBAAbA,EAAEw7B,QAAyBx7B,EAAEw7B,OAAOz7B,GAGrG,OAAQw7B,GACN,IAAK,YACL,IAAK,QACL,IAAK,SACH,GAA6B,mBAAlBx7B,EAAEtD,aAA+D,YC5DnE,SAASg/B,cAAc96B,GAEpC,IAAIqrB,EAAQpiB,OAAOjJ,GAAGqrB,MAAM,mBAC5B,OAAgB,MAATA,EAAgB,GAAKA,EAAM,GDyDayP,CAAc17B,EAAEtD,aACzD,OAAOsD,IAAMC,EAEf,MACF,IAAK,UACL,IAAK,SACL,IAAK,SACH,UAAaD,UAAaC,IAAK,GAAUD,EAAEsJ,UAAWrJ,EAAEqJ,WACtD,OAAO,EAET,MACF,IAAK,OACH,IAAK,GAAUtJ,EAAEsJ,UAAWrJ,EAAEqJ,WAC5B,OAAO,EAET,MACF,IAAK,QACH,OAAOtJ,EAAE3G,OAAS4G,EAAE5G,MAAQ2G,EAAEoN,UAAYnN,EAAEmN,QAC9C,IAAK,SACH,GAAMpN,EAAEjB,SAAWkB,EAAElB,QAAUiB,EAAEvB,SAAWwB,EAAExB,QAAUuB,EAAEotB,aAAentB,EAAEmtB,YAAcptB,EAAEktB,YAAcjtB,EAAEitB,WAAaltB,EAAEu5B,SAAWt5B,EAAEs5B,QAAUv5B,EAAEw5B,UAAYv5B,EAAEu5B,QAC/J,OAAO,EAMb,IADA,IAAItK,EAAMkM,EAAO3/B,OAAS,EACnByzB,GAAO,GAAG,CACf,GAAIkM,EAAOlM,KAASlvB,EAClB,OAAOq7B,EAAOnM,KAASjvB,EAEzBivB,GAAO,EAGT,OAAQsM,GACN,IAAK,MACH,OAAIx7B,EAAE4D,OAAS3D,EAAE2D,MAIVq3B,mBAAmBj7B,EAAEwU,UAAWvU,EAAEuU,UAAW4mB,EAAO/3B,OAAO,CAACrD,IAAKq7B,EAAOh4B,OAAO,CAACpD,KACzF,IAAK,MACH,OAAID,EAAE4D,OAAS3D,EAAE2D,MAIVq3B,mBAAmBj7B,EAAEuU,SAAUtU,EAAEsU,SAAU6mB,EAAO/3B,OAAO,CAACrD,IAAKq7B,EAAOh4B,OAAO,CAACpD,KACvF,IAAK,YACL,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,SACL,IAAK,YACL,IAAK,aACL,IAAK,oBACL,IAAK,aACL,IAAK,cACL,IAAK,aACL,IAAK,cACL,IAAK,eACL,IAAK,eACL,IAAK,cACH,MACF,QAEE,OAAO,EAGX,IAAI07B,EAAQ,EAAK37B,GACjB,GAAI27B,EAAMlgC,SAAW,EAAKwE,GAAGxE,OAC3B,OAAO,EAGT,IAAImgC,EAAiBR,EAAO/3B,OAAO,CAACrD,IAChC67B,EAAiBR,EAAOh4B,OAAO,CAACpD,IAGpC,IADAivB,EAAMyM,EAAMlgC,OAAS,EACdyzB,GAAO,GAAG,CACf,IAAI70B,EAAMshC,EAAMzM,GAChB,IAAM+F,KAAK56B,EAAK4F,KAAMq7B,QAAQr7B,EAAE5F,GAAM2F,EAAE3F,GAAMuhC,EAAgBC,GAC5D,OAAO,EAET3M,GAAO,EAET,OAAO,EEvHT,IAGe,GAHW2B,SAAQ,SAAS4K,OAAOz7B,EAAGC,GACnD,OAAOq7B,QAAQt7B,EAAGC,EAAG,GAAI,OC3BZ,SAAS67B,SAASlJ,EAAM5yB,EAAGkvB,GACxC,IAAI6M,EAAKvG,EAET,GAA4B,mBAAjB5C,EAAKzb,QACd,cAAenX,GACb,IAAK,SACH,GAAU,IAANA,EAAS,CAGX,IADA+7B,EAAM,EAAI/7B,EACHkvB,EAAM0D,EAAKn3B,QAAQ,CAExB,GAAa,KADb+5B,EAAO5C,EAAK1D,KACM,EAAIsG,IAASuG,EAC7B,OAAO7M,EAETA,GAAO,EAET,OAAQ,EACH,GAAIlvB,GAAMA,EAAG,CAElB,KAAOkvB,EAAM0D,EAAKn3B,QAAQ,CAExB,GAAoB,iBADpB+5B,EAAO5C,EAAK1D,KACoBsG,GAASA,EACvC,OAAOtG,EAETA,GAAO,EAET,OAAQ,EAGV,OAAO0D,EAAKzb,QAAQnX,EAAGkvB,GAGzB,IAAK,SACL,IAAK,UACL,IAAK,WACL,IAAK,YACH,OAAO0D,EAAKzb,QAAQnX,EAAGkvB,GAEzB,IAAK,SACH,GAAU,OAANlvB,EAEF,OAAO4yB,EAAKzb,QAAQnX,EAAGkvB,GAK/B,KAAOA,EAAM0D,EAAKn3B,QAAQ,CACxB,GAAI,GAAOm3B,EAAK1D,GAAMlvB,GACpB,OAAOkvB,EAETA,GAAO,EAET,OAAQ,ECpDK,SAAS8M,UAAUh8B,EAAG4yB,GACnC,OAAOkJ,SAASlJ,EAAM5yB,EAAG,IAAM,ECHlB,SAASi8B,OAAOlhC,GAI7B,MAAO,IAHOA,EAAE6mB,QAAQ,MAAO,QAAQA,QAAQ,QAAS,OACvDA,QAAQ,MAAO,OAAOA,QAAQ,MAAO,OAAOA,QAAQ,MAAO,OAAOA,QAAQ,MAAO,OAAOA,QAAQ,MAAO,OAAOA,QAAQ,MAAO,OAEzGA,QAAQ,KAAM,OAAS,ICD9C,IAAIsa,GAAM,SAASA,IAAI3hC,GACrB,OAAQA,EAAI,GAAK,IAAM,IAAMA,GAShB,GAN0C,mBAA/BwS,KAAKnS,UAAUuhC,YAA6B,SAASC,aAAahjC,GAC1F,OAAOA,EAAE+iC,eACP,SAASC,aAAahjC,GACxB,OAAOA,EAAEijC,iBAAmB,IAAMH,GAAI9iC,EAAEkjC,cAAgB,GAAK,IAAMJ,GAAI9iC,EAAEmjC,cAAgB,IAAML,GAAI9iC,EAAEojC,eAAiB,IAAMN,GAAI9iC,EAAEqjC,iBAAmB,IAAMP,GAAI9iC,EAAEsjC,iBAAmB,KAAOtjC,EAAEujC,qBAAuB,KAAMjT,QAAQ,GAAG9kB,MAAM,EAAG,GAAK,KCVtO,SAASg4B,YAAYh8B,GAClC,OAAO,WACL,OAAQA,EAAEzC,MAAMH,KAAME,YCFX,SAAS2+B,QAAQ9+B,EAAI60B,GAKlC,IAJA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACX2P,EAAS,GAEN8jB,EAAMxrB,GACP3F,EAAG60B,EAAK1D,MACV9jB,EAAOA,EAAO3P,QAAUm3B,EAAK1D,IAE/BA,GAAO,EAET,OAAO9jB,ECXM,SAAS0xB,UAAU7d,GAChC,MAA6C,oBAAtCzlB,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,GCExC,IAAI,GAAuB,WACzB,SAAS8d,QAAQn8B,EAAG0yB,GAClBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EAQX,OANAm8B,QAAQniC,UAAU,qBAAuB+4B,EAAQ3lB,KACjD+uB,QAAQniC,UAAU,uBAAyB+4B,EAAQvoB,OACnD2xB,QAAQniC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GACzD,OAAO51B,KAAK4C,EAAEgzB,GAAS51B,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,GAASxoB,GAGhE2xB,QAXkB,GC0CZ,GAVWlM,QAAsBuC,cAAc,CAAC,UDlBnCvC,SAAQ,SAASmM,SAASp8B,EAAG0yB,GACvD,OAAO,IAAI,GAAQ1yB,EAAG0yB,OCiB4D,SAAUyG,EAAMkD,GAClG,OAAOH,UAAUG,GAAcrI,SAAQ,SAAUR,EAAK/5B,GAIpD,OAHI0/B,EAAKkD,EAAW5iC,MAClB+5B,EAAI/5B,GAAO4iC,EAAW5iC,IAEjB+5B,IACN,GAAI,EAAK6I,IAEZJ,QAAQ9C,EAAMkD,OCZD,GAHWpM,SAAQ,SAASxzB,OAAO08B,EAAMkD,GACtD,OAAO,GAAOL,YAAY7C,GAAOkD,MCUnC,IAGe,GAHavM,SAAQ,SAAS3sB,SAASsF,GACpD,OCjCa,SAAS6zB,UAAUje,EAAGke,GACnC,IAAIC,EAAQ,SAASA,MAAMle,GACzB,IAAIme,EAAKF,EAAK95B,OAAO,CAAC4b,IACtB,OAAO+c,UAAU9c,EAAGme,GAAM,aAAeH,UAAUhe,EAAGme,IAIpDC,SAAW,SAAUriC,EAAKmL,GAC5B,OAAO0tB,MAAK,SAAU7wB,GACpB,OAAOg5B,OAAOh5B,GAAK,KAAOm6B,EAAMniC,EAAIgI,MACnCmD,EAAKxB,QAAQspB,SAGlB,OAAQ10B,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,IACrC,IAAK,qBACH,MAAO,qCAAuC6U,KAAKsJ,EAAOne,GAAGja,KAAK,MAAQ,KAC5E,IAAK,iBACH,MAAO,IAAM8uB,KAAKsJ,EAAOne,GAAG5b,OAAOi6B,SAASre,EAAG,IAAO,SAAUhc,GAC9D,MAAQ,QAAQyN,KAAKzN,KAEpB,EAAKgc,MAAMja,KAAK,MAAQ,IAC7B,IAAK,mBACH,MAAoB,iBAANia,EAAiB,eAAiBme,EAAMne,EAAE3V,WAAa,IAAM2V,EAAElb,WAC/E,IAAK,gBACH,MAAO,aAAeyF,MAAMyV,EAAE3V,WAAa8zB,EAAM3W,KAAOwV,OAAO,GAAahd,KAAO,IACrF,IAAK,gBACH,MAAO,OACT,IAAK,kBACH,MAAoB,iBAANA,EAAiB,cAAgBme,EAAMne,EAAE3V,WAAa,IAAM,EAAI2V,IAAOqb,IAAW,KAAOrb,EAAElb,SAAS,IACpH,IAAK,kBACH,MAAoB,iBAANkb,EAAiB,cAAgBme,EAAMne,EAAE3V,WAAa,IAAM2yB,OAAOhd,GACnF,IAAK,qBACH,MAAO,YACT,QACE,GAA0B,mBAAfA,EAAElb,SAAyB,CACpC,IAAIw5B,EAAOte,EAAElb,WACb,GAAa,oBAATw5B,EACF,OAAOA,EAGX,MAAO,IAAMD,SAASre,EAAG,EAAKA,IAAIja,KAAK,MAAQ,KDP5Ck4B,CAAU7zB,EAAK,OEeT,GArBWwnB,SAAQ,SAASxtB,OAAOrD,EAAGC,GACnD,GAAIszB,EAASvzB,GAAI,CACf,GAAIuzB,EAAStzB,GACX,OAAOD,EAAEqD,OAAOpD,GAElB,MAAM,IAAI5E,UAAU,GAAS4E,GAAK,oBAEpC,GAAI+zB,UAAUh0B,GAAI,CAChB,GAAIg0B,UAAU/zB,GACZ,OAAOD,EAAIC,EAEb,MAAM,IAAI5E,UAAU,GAAS4E,GAAK,oBAEpC,GAAS,MAALD,GAAa+3B,YAAY/3B,EAAE,wBAC7B,OAAOA,EAAE,uBAAuBC,GAElC,GAAS,MAALD,GAAa+3B,YAAY/3B,EAAEqD,QAC7B,OAAOrD,EAAEqD,OAAOpD,GAElB,MAAM,IAAI5E,UAAU,GAAS2E,GAAK,sECPrB,GAdS0wB,SAAQ,SAAS8M,KAAKC,GAI5C,OAAOjM,OAHK,EAAO,EAAK,EAAG,GAAI,SAAUkM,GACvC,OAAOA,EAAK,GAAGjiC,SACdgiC,KACkB,WAEnB,IADA,IAAIvO,EAAM,EACHA,EAAMuO,EAAMhiC,QAAQ,CACzB,GAAIgiC,EAAMvO,GAAK,GAAG/wB,MAAMH,KAAME,WAC5B,OAAOu/B,EAAMvO,GAAK,GAAG/wB,MAAMH,KAAME,WAEnCgxB,GAAO,SC+BE,GAlCe2B,SAAQ,SAAS8M,WAAWpjC,EAAGqjC,GAC3D,GAAIrjC,EAAI,GACN,MAAM,IAAI2J,MAAM,+CAElB,OAAU,IAAN3J,EACK,WACL,OAAO,IAAIqjC,GAGR,GAAM,GAAKrjC,GAAG,SAAUsjC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,OAAQpgC,UAAUzC,QAChB,KAAK,EACH,OAAO,IAAImiC,EAAGC,GAChB,KAAK,EACH,OAAO,IAAID,EAAGC,EAAIC,GACpB,KAAK,EACH,OAAO,IAAIF,EAAGC,EAAIC,EAAIC,GACxB,KAAK,EACH,OAAO,IAAIH,EAAGC,EAAIC,EAAIC,EAAIC,GAC5B,KAAK,EACH,OAAO,IAAIJ,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,GAChC,KAAK,EACH,OAAO,IAAIL,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACpC,KAAK,EACH,OAAO,IAAIN,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACxC,KAAK,EACH,OAAO,IAAIP,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC5C,KAAK,EACH,OAAO,IAAIR,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAChD,KAAK,GACH,OAAO,IAAIT,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,WC/B3C,GAHc5N,SAAQ,SAAS9jB,UAAUgxB,GACtD,OAAO,GAAWA,EAAGniC,OAAQmiC,MCZhB,GADa/M,QAAQmL,WCoBrB,GATanL,SAAQ,SAAS0N,SAASC,EAAOC,GAC3D,OAAO,EAAO,EAAO,EAAK,EAAG,EAAM,SAAUA,KAAO,WAClD,IAAIxgC,EAAOC,UACPwgC,EAAU1gC,KACd,OAAOwgC,EAAMrgC,MAAMugC,EAAS5K,MAAK,SAAU/1B,GACzC,OAAOA,EAAGI,MAAMugC,EAASzgC,KACxBwgC,UCpCH,GAAyB,WAC3B,SAASE,UAAUC,EAASC,EAAUC,EAAOxL,GAC3Ct1B,KAAK4gC,QAAUA,EACf5gC,KAAK6gC,SAAWA,EAChB7gC,KAAK8gC,MAAQA,EACb9gC,KAAKs1B,GAAKA,EACVt1B,KAAK+gC,OAAS,GAwBhB,OAtBAJ,UAAU/jC,UAAU,qBAAuB+4B,EAAQ3lB,KACnD2wB,UAAU/jC,UAAU,uBAAyB,SAAUwQ,GACrD,IAAI/Q,EACJ,IAAKA,KAAO2D,KAAK+gC,OACf,GAAI9J,KAAK56B,EAAK2D,KAAK+gC,UACjB3zB,EAASpN,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAK+gC,OAAO1kC,KAC/C,wBAAyB,CAClC+Q,EAASA,EAAO,sBAChB,MAKN,OADApN,KAAK+gC,OAAS,KACP/gC,KAAKs1B,GAAG,uBAAuBloB,IAExCuzB,UAAU/jC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAC3D,IAAIv5B,EAAM2D,KAAK8gC,MAAMlL,GAGrB,OAFA51B,KAAK+gC,OAAO1kC,GAAO2D,KAAK+gC,OAAO1kC,IAAQ,CAACA,EAAK2D,KAAK6gC,UAClD7gC,KAAK+gC,OAAO1kC,GAAK,GAAK2D,KAAK4gC,QAAQ5gC,KAAK+gC,OAAO1kC,GAAK,GAAIu5B,GACjDxoB,GAGFuzB,UA9BoB,GCqDd,GAPaxM,QAAQ,EAAG,GAAiBiB,cAAc,GDbxCjB,QAAQ,EAAG,IAAI,SAAS6M,WAAWJ,EAASC,EAAUC,EAAOxL,GACzF,OAAO,IAAI,GAAUsL,EAASC,EAAUC,EAAOxL,OCYqC,SAAS2L,SAASL,EAASC,EAAUC,EAAOlM,GAChI,OAAOgC,SAAQ,SAAUR,EAAK8K,GAC5B,IAAI7kC,EAAMykC,EAAMI,GAEhB,OADA9K,EAAI/5B,GAAOukC,EAAQ3J,KAAK56B,EAAK+5B,GAAOA,EAAI/5B,GAAOwkC,EAAUK,GAClD9K,IACN,GAAIxB,OC1BM,GAHY,IAAS,SAAUwB,EAAK+K,GACjD,OAAO/K,EAAM,IACZ,GCVY,GADQ,GAAK,GCUb,GAHcvD,SAAQ,SAASuO,UAAUhmC,EAAGoqB,GACzD,OAAY,MAALA,GAAaA,GAAMA,EAAIpqB,EAAIoqB,KCIrB,GALYqP,SAAQ,SAASwM,QAAQthC,EAAIiC,EAAGC,GACzD,IAAIq3B,EAAKv5B,EAAGiC,GACRu3B,EAAKx5B,EAAGkC,GACZ,OAAOq3B,EAAKC,GAAM,EAAID,EAAKC,EAAK,EAAI,KCQvB,GAZe1G,SAAQ,SAASyO,WAAWC,EAAOC,GAI/D,IAHA,IAAIvgC,EAAM,GACNiwB,EAAM,EACNuQ,EAAWF,EAAM9jC,OACdyzB,EAAMuQ,GACNzD,UAAUuD,EAAMrQ,GAAMsQ,IAAYxD,UAAUuD,EAAMrQ,GAAMjwB,KAC3DA,EAAIA,EAAIxD,QAAU8jC,EAAMrQ,IAE1BA,GAAO,EAET,OAAOjwB,KCIM,GAZmB4zB,SAAQ,SAAS6M,eAAe3F,EAAMwF,EAAOC,GAI7E,IAHA,IAAIvgC,EAAM,GACNiwB,EAAM,EACNuQ,EAAWF,EAAM9jC,OACdyzB,EAAMuQ,GACN1E,cAAchB,EAAMwF,EAAMrQ,GAAMsQ,IAAYzE,cAAchB,EAAMwF,EAAMrQ,GAAMjwB,IAC/EA,EAAI8F,KAAKw6B,EAAMrQ,IAEjBA,GAAO,EAET,OAAOjwB,KCTM,GARW4xB,SAAQ,SAAS8O,OAAOzK,EAAMj6B,GACtD,IAAImQ,EAAS,GACb,IAAK,IAAItQ,KAAKG,EACZmQ,EAAOtQ,GAAKG,EAAIH,GAGlB,cADOsQ,EAAO8pB,GACP9pB,KCEM,GALWynB,SAAQ,SAAS+M,OAAOC,EAAOC,EAAOlN,GAC9D,IAAIxnB,EAASlI,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAE9C,OADAxnB,EAAOmZ,OAAOsb,EAAOC,GACd10B,KCKM,GAHWynB,SAAQ,SAASkN,OAAO7Q,EAAKjQ,EAAG2T,GACxD,OAAO,EAAO,EAAO3T,GAAIiQ,EAAK0D,MCiBjB,GAlBe/B,SAAQ,SAASmP,WAAWpK,EAAM36B,GAC9D,OAAQ26B,EAAKn6B,QACX,KAAK,EACH,OAAOR,EACT,KAAK,EACH,OAAO28B,GAAWhC,EAAK,IAAM,GAAOA,EAAK,GAAI,EAAG36B,GAAO,GAAO26B,EAAK,GAAI36B,GACzE,QACE,IAAIglC,EAAOrK,EAAK,GACZsK,EAAOh9B,MAAMtI,UAAUgK,MAAM3L,KAAK28B,EAAM,GAC5C,OAAiB,MAAb36B,EAAIglC,GACChlC,EACE28B,GAAWhC,EAAK,IAClB,GAAOqK,EAAMD,WAAWE,EAAMjlC,EAAIglC,IAAQhlC,GAE1C,GAAMglC,EAAMD,WAAWE,EAAMjlC,EAAIglC,IAAQhlC,OCbzC,GAHW41B,SAAQ,SAASsP,OAAOngC,EAAGC,GACnD,OAAOD,EAAIC,KCtBT,GAAqB,WACvB,SAASmgC,MAAM7lC,EAAG+4B,GAChBt1B,KAAKs1B,GAAKA,EACVt1B,KAAKzD,EAAIA,EAYX,OAVA6lC,MAAMxlC,UAAU,qBAAuB+4B,EAAQ3lB,KAC/CoyB,MAAMxlC,UAAU,uBAAyB+4B,EAAQvoB,OACjDg1B,MAAMxlC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GACvD,OAAI51B,KAAKzD,EAAI,GACXyD,KAAKzD,GAAK,EACH6Q,GAEFpN,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,IAGvCwM,MAfgB,GC6BV,GAHSvP,QAAsBuC,cAAc,CAAC,QDRnCvC,SAAQ,SAASwP,OAAO9lC,EAAG+4B,GACnD,OAAO,IAAI,GAAM/4B,EAAG+4B,OCOwD,SAASgN,KAAK/lC,EAAG8iC,GAC7F,OAAO,GAAM/8B,KAAKgf,IAAI,EAAG/kB,GAAI+/B,IAAU+C,OC1BrC,GAAqB,WACvB,SAASkD,MAAMhmC,EAAG+4B,GAChBt1B,KAAKs1B,GAAKA,EACVt1B,KAAKzD,EAAIA,EACTyD,KAAKlF,EAAI,EAUX,OARAynC,MAAM3lC,UAAU,qBAAuB+4B,EAAQ3lB,KAC/CuyB,MAAM3lC,UAAU,uBAAyB+4B,EAAQvoB,OACjDm1B,MAAM3lC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GACvD51B,KAAKlF,GAAK,EACV,IAAIggC,EAAiB,IAAX96B,KAAKzD,EAAU6Q,EAASpN,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,GACvE,OAAO51B,KAAKzD,GAAK,GAAKyD,KAAKlF,GAAKkF,KAAKzD,EAAIk5B,SAASqF,GAAOA,GAGpDyH,MAdgB,GC+CV,GAHS1P,QAAsBuC,cAAc,CAAC,QD3BnCvC,SAAQ,SAAS2P,OAAOjmC,EAAG+4B,GACnD,OAAO,IAAI,GAAM/4B,EAAG+4B,OC0BwD,SAASmN,KAAKlmC,EAAG8iC,GAC7F,OAAO,GAAM,EAAG9iC,EAAI,EAAI+/B,IAAW//B,EAAG8iC,OC/CzB,SAASqD,SAASnmC,EAAG8iC,GAClC,OAAO,GAAK9iC,EAAI8iC,EAAG5hC,OAAS4hC,EAAG5hC,OAASlB,EAAI,EAAG8iC,GCAjD,IAAI,GAAyB,WAC3B,SAASsD,UAAUpmC,EAAG+4B,GACpBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK24B,IAAM,EACX34B,KAAK44B,MAAO,EACZ54B,KAAKo2B,IAAM,IAAIlxB,MAAM3I,GAuBvB,OArBAomC,UAAU/lC,UAAU,qBAAuB+4B,EAAQ3lB,KACnD2yB,UAAU/lC,UAAU,uBAAyB,SAAUwQ,GAErD,OADApN,KAAKo2B,IAAM,KACJp2B,KAAKs1B,GAAG,uBAAuBloB,IAExCu1B,UAAU/lC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAK3D,OAJI51B,KAAK44B,OACPxrB,EAASpN,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAKo2B,IAAIp2B,KAAK24B,OAE9D34B,KAAKjB,MAAM62B,GACJxoB,GAETu1B,UAAU/lC,UAAUmC,MAAQ,SAAU62B,GACpC51B,KAAKo2B,IAAIp2B,KAAK24B,KAAO/C,EACrB51B,KAAK24B,KAAO,EACR34B,KAAK24B,MAAQ34B,KAAKo2B,IAAI34B,SACxBuC,KAAK24B,IAAM,EACX34B,KAAK44B,MAAO,IAIT+J,UA5BoB,GCwBd,GADa9P,QAAsBuC,cAAc,GDQlCvC,SAAQ,SAAS+P,WAAWrmC,EAAG+4B,GAC3D,OAAO,IAAI,GAAU/4B,EAAG+4B,MCTsD,WCxBjE,SAASuN,cAAc9G,EAAMsD,GAE1C,IADA,IAAInO,EAAMmO,EAAG5hC,OAAS,EACfyzB,GAAO,GAAK6K,EAAKsD,EAAGnO,KACzBA,GAAO,EAET,OAAO,GAAM,EAAGA,EAAM,EAAGmO,GCH3B,IAAI,GAA8B,WAChC,SAASyD,eAAe/iC,EAAIu1B,GAC1Bt1B,KAAK4C,EAAI7C,EACTC,KAAK+iC,SAAW,GAChB/iC,KAAKs1B,GAAKA,EAoBZ,OAlBAwN,eAAelmC,UAAU,qBAAuB+4B,EAAQ3lB,KACxD8yB,eAAelmC,UAAU,uBAAyB,SAAUwQ,GAE1D,OADApN,KAAK+iC,SAAW,KACT/iC,KAAKs1B,GAAG,uBAAuBloB,IAExC01B,eAAelmC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAChE,OAAO51B,KAAK4C,EAAEgzB,GAAS51B,KAAKgjC,OAAO51B,EAAQwoB,GAAS51B,KAAKijC,MAAM71B,EAAQwoB,IAEzEkN,eAAelmC,UAAUqmC,MAAQ,SAAU71B,EAAQwoB,GAGjD,OAFAxoB,EAASwpB,QAAQ52B,KAAKs1B,GAAG,qBAAsBloB,EAAQpN,KAAK+iC,UAC5D/iC,KAAK+iC,SAAW,GACT/iC,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,IAE9CkN,eAAelmC,UAAUomC,OAAS,SAAU51B,EAAQwoB,GAElD,OADA51B,KAAK+iC,SAASh8B,KAAK6uB,GACZxoB,GAGF01B,eAxByB,GC2BnB,GADkBjQ,QAAsBuC,cAAc,GDClCvC,SAAQ,SAASqQ,gBAAgBnjC,EAAIu1B,GACtE,OAAO,IAAI,GAAev1B,EAAIu1B,MCF0D,gBC3BtF,GAAgC,WAClC,SAAS6N,iBAAiBpH,EAAMzG,GAC9Bt1B,KAAKs1B,GAAKA,EACVt1B,KAAK+7B,KAAOA,EACZ/7B,KAAKojC,eAAY/iC,EACjBL,KAAKqjC,gBAAiB,EAgBxB,OAbAF,iBAAiBvmC,UAAU,qBAAuB+4B,EAAQ3lB,KAC1DmzB,iBAAiBvmC,UAAU,uBAAyB+4B,EAAQvoB,OAC5D+1B,iBAAiBvmC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAClE,IAAI0N,GAAa,EAOjB,OANKtjC,KAAKqjC,eAECrjC,KAAK+7B,KAAK/7B,KAAKojC,UAAWxN,KACnC0N,GAAa,GAFbtjC,KAAKqjC,gBAAiB,EAIxBrjC,KAAKojC,UAAYxN,EACV0N,EAAal2B,EAASpN,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,IAG7DuN,iBArB2B,GA2BrB,GAHsBtQ,SAAQ,SAAS0Q,kBAAkBxH,EAAMzG,GAC5E,OAAO,IAAI,GAAiByG,EAAMzG,MCKrB,GAJQzC,SAAQ,SAAS2Q,IAAIC,EAAQ7O,GAClD,IAAI1D,EAAMuS,EAAS,EAAI7O,EAAKn3B,OAASgmC,EAASA,EAC9C,OAAOzN,UAAUpB,GAAQA,EAAK3uB,OAAOirB,GAAO0D,EAAK1D,MCRpC,GADS,IAAK,GCmBd,GAfoB2B,QAAsBuC,cAAc,GAAI,IAAmB,SAASsO,gBAAgB3H,EAAMnH,GAC3H,IAAIxnB,EAAS,GACT8jB,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACf,GAAY,IAARiI,EAEF,IADA0H,EAAO,GAAKwnB,EAAK,GACV1D,EAAMxrB,GACNq2B,EAAK,GAAK3uB,GAASwnB,EAAK1D,MAC3B9jB,EAAOA,EAAO3P,QAAUm3B,EAAK1D,IAE/BA,GAAO,EAGX,OAAO9jB,MCdM,GADgBslB,QAAsB0C,cAAc,GAAiB,GAAkB,IAAsB,GAAgB,MCrBxI,GAA0B,WAC5B,SAASuO,WAAW/gC,EAAG0yB,GACrBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EAcX,OAZA+gC,WAAW/mC,UAAU,qBAAuB+4B,EAAQ3lB,KACpD2zB,WAAW/mC,UAAU,uBAAyB+4B,EAAQvoB,OACtDu2B,WAAW/mC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAC5D,GAAI51B,KAAK4C,EAAG,CACV,GAAI5C,KAAK4C,EAAEgzB,GACT,OAAOxoB,EAETpN,KAAK4C,EAAI,KAEX,OAAO5C,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,IAGvC+N,WAjBqB,GCsCf,GARc9Q,QAAsBuC,cAAc,CAAC,aDVnCvC,SAAQ,SAAS+Q,YAAYhhC,EAAG0yB,GAC7D,OAAO,IAAI,GAAW1yB,EAAG0yB,OCSkE,SAASuO,UAAU9H,EAAMsD,GAGpH,IAFA,IAAInO,EAAM,EACNxrB,EAAM25B,EAAG5hC,OACNyzB,EAAMxrB,GAAOq2B,EAAKsD,EAAGnO,KAC1BA,GAAO,EAET,OAAO,GAAMA,EAAKoL,IAAU+C,OCdf,GAHOxM,SAAQ,SAASiR,GAAG9hC,EAAGC,GAC3C,OAAOD,GAAKC,KCcC,GALW4wB,SAAQ,SAASkR,OAAOnhC,EAAGsP,GACnD,OAAO6nB,YAAYn3B,GAAK,SAASohC,UAC/B,OAAOphC,EAAEzC,MAAMH,KAAME,YAAcgS,EAAE/R,MAAMH,KAAME,YAC/C,GAAK,GAAL,CAAS0C,EAAGsP,MCCH,GAPUwgB,SAAQ,SAASuR,MAAMhjB,GAC9C,OAAY,MAALA,GAAgD,mBAA5BA,EAAE,sBAAuCA,EAAE,wBAA+B,MAALA,GAA8B,MAAjBA,EAAEviB,aAAsE,mBAAxCuiB,EAAEviB,YAAY,sBAAuCuiB,EAAEviB,YAAY,wBAA+B,MAALuiB,GAAgC,mBAAZA,EAAEgjB,MAAuBhjB,EAAEgjB,QAAe,MAALhjB,GAA8B,MAAjBA,EAAEviB,aAAsD,mBAAxBuiB,EAAEviB,YAAYulC,MAAuBhjB,EAAEviB,YAAYulC,QAAU1O,EAAStU,GAAK,GAAK+U,UAAU/U,GAAK,GAAK6d,UAAU7d,GAAK,GAAK,qBAAaA,GAAK,WACxd,OAAO/gB,UADid,QAI1d,KCNa,GAHa2yB,SAAQ,SAASqR,SAAS3nC,EAAG8iC,GACvD,OAAO,GAAK9iC,GAAK,EAAI8iC,EAAG5hC,OAASlB,EAAI,EAAG8iC,MCA3B,GAHaxM,SAAQ,SAAUsR,EAAQvP,GACpD,OAAO,GAAO,GAASuP,EAAO1mC,OAAQm3B,GAAOuP,MCDhC,GAHStP,SAAQ,SAASuP,KAAKxhC,EAAGqe,EAAGC,GAClD,OAAO,GAAOte,EAAEqe,GAAIre,EAAEse,OCMT,GAHY2T,SAAQ,SAASwP,QAAQnN,EAAMoN,EAAMC,GAC9D,OAAO,GAAOD,EAAKpN,GAAOqN,EAAKrN,OCclB,GAVWrE,SAAQ,SAAS2R,OAAOC,EAAiB/nC,GACjE,IACIgoC,EAAgBroC,EAAKyE,EADrBsM,EAAS,GAEb,IAAK/Q,KAAOK,EAEVoE,SADA4jC,EAAiBD,EAAgBpoC,IAEjC+Q,EAAO/Q,GAAgB,aAATyE,EAAsB4jC,EAAehoC,EAAOL,IAAQqoC,GAA2B,WAAT5jC,EAAoB0jC,OAAOE,EAAgBhoC,EAAOL,IAAQK,EAAOL,GAEvJ,OAAO+Q,KCjCL,GAAqB,WACvB,SAASu3B,MAAM/hC,EAAG0yB,GAChBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EACT5C,KAAK4kC,OAAQ,EAiBf,OAfAD,MAAM/nC,UAAU,qBAAuB+4B,EAAQ3lB,KAC/C20B,MAAM/nC,UAAU,uBAAyB,SAAUwQ,GAIjD,OAHKpN,KAAK4kC,QACRx3B,EAASpN,KAAKs1B,GAAG,qBAAqBloB,OAAQ,IAEzCpN,KAAKs1B,GAAG,uBAAuBloB,IAExCu3B,MAAM/nC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAKvD,OAJI51B,KAAK4C,EAAEgzB,KACT51B,KAAK4kC,OAAQ,EACbx3B,EAASqoB,SAASz1B,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,KAElDxoB,GAGFu3B,MArBgB,GCkCV,GAVS9R,QAAsBuC,cAAc,CAAC,QDAnCvC,SAAQ,SAASgS,OAAOjiC,EAAG0yB,GACnD,OAAO,IAAI,GAAM1yB,EAAG0yB,OCDwD,SAASwP,KAAK/kC,EAAI60B,GAG9F,IAFA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACRyzB,EAAMxrB,GAAK,CAChB,GAAI3F,EAAG60B,EAAK1D,IACV,OAAO0D,EAAK1D,GAEdA,GAAO,OC/BP,GAA0B,WAC5B,SAAS6T,WAAWniC,EAAG0yB,GACrBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EACT5C,KAAKkxB,KAAO,EACZlxB,KAAK4kC,OAAQ,EAkBf,OAhBAG,WAAWnoC,UAAU,qBAAuB+4B,EAAQ3lB,KACpD+0B,WAAWnoC,UAAU,uBAAyB,SAAUwQ,GAItD,OAHKpN,KAAK4kC,QACRx3B,EAASpN,KAAKs1B,GAAG,qBAAqBloB,GAAS,IAE1CpN,KAAKs1B,GAAG,uBAAuBloB,IAExC23B,WAAWnoC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAM5D,OALA51B,KAAKkxB,KAAO,EACRlxB,KAAK4C,EAAEgzB,KACT51B,KAAK4kC,OAAQ,EACbx3B,EAASqoB,SAASz1B,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAKkxB,OAEvD9jB,GAGF23B,WAvBqB,GCiCf,GAXclS,QAAsBuC,cAAc,GDIlCvC,SAAQ,SAASmS,YAAYpiC,EAAG0yB,GAC7D,OAAO,IAAI,GAAW1yB,EAAG0yB,OCLuD,SAAS2P,UAAUllC,EAAI60B,GAGvG,IAFA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACRyzB,EAAMxrB,GAAK,CAChB,GAAI3F,EAAG60B,EAAK1D,IACV,OAAOA,EAETA,GAAO,EAET,OAAQ,MChCN,GAAyB,WAC3B,SAASgU,UAAUtiC,EAAG0yB,GACpBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EAaX,OAXAsiC,UAAUtoC,UAAU,qBAAuB+4B,EAAQ3lB,KACnDk1B,UAAUtoC,UAAU,uBAAyB,SAAUwQ,GACrD,OAAOpN,KAAKs1B,GAAG,uBAAuBt1B,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAK08B,QAElFwI,UAAUtoC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAI3D,OAHI51B,KAAK4C,EAAEgzB,KACT51B,KAAK08B,KAAO9G,GAEPxoB,GAGF83B,UAhBoB,GCgCd,GATarS,QAAsBuC,cAAc,GDJlCvC,SAAQ,SAASsS,WAAWviC,EAAG0yB,GAC3D,OAAO,IAAI,GAAU1yB,EAAG0yB,OCGsD,SAAS8P,SAASrlC,EAAI60B,GAEpG,IADA,IAAI1D,EAAM0D,EAAKn3B,OAAS,EACjByzB,GAAO,GAAG,CACf,GAAInxB,EAAG60B,EAAK1D,IACV,OAAO0D,EAAK1D,GAEdA,GAAO,OC7BP,GAA8B,WAChC,SAASmU,eAAeziC,EAAG0yB,GACzBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EACT5C,KAAKkxB,KAAO,EACZlxB,KAAKslC,SAAW,EAclB,OAZAD,eAAezoC,UAAU,qBAAuB+4B,EAAQ3lB,KACxDq1B,eAAezoC,UAAU,uBAAyB,SAAUwQ,GAC1D,OAAOpN,KAAKs1B,GAAG,uBAAuBt1B,KAAKs1B,GAAG,qBAAqBloB,EAAQpN,KAAKslC,WAElFD,eAAezoC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAKhE,OAJA51B,KAAKkxB,KAAO,EACRlxB,KAAK4C,EAAEgzB,KACT51B,KAAKslC,QAAUtlC,KAAKkxB,KAEf9jB,GAGFi4B,eAnByB,GCiCnB,GAVkBxS,QAAsBuC,cAAc,GDDlCvC,SAAQ,SAAS0S,gBAAgB3iC,EAAG0yB,GACrE,OAAO,IAAI,GAAe1yB,EAAG0yB,OCA2D,SAASkQ,cAAczlC,EAAI60B,GAEnH,IADA,IAAI1D,EAAM0D,EAAKn3B,OAAS,EACjByzB,GAAO,GAAG,CACf,GAAInxB,EAAG60B,EAAK1D,IACV,OAAOA,EAETA,GAAO,EAET,OAAQ,MCbK,GADYwB,QAAsB6H,WAAU,ICW5C,GARS7H,SAAQ,SAAS+S,KAAK1lC,GAC5C,OAAO,EAAOA,EAAGtC,QAAQ,SAAUuE,EAAGC,GACpC,IAAIhC,EAAOiF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,GAGjD,OAFAD,EAAK,GAAKgC,EACVhC,EAAK,GAAK+B,EACHjC,EAAGI,MAAMH,KAAMC,SCkBX,GATY4yB,QAAsBqJ,gBAAgB,WAAW,SAASz1B,QAAQ1G,EAAI60B,GAG/F,IAFA,IAAIlvB,EAAMkvB,EAAKn3B,OACXyzB,EAAM,EACHA,EAAMxrB,GACX3F,EAAG60B,EAAK1D,IACRA,GAAO,EAET,OAAO0D,MCTM,GAVsB/B,SAAQ,SAAS6S,kBAAkB3lC,EAAI9C,GAG1E,IAFA,IAAI0oC,EAAU,EAAK1oC,GACfi0B,EAAM,EACHA,EAAMyU,EAAQloC,QAAQ,CAC3B,IAAIpB,EAAMspC,EAAQzU,GAClBnxB,EAAG9C,EAAIZ,GAAMA,EAAKY,GAClBi0B,GAAO,EAET,OAAOj0B,KCNM,GATcy1B,SAAQ,SAASkT,UAAUnG,GAGtD,IAFA,IAAIryB,EAAS,GACT8jB,EAAM,EACHA,EAAMuO,EAAMhiC,QACjB2P,EAAOqyB,EAAMvO,GAAK,IAAMuO,EAAMvO,GAAK,GACnCA,GAAO,EAET,OAAO9jB,KC0BM,GAPYylB,QAAsBqJ,gBAAgB,UAAwB,IAAS,SAAU9F,EAAKoB,GAK/G,OAJW,MAAPpB,IACFA,EAAM,IAERA,EAAIrvB,KAAKywB,GACFpB,IACN,QCJY,GAdcvD,SAAQ,SAAU9yB,EAAI60B,GAIjD,IAHA,IAAIiR,EAAM,GACN3U,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACRyzB,EAAMxrB,GAAK,CAEhB,IADA,IAAIogC,EAAU5U,EAAM,EACb4U,EAAUpgC,GAAO3F,EAAG60B,EAAKkR,EAAU,GAAIlR,EAAKkR,KACjDA,GAAW,EAEbD,EAAI9+B,KAAK6tB,EAAKhuB,MAAMsqB,EAAK4U,IACzB5U,EAAM4U,EAER,OAAOD,KClBM,GAHOhT,SAAQ,SAAS3M,GAAGlkB,EAAGC,GAC3C,OAAOD,EAAIC,KCEE,GAHQ4wB,SAAQ,SAAS5I,IAAIjoB,EAAGC,GAC7C,OAAOD,GAAKC,KCIC,GADQ4wB,QAAQoE,MCIhB,GAHUpE,SAAQ,SAASkT,MAAM7O,EAAMj6B,GACpD,OAAOi6B,KAAQj6B,KCLF,GADS,GAAI,GCvBb,SAAS+oC,UAAU/kB,GAChC,OAAOA,ECqBT,IACe,GADayR,QAAQsT,WCWrB,GALWnR,SAAQ,SAASoR,OAAOC,EAAWC,EAAQC,GACnE,OAAO,EAAO9jC,KAAKgf,IAAI4kB,EAAUzoC,OAAQ0oC,EAAO1oC,OAAQ2oC,EAAQ3oC,SAAS,SAAS4oC,UAChF,OAAOH,EAAU/lC,MAAMH,KAAME,WAAaimC,EAAOhmC,MAAMH,KAAME,WAAakmC,EAAQjmC,MAAMH,KAAME,iBCZnF,GADQ,EAAI,GCUZ,GAHY,IAAS,SAAUk2B,EAAK+K,GACjD,OAAOA,IACN,MCAY,GAHYtO,SAAQ,SAAS1Z,QAAQ5b,EAAQ8hC,GAC1D,MAA6B,mBAAfA,EAAGlmB,SAA2Boc,EAAS8J,GAA2BvB,SAASuB,EAAI9hC,EAAQ,GAA1C8hC,EAAGlmB,QAAQ5b,MCGzD,GADS,GAAM,GAAI,GCkBnB,GALcs3B,SAAQ,SAASyR,UAAUvK,EAAMsD,EAAIkH,GAChE,OAAO1H,SAAQ,SAAU5d,GACvB,OAAO8b,cAAchB,EAAM9a,EAAGslB,KAC7BlH,MCfU,GANWxK,SAAQ,SAAS2R,OAAOtV,EAAKgQ,EAAKtM,GAC1D1D,EAAMA,EAAM0D,EAAKn3B,QAAUyzB,GAAO,EAAIA,EAAM0D,EAAKn3B,OACjD,IAAI2P,EAASlI,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAE9C,OADAxnB,EAAOmZ,OAAO2K,EAAK,EAAGgQ,GACf9zB,KCDM,GAJcynB,SAAQ,SAAS4R,UAAUvV,EAAKwV,EAAM9R,GAEjE,OADA1D,EAAMA,EAAM0D,EAAKn3B,QAAUyzB,GAAO,EAAIA,EAAM0D,EAAKn3B,OAC1C,GAAG4H,OAAOH,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,EAAG1D,GAAMwV,EAAMxhC,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM1D,OCgBpG,SAASyV,SAASnP,EAAMoP,EAAWt1B,GACjC,IACIu1B,EADA/lC,SAAc02B,EAElB,OAAQ12B,GACN,IAAK,SACL,IAAK,SAEH,OAAa,IAAT02B,GAAc,EAAIA,IAAU8E,MAC1BhrB,EAAIw1B,OAAO,QAGTF,IACFt1B,EAAIw1B,OAAO,OAAQ,IAEd,GAIY,OAAnBx1B,EAAIy1B,WACFH,GACFC,EAAWv1B,EAAIy1B,WAAWnhC,KAC1B0L,EAAIy1B,WAAW9T,IAAIuE,GACTlmB,EAAIy1B,WAAWnhC,OACNihC,GAEZv1B,EAAIy1B,WAAWnmC,IAAI42B,GAGtB12B,KAAQwQ,EAAIw1B,OAMPtP,KAAQlmB,EAAIw1B,OAAOhmC,KAGxB8lC,IACFt1B,EAAIw1B,OAAOhmC,GAAM02B,IAAQ,IAEpB,IAXHoP,IACFt1B,EAAIw1B,OAAOhmC,GAAQ,GACnBwQ,EAAIw1B,OAAOhmC,GAAM02B,IAAQ,IAEpB,GAWb,IAAK,UAGH,GAAI12B,KAAQwQ,EAAIw1B,OAAQ,CACtB,IAAIE,EAAOxP,EAAO,EAAI,EACtB,QAAIlmB,EAAIw1B,OAAOhmC,GAAMkmC,KAGfJ,IACFt1B,EAAIw1B,OAAOhmC,GAAMkmC,IAAQ,IAEpB,GAMT,OAHIJ,IACFt1B,EAAIw1B,OAAOhmC,GAAQ02B,EAAO,EAAC,GAAO,GAAQ,EAAC,GAAM,KAE5C,EAGX,IAAK,WAEH,OAAuB,OAAnBlmB,EAAIy1B,WACFH,GACFC,EAAWv1B,EAAIy1B,WAAWnhC,KAC1B0L,EAAIy1B,WAAW9T,IAAIuE,GACTlmB,EAAIy1B,WAAWnhC,OACNihC,GAEZv1B,EAAIy1B,WAAWnmC,IAAI42B,GAGtB12B,KAAQwQ,EAAIw1B,SAMb9I,UAAUxG,EAAMlmB,EAAIw1B,OAAOhmC,MAC1B8lC,GACFt1B,EAAIw1B,OAAOhmC,GAAMiG,KAAKywB,IAEjB,IATHoP,IACFt1B,EAAIw1B,OAAOhmC,GAAQ,CAAC02B,KAEf,GAWb,IAAK,YACH,QAAIlmB,EAAIw1B,OAAOhmC,KAGT8lC,IACFt1B,EAAIw1B,OAAOhmC,IAAQ,IAEd,GAGX,IAAK,SACH,GAAa,OAAT02B,EACF,QAAKlmB,EAAIw1B,OAAa,OAChBF,IACFt1B,EAAIw1B,OAAa,MAAI,IAEhB,GAKb,QAIE,OADAhmC,EAAOtF,OAAOoB,UAAUmJ,SAAS9K,KAAKu8B,MACxBlmB,EAAIw1B,SAOb9I,UAAUxG,EAAMlmB,EAAIw1B,OAAOhmC,MAC1B8lC,GACFt1B,EAAIw1B,OAAOhmC,GAAMiG,KAAKywB,IAEjB,IAVHoP,IACFt1B,EAAIw1B,OAAOhmC,GAAQ,CAAC02B,KAEf,IAcA,OA1KS,WACtB,SAASyP,OAEPjnC,KAAK+mC,WAA4B,mBAARG,IAAqB,IAAIA,IAAQ,KAC1DlnC,KAAK8mC,OAAS,GA6BhB,OAtBAG,KAAKrqC,UAAUq2B,IAAM,SAAUuE,GAC7B,OAAQmP,SAASnP,GAAM,EAAMx3B,OAO/BinC,KAAKrqC,UAAUgE,IAAM,SAAU42B,GAC7B,OAAOmP,SAASnP,GAAM,EAAOx3B,OAaxBinC,KAjCe,GCmCT,GAhBWpU,SAAQ,SAASsU,OAAOpnC,EAAI60B,GAMpD,IALA,IAGIwS,EAAa5P,EAHblmB,EAAM,IAAI,GACVlE,EAAS,GACT8jB,EAAM,EAGHA,EAAM0D,EAAKn3B,QAEhB2pC,EAAcrnC,EADdy3B,EAAO5C,EAAK1D,IAER5f,EAAI2hB,IAAImU,IACVh6B,EAAOrG,KAAKywB,GAEdtG,GAAO,EAET,OAAO9jB,KCdM,GADS,GAAO,ICchB,GAXiBylB,SAAQ,SAASwU,aAAaC,EAAOC,GACnE,IAAIC,EAAYC,EAQhB,OAPIH,EAAM7pC,OAAS8pC,EAAM9pC,QACvB+pC,EAAaF,EACbG,EAAeF,IAEfC,EAAaD,EACbE,EAAeH,GAEV,GAAKzI,QAAQ,GAAKb,UAAL,CAAgBwJ,GAAaC,OCEpC,GAdgB5U,QAAsBqJ,gBAAgB,eAAe,SAASwL,YAAYC,EAAW/S,GAIlH,IAHA,IAAI3zB,EAAM,GACNiwB,EAAM,EACNzzB,EAASm3B,EAAKn3B,OACXyzB,EAAMzzB,GACPyzB,IAAQzzB,EAAS,EACnBwD,EAAI8F,KAAK6tB,EAAK1D,IAEdjwB,EAAI8F,KAAK6tB,EAAK1D,GAAMyW,GAEtBzW,GAAO,EAET,OAAOjwB,MC9BM,sDCCA,SAAS2mC,cAAcrqC,GACpC,GAAc,MAAVA,EACF,MAAM,IAAIF,UAAU,8CAMtB,IAHA,IAAIwqC,EAASrsC,OAAO+B,GAChB2zB,EAAM,EACNzzB,EAASyC,UAAUzC,OAChByzB,EAAMzzB,GAAQ,CACnB,IAAIsD,EAASb,UAAUgxB,GACvB,GAAc,MAAVnwB,EACF,IAAK,IAAI+mC,KAAW/mC,EACdk2B,KAAK6Q,EAAS/mC,KAChB8mC,EAAOC,GAAW/mC,EAAO+mC,IAI/B5W,GAAO,EAET,OAAO2W,GCKM,GALUhV,SAAQ,SAASkV,MAAM1rC,EAAKgP,GACnD,IAAIpO,EAAM,GAEV,OADAA,EAAIZ,GAAOgP,EACJpO,KCnBL+qC,GAAgB,CAClB,oBAAqB9iC,MACrB,oBAAqB,SAAUm6B,EAAIpe,GAEjC,OADAoe,EAAGt4B,KAAKka,GACDoe,GAET,sBAAuB2G,WAErBiC,GAAiB,CACnB,oBAAqBp8B,OACrB,oBAAqB,SAAU7J,EAAGC,GAChC,OAAOD,EAAIC,GAEb,sBAAuB+jC,WAErBkC,GAAiB,CACnB,oBAAqB1sC,OACrB,oBAAqB,SAAU4R,EAAQwoB,GACrC,OAAOuS,GAAQ/6B,EAAQ,EAAawoB,GAAS,GAAMA,EAAM,GAAIA,EAAM,IAAMA,IAE3E,sBAAuBoQ,WCkBzB,IAGe,GAHSnR,SAAQ,SAASuT,KAAKhS,EAAKd,EAAIV,GACrD,OAAOO,eAAeiB,GAAOQ,QAAQtB,EAAGc,GAAMA,EAAI,uBAAwBxB,GAAQgC,QAAQtB,EDhB7E,SAAS+S,SAASprC,GAC/B,GAAIk4B,eAAel4B,GACjB,OAAOA,EAET,GAAI,EAAaA,GACf,OAAO+qC,GAET,GAAmB,iBAAR/qC,EACT,OAAOgrC,GAET,GAAmB,iBAARhrC,EACT,OAAOirC,GAET,MAAM,IAAIhiC,MAAM,iCAAmCjJ,GCG0CorC,CAASjS,IAAOqF,OAAOrF,EAAK,GAAI,IAAI,GAAQxB,MCJ5H,GAfWlC,SAAQ,SAAS4V,OAAOrrC,GAMhD,IALA,IAAIO,EAAQ,EAAKP,GACbyI,EAAMlI,EAAMC,OACZyzB,EAAM,EACNjwB,EAAM,GAEHiwB,EAAMxrB,GAAK,CAChB,IAAIrJ,EAAMmB,EAAM0zB,GACZ7lB,EAAMpO,EAAIZ,GACVu4B,EAAOqC,KAAK5rB,EAAKpK,GAAOA,EAAIoK,GAAOpK,EAAIoK,GAAO,GAClDupB,EAAKA,EAAKn3B,QAAUpB,EACpB60B,GAAO,EAET,OAAOjwB,KCIM,GAbcyxB,SAAQ,SAAS6V,UAAUtrC,GAMtD,IALA,IAAIO,EAAQ,EAAKP,GACbyI,EAAMlI,EAAMC,OACZyzB,EAAM,EACNjwB,EAAM,GAEHiwB,EAAMxrB,GAAK,CAChB,IAAIrJ,EAAMmB,EAAM0zB,GAChBjwB,EAAIhE,EAAIZ,IAAQA,EAChB60B,GAAO,EAET,OAAOjwB,KCAM,GATY4xB,SAAQ,SAAS2V,QAAQvO,EAAO1V,GACzD,OAAO,EAAO0V,EAAQ,GAAG,WACvB,IAAI18B,EAAS2C,UAAU+5B,GACvB,GAAc,MAAV18B,GAAkBw8B,YAAYx8B,EAAOgnB,IACvC,OAAOhnB,EAAOgnB,GAAQpkB,MAAM5C,EAAQ2H,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,EAAG+5B,IAE/E,MAAM,IAAI58B,UAAU,GAASE,GAAU,kCAAoCgnB,EAAS,WCVzE,GAHOsO,SAAQ,SAASte,GAAGk0B,EAAMp9B,GAC9C,OAAc,MAAPA,GAAeA,EAAI3M,cAAgB+pC,GAAQp9B,aAAeo9B,KCEpD,GAHY/V,SAAQ,SAASgW,QAAQznB,GAClD,OAAY,MAALA,GAAa,GAAOA,EAAG,GAAMA,OCJvB,GADS,GAAQ,EAAG,QCIpB,GALSyR,SAAQ,SAASiW,KAAKlI,GAC5C,OAAO,IAAS,WACd,OAAOv7B,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,KAC5CugC,MCQU,GARW/N,SAAQ,SAASkW,OAAO3rC,GAChD,IAAIi6B,EACAQ,EAAK,GACT,IAAKR,KAAQj6B,EACXy6B,EAAGA,EAAGj6B,QAAUy5B,EAElB,OAAOQ,KCQM,GAdgB7E,SAAQ,SAASgW,YAAYtrC,EAAQ8hC,GAClE,GAA8B,mBAAnBA,EAAGwJ,aAA+BtT,EAAS8J,GAE/C,CAEL,IADA,IAAInO,EAAMmO,EAAG5hC,OAAS,EACfyzB,GAAO,GAAG,CACf,GAAI,GAAOmO,EAAGnO,GAAM3zB,GAClB,OAAO2zB,EAETA,GAAO,EAET,OAAQ,EATR,OAAOmO,EAAGwJ,YAAYtrC,MCzBX,SAASurC,UAAU7nB,GAChC,MAA6C,oBAAtCzlB,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,GCiBxC,IAGe,GAHWyR,SAAQ,SAASj1B,OAAOm3B,GAChD,OAAe,MAARA,GAAgBkU,UAAUlU,EAAKn3B,QAAUm3B,EAAKn3B,OAASgrB,OCgBjD,GATSoK,SAAQ,SAASkW,KAAKztC,EAAQ0tC,GACpD,OAAO,SAAUC,GACf,OAAO,SAAU1rC,GACf,OAAO,GAAI,SAAU2rC,GACnB,OAAOF,EAAOE,EAAO3rC,KACpB0rC,EAAY3tC,EAAOiC,UCHb,GAHcm1B,SAAQ,SAASyW,UAAU5sC,GACtD,OAAO,GAAK,GAAIA,GAAI,GAAOA,OCMd,GAHam2B,SAAQ,SAAS0W,SAAStsC,GACpD,OAAO,GAAK,EAAKA,GAAI,GAAUA,OCFlB,GAHa41B,SAAQ,SAAS2W,SAASpkC,GACpD,OAAO,GAAK,EAAKA,GAAI,GAAMA,OCAd,GAHO4tB,SAAQ,SAAS5lB,GAAGjL,EAAGC,GAC3C,OAAOD,EAAIC,KCEE,GAHQ4wB,SAAQ,SAASzI,IAAIpoB,EAAGC,GAC7C,OAAOD,GAAKC,KCwBC,GAZa4yB,SAAQ,SAASyU,SAASvpC,EAAIq2B,EAAKxB,GAK7D,IAJA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACX2P,EAAS,GACTm8B,EAAQ,CAACnT,GACNlF,EAAMxrB,GACX6jC,EAAQxpC,EAAGwpC,EAAM,GAAI3U,EAAK1D,IAC1B9jB,EAAO8jB,GAAOqY,EAAM,GACpBrY,GAAO,EAET,MAAO,CAACqY,EAAM,GAAIn8B,MCIL,GAXkBynB,SAAQ,SAAS2U,cAAczpC,EAAIq2B,EAAKxB,GAIvE,IAHA,IAAI1D,EAAM0D,EAAKn3B,OAAS,EACpB2P,EAAS,GACTm8B,EAAQ,CAACnT,GACNlF,GAAO,GACZqY,EAAQxpC,EAAG60B,EAAK1D,GAAMqY,EAAM,IAC5Bn8B,EAAO8jB,GAAOqY,EAAM,GACpBrY,GAAO,EAET,MAAO,CAAC9jB,EAAQm8B,EAAM,OCjBT,GANkB1W,SAAQ,SAAS4W,cAAc1pC,EAAI9C,GAClE,OAAO25B,SAAQ,SAAUR,EAAK/5B,GAE5B,OADA+5B,EAAI/5B,GAAO0D,EAAG9C,EAAIZ,GAAMA,EAAKY,GACtBm5B,IACN,GAAI,EAAKn5B,OCHC,GAHU41B,SAAQ,SAAS5E,MAAMyb,EAAIjoB,GAClD,OAAOA,EAAIwM,MAAMyb,IAAO,MCqBX,GATY7W,SAAQ,SAAS8W,QAAQzuC,EAAG4B,GACrD,OAAK88B,GAAW1+B,IAGX0+B,GAAW98B,IAAMA,EAAI,EACjB2rB,KAEDvtB,EAAI4B,EAAIA,GAAKA,EALZ2rB,OCTI,GAHUoM,SAAQ,SAAS+U,MAAMhnC,EAAGZ,EAAGC,GACpD,OAAOW,EAAEX,GAAKW,EAAEZ,GAAKC,EAAID,KCRZ,GADQ,EAAO,EAAK,GCIpB,GAHS0wB,SAAQ,SAASmX,KAAKjV,GAC5C,OAAO,GAAIA,GAAQA,EAAKn3B,UCWX,GAXWi1B,SAAQ,SAASoX,OAAOlV,GAChD,IAAIlvB,EAAMkvB,EAAKn3B,OACf,GAAY,IAARiI,EACF,OAAO+iB,IAET,IAAIshB,EAAQ,EAAIrkC,EAAM,EAClBwrB,GAAOxrB,EAAMqkC,GAAS,EAC1B,OAAO,GAAK7kC,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAAG1E,MAAK,SAAUluB,EAAGC,GAChE,OAAOD,EAAIC,GAAK,EAAID,EAAIC,EAAI,EAAI,KAC/B2E,MAAMsqB,EAAKA,EAAM6Y,OCcP,GAVgBlX,SAAQ,SAASmX,YAAYC,EAAKlqC,GAC/D,IAAI2R,EAAQ,GACZ,OAAO8hB,OAAOzzB,EAAGtC,QAAQ,WACvB,IAAIpB,EAAM4tC,EAAI9pC,MAAMH,KAAME,WAI1B,OAHK+2B,KAAK56B,EAAKqV,KACbA,EAAMrV,GAAO0D,EAAGI,MAAMH,KAAME,YAEvBwR,EAAMrV,SCNF,GAHY,IAAY,WACrC,OAAO,GAAS6D,cCHH,GAHU2yB,SAAQ,SAASqX,MAAMnvC,EAAGa,GACjD,OAAOusC,GAAQ,GAAIptC,EAAGa,MCJT,GAHa82B,SAAQ,SAASyX,SAASvV,GACpD,OAAOuT,GAAQhoC,MAAM,KAAM,CAAC,IAAIkF,OAAOuvB,OCyB1B,GAlBiBC,SAAQ,SAASuV,aAAarqC,EAAIhF,EAAGa,GACnE,IACIqJ,EADAmI,EAAS,GAGb,IAAKnI,KAAKlK,EACJk8B,KAAKhyB,EAAGlK,KACVqS,EAAOnI,GAAKgyB,KAAKhyB,EAAGrJ,GAAKmE,EAAGkF,EAAGlK,EAAEkK,GAAIrJ,EAAEqJ,IAAMlK,EAAEkK,IAInD,IAAKA,KAAKrJ,EACJq7B,KAAKhyB,EAAGrJ,KAAOq7B,KAAKhyB,EAAGmI,KACzBA,EAAOnI,GAAKrJ,EAAEqJ,IAIlB,OAAOmI,KCHM,GATqBynB,SAAQ,SAASwV,iBAAiBtqC,EAAIuqC,EAAMC,GAC9E,OAAO,IAAa,SAAUtlC,EAAGulC,EAAMC,GACrC,OAAI3L,UAAU0L,IAAS1L,UAAU2L,GACxBJ,iBAAiBtqC,EAAIyqC,EAAMC,GAE3B1qC,EAAGkF,EAAGulC,EAAMC,KAEpBH,EAAMC,MCVI,GALkB1X,SAAQ,SAAS6X,cAAcJ,EAAMC,GACpE,OAAO,IAAiB,SAAUtlC,EAAGulC,EAAMC,GACzC,OAAOD,IACNF,EAAMC,MCEI,GALmB1X,SAAQ,SAAS8X,eAAeL,EAAMC,GACtE,OAAO,IAAiB,SAAUtlC,EAAGulC,EAAMC,GACzC,OAAOA,IACNH,EAAMC,MCQI,GALkB1V,SAAQ,SAAS+V,cAAc7qC,EAAIuqC,EAAMC,GACxE,OAAO,IAAiB,SAAUtlC,EAAGulC,EAAMC,GACzC,OAAO1qC,EAAGyqC,EAAMC,KACfH,EAAMC,MCFI,GALc1V,SAAQ,SAASgW,UAAU9qC,EAAIhF,EAAGa,GAC7D,OAAO,IAAa,SAAUkvC,EAAGC,EAAIC,GACnC,OAAOjrC,EAAGgrC,EAAIC,KACbjwC,EAAGa,MCPO,GAHQi3B,SAAQ,SAAS/d,IAAI9S,EAAGC,GAC7C,OAAOA,EAAID,EAAIC,EAAID,KCSN,GAHU6yB,SAAQ,SAASoW,MAAMroC,EAAGZ,EAAGC,GACpD,OAAOW,EAAEX,GAAKW,EAAEZ,GAAKC,EAAID,KCGZ,GAHW6wB,SAAQ,SAAShI,OAAO7oB,EAAGC,GACnD,OAAOD,EAAIC,KCHE,GAHa4wB,SAAQ,SAAS7L,SAAShlB,EAAGC,GACvD,OAAOD,EAAIC,KCJE,GAHWywB,SAAQ,SAASwY,OAAO3uC,GAChD,OAAQA,KCaK,GADSs2B,QAAsB+L,YAA0BxJ,cAAc,CAAC,OAAQ,EAAO,KCDvF,GANW1C,SAAQ,SAASyY,OAAO5uC,GAEhD,OAAO,EADKA,EAAI,EAAI,EAAIA,EAAI,GACP,WACnB,OAAO,GAAIA,EAAG2D,iBCKH,GAHM20B,SAAQ,SAASt5B,EAAEqH,EAAGsP,EAAG+O,GAC5C,OAAOre,EAAEsP,EAAE+O,OC5BE,SAASmqB,IAAInqB,GAC1B,MAAO,CAACA,GCoBV,IACe,GADOyR,QAAQ0Y,KCef,GAlBSvY,SAAQ,SAASwY,KAAK12B,EAAO1X,GAMnD,IALA,IAAImQ,EAAS,GACTlB,EAAQ,GACRglB,EAAM,EACNxrB,EAAMiP,EAAMlX,OAETyzB,EAAMxrB,GACXwG,EAAMyI,EAAMuc,IAAQ,EACpBA,GAAO,EAGT,IAAK,IAAIgG,KAAQj6B,EACViP,EAAMrP,eAAeq6B,KACxB9pB,EAAO8pB,GAAQj6B,EAAIi6B,IAGvB,OAAO9pB,KCAM,GAZSslB,SAAQ,SAASnX,KAAKxb,GAC5C,IACIqN,EADAk+B,GAAS,EAEb,OAAO9X,OAAOzzB,EAAGtC,QAAQ,WACvB,OAAI6tC,EACKl+B,GAETk+B,GAAS,EACTl+B,EAASrN,EAAGI,MAAMH,KAAME,kBC1BxBqrC,SAAW,SAAUtqB,GACvB,MAAO,CAAEllB,MAAOklB,EAAG7b,IAAK,SAAUxC,GAC9B,OAAO2oC,SAAS3oC,EAAEqe,OAkCT,GARS4T,SAAQ,SAAS2W,KAAKzC,EAAMnmC,EAAGqe,GAIrD,OAAO8nB,GAAK,SAAU7nB,GACpB,OAAOqqB,SAAS3oC,EAAEse,MADb6nB,CAEJ9nB,GAAGllB,SCjBO,GAHS82B,SAAQ,SAAS6M,KAAK+L,EAAKC,GACjD,MAAO,CAACD,EAAKC,MChBA,SAASC,yBAAyBtmC,GAC/C,OAAOwtB,SAAQ,SAAU9yB,EAAIE,GAC3B,OAAOuzB,OAAOlxB,KAAKgf,IAAI,EAAGvhB,EAAGtC,OAASwC,EAAKxC,SAAS,WAClD,OAAOsC,EAAGI,MAAMH,KAAMqF,EAAOpF,EAAMC,kBCyBzC,IACe,GADYyrC,yBAAyBxY,SCFrC,GADiBwY,yBAAuC,GAAKxY,UCC7D,GADc,GAAK,CAAC,GAAQ,KCG5B,GAHW0B,SAAQ,SAAS+W,OAAOC,EAAOxgC,EAAKpO,GAC5D,OAAO,GAAO,EAAK4uC,EAAO5uC,GAAMoO,MCHnB,GAHWwpB,SAAQ,SAASiX,OAAO1wC,EAAG0B,EAAGG,GACtD,OAAO,GAAU7B,EAAG,EAAK0B,EAAGG,OCCf,GAHkB43B,SAAQ,SAASkX,cAAchQ,EAAMiQ,EAAU/uC,GAC9E,OAAO+uC,EAASvuC,OAAS,GAAKs+B,EAAK,EAAKiQ,EAAU/uC,OCQrC,GAXS41B,SAAQ,SAASoZ,KAAKt3B,EAAO1X,GAGnD,IAFA,IAAImQ,EAAS,GACT8jB,EAAM,EACHA,EAAMvc,EAAMlX,QACbkX,EAAMuc,KAAQj0B,IAChBmQ,EAAOuH,EAAMuc,IAAQj0B,EAAI0X,EAAMuc,KAEjCA,GAAO,EAET,OAAO9jB,KCEM,GAXYylB,SAAQ,SAASqZ,QAAQv3B,EAAO1X,GAIzD,IAHA,IAAImQ,EAAS,GACT8jB,EAAM,EACNxrB,EAAMiP,EAAMlX,OACTyzB,EAAMxrB,GAAK,CAChB,IAAIrK,EAAOsZ,EAAMuc,GACjB9jB,EAAO/R,GAAQ4B,EAAI5B,GACnB61B,GAAO,EAET,OAAO9jB,KCEM,GATWylB,SAAQ,SAASsZ,OAAOz5B,EAAMzV,GACtD,IAAImQ,EAAS,GACb,IAAK,IAAI8pB,KAAQj6B,EACXyV,EAAKzV,EAAIi6B,GAAOA,EAAMj6B,KACxBmQ,EAAO8pB,GAAQj6B,EAAIi6B,IAGvB,OAAO9pB,KCQM,SAASg/B,QACtB,GAAyB,IAArBlsC,UAAUzC,OACZ,MAAM,IAAIyI,MAAM,wCAElB,OAAOu2B,SAASt8B,MAAMH,KAAM,GAAQE,YCrBtC,IAGe,GAHY2yB,SAAQ,SAASwZ,QAAQrT,EAAIpE,GACtD,OAAOzB,QAAQ,CAAC6F,GAAKpE,MCFR,GADY,EAAO,GAAU,GCyB7B,GAXY/B,SAAQ,SAASyZ,QAAQvsC,EAAIwsC,GACtD,OAAO,EAAOA,EAAa9uC,QAAQ,WAGjC,IAFA,IAAIwC,EAAO,GACPixB,EAAM,EACHA,EAAMqb,EAAa9uC,QACxBwC,EAAK8G,KAAKwlC,EAAarb,GAAKj2B,KAAK+E,KAAME,UAAUgxB,KACjDA,GAAO,EAET,OAAOnxB,EAAGI,MAAMH,KAAMC,EAAKoF,OAAOH,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAWqsC,EAAa9uC,gBCf1E,GADY,GAAQq4B,KAAM,CAAC,GAAS,KCOpC,GAHWjB,SAAQ,SAAS2X,OAAOnxC,EAAMgQ,EAAKpO,GAC3D,OAAO,GAAOoO,EAAKpO,EAAI5B,OCHV,GAHWw5B,SAAQ,SAAS4X,OAAO3rC,EAAMzF,EAAM4B,GAC5D,OAAO,GAAG6D,EAAM7D,EAAI5B,OCQP,GAHWw5B,SAAQ,SAAS6X,OAAOrhC,EAAKvO,EAAGG,GACxD,OAAc,MAAPA,GAAeg6B,KAAKn6B,EAAGG,GAAOA,EAAIH,GAAKuO,KCNjC,GAHkBwpB,SAAQ,SAAS8X,cAAc5Q,EAAM1gC,EAAM4B,GAC1E,OAAO8+B,EAAK9+B,EAAI5B,OCYH,GAZUw3B,SAAQ,SAASr1B,MAAMovC,EAAI3vC,GAKlD,IAJA,IAAIyI,EAAMknC,EAAGnvC,OACTwD,EAAM,GACNiwB,EAAM,EAEHA,EAAMxrB,GACXzE,EAAIiwB,GAAOj0B,EAAI2vC,EAAG1b,IAClBA,GAAO,EAGT,OAAOjwB,KCDM,GAZU4xB,SAAQ,SAASga,MAAM1nC,EAAM2nC,GACpD,IAAMhE,UAAU3jC,KAAS2jC,UAAUgE,GACjC,MAAM,IAAIzvC,UAAU,2CAItB,IAFA,IAAI+P,EAAS,GACT7Q,EAAI4I,EACD5I,EAAIuwC,GACT1/B,EAAOrG,KAAKxK,GACZA,GAAK,EAEP,OAAO6Q,KCuBM,GARgBynB,SAAQ,SAASkY,YAAYhtC,EAAIq2B,EAAKxB,GAEnE,IADA,IAAI1D,EAAM0D,EAAKn3B,OAAS,EACjByzB,GAAO,GACZkF,EAAMr2B,EAAG60B,EAAK1D,GAAMkF,GACpBlF,GAAO,EAET,OAAOkF,KCZM,GALgBjC,QAAQ,EAAG,IAAI,SAAS6Y,aAAajR,EAAMh8B,EAAIiC,EAAG4yB,GAC/E,OAAOgC,SAAQ,SAAUR,EAAKnV,GAC5B,OAAO8a,EAAK3F,EAAKnV,GAAKlhB,EAAGq2B,EAAKnV,GAAKwU,SAASW,KAC3Cp0B,EAAG4yB,MCRO,GADYlC,QAAQ+C,UCapB,GAfU5C,SAAQ,SAASlJ,MAAM5pB,EAAIxD,GAClD,IAEIq4B,EAFAlvB,EAAMwtB,OAAO32B,GACb20B,EAAM,EAGV,GAAIxrB,EAAM,GAAK8F,MAAM9F,GACnB,MAAM,IAAIoB,WAAW,mCAGvB,IADA8tB,EAAO,IAAI1vB,MAAMQ,GACVwrB,EAAMxrB,GACXkvB,EAAK1D,GAAOnxB,EAAGmxB,GACfA,GAAO,EAET,OAAO0D,KCRM,GAHW/B,SAAQ,SAASoa,OAAOlxC,EAAOQ,GACvD,OAAO,GAAM,EAAOR,GAAQQ,MCHf,GAHYs4B,SAAQ,SAASjR,QAAQkK,EAAOof,EAAazrB,GACtE,OAAOA,EAAImC,QAAQkK,EAAOof,MCWb,GAXSrY,SAAQ,SAASsY,KAAKptC,EAAIq2B,EAAKxB,GAIrD,IAHA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACX2P,EAAS,CAACgpB,GACPlF,EAAMxrB,GACX0wB,EAAMr2B,EAAGq2B,EAAKxB,EAAK1D,IACnB9jB,EAAO8jB,EAAM,GAAKkF,EAClBlF,GAAO,EAET,OAAO9jB,KCGM,GALaylB,SAAQ,SAASua,SAASC,EAAIC,GACxD,MAAuC,mBAAzBA,EAAYF,SAA0BE,EAAYF,SAASC,GAAM,IAAY,SAAUpsB,EAAGmV,GACtG,OAAO,EAAG,EAAI,GAASnV,GAAImV,KAC1BiX,EAAG,IAAKC,MCJE,GAHQzY,SAAQ,SAASvjB,IAAIy3B,EAAMvjB,EAAGvE,GACnD,OAAO,GAAK8nB,EAAM,EAAOvjB,GAAIvE,MCFhB,GAHS4R,SAAQ,SAAS3C,KAAK4L,EAAYlH,GACxD,OAAO1vB,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAAG1E,KAAK4L,MCkBnC,GAPWjJ,SAAQ,SAAS0a,OAAOxtC,EAAI60B,GACpD,OAAO1vB,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAAG1E,MAAK,SAAUluB,EAAGC,GAC3D,IAAIq3B,EAAKv5B,EAAGiC,GACRu3B,EAAKx5B,EAAGkC,GACZ,OAAOq3B,EAAKC,GAAM,EAAID,EAAKC,EAAK,EAAI,QCOzB,GAXa1G,SAAQ,SAAS2a,SAAS/M,EAAK7L,GACzD,OAAO1vB,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM,GAAG1E,MAAK,SAAUluB,EAAGC,GAG3D,IAFA,IAAImL,EAAS,EACTtS,EAAI,EACU,IAAXsS,GAAgBtS,EAAI2lC,EAAIhjC,QAC7B2P,EAASqzB,EAAI3lC,GAAGkH,EAAGC,GACnBnH,GAAK,EAEP,OAAOsS,QCnBI,GADU,GAAQ,EAAG,SCGrB,GAHYylB,SAAQ,SAAS4a,QAAQvhC,EAAOrB,GACzD,MAAO,CAAC,GAAM,EAAGqB,EAAOrB,GAAQ,GAAMqB,EAAO,GAAOrB,GAAQA,OCQ/C,GAXegoB,SAAQ,SAAS6a,WAAWnxC,EAAGq4B,GAC3D,GAAIr4B,GAAK,EACP,MAAM,IAAI2J,MAAM,2DAIlB,IAFA,IAAIkH,EAAS,GACT8jB,EAAM,EACHA,EAAM0D,EAAKn3B,QAChB2P,EAAOrG,KAAK,GAAMmqB,EAAKA,GAAO30B,EAAGq4B,IAEnC,OAAOxnB,KCIM,GAZcylB,SAAQ,SAAS8a,UAAU5R,EAAMnH,GAK5D,IAJA,IAAI1D,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACXmwC,EAAS,GAEN1c,EAAMxrB,IAAQq2B,EAAKnH,EAAK1D,KAC7B0c,EAAO7mC,KAAK6tB,EAAK1D,IACjBA,GAAO,EAGT,MAAO,CAAC0c,EAAQ1oC,MAAMtI,UAAUgK,MAAM3L,KAAK25B,EAAM1D,OCLpC,GAHe2B,SAAQ,SAAU+a,EAAQhZ,GACtD,OAAO,GAAO,GAAKgZ,EAAOnwC,OAAQm3B,GAAOgZ,MCI5B,GAHa/a,SAAQ,SAASlL,SAAS3lB,EAAGC,GACvD,OAAOixB,OAAOlxB,GAAKkxB,OAAOjxB,MCDb,GAHwB4wB,SAAQ,SAASgb,oBAAoBvG,EAAOC,GACjF,OAAO,GAAO,GAAWD,EAAOC,GAAQ,GAAWA,EAAOD,OCM7C,GAH4BzS,SAAQ,SAASiZ,wBAAwB/R,EAAMuL,EAAOC,GAC/F,OAAO,GAAO,GAAexL,EAAMuL,EAAOC,GAAQ,GAAexL,EAAMwL,EAAOD,OCQjE,GAPkBzU,SAAQ,SAASkb,cAAchuC,EAAIs/B,GAElE,IADA,IAAInO,EAAMmO,EAAG5hC,OAAS,EACfyzB,GAAO,GAAKnxB,EAAGs/B,EAAGnO,KACvBA,GAAO,EAET,OAAO,GAAMA,EAAM,EAAGoL,IAAU+C,MC7B9B,GAA0B,WAC5B,SAAS2O,WAAWprC,EAAG0yB,GACrBt1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EAQX,OANAorC,WAAWpxC,UAAU,qBAAuB+4B,EAAQ3lB,KACpDg+B,WAAWpxC,UAAU,uBAAyB+4B,EAAQvoB,OACtD4gC,WAAWpxC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAC5D,OAAO51B,KAAK4C,EAAEgzB,GAAS51B,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,GAASH,SAASroB,IAGzE4gC,WAXqB,GCsCf,GARcnb,QAAsBuC,cAAc,CAAC,aDhBnCvC,SAAQ,SAASob,YAAYrrC,EAAG0yB,GAC7D,OAAO,IAAI,GAAW1yB,EAAG0yB,OCekE,SAAS4Y,UAAUnuC,EAAIs/B,GAGlH,IAFA,IAAInO,EAAM,EACNxrB,EAAM25B,EAAG5hC,OACNyzB,EAAMxrB,GAAO3F,EAAGs/B,EAAGnO,KACxBA,GAAO,EAET,OAAO,GAAM,EAAGA,EAAKmO,OCrCnB,GAAoB,WACtB,SAAS8O,KAAKvrC,EAAG0yB,GACft1B,KAAKs1B,GAAKA,EACVt1B,KAAK4C,EAAIA,EASX,OAPAurC,KAAKvxC,UAAU,qBAAuB+4B,EAAQ3lB,KAC9Cm+B,KAAKvxC,UAAU,uBAAyB+4B,EAAQvoB,OAChD+gC,KAAKvxC,UAAU,qBAAuB,SAAUwQ,EAAQwoB,GAEtD,OADA51B,KAAK4C,EAAEgzB,GACA51B,KAAKs1B,GAAG,qBAAqBloB,EAAQwoB,IAGvCuY,KAZe,GCyBT,GAJQtb,QAAsBuC,cAAc,GDNlCvC,SAAQ,SAASub,MAAMxrC,EAAG0yB,GACjD,OAAO,IAAI,GAAK1yB,EAAG0yB,OCKiD,SAAS+Y,IAAItuC,EAAIkhB,GAErF,OADAlhB,EAAGkhB,GACIA,MCJT,IAMe,GANS4R,SAAQ,SAASngB,KAAK4oB,EAAS7Z,GACrD,ICvBa,SAAS6sB,UAAUrtB,GAChC,MAA6C,oBAAtCzlB,OAAOoB,UAAUmJ,SAAS9K,KAAKgmB,GDsBjCqtB,CAAUhT,GACb,MAAM,IAAIj+B,UAAU,0EAA4E,GAASi+B,IAE3G,OAAOD,aAAaC,GAAS5oB,KAAK+O,MERrB,GADY,GAAQ,EAAG,eCavB,GATYiR,SAAQ,SAAS6b,QAAQtxC,GAClD,IAAIwiC,EAAQ,GACZ,IAAK,IAAIvI,KAAQj6B,EACXg6B,KAAKC,EAAMj6B,KACbwiC,EAAMA,EAAMhiC,QAAU,CAACy5B,EAAMj6B,EAAIi6B,KAGrC,OAAOuI,KCEM,GAPc/M,SAAQ,SAAS8b,UAAUvxC,GACtD,IAAIwiC,EAAQ,GACZ,IAAK,IAAIvI,KAAQj6B,EACfwiC,EAAMA,EAAMhiC,QAAU,CAACy5B,EAAMj6B,EAAIi6B,IAEnC,OAAOuI,KCVM,GADY,GAAQ,EAAG,eCqCvB,GAHc,EAAO,GAAG,SAASgP,UAAUnZ,EAAIv1B,EAAIq2B,EAAKxB,GACrE,OAAOgC,QAAQtB,EAAiB,mBAAPv1B,EAAoBs2B,OAAOt2B,GAAMA,GAAKq2B,EAAKxB,MCTvD,GAjBclC,SAAQ,SAASgc,UAAUC,GAGtD,IAFA,IAAI7zC,EAAI,EACJsS,EAAS,GACNtS,EAAI6zC,EAAUlxC,QAAQ,CAG3B,IAFA,IAAImxC,EAAYD,EAAU7zC,GACtB6L,EAAI,EACDA,EAAIioC,EAAUnxC,aACM,IAAd2P,EAAOzG,KAChByG,EAAOzG,GAAK,IAEdyG,EAAOzG,GAAGI,KAAK6nC,EAAUjoC,IACzBA,GAAK,EAEP7L,GAAK,EAEP,OAAOsS,KCRM,GAHaynB,SAAQ,SAASga,SAASxB,EAAIzqC,EAAG0qC,GAC3D,MAAuD,mBAAzCA,EAAY,yBAA0CA,EAAY,yBAAyB1qC,EAAGyqC,GAAM,GAASA,EAAI,EAAIzqC,EAAG0qC,OC7BpIwB,GAAK,iDA0BM,GADSpc,QAvB4B,mBAA1B7mB,OAAOjP,UAAUmyC,OAgBDD,GAAGC,QAjB7B,IAiBgEA,OAI5E,SAASA,KAAKttB,GAChB,OAAOA,EAAIstB,QAL4E,SAASA,KAAKttB,GACrG,IAAIutB,EAAU,IAAIzoC,OAAO,KAAOuoC,GAAK,KAAOA,GAAK,MAC7CG,EAAQ,IAAI1oC,OAAO,IAAMuoC,GAAK,KAAOA,GAAK,OAC9C,OAAOrtB,EAAImC,QAAQorB,EAAS,IAAIprB,QAAQqrB,EAAO,MCWlC,GATapc,SAAQ,SAASqc,UAAUC,EAAOC,GAC5D,OAAO5b,OAAO2b,EAAM1xC,QAAQ,WAC1B,IACE,OAAO0xC,EAAMhvC,MAAMH,KAAME,WACzB,MAAO6C,GACP,OAAOqsC,EAAQjvC,MAAMH,KAAMmzB,QAAQ,CAACpwB,GAAI7C,mBCC/B,GALYwyB,SAAQ,SAAS2c,QAAQtvC,GAClD,OAAO,WACL,OAAOA,EAAGmF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAW,QCMrC,GAHUwyB,SAAQ,SAAS4c,MAAMvvC,GAC9C,OAAO,GAAK,EAAGA,MCKF,GAfa8yB,SAAQ,SAAS0c,SAASC,EAAOzvC,GAC3D,OAAO,EAAOyvC,GAAO,WAKnB,IAJA,IAGIC,EAHAC,EAAe,EACf3zC,EAAQgE,EACRmxB,EAAM,EAEHwe,GAAgBF,GAA0B,mBAAVzzC,GACrC0zC,EAASC,IAAiBF,EAAQtvC,UAAUzC,OAASyzB,EAAMn1B,EAAM0B,OACjE1B,EAAQA,EAAMoE,MAAMH,KAAMkF,MAAMtI,UAAUgK,MAAM3L,KAAKiF,UAAWgxB,EAAKue,IACrEC,GAAgB,EAChBxe,EAAMue,EAER,OAAO1zC,QCEI,GATW82B,SAAQ,SAAS8c,OAAO5vC,EAAI6vC,GAGpD,IAFA,IAAIlQ,EAAO3/B,EAAG6vC,GACVxiC,EAAS,GACNsyB,GAAQA,EAAKjiC,QAClB2P,EAAOA,EAAO3P,QAAUiiC,EAAK,GAC7BA,EAAO3/B,EAAG2/B,EAAK,IAEjB,OAAOtyB,KCXM,GADUylB,QAAsB2J,QAAQ,GAAMrJ,UCiB9C,GAdaN,SAAQ,SAASgd,SAAS9T,EAAMnH,GAK1D,IAJA,IAGI4C,EAHAtG,EAAM,EACNxrB,EAAMkvB,EAAKn3B,OACX2P,EAAS,GAEN8jB,EAAMxrB,GAENq3B,cAAchB,EADnBvE,EAAO5C,EAAK1D,GACmB9jB,KAC7BA,EAAOA,EAAO3P,QAAU+5B,GAE1BtG,GAAO,EAET,OAAO9jB,KCRM,GAHcynB,SAAQ,SAASib,UAAU/T,EAAMuL,EAAOC,GACnE,OAAO,GAASxL,EAAM5I,QAAQmU,EAAOC,OCExB,GAHW1S,SAAQ,SAASkb,OAAOhU,EAAMiU,EAAa/uB,GACnE,OAAO8a,EAAK9a,GAAKA,EAAI+uB,EAAY/uB,MCNpB,GADW,GAAM+kB,WCQjB,GAPUnR,SAAQ,SAASob,MAAMlU,EAAMh8B,EAAIiQ,GAExD,IADA,IAAI3E,EAAM2E,GACF+rB,EAAK1wB,IACXA,EAAMtL,EAAGsL,GAEX,OAAOA,KCKM,GARaqnB,SAAQ,SAASwd,SAASjzC,GACpD,IAAIi6B,EACAiZ,EAAK,GACT,IAAKjZ,KAAQj6B,EACXkzC,EAAGA,EAAG1yC,QAAUR,EAAIi6B,GAEtB,OAAOiZ,KC1BLC,MAAQ,SAAUnvB,GACpB,MAAO,CAAEllB,MAAOklB,EAAG,mBAAoB,WACnC,OAAOjhB,QA8BE,GALS6yB,SAAQ,SAASwd,KAAKtH,EAAM9nB,GAGlD,OAAO8nB,EAAKqH,MAALrH,CAAY9nB,GAAGllB,SCAT,GAHS84B,SAAQ,SAASyb,KAAKvU,EAAMwU,EAAYtvB,GAC9D,OAAO8a,EAAK9a,GAAKsvB,EAAWtvB,GAAKA,KCepB,GARU4R,SAAQ,SAAS2d,MAAMrX,EAAMsX,GACpD,IAAK,IAAIvZ,KAAQiC,EACf,GAAIlC,KAAKC,EAAMiC,KAAUA,EAAKjC,GAAMuZ,EAAQvZ,IAC1C,OAAO,EAGX,OAAO,KCRM,GAHYrE,SAAQ,SAAS6d,QAAQvX,EAAMsX,GACxD,OAAO,GAAM,EAAI,GAAQtX,GAAOsX,MCPnB,GAHY5d,SAAQ,SAAUwM,EAAIzK,GAC/C,OAAO,GAAO,GAAKoJ,UAAL,CAAgBqB,GAAKzK,MCYtB,GAjBU/B,SAAQ,SAAS8d,MAAM3uC,EAAGC,GAOjD,IALA,IAEI0E,EAFAuqB,EAAM,EACNyJ,EAAO34B,EAAEvE,OAETi9B,EAAOz4B,EAAExE,OACT2P,EAAS,GACN8jB,EAAMyJ,GAAM,CAEjB,IADAh0B,EAAI,EACGA,EAAI+zB,GACTttB,EAAOA,EAAO3P,QAAU,CAACuE,EAAEkvB,GAAMjvB,EAAE0E,IACnCA,GAAK,EAEPuqB,GAAO,EAET,OAAO9jB,KCJM,GAVQylB,SAAQ,SAAS+d,IAAI5uC,EAAGC,GAI7C,IAHA,IAAI4uC,EAAK,GACL3f,EAAM,EACNxrB,EAAMpD,KAAKwS,IAAI9S,EAAEvE,OAAQwE,EAAExE,QACxByzB,EAAMxrB,GACXmrC,EAAG3f,GAAO,CAAClvB,EAAEkvB,GAAMjvB,EAAEivB,IACrBA,GAAO,EAET,OAAO2f,KCAM,GAVWhe,SAAQ,SAASie,OAAO1oC,EAAMmO,GAItD,IAHA,IAAI2a,EAAM,EACNxrB,EAAMpD,KAAKwS,IAAI1M,EAAK3K,OAAQ8Y,EAAO9Y,QACnCwD,EAAM,GACHiwB,EAAMxrB,GACXzE,EAAImH,EAAK8oB,IAAQ3a,EAAO2a,GACxBA,GAAO,EAET,OAAOjwB,KCSM,GAVY4zB,SAAQ,SAASkc,QAAQhxC,EAAIiC,EAAGC,GAIzD,IAHA,IAAI4uC,EAAK,GACL3f,EAAM,EACNxrB,EAAMpD,KAAKwS,IAAI9S,EAAEvE,OAAQwE,EAAExE,QACxByzB,EAAMxrB,GACXmrC,EAAG3f,GAAOnxB,EAAGiC,EAAEkvB,GAAMjvB,EAAEivB,IACvBA,GAAO,EAET,OAAO2f,M,8IClCT,SACA,QAYA,YACA,YACA,YACA,YACA,YACA,YACA,Y,+mBAEe,CACbG,UAAW,mBAAS/4B,EAAT,GAA2D,YAAxCg5B,eAAwC,MAA9B,UAA8B,MAAnBC,eAAmB,SAC9DC,EAAoB,CACxBC,MAAOjuC,EAAQ,KACfkuC,QAASluC,EAAQ,MAGnB,IACEguC,EAAkBG,QAAUnuC,EAAQ,KACpC,MAAO/C,IAIT,IAAMmxC,EAAwB,WAAXN,EAAuB,UAAYA,EAEhDO,GAAY,qBACfC,MAAM,CACLC,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,WAAYia,GAC9BQ,IAAKxuC,EAAQ,QAHC,eAKfyuC,MAAM,CACLF,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,WAAYia,GAC9BQ,IAAKxuC,EAAQ,OAPC,GAWZ0uC,EAAe,eAAH,qBACfC,QAAQ,CACPJ,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,WAAYia,GAE9BQ,IAAKxuC,EAAQ,QAJC,eAMf4uC,qBAAqB,CACpBL,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,sBAAuBia,GACzCQ,IAAKxuC,EAAQ,QARC,eAUf6uC,UAAU,CACTN,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,WAAYia,GAC9BQ,IAAKxuC,EAAQ,QAZC,eAcf8uC,gBAAgB,CACfP,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,iBAAkBia,GACpCQ,IAAKxuC,EAAQ,QAhBC,eAkBf+uC,QAAQ,CACPR,SAAS,IAAAtsC,MAAI,IAAA8xB,MAAK,SAAUia,GAC5BQ,IAAKxuC,EAAQ,OApBC,GAsBbquC,GAsCL,OAnCoB,cAAH,iBACZv5B,GADY,IAEfk6B,mBAAoB,CAClB,QACA,YACA,mBACA,aACA,cACA,MACA,SAEFC,MAAO,CAACC,WACRC,UAAW,CAACC,WACZC,iBAAkB,CAACC,WACnBC,WAAY,CAACC,WACbC,YAAa,CAACC,UAAoB,CAAE3B,YACpC4B,IAAK,CAACC,WACNC,MAAO,CAACC,WACRC,cAAe,CAAErB,gBACjBsB,MAAO,CACLC,MAAO,CACL,CACEC,SAAU/yC,MACV0S,OAAQ1S,MAAI0S,OACZ0+B,QAASP,EAAkBI,GAAY+B,SAEzC,CACED,SAAU7yC,MACVwS,OAAQxS,MAAIwS,OACZ0+B,QAASP,EAAkBI,GAAYgC,e,6BCrGnD,EAAQ,KACRh5C,EAAOD,QAAU,EAAQ,GAAuBkB,OAAOg4C,Q,gBCAvD,IAAI3yC,EAAU,EAAQ,IAEtBA,EAAQA,EAAQU,EAAIV,EAAQM,EAAG,SAAU,CAAEqyC,OAAQ,EAAQ,Q,cCH3Dj5C,EAAOD,QAAU,SAAU4I,GACzB,GAAiB,mBAANA,EAAkB,MAAM7F,UAAU6F,EAAK,uBAClD,OAAOA,I,gBCAT,IAAIuwC,EAAc,EAAQ,IACtBC,EAAU,EAAQ,IAClBC,EAAO,EAAQ,IACfv8B,EAAM,EAAQ,IACdrC,EAAW,EAAQ,IACnBjR,EAAU,EAAQ,IAClB8vC,EAAUp4C,OAAOg4C,OAGrBj5C,EAAOD,SAAWs5C,GAAW,EAAQ,GAAR,EAAoB,WAC/C,IAAIC,EAAI,GACJlyC,EAAI,GAEJJ,EAAI1F,SACJi4C,EAAI,uBAGR,OAFAD,EAAEtyC,GAAK,EACPuyC,EAAExtC,MAAM,IAAIG,SAAQ,SAAUxB,GAAKtD,EAAEsD,GAAKA,KACd,GAArB2uC,EAAQ,GAAIC,GAAGtyC,IAAW/F,OAAO4M,KAAKwrC,EAAQ,GAAIjyC,IAAIqF,KAAK,KAAO8sC,KACtE,SAASN,OAAOj2C,EAAQwD,GAM3B,IALA,IAAIgzC,EAAIh/B,EAASxX,GACby2C,EAAO9zC,UAAUzC,OACjByO,EAAQ,EACR+nC,EAAaN,EAAK/wC,EAClBsxC,EAAS98B,EAAIxU,EACVoxC,EAAO9nC,GAMZ,IALA,IAII7P,EAJAkF,EAAIuC,EAAQ5D,UAAUgM,MACtB9D,EAAO6rC,EAAaP,EAAQnyC,GAAG8D,OAAO4uC,EAAW1yC,IAAMmyC,EAAQnyC,GAC/D9D,EAAS2K,EAAK3K,OACdkJ,EAAI,EAEDlJ,EAASkJ,GACdtK,EAAM+L,EAAKzB,KACN8sC,IAAeS,EAAOj5C,KAAKsG,EAAGlF,KAAM03C,EAAE13C,GAAOkF,EAAElF,IAEtD,OAAO03C,GACPH,G,gBCnCJ,IAAIn/B,EAAY,EAAQ,IACpB0/B,EAAW,EAAQ,IACnBC,EAAkB,EAAQ,KAC9B75C,EAAOD,QAAU,SAAU+5C,GACzB,OAAO,SAAUC,EAAOtb,EAAIoD,GAC1B,IAGIrgC,EAHA8G,EAAI4R,EAAU6/B,GACd72C,EAAS02C,EAAStxC,EAAEpF,QACpByO,EAAQkoC,EAAgBhY,EAAW3+B,GAIvC,GAAI42C,GAAerb,GAAMA,GAAI,KAAOv7B,EAASyO,GAG3C,IAFAnQ,EAAQ8G,EAAEqJ,OAEGnQ,EAAO,OAAO,OAEtB,KAAM0B,EAASyO,EAAOA,IAAS,IAAImoC,GAAenoC,KAASrJ,IAC5DA,EAAEqJ,KAAW8sB,EAAI,OAAOqb,GAAenoC,GAAS,EACpD,OAAQmoC,IAAgB,K,gBCpB9B,IAAIx/B,EAAY,EAAQ,IACpByM,EAAMhf,KAAKgf,IACXxM,EAAMxS,KAAKwS,IACfva,EAAOD,QAAU,SAAU4R,EAAOzO,GAEhC,OADAyO,EAAQ2I,EAAU3I,IACH,EAAIoV,EAAIpV,EAAQzO,EAAQ,GAAKqX,EAAI5I,EAAOzO,K,gBCLzD,EAAQ,KACRlD,EAAOD,QAAU,EAAQ,GAAuBkB,OAAO0C,gB,gBCAvD,IAAI6W,EAAW,EAAQ,IACnBw/B,EAAkB,EAAQ,IAE9B,EAAQ,IAAR,CAAyB,kBAAkB,WACzC,OAAO,SAASr2C,eAAegF,GAC7B,OAAOqxC,EAAgBx/B,EAAS7R,S,gBCLpC,IAAIrC,EAAU,EAAQ,IAClBzC,EAAO,EAAQ,GACfo2C,EAAQ,EAAQ,IACpBj6C,EAAOD,QAAU,SAAUm6C,EAAK5wC,GAC9B,IAAI9D,GAAM3B,EAAK5C,QAAU,IAAIi5C,IAAQj5C,OAAOi5C,GACxCjoB,EAAM,GACVA,EAAIioB,GAAO5wC,EAAK9D,GAChBc,EAAQA,EAAQU,EAAIV,EAAQM,EAAIqzC,GAAM,WAAcz0C,EAAG,MAAQ,SAAUysB,K,gBCR3EjyB,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAAuC4B,YAAY,I,gBCAzF,EAAQ,IACR,EAAQ,IACR3B,EAAOD,QAAU,EAAQ,IAA0BsI,EAAE,a,gBCFrD,IAAIiS,EAAY,EAAQ,IACpB9Q,EAAU,EAAQ,IAGtBxJ,EAAOD,QAAU,SAAUo6C,GACzB,OAAO,SAAUtpC,EAAMutB,GACrB,IAGI32B,EAAGC,EAHHlF,EAAI8O,OAAO9H,EAAQqH,IACnBtQ,EAAI+Z,EAAU8jB,GACd59B,EAAIgC,EAAEU,OAEV,OAAI3C,EAAI,GAAKA,GAAKC,EAAU25C,EAAY,QAAKr0C,GAC7C2B,EAAIjF,EAAEgkB,WAAWjmB,IACN,OAAUkH,EAAI,OAAUlH,EAAI,IAAMC,IAAMkH,EAAIlF,EAAEgkB,WAAWjmB,EAAI,IAAM,OAAUmH,EAAI,MACxFyyC,EAAY33C,EAAEkJ,OAAOnL,GAAKkH,EAC1B0yC,EAAY33C,EAAE6J,MAAM9L,EAAGA,EAAI,GAA2BmH,EAAI,OAAzBD,EAAI,OAAU,IAAqB,S,gBCb5E,IAAI5F,EAAS,EAAQ,IACjBsB,EAAa,EAAQ,IACrB8X,EAAiB,EAAQ,IACzBW,EAAoB,GAGxB,EAAQ,GAAR,CAAmBA,EAAmB,EAAQ,EAAR,CAAkB,aAAa,WAAc,OAAOnW,QAE1FzF,EAAOD,QAAU,SAAU8C,EAAayY,EAAMC,GAC5C1Y,EAAYR,UAAYR,EAAO+Z,EAAmB,CAAEL,KAAMpY,EAAW,EAAGoY,KACxEN,EAAepY,EAAayY,EAAO,e,gBCXrC,IAAIlT,EAAK,EAAQ,IACbH,EAAW,EAAQ,IACnBkxC,EAAU,EAAQ,IAEtBn5C,EAAOD,QAAU,EAAQ,IAAoBkB,OAAOm5C,iBAAmB,SAASA,iBAAiB9xC,EAAGsK,GAClG3K,EAASK,GAKT,IAJA,IAGIpB,EAHA2G,EAAOsrC,EAAQvmC,GACf1P,EAAS2K,EAAK3K,OACd3C,EAAI,EAED2C,EAAS3C,GAAG6H,EAAGC,EAAEC,EAAGpB,EAAI2G,EAAKtN,KAAMqS,EAAW1L,IACrD,OAAOoB,I,gBCXT,IAAIiK,EAAW,EAAQ,IAAaA,SACpCvS,EAAOD,QAAUwS,GAAYA,EAAS8nC,iB,gBCAtC,IAAIC,EAAmB,EAAQ,KAC3Bv3B,EAAO,EAAQ,KACfhI,EAAY,EAAQ,IACpBb,EAAY,EAAQ,IAMxBla,EAAOD,QAAU,EAAQ,GAAR,CAA0B4K,MAAO,SAAS,SAAU4G,EAAUuK,GAC7ErW,KAAK+L,GAAK0I,EAAU3I,GACpB9L,KAAKgM,GAAK,EACVhM,KAAK80C,GAAKz+B,KAET,WACD,IAAIxT,EAAI7C,KAAK+L,GACTsK,EAAOrW,KAAK80C,GACZ5oC,EAAQlM,KAAKgM,KACjB,OAAKnJ,GAAKqJ,GAASrJ,EAAEpF,QACnBuC,KAAK+L,QAAK1L,EACHid,EAAK,IAEaA,EAAK,EAApB,QAARjH,EAA+BnK,EACvB,UAARmK,EAAiCxT,EAAEqJ,GACxB,CAACA,EAAOrJ,EAAEqJ,OACxB,UAGHoJ,EAAUy/B,UAAYz/B,EAAUpQ,MAEhC2vC,EAAiB,QACjBA,EAAiB,UACjBA,EAAiB,Y,cCjCjBt6C,EAAOD,QAAU,c,cCAjBC,EAAOD,QAAU,SAAUqF,EAAM5D,GAC/B,MAAO,CAAEA,MAAOA,EAAO4D,OAAQA,K,gBCDjCpF,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAA8B4B,YAAY,I,gBCAhF,EAAQ,KACR,EAAQ,KACR,EAAQ,KACR,EAAQ,KACR3B,EAAOD,QAAU,EAAQ,GAAuBuB,Q,gBCFhD,IAAI4E,EAAS,EAAQ,IACjBG,EAAM,EAAQ,IACd6yC,EAAc,EAAQ,IACtB5yC,EAAU,EAAQ,IAClBwU,EAAW,EAAQ,IACnB2/B,EAAO,EAAQ,KAAWP,IAC1BQ,EAAS,EAAQ,IACjBxpC,EAAS,EAAQ,IACjB+J,EAAiB,EAAQ,IACzBxW,EAAM,EAAQ,IACdk2C,EAAM,EAAQ,GACdxnC,EAAS,EAAQ,IACjBynC,EAAY,EAAQ,IACpBC,EAAW,EAAQ,KACnBl4B,EAAU,EAAQ,KAClB1a,EAAW,EAAQ,IACnBS,EAAW,EAAQ,IACnB8R,EAAW,EAAQ,IACnBN,EAAY,EAAQ,IACpB/R,EAAc,EAAQ,IACtBkB,EAAa,EAAQ,IACrByxC,EAAU,EAAQ,IAClBC,EAAU,EAAQ,KAClBC,EAAQ,EAAQ,IAChBC,EAAQ,EAAQ,IAChBC,EAAM,EAAQ,IACdvtC,EAAQ,EAAQ,IAChBmP,EAAOk+B,EAAM3yC,EACbD,EAAK8yC,EAAI7yC,EACT8yC,EAAOJ,EAAQ1yC,EACf+K,EAAUlN,EAAO5E,OACjB85C,EAAQl1C,EAAOm1C,KACfC,EAAaF,GAASA,EAAMG,UAE5BC,EAASb,EAAI,WACbc,EAAed,EAAI,eACnBhB,EAAS,GAAG3rC,qBACZ0tC,EAAiBxqC,EAAO,mBACxByqC,EAAazqC,EAAO,WACpB0qC,EAAY1qC,EAAO,cACnBuJ,EAAcxZ,OAAgB,UAC9B46C,EAA+B,mBAAXzoC,KAA2B6nC,EAAM5yC,EACrDyzC,EAAU51C,EAAO41C,QAEjBrN,GAAUqN,IAAYA,EAAiB,YAAMA,EAAiB,UAAEC,UAGhEC,EAAgB9C,GAAewB,GAAO,WACxC,OAES,GAFFI,EAAQ1yC,EAAG,GAAI,IAAK,CACzBhH,IAAK,WAAc,OAAOgH,EAAG3C,KAAM,IAAK,CAAEjE,MAAO,IAAKiG,MACpDA,KACD,SAAUkB,EAAI7G,EAAKm6C,GACtB,IAAIC,EAAYp/B,EAAKrC,EAAa3Y,GAC9Bo6C,UAAkBzhC,EAAY3Y,GAClCsG,EAAGO,EAAI7G,EAAKm6C,GACRC,GAAavzC,IAAO8R,GAAarS,EAAGqS,EAAa3Y,EAAKo6C,IACxD9zC,EAEAuc,KAAO,SAAU3R,GACnB,IAAImpC,EAAMR,EAAW3oC,GAAO8nC,EAAQ1nC,EAAiB,WAErD,OADA+oC,EAAI5B,GAAKvnC,EACFmpC,GAGLxkB,EAAWkkB,GAAyC,iBAApBzoC,EAAQ3K,SAAuB,SAAUE,GAC3E,MAAoB,iBAANA,GACZ,SAAUA,GACZ,OAAOA,aAAcyK,GAGnBgpC,GAAkB,SAASl7C,eAAeyH,EAAI7G,EAAKm6C,GAKrD,OAJItzC,IAAO8R,GAAa2hC,GAAgBR,EAAW95C,EAAKm6C,GACxDh0C,EAASU,GACT7G,EAAMqG,EAAYrG,GAAK,GACvBmG,EAASg0C,GACL51C,EAAIs1C,EAAY75C,IACbm6C,EAAE96C,YAIDkF,EAAIsC,EAAI6yC,IAAW7yC,EAAG6yC,GAAQ15C,KAAM6G,EAAG6yC,GAAQ15C,IAAO,GAC1Dm6C,EAAInB,EAAQmB,EAAG,CAAE96C,WAAYkI,EAAW,GAAG,OAJtChD,EAAIsC,EAAI6yC,IAASpzC,EAAGO,EAAI6yC,EAAQnyC,EAAW,EAAG,KACnDV,EAAG6yC,GAAQ15C,IAAO,GAIXk6C,EAAcrzC,EAAI7G,EAAKm6C,IACzB7zC,EAAGO,EAAI7G,EAAKm6C,IAEnBI,GAAoB,SAASjC,iBAAiBzxC,EAAIzB,GACpDe,EAASU,GAKT,IAJA,IAGI7G,EAHA+L,EAAOgtC,EAAS3zC,EAAIgT,EAAUhT,IAC9B3G,EAAI,EACJC,EAAIqN,EAAK3K,OAEN1C,EAAID,GAAG67C,GAAgBzzC,EAAI7G,EAAM+L,EAAKtN,KAAM2G,EAAEpF,IACrD,OAAO6G,GAKL2zC,GAAwB,SAAStuC,qBAAqBlM,GACxD,IAAIy6C,EAAI5C,EAAOj5C,KAAK+E,KAAM3D,EAAMqG,EAAYrG,GAAK,IACjD,QAAI2D,OAASgV,GAAepU,EAAIs1C,EAAY75C,KAASuE,EAAIu1C,EAAW95C,QAC7Dy6C,IAAMl2C,EAAIZ,KAAM3D,KAASuE,EAAIs1C,EAAY75C,IAAQuE,EAAIZ,KAAM+1C,IAAW/1C,KAAK+1C,GAAQ15C,KAAOy6C,IAE/FC,GAA4B,SAASjlC,yBAAyB5O,EAAI7G,GAGpE,GAFA6G,EAAKuR,EAAUvR,GACf7G,EAAMqG,EAAYrG,GAAK,GACnB6G,IAAO8R,IAAepU,EAAIs1C,EAAY75C,IAASuE,EAAIu1C,EAAW95C,GAAlE,CACA,IAAIm6C,EAAIn/B,EAAKnU,EAAI7G,GAEjB,OADIm6C,IAAK51C,EAAIs1C,EAAY75C,IAAUuE,EAAIsC,EAAI6yC,IAAW7yC,EAAG6yC,GAAQ15C,KAAOm6C,EAAE96C,YAAa,GAChF86C,IAELQ,GAAuB,SAAS7/B,oBAAoBjU,GAKtD,IAJA,IAGI7G,EAHAsY,EAAQ+gC,EAAKjhC,EAAUvR,IACvBkK,EAAS,GACTtS,EAAI,EAED6Z,EAAMlX,OAAS3C,GACf8F,EAAIs1C,EAAY75C,EAAMsY,EAAM7Z,OAASuB,GAAO05C,GAAU15C,GAAO24C,GAAM5nC,EAAOrG,KAAK1K,GACpF,OAAO+Q,GAEP6pC,GAAyB,SAAStrC,sBAAsBzI,GAM1D,IALA,IAII7G,EAJA66C,EAAQh0C,IAAO8R,EACfL,EAAQ+gC,EAAKwB,EAAQf,EAAY1hC,EAAUvR,IAC3CkK,EAAS,GACTtS,EAAI,EAED6Z,EAAMlX,OAAS3C,IAChB8F,EAAIs1C,EAAY75C,EAAMsY,EAAM7Z,OAAUo8C,IAAQt2C,EAAIoU,EAAa3Y,IAAc+Q,EAAOrG,KAAKmvC,EAAW75C,IACxG,OAAO+Q,GAINgpC,IAYH/gC,GAXA1H,EAAU,SAAS9R,SACjB,GAAImE,gBAAgB2N,EAAS,MAAMtQ,UAAU,gCAC7C,IAAIkQ,EAAMvO,EAAIkB,UAAUzC,OAAS,EAAIyC,UAAU,QAAKG,GAChD82C,KAAO,SAAUp7C,GACfiE,OAASgV,GAAamiC,KAAKl8C,KAAKk7C,EAAWp6C,GAC3C6E,EAAIZ,KAAM+1C,IAAWn1C,EAAIZ,KAAK+1C,GAASxoC,KAAMvN,KAAK+1C,GAAQxoC,IAAO,GACrEgpC,EAAcv2C,KAAMuN,EAAK3J,EAAW,EAAG7H,KAGzC,OADI03C,GAAezK,GAAQuN,EAAcvhC,EAAazH,EAAK,CAAE5P,cAAc,EAAM2T,IAAK6lC,OAC/Ej4B,KAAK3R,KAEY,UAAG,YAAY,SAASxH,WAChD,OAAO/F,KAAK80C,MAGdS,EAAM3yC,EAAIm0C,GACVtB,EAAI7yC,EAAI+zC,GACR,EAAQ,IAAkB/zC,EAAI0yC,EAAQ1yC,EAAIo0C,GAC1C,EAAQ,IAAiBp0C,EAAIi0C,GAC7BrB,EAAM5yC,EAAIq0C,GAENxD,IAAgB,EAAQ,KAC1Bp+B,EAASL,EAAa,uBAAwB6hC,IAAuB,GAGvEnpC,EAAO9K,EAAI,SAAUvH,GACnB,OAAO6jB,KAAKg2B,EAAI75C,MAIpBwF,EAAQA,EAAQQ,EAAIR,EAAQgB,EAAIhB,EAAQM,GAAKi1C,EAAY,CAAEv6C,OAAQ8R,IAEnE,IAAK,IAAIypC,GAAa,iHAGpB9wC,MAAM,KAAMK,GAAI,EAAGywC,GAAW35C,OAASkJ,IAAGuuC,EAAIkC,GAAWzwC,OAE3D,IAAK,IAAI0wC,GAAmBnvC,EAAMgtC,EAAIn2C,OAAQkG,GAAI,EAAGoyC,GAAiB55C,OAASwH,IAAIkwC,EAAUkC,GAAiBpyC,OAE9GpE,EAAQA,EAAQU,EAAIV,EAAQM,GAAKi1C,EAAY,SAAU,CAErD,IAAO,SAAU/5C,GACf,OAAOuE,EAAIq1C,EAAgB55C,GAAO,IAC9B45C,EAAe55C,GACf45C,EAAe55C,GAAOsR,EAAQtR,IAGpCi7C,OAAQ,SAASA,OAAOZ,GACtB,IAAKxkB,EAASwkB,GAAM,MAAMr5C,UAAUq5C,EAAM,qBAC1C,IAAK,IAAIr6C,KAAO45C,EAAgB,GAAIA,EAAe55C,KAASq6C,EAAK,OAAOr6C,GAE1Ek7C,UAAW,WAAcvO,GAAS,GAClCwO,UAAW,WAAcxO,GAAS,KAGpCnoC,EAAQA,EAAQU,EAAIV,EAAQM,GAAKi1C,EAAY,SAAU,CAErDh6C,OA/FY,SAASA,OAAO8G,EAAIzB,GAChC,YAAapB,IAANoB,EAAkB4zC,EAAQnyC,GAAM0zC,GAAkBvB,EAAQnyC,GAAKzB,IAgGtEhG,eAAgBk7C,GAEhBhC,iBAAkBiC,GAElB9kC,yBAA0BilC,GAE1B5/B,oBAAqB6/B,GAErBrrC,sBAAuBsrC,KAKzB,IAAIQ,GAAsBxC,GAAO,WAAcO,EAAM5yC,EAAE,MAEvD/B,EAAQA,EAAQU,EAAIV,EAAQM,EAAIs2C,GAAqB,SAAU,CAC7D9rC,sBAAuB,SAASA,sBAAsBzI,GACpD,OAAOsyC,EAAM5yC,EAAEmS,EAAS7R,OAK5ByyC,GAAS90C,EAAQA,EAAQU,EAAIV,EAAQM,IAAMi1C,GAAcnB,GAAO,WAC9D,IAAI1zC,EAAIoM,IAIR,MAA0B,UAAnBkoC,EAAW,CAACt0C,KAA2C,MAAxBs0C,EAAW,CAAE7zC,EAAGT,KAAyC,MAAzBs0C,EAAWr6C,OAAO+F,QACrF,OAAQ,CACXu0C,UAAW,SAASA,UAAU5yC,GAI5B,IAHA,IAEIw0C,EAAUC,EAFV13C,EAAO,CAACiD,GACRpI,EAAI,EAEDoF,UAAUzC,OAAS3C,GAAGmF,EAAK8G,KAAK7G,UAAUpF,MAEjD,GADA68C,EAAYD,EAAWz3C,EAAK,IACvBgD,EAASy0C,SAAoBr3C,IAAP6C,KAAoBgvB,EAAShvB,GAMxD,OALKga,EAAQw6B,KAAWA,EAAW,SAAUr7C,EAAKN,GAEhD,GADwB,mBAAb47C,IAAyB57C,EAAQ47C,EAAU18C,KAAK+E,KAAM3D,EAAKN,KACjEm2B,EAASn2B,GAAQ,OAAOA,IAE/BkE,EAAK,GAAKy3C,EACH7B,EAAW11C,MAAMw1C,EAAO11C,MAKnC0N,EAAiB,UAAEqoC,IAAiB,EAAQ,GAAR,CAAmBroC,EAAiB,UAAGqoC,EAAcroC,EAAiB,UAAErC,SAE5GkK,EAAe7H,EAAS,UAExB6H,EAAelT,KAAM,QAAQ,GAE7BkT,EAAe/U,EAAOm1C,KAAM,QAAQ,I,gBCrPpC,IAAIZ,EAAO,EAAQ,GAAR,CAAkB,QACzB/xC,EAAW,EAAQ,IACnBrC,EAAM,EAAQ,IACdg3C,EAAU,EAAQ,IAAgBh1C,EAClC2B,EAAK,EACLszC,EAAer8C,OAAOq8C,cAAgB,WACxC,OAAO,GAELC,GAAU,EAAQ,GAAR,EAAoB,WAChC,OAAOD,EAAar8C,OAAOu8C,kBAAkB,QAE3CC,QAAU,SAAU90C,GACtB00C,EAAQ10C,EAAI8xC,EAAM,CAAEj5C,MAAO,CACzBjB,EAAG,OAAQyJ,EACX0zC,EAAG,OAgCHC,EAAO39C,EAAOD,QAAU,CAC1Bm6C,IAAKO,EACLmD,MAAM,EACNC,QAhCY,SAAUl1C,EAAI9G,GAE1B,IAAK6G,EAASC,GAAK,MAAoB,iBAANA,EAAiBA,GAAmB,iBAANA,EAAiB,IAAM,KAAOA,EAC7F,IAAKtC,EAAIsC,EAAI8xC,GAAO,CAElB,IAAK6C,EAAa30C,GAAK,MAAO,IAE9B,IAAK9G,EAAQ,MAAO,IAEpB47C,QAAQ90C,GAER,OAAOA,EAAG8xC,GAAMl6C,GAsBlBu9C,QApBY,SAAUn1C,EAAI9G,GAC1B,IAAKwE,EAAIsC,EAAI8xC,GAAO,CAElB,IAAK6C,EAAa30C,GAAK,OAAO,EAE9B,IAAK9G,EAAQ,OAAO,EAEpB47C,QAAQ90C,GAER,OAAOA,EAAG8xC,GAAMiD,GAYlBK,SATa,SAAUp1C,GAEvB,OADI40C,GAAUI,EAAKC,MAAQN,EAAa30C,KAAQtC,EAAIsC,EAAI8xC,IAAOgD,QAAQ90C,GAChEA,K,gBC3CT,IAAIwwC,EAAU,EAAQ,IAClBC,EAAO,EAAQ,IACfv8B,EAAM,EAAQ,IAClB7c,EAAOD,QAAU,SAAU4I,GACzB,IAAIkK,EAASsmC,EAAQxwC,GACjB+wC,EAAaN,EAAK/wC,EACtB,GAAIqxC,EAKF,IAJA,IAGI53C,EAHAk8C,EAAUtE,EAAW/wC,GACrBgxC,EAAS98B,EAAIxU,EACb9H,EAAI,EAEDy9C,EAAQ96C,OAAS3C,GAAOo5C,EAAOj5C,KAAKiI,EAAI7G,EAAMk8C,EAAQz9C,OAAOsS,EAAOrG,KAAK1K,GAChF,OAAO+Q,I,gBCZX,IAAIwH,EAAM,EAAQ,IAClBra,EAAOD,QAAU4K,MAAMgY,SAAW,SAASA,QAAQ1d,GACjD,MAAmB,SAAZoV,EAAIpV,K,gBCFb,IAAIiV,EAAY,EAAQ,IACpBihC,EAAO,EAAQ,IAAkB9yC,EACjCmD,EAAW,GAAGA,SAEdyyC,EAA+B,iBAAV99C,QAAsBA,QAAUc,OAAO2b,oBAC5D3b,OAAO2b,oBAAoBzc,QAAU,GAUzCH,EAAOD,QAAQsI,EAAI,SAASuU,oBAAoBjU,GAC9C,OAAOs1C,GAAoC,mBAArBzyC,EAAS9K,KAAKiI,GATjB,SAAUA,GAC7B,IACE,OAAOwyC,EAAKxyC,GACZ,MAAOH,GACP,OAAOy1C,EAAY5xC,SAK0C6xC,CAAev1C,GAAMwyC,EAAKjhC,EAAUvR,M,gCCjBrG,EAAQ,GAAR,CAAyB,kB,gBCAzB,EAAQ,GAAR,CAAyB,e,gBCAzB3I,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAA+C4B,YAAY,I,gBCAjG,EAAQ,KACR3B,EAAOD,QAAU,EAAQ,GAAuBkB,OAAOyC,gB,gBCAvD,IAAI4C,EAAU,EAAQ,IACtBA,EAAQA,EAAQU,EAAG,SAAU,CAAEtD,eAAgB,EAAQ,KAAgBqT,O,gBCAvE,IAAIrO,EAAW,EAAQ,IACnBT,EAAW,EAAQ,IACnBk2C,MAAQ,SAAU71C,EAAGyT,GAEvB,GADA9T,EAASK,IACJI,EAASqT,IAAoB,OAAVA,EAAgB,MAAMjZ,UAAUiZ,EAAQ,8BAElE/b,EAAOD,QAAU,CACfgX,IAAK9V,OAAOyC,iBAAmB,aAAe,GAC5C,SAAUyU,EAAMimC,EAAOrnC,GACrB,KACEA,EAAM,EAAQ,GAAR,CAAkBpP,SAASjH,KAAM,EAAQ,IAAkB2H,EAAEpH,OAAOoB,UAAW,aAAa0U,IAAK,IACnGoB,EAAM,IACVimC,IAAUjmC,aAAgBxN,OAC1B,MAAOnC,GAAK41C,GAAQ,EACtB,OAAO,SAAS16C,eAAe4E,EAAGyT,GAIhC,OAHAoiC,MAAM71C,EAAGyT,GACLqiC,EAAO91C,EAAE1E,UAAYmY,EACpBhF,EAAIzO,EAAGyT,GACLzT,GAVX,CAYE,IAAI,QAASxC,GACjBq4C,MAAOA,Q,gBCvBTn+C,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAAqC4B,YAAY,I,gBCAvF,EAAQ,KACR,IAAI08C,EAAU,EAAQ,GAAuBp9C,OAC7CjB,EAAOD,QAAU,SAAS8B,OAAOqF,EAAG+0C,GAClC,OAAOoC,EAAQx8C,OAAOqF,EAAG+0C,K,gBCH3B,IAAI31C,EAAU,EAAQ,IAEtBA,EAAQA,EAAQU,EAAG,SAAU,CAAEnF,OAAQ,EAAQ,O,gBCA/CZ,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAQ4Z,cAAgB5Z,EAAQqY,cAAWtS,EAE3C,IAEIw4C,EAAgB77C,uBAFA,EAAQ,MAMxB87C,EAAY97C,uBAFA,EAAQ,MAMpB4V,EAAW5V,uBAFD,EAAQ,KAMlBoR,EAAmBpR,uBAFD,EAAQ,KAM1B8V,EAA8B9V,uBAFA,EAAQ,KAMtC+V,EAAa/V,uBAFA,EAAQ,KAMrB6V,EAAmB7V,uBAFA,EAAQ,KAM3B+7C,EAAgB/7C,uBAFA,EAAQ,MAMxBg8C,EAAch8C,uBAFD,EAAQ,MAIzB,SAASA,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAEvF,SAASg8C,kBAAkB/lC,GACzB,GAAIA,aAAkBP,GAA0C,mBAAvBO,EAAOgmC,YAA4B,OAAOhmC,EAAOgmC,cAE1F,IAAIn9C,GAAQ,EAAIi9C,EAAY1lC,SAASJ,GACrC,GAAInX,EAAMyP,QAAS,MAAM,IAAItF,MAAM,WAAagN,EAAS,qBACzD,OAAOnX,EAGT,IAAI4W,EAAWrY,EAAQqY,SAAW,WAChC,SAASA,SAASO,GAChB,IAAIC,EAAQjT,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAChF,EAAI2S,EAAiBS,SAAStT,KAAM2S,UAEtB,QAAVQ,IAAiBA,GAAS,IAChB,QAAVA,IAAiBA,GAAS,IAChB,QAAVA,IAAiBA,GAAS,IAC9BnT,KAAKm5C,QAAUhmC,EAAQ8lC,kBAAkB/lC,GAAQoY,UAAUnY,GAAS8lC,kBAAkB/lC,GACtFlT,KAAKgT,OAAS,MA2ChB,OAxCA,EAAI+lC,EAAczlC,SAASX,SAAU,CAAC,CACpCtW,IAAK,UACLN,MAAO,SAASq9C,QAAQC,GACtB,OAAOr5C,KAAKm5C,QAAQxuC,GAAG0uC,EAAMF,UAAYn5C,KAAKgT,QAAUqmC,EAAMrmC,SAE/D,CACD3W,IAAK,WACLN,MAAO,SAASgK,WACd,IAAIuzC,EAAWp5C,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,EAEnF,OAAOF,KAAKm5C,QAAQztB,QAAQ4tB,GAAY,IAAMt5C,KAAKgT,SAEpD,CACD3W,IAAK,cACLN,MAAO,SAASm9C,cACd,OAAOl5C,KAAKm5C,UAEb,CACD98C,IAAK,WACLN,MAAO,SAAS4wB,WACd,OAAO3sB,KAAKm5C,QAAQxsB,aAErB,CACDtwB,IAAK,UACLN,MAAO,SAAS2vB,UACd,IAAIvY,EAAQjT,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,EAOhF,MALc,QAAViT,IAAiBA,EAAQ,IACf,QAAVA,IAAiBA,EAAQ,IACf,QAAVA,IAAiBA,EAAQ,IAGtBnT,KAAKm5C,QAAQ7tB,UAAUnY,GAAOyW,aAAaovB,EAAY1lC,QAAQyR,YAAY2G,YAEnF,CACDrvB,IAAK,aACLN,MAAO,SAASw9C,WAAWF,GACzB,OAAOr5C,KAAKgT,SAAWqmC,EAAMrmC,WAG1BL,SApDyB,GA+D9BuB,EAAgB5Z,EAAQ4Z,cAAgB,SAAUb,GAGpD,SAASa,cAAchB,EAAQa,EAAWC,EAAab,IACrD,EAAIN,EAAiBS,SAAStT,KAAMkU,eAEpC,IAAI/K,GAAQ,EAAI2J,EAA4BQ,SAAStT,MAAOkU,cAAc/V,YAAa,EAAIiQ,EAAiBkF,SAASY,gBAAgBjZ,KAAK+E,KAAMkT,EAAQC,IAKxJ,OAHAhK,EAAM4K,UAAYA,EAClB5K,EAAM6K,YAAcA,EACpB7K,EAAM6J,OAASe,EAAUf,OAAS,IAAMgB,EAAYhB,OAC7C7J,EAGT,OAbA,EAAI4J,EAAWO,SAASY,cAAeb,GAahCa,cAdmC,CAe1CvB,GAuDF,SAAS6mC,mBAAmBj1B,EAAQk1B,GAClC,OAAO,SAAUJ,IAlDnB,SAASK,qBAAqBn1B,EAAQgQ,EAAMolB,GAC1C,IAAKA,GAAmB,IAAVA,EACZ,MAAM,IAAIzzC,MAAM,sBAAwBquB,EAAKvhB,OAAS,IAAMuR,EAAS,0BAGvE,GAAMo1B,aAAiBhnC,IAAa4hB,EAAKglB,WAAWI,GAApD,CAEA,GAAIA,aAAiBzlC,EAGnB,OAAQqQ,GACN,IAAK,QACH,GAAIgQ,EAAKglB,WAAWI,EAAM3lC,aAAc,OACxC,MACF,IAAK,MACH,GAAIugB,EAAKglB,WAAWI,EAAM5lC,WAAY,YAI1C,OAAQwQ,GAEN,IAAK,MACH,OAIN,MAAM,IAAIre,MAAM,sBAAwBquB,EAAKvhB,OAAS,IAAMuR,EAAS,IAAMo1B,EAAM3mC,SAyB/E0mC,CAAqBn1B,EAAQvkB,KAAMq5C,GAEnC,IAAIO,EAAiBP,aAAiB1mC,EAAW0mC,EAAMH,cAAgBG,EAEnEt9C,EAAQiE,KAAKk5C,cAAc30B,GAAQq1B,GACvC,OAAOH,EAAY19C,EA3BvB,SAAS89C,kBAAkBt1B,EAAQgQ,EAAMolB,EAAO59C,GAC9C,GAAI49C,aAAiBzlC,EACnB,OAAQqQ,GACN,IAAK,QACH,OAAO,IAAIo1B,EAAM5lC,UAAUhY,GAC7B,IAAK,MACH,OAAO,IAAI49C,EAAM3lC,YAAYjY,GAInC,OAAM49C,aAAiBhnC,IAAa4hB,EAAKglB,WAAWI,GAO7C,IAAIzlC,EAAcnY,EAAOw4B,EAAK71B,YAAai7C,EAAMj7C,aANlD61B,aAAgBrgB,EACX,IAAIqgB,EAAK71B,YAAY3C,EAAOw4B,EAAKxgB,UAAWwgB,EAAKvgB,YAAaugB,EAAKphB,OAErE,IAAIohB,EAAK71B,YAAY3C,GAaD89C,CAAkBt1B,EAAQvkB,KAAMq5C,EAAOt9C,KAItE,EAAI6W,EAASU,SAASX,EAAS/V,UAhEX,CAAC,CAAC,OAAQ,OAAQ,CAAC,QAAS,OAAQ,CAAC,QAAS,eAAgB,OAAQ,CAAC,MAAO,aAAc,CAAC,cAgEzDk6B,QAAO,SAAU+Q,EAAQtvB,GAC/E,IAAIuhC,GAAQ,EAAIhB,EAAUxlC,SAASiF,GAC/BgM,EAASu1B,EAAM,GACfC,EAAUD,EAAMlzC,MAAM,GAE1BihC,EAAOtjB,GAAUi1B,mBAAmBj1B,GACpC,IAAIy1B,GAA4B,EAC5BC,GAAoB,EACpBC,OAAiB75C,EAErB,IACE,IAAK,IAAqDod,EAAjDG,GAAY,EAAIi7B,EAAcvlC,SAASymC,KAAmBC,GAA6Bv8B,EAAQG,EAAU9H,QAAQnW,MAAOq6C,GAA4B,EAAM,CAGjKnS,EAFYpqB,EAAM1hB,OAEF8rC,EAAOtjB,IAEzB,MAAOnkB,GACP65C,GAAoB,EACpBC,EAAiB95C,EACjB,QACA,KACO45C,GAA6Bp8B,EAAUu8B,QAC1Cv8B,EAAUu8B,SAEZ,QACA,GAAIF,EACF,MAAMC,GAKZ,OAAOrS,IACN,IA9FoB,CAAC,CAAC,aAAc,MAAO,CAAC,sBAAuB,OAAQ,CAAC,gBAAiB,MAAO,CAAC,yBAA0B,OAAQ,CAAC,OA8FlH/Q,QAAO,SAAU+Q,EAAQuS,GAChD,IAAIC,GAAQ,EAAIvB,EAAUxlC,SAAS8mC,GAC/B71B,EAAS81B,EAAM,GACfN,EAAUM,EAAMzzC,MAAM,GAE1BihC,EAAOtjB,GAAUi1B,mBAAmBj1B,GAAQ,GAC5C,IAAI+1B,GAA6B,EAC7BC,GAAqB,EACrBC,OAAkBn6C,EAEtB,IACE,IAAK,IAAsDqe,EAAlDvJ,GAAa,EAAI0jC,EAAcvlC,SAASymC,KAAoBO,GAA8B57B,EAASvJ,EAAWW,QAAQnW,MAAO26C,GAA6B,EAAM,CAGvKzS,EAFYnpB,EAAO3iB,OAEH8rC,EAAOtjB,IAEzB,MAAOnkB,GACPm6C,GAAqB,EACrBC,EAAkBp6C,EAClB,QACA,KACOk6C,GAA8BnlC,EAAWglC,QAC5ChlC,EAAWglC,SAEb,QACA,GAAII,EACF,MAAMC,GAKZ,OAAO3S,IACN,M,gBCrQHttC,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAAoC4B,YAAY,I,gBCAtF,EAAQ,IACR,EAAQ,IACR3B,EAAOD,QAAU,EAAQ,M,gBCFzB,IAAIkI,EAAW,EAAQ,IACnB7G,EAAM,EAAQ,IAClBpB,EAAOD,QAAU,EAAQ,GAAWmgD,YAAc,SAAUv3C,GAC1D,IAAIw3C,EAAS/+C,EAAIuH,GACjB,GAAqB,mBAAVw3C,EAAsB,MAAMr9C,UAAU6F,EAAK,qBACtD,OAAOV,EAASk4C,EAAOz/C,KAAKiI,M,gBCJ9B,IAAI0R,EAAM,EAAQ,IACdtH,EAAM,EAAQ,EAAR,CAAkB,eAExBqtC,EAAkD,aAA5C/lC,EAAI,WAAc,OAAO1U,UAArB,IASd3F,EAAOD,QAAU,SAAU4I,GACzB,IAAIL,EAAGkxC,EAAGpyC,EACV,YAActB,IAAP6C,EAAmB,YAAqB,OAAPA,EAAc,OAEN,iBAApC6wC,EAVD,SAAU7wC,EAAI7G,GACzB,IACE,OAAO6G,EAAG7G,GACV,MAAO0G,KAOO63C,CAAO/3C,EAAIrH,OAAO0H,GAAKoK,IAAoBymC,EAEvD4G,EAAM/lC,EAAI/R,GAEM,WAAflB,EAAIiT,EAAI/R,KAAsC,mBAAZA,EAAEg4C,OAAuB,YAAcl5C,I,gBCnBhFrH,EAAQ4B,YAAa,EAErB,IAEI4+C,EAEJ,SAAS99C,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAF1ED,CAFD,EAAQ,MAMpB1C,EAAQgZ,QAAU,SAAUjP,GAC1B,OAAOa,MAAMgY,QAAQ7Y,GAAOA,GAAM,EAAIy2C,EAAOxnC,SAASjP,K,gBCXxD9J,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAAkC4B,YAAY,I,gBCApF,EAAQ,IACR,EAAQ,KACR3B,EAAOD,QAAU,EAAQ,GAAuB4K,MAAMC,M,gBCDtD,IAAIzE,EAAM,EAAQ,IACdG,EAAU,EAAQ,IAClBkU,EAAW,EAAQ,IACnB9Z,EAAO,EAAQ,KACf8/C,EAAc,EAAQ,KACtB5G,EAAW,EAAQ,IACnB6G,EAAiB,EAAQ,KACzBC,EAAY,EAAQ,IAExBp6C,EAAQA,EAAQU,EAAIV,EAAQM,GAAK,EAAQ,IAAR,EAA0B,SAAUq1B,GAAQtxB,MAAMC,KAAKqxB,MAAW,QAAS,CAE1GrxB,KAAM,SAASA,KAAK+1C,GAClB,IAOIz9C,EAAQ2P,EAAQkQ,EAAMta,EAPtBH,EAAIkS,EAASmmC,GACbn5C,EAAmB,mBAAR/B,KAAqBA,KAAOkF,MACvC8uC,EAAO9zC,UAAUzC,OACjB09C,EAAQnH,EAAO,EAAI9zC,UAAU,QAAKG,EAClC+6C,OAAoB/6C,IAAV86C,EACVjvC,EAAQ,EACRwuC,EAASO,EAAUp4C,GAIvB,GAFIu4C,IAASD,EAAQz6C,EAAIy6C,EAAOnH,EAAO,EAAI9zC,UAAU,QAAKG,EAAW,IAEvDA,MAAVq6C,GAAyB34C,GAAKmD,OAAS61C,EAAYL,GAMrD,IAAKttC,EAAS,IAAIrL,EADlBtE,EAAS02C,EAAStxC,EAAEpF,SACSA,EAASyO,EAAOA,IAC3C8uC,EAAe5tC,EAAQlB,EAAOkvC,EAAUD,EAAMt4C,EAAEqJ,GAAQA,GAASrJ,EAAEqJ,SANrE,IAAKlJ,EAAW03C,EAAOz/C,KAAK4H,GAAIuK,EAAS,IAAIrL,IAAOub,EAAOta,EAAS8S,QAAQnW,KAAMuM,IAChF8uC,EAAe5tC,EAAQlB,EAAOkvC,EAAUngD,EAAK+H,EAAUm4C,EAAO,CAAC79B,EAAKvhB,MAAOmQ,IAAQ,GAAQoR,EAAKvhB,OASpG,OADAqR,EAAO3P,OAASyO,EACTkB,M,gBCjCX,IAAI5K,EAAW,EAAQ,IACvBjI,EAAOD,QAAU,SAAU0I,EAAUjD,EAAIhE,EAAOya,GAC9C,IACE,OAAOA,EAAUzW,EAAGyC,EAASzG,GAAO,GAAIA,EAAM,IAAMgE,EAAGhE,GAEvD,MAAOgH,GACP,IAAI+3B,EAAM93B,EAAiB,OAE3B,WADY3C,IAARy6B,GAAmBt4B,EAASs4B,EAAI7/B,KAAK+H,IACnCD,K,gBCRV,IAAIuS,EAAY,EAAQ,IACpBG,EAAW,EAAQ,EAAR,CAAkB,YAC7B4lC,EAAan2C,MAAMtI,UAEvBrC,EAAOD,QAAU,SAAU4I,GACzB,YAAc7C,IAAP6C,IAAqBoS,EAAUpQ,QAAUhC,GAAMm4C,EAAW5lC,KAAcvS,K,gBCLjF,IAAIyzC,EAAkB,EAAQ,IAC1B/yC,EAAa,EAAQ,IAEzBrJ,EAAOD,QAAU,SAAUoC,EAAQwP,EAAOnQ,GACpCmQ,KAASxP,EAAQi6C,EAAgB/zC,EAAElG,EAAQwP,EAAOtI,EAAW,EAAG7H,IAC/DW,EAAOwP,GAASnQ,I,gBCNvB,IAAI0Z,EAAW,EAAQ,EAAR,CAAkB,YAC7B6lC,GAAe,EAEnB,IACE,IAAIC,EAAQ,CAAC,GAAG9lC,KAChB8lC,EAAc,OAAI,WAAcD,GAAe,GAE/Cp2C,MAAMC,KAAKo2C,GAAO,WAAc,MAAM,KACtC,MAAOx4C,IAETxI,EAAOD,QAAU,SAAUuJ,EAAM23C,GAC/B,IAAKA,IAAgBF,EAAc,OAAO,EAC1C,IAAIG,GAAO,EACX,IACE,IAAIp3C,EAAM,CAAC,GACPmyB,EAAOnyB,EAAIoR,KACf+gB,EAAK1gB,KAAO,WAAc,MAAO,CAAEnW,KAAM87C,GAAO,IAChDp3C,EAAIoR,GAAY,WAAc,OAAO+gB,GACrC3yB,EAAKQ,GACL,MAAOtB,IACT,OAAO04C,I,gBClBTnhD,EAAQ4B,YAAa,EAErB,IAEIw/C,EAEJ,SAAS1+C,uBAAuBC,GAAO,OAAOA,GAAOA,EAAIf,WAAae,EAAM,CAAEqW,QAASrW,GAFhED,CAFD,EAAQ,MAM9B1C,EAAQgZ,QAAU,WAChB,SAASqhC,iBAAiBp3C,EAAQC,GAChC,IAAK,IAAI1C,EAAI,EAAGA,EAAI0C,EAAMC,OAAQ3C,IAAK,CACrC,IAAI4C,EAAaF,EAAM1C,GACvB4C,EAAWhC,WAAagC,EAAWhC,aAAc,EACjDgC,EAAWC,cAAe,EACtB,UAAWD,IAAYA,EAAWE,UAAW,IACjD,EAAI89C,EAAiBpoC,SAAS/V,EAAQG,EAAWrB,IAAKqB,IAI1D,OAAO,SAAUN,EAAaU,EAAYC,GAGxC,OAFID,GAAY62C,iBAAiBv3C,EAAYR,UAAWkB,GACpDC,GAAa42C,iBAAiBv3C,EAAaW,GACxCX,GAdO,I,gBCVlB7C,EAAOD,QAAU,CAAE,QAAW,EAAQ,KAA8C4B,YAAY,I,gBCAhG,EAAQ,KACR,IAAI08C,EAAU,EAAQ,GAAuBp9C,OAC7CjB,EAAOD,QAAU,SAASmB,eAAeyH,EAAI7G,EAAK0V,GAChD,OAAO6mC,EAAQn9C,eAAeyH,EAAI7G,EAAK0V,K,gBCHzC,IAAIlR,EAAU,EAAQ,IAEtBA,EAAQA,EAAQU,EAAIV,EAAQM,GAAK,EAAQ,IAAmB,SAAU,CAAE1F,eAAgB,EAAQ,IAAgBmH,K,gBCFhH,OAAC,SAAWud,GAmDV,IAAIra,EACFsa,EAAY,6CACZu7B,EAA6B,mBAAV9/C,QAAkD,iBAAnBA,OAAOmH,SAEzDqd,EAAW/d,KAAK6D,KAChBma,EAAYhe,KAAKiJ,MAEjBgV,EAAiB,qBACjBC,EAAgBD,EAAiB,yDAEjCE,EAAO,KAIPC,EAAW,CAAC,EAAG,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,MAM7EC,EAAM,IAwoFR,SAASC,SAASrkB,GAChB,IAAIzB,EAAQ,EAAJyB,EACR,OAAOA,EAAI,GAAKA,IAAMzB,EAAIA,EAAIA,EAAI,EAKpC,SAAS+lB,cAAc7e,GAMrB,IALA,IAAIjF,EAAG+jB,EACLhmB,EAAI,EACJ6L,EAAI3E,EAAEvE,OACN7B,EAAIoG,EAAE,GAAK,GAENlH,EAAI6L,GAAI,CAGb,IADAma,EAhqFS,IA+pFT/jB,EAAIiF,EAAElH,KAAO,IACI2C,OACVqjB,IAAK/jB,EAAI,IAAMA,GACtBnB,GAAKmB,EAIP,IAAK4J,EAAI/K,EAAE6B,OAA8B,KAAtB7B,EAAEmlB,aAAapa,KAElC,OAAO/K,EAAEgL,MAAM,EAAGD,EAAI,GAAK,GAK7B,SAASqa,QAAQC,EAAGC,GAClB,IAAIlf,EAAGC,EACLkf,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EACPL,EAAImmB,EAAElkB,EACN4J,EAAIua,EAAEnkB,EACNkI,EAAIgc,EAAEle,EACNhI,EAAImmB,EAAEne,EAGR,IAAKjI,IAAM6L,EAAG,OAAO,KAMrB,GAJA3E,EAAImf,IAAOA,EAAG,GACdlf,EAAImf,IAAOA,EAAG,GAGVpf,GAAKC,EAAG,OAAOD,EAAIC,EAAI,GAAK0E,EAAI7L,EAGpC,GAAIA,GAAK6L,EAAG,OAAO7L,EAMnB,GAJAkH,EAAIlH,EAAI,EACRmH,EAAIgD,GAAKlK,GAGJomB,IAAOC,EAAI,OAAOnf,EAAI,GAAKkf,EAAKnf,EAAI,GAAK,EAG9C,IAAKC,EAAG,OAAOgD,EAAIlK,EAAIiH,EAAI,GAAK,EAKhC,IAHA2E,GAAK1B,EAAIkc,EAAG1jB,SAAW1C,EAAIqmB,EAAG3jB,QAAUwH,EAAIlK,EAGvCD,EAAI,EAAGA,EAAI6L,EAAG7L,IAAK,GAAIqmB,EAAGrmB,IAAMsmB,EAAGtmB,GAAI,OAAOqmB,EAAGrmB,GAAKsmB,EAAGtmB,GAAKkH,EAAI,GAAK,EAG5E,OAAOiD,GAAKlK,EAAI,EAAIkK,EAAIlK,EAAIiH,EAAI,GAAK,EAOvC,SAASqf,SAAS9kB,EAAGuY,EAAKwM,EAAKjmB,GAC7B,GAAIkB,EAAIuY,GAAOvY,EAAI+kB,GAAO/kB,IAAM+jB,EAAU/jB,GACxC,MAAM2J,MACJqa,GAAkBllB,GAAQ,aAA2B,iBAALkB,EAC7CA,EAAIuY,GAAOvY,EAAI+kB,EAAM,kBAAoB,oBACzC,6BAA+BzV,OAAOtP,IAM/C,SAASglB,MAAMhlB,GACb,IAAI0I,EAAI1I,EAAEpB,EAAEsC,OAAS,EACrB,OAAOmjB,SAASrkB,EAAEwG,EAruFP,KAquFwBkC,GAAK1I,EAAEpB,EAAE8J,GAAK,GAAK,EAIxD,SAASuc,cAAcC,EAAK1e,GAC1B,OAAQ0e,EAAIhkB,OAAS,EAAIgkB,EAAIxb,OAAO,GAAK,IAAMwb,EAAI7a,MAAM,GAAK6a,IAC5D1e,EAAI,EAAI,IAAM,MAAQA,EAI1B,SAAS2e,aAAaD,EAAK1e,EAAG+d,GAC5B,IAAIpb,EAAKic,EAGT,GAAI5e,EAAI,EAAG,CAGT,IAAK4e,EAAKb,EAAI,MAAO/d,EAAG4e,GAAMb,GAC9BW,EAAME,EAAKF,OAOX,KAAM1e,GAHN2C,EAAM+b,EAAIhkB,QAGK,CACb,IAAKkkB,EAAKb,EAAG/d,GAAK2C,IAAO3C,EAAG4e,GAAMb,GAClCW,GAAOE,OACE5e,EAAI2C,IACb+b,EAAMA,EAAI7a,MAAM,EAAG7D,GAAK,IAAM0e,EAAI7a,MAAM7D,IAI5C,OAAO0e,GAOT3b,EA9vFA,SAAS8b,MAAMC,GACb,IAAIC,EAAKC,EAAaC,EAglBhBC,EAwqBAC,EACFC,EACAC,EACAC,EACAC,EA3vCF7gB,EAAIqE,UAAUlJ,UAAY,CAAE8B,YAAaoH,UAAWC,SAAU,KAAMuF,QAAS,MAC7EiX,EAAM,IAAIzc,UAAU,GAUpB0c,EAAiB,GAajBC,EAAgB,EAMhBC,GAAc,EAIdC,EAAa,GAMbC,GAAW,IAKXC,EAAU,IAGVC,GAAS,EAkBTC,EAAc,EAIdC,EAAgB,EAGhBC,EAAS,CACP2qB,OAAQ,GACRxqB,UAAW,EACXC,mBAAoB,EACpBF,eAAgB,IAChBD,iBAAkB,IAClBK,kBAAmB,EACnBD,uBAAwB,IACxB6gB,OAAQ,IAMV3gB,EAAW,uCAgBb,SAAS1d,UAAU0f,EAAGvjB,GACpB,IAAIwhB,EAAUtoB,EAAGuoB,EAAa3gB,EAAGjI,EAAG6oB,EAAOje,EAAK+b,EAC9CR,EAAIjhB,KAGN,KAAMihB,aAAanb,WAAY,OAAO,IAAIA,UAAU0f,EAAGvjB,GAEvD,GAAS,MAALA,EAAW,CAEb,GAAIujB,IAAwB,IAAnBA,EAAEO,aAYT,OAXA9E,EAAElkB,EAAIyoB,EAAEzoB,QAEHyoB,EAAErqB,GAAKqqB,EAAEziB,EAAI8f,EAChB5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,KACHyiB,EAAEziB,EAAI6f,EACf3B,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,IAEbke,EAAEle,EAAIyiB,EAAEziB,EACRke,EAAE9lB,EAAIqqB,EAAErqB,EAAEyL,UAMd,IAAK+c,EAAoB,iBAAL6B,IAAsB,EAAJA,GAAS,EAAG,CAMhD,GAHAvE,EAAElkB,EAAI,EAAIyoB,EAAI,GAAKA,GAAKA,GAAI,GAAK,EAG7BA,MAAQA,EAAG,CACb,IAAKziB,EAAI,EAAGjI,EAAI0qB,EAAG1qB,GAAK,GAAIA,GAAK,GAAIiI,KASrC,YAPIA,EAAI8f,EACN5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,MAEZke,EAAEle,EAAIA,EACNke,EAAE9lB,EAAI,CAACqqB,KAMX/D,EAAM5V,OAAO2Z,OACR,CAEL,IAAKpF,EAAU1N,KAAK+O,EAAM5V,OAAO2Z,IAAK,OAAOxD,EAAaf,EAAGQ,EAAKkC,GAElE1C,EAAElkB,EAAyB,IAArB0kB,EAAIV,WAAW,IAAYU,EAAMA,EAAI7a,MAAM,IAAK,GAAK,GAIxD7D,EAAI0e,EAAItI,QAAQ,OAAS,IAAGsI,EAAMA,EAAImC,QAAQ,IAAK,MAGnD9oB,EAAI2mB,EAAIoC,OAAO,OAAS,GAGvB9gB,EAAI,IAAGA,EAAIjI,GACfiI,IAAM0e,EAAI7a,MAAM9L,EAAI,GACpB2mB,EAAMA,EAAIqC,UAAU,EAAGhpB,IACdiI,EAAI,IAGbA,EAAI0e,EAAIhkB,YAGL,CAOL,GAJA4jB,SAASpf,EAAG,EAAGuhB,EAAS/lB,OAAQ,QAIvB,IAALwE,EAEF,OAAO8hB,MADP9C,EAAI,IAAInb,UAAU0f,GACFhD,EAAiBvB,EAAEle,EAAI,EAAG0f,GAK5C,GAFAhB,EAAM5V,OAAO2Z,GAET7B,EAAoB,iBAAL6B,EAAe,CAGhC,GAAQ,EAAJA,GAAS,EAAG,OAAOxD,EAAaf,EAAGQ,EAAKkC,EAAO1hB,GAKnD,GAHAgf,EAAElkB,EAAI,EAAIyoB,EAAI,GAAK/D,EAAMA,EAAI7a,MAAM,IAAK,GAAK,EAGzCd,UAAUke,OAASvC,EAAImC,QAAQ,YAAa,IAAInmB,OAAS,GAC3D,MAAMyI,MACJsa,EAAgBgF,QAGpBvE,EAAElkB,EAA0B,KAAtB0kB,EAAIV,WAAW,IAAaU,EAAMA,EAAI7a,MAAM,IAAK,GAAK,EAQ9D,IALA6c,EAAWD,EAAS5c,MAAM,EAAG3E,GAC7Bc,EAAIjI,EAAI,EAIH4K,EAAM+b,EAAIhkB,OAAQ3C,EAAI4K,EAAK5K,IAC9B,GAAI2oB,EAAStK,QAAQhe,EAAIsmB,EAAIxb,OAAOnL,IAAM,EAAG,CAC3C,GAAS,KAALK,GAGF,GAAIL,EAAIiI,EAAG,CACTA,EAAI2C,EACJ,eAEG,IAAKge,IAGNjC,GAAOA,EAAIpN,gBAAkBoN,EAAMA,EAAIwC,gBACvCxC,GAAOA,EAAIwC,gBAAkBxC,EAAMA,EAAIpN,gBAAgB,CACzDqP,GAAc,EACd5oB,GAAK,EACLiI,EAAI,EACJ,SAIJ,OAAOif,EAAaf,EAAGpV,OAAO2Z,GAAI7B,EAAO1hB,GAK7C0hB,GAAQ,GAIH5gB,GAHL0e,EAAMM,EAAYN,EAAKxf,EAAG,GAAIgf,EAAElkB,IAGnBoc,QAAQ,OAAS,EAAGsI,EAAMA,EAAImC,QAAQ,IAAK,IACnD7gB,EAAI0e,EAAIhkB,OAIf,IAAK3C,EAAI,EAAyB,KAAtB2mB,EAAIV,WAAWjmB,GAAWA,KAGtC,IAAK4K,EAAM+b,EAAIhkB,OAAkC,KAA1BgkB,EAAIV,aAAarb,KAExC,GAAI+b,EAAMA,EAAI7a,MAAM9L,IAAK4K,GAAM,CAI7B,GAHAA,GAAO5K,EAGH6oB,GAAS7d,UAAUke,OACrBte,EAAM,KAAO8f,EA1QA,kBA0QwBA,IAAMlF,EAAUkF,IACnD,MAAMtf,MACJsa,EAAiBS,EAAElkB,EAAIyoB,GAI7B,IAAKziB,EAAIA,EAAIjI,EAAI,GAAK+nB,EAGpB5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,UAGP,GAAIA,EAAI6f,EAGb3B,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,OACR,CAWL,GAVAke,EAAEle,EAAIA,EACNke,EAAE9lB,EAAI,GAMNL,GAAKiI,EAAI,GAnSJ,GAoSDA,EAAI,IAAGjI,GApSN,IAsSDA,EAAI4K,EAAK,CAGX,IAFI5K,GAAGmmB,EAAE9lB,EAAE4L,MAAM0a,EAAI7a,MAAM,EAAG9L,IAEzB4K,GAzSF,GAySmB5K,EAAI4K,GACxBub,EAAE9lB,EAAE4L,MAAM0a,EAAI7a,MAAM9L,EAAGA,GA1StB,KA6SHA,EA7SG,IA6Sa2mB,EAAMA,EAAI7a,MAAM9L,IAAI2C,YAEpC3C,GAAK4K,EAGP,KAAO5K,IAAK2mB,GAAO,KACnBR,EAAE9lB,EAAE4L,MAAM0a,SAKZR,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,GA41BjB,SAASmhB,OAAO3nB,EAAGzB,EAAGqpB,EAAI5f,GACxB,IAAI6f,EAAIrhB,EAAGshB,EAAI3e,EAAK+b,EAKpB,GAHU,MAAN0C,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,IAEhB5nB,EAAEpB,EAAG,OAAOoB,EAAEwJ,WAKnB,GAHAqe,EAAK7nB,EAAEpB,EAAE,GACTkpB,EAAK9nB,EAAEwG,EAEE,MAALjI,EACF2mB,EAAMZ,cAActkB,EAAEpB,GACtBsmB,EAAY,GAANld,GAAiB,GAANA,IAAY8f,GAAM3B,GAAc2B,GAAM1B,GACpDnB,cAAcC,EAAK4C,GACnB3C,aAAaD,EAAK4C,EAAI,UAezB,GAVAthB,GAHAxG,EAAIwnB,MAAM,IAAIje,UAAUvJ,GAAIzB,EAAGqpB,IAGzBphB,EAGN2C,GADA+b,EAAMZ,cAActkB,EAAEpB,IACZsC,OAOA,GAAN8G,GAAiB,GAANA,IAAYzJ,GAAKiI,GAAKA,GAAK2f,GAAa,CAGrD,KAAOhd,EAAM5K,EAAG2mB,GAAO,IAAK/b,KAC5B+b,EAAMD,cAAcC,EAAK1e,QAQzB,GAJAjI,GAAKupB,EACL5C,EAAMC,aAAaD,EAAK1e,EAAG,KAGvBA,EAAI,EAAI2C,GACV,KAAM5K,EAAI,EAAG,IAAK2mB,GAAO,IAAK3mB,IAAK2mB,GAAO,WAG1C,IADA3mB,GAAKiI,EAAI2C,GACD,EAEN,IADI3C,EAAI,GAAK2C,IAAK+b,GAAO,KAClB3mB,IAAK2mB,GAAO,KAM3B,OAAOllB,EAAEQ,EAAI,GAAKqnB,EAAK,IAAM3C,EAAMA,EAKrC,SAAS6C,SAASrkB,EAAMskB,GAKtB,IAJA,IAAIhoB,EACFzB,EAAI,EACJI,EAAI,IAAI4K,UAAU7F,EAAK,IAElBnF,EAAImF,EAAKxC,OAAQ3C,IAAK,CAI3B,KAHAyB,EAAI,IAAIuJ,UAAU7F,EAAKnF,KAGhBiC,EAAG,CACR7B,EAAIqB,EACJ,MACSgoB,EAAOtpB,KAAKC,EAAGqB,KACxBrB,EAAIqB,GAIR,OAAOrB,EAQT,SAASspB,UAAUjoB,EAAGpB,EAAG4H,GAKvB,IAJA,IAAIjI,EAAI,EACN6L,EAAIxL,EAAEsC,QAGAtC,IAAIwL,GAAIxL,EAAEspB,OAGlB,IAAK9d,EAAIxL,EAAE,GAAIwL,GAAK,GAAIA,GAAK,GAAI7L,KAkBjC,OAfKiI,EAAIjI,EAnvCA,GAmvCIiI,EAAe,GAAK8f,EAG/BtmB,EAAEpB,EAAIoB,EAAEwG,EAAI,KAGHA,EAAI6f,EAGbrmB,EAAEpB,EAAI,CAACoB,EAAEwG,EAAI,IAEbxG,EAAEwG,EAAIA,EACNxG,EAAEpB,EAAIA,GAGDoB,EA0DT,SAASwnB,MAAM9C,EAAGyD,EAAIP,EAAIvoB,GACxB,IAAIR,EAAGN,EAAG6L,EAAG1B,EAAG1I,EAAGooB,EAAIC,EACrBzD,EAAKF,EAAE9lB,EACP0pB,EAASnE,EAGX,GAAIS,EAAI,CAQNlgB,EAAK,CAGH,IAAK7F,EAAI,EAAG6J,EAAIkc,EAAG,GAAIlc,GAAK,GAAIA,GAAK,GAAI7J,KAIzC,IAHAN,EAAI4pB,EAAKtpB,GAGD,EACNN,GAl1CG,GAm1CH6L,EAAI+d,EAIJE,GAHAroB,EAAI4kB,EAAGwD,EAAK,IAGHE,EAAOzpB,EAAIuL,EAAI,GAAK,GAAK,OAIlC,IAFAge,EAAKtE,GAAUvlB,EAAI,GAz1ChB,MA21COqmB,EAAG1jB,OAAQ,CAEnB,IAAI7B,EASF,MAAMqF,EANN,KAAOkgB,EAAG1jB,QAAUknB,EAAIxD,EAAGpa,KAAK,IAChCxK,EAAIqoB,EAAK,EACTxpB,EAAI,EAEJuL,GADA7L,GAn2CD,OAo2CoB,MAIhB,CAIL,IAHAyB,EAAI0I,EAAIkc,EAAGwD,GAGNvpB,EAAI,EAAG6J,GAAK,GAAIA,GAAK,GAAI7J,KAU9BwpB,GAHAje,GAJA7L,GA/2CC,OAm3CkBM,GAGV,EAAI,EAAImB,EAAIsoB,EAAOzpB,EAAIuL,EAAI,GAAK,GAAK,EAmBlD,GAfA/K,EAAIA,GAAK8oB,EAAK,GAKC,MAAdvD,EAAGwD,EAAK,KAAehe,EAAI,EAAIpK,EAAIA,EAAIsoB,EAAOzpB,EAAIuL,EAAI,IAEvD/K,EAAIuoB,EAAK,GACLS,GAAMhpB,KAAa,GAANuoB,GAAWA,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAC9C6nB,EAAK,GAAW,GAANA,IAAkB,GAANT,GAAWvoB,GAAW,GAANuoB,IAGrCrpB,EAAI,EAAI6L,EAAI,EAAIpK,EAAIsoB,EAAOzpB,EAAIuL,GAAK,EAAIwa,EAAGwD,EAAK,IAAM,GAAM,GAC7DR,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAEpB2nB,EAAK,IAAMvD,EAAG,GAiBhB,OAhBAA,EAAG1jB,OAAS,EAER7B,GAGF8oB,GAAMzD,EAAEle,EAAI,EAGZoe,EAAG,GAAK0D,GAl5CP,GAk5C0BH,EAl5C1B,QAm5CDzD,EAAEle,GAAK2hB,GAAM,GAIbvD,EAAG,GAAKF,EAAEle,EAAI,EAGTke,EAkBT,GAdS,GAALnmB,GACFqmB,EAAG1jB,OAASknB,EACZ1f,EAAI,EACJ0f,MAEAxD,EAAG1jB,OAASknB,EAAK,EACjB1f,EAAI4f,EAp6CD,GAo6CmB/pB,GAItBqmB,EAAGwD,GAAMhe,EAAI,EAAI2Z,EAAU/jB,EAAIsoB,EAAOzpB,EAAIuL,GAAKke,EAAOle,IAAM1B,EAAI,GAI9DrJ,EAEF,OAAU,CAGR,GAAU,GAAN+oB,EAAS,CAGX,IAAK7pB,EAAI,EAAG6L,EAAIwa,EAAG,GAAIxa,GAAK,GAAIA,GAAK,GAAI7L,KAEzC,IADA6L,EAAIwa,EAAG,IAAMlc,EACRA,EAAI,EAAG0B,GAAK,GAAIA,GAAK,GAAI1B,KAG1BnK,GAAKmK,IACPgc,EAAEle,IACEoe,EAAG,IAAMV,IAAMU,EAAG,GAAK,IAG7B,MAGA,GADAA,EAAGwD,IAAO1f,EACNkc,EAAGwD,IAAOlE,EAAM,MACpBU,EAAGwD,KAAQ,EACX1f,EAAI,EAMV,IAAKnK,EAAIqmB,EAAG1jB,OAAoB,IAAZ0jB,IAAKrmB,GAAUqmB,EAAGsD,QAIpCxD,EAAEle,EAAI8f,EACR5B,EAAE9lB,EAAI8lB,EAAEle,EAAI,KAGHke,EAAEle,EAAI6f,IACf3B,EAAE9lB,EAAI,CAAC8lB,EAAEle,EAAI,IAIjB,OAAOke,EAIT,SAAS3V,QAAQ/O,GACf,IAAIklB,EACF1e,EAAIxG,EAAEwG,EAER,OAAU,OAANA,EAAmBxG,EAAEwJ,YAEzB0b,EAAMZ,cAActkB,EAAEpB,GAEtBsmB,EAAM1e,GAAK2f,GAAc3f,GAAK4f,EAC1BnB,cAAcC,EAAK1e,GACnB2e,aAAaD,EAAK1e,EAAG,KAElBxG,EAAEQ,EAAI,EAAI,IAAM0kB,EAAMA,GAiqC/B,OAv0EA3b,UAAU8b,MAAQA,MAElB9b,UAAUgf,SAAW,EACrBhf,UAAUif,WAAa,EACvBjf,UAAUkf,WAAa,EACvBlf,UAAUmf,YAAc,EACxBnf,UAAUof,cAAgB,EAC1Bpf,UAAUqf,gBAAkB,EAC5Brf,UAAUsf,gBAAkB,EAC5Btf,UAAUuf,gBAAkB,EAC5Bvf,UAAUwf,iBAAmB,EAC7Bxf,UAAUyf,OAAS,EAqCnBzf,UAAUmS,OAASnS,UAAUwL,IAAM,SAAUrU,GAC3C,IAAIH,EAAG0oB,EAEP,GAAW,MAAPvoB,EAAa,CAEf,GAAkB,iBAAPA,EA2HT,MAAMiJ,MACJqa,EAAiB,oBAAsBtjB,GAtFzC,GAlCIA,EAAIJ,eAAeC,EAAI,oBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG6jB,EAAK7jB,GACpB0lB,EAAiBgD,GAKfvoB,EAAIJ,eAAeC,EAAI,mBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG,EAAGA,GAClB2lB,EAAgB+C,GAOdvoB,EAAIJ,eAAeC,EAAI,qBACzB0oB,EAAIvoB,EAAIH,KACC0oB,EAAEf,KACTpD,SAASmE,EAAE,IAAK7E,EAAK,EAAG7jB,GACxBukB,SAASmE,EAAE,GAAI,EAAG7E,EAAK7jB,GACvB4lB,EAAa8C,EAAE,GACf7C,EAAa6C,EAAE,KAEfnE,SAASmE,GAAI7E,EAAKA,EAAK7jB,GACvB4lB,IAAeC,EAAa6C,EAAI,GAAKA,EAAIA,KAOzCvoB,EAAIJ,eAAeC,EAAI,SAEzB,IADA0oB,EAAIvoB,EAAIH,KACC0oB,EAAEf,IACTpD,SAASmE,EAAE,IAAK7E,GAAM,EAAG7jB,GACzBukB,SAASmE,EAAE,GAAI,EAAG7E,EAAK7jB,GACvB8lB,EAAU4C,EAAE,GACZ3C,EAAU2C,EAAE,OACP,CAEL,GADAnE,SAASmE,GAAI7E,EAAKA,EAAK7jB,IACnB0oB,EAGF,MAAMtf,MACJqa,EAAiBzjB,EAAI,oBAAsB0oB,GAH7C5C,IAAYC,EAAU2C,EAAI,GAAKA,EAAIA,GAWzC,GAAIvoB,EAAIJ,eAAeC,EAAI,UAAW,CAEpC,IADA0oB,EAAIvoB,EAAIH,QACI0oB,EAcV,MAAMtf,MACJqa,EAAiBzjB,EAAI,uBAAyB0oB,GAdhD,GAAIA,EAAG,CACL,GAAqB,oBAAVC,SAAyBA,SAClCA,OAAOC,kBAAmBD,OAAOE,YAIjC,MADA7C,GAAU0C,EACJtf,MACJqa,EAAiB,sBAJnBuC,EAAS0C,OAOX1C,EAAS0C,EA0Bf,GAhBIvoB,EAAIJ,eAAeC,EAAI,iBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG,EAAGA,GAClBimB,EAAcyC,GAKZvoB,EAAIJ,eAAeC,EAAI,mBAEzBukB,SADAmE,EAAIvoB,EAAIH,GACI,EAAG6jB,EAAK7jB,GACpBkmB,EAAgBwC,GAKdvoB,EAAIJ,eAAeC,EAAI,UAAW,CAEpC,GAAgB,iBADhB0oB,EAAIvoB,EAAIH,IAEH,MAAMoJ,MACTqa,EAAiBzjB,EAAI,mBAAqB0oB,GAFlBvC,EAASuC,EAOrC,GAAIvoB,EAAIJ,eAAeC,EAAI,YAAa,CAKtC,GAAgB,iBAJhB0oB,EAAIvoB,EAAIH,KAIqB,sBAAsB4V,KAAK8S,GAGtD,MAAMtf,MACJqa,EAAiBzjB,EAAI,aAAe0oB,GAHtChC,EAAWgC,GAenB,MAAO,CACLhD,eAAgBA,EAChBC,cAAeA,EACfmD,eAAgB,CAAClD,EAAYC,GAC7BkD,MAAO,CAACjD,EAASC,GACjBC,OAAQA,EACRC,YAAaA,EACbC,cAAeA,EACfC,OAAQA,EACRO,SAAUA,IAcd1d,UAAUggB,YAAc,SAAUN,GAChC,IAAKA,IAAwB,IAAnBA,EAAEO,aAAuB,OAAO,EAC1C,IAAKjgB,UAAUke,MAAO,OAAO,EAE7B,IAAIlpB,EAAGyB,EACLpB,EAAIqqB,EAAErqB,EACN4H,EAAIyiB,EAAEziB,EACNhG,EAAIyoB,EAAEzoB,EAERkE,EAAK,GAA2B,kBAAvB,GAAG8E,SAAS9K,KAAKE,IAExB,IAAW,IAAN4B,IAAkB,IAAPA,IAAagG,IAAM4d,GAAO5d,GAAK4d,GAAO5d,IAAMud,EAAUvd,GAAI,CAGxE,GAAa,IAAT5H,EAAE,GAAU,CACd,GAAU,IAAN4H,GAAwB,IAAb5H,EAAEsC,OAAc,OAAO,EACtC,MAAMwD,EASR,IALAnG,GAAKiI,EAAI,GAhiBJ,IAiiBG,IAAGjI,GAjiBN,IAqiBD+Q,OAAO1Q,EAAE,IAAIsC,QAAU3C,EAAG,CAE5B,IAAKA,EAAI,EAAGA,EAAIK,EAAEsC,OAAQ3C,IAExB,IADAyB,EAAIpB,EAAEL,IACE,GAAKyB,GAAKkkB,GAAQlkB,IAAM+jB,EAAU/jB,GAAI,MAAM0E,EAItD,GAAU,IAAN1E,EAAS,OAAO,SAKnB,GAAU,OAANpB,GAAoB,OAAN4H,IAAqB,OAANhG,GAAoB,IAANA,IAAkB,IAAPA,GAC/D,OAAO,EAGT,MAAMmJ,MACHqa,EAAiB,sBAAwBiF,IAS9C1f,UAAUkgB,QAAUlgB,UAAUwb,IAAM,WAClC,OAAOgD,SAASpkB,UAAWuB,EAAEwL,KAS/BnH,UAAUmgB,QAAUngB,UAAUgP,IAAM,WAClC,OAAOwP,SAASpkB,UAAWuB,EAAEykB,KAc/BpgB,UAAUwC,QAOJ2Z,EANU,iBAMQ3f,KAAKgG,SAAsB,QAC9C,WAAc,OAAOgY,EAPV,iBAOoBhe,KAAKgG,WACpC,WAAc,OAA2C,SAAlB,WAAhBhG,KAAKgG,SAAwB,IACnC,QAAhBhG,KAAKgG,SAAsB,IAExB,SAAU6d,GACf,IAAInkB,EAAGC,EAAGc,EAAGkC,EAAGugB,EACd1qB,EAAI,EACJK,EAAI,GACJirB,EAAO,IAAItgB,UAAUyc,GAOvB,GALU,MAAN4D,EAAYA,EAAK3D,EAChBnB,SAAS8E,EAAI,EAAGxF,GAErB1b,EAAIob,EAAS8F,EA9mBN,IAgnBHrD,EAGF,GAAI2C,OAAOC,gBAAiB,CAI1B,IAFA1jB,EAAIyjB,OAAOC,gBAAgB,IAAIW,YAAYphB,GAAK,IAEzCnK,EAAImK,IAQTugB,EAAW,OAAPxjB,EAAElH,IAAgBkH,EAAElH,EAAI,KAAO,MAM1B,MACPmH,EAAIwjB,OAAOC,gBAAgB,IAAIW,YAAY,IAC3CrkB,EAAElH,GAAKmH,EAAE,GACTD,EAAElH,EAAI,GAAKmH,EAAE,KAKb9G,EAAE4L,KAAKye,EAAI,MACX1qB,GAAK,GAGTA,EAAImK,EAAI,MAGH,KAAIwgB,OAAOE,YA2BhB,MADA7C,GAAS,EACH5c,MACJqa,EAAiB,sBAvBnB,IAFAve,EAAIyjB,OAAOE,YAAY1gB,GAAK,GAErBnK,EAAImK,IAMTugB,EAAmB,iBAAN,GAAPxjB,EAAElH,IAA0C,cAAXkH,EAAElH,EAAI,GAC9B,WAAXkH,EAAElH,EAAI,GAAgC,SAAXkH,EAAElH,EAAI,IACjCkH,EAAElH,EAAI,IAAM,KAAOkH,EAAElH,EAAI,IAAM,GAAKkH,EAAElH,EAAI,KAErC,KACP2qB,OAAOE,YAAY,GAAGW,KAAKtkB,EAAGlH,IAI9BK,EAAE4L,KAAKye,EAAI,MACX1qB,GAAK,GAGTA,EAAImK,EAAI,EASZ,IAAK6d,EAEH,KAAOhoB,EAAImK,IACTugB,EAAIvD,KACI,OAAM9mB,EAAEL,KAAO0qB,EAAI,MAc/B,IATAW,GA9rBO,IA6rBPlhB,EAAI9J,IAAIL,KAICqrB,IACPX,EAAI9E,EAlsBC,GAksBmByF,GACxBhrB,EAAEL,GAAKwlB,EAAUrb,EAAIugB,GAAKA,GAIZ,IAATrqB,EAAEL,GAAUK,EAAEspB,MAAO3pB,KAG5B,GAAIA,EAAI,EACNK,EAAI,CAAC4H,EAAI,OACJ,CAGL,IAAKA,GAAK,EAAa,IAAT5H,EAAE,GAAUA,EAAEorB,OAAO,EAAG,GAAIxjB,GA/sBrC,IAktBL,IAAKjI,EAAI,EAAG0qB,EAAIrqB,EAAE,GAAIqqB,GAAK,GAAIA,GAAK,GAAI1qB,KAGpCA,EArtBC,KAqtBaiI,GArtBb,GAqtB6BjI,GAKpC,OAFAsrB,EAAKrjB,EAAIA,EACTqjB,EAAKjrB,EAAIA,EACFirB,IAUXtgB,UAAU81C,IAAM,WAId,IAHA,IAAI9gD,EAAI,EACNmF,EAAOC,UACP07C,EAAM,IAAI91C,UAAU7F,EAAK,IACpBnF,EAAImF,EAAKxC,QAASm+C,EAAMA,EAAIlxB,KAAKzqB,EAAKnF,MAC7C,OAAO8gD,GAQT75B,EAAc,WAQZ,SAASyE,UAAU/E,EAAKgF,EAAQC,EAASjD,GAOvC,IANA,IAAI9c,EAEFggB,EADAtiB,EAAM,CAAC,GAEPvJ,EAAI,EACJ4K,EAAM+b,EAAIhkB,OAEL3C,EAAI4K,GAAM,CACf,IAAKihB,EAAOtiB,EAAI5G,OAAQkpB,IAAQtiB,EAAIsiB,IAASF,GAI7C,IAFApiB,EAAI,IAAMof,EAAStK,QAAQsI,EAAIxb,OAAOnL,MAEjC6L,EAAI,EAAGA,EAAItC,EAAI5G,OAAQkJ,IAEtBtC,EAAIsC,GAAK+f,EAAU,IACH,MAAdriB,EAAIsC,EAAI,KAAYtC,EAAIsC,EAAI,GAAK,GACrCtC,EAAIsC,EAAI,IAAMtC,EAAIsC,GAAK+f,EAAU,EACjCriB,EAAIsC,IAAM+f,GAKhB,OAAOriB,EAAIuiB,UAMb,OAAO,SAAUnF,EAAKgF,EAAQC,EAASG,EAAMC,GAC3C,IAAIrD,EAAUroB,EAAG2H,EAAGkC,EAAGrJ,EAAGqlB,EAAGE,EAAID,EAC/BpmB,EAAI2mB,EAAItI,QAAQ,KAChBgN,EAAK3D,EACL2B,EAAK1B,EA+BP,IA5BI3nB,GAAK,IACPmK,EAAI+d,EAGJA,EAAgB,EAChBvB,EAAMA,EAAImC,QAAQ,IAAK,IAEvB3C,GADAC,EAAI,IAAIpb,UAAU2gB,IACZM,IAAItF,EAAIhkB,OAAS3C,GACvBkoB,EAAgB/d,EAKhBic,EAAE/lB,EAAIqrB,UAAU9E,aAAab,cAAcI,EAAE9lB,GAAI8lB,EAAEle,EAAG,KACrD,GAAI2jB,EAxDK,cAyDVxF,EAAEne,EAAIme,EAAE/lB,EAAEsC,QAUZsF,EAAIkC,GALJkc,EAAKqF,UAAU/E,EAAKgF,EAAQC,EAASI,GACjCrD,EAAWD,EA/DH,eAgERC,EAhEQ,aAgEYD,KAGb/lB,OAGO,GAAX0jB,IAAKlc,GAASkc,EAAGsD,OAGxB,IAAKtD,EAAG,GAAI,OAAOsC,EAASxd,OAAO,GAqCnC,GAlCInL,EAAI,IACJiI,GAEFke,EAAE9lB,EAAIgmB,EACNF,EAAEle,EAAIA,EAGNke,EAAElkB,EAAI8pB,EAEN1F,GADAF,EAAIa,EAAIb,EAAGC,EAAGiF,EAAIhC,EAAIuC,IACfvrB,EACPS,EAAIqlB,EAAErlB,EACNmH,EAAIke,EAAEle,GASRjI,EAAIqmB,EAHJ/lB,EAAI2H,EAAIojB,EAAK,GAOblhB,EAAIyhB,EAAU,EACd9qB,EAAIA,GAAKR,EAAI,GAAkB,MAAb+lB,EAAG/lB,EAAI,GAEzBQ,EAAIuoB,EAAK,GAAU,MAALrpB,GAAac,KAAa,GAANuoB,GAAWA,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAC1DjC,EAAImK,GAAKnK,GAAKmK,IAAW,GAANkf,GAAWvoB,GAAW,GAANuoB,GAAuB,EAAZhD,EAAG/lB,EAAI,IACtD+oB,IAAOlD,EAAElkB,EAAI,EAAI,EAAI,IAKxB3B,EAAI,IAAM+lB,EAAG,GAGfM,EAAM7lB,EAAI8lB,aAAa+B,EAASxd,OAAO,IAAKkgB,EAAI1C,EAASxd,OAAO,IAAMwd,EAASxd,OAAO,OACjF,CAML,GAHAkb,EAAG1jB,OAASrC,EAGRQ,EAGF,MAAO8qB,IAAWvF,IAAK/lB,GAAKsrB,GAC1BvF,EAAG/lB,GAAK,EAEHA,MACD2H,EACFoe,EAAK,CAAC,GAAG9b,OAAO8b,IAMtB,IAAKlc,EAAIkc,EAAG1jB,QAAS0jB,IAAKlc,KAG1B,IAAKnK,EAAI,EAAG2mB,EAAM,GAAI3mB,GAAKmK,EAAGwc,GAAOgC,EAASxd,OAAOkb,EAAGrmB,OAGxD2mB,EAAMC,aAAaD,EAAK1e,EAAG0gB,EAASxd,OAAO,IAI7C,OAAOwb,GAjJG,GAuJdK,EAAM,WAGJ,SAASkF,SAAS/F,EAAGhc,EAAGgiB,GACtB,IAAI/rB,EAAGgsB,EAAMC,EAAKC,EAChBC,EAAQ,EACRvsB,EAAImmB,EAAExjB,OACN6pB,EAAMriB,EA34BA,IA44BNsiB,EAAMtiB,EA54BA,IA44BgB,EAExB,IAAKgc,EAAIA,EAAEra,QAAS9L,KAKlBusB,IADAH,EAAOI,GAHPH,EAAMlG,EAAEnmB,GA/4BF,MAi5BNI,EAAIqsB,EAAMJ,GADVC,EAAMnG,EAAEnmB,GAh5BF,IAg5BmB,GACHwsB,GAj5BhB,QAk5B6CD,GACnCJ,EAAO,IAAM/rB,EAn5BvB,IAm5BuC,GAAKqsB,EAAMH,EACxDnG,EAAEnmB,GAAKosB,EAAOD,EAKhB,OAFII,IAAOpG,EAAI,CAACoG,GAAOhiB,OAAO4b,IAEvBA,EAGT,SAASD,QAAQhf,EAAGC,EAAGulB,EAAIC,GACzB,IAAI3sB,EAAG4sB,EAEP,GAAIF,GAAMC,EACRC,EAAMF,EAAKC,EAAK,GAAK,OAGrB,IAAK3sB,EAAI4sB,EAAM,EAAG5sB,EAAI0sB,EAAI1sB,IAExB,GAAIkH,EAAElH,IAAMmH,EAAEnH,GAAI,CAChB4sB,EAAM1lB,EAAElH,GAAKmH,EAAEnH,GAAK,GAAK,EACzB,MAKN,OAAO4sB,EAGT,SAASC,SAAS3lB,EAAGC,EAAGulB,EAAIP,GAI1B,IAHA,IAAInsB,EAAI,EAGD0sB,KACLxlB,EAAEwlB,IAAO1sB,EACTA,EAAIkH,EAAEwlB,GAAMvlB,EAAEulB,GAAM,EAAI,EACxBxlB,EAAEwlB,GAAM1sB,EAAImsB,EAAOjlB,EAAEwlB,GAAMvlB,EAAEulB,GAI/B,MAAQxlB,EAAE,IAAMA,EAAEvE,OAAS,EAAGuE,EAAEukB,OAAO,EAAG,KAI5C,OAAO,SAAUtF,EAAGC,EAAGiF,EAAIhC,EAAI8C,GAC7B,IAAIS,EAAK3kB,EAAGjI,EAAG8sB,EAAMrrB,EAAGsrB,EAAMC,EAAOC,EAAGC,EAAIC,EAAKC,EAAMC,EAAMC,EAAIC,EAAIC,EACnEC,EAAIC,EACJzrB,EAAIkkB,EAAElkB,GAAKmkB,EAAEnkB,EAAI,GAAK,EACtBokB,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAGT,KAAKgmB,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAItb,UAGTmb,EAAElkB,GAAMmkB,EAAEnkB,IAAMokB,GAAKC,GAAMD,EAAG,IAAMC,EAAG,GAAMA,GAG7CD,GAAe,GAATA,EAAG,KAAYC,EAAS,EAAJrkB,EAAQA,EAAI,EAHa0rB,KAoBvD,IAZAT,GADAD,EAAI,IAAIjiB,UAAU/I,IACX5B,EAAI,GAEX4B,EAAIopB,GADJpjB,EAAIke,EAAEle,EAAIme,EAAEne,GACC,EAERkkB,IACHA,EAAOxG,EACP1d,EAAI6d,SAASK,EAAEle,EA79BV,IA69B0B6d,SAASM,EAAEne,EA79BrC,IA89BLhG,EAAIA,EA99BC,GA89Bc,GAKhBjC,EAAI,EAAGsmB,EAAGtmB,KAAOqmB,EAAGrmB,IAAM,GAAIA,KAInC,GAFIsmB,EAAGtmB,IAAMqmB,EAAGrmB,IAAM,IAAIiI,IAEtBhG,EAAI,EACNirB,EAAGjhB,KAAK,GACR6gB,GAAO,MACF,CAwBL,IAvBAS,EAAKlH,EAAG1jB,OACR8qB,EAAKnH,EAAG3jB,OACR3C,EAAI,EACJiC,GAAK,GAILR,EAAI+jB,EAAU2G,GAAQ7F,EAAG,GAAK,KAItB,IACNA,EAAK4F,SAAS5F,EAAI7kB,EAAG0qB,GACrB9F,EAAK6F,SAAS7F,EAAI5kB,EAAG0qB,GACrBsB,EAAKnH,EAAG3jB,OACR4qB,EAAKlH,EAAG1jB,QAGV2qB,EAAKG,EAELL,GADAD,EAAM9G,EAAGva,MAAM,EAAG2hB,IACP9qB,OAGJyqB,EAAOK,EAAIN,EAAIC,KAAU,GAChCM,EAAKpH,EAAGxa,QACR4hB,EAAK,CAAC,GAAGnjB,OAAOmjB,GAChBF,EAAMlH,EAAG,GACLA,EAAG,IAAM6F,EAAO,GAAGqB,IAIvB,EAAG,CAOD,GANA/rB,EAAI,GAGJmrB,EAAM1G,QAAQI,EAAI6G,EAAKM,EAAIL,IAGjB,EAAG,CAqBX,GAjBAC,EAAOF,EAAI,GACPM,GAAML,IAAMC,EAAOA,EAAOlB,GAAQgB,EAAI,IAAM,KAGhD1rB,EAAI+jB,EAAU6H,EAAOG,IAab,EAcN,IAXI/rB,GAAK0qB,IAAM1qB,EAAI0qB,EAAO,GAI1Ba,GADAD,EAAOb,SAAS5F,EAAI7kB,EAAG0qB,IACVxpB,OACbyqB,EAAOD,EAAIxqB,OAM+B,GAAnCujB,QAAQ6G,EAAMI,EAAKH,EAAOI,IAC/B3rB,IAGAorB,SAASE,EAAMU,EAAKT,EAAQU,EAAKpH,EAAI0G,EAAOb,GAC5Ca,EAAQD,EAAKpqB,OACbiqB,EAAM,OAQC,GAALnrB,IAGFmrB,EAAMnrB,EAAI,GAKZurB,GADAD,EAAOzG,EAAGxa,SACGnJ,OAUf,GAPIqqB,EAAQI,IAAML,EAAO,CAAC,GAAGxiB,OAAOwiB,IAGpCF,SAASM,EAAKJ,EAAMK,EAAMjB,GAC1BiB,EAAOD,EAAIxqB,QAGC,GAARiqB,EAMF,KAAO1G,QAAQI,EAAI6G,EAAKM,EAAIL,GAAQ,GAClC3rB,IAGAorB,SAASM,EAAKM,EAAKL,EAAOM,EAAKpH,EAAI8G,EAAMjB,GACzCiB,EAAOD,EAAIxqB,YAGE,IAARiqB,IACTnrB,IACA0rB,EAAM,CAAC,IAITD,EAAGltB,KAAOyB,EAGN0rB,EAAI,GACNA,EAAIC,KAAU/G,EAAGiH,IAAO,GAExBH,EAAM,CAAC9G,EAAGiH,IACVF,EAAO,UAEDE,IAAOC,GAAgB,MAAVJ,EAAI,KAAelrB,KAE1C6qB,EAAiB,MAAVK,EAAI,GAGND,EAAG,IAAIA,EAAGzB,OAAO,EAAG,GAG3B,GAAIU,GAAQxG,EAAM,CAGhB,IAAK3lB,EAAI,EAAGiC,EAAIirB,EAAG,GAAIjrB,GAAK,GAAIA,GAAK,GAAIjC,KAEzCipB,MAAMgE,EAAG5B,GAAM4B,EAAEhlB,EAAIjI,EA9nChB,GA8nCoBiI,EAAe,GAAK,EAAGohB,EAAIyD,QAIpDG,EAAEhlB,EAAIA,EACNglB,EAAEnsB,GAAKgsB,EAGT,OAAOG,GA9PL,GAgYA7F,EAAa,8BACfC,EAAW,cACXC,EAAY,cACZC,EAAkB,qBAClBC,EAAmB,6BALvBN,EAOS,SAAUf,EAAGQ,EAAKkC,EAAO1hB,GAC9B,IAAIglB,EACFlqB,EAAI4mB,EAAQlC,EAAMA,EAAImC,QAAQtB,EAAkB,IAGlD,GAAID,EAAgB3P,KAAK3V,GACvBkkB,EAAElkB,EAAIyO,MAAMzO,GAAK,KAAOA,EAAI,GAAK,EAAI,MAChC,CACL,IAAK4mB,IAGH5mB,EAAIA,EAAE6mB,QAAQ1B,GAAY,SAAUhnB,EAAGwtB,EAAIC,GAEzC,OADA1B,EAAkC,MAA1B0B,EAAKA,EAAG1E,eAAwB,GAAW,KAAN0E,EAAY,EAAI,EACrD1mB,GAAKA,GAAKglB,EAAY/rB,EAALwtB,KAGvBzmB,IACFglB,EAAOhlB,EAGPlF,EAAIA,EAAE6mB,QAAQzB,EAAU,MAAMyB,QAAQxB,EAAW,SAG/CX,GAAO1kB,GAAG,OAAO,IAAI+I,UAAU/I,EAAGkqB,GAKxC,GAAInhB,UAAUke,MACZ,MAAM9d,MACHqa,EAAiB,SAAWte,EAAI,SAAWA,EAAI,IAAM,YAAcwf,GAIxER,EAAElkB,EAAI,KAGRkkB,EAAE9lB,EAAI8lB,EAAEle,EAAI,MA6LhBtB,EAAEmnB,cAAgBnnB,EAAEonB,IAAM,WACxB,IAAI5H,EAAI,IAAInb,UAAU9F,MAEtB,OADIihB,EAAElkB,EAAI,IAAGkkB,EAAElkB,EAAI,GACZkkB,GAWTxf,EAAEqnB,WAAa,SAAU5H,EAAGjf,GAC1B,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,KAiBxCR,EAAEsnB,cAAgBtnB,EAAE0kB,GAAK,SAAUA,EAAIhC,GACrC,IAAIhpB,EAAGoB,EAAGipB,EACRvE,EAAIjhB,KAEN,GAAU,MAANmmB,EAKF,OAJA9E,SAAS8E,EAAI,EAAGxF,GACN,MAANwD,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GAEdJ,MAAM,IAAIje,UAAUmb,GAAIkF,EAAKlF,EAAEle,EAAI,EAAGohB,GAG/C,KAAMhpB,EAAI8lB,EAAE9lB,GAAI,OAAO,KAIvB,GAHAoB,EA7hDS,KA6hDHipB,EAAIrqB,EAAEsC,OAAS,GAAKmjB,SAAS5gB,KAAK+C,EA7hD/B,KAgiDLyiB,EAAIrqB,EAAEqqB,GAAI,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIjpB,KAG3C,OAFIA,EAAI,IAAGA,EAAI,GAERA,GAwBTkF,EAAEunB,UAAYvnB,EAAEqgB,IAAM,SAAUZ,EAAGjf,GACjC,OAAO6f,EAAI9hB,KAAM,IAAI8F,UAAUob,EAAGjf,GAAIugB,EAAgBC,IAQxDhhB,EAAEwnB,mBAAqBxnB,EAAEynB,KAAO,SAAUhI,EAAGjf,GAC3C,OAAO6f,EAAI9hB,KAAM,IAAI8F,UAAUob,EAAGjf,GAAI,EAAG,IAmB3CR,EAAE0nB,gBAAkB1nB,EAAEslB,IAAM,SAAUxqB,EAAGrB,GACvC,IAAIkuB,EAAMC,EAAUvuB,EAAGmK,EAASqkB,EAAQC,EAAQC,EAAQtI,EACtDD,EAAIjhB,KAKN,IAHAzD,EAAI,IAAIuJ,UAAUvJ,IAGZpB,IAAMoB,EAAEktB,YACZ,MAAMvjB,MACHqa,EAAiB,4BAA8BjV,QAAQ/O,IAS5D,GANS,MAALrB,IAAWA,EAAI,IAAI4K,UAAU5K,IAGjCouB,EAAS/sB,EAAEwG,EAAI,IAGVke,EAAE9lB,IAAM8lB,EAAE9lB,EAAE,IAAgB,GAAV8lB,EAAE9lB,EAAE,KAAY8lB,EAAEle,GAAmB,GAAdke,EAAE9lB,EAAEsC,SAAgBlB,EAAEpB,IAAMoB,EAAEpB,EAAE,GAK5E,OADA+lB,EAAI,IAAIpb,UAAUxD,KAAKykB,KAAKzb,QAAQ2V,GAAIqI,EAAS,EAAI/H,MAAMhlB,IAAM+O,QAAQ/O,KAClErB,EAAIgmB,EAAEwI,IAAIxuB,GAAKgmB,EAKxB,GAFAqI,EAAShtB,EAAEQ,EAAI,EAEX7B,EAAG,CAGL,GAAIA,EAAEC,GAAKD,EAAEC,EAAE,IAAMD,EAAE6B,EAAG,OAAO,IAAI+I,UAAU2iB,MAE/CY,GAAYE,GAAUtI,EAAEwI,aAAevuB,EAAEuuB,eAE3BxI,EAAIA,EAAEyI,IAAIxuB,QAInB,IAAIqB,EAAEwG,EAAI,IAAMke,EAAEle,EAAI,GAAKke,EAAEle,GAAK,IAAa,GAAPke,EAAEle,EAE7Cke,EAAE9lB,EAAE,GAAK,GAAKmuB,GAAUrI,EAAE9lB,EAAE,IAAM,KAElC8lB,EAAE9lB,EAAE,GAAK,MAAQmuB,GAAUrI,EAAE9lB,EAAE,IAAM,YASvC,OANA8J,EAAIgc,EAAElkB,EAAI,GAAKwkB,MAAMhlB,IAAM,EAAI,EAG3B0kB,EAAEle,GAAK,IAAGkC,EAAI,EAAIA,GAGf,IAAIa,UAAUyjB,EAAS,EAAItkB,EAAIA,GAE7B+d,IAKT/d,EAAIob,EAAS2C,EAnpDN,GAmpDiC,IAe1C,IAZIsG,GACFF,EAAO,IAAItjB,UAAU,IACjByjB,IAAQhtB,EAAEQ,EAAI,GAClBysB,EAASjI,MAAMhlB,IAGfitB,GADA1uB,EAAIwH,KAAKumB,KAAKvd,QAAQ/O,KACT,EAGf2kB,EAAI,IAAIpb,UAAUyc,KAGR,CAER,GAAIiH,EAAQ,CAEV,KADAtI,EAAIA,EAAEyI,MAAM1I,IACL9lB,EAAG,MAEN8J,EACEic,EAAE/lB,EAAEsC,OAASwH,IAAGic,EAAE/lB,EAAEsC,OAASwH,GACxBokB,IACTnI,EAAIA,EAAEwI,IAAIxuB,IAId,GAAIJ,EAAG,CAEL,GAAU,KADVA,EAAIwlB,EAAUxlB,EAAI,IACL,MACb0uB,EAAS1uB,EAAI,OAKb,GAFAipB,MADAxnB,EAAIA,EAAEotB,MAAMP,GACH7sB,EAAEwG,EAAI,EAAG,GAEdxG,EAAEwG,EAAI,GACRymB,EAASjI,MAAMhlB,OACV,CAEL,GAAU,KADVzB,GAAKwQ,QAAQ/O,IACA,MACbitB,EAAS1uB,EAAI,EAIjBmmB,EAAIA,EAAE0I,MAAM1I,GAERhc,EACEgc,EAAE9lB,GAAK8lB,EAAE9lB,EAAEsC,OAASwH,IAAGgc,EAAE9lB,EAAEsC,OAASwH,GAC/BokB,IACTpI,EAAIA,EAAEyI,IAAIxuB,IAId,OAAImuB,EAAiBnI,GACjBqI,IAAQrI,EAAIqB,EAAIT,IAAIZ,IAEjBhmB,EAAIgmB,EAAEwI,IAAIxuB,GAAK+J,EAAI8e,MAAM7C,EAAG8B,EAAeP,OAnHxBmF,GAmH+C1G,IAY3Ezf,EAAEmoB,aAAe,SAAUzF,GACzB,IAAI5nB,EAAI,IAAIuJ,UAAU9F,MAGtB,OAFU,MAANmkB,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GACdJ,MAAMxnB,EAAGA,EAAEwG,EAAI,EAAGohB,IAQ3B1iB,EAAEooB,UAAYpoB,EAAEkJ,GAAK,SAAUuW,EAAGjf,GAChC,OAA8C,IAAvC+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,KAOxCR,EAAEqoB,SAAW,WACX,QAAS9pB,KAAK7E,GAQhBsG,EAAEsoB,cAAgBtoB,EAAEykB,GAAK,SAAUhF,EAAGjf,GACpC,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,IAAM,GAQ9CR,EAAEuoB,uBAAyBvoB,EAAEwoB,IAAM,SAAU/I,EAAGjf,GAC9C,OAAoD,KAA5CA,EAAI+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,MAAoB,IAANA,GAQ3DR,EAAEgoB,UAAY,WACZ,QAASzpB,KAAK7E,GAAKylB,SAAS5gB,KAAK+C,EAxwDxB,IAwwDwC/C,KAAK7E,EAAEsC,OAAS,GAQnEgE,EAAEyoB,WAAazoB,EAAEwL,GAAK,SAAUiU,EAAGjf,GACjC,OAAO+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,IAAM,GAQ9CR,EAAE0oB,oBAAsB1oB,EAAE2oB,IAAM,SAAUlJ,EAAGjf,GAC3C,OAAqD,KAA7CA,EAAI+e,QAAQhhB,KAAM,IAAI8F,UAAUob,EAAGjf,MAAqB,IAANA,GAO5DR,EAAE+J,MAAQ,WACR,OAAQxL,KAAKjD,GAOf0E,EAAE4oB,WAAa,WACb,OAAOrqB,KAAKjD,EAAI,GAOlB0E,EAAE6oB,WAAa,WACb,OAAOtqB,KAAKjD,EAAI,GAOlB0E,EAAE8oB,OAAS,WACT,QAASvqB,KAAK7E,GAAkB,GAAb6E,KAAK7E,EAAE,IAwB5BsG,EAAE+oB,MAAQ,SAAUtJ,EAAGjf,GACrB,IAAInH,EAAG6L,EAAG3K,EAAGyuB,EACXxJ,EAAIjhB,KACJgC,EAAIif,EAAElkB,EAMR,GAHAkF,GADAif,EAAI,IAAIpb,UAAUob,EAAGjf,IACflF,GAGDiF,IAAMC,EAAG,OAAO,IAAI6D,UAAU2iB,KAGnC,GAAIzmB,GAAKC,EAEP,OADAif,EAAEnkB,GAAKkF,EACAgf,EAAEyJ,KAAKxJ,GAGhB,IAAIyJ,EAAK1J,EAAEle,EAn2DF,GAo2DP6nB,EAAK1J,EAAEne,EAp2DA,GAq2DPoe,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAET,IAAKwvB,IAAOC,EAAI,CAGd,IAAKzJ,IAAOC,EAAI,OAAOD,GAAMD,EAAEnkB,GAAKkF,EAAGif,GAAK,IAAIpb,UAAUsb,EAAKH,EAAIwH,KAGnE,IAAKtH,EAAG,KAAOC,EAAG,GAGhB,OAAOA,EAAG,IAAMF,EAAEnkB,GAAKkF,EAAGif,GAAK,IAAIpb,UAAUqb,EAAG,GAAKF,EAGnC,GAAjBwB,GAAsB,EAAI,GAS/B,GALAkI,EAAK/J,SAAS+J,GACdC,EAAKhK,SAASgK,GACdzJ,EAAKA,EAAGva,QAGJ5E,EAAI2oB,EAAKC,EAAI,CAaf,KAXIH,EAAOzoB,EAAI,IACbA,GAAKA,EACLhG,EAAImlB,IAEJyJ,EAAKD,EACL3uB,EAAIolB,GAGNplB,EAAE4qB,UAGG3kB,EAAID,EAAGC,IAAKjG,EAAE+K,KAAK,IACxB/K,EAAE4qB,eAMF,IAFAjgB,GAAK8jB,GAAQzoB,EAAImf,EAAG1jB,SAAWwE,EAAImf,EAAG3jB,SAAWuE,EAAIC,EAEhDD,EAAIC,EAAI,EAAGA,EAAI0E,EAAG1E,IAErB,GAAIkf,EAAGlf,IAAMmf,EAAGnf,GAAI,CAClBwoB,EAAOtJ,EAAGlf,GAAKmf,EAAGnf,GAClB,MAYN,GANIwoB,IAAMzuB,EAAImlB,EAAIA,EAAKC,EAAIA,EAAKplB,EAAGklB,EAAEnkB,GAAKmkB,EAAEnkB,IAE5CkF,GAAK0E,EAAIya,EAAG3jB,SAAW3C,EAAIqmB,EAAG1jB,SAItB,EAAG,KAAOwE,IAAKkf,EAAGrmB,KAAO,GAIjC,IAHAmH,EAAIwe,EAAO,EAGJ9Z,EAAI3E,GAAI,CAEb,GAAImf,IAAKxa,GAAKya,EAAGza,GAAI,CACnB,IAAK7L,EAAI6L,EAAG7L,IAAMqmB,IAAKrmB,GAAIqmB,EAAGrmB,GAAKmH,KACjCkf,EAAGrmB,GACLqmB,EAAGxa,IAAM8Z,EAGXU,EAAGxa,IAAMya,EAAGza,GAId,KAAgB,GAATwa,EAAG,GAASA,EAAGoF,OAAO,EAAG,KAAMqE,GAGtC,OAAKzJ,EAAG,GAWDqD,UAAUtD,EAAGC,EAAIyJ,IAPtB1J,EAAEnkB,EAAqB,GAAjB0lB,GAAsB,EAAI,EAChCvB,EAAE/lB,EAAI,CAAC+lB,EAAEne,EAAI,GACNme,IA8BXzf,EAAEopB,OAASppB,EAAEioB,IAAM,SAAUxI,EAAGjf,GAC9B,IAAI8lB,EAAGhrB,EACLkkB,EAAIjhB,KAKN,OAHAkhB,EAAI,IAAIpb,UAAUob,EAAGjf,IAGhBgf,EAAE9lB,IAAM+lB,EAAEnkB,GAAKmkB,EAAE/lB,IAAM+lB,EAAE/lB,EAAE,GACvB,IAAI2K,UAAU2iB,MAGXvH,EAAE/lB,GAAK8lB,EAAE9lB,IAAM8lB,EAAE9lB,EAAE,GACtB,IAAI2K,UAAUmb,IAGJ,GAAf8B,GAIFhmB,EAAImkB,EAAEnkB,EACNmkB,EAAEnkB,EAAI,EACNgrB,EAAIjG,EAAIb,EAAGC,EAAG,EAAG,GACjBA,EAAEnkB,EAAIA,EACNgrB,EAAEhrB,GAAKA,GAEPgrB,EAAIjG,EAAIb,EAAGC,EAAG,EAAG6B,IAGnB7B,EAAID,EAAEuJ,MAAMzC,EAAE4B,MAAMzI,KAGb/lB,EAAE,IAAqB,GAAf4nB,IAAkB7B,EAAEnkB,EAAIkkB,EAAElkB,GAElCmkB,IAwBTzf,EAAEqpB,aAAerpB,EAAEkoB,MAAQ,SAAUzI,EAAGjf,GACtC,IAAI9G,EAAG4H,EAAGjI,EAAG6L,EAAG1B,EAAG/J,EAAG6vB,EAAK5D,EAAKC,EAAK4D,EAAKC,EAAKC,EAAKC,EAClDlE,EACAhG,EAAIjhB,KACJmhB,EAAKF,EAAE9lB,EACPimB,GAAMF,EAAI,IAAIpb,UAAUob,EAAGjf,IAAI9G,EAGjC,KAAKgmB,GAAOC,GAAOD,EAAG,IAAOC,EAAG,IAmB9B,OAhBKH,EAAElkB,IAAMmkB,EAAEnkB,GAAKokB,IAAOA,EAAG,KAAOC,GAAMA,IAAOA,EAAG,KAAOD,EAC1DD,EAAE/lB,EAAI+lB,EAAEne,EAAIme,EAAEnkB,EAAI,MAElBmkB,EAAEnkB,GAAKkkB,EAAElkB,EAGJokB,GAAOC,GAKVF,EAAE/lB,EAAI,CAAC,GACP+lB,EAAEne,EAAI,GALNme,EAAE/lB,EAAI+lB,EAAEne,EAAI,MASTme,EAYT,IATAne,EAAI6d,SAASK,EAAEle,EA/iEN,IA+iEsB6d,SAASM,EAAEne,EA/iEjC,IAgjETme,EAAEnkB,GAAKkkB,EAAElkB,GACTguB,EAAM5J,EAAG1jB,SACTutB,EAAM5J,EAAG3jB,UAGM0tB,EAAKhK,EAAIA,EAAKC,EAAIA,EAAK+J,EAAIrwB,EAAIiwB,EAAKA,EAAMC,EAAKA,EAAMlwB,GAG/DA,EAAIiwB,EAAMC,EAAKG,EAAK,GAAIrwB,IAAKqwB,EAAGpkB,KAAK,IAK1C,IAHAkgB,EAAOxG,EAtjEG,IAyjEL3lB,EAAIkwB,IAAOlwB,GAAK,GAAI,CAKvB,IAJAK,EAAI,EACJ8vB,EAAM7J,EAAGtmB,GA3jED,IA4jERowB,EAAM9J,EAAGtmB,GA5jED,IA4jEiB,EAEX6L,EAAI7L,GAAbmK,EAAI8lB,GAAgBpkB,EAAI7L,GAK3BK,IADAgsB,EAAM8D,GAHN9D,EAAMhG,IAAKlc,GA/jEL,MAikEN/J,EAAIgwB,EAAM/D,GADVC,EAAMjG,EAAGlc,GAhkEH,IAgkEmB,GACHgmB,GAjkEhB,QAkkE0CE,EAAGxkB,GAAKxL,GAC7C8rB,EAAO,IAAM/rB,EAnkElB,IAmkEiC,GAAKgwB,EAAM9D,EAClD+D,EAAGxkB,KAAOwgB,EAAMF,EAGlBkE,EAAGxkB,GAAKxL,EASV,OANIA,IACA4H,EAEFooB,EAAG5E,OAAO,EAAG,GAGR/B,UAAUtD,EAAGiK,EAAIpoB,IAQ1BtB,EAAE2pB,QAAU,WACV,IAAInK,EAAI,IAAInb,UAAU9F,MAEtB,OADAihB,EAAElkB,GAAKkkB,EAAElkB,GAAK,KACPkkB,GAwBTxf,EAAEipB,KAAO,SAAUxJ,EAAGjf,GACpB,IAAIjG,EACFilB,EAAIjhB,KACJgC,EAAIif,EAAElkB,EAMR,GAHAkF,GADAif,EAAI,IAAIpb,UAAUob,EAAGjf,IACflF,GAGDiF,IAAMC,EAAG,OAAO,IAAI6D,UAAU2iB,KAGlC,GAAIzmB,GAAKC,EAER,OADAif,EAAEnkB,GAAKkF,EACAgf,EAAEuJ,MAAMtJ,GAGjB,IAAIyJ,EAAK1J,EAAEle,EAxoEF,GAyoEP6nB,EAAK1J,EAAEne,EAzoEA,GA0oEPoe,EAAKF,EAAE9lB,EACPimB,EAAKF,EAAE/lB,EAET,IAAKwvB,IAAOC,EAAI,CAGd,IAAKzJ,IAAOC,EAAI,OAAO,IAAItb,UAAU9D,EAAI,GAIzC,IAAKmf,EAAG,KAAOC,EAAG,GAAI,OAAOA,EAAG,GAAKF,EAAI,IAAIpb,UAAUqb,EAAG,GAAKF,EAAQ,EAAJjf,GAQrE,GALA2oB,EAAK/J,SAAS+J,GACdC,EAAKhK,SAASgK,GACdzJ,EAAKA,EAAGva,QAGJ5E,EAAI2oB,EAAKC,EAAI,CAUf,IATI5oB,EAAI,GACN4oB,EAAKD,EACL3uB,EAAIolB,IAEJpf,GAAKA,EACLhG,EAAImlB,GAGNnlB,EAAE4qB,UACK5kB,IAAKhG,EAAE+K,KAAK,IACnB/K,EAAE4qB,UAUJ,KAPA5kB,EAAImf,EAAG1jB,SACPwE,EAAImf,EAAG3jB,QAGK,IAAGzB,EAAIolB,EAAIA,EAAKD,EAAIA,EAAKnlB,EAAGiG,EAAID,GAGvCA,EAAI,EAAGC,GACVD,GAAKmf,IAAKlf,GAAKkf,EAAGlf,GAAKmf,EAAGnf,GAAKD,GAAKye,EAAO,EAC3CU,EAAGlf,GAAKwe,IAASU,EAAGlf,GAAK,EAAIkf,EAAGlf,GAAKwe,EAUvC,OAPIze,IACFmf,EAAK,CAACnf,GAAGqD,OAAO8b,KACdyJ,GAKGpG,UAAUtD,EAAGC,EAAIyJ,IAmB1BnpB,EAAE4pB,UAAY5pB,EAAEijB,GAAK,SAAUA,EAAIP,GACjC,IAAIhpB,EAAGoB,EAAGipB,EACRvE,EAAIjhB,KAEN,GAAU,MAAN0kB,GAAcA,MAASA,EAKzB,OAJArD,SAASqD,EAAI,EAAG/D,GACN,MAANwD,EAAYA,EAAK1B,EAChBpB,SAAS8C,EAAI,EAAG,GAEdJ,MAAM,IAAIje,UAAUmb,GAAIyD,EAAIP,GAGrC,KAAMhpB,EAAI8lB,EAAE9lB,GAAI,OAAO,KAIvB,GAFAoB,EA9tES,IA6tETipB,EAAIrqB,EAAEsC,OAAS,GACI,EAEf+nB,EAAIrqB,EAAEqqB,GAAI,CAGZ,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIjpB,KAG7B,IAAKipB,EAAIrqB,EAAE,GAAIqqB,GAAK,GAAIA,GAAK,GAAIjpB,MAKnC,OAFImoB,GAAMzD,EAAEle,EAAI,EAAIxG,IAAGA,EAAI0kB,EAAEle,EAAI,GAE1BxG,GAYTkF,EAAE6pB,UAAY,SAAUrmB,GAEtB,OADAoc,SAASpc,GAvvEQ,mCAwvEVjF,KAAK2pB,MAAM,KAAO1kB,IAe3BxD,EAAE8pB,WAAa9pB,EAAE+pB,KAAO,WACtB,IAAItwB,EAAGqB,EAAGX,EAAG6vB,EAAKzvB,EAChBilB,EAAIjhB,KACJ7E,EAAI8lB,EAAE9lB,EACN4B,EAAIkkB,EAAElkB,EACNgG,EAAIke,EAAEle,EACNojB,EAAK3D,EAAiB,EACtB4G,EAAO,IAAItjB,UAAU,OAGvB,GAAU,IAAN/I,IAAY5B,IAAMA,EAAE,GACtB,OAAO,IAAI2K,WAAW/I,GAAKA,EAAI,KAAO5B,GAAKA,EAAE,IAAMstB,IAAMttB,EAAI8lB,EAAI,KA8BnE,GAtBS,IAJTlkB,EAAIuF,KAAKkpB,MAAMlgB,QAAQ2V,MAITlkB,GAAK,OACjBR,EAAIskB,cAAc1lB,IACXsC,OAASsF,GAAK,GAAK,IAAGxG,GAAK,KAClCQ,EAAIuF,KAAKkpB,MAAMjvB,GACfwG,EAAI6d,UAAU7d,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS1CnH,EAAI,IAAIkK,UANNvJ,EADEQ,GAAK,IACH,KAAOgG,GAEXxG,EAAIQ,EAAEykB,iBACA5a,MAAM,EAAGrK,EAAE4c,QAAQ,KAAO,GAAKpW,IAKvCnH,EAAI,IAAIkK,UAAU/I,EAAI,IAOpBnB,EAAET,EAAE,GAMN,KAJA4B,GADAgG,EAAInH,EAAEmH,GACEojB,GACA,IAAGppB,EAAI,KAOb,GAHAf,EAAIJ,EACJA,EAAIwtB,EAAKO,MAAM3tB,EAAE0uB,KAAK5I,EAAIb,EAAGjlB,EAAGmqB,EAAI,KAEhCtF,cAAc7kB,EAAEb,GAAGyL,MAAM,EAAG7J,MAAQR,EAAIskB,cAAcjlB,EAAET,IAAIyL,MAAM,EAAG7J,GAAI,CAW3E,GANInB,EAAEmH,EAAIA,KAAKhG,EAMN,SALTR,EAAIA,EAAEqK,MAAM7J,EAAI,EAAGA,EAAI,MAKH0uB,GAAY,QAALlvB,GAgBpB,EAICA,KAAOA,EAAEqK,MAAM,IAAqB,KAAfrK,EAAE0J,OAAO,MAGlC8d,MAAMnoB,EAAGA,EAAEmH,EAAIyf,EAAiB,EAAG,GACnCtnB,GAAKU,EAAE+tB,MAAM/tB,GAAG+O,GAAGsW,IAGrB,MAvBA,IAAKwK,IACH1H,MAAM/nB,EAAGA,EAAE+G,EAAIyf,EAAiB,EAAG,GAE/BxmB,EAAE2tB,MAAM3tB,GAAG2O,GAAGsW,IAAI,CACpBrlB,EAAII,EACJ,MAIJmqB,GAAM,EACNppB,GAAK,EACL0uB,EAAM,EAkBd,OAAO1H,MAAMnoB,EAAGA,EAAEmH,EAAIyf,EAAiB,EAAGC,EAAevnB,IAa3DuG,EAAE+f,cAAgB,SAAU2E,EAAIhC,GAK9B,OAJU,MAANgC,IACF9E,SAAS8E,EAAI,EAAGxF,GAChBwF,KAEKjC,OAAOlkB,KAAMmmB,EAAIhC,EAAI,IAgB9B1iB,EAAEiqB,QAAU,SAAUvF,EAAIhC,GAKxB,OAJU,MAANgC,IACF9E,SAAS8E,EAAI,EAAGxF,GAChBwF,EAAKA,EAAKnmB,KAAK+C,EAAI,GAEdmhB,OAAOlkB,KAAMmmB,EAAIhC,IA6B1B1iB,EAAEkqB,SAAW,SAAUxF,EAAIhC,EAAID,GAC7B,IAAIzC,EACFR,EAAIjhB,KAEN,GAAc,MAAVkkB,EACQ,MAANiC,GAAchC,GAAmB,iBAANA,GAC7BD,EAASC,EACTA,EAAK,MACIgC,GAAmB,iBAANA,GACtBjC,EAASiC,EACTA,EAAKhC,EAAK,MAEVD,EAASjB,OAEN,GAAqB,iBAAViB,EAChB,MAAMhe,MACHqa,EAAiB,2BAA6B2D,GAKnD,GAFAzC,EAAMR,EAAEyK,QAAQvF,EAAIhC,GAEhBlD,EAAE9lB,EAAG,CACP,IAAIL,EACFuJ,EAAMod,EAAInb,MAAM,KAChBslB,GAAM1H,EAAOd,UACbyI,GAAM3H,EAAOb,mBACbF,EAAiBe,EAAOf,gBAAkB,GAC1C2I,EAAUznB,EAAI,GACd0nB,EAAe1nB,EAAI,GACnB2nB,EAAQ/K,EAAElkB,EAAI,EACdkvB,EAAYD,EAAQF,EAAQllB,MAAM,GAAKklB,EACvCpmB,EAAMumB,EAAUxuB,OAIlB,GAFIouB,IAAI/wB,EAAI8wB,EAAIA,EAAKC,EAAIA,EAAK/wB,EAAG4K,GAAO5K,GAEpC8wB,EAAK,GAAKlmB,EAAM,EAAG,CAGrB,IAFA5K,EAAI4K,EAAMkmB,GAAMA,EAChBE,EAAUG,EAAUC,OAAO,EAAGpxB,GACvBA,EAAI4K,EAAK5K,GAAK8wB,EAAIE,GAAW3I,EAAiB8I,EAAUC,OAAOpxB,EAAG8wB,GACrEC,EAAK,IAAGC,GAAW3I,EAAiB8I,EAAUrlB,MAAM9L,IACpDkxB,IAAOF,EAAU,IAAMA,GAG7BrK,EAAMsK,EACHD,GAAW5H,EAAOhB,kBAAoB,MAAQ2I,GAAM3H,EAAOX,mBAC1DwI,EAAanI,QAAQ,IAAIrd,OAAO,OAASslB,EAAK,OAAQ,KACvD,MAAQ3H,EAAOZ,wBAA0B,KACxCyI,GACDD,EAGL,OAAQ5H,EAAO0pB,QAAU,IAAMnsB,GAAOyC,EAAOigB,QAAU,KAezD1iC,EAAE0qB,WAAa,SAAUC,GACvB,IAAIhxB,EAAGixB,EAAIC,EAAIC,EAAIxpB,EAAGypB,EAAKjwB,EAAGkwB,EAAIC,EAAI3E,EAAGnsB,EAAGmB,EAC1CkkB,EAAIjhB,KACJmhB,EAAKF,EAAE9lB,EAET,GAAU,MAANixB,MACF7vB,EAAI,IAAIuJ,UAAUsmB,IAGX3C,cAAgBltB,EAAEpB,GAAa,IAARoB,EAAEQ,IAAYR,EAAE0Q,GAAGsV,IAC/C,MAAMrc,MACHqa,EAAiB,aACfhkB,EAAEktB,YAAc,iBAAmB,oBAAsBne,QAAQ/O,IAI1E,IAAK4kB,EAAI,OAAO,IAAIrb,UAAUmb,GAoB9B,IAlBA7lB,EAAI,IAAI0K,UAAUyc,GAClBmK,EAAKL,EAAK,IAAIvmB,UAAUyc,GACxB+J,EAAKG,EAAK,IAAI3mB,UAAUyc,GACxBxlB,EAAI8jB,cAAcM,GAIlBpe,EAAI3H,EAAE2H,EAAIhG,EAAEU,OAASwjB,EAAEle,EAAI,EAC3B3H,EAAED,EAAE,GAAKulB,GAAU8L,EAAMzpB,EAvgFhB,IAugFgC,EAvgFhC,GAugF+CypB,EAAMA,GAC9DJ,GAAMA,GAAM7vB,EAAEusB,WAAW1tB,GAAK,EAAK2H,EAAI,EAAI3H,EAAIsxB,EAAMnwB,EAErDiwB,EAAM3J,EACNA,EAAU,IACVtmB,EAAI,IAAIuJ,UAAU/I,GAGlB0vB,EAAGtxB,EAAE,GAAK,EAGR4sB,EAAIjG,EAAIvlB,EAAGnB,EAAG,EAAG,GAEQ,IADzBmxB,EAAKF,EAAG3B,KAAK3C,EAAE4B,MAAM2C,KACdxD,WAAWsD,IAClBC,EAAKC,EACLA,EAAKC,EACLG,EAAKD,EAAG/B,KAAK3C,EAAE4B,MAAM4C,EAAKG,IAC1BD,EAAKF,EACLnxB,EAAImB,EAAEiuB,MAAMzC,EAAE4B,MAAM4C,EAAKnxB,IACzBmB,EAAIgwB,EAeN,OAZAA,EAAKzK,EAAIsK,EAAG5B,MAAM6B,GAAKC,EAAI,EAAG,GAC9BG,EAAKA,EAAG/B,KAAK6B,EAAG5C,MAAM+C,IACtBL,EAAKA,EAAG3B,KAAK6B,EAAG5C,MAAM2C,IACtBG,EAAG1vB,EAAI2vB,EAAG3vB,EAAIkkB,EAAElkB,EAIhBnB,EAAIkmB,EAAI4K,EAAIJ,EAHZvpB,GAAQ,EAGW0f,GAAe+H,MAAMvJ,GAAG4H,MAAMC,WAC7ChH,EAAI2K,EAAIJ,EAAItpB,EAAG0f,GAAe+H,MAAMvJ,GAAG4H,OAAS,EAAI,CAAC6D,EAAIJ,GAAM,CAACG,EAAIJ,GAExExJ,EAAU2J,EAEH5wB,GAOT6F,EAAEkrB,SAAW,WACX,OAAQrhB,QAAQtL,OAelByB,EAAEmrB,YAAc,SAAUlI,EAAIP,GAE5B,OADU,MAANO,GAAYrD,SAASqD,EAAI,EAAG/D,GACzBuD,OAAOlkB,KAAM0kB,EAAIP,EAAI,IAe9B1iB,EAAEsE,SAAW,SAAU9D,GACrB,IAAIwf,EACFllB,EAAIyD,KACJjD,EAAIR,EAAEQ,EACNgG,EAAIxG,EAAEwG,EA0BR,OAvBU,OAANA,EACEhG,GACF0kB,EAAM,WACF1kB,EAAI,IAAG0kB,EAAM,IAAMA,IAEvBA,EAAM,OAGC,MAALxf,EACFwf,EAAM1e,GAAK2f,GAAc3f,GAAK4f,EAC3BnB,cAAcX,cAActkB,EAAEpB,GAAI4H,GAClC2e,aAAab,cAActkB,EAAEpB,GAAI4H,EAAG,KACxB,KAANd,EAETwf,EAAMC,aAAab,eADnBtkB,EAAIwnB,MAAM,IAAIje,UAAUvJ,GAAIimB,EAAiBzf,EAAI,EAAG0f,IACjBtnB,GAAIoB,EAAEwG,EAAG,MAE5Cse,SAASpf,EAAG,EAAGuhB,EAAS/lB,OAAQ,QAChCgkB,EAAMM,EAAYL,aAAab,cAActkB,EAAEpB,GAAI4H,EAAG,KAAM,GAAId,EAAGlF,GAAG,IAGpEA,EAAI,GAAKR,EAAEpB,EAAE,KAAIsmB,EAAM,IAAMA,IAG5BA,GAQThgB,EAAE6J,QAAU7J,EAAEorB,OAAS,WACrB,OAAOvhB,QAAQtL,OAIjByB,EAAEskB,cAAe,EAEb41B,IACFl6C,EAAE5F,OAAOC,aAAe,YAGxB2F,EAAE5F,OAAOggD,IAAI,+BAAiCp6C,EAAE6J,SAG9B,MAAhBuW,GAAsB/b,UAAUwL,IAAIuQ,GAEjC/b,UAsIG8b,IACO,QAAI9b,EAAUA,UAAYA,OAIH,KAAxC,aAAqB,OAAOA,GAAY,8BAh1F3C,I,wMCAD,QAEA,QACA,QAGA,S,uqEAEA,IAAMg2C,EADN,UACkBC,QAAa3J,MAEVC,E,+EACnB,wBAA4B,MAAhBh3C,EAAgB,uDAAT,QAAS,uCAC1B,cAAMA,EAAM,CAAC,gBAAiB,UADJ,wDAgCH,SAAAwK,GAAG,OAC1BA,EAAIpI,OAAS,GAAK,MAAO,IAAAymC,UAAS,GAAIr+B,GAAOA,MAjCnB,sDAmCL,SAAAmF,GAGrB,IAFA,IAAMgxC,EAAa,GACbC,EAAcjxC,EAAKkhB,OAAO,KACvBpxB,EAAI,EAAGA,EAAImhD,EAAYx+C,OAAS,GAAI3C,IAAK,CAChD,IAAM42C,EAAU,KAAH,OAAQuK,EAAYn4B,UAAc,GAAJhpB,EAAS,GAAc,IAATA,EAAI,KACtC,KAAnB42C,EAAQj0C,QAAeu+C,EAAWj1C,KAAK2qC,GAE7C,OAAOsK,MA1CmB,2DA8CA,IAAAhS,aAAYkS,WAAU,EAAKC,qBA9C3B,kFAgDN,wHACdC,EAAe,EAAKC,iBAAiB3K,QACrC4K,EAAc,EAAK3gD,IAAI,QACvB4gD,EAAQD,EAAYrL,QACpBuL,GAAc,IAAAl4C,aAAYi4C,GAJZ,SAKAD,EAAYG,YAAY,CAC1CC,UAAWZ,EAAUa,gBAAgBH,GACrCI,QAAS,SACTlL,QAAS0K,EACTS,OAAQ,CAACf,EAAUgB,OAAOC,QATR,cAKdC,EALc,yBAYbA,EAAM53C,KAAI,SAAA63C,GAAO,MAAK,CAC3BC,YAAaD,EAAQC,YACrBC,OAAQ,EAAKC,uBAAuBH,EAAQJ,OAAO,IACnD3pC,OAAQ5S,MAAIiT,IAAI0pC,EAAQJ,OAAO,SAfb,mDAhDM,kFAmEN,0HACdT,EAAe,EAAKC,iBAAiB3K,QACrC4K,EAAc,EAAK3gD,IAAI,QACvB4gD,EAAQD,EAAYrL,QACpBuL,GAAc,IAAAl4C,aAAYi4C,GAJZ,SAKAD,EAAYG,YAAY,CAC1CC,UAAWZ,EAAUa,gBAAgBH,GACrCI,QAAS,SACTlL,QAAS0K,EACTS,OAAQ,CAACf,EAAUgB,OAAOO,QATR,cAKdC,EALc,yBAYbA,EAAMl4C,KAAI,SAAAm4C,GAAO,MAAK,CAC3BL,YAAaK,EAAQL,YACrBC,OAAQ,EAAKC,uBAAuBG,EAAQV,OAAO,IACnD3pC,OAAQ5S,MAAIiT,IAAIgqC,EAAQV,OAAO,SAfb,oDAnEM,0EAsFd,0HACNT,EAAe,EAAKC,iBAAiB3K,QACrC4K,EAAc,EAAK3gD,IAAI,QACvB4gD,EAAQD,EAAYrL,QACpBuL,GAAc,IAAAl4C,aAAYi4C,GAJpB,SAKQD,EAAYG,YAAY,CAC1CC,UAAWZ,EAAUa,gBAAgBH,GACrCI,QAAS,SACTlL,QAAS0K,EACTS,OAAQ,CAACf,EAAUgB,OAAOC,QAThB,cAKNC,EALM,0BAYL,IAAA3gC,MACL2gC,EACG53C,KAAI,SAAAo4C,GAAM,OAAI,IAAAha,KAAI,EAAGga,EAAOX,WAC5Bz3C,IAAI,EAAKg4C,0BAfF,oDAtFc,iFAyGP,0HACbhB,EAAe,EAAKC,iBAAiB3K,QACrC4K,EAAc,EAAK3gD,IAAI,QACvB4gD,EAAQD,EAAYrL,QACpBuL,GAAc,IAAAl4C,aAAYi4C,GAJb,SAKCD,EAAYG,YAAY,CAC1CC,UAAWZ,EAAUa,gBAAgBH,GACrCI,QAAS,SACTlL,QAAS0K,EACTS,OAAQ,CAACf,EAAUgB,OAAOW,kBATT,cAKbC,EALa,yBAYZA,EAAMt4C,KAAI,SAAAu4C,GAAO,MAAK,CAC3BT,YAAaS,EAAQT,YACrBC,OAAQ,EAAKC,uBAAuBO,EAAQd,OAAO,IACnDb,WAAY,EAAK4B,qBAAqBD,EAAQ3yC,WAf7B,oDAzGO,+EA4HT,0HACXoxC,EAAe,EAAKC,iBAAiB3K,QACrC4K,EAAc,EAAK3gD,IAAI,QACvB4gD,EAAQD,EAAYrL,QACpBuL,GAAc,IAAAl4C,aAAYi4C,GAJf,SAKGD,EAAYG,YAAY,CAC1CC,UAAWZ,EAAUa,gBAAgBH,GACrCI,QAAS,SACTlL,QAAS0K,EACTS,OAAQ,CAACf,EAAUgB,OAAOe,cATX,cAKXH,EALW,yBAYVA,EAAMt4C,KAAI,SAAAu4C,GAAO,MAAK,CAC3BT,YAAaS,EAAQT,YACrBC,OAAQ,EAAKC,uBAAuBO,EAAQd,OAAO,IACnDiB,MAAOH,EAAQd,OAAO,QAfP,mDA5HS,E,kEAMvBkB,GACH,OAAO/9C,KAAKq8C,iBAAiB2B,KAAKD,K,gCAG/BrM,GACH,OAAO1xC,KAAKq8C,iBAAiBliB,KAAKuX,K,gCAG/BuM,GACH,OAAI/4C,MAAMgY,QAAQ+gC,GACTj+C,KAAKq8C,iBAAiB,mBAAmB4B,GAC3Cj+C,KAAKq8C,iBAAiB,iBAAiB4B,K,gCAG3CC,GAAiB,IAAZ9pC,EAAY,uDAAL9T,MACT69C,GAAS,IAAAr5C,aAAYo5C,EAAK9pC,GAAMsX,QAAQ,OAC9C,OAAO1rB,KAAKq8C,iBAAiBU,KAAKoB,K,gCAG/BD,GAAiB,IAAZ9pC,EAAY,uDAAL9T,MACT69C,GAAS,IAAAr5C,aAAYo5C,EAAK9pC,GAAMsX,QAAQ,OAC9C,OAAO1rB,KAAKq8C,iBAAiBgB,KAAKc,K,uNAqHbn+C,KAAKo+C,c,cAApBC,E,gBAEqBz+C,QAAQgQ,IACjCyuC,EAAOj5C,KAAI,SAAAk5C,GAAK,OACd,EAAKC,eAAeD,GAAOz+C,MAAK,SAAA2+C,GAAQ,MAAK,CAC3C9M,QAAS4M,EACTE,SAAUC,WAAWD,W,cAJrBE,E,gBASmB9+C,QAAQgQ,IAC/B8uC,EAAat5C,KAAI,SAAAu5C,GAAc,OAC7B,EAAKC,cAAcD,EAAejN,SAAS7xC,MAAK,SAAAi+C,GAAK,sCAChDa,GADgD,IAEnDb,iB,cAJAe,E,iBASkBj/C,QAAQgQ,IAC9BivC,EAAWz5C,KAAI,SAAA05C,GAAS,OACtB,EAAKC,0BAA0BD,EAAUhB,OAAOj+C,MAAK,SAAAk+C,GAAS,sCACzDe,GADyD,IAE5DpB,MAAOK,W,QAJPiB,E,OASAC,EAAY,G,6BACID,G,IAAtB,2BAAiC,CAAtBE,EAAsB,qCACdA,EAAQxB,OADM,IAC/B,2BACEyB,GADOA,EAAuB,SAClBl7B,mBACY5jB,IAApB4+C,EAAUE,GACZF,EAAUE,GAAQ,CAChBC,UAAWF,EAAQV,SACnBT,UAAW,CACT,CAAErM,QAASwN,EAAQxN,QAAS8M,SAAUU,EAAQV,aAIlDS,EAAUE,GAAMC,WAAaF,EAAQV,SACrCS,EAAUE,GAAMpB,UAAUh3C,KAAK,CAC7B2qC,QAASwN,EAAQxN,QACjB8M,SAAUU,EAAQV,YAdO,gC,8BAmBjC,I,+CAAYniD,E,KACJgjD,E,KAAwBtB,UAAU7tB,MACtC,SAACluB,EAAGC,GAAJ,OAAUA,EAAEu8C,SAAWx8C,EAAEw8C,YAErBY,EAAYH,EAAU5iD,GAAK+iD,UAC3BE,EAAkBD,EAAgBj6C,KAAI,SAAAm6C,GAAa,sCACpDA,GADoD,IAEvDC,SAAoC,IAAzBD,EAAcf,SAAkBY,GAAW1zB,QAAQ,QAEhEuzB,EAAU5iD,GAAOijD,GATnB,MAA2B9jD,OAAOgb,QAAQyoC,GAA1C,eAAsD,I,yBAW/CA,G,oKAGKvN,GACZ,OAAO1xC,KAAKq8C,iBAAiBqB,MAAMhM,K,oDAGtBA,GACb,OAAO1xC,KAAKq8C,iBACTmC,SAAS9M,GACT7xC,KAAKS,MAAIiT,O,wDAGGm+B,GACf,OAAO1xC,KAAKq8C,iBACT+C,UAAU1N,GACV7xC,KAAKS,MAAIiT,O,sCAIZ,OAAOvT,KAAKq8C,iBAAiBoD,Q,kFAGPC,G,0GAAW5kD,E,+BAAI,E,kBAErBkF,KAAKq8C,iBAAiBsD,OAAOD,EAAW5kD,G,+CAC9CkF,KAAKm8C,kBAAkBuD,EAAW5kD,EAAI,G,iDADYuK,O,4EAInD,I,+LAIU,WACnB,OAAO,IAAIzF,SAAQ,SAACR,EAASC,GAC3B,EAAKg9C,eAAe,CAAEuD,QAAQ,IAC3BC,QAAQ,CAAEC,IAAK,cAAgB,CAAEpD,UAAW,EAAGE,QAAS,WACxDjhD,KAAI,SAAC+D,EAAO0N,GACP1N,GAAOL,EAAOK,GAClBN,EAAQgO,EAAOhI,KAAI,SAAA26C,GAAG,OAAIA,EAAI9/C,KAAK+/C,gB,0DAKxB,WACjB,OAAO,IAAIpgD,SAAQ,SAACR,EAASC,GAC3B,EAAKg9C,eAAe,CAAEuD,QAAQ,IAC3BK,KAAK,GAAI,CAAEvD,UAAW,EAAGE,QAAS,WAClCjhD,KAAI,SAAC+D,EAAO0N,GACP1N,GAAOL,EAAOK,GAClBN,EAAQgO,EAAOhI,KAAI,SAAA26C,GAAG,OAAIA,EAAI9/C,KAAK69C,kB,sDAOH,6DAAJ,GAAI,IAAvB8B,cAAuB,SACtC,OAAIA,EAAe5/C,KAAKrE,IAAI,iBAAiBukD,sBAAsBpO,SAC5D9xC,KAAKrE,IAAI,iBAAiBwkD,kBAAkBrO,a,cAxQbsO,gB,2BCN1C7lD,EAAOD,QAJP,SAAS+lD,gBAAgBh8C,GACvB,GAAIa,MAAMgY,QAAQ7Y,GAAM,OAAOA,I,cC0BjC9J,EAAOD,QA3BP,SAASgmD,sBAAsBj8C,EAAKvJ,GAClC,GAAsB,oBAAXe,QAA4BA,OAAOmH,YAAYxH,OAAO6I,GAAjE,CACA,IAAIk8C,EAAO,GACPC,GAAK,EACLC,GAAK,EACLtjC,OAAK9c,EAET,IACE,IAAK,IAAiCqgD,EAA7B10C,EAAK3H,EAAIxI,OAAOmH,cAAmBw9C,GAAME,EAAK10C,EAAG8J,QAAQnW,QAChE4gD,EAAKx5C,KAAK25C,EAAG3kD,QAETjB,GAAKylD,EAAK9iD,SAAW3C,GAH8C0lD,GAAK,IAK9E,MAAOpgD,GACPqgD,GAAK,EACLtjC,EAAK/c,EACL,QACA,IACOogD,GAAsB,MAAhBx0C,EAAW,QAAWA,EAAW,SAC5C,QACA,GAAIy0C,EAAI,MAAMtjC,GAIlB,OAAOojC,K,cCpBThmD,EAAOD,QAJP,SAASqmD,mBACP,MAAM,IAAItjD,UAAU,+I,gBCMtB,IAAIujD,EAAW,SAAUtmD,GAGvB,IAAIumD,EAAKrlD,OAAOoB,UACZswB,EAAS2zB,EAAGhkD,eAEZ8Q,EAA4B,mBAAX9R,OAAwBA,OAAS,GAClDilD,EAAiBnzC,EAAQ3K,UAAY,aACrC+9C,EAAsBpzC,EAAQqzC,eAAiB,kBAC/CC,EAAoBtzC,EAAQ7R,aAAe,gBAE/C,SAASojB,KAAKgiC,EAASC,EAASriD,EAAMsiD,GAEpC,IAAIC,EAAiBF,GAAWA,EAAQvkD,qBAAqB0kD,UAAYH,EAAUG,UAC/EC,EAAY/lD,OAAOY,OAAOilD,EAAezkD,WACzC8jC,EAAU,IAAI8gB,QAAQJ,GAAe,IAMzC,OAFAG,EAAUE,QAqMZ,SAASC,iBAAiBR,EAASpiD,EAAM4hC,GACvC,IAAI32B,EA9KuB,iBAgL3B,OAAO,SAAS43C,OAAOp9B,EAAQ/kB,GAC7B,GA/KoB,cA+KhBuK,EACF,MAAM,IAAI7D,MAAM,gCAGlB,GAlLoB,cAkLhB6D,EAA6B,CAC/B,GAAe,UAAXwa,EACF,MAAM/kB,EAKR,OAAOoiD,aAMT,IAHAlhB,EAAQnc,OAASA,EACjBmc,EAAQlhC,IAAMA,IAED,CACX,IAAIqiD,EAAWnhB,EAAQmhB,SACvB,GAAIA,EAAU,CACZ,IAAIC,EAAiBC,oBAAoBF,EAAUnhB,GACnD,GAAIohB,EAAgB,CAClB,GAAIA,IAAmBE,EAAkB,SACzC,OAAOF,GAIX,GAAuB,SAAnBphB,EAAQnc,OAGVmc,EAAQuhB,KAAOvhB,EAAQwhB,MAAQxhB,EAAQlhC,SAElC,GAAuB,UAAnBkhC,EAAQnc,OAAoB,CACrC,GAlNqB,mBAkNjBxa,EAEF,MADAA,EAhNc,YAiNR22B,EAAQlhC,IAGhBkhC,EAAQyhB,kBAAkBzhB,EAAQlhC,SAEN,WAAnBkhC,EAAQnc,QACjBmc,EAAQ0hB,OAAO,SAAU1hB,EAAQlhC,KAGnCuK,EA3NkB,YA6NlB,IAAIs4C,EAASC,SAASpB,EAASpiD,EAAM4hC,GACrC,GAAoB,WAAhB2hB,EAAOvhD,KAAmB,CAO5B,GAJAiJ,EAAQ22B,EAAQ/gC,KAhOA,YAFK,iBAsOjB0iD,EAAO7iD,MAAQwiD,EACjB,SAGF,MAAO,CACLjmD,MAAOsmD,EAAO7iD,IACdG,KAAM+gC,EAAQ/gC,MAGS,UAAhB0iD,EAAOvhD,OAChBiJ,EA9OgB,YAiPhB22B,EAAQnc,OAAS,QACjBmc,EAAQlhC,IAAM6iD,EAAO7iD,OA7QPkiD,CAAiBR,EAASpiD,EAAM4hC,GAE7C6gB,EAcT,SAASe,SAASviD,EAAI9C,EAAKuC,GACzB,IACE,MAAO,CAAEsB,KAAM,SAAUtB,IAAKO,EAAG9E,KAAKgC,EAAKuC,IAC3C,MAAOY,GACP,MAAO,CAAEU,KAAM,QAAStB,IAAKY,IAhBjC9F,EAAQ4kB,KAAOA,KAoBf,IAOI8iC,EAAmB,GAMvB,SAASV,aACT,SAASiB,qBACT,SAASC,8BAIT,IAAIrsC,EAAoB,GACxBA,EAAkB2qC,GAAkB,WAClC,OAAO9gD,MAGT,IAAIyiD,EAAWjnD,OAAO0C,eAClBwkD,EAA0BD,GAAYA,EAASA,EAASlsC,OAAO,MAC/DmsC,GACAA,IAA4B7B,GAC5B3zB,EAAOjyB,KAAKynD,EAAyB5B,KAGvC3qC,EAAoBusC,GAGtB,IAAIC,EAAKH,2BAA2B5lD,UAClC0kD,UAAU1kD,UAAYpB,OAAOY,OAAO+Z,GAQtC,SAASysC,sBAAsBhmD,GAC7B,CAAC,OAAQ,QAAS,UAAU6J,SAAQ,SAAS8d,GAC3C3nB,EAAU2nB,GAAU,SAAS/kB,GAC3B,OAAOQ,KAAKyhD,QAAQl9B,EAAQ/kB,OAoClC,SAASqjD,cAActB,EAAWuB,GAgChC,IAAIC,EAgCJ/iD,KAAKyhD,QA9BL,SAASuB,QAAQz+B,EAAQ/kB,GACvB,SAASyjD,6BACP,OAAO,IAAIH,GAAY,SAAS1jD,EAASC,IAnC7C,SAASsiD,OAAOp9B,EAAQ/kB,EAAKJ,EAASC,GACpC,IAAIgjD,EAASC,SAASf,EAAUh9B,GAASg9B,EAAW/hD,GACpD,GAAoB,UAAhB6iD,EAAOvhD,KAEJ,CACL,IAAIsM,EAASi1C,EAAO7iD,IAChBzD,EAAQqR,EAAOrR,MACnB,OAAIA,GACiB,iBAAVA,GACPmxB,EAAOjyB,KAAKc,EAAO,WACd+mD,EAAY1jD,QAAQrD,EAAMmnD,SAASrjD,MAAK,SAAS9D,GACtD4lD,OAAO,OAAQ5lD,EAAOqD,EAASC,MAC9B,SAASe,GACVuhD,OAAO,QAASvhD,EAAKhB,EAASC,MAI3ByjD,EAAY1jD,QAAQrD,GAAO8D,MAAK,SAASsjD,GAI9C/1C,EAAOrR,MAAQonD,EACf/jD,EAAQgO,MACP,SAAS1N,GAGV,OAAOiiD,OAAO,QAASjiD,EAAON,EAASC,MAvBzCA,EAAOgjD,EAAO7iD,KAiCZmiD,CAAOp9B,EAAQ/kB,EAAKJ,EAASC,MAIjC,OAAO0jD,EAaLA,EAAkBA,EAAgBljD,KAChCojD,2BAGAA,4BACEA,8BAkHV,SAASlB,oBAAoBF,EAAUnhB,GACrC,IAAInc,EAASs9B,EAAS7+C,SAAS09B,EAAQnc,QACvC,QAvSElkB,IAuSEkkB,EAAsB,CAKxB,GAFAmc,EAAQmhB,SAAW,KAEI,UAAnBnhB,EAAQnc,OAAoB,CAE9B,GAAIs9B,EAAS7+C,SAAiB,SAG5B09B,EAAQnc,OAAS,SACjBmc,EAAQlhC,SAlTZa,EAmTI0hD,oBAAoBF,EAAUnhB,GAEP,UAAnBA,EAAQnc,QAGV,OAAOy9B,EAIXthB,EAAQnc,OAAS,QACjBmc,EAAQlhC,IAAM,IAAInC,UAChB,kDAGJ,OAAO2kD,EAGT,IAAIK,EAASC,SAAS/9B,EAAQs9B,EAAS7+C,SAAU09B,EAAQlhC,KAEzD,GAAoB,UAAhB6iD,EAAOvhD,KAIT,OAHA4/B,EAAQnc,OAAS,QACjBmc,EAAQlhC,IAAM6iD,EAAO7iD,IACrBkhC,EAAQmhB,SAAW,KACZG,EAGT,IAAIviD,EAAO4iD,EAAO7iD,IAElB,OAAMC,EAOFA,EAAKE,MAGP+gC,EAAQmhB,EAASuB,YAAc3jD,EAAK1D,MAGpC2kC,EAAQ5qB,KAAO+rC,EAASwB,QAQD,WAAnB3iB,EAAQnc,SACVmc,EAAQnc,OAAS,OACjBmc,EAAQlhC,SAtWVa,GAgXFqgC,EAAQmhB,SAAW,KACZG,GANEviD,GA3BPihC,EAAQnc,OAAS,QACjBmc,EAAQlhC,IAAM,IAAInC,UAAU,oCAC5BqjC,EAAQmhB,SAAW,KACZG,GAoDX,SAASsB,aAAaC,GACpB,IAAIC,EAAQ,CAAEC,OAAQF,EAAK,IAEvB,KAAKA,IACPC,EAAME,SAAWH,EAAK,IAGpB,KAAKA,IACPC,EAAMG,WAAaJ,EAAK,GACxBC,EAAMI,SAAWL,EAAK,IAGxBvjD,KAAK6jD,WAAW98C,KAAKy8C,GAGvB,SAASM,cAAcN,GACrB,IAAInB,EAASmB,EAAMO,YAAc,GACjC1B,EAAOvhD,KAAO,gBACPuhD,EAAO7iD,IACdgkD,EAAMO,WAAa1B,EAGrB,SAASb,QAAQJ,GAIfphD,KAAK6jD,WAAa,CAAC,CAAEJ,OAAQ,SAC7BrC,EAAY36C,QAAQ68C,aAActjD,MAClCA,KAAKgkD,OAAM,GA8Bb,SAASztC,OAAO0tC,GACd,GAAIA,EAAU,CACZ,IAAIC,EAAiBD,EAASnD,GAC9B,GAAIoD,EACF,OAAOA,EAAejpD,KAAKgpD,GAG7B,GAA6B,mBAAlBA,EAASnuC,KAClB,OAAOmuC,EAGT,IAAKz4C,MAAMy4C,EAASxmD,QAAS,CAC3B,IAAI3C,GAAK,EAAGgb,EAAO,SAASA,OAC1B,OAAShb,EAAImpD,EAASxmD,QACpB,GAAIyvB,EAAOjyB,KAAKgpD,EAAUnpD,GAGxB,OAFAgb,KAAK/Z,MAAQkoD,EAASnpD,GACtBgb,KAAKnW,MAAO,EACLmW,KAOX,OAHAA,KAAK/Z,WAtdTsE,EAudIyV,KAAKnW,MAAO,EAELmW,MAGT,OAAOA,EAAKA,KAAOA,GAKvB,MAAO,CAAEA,KAAM8rC,YAIjB,SAASA,aACP,MAAO,CAAE7lD,WAtePsE,EAseyBV,MAAM,GA+MnC,OA3mBA4iD,kBAAkB3lD,UAAY+lD,EAAGjkD,YAAc8jD,2BAC/CA,2BAA2B9jD,YAAc6jD,kBACzCC,2BAA2BvB,GACzBsB,kBAAkB4B,YAAc,oBAYlC7pD,EAAQ8pD,oBAAsB,SAASC,GACrC,IAAI/vC,EAAyB,mBAAX+vC,GAAyBA,EAAO3lD,YAClD,QAAO4V,IACHA,IAASiuC,mBAG2B,uBAAnCjuC,EAAK6vC,aAAe7vC,EAAKjZ,QAIhCf,EAAQwkB,KAAO,SAASulC,GAUtB,OATI7oD,OAAOyC,eACTzC,OAAOyC,eAAeomD,EAAQ7B,6BAE9B6B,EAAOlmD,UAAYqkD,2BACbvB,KAAqBoD,IACzBA,EAAOpD,GAAqB,sBAGhCoD,EAAOznD,UAAYpB,OAAOY,OAAOumD,GAC1B0B,GAOT/pD,EAAQgqD,MAAQ,SAAS9kD,GACvB,MAAO,CAAE0jD,QAAS1jD,IAsEpBojD,sBAAsBC,cAAcjmD,WACpCimD,cAAcjmD,UAAUmkD,GAAuB,WAC7C,OAAO/gD,MAET1F,EAAQuoD,cAAgBA,cAKxBvoD,EAAQiqD,MAAQ,SAASrD,EAASC,EAASriD,EAAMsiD,EAAa0B,QACxC,IAAhBA,IAAwBA,EAAcljD,SAE1C,IAAI42B,EAAO,IAAIqsB,cACb3jC,KAAKgiC,EAASC,EAASriD,EAAMsiD,GAC7B0B,GAGF,OAAOxoD,EAAQ8pD,oBAAoBjD,GAC/B3qB,EACAA,EAAK1gB,OAAOjW,MAAK,SAASuN,GACxB,OAAOA,EAAOzN,KAAOyN,EAAOrR,MAAQy6B,EAAK1gB,WAuKjD8sC,sBAAsBD,GAEtBA,EAAG1B,GAAqB,YAOxB0B,EAAG7B,GAAkB,WACnB,OAAO9gD,MAGT2iD,EAAG58C,SAAW,WACZ,MAAO,sBAkCTzL,EAAQ8N,KAAO,SAAS1L,GACtB,IAAI0L,EAAO,GACX,IAAK,IAAI/L,KAAOK,EACd0L,EAAKrB,KAAK1K,GAMZ,OAJA+L,EAAKwe,UAIE,SAAS9Q,OACd,KAAO1N,EAAK3K,QAAQ,CAClB,IAAIpB,EAAM+L,EAAKqc,MACf,GAAIpoB,KAAOK,EAGT,OAFAoZ,KAAK/Z,MAAQM,EACbyZ,KAAKnW,MAAO,EACLmW,KAQX,OADAA,KAAKnW,MAAO,EACLmW,OAsCXxb,EAAQic,OAASA,OAMjBirC,QAAQ5kD,UAAY,CAClB8B,YAAa8iD,QAEbwC,MAAO,SAASQ,GAcd,GAbAxkD,KAAKqf,KAAO,EACZrf,KAAK8V,KAAO,EAGZ9V,KAAKiiD,KAAOjiD,KAAKkiD,WAjfjB7hD,EAkfAL,KAAKL,MAAO,EACZK,KAAK6hD,SAAW,KAEhB7hD,KAAKukB,OAAS,OACdvkB,KAAKR,SAtfLa,EAwfAL,KAAK6jD,WAAWp9C,QAAQq9C,gBAEnBU,EACH,IAAK,IAAInpD,KAAQ2E,KAEQ,MAAnB3E,EAAK4K,OAAO,IACZinB,EAAOjyB,KAAK+E,KAAM3E,KACjBmQ,OAAOnQ,EAAKuL,MAAM,MACrB5G,KAAK3E,QAhgBXgF,IAsgBFof,KAAM,WACJzf,KAAKL,MAAO,EAEZ,IACI8kD,EADYzkD,KAAK6jD,WAAW,GACLE,WAC3B,GAAwB,UAApBU,EAAW3jD,KACb,MAAM2jD,EAAWjlD,IAGnB,OAAOQ,KAAK0kD,MAGdvC,kBAAmB,SAASwC,GAC1B,GAAI3kD,KAAKL,KACP,MAAMglD,EAGR,IAAIjkB,EAAU1gC,KACd,SAAS4kD,OAAOC,EAAKC,GAYnB,OAXAzC,EAAOvhD,KAAO,QACduhD,EAAO7iD,IAAMmlD,EACbjkB,EAAQ5qB,KAAO+uC,EAEXC,IAGFpkB,EAAQnc,OAAS,OACjBmc,EAAQlhC,SAjiBZa,KAoiBYykD,EAGZ,IAAK,IAAIhqD,EAAIkF,KAAK6jD,WAAWpmD,OAAS,EAAG3C,GAAK,IAAKA,EAAG,CACpD,IAAI0oD,EAAQxjD,KAAK6jD,WAAW/oD,GACxBunD,EAASmB,EAAMO,WAEnB,GAAqB,SAAjBP,EAAMC,OAIR,OAAOmB,OAAO,OAGhB,GAAIpB,EAAMC,QAAUzjD,KAAKqf,KAAM,CAC7B,IAAI0lC,EAAW73B,EAAOjyB,KAAKuoD,EAAO,YAC9BwB,EAAa93B,EAAOjyB,KAAKuoD,EAAO,cAEpC,GAAIuB,GAAYC,EAAY,CAC1B,GAAIhlD,KAAKqf,KAAOmkC,EAAME,SACpB,OAAOkB,OAAOpB,EAAME,UAAU,GACzB,GAAI1jD,KAAKqf,KAAOmkC,EAAMG,WAC3B,OAAOiB,OAAOpB,EAAMG,iBAGjB,GAAIoB,GACT,GAAI/kD,KAAKqf,KAAOmkC,EAAME,SACpB,OAAOkB,OAAOpB,EAAME,UAAU,OAG3B,KAAIsB,EAMT,MAAM,IAAI9+C,MAAM,0CALhB,GAAIlG,KAAKqf,KAAOmkC,EAAMG,WACpB,OAAOiB,OAAOpB,EAAMG,gBAU9BvB,OAAQ,SAASthD,EAAMtB,GACrB,IAAK,IAAI1E,EAAIkF,KAAK6jD,WAAWpmD,OAAS,EAAG3C,GAAK,IAAKA,EAAG,CACpD,IAAI0oD,EAAQxjD,KAAK6jD,WAAW/oD,GAC5B,GAAI0oD,EAAMC,QAAUzjD,KAAKqf,MACrB6N,EAAOjyB,KAAKuoD,EAAO,eACnBxjD,KAAKqf,KAAOmkC,EAAMG,WAAY,CAChC,IAAIsB,EAAezB,EACnB,OAIAyB,IACU,UAATnkD,GACS,aAATA,IACDmkD,EAAaxB,QAAUjkD,GACvBA,GAAOylD,EAAatB,aAGtBsB,EAAe,MAGjB,IAAI5C,EAAS4C,EAAeA,EAAalB,WAAa,GAItD,OAHA1B,EAAOvhD,KAAOA,EACduhD,EAAO7iD,IAAMA,EAETylD,GACFjlD,KAAKukB,OAAS,OACdvkB,KAAK8V,KAAOmvC,EAAatB,WAClB3B,GAGFhiD,KAAKklD,SAAS7C,IAGvB6C,SAAU,SAAS7C,EAAQuB,GACzB,GAAoB,UAAhBvB,EAAOvhD,KACT,MAAMuhD,EAAO7iD,IAcf,MAXoB,UAAhB6iD,EAAOvhD,MACS,aAAhBuhD,EAAOvhD,KACTd,KAAK8V,KAAOusC,EAAO7iD,IACM,WAAhB6iD,EAAOvhD,MAChBd,KAAK0kD,KAAO1kD,KAAKR,IAAM6iD,EAAO7iD,IAC9BQ,KAAKukB,OAAS,SACdvkB,KAAK8V,KAAO,OACa,WAAhBusC,EAAOvhD,MAAqB8iD,IACrC5jD,KAAK8V,KAAO8tC,GAGP5B,GAGTxiC,OAAQ,SAASmkC,GACf,IAAK,IAAI7oD,EAAIkF,KAAK6jD,WAAWpmD,OAAS,EAAG3C,GAAK,IAAKA,EAAG,CACpD,IAAI0oD,EAAQxjD,KAAK6jD,WAAW/oD,GAC5B,GAAI0oD,EAAMG,aAAeA,EAGvB,OAFA3jD,KAAKklD,SAAS1B,EAAMO,WAAYP,EAAMI,UACtCE,cAAcN,GACPxB,IAKb,MAAS,SAASyB,GAChB,IAAK,IAAI3oD,EAAIkF,KAAK6jD,WAAWpmD,OAAS,EAAG3C,GAAK,IAAKA,EAAG,CACpD,IAAI0oD,EAAQxjD,KAAK6jD,WAAW/oD,GAC5B,GAAI0oD,EAAMC,SAAWA,EAAQ,CAC3B,IAAIpB,EAASmB,EAAMO,WACnB,GAAoB,UAAhB1B,EAAOvhD,KAAkB,CAC3B,IAAIqkD,EAAS9C,EAAO7iD,IACpBskD,cAAcN,GAEhB,OAAO2B,GAMX,MAAM,IAAIj/C,MAAM,0BAGlBk/C,cAAe,SAASnB,EAAUb,EAAYC,GAa5C,OAZArjD,KAAK6hD,SAAW,CACd7+C,SAAUuT,OAAO0tC,GACjBb,WAAYA,EACZC,QAASA,GAGS,SAAhBrjD,KAAKukB,SAGPvkB,KAAKR,SA1qBPa,GA6qBO2hD,IAQJ1nD,EA1rBK,CAisBiBC,EAAOD,SAGtC,IACE+qD,mBAAqBzE,EACrB,MAAO0E,GAUPpjD,SAAS,IAAK,yBAAdA,CAAwC0+C,K,gBCvtB1C,IAAI2E,EAAgB,EAAQ,KAE5B,SAASC,KAAKjoD,EAAQZ,EAAU8oD,GAiB9B,MAhBuB,oBAAZ92C,SAA2BA,QAAQhT,IAC5CpB,EAAOD,QAAUkrD,KAAO72C,QAAQhT,IAEhCpB,EAAOD,QAAUkrD,KAAO,SAASA,KAAKjoD,EAAQZ,EAAU8oD,GACtD,IAAIx+B,EAAOs+B,EAAchoD,EAAQZ,GACjC,GAAKsqB,EAAL,CACA,IAAIlV,EAAOvW,OAAOsW,yBAAyBmV,EAAMtqB,GAEjD,OAAIoV,EAAKpW,IACAoW,EAAKpW,IAAIV,KAAKwqD,GAGhB1zC,EAAKhW,QAITypD,KAAKjoD,EAAQZ,EAAU8oD,GAAYloD,GAG5ChD,EAAOD,QAAUkrD,M,gBCtBjB,IAAItnD,EAAiB,EAAQ,GAW7B3D,EAAOD,QATP,SAASorD,eAAehpD,EAAQC,GAC9B,MAAQnB,OAAOoB,UAAUC,eAAe5B,KAAKyB,EAAQC,IAEpC,QADfD,EAASwB,EAAexB,MAI1B,OAAOA,I,cCJTnC,EAAOD,QAJP,SAASqrD,kBAAkB5lD,GACzB,OAAgE,IAAzDmC,SAAS6D,SAAS9K,KAAK8E,GAAIoZ,QAAQ,mB,gBCD5C,IAAIlb,EAAiB,EAAQ,IAEzB2nD,EAA2B,EAAQ,KAEvC,SAASC,WAAWC,EAAQ7lD,EAAMkR,GAchC,OAbIy0C,IACFrrD,EAAOD,QAAUurD,WAAal3C,QAAQC,UAEtCrU,EAAOD,QAAUurD,WAAa,SAASA,WAAWC,EAAQ7lD,EAAMkR,GAC9D,IAAInP,EAAI,CAAC,MACTA,EAAE+E,KAAK5G,MAAM6B,EAAG/B,GAChB,IACI9C,EAAW,IADG+E,SAAS5F,KAAK6D,MAAM2lD,EAAQ9jD,IAG9C,OADImP,GAAOlT,EAAed,EAAUgU,EAAMvU,WACnCO,GAIJ0oD,WAAW1lD,MAAM,KAAMD,WAGhC3F,EAAOD,QAAUurD,Y,cCRjBtrD,EAAOD,QAbP,SAASoU,4BACP,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EACjE,GAAID,QAAQC,UAAUC,KAAM,OAAO,EACnC,GAAqB,mBAAVC,MAAsB,OAAO,EAExC,IAEE,OADAC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAClD,EACP,MAAOhM,GACP,OAAO,K,gBCPX,IAAI4O,EAA0BxO,EAAQ,IAElCnG,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAIkO,EAAmBxL,EAAuBmG,EAAQ,IAElDsF,EAAgBzL,EAAuBmG,EAAQ,IAE/CQ,EAAgB3G,EAAuBmG,EAAQ,KAE/CiE,EAAgBpK,EAAuBmG,EAAQ,KAE/CuF,EAAeiJ,EAAwBxO,EAAQ,KAI/C48C,GAAM,EAFG/iD,EAAuBmG,EAAQ,MAExB,SAAa,0BAEjC,SAAS4iD,WAAWC,GAClB,OAAO,IAAIpmD,SAAQ,SAAUR,EAASC,GACpC,IACED,EAAQ4mD,KACR,MAAOjjD,GACP1D,EAAO0D,EAAEqM,aAKf,IA+YIpF,EA/YkC,WAMpC,SAASi8C,qBACP,IAAIj2C,EAAO9P,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAC3E2I,EAAU3I,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAC9EkJ,EAAOlJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,KAI/E,IAHA,EAAIsI,EAAgB,SAAaxI,KAAMimD,oBAG1B,OAATj2C,GAAiC,mBAATA,EAC1B,MAAM,IAAI9J,MAAM,kDAQlB,GAPoB,OAAT8J,IACTA,EAAO,SAASA,OACd,OAAOpQ,QAAQR,YAKH,OAAZyJ,GAAuC,mBAAZA,EAC7B,MAAM,IAAI3C,MAAM,qDAQlB,GAPuB,OAAZ2C,GAA6B,OAATO,IAC7BP,EAAU,SAASA,UACjB,OAAOjJ,QAAQR,YAKN,OAATgK,GAAiC,mBAATA,EAC1B,MAAM,IAAIlD,MAAM,kDAIlBlG,KAAKkmD,MAAQl2C,EACbhQ,KAAKmmD,SAAWt9C,EAChB7I,KAAKomD,MAAQh9C,EACbpJ,KAAKqmD,MAAiB,OAATj9C,EAA4B,OAAZP,EAAmBH,EAAY,QAAYrB,MAAQqB,EAAY,QAAYpB,OAASoB,EAAY,QAAYnB,QACzIvH,KAAK8Y,OAAS,IAAInV,EAAa,QAAYyD,EAAa,QAAYI,QAASkB,EAAavB,uBAAuBnH,KAAKqmD,QACtHrmD,KAAKsmD,aAAe,KACpBtmD,KAAKumD,gBAAkB,KACvBvmD,KAAKwmD,aAAe,KAiWtB,OA1VA,EAAI/9C,EAAa,SAAaw9C,mBAAoB,CAAC,CACjD5pD,IAAK,aACLN,MAAO,SAAS6M,WAAWS,GACzB,IAAIF,EAAQnJ,KAGZ,GAAIA,KAAK8Y,OAAOI,QAAQ9R,EAAa,QAAYI,SAAU,CAIzD,GAAIxH,KAAKsmD,aACP,MAAM,IAAIpgD,MAAM,6CAIlBlG,KAAK8Y,OAAOQ,aAAalS,EAAa,QAAYK,cAGlDzH,KAAKsmD,aAAeP,YAAW,WAC7B,OAAO58C,EAAM+8C,MAAM78C,MAClBxJ,MAAK,WACN,OAAOsJ,EAAM2P,OAAOQ,aAAanQ,EAAMk9C,QAAU39C,EAAY,QAAYrB,MAAQD,EAAa,QAAYM,MAAQN,EAAa,QAAYQ,YAC1I,SAAU6+C,GAKX,MAJA1G,EAAI0G,GAEJt9C,EAAM2P,OAAOQ,aAAalS,EAAa,QAAYI,SAE7Ci/C,KAIV,OAAOzmD,KAAKsmD,eAMb,CACDjqD,IAAK,UACLN,MAAO,SAAS8M,UACd,IAAIW,EAASxJ,KAGb,OAAIA,KAAKqmD,QAAU39C,EAAY,QAAYrB,MAClCrH,KAAK4I,cAIV5I,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYI,QAASJ,EAAa,QAAYK,aAAcL,EAAa,QAAYQ,WAAsC,OAAzB5H,KAAKumD,kBAE3IvmD,KAAKumD,gBAAkBvmD,KAAK4I,aAAa/I,MAAK,WAK5C,OAHA2J,EAAOsP,OAAOQ,aAAalS,EAAa,QAAYS,YAG7Ck+C,YAAW,WAChB,OAAOv8C,EAAO28C,UAAS,WACrB,OAAO38C,EAAOk9C,oBAEf7mD,MAAK,WAEF2J,EAAOsP,OAAOI,QAAQ9R,EAAa,QAAYS,aACjD2B,EAAOsP,OAAOQ,aAAa9P,EAAO68C,QAAU39C,EAAY,QAAYpB,OAASF,EAAa,QAAYM,MAAQN,EAAa,QAAYU,WAExI,SAAUpI,GAOX,MANAqgD,EAAI,iBAAkBrgD,GAElB8J,EAAOsP,OAAOI,QAAQ9R,EAAa,QAAYS,aACjD2B,EAAOsP,OAAOQ,aAAalS,EAAa,QAAYQ,SAGhDlI,SAKLM,KAAKumD,mBAMb,CACDlqD,IAAK,eACLN,MAAO,SAASgN,eACd,IAAIyH,EAASxQ,KAGb,OAAIA,KAAKqmD,QAAU39C,EAAY,QAAYnB,QAClCvH,KAAK6I,WAIV7I,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYI,QAASJ,EAAa,QAAYK,aAAcL,EAAa,QAAYQ,QAASR,EAAa,QAAYS,WAAYT,EAAa,QAAYU,UAAkC,OAAtB9H,KAAKwmD,eAEjNxmD,KAAKwmD,aAAexmD,KAAK6I,UAAUhJ,MAAK,WAKtC,OAHA2Q,EAAOsI,OAAOQ,aAAalS,EAAa,QAAYW,gBAG7Cg+C,YAAW,WAChB,OAAOv1C,EAAO41C,OAAM,WAClB,OAAO51C,EAAOm2C,wBAEf9mD,MAAK,WAGF2Q,EAAOsI,OAAOI,QAAQ9R,EAAa,QAAYW,iBACjDyI,EAAOsI,OAAOQ,aAAalS,EAAa,QAAYM,UAErD,SAAU++C,GACX1G,EAAI,uBAAyB0G,GAEzBj2C,EAAOsI,OAAOI,QAAQ9R,EAAa,QAAYW,iBACjDyI,EAAOsI,OAAOQ,aAAalS,EAAa,QAAYU,eAMrD9H,KAAKwmD,gBAMb,CACDnqD,IAAK,WACLN,MAAO,SAASsN,SAASkH,GAEvB,OADAvQ,KAAKuQ,UAAYA,EACVvQ,OAMR,CACD3D,IAAK,QACLN,MAAO,SAASgO,QACd,OAAO/J,KAAK8Y,OAAO/O,UAMpB,CACD1N,IAAK,OACLN,MAAO,SAAS+E,OACd,OAAOd,KAAKqmD,QAMb,CACDhqD,IAAK,gBACLN,MAAO,SAAS6qD,gBACd,OAAQ5mD,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYI,QAASJ,EAAa,QAAYK,iBAMzF,CACDpL,IAAK,cACLN,MAAO,SAAS8qD,cACd,OAAO7mD,KAAKqmD,QAAU39C,EAAY,QAAYrB,MAAQ,KAAOrH,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYU,OAAQV,EAAa,QAAYW,eAAgBX,EAAa,QAAYM,UAMtL,CACDrL,IAAK,kBACLN,MAAO,SAASmiB,kBACd,OAAOle,KAAKqmD,QAAU39C,EAAY,QAAYnB,QAAUvH,KAAK8Y,OAAOI,QAAQ9R,EAAa,QAAYM,OAAS,OAM/G,CACDrL,IAAK,UACLN,MAAO,SAAS+qD,UACd,OAAO9mD,KAAK8Y,OAAOI,QAAQ9R,EAAa,QAAYM,SAOrD,CACDrL,IAAK,gBACLN,MAAO,SAAS0N,cAAcs9C,GAO5B,OANA/mD,KAAK8Y,OAAOG,gBAAe,SAAUO,EAAUD,GACzCC,IAAapS,EAAa,QAAYK,cAAiB8R,IAAanS,EAAa,QAAYQ,SAAW2R,IAAanS,EAAa,QAAYM,OAChJq/C,OAIG/mD,OAOR,CACD3D,IAAK,cACLN,MAAO,SAASirD,YAAYD,GAO1B,OANA/mD,KAAK8Y,OAAOG,gBAAe,SAAUO,EAAUD,GACzCC,IAAapS,EAAa,QAAYS,YAAe0R,IAAanS,EAAa,QAAYU,QAAUyR,IAAanS,EAAa,QAAYM,OAC7Iq/C,OAIG/mD,OAOR,CACD3D,IAAK,iBACLN,MAAO,SAAS4N,eAAeo9C,GAO7B,OANA/mD,KAAK8Y,OAAOG,gBAAe,SAAUO,EAAUD,GACzCA,IAAanS,EAAa,QAAYQ,SAAY4R,IAAapS,EAAa,QAAYU,QAAU0R,IAAapS,EAAa,QAAYM,OAC1Iq/C,OAIG/mD,OAOR,CACD3D,IAAK,kBACLN,MAAO,SAASkrD,gBAAgBF,GAO9B,OANA/mD,KAAK8Y,OAAOG,gBAAe,SAAUO,EAAUD,GACzCC,IAAapS,EAAa,QAAYW,gBAAkBwR,IAAanS,EAAa,QAAYM,OAChGq/C,OAIG/mD,OAOR,CACD3D,IAAK,oBACLN,MAAO,SAAS6N,kBAAkBm9C,GAShC,OARI/mD,KAAKc,SAAW4H,EAAY,QAAYnB,SAC1CvH,KAAK8Y,OAAOG,gBAAe,SAAUO,EAAUD,GACxCA,IAAanS,EAAa,QAAYQ,SAAW2R,IAAanS,EAAa,QAAYU,QAAW0R,IAAapS,EAAa,QAAYM,OAC3Iq/C,OAKC/mD,OAOR,CACD3D,IAAK,UACLN,MAAO,SAASmrD,QAAQH,GAOtB,OANA/mD,KAAK8Y,OAAOG,gBAAe,SAAU6xB,EAAGvxB,GAClCA,IAAanS,EAAa,QAAYM,OACxCq/C,OAIG/mD,OAOR,CACD3D,IAAK,iBACLN,MAAO,SAASkd,eAAe8tC,GAG7B,OAFA/mD,KAAK8Y,OAAOG,eAAe8tC,GAEpB/mD,OAUR,CACD3D,IAAK,cACLN,MAAO,SAAS2qD,cAEd,GAAI1mD,KAAKqmD,QAAU39C,EAAY,QAAYrB,MACzC,MAAM,IAAInB,MAAM,qDAGdlG,KAAK8Y,OAAOI,QAAQ9R,EAAa,QAAYW,iBAC/C/H,KAAK2mD,kBAGH3mD,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYM,MAAON,EAAa,QAAYU,OAAQV,EAAa,QAAYS,eACjH7H,KAAKwmD,aAAe,KACpBxmD,KAAKumD,gBAAkB,KAEvBvmD,KAAK8Y,OAAOQ,aAAalS,EAAa,QAAYQ,YAWrD,CACDvL,IAAK,kBACLN,MAAO,SAAS4qD,kBAEd,GAAI3mD,KAAKqmD,QAAU39C,EAAY,QAAYnB,QACzC,MAAM,IAAIrB,MAAM,mEAGdlG,KAAK8Y,OAAOI,QAAQ,CAAC9R,EAAa,QAAYM,MAAON,EAAa,QAAYW,mBAChF/H,KAAKwmD,aAAe,KAEpBxmD,KAAK8Y,OAAOQ,aAAalS,EAAa,QAAYU,aAIjDm+C,mBA5Y6B,GAgZtC3rD,EAAO,QAAc0P,G,iBCnbrB,YAqJA,SAASm9C,OACP,IAAIvrD,EACJ,IACEA,EAAItB,EAAQ8sD,QAAQC,MACpB,MAAMtkD,IAOR,OAJKnH,QAAwB,IAAZge,GAA2B,QAASA,IACnDhe,EAAIge,EAAQsB,IAAI8I,OAGXpoB,GA1JTtB,EAAUC,EAAOD,QAAU,EAAQ,MAC3BylD,IA8GR,SAASA,MAGP,MAAO,iBAAoBuH,SACtBA,QAAQvH,KACR79C,SAAStF,UAAUuD,MAAMlF,KAAKqsD,QAAQvH,IAAKuH,QAASpnD,YAlH3D5F,EAAQitD,WAqER,SAASA,WAAWtnD,GAClB,IAAIunD,EAAYxnD,KAAKwnD,UASrB,GAPAvnD,EAAK,IAAMunD,EAAY,KAAO,IAC1BxnD,KAAKynD,WACJD,EAAY,MAAQ,KACrBvnD,EAAK,IACJunD,EAAY,MAAQ,KACrB,IAAMltD,EAAQotD,SAAS1nD,KAAK2nD,OAE3BH,EAAW,OAEhB,IAAIrsD,EAAI,UAAY6E,KAAK4nD,MACzB3nD,EAAKsmB,OAAO,EAAG,EAAGprB,EAAG,kBAKrB,IAAI+Q,EAAQ,EACR27C,EAAQ,EACZ5nD,EAAK,GAAG2jB,QAAQ,eAAe,SAASqK,GAClC,OAASA,IACb/hB,IACI,OAAS+hB,IAGX45B,EAAQ37C,OAIZjM,EAAKsmB,OAAOshC,EAAO,EAAG1sD,IAlGxBb,EAAQwtD,KA2HR,SAASA,KAAKC,GACZ,IACM,MAAQA,EACVztD,EAAQ8sD,QAAQY,WAAW,SAE3B1tD,EAAQ8sD,QAAQC,MAAQU,EAE1B,MAAMhlD,MAjIVzI,EAAQ6sD,KAAOA,KACf7sD,EAAQktD,UA2BR,SAASA,YAIP,GAAsB,oBAAX9sD,QAA0BA,OAAOkf,SAAmC,aAAxBlf,OAAOkf,QAAQ9Y,KACpE,OAAO,EAKT,MAA4B,oBAAbgM,UAA4BA,SAAS8nC,iBAAmB9nC,SAAS8nC,gBAAgBnoC,OAASK,SAAS8nC,gBAAgBnoC,MAAMw7C,kBAEnH,oBAAXvtD,QAA0BA,OAAO4sD,UAAY5sD,OAAO4sD,QAAQY,SAAYxtD,OAAO4sD,QAAQ3C,WAAajqD,OAAO4sD,QAAQa,QAGrG,oBAAdC,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUpkC,cAAcgK,MAAM,mBAAqBzpB,SAAS+B,OAAOu5B,GAAI,KAAO,IAE9H,oBAAdsoB,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUpkC,cAAcgK,MAAM,uBA3CxG3zB,EAAQ8sD,QAAU,oBAAsBkB,aACtB,IAAsBA,OAAOlB,QAC3BkB,OAAOlB,QAAQmB,MAsKnC,SAASC,eACP,IACE,OAAO9tD,OAAO+tD,aACd,MAAO1lD,KAxKSylD,GAMpBluD,EAAQouD,OAAS,CACf,gBACA,cACA,YACA,aACA,aACA,WAmCFpuD,EAAQquD,WAAWhiD,EAAI,SAAS6e,GAC9B,IACE,OAAOowB,KAAKE,UAAUtwB,GACtB,MAAOplB,GACP,MAAO,+BAAiCA,EAAIgP,UAqGhD9U,EAAQsuD,OAAOzB,U,kCCrIf,IAAI0B,EA4BJ,SAASC,YAAYrB,GAEnB,SAASJ,QAEP,GAAKA,MAAM0B,QAAX,CAEA,IAAIjqD,EAAOuoD,MAGP2B,GAAQ,IAAIj6C,KACZk6C,EAAKD,GAAQH,GAAYG,GAC7BlqD,EAAK6oD,KAAOsB,EACZnqD,EAAKugB,KAAOwpC,EACZ/pD,EAAKkqD,KAAOA,EACZH,EAAWG,EAIX,IADA,IAAI/oD,EAAO,IAAIiF,MAAMhF,UAAUzC,QACtB3C,EAAI,EAAGA,EAAImF,EAAKxC,OAAQ3C,IAC/BmF,EAAKnF,GAAKoF,UAAUpF,GAGtBmF,EAAK,GAAK3F,EAAQ4uD,OAAOjpD,EAAK,IAE1B,iBAAoBA,EAAK,IAE3BA,EAAKkpD,QAAQ,MAIf,IAAIj9C,EAAQ,EACZjM,EAAK,GAAKA,EAAK,GAAG2jB,QAAQ,iBAAiB,SAASqK,EAAO/J,GAEzD,GAAc,OAAV+J,EAAgB,OAAOA,EAC3B/hB,IACA,IAAIk9C,EAAY9uD,EAAQquD,WAAWzkC,GACnC,GAAI,mBAAsBklC,EAAW,CACnC,IAAI/9C,EAAMpL,EAAKiM,GACf+hB,EAAQm7B,EAAUnuD,KAAK6D,EAAMuM,GAG7BpL,EAAKsmB,OAAOra,EAAO,GACnBA,IAEF,OAAO+hB,KAIT3zB,EAAQitD,WAAWtsD,KAAK6D,EAAMmB,GAE9B,IAAIopD,EAAQhC,MAAMtH,KAAOzlD,EAAQylD,KAAOuH,QAAQvH,IAAIzjD,KAAKgrD,SACzD+B,EAAMlpD,MAAMrB,EAAMmB,IAapB,OAVAonD,MAAMI,UAAYA,EAClBJ,MAAM0B,QAAUzuD,EAAQyuD,QAAQtB,GAChCJ,MAAMG,UAAYltD,EAAQktD,YAC1BH,MAAMO,MA5ER,SAAS0B,YAAY7B,GACnB,IAAc3sD,EAAVyuD,EAAO,EAEX,IAAKzuD,KAAK2sD,EACR8B,GAAUA,GAAQ,GAAKA,EAAQ9B,EAAU1mC,WAAWjmB,GACpDyuD,GAAQ,EAGV,OAAOjvD,EAAQouD,OAAOpmD,KAAKumB,IAAI0gC,GAAQjvD,EAAQouD,OAAOjrD,QAoExC6rD,CAAY7B,GAGtB,mBAAsBntD,EAAQ0V,MAChC1V,EAAQ0V,KAAKq3C,OAGRA,OAtHT/sD,EAAUC,EAAOD,QAAUwuD,YAAYzB,MAAQyB,YAAqB,QAAIA,aAChEI,OA6LR,SAASA,OAAO79C,GACd,OAAIA,aAAenF,MAAcmF,EAAI2lB,OAAS3lB,EAAI+D,QAC3C/D,GA9LT/Q,EAAQkvD,QAyJR,SAASA,UACPlvD,EAAQsuD,OAAO,KAzJjBtuD,EAAQsuD,OA8HR,SAASA,OAAOb,GACdztD,EAAQwtD,KAAKC,GAEbztD,EAAQqa,MAAQ,GAChBra,EAAQmvD,MAAQ,GAKhB,IAHA,IAAInjD,GAA+B,iBAAfyhD,EAA0BA,EAAa,IAAIzhD,MAAM,UACjEZ,EAAMY,EAAM7I,OAEP3C,EAAI,EAAGA,EAAI4K,EAAK5K,IAClBwL,EAAMxL,KAEW,OADtBitD,EAAazhD,EAAMxL,GAAG8oB,QAAQ,MAAO,QACtB,GACbtpB,EAAQmvD,MAAM1iD,KAAK,IAAIR,OAAO,IAAMwhD,EAAW77B,OAAO,GAAK,MAE3D5xB,EAAQqa,MAAM5N,KAAK,IAAIR,OAAO,IAAMwhD,EAAa,QA5IvDztD,EAAQyuD,QAmKR,SAASA,QAAQ1tD,GACf,IAAIP,EAAG4K,EACP,IAAK5K,EAAI,EAAG4K,EAAMpL,EAAQmvD,MAAMhsD,OAAQ3C,EAAI4K,EAAK5K,IAC/C,GAAIR,EAAQmvD,MAAM3uD,GAAG4X,KAAKrX,GACxB,OAAO,EAGX,IAAKP,EAAI,EAAG4K,EAAMpL,EAAQqa,MAAMlX,OAAQ3C,EAAI4K,EAAK5K,IAC/C,GAAIR,EAAQqa,MAAM7Z,GAAG4X,KAAKrX,GACxB,OAAO,EAGX,OAAO,GA9KTf,EAAQotD,SAAW,EAAQ,KAM3BptD,EAAQqa,MAAQ,GAChBra,EAAQmvD,MAAQ,GAQhBnvD,EAAQquD,WAAa,I,cCxBrB,IAAI5rD,EAAI,IACJ7B,EAAI6B,IACJ2sD,EAAQ,GAAJxuD,EACJE,EAAQ,GAAJsuD,EAwIR,SAASC,OAAOV,EAAI1sD,EAAGlB,GACrB,KAAI4tD,EAAK1sD,GAGT,OAAI0sD,EAAS,IAAJ1sD,EACA+F,KAAKiJ,MAAM09C,EAAK1sD,GAAK,IAAMlB,EAE7BiH,KAAK6D,KAAK8iD,EAAK1sD,GAAK,IAAMlB,EAAO,IA9H1Cd,EAAOD,QAAU,SAAS+Q,EAAKulB,GAC7BA,EAAUA,GAAW,GACrB,IAAI9vB,SAAcuK,EAClB,GAAa,WAATvK,GAAqBuK,EAAI5N,OAAS,EACpC,OAkBJ,SAASmsD,MAAMnoC,GAEb,IADAA,EAAM5V,OAAO4V,IACLhkB,OAAS,IACf,OAEF,IAAIwwB,EAAQ,wHAAwHpqB,KAClI4d,GAEF,IAAKwM,EACH,OAEF,IAAI1xB,EAAIkiD,WAAWxwB,EAAM,IAEzB,QADYA,EAAM,IAAM,MAAMhK,eAE5B,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAzDE7oB,SAyDKmB,EACT,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOA,EAAInB,EACb,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAAOmB,EAAImtD,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOntD,EAAIrB,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOqB,EAAIQ,EACb,IAAK,eACL,IAAK,cACL,IAAK,QACL,IAAK,OACL,IAAK,KACH,OAAOR,EACT,QACE,QAnEKqtD,CAAMv+C,GACR,GAAa,WAATvK,IAAoC,IAAf0K,MAAMH,GACpC,OAAOulB,EAAQi5B,KAqGnB,SAASC,QAAQb,GACf,OAAOU,OAAOV,EAAI7tD,EAAG,QACnBuuD,OAAOV,EAAIS,EAAG,SACdC,OAAOV,EAAI/tD,EAAG,WACdyuD,OAAOV,EAAIlsD,EAAG,WACdksD,EAAK,MA1GiBa,CAAQz+C,GA6ElC,SAAS0+C,SAASd,GAChB,GAAIA,GAAM7tD,EACR,OAAOkH,KAAKyhB,MAAMklC,EAAK7tD,GAAK,IAE9B,GAAI6tD,GAAMS,EACR,OAAOpnD,KAAKyhB,MAAMklC,EAAKS,GAAK,IAE9B,GAAIT,GAAM/tD,EACR,OAAOoH,KAAKyhB,MAAMklC,EAAK/tD,GAAK,IAE9B,GAAI+tD,GAAMlsD,EACR,OAAOuF,KAAKyhB,MAAMklC,EAAKlsD,GAAK,IAE9B,OAAOksD,EAAK,KA1F2Bc,CAAS1+C,GAEhD,MAAM,IAAInF,MACR,wDACE0vC,KAAKE,UAAUzqC,M,gBChCrB,IAAIrO,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAI0T,EAAWhR,EAAuBmG,EAAQ,KAE1C6mD,EAAkBhtD,EAAuBmG,EAAQ,KAEjDqF,EAAmBxL,EAAuBmG,EAAQ,IAElDsF,EAAgBzL,EAAuBmG,EAAQ,IAE/C4Z,EAAQ/f,EAAuBmG,EAAQ,KAEvCG,EAAatG,EAAuBmG,EAAQ,KAE5C8mD,EAAsBjtD,EAAuBmG,EAAQ,KAEzD,SAAS8Z,2BAA2B1hB,GAAK,GAAsB,oBAAXM,QAAgD,MAAtBN,EAAEM,OAAOmH,UAAmB,CAAE,GAAIkC,MAAMgY,QAAQ3hB,KAAOA,EAErI,SAASoc,4BAA4Bpc,EAAGqc,GAAU,IAAKrc,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOsc,kBAAkBtc,EAAGqc,GAAS,IAAIrb,EAAIf,OAAOoB,UAAUmJ,SAAS9K,KAAKM,GAAGqL,MAAM,GAAI,GAAc,WAANrK,GAAkBhB,EAAEmD,cAAanC,EAAIhB,EAAEmD,YAAYrD,MAAM,GAAU,QAANkB,GAAqB,QAANA,EAAa,OAAO2I,MAAMC,KAAK5J,GAAI,GAAU,cAANgB,GAAqB,2CAA2CmW,KAAKnW,GAAI,OAAOsb,kBAAkBtc,EAAGqc,GAF7QD,CAA4Bpc,IAAK,CAAE,IAAIT,EAAI,EAAOqG,EAAI,SAASA,MAAQ,MAAO,CAAEpE,EAAGoE,EAAG5E,EAAG,SAASA,IAAM,OAAIzB,GAAKS,EAAEkC,OAAe,CAAEkC,MAAM,GAAe,CAAEA,MAAM,EAAO5D,MAAOR,EAAET,OAAWiI,EAAG,SAASA,EAAEoa,GAAM,MAAMA,GAAOva,EAAGzB,GAAO,MAAM,IAAI9D,UAAU,yIAA4I,IAAI6F,EAA6C9C,EAAzCgd,GAAmB,EAAMC,GAAS,EAAY,MAAO,CAAEtgB,EAAG,SAASA,IAAMmG,EAAK3H,EAAEM,OAAOmH,aAAgBzG,EAAG,SAASA,IAAM,IAAI+gB,EAAOpa,EAAG4S,OAAsC,OAA9BsH,EAAmBE,EAAK3d,KAAa2d,GAASva,EAAG,SAASA,EAAEwa,GAAOF,GAAS,EAAMjd,EAAMmd,GAAQ3a,EAAG,SAASA,IAAM,IAAWwa,GAAoC,MAAhBla,EAAE,QAAoBA,EAAE,SAAvD,QAAiF,GAAIma,EAAQ,MAAMjd,KAI53B,SAASyX,kBAAkBxT,EAAKqB,IAAkB,MAAPA,GAAeA,EAAMrB,EAAI5G,UAAQiI,EAAMrB,EAAI5G,QAAQ,IAAK,IAAI3C,EAAI,EAAGgd,EAAO,IAAI5S,MAAMQ,GAAM5K,EAAI4K,EAAK5K,IAAOgd,EAAKhd,GAAKuJ,EAAIvJ,GAAM,OAAOgd,EAEhL,IAAIoyC,EAA+B,WACjC,SAASA,gBAAgBjyC,GACvB,IAAIM,EAAOrY,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAC3EiqD,EAAgB5xC,EAAKiF,SACrBA,OAA6B,IAAlB2sC,EAA2B,GAAKA,EAC3CC,EAAgB7xC,EAAKC,SACrBA,OAA6B,IAAlB4xC,EAA2B,GAAKA,EAC3CC,EAAgB9xC,EAAKE,SACrBA,OAA6B,IAAlB4xC,EAA2B,GAAKA,GAE/C,EAAI7hD,EAAgB,SAAaxI,KAAMkqD,iBACvClqD,KAAKsqD,QAAUryC,EAEfjY,KAAKie,UAAYT,EAGjBxd,KAAKuqD,UAAY,CACf/xC,SAAUA,EACVC,SAAUA,GA8Gd,OArGA,EAAIhQ,EAAa,SAAayhD,gBAAiB,CAAC,CAC9C7tD,IAAK,WACLN,MAAO,SAASyuD,SAASC,GACvB,QAASzqD,KAAKie,UAAUwsC,KAOzB,CACDpuD,IAAK,iBACLN,MAAO,SAAS2uD,iBACd,IAAIC,EAAY,IAAIrnD,EAAU,QAE9B,IAAK,IAAI4G,KAAQlK,KAAKsqD,QAAS,CAC7B,IAAIlnD,GAAqB,EAAI6mD,EAAmB,SAAa//C,EAAMlK,KAAKsqD,QAAQpgD,GAAOlK,KAAKuqD,WACxFK,GAAsB,EAAIZ,EAAe,SAAa5mD,EAAoB,GAC1EmM,EAAUq7C,EAAoB,GAC9BvhD,EAAWuhD,EAAoB,GAE/BztD,OAAW,EAEf,GAAyC,WAArC,EAAI6Q,EAAQ,SAAauB,GAE3BpS,EAAWoS,OACN,GAAsB,mBAAXA,EAEhBpS,EAAW,IAAIoS,MACV,CAEL,IAAKvP,KAAKwqD,SAASj7C,IAAqB,aAATrF,EAC7B,MAAM,IAAIhE,MAAM,4KAGlB,IAAKlG,KAAKwqD,SAASj7C,GACjB,MAAM,IAAIrJ,MAAM,yCAA2CqJ,GAG7DpS,EAAW,IAAI6C,KAAKie,UAAU1O,GAGhC,IAAIs7C,EAAe1tD,EAASuM,UAAUrO,OAEtC,GAAIwvD,IAAiB3gD,EACnB,MAAM,IAAIhE,MAAM,mBAAoBb,OAAOwlD,EAAc,QAAUxlD,OAAO6E,EAAM,MAGlF/M,EAASuM,UAAUL,SAASA,GAC5BshD,EAAUvsC,SAASjhB,EAAU+M,GAO/B,OAJAlK,KAAK8qD,sBAAsBH,GAE3BA,EAAUlsC,qBACVze,KAAK+qD,WAAaJ,EACXA,IAER,CACDtuD,IAAK,wBACLN,MAAO,SAAS+uD,sBAAsBH,GACpC,IAAIh2C,EAAQg2C,EAAUnsC,4BAQlBwsC,EANUr2C,EAAMmiB,QAAO,SAAUV,EAAK/6B,GACxC,IACI4vD,EADUN,EAAUp7C,QAAQlU,GACbqO,UAAUR,eAC7B,OAAO,EAAI6T,EAAK,SAAaqZ,EAAI/wB,OAAO4lD,MACvC,IAEmBzkD,QAAO,SAAUnL,GACrC,OAAQsZ,EAAM4J,SAASljB,MAEzB,GAAuB,IAAnB2vD,EAAQvtD,OAAZ,CAEA,IACIggB,EADAG,EAAYX,2BAA2B+tC,GAG3C,IACE,IAAKptC,EAAU7gB,MAAO0gB,EAAQG,EAAUrhB,KAAKoD,MAAO,CAClD,IAAItE,EAAOoiB,EAAM1hB,MACbuY,EAAOtU,KAAKuqD,UAAU/xC,SAASnd,GAEnC,GADoB,iBAATiZ,IAAmBA,EAAOtU,KAAKie,UAAU3J,KAC/CA,EAAM,MAAM,IAAIpO,MAAM,yBAA0Bb,OAAOhK,EAAM,MAClEsvD,EAAUvsC,SAAS,IAAI9J,EAAQjZ,IAGjC,MAAO+E,GACPwd,EAAU7a,EAAE3C,GAVd,QAYEwd,EAAUhb,IAGZ5C,KAAK8qD,sBAAsBH,MAE5B,CACDtuD,IAAK,UACLN,MAAO,SAASwT,QAAQlU,GAEtB,OADK2E,KAAK+qD,YAAY/qD,KAAK0qD,iBACpB1qD,KAAK+qD,WAAWx7C,QAAQlU,OAG5B6uD,gBAhI0B,GAmInC5vD,EAAO,QAAc4vD,G,gBChKrB,IAAIgB,EAAW,EAAQ,KACnBC,EAAgB,EAAQ,KACxBC,EAAoB,EAAQ,KAC5BC,EAAW,EAAQ,KACnBC,EAAY,EAAQ,KACpB/uC,EAAa,EAAQ,IAkEzBhiB,EAAOD,QApDP,SAAS8hB,SAASvR,EAAO+U,EAAUkc,GACjC,IAAI5vB,GAAS,EACTqS,EAAW4sC,EACX1tD,EAASoN,EAAMpN,OACf8tD,GAAW,EACXn+C,EAAS,GACT+xB,EAAO/xB,EAEX,GAAI0uB,EACFyvB,GAAW,EACXhtC,EAAW6sC,OAER,GAAI3tD,GAvBY,IAuBgB,CACnC,IAAI6T,EAAMsO,EAAW,KAAO0rC,EAAUzgD,GACtC,GAAIyG,EACF,OAAOiL,EAAWjL,GAEpBi6C,GAAW,EACXhtC,EAAW8sC,EACXlsB,EAAO,IAAI+rB,OAGX/rB,EAAOvf,EAAW,GAAKxS,EAEzBo+C,EACA,OAASt/C,EAAQzO,GAAQ,CACvB,IAAI1B,EAAQ8O,EAAMqB,GACdu/C,EAAW7rC,EAAWA,EAAS7jB,GAASA,EAG5C,GADAA,EAAS+/B,GAAwB,IAAV//B,EAAeA,EAAQ,EAC1CwvD,GAAYE,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAYvsB,EAAK1hC,OACdiuD,KACL,GAAIvsB,EAAKusB,KAAeD,EACtB,SAASD,EAGT5rC,GACFuf,EAAKp4B,KAAK0kD,GAEZr+C,EAAOrG,KAAKhL,QAEJwiB,EAAS4gB,EAAMssB,EAAU3vB,KAC7BqD,IAAS/xB,GACX+xB,EAAKp4B,KAAK0kD,GAEZr+C,EAAOrG,KAAKhL,IAGhB,OAAOqR,I,gBCpET,IAAIu+C,EAAW,EAAQ,KACnBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,KAU1B,SAASX,SAAS30C,GAChB,IAAIrK,GAAS,EACTzO,EAAmB,MAAV8Y,EAAiB,EAAIA,EAAO9Y,OAGzC,IADAuC,KAAKiL,SAAW,IAAI0gD,IACXz/C,EAAQzO,GACfuC,KAAKizB,IAAI1c,EAAOrK,IAKpBg/C,SAAStuD,UAAUq2B,IAAMi4B,SAAStuD,UAAUmK,KAAO6kD,EACnDV,SAAStuD,UAAUgE,IAAMirD,EAEzBtxD,EAAOD,QAAU4wD,U,gBC1BjB,IAAIY,EAAgB,EAAQ,KACxBC,EAAiB,EAAQ,KACzBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,KAS1B,SAASP,SAASn1C,GAChB,IAAItK,GAAS,EACTzO,EAAoB,MAAX+Y,EAAkB,EAAIA,EAAQ/Y,OAG3C,IADAuC,KAAKmsD,UACIjgD,EAAQzO,GAAQ,CACvB,IAAI+lD,EAAQhtC,EAAQtK,GACpBlM,KAAKsR,IAAIkyC,EAAM,GAAIA,EAAM,KAK7BmI,SAAS/uD,UAAUuvD,MAAQL,EAC3BH,SAAS/uD,UAAkB,OAAImvD,EAC/BJ,SAAS/uD,UAAUjB,IAAMqwD,EACzBL,SAAS/uD,UAAUgE,IAAMqrD,EACzBN,SAAS/uD,UAAU0U,IAAM46C,EAEzB3xD,EAAOD,QAAUqxD,U,gBC/BjB,IAAIS,EAAO,EAAQ,KACfC,EAAY,EAAQ,KACpBh7C,EAAM,EAAQ,KAkBlB9W,EAAOD,QATP,SAASwxD,gBACP9rD,KAAK4F,KAAO,EACZ5F,KAAKiL,SAAW,CACd,KAAQ,IAAImhD,EACZ,IAAO,IAAK/6C,GAAOg7C,GACnB,OAAU,IAAID,K,gBChBlB,IAAIE,EAAY,EAAQ,KACpBC,EAAa,EAAQ,KACrBC,EAAU,EAAQ,KAClBC,EAAU,EAAQ,KAClBC,EAAU,EAAQ,KAStB,SAASN,KAAK51C,GACZ,IAAItK,GAAS,EACTzO,EAAoB,MAAX+Y,EAAkB,EAAIA,EAAQ/Y,OAG3C,IADAuC,KAAKmsD,UACIjgD,EAAQzO,GAAQ,CACvB,IAAI+lD,EAAQhtC,EAAQtK,GACpBlM,KAAKsR,IAAIkyC,EAAM,GAAIA,EAAM,KAK7B4I,KAAKxvD,UAAUuvD,MAAQG,EACvBF,KAAKxvD,UAAkB,OAAI2vD,EAC3BH,KAAKxvD,UAAUjB,IAAM6wD,EACrBJ,KAAKxvD,UAAUgE,IAAM6rD,EACrBL,KAAKxvD,UAAU0U,IAAMo7C,EAErBnyD,EAAOD,QAAU8xD,M,gBC/BjB,IAAI/hD,EAAe,EAAQ,IAc3B9P,EAAOD,QALP,SAASgyD,YACPtsD,KAAKiL,SAAWZ,EAAeA,EAAa,MAAQ,GACpDrK,KAAK4F,KAAO,I,gBCXd,IAAI0W,EAAa,EAAQ,IACrBqwC,EAAW,EAAQ,KACnB1pD,EAAW,EAAQ,IACnB2pD,EAAW,EAAQ,KASnBC,EAAe,8BAGfC,EAAY5qD,SAAStF,UACrBmwD,EAAcvxD,OAAOoB,UAGrBowD,EAAeF,EAAU/mD,SAGzBlJ,EAAiBkwD,EAAYlwD,eAG7BowD,EAAa1mD,OAAO,IACtBymD,EAAa/xD,KAAK4B,GAAgB+mB,QAjBjB,sBAiBuC,QACvDA,QAAQ,yDAA0D,SAAW,KAmBhFrpB,EAAOD,QARP,SAAS0X,aAAajW,GACpB,SAAKkH,EAASlH,IAAU4wD,EAAS5wD,MAGnBugB,EAAWvgB,GAASkxD,EAAaJ,GAChCn6C,KAAKk6C,EAAS7wD,M,gBC3C/B,IAAIF,EAAS,EAAQ,IAGjBkxD,EAAcvxD,OAAOoB,UAGrBC,EAAiBkwD,EAAYlwD,eAO7BqwD,EAAuBH,EAAYhnD,SAGnC0E,EAAiB5O,EAASA,EAAOC,iBAAcuE,EA6BnD9F,EAAOD,QApBP,SAASiQ,UAAUxO,GACjB,IAAIoxD,EAAQtwD,EAAe5B,KAAKc,EAAO0O,GACnC8C,EAAMxR,EAAM0O,GAEhB,IACE1O,EAAM0O,QAAkBpK,EACxB,IAAI+sD,GAAW,EACf,MAAOrqD,IAET,IAAIqK,EAAS8/C,EAAqBjyD,KAAKc,GAQvC,OAPIqxD,IACED,EACFpxD,EAAM0O,GAAkB8C,SAEjBxR,EAAM0O,IAGV2C,I,cCzCT,IAOI8/C,EAPc1xD,OAAOoB,UAOcmJ,SAavCxL,EAAOD,QAJP,SAASkQ,eAAezO,GACtB,OAAOmxD,EAAqBjyD,KAAKc,K,gBClBnC,IAIMiD,EAJFquD,EAAa,EAAQ,KAGrBC,GACEtuD,EAAM,SAAS6E,KAAKwpD,GAAcA,EAAWjlD,MAAQilD,EAAWjlD,KAAKgE,UAAY,KACvE,iBAAmBpN,EAAO,GAc1CzE,EAAOD,QAJP,SAASqyD,SAAS3+B,GAChB,QAASs/B,GAAeA,KAAct/B,I,gBChBxC,IAGIq/B,EAHO,EAAQ,IAGG,sBAEtB9yD,EAAOD,QAAU+yD,G,cCJjB,IAGIL,EAHY9qD,SAAStF,UAGImJ,SAqB7BxL,EAAOD,QAZP,SAASsyD,SAAS5+B,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOg/B,EAAa/xD,KAAK+yB,GACzB,MAAOjrB,IACT,IACE,OAAQirB,EAAO,GACf,MAAOjrB,KAEX,MAAO,K,cCVTxI,EAAOD,QAJP,SAAS2X,SAASvV,EAAQL,GACxB,OAAiB,MAAVK,OAAiB2D,EAAY3D,EAAOL,K,cCO7C9B,EAAOD,QANP,SAASiyD,WAAWlwD,GAClB,IAAI+Q,EAASpN,KAAKY,IAAIvE,WAAe2D,KAAKiL,SAAS5O,GAEnD,OADA2D,KAAK4F,MAAQwH,EAAS,EAAI,EACnBA,I,gBCbT,IAAI/C,EAAe,EAAQ,IASvBxN,EAHcrB,OAAOoB,UAGQC,eAoBjCtC,EAAOD,QATP,SAASkyD,QAAQnwD,GACf,IAAI2O,EAAOhL,KAAKiL,SAChB,GAAIZ,EAAc,CAChB,IAAI+C,EAASpC,EAAK3O,GAClB,MArBiB,8BAqBV+Q,OAA4B/M,EAAY+M,EAEjD,OAAOvQ,EAAe5B,KAAK+P,EAAM3O,GAAO2O,EAAK3O,QAAOgE,I,gBC1BtD,IAAIgK,EAAe,EAAQ,IAMvBxN,EAHcrB,OAAOoB,UAGQC,eAgBjCtC,EAAOD,QALP,SAASmyD,QAAQpwD,GACf,IAAI2O,EAAOhL,KAAKiL,SAChB,OAAOZ,OAA8BhK,IAAd2K,EAAK3O,GAAsBQ,EAAe5B,KAAK+P,EAAM3O,K,gBCnB9E,IAAIgO,EAAe,EAAQ,IAsB3B9P,EAAOD,QAPP,SAASoyD,QAAQrwD,EAAKN,GACpB,IAAIiP,EAAOhL,KAAKiL,SAGhB,OAFAjL,KAAK4F,MAAQ5F,KAAKY,IAAIvE,GAAO,EAAI,EACjC2O,EAAK3O,GAAQgO,QAA0BhK,IAAVtE,EAfV,4BAekDA,EAC9DiE,O,gBCnBT,IAAIutD,EAAiB,EAAQ,KACzBC,EAAkB,EAAQ,KAC1BC,EAAe,EAAQ,KACvBC,EAAe,EAAQ,KACvBC,EAAe,EAAQ,KAS3B,SAAStB,UAAU71C,GACjB,IAAItK,GAAS,EACTzO,EAAoB,MAAX+Y,EAAkB,EAAIA,EAAQ/Y,OAG3C,IADAuC,KAAKmsD,UACIjgD,EAAQzO,GAAQ,CACvB,IAAI+lD,EAAQhtC,EAAQtK,GACpBlM,KAAKsR,IAAIkyC,EAAM,GAAIA,EAAM,KAK7B6I,UAAUzvD,UAAUuvD,MAAQoB,EAC5BlB,UAAUzvD,UAAkB,OAAI4wD,EAChCnB,UAAUzvD,UAAUjB,IAAM8xD,EAC1BpB,UAAUzvD,UAAUgE,IAAM8sD,EAC1BrB,UAAUzvD,UAAU0U,IAAMq8C,EAE1BpzD,EAAOD,QAAU+xD,W,cCnBjB9xD,EAAOD,QALP,SAASizD,iBACPvtD,KAAKiL,SAAW,GAChBjL,KAAK4F,KAAO,I,gBCTd,IAAIgF,EAAe,EAAQ,IAMvB2b,EAHarhB,MAAMtI,UAGC2pB,OA4BxBhsB,EAAOD,QAjBP,SAASkzD,gBAAgBnxD,GACvB,IAAI2O,EAAOhL,KAAKiL,SACZiB,EAAQtB,EAAaI,EAAM3O,GAE/B,QAAI6P,EAAQ,KAIRA,GADYlB,EAAKvN,OAAS,EAE5BuN,EAAKyZ,MAEL8B,EAAOtrB,KAAK+P,EAAMkB,EAAO,KAEzBlM,KAAK4F,MACA,K,cCKTrL,EAAOD,QAJP,SAASqQ,GAAG5O,EAAOs9C,GACjB,OAAOt9C,IAAUs9C,GAAUt9C,GAAUA,GAASs9C,GAAUA,I,gBCjC1D,IAAIzuC,EAAe,EAAQ,IAkB3BrQ,EAAOD,QAPP,SAASmzD,aAAapxD,GACpB,IAAI2O,EAAOhL,KAAKiL,SACZiB,EAAQtB,EAAaI,EAAM3O,GAE/B,OAAO6P,EAAQ,OAAI7L,EAAY2K,EAAKkB,GAAO,K,gBCf7C,IAAItB,EAAe,EAAQ,IAe3BrQ,EAAOD,QAJP,SAASozD,aAAarxD,GACpB,OAAOuO,EAAa5K,KAAKiL,SAAU5O,IAAQ,I,gBCZ7C,IAAIuO,EAAe,EAAQ,IAyB3BrQ,EAAOD,QAbP,SAASqzD,aAAatxD,EAAKN,GACzB,IAAIiP,EAAOhL,KAAKiL,SACZiB,EAAQtB,EAAaI,EAAM3O,GAQ/B,OANI6P,EAAQ,KACRlM,KAAK4F,KACPoF,EAAKjE,KAAK,CAAC1K,EAAKN,KAEhBiP,EAAKkB,GAAO,GAAKnQ,EAEZiE,O,gBCtBT,IAIIqR,EAJY,EAAQ,GAId/G,CAHC,EAAQ,IAGO,OAE1B/P,EAAOD,QAAU+W,G,gBCNjB,IAAItG,EAAa,EAAQ,IAiBzBxQ,EAAOD,QANP,SAASyxD,eAAe1vD,GACtB,IAAI+Q,EAASrC,EAAW/K,KAAM3D,GAAa,OAAEA,GAE7C,OADA2D,KAAK4F,MAAQwH,EAAS,EAAI,EACnBA,I,cCAT7S,EAAOD,QAPP,SAASwQ,UAAU/O,GACjB,IAAI+E,SAAc/E,EAClB,MAAgB,UAAR+E,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV/E,EACU,OAAVA,I,gBCXP,IAAIgP,EAAa,EAAQ,IAezBxQ,EAAOD,QAJP,SAAS0xD,YAAY3vD,GACnB,OAAO0O,EAAW/K,KAAM3D,GAAKV,IAAIU,K,gBCZnC,IAAI0O,EAAa,EAAQ,IAezBxQ,EAAOD,QAJP,SAAS2xD,YAAY5vD,GACnB,OAAO0O,EAAW/K,KAAM3D,GAAKuE,IAAIvE,K,gBCZnC,IAAI0O,EAAa,EAAQ,IAqBzBxQ,EAAOD,QATP,SAAS4xD,YAAY7vD,EAAKN,GACxB,IAAIiP,EAAOD,EAAW/K,KAAM3D,GACxBuJ,EAAOoF,EAAKpF,KAIhB,OAFAoF,EAAKsG,IAAIjV,EAAKN,GACdiE,KAAK4F,MAAQoF,EAAKpF,MAAQA,EAAO,EAAI,EAC9B5F,O,cCATzF,EAAOD,QALP,SAASsxD,YAAY7vD,GAEnB,OADAiE,KAAKiL,SAASqG,IAAIvV,EAbC,6BAcZiE,O,cCFTzF,EAAOD,QAJP,SAASuxD,YAAY9vD,GACnB,OAAOiE,KAAKiL,SAASrK,IAAI7E,K,gBCV3B,IAAI6xD,EAAc,EAAQ,KAgB1BrzD,EAAOD,QALP,SAAS6wD,cAActgD,EAAO9O,GAE5B,SADsB,MAAT8O,EAAgB,EAAIA,EAAMpN,SACpBmwD,EAAY/iD,EAAO9O,EAAO,IAAM,I,gBCbrD,IAAI8xD,EAAgB,EAAQ,KACxBC,EAAY,EAAQ,KACpBC,EAAgB,EAAQ,KAiB5BxzD,EAAOD,QANP,SAASszD,YAAY/iD,EAAO9O,EAAOqgC,GACjC,OAAOrgC,GAAUA,EACbgyD,EAAcljD,EAAO9O,EAAOqgC,GAC5ByxB,EAAchjD,EAAOijD,EAAW1xB,K,cCOtC7hC,EAAOD,QAZP,SAASuzD,cAAchjD,EAAOmjD,EAAW5xB,EAAW6xB,GAIlD,IAHA,IAAIxwD,EAASoN,EAAMpN,OACfyO,EAAQkwB,GAAa6xB,EAAY,GAAK,GAElCA,EAAY/hD,MAAYA,EAAQzO,GACtC,GAAIuwD,EAAUnjD,EAAMqB,GAAQA,EAAOrB,GACjC,OAAOqB,EAGX,OAAQ,I,cCTV3R,EAAOD,QAJP,SAASwzD,UAAU/xD,GACjB,OAAOA,GAAUA,I,cCcnBxB,EAAOD,QAZP,SAASyzD,cAAcljD,EAAO9O,EAAOqgC,GAInC,IAHA,IAAIlwB,EAAQkwB,EAAY,EACpB3+B,EAASoN,EAAMpN,SAEVyO,EAAQzO,GACf,GAAIoN,EAAMqB,KAAWnQ,EACnB,OAAOmQ,EAGX,OAAQ,I,cCEV3R,EAAOD,QAZP,SAAS8wD,kBAAkBvgD,EAAO9O,EAAO+/B,GAIvC,IAHA,IAAI5vB,GAAS,EACTzO,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,SAE9ByO,EAAQzO,GACf,GAAIq+B,EAAW//B,EAAO8O,EAAMqB,IAC1B,OAAO,EAGX,OAAO,I,cCNT3R,EAAOD,QAJP,SAAS+wD,SAAS35C,EAAOrV,GACvB,OAAOqV,EAAM9Q,IAAIvE,K,gBCTnB,IAAI6qC,EAAM,EAAQ,KACdpsB,EAAO,EAAQ,KACfyB,EAAa,EAAQ,IAYrB+uC,EAAcpkB,GAAQ,EAAI3qB,EAAW,IAAI2qB,EAAI,CAAC,EAAE,KAAK,IAT1C,IASoE,SAAS3wB,GAC1F,OAAO,IAAI2wB,EAAI3wB,IAD2DuE,EAI5EvgB,EAAOD,QAAUgxD,G,gBClBjB,IAIIpkB,EAJY,EAAQ,GAId58B,CAHC,EAAQ,IAGO,OAE1B/P,EAAOD,QAAU4sC,G,cCUjB3sC,EAAOD,QAJP,SAASwgB,U,gBCZT,IAAIozC,EAAa,EAAQ,KACrB9lD,EAAO,EAAQ,KAgCnB7N,EAAOD,QAJP,SAASic,OAAO7Z,GACd,OAAiB,MAAVA,EAAiB,GAAKwxD,EAAWxxD,EAAQ0L,EAAK1L,M,gBC9BvD,IAAIijB,EAAW,EAAQ,IAkBvBplB,EAAOD,QANP,SAAS4zD,WAAWxxD,EAAQc,GAC1B,OAAOmiB,EAASniB,GAAO,SAASnB,GAC9B,OAAOK,EAAOL,Q,gBCdlB,IAAI8xD,EAAgB,EAAQ,KACxBC,EAAW,EAAQ,KACnBn4B,EAAc,EAAQ,KAkC1B17B,EAAOD,QAJP,SAAS8N,KAAK1L,GACZ,OAAOu5B,EAAYv5B,GAAUyxD,EAAczxD,GAAU0xD,EAAS1xD,K,gBCjChE,IAAImjB,EAAY,EAAQ,IACpBgQ,EAAc,EAAQ,KACtB3S,EAAU,EAAQ,IAClB6P,EAAW,EAAQ,KACnBshC,EAAU,EAAQ,KAClBC,EAAe,EAAQ,KAMvBzxD,EAHcrB,OAAOoB,UAGQC,eAqCjCtC,EAAOD,QA3BP,SAAS6zD,cAAcpyD,EAAOwyD,GAC5B,IAAIC,EAAQtxC,EAAQnhB,GAChB0yD,GAASD,GAAS3+B,EAAY9zB,GAC9B2yD,GAAUF,IAAUC,GAAS1hC,EAAShxB,GACtC4yD,GAAUH,IAAUC,IAAUC,GAAUJ,EAAavyD,GACrD6yD,EAAcJ,GAASC,GAASC,GAAUC,EAC1CvhD,EAASwhD,EAAc/uC,EAAU9jB,EAAM0B,OAAQoO,QAAU,GACzDpO,EAAS2P,EAAO3P,OAEpB,IAAK,IAAIpB,KAAON,GACTwyD,IAAa1xD,EAAe5B,KAAKc,EAAOM,IACvCuyD,IAEQ,UAAPvyD,GAECqyD,IAAkB,UAAPryD,GAA0B,UAAPA,IAE9BsyD,IAAkB,UAAPtyD,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDgyD,EAAQhyD,EAAKoB,KAElB2P,EAAOrG,KAAK1K,GAGhB,OAAO+Q,I,gBC7CT,IAAIyhD,EAAkB,EAAQ,KAC1B3jD,EAAe,EAAQ,IAGvB6hD,EAAcvxD,OAAOoB,UAGrBC,EAAiBkwD,EAAYlwD,eAG7B0L,EAAuBwkD,EAAYxkD,qBAoBnCsnB,EAAcg/B,EAAgB,WAAa,OAAO3uD,UAApB,IAAsC2uD,EAAkB,SAAS9yD,GACjG,OAAOmP,EAAanP,IAAUc,EAAe5B,KAAKc,EAAO,YACtDwM,EAAqBtN,KAAKc,EAAO,WAGtCxB,EAAOD,QAAUu1B,G,gBCnCjB,IAAInlB,EAAa,EAAQ,IACrBQ,EAAe,EAAQ,IAgB3B3Q,EAAOD,QAJP,SAASu0D,gBAAgB9yD,GACvB,OAAOmP,EAAanP,IAVR,sBAUkB2O,EAAW3O,K,iBCd3C,kBAAW,EAAQ,IACf+yD,EAAY,EAAQ,KAGpBC,EAA4Cz0D,IAAYA,EAAQ47B,UAAY57B,EAG5E00D,EAAaD,GAAgC,iBAAVx0D,GAAsBA,IAAWA,EAAO27B,UAAY37B,EAMvF6L,EAHgB4oD,GAAcA,EAAW10D,UAAYy0D,EAG5B30D,EAAKgM,YAAS/F,EAsBvC0sB,GAnBiB3mB,EAASA,EAAO2mB,cAAW1sB,IAmBfyuD,EAEjCv0D,EAAOD,QAAUyyB,I,mCCpBjBxyB,EAAOD,QAJP,SAASw0D,YACP,OAAO,I,cCbT,IAGIG,EAAW,mBAoBf10D,EAAOD,QAVP,SAAS+zD,QAAQtyD,EAAO0B,GACtB,IAAIqD,SAAc/E,EAGlB,SAFA0B,EAAmB,MAAVA,EAfY,iBAewBA,KAGlC,UAARqD,GACU,UAARA,GAAoBmuD,EAASv8C,KAAK3W,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ0B,I,gBCrBjD,IAAIyxD,EAAmB,EAAQ,KAC3BC,EAAY,EAAQ,KACpBC,EAAW,EAAQ,KAGnBC,EAAmBD,GAAYA,EAASd,aAmBxCA,EAAee,EAAmBF,EAAUE,GAAoBH,EAEpE30D,EAAOD,QAAUg0D,G,gBC1BjB,IAAI5jD,EAAa,EAAQ,IACrBwV,EAAW,EAAQ,KACnBhV,EAAe,EAAQ,IA8BvBokD,EAAiB,GACrBA,EAZiB,yBAYYA,EAXZ,yBAYjBA,EAXc,sBAWYA,EAVX,uBAWfA,EAVe,uBAUYA,EATZ,uBAUfA,EATsB,8BASYA,EARlB,wBAShBA,EARgB,yBAQY,EAC5BA,EAjCc,sBAiCYA,EAhCX,kBAiCfA,EApBqB,wBAoBYA,EAhCnB,oBAiCdA,EApBkB,qBAoBYA,EAhChB,iBAiCdA,EAhCe,kBAgCYA,EA/Bb,qBAgCdA,EA/Ba,gBA+BYA,EA9BT,mBA+BhBA,EA9BgB,mBA8BYA,EA7BZ,mBA8BhBA,EA7Ba,gBA6BYA,EA5BT,mBA6BhBA,EA5BiB,qBA4BY,EAc7B/0D,EAAOD,QALP,SAAS40D,iBAAiBnzD,GACxB,OAAOmP,EAAanP,IAClBmkB,EAASnkB,EAAM0B,WAAa6xD,EAAe5kD,EAAW3O,M,cC3C1DxB,EAAOD,QANP,SAAS60D,UAAUnhC,GACjB,OAAO,SAASjyB,GACd,OAAOiyB,EAAKjyB,M,iBCThB,kBAAiB,EAAQ,IAGrBgzD,EAA4Cz0D,IAAYA,EAAQ47B,UAAY57B,EAG5E00D,EAAaD,GAAgC,iBAAVx0D,GAAsBA,IAAWA,EAAO27B,UAAY37B,EAMvFg1D,EAHgBP,GAAcA,EAAW10D,UAAYy0D,GAGtB/mD,EAAW4R,QAG1Cw1C,EAAY,WACd,IAEE,IAAII,EAAQR,GAAcA,EAAW7rD,SAAW6rD,EAAW7rD,QAAQ,QAAQqsD,MAE3E,OAAIA,GAKGD,GAAeA,EAAYxzC,SAAWwzC,EAAYxzC,QAAQ,QACjE,MAAOhZ,KAXI,GAcfxI,EAAOD,QAAU80D,I,qCC7BjB,IAAIK,EAAc,EAAQ,KACtBC,EAAa,EAAQ,KAMrB7yD,EAHcrB,OAAOoB,UAGQC,eAsBjCtC,EAAOD,QAbP,SAAS8zD,SAAS1xD,GAChB,IAAK+yD,EAAY/yD,GACf,OAAOgzD,EAAWhzD,GAEpB,IAAI0Q,EAAS,GACb,IAAK,IAAI/Q,KAAOb,OAAOkB,GACjBG,EAAe5B,KAAKyB,EAAQL,IAAe,eAAPA,GACtC+Q,EAAOrG,KAAK1K,GAGhB,OAAO+Q,I,cCzBT,IAAI2/C,EAAcvxD,OAAOoB,UAgBzBrC,EAAOD,QAPP,SAASm1D,YAAY1zD,GACnB,IAAI0sC,EAAO1sC,GAASA,EAAM2C,YAG1B,OAAO3C,KAFqB,mBAAR0sC,GAAsBA,EAAK7rC,WAAcmwD,K,gBCZ/D,IAGI2C,EAHU,EAAQ,IAGLC,CAAQn0D,OAAO4M,KAAM5M,QAEtCjB,EAAOD,QAAUo1D,G,cCSjBn1D,EAAOD,QANP,SAASq1D,QAAQ3hC,EAAM4hC,GACrB,OAAO,SAASpwD,GACd,OAAOwuB,EAAK4hC,EAAUpwD,O,gBCV1B,IAAI8c,EAAa,EAAQ,IACrB4D,EAAW,EAAQ,KA+BvB3lB,EAAOD,QAJP,SAAS27B,YAAYl6B,GACnB,OAAgB,MAATA,GAAiBmkB,EAASnkB,EAAM0B,UAAY6e,EAAWvgB,K,cCfhE,SAAS8zD,SAASC,EAAOpyC,GACvB,IAAIqyC,EAASD,EAAMryD,OACfuyD,EAAS,IAAI9qD,MAAM6qD,GACnBE,EAAU,GACVn1D,EAAIi1D,EAEJG,EA4DN,SAASC,kBAAkB9rD,GAEzB,IADA,IAAIqZ,EAAQ,IAAIrM,IACPvW,EAAI,EAAG4K,EAAMrB,EAAI5G,OAAQ3C,EAAI4K,EAAK5K,IAAK,CAC9C,IAAIs1D,EAAO/rD,EAAIvJ,GACV4iB,EAAM9c,IAAIwvD,EAAK,KAAK1yC,EAAMpM,IAAI8+C,EAAK,GAAI,IAAIlpB,KAC3CxpB,EAAM9c,IAAIwvD,EAAK,KAAK1yC,EAAMpM,IAAI8+C,EAAK,GAAI,IAAIlpB,KAChDxpB,EAAM/hB,IAAIy0D,EAAK,IAAIn9B,IAAIm9B,EAAK,IAE9B,OAAO1yC,EApEayyC,CAAkBzyC,GAClC2yC,EAsEN,SAASC,cAAcjsD,GAErB,IADA,IAAIwhC,EAAM,IAAIx0B,IACLvW,EAAI,EAAG4K,EAAMrB,EAAI5G,OAAQ3C,EAAI4K,EAAK5K,IACzC+qC,EAAIv0B,IAAIjN,EAAIvJ,GAAIA,GAElB,OAAO+qC,EA3ESyqB,CAAcR,GAS9B,IANApyC,EAAMjX,SAAQ,SAAS2pD,GACrB,IAAKC,EAAUzvD,IAAIwvD,EAAK,MAAQC,EAAUzvD,IAAIwvD,EAAK,IACjD,MAAM,IAAIlqD,MAAM,oEAIbpL,KACAm1D,EAAQn1D,IAAIy1D,MAAMT,EAAMh1D,GAAIA,EAAG,IAAIosC,KAG1C,OAAO8oB,EAEP,SAASO,MAAMC,EAAM11D,EAAG21D,GACtB,GAAGA,EAAa7vD,IAAI4vD,GAAO,CACzB,IAAIE,EACJ,IACEA,EAAU,cAAgB9a,KAAKE,UAAU0a,GACzC,MAAMztD,GACN2tD,EAAU,GAEZ,MAAM,IAAIxqD,MAAM,oBAAsBwqD,GAGxC,IAAKL,EAAUzvD,IAAI4vD,GACjB,MAAM,IAAItqD,MAAM,+EAA+E0vC,KAAKE,UAAU0a,IAGhH,IAAIP,EAAQn1D,GAAZ,CACAm1D,EAAQn1D,IAAK,EAEb,IAAI61D,EAAWT,EAAcv0D,IAAI60D,IAAS,IAAItpB,IAG9C,GAAIpsC,GAFJ61D,EAAWzrD,MAAMC,KAAKwrD,IAELlzD,OAAQ,CACvBgzD,EAAax9B,IAAIu9B,GACjB,EAAG,CACD,IAAII,EAAQD,IAAW71D,GACvBy1D,MAAMK,EAAOP,EAAU10D,IAAIi1D,GAAQH,SAC5B31D,GACT21D,EAAaI,OAAOL,GAGtBR,IAASD,GAAUS,IA1DvBj2D,EAAOD,QAAU,SAASojB,GACxB,OAAOmyC,SA6DT,SAASiB,YAAYzsD,GAEnB,IADA,IAAIwhC,EAAM,IAAIqB,IACLpsC,EAAI,EAAG4K,EAAMrB,EAAI5G,OAAQ3C,EAAI4K,EAAK5K,IAAK,CAC9C,IAAIs1D,EAAO/rD,EAAIvJ,GACf+qC,EAAI5S,IAAIm9B,EAAK,IACbvqB,EAAI5S,IAAIm9B,EAAK,IAEf,OAAOlrD,MAAMC,KAAK0gC,GApEFirB,CAAYpzC,GAAQA,IAGtCnjB,EAAOD,QAAQuQ,MAAQglD,U,gBCVvB,IAAI7yD,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAIkO,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAElDuF,EAAe1L,EAAuBmG,EAAQ,KAIlD,SAASoL,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAO3b,IAkBIpD,EAlB4B,SAAUqO,IACxC,EAAInK,EAAU,SAAakyC,aAAc/nC,GAEzC,IAAIlJ,EAASZ,aAAa6xC,cAM1B,SAASA,aAAa/kD,GACpB,IAAI6N,EAAehJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAEvF,OADA,EAAIsI,EAAgB,SAAaxI,KAAMogD,cAChCjxC,EAAOlU,KAAK+E,KAAM0I,EAAY,QAAYrB,MAAOhM,EAAM6N,GAGhE,OAAOk3C,aAfuB,CATZpjD,EAAuBmG,EAAQ,KAyBpC,SAGf7I,EAAO,QAAc0P,G,gBC7CrB,IAAIhN,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAIkO,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAElDuF,EAAe1L,EAAuBmG,EAAQ,KAIlD,SAASoL,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAO3b,IAkBIpD,EAlB6B,SAAUqO,IACzC,EAAInK,EAAU,SAAa6iD,cAAe14C,GAE1C,IAAIlJ,EAASZ,aAAawiD,eAM1B,SAASA,cAAc11D,GACrB,IAAI6N,EAAehJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAEvF,OADA,EAAIsI,EAAgB,SAAaxI,KAAM+wD,eAChC5hD,EAAOlU,KAAK+E,KAAM0I,EAAY,QAAYpB,OAAQjM,EAAM6N,GAGjE,OAAO6nD,cAfwB,CATb/zD,EAAuBmG,EAAQ,KAyBpC,SAGf7I,EAAO,QAAc0P,G,gBC7CrB,IAAIhN,EAAyBmG,EAAQ,GAErC3H,OAAOC,eAAenB,EAAS,aAAc,CAC3CyB,OAAO,IAETzB,EAAO,aAAc,EAErB,IAAIkO,EAAmBxL,EAAuBmG,EAAQ,IAElD+K,EAAalR,EAAuBmG,EAAQ,IAE5CgL,EAA8BnR,EAAuBmG,EAAQ,IAE7DiL,EAAmBpR,EAAuBmG,EAAQ,IAElDuF,EAAe1L,EAAuBmG,EAAQ,KAIlD,SAASoL,aAAaC,GAAW,IAAIC,EAErC,SAASC,4BAA8B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EC,KAAKnS,UAAUmJ,SAAS9K,KAAK0T,QAAQC,UAAUG,KAAM,IAAI,iBAAyB,EAAQ,MAAOhM,GAAK,OAAO,GAFzP2L,GAA6B,OAAO,WAAc,IAAuDtB,EAAnD4B,GAAQ,EAAIZ,EAAgB,SAAaI,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,GAAY,EAAIb,EAAgB,SAAapO,MAAMtB,YAAa0O,EAASuB,QAAQC,UAAUI,EAAO9O,UAAW+O,QAAqB7B,EAAS4B,EAAM7O,MAAMH,KAAME,WAAc,OAAO,EAAIiO,EAA2B,SAAanO,KAAMoN,IAO3b,IAkBIpD,EAlB8B,SAAUqO,IAC1C,EAAInK,EAAU,SAAa8iD,eAAgB34C,GAE3C,IAAIlJ,EAASZ,aAAayiD,gBAM1B,SAASA,eAAe31D,GACtB,IAAI6N,EAAehJ,UAAUzC,OAAS,QAAsB4C,IAAjBH,UAAU,GAAmBA,UAAU,GAAK,GAEvF,OADA,EAAIsI,EAAgB,SAAaxI,KAAMgxD,gBAChC7hD,EAAOlU,KAAK+E,KAAM0I,EAAY,QAAYnB,QAASlM,EAAM6N,GAGlE,OAAO8nD,eAfyB,CATdh0D,EAAuBmG,EAAQ,KAyBpC,SAGf7I,EAAO,QAAc0P,G,iBC/CrB,YAUA,IAAIinD,EAAS,EAAQ,KACjBC,EAAU,EAAQ,KAClBh0C,EAAU,EAAQ,KAmDtB,SAASi0C,aACP,OAAO/qD,OAAOgrD,oBACV,WACA,WAGN,SAASC,aAAcjmD,EAAM3N,GAC3B,GAAI0zD,aAAe1zD,EACjB,MAAM,IAAIqJ,WAAW,8BAcvB,OAZIV,OAAOgrD,qBAEThmD,EAAO,IAAImkB,WAAW9xB,IACjBU,UAAYiI,OAAOxJ,WAGX,OAATwO,IACFA,EAAO,IAAIhF,OAAO3I,IAEpB2N,EAAK3N,OAASA,GAGT2N,EAaT,SAAShF,OAAQ5G,EAAK8xD,EAAkB7zD,GACtC,KAAK2I,OAAOgrD,qBAAyBpxD,gBAAgBoG,QACnD,OAAO,IAAIA,OAAO5G,EAAK8xD,EAAkB7zD,GAI3C,GAAmB,iBAAR+B,EAAkB,CAC3B,GAAgC,iBAArB8xD,EACT,MAAM,IAAIprD,MACR,qEAGJ,OAAOqrD,YAAYvxD,KAAMR,GAE3B,OAAO2F,KAAKnF,KAAMR,EAAK8xD,EAAkB7zD,GAW3C,SAAS0H,KAAMiG,EAAMrP,EAAOu1D,EAAkB7zD,GAC5C,GAAqB,iBAAV1B,EACT,MAAM,IAAIsB,UAAU,yCAGtB,MAA2B,oBAAhBowB,aAA+B1xB,aAAiB0xB,YA6H7D,SAAS+jC,gBAAiBpmD,EAAMP,EAAO4mD,EAAYh0D,GAGjD,GAFAoN,EAAM6mD,WAEFD,EAAa,GAAK5mD,EAAM6mD,WAAaD,EACvC,MAAM,IAAI3qD,WAAW,6BAGvB,GAAI+D,EAAM6mD,WAAaD,GAAch0D,GAAU,GAC7C,MAAM,IAAIqJ,WAAW,6BAIrB+D,OADiBxK,IAAfoxD,QAAuCpxD,IAAX5C,EACtB,IAAI8xB,WAAW1kB,QACHxK,IAAX5C,EACD,IAAI8xB,WAAW1kB,EAAO4mD,GAEtB,IAAIliC,WAAW1kB,EAAO4mD,EAAYh0D,GAGxC2I,OAAOgrD,qBAEThmD,EAAOP,GACF1M,UAAYiI,OAAOxJ,UAGxBwO,EAAOumD,cAAcvmD,EAAMP,GAE7B,OAAOO,EAvJEomD,CAAgBpmD,EAAMrP,EAAOu1D,EAAkB7zD,GAGnC,iBAAV1B,EAwFb,SAAS61D,WAAYxmD,EAAMqH,EAAQo/C,GACT,iBAAbA,GAAsC,KAAbA,IAClCA,EAAW,QAGb,IAAKzrD,OAAO0rD,WAAWD,GACrB,MAAM,IAAIx0D,UAAU,8CAGtB,IAAII,EAAwC,EAA/Bi0D,WAAWj/C,EAAQo/C,GAG5BtjC,GAFJnjB,EAAOimD,aAAajmD,EAAM3N,IAERuP,MAAMyF,EAAQo/C,GAE5BtjC,IAAW9wB,IAIb2N,EAAOA,EAAKxE,MAAM,EAAG2nB,IAGvB,OAAOnjB,EA5GEwmD,CAAWxmD,EAAMrP,EAAOu1D,GAsJnC,SAASS,WAAY3mD,EAAMnO,GACzB,GAAImJ,OAAO2mB,SAAS9vB,GAAM,CACxB,IAAIyI,EAA4B,EAAtBssD,QAAQ/0D,EAAIQ,QAGtB,OAAoB,KAFpB2N,EAAOimD,aAAajmD,EAAM1F,IAEjBjI,QAITR,EAAIqpB,KAAKlb,EAAM,EAAG,EAAG1F,GAHZ0F,EAOX,GAAInO,EAAK,CACP,GAA4B,oBAAhBwwB,aACRxwB,EAAI0wB,kBAAkBF,aAAgB,WAAYxwB,EACpD,MAA0B,iBAAfA,EAAIQ,QA+8CrB,SAASw0D,MAAO5mD,GACd,OAAOA,GAAQA,EAh9C2B4mD,CAAMh1D,EAAIQ,QACvC4zD,aAAajmD,EAAM,GAErBumD,cAAcvmD,EAAMnO,GAG7B,GAAiB,WAAbA,EAAI6D,MAAqBoc,EAAQjgB,EAAI+N,MACvC,OAAO2mD,cAAcvmD,EAAMnO,EAAI+N,MAInC,MAAM,IAAI3N,UAAU,sFA9Kb00D,CAAW3mD,EAAMrP,GA4B1B,SAASm2D,WAAYtsD,GACnB,GAAoB,iBAATA,EACT,MAAM,IAAIvI,UAAU,oCACf,GAAIuI,EAAO,EAChB,MAAM,IAAIkB,WAAW,wCA4BzB,SAASyqD,YAAanmD,EAAMxF,GAG1B,GAFAssD,WAAWtsD,GACXwF,EAAOimD,aAAajmD,EAAMxF,EAAO,EAAI,EAAoB,EAAhBosD,QAAQpsD,KAC5CQ,OAAOgrD,oBACV,IAAK,IAAIt2D,EAAI,EAAGA,EAAI8K,IAAQ9K,EAC1BsQ,EAAKtQ,GAAK,EAGd,OAAOsQ,EAwCT,SAASumD,cAAevmD,EAAMP,GAC5B,IAAIpN,EAASoN,EAAMpN,OAAS,EAAI,EAA4B,EAAxBu0D,QAAQnnD,EAAMpN,QAClD2N,EAAOimD,aAAajmD,EAAM3N,GAC1B,IAAK,IAAI3C,EAAI,EAAGA,EAAI2C,EAAQ3C,GAAK,EAC/BsQ,EAAKtQ,GAAgB,IAAX+P,EAAM/P,GAElB,OAAOsQ,EA+DT,SAAS4mD,QAASv0D,GAGhB,GAAIA,GAAU0zD,aACZ,MAAM,IAAIrqD,WAAW,0DACaqqD,aAAaprD,SAAS,IAAM,UAEhE,OAAgB,EAATtI,EAsFT,SAASi0D,WAAYj/C,EAAQo/C,GAC3B,GAAIzrD,OAAO2mB,SAASta,GAClB,OAAOA,EAAOhV,OAEhB,GAA2B,oBAAhBgwB,aAA6D,mBAAvBA,YAAYF,SACxDE,YAAYF,OAAO9a,IAAWA,aAAkBgb,aACnD,OAAOhb,EAAOi/C,WAEM,iBAAXj/C,IACTA,EAAS,GAAKA,GAGhB,IAAI/M,EAAM+M,EAAOhV,OACjB,GAAY,IAARiI,EAAW,OAAO,EAItB,IADA,IAAIysD,GAAc,IAEhB,OAAQN,GACN,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAOnsD,EACT,IAAK,OACL,IAAK,QACL,UAAKrF,EACH,OAAO+xD,YAAY3/C,GAAQhV,OAC7B,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAa,EAANiI,EACT,IAAK,MACH,OAAOA,IAAQ,EACjB,IAAK,SACH,OAAO2sD,cAAc5/C,GAAQhV,OAC/B,QACE,GAAI00D,EAAa,OAAOC,YAAY3/C,GAAQhV,OAC5Co0D,GAAY,GAAKA,GAAU5tC,cAC3BkuC,GAAc,GAMtB,SAASG,aAAcT,EAAUhwB,EAAO0wB,GACtC,IAAIJ,GAAc,EAclB,SALc9xD,IAAVwhC,GAAuBA,EAAQ,KACjCA,EAAQ,GAINA,EAAQ7hC,KAAKvC,OACf,MAAO,GAOT,SAJY4C,IAARkyD,GAAqBA,EAAMvyD,KAAKvC,UAClC80D,EAAMvyD,KAAKvC,QAGT80D,GAAO,EACT,MAAO,GAOT,IAHAA,KAAS,KACT1wB,KAAW,GAGT,MAAO,GAKT,IAFKgwB,IAAUA,EAAW,UAGxB,OAAQA,GACN,IAAK,MACH,OAAOW,SAASxyD,KAAM6hC,EAAO0wB,GAE/B,IAAK,OACL,IAAK,QACH,OAAOE,UAAUzyD,KAAM6hC,EAAO0wB,GAEhC,IAAK,QACH,OAAOG,WAAW1yD,KAAM6hC,EAAO0wB,GAEjC,IAAK,SACL,IAAK,SACH,OAAOI,YAAY3yD,KAAM6hC,EAAO0wB,GAElC,IAAK,SACH,OAAOK,YAAY5yD,KAAM6hC,EAAO0wB,GAElC,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOM,aAAa7yD,KAAM6hC,EAAO0wB,GAEnC,QACE,GAAIJ,EAAa,MAAM,IAAI90D,UAAU,qBAAuBw0D,GAC5DA,GAAYA,EAAW,IAAI5tC,cAC3BkuC,GAAc,GAStB,SAASW,KAAM7wD,EAAG1F,EAAGrB,GACnB,IAAIJ,EAAImH,EAAE1F,GACV0F,EAAE1F,GAAK0F,EAAE/G,GACT+G,EAAE/G,GAAKJ,EAmIT,SAASi4D,qBAAsBplC,EAAQtiB,EAAKomD,EAAYI,EAAU31C,GAEhE,GAAsB,IAAlByR,EAAOlwB,OAAc,OAAQ,EAmBjC,GAhB0B,iBAAfg0D,GACTI,EAAWJ,EACXA,EAAa,GACJA,EAAa,WACtBA,EAAa,WACJA,GAAc,aACvBA,GAAc,YAEhBA,GAAcA,EACVjmD,MAAMimD,KAERA,EAAav1C,EAAM,EAAKyR,EAAOlwB,OAAS,GAItCg0D,EAAa,IAAGA,EAAa9jC,EAAOlwB,OAASg0D,GAC7CA,GAAc9jC,EAAOlwB,OAAQ,CAC/B,GAAIye,EAAK,OAAQ,EACZu1C,EAAa9jC,EAAOlwB,OAAS,OAC7B,GAAIg0D,EAAa,EAAG,CACzB,IAAIv1C,EACC,OAAQ,EADJu1C,EAAa,EAUxB,GALmB,iBAARpmD,IACTA,EAAMjF,OAAOjB,KAAKkG,EAAKwmD,IAIrBzrD,OAAO2mB,SAAS1hB,GAElB,OAAmB,IAAfA,EAAI5N,QACE,EAEHiX,aAAaiZ,EAAQtiB,EAAKomD,EAAYI,EAAU31C,GAClD,GAAmB,iBAAR7Q,EAEhB,OADAA,GAAY,IACRjF,OAAOgrD,qBACiC,mBAAjC7hC,WAAW3yB,UAAUuc,QAC1B+C,EACKqT,WAAW3yB,UAAUuc,QAAQle,KAAK0yB,EAAQtiB,EAAKomD,GAE/CliC,WAAW3yB,UAAUisC,YAAY5tC,KAAK0yB,EAAQtiB,EAAKomD,GAGvD/8C,aAAaiZ,EAAQ,CAAEtiB,GAAOomD,EAAYI,EAAU31C,GAG7D,MAAM,IAAI7e,UAAU,wCAGtB,SAASqX,aAAcrQ,EAAKgH,EAAKomD,EAAYI,EAAU31C,GACrD,IA0BIphB,EA1BAk4D,EAAY,EACZC,EAAY5uD,EAAI5G,OAChBy1D,EAAY7nD,EAAI5N,OAEpB,QAAiB4C,IAAbwxD,IAEe,UADjBA,EAAWhmD,OAAOgmD,GAAU5tC,gBACY,UAAb4tC,GACV,YAAbA,GAAuC,aAAbA,GAAyB,CACrD,GAAIxtD,EAAI5G,OAAS,GAAK4N,EAAI5N,OAAS,EACjC,OAAQ,EAEVu1D,EAAY,EACZC,GAAa,EACbC,GAAa,EACbzB,GAAc,EAIlB,SAAS0B,KAAM1tD,EAAK3K,GAClB,OAAkB,IAAdk4D,EACKvtD,EAAI3K,GAEJ2K,EAAI2tD,aAAat4D,EAAIk4D,GAKhC,GAAI92C,EAAK,CACP,IAAIm3C,GAAc,EAClB,IAAKv4D,EAAI22D,EAAY32D,EAAIm4D,EAAWn4D,IAClC,GAAIq4D,KAAK9uD,EAAKvJ,KAAOq4D,KAAK9nD,GAAqB,IAAhBgoD,EAAoB,EAAIv4D,EAAIu4D,IAEzD,IADoB,IAAhBA,IAAmBA,EAAav4D,GAChCA,EAAIu4D,EAAa,IAAMH,EAAW,OAAOG,EAAaL,OAEtC,IAAhBK,IAAmBv4D,GAAKA,EAAIu4D,GAChCA,GAAc,OAKlB,IADI5B,EAAayB,EAAYD,IAAWxB,EAAawB,EAAYC,GAC5Dp4D,EAAI22D,EAAY32D,GAAK,EAAGA,IAAK,CAEhC,IADA,IAAI8pC,GAAQ,EACHj+B,EAAI,EAAGA,EAAIusD,EAAWvsD,IAC7B,GAAIwsD,KAAK9uD,EAAKvJ,EAAI6L,KAAOwsD,KAAK9nD,EAAK1E,GAAI,CACrCi+B,GAAQ,EACR,MAGJ,GAAIA,EAAO,OAAO9pC,EAItB,OAAQ,EAeV,SAASw4D,SAAU7tD,EAAKgN,EAAQgxB,EAAQhmC,GACtCgmC,EAASvQ,OAAOuQ,IAAW,EAC3B,IAAI8vB,EAAY9tD,EAAIhI,OAASgmC,EACxBhmC,GAGHA,EAASy1B,OAAOz1B,IACH81D,IACX91D,EAAS81D,GAJX91D,EAAS81D,EASX,IAAIC,EAAS/gD,EAAOhV,OACpB,GAAI+1D,EAAS,GAAM,EAAG,MAAM,IAAIn2D,UAAU,sBAEtCI,EAAS+1D,EAAS,IACpB/1D,EAAS+1D,EAAS,GAEpB,IAAK,IAAI14D,EAAI,EAAGA,EAAI2C,IAAU3C,EAAG,CAC/B,IAAI24D,EAASjvD,SAASiO,EAAOyZ,OAAW,EAAJpxB,EAAO,GAAI,IAC/C,GAAI0Q,MAAMioD,GAAS,OAAO34D,EAC1B2K,EAAIg+B,EAAS3oC,GAAK24D,EAEpB,OAAO34D,EAGT,SAAS44D,UAAWjuD,EAAKgN,EAAQgxB,EAAQhmC,GACvC,OAAOk2D,WAAWvB,YAAY3/C,EAAQhN,EAAIhI,OAASgmC,GAASh+B,EAAKg+B,EAAQhmC,GAG3E,SAASm2D,WAAYnuD,EAAKgN,EAAQgxB,EAAQhmC,GACxC,OAAOk2D,WAq6BT,SAASE,aAAcpyC,GAErB,IADA,IAAIqyC,EAAY,GACPh5D,EAAI,EAAGA,EAAI2mB,EAAIhkB,SAAU3C,EAEhCg5D,EAAU/sD,KAAyB,IAApB0a,EAAIV,WAAWjmB,IAEhC,OAAOg5D,EA36BWD,CAAaphD,GAAShN,EAAKg+B,EAAQhmC,GAGvD,SAASs2D,YAAatuD,EAAKgN,EAAQgxB,EAAQhmC,GACzC,OAAOm2D,WAAWnuD,EAAKgN,EAAQgxB,EAAQhmC,GAGzC,SAASu2D,YAAavuD,EAAKgN,EAAQgxB,EAAQhmC,GACzC,OAAOk2D,WAAWtB,cAAc5/C,GAAShN,EAAKg+B,EAAQhmC,GAGxD,SAASw2D,UAAWxuD,EAAKgN,EAAQgxB,EAAQhmC,GACvC,OAAOk2D,WAk6BT,SAASO,eAAgBzyC,EAAK0yC,GAG5B,IAFA,IAAIh5D,EAAGi5D,EAAIC,EACPP,EAAY,GACPh5D,EAAI,EAAGA,EAAI2mB,EAAIhkB,WACjB02D,GAAS,GAAK,KADar5D,EAGhCK,EAAIsmB,EAAIV,WAAWjmB,GACnBs5D,EAAKj5D,GAAK,EACVk5D,EAAKl5D,EAAI,IACT24D,EAAU/sD,KAAKstD,GACfP,EAAU/sD,KAAKqtD,GAGjB,OAAON,EA/6BWI,CAAezhD,EAAQhN,EAAIhI,OAASgmC,GAASh+B,EAAKg+B,EAAQhmC,GAkF9E,SAASm1D,YAAantD,EAAKo8B,EAAO0wB,GAChC,OAAc,IAAV1wB,GAAe0wB,IAAQ9sD,EAAIhI,OACtBwzD,EAAOqD,cAAc7uD,GAErBwrD,EAAOqD,cAAc7uD,EAAImB,MAAMi7B,EAAO0wB,IAIjD,SAASE,UAAWhtD,EAAKo8B,EAAO0wB,GAC9BA,EAAMjwD,KAAKwS,IAAIrP,EAAIhI,OAAQ80D,GAI3B,IAHA,IAAI1sB,EAAM,GAEN/qC,EAAI+mC,EACD/mC,EAAIy3D,GAAK,CACd,IAQMgC,EAAYC,EAAWC,EAAYC,EARrCC,EAAYlvD,EAAI3K,GAChB85D,EAAY,KACZC,EAAoBF,EAAY,IAAQ,EACvCA,EAAY,IAAQ,EACpBA,EAAY,IAAQ,EACrB,EAEJ,GAAI75D,EAAI+5D,GAAoBtC,EAG1B,OAAQsC,GACN,KAAK,EACCF,EAAY,MACdC,EAAYD,GAEd,MACF,KAAK,EAEyB,MAAV,KADlBJ,EAAa9uD,EAAI3K,EAAI,OAEnB45D,GAA6B,GAAZC,IAAqB,EAAoB,GAAbJ,GACzB,MAClBK,EAAYF,GAGhB,MACF,KAAK,EACHH,EAAa9uD,EAAI3K,EAAI,GACrB05D,EAAY/uD,EAAI3K,EAAI,GACQ,MAAV,IAAby5D,IAAsD,MAAV,IAAZC,KACnCE,GAA6B,GAAZC,IAAoB,IAAoB,GAAbJ,IAAsB,EAAmB,GAAZC,GACrD,OAAUE,EAAgB,OAAUA,EAAgB,SACtEE,EAAYF,GAGhB,MACF,KAAK,EACHH,EAAa9uD,EAAI3K,EAAI,GACrB05D,EAAY/uD,EAAI3K,EAAI,GACpB25D,EAAahvD,EAAI3K,EAAI,GACO,MAAV,IAAby5D,IAAsD,MAAV,IAAZC,IAAsD,MAAV,IAAbC,KAClEC,GAA6B,GAAZC,IAAoB,IAAqB,GAAbJ,IAAsB,IAAmB,GAAZC,IAAqB,EAAoB,GAAbC,GAClF,OAAUC,EAAgB,UAC5CE,EAAYF,GAMJ,OAAdE,GAGFA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACb/uB,EAAI9+B,KAAK6tD,IAAc,GAAK,KAAQ,OACpCA,EAAY,MAAqB,KAAZA,GAGvB/uB,EAAI9+B,KAAK6tD,GACT95D,GAAK+5D,EAGP,OAQF,SAASC,sBAAuBC,GAC9B,IAAIrvD,EAAMqvD,EAAWt3D,OACrB,GAAIiI,GAJqB,KAKvB,OAAOmG,OAAOmpD,aAAa70D,MAAM0L,OAAQkpD,GAI3C,IAAIlvB,EAAM,GACN/qC,EAAI,EACR,KAAOA,EAAI4K,GACTmgC,GAAOh6B,OAAOmpD,aAAa70D,MACzB0L,OACAkpD,EAAWnuD,MAAM9L,EAAGA,GAdC,OAiBzB,OAAO+qC,EAvBAivB,CAAsBjvB,GA98B/BvrC,EAAQ8L,OAASA,OACjB9L,EAAQ26D,WAoTR,SAASA,WAAYx3D,IACdA,GAAUA,IACbA,EAAS,GAEX,OAAO2I,OAAOC,OAAO5I,IAvTvBnD,EAAQ46D,kBAAoB,GA0B5B9uD,OAAOgrD,yBAAqD/wD,IAA/BI,EAAO2wD,oBAChC3wD,EAAO2wD,oBAQX,SAAS+D,oBACP,IACE,IAAI9wD,EAAM,IAAIkrB,WAAW,GAEzB,OADAlrB,EAAIlG,UAAY,CAACA,UAAWoxB,WAAW3yB,UAAWywB,IAAK,WAAc,OAAO,KACvD,KAAdhpB,EAAIgpB,OACiB,mBAAjBhpB,EAAI+wD,UACuB,IAAlC/wD,EAAI+wD,SAAS,EAAG,GAAG1D,WACvB,MAAO3uD,GACP,OAAO,GAfPoyD,GAKJ76D,EAAQ62D,WAAaA,aAkErB/qD,OAAOivD,SAAW,KAGlBjvD,OAAOkvD,SAAW,SAAUjxD,GAE1B,OADAA,EAAIlG,UAAYiI,OAAOxJ,UAChByH,GA2BT+B,OAAOjB,KAAO,SAAUpJ,EAAOu1D,EAAkB7zD,GAC/C,OAAO0H,KAAK,KAAMpJ,EAAOu1D,EAAkB7zD,IAGzC2I,OAAOgrD,sBACThrD,OAAOxJ,UAAUuB,UAAYoxB,WAAW3yB,UACxCwJ,OAAOjI,UAAYoxB,WACG,oBAAX1zB,QAA0BA,OAAO05D,SACxCnvD,OAAOvK,OAAO05D,WAAanvD,QAE7B5K,OAAOC,eAAe2K,OAAQvK,OAAO05D,QAAS,CAC5Cx5D,MAAO,KACP4B,cAAc,KAiCpByI,OAAOC,MAAQ,SAAUT,EAAM4vD,EAAM3D,GACnC,OArBF,SAASxrD,MAAO+E,EAAMxF,EAAM4vD,EAAM3D,GAEhC,OADAK,WAAWtsD,GACPA,GAAQ,EACHyrD,aAAajmD,EAAMxF,QAEfvF,IAATm1D,EAIyB,iBAAb3D,EACVR,aAAajmD,EAAMxF,GAAM4vD,KAAKA,EAAM3D,GACpCR,aAAajmD,EAAMxF,GAAM4vD,KAAKA,GAE7BnE,aAAajmD,EAAMxF,GAQnBS,CAAM,KAAMT,EAAM4vD,EAAM3D,IAiBjCzrD,OAAOmrD,YAAc,SAAU3rD,GAC7B,OAAO2rD,YAAY,KAAM3rD,IAK3BQ,OAAOqvD,gBAAkB,SAAU7vD,GACjC,OAAO2rD,YAAY,KAAM3rD,IAiH3BQ,OAAO2mB,SAAW,SAASA,SAAU9qB,GACnC,QAAe,MAALA,IAAaA,EAAE+qB,YAG3B5mB,OAAO4a,QAAU,SAASA,QAAShf,EAAGC,GACpC,IAAKmE,OAAO2mB,SAAS/qB,KAAOoE,OAAO2mB,SAAS9qB,GAC1C,MAAM,IAAI5E,UAAU,6BAGtB,GAAI2E,IAAMC,EAAG,OAAO,EAKpB,IAHA,IAAIgf,EAAIjf,EAAEvE,OACNyjB,EAAIjf,EAAExE,OAED3C,EAAI,EAAG4K,EAAMpD,KAAKwS,IAAImM,EAAGC,GAAIpmB,EAAI4K,IAAO5K,EAC/C,GAAIkH,EAAElH,KAAOmH,EAAEnH,GAAI,CACjBmmB,EAAIjf,EAAElH,GACNomB,EAAIjf,EAAEnH,GACN,MAIJ,OAAImmB,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,GAGT7a,OAAO0rD,WAAa,SAASA,WAAYD,GACvC,OAAQhmD,OAAOgmD,GAAU5tC,eACvB,IAAK,MACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAO,EACT,QACE,OAAO,IAIb7d,OAAOf,OAAS,SAASA,OAAQuvB,EAAMn3B,GACrC,IAAKyf,EAAQ0X,GACX,MAAM,IAAIv3B,UAAU,+CAGtB,GAAoB,IAAhBu3B,EAAKn3B,OACP,OAAO2I,OAAOC,MAAM,GAGtB,IAAIvL,EACJ,QAAeuF,IAAX5C,EAEF,IADAA,EAAS,EACJ3C,EAAI,EAAGA,EAAI85B,EAAKn3B,SAAU3C,EAC7B2C,GAAUm3B,EAAK95B,GAAG2C,OAItB,IAAIkwB,EAASvnB,OAAOmrD,YAAY9zD,GAC5Bk7B,EAAM,EACV,IAAK79B,EAAI,EAAGA,EAAI85B,EAAKn3B,SAAU3C,EAAG,CAChC,IAAI2K,EAAMmvB,EAAK95B,GACf,IAAKsL,OAAO2mB,SAAStnB,GACnB,MAAM,IAAIpI,UAAU,+CAEtBoI,EAAI6gB,KAAKqH,EAAQgL,GACjBA,GAAOlzB,EAAIhI,OAEb,OAAOkwB,GA8CTvnB,OAAOsrD,WAAaA,WA0EpBtrD,OAAOxJ,UAAUowB,WAAY,EAQ7B5mB,OAAOxJ,UAAU84D,OAAS,SAASA,SACjC,IAAIhwD,EAAM1F,KAAKvC,OACf,GAAIiI,EAAM,GAAM,EACd,MAAM,IAAIoB,WAAW,6CAEvB,IAAK,IAAIhM,EAAI,EAAGA,EAAI4K,EAAK5K,GAAK,EAC5Bg4D,KAAK9yD,KAAMlF,EAAGA,EAAI,GAEpB,OAAOkF,MAGToG,OAAOxJ,UAAU+4D,OAAS,SAASA,SACjC,IAAIjwD,EAAM1F,KAAKvC,OACf,GAAIiI,EAAM,GAAM,EACd,MAAM,IAAIoB,WAAW,6CAEvB,IAAK,IAAIhM,EAAI,EAAGA,EAAI4K,EAAK5K,GAAK,EAC5Bg4D,KAAK9yD,KAAMlF,EAAGA,EAAI,GAClBg4D,KAAK9yD,KAAMlF,EAAI,EAAGA,EAAI,GAExB,OAAOkF,MAGToG,OAAOxJ,UAAUg5D,OAAS,SAASA,SACjC,IAAIlwD,EAAM1F,KAAKvC,OACf,GAAIiI,EAAM,GAAM,EACd,MAAM,IAAIoB,WAAW,6CAEvB,IAAK,IAAIhM,EAAI,EAAGA,EAAI4K,EAAK5K,GAAK,EAC5Bg4D,KAAK9yD,KAAMlF,EAAGA,EAAI,GAClBg4D,KAAK9yD,KAAMlF,EAAI,EAAGA,EAAI,GACtBg4D,KAAK9yD,KAAMlF,EAAI,EAAGA,EAAI,GACtBg4D,KAAK9yD,KAAMlF,EAAI,EAAGA,EAAI,GAExB,OAAOkF,MAGToG,OAAOxJ,UAAUmJ,SAAW,SAASA,WACnC,IAAItI,EAAuB,EAAduC,KAAKvC,OAClB,OAAe,IAAXA,EAAqB,GACA,IAArByC,UAAUzC,OAAqBg1D,UAAUzyD,KAAM,EAAGvC,GAC/C60D,aAAanyD,MAAMH,KAAME,YAGlCkG,OAAOxJ,UAAU6gC,OAAS,SAASA,OAAQx7B,GACzC,IAAKmE,OAAO2mB,SAAS9qB,GAAI,MAAM,IAAI5E,UAAU,6BAC7C,OAAI2C,OAASiC,GACsB,IAA5BmE,OAAO4a,QAAQhhB,KAAMiC,IAG9BmE,OAAOxJ,UAAUuxB,QAAU,SAASA,UAClC,IAAI1M,EAAM,GACNH,EAAMhnB,EAAQ46D,kBAKlB,OAJIl1D,KAAKvC,OAAS,IAChBgkB,EAAMzhB,KAAK+F,SAAS,MAAO,EAAGub,GAAK2M,MAAM,SAASjnB,KAAK,KACnDhH,KAAKvC,OAAS6jB,IAAKG,GAAO,UAEzB,WAAaA,EAAM,KAG5Brb,OAAOxJ,UAAUokB,QAAU,SAASA,QAASzjB,EAAQskC,EAAO0wB,EAAKsD,EAAWC,GAC1E,IAAK1vD,OAAO2mB,SAASxvB,GACnB,MAAM,IAAIF,UAAU,6BAgBtB,QAbcgD,IAAVwhC,IACFA,EAAQ,QAEExhC,IAARkyD,IACFA,EAAMh1D,EAASA,EAAOE,OAAS,QAEf4C,IAAdw1D,IACFA,EAAY,QAEEx1D,IAAZy1D,IACFA,EAAU91D,KAAKvC,QAGbokC,EAAQ,GAAK0wB,EAAMh1D,EAAOE,QAAUo4D,EAAY,GAAKC,EAAU91D,KAAKvC,OACtE,MAAM,IAAIqJ,WAAW,sBAGvB,GAAI+uD,GAAaC,GAAWj0B,GAAS0wB,EACnC,OAAO,EAET,GAAIsD,GAAaC,EACf,OAAQ,EAEV,GAAIj0B,GAAS0wB,EACX,OAAO,EAQT,GAAIvyD,OAASzC,EAAQ,OAAO,EAS5B,IAPA,IAAI0jB,GAJJ60C,KAAa,IADbD,KAAe,GAMX30C,GAPJqxC,KAAS,IADT1wB,KAAW,GASPn8B,EAAMpD,KAAKwS,IAAImM,EAAGC,GAElB60C,EAAW/1D,KAAK4G,MAAMivD,EAAWC,GACjCE,EAAaz4D,EAAOqJ,MAAMi7B,EAAO0wB,GAE5Bz3D,EAAI,EAAGA,EAAI4K,IAAO5K,EACzB,GAAIi7D,EAASj7D,KAAOk7D,EAAWl7D,GAAI,CACjCmmB,EAAI80C,EAASj7D,GACbomB,EAAI80C,EAAWl7D,GACf,MAIJ,OAAImmB,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,GA6HT7a,OAAOxJ,UAAU2hB,SAAW,SAASA,SAAUlT,EAAKomD,EAAYI,GAC9D,OAAoD,IAA7C7xD,KAAKmZ,QAAQ9N,EAAKomD,EAAYI,IAGvCzrD,OAAOxJ,UAAUuc,QAAU,SAASA,QAAS9N,EAAKomD,EAAYI,GAC5D,OAAOkB,qBAAqB/yD,KAAMqL,EAAKomD,EAAYI,GAAU,IAG/DzrD,OAAOxJ,UAAUisC,YAAc,SAASA,YAAax9B,EAAKomD,EAAYI,GACpE,OAAOkB,qBAAqB/yD,KAAMqL,EAAKomD,EAAYI,GAAU,IAkD/DzrD,OAAOxJ,UAAUoQ,MAAQ,SAASA,MAAOyF,EAAQgxB,EAAQhmC,EAAQo0D,GAE/D,QAAexxD,IAAXojC,EACFouB,EAAW,OACXp0D,EAASuC,KAAKvC,OACdgmC,EAAS,OAEJ,QAAepjC,IAAX5C,GAA0C,iBAAXgmC,EACxCouB,EAAWpuB,EACXhmC,EAASuC,KAAKvC,OACdgmC,EAAS,MAEJ,KAAI3Z,SAAS2Z,GAWlB,MAAM,IAAIv9B,MACR,2EAXFu9B,GAAkB,EACd3Z,SAASrsB,IACXA,GAAkB,OACD4C,IAAbwxD,IAAwBA,EAAW,UAEvCA,EAAWp0D,EACXA,OAAS4C,GASb,IAAIkzD,EAAYvzD,KAAKvC,OAASgmC,EAG9B,SAFepjC,IAAX5C,GAAwBA,EAAS81D,KAAW91D,EAAS81D,GAEpD9gD,EAAOhV,OAAS,IAAMA,EAAS,GAAKgmC,EAAS,IAAOA,EAASzjC,KAAKvC,OACrE,MAAM,IAAIqJ,WAAW,0CAGlB+qD,IAAUA,EAAW,QAG1B,IADA,IAAIM,GAAc,IAEhB,OAAQN,GACN,IAAK,MACH,OAAOyB,SAAStzD,KAAMyS,EAAQgxB,EAAQhmC,GAExC,IAAK,OACL,IAAK,QACH,OAAOi2D,UAAU1zD,KAAMyS,EAAQgxB,EAAQhmC,GAEzC,IAAK,QACH,OAAOm2D,WAAW5zD,KAAMyS,EAAQgxB,EAAQhmC,GAE1C,IAAK,SACL,IAAK,SACH,OAAOs2D,YAAY/zD,KAAMyS,EAAQgxB,EAAQhmC,GAE3C,IAAK,SAEH,OAAOu2D,YAAYh0D,KAAMyS,EAAQgxB,EAAQhmC,GAE3C,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOw2D,UAAUj0D,KAAMyS,EAAQgxB,EAAQhmC,GAEzC,QACE,GAAI00D,EAAa,MAAM,IAAI90D,UAAU,qBAAuBw0D,GAC5DA,GAAY,GAAKA,GAAU5tC,cAC3BkuC,GAAc,IAKtB/rD,OAAOxJ,UAAUiwB,OAAS,SAASA,SACjC,MAAO,CACL/rB,KAAM,SACNkK,KAAM9F,MAAMtI,UAAUgK,MAAM3L,KAAK+E,KAAKugD,MAAQvgD,KAAM,KA4GxD,SAAS0yD,WAAYjtD,EAAKo8B,EAAO0wB,GAC/B,IAAIz3B,EAAM,GACVy3B,EAAMjwD,KAAKwS,IAAIrP,EAAIhI,OAAQ80D,GAE3B,IAAK,IAAIz3D,EAAI+mC,EAAO/mC,EAAIy3D,IAAOz3D,EAC7BggC,GAAOjvB,OAAOmpD,aAAsB,IAATvvD,EAAI3K,IAEjC,OAAOggC,EAGT,SAAS63B,YAAaltD,EAAKo8B,EAAO0wB,GAChC,IAAIz3B,EAAM,GACVy3B,EAAMjwD,KAAKwS,IAAIrP,EAAIhI,OAAQ80D,GAE3B,IAAK,IAAIz3D,EAAI+mC,EAAO/mC,EAAIy3D,IAAOz3D,EAC7BggC,GAAOjvB,OAAOmpD,aAAavvD,EAAI3K,IAEjC,OAAOggC,EAGT,SAAS03B,SAAU/sD,EAAKo8B,EAAO0wB,GAC7B,IAAI7sD,EAAMD,EAAIhI,SAETokC,GAASA,EAAQ,KAAGA,EAAQ,KAC5B0wB,GAAOA,EAAM,GAAKA,EAAM7sD,KAAK6sD,EAAM7sD,GAGxC,IADA,IAAIzE,EAAM,GACDnG,EAAI+mC,EAAO/mC,EAAIy3D,IAAOz3D,EAC7BmG,GAAOg1D,MAAMxwD,EAAI3K,IAEnB,OAAOmG,EAGT,SAAS4xD,aAAcptD,EAAKo8B,EAAO0wB,GAGjC,IAFA,IAAI2D,EAAQzwD,EAAImB,MAAMi7B,EAAO0wB,GACzB1sB,EAAM,GACD/qC,EAAI,EAAGA,EAAIo7D,EAAMz4D,OAAQ3C,GAAK,EACrC+qC,GAAOh6B,OAAOmpD,aAAakB,EAAMp7D,GAAoB,IAAfo7D,EAAMp7D,EAAI,IAElD,OAAO+qC,EA0CT,SAASswB,YAAa1yB,EAAQ2yB,EAAK34D,GACjC,GAAKgmC,EAAS,GAAO,GAAKA,EAAS,EAAG,MAAM,IAAI38B,WAAW,sBAC3D,GAAI28B,EAAS2yB,EAAM34D,EAAQ,MAAM,IAAIqJ,WAAW,yCA+JlD,SAASuvD,SAAU5wD,EAAK1J,EAAO0nC,EAAQ2yB,EAAK90C,EAAKxM,GAC/C,IAAK1O,OAAO2mB,SAAStnB,GAAM,MAAM,IAAIpI,UAAU,+CAC/C,GAAItB,EAAQulB,GAAOvlB,EAAQ+Y,EAAK,MAAM,IAAIhO,WAAW,qCACrD,GAAI28B,EAAS2yB,EAAM3wD,EAAIhI,OAAQ,MAAM,IAAIqJ,WAAW,sBAkDtD,SAASwvD,kBAAmB7wD,EAAK1J,EAAO0nC,EAAQ8yB,GAC1Cx6D,EAAQ,IAAGA,EAAQ,MAASA,EAAQ,GACxC,IAAK,IAAIjB,EAAI,EAAG6L,EAAIrE,KAAKwS,IAAIrP,EAAIhI,OAASgmC,EAAQ,GAAI3oC,EAAI6L,IAAK7L,EAC7D2K,EAAIg+B,EAAS3oC,IAAMiB,EAAS,KAAS,GAAKw6D,EAAez7D,EAAI,EAAIA,MAClC,GAA5By7D,EAAez7D,EAAI,EAAIA,GA8B9B,SAAS07D,kBAAmB/wD,EAAK1J,EAAO0nC,EAAQ8yB,GAC1Cx6D,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GAC5C,IAAK,IAAIjB,EAAI,EAAG6L,EAAIrE,KAAKwS,IAAIrP,EAAIhI,OAASgmC,EAAQ,GAAI3oC,EAAI6L,IAAK7L,EAC7D2K,EAAIg+B,EAAS3oC,GAAMiB,IAAuC,GAA5Bw6D,EAAez7D,EAAI,EAAIA,GAAU,IAmJnE,SAAS27D,aAAchxD,EAAK1J,EAAO0nC,EAAQ2yB,EAAK90C,EAAKxM,GACnD,GAAI2uB,EAAS2yB,EAAM3wD,EAAIhI,OAAQ,MAAM,IAAIqJ,WAAW,sBACpD,GAAI28B,EAAS,EAAG,MAAM,IAAI38B,WAAW,sBAGvC,SAAS4vD,WAAYjxD,EAAK1J,EAAO0nC,EAAQ8yB,EAAcI,GAKrD,OAJKA,GACHF,aAAahxD,EAAK1J,EAAO0nC,EAAQ,GAEnCytB,EAAQlkD,MAAMvH,EAAK1J,EAAO0nC,EAAQ8yB,EAAc,GAAI,GAC7C9yB,EAAS,EAWlB,SAASmzB,YAAanxD,EAAK1J,EAAO0nC,EAAQ8yB,EAAcI,GAKtD,OAJKA,GACHF,aAAahxD,EAAK1J,EAAO0nC,EAAQ,GAEnCytB,EAAQlkD,MAAMvH,EAAK1J,EAAO0nC,EAAQ8yB,EAAc,GAAI,GAC7C9yB,EAAS,EA/clBr9B,OAAOxJ,UAAUgK,MAAQ,SAASA,MAAOi7B,EAAO0wB,GAC9C,IAoBIsE,EApBAnxD,EAAM1F,KAAKvC,OAqBf,IApBAokC,IAAUA,GAGE,GACVA,GAASn8B,GACG,IAAGm8B,EAAQ,GACdA,EAAQn8B,IACjBm8B,EAAQn8B,IANV6sD,OAAclyD,IAARkyD,EAAoB7sD,IAAQ6sD,GASxB,GACRA,GAAO7sD,GACG,IAAG6sD,EAAM,GACVA,EAAM7sD,IACf6sD,EAAM7sD,GAGJ6sD,EAAM1wB,IAAO0wB,EAAM1wB,GAGnBz7B,OAAOgrD,qBACTyF,EAAS72D,KAAKo1D,SAASvzB,EAAO0wB,IACvBp0D,UAAYiI,OAAOxJ,cACrB,CACL,IAAIk6D,EAAWvE,EAAM1wB,EACrBg1B,EAAS,IAAIzwD,OAAO0wD,OAAUz2D,GAC9B,IAAK,IAAIvF,EAAI,EAAGA,EAAIg8D,IAAYh8D,EAC9B+7D,EAAO/7D,GAAKkF,KAAKlF,EAAI+mC,GAIzB,OAAOg1B,GAWTzwD,OAAOxJ,UAAUm6D,WAAa,SAASA,WAAYtzB,EAAQiuB,EAAYiF,GACrElzB,GAAkB,EAClBiuB,GAA0B,EACrBiF,GAAUR,YAAY1yB,EAAQiuB,EAAY1xD,KAAKvC,QAKpD,IAHA,IAAI4N,EAAMrL,KAAKyjC,GACXuzB,EAAM,EACNl8D,EAAI,IACCA,EAAI42D,IAAesF,GAAO,MACjC3rD,GAAOrL,KAAKyjC,EAAS3oC,GAAKk8D,EAG5B,OAAO3rD,GAGTjF,OAAOxJ,UAAUq6D,WAAa,SAASA,WAAYxzB,EAAQiuB,EAAYiF,GACrElzB,GAAkB,EAClBiuB,GAA0B,EACrBiF,GACHR,YAAY1yB,EAAQiuB,EAAY1xD,KAAKvC,QAKvC,IAFA,IAAI4N,EAAMrL,KAAKyjC,IAAWiuB,GACtBsF,EAAM,EACHtF,EAAa,IAAMsF,GAAO,MAC/B3rD,GAAOrL,KAAKyjC,IAAWiuB,GAAcsF,EAGvC,OAAO3rD,GAGTjF,OAAOxJ,UAAUs6D,UAAY,SAASA,UAAWzzB,EAAQkzB,GAEvD,OADKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QACpCuC,KAAKyjC,IAGdr9B,OAAOxJ,UAAUu6D,aAAe,SAASA,aAAc1zB,EAAQkzB,GAE7D,OADKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QACpCuC,KAAKyjC,GAAWzjC,KAAKyjC,EAAS,IAAM,GAG7Cr9B,OAAOxJ,UAAUw2D,aAAe,SAASA,aAAc3vB,EAAQkzB,GAE7D,OADKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QACnCuC,KAAKyjC,IAAW,EAAKzjC,KAAKyjC,EAAS,IAG7Cr9B,OAAOxJ,UAAUw6D,aAAe,SAASA,aAAc3zB,EAAQkzB,GAG7D,OAFKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,SAElCuC,KAAKyjC,GACTzjC,KAAKyjC,EAAS,IAAM,EACpBzjC,KAAKyjC,EAAS,IAAM,IACD,SAAnBzjC,KAAKyjC,EAAS,IAGrBr9B,OAAOxJ,UAAUy6D,aAAe,SAASA,aAAc5zB,EAAQkzB,GAG7D,OAFKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QAEpB,SAAfuC,KAAKyjC,IACTzjC,KAAKyjC,EAAS,IAAM,GACrBzjC,KAAKyjC,EAAS,IAAM,EACrBzjC,KAAKyjC,EAAS,KAGlBr9B,OAAOxJ,UAAU06D,UAAY,SAASA,UAAW7zB,EAAQiuB,EAAYiF,GACnElzB,GAAkB,EAClBiuB,GAA0B,EACrBiF,GAAUR,YAAY1yB,EAAQiuB,EAAY1xD,KAAKvC,QAKpD,IAHA,IAAI4N,EAAMrL,KAAKyjC,GACXuzB,EAAM,EACNl8D,EAAI,IACCA,EAAI42D,IAAesF,GAAO,MACjC3rD,GAAOrL,KAAKyjC,EAAS3oC,GAAKk8D,EAM5B,OAFI3rD,IAFJ2rD,GAAO,OAES3rD,GAAO/I,KAAKykB,IAAI,EAAG,EAAI2qC,IAEhCrmD,GAGTjF,OAAOxJ,UAAU26D,UAAY,SAASA,UAAW9zB,EAAQiuB,EAAYiF,GACnElzB,GAAkB,EAClBiuB,GAA0B,EACrBiF,GAAUR,YAAY1yB,EAAQiuB,EAAY1xD,KAAKvC,QAKpD,IAHA,IAAI3C,EAAI42D,EACJsF,EAAM,EACN3rD,EAAMrL,KAAKyjC,IAAW3oC,GACnBA,EAAI,IAAMk8D,GAAO,MACtB3rD,GAAOrL,KAAKyjC,IAAW3oC,GAAKk8D,EAM9B,OAFI3rD,IAFJ2rD,GAAO,OAES3rD,GAAO/I,KAAKykB,IAAI,EAAG,EAAI2qC,IAEhCrmD,GAGTjF,OAAOxJ,UAAU46D,SAAW,SAASA,SAAU/zB,EAAQkzB,GAErD,OADKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QACtB,IAAfuC,KAAKyjC,IAC0B,GAA5B,IAAOzjC,KAAKyjC,GAAU,GADKzjC,KAAKyjC,IAI3Cr9B,OAAOxJ,UAAU66D,YAAc,SAASA,YAAah0B,EAAQkzB,GACtDA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QAC3C,IAAI4N,EAAMrL,KAAKyjC,GAAWzjC,KAAKyjC,EAAS,IAAM,EAC9C,OAAc,MAANp4B,EAAsB,WAANA,EAAmBA,GAG7CjF,OAAOxJ,UAAU86D,YAAc,SAASA,YAAaj0B,EAAQkzB,GACtDA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QAC3C,IAAI4N,EAAMrL,KAAKyjC,EAAS,GAAMzjC,KAAKyjC,IAAW,EAC9C,OAAc,MAANp4B,EAAsB,WAANA,EAAmBA,GAG7CjF,OAAOxJ,UAAU+6D,YAAc,SAASA,YAAal0B,EAAQkzB,GAG3D,OAFKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QAEnCuC,KAAKyjC,GACVzjC,KAAKyjC,EAAS,IAAM,EACpBzjC,KAAKyjC,EAAS,IAAM,GACpBzjC,KAAKyjC,EAAS,IAAM,IAGzBr9B,OAAOxJ,UAAUg7D,YAAc,SAASA,YAAan0B,EAAQkzB,GAG3D,OAFKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QAEnCuC,KAAKyjC,IAAW,GACrBzjC,KAAKyjC,EAAS,IAAM,GACpBzjC,KAAKyjC,EAAS,IAAM,EACpBzjC,KAAKyjC,EAAS,IAGnBr9B,OAAOxJ,UAAUi7D,YAAc,SAASA,YAAap0B,EAAQkzB,GAE3D,OADKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QACpCyzD,EAAQiC,KAAKnzD,KAAMyjC,GAAQ,EAAM,GAAI,IAG9Cr9B,OAAOxJ,UAAUk7D,YAAc,SAASA,YAAar0B,EAAQkzB,GAE3D,OADKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QACpCyzD,EAAQiC,KAAKnzD,KAAMyjC,GAAQ,EAAO,GAAI,IAG/Cr9B,OAAOxJ,UAAUm7D,aAAe,SAASA,aAAct0B,EAAQkzB,GAE7D,OADKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QACpCyzD,EAAQiC,KAAKnzD,KAAMyjC,GAAQ,EAAM,GAAI,IAG9Cr9B,OAAOxJ,UAAUo7D,aAAe,SAASA,aAAcv0B,EAAQkzB,GAE7D,OADKA,GAAUR,YAAY1yB,EAAQ,EAAGzjC,KAAKvC,QACpCyzD,EAAQiC,KAAKnzD,KAAMyjC,GAAQ,EAAO,GAAI,IAS/Cr9B,OAAOxJ,UAAUq7D,YAAc,SAASA,YAAal8D,EAAO0nC,EAAQiuB,EAAYiF,IAC9E56D,GAASA,EACT0nC,GAAkB,EAClBiuB,GAA0B,EACrBiF,IAEHN,SAASr2D,KAAMjE,EAAO0nC,EAAQiuB,EADfpvD,KAAKykB,IAAI,EAAG,EAAI2qC,GAAc,EACO,GAGtD,IAAIsF,EAAM,EACNl8D,EAAI,EAER,IADAkF,KAAKyjC,GAAkB,IAAR1nC,IACNjB,EAAI42D,IAAesF,GAAO,MACjCh3D,KAAKyjC,EAAS3oC,GAAMiB,EAAQi7D,EAAO,IAGrC,OAAOvzB,EAASiuB,GAGlBtrD,OAAOxJ,UAAUs7D,YAAc,SAASA,YAAan8D,EAAO0nC,EAAQiuB,EAAYiF,IAC9E56D,GAASA,EACT0nC,GAAkB,EAClBiuB,GAA0B,EACrBiF,IAEHN,SAASr2D,KAAMjE,EAAO0nC,EAAQiuB,EADfpvD,KAAKykB,IAAI,EAAG,EAAI2qC,GAAc,EACO,GAGtD,IAAI52D,EAAI42D,EAAa,EACjBsF,EAAM,EAEV,IADAh3D,KAAKyjC,EAAS3oC,GAAa,IAARiB,IACVjB,GAAK,IAAMk8D,GAAO,MACzBh3D,KAAKyjC,EAAS3oC,GAAMiB,EAAQi7D,EAAO,IAGrC,OAAOvzB,EAASiuB,GAGlBtrD,OAAOxJ,UAAUu7D,WAAa,SAASA,WAAYp8D,EAAO0nC,EAAQkzB,GAMhE,OALA56D,GAASA,EACT0nC,GAAkB,EACbkzB,GAAUN,SAASr2D,KAAMjE,EAAO0nC,EAAQ,EAAG,IAAM,GACjDr9B,OAAOgrD,sBAAqBr1D,EAAQuG,KAAKiJ,MAAMxP,IACpDiE,KAAKyjC,GAAmB,IAAR1nC,EACT0nC,EAAS,GAWlBr9B,OAAOxJ,UAAUw7D,cAAgB,SAASA,cAAer8D,EAAO0nC,EAAQkzB,GAUtE,OATA56D,GAASA,EACT0nC,GAAkB,EACbkzB,GAAUN,SAASr2D,KAAMjE,EAAO0nC,EAAQ,EAAG,MAAQ,GACpDr9B,OAAOgrD,qBACTpxD,KAAKyjC,GAAmB,IAAR1nC,EAChBiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAE9Bu6D,kBAAkBt2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAUy7D,cAAgB,SAASA,cAAet8D,EAAO0nC,EAAQkzB,GAUtE,OATA56D,GAASA,EACT0nC,GAAkB,EACbkzB,GAAUN,SAASr2D,KAAMjE,EAAO0nC,EAAQ,EAAG,MAAQ,GACpDr9B,OAAOgrD,qBACTpxD,KAAKyjC,GAAW1nC,IAAU,EAC1BiE,KAAKyjC,EAAS,GAAc,IAAR1nC,GAEpBu6D,kBAAkBt2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAUlBr9B,OAAOxJ,UAAU07D,cAAgB,SAASA,cAAev8D,EAAO0nC,EAAQkzB,GAYtE,OAXA56D,GAASA,EACT0nC,GAAkB,EACbkzB,GAAUN,SAASr2D,KAAMjE,EAAO0nC,EAAQ,EAAG,WAAY,GACxDr9B,OAAOgrD,qBACTpxD,KAAKyjC,EAAS,GAAM1nC,IAAU,GAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,EAC9BiE,KAAKyjC,GAAmB,IAAR1nC,GAEhBy6D,kBAAkBx2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAU27D,cAAgB,SAASA,cAAex8D,EAAO0nC,EAAQkzB,GAYtE,OAXA56D,GAASA,EACT0nC,GAAkB,EACbkzB,GAAUN,SAASr2D,KAAMjE,EAAO0nC,EAAQ,EAAG,WAAY,GACxDr9B,OAAOgrD,qBACTpxD,KAAKyjC,GAAW1nC,IAAU,GAC1BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,EAC9BiE,KAAKyjC,EAAS,GAAc,IAAR1nC,GAEpBy6D,kBAAkBx2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAU47D,WAAa,SAASA,WAAYz8D,EAAO0nC,EAAQiuB,EAAYiF,GAG5E,GAFA56D,GAASA,EACT0nC,GAAkB,GACbkzB,EAAU,CACb,IAAIl+B,EAAQn2B,KAAKykB,IAAI,EAAG,EAAI2qC,EAAa,GAEzC2E,SAASr2D,KAAMjE,EAAO0nC,EAAQiuB,EAAYj5B,EAAQ,GAAIA,GAGxD,IAAI39B,EAAI,EACJk8D,EAAM,EACNyB,EAAM,EAEV,IADAz4D,KAAKyjC,GAAkB,IAAR1nC,IACNjB,EAAI42D,IAAesF,GAAO,MAC7Bj7D,EAAQ,GAAa,IAAR08D,GAAsC,IAAzBz4D,KAAKyjC,EAAS3oC,EAAI,KAC9C29D,EAAM,GAERz4D,KAAKyjC,EAAS3oC,IAAOiB,EAAQi7D,GAAQ,GAAKyB,EAAM,IAGlD,OAAOh1B,EAASiuB,GAGlBtrD,OAAOxJ,UAAU87D,WAAa,SAASA,WAAY38D,EAAO0nC,EAAQiuB,EAAYiF,GAG5E,GAFA56D,GAASA,EACT0nC,GAAkB,GACbkzB,EAAU,CACb,IAAIl+B,EAAQn2B,KAAKykB,IAAI,EAAG,EAAI2qC,EAAa,GAEzC2E,SAASr2D,KAAMjE,EAAO0nC,EAAQiuB,EAAYj5B,EAAQ,GAAIA,GAGxD,IAAI39B,EAAI42D,EAAa,EACjBsF,EAAM,EACNyB,EAAM,EAEV,IADAz4D,KAAKyjC,EAAS3oC,GAAa,IAARiB,IACVjB,GAAK,IAAMk8D,GAAO,MACrBj7D,EAAQ,GAAa,IAAR08D,GAAsC,IAAzBz4D,KAAKyjC,EAAS3oC,EAAI,KAC9C29D,EAAM,GAERz4D,KAAKyjC,EAAS3oC,IAAOiB,EAAQi7D,GAAQ,GAAKyB,EAAM,IAGlD,OAAOh1B,EAASiuB,GAGlBtrD,OAAOxJ,UAAU+7D,UAAY,SAASA,UAAW58D,EAAO0nC,EAAQkzB,GAO9D,OANA56D,GAASA,EACT0nC,GAAkB,EACbkzB,GAAUN,SAASr2D,KAAMjE,EAAO0nC,EAAQ,EAAG,KAAO,KAClDr9B,OAAOgrD,sBAAqBr1D,EAAQuG,KAAKiJ,MAAMxP,IAChDA,EAAQ,IAAGA,EAAQ,IAAOA,EAAQ,GACtCiE,KAAKyjC,GAAmB,IAAR1nC,EACT0nC,EAAS,GAGlBr9B,OAAOxJ,UAAUg8D,aAAe,SAASA,aAAc78D,EAAO0nC,EAAQkzB,GAUpE,OATA56D,GAASA,EACT0nC,GAAkB,EACbkzB,GAAUN,SAASr2D,KAAMjE,EAAO0nC,EAAQ,EAAG,OAAS,OACrDr9B,OAAOgrD,qBACTpxD,KAAKyjC,GAAmB,IAAR1nC,EAChBiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAE9Bu6D,kBAAkBt2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAUi8D,aAAe,SAASA,aAAc98D,EAAO0nC,EAAQkzB,GAUpE,OATA56D,GAASA,EACT0nC,GAAkB,EACbkzB,GAAUN,SAASr2D,KAAMjE,EAAO0nC,EAAQ,EAAG,OAAS,OACrDr9B,OAAOgrD,qBACTpxD,KAAKyjC,GAAW1nC,IAAU,EAC1BiE,KAAKyjC,EAAS,GAAc,IAAR1nC,GAEpBu6D,kBAAkBt2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAUk8D,aAAe,SAASA,aAAc/8D,EAAO0nC,EAAQkzB,GAYpE,OAXA56D,GAASA,EACT0nC,GAAkB,EACbkzB,GAAUN,SAASr2D,KAAMjE,EAAO0nC,EAAQ,EAAG,YAAa,YACzDr9B,OAAOgrD,qBACTpxD,KAAKyjC,GAAmB,IAAR1nC,EAChBiE,KAAKyjC,EAAS,GAAM1nC,IAAU,EAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,IAE9By6D,kBAAkBx2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAGlBr9B,OAAOxJ,UAAUm8D,aAAe,SAASA,aAAch9D,EAAO0nC,EAAQkzB,GAapE,OAZA56D,GAASA,EACT0nC,GAAkB,EACbkzB,GAAUN,SAASr2D,KAAMjE,EAAO0nC,EAAQ,EAAG,YAAa,YACzD1nC,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GACxCqK,OAAOgrD,qBACTpxD,KAAKyjC,GAAW1nC,IAAU,GAC1BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,GAC9BiE,KAAKyjC,EAAS,GAAM1nC,IAAU,EAC9BiE,KAAKyjC,EAAS,GAAc,IAAR1nC,GAEpBy6D,kBAAkBx2D,KAAMjE,EAAO0nC,GAAQ,GAElCA,EAAS,GAgBlBr9B,OAAOxJ,UAAUo8D,aAAe,SAASA,aAAcj9D,EAAO0nC,EAAQkzB,GACpE,OAAOD,WAAW12D,KAAMjE,EAAO0nC,GAAQ,EAAMkzB,IAG/CvwD,OAAOxJ,UAAUq8D,aAAe,SAASA,aAAcl9D,EAAO0nC,EAAQkzB,GACpE,OAAOD,WAAW12D,KAAMjE,EAAO0nC,GAAQ,EAAOkzB,IAWhDvwD,OAAOxJ,UAAUs8D,cAAgB,SAASA,cAAen9D,EAAO0nC,EAAQkzB,GACtE,OAAOC,YAAY52D,KAAMjE,EAAO0nC,GAAQ,EAAMkzB,IAGhDvwD,OAAOxJ,UAAUu8D,cAAgB,SAASA,cAAep9D,EAAO0nC,EAAQkzB,GACtE,OAAOC,YAAY52D,KAAMjE,EAAO0nC,GAAQ,EAAOkzB,IAIjDvwD,OAAOxJ,UAAU0pB,KAAO,SAASA,KAAM/oB,EAAQ67D,EAAav3B,EAAO0wB,GAQjE,GAPK1wB,IAAOA,EAAQ,GACf0wB,GAAe,IAARA,IAAWA,EAAMvyD,KAAKvC,QAC9B27D,GAAe77D,EAAOE,SAAQ27D,EAAc77D,EAAOE,QAClD27D,IAAaA,EAAc,GAC5B7G,EAAM,GAAKA,EAAM1wB,IAAO0wB,EAAM1wB,GAG9B0wB,IAAQ1wB,EAAO,OAAO,EAC1B,GAAsB,IAAlBtkC,EAAOE,QAAgC,IAAhBuC,KAAKvC,OAAc,OAAO,EAGrD,GAAI27D,EAAc,EAChB,MAAM,IAAItyD,WAAW,6BAEvB,GAAI+6B,EAAQ,GAAKA,GAAS7hC,KAAKvC,OAAQ,MAAM,IAAIqJ,WAAW,6BAC5D,GAAIyrD,EAAM,EAAG,MAAM,IAAIzrD,WAAW,2BAG9ByrD,EAAMvyD,KAAKvC,SAAQ80D,EAAMvyD,KAAKvC,QAC9BF,EAAOE,OAAS27D,EAAc7G,EAAM1wB,IACtC0wB,EAAMh1D,EAAOE,OAAS27D,EAAcv3B,GAGtC,IACI/mC,EADA4K,EAAM6sD,EAAM1wB,EAGhB,GAAI7hC,OAASzC,GAAUskC,EAAQu3B,GAAeA,EAAc7G,EAE1D,IAAKz3D,EAAI4K,EAAM,EAAG5K,GAAK,IAAKA,EAC1ByC,EAAOzC,EAAIs+D,GAAep5D,KAAKlF,EAAI+mC,QAEhC,GAAIn8B,EAAM,MAASU,OAAOgrD,oBAE/B,IAAKt2D,EAAI,EAAGA,EAAI4K,IAAO5K,EACrByC,EAAOzC,EAAIs+D,GAAep5D,KAAKlF,EAAI+mC,QAGrCtS,WAAW3yB,UAAU0U,IAAIrW,KACvBsC,EACAyC,KAAKo1D,SAASvzB,EAAOA,EAAQn8B,GAC7B0zD,GAIJ,OAAO1zD,GAOTU,OAAOxJ,UAAU44D,KAAO,SAASA,KAAMnqD,EAAKw2B,EAAO0wB,EAAKV,GAEtD,GAAmB,iBAARxmD,EAAkB,CAS3B,GARqB,iBAAVw2B,GACTgwB,EAAWhwB,EACXA,EAAQ,EACR0wB,EAAMvyD,KAAKvC,QACa,iBAAR80D,IAChBV,EAAWU,EACXA,EAAMvyD,KAAKvC,QAEM,IAAf4N,EAAI5N,OAAc,CACpB,IAAI47D,EAAOhuD,EAAI0V,WAAW,GACtBs4C,EAAO,MACThuD,EAAMguD,GAGV,QAAiBh5D,IAAbwxD,GAA8C,iBAAbA,EACnC,MAAM,IAAIx0D,UAAU,6BAEtB,GAAwB,iBAAbw0D,IAA0BzrD,OAAO0rD,WAAWD,GACrD,MAAM,IAAIx0D,UAAU,qBAAuBw0D,OAErB,iBAARxmD,IAChBA,GAAY,KAId,GAAIw2B,EAAQ,GAAK7hC,KAAKvC,OAASokC,GAAS7hC,KAAKvC,OAAS80D,EACpD,MAAM,IAAIzrD,WAAW,sBAGvB,GAAIyrD,GAAO1wB,EACT,OAAO7hC,KAQT,IAAIlF,EACJ,GANA+mC,KAAkB,EAClB0wB,OAAclyD,IAARkyD,EAAoBvyD,KAAKvC,OAAS80D,IAAQ,EAE3ClnD,IAAKA,EAAM,GAGG,iBAARA,EACT,IAAKvQ,EAAI+mC,EAAO/mC,EAAIy3D,IAAOz3D,EACzBkF,KAAKlF,GAAKuQ,MAEP,CACL,IAAI6qD,EAAQ9vD,OAAO2mB,SAAS1hB,GACxBA,EACA+mD,YAAY,IAAIhsD,OAAOiF,EAAKwmD,GAAU9rD,YACtCL,EAAMwwD,EAAMz4D,OAChB,IAAK3C,EAAI,EAAGA,EAAIy3D,EAAM1wB,IAAS/mC,EAC7BkF,KAAKlF,EAAI+mC,GAASq0B,EAAMp7D,EAAI4K,GAIhC,OAAO1F,MAMT,IAAIs5D,EAAoB,qBAmBxB,SAASrD,MAAO15D,GACd,OAAIA,EAAI,GAAW,IAAMA,EAAEwJ,SAAS,IAC7BxJ,EAAEwJ,SAAS,IAGpB,SAASqsD,YAAa3/C,EAAQ0hD,GAE5B,IAAIS,EADJT,EAAQA,GAAS73B,IAMjB,IAJA,IAAI7+B,EAASgV,EAAOhV,OAChB87D,EAAgB,KAChBrD,EAAQ,GAEHp7D,EAAI,EAAGA,EAAI2C,IAAU3C,EAAG,CAI/B,IAHA85D,EAAYniD,EAAOsO,WAAWjmB,IAGd,OAAU85D,EAAY,MAAQ,CAE5C,IAAK2E,EAAe,CAElB,GAAI3E,EAAY,MAAQ,EAEjBT,GAAS,IAAM,GAAG+B,EAAMnvD,KAAK,IAAM,IAAM,KAC9C,SACK,GAAIjM,EAAI,IAAM2C,EAAQ,EAEtB02D,GAAS,IAAM,GAAG+B,EAAMnvD,KAAK,IAAM,IAAM,KAC9C,SAIFwyD,EAAgB3E,EAEhB,SAIF,GAAIA,EAAY,MAAQ,EACjBT,GAAS,IAAM,GAAG+B,EAAMnvD,KAAK,IAAM,IAAM,KAC9CwyD,EAAgB3E,EAChB,SAIFA,EAAkE,OAArD2E,EAAgB,OAAU,GAAK3E,EAAY,YAC/C2E,IAEJpF,GAAS,IAAM,GAAG+B,EAAMnvD,KAAK,IAAM,IAAM,KAMhD,GAHAwyD,EAAgB,KAGZ3E,EAAY,IAAM,CACpB,IAAKT,GAAS,GAAK,EAAG,MACtB+B,EAAMnvD,KAAK6tD,QACN,GAAIA,EAAY,KAAO,CAC5B,IAAKT,GAAS,GAAK,EAAG,MACtB+B,EAAMnvD,KACJ6tD,GAAa,EAAM,IACP,GAAZA,EAAmB,UAEhB,GAAIA,EAAY,MAAS,CAC9B,IAAKT,GAAS,GAAK,EAAG,MACtB+B,EAAMnvD,KACJ6tD,GAAa,GAAM,IACnBA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,SAEhB,MAAIA,EAAY,SASrB,MAAM,IAAI1uD,MAAM,sBARhB,IAAKiuD,GAAS,GAAK,EAAG,MACtB+B,EAAMnvD,KACJ6tD,GAAa,GAAO,IACpBA,GAAa,GAAM,GAAO,IAC1BA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,MAOzB,OAAOsB,EA4BT,SAAS7D,cAAe5wC,GACtB,OAAOwvC,EAAOuI,YAhIhB,SAASC,YAAah4C,GAIpB,IAFAA,EAUF,SAASi4C,WAAYj4C,GACnB,OAAIA,EAAIstB,KAAattB,EAAIstB,OAClBttB,EAAImC,QAAQ,aAAc,IAZ3B81C,CAAWj4C,GAAKmC,QAAQ01C,EAAmB,KAEzC77D,OAAS,EAAG,MAAO,GAE3B,KAAOgkB,EAAIhkB,OAAS,GAAM,GACxBgkB,GAAY,IAEd,OAAOA,EAuHmBg4C,CAAYh4C,IAGxC,SAASkyC,WAAY/mD,EAAK+sD,EAAKl2B,EAAQhmC,GACrC,IAAK,IAAI3C,EAAI,EAAGA,EAAI2C,KACb3C,EAAI2oC,GAAUk2B,EAAIl8D,QAAY3C,GAAK8R,EAAInP,UADhB3C,EAE5B6+D,EAAI7+D,EAAI2oC,GAAU72B,EAAI9R,GAExB,OAAOA,K,kCCrvDTR,EAAQo3D,WAuCR,SAASA,WAAYkI,GACnB,IAAI7wB,EAAO8wB,QAAQD,GACfE,EAAW/wB,EAAK,GAChBgxB,EAAkBhxB,EAAK,GAC3B,OAAuC,GAA9B+wB,EAAWC,GAAuB,EAAKA,GA1ClDz/D,EAAQk/D,YAiDR,SAASA,YAAaI,GACpB,IAAII,EAcAl/D,EAbAiuC,EAAO8wB,QAAQD,GACfE,EAAW/wB,EAAK,GAChBgxB,EAAkBhxB,EAAK,GAEvB1kC,EAAM,IAAI41D,EAVhB,SAASC,YAAaN,EAAKE,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,EAS9BG,CAAYN,EAAKE,EAAUC,IAEzCI,EAAU,EAGVz0D,EAAMq0D,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAKh/D,EAAI,EAAGA,EAAI4K,EAAK5K,GAAK,EACxBk/D,EACGI,EAAUR,EAAI74C,WAAWjmB,KAAO,GAChCs/D,EAAUR,EAAI74C,WAAWjmB,EAAI,KAAO,GACpCs/D,EAAUR,EAAI74C,WAAWjmB,EAAI,KAAO,EACrCs/D,EAAUR,EAAI74C,WAAWjmB,EAAI,IAC/BuJ,EAAI81D,KAAcH,GAAO,GAAM,IAC/B31D,EAAI81D,KAAcH,GAAO,EAAK,IAC9B31D,EAAI81D,KAAmB,IAANH,EAGK,IAApBD,IACFC,EACGI,EAAUR,EAAI74C,WAAWjmB,KAAO,EAChCs/D,EAAUR,EAAI74C,WAAWjmB,EAAI,KAAO,EACvCuJ,EAAI81D,KAAmB,IAANH,GAGK,IAApBD,IACFC,EACGI,EAAUR,EAAI74C,WAAWjmB,KAAO,GAChCs/D,EAAUR,EAAI74C,WAAWjmB,EAAI,KAAO,EACpCs/D,EAAUR,EAAI74C,WAAWjmB,EAAI,KAAO,EACvCuJ,EAAI81D,KAAcH,GAAO,EAAK,IAC9B31D,EAAI81D,KAAmB,IAANH,GAGnB,OAAO31D,GA3FT/J,EAAQg6D,cAkHR,SAASA,cAAe+F,GAQtB,IAPA,IAAIL,EACAt0D,EAAM20D,EAAM58D,OACZ68D,EAAa50D,EAAM,EACnB60D,EAAQ,GAIHz/D,EAAI,EAAGy4B,EAAO7tB,EAAM40D,EAAYx/D,EAAIy4B,EAAMz4B,GAH9B,MAInBy/D,EAAMxzD,KAAKyzD,YACTH,EAAOv/D,EAAIA,EALM,MAKgBy4B,EAAOA,EAAQz4B,EAL/B,QAUF,IAAfw/D,GACFN,EAAMK,EAAM30D,EAAM,GAClB60D,EAAMxzD,KACJ0zD,EAAOT,GAAO,GACdS,EAAQT,GAAO,EAAK,IACpB,OAEsB,IAAfM,IACTN,GAAOK,EAAM30D,EAAM,IAAM,GAAK20D,EAAM30D,EAAM,GAC1C60D,EAAMxzD,KACJ0zD,EAAOT,GAAO,IACdS,EAAQT,GAAO,EAAK,IACpBS,EAAQT,GAAO,EAAK,IACpB,MAIJ,OAAOO,EAAMvzD,KAAK,KA3IpB,IALA,IAAIyzD,EAAS,GACTL,EAAY,GACZH,EAA4B,oBAAf1qC,WAA6BA,WAAarqB,MAEvDm0D,EAAO,mEACFv+D,EAAI,EAAG4K,EAAM2zD,EAAK57D,OAAQ3C,EAAI4K,IAAO5K,EAC5C2/D,EAAO3/D,GAAKu+D,EAAKv+D,GACjBs/D,EAAUf,EAAKt4C,WAAWjmB,IAAMA,EAQlC,SAAS++D,QAASD,GAChB,IAAIl0D,EAAMk0D,EAAIn8D,OAEd,GAAIiI,EAAM,EAAI,EACZ,MAAM,IAAIQ,MAAM,kDAKlB,IAAI4zD,EAAWF,EAAIzgD,QAAQ,KAO3B,OANkB,IAAd2gD,IAAiBA,EAAWp0D,GAMzB,CAACo0D,EAJcA,IAAap0D,EAC/B,EACA,EAAKo0D,EAAW,GAsEtB,SAASU,YAAaH,EAAOx4B,EAAO0wB,GAGlC,IAFA,IAAIyH,EARoBU,EASpB7yB,EAAS,GACJ/sC,EAAI+mC,EAAO/mC,EAAIy3D,EAAKz3D,GAAK,EAChCk/D,GACIK,EAAMv/D,IAAM,GAAM,WAClBu/D,EAAMv/D,EAAI,IAAM,EAAK,QACP,IAAfu/D,EAAMv/D,EAAI,IACb+sC,EAAO9gC,KAdF0zD,GADiBC,EAeMV,IAdT,GAAK,IACxBS,EAAOC,GAAO,GAAK,IACnBD,EAAOC,GAAO,EAAI,IAClBD,EAAa,GAANC,IAaT,OAAO7yB,EAAO7gC,KAAK,IAjGrBozD,EAAU,IAAIr5C,WAAW,IAAM,GAC/Bq5C,EAAU,IAAIr5C,WAAW,IAAM,I,cCnB/BzmB,EAAQ64D,KAAO,SAAUxlC,EAAQ8V,EAAQk3B,EAAMC,EAAMC,GACnD,IAAI93D,EAAG7H,EACH4/D,EAAiB,EAATD,EAAcD,EAAO,EAC7BG,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBE,GAAS,EACTngE,EAAI6/D,EAAQE,EAAS,EAAK,EAC1Bz/D,EAAIu/D,GAAQ,EAAI,EAChB59D,EAAI4wB,EAAO8V,EAAS3oC,GAOxB,IALAA,GAAKM,EAEL2H,EAAIhG,GAAM,IAAOk+D,GAAU,EAC3Bl+D,KAAQk+D,EACRA,GAASH,EACFG,EAAQ,EAAGl4D,EAAS,IAAJA,EAAW4qB,EAAO8V,EAAS3oC,GAAIA,GAAKM,EAAG6/D,GAAS,GAKvE,IAHA//D,EAAI6H,GAAM,IAAOk4D,GAAU,EAC3Bl4D,KAAQk4D,EACRA,GAASL,EACFK,EAAQ,EAAG//D,EAAS,IAAJA,EAAWyyB,EAAO8V,EAAS3oC,GAAIA,GAAKM,EAAG6/D,GAAS,GAEvE,GAAU,IAANl4D,EACFA,EAAI,EAAIi4D,MACH,IAAIj4D,IAAMg4D,EACf,OAAO7/D,EAAIutB,IAAsB6T,KAAdv/B,GAAK,EAAI,GAE5B7B,GAAQoH,KAAKykB,IAAI,EAAG6zC,GACpB73D,GAAQi4D,EAEV,OAAQj+D,GAAK,EAAI,GAAK7B,EAAIoH,KAAKykB,IAAI,EAAGhkB,EAAI63D,IAG5CtgE,EAAQ0S,MAAQ,SAAU2gB,EAAQ5xB,EAAO0nC,EAAQk3B,EAAMC,EAAMC,GAC3D,IAAI93D,EAAG7H,EAAGC,EACN2/D,EAAiB,EAATD,EAAcD,EAAO,EAC7BG,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBG,EAAe,KAATN,EAAct4D,KAAKykB,IAAI,GAAI,IAAMzkB,KAAKykB,IAAI,GAAI,IAAM,EAC1DjsB,EAAI6/D,EAAO,EAAKE,EAAS,EACzBz/D,EAAIu/D,EAAO,GAAK,EAChB59D,EAAIhB,EAAQ,GAAgB,IAAVA,GAAe,EAAIA,EAAQ,EAAK,EAAI,EAmC1D,IAjCAA,EAAQuG,KAAKumB,IAAI9sB,GAEbyP,MAAMzP,IAAUA,IAAUugC,KAC5BphC,EAAIsQ,MAAMzP,GAAS,EAAI,EACvBgH,EAAIg4D,IAEJh4D,EAAIT,KAAKiJ,MAAMjJ,KAAKy9C,IAAIhkD,GAASuG,KAAK64D,KAClCp/D,GAASZ,EAAImH,KAAKykB,IAAI,GAAIhkB,IAAM,IAClCA,IACA5H,GAAK,IAGLY,GADEgH,EAAIi4D,GAAS,EACNE,EAAK//D,EAEL+/D,EAAK54D,KAAKykB,IAAI,EAAG,EAAIi0C,IAEpB7/D,GAAK,IACf4H,IACA5H,GAAK,GAGH4H,EAAIi4D,GAASD,GACf7/D,EAAI,EACJ6H,EAAIg4D,GACKh4D,EAAIi4D,GAAS,GACtB9/D,GAAMa,EAAQZ,EAAK,GAAKmH,KAAKykB,IAAI,EAAG6zC,GACpC73D,GAAQi4D,IAER9/D,EAAIa,EAAQuG,KAAKykB,IAAI,EAAGi0C,EAAQ,GAAK14D,KAAKykB,IAAI,EAAG6zC,GACjD73D,EAAI,IAID63D,GAAQ,EAAGjtC,EAAO8V,EAAS3oC,GAAS,IAAJI,EAAUJ,GAAKM,EAAGF,GAAK,IAAK0/D,GAAQ,GAI3E,IAFA73D,EAAKA,GAAK63D,EAAQ1/D,EAClB4/D,GAAQF,EACDE,EAAO,EAAGntC,EAAO8V,EAAS3oC,GAAS,IAAJiI,EAAUjI,GAAKM,EAAG2H,GAAK,IAAK+3D,GAAQ,GAE1EntC,EAAO8V,EAAS3oC,EAAIM,IAAU,IAAJ2B,I,cClF5B,IAAIgJ,EAAW,GAAGA,SAElBxL,EAAOD,QAAU4K,MAAMgY,SAAW,SAAU7Y,GAC1C,MAA6B,kBAAtB0B,EAAS9K,KAAKoJ,K,gBCHvB,IAAIqT,EAAmB,EAAQ,IAM/Bnd,EAAOD,QAJP,SAAS8gE,mBAAmB/2D,GAC1B,GAAIa,MAAMgY,QAAQ7Y,GAAM,OAAOqT,EAAiBrT,K,cCClD9J,EAAOD,QAJP,SAAS+gE,iBAAiB7kC,GACxB,GAAsB,oBAAX36B,QAA0BA,OAAOmH,YAAYxH,OAAOg7B,GAAO,OAAOtxB,MAAMC,KAAKqxB,K,cCG1Fj8B,EAAOD,QAJP,SAASghE,qBACP,MAAM,IAAIj+D,UAAU,0I,6LCDtB,QACA,YACA,QAEA,QACA,Y,8eAEqBk1C,E,yFACnB,4BAAgC,IAApBl3C,EAAoB,uDAAb,YAAa,uDACxBA,EAAM,CAAC,gBAAiB,U,sEAK3BkgE,EAAcrd,GAAiB,IAAZ9pC,EAAY,uDAAL9T,MACvB69C,GAAS,IAAAr5C,aAAYo5C,EAAK9pC,GAAMsX,QAAQ,OAC9C,OAAO1rB,KAAKw7D,eAAeD,GAAcxe,KAAKoB,K,gCAG3Cod,EAAcrd,GAAiB,IAAZ9pC,EAAY,uDAAL9T,MACvB69C,GAAS,IAAAr5C,aAAYo5C,EAAK9pC,GAAMsX,QAAQ,OAC9C,OAAO1rB,KAAKw7D,eAAeD,GAAcle,KAAKc,K,sCAGxCod,GACN,OAAOv7D,KAAKw7D,eAAeD,GAAcE,Y,wCAGlCF,EAActd,GACrB,OAAI/4C,MAAMgY,QAAQ+gC,GACTj+C,KAAKw7D,eAAeD,GAAc,mBAAmBtd,GACvDj+C,KAAKw7D,eAAeD,GAAc,iBAAiBtd,K,yFAK5Bsd,G,sGACTv7D,KAAKrE,IAAI,SAASijD,cAAc2c,G,cAA/CG,E,yBACC17D,KAAKrE,IAAI,SAASwgD,kBAAkBuf,I,2MAG1BC,G,mHAKP37D,KAAK47D,gBAAgBD,G,mBAH7BE,E,EAAAA,SACA3xD,E,EAAAA,KACSqxD,E,EAAT7pB,QAEGmqB,E,yCAAiB,CAAEA,WAAUvpB,UAAW,O,cACvCwpB,EAAqB,QAAT5xD,EAAiB,OAAS,M,UACjBlK,KAAK+7D,kBAAkBR,EAAcO,G,eAA1DE,E,yBACC,CACLH,WACAvpB,UAAW,IAAI2pB,WAAJ,GACTC,iBAAkBl8D,KAClBu7D,iBAFS,yBAGLrxD,EAHK,WAGWyxD,IAHX,yBAILG,EAJK,WAIgBE,GAJhB,M,uKAWAtqB,GACb,OAAO1xC,KAAKrE,IAAI,iBAAiBwgE,2BAC/BzqB,EACA0qB,a,oEAKF,OAAOp8D,KAAKrE,IAAI,iBAAiBwkD,kBAAkBpO,wB,gFAG/BL,G,6GAC8B9xC,QAAQgQ,IAAI,CAC5D5P,KAAKq8D,wBAAwBC,QAAQ5qB,GACrC1xC,KAAKq8D,wBAAwBE,OAAO7qB,K,wCAF/B8qB,E,KAAkBC,E,KAIrBD,IAAqBE,e,yCAChB,CAAExyD,KAAM,OAAQwnC,QAAS8qB,EAAkBX,UAAU,I,UAC1DY,IAAoBC,e,0CACf,CAAExyD,KAAM,MAAOwnC,QAAS+qB,EAAiBZ,UAAU,I,iCACrD,CAAE3xD,KAAM,KAAMwnC,QAAS,GAAImqB,UAAU,I,gLAG5BN,EAAcrxD,GAC9B,MAAa,QAATA,EAAuBlK,KAAKw7D,eAAeD,GAAcoB,MAC3C,SAATzyD,EAAwBlK,KAAKw7D,eAAeD,GAAcqB,OAC5D,S,kBAlFmCxc,gB,YAuF9C5kD,OAAOg4C,OACLjB,EAAiB31C,UACjB,CAAC,gBAAiB,kBAAkBk6B,QAAO,SAACV,EAAK/6B,GAI/C,OAHA+6B,EAAI/6B,GAAQ,WAAkB,MAC5B,OAAO,EAAA2E,KAAKrE,IAAI,UAASN,GAAlB,oBAEF+6B,IACN,M,qHCrGgB6lC,E,WACnB,sBAAyE,IAA3DC,EAA2D,EAA3DA,iBAAkBX,EAAyC,EAAzCA,aAAcsB,EAA2B,EAA3BA,YAAaC,EAAc,EAAdA,YAAc,6BACvE98D,KAAK+8D,kBAAoBb,EACzBl8D,KAAKg9D,cAAgBzB,EACrBv7D,KAAKi9D,aAAeJ,EACpB78D,KAAKk9D,YAAcJ,E,uFAInB,OAAO98D,KAAKg9D,gB,sDAIZ,OAAOh9D,KAAKi9D,e,oDAIZ,OAAOj9D,KAAKk9D,gB,yBAYhB1hE,OAAOg4C,OACLyoB,EAAUr/D,UATe,CACzB,OACA,OACA,WACA,iBACA,6BAKmBk6B,QAAO,SAACV,EAAK/6B,GAI9B,OAHA+6B,EAAI/6B,GAAQ,WAAkB,6BAAN4E,EAAM,yBAANA,EAAM,gBAC5B,OAAO,EAAAD,KAAK+8D,mBAAkB1hE,GAAvB,SAA6B2E,KAAKg9D,eAAlC,OAAoD/8D,KAEtDm2B,IACN,M,s0DCpCL,QACA,QACA,Y,8eAEqBqc,E,iGACnB,mCAAuC,IAA3Bp3C,EAA2B,uDAApB,mBAAoB,8DAC/BA,EAAM,CAAC,gBAAiB,YAAa,uB,6FAGhCyhE,GACX,OAAO98D,KAAKq8D,wBAAwBc,aAAaL,K,8CAGvCD,GAKV,OAJW,IAAIO,UACbp9D,KAAKq8D,wBACLr8D,KAAKrE,IAAI,uBAED0hE,MAAM,cAAe,CAACR,M,4CAIhC,OAAO78D,KAAKq8D,wBAAwBiB,c,gDAGzB5rB,GACX,OAAO1xC,KAAKrE,IAAI,aAAa4hE,aAAa7rB,K,oEAI1C,OAAO1xC,KAAKrE,IAAI,iBAAiBwkD,kBAAkBpO,0B,yBA1BFqO,gB,iKCJhCgd,E,WACnB,gCAAYI,EAAUC,IAAoB,0CACxCz9D,KAAK09D,UAAYF,EACjBx9D,KAAK29D,OAASF,E,8EAeVl5C,EAAQtkB,GAAM,WACZ29D,GAAU,6BAAC,2HACT,EADS,wBAEG,IAAKF,WAAUn5C,GAAf,gCAA8BtkB,GAA9B,CAAoC,CAAE29D,cAFzC,cAETC,EAFS,OAGf,EAAKC,WAAWD,EAAIE,QAAQC,MAHb,kBAIR,GAJQ,gDAAD,GAOhB,OADAh+D,KAAK49D,QAAUA,EACRA,I,4CAGEI,GAAM,IACPC,EAAkBj+D,KAAK09D,UAAL,UAAyB5gB,OAA3CmhB,cACFC,EAAOl+D,KAAK29D,OAAOhiE,IAAI,QAAQwiE,MAC/BC,EAAQF,EAAKG,MAAMC,UACvBJ,EAAKG,MAAMpI,MAAMgI,EAAcM,YAE3BC,EAAeR,EAAKx3D,QACxB,SAAAzD,GAAC,OAAIA,EAAE85C,OAAO,GAAG54B,gBAAkBm6C,EAAMn6C,iBAErCw6C,EAAYR,EAAcrU,MAC9B4U,EAAa,GAAG3hB,OAChB2hB,EAAa,GAAGxzD,MAElBhL,KAAKu7D,aAAekD,EAAS,Y,+BAnC7B,OAAOz+D,KAAK29D,OAAOe,eAAe1+D,KAAK49D,SAASe,S,oCAIhD,OAAO3+D,KAAK29D,OAAOe,eAAe1+D,KAAK49D,SAASgB,c,6CAIhD,OAAO5+D,KAAK29D,OAAOe,eAAe1+D,KAAK49D,SAASiB,yB,+OCfpD,QACA,QAEA,YACA,Q,mlCAEA,IAIqBlsB,E,mHACnB,6BAAiC,IAArBt3C,EAAqB,uDAAd,aAAc,wDACzBA,EAAM,CAAC,gBAAiB,cAAe,U,iHAG9ByjE,EAAWC,EAASC,EAAWC,G,wGAC5Bj/D,KAAKk/D,mBAAmBC,WACxCL,EACAC,EACAC,EACAC,G,cAJIpB,E,OAMAuB,EAAS56D,SAASq5D,EAAIE,QAAQC,KAAK,GAAGnhB,OAAO,I,kBAC5CuiB,G,qKAGIA,GACX,OAAOp/D,KAAKk/D,mBAAmBG,aAAaD,K,gCAGzCE,EAASC,GACZ,GAAID,EAAQ7hE,SAAW8hE,EAAU9hE,QAA6B,IAAnB6hE,EAAQ7hE,OACjD,MAAM,IAAIyI,MACR,oGAEJ,GAAuB,IAAnBo5D,EAAQ7hE,OAAc,CAExB,OAAOuC,KAAKw/D,wBADC,yBAC6BF,EAAQ,GAAIC,EAAU,IAGhE,OAAOv/D,KAAKw/D,wBADC,6BAC6BF,EAASC,K,wDAItCH,EAAQK,GACvB,IAAM3L,EAAY,IAAIvkC,WAAW,IACjCkwC,EAASh5D,SAAQ,SAACi5D,EAAa5kE,GAC7Bg5D,EAAUA,EAAUr2D,OAAS3C,EAAI,GAAK4kE,EAAc,KAEtD,IAAMC,GAAW,IAAA94D,YAAWitD,GAAW/tD,WACvC,OAAO/F,KAAKw/D,wBAAwBrgB,KAAKigB,EAAQO,K,0DAIjD,OAAO3/D,KAAKrE,IAAI,iBAAiBwkD,kBAAkBnO,a,oEAInD,OAAOhyC,KAAKrE,IAAI,iBAAiBwkD,kBAAkBlO,mB,wEAKvC+sB,G,+GACQh/D,KAAK4/D,yB,OAIzB,IAJMC,E,OACAC,EAAWD,EAAMr5D,QAAO,SAAA1J,GAAC,OAAIA,EAAEkiE,YAAcA,KAC/Ce,EAASzjC,IAEJxhC,EAAI,EAAGA,EAAIglE,EAASriE,OAAQ3C,IAC/BglE,EAAShlE,GAAGskE,OAASW,IACvBA,EAASD,EAAShlE,GAAGskE,OACrBY,EAAaF,EAAShlE,I,yBAGnBklE,G,sLAGMZ,G,uGACOp/D,KAAK4/D,yB,cAAnBC,E,yBACCA,EAAM/6B,MAAK,SAAAhoC,GAAC,OAAI0H,SAAS1H,EAAEsiE,UAAY56D,SAAS46D,O,4RAInDp/D,KAAK6/D,M,yCAAc7/D,KAAK6/D,O,uBACT7/D,KAAKrE,IAAI,eAAeikE,yB,cAA3C5/D,KAAK6/D,M,yBACE7/D,KAAK6/D,O,mKAIZ7/D,KAAK6/D,MAAQ,O,mFAGUnuB,EAAS0tB,G,0GACzBp/D,KAAKrE,IAAI,eAAeskE,mBAC7BvuB,EAAQztB,cACRm7C,I,yNAIiC1tB,EAAS0tB,G,2GAClBp/D,KAAKrE,IAC7B,eACAukE,+BAA+BxuB,EAAQztB,cAAem7C,G,UAFlDe,E,gDAGmB,I,cACnBC,GAAe,IAAA96D,UAAS66D,EAAa,CAAEx6D,OAAQ,WAC/C06D,GAAS,IAAAr7D,aAAY,GAAKo7D,EAAa3iE,OAAQ2iE,G,kBAC9CC,EAAOz5C,UAAUpgB,QAAO,SAAA85D,GAAM,OAAe,IAAXA,GAA2B,MAAXA,M,6NAG9B5uB,G,uGACL1xC,KAAKrE,IAAI,eAAe4kE,uBAC5C7uB,EAAQztB,e,UADJ2M,E,gDAGe,I,gCACdA,EAAQxrB,KAAI,SAAA7J,GACjB,IAAIilE,EAAqB,KACzB,GAAIjlE,EAAE4kE,YAAa,CACjB,IAAMC,GAAe,IAAA96D,UAAS/J,EAAE4kE,YAAa,CAAEx6D,OAAQ,WAEvD66D,GADe,IAAAx7D,aAAY,GAAKo7D,EAAa3iE,OAAQ2iE,GAElDx5C,UACApgB,QAAO,SAAA85D,GAAM,OAAe,IAAXA,GAA2B,MAAXA,KAEtC,MAAO,CACLlB,OAAQ7jE,EAAE6jE,OACVqB,OAAQllE,EAAEokE,SACVa,0B,+MAKmBpB,G,0GAChBp/D,KAAKrE,IAAI,eAAe+kE,mBAAmBtB,I,qMAGjC1tB,G,uGACI1xC,KAAKrE,IAAI,eAAeglE,aAC3CjvB,EAAQztB,cAnIW,Y,cAkIf28C,E,0BAIC,IAAAtgE,KAAIsgE,I,kMAGQxB,G,8GACOp/D,KAAK6gE,SAASzB,G,uBAAhCL,E,EAAAA,QACF+B,EAAUx+D,KAAKiJ,MAAMwzD,EAAU,K,SACf/+D,KAAKrE,IAAI,eAAeolE,cAC5C3B,EACA0B,G,cAFIE,E,0BAIC,IAAA1gE,KAAI0gE,EAAQlqC,QAAO,SAACV,EAAK6qC,GAAN,OAAc7qC,EAAM6qC,EAAIC,aAAY,K,iNAG/B9B,G,8GACLp/D,KAAK6gE,SAASzB,G,uBAAhCL,E,EAAAA,QACF+B,EAAUx+D,KAAKiJ,MAAMwzD,EAAU,K,SACf/+D,KAAKrE,IAAI,eAAewlE,0BAC5C/B,EACA0B,G,cAFIE,E,0BAIC,IAAA1gE,KACL0gE,EAAQlqC,QAAO,SAACV,EAAK6qC,GAAN,OAAc7qC,EAAMqoB,WAAWwiB,EAAIC,cAAa,K,0NAIrC9B,G,wHACFp/D,KAAK6gE,SAASzB,G,uBAAhCL,E,EAAAA,QACF+B,EAAUx+D,KAAKiJ,MAAMwzD,EAAU,K,SACjB/+D,KAAKrE,IAAI,eAAewlE,0BAC1C/B,EACA0B,G,UAFIpjB,E,OAIA0jB,EAAwB1jB,EAAM5mB,QAClC,SAACV,EAAK6qC,GAAN,OAAc,aAAUA,EAAIC,YAAc,GAAGx2C,KAAK0L,MAClD,aAAU,IAGNirC,EAAQ,CACZC,OAAQ,EACRC,OAAQ,KACRH,wBACAxwC,QAAS,IAEL4wC,EAAmB,CACvBC,aAAa,aAAU,GACvBC,UAAU,aAAU,GACpBH,QAAQ,EACRI,YAAY,GAGO,IAAjBjkB,EAAMjgD,O,0CACD4jE,G,WAIT3jB,EAAMj3C,SAAQ,SAAA04C,GACZA,EAAKmhB,OAASnhB,EAAKkhB,OAAO57C,MACrB48C,EAAMzwC,QAAQuuB,EAAKmhB,UACtBe,EAAMzwC,QAAQuuB,EAAKmhB,QAAnB,iBAAkCkB,IAEpCH,EAAMzwC,QAAQuuB,EAAKmhB,QAAQmB,aAAc,aACvCJ,EAAMzwC,QAAQuuB,EAAKmhB,QAAQmB,aAC3B/2C,KAAKy0B,EAAK+hB,YAAc,MAI5B1lE,OAAOgb,QAAQ6qD,EAAMzwC,SAASnqB,SAAQ,YAA+B,yBAA7Bg6D,EAA6B,UAAnBgB,YAChCv7C,GAAGk7C,EAAsBt/C,IAAI,MAAKu/C,EAAME,OAASd,OAI/DY,EAAME,O,wBACRF,EAAMzwC,QAAQywC,EAAME,QAAQA,QAAS,E,kBAC9BF,G,2BAKPA,EAAMC,SAGN,IAAMM,EAAkBpmE,OAAOgb,QAAQ6qD,EAAMzwC,SAASpqB,QACpD,yCAAsCm7D,c,EAGZC,EAAgB9qC,QAAO,SAAC+qC,EAAKZ,GAAQ,IACtDa,GADsD,aAC1CD,EAD0C,MAEtDE,GAFsD,aAE1Cd,EAF0C,MAG/D,OACEc,EAASN,YACN/2C,KAAKq3C,EAASL,UACdz0D,GAAG60D,EAASL,YAAY/2C,KAAKo3C,EAASJ,WAElCT,EACFY,KATFG,G,qBAyCP,GA7BAX,EAAMzwC,QAAQoxC,GAAmBL,YAAa,EAC9CN,EAAMzwC,QAAQoxC,GAAmBN,UAAW,aAAU,GAK/BhkB,EACpBt4C,KAAI,SAAC+5C,EAAMjzC,GAAP,sCAAuBizC,GAAvB,IAA6BjzC,aACjC1F,QAAO,SAAA24C,GAAI,OAAI36C,SAAS26C,EAAKmhB,UAAY97D,SAASw9D,MAClDx7D,QAAO,SAAA24C,GAAI,OAA4C,IAAxCA,EAAKkhB,OAAOlhB,EAAKkhB,OAAO5iE,OAAS,MAGpCgJ,SAAQ,SAAA04C,GACrBzB,EAAMyB,EAAKjzC,OAAOo0D,OAAS5iB,EAAMyB,EAAKjzC,OAAOm0D,OAAO57C,MACpD48C,EAAMzwC,QAAQ8sB,EAAMyB,EAAKjzC,OAAOo0D,QAAQoB,UAAW,aACjDL,EAAMzwC,QAAQ8sB,EAAMyB,EAAKjzC,OAAOo0D,QAAQoB,UACxCh3C,KAAKy0B,EAAK+hB,YAAc,MAI5B1lE,OAAOgb,QAAQ6qD,EAAMzwC,SAASnqB,SAC5B,YAAyC,yBAAvCg6D,EAAuC,YAA7BgB,EAA6B,EAA7BA,YAAaC,EAAgB,EAAhBA,SACnBD,EAAY/2C,KAAKg3C,GAAUx7C,GAAGk7C,EAAsBt/C,IAAI,MAC1Du/C,EAAME,OAASd,MAOlBY,EAAMC,OAnQI,KAmQoBD,EAAME,SACR,IAA3BK,EAAgBnkE,QAA2C,IAA3BmkE,EAAgBnkE,UAC/C4jE,EAAME,OACT,CACA,IACIU,EADA3gD,GAAM,aAAU,GAEpB9lB,OAAOgb,QAAQ6qD,EAAMzwC,SAASnqB,SAC5B,YAAyC,yBAAvCg6D,EAAuC,YAA7BgB,EAA6B,EAA7BA,YAAaC,EAAgB,EAAhBA,SACnBD,EAAY/2C,KAAKg3C,GAAUx7C,GAAG5E,KAChCA,EAAMmgD,EAAY/2C,KAAKg3C,GACvBO,EAAYxB,MAIlBY,EAAME,OAASU,EAIjB,GAA0C,IAAtCzmE,OAAO4M,KAAKi5D,EAAMzwC,SAASnzB,OAG7B,SAAO4jE,GAET,GAA0C,IAAtC7lE,OAAO4M,KAAKi5D,EAAMzwC,SAASnzB,OAE7B,MAAM,IAAIyI,MAAJ,sCAAyCm7D,EAAMzwC,W,WA3EjDywC,EAAME,O,4IAiFdF,EAAMzwC,QAAQywC,EAAME,QAAQA,QAAS,E,kBAC9BF,G,sNAGmBjC,G,8GACGx/D,QAAQgQ,IAAI,CACvC5P,KAAKkiE,eAAe9C,GACpBp/D,KAAKrE,IAAI,SACNwmE,SAAS7hE,OACT8hE,gB,4CAJEC,E,KAAOC,E,uBAMPD,EACJvgD,IAAIwgD,GACJ34C,MAAM,KACNgD,Y,+NAGmCyyC,G,8GACTx/D,QAAQgQ,IAAI,CACvC5P,KAAKuiE,2BAA2BnD,GAChCp/D,KAAKrE,IAAI,SACNwmE,SAAS7hE,OACT8hE,gB,4CAJEC,E,KAAOC,E,uBAMPD,EACJvgD,IAAIwgD,GACJ34C,MAAM,KACNgD,Y,4NAGoByyC,G,kHACGp/D,KAAK6gE,SAASzB,G,uBAAhCL,E,EAAAA,QACF+B,EAAUx+D,KAAKiJ,MAAMwzD,EAAU,K,SACV/+D,KAAKrE,IAAI,eAAeolE,cACjD3B,EACA0B,G,OAGF,IALM0B,E,OAIFlhD,EAAMkhD,EAAa,GACd1nE,EAAI,EAAGA,EAAI0nE,EAAa/kE,OAAQ3C,IACnC0nE,EAAa1nE,GAAGomE,WAAa5/C,EAAI4/C,aACnC5/C,EAAMkhD,EAAa1nE,I,yBAGhBwmB,EAAMA,EAAIq+C,SAAW,G,+IA3Ue3O,kB,+LCV/C,QACA,YACA,Q,ulCAOqByR,E,2FACnB,oBAAkC,MAAtBpnE,EAAsB,uDAAf,cAAe,oCAChC,cAAMA,EAAM,CAAC,UACRqnE,cAAgB,GACrB,EAAKxxB,SAAU,EAHiB,E,8GAMXyxB,EAAWC,G,0GACbC,MAAMF,EAAW,CAClCp+C,OAAQ,OACRu+C,QAAS,CACPC,OAAQ,mBACR,eAAgB,oBAElBC,KAAMptB,KAAKE,UAAU,CACnB8sB,Y,cAPEK,E,gBAUiBA,EAAKC,O,uBAApBl4D,E,EAAAA,MACR,aAAOA,EAAP,mCAAyC23D,I,kBAClC33D,G,2MAGsB23D,EAAWC,G,0FACpCO,E,UAAcR,E,YAAaC,IAC3B5iE,KAAK0iE,cAAcS,G,yCAAkBnjE,KAAK0iE,cAAcS,I,cAC5DnjE,KAAK0iE,cAAcS,GAAYnjE,KAAKojE,iBAAiBT,EAAWC,G,kBACzD5iE,KAAK0iE,cAAcS,I,4KAGjB95D,GACLA,EAAS6nC,UACXlxC,KAAKkxC,SAAU,K,wCAKjB,IAAMD,EAAUjxC,KAAKrE,IAAI,QAAQs1C,QACjCjxC,KAAK2iE,UAAY3iE,KAAKkxC,SAClB,IAAArsC,wBAAuBosC,IACvB,IAAAxsC,iBAAgBwsC,K,gMAiBGjxC,KAAKojE,iBAAiBpjE,KAAK2iE,U,mNAA5CU,E,yBACCA,EAASC,YAAYxT,MAAM1qD,KAAI,SAAAtI,GAGpC,OAFAA,EAAEgiE,UAAY,IAAI/vD,KAAmB,IAAdjS,EAAEgiE,WACzBhiE,EAAEiiE,QAAU,IAAIhwD,KAAiB,IAAZjS,EAAEiiE,SAChBjiE,M,8MAIcsiE,G,gGACjBwD,E,kCAAmCxD,E,0CAKlBp/D,KAAKojE,iBAAiBpjE,KAAK2iE,UAAWC,G,cAAvDS,E,yBACC7+D,SAAS6+D,EAASE,aAAazT,MAAM,K,qMAG3Bpe,EAAS8xB,G,gGACpBZ,E,qEAAsElxB,E,uBAAsB8xB,E,sFAO3ExjE,KAAKojE,iBAAiBpjE,KAAK2iE,UAAWC,G,WAAvDS,E,QACQI,6CAA6C3T,MAAM,G,yCACxD,G,gCACFuT,EAASI,6CAA6C3T,MAAM,GAChE8Q,Q,uMAGoBlvB,EAAS0tB,G,gGAC1BwD,E,4CACuBlxB,E,yBAAwB0tB,E,8EAM9Bp/D,KAAKojE,iBAAiBpjE,KAAK2iE,UAAWC,G,WAAvDS,E,QACQK,YAAY5T,MAAM,G,yCAAW,M,gCACpCuT,EAASK,YAAY5T,MAAM,GAAG6P,U,iNAGVjuB,G,gGACrBkxB,E,gDAC2BlxB,E,wHAQV1xC,KAAKojE,iBAAiBpjE,KAAK2iE,UAAWC,G,WAAvDS,E,QACQM,gBAAgB7T,MAAM,G,yCAAW,M,gCACxCuT,EAASM,gBAAgB7T,O,2NAGGpe,EAAS0tB,G,gGACtCwD,E,wDACmClxB,E,yBAAwB0tB,E,iFAM1Cp/D,KAAKojE,iBAAiBpjE,KAAK2iE,UAAWC,G,WAAvDS,E,QACQO,wBAAwB9T,MAAM,G,yCAAW,M,gCAChDuT,EAASO,wBAAwB9T,MAAM,GAAGqQ,a,qNAG9BqD,G,gGACbZ,E,8CACyBY,E,0CAIRxjE,KAAK6jE,yBAAyB7jE,KAAK2iE,UAAWC,G,cAA/DS,E,yBACCA,EAASS,kBAAkBhU,MAAM,I,+MAGVsP,EAAQoE,G,iGAChCZ,E,uDAAwDxD,E,sBAAoBoE,E,6FAO3DxjE,KAAK6jE,yBAAyB7jE,KAAK2iE,UAAWC,G,cAA/DS,E,yBAECA,EAASU,iCAAiCjU,MAC9CtpD,QAAO,SAAA24C,GAAI,MAAyB,MAArBA,EAAKghB,eACpB/6D,KAAI,SAAA+5C,GACH,IAAMihB,GAAe,IAAA96D,UAAS65C,EAAKghB,YAAa,CAAEx6D,OAAQ,WACpD06D,GAAS,IAAAr7D,aAAY,GAAKo7D,EAAa3iE,OAAQ2iE,GACrD,sCACKjhB,GADL,IAEEkhB,e,iNAKYjB,EAAQoE,G,qGACpBZ,E,iDAAkDxD,E,sBAAoBoE,E,8EAOrDxjE,KAAK6jE,yBAAyB7jE,KAAK2iE,UAAWC,G,cAA/DS,E,OAGNrC,GAFIA,EAAUqC,EAASW,2BAA2BlU,OAEhCtpD,QAAO,SAAAjL,GAAC,OAAmB,IAAfA,EAAEokE,YAC1BsE,EAAcjD,EAAQlqC,QAAO,SAACV,EAAK6qC,GAIvC,OAAO7qC,GAHY5qB,MAAMizC,WAAWwiB,EAAIC,aACpC,EACAziB,WAAWwiB,EAAIC,eAElB,G,kBACIF,EAAQ57D,KAAI,SAAA7J,GACjB,IAAM2lE,EAAa11D,MAAMizC,WAAWljD,EAAE2lE,aAClC,EACAziB,WAAWljD,EAAE2lE,YAGjB,OAFA3lE,EAAE2lE,WAAaA,EACf3lE,EAAE2oE,WAAc,IAAMhD,EAAc+C,EAC7B1oE,M,+SAccyE,KAAKojE,iBAAiBpjE,KAAK2iE,U,8IAA5CU,E,OACAc,EAAQd,EAASe,YAAYtU,M,kBAC5BqU,G,6HA3M2BpT,iB,6BCDtC,IAAIplD,EAAwBnQ,OAAOmQ,sBAC/B9O,EAAiBrB,OAAOoB,UAAUC,eAClCwnE,EAAmB7oE,OAAOoB,UAAU2L,qBAExC,SAASwM,SAAS1J,GACjB,GAAIA,QACH,MAAM,IAAIhO,UAAU,yDAGrB,OAAO7B,OAAO6P,GA+Cf9Q,EAAOD,QA5CP,SAASgqE,kBACR,IACC,IAAK9oE,OAAOg4C,OACX,OAAO,EAMR,IAAI+wB,EAAQ,IAAI14D,OAAO,OAEvB,GADA04D,EAAM,GAAK,KACkC,MAAzC/oE,OAAO2b,oBAAoBotD,GAAO,GACrC,OAAO,EAKR,IADA,IAAIC,EAAQ,GACH1pE,EAAI,EAAGA,EAAI,GAAIA,IACvB0pE,EAAM,IAAM34D,OAAOmpD,aAAal6D,IAAMA,EAKvC,GAAwB,eAHXU,OAAO2b,oBAAoBqtD,GAAOp/D,KAAI,SAAU7I,GAC5D,OAAOioE,EAAMjoE,MAEHyK,KAAK,IACf,OAAO,EAIR,IAAIy9D,EAAQ,GAIZ,MAHA,uBAAuBn+D,MAAM,IAAIG,SAAQ,SAAUi+D,GAClDD,EAAMC,GAAUA,KAGf,yBADElpE,OAAO4M,KAAK5M,OAAOg4C,OAAO,GAAIixB,IAAQz9D,KAAK,IAM9C,MAAO5G,GAER,OAAO,GAIQkkE,GAAoB9oE,OAAOg4C,OAAS,SAAUj2C,EAAQwD,GAKtE,IAJA,IAAIoE,EAEAozC,EADAzL,EAAK/3B,SAASxX,GAGTR,EAAI,EAAGA,EAAImD,UAAUzC,OAAQV,IAAK,CAG1C,IAAK,IAAIV,KAFT8I,EAAO3J,OAAO0E,UAAUnD,IAGnBF,EAAe5B,KAAKkK,EAAM9I,KAC7BywC,EAAGzwC,GAAO8I,EAAK9I,IAIjB,GAAIsP,EAAuB,CAC1B4sC,EAAU5sC,EAAsBxG,GAChC,IAAK,IAAIrK,EAAI,EAAGA,EAAIy9C,EAAQ96C,OAAQ3C,IAC/BupE,EAAiBppE,KAAKkK,EAAMozC,EAAQz9C,MACvCgyC,EAAGyL,EAAQz9C,IAAMqK,EAAKozC,EAAQz9C,MAMlC,OAAOgyC,I,iBCxFR,YAqBA,IAAI63B,EAA4BnpE,OAAOmpE,2BACrC,SAASA,0BAA0B1nE,GAGjC,IAFA,IAAImL,EAAO5M,OAAO4M,KAAKnL,GACnB2nE,EAAc,GACT9pE,EAAI,EAAGA,EAAIsN,EAAK3K,OAAQ3C,IAC/B8pE,EAAYx8D,EAAKtN,IAAMU,OAAOsW,yBAAyB7U,EAAKmL,EAAKtN,IAEnE,OAAO8pE,GAGPC,EAAe,WACnBvqE,EAAQ4pB,OAAS,SAASthB,GACxB,IAAKkiE,SAASliE,GAAI,CAEhB,IADA,IAAImiE,EAAU,GACLjqE,EAAI,EAAGA,EAAIoF,UAAUzC,OAAQ3C,IACpCiqE,EAAQh+D,KAAKonB,QAAQjuB,UAAUpF,KAEjC,OAAOiqE,EAAQ/9D,KAAK,KAGlBlM,EAAI,EAmBR,IAnBA,IACImF,EAAOC,UACPwF,EAAMzF,EAAKxC,OACXgkB,EAAM5V,OAAOjJ,GAAGghB,QAAQihD,GAAc,SAAS5jD,GACjD,GAAU,OAANA,EAAY,MAAO,IACvB,GAAInmB,GAAK4K,EAAK,OAAOub,EACrB,OAAQA,GACN,IAAK,KAAM,OAAOpV,OAAO5L,EAAKnF,MAC9B,IAAK,KAAM,OAAOo4B,OAAOjzB,EAAKnF,MAC9B,IAAK,KACH,IACE,OAAO86C,KAAKE,UAAU71C,EAAKnF,MAC3B,MAAOgwC,GACP,MAAO,aAEX,QACE,OAAO7pB,MAGJA,EAAIhhB,EAAKnF,GAAIA,EAAI4K,EAAKub,EAAIhhB,IAAOnF,GACpCkqE,OAAO/jD,KAAOhe,SAASge,GACzBQ,GAAO,IAAMR,EAEbQ,GAAO,IAAM0M,QAAQlN,GAGzB,OAAOQ,GAOTnnB,EAAQylB,UAAY,SAAShgB,EAAIklE,GAC/B,QAAuB,IAAZrrD,IAAqD,IAA1BA,EAAQsrD,cAC5C,OAAOnlE,EAIT,QAAuB,IAAZ6Z,EACT,OAAO,WACL,OAAOtf,EAAQylB,UAAUhgB,EAAIklE,GAAK9kE,MAAMH,KAAME,YAIlD,IAAIilE,GAAS,EAeb,OAdA,SAASC,aACP,IAAKD,EAAQ,CACX,GAAIvrD,EAAQyrD,iBACV,MAAM,IAAIn/D,MAAM++D,GACPrrD,EAAQ0rD,iBACjBhe,QAAQie,MAAMN,GAEd3d,QAAQ5nD,MAAMulE,GAEhBE,GAAS,EAEX,OAAOplE,EAAGI,MAAMH,KAAME,aAO1B,IACIslE,EADAC,EAAS,GA6Bb,SAASt3C,QAAQlxB,EAAKuI,GAEpB,IAAI9E,EAAM,CACRy+B,KAAM,GACNumC,QAASC,gBAkBX,OAfIzlE,UAAUzC,QAAU,IAAGiD,EAAI8uC,MAAQtvC,UAAU,IAC7CA,UAAUzC,QAAU,IAAGiD,EAAIgoD,OAASxoD,UAAU,IAC9Cu5C,UAAUj0C,GAEZ9E,EAAIklE,WAAapgE,EACRA,GAETlL,EAAQurE,QAAQnlE,EAAK8E,GAGnBsgE,YAAYplE,EAAIklE,cAAallE,EAAIklE,YAAa,GAC9CE,YAAYplE,EAAI8uC,SAAQ9uC,EAAI8uC,MAAQ,GACpCs2B,YAAYplE,EAAIgoD,UAAShoD,EAAIgoD,QAAS,GACtCod,YAAYplE,EAAIqlE,iBAAgBrlE,EAAIqlE,eAAgB,GACpDrlE,EAAIgoD,SAAQhoD,EAAIglE,QAAUM,kBACvBC,YAAYvlE,EAAKzD,EAAKyD,EAAI8uC,OAoCnC,SAASw2B,iBAAiBvkD,EAAKykD,GAC7B,IAAIz5D,EAAQ0hB,QAAQg4C,OAAOD,GAE3B,OAAIz5D,EACK,KAAY0hB,QAAQu6B,OAAOj8C,GAAO,GAAK,IAAMgV,EAC7C,KAAY0M,QAAQu6B,OAAOj8C,GAAO,GAAK,IAEvCgV,EAKX,SAASkkD,eAAelkD,EAAKykD,GAC3B,OAAOzkD,EAeT,SAASwkD,YAAYvlE,EAAK3E,EAAOqqE,GAG/B,GAAI1lE,EAAIqlE,eACJhqE,GACAugB,WAAWvgB,EAAMoyB,UAEjBpyB,EAAMoyB,UAAY7zB,EAAQ6zB,WAExBpyB,EAAM2C,aAAe3C,EAAM2C,YAAY9B,YAAcb,GAAQ,CACjE,IAAI++B,EAAM/+B,EAAMoyB,QAAQi4C,EAAc1lE,GAItC,OAHKokE,SAAShqC,KACZA,EAAMmrC,YAAYvlE,EAAKo6B,EAAKsrC,IAEvBtrC,EAIT,IAAIurC,EA+FN,SAASC,gBAAgB5lE,EAAK3E,GAC5B,GAAI+pE,YAAY/pE,GACd,OAAO2E,EAAIglE,QAAQ,YAAa,aAClC,GAAIZ,SAAS/oE,GAAQ,CACnB,IAAIwqE,EAAS,IAAO3wB,KAAKE,UAAU/5C,GAAO6nB,QAAQ,SAAU,IAClBA,QAAQ,KAAM,OACdA,QAAQ,OAAQ,KAAO,IACjE,OAAOljB,EAAIglE,QAAQa,EAAQ,UAE7B,GAAIC,SAASzqE,GACX,OAAO2E,EAAIglE,QAAQ,GAAK3pE,EAAO,UACjC,GAAI09C,UAAU19C,GACZ,OAAO2E,EAAIglE,QAAQ,GAAK3pE,EAAO,WAEjC,GAAIipE,OAAOjpE,GACT,OAAO2E,EAAIglE,QAAQ,OAAQ,QA9GbY,CAAgB5lE,EAAK3E,GACrC,GAAIsqE,EACF,OAAOA,EAIT,IAAIj+D,EAAO5M,OAAO4M,KAAKrM,GACnB0qE,EApCN,SAASC,YAAY77D,GACnB,IAAI0+C,EAAO,GAMX,OAJA1+C,EAAMpE,SAAQ,SAAS4E,EAAK6lB,GAC1Bq4B,EAAKl+C,IAAO,KAGPk+C,EA6BWmd,CAAYt+D,GAQ9B,GANI1H,EAAIklE,aACNx9D,EAAO5M,OAAO2b,oBAAoBpb,IAKhC40B,QAAQ50B,KACJqM,EAAK+Q,QAAQ,YAAc,GAAK/Q,EAAK+Q,QAAQ,gBAAkB,GACrE,OAAOwtD,YAAY5qE,GAIrB,GAAoB,IAAhBqM,EAAK3K,OAAc,CACrB,GAAI6e,WAAWvgB,GAAQ,CACrB,IAAIV,EAAOU,EAAMV,KAAO,KAAOU,EAAMV,KAAO,GAC5C,OAAOqF,EAAIglE,QAAQ,YAAcrqE,EAAO,IAAK,WAE/C,GAAI4zB,SAASlzB,GACX,OAAO2E,EAAIglE,QAAQn/D,OAAO3J,UAAUmJ,SAAS9K,KAAKc,GAAQ,UAE5D,GAAIgzB,OAAOhzB,GACT,OAAO2E,EAAIglE,QAAQ32D,KAAKnS,UAAUmJ,SAAS9K,KAAKc,GAAQ,QAE1D,GAAI40B,QAAQ50B,GACV,OAAO4qE,YAAY5qE,GAIvB,IA2CI8rC,EA3CA5gB,EAAO,GAAIpc,GAAQ,EAAO+7D,EAAS,CAAC,IAAK,MAGzC1pD,QAAQnhB,KACV8O,GAAQ,EACR+7D,EAAS,CAAC,IAAK,MAIbtqD,WAAWvgB,MAEbkrB,EAAO,cADClrB,EAAMV,KAAO,KAAOU,EAAMV,KAAO,IACf,KAkB5B,OAdI4zB,SAASlzB,KACXkrB,EAAO,IAAM1gB,OAAO3J,UAAUmJ,SAAS9K,KAAKc,IAI1CgzB,OAAOhzB,KACTkrB,EAAO,IAAMlY,KAAKnS,UAAUiqE,YAAY5rE,KAAKc,IAI3C40B,QAAQ50B,KACVkrB,EAAO,IAAM0/C,YAAY5qE,IAGP,IAAhBqM,EAAK3K,QAAkBoN,GAAyB,GAAhB9O,EAAM0B,OAItC2oE,EAAe,EACbn3C,SAASlzB,GACJ2E,EAAIglE,QAAQn/D,OAAO3J,UAAUmJ,SAAS9K,KAAKc,GAAQ,UAEnD2E,EAAIglE,QAAQ,WAAY,YAInChlE,EAAIy+B,KAAKp4B,KAAKhL,GAIZ8rC,EADEh9B,EAsCN,SAASi8D,YAAYpmE,EAAK3E,EAAOqqE,EAAcK,EAAar+D,GAE1D,IADA,IAAIy/B,EAAS,GACJ/sC,EAAI,EAAGC,EAAIgB,EAAM0B,OAAQ3C,EAAIC,IAAKD,EACrC+B,eAAed,EAAO8P,OAAO/Q,IAC/B+sC,EAAO9gC,KAAKggE,eAAermE,EAAK3E,EAAOqqE,EAAcK,EACjD56D,OAAO/Q,IAAI,IAEf+sC,EAAO9gC,KAAK,IAShB,OANAqB,EAAK3B,SAAQ,SAASpK,GACfA,EAAI4xB,MAAM,UACb4Z,EAAO9gC,KAAKggE,eAAermE,EAAK3E,EAAOqqE,EAAcK,EACjDpqE,GAAK,OAGNwrC,EArDIi/B,CAAYpmE,EAAK3E,EAAOqqE,EAAcK,EAAar+D,GAEnDA,EAAKhD,KAAI,SAAS/I,GACzB,OAAO0qE,eAAermE,EAAK3E,EAAOqqE,EAAcK,EAAapqE,EAAKwO,MAItEnK,EAAIy+B,KAAK1a,MA6GX,SAASuiD,qBAAqBn/B,EAAQ5gB,EAAM2/C,GAQ1C,GANa/+B,EAAO/Q,QAAO,SAASzX,EAAM4hD,GAGxC,OADIA,EAAI9nD,QAAQ,OAAS,GAAG8tD,EACrB5nD,EAAO4hD,EAAIr9C,QAAQ,kBAAmB,IAAInmB,OAAS,IACzD,GAEU,GACX,OAAOmpE,EAAO,IACG,KAAT3/C,EAAc,GAAKA,EAAO,OAC3B,IACA4gB,EAAO7gC,KAAK,SACZ,IACA4/D,EAAO,GAGhB,OAAOA,EAAO,GAAK3/C,EAAO,IAAM4gB,EAAO7gC,KAAK,MAAQ,IAAM4/D,EAAO,GA5H1DI,CAAqBn/B,EAAQ5gB,EAAM2/C,IAxBjCA,EAAO,GAAK3/C,EAAO2/C,EAAO,GA+CrC,SAASD,YAAY5qE,GACnB,MAAO,IAAMmK,MAAMtJ,UAAUmJ,SAAS9K,KAAKc,GAAS,IAwBtD,SAASgrE,eAAermE,EAAK3E,EAAOqqE,EAAcK,EAAapqE,EAAKwO,GAClE,IAAIxP,EAAMomB,EAAK1P,EAsCf,IArCAA,EAAOvW,OAAOsW,yBAAyB/V,EAAOM,IAAQ,CAAEN,MAAOA,EAAMM,KAC5DV,IAEL8lB,EADE1P,EAAKT,IACD5Q,EAAIglE,QAAQ,kBAAmB,WAE/BhlE,EAAIglE,QAAQ,WAAY,WAG5B3zD,EAAKT,MACPmQ,EAAM/gB,EAAIglE,QAAQ,WAAY,YAG7B7oE,eAAe4pE,EAAapqE,KAC/BhB,EAAO,IAAMgB,EAAM,KAEhBolB,IACC/gB,EAAIy+B,KAAKhmB,QAAQpH,EAAKhW,OAAS,GAE/B0lB,EADEujD,OAAOoB,GACHH,YAAYvlE,EAAKqR,EAAKhW,MAAO,MAE7BkqE,YAAYvlE,EAAKqR,EAAKhW,MAAOqqE,EAAe,IAE5CjtD,QAAQ,OAAS,IAErBsI,EADE5W,EACI4W,EAAInb,MAAM,MAAMlB,KAAI,SAAS8hE,GACjC,MAAO,KAAOA,KACblgE,KAAK,MAAMklB,OAAO,GAEf,KAAOzK,EAAInb,MAAM,MAAMlB,KAAI,SAAS8hE,GACxC,MAAO,MAAQA,KACdlgE,KAAK,OAIZya,EAAM/gB,EAAIglE,QAAQ,aAAc,YAGhCI,YAAYzqE,GAAO,CACrB,GAAIwP,GAASxO,EAAI4xB,MAAM,SACrB,OAAOxM,GAETpmB,EAAOu6C,KAAKE,UAAU,GAAKz5C,IAClB4xB,MAAM,iCACb5yB,EAAOA,EAAK6wB,OAAO,EAAG7wB,EAAKoC,OAAS,GACpCpC,EAAOqF,EAAIglE,QAAQrqE,EAAM,UAEzBA,EAAOA,EAAKuoB,QAAQ,KAAM,OACdA,QAAQ,OAAQ,KAChBA,QAAQ,WAAY,KAChCvoB,EAAOqF,EAAIglE,QAAQrqE,EAAM,WAI7B,OAAOA,EAAO,KAAOomB,EA2BvB,SAASvE,QAAQiqD,GACf,OAAOjiE,MAAMgY,QAAQiqD,GAIvB,SAAS1tB,UAAUj6C,GACjB,MAAsB,kBAARA,EAIhB,SAASwlE,OAAOxlE,GACd,OAAe,OAARA,EAST,SAASgnE,SAAShnE,GAChB,MAAsB,iBAARA,EAIhB,SAASslE,SAAStlE,GAChB,MAAsB,iBAARA,EAShB,SAASsmE,YAAYtmE,GACnB,YAAe,IAARA,EAIT,SAASyvB,SAASm4C,GAChB,OAAOnkE,SAASmkE,IAA8B,oBAAvB58D,eAAe48D,GAIxC,SAASnkE,SAASzD,GAChB,MAAsB,iBAARA,GAA4B,OAARA,EAIpC,SAASuvB,OAAO3zB,GACd,OAAO6H,SAAS7H,IAA4B,kBAAtBoP,eAAepP,GAIvC,SAASu1B,QAAQ5tB,GACf,OAAOE,SAASF,KACW,mBAAtByH,eAAezH,IAA2BA,aAAamD,OAI9D,SAASoW,WAAW9c,GAClB,MAAsB,mBAARA,EAgBhB,SAASgL,eAAejP,GACtB,OAAOC,OAAOoB,UAAUmJ,SAAS9K,KAAKM,GAIxC,SAAS2iC,IAAI3hC,GACX,OAAOA,EAAI,GAAK,IAAMA,EAAEwJ,SAAS,IAAMxJ,EAAEwJ,SAAS,IApbpDzL,EAAQ+sE,SAAW,SAAS/1D,GAI1B,GAHIw0D,YAAYN,KACdA,EAAe5rD,EAAQsB,IAAIosD,YAAc,IAC3Ch2D,EAAMA,EAAI+C,eACLoxD,EAAOn0D,GACV,GAAI,IAAI/K,OAAO,MAAQ+K,EAAM,MAAO,KAAKoB,KAAK8yD,GAAe,CAC3D,IAAI+B,EAAM3tD,EAAQ2tD,IAClB9B,EAAOn0D,GAAO,WACZ,IAAI2zD,EAAM3qE,EAAQ4pB,OAAO/jB,MAAM7F,EAAS4F,WACxConD,QAAQ5nD,MAAM,YAAa4R,EAAKi2D,EAAKtC,SAGvCQ,EAAOn0D,GAAO,aAGlB,OAAOm0D,EAAOn0D,IAoChBhX,EAAQ6zB,QAAUA,QAIlBA,QAAQu6B,OAAS,CACf,KAAS,CAAC,EAAG,IACb,OAAW,CAAC,EAAG,IACf,UAAc,CAAC,EAAG,IAClB,QAAY,CAAC,EAAG,IAChB,MAAU,CAAC,GAAI,IACf,KAAS,CAAC,GAAI,IACd,MAAU,CAAC,GAAI,IACf,KAAS,CAAC,GAAI,IACd,KAAS,CAAC,GAAI,IACd,MAAU,CAAC,GAAI,IACf,QAAY,CAAC,GAAI,IACjB,IAAQ,CAAC,GAAI,IACb,OAAW,CAAC,GAAI,KAIlBv6B,QAAQg4C,OAAS,CACf,QAAW,OACX,OAAU,SACV,QAAW,SACX,UAAa,OACb,KAAQ,OACR,OAAU,QACV,KAAQ,UAER,OAAU,OAkRZ7rE,EAAQ4iB,QAAUA,QAKlB5iB,EAAQm/C,UAAYA,UAKpBn/C,EAAQ0qE,OAASA,OAKjB1qE,EAAQktE,kBAHR,SAASA,kBAAkBhoE,GACzB,OAAc,MAAPA,GAOTlF,EAAQksE,SAAWA,SAKnBlsE,EAAQwqE,SAAWA,SAKnBxqE,EAAQ43B,SAHR,SAASA,SAAS1yB,GAChB,MAAsB,iBAARA,GAOhBlF,EAAQwrE,YAAcA,YAKtBxrE,EAAQ20B,SAAWA,SAKnB30B,EAAQ2I,SAAWA,SAKnB3I,EAAQy0B,OAASA,OAMjBz0B,EAAQq2B,QAAUA,QAKlBr2B,EAAQgiB,WAAaA,WAUrBhiB,EAAQq1B,YARR,SAASA,YAAYnwB,GACnB,OAAe,OAARA,GACe,kBAARA,GACQ,iBAARA,GACQ,iBAARA,GACQ,iBAARA,QACQ,IAARA,GAIhBlF,EAAQyyB,SAAW,EAAQ,KAY3B,IAAI06C,EAAS,CAAC,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MACxD,MAAO,MAAO,OAG5B,SAASC,YACP,IAAItsE,EAAI,IAAI2T,KACR44D,EAAO,CAACzpC,IAAI9iC,EAAEwsE,YACN1pC,IAAI9iC,EAAEysE,cACN3pC,IAAI9iC,EAAE0sE,eAAe9gE,KAAK,KACtC,MAAO,CAAC5L,EAAE2sE,UAAWN,EAAOrsE,EAAE4sE,YAAaL,GAAM3gE,KAAK,KAqCxD,SAASnK,eAAeI,EAAKi6B,GAC3B,OAAO17B,OAAOoB,UAAUC,eAAe5B,KAAKgC,EAAKi6B,GAjCnD58B,EAAQylD,IAAM,WACZuH,QAAQvH,IAAI,UAAW2nB,YAAaptE,EAAQ4pB,OAAO/jB,MAAM7F,EAAS4F,aAiBpE5F,EAAQ82B,SAAW,EAAQ,KAE3B92B,EAAQurE,QAAU,SAASoC,EAAQh1C,GAEjC,IAAKA,IAAQhwB,SAASgwB,GAAM,OAAOg1C,EAInC,IAFA,IAAI7/D,EAAO5M,OAAO4M,KAAK6qB,GACnBn4B,EAAIsN,EAAK3K,OACN3C,KACLmtE,EAAO7/D,EAAKtN,IAAMm4B,EAAI7qB,EAAKtN,IAE7B,OAAOmtE,GAOT,IAAIC,EAA6C,oBAAXrsE,OAAyBA,OAAO,8BAA2BwE,EA0DjG,SAAS8nE,sBAAsB1hB,EAAQhtC,GAKrC,IAAKgtC,EAAQ,CACX,IAAI2hB,EAAY,IAAIliE,MAAM,2CAC1BkiE,EAAU3hB,OAASA,EACnBA,EAAS2hB,EAEX,OAAO3uD,EAAGgtC,GAlEZnsD,EAAQ+tE,UAAY,SAASA,UAAUv+D,GACrC,GAAwB,mBAAbA,EACT,MAAM,IAAIzM,UAAU,oDAEtB,GAAI6qE,GAA4Bp+D,EAASo+D,GAA2B,CAClE,IAAInoE,EACJ,GAAkB,mBADdA,EAAK+J,EAASo+D,IAEhB,MAAM,IAAI7qE,UAAU,iEAKtB,OAHA7B,OAAOC,eAAesE,EAAImoE,EAA0B,CAClDnsE,MAAOgE,EAAIrE,YAAY,EAAOkC,UAAU,EAAOD,cAAc,IAExDoC,EAGT,SAASA,IAQP,IAPA,IAAIuoE,EAAgBC,EAChB3K,EAAU,IAAIh+D,SAAQ,SAAUR,EAASC,GAC3CipE,EAAiBlpE,EACjBmpE,EAAgBlpE,KAGdY,EAAO,GACFnF,EAAI,EAAGA,EAAIoF,UAAUzC,OAAQ3C,IACpCmF,EAAK8G,KAAK7G,UAAUpF,IAEtBmF,EAAK8G,MAAK,SAAU3G,EAAKrE,GACnBqE,EACFmoE,EAAcnoE,GAEdkoE,EAAevsE,MAInB,IACE+N,EAAS3J,MAAMH,KAAMC,GACrB,MAAOG,GACPmoE,EAAcnoE,GAGhB,OAAOw9D,EAQT,OALApiE,OAAOyC,eAAe8B,EAAIvE,OAAO0C,eAAe4L,IAE5Co+D,GAA0B1sE,OAAOC,eAAesE,EAAImoE,EAA0B,CAChFnsE,MAAOgE,EAAIrE,YAAY,EAAOkC,UAAU,EAAOD,cAAc,IAExDnC,OAAOm5C,iBACZ50C,EACA4kE,EAA0B76D,KAI9BxP,EAAQ+tE,UAAUG,OAASN,EAiD3B5tE,EAAQmuE,YAlCR,SAASA,YAAY3+D,GACnB,GAAwB,mBAAbA,EACT,MAAM,IAAIzM,UAAU,oDAMtB,SAASqrE,gBAEP,IADA,IAAIzoE,EAAO,GACFnF,EAAI,EAAGA,EAAIoF,UAAUzC,OAAQ3C,IACpCmF,EAAK8G,KAAK7G,UAAUpF,IAGtB,IAAI6tE,EAAU1oE,EAAKwkB,MACnB,GAAuB,mBAAZkkD,EACT,MAAM,IAAItrE,UAAU,8CAEtB,IAAIyB,EAAOkB,KACPyZ,GAAK,WACP,OAAOkvD,EAAQxoE,MAAMrB,EAAMoB,YAI7B4J,EAAS3J,MAAMH,KAAMC,GAClBJ,MAAK,SAASi7B,GAAOlhB,EAAQmB,SAAStB,GAAI,KAAMqhB,MAC3C,SAAS8tC,GAAOhvD,EAAQmB,SAASotD,sBAAuBS,EAAKnvD,OAMvE,OAHAje,OAAOyC,eAAeyqE,cAAeltE,OAAO0C,eAAe4L,IAC3DtO,OAAOm5C,iBAAiB+zB,cACA/D,EAA0B76D,IAC3C4+D,iB,gCC5rBTnuE,EAAOD,QAAU,SAASyyB,SAASvtB,GACjC,OAAOA,GAAsB,iBAARA,GACI,mBAAbA,EAAI8mB,MACS,mBAAb9mB,EAAIg2D,MACc,mBAAlBh2D,EAAI03D,Y,cCJW,mBAAlB17D,OAAOY,OAEhB7B,EAAOD,QAAU,SAAS82B,SAAS9c,EAAMu0D,GACvCv0D,EAAKw0D,OAASD,EACdv0D,EAAK1X,UAAYpB,OAAOY,OAAOysE,EAAUjsE,UAAW,CAClD8B,YAAa,CACX3C,MAAOuY,EACP5Y,YAAY,EACZkC,UAAU,EACVD,cAAc,MAMpBpD,EAAOD,QAAU,SAAS82B,SAAS9c,EAAMu0D,GACvCv0D,EAAKw0D,OAASD,EACd,IAAIE,SAAW,aACfA,SAASnsE,UAAYisE,EAAUjsE,UAC/B0X,EAAK1X,UAAY,IAAImsE,SACrBz0D,EAAK1X,UAAU8B,YAAc4V,I,4MCpBjC,QACA,QACA,QACA,Y,8eAIqBy+B,G,GAyClB,IAAAi2B,+BAA8B,CAAEC,aAAc,I,GAoB9C,IAAAD,+BAA8B,CAAEC,aAAc,I,2FA5D/C,sBAA0B,IAAd5tE,EAAc,uDAAP,MAAO,iDAClBA,EAAM,CAAC,gBAAiB,OAAQ,QAAS,YAAa,gB,uNAI1C2E,KAAKkpE,eAAep0D,M,cAAhCA,E,0BACC,IAAAhQ,aAAYgQ,EAAKxU,OAAKgrB,WAAW,K,kSAInBtrB,KAAKkpE,eAAeC,Q,cAAnCC,E,yBACCA,EAAOz+D,GAAG,I,2SAII3K,KAAKqpE,eAAeC,O,cAAnCC,E,yBACCA,EAAO5+D,GAAG,I,mTAIW/K,QAAQgQ,IAAI,CACtC5P,KAAKmpE,QACLnpE,KAAKwpE,4B,4CAFAL,E,KAAOG,E,wBAINH,IAAUG,G,oSAIEtpE,KAAKkpE,eAAeO,M,cAAlCnH,E,0BACC,IAAAx9D,aAAYw9D,EAAOhiE,OAAKgrB,WAAW,K,yTAGdomB,E,mCAE1BA,EAAU1xC,KAAKrE,IAAI,QAAQ+tE,kB,SAET1pE,KAAKkpE,eAAettB,IAAIlK,G,cAAtC4wB,E,0BACC,IAAAx9D,aAAYw9D,EAAOhiE,OAAKgrB,WAAW,K,kMAIhCpY,G,oHAAQy2D,E,yDAAsB/L,E,EAAAA,QAClCgM,GAAY,IAAA9kE,aAAYoO,EAAQ5S,OACjCqpE,E,iCAC+B/pE,QAAQgQ,IAAI,CAC5C5P,KAAKmpE,QACLnpE,KAAKrE,IAAI,SACNwmE,SAAS7hE,OACTupE,Y,wCAJEV,E,KAAOW,E,MAMVX,E,uBACI,IAAIjjE,MAAM,sD,YAEd4jE,EAAW78D,GAAG28D,G,uBACV,IAAI1jE,MAAM,mD,iCAGblG,KAAKkpE,eAAeliE,KAAK4iE,EAAUl+C,QAAQ,OAAQ,CAAEkyC,a,uTAI/B+L,E,yDAAsB/L,QAC9C+L,E,iCACmD/pE,QAAQgQ,IAAI,CAChE5P,KAAK+pE,kBACL/pE,KAAKgqE,iBACLhqE,KAAKiqE,Y,wCAHAF,E,KAAiBG,E,KAAaD,E,MAKjCC,EAAYj9D,GAAG88D,G,uBACX,IAAI7jE,MACR,qE,WAGC+jE,E,uBACG,IAAI/jE,MAAM,iD,iCAGblG,KAAKkpE,eAAeiB,Q,6TAINnqE,KAAKrE,IAAI,eAAeyuE,c,cAAvCC,E,OACAC,EAAeD,EAAOjlE,KAAI,SAAArC,GAK9B,MAAO,CACLwnE,gBALsBxnE,EAAEynE,OAMxBC,cALoB1nE,EAAE2nE,OAMtBx3D,QALa,IAAA5S,KAAIyC,EAAE4nE,YAMnBhD,KALW,IAAI54D,KAAKhM,EAAE6nE,oBAQpBC,EAAqBP,EAAap6C,MAAK,SAACluB,EAAGC,GAE/C,OAAOA,EAAE0lE,KAAO3lE,EAAE2lE,Q,kBAEbkD,G,wKAIP,OAAO7qE,KAAKrE,IAAI,iBAAiBwkD,kBAAkB1O,S,kDAInD,OAAOzxC,KAAKrE,IAAI,iBAAiBwkD,kBAAkBvO,W,YA3Gfof,mB,mRCsBxCz2D,EAAOD,QA7BP,SAASwwE,0BAA0BvtE,EAAQZ,EAAUouE,EAAYrtE,EAAYgjC,GAC3E,IAAI3uB,EAAO,GAyBX,OAxBAvW,OAAO4M,KAAK1K,GAAY+I,SAAQ,SAAUpK,GACxC0V,EAAK1V,GAAOqB,EAAWrB,MAEzB0V,EAAKrW,aAAeqW,EAAKrW,WACzBqW,EAAKpU,eAAiBoU,EAAKpU,cAEvB,UAAWoU,GAAQA,EAAKi5D,eAC1Bj5D,EAAKnU,UAAW,GAGlBmU,EAAOg5D,EAAWnkE,QAAQggB,UAAUkQ,QAAO,SAAU/kB,EAAMk5D,GACzD,OAAOA,EAAU1tE,EAAQZ,EAAUoV,IAASA,IAC3CA,GAEC2uB,QAAgC,IAArB3uB,EAAKi5D,cAClBj5D,EAAKhW,MAAQgW,EAAKi5D,YAAcj5D,EAAKi5D,YAAY/vE,KAAKylC,QAAW,EACjE3uB,EAAKi5D,iBAAc3qE,QAGI,IAArB0R,EAAKi5D,cACPxvE,OAAOC,eAAe8B,EAAQZ,EAAUoV,GACxCA,EAAO,MAGFA,I,yMCtBT,Y,EA6B2Bi3D,8BAA8B,IAGlD,SAASA,8BAAT,GAAyD,IAAhBC,EAAgB,EAAhBA,aAC9C,OAAO,SAAC1rE,EAAQlC,EAAMqC,GACpB,IAAMoM,EAAWpM,EAAW3B,MACtBmvE,EAAoBjC,GAAgBn/D,EAASrM,OAqCnD,OApCAC,EAAW3B,MAAQ,WAAkB,kCAANkE,EAAM,yBAANA,EAAM,gBACnC,IACI2wB,EADE8L,EAAOz8B,EAAKA,EAAKxC,OAAS,GAGd,YAAhB,aAAOi/B,IACE,OAATA,GACAA,EAAKh+B,cAAgBlD,QAErByE,EAAOA,EAAK2G,MAAM,EAAG3G,EAAKxC,OAAS,GACnCmzB,EAAU8L,GAEV9L,EAAU,GAGZ,IAAMgtC,GAAU,6BAAC,yHAGT,EAHS,cAQVhtC,EAAQgtC,UAAShtC,EAAQgtC,QAAUA,GAIlCuN,EAZS,wBAaVlrE,IAbU,cAcV,aAAMirE,EAAoB,EAAIjrE,EAAKxC,QAAQ,gBAdjC,CAebmzB,IAfa,kBAkBR9mB,EAAS3J,MAAM,EAAMgrE,IAlBb,gDAAD,GAoBhB,OAAOvN,GAEFlgE,G,6BC5EX,IAAImiB,EAAY,EAAQ,IACpBurD,EAAe,EAAQ,KACvBv2D,EAAY,EAAQ,KASpBw2D,EAAY/oE,KAAKwS,IAuCrBva,EAAOD,QAlBP,SAASqvB,MAAMptB,EAAGqjB,GAEhB,IADArjB,EAAIsY,EAAUtY,IACN,GAAKA,EA7BQ,iBA8BnB,MAAO,GAET,IAAI2P,EA7BiB,WA8BjBzO,EAAS4tE,EAAU9uE,EA9BF,YAgCrBqjB,EAAWwrD,EAAaxrD,GACxBrjB,GAjCqB,WAoCrB,IADA,IAAI6Q,EAASyS,EAAUpiB,EAAQmiB,KACtB1T,EAAQ3P,GACfqjB,EAAS1T,GAEX,OAAOkB,I,gBC/CT,IAAI8uC,EAAW,EAAQ,KAavB3hD,EAAOD,QAJP,SAAS8wE,aAAarvE,GACpB,MAAuB,mBAATA,EAAsBA,EAAQmgD,I,cCU9C3hD,EAAOD,QAJP,SAAS4hD,SAASngD,GAChB,OAAOA,I,gBCjBT,IAAI4wB,EAAW,EAAQ,KAyCvBpyB,EAAOD,QAZP,SAAS03B,SAASj2B,GAChB,OAAKA,GAGLA,EAAQ4wB,EAAS5wB,MA9BJ,KA+BaA,KA/Bb,IACG,uBA+BFA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,I,gBC/BjC,IAAIkH,EAAW,EAAQ,IACnBivB,EAAW,EAAQ,KAMnBo5C,EAAS,aAGTC,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAelnE,SA8CnBjK,EAAOD,QArBP,SAASqyB,SAAS5wB,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIm2B,EAASn2B,GACX,OA7CM,IA+CR,GAAIkH,EAASlH,GAAQ,CACnB,IAAIs9C,EAAgC,mBAAjBt9C,EAAMuP,QAAwBvP,EAAMuP,UAAYvP,EACnEA,EAAQkH,EAASo2C,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATt9C,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQA,EAAM6nB,QAAQ0nD,EAAQ,IAC9B,IAAIK,EAAWH,EAAW94D,KAAK3W,GAC/B,OAAQ4vE,GAAYF,EAAU/4D,KAAK3W,GAC/B2vE,EAAa3vE,EAAM6K,MAAM,GAAI+kE,EAAW,EAAI,GAC3CJ,EAAW74D,KAAK3W,GA1Db,KA0D6BA,I,kLC9DvC,QACA,QACA,YACA,YACA,YACA,YAEA,Q,0eADA,IAAM6vE,EAAY7vB,UAAa8vB,MAGV54B,E,qFACnB,wBAA4B,MAAhB53C,EAAgB,uDAAT,QAAS,wCAC1B,cAAMA,EAAM,CAAC,gBAAiB,UACzBywE,IAAM,GACX,EAAKnsE,KAAO,GACZ,EAAKosE,OAAS,GACd,EAAKC,cAAgB,GACrB,EAAKC,cAAgB,GANK,E,8FAU1B,OAAIjsE,KAAKksE,QACTlsE,KAAKksE,MAAQlsE,KAAKmsE,iBAAiBD,SADZlsE,KAAKksE,Q,sEAKjBE,G,4FACPpsE,KAAK8rE,IAAIM,G,yCAAsBpsE,KAAK8rE,IAAIM,I,cACtCp5B,EAAQhzC,KAAKrE,IAAI,iBAAiBwgE,2BACtCiQ,EACAC,W,SAEgBr5B,EAAM84B,M,WAAlBA,E,QACGn/C,W,8CAAmBtsB,G,cAC5BL,KAAK8rE,IAAIM,GAAgB,IAAIr9D,KAAsB,IAAjB+8D,EAAIn/C,Y,kBAC/B3sB,KAAK8rE,IAAIM,I,6LAGKA,G,+GACjBpsE,KAAKisE,cAAcG,G,yCACdpsE,KAAKisE,cAAcG,I,uBACVpsE,KAAKssE,OAAOF,G,cAAxBN,E,QACN,aAAOA,EAAP,gBAAqBM,EAArB,4BACMG,EAAevsE,KAAKmsE,iBAAiBz6B,QACrC4K,EAAct8C,KAAKrE,IAAI,QACvB4gD,EAAQD,EAAYrL,QACpBuL,GAAc,IAAAl4C,aAAYi4C,GAC1BiwB,EACJ,MAAO,aAASJ,EAAaxoD,QAAQ,MAAO,IAAK,GAAI,K,UAC7B04B,EAAYG,YAAY,CAChDC,UAAWkvB,EAAUjvB,gBAAgBH,GACrCI,QAAS,SACTlL,QAAS66B,EACT1vB,OAAQ,CAAC+uB,EAAU9uB,OAAO2vB,KAAMD,K,6CAJ3BE,E,eAMqBpwB,EAAYqwB,SAASD,EAAUxvB,a,wBAAnDwqB,E,EAAAA,UACR1nE,KAAKisE,cAAcG,GAAgB,IAAIr9D,KAAiB,IAAZ24D,G,kBACrC1nE,KAAKisE,cAAcG,I,+LAGdA,G,2FACRpsE,KAAKL,KAAKysE,G,yCAAsBpsE,KAAKL,KAAKysE,I,cACxCp5B,EAAQhzC,KAAKrE,IAAI,iBAAiBwgE,2BACtCiQ,EACAC,WAEFrsE,KAAKL,KAAKysE,GAAgBp5B,EAAMrzC,O,kBACzBK,KAAKL,KAAKysE,I,uLAGHA,G,2FACVpsE,KAAK+rE,OAAOK,G,yCAAsBpsE,KAAK+rE,OAAOK,I,cAC5Cp5B,EAAQhzC,KAAKrE,IAAI,iBAAiBwgE,2BACtCiQ,EACAC,WAEFrsE,KAAK+rE,OAAOK,GAAgBp5B,EAAM+4B,S,kBAC3B/rE,KAAK+rE,OAAOK,I,gMAGEA,G,+GACjBpsE,KAAKgsE,cAAcI,G,yCACdpsE,KAAKgsE,cAAcI,I,uBACTpsE,KAAK4sE,QAAQR,G,cAA1BzsE,E,QACN,aAAOA,EAAP,gBAAsBysE,EAAtB,2BACMG,EAAevsE,KAAKmsE,iBAAiBz6B,QACrC4K,EAAct8C,KAAKrE,IAAI,QACvB4gD,EAAQD,EAAYrL,QACpBuL,GAAc,IAAAl4C,aAAYi4C,GAC1BiwB,EACJ,MAAO,aAASJ,EAAaxoD,QAAQ,MAAO,IAAK,GAAI,K,UAC7B04B,EAAYG,YAAY,CAChDC,UAAWkvB,EAAUjvB,gBAAgBH,GACrCI,QAAS,SACTlL,QAAS66B,EACT1vB,OAAQ,CAAC+uB,EAAU9uB,OAAOj5C,KAAM2oE,K,6CAJ3BK,E,eAMqBvwB,EAAYqwB,SAASE,EAAU3vB,a,wBAAnDwqB,E,EAAAA,UACR1nE,KAAKgsE,cAAcI,GAAgB,IAAIr9D,KAAiB,IAAZ24D,G,kBACrC1nE,KAAKgsE,cAAcI,I,+JAI1BpsE,KAAKksE,MAAQ,KACblsE,KAAK8rE,IAAM,GACX9rE,KAAKL,KAAO,GACZK,KAAKgsE,cAAgB,GACrBhsE,KAAKisE,cAAgB,K,sDAIrB,OAAOjsE,KAAKrE,IAAI,iBAAiBwkD,kBAAkBjO,a,cArGb6e,iB,muDCT1C,IAAI+b,EAAgB,EAAQ,KACxBt6C,EAAa,EAAQ,KACrB3d,EAAY,EAAQ,KACpB9O,EAAW,EAAQ,KAmCvBxL,EAAOD,QAVP,SAASyyE,SAASt6D,EAAQhV,EAAQuvE,GAChCv6D,EAAS1M,EAAS0M,GAGlB,IAAIw6D,GAFJxvE,EAASoX,EAAUpX,IAEM+0B,EAAW/f,GAAU,EAC9C,OAAQhV,GAAUwvE,EAAYxvE,EACzBqvE,EAAcrvE,EAASwvE,EAAWD,GAASv6D,EAC5CA,I,gBCnCN,IAAIy6D,EAAa,EAAQ,KACrB76C,EAAe,EAAQ,KACvB86C,EAAY,EAAQ,KACpB36D,EAAa,EAAQ,IACrBggB,EAAa,EAAQ,KACrB46C,EAAgB,EAAQ,KAGxBC,EAAa/qE,KAAK6D,KAwBtB5L,EAAOD,QAbP,SAASwyE,cAAcrvE,EAAQuvE,GAG7B,IAAIM,GAFJN,OAAkB3sE,IAAV2sE,EAAsB,IAAM36C,EAAa26C,IAEzBvvE,OACxB,GAAI6vE,EAAc,EAChB,OAAOA,EAAcJ,EAAWF,EAAOvvE,GAAUuvE,EAEnD,IAAI5/D,EAAS8/D,EAAWF,EAAOK,EAAW5vE,EAAS+0B,EAAWw6C,KAC9D,OAAOx6D,EAAWw6D,GACdG,EAAUC,EAAchgE,GAAS,EAAG3P,GAAQuJ,KAAK,IACjDoG,EAAOxG,MAAM,EAAGnJ,K,cC5BtB,IAGI8vE,EAAcjrE,KAAKiJ,MA8BvBhR,EAAOD,QApBP,SAAS4yE,WAAWz6D,EAAQlW,GAC1B,IAAI6Q,EAAS,GACb,IAAKqF,GAAUlW,EAAI,GAAKA,EAfH,iBAgBnB,OAAO6Q,EAIT,GACM7Q,EAAI,IACN6Q,GAAUqF,IAEZlW,EAAIgxE,EAAYhxE,EAAI,MAElBkW,GAAUA,SAELlW,GAET,OAAO6Q,I,gBC/BT,IAAIogE,EAAY,EAAQ,KAiBxBjzE,EAAOD,QANP,SAAS6yE,UAAUtiE,EAAOg3B,EAAO0wB,GAC/B,IAAI90D,EAASoN,EAAMpN,OAEnB,OADA80D,OAAclyD,IAARkyD,EAAoB90D,EAAS80D,GAC1B1wB,GAAS0wB,GAAO90D,EAAUoN,EAAQ2iE,EAAU3iE,EAAOg3B,EAAO0wB,K,cCgBrEh4D,EAAOD,QArBP,SAASkzE,UAAU3iE,EAAOg3B,EAAO0wB,GAC/B,IAAIrmD,GAAS,EACTzO,EAASoN,EAAMpN,OAEfokC,EAAQ,IACVA,GAASA,EAAQpkC,EAAS,EAAKA,EAASokC,IAE1C0wB,EAAMA,EAAM90D,EAASA,EAAS80D,GACpB,IACRA,GAAO90D,GAETA,EAASokC,EAAQ0wB,EAAM,EAAMA,EAAM1wB,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIz0B,EAASlI,MAAMzH,KACVyO,EAAQzO,GACf2P,EAAOlB,GAASrB,EAAMqB,EAAQ21B,GAEhC,OAAOz0B,I,gBC3BT,IASIklB,EATe,EAAQ,IASXm7C,CAAa,UAE7BlzE,EAAOD,QAAUg4B,G,cCEjB/3B,EAAOD,QANP,SAASmzE,aAAapxE,GACpB,OAAO,SAASK,GACd,OAAiB,MAAVA,OAAiB2D,EAAY3D,EAAOL,M,cCR/C,IAQIqxE,EAAW,oBACXC,EAAU,kDACVC,EAAS,2BAETC,EAAc,qBACdC,EAAa,kCACbC,EAAa,qCAIbC,EAPa,MAAQL,EAAU,IAAMC,EAAS,IAOtB,IAGxBK,EAFW,oBAEQD,GADP,gBAAwB,CAACH,EAAaC,EAAYC,GAAY/mE,KAAK,KAAnE,qBAA2FgnE,EAAW,MAElHE,EAAW,MAAQ,CAACL,EAAcF,EAAU,IAAKA,EAASG,EAAYC,EAAYL,GAAU1mE,KAAK,KAAO,IAGxGmnE,EAAY5nE,OAAOqnE,EAAS,MAAQA,EAAS,KAAOM,EAAWD,EAAO,KAiB1E1zE,EAAOD,QARP,SAASi4B,YAAY9f,GAEnB,IADA,IAAIrF,EAAS+gE,EAAUh/C,UAAY,EAC5Bg/C,EAAUz7D,KAAKD,MAClBrF,EAEJ,OAAOA,I,gBCxCT,IAAIghE,EAAe,EAAQ,KACvB57D,EAAa,EAAQ,IACrB67D,EAAiB,EAAQ,KAe7B9zE,EAAOD,QANP,SAAS8yE,cAAc36D,GACrB,OAAOD,EAAWC,GACd47D,EAAe57D,GACf27D,EAAa37D,K,cCHnBlY,EAAOD,QAJP,SAAS8zE,aAAa37D,GACpB,OAAOA,EAAOnM,MAAM,M,cCPtB,IAQIonE,EAAW,oBACXC,EAAU,kDACVC,EAAS,2BAETC,EAAc,qBACdC,EAAa,kCACbC,EAAa,qCAIbC,EAPa,MAAQL,EAAU,IAAMC,EAAS,IAOtB,IAGxBK,EAFW,oBAEQD,GADP,gBAAwB,CAACH,EAAaC,EAAYC,GAAY/mE,KAAK,KAAnE,qBAA2FgnE,EAAW,MAElHE,EAAW,MAAQ,CAACL,EAAcF,EAAU,IAAKA,EAASG,EAAYC,EAAYL,GAAU1mE,KAAK,KAAO,IAGxGmnE,EAAY5nE,OAAOqnE,EAAS,MAAQA,EAAS,KAAOM,EAAWD,EAAO,KAa1E1zE,EAAOD,QAJP,SAAS+zE,eAAe57D,GACtB,OAAOA,EAAOwb,MAAMkgD,IAAc,K,gBCpCpC,IAAI97C,EAAe,EAAQ,KA2B3B93B,EAAOD,QAJP,SAASyL,SAAShK,GAChB,OAAgB,MAATA,EAAgB,GAAKs2B,EAAat2B,K","file":"index.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"@makerdao/dai-plugin-governance\"] = factory();\n\telse\n\t\troot[\"@makerdao/dai-plugin-governance\"] = factory();\n})(window, function() {\nreturn "," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 109);\n","function _interopRequireDefault(obj) {\n  return obj && obj.__esModule ? obj : {\n    \"default\": obj\n  };\n}\n\nmodule.exports = _interopRequireDefault;","function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}\n\nmodule.exports = _classCallCheck;","function _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, descriptor.key, descriptor);\n  }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  return Constructor;\n}\n\nmodule.exports = _createClass;","function _getPrototypeOf(o) {\n  module.exports = _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  };\n  return _getPrototypeOf(o);\n}\n\nmodule.exports = _getPrototypeOf;","var core = module.exports = { version: '2.6.11' };\nif (typeof __e == 'number') __e = core; // eslint-disable-line no-undef\n","var setPrototypeOf = require(\"./setPrototypeOf\");\n\nfunction _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  if (superClass) setPrototypeOf(subClass, superClass);\n}\n\nmodule.exports = _inherits;","var _typeof = require(\"../helpers/typeof\");\n\nvar assertThisInitialized = require(\"./assertThisInitialized\");\n\nfunction _possibleConstructorReturn(self, call) {\n  if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) {\n    return call;\n  }\n\n  return assertThisInitialized(self);\n}\n\nmodule.exports = _possibleConstructorReturn;","var store = require('./_shared')('wks');\nvar uid = require('./_uid');\nvar Symbol = require('./_global').Symbol;\nvar USE_SYMBOL = typeof Symbol == 'function';\n\nvar $exports = module.exports = function (name) {\n  return store[name] || (store[name] =\n    USE_SYMBOL && Symbol[name] || (USE_SYMBOL ? Symbol : uid)('Symbol.' + name));\n};\n\n$exports.store = store;\n","module.exports = require(\"regenerator-runtime\");\n","function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {\n  try {\n    var info = gen[key](arg);\n    var value = info.value;\n  } catch (error) {\n    reject(error);\n    return;\n  }\n\n  if (info.done) {\n    resolve(value);\n  } else {\n    Promise.resolve(value).then(_next, _throw);\n  }\n}\n\nfunction _asyncToGenerator(fn) {\n  return function () {\n    var self = this,\n        args = arguments;\n    return new Promise(function (resolve, reject) {\n      var gen = fn.apply(self, args);\n\n      function _next(value) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"next\", value);\n      }\n\n      function _throw(err) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"throw\", err);\n      }\n\n      _next(undefined);\n    });\n  };\n}\n\nmodule.exports = _asyncToGenerator;","import { createCurrency } from '@makerdao/currency';\n\nexport const MKR = createCurrency('MKR');\nexport const IOU = createCurrency('IOU');\n\n/* Contracts */\nexport const VOTE_PROXY_FACTORY = 'VOTE_PROXY_FACTORY';\nexport const POLLING = 'POLLING';\nexport const BATCH_POLLING = 'BATCH_POLLING';\nexport const CHIEF = 'CHIEF';\nexport const ESM = 'ESM';\nexport const END = 'END';\nexport const PAUSE = 'PAUSE';\n\n/* Addresses */\nexport const ZERO_ADDRESS = '0x0000000000000000000000000000000000000000';\n\n/* Spock URLs */\nexport const LOCAL_URL = 'http://localhost:3001/v1';\nexport const KOVAN_URL = 'https://staging-gov-db.makerfoundation.com/api/v1';\nexport const STAGING_MAINNET_URL =\n  'https://qa-gov-db.makerfoundation.com/api/v1';\nexport const MAINNET_URL = 'https://gov-db.makerfoundation.com/api/v1';\n","var global = require('./_global');\nvar core = require('./_core');\nvar ctx = require('./_ctx');\nvar hide = require('./_hide');\nvar has = require('./_has');\nvar PROTOTYPE = 'prototype';\n\nvar $export = function (type, name, source) {\n  var IS_FORCED = type & $export.F;\n  var IS_GLOBAL = type & $export.G;\n  var IS_STATIC = type & $export.S;\n  var IS_PROTO = type & $export.P;\n  var IS_BIND = type & $export.B;\n  var IS_WRAP = type & $export.W;\n  var exports = IS_GLOBAL ? core : core[name] || (core[name] = {});\n  var expProto = exports[PROTOTYPE];\n  var target = IS_GLOBAL ? global : IS_STATIC ? global[name] : (global[name] || {})[PROTOTYPE];\n  var key, own, out;\n  if (IS_GLOBAL) source = name;\n  for (key in source) {\n    // contains in native\n    own = !IS_FORCED && target && target[key] !== undefined;\n    if (own && has(exports, key)) continue;\n    // export native or passed\n    out = own ? target[key] : source[key];\n    // prevent global pollution for namespaces\n    exports[key] = IS_GLOBAL && typeof target[key] != 'function' ? source[key]\n    // bind timers to global for call from export context\n    : IS_BIND && own ? ctx(out, global)\n    // wrap global constructors for prevent change them in library\n    : IS_WRAP && target[key] == out ? (function (C) {\n      var F = function (a, b, c) {\n        if (this instanceof C) {\n          switch (arguments.length) {\n            case 0: return new C();\n            case 1: return new C(a);\n            case 2: return new C(a, b);\n          } return new C(a, b, c);\n        } return C.apply(this, arguments);\n      };\n      F[PROTOTYPE] = C[PROTOTYPE];\n      return F;\n    // make static versions for prototype methods\n    })(out) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out;\n    // export proto methods to core.%CONSTRUCTOR%.methods.%NAME%\n    if (IS_PROTO) {\n      (exports.virtual || (exports.virtual = {}))[key] = out;\n      // export proto methods to core.%CONSTRUCTOR%.prototype.%NAME%\n      if (type & $export.R && expProto && !expProto[key]) hide(expProto, key, out);\n    }\n  }\n};\n// type bitmap\n$export.F = 1;   // forced\n$export.G = 2;   // global\n$export.S = 4;   // static\n$export.P = 8;   // proto\n$export.B = 16;  // bind\n$export.W = 32;  // wrap\n$export.U = 64;  // safe\n$export.R = 128; // real proto method for `library`\nmodule.exports = $export;\n","// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\nvar global = module.exports = typeof window != 'undefined' && window.Math == Math\n  ? window : typeof self != 'undefined' && self.Math == Math ? self\n  // eslint-disable-next-line no-new-func\n  : Function('return this')();\nif (typeof __g == 'number') __g = global; // eslint-disable-line no-undef\n","var anObject = require('./_an-object');\nvar IE8_DOM_DEFINE = require('./_ie8-dom-define');\nvar toPrimitive = require('./_to-primitive');\nvar dP = Object.defineProperty;\n\nexports.f = require('./_descriptors') ? Object.defineProperty : function defineProperty(O, P, Attributes) {\n  anObject(O);\n  P = toPrimitive(P, true);\n  anObject(Attributes);\n  if (IE8_DOM_DEFINE) try {\n    return dP(O, P, Attributes);\n  } catch (e) { /* empty */ }\n  if ('get' in Attributes || 'set' in Attributes) throw TypeError('Accessors not supported!');\n  if ('value' in Attributes) O[P] = Attributes.value;\n  return O;\n};\n","// Thank's IE8 for his funny defineProperty\nmodule.exports = !require('./_fails')(function () {\n  return Object.defineProperty({}, 'a', { get: function () { return 7; } }).a != 7;\n});\n","function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    module.exports = _typeof = function _typeof(obj) {\n      return typeof obj;\n    };\n  } else {\n    module.exports = _typeof = function _typeof(obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n  }\n\n  return _typeof(obj);\n}\n\nmodule.exports = _typeof;","var isObject = require('./_is-object');\nmodule.exports = function (it) {\n  if (!isObject(it)) throw TypeError(it + ' is not an object!');\n  return it;\n};\n","var hasOwnProperty = {}.hasOwnProperty;\nmodule.exports = function (it, key) {\n  return hasOwnProperty.call(it, key);\n};\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nObject.defineProperty(exports, \"standardizeConfig\", {\n  enumerable: true,\n  get: function get() {\n    return _standardizeConfig[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"ServiceProvider\", {\n  enumerable: true,\n  get: function get() {\n    return _ServiceProvider[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"Container\", {\n  enumerable: true,\n  get: function get() {\n    return _Container[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"LocalService\", {\n  enumerable: true,\n  get: function get() {\n    return _LocalService[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"PublicService\", {\n  enumerable: true,\n  get: function get() {\n    return _PublicService[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"PrivateService\", {\n  enumerable: true,\n  get: function get() {\n    return _PrivateService[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"ServiceManager\", {\n  enumerable: true,\n  get: function get() {\n    return _ServiceManager[\"default\"];\n  }\n});\nObject.defineProperty(exports, \"StateMachine\", {\n  enumerable: true,\n  get: function get() {\n    return _StateMachine[\"default\"];\n  }\n});\n\nvar _standardizeConfig = _interopRequireDefault(require(\"./standardizeConfig\"));\n\nvar _ServiceProvider = _interopRequireDefault(require(\"./ServiceProvider\"));\n\nvar _Container = _interopRequireDefault(require(\"./Container\"));\n\nvar _LocalService = _interopRequireDefault(require(\"./LocalService\"));\n\nvar _PublicService = _interopRequireDefault(require(\"./PublicService\"));\n\nvar _PrivateService = _interopRequireDefault(require(\"./PrivateService\"));\n\nvar _ServiceManager = _interopRequireDefault(require(\"./ServiceManager\"));\n\nvar _StateMachine = _interopRequireDefault(require(\"./StateMachine\"));","var dP = require('./_object-dp');\nvar createDesc = require('./_property-desc');\nmodule.exports = require('./_descriptors') ? function (object, key, value) {\n  return dP.f(object, key, createDesc(1, value));\n} : function (object, key, value) {\n  object[key] = value;\n  return object;\n};\n","module.exports = function (it) {\n  return typeof it === 'object' ? it !== null : typeof it === 'function';\n};\n","module.exports = function (exec) {\n  try {\n    return !!exec();\n  } catch (e) {\n    return true;\n  }\n};\n","// to indexed object, toObject with fallback for non-array-like ES3 strings\nvar IObject = require('./_iobject');\nvar defined = require('./_defined');\nmodule.exports = function (it) {\n  return IObject(defined(it));\n};\n","var arrayWithHoles = require(\"./arrayWithHoles\");\n\nvar iterableToArrayLimit = require(\"./iterableToArrayLimit\");\n\nvar unsupportedIterableToArray = require(\"./unsupportedIterableToArray\");\n\nvar nonIterableRest = require(\"./nonIterableRest\");\n\nfunction _slicedToArray(arr, i) {\n  return arrayWithHoles(arr) || iterableToArrayLimit(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();\n}\n\nmodule.exports = _slicedToArray;","import { createGetCurrency } from '@makerdao/currency';\nimport BigNumber from 'bignumber.js';\nimport { MKR, STAGING_MAINNET_URL, KOVAN_URL, MAINNET_URL } from './constants';\n\n/**\n * @desc get network name\n * @param  {Number|String} id\n * @return {String}\n */\nexport const netIdToName = id => {\n  switch (parseInt(id, 10)) {\n    case 1:\n      return 'mainnet';\n    case 42:\n      return 'kovan';\n    case 999:\n      return 'ganache';\n    default:\n      return '';\n  }\n};\n\nexport const netIdtoSpockUrl = id => {\n  switch (parseInt(id, 10)) {\n    case 1:\n      return MAINNET_URL;\n    case 42:\n      return KOVAN_URL;\n    default:\n      return STAGING_MAINNET_URL;\n  }\n};\n\nexport const netIdtoSpockUrlStaging = id => {\n  switch (parseInt(id, 10)) {\n    case 1:\n      return STAGING_MAINNET_URL;\n    case 42:\n      return KOVAN_URL;\n    default:\n      return STAGING_MAINNET_URL;\n  }\n};\n\nexport const getCurrency = createGetCurrency({ MKR });\n\nexport const paddedArray = (k, value) =>\n  Array.from({ length: k })\n    .map(() => 0)\n    .concat(...value);\n\nexport const toBuffer = (number, opts) => {\n  let buf;\n  let len;\n  let endian;\n  let hex = new BigNumber(number).toString(16);\n  let size;\n  let hx;\n\n  if (!opts) {\n    opts = {};\n  }\n\n  endian = { 1: 'big', '-1': 'little' }[opts.endian] || opts.endian || 'big';\n\n  if (hex.charAt(0) === '-') {\n    throw new Error('Converting negative numbers to Buffers not supported yet');\n  }\n\n  size = opts.size === 'auto' ? Math.ceil(hex.length / 2) : opts.size || 1;\n\n  len = Math.ceil(hex.length / (2 * size)) * size;\n  buf = Buffer.alloc(len);\n\n  // Zero-pad the hex string so the chunks are all `size` long\n  while (hex.length < 2 * len) {\n    hex = `0${hex}`;\n  }\n\n  hx = hex.split(new RegExp(`(.{${2 * size}})`)).filter(s => s.length > 0);\n\n  hx.forEach((chunk, i) => {\n    for (var j = 0; j < size; j++) {\n      var ix = i * size + (endian === 'big' ? j : size - j - 1);\n      buf[ix] = parseInt(chunk.slice(j * 2, j * 2 + 2), 16);\n    }\n  });\n\n  return buf;\n};\n\nexport const fromBuffer = (buf, opts) => {\n  if (!opts) {\n    opts = {};\n  }\n\n  var endian =\n    { 1: 'big', '-1': 'little' }[opts.endian] || opts.endian || 'big';\n\n  var size = opts.size === 'auto' ? Math.ceil(buf.length) : opts.size || 1;\n\n  if (buf.length % size !== 0) {\n    throw new RangeError(\n      `Buffer length (${buf.length}) must be a multiple of size (${size})`\n    );\n  }\n\n  var hex = [];\n  for (var i = 0; i < buf.length; i += size) {\n    var chunk = [];\n    for (var j = 0; j < size; j++) {\n      chunk.push(buf[i + (endian === 'big' ? j : size - j - 1)]);\n    }\n\n    hex.push(chunk.map(c => (c < 16 ? '0' : '') + c.toString(16)).join(''));\n  }\n\n  return new BigNumber(hex.join(''), 16);\n};\n","function _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n\nmodule.exports = _defineProperty;","module.exports = function (bitmap, value) {\n  return {\n    enumerable: !(bitmap & 1),\n    configurable: !(bitmap & 2),\n    writable: !(bitmap & 4),\n    value: value\n  };\n};\n","// 7.1.13 ToObject(argument)\nvar defined = require('./_defined');\nmodule.exports = function (it) {\n  return Object(defined(it));\n};\n","module.exports = {};\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.serviceTypeTransitions = exports[\"default\"] = void 0;\n\nvar _ServiceState = _interopRequireDefault(require(\"./ServiceState\"));\n\nvar ServiceType = {\n  LOCAL: 'LOCAL',\n  PUBLIC: 'PUBLIC',\n  PRIVATE: 'PRIVATE'\n};\nexports[\"default\"] = ServiceType;\nvar localServiceLifeCycle = {\n  CREATED: [_ServiceState[\"default\"].INITIALIZING],\n  INITIALIZING: [_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].READY],\n  READY: [_ServiceState[\"default\"].ERROR],\n  ERROR: []\n};\nvar publicServiceLifeCycle = {\n  CREATED: [_ServiceState[\"default\"].INITIALIZING],\n  INITIALIZING: [_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].OFFLINE],\n  OFFLINE: [_ServiceState[\"default\"].CONNECTING],\n  CONNECTING: [_ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].READY],\n  READY: [_ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].ERROR],\n  ERROR: []\n};\nvar privateServiceLifeCycle = {\n  CREATED: [_ServiceState[\"default\"].INITIALIZING],\n  INITIALIZING: [_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].OFFLINE],\n  OFFLINE: [_ServiceState[\"default\"].CONNECTING],\n  CONNECTING: [_ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].ONLINE],\n  ONLINE: [_ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].AUTHENTICATING],\n  AUTHENTICATING: [_ServiceState[\"default\"].ONLINE, _ServiceState[\"default\"].READY],\n  READY: [_ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].ONLINE, _ServiceState[\"default\"].ERROR],\n  ERROR: []\n};\nvar serviceTypeTransitions = {\n  LOCAL: localServiceLifeCycle,\n  PUBLIC: publicServiceLifeCycle,\n  PRIVATE: privateServiceLifeCycle\n};\nexports.serviceTypeTransitions = serviceTypeTransitions;","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nmodule.exports = root;\n","// 19.1.2.14 / 15.2.3.14 Object.keys(O)\nvar $keys = require('./_object-keys-internal');\nvar enumBugKeys = require('./_enum-bug-keys');\n\nmodule.exports = Object.keys || function keys(O) {\n  return $keys(O, enumBugKeys);\n};\n","module.exports = true;\n","var id = 0;\nvar px = Math.random();\nmodule.exports = function (key) {\n  return 'Symbol('.concat(key === undefined ? '' : key, ')_', (++id + px).toString(36));\n};\n","exports.f = {}.propertyIsEnumerable;\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _ServiceManager = _interopRequireDefault(require(\"./ServiceManager\"));\n\nvar _ServiceType = _interopRequireDefault(require(\"./ServiceType\"));\n\nvar _ServiceState = _interopRequireDefault(require(\"./ServiceState\"));\n\n/**\n * @param {string} type\n * @private\n */\nfunction _defineLifeCycleMethods(type) {\n  if (typeof this.initialize === 'undefined') {\n    this.initialize = function () {};\n  }\n\n  if (type !== _ServiceType[\"default\"].LOCAL) {\n    if (typeof this.connect === 'undefined') {\n      this.connect = function () {};\n    }\n\n    this.disconnect = function () {};\n  }\n\n  if (type === _ServiceType[\"default\"].PRIVATE) {\n    if (typeof this.authenticate === 'undefined') {\n      this.authenticate = function () {};\n    }\n\n    this.deauthenticate = function () {};\n  }\n}\n/**\n * @param {string} type\n * @param {string} name\n * @param {string[]} dependencies\n * @returns {ServiceManager}\n * @private\n */\n\n\nfunction _buildServiceManager(type, name, dependencies) {\n  var _this = this;\n\n  var connect = type === _ServiceType[\"default\"].LOCAL ? null : function (disconnect) {\n    _this.disconnect = disconnect;\n    return _this.connect();\n  };\n  var auth = type !== _ServiceType[\"default\"].PRIVATE ? null : function (deauthenticate) {\n    _this.deauthenticate = deauthenticate;\n    return _this.authenticate();\n  };\n  return new _ServiceManager[\"default\"](name, dependencies, function (settings) {\n    return _this.initialize(settings);\n  }, connect, auth);\n}\n/**\n * @param {ServiceManager} mgr\n * @private\n */\n\n\nfunction _installLifeCycleHooks(mgr) {\n  var _this2 = this;\n\n  mgr.onInitialized(function () {\n    if (mgr.type() !== _ServiceType[\"default\"].LOCAL) {\n      mgr.dependencies().forEach(function (d) {\n        _this2.get(d).manager().onDisconnected(function () {\n          return _this2.disconnect();\n        });\n      });\n    }\n\n    if (mgr.type() === _ServiceType[\"default\"].PRIVATE) {\n      mgr.dependencies().forEach(function (d) {\n        _this2.get(d).manager().onDeauthenticated(function () {\n          return _this2.deauthenticate();\n        });\n      });\n    }\n  });\n}\n/**\n * @private\n */\n\n\nfunction _guardLifeCycleMethods() {\n  var original = {\n    initialize: this.initialize,\n    connect: this.connect,\n    authenticate: this.authenticate\n  };\n\n  this.initialize = function (settings) {\n    if (this.manager().state() !== _ServiceState[\"default\"].INITIALIZING) {\n      throw new Error('Expected state INITIALIZING, but got ' + this.manager().state() + '. Did you mean to call service.manager().initialize() instead of service.initialize()?');\n    }\n\n    return original.initialize.apply(this, [settings]);\n  };\n\n  if (typeof original.connect !== 'undefined') {\n    this.connect = function () {\n      if (this.manager().state() !== _ServiceState[\"default\"].CONNECTING) {\n        throw new Error('Expected state CONNECTING, but got ' + this.manager().state() + '. Did you mean to call service.manager().connect() instead of service.connect()?');\n      }\n\n      return original.connect.apply(this);\n    };\n  }\n\n  if (typeof original.authenticate !== 'undefined') {\n    this.authenticate = function () {\n      if (this.manager().state() !== _ServiceState[\"default\"].AUTHENTICATING) {\n        throw new Error('Expected state AUTHENTICATING, but got ' + this.manager().state() + '. Did you mean to call service.manager().authenticate() instead of service.authenticate()?');\n      }\n\n      return original.authenticate.apply(this);\n    };\n  }\n}\n\nvar ServiceBase = /*#__PURE__*/function () {\n  /**\n   * @param {string} type\n   * @param {string} name\n   * @param {string[]} dependencies\n   */\n  function ServiceBase(type, name) {\n    var dependencies = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];\n    (0, _classCallCheck2[\"default\"])(this, ServiceBase);\n    if (!name) name = this.constructor.role;\n\n    if (this.constructor.dependencies) {\n      dependencies = this.constructor.dependencies;\n    }\n\n    if (typeof _ServiceType[\"default\"][type] === 'undefined') {\n      throw new Error('Invalid ServiceType: ' + type);\n    }\n\n    _defineLifeCycleMethods.call(this, type);\n\n    this._serviceManager = _buildServiceManager.call(this, type, name, dependencies);\n\n    _installLifeCycleHooks.call(this, this._serviceManager);\n\n    _guardLifeCycleMethods.call(this);\n  }\n  /**\n   * @returns {ServiceManager}\n   */\n\n\n  (0, _createClass2[\"default\"])(ServiceBase, [{\n    key: \"manager\",\n    value: function manager() {\n      return this._serviceManager;\n    }\n    /**\n     * @param {string} dependency\n     * @returns {ServiceBase}\n     */\n\n  }, {\n    key: \"get\",\n    value: function get(dependency) {\n      return this._serviceManager.dependency(dependency);\n    }\n  }]);\n  return ServiceBase;\n}();\n\nvar _default = ServiceBase;\nexports[\"default\"] = _default;","var getNative = require('./_getNative');\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nmodule.exports = nativeCreate;\n","var Symbol = require('./_Symbol'),\n    getRawTag = require('./_getRawTag'),\n    objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n","var eq = require('./eq');\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = assocIndexOf;\n","var isKeyable = require('./_isKeyable');\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nmodule.exports = getMapData;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","// optional / simple context binding\nvar aFunction = require('./_a-function');\nmodule.exports = function (fn, that, length) {\n  aFunction(fn);\n  if (that === undefined) return fn;\n  switch (length) {\n    case 1: return function (a) {\n      return fn.call(that, a);\n    };\n    case 2: return function (a, b) {\n      return fn.call(that, a, b);\n    };\n    case 3: return function (a, b, c) {\n      return fn.call(that, a, b, c);\n    };\n  }\n  return function (/* ...args */) {\n    return fn.apply(that, arguments);\n  };\n};\n","// 7.1.1 ToPrimitive(input [, PreferredType])\nvar isObject = require('./_is-object');\n// instead of the ES6 spec version, we didn't implement @@toPrimitive case\n// and the second argument - flag - preferred type is a string\nmodule.exports = function (it, S) {\n  if (!isObject(it)) return it;\n  var fn, val;\n  if (S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it))) return val;\n  if (typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it))) return val;\n  if (!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it))) return val;\n  throw TypeError(\"Can't convert object to primitive value\");\n};\n","var toString = {}.toString;\n\nmodule.exports = function (it) {\n  return toString.call(it).slice(8, -1);\n};\n","// 7.2.1 RequireObjectCoercible(argument)\nmodule.exports = function (it) {\n  if (it == undefined) throw TypeError(\"Can't call method on  \" + it);\n  return it;\n};\n","// 7.1.4 ToInteger\nvar ceil = Math.ceil;\nvar floor = Math.floor;\nmodule.exports = function (it) {\n  return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it);\n};\n","var shared = require('./_shared')('keys');\nvar uid = require('./_uid');\nmodule.exports = function (key) {\n  return shared[key] || (shared[key] = uid(key));\n};\n","var core = require('./_core');\nvar global = require('./_global');\nvar SHARED = '__core-js_shared__';\nvar store = global[SHARED] || (global[SHARED] = {});\n\n(module.exports = function (key, value) {\n  return store[key] || (store[key] = value !== undefined ? value : {});\n})('versions', []).push({\n  version: core.version,\n  mode: require('./_library') ? 'pure' : 'global',\n  copyright: '© 2019 Denis Pushkarev (zloirock.ru)'\n});\n","// IE 8- don't enum bug keys\nmodule.exports = (\n  'constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf'\n).split(',');\n","exports.f = Object.getOwnPropertySymbols;\n","'use strict';\nvar $at = require('./_string-at')(true);\n\n// 21.1.3.27 String.prototype[@@iterator]()\nrequire('./_iter-define')(String, 'String', function (iterated) {\n  this._t = String(iterated); // target\n  this._i = 0;                // next index\n// 21.1.5.2.1 %StringIteratorPrototype%.next()\n}, function () {\n  var O = this._t;\n  var index = this._i;\n  var point;\n  if (index >= O.length) return { value: undefined, done: true };\n  point = $at(O, index);\n  this._i += point.length;\n  return { value: point, done: false };\n});\n","// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\nvar anObject = require('./_an-object');\nvar dPs = require('./_object-dps');\nvar enumBugKeys = require('./_enum-bug-keys');\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\nvar Empty = function () { /* empty */ };\nvar PROTOTYPE = 'prototype';\n\n// Create object with fake `null` prototype: use iframe Object with cleared prototype\nvar createDict = function () {\n  // Thrash, waste and sodomy: IE GC bug\n  var iframe = require('./_dom-create')('iframe');\n  var i = enumBugKeys.length;\n  var lt = '<';\n  var gt = '>';\n  var iframeDocument;\n  iframe.style.display = 'none';\n  require('./_html').appendChild(iframe);\n  iframe.src = 'javascript:'; // eslint-disable-line no-script-url\n  // createDict = iframe.contentWindow.Object;\n  // html.removeChild(iframe);\n  iframeDocument = iframe.contentWindow.document;\n  iframeDocument.open();\n  iframeDocument.write(lt + 'script' + gt + 'document.F=Object' + lt + '/script' + gt);\n  iframeDocument.close();\n  createDict = iframeDocument.F;\n  while (i--) delete createDict[PROTOTYPE][enumBugKeys[i]];\n  return createDict();\n};\n\nmodule.exports = Object.create || function create(O, Properties) {\n  var result;\n  if (O !== null) {\n    Empty[PROTOTYPE] = anObject(O);\n    result = new Empty();\n    Empty[PROTOTYPE] = null;\n    // add \"__proto__\" for Object.getPrototypeOf polyfill\n    result[IE_PROTO] = O;\n  } else result = createDict();\n  return Properties === undefined ? result : dPs(result, Properties);\n};\n","var def = require('./_object-dp').f;\nvar has = require('./_has');\nvar TAG = require('./_wks')('toStringTag');\n\nmodule.exports = function (it, tag, stat) {\n  if (it && !has(it = stat ? it : it.prototype, TAG)) def(it, TAG, { configurable: true, value: tag });\n};\n","exports.f = require('./_wks');\n","var global = require('./_global');\nvar core = require('./_core');\nvar LIBRARY = require('./_library');\nvar wksExt = require('./_wks-ext');\nvar defineProperty = require('./_object-dp').f;\nmodule.exports = function (name) {\n  var $Symbol = core.Symbol || (core.Symbol = LIBRARY ? {} : global.Symbol || {});\n  if (name.charAt(0) != '_' && !(name in $Symbol)) defineProperty($Symbol, name, { value: wksExt.f(name) });\n};\n","function _setPrototypeOf(o, p) {\n  module.exports = _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n\n  return _setPrototypeOf(o, p);\n}\n\nmodule.exports = _setPrototypeOf;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.DependencyNotResolvedError = exports.UnknownDependencyError = exports.InvalidServiceError = exports[\"default\"] = void 0;\n\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\n\nvar _get2 = _interopRequireDefault(require(\"@babel/runtime/helpers/get\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _wrapNativeSuper2 = _interopRequireDefault(require(\"@babel/runtime/helpers/wrapNativeSuper\"));\n\nvar _ServiceManagerBase2 = _interopRequireDefault(require(\"./ServiceManagerBase\"));\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\n/**\n *\n */\nvar InvalidServiceError = /*#__PURE__*/function (_Error) {\n  (0, _inherits2[\"default\"])(InvalidServiceError, _Error);\n\n  var _super = _createSuper(InvalidServiceError);\n\n  function InvalidServiceError(message) {\n    (0, _classCallCheck2[\"default\"])(this, InvalidServiceError);\n    return _super.call(this, message);\n  }\n\n  return InvalidServiceError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n/**\n *\n */\n\n\nexports.InvalidServiceError = InvalidServiceError;\n\nvar UnknownDependencyError = /*#__PURE__*/function (_Error2) {\n  (0, _inherits2[\"default\"])(UnknownDependencyError, _Error2);\n\n  var _super2 = _createSuper(UnknownDependencyError);\n\n  function UnknownDependencyError(service, dependency) {\n    (0, _classCallCheck2[\"default\"])(this, UnknownDependencyError);\n    return _super2.call(this, 'Injected service ' + dependency + ' is not a dependency of ' + service);\n  }\n\n  return UnknownDependencyError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n/**\n *\n */\n\n\nexports.UnknownDependencyError = UnknownDependencyError;\n\nvar DependencyNotResolvedError = /*#__PURE__*/function (_Error3) {\n  (0, _inherits2[\"default\"])(DependencyNotResolvedError, _Error3);\n\n  var _super3 = _createSuper(DependencyNotResolvedError);\n\n  function DependencyNotResolvedError(service, dependency) {\n    (0, _classCallCheck2[\"default\"])(this, DependencyNotResolvedError);\n    return _super3.call(this, 'Dependency ' + dependency + ' of service ' + service + ' is unavailable.');\n  }\n\n  return DependencyNotResolvedError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n/**\n * @param callback\n * @returns {Promise}\n * @private\n */\n\n\nexports.DependencyNotResolvedError = DependencyNotResolvedError;\n\nfunction _waitForDependencies(callback) {\n  return Promise.all(this.dependencies().map(function (dependency) {\n    return callback(dependency);\n  }));\n}\n/**\n *\n */\n\n\nvar ServiceManager = /*#__PURE__*/function (_ServiceManagerBase) {\n  (0, _inherits2[\"default\"])(ServiceManager, _ServiceManagerBase);\n\n  var _super4 = _createSuper(ServiceManager);\n\n  (0, _createClass2[\"default\"])(ServiceManager, null, [{\n    key: \"isValidService\",\n\n    /**\n     * @param {*} service\n     * @returns {boolean}\n     */\n    value: function isValidService(service) {\n      return service !== null && (0, _typeof2[\"default\"])(service) === 'object' && typeof service.manager === 'function';\n    }\n    /**\n     * @param {string} name\n     * @param {string[]} dependencies\n     * @param {function|null} init\n     * @param {function|null} connect\n     * @param {function|null} auth\n     */\n\n  }]);\n\n  function ServiceManager(name) {\n    var _this;\n\n    var dependencies = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n    var init = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;\n    var connect = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : null;\n    var auth = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : null;\n    (0, _classCallCheck2[\"default\"])(this, ServiceManager);\n    _this = _super4.call(this, init, connect, auth);\n\n    if (!name) {\n      throw new Error('Service name must not be empty.');\n    }\n\n    _this._name = name;\n    _this._dependencies = dependencies;\n    _this._injections = {};\n    dependencies.forEach(function (d) {\n      return _this._injections[d] = null;\n    });\n    return _this;\n  }\n\n  (0, _createClass2[\"default\"])(ServiceManager, [{\n    key: \"name\",\n    value: function name() {\n      return this._name;\n    }\n  }, {\n    key: \"dependencies\",\n    value: function dependencies() {\n      return this._dependencies;\n    }\n  }, {\n    key: \"inject\",\n    value: function inject(dependency, service) {\n      if (typeof this._injections[dependency] === 'undefined') {\n        throw new UnknownDependencyError(this.name(), dependency);\n      }\n\n      if (!ServiceManager.isValidService(service)) {\n        throw new InvalidServiceError('Cannot inject invalid service in ' + this.name());\n      }\n\n      this._injections[dependency] = service;\n      return this;\n    }\n  }, {\n    key: \"dependency\",\n    value: function dependency(name) {\n      if (!this._injections[name]) {\n        throw new DependencyNotResolvedError(this.name(), name);\n      }\n\n      return this._injections[name];\n    }\n  }, {\n    key: \"initialize\",\n    value: function initialize() {\n      var _this2 = this;\n\n      return this.initializeDependencies().then(function () {\n        return (0, _get2[\"default\"])((0, _getPrototypeOf2[\"default\"])(ServiceManager.prototype), \"initialize\", _this2).call(_this2, _this2._settings);\n      });\n    }\n  }, {\n    key: \"connect\",\n    value: function connect() {\n      var _this3 = this;\n\n      return this.connectDependencies().then(function () {\n        return (0, _get2[\"default\"])((0, _getPrototypeOf2[\"default\"])(ServiceManager.prototype), \"connect\", _this3).call(_this3);\n      });\n    }\n  }, {\n    key: \"authenticate\",\n    value: function authenticate() {\n      var _this4 = this;\n\n      return this.authenticateDependencies().then(function () {\n        return (0, _get2[\"default\"])((0, _getPrototypeOf2[\"default\"])(ServiceManager.prototype), \"authenticate\", _this4).call(_this4);\n      });\n    }\n  }, {\n    key: \"initializeDependencies\",\n    value: function initializeDependencies() {\n      var _this5 = this;\n\n      return _waitForDependencies.call(this, function (d) {\n        return _this5.dependency(d).manager().initialize();\n      });\n    }\n  }, {\n    key: \"connectDependencies\",\n    value: function connectDependencies() {\n      var _this6 = this;\n\n      return _waitForDependencies.call(this, function (d) {\n        return _this6.dependency(d).manager().connect();\n      });\n    }\n  }, {\n    key: \"authenticateDependencies\",\n    value: function authenticateDependencies() {\n      var _this7 = this;\n\n      return _waitForDependencies.call(this, function (d) {\n        return _this7.dependency(d).manager().authenticate();\n      });\n    }\n  }, {\n    key: \"createService\",\n    value: function createService() {\n      var _this8 = this;\n\n      return {\n        manager: function manager() {\n          return _this8;\n        }\n      };\n    }\n  }]);\n  return ServiceManager;\n}(_ServiceManagerBase2[\"default\"]);\n\nexports[\"default\"] = ServiceManager;","var getPrototypeOf = require(\"./getPrototypeOf\");\n\nvar setPrototypeOf = require(\"./setPrototypeOf\");\n\nvar isNativeFunction = require(\"./isNativeFunction\");\n\nvar construct = require(\"./construct\");\n\nfunction _wrapNativeSuper(Class) {\n  var _cache = typeof Map === \"function\" ? new Map() : undefined;\n\n  module.exports = _wrapNativeSuper = function _wrapNativeSuper(Class) {\n    if (Class === null || !isNativeFunction(Class)) return Class;\n\n    if (typeof Class !== \"function\") {\n      throw new TypeError(\"Super expression must either be null or a function\");\n    }\n\n    if (typeof _cache !== \"undefined\") {\n      if (_cache.has(Class)) return _cache.get(Class);\n\n      _cache.set(Class, Wrapper);\n    }\n\n    function Wrapper() {\n      return construct(Class, arguments, getPrototypeOf(this).constructor);\n    }\n\n    Wrapper.prototype = Object.create(Class.prototype, {\n      constructor: {\n        value: Wrapper,\n        enumerable: false,\n        writable: true,\n        configurable: true\n      }\n    });\n    return setPrototypeOf(Wrapper, Class);\n  };\n\n  return _wrapNativeSuper(Class);\n}\n\nmodule.exports = _wrapNativeSuper;","var _typeof = require(\"../helpers/typeof\");\n\nfunction _getRequireWildcardCache() {\n  if (typeof WeakMap !== \"function\") return null;\n  var cache = new WeakMap();\n\n  _getRequireWildcardCache = function _getRequireWildcardCache() {\n    return cache;\n  };\n\n  return cache;\n}\n\nfunction _interopRequireWildcard(obj) {\n  if (obj && obj.__esModule) {\n    return obj;\n  }\n\n  if (obj === null || _typeof(obj) !== \"object\" && typeof obj !== \"function\") {\n    return {\n      \"default\": obj\n    };\n  }\n\n  var cache = _getRequireWildcardCache();\n\n  if (cache && cache.has(obj)) {\n    return cache.get(obj);\n  }\n\n  var newObj = {};\n  var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor;\n\n  for (var key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null;\n\n      if (desc && (desc.get || desc.set)) {\n        Object.defineProperty(newObj, key, desc);\n      } else {\n        newObj[key] = obj[key];\n      }\n    }\n  }\n\n  newObj[\"default\"] = obj;\n\n  if (cache) {\n    cache.set(obj, newObj);\n  }\n\n  return newObj;\n}\n\nmodule.exports = _interopRequireWildcard;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\nvar ServiceState = {\n  CREATED: 'CREATED',\n  INITIALIZING: 'INITIALIZING',\n  OFFLINE: 'OFFLINE',\n  CONNECTING: 'CONNECTING',\n  ONLINE: 'ONLINE',\n  AUTHENTICATING: 'AUTHENTICATING',\n  READY: 'READY',\n  ERROR: 'ERROR'\n};\nvar _default = ServiceState;\nexports[\"default\"] = _default;","var baseIsNative = require('./_baseIsNative'),\n    getValue = require('./_getValue');\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n","var arrayWithoutHoles = require(\"./arrayWithoutHoles\");\n\nvar iterableToArray = require(\"./iterableToArray\");\n\nvar unsupportedIterableToArray = require(\"./unsupportedIterableToArray\");\n\nvar nonIterableSpread = require(\"./nonIterableSpread\");\n\nfunction _toConsumableArray(arr) {\n  return arrayWithoutHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableSpread();\n}\n\nmodule.exports = _toConsumableArray;","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsZWJ = '\\\\u200d';\n\n/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n/**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\nfunction hasUnicode(string) {\n  return reHasUnicode.test(string);\n}\n\nmodule.exports = hasUnicode;\n","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createGetCurrency = exports.Currency = undefined;\n\nvar _assign = require('babel-runtime/core-js/object/assign');\n\nvar _assign2 = _interopRequireDefault(_assign);\n\nvar _getPrototypeOf = require('babel-runtime/core-js/object/get-prototype-of');\n\nvar _getPrototypeOf2 = _interopRequireDefault(_getPrototypeOf);\n\nvar _classCallCheck2 = require('babel-runtime/helpers/classCallCheck');\n\nvar _classCallCheck3 = _interopRequireDefault(_classCallCheck2);\n\nvar _possibleConstructorReturn2 = require('babel-runtime/helpers/possibleConstructorReturn');\n\nvar _possibleConstructorReturn3 = _interopRequireDefault(_possibleConstructorReturn2);\n\nvar _inherits2 = require('babel-runtime/helpers/inherits');\n\nvar _inherits3 = _interopRequireDefault(_inherits2);\n\nexports.createCurrency = createCurrency;\nexports.createCurrencyRatio = createCurrencyRatio;\n\nvar _Currency2 = require('./Currency');\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar Currency = exports.Currency = _Currency2.Currency;\n\nfunction createCurrency(symbol) {\n  // This provides short syntax, e.g. ETH(6). We need a wrapper function because\n  // you can't call an ES6 class consructor without `new`\n  var creatorFn = function creatorFn(amount, shift) {\n    return new CurrencyX(amount, shift);\n  };\n\n  var CurrencyX = function (_Currency) {\n    (0, _inherits3.default)(CurrencyX, _Currency);\n\n    function CurrencyX(amount, shift) {\n      (0, _classCallCheck3.default)(this, CurrencyX);\n\n      var _this = (0, _possibleConstructorReturn3.default)(this, (CurrencyX.__proto__ || (0, _getPrototypeOf2.default)(CurrencyX)).call(this, amount, shift));\n\n      _this.symbol = symbol;\n\n      // this.type can be used an alternative to `this.constructor` when you\n      // want to use the short syntax, e.g.:\n      //\n      //   var foo = ETH(1);\n      //   var bar = foo.type(2);\n      //   assert(foo.plus(bar).eq(ETH(3)));\n      //\n      _this.type = creatorFn;\n      return _this;\n    }\n\n    return CurrencyX;\n  }(Currency);\n\n  // this changes the name of the class in stack traces\n\n\n  Object.defineProperty(CurrencyX, 'name', { value: symbol });\n  Object.defineProperty(CurrencyX, 'symbol', { value: symbol });\n\n  (0, _assign2.default)(creatorFn, {\n    wei: makeShiftedCreatorFn(creatorFn, symbol, 'wei'),\n    ray: makeShiftedCreatorFn(creatorFn, symbol, 'ray'),\n    rad: makeShiftedCreatorFn(creatorFn, symbol, 'rad'),\n    symbol: symbol,\n    isInstance: function isInstance(obj) {\n      return obj instanceof CurrencyX;\n    }\n  });\n\n  (0, _assign2.default)(CurrencyX, { wei: creatorFn.wei, ray: creatorFn.ray });\n  return creatorFn;\n}\n\nfunction createCurrencyRatio(wrappedNumerator, wrappedDenominator) {\n  var numerator = wrappedNumerator(0).constructor;\n  var denominator = wrappedDenominator(0).constructor;\n\n  var creatorFn = function creatorFn(amount, shift) {\n    return new _Currency2.CurrencyRatio(amount, numerator, denominator, shift);\n  };\n\n  var symbol = numerator.symbol + '/' + denominator.symbol;\n\n  (0, _assign2.default)(creatorFn, {\n    wei: makeShiftedCreatorFn(creatorFn, symbol, 'wei'),\n    ray: makeShiftedCreatorFn(creatorFn, symbol, 'ray'),\n    rad: makeShiftedCreatorFn(creatorFn, symbol, 'rad'),\n    symbol: symbol,\n    isInstance: function isInstance(obj) {\n      return obj instanceof _Currency2.CurrencyRatio && obj.symbol === symbol;\n    }\n  });\n\n  return creatorFn;\n}\n\nfunction makeShiftedCreatorFn(creatorFn, symbol, shift) {\n  var fn = function fn(amount) {\n    return creatorFn(amount, shift);\n  };\n  // these two properties are used by getCurrency\n  fn.symbol = symbol;\n  fn.shift = shift;\n  return fn;\n}\n\n/*\nthis factory function produces a function that will check input values against a\nwhitelist; it's useful if you want to accept a variety of inputs, e.g.:\n\n  foo(ETH(1))\n  foo(1, ETH)\n  foo(1)      // if you set a default unit argument\n  foo('1')    // if you set a default unit argument\n*/\nvar createGetCurrency = exports.createGetCurrency = function createGetCurrency(currencies) {\n  return function (amount, unit) {\n    if (amount instanceof Currency) return amount;\n    if (!unit) throw new Error('Amount is not a Currency');\n    var key = typeof unit === 'string' ? unit.toUpperCase() : unit.symbol;\n    var ctor = currencies[key];\n    if (!ctor) {\n      throw new Error('Couldn\\'t find currency for \"' + key + '\"');\n    }\n    return ctor(amount, unit.shift);\n  };\n};","module.exports = { \"default\": require(\"core-js/library/fn/object/assign\"), __esModule: true };","module.exports = !require('./_descriptors') && !require('./_fails')(function () {\n  return Object.defineProperty(require('./_dom-create')('div'), 'a', { get: function () { return 7; } }).a != 7;\n});\n","var isObject = require('./_is-object');\nvar document = require('./_global').document;\n// typeof document.createElement is 'object' in old IE\nvar is = isObject(document) && isObject(document.createElement);\nmodule.exports = function (it) {\n  return is ? document.createElement(it) : {};\n};\n","var has = require('./_has');\nvar toIObject = require('./_to-iobject');\nvar arrayIndexOf = require('./_array-includes')(false);\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\n\nmodule.exports = function (object, names) {\n  var O = toIObject(object);\n  var i = 0;\n  var result = [];\n  var key;\n  for (key in O) if (key != IE_PROTO) has(O, key) && result.push(key);\n  // Don't enum bug & hidden keys\n  while (names.length > i) if (has(O, key = names[i++])) {\n    ~arrayIndexOf(result, key) || result.push(key);\n  }\n  return result;\n};\n","// fallback for non-array-like ES3 and non-enumerable old V8 strings\nvar cof = require('./_cof');\n// eslint-disable-next-line no-prototype-builtins\nmodule.exports = Object('z').propertyIsEnumerable(0) ? Object : function (it) {\n  return cof(it) == 'String' ? it.split('') : Object(it);\n};\n","// 7.1.15 ToLength\nvar toInteger = require('./_to-integer');\nvar min = Math.min;\nmodule.exports = function (it) {\n  return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991\n};\n","module.exports = { \"default\": require(\"core-js/library/fn/object/get-prototype-of\"), __esModule: true };","// 19.1.2.9 / 15.2.3.2 Object.getPrototypeOf(O)\nvar has = require('./_has');\nvar toObject = require('./_to-object');\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\nvar ObjectProto = Object.prototype;\n\nmodule.exports = Object.getPrototypeOf || function (O) {\n  O = toObject(O);\n  if (has(O, IE_PROTO)) return O[IE_PROTO];\n  if (typeof O.constructor == 'function' && O instanceof O.constructor) {\n    return O.constructor.prototype;\n  } return O instanceof Object ? ObjectProto : null;\n};\n","\"use strict\";\n\nexports.__esModule = true;\n\nexports.default = function (instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n};","\"use strict\";\n\nexports.__esModule = true;\n\nvar _typeof2 = require(\"../helpers/typeof\");\n\nvar _typeof3 = _interopRequireDefault(_typeof2);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.default = function (self, call) {\n  if (!self) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n\n  return call && ((typeof call === \"undefined\" ? \"undefined\" : (0, _typeof3.default)(call)) === \"object\" || typeof call === \"function\") ? call : self;\n};","\"use strict\";\n\nexports.__esModule = true;\n\nvar _iterator = require(\"../core-js/symbol/iterator\");\n\nvar _iterator2 = _interopRequireDefault(_iterator);\n\nvar _symbol = require(\"../core-js/symbol\");\n\nvar _symbol2 = _interopRequireDefault(_symbol);\n\nvar _typeof = typeof _symbol2.default === \"function\" && typeof _iterator2.default === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof _symbol2.default === \"function\" && obj.constructor === _symbol2.default && obj !== _symbol2.default.prototype ? \"symbol\" : typeof obj; };\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.default = typeof _symbol2.default === \"function\" && _typeof(_iterator2.default) === \"symbol\" ? function (obj) {\n  return typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj);\n} : function (obj) {\n  return obj && typeof _symbol2.default === \"function\" && obj.constructor === _symbol2.default && obj !== _symbol2.default.prototype ? \"symbol\" : typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj);\n};","'use strict';\nvar LIBRARY = require('./_library');\nvar $export = require('./_export');\nvar redefine = require('./_redefine');\nvar hide = require('./_hide');\nvar Iterators = require('./_iterators');\nvar $iterCreate = require('./_iter-create');\nvar setToStringTag = require('./_set-to-string-tag');\nvar getPrototypeOf = require('./_object-gpo');\nvar ITERATOR = require('./_wks')('iterator');\nvar BUGGY = !([].keys && 'next' in [].keys()); // Safari has buggy iterators w/o `next`\nvar FF_ITERATOR = '@@iterator';\nvar KEYS = 'keys';\nvar VALUES = 'values';\n\nvar returnThis = function () { return this; };\n\nmodule.exports = function (Base, NAME, Constructor, next, DEFAULT, IS_SET, FORCED) {\n  $iterCreate(Constructor, NAME, next);\n  var getMethod = function (kind) {\n    if (!BUGGY && kind in proto) return proto[kind];\n    switch (kind) {\n      case KEYS: return function keys() { return new Constructor(this, kind); };\n      case VALUES: return function values() { return new Constructor(this, kind); };\n    } return function entries() { return new Constructor(this, kind); };\n  };\n  var TAG = NAME + ' Iterator';\n  var DEF_VALUES = DEFAULT == VALUES;\n  var VALUES_BUG = false;\n  var proto = Base.prototype;\n  var $native = proto[ITERATOR] || proto[FF_ITERATOR] || DEFAULT && proto[DEFAULT];\n  var $default = $native || getMethod(DEFAULT);\n  var $entries = DEFAULT ? !DEF_VALUES ? $default : getMethod('entries') : undefined;\n  var $anyNative = NAME == 'Array' ? proto.entries || $native : $native;\n  var methods, key, IteratorPrototype;\n  // Fix native\n  if ($anyNative) {\n    IteratorPrototype = getPrototypeOf($anyNative.call(new Base()));\n    if (IteratorPrototype !== Object.prototype && IteratorPrototype.next) {\n      // Set @@toStringTag to native iterators\n      setToStringTag(IteratorPrototype, TAG, true);\n      // fix for some old engines\n      if (!LIBRARY && typeof IteratorPrototype[ITERATOR] != 'function') hide(IteratorPrototype, ITERATOR, returnThis);\n    }\n  }\n  // fix Array#{values, @@iterator}.name in V8 / FF\n  if (DEF_VALUES && $native && $native.name !== VALUES) {\n    VALUES_BUG = true;\n    $default = function values() { return $native.call(this); };\n  }\n  // Define iterator\n  if ((!LIBRARY || FORCED) && (BUGGY || VALUES_BUG || !proto[ITERATOR])) {\n    hide(proto, ITERATOR, $default);\n  }\n  // Plug for library\n  Iterators[NAME] = $default;\n  Iterators[TAG] = returnThis;\n  if (DEFAULT) {\n    methods = {\n      values: DEF_VALUES ? $default : getMethod(VALUES),\n      keys: IS_SET ? $default : getMethod(KEYS),\n      entries: $entries\n    };\n    if (FORCED) for (key in methods) {\n      if (!(key in proto)) redefine(proto, key, methods[key]);\n    } else $export($export.P + $export.F * (BUGGY || VALUES_BUG), NAME, methods);\n  }\n  return methods;\n};\n","module.exports = require('./_hide');\n","require('./es6.array.iterator');\nvar global = require('./_global');\nvar hide = require('./_hide');\nvar Iterators = require('./_iterators');\nvar TO_STRING_TAG = require('./_wks')('toStringTag');\n\nvar DOMIterables = ('CSSRuleList,CSSStyleDeclaration,CSSValueList,ClientRectList,DOMRectList,DOMStringList,' +\n  'DOMTokenList,DataTransferItemList,FileList,HTMLAllCollection,HTMLCollection,HTMLFormElement,HTMLSelectElement,' +\n  'MediaList,MimeTypeArray,NamedNodeMap,NodeList,PaintRequestList,Plugin,PluginArray,SVGLengthList,SVGNumberList,' +\n  'SVGPathSegList,SVGPointList,SVGStringList,SVGTransformList,SourceBufferList,StyleSheetList,TextTrackCueList,' +\n  'TextTrackList,TouchList').split(',');\n\nfor (var i = 0; i < DOMIterables.length; i++) {\n  var NAME = DOMIterables[i];\n  var Collection = global[NAME];\n  var proto = Collection && Collection.prototype;\n  if (proto && !proto[TO_STRING_TAG]) hide(proto, TO_STRING_TAG, NAME);\n  Iterators[NAME] = Iterators.Array;\n}\n","// 19.1.2.7 / 15.2.3.4 Object.getOwnPropertyNames(O)\nvar $keys = require('./_object-keys-internal');\nvar hiddenKeys = require('./_enum-bug-keys').concat('length', 'prototype');\n\nexports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\n  return $keys(O, hiddenKeys);\n};\n","var pIE = require('./_object-pie');\nvar createDesc = require('./_property-desc');\nvar toIObject = require('./_to-iobject');\nvar toPrimitive = require('./_to-primitive');\nvar has = require('./_has');\nvar IE8_DOM_DEFINE = require('./_ie8-dom-define');\nvar gOPD = Object.getOwnPropertyDescriptor;\n\nexports.f = require('./_descriptors') ? gOPD : function getOwnPropertyDescriptor(O, P) {\n  O = toIObject(O);\n  P = toPrimitive(P, true);\n  if (IE8_DOM_DEFINE) try {\n    return gOPD(O, P);\n  } catch (e) { /* empty */ }\n  if (has(O, P)) return createDesc(!pIE.f.call(O, P), O[P]);\n};\n","\"use strict\";\n\nexports.__esModule = true;\n\nvar _setPrototypeOf = require(\"../core-js/object/set-prototype-of\");\n\nvar _setPrototypeOf2 = _interopRequireDefault(_setPrototypeOf);\n\nvar _create = require(\"../core-js/object/create\");\n\nvar _create2 = _interopRequireDefault(_create);\n\nvar _typeof2 = require(\"../helpers/typeof\");\n\nvar _typeof3 = _interopRequireDefault(_typeof2);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.default = function (subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function, not \" + (typeof superClass === \"undefined\" ? \"undefined\" : (0, _typeof3.default)(superClass)));\n  }\n\n  subClass.prototype = (0, _create2.default)(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      enumerable: false,\n      writable: true,\n      configurable: true\n    }\n  });\n  if (superClass) _setPrototypeOf2.default ? (0, _setPrototypeOf2.default)(subClass, superClass) : subClass.__proto__ = superClass;\n};","var classof = require('./_classof');\nvar ITERATOR = require('./_wks')('iterator');\nvar Iterators = require('./_iterators');\nmodule.exports = require('./_core').getIteratorMethod = function (it) {\n  if (it != undefined) return it[ITERATOR]\n    || it['@@iterator']\n    || Iterators[classof(it)];\n};\n","var arrayLikeToArray = require(\"./arrayLikeToArray\");\n\nfunction _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);\n}\n\nmodule.exports = _unsupportedIterableToArray;","function _arrayLikeToArray(arr, len) {\n  if (len == null || len > arr.length) len = arr.length;\n\n  for (var i = 0, arr2 = new Array(len); i < len; i++) {\n    arr2[i] = arr[i];\n  }\n\n  return arr2;\n}\n\nmodule.exports = _arrayLikeToArray;","function _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n\n  return self;\n}\n\nmodule.exports = _assertThisInitialized;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = standardizeConfig;\n\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\n\nvar _ServiceBase = _interopRequireDefault(require(\"./ServiceBase\"));\n\nfunction standardizeConfig(role, config, resolver) {\n  if (config instanceof Array) {\n    if (typeof config[0] == 'boolean' && resolver) {\n      return [resolveNameForBoolean(role, config[0], resolver), config[1]];\n    }\n\n    return config;\n  }\n\n  var className,\n      settings = {};\n\n  switch ((0, _typeof2[\"default\"])(config)) {\n    case 'string':\n      // handle a string that refers to a class name\n      className = config;\n      break;\n\n    case 'function':\n      // handle a service constructor\n      className = config;\n      break;\n\n    case 'object':\n      if (config instanceof _ServiceBase[\"default\"]) {\n        // handle a service instance\n        className = config;\n      } else {\n        // handle a settings object -- use the default version\n        className = resolver ? resolveNameForBoolean(role, true, resolver) : true;\n        settings = config;\n      }\n\n      break;\n\n    case 'boolean':\n      className = resolver ? resolveNameForBoolean(role, config, resolver) : config;\n      break;\n\n    default:\n      throw new Error(\"could not parse settings for \".concat(role, \":\"), config);\n  }\n\n  return [className, settings];\n}\n\nfunction resolveNameForBoolean(role, bool, _ref) {\n  var defaults = _ref.defaults,\n      disabled = _ref.disabled;\n  var name;\n\n  if (bool) {\n    name = defaults[role];\n    if (!name) throw new Error(\"The \\\"\".concat(role, \"\\\" service has no default\"));\n  } else {\n    name = disabled[role];\n    if (!name) throw new Error(\"The \\\"\".concat(role, \"\\\" service cannot be disabled\"));\n  }\n\n  return name;\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = exports.IllegalStateError = void 0;\n\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _wrapNativeSuper2 = _interopRequireDefault(require(\"@babel/runtime/helpers/wrapNativeSuper\"));\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nvar IllegalStateError = /*#__PURE__*/function (_Error) {\n  (0, _inherits2[\"default\"])(IllegalStateError, _Error);\n\n  var _super = _createSuper(IllegalStateError);\n\n  function IllegalStateError() {\n    (0, _classCallCheck2[\"default\"])(this, IllegalStateError);\n    return _super.apply(this, arguments);\n  }\n\n  return IllegalStateError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n\nexports.IllegalStateError = IllegalStateError;\n\nvar StateMachine = /*#__PURE__*/function () {\n  function StateMachine(initialState, transitions) {\n    (0, _classCallCheck2[\"default\"])(this, StateMachine);\n\n    if ((0, _typeof2[\"default\"])(transitions) !== 'object') {\n      throw new Error('StateMachine transitions parameter must be an object.');\n    }\n\n    if (Object.keys(transitions).filter(function (k) {\n      return transitions.hasOwnProperty(k) && !(transitions[k] instanceof Array);\n    }).length > 0) {\n      throw new Error('Illegal StateMachine transition found: not an array.');\n    }\n\n    if (Object.keys(transitions).filter(function (k) {\n      return transitions.hasOwnProperty(k) && transitions[k].filter(function (s) {\n        return !transitions[s];\n      }).length > 0;\n    }).length > 0) {\n      throw new Error('Illegal StateMachine transition found: target state not in transition map.');\n    }\n\n    if (!(transitions[initialState] instanceof Array)) {\n      throw new Error('Initial state ' + initialState + ' is not set in the transitions map.');\n    }\n\n    this._state = initialState;\n    this._nextStates = transitions;\n    this._stateChangedHandlers = [];\n  }\n\n  (0, _createClass2[\"default\"])(StateMachine, [{\n    key: \"onStateChanged\",\n    value: function onStateChanged(callback) {\n      this._stateChangedHandlers.push(callback);\n    }\n  }, {\n    key: \"state\",\n    value: function state() {\n      return this._state;\n    }\n  }, {\n    key: \"inState\",\n    value: function inState(state) {\n      if (!(state instanceof Array)) {\n        state = [state];\n      }\n\n      return state.indexOf(this._state) >= 0;\n    }\n  }, {\n    key: \"assertState\",\n    value: function assertState(state) {\n      var operation = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';\n\n      if (!this.inState(state)) {\n        throw new IllegalStateError('Illegal operation for state ' + this._state + (operation.length > 0 ? ': ' + operation : ''));\n      }\n    }\n  }, {\n    key: \"transitionTo\",\n    value: function transitionTo(newState) {\n      if (this._nextStates[newState] === undefined) {\n        throw new IllegalStateError('Cannot set illegal state: ' + newState);\n      }\n\n      if (newState !== this._state) {\n        if (this._nextStates[this._state].indexOf(newState) < 0) {\n          throw new IllegalStateError('Illegal state transition: ' + this._state + ' to ' + newState);\n        }\n\n        var oldState = this._state;\n        this._state = newState;\n\n        this._stateChangedHandlers.forEach(function (cb) {\n          return cb(oldState, newState);\n        });\n      }\n\n      return this;\n    }\n  }]);\n  return StateMachine;\n}();\n\nexports[\"default\"] = StateMachine;","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","var baseUniq = require('./_baseUniq');\n\n/**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\nfunction uniq(array) {\n  return (array && array.length) ? baseUniq(array) : [];\n}\n\nmodule.exports = uniq;\n","var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nmodule.exports = setToArray;\n","\"use strict\";\n\nvar _interopRequireWildcard = require(\"@babel/runtime/helpers/interopRequireWildcard\");\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.orderServices = orderServices;\nObject.defineProperty(exports, \"InvalidServiceError\", {\n  enumerable: true,\n  get: function get() {\n    return _ServiceManager.InvalidServiceError;\n  }\n});\nexports.ServiceNotFoundError = exports.ServiceAlreadyRegisteredError = exports.ExtractedServiceError = exports[\"default\"] = void 0;\n\nvar _regenerator = _interopRequireDefault(require(\"@babel/runtime/regenerator\"));\n\nvar _asyncToGenerator2 = _interopRequireDefault(require(\"@babel/runtime/helpers/asyncToGenerator\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _wrapNativeSuper2 = _interopRequireDefault(require(\"@babel/runtime/helpers/wrapNativeSuper\"));\n\nvar _values = _interopRequireDefault(require(\"lodash/values\"));\n\nvar _uniq = _interopRequireDefault(require(\"lodash/uniq\"));\n\nvar _ServiceManager = _interopRequireWildcard(require(\"./ServiceManager\"));\n\nvar _toposort = _interopRequireDefault(require(\"toposort\"));\n\nfunction _createForOfIteratorHelper(o) { if (typeof Symbol === \"undefined\" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (o = _unsupportedIterableToArray(o))) { var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var it, normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\n\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\n\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nvar ServiceAlreadyRegisteredError = /*#__PURE__*/function (_Error) {\n  (0, _inherits2[\"default\"])(ServiceAlreadyRegisteredError, _Error);\n\n  var _super = _createSuper(ServiceAlreadyRegisteredError);\n\n  function ServiceAlreadyRegisteredError(name) {\n    (0, _classCallCheck2[\"default\"])(this, ServiceAlreadyRegisteredError);\n    // prettier-ignore\n    return _super.call(this, 'Service with name \\'' + name + '\\' is already registered with this container.');\n  }\n\n  return ServiceAlreadyRegisteredError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n\nexports.ServiceAlreadyRegisteredError = ServiceAlreadyRegisteredError;\n\nvar ServiceNotFoundError = /*#__PURE__*/function (_Error2) {\n  (0, _inherits2[\"default\"])(ServiceNotFoundError, _Error2);\n\n  var _super2 = _createSuper(ServiceNotFoundError);\n\n  function ServiceNotFoundError(name) {\n    (0, _classCallCheck2[\"default\"])(this, ServiceNotFoundError);\n    // prettier-ignore\n    return _super2.call(this, 'Service with name \\'' + name + '\\' cannot be found in this container.');\n  }\n\n  return ServiceNotFoundError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error));\n\nexports.ServiceNotFoundError = ServiceNotFoundError;\n\nvar ExtractedServiceError = /*#__PURE__*/function (_Error3) {\n  (0, _inherits2[\"default\"])(ExtractedServiceError, _Error3);\n\n  var _super3 = _createSuper(ExtractedServiceError);\n\n  function ExtractedServiceError(name) {\n    (0, _classCallCheck2[\"default\"])(this, ExtractedServiceError);\n    // prettier-ignore\n    return _super3.call(this, 'Service with name \\'' + name + '\\' has been extracted from the core dai.js library into a discrete plugin. Please refer to the documentation here to install and add it to your configuration: \\n\\n https://github.com/makerdao/dai.js/wiki/Basic-Usage-(Plugins) \\n\\n');\n  }\n\n  return ExtractedServiceError;\n}( /*#__PURE__*/(0, _wrapNativeSuper2[\"default\"])(Error)); // exported just for testing\n\n\nexports.ExtractedServiceError = ExtractedServiceError;\n\nfunction orderServices(services) {\n  var edges = [];\n  var servicesWithoutDeps = [];\n\n  var _iterator = _createForOfIteratorHelper(services),\n      _step;\n\n  try {\n    var _loop = function _loop() {\n      var service = _step.value;\n      var name = service.manager().name();\n      var depNames = service.manager().dependencies();\n\n      if (depNames.length === 0) {\n        servicesWithoutDeps.push(name);\n      } else {\n        depNames.forEach(function (dn) {\n          return edges.push([dn, name]);\n        });\n      }\n    };\n\n    for (_iterator.s(); !(_step = _iterator.n()).done;) {\n      _loop();\n    }\n  } catch (err) {\n    _iterator.e(err);\n  } finally {\n    _iterator.f();\n  }\n\n  return (0, _uniq[\"default\"])((0, _toposort[\"default\"])(edges).concat(servicesWithoutDeps));\n}\n\nvar Container = /*#__PURE__*/function () {\n  function Container() {\n    (0, _classCallCheck2[\"default\"])(this, Container);\n    this._services = {};\n    this.isAuthenticated = false;\n  }\n\n  (0, _createClass2[\"default\"])(Container, [{\n    key: \"register\",\n    value: function register(service) {\n      var name = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n\n      if (!_ServiceManager[\"default\"].isValidService(service)) {\n        throw new _ServiceManager.InvalidServiceError('Service must be an object with manager() method returning a valid ServiceManager');\n      }\n\n      name = name || service.manager().name();\n      var s = this.service(name, false);\n\n      if (s !== undefined && s !== service) {\n        throw new ServiceAlreadyRegisteredError(name);\n      }\n\n      this._services[name] = service;\n      return this;\n    }\n  }, {\n    key: \"service\",\n    value: function service(name) {\n      var throwIfMissing = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;\n      var extractedServices = ['exchange'];\n\n      if (!name) {\n        throw new Error('Provide a service name.');\n      }\n\n      if (!this._services[name] && throwIfMissing && extractedServices.includes(name)) {\n        throw new ExtractedServiceError(name);\n      }\n\n      if (!this._services[name] && throwIfMissing) {\n        throw new ServiceNotFoundError(name);\n      }\n\n      return this._services[name];\n    }\n  }, {\n    key: \"getRegisteredServiceNames\",\n    value: function getRegisteredServiceNames() {\n      return Object.keys(this._services);\n    }\n  }, {\n    key: \"injectDependencies\",\n    value: function injectDependencies() {\n      var services = (0, _values[\"default\"])(this._services);\n\n      var _iterator2 = _createForOfIteratorHelper(services),\n          _step2;\n\n      try {\n        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {\n          var service = _step2.value;\n          var manager = service.manager();\n\n          var _iterator3 = _createForOfIteratorHelper(manager.dependencies()),\n              _step3;\n\n          try {\n            for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {\n              var name = _step3.value;\n              var dep = this._services[name];\n              if (!dep) throw new ServiceNotFoundError(name);\n              manager.inject(name, this._services[name]);\n            }\n          } catch (err) {\n            _iterator3.e(err);\n          } finally {\n            _iterator3.f();\n          }\n        }\n      } catch (err) {\n        _iterator2.e(err);\n      } finally {\n        _iterator2.f();\n      }\n    }\n  }, {\n    key: \"initialize\",\n    value: function initialize() {\n      return this._waitForServices(function (s) {\n        return s.manager().initialize();\n      });\n    }\n  }, {\n    key: \"connect\",\n    value: function connect() {\n      return this._waitForServices(function (s) {\n        return s.manager().connect();\n      });\n    }\n  }, {\n    key: \"authenticate\",\n    value: function authenticate() {\n      var _this = this;\n\n      return this._waitForServices(function (s) {\n        return s.manager().authenticate();\n      }).then(function () {\n        _this.isAuthenticated = true;\n      });\n    }\n  }, {\n    key: \"_waitForServices\",\n    value: function () {\n      var _waitForServices2 = (0, _asyncToGenerator2[\"default\"])( /*#__PURE__*/_regenerator[\"default\"].mark(function _callee(callback) {\n        var _iterator4, _step4, name, service;\n\n        return _regenerator[\"default\"].wrap(function _callee$(_context) {\n          while (1) {\n            switch (_context.prev = _context.next) {\n              case 0:\n                if (!this._orderedServiceNames) {\n                  this._orderedServiceNames = orderServices((0, _values[\"default\"])(this._services));\n                }\n\n                _iterator4 = _createForOfIteratorHelper(this._orderedServiceNames);\n                _context.prev = 2;\n\n                _iterator4.s();\n\n              case 4:\n                if ((_step4 = _iterator4.n()).done) {\n                  _context.next = 13;\n                  break;\n                }\n\n                name = _step4.value;\n                service = this._services[name];\n\n                if (service) {\n                  _context.next = 9;\n                  break;\n                }\n\n                throw new Error(\"No service for \".concat(name));\n\n              case 9:\n                _context.next = 11;\n                return callback(this._services[name]);\n\n              case 11:\n                _context.next = 4;\n                break;\n\n              case 13:\n                _context.next = 18;\n                break;\n\n              case 15:\n                _context.prev = 15;\n                _context.t0 = _context[\"catch\"](2);\n\n                _iterator4.e(_context.t0);\n\n              case 18:\n                _context.prev = 18;\n\n                _iterator4.f();\n\n                return _context.finish(18);\n\n              case 21:\n              case \"end\":\n                return _context.stop();\n            }\n          }\n        }, _callee, this, [[2, 15, 18, 21]]);\n      }));\n\n      function _waitForServices(_x) {\n        return _waitForServices2.apply(this, arguments);\n      }\n\n      return _waitForServices;\n    }()\n  }]);\n  return Container;\n}();\n\nexports[\"default\"] = Container;","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nmodule.exports = arrayMap;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n","module.exports = function(module) {\n\tif (!module.webpackPolyfill) {\n\t\tmodule.deprecate = function() {};\n\t\tmodule.paths = [];\n\t\t// module.parent = undefined by default\n\t\tif (!module.children) module.children = [];\n\t\tObject.defineProperty(module, \"loaded\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.l;\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(module, \"id\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.i;\n\t\t\t}\n\t\t});\n\t\tmodule.webpackPolyfill = 1;\n\t}\n\treturn module;\n};\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nmodule.exports = isLength;\n",";(function (globalObject) {\r\n  'use strict';\r\n\r\n/*\r\n *      bignumber.js v7.2.1\r\n *      A JavaScript library for arbitrary-precision arithmetic.\r\n *      https://github.com/MikeMcl/bignumber.js\r\n *      Copyright (c) 2018 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *      MIT Licensed.\r\n *\r\n *      BigNumber.prototype methods     |  BigNumber methods\r\n *                                      |\r\n *      absoluteValue            abs    |  clone\r\n *      comparedTo                      |  config               set\r\n *      decimalPlaces            dp     |      DECIMAL_PLACES\r\n *      dividedBy                div    |      ROUNDING_MODE\r\n *      dividedToIntegerBy       idiv   |      EXPONENTIAL_AT\r\n *      exponentiatedBy          pow    |      RANGE\r\n *      integerValue                    |      CRYPTO\r\n *      isEqualTo                eq     |      MODULO_MODE\r\n *      isFinite                        |      POW_PRECISION\r\n *      isGreaterThan            gt     |      FORMAT\r\n *      isGreaterThanOrEqualTo   gte    |      ALPHABET\r\n *      isInteger                       |  isBigNumber\r\n *      isLessThan               lt     |  maximum              max\r\n *      isLessThanOrEqualTo      lte    |  minimum              min\r\n *      isNaN                           |  random\r\n *      isNegative                      |\r\n *      isPositive                      |\r\n *      isZero                          |\r\n *      minus                           |\r\n *      modulo                   mod    |\r\n *      multipliedBy             times  |\r\n *      negated                         |\r\n *      plus                            |\r\n *      precision                sd     |\r\n *      shiftedBy                       |\r\n *      squareRoot               sqrt   |\r\n *      toExponential                   |\r\n *      toFixed                         |\r\n *      toFormat                        |\r\n *      toFraction                      |\r\n *      toJSON                          |\r\n *      toNumber                        |\r\n *      toPrecision                     |\r\n *      toString                        |\r\n *      valueOf                         |\r\n *\r\n */\r\n\r\n\r\n  var BigNumber,\r\n    isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n\r\n    mathceil = Math.ceil,\r\n    mathfloor = Math.floor,\r\n\r\n    bignumberError = '[BigNumber Error] ',\r\n    tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n    BASE = 1e14,\r\n    LOG_BASE = 14,\r\n    MAX_SAFE_INTEGER = 0x1fffffffffffff,         // 2^53 - 1\r\n    // MAX_INT32 = 0x7fffffff,                   // 2^31 - 1\r\n    POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n    SQRT_BASE = 1e7,\r\n\r\n    // EDITABLE\r\n    // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n    // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n    MAX = 1E9;                                   // 0 to MAX_INT32\r\n\r\n\r\n  /*\r\n   * Create and return a BigNumber constructor.\r\n   */\r\n  function clone(configObject) {\r\n    var div, convertBase, parseNumeric,\r\n      P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n      ONE = new BigNumber(1),\r\n\r\n\r\n      //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n      // The default values below must be integers within the inclusive ranges stated.\r\n      // The values can also be changed at run-time using BigNumber.set.\r\n\r\n      // The maximum number of decimal places for operations involving division.\r\n      DECIMAL_PLACES = 20,                     // 0 to MAX\r\n\r\n      // The rounding mode used when rounding to the above decimal places, and when using\r\n      // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n      // UP         0 Away from zero.\r\n      // DOWN       1 Towards zero.\r\n      // CEIL       2 Towards +Infinity.\r\n      // FLOOR      3 Towards -Infinity.\r\n      // HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      ROUNDING_MODE = 4,                       // 0 to 8\r\n\r\n      // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n      // The exponent value at and beneath which toString returns exponential notation.\r\n      // Number type: -7\r\n      TO_EXP_NEG = -7,                         // 0 to -MAX\r\n\r\n      // The exponent value at and above which toString returns exponential notation.\r\n      // Number type: 21\r\n      TO_EXP_POS = 21,                         // 0 to MAX\r\n\r\n      // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // Number type: -324  (5e-324)\r\n      MIN_EXP = -1e7,                          // -1 to -MAX\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // Number type:  308  (1.7976931348623157e+308)\r\n      // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n      MAX_EXP = 1e7,                           // 1 to MAX\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      CRYPTO = false,                          // true or false\r\n\r\n      // The modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP        0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN      1 The remainder has the same sign as the dividend.\r\n      //             This modulo mode is commonly known as 'truncated division' and is\r\n      //             equivalent to (a % n) in JavaScript.\r\n      // FLOOR     3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n      // EUCLID    9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n      //             The remainder is always positive.\r\n      //\r\n      // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n      // modes are commonly used for the modulus operation.\r\n      // Although the other rounding modes can also be used, they may not give useful results.\r\n      MODULO_MODE = 1,                         // 0 to 9\r\n\r\n      // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n      // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n      POW_PRECISION = 0,                    // 0 to MAX\r\n\r\n      // The format specification used by the BigNumber.prototype.toFormat method.\r\n      FORMAT = {\r\n        decimalSeparator: '.',\r\n        groupSeparator: ',',\r\n        groupSize: 3,\r\n        secondaryGroupSize: 0,\r\n        fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n        fractionGroupSize: 0\r\n      },\r\n\r\n      // The alphabet used for base conversion.\r\n      // It must be at least 2 characters long, with no '.' or repeated character.\r\n      // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n      ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz';\r\n\r\n\r\n    //------------------------------------------------------------------------------------------\r\n\r\n\r\n    // CONSTRUCTOR\r\n\r\n\r\n    /*\r\n     * The BigNumber constructor and exported function.\r\n     * Create and return a new instance of a BigNumber object.\r\n     *\r\n     * n {number|string|BigNumber} A numeric value.\r\n     * [b] {number} The base of n. Integer, 2 to ALPHABET.length inclusive.\r\n     */\r\n    function BigNumber(n, b) {\r\n      var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n        x = this;\r\n\r\n      // Enable constructor usage without new.\r\n      if (!(x instanceof BigNumber)) {\r\n\r\n        // Don't throw on constructor call without new (#81).\r\n        // '[BigNumber Error] Constructor call without new: {n}'\r\n        //throw Error(bignumberError + ' Constructor call without new: ' + n);\r\n        return new BigNumber(n, b);\r\n      }\r\n\r\n      if (b == null) {\r\n\r\n        // Duplicate.\r\n        if (n instanceof BigNumber) {\r\n          x.s = n.s;\r\n          x.e = n.e;\r\n          x.c = (n = n.c) ? n.slice() : n;\r\n          return;\r\n        }\r\n\r\n        isNum = typeof n == 'number';\r\n\r\n        if (isNum && n * 0 == 0) {\r\n\r\n          // Use `1 / n` to handle minus zero also.\r\n          x.s = 1 / n < 0 ? (n = -n, -1) : 1;\r\n\r\n          // Faster path for integers.\r\n          if (n === ~~n) {\r\n            for (e = 0, i = n; i >= 10; i /= 10, e++);\r\n            x.e = e;\r\n            x.c = [n];\r\n            return;\r\n          }\r\n\r\n          str = n + '';\r\n        } else {\r\n          if (!isNumeric.test(str = n + '')) return parseNumeric(x, str, isNum);\r\n          x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n        // Exponential form?\r\n        if ((i = str.search(/e/i)) > 0) {\r\n\r\n          // Determine exponent.\r\n          if (e < 0) e = i;\r\n          e += +str.slice(i + 1);\r\n          str = str.substring(0, i);\r\n        } else if (e < 0) {\r\n\r\n          // Integer.\r\n          e = str.length;\r\n        }\r\n\r\n      } else {\r\n\r\n        // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n        intCheck(b, 2, ALPHABET.length, 'Base');\r\n        str = n + '';\r\n\r\n        // Allow exponential notation to be used with base 10 argument, while\r\n        // also rounding to DECIMAL_PLACES as with other bases.\r\n        if (b == 10) {\r\n          x = new BigNumber(n instanceof BigNumber ? n : str);\r\n          return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n        }\r\n\r\n        isNum = typeof n == 'number';\r\n\r\n        if (isNum) {\r\n\r\n          // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n          if (n * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n          x.s = 1 / n < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n          // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n          if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n            throw Error\r\n             (tooManyDigits + n);\r\n          }\r\n\r\n          // Prevent later check for length on converted number.\r\n          isNum = false;\r\n        } else {\r\n          x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        alphabet = ALPHABET.slice(0, b);\r\n        e = i = 0;\r\n\r\n        // Check that str is a valid base b number.\r\n        // Don't use RegExp so alphabet can contain special characters.\r\n        for (len = str.length; i < len; i++) {\r\n          if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n            if (c == '.') {\r\n\r\n              // If '.' is not the first character and it has not be found before.\r\n              if (i > e) {\r\n                e = len;\r\n                continue;\r\n              }\r\n            } else if (!caseChanged) {\r\n\r\n              // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n              if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n                  str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n                caseChanged = true;\r\n                i = -1;\r\n                e = 0;\r\n                continue;\r\n              }\r\n            }\r\n\r\n            return parseNumeric(x, n + '', isNum, b);\r\n          }\r\n        }\r\n\r\n        str = convertBase(str, b, 10, x.s);\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n        else e = str.length;\r\n      }\r\n\r\n      // Determine leading zeros.\r\n      for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n      // Determine trailing zeros.\r\n      for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n      str = str.slice(i, ++len);\r\n\r\n      if (str) {\r\n        len -= i;\r\n\r\n        // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n        if (isNum && BigNumber.DEBUG &&\r\n          len > 15 && (n > MAX_SAFE_INTEGER || n !== mathfloor(n))) {\r\n            throw Error\r\n             (tooManyDigits + (x.s * n));\r\n        }\r\n\r\n        e = e - i - 1;\r\n\r\n         // Overflow?\r\n        if (e > MAX_EXP) {\r\n\r\n          // Infinity.\r\n          x.c = x.e = null;\r\n\r\n        // Underflow?\r\n        } else if (e < MIN_EXP) {\r\n\r\n          // Zero.\r\n          x.c = [x.e = 0];\r\n        } else {\r\n          x.e = e;\r\n          x.c = [];\r\n\r\n          // Transform base\r\n\r\n          // e is the base 10 exponent.\r\n          // i is where to slice str to get the first element of the coefficient array.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (e < 0) i += LOG_BASE;\r\n\r\n          if (i < len) {\r\n            if (i) x.c.push(+str.slice(0, i));\r\n\r\n            for (len -= LOG_BASE; i < len;) {\r\n              x.c.push(+str.slice(i, i += LOG_BASE));\r\n            }\r\n\r\n            str = str.slice(i);\r\n            i = LOG_BASE - str.length;\r\n          } else {\r\n            i -= len;\r\n          }\r\n\r\n          for (; i--; str += '0');\r\n          x.c.push(+str);\r\n        }\r\n      } else {\r\n\r\n        // Zero.\r\n        x.c = [x.e = 0];\r\n      }\r\n    }\r\n\r\n\r\n    // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n    BigNumber.clone = clone;\r\n\r\n    BigNumber.ROUND_UP = 0;\r\n    BigNumber.ROUND_DOWN = 1;\r\n    BigNumber.ROUND_CEIL = 2;\r\n    BigNumber.ROUND_FLOOR = 3;\r\n    BigNumber.ROUND_HALF_UP = 4;\r\n    BigNumber.ROUND_HALF_DOWN = 5;\r\n    BigNumber.ROUND_HALF_EVEN = 6;\r\n    BigNumber.ROUND_HALF_CEIL = 7;\r\n    BigNumber.ROUND_HALF_FLOOR = 8;\r\n    BigNumber.EUCLID = 9;\r\n\r\n\r\n    /*\r\n     * Configure infrequently-changing library-wide settings.\r\n     *\r\n     * Accept an object with the following optional properties (if the value of a property is\r\n     * a number, it must be an integer within the inclusive range stated):\r\n     *\r\n     *   DECIMAL_PLACES   {number}           0 to MAX\r\n     *   ROUNDING_MODE    {number}           0 to 8\r\n     *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]\r\n     *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]\r\n     *   CRYPTO           {boolean}          true or false\r\n     *   MODULO_MODE      {number}           0 to 9\r\n     *   POW_PRECISION       {number}           0 to MAX\r\n     *   ALPHABET         {string}           A string of two or more unique characters which does\r\n     *                                       not contain '.'.\r\n     *   FORMAT           {object}           An object with some of the following properties:\r\n     *      decimalSeparator       {string}\r\n     *      groupSeparator         {string}\r\n     *      groupSize              {number}\r\n     *      secondaryGroupSize     {number}\r\n     *      fractionGroupSeparator {string}\r\n     *      fractionGroupSize      {number}\r\n     *\r\n     * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n     *\r\n     * E.g.\r\n     * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n     *\r\n     * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n     *\r\n     * Return an object with the properties current values.\r\n     */\r\n    BigNumber.config = BigNumber.set = function (obj) {\r\n      var p, v;\r\n\r\n      if (obj != null) {\r\n\r\n        if (typeof obj == 'object') {\r\n\r\n          // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            DECIMAL_PLACES = v;\r\n          }\r\n\r\n          // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n          // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 8, p);\r\n            ROUNDING_MODE = v;\r\n          }\r\n\r\n          // EXPONENTIAL_AT {number|number[]}\r\n          // Integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n          // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n            v = obj[p];\r\n            if (isArray(v)) {\r\n              intCheck(v[0], -MAX, 0, p);\r\n              intCheck(v[1], 0, MAX, p);\r\n              TO_EXP_NEG = v[0];\r\n              TO_EXP_POS = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n            }\r\n          }\r\n\r\n          // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n          // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n          if (obj.hasOwnProperty(p = 'RANGE')) {\r\n            v = obj[p];\r\n            if (isArray(v)) {\r\n              intCheck(v[0], -MAX, -1, p);\r\n              intCheck(v[1], 1, MAX, p);\r\n              MIN_EXP = v[0];\r\n              MAX_EXP = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              if (v) {\r\n                MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n              } else {\r\n                throw Error\r\n                 (bignumberError + p + ' cannot be zero: ' + v);\r\n              }\r\n            }\r\n          }\r\n\r\n          // CRYPTO {boolean} true or false.\r\n          // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n          // '[BigNumber Error] crypto unavailable'\r\n          if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n            v = obj[p];\r\n            if (v === !!v) {\r\n              if (v) {\r\n                if (typeof crypto != 'undefined' && crypto &&\r\n                 (crypto.getRandomValues || crypto.randomBytes)) {\r\n                  CRYPTO = v;\r\n                } else {\r\n                  CRYPTO = !v;\r\n                  throw Error\r\n                   (bignumberError + 'crypto unavailable');\r\n                }\r\n              } else {\r\n                CRYPTO = v;\r\n              }\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' not true or false: ' + v);\r\n            }\r\n          }\r\n\r\n          // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n          // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 9, p);\r\n            MODULO_MODE = v;\r\n          }\r\n\r\n          // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            POW_PRECISION = v;\r\n          }\r\n\r\n          // FORMAT {object}\r\n          // '[BigNumber Error] FORMAT not an object: {v}'\r\n          if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n            v = obj[p];\r\n            if (typeof v == 'object') FORMAT = v;\r\n            else throw Error\r\n             (bignumberError + p + ' not an object: ' + v);\r\n          }\r\n\r\n          // ALPHABET {string}\r\n          // '[BigNumber Error] ALPHABET invalid: {v}'\r\n          if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n            v = obj[p];\r\n\r\n            // Disallow if only one character, or contains '.' or a repeated character.\r\n            if (typeof v == 'string' && !/^.$|\\.|(.).*\\1/.test(v)) {\r\n              ALPHABET = v;\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' invalid: ' + v);\r\n            }\r\n          }\r\n\r\n        } else {\r\n\r\n          // '[BigNumber Error] Object expected: {v}'\r\n          throw Error\r\n           (bignumberError + 'Object expected: ' + obj);\r\n        }\r\n      }\r\n\r\n      return {\r\n        DECIMAL_PLACES: DECIMAL_PLACES,\r\n        ROUNDING_MODE: ROUNDING_MODE,\r\n        EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n        RANGE: [MIN_EXP, MAX_EXP],\r\n        CRYPTO: CRYPTO,\r\n        MODULO_MODE: MODULO_MODE,\r\n        POW_PRECISION: POW_PRECISION,\r\n        FORMAT: FORMAT,\r\n        ALPHABET: ALPHABET\r\n      };\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if v is a BigNumber instance, otherwise return false.\r\n     *\r\n     * v {any}\r\n     */\r\n    BigNumber.isBigNumber = function (v) {\r\n      return v instanceof BigNumber || v && v._isBigNumber === true || false;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the maximum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.maximum = BigNumber.max = function () {\r\n      return maxOrMin(arguments, P.lt);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the minimum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.minimum = BigNumber.min = function () {\r\n      return maxOrMin(arguments, P.gt);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n     * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n     * zeros are produced).\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n     * '[BigNumber Error] crypto unavailable'\r\n     */\r\n    BigNumber.random = (function () {\r\n      var pow2_53 = 0x20000000000000;\r\n\r\n      // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n      // Check if Math.random() produces more than 32 bits of randomness.\r\n      // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n      // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n      var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n       ? function () { return mathfloor(Math.random() * pow2_53); }\r\n       : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n         (Math.random() * 0x800000 | 0); };\r\n\r\n      return function (dp) {\r\n        var a, b, e, k, v,\r\n          i = 0,\r\n          c = [],\r\n          rand = new BigNumber(ONE);\r\n\r\n        if (dp == null) dp = DECIMAL_PLACES;\r\n        else intCheck(dp, 0, MAX);\r\n\r\n        k = mathceil(dp / LOG_BASE);\r\n\r\n        if (CRYPTO) {\r\n\r\n          // Browsers supporting crypto.getRandomValues.\r\n          if (crypto.getRandomValues) {\r\n\r\n            a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n            for (; i < k;) {\r\n\r\n              // 53 bits:\r\n              // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n              // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n              // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n              //                                     11111 11111111 11111111\r\n              // 0x20000 is 2^21.\r\n              v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n              // Rejection sampling:\r\n              // 0 <= v < 9007199254740992\r\n              // Probability that v >= 9e15, is\r\n              // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n              if (v >= 9e15) {\r\n                b = crypto.getRandomValues(new Uint32Array(2));\r\n                a[i] = b[0];\r\n                a[i + 1] = b[1];\r\n              } else {\r\n\r\n                // 0 <= v <= 8999999999999999\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 2;\r\n              }\r\n            }\r\n            i = k / 2;\r\n\r\n          // Node.js supporting crypto.randomBytes.\r\n          } else if (crypto.randomBytes) {\r\n\r\n            // buffer\r\n            a = crypto.randomBytes(k *= 7);\r\n\r\n            for (; i < k;) {\r\n\r\n              // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n              // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n              // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n              // 0 <= v < 9007199254740992\r\n              v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n                 (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n                 (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n              if (v >= 9e15) {\r\n                crypto.randomBytes(7).copy(a, i);\r\n              } else {\r\n\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 7;\r\n              }\r\n            }\r\n            i = k / 7;\r\n          } else {\r\n            CRYPTO = false;\r\n            throw Error\r\n             (bignumberError + 'crypto unavailable');\r\n          }\r\n        }\r\n\r\n        // Use Math.random.\r\n        if (!CRYPTO) {\r\n\r\n          for (; i < k;) {\r\n            v = random53bitInt();\r\n            if (v < 9e15) c[i++] = v % 1e14;\r\n          }\r\n        }\r\n\r\n        k = c[--i];\r\n        dp %= LOG_BASE;\r\n\r\n        // Convert trailing digits to zeros according to dp.\r\n        if (k && dp) {\r\n          v = POWS_TEN[LOG_BASE - dp];\r\n          c[i] = mathfloor(k / v) * v;\r\n        }\r\n\r\n        // Remove trailing elements which are zero.\r\n        for (; c[i] === 0; c.pop(), i--);\r\n\r\n        // Zero?\r\n        if (i < 0) {\r\n          c = [e = 0];\r\n        } else {\r\n\r\n          // Remove leading elements which are zero and adjust exponent accordingly.\r\n          for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n          // Count the digits of the first element of c to determine leading zeros, and...\r\n          for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n          // adjust the exponent accordingly.\r\n          if (i < LOG_BASE) e -= LOG_BASE - i;\r\n        }\r\n\r\n        rand.e = e;\r\n        rand.c = c;\r\n        return rand;\r\n      };\r\n    })();\r\n\r\n\r\n    // PRIVATE FUNCTIONS\r\n\r\n\r\n    // Called by BigNumber and BigNumber.prototype.toString.\r\n    convertBase = (function () {\r\n      var decimal = '0123456789';\r\n\r\n      /*\r\n       * Convert string of baseIn to an array of numbers of baseOut.\r\n       * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n       * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n       */\r\n      function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n        var j,\r\n          arr = [0],\r\n          arrL,\r\n          i = 0,\r\n          len = str.length;\r\n\r\n        for (; i < len;) {\r\n          for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n          arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n          for (j = 0; j < arr.length; j++) {\r\n\r\n            if (arr[j] > baseOut - 1) {\r\n              if (arr[j + 1] == null) arr[j + 1] = 0;\r\n              arr[j + 1] += arr[j] / baseOut | 0;\r\n              arr[j] %= baseOut;\r\n            }\r\n          }\r\n        }\r\n\r\n        return arr.reverse();\r\n      }\r\n\r\n      // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n      // If the caller is toString, we are converting from base 10 to baseOut.\r\n      // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n      return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n        var alphabet, d, e, k, r, x, xc, y,\r\n          i = str.indexOf('.'),\r\n          dp = DECIMAL_PLACES,\r\n          rm = ROUNDING_MODE;\r\n\r\n        // Non-integer.\r\n        if (i >= 0) {\r\n          k = POW_PRECISION;\r\n\r\n          // Unlimited precision.\r\n          POW_PRECISION = 0;\r\n          str = str.replace('.', '');\r\n          y = new BigNumber(baseIn);\r\n          x = y.pow(str.length - i);\r\n          POW_PRECISION = k;\r\n\r\n          // Convert str as if an integer, then restore the fraction part by dividing the\r\n          // result by its base raised to a power.\r\n\r\n          y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n           10, baseOut, decimal);\r\n          y.e = y.c.length;\r\n        }\r\n\r\n        // Convert the number as integer.\r\n\r\n        xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n         ? (alphabet = ALPHABET, decimal)\r\n         : (alphabet = decimal, ALPHABET));\r\n\r\n        // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n        e = k = xc.length;\r\n\r\n        // Remove trailing zeros.\r\n        for (; xc[--k] == 0; xc.pop());\r\n\r\n        // Zero?\r\n        if (!xc[0]) return alphabet.charAt(0);\r\n\r\n        // Does str represent an integer? If so, no need for the division.\r\n        if (i < 0) {\r\n          --e;\r\n        } else {\r\n          x.c = xc;\r\n          x.e = e;\r\n\r\n          // The sign is needed for correct rounding.\r\n          x.s = sign;\r\n          x = div(x, y, dp, rm, baseOut);\r\n          xc = x.c;\r\n          r = x.r;\r\n          e = x.e;\r\n        }\r\n\r\n        // xc now represents str converted to baseOut.\r\n\r\n        // THe index of the rounding digit.\r\n        d = e + dp + 1;\r\n\r\n        // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n        i = xc[d];\r\n\r\n        // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n        k = baseOut / 2;\r\n        r = r || d < 0 || xc[d + 1] != null;\r\n\r\n        r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n              : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n               rm == (x.s < 0 ? 8 : 7));\r\n\r\n        // If the index of the rounding digit is not greater than zero, or xc represents\r\n        // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n        // such as 0.00001.\r\n        if (d < 1 || !xc[0]) {\r\n\r\n          // 1^-dp or 0\r\n          str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0))\r\n              : alphabet.charAt(0);\r\n        } else {\r\n\r\n          // Truncate xc to the required number of decimal places.\r\n          xc.length = d;\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            // Rounding up may mean the previous digit has to be rounded up and so on.\r\n            for (--baseOut; ++xc[--d] > baseOut;) {\r\n              xc[d] = 0;\r\n\r\n              if (!d) {\r\n                ++e;\r\n                xc = [1].concat(xc);\r\n              }\r\n            }\r\n          }\r\n\r\n          // Determine trailing zeros.\r\n          for (k = xc.length; !xc[--k];);\r\n\r\n          // E.g. [4, 11, 15] becomes 4bf.\r\n          for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n          // Add leading zeros, decimal point and trailing zeros as required.\r\n          str = toFixedPoint(str, e, alphabet.charAt(0));\r\n        }\r\n\r\n        // The caller will add the sign.\r\n        return str;\r\n      };\r\n    })();\r\n\r\n\r\n    // Perform division in the specified base. Called by div and convertBase.\r\n    div = (function () {\r\n\r\n      // Assume non-zero x and k.\r\n      function multiply(x, k, base) {\r\n        var m, temp, xlo, xhi,\r\n          carry = 0,\r\n          i = x.length,\r\n          klo = k % SQRT_BASE,\r\n          khi = k / SQRT_BASE | 0;\r\n\r\n        for (x = x.slice(); i--;) {\r\n          xlo = x[i] % SQRT_BASE;\r\n          xhi = x[i] / SQRT_BASE | 0;\r\n          m = khi * xlo + xhi * klo;\r\n          temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n          carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n          x[i] = temp % base;\r\n        }\r\n\r\n        if (carry) x = [carry].concat(x);\r\n\r\n        return x;\r\n      }\r\n\r\n      function compare(a, b, aL, bL) {\r\n        var i, cmp;\r\n\r\n        if (aL != bL) {\r\n          cmp = aL > bL ? 1 : -1;\r\n        } else {\r\n\r\n          for (i = cmp = 0; i < aL; i++) {\r\n\r\n            if (a[i] != b[i]) {\r\n              cmp = a[i] > b[i] ? 1 : -1;\r\n              break;\r\n            }\r\n          }\r\n        }\r\n\r\n        return cmp;\r\n      }\r\n\r\n      function subtract(a, b, aL, base) {\r\n        var i = 0;\r\n\r\n        // Subtract b from a.\r\n        for (; aL--;) {\r\n          a[aL] -= i;\r\n          i = a[aL] < b[aL] ? 1 : 0;\r\n          a[aL] = i * base + a[aL] - b[aL];\r\n        }\r\n\r\n        // Remove leading zeros.\r\n        for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n      }\r\n\r\n      // x: dividend, y: divisor.\r\n      return function (x, y, dp, rm, base) {\r\n        var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n          yL, yz,\r\n          s = x.s == y.s ? 1 : -1,\r\n          xc = x.c,\r\n          yc = y.c;\r\n\r\n        // Either NaN, Infinity or 0?\r\n        if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n          return new BigNumber(\r\n\r\n           // Return NaN if either NaN, or both Infinity or 0.\r\n           !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n            // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n            xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n         );\r\n        }\r\n\r\n        q = new BigNumber(s);\r\n        qc = q.c = [];\r\n        e = x.e - y.e;\r\n        s = dp + e + 1;\r\n\r\n        if (!base) {\r\n          base = BASE;\r\n          e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n          s = s / LOG_BASE | 0;\r\n        }\r\n\r\n        // Result exponent may be one less then the current value of e.\r\n        // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n        for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n        if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n        if (s < 0) {\r\n          qc.push(1);\r\n          more = true;\r\n        } else {\r\n          xL = xc.length;\r\n          yL = yc.length;\r\n          i = 0;\r\n          s += 2;\r\n\r\n          // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n          n = mathfloor(base / (yc[0] + 1));\r\n\r\n          // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n          // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n          if (n > 1) {\r\n            yc = multiply(yc, n, base);\r\n            xc = multiply(xc, n, base);\r\n            yL = yc.length;\r\n            xL = xc.length;\r\n          }\r\n\r\n          xi = yL;\r\n          rem = xc.slice(0, yL);\r\n          remL = rem.length;\r\n\r\n          // Add zeros to make remainder as long as divisor.\r\n          for (; remL < yL; rem[remL++] = 0);\r\n          yz = yc.slice();\r\n          yz = [0].concat(yz);\r\n          yc0 = yc[0];\r\n          if (yc[1] >= base / 2) yc0++;\r\n          // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n          // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n          do {\r\n            n = 0;\r\n\r\n            // Compare divisor and remainder.\r\n            cmp = compare(yc, rem, yL, remL);\r\n\r\n            // If divisor < remainder.\r\n            if (cmp < 0) {\r\n\r\n              // Calculate trial digit, n.\r\n\r\n              rem0 = rem[0];\r\n              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n              // n is how many times the divisor goes into the current remainder.\r\n              n = mathfloor(rem0 / yc0);\r\n\r\n              //  Algorithm:\r\n              //  product = divisor multiplied by trial digit (n).\r\n              //  Compare product and remainder.\r\n              //  If product is greater than remainder:\r\n              //    Subtract divisor from product, decrement trial digit.\r\n              //  Subtract product from remainder.\r\n              //  If product was less than remainder at the last compare:\r\n              //    Compare new remainder and divisor.\r\n              //    If remainder is greater than divisor:\r\n              //      Subtract divisor from remainder, increment trial digit.\r\n\r\n              if (n > 1) {\r\n\r\n                // n may be > base only when base is 3.\r\n                if (n >= base) n = base - 1;\r\n\r\n                // product = divisor * trial digit.\r\n                prod = multiply(yc, n, base);\r\n                prodL = prod.length;\r\n                remL = rem.length;\r\n\r\n                // Compare product and remainder.\r\n                // If product > remainder then trial digit n too high.\r\n                // n is 1 too high about 5% of the time, and is not known to have\r\n                // ever been more than 1 too high.\r\n                while (compare(prod, rem, prodL, remL) == 1) {\r\n                  n--;\r\n\r\n                  // Subtract divisor from product.\r\n                  subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n                  prodL = prod.length;\r\n                  cmp = 1;\r\n                }\r\n              } else {\r\n\r\n                // n is 0 or 1, cmp is -1.\r\n                // If n is 0, there is no need to compare yc and rem again below,\r\n                // so change cmp to 1 to avoid it.\r\n                // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n                if (n == 0) {\r\n\r\n                  // divisor < remainder, so n must be at least 1.\r\n                  cmp = n = 1;\r\n                }\r\n\r\n                // product = divisor\r\n                prod = yc.slice();\r\n                prodL = prod.length;\r\n              }\r\n\r\n              if (prodL < remL) prod = [0].concat(prod);\r\n\r\n              // Subtract product from remainder.\r\n              subtract(rem, prod, remL, base);\r\n              remL = rem.length;\r\n\r\n               // If product was < remainder.\r\n              if (cmp == -1) {\r\n\r\n                // Compare divisor and new remainder.\r\n                // If divisor < new remainder, subtract divisor from remainder.\r\n                // Trial digit n too low.\r\n                // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n                while (compare(yc, rem, yL, remL) < 1) {\r\n                  n++;\r\n\r\n                  // Subtract divisor from remainder.\r\n                  subtract(rem, yL < remL ? yz : yc, remL, base);\r\n                  remL = rem.length;\r\n                }\r\n              }\r\n            } else if (cmp === 0) {\r\n              n++;\r\n              rem = [0];\r\n            } // else cmp === 1 and n will be 0\r\n\r\n            // Add the next digit, n, to the result array.\r\n            qc[i++] = n;\r\n\r\n            // Update the remainder.\r\n            if (rem[0]) {\r\n              rem[remL++] = xc[xi] || 0;\r\n            } else {\r\n              rem = [xc[xi]];\r\n              remL = 1;\r\n            }\r\n          } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n          more = rem[0] != null;\r\n\r\n          // Leading zero?\r\n          if (!qc[0]) qc.splice(0, 1);\r\n        }\r\n\r\n        if (base == BASE) {\r\n\r\n          // To calculate q.e, first get the number of digits of qc[0].\r\n          for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n          round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n        // Caller is convertBase.\r\n        } else {\r\n          q.e = e;\r\n          q.r = +more;\r\n        }\r\n\r\n        return q;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n     * notation rounded to the specified decimal places or significant digits.\r\n     *\r\n     * n: a BigNumber.\r\n     * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n     * rm: the rounding mode.\r\n     * id: 1 (toExponential) or 2 (toPrecision).\r\n     */\r\n    function format(n, i, rm, id) {\r\n      var c0, e, ne, len, str;\r\n\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      if (!n.c) return n.toString();\r\n\r\n      c0 = n.c[0];\r\n      ne = n.e;\r\n\r\n      if (i == null) {\r\n        str = coeffToString(n.c);\r\n        str = id == 1 || id == 2 && ne <= TO_EXP_NEG\r\n         ? toExponential(str, ne)\r\n         : toFixedPoint(str, ne, '0');\r\n      } else {\r\n        n = round(new BigNumber(n), i, rm);\r\n\r\n        // n.e may have changed if the value was rounded up.\r\n        e = n.e;\r\n\r\n        str = coeffToString(n.c);\r\n        len = str.length;\r\n\r\n        // toPrecision returns exponential notation if the number of significant digits\r\n        // specified is less than the number of digits necessary to represent the integer\r\n        // part of the value in fixed-point notation.\r\n\r\n        // Exponential notation.\r\n        if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n          // Append zeros?\r\n          for (; len < i; str += '0', len++);\r\n          str = toExponential(str, e);\r\n\r\n        // Fixed-point notation.\r\n        } else {\r\n          i -= ne;\r\n          str = toFixedPoint(str, e, '0');\r\n\r\n          // Append zeros?\r\n          if (e + 1 > len) {\r\n            if (--i > 0) for (str += '.'; i--; str += '0');\r\n          } else {\r\n            i += e - len;\r\n            if (i > 0) {\r\n              if (e + 1 == len) str += '.';\r\n              for (; i--; str += '0');\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return n.s < 0 && c0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // Handle BigNumber.max and BigNumber.min.\r\n    function maxOrMin(args, method) {\r\n      var m, n,\r\n        i = 0;\r\n\r\n      if (isArray(args[0])) args = args[0];\r\n      m = new BigNumber(args[0]);\r\n\r\n      for (; ++i < args.length;) {\r\n        n = new BigNumber(args[i]);\r\n\r\n        // If any number is NaN, return NaN.\r\n        if (!n.s) {\r\n          m = n;\r\n          break;\r\n        } else if (method.call(m, n)) {\r\n          m = n;\r\n        }\r\n      }\r\n\r\n      return m;\r\n    }\r\n\r\n\r\n    /*\r\n     * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n     * Called by minus, plus and times.\r\n     */\r\n    function normalise(n, c, e) {\r\n      var i = 1,\r\n        j = c.length;\r\n\r\n       // Remove trailing zeros.\r\n      for (; !c[--j]; c.pop());\r\n\r\n      // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n      for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n      // Overflow?\r\n      if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n        // Infinity.\r\n        n.c = n.e = null;\r\n\r\n      // Underflow?\r\n      } else if (e < MIN_EXP) {\r\n\r\n        // Zero.\r\n        n.c = [n.e = 0];\r\n      } else {\r\n        n.e = e;\r\n        n.c = c;\r\n      }\r\n\r\n      return n;\r\n    }\r\n\r\n\r\n    // Handle values that fail the validity test in BigNumber.\r\n    parseNumeric = (function () {\r\n      var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n        dotAfter = /^([^.]+)\\.$/,\r\n        dotBefore = /^\\.([^.]+)$/,\r\n        isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n        whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n      return function (x, str, isNum, b) {\r\n        var base,\r\n          s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n        // No exception on ±Infinity or NaN.\r\n        if (isInfinityOrNaN.test(s)) {\r\n          x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n          x.c = x.e = null;\r\n        } else {\r\n          if (!isNum) {\r\n\r\n            // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n            s = s.replace(basePrefix, function (m, p1, p2) {\r\n              base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n              return !b || b == base ? p1 : m;\r\n            });\r\n\r\n            if (b) {\r\n              base = b;\r\n\r\n              // E.g. '1.' to '1', '.1' to '0.1'\r\n              s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n            }\r\n\r\n            if (str != s) return new BigNumber(s, base);\r\n          }\r\n\r\n          // '[BigNumber Error] Not a number: {n}'\r\n          // '[BigNumber Error] Not a base {b} number: {n}'\r\n          if (BigNumber.DEBUG) {\r\n            throw Error\r\n              (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n          }\r\n\r\n          // NaN\r\n          x.c = x.e = x.s = null;\r\n        }\r\n      }\r\n    })();\r\n\r\n\r\n    /*\r\n     * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n     * If r is truthy, it is known that there are more digits after the rounding digit.\r\n     */\r\n    function round(x, sd, rm, r) {\r\n      var d, i, j, k, n, ni, rd,\r\n        xc = x.c,\r\n        pows10 = POWS_TEN;\r\n\r\n      // if x is not Infinity or NaN...\r\n      if (xc) {\r\n\r\n        // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n        // ni is the index of n within x.c.\r\n        // d is the number of digits of n.\r\n        // i is the index of rd within n including leading zeros.\r\n        // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n        out: {\r\n\r\n          // Get the number of digits of the first element of xc.\r\n          for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n          i = sd - d;\r\n\r\n          // If the rounding digit is in the first element of xc...\r\n          if (i < 0) {\r\n            i += LOG_BASE;\r\n            j = sd;\r\n            n = xc[ni = 0];\r\n\r\n            // Get the rounding digit at index j of n.\r\n            rd = n / pows10[d - j - 1] % 10 | 0;\r\n          } else {\r\n            ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n            if (ni >= xc.length) {\r\n\r\n              if (r) {\r\n\r\n                // Needed by sqrt.\r\n                for (; xc.length <= ni; xc.push(0));\r\n                n = rd = 0;\r\n                d = 1;\r\n                i %= LOG_BASE;\r\n                j = i - LOG_BASE + 1;\r\n              } else {\r\n                break out;\r\n              }\r\n            } else {\r\n              n = k = xc[ni];\r\n\r\n              // Get the number of digits of n.\r\n              for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n              // Get the index of rd within n.\r\n              i %= LOG_BASE;\r\n\r\n              // Get the index of rd within n, adjusted for leading zeros.\r\n              // The number of leading zeros of n is given by LOG_BASE - d.\r\n              j = i - LOG_BASE + d;\r\n\r\n              // Get the rounding digit at index j of n.\r\n              rd = j < 0 ? 0 : n / pows10[d - j - 1] % 10 | 0;\r\n            }\r\n          }\r\n\r\n          r = r || sd < 0 ||\r\n\r\n          // Are there any non-zero digits after the rounding digit?\r\n          // The expression  n % pows10[d - j - 1]  returns all digits of n to the right\r\n          // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n           xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n          r = rm < 4\r\n           ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n           : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n            // Check whether the digit to the left of the rounding digit is odd.\r\n            ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n             rm == (x.s < 0 ? 8 : 7));\r\n\r\n          if (sd < 1 || !xc[0]) {\r\n            xc.length = 0;\r\n\r\n            if (r) {\r\n\r\n              // Convert sd to decimal places.\r\n              sd -= x.e + 1;\r\n\r\n              // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n              xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n              x.e = -sd || 0;\r\n            } else {\r\n\r\n              // Zero.\r\n              xc[0] = x.e = 0;\r\n            }\r\n\r\n            return x;\r\n          }\r\n\r\n          // Remove excess digits.\r\n          if (i == 0) {\r\n            xc.length = ni;\r\n            k = 1;\r\n            ni--;\r\n          } else {\r\n            xc.length = ni + 1;\r\n            k = pows10[LOG_BASE - i];\r\n\r\n            // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n            // j > 0 means i > number of leading zeros of n.\r\n            xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n          }\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            for (; ;) {\r\n\r\n              // If the digit to be rounded up is in the first element of xc...\r\n              if (ni == 0) {\r\n\r\n                // i will be the length of xc[0] before k is added.\r\n                for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n                j = xc[0] += k;\r\n                for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n                // if i != k the length has increased.\r\n                if (i != k) {\r\n                  x.e++;\r\n                  if (xc[0] == BASE) xc[0] = 1;\r\n                }\r\n\r\n                break;\r\n              } else {\r\n                xc[ni] += k;\r\n                if (xc[ni] != BASE) break;\r\n                xc[ni--] = 0;\r\n                k = 1;\r\n              }\r\n            }\r\n          }\r\n\r\n          // Remove trailing zeros.\r\n          for (i = xc.length; xc[--i] === 0; xc.pop());\r\n        }\r\n\r\n        // Overflow? Infinity.\r\n        if (x.e > MAX_EXP) {\r\n          x.c = x.e = null;\r\n\r\n        // Underflow? Zero.\r\n        } else if (x.e < MIN_EXP) {\r\n          x.c = [x.e = 0];\r\n        }\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n\r\n    // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n     */\r\n    P.absoluteValue = P.abs = function () {\r\n      var x = new BigNumber(this);\r\n      if (x.s < 0) x.s = 1;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return\r\n     *   1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     *   -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     *   0 if they have the same value,\r\n     *   or null if the value of either is NaN.\r\n     */\r\n    P.comparedTo = function (y, b) {\r\n      return compare(this, new BigNumber(y, b));\r\n    };\r\n\r\n\r\n    /*\r\n     * If dp is undefined or null or true or false, return the number of decimal places of the\r\n     * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     *\r\n     * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.decimalPlaces = P.dp = function (dp, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), dp + x.e + 1, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last number.\r\n      if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n      if (n < 0) n = 0;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n / 0 = I\r\n     *  n / N = N\r\n     *  n / I = 0\r\n     *  0 / n = 0\r\n     *  0 / 0 = N\r\n     *  0 / N = N\r\n     *  0 / I = 0\r\n     *  N / n = N\r\n     *  N / 0 = N\r\n     *  N / N = N\r\n     *  N / I = N\r\n     *  I / n = I\r\n     *  I / 0 = I\r\n     *  I / N = N\r\n     *  I / I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n     * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.dividedBy = P.div = function (y, b) {\r\n      return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n     * BigNumber by the value of BigNumber(y, b).\r\n     */\r\n    P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n      return div(this, new BigNumber(y, b), 0, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n     *\r\n     * If m is present, return the result modulo m.\r\n     * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n     *\r\n     * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n     * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n     *\r\n     * n {number|string|BigNumber} The exponent. An integer.\r\n     * [m] {number|string|BigNumber} The modulus.\r\n     *\r\n     * '[BigNumber Error] Exponent not an integer: {n}'\r\n     */\r\n    P.exponentiatedBy = P.pow = function (n, m) {\r\n      var half, isModExp, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n        x = this;\r\n\r\n      n = new BigNumber(n);\r\n\r\n      // Allow NaN and ±Infinity, but not other non-integers.\r\n      if (n.c && !n.isInteger()) {\r\n        throw Error\r\n          (bignumberError + 'Exponent not an integer: ' + n);\r\n      }\r\n\r\n      if (m != null) m = new BigNumber(m);\r\n\r\n      // Exponent of MAX_SAFE_INTEGER is 15.\r\n      nIsBig = n.e > 14;\r\n\r\n      // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n      if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n        // The sign of the result of pow when x is negative depends on the evenness of n.\r\n        // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n        y = new BigNumber(Math.pow(+x.valueOf(), nIsBig ? 2 - isOdd(n) : +n));\r\n        return m ? y.mod(m) : y;\r\n      }\r\n\r\n      nIsNeg = n.s < 0;\r\n\r\n      if (m) {\r\n\r\n        // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n        if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n        isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n        if (isModExp) x = x.mod(m);\r\n\r\n      // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n      // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n      } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n        // [1, 240000000]\r\n        ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n        // [80000000000000]  [99999750000000]\r\n        : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n        // If x is negative and n is odd, k = -0, else k = 0.\r\n        k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n        // If x >= 1, k = ±Infinity.\r\n        if (x.e > -1) k = 1 / k;\r\n\r\n        // If n is negative return ±0, else return ±Infinity.\r\n        return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n      } else if (POW_PRECISION) {\r\n\r\n        // Truncating each coefficient array to a length of k after each multiplication\r\n        // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n        // i.e. there will be a minimum of 28 guard digits retained.\r\n        k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n      }\r\n\r\n      if (nIsBig) {\r\n        half = new BigNumber(0.5);\r\n        nIsOdd = isOdd(n);\r\n      } else {\r\n        nIsOdd = n % 2;\r\n      }\r\n\r\n      if (nIsNeg) n.s = 1;\r\n\r\n      y = new BigNumber(ONE);\r\n\r\n      // Performs 54 loop iterations for n of 9007199254740991.\r\n      for (; ;) {\r\n\r\n        if (nIsOdd) {\r\n          y = y.times(x);\r\n          if (!y.c) break;\r\n\r\n          if (k) {\r\n            if (y.c.length > k) y.c.length = k;\r\n          } else if (isModExp) {\r\n            y = y.mod(m);    //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n          }\r\n        }\r\n\r\n        if (nIsBig) {\r\n          n = n.times(half);\r\n          round(n, n.e + 1, 1);\r\n          if (!n.c[0]) break;\r\n          nIsBig = n.e > 14;\r\n          nIsOdd = isOdd(n);\r\n        } else {\r\n          n = mathfloor(n / 2);\r\n          if (!n) break;\r\n          nIsOdd = n % 2;\r\n        }\r\n\r\n        x = x.times(x);\r\n\r\n        if (k) {\r\n          if (x.c && x.c.length > k) x.c.length = k;\r\n        } else if (isModExp) {\r\n          x = x.mod(m);    //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n        }\r\n      }\r\n\r\n      if (isModExp) return y;\r\n      if (nIsNeg) y = ONE.div(y);\r\n\r\n      return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n     * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n     */\r\n    P.integerValue = function (rm) {\r\n      var n = new BigNumber(this);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n      return round(n, n.e + 1, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isEqualTo = P.eq = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n     */\r\n    P.isFinite = function () {\r\n      return !!this.c;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isGreaterThan = P.gt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n     */\r\n    P.isInteger = function () {\r\n      return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isLessThan = P.lt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n     */\r\n    P.isNaN = function () {\r\n      return !this.s;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is negative, otherwise return false.\r\n     */\r\n    P.isNegative = function () {\r\n      return this.s < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is positive, otherwise return false.\r\n     */\r\n    P.isPositive = function () {\r\n      return this.s > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n     */\r\n    P.isZero = function () {\r\n      return !!this.c && this.c[0] == 0;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n - 0 = n\r\n     *  n - N = N\r\n     *  n - I = -I\r\n     *  0 - n = -n\r\n     *  0 - 0 = 0\r\n     *  0 - N = N\r\n     *  0 - I = -I\r\n     *  N - n = N\r\n     *  N - 0 = N\r\n     *  N - N = N\r\n     *  N - I = N\r\n     *  I - n = I\r\n     *  I - 0 = I\r\n     *  I - N = N\r\n     *  I - I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.minus = function (y, b) {\r\n      var i, j, t, xLTy,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n      if (a != b) {\r\n        y.s = -b;\r\n        return x.plus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Either Infinity?\r\n        if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n        // Either zero?\r\n        if (!xc[0] || !yc[0]) {\r\n\r\n          // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n          return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n           ROUNDING_MODE == 3 ? -0 : 0);\r\n        }\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Determine which is the bigger number.\r\n      if (a = xe - ye) {\r\n\r\n        if (xLTy = a < 0) {\r\n          a = -a;\r\n          t = xc;\r\n        } else {\r\n          ye = xe;\r\n          t = yc;\r\n        }\r\n\r\n        t.reverse();\r\n\r\n        // Prepend zeros to equalise exponents.\r\n        for (b = a; b--; t.push(0));\r\n        t.reverse();\r\n      } else {\r\n\r\n        // Exponents equal. Check digit by digit.\r\n        j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n        for (a = b = 0; b < j; b++) {\r\n\r\n          if (xc[b] != yc[b]) {\r\n            xLTy = xc[b] < yc[b];\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      // x < y? Point xc to the array of the bigger number.\r\n      if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s;\r\n\r\n      b = (j = yc.length) - (i = xc.length);\r\n\r\n      // Append zeros to xc if shorter.\r\n      // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n      if (b > 0) for (; b--; xc[i++] = 0);\r\n      b = BASE - 1;\r\n\r\n      // Subtract yc from xc.\r\n      for (; j > a;) {\r\n\r\n        if (xc[--j] < yc[j]) {\r\n          for (i = j; i && !xc[--i]; xc[i] = b);\r\n          --xc[i];\r\n          xc[j] += BASE;\r\n        }\r\n\r\n        xc[j] -= yc[j];\r\n      }\r\n\r\n      // Remove leading zeros and adjust exponent accordingly.\r\n      for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n      // Zero?\r\n      if (!xc[0]) {\r\n\r\n        // Following IEEE 754 (2008) 6.3,\r\n        // n - n = +0  but  n - n = -0  when rounding towards -Infinity.\r\n        y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n        y.c = [y.e = 0];\r\n        return y;\r\n      }\r\n\r\n      // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n      // for finite x and y.\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     *   n % 0 =  N\r\n     *   n % N =  N\r\n     *   n % I =  n\r\n     *   0 % n =  0\r\n     *  -0 % n = -0\r\n     *   0 % 0 =  N\r\n     *   0 % N =  N\r\n     *   0 % I =  0\r\n     *   N % n =  N\r\n     *   N % 0 =  N\r\n     *   N % N =  N\r\n     *   N % I =  N\r\n     *   I % n =  N\r\n     *   I % 0 =  N\r\n     *   I % N =  N\r\n     *   I % I =  N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n     * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n     */\r\n    P.modulo = P.mod = function (y, b) {\r\n      var q, s,\r\n        x = this;\r\n\r\n      y = new BigNumber(y, b);\r\n\r\n      // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n      if (!x.c || !y.s || y.c && !y.c[0]) {\r\n        return new BigNumber(NaN);\r\n\r\n      // Return x if y is Infinity or x is zero.\r\n      } else if (!y.c || x.c && !x.c[0]) {\r\n        return new BigNumber(x);\r\n      }\r\n\r\n      if (MODULO_MODE == 9) {\r\n\r\n        // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n        // r = x - qy    where  0 <= r < abs(y)\r\n        s = y.s;\r\n        y.s = 1;\r\n        q = div(x, y, 0, 3);\r\n        y.s = s;\r\n        q.s *= s;\r\n      } else {\r\n        q = div(x, y, 0, MODULO_MODE);\r\n      }\r\n\r\n      y = x.minus(q.times(y));\r\n\r\n      // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n      if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n      return y;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n * 0 = 0\r\n     *  n * N = N\r\n     *  n * I = I\r\n     *  0 * n = 0\r\n     *  0 * 0 = 0\r\n     *  0 * N = N\r\n     *  0 * I = N\r\n     *  N * n = N\r\n     *  N * 0 = N\r\n     *  N * N = N\r\n     *  N * I = N\r\n     *  I * n = I\r\n     *  I * 0 = N\r\n     *  I * N = N\r\n     *  I * I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n     * of BigNumber(y, b).\r\n     */\r\n    P.multipliedBy = P.times = function (y, b) {\r\n      var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n        base, sqrtBase,\r\n        x = this,\r\n        xc = x.c,\r\n        yc = (y = new BigNumber(y, b)).c;\r\n\r\n      // Either NaN, ±Infinity or ±0?\r\n      if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n        // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n        if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n          y.c = y.e = y.s = null;\r\n        } else {\r\n          y.s *= x.s;\r\n\r\n          // Return ±Infinity if either is ±Infinity.\r\n          if (!xc || !yc) {\r\n            y.c = y.e = null;\r\n\r\n          // Return ±0 if either is ±0.\r\n          } else {\r\n            y.c = [0];\r\n            y.e = 0;\r\n          }\r\n        }\r\n\r\n        return y;\r\n      }\r\n\r\n      e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n      y.s *= x.s;\r\n      xcL = xc.length;\r\n      ycL = yc.length;\r\n\r\n      // Ensure xc points to longer array and xcL to its length.\r\n      if (xcL < ycL) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i;\r\n\r\n      // Initialise the result array with zeros.\r\n      for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n      base = BASE;\r\n      sqrtBase = SQRT_BASE;\r\n\r\n      for (i = ycL; --i >= 0;) {\r\n        c = 0;\r\n        ylo = yc[i] % sqrtBase;\r\n        yhi = yc[i] / sqrtBase | 0;\r\n\r\n        for (k = xcL, j = i + k; j > i;) {\r\n          xlo = xc[--k] % sqrtBase;\r\n          xhi = xc[k] / sqrtBase | 0;\r\n          m = yhi * xlo + xhi * ylo;\r\n          xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n          c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n          zc[j--] = xlo % base;\r\n        }\r\n\r\n        zc[j] = c;\r\n      }\r\n\r\n      if (c) {\r\n        ++e;\r\n      } else {\r\n        zc.splice(0, 1);\r\n      }\r\n\r\n      return normalise(y, zc, e);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n     * i.e. multiplied by -1.\r\n     */\r\n    P.negated = function () {\r\n      var x = new BigNumber(this);\r\n      x.s = -x.s || null;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n + 0 = n\r\n     *  n + N = N\r\n     *  n + I = I\r\n     *  0 + n = n\r\n     *  0 + 0 = 0\r\n     *  0 + N = N\r\n     *  0 + I = I\r\n     *  N + n = N\r\n     *  N + 0 = N\r\n     *  N + N = N\r\n     *  N + I = N\r\n     *  I + n = I\r\n     *  I + 0 = I\r\n     *  I + N = N\r\n     *  I + I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.plus = function (y, b) {\r\n      var t,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n       if (a != b) {\r\n        y.s = -b;\r\n        return x.minus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Return ±Infinity if either ±Infinity.\r\n        if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n        // Either zero?\r\n        // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n        if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n      if (a = xe - ye) {\r\n        if (a > 0) {\r\n          ye = xe;\r\n          t = yc;\r\n        } else {\r\n          a = -a;\r\n          t = xc;\r\n        }\r\n\r\n        t.reverse();\r\n        for (; a--; t.push(0));\r\n        t.reverse();\r\n      }\r\n\r\n      a = xc.length;\r\n      b = yc.length;\r\n\r\n      // Point xc to the longer array, and b to the shorter length.\r\n      if (a - b < 0) t = yc, yc = xc, xc = t, b = a;\r\n\r\n      // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n      for (a = 0; b;) {\r\n        a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n        xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n      }\r\n\r\n      if (a) {\r\n        xc = [a].concat(xc);\r\n        ++ye;\r\n      }\r\n\r\n      // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n      // ye = MAX_EXP + 1 possible\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     * If sd is undefined or null or true or false, return the number of significant digits of\r\n     * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     * If sd is true include integer-part trailing zeros in the count.\r\n     *\r\n     * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n     *                     boolean: whether to count integer-part trailing zeros: true or false.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.precision = P.sd = function (sd, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (sd != null && sd !== !!sd) {\r\n        intCheck(sd, 1, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), sd, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      v = c.length - 1;\r\n      n = v * LOG_BASE + 1;\r\n\r\n      if (v = c[v]) {\r\n\r\n        // Subtract the number of trailing zeros of the last element.\r\n        for (; v % 10 == 0; v /= 10, n--);\r\n\r\n        // Add the number of digits of the first element.\r\n        for (v = c[0]; v >= 10; v /= 10, n++);\r\n      }\r\n\r\n      if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n     * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n     *\r\n     * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n     */\r\n    P.shiftedBy = function (k) {\r\n      intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n      return this.times('1e' + k);\r\n    };\r\n\r\n\r\n    /*\r\n     *  sqrt(-n) =  N\r\n     *  sqrt(N) =  N\r\n     *  sqrt(-I) =  N\r\n     *  sqrt(I) =  I\r\n     *  sqrt(0) =  0\r\n     *  sqrt(-0) = -0\r\n     *\r\n     * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n     * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.squareRoot = P.sqrt = function () {\r\n      var m, n, r, rep, t,\r\n        x = this,\r\n        c = x.c,\r\n        s = x.s,\r\n        e = x.e,\r\n        dp = DECIMAL_PLACES + 4,\r\n        half = new BigNumber('0.5');\r\n\r\n      // Negative/NaN/Infinity/zero?\r\n      if (s !== 1 || !c || !c[0]) {\r\n        return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n      }\r\n\r\n      // Initial estimate.\r\n      s = Math.sqrt(+x);\r\n\r\n      // Math.sqrt underflow/overflow?\r\n      // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n      if (s == 0 || s == 1 / 0) {\r\n        n = coeffToString(c);\r\n        if ((n.length + e) % 2 == 0) n += '0';\r\n        s = Math.sqrt(n);\r\n        e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n        if (s == 1 / 0) {\r\n          n = '1e' + e;\r\n        } else {\r\n          n = s.toExponential();\r\n          n = n.slice(0, n.indexOf('e') + 1) + e;\r\n        }\r\n\r\n        r = new BigNumber(n);\r\n      } else {\r\n        r = new BigNumber(s + '');\r\n      }\r\n\r\n      // Check for zero.\r\n      // r could be zero if MIN_EXP is changed after the this value was created.\r\n      // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n      // coeffToString to throw.\r\n      if (r.c[0]) {\r\n        e = r.e;\r\n        s = e + dp;\r\n        if (s < 3) s = 0;\r\n\r\n        // Newton-Raphson iteration.\r\n        for (; ;) {\r\n          t = r;\r\n          r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n          if (coeffToString(t.c  ).slice(0, s) === (n =\r\n             coeffToString(r.c)).slice(0, s)) {\r\n\r\n            // The exponent of r may here be one less than the final result exponent,\r\n            // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n            // are indexed correctly.\r\n            if (r.e < e) --s;\r\n            n = n.slice(s - 3, s + 1);\r\n\r\n            // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n            // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n            // iteration.\r\n            if (n == '9999' || !rep && n == '4999') {\r\n\r\n              // On the first iteration only, check to see if rounding up gives the\r\n              // exact result as the nines may infinitely repeat.\r\n              if (!rep) {\r\n                round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n                if (t.times(t).eq(x)) {\r\n                  r = t;\r\n                  break;\r\n                }\r\n              }\r\n\r\n              dp += 4;\r\n              s += 4;\r\n              rep = 1;\r\n            } else {\r\n\r\n              // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n              // result. If not, then there are further digits and m will be truthy.\r\n              if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n                // Truncate to the first rounding digit.\r\n                round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n                m = !r.times(r).eq(x);\r\n              }\r\n\r\n              break;\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in exponential notation and\r\n     * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toExponential = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp++;\r\n      }\r\n      return format(this, dp, rm, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n     * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n     * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toFixed = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp = dp + this.e + 1;\r\n      }\r\n      return format(this, dp, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n     * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n     * of the FORMAT object (see BigNumber.set).\r\n     *\r\n     * FORMAT = {\r\n     *      decimalSeparator : '.',\r\n     *      groupSeparator : ',',\r\n     *      groupSize : 3,\r\n     *      secondaryGroupSize : 0,\r\n     *      fractionGroupSeparator : '\\xA0',    // non-breaking space\r\n     *      fractionGroupSize : 0\r\n     * };\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toFormat = function (dp, rm) {\r\n      var str = this.toFixed(dp, rm);\r\n\r\n      if (this.c) {\r\n        var i,\r\n          arr = str.split('.'),\r\n          g1 = +FORMAT.groupSize,\r\n          g2 = +FORMAT.secondaryGroupSize,\r\n          groupSeparator = FORMAT.groupSeparator,\r\n          intPart = arr[0],\r\n          fractionPart = arr[1],\r\n          isNeg = this.s < 0,\r\n          intDigits = isNeg ? intPart.slice(1) : intPart,\r\n          len = intDigits.length;\r\n\r\n        if (g2) i = g1, g1 = g2, g2 = i, len -= i;\r\n\r\n        if (g1 > 0 && len > 0) {\r\n          i = len % g1 || g1;\r\n          intPart = intDigits.substr(0, i);\r\n\r\n          for (; i < len; i += g1) {\r\n            intPart += groupSeparator + intDigits.substr(i, g1);\r\n          }\r\n\r\n          if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n          if (isNeg) intPart = '-' + intPart;\r\n        }\r\n\r\n        str = fractionPart\r\n         ? intPart + FORMAT.decimalSeparator + ((g2 = +FORMAT.fractionGroupSize)\r\n          ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n           '$&' + FORMAT.fractionGroupSeparator)\r\n          : fractionPart)\r\n         : intPart;\r\n      }\r\n\r\n      return str;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string array representing the value of this BigNumber as a simple fraction with\r\n     * an integer numerator and an integer denominator. The denominator will be a positive\r\n     * non-zero value less than or equal to the specified maximum denominator. If a maximum\r\n     * denominator is not specified, the denominator will be the lowest value necessary to\r\n     * represent the number exactly.\r\n     *\r\n     * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n     *\r\n     * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n     */\r\n    P.toFraction = function (md) {\r\n      var arr, d, d0, d1, d2, e, exp, n, n0, n1, q, s,\r\n        x = this,\r\n        xc = x.c;\r\n\r\n      if (md != null) {\r\n        n = new BigNumber(md);\r\n\r\n        // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n        if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n          throw Error\r\n            (bignumberError + 'Argument ' +\r\n              (n.isInteger() ? 'out of range: ' : 'not an integer: ') + md);\r\n        }\r\n      }\r\n\r\n      if (!xc) return x.toString();\r\n\r\n      d = new BigNumber(ONE);\r\n      n1 = d0 = new BigNumber(ONE);\r\n      d1 = n0 = new BigNumber(ONE);\r\n      s = coeffToString(xc);\r\n\r\n      // Determine initial denominator.\r\n      // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n      e = d.e = s.length - x.e - 1;\r\n      d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n      md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n      exp = MAX_EXP;\r\n      MAX_EXP = 1 / 0;\r\n      n = new BigNumber(s);\r\n\r\n      // n0 = d1 = 0\r\n      n0.c[0] = 0;\r\n\r\n      for (; ;)  {\r\n        q = div(n, d, 0, 1);\r\n        d2 = d0.plus(q.times(d1));\r\n        if (d2.comparedTo(md) == 1) break;\r\n        d0 = d1;\r\n        d1 = d2;\r\n        n1 = n0.plus(q.times(d2 = n1));\r\n        n0 = d2;\r\n        d = n.minus(q.times(d2 = d));\r\n        n = d2;\r\n      }\r\n\r\n      d2 = div(md.minus(d0), d1, 0, 1);\r\n      n0 = n0.plus(d2.times(n1));\r\n      d0 = d0.plus(d2.times(d1));\r\n      n0.s = n1.s = x.s;\r\n      e *= 2;\r\n\r\n      // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n      arr = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n         div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1\r\n          ? [n1.toString(), d1.toString()]\r\n          : [n0.toString(), d0.toString()];\r\n\r\n      MAX_EXP = exp;\r\n      return arr;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return the value of this BigNumber converted to a number primitive.\r\n     */\r\n    P.toNumber = function () {\r\n      return +this;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n     * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n     * necessary to represent the integer part of the value in fixed-point notation, then use\r\n     * exponential notation.\r\n     *\r\n     * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.toPrecision = function (sd, rm) {\r\n      if (sd != null) intCheck(sd, 1, MAX);\r\n      return format(this, sd, rm, 2);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n     * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n     * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n     * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n     * TO_EXP_NEG, return exponential notation.\r\n     *\r\n     * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n     *\r\n     * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n     */\r\n    P.toString = function (b) {\r\n      var str,\r\n        n = this,\r\n        s = n.s,\r\n        e = n.e;\r\n\r\n      // Infinity or NaN?\r\n      if (e === null) {\r\n\r\n        if (s) {\r\n          str = 'Infinity';\r\n          if (s < 0) str = '-' + str;\r\n        } else {\r\n          str = 'NaN';\r\n        }\r\n      } else {\r\n        str = coeffToString(n.c);\r\n\r\n        if (b == null) {\r\n          str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n           ? toExponential(str, e)\r\n           : toFixedPoint(str, e, '0');\r\n        } else {\r\n          intCheck(b, 2, ALPHABET.length, 'Base');\r\n          str = convertBase(toFixedPoint(str, e, '0'), 10, b, s, true);\r\n        }\r\n\r\n        if (s < 0 && n.c[0]) str = '-' + str;\r\n      }\r\n\r\n      return str;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return as toString, but do not accept a base argument, and include the minus sign for\r\n     * negative zero.\r\n     */\r\n    P.valueOf = P.toJSON = function () {\r\n      var str,\r\n        n = this,\r\n        e = n.e;\r\n\r\n      if (e === null) return n.toString();\r\n\r\n      str = coeffToString(n.c);\r\n\r\n      str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n        ? toExponential(str, e)\r\n        : toFixedPoint(str, e, '0');\r\n\r\n      return n.s < 0 ? '-' + str : str;\r\n    };\r\n\r\n\r\n    P._isBigNumber = true;\r\n\r\n    if (configObject != null) BigNumber.set(configObject);\r\n\r\n    return BigNumber;\r\n  }\r\n\r\n\r\n  // PRIVATE HELPER FUNCTIONS\r\n\r\n\r\n  function bitFloor(n) {\r\n    var i = n | 0;\r\n    return n > 0 || n === i ? i : i - 1;\r\n  }\r\n\r\n\r\n  // Return a coefficient array as a string of base 10 digits.\r\n  function coeffToString(a) {\r\n    var s, z,\r\n      i = 1,\r\n      j = a.length,\r\n      r = a[0] + '';\r\n\r\n    for (; i < j;) {\r\n      s = a[i++] + '';\r\n      z = LOG_BASE - s.length;\r\n      for (; z--; s = '0' + s);\r\n      r += s;\r\n    }\r\n\r\n    // Determine trailing zeros.\r\n    for (j = r.length; r.charCodeAt(--j) === 48;);\r\n    return r.slice(0, j + 1 || 1);\r\n  }\r\n\r\n\r\n  // Compare the value of BigNumbers x and y.\r\n  function compare(x, y) {\r\n    var a, b,\r\n      xc = x.c,\r\n      yc = y.c,\r\n      i = x.s,\r\n      j = y.s,\r\n      k = x.e,\r\n      l = y.e;\r\n\r\n    // Either NaN?\r\n    if (!i || !j) return null;\r\n\r\n    a = xc && !xc[0];\r\n    b = yc && !yc[0];\r\n\r\n    // Either zero?\r\n    if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n    // Signs differ?\r\n    if (i != j) return i;\r\n\r\n    a = i < 0;\r\n    b = k == l;\r\n\r\n    // Either Infinity?\r\n    if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n    // Compare exponents.\r\n    if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n    j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n    // Compare lengths.\r\n    return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n   */\r\n  function intCheck(n, min, max, name) {\r\n    if (n < min || n > max || n !== (n < 0 ? mathceil(n) : mathfloor(n))) {\r\n      throw Error\r\n       (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n         ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n         : ' not a primitive number: ') + n);\r\n    }\r\n  }\r\n\r\n\r\n  function isArray(obj) {\r\n    return Object.prototype.toString.call(obj) == '[object Array]';\r\n  }\r\n\r\n\r\n  // Assumes finite n.\r\n  function isOdd(n) {\r\n    var k = n.c.length - 1;\r\n    return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n  }\r\n\r\n\r\n  function toExponential(str, e) {\r\n    return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n     (e < 0 ? 'e' : 'e+') + e;\r\n  }\r\n\r\n\r\n  function toFixedPoint(str, e, z) {\r\n    var len, zs;\r\n\r\n    // Negative exponent?\r\n    if (e < 0) {\r\n\r\n      // Prepend zeros.\r\n      for (zs = z + '.'; ++e; zs += z);\r\n      str = zs + str;\r\n\r\n    // Positive exponent\r\n    } else {\r\n      len = str.length;\r\n\r\n      // Append zeros.\r\n      if (++e > len) {\r\n        for (zs = z, e -= len; --e; zs += z);\r\n        str += zs;\r\n      } else if (e < len) {\r\n        str = str.slice(0, e) + '.' + str.slice(e);\r\n      }\r\n    }\r\n\r\n    return str;\r\n  }\r\n\r\n\r\n  // EXPORT\r\n\r\n\r\n  BigNumber = clone();\r\n  BigNumber['default'] = BigNumber.BigNumber = BigNumber;\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () { return BigNumber; });\r\n\r\n  // Node.js and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    module.exports = BigNumber;\r\n\r\n  // Browser.\r\n  } else {\r\n    if (!globalObject) {\r\n      globalObject = typeof self != 'undefined' && self ? self : window;\r\n    }\r\n\r\n    globalObject.BigNumber = BigNumber;\r\n  }\r\n})(this);\r\n","'use strict';\n\nvar objectAssign = require('object-assign');\n\n// compare and isBuffer taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js\n// original notice:\n\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>\n * @license  MIT\n */\nfunction compare(a, b) {\n  if (a === b) {\n    return 0;\n  }\n\n  var x = a.length;\n  var y = b.length;\n\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i];\n      y = b[i];\n      break;\n    }\n  }\n\n  if (x < y) {\n    return -1;\n  }\n  if (y < x) {\n    return 1;\n  }\n  return 0;\n}\nfunction isBuffer(b) {\n  if (global.Buffer && typeof global.Buffer.isBuffer === 'function') {\n    return global.Buffer.isBuffer(b);\n  }\n  return !!(b != null && b._isBuffer);\n}\n\n// based on node assert, original notice:\n// NB: The URL to the CommonJS spec is kept just for tradition.\n//     node-assert has evolved a lot since then, both in API and behavior.\n\n// http://wiki.commonjs.org/wiki/Unit_Testing/1.0\n//\n// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8!\n//\n// Originally from narwhal.js (http://narwhaljs.org)\n// Copyright (c) 2009 Thomas Robinson <280north.com>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the 'Software'), to\n// deal in the Software without restriction, including without limitation the\n// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n// sell copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar util = require('util/');\nvar hasOwn = Object.prototype.hasOwnProperty;\nvar pSlice = Array.prototype.slice;\nvar functionsHaveNames = (function () {\n  return function foo() {}.name === 'foo';\n}());\nfunction pToString (obj) {\n  return Object.prototype.toString.call(obj);\n}\nfunction isView(arrbuf) {\n  if (isBuffer(arrbuf)) {\n    return false;\n  }\n  if (typeof global.ArrayBuffer !== 'function') {\n    return false;\n  }\n  if (typeof ArrayBuffer.isView === 'function') {\n    return ArrayBuffer.isView(arrbuf);\n  }\n  if (!arrbuf) {\n    return false;\n  }\n  if (arrbuf instanceof DataView) {\n    return true;\n  }\n  if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) {\n    return true;\n  }\n  return false;\n}\n// 1. The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nvar assert = module.exports = ok;\n\n// 2. The AssertionError is defined in assert.\n// new assert.AssertionError({ message: message,\n//                             actual: actual,\n//                             expected: expected })\n\nvar regex = /\\s*function\\s+([^\\(\\s]*)\\s*/;\n// based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js\nfunction getName(func) {\n  if (!util.isFunction(func)) {\n    return;\n  }\n  if (functionsHaveNames) {\n    return func.name;\n  }\n  var str = func.toString();\n  var match = str.match(regex);\n  return match && match[1];\n}\nassert.AssertionError = function AssertionError(options) {\n  this.name = 'AssertionError';\n  this.actual = options.actual;\n  this.expected = options.expected;\n  this.operator = options.operator;\n  if (options.message) {\n    this.message = options.message;\n    this.generatedMessage = false;\n  } else {\n    this.message = getMessage(this);\n    this.generatedMessage = true;\n  }\n  var stackStartFunction = options.stackStartFunction || fail;\n  if (Error.captureStackTrace) {\n    Error.captureStackTrace(this, stackStartFunction);\n  } else {\n    // non v8 browsers so we can have a stacktrace\n    var err = new Error();\n    if (err.stack) {\n      var out = err.stack;\n\n      // try to strip useless frames\n      var fn_name = getName(stackStartFunction);\n      var idx = out.indexOf('\\n' + fn_name);\n      if (idx >= 0) {\n        // once we have located the function frame\n        // we need to strip out everything before it (and its line)\n        var next_line = out.indexOf('\\n', idx + 1);\n        out = out.substring(next_line + 1);\n      }\n\n      this.stack = out;\n    }\n  }\n};\n\n// assert.AssertionError instanceof Error\nutil.inherits(assert.AssertionError, Error);\n\nfunction truncate(s, n) {\n  if (typeof s === 'string') {\n    return s.length < n ? s : s.slice(0, n);\n  } else {\n    return s;\n  }\n}\nfunction inspect(something) {\n  if (functionsHaveNames || !util.isFunction(something)) {\n    return util.inspect(something);\n  }\n  var rawname = getName(something);\n  var name = rawname ? ': ' + rawname : '';\n  return '[Function' +  name + ']';\n}\nfunction getMessage(self) {\n  return truncate(inspect(self.actual), 128) + ' ' +\n         self.operator + ' ' +\n         truncate(inspect(self.expected), 128);\n}\n\n// At present only the three keys mentioned above are used and\n// understood by the spec. Implementations or sub modules can pass\n// other keys to the AssertionError's constructor - they will be\n// ignored.\n\n// 3. All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided.  All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction fail(actual, expected, message, operator, stackStartFunction) {\n  throw new assert.AssertionError({\n    message: message,\n    actual: actual,\n    expected: expected,\n    operator: operator,\n    stackStartFunction: stackStartFunction\n  });\n}\n\n// EXTENSION! allows for well behaved errors defined elsewhere.\nassert.fail = fail;\n\n// 4. Pure assertion tests whether a value is truthy, as determined\n// by !!guard.\n// assert.ok(guard, message_opt);\n// This statement is equivalent to assert.equal(true, !!guard,\n// message_opt);. To test strictly for the value true, use\n// assert.strictEqual(true, guard, message_opt);.\n\nfunction ok(value, message) {\n  if (!value) fail(value, true, message, '==', assert.ok);\n}\nassert.ok = ok;\n\n// 5. The equality assertion tests shallow, coercive equality with\n// ==.\n// assert.equal(actual, expected, message_opt);\n\nassert.equal = function equal(actual, expected, message) {\n  if (actual != expected) fail(actual, expected, message, '==', assert.equal);\n};\n\n// 6. The non-equality assertion tests for whether two objects are not equal\n// with != assert.notEqual(actual, expected, message_opt);\n\nassert.notEqual = function notEqual(actual, expected, message) {\n  if (actual == expected) {\n    fail(actual, expected, message, '!=', assert.notEqual);\n  }\n};\n\n// 7. The equivalence assertion tests a deep equality relation.\n// assert.deepEqual(actual, expected, message_opt);\n\nassert.deepEqual = function deepEqual(actual, expected, message) {\n  if (!_deepEqual(actual, expected, false)) {\n    fail(actual, expected, message, 'deepEqual', assert.deepEqual);\n  }\n};\n\nassert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {\n  if (!_deepEqual(actual, expected, true)) {\n    fail(actual, expected, message, 'deepStrictEqual', assert.deepStrictEqual);\n  }\n};\n\nfunction _deepEqual(actual, expected, strict, memos) {\n  // 7.1. All identical values are equivalent, as determined by ===.\n  if (actual === expected) {\n    return true;\n  } else if (isBuffer(actual) && isBuffer(expected)) {\n    return compare(actual, expected) === 0;\n\n  // 7.2. If the expected value is a Date object, the actual value is\n  // equivalent if it is also a Date object that refers to the same time.\n  } else if (util.isDate(actual) && util.isDate(expected)) {\n    return actual.getTime() === expected.getTime();\n\n  // 7.3 If the expected value is a RegExp object, the actual value is\n  // equivalent if it is also a RegExp object with the same source and\n  // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).\n  } else if (util.isRegExp(actual) && util.isRegExp(expected)) {\n    return actual.source === expected.source &&\n           actual.global === expected.global &&\n           actual.multiline === expected.multiline &&\n           actual.lastIndex === expected.lastIndex &&\n           actual.ignoreCase === expected.ignoreCase;\n\n  // 7.4. Other pairs that do not both pass typeof value == 'object',\n  // equivalence is determined by ==.\n  } else if ((actual === null || typeof actual !== 'object') &&\n             (expected === null || typeof expected !== 'object')) {\n    return strict ? actual === expected : actual == expected;\n\n  // If both values are instances of typed arrays, wrap their underlying\n  // ArrayBuffers in a Buffer each to increase performance\n  // This optimization requires the arrays to have the same type as checked by\n  // Object.prototype.toString (aka pToString). Never perform binary\n  // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their\n  // bit patterns are not identical.\n  } else if (isView(actual) && isView(expected) &&\n             pToString(actual) === pToString(expected) &&\n             !(actual instanceof Float32Array ||\n               actual instanceof Float64Array)) {\n    return compare(new Uint8Array(actual.buffer),\n                   new Uint8Array(expected.buffer)) === 0;\n\n  // 7.5 For all other Object pairs, including Array objects, equivalence is\n  // determined by having the same number of owned properties (as verified\n  // with Object.prototype.hasOwnProperty.call), the same set of keys\n  // (although not necessarily the same order), equivalent values for every\n  // corresponding key, and an identical 'prototype' property. Note: this\n  // accounts for both named and indexed properties on Arrays.\n  } else if (isBuffer(actual) !== isBuffer(expected)) {\n    return false;\n  } else {\n    memos = memos || {actual: [], expected: []};\n\n    var actualIndex = memos.actual.indexOf(actual);\n    if (actualIndex !== -1) {\n      if (actualIndex === memos.expected.indexOf(expected)) {\n        return true;\n      }\n    }\n\n    memos.actual.push(actual);\n    memos.expected.push(expected);\n\n    return objEquiv(actual, expected, strict, memos);\n  }\n}\n\nfunction isArguments(object) {\n  return Object.prototype.toString.call(object) == '[object Arguments]';\n}\n\nfunction objEquiv(a, b, strict, actualVisitedObjects) {\n  if (a === null || a === undefined || b === null || b === undefined)\n    return false;\n  // if one is a primitive, the other must be same\n  if (util.isPrimitive(a) || util.isPrimitive(b))\n    return a === b;\n  if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))\n    return false;\n  var aIsArgs = isArguments(a);\n  var bIsArgs = isArguments(b);\n  if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))\n    return false;\n  if (aIsArgs) {\n    a = pSlice.call(a);\n    b = pSlice.call(b);\n    return _deepEqual(a, b, strict);\n  }\n  var ka = objectKeys(a);\n  var kb = objectKeys(b);\n  var key, i;\n  // having the same number of owned properties (keys incorporates\n  // hasOwnProperty)\n  if (ka.length !== kb.length)\n    return false;\n  //the same set of keys (although not necessarily the same order),\n  ka.sort();\n  kb.sort();\n  //~~~cheap key test\n  for (i = ka.length - 1; i >= 0; i--) {\n    if (ka[i] !== kb[i])\n      return false;\n  }\n  //equivalent values for every corresponding key, and\n  //~~~possibly expensive deep test\n  for (i = ka.length - 1; i >= 0; i--) {\n    key = ka[i];\n    if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects))\n      return false;\n  }\n  return true;\n}\n\n// 8. The non-equivalence assertion tests for any deep inequality.\n// assert.notDeepEqual(actual, expected, message_opt);\n\nassert.notDeepEqual = function notDeepEqual(actual, expected, message) {\n  if (_deepEqual(actual, expected, false)) {\n    fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual);\n  }\n};\n\nassert.notDeepStrictEqual = notDeepStrictEqual;\nfunction notDeepStrictEqual(actual, expected, message) {\n  if (_deepEqual(actual, expected, true)) {\n    fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual);\n  }\n}\n\n\n// 9. The strict equality assertion tests strict equality, as determined by ===.\n// assert.strictEqual(actual, expected, message_opt);\n\nassert.strictEqual = function strictEqual(actual, expected, message) {\n  if (actual !== expected) {\n    fail(actual, expected, message, '===', assert.strictEqual);\n  }\n};\n\n// 10. The strict non-equality assertion tests for strict inequality, as\n// determined by !==.  assert.notStrictEqual(actual, expected, message_opt);\n\nassert.notStrictEqual = function notStrictEqual(actual, expected, message) {\n  if (actual === expected) {\n    fail(actual, expected, message, '!==', assert.notStrictEqual);\n  }\n};\n\nfunction expectedException(actual, expected) {\n  if (!actual || !expected) {\n    return false;\n  }\n\n  if (Object.prototype.toString.call(expected) == '[object RegExp]') {\n    return expected.test(actual);\n  }\n\n  try {\n    if (actual instanceof expected) {\n      return true;\n    }\n  } catch (e) {\n    // Ignore.  The instanceof check doesn't work for arrow functions.\n  }\n\n  if (Error.isPrototypeOf(expected)) {\n    return false;\n  }\n\n  return expected.call({}, actual) === true;\n}\n\nfunction _tryBlock(block) {\n  var error;\n  try {\n    block();\n  } catch (e) {\n    error = e;\n  }\n  return error;\n}\n\nfunction _throws(shouldThrow, block, expected, message) {\n  var actual;\n\n  if (typeof block !== 'function') {\n    throw new TypeError('\"block\" argument must be a function');\n  }\n\n  if (typeof expected === 'string') {\n    message = expected;\n    expected = null;\n  }\n\n  actual = _tryBlock(block);\n\n  message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +\n            (message ? ' ' + message : '.');\n\n  if (shouldThrow && !actual) {\n    fail(actual, expected, 'Missing expected exception' + message);\n  }\n\n  var userProvidedMessage = typeof message === 'string';\n  var isUnwantedException = !shouldThrow && util.isError(actual);\n  var isUnexpectedException = !shouldThrow && actual && !expected;\n\n  if ((isUnwantedException &&\n      userProvidedMessage &&\n      expectedException(actual, expected)) ||\n      isUnexpectedException) {\n    fail(actual, expected, 'Got unwanted exception' + message);\n  }\n\n  if ((shouldThrow && actual && expected &&\n      !expectedException(actual, expected)) || (!shouldThrow && actual)) {\n    throw actual;\n  }\n}\n\n// 11. Expected to throw an error:\n// assert.throws(block, Error_opt, message_opt);\n\nassert.throws = function(block, /*optional*/error, /*optional*/message) {\n  _throws(true, block, error, message);\n};\n\n// EXTENSION! This is annoying to write outside this module.\nassert.doesNotThrow = function(block, /*optional*/error, /*optional*/message) {\n  _throws(false, block, error, message);\n};\n\nassert.ifError = function(err) { if (err) throw err; };\n\n// Expose a strict only variant of assert\nfunction strict(value, message) {\n  if (!value) fail(value, true, message, '==', strict);\n}\nassert.strict = objectAssign(strict, assert, {\n  equal: assert.strictEqual,\n  deepEqual: assert.deepStrictEqual,\n  notEqual: assert.notStrictEqual,\n  notDeepEqual: assert.notDeepStrictEqual\n});\nassert.strict.strict = assert.strict;\n\nvar objectKeys = Object.keys || function (obj) {\n  var keys = [];\n  for (var key in obj) {\n    if (hasOwn.call(obj, key)) keys.push(key);\n  }\n  return keys;\n};\n","var toFinite = require('./toFinite');\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var asciiSize = require('./_asciiSize'),\n    hasUnicode = require('./_hasUnicode'),\n    unicodeSize = require('./_unicodeSize');\n\n/**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\nfunction stringSize(string) {\n  return hasUnicode(string)\n    ? unicodeSize(string)\n    : asciiSize(string);\n}\n\nmodule.exports = stringSize;\n","export default function _isPlaceholder(a) {\n       return a != null && typeof a === 'object' && a['@@functional/placeholder'] === true;\n}","import _isPlaceholder from './_isPlaceholder';\n\n/**\n * Optimized internal one-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curry1(fn) {\n  return function f1(a) {\n    if (arguments.length === 0 || _isPlaceholder(a)) {\n      return f1;\n    } else {\n      return fn.apply(this, arguments);\n    }\n  };\n}","import _curry1 from './internal/_curry1';\n\n/**\n * Returns a function that always returns the given value. Note that for\n * non-primitives the value returned is a reference to the original value.\n *\n * This function is known as `const`, `constant`, or `K` (for K combinator) in\n * other languages and libraries.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig a -> (* -> a)\n * @param {*} val The value to wrap in a function\n * @return {Function} A Function :: * -> val.\n * @example\n *\n *      var t = R.always('Tee');\n *      t(); //=> 'Tee'\n */\nvar always = /*#__PURE__*/_curry1(function always(val) {\n  return function () {\n    return val;\n  };\n});\nexport default always;","import always from './always';\n\n/**\n * A function that always returns `false`. Any passed in parameters are ignored.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig * -> Boolean\n * @param {*}\n * @return {Boolean}\n * @see R.always, R.T\n * @example\n *\n *      R.F(); //=> false\n */\nvar F = /*#__PURE__*/always(false);\nexport default F;","import always from './always';\n\n/**\n * A function that always returns `true`. Any passed in parameters are ignored.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig * -> Boolean\n * @param {*}\n * @return {Boolean}\n * @see R.always, R.F\n * @example\n *\n *      R.T(); //=> true\n */\nvar T = /*#__PURE__*/always(true);\nexport default T;","/**\n * A special placeholder value used to specify \"gaps\" within curried functions,\n * allowing partial application of any combination of arguments, regardless of\n * their positions.\n *\n * If `g` is a curried ternary function and `_` is `R.__`, the following are\n * equivalent:\n *\n *   - `g(1, 2, 3)`\n *   - `g(_, 2, 3)(1)`\n *   - `g(_, _, 3)(1)(2)`\n *   - `g(_, _, 3)(1, 2)`\n *   - `g(_, 2, _)(1, 3)`\n *   - `g(_, 2)(1)(3)`\n *   - `g(_, 2)(1, 3)`\n *   - `g(_, 2)(_, 3)(1)`\n *\n * @constant\n * @memberOf R\n * @since v0.6.0\n * @category Function\n * @example\n *\n *      var greet = R.replace('{name}', R.__, 'Hello, {name}!');\n *      greet('Alice'); //=> 'Hello, Alice!'\n */\nexport default { '@@functional/placeholder': true };","import _curry1 from './_curry1';\nimport _isPlaceholder from './_isPlaceholder';\n\n/**\n * Optimized internal two-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curry2(fn) {\n  return function f2(a, b) {\n    switch (arguments.length) {\n      case 0:\n        return f2;\n      case 1:\n        return _isPlaceholder(a) ? f2 : _curry1(function (_b) {\n          return fn(a, _b);\n        });\n      default:\n        return _isPlaceholder(a) && _isPlaceholder(b) ? f2 : _isPlaceholder(a) ? _curry1(function (_a) {\n          return fn(_a, b);\n        }) : _isPlaceholder(b) ? _curry1(function (_b) {\n          return fn(a, _b);\n        }) : fn(a, b);\n    }\n  };\n}","import _curry2 from './internal/_curry2';\n\n/**\n * Adds two values.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a\n * @param {Number} b\n * @return {Number}\n * @see R.subtract\n * @example\n *\n *      R.add(2, 3);       //=>  5\n *      R.add(7)(10);      //=> 17\n */\nvar add = /*#__PURE__*/_curry2(function add(a, b) {\n  return Number(a) + Number(b);\n});\nexport default add;","/**\n * Private `concat` function to merge two array-like objects.\n *\n * @private\n * @param {Array|Arguments} [set1=[]] An array-like object.\n * @param {Array|Arguments} [set2=[]] An array-like object.\n * @return {Array} A new, merged array.\n * @example\n *\n *      _concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]\n */\nexport default function _concat(set1, set2) {\n  set1 = set1 || [];\n  set2 = set2 || [];\n  var idx;\n  var len1 = set1.length;\n  var len2 = set2.length;\n  var result = [];\n\n  idx = 0;\n  while (idx < len1) {\n    result[result.length] = set1[idx];\n    idx += 1;\n  }\n  idx = 0;\n  while (idx < len2) {\n    result[result.length] = set2[idx];\n    idx += 1;\n  }\n  return result;\n}","export default function _arity(n, fn) {\n  /* eslint-disable no-unused-vars */\n  switch (n) {\n    case 0:\n      return function () {\n        return fn.apply(this, arguments);\n      };\n    case 1:\n      return function (a0) {\n        return fn.apply(this, arguments);\n      };\n    case 2:\n      return function (a0, a1) {\n        return fn.apply(this, arguments);\n      };\n    case 3:\n      return function (a0, a1, a2) {\n        return fn.apply(this, arguments);\n      };\n    case 4:\n      return function (a0, a1, a2, a3) {\n        return fn.apply(this, arguments);\n      };\n    case 5:\n      return function (a0, a1, a2, a3, a4) {\n        return fn.apply(this, arguments);\n      };\n    case 6:\n      return function (a0, a1, a2, a3, a4, a5) {\n        return fn.apply(this, arguments);\n      };\n    case 7:\n      return function (a0, a1, a2, a3, a4, a5, a6) {\n        return fn.apply(this, arguments);\n      };\n    case 8:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7) {\n        return fn.apply(this, arguments);\n      };\n    case 9:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {\n        return fn.apply(this, arguments);\n      };\n    case 10:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {\n        return fn.apply(this, arguments);\n      };\n    default:\n      throw new Error('First argument to _arity must be a non-negative integer no greater than ten');\n  }\n}","import _arity from './_arity';\nimport _isPlaceholder from './_isPlaceholder';\n\n/**\n * Internal curryN function.\n *\n * @private\n * @category Function\n * @param {Number} length The arity of the curried function.\n * @param {Array} received An array of arguments received thus far.\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curryN(length, received, fn) {\n  return function () {\n    var combined = [];\n    var argsIdx = 0;\n    var left = length;\n    var combinedIdx = 0;\n    while (combinedIdx < received.length || argsIdx < arguments.length) {\n      var result;\n      if (combinedIdx < received.length && (!_isPlaceholder(received[combinedIdx]) || argsIdx >= arguments.length)) {\n        result = received[combinedIdx];\n      } else {\n        result = arguments[argsIdx];\n        argsIdx += 1;\n      }\n      combined[combinedIdx] = result;\n      if (!_isPlaceholder(result)) {\n        left -= 1;\n      }\n      combinedIdx += 1;\n    }\n    return left <= 0 ? fn.apply(this, combined) : _arity(left, _curryN(length, combined, fn));\n  };\n}","import _arity from './internal/_arity';\nimport _curry1 from './internal/_curry1';\nimport _curry2 from './internal/_curry2';\nimport _curryN from './internal/_curryN';\n\n/**\n * Returns a curried equivalent of the provided function, with the specified\n * arity. The curried function has two unusual capabilities. First, its\n * arguments needn't be provided one at a time. If `g` is `R.curryN(3, f)`, the\n * following are equivalent:\n *\n *   - `g(1)(2)(3)`\n *   - `g(1)(2, 3)`\n *   - `g(1, 2)(3)`\n *   - `g(1, 2, 3)`\n *\n * Secondly, the special placeholder value [`R.__`](#__) may be used to specify\n * \"gaps\", allowing partial application of any combination of arguments,\n * regardless of their positions. If `g` is as above and `_` is [`R.__`](#__),\n * the following are equivalent:\n *\n *   - `g(1, 2, 3)`\n *   - `g(_, 2, 3)(1)`\n *   - `g(_, _, 3)(1)(2)`\n *   - `g(_, _, 3)(1, 2)`\n *   - `g(_, 2)(1)(3)`\n *   - `g(_, 2)(1, 3)`\n *   - `g(_, 2)(_, 3)(1)`\n *\n * @func\n * @memberOf R\n * @since v0.5.0\n * @category Function\n * @sig Number -> (* -> a) -> (* -> a)\n * @param {Number} length The arity for the returned function.\n * @param {Function} fn The function to curry.\n * @return {Function} A new, curried function.\n * @see R.curry\n * @example\n *\n *      var sumArgs = (...args) => R.sum(args);\n *\n *      var curriedAddFourNumbers = R.curryN(4, sumArgs);\n *      var f = curriedAddFourNumbers(1, 2);\n *      var g = f(3);\n *      g(4); //=> 10\n */\nvar curryN = /*#__PURE__*/_curry2(function curryN(length, fn) {\n  if (length === 1) {\n    return _curry1(fn);\n  }\n  return _arity(length, _curryN(length, [], fn));\n});\nexport default curryN;","import _concat from './internal/_concat';\nimport _curry1 from './internal/_curry1';\nimport curryN from './curryN';\n\n/**\n * Creates a new list iteration function from an existing one by adding two new\n * parameters to its callback function: the current index, and the entire list.\n *\n * This would turn, for instance, [`R.map`](#map) function into one that\n * more closely resembles `Array.prototype.map`. Note that this will only work\n * for functions in which the iteration callback function is the first\n * parameter, and where the list is the last parameter. (This latter might be\n * unimportant if the list parameter is not used.)\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Function\n * @category List\n * @sig ((a ... -> b) ... -> [a] -> *) -> (a ..., Int, [a] -> b) ... -> [a] -> *)\n * @param {Function} fn A list iteration function that does not pass index or list to its callback\n * @return {Function} An altered list iteration function that passes (item, index, list) to its callback\n * @example\n *\n *      var mapIndexed = R.addIndex(R.map);\n *      mapIndexed((val, idx) => idx + '-' + val, ['f', 'o', 'o', 'b', 'a', 'r']);\n *      //=> ['0-f', '1-o', '2-o', '3-b', '4-a', '5-r']\n */\nvar addIndex = /*#__PURE__*/_curry1(function addIndex(fn) {\n  return curryN(fn.length, function () {\n    var idx = 0;\n    var origFn = arguments[0];\n    var list = arguments[arguments.length - 1];\n    var args = Array.prototype.slice.call(arguments, 0);\n    args[0] = function () {\n      var result = origFn.apply(this, _concat(arguments, [idx, list]));\n      idx += 1;\n      return result;\n    };\n    return fn.apply(this, args);\n  });\n});\nexport default addIndex;","import _curry1 from './_curry1';\nimport _curry2 from './_curry2';\nimport _isPlaceholder from './_isPlaceholder';\n\n/**\n * Optimized internal three-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curry3(fn) {\n  return function f3(a, b, c) {\n    switch (arguments.length) {\n      case 0:\n        return f3;\n      case 1:\n        return _isPlaceholder(a) ? f3 : _curry2(function (_b, _c) {\n          return fn(a, _b, _c);\n        });\n      case 2:\n        return _isPlaceholder(a) && _isPlaceholder(b) ? f3 : _isPlaceholder(a) ? _curry2(function (_a, _c) {\n          return fn(_a, b, _c);\n        }) : _isPlaceholder(b) ? _curry2(function (_b, _c) {\n          return fn(a, _b, _c);\n        }) : _curry1(function (_c) {\n          return fn(a, b, _c);\n        });\n      default:\n        return _isPlaceholder(a) && _isPlaceholder(b) && _isPlaceholder(c) ? f3 : _isPlaceholder(a) && _isPlaceholder(b) ? _curry2(function (_a, _b) {\n          return fn(_a, _b, c);\n        }) : _isPlaceholder(a) && _isPlaceholder(c) ? _curry2(function (_a, _c) {\n          return fn(_a, b, _c);\n        }) : _isPlaceholder(b) && _isPlaceholder(c) ? _curry2(function (_b, _c) {\n          return fn(a, _b, _c);\n        }) : _isPlaceholder(a) ? _curry1(function (_a) {\n          return fn(_a, b, c);\n        }) : _isPlaceholder(b) ? _curry1(function (_b) {\n          return fn(a, _b, c);\n        }) : _isPlaceholder(c) ? _curry1(function (_c) {\n          return fn(a, b, _c);\n        }) : fn(a, b, c);\n    }\n  };\n}","import _concat from './internal/_concat';\nimport _curry3 from './internal/_curry3';\n\n/**\n * Applies a function to the value at the given index of an array, returning a\n * new copy of the array with the element at the given index replaced with the\n * result of the function application.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig (a -> a) -> Number -> [a] -> [a]\n * @param {Function} fn The function to apply.\n * @param {Number} idx The index.\n * @param {Array|Arguments} list An array-like object whose value\n *        at the supplied index will be replaced.\n * @return {Array} A copy of the supplied array-like object with\n *         the element at index `idx` replaced with the value\n *         returned by applying `fn` to the existing element.\n * @see R.update\n * @example\n *\n *      R.adjust(R.add(10), 1, [1, 2, 3]);     //=> [1, 12, 3]\n *      R.adjust(R.add(10))(1)([1, 2, 3]);     //=> [1, 12, 3]\n * @symb R.adjust(f, -1, [a, b]) = [a, f(b)]\n * @symb R.adjust(f, 0, [a, b]) = [f(a), b]\n */\nvar adjust = /*#__PURE__*/_curry3(function adjust(fn, idx, list) {\n  if (idx >= list.length || idx < -list.length) {\n    return list;\n  }\n  var start = idx < 0 ? list.length : 0;\n  var _idx = start + idx;\n  var _list = _concat(list);\n  _list[_idx] = fn(list[_idx]);\n  return _list;\n});\nexport default adjust;","/**\n * Tests whether or not an object is an array.\n *\n * @private\n * @param {*} val The object to test.\n * @return {Boolean} `true` if `val` is an array, `false` otherwise.\n * @example\n *\n *      _isArray([]); //=> true\n *      _isArray(null); //=> false\n *      _isArray({}); //=> false\n */\nexport default Array.isArray || function _isArray(val) {\n  return val != null && val.length >= 0 && Object.prototype.toString.call(val) === '[object Array]';\n};","export default function _isTransformer(obj) {\n  return typeof obj['@@transducer/step'] === 'function';\n}","import _isArray from './_isArray';\nimport _isTransformer from './_isTransformer';\n\n/**\n * Returns a function that dispatches with different strategies based on the\n * object in list position (last argument). If it is an array, executes [fn].\n * Otherwise, if it has a function with one of the given method names, it will\n * execute that function (functor case). Otherwise, if it is a transformer,\n * uses transducer [xf] to return a new transformer (transducer case).\n * Otherwise, it will default to executing [fn].\n *\n * @private\n * @param {Array} methodNames properties to check for a custom implementation\n * @param {Function} xf transducer to initialize if object is transformer\n * @param {Function} fn default ramda implementation\n * @return {Function} A function that dispatches on object in list position\n */\nexport default function _dispatchable(methodNames, xf, fn) {\n  return function () {\n    if (arguments.length === 0) {\n      return fn();\n    }\n    var args = Array.prototype.slice.call(arguments, 0);\n    var obj = args.pop();\n    if (!_isArray(obj)) {\n      var idx = 0;\n      while (idx < methodNames.length) {\n        if (typeof obj[methodNames[idx]] === 'function') {\n          return obj[methodNames[idx]].apply(obj, args);\n        }\n        idx += 1;\n      }\n      if (_isTransformer(obj)) {\n        var transducer = xf.apply(null, args);\n        return transducer(obj);\n      }\n    }\n    return fn.apply(this, arguments);\n  };\n}","export default function _reduced(x) {\n  return x && x['@@transducer/reduced'] ? x : {\n    '@@transducer/value': x,\n    '@@transducer/reduced': true\n  };\n}","export default {\n  init: function () {\n    return this.xf['@@transducer/init']();\n  },\n  result: function (result) {\n    return this.xf['@@transducer/result'](result);\n  }\n};","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XAll = /*#__PURE__*/function () {\n  function XAll(f, xf) {\n    this.xf = xf;\n    this.f = f;\n    this.all = true;\n  }\n  XAll.prototype['@@transducer/init'] = _xfBase.init;\n  XAll.prototype['@@transducer/result'] = function (result) {\n    if (this.all) {\n      result = this.xf['@@transducer/step'](result, true);\n    }\n    return this.xf['@@transducer/result'](result);\n  };\n  XAll.prototype['@@transducer/step'] = function (result, input) {\n    if (!this.f(input)) {\n      this.all = false;\n      result = _reduced(this.xf['@@transducer/step'](result, false));\n    }\n    return result;\n  };\n\n  return XAll;\n}();\n\nvar _xall = /*#__PURE__*/_curry2(function _xall(f, xf) {\n  return new XAll(f, xf);\n});\nexport default _xall;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xall from './internal/_xall';\n\n/**\n * Returns `true` if all elements of the list match the predicate, `false` if\n * there are any that don't.\n *\n * Dispatches to the `all` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is satisfied by every element, `false`\n *         otherwise.\n * @see R.any, R.none, R.transduce\n * @example\n *\n *      var equals3 = R.equals(3);\n *      R.all(equals3)([3, 3, 3, 3]); //=> true\n *      R.all(equals3)([3, 3, 1, 3]); //=> false\n */\nvar all = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['all'], _xall, function all(fn, list) {\n  var idx = 0;\n  while (idx < list.length) {\n    if (!fn(list[idx])) {\n      return false;\n    }\n    idx += 1;\n  }\n  return true;\n}));\nexport default all;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns the larger of its two arguments.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> a\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.maxBy, R.min\n * @example\n *\n *      R.max(789, 123); //=> 789\n *      R.max('a', 'b'); //=> 'b'\n */\nvar max = /*#__PURE__*/_curry2(function max(a, b) {\n  return b > a ? b : a;\n});\nexport default max;","export default function _map(fn, functor) {\n  var idx = 0;\n  var len = functor.length;\n  var result = Array(len);\n  while (idx < len) {\n    result[idx] = fn(functor[idx]);\n    idx += 1;\n  }\n  return result;\n}","export default function _isString(x) {\n  return Object.prototype.toString.call(x) === '[object String]';\n}","import _curry1 from './_curry1';\nimport _isArray from './_isArray';\nimport _isString from './_isString';\n\n/**\n * Tests whether or not an object is similar to an array.\n *\n * @private\n * @category Type\n * @category List\n * @sig * -> Boolean\n * @param {*} x The object to test.\n * @return {Boolean} `true` if `x` has a numeric length property and extreme indices defined; `false` otherwise.\n * @example\n *\n *      _isArrayLike([]); //=> true\n *      _isArrayLike(true); //=> false\n *      _isArrayLike({}); //=> false\n *      _isArrayLike({length: 10}); //=> false\n *      _isArrayLike({0: 'zero', 9: 'nine', length: 10}); //=> true\n */\nvar _isArrayLike = /*#__PURE__*/_curry1(function isArrayLike(x) {\n  if (_isArray(x)) {\n    return true;\n  }\n  if (!x) {\n    return false;\n  }\n  if (typeof x !== 'object') {\n    return false;\n  }\n  if (_isString(x)) {\n    return false;\n  }\n  if (x.nodeType === 1) {\n    return !!x.length;\n  }\n  if (x.length === 0) {\n    return true;\n  }\n  if (x.length > 0) {\n    return x.hasOwnProperty(0) && x.hasOwnProperty(x.length - 1);\n  }\n  return false;\n});\nexport default _isArrayLike;","var XWrap = /*#__PURE__*/function () {\n  function XWrap(fn) {\n    this.f = fn;\n  }\n  XWrap.prototype['@@transducer/init'] = function () {\n    throw new Error('init not implemented on XWrap');\n  };\n  XWrap.prototype['@@transducer/result'] = function (acc) {\n    return acc;\n  };\n  XWrap.prototype['@@transducer/step'] = function (acc, x) {\n    return this.f(acc, x);\n  };\n\n  return XWrap;\n}();\n\nexport default function _xwrap(fn) {\n  return new XWrap(fn);\n}","import _arity from './internal/_arity';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Creates a function that is bound to a context.\n * Note: `R.bind` does not provide the additional argument-binding capabilities of\n * [Function.prototype.bind](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/bind).\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Function\n * @category Object\n * @sig (* -> *) -> {*} -> (* -> *)\n * @param {Function} fn The function to bind to context\n * @param {Object} thisObj The context to bind `fn` to\n * @return {Function} A function that will execute in the context of `thisObj`.\n * @see R.partial\n * @example\n *\n *      var log = R.bind(console.log, console);\n *      R.pipe(R.assoc('a', 2), R.tap(log), R.assoc('a', 3))({a: 1}); //=> {a: 3}\n *      // logs {a: 2}\n * @symb R.bind(f, o)(a, b) = f.call(o, a, b)\n */\nvar bind = /*#__PURE__*/_curry2(function bind(fn, thisObj) {\n  return _arity(fn.length, function () {\n    return fn.apply(thisObj, arguments);\n  });\n});\nexport default bind;","import _isArrayLike from './_isArrayLike';\nimport _xwrap from './_xwrap';\nimport bind from '../bind';\n\nfunction _arrayReduce(xf, acc, list) {\n  var idx = 0;\n  var len = list.length;\n  while (idx < len) {\n    acc = xf['@@transducer/step'](acc, list[idx]);\n    if (acc && acc['@@transducer/reduced']) {\n      acc = acc['@@transducer/value'];\n      break;\n    }\n    idx += 1;\n  }\n  return xf['@@transducer/result'](acc);\n}\n\nfunction _iterableReduce(xf, acc, iter) {\n  var step = iter.next();\n  while (!step.done) {\n    acc = xf['@@transducer/step'](acc, step.value);\n    if (acc && acc['@@transducer/reduced']) {\n      acc = acc['@@transducer/value'];\n      break;\n    }\n    step = iter.next();\n  }\n  return xf['@@transducer/result'](acc);\n}\n\nfunction _methodReduce(xf, acc, obj, methodName) {\n  return xf['@@transducer/result'](obj[methodName](bind(xf['@@transducer/step'], xf), acc));\n}\n\nvar symIterator = typeof Symbol !== 'undefined' ? Symbol.iterator : '@@iterator';\n\nexport default function _reduce(fn, acc, list) {\n  if (typeof fn === 'function') {\n    fn = _xwrap(fn);\n  }\n  if (_isArrayLike(list)) {\n    return _arrayReduce(fn, acc, list);\n  }\n  if (typeof list['fantasy-land/reduce'] === 'function') {\n    return _methodReduce(fn, acc, list, 'fantasy-land/reduce');\n  }\n  if (list[symIterator] != null) {\n    return _iterableReduce(fn, acc, list[symIterator]());\n  }\n  if (typeof list.next === 'function') {\n    return _iterableReduce(fn, acc, list);\n  }\n  if (typeof list.reduce === 'function') {\n    return _methodReduce(fn, acc, list, 'reduce');\n  }\n\n  throw new TypeError('reduce: list must be array or iterable');\n}","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XMap = /*#__PURE__*/function () {\n  function XMap(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XMap.prototype['@@transducer/init'] = _xfBase.init;\n  XMap.prototype['@@transducer/result'] = _xfBase.result;\n  XMap.prototype['@@transducer/step'] = function (result, input) {\n    return this.xf['@@transducer/step'](result, this.f(input));\n  };\n\n  return XMap;\n}();\n\nvar _xmap = /*#__PURE__*/_curry2(function _xmap(f, xf) {\n  return new XMap(f, xf);\n});\nexport default _xmap;","export default function _has(prop, obj) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}","import _has from './_has';\n\nvar toString = Object.prototype.toString;\nvar _isArguments = function () {\n  return toString.call(arguments) === '[object Arguments]' ? function _isArguments(x) {\n    return toString.call(x) === '[object Arguments]';\n  } : function _isArguments(x) {\n    return _has('callee', x);\n  };\n};\n\nexport default _isArguments;","import _curry1 from './internal/_curry1';\nimport _has from './internal/_has';\nimport _isArguments from './internal/_isArguments';\n\n// cover IE < 9 keys issues\nvar hasEnumBug = ! /*#__PURE__*/{ toString: null }.propertyIsEnumerable('toString');\nvar nonEnumerableProps = ['constructor', 'valueOf', 'isPrototypeOf', 'toString', 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];\n// Safari bug\nvar hasArgsEnumBug = /*#__PURE__*/function () {\n  'use strict';\n\n  return arguments.propertyIsEnumerable('length');\n}();\n\nvar contains = function contains(list, item) {\n  var idx = 0;\n  while (idx < list.length) {\n    if (list[idx] === item) {\n      return true;\n    }\n    idx += 1;\n  }\n  return false;\n};\n\n/**\n * Returns a list containing the names of all the enumerable own properties of\n * the supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own properties.\n * @see R.keysIn, R.values\n * @example\n *\n *      R.keys({a: 1, b: 2, c: 3}); //=> ['a', 'b', 'c']\n */\nvar _keys = typeof Object.keys === 'function' && !hasArgsEnumBug ? function keys(obj) {\n  return Object(obj) !== obj ? [] : Object.keys(obj);\n} : function keys(obj) {\n  if (Object(obj) !== obj) {\n    return [];\n  }\n  var prop, nIdx;\n  var ks = [];\n  var checkArgsLength = hasArgsEnumBug && _isArguments(obj);\n  for (prop in obj) {\n    if (_has(prop, obj) && (!checkArgsLength || prop !== 'length')) {\n      ks[ks.length] = prop;\n    }\n  }\n  if (hasEnumBug) {\n    nIdx = nonEnumerableProps.length - 1;\n    while (nIdx >= 0) {\n      prop = nonEnumerableProps[nIdx];\n      if (_has(prop, obj) && !contains(ks, prop)) {\n        ks[ks.length] = prop;\n      }\n      nIdx -= 1;\n    }\n  }\n  return ks;\n};\nvar keys = /*#__PURE__*/_curry1(_keys);\nexport default keys;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _map from './internal/_map';\nimport _reduce from './internal/_reduce';\nimport _xmap from './internal/_xmap';\nimport curryN from './curryN';\nimport keys from './keys';\n\n/**\n * Takes a function and\n * a [functor](https://github.com/fantasyland/fantasy-land#functor),\n * applies the function to each of the functor's values, and returns\n * a functor of the same shape.\n *\n * Ramda provides suitable `map` implementations for `Array` and `Object`,\n * so this function may be applied to `[1, 2, 3]` or `{x: 1, y: 2, z: 3}`.\n *\n * Dispatches to the `map` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * Also treats functions as functors and will compose them together.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Functor f => (a -> b) -> f a -> f b\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {Array} list The list to be iterated over.\n * @return {Array} The new list.\n * @see R.transduce, R.addIndex\n * @example\n *\n *      var double = x => x * 2;\n *\n *      R.map(double, [1, 2, 3]); //=> [2, 4, 6]\n *\n *      R.map(double, {x: 1, y: 2, z: 3}); //=> {x: 2, y: 4, z: 6}\n * @symb R.map(f, [a, b]) = [f(a), f(b)]\n * @symb R.map(f, { x: a, y: b }) = { x: f(a), y: f(b) }\n * @symb R.map(f, functor_o) = functor_o.map(f)\n */\nvar map = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['fantasy-land/map', 'map'], _xmap, function map(fn, functor) {\n  switch (Object.prototype.toString.call(functor)) {\n    case '[object Function]':\n      return curryN(functor.length, function () {\n        return fn.call(this, functor.apply(this, arguments));\n      });\n    case '[object Object]':\n      return _reduce(function (acc, key) {\n        acc[key] = fn(functor[key]);\n        return acc;\n      }, {}, keys(functor));\n    default:\n      return _map(fn, functor);\n  }\n}));\nexport default map;","import _curry2 from './internal/_curry2';\n\n/**\n * Retrieve the value at a given path.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @typedefn Idx = String | Int\n * @sig [Idx] -> {a} -> a | Undefined\n * @param {Array} path The path to use.\n * @param {Object} obj The object to retrieve the nested property from.\n * @return {*} The data at `path`.\n * @see R.prop\n * @example\n *\n *      R.path(['a', 'b'], {a: {b: 2}}); //=> 2\n *      R.path(['a', 'b'], {c: {b: 2}}); //=> undefined\n */\nvar path = /*#__PURE__*/_curry2(function path(paths, obj) {\n  var val = obj;\n  var idx = 0;\n  while (idx < paths.length) {\n    if (val == null) {\n      return;\n    }\n    val = val[paths[idx]];\n    idx += 1;\n  }\n  return val;\n});\nexport default path;","import _curry2 from './internal/_curry2';\nimport path from './path';\n\n/**\n * Returns a function that when supplied an object returns the indicated\n * property of that object, if it exists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig s -> {s: a} -> a | Undefined\n * @param {String} p The property name\n * @param {Object} obj The object to query\n * @return {*} The value at `obj.p`.\n * @see R.path\n * @example\n *\n *      R.prop('x', {x: 100}); //=> 100\n *      R.prop('x', {}); //=> undefined\n */\n\nvar prop = /*#__PURE__*/_curry2(function prop(p, obj) {\n  return path([p], obj);\n});\nexport default prop;","import _curry2 from './internal/_curry2';\nimport map from './map';\nimport prop from './prop';\n\n/**\n * Returns a new list by plucking the same named property off all objects in\n * the list supplied.\n *\n * `pluck` will work on\n * any [functor](https://github.com/fantasyland/fantasy-land#functor) in\n * addition to arrays, as it is equivalent to `R.map(R.prop(k), f)`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Functor f => k -> f {k: v} -> f v\n * @param {Number|String} key The key name to pluck off of each object.\n * @param {Array} f The array or functor to consider.\n * @return {Array} The list of values for the given key.\n * @see R.props\n * @example\n *\n *      R.pluck('a')([{a: 1}, {a: 2}]); //=> [1, 2]\n *      R.pluck(0)([[1, 2], [3, 4]]);   //=> [1, 3]\n *      R.pluck('val', {a: {val: 3}, b: {val: 5}}); //=> {a: 3, b: 5}\n * @symb R.pluck('x', [{x: 1, y: 2}, {x: 3, y: 4}, {x: 5, y: 6}]) = [1, 3, 5]\n * @symb R.pluck(0, [[1, 2], [3, 4], [5, 6]]) = [1, 3, 5]\n */\nvar pluck = /*#__PURE__*/_curry2(function pluck(p, list) {\n  return map(prop(p), list);\n});\nexport default pluck;","import _curry3 from './internal/_curry3';\nimport _reduce from './internal/_reduce';\n\n/**\n * Returns a single item by iterating through the list, successively calling\n * the iterator function and passing it an accumulator value and the current\n * value from the array, and then passing the result to the next call.\n *\n * The iterator function receives two values: *(acc, value)*. It may use\n * [`R.reduced`](#reduced) to shortcut the iteration.\n *\n * The arguments' order of [`reduceRight`](#reduceRight)'s iterator function\n * is *(value, acc)*.\n *\n * Note: `R.reduce` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.reduce` method. For more details\n * on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce#Description\n *\n * Dispatches to the `reduce` method of the third argument, if present. When\n * doing so, it is up to the user to handle the [`R.reduced`](#reduced)\n * shortcuting, as this is not implemented by `reduce`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, b) -> a) -> a -> [b] -> a\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n *        current element from the array.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduced, R.addIndex, R.reduceRight\n * @example\n *\n *      R.reduce(R.subtract, 0, [1, 2, 3, 4]) // => ((((0 - 1) - 2) - 3) - 4) = -10\n *      //          -               -10\n *      //         / \\              / \\\n *      //        -   4           -6   4\n *      //       / \\              / \\\n *      //      -   3   ==>     -3   3\n *      //     / \\              / \\\n *      //    -   2           -1   2\n *      //   / \\              / \\\n *      //  0   1            0   1\n *\n * @symb R.reduce(f, a, [b, c, d]) = f(f(f(a, b), c), d)\n */\nvar reduce = /*#__PURE__*/_curry3(_reduce);\nexport default reduce;","import _curry1 from './internal/_curry1';\nimport curryN from './curryN';\nimport max from './max';\nimport pluck from './pluck';\nimport reduce from './reduce';\n\n/**\n * Takes a list of predicates and returns a predicate that returns true for a\n * given list of arguments if every one of the provided predicates is satisfied\n * by those arguments.\n *\n * The function returned is a curried function whose arity matches that of the\n * highest-arity predicate.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Logic\n * @sig [(*... -> Boolean)] -> (*... -> Boolean)\n * @param {Array} predicates An array of predicates to check\n * @return {Function} The combined predicate\n * @see R.anyPass\n * @example\n *\n *      var isQueen = R.propEq('rank', 'Q');\n *      var isSpade = R.propEq('suit', '♠︎');\n *      var isQueenOfSpades = R.allPass([isQueen, isSpade]);\n *\n *      isQueenOfSpades({rank: 'Q', suit: '♣︎'}); //=> false\n *      isQueenOfSpades({rank: 'Q', suit: '♠︎'}); //=> true\n */\nvar allPass = /*#__PURE__*/_curry1(function allPass(preds) {\n  return curryN(reduce(max, 0, pluck('length', preds)), function () {\n    var idx = 0;\n    var len = preds.length;\n    while (idx < len) {\n      if (!preds[idx].apply(this, arguments)) {\n        return false;\n      }\n      idx += 1;\n    }\n    return true;\n  });\n});\nexport default allPass;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if both arguments are `true`; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig a -> b -> a | b\n * @param {Any} a\n * @param {Any} b\n * @return {Any} the first argument if it is falsy, otherwise the second argument.\n * @see R.both\n * @example\n *\n *      R.and(true, true); //=> true\n *      R.and(true, false); //=> false\n *      R.and(false, true); //=> false\n *      R.and(false, false); //=> false\n */\nvar and = /*#__PURE__*/_curry2(function and(a, b) {\n  return a && b;\n});\nexport default and;","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XAny = /*#__PURE__*/function () {\n  function XAny(f, xf) {\n    this.xf = xf;\n    this.f = f;\n    this.any = false;\n  }\n  XAny.prototype['@@transducer/init'] = _xfBase.init;\n  XAny.prototype['@@transducer/result'] = function (result) {\n    if (!this.any) {\n      result = this.xf['@@transducer/step'](result, false);\n    }\n    return this.xf['@@transducer/result'](result);\n  };\n  XAny.prototype['@@transducer/step'] = function (result, input) {\n    if (this.f(input)) {\n      this.any = true;\n      result = _reduced(this.xf['@@transducer/step'](result, true));\n    }\n    return result;\n  };\n\n  return XAny;\n}();\n\nvar _xany = /*#__PURE__*/_curry2(function _xany(f, xf) {\n  return new XAny(f, xf);\n});\nexport default _xany;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xany from './internal/_xany';\n\n/**\n * Returns `true` if at least one of elements of the list match the predicate,\n * `false` otherwise.\n *\n * Dispatches to the `any` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is satisfied by at least one element, `false`\n *         otherwise.\n * @see R.all, R.none, R.transduce\n * @example\n *\n *      var lessThan0 = R.flip(R.lt)(0);\n *      var lessThan2 = R.flip(R.lt)(2);\n *      R.any(lessThan0)([1, 2]); //=> false\n *      R.any(lessThan2)([1, 2]); //=> true\n */\nvar any = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['any'], _xany, function any(fn, list) {\n  var idx = 0;\n  while (idx < list.length) {\n    if (fn(list[idx])) {\n      return true;\n    }\n    idx += 1;\n  }\n  return false;\n}));\nexport default any;","import _curry1 from './internal/_curry1';\nimport curryN from './curryN';\nimport max from './max';\nimport pluck from './pluck';\nimport reduce from './reduce';\n\n/**\n * Takes a list of predicates and returns a predicate that returns true for a\n * given list of arguments if at least one of the provided predicates is\n * satisfied by those arguments.\n *\n * The function returned is a curried function whose arity matches that of the\n * highest-arity predicate.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Logic\n * @sig [(*... -> Boolean)] -> (*... -> Boolean)\n * @param {Array} predicates An array of predicates to check\n * @return {Function} The combined predicate\n * @see R.allPass\n * @example\n *\n *      var isClub = R.propEq('suit', '♣');\n *      var isSpade = R.propEq('suit', '♠');\n *      var isBlackCard = R.anyPass([isClub, isSpade]);\n *\n *      isBlackCard({rank: '10', suit: '♣'}); //=> true\n *      isBlackCard({rank: 'Q', suit: '♠'}); //=> true\n *      isBlackCard({rank: 'Q', suit: '♦'}); //=> false\n */\nvar anyPass = /*#__PURE__*/_curry1(function anyPass(preds) {\n  return curryN(reduce(max, 0, pluck('length', preds)), function () {\n    var idx = 0;\n    var len = preds.length;\n    while (idx < len) {\n      if (preds[idx].apply(this, arguments)) {\n        return true;\n      }\n      idx += 1;\n    }\n    return false;\n  });\n});\nexport default anyPass;","import _concat from './internal/_concat';\nimport _curry2 from './internal/_curry2';\nimport _reduce from './internal/_reduce';\nimport map from './map';\n\n/**\n * ap applies a list of functions to a list of values.\n *\n * Dispatches to the `ap` method of the second argument, if present. Also\n * treats curried functions as applicatives.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig [a -> b] -> [a] -> [b]\n * @sig Apply f => f (a -> b) -> f a -> f b\n * @sig (a -> b -> c) -> (a -> b) -> (a -> c)\n * @param {*} applyF\n * @param {*} applyX\n * @return {*}\n * @example\n *\n *      R.ap([R.multiply(2), R.add(3)], [1,2,3]); //=> [2, 4, 6, 4, 5, 6]\n *      R.ap([R.concat('tasty '), R.toUpper], ['pizza', 'salad']); //=> [\"tasty pizza\", \"tasty salad\", \"PIZZA\", \"SALAD\"]\n *\n *      // R.ap can also be used as S combinator\n *      // when only two functions are passed\n *      R.ap(R.concat, R.toUpper)('Ramda') //=> 'RamdaRAMDA'\n * @symb R.ap([f, g], [a, b]) = [f(a), f(b), g(a), g(b)]\n */\nvar ap = /*#__PURE__*/_curry2(function ap(applyF, applyX) {\n  return typeof applyX['fantasy-land/ap'] === 'function' ? applyX['fantasy-land/ap'](applyF) : typeof applyF.ap === 'function' ? applyF.ap(applyX) : typeof applyF === 'function' ? function (x) {\n    return applyF(x)(applyX(x));\n  } :\n  // else\n  _reduce(function (acc, f) {\n    return _concat(acc, map(f, applyX));\n  }, [], applyF);\n});\nexport default ap;","export default function _aperture(n, list) {\n  var idx = 0;\n  var limit = list.length - (n - 1);\n  var acc = new Array(limit >= 0 ? limit : 0);\n  while (idx < limit) {\n    acc[idx] = Array.prototype.slice.call(list, idx, idx + n);\n    idx += 1;\n  }\n  return acc;\n}","import _concat from './_concat';\nimport _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XAperture = /*#__PURE__*/function () {\n  function XAperture(n, xf) {\n    this.xf = xf;\n    this.pos = 0;\n    this.full = false;\n    this.acc = new Array(n);\n  }\n  XAperture.prototype['@@transducer/init'] = _xfBase.init;\n  XAperture.prototype['@@transducer/result'] = function (result) {\n    this.acc = null;\n    return this.xf['@@transducer/result'](result);\n  };\n  XAperture.prototype['@@transducer/step'] = function (result, input) {\n    this.store(input);\n    return this.full ? this.xf['@@transducer/step'](result, this.getCopy()) : result;\n  };\n  XAperture.prototype.store = function (input) {\n    this.acc[this.pos] = input;\n    this.pos += 1;\n    if (this.pos === this.acc.length) {\n      this.pos = 0;\n      this.full = true;\n    }\n  };\n  XAperture.prototype.getCopy = function () {\n    return _concat(Array.prototype.slice.call(this.acc, this.pos), Array.prototype.slice.call(this.acc, 0, this.pos));\n  };\n\n  return XAperture;\n}();\n\nvar _xaperture = /*#__PURE__*/_curry2(function _xaperture(n, xf) {\n  return new XAperture(n, xf);\n});\nexport default _xaperture;","import _aperture from './internal/_aperture';\nimport _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xaperture from './internal/_xaperture';\n\n/**\n * Returns a new list, composed of n-tuples of consecutive elements. If `n` is\n * greater than the length of the list, an empty list is returned.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig Number -> [a] -> [[a]]\n * @param {Number} n The size of the tuples to create\n * @param {Array} list The list to split into `n`-length tuples\n * @return {Array} The resulting list of `n`-length tuples\n * @see R.transduce\n * @example\n *\n *      R.aperture(2, [1, 2, 3, 4, 5]); //=> [[1, 2], [2, 3], [3, 4], [4, 5]]\n *      R.aperture(3, [1, 2, 3, 4, 5]); //=> [[1, 2, 3], [2, 3, 4], [3, 4, 5]]\n *      R.aperture(7, [1, 2, 3, 4, 5]); //=> []\n */\nvar aperture = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xaperture, _aperture));\nexport default aperture;","import _concat from './internal/_concat';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Returns a new list containing the contents of the given list, followed by\n * the given element.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} el The element to add to the end of the new list.\n * @param {Array} list The list of elements to add a new item to.\n *        list.\n * @return {Array} A new list containing the elements of the old list followed by `el`.\n * @see R.prepend\n * @example\n *\n *      R.append('tests', ['write', 'more']); //=> ['write', 'more', 'tests']\n *      R.append('tests', []); //=> ['tests']\n *      R.append(['tests'], ['write', 'more']); //=> ['write', 'more', ['tests']]\n */\nvar append = /*#__PURE__*/_curry2(function append(el, list) {\n  return _concat(list, [el]);\n});\nexport default append;","import _curry2 from './internal/_curry2';\n\n/**\n * Applies function `fn` to the argument list `args`. This is useful for\n * creating a fixed-arity function from a variadic function. `fn` should be a\n * bound function if context is significant.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig (*... -> a) -> [*] -> a\n * @param {Function} fn The function which will be called with `args`\n * @param {Array} args The arguments to call `fn` with\n * @return {*} result The result, equivalent to `fn(...args)`\n * @see R.call, R.unapply\n * @example\n *\n *      var nums = [1, 2, 3, -99, 42, 6, 7];\n *      R.apply(Math.max, nums); //=> 42\n * @symb R.apply(f, [a, b, c]) = f(a, b, c)\n */\nvar apply = /*#__PURE__*/_curry2(function apply(fn, args) {\n  return fn.apply(this, args);\n});\nexport default apply;","import _curry1 from './internal/_curry1';\nimport keys from './keys';\n\n/**\n * Returns a list of all the enumerable own properties of the supplied object.\n * Note that the order of the output array is not guaranteed across different\n * JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [v]\n * @param {Object} obj The object to extract values from\n * @return {Array} An array of the values of the object's own properties.\n * @see R.valuesIn, R.keys\n * @example\n *\n *      R.values({a: 1, b: 2, c: 3}); //=> [1, 2, 3]\n */\nvar values = /*#__PURE__*/_curry1(function values(obj) {\n  var props = keys(obj);\n  var len = props.length;\n  var vals = [];\n  var idx = 0;\n  while (idx < len) {\n    vals[idx] = obj[props[idx]];\n    idx += 1;\n  }\n  return vals;\n});\nexport default values;","import _curry1 from './internal/_curry1';\nimport apply from './apply';\nimport curryN from './curryN';\nimport map from './map';\nimport max from './max';\nimport pluck from './pluck';\nimport reduce from './reduce';\nimport values from './values';\n\n/**\n * Given a spec object recursively mapping properties to functions, creates a\n * function producing an object of the same structure, by mapping each property\n * to the result of calling its associated function with the supplied arguments.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Function\n * @sig {k: ((a, b, ..., m) -> v)} -> ((a, b, ..., m) -> {k: v})\n * @param {Object} spec an object recursively mapping properties to functions for\n *        producing the values for these properties.\n * @return {Function} A function that returns an object of the same structure\n * as `spec', with each property set to the value returned by calling its\n * associated function with the supplied arguments.\n * @see R.converge, R.juxt\n * @example\n *\n *      var getMetrics = R.applySpec({\n *        sum: R.add,\n *        nested: { mul: R.multiply }\n *      });\n *      getMetrics(2, 4); // => { sum: 6, nested: { mul: 8 } }\n * @symb R.applySpec({ x: f, y: { z: g } })(a, b) = { x: f(a, b), y: { z: g(a, b) } }\n */\nvar applySpec = /*#__PURE__*/_curry1(function applySpec(spec) {\n  spec = map(function (v) {\n    return typeof v == 'function' ? v : applySpec(v);\n  }, spec);\n  return curryN(reduce(max, 0, pluck('length', values(spec))), function () {\n    var args = arguments;\n    return map(function (f) {\n      return apply(f, args);\n    }, spec);\n  });\n});\nexport default applySpec;","import _curry2 from './internal/_curry2';\n\n/**\n* Takes a value and applies a function to it.\n*\n* This function is also known as the `thrush` combinator.\n*\n* @func\n* @memberOf R\n * @since v0.25.0\n* @category Function\n* @sig a -> (a -> b) -> b\n* @param {*} x The value\n* @param {Function} f The function to apply\n* @return {*} The result of applying `f` to `x`\n* @example\n*\n*      var t42 = R.applyTo(42);\n*      t42(R.identity); //=> 42\n*      t42(R.add(1)); //=> 43\n*/\nvar applyTo = /*#__PURE__*/_curry2(function applyTo(x, f) {\n  return f(x);\n});\nexport default applyTo;","import _curry3 from './internal/_curry3';\n\n/**\n * Makes an ascending comparator function out of a function that returns a value\n * that can be compared with `<` and `>`.\n *\n * @func\n * @memberOf R\n * @since v0.23.0\n * @category Function\n * @sig Ord b => (a -> b) -> a -> a -> Number\n * @param {Function} fn A function of arity one that returns a value that can be compared\n * @param {*} a The first item to be compared.\n * @param {*} b The second item to be compared.\n * @return {Number} `-1` if fn(a) < fn(b), `1` if fn(b) < fn(a), otherwise `0`\n * @see R.descend\n * @example\n *\n *      var byAge = R.ascend(R.prop('age'));\n *      var people = [\n *        // ...\n *      ];\n *      var peopleByYoungestFirst = R.sort(byAge, people);\n */\nvar ascend = /*#__PURE__*/_curry3(function ascend(fn, a, b) {\n  var aa = fn(a);\n  var bb = fn(b);\n  return aa < bb ? -1 : aa > bb ? 1 : 0;\n});\nexport default ascend;","import _curry3 from './internal/_curry3';\n\n/**\n * Makes a shallow clone of an object, setting or overriding the specified\n * property with the given value. Note that this copies and flattens prototype\n * properties onto the new object as well. All non-primitive properties are\n * copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @sig String -> a -> {k: v} -> {k: v}\n * @param {String} prop The property name to set\n * @param {*} val The new value\n * @param {Object} obj The object to clone\n * @return {Object} A new object equivalent to the original except for the changed property.\n * @see R.dissoc\n * @example\n *\n *      R.assoc('c', 3, {a: 1, b: 2}); //=> {a: 1, b: 2, c: 3}\n */\nvar assoc = /*#__PURE__*/_curry3(function assoc(prop, val, obj) {\n  var result = {};\n  for (var p in obj) {\n    result[p] = obj[p];\n  }\n  result[prop] = val;\n  return result;\n});\nexport default assoc;","/**\n * Determine if the passed argument is an integer.\n *\n * @private\n * @param {*} n\n * @category Type\n * @return {Boolean}\n */\nexport default Number.isInteger || function _isInteger(n) {\n  return n << 0 === n;\n};","import _curry1 from './internal/_curry1';\n\n/**\n * Checks if the input value is `null` or `undefined`.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Type\n * @sig * -> Boolean\n * @param {*} x The value to test.\n * @return {Boolean} `true` if `x` is `undefined` or `null`, otherwise `false`.\n * @example\n *\n *      R.isNil(null); //=> true\n *      R.isNil(undefined); //=> true\n *      R.isNil(0); //=> false\n *      R.isNil([]); //=> false\n */\nvar isNil = /*#__PURE__*/_curry1(function isNil(x) {\n  return x == null;\n});\nexport default isNil;","import _curry3 from './internal/_curry3';\nimport _has from './internal/_has';\nimport _isArray from './internal/_isArray';\nimport _isInteger from './internal/_isInteger';\nimport assoc from './assoc';\nimport isNil from './isNil';\n\n/**\n * Makes a shallow clone of an object, setting or overriding the nodes required\n * to create the given path, and placing the specific value at the tail end of\n * that path. Note that this copies and flattens prototype properties onto the\n * new object as well. All non-primitive properties are copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @typedefn Idx = String | Int\n * @sig [Idx] -> a -> {a} -> {a}\n * @param {Array} path the path to set\n * @param {*} val The new value\n * @param {Object} obj The object to clone\n * @return {Object} A new object equivalent to the original except along the specified path.\n * @see R.dissocPath\n * @example\n *\n *      R.assocPath(['a', 'b', 'c'], 42, {a: {b: {c: 0}}}); //=> {a: {b: {c: 42}}}\n *\n *      // Any missing or non-object keys in path will be overridden\n *      R.assocPath(['a', 'b', 'c'], 42, {a: 5}); //=> {a: {b: {c: 42}}}\n */\nvar assocPath = /*#__PURE__*/_curry3(function assocPath(path, val, obj) {\n  if (path.length === 0) {\n    return val;\n  }\n  var idx = path[0];\n  if (path.length > 1) {\n    var nextObj = !isNil(obj) && _has(idx, obj) ? obj[idx] : _isInteger(path[1]) ? [] : {};\n    val = assocPath(Array.prototype.slice.call(path, 1), val, nextObj);\n  }\n  if (_isInteger(idx) && _isArray(obj)) {\n    var arr = [].concat(obj);\n    arr[idx] = val;\n    return arr;\n  } else {\n    return assoc(idx, val, obj);\n  }\n});\nexport default assocPath;","import _curry2 from './internal/_curry2';\n\n/**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly `n` parameters. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig Number -> (* -> a) -> (* -> a)\n * @param {Number} n The desired arity of the new function.\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n *         arity `n`.\n * @see R.binary, R.unary\n * @example\n *\n *      var takesTwoArgs = (a, b) => [a, b];\n *\n *      takesTwoArgs.length; //=> 2\n *      takesTwoArgs(1, 2); //=> [1, 2]\n *\n *      var takesOneArg = R.nAry(1, takesTwoArgs);\n *      takesOneArg.length; //=> 1\n *      // Only `n` arguments are passed to the wrapped function\n *      takesOneArg(1, 2); //=> [1, undefined]\n * @symb R.nAry(0, f)(a, b) = f()\n * @symb R.nAry(1, f)(a, b) = f(a)\n * @symb R.nAry(2, f)(a, b) = f(a, b)\n */\nvar nAry = /*#__PURE__*/_curry2(function nAry(n, fn) {\n  switch (n) {\n    case 0:\n      return function () {\n        return fn.call(this);\n      };\n    case 1:\n      return function (a0) {\n        return fn.call(this, a0);\n      };\n    case 2:\n      return function (a0, a1) {\n        return fn.call(this, a0, a1);\n      };\n    case 3:\n      return function (a0, a1, a2) {\n        return fn.call(this, a0, a1, a2);\n      };\n    case 4:\n      return function (a0, a1, a2, a3) {\n        return fn.call(this, a0, a1, a2, a3);\n      };\n    case 5:\n      return function (a0, a1, a2, a3, a4) {\n        return fn.call(this, a0, a1, a2, a3, a4);\n      };\n    case 6:\n      return function (a0, a1, a2, a3, a4, a5) {\n        return fn.call(this, a0, a1, a2, a3, a4, a5);\n      };\n    case 7:\n      return function (a0, a1, a2, a3, a4, a5, a6) {\n        return fn.call(this, a0, a1, a2, a3, a4, a5, a6);\n      };\n    case 8:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7) {\n        return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7);\n      };\n    case 9:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {\n        return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7, a8);\n      };\n    case 10:\n      return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {\n        return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7, a8, a9);\n      };\n    default:\n      throw new Error('First argument to nAry must be a non-negative integer no greater than ten');\n  }\n});\nexport default nAry;","import _curry1 from './internal/_curry1';\nimport nAry from './nAry';\n\n/**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly 2 parameters. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Function\n * @sig (* -> c) -> (a, b -> c)\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n *         arity 2.\n * @see R.nAry, R.unary\n * @example\n *\n *      var takesThreeArgs = function(a, b, c) {\n *        return [a, b, c];\n *      };\n *      takesThreeArgs.length; //=> 3\n *      takesThreeArgs(1, 2, 3); //=> [1, 2, 3]\n *\n *      var takesTwoArgs = R.binary(takesThreeArgs);\n *      takesTwoArgs.length; //=> 2\n *      // Only 2 arguments are passed to the wrapped function\n *      takesTwoArgs(1, 2, 3); //=> [1, 2, undefined]\n * @symb R.binary(f)(a, b, c) = f(a, b)\n */\nvar binary = /*#__PURE__*/_curry1(function binary(fn) {\n  return nAry(2, fn);\n});\nexport default binary;","export default function _isFunction(x) {\n  return Object.prototype.toString.call(x) === '[object Function]';\n}","import _curry2 from './internal/_curry2';\nimport _reduce from './internal/_reduce';\nimport ap from './ap';\nimport curryN from './curryN';\nimport map from './map';\n\n/**\n * \"lifts\" a function to be the specified arity, so that it may \"map over\" that\n * many lists, Functions or other objects that satisfy the [FantasyLand Apply spec](https://github.com/fantasyland/fantasy-land#apply).\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig Number -> (*... -> *) -> ([*]... -> [*])\n * @param {Function} fn The function to lift into higher context\n * @return {Function} The lifted function.\n * @see R.lift, R.ap\n * @example\n *\n *      var madd3 = R.liftN(3, (...args) => R.sum(args));\n *      madd3([1,2,3], [1,2,3], [1]); //=> [3, 4, 5, 4, 5, 6, 5, 6, 7]\n */\nvar liftN = /*#__PURE__*/_curry2(function liftN(arity, fn) {\n  var lifted = curryN(arity, fn);\n  return curryN(arity, function () {\n    return _reduce(ap, map(lifted, arguments[0]), Array.prototype.slice.call(arguments, 1));\n  });\n});\nexport default liftN;","import _curry1 from './internal/_curry1';\nimport liftN from './liftN';\n\n/**\n * \"lifts\" a function of arity > 1 so that it may \"map over\" a list, Function or other\n * object that satisfies the [FantasyLand Apply spec](https://github.com/fantasyland/fantasy-land#apply).\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig (*... -> *) -> ([*]... -> [*])\n * @param {Function} fn The function to lift into higher context\n * @return {Function} The lifted function.\n * @see R.liftN\n * @example\n *\n *      var madd3 = R.lift((a, b, c) => a + b + c);\n *\n *      madd3([1,2,3], [1,2,3], [1]); //=> [3, 4, 5, 4, 5, 6, 5, 6, 7]\n *\n *      var madd5 = R.lift((a, b, c, d, e) => a + b + c + d + e);\n *\n *      madd5([1,2], [3], [4, 5], [6], [7, 8]); //=> [21, 22, 22, 23, 22, 23, 23, 24]\n */\nvar lift = /*#__PURE__*/_curry1(function lift(fn) {\n  return liftN(fn.length, fn);\n});\nexport default lift;","import _curry2 from './internal/_curry2';\nimport _isFunction from './internal/_isFunction';\nimport and from './and';\nimport lift from './lift';\n\n/**\n * A function which calls the two provided functions and returns the `&&`\n * of the results.\n * It returns the result of the first function if it is false-y and the result\n * of the second function otherwise. Note that this is short-circuited,\n * meaning that the second function will not be invoked if the first returns a\n * false-y value.\n *\n * In addition to functions, `R.both` also accepts any fantasy-land compatible\n * applicative functor.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> Boolean) -> (*... -> Boolean)\n * @param {Function} f A predicate\n * @param {Function} g Another predicate\n * @return {Function} a function that applies its arguments to `f` and `g` and `&&`s their outputs together.\n * @see R.and\n * @example\n *\n *      var gt10 = R.gt(R.__, 10)\n *      var lt20 = R.lt(R.__, 20)\n *      var f = R.both(gt10, lt20);\n *      f(15); //=> true\n *      f(30); //=> false\n */\nvar both = /*#__PURE__*/_curry2(function both(f, g) {\n  return _isFunction(f) ? function _both() {\n    return f.apply(this, arguments) && g.apply(this, arguments);\n  } : lift(and)(f, g);\n});\nexport default both;","import _curry1 from './internal/_curry1';\nimport curryN from './curryN';\n\n/**\n * Returns a curried equivalent of the provided function. The curried function\n * has two unusual capabilities. First, its arguments needn't be provided one\n * at a time. If `f` is a ternary function and `g` is `R.curry(f)`, the\n * following are equivalent:\n *\n *   - `g(1)(2)(3)`\n *   - `g(1)(2, 3)`\n *   - `g(1, 2)(3)`\n *   - `g(1, 2, 3)`\n *\n * Secondly, the special placeholder value [`R.__`](#__) may be used to specify\n * \"gaps\", allowing partial application of any combination of arguments,\n * regardless of their positions. If `g` is as above and `_` is [`R.__`](#__),\n * the following are equivalent:\n *\n *   - `g(1, 2, 3)`\n *   - `g(_, 2, 3)(1)`\n *   - `g(_, _, 3)(1)(2)`\n *   - `g(_, _, 3)(1, 2)`\n *   - `g(_, 2)(1)(3)`\n *   - `g(_, 2)(1, 3)`\n *   - `g(_, 2)(_, 3)(1)`\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (* -> a) -> (* -> a)\n * @param {Function} fn The function to curry.\n * @return {Function} A new, curried function.\n * @see R.curryN\n * @example\n *\n *      var addFourNumbers = (a, b, c, d) => a + b + c + d;\n *\n *      var curriedAddFourNumbers = R.curry(addFourNumbers);\n *      var f = curriedAddFourNumbers(1, 2);\n *      var g = f(3);\n *      g(4); //=> 10\n */\nvar curry = /*#__PURE__*/_curry1(function curry(fn) {\n  return curryN(fn.length, fn);\n});\nexport default curry;","import curry from './curry';\n\n/**\n * Returns the result of calling its first argument with the remaining\n * arguments. This is occasionally useful as a converging function for\n * [`R.converge`](#converge): the first branch can produce a function while the\n * remaining branches produce values to be passed to that function as its\n * arguments.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig (*... -> a),*... -> a\n * @param {Function} fn The function to apply to the remaining arguments.\n * @param {...*} args Any number of positional arguments.\n * @return {*}\n * @see R.apply\n * @example\n *\n *      R.call(R.add, 1, 2); //=> 3\n *\n *      var indentN = R.pipe(R.repeat(' '),\n *                           R.join(''),\n *                           R.replace(/^(?!$)/gm));\n *\n *      var format = R.converge(R.call, [\n *                                  R.pipe(R.prop('indent'), indentN),\n *                                  R.prop('value')\n *                              ]);\n *\n *      format({indent: 2, value: 'foo\\nbar\\nbaz\\n'}); //=> '  foo\\n  bar\\n  baz\\n'\n * @symb R.call(f, a, b) = f(a, b)\n */\nvar call = /*#__PURE__*/curry(function call(fn) {\n  return fn.apply(this, Array.prototype.slice.call(arguments, 1));\n});\nexport default call;","import _isArrayLike from './_isArrayLike';\n\n/**\n * `_makeFlat` is a helper function that returns a one-level or fully recursive\n * function based on the flag passed in.\n *\n * @private\n */\nexport default function _makeFlat(recursive) {\n  return function flatt(list) {\n    var value, jlen, j;\n    var result = [];\n    var idx = 0;\n    var ilen = list.length;\n\n    while (idx < ilen) {\n      if (_isArrayLike(list[idx])) {\n        value = recursive ? flatt(list[idx]) : list[idx];\n        j = 0;\n        jlen = value.length;\n        while (j < jlen) {\n          result[result.length] = value[j];\n          j += 1;\n        }\n      } else {\n        result[result.length] = list[idx];\n      }\n      idx += 1;\n    }\n    return result;\n  };\n}","import _forceReduced from './_forceReduced';\nimport _isArrayLike from './_isArrayLike';\nimport _reduce from './_reduce';\nimport _xfBase from './_xfBase';\n\nvar preservingReduced = function (xf) {\n  return {\n    '@@transducer/init': _xfBase.init,\n    '@@transducer/result': function (result) {\n      return xf['@@transducer/result'](result);\n    },\n    '@@transducer/step': function (result, input) {\n      var ret = xf['@@transducer/step'](result, input);\n      return ret['@@transducer/reduced'] ? _forceReduced(ret) : ret;\n    }\n  };\n};\n\nvar _flatCat = function _xcat(xf) {\n  var rxf = preservingReduced(xf);\n  return {\n    '@@transducer/init': _xfBase.init,\n    '@@transducer/result': function (result) {\n      return rxf['@@transducer/result'](result);\n    },\n    '@@transducer/step': function (result, input) {\n      return !_isArrayLike(input) ? _reduce(rxf, result, [input]) : _reduce(rxf, result, input);\n    }\n  };\n};\n\nexport default _flatCat;","export default function _forceReduced(x) {\n  return {\n    '@@transducer/value': x,\n    '@@transducer/reduced': true\n  };\n}","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _makeFlat from './internal/_makeFlat';\nimport _xchain from './internal/_xchain';\nimport map from './map';\n\n/**\n * `chain` maps a function over a list and concatenates the results. `chain`\n * is also known as `flatMap` in some libraries\n *\n * Dispatches to the `chain` method of the second argument, if present,\n * according to the [FantasyLand Chain spec](https://github.com/fantasyland/fantasy-land#chain).\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig Chain m => (a -> m b) -> m a -> m b\n * @param {Function} fn The function to map with\n * @param {Array} list The list to map over\n * @return {Array} The result of flat-mapping `list` with `fn`\n * @example\n *\n *      var duplicate = n => [n, n];\n *      R.chain(duplicate, [1, 2, 3]); //=> [1, 1, 2, 2, 3, 3]\n *\n *      R.chain(R.append, R.head)([1, 2, 3]); //=> [1, 2, 3, 1]\n */\nvar chain = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['fantasy-land/chain', 'chain'], _xchain, function chain(fn, monad) {\n  if (typeof monad === 'function') {\n    return function (x) {\n      return fn(monad(x))(x);\n    };\n  }\n  return _makeFlat(false)(map(fn, monad));\n}));\nexport default chain;","import _curry2 from './_curry2';\nimport _flatCat from './_flatCat';\nimport map from '../map';\n\nvar _xchain = /*#__PURE__*/_curry2(function _xchain(f, xf) {\n  return map(f, _flatCat(xf));\n});\nexport default _xchain;","import _curry3 from './internal/_curry3';\n\n/**\n * Restricts a number to be within a range.\n *\n * Also works for other ordered types such as Strings and Dates.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Relation\n * @sig Ord a => a -> a -> a -> a\n * @param {Number} minimum The lower limit of the clamp (inclusive)\n * @param {Number} maximum The upper limit of the clamp (inclusive)\n * @param {Number} value Value to be clamped\n * @return {Number} Returns `minimum` when `val < minimum`, `maximum` when `val > maximum`, returns `val` otherwise\n * @example\n *\n *      R.clamp(1, 10, -5) // => 1\n *      R.clamp(1, 10, 15) // => 10\n *      R.clamp(1, 10, 4)  // => 4\n */\nvar clamp = /*#__PURE__*/_curry3(function clamp(min, max, value) {\n  if (min > max) {\n    throw new Error('min must not be greater than max in clamp(min, max, value)');\n  }\n  return value < min ? min : value > max ? max : value;\n});\nexport default clamp;","export default function _cloneRegExp(pattern) {\n                                  return new RegExp(pattern.source, (pattern.global ? 'g' : '') + (pattern.ignoreCase ? 'i' : '') + (pattern.multiline ? 'm' : '') + (pattern.sticky ? 'y' : '') + (pattern.unicode ? 'u' : ''));\n}","import _curry1 from './internal/_curry1';\n\n/**\n * Gives a single-word string description of the (native) type of a value,\n * returning such answers as 'Object', 'Number', 'Array', or 'Null'. Does not\n * attempt to distinguish user Object types any further, reporting them all as\n * 'Object'.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Type\n * @sig (* -> {*}) -> String\n * @param {*} val The value to test\n * @return {String}\n * @example\n *\n *      R.type({}); //=> \"Object\"\n *      R.type(1); //=> \"Number\"\n *      R.type(false); //=> \"Boolean\"\n *      R.type('s'); //=> \"String\"\n *      R.type(null); //=> \"Null\"\n *      R.type([]); //=> \"Array\"\n *      R.type(/[A-z]/); //=> \"RegExp\"\n *      R.type(() => {}); //=> \"Function\"\n *      R.type(undefined); //=> \"Undefined\"\n */\nvar type = /*#__PURE__*/_curry1(function type(val) {\n  return val === null ? 'Null' : val === undefined ? 'Undefined' : Object.prototype.toString.call(val).slice(8, -1);\n});\nexport default type;","import _cloneRegExp from './_cloneRegExp';\nimport type from '../type';\n\n/**\n * Copies an object.\n *\n * @private\n * @param {*} value The value to be copied\n * @param {Array} refFrom Array containing the source references\n * @param {Array} refTo Array containing the copied source references\n * @param {Boolean} deep Whether or not to perform deep cloning.\n * @return {*} The copied value.\n */\nexport default function _clone(value, refFrom, refTo, deep) {\n  var copy = function copy(copiedValue) {\n    var len = refFrom.length;\n    var idx = 0;\n    while (idx < len) {\n      if (value === refFrom[idx]) {\n        return refTo[idx];\n      }\n      idx += 1;\n    }\n    refFrom[idx + 1] = value;\n    refTo[idx + 1] = copiedValue;\n    for (var key in value) {\n      copiedValue[key] = deep ? _clone(value[key], refFrom, refTo, true) : value[key];\n    }\n    return copiedValue;\n  };\n  switch (type(value)) {\n    case 'Object':\n      return copy({});\n    case 'Array':\n      return copy([]);\n    case 'Date':\n      return new Date(value.valueOf());\n    case 'RegExp':\n      return _cloneRegExp(value);\n    default:\n      return value;\n  }\n}","import _clone from './internal/_clone';\nimport _curry1 from './internal/_curry1';\n\n/**\n * Creates a deep copy of the value which may contain (nested) `Array`s and\n * `Object`s, `Number`s, `String`s, `Boolean`s and `Date`s. `Function`s are\n * assigned by reference rather than copied\n *\n * Dispatches to a `clone` method if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {*} -> {*}\n * @param {*} value The object or array to clone\n * @return {*} A deeply cloned copy of `val`\n * @example\n *\n *      var objects = [{}, {}, {}];\n *      var objectsClone = R.clone(objects);\n *      objects === objectsClone; //=> false\n *      objects[0] === objectsClone[0]; //=> false\n */\nvar clone = /*#__PURE__*/_curry1(function clone(value) {\n  return value != null && typeof value.clone === 'function' ? value.clone() : _clone(value, [], [], true);\n});\nexport default clone;","import _curry1 from './internal/_curry1';\n\n/**\n * Makes a comparator function out of a function that reports whether the first\n * element is less than the second.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig ((a, b) -> Boolean) -> ((a, b) -> Number)\n * @param {Function} pred A predicate function of arity two which will return `true` if the first argument\n * is less than the second, `false` otherwise\n * @return {Function} A Function :: a -> b -> Int that returns `-1` if a < b, `1` if b < a, otherwise `0`\n * @example\n *\n *      var byAge = R.comparator((a, b) => a.age < b.age);\n *      var people = [\n *        // ...\n *      ];\n *      var peopleByIncreasingAge = R.sort(byAge, people);\n */\nvar comparator = /*#__PURE__*/_curry1(function comparator(pred) {\n  return function (a, b) {\n    return pred(a, b) ? -1 : pred(b, a) ? 1 : 0;\n  };\n});\nexport default comparator;","import _curry1 from './internal/_curry1';\n\n/**\n * A function that returns the `!` of its argument. It will return `true` when\n * passed false-y value, and `false` when passed a truth-y one.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig * -> Boolean\n * @param {*} a any value\n * @return {Boolean} the logical inverse of passed argument.\n * @see R.complement\n * @example\n *\n *      R.not(true); //=> false\n *      R.not(false); //=> true\n *      R.not(0); //=> true\n *      R.not(1); //=> false\n */\nvar not = /*#__PURE__*/_curry1(function not(a) {\n  return !a;\n});\nexport default not;","import lift from './lift';\nimport not from './not';\n\n/**\n * Takes a function `f` and returns a function `g` such that if called with the same arguments\n * when `f` returns a \"truthy\" value, `g` returns `false` and when `f` returns a \"falsy\" value `g` returns `true`.\n *\n * `R.complement` may be applied to any functor\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> *) -> (*... -> Boolean)\n * @param {Function} f\n * @return {Function}\n * @see R.not\n * @example\n *\n *      var isNotNil = R.complement(R.isNil);\n *      isNil(null); //=> true\n *      isNotNil(null); //=> false\n *      isNil(7); //=> false\n *      isNotNil(7); //=> true\n */\nvar complement = /*#__PURE__*/lift(not);\nexport default complement;","export default function _pipe(f, g) {\n  return function () {\n    return g.call(this, f.apply(this, arguments));\n  };\n}","import _isArray from './_isArray';\n\n/**\n * This checks whether a function has a [methodname] function. If it isn't an\n * array it will execute that function otherwise it will default to the ramda\n * implementation.\n *\n * @private\n * @param {Function} fn ramda implemtation\n * @param {String} methodname property to check for a custom implementation\n * @return {Object} Whatever the return value of the method is.\n */\nexport default function _checkForMethod(methodname, fn) {\n  return function () {\n    var length = arguments.length;\n    if (length === 0) {\n      return fn();\n    }\n    var obj = arguments[length - 1];\n    return _isArray(obj) || typeof obj[methodname] !== 'function' ? fn.apply(this, arguments) : obj[methodname].apply(obj, Array.prototype.slice.call(arguments, 0, length - 1));\n  };\n}","import _checkForMethod from './internal/_checkForMethod';\nimport _curry3 from './internal/_curry3';\n\n/**\n * Returns the elements of the given list or string (or object with a `slice`\n * method) from `fromIndex` (inclusive) to `toIndex` (exclusive).\n *\n * Dispatches to the `slice` method of the third argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig Number -> Number -> [a] -> [a]\n * @sig Number -> Number -> String -> String\n * @param {Number} fromIndex The start index (inclusive).\n * @param {Number} toIndex The end index (exclusive).\n * @param {*} list\n * @return {*}\n * @example\n *\n *      R.slice(1, 3, ['a', 'b', 'c', 'd']);        //=> ['b', 'c']\n *      R.slice(1, Infinity, ['a', 'b', 'c', 'd']); //=> ['b', 'c', 'd']\n *      R.slice(0, -1, ['a', 'b', 'c', 'd']);       //=> ['a', 'b', 'c']\n *      R.slice(-3, -1, ['a', 'b', 'c', 'd']);      //=> ['b', 'c']\n *      R.slice(0, 3, 'ramda');                     //=> 'ram'\n */\nvar slice = /*#__PURE__*/_curry3( /*#__PURE__*/_checkForMethod('slice', function slice(fromIndex, toIndex, list) {\n  return Array.prototype.slice.call(list, fromIndex, toIndex);\n}));\nexport default slice;","import _checkForMethod from './internal/_checkForMethod';\nimport _curry1 from './internal/_curry1';\nimport slice from './slice';\n\n/**\n * Returns all but the first element of the given list or string (or object\n * with a `tail` method).\n *\n * Dispatches to the `slice` method of the first argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.head, R.init, R.last\n * @example\n *\n *      R.tail([1, 2, 3]);  //=> [2, 3]\n *      R.tail([1, 2]);     //=> [2]\n *      R.tail([1]);        //=> []\n *      R.tail([]);         //=> []\n *\n *      R.tail('abc');  //=> 'bc'\n *      R.tail('ab');   //=> 'b'\n *      R.tail('a');    //=> ''\n *      R.tail('');     //=> ''\n */\nvar tail = /*#__PURE__*/_curry1( /*#__PURE__*/_checkForMethod('tail', /*#__PURE__*/slice(1, Infinity)));\nexport default tail;","import _arity from './internal/_arity';\nimport _pipe from './internal/_pipe';\nimport reduce from './reduce';\nimport tail from './tail';\n\n/**\n * Performs left-to-right function composition. The leftmost function may have\n * any arity; the remaining functions must be unary.\n *\n * In some libraries this function is named `sequence`.\n *\n * **Note:** The result of pipe is not automatically curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (((a, b, ..., n) -> o), (o -> p), ..., (x -> y), (y -> z)) -> ((a, b, ..., n) -> z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.compose\n * @example\n *\n *      var f = R.pipe(Math.pow, R.negate, R.inc);\n *\n *      f(3, 4); // -(3^4) + 1\n * @symb R.pipe(f, g, h)(a, b) = h(g(f(a, b)))\n */\nexport default function pipe() {\n  if (arguments.length === 0) {\n    throw new Error('pipe requires at least one argument');\n  }\n  return _arity(arguments[0].length, reduce(_pipe, arguments[0], tail(arguments)));\n}","import _curry1 from './internal/_curry1';\nimport _isString from './internal/_isString';\n\n/**\n * Returns a new list or string with the elements or characters in reverse\n * order.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {Array|String} list\n * @return {Array|String}\n * @example\n *\n *      R.reverse([1, 2, 3]);  //=> [3, 2, 1]\n *      R.reverse([1, 2]);     //=> [2, 1]\n *      R.reverse([1]);        //=> [1]\n *      R.reverse([]);         //=> []\n *\n *      R.reverse('abc');      //=> 'cba'\n *      R.reverse('ab');       //=> 'ba'\n *      R.reverse('a');        //=> 'a'\n *      R.reverse('');         //=> ''\n */\nvar reverse = /*#__PURE__*/_curry1(function reverse(list) {\n  return _isString(list) ? list.split('').reverse().join('') : Array.prototype.slice.call(list, 0).reverse();\n});\nexport default reverse;","import pipe from './pipe';\nimport reverse from './reverse';\n\n/**\n * Performs right-to-left function composition. The rightmost function may have\n * any arity; the remaining functions must be unary.\n *\n * **Note:** The result of compose is not automatically curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig ((y -> z), (x -> y), ..., (o -> p), ((a, b, ..., n) -> o)) -> ((a, b, ..., n) -> z)\n * @param {...Function} ...functions The functions to compose\n * @return {Function}\n * @see R.pipe\n * @example\n *\n *      var classyGreeting = (firstName, lastName) => \"The name's \" + lastName + \", \" + firstName + \" \" + lastName\n *      var yellGreeting = R.compose(R.toUpper, classyGreeting);\n *      yellGreeting('James', 'Bond'); //=> \"THE NAME'S BOND, JAMES BOND\"\n *\n *      R.compose(Math.abs, R.add(1), R.multiply(2))(-4) //=> 7\n *\n * @symb R.compose(f, g, h)(a, b) = f(g(h(a, b)))\n */\nexport default function compose() {\n  if (arguments.length === 0) {\n    throw new Error('compose requires at least one argument');\n  }\n  return pipe.apply(this, reverse(arguments));\n}","import chain from './chain';\nimport compose from './compose';\nimport map from './map';\n\n/**\n * Returns the right-to-left Kleisli composition of the provided functions,\n * each of which must return a value of a type supported by [`chain`](#chain).\n *\n * `R.composeK(h, g, f)` is equivalent to `R.compose(R.chain(h), R.chain(g), f)`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Function\n * @sig Chain m => ((y -> m z), (x -> m y), ..., (a -> m b)) -> (a -> m z)\n * @param {...Function} ...functions The functions to compose\n * @return {Function}\n * @see R.pipeK\n * @example\n *\n *       //  get :: String -> Object -> Maybe *\n *       var get = R.curry((propName, obj) => Maybe(obj[propName]))\n *\n *       //  getStateCode :: Maybe String -> Maybe String\n *       var getStateCode = R.composeK(\n *         R.compose(Maybe.of, R.toUpper),\n *         get('state'),\n *         get('address'),\n *         get('user'),\n *       );\n *       getStateCode({\"user\":{\"address\":{\"state\":\"ny\"}}}); //=> Maybe.Just(\"NY\")\n *       getStateCode({}); //=> Maybe.Nothing()\n * @symb R.composeK(f, g, h)(a) = R.chain(f, R.chain(g, h(a)))\n */\nexport default function composeK() {\n  if (arguments.length === 0) {\n    throw new Error('composeK requires at least one argument');\n  }\n  var init = Array.prototype.slice.call(arguments);\n  var last = init.pop();\n  return compose(compose.apply(this, map(chain, init)), last);\n}","export default function _pipeP(f, g) {\n  return function () {\n    var ctx = this;\n    return f.apply(ctx, arguments).then(function (x) {\n      return g.call(ctx, x);\n    });\n  };\n}","import _arity from './internal/_arity';\nimport _pipeP from './internal/_pipeP';\nimport reduce from './reduce';\nimport tail from './tail';\n\n/**\n * Performs left-to-right composition of one or more Promise-returning\n * functions. The leftmost function may have any arity; the remaining functions\n * must be unary.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a -> Promise b), (b -> Promise c), ..., (y -> Promise z)) -> (a -> Promise z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.composeP\n * @example\n *\n *      //  followersForUser :: String -> Promise [User]\n *      var followersForUser = R.pipeP(db.getUserById, db.getFollowers);\n */\nexport default function pipeP() {\n  if (arguments.length === 0) {\n    throw new Error('pipeP requires at least one argument');\n  }\n  return _arity(arguments[0].length, reduce(_pipeP, arguments[0], tail(arguments)));\n}","import pipeP from './pipeP';\nimport reverse from './reverse';\n\n/**\n * Performs right-to-left composition of one or more Promise-returning\n * functions. The rightmost function may have any arity; the remaining\n * functions must be unary.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((y -> Promise z), (x -> Promise y), ..., (a -> Promise b)) -> (a -> Promise z)\n * @param {...Function} functions The functions to compose\n * @return {Function}\n * @see R.pipeP\n * @example\n *\n *      var db = {\n *        users: {\n *          JOE: {\n *            name: 'Joe',\n *            followers: ['STEVE', 'SUZY']\n *          }\n *        }\n *      }\n *\n *      // We'll pretend to do a db lookup which returns a promise\n *      var lookupUser = (userId) => Promise.resolve(db.users[userId])\n *      var lookupFollowers = (user) => Promise.resolve(user.followers)\n *      lookupUser('JOE').then(lookupFollowers)\n *\n *      //  followersForUser :: String -> Promise [UserId]\n *      var followersForUser = R.composeP(lookupFollowers, lookupUser);\n *      followersForUser('JOE').then(followers => console.log('Followers:', followers))\n *      // Followers: [\"STEVE\",\"SUZY\"]\n */\nexport default function composeP() {\n  if (arguments.length === 0) {\n    throw new Error('composeP requires at least one argument');\n  }\n  return pipeP.apply(this, reverse(arguments));\n}","export default function _arrayFromIterator(iter) {\n  var list = [];\n  var next;\n  while (!(next = iter.next()).done) {\n    list.push(next.value);\n  }\n  return list;\n}","export default function _containsWith(pred, x, list) {\n  var idx = 0;\n  var len = list.length;\n\n  while (idx < len) {\n    if (pred(x, list[idx])) {\n      return true;\n    }\n    idx += 1;\n  }\n  return false;\n}","import _curry2 from './internal/_curry2';\n\n/**\n * Returns true if its arguments are identical, false otherwise. Values are\n * identical if they reference the same memory. `NaN` is identical to `NaN`;\n * `0` and `-0` are not identical.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n *      var o = {};\n *      R.identical(o, o); //=> true\n *      R.identical(1, 1); //=> true\n *      R.identical(1, '1'); //=> false\n *      R.identical([], []); //=> false\n *      R.identical(0, -0); //=> false\n *      R.identical(NaN, NaN); //=> true\n */\nvar identical = /*#__PURE__*/_curry2(function identical(a, b) {\n  // SameValue algorithm\n  if (a === b) {\n    // Steps 1-5, 7-10\n    // Steps 6.b-6.e: +0 != -0\n    return a !== 0 || 1 / a === 1 / b;\n  } else {\n    // Step 6.a: NaN == NaN\n    return a !== a && b !== b;\n  }\n});\nexport default identical;","import _arrayFromIterator from './_arrayFromIterator';\nimport _containsWith from './_containsWith';\nimport _functionName from './_functionName';\nimport _has from './_has';\nimport identical from '../identical';\nimport keys from '../keys';\nimport type from '../type';\n\n/**\n * private _uniqContentEquals function.\n * That function is checking equality of 2 iterator contents with 2 assumptions\n * - iterators lengths are the same\n * - iterators values are unique\n *\n * false-positive result will be returned for comparision of, e.g.\n * - [1,2,3] and [1,2,3,4]\n * - [1,1,1] and [1,2,3]\n * */\n\nfunction _uniqContentEquals(aIterator, bIterator, stackA, stackB) {\n  var a = _arrayFromIterator(aIterator);\n  var b = _arrayFromIterator(bIterator);\n\n  function eq(_a, _b) {\n    return _equals(_a, _b, stackA.slice(), stackB.slice());\n  }\n\n  // if *a* array contains any element that is not included in *b*\n  return !_containsWith(function (b, aItem) {\n    return !_containsWith(eq, aItem, b);\n  }, b, a);\n}\n\nexport default function _equals(a, b, stackA, stackB) {\n  if (identical(a, b)) {\n    return true;\n  }\n\n  var typeA = type(a);\n\n  if (typeA !== type(b)) {\n    return false;\n  }\n\n  if (a == null || b == null) {\n    return false;\n  }\n\n  if (typeof a['fantasy-land/equals'] === 'function' || typeof b['fantasy-land/equals'] === 'function') {\n    return typeof a['fantasy-land/equals'] === 'function' && a['fantasy-land/equals'](b) && typeof b['fantasy-land/equals'] === 'function' && b['fantasy-land/equals'](a);\n  }\n\n  if (typeof a.equals === 'function' || typeof b.equals === 'function') {\n    return typeof a.equals === 'function' && a.equals(b) && typeof b.equals === 'function' && b.equals(a);\n  }\n\n  switch (typeA) {\n    case 'Arguments':\n    case 'Array':\n    case 'Object':\n      if (typeof a.constructor === 'function' && _functionName(a.constructor) === 'Promise') {\n        return a === b;\n      }\n      break;\n    case 'Boolean':\n    case 'Number':\n    case 'String':\n      if (!(typeof a === typeof b && identical(a.valueOf(), b.valueOf()))) {\n        return false;\n      }\n      break;\n    case 'Date':\n      if (!identical(a.valueOf(), b.valueOf())) {\n        return false;\n      }\n      break;\n    case 'Error':\n      return a.name === b.name && a.message === b.message;\n    case 'RegExp':\n      if (!(a.source === b.source && a.global === b.global && a.ignoreCase === b.ignoreCase && a.multiline === b.multiline && a.sticky === b.sticky && a.unicode === b.unicode)) {\n        return false;\n      }\n      break;\n  }\n\n  var idx = stackA.length - 1;\n  while (idx >= 0) {\n    if (stackA[idx] === a) {\n      return stackB[idx] === b;\n    }\n    idx -= 1;\n  }\n\n  switch (typeA) {\n    case 'Map':\n      if (a.size !== b.size) {\n        return false;\n      }\n\n      return _uniqContentEquals(a.entries(), b.entries(), stackA.concat([a]), stackB.concat([b]));\n    case 'Set':\n      if (a.size !== b.size) {\n        return false;\n      }\n\n      return _uniqContentEquals(a.values(), b.values(), stackA.concat([a]), stackB.concat([b]));\n    case 'Arguments':\n    case 'Array':\n    case 'Object':\n    case 'Boolean':\n    case 'Number':\n    case 'String':\n    case 'Date':\n    case 'Error':\n    case 'RegExp':\n    case 'Int8Array':\n    case 'Uint8Array':\n    case 'Uint8ClampedArray':\n    case 'Int16Array':\n    case 'Uint16Array':\n    case 'Int32Array':\n    case 'Uint32Array':\n    case 'Float32Array':\n    case 'Float64Array':\n    case 'ArrayBuffer':\n      break;\n    default:\n      // Values of other types are only equal if identical.\n      return false;\n  }\n\n  var keysA = keys(a);\n  if (keysA.length !== keys(b).length) {\n    return false;\n  }\n\n  var extendedStackA = stackA.concat([a]);\n  var extendedStackB = stackB.concat([b]);\n\n  idx = keysA.length - 1;\n  while (idx >= 0) {\n    var key = keysA[idx];\n    if (!(_has(key, b) && _equals(b[key], a[key], extendedStackA, extendedStackB))) {\n      return false;\n    }\n    idx -= 1;\n  }\n  return true;\n}","export default function _functionName(f) {\n  // String(x => x) evaluates to \"x => x\", so the pattern may not match.\n  var match = String(f).match(/^function (\\w*)/);\n  return match == null ? '' : match[1];\n}","import _curry2 from './internal/_curry2';\nimport _equals from './internal/_equals';\n\n/**\n * Returns `true` if its arguments are equivalent, `false` otherwise. Handles\n * cyclical data structures.\n *\n * Dispatches symmetrically to the `equals` methods of both arguments, if\n * present.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> b -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n *      R.equals(1, 1); //=> true\n *      R.equals(1, '1'); //=> false\n *      R.equals([1, 2, 3], [1, 2, 3]); //=> true\n *\n *      var a = {}; a.v = a;\n *      var b = {}; b.v = b;\n *      R.equals(a, b); //=> true\n */\nvar equals = /*#__PURE__*/_curry2(function equals(a, b) {\n  return _equals(a, b, [], []);\n});\nexport default equals;","import equals from '../equals';\n\nexport default function _indexOf(list, a, idx) {\n  var inf, item;\n  // Array.prototype.indexOf doesn't exist below IE9\n  if (typeof list.indexOf === 'function') {\n    switch (typeof a) {\n      case 'number':\n        if (a === 0) {\n          // manually crawl the list to distinguish between +0 and -0\n          inf = 1 / a;\n          while (idx < list.length) {\n            item = list[idx];\n            if (item === 0 && 1 / item === inf) {\n              return idx;\n            }\n            idx += 1;\n          }\n          return -1;\n        } else if (a !== a) {\n          // NaN\n          while (idx < list.length) {\n            item = list[idx];\n            if (typeof item === 'number' && item !== item) {\n              return idx;\n            }\n            idx += 1;\n          }\n          return -1;\n        }\n        // non-zero numbers can utilise Set\n        return list.indexOf(a, idx);\n\n      // all these types can utilise Set\n      case 'string':\n      case 'boolean':\n      case 'function':\n      case 'undefined':\n        return list.indexOf(a, idx);\n\n      case 'object':\n        if (a === null) {\n          // null can utilise Set\n          return list.indexOf(a, idx);\n        }\n    }\n  }\n  // anything else not covered above, defer to R.equals\n  while (idx < list.length) {\n    if (equals(list[idx], a)) {\n      return idx;\n    }\n    idx += 1;\n  }\n  return -1;\n}","import _indexOf from './_indexOf';\n\nexport default function _contains(a, list) {\n  return _indexOf(list, a, 0) >= 0;\n}","export default function _quote(s) {\n  var escaped = s.replace(/\\\\/g, '\\\\\\\\').replace(/[\\b]/g, '\\\\b') // \\b matches word boundary; [\\b] matches backspace\n  .replace(/\\f/g, '\\\\f').replace(/\\n/g, '\\\\n').replace(/\\r/g, '\\\\r').replace(/\\t/g, '\\\\t').replace(/\\v/g, '\\\\v').replace(/\\0/g, '\\\\0');\n\n  return '\"' + escaped.replace(/\"/g, '\\\\\"') + '\"';\n}","/**\n * Polyfill from <https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toISOString>.\n */\nvar pad = function pad(n) {\n  return (n < 10 ? '0' : '') + n;\n};\n\nvar _toISOString = typeof Date.prototype.toISOString === 'function' ? function _toISOString(d) {\n  return d.toISOString();\n} : function _toISOString(d) {\n  return d.getUTCFullYear() + '-' + pad(d.getUTCMonth() + 1) + '-' + pad(d.getUTCDate()) + 'T' + pad(d.getUTCHours()) + ':' + pad(d.getUTCMinutes()) + ':' + pad(d.getUTCSeconds()) + '.' + (d.getUTCMilliseconds() / 1000).toFixed(3).slice(2, 5) + 'Z';\n};\n\nexport default _toISOString;","export default function _complement(f) {\n  return function () {\n    return !f.apply(this, arguments);\n  };\n}","export default function _filter(fn, list) {\n  var idx = 0;\n  var len = list.length;\n  var result = [];\n\n  while (idx < len) {\n    if (fn(list[idx])) {\n      result[result.length] = list[idx];\n    }\n    idx += 1;\n  }\n  return result;\n}","export default function _isObject(x) {\n  return Object.prototype.toString.call(x) === '[object Object]';\n}","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XFilter = /*#__PURE__*/function () {\n  function XFilter(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XFilter.prototype['@@transducer/init'] = _xfBase.init;\n  XFilter.prototype['@@transducer/result'] = _xfBase.result;\n  XFilter.prototype['@@transducer/step'] = function (result, input) {\n    return this.f(input) ? this.xf['@@transducer/step'](result, input) : result;\n  };\n\n  return XFilter;\n}();\n\nvar _xfilter = /*#__PURE__*/_curry2(function _xfilter(f, xf) {\n  return new XFilter(f, xf);\n});\nexport default _xfilter;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _filter from './internal/_filter';\nimport _isObject from './internal/_isObject';\nimport _reduce from './internal/_reduce';\nimport _xfilter from './internal/_xfilter';\nimport keys from './keys';\n\n/**\n * Takes a predicate and a `Filterable`, and returns a new filterable of the\n * same type containing the members of the given filterable which satisfy the\n * given predicate. Filterable objects include plain objects or any object\n * that has a filter method such as `Array`.\n *\n * Dispatches to the `filter` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> f a\n * @param {Function} pred\n * @param {Array} filterable\n * @return {Array} Filterable\n * @see R.reject, R.transduce, R.addIndex\n * @example\n *\n *      var isEven = n => n % 2 === 0;\n *\n *      R.filter(isEven, [1, 2, 3, 4]); //=> [2, 4]\n *\n *      R.filter(isEven, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}\n */\nvar filter = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['filter'], _xfilter, function (pred, filterable) {\n  return _isObject(filterable) ? _reduce(function (acc, key) {\n    if (pred(filterable[key])) {\n      acc[key] = filterable[key];\n    }\n    return acc;\n  }, {}, keys(filterable)) :\n  // else\n  _filter(pred, filterable);\n}));\nexport default filter;","import _complement from './internal/_complement';\nimport _curry2 from './internal/_curry2';\nimport filter from './filter';\n\n/**\n * The complement of [`filter`](#filter).\n *\n * Acts as a transducer if a transformer is given in list position. Filterable\n * objects include plain objects or any object that has a filter method such\n * as `Array`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> f a\n * @param {Function} pred\n * @param {Array} filterable\n * @return {Array}\n * @see R.filter, R.transduce, R.addIndex\n * @example\n *\n *      var isOdd = (n) => n % 2 === 1;\n *\n *      R.reject(isOdd, [1, 2, 3, 4]); //=> [2, 4]\n *\n *      R.reject(isOdd, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}\n */\nvar reject = /*#__PURE__*/_curry2(function reject(pred, filterable) {\n  return filter(_complement(pred), filterable);\n});\nexport default reject;","import _curry1 from './internal/_curry1';\nimport _toString from './internal/_toString';\n\n/**\n * Returns the string representation of the given value. `eval`'ing the output\n * should result in a value equivalent to the input value. Many of the built-in\n * `toString` methods do not satisfy this requirement.\n *\n * If the given value is an `[object Object]` with a `toString` method other\n * than `Object.prototype.toString`, this method is invoked with no arguments\n * to produce the return value. This means user-defined constructor functions\n * can provide a suitable `toString` method. For example:\n *\n *     function Point(x, y) {\n *       this.x = x;\n *       this.y = y;\n *     }\n *\n *     Point.prototype.toString = function() {\n *       return 'new Point(' + this.x + ', ' + this.y + ')';\n *     };\n *\n *     R.toString(new Point(1, 2)); //=> 'new Point(1, 2)'\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category String\n * @sig * -> String\n * @param {*} val\n * @return {String}\n * @example\n *\n *      R.toString(42); //=> '42'\n *      R.toString('abc'); //=> '\"abc\"'\n *      R.toString([1, 2, 3]); //=> '[1, 2, 3]'\n *      R.toString({foo: 1, bar: 2, baz: 3}); //=> '{\"bar\": 2, \"baz\": 3, \"foo\": 1}'\n *      R.toString(new Date('2001-02-03T04:05:06Z')); //=> 'new Date(\"2001-02-03T04:05:06.000Z\")'\n */\nvar toString = /*#__PURE__*/_curry1(function toString(val) {\n  return _toString(val, []);\n});\nexport default toString;","import _contains from './_contains';\nimport _map from './_map';\nimport _quote from './_quote';\nimport _toISOString from './_toISOString';\nimport keys from '../keys';\nimport reject from '../reject';\n\nexport default function _toString(x, seen) {\n  var recur = function recur(y) {\n    var xs = seen.concat([x]);\n    return _contains(y, xs) ? '<Circular>' : _toString(y, xs);\n  };\n\n  //  mapPairs :: (Object, [String]) -> [String]\n  var mapPairs = function (obj, keys) {\n    return _map(function (k) {\n      return _quote(k) + ': ' + recur(obj[k]);\n    }, keys.slice().sort());\n  };\n\n  switch (Object.prototype.toString.call(x)) {\n    case '[object Arguments]':\n      return '(function() { return arguments; }(' + _map(recur, x).join(', ') + '))';\n    case '[object Array]':\n      return '[' + _map(recur, x).concat(mapPairs(x, reject(function (k) {\n        return (/^\\d+$/.test(k)\n        );\n      }, keys(x)))).join(', ') + ']';\n    case '[object Boolean]':\n      return typeof x === 'object' ? 'new Boolean(' + recur(x.valueOf()) + ')' : x.toString();\n    case '[object Date]':\n      return 'new Date(' + (isNaN(x.valueOf()) ? recur(NaN) : _quote(_toISOString(x))) + ')';\n    case '[object Null]':\n      return 'null';\n    case '[object Number]':\n      return typeof x === 'object' ? 'new Number(' + recur(x.valueOf()) + ')' : 1 / x === -Infinity ? '-0' : x.toString(10);\n    case '[object String]':\n      return typeof x === 'object' ? 'new String(' + recur(x.valueOf()) + ')' : _quote(x);\n    case '[object Undefined]':\n      return 'undefined';\n    default:\n      if (typeof x.toString === 'function') {\n        var repr = x.toString();\n        if (repr !== '[object Object]') {\n          return repr;\n        }\n      }\n      return '{' + mapPairs(x, keys(x)).join(', ') + '}';\n  }\n}","import _curry2 from './internal/_curry2';\nimport _isArray from './internal/_isArray';\nimport _isFunction from './internal/_isFunction';\nimport _isString from './internal/_isString';\nimport toString from './toString';\n\n/**\n * Returns the result of concatenating the given lists or strings.\n *\n * Note: `R.concat` expects both arguments to be of the same type,\n * unlike the native `Array.prototype.concat` method. It will throw\n * an error if you `concat` an Array with a non-Array value.\n *\n * Dispatches to the `concat` method of the first argument, if present.\n * Can also concatenate two members of a [fantasy-land\n * compatible semigroup](https://github.com/fantasyland/fantasy-land#semigroup).\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a] -> [a]\n * @sig String -> String -> String\n * @param {Array|String} firstList The first list\n * @param {Array|String} secondList The second list\n * @return {Array|String} A list consisting of the elements of `firstList` followed by the elements of\n * `secondList`.\n *\n * @example\n *\n *      R.concat('ABC', 'DEF'); // 'ABCDEF'\n *      R.concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]\n *      R.concat([], []); //=> []\n */\nvar concat = /*#__PURE__*/_curry2(function concat(a, b) {\n  if (_isArray(a)) {\n    if (_isArray(b)) {\n      return a.concat(b);\n    }\n    throw new TypeError(toString(b) + ' is not an array');\n  }\n  if (_isString(a)) {\n    if (_isString(b)) {\n      return a + b;\n    }\n    throw new TypeError(toString(b) + ' is not a string');\n  }\n  if (a != null && _isFunction(a['fantasy-land/concat'])) {\n    return a['fantasy-land/concat'](b);\n  }\n  if (a != null && _isFunction(a.concat)) {\n    return a.concat(b);\n  }\n  throw new TypeError(toString(a) + ' does not have a method named \"concat\" or \"fantasy-land/concat\"');\n});\nexport default concat;","import _arity from './internal/_arity';\nimport _curry1 from './internal/_curry1';\nimport map from './map';\nimport max from './max';\nimport reduce from './reduce';\n\n/**\n * Returns a function, `fn`, which encapsulates `if/else, if/else, ...` logic.\n * `R.cond` takes a list of [predicate, transformer] pairs. All of the arguments\n * to `fn` are applied to each of the predicates in turn until one returns a\n * \"truthy\" value, at which point `fn` returns the result of applying its\n * arguments to the corresponding transformer. If none of the predicates\n * matches, `fn` returns undefined.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Logic\n * @sig [[(*... -> Boolean),(*... -> *)]] -> (*... -> *)\n * @param {Array} pairs A list of [predicate, transformer]\n * @return {Function}\n * @example\n *\n *      var fn = R.cond([\n *        [R.equals(0),   R.always('water freezes at 0°C')],\n *        [R.equals(100), R.always('water boils at 100°C')],\n *        [R.T,           temp => 'nothing special happens at ' + temp + '°C']\n *      ]);\n *      fn(0); //=> 'water freezes at 0°C'\n *      fn(50); //=> 'nothing special happens at 50°C'\n *      fn(100); //=> 'water boils at 100°C'\n */\nvar cond = /*#__PURE__*/_curry1(function cond(pairs) {\n  var arity = reduce(max, 0, map(function (pair) {\n    return pair[0].length;\n  }, pairs));\n  return _arity(arity, function () {\n    var idx = 0;\n    while (idx < pairs.length) {\n      if (pairs[idx][0].apply(this, arguments)) {\n        return pairs[idx][1].apply(this, arguments);\n      }\n      idx += 1;\n    }\n  });\n});\nexport default cond;","import _curry2 from './internal/_curry2';\nimport curry from './curry';\nimport nAry from './nAry';\n\n/**\n * Wraps a constructor function inside a curried function that can be called\n * with the same arguments and returns the same type. The arity of the function\n * returned is specified to allow using variadic constructor functions.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Function\n * @sig Number -> (* -> {*}) -> (* -> {*})\n * @param {Number} n The arity of the constructor function.\n * @param {Function} Fn The constructor function to wrap.\n * @return {Function} A wrapped, curried constructor function.\n * @example\n *\n *      // Variadic Constructor function\n *      function Salad() {\n *        this.ingredients = arguments;\n *      }\n *\n *      Salad.prototype.recipe = function() {\n *        var instructions = R.map(ingredient => 'Add a dollop of ' + ingredient, this.ingredients);\n *        return R.join('\\n', instructions);\n *      };\n *\n *      var ThreeLayerSalad = R.constructN(3, Salad);\n *\n *      // Notice we no longer need the 'new' keyword, and the constructor is curried for 3 arguments.\n *      var salad = ThreeLayerSalad('Mayonnaise')('Potato Chips')('Ketchup');\n *\n *      console.log(salad.recipe());\n *      // Add a dollop of Mayonnaise\n *      // Add a dollop of Potato Chips\n *      // Add a dollop of Ketchup\n */\nvar constructN = /*#__PURE__*/_curry2(function constructN(n, Fn) {\n  if (n > 10) {\n    throw new Error('Constructor with greater than ten arguments');\n  }\n  if (n === 0) {\n    return function () {\n      return new Fn();\n    };\n  }\n  return curry(nAry(n, function ($0, $1, $2, $3, $4, $5, $6, $7, $8, $9) {\n    switch (arguments.length) {\n      case 1:\n        return new Fn($0);\n      case 2:\n        return new Fn($0, $1);\n      case 3:\n        return new Fn($0, $1, $2);\n      case 4:\n        return new Fn($0, $1, $2, $3);\n      case 5:\n        return new Fn($0, $1, $2, $3, $4);\n      case 6:\n        return new Fn($0, $1, $2, $3, $4, $5);\n      case 7:\n        return new Fn($0, $1, $2, $3, $4, $5, $6);\n      case 8:\n        return new Fn($0, $1, $2, $3, $4, $5, $6, $7);\n      case 9:\n        return new Fn($0, $1, $2, $3, $4, $5, $6, $7, $8);\n      case 10:\n        return new Fn($0, $1, $2, $3, $4, $5, $6, $7, $8, $9);\n    }\n  }));\n});\nexport default constructN;","import _curry1 from './internal/_curry1';\nimport constructN from './constructN';\n\n/**\n * Wraps a constructor function inside a curried function that can be called\n * with the same arguments and returns the same type.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (* -> {*}) -> (* -> {*})\n * @param {Function} fn The constructor function to wrap.\n * @return {Function} A wrapped, curried constructor function.\n * @see R.invoker\n * @example\n *\n *      // Constructor function\n *      function Animal(kind) {\n *        this.kind = kind;\n *      };\n *      Animal.prototype.sighting = function() {\n *        return \"It's a \" + this.kind + \"!\";\n *      }\n *\n *      var AnimalConstructor = R.construct(Animal)\n *\n *      // Notice we no longer need the 'new' keyword:\n *      AnimalConstructor('Pig'); //=> {\"kind\": \"Pig\", \"sighting\": function (){...}};\n *\n *      var animalTypes = [\"Lion\", \"Tiger\", \"Bear\"];\n *      var animalSighting = R.invoker(0, 'sighting');\n *      var sightNewAnimal = R.compose(animalSighting, AnimalConstructor);\n *      R.map(sightNewAnimal, animalTypes); //=> [\"It's a Lion!\", \"It's a Tiger!\", \"It's a Bear!\"]\n */\nvar construct = /*#__PURE__*/_curry1(function construct(Fn) {\n  return constructN(Fn.length, Fn);\n});\nexport default construct;","import _contains from './internal/_contains';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if the specified value is equal, in [`R.equals`](#equals)\n * terms, to at least one element of the given list; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Boolean\n * @param {Object} a The item to compare against.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if an equivalent item is in the list, `false` otherwise.\n * @see R.any\n * @example\n *\n *      R.contains(3, [1, 2, 3]); //=> true\n *      R.contains(4, [1, 2, 3]); //=> false\n *      R.contains({ name: 'Fred' }, [{ name: 'Fred' }]); //=> true\n *      R.contains([42], [[42]]); //=> true\n */\nvar contains = /*#__PURE__*/_curry2(_contains);\nexport default contains;","import _curry2 from './internal/_curry2';\nimport _map from './internal/_map';\nimport curryN from './curryN';\nimport max from './max';\nimport pluck from './pluck';\nimport reduce from './reduce';\n\n/**\n * Accepts a converging function and a list of branching functions and returns\n * a new function. When invoked, this new function is applied to some\n * arguments, each branching function is applied to those same arguments. The\n * results of each branching function are passed as arguments to the converging\n * function to produce the return value.\n *\n * @func\n * @memberOf R\n * @since v0.4.2\n * @category Function\n * @sig ((x1, x2, ...) -> z) -> [((a, b, ...) -> x1), ((a, b, ...) -> x2), ...] -> (a -> b -> ... -> z)\n * @param {Function} after A function. `after` will be invoked with the return values of\n *        `fn1` and `fn2` as its arguments.\n * @param {Array} functions A list of functions.\n * @return {Function} A new function.\n * @see R.useWith\n * @example\n *\n *      var average = R.converge(R.divide, [R.sum, R.length])\n *      average([1, 2, 3, 4, 5, 6, 7]) //=> 4\n *\n *      var strangeConcat = R.converge(R.concat, [R.toUpper, R.toLower])\n *      strangeConcat(\"Yodel\") //=> \"YODELyodel\"\n *\n * @symb R.converge(f, [g, h])(a, b) = f(g(a, b), h(a, b))\n */\nvar converge = /*#__PURE__*/_curry2(function converge(after, fns) {\n  return curryN(reduce(max, 0, pluck('length', fns)), function () {\n    var args = arguments;\n    var context = this;\n    return after.apply(context, _map(function (fn) {\n      return fn.apply(context, args);\n    }, fns));\n  });\n});\nexport default converge;","import _curryN from './_curryN';\nimport _has from './_has';\nimport _xfBase from './_xfBase';\n\nvar XReduceBy = /*#__PURE__*/function () {\n  function XReduceBy(valueFn, valueAcc, keyFn, xf) {\n    this.valueFn = valueFn;\n    this.valueAcc = valueAcc;\n    this.keyFn = keyFn;\n    this.xf = xf;\n    this.inputs = {};\n  }\n  XReduceBy.prototype['@@transducer/init'] = _xfBase.init;\n  XReduceBy.prototype['@@transducer/result'] = function (result) {\n    var key;\n    for (key in this.inputs) {\n      if (_has(key, this.inputs)) {\n        result = this.xf['@@transducer/step'](result, this.inputs[key]);\n        if (result['@@transducer/reduced']) {\n          result = result['@@transducer/value'];\n          break;\n        }\n      }\n    }\n    this.inputs = null;\n    return this.xf['@@transducer/result'](result);\n  };\n  XReduceBy.prototype['@@transducer/step'] = function (result, input) {\n    var key = this.keyFn(input);\n    this.inputs[key] = this.inputs[key] || [key, this.valueAcc];\n    this.inputs[key][1] = this.valueFn(this.inputs[key][1], input);\n    return result;\n  };\n\n  return XReduceBy;\n}();\n\nvar _xreduceBy = /*#__PURE__*/_curryN(4, [], function _xreduceBy(valueFn, valueAcc, keyFn, xf) {\n  return new XReduceBy(valueFn, valueAcc, keyFn, xf);\n});\nexport default _xreduceBy;","import _curryN from './internal/_curryN';\nimport _dispatchable from './internal/_dispatchable';\nimport _has from './internal/_has';\nimport _reduce from './internal/_reduce';\nimport _xreduceBy from './internal/_xreduceBy';\n\n/**\n * Groups the elements of the list according to the result of calling\n * the String-returning function `keyFn` on each element and reduces the elements\n * of each group to a single value via the reducer function `valueFn`.\n *\n * This function is basically a more general [`groupBy`](#groupBy) function.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category List\n * @sig ((a, b) -> a) -> a -> (b -> String) -> [b] -> {String: a}\n * @param {Function} valueFn The function that reduces the elements of each group to a single\n *        value. Receives two values, accumulator for a particular group and the current element.\n * @param {*} acc The (initial) accumulator value for each group.\n * @param {Function} keyFn The function that maps the list's element into a key.\n * @param {Array} list The array to group.\n * @return {Object} An object with the output of `keyFn` for keys, mapped to the output of\n *         `valueFn` for elements which produced that key when passed to `keyFn`.\n * @see R.groupBy, R.reduce\n * @example\n *\n *      var reduceToNamesBy = R.reduceBy((acc, student) => acc.concat(student.name), []);\n *      var namesByGrade = reduceToNamesBy(function(student) {\n *        var score = student.score;\n *        return score < 65 ? 'F' :\n *               score < 70 ? 'D' :\n *               score < 80 ? 'C' :\n *               score < 90 ? 'B' : 'A';\n *      });\n *      var students = [{name: 'Lucy', score: 92},\n *                      {name: 'Drew', score: 85},\n *                      // ...\n *                      {name: 'Bart', score: 62}];\n *      namesByGrade(students);\n *      // {\n *      //   'A': ['Lucy'],\n *      //   'B': ['Drew']\n *      //   // ...,\n *      //   'F': ['Bart']\n *      // }\n */\nvar reduceBy = /*#__PURE__*/_curryN(4, [], /*#__PURE__*/_dispatchable([], _xreduceBy, function reduceBy(valueFn, valueAcc, keyFn, list) {\n  return _reduce(function (acc, elt) {\n    var key = keyFn(elt);\n    acc[key] = valueFn(_has(key, acc) ? acc[key] : valueAcc, elt);\n    return acc;\n  }, {}, list);\n}));\nexport default reduceBy;","import reduceBy from './reduceBy';\n\n/**\n * Counts the elements of a list according to how many match each value of a\n * key generated by the supplied function. Returns an object mapping the keys\n * produced by `fn` to the number of occurrences in the list. Note that all\n * keys are coerced to strings because of how JavaScript objects work.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig (a -> String) -> [a] -> {*}\n * @param {Function} fn The function used to map values to keys.\n * @param {Array} list The list to count elements from.\n * @return {Object} An object mapping keys to number of occurrences in the list.\n * @example\n *\n *      var numbers = [1.0, 1.1, 1.2, 2.0, 3.0, 2.2];\n *      R.countBy(Math.floor)(numbers);    //=> {'1': 3, '2': 2, '3': 1}\n *\n *      var letters = ['a', 'b', 'A', 'a', 'B', 'c'];\n *      R.countBy(R.toLower)(letters);   //=> {'a': 3, 'b': 2, 'c': 1}\n */\nvar countBy = /*#__PURE__*/reduceBy(function (acc, elem) {\n  return acc + 1;\n}, 0);\nexport default countBy;","import add from './add';\n\n/**\n * Decrements its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number} n - 1\n * @see R.inc\n * @example\n *\n *      R.dec(42); //=> 41\n */\nvar dec = /*#__PURE__*/add(-1);\nexport default dec;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns the second argument if it is not `null`, `undefined` or `NaN`;\n * otherwise the first argument is returned.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Logic\n * @sig a -> b -> a | b\n * @param {a} default The default value.\n * @param {b} val `val` will be returned instead of `default` unless `val` is `null`, `undefined` or `NaN`.\n * @return {*} The second value if it is not `null`, `undefined` or `NaN`, otherwise the default value\n * @example\n *\n *      var defaultTo42 = R.defaultTo(42);\n *\n *      defaultTo42(null);  //=> 42\n *      defaultTo42(undefined);  //=> 42\n *      defaultTo42('Ramda');  //=> 'Ramda'\n *      // parseInt('string') results in NaN\n *      defaultTo42(parseInt('string')); //=> 42\n */\nvar defaultTo = /*#__PURE__*/_curry2(function defaultTo(d, v) {\n  return v == null || v !== v ? d : v;\n});\nexport default defaultTo;","import _curry3 from './internal/_curry3';\n\n/**\n * Makes a descending comparator function out of a function that returns a value\n * that can be compared with `<` and `>`.\n *\n * @func\n * @memberOf R\n * @since v0.23.0\n * @category Function\n * @sig Ord b => (a -> b) -> a -> a -> Number\n * @param {Function} fn A function of arity one that returns a value that can be compared\n * @param {*} a The first item to be compared.\n * @param {*} b The second item to be compared.\n * @return {Number} `-1` if fn(a) > fn(b), `1` if fn(b) > fn(a), otherwise `0`\n * @see R.ascend\n * @example\n *\n *      var byAge = R.descend(R.prop('age'));\n *      var people = [\n *        // ...\n *      ];\n *      var peopleByOldestFirst = R.sort(byAge, people);\n */\nvar descend = /*#__PURE__*/_curry3(function descend(fn, a, b) {\n  var aa = fn(a);\n  var bb = fn(b);\n  return aa > bb ? -1 : aa < bb ? 1 : 0;\n});\nexport default descend;","import _contains from './internal/_contains';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Finds the set (i.e. no duplicates) of all elements in the first list not\n * contained in the second list. Objects and Arrays are compared in terms of\n * value equality, not reference equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` that are not in `list2`.\n * @see R.differenceWith, R.symmetricDifference, R.symmetricDifferenceWith, R.without\n * @example\n *\n *      R.difference([1,2,3,4], [7,6,5,4,3]); //=> [1,2]\n *      R.difference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5]\n *      R.difference([{a: 1}, {b: 2}], [{a: 1}, {c: 3}]) //=> [{b: 2}]\n */\nvar difference = /*#__PURE__*/_curry2(function difference(first, second) {\n  var out = [];\n  var idx = 0;\n  var firstLen = first.length;\n  while (idx < firstLen) {\n    if (!_contains(first[idx], second) && !_contains(first[idx], out)) {\n      out[out.length] = first[idx];\n    }\n    idx += 1;\n  }\n  return out;\n});\nexport default difference;","import _containsWith from './internal/_containsWith';\nimport _curry3 from './internal/_curry3';\n\n/**\n * Finds the set (i.e. no duplicates) of all elements in the first list not\n * contained in the second list. Duplication is determined according to the\n * value returned by applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig ((a, a) -> Boolean) -> [a] -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` that are not in `list2`.\n * @see R.difference, R.symmetricDifference, R.symmetricDifferenceWith\n * @example\n *\n *      var cmp = (x, y) => x.a === y.a;\n *      var l1 = [{a: 1}, {a: 2}, {a: 3}];\n *      var l2 = [{a: 3}, {a: 4}];\n *      R.differenceWith(cmp, l1, l2); //=> [{a: 1}, {a: 2}]\n */\nvar differenceWith = /*#__PURE__*/_curry3(function differenceWith(pred, first, second) {\n  var out = [];\n  var idx = 0;\n  var firstLen = first.length;\n  while (idx < firstLen) {\n    if (!_containsWith(pred, first[idx], second) && !_containsWith(pred, first[idx], out)) {\n      out.push(first[idx]);\n    }\n    idx += 1;\n  }\n  return out;\n});\nexport default differenceWith;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns a new object that does not contain a `prop` property.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Object\n * @sig String -> {k: v} -> {k: v}\n * @param {String} prop The name of the property to dissociate\n * @param {Object} obj The object to clone\n * @return {Object} A new object equivalent to the original but without the specified property\n * @see R.assoc\n * @example\n *\n *      R.dissoc('b', {a: 1, b: 2, c: 3}); //=> {a: 1, c: 3}\n */\nvar dissoc = /*#__PURE__*/_curry2(function dissoc(prop, obj) {\n  var result = {};\n  for (var p in obj) {\n    result[p] = obj[p];\n  }\n  delete result[prop];\n  return result;\n});\nexport default dissoc;","import _curry3 from './internal/_curry3';\n\n/**\n * Removes the sub-list of `list` starting at index `start` and containing\n * `count` elements. _Note that this is not destructive_: it returns a copy of\n * the list with the changes.\n * <small>No lists have been harmed in the application of this function.</small>\n *\n * @func\n * @memberOf R\n * @since v0.2.2\n * @category List\n * @sig Number -> Number -> [a] -> [a]\n * @param {Number} start The position to start removing elements\n * @param {Number} count The number of elements to remove\n * @param {Array} list The list to remove from\n * @return {Array} A new Array with `count` elements from `start` removed.\n * @example\n *\n *      R.remove(2, 3, [1,2,3,4,5,6,7,8]); //=> [1,2,6,7,8]\n */\nvar remove = /*#__PURE__*/_curry3(function remove(start, count, list) {\n  var result = Array.prototype.slice.call(list, 0);\n  result.splice(start, count);\n  return result;\n});\nexport default remove;","import _curry3 from './internal/_curry3';\nimport adjust from './adjust';\nimport always from './always';\n\n/**\n * Returns a new copy of the array with the element at the provided index\n * replaced with the given value.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig Number -> a -> [a] -> [a]\n * @param {Number} idx The index to update.\n * @param {*} x The value to exist at the given index of the returned array.\n * @param {Array|Arguments} list The source array-like object to be updated.\n * @return {Array} A copy of `list` with the value at index `idx` replaced with `x`.\n * @see R.adjust\n * @example\n *\n *      R.update(1, 11, [0, 1, 2]);     //=> [0, 11, 2]\n *      R.update(1)(11)([0, 1, 2]);     //=> [0, 11, 2]\n * @symb R.update(-1, a, [b, c]) = [b, a]\n * @symb R.update(0, a, [b, c]) = [a, c]\n * @symb R.update(1, a, [b, c]) = [b, a]\n */\nvar update = /*#__PURE__*/_curry3(function update(idx, x, list) {\n  return adjust(always(x), idx, list);\n});\nexport default update;","import _curry2 from './internal/_curry2';\nimport _isInteger from './internal/_isInteger';\nimport assoc from './assoc';\nimport dissoc from './dissoc';\nimport remove from './remove';\nimport update from './update';\n\n/**\n * Makes a shallow clone of an object, omitting the property at the given path.\n * Note that this copies and flattens prototype properties onto the new object\n * as well. All non-primitive properties are copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.11.0\n * @category Object\n * @typedefn Idx = String | Int\n * @sig [Idx] -> {k: v} -> {k: v}\n * @param {Array} path The path to the value to omit\n * @param {Object} obj The object to clone\n * @return {Object} A new object without the property at path\n * @see R.assocPath\n * @example\n *\n *      R.dissocPath(['a', 'b', 'c'], {a: {b: {c: 42}}}); //=> {a: {b: {}}}\n */\nvar dissocPath = /*#__PURE__*/_curry2(function dissocPath(path, obj) {\n  switch (path.length) {\n    case 0:\n      return obj;\n    case 1:\n      return _isInteger(path[0]) ? remove(path[0], 1, obj) : dissoc(path[0], obj);\n    default:\n      var head = path[0];\n      var tail = Array.prototype.slice.call(path, 1);\n      if (obj[head] == null) {\n        return obj;\n      } else if (_isInteger(path[0])) {\n        return update(head, dissocPath(tail, obj[head]), obj);\n      } else {\n        return assoc(head, dissocPath(tail, obj[head]), obj);\n      }\n  }\n});\nexport default dissocPath;","import _curry2 from './internal/_curry2';\n\n/**\n * Divides two numbers. Equivalent to `a / b`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a / b`.\n * @see R.multiply\n * @example\n *\n *      R.divide(71, 100); //=> 0.71\n *\n *      var half = R.divide(R.__, 2);\n *      half(42); //=> 21\n *\n *      var reciprocal = R.divide(1);\n *      reciprocal(4);   //=> 0.25\n */\nvar divide = /*#__PURE__*/_curry2(function divide(a, b) {\n  return a / b;\n});\nexport default divide;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XDrop = /*#__PURE__*/function () {\n  function XDrop(n, xf) {\n    this.xf = xf;\n    this.n = n;\n  }\n  XDrop.prototype['@@transducer/init'] = _xfBase.init;\n  XDrop.prototype['@@transducer/result'] = _xfBase.result;\n  XDrop.prototype['@@transducer/step'] = function (result, input) {\n    if (this.n > 0) {\n      this.n -= 1;\n      return result;\n    }\n    return this.xf['@@transducer/step'](result, input);\n  };\n\n  return XDrop;\n}();\n\nvar _xdrop = /*#__PURE__*/_curry2(function _xdrop(n, xf) {\n  return new XDrop(n, xf);\n});\nexport default _xdrop;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xdrop from './internal/_xdrop';\nimport slice from './slice';\n\n/**\n * Returns all but the first `n` elements of the given list, string, or\n * transducer/transformer (or object with a `drop` method).\n *\n * Dispatches to the `drop` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n\n * @param {*} list\n * @return {*} A copy of list without the first `n` elements\n * @see R.take, R.transduce, R.dropLast, R.dropWhile\n * @example\n *\n *      R.drop(1, ['foo', 'bar', 'baz']); //=> ['bar', 'baz']\n *      R.drop(2, ['foo', 'bar', 'baz']); //=> ['baz']\n *      R.drop(3, ['foo', 'bar', 'baz']); //=> []\n *      R.drop(4, ['foo', 'bar', 'baz']); //=> []\n *      R.drop(3, 'ramda');               //=> 'da'\n */\nvar drop = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['drop'], _xdrop, function drop(n, xs) {\n  return slice(Math.max(0, n), Infinity, xs);\n}));\nexport default drop;","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XTake = /*#__PURE__*/function () {\n  function XTake(n, xf) {\n    this.xf = xf;\n    this.n = n;\n    this.i = 0;\n  }\n  XTake.prototype['@@transducer/init'] = _xfBase.init;\n  XTake.prototype['@@transducer/result'] = _xfBase.result;\n  XTake.prototype['@@transducer/step'] = function (result, input) {\n    this.i += 1;\n    var ret = this.n === 0 ? result : this.xf['@@transducer/step'](result, input);\n    return this.n >= 0 && this.i >= this.n ? _reduced(ret) : ret;\n  };\n\n  return XTake;\n}();\n\nvar _xtake = /*#__PURE__*/_curry2(function _xtake(n, xf) {\n  return new XTake(n, xf);\n});\nexport default _xtake;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xtake from './internal/_xtake';\nimport slice from './slice';\n\n/**\n * Returns the first `n` elements of the given list, string, or\n * transducer/transformer (or object with a `take` method).\n *\n * Dispatches to the `take` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n\n * @param {*} list\n * @return {*}\n * @see R.drop\n * @example\n *\n *      R.take(1, ['foo', 'bar', 'baz']); //=> ['foo']\n *      R.take(2, ['foo', 'bar', 'baz']); //=> ['foo', 'bar']\n *      R.take(3, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n *      R.take(4, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n *      R.take(3, 'ramda');               //=> 'ram'\n *\n *      var personnel = [\n *        'Dave Brubeck',\n *        'Paul Desmond',\n *        'Eugene Wright',\n *        'Joe Morello',\n *        'Gerry Mulligan',\n *        'Bob Bates',\n *        'Joe Dodge',\n *        'Ron Crotty'\n *      ];\n *\n *      var takeFive = R.take(5);\n *      takeFive(personnel);\n *      //=> ['Dave Brubeck', 'Paul Desmond', 'Eugene Wright', 'Joe Morello', 'Gerry Mulligan']\n * @symb R.take(-1, [a, b]) = [a, b]\n * @symb R.take(0, [a, b]) = []\n * @symb R.take(1, [a, b]) = [a]\n * @symb R.take(2, [a, b]) = [a, b]\n */\nvar take = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['take'], _xtake, function take(n, xs) {\n  return slice(0, n < 0 ? Infinity : n, xs);\n}));\nexport default take;","import take from '../take';\n\nexport default function dropLast(n, xs) {\n  return take(n < xs.length ? xs.length - n : 0, xs);\n}","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XDropLast = /*#__PURE__*/function () {\n  function XDropLast(n, xf) {\n    this.xf = xf;\n    this.pos = 0;\n    this.full = false;\n    this.acc = new Array(n);\n  }\n  XDropLast.prototype['@@transducer/init'] = _xfBase.init;\n  XDropLast.prototype['@@transducer/result'] = function (result) {\n    this.acc = null;\n    return this.xf['@@transducer/result'](result);\n  };\n  XDropLast.prototype['@@transducer/step'] = function (result, input) {\n    if (this.full) {\n      result = this.xf['@@transducer/step'](result, this.acc[this.pos]);\n    }\n    this.store(input);\n    return result;\n  };\n  XDropLast.prototype.store = function (input) {\n    this.acc[this.pos] = input;\n    this.pos += 1;\n    if (this.pos === this.acc.length) {\n      this.pos = 0;\n      this.full = true;\n    }\n  };\n\n  return XDropLast;\n}();\n\nvar _xdropLast = /*#__PURE__*/_curry2(function _xdropLast(n, xf) {\n  return new XDropLast(n, xf);\n});\nexport default _xdropLast;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _dropLast from './internal/_dropLast';\nimport _xdropLast from './internal/_xdropLast';\n\n/**\n * Returns a list containing all but the last `n` elements of the given `list`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n The number of elements of `list` to skip.\n * @param {Array} list The list of elements to consider.\n * @return {Array} A copy of the list with only the first `list.length - n` elements\n * @see R.takeLast, R.drop, R.dropWhile, R.dropLastWhile\n * @example\n *\n *      R.dropLast(1, ['foo', 'bar', 'baz']); //=> ['foo', 'bar']\n *      R.dropLast(2, ['foo', 'bar', 'baz']); //=> ['foo']\n *      R.dropLast(3, ['foo', 'bar', 'baz']); //=> []\n *      R.dropLast(4, ['foo', 'bar', 'baz']); //=> []\n *      R.dropLast(3, 'ramda');               //=> 'ra'\n */\nvar dropLast = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xdropLast, _dropLast));\nexport default dropLast;","import slice from '../slice';\n\nexport default function dropLastWhile(pred, xs) {\n  var idx = xs.length - 1;\n  while (idx >= 0 && pred(xs[idx])) {\n    idx -= 1;\n  }\n  return slice(0, idx + 1, xs);\n}","import _curry2 from './_curry2';\nimport _reduce from './_reduce';\nimport _xfBase from './_xfBase';\n\nvar XDropLastWhile = /*#__PURE__*/function () {\n  function XDropLastWhile(fn, xf) {\n    this.f = fn;\n    this.retained = [];\n    this.xf = xf;\n  }\n  XDropLastWhile.prototype['@@transducer/init'] = _xfBase.init;\n  XDropLastWhile.prototype['@@transducer/result'] = function (result) {\n    this.retained = null;\n    return this.xf['@@transducer/result'](result);\n  };\n  XDropLastWhile.prototype['@@transducer/step'] = function (result, input) {\n    return this.f(input) ? this.retain(result, input) : this.flush(result, input);\n  };\n  XDropLastWhile.prototype.flush = function (result, input) {\n    result = _reduce(this.xf['@@transducer/step'], result, this.retained);\n    this.retained = [];\n    return this.xf['@@transducer/step'](result, input);\n  };\n  XDropLastWhile.prototype.retain = function (result, input) {\n    this.retained.push(input);\n    return result;\n  };\n\n  return XDropLastWhile;\n}();\n\nvar _xdropLastWhile = /*#__PURE__*/_curry2(function _xdropLastWhile(fn, xf) {\n  return new XDropLastWhile(fn, xf);\n});\nexport default _xdropLastWhile;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _dropLastWhile from './internal/_dropLastWhile';\nimport _xdropLastWhile from './internal/_xdropLastWhile';\n\n/**\n * Returns a new list excluding all the tailing elements of a given list which\n * satisfy the supplied predicate function. It passes each value from the right\n * to the supplied predicate function, skipping elements until the predicate\n * function returns a `falsy` value. The predicate function is applied to one argument:\n * *(value)*.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @sig (a -> Boolean) -> String -> String\n * @param {Function} predicate The function to be called on each element\n * @param {Array} xs The collection to iterate over.\n * @return {Array} A new array without any trailing elements that return `falsy` values from the `predicate`.\n * @see R.takeLastWhile, R.addIndex, R.drop, R.dropWhile\n * @example\n *\n *      var lteThree = x => x <= 3;\n *\n *      R.dropLastWhile(lteThree, [1, 2, 3, 4, 3, 2, 1]); //=> [1, 2, 3, 4]\n *\n *      R.dropLastWhile(x => x !== 'd' , 'Ramda'); //=> 'Ramd'\n */\nvar dropLastWhile = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xdropLastWhile, _dropLastWhile));\nexport default dropLastWhile;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XDropRepeatsWith = /*#__PURE__*/function () {\n  function XDropRepeatsWith(pred, xf) {\n    this.xf = xf;\n    this.pred = pred;\n    this.lastValue = undefined;\n    this.seenFirstValue = false;\n  }\n\n  XDropRepeatsWith.prototype['@@transducer/init'] = _xfBase.init;\n  XDropRepeatsWith.prototype['@@transducer/result'] = _xfBase.result;\n  XDropRepeatsWith.prototype['@@transducer/step'] = function (result, input) {\n    var sameAsLast = false;\n    if (!this.seenFirstValue) {\n      this.seenFirstValue = true;\n    } else if (this.pred(this.lastValue, input)) {\n      sameAsLast = true;\n    }\n    this.lastValue = input;\n    return sameAsLast ? result : this.xf['@@transducer/step'](result, input);\n  };\n\n  return XDropRepeatsWith;\n}();\n\nvar _xdropRepeatsWith = /*#__PURE__*/_curry2(function _xdropRepeatsWith(pred, xf) {\n  return new XDropRepeatsWith(pred, xf);\n});\nexport default _xdropRepeatsWith;","import _curry2 from './internal/_curry2';\nimport _isString from './internal/_isString';\n\n/**\n * Returns the nth element of the given list or string. If n is negative the\n * element at index length + n is returned.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> a | Undefined\n * @sig Number -> String -> String\n * @param {Number} offset\n * @param {*} list\n * @return {*}\n * @example\n *\n *      var list = ['foo', 'bar', 'baz', 'quux'];\n *      R.nth(1, list); //=> 'bar'\n *      R.nth(-1, list); //=> 'quux'\n *      R.nth(-99, list); //=> undefined\n *\n *      R.nth(2, 'abc'); //=> 'c'\n *      R.nth(3, 'abc'); //=> ''\n * @symb R.nth(-1, [a, b, c]) = c\n * @symb R.nth(0, [a, b, c]) = a\n * @symb R.nth(1, [a, b, c]) = b\n */\nvar nth = /*#__PURE__*/_curry2(function nth(offset, list) {\n  var idx = offset < 0 ? list.length + offset : offset;\n  return _isString(list) ? list.charAt(idx) : list[idx];\n});\nexport default nth;","import nth from './nth';\n\n/**\n * Returns the last element of the given list or string.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig [a] -> a | Undefined\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.init, R.head, R.tail\n * @example\n *\n *      R.last(['fi', 'fo', 'fum']); //=> 'fum'\n *      R.last([]); //=> undefined\n *\n *      R.last('abc'); //=> 'c'\n *      R.last(''); //=> ''\n */\nvar last = /*#__PURE__*/nth(-1);\nexport default last;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xdropRepeatsWith from './internal/_xdropRepeatsWith';\nimport last from './last';\n\n/**\n * Returns a new list without any consecutively repeating elements. Equality is\n * determined by applying the supplied predicate to each pair of consecutive elements. The\n * first element in a series of equal elements will be preserved.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig ((a, a) -> Boolean) -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list The array to consider.\n * @return {Array} `list` without repeating elements.\n * @see R.transduce\n * @example\n *\n *      var l = [1, -1, 1, 3, 4, -4, -4, -5, 5, 3, 3];\n *      R.dropRepeatsWith(R.eqBy(Math.abs), l); //=> [1, 3, 4, -5, 3]\n */\nvar dropRepeatsWith = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xdropRepeatsWith, function dropRepeatsWith(pred, list) {\n  var result = [];\n  var idx = 1;\n  var len = list.length;\n  if (len !== 0) {\n    result[0] = list[0];\n    while (idx < len) {\n      if (!pred(last(result), list[idx])) {\n        result[result.length] = list[idx];\n      }\n      idx += 1;\n    }\n  }\n  return result;\n}));\nexport default dropRepeatsWith;","import _curry1 from './internal/_curry1';\nimport _dispatchable from './internal/_dispatchable';\nimport _xdropRepeatsWith from './internal/_xdropRepeatsWith';\nimport dropRepeatsWith from './dropRepeatsWith';\nimport equals from './equals';\n\n/**\n * Returns a new list without any consecutively repeating elements.\n * [`R.equals`](#equals) is used to determine equality.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig [a] -> [a]\n * @param {Array} list The array to consider.\n * @return {Array} `list` without repeating elements.\n * @see R.transduce\n * @example\n *\n *     R.dropRepeats([1, 1, 1, 2, 3, 4, 4, 2, 2]); //=> [1, 2, 3, 4, 2]\n */\nvar dropRepeats = /*#__PURE__*/_curry1( /*#__PURE__*/_dispatchable([], /*#__PURE__*/_xdropRepeatsWith(equals), /*#__PURE__*/dropRepeatsWith(equals)));\nexport default dropRepeats;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XDropWhile = /*#__PURE__*/function () {\n  function XDropWhile(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XDropWhile.prototype['@@transducer/init'] = _xfBase.init;\n  XDropWhile.prototype['@@transducer/result'] = _xfBase.result;\n  XDropWhile.prototype['@@transducer/step'] = function (result, input) {\n    if (this.f) {\n      if (this.f(input)) {\n        return result;\n      }\n      this.f = null;\n    }\n    return this.xf['@@transducer/step'](result, input);\n  };\n\n  return XDropWhile;\n}();\n\nvar _xdropWhile = /*#__PURE__*/_curry2(function _xdropWhile(f, xf) {\n  return new XDropWhile(f, xf);\n});\nexport default _xdropWhile;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xdropWhile from './internal/_xdropWhile';\nimport slice from './slice';\n\n/**\n * Returns a new list excluding the leading elements of a given list which\n * satisfy the supplied predicate function. It passes each value to the supplied\n * predicate function, skipping elements while the predicate function returns\n * `true`. The predicate function is applied to one argument: *(value)*.\n *\n * Dispatches to the `dropWhile` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @sig (a -> Boolean) -> String -> String\n * @param {Function} fn The function called per iteration.\n * @param {Array} xs The collection to iterate over.\n * @return {Array} A new array.\n * @see R.takeWhile, R.transduce, R.addIndex\n * @example\n *\n *      var lteTwo = x => x <= 2;\n *\n *      R.dropWhile(lteTwo, [1, 2, 3, 4, 3, 2, 1]); //=> [3, 4, 3, 2, 1]\n *\n *      R.dropWhile(x => x !== 'd' , 'Ramda'); //=> 'da'\n */\nvar dropWhile = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['dropWhile'], _xdropWhile, function dropWhile(pred, xs) {\n  var idx = 0;\n  var len = xs.length;\n  while (idx < len && pred(xs[idx])) {\n    idx += 1;\n  }\n  return slice(idx, Infinity, xs);\n}));\nexport default dropWhile;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if one or both of its arguments are `true`. Returns `false`\n * if both arguments are `false`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig a -> b -> a | b\n * @param {Any} a\n * @param {Any} b\n * @return {Any} the first argument if truthy, otherwise the second argument.\n * @see R.either\n * @example\n *\n *      R.or(true, true); //=> true\n *      R.or(true, false); //=> true\n *      R.or(false, true); //=> true\n *      R.or(false, false); //=> false\n */\nvar or = /*#__PURE__*/_curry2(function or(a, b) {\n  return a || b;\n});\nexport default or;","import _curry2 from './internal/_curry2';\nimport _isFunction from './internal/_isFunction';\nimport lift from './lift';\nimport or from './or';\n\n/**\n * A function wrapping calls to the two functions in an `||` operation,\n * returning the result of the first function if it is truth-y and the result\n * of the second function otherwise. Note that this is short-circuited,\n * meaning that the second function will not be invoked if the first returns a\n * truth-y value.\n *\n * In addition to functions, `R.either` also accepts any fantasy-land compatible\n * applicative functor.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> Boolean) -> (*... -> Boolean)\n * @param {Function} f a predicate\n * @param {Function} g another predicate\n * @return {Function} a function that applies its arguments to `f` and `g` and `||`s their outputs together.\n * @see R.or\n * @example\n *\n *      var gt10 = x => x > 10;\n *      var even = x => x % 2 === 0;\n *      var f = R.either(gt10, even);\n *      f(101); //=> true\n *      f(8); //=> true\n */\nvar either = /*#__PURE__*/_curry2(function either(f, g) {\n  return _isFunction(f) ? function _either() {\n    return f.apply(this, arguments) || g.apply(this, arguments);\n  } : lift(or)(f, g);\n});\nexport default either;","import _curry1 from './internal/_curry1';\nimport _isArguments from './internal/_isArguments';\nimport _isArray from './internal/_isArray';\nimport _isObject from './internal/_isObject';\nimport _isString from './internal/_isString';\n\n/**\n * Returns the empty value of its argument's type. Ramda defines the empty\n * value of Array (`[]`), Object (`{}`), String (`''`), and Arguments. Other\n * types are supported if they define `<Type>.empty`,\n * `<Type>.prototype.empty` or implement the\n * [FantasyLand Monoid spec](https://github.com/fantasyland/fantasy-land#monoid).\n *\n * Dispatches to the `empty` method of the first argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig a -> a\n * @param {*} x\n * @return {*}\n * @example\n *\n *      R.empty(Just(42));      //=> Nothing()\n *      R.empty([1, 2, 3]);     //=> []\n *      R.empty('unicorns');    //=> ''\n *      R.empty({x: 1, y: 2});  //=> {}\n */\nvar empty = /*#__PURE__*/_curry1(function empty(x) {\n  return x != null && typeof x['fantasy-land/empty'] === 'function' ? x['fantasy-land/empty']() : x != null && x.constructor != null && typeof x.constructor['fantasy-land/empty'] === 'function' ? x.constructor['fantasy-land/empty']() : x != null && typeof x.empty === 'function' ? x.empty() : x != null && x.constructor != null && typeof x.constructor.empty === 'function' ? x.constructor.empty() : _isArray(x) ? [] : _isString(x) ? '' : _isObject(x) ? {} : _isArguments(x) ? function () {\n    return arguments;\n  }() :\n  // else\n  void 0;\n});\nexport default empty;","import _curry2 from './internal/_curry2';\nimport drop from './drop';\n\n/**\n * Returns a new list containing the last `n` elements of the given list.\n * If `n > list.length`, returns a list of `list.length` elements.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n The number of elements to return.\n * @param {Array} xs The collection to consider.\n * @return {Array}\n * @see R.dropLast\n * @example\n *\n *      R.takeLast(1, ['foo', 'bar', 'baz']); //=> ['baz']\n *      R.takeLast(2, ['foo', 'bar', 'baz']); //=> ['bar', 'baz']\n *      R.takeLast(3, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n *      R.takeLast(4, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n *      R.takeLast(3, 'ramda');               //=> 'mda'\n */\nvar takeLast = /*#__PURE__*/_curry2(function takeLast(n, xs) {\n  return drop(n >= 0 ? xs.length - n : 0, xs);\n});\nexport default takeLast;","import _curry2 from './internal/_curry2';\nimport equals from './equals';\nimport takeLast from './takeLast';\n\n/**\n * Checks if a list ends with the provided values\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category List\n * @sig [a] -> Boolean\n * @sig String -> Boolean\n * @param {*} suffix\n * @param {*} list\n * @return {Boolean}\n * @example\n *\n *      R.endsWith('c', 'abc')                //=> true\n *      R.endsWith('b', 'abc')                //=> false\n *      R.endsWith(['c'], ['a', 'b', 'c'])    //=> true\n *      R.endsWith(['b'], ['a', 'b', 'c'])    //=> false\n */\nvar endsWith = /*#__PURE__*/_curry2(function (suffix, list) {\n  return equals(takeLast(suffix.length, list), suffix);\n});\nexport default endsWith;","import _curry3 from './internal/_curry3';\nimport equals from './equals';\n\n/**\n * Takes a function and two values in its domain and returns `true` if the\n * values map to the same value in the codomain; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Relation\n * @sig (a -> b) -> a -> a -> Boolean\n * @param {Function} f\n * @param {*} x\n * @param {*} y\n * @return {Boolean}\n * @example\n *\n *      R.eqBy(Math.abs, 5, -5); //=> true\n */\nvar eqBy = /*#__PURE__*/_curry3(function eqBy(f, x, y) {\n  return equals(f(x), f(y));\n});\nexport default eqBy;","import _curry3 from './internal/_curry3';\nimport equals from './equals';\n\n/**\n * Reports whether two objects have the same value, in [`R.equals`](#equals)\n * terms, for the specified property. Useful as a curried predicate.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig k -> {k: v} -> {k: v} -> Boolean\n * @param {String} prop The name of the property to compare\n * @param {Object} obj1\n * @param {Object} obj2\n * @return {Boolean}\n *\n * @example\n *\n *      var o1 = { a: 1, b: 2, c: 3, d: 4 };\n *      var o2 = { a: 10, b: 20, c: 3, d: 40 };\n *      R.eqProps('a', o1, o2); //=> false\n *      R.eqProps('c', o1, o2); //=> true\n */\nvar eqProps = /*#__PURE__*/_curry3(function eqProps(prop, obj1, obj2) {\n  return equals(obj1[prop], obj2[prop]);\n});\nexport default eqProps;","import _curry2 from './internal/_curry2';\n\n/**\n * Creates a new object by recursively evolving a shallow copy of `object`,\n * according to the `transformation` functions. All non-primitive properties\n * are copied by reference.\n *\n * A `transformation` function will not be invoked if its corresponding key\n * does not exist in the evolved object.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {k: (v -> v)} -> {k: v} -> {k: v}\n * @param {Object} transformations The object specifying transformation functions to apply\n *        to the object.\n * @param {Object} object The object to be transformed.\n * @return {Object} The transformed object.\n * @example\n *\n *      var tomato  = {firstName: '  Tomato ', data: {elapsed: 100, remaining: 1400}, id:123};\n *      var transformations = {\n *        firstName: R.trim,\n *        lastName: R.trim, // Will not get invoked.\n *        data: {elapsed: R.add(1), remaining: R.add(-1)}\n *      };\n *      R.evolve(transformations, tomato); //=> {firstName: 'Tomato', data: {elapsed: 101, remaining: 1399}, id:123}\n */\nvar evolve = /*#__PURE__*/_curry2(function evolve(transformations, object) {\n  var result = {};\n  var transformation, key, type;\n  for (key in object) {\n    transformation = transformations[key];\n    type = typeof transformation;\n    result[key] = type === 'function' ? transformation(object[key]) : transformation && type === 'object' ? evolve(transformation, object[key]) : object[key];\n  }\n  return result;\n});\nexport default evolve;","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XFind = /*#__PURE__*/function () {\n  function XFind(f, xf) {\n    this.xf = xf;\n    this.f = f;\n    this.found = false;\n  }\n  XFind.prototype['@@transducer/init'] = _xfBase.init;\n  XFind.prototype['@@transducer/result'] = function (result) {\n    if (!this.found) {\n      result = this.xf['@@transducer/step'](result, void 0);\n    }\n    return this.xf['@@transducer/result'](result);\n  };\n  XFind.prototype['@@transducer/step'] = function (result, input) {\n    if (this.f(input)) {\n      this.found = true;\n      result = _reduced(this.xf['@@transducer/step'](result, input));\n    }\n    return result;\n  };\n\n  return XFind;\n}();\n\nvar _xfind = /*#__PURE__*/_curry2(function _xfind(f, xf) {\n  return new XFind(f, xf);\n});\nexport default _xfind;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xfind from './internal/_xfind';\n\n/**\n * Returns the first element of the list which matches the predicate, or\n * `undefined` if no element matches.\n *\n * Dispatches to the `find` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> a | undefined\n * @param {Function} fn The predicate function used to determine if the element is the\n *        desired one.\n * @param {Array} list The array to consider.\n * @return {Object} The element found, or `undefined`.\n * @see R.transduce\n * @example\n *\n *      var xs = [{a: 1}, {a: 2}, {a: 3}];\n *      R.find(R.propEq('a', 2))(xs); //=> {a: 2}\n *      R.find(R.propEq('a', 4))(xs); //=> undefined\n */\nvar find = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['find'], _xfind, function find(fn, list) {\n  var idx = 0;\n  var len = list.length;\n  while (idx < len) {\n    if (fn(list[idx])) {\n      return list[idx];\n    }\n    idx += 1;\n  }\n}));\nexport default find;","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XFindIndex = /*#__PURE__*/function () {\n  function XFindIndex(f, xf) {\n    this.xf = xf;\n    this.f = f;\n    this.idx = -1;\n    this.found = false;\n  }\n  XFindIndex.prototype['@@transducer/init'] = _xfBase.init;\n  XFindIndex.prototype['@@transducer/result'] = function (result) {\n    if (!this.found) {\n      result = this.xf['@@transducer/step'](result, -1);\n    }\n    return this.xf['@@transducer/result'](result);\n  };\n  XFindIndex.prototype['@@transducer/step'] = function (result, input) {\n    this.idx += 1;\n    if (this.f(input)) {\n      this.found = true;\n      result = _reduced(this.xf['@@transducer/step'](result, this.idx));\n    }\n    return result;\n  };\n\n  return XFindIndex;\n}();\n\nvar _xfindIndex = /*#__PURE__*/_curry2(function _xfindIndex(f, xf) {\n  return new XFindIndex(f, xf);\n});\nexport default _xfindIndex;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xfindIndex from './internal/_xfindIndex';\n\n/**\n * Returns the index of the first element of the list which matches the\n * predicate, or `-1` if no element matches.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> Number\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Number} The index of the element found, or `-1`.\n * @see R.transduce\n * @example\n *\n *      var xs = [{a: 1}, {a: 2}, {a: 3}];\n *      R.findIndex(R.propEq('a', 2))(xs); //=> 1\n *      R.findIndex(R.propEq('a', 4))(xs); //=> -1\n */\nvar findIndex = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xfindIndex, function findIndex(fn, list) {\n  var idx = 0;\n  var len = list.length;\n  while (idx < len) {\n    if (fn(list[idx])) {\n      return idx;\n    }\n    idx += 1;\n  }\n  return -1;\n}));\nexport default findIndex;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XFindLast = /*#__PURE__*/function () {\n  function XFindLast(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XFindLast.prototype['@@transducer/init'] = _xfBase.init;\n  XFindLast.prototype['@@transducer/result'] = function (result) {\n    return this.xf['@@transducer/result'](this.xf['@@transducer/step'](result, this.last));\n  };\n  XFindLast.prototype['@@transducer/step'] = function (result, input) {\n    if (this.f(input)) {\n      this.last = input;\n    }\n    return result;\n  };\n\n  return XFindLast;\n}();\n\nvar _xfindLast = /*#__PURE__*/_curry2(function _xfindLast(f, xf) {\n  return new XFindLast(f, xf);\n});\nexport default _xfindLast;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xfindLast from './internal/_xfindLast';\n\n/**\n * Returns the last element of the list which matches the predicate, or\n * `undefined` if no element matches.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> a | undefined\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Object} The element found, or `undefined`.\n * @see R.transduce\n * @example\n *\n *      var xs = [{a: 1, b: 0}, {a:1, b: 1}];\n *      R.findLast(R.propEq('a', 1))(xs); //=> {a: 1, b: 1}\n *      R.findLast(R.propEq('a', 4))(xs); //=> undefined\n */\nvar findLast = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xfindLast, function findLast(fn, list) {\n  var idx = list.length - 1;\n  while (idx >= 0) {\n    if (fn(list[idx])) {\n      return list[idx];\n    }\n    idx -= 1;\n  }\n}));\nexport default findLast;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XFindLastIndex = /*#__PURE__*/function () {\n  function XFindLastIndex(f, xf) {\n    this.xf = xf;\n    this.f = f;\n    this.idx = -1;\n    this.lastIdx = -1;\n  }\n  XFindLastIndex.prototype['@@transducer/init'] = _xfBase.init;\n  XFindLastIndex.prototype['@@transducer/result'] = function (result) {\n    return this.xf['@@transducer/result'](this.xf['@@transducer/step'](result, this.lastIdx));\n  };\n  XFindLastIndex.prototype['@@transducer/step'] = function (result, input) {\n    this.idx += 1;\n    if (this.f(input)) {\n      this.lastIdx = this.idx;\n    }\n    return result;\n  };\n\n  return XFindLastIndex;\n}();\n\nvar _xfindLastIndex = /*#__PURE__*/_curry2(function _xfindLastIndex(f, xf) {\n  return new XFindLastIndex(f, xf);\n});\nexport default _xfindLastIndex;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xfindLastIndex from './internal/_xfindLastIndex';\n\n/**\n * Returns the index of the last element of the list which matches the\n * predicate, or `-1` if no element matches.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> Number\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Number} The index of the element found, or `-1`.\n * @see R.transduce\n * @example\n *\n *      var xs = [{a: 1, b: 0}, {a:1, b: 1}];\n *      R.findLastIndex(R.propEq('a', 1))(xs); //=> 1\n *      R.findLastIndex(R.propEq('a', 4))(xs); //=> -1\n */\nvar findLastIndex = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xfindLastIndex, function findLastIndex(fn, list) {\n  var idx = list.length - 1;\n  while (idx >= 0) {\n    if (fn(list[idx])) {\n      return idx;\n    }\n    idx -= 1;\n  }\n  return -1;\n}));\nexport default findLastIndex;","import _curry1 from './internal/_curry1';\nimport _makeFlat from './internal/_makeFlat';\n\n/**\n * Returns a new list by pulling every item out of it (and all its sub-arrays)\n * and putting them in a new array, depth-first.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b]\n * @param {Array} list The array to consider.\n * @return {Array} The flattened list.\n * @see R.unnest\n * @example\n *\n *      R.flatten([1, 2, [3, 4], 5, [6, [7, 8, [9, [10, 11], 12]]]]);\n *      //=> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]\n */\nvar flatten = /*#__PURE__*/_curry1( /*#__PURE__*/_makeFlat(true));\nexport default flatten;","import _curry1 from './internal/_curry1';\nimport curryN from './curryN';\n\n/**\n * Returns a new function much like the supplied one, except that the first two\n * arguments' order is reversed.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig ((a, b, c, ...) -> z) -> (b -> a -> c -> ... -> z)\n * @param {Function} fn The function to invoke with its first two parameters reversed.\n * @return {*} The result of invoking `fn` with its first two parameters' order reversed.\n * @example\n *\n *      var mergeThree = (a, b, c) => [].concat(a, b, c);\n *\n *      mergeThree(1, 2, 3); //=> [1, 2, 3]\n *\n *      R.flip(mergeThree)(1, 2, 3); //=> [2, 1, 3]\n * @symb R.flip(f)(a, b, c) = f(b, a, c)\n */\nvar flip = /*#__PURE__*/_curry1(function flip(fn) {\n  return curryN(fn.length, function (a, b) {\n    var args = Array.prototype.slice.call(arguments, 0);\n    args[0] = b;\n    args[1] = a;\n    return fn.apply(this, args);\n  });\n});\nexport default flip;","import _checkForMethod from './internal/_checkForMethod';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Iterate over an input `list`, calling a provided function `fn` for each\n * element in the list.\n *\n * `fn` receives one argument: *(value)*.\n *\n * Note: `R.forEach` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.forEach` method. For more\n * details on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/forEach#Description\n *\n * Also note that, unlike `Array.prototype.forEach`, Ramda's `forEach` returns\n * the original array. In some libraries this function is named `each`.\n *\n * Dispatches to the `forEach` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> *) -> [a] -> [a]\n * @param {Function} fn The function to invoke. Receives one argument, `value`.\n * @param {Array} list The list to iterate over.\n * @return {Array} The original list.\n * @see R.addIndex\n * @example\n *\n *      var printXPlusFive = x => console.log(x + 5);\n *      R.forEach(printXPlusFive, [1, 2, 3]); //=> [1, 2, 3]\n *      // logs 6\n *      // logs 7\n *      // logs 8\n * @symb R.forEach(f, [a, b, c]) = [a, b, c]\n */\nvar forEach = /*#__PURE__*/_curry2( /*#__PURE__*/_checkForMethod('forEach', function forEach(fn, list) {\n  var len = list.length;\n  var idx = 0;\n  while (idx < len) {\n    fn(list[idx]);\n    idx += 1;\n  }\n  return list;\n}));\nexport default forEach;","import _curry2 from './internal/_curry2';\nimport keys from './keys';\n\n/**\n * Iterate over an input `object`, calling a provided function `fn` for each\n * key and value in the object.\n *\n * `fn` receives three argument: *(value, key, obj)*.\n *\n * @func\n * @memberOf R\n * @since v0.23.0\n * @category Object\n * @sig ((a, String, StrMap a) -> Any) -> StrMap a -> StrMap a\n * @param {Function} fn The function to invoke. Receives three argument, `value`, `key`, `obj`.\n * @param {Object} obj The object to iterate over.\n * @return {Object} The original object.\n * @example\n *\n *      var printKeyConcatValue = (value, key) => console.log(key + ':' + value);\n *      R.forEachObjIndexed(printKeyConcatValue, {x: 1, y: 2}); //=> {x: 1, y: 2}\n *      // logs x:1\n *      // logs y:2\n * @symb R.forEachObjIndexed(f, {x: a, y: b}) = {x: a, y: b}\n */\nvar forEachObjIndexed = /*#__PURE__*/_curry2(function forEachObjIndexed(fn, obj) {\n  var keyList = keys(obj);\n  var idx = 0;\n  while (idx < keyList.length) {\n    var key = keyList[idx];\n    fn(obj[key], key, obj);\n    idx += 1;\n  }\n  return obj;\n});\nexport default forEachObjIndexed;","import _curry1 from './internal/_curry1';\n\n/**\n * Creates a new object from a list key-value pairs. If a key appears in\n * multiple pairs, the rightmost pair is included in the object.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [[k,v]] -> {k: v}\n * @param {Array} pairs An array of two-element arrays that will be the keys and values of the output object.\n * @return {Object} The object made by pairing up `keys` and `values`.\n * @see R.toPairs, R.pair\n * @example\n *\n *      R.fromPairs([['a', 1], ['b', 2], ['c', 3]]); //=> {a: 1, b: 2, c: 3}\n */\nvar fromPairs = /*#__PURE__*/_curry1(function fromPairs(pairs) {\n  var result = {};\n  var idx = 0;\n  while (idx < pairs.length) {\n    result[pairs[idx][0]] = pairs[idx][1];\n    idx += 1;\n  }\n  return result;\n});\nexport default fromPairs;","import _checkForMethod from './internal/_checkForMethod';\nimport _curry2 from './internal/_curry2';\nimport reduceBy from './reduceBy';\n\n/**\n * Splits a list into sub-lists stored in an object, based on the result of\n * calling a String-returning function on each element, and grouping the\n * results according to values returned.\n *\n * Dispatches to the `groupBy` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> String) -> [a] -> {String: [a]}\n * @param {Function} fn Function :: a -> String\n * @param {Array} list The array to group\n * @return {Object} An object with the output of `fn` for keys, mapped to arrays of elements\n *         that produced that key when passed to `fn`.\n * @see R.transduce\n * @example\n *\n *      var byGrade = R.groupBy(function(student) {\n *        var score = student.score;\n *        return score < 65 ? 'F' :\n *               score < 70 ? 'D' :\n *               score < 80 ? 'C' :\n *               score < 90 ? 'B' : 'A';\n *      });\n *      var students = [{name: 'Abby', score: 84},\n *                      {name: 'Eddy', score: 58},\n *                      // ...\n *                      {name: 'Jack', score: 69}];\n *      byGrade(students);\n *      // {\n *      //   'A': [{name: 'Dianne', score: 99}],\n *      //   'B': [{name: 'Abby', score: 84}]\n *      //   // ...,\n *      //   'F': [{name: 'Eddy', score: 58}]\n *      // }\n */\nvar groupBy = /*#__PURE__*/_curry2( /*#__PURE__*/_checkForMethod('groupBy', /*#__PURE__*/reduceBy(function (acc, item) {\n  if (acc == null) {\n    acc = [];\n  }\n  acc.push(item);\n  return acc;\n}, null)));\nexport default groupBy;","import _curry2 from './internal/_curry2';\n\n/**\n * Takes a list and returns a list of lists where each sublist's elements are\n * all satisfied pairwise comparison according to the provided function.\n * Only adjacent elements are passed to the comparison function.\n *\n * @func\n * @memberOf R\n * @since v0.21.0\n * @category List\n * @sig ((a, a) → Boolean) → [a] → [[a]]\n * @param {Function} fn Function for determining whether two given (adjacent)\n *        elements should be in the same group\n * @param {Array} list The array to group. Also accepts a string, which will be\n *        treated as a list of characters.\n * @return {List} A list that contains sublists of elements,\n *         whose concatenations are equal to the original list.\n * @example\n *\n * R.groupWith(R.equals, [0, 1, 1, 2, 3, 5, 8, 13, 21])\n * //=> [[0], [1, 1], [2], [3], [5], [8], [13], [21]]\n *\n * R.groupWith((a, b) => a + 1 === b, [0, 1, 1, 2, 3, 5, 8, 13, 21])\n * //=> [[0, 1], [1, 2, 3], [5], [8], [13], [21]]\n *\n * R.groupWith((a, b) => a % 2 === b % 2, [0, 1, 1, 2, 3, 5, 8, 13, 21])\n * //=> [[0], [1, 1], [2], [3, 5], [8], [13, 21]]\n *\n * R.groupWith(R.eqBy(isVowel), 'aestiou')\n * //=> ['ae', 'st', 'iou']\n */\nvar groupWith = /*#__PURE__*/_curry2(function (fn, list) {\n  var res = [];\n  var idx = 0;\n  var len = list.length;\n  while (idx < len) {\n    var nextidx = idx + 1;\n    while (nextidx < len && fn(list[nextidx - 1], list[nextidx])) {\n      nextidx += 1;\n    }\n    res.push(list.slice(idx, nextidx));\n    idx = nextidx;\n  }\n  return res;\n});\nexport default groupWith;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if the first argument is greater than the second; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @see R.lt\n * @example\n *\n *      R.gt(2, 1); //=> true\n *      R.gt(2, 2); //=> false\n *      R.gt(2, 3); //=> false\n *      R.gt('a', 'z'); //=> false\n *      R.gt('z', 'a'); //=> true\n */\nvar gt = /*#__PURE__*/_curry2(function gt(a, b) {\n  return a > b;\n});\nexport default gt;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if the first argument is greater than or equal to the second;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {Number} a\n * @param {Number} b\n * @return {Boolean}\n * @see R.lte\n * @example\n *\n *      R.gte(2, 1); //=> true\n *      R.gte(2, 2); //=> true\n *      R.gte(2, 3); //=> false\n *      R.gte('a', 'z'); //=> false\n *      R.gte('z', 'a'); //=> true\n */\nvar gte = /*#__PURE__*/_curry2(function gte(a, b) {\n  return a >= b;\n});\nexport default gte;","import _curry2 from './internal/_curry2';\nimport _has from './internal/_has';\n\n/**\n * Returns whether or not an object has an own property with the specified name\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Object\n * @sig s -> {s: x} -> Boolean\n * @param {String} prop The name of the property to check for.\n * @param {Object} obj The object to query.\n * @return {Boolean} Whether the property exists.\n * @example\n *\n *      var hasName = R.has('name');\n *      hasName({name: 'alice'});   //=> true\n *      hasName({name: 'bob'});     //=> true\n *      hasName({});                //=> false\n *\n *      var point = {x: 0, y: 0};\n *      var pointHas = R.has(R.__, point);\n *      pointHas('x');  //=> true\n *      pointHas('y');  //=> true\n *      pointHas('z');  //=> false\n */\nvar has = /*#__PURE__*/_curry2(_has);\nexport default has;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns whether or not an object or its prototype chain has a property with\n * the specified name\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Object\n * @sig s -> {s: x} -> Boolean\n * @param {String} prop The name of the property to check for.\n * @param {Object} obj The object to query.\n * @return {Boolean} Whether the property exists.\n * @example\n *\n *      function Rectangle(width, height) {\n *        this.width = width;\n *        this.height = height;\n *      }\n *      Rectangle.prototype.area = function() {\n *        return this.width * this.height;\n *      };\n *\n *      var square = new Rectangle(2, 2);\n *      R.hasIn('width', square);  //=> true\n *      R.hasIn('area', square);  //=> true\n */\nvar hasIn = /*#__PURE__*/_curry2(function hasIn(prop, obj) {\n  return prop in obj;\n});\nexport default hasIn;","import nth from './nth';\n\n/**\n * Returns the first element of the given list or string. In some libraries\n * this function is named `first`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> a | Undefined\n * @sig String -> String\n * @param {Array|String} list\n * @return {*}\n * @see R.tail, R.init, R.last\n * @example\n *\n *      R.head(['fi', 'fo', 'fum']); //=> 'fi'\n *      R.head([]); //=> undefined\n *\n *      R.head('abc'); //=> 'a'\n *      R.head(''); //=> ''\n */\nvar head = /*#__PURE__*/nth(0);\nexport default head;","export default function _identity(x) {\n  return x;\n}","import _curry1 from './internal/_curry1';\nimport _identity from './internal/_identity';\n\n/**\n * A function that does nothing but return the parameter supplied to it. Good\n * as a default or placeholder function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig a -> a\n * @param {*} x The value to return.\n * @return {*} The input value, `x`.\n * @example\n *\n *      R.identity(1); //=> 1\n *\n *      var obj = {};\n *      R.identity(obj) === obj; //=> true\n * @symb R.identity(a) = a\n */\nvar identity = /*#__PURE__*/_curry1(_identity);\nexport default identity;","import _curry3 from './internal/_curry3';\nimport curryN from './curryN';\n\n/**\n * Creates a function that will process either the `onTrue` or the `onFalse`\n * function depending upon the result of the `condition` predicate.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> *) -> (*... -> *) -> (*... -> *)\n * @param {Function} condition A predicate function\n * @param {Function} onTrue A function to invoke when the `condition` evaluates to a truthy value.\n * @param {Function} onFalse A function to invoke when the `condition` evaluates to a falsy value.\n * @return {Function} A new unary function that will process either the `onTrue` or the `onFalse`\n *                    function depending upon the result of the `condition` predicate.\n * @see R.unless, R.when\n * @example\n *\n *      var incCount = R.ifElse(\n *        R.has('count'),\n *        R.over(R.lensProp('count'), R.inc),\n *        R.assoc('count', 1)\n *      );\n *      incCount({});           //=> { count: 1 }\n *      incCount({ count: 1 }); //=> { count: 2 }\n */\nvar ifElse = /*#__PURE__*/_curry3(function ifElse(condition, onTrue, onFalse) {\n  return curryN(Math.max(condition.length, onTrue.length, onFalse.length), function _ifElse() {\n    return condition.apply(this, arguments) ? onTrue.apply(this, arguments) : onFalse.apply(this, arguments);\n  });\n});\nexport default ifElse;","import add from './add';\n\n/**\n * Increments its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number} n + 1\n * @see R.dec\n * @example\n *\n *      R.inc(42); //=> 43\n */\nvar inc = /*#__PURE__*/add(1);\nexport default inc;","import reduceBy from './reduceBy';\n\n/**\n * Given a function that generates a key, turns a list of objects into an\n * object indexing the objects by the given key. Note that if multiple\n * objects generate the same value for the indexing key only the last value\n * will be included in the generated object.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (a -> String) -> [{k: v}] -> {k: {k: v}}\n * @param {Function} fn Function :: a -> String\n * @param {Array} array The array of objects to index\n * @return {Object} An object indexing each array element by the given property.\n * @example\n *\n *      var list = [{id: 'xyz', title: 'A'}, {id: 'abc', title: 'B'}];\n *      R.indexBy(R.prop('id'), list);\n *      //=> {abc: {id: 'abc', title: 'B'}, xyz: {id: 'xyz', title: 'A'}}\n */\nvar indexBy = /*#__PURE__*/reduceBy(function (acc, elem) {\n  return elem;\n}, null);\nexport default indexBy;","import _curry2 from './internal/_curry2';\nimport _indexOf from './internal/_indexOf';\nimport _isArray from './internal/_isArray';\n\n/**\n * Returns the position of the first occurrence of an item in an array, or -1\n * if the item is not included in the array. [`R.equals`](#equals) is used to\n * determine equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Number\n * @param {*} target The item to find.\n * @param {Array} xs The array to search in.\n * @return {Number} the index of the target, or -1 if the target is not found.\n * @see R.lastIndexOf\n * @example\n *\n *      R.indexOf(3, [1,2,3,4]); //=> 2\n *      R.indexOf(10, [1,2,3,4]); //=> -1\n */\nvar indexOf = /*#__PURE__*/_curry2(function indexOf(target, xs) {\n  return typeof xs.indexOf === 'function' && !_isArray(xs) ? xs.indexOf(target) : _indexOf(xs, target, 0);\n});\nexport default indexOf;","import slice from './slice';\n\n/**\n * Returns all but the last element of the given list or string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.last, R.head, R.tail\n * @example\n *\n *      R.init([1, 2, 3]);  //=> [1, 2]\n *      R.init([1, 2]);     //=> [1]\n *      R.init([1]);        //=> []\n *      R.init([]);         //=> []\n *\n *      R.init('abc');  //=> 'ab'\n *      R.init('ab');   //=> 'a'\n *      R.init('a');    //=> ''\n *      R.init('');     //=> ''\n */\nvar init = /*#__PURE__*/slice(0, -1);\nexport default init;","import _containsWith from './internal/_containsWith';\nimport _curry3 from './internal/_curry3';\nimport _filter from './internal/_filter';\n\n/**\n * Takes a predicate `pred`, a list `xs`, and a list `ys`, and returns a list\n * `xs'` comprising each of the elements of `xs` which is equal to one or more\n * elements of `ys` according to `pred`.\n *\n * `pred` must be a binary function expecting an element from each list.\n *\n * `xs`, `ys`, and `xs'` are treated as sets, semantically, so ordering should\n * not be significant, but since `xs'` is ordered the implementation guarantees\n * that its values are in the same order as they appear in `xs`. Duplicates are\n * not removed, so `xs'` may contain duplicates if `xs` contains duplicates.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Relation\n * @sig ((a, b) -> Boolean) -> [a] -> [b] -> [a]\n * @param {Function} pred\n * @param {Array} xs\n * @param {Array} ys\n * @return {Array}\n * @see R.intersection\n * @example\n *\n *      R.innerJoin(\n *        (record, id) => record.id === id,\n *        [{id: 824, name: 'Richie Furay'},\n *         {id: 956, name: 'Dewey Martin'},\n *         {id: 313, name: 'Bruce Palmer'},\n *         {id: 456, name: 'Stephen Stills'},\n *         {id: 177, name: 'Neil Young'}],\n *        [177, 456, 999]\n *      );\n *      //=> [{id: 456, name: 'Stephen Stills'}, {id: 177, name: 'Neil Young'}]\n */\nvar innerJoin = /*#__PURE__*/_curry3(function innerJoin(pred, xs, ys) {\n  return _filter(function (x) {\n    return _containsWith(pred, x, ys);\n  }, xs);\n});\nexport default innerJoin;","import _curry3 from './internal/_curry3';\n\n/**\n * Inserts the supplied element into the list, at the specified `index`. _Note that\n\n * this is not destructive_: it returns a copy of the list with the changes.\n * <small>No lists have been harmed in the application of this function.</small>\n *\n * @func\n * @memberOf R\n * @since v0.2.2\n * @category List\n * @sig Number -> a -> [a] -> [a]\n * @param {Number} index The position to insert the element\n * @param {*} elt The element to insert into the Array\n * @param {Array} list The list to insert into\n * @return {Array} A new Array with `elt` inserted at `index`.\n * @example\n *\n *      R.insert(2, 'x', [1,2,3,4]); //=> [1,2,'x',3,4]\n */\nvar insert = /*#__PURE__*/_curry3(function insert(idx, elt, list) {\n  idx = idx < list.length && idx >= 0 ? idx : list.length;\n  var result = Array.prototype.slice.call(list, 0);\n  result.splice(idx, 0, elt);\n  return result;\n});\nexport default insert;","import _curry3 from './internal/_curry3';\n\n/**\n * Inserts the sub-list into the list, at the specified `index`. _Note that this is not\n * destructive_: it returns a copy of the list with the changes.\n * <small>No lists have been harmed in the application of this function.</small>\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig Number -> [a] -> [a] -> [a]\n * @param {Number} index The position to insert the sub-list\n * @param {Array} elts The sub-list to insert into the Array\n * @param {Array} list The list to insert the sub-list into\n * @return {Array} A new Array with `elts` inserted starting at `index`.\n * @example\n *\n *      R.insertAll(2, ['x','y','z'], [1,2,3,4]); //=> [1,2,'x','y','z',3,4]\n */\nvar insertAll = /*#__PURE__*/_curry3(function insertAll(idx, elts, list) {\n  idx = idx < list.length && idx >= 0 ? idx : list.length;\n  return [].concat(Array.prototype.slice.call(list, 0, idx), elts, Array.prototype.slice.call(list, idx));\n});\nexport default insertAll;","import _contains from './_contains';\n\nvar _Set = /*#__PURE__*/function () {\n  function _Set() {\n    /* globals Set */\n    this._nativeSet = typeof Set === 'function' ? new Set() : null;\n    this._items = {};\n  }\n\n  // until we figure out why jsdoc chokes on this\n  // @param item The item to add to the Set\n  // @returns {boolean} true if the item did not exist prior, otherwise false\n  //\n  _Set.prototype.add = function (item) {\n    return !hasOrAdd(item, true, this);\n  };\n\n  //\n  // @param item The item to check for existence in the Set\n  // @returns {boolean} true if the item exists in the Set, otherwise false\n  //\n  _Set.prototype.has = function (item) {\n    return hasOrAdd(item, false, this);\n  };\n\n  //\n  // Combines the logic for checking whether an item is a member of the set and\n  // for adding a new item to the set.\n  //\n  // @param item       The item to check or add to the Set instance.\n  // @param shouldAdd  If true, the item will be added to the set if it doesn't\n  //                   already exist.\n  // @param set        The set instance to check or add to.\n  // @return {boolean} true if the item already existed, otherwise false.\n  //\n  return _Set;\n}();\n\nfunction hasOrAdd(item, shouldAdd, set) {\n  var type = typeof item;\n  var prevSize, newSize;\n  switch (type) {\n    case 'string':\n    case 'number':\n      // distinguish between +0 and -0\n      if (item === 0 && 1 / item === -Infinity) {\n        if (set._items['-0']) {\n          return true;\n        } else {\n          if (shouldAdd) {\n            set._items['-0'] = true;\n          }\n          return false;\n        }\n      }\n      // these types can all utilise the native Set\n      if (set._nativeSet !== null) {\n        if (shouldAdd) {\n          prevSize = set._nativeSet.size;\n          set._nativeSet.add(item);\n          newSize = set._nativeSet.size;\n          return newSize === prevSize;\n        } else {\n          return set._nativeSet.has(item);\n        }\n      } else {\n        if (!(type in set._items)) {\n          if (shouldAdd) {\n            set._items[type] = {};\n            set._items[type][item] = true;\n          }\n          return false;\n        } else if (item in set._items[type]) {\n          return true;\n        } else {\n          if (shouldAdd) {\n            set._items[type][item] = true;\n          }\n          return false;\n        }\n      }\n\n    case 'boolean':\n      // set._items['boolean'] holds a two element array\n      // representing [ falseExists, trueExists ]\n      if (type in set._items) {\n        var bIdx = item ? 1 : 0;\n        if (set._items[type][bIdx]) {\n          return true;\n        } else {\n          if (shouldAdd) {\n            set._items[type][bIdx] = true;\n          }\n          return false;\n        }\n      } else {\n        if (shouldAdd) {\n          set._items[type] = item ? [false, true] : [true, false];\n        }\n        return false;\n      }\n\n    case 'function':\n      // compare functions for reference equality\n      if (set._nativeSet !== null) {\n        if (shouldAdd) {\n          prevSize = set._nativeSet.size;\n          set._nativeSet.add(item);\n          newSize = set._nativeSet.size;\n          return newSize === prevSize;\n        } else {\n          return set._nativeSet.has(item);\n        }\n      } else {\n        if (!(type in set._items)) {\n          if (shouldAdd) {\n            set._items[type] = [item];\n          }\n          return false;\n        }\n        if (!_contains(item, set._items[type])) {\n          if (shouldAdd) {\n            set._items[type].push(item);\n          }\n          return false;\n        }\n        return true;\n      }\n\n    case 'undefined':\n      if (set._items[type]) {\n        return true;\n      } else {\n        if (shouldAdd) {\n          set._items[type] = true;\n        }\n        return false;\n      }\n\n    case 'object':\n      if (item === null) {\n        if (!set._items['null']) {\n          if (shouldAdd) {\n            set._items['null'] = true;\n          }\n          return false;\n        }\n        return true;\n      }\n    /* falls through */\n    default:\n      // reduce the search size of heterogeneous sets by creating buckets\n      // for each type.\n      type = Object.prototype.toString.call(item);\n      if (!(type in set._items)) {\n        if (shouldAdd) {\n          set._items[type] = [item];\n        }\n        return false;\n      }\n      // scan through all previously applied items\n      if (!_contains(item, set._items[type])) {\n        if (shouldAdd) {\n          set._items[type].push(item);\n        }\n        return false;\n      }\n      return true;\n  }\n}\n\n// A simple Set type that honours R.equals semantics\nexport default _Set;","import _Set from './internal/_Set';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Returns a new list containing only one copy of each element in the original\n * list, based upon the value returned by applying the supplied function to\n * each list element. Prefers the first item if the supplied function produces\n * the same value on two items. [`R.equals`](#equals) is used for comparison.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> b) -> [a] -> [a]\n * @param {Function} fn A function used to produce a value to use during comparisons.\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n *      R.uniqBy(Math.abs, [-1, -5, 2, 10, 1, 2]); //=> [-1, -5, 2, 10]\n */\nvar uniqBy = /*#__PURE__*/_curry2(function uniqBy(fn, list) {\n  var set = new _Set();\n  var result = [];\n  var idx = 0;\n  var appliedItem, item;\n\n  while (idx < list.length) {\n    item = list[idx];\n    appliedItem = fn(item);\n    if (set.add(appliedItem)) {\n      result.push(item);\n    }\n    idx += 1;\n  }\n  return result;\n});\nexport default uniqBy;","import identity from './identity';\nimport uniqBy from './uniqBy';\n\n/**\n * Returns a new list containing only one copy of each element in the original\n * list. [`R.equals`](#equals) is used to determine equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n *      R.uniq([1, 1, 2, 1]); //=> [1, 2]\n *      R.uniq([1, '1']);     //=> [1, '1']\n *      R.uniq([[42], [42]]); //=> [[42]]\n */\nvar uniq = /*#__PURE__*/uniqBy(identity);\nexport default uniq;","import _contains from './internal/_contains';\nimport _curry2 from './internal/_curry2';\nimport _filter from './internal/_filter';\nimport flip from './flip';\nimport uniq from './uniq';\n\n/**\n * Combines two lists into a set (i.e. no duplicates) composed of those\n * elements common to both lists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The list of elements found in both `list1` and `list2`.\n * @see R.innerJoin\n * @example\n *\n *      R.intersection([1,2,3,4], [7,6,5,4,3]); //=> [4, 3]\n */\nvar intersection = /*#__PURE__*/_curry2(function intersection(list1, list2) {\n  var lookupList, filteredList;\n  if (list1.length > list2.length) {\n    lookupList = list1;\n    filteredList = list2;\n  } else {\n    lookupList = list2;\n    filteredList = list1;\n  }\n  return uniq(_filter(flip(_contains)(lookupList), filteredList));\n});\nexport default intersection;","import _checkForMethod from './internal/_checkForMethod';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Creates a new list with the separator interposed between elements.\n *\n * Dispatches to the `intersperse` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} separator The element to add to the list.\n * @param {Array} list The list to be interposed.\n * @return {Array} The new list.\n * @example\n *\n *      R.intersperse('n', ['ba', 'a', 'a']); //=> ['ba', 'n', 'a', 'n', 'a']\n */\nvar intersperse = /*#__PURE__*/_curry2( /*#__PURE__*/_checkForMethod('intersperse', function intersperse(separator, list) {\n  var out = [];\n  var idx = 0;\n  var length = list.length;\n  while (idx < length) {\n    if (idx === length - 1) {\n      out.push(list[idx]);\n    } else {\n      out.push(list[idx], separator);\n    }\n    idx += 1;\n  }\n  return out;\n}));\nexport default intersperse;","import _objectAssign from './_objectAssign';\n\nexport default typeof Object.assign === 'function' ? Object.assign : _objectAssign;","import _has from './_has';\n\n// Based on https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Object/assign\nexport default function _objectAssign(target) {\n  if (target == null) {\n    throw new TypeError('Cannot convert undefined or null to object');\n  }\n\n  var output = Object(target);\n  var idx = 1;\n  var length = arguments.length;\n  while (idx < length) {\n    var source = arguments[idx];\n    if (source != null) {\n      for (var nextKey in source) {\n        if (_has(nextKey, source)) {\n          output[nextKey] = source[nextKey];\n        }\n      }\n    }\n    idx += 1;\n  }\n  return output;\n}","import _curry2 from './internal/_curry2';\n\n/**\n * Creates an object containing a single key:value pair.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Object\n * @sig String -> a -> {String:a}\n * @param {String} key\n * @param {*} val\n * @return {Object}\n * @see R.pair\n * @example\n *\n *      var matchPhrases = R.compose(\n *        R.objOf('must'),\n *        R.map(R.objOf('match_phrase'))\n *      );\n *      matchPhrases(['foo', 'bar', 'baz']); //=> {must: [{match_phrase: 'foo'}, {match_phrase: 'bar'}, {match_phrase: 'baz'}]}\n */\nvar objOf = /*#__PURE__*/_curry2(function objOf(key, val) {\n  var obj = {};\n  obj[key] = val;\n  return obj;\n});\nexport default objOf;","import _assign from './_assign';\nimport _identity from './_identity';\nimport _isArrayLike from './_isArrayLike';\nimport _isTransformer from './_isTransformer';\nimport objOf from '../objOf';\n\nvar _stepCatArray = {\n  '@@transducer/init': Array,\n  '@@transducer/step': function (xs, x) {\n    xs.push(x);\n    return xs;\n  },\n  '@@transducer/result': _identity\n};\nvar _stepCatString = {\n  '@@transducer/init': String,\n  '@@transducer/step': function (a, b) {\n    return a + b;\n  },\n  '@@transducer/result': _identity\n};\nvar _stepCatObject = {\n  '@@transducer/init': Object,\n  '@@transducer/step': function (result, input) {\n    return _assign(result, _isArrayLike(input) ? objOf(input[0], input[1]) : input);\n  },\n  '@@transducer/result': _identity\n};\n\nexport default function _stepCat(obj) {\n  if (_isTransformer(obj)) {\n    return obj;\n  }\n  if (_isArrayLike(obj)) {\n    return _stepCatArray;\n  }\n  if (typeof obj === 'string') {\n    return _stepCatString;\n  }\n  if (typeof obj === 'object') {\n    return _stepCatObject;\n  }\n  throw new Error('Cannot create transformer for ' + obj);\n}","import _clone from './internal/_clone';\nimport _curry3 from './internal/_curry3';\nimport _isTransformer from './internal/_isTransformer';\nimport _reduce from './internal/_reduce';\nimport _stepCat from './internal/_stepCat';\n\n/**\n * Transforms the items of the list with the transducer and appends the\n * transformed items to the accumulator using an appropriate iterator function\n * based on the accumulator type.\n *\n * The accumulator can be an array, string, object or a transformer. Iterated\n * items will be appended to arrays and concatenated to strings. Objects will\n * be merged directly or 2-item arrays will be merged as key, value pairs.\n *\n * The accumulator can also be a transformer object that provides a 2-arity\n * reducing iterator function, step, 0-arity initial value function, init, and\n * 1-arity result extraction function result. The step function is used as the\n * iterator function in reduce. The result function is used to convert the\n * final accumulator into the return type and in most cases is R.identity. The\n * init function is used to provide the initial accumulator.\n *\n * The iteration is performed with [`R.reduce`](#reduce) after initializing the\n * transducer.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig a -> (b -> b) -> [c] -> a\n * @param {*} acc The initial accumulator value.\n * @param {Function} xf The transducer function. Receives a transformer and returns a transformer.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @example\n *\n *      var numbers = [1, 2, 3, 4];\n *      var transducer = R.compose(R.map(R.add(1)), R.take(2));\n *\n *      R.into([], transducer, numbers); //=> [2, 3]\n *\n *      var intoArray = R.into([]);\n *      intoArray(transducer, numbers); //=> [2, 3]\n */\nvar into = /*#__PURE__*/_curry3(function into(acc, xf, list) {\n  return _isTransformer(acc) ? _reduce(xf(acc), acc['@@transducer/init'](), list) : _reduce(xf(_stepCat(acc)), _clone(acc, [], [], false), list);\n});\nexport default into;","import _curry1 from './internal/_curry1';\nimport _has from './internal/_has';\nimport keys from './keys';\n\n/**\n * Same as [`R.invertObj`](#invertObj), however this accounts for objects with\n * duplicate values by putting the values into an array.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {s: x} -> {x: [ s, ... ]}\n * @param {Object} obj The object or array to invert\n * @return {Object} out A new object with keys in an array.\n * @see R.invertObj\n * @example\n *\n *      var raceResultsByFirstName = {\n *        first: 'alice',\n *        second: 'jake',\n *        third: 'alice',\n *      };\n *      R.invert(raceResultsByFirstName);\n *      //=> { 'alice': ['first', 'third'], 'jake':['second'] }\n */\nvar invert = /*#__PURE__*/_curry1(function invert(obj) {\n  var props = keys(obj);\n  var len = props.length;\n  var idx = 0;\n  var out = {};\n\n  while (idx < len) {\n    var key = props[idx];\n    var val = obj[key];\n    var list = _has(val, out) ? out[val] : out[val] = [];\n    list[list.length] = key;\n    idx += 1;\n  }\n  return out;\n});\nexport default invert;","import _curry1 from './internal/_curry1';\nimport keys from './keys';\n\n/**\n * Returns a new object with the keys of the given object as values, and the\n * values of the given object, which are coerced to strings, as keys. Note\n * that the last key found is preferred when handling the same value.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {s: x} -> {x: s}\n * @param {Object} obj The object or array to invert\n * @return {Object} out A new object\n * @see R.invert\n * @example\n *\n *      var raceResults = {\n *        first: 'alice',\n *        second: 'jake'\n *      };\n *      R.invertObj(raceResults);\n *      //=> { 'alice': 'first', 'jake':'second' }\n *\n *      // Alternatively:\n *      var raceResults = ['alice', 'jake'];\n *      R.invertObj(raceResults);\n *      //=> { 'alice': '0', 'jake':'1' }\n */\nvar invertObj = /*#__PURE__*/_curry1(function invertObj(obj) {\n  var props = keys(obj);\n  var len = props.length;\n  var idx = 0;\n  var out = {};\n\n  while (idx < len) {\n    var key = props[idx];\n    out[obj[key]] = key;\n    idx += 1;\n  }\n  return out;\n});\nexport default invertObj;","import _curry2 from './internal/_curry2';\nimport _isFunction from './internal/_isFunction';\nimport curryN from './curryN';\nimport toString from './toString';\n\n/**\n * Turns a named method with a specified arity into a function that can be\n * called directly supplied with arguments and a target object.\n *\n * The returned function is curried and accepts `arity + 1` parameters where\n * the final parameter is the target object.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig Number -> String -> (a -> b -> ... -> n -> Object -> *)\n * @param {Number} arity Number of arguments the returned function should take\n *        before the target object.\n * @param {String} method Name of the method to call.\n * @return {Function} A new curried function.\n * @see R.construct\n * @example\n *\n *      var sliceFrom = R.invoker(1, 'slice');\n *      sliceFrom(6, 'abcdefghijklm'); //=> 'ghijklm'\n *      var sliceFrom6 = R.invoker(2, 'slice')(6);\n *      sliceFrom6(8, 'abcdefghijklm'); //=> 'gh'\n * @symb R.invoker(0, 'method')(o) = o['method']()\n * @symb R.invoker(1, 'method')(a, o) = o['method'](a)\n * @symb R.invoker(2, 'method')(a, b, o) = o['method'](a, b)\n */\nvar invoker = /*#__PURE__*/_curry2(function invoker(arity, method) {\n  return curryN(arity + 1, function () {\n    var target = arguments[arity];\n    if (target != null && _isFunction(target[method])) {\n      return target[method].apply(target, Array.prototype.slice.call(arguments, 0, arity));\n    }\n    throw new TypeError(toString(target) + ' does not have a method named \"' + method + '\"');\n  });\n});\nexport default invoker;","import _curry2 from './internal/_curry2';\n\n/**\n * See if an object (`val`) is an instance of the supplied constructor. This\n * function will check up the inheritance chain, if any.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Type\n * @sig (* -> {*}) -> a -> Boolean\n * @param {Object} ctor A constructor\n * @param {*} val The value to test\n * @return {Boolean}\n * @example\n *\n *      R.is(Object, {}); //=> true\n *      R.is(Number, 1); //=> true\n *      R.is(Object, 1); //=> false\n *      R.is(String, 's'); //=> true\n *      R.is(String, new String('')); //=> true\n *      R.is(Object, new String('')); //=> true\n *      R.is(Object, 's'); //=> false\n *      R.is(Number, {}); //=> false\n */\nvar is = /*#__PURE__*/_curry2(function is(Ctor, val) {\n  return val != null && val.constructor === Ctor || val instanceof Ctor;\n});\nexport default is;","import _curry1 from './internal/_curry1';\nimport empty from './empty';\nimport equals from './equals';\n\n/**\n * Returns `true` if the given value is its type's empty value; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig a -> Boolean\n * @param {*} x\n * @return {Boolean}\n * @see R.empty\n * @example\n *\n *      R.isEmpty([1, 2, 3]);   //=> false\n *      R.isEmpty([]);          //=> true\n *      R.isEmpty('');          //=> true\n *      R.isEmpty(null);        //=> false\n *      R.isEmpty({});          //=> true\n *      R.isEmpty({length: 0}); //=> false\n */\nvar isEmpty = /*#__PURE__*/_curry1(function isEmpty(x) {\n  return x != null && equals(x, empty(x));\n});\nexport default isEmpty;","import invoker from './invoker';\n\n/**\n * Returns a string made by inserting the `separator` between each element and\n * concatenating all the elements into a single string.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig String -> [a] -> String\n * @param {Number|String} separator The string used to separate the elements.\n * @param {Array} xs The elements to join into a string.\n * @return {String} str The string made by concatenating `xs` with `separator`.\n * @see R.split\n * @example\n *\n *      var spacer = R.join(' ');\n *      spacer(['a', 2, 3.4]);   //=> 'a 2 3.4'\n *      R.join('|', [1, 2, 3]);    //=> '1|2|3'\n */\nvar join = /*#__PURE__*/invoker(1, 'join');\nexport default join;","import _curry1 from './internal/_curry1';\nimport converge from './converge';\n\n/**\n * juxt applies a list of functions to a list of values.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Function\n * @sig [(a, b, ..., m) -> n] -> ((a, b, ..., m) -> [n])\n * @param {Array} fns An array of functions\n * @return {Function} A function that returns a list of values after applying each of the original `fns` to its parameters.\n * @see R.applySpec\n * @example\n *\n *      var getRange = R.juxt([Math.min, Math.max]);\n *      getRange(3, 4, 9, -3); //=> [-3, 9]\n * @symb R.juxt([f, g, h])(a, b) = [f(a, b), g(a, b), h(a, b)]\n */\nvar juxt = /*#__PURE__*/_curry1(function juxt(fns) {\n  return converge(function () {\n    return Array.prototype.slice.call(arguments, 0);\n  }, fns);\n});\nexport default juxt;","import _curry1 from './internal/_curry1';\n\n/**\n * Returns a list containing the names of all the properties of the supplied\n * object, including prototype properties.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own and prototype properties.\n * @see R.keys, R.valuesIn\n * @example\n *\n *      var F = function() { this.x = 'X'; };\n *      F.prototype.y = 'Y';\n *      var f = new F();\n *      R.keysIn(f); //=> ['x', 'y']\n */\nvar keysIn = /*#__PURE__*/_curry1(function keysIn(obj) {\n  var prop;\n  var ks = [];\n  for (prop in obj) {\n    ks[ks.length] = prop;\n  }\n  return ks;\n});\nexport default keysIn;","import _curry2 from './internal/_curry2';\nimport _isArray from './internal/_isArray';\nimport equals from './equals';\n\n/**\n * Returns the position of the last occurrence of an item in an array, or -1 if\n * the item is not included in the array. [`R.equals`](#equals) is used to\n * determine equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Number\n * @param {*} target The item to find.\n * @param {Array} xs The array to search in.\n * @return {Number} the index of the target, or -1 if the target is not found.\n * @see R.indexOf\n * @example\n *\n *      R.lastIndexOf(3, [-1,3,3,0,1,2,3,4]); //=> 6\n *      R.lastIndexOf(10, [1,2,3,4]); //=> -1\n */\nvar lastIndexOf = /*#__PURE__*/_curry2(function lastIndexOf(target, xs) {\n  if (typeof xs.lastIndexOf === 'function' && !_isArray(xs)) {\n    return xs.lastIndexOf(target);\n  } else {\n    var idx = xs.length - 1;\n    while (idx >= 0) {\n      if (equals(xs[idx], target)) {\n        return idx;\n      }\n      idx -= 1;\n    }\n    return -1;\n  }\n});\nexport default lastIndexOf;","export default function _isNumber(x) {\n  return Object.prototype.toString.call(x) === '[object Number]';\n}","import _curry1 from './internal/_curry1';\nimport _isNumber from './internal/_isNumber';\n\n/**\n * Returns the number of elements in the array by returning `list.length`.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [a] -> Number\n * @param {Array} list The array to inspect.\n * @return {Number} The length of the array.\n * @example\n *\n *      R.length([]); //=> 0\n *      R.length([1, 2, 3]); //=> 3\n */\nvar length = /*#__PURE__*/_curry1(function length(list) {\n  return list != null && _isNumber(list.length) ? list.length : NaN;\n});\nexport default length;","import _curry2 from './internal/_curry2';\nimport map from './map';\n\n/**\n * Returns a lens for the given getter and setter functions. The getter \"gets\"\n * the value of the focus; the setter \"sets\" the value of the focus. The setter\n * should not mutate the data structure.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig (s -> a) -> ((a, s) -> s) -> Lens s a\n * @param {Function} getter\n * @param {Function} setter\n * @return {Lens}\n * @see R.view, R.set, R.over, R.lensIndex, R.lensProp\n * @example\n *\n *      var xLens = R.lens(R.prop('x'), R.assoc('x'));\n *\n *      R.view(xLens, {x: 1, y: 2});            //=> 1\n *      R.set(xLens, 4, {x: 1, y: 2});          //=> {x: 4, y: 2}\n *      R.over(xLens, R.negate, {x: 1, y: 2});  //=> {x: -1, y: 2}\n */\nvar lens = /*#__PURE__*/_curry2(function lens(getter, setter) {\n  return function (toFunctorFn) {\n    return function (target) {\n      return map(function (focus) {\n        return setter(focus, target);\n      }, toFunctorFn(getter(target)));\n    };\n  };\n});\nexport default lens;","import _curry1 from './internal/_curry1';\nimport lens from './lens';\nimport nth from './nth';\nimport update from './update';\n\n/**\n * Returns a lens whose focus is the specified index.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Number -> Lens s a\n * @param {Number} n\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n *      var headLens = R.lensIndex(0);\n *\n *      R.view(headLens, ['a', 'b', 'c']);            //=> 'a'\n *      R.set(headLens, 'x', ['a', 'b', 'c']);        //=> ['x', 'b', 'c']\n *      R.over(headLens, R.toUpper, ['a', 'b', 'c']); //=> ['A', 'b', 'c']\n */\nvar lensIndex = /*#__PURE__*/_curry1(function lensIndex(n) {\n  return lens(nth(n), update(n));\n});\nexport default lensIndex;","import _curry1 from './internal/_curry1';\nimport assocPath from './assocPath';\nimport lens from './lens';\nimport path from './path';\n\n/**\n * Returns a lens whose focus is the specified path.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @typedefn Idx = String | Int\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig [Idx] -> Lens s a\n * @param {Array} path The path to use.\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n *      var xHeadYLens = R.lensPath(['x', 0, 'y']);\n *\n *      R.view(xHeadYLens, {x: [{y: 2, z: 3}, {y: 4, z: 5}]});\n *      //=> 2\n *      R.set(xHeadYLens, 1, {x: [{y: 2, z: 3}, {y: 4, z: 5}]});\n *      //=> {x: [{y: 1, z: 3}, {y: 4, z: 5}]}\n *      R.over(xHeadYLens, R.negate, {x: [{y: 2, z: 3}, {y: 4, z: 5}]});\n *      //=> {x: [{y: -2, z: 3}, {y: 4, z: 5}]}\n */\nvar lensPath = /*#__PURE__*/_curry1(function lensPath(p) {\n  return lens(path(p), assocPath(p));\n});\nexport default lensPath;","import _curry1 from './internal/_curry1';\nimport assoc from './assoc';\nimport lens from './lens';\nimport prop from './prop';\n\n/**\n * Returns a lens whose focus is the specified property.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig String -> Lens s a\n * @param {String} k\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n *      var xLens = R.lensProp('x');\n *\n *      R.view(xLens, {x: 1, y: 2});            //=> 1\n *      R.set(xLens, 4, {x: 1, y: 2});          //=> {x: 4, y: 2}\n *      R.over(xLens, R.negate, {x: 1, y: 2});  //=> {x: -1, y: 2}\n */\nvar lensProp = /*#__PURE__*/_curry1(function lensProp(k) {\n  return lens(prop(k), assoc(k));\n});\nexport default lensProp;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if the first argument is less than the second; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @see R.gt\n * @example\n *\n *      R.lt(2, 1); //=> false\n *      R.lt(2, 2); //=> false\n *      R.lt(2, 3); //=> true\n *      R.lt('a', 'z'); //=> true\n *      R.lt('z', 'a'); //=> false\n */\nvar lt = /*#__PURE__*/_curry2(function lt(a, b) {\n  return a < b;\n});\nexport default lt;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns `true` if the first argument is less than or equal to the second;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {Number} a\n * @param {Number} b\n * @return {Boolean}\n * @see R.gte\n * @example\n *\n *      R.lte(2, 1); //=> false\n *      R.lte(2, 2); //=> true\n *      R.lte(2, 3); //=> true\n *      R.lte('a', 'z'); //=> true\n *      R.lte('z', 'a'); //=> false\n */\nvar lte = /*#__PURE__*/_curry2(function lte(a, b) {\n  return a <= b;\n});\nexport default lte;","import _curry3 from './internal/_curry3';\n\n/**\n * The `mapAccum` function behaves like a combination of map and reduce; it\n * applies a function to each element of a list, passing an accumulating\n * parameter from left to right, and returning a final value of this\n * accumulator together with the new list.\n *\n * The iterator function receives two arguments, *acc* and *value*, and should\n * return a tuple *[acc, value]*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig ((acc, x) -> (acc, y)) -> acc -> [x] -> (acc, [y])\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.addIndex, R.mapAccumRight\n * @example\n *\n *      var digits = ['1', '2', '3', '4'];\n *      var appender = (a, b) => [a + b, a + b];\n *\n *      R.mapAccum(appender, 0, digits); //=> ['01234', ['01', '012', '0123', '01234']]\n * @symb R.mapAccum(f, a, [b, c, d]) = [\n *   f(f(f(a, b)[0], c)[0], d)[0],\n *   [\n *     f(a, b)[1],\n *     f(f(a, b)[0], c)[1],\n *     f(f(f(a, b)[0], c)[0], d)[1]\n *   ]\n * ]\n */\nvar mapAccum = /*#__PURE__*/_curry3(function mapAccum(fn, acc, list) {\n  var idx = 0;\n  var len = list.length;\n  var result = [];\n  var tuple = [acc];\n  while (idx < len) {\n    tuple = fn(tuple[0], list[idx]);\n    result[idx] = tuple[1];\n    idx += 1;\n  }\n  return [tuple[0], result];\n});\nexport default mapAccum;","import _curry3 from './internal/_curry3';\n\n/**\n * The `mapAccumRight` function behaves like a combination of map and reduce; it\n * applies a function to each element of a list, passing an accumulating\n * parameter from right to left, and returning a final value of this\n * accumulator together with the new list.\n *\n * Similar to [`mapAccum`](#mapAccum), except moves through the input list from\n * the right to the left.\n *\n * The iterator function receives two arguments, *value* and *acc*, and should\n * return a tuple *[value, acc]*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig ((x, acc) -> (y, acc)) -> acc -> [x] -> ([y], acc)\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.addIndex, R.mapAccum\n * @example\n *\n *      var digits = ['1', '2', '3', '4'];\n *      var append = (a, b) => [a + b, a + b];\n *\n *      R.mapAccumRight(append, 5, digits); //=> [['12345', '2345', '345', '45'], '12345']\n * @symb R.mapAccumRight(f, a, [b, c, d]) = [\n *   [\n *     f(b, f(c, f(d, a)[0])[0])[1],\n *     f(c, f(d, a)[0])[1],\n *     f(d, a)[1],\n *   ]\n *   f(b, f(c, f(d, a)[0])[0])[0],\n * ]\n */\nvar mapAccumRight = /*#__PURE__*/_curry3(function mapAccumRight(fn, acc, list) {\n  var idx = list.length - 1;\n  var result = [];\n  var tuple = [acc];\n  while (idx >= 0) {\n    tuple = fn(list[idx], tuple[0]);\n    result[idx] = tuple[1];\n    idx -= 1;\n  }\n  return [result, tuple[0]];\n});\nexport default mapAccumRight;","import _curry2 from './internal/_curry2';\nimport _reduce from './internal/_reduce';\nimport keys from './keys';\n\n/**\n * An Object-specific version of [`map`](#map). The function is applied to three\n * arguments: *(value, key, obj)*. If only the value is significant, use\n * [`map`](#map) instead.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig ((*, String, Object) -> *) -> Object -> Object\n * @param {Function} fn\n * @param {Object} obj\n * @return {Object}\n * @see R.map\n * @example\n *\n *      var values = { x: 1, y: 2, z: 3 };\n *      var prependKeyAndDouble = (num, key, obj) => key + (num * 2);\n *\n *      R.mapObjIndexed(prependKeyAndDouble, values); //=> { x: 'x2', y: 'y4', z: 'z6' }\n */\nvar mapObjIndexed = /*#__PURE__*/_curry2(function mapObjIndexed(fn, obj) {\n  return _reduce(function (acc, key) {\n    acc[key] = fn(obj[key], key, obj);\n    return acc;\n  }, {}, keys(obj));\n});\nexport default mapObjIndexed;","import _curry2 from './internal/_curry2';\n\n/**\n * Tests a regular expression against a String. Note that this function will\n * return an empty array when there are no matches. This differs from\n * [`String.prototype.match`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/match)\n * which returns `null` when there are no matches.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category String\n * @sig RegExp -> String -> [String | Undefined]\n * @param {RegExp} rx A regular expression.\n * @param {String} str The string to match against\n * @return {Array} The list of matches or empty array.\n * @see R.test\n * @example\n *\n *      R.match(/([a-z]a)/g, 'bananas'); //=> ['ba', 'na', 'na']\n *      R.match(/a/, 'b'); //=> []\n *      R.match(/a/, null); //=> TypeError: null does not have a method named \"match\"\n */\nvar match = /*#__PURE__*/_curry2(function match(rx, str) {\n  return str.match(rx) || [];\n});\nexport default match;","import _curry2 from './internal/_curry2';\nimport _isInteger from './internal/_isInteger';\n\n/**\n * `mathMod` behaves like the modulo operator should mathematically, unlike the\n * `%` operator (and by extension, [`R.modulo`](#modulo)). So while\n * `-17 % 5` is `-2`, `mathMod(-17, 5)` is `3`. `mathMod` requires Integer\n * arguments, and returns NaN when the modulus is zero or negative.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} m The dividend.\n * @param {Number} p the modulus.\n * @return {Number} The result of `b mod a`.\n * @see R.modulo\n * @example\n *\n *      R.mathMod(-17, 5);  //=> 3\n *      R.mathMod(17, 5);   //=> 2\n *      R.mathMod(17, -5);  //=> NaN\n *      R.mathMod(17, 0);   //=> NaN\n *      R.mathMod(17.2, 5); //=> NaN\n *      R.mathMod(17, 5.3); //=> NaN\n *\n *      var clock = R.mathMod(R.__, 12);\n *      clock(15); //=> 3\n *      clock(24); //=> 0\n *\n *      var seventeenMod = R.mathMod(17);\n *      seventeenMod(3);  //=> 2\n *      seventeenMod(4);  //=> 1\n *      seventeenMod(10); //=> 7\n */\nvar mathMod = /*#__PURE__*/_curry2(function mathMod(m, p) {\n  if (!_isInteger(m)) {\n    return NaN;\n  }\n  if (!_isInteger(p) || p < 1) {\n    return NaN;\n  }\n  return (m % p + p) % p;\n});\nexport default mathMod;","import _curry3 from './internal/_curry3';\n\n/**\n * Takes a function and two values, and returns whichever value produces the\n * larger result when passed to the provided function.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Relation\n * @sig Ord b => (a -> b) -> a -> a -> a\n * @param {Function} f\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.max, R.minBy\n * @example\n *\n *      //  square :: Number -> Number\n *      var square = n => n * n;\n *\n *      R.maxBy(square, -3, 2); //=> -3\n *\n *      R.reduce(R.maxBy(square), 0, [3, -5, 4, 1, -2]); //=> -5\n *      R.reduce(R.maxBy(square), 0, []); //=> 0\n */\nvar maxBy = /*#__PURE__*/_curry3(function maxBy(f, a, b) {\n  return f(b) > f(a) ? b : a;\n});\nexport default maxBy;","import add from './add';\nimport reduce from './reduce';\n\n/**\n * Adds together all the elements of a list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list An array of numbers\n * @return {Number} The sum of all the numbers in the list.\n * @see R.reduce\n * @example\n *\n *      R.sum([2,4,6,8,100,1]); //=> 121\n */\nvar sum = /*#__PURE__*/reduce(add, 0);\nexport default sum;","import _curry1 from './internal/_curry1';\nimport sum from './sum';\n\n/**\n * Returns the mean of the given list of numbers.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list\n * @return {Number}\n * @see R.median\n * @example\n *\n *      R.mean([2, 7, 9]); //=> 6\n *      R.mean([]); //=> NaN\n */\nvar mean = /*#__PURE__*/_curry1(function mean(list) {\n  return sum(list) / list.length;\n});\nexport default mean;","import _curry1 from './internal/_curry1';\nimport mean from './mean';\n\n/**\n * Returns the median of the given list of numbers.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list\n * @return {Number}\n * @see R.mean\n * @example\n *\n *      R.median([2, 9, 7]); //=> 7\n *      R.median([7, 2, 10, 9]); //=> 8\n *      R.median([]); //=> NaN\n */\nvar median = /*#__PURE__*/_curry1(function median(list) {\n  var len = list.length;\n  if (len === 0) {\n    return NaN;\n  }\n  var width = 2 - len % 2;\n  var idx = (len - width) / 2;\n  return mean(Array.prototype.slice.call(list, 0).sort(function (a, b) {\n    return a < b ? -1 : a > b ? 1 : 0;\n  }).slice(idx, idx + width));\n});\nexport default median;","import _arity from './internal/_arity';\nimport _curry2 from './internal/_curry2';\nimport _has from './internal/_has';\n\n/**\n * A customisable version of [`R.memoize`](#memoize). `memoizeWith` takes an\n * additional function that will be applied to a given argument set and used to\n * create the cache key under which the results of the function to be memoized\n * will be stored. Care must be taken when implementing key generation to avoid\n * clashes that may overwrite previous entries erroneously.\n *\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Function\n * @sig (*... -> String) -> (*... -> a) -> (*... -> a)\n * @param {Function} fn The function to generate the cache key.\n * @param {Function} fn The function to memoize.\n * @return {Function} Memoized version of `fn`.\n * @see R.memoize\n * @example\n *\n *      let count = 0;\n *      const factorial = R.memoizeWith(R.identity, n => {\n *        count += 1;\n *        return R.product(R.range(1, n + 1));\n *      });\n *      factorial(5); //=> 120\n *      factorial(5); //=> 120\n *      factorial(5); //=> 120\n *      count; //=> 1\n */\nvar memoizeWith = /*#__PURE__*/_curry2(function memoizeWith(mFn, fn) {\n  var cache = {};\n  return _arity(fn.length, function () {\n    var key = mFn.apply(this, arguments);\n    if (!_has(key, cache)) {\n      cache[key] = fn.apply(this, arguments);\n    }\n    return cache[key];\n  });\n});\nexport default memoizeWith;","import memoizeWith from './memoizeWith';\nimport toString from './toString';\n\n/**\n * Creates a new function that, when invoked, caches the result of calling `fn`\n * for a given argument set and returns the result. Subsequent calls to the\n * memoized `fn` with the same argument set will not result in an additional\n * call to `fn`; instead, the cached result for that set of arguments will be\n * returned.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (*... -> a) -> (*... -> a)\n * @param {Function} fn The function to memoize.\n * @return {Function} Memoized version of `fn`.\n * @see R.memoizeWith\n * @deprecated since v0.25.0\n * @example\n *\n *      let count = 0;\n *      const factorial = R.memoize(n => {\n *        count += 1;\n *        return R.product(R.range(1, n + 1));\n *      });\n *      factorial(5); //=> 120\n *      factorial(5); //=> 120\n *      factorial(5); //=> 120\n *      count; //=> 1\n */\nvar memoize = /*#__PURE__*/memoizeWith(function () {\n  return toString(arguments);\n});\nexport default memoize;","import _assign from './internal/_assign';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Create a new object with the own properties of the first object merged with\n * the own properties of the second object. If a key exists in both objects,\n * the value from the second object will be used.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> {k: v} -> {k: v}\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.mergeDeepRight, R.mergeWith, R.mergeWithKey\n * @example\n *\n *      R.merge({ 'name': 'fred', 'age': 10 }, { 'age': 40 });\n *      //=> { 'name': 'fred', 'age': 40 }\n *\n *      var resetToDefault = R.merge(R.__, {x: 0});\n *      resetToDefault({x: 5, y: 2}); //=> {x: 0, y: 2}\n * @symb R.merge({ x: 1, y: 2 }, { y: 5, z: 3 }) = { x: 1, y: 5, z: 3 }\n */\nvar merge = /*#__PURE__*/_curry2(function merge(l, r) {\n  return _assign({}, l, r);\n});\nexport default merge;","import _assign from './internal/_assign';\nimport _curry1 from './internal/_curry1';\n\n/**\n * Merges a list of objects together into one object.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig [{k: v}] -> {k: v}\n * @param {Array} list An array of objects\n * @return {Object} A merged object.\n * @see R.reduce\n * @example\n *\n *      R.mergeAll([{foo:1},{bar:2},{baz:3}]); //=> {foo:1,bar:2,baz:3}\n *      R.mergeAll([{foo:1},{foo:2},{bar:2}]); //=> {foo:2,bar:2}\n * @symb R.mergeAll([{ x: 1 }, { y: 2 }, { z: 3 }]) = { x: 1, y: 2, z: 3 }\n */\nvar mergeAll = /*#__PURE__*/_curry1(function mergeAll(list) {\n  return _assign.apply(null, [{}].concat(list));\n});\nexport default mergeAll;","import _curry3 from './internal/_curry3';\nimport _has from './internal/_has';\n\n/**\n * Creates a new object with the own properties of the two provided objects. If\n * a key exists in both objects, the provided function is applied to the key\n * and the values associated with the key in each object, with the result being\n * used as the value associated with the key in the returned object.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.mergeDeepWithKey, R.merge, R.mergeWith\n * @example\n *\n *      let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r\n *      R.mergeWithKey(concatValues,\n *                     { a: true, thing: 'foo', values: [10, 20] },\n *                     { b: true, thing: 'bar', values: [15, 35] });\n *      //=> { a: true, b: true, thing: 'bar', values: [10, 20, 15, 35] }\n * @symb R.mergeWithKey(f, { x: 1, y: 2 }, { y: 5, z: 3 }) = { x: 1, y: f('y', 2, 5), z: 3 }\n */\nvar mergeWithKey = /*#__PURE__*/_curry3(function mergeWithKey(fn, l, r) {\n  var result = {};\n  var k;\n\n  for (k in l) {\n    if (_has(k, l)) {\n      result[k] = _has(k, r) ? fn(k, l[k], r[k]) : l[k];\n    }\n  }\n\n  for (k in r) {\n    if (_has(k, r) && !_has(k, result)) {\n      result[k] = r[k];\n    }\n  }\n\n  return result;\n});\nexport default mergeWithKey;","import _curry3 from './internal/_curry3';\nimport _isObject from './internal/_isObject';\nimport mergeWithKey from './mergeWithKey';\n\n/**\n * Creates a new object with the own properties of the two provided objects.\n * If a key exists in both objects:\n * - and both associated values are also objects then the values will be\n *   recursively merged.\n * - otherwise the provided function is applied to the key and associated values\n *   using the resulting value as the new value associated with the key.\n * If a key only exists in one object, the value will be associated with the key\n * of the resulting object.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Object\n * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} lObj\n * @param {Object} rObj\n * @return {Object}\n * @see R.mergeWithKey, R.mergeDeep, R.mergeDeepWith\n * @example\n *\n *      let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r\n *      R.mergeDeepWithKey(concatValues,\n *                         { a: true, c: { thing: 'foo', values: [10, 20] }},\n *                         { b: true, c: { thing: 'bar', values: [15, 35] }});\n *      //=> { a: true, b: true, c: { thing: 'bar', values: [10, 20, 15, 35] }}\n */\nvar mergeDeepWithKey = /*#__PURE__*/_curry3(function mergeDeepWithKey(fn, lObj, rObj) {\n  return mergeWithKey(function (k, lVal, rVal) {\n    if (_isObject(lVal) && _isObject(rVal)) {\n      return mergeDeepWithKey(fn, lVal, rVal);\n    } else {\n      return fn(k, lVal, rVal);\n    }\n  }, lObj, rObj);\n});\nexport default mergeDeepWithKey;","import _curry2 from './internal/_curry2';\nimport mergeDeepWithKey from './mergeDeepWithKey';\n\n/**\n * Creates a new object with the own properties of the first object merged with\n * the own properties of the second object. If a key exists in both objects:\n * - and both values are objects, the two values will be recursively merged\n * - otherwise the value from the first object will be used.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Object\n * @sig {a} -> {a} -> {a}\n * @param {Object} lObj\n * @param {Object} rObj\n * @return {Object}\n * @see R.merge, R.mergeDeepRight, R.mergeDeepWith, R.mergeDeepWithKey\n * @example\n *\n *      R.mergeDeepLeft({ name: 'fred', age: 10, contact: { email: 'moo@example.com' }},\n *                      { age: 40, contact: { email: 'baa@example.com' }});\n *      //=> { name: 'fred', age: 10, contact: { email: 'moo@example.com' }}\n */\nvar mergeDeepLeft = /*#__PURE__*/_curry2(function mergeDeepLeft(lObj, rObj) {\n  return mergeDeepWithKey(function (k, lVal, rVal) {\n    return lVal;\n  }, lObj, rObj);\n});\nexport default mergeDeepLeft;","import _curry2 from './internal/_curry2';\nimport mergeDeepWithKey from './mergeDeepWithKey';\n\n/**\n * Creates a new object with the own properties of the first object merged with\n * the own properties of the second object. If a key exists in both objects:\n * - and both values are objects, the two values will be recursively merged\n * - otherwise the value from the second object will be used.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Object\n * @sig {a} -> {a} -> {a}\n * @param {Object} lObj\n * @param {Object} rObj\n * @return {Object}\n * @see R.merge, R.mergeDeepLeft, R.mergeDeepWith, R.mergeDeepWithKey\n * @example\n *\n *      R.mergeDeepRight({ name: 'fred', age: 10, contact: { email: 'moo@example.com' }},\n *                       { age: 40, contact: { email: 'baa@example.com' }});\n *      //=> { name: 'fred', age: 40, contact: { email: 'baa@example.com' }}\n */\nvar mergeDeepRight = /*#__PURE__*/_curry2(function mergeDeepRight(lObj, rObj) {\n  return mergeDeepWithKey(function (k, lVal, rVal) {\n    return rVal;\n  }, lObj, rObj);\n});\nexport default mergeDeepRight;","import _curry3 from './internal/_curry3';\nimport mergeDeepWithKey from './mergeDeepWithKey';\n\n/**\n * Creates a new object with the own properties of the two provided objects.\n * If a key exists in both objects:\n * - and both associated values are also objects then the values will be\n *   recursively merged.\n * - otherwise the provided function is applied to associated values using the\n *   resulting value as the new value associated with the key.\n * If a key only exists in one object, the value will be associated with the key\n * of the resulting object.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Object\n * @sig ((a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} lObj\n * @param {Object} rObj\n * @return {Object}\n * @see R.mergeWith, R.mergeDeep, R.mergeDeepWithKey\n * @example\n *\n *      R.mergeDeepWith(R.concat,\n *                      { a: true, c: { values: [10, 20] }},\n *                      { b: true, c: { values: [15, 35] }});\n *      //=> { a: true, b: true, c: { values: [10, 20, 15, 35] }}\n */\nvar mergeDeepWith = /*#__PURE__*/_curry3(function mergeDeepWith(fn, lObj, rObj) {\n  return mergeDeepWithKey(function (k, lVal, rVal) {\n    return fn(lVal, rVal);\n  }, lObj, rObj);\n});\nexport default mergeDeepWith;","import _curry3 from './internal/_curry3';\nimport mergeWithKey from './mergeWithKey';\n\n/**\n * Creates a new object with the own properties of the two provided objects. If\n * a key exists in both objects, the provided function is applied to the values\n * associated with the key in each object, with the result being used as the\n * value associated with the key in the returned object.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @sig ((a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.mergeDeepWith, R.merge, R.mergeWithKey\n * @example\n *\n *      R.mergeWith(R.concat,\n *                  { a: true, values: [10, 20] },\n *                  { b: true, values: [15, 35] });\n *      //=> { a: true, b: true, values: [10, 20, 15, 35] }\n */\nvar mergeWith = /*#__PURE__*/_curry3(function mergeWith(fn, l, r) {\n  return mergeWithKey(function (_, _l, _r) {\n    return fn(_l, _r);\n  }, l, r);\n});\nexport default mergeWith;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns the smaller of its two arguments.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> a\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.minBy, R.max\n * @example\n *\n *      R.min(789, 123); //=> 123\n *      R.min('a', 'b'); //=> 'a'\n */\nvar min = /*#__PURE__*/_curry2(function min(a, b) {\n  return b < a ? b : a;\n});\nexport default min;","import _curry3 from './internal/_curry3';\n\n/**\n * Takes a function and two values, and returns whichever value produces the\n * smaller result when passed to the provided function.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Relation\n * @sig Ord b => (a -> b) -> a -> a -> a\n * @param {Function} f\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.min, R.maxBy\n * @example\n *\n *      //  square :: Number -> Number\n *      var square = n => n * n;\n *\n *      R.minBy(square, -3, 2); //=> 2\n *\n *      R.reduce(R.minBy(square), Infinity, [3, -5, 4, 1, -2]); //=> 1\n *      R.reduce(R.minBy(square), Infinity, []); //=> Infinity\n */\nvar minBy = /*#__PURE__*/_curry3(function minBy(f, a, b) {\n  return f(b) < f(a) ? b : a;\n});\nexport default minBy;","import _curry2 from './internal/_curry2';\n\n/**\n * Divides the first parameter by the second and returns the remainder. Note\n * that this function preserves the JavaScript-style behavior for modulo. For\n * mathematical modulo see [`mathMod`](#mathMod).\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The value to the divide.\n * @param {Number} b The pseudo-modulus\n * @return {Number} The result of `b % a`.\n * @see R.mathMod\n * @example\n *\n *      R.modulo(17, 3); //=> 2\n *      // JS behavior:\n *      R.modulo(-17, 3); //=> -2\n *      R.modulo(17, -3); //=> 2\n *\n *      var isOdd = R.modulo(R.__, 2);\n *      isOdd(42); //=> 0\n *      isOdd(21); //=> 1\n */\nvar modulo = /*#__PURE__*/_curry2(function modulo(a, b) {\n  return a % b;\n});\nexport default modulo;","import _curry2 from './internal/_curry2';\n\n/**\n * Multiplies two numbers. Equivalent to `a * b` but curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a * b`.\n * @see R.divide\n * @example\n *\n *      var double = R.multiply(2);\n *      var triple = R.multiply(3);\n *      double(3);       //=>  6\n *      triple(4);       //=> 12\n *      R.multiply(2, 5);  //=> 10\n */\nvar multiply = /*#__PURE__*/_curry2(function multiply(a, b) {\n  return a * b;\n});\nexport default multiply;","import _curry1 from './internal/_curry1';\n\n/**\n * Negates its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number}\n * @example\n *\n *      R.negate(42); //=> -42\n */\nvar negate = /*#__PURE__*/_curry1(function negate(n) {\n  return -n;\n});\nexport default negate;","import _complement from './internal/_complement';\nimport _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xany from './internal/_xany';\nimport any from './any';\n\n/**\n * Returns `true` if no elements of the list match the predicate, `false`\n * otherwise.\n *\n * Dispatches to the `any` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is not satisfied by every element, `false` otherwise.\n * @see R.all, R.any\n * @example\n *\n *      var isEven = n => n % 2 === 0;\n *      var isOdd = n => n % 2 === 1;\n *\n *      R.none(isEven, [1, 3, 5, 7, 9, 11]); //=> true\n *      R.none(isOdd, [1, 3, 5, 7, 8, 11]); //=> false\n */\nvar none = /*#__PURE__*/_curry2( /*#__PURE__*/_complement( /*#__PURE__*/_dispatchable(['any'], _xany, any)));\nexport default none;","import _curry1 from './internal/_curry1';\nimport curryN from './curryN';\nimport nth from './nth';\n\n/**\n * Returns a function which returns its nth argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig Number -> *... -> *\n * @param {Number} n\n * @return {Function}\n * @example\n *\n *      R.nthArg(1)('a', 'b', 'c'); //=> 'b'\n *      R.nthArg(-1)('a', 'b', 'c'); //=> 'c'\n * @symb R.nthArg(-1)(a, b, c) = c\n * @symb R.nthArg(0)(a, b, c) = a\n * @symb R.nthArg(1)(a, b, c) = b\n */\nvar nthArg = /*#__PURE__*/_curry1(function nthArg(n) {\n  var arity = n < 0 ? 1 : n + 1;\n  return curryN(arity, function () {\n    return nth(n, arguments);\n  });\n});\nexport default nthArg;","import _curry3 from './internal/_curry3';\n\n/**\n * `o` is a curried composition function that returns a unary function.\n * Like [`compose`](#compose), `o` performs right-to-left function composition.\n * Unlike [`compose`](#compose), the rightmost function passed to `o` will be\n * invoked with only one argument.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Function\n * @sig (b -> c) -> (a -> b) -> a -> c\n * @param {Function} f\n * @param {Function} g\n * @return {Function}\n * @see R.compose, R.pipe\n * @example\n *\n *      var classyGreeting = name => \"The name's \" + name.last + \", \" + name.first + \" \" + name.last\n *      var yellGreeting = R.o(R.toUpper, classyGreeting);\n *      yellGreeting({first: 'James', last: 'Bond'}); //=> \"THE NAME'S BOND, JAMES BOND\"\n *\n *      R.o(R.multiply(10), R.add(10))(-4) //=> 60\n *\n * @symb R.o(f, g, x) = f(g(x))\n */\nvar o = /*#__PURE__*/_curry3(function o(f, g, x) {\n  return f(g(x));\n});\nexport default o;","export default function _of(x) {\n  return [x];\n}","import _curry1 from './internal/_curry1';\nimport _of from './internal/_of';\n\n/**\n * Returns a singleton array containing the value provided.\n *\n * Note this `of` is different from the ES6 `of`; See\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/of\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig a -> [a]\n * @param {*} x any value\n * @return {Array} An array wrapping `x`.\n * @example\n *\n *      R.of(null); //=> [null]\n *      R.of([42]); //=> [[42]]\n */\nvar of = /*#__PURE__*/_curry1(_of);\nexport default of;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns a partial copy of an object omitting the keys specified.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [String] -> {String: *} -> {String: *}\n * @param {Array} names an array of String property names to omit from the new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with properties from `names` not on it.\n * @see R.pick\n * @example\n *\n *      R.omit(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, c: 3}\n */\nvar omit = /*#__PURE__*/_curry2(function omit(names, obj) {\n  var result = {};\n  var index = {};\n  var idx = 0;\n  var len = names.length;\n\n  while (idx < len) {\n    index[names[idx]] = 1;\n    idx += 1;\n  }\n\n  for (var prop in obj) {\n    if (!index.hasOwnProperty(prop)) {\n      result[prop] = obj[prop];\n    }\n  }\n  return result;\n});\nexport default omit;","import _arity from './internal/_arity';\nimport _curry1 from './internal/_curry1';\n\n/**\n * Accepts a function `fn` and returns a function that guards invocation of\n * `fn` such that `fn` can only ever be called once, no matter how many times\n * the returned function is invoked. The first value calculated is returned in\n * subsequent invocations.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a... -> b) -> (a... -> b)\n * @param {Function} fn The function to wrap in a call-only-once wrapper.\n * @return {Function} The wrapped function.\n * @example\n *\n *      var addOneOnce = R.once(x => x + 1);\n *      addOneOnce(10); //=> 11\n *      addOneOnce(addOneOnce(50)); //=> 11\n */\nvar once = /*#__PURE__*/_curry1(function once(fn) {\n  var called = false;\n  var result;\n  return _arity(fn.length, function () {\n    if (called) {\n      return result;\n    }\n    called = true;\n    result = fn.apply(this, arguments);\n    return result;\n  });\n});\nexport default once;","import _curry3 from './internal/_curry3';\n\n// `Identity` is a functor that holds a single value, where `map` simply\n// transforms the held value with the provided function.\nvar Identity = function (x) {\n  return { value: x, map: function (f) {\n      return Identity(f(x));\n    } };\n};\n\n/**\n * Returns the result of \"setting\" the portion of the given data structure\n * focused by the given lens to the result of applying the given function to\n * the focused value.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> (a -> a) -> s -> s\n * @param {Lens} lens\n * @param {*} v\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n *      var headLens = R.lensIndex(0);\n *\n *      R.over(headLens, R.toUpper, ['foo', 'bar', 'baz']); //=> ['FOO', 'bar', 'baz']\n */\nvar over = /*#__PURE__*/_curry3(function over(lens, f, x) {\n  // The value returned by the getter function is first transformed with `f`,\n  // then set as the value of an `Identity`. This is then mapped over with the\n  // setter function of the lens.\n  return lens(function (y) {\n    return Identity(f(y));\n  })(x).value;\n});\nexport default over;","import _curry2 from './internal/_curry2';\n\n/**\n * Takes two arguments, `fst` and `snd`, and returns `[fst, snd]`.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category List\n * @sig a -> b -> (a,b)\n * @param {*} fst\n * @param {*} snd\n * @return {Array}\n * @see R.objOf, R.of\n * @example\n *\n *      R.pair('foo', 'bar'); //=> ['foo', 'bar']\n */\nvar pair = /*#__PURE__*/_curry2(function pair(fst, snd) {\n  return [fst, snd];\n});\nexport default pair;","import _arity from './_arity';\nimport _curry2 from './_curry2';\n\nexport default function _createPartialApplicator(concat) {\n  return _curry2(function (fn, args) {\n    return _arity(Math.max(0, fn.length - args.length), function () {\n      return fn.apply(this, concat(args, arguments));\n    });\n  });\n}","import _concat from './internal/_concat';\nimport _createPartialApplicator from './internal/_createPartialApplicator';\n\n/**\n * Takes a function `f` and a list of arguments, and returns a function `g`.\n * When applied, `g` returns the result of applying `f` to the arguments\n * provided initially followed by the arguments provided to `g`.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a, b, c, ..., n) -> x) -> [a, b, c, ...] -> ((d, e, f, ..., n) -> x)\n * @param {Function} f\n * @param {Array} args\n * @return {Function}\n * @see R.partialRight\n * @example\n *\n *      var multiply2 = (a, b) => a * b;\n *      var double = R.partial(multiply2, [2]);\n *      double(2); //=> 4\n *\n *      var greet = (salutation, title, firstName, lastName) =>\n *        salutation + ', ' + title + ' ' + firstName + ' ' + lastName + '!';\n *\n *      var sayHello = R.partial(greet, ['Hello']);\n *      var sayHelloToMs = R.partial(sayHello, ['Ms.']);\n *      sayHelloToMs('Jane', 'Jones'); //=> 'Hello, Ms. Jane Jones!'\n * @symb R.partial(f, [a, b])(c, d) = f(a, b, c, d)\n */\nvar partial = /*#__PURE__*/_createPartialApplicator(_concat);\nexport default partial;","import _concat from './internal/_concat';\nimport _createPartialApplicator from './internal/_createPartialApplicator';\nimport flip from './flip';\n\n/**\n * Takes a function `f` and a list of arguments, and returns a function `g`.\n * When applied, `g` returns the result of applying `f` to the arguments\n * provided to `g` followed by the arguments provided initially.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a, b, c, ..., n) -> x) -> [d, e, f, ..., n] -> ((a, b, c, ...) -> x)\n * @param {Function} f\n * @param {Array} args\n * @return {Function}\n * @see R.partial\n * @example\n *\n *      var greet = (salutation, title, firstName, lastName) =>\n *        salutation + ', ' + title + ' ' + firstName + ' ' + lastName + '!';\n *\n *      var greetMsJaneJones = R.partialRight(greet, ['Ms.', 'Jane', 'Jones']);\n *\n *      greetMsJaneJones('Hello'); //=> 'Hello, Ms. Jane Jones!'\n * @symb R.partialRight(f, [a, b])(c, d) = f(c, d, a, b)\n */\nvar partialRight = /*#__PURE__*/_createPartialApplicator( /*#__PURE__*/flip(_concat));\nexport default partialRight;","import filter from './filter';\nimport juxt from './juxt';\nimport reject from './reject';\n\n/**\n * Takes a predicate and a list or other `Filterable` object and returns the\n * pair of filterable objects of the same type of elements which do and do not\n * satisfy, the predicate, respectively. Filterable objects include plain objects or any object\n * that has a filter method such as `Array`.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> [f a, f a]\n * @param {Function} pred A predicate to determine which side the element belongs to.\n * @param {Array} filterable the list (or other filterable) to partition.\n * @return {Array} An array, containing first the subset of elements that satisfy the\n *         predicate, and second the subset of elements that do not satisfy.\n * @see R.filter, R.reject\n * @example\n *\n *      R.partition(R.contains('s'), ['sss', 'ttt', 'foo', 'bars']);\n *      // => [ [ 'sss', 'bars' ],  [ 'ttt', 'foo' ] ]\n *\n *      R.partition(R.contains('s'), { a: 'sss', b: 'ttt', foo: 'bars' });\n *      // => [ { a: 'sss', foo: 'bars' }, { b: 'ttt' }  ]\n */\nvar partition = /*#__PURE__*/juxt([filter, reject]);\nexport default partition;","import _curry3 from './internal/_curry3';\nimport equals from './equals';\nimport path from './path';\n\n/**\n * Determines whether a nested path on an object has a specific value, in\n * [`R.equals`](#equals) terms. Most likely used to filter a list.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Relation\n * @typedefn Idx = String | Int\n * @sig [Idx] -> a -> {a} -> Boolean\n * @param {Array} path The path of the nested property to use\n * @param {*} val The value to compare the nested property with\n * @param {Object} obj The object to check the nested property in\n * @return {Boolean} `true` if the value equals the nested object property,\n *         `false` otherwise.\n * @example\n *\n *      var user1 = { address: { zipCode: 90210 } };\n *      var user2 = { address: { zipCode: 55555 } };\n *      var user3 = { name: 'Bob' };\n *      var users = [ user1, user2, user3 ];\n *      var isFamous = R.pathEq(['address', 'zipCode'], 90210);\n *      R.filter(isFamous, users); //=> [ user1 ]\n */\nvar pathEq = /*#__PURE__*/_curry3(function pathEq(_path, val, obj) {\n  return equals(path(_path, obj), val);\n});\nexport default pathEq;","import _curry3 from './internal/_curry3';\nimport defaultTo from './defaultTo';\nimport path from './path';\n\n/**\n * If the given, non-null object has a value at the given path, returns the\n * value at that path. Otherwise returns the provided default value.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Object\n * @typedefn Idx = String | Int\n * @sig a -> [Idx] -> {a} -> a\n * @param {*} d The default value.\n * @param {Array} p The path to use.\n * @param {Object} obj The object to retrieve the nested property from.\n * @return {*} The data at `path` of the supplied object or the default value.\n * @example\n *\n *      R.pathOr('N/A', ['a', 'b'], {a: {b: 2}}); //=> 2\n *      R.pathOr('N/A', ['a', 'b'], {c: {b: 2}}); //=> \"N/A\"\n */\nvar pathOr = /*#__PURE__*/_curry3(function pathOr(d, p, obj) {\n  return defaultTo(d, path(p, obj));\n});\nexport default pathOr;","import _curry3 from './internal/_curry3';\nimport path from './path';\n\n/**\n * Returns `true` if the specified object property at given path satisfies the\n * given predicate; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Logic\n * @typedefn Idx = String | Int\n * @sig (a -> Boolean) -> [Idx] -> {a} -> Boolean\n * @param {Function} pred\n * @param {Array} propPath\n * @param {*} obj\n * @return {Boolean}\n * @see R.propSatisfies, R.path\n * @example\n *\n *      R.pathSatisfies(y => y > 0, ['x', 'y'], {x: {y: 2}}); //=> true\n */\nvar pathSatisfies = /*#__PURE__*/_curry3(function pathSatisfies(pred, propPath, obj) {\n  return propPath.length > 0 && pred(path(propPath, obj));\n});\nexport default pathSatisfies;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns a partial copy of an object containing only the keys specified. If\n * the key does not exist, the property is ignored.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> {k: v}\n * @param {Array} names an array of String property names to copy onto a new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties from `names` on it.\n * @see R.omit, R.props\n * @example\n *\n *      R.pick(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}\n *      R.pick(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1}\n */\nvar pick = /*#__PURE__*/_curry2(function pick(names, obj) {\n  var result = {};\n  var idx = 0;\n  while (idx < names.length) {\n    if (names[idx] in obj) {\n      result[names[idx]] = obj[names[idx]];\n    }\n    idx += 1;\n  }\n  return result;\n});\nexport default pick;","import _curry2 from './internal/_curry2';\n\n/**\n * Similar to `pick` except that this one includes a `key: undefined` pair for\n * properties that don't exist.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> {k: v}\n * @param {Array} names an array of String property names to copy onto a new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties from `names` on it.\n * @see R.pick\n * @example\n *\n *      R.pickAll(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}\n *      R.pickAll(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, e: undefined, f: undefined}\n */\nvar pickAll = /*#__PURE__*/_curry2(function pickAll(names, obj) {\n  var result = {};\n  var idx = 0;\n  var len = names.length;\n  while (idx < len) {\n    var name = names[idx];\n    result[name] = obj[name];\n    idx += 1;\n  }\n  return result;\n});\nexport default pickAll;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns a partial copy of an object containing only the keys that satisfy\n * the supplied predicate.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @sig ((v, k) -> Boolean) -> {k: v} -> {k: v}\n * @param {Function} pred A predicate to determine whether or not a key\n *        should be included on the output object.\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties that satisfy `pred`\n *         on it.\n * @see R.pick, R.filter\n * @example\n *\n *      var isUpperCase = (val, key) => key.toUpperCase() === key;\n *      R.pickBy(isUpperCase, {a: 1, b: 2, A: 3, B: 4}); //=> {A: 3, B: 4}\n */\nvar pickBy = /*#__PURE__*/_curry2(function pickBy(test, obj) {\n  var result = {};\n  for (var prop in obj) {\n    if (test(obj[prop], prop, obj)) {\n      result[prop] = obj[prop];\n    }\n  }\n  return result;\n});\nexport default pickBy;","import composeK from './composeK';\nimport reverse from './reverse';\n\n/**\n * Returns the left-to-right Kleisli composition of the provided functions,\n * each of which must return a value of a type supported by [`chain`](#chain).\n *\n * `R.pipeK(f, g, h)` is equivalent to `R.pipe(f, R.chain(g), R.chain(h))`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Function\n * @sig Chain m => ((a -> m b), (b -> m c), ..., (y -> m z)) -> (a -> m z)\n * @param {...Function}\n * @return {Function}\n * @see R.composeK\n * @example\n *\n *      //  parseJson :: String -> Maybe *\n *      //  get :: String -> Object -> Maybe *\n *\n *      //  getStateCode :: Maybe String -> Maybe String\n *      var getStateCode = R.pipeK(\n *        parseJson,\n *        get('user'),\n *        get('address'),\n *        get('state'),\n *        R.compose(Maybe.of, R.toUpper)\n *      );\n *\n *      getStateCode('{\"user\":{\"address\":{\"state\":\"ny\"}}}');\n *      //=> Just('NY')\n *      getStateCode('[Invalid JSON]');\n *      //=> Nothing()\n * @symb R.pipeK(f, g, h)(a) = R.chain(h, R.chain(g, f(a)))\n */\nexport default function pipeK() {\n  if (arguments.length === 0) {\n    throw new Error('pipeK requires at least one argument');\n  }\n  return composeK.apply(this, reverse(arguments));\n}","import _concat from './internal/_concat';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Returns a new list with the given element at the front, followed by the\n * contents of the list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} el The item to add to the head of the output list.\n * @param {Array} list The array to add to the tail of the output list.\n * @return {Array} A new array.\n * @see R.append\n * @example\n *\n *      R.prepend('fee', ['fi', 'fo', 'fum']); //=> ['fee', 'fi', 'fo', 'fum']\n */\nvar prepend = /*#__PURE__*/_curry2(function prepend(el, list) {\n  return _concat([el], list);\n});\nexport default prepend;","import multiply from './multiply';\nimport reduce from './reduce';\n\n/**\n * Multiplies together all the elements of a list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list An array of numbers\n * @return {Number} The product of all the numbers in the list.\n * @see R.reduce\n * @example\n *\n *      R.product([2,4,6,8,100,1]); //=> 38400\n */\nvar product = /*#__PURE__*/reduce(multiply, 1);\nexport default product;","import _curry2 from './internal/_curry2';\nimport curryN from './curryN';\n\n/**\n * Accepts a function `fn` and a list of transformer functions and returns a\n * new curried function. When the new function is invoked, it calls the\n * function `fn` with parameters consisting of the result of calling each\n * supplied handler on successive arguments to the new function.\n *\n * If more arguments are passed to the returned function than transformer\n * functions, those arguments are passed directly to `fn` as additional\n * parameters. If you expect additional arguments that don't need to be\n * transformed, although you can ignore them, it's best to pass an identity\n * function so that the new function reports the correct arity.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig ((x1, x2, ...) -> z) -> [(a -> x1), (b -> x2), ...] -> (a -> b -> ... -> z)\n * @param {Function} fn The function to wrap.\n * @param {Array} transformers A list of transformer functions\n * @return {Function} The wrapped function.\n * @see R.converge\n * @example\n *\n *      R.useWith(Math.pow, [R.identity, R.identity])(3, 4); //=> 81\n *      R.useWith(Math.pow, [R.identity, R.identity])(3)(4); //=> 81\n *      R.useWith(Math.pow, [R.dec, R.inc])(3, 4); //=> 32\n *      R.useWith(Math.pow, [R.dec, R.inc])(3)(4); //=> 32\n * @symb R.useWith(f, [g, h])(a, b) = f(g(a), h(b))\n */\nvar useWith = /*#__PURE__*/_curry2(function useWith(fn, transformers) {\n  return curryN(transformers.length, function () {\n    var args = [];\n    var idx = 0;\n    while (idx < transformers.length) {\n      args.push(transformers[idx].call(this, arguments[idx]));\n      idx += 1;\n    }\n    return fn.apply(this, args.concat(Array.prototype.slice.call(arguments, transformers.length)));\n  });\n});\nexport default useWith;","import _map from './internal/_map';\nimport identity from './identity';\nimport pickAll from './pickAll';\nimport useWith from './useWith';\n\n/**\n * Reasonable analog to SQL `select` statement.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @category Relation\n * @sig [k] -> [{k: v}] -> [{k: v}]\n * @param {Array} props The property names to project\n * @param {Array} objs The objects to query\n * @return {Array} An array of objects with just the `props` properties.\n * @example\n *\n *      var abby = {name: 'Abby', age: 7, hair: 'blond', grade: 2};\n *      var fred = {name: 'Fred', age: 12, hair: 'brown', grade: 7};\n *      var kids = [abby, fred];\n *      R.project(['name', 'grade'], kids); //=> [{name: 'Abby', grade: 2}, {name: 'Fred', grade: 7}]\n */\nvar project = /*#__PURE__*/useWith(_map, [pickAll, identity]); // passing `identity` gives correct arity\nexport default project;","import _curry3 from './internal/_curry3';\nimport equals from './equals';\n\n/**\n * Returns `true` if the specified object property is equal, in\n * [`R.equals`](#equals) terms, to the given value; `false` otherwise.\n * You can test multiple properties with [`R.where`](#where).\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig String -> a -> Object -> Boolean\n * @param {String} name\n * @param {*} val\n * @param {*} obj\n * @return {Boolean}\n * @see R.whereEq, R.propSatisfies, R.equals\n * @example\n *\n *      var abby = {name: 'Abby', age: 7, hair: 'blond'};\n *      var fred = {name: 'Fred', age: 12, hair: 'brown'};\n *      var rusty = {name: 'Rusty', age: 10, hair: 'brown'};\n *      var alois = {name: 'Alois', age: 15, disposition: 'surly'};\n *      var kids = [abby, fred, rusty, alois];\n *      var hasBrownHair = R.propEq('hair', 'brown');\n *      R.filter(hasBrownHair, kids); //=> [fred, rusty]\n */\nvar propEq = /*#__PURE__*/_curry3(function propEq(name, val, obj) {\n  return equals(val, obj[name]);\n});\nexport default propEq;","import _curry3 from './internal/_curry3';\nimport is from './is';\n\n/**\n * Returns `true` if the specified object property is of the given type;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Type\n * @sig Type -> String -> Object -> Boolean\n * @param {Function} type\n * @param {String} name\n * @param {*} obj\n * @return {Boolean}\n * @see R.is, R.propSatisfies\n * @example\n *\n *      R.propIs(Number, 'x', {x: 1, y: 2});  //=> true\n *      R.propIs(Number, 'x', {x: 'foo'});    //=> false\n *      R.propIs(Number, 'x', {});            //=> false\n */\nvar propIs = /*#__PURE__*/_curry3(function propIs(type, name, obj) {\n  return is(type, obj[name]);\n});\nexport default propIs;","import _curry3 from './internal/_curry3';\nimport _has from './internal/_has';\n\n/**\n * If the given, non-null object has an own property with the specified name,\n * returns the value of that property. Otherwise returns the provided default\n * value.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Object\n * @sig a -> String -> Object -> a\n * @param {*} val The default value.\n * @param {String} p The name of the property to return.\n * @param {Object} obj The object to query.\n * @return {*} The value of given property of the supplied object or the default value.\n * @example\n *\n *      var alice = {\n *        name: 'ALICE',\n *        age: 101\n *      };\n *      var favorite = R.prop('favoriteLibrary');\n *      var favoriteWithDefault = R.propOr('Ramda', 'favoriteLibrary');\n *\n *      favorite(alice);  //=> undefined\n *      favoriteWithDefault(alice);  //=> 'Ramda'\n */\nvar propOr = /*#__PURE__*/_curry3(function propOr(val, p, obj) {\n  return obj != null && _has(p, obj) ? obj[p] : val;\n});\nexport default propOr;","import _curry3 from './internal/_curry3';\n\n/**\n * Returns `true` if the specified object property satisfies the given\n * predicate; `false` otherwise. You can test multiple properties with\n * [`R.where`](#where).\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Logic\n * @sig (a -> Boolean) -> String -> {String: a} -> Boolean\n * @param {Function} pred\n * @param {String} name\n * @param {*} obj\n * @return {Boolean}\n * @see R.where, R.propEq, R.propIs\n * @example\n *\n *      R.propSatisfies(x => x > 0, 'x', {x: 1, y: 2}); //=> true\n */\nvar propSatisfies = /*#__PURE__*/_curry3(function propSatisfies(pred, name, obj) {\n  return pred(obj[name]);\n});\nexport default propSatisfies;","import _curry2 from './internal/_curry2';\n\n/**\n * Acts as multiple `prop`: array of keys in, array of values out. Preserves\n * order.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> [v]\n * @param {Array} ps The property names to fetch\n * @param {Object} obj The object to query\n * @return {Array} The corresponding values or partially applied function.\n * @example\n *\n *      R.props(['x', 'y'], {x: 1, y: 2}); //=> [1, 2]\n *      R.props(['c', 'a', 'b'], {b: 2, a: 1}); //=> [undefined, 1, 2]\n *\n *      var fullName = R.compose(R.join(' '), R.props(['first', 'last']));\n *      fullName({last: 'Bullet-Tooth', age: 33, first: 'Tony'}); //=> 'Tony Bullet-Tooth'\n */\nvar props = /*#__PURE__*/_curry2(function props(ps, obj) {\n  var len = ps.length;\n  var out = [];\n  var idx = 0;\n\n  while (idx < len) {\n    out[idx] = obj[ps[idx]];\n    idx += 1;\n  }\n\n  return out;\n});\nexport default props;","import _curry2 from './internal/_curry2';\nimport _isNumber from './internal/_isNumber';\n\n/**\n * Returns a list of numbers from `from` (inclusive) to `to` (exclusive).\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> Number -> [Number]\n * @param {Number} from The first number in the list.\n * @param {Number} to One more than the last number in the list.\n * @return {Array} The list of numbers in tthe set `[a, b)`.\n * @example\n *\n *      R.range(1, 5);    //=> [1, 2, 3, 4]\n *      R.range(50, 53);  //=> [50, 51, 52]\n */\nvar range = /*#__PURE__*/_curry2(function range(from, to) {\n  if (!(_isNumber(from) && _isNumber(to))) {\n    throw new TypeError('Both arguments to range must be numbers');\n  }\n  var result = [];\n  var n = from;\n  while (n < to) {\n    result.push(n);\n    n += 1;\n  }\n  return result;\n});\nexport default range;","import _curry3 from './internal/_curry3';\n\n/**\n * Returns a single item by iterating through the list, successively calling\n * the iterator function and passing it an accumulator value and the current\n * value from the array, and then passing the result to the next call.\n *\n * Similar to [`reduce`](#reduce), except moves through the input list from the\n * right to the left.\n *\n * The iterator function receives two values: *(value, acc)*, while the arguments'\n * order of `reduce`'s iterator function is *(acc, value)*.\n *\n * Note: `R.reduceRight` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.reduceRight` method. For more details\n * on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduceRight#Description\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, b) -> b) -> b -> [a] -> b\n * @param {Function} fn The iterator function. Receives two values, the current element from the array\n *        and the accumulator.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduce, R.addIndex\n * @example\n *\n *      R.reduceRight(R.subtract, 0, [1, 2, 3, 4]) // => (1 - (2 - (3 - (4 - 0)))) = -2\n *      //    -               -2\n *      //   / \\              / \\\n *      //  1   -            1   3\n *      //     / \\              / \\\n *      //    2   -     ==>    2  -1\n *      //       / \\              / \\\n *      //      3   -            3   4\n *      //         / \\              / \\\n *      //        4   0            4   0\n *\n * @symb R.reduceRight(f, a, [b, c, d]) = f(b, f(c, f(d, a)))\n */\nvar reduceRight = /*#__PURE__*/_curry3(function reduceRight(fn, acc, list) {\n  var idx = list.length - 1;\n  while (idx >= 0) {\n    acc = fn(list[idx], acc);\n    idx -= 1;\n  }\n  return acc;\n});\nexport default reduceRight;","import _curryN from './internal/_curryN';\nimport _reduce from './internal/_reduce';\nimport _reduced from './internal/_reduced';\n\n/**\n * Like [`reduce`](#reduce), `reduceWhile` returns a single item by iterating\n * through the list, successively calling the iterator function. `reduceWhile`\n * also takes a predicate that is evaluated before each step. If the predicate\n * returns `false`, it \"short-circuits\" the iteration and returns the current\n * value of the accumulator.\n *\n * @func\n * @memberOf R\n * @since v0.22.0\n * @category List\n * @sig ((a, b) -> Boolean) -> ((a, b) -> a) -> a -> [b] -> a\n * @param {Function} pred The predicate. It is passed the accumulator and the\n *        current element.\n * @param {Function} fn The iterator function. Receives two values, the\n *        accumulator and the current element.\n * @param {*} a The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduce, R.reduced\n * @example\n *\n *      var isOdd = (acc, x) => x % 2 === 1;\n *      var xs = [1, 3, 5, 60, 777, 800];\n *      R.reduceWhile(isOdd, R.add, 0, xs); //=> 9\n *\n *      var ys = [2, 4, 6]\n *      R.reduceWhile(isOdd, R.add, 111, ys); //=> 111\n */\nvar reduceWhile = /*#__PURE__*/_curryN(4, [], function _reduceWhile(pred, fn, a, list) {\n  return _reduce(function (acc, x) {\n    return pred(acc, x) ? fn(acc, x) : _reduced(acc);\n  }, a, list);\n});\nexport default reduceWhile;","import _curry1 from './internal/_curry1';\nimport _reduced from './internal/_reduced';\n\n/**\n * Returns a value wrapped to indicate that it is the final value of the reduce\n * and transduce functions. The returned value should be considered a black\n * box: the internal structure is not guaranteed to be stable.\n *\n * Note: this optimization is unavailable to functions not explicitly listed\n * above. For instance, it is not currently supported by\n * [`reduceRight`](#reduceRight).\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category List\n * @sig a -> *\n * @param {*} x The final value of the reduce.\n * @return {*} The wrapped value.\n * @see R.reduce, R.transduce\n * @example\n *\n *     R.reduce(\n *       (acc, item) => item > 3 ? R.reduced(acc) : acc.concat(item),\n *       [],\n *       [1, 2, 3, 4, 5]) // [1, 2, 3]\n */\nvar reduced = /*#__PURE__*/_curry1(_reduced);\nexport default reduced;","import _curry2 from './internal/_curry2';\n\n/**\n * Calls an input function `n` times, returning an array containing the results\n * of those function calls.\n *\n * `fn` is passed one argument: The current value of `n`, which begins at `0`\n * and is gradually incremented to `n - 1`.\n *\n * @func\n * @memberOf R\n * @since v0.2.3\n * @category List\n * @sig (Number -> a) -> Number -> [a]\n * @param {Function} fn The function to invoke. Passed one argument, the current value of `n`.\n * @param {Number} n A value between `0` and `n - 1`. Increments after each function call.\n * @return {Array} An array containing the return values of all calls to `fn`.\n * @see R.repeat\n * @example\n *\n *      R.times(R.identity, 5); //=> [0, 1, 2, 3, 4]\n * @symb R.times(f, 0) = []\n * @symb R.times(f, 1) = [f(0)]\n * @symb R.times(f, 2) = [f(0), f(1)]\n */\nvar times = /*#__PURE__*/_curry2(function times(fn, n) {\n  var len = Number(n);\n  var idx = 0;\n  var list;\n\n  if (len < 0 || isNaN(len)) {\n    throw new RangeError('n must be a non-negative number');\n  }\n  list = new Array(len);\n  while (idx < len) {\n    list[idx] = fn(idx);\n    idx += 1;\n  }\n  return list;\n});\nexport default times;","import _curry2 from './internal/_curry2';\nimport always from './always';\nimport times from './times';\n\n/**\n * Returns a fixed list of size `n` containing a specified identical value.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig a -> n -> [a]\n * @param {*} value The value to repeat.\n * @param {Number} n The desired size of the output list.\n * @return {Array} A new array containing `n` `value`s.\n * @see R.times\n * @example\n *\n *      R.repeat('hi', 5); //=> ['hi', 'hi', 'hi', 'hi', 'hi']\n *\n *      var obj = {};\n *      var repeatedObjs = R.repeat(obj, 5); //=> [{}, {}, {}, {}, {}]\n *      repeatedObjs[0] === repeatedObjs[1]; //=> true\n * @symb R.repeat(a, 0) = []\n * @symb R.repeat(a, 1) = [a]\n * @symb R.repeat(a, 2) = [a, a]\n */\nvar repeat = /*#__PURE__*/_curry2(function repeat(value, n) {\n  return times(always(value), n);\n});\nexport default repeat;","import _curry3 from './internal/_curry3';\n\n/**\n * Replace a substring or regex match in a string with a replacement.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category String\n * @sig RegExp|String -> String -> String -> String\n * @param {RegExp|String} pattern A regular expression or a substring to match.\n * @param {String} replacement The string to replace the matches with.\n * @param {String} str The String to do the search and replacement in.\n * @return {String} The result.\n * @example\n *\n *      R.replace('foo', 'bar', 'foo foo foo'); //=> 'bar foo foo'\n *      R.replace(/foo/, 'bar', 'foo foo foo'); //=> 'bar foo foo'\n *\n *      // Use the \"g\" (global) flag to replace all occurrences:\n *      R.replace(/foo/g, 'bar', 'foo foo foo'); //=> 'bar bar bar'\n */\nvar replace = /*#__PURE__*/_curry3(function replace(regex, replacement, str) {\n  return str.replace(regex, replacement);\n});\nexport default replace;","import _curry3 from './internal/_curry3';\n\n/**\n * Scan is similar to [`reduce`](#reduce), but returns a list of successively\n * reduced values from the left\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig ((a, b) -> a) -> a -> [b] -> [a]\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n *        current element from the array\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {Array} A list of all intermediately reduced values.\n * @see R.reduce\n * @example\n *\n *      var numbers = [1, 2, 3, 4];\n *      var factorials = R.scan(R.multiply, 1, numbers); //=> [1, 1, 2, 6, 24]\n * @symb R.scan(f, a, [b, c]) = [a, f(a, b), f(f(a, b), c)]\n */\nvar scan = /*#__PURE__*/_curry3(function scan(fn, acc, list) {\n  var idx = 0;\n  var len = list.length;\n  var result = [acc];\n  while (idx < len) {\n    acc = fn(acc, list[idx]);\n    result[idx + 1] = acc;\n    idx += 1;\n  }\n  return result;\n});\nexport default scan;","import _curry2 from './internal/_curry2';\nimport ap from './ap';\nimport map from './map';\nimport prepend from './prepend';\nimport reduceRight from './reduceRight';\n\n/**\n * Transforms a [Traversable](https://github.com/fantasyland/fantasy-land#traversable)\n * of [Applicative](https://github.com/fantasyland/fantasy-land#applicative) into an\n * Applicative of Traversable.\n *\n * Dispatches to the `sequence` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (Applicative f, Traversable t) => (a -> f a) -> t (f a) -> f (t a)\n * @param {Function} of\n * @param {*} traversable\n * @return {*}\n * @see R.traverse\n * @example\n *\n *      R.sequence(Maybe.of, [Just(1), Just(2), Just(3)]);   //=> Just([1, 2, 3])\n *      R.sequence(Maybe.of, [Just(1), Just(2), Nothing()]); //=> Nothing()\n *\n *      R.sequence(R.of, Just([1, 2, 3])); //=> [Just(1), Just(2), Just(3)]\n *      R.sequence(R.of, Nothing());       //=> [Nothing()]\n */\nvar sequence = /*#__PURE__*/_curry2(function sequence(of, traversable) {\n  return typeof traversable.sequence === 'function' ? traversable.sequence(of) : reduceRight(function (x, acc) {\n    return ap(map(prepend, x), acc);\n  }, of([]), traversable);\n});\nexport default sequence;","import _curry3 from './internal/_curry3';\nimport always from './always';\nimport over from './over';\n\n/**\n * Returns the result of \"setting\" the portion of the given data structure\n * focused by the given lens to the given value.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> a -> s -> s\n * @param {Lens} lens\n * @param {*} v\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n *      var xLens = R.lensProp('x');\n *\n *      R.set(xLens, 4, {x: 1, y: 2});  //=> {x: 4, y: 2}\n *      R.set(xLens, 8, {x: 1, y: 2});  //=> {x: 8, y: 2}\n */\nvar set = /*#__PURE__*/_curry3(function set(lens, v, x) {\n  return over(lens, always(v), x);\n});\nexport default set;","import _curry2 from './internal/_curry2';\n\n/**\n * Returns a copy of the list, sorted according to the comparator function,\n * which should accept two values at a time and return a negative number if the\n * first value is smaller, a positive number if it's larger, and zero if they\n * are equal. Please note that this is a **copy** of the list. It does not\n * modify the original.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, a) -> Number) -> [a] -> [a]\n * @param {Function} comparator A sorting function :: a -> b -> Int\n * @param {Array} list The list to sort\n * @return {Array} a new array with its elements sorted by the comparator function.\n * @example\n *\n *      var diff = function(a, b) { return a - b; };\n *      R.sort(diff, [4,2,7,5]); //=> [2, 4, 5, 7]\n */\nvar sort = /*#__PURE__*/_curry2(function sort(comparator, list) {\n  return Array.prototype.slice.call(list, 0).sort(comparator);\n});\nexport default sort;","import _curry2 from './internal/_curry2';\n\n/**\n * Sorts the list according to the supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord b => (a -> b) -> [a] -> [a]\n * @param {Function} fn\n * @param {Array} list The list to sort.\n * @return {Array} A new list sorted by the keys generated by `fn`.\n * @example\n *\n *      var sortByFirstItem = R.sortBy(R.prop(0));\n *      var sortByNameCaseInsensitive = R.sortBy(R.compose(R.toLower, R.prop('name')));\n *      var pairs = [[-1, 1], [-2, 2], [-3, 3]];\n *      sortByFirstItem(pairs); //=> [[-3, 3], [-2, 2], [-1, 1]]\n *      var alice = {\n *        name: 'ALICE',\n *        age: 101\n *      };\n *      var bob = {\n *        name: 'Bob',\n *        age: -10\n *      };\n *      var clara = {\n *        name: 'clara',\n *        age: 314.159\n *      };\n *      var people = [clara, bob, alice];\n *      sortByNameCaseInsensitive(people); //=> [alice, bob, clara]\n */\nvar sortBy = /*#__PURE__*/_curry2(function sortBy(fn, list) {\n  return Array.prototype.slice.call(list, 0).sort(function (a, b) {\n    var aa = fn(a);\n    var bb = fn(b);\n    return aa < bb ? -1 : aa > bb ? 1 : 0;\n  });\n});\nexport default sortBy;","import _curry2 from './internal/_curry2';\n\n/**\n * Sorts a list according to a list of comparators.\n *\n * @func\n * @memberOf R\n * @since v0.23.0\n * @category Relation\n * @sig [(a, a) -> Number] -> [a] -> [a]\n * @param {Array} functions A list of comparator functions.\n * @param {Array} list The list to sort.\n * @return {Array} A new list sorted according to the comarator functions.\n * @example\n *\n *      var alice = {\n *        name: 'alice',\n *        age: 40\n *      };\n *      var bob = {\n *        name: 'bob',\n *        age: 30\n *      };\n *      var clara = {\n *        name: 'clara',\n *        age: 40\n *      };\n *      var people = [clara, bob, alice];\n *      var ageNameSort = R.sortWith([\n *        R.descend(R.prop('age')),\n *        R.ascend(R.prop('name'))\n *      ]);\n *      ageNameSort(people); //=> [alice, clara, bob]\n */\nvar sortWith = /*#__PURE__*/_curry2(function sortWith(fns, list) {\n  return Array.prototype.slice.call(list, 0).sort(function (a, b) {\n    var result = 0;\n    var i = 0;\n    while (result === 0 && i < fns.length) {\n      result = fns[i](a, b);\n      i += 1;\n    }\n    return result;\n  });\n});\nexport default sortWith;","import invoker from './invoker';\n\n/**\n * Splits a string into an array of strings based on the given\n * separator.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category String\n * @sig (String | RegExp) -> String -> [String]\n * @param {String|RegExp} sep The pattern.\n * @param {String} str The string to separate into an array.\n * @return {Array} The array of strings from `str` separated by `str`.\n * @see R.join\n * @example\n *\n *      var pathComponents = R.split('/');\n *      R.tail(pathComponents('/usr/local/bin/node')); //=> ['usr', 'local', 'bin', 'node']\n *\n *      R.split('.', 'a.b.c.xyz.d'); //=> ['a', 'b', 'c', 'xyz', 'd']\n */\nvar split = /*#__PURE__*/invoker(1, 'split');\nexport default split;","import _curry2 from './internal/_curry2';\nimport length from './length';\nimport slice from './slice';\n\n/**\n * Splits a given list or string at a given index.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig Number -> [a] -> [[a], [a]]\n * @sig Number -> String -> [String, String]\n * @param {Number} index The index where the array/string is split.\n * @param {Array|String} array The array/string to be split.\n * @return {Array}\n * @example\n *\n *      R.splitAt(1, [1, 2, 3]);          //=> [[1], [2, 3]]\n *      R.splitAt(5, 'hello world');      //=> ['hello', ' world']\n *      R.splitAt(-1, 'foobar');          //=> ['fooba', 'r']\n */\nvar splitAt = /*#__PURE__*/_curry2(function splitAt(index, array) {\n  return [slice(0, index, array), slice(index, length(array), array)];\n});\nexport default splitAt;","import _curry2 from './internal/_curry2';\nimport slice from './slice';\n\n/**\n * Splits a collection into slices of the specified length.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [[a]]\n * @sig Number -> String -> [String]\n * @param {Number} n\n * @param {Array} list\n * @return {Array}\n * @example\n *\n *      R.splitEvery(3, [1, 2, 3, 4, 5, 6, 7]); //=> [[1, 2, 3], [4, 5, 6], [7]]\n *      R.splitEvery(3, 'foobarbaz'); //=> ['foo', 'bar', 'baz']\n */\nvar splitEvery = /*#__PURE__*/_curry2(function splitEvery(n, list) {\n  if (n <= 0) {\n    throw new Error('First argument to splitEvery must be a positive integer');\n  }\n  var result = [];\n  var idx = 0;\n  while (idx < list.length) {\n    result.push(slice(idx, idx += n, list));\n  }\n  return result;\n});\nexport default splitEvery;","import _curry2 from './internal/_curry2';\n\n/**\n * Takes a list and a predicate and returns a pair of lists with the following properties:\n *\n *  - the result of concatenating the two output lists is equivalent to the input list;\n *  - none of the elements of the first output list satisfies the predicate; and\n *  - if the second output list is non-empty, its first element satisfies the predicate.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [[a], [a]]\n * @param {Function} pred The predicate that determines where the array is split.\n * @param {Array} list The array to be split.\n * @return {Array}\n * @example\n *\n *      R.splitWhen(R.equals(2), [1, 2, 3, 1, 2, 3]);   //=> [[1], [2, 3, 1, 2, 3]]\n */\nvar splitWhen = /*#__PURE__*/_curry2(function splitWhen(pred, list) {\n  var idx = 0;\n  var len = list.length;\n  var prefix = [];\n\n  while (idx < len && !pred(list[idx])) {\n    prefix.push(list[idx]);\n    idx += 1;\n  }\n\n  return [prefix, Array.prototype.slice.call(list, idx)];\n});\nexport default splitWhen;","import _curry2 from './internal/_curry2';\nimport equals from './equals';\nimport take from './take';\n\n/**\n * Checks if a list starts with the provided values\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category List\n * @sig [a] -> Boolean\n * @sig String -> Boolean\n * @param {*} prefix\n * @param {*} list\n * @return {Boolean}\n * @example\n *\n *      R.startsWith('a', 'abc')                //=> true\n *      R.startsWith('b', 'abc')                //=> false\n *      R.startsWith(['a'], ['a', 'b', 'c'])    //=> true\n *      R.startsWith(['b'], ['a', 'b', 'c'])    //=> false\n */\nvar startsWith = /*#__PURE__*/_curry2(function (prefix, list) {\n  return equals(take(prefix.length, list), prefix);\n});\nexport default startsWith;","import _curry2 from './internal/_curry2';\n\n/**\n * Subtracts its second argument from its first argument.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a - b`.\n * @see R.add\n * @example\n *\n *      R.subtract(10, 8); //=> 2\n *\n *      var minus5 = R.subtract(R.__, 5);\n *      minus5(17); //=> 12\n *\n *      var complementaryAngle = R.subtract(90);\n *      complementaryAngle(30); //=> 60\n *      complementaryAngle(72); //=> 18\n */\nvar subtract = /*#__PURE__*/_curry2(function subtract(a, b) {\n  return Number(a) - Number(b);\n});\nexport default subtract;","import _curry2 from './internal/_curry2';\nimport concat from './concat';\nimport difference from './difference';\n\n/**\n * Finds the set (i.e. no duplicates) of all elements contained in the first or\n * second list, but not both.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` or `list2`, but not both.\n * @see R.symmetricDifferenceWith, R.difference, R.differenceWith\n * @example\n *\n *      R.symmetricDifference([1,2,3,4], [7,6,5,4,3]); //=> [1,2,7,6,5]\n *      R.symmetricDifference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5,1,2]\n */\nvar symmetricDifference = /*#__PURE__*/_curry2(function symmetricDifference(list1, list2) {\n  return concat(difference(list1, list2), difference(list2, list1));\n});\nexport default symmetricDifference;","import _curry3 from './internal/_curry3';\nimport concat from './concat';\nimport differenceWith from './differenceWith';\n\n/**\n * Finds the set (i.e. no duplicates) of all elements contained in the first or\n * second list, but not both. Duplication is determined according to the value\n * returned by applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Relation\n * @sig ((a, a) -> Boolean) -> [a] -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` or `list2`, but not both.\n * @see R.symmetricDifference, R.difference, R.differenceWith\n * @example\n *\n *      var eqA = R.eqBy(R.prop('a'));\n *      var l1 = [{a: 1}, {a: 2}, {a: 3}, {a: 4}];\n *      var l2 = [{a: 3}, {a: 4}, {a: 5}, {a: 6}];\n *      R.symmetricDifferenceWith(eqA, l1, l2); //=> [{a: 1}, {a: 2}, {a: 5}, {a: 6}]\n */\nvar symmetricDifferenceWith = /*#__PURE__*/_curry3(function symmetricDifferenceWith(pred, list1, list2) {\n  return concat(differenceWith(pred, list1, list2), differenceWith(pred, list2, list1));\n});\nexport default symmetricDifferenceWith;","import _curry2 from './internal/_curry2';\nimport slice from './slice';\n\n/**\n * Returns a new list containing the last `n` elements of a given list, passing\n * each value to the supplied predicate function, and terminating when the\n * predicate function returns `false`. Excludes the element that caused the\n * predicate function to fail. The predicate function is passed one argument:\n * *(value)*.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @sig (a -> Boolean) -> String -> String\n * @param {Function} fn The function called per iteration.\n * @param {Array} xs The collection to iterate over.\n * @return {Array} A new array.\n * @see R.dropLastWhile, R.addIndex\n * @example\n *\n *      var isNotOne = x => x !== 1;\n *\n *      R.takeLastWhile(isNotOne, [1, 2, 3, 4]); //=> [2, 3, 4]\n *\n *      R.takeLastWhile(x => x !== 'R' , 'Ramda'); //=> 'amda'\n */\nvar takeLastWhile = /*#__PURE__*/_curry2(function takeLastWhile(fn, xs) {\n  var idx = xs.length - 1;\n  while (idx >= 0 && fn(xs[idx])) {\n    idx -= 1;\n  }\n  return slice(idx + 1, Infinity, xs);\n});\nexport default takeLastWhile;","import _curry2 from './_curry2';\nimport _reduced from './_reduced';\nimport _xfBase from './_xfBase';\n\nvar XTakeWhile = /*#__PURE__*/function () {\n  function XTakeWhile(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XTakeWhile.prototype['@@transducer/init'] = _xfBase.init;\n  XTakeWhile.prototype['@@transducer/result'] = _xfBase.result;\n  XTakeWhile.prototype['@@transducer/step'] = function (result, input) {\n    return this.f(input) ? this.xf['@@transducer/step'](result, input) : _reduced(result);\n  };\n\n  return XTakeWhile;\n}();\n\nvar _xtakeWhile = /*#__PURE__*/_curry2(function _xtakeWhile(f, xf) {\n  return new XTakeWhile(f, xf);\n});\nexport default _xtakeWhile;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xtakeWhile from './internal/_xtakeWhile';\nimport slice from './slice';\n\n/**\n * Returns a new list containing the first `n` elements of a given list,\n * passing each value to the supplied predicate function, and terminating when\n * the predicate function returns `false`. Excludes the element that caused the\n * predicate function to fail. The predicate function is passed one argument:\n * *(value)*.\n *\n * Dispatches to the `takeWhile` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @sig (a -> Boolean) -> String -> String\n * @param {Function} fn The function called per iteration.\n * @param {Array} xs The collection to iterate over.\n * @return {Array} A new array.\n * @see R.dropWhile, R.transduce, R.addIndex\n * @example\n *\n *      var isNotFour = x => x !== 4;\n *\n *      R.takeWhile(isNotFour, [1, 2, 3, 4, 3, 2, 1]); //=> [1, 2, 3]\n *\n *      R.takeWhile(x => x !== 'd' , 'Ramda'); //=> 'Ram'\n */\nvar takeWhile = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['takeWhile'], _xtakeWhile, function takeWhile(fn, xs) {\n  var idx = 0;\n  var len = xs.length;\n  while (idx < len && fn(xs[idx])) {\n    idx += 1;\n  }\n  return slice(0, idx, xs);\n}));\nexport default takeWhile;","import _curry2 from './_curry2';\nimport _xfBase from './_xfBase';\n\nvar XTap = /*#__PURE__*/function () {\n  function XTap(f, xf) {\n    this.xf = xf;\n    this.f = f;\n  }\n  XTap.prototype['@@transducer/init'] = _xfBase.init;\n  XTap.prototype['@@transducer/result'] = _xfBase.result;\n  XTap.prototype['@@transducer/step'] = function (result, input) {\n    this.f(input);\n    return this.xf['@@transducer/step'](result, input);\n  };\n\n  return XTap;\n}();\n\nvar _xtap = /*#__PURE__*/_curry2(function _xtap(f, xf) {\n  return new XTap(f, xf);\n});\nexport default _xtap;","import _curry2 from './internal/_curry2';\nimport _dispatchable from './internal/_dispatchable';\nimport _xtap from './internal/_xtap';\n\n/**\n * Runs the given function with the supplied object, then returns the object.\n *\n * Acts as a transducer if a transformer is given as second parameter.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a -> *) -> a -> a\n * @param {Function} fn The function to call with `x`. The return value of `fn` will be thrown away.\n * @param {*} x\n * @return {*} `x`.\n * @example\n *\n *      var sayX = x => console.log('x is ' + x);\n *      R.tap(sayX, 100); //=> 100\n *      // logs 'x is 100'\n * @symb R.tap(f, a) = a\n */\nvar tap = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xtap, function tap(fn, x) {\n  fn(x);\n  return x;\n}));\nexport default tap;","import _cloneRegExp from './internal/_cloneRegExp';\nimport _curry2 from './internal/_curry2';\nimport _isRegExp from './internal/_isRegExp';\nimport toString from './toString';\n\n/**\n * Determines whether a given string matches a given regular expression.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category String\n * @sig RegExp -> String -> Boolean\n * @param {RegExp} pattern\n * @param {String} str\n * @return {Boolean}\n * @see R.match\n * @example\n *\n *      R.test(/^x/, 'xyz'); //=> true\n *      R.test(/^y/, 'xyz'); //=> false\n */\nvar test = /*#__PURE__*/_curry2(function test(pattern, str) {\n  if (!_isRegExp(pattern)) {\n    throw new TypeError('‘test’ requires a value of type RegExp as its first argument; received ' + toString(pattern));\n  }\n  return _cloneRegExp(pattern).test(str);\n});\nexport default test;","export default function _isRegExp(x) {\n  return Object.prototype.toString.call(x) === '[object RegExp]';\n}","import invoker from './invoker';\n\n/**\n * The lower case version of a string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to lower case.\n * @return {String} The lower case version of `str`.\n * @see R.toUpper\n * @example\n *\n *      R.toLower('XYZ'); //=> 'xyz'\n */\nvar toLower = /*#__PURE__*/invoker(0, 'toLowerCase');\nexport default toLower;","import _curry1 from './internal/_curry1';\nimport _has from './internal/_has';\n\n/**\n * Converts an object into an array of key, value arrays. Only the object's\n * own properties are used.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Object\n * @sig {String: *} -> [[String,*]]\n * @param {Object} obj The object to extract from\n * @return {Array} An array of key, value arrays from the object's own properties.\n * @see R.fromPairs\n * @example\n *\n *      R.toPairs({a: 1, b: 2, c: 3}); //=> [['a', 1], ['b', 2], ['c', 3]]\n */\nvar toPairs = /*#__PURE__*/_curry1(function toPairs(obj) {\n  var pairs = [];\n  for (var prop in obj) {\n    if (_has(prop, obj)) {\n      pairs[pairs.length] = [prop, obj[prop]];\n    }\n  }\n  return pairs;\n});\nexport default toPairs;","import _curry1 from './internal/_curry1';\n\n/**\n * Converts an object into an array of key, value arrays. The object's own\n * properties and prototype properties are used. Note that the order of the\n * output array is not guaranteed to be consistent across different JS\n * platforms.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Object\n * @sig {String: *} -> [[String,*]]\n * @param {Object} obj The object to extract from\n * @return {Array} An array of key, value arrays from the object's own\n *         and prototype properties.\n * @example\n *\n *      var F = function() { this.x = 'X'; };\n *      F.prototype.y = 'Y';\n *      var f = new F();\n *      R.toPairsIn(f); //=> [['x','X'], ['y','Y']]\n */\nvar toPairsIn = /*#__PURE__*/_curry1(function toPairsIn(obj) {\n  var pairs = [];\n  for (var prop in obj) {\n    pairs[pairs.length] = [prop, obj[prop]];\n  }\n  return pairs;\n});\nexport default toPairsIn;","import invoker from './invoker';\n\n/**\n * The upper case version of a string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to upper case.\n * @return {String} The upper case version of `str`.\n * @see R.toLower\n * @example\n *\n *      R.toUpper('abc'); //=> 'ABC'\n */\nvar toUpper = /*#__PURE__*/invoker(0, 'toUpperCase');\nexport default toUpper;","import _reduce from './internal/_reduce';\nimport _xwrap from './internal/_xwrap';\nimport curryN from './curryN';\n\n/**\n * Initializes a transducer using supplied iterator function. Returns a single\n * item by iterating through the list, successively calling the transformed\n * iterator function and passing it an accumulator value and the current value\n * from the array, and then passing the result to the next call.\n *\n * The iterator function receives two values: *(acc, value)*. It will be\n * wrapped as a transformer to initialize the transducer. A transformer can be\n * passed directly in place of an iterator function. In both cases, iteration\n * may be stopped early with the [`R.reduced`](#reduced) function.\n *\n * A transducer is a function that accepts a transformer and returns a\n * transformer and can be composed directly.\n *\n * A transformer is an an object that provides a 2-arity reducing iterator\n * function, step, 0-arity initial value function, init, and 1-arity result\n * extraction function, result. The step function is used as the iterator\n * function in reduce. The result function is used to convert the final\n * accumulator into the return type and in most cases is\n * [`R.identity`](#identity). The init function can be used to provide an\n * initial accumulator, but is ignored by transduce.\n *\n * The iteration is performed with [`R.reduce`](#reduce) after initializing the transducer.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig (c -> c) -> ((a, b) -> a) -> a -> [b] -> a\n * @param {Function} xf The transducer function. Receives a transformer and returns a transformer.\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n *        current element from the array. Wrapped as transformer, if necessary, and used to\n *        initialize the transducer\n * @param {*} acc The initial accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduce, R.reduced, R.into\n * @example\n *\n *      var numbers = [1, 2, 3, 4];\n *      var transducer = R.compose(R.map(R.add(1)), R.take(2));\n *      R.transduce(transducer, R.flip(R.append), [], numbers); //=> [2, 3]\n *\n *      var isOdd = (x) => x % 2 === 1;\n *      var firstOddTransducer = R.compose(R.filter(isOdd), R.take(1));\n *      R.transduce(firstOddTransducer, R.flip(R.append), [], R.range(0, 100)); //=> [1]\n */\nvar transduce = /*#__PURE__*/curryN(4, function transduce(xf, fn, acc, list) {\n  return _reduce(xf(typeof fn === 'function' ? _xwrap(fn) : fn), acc, list);\n});\nexport default transduce;","import _curry1 from './internal/_curry1';\n\n/**\n * Transposes the rows and columns of a 2D list.\n * When passed a list of `n` lists of length `x`,\n * returns a list of `x` lists of length `n`.\n *\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig [[a]] -> [[a]]\n * @param {Array} list A 2D list\n * @return {Array} A 2D list\n * @example\n *\n *      R.transpose([[1, 'a'], [2, 'b'], [3, 'c']]) //=> [[1, 2, 3], ['a', 'b', 'c']]\n *      R.transpose([[1, 2, 3], ['a', 'b', 'c']]) //=> [[1, 'a'], [2, 'b'], [3, 'c']]\n *\n *      // If some of the rows are shorter than the following rows, their elements are skipped:\n *      R.transpose([[10, 11], [20], [], [30, 31, 32]]) //=> [[10, 20, 30], [11, 31], [32]]\n * @symb R.transpose([[a], [b], [c]]) = [a, b, c]\n * @symb R.transpose([[a, b], [c, d]]) = [[a, c], [b, d]]\n * @symb R.transpose([[a, b], [c]]) = [[a, c], [b]]\n */\nvar transpose = /*#__PURE__*/_curry1(function transpose(outerlist) {\n  var i = 0;\n  var result = [];\n  while (i < outerlist.length) {\n    var innerlist = outerlist[i];\n    var j = 0;\n    while (j < innerlist.length) {\n      if (typeof result[j] === 'undefined') {\n        result[j] = [];\n      }\n      result[j].push(innerlist[j]);\n      j += 1;\n    }\n    i += 1;\n  }\n  return result;\n});\nexport default transpose;","import _curry3 from './internal/_curry3';\nimport map from './map';\nimport sequence from './sequence';\n\n/**\n * Maps an [Applicative](https://github.com/fantasyland/fantasy-land#applicative)-returning\n * function over a [Traversable](https://github.com/fantasyland/fantasy-land#traversable),\n * then uses [`sequence`](#sequence) to transform the resulting Traversable of Applicative\n * into an Applicative of Traversable.\n *\n * Dispatches to the `traverse` method of the third argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (Applicative f, Traversable t) => (a -> f a) -> (a -> f b) -> t a -> f (t b)\n * @param {Function} of\n * @param {Function} f\n * @param {*} traversable\n * @return {*}\n * @see R.sequence\n * @example\n *\n *      // Returns `Nothing` if the given divisor is `0`\n *      safeDiv = n => d => d === 0 ? Nothing() : Just(n / d)\n *\n *      R.traverse(Maybe.of, safeDiv(10), [2, 4, 5]); //=> Just([5, 2.5, 2])\n *      R.traverse(Maybe.of, safeDiv(10), [2, 0, 5]); //=> Nothing\n */\nvar traverse = /*#__PURE__*/_curry3(function traverse(of, f, traversable) {\n  return typeof traversable['fantasy-land/traverse'] === 'function' ? traversable['fantasy-land/traverse'](f, of) : sequence(of, map(f, traversable));\n});\nexport default traverse;","import _curry1 from './internal/_curry1';\n\nvar ws = '\\x09\\x0A\\x0B\\x0C\\x0D\\x20\\xA0\\u1680\\u180E\\u2000\\u2001\\u2002\\u2003' + '\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200A\\u202F\\u205F\\u3000\\u2028' + '\\u2029\\uFEFF';\nvar zeroWidth = '\\u200b';\nvar hasProtoTrim = typeof String.prototype.trim === 'function';\n/**\n * Removes (strips) whitespace from both ends of the string.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to trim.\n * @return {String} Trimmed version of `str`.\n * @example\n *\n *      R.trim('   xyz  '); //=> 'xyz'\n *      R.map(R.trim, R.split(',', 'x, y, z')); //=> ['x', 'y', 'z']\n */\nvar _trim = !hasProtoTrim || /*#__PURE__*/ws.trim() || ! /*#__PURE__*/zeroWidth.trim() ? function trim(str) {\n  var beginRx = new RegExp('^[' + ws + '][' + ws + ']*');\n  var endRx = new RegExp('[' + ws + '][' + ws + ']*$');\n  return str.replace(beginRx, '').replace(endRx, '');\n} : function trim(str) {\n  return str.trim();\n};\nvar trim = /*#__PURE__*/_curry1(_trim);\nexport default trim;","import _arity from './internal/_arity';\nimport _concat from './internal/_concat';\nimport _curry2 from './internal/_curry2';\n\n/**\n * `tryCatch` takes two functions, a `tryer` and a `catcher`. The returned\n * function evaluates the `tryer`; if it does not throw, it simply returns the\n * result. If the `tryer` *does* throw, the returned function evaluates the\n * `catcher` function and returns its result. Note that for effective\n * composition with this function, both the `tryer` and `catcher` functions\n * must return the same type of results.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Function\n * @sig (...x -> a) -> ((e, ...x) -> a) -> (...x -> a)\n * @param {Function} tryer The function that may throw.\n * @param {Function} catcher The function that will be evaluated if `tryer` throws.\n * @return {Function} A new function that will catch exceptions and send then to the catcher.\n * @example\n *\n *      R.tryCatch(R.prop('x'), R.F)({x: true}); //=> true\n *      R.tryCatch(R.prop('x'), R.F)(null);      //=> false\n */\nvar tryCatch = /*#__PURE__*/_curry2(function _tryCatch(tryer, catcher) {\n  return _arity(tryer.length, function () {\n    try {\n      return tryer.apply(this, arguments);\n    } catch (e) {\n      return catcher.apply(this, _concat([e], arguments));\n    }\n  });\n});\nexport default tryCatch;","import _curry1 from './internal/_curry1';\n\n/**\n * Takes a function `fn`, which takes a single array argument, and returns a\n * function which:\n *\n *   - takes any number of positional arguments;\n *   - passes these arguments to `fn` as an array; and\n *   - returns the result.\n *\n * In other words, `R.unapply` derives a variadic function from a function which\n * takes an array. `R.unapply` is the inverse of [`R.apply`](#apply).\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Function\n * @sig ([*...] -> a) -> (*... -> a)\n * @param {Function} fn\n * @return {Function}\n * @see R.apply\n * @example\n *\n *      R.unapply(JSON.stringify)(1, 2, 3); //=> '[1,2,3]'\n * @symb R.unapply(f)(a, b) = f([a, b])\n */\nvar unapply = /*#__PURE__*/_curry1(function unapply(fn) {\n  return function () {\n    return fn(Array.prototype.slice.call(arguments, 0));\n  };\n});\nexport default unapply;","import _curry1 from './internal/_curry1';\nimport nAry from './nAry';\n\n/**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly 1 parameter. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Function\n * @sig (* -> b) -> (a -> b)\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n *         arity 1.\n * @see R.binary, R.nAry\n * @example\n *\n *      var takesTwoArgs = function(a, b) {\n *        return [a, b];\n *      };\n *      takesTwoArgs.length; //=> 2\n *      takesTwoArgs(1, 2); //=> [1, 2]\n *\n *      var takesOneArg = R.unary(takesTwoArgs);\n *      takesOneArg.length; //=> 1\n *      // Only 1 argument is passed to the wrapped function\n *      takesOneArg(1, 2); //=> [1, undefined]\n * @symb R.unary(f)(a, b, c) = f(a)\n */\nvar unary = /*#__PURE__*/_curry1(function unary(fn) {\n  return nAry(1, fn);\n});\nexport default unary;","import _curry2 from './internal/_curry2';\nimport curryN from './curryN';\n\n/**\n * Returns a function of arity `n` from a (manually) curried function.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Function\n * @sig Number -> (a -> b) -> (a -> c)\n * @param {Number} length The arity for the returned function.\n * @param {Function} fn The function to uncurry.\n * @return {Function} A new function.\n * @see R.curry\n * @example\n *\n *      var addFour = a => b => c => d => a + b + c + d;\n *\n *      var uncurriedAddFour = R.uncurryN(4, addFour);\n *      uncurriedAddFour(1, 2, 3, 4); //=> 10\n */\nvar uncurryN = /*#__PURE__*/_curry2(function uncurryN(depth, fn) {\n  return curryN(depth, function () {\n    var currentDepth = 1;\n    var value = fn;\n    var idx = 0;\n    var endIdx;\n    while (currentDepth <= depth && typeof value === 'function') {\n      endIdx = currentDepth === depth ? arguments.length : idx + value.length;\n      value = value.apply(this, Array.prototype.slice.call(arguments, idx, endIdx));\n      currentDepth += 1;\n      idx = endIdx;\n    }\n    return value;\n  });\n});\nexport default uncurryN;","import _curry2 from './internal/_curry2';\n\n/**\n * Builds a list from a seed value. Accepts an iterator function, which returns\n * either false to stop iteration or an array of length 2 containing the value\n * to add to the resulting list and the seed to be used in the next call to the\n * iterator function.\n *\n * The iterator function receives one argument: *(seed)*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig (a -> [b]) -> * -> [b]\n * @param {Function} fn The iterator function. receives one argument, `seed`, and returns\n *        either false to quit iteration or an array of length two to proceed. The element\n *        at index 0 of this array will be added to the resulting array, and the element\n *        at index 1 will be passed to the next call to `fn`.\n * @param {*} seed The seed value.\n * @return {Array} The final list.\n * @example\n *\n *      var f = n => n > 50 ? false : [-n, n + 10];\n *      R.unfold(f, 10); //=> [-10, -20, -30, -40, -50]\n * @symb R.unfold(f, x) = [f(x)[0], f(f(x)[1])[0], f(f(f(x)[1])[1])[0], ...]\n */\nvar unfold = /*#__PURE__*/_curry2(function unfold(fn, seed) {\n  var pair = fn(seed);\n  var result = [];\n  while (pair && pair.length) {\n    result[result.length] = pair[0];\n    pair = fn(pair[1]);\n  }\n  return result;\n});\nexport default unfold;","import _concat from './internal/_concat';\nimport _curry2 from './internal/_curry2';\nimport compose from './compose';\nimport uniq from './uniq';\n\n/**\n * Combines two lists into a set (i.e. no duplicates) composed of the elements\n * of each list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} as The first list.\n * @param {Array} bs The second list.\n * @return {Array} The first and second lists concatenated, with\n *         duplicates removed.\n * @example\n *\n *      R.union([1, 2, 3], [2, 3, 4]); //=> [1, 2, 3, 4]\n */\nvar union = /*#__PURE__*/_curry2( /*#__PURE__*/compose(uniq, _concat));\nexport default union;","import _containsWith from './internal/_containsWith';\nimport _curry2 from './internal/_curry2';\n\n/**\n * Returns a new list containing only one copy of each element in the original\n * list, based upon the value returned by applying the supplied predicate to\n * two list elements. Prefers the first item if two items compare equal based\n * on the predicate.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category List\n * @sig ((a, a) -> Boolean) -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n *      var strEq = R.eqBy(String);\n *      R.uniqWith(strEq)([1, '1', 2, 1]); //=> [1, 2]\n *      R.uniqWith(strEq)([{}, {}]);       //=> [{}]\n *      R.uniqWith(strEq)([1, '1', 1]);    //=> [1]\n *      R.uniqWith(strEq)(['1', 1, 1]);    //=> ['1']\n */\nvar uniqWith = /*#__PURE__*/_curry2(function uniqWith(pred, list) {\n  var idx = 0;\n  var len = list.length;\n  var result = [];\n  var item;\n  while (idx < len) {\n    item = list[idx];\n    if (!_containsWith(pred, item, result)) {\n      result[result.length] = item;\n    }\n    idx += 1;\n  }\n  return result;\n});\nexport default uniqWith;","import _concat from './internal/_concat';\nimport _curry3 from './internal/_curry3';\nimport uniqWith from './uniqWith';\n\n/**\n * Combines two lists into a set (i.e. no duplicates) composed of the elements\n * of each list. Duplication is determined according to the value returned by\n * applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig ((a, a) -> Boolean) -> [*] -> [*] -> [*]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The first and second lists concatenated, with\n *         duplicates removed.\n * @see R.union\n * @example\n *\n *      var l1 = [{a: 1}, {a: 2}];\n *      var l2 = [{a: 1}, {a: 4}];\n *      R.unionWith(R.eqBy(R.prop('a')), l1, l2); //=> [{a: 1}, {a: 2}, {a: 4}]\n */\nvar unionWith = /*#__PURE__*/_curry3(function unionWith(pred, list1, list2) {\n  return uniqWith(pred, _concat(list1, list2));\n});\nexport default unionWith;","import _curry3 from './internal/_curry3';\n\n/**\n * Tests the final argument by passing it to the given predicate function. If\n * the predicate is not satisfied, the function will return the result of\n * calling the `whenFalseFn` function with the same argument. If the predicate\n * is satisfied, the argument is returned as is.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred        A predicate function\n * @param {Function} whenFalseFn A function to invoke when the `pred` evaluates\n *                               to a falsy value.\n * @param {*}        x           An object to test with the `pred` function and\n *                               pass to `whenFalseFn` if necessary.\n * @return {*} Either `x` or the result of applying `x` to `whenFalseFn`.\n * @see R.ifElse, R.when\n * @example\n *\n *      let safeInc = R.unless(R.isNil, R.inc);\n *      safeInc(null); //=> null\n *      safeInc(1); //=> 2\n */\nvar unless = /*#__PURE__*/_curry3(function unless(pred, whenFalseFn, x) {\n  return pred(x) ? x : whenFalseFn(x);\n});\nexport default unless;","import _identity from './internal/_identity';\nimport chain from './chain';\n\n/**\n * Shorthand for `R.chain(R.identity)`, which removes one level of nesting from\n * any [Chain](https://github.com/fantasyland/fantasy-land#chain).\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig Chain c => c (c a) -> c a\n * @param {*} list\n * @return {*}\n * @see R.flatten, R.chain\n * @example\n *\n *      R.unnest([1, [2], [[3]]]); //=> [1, 2, [3]]\n *      R.unnest([[1, 2], [3, 4], [5, 6]]); //=> [1, 2, 3, 4, 5, 6]\n */\nvar unnest = /*#__PURE__*/chain(_identity);\nexport default unnest;","import _curry3 from './internal/_curry3';\n\n/**\n * Takes a predicate, a transformation function, and an initial value,\n * and returns a value of the same type as the initial value.\n * It does so by applying the transformation until the predicate is satisfied,\n * at which point it returns the satisfactory value.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred A predicate function\n * @param {Function} fn The iterator function\n * @param {*} init Initial value\n * @return {*} Final value that satisfies predicate\n * @example\n *\n *      R.until(R.gt(R.__, 100), R.multiply(2))(1) // => 128\n */\nvar until = /*#__PURE__*/_curry3(function until(pred, fn, init) {\n  var val = init;\n  while (!pred(val)) {\n    val = fn(val);\n  }\n  return val;\n});\nexport default until;","import _curry1 from './internal/_curry1';\n\n/**\n * Returns a list of all the properties, including prototype properties, of the\n * supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @sig {k: v} -> [v]\n * @param {Object} obj The object to extract values from\n * @return {Array} An array of the values of the object's own and prototype properties.\n * @see R.values, R.keysIn\n * @example\n *\n *      var F = function() { this.x = 'X'; };\n *      F.prototype.y = 'Y';\n *      var f = new F();\n *      R.valuesIn(f); //=> ['X', 'Y']\n */\nvar valuesIn = /*#__PURE__*/_curry1(function valuesIn(obj) {\n  var prop;\n  var vs = [];\n  for (prop in obj) {\n    vs[vs.length] = obj[prop];\n  }\n  return vs;\n});\nexport default valuesIn;","import _curry2 from './internal/_curry2';\n\n// `Const` is a functor that effectively ignores the function given to `map`.\nvar Const = function (x) {\n  return { value: x, 'fantasy-land/map': function () {\n      return this;\n    } };\n};\n\n/**\n * Returns a \"view\" of the given data structure, determined by the given lens.\n * The lens's focus determines which portion of the data structure is visible.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> s -> a\n * @param {Lens} lens\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n *      var xLens = R.lensProp('x');\n *\n *      R.view(xLens, {x: 1, y: 2});  //=> 1\n *      R.view(xLens, {x: 4, y: 2});  //=> 4\n */\nvar view = /*#__PURE__*/_curry2(function view(lens, x) {\n  // Using `Const` effectively ignores the setter function of the `lens`,\n  // leaving the value returned by the getter function unmodified.\n  return lens(Const)(x).value;\n});\nexport default view;","import _curry3 from './internal/_curry3';\n\n/**\n * Tests the final argument by passing it to the given predicate function. If\n * the predicate is satisfied, the function will return the result of calling\n * the `whenTrueFn` function with the same argument. If the predicate is not\n * satisfied, the argument is returned as is.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred       A predicate function\n * @param {Function} whenTrueFn A function to invoke when the `condition`\n *                              evaluates to a truthy value.\n * @param {*}        x          An object to test with the `pred` function and\n *                              pass to `whenTrueFn` if necessary.\n * @return {*} Either `x` or the result of applying `x` to `whenTrueFn`.\n * @see R.ifElse, R.unless\n * @example\n *\n *      // truncate :: String -> String\n *      var truncate = R.when(\n *        R.propSatisfies(R.gt(R.__, 10), 'length'),\n *        R.pipe(R.take(10), R.append('…'), R.join(''))\n *      );\n *      truncate('12345');         //=> '12345'\n *      truncate('0123456789ABC'); //=> '0123456789…'\n */\nvar when = /*#__PURE__*/_curry3(function when(pred, whenTrueFn, x) {\n  return pred(x) ? whenTrueFn(x) : x;\n});\nexport default when;","import _curry2 from './internal/_curry2';\nimport _has from './internal/_has';\n\n/**\n * Takes a spec object and a test object; returns true if the test satisfies\n * the spec. Each of the spec's own properties must be a predicate function.\n * Each predicate is applied to the value of the corresponding property of the\n * test object. `where` returns true if all the predicates return true, false\n * otherwise.\n *\n * `where` is well suited to declaratively expressing constraints for other\n * functions such as [`filter`](#filter) and [`find`](#find).\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category Object\n * @sig {String: (* -> Boolean)} -> {String: *} -> Boolean\n * @param {Object} spec\n * @param {Object} testObj\n * @return {Boolean}\n * @see R.propSatisfies, R.whereEq\n * @example\n *\n *      // pred :: Object -> Boolean\n *      var pred = R.where({\n *        a: R.equals('foo'),\n *        b: R.complement(R.equals('bar')),\n *        x: R.gt(R.__, 10),\n *        y: R.lt(R.__, 20)\n *      });\n *\n *      pred({a: 'foo', b: 'xxx', x: 11, y: 19}); //=> true\n *      pred({a: 'xxx', b: 'xxx', x: 11, y: 19}); //=> false\n *      pred({a: 'foo', b: 'bar', x: 11, y: 19}); //=> false\n *      pred({a: 'foo', b: 'xxx', x: 10, y: 19}); //=> false\n *      pred({a: 'foo', b: 'xxx', x: 11, y: 20}); //=> false\n */\nvar where = /*#__PURE__*/_curry2(function where(spec, testObj) {\n  for (var prop in spec) {\n    if (_has(prop, spec) && !spec[prop](testObj[prop])) {\n      return false;\n    }\n  }\n  return true;\n});\nexport default where;","import _curry2 from './internal/_curry2';\nimport equals from './equals';\nimport map from './map';\nimport where from './where';\n\n/**\n * Takes a spec object and a test object; returns true if the test satisfies\n * the spec, false otherwise. An object satisfies the spec if, for each of the\n * spec's own properties, accessing that property of the object gives the same\n * value (in [`R.equals`](#equals) terms) as accessing that property of the\n * spec.\n *\n * `whereEq` is a specialization of [`where`](#where).\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @sig {String: *} -> {String: *} -> Boolean\n * @param {Object} spec\n * @param {Object} testObj\n * @return {Boolean}\n * @see R.propEq, R.where\n * @example\n *\n *      // pred :: Object -> Boolean\n *      var pred = R.whereEq({a: 1, b: 2});\n *\n *      pred({a: 1});              //=> false\n *      pred({a: 1, b: 2});        //=> true\n *      pred({a: 1, b: 2, c: 3});  //=> true\n *      pred({a: 1, b: 1});        //=> false\n */\nvar whereEq = /*#__PURE__*/_curry2(function whereEq(spec, testObj) {\n  return where(map(equals, spec), testObj);\n});\nexport default whereEq;","import _contains from './internal/_contains';\nimport _curry2 from './internal/_curry2';\nimport flip from './flip';\nimport reject from './reject';\n\n/**\n * Returns a new list without values in the first argument.\n * [`R.equals`](#equals) is used to determine equality.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig [a] -> [a] -> [a]\n * @param {Array} list1 The values to be removed from `list2`.\n * @param {Array} list2 The array to remove values from.\n * @return {Array} The new array without values in `list1`.\n * @see R.transduce, R.difference\n * @example\n *\n *      R.without([1, 2], [1, 2, 1, 3, 4]); //=> [3, 4]\n */\nvar without = /*#__PURE__*/_curry2(function (xs, list) {\n  return reject(flip(_contains)(xs), list);\n});\nexport default without;","import _curry2 from './internal/_curry2';\n\n/**\n * Creates a new list out of the two supplied by creating each possible pair\n * from the lists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b] -> [[a,b]]\n * @param {Array} as The first list.\n * @param {Array} bs The second list.\n * @return {Array} The list made by combining each possible pair from\n *         `as` and `bs` into pairs (`[a, b]`).\n * @example\n *\n *      R.xprod([1, 2], ['a', 'b']); //=> [[1, 'a'], [1, 'b'], [2, 'a'], [2, 'b']]\n * @symb R.xprod([a, b], [c, d]) = [[a, c], [a, d], [b, c], [b, d]]\n */\nvar xprod = /*#__PURE__*/_curry2(function xprod(a, b) {\n  // = xprodWith(prepend); (takes about 3 times as long...)\n  var idx = 0;\n  var ilen = a.length;\n  var j;\n  var jlen = b.length;\n  var result = [];\n  while (idx < ilen) {\n    j = 0;\n    while (j < jlen) {\n      result[result.length] = [a[idx], b[j]];\n      j += 1;\n    }\n    idx += 1;\n  }\n  return result;\n});\nexport default xprod;","import _curry2 from './internal/_curry2';\n\n/**\n * Creates a new list out of the two supplied by pairing up equally-positioned\n * items from both lists. The returned list is truncated to the length of the\n * shorter of the two input lists.\n * Note: `zip` is equivalent to `zipWith(function(a, b) { return [a, b] })`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b] -> [[a,b]]\n * @param {Array} list1 The first array to consider.\n * @param {Array} list2 The second array to consider.\n * @return {Array} The list made by pairing up same-indexed elements of `list1` and `list2`.\n * @example\n *\n *      R.zip([1, 2, 3], ['a', 'b', 'c']); //=> [[1, 'a'], [2, 'b'], [3, 'c']]\n * @symb R.zip([a, b, c], [d, e, f]) = [[a, d], [b, e], [c, f]]\n */\nvar zip = /*#__PURE__*/_curry2(function zip(a, b) {\n  var rv = [];\n  var idx = 0;\n  var len = Math.min(a.length, b.length);\n  while (idx < len) {\n    rv[idx] = [a[idx], b[idx]];\n    idx += 1;\n  }\n  return rv;\n});\nexport default zip;","import _curry2 from './internal/_curry2';\n\n/**\n * Creates a new object out of a list of keys and a list of values.\n * Key/value pairing is truncated to the length of the shorter of the two lists.\n * Note: `zipObj` is equivalent to `pipe(zip, fromPairs)`.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [String] -> [*] -> {String: *}\n * @param {Array} keys The array that will be properties on the output object.\n * @param {Array} values The list of values on the output object.\n * @return {Object} The object made by pairing up same-indexed elements of `keys` and `values`.\n * @example\n *\n *      R.zipObj(['a', 'b', 'c'], [1, 2, 3]); //=> {a: 1, b: 2, c: 3}\n */\nvar zipObj = /*#__PURE__*/_curry2(function zipObj(keys, values) {\n  var idx = 0;\n  var len = Math.min(keys.length, values.length);\n  var out = {};\n  while (idx < len) {\n    out[keys[idx]] = values[idx];\n    idx += 1;\n  }\n  return out;\n});\nexport default zipObj;","import _curry3 from './internal/_curry3';\n\n/**\n * Creates a new list out of the two supplied by applying the function to each\n * equally-positioned pair in the lists. The returned list is truncated to the\n * length of the shorter of the two input lists.\n *\n * @function\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, b) -> c) -> [a] -> [b] -> [c]\n * @param {Function} fn The function used to combine the two elements into one value.\n * @param {Array} list1 The first array to consider.\n * @param {Array} list2 The second array to consider.\n * @return {Array} The list made by combining same-indexed elements of `list1` and `list2`\n *         using `fn`.\n * @example\n *\n *      var f = (x, y) => {\n *        // ...\n *      };\n *      R.zipWith(f, [1, 2, 3], ['a', 'b', 'c']);\n *      //=> [f(1, 'a'), f(2, 'b'), f(3, 'c')]\n * @symb R.zipWith(fn, [a, b, c], [d, e, f]) = [fn(a, d), fn(b, e), fn(c, f)]\n */\nvar zipWith = /*#__PURE__*/_curry3(function zipWith(fn, a, b) {\n  var rv = [];\n  var idx = 0;\n  var len = Math.min(a.length, b.length);\n  while (idx < len) {\n    rv[idx] = fn(a[idx], b[idx]);\n    idx += 1;\n  }\n  return rv;\n});\nexport default zipWith;","import { map, prop } from 'ramda';\nimport {\n  VOTE_PROXY_FACTORY,\n  CHIEF,\n  POLLING,\n  BATCH_POLLING,\n  ESM,\n  END,\n  PAUSE,\n  MKR,\n  IOU\n} from './utils/constants';\n\nimport ChiefService from './ChiefService';\nimport VoteProxyService from './VoteProxyService';\nimport VoteProxyFactoryService from './VoteProxyFactoryService';\nimport GovPollingService from './GovPollingService';\nimport GovQueryApiService from './GovQueryApiService';\nimport EsmService from './EsmService';\nimport SpellService from './SpellService';\n\nexport default {\n  addConfig: function(config, { network = 'mainnet', staging = false }) {\n    const contractAddresses = {\n      kovan: require('../contracts/addresses/kovan.json'),\n      mainnet: require('../contracts/addresses/mainnet.json')\n    };\n\n    try {\n      contractAddresses.testnet = require('../contracts/addresses/testnet.json');\n    } catch (err) {\n      // do nothing here; throw an error only if we later attempt to use ganache\n    }\n\n    const addressKey = network == 'ganache' ? 'testnet' : network;\n\n    const esmContracts = {\n      [ESM]: {\n        address: map(prop('MCD_ESM'), contractAddresses),\n        abi: require('../contracts/abis/ESM.json')\n      },\n      [END]: {\n        address: map(prop('MCD_END'), contractAddresses),\n        abi: require('../contracts/abis/End.json')\n      }\n    };\n\n    const addContracts = {\n      [CHIEF]: {\n        address: map(prop('MCD_ADM'), contractAddresses),\n        // TODO check for MCD-specific version of DSChief\n        abi: require('../contracts/abis/DSChief.json')\n      },\n      [VOTE_PROXY_FACTORY]: {\n        address: map(prop('VOTE_PROXY_FACTORY'), contractAddresses),\n        abi: require('../contracts/abis/VoteProxyFactory.json')\n      },\n      [POLLING]: {\n        address: map(prop('POLLING'), contractAddresses),\n        abi: require('../contracts/abis/PollingEmitter.json')\n      },\n      [BATCH_POLLING]: {\n        address: map(prop('BATCH_POLLING'), contractAddresses),\n        abi: require('../contracts/abis/BatchPollingEmitter.json')\n      },\n      [PAUSE]: {\n        address: map(prop('PAUSE'), contractAddresses),\n        abi: require('../contracts/abis/DSPause.json')\n      },\n      ...esmContracts\n    };\n\n    const makerConfig = {\n      ...config,\n      additionalServices: [\n        'chief',\n        'voteProxy',\n        'voteProxyFactory',\n        'govPolling',\n        'govQueryApi',\n        'esm',\n        'spell'\n      ],\n      chief: [ChiefService],\n      voteProxy: [VoteProxyService],\n      voteProxyFactory: [VoteProxyFactoryService],\n      govPolling: [GovPollingService],\n      govQueryApi: [GovQueryApiService, { staging }],\n      esm: [EsmService],\n      spell: [SpellService],\n      smartContract: { addContracts },\n      token: {\n        erc20: [\n          {\n            currency: MKR,\n            symbol: MKR.symbol,\n            address: contractAddresses[addressKey].SAI_GOV\n          },\n          {\n            currency: IOU,\n            symbol: IOU.symbol,\n            address: contractAddresses[addressKey].MCD_IOU\n          }\n        ]\n      }\n    };\n\n    return makerConfig;\n  }\n};\n","require('../../modules/es6.object.assign');\nmodule.exports = require('../../modules/_core').Object.assign;\n","// 19.1.3.1 Object.assign(target, source)\nvar $export = require('./_export');\n\n$export($export.S + $export.F, 'Object', { assign: require('./_object-assign') });\n","module.exports = function (it) {\n  if (typeof it != 'function') throw TypeError(it + ' is not a function!');\n  return it;\n};\n","'use strict';\n// 19.1.2.1 Object.assign(target, source, ...)\nvar DESCRIPTORS = require('./_descriptors');\nvar getKeys = require('./_object-keys');\nvar gOPS = require('./_object-gops');\nvar pIE = require('./_object-pie');\nvar toObject = require('./_to-object');\nvar IObject = require('./_iobject');\nvar $assign = Object.assign;\n\n// should work with symbols and should have deterministic property order (V8 bug)\nmodule.exports = !$assign || require('./_fails')(function () {\n  var A = {};\n  var B = {};\n  // eslint-disable-next-line no-undef\n  var S = Symbol();\n  var K = 'abcdefghijklmnopqrst';\n  A[S] = 7;\n  K.split('').forEach(function (k) { B[k] = k; });\n  return $assign({}, A)[S] != 7 || Object.keys($assign({}, B)).join('') != K;\n}) ? function assign(target, source) { // eslint-disable-line no-unused-vars\n  var T = toObject(target);\n  var aLen = arguments.length;\n  var index = 1;\n  var getSymbols = gOPS.f;\n  var isEnum = pIE.f;\n  while (aLen > index) {\n    var S = IObject(arguments[index++]);\n    var keys = getSymbols ? getKeys(S).concat(getSymbols(S)) : getKeys(S);\n    var length = keys.length;\n    var j = 0;\n    var key;\n    while (length > j) {\n      key = keys[j++];\n      if (!DESCRIPTORS || isEnum.call(S, key)) T[key] = S[key];\n    }\n  } return T;\n} : $assign;\n","// false -> Array#indexOf\n// true  -> Array#includes\nvar toIObject = require('./_to-iobject');\nvar toLength = require('./_to-length');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nmodule.exports = function (IS_INCLUDES) {\n  return function ($this, el, fromIndex) {\n    var O = toIObject($this);\n    var length = toLength(O.length);\n    var index = toAbsoluteIndex(fromIndex, length);\n    var value;\n    // Array#includes uses SameValueZero equality algorithm\n    // eslint-disable-next-line no-self-compare\n    if (IS_INCLUDES && el != el) while (length > index) {\n      value = O[index++];\n      // eslint-disable-next-line no-self-compare\n      if (value != value) return true;\n    // Array#indexOf ignores holes, Array#includes - not\n    } else for (;length > index; index++) if (IS_INCLUDES || index in O) {\n      if (O[index] === el) return IS_INCLUDES || index || 0;\n    } return !IS_INCLUDES && -1;\n  };\n};\n","var toInteger = require('./_to-integer');\nvar max = Math.max;\nvar min = Math.min;\nmodule.exports = function (index, length) {\n  index = toInteger(index);\n  return index < 0 ? max(index + length, 0) : min(index, length);\n};\n","require('../../modules/es6.object.get-prototype-of');\nmodule.exports = require('../../modules/_core').Object.getPrototypeOf;\n","// 19.1.2.9 Object.getPrototypeOf(O)\nvar toObject = require('./_to-object');\nvar $getPrototypeOf = require('./_object-gpo');\n\nrequire('./_object-sap')('getPrototypeOf', function () {\n  return function getPrototypeOf(it) {\n    return $getPrototypeOf(toObject(it));\n  };\n});\n","// most Object methods by ES6 should accept primitives\nvar $export = require('./_export');\nvar core = require('./_core');\nvar fails = require('./_fails');\nmodule.exports = function (KEY, exec) {\n  var fn = (core.Object || {})[KEY] || Object[KEY];\n  var exp = {};\n  exp[KEY] = exec(fn);\n  $export($export.S + $export.F * fails(function () { fn(1); }), 'Object', exp);\n};\n","module.exports = { \"default\": require(\"core-js/library/fn/symbol/iterator\"), __esModule: true };","require('../../modules/es6.string.iterator');\nrequire('../../modules/web.dom.iterable');\nmodule.exports = require('../../modules/_wks-ext').f('iterator');\n","var toInteger = require('./_to-integer');\nvar defined = require('./_defined');\n// true  -> String#at\n// false -> String#codePointAt\nmodule.exports = function (TO_STRING) {\n  return function (that, pos) {\n    var s = String(defined(that));\n    var i = toInteger(pos);\n    var l = s.length;\n    var a, b;\n    if (i < 0 || i >= l) return TO_STRING ? '' : undefined;\n    a = s.charCodeAt(i);\n    return a < 0xd800 || a > 0xdbff || i + 1 === l || (b = s.charCodeAt(i + 1)) < 0xdc00 || b > 0xdfff\n      ? TO_STRING ? s.charAt(i) : a\n      : TO_STRING ? s.slice(i, i + 2) : (a - 0xd800 << 10) + (b - 0xdc00) + 0x10000;\n  };\n};\n","'use strict';\nvar create = require('./_object-create');\nvar descriptor = require('./_property-desc');\nvar setToStringTag = require('./_set-to-string-tag');\nvar IteratorPrototype = {};\n\n// 25.1.2.1.1 %IteratorPrototype%[@@iterator]()\nrequire('./_hide')(IteratorPrototype, require('./_wks')('iterator'), function () { return this; });\n\nmodule.exports = function (Constructor, NAME, next) {\n  Constructor.prototype = create(IteratorPrototype, { next: descriptor(1, next) });\n  setToStringTag(Constructor, NAME + ' Iterator');\n};\n","var dP = require('./_object-dp');\nvar anObject = require('./_an-object');\nvar getKeys = require('./_object-keys');\n\nmodule.exports = require('./_descriptors') ? Object.defineProperties : function defineProperties(O, Properties) {\n  anObject(O);\n  var keys = getKeys(Properties);\n  var length = keys.length;\n  var i = 0;\n  var P;\n  while (length > i) dP.f(O, P = keys[i++], Properties[P]);\n  return O;\n};\n","var document = require('./_global').document;\nmodule.exports = document && document.documentElement;\n","'use strict';\nvar addToUnscopables = require('./_add-to-unscopables');\nvar step = require('./_iter-step');\nvar Iterators = require('./_iterators');\nvar toIObject = require('./_to-iobject');\n\n// 22.1.3.4 Array.prototype.entries()\n// 22.1.3.13 Array.prototype.keys()\n// 22.1.3.29 Array.prototype.values()\n// 22.1.3.30 Array.prototype[@@iterator]()\nmodule.exports = require('./_iter-define')(Array, 'Array', function (iterated, kind) {\n  this._t = toIObject(iterated); // target\n  this._i = 0;                   // next index\n  this._k = kind;                // kind\n// 22.1.5.2.1 %ArrayIteratorPrototype%.next()\n}, function () {\n  var O = this._t;\n  var kind = this._k;\n  var index = this._i++;\n  if (!O || index >= O.length) {\n    this._t = undefined;\n    return step(1);\n  }\n  if (kind == 'keys') return step(0, index);\n  if (kind == 'values') return step(0, O[index]);\n  return step(0, [index, O[index]]);\n}, 'values');\n\n// argumentsList[@@iterator] is %ArrayProto_values% (9.4.4.6, 9.4.4.7)\nIterators.Arguments = Iterators.Array;\n\naddToUnscopables('keys');\naddToUnscopables('values');\naddToUnscopables('entries');\n","module.exports = function () { /* empty */ };\n","module.exports = function (done, value) {\n  return { value: value, done: !!done };\n};\n","module.exports = { \"default\": require(\"core-js/library/fn/symbol\"), __esModule: true };","require('../../modules/es6.symbol');\nrequire('../../modules/es6.object.to-string');\nrequire('../../modules/es7.symbol.async-iterator');\nrequire('../../modules/es7.symbol.observable');\nmodule.exports = require('../../modules/_core').Symbol;\n","'use strict';\n// ECMAScript 6 symbols shim\nvar global = require('./_global');\nvar has = require('./_has');\nvar DESCRIPTORS = require('./_descriptors');\nvar $export = require('./_export');\nvar redefine = require('./_redefine');\nvar META = require('./_meta').KEY;\nvar $fails = require('./_fails');\nvar shared = require('./_shared');\nvar setToStringTag = require('./_set-to-string-tag');\nvar uid = require('./_uid');\nvar wks = require('./_wks');\nvar wksExt = require('./_wks-ext');\nvar wksDefine = require('./_wks-define');\nvar enumKeys = require('./_enum-keys');\nvar isArray = require('./_is-array');\nvar anObject = require('./_an-object');\nvar isObject = require('./_is-object');\nvar toObject = require('./_to-object');\nvar toIObject = require('./_to-iobject');\nvar toPrimitive = require('./_to-primitive');\nvar createDesc = require('./_property-desc');\nvar _create = require('./_object-create');\nvar gOPNExt = require('./_object-gopn-ext');\nvar $GOPD = require('./_object-gopd');\nvar $GOPS = require('./_object-gops');\nvar $DP = require('./_object-dp');\nvar $keys = require('./_object-keys');\nvar gOPD = $GOPD.f;\nvar dP = $DP.f;\nvar gOPN = gOPNExt.f;\nvar $Symbol = global.Symbol;\nvar $JSON = global.JSON;\nvar _stringify = $JSON && $JSON.stringify;\nvar PROTOTYPE = 'prototype';\nvar HIDDEN = wks('_hidden');\nvar TO_PRIMITIVE = wks('toPrimitive');\nvar isEnum = {}.propertyIsEnumerable;\nvar SymbolRegistry = shared('symbol-registry');\nvar AllSymbols = shared('symbols');\nvar OPSymbols = shared('op-symbols');\nvar ObjectProto = Object[PROTOTYPE];\nvar USE_NATIVE = typeof $Symbol == 'function' && !!$GOPS.f;\nvar QObject = global.QObject;\n// Don't use setters in Qt Script, https://github.com/zloirock/core-js/issues/173\nvar setter = !QObject || !QObject[PROTOTYPE] || !QObject[PROTOTYPE].findChild;\n\n// fallback for old Android, https://code.google.com/p/v8/issues/detail?id=687\nvar setSymbolDesc = DESCRIPTORS && $fails(function () {\n  return _create(dP({}, 'a', {\n    get: function () { return dP(this, 'a', { value: 7 }).a; }\n  })).a != 7;\n}) ? function (it, key, D) {\n  var protoDesc = gOPD(ObjectProto, key);\n  if (protoDesc) delete ObjectProto[key];\n  dP(it, key, D);\n  if (protoDesc && it !== ObjectProto) dP(ObjectProto, key, protoDesc);\n} : dP;\n\nvar wrap = function (tag) {\n  var sym = AllSymbols[tag] = _create($Symbol[PROTOTYPE]);\n  sym._k = tag;\n  return sym;\n};\n\nvar isSymbol = USE_NATIVE && typeof $Symbol.iterator == 'symbol' ? function (it) {\n  return typeof it == 'symbol';\n} : function (it) {\n  return it instanceof $Symbol;\n};\n\nvar $defineProperty = function defineProperty(it, key, D) {\n  if (it === ObjectProto) $defineProperty(OPSymbols, key, D);\n  anObject(it);\n  key = toPrimitive(key, true);\n  anObject(D);\n  if (has(AllSymbols, key)) {\n    if (!D.enumerable) {\n      if (!has(it, HIDDEN)) dP(it, HIDDEN, createDesc(1, {}));\n      it[HIDDEN][key] = true;\n    } else {\n      if (has(it, HIDDEN) && it[HIDDEN][key]) it[HIDDEN][key] = false;\n      D = _create(D, { enumerable: createDesc(0, false) });\n    } return setSymbolDesc(it, key, D);\n  } return dP(it, key, D);\n};\nvar $defineProperties = function defineProperties(it, P) {\n  anObject(it);\n  var keys = enumKeys(P = toIObject(P));\n  var i = 0;\n  var l = keys.length;\n  var key;\n  while (l > i) $defineProperty(it, key = keys[i++], P[key]);\n  return it;\n};\nvar $create = function create(it, P) {\n  return P === undefined ? _create(it) : $defineProperties(_create(it), P);\n};\nvar $propertyIsEnumerable = function propertyIsEnumerable(key) {\n  var E = isEnum.call(this, key = toPrimitive(key, true));\n  if (this === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key)) return false;\n  return E || !has(this, key) || !has(AllSymbols, key) || has(this, HIDDEN) && this[HIDDEN][key] ? E : true;\n};\nvar $getOwnPropertyDescriptor = function getOwnPropertyDescriptor(it, key) {\n  it = toIObject(it);\n  key = toPrimitive(key, true);\n  if (it === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key)) return;\n  var D = gOPD(it, key);\n  if (D && has(AllSymbols, key) && !(has(it, HIDDEN) && it[HIDDEN][key])) D.enumerable = true;\n  return D;\n};\nvar $getOwnPropertyNames = function getOwnPropertyNames(it) {\n  var names = gOPN(toIObject(it));\n  var result = [];\n  var i = 0;\n  var key;\n  while (names.length > i) {\n    if (!has(AllSymbols, key = names[i++]) && key != HIDDEN && key != META) result.push(key);\n  } return result;\n};\nvar $getOwnPropertySymbols = function getOwnPropertySymbols(it) {\n  var IS_OP = it === ObjectProto;\n  var names = gOPN(IS_OP ? OPSymbols : toIObject(it));\n  var result = [];\n  var i = 0;\n  var key;\n  while (names.length > i) {\n    if (has(AllSymbols, key = names[i++]) && (IS_OP ? has(ObjectProto, key) : true)) result.push(AllSymbols[key]);\n  } return result;\n};\n\n// 19.4.1.1 Symbol([description])\nif (!USE_NATIVE) {\n  $Symbol = function Symbol() {\n    if (this instanceof $Symbol) throw TypeError('Symbol is not a constructor!');\n    var tag = uid(arguments.length > 0 ? arguments[0] : undefined);\n    var $set = function (value) {\n      if (this === ObjectProto) $set.call(OPSymbols, value);\n      if (has(this, HIDDEN) && has(this[HIDDEN], tag)) this[HIDDEN][tag] = false;\n      setSymbolDesc(this, tag, createDesc(1, value));\n    };\n    if (DESCRIPTORS && setter) setSymbolDesc(ObjectProto, tag, { configurable: true, set: $set });\n    return wrap(tag);\n  };\n  redefine($Symbol[PROTOTYPE], 'toString', function toString() {\n    return this._k;\n  });\n\n  $GOPD.f = $getOwnPropertyDescriptor;\n  $DP.f = $defineProperty;\n  require('./_object-gopn').f = gOPNExt.f = $getOwnPropertyNames;\n  require('./_object-pie').f = $propertyIsEnumerable;\n  $GOPS.f = $getOwnPropertySymbols;\n\n  if (DESCRIPTORS && !require('./_library')) {\n    redefine(ObjectProto, 'propertyIsEnumerable', $propertyIsEnumerable, true);\n  }\n\n  wksExt.f = function (name) {\n    return wrap(wks(name));\n  };\n}\n\n$export($export.G + $export.W + $export.F * !USE_NATIVE, { Symbol: $Symbol });\n\nfor (var es6Symbols = (\n  // 19.4.2.2, 19.4.2.3, 19.4.2.4, 19.4.2.6, 19.4.2.8, 19.4.2.9, 19.4.2.10, 19.4.2.11, 19.4.2.12, 19.4.2.13, 19.4.2.14\n  'hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables'\n).split(','), j = 0; es6Symbols.length > j;)wks(es6Symbols[j++]);\n\nfor (var wellKnownSymbols = $keys(wks.store), k = 0; wellKnownSymbols.length > k;) wksDefine(wellKnownSymbols[k++]);\n\n$export($export.S + $export.F * !USE_NATIVE, 'Symbol', {\n  // 19.4.2.1 Symbol.for(key)\n  'for': function (key) {\n    return has(SymbolRegistry, key += '')\n      ? SymbolRegistry[key]\n      : SymbolRegistry[key] = $Symbol(key);\n  },\n  // 19.4.2.5 Symbol.keyFor(sym)\n  keyFor: function keyFor(sym) {\n    if (!isSymbol(sym)) throw TypeError(sym + ' is not a symbol!');\n    for (var key in SymbolRegistry) if (SymbolRegistry[key] === sym) return key;\n  },\n  useSetter: function () { setter = true; },\n  useSimple: function () { setter = false; }\n});\n\n$export($export.S + $export.F * !USE_NATIVE, 'Object', {\n  // 19.1.2.2 Object.create(O [, Properties])\n  create: $create,\n  // 19.1.2.4 Object.defineProperty(O, P, Attributes)\n  defineProperty: $defineProperty,\n  // 19.1.2.3 Object.defineProperties(O, Properties)\n  defineProperties: $defineProperties,\n  // 19.1.2.6 Object.getOwnPropertyDescriptor(O, P)\n  getOwnPropertyDescriptor: $getOwnPropertyDescriptor,\n  // 19.1.2.7 Object.getOwnPropertyNames(O)\n  getOwnPropertyNames: $getOwnPropertyNames,\n  // 19.1.2.8 Object.getOwnPropertySymbols(O)\n  getOwnPropertySymbols: $getOwnPropertySymbols\n});\n\n// Chrome 38 and 39 `Object.getOwnPropertySymbols` fails on primitives\n// https://bugs.chromium.org/p/v8/issues/detail?id=3443\nvar FAILS_ON_PRIMITIVES = $fails(function () { $GOPS.f(1); });\n\n$export($export.S + $export.F * FAILS_ON_PRIMITIVES, 'Object', {\n  getOwnPropertySymbols: function getOwnPropertySymbols(it) {\n    return $GOPS.f(toObject(it));\n  }\n});\n\n// 24.3.2 JSON.stringify(value [, replacer [, space]])\n$JSON && $export($export.S + $export.F * (!USE_NATIVE || $fails(function () {\n  var S = $Symbol();\n  // MS Edge converts symbol values to JSON as {}\n  // WebKit converts symbol values to JSON as null\n  // V8 throws on boxed symbols\n  return _stringify([S]) != '[null]' || _stringify({ a: S }) != '{}' || _stringify(Object(S)) != '{}';\n})), 'JSON', {\n  stringify: function stringify(it) {\n    var args = [it];\n    var i = 1;\n    var replacer, $replacer;\n    while (arguments.length > i) args.push(arguments[i++]);\n    $replacer = replacer = args[1];\n    if (!isObject(replacer) && it === undefined || isSymbol(it)) return; // IE8 returns string on undefined\n    if (!isArray(replacer)) replacer = function (key, value) {\n      if (typeof $replacer == 'function') value = $replacer.call(this, key, value);\n      if (!isSymbol(value)) return value;\n    };\n    args[1] = replacer;\n    return _stringify.apply($JSON, args);\n  }\n});\n\n// 19.4.3.4 Symbol.prototype[@@toPrimitive](hint)\n$Symbol[PROTOTYPE][TO_PRIMITIVE] || require('./_hide')($Symbol[PROTOTYPE], TO_PRIMITIVE, $Symbol[PROTOTYPE].valueOf);\n// 19.4.3.5 Symbol.prototype[@@toStringTag]\nsetToStringTag($Symbol, 'Symbol');\n// 20.2.1.9 Math[@@toStringTag]\nsetToStringTag(Math, 'Math', true);\n// 24.3.3 JSON[@@toStringTag]\nsetToStringTag(global.JSON, 'JSON', true);\n","var META = require('./_uid')('meta');\nvar isObject = require('./_is-object');\nvar has = require('./_has');\nvar setDesc = require('./_object-dp').f;\nvar id = 0;\nvar isExtensible = Object.isExtensible || function () {\n  return true;\n};\nvar FREEZE = !require('./_fails')(function () {\n  return isExtensible(Object.preventExtensions({}));\n});\nvar setMeta = function (it) {\n  setDesc(it, META, { value: {\n    i: 'O' + ++id, // object ID\n    w: {}          // weak collections IDs\n  } });\n};\nvar fastKey = function (it, create) {\n  // return primitive with prefix\n  if (!isObject(it)) return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it;\n  if (!has(it, META)) {\n    // can't set metadata to uncaught frozen object\n    if (!isExtensible(it)) return 'F';\n    // not necessary to add metadata\n    if (!create) return 'E';\n    // add missing metadata\n    setMeta(it);\n  // return object ID\n  } return it[META].i;\n};\nvar getWeak = function (it, create) {\n  if (!has(it, META)) {\n    // can't set metadata to uncaught frozen object\n    if (!isExtensible(it)) return true;\n    // not necessary to add metadata\n    if (!create) return false;\n    // add missing metadata\n    setMeta(it);\n  // return hash weak collections IDs\n  } return it[META].w;\n};\n// add metadata on freeze-family methods calling\nvar onFreeze = function (it) {\n  if (FREEZE && meta.NEED && isExtensible(it) && !has(it, META)) setMeta(it);\n  return it;\n};\nvar meta = module.exports = {\n  KEY: META,\n  NEED: false,\n  fastKey: fastKey,\n  getWeak: getWeak,\n  onFreeze: onFreeze\n};\n","// all enumerable object keys, includes symbols\nvar getKeys = require('./_object-keys');\nvar gOPS = require('./_object-gops');\nvar pIE = require('./_object-pie');\nmodule.exports = function (it) {\n  var result = getKeys(it);\n  var getSymbols = gOPS.f;\n  if (getSymbols) {\n    var symbols = getSymbols(it);\n    var isEnum = pIE.f;\n    var i = 0;\n    var key;\n    while (symbols.length > i) if (isEnum.call(it, key = symbols[i++])) result.push(key);\n  } return result;\n};\n","// 7.2.2 IsArray(argument)\nvar cof = require('./_cof');\nmodule.exports = Array.isArray || function isArray(arg) {\n  return cof(arg) == 'Array';\n};\n","// fallback for IE11 buggy Object.getOwnPropertyNames with iframe and window\nvar toIObject = require('./_to-iobject');\nvar gOPN = require('./_object-gopn').f;\nvar toString = {}.toString;\n\nvar windowNames = typeof window == 'object' && window && Object.getOwnPropertyNames\n  ? Object.getOwnPropertyNames(window) : [];\n\nvar getWindowNames = function (it) {\n  try {\n    return gOPN(it);\n  } catch (e) {\n    return windowNames.slice();\n  }\n};\n\nmodule.exports.f = function getOwnPropertyNames(it) {\n  return windowNames && toString.call(it) == '[object Window]' ? getWindowNames(it) : gOPN(toIObject(it));\n};\n","require('./_wks-define')('asyncIterator');\n","require('./_wks-define')('observable');\n","module.exports = { \"default\": require(\"core-js/library/fn/object/set-prototype-of\"), __esModule: true };","require('../../modules/es6.object.set-prototype-of');\nmodule.exports = require('../../modules/_core').Object.setPrototypeOf;\n","// 19.1.3.19 Object.setPrototypeOf(O, proto)\nvar $export = require('./_export');\n$export($export.S, 'Object', { setPrototypeOf: require('./_set-proto').set });\n","// Works with __proto__ only. Old v8 can't work with null proto objects.\n/* eslint-disable no-proto */\nvar isObject = require('./_is-object');\nvar anObject = require('./_an-object');\nvar check = function (O, proto) {\n  anObject(O);\n  if (!isObject(proto) && proto !== null) throw TypeError(proto + \": can't set as prototype!\");\n};\nmodule.exports = {\n  set: Object.setPrototypeOf || ('__proto__' in {} ? // eslint-disable-line\n    function (test, buggy, set) {\n      try {\n        set = require('./_ctx')(Function.call, require('./_object-gopd').f(Object.prototype, '__proto__').set, 2);\n        set(test, []);\n        buggy = !(test instanceof Array);\n      } catch (e) { buggy = true; }\n      return function setPrototypeOf(O, proto) {\n        check(O, proto);\n        if (buggy) O.__proto__ = proto;\n        else set(O, proto);\n        return O;\n      };\n    }({}, false) : undefined),\n  check: check\n};\n","module.exports = { \"default\": require(\"core-js/library/fn/object/create\"), __esModule: true };","require('../../modules/es6.object.create');\nvar $Object = require('../../modules/_core').Object;\nmodule.exports = function create(P, D) {\n  return $Object.create(P, D);\n};\n","var $export = require('./_export');\n// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\n$export($export.S, 'Object', { create: require('./_object-create') });\n","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.CurrencyRatio = exports.Currency = undefined;\n\nvar _getIterator2 = require('babel-runtime/core-js/get-iterator');\n\nvar _getIterator3 = _interopRequireDefault(_getIterator2);\n\nvar _toArray2 = require('babel-runtime/helpers/toArray');\n\nvar _toArray3 = _interopRequireDefault(_toArray2);\n\nvar _assign = require('babel-runtime/core-js/object/assign');\n\nvar _assign2 = _interopRequireDefault(_assign);\n\nvar _getPrototypeOf = require('babel-runtime/core-js/object/get-prototype-of');\n\nvar _getPrototypeOf2 = _interopRequireDefault(_getPrototypeOf);\n\nvar _possibleConstructorReturn2 = require('babel-runtime/helpers/possibleConstructorReturn');\n\nvar _possibleConstructorReturn3 = _interopRequireDefault(_possibleConstructorReturn2);\n\nvar _inherits2 = require('babel-runtime/helpers/inherits');\n\nvar _inherits3 = _interopRequireDefault(_inherits2);\n\nvar _classCallCheck2 = require('babel-runtime/helpers/classCallCheck');\n\nvar _classCallCheck3 = _interopRequireDefault(_classCallCheck2);\n\nvar _createClass2 = require('babel-runtime/helpers/createClass');\n\nvar _createClass3 = _interopRequireDefault(_createClass2);\n\nvar _bignumber = require('bignumber.js');\n\nvar _bignumber2 = _interopRequireDefault(_bignumber);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction amountToBigNumber(amount) {\n  if (amount instanceof Currency || typeof amount.toBigNumber === 'function') return amount.toBigNumber();\n\n  var value = (0, _bignumber2.default)(amount);\n  if (value.isNaN()) throw new Error('amount \"' + amount + '\" is not a number');\n  return value;\n}\n\nvar Currency = exports.Currency = function () {\n  function Currency(amount) {\n    var shift = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n    (0, _classCallCheck3.default)(this, Currency);\n\n    if (shift === 'wei') shift = -18;\n    if (shift === 'ray') shift = -27;\n    if (shift === 'rad') shift = -45;\n    this._amount = shift ? amountToBigNumber(amount).shiftedBy(shift) : amountToBigNumber(amount);\n    this.symbol = '???';\n  }\n\n  (0, _createClass3.default)(Currency, [{\n    key: 'isEqual',\n    value: function isEqual(other) {\n      return this._amount.eq(other._amount) && this.symbol == other.symbol;\n    }\n  }, {\n    key: 'toString',\n    value: function toString() {\n      var decimals = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 2;\n\n      return this._amount.toFixed(decimals) + ' ' + this.symbol;\n    }\n  }, {\n    key: 'toBigNumber',\n    value: function toBigNumber() {\n      return this._amount;\n    }\n  }, {\n    key: 'toNumber',\n    value: function toNumber() {\n      return this._amount.toNumber();\n    }\n  }, {\n    key: 'toFixed',\n    value: function toFixed() {\n      var shift = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 0;\n\n      if (shift === 'wei') shift = 18;\n      if (shift === 'ray') shift = 27;\n      if (shift === 'rad') shift = 45;\n\n      // always round down so that we never attempt to spend more than we have\n      return this._amount.shiftedBy(shift).integerValue(_bignumber2.default.ROUND_DOWN).toFixed();\n    }\n  }, {\n    key: 'isSameType',\n    value: function isSameType(other) {\n      return this.symbol === other.symbol;\n    }\n  }]);\n  return Currency;\n}();\n\n// FIXME: this is not exactly analogous to Currency above, because all the\n// different pairs are instances of the same class rather than subclasses in\n// their own right. but for now it works fine, because it's the wrapper\n// functions that are used externally anyway. so if we want to be consistent, we\n// could either create subclasses for each ratio, or refactor Currency so it\n// also just stores its symbol in the instance rather than the subclass.\n\n\nvar CurrencyRatio = exports.CurrencyRatio = function (_Currency) {\n  (0, _inherits3.default)(CurrencyRatio, _Currency);\n\n  function CurrencyRatio(amount, numerator, denominator, shift) {\n    (0, _classCallCheck3.default)(this, CurrencyRatio);\n\n    var _this = (0, _possibleConstructorReturn3.default)(this, (CurrencyRatio.__proto__ || (0, _getPrototypeOf2.default)(CurrencyRatio)).call(this, amount, shift));\n\n    _this.numerator = numerator;\n    _this.denominator = denominator;\n    _this.symbol = numerator.symbol + '/' + denominator.symbol;\n    return _this;\n  }\n\n  return CurrencyRatio;\n}(Currency);\n\nvar mathFunctions = [['plus', 'add'], ['minus', 'sub'], ['times', 'multipliedBy', 'mul'], ['div', 'dividedBy'], ['shiftedBy']];\n\nvar booleanFunctions = [['isLessThan', 'lt'], ['isLessThanOrEqualTo', 'lte'], ['isGreaterThan', 'gt'], ['isGreaterThanOrEqualTo', 'gte'], ['eq']];\n\nfunction assertValidOperation(method, left, right) {\n  if (!right && right !== 0) {\n    throw new Error('Invalid operation: ' + left.symbol + ' ' + method + ' with no right operand');\n  }\n\n  if (!(right instanceof Currency) || left.isSameType(right)) return;\n\n  if (right instanceof CurrencyRatio) {\n    // only supporting Currency as a left operand for now, though we could\n    // extend this to support ratio-ratio math if needed\n    switch (method) {\n      case 'times':\n        if (left.isSameType(right.denominator)) return;\n        break;\n      case 'div':\n        if (left.isSameType(right.numerator)) return;\n        break;\n    }\n  } else {\n    switch (method) {\n      // division between two different units results in a ratio, e.g. USD/DAI\n      case 'div':\n        return;\n    }\n  }\n\n  throw new Error('Invalid operation: ' + left.symbol + ' ' + method + ' ' + right.symbol);\n}\n\nfunction bigNumberFnResult(method, left, right, value) {\n  if (right instanceof CurrencyRatio) {\n    switch (method) {\n      case 'times':\n        return new right.numerator(value);\n      case 'div':\n        return new right.denominator(value);\n    }\n  }\n\n  if (!(right instanceof Currency) || left.isSameType(right)) {\n    if (left instanceof CurrencyRatio) {\n      return new left.constructor(value, left.numerator, left.denominator, left.shift);\n    }\n    return new left.constructor(value);\n  }\n\n  return new CurrencyRatio(value, left.constructor, right.constructor);\n}\n\nfunction bigNumberFnWrapper(method, isBoolean) {\n  return function (other) {\n    assertValidOperation(method, this, other);\n\n    var otherBigNumber = other instanceof Currency ? other.toBigNumber() : other;\n\n    var value = this.toBigNumber()[method](otherBigNumber);\n    return isBoolean ? value : bigNumberFnResult(method, this, other, value);\n  };\n}\n\n(0, _assign2.default)(Currency.prototype, mathFunctions.reduce(function (output, _ref) {\n  var _ref2 = (0, _toArray3.default)(_ref),\n      method = _ref2[0],\n      aliases = _ref2.slice(1);\n\n  output[method] = bigNumberFnWrapper(method);\n  var _iteratorNormalCompletion = true;\n  var _didIteratorError = false;\n  var _iteratorError = undefined;\n\n  try {\n    for (var _iterator = (0, _getIterator3.default)(aliases), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n      var alias = _step.value;\n\n      output[alias] = output[method];\n    }\n  } catch (err) {\n    _didIteratorError = true;\n    _iteratorError = err;\n  } finally {\n    try {\n      if (!_iteratorNormalCompletion && _iterator.return) {\n        _iterator.return();\n      }\n    } finally {\n      if (_didIteratorError) {\n        throw _iteratorError;\n      }\n    }\n  }\n\n  return output;\n}, {}), booleanFunctions.reduce(function (output, _ref3) {\n  var _ref4 = (0, _toArray3.default)(_ref3),\n      method = _ref4[0],\n      aliases = _ref4.slice(1);\n\n  output[method] = bigNumberFnWrapper(method, true);\n  var _iteratorNormalCompletion2 = true;\n  var _didIteratorError2 = false;\n  var _iteratorError2 = undefined;\n\n  try {\n    for (var _iterator2 = (0, _getIterator3.default)(aliases), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n      var alias = _step2.value;\n\n      output[alias] = output[method];\n    }\n  } catch (err) {\n    _didIteratorError2 = true;\n    _iteratorError2 = err;\n  } finally {\n    try {\n      if (!_iteratorNormalCompletion2 && _iterator2.return) {\n        _iterator2.return();\n      }\n    } finally {\n      if (_didIteratorError2) {\n        throw _iteratorError2;\n      }\n    }\n  }\n\n  return output;\n}, {}));","module.exports = { \"default\": require(\"core-js/library/fn/get-iterator\"), __esModule: true };","require('../modules/web.dom.iterable');\nrequire('../modules/es6.string.iterator');\nmodule.exports = require('../modules/core.get-iterator');\n","var anObject = require('./_an-object');\nvar get = require('./core.get-iterator-method');\nmodule.exports = require('./_core').getIterator = function (it) {\n  var iterFn = get(it);\n  if (typeof iterFn != 'function') throw TypeError(it + ' is not iterable!');\n  return anObject(iterFn.call(it));\n};\n","// getting tag from 19.1.3.6 Object.prototype.toString()\nvar cof = require('./_cof');\nvar TAG = require('./_wks')('toStringTag');\n// ES3 wrong here\nvar ARG = cof(function () { return arguments; }()) == 'Arguments';\n\n// fallback for IE11 Script Access Denied error\nvar tryGet = function (it, key) {\n  try {\n    return it[key];\n  } catch (e) { /* empty */ }\n};\n\nmodule.exports = function (it) {\n  var O, T, B;\n  return it === undefined ? 'Undefined' : it === null ? 'Null'\n    // @@toStringTag case\n    : typeof (T = tryGet(O = Object(it), TAG)) == 'string' ? T\n    // builtinTag case\n    : ARG ? cof(O)\n    // ES3 arguments fallback\n    : (B = cof(O)) == 'Object' && typeof O.callee == 'function' ? 'Arguments' : B;\n};\n","\"use strict\";\n\nexports.__esModule = true;\n\nvar _from = require(\"../core-js/array/from\");\n\nvar _from2 = _interopRequireDefault(_from);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.default = function (arr) {\n  return Array.isArray(arr) ? arr : (0, _from2.default)(arr);\n};","module.exports = { \"default\": require(\"core-js/library/fn/array/from\"), __esModule: true };","require('../../modules/es6.string.iterator');\nrequire('../../modules/es6.array.from');\nmodule.exports = require('../../modules/_core').Array.from;\n","'use strict';\nvar ctx = require('./_ctx');\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar call = require('./_iter-call');\nvar isArrayIter = require('./_is-array-iter');\nvar toLength = require('./_to-length');\nvar createProperty = require('./_create-property');\nvar getIterFn = require('./core.get-iterator-method');\n\n$export($export.S + $export.F * !require('./_iter-detect')(function (iter) { Array.from(iter); }), 'Array', {\n  // 22.1.2.1 Array.from(arrayLike, mapfn = undefined, thisArg = undefined)\n  from: function from(arrayLike /* , mapfn = undefined, thisArg = undefined */) {\n    var O = toObject(arrayLike);\n    var C = typeof this == 'function' ? this : Array;\n    var aLen = arguments.length;\n    var mapfn = aLen > 1 ? arguments[1] : undefined;\n    var mapping = mapfn !== undefined;\n    var index = 0;\n    var iterFn = getIterFn(O);\n    var length, result, step, iterator;\n    if (mapping) mapfn = ctx(mapfn, aLen > 2 ? arguments[2] : undefined, 2);\n    // if object isn't iterable or it's array with default iterator - use simple case\n    if (iterFn != undefined && !(C == Array && isArrayIter(iterFn))) {\n      for (iterator = iterFn.call(O), result = new C(); !(step = iterator.next()).done; index++) {\n        createProperty(result, index, mapping ? call(iterator, mapfn, [step.value, index], true) : step.value);\n      }\n    } else {\n      length = toLength(O.length);\n      for (result = new C(length); length > index; index++) {\n        createProperty(result, index, mapping ? mapfn(O[index], index) : O[index]);\n      }\n    }\n    result.length = index;\n    return result;\n  }\n});\n","// call something on iterator step with safe closing on error\nvar anObject = require('./_an-object');\nmodule.exports = function (iterator, fn, value, entries) {\n  try {\n    return entries ? fn(anObject(value)[0], value[1]) : fn(value);\n  // 7.4.6 IteratorClose(iterator, completion)\n  } catch (e) {\n    var ret = iterator['return'];\n    if (ret !== undefined) anObject(ret.call(iterator));\n    throw e;\n  }\n};\n","// check on default Array iterator\nvar Iterators = require('./_iterators');\nvar ITERATOR = require('./_wks')('iterator');\nvar ArrayProto = Array.prototype;\n\nmodule.exports = function (it) {\n  return it !== undefined && (Iterators.Array === it || ArrayProto[ITERATOR] === it);\n};\n","'use strict';\nvar $defineProperty = require('./_object-dp');\nvar createDesc = require('./_property-desc');\n\nmodule.exports = function (object, index, value) {\n  if (index in object) $defineProperty.f(object, index, createDesc(0, value));\n  else object[index] = value;\n};\n","var ITERATOR = require('./_wks')('iterator');\nvar SAFE_CLOSING = false;\n\ntry {\n  var riter = [7][ITERATOR]();\n  riter['return'] = function () { SAFE_CLOSING = true; };\n  // eslint-disable-next-line no-throw-literal\n  Array.from(riter, function () { throw 2; });\n} catch (e) { /* empty */ }\n\nmodule.exports = function (exec, skipClosing) {\n  if (!skipClosing && !SAFE_CLOSING) return false;\n  var safe = false;\n  try {\n    var arr = [7];\n    var iter = arr[ITERATOR]();\n    iter.next = function () { return { done: safe = true }; };\n    arr[ITERATOR] = function () { return iter; };\n    exec(arr);\n  } catch (e) { /* empty */ }\n  return safe;\n};\n","\"use strict\";\n\nexports.__esModule = true;\n\nvar _defineProperty = require(\"../core-js/object/define-property\");\n\nvar _defineProperty2 = _interopRequireDefault(_defineProperty);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.default = function () {\n  function defineProperties(target, props) {\n    for (var i = 0; i < props.length; i++) {\n      var descriptor = props[i];\n      descriptor.enumerable = descriptor.enumerable || false;\n      descriptor.configurable = true;\n      if (\"value\" in descriptor) descriptor.writable = true;\n      (0, _defineProperty2.default)(target, descriptor.key, descriptor);\n    }\n  }\n\n  return function (Constructor, protoProps, staticProps) {\n    if (protoProps) defineProperties(Constructor.prototype, protoProps);\n    if (staticProps) defineProperties(Constructor, staticProps);\n    return Constructor;\n  };\n}();","module.exports = { \"default\": require(\"core-js/library/fn/object/define-property\"), __esModule: true };","require('../../modules/es6.object.define-property');\nvar $Object = require('../../modules/_core').Object;\nmodule.exports = function defineProperty(it, key, desc) {\n  return $Object.defineProperty(it, key, desc);\n};\n","var $export = require('./_export');\n// 19.1.2.4 / 15.2.3.6 Object.defineProperty(O, P, Attributes)\n$export($export.S + $export.F * !require('./_descriptors'), 'Object', { defineProperty: require('./_object-dp').f });\n",";(function (globalObject) {\r\n  'use strict';\r\n\r\n/*\r\n *      bignumber.js v8.1.1\r\n *      A JavaScript library for arbitrary-precision arithmetic.\r\n *      https://github.com/MikeMcl/bignumber.js\r\n *      Copyright (c) 2019 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *      MIT Licensed.\r\n *\r\n *      BigNumber.prototype methods     |  BigNumber methods\r\n *                                      |\r\n *      absoluteValue            abs    |  clone\r\n *      comparedTo                      |  config               set\r\n *      decimalPlaces            dp     |      DECIMAL_PLACES\r\n *      dividedBy                div    |      ROUNDING_MODE\r\n *      dividedToIntegerBy       idiv   |      EXPONENTIAL_AT\r\n *      exponentiatedBy          pow    |      RANGE\r\n *      integerValue                    |      CRYPTO\r\n *      isEqualTo                eq     |      MODULO_MODE\r\n *      isFinite                        |      POW_PRECISION\r\n *      isGreaterThan            gt     |      FORMAT\r\n *      isGreaterThanOrEqualTo   gte    |      ALPHABET\r\n *      isInteger                       |  isBigNumber\r\n *      isLessThan               lt     |  maximum              max\r\n *      isLessThanOrEqualTo      lte    |  minimum              min\r\n *      isNaN                           |  random\r\n *      isNegative                      |  sum\r\n *      isPositive                      |\r\n *      isZero                          |\r\n *      minus                           |\r\n *      modulo                   mod    |\r\n *      multipliedBy             times  |\r\n *      negated                         |\r\n *      plus                            |\r\n *      precision                sd     |\r\n *      shiftedBy                       |\r\n *      squareRoot               sqrt   |\r\n *      toExponential                   |\r\n *      toFixed                         |\r\n *      toFormat                        |\r\n *      toFraction                      |\r\n *      toJSON                          |\r\n *      toNumber                        |\r\n *      toPrecision                     |\r\n *      toString                        |\r\n *      valueOf                         |\r\n *\r\n */\r\n\r\n\r\n  var BigNumber,\r\n    isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n    hasSymbol = typeof Symbol == 'function' && typeof Symbol.iterator == 'symbol',\r\n\r\n    mathceil = Math.ceil,\r\n    mathfloor = Math.floor,\r\n\r\n    bignumberError = '[BigNumber Error] ',\r\n    tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n    BASE = 1e14,\r\n    LOG_BASE = 14,\r\n    MAX_SAFE_INTEGER = 0x1fffffffffffff,         // 2^53 - 1\r\n    // MAX_INT32 = 0x7fffffff,                   // 2^31 - 1\r\n    POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n    SQRT_BASE = 1e7,\r\n\r\n    // EDITABLE\r\n    // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n    // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n    MAX = 1E9;                                   // 0 to MAX_INT32\r\n\r\n\r\n  /*\r\n   * Create and return a BigNumber constructor.\r\n   */\r\n  function clone(configObject) {\r\n    var div, convertBase, parseNumeric,\r\n      P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n      ONE = new BigNumber(1),\r\n\r\n\r\n      //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n      // The default values below must be integers within the inclusive ranges stated.\r\n      // The values can also be changed at run-time using BigNumber.set.\r\n\r\n      // The maximum number of decimal places for operations involving division.\r\n      DECIMAL_PLACES = 20,                     // 0 to MAX\r\n\r\n      // The rounding mode used when rounding to the above decimal places, and when using\r\n      // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n      // UP         0 Away from zero.\r\n      // DOWN       1 Towards zero.\r\n      // CEIL       2 Towards +Infinity.\r\n      // FLOOR      3 Towards -Infinity.\r\n      // HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      ROUNDING_MODE = 4,                       // 0 to 8\r\n\r\n      // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n      // The exponent value at and beneath which toString returns exponential notation.\r\n      // Number type: -7\r\n      TO_EXP_NEG = -7,                         // 0 to -MAX\r\n\r\n      // The exponent value at and above which toString returns exponential notation.\r\n      // Number type: 21\r\n      TO_EXP_POS = 21,                         // 0 to MAX\r\n\r\n      // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // Number type: -324  (5e-324)\r\n      MIN_EXP = -1e7,                          // -1 to -MAX\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // Number type:  308  (1.7976931348623157e+308)\r\n      // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n      MAX_EXP = 1e7,                           // 1 to MAX\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      CRYPTO = false,                          // true or false\r\n\r\n      // The modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP        0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN      1 The remainder has the same sign as the dividend.\r\n      //             This modulo mode is commonly known as 'truncated division' and is\r\n      //             equivalent to (a % n) in JavaScript.\r\n      // FLOOR     3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n      // EUCLID    9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n      //             The remainder is always positive.\r\n      //\r\n      // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n      // modes are commonly used for the modulus operation.\r\n      // Although the other rounding modes can also be used, they may not give useful results.\r\n      MODULO_MODE = 1,                         // 0 to 9\r\n\r\n      // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n      // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n      POW_PRECISION = 0,                    // 0 to MAX\r\n\r\n      // The format specification used by the BigNumber.prototype.toFormat method.\r\n      FORMAT = {\r\n        prefix: '',\r\n        groupSize: 3,\r\n        secondaryGroupSize: 0,\r\n        groupSeparator: ',',\r\n        decimalSeparator: '.',\r\n        fractionGroupSize: 0,\r\n        fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n        suffix: ''\r\n      },\r\n\r\n      // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n      // '-', '.', whitespace, or repeated character.\r\n      // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n      ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz';\r\n\r\n\r\n    //------------------------------------------------------------------------------------------\r\n\r\n\r\n    // CONSTRUCTOR\r\n\r\n\r\n    /*\r\n     * The BigNumber constructor and exported function.\r\n     * Create and return a new instance of a BigNumber object.\r\n     *\r\n     * v {number|string|BigNumber} A numeric value.\r\n     * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n     */\r\n    function BigNumber(v, b) {\r\n      var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n        x = this;\r\n\r\n      // Enable constructor call without `new`.\r\n      if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n      if (b == null) {\r\n\r\n        if (v && v._isBigNumber === true) {\r\n          x.s = v.s;\r\n\r\n          if (!v.c || v.e > MAX_EXP) {\r\n            x.c = x.e = null;\r\n          } else if (v.e < MIN_EXP) {\r\n            x.c = [x.e = 0];\r\n          } else {\r\n            x.e = v.e;\r\n            x.c = v.c.slice();\r\n          }\r\n\r\n          return;\r\n        }\r\n\r\n        if ((isNum = typeof v == 'number') && v * 0 == 0) {\r\n\r\n          // Use `1 / n` to handle minus zero also.\r\n          x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n          // Fast path for integers, where n < 2147483648 (2**31).\r\n          if (v === ~~v) {\r\n            for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n            if (e > MAX_EXP) {\r\n              x.c = x.e = null;\r\n            } else {\r\n              x.e = e;\r\n              x.c = [v];\r\n            }\r\n\r\n            return;\r\n          }\r\n\r\n          str = String(v);\r\n        } else {\r\n\r\n          if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n          x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n        // Exponential form?\r\n        if ((i = str.search(/e/i)) > 0) {\r\n\r\n          // Determine exponent.\r\n          if (e < 0) e = i;\r\n          e += +str.slice(i + 1);\r\n          str = str.substring(0, i);\r\n        } else if (e < 0) {\r\n\r\n          // Integer.\r\n          e = str.length;\r\n        }\r\n\r\n      } else {\r\n\r\n        // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n        intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n        // Allow exponential notation to be used with base 10 argument, while\r\n        // also rounding to DECIMAL_PLACES as with other bases.\r\n        if (b == 10) {\r\n          x = new BigNumber(v);\r\n          return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n        }\r\n\r\n        str = String(v);\r\n\r\n        if (isNum = typeof v == 'number') {\r\n\r\n          // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n          if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n          x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n          // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n          if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n            throw Error\r\n             (tooManyDigits + v);\r\n          }\r\n        } else {\r\n          x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        alphabet = ALPHABET.slice(0, b);\r\n        e = i = 0;\r\n\r\n        // Check that str is a valid base b number.\r\n        // Don't use RegExp, so alphabet can contain special characters.\r\n        for (len = str.length; i < len; i++) {\r\n          if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n            if (c == '.') {\r\n\r\n              // If '.' is not the first character and it has not be found before.\r\n              if (i > e) {\r\n                e = len;\r\n                continue;\r\n              }\r\n            } else if (!caseChanged) {\r\n\r\n              // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n              if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n                  str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n                caseChanged = true;\r\n                i = -1;\r\n                e = 0;\r\n                continue;\r\n              }\r\n            }\r\n\r\n            return parseNumeric(x, String(v), isNum, b);\r\n          }\r\n        }\r\n\r\n        // Prevent later check for length on converted number.\r\n        isNum = false;\r\n        str = convertBase(str, b, 10, x.s);\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n        else e = str.length;\r\n      }\r\n\r\n      // Determine leading zeros.\r\n      for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n      // Determine trailing zeros.\r\n      for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n      if (str = str.slice(i, ++len)) {\r\n        len -= i;\r\n\r\n        // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n        if (isNum && BigNumber.DEBUG &&\r\n          len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r\n            throw Error\r\n             (tooManyDigits + (x.s * v));\r\n        }\r\n\r\n         // Overflow?\r\n        if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n          // Infinity.\r\n          x.c = x.e = null;\r\n\r\n        // Underflow?\r\n        } else if (e < MIN_EXP) {\r\n\r\n          // Zero.\r\n          x.c = [x.e = 0];\r\n        } else {\r\n          x.e = e;\r\n          x.c = [];\r\n\r\n          // Transform base\r\n\r\n          // e is the base 10 exponent.\r\n          // i is where to slice str to get the first element of the coefficient array.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (e < 0) i += LOG_BASE;  // i < 1\r\n\r\n          if (i < len) {\r\n            if (i) x.c.push(+str.slice(0, i));\r\n\r\n            for (len -= LOG_BASE; i < len;) {\r\n              x.c.push(+str.slice(i, i += LOG_BASE));\r\n            }\r\n\r\n            i = LOG_BASE - (str = str.slice(i)).length;\r\n          } else {\r\n            i -= len;\r\n          }\r\n\r\n          for (; i--; str += '0');\r\n          x.c.push(+str);\r\n        }\r\n      } else {\r\n\r\n        // Zero.\r\n        x.c = [x.e = 0];\r\n      }\r\n    }\r\n\r\n\r\n    // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n    BigNumber.clone = clone;\r\n\r\n    BigNumber.ROUND_UP = 0;\r\n    BigNumber.ROUND_DOWN = 1;\r\n    BigNumber.ROUND_CEIL = 2;\r\n    BigNumber.ROUND_FLOOR = 3;\r\n    BigNumber.ROUND_HALF_UP = 4;\r\n    BigNumber.ROUND_HALF_DOWN = 5;\r\n    BigNumber.ROUND_HALF_EVEN = 6;\r\n    BigNumber.ROUND_HALF_CEIL = 7;\r\n    BigNumber.ROUND_HALF_FLOOR = 8;\r\n    BigNumber.EUCLID = 9;\r\n\r\n\r\n    /*\r\n     * Configure infrequently-changing library-wide settings.\r\n     *\r\n     * Accept an object with the following optional properties (if the value of a property is\r\n     * a number, it must be an integer within the inclusive range stated):\r\n     *\r\n     *   DECIMAL_PLACES   {number}           0 to MAX\r\n     *   ROUNDING_MODE    {number}           0 to 8\r\n     *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]\r\n     *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]\r\n     *   CRYPTO           {boolean}          true or false\r\n     *   MODULO_MODE      {number}           0 to 9\r\n     *   POW_PRECISION       {number}           0 to MAX\r\n     *   ALPHABET         {string}           A string of two or more unique characters which does\r\n     *                                       not contain '.'.\r\n     *   FORMAT           {object}           An object with some of the following properties:\r\n     *     prefix                 {string}\r\n     *     groupSize              {number}\r\n     *     secondaryGroupSize     {number}\r\n     *     groupSeparator         {string}\r\n     *     decimalSeparator       {string}\r\n     *     fractionGroupSize      {number}\r\n     *     fractionGroupSeparator {string}\r\n     *     suffix                 {string}\r\n     *\r\n     * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n     *\r\n     * E.g.\r\n     * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n     *\r\n     * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n     *\r\n     * Return an object with the properties current values.\r\n     */\r\n    BigNumber.config = BigNumber.set = function (obj) {\r\n      var p, v;\r\n\r\n      if (obj != null) {\r\n\r\n        if (typeof obj == 'object') {\r\n\r\n          // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            DECIMAL_PLACES = v;\r\n          }\r\n\r\n          // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n          // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 8, p);\r\n            ROUNDING_MODE = v;\r\n          }\r\n\r\n          // EXPONENTIAL_AT {number|number[]}\r\n          // Integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n          // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n            v = obj[p];\r\n            if (v && v.pop) {\r\n              intCheck(v[0], -MAX, 0, p);\r\n              intCheck(v[1], 0, MAX, p);\r\n              TO_EXP_NEG = v[0];\r\n              TO_EXP_POS = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n            }\r\n          }\r\n\r\n          // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n          // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n          if (obj.hasOwnProperty(p = 'RANGE')) {\r\n            v = obj[p];\r\n            if (v && v.pop) {\r\n              intCheck(v[0], -MAX, -1, p);\r\n              intCheck(v[1], 1, MAX, p);\r\n              MIN_EXP = v[0];\r\n              MAX_EXP = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              if (v) {\r\n                MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n              } else {\r\n                throw Error\r\n                 (bignumberError + p + ' cannot be zero: ' + v);\r\n              }\r\n            }\r\n          }\r\n\r\n          // CRYPTO {boolean} true or false.\r\n          // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n          // '[BigNumber Error] crypto unavailable'\r\n          if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n            v = obj[p];\r\n            if (v === !!v) {\r\n              if (v) {\r\n                if (typeof crypto != 'undefined' && crypto &&\r\n                 (crypto.getRandomValues || crypto.randomBytes)) {\r\n                  CRYPTO = v;\r\n                } else {\r\n                  CRYPTO = !v;\r\n                  throw Error\r\n                   (bignumberError + 'crypto unavailable');\r\n                }\r\n              } else {\r\n                CRYPTO = v;\r\n              }\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' not true or false: ' + v);\r\n            }\r\n          }\r\n\r\n          // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n          // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 9, p);\r\n            MODULO_MODE = v;\r\n          }\r\n\r\n          // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            POW_PRECISION = v;\r\n          }\r\n\r\n          // FORMAT {object}\r\n          // '[BigNumber Error] FORMAT not an object: {v}'\r\n          if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n            v = obj[p];\r\n            if (typeof v == 'object') FORMAT = v;\r\n            else throw Error\r\n             (bignumberError + p + ' not an object: ' + v);\r\n          }\r\n\r\n          // ALPHABET {string}\r\n          // '[BigNumber Error] ALPHABET invalid: {v}'\r\n          if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n            v = obj[p];\r\n\r\n            // Disallow if only one character,\r\n            // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n            if (typeof v == 'string' && !/^.$|[+-.\\s]|(.).*\\1/.test(v)) {\r\n              ALPHABET = v;\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' invalid: ' + v);\r\n            }\r\n          }\r\n\r\n        } else {\r\n\r\n          // '[BigNumber Error] Object expected: {v}'\r\n          throw Error\r\n           (bignumberError + 'Object expected: ' + obj);\r\n        }\r\n      }\r\n\r\n      return {\r\n        DECIMAL_PLACES: DECIMAL_PLACES,\r\n        ROUNDING_MODE: ROUNDING_MODE,\r\n        EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n        RANGE: [MIN_EXP, MAX_EXP],\r\n        CRYPTO: CRYPTO,\r\n        MODULO_MODE: MODULO_MODE,\r\n        POW_PRECISION: POW_PRECISION,\r\n        FORMAT: FORMAT,\r\n        ALPHABET: ALPHABET\r\n      };\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if v is a BigNumber instance, otherwise return false.\r\n     *\r\n     * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n     *\r\n     * v {any}\r\n     *\r\n     * '[BigNumber Error] Invalid BigNumber: {v}'\r\n     */\r\n    BigNumber.isBigNumber = function (v) {\r\n      if (!v || v._isBigNumber !== true) return false;\r\n      if (!BigNumber.DEBUG) return true;\r\n\r\n      var i, n,\r\n        c = v.c,\r\n        e = v.e,\r\n        s = v.s;\r\n\r\n      out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n        if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n          // If the first element is zero, the BigNumber value must be zero.\r\n          if (c[0] === 0) {\r\n            if (e === 0 && c.length === 1) return true;\r\n            break out;\r\n          }\r\n\r\n          // Calculate number of digits that c[0] should have, based on the exponent.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (i < 1) i += LOG_BASE;\r\n\r\n          // Calculate number of digits of c[0].\r\n          //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n          if (String(c[0]).length == i) {\r\n\r\n            for (i = 0; i < c.length; i++) {\r\n              n = c[i];\r\n              if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r\n            }\r\n\r\n            // Last element cannot be zero, unless it is the only element.\r\n            if (n !== 0) return true;\r\n          }\r\n        }\r\n\r\n      // Infinity/NaN\r\n      } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r\n        return true;\r\n      }\r\n\r\n      throw Error\r\n        (bignumberError + 'Invalid BigNumber: ' + v);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the maximum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.maximum = BigNumber.max = function () {\r\n      return maxOrMin(arguments, P.lt);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the minimum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.minimum = BigNumber.min = function () {\r\n      return maxOrMin(arguments, P.gt);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n     * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n     * zeros are produced).\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n     * '[BigNumber Error] crypto unavailable'\r\n     */\r\n    BigNumber.random = (function () {\r\n      var pow2_53 = 0x20000000000000;\r\n\r\n      // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n      // Check if Math.random() produces more than 32 bits of randomness.\r\n      // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n      // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n      var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n       ? function () { return mathfloor(Math.random() * pow2_53); }\r\n       : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n         (Math.random() * 0x800000 | 0); };\r\n\r\n      return function (dp) {\r\n        var a, b, e, k, v,\r\n          i = 0,\r\n          c = [],\r\n          rand = new BigNumber(ONE);\r\n\r\n        if (dp == null) dp = DECIMAL_PLACES;\r\n        else intCheck(dp, 0, MAX);\r\n\r\n        k = mathceil(dp / LOG_BASE);\r\n\r\n        if (CRYPTO) {\r\n\r\n          // Browsers supporting crypto.getRandomValues.\r\n          if (crypto.getRandomValues) {\r\n\r\n            a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n            for (; i < k;) {\r\n\r\n              // 53 bits:\r\n              // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n              // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n              // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n              //                                     11111 11111111 11111111\r\n              // 0x20000 is 2^21.\r\n              v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n              // Rejection sampling:\r\n              // 0 <= v < 9007199254740992\r\n              // Probability that v >= 9e15, is\r\n              // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n              if (v >= 9e15) {\r\n                b = crypto.getRandomValues(new Uint32Array(2));\r\n                a[i] = b[0];\r\n                a[i + 1] = b[1];\r\n              } else {\r\n\r\n                // 0 <= v <= 8999999999999999\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 2;\r\n              }\r\n            }\r\n            i = k / 2;\r\n\r\n          // Node.js supporting crypto.randomBytes.\r\n          } else if (crypto.randomBytes) {\r\n\r\n            // buffer\r\n            a = crypto.randomBytes(k *= 7);\r\n\r\n            for (; i < k;) {\r\n\r\n              // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n              // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n              // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n              // 0 <= v < 9007199254740992\r\n              v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n                 (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n                 (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n              if (v >= 9e15) {\r\n                crypto.randomBytes(7).copy(a, i);\r\n              } else {\r\n\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 7;\r\n              }\r\n            }\r\n            i = k / 7;\r\n          } else {\r\n            CRYPTO = false;\r\n            throw Error\r\n             (bignumberError + 'crypto unavailable');\r\n          }\r\n        }\r\n\r\n        // Use Math.random.\r\n        if (!CRYPTO) {\r\n\r\n          for (; i < k;) {\r\n            v = random53bitInt();\r\n            if (v < 9e15) c[i++] = v % 1e14;\r\n          }\r\n        }\r\n\r\n        k = c[--i];\r\n        dp %= LOG_BASE;\r\n\r\n        // Convert trailing digits to zeros according to dp.\r\n        if (k && dp) {\r\n          v = POWS_TEN[LOG_BASE - dp];\r\n          c[i] = mathfloor(k / v) * v;\r\n        }\r\n\r\n        // Remove trailing elements which are zero.\r\n        for (; c[i] === 0; c.pop(), i--);\r\n\r\n        // Zero?\r\n        if (i < 0) {\r\n          c = [e = 0];\r\n        } else {\r\n\r\n          // Remove leading elements which are zero and adjust exponent accordingly.\r\n          for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n          // Count the digits of the first element of c to determine leading zeros, and...\r\n          for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n          // adjust the exponent accordingly.\r\n          if (i < LOG_BASE) e -= LOG_BASE - i;\r\n        }\r\n\r\n        rand.e = e;\r\n        rand.c = c;\r\n        return rand;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the sum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.sum = function () {\r\n      var i = 1,\r\n        args = arguments,\r\n        sum = new BigNumber(args[0]);\r\n      for (; i < args.length;) sum = sum.plus(args[i++]);\r\n      return sum;\r\n    };\r\n\r\n\r\n    // PRIVATE FUNCTIONS\r\n\r\n\r\n    // Called by BigNumber and BigNumber.prototype.toString.\r\n    convertBase = (function () {\r\n      var decimal = '0123456789';\r\n\r\n      /*\r\n       * Convert string of baseIn to an array of numbers of baseOut.\r\n       * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n       * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n       */\r\n      function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n        var j,\r\n          arr = [0],\r\n          arrL,\r\n          i = 0,\r\n          len = str.length;\r\n\r\n        for (; i < len;) {\r\n          for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n          arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n          for (j = 0; j < arr.length; j++) {\r\n\r\n            if (arr[j] > baseOut - 1) {\r\n              if (arr[j + 1] == null) arr[j + 1] = 0;\r\n              arr[j + 1] += arr[j] / baseOut | 0;\r\n              arr[j] %= baseOut;\r\n            }\r\n          }\r\n        }\r\n\r\n        return arr.reverse();\r\n      }\r\n\r\n      // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n      // If the caller is toString, we are converting from base 10 to baseOut.\r\n      // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n      return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n        var alphabet, d, e, k, r, x, xc, y,\r\n          i = str.indexOf('.'),\r\n          dp = DECIMAL_PLACES,\r\n          rm = ROUNDING_MODE;\r\n\r\n        // Non-integer.\r\n        if (i >= 0) {\r\n          k = POW_PRECISION;\r\n\r\n          // Unlimited precision.\r\n          POW_PRECISION = 0;\r\n          str = str.replace('.', '');\r\n          y = new BigNumber(baseIn);\r\n          x = y.pow(str.length - i);\r\n          POW_PRECISION = k;\r\n\r\n          // Convert str as if an integer, then restore the fraction part by dividing the\r\n          // result by its base raised to a power.\r\n\r\n          y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n           10, baseOut, decimal);\r\n          y.e = y.c.length;\r\n        }\r\n\r\n        // Convert the number as integer.\r\n\r\n        xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n         ? (alphabet = ALPHABET, decimal)\r\n         : (alphabet = decimal, ALPHABET));\r\n\r\n        // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n        e = k = xc.length;\r\n\r\n        // Remove trailing zeros.\r\n        for (; xc[--k] == 0; xc.pop());\r\n\r\n        // Zero?\r\n        if (!xc[0]) return alphabet.charAt(0);\r\n\r\n        // Does str represent an integer? If so, no need for the division.\r\n        if (i < 0) {\r\n          --e;\r\n        } else {\r\n          x.c = xc;\r\n          x.e = e;\r\n\r\n          // The sign is needed for correct rounding.\r\n          x.s = sign;\r\n          x = div(x, y, dp, rm, baseOut);\r\n          xc = x.c;\r\n          r = x.r;\r\n          e = x.e;\r\n        }\r\n\r\n        // xc now represents str converted to baseOut.\r\n\r\n        // THe index of the rounding digit.\r\n        d = e + dp + 1;\r\n\r\n        // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n        i = xc[d];\r\n\r\n        // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n        k = baseOut / 2;\r\n        r = r || d < 0 || xc[d + 1] != null;\r\n\r\n        r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n              : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n               rm == (x.s < 0 ? 8 : 7));\r\n\r\n        // If the index of the rounding digit is not greater than zero, or xc represents\r\n        // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n        // such as 0.00001.\r\n        if (d < 1 || !xc[0]) {\r\n\r\n          // 1^-dp or 0\r\n          str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n        } else {\r\n\r\n          // Truncate xc to the required number of decimal places.\r\n          xc.length = d;\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            // Rounding up may mean the previous digit has to be rounded up and so on.\r\n            for (--baseOut; ++xc[--d] > baseOut;) {\r\n              xc[d] = 0;\r\n\r\n              if (!d) {\r\n                ++e;\r\n                xc = [1].concat(xc);\r\n              }\r\n            }\r\n          }\r\n\r\n          // Determine trailing zeros.\r\n          for (k = xc.length; !xc[--k];);\r\n\r\n          // E.g. [4, 11, 15] becomes 4bf.\r\n          for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n          // Add leading zeros, decimal point and trailing zeros as required.\r\n          str = toFixedPoint(str, e, alphabet.charAt(0));\r\n        }\r\n\r\n        // The caller will add the sign.\r\n        return str;\r\n      };\r\n    })();\r\n\r\n\r\n    // Perform division in the specified base. Called by div and convertBase.\r\n    div = (function () {\r\n\r\n      // Assume non-zero x and k.\r\n      function multiply(x, k, base) {\r\n        var m, temp, xlo, xhi,\r\n          carry = 0,\r\n          i = x.length,\r\n          klo = k % SQRT_BASE,\r\n          khi = k / SQRT_BASE | 0;\r\n\r\n        for (x = x.slice(); i--;) {\r\n          xlo = x[i] % SQRT_BASE;\r\n          xhi = x[i] / SQRT_BASE | 0;\r\n          m = khi * xlo + xhi * klo;\r\n          temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n          carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n          x[i] = temp % base;\r\n        }\r\n\r\n        if (carry) x = [carry].concat(x);\r\n\r\n        return x;\r\n      }\r\n\r\n      function compare(a, b, aL, bL) {\r\n        var i, cmp;\r\n\r\n        if (aL != bL) {\r\n          cmp = aL > bL ? 1 : -1;\r\n        } else {\r\n\r\n          for (i = cmp = 0; i < aL; i++) {\r\n\r\n            if (a[i] != b[i]) {\r\n              cmp = a[i] > b[i] ? 1 : -1;\r\n              break;\r\n            }\r\n          }\r\n        }\r\n\r\n        return cmp;\r\n      }\r\n\r\n      function subtract(a, b, aL, base) {\r\n        var i = 0;\r\n\r\n        // Subtract b from a.\r\n        for (; aL--;) {\r\n          a[aL] -= i;\r\n          i = a[aL] < b[aL] ? 1 : 0;\r\n          a[aL] = i * base + a[aL] - b[aL];\r\n        }\r\n\r\n        // Remove leading zeros.\r\n        for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n      }\r\n\r\n      // x: dividend, y: divisor.\r\n      return function (x, y, dp, rm, base) {\r\n        var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n          yL, yz,\r\n          s = x.s == y.s ? 1 : -1,\r\n          xc = x.c,\r\n          yc = y.c;\r\n\r\n        // Either NaN, Infinity or 0?\r\n        if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n          return new BigNumber(\r\n\r\n           // Return NaN if either NaN, or both Infinity or 0.\r\n           !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n            // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n            xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n         );\r\n        }\r\n\r\n        q = new BigNumber(s);\r\n        qc = q.c = [];\r\n        e = x.e - y.e;\r\n        s = dp + e + 1;\r\n\r\n        if (!base) {\r\n          base = BASE;\r\n          e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n          s = s / LOG_BASE | 0;\r\n        }\r\n\r\n        // Result exponent may be one less then the current value of e.\r\n        // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n        for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n        if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n        if (s < 0) {\r\n          qc.push(1);\r\n          more = true;\r\n        } else {\r\n          xL = xc.length;\r\n          yL = yc.length;\r\n          i = 0;\r\n          s += 2;\r\n\r\n          // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n          n = mathfloor(base / (yc[0] + 1));\r\n\r\n          // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n          // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n          if (n > 1) {\r\n            yc = multiply(yc, n, base);\r\n            xc = multiply(xc, n, base);\r\n            yL = yc.length;\r\n            xL = xc.length;\r\n          }\r\n\r\n          xi = yL;\r\n          rem = xc.slice(0, yL);\r\n          remL = rem.length;\r\n\r\n          // Add zeros to make remainder as long as divisor.\r\n          for (; remL < yL; rem[remL++] = 0);\r\n          yz = yc.slice();\r\n          yz = [0].concat(yz);\r\n          yc0 = yc[0];\r\n          if (yc[1] >= base / 2) yc0++;\r\n          // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n          // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n          do {\r\n            n = 0;\r\n\r\n            // Compare divisor and remainder.\r\n            cmp = compare(yc, rem, yL, remL);\r\n\r\n            // If divisor < remainder.\r\n            if (cmp < 0) {\r\n\r\n              // Calculate trial digit, n.\r\n\r\n              rem0 = rem[0];\r\n              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n              // n is how many times the divisor goes into the current remainder.\r\n              n = mathfloor(rem0 / yc0);\r\n\r\n              //  Algorithm:\r\n              //  product = divisor multiplied by trial digit (n).\r\n              //  Compare product and remainder.\r\n              //  If product is greater than remainder:\r\n              //    Subtract divisor from product, decrement trial digit.\r\n              //  Subtract product from remainder.\r\n              //  If product was less than remainder at the last compare:\r\n              //    Compare new remainder and divisor.\r\n              //    If remainder is greater than divisor:\r\n              //      Subtract divisor from remainder, increment trial digit.\r\n\r\n              if (n > 1) {\r\n\r\n                // n may be > base only when base is 3.\r\n                if (n >= base) n = base - 1;\r\n\r\n                // product = divisor * trial digit.\r\n                prod = multiply(yc, n, base);\r\n                prodL = prod.length;\r\n                remL = rem.length;\r\n\r\n                // Compare product and remainder.\r\n                // If product > remainder then trial digit n too high.\r\n                // n is 1 too high about 5% of the time, and is not known to have\r\n                // ever been more than 1 too high.\r\n                while (compare(prod, rem, prodL, remL) == 1) {\r\n                  n--;\r\n\r\n                  // Subtract divisor from product.\r\n                  subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n                  prodL = prod.length;\r\n                  cmp = 1;\r\n                }\r\n              } else {\r\n\r\n                // n is 0 or 1, cmp is -1.\r\n                // If n is 0, there is no need to compare yc and rem again below,\r\n                // so change cmp to 1 to avoid it.\r\n                // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n                if (n == 0) {\r\n\r\n                  // divisor < remainder, so n must be at least 1.\r\n                  cmp = n = 1;\r\n                }\r\n\r\n                // product = divisor\r\n                prod = yc.slice();\r\n                prodL = prod.length;\r\n              }\r\n\r\n              if (prodL < remL) prod = [0].concat(prod);\r\n\r\n              // Subtract product from remainder.\r\n              subtract(rem, prod, remL, base);\r\n              remL = rem.length;\r\n\r\n               // If product was < remainder.\r\n              if (cmp == -1) {\r\n\r\n                // Compare divisor and new remainder.\r\n                // If divisor < new remainder, subtract divisor from remainder.\r\n                // Trial digit n too low.\r\n                // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n                while (compare(yc, rem, yL, remL) < 1) {\r\n                  n++;\r\n\r\n                  // Subtract divisor from remainder.\r\n                  subtract(rem, yL < remL ? yz : yc, remL, base);\r\n                  remL = rem.length;\r\n                }\r\n              }\r\n            } else if (cmp === 0) {\r\n              n++;\r\n              rem = [0];\r\n            } // else cmp === 1 and n will be 0\r\n\r\n            // Add the next digit, n, to the result array.\r\n            qc[i++] = n;\r\n\r\n            // Update the remainder.\r\n            if (rem[0]) {\r\n              rem[remL++] = xc[xi] || 0;\r\n            } else {\r\n              rem = [xc[xi]];\r\n              remL = 1;\r\n            }\r\n          } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n          more = rem[0] != null;\r\n\r\n          // Leading zero?\r\n          if (!qc[0]) qc.splice(0, 1);\r\n        }\r\n\r\n        if (base == BASE) {\r\n\r\n          // To calculate q.e, first get the number of digits of qc[0].\r\n          for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n          round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n        // Caller is convertBase.\r\n        } else {\r\n          q.e = e;\r\n          q.r = +more;\r\n        }\r\n\r\n        return q;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n     * notation rounded to the specified decimal places or significant digits.\r\n     *\r\n     * n: a BigNumber.\r\n     * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n     * rm: the rounding mode.\r\n     * id: 1 (toExponential) or 2 (toPrecision).\r\n     */\r\n    function format(n, i, rm, id) {\r\n      var c0, e, ne, len, str;\r\n\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      if (!n.c) return n.toString();\r\n\r\n      c0 = n.c[0];\r\n      ne = n.e;\r\n\r\n      if (i == null) {\r\n        str = coeffToString(n.c);\r\n        str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r\n         ? toExponential(str, ne)\r\n         : toFixedPoint(str, ne, '0');\r\n      } else {\r\n        n = round(new BigNumber(n), i, rm);\r\n\r\n        // n.e may have changed if the value was rounded up.\r\n        e = n.e;\r\n\r\n        str = coeffToString(n.c);\r\n        len = str.length;\r\n\r\n        // toPrecision returns exponential notation if the number of significant digits\r\n        // specified is less than the number of digits necessary to represent the integer\r\n        // part of the value in fixed-point notation.\r\n\r\n        // Exponential notation.\r\n        if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n          // Append zeros?\r\n          for (; len < i; str += '0', len++);\r\n          str = toExponential(str, e);\r\n\r\n        // Fixed-point notation.\r\n        } else {\r\n          i -= ne;\r\n          str = toFixedPoint(str, e, '0');\r\n\r\n          // Append zeros?\r\n          if (e + 1 > len) {\r\n            if (--i > 0) for (str += '.'; i--; str += '0');\r\n          } else {\r\n            i += e - len;\r\n            if (i > 0) {\r\n              if (e + 1 == len) str += '.';\r\n              for (; i--; str += '0');\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return n.s < 0 && c0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // Handle BigNumber.max and BigNumber.min.\r\n    function maxOrMin(args, method) {\r\n      var n,\r\n        i = 1,\r\n        m = new BigNumber(args[0]);\r\n\r\n      for (; i < args.length; i++) {\r\n        n = new BigNumber(args[i]);\r\n\r\n        // If any number is NaN, return NaN.\r\n        if (!n.s) {\r\n          m = n;\r\n          break;\r\n        } else if (method.call(m, n)) {\r\n          m = n;\r\n        }\r\n      }\r\n\r\n      return m;\r\n    }\r\n\r\n\r\n    /*\r\n     * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n     * Called by minus, plus and times.\r\n     */\r\n    function normalise(n, c, e) {\r\n      var i = 1,\r\n        j = c.length;\r\n\r\n       // Remove trailing zeros.\r\n      for (; !c[--j]; c.pop());\r\n\r\n      // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n      for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n      // Overflow?\r\n      if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n        // Infinity.\r\n        n.c = n.e = null;\r\n\r\n      // Underflow?\r\n      } else if (e < MIN_EXP) {\r\n\r\n        // Zero.\r\n        n.c = [n.e = 0];\r\n      } else {\r\n        n.e = e;\r\n        n.c = c;\r\n      }\r\n\r\n      return n;\r\n    }\r\n\r\n\r\n    // Handle values that fail the validity test in BigNumber.\r\n    parseNumeric = (function () {\r\n      var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n        dotAfter = /^([^.]+)\\.$/,\r\n        dotBefore = /^\\.([^.]+)$/,\r\n        isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n        whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n      return function (x, str, isNum, b) {\r\n        var base,\r\n          s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n        // No exception on ±Infinity or NaN.\r\n        if (isInfinityOrNaN.test(s)) {\r\n          x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n        } else {\r\n          if (!isNum) {\r\n\r\n            // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n            s = s.replace(basePrefix, function (m, p1, p2) {\r\n              base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n              return !b || b == base ? p1 : m;\r\n            });\r\n\r\n            if (b) {\r\n              base = b;\r\n\r\n              // E.g. '1.' to '1', '.1' to '0.1'\r\n              s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n            }\r\n\r\n            if (str != s) return new BigNumber(s, base);\r\n          }\r\n\r\n          // '[BigNumber Error] Not a number: {n}'\r\n          // '[BigNumber Error] Not a base {b} number: {n}'\r\n          if (BigNumber.DEBUG) {\r\n            throw Error\r\n              (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n          }\r\n\r\n          // NaN\r\n          x.s = null;\r\n        }\r\n\r\n        x.c = x.e = null;\r\n      }\r\n    })();\r\n\r\n\r\n    /*\r\n     * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n     * If r is truthy, it is known that there are more digits after the rounding digit.\r\n     */\r\n    function round(x, sd, rm, r) {\r\n      var d, i, j, k, n, ni, rd,\r\n        xc = x.c,\r\n        pows10 = POWS_TEN;\r\n\r\n      // if x is not Infinity or NaN...\r\n      if (xc) {\r\n\r\n        // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n        // ni is the index of n within x.c.\r\n        // d is the number of digits of n.\r\n        // i is the index of rd within n including leading zeros.\r\n        // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n        out: {\r\n\r\n          // Get the number of digits of the first element of xc.\r\n          for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n          i = sd - d;\r\n\r\n          // If the rounding digit is in the first element of xc...\r\n          if (i < 0) {\r\n            i += LOG_BASE;\r\n            j = sd;\r\n            n = xc[ni = 0];\r\n\r\n            // Get the rounding digit at index j of n.\r\n            rd = n / pows10[d - j - 1] % 10 | 0;\r\n          } else {\r\n            ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n            if (ni >= xc.length) {\r\n\r\n              if (r) {\r\n\r\n                // Needed by sqrt.\r\n                for (; xc.length <= ni; xc.push(0));\r\n                n = rd = 0;\r\n                d = 1;\r\n                i %= LOG_BASE;\r\n                j = i - LOG_BASE + 1;\r\n              } else {\r\n                break out;\r\n              }\r\n            } else {\r\n              n = k = xc[ni];\r\n\r\n              // Get the number of digits of n.\r\n              for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n              // Get the index of rd within n.\r\n              i %= LOG_BASE;\r\n\r\n              // Get the index of rd within n, adjusted for leading zeros.\r\n              // The number of leading zeros of n is given by LOG_BASE - d.\r\n              j = i - LOG_BASE + d;\r\n\r\n              // Get the rounding digit at index j of n.\r\n              rd = j < 0 ? 0 : n / pows10[d - j - 1] % 10 | 0;\r\n            }\r\n          }\r\n\r\n          r = r || sd < 0 ||\r\n\r\n          // Are there any non-zero digits after the rounding digit?\r\n          // The expression  n % pows10[d - j - 1]  returns all digits of n to the right\r\n          // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n           xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n          r = rm < 4\r\n           ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n           : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n            // Check whether the digit to the left of the rounding digit is odd.\r\n            ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n             rm == (x.s < 0 ? 8 : 7));\r\n\r\n          if (sd < 1 || !xc[0]) {\r\n            xc.length = 0;\r\n\r\n            if (r) {\r\n\r\n              // Convert sd to decimal places.\r\n              sd -= x.e + 1;\r\n\r\n              // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n              xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n              x.e = -sd || 0;\r\n            } else {\r\n\r\n              // Zero.\r\n              xc[0] = x.e = 0;\r\n            }\r\n\r\n            return x;\r\n          }\r\n\r\n          // Remove excess digits.\r\n          if (i == 0) {\r\n            xc.length = ni;\r\n            k = 1;\r\n            ni--;\r\n          } else {\r\n            xc.length = ni + 1;\r\n            k = pows10[LOG_BASE - i];\r\n\r\n            // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n            // j > 0 means i > number of leading zeros of n.\r\n            xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n          }\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            for (; ;) {\r\n\r\n              // If the digit to be rounded up is in the first element of xc...\r\n              if (ni == 0) {\r\n\r\n                // i will be the length of xc[0] before k is added.\r\n                for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n                j = xc[0] += k;\r\n                for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n                // if i != k the length has increased.\r\n                if (i != k) {\r\n                  x.e++;\r\n                  if (xc[0] == BASE) xc[0] = 1;\r\n                }\r\n\r\n                break;\r\n              } else {\r\n                xc[ni] += k;\r\n                if (xc[ni] != BASE) break;\r\n                xc[ni--] = 0;\r\n                k = 1;\r\n              }\r\n            }\r\n          }\r\n\r\n          // Remove trailing zeros.\r\n          for (i = xc.length; xc[--i] === 0; xc.pop());\r\n        }\r\n\r\n        // Overflow? Infinity.\r\n        if (x.e > MAX_EXP) {\r\n          x.c = x.e = null;\r\n\r\n        // Underflow? Zero.\r\n        } else if (x.e < MIN_EXP) {\r\n          x.c = [x.e = 0];\r\n        }\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n\r\n    function valueOf(n) {\r\n      var str,\r\n        e = n.e;\r\n\r\n      if (e === null) return n.toString();\r\n\r\n      str = coeffToString(n.c);\r\n\r\n      str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n        ? toExponential(str, e)\r\n        : toFixedPoint(str, e, '0');\r\n\r\n      return n.s < 0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n     */\r\n    P.absoluteValue = P.abs = function () {\r\n      var x = new BigNumber(this);\r\n      if (x.s < 0) x.s = 1;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return\r\n     *   1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     *   -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     *   0 if they have the same value,\r\n     *   or null if the value of either is NaN.\r\n     */\r\n    P.comparedTo = function (y, b) {\r\n      return compare(this, new BigNumber(y, b));\r\n    };\r\n\r\n\r\n    /*\r\n     * If dp is undefined or null or true or false, return the number of decimal places of the\r\n     * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     *\r\n     * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.decimalPlaces = P.dp = function (dp, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), dp + x.e + 1, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last number.\r\n      if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n      if (n < 0) n = 0;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n / 0 = I\r\n     *  n / N = N\r\n     *  n / I = 0\r\n     *  0 / n = 0\r\n     *  0 / 0 = N\r\n     *  0 / N = N\r\n     *  0 / I = 0\r\n     *  N / n = N\r\n     *  N / 0 = N\r\n     *  N / N = N\r\n     *  N / I = N\r\n     *  I / n = I\r\n     *  I / 0 = I\r\n     *  I / N = N\r\n     *  I / I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n     * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.dividedBy = P.div = function (y, b) {\r\n      return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n     * BigNumber by the value of BigNumber(y, b).\r\n     */\r\n    P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n      return div(this, new BigNumber(y, b), 0, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n     *\r\n     * If m is present, return the result modulo m.\r\n     * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n     *\r\n     * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n     * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n     *\r\n     * n {number|string|BigNumber} The exponent. An integer.\r\n     * [m] {number|string|BigNumber} The modulus.\r\n     *\r\n     * '[BigNumber Error] Exponent not an integer: {n}'\r\n     */\r\n    P.exponentiatedBy = P.pow = function (n, m) {\r\n      var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n        x = this;\r\n\r\n      n = new BigNumber(n);\r\n\r\n      // Allow NaN and ±Infinity, but not other non-integers.\r\n      if (n.c && !n.isInteger()) {\r\n        throw Error\r\n          (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n      }\r\n\r\n      if (m != null) m = new BigNumber(m);\r\n\r\n      // Exponent of MAX_SAFE_INTEGER is 15.\r\n      nIsBig = n.e > 14;\r\n\r\n      // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n      if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n        // The sign of the result of pow when x is negative depends on the evenness of n.\r\n        // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n        y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? 2 - isOdd(n) : +valueOf(n)));\r\n        return m ? y.mod(m) : y;\r\n      }\r\n\r\n      nIsNeg = n.s < 0;\r\n\r\n      if (m) {\r\n\r\n        // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n        if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n        isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n        if (isModExp) x = x.mod(m);\r\n\r\n      // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n      // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n      } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n        // [1, 240000000]\r\n        ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n        // [80000000000000]  [99999750000000]\r\n        : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n        // If x is negative and n is odd, k = -0, else k = 0.\r\n        k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n        // If x >= 1, k = ±Infinity.\r\n        if (x.e > -1) k = 1 / k;\r\n\r\n        // If n is negative return ±0, else return ±Infinity.\r\n        return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n      } else if (POW_PRECISION) {\r\n\r\n        // Truncating each coefficient array to a length of k after each multiplication\r\n        // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n        // i.e. there will be a minimum of 28 guard digits retained.\r\n        k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n      }\r\n\r\n      if (nIsBig) {\r\n        half = new BigNumber(0.5);\r\n        if (nIsNeg) n.s = 1;\r\n        nIsOdd = isOdd(n);\r\n      } else {\r\n        i = Math.abs(+valueOf(n));\r\n        nIsOdd = i % 2;\r\n      }\r\n\r\n      y = new BigNumber(ONE);\r\n\r\n      // Performs 54 loop iterations for n of 9007199254740991.\r\n      for (; ;) {\r\n\r\n        if (nIsOdd) {\r\n          y = y.times(x);\r\n          if (!y.c) break;\r\n\r\n          if (k) {\r\n            if (y.c.length > k) y.c.length = k;\r\n          } else if (isModExp) {\r\n            y = y.mod(m);    //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n          }\r\n        }\r\n\r\n        if (i) {\r\n          i = mathfloor(i / 2);\r\n          if (i === 0) break;\r\n          nIsOdd = i % 2;\r\n        } else {\r\n          n = n.times(half);\r\n          round(n, n.e + 1, 1);\r\n\r\n          if (n.e > 14) {\r\n            nIsOdd = isOdd(n);\r\n          } else {\r\n            i = +valueOf(n);\r\n            if (i === 0) break;\r\n            nIsOdd = i % 2;\r\n          }\r\n        }\r\n\r\n        x = x.times(x);\r\n\r\n        if (k) {\r\n          if (x.c && x.c.length > k) x.c.length = k;\r\n        } else if (isModExp) {\r\n          x = x.mod(m);    //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n        }\r\n      }\r\n\r\n      if (isModExp) return y;\r\n      if (nIsNeg) y = ONE.div(y);\r\n\r\n      return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n     * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n     */\r\n    P.integerValue = function (rm) {\r\n      var n = new BigNumber(this);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n      return round(n, n.e + 1, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isEqualTo = P.eq = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n     */\r\n    P.isFinite = function () {\r\n      return !!this.c;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isGreaterThan = P.gt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n     */\r\n    P.isInteger = function () {\r\n      return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isLessThan = P.lt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n     */\r\n    P.isNaN = function () {\r\n      return !this.s;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is negative, otherwise return false.\r\n     */\r\n    P.isNegative = function () {\r\n      return this.s < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is positive, otherwise return false.\r\n     */\r\n    P.isPositive = function () {\r\n      return this.s > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n     */\r\n    P.isZero = function () {\r\n      return !!this.c && this.c[0] == 0;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n - 0 = n\r\n     *  n - N = N\r\n     *  n - I = -I\r\n     *  0 - n = -n\r\n     *  0 - 0 = 0\r\n     *  0 - N = N\r\n     *  0 - I = -I\r\n     *  N - n = N\r\n     *  N - 0 = N\r\n     *  N - N = N\r\n     *  N - I = N\r\n     *  I - n = I\r\n     *  I - 0 = I\r\n     *  I - N = N\r\n     *  I - I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.minus = function (y, b) {\r\n      var i, j, t, xLTy,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n      if (a != b) {\r\n        y.s = -b;\r\n        return x.plus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Either Infinity?\r\n        if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n        // Either zero?\r\n        if (!xc[0] || !yc[0]) {\r\n\r\n          // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n          return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n           ROUNDING_MODE == 3 ? -0 : 0);\r\n        }\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Determine which is the bigger number.\r\n      if (a = xe - ye) {\r\n\r\n        if (xLTy = a < 0) {\r\n          a = -a;\r\n          t = xc;\r\n        } else {\r\n          ye = xe;\r\n          t = yc;\r\n        }\r\n\r\n        t.reverse();\r\n\r\n        // Prepend zeros to equalise exponents.\r\n        for (b = a; b--; t.push(0));\r\n        t.reverse();\r\n      } else {\r\n\r\n        // Exponents equal. Check digit by digit.\r\n        j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n        for (a = b = 0; b < j; b++) {\r\n\r\n          if (xc[b] != yc[b]) {\r\n            xLTy = xc[b] < yc[b];\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      // x < y? Point xc to the array of the bigger number.\r\n      if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s;\r\n\r\n      b = (j = yc.length) - (i = xc.length);\r\n\r\n      // Append zeros to xc if shorter.\r\n      // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n      if (b > 0) for (; b--; xc[i++] = 0);\r\n      b = BASE - 1;\r\n\r\n      // Subtract yc from xc.\r\n      for (; j > a;) {\r\n\r\n        if (xc[--j] < yc[j]) {\r\n          for (i = j; i && !xc[--i]; xc[i] = b);\r\n          --xc[i];\r\n          xc[j] += BASE;\r\n        }\r\n\r\n        xc[j] -= yc[j];\r\n      }\r\n\r\n      // Remove leading zeros and adjust exponent accordingly.\r\n      for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n      // Zero?\r\n      if (!xc[0]) {\r\n\r\n        // Following IEEE 754 (2008) 6.3,\r\n        // n - n = +0  but  n - n = -0  when rounding towards -Infinity.\r\n        y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n        y.c = [y.e = 0];\r\n        return y;\r\n      }\r\n\r\n      // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n      // for finite x and y.\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     *   n % 0 =  N\r\n     *   n % N =  N\r\n     *   n % I =  n\r\n     *   0 % n =  0\r\n     *  -0 % n = -0\r\n     *   0 % 0 =  N\r\n     *   0 % N =  N\r\n     *   0 % I =  0\r\n     *   N % n =  N\r\n     *   N % 0 =  N\r\n     *   N % N =  N\r\n     *   N % I =  N\r\n     *   I % n =  N\r\n     *   I % 0 =  N\r\n     *   I % N =  N\r\n     *   I % I =  N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n     * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n     */\r\n    P.modulo = P.mod = function (y, b) {\r\n      var q, s,\r\n        x = this;\r\n\r\n      y = new BigNumber(y, b);\r\n\r\n      // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n      if (!x.c || !y.s || y.c && !y.c[0]) {\r\n        return new BigNumber(NaN);\r\n\r\n      // Return x if y is Infinity or x is zero.\r\n      } else if (!y.c || x.c && !x.c[0]) {\r\n        return new BigNumber(x);\r\n      }\r\n\r\n      if (MODULO_MODE == 9) {\r\n\r\n        // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n        // r = x - qy    where  0 <= r < abs(y)\r\n        s = y.s;\r\n        y.s = 1;\r\n        q = div(x, y, 0, 3);\r\n        y.s = s;\r\n        q.s *= s;\r\n      } else {\r\n        q = div(x, y, 0, MODULO_MODE);\r\n      }\r\n\r\n      y = x.minus(q.times(y));\r\n\r\n      // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n      if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n      return y;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n * 0 = 0\r\n     *  n * N = N\r\n     *  n * I = I\r\n     *  0 * n = 0\r\n     *  0 * 0 = 0\r\n     *  0 * N = N\r\n     *  0 * I = N\r\n     *  N * n = N\r\n     *  N * 0 = N\r\n     *  N * N = N\r\n     *  N * I = N\r\n     *  I * n = I\r\n     *  I * 0 = N\r\n     *  I * N = N\r\n     *  I * I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n     * of BigNumber(y, b).\r\n     */\r\n    P.multipliedBy = P.times = function (y, b) {\r\n      var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n        base, sqrtBase,\r\n        x = this,\r\n        xc = x.c,\r\n        yc = (y = new BigNumber(y, b)).c;\r\n\r\n      // Either NaN, ±Infinity or ±0?\r\n      if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n        // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n        if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n          y.c = y.e = y.s = null;\r\n        } else {\r\n          y.s *= x.s;\r\n\r\n          // Return ±Infinity if either is ±Infinity.\r\n          if (!xc || !yc) {\r\n            y.c = y.e = null;\r\n\r\n          // Return ±0 if either is ±0.\r\n          } else {\r\n            y.c = [0];\r\n            y.e = 0;\r\n          }\r\n        }\r\n\r\n        return y;\r\n      }\r\n\r\n      e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n      y.s *= x.s;\r\n      xcL = xc.length;\r\n      ycL = yc.length;\r\n\r\n      // Ensure xc points to longer array and xcL to its length.\r\n      if (xcL < ycL) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i;\r\n\r\n      // Initialise the result array with zeros.\r\n      for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n      base = BASE;\r\n      sqrtBase = SQRT_BASE;\r\n\r\n      for (i = ycL; --i >= 0;) {\r\n        c = 0;\r\n        ylo = yc[i] % sqrtBase;\r\n        yhi = yc[i] / sqrtBase | 0;\r\n\r\n        for (k = xcL, j = i + k; j > i;) {\r\n          xlo = xc[--k] % sqrtBase;\r\n          xhi = xc[k] / sqrtBase | 0;\r\n          m = yhi * xlo + xhi * ylo;\r\n          xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n          c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n          zc[j--] = xlo % base;\r\n        }\r\n\r\n        zc[j] = c;\r\n      }\r\n\r\n      if (c) {\r\n        ++e;\r\n      } else {\r\n        zc.splice(0, 1);\r\n      }\r\n\r\n      return normalise(y, zc, e);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n     * i.e. multiplied by -1.\r\n     */\r\n    P.negated = function () {\r\n      var x = new BigNumber(this);\r\n      x.s = -x.s || null;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n + 0 = n\r\n     *  n + N = N\r\n     *  n + I = I\r\n     *  0 + n = n\r\n     *  0 + 0 = 0\r\n     *  0 + N = N\r\n     *  0 + I = I\r\n     *  N + n = N\r\n     *  N + 0 = N\r\n     *  N + N = N\r\n     *  N + I = N\r\n     *  I + n = I\r\n     *  I + 0 = I\r\n     *  I + N = N\r\n     *  I + I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.plus = function (y, b) {\r\n      var t,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n       if (a != b) {\r\n        y.s = -b;\r\n        return x.minus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Return ±Infinity if either ±Infinity.\r\n        if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n        // Either zero?\r\n        // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n        if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n      if (a = xe - ye) {\r\n        if (a > 0) {\r\n          ye = xe;\r\n          t = yc;\r\n        } else {\r\n          a = -a;\r\n          t = xc;\r\n        }\r\n\r\n        t.reverse();\r\n        for (; a--; t.push(0));\r\n        t.reverse();\r\n      }\r\n\r\n      a = xc.length;\r\n      b = yc.length;\r\n\r\n      // Point xc to the longer array, and b to the shorter length.\r\n      if (a - b < 0) t = yc, yc = xc, xc = t, b = a;\r\n\r\n      // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n      for (a = 0; b;) {\r\n        a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n        xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n      }\r\n\r\n      if (a) {\r\n        xc = [a].concat(xc);\r\n        ++ye;\r\n      }\r\n\r\n      // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n      // ye = MAX_EXP + 1 possible\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     * If sd is undefined or null or true or false, return the number of significant digits of\r\n     * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     * If sd is true include integer-part trailing zeros in the count.\r\n     *\r\n     * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n     *                     boolean: whether to count integer-part trailing zeros: true or false.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.precision = P.sd = function (sd, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (sd != null && sd !== !!sd) {\r\n        intCheck(sd, 1, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), sd, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      v = c.length - 1;\r\n      n = v * LOG_BASE + 1;\r\n\r\n      if (v = c[v]) {\r\n\r\n        // Subtract the number of trailing zeros of the last element.\r\n        for (; v % 10 == 0; v /= 10, n--);\r\n\r\n        // Add the number of digits of the first element.\r\n        for (v = c[0]; v >= 10; v /= 10, n++);\r\n      }\r\n\r\n      if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n     * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n     *\r\n     * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n     */\r\n    P.shiftedBy = function (k) {\r\n      intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n      return this.times('1e' + k);\r\n    };\r\n\r\n\r\n    /*\r\n     *  sqrt(-n) =  N\r\n     *  sqrt(N) =  N\r\n     *  sqrt(-I) =  N\r\n     *  sqrt(I) =  I\r\n     *  sqrt(0) =  0\r\n     *  sqrt(-0) = -0\r\n     *\r\n     * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n     * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.squareRoot = P.sqrt = function () {\r\n      var m, n, r, rep, t,\r\n        x = this,\r\n        c = x.c,\r\n        s = x.s,\r\n        e = x.e,\r\n        dp = DECIMAL_PLACES + 4,\r\n        half = new BigNumber('0.5');\r\n\r\n      // Negative/NaN/Infinity/zero?\r\n      if (s !== 1 || !c || !c[0]) {\r\n        return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n      }\r\n\r\n      // Initial estimate.\r\n      s = Math.sqrt(+valueOf(x));\r\n\r\n      // Math.sqrt underflow/overflow?\r\n      // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n      if (s == 0 || s == 1 / 0) {\r\n        n = coeffToString(c);\r\n        if ((n.length + e) % 2 == 0) n += '0';\r\n        s = Math.sqrt(+n);\r\n        e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n        if (s == 1 / 0) {\r\n          n = '1e' + e;\r\n        } else {\r\n          n = s.toExponential();\r\n          n = n.slice(0, n.indexOf('e') + 1) + e;\r\n        }\r\n\r\n        r = new BigNumber(n);\r\n      } else {\r\n        r = new BigNumber(s + '');\r\n      }\r\n\r\n      // Check for zero.\r\n      // r could be zero if MIN_EXP is changed after the this value was created.\r\n      // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n      // coeffToString to throw.\r\n      if (r.c[0]) {\r\n        e = r.e;\r\n        s = e + dp;\r\n        if (s < 3) s = 0;\r\n\r\n        // Newton-Raphson iteration.\r\n        for (; ;) {\r\n          t = r;\r\n          r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n          if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n            // The exponent of r may here be one less than the final result exponent,\r\n            // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n            // are indexed correctly.\r\n            if (r.e < e) --s;\r\n            n = n.slice(s - 3, s + 1);\r\n\r\n            // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n            // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n            // iteration.\r\n            if (n == '9999' || !rep && n == '4999') {\r\n\r\n              // On the first iteration only, check to see if rounding up gives the\r\n              // exact result as the nines may infinitely repeat.\r\n              if (!rep) {\r\n                round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n                if (t.times(t).eq(x)) {\r\n                  r = t;\r\n                  break;\r\n                }\r\n              }\r\n\r\n              dp += 4;\r\n              s += 4;\r\n              rep = 1;\r\n            } else {\r\n\r\n              // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n              // result. If not, then there are further digits and m will be truthy.\r\n              if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n                // Truncate to the first rounding digit.\r\n                round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n                m = !r.times(r).eq(x);\r\n              }\r\n\r\n              break;\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in exponential notation and\r\n     * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toExponential = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp++;\r\n      }\r\n      return format(this, dp, rm, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n     * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n     * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toFixed = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp = dp + this.e + 1;\r\n      }\r\n      return format(this, dp, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n     * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n     * of the format or FORMAT object (see BigNumber.set).\r\n     *\r\n     * The formatting object may contain some or all of the properties shown below.\r\n     *\r\n     * FORMAT = {\r\n     *   prefix: '',\r\n     *   groupSize: 3,\r\n     *   secondaryGroupSize: 0,\r\n     *   groupSeparator: ',',\r\n     *   decimalSeparator: '.',\r\n     *   fractionGroupSize: 0,\r\n     *   fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n     *   suffix: ''\r\n     * };\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     * [format] {object} Formatting options. See FORMAT pbject above.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     * '[BigNumber Error] Argument not an object: {format}'\r\n     */\r\n    P.toFormat = function (dp, rm, format) {\r\n      var str,\r\n        x = this;\r\n\r\n      if (format == null) {\r\n        if (dp != null && rm && typeof rm == 'object') {\r\n          format = rm;\r\n          rm = null;\r\n        } else if (dp && typeof dp == 'object') {\r\n          format = dp;\r\n          dp = rm = null;\r\n        } else {\r\n          format = FORMAT;\r\n        }\r\n      } else if (typeof format != 'object') {\r\n        throw Error\r\n          (bignumberError + 'Argument not an object: ' + format);\r\n      }\r\n\r\n      str = x.toFixed(dp, rm);\r\n\r\n      if (x.c) {\r\n        var i,\r\n          arr = str.split('.'),\r\n          g1 = +format.groupSize,\r\n          g2 = +format.secondaryGroupSize,\r\n          groupSeparator = format.groupSeparator || '',\r\n          intPart = arr[0],\r\n          fractionPart = arr[1],\r\n          isNeg = x.s < 0,\r\n          intDigits = isNeg ? intPart.slice(1) : intPart,\r\n          len = intDigits.length;\r\n\r\n        if (g2) i = g1, g1 = g2, g2 = i, len -= i;\r\n\r\n        if (g1 > 0 && len > 0) {\r\n          i = len % g1 || g1;\r\n          intPart = intDigits.substr(0, i);\r\n          for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n          if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n          if (isNeg) intPart = '-' + intPart;\r\n        }\r\n\r\n        str = fractionPart\r\n         ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r\n          ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n           '$&' + (format.fractionGroupSeparator || ''))\r\n          : fractionPart)\r\n         : intPart;\r\n      }\r\n\r\n      return (format.prefix || '') + str + (format.suffix || '');\r\n    };\r\n\r\n\r\n    /*\r\n     * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n     * fraction with an integer numerator and an integer denominator.\r\n     * The denominator will be a positive non-zero value less than or equal to the specified\r\n     * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n     * the lowest value necessary to represent the number exactly.\r\n     *\r\n     * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n     *\r\n     * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n     */\r\n    P.toFraction = function (md) {\r\n      var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n        x = this,\r\n        xc = x.c;\r\n\r\n      if (md != null) {\r\n        n = new BigNumber(md);\r\n\r\n        // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n        if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n          throw Error\r\n            (bignumberError + 'Argument ' +\r\n              (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n        }\r\n      }\r\n\r\n      if (!xc) return new BigNumber(x);\r\n\r\n      d = new BigNumber(ONE);\r\n      n1 = d0 = new BigNumber(ONE);\r\n      d1 = n0 = new BigNumber(ONE);\r\n      s = coeffToString(xc);\r\n\r\n      // Determine initial denominator.\r\n      // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n      e = d.e = s.length - x.e - 1;\r\n      d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n      md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n      exp = MAX_EXP;\r\n      MAX_EXP = 1 / 0;\r\n      n = new BigNumber(s);\r\n\r\n      // n0 = d1 = 0\r\n      n0.c[0] = 0;\r\n\r\n      for (; ;)  {\r\n        q = div(n, d, 0, 1);\r\n        d2 = d0.plus(q.times(d1));\r\n        if (d2.comparedTo(md) == 1) break;\r\n        d0 = d1;\r\n        d1 = d2;\r\n        n1 = n0.plus(q.times(d2 = n1));\r\n        n0 = d2;\r\n        d = n.minus(q.times(d2 = d));\r\n        n = d2;\r\n      }\r\n\r\n      d2 = div(md.minus(d0), d1, 0, 1);\r\n      n0 = n0.plus(d2.times(n1));\r\n      d0 = d0.plus(d2.times(d1));\r\n      n0.s = n1.s = x.s;\r\n      e = e * 2;\r\n\r\n      // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n      r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n          div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n      MAX_EXP = exp;\r\n\r\n      return r;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return the value of this BigNumber converted to a number primitive.\r\n     */\r\n    P.toNumber = function () {\r\n      return +valueOf(this);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n     * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n     * necessary to represent the integer part of the value in fixed-point notation, then use\r\n     * exponential notation.\r\n     *\r\n     * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.toPrecision = function (sd, rm) {\r\n      if (sd != null) intCheck(sd, 1, MAX);\r\n      return format(this, sd, rm, 2);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n     * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n     * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n     * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n     * TO_EXP_NEG, return exponential notation.\r\n     *\r\n     * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n     *\r\n     * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n     */\r\n    P.toString = function (b) {\r\n      var str,\r\n        n = this,\r\n        s = n.s,\r\n        e = n.e;\r\n\r\n      // Infinity or NaN?\r\n      if (e === null) {\r\n        if (s) {\r\n          str = 'Infinity';\r\n          if (s < 0) str = '-' + str;\r\n        } else {\r\n          str = 'NaN';\r\n        }\r\n      } else {\r\n        if (b == null) {\r\n          str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n           ? toExponential(coeffToString(n.c), e)\r\n           : toFixedPoint(coeffToString(n.c), e, '0');\r\n        } else if (b === 10) {\r\n          n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n          str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n        } else {\r\n          intCheck(b, 2, ALPHABET.length, 'Base');\r\n          str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n        }\r\n\r\n        if (s < 0 && n.c[0]) str = '-' + str;\r\n      }\r\n\r\n      return str;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return as toString, but do not accept a base argument, and include the minus sign for\r\n     * negative zero.\r\n     */\r\n    P.valueOf = P.toJSON = function () {\r\n      return valueOf(this);\r\n    };\r\n\r\n\r\n    P._isBigNumber = true;\r\n\r\n    if (hasSymbol) {\r\n      P[Symbol.toStringTag] = 'BigNumber';\r\n\r\n      // Node.js v10.12.0+\r\n      P[Symbol.for('nodejs.util.inspect.custom')] = P.valueOf;\r\n    }\r\n\r\n    if (configObject != null) BigNumber.set(configObject);\r\n\r\n    return BigNumber;\r\n  }\r\n\r\n\r\n  // PRIVATE HELPER FUNCTIONS\r\n\r\n  // These functions don't need access to variables,\r\n  // e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\n  function bitFloor(n) {\r\n    var i = n | 0;\r\n    return n > 0 || n === i ? i : i - 1;\r\n  }\r\n\r\n\r\n  // Return a coefficient array as a string of base 10 digits.\r\n  function coeffToString(a) {\r\n    var s, z,\r\n      i = 1,\r\n      j = a.length,\r\n      r = a[0] + '';\r\n\r\n    for (; i < j;) {\r\n      s = a[i++] + '';\r\n      z = LOG_BASE - s.length;\r\n      for (; z--; s = '0' + s);\r\n      r += s;\r\n    }\r\n\r\n    // Determine trailing zeros.\r\n    for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n    return r.slice(0, j + 1 || 1);\r\n  }\r\n\r\n\r\n  // Compare the value of BigNumbers x and y.\r\n  function compare(x, y) {\r\n    var a, b,\r\n      xc = x.c,\r\n      yc = y.c,\r\n      i = x.s,\r\n      j = y.s,\r\n      k = x.e,\r\n      l = y.e;\r\n\r\n    // Either NaN?\r\n    if (!i || !j) return null;\r\n\r\n    a = xc && !xc[0];\r\n    b = yc && !yc[0];\r\n\r\n    // Either zero?\r\n    if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n    // Signs differ?\r\n    if (i != j) return i;\r\n\r\n    a = i < 0;\r\n    b = k == l;\r\n\r\n    // Either Infinity?\r\n    if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n    // Compare exponents.\r\n    if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n    j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n    // Compare lengths.\r\n    return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n   */\r\n  function intCheck(n, min, max, name) {\r\n    if (n < min || n > max || n !== mathfloor(n)) {\r\n      throw Error\r\n       (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n         ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n         : ' not a primitive number: ') + String(n));\r\n    }\r\n  }\r\n\r\n\r\n  // Assumes finite n.\r\n  function isOdd(n) {\r\n    var k = n.c.length - 1;\r\n    return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n  }\r\n\r\n\r\n  function toExponential(str, e) {\r\n    return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n     (e < 0 ? 'e' : 'e+') + e;\r\n  }\r\n\r\n\r\n  function toFixedPoint(str, e, z) {\r\n    var len, zs;\r\n\r\n    // Negative exponent?\r\n    if (e < 0) {\r\n\r\n      // Prepend zeros.\r\n      for (zs = z + '.'; ++e; zs += z);\r\n      str = zs + str;\r\n\r\n    // Positive exponent\r\n    } else {\r\n      len = str.length;\r\n\r\n      // Append zeros.\r\n      if (++e > len) {\r\n        for (zs = z, e -= len; --e; zs += z);\r\n        str += zs;\r\n      } else if (e < len) {\r\n        str = str.slice(0, e) + '.' + str.slice(e);\r\n      }\r\n    }\r\n\r\n    return str;\r\n  }\r\n\r\n\r\n  // EXPORT\r\n\r\n\r\n  BigNumber = clone();\r\n  BigNumber['default'] = BigNumber.BigNumber = BigNumber;\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () { return BigNumber; });\r\n\r\n  // Node.js and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    module.exports = BigNumber;\r\n\r\n  // Browser.\r\n  } else {\r\n    if (!globalObject) {\r\n      globalObject = typeof self != 'undefined' && self ? self : window;\r\n    }\r\n\r\n    globalObject.BigNumber = BigNumber;\r\n  }\r\n})(this);\r\n","import { LocalService } from '@makerdao/services-core';\n// maybe a \"dai.js developer utils\" package is useful?\nimport { MKR, CHIEF } from './utils/constants';\nimport { getCurrency, netIdToName } from './utils/helpers';\n\n// imports from 'reads'\nimport { memoizeWith, uniq, nth, takeLast, identity } from 'ramda';\nimport contractInfo from '../contracts/contract-info.json';\nconst chiefInfo = contractInfo.chief;\n\nexport default class ChiefService extends LocalService {\n  constructor(name = 'chief') {\n    super(name, ['smartContract', 'web3']);\n  }\n\n  // Writes -----------------------------------------------\n\n  etch(addresses) {\n    return this._chiefContract().etch(addresses);\n  }\n\n  lift(address) {\n    return this._chiefContract().lift(address);\n  }\n\n  vote(picks) {\n    if (Array.isArray(picks))\n      return this._chiefContract()['vote(address[])'](picks);\n    return this._chiefContract()['vote(bytes32)'](picks);\n  }\n\n  lock(amt, unit = MKR) {\n    const mkrAmt = getCurrency(amt, unit).toFixed('wei');\n    return this._chiefContract().lock(mkrAmt);\n  }\n\n  free(amt, unit = MKR) {\n    const mkrAmt = getCurrency(amt, unit).toFixed('wei');\n    return this._chiefContract().free(mkrAmt);\n  }\n\n  // Reads ------------------------------------------------\n\n  paddedBytes32ToAddress = hex =>\n    hex.length > 42 ? '0x' + takeLast(40, hex) : hex;\n\n  parseVoteAddressData = data => {\n    const candidates = [];\n    const addressData = data.substr(330);\n    for (let i = 0; i < addressData.length / 64; i++) {\n      const address = `0x${addressData.substring(i * 64 + 24, (i + 1) * 64)}`;\n      if (address.length === 42) candidates.push(address);\n    }\n    return candidates;\n  };\n\n  // helper for when we might call getSlateAddresses with the same slate several times\n  memoizedGetSlateAddresses = memoizeWith(identity, this.getSlateAddresses);\n\n  getDetailedLockLogs = async () => {\n    const chiefAddress = this._chiefContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const locks = await web3Service.getPastLogs({\n      fromBlock: chiefInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: chiefAddress,\n      topics: [chiefInfo.events.lock]\n    });\n\n    return locks.map(lockLog => ({\n      blockNumber: lockLog.blockNumber,\n      sender: this.paddedBytes32ToAddress(lockLog.topics[1]),\n      amount: MKR.wei(lockLog.topics[2])\n    }));\n  };\n\n  getDetailedFreeLogs = async () => {\n    const chiefAddress = this._chiefContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const frees = await web3Service.getPastLogs({\n      fromBlock: chiefInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: chiefAddress,\n      topics: [chiefInfo.events.free]\n    });\n\n    return frees.map(freeLog => ({\n      blockNumber: freeLog.blockNumber,\n      sender: this.paddedBytes32ToAddress(freeLog.topics[1]),\n      amount: MKR.wei(freeLog.topics[2])\n    }));\n  };\n\n  getLockLogs = async () => {\n    const chiefAddress = this._chiefContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const locks = await web3Service.getPastLogs({\n      fromBlock: chiefInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: chiefAddress,\n      topics: [chiefInfo.events.lock]\n    });\n\n    return uniq(\n      locks\n        .map(logObj => nth(1, logObj.topics))\n        .map(this.paddedBytes32ToAddress)\n    );\n  };\n\n  getVoteAddressLogs = async () => {\n    const chiefAddress = this._chiefContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const votes = await web3Service.getPastLogs({\n      fromBlock: chiefInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: chiefAddress,\n      topics: [chiefInfo.events.vote_addresses]\n    });\n\n    return votes.map(voteLog => ({\n      blockNumber: voteLog.blockNumber,\n      sender: this.paddedBytes32ToAddress(voteLog.topics[1]),\n      candidates: this.parseVoteAddressData(voteLog.data)\n    }));\n  };\n\n  getVoteSlateLogs = async () => {\n    const chiefAddress = this._chiefContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const votes = await web3Service.getPastLogs({\n      fromBlock: chiefInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: chiefAddress,\n      topics: [chiefInfo.events.vote_slate]\n    });\n\n    return votes.map(voteLog => ({\n      blockNumber: voteLog.blockNumber,\n      sender: this.paddedBytes32ToAddress(voteLog.topics[1]),\n      slate: voteLog.topics[2]\n    }));\n  };\n\n  async getVoteTally() {\n    const voters = await this.getLockLogs();\n\n    const withDeposits = await Promise.all(\n      voters.map(voter =>\n        this.getNumDeposits(voter).then(deposits => ({\n          address: voter,\n          deposits: parseFloat(deposits)\n        }))\n      )\n    );\n\n    const withSlates = await Promise.all(\n      withDeposits.map(addressDeposit =>\n        this.getVotedSlate(addressDeposit.address).then(slate => ({\n          ...addressDeposit,\n          slate\n        }))\n      )\n    );\n\n    const withVotes = await Promise.all(\n      withSlates.map(withSlate =>\n        this.memoizedGetSlateAddresses(withSlate.slate).then(addresses => ({\n          ...withSlate,\n          votes: addresses\n        }))\n      )\n    );\n\n    const voteTally = {};\n    for (const voteObj of withVotes) {\n      for (let vote of voteObj.votes) {\n        vote = vote.toLowerCase();\n        if (voteTally[vote] === undefined) {\n          voteTally[vote] = {\n            approvals: voteObj.deposits,\n            addresses: [\n              { address: voteObj.address, deposits: voteObj.deposits }\n            ]\n          };\n        } else {\n          voteTally[vote].approvals += voteObj.deposits;\n          voteTally[vote].addresses.push({\n            address: voteObj.address,\n            deposits: voteObj.deposits\n          });\n        }\n      }\n    }\n    for (const [key, value] of Object.entries(voteTally)) {\n      const sortedAddresses = value.addresses.sort(\n        (a, b) => b.deposits - a.deposits\n      );\n      const approvals = voteTally[key].approvals;\n      const withPercentages = sortedAddresses.map(shapedVoteObj => ({\n        ...shapedVoteObj,\n        percent: ((shapedVoteObj.deposits * 100) / approvals).toFixed(2)\n      }));\n      voteTally[key] = withPercentages;\n    }\n    return voteTally;\n  }\n\n  getVotedSlate(address) {\n    return this._chiefContract().votes(address);\n  }\n\n  getNumDeposits(address) {\n    return this._chiefContract()\n      .deposits(address)\n      .then(MKR.wei);\n  }\n\n  getApprovalCount(address) {\n    return this._chiefContract()\n      .approvals(address)\n      .then(MKR.wei);\n  }\n\n  getHat() {\n    return this._chiefContract().hat();\n  }\n\n  async getSlateAddresses(slateHash, i = 0) {\n    try {\n      return [await this._chiefContract().slates(slateHash, i)].concat(\n        await this.getSlateAddresses(slateHash, i + 1)\n      );\n    } catch (_) {\n      return [];\n    }\n  }\n\n  getLockAddressLogs() {\n    return new Promise((resolve, reject) => {\n      this._chiefContract({ web3js: true })\n        .LogNote({ sig: '0xdd467064' }, { fromBlock: 0, toBlock: 'latest' })\n        .get((error, result) => {\n          if (error) reject(error);\n          resolve(result.map(log => log.args.guy));\n        });\n    });\n  }\n\n  getEtchSlateLogs() {\n    return new Promise((resolve, reject) => {\n      this._chiefContract({ web3js: true })\n        .Etch({}, { fromBlock: 0, toBlock: 'latest' })\n        .get((error, result) => {\n          if (error) reject(error);\n          resolve(result.map(log => log.args.slate));\n        });\n    });\n  }\n\n  // Internal --------------------------------------------\n\n  _chiefContract({ web3js = false } = {}) {\n    if (web3js) return this.get('smartContract').getWeb3ContractByName(CHIEF);\n    return this.get('smartContract').getContractByName(CHIEF);\n  }\n}\n","function _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}\n\nmodule.exports = _arrayWithHoles;","function _iterableToArrayLimit(arr, i) {\n  if (typeof Symbol === \"undefined\" || !(Symbol.iterator in Object(arr))) return;\n  var _arr = [];\n  var _n = true;\n  var _d = false;\n  var _e = undefined;\n\n  try {\n    for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) {\n      _arr.push(_s.value);\n\n      if (i && _arr.length === i) break;\n    }\n  } catch (err) {\n    _d = true;\n    _e = err;\n  } finally {\n    try {\n      if (!_n && _i[\"return\"] != null) _i[\"return\"]();\n    } finally {\n      if (_d) throw _e;\n    }\n  }\n\n  return _arr;\n}\n\nmodule.exports = _iterableToArrayLimit;","function _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nmodule.exports = _nonIterableRest;","/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nvar runtime = (function (exports) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  exports.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  IteratorPrototype[iteratorSymbol] = function () {\n    return this;\n  };\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype &&\n      NativeIteratorPrototype !== Op &&\n      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype =\n    Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n  GeneratorFunctionPrototype.constructor = GeneratorFunction;\n  GeneratorFunctionPrototype[toStringTagSymbol] =\n    GeneratorFunction.displayName = \"GeneratorFunction\";\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function(method) {\n      prototype[method] = function(arg) {\n        return this._invoke(method, arg);\n      };\n    });\n  }\n\n  exports.isGeneratorFunction = function(genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor\n      ? ctor === GeneratorFunction ||\n        // For the native GeneratorFunction constructor, the best we can\n        // do is to check its .name property.\n        (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n      : false;\n  };\n\n  exports.mark = function(genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      if (!(toStringTagSymbol in genFun)) {\n        genFun[toStringTagSymbol] = \"GeneratorFunction\";\n      }\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  exports.awrap = function(arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator, PromiseImpl) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value &&\n            typeof value === \"object\" &&\n            hasOwn.call(value, \"__await\")) {\n          return PromiseImpl.resolve(value.__await).then(function(value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function(err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return PromiseImpl.resolve(value).then(function(unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration.\n          result.value = unwrapped;\n          resolve(result);\n        }, function(error) {\n          // If a rejected Promise was yielded, throw the rejection back\n          // into the async generator function so it can be handled there.\n          return invoke(\"throw\", error, resolve, reject);\n        });\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new PromiseImpl(function(resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n        // If enqueue has been called before, then we want to wait until\n        // all previous Promises have been resolved before calling invoke,\n        // so that results are always delivered in the correct order. If\n        // enqueue has not been called before, then it is important to\n        // call invoke immediately, without waiting on a callback to fire,\n        // so that the async generator function has the opportunity to do\n        // any necessary setup in a predictable way. This predictability\n        // is why the Promise constructor synchronously invokes its\n        // executor callback, and why async functions synchronously\n        // execute code before the first await. Since we implement simple\n        // async functions in terms of async generators, it is especially\n        // important to get this right, even though it requires care.\n        previousPromise ? previousPromise.then(\n          callInvokeWithMethodAndArg,\n          // Avoid propagating failures to Promises returned by later\n          // invocations of the iterator.\n          callInvokeWithMethodAndArg\n        ) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n    return this;\n  };\n  exports.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  exports.async = function(innerFn, outerFn, self, tryLocsList, PromiseImpl) {\n    if (PromiseImpl === void 0) PromiseImpl = Promise;\n\n    var iter = new AsyncIterator(\n      wrap(innerFn, outerFn, self, tryLocsList),\n      PromiseImpl\n    );\n\n    return exports.isGeneratorFunction(outerFn)\n      ? iter // If outerFn is a generator, return the full iterator.\n      : iter.next().then(function(result) {\n          return result.done ? result.value : iter.next();\n        });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done\n            ? GenStateCompleted\n            : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        // Note: [\"return\"] must be used for ES3 parsing compatibility.\n        if (delegate.iterator[\"return\"]) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\n          \"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (! info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  Gp[toStringTagSymbol] = \"Generator\";\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  Gp[iteratorSymbol] = function() {\n    return this;\n  };\n\n  Gp.toString = function() {\n    return \"[object Generator]\";\n  };\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  exports.keys = function(object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1, next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  exports.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" &&\n              hasOwn.call(this, name) &&\n              !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !! caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev &&\n            hasOwn.call(entry, \"finallyLoc\") &&\n            this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry &&\n          (type === \"break\" ||\n           type === \"continue\") &&\n          finallyEntry.tryLoc <= arg &&\n          arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" ||\n          record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n\n  // Regardless of whether this script is executing as a CommonJS module\n  // or not, return the runtime object so that we can declare the variable\n  // regeneratorRuntime in the outer scope, which allows this module to be\n  // injected easily by `bin/regenerator --include-runtime script.js`.\n  return exports;\n\n}(\n  // If this script is executing as a CommonJS module, use module.exports\n  // as the regeneratorRuntime namespace. Otherwise create a new empty\n  // object. Either way, the resulting object will be used to initialize\n  // the regeneratorRuntime variable at the top of this file.\n  typeof module === \"object\" ? module.exports : {}\n));\n\ntry {\n  regeneratorRuntime = runtime;\n} catch (accidentalStrictMode) {\n  // This module should not be running in strict mode, so the above\n  // assignment should always work unless something is misconfigured. Just\n  // in case runtime.js accidentally runs in strict mode, we can escape\n  // strict mode using a global Function call. This could conceivably fail\n  // if a Content Security Policy forbids using Function, but in that case\n  // the proper solution is to fix the accidental strict mode problem. If\n  // you've misconfigured your bundler to force strict mode and applied a\n  // CSP to forbid Function, and you're not willing to fix either of those\n  // problems, please detail your unique predicament in a GitHub issue.\n  Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n}\n","var superPropBase = require(\"./superPropBase\");\n\nfunction _get(target, property, receiver) {\n  if (typeof Reflect !== \"undefined\" && Reflect.get) {\n    module.exports = _get = Reflect.get;\n  } else {\n    module.exports = _get = function _get(target, property, receiver) {\n      var base = superPropBase(target, property);\n      if (!base) return;\n      var desc = Object.getOwnPropertyDescriptor(base, property);\n\n      if (desc.get) {\n        return desc.get.call(receiver);\n      }\n\n      return desc.value;\n    };\n  }\n\n  return _get(target, property, receiver || target);\n}\n\nmodule.exports = _get;","var getPrototypeOf = require(\"./getPrototypeOf\");\n\nfunction _superPropBase(object, property) {\n  while (!Object.prototype.hasOwnProperty.call(object, property)) {\n    object = getPrototypeOf(object);\n    if (object === null) break;\n  }\n\n  return object;\n}\n\nmodule.exports = _superPropBase;","function _isNativeFunction(fn) {\n  return Function.toString.call(fn).indexOf(\"[native code]\") !== -1;\n}\n\nmodule.exports = _isNativeFunction;","var setPrototypeOf = require(\"./setPrototypeOf\");\n\nvar isNativeReflectConstruct = require(\"./isNativeReflectConstruct\");\n\nfunction _construct(Parent, args, Class) {\n  if (isNativeReflectConstruct()) {\n    module.exports = _construct = Reflect.construct;\n  } else {\n    module.exports = _construct = function _construct(Parent, args, Class) {\n      var a = [null];\n      a.push.apply(a, args);\n      var Constructor = Function.bind.apply(Parent, a);\n      var instance = new Constructor();\n      if (Class) setPrototypeOf(instance, Class.prototype);\n      return instance;\n    };\n  }\n\n  return _construct.apply(null, arguments);\n}\n\nmodule.exports = _construct;","function _isNativeReflectConstruct() {\n  if (typeof Reflect === \"undefined\" || !Reflect.construct) return false;\n  if (Reflect.construct.sham) return false;\n  if (typeof Proxy === \"function\") return true;\n\n  try {\n    Date.prototype.toString.call(Reflect.construct(Date, [], function () {}));\n    return true;\n  } catch (e) {\n    return false;\n  }\n}\n\nmodule.exports = _isNativeReflectConstruct;","\"use strict\";\n\nvar _interopRequireWildcard = require(\"@babel/runtime/helpers/interopRequireWildcard\");\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _StateMachine = _interopRequireDefault(require(\"./StateMachine\"));\n\nvar _ServiceState = _interopRequireDefault(require(\"./ServiceState\"));\n\nvar _ServiceType = _interopRequireWildcard(require(\"./ServiceType\"));\n\nvar _debug = _interopRequireDefault(require(\"debug\"));\n\nvar log = (0, _debug[\"default\"])('dai:ServiceManagerBase');\n\nfunction _promisify(unsafeCallback) {\n  return new Promise(function (resolve, reject) {\n    try {\n      resolve(unsafeCallback());\n    } catch (e) {\n      reject(e.message);\n    }\n  });\n}\n\nvar ServiceManagerBase = /*#__PURE__*/function () {\n  /**\n   * @param init {function|null}\n   * @param connect {function|null}\n   * @param auth {function|null}\n   */\n  function ServiceManagerBase() {\n    var init = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n    var connect = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n    var auth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;\n    (0, _classCallCheck2[\"default\"])(this, ServiceManagerBase);\n\n    // Validate init\n    if (init !== null && typeof init !== 'function') {\n      throw new Error('Invalid argument init: not a function or null.');\n    } else if (init === null) {\n      init = function init() {\n        return Promise.resolve();\n      };\n    } // Validate connect\n\n\n    if (connect !== null && typeof connect !== 'function') {\n      throw new Error('Invalid argument connect: not a function or null.');\n    } else if (connect === null && auth !== null) {\n      connect = function connect() {\n        return Promise.resolve();\n      };\n    } // Validate auth\n\n\n    if (auth !== null && typeof auth !== 'function') {\n      throw new Error('Invalid argument auth: not a function or null.');\n    } // Set initial props\n\n\n    this._init = init;\n    this._connect = connect;\n    this._auth = auth;\n    this._type = auth === null ? connect === null ? _ServiceType[\"default\"].LOCAL : _ServiceType[\"default\"].PUBLIC : _ServiceType[\"default\"].PRIVATE;\n    this._state = new _StateMachine[\"default\"](_ServiceState[\"default\"].CREATED, _ServiceType.serviceTypeTransitions[this._type]);\n    this._initPromise = null;\n    this._connectPromise = null;\n    this._authPromise = null;\n  }\n  /**\n   * @returns {Promise}\n   */\n\n\n  (0, _createClass2[\"default\"])(ServiceManagerBase, [{\n    key: \"initialize\",\n    value: function initialize(settings) {\n      var _this = this;\n\n      // If our current state is preceding the INITIALIZING state, we need to set up initialization\n      if (this._state.inState(_ServiceState[\"default\"].CREATED)) {\n        // Assert that there is no initPromise at this point\n\n        /* istanbul ignore next */\n        if (this._initPromise) {\n          throw new Error('Unexpected init promise in state CREATED.');\n        } // Enter the INITIALIZING state\n\n\n        this._state.transitionTo(_ServiceState[\"default\"].INITIALIZING); // After trying to initialize, transition to the success state (READY/OFFLINE) or revert to CREATED\n\n\n        this._initPromise = _promisify(function () {\n          return _this._init(settings);\n        }).then(function () {\n          return _this._state.transitionTo(_this._type === _ServiceType[\"default\"].LOCAL ? _ServiceState[\"default\"].READY : _ServiceState[\"default\"].OFFLINE);\n        }, function (reason) {\n          log(reason);\n\n          _this._state.transitionTo(_ServiceState[\"default\"].CREATED);\n\n          throw reason;\n        });\n      }\n\n      return this._initPromise;\n    }\n    /**\n     * @returns {Promise}\n     */\n\n  }, {\n    key: \"connect\",\n    value: function connect() {\n      var _this2 = this;\n\n      // Local Services are 'connected' whenever they are initialized\n      if (this._type === _ServiceType[\"default\"].LOCAL) {\n        return this.initialize();\n      } // If our current state is preceding the CONNECTING state, we need to set up a new connection\n\n\n      if (this._state.inState([_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].INITIALIZING, _ServiceState[\"default\"].OFFLINE]) && this._connectPromise === null) {\n        // Make sure to be initialized before trying to connect\n        this._connectPromise = this.initialize().then(function () {\n          // Enter the CONNECTING state\n          _this2._state.transitionTo(_ServiceState[\"default\"].CONNECTING); // After trying to connect, transition to the success state (ONLINE/READY) or revert to OFFLINE.\n\n\n          return _promisify(function () {\n            return _this2._connect(function () {\n              return _this2._disconnect();\n            });\n          }).then(function () {\n            // Check if we are still CONNECTING, because another process might have come in between\n            if (_this2._state.inState(_ServiceState[\"default\"].CONNECTING)) {\n              _this2._state.transitionTo(_this2._type === _ServiceType[\"default\"].PUBLIC ? _ServiceState[\"default\"].READY : _ServiceState[\"default\"].ONLINE);\n            }\n          }, function (error) {\n            log('connect error:', error); // Check if we are still CONNECTING, because another process might have come in between\n\n            if (_this2._state.inState(_ServiceState[\"default\"].CONNECTING)) {\n              _this2._state.transitionTo(_ServiceState[\"default\"].OFFLINE);\n            }\n\n            throw error;\n          });\n        });\n      }\n\n      return this._connectPromise;\n    }\n    /**\n     * @returns {Promise}\n     */\n\n  }, {\n    key: \"authenticate\",\n    value: function authenticate() {\n      var _this3 = this;\n\n      // Public and Local Services are 'authenticated' whenever they are connected (/initialized)\n      if (this._type !== _ServiceType[\"default\"].PRIVATE) {\n        return this.connect();\n      } // If our current state is preceding the AUTHENTICATING state, we need to set up a new authentication\n\n\n      if (this._state.inState([_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].INITIALIZING, _ServiceState[\"default\"].OFFLINE, _ServiceState[\"default\"].CONNECTING, _ServiceState[\"default\"].ONLINE]) && this._authPromise === null) {\n        // Make sure to be connected before trying to authenticate\n        this._authPromise = this.connect().then(function () {\n          // Enter the AUTHENTICATING state\n          _this3._state.transitionTo(_ServiceState[\"default\"].AUTHENTICATING); // After trying to authenticate, transition to the success state (READY) or revert to ONLINE\n\n\n          return _promisify(function () {\n            return _this3._auth(function () {\n              return _this3._deauthenticate();\n            });\n          }).then(function () {\n            // Check if we are still AUTHENTICATING, because another process might have come in between\n            // (Most notably, a disconnect may have transitioned us into OFFLINE state).\n            if (_this3._state.inState(_ServiceState[\"default\"].AUTHENTICATING)) {\n              _this3._state.transitionTo(_ServiceState[\"default\"].READY);\n            }\n          }, function (reason) {\n            log('authenticate error: ' + reason); // Check if we are still AUTHENTICATING, because another process might have come in between\n\n            if (_this3._state.inState(_ServiceState[\"default\"].AUTHENTICATING)) {\n              _this3._state.transitionTo(_ServiceState[\"default\"].ONLINE);\n            }\n          });\n        });\n      }\n\n      return this._authPromise;\n    }\n    /**\n     * @returns { ServiceManagerBase }\n     */\n\n  }, {\n    key: \"settings\",\n    value: function settings(_settings) {\n      this._settings = _settings;\n      return this;\n    }\n    /**\n     * @returns {string}\n     */\n\n  }, {\n    key: \"state\",\n    value: function state() {\n      return this._state.state();\n    }\n    /**\n     * @returns {string}\n     */\n\n  }, {\n    key: \"type\",\n    value: function type() {\n      return this._type;\n    }\n    /**\n     * @returns {boolean}\n     */\n\n  }, {\n    key: \"isInitialized\",\n    value: function isInitialized() {\n      return !this._state.inState([_ServiceState[\"default\"].CREATED, _ServiceState[\"default\"].INITIALIZING]);\n    }\n    /**\n     * @returns {boolean|null}\n     */\n\n  }, {\n    key: \"isConnected\",\n    value: function isConnected() {\n      return this._type === _ServiceType[\"default\"].LOCAL ? null : this._state.inState([_ServiceState[\"default\"].ONLINE, _ServiceState[\"default\"].AUTHENTICATING, _ServiceState[\"default\"].READY]);\n    }\n    /**\n     * @returns {boolean|null}\n     */\n\n  }, {\n    key: \"isAuthenticated\",\n    value: function isAuthenticated() {\n      return this._type === _ServiceType[\"default\"].PRIVATE ? this._state.inState(_ServiceState[\"default\"].READY) : null;\n    }\n    /**\n     * @returns {boolean}\n     */\n\n  }, {\n    key: \"isReady\",\n    value: function isReady() {\n      return this._state.inState(_ServiceState[\"default\"].READY);\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onInitialized\",\n    value: function onInitialized(handler) {\n      this._state.onStateChanged(function (oldState, newState) {\n        if (oldState === _ServiceState[\"default\"].INITIALIZING && (newState === _ServiceState[\"default\"].OFFLINE || newState === _ServiceState[\"default\"].READY)) {\n          handler();\n        }\n      });\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onConnected\",\n    value: function onConnected(handler) {\n      this._state.onStateChanged(function (oldState, newState) {\n        if (oldState === _ServiceState[\"default\"].CONNECTING && (newState === _ServiceState[\"default\"].ONLINE || newState === _ServiceState[\"default\"].READY)) {\n          handler();\n        }\n      });\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onDisconnected\",\n    value: function onDisconnected(handler) {\n      this._state.onStateChanged(function (oldState, newState) {\n        if (newState === _ServiceState[\"default\"].OFFLINE && (oldState === _ServiceState[\"default\"].ONLINE || oldState === _ServiceState[\"default\"].READY)) {\n          handler();\n        }\n      });\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onAuthenticated\",\n    value: function onAuthenticated(handler) {\n      this._state.onStateChanged(function (oldState, newState) {\n        if (oldState === _ServiceState[\"default\"].AUTHENTICATING && newState === _ServiceState[\"default\"].READY) {\n          handler();\n        }\n      });\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onDeauthenticated\",\n    value: function onDeauthenticated(handler) {\n      if (this.type() === _ServiceType[\"default\"].PRIVATE) {\n        this._state.onStateChanged(function (oldState, newState) {\n          if ((newState === _ServiceState[\"default\"].OFFLINE || newState === _ServiceState[\"default\"].ONLINE) && oldState === _ServiceState[\"default\"].READY) {\n            handler();\n          }\n        });\n      }\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onReady\",\n    value: function onReady(handler) {\n      this._state.onStateChanged(function (_, newState) {\n        if (newState === _ServiceState[\"default\"].READY) {\n          handler();\n        }\n      });\n\n      return this;\n    }\n    /**\n     * @param {function} handler\n     * @returns {ServiceManagerBase}\n     */\n\n  }, {\n    key: \"onStateChanged\",\n    value: function onStateChanged(handler) {\n      this._state.onStateChanged(handler);\n\n      return this;\n    }\n    /**\n     * This is called by the service implementation object, which is the only authority with knowledge on the true\n     * connection status. This will e.g. get called when a ping signal is no longer returned by the back-end and the\n     * service implementation object concludes that we are therefore offline.\n     *\n     * @private\n     */\n\n  }, {\n    key: \"_disconnect\",\n    value: function _disconnect() {\n      /* istanbul ignore next */\n      if (this._type === _ServiceType[\"default\"].LOCAL) {\n        throw new Error('_disconnect must not be called on a Local Service');\n      }\n\n      if (this._state.inState(_ServiceState[\"default\"].AUTHENTICATING)) {\n        this._deauthenticate();\n      }\n\n      if (this._state.inState([_ServiceState[\"default\"].READY, _ServiceState[\"default\"].ONLINE, _ServiceState[\"default\"].CONNECTING])) {\n        this._authPromise = null;\n        this._connectPromise = null;\n\n        this._state.transitionTo(_ServiceState[\"default\"].OFFLINE);\n      }\n    }\n    /**\n     * This is called by the service implementation object, which is the only authority with knowledge on the true\n     * authentication status. This will e.g. get called when an authentication token expires or a user logs out, and the\n     * service implementation object concludes that we are therefore no longer authenticated.\n     *\n     * @private\n     */\n\n  }, {\n    key: \"_deauthenticate\",\n    value: function _deauthenticate() {\n      /* istanbul ignore next */\n      if (this._type !== _ServiceType[\"default\"].PRIVATE) {\n        throw new Error('_deauthenticate must not be called on a Local or Public Service');\n      }\n\n      if (this._state.inState([_ServiceState[\"default\"].READY, _ServiceState[\"default\"].AUTHENTICATING])) {\n        this._authPromise = null;\n\n        this._state.transitionTo(_ServiceState[\"default\"].ONLINE);\n      }\n    }\n  }]);\n  return ServiceManagerBase;\n}();\n\nvar _default = ServiceManagerBase;\nexports[\"default\"] = _default;","/**\n * This is the web browser implementation of `debug()`.\n *\n * Expose `debug()` as the module.\n */\n\nexports = module.exports = require('./debug');\nexports.log = log;\nexports.formatArgs = formatArgs;\nexports.save = save;\nexports.load = load;\nexports.useColors = useColors;\nexports.storage = 'undefined' != typeof chrome\n               && 'undefined' != typeof chrome.storage\n                  ? chrome.storage.local\n                  : localstorage();\n\n/**\n * Colors.\n */\n\nexports.colors = [\n  'lightseagreen',\n  'forestgreen',\n  'goldenrod',\n  'dodgerblue',\n  'darkorchid',\n  'crimson'\n];\n\n/**\n * Currently only WebKit-based Web Inspectors, Firefox >= v31,\n * and the Firebug extension (any Firefox version) are known\n * to support \"%c\" CSS customizations.\n *\n * TODO: add a `localStorage` variable to explicitly enable/disable colors\n */\n\nfunction useColors() {\n  // NB: In an Electron preload script, document will be defined but not fully\n  // initialized. Since we know we're in Chrome, we'll just detect this case\n  // explicitly\n  if (typeof window !== 'undefined' && window.process && window.process.type === 'renderer') {\n    return true;\n  }\n\n  // is webkit? http://stackoverflow.com/a/16459606/376773\n  // document is undefined in react-native: https://github.com/facebook/react-native/pull/1632\n  return (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) ||\n    // is firebug? http://stackoverflow.com/a/398120/376773\n    (typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||\n    // is firefox >= v31?\n    // https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages\n    (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/firefox\\/(\\d+)/) && parseInt(RegExp.$1, 10) >= 31) ||\n    // double check webkit in userAgent just in case we are in a worker\n    (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\\/(\\d+)/));\n}\n\n/**\n * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.\n */\n\nexports.formatters.j = function(v) {\n  try {\n    return JSON.stringify(v);\n  } catch (err) {\n    return '[UnexpectedJSONParseError]: ' + err.message;\n  }\n};\n\n\n/**\n * Colorize log arguments if enabled.\n *\n * @api public\n */\n\nfunction formatArgs(args) {\n  var useColors = this.useColors;\n\n  args[0] = (useColors ? '%c' : '')\n    + this.namespace\n    + (useColors ? ' %c' : ' ')\n    + args[0]\n    + (useColors ? '%c ' : ' ')\n    + '+' + exports.humanize(this.diff);\n\n  if (!useColors) return;\n\n  var c = 'color: ' + this.color;\n  args.splice(1, 0, c, 'color: inherit')\n\n  // the final \"%c\" is somewhat tricky, because there could be other\n  // arguments passed either before or after the %c, so we need to\n  // figure out the correct index to insert the CSS into\n  var index = 0;\n  var lastC = 0;\n  args[0].replace(/%[a-zA-Z%]/g, function(match) {\n    if ('%%' === match) return;\n    index++;\n    if ('%c' === match) {\n      // we only are interested in the *last* %c\n      // (the user may have provided their own)\n      lastC = index;\n    }\n  });\n\n  args.splice(lastC, 0, c);\n}\n\n/**\n * Invokes `console.log()` when available.\n * No-op when `console.log` is not a \"function\".\n *\n * @api public\n */\n\nfunction log() {\n  // this hackery is required for IE8/9, where\n  // the `console.log` function doesn't have 'apply'\n  return 'object' === typeof console\n    && console.log\n    && Function.prototype.apply.call(console.log, console, arguments);\n}\n\n/**\n * Save `namespaces`.\n *\n * @param {String} namespaces\n * @api private\n */\n\nfunction save(namespaces) {\n  try {\n    if (null == namespaces) {\n      exports.storage.removeItem('debug');\n    } else {\n      exports.storage.debug = namespaces;\n    }\n  } catch(e) {}\n}\n\n/**\n * Load `namespaces`.\n *\n * @return {String} returns the previously persisted debug modes\n * @api private\n */\n\nfunction load() {\n  var r;\n  try {\n    r = exports.storage.debug;\n  } catch(e) {}\n\n  // If debug isn't set in LS, and we're in Electron, try to load $DEBUG\n  if (!r && typeof process !== 'undefined' && 'env' in process) {\n    r = process.env.DEBUG;\n  }\n\n  return r;\n}\n\n/**\n * Enable namespaces listed in `localStorage.debug` initially.\n */\n\nexports.enable(load());\n\n/**\n * Localstorage attempts to return the localstorage.\n *\n * This is necessary because safari throws\n * when a user disables cookies/localstorage\n * and you attempt to access it.\n *\n * @return {LocalStorage}\n * @api private\n */\n\nfunction localstorage() {\n  try {\n    return window.localStorage;\n  } catch (e) {}\n}\n","\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n *\n * Expose `debug()` as the module.\n */\n\nexports = module.exports = createDebug.debug = createDebug['default'] = createDebug;\nexports.coerce = coerce;\nexports.disable = disable;\nexports.enable = enable;\nexports.enabled = enabled;\nexports.humanize = require('ms');\n\n/**\n * The currently active debug mode names, and names to skip.\n */\n\nexports.names = [];\nexports.skips = [];\n\n/**\n * Map of special \"%n\" handling functions, for the debug \"format\" argument.\n *\n * Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n */\n\nexports.formatters = {};\n\n/**\n * Previous log timestamp.\n */\n\nvar prevTime;\n\n/**\n * Select a color.\n * @param {String} namespace\n * @return {Number}\n * @api private\n */\n\nfunction selectColor(namespace) {\n  var hash = 0, i;\n\n  for (i in namespace) {\n    hash  = ((hash << 5) - hash) + namespace.charCodeAt(i);\n    hash |= 0; // Convert to 32bit integer\n  }\n\n  return exports.colors[Math.abs(hash) % exports.colors.length];\n}\n\n/**\n * Create a debugger with the given `namespace`.\n *\n * @param {String} namespace\n * @return {Function}\n * @api public\n */\n\nfunction createDebug(namespace) {\n\n  function debug() {\n    // disabled?\n    if (!debug.enabled) return;\n\n    var self = debug;\n\n    // set `diff` timestamp\n    var curr = +new Date();\n    var ms = curr - (prevTime || curr);\n    self.diff = ms;\n    self.prev = prevTime;\n    self.curr = curr;\n    prevTime = curr;\n\n    // turn the `arguments` into a proper Array\n    var args = new Array(arguments.length);\n    for (var i = 0; i < args.length; i++) {\n      args[i] = arguments[i];\n    }\n\n    args[0] = exports.coerce(args[0]);\n\n    if ('string' !== typeof args[0]) {\n      // anything else let's inspect with %O\n      args.unshift('%O');\n    }\n\n    // apply any `formatters` transformations\n    var index = 0;\n    args[0] = args[0].replace(/%([a-zA-Z%])/g, function(match, format) {\n      // if we encounter an escaped % then don't increase the array index\n      if (match === '%%') return match;\n      index++;\n      var formatter = exports.formatters[format];\n      if ('function' === typeof formatter) {\n        var val = args[index];\n        match = formatter.call(self, val);\n\n        // now we need to remove `args[index]` since it's inlined in the `format`\n        args.splice(index, 1);\n        index--;\n      }\n      return match;\n    });\n\n    // apply env-specific formatting (colors, etc.)\n    exports.formatArgs.call(self, args);\n\n    var logFn = debug.log || exports.log || console.log.bind(console);\n    logFn.apply(self, args);\n  }\n\n  debug.namespace = namespace;\n  debug.enabled = exports.enabled(namespace);\n  debug.useColors = exports.useColors();\n  debug.color = selectColor(namespace);\n\n  // env-specific initialization logic for debug instances\n  if ('function' === typeof exports.init) {\n    exports.init(debug);\n  }\n\n  return debug;\n}\n\n/**\n * Enables a debug mode by namespaces. This can include modes\n * separated by a colon and wildcards.\n *\n * @param {String} namespaces\n * @api public\n */\n\nfunction enable(namespaces) {\n  exports.save(namespaces);\n\n  exports.names = [];\n  exports.skips = [];\n\n  var split = (typeof namespaces === 'string' ? namespaces : '').split(/[\\s,]+/);\n  var len = split.length;\n\n  for (var i = 0; i < len; i++) {\n    if (!split[i]) continue; // ignore empty strings\n    namespaces = split[i].replace(/\\*/g, '.*?');\n    if (namespaces[0] === '-') {\n      exports.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));\n    } else {\n      exports.names.push(new RegExp('^' + namespaces + '$'));\n    }\n  }\n}\n\n/**\n * Disable debug output.\n *\n * @api public\n */\n\nfunction disable() {\n  exports.enable('');\n}\n\n/**\n * Returns true if the given mode name is enabled, false otherwise.\n *\n * @param {String} name\n * @return {Boolean}\n * @api public\n */\n\nfunction enabled(name) {\n  var i, len;\n  for (i = 0, len = exports.skips.length; i < len; i++) {\n    if (exports.skips[i].test(name)) {\n      return false;\n    }\n  }\n  for (i = 0, len = exports.names.length; i < len; i++) {\n    if (exports.names[i].test(name)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Coerce `val`.\n *\n * @param {Mixed} val\n * @return {Mixed}\n * @api private\n */\n\nfunction coerce(val) {\n  if (val instanceof Error) return val.stack || val.message;\n  return val;\n}\n","/**\n * Helpers.\n */\n\nvar s = 1000;\nvar m = s * 60;\nvar h = m * 60;\nvar d = h * 24;\nvar y = d * 365.25;\n\n/**\n * Parse or format the given `val`.\n *\n * Options:\n *\n *  - `long` verbose formatting [false]\n *\n * @param {String|Number} val\n * @param {Object} [options]\n * @throws {Error} throw an error if val is not a non-empty string or a number\n * @return {String|Number}\n * @api public\n */\n\nmodule.exports = function(val, options) {\n  options = options || {};\n  var type = typeof val;\n  if (type === 'string' && val.length > 0) {\n    return parse(val);\n  } else if (type === 'number' && isNaN(val) === false) {\n    return options.long ? fmtLong(val) : fmtShort(val);\n  }\n  throw new Error(\n    'val is not a non-empty string or a valid number. val=' +\n      JSON.stringify(val)\n  );\n};\n\n/**\n * Parse the given `str` and return milliseconds.\n *\n * @param {String} str\n * @return {Number}\n * @api private\n */\n\nfunction parse(str) {\n  str = String(str);\n  if (str.length > 100) {\n    return;\n  }\n  var match = /^((?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|years?|yrs?|y)?$/i.exec(\n    str\n  );\n  if (!match) {\n    return;\n  }\n  var n = parseFloat(match[1]);\n  var type = (match[2] || 'ms').toLowerCase();\n  switch (type) {\n    case 'years':\n    case 'year':\n    case 'yrs':\n    case 'yr':\n    case 'y':\n      return n * y;\n    case 'days':\n    case 'day':\n    case 'd':\n      return n * d;\n    case 'hours':\n    case 'hour':\n    case 'hrs':\n    case 'hr':\n    case 'h':\n      return n * h;\n    case 'minutes':\n    case 'minute':\n    case 'mins':\n    case 'min':\n    case 'm':\n      return n * m;\n    case 'seconds':\n    case 'second':\n    case 'secs':\n    case 'sec':\n    case 's':\n      return n * s;\n    case 'milliseconds':\n    case 'millisecond':\n    case 'msecs':\n    case 'msec':\n    case 'ms':\n      return n;\n    default:\n      return undefined;\n  }\n}\n\n/**\n * Short format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtShort(ms) {\n  if (ms >= d) {\n    return Math.round(ms / d) + 'd';\n  }\n  if (ms >= h) {\n    return Math.round(ms / h) + 'h';\n  }\n  if (ms >= m) {\n    return Math.round(ms / m) + 'm';\n  }\n  if (ms >= s) {\n    return Math.round(ms / s) + 's';\n  }\n  return ms + 'ms';\n}\n\n/**\n * Long format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtLong(ms) {\n  return plural(ms, d, 'day') ||\n    plural(ms, h, 'hour') ||\n    plural(ms, m, 'minute') ||\n    plural(ms, s, 'second') ||\n    ms + ' ms';\n}\n\n/**\n * Pluralization helper.\n */\n\nfunction plural(ms, n, name) {\n  if (ms < n) {\n    return;\n  }\n  if (ms < n * 1.5) {\n    return Math.floor(ms / n) + ' ' + name;\n  }\n  return Math.ceil(ms / n) + ' ' + name + 's';\n}\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\n\nvar _slicedToArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/slicedToArray\"));\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\n\nvar _uniq = _interopRequireDefault(require(\"lodash/uniq\"));\n\nvar _Container = _interopRequireDefault(require(\"./Container\"));\n\nvar _standardizeConfig3 = _interopRequireDefault(require(\"./standardizeConfig\"));\n\nfunction _createForOfIteratorHelper(o) { if (typeof Symbol === \"undefined\" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (o = _unsupportedIterableToArray(o))) { var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var it, normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\n\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\n\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\n\nvar ServiceProvider = /*#__PURE__*/function () {\n  function ServiceProvider(config) {\n    var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n        _ref$services = _ref.services,\n        services = _ref$services === void 0 ? {} : _ref$services,\n        _ref$defaults = _ref.defaults,\n        defaults = _ref$defaults === void 0 ? {} : _ref$defaults,\n        _ref$disabled = _ref.disabled,\n        disabled = _ref$disabled === void 0 ? {} : _ref$disabled;\n\n    (0, _classCallCheck2[\"default\"])(this, ServiceProvider);\n    this._config = config; // all the service classes that this provider should support\n\n    this._services = services; // the services (as string names) that should be used for each role by\n    // default, or when that role is disabled\n\n    this._resolver = {\n      defaults: defaults,\n      disabled: disabled\n    };\n  }\n  /**\n   * @param {string} serviceName\n   * @returns {boolean}\n   */\n\n\n  (0, _createClass2[\"default\"])(ServiceProvider, [{\n    key: \"supports\",\n    value: function supports(serviceName) {\n      return !!this._services[serviceName];\n    }\n    /**\n     * @param {object} servicesConfig\n     * @returns {Container}\n     */\n\n  }, {\n    key: \"buildContainer\",\n    value: function buildContainer() {\n      var container = new _Container[\"default\"]();\n\n      for (var role in this._config) {\n        var _standardizeConfig = (0, _standardizeConfig3[\"default\"])(role, this._config[role], this._resolver),\n            _standardizeConfig2 = (0, _slicedToArray2[\"default\"])(_standardizeConfig, 2),\n            service = _standardizeConfig2[0],\n            settings = _standardizeConfig2[1];\n\n        var instance = void 0; // each config can contain a service descriptor in one of several forms:\n\n        if ((0, _typeof2[\"default\"])(service) == 'object') {\n          // instance\n          instance = service;\n        } else if (typeof service == 'function') {\n          // constructor\n          instance = new service();\n        } else {\n          // string\n          if (!this.supports(service) && role === 'exchange') {\n            throw new Error('This service has been extracted from dai.js. Please refer to the documentation to add it as a plugin: \\n\\n https://github.com/makerdao/dai.js/wiki/Basic-Usage-(Plugins)');\n          }\n\n          if (!this.supports(service)) {\n            throw new Error('Unsupported service in configuration: ' + service);\n          }\n\n          instance = new this._services[service]();\n        }\n\n        var instanceName = instance.manager().name();\n\n        if (instanceName !== role) {\n          throw new Error(\"Role mismatch: \\\"\".concat(instanceName, \"\\\", \\\"\").concat(role, \"\\\"\"));\n        }\n\n        instance.manager().settings(settings);\n        container.register(instance, role);\n      }\n\n      this._registerDependencies(container);\n\n      container.injectDependencies();\n      this._container = container;\n      return container;\n    }\n  }, {\n    key: \"_registerDependencies\",\n    value: function _registerDependencies(container) {\n      var names = container.getRegisteredServiceNames(); // get the names of all dependencies\n\n      var allDeps = names.reduce(function (acc, name) {\n        var service = container.service(name);\n        var deps = service.manager().dependencies();\n        return (0, _uniq[\"default\"])(acc.concat(deps));\n      }, []); // filter out the ones that are already registered\n\n      var newDeps = allDeps.filter(function (name) {\n        return !names.includes(name);\n      });\n      if (newDeps.length === 0) return; // register any remaining ones\n\n      var _iterator = _createForOfIteratorHelper(newDeps),\n          _step;\n\n      try {\n        for (_iterator.s(); !(_step = _iterator.n()).done;) {\n          var name = _step.value;\n          var ctor = this._resolver.defaults[name];\n          if (typeof ctor === 'string') ctor = this._services[ctor];\n          if (!ctor) throw new Error(\"No service found for \\\"\".concat(name, \"\\\"\"));\n          container.register(new ctor(), name);\n        } // repeat, to find any dependencies for services that were just added\n\n      } catch (err) {\n        _iterator.e(err);\n      } finally {\n        _iterator.f();\n      }\n\n      this._registerDependencies(container);\n    }\n  }, {\n    key: \"service\",\n    value: function service(name) {\n      if (!this._container) this.buildContainer();\n      return this._container.service(name);\n    }\n  }]);\n  return ServiceProvider;\n}();\n\nexports[\"default\"] = ServiceProvider;","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    cacheHas = require('./_cacheHas'),\n    createSet = require('./_createSet'),\n    setToArray = require('./_setToArray');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseUniq;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","var mapCacheClear = require('./_mapCacheClear'),\n    mapCacheDelete = require('./_mapCacheDelete'),\n    mapCacheGet = require('./_mapCacheGet'),\n    mapCacheHas = require('./_mapCacheHas'),\n    mapCacheSet = require('./_mapCacheSet');\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n","var Hash = require('./_Hash'),\n    ListCache = require('./_ListCache'),\n    Map = require('./_Map');\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nmodule.exports = mapCacheClear;\n","var hashClear = require('./_hashClear'),\n    hashDelete = require('./_hashDelete'),\n    hashGet = require('./_hashGet'),\n    hashHas = require('./_hashHas'),\n    hashSet = require('./_hashSet');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n","var nativeCreate = require('./_nativeCreate');\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nmodule.exports = hashClear;\n","var isFunction = require('./isFunction'),\n    isMasked = require('./_isMasked'),\n    isObject = require('./isObject'),\n    toSource = require('./_toSource');\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","var Symbol = require('./_Symbol');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nmodule.exports = getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","var coreJsData = require('./_coreJsData');\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","var root = require('./_root');\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nmodule.exports = toSource;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = hashDelete;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nmodule.exports = hashGet;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nmodule.exports = hashHas;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nmodule.exports = hashSet;\n","var listCacheClear = require('./_listCacheClear'),\n    listCacheDelete = require('./_listCacheDelete'),\n    listCacheGet = require('./_listCacheGet'),\n    listCacheHas = require('./_listCacheHas'),\n    listCacheSet = require('./_listCacheSet');\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nmodule.exports = listCacheClear;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nmodule.exports = listCacheDelete;\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nmodule.exports = listCacheGet;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nmodule.exports = listCacheHas;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nmodule.exports = listCacheSet;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n","var getMapData = require('./_getMapData');\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = mapCacheDelete;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nmodule.exports = isKeyable;\n","var getMapData = require('./_getMapData');\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nmodule.exports = mapCacheGet;\n","var getMapData = require('./_getMapData');\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nmodule.exports = mapCacheHas;\n","var getMapData = require('./_getMapData');\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nmodule.exports = mapCacheSet;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","var Set = require('./_Set'),\n    noop = require('./noop'),\n    setToArray = require('./_setToArray');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nmodule.exports = createSet;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n","/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nmodule.exports = noop;\n","var baseValues = require('./_baseValues'),\n    keys = require('./keys');\n\n/**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\nfunction values(object) {\n  return object == null ? [] : baseValues(object, keys(object));\n}\n\nmodule.exports = values;\n","var arrayMap = require('./_arrayMap');\n\n/**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\nfunction baseValues(object, props) {\n  return arrayMap(props, function(key) {\n    return object[key];\n  });\n}\n\nmodule.exports = baseValues;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeys = require('./_baseKeys'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","var baseTimes = require('./_baseTimes'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isIndex = require('./_isIndex'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","var baseIsArguments = require('./_baseIsArguments'),\n    isObjectLike = require('./isObjectLike');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","var root = require('./_root'),\n    stubFalse = require('./stubFalse');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nmodule.exports = isBuffer;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = stubFalse;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n","var baseIsTypedArray = require('./_baseIsTypedArray'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nmodule.exports = isTypedArray;\n","var baseGetTag = require('./_baseGetTag'),\n    isLength = require('./isLength'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nmodule.exports = baseIsTypedArray;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nmodule.exports = baseUnary;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n","var isPrototype = require('./_isPrototype'),\n    nativeKeys = require('./_nativeKeys');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeys;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nmodule.exports = isPrototype;\n","var overArg = require('./_overArg');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nmodule.exports = nativeKeys;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nmodule.exports = overArg;\n","var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n","\n/**\n * Topological sorting function\n *\n * @param {Array} edges\n * @returns {Array}\n */\n\nmodule.exports = function(edges) {\n  return toposort(uniqueNodes(edges), edges)\n}\n\nmodule.exports.array = toposort\n\nfunction toposort(nodes, edges) {\n  var cursor = nodes.length\n    , sorted = new Array(cursor)\n    , visited = {}\n    , i = cursor\n    // Better data structures make algorithm much faster.\n    , outgoingEdges = makeOutgoingEdges(edges)\n    , nodesHash = makeNodesHash(nodes)\n\n  // check for unknown nodes\n  edges.forEach(function(edge) {\n    if (!nodesHash.has(edge[0]) || !nodesHash.has(edge[1])) {\n      throw new Error('Unknown node. There is an unknown node in the supplied edges.')\n    }\n  })\n\n  while (i--) {\n    if (!visited[i]) visit(nodes[i], i, new Set())\n  }\n\n  return sorted\n\n  function visit(node, i, predecessors) {\n    if(predecessors.has(node)) {\n      var nodeRep\n      try {\n        nodeRep = \", node was:\" + JSON.stringify(node)\n      } catch(e) {\n        nodeRep = \"\"\n      }\n      throw new Error('Cyclic dependency' + nodeRep)\n    }\n\n    if (!nodesHash.has(node)) {\n      throw new Error('Found unknown node. Make sure to provided all involved nodes. Unknown node: '+JSON.stringify(node))\n    }\n\n    if (visited[i]) return;\n    visited[i] = true\n\n    var outgoing = outgoingEdges.get(node) || new Set()\n    outgoing = Array.from(outgoing)\n\n    if (i = outgoing.length) {\n      predecessors.add(node)\n      do {\n        var child = outgoing[--i]\n        visit(child, nodesHash.get(child), predecessors)\n      } while (i)\n      predecessors.delete(node)\n    }\n\n    sorted[--cursor] = node\n  }\n}\n\nfunction uniqueNodes(arr){\n  var res = new Set()\n  for (var i = 0, len = arr.length; i < len; i++) {\n    var edge = arr[i]\n    res.add(edge[0])\n    res.add(edge[1])\n  }\n  return Array.from(res)\n}\n\nfunction makeOutgoingEdges(arr){\n  var edges = new Map()\n  for (var i = 0, len = arr.length; i < len; i++) {\n    var edge = arr[i]\n    if (!edges.has(edge[0])) edges.set(edge[0], new Set())\n    if (!edges.has(edge[1])) edges.set(edge[1], new Set())\n    edges.get(edge[0]).add(edge[1])\n  }\n  return edges\n}\n\nfunction makeNodesHash(arr){\n  var res = new Map()\n  for (var i = 0, len = arr.length; i < len; i++) {\n    res.set(arr[i], i)\n  }\n  return res\n}\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _ServiceType = _interopRequireDefault(require(\"./ServiceType\"));\n\nvar _ServiceBase2 = _interopRequireDefault(require(\"./ServiceBase\"));\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\n/**\n *\n */\nvar LocalService = /*#__PURE__*/function (_ServiceBase) {\n  (0, _inherits2[\"default\"])(LocalService, _ServiceBase);\n\n  var _super = _createSuper(LocalService);\n\n  /**\n   * @param {string} name\n   * @param {string[]} dependencies\n   */\n  function LocalService(name) {\n    var dependencies = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n    (0, _classCallCheck2[\"default\"])(this, LocalService);\n    return _super.call(this, _ServiceType[\"default\"].LOCAL, name, dependencies);\n  }\n\n  return LocalService;\n}(_ServiceBase2[\"default\"]);\n\nvar _default = LocalService;\nexports[\"default\"] = _default;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _ServiceType = _interopRequireDefault(require(\"./ServiceType\"));\n\nvar _ServiceBase2 = _interopRequireDefault(require(\"./ServiceBase\"));\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\n/**\n *\n */\nvar PublicService = /*#__PURE__*/function (_ServiceBase) {\n  (0, _inherits2[\"default\"])(PublicService, _ServiceBase);\n\n  var _super = _createSuper(PublicService);\n\n  /**\n   * @param {string} name\n   * @param {string[]} dependencies\n   */\n  function PublicService(name) {\n    var dependencies = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n    (0, _classCallCheck2[\"default\"])(this, PublicService);\n    return _super.call(this, _ServiceType[\"default\"].PUBLIC, name, dependencies);\n  }\n\n  return PublicService;\n}(_ServiceBase2[\"default\"]);\n\nvar _default = PublicService;\nexports[\"default\"] = _default;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports[\"default\"] = void 0;\n\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\n\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\n\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\n\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\n\nvar _ServiceType = _interopRequireDefault(require(\"./ServiceType\"));\n\nvar _ServiceBase2 = _interopRequireDefault(require(\"./ServiceBase\"));\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function () { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\n/**\n *\n */\nvar PrivateService = /*#__PURE__*/function (_ServiceBase) {\n  (0, _inherits2[\"default\"])(PrivateService, _ServiceBase);\n\n  var _super = _createSuper(PrivateService);\n\n  /**\n   * @param {string} name\n   * @param {string[]} dependencies\n   */\n  function PrivateService(name) {\n    var dependencies = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n    (0, _classCallCheck2[\"default\"])(this, PrivateService);\n    return _super.call(this, _ServiceType[\"default\"].PRIVATE, name, dependencies);\n  }\n\n  return PrivateService;\n}(_ServiceBase2[\"default\"]);\n\nvar _default = PrivateService;\nexports[\"default\"] = _default;","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <http://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nvar base64 = require('base64-js')\nvar ieee754 = require('ieee754')\nvar isArray = require('isarray')\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Use Object implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * Due to various browser bugs, sometimes the Object implementation will be used even\n * when the browser supports typed arrays.\n *\n * Note:\n *\n *   - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,\n *     See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.\n *\n *   - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.\n *\n *   - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of\n *     incorrect length in some situations.\n\n * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they\n * get the Object implementation, which is slower but behaves correctly.\n */\nBuffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined\n  ? global.TYPED_ARRAY_SUPPORT\n  : typedArraySupport()\n\n/*\n * Export kMaxLength after typed array support is determined.\n */\nexports.kMaxLength = kMaxLength()\n\nfunction typedArraySupport () {\n  try {\n    var arr = new Uint8Array(1)\n    arr.__proto__ = {__proto__: Uint8Array.prototype, foo: function () { return 42 }}\n    return arr.foo() === 42 && // typed array instances can be augmented\n        typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`\n        arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray`\n  } catch (e) {\n    return false\n  }\n}\n\nfunction kMaxLength () {\n  return Buffer.TYPED_ARRAY_SUPPORT\n    ? 0x7fffffff\n    : 0x3fffffff\n}\n\nfunction createBuffer (that, length) {\n  if (kMaxLength() < length) {\n    throw new RangeError('Invalid typed array length')\n  }\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    // Return an augmented `Uint8Array` instance, for best performance\n    that = new Uint8Array(length)\n    that.__proto__ = Buffer.prototype\n  } else {\n    // Fallback: Return an object instance of the Buffer class\n    if (that === null) {\n      that = new Buffer(length)\n    }\n    that.length = length\n  }\n\n  return that\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n    return new Buffer(arg, encodingOrOffset, length)\n  }\n\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new Error(\n        'If encoding is specified then the first argument must be a string'\n      )\n    }\n    return allocUnsafe(this, arg)\n  }\n  return from(this, arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\n// TODO: Legacy, not needed anymore. Remove in next major version.\nBuffer._augment = function (arr) {\n  arr.__proto__ = Buffer.prototype\n  return arr\n}\n\nfunction from (that, value, encodingOrOffset, length) {\n  if (typeof value === 'number') {\n    throw new TypeError('\"value\" argument must not be a number')\n  }\n\n  if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {\n    return fromArrayBuffer(that, value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'string') {\n    return fromString(that, value, encodingOrOffset)\n  }\n\n  return fromObject(that, value)\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(null, value, encodingOrOffset, length)\n}\n\nif (Buffer.TYPED_ARRAY_SUPPORT) {\n  Buffer.prototype.__proto__ = Uint8Array.prototype\n  Buffer.__proto__ = Uint8Array\n  if (typeof Symbol !== 'undefined' && Symbol.species &&\n      Buffer[Symbol.species] === Buffer) {\n    // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\n    Object.defineProperty(Buffer, Symbol.species, {\n      value: null,\n      configurable: true\n    })\n  }\n}\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be a number')\n  } else if (size < 0) {\n    throw new RangeError('\"size\" argument must not be negative')\n  }\n}\n\nfunction alloc (that, size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(that, size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpretted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(that, size).fill(fill, encoding)\n      : createBuffer(that, size).fill(fill)\n  }\n  return createBuffer(that, size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(null, size, fill, encoding)\n}\n\nfunction allocUnsafe (that, size) {\n  assertSize(size)\n  that = createBuffer(that, size < 0 ? 0 : checked(size) | 0)\n  if (!Buffer.TYPED_ARRAY_SUPPORT) {\n    for (var i = 0; i < size; ++i) {\n      that[i] = 0\n    }\n  }\n  return that\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(null, size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(null, size)\n}\n\nfunction fromString (that, string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('\"encoding\" must be a valid string encoding')\n  }\n\n  var length = byteLength(string, encoding) | 0\n  that = createBuffer(that, length)\n\n  var actual = that.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    that = that.slice(0, actual)\n  }\n\n  return that\n}\n\nfunction fromArrayLike (that, array) {\n  var length = array.length < 0 ? 0 : checked(array.length) | 0\n  that = createBuffer(that, length)\n  for (var i = 0; i < length; i += 1) {\n    that[i] = array[i] & 255\n  }\n  return that\n}\n\nfunction fromArrayBuffer (that, array, byteOffset, length) {\n  array.byteLength // this throws if `array` is not a valid ArrayBuffer\n\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\\'offset\\' is out of bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\\'length\\' is out of bounds')\n  }\n\n  if (byteOffset === undefined && length === undefined) {\n    array = new Uint8Array(array)\n  } else if (length === undefined) {\n    array = new Uint8Array(array, byteOffset)\n  } else {\n    array = new Uint8Array(array, byteOffset, length)\n  }\n\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    // Return an augmented `Uint8Array` instance, for best performance\n    that = array\n    that.__proto__ = Buffer.prototype\n  } else {\n    // Fallback: Return an object instance of the Buffer class\n    that = fromArrayLike(that, array)\n  }\n  return that\n}\n\nfunction fromObject (that, obj) {\n  if (Buffer.isBuffer(obj)) {\n    var len = checked(obj.length) | 0\n    that = createBuffer(that, len)\n\n    if (that.length === 0) {\n      return that\n    }\n\n    obj.copy(that, 0, 0, len)\n    return that\n  }\n\n  if (obj) {\n    if ((typeof ArrayBuffer !== 'undefined' &&\n        obj.buffer instanceof ArrayBuffer) || 'length' in obj) {\n      if (typeof obj.length !== 'number' || isnan(obj.length)) {\n        return createBuffer(that, 0)\n      }\n      return fromArrayLike(that, obj)\n    }\n\n    if (obj.type === 'Buffer' && isArray(obj.data)) {\n      return fromArrayLike(that, obj.data)\n    }\n  }\n\n  throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < kMaxLength()` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= kMaxLength()) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + kMaxLength().toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return !!(b != null && b._isBuffer)\n}\n\nBuffer.compare = function compare (a, b) {\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError('Arguments must be Buffers')\n  }\n\n  if (a === b) return 0\n\n  var x = a.length\n  var y = b.length\n\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  var i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  var buffer = Buffer.allocUnsafe(length)\n  var pos = 0\n  for (i = 0; i < list.length; ++i) {\n    var buf = list[i]\n    if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    }\n    buf.copy(buffer, pos)\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&\n      (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    string = '' + string\n  }\n\n  var len = string.length\n  if (len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  var loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n      case undefined:\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) return utf8ToBytes(string).length // assume utf8\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  var loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coersion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect\n// Buffer instances.\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  var i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  var len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (var i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  var len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (var i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  var len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (var i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  var length = this.length | 0\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  var str = ''\n  var max = exports.INSPECT_MAX_BYTES\n  if (this.length > 0) {\n    str = this.toString('hex', 0, max).match(/.{2}/g).join(' ')\n    if (this.length > max) str += ' ... '\n  }\n  return '<Buffer ' + str + '>'\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError('Argument must be a Buffer')\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  var x = thisEnd - thisStart\n  var y = end - start\n  var len = Math.min(x, y)\n\n  var thisCopy = this.slice(thisStart, thisEnd)\n  var targetCopy = target.slice(start, end)\n\n  for (var i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset  // Coerce to Number.\n  if (isNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (Buffer.TYPED_ARRAY_SUPPORT &&\n        typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  var indexSize = 1\n  var arrLength = arr.length\n  var valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  var i\n  if (dir) {\n    var foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      var found = true\n      for (var j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  var remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  // must be an even number of digits\n  var strLen = string.length\n  if (strLen % 2 !== 0) throw new TypeError('Invalid hex string')\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  for (var i = 0; i < length; ++i) {\n    var parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (isNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction latin1Write (buf, string, offset, length) {\n  return asciiWrite(buf, string, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset | 0\n    if (isFinite(length)) {\n      length = length | 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  // legacy write(string, encoding, offset, length) - remove in v0.13\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  var remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  var loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n        return asciiWrite(this, string, offset, length)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Write(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  var res = []\n\n  var i = start\n  while (i < end) {\n    var firstByte = buf[i]\n    var codePoint = null\n    var bytesPerSequence = (firstByte > 0xEF) ? 4\n      : (firstByte > 0xDF) ? 3\n      : (firstByte > 0xBF) ? 2\n      : 1\n\n    if (i + bytesPerSequence <= end) {\n      var secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nvar MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  var len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  var res = ''\n  var i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  var ret = ''\n  end = Math.min(buf.length, end)\n\n  for (var i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  var ret = ''\n  end = Math.min(buf.length, end)\n\n  for (var i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  var len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  var out = ''\n  for (var i = start; i < end; ++i) {\n    out += toHex(buf[i])\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  var bytes = buf.slice(start, end)\n  var res = ''\n  for (var i = 0; i < bytes.length; i += 2) {\n    res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256)\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  var len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  var newBuf\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    newBuf = this.subarray(start, end)\n    newBuf.__proto__ = Buffer.prototype\n  } else {\n    var sliceLen = end - start\n    newBuf = new Buffer(sliceLen, undefined)\n    for (var i = 0; i < sliceLen; ++i) {\n      newBuf[i] = this[i + start]\n    }\n  }\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var val = this[offset]\n  var mul = 1\n  var i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  var val = this[offset + --byteLength]\n  var mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var val = this[offset]\n  var mul = 1\n  var i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var i = byteLength\n  var mul = 1\n  var val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  var val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  var val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) {\n    var maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  var mul = 1\n  var i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) {\n    var maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  var i = byteLength - 1\n  var mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nfunction objectWriteUInt16 (buf, value, offset, littleEndian) {\n  if (value < 0) value = 0xffff + value + 1\n  for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) {\n    buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>\n      (littleEndian ? i : 1 - i) * 8\n  }\n}\n\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value & 0xff)\n    this[offset + 1] = (value >>> 8)\n  } else {\n    objectWriteUInt16(this, value, offset, true)\n  }\n  return offset + 2\n}\n\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 8)\n    this[offset + 1] = (value & 0xff)\n  } else {\n    objectWriteUInt16(this, value, offset, false)\n  }\n  return offset + 2\n}\n\nfunction objectWriteUInt32 (buf, value, offset, littleEndian) {\n  if (value < 0) value = 0xffffffff + value + 1\n  for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) {\n    buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff\n  }\n}\n\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset + 3] = (value >>> 24)\n    this[offset + 2] = (value >>> 16)\n    this[offset + 1] = (value >>> 8)\n    this[offset] = (value & 0xff)\n  } else {\n    objectWriteUInt32(this, value, offset, true)\n  }\n  return offset + 4\n}\n\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 24)\n    this[offset + 1] = (value >>> 16)\n    this[offset + 2] = (value >>> 8)\n    this[offset + 3] = (value & 0xff)\n  } else {\n    objectWriteUInt32(this, value, offset, false)\n  }\n  return offset + 4\n}\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) {\n    var limit = Math.pow(2, 8 * byteLength - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  var i = 0\n  var mul = 1\n  var sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) {\n    var limit = Math.pow(2, 8 * byteLength - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  var i = byteLength - 1\n  var mul = 1\n  var sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value & 0xff)\n    this[offset + 1] = (value >>> 8)\n  } else {\n    objectWriteUInt16(this, value, offset, true)\n  }\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 8)\n    this[offset + 1] = (value & 0xff)\n  } else {\n    objectWriteUInt16(this, value, offset, false)\n  }\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value & 0xff)\n    this[offset + 1] = (value >>> 8)\n    this[offset + 2] = (value >>> 16)\n    this[offset + 3] = (value >>> 24)\n  } else {\n    objectWriteUInt32(this, value, offset, true)\n  }\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 24)\n    this[offset + 1] = (value >>> 16)\n    this[offset + 2] = (value >>> 8)\n    this[offset + 3] = (value & 0xff)\n  } else {\n    objectWriteUInt32(this, value, offset, false)\n  }\n  return offset + 4\n}\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  var len = end - start\n  var i\n\n  if (this === target && start < targetStart && targetStart < end) {\n    // descending copy from end\n    for (i = len - 1; i >= 0; --i) {\n      target[i + targetStart] = this[i + start]\n    }\n  } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {\n    // ascending copy from start\n    for (i = 0; i < len; ++i) {\n      target[i + targetStart] = this[i + start]\n    }\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, start + len),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (val.length === 1) {\n      var code = val.charCodeAt(0)\n      if (code < 256) {\n        val = code\n      }\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  var i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    var bytes = Buffer.isBuffer(val)\n      ? val\n      : utf8ToBytes(new Buffer(val, encoding).toString())\n    var len = bytes.length\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// HELPER FUNCTIONS\n// ================\n\nvar INVALID_BASE64_RE = /[^+\\/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = stringtrim(str).replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction stringtrim (str) {\n  if (str.trim) return str.trim()\n  return str.replace(/^\\s+|\\s+$/g, '')\n}\n\nfunction toHex (n) {\n  if (n < 16) return '0' + n.toString(16)\n  return n.toString(16)\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  var codePoint\n  var length = string.length\n  var leadSurrogate = null\n  var bytes = []\n\n  for (var i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  var byteArray = []\n  for (var i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  var c, hi, lo\n  var byteArray = []\n  for (var i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  for (var i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\nfunction isnan (val) {\n  return val !== val // eslint-disable-line no-self-compare\n}\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(\n      uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)\n    ))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n","exports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n  return toString.call(arr) == '[object Array]';\n};\n","var arrayLikeToArray = require(\"./arrayLikeToArray\");\n\nfunction _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) return arrayLikeToArray(arr);\n}\n\nmodule.exports = _arrayWithoutHoles;","function _iterableToArray(iter) {\n  if (typeof Symbol !== \"undefined\" && Symbol.iterator in Object(iter)) return Array.from(iter);\n}\n\nmodule.exports = _iterableToArray;","function _nonIterableSpread() {\n  throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nmodule.exports = _nonIterableSpread;","import { LocalService } from '@makerdao/services-core';\nimport VoteProxy from './VoteProxy';\nimport { MKR, VOTE_PROXY_FACTORY, ZERO_ADDRESS } from './utils/constants';\n// maybe a \"dai.js developer utils\" package is useful?\nimport { getCurrency } from './utils/helpers';\nimport voteProxyAbi from '../contracts/abis/VoteProxy.json';\n\nexport default class VoteProxyService extends LocalService {\n  constructor(name = 'voteProxy') {\n    super(name, ['smartContract', 'chief']);\n  }\n\n  // Writes -----------------------------------------------\n\n  lock(proxyAddress, amt, unit = MKR) {\n    const mkrAmt = getCurrency(amt, unit).toFixed('wei');\n    return this._proxyContract(proxyAddress).lock(mkrAmt);\n  }\n\n  free(proxyAddress, amt, unit = MKR) {\n    const mkrAmt = getCurrency(amt, unit).toFixed('wei');\n    return this._proxyContract(proxyAddress).free(mkrAmt);\n  }\n\n  freeAll(proxyAddress) {\n    return this._proxyContract(proxyAddress).freeAll();\n  }\n\n  voteExec(proxyAddress, picks) {\n    if (Array.isArray(picks))\n      return this._proxyContract(proxyAddress)['vote(address[])'](picks);\n    return this._proxyContract(proxyAddress)['vote(bytes32)'](picks);\n  }\n\n  // Reads ------------------------------------------------\n\n  async getVotedProposalAddresses(proxyAddress) {\n    const _slate = await this.get('chief').getVotedSlate(proxyAddress);\n    return this.get('chief').getSlateAddresses(_slate);\n  }\n\n  async getVoteProxy(addressToCheck) {\n    const {\n      hasProxy,\n      role,\n      address: proxyAddress\n    } = await this._getProxyStatus(addressToCheck);\n    if (!hasProxy) return { hasProxy, voteProxy: null };\n    const otherRole = role === 'hot' ? 'cold' : 'hot';\n    const otherAddress = await this._getAddressOfRole(proxyAddress, otherRole);\n    return {\n      hasProxy,\n      voteProxy: new VoteProxy({\n        voteProxyService: this,\n        proxyAddress,\n        [`${role}Address`]: addressToCheck,\n        [`${otherRole}Address`]: otherAddress\n      })\n    };\n  }\n\n  // Internal --------------------------------------------\n\n  _proxyContract(address) {\n    return this.get('smartContract').getContractByAddressAndAbi(\n      address,\n      voteProxyAbi\n    );\n  }\n\n  _proxyFactoryContract() {\n    return this.get('smartContract').getContractByName(VOTE_PROXY_FACTORY);\n  }\n\n  async _getProxyStatus(address) {\n    const [proxyAddressCold, proxyAddressHot] = await Promise.all([\n      this._proxyFactoryContract().coldMap(address),\n      this._proxyFactoryContract().hotMap(address)\n    ]);\n    if (proxyAddressCold !== ZERO_ADDRESS)\n      return { role: 'cold', address: proxyAddressCold, hasProxy: true };\n    if (proxyAddressHot !== ZERO_ADDRESS)\n      return { role: 'hot', address: proxyAddressHot, hasProxy: true };\n    return { role: null, address: '', hasProxy: false };\n  }\n\n  _getAddressOfRole(proxyAddress, role) {\n    if (role === 'hot') return this._proxyContract(proxyAddress).hot();\n    else if (role === 'cold') return this._proxyContract(proxyAddress).cold();\n    return null;\n  }\n}\n\n// add a few Chief Service methods to the Vote Proxy Service\nObject.assign(\n  VoteProxyService.prototype,\n  ['getVotedSlate', 'getNumDeposits'].reduce((acc, name) => {\n    acc[name] = function(...args) {\n      return this.get('chief')[name](...args);\n    };\n    return acc;\n  }, {})\n);\n","export default class VoteProxy {\n  constructor({ voteProxyService, proxyAddress, coldAddress, hotAddress }) {\n    this._voteProxyService = voteProxyService;\n    this._proxyAddress = proxyAddress;\n    this._coldAddress = coldAddress;\n    this._hotAddress = hotAddress;\n  }\n\n  getProxyAddress() {\n    return this._proxyAddress;\n  }\n\n  getColdAddress() {\n    return this._coldAddress;\n  }\n\n  getHotAddress() {\n    return this._hotAddress;\n  }\n}\n\nconst passthroughMethods = [\n  'lock',\n  'free',\n  'voteExec',\n  'getNumDeposits',\n  'getVotedProposalAddresses'\n];\n\nObject.assign(\n  VoteProxy.prototype,\n  passthroughMethods.reduce((acc, name) => {\n    acc[name] = function(...args) {\n      return this._voteProxyService[name](this._proxyAddress, ...args);\n    };\n    return acc;\n  }, {})\n);\n","import { LocalService } from '@makerdao/services-core';\nimport { VOTE_PROXY_FACTORY } from './utils/constants';\nimport ApproveLinkTransaction from './ApproveLinkTransaction';\n\nexport default class VoteProxyFactoryService extends LocalService {\n  constructor(name = 'voteProxyFactory') {\n    super(name, ['smartContract', 'voteProxy', 'transactionManager']);\n  }\n\n  initiateLink(hotAddress) {\n    return this._proxyFactoryContract().initiateLink(hotAddress);\n  }\n\n  approveLink(coldAddress) {\n    const tx = new ApproveLinkTransaction(\n      this._proxyFactoryContract(),\n      this.get('transactionManager')\n    );\n    return tx.build('approveLink', [coldAddress]);\n  }\n\n  breakLink() {\n    return this._proxyFactoryContract().breakLink();\n  }\n\n  getVoteProxy(address) {\n    return this.get('voteProxy').getVoteProxy(address);\n  }\n\n  _proxyFactoryContract() {\n    return this.get('smartContract').getContractByName(VOTE_PROXY_FACTORY);\n  }\n}\n","export default class ApproveLinkTransaction {\n  constructor(contract, transactionManager) {\n    this._contract = contract;\n    this._txMgr = transactionManager;\n  }\n\n  get fees() {\n    return this._txMgr.getTransaction(this.promise).fees();\n  }\n\n  get timeStamp() {\n    return this._txMgr.getTransaction(this.promise).timeStamp();\n  }\n\n  get timeStampSubmitted() {\n    return this._txMgr.getTransaction(this.promise).timeStampSubmitted();\n  }\n\n  build(method, args) {\n    const promise = (async () => {\n      await 0;\n      const txo = await this._contract[method](...[...args, { promise }]);\n      this._parseLogs(txo.receipt.logs);\n      return this;\n    })();\n    this.promise = promise;\n    return promise;\n  }\n\n  _parseLogs(logs) {\n    const { LinkConfirmed } = this._contract.interface.events;\n    const web3 = this._txMgr.get('web3')._web3;\n    const topic = web3.utils.keccak256(\n      web3.utils.toHex(LinkConfirmed.signature)\n    );\n    const receiptEvent = logs.filter(\n      e => e.topics[0].toLowerCase() === topic.toLowerCase() //filter for LinkConfirmed events\n    );\n    const parsedLog = LinkConfirmed.parse(\n      receiptEvent[0].topics,\n      receiptEvent[0].data\n    );\n    this.proxyAddress = parsedLog['voteProxy'];\n  }\n}\n","import { PrivateService } from '@makerdao/services-core';\nimport { POLLING, BATCH_POLLING } from './utils/constants';\nimport { MKR } from './utils/constants';\nimport BigNumber from 'bignumber.js';\nimport { fromBuffer, toBuffer, paddedArray } from './utils/helpers';\n\nconst POSTGRES_MAX_INT = 2147483647;\n\nconst MAX_ROUNDS = 32;\n\nexport default class GovPollingService extends PrivateService {\n  constructor(name = 'govPolling') {\n    super(name, ['smartContract', 'govQueryApi', 'token']);\n  }\n\n  async createPoll(startDate, endDate, multiHash, url) {\n    const txo = await this._pollingContract().createPoll(\n      startDate,\n      endDate,\n      multiHash,\n      url\n    );\n    const pollId = parseInt(txo.receipt.logs[0].topics[2]);\n    return pollId;\n  }\n\n  withdrawPoll(pollId) {\n    return this._pollingContract().withdrawPoll(pollId);\n  }\n\n  vote(pollIds, optionIds) {\n    if (pollIds.length !== optionIds.length || pollIds.length === 0)\n      throw new Error(\n        'poll id array and option id array must be the same length and have a non-zero number of elements'\n      );\n    if (pollIds.length === 1) {\n      const func = 'vote(uint256,uint256)';\n      return this._batchPollingContract()[func](pollIds[0], optionIds[0]);\n    } else {\n      const func = 'vote(uint256[],uint256[])';\n      return this._batchPollingContract()[func](pollIds, optionIds);\n    }\n  }\n\n  voteRankedChoice(pollId, rankings) {\n    const byteArray = new Uint8Array(32);\n    rankings.forEach((optionIndex, i) => {\n      byteArray[byteArray.length - i - 1] = optionIndex + 1;\n    });\n    const optionId = fromBuffer(byteArray).toString();\n    return this._batchPollingContract().vote(pollId, optionId);\n  }\n\n  _pollingContract() {\n    return this.get('smartContract').getContractByName(POLLING);\n  }\n\n  _batchPollingContract() {\n    return this.get('smartContract').getContractByName(BATCH_POLLING);\n  }\n\n  //--- cache queries\n\n  async getPoll(multiHash) {\n    const polls = await this.getAllWhitelistedPolls();\n    const filtered = polls.filter(p => p.multiHash === multiHash);\n    let lowest = Infinity;\n    let lowestPoll;\n    for (let i = 0; i < filtered.length; i++) {\n      if (filtered[i].pollId < lowest) {\n        lowest = filtered[i].pollId;\n        lowestPoll = filtered[i];\n      }\n    }\n    return lowestPoll;\n  }\n\n  async _getPoll(pollId) {\n    const polls = await this.getAllWhitelistedPolls();\n    return polls.find(p => parseInt(p.pollId) === parseInt(pollId));\n  }\n\n  async getAllWhitelistedPolls() {\n    if (this.polls) return this.polls;\n    this.polls = await this.get('govQueryApi').getAllWhitelistedPolls();\n    return this.polls;\n  }\n\n  refresh() {\n    this.polls = null;\n  }\n\n  async getOptionVotingFor(address, pollId) {\n    return this.get('govQueryApi').getOptionVotingFor(\n      address.toLowerCase(),\n      pollId\n    );\n  }\n\n  async getOptionVotingForRankedChoice(address, pollId) {\n    const optionIdRaw = await this.get(\n      'govQueryApi'\n    ).getOptionVotingForRankedChoice(address.toLowerCase(), pollId);\n    if (!optionIdRaw) return [];\n    const ballotBuffer = toBuffer(optionIdRaw, { endian: 'little' });\n    const ballot = paddedArray(32 - ballotBuffer.length, ballotBuffer);\n    return ballot.reverse().filter(choice => choice !== 0 && choice !== '0');\n  }\n\n  async getAllOptionsVotingFor(address) {\n    const options = await this.get('govQueryApi').getAllOptionsVotingFor(\n      address.toLowerCase()\n    );\n    if (!options) return [];\n    return options.map(o => {\n      let rankedChoiceOption = null;\n      if (o.optionIdRaw) {\n        const ballotBuffer = toBuffer(o.optionIdRaw, { endian: 'little' });\n        const ballot = paddedArray(32 - ballotBuffer.length, ballotBuffer);\n        rankedChoiceOption = ballot\n          .reverse()\n          .filter(choice => choice !== 0 && choice !== '0');\n      }\n      return {\n        pollId: o.pollId,\n        option: o.optionId,\n        rankedChoiceOption\n      };\n    });\n  }\n\n  async getNumUniqueVoters(pollId) {\n    return this.get('govQueryApi').getNumUniqueVoters(pollId);\n  }\n\n  async getMkrWeight(address) {\n    const weight = await this.get('govQueryApi').getMkrWeight(\n      address.toLowerCase(),\n      POSTGRES_MAX_INT\n    );\n    return MKR(weight);\n  }\n\n  async getMkrAmtVoted(pollId) {\n    const { endDate } = await this._getPoll(pollId);\n    const endUnix = Math.floor(endDate / 1000);\n    const weights = await this.get('govQueryApi').getMkrSupport(\n      pollId,\n      endUnix\n    );\n    return MKR(weights.reduce((acc, cur) => acc + cur.mkrSupport, 0));\n  }\n\n  async getMkrAmtVotedRankedChoice(pollId) {\n    const { endDate } = await this._getPoll(pollId);\n    const endUnix = Math.floor(endDate / 1000);\n    const weights = await this.get('govQueryApi').getMkrSupportRankedChoice(\n      pollId,\n      endUnix\n    );\n    return MKR(\n      weights.reduce((acc, cur) => acc + parseFloat(cur.mkrSupport), 0)\n    );\n  }\n\n  async getTallyRankedChoiceIrv(pollId) {\n    const { endDate } = await this._getPoll(pollId);\n    const endUnix = Math.floor(endDate / 1000);\n    const votes = await this.get('govQueryApi').getMkrSupportRankedChoice(\n      pollId,\n      endUnix\n    );\n    const totalMkrParticipation = votes.reduce(\n      (acc, cur) => BigNumber(cur.mkrSupport || 0).plus(acc),\n      BigNumber(0)\n    );\n\n    const tally = {\n      rounds: 1,\n      winner: null,\n      totalMkrParticipation,\n      options: {}\n    };\n    const defaultOptionObj = {\n      firstChoice: BigNumber(0),\n      transfer: BigNumber(0),\n      winner: false,\n      eliminated: false\n    };\n\n    if (votes.length === 0) {\n      return tally;\n    }\n\n    // run the first round\n    votes.forEach(vote => {\n      vote.choice = vote.ballot.pop();\n      if (!tally.options[vote.choice])\n        tally.options[vote.choice] = { ...defaultOptionObj };\n\n      tally.options[vote.choice].firstChoice = BigNumber(\n        tally.options[vote.choice].firstChoice\n      ).plus(vote.mkrSupport || 0);\n    });\n\n    // does any candidate have the majority after the first round?\n    Object.entries(tally.options).forEach(([option, { firstChoice }]) => {\n      if (firstChoice.gt(totalMkrParticipation.div(2))) tally.winner = option;\n    });\n\n    // if so, we're done. Return the winner\n    if (tally.winner) {\n      tally.options[tally.winner].winner = true;\n      return tally;\n    }\n\n    // if we couldn't find a winner based on first preferences, run additionaly irv rounds until we find one\n    while (!tally.winner) {\n      tally.rounds++;\n\n      // eliminate the weakest candidate\n      const filteredOptions = Object.entries(tally.options).filter(\n        ([, optionDetails]) => !optionDetails.eliminated\n      );\n\n      const [optionToEliminate] = filteredOptions.reduce((prv, cur) => {\n        const [, prvVotes] = prv;\n        const [, curVotes] = cur;\n        if (\n          curVotes.firstChoice\n            .plus(curVotes.transfer)\n            .lt(prvVotes.firstChoice.plus(prvVotes.transfer))\n        )\n          return cur;\n        return prv;\n      });\n\n      tally.options[optionToEliminate].eliminated = true;\n      tally.options[optionToEliminate].transfer = BigNumber(0);\n\n      // a vote needs to be moved if...\n      // 1) it's currently for the eliminated candidate\n      // 2) there's another choice further down in the voter's preference list\n      const votesToBeMoved = votes\n        .map((vote, index) => ({ ...vote, index }))\n        .filter(vote => parseInt(vote.choice) === parseInt(optionToEliminate))\n        .filter(vote => vote.ballot[vote.ballot.length - 1] !== 0);\n\n      // move votes to the next choice on their preference list\n      votesToBeMoved.forEach(vote => {\n        votes[vote.index].choice = votes[vote.index].ballot.pop();\n        tally.options[votes[vote.index].choice].transfer = BigNumber(\n          tally.options[votes[vote.index].choice].transfer\n        ).plus(vote.mkrSupport || 0);\n      });\n\n      // look for a candidate with the majority\n      Object.entries(tally.options).forEach(\n        ([option, { firstChoice, transfer }]) => {\n          if (firstChoice.plus(transfer).gt(totalMkrParticipation.div(2)))\n            tally.winner = option;\n        }\n      );\n\n      //if there's no more rounds, or if there is one or fewer options that haven't been eliminated\n      // the winner is the option with the most votes\n      if (\n        (tally.rounds > MAX_ROUNDS && !tally.winner) ||\n        ((filteredOptions.length === 1 || filteredOptions.length === 0) &&\n          !tally.winner)\n      ) {\n        let max = BigNumber(0);\n        let maxOption;\n        Object.entries(tally.options).forEach(\n          ([option, { firstChoice, transfer }]) => {\n            if (firstChoice.plus(transfer).gt(max)) {\n              max = firstChoice.plus(transfer);\n              maxOption = option;\n            }\n          }\n        );\n        tally.winner = maxOption;\n      }\n\n      // sanity checks\n      if (Object.keys(tally.options).length === 2) {\n        // dead tie. this seems super unlikely, but it should be here for completeness\n        // return the tally without declaring a winner\n        return tally;\n      }\n      if (Object.keys(tally.options).length === 1) {\n        // this shouldn't happen\n        throw new Error(`Invalid ranked choice tally ${tally.options}`);\n      }\n\n      // if we couldn't find one, go for another round\n    }\n\n    tally.options[tally.winner].winner = true;\n    return tally;\n  }\n\n  async getPercentageMkrVoted(pollId) {\n    const [voted, total] = await Promise.all([\n      this.getMkrAmtVoted(pollId),\n      this.get('token')\n        .getToken(MKR)\n        .totalSupply()\n    ]);\n    return voted\n      .div(total)\n      .times(100)\n      .toNumber();\n  }\n\n  async getPercentageMkrVotedRankedChoice(pollId) {\n    const [voted, total] = await Promise.all([\n      this.getMkrAmtVotedRankedChoice(pollId),\n      this.get('token')\n        .getToken(MKR)\n        .totalSupply()\n    ]);\n    return voted\n      .div(total)\n      .times(100)\n      .toNumber();\n  }\n\n  async getWinningProposal(pollId) {\n    const { endDate } = await this._getPoll(pollId);\n    const endUnix = Math.floor(endDate / 1000);\n    const currentVotes = await this.get('govQueryApi').getMkrSupport(\n      pollId,\n      endUnix\n    );\n    let max = currentVotes[0];\n    for (let i = 1; i < currentVotes.length; i++) {\n      if (currentVotes[i].mkrSupport > max.mkrSupport) {\n        max = currentVotes[i];\n      }\n    }\n    return max ? max.optionId : 0;\n  }\n}\n","import { PublicService } from '@makerdao/services-core';\nimport assert from 'assert';\nimport {\n  netIdtoSpockUrl,\n  netIdtoSpockUrlStaging,\n  toBuffer,\n  paddedArray\n} from './utils/helpers';\n\nexport default class QueryApi extends PublicService {\n  constructor(name = 'govQueryApi') {\n    super(name, ['web3']);\n    this.queryPromises = {};\n    this.staging = false;\n  }\n\n  async getQueryResponse(serverUrl, query) {\n    const resp = await fetch(serverUrl, {\n      method: 'POST',\n      headers: {\n        Accept: 'application/json',\n        'Content-Type': 'application/json'\n      },\n      body: JSON.stringify({\n        query\n      })\n    });\n    const { data } = await resp.json();\n    assert(data, `error fetching data from ${serverUrl}`);\n    return data;\n  }\n\n  async getQueryResponseMemoized(serverUrl, query) {\n    let cacheKey = `${serverUrl};${query}`;\n    if (this.queryPromises[cacheKey]) return this.queryPromises[cacheKey];\n    this.queryPromises[cacheKey] = this.getQueryResponse(serverUrl, query);\n    return this.queryPromises[cacheKey];\n  }\n\n  initialize(settings) {\n    if (settings.staging) {\n      this.staging = true;\n    }\n  }\n\n  connect() {\n    const network = this.get('web3').network;\n    this.serverUrl = this.staging\n      ? netIdtoSpockUrlStaging(network)\n      : netIdtoSpockUrl(network);\n  }\n\n  async getAllWhitelistedPolls() {\n    const query = `{activePolls {\n      nodes {\n          creator\n          pollId\n          blockCreated\n          startDate\n          endDate\n          multiHash\n          url\n        }\n      }\n    }`;\n\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    return response.activePolls.nodes.map(p => {\n      p.startDate = new Date(p.startDate * 1000);\n      p.endDate = new Date(p.endDate * 1000);\n      return p;\n    });\n  }\n\n  async getNumUniqueVoters(pollId) {\n    const query = `{uniqueVoters(argPollId:${pollId}){\n      nodes\n    }\n    }`;\n\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    return parseInt(response.uniqueVoters.nodes[0]);\n  }\n\n  async getMkrWeight(address, unixTime) {\n    const query = `{totalMkrWeightProxyAndNoProxyByAddressAtTime(argAddress: \"${address}\", argUnix: ${unixTime}){\n      nodes {\n        address\n        weight\n      }\n    }\n    }`;\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    if (!response.totalMkrWeightProxyAndNoProxyByAddressAtTime.nodes[0])\n      return 0;\n    return response.totalMkrWeightProxyAndNoProxyByAddressAtTime.nodes[0]\n      .weight;\n  }\n\n  async getOptionVotingFor(address, pollId) {\n    const query = `{\n      currentVote(argAddress: \"${address}\", argPollId: ${pollId}){\n        nodes{\n          optionId\n        }\n      }\n    }`;\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    if (!response.currentVote.nodes[0]) return null;\n    return response.currentVote.nodes[0].optionId;\n  }\n\n  async getAllOptionsVotingFor(address) {\n    const query = `{\n      allCurrentVotes(argAddress: \"${address}\"){\n        nodes{\n          pollId\n          optionId\n          optionIdRaw\n        }\n      }\n    }`;\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    if (!response.allCurrentVotes.nodes[0]) return null;\n    return response.allCurrentVotes.nodes;\n  }\n\n  async getOptionVotingForRankedChoice(address, pollId) {\n    const query = `{\n      currentVoteRankedChoice(argAddress: \"${address}\", argPollId: ${pollId}){\n        nodes{\n          optionIdRaw\n        }\n      }\n    }`;\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    if (!response.currentVoteRankedChoice.nodes[0]) return null;\n    return response.currentVoteRankedChoice.nodes[0].optionIdRaw;\n  }\n\n  async getBlockNumber(unixTime) {\n    const query = `{\n      timeToBlockNumber(argUnix: ${unixTime}){\n      nodes\n    }\n    }`;\n    const response = await this.getQueryResponseMemoized(this.serverUrl, query);\n    return response.timeToBlockNumber.nodes[0];\n  }\n\n  async getMkrSupportRankedChoice(pollId, unixTime) {\n    const query = `{voteMkrWeightsAtTimeRankedChoice(argPollId: ${pollId}, argUnix: ${unixTime}){\n      nodes{\n        optionIdRaw\n        mkrSupport\n      }\n    }\n    }`;\n    const response = await this.getQueryResponseMemoized(this.serverUrl, query);\n\n    return response.voteMkrWeightsAtTimeRankedChoice.nodes\n      .filter(vote => vote.optionIdRaw !== '0')\n      .map(vote => {\n        const ballotBuffer = toBuffer(vote.optionIdRaw, { endian: 'little' });\n        const ballot = paddedArray(32 - ballotBuffer.length, ballotBuffer);\n        return {\n          ...vote,\n          ballot\n        };\n      });\n  }\n\n  async getMkrSupport(pollId, unixTime) {\n    const query = `{voteOptionMkrWeightsAtTime(argPollId: ${pollId}, argUnix: ${unixTime}){\n    nodes{\n      optionId\n      mkrSupport\n    }\n  }\n  }`;\n    const response = await this.getQueryResponseMemoized(this.serverUrl, query);\n    let weights = response.voteOptionMkrWeightsAtTime.nodes;\n    // We don't want to calculate votes for 0:abstain\n    weights = weights.filter(o => o.optionId !== 0);\n    const totalWeight = weights.reduce((acc, cur) => {\n      const mkrSupport = isNaN(parseFloat(cur.mkrSupport))\n        ? 0\n        : parseFloat(cur.mkrSupport);\n      return acc + mkrSupport;\n    }, 0);\n    return weights.map(o => {\n      const mkrSupport = isNaN(parseFloat(o.mkrSupport))\n        ? 0\n        : parseFloat(o.mkrSupport);\n      o.mkrSupport = mkrSupport;\n      o.percentage = (100 * mkrSupport) / totalWeight;\n      return o;\n    });\n  }\n\n  async getEsmJoins() {\n    const query = `{allEsmJoins {\n      nodes {\n        txFrom\n        txHash\n        joinAmount\n        blockTimestamp\n      }\n  }\n  }`;\n    const response = await this.getQueryResponse(this.serverUrl, query);\n    const joins = response.allEsmJoins.nodes;\n    return joins;\n  }\n}\n","/*\nobject-assign\n(c) Sindre Sorhus\n@license MIT\n*/\n\n'use strict';\n/* eslint-disable no-unused-vars */\nvar getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nvar propIsEnumerable = Object.prototype.propertyIsEnumerable;\n\nfunction toObject(val) {\n\tif (val === null || val === undefined) {\n\t\tthrow new TypeError('Object.assign cannot be called with null or undefined');\n\t}\n\n\treturn Object(val);\n}\n\nfunction shouldUseNative() {\n\ttry {\n\t\tif (!Object.assign) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Detect buggy property enumeration order in older V8 versions.\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=4118\n\t\tvar test1 = new String('abc');  // eslint-disable-line no-new-wrappers\n\t\ttest1[5] = 'de';\n\t\tif (Object.getOwnPropertyNames(test1)[0] === '5') {\n\t\t\treturn false;\n\t\t}\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\t\tvar test2 = {};\n\t\tfor (var i = 0; i < 10; i++) {\n\t\t\ttest2['_' + String.fromCharCode(i)] = i;\n\t\t}\n\t\tvar order2 = Object.getOwnPropertyNames(test2).map(function (n) {\n\t\t\treturn test2[n];\n\t\t});\n\t\tif (order2.join('') !== '0123456789') {\n\t\t\treturn false;\n\t\t}\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\t\tvar test3 = {};\n\t\t'abcdefghijklmnopqrst'.split('').forEach(function (letter) {\n\t\t\ttest3[letter] = letter;\n\t\t});\n\t\tif (Object.keys(Object.assign({}, test3)).join('') !==\n\t\t\t\t'abcdefghijklmnopqrst') {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t} catch (err) {\n\t\t// We don't expect any of the above to throw, but better to be safe.\n\t\treturn false;\n\t}\n}\n\nmodule.exports = shouldUseNative() ? Object.assign : function (target, source) {\n\tvar from;\n\tvar to = toObject(target);\n\tvar symbols;\n\n\tfor (var s = 1; s < arguments.length; s++) {\n\t\tfrom = Object(arguments[s]);\n\n\t\tfor (var key in from) {\n\t\t\tif (hasOwnProperty.call(from, key)) {\n\t\t\t\tto[key] = from[key];\n\t\t\t}\n\t\t}\n\n\t\tif (getOwnPropertySymbols) {\n\t\t\tsymbols = getOwnPropertySymbols(from);\n\t\t\tfor (var i = 0; i < symbols.length; i++) {\n\t\t\t\tif (propIsEnumerable.call(from, symbols[i])) {\n\t\t\t\t\tto[symbols[i]] = from[symbols[i]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn to;\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar getOwnPropertyDescriptors = Object.getOwnPropertyDescriptors ||\n  function getOwnPropertyDescriptors(obj) {\n    var keys = Object.keys(obj);\n    var descriptors = {};\n    for (var i = 0; i < keys.length; i++) {\n      descriptors[keys[i]] = Object.getOwnPropertyDescriptor(obj, keys[i]);\n    }\n    return descriptors;\n  };\n\nvar formatRegExp = /%[sdj%]/g;\nexports.format = function(f) {\n  if (!isString(f)) {\n    var objects = [];\n    for (var i = 0; i < arguments.length; i++) {\n      objects.push(inspect(arguments[i]));\n    }\n    return objects.join(' ');\n  }\n\n  var i = 1;\n  var args = arguments;\n  var len = args.length;\n  var str = String(f).replace(formatRegExp, function(x) {\n    if (x === '%%') return '%';\n    if (i >= len) return x;\n    switch (x) {\n      case '%s': return String(args[i++]);\n      case '%d': return Number(args[i++]);\n      case '%j':\n        try {\n          return JSON.stringify(args[i++]);\n        } catch (_) {\n          return '[Circular]';\n        }\n      default:\n        return x;\n    }\n  });\n  for (var x = args[i]; i < len; x = args[++i]) {\n    if (isNull(x) || !isObject(x)) {\n      str += ' ' + x;\n    } else {\n      str += ' ' + inspect(x);\n    }\n  }\n  return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexports.deprecate = function(fn, msg) {\n  if (typeof process !== 'undefined' && process.noDeprecation === true) {\n    return fn;\n  }\n\n  // Allow for deprecating things in the process of starting up.\n  if (typeof process === 'undefined') {\n    return function() {\n      return exports.deprecate(fn, msg).apply(this, arguments);\n    };\n  }\n\n  var warned = false;\n  function deprecated() {\n    if (!warned) {\n      if (process.throwDeprecation) {\n        throw new Error(msg);\n      } else if (process.traceDeprecation) {\n        console.trace(msg);\n      } else {\n        console.error(msg);\n      }\n      warned = true;\n    }\n    return fn.apply(this, arguments);\n  }\n\n  return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnviron;\nexports.debuglog = function(set) {\n  if (isUndefined(debugEnviron))\n    debugEnviron = process.env.NODE_DEBUG || '';\n  set = set.toUpperCase();\n  if (!debugs[set]) {\n    if (new RegExp('\\\\b' + set + '\\\\b', 'i').test(debugEnviron)) {\n      var pid = process.pid;\n      debugs[set] = function() {\n        var msg = exports.format.apply(exports, arguments);\n        console.error('%s %d: %s', set, pid, msg);\n      };\n    } else {\n      debugs[set] = function() {};\n    }\n  }\n  return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect(obj, opts) {\n  // default options\n  var ctx = {\n    seen: [],\n    stylize: stylizeNoColor\n  };\n  // legacy...\n  if (arguments.length >= 3) ctx.depth = arguments[2];\n  if (arguments.length >= 4) ctx.colors = arguments[3];\n  if (isBoolean(opts)) {\n    // legacy...\n    ctx.showHidden = opts;\n  } else if (opts) {\n    // got an \"options\" object\n    exports._extend(ctx, opts);\n  }\n  // set default options\n  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n  if (isUndefined(ctx.depth)) ctx.depth = 2;\n  if (isUndefined(ctx.colors)) ctx.colors = false;\n  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n  if (ctx.colors) ctx.stylize = stylizeWithColor;\n  return formatValue(ctx, obj, ctx.depth);\n}\nexports.inspect = inspect;\n\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n  'bold' : [1, 22],\n  'italic' : [3, 23],\n  'underline' : [4, 24],\n  'inverse' : [7, 27],\n  'white' : [37, 39],\n  'grey' : [90, 39],\n  'black' : [30, 39],\n  'blue' : [34, 39],\n  'cyan' : [36, 39],\n  'green' : [32, 39],\n  'magenta' : [35, 39],\n  'red' : [31, 39],\n  'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n  'special': 'cyan',\n  'number': 'yellow',\n  'boolean': 'yellow',\n  'undefined': 'grey',\n  'null': 'bold',\n  'string': 'green',\n  'date': 'magenta',\n  // \"name\": intentionally not styling\n  'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n  var style = inspect.styles[styleType];\n\n  if (style) {\n    return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n           '\\u001b[' + inspect.colors[style][1] + 'm';\n  } else {\n    return str;\n  }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n  return str;\n}\n\n\nfunction arrayToHash(array) {\n  var hash = {};\n\n  array.forEach(function(val, idx) {\n    hash[val] = true;\n  });\n\n  return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n  // Provide a hook for user-specified inspect functions.\n  // Check that value is an object with an inspect function on it\n  if (ctx.customInspect &&\n      value &&\n      isFunction(value.inspect) &&\n      // Filter out the util module, it's inspect function is special\n      value.inspect !== exports.inspect &&\n      // Also filter out any prototype objects using the circular check.\n      !(value.constructor && value.constructor.prototype === value)) {\n    var ret = value.inspect(recurseTimes, ctx);\n    if (!isString(ret)) {\n      ret = formatValue(ctx, ret, recurseTimes);\n    }\n    return ret;\n  }\n\n  // Primitive types cannot have properties\n  var primitive = formatPrimitive(ctx, value);\n  if (primitive) {\n    return primitive;\n  }\n\n  // Look up the keys of the object.\n  var keys = Object.keys(value);\n  var visibleKeys = arrayToHash(keys);\n\n  if (ctx.showHidden) {\n    keys = Object.getOwnPropertyNames(value);\n  }\n\n  // IE doesn't make error fields non-enumerable\n  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n  if (isError(value)\n      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n    return formatError(value);\n  }\n\n  // Some type of object without properties can be shortcutted.\n  if (keys.length === 0) {\n    if (isFunction(value)) {\n      var name = value.name ? ': ' + value.name : '';\n      return ctx.stylize('[Function' + name + ']', 'special');\n    }\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    }\n    if (isDate(value)) {\n      return ctx.stylize(Date.prototype.toString.call(value), 'date');\n    }\n    if (isError(value)) {\n      return formatError(value);\n    }\n  }\n\n  var base = '', array = false, braces = ['{', '}'];\n\n  // Make Array say that they are Array\n  if (isArray(value)) {\n    array = true;\n    braces = ['[', ']'];\n  }\n\n  // Make functions say that they are functions\n  if (isFunction(value)) {\n    var n = value.name ? ': ' + value.name : '';\n    base = ' [Function' + n + ']';\n  }\n\n  // Make RegExps say that they are RegExps\n  if (isRegExp(value)) {\n    base = ' ' + RegExp.prototype.toString.call(value);\n  }\n\n  // Make dates with properties first say the date\n  if (isDate(value)) {\n    base = ' ' + Date.prototype.toUTCString.call(value);\n  }\n\n  // Make error with message first say the error\n  if (isError(value)) {\n    base = ' ' + formatError(value);\n  }\n\n  if (keys.length === 0 && (!array || value.length == 0)) {\n    return braces[0] + base + braces[1];\n  }\n\n  if (recurseTimes < 0) {\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    } else {\n      return ctx.stylize('[Object]', 'special');\n    }\n  }\n\n  ctx.seen.push(value);\n\n  var output;\n  if (array) {\n    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n  } else {\n    output = keys.map(function(key) {\n      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n    });\n  }\n\n  ctx.seen.pop();\n\n  return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n  if (isUndefined(value))\n    return ctx.stylize('undefined', 'undefined');\n  if (isString(value)) {\n    var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n                                             .replace(/'/g, \"\\\\'\")\n                                             .replace(/\\\\\"/g, '\"') + '\\'';\n    return ctx.stylize(simple, 'string');\n  }\n  if (isNumber(value))\n    return ctx.stylize('' + value, 'number');\n  if (isBoolean(value))\n    return ctx.stylize('' + value, 'boolean');\n  // For some reason typeof null is \"object\", so special case here.\n  if (isNull(value))\n    return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n  return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n  var output = [];\n  for (var i = 0, l = value.length; i < l; ++i) {\n    if (hasOwnProperty(value, String(i))) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          String(i), true));\n    } else {\n      output.push('');\n    }\n  }\n  keys.forEach(function(key) {\n    if (!key.match(/^\\d+$/)) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          key, true));\n    }\n  });\n  return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n  var name, str, desc;\n  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n  if (desc.get) {\n    if (desc.set) {\n      str = ctx.stylize('[Getter/Setter]', 'special');\n    } else {\n      str = ctx.stylize('[Getter]', 'special');\n    }\n  } else {\n    if (desc.set) {\n      str = ctx.stylize('[Setter]', 'special');\n    }\n  }\n  if (!hasOwnProperty(visibleKeys, key)) {\n    name = '[' + key + ']';\n  }\n  if (!str) {\n    if (ctx.seen.indexOf(desc.value) < 0) {\n      if (isNull(recurseTimes)) {\n        str = formatValue(ctx, desc.value, null);\n      } else {\n        str = formatValue(ctx, desc.value, recurseTimes - 1);\n      }\n      if (str.indexOf('\\n') > -1) {\n        if (array) {\n          str = str.split('\\n').map(function(line) {\n            return '  ' + line;\n          }).join('\\n').substr(2);\n        } else {\n          str = '\\n' + str.split('\\n').map(function(line) {\n            return '   ' + line;\n          }).join('\\n');\n        }\n      }\n    } else {\n      str = ctx.stylize('[Circular]', 'special');\n    }\n  }\n  if (isUndefined(name)) {\n    if (array && key.match(/^\\d+$/)) {\n      return str;\n    }\n    name = JSON.stringify('' + key);\n    if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n      name = name.substr(1, name.length - 2);\n      name = ctx.stylize(name, 'name');\n    } else {\n      name = name.replace(/'/g, \"\\\\'\")\n                 .replace(/\\\\\"/g, '\"')\n                 .replace(/(^\"|\"$)/g, \"'\");\n      name = ctx.stylize(name, 'string');\n    }\n  }\n\n  return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n  var numLinesEst = 0;\n  var length = output.reduce(function(prev, cur) {\n    numLinesEst++;\n    if (cur.indexOf('\\n') >= 0) numLinesEst++;\n    return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n  }, 0);\n\n  if (length > 60) {\n    return braces[0] +\n           (base === '' ? '' : base + '\\n ') +\n           ' ' +\n           output.join(',\\n  ') +\n           ' ' +\n           braces[1];\n  }\n\n  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nfunction isArray(ar) {\n  return Array.isArray(ar);\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n  return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n  return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n  return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n  return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n  return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n  return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n  return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n  return isObject(re) && objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n  return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n  return isObject(d) && objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\n\nfunction isError(e) {\n  return isObject(e) &&\n      (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\n\nfunction isFunction(arg) {\n  return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n  return arg === null ||\n         typeof arg === 'boolean' ||\n         typeof arg === 'number' ||\n         typeof arg === 'string' ||\n         typeof arg === 'symbol' ||  // ES6 symbol\n         typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = require('./support/isBuffer');\n\nfunction objectToString(o) {\n  return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n  return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n              'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n  var d = new Date();\n  var time = [pad(d.getHours()),\n              pad(d.getMinutes()),\n              pad(d.getSeconds())].join(':');\n  return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexports.log = function() {\n  console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n *     prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nexports.inherits = require('inherits');\n\nexports._extend = function(origin, add) {\n  // Don't do anything if add isn't an object\n  if (!add || !isObject(add)) return origin;\n\n  var keys = Object.keys(add);\n  var i = keys.length;\n  while (i--) {\n    origin[keys[i]] = add[keys[i]];\n  }\n  return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nvar kCustomPromisifiedSymbol = typeof Symbol !== 'undefined' ? Symbol('util.promisify.custom') : undefined;\n\nexports.promisify = function promisify(original) {\n  if (typeof original !== 'function')\n    throw new TypeError('The \"original\" argument must be of type Function');\n\n  if (kCustomPromisifiedSymbol && original[kCustomPromisifiedSymbol]) {\n    var fn = original[kCustomPromisifiedSymbol];\n    if (typeof fn !== 'function') {\n      throw new TypeError('The \"util.promisify.custom\" argument must be of type Function');\n    }\n    Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n      value: fn, enumerable: false, writable: false, configurable: true\n    });\n    return fn;\n  }\n\n  function fn() {\n    var promiseResolve, promiseReject;\n    var promise = new Promise(function (resolve, reject) {\n      promiseResolve = resolve;\n      promiseReject = reject;\n    });\n\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args.push(arguments[i]);\n    }\n    args.push(function (err, value) {\n      if (err) {\n        promiseReject(err);\n      } else {\n        promiseResolve(value);\n      }\n    });\n\n    try {\n      original.apply(this, args);\n    } catch (err) {\n      promiseReject(err);\n    }\n\n    return promise;\n  }\n\n  Object.setPrototypeOf(fn, Object.getPrototypeOf(original));\n\n  if (kCustomPromisifiedSymbol) Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n    value: fn, enumerable: false, writable: false, configurable: true\n  });\n  return Object.defineProperties(\n    fn,\n    getOwnPropertyDescriptors(original)\n  );\n}\n\nexports.promisify.custom = kCustomPromisifiedSymbol\n\nfunction callbackifyOnRejected(reason, cb) {\n  // `!reason` guard inspired by bluebird (Ref: https://goo.gl/t5IS6M).\n  // Because `null` is a special error value in callbacks which means \"no error\n  // occurred\", we error-wrap so the callback consumer can distinguish between\n  // \"the promise rejected with null\" or \"the promise fulfilled with undefined\".\n  if (!reason) {\n    var newReason = new Error('Promise was rejected with a falsy value');\n    newReason.reason = reason;\n    reason = newReason;\n  }\n  return cb(reason);\n}\n\nfunction callbackify(original) {\n  if (typeof original !== 'function') {\n    throw new TypeError('The \"original\" argument must be of type Function');\n  }\n\n  // We DO NOT return the promise as it gives the user a false sense that\n  // the promise is actually somehow related to the callback's execution\n  // and that the callback throwing will reject the promise.\n  function callbackified() {\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args.push(arguments[i]);\n    }\n\n    var maybeCb = args.pop();\n    if (typeof maybeCb !== 'function') {\n      throw new TypeError('The last argument must be of type Function');\n    }\n    var self = this;\n    var cb = function() {\n      return maybeCb.apply(self, arguments);\n    };\n    // In true node style we process the callback on `nextTick` with all the\n    // implications (stack, `uncaughtException`, `async_hooks`)\n    original.apply(this, args)\n      .then(function(ret) { process.nextTick(cb, null, ret) },\n            function(rej) { process.nextTick(callbackifyOnRejected, rej, cb) });\n  }\n\n  Object.setPrototypeOf(callbackified, Object.getPrototypeOf(original));\n  Object.defineProperties(callbackified,\n                          getOwnPropertyDescriptors(original));\n  return callbackified;\n}\nexports.callbackify = callbackify;\n","module.exports = function isBuffer(arg) {\n  return arg && typeof arg === 'object'\n    && typeof arg.copy === 'function'\n    && typeof arg.fill === 'function'\n    && typeof arg.readUInt8 === 'function';\n}","if (typeof Object.create === 'function') {\n  // implementation from standard node.js 'util' module\n  module.exports = function inherits(ctor, superCtor) {\n    ctor.super_ = superCtor\n    ctor.prototype = Object.create(superCtor.prototype, {\n      constructor: {\n        value: ctor,\n        enumerable: false,\n        writable: true,\n        configurable: true\n      }\n    });\n  };\n} else {\n  // old school shim for old browsers\n  module.exports = function inherits(ctor, superCtor) {\n    ctor.super_ = superCtor\n    var TempCtor = function () {}\n    TempCtor.prototype = superCtor.prototype\n    ctor.prototype = new TempCtor()\n    ctor.prototype.constructor = ctor\n  }\n}\n","import { PrivateService } from '@makerdao/services-core';\nimport { MKR, ESM, END } from './utils/constants';\nimport { getCurrency } from './utils/helpers';\nimport tracksTransactions, {\n  tracksTransactionsWithOptions\n} from './utils/tracksTransactions';\n\nexport default class EsmService extends PrivateService {\n  constructor(name = 'esm') {\n    super(name, ['smartContract', 'web3', 'token', 'allowance', 'govQueryApi']);\n  }\n\n  async thresholdAmount() {\n    const min = await this._esmContract().min();\n    return getCurrency(min, MKR).shiftedBy(-18);\n  }\n\n  async fired() {\n    const _fired = await this._esmContract().fired();\n    return _fired.eq(1);\n  }\n\n  async emergencyShutdownActive() {\n    const active = await this._endContract().live();\n    return active.eq(0);\n  }\n\n  async canFire() {\n    const [fired, live] = await Promise.all([\n      this.fired(),\n      this.emergencyShutdownActive()\n    ]);\n    return !fired && !live;\n  }\n\n  async getTotalStaked() {\n    const total = await this._esmContract().Sum();\n    return getCurrency(total, MKR).shiftedBy(-18);\n  }\n\n  async getTotalStakedByAddress(address = false) {\n    if (!address) {\n      address = this.get('web3').currentAddress();\n    }\n    const total = await this._esmContract().sum(address);\n    return getCurrency(total, MKR).shiftedBy(-18);\n  }\n\n  @tracksTransactionsWithOptions({ numArguments: 3 })\n  async stake(amount, skipChecks = false, { promise }) {\n    const mkrAmount = getCurrency(amount, MKR);\n    if (!skipChecks) {\n      const [fired, mkrBalance] = await Promise.all([\n        this.fired(),\n        this.get('token')\n          .getToken(MKR)\n          .balance()\n      ]);\n      if (fired) {\n        throw new Error('cannot join when emergency shutdown has been fired');\n      }\n      if (mkrBalance.lt(mkrAmount)) {\n        throw new Error('amount to join is greater than the user balance');\n      }\n    }\n    return this._esmContract().join(mkrAmount.toFixed('wei'), { promise });\n  }\n\n  @tracksTransactionsWithOptions({ numArguments: 2 })\n  async triggerEmergencyShutdown(skipChecks = false, { promise }) {\n    if (!skipChecks) {\n      const [thresholdAmount, totalStaked, canFire] = await Promise.all([\n        this.thresholdAmount(),\n        this.getTotalStaked(),\n        this.canFire()\n      ]);\n      if (totalStaked.lt(thresholdAmount)) {\n        throw new Error(\n          'total amount of staked MKR has not reached the required threshold'\n        );\n      }\n      if (!canFire) {\n        throw new Error('emergency shutdown has already been initiated');\n      }\n    }\n    return this._esmContract().fire();\n  }\n\n  async getStakingHistory() {\n    const stakes = await this.get('govQueryApi').getEsmJoins();\n    const parsedStakes = stakes.map(e => {\n      const transactionHash = e.txHash;\n      const senderAddress = e.txFrom;\n      const amount = MKR(e.joinAmount);\n      const time = new Date(e.blockTimestamp);\n      return {\n        transactionHash,\n        senderAddress,\n        amount,\n        time\n      };\n    });\n    const sortedParsedStakes = parsedStakes.sort((a, b) => {\n      //sort by date descending\n      return b.time - a.time;\n    });\n    return sortedParsedStakes;\n  }\n\n  _esmContract() {\n    return this.get('smartContract').getContractByName(ESM);\n  }\n\n  _endContract() {\n    return this.get('smartContract').getContractByName(END);\n  }\n}\n","function _applyDecoratedDescriptor(target, property, decorators, descriptor, context) {\n  var desc = {};\n  Object.keys(descriptor).forEach(function (key) {\n    desc[key] = descriptor[key];\n  });\n  desc.enumerable = !!desc.enumerable;\n  desc.configurable = !!desc.configurable;\n\n  if ('value' in desc || desc.initializer) {\n    desc.writable = true;\n  }\n\n  desc = decorators.slice().reverse().reduce(function (desc, decorator) {\n    return decorator(target, property, desc) || desc;\n  }, desc);\n\n  if (context && desc.initializer !== void 0) {\n    desc.value = desc.initializer ? desc.initializer.call(context) : void 0;\n    desc.initializer = undefined;\n  }\n\n  if (desc.initializer === void 0) {\n    Object.defineProperty(target, property, desc);\n    desc = null;\n  }\n\n  return desc;\n}\n\nmodule.exports = _applyDecoratedDescriptor;","// FIXME this is a duplicate of the file in the main dai.js source -- it should\n// be moved to a utility library or something, but for now, this is the simplest\n// way to avoid any issues with importing\n\nimport times from 'lodash/times';\n\n/*\n\nThe default export is a decorator definition.\n\nIf a function is decorated with `@tracksTransactions`, it should expect its last\nargument to be an object with a key named `promise`. It should pass that\n`promise` argument along as a key in the last argument to any non-constant\nfunction calls it makes to a smart contract (i.e. an instance returned from the\ngetContract method in SmartContractService), or any calls it makes to other\nfunctions that will eventually call such smart contract functions.\n\nThis allows TransactionManager to let users input a promise and attach lifecycle\ncallbacks to all transactions that were created in the course of executing that\npromise.\n\n@tracksTransactions is only necessary when the function is async. If the\nfunction returns a contract call and does not make any async calls before that,\nthen the async keyword can be removed, and it just needs to have an `options`\nargument that it passes to its contract call.\n\nIf you need to apply this to a function that has any arguments with default\nvalues, use `@tracksTransactionsWithOptions({ numArguments })` instead, where\n`numArguments` is the total number of arguments to the function, including the\nlast object which contains a key named `promise`.\n\n*/\n\nconst tracksTransactions = tracksTransactionsWithOptions({});\nexport default tracksTransactions;\n\nexport function tracksTransactionsWithOptions({ numArguments }) {\n  return (target, name, descriptor) => {\n    const original = descriptor.value;\n    const correctArgsLength = numArguments || original.length;\n    descriptor.value = function(...args) {\n      const last = args[args.length - 1];\n      let options;\n      if (\n        typeof last === 'object' &&\n        last !== null &&\n        last.constructor === Object\n      ) {\n        args = args.slice(0, args.length - 1);\n        options = last;\n      } else {\n        options = {};\n      }\n\n      const promise = (async () => {\n        // this \"no-op await\" is necessary for the inner reference to the\n        // outer promise to become valid.\n        await 0;\n\n        // if there's already a promise, reuse it instead of setting this one--\n        // this allows the function we're running to behave differently when\n        // it's called directly vs. by another function. e.g. lockWeth\n        if (!options.promise) options.promise = promise;\n\n        // pad the list of arguments with `undefined` to account for any missing\n        // ones with default values.\n        const newArgs = [\n          ...args,\n          ...times(correctArgsLength - 1 - args.length, () => undefined),\n          options\n        ];\n\n        return original.apply(this, newArgs);\n      })();\n      return promise;\n    };\n    return descriptor;\n  };\n}\n","var baseTimes = require('./_baseTimes'),\n    castFunction = require('./_castFunction'),\n    toInteger = require('./toInteger');\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used as references for the maximum length and index of an array. */\nvar MAX_ARRAY_LENGTH = 4294967295;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMin = Math.min;\n\n/**\n * Invokes the iteratee `n` times, returning an array of the results of\n * each invocation. The iteratee is invoked with one argument; (index).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.times(3, String);\n * // => ['0', '1', '2']\n *\n *  _.times(4, _.constant(0));\n * // => [0, 0, 0, 0]\n */\nfunction times(n, iteratee) {\n  n = toInteger(n);\n  if (n < 1 || n > MAX_SAFE_INTEGER) {\n    return [];\n  }\n  var index = MAX_ARRAY_LENGTH,\n      length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n  iteratee = castFunction(iteratee);\n  n -= MAX_ARRAY_LENGTH;\n\n  var result = baseTimes(length, iteratee);\n  while (++index < n) {\n    iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = times;\n","var identity = require('./identity');\n\n/**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\nfunction castFunction(value) {\n  return typeof value == 'function' ? value : identity;\n}\n\nmodule.exports = castFunction;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nmodule.exports = identity;\n","var toNumber = require('./toNumber');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = value.replace(reTrim, '');\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n","import { PublicService } from '@makerdao/services-core';\nimport { PAUSE } from './utils/constants';\nimport DsSpellAbi from '../contracts/abis/DSSpell.json';\nimport padStart from 'lodash/padStart';\nimport assert from 'assert';\nimport contractInfo from '../contracts/contract-info.json';\nconst pauseInfo = contractInfo.pause;\nimport { netIdToName } from './utils/helpers';\n\nexport default class SpellService extends PublicService {\n  constructor(name = 'spell') {\n    super(name, ['smartContract', 'web3']);\n    this.eta = {};\n    this.done = {};\n    this.action = {};\n    this.executionDate = {};\n    this.scheduledDate = {};\n  }\n\n  getDelayInSeconds() {\n    if (this.delay) return this.delay;\n    this.delay = this._pauseContract().delay();\n    return this.delay;\n  }\n\n  async getEta(spellAddress) {\n    if (this.eta[spellAddress]) return this.eta[spellAddress];\n    const spell = this.get('smartContract').getContractByAddressAndAbi(\n      spellAddress,\n      DsSpellAbi\n    );\n    const eta = await spell.eta();\n    if (!eta.toNumber()) return undefined;\n    this.eta[spellAddress] = new Date(eta.toNumber() * 1000);\n    return this.eta[spellAddress];\n  }\n\n  async getScheduledDate(spellAddress) {\n    if (this.scheduledDate[spellAddress])\n      return this.scheduledDate[spellAddress];\n    const eta = await this.getEta(spellAddress);\n    assert(eta, `spell ${spellAddress} has not been scheduled`);\n    const pauseAddress = this._pauseContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const paddedSpellAddress =\n      '0x' + padStart(spellAddress.replace(/^0x/, ''), 64, '0');\n    const [plotEvent] = await web3Service.getPastLogs({\n      fromBlock: pauseInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: pauseAddress,\n      topics: [pauseInfo.events.plot, paddedSpellAddress]\n    });\n    const { timestamp } = await web3Service.getBlock(plotEvent.blockNumber);\n    this.scheduledDate[spellAddress] = new Date(timestamp * 1000);\n    return this.scheduledDate[spellAddress];\n  }\n\n  async getDone(spellAddress) {\n    if (this.done[spellAddress]) return this.done[spellAddress];\n    const spell = this.get('smartContract').getContractByAddressAndAbi(\n      spellAddress,\n      DsSpellAbi\n    );\n    this.done[spellAddress] = spell.done();\n    return this.done[spellAddress];\n  }\n\n  async getAction(spellAddress) {\n    if (this.action[spellAddress]) return this.action[spellAddress];\n    const spell = this.get('smartContract').getContractByAddressAndAbi(\n      spellAddress,\n      DsSpellAbi\n    );\n    this.action[spellAddress] = spell.action();\n    return this.action[spellAddress];\n  }\n\n  async getExecutionDate(spellAddress) {\n    if (this.executionDate[spellAddress])\n      return this.executionDate[spellAddress];\n    const done = await this.getDone(spellAddress);\n    assert(done, `spell ${spellAddress} has not been executed`);\n    const pauseAddress = this._pauseContract().address;\n    const web3Service = this.get('web3');\n    const netId = web3Service.network;\n    const networkName = netIdToName(netId);\n    const paddedSpellAddress =\n      '0x' + padStart(spellAddress.replace(/^0x/, ''), 64, '0');\n    const [execEvent] = await web3Service.getPastLogs({\n      fromBlock: pauseInfo.inception_block[networkName],\n      toBlock: 'latest',\n      address: pauseAddress,\n      topics: [pauseInfo.events.exec, paddedSpellAddress]\n    });\n    const { timestamp } = await web3Service.getBlock(execEvent.blockNumber);\n    this.executionDate[spellAddress] = new Date(timestamp * 1000);\n    return this.executionDate[spellAddress];\n  }\n\n  refresh() {\n    this.delay = null;\n    this.eta = {};\n    this.done = {};\n    this.executionDate = {};\n    this.scheduledDate = {};\n  }\n\n  _pauseContract() {\n    return this.get('smartContract').getContractByName(PAUSE);\n  }\n}\n","var createPadding = require('./_createPadding'),\n    stringSize = require('./_stringSize'),\n    toInteger = require('./toInteger'),\n    toString = require('./toString');\n\n/**\n * Pads `string` on the left side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padStart('abc', 6);\n * // => '   abc'\n *\n * _.padStart('abc', 6, '_-');\n * // => '_-_abc'\n *\n * _.padStart('abc', 3);\n * // => 'abc'\n */\nfunction padStart(string, length, chars) {\n  string = toString(string);\n  length = toInteger(length);\n\n  var strLength = length ? stringSize(string) : 0;\n  return (length && strLength < length)\n    ? (createPadding(length - strLength, chars) + string)\n    : string;\n}\n\nmodule.exports = padStart;\n","var baseRepeat = require('./_baseRepeat'),\n    baseToString = require('./_baseToString'),\n    castSlice = require('./_castSlice'),\n    hasUnicode = require('./_hasUnicode'),\n    stringSize = require('./_stringSize'),\n    stringToArray = require('./_stringToArray');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil;\n\n/**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\nfunction createPadding(length, chars) {\n  chars = chars === undefined ? ' ' : baseToString(chars);\n\n  var charsLength = chars.length;\n  if (charsLength < 2) {\n    return charsLength ? baseRepeat(chars, length) : chars;\n  }\n  var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n  return hasUnicode(chars)\n    ? castSlice(stringToArray(result), 0, length).join('')\n    : result.slice(0, length);\n}\n\nmodule.exports = createPadding;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeFloor = Math.floor;\n\n/**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\nfunction baseRepeat(string, n) {\n  var result = '';\n  if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n    return result;\n  }\n  // Leverage the exponentiation by squaring algorithm for a faster repeat.\n  // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n  do {\n    if (n % 2) {\n      result += string;\n    }\n    n = nativeFloor(n / 2);\n    if (n) {\n      string += string;\n    }\n  } while (n);\n\n  return result;\n}\n\nmodule.exports = baseRepeat;\n","var baseSlice = require('./_baseSlice');\n\n/**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\nfunction castSlice(array, start, end) {\n  var length = array.length;\n  end = end === undefined ? length : end;\n  return (!start && end >= length) ? array : baseSlice(array, start, end);\n}\n\nmodule.exports = castSlice;\n","/**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\nfunction baseSlice(array, start, end) {\n  var index = -1,\n      length = array.length;\n\n  if (start < 0) {\n    start = -start > length ? 0 : (length + start);\n  }\n  end = end > length ? length : end;\n  if (end < 0) {\n    end += length;\n  }\n  length = start > end ? 0 : ((end - start) >>> 0);\n  start >>>= 0;\n\n  var result = Array(length);\n  while (++index < length) {\n    result[index] = array[index + start];\n  }\n  return result;\n}\n\nmodule.exports = baseSlice;\n","var baseProperty = require('./_baseProperty');\n\n/**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nvar asciiSize = baseProperty('length');\n\nmodule.exports = asciiSize;\n","/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nmodule.exports = baseProperty;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nfunction unicodeSize(string) {\n  var result = reUnicode.lastIndex = 0;\n  while (reUnicode.test(string)) {\n    ++result;\n  }\n  return result;\n}\n\nmodule.exports = unicodeSize;\n","var asciiToArray = require('./_asciiToArray'),\n    hasUnicode = require('./_hasUnicode'),\n    unicodeToArray = require('./_unicodeToArray');\n\n/**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction stringToArray(string) {\n  return hasUnicode(string)\n    ? unicodeToArray(string)\n    : asciiToArray(string);\n}\n\nmodule.exports = stringToArray;\n","/**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction asciiToArray(string) {\n  return string.split('');\n}\n\nmodule.exports = asciiToArray;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction unicodeToArray(string) {\n  return string.match(reUnicode) || [];\n}\n\nmodule.exports = unicodeToArray;\n","var baseToString = require('./_baseToString');\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n"],"sourceRoot":""}
\ No newline at end of file