fable 3.0.26 → 3.0.27

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (15) hide show
  1. package/.browserslistrc +1 -1
  2. package/dist/fable.js +1940 -2975
  3. package/dist/fable.min.js +32 -14
  4. package/dist/fable.min.js.map +1 -1
  5. package/gulpfile-config.json +2 -2
  6. package/package.json +3 -2
  7. package/source/Fable-PreinitServiceProviderBase.js +36 -0
  8. package/source/Fable-ServiceManager.js +27 -0
  9. package/source/Fable.js +12 -4
  10. package/source/{Fable-Service-DataArithmatic.js → services/Fable-Service-DataArithmatic.js} +2 -1
  11. package/source/{Fable-Service-MetaTemplate.js → services/Fable-Service-MetaTemplate.js} +1 -1
  12. package/source/services/Fable-Service-RestClient.js +17 -0
  13. package/source/{Fable-Service-Template.js → services/Fable-Service-Template.js} +1 -1
  14. package/source/{Fable-Service-Utility.js → services/Fable-Service-Utility.js} +1 -1
  15. package/test/FableServiceManager_tests.js +64 -0
package/dist/fable.min.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"sources":["fable.min.js","node_modules/browser-pack/_prelude.js","node_modules/async.eachlimit/index.js","node_modules/async.iterator/index.js","node_modules/async.util.eachoflimit/index.js","node_modules/async.util.ensureasync/index.js","node_modules/async.util.isarray/index.js","node_modules/async.util.isarraylike/index.js","node_modules/async.util.keyiterator/index.js","node_modules/async.util.keys/index.js","node_modules/async.util.noop/index.js","node_modules/async.util.once/index.js","node_modules/async.util.onlyonce/index.js","node_modules/async.util.restparam/index.js","node_modules/async.util.setimmediate/index.js","node_modules/async.util.withoutindex/index.js","node_modules/async.waterfall/index.js","node_modules/data-arithmatic/source/DataArithmatic.js","node_modules/fable-log/source/Fable-Log-BaseLogger.js","node_modules/fable-log/source/Fable-Log-DefaultProviders-Web.js","node_modules/fable-log/source/Fable-Log-DefaultStreams.json","node_modules/fable-log/source/Fable-Log-Logger-Console.js","node_modules/fable-log/source/Fable-Log-Logger-SimpleFlatFile.js","node_modules/fable-log/source/Fable-Log.js","node_modules/fable-settings/source/Fable-Settings-Default.json","node_modules/fable-settings/source/Fable-Settings-TemplateProcessor.js","node_modules/fable-settings/source/Fable-Settings.js","node_modules/fable-uuid/source/Fable-UUID-Random-Browser.js","node_modules/fable-uuid/source/Fable-UUID.js","node_modules/path-browserify/index.js","node_modules/precedent/source/Precedent.js","node_modules/precedent/source/StringParser.js","node_modules/precedent/source/WordTree.js","node_modules/process/browser.js","node_modules/timers-browserify/main.js","source/Fable-Browser-Shim.js","source/Fable-Operation.js","source/Fable-Service-DataArithmatic.js","source/Fable-Service-MetaTemplate.js","source/Fable-Service-Template.js","source/Fable-Service-Utility.js","source/Fable-ServiceManager.js","source/Fable-ServiceProviderBase.js","source/Fable.js"],"names":["f","exports","module","define","amd","window","global","self","this","Fable","r","e","n","t","o","i","c","require","u","a","Error","code","p","call","length","eachOfLimit","withoutIndex","arr","limit","iterator","cb","tasks","makeCallback","index","fn","apply","arguments","next","once","noop","onlyOnce","keyIterator","obj","nextKey","done","running","errored","replenish","key","err","setImmediate","restParam","args","callback","pop","push","innerArgs","sync","Array","isArray","Object","prototype","toString","_keys","isArrayLike","coll","len","keys","k","hasOwnProperty","func","startIndex","Math","max","rest","_setImmediate","fallback","setTimeout","timers","value","ensureAsync","wrapIterator","concat","constructor","_Regex_formatterInsertCommas","_Regex_formatterAddCommasToNumber","_Regex_formatterDollarsRemoveCommas","_Regex_formatterCleanNonAlpha","_Value_MoneySign_Currency","_Value_NaN_Currency","_Value_GroupSeparator_Number","_Value_Prefix_StringHash","_Value_Clean_formatterCleanNonAlpha","_UseEngineStringStartsWith","String","startsWith","_UseEngineStringEndsWith","endsWith","stringReverse","pString","split","reverse","join","stringStartsWith","pSearchString","pStartIndex","stringStartsWith_Polyfill","slice","stringEndsWith","pEndIndex","stringEndsWith_Polyfill","substr","insecureStringHash","tmpHash","tmpStringLength","tmpCharacterIndex","charCodeAt","cleanEnclosureWrapCharacters","pWrapCharacter","substring","cleanNonAlphaCharacters","replace","formatterInsertCommas","tmpReversedWithCommas","match","processAddCommasToNumberRegex","pMatch","pSign","pZeros","pBefore","pDecimal","pAfter","formatterAddCommasToNumber","pNumber","bind","formatterDollars","pValue","tmpDollarAmount","parseFloat","toFixed","isNaN","formatterRoundNumber","pDigits","tmpDigits","tmpValue","stringBeforeMatch","stringAfterMatch","tmpStringSplitLocation","indexOf","stringCountEnclosures","pEnclosureStart","pEnclosureEnd","tmpString","tmpEnclosureStart","tmpEnclosureEnd","tmpEnclosureCount","tmpEnclosureDepth","stringGetEnclosureValueByIndex","pEnclosureIndexToGet","tmpEnclosureIndexToGet","tmpMatchedEnclosureIndex","tmpEnclosedValueStartIndex","tmpEnclosedValueEndIndex","stringRemoveEnclosureByIndex","pEnclosureIndexToRemove","tmpEnclosureIndexToRemove","tmpEnclosureStartIndex","tmpEnclosureEndIndex","tmpReturnString","pLogStreamSettings","pFableLog","_Settings","loggerUUID","generateInsecureUUID","levels","tmpDate","Date","getTime","pCharacter","tmpRandomData","random","floor","initialize","trace","pLogText","pLogObject","write","debug","info","warn","error","fatal","pLogLevel","getDefaultProviders","tmpDefaultProviders","console","default","loggertype","streamtype","level","libBaseLogger","super","_ShowTimeStamps","showtimestamps","_FormattedTimeStamps","formattedtimestamps","_ContextMessage","Context","Product","_OutputLogLinesToConsole","outputloglinestoconsole","_OutputObjectsToConsole","outputobjectstoconsole","prefixCache","pLevel","pObject","tmpTimeStamp","toISOString","tmpLogLine","log","JSON","stringify","libConsoleLog","libFS","libPath","logFileRawPath","path","logFilePath","normalize","logFileStreamOptions","fileStreamOptions","flags","encoding","fileWriter","createWriteStream","activelyWriting","logLineStrings","logObjectStrings","defaultWriteCompleteCallback","defaultBufferFlushCallback","closeWriter","fCloseComplete","tmpCloseComplete","end","completeBufferFlushToLogFile","fFlushComplete","tmpFlushComplete","flushBufferToLogFile","tmpLineStrings","tmpObjectStrings","tmpConstructedBufferOutputString","fs","FableLog","pFableSettings","pFable","tmpSettings","_Providers","_StreamDefinitions","LogStreams","logStreams","logProviders","activeLogStreams","logStreamsTrace","logStreamsDebug","logStreamsInfo","logStreamsWarn","logStreamsError","logStreamsFatal","datumDecorator","pDatum","uuid","addLogger","pLogger","setDatumDecorator","fDatumDecorator","pMessage","tmpDecoratedDatum","tmpStreamDefinition","assign","logTime","tmpMessage","tmpTime","getTimeStamp","getTimeDelta","pTimeStamp","logTimeDelta","pTimeDelta","tmpEndTime","logTimeDeltaHuman","tmpMs","parseInt","tmpSeconds","tmpMinutes","tmpHours","logTimeDeltaRelative","pStartTime","logTimeDeltaRelativeHuman","new","pSettings","LogProviderBase","LogProviderConsole","ProductVersion","ConfigFile","process","pDependencies","templateProcessor","precedent","addPattern","pTemplateValue","tmpTemplateValue","trim","tmpSeparatorIndex","tmpDefaultValue","tmpEnvironmentVariableName","env","parseSetting","parseString","_process","libPrecedent","libFableSettingsTemplateProcessor","FableSettings","dependencies","settingsTemplateProcessor","_configureEnvTemplating","buildDefaultSettings","merge","base","parse","DefaultConfigFile","pException","settings","_PerformEnvTemplating","NoEnvReplacement","_resolveEnv","tmpKey","_isObject","_deepMergeObjects","toObject","fromObject","forEach","fromValue","toValue","pSettingsFrom","pSettingsTo","tmpSettingsFrom","tmpSettingsTo","tmpSettingsFromCopy","fill","getRandomValues","crypto","msCrypto","generateWhatWGBytes","tmpBuffer","Uint8Array","generateRandomBytes","generate","libRandomByteGenerator","FableUUID","_UUIDModeRandom","UUIDModeRandom","_UUIDLength","UUIDLength","_UUIDRandomDictionary","UUIDDictionary","randomByteGenerator","_HexLookup","bytesToUUID","pBuffer","generateUUIDv4","tmpRandomBytes","generateRandom","tmpUUID","charAt","getUUID","assertPath","TypeError","normalizeStringPosix","allowAboveRoot","res","lastSegmentLength","lastSlash","dots","lastSlashIndex","lastIndexOf","posix","resolve","cwd","resolvedPath","resolvedAbsolute","undefined","isAbsolute","trailingSeparator","joined","arg","relative","from","to","fromStart","fromEnd","fromLen","toStart","toLen","lastCommonSep","fromCode","out","_makeLong","dirname","hasRoot","matchedSlash","basename","ext","start","extIdx","firstNonSlashEnd","extname","startDot","startPart","preDotState","format","pathObject","sep","dir","root","name","_format","ret","delimiter","win32","libWordTree","libStringParser","WordTree","StringParser","ParseTree","pPatternStart","pPatternEnd","pParser","pData","newParserState","pParseTree","Output","OutputBuffer","Pattern","PatternMatch","PatternMatchOutputBuffer","assignNode","pNode","pParserState","appendOutputBuffer","flushOutputBuffer","checkPatternEnd","PatternEnd","PatternStart","Parse","parseCharacter","tmpParserState","addChild","pTree","pPattern","pIndex","tmpLeaf","cachedSetTimeout","cachedClearTimeout","defaultSetTimout","defaultClearTimeout","runTimeout","fun","clearTimeout","currentQueue","queue","draining","queueIndex","cleanUpNextTick","drainQueue","timeout","run","marker","runClearTimeout","Item","array","nextTick","title","browser","argv","version","versions","on","addListener","off","removeListener","removeAllListeners","emit","prependListener","prependOnceListener","listeners","binding","chdir","umask","clearImmediate","Function","immediateIds","nextImmediateId","Timeout","id","clearFn","_id","_clearFn","setInterval","clearInterval","close","unref","ref","enroll","item","msecs","_idleTimeoutId","_idleTimeout","unenroll","_unrefActive","active","_onTimeout","libNPMModuleWrapper","_OperationStatePrototype","Metadata","GUID","Hash","Title","Summary","Version","Status","Completed","CompletionProgress","CompletionTimeElapsed","Steps","StepsCompleted","StartTime","EndTime","Errors","Log","pOperationName","pOperationHash","fable","state","writeOperationLog","toUTCString","writeOperationErrors","libFableServiceBase","libDataArithmatic","pOptions","pServiceHash","serviceType","_DataArithmaticLibrary","_MetaTemplateLibrary","options","Matchers","Evaluate","Interpolate","Escaper","Unescaper","GuaranteedNonMatch","templateEscapes","u2028","u2029","renderFunction","templateString","renderTemplate","templateFunction","buildTemplateFunction","pTemplateText","TemplateSource","pCode","decodeURIComponent","TemplateSourceCompiled","libAsyncWaterfall","libAsyncEachLimit","templates","waterfall","eachLimit","extend","pDestinationObject","_len","pSourceObjects","_key","template","serviceManager","instantiateServiceProviderWithoutRegistration","buildHashedTemplate","pTemplateHash","tmpTemplate","instantiateServiceProvider","chunk","pInput","pChunkSize","pChunkCache","tmpInputArray","tmpChunkSize","tmpChunkCache","splice","serviceTypes","services","defaultServices","serviceClasses","addServiceType","pServiceType","pServiceClass","pCustomServiceHash","tmpService","setDefaultServiceInstantiation","ServiceProviderBase","UUID","libFableSettings","libFableUUID","libFableLog","libFableServiceManager","libFableServiceDataArithmatic","libFableServiceTemplate","libFableServiceMetaTemplate","libFableServiceUtility","libFableOperation","settingsManager","libUUID","Dependencies","Operations","DataArithmatic","Utility","createOperation","tmpOperation","getOperation"],"mappings":"AAAA,cCAA,SAAAA,GAAA,GAAA,iBAAAC,SAAA,oBAAAC,OAAAA,OAAAD,QAAAD,SAAA,GAAA,mBAAAG,QAAAA,OAAAC,IAAAD,OAAA,GAAAH,OAAA,EAAA,oBAAAK,OAAAA,OAAA,oBAAAC,OAAAA,OAAA,oBAAAC,KAAAA,KAAAC,MAAAC,MAAAT,GAAA,CAAA,CAAA,EAAA,WAAA,OAAA,SAAAU,EAAAC,EAAAC,EAAAC,GAAA,SAAAC,EAAAC,EAAAf,GAAA,IAAAY,EAAAG,GAAA,CAAA,IAAAJ,EAAAI,GAAA,CAAA,IAAAC,EAAA,mBAAAC,SAAAA,QAAA,IAAAjB,GAAAgB,EAAA,OAAAA,EAAAD,GAAA,GAAA,GAAAG,EAAA,OAAAA,EAAAH,GAAA,GAAA,IAAAI,EAAA,IAAAC,MAAA,uBAAAL,EAAA,KAAA,MAAAI,EAAAE,KAAA,mBAAAF,CAAA,CAAA,IAAAG,EAAAV,EAAAG,GAAA,CAAAd,QAAA,CAAA,GAAAU,EAAAI,GAAA,GAAAQ,KAAAD,EAAArB,SAAA,SAAAS,GAAA,OAAAI,EAAAH,EAAAI,GAAA,GAAAL,IAAAA,EAAA,GAAAY,EAAAA,EAAArB,QAAAS,EAAAC,EAAAC,EAAAC,EAAA,CAAA,OAAAD,EAAAG,GAAAd,OAAA,CAAA,IAAA,IAAAiB,EAAA,mBAAAD,SAAAA,QAAAF,EAAA,EAAAA,EAAAF,EAAAW,OAAAT,IAAAD,EAAAD,EAAAE,IAAA,OAAAD,CAAA,CAAA,CAAA,CAAA,EAAA,CAAA,SAAAG,EAAAf,EAAAD,GCEA,IAAAwB,EAAAR,EAAA,0BACAS,EAAAT,EAAA,2BAEAf,EAAAD,QAAA,SAAA0B,EAAAC,EAAAC,EAAAC,GACA,OAAAL,EAAAG,EAAAH,CAAAE,EAAAD,EAAAG,GAAAC,EACA,CFGA,EAAE,CAAC,yBAAyB,EAAE,0BAA0B,KAAK,EAAE,CAAC,SAASb,EAAQf,EAAOD,GGRxFC,EAAAD,QAAA,SAAA8B,GAaA,OAZA,SAAAC,EAAAC,GACA,SAAAC,IAIA,OAHAH,EAAAP,QACAO,EAAAE,GAAAE,MAAA,KAAAC,WAEAF,EAAAG,MACA,CAIA,OAHAH,EAAAG,KAAA,WACA,OAAAJ,EAAAF,EAAAP,OAAA,EAAAQ,EAAAC,EAAA,GAAA,IACA,EACAC,CACA,CACAF,CAAA,EACA,CHaA,EAAE,CAAC,GAAG,EAAE,CAAC,SAASf,EAAQf,EAAOD,GI7BjC,IAAAqC,EAAArB,EAAA,mBACAsB,EAAAtB,EAAA,mBACAuB,EAAAvB,EAAA,uBACAwB,EAAAxB,EAAA,0BAEAf,EAAAD,QAAA,SAAA2B,GACA,OAAA,SAAAc,EAAAb,EAAAC,GACAA,EAAAQ,EAAAR,GAAAS,GAEA,IAAAI,EAAAF,EADAC,EAAAA,GAAA,IAEA,GAAAd,GAAA,EACA,OAAAE,EAAA,MAEA,IAAAc,GAAA,EACAC,EAAA,EACAC,GAAA,GAEA,SAAAC,IACA,GAAAH,GAAAC,GAAA,EACA,OAAAf,EAAA,MAGA,KAAAe,EAAAjB,IAAAkB,GAAA,CACA,IAAAE,EAAAL,IACA,GAAA,OAAAK,EAKA,OAJAJ,GAAA,OACAC,GAAA,GACAf,EAAA,OAIAe,GAAA,EACAhB,EAAAa,EAAAM,GAAAA,EAAAR,GAAA,SAAAS,GACAJ,GAAA,EACAI,GACAnB,EAAAmB,GACAH,GAAA,GAEAC,GAEA,IACA,CACA,CAzBA,EA0BA,CACA,CJgCA,EAAE,CAAC,yBAAyB,EAAE,kBAAkB,EAAE,kBAAkB,GAAG,sBAAsB,KAAK,EAAE,CAAC,SAAS9B,EAAQf,EAAOD,GK3E7H,IAAAiD,EAAAjC,EAAA,2BACAkC,EAAAlC,EAAA,wBAEAf,EAAAD,QAAA,SAAAiC,GACA,OAAAiB,GAAA,SAAAC,GACA,IAAAC,EAAAD,EAAAE,MACAF,EAAAG,MAAA,WACA,IAAAC,EAAApB,UACAqB,EACAP,GAAA,WACAG,EAAAlB,MAAA,KAAAqB,EACA,IAEAH,EAAAlB,MAAA,KAAAqB,EAEA,IACA,IAAAC,GAAA,EACAvB,EAAAC,MAAA3B,KAAA4C,GACAK,GAAA,CACA,GACA,CL+EA,EAAE,CAAC,uBAAuB,GAAG,0BAA0B,KAAK,EAAE,CAAC,SAASxC,EAAQf,EAAOD,GMlGvFC,EAAAD,QAAAyD,MAAAC,SAAA,SAAAjB,GACA,MAAA,mBAAAkB,OAAAC,UAAAC,SAAAvC,KAAAmB,EACA,CNuGA,EAAE,CAAC,GAAG,EAAE,CAAC,SAASzB,EAAQf,EAAOD,GOzGjC,IAAA0D,EAAA1C,EAAA,sBAEAf,EAAAD,QAAA,SAAA0B,GACA,OAAAgC,EAAAhC,IAEA,iBAAAA,EAAAH,QACAG,EAAAH,QAAA,GACAG,EAAAH,OAAA,GAAA,CAEA,CP8GA,EAAE,CAAC,qBAAqB,IAAI,EAAE,CAAC,SAASP,EAAQf,EAAOD,GQvHvD,IAAA8D,EAAA9C,EAAA,mBACA+C,EAAA/C,EAAA,0BAEAf,EAAAD,QAAA,SAAAgE,GACA,IACAC,EACAC,EAFApD,GAAA,EAGA,OAAAiD,EAAAC,IACAC,EAAAD,EAAAzC,OACA,WAEA,QADAT,EACAmD,EAAAnD,EAAA,IACA,IAEAoD,EAAAJ,EAAAE,GACAC,EAAAC,EAAA3C,OACA,WAEA,QADAT,EACAmD,EAAAC,EAAApD,GAAA,IACA,EAEA,CR4HA,EAAE,CAAC,yBAAyB,EAAE,kBAAkB,IAAI,EAAE,CAAC,SAASE,EAAQf,EAAOD,GSjJ/EC,EAAAD,QAAA2D,OAAAO,MAAA,SAAAzB,GACA,IAAAqB,EAAA,GACA,IAAA,IAAAK,KAAA1B,EACAA,EAAA2B,eAAAD,IACAL,EAAAR,KAAAa,GAGA,OAAAL,CACA,CTsJA,EAAE,CAAC,GAAG,EAAE,CAAC,SAAS9C,EAAQf,EAAOD,GU9JjCC,EAAAD,QAAA,WAAA,CVmKA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASgB,EAAQf,EAAOD,GWnKlCC,EAAAD,QAAA,SAAAiC,GACA,OAAA,WACA,OAAAA,IACAA,EAAAC,MAAA3B,KAAA4B,WACAF,EAAA,KACA,CACA,CXwKA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASjB,EAAQf,EAAOD,GY9KlCC,EAAAD,QAAA,SAAAiC,GACA,OAAA,WACA,GAAA,OAAAA,EAAA,MAAA,IAAAd,MAAA,gCACAc,EAAAC,MAAA3B,KAAA4B,WACAF,EAAA,IACA,CACA,CZmLA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASjB,EAAQf,EAAOD,Ga1LlCC,EAAAD,QAAA,SAAAqE,EAAAC,GAEA,OADAA,EAAA,MAAAA,EAAAD,EAAA9C,OAAA,GAAA+C,EACA,WAGA,IAFA,IAAA/C,EAAAgD,KAAAC,IAAArC,UAAAZ,OAAA+C,EAAA,GACAG,EAAA,IAAAhB,MAAAlC,GACAS,EAAA,EAAAA,EAAAT,EAAAS,IACAyC,EAAAzC,GAAAG,UAAAH,EAAAsC,GAEA,OAAAA,GACA,KAAA,EACA,OAAAD,EAAA/C,KAAAf,KAAAkE,GACA,KAAA,EACA,OAAAJ,EAAA/C,KAAAf,KAAA4B,UAAA,GAAAsC,GAEA,CACA,Cb8LA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASzD,EAAQf,EAAOD,IAClC,SAAWiD,IAAc,Wc7MzB,IAAAyB,EAAA,mBAAAzB,GAAAA,EACA0B,EAAA,SAAA1C,GACA2C,WAAA3C,EAAA,EACA,EAEAhC,EAAAD,QAAA,SAAAiC,GAEA,OAAAyC,GAAAC,GAAA1C,EACA,CdkNC,GAAEX,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,UAAUiC,aAE5C,EAAE,CAAC4B,OAAS,KAAK,GAAG,CAAC,SAAS7D,EAAQf,EAAOD,Ge5N7CC,EAAAD,QAAA,SAAA4B,GACA,OAAA,SAAAkD,EAAA9C,EAAAoB,GACA,OAAAxB,EAAAkD,EAAA1B,EACA,CACA,CfiOA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASpC,EAAQf,EAAOD,GgBrOlC,IAAAqC,EAAArB,EAAA,mBACAsB,EAAAtB,EAAA,mBACA0C,EAAA1C,EAAA,sBACAkC,EAAAlC,EAAA,wBACA+D,EAAA/D,EAAA,0BACAY,EAAAZ,EAAA,kBAEAf,EAAAD,QAAA,SAAA8B,EAAAD,GAEA,GADAA,EAAAQ,EAAAR,GAAAS,IACAoB,EAAA5B,GAAA,OAAAD,EAAA,IAAAV,MAAA,8DACA,IAAAW,EAAAP,OAAA,OAAAM,KAEA,SAAAmD,EAAApD,GACA,OAAAsB,GAAA,SAAAF,EAAAG,GACA,GAAAH,EACAnB,EAAAK,MAAA,KAAA,CAAAc,GAAAiC,OAAA9B,QACA,CACA,IAAAf,EAAAR,EAAAQ,OACAA,EACAe,EAAAG,KAAA0B,EAAA5C,IAEAe,EAAAG,KAAAzB,GAEAkD,EAAAnD,GAAAM,MAAA,KAAAiB,EACA,CACA,GACA,CACA6B,CAAApD,EAAAE,GAAAkD,EACA,ChB0OA,EAAE,CAAC,iBAAiB,EAAE,yBAAyB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,kBAAkB,GAAG,uBAAuB,KAAK,GAAG,CAAC,SAAShE,EAAQf,EAAOD,GAEzK,EAAE,CAAC,GAAG,GAAG,CAAC,SAASgB,EAAQf,EAAOD,GiB8PlCC,EAAAD;;;;;AA9fA,MAEAkF,cAIA3E,KAAA4E,6BAAA,UAIA5E,KAAA6E,kCAAA,+BACA7E,KAAA8E,oCAAA,MACA9E,KAAA+E,8BAAA,cAIA/E,KAAAgF,0BAAA,IACAhF,KAAAiF,oBAAA,KACAjF,KAAAkF,6BAAA,IAEAlF,KAAAmF,yBAAA,MACAnF,KAAAoF,oCAAA,IAEApF,KAAAqF,2BAAA,mBAAAC,OAAAjC,UAAAkC,WACAvF,KAAAwF,yBAAA,mBAAAF,OAAAjC,UAAAoC,QACA,CAaAC,cAAAC,GAIA,OAAAA,EAAAC,MAAA,IAAAC,UAAAC,KAAA,GACA,CAUAC,iBAAAJ,EAAAK,EAAAC,GAEA,OAAAjG,KAAAqF,2BAEAM,EAAAJ,WAAAS,EAAAC,GAIAjG,KAAAkG,0BAAAnF,KAAA4E,EAAAK,EAAAC,EAEA,CASAC,0BAAAF,EAAAC,GAEA,OAAAjG,KAAAmG,MAAAF,GAAA,EAAAD,EAAAhF,UAAAgF,CACA,CAUAI,eAAAT,EAAAK,EAAAK,GAEA,OAAArG,KAAAwF,yBAEAG,EAAAF,SAAAO,EAAAK,GAIArG,KAAAsG,wBAAAvF,KAAA4E,EAAAK,EAAAK,EAEA,CASAC,wBAAAN,EAAAK,GAYA,OARAA,EAAArG,KAAAgB,OAMAqF,GAAA,EAJAA,EAAArG,KAAAgB,OAMAhB,KAAAuG,OAAAF,EAAAL,EAAAhF,OAAAgF,EAAAhF,UAAAgF,CACA,CAQAQ,mBAAAb,GAEA,IAAAc,EAAA,EACAC,EAAAf,EAAA3E,OACA2F,EAAA,EAEA,KAAAA,EAAAD,GAEAD,GAAAA,GAAA,GAAAA,EAAAd,EAAAiB,WAAAD,KAAA,EAGA,MAAA,GAAAjC,OAAA1E,KAAAmF,0BAAAT,OAAA+B,EACA,CASAI,6BAAAC,EAAAnB,GAcA,OAAAA,EAAAJ,WAAAuB,IAAAnB,EAAAF,SAAAqB,GAEAnB,EAAAoB,UAAA,EAAApB,EAAA3E,OAAA,GAIA2E,CAEA,CAOAqB,wBAAArB,GAEA,GAAA,iBAAAA,GAAA,IAAAA,EAEA,OAAAA,EAAAsB,QAAAjH,KAAA+E,8BAAA/E,KAAAoF,oCAEA,CAaA8B,sBAAAvB,GAGA,IAEAwB,EAFAnH,KAAA0F,cAAAC,GAEAyB,MAAApH,KAAA4E,8BAAAkB,KAAA,KAEA,OAAA9F,KAAA0F,cAAAyB,EACA,CAEAE,8BAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GAIA,OAAAJ,GAAAG,EAAA1H,KAAAkH,sBAAAO,GAAAC,EAAAC,EAAA3H,KAAAkH,sBAAAO,EAAAE,GACA,CAQAC,2BAAAC,GAGA,OAAAA,EAAAvE,WAAA2D,QAEAjH,KAAA6E,kCACA7E,KAAAqH,8BAAAS,KAAA9H,MAEA,CAQA+H,iBAAAC,GAEA,IAAAC,EAAAC,WAAAF,GAAAG,QAAA,GAEA,OAAAC,MAAAH,KAGA,iBAAAD,IAGAC,EAAAC,WAAAF,EAAAf,QAAAjH,KAAAgF,0BAAA,IAAAiC,QAAAjH,KAAA8E,oCAAA,KAAAqD,QAAA,IAGAC,MAAAH,IAEAjI,KAAAiF,oBAKA,IAAAP,OAAA1E,KAAA4H,2BAAAK,GACA,CASAI,qBAAAL,EAAAM,GAEA,IAAAC,OAAA,IAAAD,EAAA,EAAAA,EAEAE,EAAAN,WAAAF,GAAAG,QAAAI,GACA,GAAAH,MAAAI,GACA,CAEA,OADA,GACAL,QAAAI,EACA,CAGA,OAAAC,CAEA,CAgBAC,kBAAA9C,EAAA2B,GAEA,OAAA3B,EAAAC,MAAA0B,GAAA,EACA,CAWAoB,iBAAA/C,EAAA2B,GAEA,IAAAqB,EAAAhD,EAAAiD,QAAAtB,GAEA,OAAAqB,EAAA,GAAAA,EAAArB,EAAAtG,QAAA2E,EAAA3E,OAEA,GAGA2E,EAAAoB,UAAA4B,EAAArB,EAAAtG,OACA,CAYA6H,sBAAAlD,EAAAmD,EAAAC,GAEA,IAAAC,EAAA,iBAAArD,EAAAA,EAAA,GACAsD,EAAA,iBAAAH,EAAAA,EAAA,IACAI,EAAA,iBAAAH,EAAAA,EAAA,IAEAI,EAAA,EACAC,EAAA,EACA,IAAA,IAAA7I,EAAA,EAAAA,EAAAyI,EAAAhI,OAAAT,IAGAyI,EAAAzI,IAAA0I,GAEA,GAAAG,GAEAD,IAEAC,KAEAJ,EAAAzI,IAAA2I,GAEAE,IAIA,OAAAD,CACA,CAcAE,+BAAA1D,EAAA2D,EAAAR,EAAAC,GAEA,IAAAC,EAAA,iBAAArD,EAAAA,EAAA,GACA4D,EAAA,iBAAAD,EAAAA,EAAA,EACAL,EAAA,iBAAAH,EAAAA,EAAA,IACAI,EAAA,iBAAAH,EAAAA,EAAA,IAEAI,EAAA,EACAC,EAAA,EAEAI,GAAA,EACAC,EAAA,EACAC,EAAA,EAEA,IAAA,IAAAnJ,EAAA,EAAAA,EAAAyI,EAAAhI,OAAAT,IAGAyI,EAAAzI,IAAA0I,GAEAG,IAGA,GAAAA,IAEAD,IACAI,GAAAJ,EAAA,IAGAK,GAAA,EACAC,EAAAlJ,KAKAyI,EAAAzI,IAAA2I,IAEAE,IAGA,GAAAA,GACAI,GACAE,GAAAD,IAEAC,EAAAnJ,EACAiJ,GAAA,IAKA,OAAAL,GAAAI,EAGA,GAGAG,EAAA,GAAAA,EAAAD,EAEAT,EAAAjC,UAAA0C,EAAA,EAAAC,GAIAV,EAAAjC,UAAA0C,EAAA,EAEA,CAYAE,6BAAAhE,EAAAiE,EAAAd,EAAAC,GAEA,IAAAC,EAAA,iBAAArD,EAAAA,EAAA,GACAkE,EAAA,iBAAAD,EAAAA,EAAA,EACAX,EAAA,iBAAAH,EAAAA,EAAA,IACAI,EAAA,iBAAAH,EAAAA,EAAA,IAEAI,EAAA,EACAC,EAAA,EAEAI,GAAA,EACAM,EAAA,EACAC,EAAA,EAEA,IAAA,IAAAxJ,EAAA,EAAAA,EAAAyI,EAAAhI,OAAAT,IAGAyI,EAAAzI,IAAA0I,GAEAG,IAEA,GAAAA,IAEAD,IACAU,GAAAV,EAAA,IAEAK,GAAA,EACAM,EAAAvJ,KAIAyI,EAAAzI,IAAA2I,IAEAE,IAEA,GAAAA,GACAI,GACAO,GAAAD,IAEAC,EAAAxJ,EACAiJ,GAAA,IAKA,GAAAL,GAAAU,EAEA,OAAAb,EAGA,IAAAgB,EAAA,GAYA,OAVAF,EAAA,IAEAE,EAAAhB,EAAAjC,UAAA,EAAA+C,IAGAd,EAAAhI,OAAA+I,EAAA,GAAAA,EAAAD,IAEAE,GAAAhB,EAAAjC,UAAAgD,EAAA,IAGAC,CACA,EjB+QA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASvJ,EAAQf,EAAOD,GkBxrBlCC,EAAAD;;;;;;;;AApFA,MAEAkF,YAAAsF,EAAAC,GAGAlK,KAAAmK,UAAA,iBAAAF,EAAAA,EAAA,CAAA,EAKAjK,KAAAoK,WAAApK,KAAAqK,uBAIArK,KAAAsK,OACA,CACA,QACA,QACA,OACA,OACA,QACA,QAEA,CAGAD,uBAEA,IAAAE,GAAA,IAAAC,MAAAC,UAWA,MAVA,0BAAAxD,QAAA,SACAyD,IAIA,IAAAC,GAAAJ,EAAA,GAAAvG,KAAA4G,UAAA,GAAA,EAGA,OAFAL,EAAAvG,KAAA6G,MAAAN,EAAA,KAEA,KAAAG,EAAAC,EAAA,EAAAA,EAAA,GAAArH,SAAA,GAAA,GAGA,CAEAwH,aAEA,CAGAC,MAAAC,EAAAC,GAEAjL,KAAAkL,MAAA,QAAAF,EAAAC,EACA,CAEAE,MAAAH,EAAAC,GAEAjL,KAAAkL,MAAA,QAAAF,EAAAC,EACA,CAEAG,KAAAJ,EAAAC,GAEAjL,KAAAkL,MAAA,OAAAF,EAAAC,EACA,CAEAI,KAAAL,EAAAC,GAEAjL,KAAAkL,MAAA,OAAAF,EAAAC,EACA,CAEAK,MAAAN,EAAAC,GAEAjL,KAAAkL,MAAA,QAAAF,EAAAC,EACA,CAEAM,MAAAP,EAAAC,GAEAjL,KAAAkL,MAAA,QAAAF,EAAAC,EACA,CAEAC,MAAAM,EAAAR,EAAAC,GAGA,OAAA,CACA,ElB0xBA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASxK,EAAQf,EAAOD,GmB/1BlCC,EAAAD,QAXAgM,MAEA,IAAAC,EAAA,CAAA,EAMA,OAJAA,EAAAC,QAAAlL,EAAA,iCAEAiL,EAAAE,QAAAF,EAAAC,QAEAD,CAAA,EAGAD,EnBq3BA,EAAE,CAAC,gCAAgC,KAAK,GAAG,CAAC,SAAShL,EAAQf,EAAOD,GoBz4BpEC,EAAAD,QAAA,CACA,CACAoM,WAAA,UACAC,WAAA,UACAC,MAAA,SpB64BA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAStL,EAAQf,EAAOD,GqBj5BlC,IAAAuM,EAAAvL,EAAA,6BA+DAf,EAAAD,QA7DA,cAAAuM,EAEArH,YAAAsF,EAAAC,GAEA+B,MAAAhC,GAEAjK,KAAAkM,iBAAAlM,KAAAmK,UAAAtG,eAAA,mBAAA,GAAA7D,KAAAmK,UAAAgC,eACAnM,KAAAoM,sBAAApM,KAAAmK,UAAAtG,eAAA,wBAAA,GAAA7D,KAAAmK,UAAAkC,oBAEArM,KAAAsM,gBAAAtM,KAAAmK,UAAAtG,eAAA,WAAA,IAAAa,OAAA1E,KAAAmK,UAAAoC,QAAA,KACArC,EAAAC,UAAAtG,eAAA,WAAA,IAAAa,OAAAwF,EAAAC,UAAAqC,QAAA,KACA,sBAGAxM,KAAAyM,0BAAAzM,KAAAmK,UAAAtG,eAAA,4BAAA7D,KAAAmK,UAAAuC,wBACA1M,KAAA2M,yBAAA3M,KAAAmK,UAAAtG,eAAA,2BAAA7D,KAAAmK,UAAAyC,uBAGA5M,KAAA6M,YAAA,CAAA,EACA,IAAA,IAAAtM,EAAA,EAAAA,GAAAP,KAAAsK,OAAAtJ,OAAAT,IAEAP,KAAA6M,YAAA7M,KAAAsK,OAAA/J,IAAA,IAAAmE,OAAA1E,KAAAsK,OAAA/J,GAAA,MAAAmE,OAAA1E,KAAAsM,gBAAA,MAEAtM,KAAAkM,kBAGAlM,KAAA6M,YAAA7M,KAAAsK,OAAA/J,IAAA,IAAAP,KAAA6M,YAAA7M,KAAAsK,OAAA/J,IAGA,CAEA2K,MAAA4B,EAAA9B,EAAA+B,GAEA,IAAAC,EAAA,GACAhN,KAAAkM,iBAAAlM,KAAAoM,qBAEAY,GAAA,IAAAxC,MAAAyC,cAEAjN,KAAAkM,kBAEAc,GAAA,IAAAxC,MAGA,IAAA0C,EAAA,GAAAxI,OAAAsI,GAAAtI,OAAA1E,KAAA6M,YAAAC,IAAApI,OAAAsG,GAcA,OAZAhL,KAAAyM,0BAEAd,QAAAwB,IAAAD,GAIAlN,KAAA2M,8BAAA,IAAAI,GAEApB,QAAAwB,IAAAC,KAAAC,UAAAN,EAAA,KAAA,IAIAG,CACA,ErBs5BA,EAAE,CAAC,4BAA4B,KAAK,GAAG,CAAC,SAASzM,EAAQf,EAAOD,GsBl9BhE,MAAA6N,EAAA7M,EAAA,iCACA8M,EAAA9M,EAAA,MACA+M,EAAA/M,EAAA,QAqHAf,EAAAD,QAnHA,cAAA6N,EAEA3I,YAAAsF,EAAAC,GAEA+B,MAAAhC,EAAAC,GAGAlK,KAAAyN,eAAAzN,KAAAmK,UAAAtG,eAAA,QAAA7D,KAAAmK,UAAAuD,KAAA,KAAAhJ,OAAA1E,KAAAsM,gBAAA,QACAtM,KAAA2N,YAAAH,EAAAI,UAAA5N,KAAAyN,gBAEAzN,KAAA6N,qBAAA7N,KAAAmK,UAAAtG,eAAA,qBAAA7D,KAAAmK,UAAA2D,kBACA,CACAC,MAAA,IACAC,SAAA,QAGAhO,KAAAiO,WAAAV,EAAAW,kBAAAlO,KAAA2N,YAAA3N,KAAA6N,sBAEA7N,KAAAmO,iBAAA,EAEAnO,KAAAoO,eAAA,GACApO,KAAAqO,iBAAA,GAEArO,KAAAsO,6BAAA,OACAtO,KAAAuO,2BAAA,MACA,CAEAC,YAAAC,GAEA,IAAAC,EAAA,mBAAAD,EAAAA,EAAA,OACA,GAAAzO,KAAAiO,WAGA,OADAjO,KAAAiO,WAAAU,IAAA,MACA3O,KAAAiO,WAAAnM,KAAA,SAAA4M,EAAA5G,KAAA9H,MAEA,CAEA4O,6BAAAC,GAEA7O,KAAAmO,iBAAA,EACA,IAAAW,EAAA,mBAAAD,EAAAA,EAAA7O,KAAAuO,2BAEA,KAAAvO,KAAAoO,eAAApN,OAAA,GAMA,OAAA8N,IAJA9O,KAAA+O,qBAAAD,EAMA,CAEAC,qBAAAF,GAEA,IAAA7O,KAAAmO,gBACA,CAEAnO,KAAAmO,iBAAA,EAEA,IAAAW,EAAA,mBAAAD,EAAAA,EAAA7O,KAAAuO,2BAGAS,EAAAhP,KAAAoO,eACAa,EAAAjP,KAAAqO,iBAGArO,KAAAoO,eAAA,GACApO,KAAAqO,iBAAA,GAGA,IAAAa,EAAA,GAEA,IAAA,IAAA3O,EAAA,EAAAA,EAAAyO,EAAAhO,OAAAT,IAGA2O,GAAA,GAAAxK,OAAAsK,EAAAzO,GAAA,OACA,IAAA0O,EAAA1O,KAEA2O,GAAA,GAAAxK,OAAAuK,EAAA1O,GAAA,OAIA,GAAAP,KAAAiO,WAAA/C,MAAAgE,EAAA,QAOA,OAAAlP,KAAA4O,6BAAAE,GAJA9O,KAAAiO,WAAAnM,KAAA,QAAA9B,KAAA4O,6BAAA9G,KAAA9H,KAAA8O,GAMA,CACA,CAEA5D,MAAA4B,EAAA9B,EAAA+B,GAEA,IAAAG,EAAAjB,MAAAf,MAAA4B,EAAA9B,EAAA+B,GAGA/M,KAAAoO,eAAArL,KAAAmK,QAGA,IAAAH,EAEA/M,KAAAqO,iBAAAtL,KAAAqK,KAAAC,UAAAN,EAAA,KAAA,IAIA/M,KAAAqO,iBAAAtL,MAAA,GAGA/C,KAAA+O,sBACA,EtBu9BA,EAAE,CAAC,gCAAgC,GAAGI,GAAK,GAAGzB,KAAO,KAAK,GAAG,CAAC,SAASjN,EAAQf,EAAOD;;;;;;;;;AuB5jCtF,MAAA2P,EAEAzK,YAAA0K,EAAAC,GAEA,IAAAC,EAAA,iBAAAF,EAAAA,EAAA,CAAA,EACArP,KAAAmK,UAAAoF,EAEAvP,KAAAwP,WAAA/O,EAAA,wCAEAT,KAAAyP,mBAAAF,EAAA1L,eAAA,cAAA0L,EAAAG,WAAAjP,EAAA,mCAEAT,KAAA2P,WAAA,GAIA3P,KAAA4P,aAAA,CAAA,EAGA5P,KAAA6P,iBAAA,CAAA,EAEA7P,KAAA8P,gBAAA,GACA9P,KAAA+P,gBAAA,GACA/P,KAAAgQ,eAAA,GACAhQ,KAAAiQ,eAAA,GACAjQ,KAAAkQ,gBAAA,GACAlQ,KAAAmQ,gBAAA,GAEAnQ,KAAAoQ,eAAAC,GAAAA,EAEArQ,KAAAsQ,KAAA,iBAAAf,EAAA/C,QAAA+C,EAAA/C,QAAA,SACA,CAEA+D,UAAAC,EAAA1D,GAGA,GAAA9M,KAAA6P,iBAAAhM,eAAA2M,EAAApG,YAEA,OAAA,EAQA,OAJApK,KAAA2P,WAAA5M,KAAAyN,GACAxQ,KAAA6P,iBAAAW,EAAApG,aAAA,EAGA0C,GAEA,IAAA,QACA9M,KAAA8P,gBAAA/M,KAAAyN,GACA,IAAA,QACAxQ,KAAA+P,gBAAAhN,KAAAyN,GACA,IAAA,OACAxQ,KAAAgQ,eAAAjN,KAAAyN,GACA,IAAA,OACAxQ,KAAAiQ,eAAAlN,KAAAyN,GACA,IAAA,QACAxQ,KAAAkQ,gBAAAnN,KAAAyN,GACA,IAAA,QACAxQ,KAAAmQ,gBAAApN,KAAAyN,GAIA,OAAA,CACA,CAEAC,kBAAAC,GAIA1Q,KAAAoQ,eAFA,mBAAAM,EAEAA,EAIAL,GAAAA,CAEA,CAEAtF,MAAA4F,EAAAN,GAEA,MAAAO,EAAA5Q,KAAAoQ,eAAAC,GACA,IAAA,IAAA9P,EAAA,EAAAA,EAAAP,KAAA8P,gBAAA9O,OAAAT,IAEAP,KAAA8P,gBAAAvP,GAAAwK,MAAA4F,EAAAC,EAEA,CAEAzF,MAAAwF,EAAAN,GAEA,MAAAO,EAAA5Q,KAAAoQ,eAAAC,GACA,IAAA,IAAA9P,EAAA,EAAAA,EAAAP,KAAA+P,gBAAA/O,OAAAT,IAEAP,KAAA+P,gBAAAxP,GAAA4K,MAAAwF,EAAAC,EAEA,CAEAxF,KAAAuF,EAAAN,GAEA,MAAAO,EAAA5Q,KAAAoQ,eAAAC,GACA,IAAA,IAAA9P,EAAA,EAAAA,EAAAP,KAAAgQ,eAAAhP,OAAAT,IAEAP,KAAAgQ,eAAAzP,GAAA6K,KAAAuF,EAAAC,EAEA,CAEAvF,KAAAsF,EAAAN,GAEA,MAAAO,EAAA5Q,KAAAoQ,eAAAC,GACA,IAAA,IAAA9P,EAAA,EAAAA,EAAAP,KAAAiQ,eAAAjP,OAAAT,IAEAP,KAAAiQ,eAAA1P,GAAA8K,KAAAsF,EAAAC,EAEA,CAEAtF,MAAAqF,EAAAN,GAEA,MAAAO,EAAA5Q,KAAAoQ,eAAAC,GACA,IAAA,IAAA9P,EAAA,EAAAA,EAAAP,KAAAkQ,gBAAAlP,OAAAT,IAEAP,KAAAkQ,gBAAA3P,GAAA+K,MAAAqF,EAAAC,EAEA,CAEArF,MAAAoF,EAAAN,GAEA,MAAAO,EAAA5Q,KAAAoQ,eAAAC,GACA,IAAA,IAAA9P,EAAA,EAAAA,EAAAP,KAAAmQ,gBAAAnP,OAAAT,IAEAP,KAAAmQ,gBAAA5P,GAAAgL,MAAAoF,EAAAC,EAEA,CAEA9F,aAGA,IAAA,IAAAvK,EAAA,EAAAA,EAAAP,KAAAyP,mBAAAzO,OAAAT,IACA,CACA,IAAAsQ,EAAAzN,OAAA0N,OAAA,CAAAjF,WAAA,UAAAC,WAAA,UAAAC,MAAA,QAAA/L,KAAAyP,mBAAAlP,IAEAP,KAAAwP,WAAA3L,eAAAgN,EAAAhF,YAMA7L,KAAAuQ,UAAA,IAAAvQ,KAAAwP,WAAAqB,EAAAhF,YAAAgF,EAAA7Q,MAAA6Q,EAAA9E,OAJAJ,QAAAwB,IAAA,sEAAAzI,OAAA0I,KAAAC,UAAAwD,IAMA,CAGA,IAAA,IAAAtQ,EAAA,EAAAA,EAAAP,KAAA2P,WAAA3O,OAAAT,IAEAP,KAAA2P,WAAApP,GAAAuK,YAEA,CAEAiG,QAAAJ,EAAAN,GAEA,IAAAW,OAAA,IAAAL,EAAAA,EAAA,OACAM,EAAA,IAAAzG,KACAxK,KAAAoL,KAAA,GAAA1G,OAAAsM,EAAA,KAAAtM,OAAAuM,EAAA,YAAAvM,QAAAuM,EAAA,KAAAZ,EACA,CAGAa,eAEA,OAAA,IAAA1G,IACA,CAEA2G,aAAAC,GAGA,OADA,IAAA5G,KACA4G,CACA,CAGAC,aAAAC,EAAAX,EAAAN,GAEA,IAAAW,OAAA,IAAAL,EAAAA,EAAA,mBAGAY,GAAA,IAAA/G,KAEAxK,KAAAoL,KAAA,GAAA1G,OAAAsM,EAAA,sBAAAtM,QAAA6M,EAAA,YAAA7M,OAAA4M,EAAA,OAAAjB,EACA,CAEAmB,kBAAAF,EAAAX,EAAAN,GAEA,IAAAW,OAAA,IAAAL,EAAAA,EAAA,mBAEAY,GAAA,IAAA/G,KAEAiH,EAAAC,SAAAJ,EAAA,KACAK,EAAAD,SAAAJ,EAAA,IAAA,IACAM,EAAAF,SAAAJ,EAAA,IAAA,IACAO,EAAAH,SAAAJ,EAAA,MAEAG,EAAAA,EAAA,GAAA,KAAAA,EAAAA,EAAA,IAAA,IAAAA,EAAAA,EACAE,EAAAA,EAAA,GAAA,IAAAA,EAAAA,EACAC,EAAAA,EAAA,GAAA,IAAAA,EAAAA,EACAC,EAAAA,EAAA,GAAA,IAAAA,EAAAA,EAEA7R,KAAAoL,KAAA,GAAA1G,OAAAsM,EAAA,sBAAAtM,QAAA6M,EAAA,YAAA7M,OAAA4M,EAAA,YAAA5M,OAAAmN,EAAA,KAAAnN,OAAAkN,EAAA,KAAAlN,OAAAiN,EAAA,KAAAjN,OAAA+M,EAAA,KAAApB,EACA,CAEAyB,qBAAAC,EAAApB,EAAAN,GAEArQ,KAAAqR,aAAArR,KAAAmR,aAAAY,GAAApB,EAAAN,EACA,CAEA2B,0BAAAD,EAAApB,EAAAN,GAEArQ,KAAAwR,kBAAAxR,KAAAmR,aAAAY,GAAApB,EAAAN,EACA,EAUA3Q,EAAAD,QAAA2P,EACA1P,EAAAD,QAAAwS,IAPA,SAAAC,GAEA,OAAA,IAAA9C,EAAA8C,EACA,EAKAxS,EAAAD,QAAA0S,gBAAA1R,EAAA,6BACAf,EAAAD,QAAA2S,mBAAA3R,EAAA,iCACAf,EAAAD,QAAA2S,mBAAA3R,EAAA,uCvB8kCA,EAAE,CAAC,4BAA4B,GAAG,uCAAuC,GAAG,kCAAkC,GAAG,gCAAgC,GAAG,uCAAuC,KAAK,GAAG,CAAC,SAASA,EAAQf,EAAOD,GwB/zC5NC,EAAAD,QAAA,CACA+M,QAAA,sBACA6F,eAAA,QAEAC,YAAA,EAEA5C,WACA,CACA,CACA3D,MAAA,UxBq0CA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAStL,EAAQf,EAAOD,IAClC,SAAW8S,IAAS,WyB/xCpB7S,EAAAD;;;;;;;;;;;AArCA,MAEAkF,YAAA6N,GAGAxS,KAAAyS,kBAAA,IAAAD,EAAAE,UAGA1S,KAAAyS,kBAAAE,WAAA,KAAA,KACAC,IAEA,IAAAC,EAAAD,EAAAE,OAEAC,EAAAF,EAAAjK,QAAA,KAGAoK,EAAAH,EAAA9L,UAAAgM,EAAA,GAEAE,EAAAF,GAAA,EAAAF,EAAA9L,UAAA,EAAAgM,GAAAF,EAEA,OAAAN,EAAAW,IAAArP,eAAAoP,GAEAV,EAAAW,IAAAD,GAIAD,CACA,GAEA,CAEAG,aAAAxN,GAEA,OAAA3F,KAAAyS,kBAAAW,YAAAzN,EACA,EzBo1CC,GAAE5E,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAElC,EAAE,CAAC4S,SAAW,KAAK,GAAG,CAAC,SAAS5S,EAAQf,EAAOD;;;;;;;;;A0B13C/C,MAAA6T,EAAA7S,EAAA,aACA8S,EAAA9S,EAAA,yCAEA,MAAA+S,EAEA7O,YAAA0K,GAGArP,KAAAyT,aACA,CACAf,UAAAY,GAIAtT,KAAA0T,0BAAA,IAAAH,EAAAvT,KAAAyT,cAGAzT,KAAA2T,wBAAAtE,GAEArP,KAAA4L,QAAA5L,KAAA4T,uBAGA,IAAArE,EAAAvP,KAAA6T,MAAAxE,EAAArP,KAAA4T,wBAKA,GAFA5T,KAAA8T,KAAA1G,KAAA2G,MAAA3G,KAAAC,UAAAkC,IAEAA,EAAAyE,kBAEA,IAGAzE,EAAAvP,KAAA6T,MAAApT,EAAA8O,EAAAyE,mBAAAzE,EACA,CACA,MAAA0E,GAIAtI,QAAAwB,IAAA,2HACAxB,QAAAwB,IAAA,2BAAA8G,EACA,CAGA,GAAA1E,EAAA+C,WAEA,IAGA/C,EAAAvP,KAAA6T,MAAApT,EAAA8O,EAAA+C,YAAA/C,EACA,CACA,MAAA0E,GAIAtI,QAAAwB,IAAA,mHACAxB,QAAAwB,IAAA,2BAAA8G,EACA,CAGAjU,KAAAkU,SAAA3E,CACA,CAGAqE,uBAEA,OAAAxG,KAAA2G,MAAA3G,KAAAC,UAAA5M,EAAA,6BACA,CAGAkT,wBAAAzB,GAGAlS,KAAAmU,uBAAAjC,IAAA,IAAAA,EAAAkC,gBACA,CAGAC,YAAAnC,GAEA,IAAA,MAAAoC,KAAApC,EAEA,iBAAAA,EAAAoC,GAEAtU,KAAAqU,YAAAnC,EAAAoC,IAEA,iBAAApC,EAAAoC,KAEApC,EAAAoC,GAAAtU,KAAA0T,0BAAAP,aAAAjB,EAAAoC,IAGA,CAKAC,UAAAhQ,GAEA,MAAA,iBAAAA,IAAArB,MAAAC,QAAAoB,EACA,CAKAiQ,kBAAAC,EAAAC,GAEA,GAAAA,GAAA1U,KAAAuU,UAAAG,GAmBA,OAfAtR,OAAAO,KAAA+Q,GAAAC,SAAAnS,IAEA,MAAAoS,EAAAF,EAAAlS,GACA,GAAAxC,KAAAuU,UAAAK,GACA,CACA,MAAAC,EAAAJ,EAAAjS,GACA,GAAAqS,GAAA7U,KAAAuU,UAAAM,GAIA,YADA7U,KAAAwU,kBAAAK,EAAAD,EAGA,CACAH,EAAAjS,GAAAoS,CAAA,IAEAH,CACA,CAGAZ,MAAAiB,EAAAC,GAGA,IAAAC,EAAA,iBAAAF,EAAAA,EAAA,CAAA,EAEAG,EAAA,iBAAAF,EAAAA,EAAA/U,KAAAkU,SAGAgB,EAAA9H,KAAA2G,MAAA3G,KAAAC,UAAA2H,IAUA,OATAC,EAAAjV,KAAAwU,kBAAAS,EAAAC,GAEAlV,KAAAmU,uBAEAnU,KAAAqU,YAAAY,GAGAjV,KAAA2T,wBAAAsB,GAEAA,CACA,CAGAE,KAAAL,GAGA,IAAAE,EAAA,iBAAAF,EAAAA,EAAA,CAAA,EAGAI,EAAA9H,KAAA2G,MAAA3G,KAAAC,UAAA2H,IAIA,OAFAhV,KAAAkU,SAAAlU,KAAAwU,kBAAAU,EAAAlV,KAAAkU,UAEAlU,KAAAkU,QACA,EASAxU,EAAAD,QAAA+T,EACA9T,EAAAD,QAAAwS,IANA,SAAAC,GAEA,OAAA,IAAAsB,EAAAtB,EACA,EAIAxS,EAAAD,QAAAiT,UAAAY,C1Bq4CA,EAAE,CAAC,2BAA2B,GAAG,wCAAwC,GAAGZ,UAAY,KAAK,GAAG,CAAC,SAASjS,EAAQf,EAAOD,G2Bv/CzHC,EAAAD;;;;;;;;AArDA,MAEAkF,cAKA3E,KAAAoV,gBAAA,oBAAAC,QAAAA,OAAAD,iBAAAC,OAAAD,gBAAAtN,KAAAuN,SACA,oBAAAC,UAAA,mBAAAzV,OAAAyV,SAAAF,iBAAAE,SAAAF,gBAAAtN,KAAAwN,SACA,CAGAC,sBAEA,IAAAC,EAAA,IAAAC,WAAA,IAGA,OADAzV,KAAAoV,gBAAAI,GACAA,CACA,CAGAE,sBAIA,IAAAF,EAAA,IAAAC,WAAA,IAEA,IAAA,IAAAjN,EAAAjI,EAAA,EAAAA,EAAA,GAAAA,IAEA,IAAA,EAAAA,KAEAiI,EAAA,WAAAxE,KAAA4G,UAGA4K,EAAAjV,GAAAiI,MAAA,EAAAjI,IAAA,GAAA,IAGA,OAAAiV,CACA,CAEAG,WAEA,OAAA3V,KAAAoV,gBAEApV,KAAAuV,sBAIAvV,KAAA0V,qBAEA,E3B+jDA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASjV,EAAQf,EAAOD;;;;;;;;;A4B9mDlC,IAAAmW,EAAAnV,EAAA,0BAEA,MAAAoV,EAEAlR,YAAAuN,GAIAlS,KAAA8V,kBAAA,iBAAA5D,IAAAA,EAAArO,eAAA,oBAAA,GAAAqO,EAAA6D,eAGA/V,KAAAgW,YAAA,iBAAA9D,GAAAA,EAAArO,eAAA,cAAAqO,EAAA+D,WAAA,EAAA,EAEAjW,KAAAkW,sBAAA,iBAAAhE,GAAAA,EAAArO,eAAA,kBAAAqO,EAAAiE,eAAA,EAAA,iEAEAnW,KAAAoW,oBAAA,IAAAR,EAGA5V,KAAAqW,WAAA,GACA,IAAA,IAAA9V,EAAA,EAAAA,EAAA,MAAAA,EAEAP,KAAAqW,WAAA9V,IAAAA,EAAA,KAAA+C,SAAA,IAAAiD,OAAA,EAEA,CAGA+P,YAAAC,GAEA,IAAAhW,EAAA,EAEA,MAAA,CACAP,KAAAqW,WAAAE,EAAAhW,MAAAP,KAAAqW,WAAAE,EAAAhW,MACAP,KAAAqW,WAAAE,EAAAhW,MAAAP,KAAAqW,WAAAE,EAAAhW,MAAA,IACAP,KAAAqW,WAAAE,EAAAhW,MAAAP,KAAAqW,WAAAE,EAAAhW,MAAA,IACAP,KAAAqW,WAAAE,EAAAhW,MAAAP,KAAAqW,WAAAE,EAAAhW,MAAA,IACAP,KAAAqW,WAAAE,EAAAhW,MAAAP,KAAAqW,WAAAE,EAAAhW,MAAA,IACAP,KAAAqW,WAAAE,EAAAhW,MAAAP,KAAAqW,WAAAE,EAAAhW,MAAAP,KAAAqW,WAAAE,EAAAhW,MAAAP,KAAAqW,WAAAE,EAAAhW,MAAAP,KAAAqW,WAAAE,EAAAhW,MAAAP,KAAAqW,WAAAE,EAAAhW,OACAuF,KAAA,GACA,CAGA0Q,iBAEA,IAAAtT,MAAA,IACA,IAAAuT,EAAAzW,KAAAoW,oBAAAT,WAMA,OAHAc,EAAA,GAAA,GAAAA,EAAA,GAAA,GACAA,EAAA,GAAA,GAAAA,EAAA,GAAA,IAEAzW,KAAAsW,YAAAG,EACA,CAGAC,iBAEA,IAAAC,EAAA,GAEA,IAAA,IAAApW,EAAA,EAAAA,EAAAP,KAAAgW,YAAAzV,IAEAoW,GAAA3W,KAAAkW,sBAAAU,OAAA5S,KAAA6G,MAAA7G,KAAA4G,UAAA5K,KAAAkW,sBAAAlV,OAAA,KAGA,OAAA2V,CACA,CAGAE,UAEA,OAAA7W,KAAA8V,gBAEA9V,KAAA0W,iBAIA1W,KAAAwW,gBAEA,EAUA9W,EAAAD,QAAAoW,EACAnW,EAAAD,QAAAwS,IAPA,SAAAC,GAEA,OAAA,IAAA2D,EAAA3D,EACA,C5BqoDA,EAAE,CAAC,yBAAyB,KAAK,GAAG,CAAC,SAASzR,EAAQf,EAAOD,IAC7D,SAAW8S,IAAS,W6BhtDpB,SAAAuE,EAAApJ,GACA,GAAA,iBAAAA,EACA,MAAA,IAAAqJ,UAAA,mCAAA3J,KAAAC,UAAAK,GAEA,CAGA,SAAAsJ,EAAAtJ,EAAAuJ,GAMA,IALA,IAIApW,EAJAqW,EAAA,GACAC,EAAA,EACAC,GAAA,EACAC,EAAA,EAEA9W,EAAA,EAAAA,GAAAmN,EAAA1M,SAAAT,EAAA,CACA,GAAAA,EAAAmN,EAAA1M,OACAH,EAAA6M,EAAA9G,WAAArG,OACA,IAAA,KAAAM,EACA,MAEAA,EAAA,EAAA,CACA,GAAA,KAAAA,EAAA,CACA,GAAAuW,IAAA7W,EAAA,GAAA,IAAA8W,QAEA,GAAAD,IAAA7W,EAAA,GAAA,IAAA8W,EAAA,CACA,GAAAH,EAAAlW,OAAA,GAAA,IAAAmW,GAAA,KAAAD,EAAAtQ,WAAAsQ,EAAAlW,OAAA,IAAA,KAAAkW,EAAAtQ,WAAAsQ,EAAAlW,OAAA,GACA,GAAAkW,EAAAlW,OAAA,EAAA,CACA,IAAAsW,EAAAJ,EAAAK,YAAA,KACA,GAAAD,IAAAJ,EAAAlW,OAAA,EAAA,EACA,IAAAsW,GACAJ,EAAA,GACAC,EAAA,GAGAA,GADAD,EAAAA,EAAA/Q,MAAA,EAAAmR,IACAtW,OAAA,EAAAkW,EAAAK,YAAA,KAEAH,EAAA7W,EACA8W,EAAA,EACA,QACA,CACA,MAAA,GAAA,IAAAH,EAAAlW,QAAA,IAAAkW,EAAAlW,OAAA,CACAkW,EAAA,GACAC,EAAA,EACAC,EAAA7W,EACA8W,EAAA,EACA,QACA,CAEAJ,IACAC,EAAAlW,OAAA,EACAkW,GAAA,MAEAA,EAAA,KACAC,EAAA,EAEA,MACAD,EAAAlW,OAAA,EACAkW,GAAA,IAAAxJ,EAAAvH,MAAAiR,EAAA,EAAA7W,GAEA2W,EAAAxJ,EAAAvH,MAAAiR,EAAA,EAAA7W,GACA4W,EAAA5W,EAAA6W,EAAA,EAEAA,EAAA7W,EACA8W,EAAA,CACA,MAAA,KAAAxW,IAAA,IAAAwW,IACAA,EAEAA,GAAA,CAEA,CACA,OAAAH,CACA,CAcA,IAAAM,EAAA,CAEAC,QAAA,WAKA,IAJA,IAEAC,EAFAC,EAAA,GACAC,GAAA,EAGArX,EAAAqB,UAAAZ,OAAA,EAAAT,IAAA,IAAAqX,EAAArX,IAAA,CACA,IAAAmN,EACAnN,GAAA,EACAmN,EAAA9L,UAAArB,SAEAsX,IAAAH,IACAA,EAAAnF,EAAAmF,OACAhK,EAAAgK,GAGAZ,EAAApJ,GAGA,IAAAA,EAAA1M,SAIA2W,EAAAjK,EAAA,IAAAiK,EACAC,EAAA,KAAAlK,EAAA9G,WAAA,GACA,CAQA,OAFA+Q,EAAAX,EAAAW,GAAAC,GAEAA,EACAD,EAAA3W,OAAA,EACA,IAAA2W,EAEA,IACAA,EAAA3W,OAAA,EACA2W,EAEA,GAEA,EAEA/J,UAAA,SAAAF,GAGA,GAFAoJ,EAAApJ,GAEA,IAAAA,EAAA1M,OAAA,MAAA,IAEA,IAAA8W,EAAA,KAAApK,EAAA9G,WAAA,GACAmR,EAAA,KAAArK,EAAA9G,WAAA8G,EAAA1M,OAAA,GAQA,OAHA,KAFA0M,EAAAsJ,EAAAtJ,GAAAoK,IAEA9W,QAAA8W,IAAApK,EAAA,KACAA,EAAA1M,OAAA,GAAA+W,IAAArK,GAAA,KAEAoK,EAAA,IAAApK,EACAA,CACA,EAEAoK,WAAA,SAAApK,GAEA,OADAoJ,EAAApJ,GACAA,EAAA1M,OAAA,GAAA,KAAA0M,EAAA9G,WAAA,EACA,EAEAd,KAAA,WACA,GAAA,IAAAlE,UAAAZ,OACA,MAAA,IAEA,IADA,IAAAgX,EACAzX,EAAA,EAAAA,EAAAqB,UAAAZ,SAAAT,EAAA,CACA,IAAA0X,EAAArW,UAAArB,GACAuW,EAAAmB,GACAA,EAAAjX,OAAA,SACA6W,IAAAG,EACAA,EAAAC,EAEAD,GAAA,IAAAC,EAEA,CACA,YAAAJ,IAAAG,EACA,IACAR,EAAA5J,UAAAoK,EACA,EAEAE,SAAA,SAAAC,EAAAC,GAIA,GAHAtB,EAAAqB,GACArB,EAAAsB,GAEAD,IAAAC,EAAA,MAAA,GAKA,IAHAD,EAAAX,EAAAC,QAAAU,OACAC,EAAAZ,EAAAC,QAAAW,IAEA,MAAA,GAIA,IADA,IAAAC,EAAA,EACAA,EAAAF,EAAAnX,QACA,KAAAmX,EAAAvR,WAAAyR,KADAA,GASA,IALA,IAAAC,EAAAH,EAAAnX,OACAuX,EAAAD,EAAAD,EAGAG,EAAA,EACAA,EAAAJ,EAAApX,QACA,KAAAoX,EAAAxR,WAAA4R,KADAA,GAWA,IAPA,IACAC,EADAL,EAAApX,OACAwX,EAGAxX,EAAAuX,EAAAE,EAAAF,EAAAE,EACAC,GAAA,EACAnY,EAAA,EACAA,GAAAS,IAAAT,EAAA,CACA,GAAAA,IAAAS,EAAA,CACA,GAAAyX,EAAAzX,EAAA,CACA,GAAA,KAAAoX,EAAAxR,WAAA4R,EAAAjY,GAGA,OAAA6X,EAAAjS,MAAAqS,EAAAjY,EAAA,GACA,GAAA,IAAAA,EAGA,OAAA6X,EAAAjS,MAAAqS,EAAAjY,EAEA,MAAAgY,EAAAvX,IACA,KAAAmX,EAAAvR,WAAAyR,EAAA9X,GAGAmY,EAAAnY,EACA,IAAAA,IAGAmY,EAAA,IAGA,KACA,CACA,IAAAC,EAAAR,EAAAvR,WAAAyR,EAAA9X,GAEA,GAAAoY,IADAP,EAAAxR,WAAA4R,EAAAjY,GAEA,MACA,KAAAoY,IACAD,EAAAnY,EACA,CAEA,IAAAqY,EAAA,GAGA,IAAArY,EAAA8X,EAAAK,EAAA,EAAAnY,GAAA+X,IAAA/X,EACAA,IAAA+X,GAAA,KAAAH,EAAAvR,WAAArG,KACA,IAAAqY,EAAA5X,OACA4X,GAAA,KAEAA,GAAA,OAMA,OAAAA,EAAA5X,OAAA,EACA4X,EAAAR,EAAAjS,MAAAqS,EAAAE,IAEAF,GAAAE,EACA,KAAAN,EAAAxR,WAAA4R,MACAA,EACAJ,EAAAjS,MAAAqS,GAEA,EAEAK,UAAA,SAAAnL,GACA,OAAAA,CACA,EAEAoL,QAAA,SAAApL,GAEA,GADAoJ,EAAApJ,GACA,IAAAA,EAAA1M,OAAA,MAAA,IAKA,IAJA,IAAAH,EAAA6M,EAAA9G,WAAA,GACAmS,EAAA,KAAAlY,EACA8N,GAAA,EACAqK,GAAA,EACAzY,EAAAmN,EAAA1M,OAAA,EAAAT,GAAA,IAAAA,EAEA,GAAA,MADAM,EAAA6M,EAAA9G,WAAArG,KAEA,IAAAyY,EAAA,CACArK,EAAApO,EACA,KACA,OAGAyY,GAAA,EAIA,OAAA,IAAArK,EAAAoK,EAAA,IAAA,IACAA,GAAA,IAAApK,EAAA,KACAjB,EAAAvH,MAAA,EAAAwI,EACA,EAEAsK,SAAA,SAAAvL,EAAAwL,GACA,QAAArB,IAAAqB,GAAA,iBAAAA,EAAA,MAAA,IAAAnC,UAAA,mCACAD,EAAApJ,GAEA,IAGAnN,EAHA4Y,EAAA,EACAxK,GAAA,EACAqK,GAAA,EAGA,QAAAnB,IAAAqB,GAAAA,EAAAlY,OAAA,GAAAkY,EAAAlY,QAAA0M,EAAA1M,OAAA,CACA,GAAAkY,EAAAlY,SAAA0M,EAAA1M,QAAAkY,IAAAxL,EAAA,MAAA,GACA,IAAA0L,EAAAF,EAAAlY,OAAA,EACAqY,GAAA,EACA,IAAA9Y,EAAAmN,EAAA1M,OAAA,EAAAT,GAAA,IAAAA,EAAA,CACA,IAAAM,EAAA6M,EAAA9G,WAAArG,GACA,GAAA,KAAAM,GAGA,IAAAmY,EAAA,CACAG,EAAA5Y,EAAA,EACA,KACA,OAEA,IAAA8Y,IAGAL,GAAA,EACAK,EAAA9Y,EAAA,GAEA6Y,GAAA,IAEAvY,IAAAqY,EAAAtS,WAAAwS,IACA,KAAAA,IAGAzK,EAAApO,IAKA6Y,GAAA,EACAzK,EAAA0K,GAIA,CAGA,OADAF,IAAAxK,EAAAA,EAAA0K,GAAA,IAAA1K,IAAAA,EAAAjB,EAAA1M,QACA0M,EAAAvH,MAAAgT,EAAAxK,EACA,CACA,IAAApO,EAAAmN,EAAA1M,OAAA,EAAAT,GAAA,IAAAA,EACA,GAAA,KAAAmN,EAAA9G,WAAArG,IAGA,IAAAyY,EAAA,CACAG,EAAA5Y,EAAA,EACA,KACA,OACA,IAAAoO,IAGAqK,GAAA,EACArK,EAAApO,EAAA,GAIA,OAAA,IAAAoO,EAAA,GACAjB,EAAAvH,MAAAgT,EAAAxK,EAEA,EAEA2K,QAAA,SAAA5L,GACAoJ,EAAApJ,GAQA,IAPA,IAAA6L,GAAA,EACAC,EAAA,EACA7K,GAAA,EACAqK,GAAA,EAGAS,EAAA,EACAlZ,EAAAmN,EAAA1M,OAAA,EAAAT,GAAA,IAAAA,EAAA,CACA,IAAAM,EAAA6M,EAAA9G,WAAArG,GACA,GAAA,KAAAM,GASA,IAAA8N,IAGAqK,GAAA,EACArK,EAAApO,EAAA,GAEA,KAAAM,GAEA,IAAA0Y,EACAA,EAAAhZ,EACA,IAAAkZ,IACAA,EAAA,IACA,IAAAF,IAGAE,GAAA,QArBA,IAAAT,EAAA,CACAQ,EAAAjZ,EAAA,EACA,KACA,CAoBA,CAEA,OAAA,IAAAgZ,IAAA,IAAA5K,GAEA,IAAA8K,GAEA,IAAAA,GAAAF,IAAA5K,EAAA,GAAA4K,IAAAC,EAAA,EACA,GAEA9L,EAAAvH,MAAAoT,EAAA5K,EACA,EAEA+K,OAAA,SAAAC,GACA,GAAA,OAAAA,GAAA,iBAAAA,EACA,MAAA,IAAA5C,UAAA,0EAAA4C,GAEA,OAvVA,SAAAC,EAAAD,GACA,IAAAE,EAAAF,EAAAE,KAAAF,EAAAG,KACAhG,EAAA6F,EAAA7F,OAAA6F,EAAAI,MAAA,KAAAJ,EAAAT,KAAA,IACA,OAAAW,EAGAA,IAAAF,EAAAG,KACAD,EAAA/F,EAEA+F,EAAAD,EAAA9F,EALAA,CAMA,CA6UAkG,CAAA,IAAAL,EACA,EAEA5F,MAAA,SAAArG,GACAoJ,EAAApJ,GAEA,IAAAuM,EAAA,CAAAH,KAAA,GAAAD,IAAA,GAAA/F,KAAA,GAAAoF,IAAA,GAAAa,KAAA,IACA,GAAA,IAAArM,EAAA1M,OAAA,OAAAiZ,EACA,IAEAd,EAFAtY,EAAA6M,EAAA9G,WAAA,GACAkR,EAAA,KAAAjX,EAEAiX,GACAmC,EAAAH,KAAA,IACAX,EAAA,GAEAA,EAAA,EAaA,IAXA,IAAAI,GAAA,EACAC,EAAA,EACA7K,GAAA,EACAqK,GAAA,EACAzY,EAAAmN,EAAA1M,OAAA,EAIAyY,EAAA,EAGAlZ,GAAA4Y,IAAA5Y,EAEA,GAAA,MADAM,EAAA6M,EAAA9G,WAAArG,KAUA,IAAAoO,IAGAqK,GAAA,EACArK,EAAApO,EAAA,GAEA,KAAAM,GAEA,IAAA0Y,EAAAA,EAAAhZ,EAAA,IAAAkZ,IAAAA,EAAA,IACA,IAAAF,IAGAE,GAAA,QAlBA,IAAAT,EAAA,CACAQ,EAAAjZ,EAAA,EACA,KACA,CAwCA,OArBA,IAAAgZ,IAAA,IAAA5K,GAEA,IAAA8K,GAEA,IAAAA,GAAAF,IAAA5K,EAAA,GAAA4K,IAAAC,EAAA,GACA,IAAA7K,IACAsL,EAAAnG,KAAAmG,EAAAF,KAAA,IAAAP,GAAA1B,EAAApK,EAAAvH,MAAA,EAAAwI,GAAAjB,EAAAvH,MAAAqT,EAAA7K,KAGA,IAAA6K,GAAA1B,GACAmC,EAAAF,KAAArM,EAAAvH,MAAA,EAAAoT,GACAU,EAAAnG,KAAApG,EAAAvH,MAAA,EAAAwI,KAEAsL,EAAAF,KAAArM,EAAAvH,MAAAqT,EAAAD,GACAU,EAAAnG,KAAApG,EAAAvH,MAAAqT,EAAA7K,IAEAsL,EAAAf,IAAAxL,EAAAvH,MAAAoT,EAAA5K,IAGA6K,EAAA,EAAAS,EAAAJ,IAAAnM,EAAAvH,MAAA,EAAAqT,EAAA,GAAA1B,IAAAmC,EAAAJ,IAAA,KAEAI,CACA,EAEAL,IAAA,IACAM,UAAA,IACAC,MAAA,KACA3C,MAAA,MAGAA,EAAAA,MAAAA,EAEA9X,EAAAD,QAAA+X,C7B6uDC,GAAEzW,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAElC,EAAE,CAAC4S,SAAW,KAAK,GAAG,CAAC,SAAS5S,EAAQf,EAAOD;;;;;;;;;;A8BtvE/C,IAAA2a,EAAA3Z,EAAA,iBACA4Z,EAAA5Z,EAAA,qBA0CAf,EAAAD,QAxCA,MAKAkF,cAEA3E,KAAAsa,SAAA,IAAAF,EAEApa,KAAAua,aAAA,IAAAF,EAEAra,KAAAwa,UAAAxa,KAAAsa,SAAAE,SACA,CAUA7H,WAAA8H,EAAAC,EAAAC,GAEA,OAAA3a,KAAAsa,SAAA3H,WAAA8H,EAAAC,EAAAC,EACA,CASAvH,YAAAzN,EAAAiV,GAEA,OAAA5a,KAAAua,aAAAnH,YAAAzN,EAAA3F,KAAAwa,UAAAI,EACA,E9BqwEA,EAAE,CAAC,oBAAoB,GAAG,gBAAgB,KAAK,GAAG,CAAC,SAASna,EAAQf,EAAOD,G+B1oE3EC,EAAAD;;;;;;;;;;AAlKA,MAKAkF,cAEA,CASAkW,eAAAC,GAEA,MACA,CACAN,UAAAM,EAEAC,OAAA,GACAC,aAAA,GAEAC,SAAA,EAEAC,cAAA,EACAC,yBAAA,GAEA,CAUAC,WAAAC,EAAAC,GAEAA,EAAAJ,aAAAG,EAGAC,EAAAJ,aAAArX,eAAA,gBAGAyX,EAAAL,QAAAK,EAAAJ,aAEA,CAUAK,mBAAA7Q,EAAA4Q,GAEAA,EAAAN,cAAAtQ,CACA,CAQA8Q,kBAAAF,GAEAA,EAAAP,QAAAO,EAAAN,aACAM,EAAAN,aAAA,EACA,CASAS,gBAAAH,EAAAV,GAEAU,EAAAN,aAAAha,QAAAsa,EAAAL,QAAAS,WAAA1a,OAAAsa,EAAAL,QAAAU,aAAA3a,QACAsa,EAAAN,aAAAzU,QAAA+U,EAAAL,QAAAS,WAAA1a,UAAAsa,EAAAL,QAAAS,aAIAJ,EAAAN,aAAAM,EAAAL,QAAAW,MAAAN,EAAAN,aAAAzU,OAAA+U,EAAAL,QAAAU,aAAA3a,OAAAsa,EAAAN,aAAAha,QAAAsa,EAAAL,QAAAU,aAAA3a,OAAAsa,EAAAL,QAAAS,WAAA1a,SAAA4Z,GAEA5a,KAAAwb,kBAAAF,GAEAA,EAAAL,SAAA,EACAK,EAAAJ,cAAA,EAEA,CASAW,eAAAnR,EAAA4Q,EAAAV,IAGAU,EAAAJ,cAAAI,EAAAd,UAAA3W,eAAA6G,IAGA1K,KAAAob,WAAAE,EAAAd,UAAA9P,GAAA4Q,GACAtb,KAAAub,mBAAA7Q,EAAA4Q,IAGAA,EAAAJ,cAGAI,EAAAJ,aAAArX,eAAA6G,IAGA1K,KAAAob,WAAAE,EAAAJ,aAAAxQ,GAAA4Q,GAEAtb,KAAAub,mBAAA7Q,EAAA4Q,GACAA,EAAAL,SAGAjb,KAAAyb,gBAAAH,EAAAV,IAMAU,EAAAP,QAAArQ,CAEA,CASA0I,YAAAzN,EAAAmV,EAAAF,GAEA,IAAAkB,EAAA9b,KAAA6a,eAAAC,GAEA,IAAA,IAAAva,EAAA,EAAAA,EAAAoF,EAAA3E,OAAAT,IAGAP,KAAA6b,eAAAlW,EAAApF,GAAAub,EAAAlB,GAKA,OAFA5a,KAAAwb,kBAAAM,GAEAA,EAAAf,MACA,E/B4zEA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASta,EAAQf,EAAOD,GgCj6ElCC,EAAAD;;;;;;;;;;AA1DA,MAKAkF,cAEA3E,KAAAwa,UAAA,CAAA,CACA,CAWAuB,SAAAC,EAAAC,EAAAC,GAKA,OAHAF,EAAAnY,eAAAoY,EAAAC,MACAF,EAAAC,EAAAC,IAAA,CAAA,GAEAF,EAAAC,EAAAC,GACA,CASAvJ,WAAA8H,EAAAC,EAAAC,GAEA,GAAAF,EAAAzZ,OAAA,EACA,OAAA,EAEA,GAAA,iBAAA0Z,GAAAA,EAAA1Z,OAAA,EACA,OAAA,EAEA,IAAAmb,EAAAnc,KAAAwa,UAGA,IAAA,IAAAja,EAAA,EAAAA,EAAAka,EAAAzZ,OAAAT,IACA4b,EAAAnc,KAAA+b,SAAAI,EAAA1B,EAAAla,GAQA,OANA4b,EAAAR,aAAAlB,EACA0B,EAAAT,WAAA,iBAAAhB,GAAAA,EAAA1Z,OAAA,EAAA0Z,EAAAD,EACA0B,EAAAP,MAAA,mBAAAjB,EAAAA,EACA,iBAAAA,EAAA,IAAAA,EACAC,GAAAA,GAEA,CACA,EhC2+EA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASna,EAAQf,EAAOD,GiC3iFlC,IAOA2c,EACAC,EARA9J,EAAA7S,EAAAD,QAAA,CAAA,EAUA,SAAA6c,IACA,MAAA,IAAA1b,MAAA,kCACA,CACA,SAAA2b,IACA,MAAA,IAAA3b,MAAA,oCACA,CAqBA,SAAA4b,EAAAC,GACA,GAAAL,IAAA/X,WAEA,OAAAA,WAAAoY,EAAA,GAGA,IAAAL,IAAAE,IAAAF,IAAA/X,WAEA,OADA+X,EAAA/X,WACAA,WAAAoY,EAAA,GAEA,IAEA,OAAAL,EAAAK,EAAA,EACA,CAAA,MAAAtc,GACA,IAEA,OAAAic,EAAArb,KAAA,KAAA0b,EAAA,EACA,CAAA,MAAAtc,GAEA,OAAAic,EAAArb,KAAAf,KAAAyc,EAAA,EACA,CACA,CAGA,EA5CA,WACA,IAEAL,EADA,mBAAA/X,WACAA,WAEAiY,CAEA,CAAA,MAAAnc,GACAic,EAAAE,CACA,CACA,IAEAD,EADA,mBAAAK,aACAA,aAEAH,CAEA,CAAA,MAAApc,GACAkc,EAAAE,CACA,CACA,CAnBA,GAwEA,IAEAI,EAFAC,EAAA,GACAC,GAAA,EAEAC,GAAA,EAEA,SAAAC,IACAF,GAAAF,IAGAE,GAAA,EACAF,EAAA3b,OACA4b,EAAAD,EAAAjY,OAAAkY,GAEAE,GAAA,EAEAF,EAAA5b,QACAgc,IAEA,CAEA,SAAAA,IACA,IAAAH,EAAA,CAGA,IAAAI,EAAAT,EAAAO,GACAF,GAAA,EAGA,IADA,IAAAnZ,EAAAkZ,EAAA5b,OACA0C,GAAA,CAGA,IAFAiZ,EAAAC,EACAA,EAAA,KACAE,EAAApZ,GACAiZ,GACAA,EAAAG,GAAAI,MAGAJ,GAAA,EACApZ,EAAAkZ,EAAA5b,MACA,CACA2b,EAAA,KACAE,GAAA,EAnEA,SAAAM,GACA,GAAAd,IAAAK,aAEA,OAAAA,aAAAS,GAGA,IAAAd,IAAAE,IAAAF,IAAAK,aAEA,OADAL,EAAAK,aACAA,aAAAS,GAEA,IAEA,OAAAd,EAAAc,EACA,CAAA,MAAAhd,GACA,IAEA,OAAAkc,EAAAtb,KAAA,KAAAoc,EACA,CAAA,MAAAhd,GAGA,OAAAkc,EAAAtb,KAAAf,KAAAmd,EACA,CACA,CAIA,CA0CAC,CAAAH,EAlBA,CAmBA,CAgBA,SAAAI,EAAAZ,EAAAa,GACAtd,KAAAyc,IAAAA,EACAzc,KAAAsd,MAAAA,CACA,CAWA,SAAAvb,IAAA,CA5BAwQ,EAAAgL,SAAA,SAAAd,GACA,IAAA7Z,EAAA,IAAAM,MAAAtB,UAAAZ,OAAA,GACA,GAAAY,UAAAZ,OAAA,EACA,IAAA,IAAAT,EAAA,EAAAA,EAAAqB,UAAAZ,OAAAT,IACAqC,EAAArC,EAAA,GAAAqB,UAAArB,GAGAqc,EAAA7Z,KAAA,IAAAsa,EAAAZ,EAAA7Z,IACA,IAAAga,EAAA5b,QAAA6b,GACAL,EAAAQ,EAEA,EAOAK,EAAAha,UAAA6Z,IAAA,WACAld,KAAAyc,IAAA9a,MAAA,KAAA3B,KAAAsd,MACA,EACA/K,EAAAiL,MAAA,UACAjL,EAAAkL,SAAA,EACAlL,EAAAW,IAAA,CAAA,EACAX,EAAAmL,KAAA,GACAnL,EAAAoL,QAAA,GACApL,EAAAqL,SAAA,CAAA,EAIArL,EAAAsL,GAAA9b,EACAwQ,EAAAuL,YAAA/b,EACAwQ,EAAAzQ,KAAAC,EACAwQ,EAAAwL,IAAAhc,EACAwQ,EAAAyL,eAAAjc,EACAwQ,EAAA0L,mBAAAlc,EACAwQ,EAAA2L,KAAAnc,EACAwQ,EAAA4L,gBAAApc,EACAwQ,EAAA6L,oBAAArc,EAEAwQ,EAAA8L,UAAA,SAAAtE,GAAA,MAAA,EAAA,EAEAxH,EAAA+L,QAAA,SAAAvE,GACA,MAAA,IAAAnZ,MAAA,mCACA,EAEA2R,EAAAmF,IAAA,WAAA,MAAA,GAAA,EACAnF,EAAAgM,MAAA,SAAA1E,GACA,MAAA,IAAAjZ,MAAA,iCACA,EACA2R,EAAAiM,MAAA,WAAA,OAAA,CAAA,CjC+iFA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS/d,EAAQf,EAAOD,IAClC,SAAWiD,EAAa+b,IAAgB,WkCvuFxC,IAAAlB,EAAA9c,EAAA,sBAAA8c,SACA5b,EAAA+c,SAAArb,UAAA1B,MACAwE,EAAAjD,MAAAG,UAAA8C,MACAwY,EAAA,CAAA,EACAC,EAAA,EAaA,SAAAC,EAAAC,EAAAC,GACA/e,KAAAgf,IAAAF,EACA9e,KAAAif,SAAAF,CACA,CAZAtf,EAAA4E,WAAA,WACA,OAAA,IAAAwa,EAAAld,EAAAZ,KAAAsD,WAAAxE,OAAA+B,WAAA8a,aACA,EACAjd,EAAAyf,YAAA,WACA,OAAA,IAAAL,EAAAld,EAAAZ,KAAAme,YAAArf,OAAA+B,WAAAud,cACA,EACA1f,EAAAid,aACAjd,EAAA0f,cAAA,SAAAlC,GAAAA,EAAAmC,OAAA,EAMAP,EAAAxb,UAAAgc,MAAAR,EAAAxb,UAAAic,IAAA,WAAA,EACAT,EAAAxb,UAAA+b,MAAA,WACApf,KAAAif,SAAAle,KAAAlB,OAAAG,KAAAgf,IACA,EAGAvf,EAAA8f,OAAA,SAAAC,EAAAC,GACA/C,aAAA8C,EAAAE,gBACAF,EAAAG,aAAAF,CACA,EAEAhgB,EAAAmgB,SAAA,SAAAJ,GACA9C,aAAA8C,EAAAE,gBACAF,EAAAG,cAAA,CACA,EAEAlgB,EAAAogB,aAAApgB,EAAAqgB,OAAA,SAAAN,GACA9C,aAAA8C,EAAAE,gBAEA,IAAAD,EAAAD,EAAAG,aACAF,GAAA,IACAD,EAAAE,eAAArb,YAAA,WACAmb,EAAAO,YACAP,EAAAO,YACA,GAAAN,GAEA,EAGAhgB,EAAAiD,aAAA,mBAAAA,EAAAA,EAAA,SAAAhB,GACA,IAAAod,EAAAF,IACAhc,IAAAhB,UAAAZ,OAAA,IAAAmF,EAAApF,KAAAa,UAAA,GAkBA,OAhBA+c,EAAAG,IAAA,EAEAvB,GAAA,WACAoB,EAAAG,KAGAlc,EACAlB,EAAAC,MAAA,KAAAiB,GAEAlB,EAAAX,KAAA,MAGAtB,EAAAgf,eAAAK,GAEA,IAEAA,CACA,EAEArf,EAAAgf,eAAA,mBAAAA,EAAAA,EAAA,SAAAK,UACAH,EAAAG,EACA,ClCyuFC,GAAE/d,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,UAAUiC,aAAajC,EAAQ,UAAUge,eAE3E,EAAE,CAAC,qBAAqB,GAAGna,OAAS,KAAK,GAAG,CAAC,SAAS7D,EAAQf,EAAOD,GmCtzFrE,IAAAugB,EAAAvf,EAAA,cAEA,iBAAAZ,QAAAA,OAAAgE,eAAA,WAEAhE,OAAAI,MAAA+f,GAGAtgB,EAAAD,QAAAugB,CnCwzFA,EAAE,CAAC,aAAa,KAAK,GAAG,CAAC,SAASvf,EAAQf,EAAOD,GoC/zFjD,MAAAwgB,EAAA7S,KAAAC,UACA,CACA6S,SAAA,CACAC,MAAA,EACAC,MAAA,EAEAC,MAAA,GACAC,QAAA,GAEAC,QAAA,GAEAC,OAAA,CACAC,WAAA,EAEAC,mBAAA,EACAC,sBAAA,EAEAC,MAAA,EACAC,eAAA,EAEAC,UAAA,EACAC,QAAA,GAEAC,OAAA,GACAC,IAAA,KAgGAvhB,EAAAD,QA7FA,MAEAkF,YAAA2K,EAAA4R,EAAAC,GAEAnhB,KAAAohB,MAAA9R,EAEAtP,KAAA+Z,KAAAmH,EAEAlhB,KAAAqhB,MAAAjU,KAAA2G,MAAAkM,GAEAjgB,KAAAqhB,MAAAnB,SAAAC,KAAAngB,KAAAohB,MAAAvK,UACA7W,KAAAqhB,MAAAnB,SAAAE,KAAApgB,KAAAqhB,MAAAlB,KAEA,iBAAAgB,IAEAnhB,KAAAqhB,MAAAnB,SAAAE,KAAAe,EAEA,CAEAhB,WAEA,OAAAngB,KAAAqhB,MAAAnB,SAAAC,IACA,CAEAC,WAEA,OAAApgB,KAAAqhB,MAAAnB,SAAAE,IACA,CAEAjT,UAEA,OAAAnN,IACA,CAEAshB,kBAAA9V,EAAAR,EAAAC,GAEAjL,KAAAqhB,MAAAJ,IAAAle,KAAA,GAAA2B,QAAA,IAAA8F,MAAA+W,cAAA,MAAA7c,OAAA8G,EAAA,OAAA9G,OAAAsG,IAEA,iBAAAC,GAEAjL,KAAAqhB,MAAAJ,IAAAle,KAAAqK,KAAAC,UAAApC,GAEA,CAEAuW,qBAAAxW,EAAAC,GAEAjL,KAAAqhB,MAAAL,OAAAje,KAAA,GAAA2B,OAAAsG,IAEA,iBAAAC,GAEAjL,KAAAqhB,MAAAL,OAAAje,KAAAqK,KAAAC,UAAApC,GAEA,CAEAF,MAAAC,EAAAC,GAEAjL,KAAAshB,kBAAA,QAAAtW,EAAAC,GACAjL,KAAAohB,MAAAjU,IAAApC,MAAAC,EAAAC,EACA,CAEAE,MAAAH,EAAAC,GAEAjL,KAAAshB,kBAAA,QAAAtW,EAAAC,GACAjL,KAAAohB,MAAAjU,IAAAhC,MAAAH,EAAAC,EACA,CAEAG,KAAAJ,EAAAC,GAEAjL,KAAAshB,kBAAA,OAAAtW,EAAAC,GACAjL,KAAAohB,MAAAjU,IAAA/B,KAAAJ,EAAAC,EACA,CAEAI,KAAAL,EAAAC,GAEAjL,KAAAshB,kBAAA,OAAAtW,EAAAC,GACAjL,KAAAohB,MAAAjU,IAAA9B,KAAAL,EAAAC,EACA,CAEAK,MAAAN,EAAAC,GAEAjL,KAAAshB,kBAAA,QAAAtW,EAAAC,GACAjL,KAAAwhB,qBAAAxW,EAAAC,GACAjL,KAAAohB,MAAAjU,IAAA7B,MAAAN,EAAAC,EACA,CAEAM,MAAAP,EAAAC,GAEAjL,KAAAshB,kBAAA,QAAAtW,EAAAC,GACAjL,KAAAwhB,qBAAAxW,EAAAC,GACAjL,KAAAohB,MAAAjU,IAAA5B,MAAAP,EAAAC,EACA,EpCo0FA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASxK,EAAQf,EAAOD,GqCz7FlC,MAAAgiB,EAAAhhB,EAAA,kCACAihB,EAAAjhB,EAAA,mBAcAf,EAAAD,QAZA,cAAAgiB,EAEA9c,YAAA2K,EAAAqS,EAAAC,GAEA3V,MAAAqD,EAAAqS,EAAAC,GAEA5hB,KAAA6hB,YAAA,iBAEA7hB,KAAA8hB,uBAAA,IAAAJ,CACA,ErC87FA,EAAE,CAAC,iCAAiC,GAAG,kBAAkB,KAAK,GAAG,CAAC,SAASjhB,EAAQf,EAAOD,GsC18F1F,MAAAgiB,EAAAhhB,EAAA,kCAEA6S,EAAA7S,EAAA,aAsCAf,EAAAD,QApCA,cAAAgiB,EAEA9c,YAAA2K,EAAAqS,EAAAC,GAEA3V,MAAAqD,EAAAqS,EAAAC,GAEA5hB,KAAA6hB,YAAA,eAEA7hB,KAAA+hB,qBAAA,IAAAzO,EAAAtT,KAAAgiB,QACA,CAUArP,WAAA8H,EAAAC,EAAAC,GAEA,OAAA3a,KAAA+hB,qBAAApP,WAAA8H,EAAAC,EAAAC,EACA,CAQAvH,YAAAzN,EAAAiV,GAEA,OAAA5a,KAAA+hB,qBAAA3O,YAAAzN,EAAAiV,EACA,EtC+8FA,EAAE,CAAC,iCAAiC,GAAGlI,UAAY,KAAK,GAAG,CAAC,SAASjS,EAAQf,EAAOD,GuCp/FpF,MAAAgiB,EAAAhhB,EAAA,kCAyGAf,EAAAD,QAvGA,cAAAgiB,EAWA9c,YAAA2K,EAAAqS,EAAAC,GAEA3V,MAAAqD,EAAAqS,EAAAC,GAEA5hB,KAAA6hB,YAAA,WAIA7hB,KAAAiiB,SACA,CACAC,SAAA,kBACAC,YAAA,mBACAC,QAAA,+BACAC,UAAA,8BAEAC,mBAAA,MAKAtiB,KAAAuiB,gBAAA,CACA,KAAA,KACA,IAAA,IACAriB,EAAA,KACA,KAAA,IACAE,EAAA,KACA,KAAA,IACAC,EAAA,KACA,KAAA,IACAmiB,MAAA,SACA,SAAA,QACAC,MAAA,SACA,SAAA,SAKAziB,KAAA0iB,gBAAA,EACA1iB,KAAA2iB,gBAAA,CACA,CAEAC,eAAAhI,GAEA,OAAA5a,KAAA0iB,eAAA9H,EACA,CAEAiI,iBAAAjI,GAGA,OADA5a,KAAA4iB,eAAA9a,KAAA9H,KAEA,CAEA8iB,sBAAAC,EAAAnI,GA2BA,OAvBA5a,KAAAgjB,eAAA,SAAAD,EACA9b,QAAAjH,KAAAiiB,SAAAG,SACA9a,GAEA,KAAA5C,OAAA1E,KAAAuiB,gBAAAjb,MAEAL,QAAAjH,KAAAiiB,SAAAE,aAAAniB,KAAAiiB,SAAAK,oBACA,CAAAhb,EAAA2b,IAEA,QAAAve,OAAAwe,mBAAAD,GAAA,WAEAhc,QAAAjH,KAAAiiB,SAAAC,UAAAliB,KAAAiiB,SAAAK,oBACA,CAAAhb,EAAA2b,IAEA,OAAAve,OAAAwe,mBAAAD,GAAA,eACA,OAGAjjB,KAAAgjB,eAAA,mCAAAte,OAAA1E,KAAAgjB,eAAA,OACAhjB,KAAAgjB,eAAA,oFAAAte,OAAA1E,KAAAgjB,eAAA,iBAEAhjB,KAAA0iB,eAAA,IAAAhE,SAAA,sBAAA1e,KAAAgjB,qBAEA,IAAApI,EAEA5a,KAAA0iB,eAAA9H,IAKA5a,KAAAmjB,uBAAA,mBAAAnjB,KAAAgjB,eAAA,IAEAhjB,KAAA6iB,mBACA,EvCy/FA,EAAE,CAAC,iCAAiC,KAAK,GAAG,CAAC,SAASpiB,EAAQf,EAAOD,GwC/lGrE,MAAAgiB,EAAAhhB,EAAA,kCAIA2iB,EAAA3iB,EAAA,mBACA4iB,EAAA5iB,EAAA,mBA6EAf,EAAAD,QA3EA,cAAAgiB,EAWA9c,YAAA2K,EAAAqS,EAAAC,GAEA3V,MAAAqD,EAAAqS,EAAAC,GAEA5hB,KAAAsjB,UAAA,CAAA,EAGAtjB,KAAAujB,UAAAH,EACApjB,KAAAwjB,UAAAH,CACA,CAIAI,OAAAC,GACA,IAAA,IAAAC,EAAA/hB,UAAAZ,OADA4iB,EAAA,IAAA1gB,MAAAygB,EAAA,EAAAA,EAAA,EAAA,GAAAE,EAAA,EAAAA,EAAAF,EAAAE,IAAAD,EAAAC,EAAA,GAAAjiB,UAAAiiB,GAEA,OAAAzgB,OAAA0N,OAAA4S,KAAAE,EACA,CAKAE,SAAAf,EAAAnI,GAIA,OAFA5a,KAAAohB,MAAA2C,eAAAC,8CAAA,YAEAlB,sBAAAC,EAAAnI,EACA,CAGAqJ,oBAAAC,EAAAnB,EAAAnI,GAEA,IAAAuJ,EAAAnkB,KAAAohB,MAAA2C,eAAAK,2BAAA,WAAA,CAAA,EAAAF,GAIA,OAFAlkB,KAAAsjB,UAAAY,GAAAC,EAAArB,sBAAAC,EAAAnI,GAEA5a,KAAAsjB,UAAAY,EACA,CAOAG,MAAAC,EAAAC,EAAAC,GAEA,IAAAC,EAAA,IAAAH,GAEAI,EAAA,iBAAAH,EAAAA,EAAA,EACAI,OAAA,IAAAH,EAAAA,EAAA,GAEA,GAAAE,GAAA,EAEA,OAAAC,EAGA,KAAAF,EAAAzjB,QAEA2jB,EAAA5hB,KAAA0hB,EAAAG,OAAA,EAAAF,IAGA,OAAAC,CACA,ExComGA,EAAE,CAAC,iCAAiC,GAAG,kBAAkB,EAAE,kBAAkB,KAAK,GAAG,CAAC,SAASlkB,EAAQf,EAAOD;;;;;;AyC7qG9G,MAAAgiB,EAAAhhB,EAAA,kCA6EAf,EAAAD,QA3EA,MAEAkF,YAAA2K,GAEAtP,KAAAohB,MAAA9R,EAEAtP,KAAA6kB,aAAA,GAGA7kB,KAAA8kB,SAAA,CAAA,EAGA9kB,KAAA+kB,gBAAA,CAAA,EAGA/kB,KAAAglB,eAAA,CAAA,CACA,CAEAC,eAAAC,EAAAC,GAGAnlB,KAAA6kB,aAAA9hB,KAAAmiB,GAGAllB,KAAA8kB,SAAAI,GAAA,CAAA,EAEA,mBAAAC,GAAAA,EAAA9hB,qBAAAoe,EAGAzhB,KAAAglB,eAAAE,GAAAC,EAKAnlB,KAAAglB,eAAAE,GAAAzD,CAEA,CAEA2C,2BAAAc,EAAAvD,EAAAyD,GAGA,IAAAC,EAAArlB,KAAAgkB,8CAAAkB,EAAAvD,EAAAyD,GAWA,OARAplB,KAAA8kB,SAAAI,GAAAG,EAAAjF,MAAAiF,EAGArlB,KAAA+kB,gBAAAlhB,eAAAqhB,KAEAllB,KAAA+kB,gBAAAG,GAAAG,GAGAA,CACA,CAGArB,8CAAAkB,EAAAvD,EAAAyD,GAIA,OADA,IAAAplB,KAAAglB,eAAAE,GAAAllB,KAAAohB,MAAAO,EAAAyD,EAEA,CAEAE,+BAAAJ,EAAAtD,GAEA,QAAA5hB,KAAA8kB,SAAAI,GAAArhB,eAAA+d,KAEA5hB,KAAA+kB,gBAAAG,GAAAllB,KAAA8kB,SAAAI,GAAAtD,IACA,EAIA,GAKAliB,EAAAD,QAAA8lB,oBAAA9D,CzCqrGA,EAAE,CAAC,iCAAiC,KAAK,GAAG,CAAC,SAAShhB,EAAQf,EAAOD,G0CpvGrEC,EAAAD;;;;;;AAhBA,MAEAkF,YAAA2K,EAAAqS,EAAAC,GAEA5hB,KAAAohB,MAAA9R,EAEAtP,KAAAgiB,QAAA,iBAAAL,EAAAA,EAAA,CAAA,EAEA3hB,KAAA6hB,YAAA,UAEA7hB,KAAAwlB,KAAAlW,EAAAuH,UAEA7W,KAAAogB,KAAA,iBAAAwB,EAAAA,EAAA,GAAAld,OAAA1E,KAAAwlB,KACA,E1CgxGA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS/kB,EAAQf,EAAOD;;;;;;A2C9xGlC,MAAAgmB,EAAAhlB,EAAA,kBACAilB,EAAAjlB,EAAA,cACAklB,EAAAllB,EAAA,aAEAmlB,EAAAnlB,EAAA,6BAEAolB,EAAAplB,EAAA,qCACAqlB,EAAArlB,EAAA,+BACAslB,EAAAtlB,EAAA,mCACAulB,EAAAvlB,EAAA,8BAEAwlB,EAAAxlB,EAAA,wBAEA,MAAAR,EAEA0E,YAAAuN,GAEA,IAAA3C,EAAA,IAAAkW,EAAAvT,GAEAlS,KAAAkmB,gBAAA3W,EAGAvP,KAAAmmB,QAAA,IAAAT,EAAA1lB,KAAAkmB,gBAAAhS,UAEAlU,KAAAmN,IAAA,IAAAwY,EAAA3lB,KAAAkmB,gBAAAhS,UACAlU,KAAAmN,IAAArC,aAGA9K,KAAAomB,aACA,CACA1T,UAAA+S,EAAA/S,WAIA1S,KAAAqmB,WAAA,CAAA,EAEArmB,KAAA+jB,eAAA,IAAA6B,EAAA5lB,MAGAA,KAAA+jB,eAAAkB,eAAA,iBAAAY,GACA7lB,KAAAohB,MAAA2C,eAAAK,2BAAA,iBAAA,CAAA,EAAA,kCAEApkB,KAAAsmB,eAAAtmB,KAAA+jB,eAAAgB,gBAAAuB,eAAAxE,uBAGA9hB,KAAA+jB,eAAAkB,eAAA,WAAAa,GAGA9lB,KAAA+jB,eAAAkB,eAAA,eAAAc,GAGA/lB,KAAA+jB,eAAAkB,eAAA,UAAAe,GACAhmB,KAAAohB,MAAA2C,eAAAK,2BAAA,UAAA,CAAA,EAAA,2BACApkB,KAAAumB,QAAAvmB,KAAA+jB,eAAAgB,gBAAAwB,QAEAvmB,KAAA8kB,SAAA9kB,KAAA+jB,eAAAe,SACA9kB,KAAA+kB,gBAAA/kB,KAAA+jB,eAAAgB,eACA,CAEA7Q,eAEA,OAAAlU,KAAAkmB,gBAAAhS,QACA,CAEAkN,YAEA,OAAAphB,IACA,CAEA6W,UAEA,OAAA7W,KAAAmmB,QAAAtP,SACA,CAEA2P,gBAAAtF,EAAAC,GAEA,IAAAsF,EAAA,IAAAR,EAAAjmB,KAAAkhB,EAAAC,GAYA,OAVAnhB,KAAAqmB,WAAAxiB,eAAA4iB,EAAArG,QAOApgB,KAAAqmB,WAAAI,EAAArG,MAAAqG,GAGAA,CACA,CAEAC,aAAAvF,GAEA,QAAAnhB,KAAAqmB,WAAAxiB,eAAAsd,IAMAnhB,KAAAqmB,WAAAlF,EAEA,EASAzhB,EAAAD,QAAAQ,EACAP,EAAAD,QAAAwS,IANA,SAAAC,GAEA,OAAA,IAAAjS,EAAAiS,EACA,EAKAxS,EAAAD,QAAA0S,gBAAAwT,EAAAxT,gBACAzS,EAAAD,QAAA8lB,oBAAAK,EAAAL,oBAEA7lB,EAAAD,QAAAiT,UAAA+S,EAAA/S,S3CqyGA,EAAE,CAAC,uBAAuB,GAAG,oCAAoC,GAAG,kCAAkC,GAAG,8BAA8B,GAAG,6BAA6B,GAAG,4BAA4B,GAAG,YAAY,GAAG,iBAAiB,GAAG,aAAa,MAAM,CAAC,EAAE,CAAC,IC95GnQ,CD85GwQ,GACxQ","file":"fable.min.js","sourcesContent":["(function(f){if(typeof exports===\"object\"&&typeof module!==\"undefined\"){module.exports=f()}else if(typeof define===\"function\"&&define.amd){define([],f)}else{var g;if(typeof window!==\"undefined\"){g=window}else if(typeof global!==\"undefined\"){g=global}else if(typeof self!==\"undefined\"){g=self}else{g=this}g.Fable = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c=\"function\"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error(\"Cannot find module '\"+i+\"'\");throw a.code=\"MODULE_NOT_FOUND\",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u=\"function\"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){\n'use strict';\n\nvar eachOfLimit = require('async.util.eachoflimit');\nvar withoutIndex = require('async.util.withoutindex');\n\nmodule.exports = function eachLimit(arr, limit, iterator, cb) {\n return eachOfLimit(limit)(arr, withoutIndex(iterator), cb);\n};\n\n},{\"async.util.eachoflimit\":3,\"async.util.withoutindex\":14}],2:[function(require,module,exports){\n'use strict';\n\nmodule.exports = function(tasks) {\n function makeCallback(index) {\n function fn() {\n if (tasks.length) {\n tasks[index].apply(null, arguments);\n }\n return fn.next();\n }\n fn.next = function() {\n return (index < tasks.length - 1) ? makeCallback(index + 1) : null;\n };\n return fn;\n }\n return makeCallback(0);\n};\n\n},{}],3:[function(require,module,exports){\nvar once = require('async.util.once');\nvar noop = require('async.util.noop');\nvar onlyOnce = require('async.util.onlyonce');\nvar keyIterator = require('async.util.keyiterator');\n\nmodule.exports = function eachOfLimit(limit) {\n return function(obj, iterator, cb) {\n cb = once(cb || noop);\n obj = obj || [];\n var nextKey = keyIterator(obj);\n if (limit <= 0) {\n return cb(null);\n }\n var done = false;\n var running = 0;\n var errored = false;\n\n (function replenish() {\n if (done && running <= 0) {\n return cb(null);\n }\n\n while (running < limit && !errored) {\n var key = nextKey();\n if (key === null) {\n done = true;\n if (running <= 0) {\n cb(null);\n }\n return;\n }\n running += 1;\n iterator(obj[key], key, onlyOnce(function(err) {\n running -= 1;\n if (err) {\n cb(err);\n errored = true;\n } else {\n replenish();\n }\n }));\n }\n })();\n };\n};\n\n},{\"async.util.keyiterator\":7,\"async.util.noop\":9,\"async.util.once\":10,\"async.util.onlyonce\":11}],4:[function(require,module,exports){\n'use strict';\nvar setImmediate = require('async.util.setimmediate');\nvar restParam = require('async.util.restparam');\n\nmodule.exports = function(fn) {\n return restParam(function(args) {\n var callback = args.pop();\n args.push(function() {\n var innerArgs = arguments;\n if (sync) {\n setImmediate(function() {\n callback.apply(null, innerArgs);\n });\n } else {\n callback.apply(null, innerArgs);\n }\n });\n var sync = true;\n fn.apply(this, args);\n sync = false;\n });\n};\n\n},{\"async.util.restparam\":12,\"async.util.setimmediate\":13}],5:[function(require,module,exports){\n'use strict';\n\nmodule.exports = Array.isArray || function isArray(obj) {\n return Object.prototype.toString.call(obj) === '[object Array]';\n};\n\n},{}],6:[function(require,module,exports){\n'use strict';\n\nvar isArray = require('async.util.isarray');\n\nmodule.exports = function isArrayLike(arr) {\n return isArray(arr) || (\n // has a positive integer length property\n typeof arr.length === 'number' &&\n arr.length >= 0 &&\n arr.length % 1 === 0\n );\n};\n\n},{\"async.util.isarray\":5}],7:[function(require,module,exports){\n'use strict';\n\nvar _keys = require('async.util.keys');\nvar isArrayLike = require('async.util.isarraylike');\n\nmodule.exports = function keyIterator(coll) {\n var i = -1;\n var len;\n var keys;\n if (isArrayLike(coll)) {\n len = coll.length;\n return function next() {\n i++;\n return i < len ? i : null;\n };\n } else {\n keys = _keys(coll);\n len = keys.length;\n return function next() {\n i++;\n return i < len ? keys[i] : null;\n };\n }\n};\n\n},{\"async.util.isarraylike\":6,\"async.util.keys\":8}],8:[function(require,module,exports){\n'use strict';\n\nmodule.exports = Object.keys || function keys(obj) {\n var _keys = [];\n for (var k in obj) {\n if (obj.hasOwnProperty(k)) {\n _keys.push(k);\n }\n }\n return _keys;\n};\n\n},{}],9:[function(require,module,exports){\n'use strict';\n\nmodule.exports = function noop () {};\n\n},{}],10:[function(require,module,exports){\n'use strict';\n\nmodule.exports = function once(fn) {\n return function() {\n if (fn === null) return;\n fn.apply(this, arguments);\n fn = null;\n };\n};\n\n},{}],11:[function(require,module,exports){\n'use strict';\n\nmodule.exports = function only_once(fn) {\n return function() {\n if (fn === null) throw new Error('Callback was already called.');\n fn.apply(this, arguments);\n fn = null;\n };\n};\n\n},{}],12:[function(require,module,exports){\n'use strict';\nmodule.exports = function restParam(func, startIndex) {\n startIndex = startIndex == null ? func.length - 1 : +startIndex;\n return function() {\n var length = Math.max(arguments.length - startIndex, 0);\n var rest = new Array(length);\n for (var index = 0; index < length; index++) {\n rest[index] = arguments[index + startIndex];\n }\n switch (startIndex) {\n case 0:\n return func.call(this, rest);\n case 1:\n return func.call(this, arguments[0], rest);\n }\n };\n};\n\n},{}],13:[function(require,module,exports){\n(function (setImmediate){(function (){\n'use strict';\n\nvar _setImmediate = typeof setImmediate === 'function' && setImmediate;\nvar fallback = function(fn) {\n setTimeout(fn, 0);\n};\n\nmodule.exports = function setImmediate(fn) {\n // not a direct alias for IE10 compatibility\n return (_setImmediate || fallback)(fn);\n};\n\n}).call(this)}).call(this,require(\"timers\").setImmediate)\n\n},{\"timers\":34}],14:[function(require,module,exports){\n'use strict';\n\nmodule.exports = function withoutIndex(iterator) {\n return function(value, index, callback) {\n return iterator(value, callback);\n };\n};\n\n},{}],15:[function(require,module,exports){\n'use strict';\n\nvar once = require('async.util.once');\nvar noop = require('async.util.noop');\nvar isArray = require('async.util.isarray');\nvar restParam = require('async.util.restparam');\nvar ensureAsync = require('async.util.ensureasync');\nvar iterator = require('async.iterator');\n\nmodule.exports = function(tasks, cb) {\n cb = once(cb || noop);\n if (!isArray(tasks)) return cb(new Error('First argument to waterfall must be an array of functions'));\n if (!tasks.length) return cb();\n\n function wrapIterator(iterator) {\n return restParam(function(err, args) {\n if (err) {\n cb.apply(null, [err].concat(args));\n } else {\n var next = iterator.next();\n if (next) {\n args.push(wrapIterator(next));\n } else {\n args.push(cb);\n }\n ensureAsync(iterator).apply(null, args);\n }\n });\n }\n wrapIterator(iterator(tasks))();\n};\n\n},{\"async.iterator\":2,\"async.util.ensureasync\":4,\"async.util.isarray\":5,\"async.util.noop\":9,\"async.util.once\":10,\"async.util.restparam\":12}],16:[function(require,module,exports){\n\n},{}],17:[function(require,module,exports){\n/**\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\n/**\n* Data Arithmatic\n*\n* @class DataArithmatic\n*/\nclass DataArithmatic\n{\n\tconstructor()\n\t{\n\t\t// Regular Expressions (so they don't have to be recompiled every time)\n\t\t// These could be defined as static, but I'm not sure if that will work with browserify ... and specifically the QT browser.\n\t\tthis._Regex_formatterInsertCommas = /.{1,3}/g;\n\t\t// Match Function:\n\t\t// function(pMatch, pSign, pZeros, pBefore, pDecimal, pAfter)\n\t\t// Thoughts about below: /^([+-]?)(0*)(\\d+)(\\.(\\d+))?$/;\n\t\tthis._Regex_formatterAddCommasToNumber = /^([-+]?)(0?)(\\d+)(.?)(\\d+)$/g;\n\t\tthis._Regex_formatterDollarsRemoveCommas = /,/gi;\n\t\tthis._Regex_formatterCleanNonAlpha = /[^a-z0-9]/gi;\n\n\t\t// TODO: Potentially pull these in from a configuration.\n\t\t// TODO: Use locale data for this if it's defaults all the way down.\n\t\tthis._Value_MoneySign_Currency = '$';\n\t\tthis._Value_NaN_Currency = '--';\n\t\tthis._Value_GroupSeparator_Number = ',';\n\n\t\tthis._Value_Prefix_StringHash = 'HSH';\n\t\tthis._Value_Clean_formatterCleanNonAlpha = '_';\n\n\t\tthis._UseEngineStringStartsWith = (typeof(String.prototype.startsWith) === 'function');\n\t\tthis._UseEngineStringEndsWith = (typeof(String.prototype.endsWith) === 'function');\n\t}\n\n\n\t/*************************************************************************\n\t * String Manipulation and Comparison Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Reverse a string\n\t *\n\t * @param {string} pString - The string to reverse\n\t * @returns {string}\n\t */\n\tstringReverse (pString)\n\t{\n\t\t// TODO: Benchmark if there are faster ways we want to do this with all the newer JS stuff\n\t\t// ... and if it will work with browserify in a clean way.\n\t return pString.split('').reverse().join('');\n\t}\n\n\t/**\n\t * Test if a string starts with a given substring.\n\t *\n\t * @param {*} pString\n\t * @param {*} pSearchString\n\t * @param {*} pStartIndex\n\t * @returns {*}\n\t */\n\tstringStartsWith (pString, pSearchString, pStartIndex)\n\t{\n\t\tif (this._UseEngineStringStartsWith)\n\t\t{\n\t\t\treturn pString.startsWith(pSearchString, pStartIndex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.stringStartsWith_Polyfill.call(pString, pSearchString, pStartIndex);\n\t\t}\n\t}\n\n\t/**\n\t * Check if a string starts with a given substring. This is a safe polyfill for the ES6 string.startsWith() function.\n\t *\n\t * @param {*} pSearchString - The string to search for\n\t * @param {*} pStartIndex - The index to start the search at\n\t * @returns {boolean}\n\t */\n\tstringStartsWith_Polyfill (pSearchString, pStartIndex)\n\t{\n\t\treturn this.slice(pStartIndex || 0, pSearchString.length) === pSearchString;\n\t}\n\n\t/**\n\t * Test if a string starts with a given substring.\n\t *\n\t * @param {*} pString\n\t * @param {*} pSearchString\n\t * @param {*} pEndIndex\n\t * @returns {*}\n\t */\n\tstringEndsWith (pString, pSearchString, pEndIndex)\n\t{\n\t\tif (this._UseEngineStringEndsWith)\n\t\t{\n\t\t\treturn pString.endsWith(pSearchString, pEndIndex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.stringEndsWith_Polyfill.call(pString, pSearchString, pEndIndex);\n\t\t}\n\t}\n\n\t/**\n\t * Check if a string starts with a given substring. This is a safe polyfill for the ES6 string.startsWith() function.\n\t *\n\t * @param {*} pSearchString - The string to search for\n\t * @param {*} pEndIndex - The index to end the search at\n\t * @returns {boolean}\n\t */\n\tstringEndsWith_Polyfill (pSearchString, pEndIndex)\n\t{\n\t\t// This works much better than >= because\n\t\t// it compensates for NaN:\n\t\tif (!(pEndIndex < this.length))\n\t\t{\n\t\t\tpEndIndex = this.length;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpEndIndex |= 0; // round position\n\t\t}\n\t\treturn this.substr(pEndIndex - pSearchString.length, pSearchString.length) === pSearchString;\n\t}\n\n\t/**\n\t * Generate an insecure string hash. Not meant to be secure, just a quick way to generate a hash for a string. This is not a cryptographic hash. Additional warranty and disclaimer ... this is not for passwords!\n\t *\n\t * @param {string} pString\n\t * @returns {string}\n\t */\n\tinsecureStringHash (pString)\n\t{\n\t let tmpHash = 0;\n\t let tmpStringLength = pString.length;\n\t let tmpCharacterIndex = 0;\n\n\t while (tmpCharacterIndex < tmpStringLength)\n\t {\n\t tmpHash = (tmpHash << 5) - tmpHash + pString.charCodeAt(tmpCharacterIndex++) | 0;\n\t }\n\n\t return `${this._Value_Prefix_StringHash}${tmpHash}`;\n\t}\n\n\t/**\n\t * Clean wrapping characters if they exist consistently around the string. If they do not, the string is returned unchanged.\n\t *\n\t * @param {string} pWrapCharacter - The character expected as the wrapping character\n\t * @param {string} pString - the string to clean\n\t * @returns {string}\n\t */\n\tcleanEnclosureWrapCharacters (pWrapCharacter, pString)\n\t{\n\t\t// # Use case from ManyFest DSL:\n\t\t//\n\t\t// When a boxed property is passed in, it should have quotes of some\n\t\t// kind around it.\n\t\t//\n\t\t// For instance:\n\t\t// \t\tMyValues['Name']\n\t\t// \t\tMyValues[\"Age\"]\n\t\t// \t\tMyValues[`Cost`]\n\t\t//\n\t\t// This function is necessary to remove the wrapping quotes before object\n\t\t// resolution can occur.\n\t\tif (pString.startsWith(pWrapCharacter) && pString.endsWith(pWrapCharacter))\n\t\t{\n\t\t\treturn pString.substring(1, pString.length - 1);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn pString;\n\t\t}\n\t}\n\n\t/**\n\t *\n\t * @param {*} pString\n\t * @returns\n\t */\n\tcleanNonAlphaCharacters (pString)\n\t{\n\t if ((typeof(pString) == 'string') && (pString != ''))\n\t {\n\t return pString.replace(this._Regex_formatterCleanNonAlpha, this._Value_Clean_formatterCleanNonAlpha);\n\t }\n\t}\n\n\n\t/*************************************************************************\n\t * Number Formatting Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Insert commas every 3 characters from the right. Used by formatterAddCommasToNumber().\n\t *\n\t * @param {*} pString\n\t * @returns {*}\n\t */\n\tformatterInsertCommas (pString)\n\t{\n\t // Reverse, because it's easier to do things from the left, given arbitrary digit counts\n\t let tmpReversed = this.stringReverse(pString);\n\t // Add commas every three characters\n\t let tmpReversedWithCommas = tmpReversed.match(this._Regex_formatterInsertCommas).join(',');\n\t // Reverse again (back to normal direction)\n\t return this.stringReverse(tmpReversedWithCommas);\n\t}\n\n\tprocessAddCommasToNumberRegex(pMatch, pSign, pZeros, pBefore, pDecimal, pAfter)\n\t{\n\t\t// If there was no decimal, the last capture grabs the final digit, so\n\t\t// we have to put it back together with the 'before' substring\n\t\treturn pSign + (pDecimal ? this.formatterInsertCommas(pBefore) + pDecimal + pAfter : this.formatterInsertCommas(pBefore + pAfter));\n\t}\n\n\t/**\n\t * Add Commas to a Number for readability.\n\t *\n\t * @param {*} pNumber\n\t * @returns {string}\n\t */\n\tformatterAddCommasToNumber (pNumber)\n\t{\n\t // If the regex doesn't match, `replace` returns the string unmodified\n\t return (pNumber.toString()).replace\n\t (\n\t\t\tthis._Regex_formatterAddCommasToNumber,\n\t this.processAddCommasToNumberRegex.bind(this)\n\t );\n\t}\n\n\t/**\n\t * This will take a number and format it as a dollar string. It will also add commas to the number. If the number is not a number, it will return '--'.\n\t *\n\t * @param {*} pValue\n\t * @returns {string}\n\t */\n\tformatterDollars (pValue)\n\t{\n\t let tmpDollarAmount = parseFloat(pValue).toFixed(2);\n\n\t if (isNaN(tmpDollarAmount))\n\t {\n\t // Try again and see if what was passed in was a dollars string.\n\t if (typeof(pValue) == 'string')\n\t {\n\t\t\t\t// TODO: Better rounding function? This is a hack to get rid of the currency symbol and commas.\n\t tmpDollarAmount = parseFloat(pValue.replace(this._Value_MoneySign_Currency,'').replace(this._Regex_formatterDollarsRemoveCommas,'')).toFixed(2);\n\t }\n\t\t\t// If we didn't get a number, return the \"not a number\" string.\n\t if (isNaN(tmpDollarAmount))\n\t {\n\t return this._Value_NaN_Currency;\n\t }\n\t }\n\n\t // TODO: Get locale data and use that for this stuff.\n\t return `$${this.formatterAddCommasToNumber(tmpDollarAmount)}`;\n\t}\n\n\t/**\n\t * Round a number to a certain number of digits. If the number is not a number, it will return 0. If no digits are specified, it will default to 2 significant digits.\n\t *\n\t * @param {*} pValue\n\t * @param {number} pDigits\n\t * @returns {string}\n\t */\n\tformatterRoundNumber (pValue, pDigits)\n\t{\n\t let tmpDigits = (typeof(pDigits) == 'undefined') ? 2 : pDigits;\n\n\t let tmpValue = parseFloat(pValue).toFixed(tmpDigits);\n\t if (isNaN(tmpValue))\n\t {\n\t let tmpZed = 0;\n\t return tmpZed.toFixed(tmpDigits);\n\t }\n\t else\n\t {\n\t return tmpValue;\n\t }\n\t}\n\n\n\t/*************************************************************************\n\t * String Tokenization Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Return the string before the matched substring.\n\t *\n\t * If the substring is not found, the entire string is returned. This only deals with the *first* match.\n\t *\n\t * @param {string} pString\n\t * @param {string} pMatch\n\t * @returns {string}\n\t */\n\tstringBeforeMatch (pString, pMatch)\n\t{\n\t\treturn pString.split(pMatch)[0];\n\t}\n\n\t/**\n\t * Return the string after the matched substring.\n\t *\n\t * If the substring is not found, an empty string is returned. This only deals with the *first* match.\n\t *\n\t * @param {string} pString\n\t * @param {string} pMatch\n\t * @returns {string}\n\t */\n\tstringAfterMatch (pString, pMatch)\n\t{\n\t let tmpStringSplitLocation = pString.indexOf(pMatch);\n\n\t\tif ((tmpStringSplitLocation < 0) || ((tmpStringSplitLocation + pMatch.length) >= pString.length))\n\t {\n\t return '';\n\t }\n\n\t return pString.substring(tmpStringSplitLocation + pMatch.length);\n\t}\n\n\t/**\n\t * Count the number of enclosures in a string based on the start and end characters.\n\t *\n\t * If no start or end characters are specified, it will default to parentheses. If the string is not a string, it will return 0.\n\t *\n\t * @param {string} pString\n\t * @param {string} pEnclosureStart\n\t * @param {string} pEnclosureEnd\n\t * @returns the count of full in the string\n\t */\n\tstringCountEnclosures (pString, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t if (tmpEnclosureDepth == 0)\n\t {\n\t tmpEnclosureCount++;\n\t }\n\t tmpEnclosureDepth++;\n\t }\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\t }\n\t }\n\n\t return tmpEnclosureCount;\n\t}\n\n\n\t/**\n\t * Get the value of the enclosure at the specified index.\n\t *\n\t * If the index is not a number, it will default to 0. If the string is not a string, it will return an empty string. If the enclosure is not found, it will return an empty string. If the enclosure\n\t *\n\t * @param {string} pString\n\t * @param {number} pEnclosureIndexToGet\n\t * @param {string} pEnclosureStart\n\t * @param {string}} pEnclosureEnd\n\t * @returns {string}\n\t */\n\tstringGetEnclosureValueByIndex (pString, pEnclosureIndexToGet, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureIndexToGet = (typeof(pEnclosureIndexToGet) == 'number') ? pEnclosureIndexToGet : 0;\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t let tmpEnclosedValueStartIndex = 0;\n\t let tmpEnclosedValueEndIndex = 0;\n\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t tmpEnclosureDepth++;\n\n\t\t\t\t// Only count enclosures at depth 1, but still this parses both pairs of all of them.\n\t\t\t\tif (tmpEnclosureDepth == 1)\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureCount++;\n\t\t\t\t\tif (tmpEnclosureIndexToGet == (tmpEnclosureCount - 1))\n\t\t\t\t\t{\n\t\t\t\t\t\t// This is the start of *the* enclosure\n\t\t\t\t\t\ttmpMatchedEnclosureIndex = true;\n\t\t\t\t\t\ttmpEnclosedValueStartIndex = i;\n\t\t\t\t\t}\n\t\t\t\t}\n\t }\n\t\t\t// This is the end of an enclosure\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\n\t\t\t\t// Again, only count enclosures at depth 1, but still this parses both pairs of all of them.\n\t\t\t\tif ((tmpEnclosureDepth == 0) &&\n\t\t\t\t\ttmpMatchedEnclosureIndex &&\n\t\t\t\t\t(tmpEnclosedValueEndIndex <= tmpEnclosedValueStartIndex))\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosedValueEndIndex = i;\n\t\t\t\t\ttmpMatchedEnclosureIndex = false;\n\t\t\t\t}\n\t }\n\t }\n\n\t if (tmpEnclosureCount <= tmpEnclosureIndexToGet)\n\t {\n\t\t\t// Return an empty string if the enclosure is not found\n\t return '';\n\t }\n\n\t if ((tmpEnclosedValueEndIndex > 0) && (tmpEnclosedValueEndIndex > tmpEnclosedValueStartIndex))\n\t {\n\t return tmpString.substring(tmpEnclosedValueStartIndex+1, tmpEnclosedValueEndIndex);\n\t }\n\t else\n\t {\n\t return tmpString.substring(tmpEnclosedValueStartIndex+1);\n\t }\n\t}\n\n\n\t/**\n\t * Remove an enclosure from a string based on the index of the enclosure.\n\t *\n\t * @param {string} pString\n\t * @param {number} pEnclosureIndexToRemove\n\t * @param {number} pEnclosureStart\n\t * @param {number} pEnclosureEnd\n\t * @returns {string}\n\t */\n\tstringRemoveEnclosureByIndex (pString, pEnclosureIndexToRemove, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureIndexToRemove = (typeof(pEnclosureIndexToRemove) == 'number') ? pEnclosureIndexToRemove : 0;\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t let tmpEnclosureStartIndex = 0;\n\t let tmpEnclosureEndIndex = 0;\n\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t tmpEnclosureDepth++;\n\n\t if (tmpEnclosureDepth == 1)\n\t {\n\t tmpEnclosureCount++;\n\t\t\t\t\tif (tmpEnclosureIndexToRemove == (tmpEnclosureCount - 1))\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpMatchedEnclosureIndex = true;\n\t\t\t\t\t\ttmpEnclosureStartIndex = i;\n\t\t\t\t\t}\n\t }\n\t }\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\n\t\t\t\tif ((tmpEnclosureDepth == 0) &&\n\t\t\t\t\ttmpMatchedEnclosureIndex &&\n\t\t\t\t\t(tmpEnclosureEndIndex <= tmpEnclosureStartIndex))\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureEndIndex = i;\n\t\t\t\t\ttmpMatchedEnclosureIndex = false;\n\t\t\t\t}\n\t }\n\t }\n\n\t if (tmpEnclosureCount <= tmpEnclosureIndexToRemove)\n\t {\n\t return tmpString;\n\t }\n\n\t let tmpReturnString = '';\n\n\t if (tmpEnclosureStartIndex > 1)\n\t {\n\t tmpReturnString = tmpString.substring(0, tmpEnclosureStartIndex);\n\t }\n\n\t if ((tmpString.length > (tmpEnclosureEndIndex + 1)) && (tmpEnclosureEndIndex > tmpEnclosureStartIndex))\n\t {\n\t tmpReturnString += tmpString.substring(tmpEnclosureEndIndex+1);\n\t }\n\n\t return tmpReturnString;\n\t}\n}\n\nmodule.exports = DataArithmatic;\n},{}],18:[function(require,module,exports){\n/**\n* Base Logger Class\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\nclass BaseLogger\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\t// This should not possibly be able to be instantiated without a settings object\n\t\tthis._Settings = (typeof(pLogStreamSettings) == 'object') ? pLogStreamSettings : {};\n\n\t\t// The base logger does nothing but associate a UUID with itself\n\t\t// We added this as the mechanism for tracking loggers to allow multiple simultaneous streams\n\t\t// to the same provider.\n\t\tthis.loggerUUID = this.generateInsecureUUID();\n\n\t\t// Eventually we can use this array to ompute which levels the provider allows.\n\t\t// For now it's just used to precompute some string concatenations.\n\t\tthis.levels = (\n\t\t\t[\n\t\t\t\t\"trace\",\n\t\t\t\t\"debug\",\n\t\t\t\t\"info\",\n\t\t\t\t\"warn\",\n\t\t\t\t\"error\",\n\t\t\t\t\"fatal\"\n\t\t\t]);\n\t}\n\n\t// This is meant to generate programmatically insecure UUIDs to identify loggers\n\tgenerateInsecureUUID()\n\t{\n\t\tlet tmpDate = new Date().getTime();\n\t\tlet tmpUUID = 'LOGSTREAM-xxxxxx-yxxxxx'.replace(/[xy]/g,\n\t\t\t\t(pCharacter) =>\n\t\t\t\t{\n\t\t\t\t\t// Funny algorithm from w3resource that is twister-ish without the deep math and security\n\t\t\t\t\t// ..but good enough for unique log stream identifiers\n\t\t\t\t\tlet tmpRandomData = (tmpDate + Math.random()*16)%16 | 0;\n\t\t\t\t\ttmpDate = Math.floor(tmpDate/16);\n\n\t\t\t\t\treturn (pCharacter =='x' ? tmpRandomData : (tmpRandomData&0x3|0x8)).toString(16);\n\t\t\t\t});\n\t\treturn tmpUUID;\n\t}\n\n\tinitialize()\n\t{\n\t\t// No operation.\n\t}\n\n\ttrace(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"trace\", pLogText, pLogObject);\n\t}\n\n\tdebug(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"debug\", pLogText, pLogObject);\n\t}\n\n\tinfo(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"info\", pLogText, pLogObject);\n\t}\n\n\twarn(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"warn\", pLogText, pLogObject);\n\t}\n\n\terror(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"error\", pLogText, pLogObject);\n\t}\n\n\tfatal(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"fatal\", pLogText, pLogObject);\n\t}\n\n\twrite(pLogLevel, pLogText, pLogObject)\n\t{\n\t\t// The base logger does nothing.\n\t\treturn true;\n\t}\n}\n\nmodule.exports = BaseLogger;\n\n},{}],19:[function(require,module,exports){\n/**\n* Default Logger Provider Function\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\n// Return the providers that are available without extensions loaded\nvar getDefaultProviders = () =>\n{\n\tlet tmpDefaultProviders = {};\n\n\ttmpDefaultProviders.console = require('./Fable-Log-Logger-Console.js');\n\n\ttmpDefaultProviders.default = tmpDefaultProviders.console;\n\n\treturn tmpDefaultProviders;\n}\n\nmodule.exports = getDefaultProviders();\n},{\"./Fable-Log-Logger-Console.js\":21}],20:[function(require,module,exports){\nmodule.exports=[\n {\n \"loggertype\": \"console\",\n \"streamtype\": \"console\",\n \"level\": \"trace\"\n }\n]\n},{}],21:[function(require,module,exports){\nlet libBaseLogger = require('./Fable-Log-BaseLogger.js');\n\nclass ConsoleLogger extends libBaseLogger\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\tsuper(pLogStreamSettings);\n\n\t\tthis._ShowTimeStamps = this._Settings.hasOwnProperty('showtimestamps') ? (this._Settings.showtimestamps == true) : true;\n\t\tthis._FormattedTimeStamps = this._Settings.hasOwnProperty('formattedtimestamps') ? (this._Settings.formattedtimestamps == true) : true;\n\n\t\tthis._ContextMessage = this._Settings.hasOwnProperty('Context') ? `(${this._Settings.Context})` : \n\t\t\t\t\t\t\t\tpFableLog._Settings.hasOwnProperty('Product') ? `(${pFableLog._Settings.Product})` :\n\t\t\t\t\t\t\t\t'Unnamed_Log_Context';\n\n\t\t// Allow the user to decide what gets output to the console\n\t\tthis._OutputLogLinesToConsole = this._Settings.hasOwnProperty('outputloglinestoconsole') ? this._Settings.outputloglinestoconsole : true;\n\t\tthis._OutputObjectsToConsole = this._Settings.hasOwnProperty('outputobjectstoconsole') ? this._Settings.outputobjectstoconsole : true;\n\n\t\t// Precompute the prefix for each level\n\t\tthis.prefixCache = {};\n\t\tfor (let i = 0; i <= this.levels.length; i++)\n\t\t{\n\t\t\tthis.prefixCache[this.levels[i]] = `[${this.levels[i]}] ${this._ContextMessage}: `;\n\n\t\t\tif (this._ShowTimeStamps)\n\t\t\t{\n\t\t\t\t// If there is a timestamp we need a to prepend space before the prefixcache string, since the timestamp comes first\n\t\t\t\tthis.prefixCache[this.levels[i]] = ' '+this.prefixCache[this.levels[i]];\n\t\t\t}\n\t\t}\n\t}\n\n\twrite(pLevel, pLogText, pObject)\n\t{\n\t\tlet tmpTimeStamp = '';\n\t\tif (this._ShowTimeStamps && this._FormattedTimeStamps)\n\t\t{\n\t\t\ttmpTimeStamp = (new Date()).toISOString();\n\t\t}\n\t\telse if (this._ShowTimeStamps)\n\t\t{\n\t\t\ttmpTimeStamp = +new Date();\n\t\t}\n\n\t\tlet tmpLogLine = `${tmpTimeStamp}${this.prefixCache[pLevel]}${pLogText}`;\n\n\t\tif (this._OutputLogLinesToConsole)\n\t\t{\n\t\t\tconsole.log(tmpLogLine);\n\t\t}\n\n\t\t// Write out the object on a separate line if it is passed in\n\t\tif (this._OutputObjectsToConsole && (typeof(pObject) !== 'undefined'))\n\t\t{\n\t\t\tconsole.log(JSON.stringify(pObject, null, 2));\n\t\t}\n\n\t\t// Provide an easy way to be overridden and be consistent\n\t\treturn tmpLogLine;\n\t}\n}\n\nmodule.exports = ConsoleLogger;\n},{\"./Fable-Log-BaseLogger.js\":18}],22:[function(require,module,exports){\nconst libConsoleLog = require('./Fable-Log-Logger-Console.js');\nconst libFS = require('fs');\nconst libPath = require('path');\n\nclass SimpleFlatFileLogger extends libConsoleLog\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\tsuper(pLogStreamSettings, pFableLog);\n\n\t\t// If a path isn't provided for the logfile, it tries to use the ProductName or Context\n\t\tthis.logFileRawPath = (this._Settings.hasOwnProperty('path')) ? this._Settings.path : `./${this._ContextMessage}.log`;\n\t\tthis.logFilePath = libPath.normalize(this.logFileRawPath);\n\n\t\tthis.logFileStreamOptions = (this._Settings.hasOwnProperty('fileStreamoptions')) ? this._Settings.fileStreamOptions : (\n\t\t\t{\n\t\t\t\t\"flags\": \"a\",\n\t\t\t\t\"encoding\": \"utf8\"\n\t\t\t})\n\n\t\tthis.fileWriter = libFS.createWriteStream(this.logFilePath, this.logFileStreamOptions);\n\n\t\tthis.activelyWriting = false;\n\n\t\tthis.logLineStrings = [];\n\t\tthis.logObjectStrings = [];\n\n\t\tthis.defaultWriteCompleteCallback = ()=>{};\n\t\tthis.defaultBufferFlushCallback = ()=>{};\n\t}\n\n\tcloseWriter(fCloseComplete)\n\t{\n\t\tlet tmpCloseComplete = (typeof(fCloseComplete) == 'function') ? fCloseComplete : ()=>{};\n\t\tif (this.fileWriter)\n\t\t{\n\t\t\tthis.fileWriter.end('\\n');\n\t\t\treturn this.fileWriter.once('finish', tmpCloseComplete.bind(this));\n\t\t}\n\t};\n\n\tcompleteBufferFlushToLogFile(fFlushComplete)\n\t{\n\t\tthis.activelyWriting = false;\n\t\tlet tmpFlushComplete = (typeof(fFlushComplete) == 'function') ? fFlushComplete : this.defaultBufferFlushCallback;\n\n\t\tif (this.logLineStrings.length > 0)\n\t\t{\n\t\t\tthis.flushBufferToLogFile(tmpFlushComplete);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn tmpFlushComplete();\n\t\t}\n\t}\n\n\tflushBufferToLogFile(fFlushComplete)\n\t{\n\t\tif (!this.activelyWriting)\n\t\t{\n\t\t\t// Only want to be writing one thing at a time....\n\t\t\tthis.activelyWriting = true;\n\n\t\t\tlet tmpFlushComplete = (typeof(fFlushComplete) == 'function') ? fFlushComplete : this.defaultBufferFlushCallback;\n\n\t\t\t// Get the current buffer arrays. These should always have matching number of elements.\n\t\t\tlet tmpLineStrings = this.logLineStrings;\n\t\t\tlet tmpObjectStrings = this.logObjectStrings;\n\n\t\t\t// Reset these to be filled while we process this queue...\n\t\t\tthis.logLineStrings = [];\n\t\t\tthis.logObjectStrings = [];\n\n\t\t\t// This is where we will put each line before writing it to the file...\n\t\t\tlet tmpConstructedBufferOutputString = '';\n\n\t\t\tfor (let i = 0; i < tmpLineStrings.length; i++)\n\t\t\t{\n\t\t\t\t// TODO: Windows Newline? ....... yo no se!\n\t\t\t\ttmpConstructedBufferOutputString += `${tmpLineStrings[i]}\\n`;\n\t\t\t\tif (tmpObjectStrings[i] !== false)\n\t\t\t\t{\n\t\t\t\t\ttmpConstructedBufferOutputString += `${tmpObjectStrings[i]}\\n`;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!this.fileWriter.write(tmpConstructedBufferOutputString, 'utf8'))\n\t\t\t{\n\t\t\t\t// If the streamwriter returns false, we need to wait for it to drain.\n\t\t\t\tthis.fileWriter.once('drain', this.completeBufferFlushToLogFile.bind(this, tmpFlushComplete));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn this.completeBufferFlushToLogFile(tmpFlushComplete);\n\t\t\t}\n\t\t}\n\t}\n\n\twrite(pLevel, pLogText, pObject)\n\t{\n\t\tlet tmpLogLine = super.write(pLevel, pLogText, pObject);\n\n\t\t// Use a very simple array as the write buffer\n\t\tthis.logLineStrings.push(tmpLogLine);\n\n\t\t// Write out the object on a separate line if it is passed in\n\t\tif (typeof(pObject) !== 'undefined')\n\t\t{\n\t\t\tthis.logObjectStrings.push(JSON.stringify(pObject, null, 4));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.logObjectStrings.push(false);\n\t\t}\n\n\t\tthis.flushBufferToLogFile();\n\t}\n}\n\nmodule.exports = SimpleFlatFileLogger;\n},{\"./Fable-Log-Logger-Console.js\":21,\"fs\":16,\"path\":29}],23:[function(require,module,exports){\n/**\n* Fable Logging Add-on\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Logger\n*/\n\n/**\n* Fable Solution Log Wrapper Main Class\n*\n* @class FableLog\n* @constructor\n*/\nclass FableLog\n{\n\tconstructor(pFableSettings, pFable)\n\t{\n\t\tlet tmpSettings = (typeof(pFableSettings) === 'object') ? pFableSettings : {}\n\t\tthis._Settings = tmpSettings;\n\n\t\tthis._Providers = require('./Fable-Log-DefaultProviders-Node.js');\n\n\t\tthis._StreamDefinitions = (tmpSettings.hasOwnProperty('LogStreams')) ? tmpSettings.LogStreams : require('./Fable-Log-DefaultStreams.json');\n\n\t\tthis.logStreams = [];\n\n\t\t// This object gets decorated for one-time instantiated providers that\n\t\t// have multiple outputs, such as bunyan.\n\t\tthis.logProviders = {};\n\n\t\t// A hash list of the GUIDs for each log stream, so they can't be added to the set more than one time\n\t\tthis.activeLogStreams = {};\n\n\t\tthis.logStreamsTrace = [];\n\t\tthis.logStreamsDebug = [];\n\t\tthis.logStreamsInfo = [];\n\t\tthis.logStreamsWarn = [];\n\t\tthis.logStreamsError = [];\n\t\tthis.logStreamsFatal = [];\n\n\t\tthis.datumDecorator = (pDatum) => pDatum;\n\n\t\tthis.uuid = (typeof(tmpSettings.Product) === 'string') ? tmpSettings.Product : 'Default';\n\t}\n\n\taddLogger(pLogger, pLevel)\n\t{\n\t\t// Bail out if we've already created one.\n\t\tif (this.activeLogStreams.hasOwnProperty(pLogger.loggerUUID))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\t// Add it to the streams and to the mutex\n\t\tthis.logStreams.push(pLogger);\n\t\tthis.activeLogStreams[pLogger.loggerUUID] = true;\n\n\t\t// Make sure a kosher level was passed in\n\t\tswitch (pLevel)\n\t\t{\n\t\t\tcase 'trace':\n\t\t\t\tthis.logStreamsTrace.push(pLogger);\n\t\t\tcase 'debug':\n\t\t\t\tthis.logStreamsDebug.push(pLogger);\n\t\t\tcase 'info':\n\t\t\t\tthis.logStreamsInfo.push(pLogger);\n\t\t\tcase 'warn':\n\t\t\t\tthis.logStreamsWarn.push(pLogger);\n\t\t\tcase 'error':\n\t\t\t\tthis.logStreamsError.push(pLogger);\n\t\t\tcase 'fatal':\n\t\t\t\tthis.logStreamsFatal.push(pLogger);\n\t\t\t\tbreak;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tsetDatumDecorator(fDatumDecorator)\n\t{\n\t\tif (typeof(fDatumDecorator) === 'function')\n\t\t{\n\t\t\tthis.datumDecorator = fDatumDecorator;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.datumDecorator = (pDatum) => pDatum;\n\t\t}\n\t}\n\n\ttrace(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsTrace.length; i++)\n\t\t{\n\t\t\tthis.logStreamsTrace[i].trace(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tdebug(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsDebug.length; i++)\n\t\t{\n\t\t\tthis.logStreamsDebug[i].debug(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tinfo(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsInfo.length; i++)\n\t\t{\n\t\t\tthis.logStreamsInfo[i].info(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\twarn(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsWarn.length; i++)\n\t\t{\n\t\t\tthis.logStreamsWarn[i].warn(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\terror(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsError.length; i++)\n\t\t{\n\t\t\tthis.logStreamsError[i].error(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tfatal(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsFatal.length; i++)\n\t\t{\n\t\t\tthis.logStreamsFatal[i].fatal(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tinitialize()\n\t{\n\t\t// \"initialize\" each logger as defined in the logging parameters\n\t\tfor (let i = 0; i < this._StreamDefinitions.length; i++)\n\t\t{\n\t\t\tlet tmpStreamDefinition = Object.assign({loggertype:'default',streamtype:'console',level:'info'},this._StreamDefinitions[i]);\n\n\t\t\tif (!this._Providers.hasOwnProperty(tmpStreamDefinition.loggertype))\n\t\t\t{\n\t\t\t\tconsole.log(`Error initializing log stream: bad loggertype in stream definition ${JSON.stringify(tmpStreamDefinition)}`);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.addLogger(new this._Providers[tmpStreamDefinition.loggertype](tmpStreamDefinition, this), tmpStreamDefinition.level);\n\t\t\t}\n\t\t}\n\n\t\t// Now initialize each one.\n\t\tfor (let i = 0; i < this.logStreams.length; i++)\n\t\t{\n\t\t\tthis.logStreams[i].initialize();\n\t\t}\n\t}\n\n\tlogTime(pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time';\n\t\tlet tmpTime = new Date();\n\t\tthis.info(`${tmpMessage} ${tmpTime} (epoch ${+tmpTime})`, pDatum);\n\t}\n\n\t// Get a timestamp\n\tgetTimeStamp()\n\t{\n\t\treturn +new Date();\n\t}\n\n\tgetTimeDelta(pTimeStamp)\n\t{\n\t\tlet tmpEndTime = +new Date();\n\t\treturn tmpEndTime-pTimeStamp;\n\t}\n\n\t// Log the delta between a timestamp, and now with a message\n\tlogTimeDelta(pTimeDelta, pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time Measurement';\n\t\tlet tmpDatum = (typeof(pDatum) === 'object') ? pDatum : {};\n\n\t\tlet tmpEndTime = +new Date();\n\n\t\tthis.info(`${tmpMessage} logged at (epoch ${+tmpEndTime}) took (${pTimeDelta}ms)`, pDatum);\n\t}\n\n\tlogTimeDeltaHuman(pTimeDelta, pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time Measurement';\n\n\t\tlet tmpEndTime = +new Date();\n\n\t\tlet tmpMs = parseInt(pTimeDelta%1000);\n\t\tlet tmpSeconds = parseInt((pTimeDelta/1000)%60);\n\t\tlet tmpMinutes = parseInt((pTimeDelta/(1000*60))%60);\n\t\tlet tmpHours = parseInt(pTimeDelta/(1000*60*60));\n\n\t\ttmpMs = (tmpMs < 10) ? \"00\"+tmpMs : (tmpMs < 100) ? \"0\"+tmpMs : tmpMs;\n\t\ttmpSeconds = (tmpSeconds < 10) ? \"0\"+tmpSeconds : tmpSeconds;\n\t\ttmpMinutes = (tmpMinutes < 10) ? \"0\"+tmpMinutes : tmpMinutes;\n\t\ttmpHours = (tmpHours < 10) ? \"0\"+tmpHours : tmpHours;\n\n\t\tthis.info(`${tmpMessage} logged at (epoch ${+tmpEndTime}) took (${pTimeDelta}ms) or (${tmpHours}:${tmpMinutes}:${tmpSeconds}.${tmpMs})`, pDatum);\n\t}\n\n\tlogTimeDeltaRelative(pStartTime, pMessage, pDatum)\n\t{\n\t\tthis.logTimeDelta(this.getTimeDelta(pStartTime), pMessage, pDatum);\n\t}\n\n\tlogTimeDeltaRelativeHuman(pStartTime, pMessage, pDatum)\n\t{\n\t\tthis.logTimeDeltaHuman(this.getTimeDelta(pStartTime), pMessage, pDatum);\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableLog(pSettings);\n}\n\n\nmodule.exports = FableLog;\nmodule.exports.new = autoConstruct;\nmodule.exports.LogProviderBase = require('./Fable-Log-BaseLogger.js');\nmodule.exports.LogProviderConsole = require('./Fable-Log-Logger-Console.js');\nmodule.exports.LogProviderConsole = require('./Fable-Log-Logger-SimpleFlatFile.js');\n\n},{\"./Fable-Log-BaseLogger.js\":18,\"./Fable-Log-DefaultProviders-Node.js\":19,\"./Fable-Log-DefaultStreams.json\":20,\"./Fable-Log-Logger-Console.js\":21,\"./Fable-Log-Logger-SimpleFlatFile.js\":22}],24:[function(require,module,exports){\nmodule.exports={\n\t\"Product\": \"ApplicationNameHere\",\n\t\"ProductVersion\": \"0.0.0\",\n\n\t\"ConfigFile\": false,\n\n\t\"LogStreams\":\n\t[\n\t\t{\n\t\t\t\"level\": \"trace\"\n\t\t}\n\t]\n}\n\n},{}],25:[function(require,module,exports){\n(function (process){(function (){\n/**\n* Fable Settings Template Processor\n*\n* This class allows environment variables to come in via templated expressions, and defaults to be set.\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\n\nclass FableSettingsTemplateProcessor\n{\n\tconstructor(pDependencies)\n\t{\n // Use a no-dependencies templating engine to parse out environment variables\n\t\tthis.templateProcessor = new pDependencies.precedent();\n\n // TODO: Make the environment variable wrap expression demarcation characters configurable?\n\t\tthis.templateProcessor.addPattern('${', '}',\n\t\t\t(pTemplateValue)=>\n\t\t\t{\n\t\t\t\tlet tmpTemplateValue = pTemplateValue.trim();\n\n\t\t\t\tlet tmpSeparatorIndex = tmpTemplateValue.indexOf('|');\n\n\t\t\t\t// If there is no pipe, the default value will end up being whatever the variable name is.\n\t\t\t\tlet tmpDefaultValue = tmpTemplateValue.substring(tmpSeparatorIndex+1);\n\n\t\t\t\tlet tmpEnvironmentVariableName = (tmpSeparatorIndex > -1) ? tmpTemplateValue.substring(0, tmpSeparatorIndex) : tmpTemplateValue;\n\n\t\t\t\tif (process.env.hasOwnProperty(tmpEnvironmentVariableName))\n\t\t\t\t{\n\t\t\t\t\treturn process.env[tmpEnvironmentVariableName];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\treturn tmpDefaultValue;\n\t\t\t\t}\n\t\t\t});\n }\n\n parseSetting(pString)\n {\n return this.templateProcessor.parseString(pString);\n }\n}\n\nmodule.exports = FableSettingsTemplateProcessor;\n}).call(this)}).call(this,require('_process'))\n\n},{\"_process\":33}],26:[function(require,module,exports){\n/**\n* Fable Settings Add-on\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\n\nconst libPrecedent = require('precedent');\nconst libFableSettingsTemplateProcessor = require('./Fable-Settings-TemplateProcessor.js');\n\nclass FableSettings\n{\n\tconstructor(pFableSettings)\n\t{\n\t\t// Expose the dependencies for downstream re-use\n\t\tthis.dependencies = (\n\t\t\t{\n\t\t\t\tprecedent: libPrecedent\n\t\t\t});\n\n\t\t// Initialize the settings value template processor\n\t\tthis.settingsTemplateProcessor = new libFableSettingsTemplateProcessor(this.dependencies);\n\n\t\t// set straight away so anything that uses it respects the initial setting\n\t\tthis._configureEnvTemplating(pFableSettings);\n\n\t\tthis.default = this.buildDefaultSettings();\n\n\t\t// Construct a new settings object\n\t\tlet tmpSettings = this.merge(pFableSettings, this.buildDefaultSettings());\n\n\t\t// The base settings object (what they were on initialization, before other actors have altered them)\n\t\tthis.base = JSON.parse(JSON.stringify(tmpSettings));\n\n\t\tif (tmpSettings.DefaultConfigFile)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\t// If there is a DEFAULT configuration file, try to load and merge it.\n\t\t\t\ttmpSettings = this.merge(require(tmpSettings.DefaultConfigFile), tmpSettings);\n\t\t\t}\n\t\t\tcatch (pException)\n\t\t\t{\n\t\t\t\t// Why this? Often for an app we want settings to work out of the box, but\n\t\t\t\t// would potentially want to have a config file for complex settings.\n\t\t\t\tconsole.log('Fable-Settings Warning: Default configuration file specified but there was a problem loading it. Falling back to base.');\n\t\t\t\tconsole.log(' Loading Exception: '+pException);\n\t\t\t}\n\t\t}\n\n\t\tif (tmpSettings.ConfigFile)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\t// If there is a configuration file, try to load and merge it.\n\t\t\t\ttmpSettings = this.merge(require(tmpSettings.ConfigFile), tmpSettings);\n\t\t\t}\n\t\t\tcatch (pException)\n\t\t\t{\n\t\t\t\t// Why this? Often for an app we want settings to work out of the box, but\n\t\t\t\t// would potentially want to have a config file for complex settings.\n\t\t\t\tconsole.log('Fable-Settings Warning: Configuration file specified but there was a problem loading it. Falling back to base.');\n\t\t\t\tconsole.log(' Loading Exception: '+pException);\n\t\t\t}\n\t\t}\n\n\t\tthis.settings = tmpSettings;\n\t}\n\n\t// Build a default settings object. Use the JSON jimmy to ensure it is always a new object.\n\tbuildDefaultSettings()\n\t{\n\t\treturn JSON.parse(JSON.stringify(require('./Fable-Settings-Default')));\n\t}\n\n\t// Update the configuration for environment variable templating based on the current settings object\n\t_configureEnvTemplating(pSettings)\n\t{\n\t\t// default environment variable templating to on\n\t\tthis._PerformEnvTemplating = !pSettings || pSettings.NoEnvReplacement !== true;\n\t}\n\n\t// Resolve (recursive) any environment variables found in settings object.\n\t_resolveEnv(pSettings)\n\t{\n\t\tfor (const tmpKey in pSettings)\n\t\t{\n\t\t\tif (typeof(pSettings[tmpKey]) === 'object')\n\t\t\t{\n\t\t\t\tthis._resolveEnv(pSettings[tmpKey]);\n\t\t\t}\n\t\t\telse if (typeof(pSettings[tmpKey]) === 'string')\n\t\t\t{\n\t\t\t\tpSettings[tmpKey] = this.settingsTemplateProcessor.parseSetting(pSettings[tmpKey]);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Check to see if a value is an object (but not an array).\n\t */\n\t_isObject(value)\n\t{\n\t\treturn typeof(value) === 'object' && !Array.isArray(value);\n\t}\n\n\t/**\n\t * Merge two plain objects. Keys that are objects in both will be merged property-wise.\n\t */\n\t_deepMergeObjects(toObject, fromObject)\n\t{\n\t\tif (!fromObject || !this._isObject(fromObject))\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\tObject.keys(fromObject).forEach((key) =>\n\t\t{\n\t\t\tconst fromValue = fromObject[key];\n\t\t\tif (this._isObject(fromValue))\n\t\t\t{\n\t\t\t\tconst toValue = toObject[key];\n\t\t\t\tif (toValue && this._isObject(toValue))\n\t\t\t\t{\n\t\t\t\t\t// both are objects, so do a recursive merge\n\t\t\t\t\tthis._deepMergeObjects(toValue, fromValue);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttoObject[key] = fromValue;\n\t\t});\n\t\treturn toObject;\n\t}\n\n\t// Merge some new object into the existing settings.\n\tmerge(pSettingsFrom, pSettingsTo)\n\t{\n\t\t// If an invalid settings from object is passed in (e.g. object constructor without passing in anything) this should still work\n\t\tlet tmpSettingsFrom = (typeof(pSettingsFrom) === 'object') ? pSettingsFrom : {};\n\t\t// Default to the settings object if none is passed in for the merge.\n\t\tlet tmpSettingsTo = (typeof(pSettingsTo) === 'object') ? pSettingsTo : this.settings;\n\n\t\t// do not mutate the From object property values\n\t\tlet tmpSettingsFromCopy = JSON.parse(JSON.stringify(tmpSettingsFrom));\n\t\ttmpSettingsTo = this._deepMergeObjects(tmpSettingsTo, tmpSettingsFromCopy);\n\n\t\tif (this._PerformEnvTemplating)\n\t\t{\n\t\t\tthis._resolveEnv(tmpSettingsTo);\n\t\t}\n\t\t// Update env tempating config, since we just updated the config object, and it may have changed\n\t\tthis._configureEnvTemplating(tmpSettingsTo);\n\n\t\treturn tmpSettingsTo;\n\t}\n\n\t// Fill in settings gaps without overwriting settings that are already there\n\tfill(pSettingsFrom)\n\t{\n\t\t// If an invalid settings from object is passed in (e.g. object constructor without passing in anything) this should still work\n\t\tlet tmpSettingsFrom = (typeof(pSettingsFrom) === 'object') ? pSettingsFrom : {};\n\n\t\t// do not mutate the From object property values\n\t\tlet tmpSettingsFromCopy = JSON.parse(JSON.stringify(tmpSettingsFrom));\n\n\t\tthis.settings = this._deepMergeObjects(tmpSettingsFromCopy, this.settings);\n\n\t\treturn this.settings;\n\t}\n};\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableSettings(pSettings);\n}\n\nmodule.exports = FableSettings;\nmodule.exports.new = autoConstruct;\nmodule.exports.precedent = libPrecedent;\n},{\"./Fable-Settings-Default\":24,\"./Fable-Settings-TemplateProcessor.js\":25,\"precedent\":30}],27:[function(require,module,exports){\n/**\n* Random Byte Generator - Browser version\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\n// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n// Unique ID creation requires a high quality random # generator. In the\n// browser this is a little complicated due to unknown quality of Math.random()\n// and inconsistent support for the `crypto` API. We do the best we can via\n// feature-detection\nclass RandomBytes\n{\n\tconstructor()\n\t{\n\n\t\t// getRandomValues needs to be invoked in a context where \"this\" is a Crypto\n\t\t// implementation. Also, find the complete implementation of crypto on IE11.\n\t\tthis.getRandomValues = (typeof(crypto) != 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto)) ||\n \t\t(typeof(msCrypto) != 'undefined' && typeof window.msCrypto.getRandomValues == 'function' && msCrypto.getRandomValues.bind(msCrypto));\n\t}\n\n\t// WHATWG crypto RNG - http://wiki.whatwg.org/wiki/Crypto\n\tgenerateWhatWGBytes()\n\t{\n\t\tlet tmpBuffer = new Uint8Array(16); // eslint-disable-line no-undef\n\n\t\tthis.getRandomValues(tmpBuffer);\n\t\treturn tmpBuffer;\n\t}\n\n\t// Math.random()-based (RNG)\n\tgenerateRandomBytes()\n\t{\n\t\t// If all else fails, use Math.random(). It's fast, but is of unspecified\n\t\t// quality.\n\t\tlet tmpBuffer = new Uint8Array(16); // eslint-disable-line no-undef\n\n\t\tfor (let i = 0, tmpValue; i < 16; i++)\n\t\t{\n\t\t\tif ((i & 0x03) === 0)\n\t\t\t{\n\t\t\t\ttmpValue = Math.random() * 0x100000000;\n\t\t\t}\n\n\t\t\ttmpBuffer[i] = tmpValue >>> ((i & 0x03) << 3) & 0xff;\n\t\t}\n\n\t\treturn tmpBuffer;\n\t}\n\n\tgenerate()\n\t{\n\t\tif (this.getRandomValues)\n\t\t{\n\t\t\treturn this.generateWhatWGBytes();\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.generateRandomBytes();\n\t\t}\n\t}\n}\n\nmodule.exports = RandomBytes;\n\n},{}],28:[function(require,module,exports){\n/**\n* Fable UUID Generator\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable UUID\n*/\n\n/**\n* Fable Solution UUID Generation Main Class\n*\n* @class FableUUID\n* @constructor\n*/\n\nvar libRandomByteGenerator = require('./Fable-UUID-Random.js')\n\nclass FableUUID\n{\n\tconstructor(pSettings)\n\t{\n\t\t// Determine if the module is in \"Random UUID Mode\" which means just use the random character function rather than the v4 random UUID spec.\n\t\t// Note this allows UUIDs of various lengths (including very short ones) although guaranteed uniqueness goes downhill fast.\n\t\tthis._UUIDModeRandom = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDModeRandom')) ? (pSettings.UUIDModeRandom == true) : false;\n\t\t// These two properties are only useful if we are in Random mode. Otherwise it generates a v4 spec\n\t\t// Length for \"Random UUID Mode\" is set -- if not set it to 8\n\t\tthis._UUIDLength = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDLength')) ? (pSettings.UUIDLength + 0) : 8;\n\t\t// Dictionary for \"Random UUID Mode\"\n\t\tthis._UUIDRandomDictionary = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDDictionary')) ? (pSettings.UUIDDictionary + 0) : '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ';\n\n\t\tthis.randomByteGenerator = new libRandomByteGenerator();\n\n\t\t// Lookup table for hex codes\n\t\tthis._HexLookup = [];\n\t\tfor (let i = 0; i < 256; ++i)\n\t\t{\n\t\t\tthis._HexLookup[i] = (i + 0x100).toString(16).substr(1);\n\t\t}\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tbytesToUUID(pBuffer)\n\t{\n\t\tlet i = 0;\n\t\t// join used to fix memory issue caused by concatenation: https://bugs.chromium.org/p/v8/issues/detail?id=3175#c4\n\t\treturn ([\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], \n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]]\n\t\t\t\t]).join('');\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tgenerateUUIDv4()\n\t{\n\t\tlet tmpBuffer = new Array(16);\n\t\tvar tmpRandomBytes = this.randomByteGenerator.generate();\n\n\t\t// Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\t\ttmpRandomBytes[6] = (tmpRandomBytes[6] & 0x0f) | 0x40;\n\t\ttmpRandomBytes[8] = (tmpRandomBytes[8] & 0x3f) | 0x80;\n\n\t\treturn this.bytesToUUID(tmpRandomBytes);\n\t}\n\n\t// Simple random UUID generation\n\tgenerateRandom()\n\t{\n\t\tlet tmpUUID = '';\n\n\t\tfor (let i = 0; i < this._UUIDLength; i++)\n\t\t{\n\t\t\ttmpUUID += this._UUIDRandomDictionary.charAt(Math.floor(Math.random() * (this._UUIDRandomDictionary.length-1)));\n\t\t}\n\n\t\treturn tmpUUID;\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tgetUUID()\n\t{\n\t\tif (this._UUIDModeRandom)\n\t\t{\n\t\t\treturn this.generateRandom();\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.generateUUIDv4();\n\t\t}\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableUUID(pSettings);\n}\n\n\nmodule.exports = FableUUID;\nmodule.exports.new = autoConstruct;\n\n},{\"./Fable-UUID-Random.js\":27}],29:[function(require,module,exports){\n(function (process){(function (){\n// 'path' module extracted from Node.js v8.11.1 (only the posix part)\n// transplited with Babel\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\n'use strict';\n\nfunction assertPath(path) {\n if (typeof path !== 'string') {\n throw new TypeError('Path must be a string. Received ' + JSON.stringify(path));\n }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n var res = '';\n var lastSegmentLength = 0;\n var lastSlash = -1;\n var dots = 0;\n var code;\n for (var i = 0; i <= path.length; ++i) {\n if (i < path.length)\n code = path.charCodeAt(i);\n else if (code === 47 /*/*/)\n break;\n else\n code = 47 /*/*/;\n if (code === 47 /*/*/) {\n if (lastSlash === i - 1 || dots === 1) {\n // NOOP\n } else if (lastSlash !== i - 1 && dots === 2) {\n if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) {\n if (res.length > 2) {\n var lastSlashIndex = res.lastIndexOf('/');\n if (lastSlashIndex !== res.length - 1) {\n if (lastSlashIndex === -1) {\n res = '';\n lastSegmentLength = 0;\n } else {\n res = res.slice(0, lastSlashIndex);\n lastSegmentLength = res.length - 1 - res.lastIndexOf('/');\n }\n lastSlash = i;\n dots = 0;\n continue;\n }\n } else if (res.length === 2 || res.length === 1) {\n res = '';\n lastSegmentLength = 0;\n lastSlash = i;\n dots = 0;\n continue;\n }\n }\n if (allowAboveRoot) {\n if (res.length > 0)\n res += '/..';\n else\n res = '..';\n lastSegmentLength = 2;\n }\n } else {\n if (res.length > 0)\n res += '/' + path.slice(lastSlash + 1, i);\n else\n res = path.slice(lastSlash + 1, i);\n lastSegmentLength = i - lastSlash - 1;\n }\n lastSlash = i;\n dots = 0;\n } else if (code === 46 /*.*/ && dots !== -1) {\n ++dots;\n } else {\n dots = -1;\n }\n }\n return res;\n}\n\nfunction _format(sep, pathObject) {\n var dir = pathObject.dir || pathObject.root;\n var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || '');\n if (!dir) {\n return base;\n }\n if (dir === pathObject.root) {\n return dir + base;\n }\n return dir + sep + base;\n}\n\nvar posix = {\n // path.resolve([from ...], to)\n resolve: function resolve() {\n var resolvedPath = '';\n var resolvedAbsolute = false;\n var cwd;\n\n for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n var path;\n if (i >= 0)\n path = arguments[i];\n else {\n if (cwd === undefined)\n cwd = process.cwd();\n path = cwd;\n }\n\n assertPath(path);\n\n // Skip empty entries\n if (path.length === 0) {\n continue;\n }\n\n resolvedPath = path + '/' + resolvedPath;\n resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/;\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n if (resolvedAbsolute) {\n if (resolvedPath.length > 0)\n return '/' + resolvedPath;\n else\n return '/';\n } else if (resolvedPath.length > 0) {\n return resolvedPath;\n } else {\n return '.';\n }\n },\n\n normalize: function normalize(path) {\n assertPath(path);\n\n if (path.length === 0) return '.';\n\n var isAbsolute = path.charCodeAt(0) === 47 /*/*/;\n var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/;\n\n // Normalize the path\n path = normalizeStringPosix(path, !isAbsolute);\n\n if (path.length === 0 && !isAbsolute) path = '.';\n if (path.length > 0 && trailingSeparator) path += '/';\n\n if (isAbsolute) return '/' + path;\n return path;\n },\n\n isAbsolute: function isAbsolute(path) {\n assertPath(path);\n return path.length > 0 && path.charCodeAt(0) === 47 /*/*/;\n },\n\n join: function join() {\n if (arguments.length === 0)\n return '.';\n var joined;\n for (var i = 0; i < arguments.length; ++i) {\n var arg = arguments[i];\n assertPath(arg);\n if (arg.length > 0) {\n if (joined === undefined)\n joined = arg;\n else\n joined += '/' + arg;\n }\n }\n if (joined === undefined)\n return '.';\n return posix.normalize(joined);\n },\n\n relative: function relative(from, to) {\n assertPath(from);\n assertPath(to);\n\n if (from === to) return '';\n\n from = posix.resolve(from);\n to = posix.resolve(to);\n\n if (from === to) return '';\n\n // Trim any leading backslashes\n var fromStart = 1;\n for (; fromStart < from.length; ++fromStart) {\n if (from.charCodeAt(fromStart) !== 47 /*/*/)\n break;\n }\n var fromEnd = from.length;\n var fromLen = fromEnd - fromStart;\n\n // Trim any leading backslashes\n var toStart = 1;\n for (; toStart < to.length; ++toStart) {\n if (to.charCodeAt(toStart) !== 47 /*/*/)\n break;\n }\n var toEnd = to.length;\n var toLen = toEnd - toStart;\n\n // Compare paths to find the longest common path from root\n var length = fromLen < toLen ? fromLen : toLen;\n var lastCommonSep = -1;\n var i = 0;\n for (; i <= length; ++i) {\n if (i === length) {\n if (toLen > length) {\n if (to.charCodeAt(toStart + i) === 47 /*/*/) {\n // We get here if `from` is the exact base path for `to`.\n // For example: from='/foo/bar'; to='/foo/bar/baz'\n return to.slice(toStart + i + 1);\n } else if (i === 0) {\n // We get here if `from` is the root\n // For example: from='/'; to='/foo'\n return to.slice(toStart + i);\n }\n } else if (fromLen > length) {\n if (from.charCodeAt(fromStart + i) === 47 /*/*/) {\n // We get here if `to` is the exact base path for `from`.\n // For example: from='/foo/bar/baz'; to='/foo/bar'\n lastCommonSep = i;\n } else if (i === 0) {\n // We get here if `to` is the root.\n // For example: from='/foo'; to='/'\n lastCommonSep = 0;\n }\n }\n break;\n }\n var fromCode = from.charCodeAt(fromStart + i);\n var toCode = to.charCodeAt(toStart + i);\n if (fromCode !== toCode)\n break;\n else if (fromCode === 47 /*/*/)\n lastCommonSep = i;\n }\n\n var out = '';\n // Generate the relative path based on the path difference between `to`\n // and `from`\n for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n if (i === fromEnd || from.charCodeAt(i) === 47 /*/*/) {\n if (out.length === 0)\n out += '..';\n else\n out += '/..';\n }\n }\n\n // Lastly, append the rest of the destination (`to`) path that comes after\n // the common path parts\n if (out.length > 0)\n return out + to.slice(toStart + lastCommonSep);\n else {\n toStart += lastCommonSep;\n if (to.charCodeAt(toStart) === 47 /*/*/)\n ++toStart;\n return to.slice(toStart);\n }\n },\n\n _makeLong: function _makeLong(path) {\n return path;\n },\n\n dirname: function dirname(path) {\n assertPath(path);\n if (path.length === 0) return '.';\n var code = path.charCodeAt(0);\n var hasRoot = code === 47 /*/*/;\n var end = -1;\n var matchedSlash = true;\n for (var i = path.length - 1; i >= 1; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n if (!matchedSlash) {\n end = i;\n break;\n }\n } else {\n // We saw the first non-path separator\n matchedSlash = false;\n }\n }\n\n if (end === -1) return hasRoot ? '/' : '.';\n if (hasRoot && end === 1) return '//';\n return path.slice(0, end);\n },\n\n basename: function basename(path, ext) {\n if (ext !== undefined && typeof ext !== 'string') throw new TypeError('\"ext\" argument must be a string');\n assertPath(path);\n\n var start = 0;\n var end = -1;\n var matchedSlash = true;\n var i;\n\n if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n if (ext.length === path.length && ext === path) return '';\n var extIdx = ext.length - 1;\n var firstNonSlashEnd = -1;\n for (i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else {\n if (firstNonSlashEnd === -1) {\n // We saw the first non-path separator, remember this index in case\n // we need it if the extension ends up not matching\n matchedSlash = false;\n firstNonSlashEnd = i + 1;\n }\n if (extIdx >= 0) {\n // Try to match the explicit extension\n if (code === ext.charCodeAt(extIdx)) {\n if (--extIdx === -1) {\n // We matched the extension, so mark this as the end of our path\n // component\n end = i;\n }\n } else {\n // Extension does not match, so our result is the entire path\n // component\n extIdx = -1;\n end = firstNonSlashEnd;\n }\n }\n }\n }\n\n if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length;\n return path.slice(start, end);\n } else {\n for (i = path.length - 1; i >= 0; --i) {\n if (path.charCodeAt(i) === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // path component\n matchedSlash = false;\n end = i + 1;\n }\n }\n\n if (end === -1) return '';\n return path.slice(start, end);\n }\n },\n\n extname: function extname(path) {\n assertPath(path);\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n for (var i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1)\n startDot = i;\n else if (preDotState !== 1)\n preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n return '';\n }\n return path.slice(startDot, end);\n },\n\n format: function format(pathObject) {\n if (pathObject === null || typeof pathObject !== 'object') {\n throw new TypeError('The \"pathObject\" argument must be of type Object. Received type ' + typeof pathObject);\n }\n return _format('/', pathObject);\n },\n\n parse: function parse(path) {\n assertPath(path);\n\n var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n if (path.length === 0) return ret;\n var code = path.charCodeAt(0);\n var isAbsolute = code === 47 /*/*/;\n var start;\n if (isAbsolute) {\n ret.root = '/';\n start = 1;\n } else {\n start = 0;\n }\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n var i = path.length - 1;\n\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n\n // Get non-dir info\n for (; i >= start; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n if (end !== -1) {\n if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end);\n }\n } else {\n if (startPart === 0 && isAbsolute) {\n ret.name = path.slice(1, startDot);\n ret.base = path.slice(1, end);\n } else {\n ret.name = path.slice(startPart, startDot);\n ret.base = path.slice(startPart, end);\n }\n ret.ext = path.slice(startDot, end);\n }\n\n if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/';\n\n return ret;\n },\n\n sep: '/',\n delimiter: ':',\n win32: null,\n posix: null\n};\n\nposix.posix = posix;\n\nmodule.exports = posix;\n\n}).call(this)}).call(this,require('_process'))\n\n},{\"_process\":33}],30:[function(require,module,exports){\n/**\n* Precedent Meta-Templating\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Process text streams, parsing out meta-template expressions.\n*/\nvar libWordTree = require(`./WordTree.js`);\nvar libStringParser = require(`./StringParser.js`);\n\nclass Precedent\n{\n\t/**\n\t * Precedent Constructor\n\t */\n\tconstructor()\n\t{\n\t\tthis.WordTree = new libWordTree();\n\n\t\tthis.StringParser = new libStringParser();\n\n\t\tthis.ParseTree = this.WordTree.ParseTree;\n\t}\n\n\t/**\n\t * Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pTree - A node on the parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern(pPatternStart, pPatternEnd, pParser)\n\t{\n\t\treturn this.WordTree.addPattern(pPatternStart, pPatternEnd, pParser);\n\t}\n\n\t/**\n\t * Parse a string with the existing parse tree\n\t * @method parseString\n\t * @param {string} pString - The string to parse\n\t * @param {object} pData - Data to pass in as the second argument\n\t * @return {string} The result from the parser\n\t */\n\tparseString(pString, pData)\n\t{\n\t\treturn this.StringParser.parseString(pString, this.ParseTree, pData);\n\t}\n}\n\nmodule.exports = Precedent;\n\n},{\"./StringParser.js\":31,\"./WordTree.js\":32}],31:[function(require,module,exports){\n/**\n* String Parser\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Parse a string, properly processing each matched token in the word tree.\n*/\n\nclass StringParser\n{\n\t/**\n\t * StringParser Constructor\n\t */\n\tconstructor()\n\t{\n\t}\n\n\t/**\n\t * Create a fresh parsing state object to work with.\n\t * @method newParserState\n\t * @param {Object} pParseTree - A node on the parse tree to begin parsing from (usually root)\n\t * @return {Object} A new parser state object for running a character parser on\n\t * @private\n\t */\n\tnewParserState (pParseTree)\n\t{\n\t\treturn (\n\t\t{\n\t\t\tParseTree: pParseTree,\n\n\t\t\tOutput: '',\n\t\t\tOutputBuffer: '',\n\n\t\t\tPattern: false,\n\n\t\t\tPatternMatch: false,\n\t\t\tPatternMatchOutputBuffer: ''\n\t\t});\n\t}\n\n\t/**\n\t * Assign a node of the parser tree to be the next potential match.\n\t * If the node has a PatternEnd property, it is a valid match and supercedes the last valid match (or becomes the initial match).\n\t * @method assignNode\n\t * @param {Object} pNode - A node on the parse tree to assign\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tassignNode (pNode, pParserState)\n\t{\n\t\tpParserState.PatternMatch = pNode;\n\n\t\t// If the pattern has a END we can assume it has a parse function...\n\t\tif (pParserState.PatternMatch.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\t// ... this is the legitimate start of a pattern.\n\t\t\tpParserState.Pattern = pParserState.PatternMatch;\n\t\t}\n\t}\n\n\t/**\n\t * Append a character to the output buffer in the parser state.\n\t * This output buffer is used when a potential match is being explored, or a match is being explored.\n\t * @method appendOutputBuffer\n\t * @param {string} pCharacter - The character to append\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tappendOutputBuffer (pCharacter, pParserState)\n\t{\n\t\tpParserState.OutputBuffer += pCharacter;\n\t}\n\n\t/**\n\t * Flush the output buffer to the output and clear it.\n\t * @method flushOutputBuffer\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tflushOutputBuffer (pParserState)\n\t{\n\t\tpParserState.Output += pParserState.OutputBuffer;\n\t\tpParserState.OutputBuffer = '';\n\t}\n\n\n\t/**\n\t * Check if the pattern has ended. If it has, properly flush the buffer and start looking for new patterns.\n\t * @method checkPatternEnd\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tcheckPatternEnd (pParserState, pData)\n\t{\n\t\tif ((pParserState.OutputBuffer.length >= pParserState.Pattern.PatternEnd.length+pParserState.Pattern.PatternStart.length) &&\n\t\t\t(pParserState.OutputBuffer.substr(-pParserState.Pattern.PatternEnd.length) === pParserState.Pattern.PatternEnd))\n\t\t{\n\t\t\t// ... this is the end of a pattern, cut off the end tag and parse it.\n\t\t\t// Trim the start and end tags off the output buffer now\n\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStart.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStart.length+pParserState.Pattern.PatternEnd.length)), pData);\n\t\t\t// Flush the output buffer.\n\t\t\tthis.flushOutputBuffer(pParserState);\n\t\t\t// End pattern mode\n\t\t\tpParserState.Pattern = false;\n\t\t\tpParserState.PatternMatch = false;\n\t\t}\n\t}\n\n\t/**\n\t * Parse a character in the buffer.\n\t * @method parseCharacter\n\t * @param {string} pCharacter - The character to append\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tparseCharacter (pCharacter, pParserState, pData)\n\t{\n\t\t// (1) If we aren't in a pattern match, and we aren't potentially matching, and this may be the start of a new pattern....\n\t\tif (!pParserState.PatternMatch && pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t{\n\t\t\t// ... assign the node as the matched node.\n\t\t\tthis.assignNode(pParserState.ParseTree[pCharacter], pParserState);\n\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t}\n\t\t// (2) If we are in a pattern match (actively seeing if this is part of a new pattern token)\n\t\telse if (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern has a subpattern with this key\n\t\t\tif (pParserState.PatternMatch.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// Continue matching patterns.\n\t\t\t\tthis.assignNode(pParserState.PatternMatch[pCharacter], pParserState);\n\t\t\t}\n\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\tif (pParserState.Pattern)\n\t\t\t{\n\t\t\t\t// ... Check if this is the end of the pattern (if we are matching a valid pattern)...\n\t\t\t\tthis.checkPatternEnd(pParserState, pData);\n\t\t\t}\n\t\t}\n\t\t// (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\telse\n\t\t{\n\t\t\tpParserState.Output += pCharacter;\n\t\t}\n\t}\n\n\t/**\n\t * Parse a string for matches, and process any template segments that occur.\n\t * @method parseString\n\t * @param {string} pString - The string to parse.\n\t * @param {Object} pParseTree - The parse tree to begin parsing from (usually root)\n\t * @param {Object} pData - The data to pass to the function as a second paramter\n\t */\n\tparseString (pString, pParseTree, pData)\n\t{\n\t\tlet tmpParserState = this.newParserState(pParseTree);\n\n\t\tfor (var i = 0; i < pString.length; i++)\n\t\t{\n\t\t\t// TODO: This is not fast.\n\t\t\tthis.parseCharacter(pString[i], tmpParserState, pData);\n\t\t}\n\n\t\tthis.flushOutputBuffer(tmpParserState);\n\n\t\treturn tmpParserState.Output;\n\t}\n}\n\nmodule.exports = StringParser;\n\n},{}],32:[function(require,module,exports){\n/**\n* Word Tree\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Create a tree (directed graph) of Javascript objects, one character per object.\n*/\n\nclass WordTree\n{\n\t/**\n\t * WordTree Constructor\n\t */\n\tconstructor()\n\t{\n\t\tthis.ParseTree = {};\n\t}\n\t\n\t/** \n\t * Add a child character to a Parse Tree node\n\t * @method addChild\n\t * @param {Object} pTree - A parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - The index of the character in the pattern\n\t * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddChild (pTree, pPattern, pIndex)\n\t{\n\t\tif (!pTree.hasOwnProperty(pPattern[pIndex]))\n\t\t\tpTree[pPattern[pIndex]] = {};\n\t\t\n\t\treturn pTree[pPattern[pIndex]];\n\t}\n\t\n\t/** Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pPatternStart - The starting string for the pattern (e.g. \"${\")\n\t * @param {string} pPatternEnd - The ending string for the pattern (e.g. \"}\")\n\t * @param {number} pParser - The function to parse if this is the matched pattern, once the Pattern End is met. If this is a string, a simple replacement occurs.\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern (pPatternStart, pPatternEnd, pParser)\n\t{\n\t\tif (pPatternStart.length < 1)\n\t\t\treturn false;\n\n\t\tif ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length < 1))\n\t\t\treturn false;\n\n\t\tlet tmpLeaf = this.ParseTree;\n\n\t\t// Add the tree of leaves iteratively\n\t\tfor (var i = 0; i < pPatternStart.length; i++)\n\t\t\ttmpLeaf = this.addChild(tmpLeaf, pPatternStart, i);\n\n\t\ttmpLeaf.PatternStart = pPatternStart;\n\t\ttmpLeaf.PatternEnd = ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length > 0)) ? pPatternEnd : pPatternStart;\n\t\ttmpLeaf.Parse = (typeof(pParser) === 'function') ? pParser : \n\t\t\t\t\t\t(typeof(pParser) === 'string') ? () => { return pParser; } :\n\t\t\t\t\t\t(pData) => { return pData; };\n\n\t\treturn true;\n\t}\n}\n\nmodule.exports = WordTree;\n\n},{}],33:[function(require,module,exports){\n// 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\n},{}],34:[function(require,module,exports){\n(function (setImmediate,clearImmediate){(function (){\nvar nextTick = require('process/browser.js').nextTick;\nvar apply = Function.prototype.apply;\nvar slice = Array.prototype.slice;\nvar immediateIds = {};\nvar nextImmediateId = 0;\n\n// DOM APIs, for completeness\n\nexports.setTimeout = function() {\n return new Timeout(apply.call(setTimeout, window, arguments), clearTimeout);\n};\nexports.setInterval = function() {\n return new Timeout(apply.call(setInterval, window, arguments), clearInterval);\n};\nexports.clearTimeout =\nexports.clearInterval = function(timeout) { timeout.close(); };\n\nfunction Timeout(id, clearFn) {\n this._id = id;\n this._clearFn = clearFn;\n}\nTimeout.prototype.unref = Timeout.prototype.ref = function() {};\nTimeout.prototype.close = function() {\n this._clearFn.call(window, this._id);\n};\n\n// Does not start the time, just sets up the members needed.\nexports.enroll = function(item, msecs) {\n clearTimeout(item._idleTimeoutId);\n item._idleTimeout = msecs;\n};\n\nexports.unenroll = function(item) {\n clearTimeout(item._idleTimeoutId);\n item._idleTimeout = -1;\n};\n\nexports._unrefActive = exports.active = function(item) {\n clearTimeout(item._idleTimeoutId);\n\n var msecs = item._idleTimeout;\n if (msecs >= 0) {\n item._idleTimeoutId = setTimeout(function onTimeout() {\n if (item._onTimeout)\n item._onTimeout();\n }, msecs);\n }\n};\n\n// That's not how node.js implements it but the exposed api is the same.\nexports.setImmediate = typeof setImmediate === \"function\" ? setImmediate : function(fn) {\n var id = nextImmediateId++;\n var args = arguments.length < 2 ? false : slice.call(arguments, 1);\n\n immediateIds[id] = true;\n\n nextTick(function onNextTick() {\n if (immediateIds[id]) {\n // fn.call() is faster so we optimize for the common use-case\n // @see http://jsperf.com/call-apply-segu\n if (args) {\n fn.apply(null, args);\n } else {\n fn.call(null);\n }\n // Prevent ids from leaking\n exports.clearImmediate(id);\n }\n });\n\n return id;\n};\n\nexports.clearImmediate = typeof clearImmediate === \"function\" ? clearImmediate : function(id) {\n delete immediateIds[id];\n};\n}).call(this)}).call(this,require(\"timers\").setImmediate,require(\"timers\").clearImmediate)\n\n},{\"process/browser.js\":33,\"timers\":34}],35:[function(require,module,exports){\nvar libNPMModuleWrapper = require('./Fable.js');\n\nif ((typeof(window) === 'object') && !window.hasOwnProperty('Fable'))\n{\n\twindow.Fable = libNPMModuleWrapper;\n}\n\nmodule.exports = libNPMModuleWrapper;\n},{\"./Fable.js\":43}],36:[function(require,module,exports){\nconst _OperationStatePrototype = JSON.stringify(\n{\n\t\"Metadata\": {\n\t\t\"GUID\": false,\n\t\t\"Hash\": false,\n\n\t\t\"Title\": \"\",\n\t\t\"Summary\": \"\",\n\n\t\t\"Version\": 0\n\t},\n\t\"Status\": {\n \"Completed\": false,\n\n \"CompletionProgress\": 0,\n \"CompletionTimeElapsed\": 0,\n\n \"Steps\": 1,\n \"StepsCompleted\": 0,\n\n \"StartTime\": 0,\n \"EndTime\": 0\n\t},\n\t\"Errors\": [],\n\t\"Log\": []\n});\n\nclass FableOperation\n{\n\tconstructor(pFable, pOperationName, pOperationHash)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.name = pOperationName;\n\n\t\tthis.state = JSON.parse(_OperationStatePrototype);\n\n\t\tthis.state.Metadata.GUID = this.fable.getUUID();\n\t\tthis.state.Metadata.Hash = this.state.GUID;\n\n\t\tif (typeof(pOperationHash) == 'string')\n\t\t{\n\t\t\tthis.state.Metadata.Hash = pOperationHash;\n\t\t}\n\t}\n\n\tget GUID()\n\t{\n\t\treturn this.state.Metadata.GUID;\n\t}\n\n\tget Hash()\n\t{\n\t\treturn this.state.Metadata.Hash;\n\t}\n\n\tget log()\n\t{\n\t\treturn this;\n\t}\n\n\twriteOperationLog(pLogLevel, pLogText, pLogObject)\n\t{\n\t\tthis.state.Log.push(`${new Date().toUTCString()} [${pLogLevel}]: ${pLogText}`);\n\n\t\tif (typeof(pLogObject) == 'object')\n\t\t{\n\t\t\tthis.state.Log.push(JSON.stringify(pLogObject));\n\t\t}\n\t}\n\n\twriteOperationErrors(pLogText, pLogObject)\n\t{\n\t\tthis.state.Errors.push(`${pLogText}`);\n\n\t\tif (typeof(pLogObject) == 'object')\n\t\t{\n\t\t\tthis.state.Errors.push(JSON.stringify(pLogObject));\n\t\t}\n\t}\n\n\ttrace(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('TRACE', pLogText, pLogObject);\n\t\tthis.fable.log.trace(pLogText, pLogObject);\n\t}\n\n\tdebug(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('DEBUG', pLogText, pLogObject);\n\t\tthis.fable.log.debug(pLogText, pLogObject);\n\t}\n\n\tinfo(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('INFO', pLogText, pLogObject);\n\t\tthis.fable.log.info(pLogText, pLogObject);\n\t}\n\n\twarn(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('WARN', pLogText, pLogObject);\n\t\tthis.fable.log.warn(pLogText, pLogObject);\n\t}\n\n\terror(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('ERROR', pLogText, pLogObject);\n\t\tthis.writeOperationErrors(pLogText, pLogObject);\n\t\tthis.fable.log.error(pLogText, pLogObject);\n\t}\n\n\tfatal(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('FATAL', pLogText, pLogObject);\n\t\tthis.writeOperationErrors(pLogText, pLogObject);\n\t\tthis.fable.log.fatal(pLogText, pLogObject);\n\t}\n}\n\nmodule.exports = FableOperation;\n},{}],37:[function(require,module,exports){\nconst libFableServiceBase = require('./Fable-ServiceProviderBase.js');\nconst libDataArithmatic = require('data-arithmatic');\n\nclass FableServiceDataArithmatic extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'DataArithmatic';\n\n this._DataArithmaticLibrary = new libDataArithmatic();\n\t}\n}\n\nmodule.exports = FableServiceDataArithmatic;\n},{\"./Fable-ServiceProviderBase.js\":42,\"data-arithmatic\":17}],38:[function(require,module,exports){\nconst libFableServiceBase = require('./Fable-ServiceProviderBase.js');\n\nconst libPrecedent = require('precedent');\n\nclass FableServiceMetaTemplate extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'MetaTemplate';\n\n this._MetaTemplateLibrary = new libPrecedent(this.options);\n\t}\n\n\t/**\n\t * Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pTree - A node on the parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern(pPatternStart, pPatternEnd, pParser)\n\t{\n\t\treturn this._MetaTemplateLibrary.addPattern(pPatternStart, pPatternEnd, pParser);\n\t}\n\n\t/**\n\t * Parse a string with the existing parse tree\n\t * @method parseString\n\t * @param {string} pString - The string to parse\n\t * @return {string} The result from the parser\n\t */\n\tparseString(pString, pData)\n\t{\n\t\treturn this._MetaTemplateLibrary.parseString(pString, pData);\n\t}\n}\n\nmodule.exports = FableServiceMetaTemplate;\n},{\"./Fable-ServiceProviderBase.js\":42,\"precedent\":30}],39:[function(require,module,exports){\nconst libFableServiceBase = require('./Fable-ServiceProviderBase.js');\n\nclass FableServiceTemplate extends libFableServiceBase\n{\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\t//\n\t// NOTE: This does not implement underscore escape expressions\n\t// NOTE: This does not implement underscore magic browser variable assignment\n\t//\n\t// This is an implementation of that.\n\t// TODO: Make this use precedent, add configuration, add debugging.\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'Template';\n\n\t\t// These are the exact regex's used in lodash/underscore\n\t\t// TODO: Switch this to precedent\n\t\tthis.Matchers = (\n\t\t\t{\n\t\t\t\tEvaluate: /<%([\\s\\S]+?)%>/g,\n\t\t\t\tInterpolate: /<%=([\\s\\S]+?)%>/g,\n\t\t\t\tEscaper: /\\\\|'|\\r|\\n|\\t|\\u2028|\\u2029/g,\n\t\t\t\tUnescaper: /\\\\(\\\\|'|r|n|t|u2028|u2029)/g,\n\t\t\t\t// This is how underscore does it, so we are keeping it for now.\n\t\t\t\tGuaranteedNonMatch: /.^/\n\t\t\t});\n\n\t\t// This is a helper for the escaper and unescaper functions.\n\t\t// Right now we are going to keep what underscore is doing, but, not forever.\n\t\tthis.templateEscapes = {\n\t\t\t'\\\\': '\\\\',\n\t\t\t\"'\": \"'\",\n\t\t\t'r': '\\r',\n\t\t\t'\\r': 'r',\n\t\t\t'n': '\\n',\n\t\t\t'\\n': 'n',\n\t\t\t't': '\\t',\n\t\t\t'\\t': 't',\n\t\t\t'u2028': '\\u2028',\n\t\t\t'\\u2028': 'u2028',\n\t\t\t'u2029': '\\u2029',\n\t\t\t'\\u2029': 'u2029'\n\t\t};\n\n\t\t// This is defined as such to underscore that it is a dynamic programming\n\t\t// function on this class.\n\t\tthis.renderFunction = false;\n this.templateString = false;\n\t}\n\n\trenderTemplate(pData)\n\t{\n\t\treturn this.renderFunction(pData);\n\t}\n\n\ttemplateFunction(pData)\n\t{\n\t\tlet fRenderTemplateBound = this.renderTemplate.bind(this);\n\t\treturn fRenderTemplateBound;\n\t}\n\n\tbuildTemplateFunction(pTemplateText, pData)\n\t{\n\t\t// For now this is being kept in a weird form ... this is to mimic the old\n\t\t// underscore code until this is rewritten using precedent.\n\t\tthis.TemplateSource = \"__p+='\" + pTemplateText\n\t\t\t.replace(this.Matchers.Escaper,\n\t\t\t\t(pMatch)=>\n\t\t\t\t{\n\t\t\t\t\treturn `\\\\${this.templateEscapes[pMatch]}`;\n\t\t\t\t})\n\t\t\t.replace(this.Matchers.Interpolate || this.Matchers.GuaranteedNonMatch,\n\t\t\t\t(pMatch, pCode) =>\n\t\t\t\t{\n\t\t\t\t\treturn `'+\\n(${decodeURIComponent(pCode)})+\\n'`;\n\t\t\t\t})\n\t\t\t.replace(this.Matchers.Evaluate || this.Matchers.GuaranteedNonMatch,\n\t\t\t\t(pMatch, pCode) =>\n\t\t\t\t{\n\t\t\t\t\treturn `';\\n${decodeURIComponent(pCode)}\\n;__p+='`;\n\t\t\t\t}) + `';\\n`;\n\n\n\t\tthis.TemplateSource = `with(pTemplateDataObject||{}){\\n${this.TemplateSource}}\\n`;\n\t\tthis.TemplateSource = `var __p='';var print=function(){__p+=Array.prototype.join.call(arguments, '')};\\n${this.TemplateSource}return __p;\\n`;\n\n\t\tthis.renderFunction = new Function('pTemplateDataObject', this.TemplateSource);\n\n\t\tif (typeof(pData) != 'undefined')\n\t\t{\n\t\t\treturn this.renderFunction(pData);\n\t\t}\n\n\t\t// Provide the compiled function source as a convenience for build time\n\t\t// precompilation.\n\t\tthis.TemplateSourceCompiled = 'function(obj){\\n' + this.TemplateSource + '}';\n\n\t\treturn this.templateFunction();\n\t}\n}\n\nmodule.exports = FableServiceTemplate;\n},{\"./Fable-ServiceProviderBase.js\":42}],40:[function(require,module,exports){\nconst libFableServiceBase = require('./Fable-ServiceProviderBase.js');\n\n\n// TODO: These are still pretty big -- consider the smaller polyfills\nconst libAsyncWaterfall = require('async.waterfall');\nconst libAsyncEachLimit = require('async.eachlimit');\n\nclass FableServiceUtility extends libFableServiceBase\n{\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\t//\n\t// NOTE: This does not implement underscore escape expressions\n\t// NOTE: This does not implement underscore magic browser variable assignment\n\t//\n\t// This is an implementation of that.\n\t// TODO: Make this use precedent, add configuration, add debugging.\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n\t\tthis.templates = {};\n\n\t\t// These two functions are used extensively throughout\n\t\tthis.waterfall = libAsyncWaterfall;\n\t\tthis.eachLimit = libAsyncEachLimit;\n\t}\n\n\t// Underscore and lodash have a behavior, _.extend, which merges objects.\n\t// Now that es6 gives us this, use the native thingy.\n\textend(pDestinationObject, ...pSourceObjects)\n\t{\n\t\treturn Object.assign(pDestinationObject, ...pSourceObjects);\n\t}\n\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\ttemplate(pTemplateText, pData)\n\t{\n\t\tlet tmpTemplate = this.fable.serviceManager.instantiateServiceProviderWithoutRegistration('Template');\n\n\t\treturn tmpTemplate.buildTemplateFunction(pTemplateText, pData);\n\t}\n\n\t// Build a template function from a template hash, and, register it with the service provider\n\tbuildHashedTemplate(pTemplateHash, pTemplateText, pData)\n\t{\n\t\tlet tmpTemplate = this.fable.serviceManager.instantiateServiceProvider('Template', {}, pTemplateHash);\n\n\t\tthis.templates[pTemplateHash] = tmpTemplate.buildTemplateFunction(pTemplateText, pData);\n\n\t\treturn this.templates[pTemplateHash];\n\t}\n\n\t// This is a safe, modern version of chunk from underscore\n\t// Algorithm pulled from a mix of these two polyfills:\n\t// https://github.com/you-dont-need/You-Dont-Need-Lodash-Underscore#_chunk\n\t// https://youmightnotneed.com/lodash\n\t// This implementation was most tolerant in browsers. Uglify can fix the rest.\n\tchunk (pInput, pChunkSize, pChunkCache)\n\t{\n\t\tlet tmpInputArray = [...pInput];\n\t\t// Note lodash defaults to 1, underscore defaults to 0\n\t\tlet tmpChunkSize = (typeof(pChunkSize) == 'number') ? pChunkSize : 0;\n\t\tlet tmpChunkCache = (typeof(pChunkCache) != 'undefined') ? pChunkCache : [];\n\n\t\tif (tmpChunkSize <= 0)\n\t\t{\n\t\t\treturn tmpChunkCache;\n\t\t}\n\n\t\twhile (tmpInputArray.length)\n\t\t{\n\t\t\ttmpChunkCache.push(tmpInputArray.splice(0, tmpChunkSize));\n\t\t}\n\n\t\treturn tmpChunkCache;\n\t}\n}\n\nmodule.exports = FableServiceUtility;\n},{\"./Fable-ServiceProviderBase.js\":42,\"async.eachlimit\":1,\"async.waterfall\":15}],41:[function(require,module,exports){\n/**\n* Fable Application Services Management\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\nconst libFableServiceBase = require('./Fable-ServiceProviderBase.js');\n\nclass FableService\n{\n\tconstructor(pFable)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.serviceTypes = [];\n\n\t\t// A map of instantiated services\n\t\tthis.services = {};\n\n\t\t// A map of the default instantiated service by type\n\t\tthis.defaultServices = {};\n\n\t\t// A map of class constructors for services\n\t\tthis.serviceClasses = {};\n\t}\n\n\taddServiceType(pServiceType, pServiceClass)\n\t{\n\t\t// Add the type to the list of types\n\t\tthis.serviceTypes.push(pServiceType);\n\n\t\t// Add the container for instantiated services to go in\n\t\tthis.services[pServiceType] = {};\n\n\t\tif ((typeof(pServiceClass) == 'function') && (pServiceClass.prototype instanceof libFableServiceBase))\n\t\t{\n\t\t\t// Add the class to the list of classes\n\t\t\tthis.serviceClasses[pServiceType] = pServiceClass;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Add the base class to the list of classes\n\t\t\tthis.serviceClasses[pServiceType] = libFableServiceBase;\n\t\t}\n\t}\n\n\tinstantiateServiceProvider(pServiceType, pOptions, pCustomServiceHash)\n\t{\n\t\t// Instantiate the service\n\t\tlet tmpService = this.instantiateServiceProviderWithoutRegistration(pServiceType, pOptions, pCustomServiceHash);\n\n\t\t// Add the service to the service map\n\t\tthis.services[pServiceType][tmpService.Hash] = tmpService;\n\n\t\t// If this is the first service of this type, make it the default\n\t\tif (!this.defaultServices.hasOwnProperty(pServiceType))\n\t\t{\n\t\t\tthis.defaultServices[pServiceType] = tmpService;\n\t\t}\n\n\t\treturn tmpService;\n\t}\n\n\t// Create a service provider but don't register it to live forever in fable.services\n\tinstantiateServiceProviderWithoutRegistration(pServiceType, pOptions, pCustomServiceHash)\n\t{\n\t\t// Instantiate the service\n\t\tlet tmpService = new this.serviceClasses[pServiceType](this.fable, pOptions, pCustomServiceHash);\n\t\treturn tmpService;\n\t}\n\n\tsetDefaultServiceInstantiation(pServiceType, pServiceHash)\n\t{\n\t\tif (this.services[pServiceType].hasOwnProperty(pServiceHash))\n\t\t{\n\t\t\tthis.defaultServices[pServiceType] = this.services[pServiceType][pServiceHash];\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n}\n\nmodule.exports = FableService;\n\nmodule.exports.ServiceProviderBase = libFableServiceBase;\n},{\"./Fable-ServiceProviderBase.js\":42}],42:[function(require,module,exports){\n/**\n* Fable Service Base\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\nclass FableServiceProviderBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.options = (typeof(pOptions) === 'object') ? pOptions : {};\n\n this.serviceType = 'Unknown';\n\n this.UUID = pFable.getUUID();\n\n this.Hash = (typeof(pServiceHash) === 'string') ? pServiceHash : `${this.UUID}`;\n\t}\n}\n\nmodule.exports = FableServiceProviderBase;\n\n},{}],43:[function(require,module,exports){\n/**\n* Fable Application Services Support Library\n* @license MIT\n* @author <steven@velozo.com>\n*/\nconst libFableSettings = require('fable-settings');\nconst libFableUUID = require('fable-uuid');\nconst libFableLog = require('fable-log');\n\nconst libFableServiceManager = require('./Fable-ServiceManager.js');\n\nconst libFableServiceDataArithmatic = require('./Fable-Service-DataArithmatic.js');\nconst libFableServiceTemplate = require('./Fable-Service-Template.js');\nconst libFableServiceMetaTemplate = require('./Fable-Service-MetaTemplate.js');\nconst libFableServiceUtility = require('./Fable-Service-Utility.js');\n\nconst libFableOperation = require('./Fable-Operation.js');\n\nclass Fable\n{\n\tconstructor(pSettings)\n\t{\n\t\tlet tmpSettings = new libFableSettings(pSettings);\n\n\t\tthis.settingsManager = tmpSettings;\n\n\t\t// Instantiate the UUID generator\n\t\tthis.libUUID = new libFableUUID(this.settingsManager.settings);\n\n\t\tthis.log = new libFableLog(this.settingsManager.settings);\n\t\tthis.log.initialize();\n\n\t\t// Built-in dependencies\n\t\tthis.Dependencies = (\n\t\t\t{\n\t\t\t\tprecedent: libFableSettings.precedent\n\t\t\t});\n\n\t\t// Location for Operation state\n\t\tthis.Operations = {};\n\n\t\tthis.serviceManager = new libFableServiceManager(this);\n\n\t\t// Initialize and instantiate the default baked-in Data Arithmatic service\n\t\tthis.serviceManager.addServiceType('DataArithmatic', libFableServiceDataArithmatic);\n\t\tthis.fable.serviceManager.instantiateServiceProvider('DataArithmatic', {}, 'Default-Service-DataArithmatic');\n\t\t// This service is passing through the data arithmatic library\n\t\tthis.DataArithmatic = this.serviceManager.defaultServices.DataArithmatic._DataArithmaticLibrary;\n\n\t\t// Initialize the template service\n\t\tthis.serviceManager.addServiceType('Template', libFableServiceTemplate);\n\n\t\t// Initialize the metatemplate service\n\t\tthis.serviceManager.addServiceType('MetaTemplate', libFableServiceMetaTemplate);\n\n\t\t// Initialize and instantiate the default baked-in Utility service\n\t\tthis.serviceManager.addServiceType('Utility', libFableServiceUtility)\n\t\tthis.fable.serviceManager.instantiateServiceProvider('Utility', {}, 'Default-Service-Utility');\n\t\tthis.Utility = this.serviceManager.defaultServices.Utility;\n\n\t\tthis.services = this.serviceManager.services;\n\t\tthis.defaultServices = this.serviceManager.defaultServices;\n\t}\n\n\tget settings()\n\t{\n\t\treturn this.settingsManager.settings;\n\t}\n\n\tget fable()\n\t{\n\t\treturn this;\n\t}\n\n\tgetUUID()\n\t{\n\t\treturn this.libUUID.getUUID();\n\t}\n\n\tcreateOperation(pOperationName, pOperationHash)\n\t{\n\t\tlet tmpOperation = new libFableOperation(this, pOperationName, pOperationHash);\n\n\t\tif (this.Operations.hasOwnProperty(tmpOperation.Hash))\n\t\t{\n\t\t\t// Uh Oh ...... Operation Hash Collision!\n\t\t\t// TODO: What to do?!\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.Operations[tmpOperation.Hash] = tmpOperation;\n\t\t}\n\n\t\treturn tmpOperation;\n\t}\n\n\tgetOperation(pOperationHash)\n\t{\n\t\tif (!this.Operations.hasOwnProperty(pOperationHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.Operations[pOperationHash];\n\t\t}\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new Fable(pSettings);\n}\n\nmodule.exports = Fable;\nmodule.exports.new = autoConstruct;\n\nmodule.exports.LogProviderBase = libFableLog.LogProviderBase;\nmodule.exports.ServiceProviderBase = libFableServiceManager.ServiceProviderBase;\n\nmodule.exports.precedent = libFableSettings.precedent;\n},{\"./Fable-Operation.js\":36,\"./Fable-Service-DataArithmatic.js\":37,\"./Fable-Service-MetaTemplate.js\":38,\"./Fable-Service-Template.js\":39,\"./Fable-Service-Utility.js\":40,\"./Fable-ServiceManager.js\":41,\"fable-log\":23,\"fable-settings\":26,\"fable-uuid\":28}]},{},[35])(35)\n});\n\n","(function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c=\"function\"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error(\"Cannot find module '\"+i+\"'\");throw a.code=\"MODULE_NOT_FOUND\",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u=\"function\"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()","'use strict';\n\nvar eachOfLimit = require('async.util.eachoflimit');\nvar withoutIndex = require('async.util.withoutindex');\n\nmodule.exports = function eachLimit(arr, limit, iterator, cb) {\n return eachOfLimit(limit)(arr, withoutIndex(iterator), cb);\n};\n","'use strict';\n\nmodule.exports = function(tasks) {\n function makeCallback(index) {\n function fn() {\n if (tasks.length) {\n tasks[index].apply(null, arguments);\n }\n return fn.next();\n }\n fn.next = function() {\n return (index < tasks.length - 1) ? makeCallback(index + 1) : null;\n };\n return fn;\n }\n return makeCallback(0);\n};\n","var once = require('async.util.once');\nvar noop = require('async.util.noop');\nvar onlyOnce = require('async.util.onlyonce');\nvar keyIterator = require('async.util.keyiterator');\n\nmodule.exports = function eachOfLimit(limit) {\n return function(obj, iterator, cb) {\n cb = once(cb || noop);\n obj = obj || [];\n var nextKey = keyIterator(obj);\n if (limit <= 0) {\n return cb(null);\n }\n var done = false;\n var running = 0;\n var errored = false;\n\n (function replenish() {\n if (done && running <= 0) {\n return cb(null);\n }\n\n while (running < limit && !errored) {\n var key = nextKey();\n if (key === null) {\n done = true;\n if (running <= 0) {\n cb(null);\n }\n return;\n }\n running += 1;\n iterator(obj[key], key, onlyOnce(function(err) {\n running -= 1;\n if (err) {\n cb(err);\n errored = true;\n } else {\n replenish();\n }\n }));\n }\n })();\n };\n};\n","'use strict';\nvar setImmediate = require('async.util.setimmediate');\nvar restParam = require('async.util.restparam');\n\nmodule.exports = function(fn) {\n return restParam(function(args) {\n var callback = args.pop();\n args.push(function() {\n var innerArgs = arguments;\n if (sync) {\n setImmediate(function() {\n callback.apply(null, innerArgs);\n });\n } else {\n callback.apply(null, innerArgs);\n }\n });\n var sync = true;\n fn.apply(this, args);\n sync = false;\n });\n};\n","'use strict';\n\nmodule.exports = Array.isArray || function isArray(obj) {\n return Object.prototype.toString.call(obj) === '[object Array]';\n};\n","'use strict';\n\nvar isArray = require('async.util.isarray');\n\nmodule.exports = function isArrayLike(arr) {\n return isArray(arr) || (\n // has a positive integer length property\n typeof arr.length === 'number' &&\n arr.length >= 0 &&\n arr.length % 1 === 0\n );\n};\n","'use strict';\n\nvar _keys = require('async.util.keys');\nvar isArrayLike = require('async.util.isarraylike');\n\nmodule.exports = function keyIterator(coll) {\n var i = -1;\n var len;\n var keys;\n if (isArrayLike(coll)) {\n len = coll.length;\n return function next() {\n i++;\n return i < len ? i : null;\n };\n } else {\n keys = _keys(coll);\n len = keys.length;\n return function next() {\n i++;\n return i < len ? keys[i] : null;\n };\n }\n};\n","'use strict';\n\nmodule.exports = Object.keys || function keys(obj) {\n var _keys = [];\n for (var k in obj) {\n if (obj.hasOwnProperty(k)) {\n _keys.push(k);\n }\n }\n return _keys;\n};\n","'use strict';\n\nmodule.exports = function noop () {};\n","'use strict';\n\nmodule.exports = function once(fn) {\n return function() {\n if (fn === null) return;\n fn.apply(this, arguments);\n fn = null;\n };\n};\n","'use strict';\n\nmodule.exports = function only_once(fn) {\n return function() {\n if (fn === null) throw new Error('Callback was already called.');\n fn.apply(this, arguments);\n fn = null;\n };\n};\n","'use strict';\nmodule.exports = function restParam(func, startIndex) {\n startIndex = startIndex == null ? func.length - 1 : +startIndex;\n return function() {\n var length = Math.max(arguments.length - startIndex, 0);\n var rest = new Array(length);\n for (var index = 0; index < length; index++) {\n rest[index] = arguments[index + startIndex];\n }\n switch (startIndex) {\n case 0:\n return func.call(this, rest);\n case 1:\n return func.call(this, arguments[0], rest);\n }\n };\n};\n","'use strict';\n\nvar _setImmediate = typeof setImmediate === 'function' && setImmediate;\nvar fallback = function(fn) {\n setTimeout(fn, 0);\n};\n\nmodule.exports = function setImmediate(fn) {\n // not a direct alias for IE10 compatibility\n return (_setImmediate || fallback)(fn);\n};\n","'use strict';\n\nmodule.exports = function withoutIndex(iterator) {\n return function(value, index, callback) {\n return iterator(value, callback);\n };\n};\n","'use strict';\n\nvar once = require('async.util.once');\nvar noop = require('async.util.noop');\nvar isArray = require('async.util.isarray');\nvar restParam = require('async.util.restparam');\nvar ensureAsync = require('async.util.ensureasync');\nvar iterator = require('async.iterator');\n\nmodule.exports = function(tasks, cb) {\n cb = once(cb || noop);\n if (!isArray(tasks)) return cb(new Error('First argument to waterfall must be an array of functions'));\n if (!tasks.length) return cb();\n\n function wrapIterator(iterator) {\n return restParam(function(err, args) {\n if (err) {\n cb.apply(null, [err].concat(args));\n } else {\n var next = iterator.next();\n if (next) {\n args.push(wrapIterator(next));\n } else {\n args.push(cb);\n }\n ensureAsync(iterator).apply(null, args);\n }\n });\n }\n wrapIterator(iterator(tasks))();\n};\n","/**\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\n/**\n* Data Arithmatic\n*\n* @class DataArithmatic\n*/\nclass DataArithmatic\n{\n\tconstructor()\n\t{\n\t\t// Regular Expressions (so they don't have to be recompiled every time)\n\t\t// These could be defined as static, but I'm not sure if that will work with browserify ... and specifically the QT browser.\n\t\tthis._Regex_formatterInsertCommas = /.{1,3}/g;\n\t\t// Match Function:\n\t\t// function(pMatch, pSign, pZeros, pBefore, pDecimal, pAfter)\n\t\t// Thoughts about below: /^([+-]?)(0*)(\\d+)(\\.(\\d+))?$/;\n\t\tthis._Regex_formatterAddCommasToNumber = /^([-+]?)(0?)(\\d+)(.?)(\\d+)$/g;\n\t\tthis._Regex_formatterDollarsRemoveCommas = /,/gi;\n\t\tthis._Regex_formatterCleanNonAlpha = /[^a-z0-9]/gi;\n\n\t\t// TODO: Potentially pull these in from a configuration.\n\t\t// TODO: Use locale data for this if it's defaults all the way down.\n\t\tthis._Value_MoneySign_Currency = '$';\n\t\tthis._Value_NaN_Currency = '--';\n\t\tthis._Value_GroupSeparator_Number = ',';\n\n\t\tthis._Value_Prefix_StringHash = 'HSH';\n\t\tthis._Value_Clean_formatterCleanNonAlpha = '_';\n\n\t\tthis._UseEngineStringStartsWith = (typeof(String.prototype.startsWith) === 'function');\n\t\tthis._UseEngineStringEndsWith = (typeof(String.prototype.endsWith) === 'function');\n\t}\n\n\n\t/*************************************************************************\n\t * String Manipulation and Comparison Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Reverse a string\n\t *\n\t * @param {string} pString - The string to reverse\n\t * @returns {string}\n\t */\n\tstringReverse (pString)\n\t{\n\t\t// TODO: Benchmark if there are faster ways we want to do this with all the newer JS stuff\n\t\t// ... and if it will work with browserify in a clean way.\n\t return pString.split('').reverse().join('');\n\t}\n\n\t/**\n\t * Test if a string starts with a given substring.\n\t *\n\t * @param {*} pString\n\t * @param {*} pSearchString\n\t * @param {*} pStartIndex\n\t * @returns {*}\n\t */\n\tstringStartsWith (pString, pSearchString, pStartIndex)\n\t{\n\t\tif (this._UseEngineStringStartsWith)\n\t\t{\n\t\t\treturn pString.startsWith(pSearchString, pStartIndex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.stringStartsWith_Polyfill.call(pString, pSearchString, pStartIndex);\n\t\t}\n\t}\n\n\t/**\n\t * Check if a string starts with a given substring. This is a safe polyfill for the ES6 string.startsWith() function.\n\t *\n\t * @param {*} pSearchString - The string to search for\n\t * @param {*} pStartIndex - The index to start the search at\n\t * @returns {boolean}\n\t */\n\tstringStartsWith_Polyfill (pSearchString, pStartIndex)\n\t{\n\t\treturn this.slice(pStartIndex || 0, pSearchString.length) === pSearchString;\n\t}\n\n\t/**\n\t * Test if a string starts with a given substring.\n\t *\n\t * @param {*} pString\n\t * @param {*} pSearchString\n\t * @param {*} pEndIndex\n\t * @returns {*}\n\t */\n\tstringEndsWith (pString, pSearchString, pEndIndex)\n\t{\n\t\tif (this._UseEngineStringEndsWith)\n\t\t{\n\t\t\treturn pString.endsWith(pSearchString, pEndIndex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.stringEndsWith_Polyfill.call(pString, pSearchString, pEndIndex);\n\t\t}\n\t}\n\n\t/**\n\t * Check if a string starts with a given substring. This is a safe polyfill for the ES6 string.startsWith() function.\n\t *\n\t * @param {*} pSearchString - The string to search for\n\t * @param {*} pEndIndex - The index to end the search at\n\t * @returns {boolean}\n\t */\n\tstringEndsWith_Polyfill (pSearchString, pEndIndex)\n\t{\n\t\t// This works much better than >= because\n\t\t// it compensates for NaN:\n\t\tif (!(pEndIndex < this.length))\n\t\t{\n\t\t\tpEndIndex = this.length;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpEndIndex |= 0; // round position\n\t\t}\n\t\treturn this.substr(pEndIndex - pSearchString.length, pSearchString.length) === pSearchString;\n\t}\n\n\t/**\n\t * Generate an insecure string hash. Not meant to be secure, just a quick way to generate a hash for a string. This is not a cryptographic hash. Additional warranty and disclaimer ... this is not for passwords!\n\t *\n\t * @param {string} pString\n\t * @returns {string}\n\t */\n\tinsecureStringHash (pString)\n\t{\n\t let tmpHash = 0;\n\t let tmpStringLength = pString.length;\n\t let tmpCharacterIndex = 0;\n\n\t while (tmpCharacterIndex < tmpStringLength)\n\t {\n\t tmpHash = (tmpHash << 5) - tmpHash + pString.charCodeAt(tmpCharacterIndex++) | 0;\n\t }\n\n\t return `${this._Value_Prefix_StringHash}${tmpHash}`;\n\t}\n\n\t/**\n\t * Clean wrapping characters if they exist consistently around the string. If they do not, the string is returned unchanged.\n\t *\n\t * @param {string} pWrapCharacter - The character expected as the wrapping character\n\t * @param {string} pString - the string to clean\n\t * @returns {string}\n\t */\n\tcleanEnclosureWrapCharacters (pWrapCharacter, pString)\n\t{\n\t\t// # Use case from ManyFest DSL:\n\t\t//\n\t\t// When a boxed property is passed in, it should have quotes of some\n\t\t// kind around it.\n\t\t//\n\t\t// For instance:\n\t\t// \t\tMyValues['Name']\n\t\t// \t\tMyValues[\"Age\"]\n\t\t// \t\tMyValues[`Cost`]\n\t\t//\n\t\t// This function is necessary to remove the wrapping quotes before object\n\t\t// resolution can occur.\n\t\tif (pString.startsWith(pWrapCharacter) && pString.endsWith(pWrapCharacter))\n\t\t{\n\t\t\treturn pString.substring(1, pString.length - 1);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn pString;\n\t\t}\n\t}\n\n\t/**\n\t *\n\t * @param {*} pString\n\t * @returns\n\t */\n\tcleanNonAlphaCharacters (pString)\n\t{\n\t if ((typeof(pString) == 'string') && (pString != ''))\n\t {\n\t return pString.replace(this._Regex_formatterCleanNonAlpha, this._Value_Clean_formatterCleanNonAlpha);\n\t }\n\t}\n\n\n\t/*************************************************************************\n\t * Number Formatting Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Insert commas every 3 characters from the right. Used by formatterAddCommasToNumber().\n\t *\n\t * @param {*} pString\n\t * @returns {*}\n\t */\n\tformatterInsertCommas (pString)\n\t{\n\t // Reverse, because it's easier to do things from the left, given arbitrary digit counts\n\t let tmpReversed = this.stringReverse(pString);\n\t // Add commas every three characters\n\t let tmpReversedWithCommas = tmpReversed.match(this._Regex_formatterInsertCommas).join(',');\n\t // Reverse again (back to normal direction)\n\t return this.stringReverse(tmpReversedWithCommas);\n\t}\n\n\tprocessAddCommasToNumberRegex(pMatch, pSign, pZeros, pBefore, pDecimal, pAfter)\n\t{\n\t\t// If there was no decimal, the last capture grabs the final digit, so\n\t\t// we have to put it back together with the 'before' substring\n\t\treturn pSign + (pDecimal ? this.formatterInsertCommas(pBefore) + pDecimal + pAfter : this.formatterInsertCommas(pBefore + pAfter));\n\t}\n\n\t/**\n\t * Add Commas to a Number for readability.\n\t *\n\t * @param {*} pNumber\n\t * @returns {string}\n\t */\n\tformatterAddCommasToNumber (pNumber)\n\t{\n\t // If the regex doesn't match, `replace` returns the string unmodified\n\t return (pNumber.toString()).replace\n\t (\n\t\t\tthis._Regex_formatterAddCommasToNumber,\n\t this.processAddCommasToNumberRegex.bind(this)\n\t );\n\t}\n\n\t/**\n\t * This will take a number and format it as a dollar string. It will also add commas to the number. If the number is not a number, it will return '--'.\n\t *\n\t * @param {*} pValue\n\t * @returns {string}\n\t */\n\tformatterDollars (pValue)\n\t{\n\t let tmpDollarAmount = parseFloat(pValue).toFixed(2);\n\n\t if (isNaN(tmpDollarAmount))\n\t {\n\t // Try again and see if what was passed in was a dollars string.\n\t if (typeof(pValue) == 'string')\n\t {\n\t\t\t\t// TODO: Better rounding function? This is a hack to get rid of the currency symbol and commas.\n\t tmpDollarAmount = parseFloat(pValue.replace(this._Value_MoneySign_Currency,'').replace(this._Regex_formatterDollarsRemoveCommas,'')).toFixed(2);\n\t }\n\t\t\t// If we didn't get a number, return the \"not a number\" string.\n\t if (isNaN(tmpDollarAmount))\n\t {\n\t return this._Value_NaN_Currency;\n\t }\n\t }\n\n\t // TODO: Get locale data and use that for this stuff.\n\t return `$${this.formatterAddCommasToNumber(tmpDollarAmount)}`;\n\t}\n\n\t/**\n\t * Round a number to a certain number of digits. If the number is not a number, it will return 0. If no digits are specified, it will default to 2 significant digits.\n\t *\n\t * @param {*} pValue\n\t * @param {number} pDigits\n\t * @returns {string}\n\t */\n\tformatterRoundNumber (pValue, pDigits)\n\t{\n\t let tmpDigits = (typeof(pDigits) == 'undefined') ? 2 : pDigits;\n\n\t let tmpValue = parseFloat(pValue).toFixed(tmpDigits);\n\t if (isNaN(tmpValue))\n\t {\n\t let tmpZed = 0;\n\t return tmpZed.toFixed(tmpDigits);\n\t }\n\t else\n\t {\n\t return tmpValue;\n\t }\n\t}\n\n\n\t/*************************************************************************\n\t * String Tokenization Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Return the string before the matched substring.\n\t *\n\t * If the substring is not found, the entire string is returned. This only deals with the *first* match.\n\t *\n\t * @param {string} pString\n\t * @param {string} pMatch\n\t * @returns {string}\n\t */\n\tstringBeforeMatch (pString, pMatch)\n\t{\n\t\treturn pString.split(pMatch)[0];\n\t}\n\n\t/**\n\t * Return the string after the matched substring.\n\t *\n\t * If the substring is not found, an empty string is returned. This only deals with the *first* match.\n\t *\n\t * @param {string} pString\n\t * @param {string} pMatch\n\t * @returns {string}\n\t */\n\tstringAfterMatch (pString, pMatch)\n\t{\n\t let tmpStringSplitLocation = pString.indexOf(pMatch);\n\n\t\tif ((tmpStringSplitLocation < 0) || ((tmpStringSplitLocation + pMatch.length) >= pString.length))\n\t {\n\t return '';\n\t }\n\n\t return pString.substring(tmpStringSplitLocation + pMatch.length);\n\t}\n\n\t/**\n\t * Count the number of enclosures in a string based on the start and end characters.\n\t *\n\t * If no start or end characters are specified, it will default to parentheses. If the string is not a string, it will return 0.\n\t *\n\t * @param {string} pString\n\t * @param {string} pEnclosureStart\n\t * @param {string} pEnclosureEnd\n\t * @returns the count of full in the string\n\t */\n\tstringCountEnclosures (pString, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t if (tmpEnclosureDepth == 0)\n\t {\n\t tmpEnclosureCount++;\n\t }\n\t tmpEnclosureDepth++;\n\t }\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\t }\n\t }\n\n\t return tmpEnclosureCount;\n\t}\n\n\n\t/**\n\t * Get the value of the enclosure at the specified index.\n\t *\n\t * If the index is not a number, it will default to 0. If the string is not a string, it will return an empty string. If the enclosure is not found, it will return an empty string. If the enclosure\n\t *\n\t * @param {string} pString\n\t * @param {number} pEnclosureIndexToGet\n\t * @param {string} pEnclosureStart\n\t * @param {string}} pEnclosureEnd\n\t * @returns {string}\n\t */\n\tstringGetEnclosureValueByIndex (pString, pEnclosureIndexToGet, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureIndexToGet = (typeof(pEnclosureIndexToGet) == 'number') ? pEnclosureIndexToGet : 0;\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t let tmpEnclosedValueStartIndex = 0;\n\t let tmpEnclosedValueEndIndex = 0;\n\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t tmpEnclosureDepth++;\n\n\t\t\t\t// Only count enclosures at depth 1, but still this parses both pairs of all of them.\n\t\t\t\tif (tmpEnclosureDepth == 1)\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureCount++;\n\t\t\t\t\tif (tmpEnclosureIndexToGet == (tmpEnclosureCount - 1))\n\t\t\t\t\t{\n\t\t\t\t\t\t// This is the start of *the* enclosure\n\t\t\t\t\t\ttmpMatchedEnclosureIndex = true;\n\t\t\t\t\t\ttmpEnclosedValueStartIndex = i;\n\t\t\t\t\t}\n\t\t\t\t}\n\t }\n\t\t\t// This is the end of an enclosure\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\n\t\t\t\t// Again, only count enclosures at depth 1, but still this parses both pairs of all of them.\n\t\t\t\tif ((tmpEnclosureDepth == 0) &&\n\t\t\t\t\ttmpMatchedEnclosureIndex &&\n\t\t\t\t\t(tmpEnclosedValueEndIndex <= tmpEnclosedValueStartIndex))\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosedValueEndIndex = i;\n\t\t\t\t\ttmpMatchedEnclosureIndex = false;\n\t\t\t\t}\n\t }\n\t }\n\n\t if (tmpEnclosureCount <= tmpEnclosureIndexToGet)\n\t {\n\t\t\t// Return an empty string if the enclosure is not found\n\t return '';\n\t }\n\n\t if ((tmpEnclosedValueEndIndex > 0) && (tmpEnclosedValueEndIndex > tmpEnclosedValueStartIndex))\n\t {\n\t return tmpString.substring(tmpEnclosedValueStartIndex+1, tmpEnclosedValueEndIndex);\n\t }\n\t else\n\t {\n\t return tmpString.substring(tmpEnclosedValueStartIndex+1);\n\t }\n\t}\n\n\n\t/**\n\t * Remove an enclosure from a string based on the index of the enclosure.\n\t *\n\t * @param {string} pString\n\t * @param {number} pEnclosureIndexToRemove\n\t * @param {number} pEnclosureStart\n\t * @param {number} pEnclosureEnd\n\t * @returns {string}\n\t */\n\tstringRemoveEnclosureByIndex (pString, pEnclosureIndexToRemove, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureIndexToRemove = (typeof(pEnclosureIndexToRemove) == 'number') ? pEnclosureIndexToRemove : 0;\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t let tmpEnclosureStartIndex = 0;\n\t let tmpEnclosureEndIndex = 0;\n\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t tmpEnclosureDepth++;\n\n\t if (tmpEnclosureDepth == 1)\n\t {\n\t tmpEnclosureCount++;\n\t\t\t\t\tif (tmpEnclosureIndexToRemove == (tmpEnclosureCount - 1))\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpMatchedEnclosureIndex = true;\n\t\t\t\t\t\ttmpEnclosureStartIndex = i;\n\t\t\t\t\t}\n\t }\n\t }\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\n\t\t\t\tif ((tmpEnclosureDepth == 0) &&\n\t\t\t\t\ttmpMatchedEnclosureIndex &&\n\t\t\t\t\t(tmpEnclosureEndIndex <= tmpEnclosureStartIndex))\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureEndIndex = i;\n\t\t\t\t\ttmpMatchedEnclosureIndex = false;\n\t\t\t\t}\n\t }\n\t }\n\n\t if (tmpEnclosureCount <= tmpEnclosureIndexToRemove)\n\t {\n\t return tmpString;\n\t }\n\n\t let tmpReturnString = '';\n\n\t if (tmpEnclosureStartIndex > 1)\n\t {\n\t tmpReturnString = tmpString.substring(0, tmpEnclosureStartIndex);\n\t }\n\n\t if ((tmpString.length > (tmpEnclosureEndIndex + 1)) && (tmpEnclosureEndIndex > tmpEnclosureStartIndex))\n\t {\n\t tmpReturnString += tmpString.substring(tmpEnclosureEndIndex+1);\n\t }\n\n\t return tmpReturnString;\n\t}\n}\n\nmodule.exports = DataArithmatic;","/**\n* Base Logger Class\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\nclass BaseLogger\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\t// This should not possibly be able to be instantiated without a settings object\n\t\tthis._Settings = (typeof(pLogStreamSettings) == 'object') ? pLogStreamSettings : {};\n\n\t\t// The base logger does nothing but associate a UUID with itself\n\t\t// We added this as the mechanism for tracking loggers to allow multiple simultaneous streams\n\t\t// to the same provider.\n\t\tthis.loggerUUID = this.generateInsecureUUID();\n\n\t\t// Eventually we can use this array to ompute which levels the provider allows.\n\t\t// For now it's just used to precompute some string concatenations.\n\t\tthis.levels = (\n\t\t\t[\n\t\t\t\t\"trace\",\n\t\t\t\t\"debug\",\n\t\t\t\t\"info\",\n\t\t\t\t\"warn\",\n\t\t\t\t\"error\",\n\t\t\t\t\"fatal\"\n\t\t\t]);\n\t}\n\n\t// This is meant to generate programmatically insecure UUIDs to identify loggers\n\tgenerateInsecureUUID()\n\t{\n\t\tlet tmpDate = new Date().getTime();\n\t\tlet tmpUUID = 'LOGSTREAM-xxxxxx-yxxxxx'.replace(/[xy]/g,\n\t\t\t\t(pCharacter) =>\n\t\t\t\t{\n\t\t\t\t\t// Funny algorithm from w3resource that is twister-ish without the deep math and security\n\t\t\t\t\t// ..but good enough for unique log stream identifiers\n\t\t\t\t\tlet tmpRandomData = (tmpDate + Math.random()*16)%16 | 0;\n\t\t\t\t\ttmpDate = Math.floor(tmpDate/16);\n\n\t\t\t\t\treturn (pCharacter =='x' ? tmpRandomData : (tmpRandomData&0x3|0x8)).toString(16);\n\t\t\t\t});\n\t\treturn tmpUUID;\n\t}\n\n\tinitialize()\n\t{\n\t\t// No operation.\n\t}\n\n\ttrace(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"trace\", pLogText, pLogObject);\n\t}\n\n\tdebug(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"debug\", pLogText, pLogObject);\n\t}\n\n\tinfo(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"info\", pLogText, pLogObject);\n\t}\n\n\twarn(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"warn\", pLogText, pLogObject);\n\t}\n\n\terror(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"error\", pLogText, pLogObject);\n\t}\n\n\tfatal(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"fatal\", pLogText, pLogObject);\n\t}\n\n\twrite(pLogLevel, pLogText, pLogObject)\n\t{\n\t\t// The base logger does nothing.\n\t\treturn true;\n\t}\n}\n\nmodule.exports = BaseLogger;\n","/**\n* Default Logger Provider Function\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\n// Return the providers that are available without extensions loaded\nvar getDefaultProviders = () =>\n{\n\tlet tmpDefaultProviders = {};\n\n\ttmpDefaultProviders.console = require('./Fable-Log-Logger-Console.js');\n\n\ttmpDefaultProviders.default = tmpDefaultProviders.console;\n\n\treturn tmpDefaultProviders;\n}\n\nmodule.exports = getDefaultProviders();","module.exports=[\n {\n \"loggertype\": \"console\",\n \"streamtype\": \"console\",\n \"level\": \"trace\"\n }\n]","let libBaseLogger = require('./Fable-Log-BaseLogger.js');\n\nclass ConsoleLogger extends libBaseLogger\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\tsuper(pLogStreamSettings);\n\n\t\tthis._ShowTimeStamps = this._Settings.hasOwnProperty('showtimestamps') ? (this._Settings.showtimestamps == true) : true;\n\t\tthis._FormattedTimeStamps = this._Settings.hasOwnProperty('formattedtimestamps') ? (this._Settings.formattedtimestamps == true) : true;\n\n\t\tthis._ContextMessage = this._Settings.hasOwnProperty('Context') ? `(${this._Settings.Context})` : \n\t\t\t\t\t\t\t\tpFableLog._Settings.hasOwnProperty('Product') ? `(${pFableLog._Settings.Product})` :\n\t\t\t\t\t\t\t\t'Unnamed_Log_Context';\n\n\t\t// Allow the user to decide what gets output to the console\n\t\tthis._OutputLogLinesToConsole = this._Settings.hasOwnProperty('outputloglinestoconsole') ? this._Settings.outputloglinestoconsole : true;\n\t\tthis._OutputObjectsToConsole = this._Settings.hasOwnProperty('outputobjectstoconsole') ? this._Settings.outputobjectstoconsole : true;\n\n\t\t// Precompute the prefix for each level\n\t\tthis.prefixCache = {};\n\t\tfor (let i = 0; i <= this.levels.length; i++)\n\t\t{\n\t\t\tthis.prefixCache[this.levels[i]] = `[${this.levels[i]}] ${this._ContextMessage}: `;\n\n\t\t\tif (this._ShowTimeStamps)\n\t\t\t{\n\t\t\t\t// If there is a timestamp we need a to prepend space before the prefixcache string, since the timestamp comes first\n\t\t\t\tthis.prefixCache[this.levels[i]] = ' '+this.prefixCache[this.levels[i]];\n\t\t\t}\n\t\t}\n\t}\n\n\twrite(pLevel, pLogText, pObject)\n\t{\n\t\tlet tmpTimeStamp = '';\n\t\tif (this._ShowTimeStamps && this._FormattedTimeStamps)\n\t\t{\n\t\t\ttmpTimeStamp = (new Date()).toISOString();\n\t\t}\n\t\telse if (this._ShowTimeStamps)\n\t\t{\n\t\t\ttmpTimeStamp = +new Date();\n\t\t}\n\n\t\tlet tmpLogLine = `${tmpTimeStamp}${this.prefixCache[pLevel]}${pLogText}`;\n\n\t\tif (this._OutputLogLinesToConsole)\n\t\t{\n\t\t\tconsole.log(tmpLogLine);\n\t\t}\n\n\t\t// Write out the object on a separate line if it is passed in\n\t\tif (this._OutputObjectsToConsole && (typeof(pObject) !== 'undefined'))\n\t\t{\n\t\t\tconsole.log(JSON.stringify(pObject, null, 2));\n\t\t}\n\n\t\t// Provide an easy way to be overridden and be consistent\n\t\treturn tmpLogLine;\n\t}\n}\n\nmodule.exports = ConsoleLogger;","const libConsoleLog = require('./Fable-Log-Logger-Console.js');\nconst libFS = require('fs');\nconst libPath = require('path');\n\nclass SimpleFlatFileLogger extends libConsoleLog\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\tsuper(pLogStreamSettings, pFableLog);\n\n\t\t// If a path isn't provided for the logfile, it tries to use the ProductName or Context\n\t\tthis.logFileRawPath = (this._Settings.hasOwnProperty('path')) ? this._Settings.path : `./${this._ContextMessage}.log`;\n\t\tthis.logFilePath = libPath.normalize(this.logFileRawPath);\n\n\t\tthis.logFileStreamOptions = (this._Settings.hasOwnProperty('fileStreamoptions')) ? this._Settings.fileStreamOptions : (\n\t\t\t{\n\t\t\t\t\"flags\": \"a\",\n\t\t\t\t\"encoding\": \"utf8\"\n\t\t\t})\n\n\t\tthis.fileWriter = libFS.createWriteStream(this.logFilePath, this.logFileStreamOptions);\n\n\t\tthis.activelyWriting = false;\n\n\t\tthis.logLineStrings = [];\n\t\tthis.logObjectStrings = [];\n\n\t\tthis.defaultWriteCompleteCallback = ()=>{};\n\t\tthis.defaultBufferFlushCallback = ()=>{};\n\t}\n\n\tcloseWriter(fCloseComplete)\n\t{\n\t\tlet tmpCloseComplete = (typeof(fCloseComplete) == 'function') ? fCloseComplete : ()=>{};\n\t\tif (this.fileWriter)\n\t\t{\n\t\t\tthis.fileWriter.end('\\n');\n\t\t\treturn this.fileWriter.once('finish', tmpCloseComplete.bind(this));\n\t\t}\n\t};\n\n\tcompleteBufferFlushToLogFile(fFlushComplete)\n\t{\n\t\tthis.activelyWriting = false;\n\t\tlet tmpFlushComplete = (typeof(fFlushComplete) == 'function') ? fFlushComplete : this.defaultBufferFlushCallback;\n\n\t\tif (this.logLineStrings.length > 0)\n\t\t{\n\t\t\tthis.flushBufferToLogFile(tmpFlushComplete);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn tmpFlushComplete();\n\t\t}\n\t}\n\n\tflushBufferToLogFile(fFlushComplete)\n\t{\n\t\tif (!this.activelyWriting)\n\t\t{\n\t\t\t// Only want to be writing one thing at a time....\n\t\t\tthis.activelyWriting = true;\n\n\t\t\tlet tmpFlushComplete = (typeof(fFlushComplete) == 'function') ? fFlushComplete : this.defaultBufferFlushCallback;\n\n\t\t\t// Get the current buffer arrays. These should always have matching number of elements.\n\t\t\tlet tmpLineStrings = this.logLineStrings;\n\t\t\tlet tmpObjectStrings = this.logObjectStrings;\n\n\t\t\t// Reset these to be filled while we process this queue...\n\t\t\tthis.logLineStrings = [];\n\t\t\tthis.logObjectStrings = [];\n\n\t\t\t// This is where we will put each line before writing it to the file...\n\t\t\tlet tmpConstructedBufferOutputString = '';\n\n\t\t\tfor (let i = 0; i < tmpLineStrings.length; i++)\n\t\t\t{\n\t\t\t\t// TODO: Windows Newline? ....... yo no se!\n\t\t\t\ttmpConstructedBufferOutputString += `${tmpLineStrings[i]}\\n`;\n\t\t\t\tif (tmpObjectStrings[i] !== false)\n\t\t\t\t{\n\t\t\t\t\ttmpConstructedBufferOutputString += `${tmpObjectStrings[i]}\\n`;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!this.fileWriter.write(tmpConstructedBufferOutputString, 'utf8'))\n\t\t\t{\n\t\t\t\t// If the streamwriter returns false, we need to wait for it to drain.\n\t\t\t\tthis.fileWriter.once('drain', this.completeBufferFlushToLogFile.bind(this, tmpFlushComplete));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn this.completeBufferFlushToLogFile(tmpFlushComplete);\n\t\t\t}\n\t\t}\n\t}\n\n\twrite(pLevel, pLogText, pObject)\n\t{\n\t\tlet tmpLogLine = super.write(pLevel, pLogText, pObject);\n\n\t\t// Use a very simple array as the write buffer\n\t\tthis.logLineStrings.push(tmpLogLine);\n\n\t\t// Write out the object on a separate line if it is passed in\n\t\tif (typeof(pObject) !== 'undefined')\n\t\t{\n\t\t\tthis.logObjectStrings.push(JSON.stringify(pObject, null, 4));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.logObjectStrings.push(false);\n\t\t}\n\n\t\tthis.flushBufferToLogFile();\n\t}\n}\n\nmodule.exports = SimpleFlatFileLogger;","/**\n* Fable Logging Add-on\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Logger\n*/\n\n/**\n* Fable Solution Log Wrapper Main Class\n*\n* @class FableLog\n* @constructor\n*/\nclass FableLog\n{\n\tconstructor(pFableSettings, pFable)\n\t{\n\t\tlet tmpSettings = (typeof(pFableSettings) === 'object') ? pFableSettings : {}\n\t\tthis._Settings = tmpSettings;\n\n\t\tthis._Providers = require('./Fable-Log-DefaultProviders-Node.js');\n\n\t\tthis._StreamDefinitions = (tmpSettings.hasOwnProperty('LogStreams')) ? tmpSettings.LogStreams : require('./Fable-Log-DefaultStreams.json');\n\n\t\tthis.logStreams = [];\n\n\t\t// This object gets decorated for one-time instantiated providers that\n\t\t// have multiple outputs, such as bunyan.\n\t\tthis.logProviders = {};\n\n\t\t// A hash list of the GUIDs for each log stream, so they can't be added to the set more than one time\n\t\tthis.activeLogStreams = {};\n\n\t\tthis.logStreamsTrace = [];\n\t\tthis.logStreamsDebug = [];\n\t\tthis.logStreamsInfo = [];\n\t\tthis.logStreamsWarn = [];\n\t\tthis.logStreamsError = [];\n\t\tthis.logStreamsFatal = [];\n\n\t\tthis.datumDecorator = (pDatum) => pDatum;\n\n\t\tthis.uuid = (typeof(tmpSettings.Product) === 'string') ? tmpSettings.Product : 'Default';\n\t}\n\n\taddLogger(pLogger, pLevel)\n\t{\n\t\t// Bail out if we've already created one.\n\t\tif (this.activeLogStreams.hasOwnProperty(pLogger.loggerUUID))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\t// Add it to the streams and to the mutex\n\t\tthis.logStreams.push(pLogger);\n\t\tthis.activeLogStreams[pLogger.loggerUUID] = true;\n\n\t\t// Make sure a kosher level was passed in\n\t\tswitch (pLevel)\n\t\t{\n\t\t\tcase 'trace':\n\t\t\t\tthis.logStreamsTrace.push(pLogger);\n\t\t\tcase 'debug':\n\t\t\t\tthis.logStreamsDebug.push(pLogger);\n\t\t\tcase 'info':\n\t\t\t\tthis.logStreamsInfo.push(pLogger);\n\t\t\tcase 'warn':\n\t\t\t\tthis.logStreamsWarn.push(pLogger);\n\t\t\tcase 'error':\n\t\t\t\tthis.logStreamsError.push(pLogger);\n\t\t\tcase 'fatal':\n\t\t\t\tthis.logStreamsFatal.push(pLogger);\n\t\t\t\tbreak;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tsetDatumDecorator(fDatumDecorator)\n\t{\n\t\tif (typeof(fDatumDecorator) === 'function')\n\t\t{\n\t\t\tthis.datumDecorator = fDatumDecorator;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.datumDecorator = (pDatum) => pDatum;\n\t\t}\n\t}\n\n\ttrace(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsTrace.length; i++)\n\t\t{\n\t\t\tthis.logStreamsTrace[i].trace(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tdebug(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsDebug.length; i++)\n\t\t{\n\t\t\tthis.logStreamsDebug[i].debug(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tinfo(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsInfo.length; i++)\n\t\t{\n\t\t\tthis.logStreamsInfo[i].info(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\twarn(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsWarn.length; i++)\n\t\t{\n\t\t\tthis.logStreamsWarn[i].warn(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\terror(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsError.length; i++)\n\t\t{\n\t\t\tthis.logStreamsError[i].error(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tfatal(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsFatal.length; i++)\n\t\t{\n\t\t\tthis.logStreamsFatal[i].fatal(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tinitialize()\n\t{\n\t\t// \"initialize\" each logger as defined in the logging parameters\n\t\tfor (let i = 0; i < this._StreamDefinitions.length; i++)\n\t\t{\n\t\t\tlet tmpStreamDefinition = Object.assign({loggertype:'default',streamtype:'console',level:'info'},this._StreamDefinitions[i]);\n\n\t\t\tif (!this._Providers.hasOwnProperty(tmpStreamDefinition.loggertype))\n\t\t\t{\n\t\t\t\tconsole.log(`Error initializing log stream: bad loggertype in stream definition ${JSON.stringify(tmpStreamDefinition)}`);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.addLogger(new this._Providers[tmpStreamDefinition.loggertype](tmpStreamDefinition, this), tmpStreamDefinition.level);\n\t\t\t}\n\t\t}\n\n\t\t// Now initialize each one.\n\t\tfor (let i = 0; i < this.logStreams.length; i++)\n\t\t{\n\t\t\tthis.logStreams[i].initialize();\n\t\t}\n\t}\n\n\tlogTime(pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time';\n\t\tlet tmpTime = new Date();\n\t\tthis.info(`${tmpMessage} ${tmpTime} (epoch ${+tmpTime})`, pDatum);\n\t}\n\n\t// Get a timestamp\n\tgetTimeStamp()\n\t{\n\t\treturn +new Date();\n\t}\n\n\tgetTimeDelta(pTimeStamp)\n\t{\n\t\tlet tmpEndTime = +new Date();\n\t\treturn tmpEndTime-pTimeStamp;\n\t}\n\n\t// Log the delta between a timestamp, and now with a message\n\tlogTimeDelta(pTimeDelta, pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time Measurement';\n\t\tlet tmpDatum = (typeof(pDatum) === 'object') ? pDatum : {};\n\n\t\tlet tmpEndTime = +new Date();\n\n\t\tthis.info(`${tmpMessage} logged at (epoch ${+tmpEndTime}) took (${pTimeDelta}ms)`, pDatum);\n\t}\n\n\tlogTimeDeltaHuman(pTimeDelta, pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time Measurement';\n\n\t\tlet tmpEndTime = +new Date();\n\n\t\tlet tmpMs = parseInt(pTimeDelta%1000);\n\t\tlet tmpSeconds = parseInt((pTimeDelta/1000)%60);\n\t\tlet tmpMinutes = parseInt((pTimeDelta/(1000*60))%60);\n\t\tlet tmpHours = parseInt(pTimeDelta/(1000*60*60));\n\n\t\ttmpMs = (tmpMs < 10) ? \"00\"+tmpMs : (tmpMs < 100) ? \"0\"+tmpMs : tmpMs;\n\t\ttmpSeconds = (tmpSeconds < 10) ? \"0\"+tmpSeconds : tmpSeconds;\n\t\ttmpMinutes = (tmpMinutes < 10) ? \"0\"+tmpMinutes : tmpMinutes;\n\t\ttmpHours = (tmpHours < 10) ? \"0\"+tmpHours : tmpHours;\n\n\t\tthis.info(`${tmpMessage} logged at (epoch ${+tmpEndTime}) took (${pTimeDelta}ms) or (${tmpHours}:${tmpMinutes}:${tmpSeconds}.${tmpMs})`, pDatum);\n\t}\n\n\tlogTimeDeltaRelative(pStartTime, pMessage, pDatum)\n\t{\n\t\tthis.logTimeDelta(this.getTimeDelta(pStartTime), pMessage, pDatum);\n\t}\n\n\tlogTimeDeltaRelativeHuman(pStartTime, pMessage, pDatum)\n\t{\n\t\tthis.logTimeDeltaHuman(this.getTimeDelta(pStartTime), pMessage, pDatum);\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableLog(pSettings);\n}\n\n\nmodule.exports = FableLog;\nmodule.exports.new = autoConstruct;\nmodule.exports.LogProviderBase = require('./Fable-Log-BaseLogger.js');\nmodule.exports.LogProviderConsole = require('./Fable-Log-Logger-Console.js');\nmodule.exports.LogProviderConsole = require('./Fable-Log-Logger-SimpleFlatFile.js');\n","module.exports={\n\t\"Product\": \"ApplicationNameHere\",\n\t\"ProductVersion\": \"0.0.0\",\n\n\t\"ConfigFile\": false,\n\n\t\"LogStreams\":\n\t[\n\t\t{\n\t\t\t\"level\": \"trace\"\n\t\t}\n\t]\n}\n","/**\n* Fable Settings Template Processor\n*\n* This class allows environment variables to come in via templated expressions, and defaults to be set.\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\n\nclass FableSettingsTemplateProcessor\n{\n\tconstructor(pDependencies)\n\t{\n // Use a no-dependencies templating engine to parse out environment variables\n\t\tthis.templateProcessor = new pDependencies.precedent();\n\n // TODO: Make the environment variable wrap expression demarcation characters configurable?\n\t\tthis.templateProcessor.addPattern('${', '}',\n\t\t\t(pTemplateValue)=>\n\t\t\t{\n\t\t\t\tlet tmpTemplateValue = pTemplateValue.trim();\n\n\t\t\t\tlet tmpSeparatorIndex = tmpTemplateValue.indexOf('|');\n\n\t\t\t\t// If there is no pipe, the default value will end up being whatever the variable name is.\n\t\t\t\tlet tmpDefaultValue = tmpTemplateValue.substring(tmpSeparatorIndex+1);\n\n\t\t\t\tlet tmpEnvironmentVariableName = (tmpSeparatorIndex > -1) ? tmpTemplateValue.substring(0, tmpSeparatorIndex) : tmpTemplateValue;\n\n\t\t\t\tif (process.env.hasOwnProperty(tmpEnvironmentVariableName))\n\t\t\t\t{\n\t\t\t\t\treturn process.env[tmpEnvironmentVariableName];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\treturn tmpDefaultValue;\n\t\t\t\t}\n\t\t\t});\n }\n\n parseSetting(pString)\n {\n return this.templateProcessor.parseString(pString);\n }\n}\n\nmodule.exports = FableSettingsTemplateProcessor;","/**\n* Fable Settings Add-on\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\n\nconst libPrecedent = require('precedent');\nconst libFableSettingsTemplateProcessor = require('./Fable-Settings-TemplateProcessor.js');\n\nclass FableSettings\n{\n\tconstructor(pFableSettings)\n\t{\n\t\t// Expose the dependencies for downstream re-use\n\t\tthis.dependencies = (\n\t\t\t{\n\t\t\t\tprecedent: libPrecedent\n\t\t\t});\n\n\t\t// Initialize the settings value template processor\n\t\tthis.settingsTemplateProcessor = new libFableSettingsTemplateProcessor(this.dependencies);\n\n\t\t// set straight away so anything that uses it respects the initial setting\n\t\tthis._configureEnvTemplating(pFableSettings);\n\n\t\tthis.default = this.buildDefaultSettings();\n\n\t\t// Construct a new settings object\n\t\tlet tmpSettings = this.merge(pFableSettings, this.buildDefaultSettings());\n\n\t\t// The base settings object (what they were on initialization, before other actors have altered them)\n\t\tthis.base = JSON.parse(JSON.stringify(tmpSettings));\n\n\t\tif (tmpSettings.DefaultConfigFile)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\t// If there is a DEFAULT configuration file, try to load and merge it.\n\t\t\t\ttmpSettings = this.merge(require(tmpSettings.DefaultConfigFile), tmpSettings);\n\t\t\t}\n\t\t\tcatch (pException)\n\t\t\t{\n\t\t\t\t// Why this? Often for an app we want settings to work out of the box, but\n\t\t\t\t// would potentially want to have a config file for complex settings.\n\t\t\t\tconsole.log('Fable-Settings Warning: Default configuration file specified but there was a problem loading it. Falling back to base.');\n\t\t\t\tconsole.log(' Loading Exception: '+pException);\n\t\t\t}\n\t\t}\n\n\t\tif (tmpSettings.ConfigFile)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\t// If there is a configuration file, try to load and merge it.\n\t\t\t\ttmpSettings = this.merge(require(tmpSettings.ConfigFile), tmpSettings);\n\t\t\t}\n\t\t\tcatch (pException)\n\t\t\t{\n\t\t\t\t// Why this? Often for an app we want settings to work out of the box, but\n\t\t\t\t// would potentially want to have a config file for complex settings.\n\t\t\t\tconsole.log('Fable-Settings Warning: Configuration file specified but there was a problem loading it. Falling back to base.');\n\t\t\t\tconsole.log(' Loading Exception: '+pException);\n\t\t\t}\n\t\t}\n\n\t\tthis.settings = tmpSettings;\n\t}\n\n\t// Build a default settings object. Use the JSON jimmy to ensure it is always a new object.\n\tbuildDefaultSettings()\n\t{\n\t\treturn JSON.parse(JSON.stringify(require('./Fable-Settings-Default')));\n\t}\n\n\t// Update the configuration for environment variable templating based on the current settings object\n\t_configureEnvTemplating(pSettings)\n\t{\n\t\t// default environment variable templating to on\n\t\tthis._PerformEnvTemplating = !pSettings || pSettings.NoEnvReplacement !== true;\n\t}\n\n\t// Resolve (recursive) any environment variables found in settings object.\n\t_resolveEnv(pSettings)\n\t{\n\t\tfor (const tmpKey in pSettings)\n\t\t{\n\t\t\tif (typeof(pSettings[tmpKey]) === 'object')\n\t\t\t{\n\t\t\t\tthis._resolveEnv(pSettings[tmpKey]);\n\t\t\t}\n\t\t\telse if (typeof(pSettings[tmpKey]) === 'string')\n\t\t\t{\n\t\t\t\tpSettings[tmpKey] = this.settingsTemplateProcessor.parseSetting(pSettings[tmpKey]);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Check to see if a value is an object (but not an array).\n\t */\n\t_isObject(value)\n\t{\n\t\treturn typeof(value) === 'object' && !Array.isArray(value);\n\t}\n\n\t/**\n\t * Merge two plain objects. Keys that are objects in both will be merged property-wise.\n\t */\n\t_deepMergeObjects(toObject, fromObject)\n\t{\n\t\tif (!fromObject || !this._isObject(fromObject))\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\tObject.keys(fromObject).forEach((key) =>\n\t\t{\n\t\t\tconst fromValue = fromObject[key];\n\t\t\tif (this._isObject(fromValue))\n\t\t\t{\n\t\t\t\tconst toValue = toObject[key];\n\t\t\t\tif (toValue && this._isObject(toValue))\n\t\t\t\t{\n\t\t\t\t\t// both are objects, so do a recursive merge\n\t\t\t\t\tthis._deepMergeObjects(toValue, fromValue);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttoObject[key] = fromValue;\n\t\t});\n\t\treturn toObject;\n\t}\n\n\t// Merge some new object into the existing settings.\n\tmerge(pSettingsFrom, pSettingsTo)\n\t{\n\t\t// If an invalid settings from object is passed in (e.g. object constructor without passing in anything) this should still work\n\t\tlet tmpSettingsFrom = (typeof(pSettingsFrom) === 'object') ? pSettingsFrom : {};\n\t\t// Default to the settings object if none is passed in for the merge.\n\t\tlet tmpSettingsTo = (typeof(pSettingsTo) === 'object') ? pSettingsTo : this.settings;\n\n\t\t// do not mutate the From object property values\n\t\tlet tmpSettingsFromCopy = JSON.parse(JSON.stringify(tmpSettingsFrom));\n\t\ttmpSettingsTo = this._deepMergeObjects(tmpSettingsTo, tmpSettingsFromCopy);\n\n\t\tif (this._PerformEnvTemplating)\n\t\t{\n\t\t\tthis._resolveEnv(tmpSettingsTo);\n\t\t}\n\t\t// Update env tempating config, since we just updated the config object, and it may have changed\n\t\tthis._configureEnvTemplating(tmpSettingsTo);\n\n\t\treturn tmpSettingsTo;\n\t}\n\n\t// Fill in settings gaps without overwriting settings that are already there\n\tfill(pSettingsFrom)\n\t{\n\t\t// If an invalid settings from object is passed in (e.g. object constructor without passing in anything) this should still work\n\t\tlet tmpSettingsFrom = (typeof(pSettingsFrom) === 'object') ? pSettingsFrom : {};\n\n\t\t// do not mutate the From object property values\n\t\tlet tmpSettingsFromCopy = JSON.parse(JSON.stringify(tmpSettingsFrom));\n\n\t\tthis.settings = this._deepMergeObjects(tmpSettingsFromCopy, this.settings);\n\n\t\treturn this.settings;\n\t}\n};\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableSettings(pSettings);\n}\n\nmodule.exports = FableSettings;\nmodule.exports.new = autoConstruct;\nmodule.exports.precedent = libPrecedent;","/**\n* Random Byte Generator - Browser version\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\n// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n// Unique ID creation requires a high quality random # generator. In the\n// browser this is a little complicated due to unknown quality of Math.random()\n// and inconsistent support for the `crypto` API. We do the best we can via\n// feature-detection\nclass RandomBytes\n{\n\tconstructor()\n\t{\n\n\t\t// getRandomValues needs to be invoked in a context where \"this\" is a Crypto\n\t\t// implementation. Also, find the complete implementation of crypto on IE11.\n\t\tthis.getRandomValues = (typeof(crypto) != 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto)) ||\n \t\t(typeof(msCrypto) != 'undefined' && typeof window.msCrypto.getRandomValues == 'function' && msCrypto.getRandomValues.bind(msCrypto));\n\t}\n\n\t// WHATWG crypto RNG - http://wiki.whatwg.org/wiki/Crypto\n\tgenerateWhatWGBytes()\n\t{\n\t\tlet tmpBuffer = new Uint8Array(16); // eslint-disable-line no-undef\n\n\t\tthis.getRandomValues(tmpBuffer);\n\t\treturn tmpBuffer;\n\t}\n\n\t// Math.random()-based (RNG)\n\tgenerateRandomBytes()\n\t{\n\t\t// If all else fails, use Math.random(). It's fast, but is of unspecified\n\t\t// quality.\n\t\tlet tmpBuffer = new Uint8Array(16); // eslint-disable-line no-undef\n\n\t\tfor (let i = 0, tmpValue; i < 16; i++)\n\t\t{\n\t\t\tif ((i & 0x03) === 0)\n\t\t\t{\n\t\t\t\ttmpValue = Math.random() * 0x100000000;\n\t\t\t}\n\n\t\t\ttmpBuffer[i] = tmpValue >>> ((i & 0x03) << 3) & 0xff;\n\t\t}\n\n\t\treturn tmpBuffer;\n\t}\n\n\tgenerate()\n\t{\n\t\tif (this.getRandomValues)\n\t\t{\n\t\t\treturn this.generateWhatWGBytes();\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.generateRandomBytes();\n\t\t}\n\t}\n}\n\nmodule.exports = RandomBytes;\n","/**\n* Fable UUID Generator\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable UUID\n*/\n\n/**\n* Fable Solution UUID Generation Main Class\n*\n* @class FableUUID\n* @constructor\n*/\n\nvar libRandomByteGenerator = require('./Fable-UUID-Random.js')\n\nclass FableUUID\n{\n\tconstructor(pSettings)\n\t{\n\t\t// Determine if the module is in \"Random UUID Mode\" which means just use the random character function rather than the v4 random UUID spec.\n\t\t// Note this allows UUIDs of various lengths (including very short ones) although guaranteed uniqueness goes downhill fast.\n\t\tthis._UUIDModeRandom = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDModeRandom')) ? (pSettings.UUIDModeRandom == true) : false;\n\t\t// These two properties are only useful if we are in Random mode. Otherwise it generates a v4 spec\n\t\t// Length for \"Random UUID Mode\" is set -- if not set it to 8\n\t\tthis._UUIDLength = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDLength')) ? (pSettings.UUIDLength + 0) : 8;\n\t\t// Dictionary for \"Random UUID Mode\"\n\t\tthis._UUIDRandomDictionary = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDDictionary')) ? (pSettings.UUIDDictionary + 0) : '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ';\n\n\t\tthis.randomByteGenerator = new libRandomByteGenerator();\n\n\t\t// Lookup table for hex codes\n\t\tthis._HexLookup = [];\n\t\tfor (let i = 0; i < 256; ++i)\n\t\t{\n\t\t\tthis._HexLookup[i] = (i + 0x100).toString(16).substr(1);\n\t\t}\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tbytesToUUID(pBuffer)\n\t{\n\t\tlet i = 0;\n\t\t// join used to fix memory issue caused by concatenation: https://bugs.chromium.org/p/v8/issues/detail?id=3175#c4\n\t\treturn ([\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], \n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]]\n\t\t\t\t]).join('');\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tgenerateUUIDv4()\n\t{\n\t\tlet tmpBuffer = new Array(16);\n\t\tvar tmpRandomBytes = this.randomByteGenerator.generate();\n\n\t\t// Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\t\ttmpRandomBytes[6] = (tmpRandomBytes[6] & 0x0f) | 0x40;\n\t\ttmpRandomBytes[8] = (tmpRandomBytes[8] & 0x3f) | 0x80;\n\n\t\treturn this.bytesToUUID(tmpRandomBytes);\n\t}\n\n\t// Simple random UUID generation\n\tgenerateRandom()\n\t{\n\t\tlet tmpUUID = '';\n\n\t\tfor (let i = 0; i < this._UUIDLength; i++)\n\t\t{\n\t\t\ttmpUUID += this._UUIDRandomDictionary.charAt(Math.floor(Math.random() * (this._UUIDRandomDictionary.length-1)));\n\t\t}\n\n\t\treturn tmpUUID;\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tgetUUID()\n\t{\n\t\tif (this._UUIDModeRandom)\n\t\t{\n\t\t\treturn this.generateRandom();\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.generateUUIDv4();\n\t\t}\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableUUID(pSettings);\n}\n\n\nmodule.exports = FableUUID;\nmodule.exports.new = autoConstruct;\n","// 'path' module extracted from Node.js v8.11.1 (only the posix part)\n// transplited with Babel\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\n'use strict';\n\nfunction assertPath(path) {\n if (typeof path !== 'string') {\n throw new TypeError('Path must be a string. Received ' + JSON.stringify(path));\n }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n var res = '';\n var lastSegmentLength = 0;\n var lastSlash = -1;\n var dots = 0;\n var code;\n for (var i = 0; i <= path.length; ++i) {\n if (i < path.length)\n code = path.charCodeAt(i);\n else if (code === 47 /*/*/)\n break;\n else\n code = 47 /*/*/;\n if (code === 47 /*/*/) {\n if (lastSlash === i - 1 || dots === 1) {\n // NOOP\n } else if (lastSlash !== i - 1 && dots === 2) {\n if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) {\n if (res.length > 2) {\n var lastSlashIndex = res.lastIndexOf('/');\n if (lastSlashIndex !== res.length - 1) {\n if (lastSlashIndex === -1) {\n res = '';\n lastSegmentLength = 0;\n } else {\n res = res.slice(0, lastSlashIndex);\n lastSegmentLength = res.length - 1 - res.lastIndexOf('/');\n }\n lastSlash = i;\n dots = 0;\n continue;\n }\n } else if (res.length === 2 || res.length === 1) {\n res = '';\n lastSegmentLength = 0;\n lastSlash = i;\n dots = 0;\n continue;\n }\n }\n if (allowAboveRoot) {\n if (res.length > 0)\n res += '/..';\n else\n res = '..';\n lastSegmentLength = 2;\n }\n } else {\n if (res.length > 0)\n res += '/' + path.slice(lastSlash + 1, i);\n else\n res = path.slice(lastSlash + 1, i);\n lastSegmentLength = i - lastSlash - 1;\n }\n lastSlash = i;\n dots = 0;\n } else if (code === 46 /*.*/ && dots !== -1) {\n ++dots;\n } else {\n dots = -1;\n }\n }\n return res;\n}\n\nfunction _format(sep, pathObject) {\n var dir = pathObject.dir || pathObject.root;\n var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || '');\n if (!dir) {\n return base;\n }\n if (dir === pathObject.root) {\n return dir + base;\n }\n return dir + sep + base;\n}\n\nvar posix = {\n // path.resolve([from ...], to)\n resolve: function resolve() {\n var resolvedPath = '';\n var resolvedAbsolute = false;\n var cwd;\n\n for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n var path;\n if (i >= 0)\n path = arguments[i];\n else {\n if (cwd === undefined)\n cwd = process.cwd();\n path = cwd;\n }\n\n assertPath(path);\n\n // Skip empty entries\n if (path.length === 0) {\n continue;\n }\n\n resolvedPath = path + '/' + resolvedPath;\n resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/;\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n if (resolvedAbsolute) {\n if (resolvedPath.length > 0)\n return '/' + resolvedPath;\n else\n return '/';\n } else if (resolvedPath.length > 0) {\n return resolvedPath;\n } else {\n return '.';\n }\n },\n\n normalize: function normalize(path) {\n assertPath(path);\n\n if (path.length === 0) return '.';\n\n var isAbsolute = path.charCodeAt(0) === 47 /*/*/;\n var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/;\n\n // Normalize the path\n path = normalizeStringPosix(path, !isAbsolute);\n\n if (path.length === 0 && !isAbsolute) path = '.';\n if (path.length > 0 && trailingSeparator) path += '/';\n\n if (isAbsolute) return '/' + path;\n return path;\n },\n\n isAbsolute: function isAbsolute(path) {\n assertPath(path);\n return path.length > 0 && path.charCodeAt(0) === 47 /*/*/;\n },\n\n join: function join() {\n if (arguments.length === 0)\n return '.';\n var joined;\n for (var i = 0; i < arguments.length; ++i) {\n var arg = arguments[i];\n assertPath(arg);\n if (arg.length > 0) {\n if (joined === undefined)\n joined = arg;\n else\n joined += '/' + arg;\n }\n }\n if (joined === undefined)\n return '.';\n return posix.normalize(joined);\n },\n\n relative: function relative(from, to) {\n assertPath(from);\n assertPath(to);\n\n if (from === to) return '';\n\n from = posix.resolve(from);\n to = posix.resolve(to);\n\n if (from === to) return '';\n\n // Trim any leading backslashes\n var fromStart = 1;\n for (; fromStart < from.length; ++fromStart) {\n if (from.charCodeAt(fromStart) !== 47 /*/*/)\n break;\n }\n var fromEnd = from.length;\n var fromLen = fromEnd - fromStart;\n\n // Trim any leading backslashes\n var toStart = 1;\n for (; toStart < to.length; ++toStart) {\n if (to.charCodeAt(toStart) !== 47 /*/*/)\n break;\n }\n var toEnd = to.length;\n var toLen = toEnd - toStart;\n\n // Compare paths to find the longest common path from root\n var length = fromLen < toLen ? fromLen : toLen;\n var lastCommonSep = -1;\n var i = 0;\n for (; i <= length; ++i) {\n if (i === length) {\n if (toLen > length) {\n if (to.charCodeAt(toStart + i) === 47 /*/*/) {\n // We get here if `from` is the exact base path for `to`.\n // For example: from='/foo/bar'; to='/foo/bar/baz'\n return to.slice(toStart + i + 1);\n } else if (i === 0) {\n // We get here if `from` is the root\n // For example: from='/'; to='/foo'\n return to.slice(toStart + i);\n }\n } else if (fromLen > length) {\n if (from.charCodeAt(fromStart + i) === 47 /*/*/) {\n // We get here if `to` is the exact base path for `from`.\n // For example: from='/foo/bar/baz'; to='/foo/bar'\n lastCommonSep = i;\n } else if (i === 0) {\n // We get here if `to` is the root.\n // For example: from='/foo'; to='/'\n lastCommonSep = 0;\n }\n }\n break;\n }\n var fromCode = from.charCodeAt(fromStart + i);\n var toCode = to.charCodeAt(toStart + i);\n if (fromCode !== toCode)\n break;\n else if (fromCode === 47 /*/*/)\n lastCommonSep = i;\n }\n\n var out = '';\n // Generate the relative path based on the path difference between `to`\n // and `from`\n for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n if (i === fromEnd || from.charCodeAt(i) === 47 /*/*/) {\n if (out.length === 0)\n out += '..';\n else\n out += '/..';\n }\n }\n\n // Lastly, append the rest of the destination (`to`) path that comes after\n // the common path parts\n if (out.length > 0)\n return out + to.slice(toStart + lastCommonSep);\n else {\n toStart += lastCommonSep;\n if (to.charCodeAt(toStart) === 47 /*/*/)\n ++toStart;\n return to.slice(toStart);\n }\n },\n\n _makeLong: function _makeLong(path) {\n return path;\n },\n\n dirname: function dirname(path) {\n assertPath(path);\n if (path.length === 0) return '.';\n var code = path.charCodeAt(0);\n var hasRoot = code === 47 /*/*/;\n var end = -1;\n var matchedSlash = true;\n for (var i = path.length - 1; i >= 1; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n if (!matchedSlash) {\n end = i;\n break;\n }\n } else {\n // We saw the first non-path separator\n matchedSlash = false;\n }\n }\n\n if (end === -1) return hasRoot ? '/' : '.';\n if (hasRoot && end === 1) return '//';\n return path.slice(0, end);\n },\n\n basename: function basename(path, ext) {\n if (ext !== undefined && typeof ext !== 'string') throw new TypeError('\"ext\" argument must be a string');\n assertPath(path);\n\n var start = 0;\n var end = -1;\n var matchedSlash = true;\n var i;\n\n if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n if (ext.length === path.length && ext === path) return '';\n var extIdx = ext.length - 1;\n var firstNonSlashEnd = -1;\n for (i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else {\n if (firstNonSlashEnd === -1) {\n // We saw the first non-path separator, remember this index in case\n // we need it if the extension ends up not matching\n matchedSlash = false;\n firstNonSlashEnd = i + 1;\n }\n if (extIdx >= 0) {\n // Try to match the explicit extension\n if (code === ext.charCodeAt(extIdx)) {\n if (--extIdx === -1) {\n // We matched the extension, so mark this as the end of our path\n // component\n end = i;\n }\n } else {\n // Extension does not match, so our result is the entire path\n // component\n extIdx = -1;\n end = firstNonSlashEnd;\n }\n }\n }\n }\n\n if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length;\n return path.slice(start, end);\n } else {\n for (i = path.length - 1; i >= 0; --i) {\n if (path.charCodeAt(i) === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // path component\n matchedSlash = false;\n end = i + 1;\n }\n }\n\n if (end === -1) return '';\n return path.slice(start, end);\n }\n },\n\n extname: function extname(path) {\n assertPath(path);\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n for (var i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1)\n startDot = i;\n else if (preDotState !== 1)\n preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n return '';\n }\n return path.slice(startDot, end);\n },\n\n format: function format(pathObject) {\n if (pathObject === null || typeof pathObject !== 'object') {\n throw new TypeError('The \"pathObject\" argument must be of type Object. Received type ' + typeof pathObject);\n }\n return _format('/', pathObject);\n },\n\n parse: function parse(path) {\n assertPath(path);\n\n var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n if (path.length === 0) return ret;\n var code = path.charCodeAt(0);\n var isAbsolute = code === 47 /*/*/;\n var start;\n if (isAbsolute) {\n ret.root = '/';\n start = 1;\n } else {\n start = 0;\n }\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n var i = path.length - 1;\n\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n\n // Get non-dir info\n for (; i >= start; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n if (end !== -1) {\n if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end);\n }\n } else {\n if (startPart === 0 && isAbsolute) {\n ret.name = path.slice(1, startDot);\n ret.base = path.slice(1, end);\n } else {\n ret.name = path.slice(startPart, startDot);\n ret.base = path.slice(startPart, end);\n }\n ret.ext = path.slice(startDot, end);\n }\n\n if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/';\n\n return ret;\n },\n\n sep: '/',\n delimiter: ':',\n win32: null,\n posix: null\n};\n\nposix.posix = posix;\n\nmodule.exports = posix;\n","/**\n* Precedent Meta-Templating\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Process text streams, parsing out meta-template expressions.\n*/\nvar libWordTree = require(`./WordTree.js`);\nvar libStringParser = require(`./StringParser.js`);\n\nclass Precedent\n{\n\t/**\n\t * Precedent Constructor\n\t */\n\tconstructor()\n\t{\n\t\tthis.WordTree = new libWordTree();\n\n\t\tthis.StringParser = new libStringParser();\n\n\t\tthis.ParseTree = this.WordTree.ParseTree;\n\t}\n\n\t/**\n\t * Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pTree - A node on the parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern(pPatternStart, pPatternEnd, pParser)\n\t{\n\t\treturn this.WordTree.addPattern(pPatternStart, pPatternEnd, pParser);\n\t}\n\n\t/**\n\t * Parse a string with the existing parse tree\n\t * @method parseString\n\t * @param {string} pString - The string to parse\n\t * @param {object} pData - Data to pass in as the second argument\n\t * @return {string} The result from the parser\n\t */\n\tparseString(pString, pData)\n\t{\n\t\treturn this.StringParser.parseString(pString, this.ParseTree, pData);\n\t}\n}\n\nmodule.exports = Precedent;\n","/**\n* String Parser\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Parse a string, properly processing each matched token in the word tree.\n*/\n\nclass StringParser\n{\n\t/**\n\t * StringParser Constructor\n\t */\n\tconstructor()\n\t{\n\t}\n\n\t/**\n\t * Create a fresh parsing state object to work with.\n\t * @method newParserState\n\t * @param {Object} pParseTree - A node on the parse tree to begin parsing from (usually root)\n\t * @return {Object} A new parser state object for running a character parser on\n\t * @private\n\t */\n\tnewParserState (pParseTree)\n\t{\n\t\treturn (\n\t\t{\n\t\t\tParseTree: pParseTree,\n\n\t\t\tOutput: '',\n\t\t\tOutputBuffer: '',\n\n\t\t\tPattern: false,\n\n\t\t\tPatternMatch: false,\n\t\t\tPatternMatchOutputBuffer: ''\n\t\t});\n\t}\n\n\t/**\n\t * Assign a node of the parser tree to be the next potential match.\n\t * If the node has a PatternEnd property, it is a valid match and supercedes the last valid match (or becomes the initial match).\n\t * @method assignNode\n\t * @param {Object} pNode - A node on the parse tree to assign\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tassignNode (pNode, pParserState)\n\t{\n\t\tpParserState.PatternMatch = pNode;\n\n\t\t// If the pattern has a END we can assume it has a parse function...\n\t\tif (pParserState.PatternMatch.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\t// ... this is the legitimate start of a pattern.\n\t\t\tpParserState.Pattern = pParserState.PatternMatch;\n\t\t}\n\t}\n\n\t/**\n\t * Append a character to the output buffer in the parser state.\n\t * This output buffer is used when a potential match is being explored, or a match is being explored.\n\t * @method appendOutputBuffer\n\t * @param {string} pCharacter - The character to append\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tappendOutputBuffer (pCharacter, pParserState)\n\t{\n\t\tpParserState.OutputBuffer += pCharacter;\n\t}\n\n\t/**\n\t * Flush the output buffer to the output and clear it.\n\t * @method flushOutputBuffer\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tflushOutputBuffer (pParserState)\n\t{\n\t\tpParserState.Output += pParserState.OutputBuffer;\n\t\tpParserState.OutputBuffer = '';\n\t}\n\n\n\t/**\n\t * Check if the pattern has ended. If it has, properly flush the buffer and start looking for new patterns.\n\t * @method checkPatternEnd\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tcheckPatternEnd (pParserState, pData)\n\t{\n\t\tif ((pParserState.OutputBuffer.length >= pParserState.Pattern.PatternEnd.length+pParserState.Pattern.PatternStart.length) &&\n\t\t\t(pParserState.OutputBuffer.substr(-pParserState.Pattern.PatternEnd.length) === pParserState.Pattern.PatternEnd))\n\t\t{\n\t\t\t// ... this is the end of a pattern, cut off the end tag and parse it.\n\t\t\t// Trim the start and end tags off the output buffer now\n\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStart.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStart.length+pParserState.Pattern.PatternEnd.length)), pData);\n\t\t\t// Flush the output buffer.\n\t\t\tthis.flushOutputBuffer(pParserState);\n\t\t\t// End pattern mode\n\t\t\tpParserState.Pattern = false;\n\t\t\tpParserState.PatternMatch = false;\n\t\t}\n\t}\n\n\t/**\n\t * Parse a character in the buffer.\n\t * @method parseCharacter\n\t * @param {string} pCharacter - The character to append\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tparseCharacter (pCharacter, pParserState, pData)\n\t{\n\t\t// (1) If we aren't in a pattern match, and we aren't potentially matching, and this may be the start of a new pattern....\n\t\tif (!pParserState.PatternMatch && pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t{\n\t\t\t// ... assign the node as the matched node.\n\t\t\tthis.assignNode(pParserState.ParseTree[pCharacter], pParserState);\n\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t}\n\t\t// (2) If we are in a pattern match (actively seeing if this is part of a new pattern token)\n\t\telse if (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern has a subpattern with this key\n\t\t\tif (pParserState.PatternMatch.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// Continue matching patterns.\n\t\t\t\tthis.assignNode(pParserState.PatternMatch[pCharacter], pParserState);\n\t\t\t}\n\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\tif (pParserState.Pattern)\n\t\t\t{\n\t\t\t\t// ... Check if this is the end of the pattern (if we are matching a valid pattern)...\n\t\t\t\tthis.checkPatternEnd(pParserState, pData);\n\t\t\t}\n\t\t}\n\t\t// (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\telse\n\t\t{\n\t\t\tpParserState.Output += pCharacter;\n\t\t}\n\t}\n\n\t/**\n\t * Parse a string for matches, and process any template segments that occur.\n\t * @method parseString\n\t * @param {string} pString - The string to parse.\n\t * @param {Object} pParseTree - The parse tree to begin parsing from (usually root)\n\t * @param {Object} pData - The data to pass to the function as a second paramter\n\t */\n\tparseString (pString, pParseTree, pData)\n\t{\n\t\tlet tmpParserState = this.newParserState(pParseTree);\n\n\t\tfor (var i = 0; i < pString.length; i++)\n\t\t{\n\t\t\t// TODO: This is not fast.\n\t\t\tthis.parseCharacter(pString[i], tmpParserState, pData);\n\t\t}\n\n\t\tthis.flushOutputBuffer(tmpParserState);\n\n\t\treturn tmpParserState.Output;\n\t}\n}\n\nmodule.exports = StringParser;\n","/**\n* Word Tree\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Create a tree (directed graph) of Javascript objects, one character per object.\n*/\n\nclass WordTree\n{\n\t/**\n\t * WordTree Constructor\n\t */\n\tconstructor()\n\t{\n\t\tthis.ParseTree = {};\n\t}\n\t\n\t/** \n\t * Add a child character to a Parse Tree node\n\t * @method addChild\n\t * @param {Object} pTree - A parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - The index of the character in the pattern\n\t * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddChild (pTree, pPattern, pIndex)\n\t{\n\t\tif (!pTree.hasOwnProperty(pPattern[pIndex]))\n\t\t\tpTree[pPattern[pIndex]] = {};\n\t\t\n\t\treturn pTree[pPattern[pIndex]];\n\t}\n\t\n\t/** Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pPatternStart - The starting string for the pattern (e.g. \"${\")\n\t * @param {string} pPatternEnd - The ending string for the pattern (e.g. \"}\")\n\t * @param {number} pParser - The function to parse if this is the matched pattern, once the Pattern End is met. If this is a string, a simple replacement occurs.\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern (pPatternStart, pPatternEnd, pParser)\n\t{\n\t\tif (pPatternStart.length < 1)\n\t\t\treturn false;\n\n\t\tif ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length < 1))\n\t\t\treturn false;\n\n\t\tlet tmpLeaf = this.ParseTree;\n\n\t\t// Add the tree of leaves iteratively\n\t\tfor (var i = 0; i < pPatternStart.length; i++)\n\t\t\ttmpLeaf = this.addChild(tmpLeaf, pPatternStart, i);\n\n\t\ttmpLeaf.PatternStart = pPatternStart;\n\t\ttmpLeaf.PatternEnd = ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length > 0)) ? pPatternEnd : pPatternStart;\n\t\ttmpLeaf.Parse = (typeof(pParser) === 'function') ? pParser : \n\t\t\t\t\t\t(typeof(pParser) === 'string') ? () => { return pParser; } :\n\t\t\t\t\t\t(pData) => { return pData; };\n\n\t\treturn true;\n\t}\n}\n\nmodule.exports = WordTree;\n","// 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 nextTick = require('process/browser.js').nextTick;\nvar apply = Function.prototype.apply;\nvar slice = Array.prototype.slice;\nvar immediateIds = {};\nvar nextImmediateId = 0;\n\n// DOM APIs, for completeness\n\nexports.setTimeout = function() {\n return new Timeout(apply.call(setTimeout, window, arguments), clearTimeout);\n};\nexports.setInterval = function() {\n return new Timeout(apply.call(setInterval, window, arguments), clearInterval);\n};\nexports.clearTimeout =\nexports.clearInterval = function(timeout) { timeout.close(); };\n\nfunction Timeout(id, clearFn) {\n this._id = id;\n this._clearFn = clearFn;\n}\nTimeout.prototype.unref = Timeout.prototype.ref = function() {};\nTimeout.prototype.close = function() {\n this._clearFn.call(window, this._id);\n};\n\n// Does not start the time, just sets up the members needed.\nexports.enroll = function(item, msecs) {\n clearTimeout(item._idleTimeoutId);\n item._idleTimeout = msecs;\n};\n\nexports.unenroll = function(item) {\n clearTimeout(item._idleTimeoutId);\n item._idleTimeout = -1;\n};\n\nexports._unrefActive = exports.active = function(item) {\n clearTimeout(item._idleTimeoutId);\n\n var msecs = item._idleTimeout;\n if (msecs >= 0) {\n item._idleTimeoutId = setTimeout(function onTimeout() {\n if (item._onTimeout)\n item._onTimeout();\n }, msecs);\n }\n};\n\n// That's not how node.js implements it but the exposed api is the same.\nexports.setImmediate = typeof setImmediate === \"function\" ? setImmediate : function(fn) {\n var id = nextImmediateId++;\n var args = arguments.length < 2 ? false : slice.call(arguments, 1);\n\n immediateIds[id] = true;\n\n nextTick(function onNextTick() {\n if (immediateIds[id]) {\n // fn.call() is faster so we optimize for the common use-case\n // @see http://jsperf.com/call-apply-segu\n if (args) {\n fn.apply(null, args);\n } else {\n fn.call(null);\n }\n // Prevent ids from leaking\n exports.clearImmediate(id);\n }\n });\n\n return id;\n};\n\nexports.clearImmediate = typeof clearImmediate === \"function\" ? clearImmediate : function(id) {\n delete immediateIds[id];\n};","var libNPMModuleWrapper = require('./Fable.js');\n\nif ((typeof(window) === 'object') && !window.hasOwnProperty('Fable'))\n{\n\twindow.Fable = libNPMModuleWrapper;\n}\n\nmodule.exports = libNPMModuleWrapper;","const _OperationStatePrototype = JSON.stringify(\n{\n\t\"Metadata\": {\n\t\t\"GUID\": false,\n\t\t\"Hash\": false,\n\n\t\t\"Title\": \"\",\n\t\t\"Summary\": \"\",\n\n\t\t\"Version\": 0\n\t},\n\t\"Status\": {\n \"Completed\": false,\n\n \"CompletionProgress\": 0,\n \"CompletionTimeElapsed\": 0,\n\n \"Steps\": 1,\n \"StepsCompleted\": 0,\n\n \"StartTime\": 0,\n \"EndTime\": 0\n\t},\n\t\"Errors\": [],\n\t\"Log\": []\n});\n\nclass FableOperation\n{\n\tconstructor(pFable, pOperationName, pOperationHash)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.name = pOperationName;\n\n\t\tthis.state = JSON.parse(_OperationStatePrototype);\n\n\t\tthis.state.Metadata.GUID = this.fable.getUUID();\n\t\tthis.state.Metadata.Hash = this.state.GUID;\n\n\t\tif (typeof(pOperationHash) == 'string')\n\t\t{\n\t\t\tthis.state.Metadata.Hash = pOperationHash;\n\t\t}\n\t}\n\n\tget GUID()\n\t{\n\t\treturn this.state.Metadata.GUID;\n\t}\n\n\tget Hash()\n\t{\n\t\treturn this.state.Metadata.Hash;\n\t}\n\n\tget log()\n\t{\n\t\treturn this;\n\t}\n\n\twriteOperationLog(pLogLevel, pLogText, pLogObject)\n\t{\n\t\tthis.state.Log.push(`${new Date().toUTCString()} [${pLogLevel}]: ${pLogText}`);\n\n\t\tif (typeof(pLogObject) == 'object')\n\t\t{\n\t\t\tthis.state.Log.push(JSON.stringify(pLogObject));\n\t\t}\n\t}\n\n\twriteOperationErrors(pLogText, pLogObject)\n\t{\n\t\tthis.state.Errors.push(`${pLogText}`);\n\n\t\tif (typeof(pLogObject) == 'object')\n\t\t{\n\t\t\tthis.state.Errors.push(JSON.stringify(pLogObject));\n\t\t}\n\t}\n\n\ttrace(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('TRACE', pLogText, pLogObject);\n\t\tthis.fable.log.trace(pLogText, pLogObject);\n\t}\n\n\tdebug(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('DEBUG', pLogText, pLogObject);\n\t\tthis.fable.log.debug(pLogText, pLogObject);\n\t}\n\n\tinfo(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('INFO', pLogText, pLogObject);\n\t\tthis.fable.log.info(pLogText, pLogObject);\n\t}\n\n\twarn(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('WARN', pLogText, pLogObject);\n\t\tthis.fable.log.warn(pLogText, pLogObject);\n\t}\n\n\terror(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('ERROR', pLogText, pLogObject);\n\t\tthis.writeOperationErrors(pLogText, pLogObject);\n\t\tthis.fable.log.error(pLogText, pLogObject);\n\t}\n\n\tfatal(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('FATAL', pLogText, pLogObject);\n\t\tthis.writeOperationErrors(pLogText, pLogObject);\n\t\tthis.fable.log.fatal(pLogText, pLogObject);\n\t}\n}\n\nmodule.exports = FableOperation;","const libFableServiceBase = require('./Fable-ServiceProviderBase.js');\nconst libDataArithmatic = require('data-arithmatic');\n\nclass FableServiceDataArithmatic extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'DataArithmatic';\n\n this._DataArithmaticLibrary = new libDataArithmatic();\n\t}\n}\n\nmodule.exports = FableServiceDataArithmatic;","const libFableServiceBase = require('./Fable-ServiceProviderBase.js');\n\nconst libPrecedent = require('precedent');\n\nclass FableServiceMetaTemplate extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'MetaTemplate';\n\n this._MetaTemplateLibrary = new libPrecedent(this.options);\n\t}\n\n\t/**\n\t * Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pTree - A node on the parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern(pPatternStart, pPatternEnd, pParser)\n\t{\n\t\treturn this._MetaTemplateLibrary.addPattern(pPatternStart, pPatternEnd, pParser);\n\t}\n\n\t/**\n\t * Parse a string with the existing parse tree\n\t * @method parseString\n\t * @param {string} pString - The string to parse\n\t * @return {string} The result from the parser\n\t */\n\tparseString(pString, pData)\n\t{\n\t\treturn this._MetaTemplateLibrary.parseString(pString, pData);\n\t}\n}\n\nmodule.exports = FableServiceMetaTemplate;","const libFableServiceBase = require('./Fable-ServiceProviderBase.js');\n\nclass FableServiceTemplate extends libFableServiceBase\n{\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\t//\n\t// NOTE: This does not implement underscore escape expressions\n\t// NOTE: This does not implement underscore magic browser variable assignment\n\t//\n\t// This is an implementation of that.\n\t// TODO: Make this use precedent, add configuration, add debugging.\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'Template';\n\n\t\t// These are the exact regex's used in lodash/underscore\n\t\t// TODO: Switch this to precedent\n\t\tthis.Matchers = (\n\t\t\t{\n\t\t\t\tEvaluate: /<%([\\s\\S]+?)%>/g,\n\t\t\t\tInterpolate: /<%=([\\s\\S]+?)%>/g,\n\t\t\t\tEscaper: /\\\\|'|\\r|\\n|\\t|\\u2028|\\u2029/g,\n\t\t\t\tUnescaper: /\\\\(\\\\|'|r|n|t|u2028|u2029)/g,\n\t\t\t\t// This is how underscore does it, so we are keeping it for now.\n\t\t\t\tGuaranteedNonMatch: /.^/\n\t\t\t});\n\n\t\t// This is a helper for the escaper and unescaper functions.\n\t\t// Right now we are going to keep what underscore is doing, but, not forever.\n\t\tthis.templateEscapes = {\n\t\t\t'\\\\': '\\\\',\n\t\t\t\"'\": \"'\",\n\t\t\t'r': '\\r',\n\t\t\t'\\r': 'r',\n\t\t\t'n': '\\n',\n\t\t\t'\\n': 'n',\n\t\t\t't': '\\t',\n\t\t\t'\\t': 't',\n\t\t\t'u2028': '\\u2028',\n\t\t\t'\\u2028': 'u2028',\n\t\t\t'u2029': '\\u2029',\n\t\t\t'\\u2029': 'u2029'\n\t\t};\n\n\t\t// This is defined as such to underscore that it is a dynamic programming\n\t\t// function on this class.\n\t\tthis.renderFunction = false;\n this.templateString = false;\n\t}\n\n\trenderTemplate(pData)\n\t{\n\t\treturn this.renderFunction(pData);\n\t}\n\n\ttemplateFunction(pData)\n\t{\n\t\tlet fRenderTemplateBound = this.renderTemplate.bind(this);\n\t\treturn fRenderTemplateBound;\n\t}\n\n\tbuildTemplateFunction(pTemplateText, pData)\n\t{\n\t\t// For now this is being kept in a weird form ... this is to mimic the old\n\t\t// underscore code until this is rewritten using precedent.\n\t\tthis.TemplateSource = \"__p+='\" + pTemplateText\n\t\t\t.replace(this.Matchers.Escaper,\n\t\t\t\t(pMatch)=>\n\t\t\t\t{\n\t\t\t\t\treturn `\\\\${this.templateEscapes[pMatch]}`;\n\t\t\t\t})\n\t\t\t.replace(this.Matchers.Interpolate || this.Matchers.GuaranteedNonMatch,\n\t\t\t\t(pMatch, pCode) =>\n\t\t\t\t{\n\t\t\t\t\treturn `'+\\n(${decodeURIComponent(pCode)})+\\n'`;\n\t\t\t\t})\n\t\t\t.replace(this.Matchers.Evaluate || this.Matchers.GuaranteedNonMatch,\n\t\t\t\t(pMatch, pCode) =>\n\t\t\t\t{\n\t\t\t\t\treturn `';\\n${decodeURIComponent(pCode)}\\n;__p+='`;\n\t\t\t\t}) + `';\\n`;\n\n\n\t\tthis.TemplateSource = `with(pTemplateDataObject||{}){\\n${this.TemplateSource}}\\n`;\n\t\tthis.TemplateSource = `var __p='';var print=function(){__p+=Array.prototype.join.call(arguments, '')};\\n${this.TemplateSource}return __p;\\n`;\n\n\t\tthis.renderFunction = new Function('pTemplateDataObject', this.TemplateSource);\n\n\t\tif (typeof(pData) != 'undefined')\n\t\t{\n\t\t\treturn this.renderFunction(pData);\n\t\t}\n\n\t\t// Provide the compiled function source as a convenience for build time\n\t\t// precompilation.\n\t\tthis.TemplateSourceCompiled = 'function(obj){\\n' + this.TemplateSource + '}';\n\n\t\treturn this.templateFunction();\n\t}\n}\n\nmodule.exports = FableServiceTemplate;","const libFableServiceBase = require('./Fable-ServiceProviderBase.js');\n\n\n// TODO: These are still pretty big -- consider the smaller polyfills\nconst libAsyncWaterfall = require('async.waterfall');\nconst libAsyncEachLimit = require('async.eachlimit');\n\nclass FableServiceUtility extends libFableServiceBase\n{\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\t//\n\t// NOTE: This does not implement underscore escape expressions\n\t// NOTE: This does not implement underscore magic browser variable assignment\n\t//\n\t// This is an implementation of that.\n\t// TODO: Make this use precedent, add configuration, add debugging.\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n\t\tthis.templates = {};\n\n\t\t// These two functions are used extensively throughout\n\t\tthis.waterfall = libAsyncWaterfall;\n\t\tthis.eachLimit = libAsyncEachLimit;\n\t}\n\n\t// Underscore and lodash have a behavior, _.extend, which merges objects.\n\t// Now that es6 gives us this, use the native thingy.\n\textend(pDestinationObject, ...pSourceObjects)\n\t{\n\t\treturn Object.assign(pDestinationObject, ...pSourceObjects);\n\t}\n\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\ttemplate(pTemplateText, pData)\n\t{\n\t\tlet tmpTemplate = this.fable.serviceManager.instantiateServiceProviderWithoutRegistration('Template');\n\n\t\treturn tmpTemplate.buildTemplateFunction(pTemplateText, pData);\n\t}\n\n\t// Build a template function from a template hash, and, register it with the service provider\n\tbuildHashedTemplate(pTemplateHash, pTemplateText, pData)\n\t{\n\t\tlet tmpTemplate = this.fable.serviceManager.instantiateServiceProvider('Template', {}, pTemplateHash);\n\n\t\tthis.templates[pTemplateHash] = tmpTemplate.buildTemplateFunction(pTemplateText, pData);\n\n\t\treturn this.templates[pTemplateHash];\n\t}\n\n\t// This is a safe, modern version of chunk from underscore\n\t// Algorithm pulled from a mix of these two polyfills:\n\t// https://github.com/you-dont-need/You-Dont-Need-Lodash-Underscore#_chunk\n\t// https://youmightnotneed.com/lodash\n\t// This implementation was most tolerant in browsers. Uglify can fix the rest.\n\tchunk (pInput, pChunkSize, pChunkCache)\n\t{\n\t\tlet tmpInputArray = [...pInput];\n\t\t// Note lodash defaults to 1, underscore defaults to 0\n\t\tlet tmpChunkSize = (typeof(pChunkSize) == 'number') ? pChunkSize : 0;\n\t\tlet tmpChunkCache = (typeof(pChunkCache) != 'undefined') ? pChunkCache : [];\n\n\t\tif (tmpChunkSize <= 0)\n\t\t{\n\t\t\treturn tmpChunkCache;\n\t\t}\n\n\t\twhile (tmpInputArray.length)\n\t\t{\n\t\t\ttmpChunkCache.push(tmpInputArray.splice(0, tmpChunkSize));\n\t\t}\n\n\t\treturn tmpChunkCache;\n\t}\n}\n\nmodule.exports = FableServiceUtility;","/**\n* Fable Application Services Management\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\nconst libFableServiceBase = require('./Fable-ServiceProviderBase.js');\n\nclass FableService\n{\n\tconstructor(pFable)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.serviceTypes = [];\n\n\t\t// A map of instantiated services\n\t\tthis.services = {};\n\n\t\t// A map of the default instantiated service by type\n\t\tthis.defaultServices = {};\n\n\t\t// A map of class constructors for services\n\t\tthis.serviceClasses = {};\n\t}\n\n\taddServiceType(pServiceType, pServiceClass)\n\t{\n\t\t// Add the type to the list of types\n\t\tthis.serviceTypes.push(pServiceType);\n\n\t\t// Add the container for instantiated services to go in\n\t\tthis.services[pServiceType] = {};\n\n\t\tif ((typeof(pServiceClass) == 'function') && (pServiceClass.prototype instanceof libFableServiceBase))\n\t\t{\n\t\t\t// Add the class to the list of classes\n\t\t\tthis.serviceClasses[pServiceType] = pServiceClass;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Add the base class to the list of classes\n\t\t\tthis.serviceClasses[pServiceType] = libFableServiceBase;\n\t\t}\n\t}\n\n\tinstantiateServiceProvider(pServiceType, pOptions, pCustomServiceHash)\n\t{\n\t\t// Instantiate the service\n\t\tlet tmpService = this.instantiateServiceProviderWithoutRegistration(pServiceType, pOptions, pCustomServiceHash);\n\n\t\t// Add the service to the service map\n\t\tthis.services[pServiceType][tmpService.Hash] = tmpService;\n\n\t\t// If this is the first service of this type, make it the default\n\t\tif (!this.defaultServices.hasOwnProperty(pServiceType))\n\t\t{\n\t\t\tthis.defaultServices[pServiceType] = tmpService;\n\t\t}\n\n\t\treturn tmpService;\n\t}\n\n\t// Create a service provider but don't register it to live forever in fable.services\n\tinstantiateServiceProviderWithoutRegistration(pServiceType, pOptions, pCustomServiceHash)\n\t{\n\t\t// Instantiate the service\n\t\tlet tmpService = new this.serviceClasses[pServiceType](this.fable, pOptions, pCustomServiceHash);\n\t\treturn tmpService;\n\t}\n\n\tsetDefaultServiceInstantiation(pServiceType, pServiceHash)\n\t{\n\t\tif (this.services[pServiceType].hasOwnProperty(pServiceHash))\n\t\t{\n\t\t\tthis.defaultServices[pServiceType] = this.services[pServiceType][pServiceHash];\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n}\n\nmodule.exports = FableService;\n\nmodule.exports.ServiceProviderBase = libFableServiceBase;","/**\n* Fable Service Base\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\nclass FableServiceProviderBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.options = (typeof(pOptions) === 'object') ? pOptions : {};\n\n this.serviceType = 'Unknown';\n\n this.UUID = pFable.getUUID();\n\n this.Hash = (typeof(pServiceHash) === 'string') ? pServiceHash : `${this.UUID}`;\n\t}\n}\n\nmodule.exports = FableServiceProviderBase;\n","/**\n* Fable Application Services Support Library\n* @license MIT\n* @author <steven@velozo.com>\n*/\nconst libFableSettings = require('fable-settings');\nconst libFableUUID = require('fable-uuid');\nconst libFableLog = require('fable-log');\n\nconst libFableServiceManager = require('./Fable-ServiceManager.js');\n\nconst libFableServiceDataArithmatic = require('./Fable-Service-DataArithmatic.js');\nconst libFableServiceTemplate = require('./Fable-Service-Template.js');\nconst libFableServiceMetaTemplate = require('./Fable-Service-MetaTemplate.js');\nconst libFableServiceUtility = require('./Fable-Service-Utility.js');\n\nconst libFableOperation = require('./Fable-Operation.js');\n\nclass Fable\n{\n\tconstructor(pSettings)\n\t{\n\t\tlet tmpSettings = new libFableSettings(pSettings);\n\n\t\tthis.settingsManager = tmpSettings;\n\n\t\t// Instantiate the UUID generator\n\t\tthis.libUUID = new libFableUUID(this.settingsManager.settings);\n\n\t\tthis.log = new libFableLog(this.settingsManager.settings);\n\t\tthis.log.initialize();\n\n\t\t// Built-in dependencies\n\t\tthis.Dependencies = (\n\t\t\t{\n\t\t\t\tprecedent: libFableSettings.precedent\n\t\t\t});\n\n\t\t// Location for Operation state\n\t\tthis.Operations = {};\n\n\t\tthis.serviceManager = new libFableServiceManager(this);\n\n\t\t// Initialize and instantiate the default baked-in Data Arithmatic service\n\t\tthis.serviceManager.addServiceType('DataArithmatic', libFableServiceDataArithmatic);\n\t\tthis.fable.serviceManager.instantiateServiceProvider('DataArithmatic', {}, 'Default-Service-DataArithmatic');\n\t\t// This service is passing through the data arithmatic library\n\t\tthis.DataArithmatic = this.serviceManager.defaultServices.DataArithmatic._DataArithmaticLibrary;\n\n\t\t// Initialize the template service\n\t\tthis.serviceManager.addServiceType('Template', libFableServiceTemplate);\n\n\t\t// Initialize the metatemplate service\n\t\tthis.serviceManager.addServiceType('MetaTemplate', libFableServiceMetaTemplate);\n\n\t\t// Initialize and instantiate the default baked-in Utility service\n\t\tthis.serviceManager.addServiceType('Utility', libFableServiceUtility)\n\t\tthis.fable.serviceManager.instantiateServiceProvider('Utility', {}, 'Default-Service-Utility');\n\t\tthis.Utility = this.serviceManager.defaultServices.Utility;\n\n\t\tthis.services = this.serviceManager.services;\n\t\tthis.defaultServices = this.serviceManager.defaultServices;\n\t}\n\n\tget settings()\n\t{\n\t\treturn this.settingsManager.settings;\n\t}\n\n\tget fable()\n\t{\n\t\treturn this;\n\t}\n\n\tgetUUID()\n\t{\n\t\treturn this.libUUID.getUUID();\n\t}\n\n\tcreateOperation(pOperationName, pOperationHash)\n\t{\n\t\tlet tmpOperation = new libFableOperation(this, pOperationName, pOperationHash);\n\n\t\tif (this.Operations.hasOwnProperty(tmpOperation.Hash))\n\t\t{\n\t\t\t// Uh Oh ...... Operation Hash Collision!\n\t\t\t// TODO: What to do?!\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.Operations[tmpOperation.Hash] = tmpOperation;\n\t\t}\n\n\t\treturn tmpOperation;\n\t}\n\n\tgetOperation(pOperationHash)\n\t{\n\t\tif (!this.Operations.hasOwnProperty(pOperationHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.Operations[pOperationHash];\n\t\t}\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new Fable(pSettings);\n}\n\nmodule.exports = Fable;\nmodule.exports.new = autoConstruct;\n\nmodule.exports.LogProviderBase = libFableLog.LogProviderBase;\nmodule.exports.ServiceProviderBase = libFableServiceManager.ServiceProviderBase;\n\nmodule.exports.precedent = libFableSettings.precedent;"]}
1
+ {"version":3,"sources":["fable.min.js","node_modules/browser-pack/_prelude.js","node_modules/async.eachlimit/index.js","node_modules/async.iterator/index.js","node_modules/async.util.eachoflimit/index.js","node_modules/async.util.ensureasync/index.js","node_modules/async.util.isarray/index.js","node_modules/async.util.isarraylike/index.js","node_modules/async.util.keyiterator/index.js","node_modules/async.util.keys/index.js","node_modules/async.util.noop/index.js","node_modules/async.util.once/index.js","node_modules/async.util.onlyonce/index.js","node_modules/async.util.restparam/index.js","node_modules/async.util.setimmediate/index.js","node_modules/async.util.withoutindex/index.js","node_modules/async.waterfall/index.js","node_modules/base64-js/index.js","node_modules/buffer/index.js","node_modules/builtin-status-codes/browser.js","node_modules/data-arithmatic/source/DataArithmatic.js","node_modules/events/events.js","node_modules/fable-log/source/Fable-Log-BaseLogger.js","node_modules/fable-log/source/Fable-Log-DefaultProviders-Web.js","node_modules/fable-log/source/Fable-Log-DefaultStreams.json","node_modules/fable-log/source/Fable-Log-Logger-Console.js","node_modules/fable-log/source/Fable-Log-Logger-SimpleFlatFile.js","node_modules/fable-log/source/Fable-Log.js","node_modules/fable-settings/source/Fable-Settings-Default.json","node_modules/fable-settings/source/Fable-Settings-TemplateProcessor.js","node_modules/fable-settings/source/Fable-Settings.js","node_modules/fable-uuid/source/Fable-UUID-Random-Browser.js","node_modules/fable-uuid/source/Fable-UUID.js","node_modules/https-browserify/index.js","node_modules/ieee754/index.js","node_modules/inherits/inherits_browser.js","node_modules/once/once.js","node_modules/path-browserify/index.js","node_modules/precedent/source/Precedent.js","node_modules/precedent/source/StringParser.js","node_modules/precedent/source/WordTree.js","node_modules/process/browser.js","node_modules/punycode/punycode.js","node_modules/querystring-es3/decode.js","node_modules/querystring-es3/encode.js","node_modules/querystring-es3/index.js","node_modules/safe-buffer/index.js","node_modules/simple-concat/index.js","node_modules/simple-get/index.js","node_modules/stream-http/index.js","node_modules/stream-http/lib/capability.js","node_modules/stream-http/lib/request.js","node_modules/stream-http/lib/response.js","node_modules/stream-http/node_modules/readable-stream/errors-browser.js","node_modules/stream-http/node_modules/readable-stream/lib/_stream_duplex.js","node_modules/stream-http/node_modules/readable-stream/lib/_stream_passthrough.js","node_modules/stream-http/node_modules/readable-stream/lib/_stream_readable.js","node_modules/stream-http/node_modules/readable-stream/lib/_stream_transform.js","node_modules/stream-http/node_modules/readable-stream/lib/_stream_writable.js","node_modules/stream-http/node_modules/readable-stream/lib/internal/streams/async_iterator.js","node_modules/stream-http/node_modules/readable-stream/lib/internal/streams/buffer_list.js","node_modules/stream-http/node_modules/readable-stream/lib/internal/streams/destroy.js","node_modules/stream-http/node_modules/readable-stream/lib/internal/streams/end-of-stream.js","node_modules/stream-http/node_modules/readable-stream/lib/internal/streams/from-browser.js","node_modules/stream-http/node_modules/readable-stream/lib/internal/streams/pipeline.js","node_modules/stream-http/node_modules/readable-stream/lib/internal/streams/state.js","node_modules/stream-http/node_modules/readable-stream/lib/internal/streams/stream-browser.js","node_modules/stream-http/node_modules/readable-stream/readable-browser.js","node_modules/string_decoder/lib/string_decoder.js","node_modules/timers-browserify/main.js","node_modules/url/url.js","node_modules/url/util.js","node_modules/util-deprecate/browser.js","node_modules/wrappy/wrappy.js","node_modules/xtend/immutable.js","source/Fable-Browser-Shim.js","source/Fable-Operation.js","source/Fable-PreinitServiceProviderBase.js","source/Fable-ServiceManager.js","source/Fable-ServiceProviderBase.js","source/Fable.js","source/services/Fable-Service-DataArithmatic.js","source/services/Fable-Service-MetaTemplate.js","source/services/Fable-Service-RestClient.js","source/services/Fable-Service-Template.js","source/services/Fable-Service-Utility.js"],"names":["f","exports","module","define","amd","window","global","self","this","Fable","r","e","n","t","o","i","c","require","u","a","Error","code","p","call","length","eachOfLimit","withoutIndex","arr","limit","iterator","cb","tasks","makeCallback","index","fn","apply","arguments","next","once","noop","onlyOnce","keyIterator","obj","nextKey","done","running","errored","replenish","key","err","setImmediate","restParam","args","callback","pop","push","innerArgs","sync","Array","isArray","Object","prototype","toString","_keys","isArrayLike","coll","len","keys","k","hasOwnProperty","func","startIndex","Math","max","rest","_setImmediate","fallback","setTimeout","timers","value","ensureAsync","wrapIterator","concat","byteLength","b64","lens","getLens","validLen","placeHoldersLen","toByteArray","tmp","Arr","_byteLength","curByte","revLookup","charCodeAt","fromByteArray","uint8","extraBytes","parts","maxChunkLength","len2","encodeChunk","lookup","join","Uint8Array","indexOf","start","end","num","output","dup","Buffer","base64","ieee754","SlowBuffer","alloc","INSPECT_MAX_BYTES","K_MAX_LENGTH","createBuffer","RangeError","buf","__proto__","arg","encodingOrOffset","TypeError","allocUnsafe","from","string","encoding","isEncoding","actual","write","slice","fromString","ArrayBuffer","isView","fromArrayLike","isInstance","buffer","array","byteOffset","undefined","fromArrayBuffer","valueOf","b","isBuffer","checked","copy","numberIsNaN","type","data","fromObject","Symbol","toPrimitive","assertSize","size","mustMatch","loweredCase","utf8ToBytes","base64ToBytes","toLowerCase","slowToString","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","swap","m","bidirectionalIndexOf","val","dir","arrayIndexOf","lastIndexOf","indexSize","arrLength","valLength","String","read","readUInt16BE","foundIndex","found","j","hexWrite","offset","Number","remaining","strLen","parsed","parseInt","substr","utf8Write","blitBuffer","asciiWrite","str","byteArray","asciiToBytes","latin1Write","base64Write","ucs2Write","units","hi","lo","utf16leToBytes","min","res","secondByte","thirdByte","fourthByte","tempCodePoint","firstByte","codePoint","bytesPerSequence","codePoints","MAX_ARGUMENTS_LENGTH","fromCharCode","decodeCodePointsArray","kMaxLength","TYPED_ARRAY_SUPPORT","foo","typedArraySupport","console","error","defineProperty","enumerable","get","species","configurable","writable","poolSize","fill","allocUnsafeSlow","_isBuffer","compare","x","y","list","pos","swap16","swap32","swap64","toLocaleString","equals","inspect","replace","trim","target","thisStart","thisEnd","thisCopy","targetCopy","includes","isFinite","toJSON","_arr","ret","out","toHex","bytes","checkOffset","ext","checkInt","checkIEEE754","writeFloat","littleEndian","noAssert","writeDouble","newBuf","subarray","readUIntLE","mul","readUIntBE","readUInt8","readUInt16LE","readUInt32LE","readUInt32BE","readIntLE","pow","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","copyWithin","set","INVALID_BASE64_RE","Infinity","leadSurrogate","split","base64clean","src","dst","constructor","name","_Regex_formatterInsertCommas","_Regex_formatterAddCommasToNumber","_Regex_formatterDollarsRemoveCommas","_Regex_formatterCleanNonAlpha","_Value_MoneySign_Currency","_Value_NaN_Currency","_Value_GroupSeparator_Number","_Value_Prefix_StringHash","_Value_Clean_formatterCleanNonAlpha","_UseEngineStringStartsWith","startsWith","_UseEngineStringEndsWith","endsWith","stringReverse","pString","reverse","stringStartsWith","pSearchString","pStartIndex","stringStartsWith_Polyfill","stringEndsWith","pEndIndex","stringEndsWith_Polyfill","insecureStringHash","tmpHash","tmpStringLength","tmpCharacterIndex","cleanEnclosureWrapCharacters","pWrapCharacter","substring","cleanNonAlphaCharacters","formatterInsertCommas","tmpReversedWithCommas","match","processAddCommasToNumberRegex","pMatch","pSign","pZeros","pBefore","pDecimal","pAfter","formatterAddCommasToNumber","pNumber","bind","formatterDollars","pValue","tmpDollarAmount","parseFloat","toFixed","isNaN","formatterRoundNumber","pDigits","tmpDigits","tmpValue","stringBeforeMatch","stringAfterMatch","tmpStringSplitLocation","stringCountEnclosures","pEnclosureStart","pEnclosureEnd","tmpString","tmpEnclosureStart","tmpEnclosureEnd","tmpEnclosureCount","tmpEnclosureDepth","stringGetEnclosureValueByIndex","pEnclosureIndexToGet","tmpEnclosureIndexToGet","tmpMatchedEnclosureIndex","tmpEnclosedValueStartIndex","tmpEnclosedValueEndIndex","stringRemoveEnclosureByIndex","pEnclosureIndexToRemove","tmpEnclosureIndexToRemove","tmpEnclosureStartIndex","tmpEnclosureEndIndex","tmpReturnString","ReflectOwnKeys","R","Reflect","ReflectApply","receiver","Function","ownKeys","getOwnPropertySymbols","getOwnPropertyNames","NumberIsNaN","EventEmitter","init","emitter","Promise","resolve","reject","errorListener","removeListener","resolver","eventTargetAgnosticAddListener","handler","flags","on","addErrorHandlerIfEventEmitter","_events","_eventsCount","_maxListeners","defaultMaxListeners","checkListener","listener","_getMaxListeners","that","_addListener","prepend","events","existing","warning","create","newListener","emit","unshift","warned","w","count","warn","onceWrapper","fired","wrapFn","_onceWrap","state","wrapped","_listeners","unwrap","evlistener","unwrapListeners","arrayClone","listenerCount","addEventListener","wrapListener","removeEventListener","getPrototypeOf","setMaxListeners","getMaxListeners","doError","er","message","context","listeners","addListener","prependListener","prependOnceListener","position","originalListener","shift","spliceOne","off","removeAllListeners","rawListeners","eventNames","pLogStreamSettings","pFableLog","_Settings","loggerUUID","generateInsecureUUID","levels","tmpDate","Date","getTime","pCharacter","tmpRandomData","random","floor","initialize","trace","pLogText","pLogObject","debug","info","fatal","pLogLevel","getDefaultProviders","tmpDefaultProviders","default","loggertype","streamtype","level","libBaseLogger","super","_ShowTimeStamps","showtimestamps","_FormattedTimeStamps","formattedtimestamps","_ContextMessage","Context","Product","_OutputLogLinesToConsole","outputloglinestoconsole","_OutputObjectsToConsole","outputobjectstoconsole","prefixCache","pLevel","pObject","tmpTimeStamp","toISOString","tmpLogLine","log","JSON","stringify","libConsoleLog","libFS","libPath","logFileRawPath","path","logFilePath","normalize","logFileStreamOptions","fileStreamOptions","fileWriter","createWriteStream","activelyWriting","logLineStrings","logObjectStrings","defaultWriteCompleteCallback","defaultBufferFlushCallback","closeWriter","fCloseComplete","tmpCloseComplete","completeBufferFlushToLogFile","fFlushComplete","tmpFlushComplete","flushBufferToLogFile","tmpLineStrings","tmpObjectStrings","tmpConstructedBufferOutputString","fs","FableLog","pFableSettings","pFable","tmpSettings","_Providers","_StreamDefinitions","LogStreams","logStreams","logProviders","activeLogStreams","logStreamsTrace","logStreamsDebug","logStreamsInfo","logStreamsWarn","logStreamsError","logStreamsFatal","datumDecorator","pDatum","uuid","addLogger","pLogger","setDatumDecorator","fDatumDecorator","pMessage","tmpDecoratedDatum","tmpStreamDefinition","assign","logTime","tmpMessage","tmpTime","getTimeStamp","getTimeDelta","pTimeStamp","logTimeDelta","pTimeDelta","tmpEndTime","logTimeDeltaHuman","tmpMs","tmpSeconds","tmpMinutes","tmpHours","logTimeDeltaRelative","pStartTime","logTimeDeltaRelativeHuman","new","pSettings","LogProviderBase","LogProviderConsole","ProductVersion","ConfigFile","process","pDependencies","templateProcessor","precedent","addPattern","pTemplateValue","tmpTemplateValue","tmpSeparatorIndex","tmpDefaultValue","tmpEnvironmentVariableName","env","parseSetting","parseString","_process","libPrecedent","libFableSettingsTemplateProcessor","FableSettings","dependencies","settingsTemplateProcessor","_configureEnvTemplating","buildDefaultSettings","merge","base","parse","DefaultConfigFile","pException","settings","_PerformEnvTemplating","NoEnvReplacement","_resolveEnv","tmpKey","_isObject","_deepMergeObjects","toObject","forEach","fromValue","toValue","pSettingsFrom","pSettingsTo","tmpSettingsFrom","tmpSettingsTo","tmpSettingsFromCopy","getRandomValues","crypto","msCrypto","generateWhatWGBytes","tmpBuffer","generateRandomBytes","generate","libRandomByteGenerator","FableUUID","_UUIDModeRandom","UUIDModeRandom","_UUIDLength","UUIDLength","_UUIDRandomDictionary","UUIDDictionary","randomByteGenerator","_HexLookup","bytesToUUID","pBuffer","generateUUIDv4","tmpRandomBytes","generateRandom","tmpUUID","charAt","getUUID","http","url","https","validateParams","params","protocol","request","isLE","mLen","nBytes","eLen","eMax","eBias","nBits","d","s","NaN","rt","abs","LN2","ctor","superCtor","super_","TempCtor","wrappy","called","onceStrict","onceError","strict","proto","assertPath","normalizeStringPosix","allowAboveRoot","lastSegmentLength","lastSlash","dots","lastSlashIndex","posix","cwd","resolvedPath","resolvedAbsolute","isAbsolute","trailingSeparator","joined","relative","to","fromStart","fromEnd","fromLen","toStart","toLen","lastCommonSep","fromCode","_makeLong","dirname","hasRoot","matchedSlash","basename","extIdx","firstNonSlashEnd","extname","startDot","startPart","preDotState","format","pathObject","sep","root","_format","delimiter","win32","libWordTree","libStringParser","WordTree","StringParser","ParseTree","pPatternStart","pPatternEnd","pParser","pData","newParserState","pParseTree","Output","OutputBuffer","Pattern","PatternMatch","PatternMatchOutputBuffer","assignNode","pNode","pParserState","appendOutputBuffer","flushOutputBuffer","checkPatternEnd","PatternEnd","PatternStart","Parse","parseCharacter","tmpParserState","addChild","pTree","pPattern","pIndex","tmpLeaf","cachedSetTimeout","cachedClearTimeout","defaultSetTimout","defaultClearTimeout","runTimeout","fun","clearTimeout","currentQueue","queue","draining","queueIndex","cleanUpNextTick","drainQueue","timeout","run","marker","runClearTimeout","Item","nextTick","title","browser","argv","version","versions","binding","chdir","umask","freeExports","nodeType","freeModule","freeGlobal","punycode","maxInt","tMin","tMax","skew","damp","initialBias","initialN","regexPunycode","regexNonASCII","regexSeparators","errors","overflow","baseMinusTMin","stringFromCharCode","map","result","mapDomain","ucs2decode","extra","counter","ucs2encode","digitToBasic","digit","flag","adapt","delta","numPoints","firstTime","decode","input","basic","oldi","baseMinusT","inputLength","bias","splice","encode","handledCPCount","basicLength","q","currentValue","handledCPCountPlusOne","qMinusT","ucs2","toASCII","test","toUnicode","prop","qs","eq","options","regexp","maxKeys","kstr","vstr","v","idx","decodeURIComponent","xs","stringifyPrimitive","objectKeys","ks","encodeURIComponent","copyProps","SafeBuffer","stream","chunks","chunk","simpleGet","decompressResponse","querystring","isStream","pipe","opts","maxRedirects","hostname","port","auth","headers","body","json","form","method","accept","toUpperCase","originalHost","req","followRedirects","statusCode","location","host","resume","redirectHost","cookie","authorization","tryUnzip","abort","ClientRequest","response","extend","statusCodes","defaultProtocol","search","IncomingMessage","Agent","defaultMaxSockets","globalAgent","STATUS_CODES","METHODS","xtend","xhr","getXHR","XMLHttpRequest","open","XDomainRequest","checkTypeSupport","responseType","isFunction","fetch","ReadableStream","writableStream","WritableStream","abortController","AbortController","arraybuffer","msstream","mozchunkedarraybuffer","overrideMimeType","capability","inherits","rStates","readyStates","preferBinary","Writable","_opts","_body","_headers","setHeader","useFetch","mode","_mode","decideMode","_fetchTimer","_socketTimeout","_socketTimer","_onFinish","lowerName","unsafeHeaders","getHeader","header","removeHeader","_destroyed","headersObj","Blob","headersList","keyName","signal","controller","_fetchAbortController","requestTimeout","credentials","withCredentials","then","_fetchResponse","_resetTimers","_connect","reason","_xhr","ontimeout","setRequestHeader","_response","onreadystatechange","readyState","LOADING","DONE","_onXHRProgress","onprogress","onerror","send","status","statusValid","_write","destroy","flushHeaders","setNoDelay","setSocketKeepAlive","UNSENT","OPENED","HEADERS_RECEIVED","resetTimers","Readable","rawHeaders","trailers","rawTrailers","statusMessage","statusText","_resumeFetch","close","pipeTo","catch","reader","getReader","_pos","responseURL","getAllResponseHeaders","matches","_charset","mimeType","charsetMatch","_read","responseText","newData","MSStreamReader","onload","readAsArrayBuffer","codes","createErrorType","Base","NodeError","_Base","subClass","superClass","arg1","arg2","arg3","getMessage","oneOf","expected","thing","determiner","msg","this_len","Duplex","allowHalfOpen","readable","onend","_writableState","ended","onEndNT","highWaterMark","getBuffer","_readableState","destroyed","PassThrough","Transform","_transform","ReadableState","EElistenerCount","Stream","OurUint8Array","debugUtil","debuglog","StringDecoder","createReadableStreamAsyncIterator","BufferList","destroyImpl","getHighWaterMark","_require$codes","ERR_INVALID_ARG_TYPE","ERR_STREAM_PUSH_AFTER_EOF","ERR_METHOD_NOT_IMPLEMENTED","ERR_STREAM_UNSHIFT_AFTER_END_EVENT","errorOrDestroy","kProxyEvents","isDuplex","objectMode","readableObjectMode","pipes","pipesCount","flowing","endEmitted","reading","needReadable","emittedReadable","readableListening","resumeScheduled","paused","emitClose","autoDestroy","defaultEncoding","awaitDrain","readingMore","decoder","_destroy","readableAddChunk","addToFront","skipChunkCheck","emitReadable","emitReadable_","onEofChunk","chunkInvalid","_uint8ArrayToBuffer","addChunk","maybeReadMore","_undestroy","undestroy","isPaused","setEncoding","enc","head","content","clear","MAX_HWM","howMuchToRead","computeNewHighWaterMark","flow","maybeReadMore_","updateReadableListening","nReadingNextTick","resume_","fromList","first","consume","endReadable","endReadableNT","wState","finished","l","nOrig","doRead","dest","pipeOpts","endFn","stdout","stderr","unpipe","onunpipe","unpipeInfo","hasUnpiped","onclose","onfinish","ondrain","ondata","cleanedUp","needDrain","pipeOnDrain","pause","event","dests","ev","wrap","_this","asyncIterator","_fromList","iterable","util","ERR_MULTIPLE_CALLBACK","ERR_TRANSFORM_ALREADY_TRANSFORMING","ERR_TRANSFORM_WITH_LENGTH_0","afterTransform","ts","_transformState","transforming","writecb","writechunk","rs","needTransform","writeencoding","transform","flush","_flush","prefinish","err2","CorkedRequest","entry","finish","corkReq","pendingcb","corkedRequestsFree","onCorkedFinish","WritableState","internalUtil","deprecate","realHasInstance","ERR_STREAM_CANNOT_PIPE","ERR_STREAM_DESTROYED","ERR_STREAM_NULL_VALUES","ERR_STREAM_WRITE_AFTER_END","ERR_UNKNOWN_ENCODING","nop","writableObjectMode","finalCalled","ending","noDecode","decodeStrings","writing","corked","bufferProcessing","onwrite","writelen","onwriteStateUpdate","finishMaybe","errorEmitted","onwriteError","needFinish","bufferedRequest","clearBuffer","afterWrite","lastBufferedRequest","prefinished","bufferedRequestCount","writev","_writev","final","_final","doWrite","onwriteDrain","holder","allBuffers","isBuf","callFinal","need","rState","current","_","hasInstance","object","writeAfterEnd","validChunk","newChunk","decodeChunk","last","writeOrBuffer","cork","uncork","setDefaultEncoding","endWritable","_Object$setPrototypeO","_defineProperty","hint","prim","_toPrimitive","_toPropertyKey","kLastResolve","kLastReject","kError","kEnded","kLastPromise","kHandlePromise","kStream","createIterResult","readAndResolve","iter","onReadable","AsyncIteratorPrototype","ReadableStreamAsyncIteratorPrototype","setPrototypeOf","promise","lastPromise","wrapForNext","_this2","_Object$create","enumerableOnly","symbols","filter","sym","getOwnPropertyDescriptor","_objectSpread","source","getOwnPropertyDescriptors","defineProperties","_defineProperties","props","descriptor","custom","instance","Constructor","_classCallCheck","tail","protoProps","staticProps","hasStrings","_getString","_getBuffer","nb","depth","customInspect","emitErrorAndCloseNT","emitErrorNT","emitCloseNT","readableDestroyed","writableDestroyed","ERR_STREAM_PREMATURE_CLOSE","eos","_len","_key","onlegacyfinish","writableEnded","readableEnded","onrequest","isRequest","ERR_MISSING_ARGS","streams","popCallback","destroys","closed","destroyer","reduce","ERR_INVALID_OPT_VALUE","duplexKey","hwm","highWaterMarkFrom","pipeline","nenc","retried","_normalizeEncoding","normalizeEncoding","text","utf16Text","utf16End","fillLast","utf8FillLast","base64Text","base64End","simpleWrite","simpleEnd","lastNeed","lastTotal","lastChar","utf8CheckByte","byte","utf8CheckExtraBytes","total","utf8CheckIncomplete","clearImmediate","immediateIds","nextImmediateId","Timeout","id","clearFn","_id","_clearFn","setInterval","clearInterval","unref","ref","enroll","item","msecs","_idleTimeoutId","_idleTimeout","unenroll","_unrefActive","active","_onTimeout","Url","slashes","hash","query","pathname","href","urlParse","resolveObject","isString","protocolPattern","portPattern","simplePathPattern","unwise","autoEscape","nonHostChars","hostEndingChars","hostnamePartPattern","hostnamePartStart","unsafeProtocol","javascript","hostlessProtocol","slashedProtocol","ftp","gopher","file","parseQueryString","slashesDenoteHost","isObject","queryIndex","splitter","uSplit","simplePath","exec","lowerProto","atSign","hostEnd","hec","parseHost","ipv6Hostname","hostparts","part","newpart","validParts","notHost","bit","h","ae","esc","escape","qm","rel","tkeys","tk","tkey","rkeys","rk","rkey","relPath","isSourceAbs","isRelAbs","mustEndAbs","removeAllDots","srcPath","psychotic","isNullOrUndefined","authInHost","isNull","hasTrailingSlash","up","config","localStorage","wrapper","libNPMModuleWrapper","_OperationStatePrototype","Metadata","GUID","Hash","Title","Summary","Version","Status","Completed","CompletionProgress","CompletionTimeElapsed","Steps","StepsCompleted","StartTime","EndTime","Errors","Log","pOperationName","pOperationHash","fable","writeOperationLog","toUTCString","writeOperationErrors","pOptions","pServiceHash","serviceType","UUID","connectFable","libFableServiceBase","serviceTypes","services","defaultServices","serviceClasses","addServiceType","pServiceType","pServiceClass","instantiateServiceProvider","pCustomServiceHash","tmpService","instantiateServiceProviderWithoutRegistration","connectPreinitServiceProviderInstance","pServiceInstance","tmpServiceType","tmpServiceHash","setDefaultServiceInstantiation","ServiceProviderBase","libFableSettings","libFableUUID","libFableLog","libFablePreinitServiceProviderBase","libFableServiceManager","libFableServiceDataArithmatic","libFableServiceMetaTemplate","libFableServiceRestClient","libFableServiceTemplate","libFableServiceUtility","libFableOperation","settingsManager","libUUID","Dependencies","Operations","serviceManager","DataArithmatic","_DataArithmaticLibrary","Utility","createOperation","tmpOperation","getOperation","PreinitServiceProviderBase","libDataArithmatic","_MetaTemplateLibrary","libSimpleGet","_SimpleGet","Matchers","Evaluate","Interpolate","Escaper","Unescaper","GuaranteedNonMatch","templateEscapes","u2028","u2029","renderFunction","templateString","renderTemplate","templateFunction","buildTemplateFunction","pTemplateText","TemplateSource","pCode","TemplateSourceCompiled","libAsyncWaterfall","libAsyncEachLimit","templates","waterfall","eachLimit","pDestinationObject","_len2","pSourceObjects","_key2","template","buildHashedTemplate","pTemplateHash","tmpTemplate","pInput","pChunkSize","pChunkCache","tmpInputArray","tmpChunkSize","tmpChunkCache"],"mappings":"AAAA,cCAA,SAAAA,GAAA,GAAA,iBAAAC,SAAA,oBAAAC,OAAAA,OAAAD,QAAAD,SAAA,GAAA,mBAAAG,QAAAA,OAAAC,IAAAD,OAAA,GAAAH,OAAA,EAAA,oBAAAK,OAAAA,OAAA,oBAAAC,OAAAA,OAAA,oBAAAC,KAAAA,KAAAC,MAAAC,MAAAT,GAAA,CAAA,CAAA,EAAA,WAAA,OAAA,SAAAU,EAAAC,EAAAC,EAAAC,GAAA,SAAAC,EAAAC,EAAAf,GAAA,IAAAY,EAAAG,GAAA,CAAA,IAAAJ,EAAAI,GAAA,CAAA,IAAAC,EAAA,mBAAAC,SAAAA,QAAA,IAAAjB,GAAAgB,EAAA,OAAAA,EAAAD,GAAA,GAAA,GAAAG,EAAA,OAAAA,EAAAH,GAAA,GAAA,IAAAI,EAAA,IAAAC,MAAA,uBAAAL,EAAA,KAAA,MAAAI,EAAAE,KAAA,mBAAAF,CAAA,CAAA,IAAAG,EAAAV,EAAAG,GAAA,CAAAd,QAAA,CAAA,GAAAU,EAAAI,GAAA,GAAAQ,KAAAD,EAAArB,SAAA,SAAAS,GAAA,OAAAI,EAAAH,EAAAI,GAAA,GAAAL,IAAAA,EAAA,GAAAY,EAAAA,EAAArB,QAAAS,EAAAC,EAAAC,EAAAC,EAAA,CAAA,OAAAD,EAAAG,GAAAd,OAAA,CAAA,IAAA,IAAAiB,EAAA,mBAAAD,SAAAA,QAAAF,EAAA,EAAAA,EAAAF,EAAAW,OAAAT,IAAAD,EAAAD,EAAAE,IAAA,OAAAD,CAAA,CAAA,CAAA,CAAA,EAAA,CAAA,SAAAG,EAAAf,EAAAD,GCEA,IAAAwB,EAAAR,EAAA,0BACAS,EAAAT,EAAA,2BAEAf,EAAAD,QAAA,SAAA0B,EAAAC,EAAAC,EAAAC,GACA,OAAAL,EAAAG,EAAAH,CAAAE,EAAAD,EAAAG,GAAAC,EACA,CFGA,EAAE,CAAC,yBAAyB,EAAE,0BAA0B,KAAK,EAAE,CAAC,SAASb,EAAQf,EAAOD,GGRxFC,EAAAD,QAAA,SAAA8B,GAaA,OAZA,SAAAC,EAAAC,GACA,SAAAC,IAIA,OAHAH,EAAAP,QACAO,EAAAE,GAAAE,MAAA,KAAAC,WAEAF,EAAAG,MACA,CAIA,OAHAH,EAAAG,KAAA,WACA,OAAAJ,EAAAF,EAAAP,OAAA,EAAAQ,EAAAC,EAAA,GAAA,IACA,EACAC,CACA,CACAF,CAAA,EACA,CHaA,EAAE,CAAC,GAAG,EAAE,CAAC,SAASf,EAAQf,EAAOD,GI7BjC,IAAAqC,EAAArB,EAAA,mBACAsB,EAAAtB,EAAA,mBACAuB,EAAAvB,EAAA,uBACAwB,EAAAxB,EAAA,0BAEAf,EAAAD,QAAA,SAAA2B,GACA,OAAA,SAAAc,EAAAb,EAAAC,GACAA,EAAAQ,EAAAR,GAAAS,GAEA,IAAAI,EAAAF,EADAC,EAAAA,GAAA,IAEA,GAAAd,GAAA,EACA,OAAAE,EAAA,MAEA,IAAAc,GAAA,EACAC,EAAA,EACAC,GAAA,GAEA,SAAAC,IACA,GAAAH,GAAAC,GAAA,EACA,OAAAf,EAAA,MAGA,KAAAe,EAAAjB,IAAAkB,GAAA,CACA,IAAAE,EAAAL,IACA,GAAA,OAAAK,EAKA,OAJAJ,GAAA,OACAC,GAAA,GACAf,EAAA,OAIAe,GAAA,EACAhB,EAAAa,EAAAM,GAAAA,EAAAR,GAAA,SAAAS,GACAJ,GAAA,EACAI,GACAnB,EAAAmB,GACAH,GAAA,GAEAC,GAEA,IACA,CACA,CAzBA,EA0BA,CACA,CJgCA,EAAE,CAAC,yBAAyB,EAAE,kBAAkB,EAAE,kBAAkB,GAAG,sBAAsB,KAAK,EAAE,CAAC,SAAS9B,EAAQf,EAAOD,GK3E7H,IAAAiD,EAAAjC,EAAA,2BACAkC,EAAAlC,EAAA,wBAEAf,EAAAD,QAAA,SAAAiC,GACA,OAAAiB,GAAA,SAAAC,GACA,IAAAC,EAAAD,EAAAE,MACAF,EAAAG,MAAA,WACA,IAAAC,EAAApB,UACAqB,EACAP,GAAA,WACAG,EAAAlB,MAAA,KAAAqB,EACA,IAEAH,EAAAlB,MAAA,KAAAqB,EAEA,IACA,IAAAC,GAAA,EACAvB,EAAAC,MAAA3B,KAAA4C,GACAK,GAAA,CACA,GACA,CL+EA,EAAE,CAAC,uBAAuB,GAAG,0BAA0B,KAAK,EAAE,CAAC,SAASxC,EAAQf,EAAOD,GMlGvFC,EAAAD,QAAAyD,MAAAC,SAAA,SAAAjB,GACA,MAAA,mBAAAkB,OAAAC,UAAAC,SAAAvC,KAAAmB,EACA,CNuGA,EAAE,CAAC,GAAG,EAAE,CAAC,SAASzB,EAAQf,EAAOD,GOzGjC,IAAA0D,EAAA1C,EAAA,sBAEAf,EAAAD,QAAA,SAAA0B,GACA,OAAAgC,EAAAhC,IAEA,iBAAAA,EAAAH,QACAG,EAAAH,QAAA,GACAG,EAAAH,OAAA,GAAA,CAEA,CP8GA,EAAE,CAAC,qBAAqB,IAAI,EAAE,CAAC,SAASP,EAAQf,EAAOD,GQvHvD,IAAA8D,EAAA9C,EAAA,mBACA+C,EAAA/C,EAAA,0BAEAf,EAAAD,QAAA,SAAAgE,GACA,IACAC,EACAC,EAFApD,GAAA,EAGA,OAAAiD,EAAAC,IACAC,EAAAD,EAAAzC,OACA,WAEA,QADAT,EACAmD,EAAAnD,EAAA,IACA,IAEAoD,EAAAJ,EAAAE,GACAC,EAAAC,EAAA3C,OACA,WAEA,QADAT,EACAmD,EAAAC,EAAApD,GAAA,IACA,EAEA,CR4HA,EAAE,CAAC,yBAAyB,EAAE,kBAAkB,IAAI,EAAE,CAAC,SAASE,EAAQf,EAAOD,GSjJ/EC,EAAAD,QAAA2D,OAAAO,MAAA,SAAAzB,GACA,IAAAqB,EAAA,GACA,IAAA,IAAAK,KAAA1B,EACAA,EAAA2B,eAAAD,IACAL,EAAAR,KAAAa,GAGA,OAAAL,CACA,CTsJA,EAAE,CAAC,GAAG,EAAE,CAAC,SAAS9C,EAAQf,EAAOD,GU9JjCC,EAAAD,QAAA,WAAA,CVmKA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASgB,EAAQf,EAAOD,GWnKlCC,EAAAD,QAAA,SAAAiC,GACA,OAAA,WACA,OAAAA,IACAA,EAAAC,MAAA3B,KAAA4B,WACAF,EAAA,KACA,CACA,CXwKA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASjB,EAAQf,EAAOD,GY9KlCC,EAAAD,QAAA,SAAAiC,GACA,OAAA,WACA,GAAA,OAAAA,EAAA,MAAA,IAAAd,MAAA,gCACAc,EAAAC,MAAA3B,KAAA4B,WACAF,EAAA,IACA,CACA,CZmLA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASjB,EAAQf,EAAOD,Ga1LlCC,EAAAD,QAAA,SAAAqE,EAAAC,GAEA,OADAA,EAAA,MAAAA,EAAAD,EAAA9C,OAAA,GAAA+C,EACA,WAGA,IAFA,IAAA/C,EAAAgD,KAAAC,IAAArC,UAAAZ,OAAA+C,EAAA,GACAG,EAAA,IAAAhB,MAAAlC,GACAS,EAAA,EAAAA,EAAAT,EAAAS,IACAyC,EAAAzC,GAAAG,UAAAH,EAAAsC,GAEA,OAAAA,GACA,KAAA,EACA,OAAAD,EAAA/C,KAAAf,KAAAkE,GACA,KAAA,EACA,OAAAJ,EAAA/C,KAAAf,KAAA4B,UAAA,GAAAsC,GAEA,CACA,Cb8LA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASzD,EAAQf,EAAOD,IAClC,SAAWiD,IAAc,Wc7MzB,IAAAyB,EAAA,mBAAAzB,GAAAA,EACA0B,EAAA,SAAA1C,GACA2C,WAAA3C,EAAA,EACA,EAEAhC,EAAAD,QAAA,SAAAiC,GAEA,OAAAyC,GAAAC,GAAA1C,EACA,CdkNC,GAAEX,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,UAAUiC,aAE5C,EAAE,CAAC4B,OAAS,KAAK,GAAG,CAAC,SAAS7D,EAAQf,EAAOD,Ge5N7CC,EAAAD,QAAA,SAAA4B,GACA,OAAA,SAAAkD,EAAA9C,EAAAoB,GACA,OAAAxB,EAAAkD,EAAA1B,EACA,CACA,CfiOA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASpC,EAAQf,EAAOD,GgBrOlC,IAAAqC,EAAArB,EAAA,mBACAsB,EAAAtB,EAAA,mBACA0C,EAAA1C,EAAA,sBACAkC,EAAAlC,EAAA,wBACA+D,EAAA/D,EAAA,0BACAY,EAAAZ,EAAA,kBAEAf,EAAAD,QAAA,SAAA8B,EAAAD,GAEA,GADAA,EAAAQ,EAAAR,GAAAS,IACAoB,EAAA5B,GAAA,OAAAD,EAAA,IAAAV,MAAA,8DACA,IAAAW,EAAAP,OAAA,OAAAM,KAEA,SAAAmD,EAAApD,GACA,OAAAsB,GAAA,SAAAF,EAAAG,GACA,GAAAH,EACAnB,EAAAK,MAAA,KAAA,CAAAc,GAAAiC,OAAA9B,QACA,CACA,IAAAf,EAAAR,EAAAQ,OACAA,EACAe,EAAAG,KAAA0B,EAAA5C,IAEAe,EAAAG,KAAAzB,GAEAkD,EAAAnD,GAAAM,MAAA,KAAAiB,EACA,CACA,GACA,CACA6B,CAAApD,EAAAE,GAAAkD,EACA,ChB0OA,EAAE,CAAC,iBAAiB,EAAE,yBAAyB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,kBAAkB,GAAG,uBAAuB,KAAK,GAAG,CAAC,SAAShE,EAAQf,EAAOD,GiBtQzKA,EAAAkF,WAuCA,SAAAC,GACA,IAAAC,EAAAC,EAAAF,GACAG,EAAAF,EAAA,GACAG,EAAAH,EAAA,GACA,OAAA,GAAAE,EAAAC,GAAA,EAAAA,CACA,EA3CAvF,EAAAwF,YAiDA,SAAAL,GACA,IAAAM,EAcA3E,EAbAsE,EAAAC,EAAAF,GACAG,EAAAF,EAAA,GACAG,EAAAH,EAAA,GAEA1D,EAAA,IAAAgE,EAVA,SAAAP,EAAAG,EAAAC,GACA,OAAA,GAAAD,EAAAC,GAAA,EAAAA,CACA,CAQAI,CAAAR,EAAAG,EAAAC,IAEAK,EAAA,EAGA3B,EAAAsB,EAAA,EACAD,EAAA,EACAA,EAGA,IAAAxE,EAAA,EAAAA,EAAAmD,EAAAnD,GAAA,EACA2E,EACAI,EAAAV,EAAAW,WAAAhF,KAAA,GACA+E,EAAAV,EAAAW,WAAAhF,EAAA,KAAA,GACA+E,EAAAV,EAAAW,WAAAhF,EAAA,KAAA,EACA+E,EAAAV,EAAAW,WAAAhF,EAAA,IACAY,EAAAkE,KAAAH,GAAA,GAAA,IACA/D,EAAAkE,KAAAH,GAAA,EAAA,IACA/D,EAAAkE,KAAA,IAAAH,EAGA,IAAAF,IACAE,EACAI,EAAAV,EAAAW,WAAAhF,KAAA,EACA+E,EAAAV,EAAAW,WAAAhF,EAAA,KAAA,EACAY,EAAAkE,KAAA,IAAAH,GAGA,IAAAF,IACAE,EACAI,EAAAV,EAAAW,WAAAhF,KAAA,GACA+E,EAAAV,EAAAW,WAAAhF,EAAA,KAAA,EACA+E,EAAAV,EAAAW,WAAAhF,EAAA,KAAA,EACAY,EAAAkE,KAAAH,GAAA,EAAA,IACA/D,EAAAkE,KAAA,IAAAH,GAGA,OAAA/D,CACA,EA5FA1B,EAAA+F,cAkHA,SAAAC,GAQA,IAPA,IAAAP,EACAxB,EAAA+B,EAAAzE,OACA0E,EAAAhC,EAAA,EACAiC,EAAA,GACAC,EAAA,MAGArF,EAAA,EAAAsF,EAAAnC,EAAAgC,EAAAnF,EAAAsF,EAAAtF,GAAAqF,EACAD,EAAA5C,KAAA+C,EAAAL,EAAAlF,EAAAA,EAAAqF,EAAAC,EAAAA,EAAAtF,EAAAqF,IAIA,IAAAF,GACAR,EAAAO,EAAA/B,EAAA,GACAiC,EAAA5C,KACAgD,EAAAb,GAAA,GACAa,EAAAb,GAAA,EAAA,IACA,OAEA,IAAAQ,IACAR,GAAAO,EAAA/B,EAAA,IAAA,GAAA+B,EAAA/B,EAAA,GACAiC,EAAA5C,KACAgD,EAAAb,GAAA,IACAa,EAAAb,GAAA,EAAA,IACAa,EAAAb,GAAA,EAAA,IACA,MAIA,OAAAS,EAAAK,KAAA,GACA,EA1IA,IALA,IAAAD,EAAA,GACAT,EAAA,GACAH,EAAA,oBAAAc,WAAAA,WAAA/C,MAEArC,EAAA,mEACAN,EAAA,EAAAmD,EAAA7C,EAAAG,OAAAT,EAAAmD,IAAAnD,EACAwF,EAAAxF,GAAAM,EAAAN,GACA+E,EAAAzE,EAAA0E,WAAAhF,IAAAA,EAQA,SAAAuE,EAAAF,GACA,IAAAlB,EAAAkB,EAAA5D,OAEA,GAAA0C,EAAA,EAAA,EACA,MAAA,IAAA9C,MAAA,kDAKA,IAAAmE,EAAAH,EAAAsB,QAAA,KAOA,OANA,IAAAnB,IAAAA,EAAArB,GAMA,CAAAqB,EAJAA,IAAArB,EACA,EACA,EAAAqB,EAAA,EAGA,CAmEA,SAAAe,EAAAL,EAAAU,EAAAC,GAGA,IAFA,IAAAlB,EARAmB,EASAC,EAAA,GACA/F,EAAA4F,EAAA5F,EAAA6F,EAAA7F,GAAA,EACA2E,GACAO,EAAAlF,IAAA,GAAA,WACAkF,EAAAlF,EAAA,IAAA,EAAA,QACA,IAAAkF,EAAAlF,EAAA,IACA+F,EAAAvD,KAdAgD,GADAM,EAeAnB,IAdA,GAAA,IACAa,EAAAM,GAAA,GAAA,IACAN,EAAAM,GAAA,EAAA,IACAN,EAAA,GAAAM,IAaA,OAAAC,EAAAN,KAAA,GACA,CAlGAV,EAAA,IAAAC,WAAA,IAAA,GACAD,EAAA,IAAAC,WAAA,IAAA,EjB6YA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS9E,EAAQf,EAAOD,GAElC,EAAE,CAAC,GAAG,GAAG,CAAC,SAASgB,EAAQf,EAAOD,GAClCmC,UAAU,GAAG,IAAI,GAAGD,MAAMlC,EAAQmC,UAClC,EAAE,CAAC2E,IAAM,KAAK,GAAG,CAAC,SAAS9F,EAAQf,EAAOD,IAC1C,SAAW+G,IAAQ,WkB3ZnB,IAAAC,EAAAhG,EAAA,aACAiG,EAAAjG,EAAA,WAEAhB,EAAA+G,OAAAA,EACA/G,EAAAkH,WAqTA,SAAA3F,IACAA,GAAAA,IACAA,EAAA,GAEA,OAAAwF,EAAAI,OAAA5F,EACA,EAzTAvB,EAAAoH,kBAAA,GAEA,IAAAC,EAAA,WAsDA,SAAAC,EAAA/F,GACA,GAAAA,EAAA8F,EACA,MAAA,IAAAE,WAAA,cAAAhG,EAAA,kCAGA,IAAAiG,EAAA,IAAAhB,WAAAjF,GAEA,OADAiG,EAAAC,UAAAV,EAAAnD,UACA4D,CACA,CAYA,SAAAT,EAAAW,EAAAC,EAAApG,GAEA,GAAA,iBAAAmG,EAAA,CACA,GAAA,iBAAAC,EACA,MAAA,IAAAC,UACA,sEAGA,OAAAC,EAAAH,EACA,CACA,OAAAI,EAAAJ,EAAAC,EAAApG,EACA,CAeA,SAAAuG,EAAAhD,EAAA6C,EAAApG,GACA,GAAA,iBAAAuD,EACA,OAiHA,SAAAiD,EAAAC,GACA,iBAAAA,GAAA,KAAAA,IACAA,EAAA,QAGA,IAAAjB,EAAAkB,WAAAD,GACA,MAAA,IAAAJ,UAAA,qBAAAI,GAGA,IAAAzG,EAAA,EAAA2D,EAAA6C,EAAAC,GACAR,EAAAF,EAAA/F,GAEA2G,EAAAV,EAAAW,MAAAJ,EAAAC,GAEAE,IAAA3G,IAIAiG,EAAAA,EAAAY,MAAA,EAAAF,IAGA,OAAAV,CACA,CAvIAa,CAAAvD,EAAA6C,GAGA,GAAAW,YAAAC,OAAAzD,GACA,OAAA0D,EAAA1D,GAGA,GAAA,MAAAA,EACA,MAAA8C,UACA,yHACA9C,GAIA,GAAA2D,EAAA3D,EAAAwD,cACAxD,GAAA2D,EAAA3D,EAAA4D,OAAAJ,aACA,OAkIA,SAAAK,EAAAC,EAAArH,GACA,GAAAqH,EAAA,GAAAD,EAAAzD,WAAA0D,EACA,MAAA,IAAArB,WAAA,wCAGA,GAAAoB,EAAAzD,WAAA0D,GAAArH,GAAA,GACA,MAAA,IAAAgG,WAAA,wCAGA,IAAAC,EAEAA,OADAqB,IAAAD,QAAAC,IAAAtH,EACA,IAAAiF,WAAAmC,QACAE,IAAAtH,EACA,IAAAiF,WAAAmC,EAAAC,GAEA,IAAApC,WAAAmC,EAAAC,EAAArH,GAKA,OADAiG,EAAAC,UAAAV,EAAAnD,UACA4D,CACA,CAvJAsB,CAAAhE,EAAA6C,EAAApG,GAGA,GAAA,iBAAAuD,EACA,MAAA,IAAA8C,UACA,yEAIA,IAAAmB,EAAAjE,EAAAiE,SAAAjE,EAAAiE,UACA,GAAA,MAAAA,GAAAA,IAAAjE,EACA,OAAAiC,EAAAe,KAAAiB,EAAApB,EAAApG,GAGA,IAAAyH,EA2IA,SAAAvG,GACA,GAAAsE,EAAAkC,SAAAxG,GAAA,CACA,IAAAwB,EAAA,EAAAiF,EAAAzG,EAAAlB,QACAiG,EAAAF,EAAArD,GAEA,OAAA,IAAAuD,EAAAjG,QAIAkB,EAAA0G,KAAA3B,EAAA,EAAA,EAAAvD,GAHAuD,CAKA,CAEA,QAAAqB,IAAApG,EAAAlB,OACA,MAAA,iBAAAkB,EAAAlB,QAAA6H,EAAA3G,EAAAlB,QACA+F,EAAA,GAEAkB,EAAA/F,GAGA,GAAA,WAAAA,EAAA4G,MAAA5F,MAAAC,QAAAjB,EAAA6G,MACA,OAAAd,EAAA/F,EAAA6G,KAEA,CAlKAC,CAAAzE,GACA,GAAAkE,EAAA,OAAAA,EAEA,GAAA,oBAAAQ,QAAA,MAAAA,OAAAC,aACA,mBAAA3E,EAAA0E,OAAAC,aACA,OAAA1C,EAAAe,KACAhD,EAAA0E,OAAAC,aAAA,UAAA9B,EAAApG,GAIA,MAAA,IAAAqG,UACA,yHACA9C,EAEA,CAmBA,SAAA4E,EAAAC,GACA,GAAA,iBAAAA,EACA,MAAA,IAAA/B,UAAA,0CACA,GAAA+B,EAAA,EACA,MAAA,IAAApC,WAAA,cAAAoC,EAAA,iCAEA,CA0BA,SAAA9B,EAAA8B,GAEA,OADAD,EAAAC,GACArC,EAAAqC,EAAA,EAAA,EAAA,EAAAT,EAAAS,GACA,CAuCA,SAAAnB,EAAAG,GAGA,IAFA,IAAApH,EAAAoH,EAAApH,OAAA,EAAA,EAAA,EAAA2H,EAAAP,EAAApH,QACAiG,EAAAF,EAAA/F,GACAT,EAAA,EAAAA,EAAAS,EAAAT,GAAA,EACA0G,EAAA1G,GAAA,IAAA6H,EAAA7H,GAEA,OAAA0G,CACA,CAkDA,SAAA0B,EAAA3H,GAGA,GAAAA,GAAA8F,EACA,MAAA,IAAAE,WAAA,0DACAF,EAAAxD,SAAA,IAAA,UAEA,OAAA,EAAAtC,CACA,CA6FA,SAAA2D,EAAA6C,EAAAC,GACA,GAAAjB,EAAAkC,SAAAlB,GACA,OAAAA,EAAAxG,OAEA,GAAA+G,YAAAC,OAAAR,IAAAU,EAAAV,EAAAO,aACA,OAAAP,EAAA7C,WAEA,GAAA,iBAAA6C,EACA,MAAA,IAAAH,UACA,kGACAG,GAIA,IAAA9D,EAAA8D,EAAAxG,OACAqI,EAAAzH,UAAAZ,OAAA,IAAA,IAAAY,UAAA,GACA,IAAAyH,GAAA,IAAA3F,EAAA,OAAA,EAIA,IADA,IAAA4F,GAAA,IAEA,OAAA7B,GACA,IAAA,QACA,IAAA,SACA,IAAA,SACA,OAAA/D,EACA,IAAA,OACA,IAAA,QACA,OAAA6F,EAAA/B,GAAAxG,OACA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAA,EAAA0C,EACA,IAAA,MACA,OAAAA,IAAA,EACA,IAAA,SACA,OAAA8F,EAAAhC,GAAAxG,OACA,QACA,GAAAsI,EACA,OAAAD,GAAA,EAAAE,EAAA/B,GAAAxG,OAEAyG,GAAA,GAAAA,GAAAgC,cACAH,GAAA,EAGA,CAGA,SAAAI,EAAAjC,EAAAtB,EAAAC,GACA,IAAAkD,GAAA,EAcA,SALAhB,IAAAnC,GAAAA,EAAA,KACAA,EAAA,GAIAA,EAAAnG,KAAAgB,OACA,MAAA,GAOA,SAJAsH,IAAAlC,GAAAA,EAAApG,KAAAgB,UACAoF,EAAApG,KAAAgB,QAGAoF,GAAA,EACA,MAAA,GAOA,IAHAA,KAAA,KACAD,KAAA,GAGA,MAAA,GAKA,IAFAsB,IAAAA,EAAA,UAGA,OAAAA,GACA,IAAA,MACA,OAAAkC,EAAA3J,KAAAmG,EAAAC,GAEA,IAAA,OACA,IAAA,QACA,OAAAwD,EAAA5J,KAAAmG,EAAAC,GAEA,IAAA,QACA,OAAAyD,EAAA7J,KAAAmG,EAAAC,GAEA,IAAA,SACA,IAAA,SACA,OAAA0D,EAAA9J,KAAAmG,EAAAC,GAEA,IAAA,SACA,OAAA2D,EAAA/J,KAAAmG,EAAAC,GAEA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAA4D,EAAAhK,KAAAmG,EAAAC,GAEA,QACA,GAAAkD,EAAA,MAAA,IAAAjC,UAAA,qBAAAI,GACAA,GAAAA,EAAA,IAAAgC,cACAH,GAAA,EAGA,CAUA,SAAAW,EAAAxB,EAAArI,EAAA8J,GACA,IAAA3J,EAAAkI,EAAArI,GACAqI,EAAArI,GAAAqI,EAAAyB,GACAzB,EAAAyB,GAAA3J,CACA,CAwIA,SAAA4J,EAAAhC,EAAAiC,EAAA/B,EAAAZ,EAAA4C,GAEA,GAAA,IAAAlC,EAAAnH,OAAA,OAAA,EAmBA,GAhBA,iBAAAqH,GACAZ,EAAAY,EACAA,EAAA,GACAA,EAAA,WACAA,EAAA,WACAA,GAAA,aACAA,GAAA,YAGAQ,EADAR,GAAAA,KAGAA,EAAAgC,EAAA,EAAAlC,EAAAnH,OAAA,GAIAqH,EAAA,IAAAA,EAAAF,EAAAnH,OAAAqH,GACAA,GAAAF,EAAAnH,OAAA,CACA,GAAAqJ,EAAA,OAAA,EACAhC,EAAAF,EAAAnH,OAAA,CACA,MAAA,GAAAqH,EAAA,EAAA,CACA,IAAAgC,EACA,OAAA,EADAhC,EAAA,CAEA,CAQA,GALA,iBAAA+B,IACAA,EAAA5D,EAAAe,KAAA6C,EAAA3C,IAIAjB,EAAAkC,SAAA0B,GAEA,OAAA,IAAAA,EAAApJ,QACA,EAEAsJ,EAAAnC,EAAAiC,EAAA/B,EAAAZ,EAAA4C,GACA,GAAA,iBAAAD,EAEA,OADAA,GAAA,IACA,mBAAAnE,WAAA5C,UAAA6C,QACAmE,EACApE,WAAA5C,UAAA6C,QAAAnF,KAAAoH,EAAAiC,EAAA/B,GAEApC,WAAA5C,UAAAkH,YAAAxJ,KAAAoH,EAAAiC,EAAA/B,GAGAiC,EAAAnC,EAAA,CAAAiC,GAAA/B,EAAAZ,EAAA4C,GAGA,MAAA,IAAAhD,UAAA,uCACA,CAEA,SAAAiD,EAAAnJ,EAAAiJ,EAAA/B,EAAAZ,EAAA4C,GACA,IA0BA9J,EA1BAiK,EAAA,EACAC,EAAAtJ,EAAAH,OACA0J,EAAAN,EAAApJ,OAEA,QAAAsH,IAAAb,IAEA,UADAA,EAAAkD,OAAAlD,GAAAgC,gBACA,UAAAhC,GACA,YAAAA,GAAA,aAAAA,GAAA,CACA,GAAAtG,EAAAH,OAAA,GAAAoJ,EAAApJ,OAAA,EACA,OAAA,EAEAwJ,EAAA,EACAC,GAAA,EACAC,GAAA,EACArC,GAAA,CACA,CAGA,SAAAuC,EAAA3D,EAAA1G,GACA,OAAA,IAAAiK,EACAvD,EAAA1G,GAEA0G,EAAA4D,aAAAtK,EAAAiK,EAEA,CAGA,GAAAH,EAAA,CACA,IAAAS,GAAA,EACA,IAAAvK,EAAA8H,EAAA9H,EAAAkK,EAAAlK,IACA,GAAAqK,EAAAzJ,EAAAZ,KAAAqK,EAAAR,GAAA,IAAAU,EAAA,EAAAvK,EAAAuK,IAEA,IADA,IAAAA,IAAAA,EAAAvK,GACAA,EAAAuK,EAAA,IAAAJ,EAAA,OAAAI,EAAAN,OAEA,IAAAM,IAAAvK,GAAAA,EAAAuK,GACAA,GAAA,CAGA,MAEA,IADAzC,EAAAqC,EAAAD,IAAApC,EAAAoC,EAAAC,GACAnK,EAAA8H,EAAA9H,GAAA,EAAAA,IAAA,CAEA,IADA,IAAAwK,GAAA,EACAC,EAAA,EAAAA,EAAAN,EAAAM,IACA,GAAAJ,EAAAzJ,EAAAZ,EAAAyK,KAAAJ,EAAAR,EAAAY,GAAA,CACAD,GAAA,EACA,KACA,CAEA,GAAAA,EAAA,OAAAxK,CACA,CAGA,OAAA,CACA,CAcA,SAAA0K,EAAAhE,EAAAO,EAAA0D,EAAAlK,GACAkK,EAAAC,OAAAD,IAAA,EACA,IAAAE,EAAAnE,EAAAjG,OAAAkK,EACAlK,GAGAA,EAAAmK,OAAAnK,IACAoK,IACApK,EAAAoK,GAJApK,EAAAoK,EAQA,IAAAC,EAAA7D,EAAAxG,OAEAA,EAAAqK,EAAA,IACArK,EAAAqK,EAAA,GAEA,IAAA,IAAA9K,EAAA,EAAAA,EAAAS,IAAAT,EAAA,CACA,IAAA+K,EAAAC,SAAA/D,EAAAgE,OAAA,EAAAjL,EAAA,GAAA,IACA,GAAAsI,EAAAyC,GAAA,OAAA/K,EACA0G,EAAAiE,EAAA3K,GAAA+K,CACA,CACA,OAAA/K,CACA,CAEA,SAAAkL,EAAAxE,EAAAO,EAAA0D,EAAAlK,GACA,OAAA0K,EAAAnC,EAAA/B,EAAAP,EAAAjG,OAAAkK,GAAAjE,EAAAiE,EAAAlK,EACA,CAEA,SAAA2K,EAAA1E,EAAAO,EAAA0D,EAAAlK,GACA,OAAA0K,EA63BA,SAAAE,GAEA,IADA,IAAAC,EAAA,GACAtL,EAAA,EAAAA,EAAAqL,EAAA5K,SAAAT,EAEAsL,EAAA9I,KAAA,IAAA6I,EAAArG,WAAAhF,IAEA,OAAAsL,CACA,CAp4BAC,CAAAtE,GAAAP,EAAAiE,EAAAlK,EACA,CAEA,SAAA+K,EAAA9E,EAAAO,EAAA0D,EAAAlK,GACA,OAAA2K,EAAA1E,EAAAO,EAAA0D,EAAAlK,EACA,CAEA,SAAAgL,EAAA/E,EAAAO,EAAA0D,EAAAlK,GACA,OAAA0K,EAAAlC,EAAAhC,GAAAP,EAAAiE,EAAAlK,EACA,CAEA,SAAAiL,EAAAhF,EAAAO,EAAA0D,EAAAlK,GACA,OAAA0K,EA03BA,SAAAE,EAAAM,GAGA,IAFA,IAAA1L,EAAA2L,EAAAC,EACAP,EAAA,GACAtL,EAAA,EAAAA,EAAAqL,EAAA5K,WACAkL,GAAA,GAAA,KADA3L,EAIA4L,GADA3L,EAAAoL,EAAArG,WAAAhF,KACA,EACA6L,EAAA5L,EAAA,IACAqL,EAAA9I,KAAAqJ,GACAP,EAAA9I,KAAAoJ,GAGA,OAAAN,CACA,CAx4BAQ,CAAA7E,EAAAP,EAAAjG,OAAAkK,GAAAjE,EAAAiE,EAAAlK,EACA,CAgFA,SAAA+I,EAAA9C,EAAAd,EAAAC,GACA,OAAA,IAAAD,GAAAC,IAAAa,EAAAjG,OACAyF,EAAAjB,cAAAyB,GAEAR,EAAAjB,cAAAyB,EAAAY,MAAA1B,EAAAC,GAEA,CAEA,SAAAwD,EAAA3C,EAAAd,EAAAC,GACAA,EAAApC,KAAAsI,IAAArF,EAAAjG,OAAAoF,GAIA,IAHA,IAAAmG,EAAA,GAEAhM,EAAA4F,EACA5F,EAAA6F,GAAA,CACA,IAQAoG,EAAAC,EAAAC,EAAAC,EARAC,EAAA3F,EAAA1G,GACAsM,EAAA,KACAC,EAAAF,EAAA,IAAA,EACAA,EAAA,IAAA,EACAA,EAAA,IAAA,EACA,EAEA,GAAArM,EAAAuM,GAAA1G,EAGA,OAAA0G,GACA,KAAA,EACAF,EAAA,MACAC,EAAAD,GAEA,MACA,KAAA,EAEA,MAAA,KADAJ,EAAAvF,EAAA1G,EAAA,OAEAoM,GAAA,GAAAC,IAAA,EAAA,GAAAJ,GACA,MACAK,EAAAF,GAGA,MACA,KAAA,EACAH,EAAAvF,EAAA1G,EAAA,GACAkM,EAAAxF,EAAA1G,EAAA,GACA,MAAA,IAAAiM,IAAA,MAAA,IAAAC,KACAE,GAAA,GAAAC,IAAA,IAAA,GAAAJ,IAAA,EAAA,GAAAC,GACA,OAAAE,EAAA,OAAAA,EAAA,SACAE,EAAAF,GAGA,MACA,KAAA,EACAH,EAAAvF,EAAA1G,EAAA,GACAkM,EAAAxF,EAAA1G,EAAA,GACAmM,EAAAzF,EAAA1G,EAAA,GACA,MAAA,IAAAiM,IAAA,MAAA,IAAAC,IAAA,MAAA,IAAAC,KACAC,GAAA,GAAAC,IAAA,IAAA,GAAAJ,IAAA,IAAA,GAAAC,IAAA,EAAA,GAAAC,GACA,OAAAC,EAAA,UACAE,EAAAF,GAMA,OAAAE,GAGAA,EAAA,MACAC,EAAA,GACAD,EAAA,QAEAA,GAAA,MACAN,EAAAxJ,KAAA8J,IAAA,GAAA,KAAA,OACAA,EAAA,MAAA,KAAAA,GAGAN,EAAAxJ,KAAA8J,GACAtM,GAAAuM,CACA,CAEA,OAQA,SAAAC,GACA,IAAArJ,EAAAqJ,EAAA/L,OACA,GAAA0C,GAAAsJ,EACA,OAAArC,OAAAsC,aAAAtL,MAAAgJ,OAAAoC,GAIA,IAAAR,EAAA,GACAhM,EAAA,EACA,KAAAA,EAAAmD,GACA6I,GAAA5B,OAAAsC,aAAAtL,MACAgJ,OACAoC,EAAAlF,MAAAtH,EAAAA,GAAAyM,IAGA,OAAAT,CACA,CAxBAW,CAAAX,EACA,CA79BA9M,EAAA0N,WAAArG,EAgBAN,EAAA4G,oBAUA,WAEA,IACA,IAAAjM,EAAA,IAAA8E,WAAA,GAEA,OADA9E,EAAA+F,UAAA,CAAAA,UAAAjB,WAAA5C,UAAAgK,IAAA,WAAA,OAAA,EAAA,GACA,KAAAlM,EAAAkM,KACA,CAAA,MAAAlN,GACA,OAAA,CACA,CACA,CAnBAmN,GAEA9G,EAAA4G,qBAAA,oBAAAG,SACA,mBAAAA,QAAAC,OACAD,QAAAC,MACA,iJAgBApK,OAAAqK,eAAAjH,EAAAnD,UAAA,SAAA,CACAqK,YAAA,EACAC,IAAA,WACA,GAAAnH,EAAAkC,SAAA1I,MACA,OAAAA,KAAAmI,MACA,IAGA/E,OAAAqK,eAAAjH,EAAAnD,UAAA,SAAA,CACAqK,YAAA,EACAC,IAAA,WACA,GAAAnH,EAAAkC,SAAA1I,MACA,OAAAA,KAAAqI,UACA,IAqCA,oBAAAY,QAAA,MAAAA,OAAA2E,SACApH,EAAAyC,OAAA2E,WAAApH,GACApD,OAAAqK,eAAAjH,EAAAyC,OAAA2E,QAAA,CACArJ,MAAA,KACAsJ,cAAA,EACAH,YAAA,EACAI,UAAA,IAIAtH,EAAAuH,SAAA,KA0DAvH,EAAAe,KAAA,SAAAhD,EAAA6C,EAAApG,GACA,OAAAuG,EAAAhD,EAAA6C,EAAApG,EACA,EAIAwF,EAAAnD,UAAA6D,UAAAjB,WAAA5C,UACAmD,EAAAU,UAAAjB,WA8BAO,EAAAI,MAAA,SAAAwC,EAAA4E,EAAAvG,GACA,OArBA,SAAA2B,EAAA4E,EAAAvG,GAEA,OADA0B,EAAAC,GACAA,GAAA,EACArC,EAAAqC,QAEAd,IAAA0F,EAIA,iBAAAvG,EACAV,EAAAqC,GAAA4E,KAAAA,EAAAvG,GACAV,EAAAqC,GAAA4E,KAAAA,GAEAjH,EAAAqC,EACA,CAOAxC,CAAAwC,EAAA4E,EAAAvG,EACA,EAUAjB,EAAAc,YAAA,SAAA8B,GACA,OAAA9B,EAAA8B,EACA,EAIA5C,EAAAyH,gBAAA,SAAA7E,GACA,OAAA9B,EAAA8B,EACA,EAoGA5C,EAAAkC,SAAA,SAAAD,GACA,OAAA,MAAAA,IAAA,IAAAA,EAAAyF,WACAzF,IAAAjC,EAAAnD,SACA,EAEAmD,EAAA2H,QAAA,SAAAxN,EAAA8H,GAGA,GAFAP,EAAAvH,EAAAsF,cAAAtF,EAAA6F,EAAAe,KAAA5G,EAAAA,EAAAuK,OAAAvK,EAAAgE,aACAuD,EAAAO,EAAAxC,cAAAwC,EAAAjC,EAAAe,KAAAkB,EAAAA,EAAAyC,OAAAzC,EAAA9D,cACA6B,EAAAkC,SAAA/H,KAAA6F,EAAAkC,SAAAD,GACA,MAAA,IAAApB,UACA,yEAIA,GAAA1G,IAAA8H,EAAA,OAAA,EAKA,IAHA,IAAA2F,EAAAzN,EAAAK,OACAqN,EAAA5F,EAAAzH,OAEAT,EAAA,EAAAmD,EAAAM,KAAAsI,IAAA8B,EAAAC,GAAA9N,EAAAmD,IAAAnD,EACA,GAAAI,EAAAJ,KAAAkI,EAAAlI,GAAA,CACA6N,EAAAzN,EAAAJ,GACA8N,EAAA5F,EAAAlI,GACA,KACA,CAGA,OAAA6N,EAAAC,GAAA,EACAA,EAAAD,EAAA,EACA,CACA,EAEA5H,EAAAkB,WAAA,SAAAD,GACA,OAAAkD,OAAAlD,GAAAgC,eACA,IAAA,MACA,IAAA,OACA,IAAA,QACA,IAAA,QACA,IAAA,SACA,IAAA,SACA,IAAA,SACA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAA,EACA,QACA,OAAA,EAEA,EAEAjD,EAAA9B,OAAA,SAAA4J,EAAAtN,GACA,IAAAkC,MAAAC,QAAAmL,GACA,MAAA,IAAAjH,UAAA,+CAGA,GAAA,IAAAiH,EAAAtN,OACA,OAAAwF,EAAAI,MAAA,GAGA,IAAArG,EACA,QAAA+H,IAAAtH,EAEA,IADAA,EAAA,EACAT,EAAA,EAAAA,EAAA+N,EAAAtN,SAAAT,EACAS,GAAAsN,EAAA/N,GAAAS,OAIA,IAAAmH,EAAA3B,EAAAc,YAAAtG,GACAuN,EAAA,EACA,IAAAhO,EAAA,EAAAA,EAAA+N,EAAAtN,SAAAT,EAAA,CACA,IAAA0G,EAAAqH,EAAA/N,GAIA,GAHA2H,EAAAjB,EAAAhB,cACAgB,EAAAT,EAAAe,KAAAN,KAEAT,EAAAkC,SAAAzB,GACA,MAAA,IAAAI,UAAA,+CAEAJ,EAAA2B,KAAAT,EAAAoG,GACAA,GAAAtH,EAAAjG,MACA,CACA,OAAAmH,CACA,EAiDA3B,EAAA7B,WAAAA,EA8EA6B,EAAAnD,UAAA6K,WAAA,EAQA1H,EAAAnD,UAAAmL,OAAA,WACA,IAAA9K,EAAA1D,KAAAgB,OACA,GAAA0C,EAAA,GAAA,EACA,MAAA,IAAAsD,WAAA,6CAEA,IAAA,IAAAzG,EAAA,EAAAA,EAAAmD,EAAAnD,GAAA,EACA0J,EAAAjK,KAAAO,EAAAA,EAAA,GAEA,OAAAP,IACA,EAEAwG,EAAAnD,UAAAoL,OAAA,WACA,IAAA/K,EAAA1D,KAAAgB,OACA,GAAA0C,EAAA,GAAA,EACA,MAAA,IAAAsD,WAAA,6CAEA,IAAA,IAAAzG,EAAA,EAAAA,EAAAmD,EAAAnD,GAAA,EACA0J,EAAAjK,KAAAO,EAAAA,EAAA,GACA0J,EAAAjK,KAAAO,EAAA,EAAAA,EAAA,GAEA,OAAAP,IACA,EAEAwG,EAAAnD,UAAAqL,OAAA,WACA,IAAAhL,EAAA1D,KAAAgB,OACA,GAAA0C,EAAA,GAAA,EACA,MAAA,IAAAsD,WAAA,6CAEA,IAAA,IAAAzG,EAAA,EAAAA,EAAAmD,EAAAnD,GAAA,EACA0J,EAAAjK,KAAAO,EAAAA,EAAA,GACA0J,EAAAjK,KAAAO,EAAA,EAAAA,EAAA,GACA0J,EAAAjK,KAAAO,EAAA,EAAAA,EAAA,GACA0J,EAAAjK,KAAAO,EAAA,EAAAA,EAAA,GAEA,OAAAP,IACA,EAEAwG,EAAAnD,UAAAC,SAAA,WACA,IAAAtC,EAAAhB,KAAAgB,OACA,OAAA,IAAAA,EAAA,GACA,IAAAY,UAAAZ,OAAA4I,EAAA5J,KAAA,EAAAgB,GACA0I,EAAA/H,MAAA3B,KAAA4B,UACA,EAEA4E,EAAAnD,UAAAsL,eAAAnI,EAAAnD,UAAAC,SAEAkD,EAAAnD,UAAAuL,OAAA,SAAAnG,GACA,IAAAjC,EAAAkC,SAAAD,GAAA,MAAA,IAAApB,UAAA,6BACA,OAAArH,OAAAyI,GACA,IAAAjC,EAAA2H,QAAAnO,KAAAyI,EACA,EAEAjC,EAAAnD,UAAAwL,QAAA,WACA,IAAAjD,EAAA,GACA3H,EAAAxE,EAAAoH,kBAGA,OAFA+E,EAAA5L,KAAAsD,SAAA,MAAA,EAAAW,GAAA6K,QAAA,UAAA,OAAAC,OACA/O,KAAAgB,OAAAiD,IAAA2H,GAAA,SACA,WAAAA,EAAA,GACA,EAEApF,EAAAnD,UAAA8K,QAAA,SAAAa,EAAA7I,EAAAC,EAAA6I,EAAAC,GAIA,GAHAhH,EAAA8G,EAAA/I,cACA+I,EAAAxI,EAAAe,KAAAyH,EAAAA,EAAA9D,OAAA8D,EAAArK,cAEA6B,EAAAkC,SAAAsG,GACA,MAAA,IAAA3H,UACA,wFACA2H,GAiBA,QAbA1G,IAAAnC,IACAA,EAAA,QAEAmC,IAAAlC,IACAA,EAAA4I,EAAAA,EAAAhO,OAAA,QAEAsH,IAAA2G,IACAA,EAAA,QAEA3G,IAAA4G,IACAA,EAAAlP,KAAAgB,QAGAmF,EAAA,GAAAC,EAAA4I,EAAAhO,QAAAiO,EAAA,GAAAC,EAAAlP,KAAAgB,OACA,MAAA,IAAAgG,WAAA,sBAGA,GAAAiI,GAAAC,GAAA/I,GAAAC,EACA,OAAA,EAEA,GAAA6I,GAAAC,EACA,OAAA,EAEA,GAAA/I,GAAAC,EACA,OAAA,EAQA,GAAApG,OAAAgP,EAAA,OAAA,EASA,IAPA,IAAAZ,GAJAc,KAAA,IADAD,KAAA,GAMAZ,GAPAjI,KAAA,IADAD,KAAA,GASAzC,EAAAM,KAAAsI,IAAA8B,EAAAC,GAEAc,EAAAnP,KAAA6H,MAAAoH,EAAAC,GACAE,EAAAJ,EAAAnH,MAAA1B,EAAAC,GAEA7F,EAAA,EAAAA,EAAAmD,IAAAnD,EACA,GAAA4O,EAAA5O,KAAA6O,EAAA7O,GAAA,CACA6N,EAAAe,EAAA5O,GACA8N,EAAAe,EAAA7O,GACA,KACA,CAGA,OAAA6N,EAAAC,GAAA,EACAA,EAAAD,EAAA,EACA,CACA,EA2HA5H,EAAAnD,UAAAgM,SAAA,SAAAjF,EAAA/B,EAAAZ,GACA,OAAA,IAAAzH,KAAAkG,QAAAkE,EAAA/B,EAAAZ,EACA,EAEAjB,EAAAnD,UAAA6C,QAAA,SAAAkE,EAAA/B,EAAAZ,GACA,OAAA0C,EAAAnK,KAAAoK,EAAA/B,EAAAZ,GAAA,EACA,EAEAjB,EAAAnD,UAAAkH,YAAA,SAAAH,EAAA/B,EAAAZ,GACA,OAAA0C,EAAAnK,KAAAoK,EAAA/B,EAAAZ,GAAA,EACA,EA+CAjB,EAAAnD,UAAAuE,MAAA,SAAAJ,EAAA0D,EAAAlK,EAAAyG,GAEA,QAAAa,IAAA4C,EACAzD,EAAA,OACAzG,EAAAhB,KAAAgB,OACAkK,EAAA,OAEA,QAAA5C,IAAAtH,GAAA,iBAAAkK,EACAzD,EAAAyD,EACAlK,EAAAhB,KAAAgB,OACAkK,EAAA,MAEA,KAAAoE,SAAApE,GAUA,MAAA,IAAAtK,MACA,2EAVAsK,KAAA,EACAoE,SAAAtO,IACAA,KAAA,OACAsH,IAAAb,IAAAA,EAAA,UAEAA,EAAAzG,EACAA,OAAAsH,EAMA,CAEA,IAAA8C,EAAApL,KAAAgB,OAAAkK,EAGA,SAFA5C,IAAAtH,GAAAA,EAAAoK,KAAApK,EAAAoK,GAEA5D,EAAAxG,OAAA,IAAAA,EAAA,GAAAkK,EAAA,IAAAA,EAAAlL,KAAAgB,OACA,MAAA,IAAAgG,WAAA,0CAGAS,IAAAA,EAAA,QAGA,IADA,IAAA6B,GAAA,IAEA,OAAA7B,GACA,IAAA,MACA,OAAAwD,EAAAjL,KAAAwH,EAAA0D,EAAAlK,GAEA,IAAA,OACA,IAAA,QACA,OAAAyK,EAAAzL,KAAAwH,EAAA0D,EAAAlK,GAEA,IAAA,QACA,OAAA2K,EAAA3L,KAAAwH,EAAA0D,EAAAlK,GAEA,IAAA,SACA,IAAA,SACA,OAAA+K,EAAA/L,KAAAwH,EAAA0D,EAAAlK,GAEA,IAAA,SAEA,OAAAgL,EAAAhM,KAAAwH,EAAA0D,EAAAlK,GAEA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAAiL,EAAAjM,KAAAwH,EAAA0D,EAAAlK,GAEA,QACA,GAAAsI,EAAA,MAAA,IAAAjC,UAAA,qBAAAI,GACAA,GAAA,GAAAA,GAAAgC,cACAH,GAAA,EAGA,EAEA9C,EAAAnD,UAAAkM,OAAA,WACA,MAAA,CACAzG,KAAA,SACAC,KAAA7F,MAAAG,UAAAwE,MAAA9G,KAAAf,KAAAwP,MAAAxP,KAAA,GAEA,EAsFA,IAAAgN,EAAA,KAoBA,SAAAnD,EAAA5C,EAAAd,EAAAC,GACA,IAAAqJ,EAAA,GACArJ,EAAApC,KAAAsI,IAAArF,EAAAjG,OAAAoF,GAEA,IAAA,IAAA7F,EAAA4F,EAAA5F,EAAA6F,IAAA7F,EACAkP,GAAA9E,OAAAsC,aAAA,IAAAhG,EAAA1G,IAEA,OAAAkP,CACA,CAEA,SAAA3F,EAAA7C,EAAAd,EAAAC,GACA,IAAAqJ,EAAA,GACArJ,EAAApC,KAAAsI,IAAArF,EAAAjG,OAAAoF,GAEA,IAAA,IAAA7F,EAAA4F,EAAA5F,EAAA6F,IAAA7F,EACAkP,GAAA9E,OAAAsC,aAAAhG,EAAA1G,IAEA,OAAAkP,CACA,CAEA,SAAA9F,EAAA1C,EAAAd,EAAAC,GACA,IAAA1C,EAAAuD,EAAAjG,SAEAmF,GAAAA,EAAA,KAAAA,EAAA,KACAC,GAAAA,EAAA,GAAAA,EAAA1C,KAAA0C,EAAA1C,GAGA,IADA,IAAAgM,EAAA,GACAnP,EAAA4F,EAAA5F,EAAA6F,IAAA7F,EACAmP,GAAAC,EAAA1I,EAAA1G,IAEA,OAAAmP,CACA,CAEA,SAAA1F,EAAA/C,EAAAd,EAAAC,GAGA,IAFA,IAAAwJ,EAAA3I,EAAAY,MAAA1B,EAAAC,GACAmG,EAAA,GACAhM,EAAA,EAAAA,EAAAqP,EAAA5O,OAAAT,GAAA,EACAgM,GAAA5B,OAAAsC,aAAA2C,EAAArP,GAAA,IAAAqP,EAAArP,EAAA,IAEA,OAAAgM,CACA,CAgCA,SAAAsD,EAAA3E,EAAA4E,EAAA9O,GACA,GAAAkK,EAAA,GAAA,GAAAA,EAAA,EAAA,MAAA,IAAAlE,WAAA,sBACA,GAAAkE,EAAA4E,EAAA9O,EAAA,MAAA,IAAAgG,WAAA,wCACA,CA4KA,SAAA+I,EAAA9I,EAAA1C,EAAA2G,EAAA4E,EAAA7L,EAAAqI,GACA,IAAA9F,EAAAkC,SAAAzB,GAAA,MAAA,IAAAI,UAAA,+CACA,GAAA9C,EAAAN,GAAAM,EAAA+H,EAAA,MAAA,IAAAtF,WAAA,qCACA,GAAAkE,EAAA4E,EAAA7I,EAAAjG,OAAA,MAAA,IAAAgG,WAAA,qBACA,CAwLA,SAAAgJ,EAAA/I,EAAA1C,EAAA2G,EAAA4E,EAAA7L,EAAAqI,GACA,GAAApB,EAAA4E,EAAA7I,EAAAjG,OAAA,MAAA,IAAAgG,WAAA,sBACA,GAAAkE,EAAA,EAAA,MAAA,IAAAlE,WAAA,qBACA,CAEA,SAAAiJ,EAAAhJ,EAAA1C,EAAA2G,EAAAgF,EAAAC,GAOA,OANA5L,GAAAA,EACA2G,KAAA,EACAiF,GACAH,EAAA/I,EAAA1C,EAAA2G,EAAA,GAEAxE,EAAAkB,MAAAX,EAAA1C,EAAA2G,EAAAgF,EAAA,GAAA,GACAhF,EAAA,CACA,CAUA,SAAAkF,EAAAnJ,EAAA1C,EAAA2G,EAAAgF,EAAAC,GAOA,OANA5L,GAAAA,EACA2G,KAAA,EACAiF,GACAH,EAAA/I,EAAA1C,EAAA2G,EAAA,GAEAxE,EAAAkB,MAAAX,EAAA1C,EAAA2G,EAAAgF,EAAA,GAAA,GACAhF,EAAA,CACA,CAxaA1E,EAAAnD,UAAAwE,MAAA,SAAA1B,EAAAC,GACA,IAAA1C,EAAA1D,KAAAgB,QACAmF,IAAAA,GAGA,GACAA,GAAAzC,GACA,IAAAyC,EAAA,GACAA,EAAAzC,IACAyC,EAAAzC,IANA0C,OAAAkC,IAAAlC,EAAA1C,IAAA0C,GASA,GACAA,GAAA1C,GACA,IAAA0C,EAAA,GACAA,EAAA1C,IACA0C,EAAA1C,GAGA0C,EAAAD,IAAAC,EAAAD,GAEA,IAAAkK,EAAArQ,KAAAsQ,SAAAnK,EAAAC,GAGA,OADAiK,EAAAnJ,UAAAV,EAAAnD,UACAgN,CACA,EAUA7J,EAAAnD,UAAAkN,WAAA,SAAArF,EAAAvG,EAAAwL,GACAjF,KAAA,EACAvG,KAAA,EACAwL,GAAAN,EAAA3E,EAAAvG,EAAA3E,KAAAgB,QAKA,IAHA,IAAAoJ,EAAApK,KAAAkL,GACAsF,EAAA,EACAjQ,EAAA,IACAA,EAAAoE,IAAA6L,GAAA,MACApG,GAAApK,KAAAkL,EAAA3K,GAAAiQ,EAGA,OAAApG,CACA,EAEA5D,EAAAnD,UAAAoN,WAAA,SAAAvF,EAAAvG,EAAAwL,GACAjF,KAAA,EACAvG,KAAA,EACAwL,GACAN,EAAA3E,EAAAvG,EAAA3E,KAAAgB,QAKA,IAFA,IAAAoJ,EAAApK,KAAAkL,IAAAvG,GACA6L,EAAA,EACA7L,EAAA,IAAA6L,GAAA,MACApG,GAAApK,KAAAkL,IAAAvG,GAAA6L,EAGA,OAAApG,CACA,EAEA5D,EAAAnD,UAAAqN,UAAA,SAAAxF,EAAAiF,GAGA,OAFAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QACAhB,KAAAkL,EACA,EAEA1E,EAAAnD,UAAAsN,aAAA,SAAAzF,EAAAiF,GAGA,OAFAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QACAhB,KAAAkL,GAAAlL,KAAAkL,EAAA,IAAA,CACA,EAEA1E,EAAAnD,UAAAwH,aAAA,SAAAK,EAAAiF,GAGA,OAFAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QACAhB,KAAAkL,IAAA,EAAAlL,KAAAkL,EAAA,EACA,EAEA1E,EAAAnD,UAAAuN,aAAA,SAAA1F,EAAAiF,GAIA,OAHAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,SAEAhB,KAAAkL,GACAlL,KAAAkL,EAAA,IAAA,EACAlL,KAAAkL,EAAA,IAAA,IACA,SAAAlL,KAAAkL,EAAA,EACA,EAEA1E,EAAAnD,UAAAwN,aAAA,SAAA3F,EAAAiF,GAIA,OAHAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QAEA,SAAAhB,KAAAkL,IACAlL,KAAAkL,EAAA,IAAA,GACAlL,KAAAkL,EAAA,IAAA,EACAlL,KAAAkL,EAAA,GACA,EAEA1E,EAAAnD,UAAAyN,UAAA,SAAA5F,EAAAvG,EAAAwL,GACAjF,KAAA,EACAvG,KAAA,EACAwL,GAAAN,EAAA3E,EAAAvG,EAAA3E,KAAAgB,QAKA,IAHA,IAAAoJ,EAAApK,KAAAkL,GACAsF,EAAA,EACAjQ,EAAA,IACAA,EAAAoE,IAAA6L,GAAA,MACApG,GAAApK,KAAAkL,EAAA3K,GAAAiQ,EAMA,OAFApG,IAFAoG,GAAA,OAEApG,GAAApG,KAAA+M,IAAA,EAAA,EAAApM,IAEAyF,CACA,EAEA5D,EAAAnD,UAAA2N,UAAA,SAAA9F,EAAAvG,EAAAwL,GACAjF,KAAA,EACAvG,KAAA,EACAwL,GAAAN,EAAA3E,EAAAvG,EAAA3E,KAAAgB,QAKA,IAHA,IAAAT,EAAAoE,EACA6L,EAAA,EACApG,EAAApK,KAAAkL,IAAA3K,GACAA,EAAA,IAAAiQ,GAAA,MACApG,GAAApK,KAAAkL,IAAA3K,GAAAiQ,EAMA,OAFApG,IAFAoG,GAAA,OAEApG,GAAApG,KAAA+M,IAAA,EAAA,EAAApM,IAEAyF,CACA,EAEA5D,EAAAnD,UAAA4N,SAAA,SAAA/F,EAAAiF,GAGA,OAFAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QACA,IAAAhB,KAAAkL,IACA,GAAA,IAAAlL,KAAAkL,GAAA,GADAlL,KAAAkL,EAEA,EAEA1E,EAAAnD,UAAA6N,YAAA,SAAAhG,EAAAiF,GACAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QACA,IAAAoJ,EAAApK,KAAAkL,GAAAlL,KAAAkL,EAAA,IAAA,EACA,OAAA,MAAAd,EAAA,WAAAA,EAAAA,CACA,EAEA5D,EAAAnD,UAAA8N,YAAA,SAAAjG,EAAAiF,GACAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QACA,IAAAoJ,EAAApK,KAAAkL,EAAA,GAAAlL,KAAAkL,IAAA,EACA,OAAA,MAAAd,EAAA,WAAAA,EAAAA,CACA,EAEA5D,EAAAnD,UAAA+N,YAAA,SAAAlG,EAAAiF,GAIA,OAHAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QAEAhB,KAAAkL,GACAlL,KAAAkL,EAAA,IAAA,EACAlL,KAAAkL,EAAA,IAAA,GACAlL,KAAAkL,EAAA,IAAA,EACA,EAEA1E,EAAAnD,UAAAgO,YAAA,SAAAnG,EAAAiF,GAIA,OAHAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QAEAhB,KAAAkL,IAAA,GACAlL,KAAAkL,EAAA,IAAA,GACAlL,KAAAkL,EAAA,IAAA,EACAlL,KAAAkL,EAAA,EACA,EAEA1E,EAAAnD,UAAAiO,YAAA,SAAApG,EAAAiF,GAGA,OAFAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QACA0F,EAAAkE,KAAA5K,KAAAkL,GAAA,EAAA,GAAA,EACA,EAEA1E,EAAAnD,UAAAkO,YAAA,SAAArG,EAAAiF,GAGA,OAFAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QACA0F,EAAAkE,KAAA5K,KAAAkL,GAAA,EAAA,GAAA,EACA,EAEA1E,EAAAnD,UAAAmO,aAAA,SAAAtG,EAAAiF,GAGA,OAFAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QACA0F,EAAAkE,KAAA5K,KAAAkL,GAAA,EAAA,GAAA,EACA,EAEA1E,EAAAnD,UAAAoO,aAAA,SAAAvG,EAAAiF,GAGA,OAFAjF,KAAA,EACAiF,GAAAN,EAAA3E,EAAA,EAAAlL,KAAAgB,QACA0F,EAAAkE,KAAA5K,KAAAkL,GAAA,EAAA,GAAA,EACA,EAQA1E,EAAAnD,UAAAqO,YAAA,SAAAnN,EAAA2G,EAAAvG,EAAAwL,IACA5L,GAAAA,EACA2G,KAAA,EACAvG,KAAA,EACAwL,IAEAJ,EAAA/P,KAAAuE,EAAA2G,EAAAvG,EADAX,KAAA+M,IAAA,EAAA,EAAApM,GAAA,EACA,GAGA,IAAA6L,EAAA,EACAjQ,EAAA,EAEA,IADAP,KAAAkL,GAAA,IAAA3G,IACAhE,EAAAoE,IAAA6L,GAAA,MACAxQ,KAAAkL,EAAA3K,GAAAgE,EAAAiM,EAAA,IAGA,OAAAtF,EAAAvG,CACA,EAEA6B,EAAAnD,UAAAsO,YAAA,SAAApN,EAAA2G,EAAAvG,EAAAwL,IACA5L,GAAAA,EACA2G,KAAA,EACAvG,KAAA,EACAwL,IAEAJ,EAAA/P,KAAAuE,EAAA2G,EAAAvG,EADAX,KAAA+M,IAAA,EAAA,EAAApM,GAAA,EACA,GAGA,IAAApE,EAAAoE,EAAA,EACA6L,EAAA,EAEA,IADAxQ,KAAAkL,EAAA3K,GAAA,IAAAgE,IACAhE,GAAA,IAAAiQ,GAAA,MACAxQ,KAAAkL,EAAA3K,GAAAgE,EAAAiM,EAAA,IAGA,OAAAtF,EAAAvG,CACA,EAEA6B,EAAAnD,UAAAuO,WAAA,SAAArN,EAAA2G,EAAAiF,GAKA,OAJA5L,GAAAA,EACA2G,KAAA,EACAiF,GAAAJ,EAAA/P,KAAAuE,EAAA2G,EAAA,EAAA,IAAA,GACAlL,KAAAkL,GAAA,IAAA3G,EACA2G,EAAA,CACA,EAEA1E,EAAAnD,UAAAwO,cAAA,SAAAtN,EAAA2G,EAAAiF,GAMA,OALA5L,GAAAA,EACA2G,KAAA,EACAiF,GAAAJ,EAAA/P,KAAAuE,EAAA2G,EAAA,EAAA,MAAA,GACAlL,KAAAkL,GAAA,IAAA3G,EACAvE,KAAAkL,EAAA,GAAA3G,IAAA,EACA2G,EAAA,CACA,EAEA1E,EAAAnD,UAAAyO,cAAA,SAAAvN,EAAA2G,EAAAiF,GAMA,OALA5L,GAAAA,EACA2G,KAAA,EACAiF,GAAAJ,EAAA/P,KAAAuE,EAAA2G,EAAA,EAAA,MAAA,GACAlL,KAAAkL,GAAA3G,IAAA,EACAvE,KAAAkL,EAAA,GAAA,IAAA3G,EACA2G,EAAA,CACA,EAEA1E,EAAAnD,UAAA0O,cAAA,SAAAxN,EAAA2G,EAAAiF,GAQA,OAPA5L,GAAAA,EACA2G,KAAA,EACAiF,GAAAJ,EAAA/P,KAAAuE,EAAA2G,EAAA,EAAA,WAAA,GACAlL,KAAAkL,EAAA,GAAA3G,IAAA,GACAvE,KAAAkL,EAAA,GAAA3G,IAAA,GACAvE,KAAAkL,EAAA,GAAA3G,IAAA,EACAvE,KAAAkL,GAAA,IAAA3G,EACA2G,EAAA,CACA,EAEA1E,EAAAnD,UAAA2O,cAAA,SAAAzN,EAAA2G,EAAAiF,GAQA,OAPA5L,GAAAA,EACA2G,KAAA,EACAiF,GAAAJ,EAAA/P,KAAAuE,EAAA2G,EAAA,EAAA,WAAA,GACAlL,KAAAkL,GAAA3G,IAAA,GACAvE,KAAAkL,EAAA,GAAA3G,IAAA,GACAvE,KAAAkL,EAAA,GAAA3G,IAAA,EACAvE,KAAAkL,EAAA,GAAA,IAAA3G,EACA2G,EAAA,CACA,EAEA1E,EAAAnD,UAAA4O,WAAA,SAAA1N,EAAA2G,EAAAvG,EAAAwL,GAGA,GAFA5L,GAAAA,EACA2G,KAAA,GACAiF,EAAA,CACA,IAAA/O,EAAA4C,KAAA+M,IAAA,EAAA,EAAApM,EAAA,GAEAoL,EAAA/P,KAAAuE,EAAA2G,EAAAvG,EAAAvD,EAAA,GAAAA,EACA,CAEA,IAAAb,EAAA,EACAiQ,EAAA,EACA0B,EAAA,EAEA,IADAlS,KAAAkL,GAAA,IAAA3G,IACAhE,EAAAoE,IAAA6L,GAAA,MACAjM,EAAA,GAAA,IAAA2N,GAAA,IAAAlS,KAAAkL,EAAA3K,EAAA,KACA2R,EAAA,GAEAlS,KAAAkL,EAAA3K,IAAAgE,EAAAiM,GAAA,GAAA0B,EAAA,IAGA,OAAAhH,EAAAvG,CACA,EAEA6B,EAAAnD,UAAA8O,WAAA,SAAA5N,EAAA2G,EAAAvG,EAAAwL,GAGA,GAFA5L,GAAAA,EACA2G,KAAA,GACAiF,EAAA,CACA,IAAA/O,EAAA4C,KAAA+M,IAAA,EAAA,EAAApM,EAAA,GAEAoL,EAAA/P,KAAAuE,EAAA2G,EAAAvG,EAAAvD,EAAA,GAAAA,EACA,CAEA,IAAAb,EAAAoE,EAAA,EACA6L,EAAA,EACA0B,EAAA,EAEA,IADAlS,KAAAkL,EAAA3K,GAAA,IAAAgE,IACAhE,GAAA,IAAAiQ,GAAA,MACAjM,EAAA,GAAA,IAAA2N,GAAA,IAAAlS,KAAAkL,EAAA3K,EAAA,KACA2R,EAAA,GAEAlS,KAAAkL,EAAA3K,IAAAgE,EAAAiM,GAAA,GAAA0B,EAAA,IAGA,OAAAhH,EAAAvG,CACA,EAEA6B,EAAAnD,UAAA+O,UAAA,SAAA7N,EAAA2G,EAAAiF,GAMA,OALA5L,GAAAA,EACA2G,KAAA,EACAiF,GAAAJ,EAAA/P,KAAAuE,EAAA2G,EAAA,EAAA,KAAA,KACA3G,EAAA,IAAAA,EAAA,IAAAA,EAAA,GACAvE,KAAAkL,GAAA,IAAA3G,EACA2G,EAAA,CACA,EAEA1E,EAAAnD,UAAAgP,aAAA,SAAA9N,EAAA2G,EAAAiF,GAMA,OALA5L,GAAAA,EACA2G,KAAA,EACAiF,GAAAJ,EAAA/P,KAAAuE,EAAA2G,EAAA,EAAA,OAAA,OACAlL,KAAAkL,GAAA,IAAA3G,EACAvE,KAAAkL,EAAA,GAAA3G,IAAA,EACA2G,EAAA,CACA,EAEA1E,EAAAnD,UAAAiP,aAAA,SAAA/N,EAAA2G,EAAAiF,GAMA,OALA5L,GAAAA,EACA2G,KAAA,EACAiF,GAAAJ,EAAA/P,KAAAuE,EAAA2G,EAAA,EAAA,OAAA,OACAlL,KAAAkL,GAAA3G,IAAA,EACAvE,KAAAkL,EAAA,GAAA,IAAA3G,EACA2G,EAAA,CACA,EAEA1E,EAAAnD,UAAAkP,aAAA,SAAAhO,EAAA2G,EAAAiF,GAQA,OAPA5L,GAAAA,EACA2G,KAAA,EACAiF,GAAAJ,EAAA/P,KAAAuE,EAAA2G,EAAA,EAAA,YAAA,YACAlL,KAAAkL,GAAA,IAAA3G,EACAvE,KAAAkL,EAAA,GAAA3G,IAAA,EACAvE,KAAAkL,EAAA,GAAA3G,IAAA,GACAvE,KAAAkL,EAAA,GAAA3G,IAAA,GACA2G,EAAA,CACA,EAEA1E,EAAAnD,UAAAmP,aAAA,SAAAjO,EAAA2G,EAAAiF,GASA,OARA5L,GAAAA,EACA2G,KAAA,EACAiF,GAAAJ,EAAA/P,KAAAuE,EAAA2G,EAAA,EAAA,YAAA,YACA3G,EAAA,IAAAA,EAAA,WAAAA,EAAA,GACAvE,KAAAkL,GAAA3G,IAAA,GACAvE,KAAAkL,EAAA,GAAA3G,IAAA,GACAvE,KAAAkL,EAAA,GAAA3G,IAAA,EACAvE,KAAAkL,EAAA,GAAA,IAAA3G,EACA2G,EAAA,CACA,EAiBA1E,EAAAnD,UAAAoP,aAAA,SAAAlO,EAAA2G,EAAAiF,GACA,OAAAF,EAAAjQ,KAAAuE,EAAA2G,GAAA,EAAAiF,EACA,EAEA3J,EAAAnD,UAAAqP,aAAA,SAAAnO,EAAA2G,EAAAiF,GACA,OAAAF,EAAAjQ,KAAAuE,EAAA2G,GAAA,EAAAiF,EACA,EAYA3J,EAAAnD,UAAAsP,cAAA,SAAApO,EAAA2G,EAAAiF,GACA,OAAAC,EAAApQ,KAAAuE,EAAA2G,GAAA,EAAAiF,EACA,EAEA3J,EAAAnD,UAAAuP,cAAA,SAAArO,EAAA2G,EAAAiF,GACA,OAAAC,EAAApQ,KAAAuE,EAAA2G,GAAA,EAAAiF,EACA,EAGA3J,EAAAnD,UAAAuF,KAAA,SAAAoG,EAAA6D,EAAA1M,EAAAC,GACA,IAAAI,EAAAkC,SAAAsG,GAAA,MAAA,IAAA3H,UAAA,+BAQA,GAPAlB,IAAAA,EAAA,GACAC,GAAA,IAAAA,IAAAA,EAAApG,KAAAgB,QACA6R,GAAA7D,EAAAhO,SAAA6R,EAAA7D,EAAAhO,QACA6R,IAAAA,EAAA,GACAzM,EAAA,GAAAA,EAAAD,IAAAC,EAAAD,GAGAC,IAAAD,EAAA,OAAA,EACA,GAAA,IAAA6I,EAAAhO,QAAA,IAAAhB,KAAAgB,OAAA,OAAA,EAGA,GAAA6R,EAAA,EACA,MAAA,IAAA7L,WAAA,6BAEA,GAAAb,EAAA,GAAAA,GAAAnG,KAAAgB,OAAA,MAAA,IAAAgG,WAAA,sBACA,GAAAZ,EAAA,EAAA,MAAA,IAAAY,WAAA,2BAGAZ,EAAApG,KAAAgB,SAAAoF,EAAApG,KAAAgB,QACAgO,EAAAhO,OAAA6R,EAAAzM,EAAAD,IACAC,EAAA4I,EAAAhO,OAAA6R,EAAA1M,GAGA,IAAAzC,EAAA0C,EAAAD,EAEA,GAAAnG,OAAAgP,GAAA,mBAAA/I,WAAA5C,UAAAyP,WAEA9S,KAAA8S,WAAAD,EAAA1M,EAAAC,QACA,GAAApG,OAAAgP,GAAA7I,EAAA0M,GAAAA,EAAAzM,EAEA,IAAA,IAAA7F,EAAAmD,EAAA,EAAAnD,GAAA,IAAAA,EACAyO,EAAAzO,EAAAsS,GAAA7S,KAAAO,EAAA4F,QAGAF,WAAA5C,UAAA0P,IAAAhS,KACAiO,EACAhP,KAAAsQ,SAAAnK,EAAAC,GACAyM,GAIA,OAAAnP,CACA,EAMA8C,EAAAnD,UAAA2K,KAAA,SAAA5D,EAAAjE,EAAAC,EAAAqB,GAEA,GAAA,iBAAA2C,EAAA,CASA,GARA,iBAAAjE,GACAsB,EAAAtB,EACAA,EAAA,EACAC,EAAApG,KAAAgB,QACA,iBAAAoF,IACAqB,EAAArB,EACAA,EAAApG,KAAAgB,aAEAsH,IAAAb,GAAA,iBAAAA,EACA,MAAA,IAAAJ,UAAA,6BAEA,GAAA,iBAAAI,IAAAjB,EAAAkB,WAAAD,GACA,MAAA,IAAAJ,UAAA,qBAAAI,GAEA,GAAA,IAAA2C,EAAApJ,OAAA,CACA,IAAAH,EAAAuJ,EAAA7E,WAAA,IACA,SAAAkC,GAAA5G,EAAA,KACA,WAAA4G,KAEA2C,EAAAvJ,EAEA,CACA,KAAA,iBAAAuJ,IACAA,GAAA,KAIA,GAAAjE,EAAA,GAAAnG,KAAAgB,OAAAmF,GAAAnG,KAAAgB,OAAAoF,EACA,MAAA,IAAAY,WAAA,sBAGA,GAAAZ,GAAAD,EACA,OAAAnG,KAQA,IAAAO,EACA,GANA4F,KAAA,EACAC,OAAAkC,IAAAlC,EAAApG,KAAAgB,OAAAoF,IAAA,EAEAgE,IAAAA,EAAA,GAGA,iBAAAA,EACA,IAAA7J,EAAA4F,EAAA5F,EAAA6F,IAAA7F,EACAP,KAAAO,GAAA6J,MAEA,CACA,IAAAwF,EAAApJ,EAAAkC,SAAA0B,GACAA,EACA5D,EAAAe,KAAA6C,EAAA3C,GACA/D,EAAAkM,EAAA5O,OACA,GAAA,IAAA0C,EACA,MAAA,IAAA2D,UAAA,cAAA+C,EACA,qCAEA,IAAA7J,EAAA,EAAAA,EAAA6F,EAAAD,IAAA5F,EACAP,KAAAO,EAAA4F,GAAAyJ,EAAArP,EAAAmD,EAEA,CAEA,OAAA1D,IACA,EAKA,IAAAgT,EAAA,oBAgBA,SAAArD,EAAAvP,GACA,OAAAA,EAAA,GAAA,IAAAA,EAAAkD,SAAA,IACAlD,EAAAkD,SAAA,GACA,CAEA,SAAAiG,EAAA/B,EAAA0E,GAEA,IAAAW,EADAX,EAAAA,GAAA+G,IAMA,IAJA,IAAAjS,EAAAwG,EAAAxG,OACAkS,EAAA,KACAtD,EAAA,GAEArP,EAAA,EAAAA,EAAAS,IAAAT,EAAA,CAIA,IAHAsM,EAAArF,EAAAjC,WAAAhF,IAGA,OAAAsM,EAAA,MAAA,CAEA,IAAAqG,EAAA,CAEA,GAAArG,EAAA,MAAA,EAEAX,GAAA,IAAA,GAAA0D,EAAA7M,KAAA,IAAA,IAAA,KACA,QACA,CAAA,GAAAxC,EAAA,IAAAS,EAAA,EAEAkL,GAAA,IAAA,GAAA0D,EAAA7M,KAAA,IAAA,IAAA,KACA,QACA,CAGAmQ,EAAArG,EAEA,QACA,CAGA,GAAAA,EAAA,MAAA,EACAX,GAAA,IAAA,GAAA0D,EAAA7M,KAAA,IAAA,IAAA,KACAmQ,EAAArG,EACA,QACA,CAGAA,EAAA,OAAAqG,EAAA,OAAA,GAAArG,EAAA,MACA,MAAAqG,IAEAhH,GAAA,IAAA,GAAA0D,EAAA7M,KAAA,IAAA,IAAA,KAMA,GAHAmQ,EAAA,KAGArG,EAAA,IAAA,CACA,IAAAX,GAAA,GAAA,EAAA,MACA0D,EAAA7M,KAAA8J,EACA,MAAA,GAAAA,EAAA,KAAA,CACA,IAAAX,GAAA,GAAA,EAAA,MACA0D,EAAA7M,KACA8J,GAAA,EAAA,IACA,GAAAA,EAAA,IAEA,MAAA,GAAAA,EAAA,MAAA,CACA,IAAAX,GAAA,GAAA,EAAA,MACA0D,EAAA7M,KACA8J,GAAA,GAAA,IACAA,GAAA,EAAA,GAAA,IACA,GAAAA,EAAA,IAEA,KAAA,MAAAA,EAAA,SASA,MAAA,IAAAjM,MAAA,sBARA,IAAAsL,GAAA,GAAA,EAAA,MACA0D,EAAA7M,KACA8J,GAAA,GAAA,IACAA,GAAA,GAAA,GAAA,IACAA,GAAA,EAAA,GAAA,IACA,GAAAA,EAAA,IAIA,CACA,CAEA,OAAA+C,CACA,CA2BA,SAAApG,EAAAoC,GACA,OAAAnF,EAAAxB,YA7HA,SAAA2G,GAMA,IAFAA,GAFAA,EAAAA,EAAAuH,MAAA,KAAA,IAEApE,OAAAD,QAAAkE,EAAA,KAEAhS,OAAA,EAAA,MAAA,GAEA,KAAA4K,EAAA5K,OAAA,GAAA,GACA4K,GAAA,IAEA,OAAAA,CACA,CAiHAwH,CAAAxH,GACA,CAEA,SAAAF,EAAA2H,EAAAC,EAAApI,EAAAlK,GACA,IAAA,IAAAT,EAAA,EAAAA,EAAAS,KACAT,EAAA2K,GAAAoI,EAAAtS,QAAAT,GAAA8S,EAAArS,UADAT,EAEA+S,EAAA/S,EAAA2K,GAAAmI,EAAA9S,GAEA,OAAAA,CACA,CAKA,SAAA2H,EAAAhG,EAAA4G,GACA,OAAA5G,aAAA4G,GACA,MAAA5G,GAAA,MAAAA,EAAAqR,aAAA,MAAArR,EAAAqR,YAAAC,MACAtR,EAAAqR,YAAAC,OAAA1K,EAAA0K,IACA,CACA,SAAA3K,EAAA3G,GAEA,OAAAA,GAAAA,CACA,ClBwaC,GAAEnB,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,UAAU+F,OAE5C,EAAE,CAAC,YAAY,GAAG2B,OAAS,GAAGzB,QAAU,KAAK,GAAG,CAAC,SAASjG,EAAQf,EAAOD,GmB1pEzEC,EAAAD,QAAA,CACA,IAAA,WACA,IAAA,sBACA,IAAA,aACA,IAAA,KACA,IAAA,UACA,IAAA,WACA,IAAA,gCACA,IAAA,aACA,IAAA,gBACA,IAAA,kBACA,IAAA,eACA,IAAA,mBACA,IAAA,UACA,IAAA,mBACA,IAAA,oBACA,IAAA,QACA,IAAA,YACA,IAAA,eACA,IAAA,YACA,IAAA,qBACA,IAAA,qBACA,IAAA,cACA,IAAA,eACA,IAAA,mBACA,IAAA,YACA,IAAA,YACA,IAAA,qBACA,IAAA,iBACA,IAAA,gCACA,IAAA,kBACA,IAAA,WACA,IAAA,OACA,IAAA,kBACA,IAAA,sBACA,IAAA,oBACA,IAAA,eACA,IAAA,yBACA,IAAA,wBACA,IAAA,qBACA,IAAA,eACA,IAAA,sBACA,IAAA,uBACA,IAAA,SACA,IAAA,oBACA,IAAA,uBACA,IAAA,mBACA,IAAA,wBACA,IAAA,oBACA,IAAA,kCACA,IAAA,gCACA,IAAA,wBACA,IAAA,kBACA,IAAA,cACA,IAAA,sBACA,IAAA,kBACA,IAAA,6BACA,IAAA,0BACA,IAAA,uBACA,IAAA,gBACA,IAAA,2BACA,IAAA,eACA,IAAA,kCnB8pEA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASgB,EAAQf,EAAOD,GoBptDlCC,EAAAD;;;;;AA9fA,MAEA8T,cAIAvT,KAAAyT,6BAAA,UAIAzT,KAAA0T,kCAAA,+BACA1T,KAAA2T,oCAAA,MACA3T,KAAA4T,8BAAA,cAIA5T,KAAA6T,0BAAA,IACA7T,KAAA8T,oBAAA,KACA9T,KAAA+T,6BAAA,IAEA/T,KAAAgU,yBAAA,MACAhU,KAAAiU,oCAAA,IAEAjU,KAAAkU,2BAAA,mBAAAvJ,OAAAtH,UAAA8Q,WACAnU,KAAAoU,yBAAA,mBAAAzJ,OAAAtH,UAAAgR,QACA,CAaAC,cAAAC,GAIA,OAAAA,EAAApB,MAAA,IAAAqB,UAAAxO,KAAA,GACA,CAUAyO,iBAAAF,EAAAG,EAAAC,GAEA,OAAA3U,KAAAkU,2BAEAK,EAAAJ,WAAAO,EAAAC,GAIA3U,KAAA4U,0BAAA7T,KAAAwT,EAAAG,EAAAC,EAEA,CASAC,0BAAAF,EAAAC,GAEA,OAAA3U,KAAA6H,MAAA8M,GAAA,EAAAD,EAAA1T,UAAA0T,CACA,CAUAG,eAAAN,EAAAG,EAAAI,GAEA,OAAA9U,KAAAoU,yBAEAG,EAAAF,SAAAK,EAAAI,GAIA9U,KAAA+U,wBAAAhU,KAAAwT,EAAAG,EAAAI,EAEA,CASAC,wBAAAL,EAAAI,GAYA,OARAA,EAAA9U,KAAAgB,OAMA8T,GAAA,EAJAA,EAAA9U,KAAAgB,OAMAhB,KAAAwL,OAAAsJ,EAAAJ,EAAA1T,OAAA0T,EAAA1T,UAAA0T,CACA,CAQAM,mBAAAT,GAEA,IAAAU,EAAA,EACAC,EAAAX,EAAAvT,OACAmU,EAAA,EAEA,KAAAA,EAAAD,GAEAD,GAAAA,GAAA,GAAAA,EAAAV,EAAAhP,WAAA4P,KAAA,EAGA,MAAA,GAAAzQ,OAAA1E,KAAAgU,0BAAAtP,OAAAuQ,EACA,CASAG,6BAAAC,EAAAd,GAcA,OAAAA,EAAAJ,WAAAkB,IAAAd,EAAAF,SAAAgB,GAEAd,EAAAe,UAAA,EAAAf,EAAAvT,OAAA,GAIAuT,CAEA,CAOAgB,wBAAAhB,GAEA,GAAA,iBAAAA,GAAA,IAAAA,EAEA,OAAAA,EAAAzF,QAAA9O,KAAA4T,8BAAA5T,KAAAiU,oCAEA,CAaAuB,sBAAAjB,GAGA,IAEAkB,EAFAzV,KAAAsU,cAAAC,GAEAmB,MAAA1V,KAAAyT,8BAAAzN,KAAA,KAEA,OAAAhG,KAAAsU,cAAAmB,EACA,CAEAE,8BAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GAIA,OAAAJ,GAAAG,EAAAhW,KAAAwV,sBAAAO,GAAAC,EAAAC,EAAAjW,KAAAwV,sBAAAO,EAAAE,GACA,CAQAC,2BAAAC,GAGA,OAAAA,EAAA7S,WAAAwL,QAEA9O,KAAA0T,kCACA1T,KAAA2V,8BAAAS,KAAApW,MAEA,CAQAqW,iBAAAC,GAEA,IAAAC,EAAAC,WAAAF,GAAAG,QAAA,GAEA,OAAAC,MAAAH,KAGA,iBAAAD,IAGAC,EAAAC,WAAAF,EAAAxH,QAAA9O,KAAA6T,0BAAA,IAAA/E,QAAA9O,KAAA2T,oCAAA,KAAA8C,QAAA,IAGAC,MAAAH,IAEAvW,KAAA8T,oBAKA,IAAApP,OAAA1E,KAAAkW,2BAAAK,GACA,CASAI,qBAAAL,EAAAM,GAEA,IAAAC,OAAA,IAAAD,EAAA,EAAAA,EAEAE,EAAAN,WAAAF,GAAAG,QAAAI,GACA,GAAAH,MAAAI,GACA,CAEA,OADA,GACAL,QAAAI,EACA,CAGA,OAAAC,CAEA,CAgBAC,kBAAAxC,EAAAqB,GAEA,OAAArB,EAAApB,MAAAyC,GAAA,EACA,CAWAoB,iBAAAzC,EAAAqB,GAEA,IAAAqB,EAAA1C,EAAArO,QAAA0P,GAEA,OAAAqB,EAAA,GAAAA,EAAArB,EAAA5U,QAAAuT,EAAAvT,OAEA,GAGAuT,EAAAe,UAAA2B,EAAArB,EAAA5U,OACA,CAYAkW,sBAAA3C,EAAA4C,EAAAC,GAEA,IAAAC,EAAA,iBAAA9C,EAAAA,EAAA,GACA+C,EAAA,iBAAAH,EAAAA,EAAA,IACAI,EAAA,iBAAAH,EAAAA,EAAA,IAEAI,EAAA,EACAC,EAAA,EACA,IAAA,IAAAlX,EAAA,EAAAA,EAAA8W,EAAArW,OAAAT,IAGA8W,EAAA9W,IAAA+W,GAEA,GAAAG,GAEAD,IAEAC,KAEAJ,EAAA9W,IAAAgX,GAEAE,IAIA,OAAAD,CACA,CAcAE,+BAAAnD,EAAAoD,EAAAR,EAAAC,GAEA,IAAAC,EAAA,iBAAA9C,EAAAA,EAAA,GACAqD,EAAA,iBAAAD,EAAAA,EAAA,EACAL,EAAA,iBAAAH,EAAAA,EAAA,IACAI,EAAA,iBAAAH,EAAAA,EAAA,IAEAI,EAAA,EACAC,EAAA,EAEAI,GAAA,EACAC,EAAA,EACAC,EAAA,EAEA,IAAA,IAAAxX,EAAA,EAAAA,EAAA8W,EAAArW,OAAAT,IAGA8W,EAAA9W,IAAA+W,GAEAG,IAGA,GAAAA,IAEAD,IACAI,GAAAJ,EAAA,IAGAK,GAAA,EACAC,EAAAvX,KAKA8W,EAAA9W,IAAAgX,IAEAE,IAGA,GAAAA,GACAI,GACAE,GAAAD,IAEAC,EAAAxX,EACAsX,GAAA,IAKA,OAAAL,GAAAI,EAGA,GAGAG,EAAA,GAAAA,EAAAD,EAEAT,EAAA/B,UAAAwC,EAAA,EAAAC,GAIAV,EAAA/B,UAAAwC,EAAA,EAEA,CAYAE,6BAAAzD,EAAA0D,EAAAd,EAAAC,GAEA,IAAAC,EAAA,iBAAA9C,EAAAA,EAAA,GACA2D,EAAA,iBAAAD,EAAAA,EAAA,EACAX,EAAA,iBAAAH,EAAAA,EAAA,IACAI,EAAA,iBAAAH,EAAAA,EAAA,IAEAI,EAAA,EACAC,EAAA,EAEAI,GAAA,EACAM,EAAA,EACAC,EAAA,EAEA,IAAA,IAAA7X,EAAA,EAAAA,EAAA8W,EAAArW,OAAAT,IAGA8W,EAAA9W,IAAA+W,GAEAG,IAEA,GAAAA,IAEAD,IACAU,GAAAV,EAAA,IAEAK,GAAA,EACAM,EAAA5X,KAIA8W,EAAA9W,IAAAgX,IAEAE,IAEA,GAAAA,GACAI,GACAO,GAAAD,IAEAC,EAAA7X,EACAsX,GAAA,IAKA,GAAAL,GAAAU,EAEA,OAAAb,EAGA,IAAAgB,EAAA,GAYA,OAVAF,EAAA,IAEAE,EAAAhB,EAAA/B,UAAA,EAAA6C,IAGAd,EAAArW,OAAAoX,EAAA,GAAAA,EAAAD,IAEAE,GAAAhB,EAAA/B,UAAA8C,EAAA,IAGAC,CACA,EpBiuEA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS5X,EAAQf,EAAOD,GqB/sFlC,IAOA6Y,EAPAC,EAAA,iBAAAC,QAAAA,QAAA,KACAC,EAAAF,GAAA,mBAAAA,EAAA5W,MACA4W,EAAA5W,MACA,SAAAqN,EAAA0J,EAAA9V,GACA,OAAA+V,SAAAtV,UAAA1B,MAAAZ,KAAAiO,EAAA0J,EAAA9V,EACA,EAIA0V,EADAC,GAAA,mBAAAA,EAAAK,QACAL,EAAAK,QACAxV,OAAAyV,sBACA,SAAA7J,GACA,OAAA5L,OAAA0V,oBAAA9J,GACAtK,OAAAtB,OAAAyV,sBAAA7J,GACA,EAEA,SAAAA,GACA,OAAA5L,OAAA0V,oBAAA9J,EACA,EAOA,IAAA+J,EAAA5N,OAAAuL,OAAA,SAAAnS,GACA,OAAAA,GAAAA,CACA,EAEA,SAAAyU,IACAA,EAAAC,KAAAlY,KAAAf,KACA,CACAN,EAAAD,QAAAuZ,EACAtZ,EAAAD,QAAAqC,KAwYA,SAAAoX,EAAA1F,GACA,OAAA,IAAA2F,SAAA,SAAAC,EAAAC,GACA,SAAAC,EAAA7W,GACAyW,EAAAK,eAAA/F,EAAAgG,GACAH,EAAA5W,EACA,CAEA,SAAA+W,IACA,mBAAAN,EAAAK,gBACAL,EAAAK,eAAA,QAAAD,GAEAF,EAAA,GAAAvR,MAAA9G,KAAAa,WACA,CAEA6X,EAAAP,EAAA1F,EAAAgG,EAAA,CAAA1X,MAAA,IACA,UAAA0R,GAMA,SAAA0F,EAAAQ,EAAAC,GACA,mBAAAT,EAAAU,IACAH,EAAAP,EAAA,QAAAQ,EAAAC,EAEA,CATAE,CAAAX,EAAAI,EAAA,CAAAxX,MAAA,GAEA,GACA,EAxZAkX,EAAAA,aAAAA,EAEAA,EAAA3V,UAAAyW,aAAAxR,EACA0Q,EAAA3V,UAAA0W,aAAA,EACAf,EAAA3V,UAAA2W,mBAAA1R,EAIA,IAAA2R,EAAA,GAEA,SAAAC,EAAAC,GACA,GAAA,mBAAAA,EACA,MAAA,IAAA9S,UAAA,0EAAA8S,EAEA,CAoCA,SAAAC,EAAAC,GACA,YAAA/R,IAAA+R,EAAAL,cACAhB,EAAAiB,oBACAI,EAAAL,aACA,CAkDA,SAAAM,EAAAtL,EAAAlG,EAAAqR,EAAAI,GACA,IAAArQ,EACAsQ,EACAC,EA1HAC,EAgJA,GApBAR,EAAAC,QAGA7R,KADAkS,EAAAxL,EAAA8K,UAEAU,EAAAxL,EAAA8K,QAAA1W,OAAAuX,OAAA,MACA3L,EAAA+K,aAAA,SAIAzR,IAAAkS,EAAAI,cACA5L,EAAA6L,KAAA,cAAA/R,EACAqR,EAAAA,SAAAA,EAAAA,SAAAA,GAIAK,EAAAxL,EAAA8K,SAEAW,EAAAD,EAAA1R,SAGAR,IAAAmS,EAEAA,EAAAD,EAAA1R,GAAAqR,IACAnL,EAAA+K,kBAeA,GAbA,mBAAAU,EAEAA,EAAAD,EAAA1R,GACAyR,EAAA,CAAAJ,EAAAM,GAAA,CAAAA,EAAAN,GAEAI,EACAE,EAAAK,QAAAX,GAEAM,EAAA1X,KAAAoX,IAIAjQ,EAAAkQ,EAAApL,IACA,GAAAyL,EAAAzZ,OAAAkJ,IAAAuQ,EAAAM,OAAA,CACAN,EAAAM,QAAA,EAGA,IAAAC,EAAA,IAAApa,MAAA,+CACA6Z,EAAAzZ,OAAA,IAAA2J,OAAA7B,GADA,qEAIAkS,EAAAxH,KAAA,8BACAwH,EAAA9B,QAAAlK,EACAgM,EAAAlS,KAAAA,EACAkS,EAAAC,MAAAR,EAAAzZ,OA7KA0Z,EA8KAM,EA7KAzN,SAAAA,QAAA2N,MAAA3N,QAAA2N,KAAAR,EA8KA,CAGA,OAAA1L,CACA,CAaA,SAAAmM,IACA,IAAAnb,KAAAob,MAGA,OAFApb,KAAAgP,OAAAuK,eAAAvZ,KAAA8I,KAAA9I,KAAAqb,QACArb,KAAAob,OAAA,EACA,IAAAxZ,UAAAZ,OACAhB,KAAAma,SAAApZ,KAAAf,KAAAgP,QACAhP,KAAAma,SAAAxY,MAAA3B,KAAAgP,OAAApN,UAEA,CAEA,SAAA0Z,EAAAtM,EAAAlG,EAAAqR,GACA,IAAAoB,EAAA,CAAAH,OAAA,EAAAC,YAAA/S,EAAA0G,OAAAA,EAAAlG,KAAAA,EAAAqR,SAAAA,GACAqB,EAAAL,EAAA/E,KAAAmF,GAGA,OAFAC,EAAArB,SAAAA,EACAoB,EAAAF,OAAAG,EACAA,CACA,CAyHA,SAAAC,EAAAzM,EAAAlG,EAAA4S,GACA,IAAAlB,EAAAxL,EAAA8K,QAEA,QAAAxR,IAAAkS,EACA,MAAA,GAEA,IAAAmB,EAAAnB,EAAA1R,GACA,YAAAR,IAAAqT,EACA,GAEA,mBAAAA,EACAD,EAAA,CAAAC,EAAAxB,UAAAwB,GAAA,CAAAA,GAEAD,EAsDA,SAAAva,GAEA,IADA,IAAAsO,EAAA,IAAAvM,MAAA/B,EAAAH,QACAT,EAAA,EAAAA,EAAAkP,EAAAzO,SAAAT,EACAkP,EAAAlP,GAAAY,EAAAZ,GAAA4Z,UAAAhZ,EAAAZ,GAEA,OAAAkP,CACA,CA3DAmM,CAAAD,GAAAE,EAAAF,EAAAA,EAAA3a,OACA,CAmBA,SAAA8a,EAAAhT,GACA,IAAA0R,EAAAxa,KAAA8Z,QAEA,QAAAxR,IAAAkS,EAAA,CACA,IAAAmB,EAAAnB,EAAA1R,GAEA,GAAA,mBAAA6S,EACA,OAAA,EACA,QAAArT,IAAAqT,EACA,OAAAA,EAAA3a,MAEA,CAEA,OAAA,CACA,CAMA,SAAA6a,EAAA1a,EAAAf,GAEA,IADA,IAAAwI,EAAA,IAAA1F,MAAA9C,GACAG,EAAA,EAAAA,EAAAH,IAAAG,EACAqI,EAAArI,GAAAY,EAAAZ,GACA,OAAAqI,CACA,CA2CA,SAAA6Q,EAAAP,EAAA1F,EAAA2G,EAAAR,GACA,GAAA,mBAAAT,EAAAU,GACAD,EAAA7X,KACAoX,EAAApX,KAAA0R,EAAA2G,GAEAjB,EAAAU,GAAApG,EAAA2G,OAEA,IAAA,mBAAAjB,EAAA6C,iBAYA,MAAA,IAAA1U,UAAA,6EAAA6R,GATAA,EAAA6C,iBAAAvI,GAAA,SAAAwI,EAAA7U,GAGAwS,EAAA7X,MACAoX,EAAA+C,oBAAAzI,EAAAwI,GAEA7B,EAAAhT,EACA,GAGA,CACA,CAraA/D,OAAAqK,eAAAuL,EAAA,sBAAA,CACAtL,YAAA,EACAC,IAAA,WACA,OAAAsM,CACA,EACAlH,IAAA,SAAA5L,GACA,GAAA,iBAAAA,GAAAA,EAAA,GAAA4R,EAAA5R,GACA,MAAA,IAAAH,WAAA,kGAAAG,EAAA,KAEA8S,EAAA9S,CACA,IAGA6R,EAAAC,KAAA,gBAEA3Q,IAAAtI,KAAA8Z,SACA9Z,KAAA8Z,UAAA1W,OAAA8Y,eAAAlc,MAAA8Z,UACA9Z,KAAA8Z,QAAA1W,OAAAuX,OAAA,MACA3a,KAAA+Z,aAAA,GAGA/Z,KAAAga,cAAAha,KAAAga,oBAAA1R,CACA,EAIA0Q,EAAA3V,UAAA8Y,gBAAA,SAAA/b,GACA,GAAA,iBAAAA,GAAAA,EAAA,GAAA2Y,EAAA3Y,GACA,MAAA,IAAA4G,WAAA,gFAAA5G,EAAA,KAGA,OADAJ,KAAAga,cAAA5Z,EACAJ,IACA,EAQAgZ,EAAA3V,UAAA+Y,gBAAA,WACA,OAAAhC,EAAApa,KACA,EAEAgZ,EAAA3V,UAAAwX,KAAA,SAAA/R,GAEA,IADA,IAAAlG,EAAA,GACArC,EAAA,EAAAA,EAAAqB,UAAAZ,OAAAT,IAAAqC,EAAAG,KAAAnB,UAAArB,IACA,IAAA8b,EAAA,UAAAvT,EAEA0R,EAAAxa,KAAA8Z,QACA,QAAAxR,IAAAkS,EACA6B,EAAAA,QAAA/T,IAAAkS,EAAAhN,WACA,IAAA6O,EACA,OAAA,EAGA,GAAAA,EAAA,CACA,IAAAC,EAGA,GAFA1Z,EAAA5B,OAAA,IACAsb,EAAA1Z,EAAA,IACA0Z,aAAA1b,MAGA,MAAA0b,EAGA,IAAA7Z,EAAA,IAAA7B,MAAA,oBAAA0b,EAAA,KAAAA,EAAAC,QAAA,IAAA,KAEA,MADA9Z,EAAA+Z,QAAAF,EACA7Z,CACA,CAEA,IAAAiX,EAAAc,EAAA1R,GAEA,QAAAR,IAAAoR,EACA,OAAA,EAEA,GAAA,mBAAAA,EACAjB,EAAAiB,EAAA1Z,KAAA4C,OAEA,KAAAc,EAAAgW,EAAA1Y,OACAyb,EAAAZ,EAAAnC,EAAAhW,GACA,IAAAnD,EAAA,EAAAA,EAAAmD,IAAAnD,EACAkY,EAAAgE,EAAAlc,GAAAP,KAAA4C,EAHA,CAMA,OAAA,CACA,EAgEAoW,EAAA3V,UAAAqZ,YAAA,SAAA5T,EAAAqR,GACA,OAAAG,EAAAta,KAAA8I,EAAAqR,GAAA,EACA,EAEAnB,EAAA3V,UAAAuW,GAAAZ,EAAA3V,UAAAqZ,YAEA1D,EAAA3V,UAAAsZ,gBACA,SAAA7T,EAAAqR,GACA,OAAAG,EAAAta,KAAA8I,EAAAqR,GAAA,EACA,EAoBAnB,EAAA3V,UAAAvB,KAAA,SAAAgH,EAAAqR,GAGA,OAFAD,EAAAC,GACAna,KAAA4Z,GAAA9Q,EAAAwS,EAAAtb,KAAA8I,EAAAqR,IACAna,IACA,EAEAgZ,EAAA3V,UAAAuZ,oBACA,SAAA9T,EAAAqR,GAGA,OAFAD,EAAAC,GACAna,KAAA2c,gBAAA7T,EAAAwS,EAAAtb,KAAA8I,EAAAqR,IACAna,IACA,EAGAgZ,EAAA3V,UAAAkW,eACA,SAAAzQ,EAAAqR,GACA,IAAA7L,EAAAkM,EAAAqC,EAAAtc,EAAAuc,EAKA,GAHA5C,EAAAC,QAGA7R,KADAkS,EAAAxa,KAAA8Z,SAEA,OAAA9Z,KAGA,QAAAsI,KADAgG,EAAAkM,EAAA1R,IAEA,OAAA9I,KAEA,GAAAsO,IAAA6L,GAAA7L,EAAA6L,WAAAA,EACA,KAAAna,KAAA+Z,aACA/Z,KAAA8Z,QAAA1W,OAAAuX,OAAA,cAEAH,EAAA1R,GACA0R,EAAAjB,gBACAvZ,KAAA6a,KAAA,iBAAA/R,EAAAwF,EAAA6L,UAAAA,SAEA,GAAA,mBAAA7L,EAAA,CAGA,IAFAuO,GAAA,EAEAtc,EAAA+N,EAAAtN,OAAA,EAAAT,GAAA,EAAAA,IACA,GAAA+N,EAAA/N,KAAA4Z,GAAA7L,EAAA/N,GAAA4Z,WAAAA,EAAA,CACA2C,EAAAxO,EAAA/N,GAAA4Z,SACA0C,EAAAtc,EACA,KACA,CAGA,GAAAsc,EAAA,EACA,OAAA7c,KAEA,IAAA6c,EACAvO,EAAAyO,QAiIA,SAAAzO,EAAA7M,GACA,KAAAA,EAAA,EAAA6M,EAAAtN,OAAAS,IACA6M,EAAA7M,GAAA6M,EAAA7M,EAAA,GACA6M,EAAAxL,KACA,CAnIAka,CAAA1O,EAAAuO,GAGA,IAAAvO,EAAAtN,SACAwZ,EAAA1R,GAAAwF,EAAA,SAEAhG,IAAAkS,EAAAjB,gBACAvZ,KAAA6a,KAAA,iBAAA/R,EAAAgU,GAAA3C,EACA,CAEA,OAAAna,IACA,EAEAgZ,EAAA3V,UAAA4Z,IAAAjE,EAAA3V,UAAAkW,eAEAP,EAAA3V,UAAA6Z,mBACA,SAAApU,GACA,IAAA2T,EAAAjC,EAAAja,EAGA,QAAA+H,KADAkS,EAAAxa,KAAA8Z,SAEA,OAAA9Z,KAGA,QAAAsI,IAAAkS,EAAAjB,eAUA,OATA,IAAA3X,UAAAZ,QACAhB,KAAA8Z,QAAA1W,OAAAuX,OAAA,MACA3a,KAAA+Z,aAAA,QACAzR,IAAAkS,EAAA1R,KACA,KAAA9I,KAAA+Z,aACA/Z,KAAA8Z,QAAA1W,OAAAuX,OAAA,aAEAH,EAAA1R,IAEA9I,KAIA,GAAA,IAAA4B,UAAAZ,OAAA,CACA,IACAwB,EADAmB,EAAAP,OAAAO,KAAA6W,GAEA,IAAAja,EAAA,EAAAA,EAAAoD,EAAA3C,SAAAT,EAEA,oBADAiC,EAAAmB,EAAApD,KAEAP,KAAAkd,mBAAA1a,GAKA,OAHAxC,KAAAkd,mBAAA,kBACAld,KAAA8Z,QAAA1W,OAAAuX,OAAA,MACA3a,KAAA+Z,aAAA,EACA/Z,IACA,CAIA,GAAA,mBAFAyc,EAAAjC,EAAA1R,IAGA9I,KAAAuZ,eAAAzQ,EAAA2T,QACA,QAAAnU,IAAAmU,EAEA,IAAAlc,EAAAkc,EAAAzb,OAAA,EAAAT,GAAA,EAAAA,IACAP,KAAAuZ,eAAAzQ,EAAA2T,EAAAlc,IAIA,OAAAP,IACA,EAmBAgZ,EAAA3V,UAAAoZ,UAAA,SAAA3T,GACA,OAAA2S,EAAAzb,KAAA8I,GAAA,EACA,EAEAkQ,EAAA3V,UAAA8Z,aAAA,SAAArU,GACA,OAAA2S,EAAAzb,KAAA8I,GAAA,EACA,EAEAkQ,EAAA8C,cAAA,SAAA5C,EAAApQ,GACA,MAAA,mBAAAoQ,EAAA4C,cACA5C,EAAA4C,cAAAhT,GAEAgT,EAAA/a,KAAAmY,EAAApQ,EAEA,EAEAkQ,EAAA3V,UAAAyY,cAAAA,EAiBA9C,EAAA3V,UAAA+Z,WAAA,WACA,OAAApd,KAAA+Z,aAAA,EAAAzB,EAAAtY,KAAA8Z,SAAA,EACA,CrBgzFA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASrZ,EAAQf,EAAOD,GsB7nGlCC,EAAAD;;;;;;;;AApFA,MAEA8T,YAAA8J,EAAAC,GAGAtd,KAAAud,UAAA,iBAAAF,EAAAA,EAAA,CAAA,EAKArd,KAAAwd,WAAAxd,KAAAyd,uBAIAzd,KAAA0d,OACA,CACA,QACA,QACA,OACA,OACA,QACA,QAEA,CAGAD,uBAEA,IAAAE,GAAA,IAAAC,MAAAC,UAWA,MAVA,0BAAA/O,QAAA,SACAgP,IAIA,IAAAC,GAAAJ,EAAA,GAAA3Z,KAAAga,UAAA,GAAA,EAGA,OAFAL,EAAA3Z,KAAAia,MAAAN,EAAA,KAEA,KAAAG,EAAAC,EAAA,EAAAA,EAAA,GAAAza,SAAA,GAAA,GAGA,CAEA4a,aAEA,CAGAC,MAAAC,EAAAC,GAEAre,KAAA4H,MAAA,QAAAwW,EAAAC,EACA,CAEAC,MAAAF,EAAAC,GAEAre,KAAA4H,MAAA,QAAAwW,EAAAC,EACA,CAEAE,KAAAH,EAAAC,GAEAre,KAAA4H,MAAA,OAAAwW,EAAAC,EACA,CAEAnD,KAAAkD,EAAAC,GAEAre,KAAA4H,MAAA,OAAAwW,EAAAC,EACA,CAEA7Q,MAAA4Q,EAAAC,GAEAre,KAAA4H,MAAA,QAAAwW,EAAAC,EACA,CAEAG,MAAAJ,EAAAC,GAEAre,KAAA4H,MAAA,QAAAwW,EAAAC,EACA,CAEAzW,MAAA6W,EAAAL,EAAAC,GAGA,OAAA,CACA,EtB+tGA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS5d,EAAQf,EAAOD,GuBpyGlCC,EAAAD,QAXAif,MAEA,IAAAC,EAAA,CAAA,EAMA,OAJAA,EAAApR,QAAA9M,EAAA,iCAEAke,EAAAC,QAAAD,EAAApR,QAEAoR,CAAA,EAGAD,EvB0zGA,EAAE,CAAC,gCAAgC,KAAK,GAAG,CAAC,SAASje,EAAQf,EAAOD,GwB90GpEC,EAAAD,QAAA,CACA,CACAof,WAAA,UACAC,WAAA,UACAC,MAAA,SxBk1GA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASte,EAAQf,EAAOD,GyBt1GlC,IAAAuf,EAAAve,EAAA,6BA+DAf,EAAAD,QA7DA,cAAAuf,EAEAzL,YAAA8J,EAAAC,GAEA2B,MAAA5B,GAEArd,KAAAkf,iBAAAlf,KAAAud,UAAA1Z,eAAA,mBAAA,GAAA7D,KAAAud,UAAA4B,eACAnf,KAAAof,sBAAApf,KAAAud,UAAA1Z,eAAA,wBAAA,GAAA7D,KAAAud,UAAA8B,oBAEArf,KAAAsf,gBAAAtf,KAAAud,UAAA1Z,eAAA,WAAA,IAAAa,OAAA1E,KAAAud,UAAAgC,QAAA,KACAjC,EAAAC,UAAA1Z,eAAA,WAAA,IAAAa,OAAA4Y,EAAAC,UAAAiC,QAAA,KACA,sBAGAxf,KAAAyf,0BAAAzf,KAAAud,UAAA1Z,eAAA,4BAAA7D,KAAAud,UAAAmC,wBACA1f,KAAA2f,yBAAA3f,KAAAud,UAAA1Z,eAAA,2BAAA7D,KAAAud,UAAAqC,uBAGA5f,KAAA6f,YAAA,CAAA,EACA,IAAA,IAAAtf,EAAA,EAAAA,GAAAP,KAAA0d,OAAA1c,OAAAT,IAEAP,KAAA6f,YAAA7f,KAAA0d,OAAAnd,IAAA,IAAAmE,OAAA1E,KAAA0d,OAAAnd,GAAA,MAAAmE,OAAA1E,KAAAsf,gBAAA,MAEAtf,KAAAkf,kBAGAlf,KAAA6f,YAAA7f,KAAA0d,OAAAnd,IAAA,IAAAP,KAAA6f,YAAA7f,KAAA0d,OAAAnd,IAGA,CAEAqH,MAAAkY,EAAA1B,EAAA2B,GAEA,IAAAC,EAAA,GACAhgB,KAAAkf,iBAAAlf,KAAAof,qBAEAY,GAAA,IAAApC,MAAAqC,cAEAjgB,KAAAkf,kBAEAc,GAAA,IAAApC,MAGA,IAAAsC,EAAA,GAAAxb,OAAAsb,GAAAtb,OAAA1E,KAAA6f,YAAAC,IAAApb,OAAA0Z,GAcA,OAZApe,KAAAyf,0BAEAlS,QAAA4S,IAAAD,GAIAlgB,KAAA2f,8BAAA,IAAAI,GAEAxS,QAAA4S,IAAAC,KAAAC,UAAAN,EAAA,KAAA,IAIAG,CACA,EzB21GA,EAAE,CAAC,4BAA4B,KAAK,GAAG,CAAC,SAASzf,EAAQf,EAAOD,G0Bv5GhE,MAAA6gB,EAAA7f,EAAA,iCACA8f,EAAA9f,EAAA,MACA+f,EAAA/f,EAAA,QAqHAf,EAAAD,QAnHA,cAAA6gB,EAEA/M,YAAA8J,EAAAC,GAEA2B,MAAA5B,EAAAC,GAGAtd,KAAAygB,eAAAzgB,KAAAud,UAAA1Z,eAAA,QAAA7D,KAAAud,UAAAmD,KAAA,KAAAhc,OAAA1E,KAAAsf,gBAAA,QACAtf,KAAA2gB,YAAAH,EAAAI,UAAA5gB,KAAAygB,gBAEAzgB,KAAA6gB,qBAAA7gB,KAAAud,UAAA1Z,eAAA,qBAAA7D,KAAAud,UAAAuD,kBACA,CACAnH,MAAA,IACAlS,SAAA,QAGAzH,KAAA+gB,WAAAR,EAAAS,kBAAAhhB,KAAA2gB,YAAA3gB,KAAA6gB,sBAEA7gB,KAAAihB,iBAAA,EAEAjhB,KAAAkhB,eAAA,GACAlhB,KAAAmhB,iBAAA,GAEAnhB,KAAAohB,6BAAA,OACAphB,KAAAqhB,2BAAA,MACA,CAEAC,YAAAC,GAEA,IAAAC,EAAA,mBAAAD,EAAAA,EAAA,OACA,GAAAvhB,KAAA+gB,WAGA,OADA/gB,KAAA+gB,WAAA3a,IAAA,MACApG,KAAA+gB,WAAAjf,KAAA,SAAA0f,EAAApL,KAAApW,MAEA,CAEAyhB,6BAAAC,GAEA1hB,KAAAihB,iBAAA,EACA,IAAAU,EAAA,mBAAAD,EAAAA,EAAA1hB,KAAAqhB,2BAEA,KAAArhB,KAAAkhB,eAAAlgB,OAAA,GAMA,OAAA2gB,IAJA3hB,KAAA4hB,qBAAAD,EAMA,CAEAC,qBAAAF,GAEA,IAAA1hB,KAAAihB,gBACA,CAEAjhB,KAAAihB,iBAAA,EAEA,IAAAU,EAAA,mBAAAD,EAAAA,EAAA1hB,KAAAqhB,2BAGAQ,EAAA7hB,KAAAkhB,eACAY,EAAA9hB,KAAAmhB,iBAGAnhB,KAAAkhB,eAAA,GACAlhB,KAAAmhB,iBAAA,GAGA,IAAAY,EAAA,GAEA,IAAA,IAAAxhB,EAAA,EAAAA,EAAAshB,EAAA7gB,OAAAT,IAGAwhB,GAAA,GAAArd,OAAAmd,EAAAthB,GAAA,OACA,IAAAuhB,EAAAvhB,KAEAwhB,GAAA,GAAArd,OAAAod,EAAAvhB,GAAA,OAIA,GAAAP,KAAA+gB,WAAAnZ,MAAAma,EAAA,QAOA,OAAA/hB,KAAAyhB,6BAAAE,GAJA3hB,KAAA+gB,WAAAjf,KAAA,QAAA9B,KAAAyhB,6BAAArL,KAAApW,KAAA2hB,GAMA,CACA,CAEA/Z,MAAAkY,EAAA1B,EAAA2B,GAEA,IAAAG,EAAAjB,MAAArX,MAAAkY,EAAA1B,EAAA2B,GAGA/f,KAAAkhB,eAAAne,KAAAmd,QAGA,IAAAH,EAEA/f,KAAAmhB,iBAAApe,KAAAqd,KAAAC,UAAAN,EAAA,KAAA,IAIA/f,KAAAmhB,iBAAApe,MAAA,GAGA/C,KAAA4hB,sBACA,E1B45GA,EAAE,CAAC,gCAAgC,GAAGI,GAAK,GAAGtB,KAAO,KAAK,GAAG,CAAC,SAASjgB,EAAQf,EAAOD;;;;;;;;;A2BjgHtF,MAAAwiB,EAEA1O,YAAA2O,EAAAC,GAEA,IAAAC,EAAA,iBAAAF,EAAAA,EAAA,CAAA,EACAliB,KAAAud,UAAA6E,EAEApiB,KAAAqiB,WAAA5hB,EAAA,wCAEAT,KAAAsiB,mBAAAF,EAAAve,eAAA,cAAAue,EAAAG,WAAA9hB,EAAA,mCAEAT,KAAAwiB,WAAA,GAIAxiB,KAAAyiB,aAAA,CAAA,EAGAziB,KAAA0iB,iBAAA,CAAA,EAEA1iB,KAAA2iB,gBAAA,GACA3iB,KAAA4iB,gBAAA,GACA5iB,KAAA6iB,eAAA,GACA7iB,KAAA8iB,eAAA,GACA9iB,KAAA+iB,gBAAA,GACA/iB,KAAAgjB,gBAAA,GAEAhjB,KAAAijB,eAAAC,GAAAA,EAEAljB,KAAAmjB,KAAA,iBAAAf,EAAA5C,QAAA4C,EAAA5C,QAAA,SACA,CAEA4D,UAAAC,EAAAvD,GAGA,GAAA9f,KAAA0iB,iBAAA7e,eAAAwf,EAAA7F,YAEA,OAAA,EAQA,OAJAxd,KAAAwiB,WAAAzf,KAAAsgB,GACArjB,KAAA0iB,iBAAAW,EAAA7F,aAAA,EAGAsC,GAEA,IAAA,QACA9f,KAAA2iB,gBAAA5f,KAAAsgB,GACA,IAAA,QACArjB,KAAA4iB,gBAAA7f,KAAAsgB,GACA,IAAA,OACArjB,KAAA6iB,eAAA9f,KAAAsgB,GACA,IAAA,OACArjB,KAAA8iB,eAAA/f,KAAAsgB,GACA,IAAA,QACArjB,KAAA+iB,gBAAAhgB,KAAAsgB,GACA,IAAA,QACArjB,KAAAgjB,gBAAAjgB,KAAAsgB,GAIA,OAAA,CACA,CAEAC,kBAAAC,GAIAvjB,KAAAijB,eAFA,mBAAAM,EAEAA,EAIAL,GAAAA,CAEA,CAEA/E,MAAAqF,EAAAN,GAEA,MAAAO,EAAAzjB,KAAAijB,eAAAC,GACA,IAAA,IAAA3iB,EAAA,EAAAA,EAAAP,KAAA2iB,gBAAA3hB,OAAAT,IAEAP,KAAA2iB,gBAAApiB,GAAA4d,MAAAqF,EAAAC,EAEA,CAEAnF,MAAAkF,EAAAN,GAEA,MAAAO,EAAAzjB,KAAAijB,eAAAC,GACA,IAAA,IAAA3iB,EAAA,EAAAA,EAAAP,KAAA4iB,gBAAA5hB,OAAAT,IAEAP,KAAA4iB,gBAAAriB,GAAA+d,MAAAkF,EAAAC,EAEA,CAEAlF,KAAAiF,EAAAN,GAEA,MAAAO,EAAAzjB,KAAAijB,eAAAC,GACA,IAAA,IAAA3iB,EAAA,EAAAA,EAAAP,KAAA6iB,eAAA7hB,OAAAT,IAEAP,KAAA6iB,eAAAtiB,GAAAge,KAAAiF,EAAAC,EAEA,CAEAvI,KAAAsI,EAAAN,GAEA,MAAAO,EAAAzjB,KAAAijB,eAAAC,GACA,IAAA,IAAA3iB,EAAA,EAAAA,EAAAP,KAAA8iB,eAAA9hB,OAAAT,IAEAP,KAAA8iB,eAAAviB,GAAA2a,KAAAsI,EAAAC,EAEA,CAEAjW,MAAAgW,EAAAN,GAEA,MAAAO,EAAAzjB,KAAAijB,eAAAC,GACA,IAAA,IAAA3iB,EAAA,EAAAA,EAAAP,KAAA+iB,gBAAA/hB,OAAAT,IAEAP,KAAA+iB,gBAAAxiB,GAAAiN,MAAAgW,EAAAC,EAEA,CAEAjF,MAAAgF,EAAAN,GAEA,MAAAO,EAAAzjB,KAAAijB,eAAAC,GACA,IAAA,IAAA3iB,EAAA,EAAAA,EAAAP,KAAAgjB,gBAAAhiB,OAAAT,IAEAP,KAAAgjB,gBAAAziB,GAAAie,MAAAgF,EAAAC,EAEA,CAEAvF,aAGA,IAAA,IAAA3d,EAAA,EAAAA,EAAAP,KAAAsiB,mBAAAthB,OAAAT,IACA,CACA,IAAAmjB,EAAAtgB,OAAAugB,OAAA,CAAA9E,WAAA,UAAAC,WAAA,UAAAC,MAAA,QAAA/e,KAAAsiB,mBAAA/hB,IAEAP,KAAAqiB,WAAAxe,eAAA6f,EAAA7E,YAMA7e,KAAAojB,UAAA,IAAApjB,KAAAqiB,WAAAqB,EAAA7E,YAAA6E,EAAA1jB,MAAA0jB,EAAA3E,OAJAxR,QAAA4S,IAAA,sEAAAzb,OAAA0b,KAAAC,UAAAqD,IAMA,CAGA,IAAA,IAAAnjB,EAAA,EAAAA,EAAAP,KAAAwiB,WAAAxhB,OAAAT,IAEAP,KAAAwiB,WAAAjiB,GAAA2d,YAEA,CAEA0F,QAAAJ,EAAAN,GAEA,IAAAW,OAAA,IAAAL,EAAAA,EAAA,OACAM,EAAA,IAAAlG,KACA5d,KAAAue,KAAA,GAAA7Z,OAAAmf,EAAA,KAAAnf,OAAAof,EAAA,YAAApf,QAAAof,EAAA,KAAAZ,EACA,CAGAa,eAEA,OAAA,IAAAnG,IACA,CAEAoG,aAAAC,GAGA,OADA,IAAArG,KACAqG,CACA,CAGAC,aAAAC,EAAAX,EAAAN,GAEA,IAAAW,OAAA,IAAAL,EAAAA,EAAA,mBAGAY,GAAA,IAAAxG,KAEA5d,KAAAue,KAAA,GAAA7Z,OAAAmf,EAAA,sBAAAnf,QAAA0f,EAAA,YAAA1f,OAAAyf,EAAA,OAAAjB,EACA,CAEAmB,kBAAAF,EAAAX,EAAAN,GAEA,IAAAW,OAAA,IAAAL,EAAAA,EAAA,mBAEAY,GAAA,IAAAxG,KAEA0G,EAAA/Y,SAAA4Y,EAAA,KACAI,EAAAhZ,SAAA4Y,EAAA,IAAA,IACAK,EAAAjZ,SAAA4Y,EAAA,IAAA,IACAM,EAAAlZ,SAAA4Y,EAAA,MAEAG,EAAAA,EAAA,GAAA,KAAAA,EAAAA,EAAA,IAAA,IAAAA,EAAAA,EACAC,EAAAA,EAAA,GAAA,IAAAA,EAAAA,EACAC,EAAAA,EAAA,GAAA,IAAAA,EAAAA,EACAC,EAAAA,EAAA,GAAA,IAAAA,EAAAA,EAEAzkB,KAAAue,KAAA,GAAA7Z,OAAAmf,EAAA,sBAAAnf,QAAA0f,EAAA,YAAA1f,OAAAyf,EAAA,YAAAzf,OAAA+f,EAAA,KAAA/f,OAAA8f,EAAA,KAAA9f,OAAA6f,EAAA,KAAA7f,OAAA4f,EAAA,KAAApB,EACA,CAEAwB,qBAAAC,EAAAnB,EAAAN,GAEAljB,KAAAkkB,aAAAlkB,KAAAgkB,aAAAW,GAAAnB,EAAAN,EACA,CAEA0B,0BAAAD,EAAAnB,EAAAN,GAEAljB,KAAAqkB,kBAAArkB,KAAAgkB,aAAAW,GAAAnB,EAAAN,EACA,EAUAxjB,EAAAD,QAAAwiB,EACAviB,EAAAD,QAAAolB,IAPA,SAAAC,GAEA,OAAA,IAAA7C,EAAA6C,EACA,EAKAplB,EAAAD,QAAAslB,gBAAAtkB,EAAA,6BACAf,EAAAD,QAAAulB,mBAAAvkB,EAAA,iCACAf,EAAAD,QAAAulB,mBAAAvkB,EAAA,uC3BmhHA,EAAE,CAAC,4BAA4B,GAAG,uCAAuC,GAAG,kCAAkC,GAAG,gCAAgC,GAAG,uCAAuC,KAAK,GAAG,CAAC,SAASA,EAAQf,EAAOD,G4BpwH5NC,EAAAD,QAAA,CACA+f,QAAA,sBACAyF,eAAA,QAEAC,YAAA,EAEA3C,WACA,CACA,CACAxD,MAAA,U5B0wHA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASte,EAAQf,EAAOD,IAClC,SAAW0lB,IAAS,W6BpuHpBzlB,EAAAD;;;;;;;;;;;AArCA,MAEA8T,YAAA6R,GAGAplB,KAAAqlB,kBAAA,IAAAD,EAAAE,UAGAtlB,KAAAqlB,kBAAAE,WAAA,KAAA,KACAC,IAEA,IAAAC,EAAAD,EAAAzW,OAEA2W,EAAAD,EAAAvf,QAAA,KAGAyf,EAAAF,EAAAnQ,UAAAoQ,EAAA,GAEAE,EAAAF,GAAA,EAAAD,EAAAnQ,UAAA,EAAAoQ,GAAAD,EAEA,OAAAN,EAAAU,IAAAhiB,eAAA+hB,GAEAT,EAAAU,IAAAD,GAIAD,CACA,GAEA,CAEAG,aAAAvR,GAEA,OAAAvU,KAAAqlB,kBAAAU,YAAAxR,EACA,E7ByxHC,GAAExT,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAElC,EAAE,CAACulB,SAAW,KAAK,GAAG,CAAC,SAASvlB,EAAQf,EAAOD;;;;;;;;;A8B/zH/C,MAAAwmB,EAAAxlB,EAAA,aACAylB,EAAAzlB,EAAA,yCAEA,MAAA0lB,EAEA5S,YAAA2O,GAGAliB,KAAAomB,aACA,CACAd,UAAAW,GAIAjmB,KAAAqmB,0BAAA,IAAAH,EAAAlmB,KAAAomB,cAGApmB,KAAAsmB,wBAAApE,GAEAliB,KAAA4e,QAAA5e,KAAAumB,uBAGA,IAAAnE,EAAApiB,KAAAwmB,MAAAtE,EAAAliB,KAAAumB,wBAKA,GAFAvmB,KAAAymB,KAAArG,KAAAsG,MAAAtG,KAAAC,UAAA+B,IAEAA,EAAAuE,kBAEA,IAGAvE,EAAApiB,KAAAwmB,MAAA/lB,EAAA2hB,EAAAuE,mBAAAvE,EACA,CACA,MAAAwE,GAIArZ,QAAA4S,IAAA,2HACA5S,QAAA4S,IAAA,2BAAAyG,EACA,CAGA,GAAAxE,EAAA8C,WAEA,IAGA9C,EAAApiB,KAAAwmB,MAAA/lB,EAAA2hB,EAAA8C,YAAA9C,EACA,CACA,MAAAwE,GAIArZ,QAAA4S,IAAA,mHACA5S,QAAA4S,IAAA,2BAAAyG,EACA,CAGA5mB,KAAA6mB,SAAAzE,CACA,CAGAmE,uBAEA,OAAAnG,KAAAsG,MAAAtG,KAAAC,UAAA5f,EAAA,6BACA,CAGA6lB,wBAAAxB,GAGA9kB,KAAA8mB,uBAAAhC,IAAA,IAAAA,EAAAiC,gBACA,CAGAC,YAAAlC,GAEA,IAAA,MAAAmC,KAAAnC,EAEA,iBAAAA,EAAAmC,GAEAjnB,KAAAgnB,YAAAlC,EAAAmC,IAEA,iBAAAnC,EAAAmC,KAEAnC,EAAAmC,GAAAjnB,KAAAqmB,0BAAAP,aAAAhB,EAAAmC,IAGA,CAKAC,UAAA3iB,GAEA,MAAA,iBAAAA,IAAArB,MAAAC,QAAAoB,EACA,CAKA4iB,kBAAAC,EAAApe,GAEA,GAAAA,GAAAhJ,KAAAknB,UAAAle,GAmBA,OAfA5F,OAAAO,KAAAqF,GAAAqe,SAAA7kB,IAEA,MAAA8kB,EAAAte,EAAAxG,GACA,GAAAxC,KAAAknB,UAAAI,GACA,CACA,MAAAC,EAAAH,EAAA5kB,GACA,GAAA+kB,GAAAvnB,KAAAknB,UAAAK,GAIA,YADAvnB,KAAAmnB,kBAAAI,EAAAD,EAGA,CACAF,EAAA5kB,GAAA8kB,CAAA,IAEAF,CACA,CAGAZ,MAAAgB,EAAAC,GAGA,IAAAC,EAAA,iBAAAF,EAAAA,EAAA,CAAA,EAEAG,EAAA,iBAAAF,EAAAA,EAAAznB,KAAA6mB,SAGAe,EAAAxH,KAAAsG,MAAAtG,KAAAC,UAAAqH,IAUA,OATAC,EAAA3nB,KAAAmnB,kBAAAQ,EAAAC,GAEA5nB,KAAA8mB,uBAEA9mB,KAAAgnB,YAAAW,GAGA3nB,KAAAsmB,wBAAAqB,GAEAA,CACA,CAGA3Z,KAAAwZ,GAGA,IAAAE,EAAA,iBAAAF,EAAAA,EAAA,CAAA,EAGAI,EAAAxH,KAAAsG,MAAAtG,KAAAC,UAAAqH,IAIA,OAFA1nB,KAAA6mB,SAAA7mB,KAAAmnB,kBAAAS,EAAA5nB,KAAA6mB,UAEA7mB,KAAA6mB,QACA,EASAnnB,EAAAD,QAAA0mB,EACAzmB,EAAAD,QAAAolB,IANA,SAAAC,GAEA,OAAA,IAAAqB,EAAArB,EACA,EAIAplB,EAAAD,QAAA6lB,UAAAW,C9B00HA,EAAE,CAAC,2BAA2B,GAAG,wCAAwC,GAAGX,UAAY,KAAK,GAAG,CAAC,SAAS7kB,EAAQf,EAAOD,G+B57HzHC,EAAAD;;;;;;;;AArDA,MAEA8T,cAKAvT,KAAA6nB,gBAAA,oBAAAC,QAAAA,OAAAD,iBAAAC,OAAAD,gBAAAzR,KAAA0R,SACA,oBAAAC,UAAA,mBAAAloB,OAAAkoB,SAAAF,iBAAAE,SAAAF,gBAAAzR,KAAA2R,SACA,CAGAC,sBAEA,IAAAC,EAAA,IAAAhiB,WAAA,IAGA,OADAjG,KAAA6nB,gBAAAI,GACAA,CACA,CAGAC,sBAIA,IAAAD,EAAA,IAAAhiB,WAAA,IAEA,IAAA,IAAA6Q,EAAAvW,EAAA,EAAAA,EAAA,GAAAA,IAEA,IAAA,EAAAA,KAEAuW,EAAA,WAAA9S,KAAAga,UAGAiK,EAAA1nB,GAAAuW,MAAA,EAAAvW,IAAA,GAAA,IAGA,OAAA0nB,CACA,CAEAE,WAEA,OAAAnoB,KAAA6nB,gBAEA7nB,KAAAgoB,sBAIAhoB,KAAAkoB,qBAEA,E/BogIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASznB,EAAQf,EAAOD;;;;;;;;;AgCnjIlC,IAAA2oB,EAAA3nB,EAAA,0BAEA,MAAA4nB,EAEA9U,YAAAuR,GAIA9kB,KAAAsoB,kBAAA,iBAAAxD,IAAAA,EAAAjhB,eAAA,oBAAA,GAAAihB,EAAAyD,eAGAvoB,KAAAwoB,YAAA,iBAAA1D,GAAAA,EAAAjhB,eAAA,cAAAihB,EAAA2D,WAAA,EAAA,EAEAzoB,KAAA0oB,sBAAA,iBAAA5D,GAAAA,EAAAjhB,eAAA,kBAAAihB,EAAA6D,eAAA,EAAA,iEAEA3oB,KAAA4oB,oBAAA,IAAAR,EAGApoB,KAAA6oB,WAAA,GACA,IAAA,IAAAtoB,EAAA,EAAAA,EAAA,MAAAA,EAEAP,KAAA6oB,WAAAtoB,IAAAA,EAAA,KAAA+C,SAAA,IAAAkI,OAAA,EAEA,CAGAsd,YAAAC,GAEA,IAAAxoB,EAAA,EAEA,MAAA,CACAP,KAAA6oB,WAAAE,EAAAxoB,MAAAP,KAAA6oB,WAAAE,EAAAxoB,MACAP,KAAA6oB,WAAAE,EAAAxoB,MAAAP,KAAA6oB,WAAAE,EAAAxoB,MAAA,IACAP,KAAA6oB,WAAAE,EAAAxoB,MAAAP,KAAA6oB,WAAAE,EAAAxoB,MAAA,IACAP,KAAA6oB,WAAAE,EAAAxoB,MAAAP,KAAA6oB,WAAAE,EAAAxoB,MAAA,IACAP,KAAA6oB,WAAAE,EAAAxoB,MAAAP,KAAA6oB,WAAAE,EAAAxoB,MAAA,IACAP,KAAA6oB,WAAAE,EAAAxoB,MAAAP,KAAA6oB,WAAAE,EAAAxoB,MAAAP,KAAA6oB,WAAAE,EAAAxoB,MAAAP,KAAA6oB,WAAAE,EAAAxoB,MAAAP,KAAA6oB,WAAAE,EAAAxoB,MAAAP,KAAA6oB,WAAAE,EAAAxoB,OACAyF,KAAA,GACA,CAGAgjB,iBAEA,IAAA9lB,MAAA,IACA,IAAA+lB,EAAAjpB,KAAA4oB,oBAAAT,WAMA,OAHAc,EAAA,GAAA,GAAAA,EAAA,GAAA,GACAA,EAAA,GAAA,GAAAA,EAAA,GAAA,IAEAjpB,KAAA8oB,YAAAG,EACA,CAGAC,iBAEA,IAAAC,EAAA,GAEA,IAAA,IAAA5oB,EAAA,EAAAA,EAAAP,KAAAwoB,YAAAjoB,IAEA4oB,GAAAnpB,KAAA0oB,sBAAAU,OAAAplB,KAAAia,MAAAja,KAAAga,UAAAhe,KAAA0oB,sBAAA1nB,OAAA,KAGA,OAAAmoB,CACA,CAGAE,UAEA,OAAArpB,KAAAsoB,gBAEAtoB,KAAAkpB,iBAIAlpB,KAAAgpB,gBAEA,EAUAtpB,EAAAD,QAAA4oB,EACA3oB,EAAAD,QAAAolB,IAPA,SAAAC,GAEA,OAAA,IAAAuD,EAAAvD,EACA,ChC0kIA,EAAE,CAAC,yBAAyB,KAAK,GAAG,CAAC,SAASrkB,EAAQf,EAAOD,GiC9qI7D,IAAA6pB,EAAA7oB,EAAA,QACA8oB,EAAA9oB,EAAA,OAEA+oB,EAAA9pB,EAAAD,QAEA,IAAA,IAAA+C,KAAA8mB,EACAA,EAAAzlB,eAAArB,KAAAgnB,EAAAhnB,GAAA8mB,EAAA9mB,IAaA,SAAAinB,EAAAC,GAOA,GANA,iBAAAA,IACAA,EAAAH,EAAA7C,MAAAgD,IAEAA,EAAAC,WACAD,EAAAC,SAAA,UAEA,WAAAD,EAAAC,SACA,MAAA,IAAA/oB,MAAA,aAAA8oB,EAAAC,SAAA,sCAEA,OAAAD,CACA,CArBAF,EAAAI,QAAA,SAAAF,EAAApoB,GAEA,OADAooB,EAAAD,EAAAC,GACAJ,EAAAM,QAAA7oB,KAAAf,KAAA0pB,EAAApoB,EACA,EAEAkoB,EAAA7b,IAAA,SAAA+b,EAAApoB,GAEA,OADAooB,EAAAD,EAAAC,GACAJ,EAAA3b,IAAA5M,KAAAf,KAAA0pB,EAAApoB,EACA,CjC8rIA,EAAE,CAACgoB,KAAO,GAAGC,IAAM,KAAK,GAAG,CAAC,SAAS9oB,EAAQf,EAAOD;;AkC9sIpDA,EAAAmL,KAAA,SAAAzC,EAAA+C,EAAA2e,EAAAC,EAAAC,GACA,IAAA5pB,EAAA+J,EACA8f,EAAA,EAAAD,EAAAD,EAAA,EACAG,GAAA,GAAAD,GAAA,EACAE,EAAAD,GAAA,EACAE,GAAA,EACA5pB,EAAAspB,EAAAE,EAAA,EAAA,EACAK,EAAAP,GAAA,EAAA,EACAQ,EAAAliB,EAAA+C,EAAA3K,GAOA,IALAA,GAAA6pB,EAEAjqB,EAAAkqB,GAAA,IAAAF,GAAA,EACAE,KAAAF,EACAA,GAAAH,EACAG,EAAA,EAAAhqB,EAAA,IAAAA,EAAAgI,EAAA+C,EAAA3K,GAAAA,GAAA6pB,EAAAD,GAAA,GAKA,IAHAjgB,EAAA/J,GAAA,IAAAgqB,GAAA,EACAhqB,KAAAgqB,EACAA,GAAAL,EACAK,EAAA,EAAAjgB,EAAA,IAAAA,EAAA/B,EAAA+C,EAAA3K,GAAAA,GAAA6pB,EAAAD,GAAA,GAEA,GAAA,IAAAhqB,EACAA,EAAA,EAAA+pB,MACA,IAAA/pB,IAAA8pB,EACA,OAAA/f,EAAAogB,IAAArX,KAAAoX,GAAA,EAAA,GAEAngB,GAAAlG,KAAA+M,IAAA,EAAA+Y,GACA3pB,GAAA+pB,CACA,CACA,OAAAG,GAAA,EAAA,GAAAngB,EAAAlG,KAAA+M,IAAA,EAAA5Q,EAAA2pB,EACA,EAEArqB,EAAAmI,MAAA,SAAAO,EAAA5D,EAAA2G,EAAA2e,EAAAC,EAAAC,GACA,IAAA5pB,EAAA+J,EAAA1J,EACAwpB,EAAA,EAAAD,EAAAD,EAAA,EACAG,GAAA,GAAAD,GAAA,EACAE,EAAAD,GAAA,EACAM,EAAA,KAAAT,EAAA9lB,KAAA+M,IAAA,GAAA,IAAA/M,KAAA+M,IAAA,GAAA,IAAA,EACAxQ,EAAAspB,EAAA,EAAAE,EAAA,EACAK,EAAAP,EAAA,GAAA,EACAQ,EAAA9lB,EAAA,GAAA,IAAAA,GAAA,EAAAA,EAAA,EAAA,EAAA,EAmCA,IAjCAA,EAAAP,KAAAwmB,IAAAjmB,GAEAmS,MAAAnS,IAAAA,IAAA0O,KACA/I,EAAAwM,MAAAnS,GAAA,EAAA,EACApE,EAAA8pB,IAEA9pB,EAAA6D,KAAAia,MAAAja,KAAAmc,IAAA5b,GAAAP,KAAAymB,KACAlmB,GAAA/D,EAAAwD,KAAA+M,IAAA,GAAA5Q,IAAA,IACAA,IACAK,GAAA,IAGA+D,GADApE,EAAA+pB,GAAA,EACAK,EAAA/pB,EAEA+pB,EAAAvmB,KAAA+M,IAAA,EAAA,EAAAmZ,IAEA1pB,GAAA,IACAL,IACAK,GAAA,GAGAL,EAAA+pB,GAAAD,GACA/f,EAAA,EACA/J,EAAA8pB,GACA9pB,EAAA+pB,GAAA,GACAhgB,GAAA3F,EAAA/D,EAAA,GAAAwD,KAAA+M,IAAA,EAAA+Y,GACA3pB,GAAA+pB,IAEAhgB,EAAA3F,EAAAP,KAAA+M,IAAA,EAAAmZ,EAAA,GAAAlmB,KAAA+M,IAAA,EAAA+Y,GACA3pB,EAAA,IAIA2pB,GAAA,EAAA3hB,EAAA+C,EAAA3K,GAAA,IAAA2J,EAAA3J,GAAA6pB,EAAAlgB,GAAA,IAAA4f,GAAA,GAIA,IAFA3pB,EAAAA,GAAA2pB,EAAA5f,EACA8f,GAAAF,EACAE,EAAA,EAAA7hB,EAAA+C,EAAA3K,GAAA,IAAAJ,EAAAI,GAAA6pB,EAAAjqB,GAAA,IAAA6pB,GAAA,GAEA7hB,EAAA+C,EAAA3K,EAAA6pB,IAAA,IAAAC,CACA,ClCktIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS5pB,EAAQf,EAAOD,GmCtyIlC,mBAAA2D,OAAAuX,OAEAjb,EAAAD,QAAA,SAAAirB,EAAAC,GACAA,IACAD,EAAAE,OAAAD,EACAD,EAAArnB,UAAAD,OAAAuX,OAAAgQ,EAAAtnB,UAAA,CACAkQ,YAAA,CACAhP,MAAAmmB,EACAhd,YAAA,EACAI,UAAA,EACAD,cAAA,KAIA,EAGAnO,EAAAD,QAAA,SAAAirB,EAAAC,GACA,GAAAA,EAAA,CACAD,EAAAE,OAAAD,EACA,IAAAE,EAAA,WAAA,EACAA,EAAAxnB,UAAAsnB,EAAAtnB,UACAqnB,EAAArnB,UAAA,IAAAwnB,EACAH,EAAArnB,UAAAkQ,YAAAmX,CACA,CACA,CnC0yIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASjqB,EAAQf,EAAOD,GoCn0IlC,IAAAqrB,EAAArqB,EAAA,UAoBA,SAAAqB,EAAAJ,GACA,IAAAlC,EAAA,SAAAA,IACA,OAAAA,EAAAurB,OAAAvrB,EAAA+E,OACA/E,EAAAurB,QAAA,EACAvrB,EAAA+E,MAAA7C,EAAAC,MAAA3B,KAAA4B,WACA,EAEA,OADApC,EAAAurB,QAAA,EACAvrB,CACA,CAEA,SAAAwrB,EAAAtpB,GACA,IAAAlC,EAAA,SAAAA,IACA,GAAAA,EAAAurB,OACA,MAAA,IAAAnqB,MAAApB,EAAAyrB,WAEA,OADAzrB,EAAAurB,QAAA,EACAvrB,EAAA+E,MAAA7C,EAAAC,MAAA3B,KAAA4B,UACA,EACA4R,EAAA9R,EAAA8R,MAAA,+BAGA,OAFAhU,EAAAyrB,UAAAzX,EAAA,sCACAhU,EAAAurB,QAAA,EACAvrB,CACA,CAxCAE,EAAAD,QAAAqrB,EAAAhpB,GACApC,EAAAD,QAAAyrB,OAAAJ,EAAAE,GAEAlpB,EAAAqpB,MAAArpB,GAAA,WACAsB,OAAAqK,eAAAkL,SAAAtV,UAAA,OAAA,CACAkB,MAAA,WACA,OAAAzC,EAAA9B,KACA,EACA6N,cAAA,IAGAzK,OAAAqK,eAAAkL,SAAAtV,UAAA,aAAA,CACAkB,MAAA,WACA,OAAAymB,EAAAhrB,KACA,EACA6N,cAAA,GAEA,GpC61IA,EAAE,CAACid,OAAS,KAAK,GAAG,CAAC,SAASrqB,EAAQf,EAAOD,IAC7C,SAAW0lB,IAAS,WqCt1IpB,SAAAiG,EAAA1K,GACA,GAAA,iBAAAA,EACA,MAAA,IAAArZ,UAAA,mCAAA+Y,KAAAC,UAAAK,GAEA,CAGA,SAAA2K,EAAA3K,EAAA4K,GAMA,IALA,IAIAzqB,EAJA0L,EAAA,GACAgf,EAAA,EACAC,GAAA,EACAC,EAAA,EAEAlrB,EAAA,EAAAA,GAAAmgB,EAAA1f,SAAAT,EAAA,CACA,GAAAA,EAAAmgB,EAAA1f,OACAH,EAAA6f,EAAAnb,WAAAhF,OACA,IAAA,KAAAM,EACA,MAEAA,EAAA,EAAA,CACA,GAAA,KAAAA,EAAA,CACA,GAAA2qB,IAAAjrB,EAAA,GAAA,IAAAkrB,QAEA,GAAAD,IAAAjrB,EAAA,GAAA,IAAAkrB,EAAA,CACA,GAAAlf,EAAAvL,OAAA,GAAA,IAAAuqB,GAAA,KAAAhf,EAAAhH,WAAAgH,EAAAvL,OAAA,IAAA,KAAAuL,EAAAhH,WAAAgH,EAAAvL,OAAA,GACA,GAAAuL,EAAAvL,OAAA,EAAA,CACA,IAAA0qB,EAAAnf,EAAAhC,YAAA,KACA,GAAAmhB,IAAAnf,EAAAvL,OAAA,EAAA,EACA,IAAA0qB,GACAnf,EAAA,GACAgf,EAAA,GAGAA,GADAhf,EAAAA,EAAA1E,MAAA,EAAA6jB,IACA1qB,OAAA,EAAAuL,EAAAhC,YAAA,KAEAihB,EAAAjrB,EACAkrB,EAAA,EACA,QACA,CACA,MAAA,GAAA,IAAAlf,EAAAvL,QAAA,IAAAuL,EAAAvL,OAAA,CACAuL,EAAA,GACAgf,EAAA,EACAC,EAAAjrB,EACAkrB,EAAA,EACA,QACA,CAEAH,IACA/e,EAAAvL,OAAA,EACAuL,GAAA,MAEAA,EAAA,KACAgf,EAAA,EAEA,MACAhf,EAAAvL,OAAA,EACAuL,GAAA,IAAAmU,EAAA7Y,MAAA2jB,EAAA,EAAAjrB,GAEAgM,EAAAmU,EAAA7Y,MAAA2jB,EAAA,EAAAjrB,GACAgrB,EAAAhrB,EAAAirB,EAAA,EAEAA,EAAAjrB,EACAkrB,EAAA,CACA,MAAA,KAAA5qB,IAAA,IAAA4qB,IACAA,EAEAA,GAAA,CAEA,CACA,OAAAlf,CACA,CAcA,IAAAof,EAAA,CAEAvS,QAAA,WAKA,IAJA,IAEAwS,EAFAC,EAAA,GACAC,GAAA,EAGAvrB,EAAAqB,UAAAZ,OAAA,EAAAT,IAAA,IAAAurB,EAAAvrB,IAAA,CACA,IAAAmgB,EACAngB,GAAA,EACAmgB,EAAA9e,UAAArB,SAEA+H,IAAAsjB,IACAA,EAAAzG,EAAAyG,OACAlL,EAAAkL,GAGAR,EAAA1K,GAGA,IAAAA,EAAA1f,SAIA6qB,EAAAnL,EAAA,IAAAmL,EACAC,EAAA,KAAApL,EAAAnb,WAAA,GACA,CAQA,OAFAsmB,EAAAR,EAAAQ,GAAAC,GAEAA,EACAD,EAAA7qB,OAAA,EACA,IAAA6qB,EAEA,IACAA,EAAA7qB,OAAA,EACA6qB,EAEA,GAEA,EAEAjL,UAAA,SAAAF,GAGA,GAFA0K,EAAA1K,GAEA,IAAAA,EAAA1f,OAAA,MAAA,IAEA,IAAA+qB,EAAA,KAAArL,EAAAnb,WAAA,GACAymB,EAAA,KAAAtL,EAAAnb,WAAAmb,EAAA1f,OAAA,GAQA,OAHA,KAFA0f,EAAA2K,EAAA3K,GAAAqL,IAEA/qB,QAAA+qB,IAAArL,EAAA,KACAA,EAAA1f,OAAA,GAAAgrB,IAAAtL,GAAA,KAEAqL,EAAA,IAAArL,EACAA,CACA,EAEAqL,WAAA,SAAArL,GAEA,OADA0K,EAAA1K,GACAA,EAAA1f,OAAA,GAAA,KAAA0f,EAAAnb,WAAA,EACA,EAEAS,KAAA,WACA,GAAA,IAAApE,UAAAZ,OACA,MAAA,IAEA,IADA,IAAAirB,EACA1rB,EAAA,EAAAA,EAAAqB,UAAAZ,SAAAT,EAAA,CACA,IAAA4G,EAAAvF,UAAArB,GACA6qB,EAAAjkB,GACAA,EAAAnG,OAAA,SACAsH,IAAA2jB,EACAA,EAAA9kB,EAEA8kB,GAAA,IAAA9kB,EAEA,CACA,YAAAmB,IAAA2jB,EACA,IACAN,EAAA/K,UAAAqL,EACA,EAEAC,SAAA,SAAA3kB,EAAA4kB,GAIA,GAHAf,EAAA7jB,GACA6jB,EAAAe,GAEA5kB,IAAA4kB,EAAA,MAAA,GAKA,IAHA5kB,EAAAokB,EAAAvS,QAAA7R,OACA4kB,EAAAR,EAAAvS,QAAA+S,IAEA,MAAA,GAIA,IADA,IAAAC,EAAA,EACAA,EAAA7kB,EAAAvG,QACA,KAAAuG,EAAAhC,WAAA6mB,KADAA,GASA,IALA,IAAAC,EAAA9kB,EAAAvG,OACAsrB,EAAAD,EAAAD,EAGAG,EAAA,EACAA,EAAAJ,EAAAnrB,QACA,KAAAmrB,EAAA5mB,WAAAgnB,KADAA,GAWA,IAPA,IACAC,EADAL,EAAAnrB,OACAurB,EAGAvrB,EAAAsrB,EAAAE,EAAAF,EAAAE,EACAC,GAAA,EACAlsB,EAAA,EACAA,GAAAS,IAAAT,EAAA,CACA,GAAAA,IAAAS,EAAA,CACA,GAAAwrB,EAAAxrB,EAAA,CACA,GAAA,KAAAmrB,EAAA5mB,WAAAgnB,EAAAhsB,GAGA,OAAA4rB,EAAAtkB,MAAA0kB,EAAAhsB,EAAA,GACA,GAAA,IAAAA,EAGA,OAAA4rB,EAAAtkB,MAAA0kB,EAAAhsB,EAEA,MAAA+rB,EAAAtrB,IACA,KAAAuG,EAAAhC,WAAA6mB,EAAA7rB,GAGAksB,EAAAlsB,EACA,IAAAA,IAGAksB,EAAA,IAGA,KACA,CACA,IAAAC,EAAAnlB,EAAAhC,WAAA6mB,EAAA7rB,GAEA,GAAAmsB,IADAP,EAAA5mB,WAAAgnB,EAAAhsB,GAEA,MACA,KAAAmsB,IACAD,EAAAlsB,EACA,CAEA,IAAAmP,EAAA,GAGA,IAAAnP,EAAA6rB,EAAAK,EAAA,EAAAlsB,GAAA8rB,IAAA9rB,EACAA,IAAA8rB,GAAA,KAAA9kB,EAAAhC,WAAAhF,KACA,IAAAmP,EAAA1O,OACA0O,GAAA,KAEAA,GAAA,OAMA,OAAAA,EAAA1O,OAAA,EACA0O,EAAAyc,EAAAtkB,MAAA0kB,EAAAE,IAEAF,GAAAE,EACA,KAAAN,EAAA5mB,WAAAgnB,MACAA,EACAJ,EAAAtkB,MAAA0kB,GAEA,EAEAI,UAAA,SAAAjM,GACA,OAAAA,CACA,EAEAkM,QAAA,SAAAlM,GAEA,GADA0K,EAAA1K,GACA,IAAAA,EAAA1f,OAAA,MAAA,IAKA,IAJA,IAAAH,EAAA6f,EAAAnb,WAAA,GACAsnB,EAAA,KAAAhsB,EACAuF,GAAA,EACA0mB,GAAA,EACAvsB,EAAAmgB,EAAA1f,OAAA,EAAAT,GAAA,IAAAA,EAEA,GAAA,MADAM,EAAA6f,EAAAnb,WAAAhF,KAEA,IAAAusB,EAAA,CACA1mB,EAAA7F,EACA,KACA,OAGAusB,GAAA,EAIA,OAAA,IAAA1mB,EAAAymB,EAAA,IAAA,IACAA,GAAA,IAAAzmB,EAAA,KACAsa,EAAA7Y,MAAA,EAAAzB,EACA,EAEA2mB,SAAA,SAAArM,EAAA5Q,GACA,QAAAxH,IAAAwH,GAAA,iBAAAA,EAAA,MAAA,IAAAzI,UAAA,mCACA+jB,EAAA1K,GAEA,IAGAngB,EAHA4F,EAAA,EACAC,GAAA,EACA0mB,GAAA,EAGA,QAAAxkB,IAAAwH,GAAAA,EAAA9O,OAAA,GAAA8O,EAAA9O,QAAA0f,EAAA1f,OAAA,CACA,GAAA8O,EAAA9O,SAAA0f,EAAA1f,QAAA8O,IAAA4Q,EAAA,MAAA,GACA,IAAAsM,EAAAld,EAAA9O,OAAA,EACAisB,GAAA,EACA,IAAA1sB,EAAAmgB,EAAA1f,OAAA,EAAAT,GAAA,IAAAA,EAAA,CACA,IAAAM,EAAA6f,EAAAnb,WAAAhF,GACA,GAAA,KAAAM,GAGA,IAAAisB,EAAA,CACA3mB,EAAA5F,EAAA,EACA,KACA,OAEA,IAAA0sB,IAGAH,GAAA,EACAG,EAAA1sB,EAAA,GAEAysB,GAAA,IAEAnsB,IAAAiP,EAAAvK,WAAAynB,IACA,KAAAA,IAGA5mB,EAAA7F,IAKAysB,GAAA,EACA5mB,EAAA6mB,GAIA,CAGA,OADA9mB,IAAAC,EAAAA,EAAA6mB,GAAA,IAAA7mB,IAAAA,EAAAsa,EAAA1f,QACA0f,EAAA7Y,MAAA1B,EAAAC,EACA,CACA,IAAA7F,EAAAmgB,EAAA1f,OAAA,EAAAT,GAAA,IAAAA,EACA,GAAA,KAAAmgB,EAAAnb,WAAAhF,IAGA,IAAAusB,EAAA,CACA3mB,EAAA5F,EAAA,EACA,KACA,OACA,IAAA6F,IAGA0mB,GAAA,EACA1mB,EAAA7F,EAAA,GAIA,OAAA,IAAA6F,EAAA,GACAsa,EAAA7Y,MAAA1B,EAAAC,EAEA,EAEA8mB,QAAA,SAAAxM,GACA0K,EAAA1K,GAQA,IAPA,IAAAyM,GAAA,EACAC,EAAA,EACAhnB,GAAA,EACA0mB,GAAA,EAGAO,EAAA,EACA9sB,EAAAmgB,EAAA1f,OAAA,EAAAT,GAAA,IAAAA,EAAA,CACA,IAAAM,EAAA6f,EAAAnb,WAAAhF,GACA,GAAA,KAAAM,GASA,IAAAuF,IAGA0mB,GAAA,EACA1mB,EAAA7F,EAAA,GAEA,KAAAM,GAEA,IAAAssB,EACAA,EAAA5sB,EACA,IAAA8sB,IACAA,EAAA,IACA,IAAAF,IAGAE,GAAA,QArBA,IAAAP,EAAA,CACAM,EAAA7sB,EAAA,EACA,KACA,CAoBA,CAEA,OAAA,IAAA4sB,IAAA,IAAA/mB,GAEA,IAAAinB,GAEA,IAAAA,GAAAF,IAAA/mB,EAAA,GAAA+mB,IAAAC,EAAA,EACA,GAEA1M,EAAA7Y,MAAAslB,EAAA/mB,EACA,EAEAknB,OAAA,SAAAC,GACA,GAAA,OAAAA,GAAA,iBAAAA,EACA,MAAA,IAAAlmB,UAAA,0EAAAkmB,GAEA,OAvVA,SAAAC,EAAAD,GACA,IAAAljB,EAAAkjB,EAAAljB,KAAAkjB,EAAAE,KACAhH,EAAA8G,EAAA9G,OAAA8G,EAAA/Z,MAAA,KAAA+Z,EAAAzd,KAAA,IACA,OAAAzF,EAGAA,IAAAkjB,EAAAE,KACApjB,EAAAoc,EAEApc,EAAAmjB,EAAA/G,EALAA,CAMA,CA6UAiH,CAAA,IAAAH,EACA,EAEA7G,MAAA,SAAAhG,GACA0K,EAAA1K,GAEA,IAAAjR,EAAA,CAAAge,KAAA,GAAApjB,IAAA,GAAAoc,KAAA,GAAA3W,IAAA,GAAA0D,KAAA,IACA,GAAA,IAAAkN,EAAA1f,OAAA,OAAAyO,EACA,IAEAtJ,EAFAtF,EAAA6f,EAAAnb,WAAA,GACAwmB,EAAA,KAAAlrB,EAEAkrB,GACAtc,EAAAge,KAAA,IACAtnB,EAAA,GAEAA,EAAA,EAaA,IAXA,IAAAgnB,GAAA,EACAC,EAAA,EACAhnB,GAAA,EACA0mB,GAAA,EACAvsB,EAAAmgB,EAAA1f,OAAA,EAIAqsB,EAAA,EAGA9sB,GAAA4F,IAAA5F,EAEA,GAAA,MADAM,EAAA6f,EAAAnb,WAAAhF,KAUA,IAAA6F,IAGA0mB,GAAA,EACA1mB,EAAA7F,EAAA,GAEA,KAAAM,GAEA,IAAAssB,EAAAA,EAAA5sB,EAAA,IAAA8sB,IAAAA,EAAA,IACA,IAAAF,IAGAE,GAAA,QAlBA,IAAAP,EAAA,CACAM,EAAA7sB,EAAA,EACA,KACA,CAwCA,OArBA,IAAA4sB,IAAA,IAAA/mB,GAEA,IAAAinB,GAEA,IAAAA,GAAAF,IAAA/mB,EAAA,GAAA+mB,IAAAC,EAAA,GACA,IAAAhnB,IACAqJ,EAAAgX,KAAAhX,EAAA+D,KAAA,IAAA4Z,GAAArB,EAAArL,EAAA7Y,MAAA,EAAAzB,GAAAsa,EAAA7Y,MAAAulB,EAAAhnB,KAGA,IAAAgnB,GAAArB,GACAtc,EAAA+D,KAAAkN,EAAA7Y,MAAA,EAAAslB,GACA1d,EAAAgX,KAAA/F,EAAA7Y,MAAA,EAAAzB,KAEAqJ,EAAA+D,KAAAkN,EAAA7Y,MAAAulB,EAAAD,GACA1d,EAAAgX,KAAA/F,EAAA7Y,MAAAulB,EAAAhnB,IAEAqJ,EAAAK,IAAA4Q,EAAA7Y,MAAAslB,EAAA/mB,IAGAgnB,EAAA,EAAA3d,EAAApF,IAAAqW,EAAA7Y,MAAA,EAAAulB,EAAA,GAAArB,IAAAtc,EAAApF,IAAA,KAEAoF,CACA,EAEA+d,IAAA,IACAG,UAAA,IACAC,MAAA,KACAjC,MAAA,MAGAA,EAAAA,MAAAA,EAEAjsB,EAAAD,QAAAksB,CrCm3IC,GAAE5qB,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAElC,EAAE,CAACulB,SAAW,KAAK,GAAG,CAAC,SAASvlB,EAAQf,EAAOD;;;;;;;;;;AsC53J/C,IAAAouB,EAAAptB,EAAA,iBACAqtB,EAAArtB,EAAA,qBA0CAf,EAAAD,QAxCA,MAKA8T,cAEAvT,KAAA+tB,SAAA,IAAAF,EAEA7tB,KAAAguB,aAAA,IAAAF,EAEA9tB,KAAAiuB,UAAAjuB,KAAA+tB,SAAAE,SACA,CAUA1I,WAAA2I,EAAAC,EAAAC,GAEA,OAAApuB,KAAA+tB,SAAAxI,WAAA2I,EAAAC,EAAAC,EACA,CASArI,YAAAxR,EAAA8Z,GAEA,OAAAruB,KAAAguB,aAAAjI,YAAAxR,EAAAvU,KAAAiuB,UAAAI,EACA,EtC24JA,EAAE,CAAC,oBAAoB,GAAG,gBAAgB,KAAK,GAAG,CAAC,SAAS5tB,EAAQf,EAAOD,GuChxJ3EC,EAAAD;;;;;;;;;;AAlKA,MAKA8T,cAEA,CASA+a,eAAAC,GAEA,MACA,CACAN,UAAAM,EAEAC,OAAA,GACAC,aAAA,GAEAC,SAAA,EAEAC,cAAA,EACAC,yBAAA,GAEA,CAUAC,WAAAC,EAAAC,GAEAA,EAAAJ,aAAAG,EAGAC,EAAAJ,aAAA9qB,eAAA,gBAGAkrB,EAAAL,QAAAK,EAAAJ,aAEA,CAUAK,mBAAAlR,EAAAiR,GAEAA,EAAAN,cAAA3Q,CACA,CAQAmR,kBAAAF,GAEAA,EAAAP,QAAAO,EAAAN,aACAM,EAAAN,aAAA,EACA,CASAS,gBAAAH,EAAAV,GAEAU,EAAAN,aAAAztB,QAAA+tB,EAAAL,QAAAS,WAAAnuB,OAAA+tB,EAAAL,QAAAU,aAAApuB,QACA+tB,EAAAN,aAAAjjB,QAAAujB,EAAAL,QAAAS,WAAAnuB,UAAA+tB,EAAAL,QAAAS,aAIAJ,EAAAN,aAAAM,EAAAL,QAAAW,MAAAN,EAAAN,aAAAjjB,OAAAujB,EAAAL,QAAAU,aAAApuB,OAAA+tB,EAAAN,aAAAztB,QAAA+tB,EAAAL,QAAAU,aAAApuB,OAAA+tB,EAAAL,QAAAS,WAAAnuB,SAAAqtB,GAEAruB,KAAAivB,kBAAAF,GAEAA,EAAAL,SAAA,EACAK,EAAAJ,cAAA,EAEA,CASAW,eAAAxR,EAAAiR,EAAAV,IAGAU,EAAAJ,cAAAI,EAAAd,UAAApqB,eAAAia,IAGA9d,KAAA6uB,WAAAE,EAAAd,UAAAnQ,GAAAiR,GACA/uB,KAAAgvB,mBAAAlR,EAAAiR,IAGAA,EAAAJ,cAGAI,EAAAJ,aAAA9qB,eAAAia,IAGA9d,KAAA6uB,WAAAE,EAAAJ,aAAA7Q,GAAAiR,GAEA/uB,KAAAgvB,mBAAAlR,EAAAiR,GACAA,EAAAL,SAGA1uB,KAAAkvB,gBAAAH,EAAAV,IAMAU,EAAAP,QAAA1Q,CAEA,CASAiI,YAAAxR,EAAAga,EAAAF,GAEA,IAAAkB,EAAAvvB,KAAAsuB,eAAAC,GAEA,IAAA,IAAAhuB,EAAA,EAAAA,EAAAgU,EAAAvT,OAAAT,IAGAP,KAAAsvB,eAAA/a,EAAAhU,GAAAgvB,EAAAlB,GAKA,OAFAruB,KAAAivB,kBAAAM,GAEAA,EAAAf,MACA,EvCk8JA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS/tB,EAAQf,EAAOD,GwCviKlCC,EAAAD;;;;;;;;;;AA1DA,MAKA8T,cAEAvT,KAAAiuB,UAAA,CAAA,CACA,CAWAuB,SAAAC,EAAAC,EAAAC,GAKA,OAHAF,EAAA5rB,eAAA6rB,EAAAC,MACAF,EAAAC,EAAAC,IAAA,CAAA,GAEAF,EAAAC,EAAAC,GACA,CASApK,WAAA2I,EAAAC,EAAAC,GAEA,GAAAF,EAAAltB,OAAA,EACA,OAAA,EAEA,GAAA,iBAAAmtB,GAAAA,EAAAntB,OAAA,EACA,OAAA,EAEA,IAAA4uB,EAAA5vB,KAAAiuB,UAGA,IAAA,IAAA1tB,EAAA,EAAAA,EAAA2tB,EAAAltB,OAAAT,IACAqvB,EAAA5vB,KAAAwvB,SAAAI,EAAA1B,EAAA3tB,GAQA,OANAqvB,EAAAR,aAAAlB,EACA0B,EAAAT,WAAA,iBAAAhB,GAAAA,EAAAntB,OAAA,EAAAmtB,EAAAD,EACA0B,EAAAP,MAAA,mBAAAjB,EAAAA,EACA,iBAAAA,EAAA,IAAAA,EACAC,GAAAA,GAEA,CACA,ExCinKA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS5tB,EAAQf,EAAOD,GyCjrKlC,IAOAowB,EACAC,EARA3K,EAAAzlB,EAAAD,QAAA,CAAA,EAUA,SAAAswB,IACA,MAAA,IAAAnvB,MAAA,kCACA,CACA,SAAAovB,IACA,MAAA,IAAApvB,MAAA,oCACA,CAqBA,SAAAqvB,EAAAC,GACA,GAAAL,IAAAxrB,WAEA,OAAAA,WAAA6rB,EAAA,GAGA,IAAAL,IAAAE,IAAAF,IAAAxrB,WAEA,OADAwrB,EAAAxrB,WACAA,WAAA6rB,EAAA,GAEA,IAEA,OAAAL,EAAAK,EAAA,EACA,CAAA,MAAA/vB,GACA,IAEA,OAAA0vB,EAAA9uB,KAAA,KAAAmvB,EAAA,EACA,CAAA,MAAA/vB,GAEA,OAAA0vB,EAAA9uB,KAAAf,KAAAkwB,EAAA,EACA,CACA,CAGA,EA5CA,WACA,IAEAL,EADA,mBAAAxrB,WACAA,WAEA0rB,CAEA,CAAA,MAAA5vB,GACA0vB,EAAAE,CACA,CACA,IAEAD,EADA,mBAAAK,aACAA,aAEAH,CAEA,CAAA,MAAA7vB,GACA2vB,EAAAE,CACA,CACA,CAnBA,GAwEA,IAEAI,EAFAC,EAAA,GACAC,GAAA,EAEAC,GAAA,EAEA,SAAAC,IACAF,GAAAF,IAGAE,GAAA,EACAF,EAAApvB,OACAqvB,EAAAD,EAAA1rB,OAAA2rB,GAEAE,GAAA,EAEAF,EAAArvB,QACAyvB,IAEA,CAEA,SAAAA,IACA,IAAAH,EAAA,CAGA,IAAAI,EAAAT,EAAAO,GACAF,GAAA,EAGA,IADA,IAAA5sB,EAAA2sB,EAAArvB,OACA0C,GAAA,CAGA,IAFA0sB,EAAAC,EACAA,EAAA,KACAE,EAAA7sB,GACA0sB,GACAA,EAAAG,GAAAI,MAGAJ,GAAA,EACA7sB,EAAA2sB,EAAArvB,MACA,CACAovB,EAAA,KACAE,GAAA,EAnEA,SAAAM,GACA,GAAAd,IAAAK,aAEA,OAAAA,aAAAS,GAGA,IAAAd,IAAAE,IAAAF,IAAAK,aAEA,OADAL,EAAAK,aACAA,aAAAS,GAEA,IAEA,OAAAd,EAAAc,EACA,CAAA,MAAAzwB,GACA,IAEA,OAAA2vB,EAAA/uB,KAAA,KAAA6vB,EACA,CAAA,MAAAzwB,GAGA,OAAA2vB,EAAA/uB,KAAAf,KAAA4wB,EACA,CACA,CAIA,CA0CAC,CAAAH,EAlBA,CAmBA,CAgBA,SAAAI,EAAAZ,EAAA9nB,GACApI,KAAAkwB,IAAAA,EACAlwB,KAAAoI,MAAAA,CACA,CAWA,SAAArG,IAAA,CA5BAojB,EAAA4L,SAAA,SAAAb,GACA,IAAAttB,EAAA,IAAAM,MAAAtB,UAAAZ,OAAA,GACA,GAAAY,UAAAZ,OAAA,EACA,IAAA,IAAAT,EAAA,EAAAA,EAAAqB,UAAAZ,OAAAT,IACAqC,EAAArC,EAAA,GAAAqB,UAAArB,GAGA8vB,EAAAttB,KAAA,IAAA+tB,EAAAZ,EAAAttB,IACA,IAAAytB,EAAArvB,QAAAsvB,GACAL,EAAAQ,EAEA,EAOAK,EAAAztB,UAAAstB,IAAA,WACA3wB,KAAAkwB,IAAAvuB,MAAA,KAAA3B,KAAAoI,MACA,EACA+c,EAAA6L,MAAA,UACA7L,EAAA8L,SAAA,EACA9L,EAAAU,IAAA,CAAA,EACAV,EAAA+L,KAAA,GACA/L,EAAAgM,QAAA,GACAhM,EAAAiM,SAAA,CAAA,EAIAjM,EAAAvL,GAAA7X,EACAojB,EAAAzI,YAAA3a,EACAojB,EAAArjB,KAAAC,EACAojB,EAAAlI,IAAAlb,EACAojB,EAAA5L,eAAAxX,EACAojB,EAAAjI,mBAAAnb,EACAojB,EAAAtK,KAAA9Y,EACAojB,EAAAxI,gBAAA5a,EACAojB,EAAAvI,oBAAA7a,EAEAojB,EAAA1I,UAAA,SAAAjJ,GAAA,MAAA,EAAA,EAEA2R,EAAAkM,QAAA,SAAA7d,GACA,MAAA,IAAA5S,MAAA,mCACA,EAEAukB,EAAAyG,IAAA,WAAA,MAAA,GAAA,EACAzG,EAAAmM,MAAA,SAAAjnB,GACA,MAAA,IAAAzJ,MAAA,iCACA,EACAukB,EAAAoM,MAAA,WAAA,OAAA,CAAA,CzCqrKA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS9wB,EAAQf,EAAOD,IAClC,SAAWK,IAAQ,Y0C52KnB,SAAA2tB,GAGA,IAAA+D,EAAA,iBAAA/xB,GAAAA,IACAA,EAAAgyB,UAAAhyB,EACAiyB,EAAA,iBAAAhyB,GAAAA,IACAA,EAAA+xB,UAAA/xB,EACAiyB,EAAA,iBAAA7xB,GAAAA,EAEA6xB,EAAA7xB,SAAA6xB,GACAA,EAAA9xB,SAAA8xB,GACAA,EAAA5xB,OAAA4xB,IAEAlE,EAAAkE,GAQA,IAAAC,EAiCApvB,EA9BAqvB,EAAA,WAGApL,EAAA,GACAqL,EAAA,EACAC,EAAA,GACAC,EAAA,GACAC,EAAA,IACAC,EAAA,GACAC,EAAA,IACAxE,EAAA,IAGAyE,EAAA,QACAC,EAAA,eACAC,EAAA,4BAGAC,EAAA,CACAC,SAAA,kDACA,YAAA,iDACA,gBAAA,iBAIAC,EAAAhM,EAAAqL,EACA7T,EAAAja,KAAAia,MACAyU,EAAA/nB,OAAAsC,aAaA,SAAAO,EAAA1E,GACA,MAAA,IAAA9B,WAAAurB,EAAAzpB,GACA,CAUA,SAAA6pB,EAAAvqB,EAAA1G,GAGA,IAFA,IAAAV,EAAAoH,EAAApH,OACA4xB,EAAA,GACA5xB,KACA4xB,EAAA5xB,GAAAU,EAAA0G,EAAApH,IAEA,OAAA4xB,CACA,CAYA,SAAAC,EAAArrB,EAAA9F,GACA,IAAAiE,EAAA6B,EAAA2L,MAAA,KACAyf,EAAA,GAWA,OAVAjtB,EAAA3E,OAAA,IAGA4xB,EAAAjtB,EAAA,GAAA,IACA6B,EAAA7B,EAAA,IAMAitB,EADAD,GAFAnrB,EAAAA,EAAAsH,QAAAwjB,EAAA,MACAnf,MAAA,KACAzR,GAAAsE,KAAA,IAEA,CAeA,SAAA8sB,EAAAtrB,GAMA,IALA,IAGAjD,EACAwuB,EAJAzsB,EAAA,GACA0sB,EAAA,EACAhyB,EAAAwG,EAAAxG,OAGAgyB,EAAAhyB,IACAuD,EAAAiD,EAAAjC,WAAAytB,OACA,OAAAzuB,GAAA,OAAAyuB,EAAAhyB,EAGA,QAAA,OADA+xB,EAAAvrB,EAAAjC,WAAAytB,OAEA1sB,EAAAvD,OAAA,KAAAwB,IAAA,KAAA,KAAAwuB,GAAA,QAIAzsB,EAAAvD,KAAAwB,GACAyuB,KAGA1sB,EAAAvD,KAAAwB,GAGA,OAAA+B,CACA,CAUA,SAAA2sB,EAAA7qB,GACA,OAAAuqB,EAAAvqB,GAAA,SAAA7D,GACA,IAAA+B,EAAA,GAOA,OANA/B,EAAA,QAEA+B,GAAAosB,GADAnuB,GAAA,SACA,GAAA,KAAA,OACAA,EAAA,MAAA,KAAAA,GAEA+B,GAAAosB,EAAAnuB,EAEA,IAAAyB,KAAA,GACA,CAmCA,SAAAktB,EAAAC,EAAAC,GAGA,OAAAD,EAAA,GAAA,IAAAA,EAAA,MAAA,GAAAC,IAAA,EACA,CAOA,SAAAC,EAAAC,EAAAC,EAAAC,GACA,IAAA5vB,EAAA,EAGA,IAFA0vB,EAAAE,EAAAvV,EAAAqV,EAAArB,GAAAqB,GAAA,EACAA,GAAArV,EAAAqV,EAAAC,GACAD,EAAAb,EAAAV,GAAA,EAAAnuB,GAAA6iB,EACA6M,EAAArV,EAAAqV,EAAAb,GAEA,OAAAxU,EAAAra,GAAA6uB,EAAA,GAAAa,GAAAA,EAAAtB,GACA,CASA,SAAAyB,EAAAC,GAEA,IAEAhkB,EAIAikB,EACA3oB,EACAvJ,EACAmyB,EACA5Y,EACApX,EACAuvB,EACA9yB,EAEAwzB,EArEAhnB,EAsDAvG,EAAA,GACAwtB,EAAAJ,EAAA1yB,OAEAT,EAAA,EACAH,EAAA+xB,EACA4B,EAAA7B,EAqBA,KALAyB,EAAAD,EAAAnpB,YAAAojB,IACA,IACAgG,EAAA,GAGA3oB,EAAA,EAAAA,EAAA2oB,IAAA3oB,EAEA0oB,EAAAnuB,WAAAyF,IAAA,KACAwC,EAAA,aAEAlH,EAAAvD,KAAA2wB,EAAAnuB,WAAAyF,IAMA,IAAAvJ,EAAAkyB,EAAA,EAAAA,EAAA,EAAA,EAAAlyB,EAAAqyB,GAAA,CAOA,IAAAF,EAAArzB,EAAAya,EAAA,EAAApX,EAAA6iB,EAEAhlB,GAAAqyB,GACAtmB,EAAA,mBAGA2lB,GAxGAtmB,EAwGA6mB,EAAAnuB,WAAA9D,MAvGA,GAAA,GACAoL,EAAA,GAEAA,EAAA,GAAA,GACAA,EAAA,GAEAA,EAAA,GAAA,GACAA,EAAA,GAEA4Z,IAgGAA,GAAA0M,EAAAlV,GAAA4T,EAAAtxB,GAAAya,KACAxN,EAAA,YAGAjN,GAAA4yB,EAAAnY,IAGAmY,GAFA9yB,EAAAuD,GAAAmwB,EAAAjC,EAAAluB,GAAAmwB,EAAAhC,EAAAA,EAAAnuB,EAAAmwB,IAbAnwB,GAAA6iB,EAoBAzL,EAAAiD,EAAA4T,GADAgC,EAAApN,EAAApmB,KAEAmN,EAAA,YAGAwN,GAAA6Y,EAKAE,EAAAV,EAAA9yB,EAAAqzB,EADAlkB,EAAApJ,EAAAtF,OAAA,EACA,GAAA4yB,GAIA3V,EAAA1d,EAAAmP,GAAAmiB,EAAAzxB,GACAoN,EAAA,YAGApN,GAAA6d,EAAA1d,EAAAmP,GACAnP,GAAAmP,EAGApJ,EAAA0tB,OAAAzzB,IAAA,EAAAH,EAEA,CAEA,OAAA6yB,EAAA3sB,EACA,CASA,SAAA2tB,EAAAP,GACA,IAAAtzB,EACAkzB,EACAY,EACAC,EACAJ,EACA/oB,EACAd,EACAkqB,EACAxwB,EACAvD,EACAg0B,EAGAP,EAEAQ,EACAT,EACAU,EANAjuB,EAAA,GAoBA,IARAwtB,GAHAJ,EAAAZ,EAAAY,IAGA1yB,OAGAZ,EAAA+xB,EACAmB,EAAA,EACAS,EAAA7B,EAGAlnB,EAAA,EAAAA,EAAA8oB,IAAA9oB,GACAqpB,EAAAX,EAAA1oB,IACA,KACA1E,EAAAvD,KAAA2vB,EAAA2B,IAeA,IAXAH,EAAAC,EAAA7tB,EAAAtF,OAMAmzB,GACA7tB,EAAAvD,KAAA4qB,GAIAuG,EAAAJ,GAAA,CAIA,IAAA5pB,EAAA2nB,EAAA7mB,EAAA,EAAAA,EAAA8oB,IAAA9oB,GACAqpB,EAAAX,EAAA1oB,KACA5K,GAAAi0B,EAAAnqB,IACAA,EAAAmqB,GAcA,IAPAnqB,EAAA9J,EAAA6d,GAAA4T,EAAAyB,IADAgB,EAAAJ,EAAA,KAEA1mB,EAAA,YAGA8lB,IAAAppB,EAAA9J,GAAAk0B,EACAl0B,EAAA8J,EAEAc,EAAA,EAAAA,EAAA8oB,IAAA9oB,EAOA,IANAqpB,EAAAX,EAAA1oB,IAEA5K,KAAAkzB,EAAAzB,GACArkB,EAAA,YAGA6mB,GAAAj0B,EAAA,CAEA,IAAAg0B,EAAAd,EAAA1vB,EAAA6iB,IAEA2N,GADA/zB,EAAAuD,GAAAmwB,EAAAjC,EAAAluB,GAAAmwB,EAAAhC,EAAAA,EAAAnuB,EAAAmwB,IADAnwB,GAAA6iB,EAKA8N,EAAAH,EAAA/zB,EACAwzB,EAAApN,EAAApmB,EACAiG,EAAAvD,KACA2vB,EAAAQ,EAAA7yB,EAAAk0B,EAAAV,EAAA,KAEAO,EAAAnW,EAAAsW,EAAAV,GAGAvtB,EAAAvD,KAAA2vB,EAAAQ,EAAAkB,EAAA,KACAL,EAAAV,EAAAC,EAAAgB,EAAAJ,GAAAC,GACAb,EAAA,IACAY,CACA,GAGAZ,IACAlzB,CAEA,CACA,OAAAkG,EAAAN,KAAA,GACA,CA8EA,GAnCA4rB,EAAA,CAMAT,QAAA,QAQAqD,KAAA,CACAf,OAAAX,EACAmB,OAAAhB,GAEAQ,OAAAA,EACAQ,OAAAA,EACAQ,QA/BA,SAAAf,GACA,OAAAb,EAAAa,GAAA,SAAAlsB,GACA,OAAA6qB,EAAAqC,KAAAltB,GACA,OAAAysB,EAAAzsB,GACAA,CACA,GACA,EA0BAmtB,UAnDA,SAAAjB,GACA,OAAAb,EAAAa,GAAA,SAAAlsB,GACA,OAAA4qB,EAAAsC,KAAAltB,GACAisB,EAAAjsB,EAAAK,MAAA,GAAA4B,eACAjC,CACA,GACA,GA2DAgqB,GAAAE,EACA,GAAAhyB,EAAAD,SAAA+xB,EAEAE,EAAAjyB,QAAAmyB,OAGA,IAAApvB,KAAAovB,EACAA,EAAA/tB,eAAArB,KAAAgvB,EAAAhvB,GAAAovB,EAAApvB,SAKAirB,EAAAmE,SAAAA,CAGA,CAnhBA,CAmhBA5xB,K1Cg3KC,GAAEe,KAAKf,KAAM,GAAEe,KAAKf,KAAuB,oBAAXF,OAAyBA,OAAyB,oBAATC,KAAuBA,KAAyB,oBAAXF,OAAyBA,OAAS,CAAC,EAElJ,EAAE,CAAC,GAAG,GAAG,CAAC,SAASY,EAAQf,EAAOD,G2C52LlC,SAAAoE,EAAA3B,EAAA0yB,GACA,OAAAxxB,OAAAC,UAAAQ,eAAA9C,KAAAmB,EAAA0yB,EACA,CAEAl1B,EAAAD,QAAA,SAAAo1B,EAAArH,EAAAsH,EAAAC,GACAvH,EAAAA,GAAA,IACAsH,EAAAA,GAAA,IACA,IAAA5yB,EAAA,CAAA,EAEA,GAAA,iBAAA2yB,GAAA,IAAAA,EAAA7zB,OACA,OAAAkB,EAGA,IAAA8yB,EAAA,MACAH,EAAAA,EAAA1hB,MAAAqa,GAEA,IAAAyH,EAAA,IACAF,GAAA,iBAAAA,EAAAE,UACAA,EAAAF,EAAAE,SAGA,IAAAvxB,EAAAmxB,EAAA7zB,OAEAi0B,EAAA,GAAAvxB,EAAAuxB,IACAvxB,EAAAuxB,GAGA,IAAA,IAAA10B,EAAA,EAAAA,EAAAmD,IAAAnD,EAAA,CACA,IAEA20B,EAAAC,EAAAvxB,EAAAwxB,EAFAhnB,EAAAymB,EAAAt0B,GAAAuO,QAAAkmB,EAAA,OACAK,EAAAjnB,EAAAlI,QAAA4uB,GAGAO,GAAA,GACAH,EAAA9mB,EAAA5C,OAAA,EAAA6pB,GACAF,EAAA/mB,EAAA5C,OAAA6pB,EAAA,KAEAH,EAAA9mB,EACA+mB,EAAA,IAGAvxB,EAAA0xB,mBAAAJ,GACAE,EAAAE,mBAAAH,GAEAtxB,EAAA3B,EAAA0B,GAEAT,EAAAjB,EAAA0B,IACA1B,EAAA0B,GAAAb,KAAAqyB,GAEAlzB,EAAA0B,GAAA,CAAA1B,EAAA0B,GAAAwxB,GAJAlzB,EAAA0B,GAAAwxB,CAMA,CAEA,OAAAlzB,CACA,EAEA,IAAAiB,EAAAD,MAAAC,SAAA,SAAAoyB,GACA,MAAA,mBAAAnyB,OAAAC,UAAAC,SAAAvC,KAAAw0B,EACA,C3Cy4LA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS90B,EAAQf,EAAOD,G4Cr8LlC,IAAA+1B,EAAA,SAAAJ,GACA,cAAAA,GACA,IAAA,SACA,OAAAA,EAEA,IAAA,UACA,OAAAA,EAAA,OAAA,QAEA,IAAA,SACA,OAAA9lB,SAAA8lB,GAAAA,EAAA,GAEA,QACA,MAAA,GAEA,EAEA11B,EAAAD,QAAA,SAAAyC,EAAAsrB,EAAAsH,EAAAthB,GAOA,OANAga,EAAAA,GAAA,IACAsH,EAAAA,GAAA,IACA,OAAA5yB,IACAA,OAAAoG,GAGA,iBAAApG,EACAywB,EAAA8C,EAAAvzB,IAAA,SAAA0B,GACA,IAAA8xB,EAAAC,mBAAAH,EAAA5xB,IAAAkxB,EACA,OAAA3xB,EAAAjB,EAAA0B,IACA+uB,EAAAzwB,EAAA0B,IAAA,SAAAwxB,GACA,OAAAM,EAAAC,mBAAAH,EAAAJ,GACA,IAAApvB,KAAAwnB,GAEAkI,EAAAC,mBAAAH,EAAAtzB,EAAA0B,IAEA,IAAAoC,KAAAwnB,GAIAha,EACAmiB,mBAAAH,EAAAhiB,IAAAshB,EACAa,mBAAAH,EAAAtzB,IAFA,EAGA,EAEA,IAAAiB,EAAAD,MAAAC,SAAA,SAAAoyB,GACA,MAAA,mBAAAnyB,OAAAC,UAAAC,SAAAvC,KAAAw0B,EACA,EAEA,SAAA5C,EAAA4C,EAAA/1B,GACA,GAAA+1B,EAAA5C,IAAA,OAAA4C,EAAA5C,IAAAnzB,GAEA,IADA,IAAA+M,EAAA,GACAhM,EAAA,EAAAA,EAAAg1B,EAAAv0B,OAAAT,IACAgM,EAAAxJ,KAAAvD,EAAA+1B,EAAAh1B,GAAAA,IAEA,OAAAgM,CACA,CAEA,IAAAkpB,EAAAryB,OAAAO,MAAA,SAAAzB,GACA,IAAAqK,EAAA,GACA,IAAA,IAAA/J,KAAAN,EACAkB,OAAAC,UAAAQ,eAAA9C,KAAAmB,EAAAM,IAAA+J,EAAAxJ,KAAAP,GAEA,OAAA+J,CACA,C5C+9LA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS9L,EAAQf,EAAOD,G6CjjMlCA,EAAAg0B,OAAAh0B,EAAAinB,MAAAjmB,EAAA,YACAhB,EAAAw0B,OAAAx0B,EAAA4gB,UAAA5f,EAAA,W7CsjMA,EAAE,CAAC,WAAW,GAAG,WAAW,KAAK,GAAG,CAAC,SAASA,EAAQf,EAAOD;;A8CvjM7D,IAAA0I,EAAA1H,EAAA,UACA+F,EAAA2B,EAAA3B,OAGA,SAAAovB,EAAAviB,EAAAC,GACA,IAAA,IAAA9Q,KAAA6Q,EACAC,EAAA9Q,GAAA6Q,EAAA7Q,EAEA,CASA,SAAAqzB,EAAA1uB,EAAAC,EAAApG,GACA,OAAAwF,EAAAW,EAAAC,EAAApG,EACA,CAVAwF,EAAAe,MAAAf,EAAAI,OAAAJ,EAAAc,aAAAd,EAAAyH,gBACAvO,EAAAD,QAAA0I,GAGAytB,EAAAztB,EAAA1I,GACAA,EAAA+G,OAAAqvB,GAOAA,EAAAxyB,UAAAD,OAAAuX,OAAAnU,EAAAnD,WAGAuyB,EAAApvB,EAAAqvB,GAEAA,EAAAtuB,KAAA,SAAAJ,EAAAC,EAAApG,GACA,GAAA,iBAAAmG,EACA,MAAA,IAAAE,UAAA,iCAEA,OAAAb,EAAAW,EAAAC,EAAApG,EACA,EAEA60B,EAAAjvB,MAAA,SAAAwC,EAAA4E,EAAAvG,GACA,GAAA,iBAAA2B,EACA,MAAA,IAAA/B,UAAA,6BAEA,IAAAJ,EAAAT,EAAA4C,GAUA,YATAd,IAAA0F,EACA,iBAAAvG,EACAR,EAAA+G,KAAAA,EAAAvG,GAEAR,EAAA+G,KAAAA,GAGA/G,EAAA+G,KAAA,GAEA/G,CACA,EAEA4uB,EAAAvuB,YAAA,SAAA8B,GACA,GAAA,iBAAAA,EACA,MAAA,IAAA/B,UAAA,6BAEA,OAAAb,EAAA4C,EACA,EAEAysB,EAAA5nB,gBAAA,SAAA7E,GACA,GAAA,iBAAAA,EACA,MAAA,IAAA/B,UAAA,6BAEA,OAAAc,EAAAxB,WAAAyC,EACA,C9C4jMA,EAAE,CAACjB,OAAS,KAAK,GAAG,CAAC,SAAS1H,EAAQf,EAAOD,IAC7C,SAAW+G,IAAQ;;A+C5nMnB9G,EAAAD,QAAA,SAAAq2B,EAAAx0B,GACA,IAAAy0B,EAAA,GACAD,EAAAlc,GAAA,QAAA,SAAAoc,GACAD,EAAAhzB,KAAAizB,EACA,IACAF,EAAAh0B,KAAA,OAAA,WACAR,GAAAA,EAAA,KAAAkF,EAAA9B,OAAAqxB,IACAz0B,EAAA,IACA,IACAw0B,EAAAh0B,KAAA,SAAA,SAAAW,GACAnB,GAAAA,EAAAmB,GACAnB,EAAA,IACA,GACA,C/CgoMC,GAAEP,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,UAAU+F,OAE5C,EAAE,CAAC2B,OAAS,KAAK,GAAG,CAAC,SAAS1H,EAAQf,EAAOD,IAC7C,SAAW+G,IAAQ;;AgDhpMnB9G,EAAAD,QAAAw2B,EAEA,MAAAvxB,EAAAjE,EAAA,iBACAy1B,EAAAz1B,EAAA,uBACA6oB,EAAA7oB,EAAA,QACA+oB,EAAA/oB,EAAA,SACAqB,EAAArB,EAAA,QACA01B,EAAA11B,EAAA,eACA8oB,EAAA9oB,EAAA,OAEA21B,EAAA91B,GAAA,OAAAA,GAAA,iBAAAA,GAAA,mBAAAA,EAAA+1B,KAEA,SAAAJ,EAAAK,EAAAh1B,GAIA,GAHAg1B,EAAAlzB,OAAAugB,OAAA,CAAA4S,aAAA,IAAA,iBAAAD,EAAA,CAAA/M,IAAA+M,GAAAA,GACAh1B,EAAAQ,EAAAR,GAEAg1B,EAAA/M,IAAA,CACA,MAAAiN,SAAAA,EAAAC,KAAAA,EAAA9M,SAAAA,EAAA+M,KAAAA,EAAAhW,KAAAA,GAAA6I,EAAA7C,MAAA4P,EAAA/M,YACA+M,EAAA/M,IACAiN,GAAAC,GAAA9M,GAAA+M,EACAtzB,OAAAugB,OAAA2S,EAAA,CAAAE,WAAAC,OAAA9M,WAAA+M,OAAAhW,SADA4V,EAAA5V,KAAAA,CAEA,CAEA,MAAAiW,EAAA,CAAA,kBAAA,iBAIA,IAAAC,EAHAN,EAAAK,SAAAvzB,OAAAO,KAAA2yB,EAAAK,SAAAtP,SAAAzjB,GAAA+yB,EAAA/yB,EAAA6F,eAAA6sB,EAAAK,QAAA/yB,KACA0yB,EAAAK,QAAAA,EAGAL,EAAAM,KACAA,EAAAN,EAAAO,OAAAT,EAAAE,EAAAM,MAAAxW,KAAAC,UAAAiW,EAAAM,MAAAN,EAAAM,KACAN,EAAAQ,OACAF,EAAA,iBAAAN,EAAAQ,KAAAR,EAAAQ,KAAAX,EAAA9V,UAAAiW,EAAAQ,MACAR,EAAAK,QAAA,gBAAA,qCAGAC,IACAN,EAAAS,SAAAT,EAAAS,OAAA,QACAX,EAAAQ,KAAAN,EAAAK,QAAA,kBAAAnwB,EAAA7B,WAAAiyB,IACAN,EAAAO,OAAAP,EAAAQ,OAAAR,EAAAK,QAAA,gBAAA,4BAEAL,EAAAM,YAAAN,EAAAQ,KAEAR,EAAAO,OAAAP,EAAAK,QAAAK,OAAA,oBACAV,EAAAS,SAAAT,EAAAS,OAAAT,EAAAS,OAAAE,eAEA,MAAAC,EAAAZ,EAAAE,SAEAW,GADA,WAAAb,EAAA3M,SAAAH,EAAAF,GACAM,QAAA0M,GAAA/pB,IACA,IAAA,IAAA+pB,EAAAc,iBAAA7qB,EAAA8qB,YAAA,KAAA9qB,EAAA8qB,WAAA,KAAA9qB,EAAAoqB,QAAAW,SAAA,CACAhB,EAAA/M,IAAAhd,EAAAoqB,QAAAW,gBACAhB,EAAAK,QAAAY,KACAhrB,EAAAirB,SAEA,MAAAC,EAAAlO,EAAA7C,MAAA4P,EAAA/M,KAAAiN,SAYA,OAVA,OAAAiB,GAAAA,IAAAP,WACAZ,EAAAK,QAAAe,cACApB,EAAAK,QAAAgB,eAGA,SAAArB,EAAAS,QAAA,CAAA,IAAA,KAAA1nB,SAAA9C,EAAA8qB,cACAf,EAAAS,OAAA,aACAT,EAAAK,QAAA,yBAAAL,EAAAK,QAAA,iBAGA,GAAAL,EAAAC,eAAAj1B,EAAA,IAAAV,MAAA,uBACAq1B,EAAAK,EAAAh1B,EACA,CAEA,MAAAs2B,EAAA,mBAAA1B,GAAA,SAAAI,EAAAS,OACAz1B,EAAA,KAAAs2B,EAAA1B,EAAA3pB,GAAAA,EAAA,IAWA,OATA4qB,EAAAvd,GAAA,WAAA,KACAud,EAAAU,QACAv2B,EAAA,IAAAV,MAAA,qBAAA,IAEAu2B,EAAAvd,GAAA,QAAAtY,GAEA80B,EAAAQ,GAAAA,EAAAhd,GAAA,QAAAtY,GAAA+0B,KAAAc,GACAA,EAAA/wB,IAAAwwB,GAEAO,CACA,CAEAlB,EAAAvxB,OAAA,CAAA4xB,EAAAh1B,IACA20B,EAAAK,GAAA,CAAA7zB,EAAA8J,KACA,GAAA9J,EAAA,OAAAnB,EAAAmB,GACAiC,EAAA6H,GAAA,CAAA9J,EAAAsG,KACA,GAAAtG,EAAA,OAAAnB,EAAAmB,GACA,GAAA6zB,EAAAO,KACA,IACA9tB,EAAAqX,KAAAsG,MAAA3d,EAAAzF,WACA,CAAA,MAAAb,GACA,OAAAnB,EAAAmB,EAAA8J,EAAAxD,EACA,CAEAzH,EAAA,KAAAiL,EAAAxD,EAAA,GACA,IAIA,CAAA,MAAA,OAAA,MAAA,QAAA,OAAA,UAAAse,SAAA0P,IACAd,EAAAc,GAAA,CAAAT,EAAAh1B,KACA,iBAAAg1B,IAAAA,EAAA,CAAA/M,IAAA+M,IACAL,EAAA7yB,OAAAugB,OAAA,CAAAoT,OAAAA,EAAAE,eAAAX,GAAAh1B,GACA,GhDqpMC,GAAEP,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,UAAU+F,OAE5C,EAAE,CAAC2B,OAAS,GAAG,sBAAsB,GAAGmhB,KAAO,GAAGE,MAAQ,GAAG1nB,KAAO,GAAGq0B,YAAc,GAAG,gBAAgB,GAAG5M,IAAM,KAAK,GAAG,CAAC,SAAS9oB,EAAQf,EAAOD,IAClJ,SAAWK,IAAQ,WiDlwMnB,IAAAg4B,EAAAr3B,EAAA,iBACAs3B,EAAAt3B,EAAA,kBACAu3B,EAAAv3B,EAAA,SACAw3B,EAAAx3B,EAAA,wBACA8oB,EAAA9oB,EAAA,OAEA6oB,EAAA7pB,EAEA6pB,EAAAM,QAAA,SAAA0M,EAAAh1B,GAEAg1B,EADA,iBAAAA,EACA/M,EAAA7C,MAAA4P,GAEA0B,EAAA1B,GAKA,IAAA4B,GAAA,IAAAp4B,EAAAw3B,SAAA3N,SAAAwO,OAAA,aAAA,QAAA,GAEAxO,EAAA2M,EAAA3M,UAAAuO,EACAX,EAAAjB,EAAAE,UAAAF,EAAAiB,KACAd,EAAAH,EAAAG,KACA/V,EAAA4V,EAAA5V,MAAA,IAGA6W,IAAA,IAAAA,EAAArxB,QAAA,OACAqxB,EAAA,IAAAA,EAAA,KAGAjB,EAAA/M,KAAAgO,EAAA5N,EAAA,KAAA4N,EAAA,KAAAd,EAAA,IAAAA,EAAA,IAAA/V,EACA4V,EAAAS,QAAAT,EAAAS,QAAA,OAAAE,cACAX,EAAAK,QAAAL,EAAAK,SAAA,CAAA,EAIA,IAAAQ,EAAA,IAAAW,EAAAxB,GAGA,OAFAh1B,GACA61B,EAAAvd,GAAA,WAAAtY,GACA61B,CACA,EAEA7N,EAAA3b,IAAA,SAAA2oB,EAAAh1B,GACA,IAAA61B,EAAA7N,EAAAM,QAAA0M,EAAAh1B,GAEA,OADA61B,EAAA/wB,MACA+wB,CACA,EAEA7N,EAAAwO,cAAAA,EACAxO,EAAA8O,gBAAAL,EAAAK,gBAEA9O,EAAA+O,MAAA,WAAA,EACA/O,EAAA+O,MAAAC,kBAAA,EAEAhP,EAAAiP,YAAA,IAAAjP,EAAA+O,MAEA/O,EAAAkP,aAAAP,EAEA3O,EAAAmP,QAAA,CACA,WACA,UACA,OACA,SACA,MACA,OACA,OACA,WACA,QACA,aACA,QACA,OACA,SACA,UACA,QACA,OACA,WACA,YACA,QACA,MACA,SACA,SACA,YACA,QACA,SACA,cjDqwMC,GAAE13B,KAAKf,KAAM,GAAEe,KAAKf,KAAuB,oBAAXF,OAAyBA,OAAyB,oBAATC,KAAuBA,KAAyB,oBAAXF,OAAyBA,OAAS,CAAC,EAElJ,EAAE,CAAC,gBAAgB,GAAG,iBAAiB,GAAG,uBAAuB,GAAG0pB,IAAM,GAAGmP,MAAQ,KAAK,GAAG,CAAC,SAASj4B,EAAQf,EAAOD,IACtH,SAAWK,IAAQ,WkDl1MnB,IAAA64B,EACA,SAAAC,IAEA,QAAAtwB,IAAAqwB,EAAA,OAAAA,EAEA,GAAA74B,EAAA+4B,eAAA,CACAF,EAAA,IAAA74B,EAAA+4B,eAIA,IACAF,EAAAG,KAAA,MAAAh5B,EAAAi5B,eAAA,IAAA,sBACA,CAAA,MAAA54B,GACAw4B,EAAA,IACA,CACA,MAEAA,EAAA,KAEA,OAAAA,CACA,CAEA,SAAAK,EAAAlwB,GACA,IAAA6vB,EAAAC,IACA,IAAAD,EAAA,OAAA,EACA,IAEA,OADAA,EAAAM,aAAAnwB,EACA6vB,EAAAM,eAAAnwB,CACA,CAAA,MAAA3I,GAAA,CACA,OAAA,CACA,CAeA,SAAA+4B,EAAA30B,GACA,MAAA,mBAAAA,CACA,CAxDA9E,EAAA05B,MAAAD,EAAAp5B,EAAAq5B,QAAAD,EAAAp5B,EAAAs5B,gBAEA35B,EAAA45B,eAAAH,EAAAp5B,EAAAw5B,gBAEA75B,EAAA85B,gBAAAL,EAAAp5B,EAAA05B,iBAuCA/5B,EAAAg6B,YAAAh6B,EAAA05B,OAAAH,EAAA,eAIAv5B,EAAAi6B,UAAAj6B,EAAA05B,OAAAH,EAAA,aACAv5B,EAAAk6B,uBAAAl6B,EAAA05B,OAAAH,EAAA,2BAIAv5B,EAAAm6B,iBAAAn6B,EAAA05B,SAAAP,KAAAM,EAAAN,IAAAgB,kBAMAjB,EAAA,IlD81MC,GAAE53B,KAAKf,KAAM,GAAEe,KAAKf,KAAuB,oBAAXF,OAAyBA,OAAyB,oBAATC,KAAuBA,KAAyB,oBAAXF,OAAyBA,OAAS,CAAC,EAElJ,EAAE,CAAC,GAAG,GAAG,CAAC,SAASY,EAAQf,EAAOD,IAClC,SAAW0lB,EAAQrlB,EAAO0G,IAAQ,WmD35MlC,IAAAqzB,EAAAp5B,EAAA,gBACAq5B,EAAAr5B,EAAA,YACAs3B,EAAAt3B,EAAA,cACAq1B,EAAAr1B,EAAA,mBAEA23B,EAAAL,EAAAK,gBACA2B,EAAAhC,EAAAiC,YAgBA,IAAAlC,EAAAp4B,EAAAD,QAAA,SAAA62B,GACA,IAYA2D,EAZAl6B,EAAAC,KACA81B,EAAAoE,SAAAn5B,KAAAhB,GAEAA,EAAAo6B,MAAA7D,EACAv2B,EAAAq6B,MAAA,GACAr6B,EAAAs6B,SAAA,CAAA,EACA/D,EAAAI,MACA32B,EAAAu6B,UAAA,gBAAA,SAAA9zB,EAAAe,KAAA+uB,EAAAI,MAAApzB,SAAA,WACAF,OAAAO,KAAA2yB,EAAAK,SAAAtP,SAAA,SAAA7T,GACAzT,EAAAu6B,UAAA9mB,EAAA8iB,EAAAK,QAAAnjB,GACA,IAGA,IAAA+mB,GAAA,EACA,GAAA,kBAAAjE,EAAAkE,MAAA,mBAAAlE,IAAAuD,EAAAN,gBAEAgB,GAAA,EACAN,GAAA,OACA,GAAA,qBAAA3D,EAAAkE,KAGAP,GAAA,OACA,GAAA,6BAAA3D,EAAAkE,KAEAP,GAAAJ,EAAAD,qBACA,IAAAtD,EAAAkE,MAAA,YAAAlE,EAAAkE,MAAA,gBAAAlE,EAAAkE,KAIA,MAAA,IAAA55B,MAAA,+BAFAq5B,GAAA,CAGA,CACAl6B,EAAA06B,MA9CA,SAAAR,EAAAM,GACA,OAAAV,EAAAV,OAAAoB,EACA,QACAV,EAAAF,sBACA,0BACAE,EAAAH,SACA,YACAG,EAAAJ,aAAAQ,EACA,cAEA,MAEA,CAkCAS,CAAAT,EAAAM,GACAx6B,EAAA46B,YAAA,KACA56B,EAAA66B,eAAA,KACA76B,EAAA86B,aAAA,KAEA96B,EAAA6Z,GAAA,UAAA,WACA7Z,EAAA+6B,WACA,GACA,EAEAhB,EAAAhC,EAAAhC,EAAAoE,UAEApC,EAAAz0B,UAAAi3B,UAAA,SAAA9mB,EAAAjP,GACA,IACAw2B,EAAAvnB,EAAA/J,eAIA,IAAAuxB,EAAA90B,QAAA60B,KALA/6B,KAQAq6B,SAAAU,GAAA,CACAvnB,KAAAA,EACAjP,MAAAA,GAEA,EAEAuzB,EAAAz0B,UAAA43B,UAAA,SAAAznB,GACA,IAAA0nB,EAAAl7B,KAAAq6B,SAAA7mB,EAAA/J,eACA,OAAAyxB,EACAA,EAAA32B,MACA,IACA,EAEAuzB,EAAAz0B,UAAA83B,aAAA,SAAA3nB,UACAxT,KACAq6B,SAAA7mB,EAAA/J,cACA,EAEAquB,EAAAz0B,UAAAy3B,UAAA,WACA,IAAA/6B,EAAAC,KAEA,IAAAD,EAAAq7B,WAAA,CAEA,IAAA9E,EAAAv2B,EAAAo6B,MAEA,YAAA7D,GAAA,IAAAA,EAAA5F,SACA3wB,EAAAsE,WAAAiyB,EAAA5F,SAGA,IAAA2K,EAAAt7B,EAAAs6B,SACAzD,EAAA,KACA,QAAAN,EAAAS,QAAA,SAAAT,EAAAS,SACAH,EAAA,IAAA0E,KAAAv7B,EAAAq6B,MAAA,CACAtxB,MAAAuyB,EAAA,iBAAA,CAAA,GAAA92B,OAAA,MAKA,IAAAg3B,EAAA,GAaA,GAZAn4B,OAAAO,KAAA03B,GAAAhU,SAAA,SAAAmU,GACA,IAAAhoB,EAAA6nB,EAAAG,GAAAhoB,KACAjP,EAAA82B,EAAAG,GAAAj3B,MACArB,MAAAC,QAAAoB,GACAA,EAAA8iB,SAAA,SAAA+N,GACAmG,EAAAx4B,KAAA,CAAAyQ,EAAA4hB,GACA,IAEAmG,EAAAx4B,KAAA,CAAAyQ,EAAAjP,GAEA,IAEA,UAAAxE,EAAA06B,MAAA,CACA,IAAAgB,EAAA,KACA,GAAA5B,EAAAN,gBAAA,CACA,IAAAmC,EAAA,IAAAlC,gBACAiC,EAAAC,EAAAD,OACA17B,EAAA47B,sBAAAD,EAEA,mBAAApF,GAAA,IAAAA,EAAAsF,iBACA77B,EAAA46B,YAAA76B,EAAAuE,YAAA,WACAtE,EAAA8a,KAAA,kBACA9a,EAAA47B,uBACA57B,EAAA47B,sBAAA9D,OACA,GAAAvB,EAAAsF,gBAEA,CAEA97B,EAAAq5B,MAAAp5B,EAAAo6B,MAAA5Q,IAAA,CACAwN,OAAAh3B,EAAAo6B,MAAApD,OACAJ,QAAA4E,EACA3E,KAAAA,QAAAtuB,EACAkyB,KAAA,OACAqB,YAAAvF,EAAAwF,gBAAA,UAAA,cACAL,OAAAA,IACAM,MAAA,SAAAhE,GACAh4B,EAAAi8B,eAAAjE,EACAh4B,EAAAk8B,cAAA,GACAl8B,EAAAm8B,UACA,IAAA,SAAAC,GACAp8B,EAAAk8B,cAAA,GACAl8B,EAAAq7B,YACAr7B,EAAA8a,KAAA,QAAAshB,EACA,GACA,KAAA,CACA,IAAAxD,EAAA54B,EAAAq8B,KAAA,IAAAt8B,EAAA+4B,eACA,IACAF,EAAAG,KAAA/4B,EAAAo6B,MAAApD,OAAAh3B,EAAAo6B,MAAA5Q,KAAA,EACA,CAAA,MAAA9mB,GAIA,YAHA0iB,EAAA4L,UAAA,WACAhxB,EAAA8a,KAAA,QAAApY,EACA,GAEA,CAGA,iBAAAk2B,IACAA,EAAAM,aAAAl5B,EAAA06B,OAEA,oBAAA9B,IACAA,EAAAmD,kBAAAxF,EAAAwF,iBAEA,SAAA/7B,EAAA06B,OAAA,qBAAA9B,GACAA,EAAAiB,iBAAA,sCAEA,mBAAAtD,IACAqC,EAAAjI,QAAA4F,EAAAsF,eACAjD,EAAA0D,UAAA,WACAt8B,EAAA8a,KAAA,iBACA,GAGA0gB,EAAAlU,SAAA,SAAA6T,GACAvC,EAAA2D,iBAAApB,EAAA,GAAAA,EAAA,GACA,IAEAn7B,EAAAw8B,UAAA,KACA5D,EAAA6D,mBAAA,WACA,OAAA7D,EAAA8D,YACA,KAAA1C,EAAA2C,QACA,KAAA3C,EAAA4C,KACA58B,EAAA68B,iBAGA,EAGA,4BAAA78B,EAAA06B,QACA9B,EAAAkE,WAAA,WACA98B,EAAA68B,gBACA,GAGAjE,EAAAmE,QAAA,WACA/8B,EAAAq7B,aAEAr7B,EAAAk8B,cAAA,GACAl8B,EAAA8a,KAAA,QAAA,IAAAja,MAAA,cACA,EAEA,IACA+3B,EAAAoE,KAAAnG,EACA,CAAA,MAAAn0B,GAIA,YAHA0iB,EAAA4L,UAAA,WACAhxB,EAAA8a,KAAA,QAAApY,EACA,GAEA,CACA,CA7HA,CA8HA,EAgBAq1B,EAAAz0B,UAAAu5B,eAAA,WACA,IAAA78B,EAAAC,KAEAD,EAAAk8B,cAAA,GAZA,SAAAtD,GACA,IACA,IAAAqE,EAAArE,EAAAqE,OACA,OAAA,OAAAA,GAAA,IAAAA,CACA,CAAA,MAAA78B,GACA,OAAA,CACA,CACA,CAOA88B,CAAAl9B,EAAAq8B,QAAAr8B,EAAAq7B,aAGAr7B,EAAAw8B,WACAx8B,EAAAm8B,WAEAn8B,EAAAw8B,UAAAK,eAAA78B,EAAAk8B,aAAA7lB,KAAArW,IACA,EAEA+3B,EAAAz0B,UAAA64B,SAAA,WACA,IAAAn8B,EAAAC,KAEAD,EAAAq7B,aAGAr7B,EAAAw8B,UAAA,IAAAnE,EAAAr4B,EAAAq8B,KAAAr8B,EAAAi8B,eAAAj8B,EAAA06B,MAAA16B,EAAAk8B,aAAA7lB,KAAArW,IACAA,EAAAw8B,UAAA3iB,GAAA,SAAA,SAAAnX,GACA1C,EAAA8a,KAAA,QAAApY,EACA,IAEA1C,EAAA8a,KAAA,WAAA9a,EAAAw8B,WACA,EAEAzE,EAAAz0B,UAAA65B,OAAA,SAAAlH,EAAAvuB,EAAAnG,GACAtB,KAEAo6B,MAAAr3B,KAAAizB,GACA10B,GACA,EAEAw2B,EAAAz0B,UAAA44B,aAAA,SAAA75B,GACA,IAAArC,EAAAC,KAEAF,EAAAqwB,aAAApwB,EAAA86B,cACA96B,EAAA86B,aAAA,KAEAz4B,GACAtC,EAAAqwB,aAAApwB,EAAA46B,aACA56B,EAAA46B,YAAA,MACA56B,EAAA66B,iBACA76B,EAAA86B,aAAA/6B,EAAAuE,YAAA,WACAtE,EAAA8a,KAAA,UACA,GAAA9a,EAAA66B,gBAEA,EAEA9C,EAAAz0B,UAAAw0B,MAAAC,EAAAz0B,UAAA85B,QAAA,SAAA16B,GACA,IAAA1C,EAAAC,KACAD,EAAAq7B,YAAA,EACAr7B,EAAAk8B,cAAA,GACAl8B,EAAAw8B,YACAx8B,EAAAw8B,UAAAnB,YAAA,GACAr7B,EAAAq8B,KACAr8B,EAAAq8B,KAAAvE,QACA93B,EAAA47B,uBACA57B,EAAA47B,sBAAA9D,QAEAp1B,GACA1C,EAAA8a,KAAA,QAAApY,EACA,EAEAq1B,EAAAz0B,UAAA+C,IAAA,SAAA2C,EAAAtB,EAAAnG,GAEA,mBAAAyH,IACAzH,EAAAyH,EACAA,OAAAT,GAGAwtB,EAAAoE,SAAA72B,UAAA+C,IAAArF,KANAf,KAMA+I,EAAAtB,EAAAnG,EACA,EAEAw2B,EAAAz0B,UAAAgB,WAAA,SAAAqsB,EAAApvB,GACA,IAAAvB,EAAAC,KAEAsB,GACAvB,EAAA+B,KAAA,UAAAR,GAEAvB,EAAA66B,eAAAlK,EACA3wB,EAAAk8B,cAAA,EACA,EAEAnE,EAAAz0B,UAAA+5B,aAAA,WAAA,EACAtF,EAAAz0B,UAAAg6B,WAAA,WAAA,EACAvF,EAAAz0B,UAAAi6B,mBAAA,WAAA,EAGA,IAAAtC,EAAA,CACA,iBACA,kBACA,iCACA,gCACA,aACA,iBACA,SACA,UACA,OACA,MACA,SACA,OACA,aACA,SACA,UACA,KACA,UACA,oBACA,UACA,MnD+5MC,GAAEj6B,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAA8B,oBAAXX,OAAyBA,OAAyB,oBAATC,KAAuBA,KAAyB,oBAAXF,OAAyBA,OAAS,CAAC,EAAEY,EAAQ,UAAU+F,OAE1L,EAAE,CAAC,eAAe,GAAG,aAAa,GAAGwf,SAAW,GAAG7d,OAAS,GAAG2xB,SAAW,GAAG,kBAAkB,KAAK,GAAG,CAAC,SAASr5B,EAAQf,EAAOD,IAChI,SAAW0lB,EAAQrlB,EAAO0G,IAAQ,WoDhwNlC,IAAAqzB,EAAAp5B,EAAA,gBACAq5B,EAAAr5B,EAAA,YACAq1B,EAAAr1B,EAAA,mBAEAs5B,EAAAt6B,EAAAu6B,YAAA,CACAuD,OAAA,EACAC,OAAA,EACAC,iBAAA,EACAf,QAAA,EACAC,KAAA,GAGAvE,EAAA34B,EAAA24B,gBAAA,SAAAO,EAAAZ,EAAAyC,EAAAkD,GACA,IAAA39B,EAAAC,KAiBA,GAhBA81B,EAAA6H,SAAA58B,KAAAhB,GAEAA,EAAA06B,MAAAD,EACAz6B,EAAA42B,QAAA,CAAA,EACA52B,EAAA69B,WAAA,GACA79B,EAAA89B,SAAA,CAAA,EACA99B,EAAA+9B,YAAA,GAGA/9B,EAAA6Z,GAAA,OAAA,WAEAuL,EAAA4L,UAAA,WACAhxB,EAAA8a,KAAA,QACA,GACA,IAEA,UAAA2f,EAAA,CAYA,GAXAz6B,EAAAi8B,eAAAjE,EAEAh4B,EAAAwpB,IAAAwO,EAAAxO,IACAxpB,EAAAs3B,WAAAU,EAAAiF,OACAj9B,EAAAg+B,cAAAhG,EAAAiG,WAEAjG,EAAApB,QAAAtP,SAAA,SAAA6T,EAAA14B,GACAzC,EAAA42B,QAAAn0B,EAAAiH,eAAAyxB,EACAn7B,EAAA69B,WAAA76B,KAAAP,EAAA04B,EACA,IAEArB,EAAAR,eAAA,CACA,IAAAvrB,EAAA,IAAAwrB,eAAA,CACA1xB,MAAA,SAAAouB,GAEA,OADA0H,GAAA,GACA,IAAAvkB,SAAA,SAAAC,EAAAC,GACAtZ,EAAAq7B,WACA/hB,IACAtZ,EAAAgD,KAAAyD,EAAAe,KAAAyuB,IACA5c,IAEArZ,EAAAk+B,aAAA7kB,CAEA,GACA,EACA8kB,MAAA,WACAR,GAAA,GACA39B,EAAAq7B,YACAr7B,EAAAgD,KAAA,KACA,EACA80B,MAAA,SAAAp1B,GACAi7B,GAAA,GACA39B,EAAAq7B,YACAr7B,EAAA8a,KAAA,QAAApY,EACA,IAGA,IAMA,YALAs1B,EAAAnB,KAAAuH,OAAArwB,GAAAswB,OAAA,SAAA37B,GACAi7B,GAAA,GACA39B,EAAAq7B,YACAr7B,EAAA8a,KAAA,QAAApY,EACA,GAEA,CAAA,MAAAtC,GAAA,CACA,CAEA,IAAAk+B,EAAAtG,EAAAnB,KAAA0H,YACA,SAAA1zB,IACAyzB,EAAAzzB,OAAAmxB,MAAA,SAAAnJ,GACA7yB,EAAAq7B,aAEAsC,EAAA9K,EAAAxwB,MACAwwB,EAAAxwB,KACArC,EAAAgD,KAAA,OAGAhD,EAAAgD,KAAAyD,EAAAe,KAAAqrB,EAAAruB,QACAqG,KACA,IAAAwzB,OAAA,SAAA37B,GACAi7B,GAAA,GACA39B,EAAAq7B,YACAr7B,EAAA8a,KAAA,QAAApY,EACA,GACA,CACAmI,GACA,KAAA,CA2BA,GA1BA7K,EAAAq8B,KAAAzD,EACA54B,EAAAw+B,KAAA,EAEAx+B,EAAAwpB,IAAAoP,EAAA6F,YACAz+B,EAAAs3B,WAAAsB,EAAAqE,OACAj9B,EAAAg+B,cAAApF,EAAAqF,WACArF,EAAA8F,wBAAAtrB,MAAA,SACAkU,SAAA,SAAA6T,GACA,IAAAwD,EAAAxD,EAAAxlB,MAAA,oBACA,GAAAgpB,EAAA,CACA,IAAAl8B,EAAAk8B,EAAA,GAAAj1B,cACA,eAAAjH,QACA8F,IAAAvI,EAAA42B,QAAAn0B,KACAzC,EAAA42B,QAAAn0B,GAAA,IAEAzC,EAAA42B,QAAAn0B,GAAAO,KAAA27B,EAAA,UACAp2B,IAAAvI,EAAA42B,QAAAn0B,GACAzC,EAAA42B,QAAAn0B,IAAA,KAAAk8B,EAAA,GAEA3+B,EAAA42B,QAAAn0B,GAAAk8B,EAAA,GAEA3+B,EAAA69B,WAAA76B,KAAA27B,EAAA,GAAAA,EAAA,GACA,CACA,IAEA3+B,EAAA4+B,SAAA,kBACA9E,EAAAD,iBAAA,CACA,IAAAgF,EAAA7+B,EAAA69B,WAAA,aACA,GAAAgB,EAAA,CACA,IAAAC,EAAAD,EAAAlpB,MAAA,2BACAmpB,IACA9+B,EAAA4+B,SAAAE,EAAA,GAAAp1B,cAEA,CACA1J,EAAA4+B,WACA5+B,EAAA4+B,SAAA,QACA,CACA,CACA,EAEA7E,EAAA1B,EAAAtC,EAAA6H,UAEAvF,EAAA/0B,UAAAy7B,MAAA,WACA,IAEA1lB,EAFApZ,KAEAi+B,aACA7kB,IAHApZ,KAIAi+B,aAAA,KACA7kB,IAEA,EAEAgf,EAAA/0B,UAAAu5B,eAAA,SAAAc,GACA,IAAA39B,EAAAC,KAEA24B,EAAA54B,EAAAq8B,KAEArE,EAAA,KACA,OAAAh4B,EAAA06B,OACA,IAAA,OAEA,IADA1C,EAAAY,EAAAoG,cACA/9B,OAAAjB,EAAAw+B,KAAA,CACA,IAAAS,EAAAjH,EAAAvsB,OAAAzL,EAAAw+B,MACA,GAAA,mBAAAx+B,EAAA4+B,SAAA,CAEA,IADA,IAAAx2B,EAAA3B,EAAAI,MAAAo4B,EAAAh+B,QACAT,EAAA,EAAAA,EAAAy+B,EAAAh+B,OAAAT,IACA4H,EAAA5H,GAAA,IAAAy+B,EAAAz5B,WAAAhF,GAEAR,EAAAgD,KAAAoF,EACA,MACApI,EAAAgD,KAAAi8B,EAAAj/B,EAAA4+B,UAEA5+B,EAAAw+B,KAAAxG,EAAA/2B,MACA,CACA,MACA,IAAA,cACA,GAAA23B,EAAA8D,aAAA1C,EAAA4C,OAAAhE,EAAAZ,SACA,MACAA,EAAAY,EAAAZ,SACAh4B,EAAAgD,KAAAyD,EAAAe,KAAA,IAAAtB,WAAA8xB,KACA,MACA,IAAA,0BAEA,GADAA,EAAAY,EAAAZ,SACAY,EAAA8D,aAAA1C,EAAA2C,UAAA3E,EACA,MACAh4B,EAAAgD,KAAAyD,EAAAe,KAAA,IAAAtB,WAAA8xB,KACA,MACA,IAAA,YAEA,GADAA,EAAAY,EAAAZ,SACAY,EAAA8D,aAAA1C,EAAA2C,QACA,MACA,IAAA2B,EAAA,IAAAv+B,EAAAm/B,eACAZ,EAAAxB,WAAA,WACAwB,EAAAzL,OAAAjuB,WAAA5E,EAAAw+B,OACAx+B,EAAAgD,KAAAyD,EAAAe,KAAA,IAAAtB,WAAAo4B,EAAAzL,OAAA/qB,MAAA9H,EAAAw+B,SACAx+B,EAAAw+B,KAAAF,EAAAzL,OAAAjuB,WAEA,EACA05B,EAAAa,OAAA,WACAxB,GAAA,GACA39B,EAAAgD,KAAA,KACA,EAEAs7B,EAAAc,kBAAApH,GAKAh4B,EAAAq8B,KAAAK,aAAA1C,EAAA4C,MAAA,cAAA58B,EAAA06B,QACAiD,GAAA,GACA39B,EAAAgD,KAAA,MAEA,CpDmwNC,GAAEhC,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAA8B,oBAAXX,OAAyBA,OAAyB,oBAATC,KAAuBA,KAAyB,oBAAXF,OAAyBA,OAAS,CAAC,EAAEY,EAAQ,UAAU+F,OAE1L,EAAE,CAAC,eAAe,GAAGwf,SAAW,GAAG7d,OAAS,GAAG2xB,SAAW,GAAG,kBAAkB,KAAK,GAAG,CAAC,SAASr5B,EAAQf,EAAOD,GqDn9NhH,IAAA2/B,EAAA,CAAA,EAEA,SAAAC,EAAAx+B,EAAA0b,EAAA+iB,GACAA,IACAA,EAAA1+B,OAWA,IAAA2+B,EAEA,SAAAC,GAnBA,IAAAC,EAAAC,EAsBA,SAAAH,EAAAI,EAAAC,EAAAC,GACA,OAAAL,EAAAz+B,KAAAf,KAdA,SAAA2/B,EAAAC,EAAAC,GACA,MAAA,iBAAAtjB,EACAA,EAEAA,EAAAojB,EAAAC,EAAAC,EAEA,CAQAC,CAAAH,EAAAC,EAAAC,KAAA7/B,IACA,CAEA,OA1BA0/B,EAoBAF,GApBAC,EAoBAF,GApBAl8B,UAAAD,OAAAuX,OAAA+kB,EAAAr8B,WAAAo8B,EAAAp8B,UAAAkQ,YAAAksB,EAAAA,EAAAv4B,UAAAw4B,EA0BAH,CACA,CARA,CAQAD,GAEAC,EAAAl8B,UAAAmQ,KAAA8rB,EAAA9rB,KACA+rB,EAAAl8B,UAAAxC,KAAAA,EACAu+B,EAAAv+B,GAAA0+B,CACA,CAGA,SAAAQ,EAAAC,EAAAC,GACA,GAAA/8B,MAAAC,QAAA68B,GAAA,CACA,IAAAt8B,EAAAs8B,EAAAh/B,OAKA,OAJAg/B,EAAAA,EAAArN,KAAA,SAAApyB,GACA,OAAAoK,OAAApK,EACA,IAEAmD,EAAA,EACA,UAAAgB,OAAAu7B,EAAA,KAAAv7B,OAAAs7B,EAAAn4B,MAAA,EAAAnE,EAAA,GAAAsC,KAAA,MAAA,SAAAg6B,EAAAt8B,EAAA,GACA,IAAAA,EACA,UAAAgB,OAAAu7B,EAAA,KAAAv7B,OAAAs7B,EAAA,GAAA,QAAAt7B,OAAAs7B,EAAA,IAEA,MAAAt7B,OAAAu7B,EAAA,KAAAv7B,OAAAs7B,EAAA,GAEA,CACA,MAAA,MAAAt7B,OAAAu7B,EAAA,KAAAv7B,OAAAiG,OAAAq1B,GAEA,CA6BAX,EAAA,yBAAA,SAAA7rB,EAAAjP,GACA,MAAA,cAAAA,EAAA,4BAAAiP,EAAA,GACA,GAAAnM,WACAg4B,EAAA,wBAAA,SAAA7rB,EAAAwsB,EAAAr4B,GAEA,IAAAu4B,EA/BA/H,EAAA5pB,EAwCA4xB,EAEA,GATA,iBAAAH,IAjCA7H,EAiCA,OAAA6H,EAhCAx0B,QAAA+C,GAAAA,EAAA,EAAA,GAAAA,EAAA4pB,EAAAn3B,UAAAm3B,IAiCA+H,EAAA,cACAF,EAAAA,EAAAlxB,QAAA,QAAA,KAEAoxB,EAAA,UAhCA,SAAAt0B,EAAAusB,EAAAiI,GAKA,YAJA93B,IAAA83B,GAAAA,EAAAx0B,EAAA5K,UACAo/B,EAAAx0B,EAAA5K,QAGA4K,EAAA0J,UAAA8qB,EAAAjI,EAAAn3B,OAAAo/B,KAAAjI,CACA,CA+BA9jB,CAAAb,EAAA,aAEA2sB,EAAA,OAAAz7B,OAAA8O,EAAA,KAAA9O,OAAAw7B,EAAA,KAAAx7B,OAAAq7B,EAAAC,EAAA,aACA,CACA,IAAAl3B,EAhCA,SAAA8C,EAAAusB,EAAAhyB,GAKA,MAJA,iBAAAA,IACAA,EAAA,KAGAA,EAAAgyB,EAAAn3B,OAAA4K,EAAA5K,UAGA,IAAA4K,EAAA1F,QAAAiyB,EAAAhyB,EAEA,CAsBAkJ,CAAAmE,EAAA,KAAA,WAAA,WACA2sB,EAAA,QAAAz7B,OAAA8O,EAAA,MAAA9O,OAAAoE,EAAA,KAAApE,OAAAw7B,EAAA,KAAAx7B,OAAAq7B,EAAAC,EAAA,QACA,CAGA,OADAG,GAAA,mBAAAz7B,cAAAiD,EAEA,GAAAN,WACAg4B,EAAA,4BAAA,2BACAA,EAAA,8BAAA,SAAA7rB,GACA,MAAA,OAAAA,EAAA,4BACA,IACA6rB,EAAA,6BAAA,mBACAA,EAAA,wBAAA,SAAA7rB,GACA,MAAA,eAAAA,EAAA,+BACA,IACA6rB,EAAA,wBAAA,kCACAA,EAAA,yBAAA,6BACAA,EAAA,6BAAA,mBACAA,EAAA,yBAAA,sCAAAh4B,WACAg4B,EAAA,wBAAA,SAAAl4B,GACA,MAAA,qBAAAA,CACA,GAAAE,WACAg4B,EAAA,qCAAA,oCACA3/B,EAAAD,QAAA2/B,MAAAA,CrD09NA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS3+B,EAAQf,EAAOD,IAClC,SAAW0lB,IAAS,WsD5jOpB,IAAAsQ,EAAAryB,OAAAO,MAAA,SAAAzB,GACA,IAAAyB,EAAA,GACA,IAAA,IAAAnB,KAAAN,EAAAyB,EAAAZ,KAAAP,GACA,OAAAmB,CACA,EAGAjE,EAAAD,QAAA4gC,EACA,IAAA1C,EAAAl9B,EAAA,sBACAy5B,EAAAz5B,EAAA,sBACAA,EAAA,WAAAA,CAAA4/B,EAAA1C,GAIA,IADA,IAAAh6B,EAAA8xB,EAAAyE,EAAA72B,WACA+xB,EAAA,EAAAA,EAAAzxB,EAAA3C,OAAAo0B,IAAA,CACA,IAAA2B,EAAApzB,EAAAyxB,GACAiL,EAAAh9B,UAAA0zB,KAAAsJ,EAAAh9B,UAAA0zB,GAAAmD,EAAA72B,UAAA0zB,GACA,CAEA,SAAAsJ,EAAAtL,GACA,KAAA/0B,gBAAAqgC,GAAA,OAAA,IAAAA,EAAAtL,GACA4I,EAAA58B,KAAAf,KAAA+0B,GACAmF,EAAAn5B,KAAAf,KAAA+0B,GACA/0B,KAAAsgC,eAAA,EACAvL,KACA,IAAAA,EAAAwL,WAAAvgC,KAAAugC,UAAA,IACA,IAAAxL,EAAAjnB,WAAA9N,KAAA8N,UAAA,IACA,IAAAinB,EAAAuL,gBACAtgC,KAAAsgC,eAAA,EACAtgC,KAAA8B,KAAA,MAAA0+B,IAGA,CA8BA,SAAAA,IAEAxgC,KAAAygC,eAAAC,OAIAvb,EAAA4L,SAAA4P,EAAA3gC,KACA,CACA,SAAA2gC,EAAA5gC,GACAA,EAAAqG,KACA,CAvCAhD,OAAAqK,eAAA4yB,EAAAh9B,UAAA,wBAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,OAAA3N,KAAAygC,eAAAG,aACA,IAEAx9B,OAAAqK,eAAA4yB,EAAAh9B,UAAA,iBAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,OAAA3N,KAAAygC,gBAAAzgC,KAAAygC,eAAAI,WACA,IAEAz9B,OAAAqK,eAAA4yB,EAAAh9B,UAAA,iBAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,OAAA3N,KAAAygC,eAAAz/B,MACA,IAeAoC,OAAAqK,eAAA4yB,EAAAh9B,UAAA,YAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,YAAArF,IAAAtI,KAAA8gC,qBAAAx4B,IAAAtI,KAAAygC,iBAGAzgC,KAAA8gC,eAAAC,WAAA/gC,KAAAygC,eAAAM,UACA,EACAhuB,IAAA,SAAAxO,QAGA+D,IAAAtI,KAAA8gC,qBAAAx4B,IAAAtI,KAAAygC,iBAMAzgC,KAAA8gC,eAAAC,UAAAx8B,EACAvE,KAAAygC,eAAAM,UAAAx8B,EACA,GtD4lOC,GAAExD,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAElC,EAAE,CAAC,qBAAqB,GAAG,qBAAqB,GAAGulB,SAAW,GAAG8T,SAAW,KAAK,GAAG,CAAC,SAASr5B,EAAQf,EAAOD,GuD/rO7GC,EAAAD,QAAAuhC,EACA,IAAAC,EAAAxgC,EAAA,uBAEA,SAAAugC,EAAAjM,GACA,KAAA/0B,gBAAAghC,GAAA,OAAA,IAAAA,EAAAjM,GACAkM,EAAAlgC,KAAAf,KAAA+0B,EACA,CAJAt0B,EAAA,WAAAA,CAAAugC,EAAAC,GAKAD,EAAA39B,UAAA69B,WAAA,SAAAlL,EAAAvuB,EAAAnG,GACAA,EAAA,KAAA00B,EACA,CvD4tOA,EAAE,CAAC,sBAAsB,GAAG8D,SAAW,KAAK,GAAG,CAAC,SAASr5B,EAAQf,EAAOD,IACxE,SAAW0lB,EAAQrlB,IAAQ,WwDvuO3B,IAAAugC,EAHA3gC,EAAAD,QAAAk+B,EAMAA,EAAAwD,cAAAA,EAGA1gC,EAAA,UAAAuY,aAAA,IACAooB,EAAA,SAAAloB,EAAApQ,GACA,OAAAoQ,EAAAuD,UAAA3T,GAAA9H,MACA,EAIAqgC,EAAA5gC,EAAA,6BAGA+F,EAAA/F,EAAA,UAAA+F,OACA86B,QAAA,IAAAxhC,EAAAA,EAAA,oBAAAD,OAAAA,OAAA,oBAAAE,KAAAA,KAAA,CAAA,GAAAkG,YAAA,WAAA,EASA,IACAqY,EADAijB,EAAA9gC,EAAA,QAGA6d,EADAijB,GAAAA,EAAAC,SACAD,EAAAC,SAAA,UAEA,WAAA,EAIA,IAWAC,EACAC,EACAn6B,EAbAo6B,EAAAlhC,EAAA,kCACAmhC,EAAAnhC,EAAA,8BAEAohC,EADAphC,EAAA,4BACAohC,iBACAC,EAAArhC,EAAA,aAAA2+B,MACA2C,EAAAD,EAAAC,qBACAC,EAAAF,EAAAE,0BACAC,EAAAH,EAAAG,2BACAC,EAAAJ,EAAAI,mCAMAzhC,EAAA,WAAAA,CAAAk9B,EAAA0D,GACA,IAAAc,EAAAP,EAAAO,eACAC,EAAA,CAAA,QAAA,QAAA,UAAA,QAAA,UAYA,SAAAjB,EAAApM,EAAAe,EAAAuM,GACAhC,EAAAA,GAAA5/B,EAAA,oBACAs0B,EAAAA,GAAA,CAAA,EAOA,kBAAAsN,IAAAA,EAAAvM,aAAAuK,GAIArgC,KAAAsiC,aAAAvN,EAAAuN,WACAD,IAAAriC,KAAAsiC,WAAAtiC,KAAAsiC,cAAAvN,EAAAwN,oBAIAviC,KAAA4gC,cAAAiB,EAAA7hC,KAAA+0B,EAAA,wBAAAsN,GAKAriC,KAAAmI,OAAA,IAAAw5B,EACA3hC,KAAAgB,OAAA,EACAhB,KAAAwiC,MAAA,KACAxiC,KAAAyiC,WAAA,EACAziC,KAAA0iC,QAAA,KACA1iC,KAAA0gC,OAAA,EACA1gC,KAAA2iC,YAAA,EACA3iC,KAAA4iC,SAAA,EAMA5iC,KAAAiD,MAAA,EAIAjD,KAAA6iC,cAAA,EACA7iC,KAAA8iC,iBAAA,EACA9iC,KAAA+iC,mBAAA,EACA/iC,KAAAgjC,iBAAA,EACAhjC,KAAAijC,QAAA,EAGAjjC,KAAAkjC,WAAA,IAAAnO,EAAAmO,UAGAljC,KAAAmjC,cAAApO,EAAAoO,YAGAnjC,KAAA+gC,WAAA,EAKA/gC,KAAAojC,gBAAArO,EAAAqO,iBAAA,OAGApjC,KAAAqjC,WAAA,EAGArjC,KAAAsjC,aAAA,EACAtjC,KAAAujC,QAAA,KACAvjC,KAAAyH,SAAA,KACAstB,EAAAttB,WACAg6B,IAAAA,EAAAhhC,EAAA,mBAAAghC,eACAzhC,KAAAujC,QAAA,IAAA9B,EAAA1M,EAAAttB,UACAzH,KAAAyH,SAAAstB,EAAAttB,SAEA,CACA,SAAAk2B,EAAA5I,GAEA,GADAsL,EAAAA,GAAA5/B,EAAA,sBACAT,gBAAA29B,GAAA,OAAA,IAAAA,EAAA5I,GAIA,IAAAsN,EAAAriC,gBAAAqgC,EACArgC,KAAA8gC,eAAA,IAAAK,EAAApM,EAAA/0B,KAAAqiC,GAGAriC,KAAAugC,UAAA,EACAxL,IACA,mBAAAA,EAAAnqB,OAAA5K,KAAA8+B,MAAA/J,EAAAnqB,MACA,mBAAAmqB,EAAAoI,UAAAn9B,KAAAwjC,SAAAzO,EAAAoI,UAEAkE,EAAAtgC,KAAAf,KACA,CAwDA,SAAAyjC,EAAA3N,EAAAE,EAAAvuB,EAAAi8B,EAAAC,GACArlB,EAAA,mBAAA0X,GACA,IAKA1Z,EALAf,EAAAua,EAAAgL,eACA,GAAA,OAAA9K,EACAza,EAAAqnB,SAAA,EAuNA,SAAA9M,EAAAva,GAEA,GADA+C,EAAA,cACA/C,EAAAmlB,MAAA,OACA,GAAAnlB,EAAAgoB,QAAA,CACA,IAAAvN,EAAAza,EAAAgoB,QAAAn9B,MACA4vB,GAAAA,EAAAh1B,SACAua,EAAApT,OAAApF,KAAAizB,GACAza,EAAAva,QAAAua,EAAA+mB,WAAA,EAAAtM,EAAAh1B,OAEA,CACAua,EAAAmlB,OAAA,EACAnlB,EAAAtY,KAIA2gC,EAAA9N,IAGAva,EAAAsnB,cAAA,EACAtnB,EAAAunB,kBACAvnB,EAAAunB,iBAAA,EACAe,EAAA/N,IAGA,CA9OAgO,CAAAhO,EAAAva,QAIA,GADAooB,IAAArnB,EA6CA,SAAAf,EAAAya,GACA,IAAA1Z,EAjPApa,EAkPA8zB,EAjPAxvB,EAAAkC,SAAAxG,IAAAA,aAAAo/B,GAiPA,iBAAAtL,QAAA1tB,IAAA0tB,GAAAza,EAAA+mB,aACAhmB,EAAA,IAAAylB,EAAA,QAAA,CAAA,SAAA,SAAA,cAAA/L,IAnPA,IAAA9zB,EAqPA,OAAAoa,CACA,CAnDAynB,CAAAxoB,EAAAya,IACA1Z,EACA6lB,EAAArM,EAAAxZ,QACA,GAAAf,EAAA+mB,YAAAtM,GAAAA,EAAAh1B,OAAA,EAIA,GAHA,iBAAAg1B,GAAAza,EAAA+mB,YAAAl/B,OAAA8Y,eAAA8Z,KAAAxvB,EAAAnD,YACA2yB,EA3MA,SAAAA,GACA,OAAAxvB,EAAAe,KAAAyuB,EACA,CAyMAgO,CAAAhO,IAEA0N,EACAnoB,EAAAonB,WAAAR,EAAArM,EAAA,IAAAoM,GAAA+B,EAAAnO,EAAAva,EAAAya,GAAA,QACA,GAAAza,EAAAmlB,MACAyB,EAAArM,EAAA,IAAAkM,OACA,IAAAzmB,EAAAwlB,UACA,OAAA,EAEAxlB,EAAAqnB,SAAA,EACArnB,EAAAgoB,UAAA97B,GACAuuB,EAAAza,EAAAgoB,QAAA37B,MAAAouB,GACAza,EAAA+mB,YAAA,IAAAtM,EAAAh1B,OAAAijC,EAAAnO,EAAAva,EAAAya,GAAA,GAAAkO,EAAApO,EAAAva,IAEA0oB,EAAAnO,EAAAva,EAAAya,GAAA,EAEA,MACA0N,IACAnoB,EAAAqnB,SAAA,EACAsB,EAAApO,EAAAva,IAOA,OAAAA,EAAAmlB,QAAAnlB,EAAAva,OAAAua,EAAAqlB,eAAA,IAAArlB,EAAAva,OACA,CACA,SAAAijC,EAAAnO,EAAAva,EAAAya,EAAA0N,GACAnoB,EAAAmnB,SAAA,IAAAnnB,EAAAva,SAAAua,EAAAtY,MACAsY,EAAA8nB,WAAA,EACAvN,EAAAjb,KAAA,OAAAmb,KAGAza,EAAAva,QAAAua,EAAA+mB,WAAA,EAAAtM,EAAAh1B,OACA0iC,EAAAnoB,EAAApT,OAAA2S,QAAAkb,GAAAza,EAAApT,OAAApF,KAAAizB,GACAza,EAAAsnB,cAAAe,EAAA9N,IAEAoO,EAAApO,EAAAva,EACA,CA3GAnY,OAAAqK,eAAAkwB,EAAAt6B,UAAA,YAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,YAAArF,IAAAtI,KAAA8gC,gBAGA9gC,KAAA8gC,eAAAC,SACA,EACAhuB,IAAA,SAAAxO,GAGAvE,KAAA8gC,iBAMA9gC,KAAA8gC,eAAAC,UAAAx8B,EACA,IAEAo5B,EAAAt6B,UAAA85B,QAAAyE,EAAAzE,QACAQ,EAAAt6B,UAAA8gC,WAAAvC,EAAAwC,UACAzG,EAAAt6B,UAAAmgC,SAAA,SAAA/gC,EAAAnB,GACAA,EAAAmB,EACA,EAMAk7B,EAAAt6B,UAAAN,KAAA,SAAAizB,EAAAvuB,GACA,IACAk8B,EADApoB,EAAAvb,KAAA8gC,eAcA,OAZAvlB,EAAA+mB,WAUAqB,GAAA,EATA,iBAAA3N,KACAvuB,EAAAA,GAAA8T,EAAA6nB,mBACA7nB,EAAA9T,WACAuuB,EAAAxvB,EAAAe,KAAAyuB,EAAAvuB,GACAA,EAAA,IAEAk8B,GAAA,GAKAF,EAAAzjC,KAAAg2B,EAAAvuB,GAAA,EAAAk8B,EACA,EAGAhG,EAAAt6B,UAAAyX,QAAA,SAAAkb,GACA,OAAAyN,EAAAzjC,KAAAg2B,EAAA,MAAA,GAAA,EACA,EA6DA2H,EAAAt6B,UAAAghC,SAAA,WACA,OAAA,IAAArkC,KAAA8gC,eAAA4B,OACA,EAGA/E,EAAAt6B,UAAAihC,YAAA,SAAAC,GACA9C,IAAAA,EAAAhhC,EAAA,mBAAAghC,eACA,IAAA8B,EAAA,IAAA9B,EAAA8C,GACAvkC,KAAA8gC,eAAAyC,QAAAA,EAEAvjC,KAAA8gC,eAAAr5B,SAAAzH,KAAA8gC,eAAAyC,QAAA97B,SAKA,IAFA,IAAA3G,EAAAd,KAAA8gC,eAAA34B,OAAAq8B,KACAC,EAAA,GACA,OAAA3jC,GACA2jC,GAAAlB,EAAA37B,MAAA9G,EAAAiI,MACAjI,EAAAA,EAAAe,KAKA,OAHA7B,KAAA8gC,eAAA34B,OAAAu8B,QACA,KAAAD,GAAAzkC,KAAA8gC,eAAA34B,OAAApF,KAAA0hC,GACAzkC,KAAA8gC,eAAA9/B,OAAAyjC,EAAAzjC,OACAhB,IACA,EAGA,IAAA2kC,EAAA,WAqBA,SAAAC,EAAAxkC,EAAAmb,GACA,OAAAnb,GAAA,GAAA,IAAAmb,EAAAva,QAAAua,EAAAmlB,MAAA,EACAnlB,EAAA+mB,WAAA,EACAliC,GAAAA,EAEAmb,EAAAmnB,SAAAnnB,EAAAva,OAAAua,EAAApT,OAAAq8B,KAAAz7B,KAAA/H,OAAAua,EAAAva,QAGAZ,EAAAmb,EAAAqlB,gBAAArlB,EAAAqlB,cA5BA,SAAAxgC,GAeA,OAdAA,GAAAukC,EAEAvkC,EAAAukC,GAIAvkC,IACAA,GAAAA,IAAA,EACAA,GAAAA,IAAA,EACAA,GAAAA,IAAA,EACAA,GAAAA,IAAA,EACAA,GAAAA,IAAA,GACAA,KAEAA,CACA,CAYAykC,CAAAzkC,IACAA,GAAAmb,EAAAva,OAAAZ,EAEAmb,EAAAmlB,MAIAnlB,EAAAva,QAHAua,EAAAsnB,cAAA,EACA,GAGA,CA6HA,SAAAe,EAAA9N,GACA,IAAAva,EAAAua,EAAAgL,eACAxiB,EAAA,eAAA/C,EAAAsnB,aAAAtnB,EAAAunB,iBACAvnB,EAAAsnB,cAAA,EACAtnB,EAAAunB,kBACAxkB,EAAA,eAAA/C,EAAAmnB,SACAnnB,EAAAunB,iBAAA,EACA3d,EAAA4L,SAAA8S,EAAA/N,GAEA,CACA,SAAA+N,EAAA/N,GACA,IAAAva,EAAAua,EAAAgL,eACAxiB,EAAA,gBAAA/C,EAAAwlB,UAAAxlB,EAAAva,OAAAua,EAAAmlB,OACAnlB,EAAAwlB,YAAAxlB,EAAAva,SAAAua,EAAAmlB,QACA5K,EAAAjb,KAAA,YACAU,EAAAunB,iBAAA,GASAvnB,EAAAsnB,cAAAtnB,EAAAmnB,UAAAnnB,EAAAmlB,OAAAnlB,EAAAva,QAAAua,EAAAqlB,cACAkE,EAAAhP,EACA,CAQA,SAAAoO,EAAApO,EAAAva,GACAA,EAAA+nB,cACA/nB,EAAA+nB,aAAA,EACAne,EAAA4L,SAAAgU,EAAAjP,EAAAva,GAEA,CACA,SAAAwpB,EAAAjP,EAAAva,GAwBA,MAAAA,EAAAqnB,UAAArnB,EAAAmlB,QAAAnlB,EAAAva,OAAAua,EAAAqlB,eAAArlB,EAAAmnB,SAAA,IAAAnnB,EAAAva,SAAA,CACA,IAAA0C,EAAA6X,EAAAva,OAGA,GAFAsd,EAAA,wBACAwX,EAAAlrB,KAAA,GACAlH,IAAA6X,EAAAva,OAEA,KACA,CACAua,EAAA+nB,aAAA,CACA,CAgPA,SAAA0B,EAAAjlC,GACA,IAAAwb,EAAAxb,EAAA+gC,eACAvlB,EAAAwnB,kBAAAhjC,EAAA+b,cAAA,YAAA,EACAP,EAAAynB,kBAAAznB,EAAA0nB,OAGA1nB,EAAAmnB,SAAA,EAGA3iC,EAAA+b,cAAA,QAAA,GACA/b,EAAAy3B,QAEA,CACA,SAAAyN,EAAAllC,GACAue,EAAA,4BACAve,EAAA6K,KAAA,EACA,CAuBA,SAAAs6B,EAAApP,EAAAva,GACA+C,EAAA,SAAA/C,EAAAqnB,SACArnB,EAAAqnB,SACA9M,EAAAlrB,KAAA,GAEA2Q,EAAAynB,iBAAA,EACAlN,EAAAjb,KAAA,UACAiqB,EAAAhP,GACAva,EAAAmnB,UAAAnnB,EAAAqnB,SAAA9M,EAAAlrB,KAAA,EACA,CAWA,SAAAk6B,EAAAhP,GACA,IAAAva,EAAAua,EAAAgL,eAEA,IADAxiB,EAAA,OAAA/C,EAAAmnB,SACAnnB,EAAAmnB,SAAA,OAAA5M,EAAAlrB,SACA,CAmHA,SAAAu6B,EAAA/kC,EAAAmb,GAEA,OAAA,IAAAA,EAAAva,OAAA,MAEAua,EAAA+mB,WAAA7yB,EAAA8L,EAAApT,OAAA4U,SAAA3c,GAAAA,GAAAmb,EAAAva,QAEAyO,EAAA8L,EAAAgoB,QAAAhoB,EAAApT,OAAAnC,KAAA,IAAA,IAAAuV,EAAApT,OAAAnH,OAAAua,EAAApT,OAAAi9B,QAAA7pB,EAAApT,OAAAzD,OAAA6W,EAAAva,QACAua,EAAApT,OAAAu8B,SAGAj1B,EAAA8L,EAAApT,OAAAk9B,QAAAjlC,EAAAmb,EAAAgoB,SAEA9zB,GATA,IAAAA,CAUA,CACA,SAAA61B,EAAAxP,GACA,IAAAva,EAAAua,EAAAgL,eACAxiB,EAAA,cAAA/C,EAAAonB,YACApnB,EAAAonB,aACApnB,EAAAmlB,OAAA,EACAvb,EAAA4L,SAAAwU,EAAAhqB,EAAAua,GAEA,CACA,SAAAyP,EAAAhqB,EAAAua,GAIA,GAHAxX,EAAA,gBAAA/C,EAAAonB,WAAApnB,EAAAva,SAGAua,EAAAonB,YAAA,IAAApnB,EAAAva,SACAua,EAAAonB,YAAA,EACA7M,EAAAyK,UAAA,EACAzK,EAAAjb,KAAA,OACAU,EAAA4nB,aAAA,CAGA,IAAAqC,EAAA1P,EAAA2K,iBACA+E,GAAAA,EAAArC,aAAAqC,EAAAC,WACA3P,EAAAqH,SAEA,CAEA,CASA,SAAAj3B,EAAAqvB,EAAAnnB,GACA,IAAA,IAAA7N,EAAA,EAAAmlC,EAAAnQ,EAAAv0B,OAAAT,EAAAmlC,EAAAnlC,IACA,GAAAg1B,EAAAh1B,KAAA6N,EAAA,OAAA7N,EAEA,OAAA,CACA,CA1pBAo9B,EAAAt6B,UAAAuH,KAAA,SAAAxK,GACAke,EAAA,OAAAle,GACAA,EAAAmL,SAAAnL,EAAA,IACA,IAAAmb,EAAAvb,KAAA8gC,eACA6E,EAAAvlC,EAMA,GALA,IAAAA,IAAAmb,EAAAunB,iBAAA,GAKA,IAAA1iC,GAAAmb,EAAAsnB,gBAAA,IAAAtnB,EAAAqlB,cAAArlB,EAAAva,QAAAua,EAAAqlB,cAAArlB,EAAAva,OAAA,IAAAua,EAAAmlB,OAGA,OAFApiB,EAAA,qBAAA/C,EAAAva,OAAAua,EAAAmlB,OACA,IAAAnlB,EAAAva,QAAAua,EAAAmlB,MAAA4E,EAAAtlC,MAAA4jC,EAAA5jC,MACA,KAKA,GAAA,KAHAI,EAAAwkC,EAAAxkC,EAAAmb,KAGAA,EAAAmlB,MAEA,OADA,IAAAnlB,EAAAva,QAAAskC,EAAAtlC,MACA,KA0BA,IA2BAyP,EA3BAm2B,EAAArqB,EAAAsnB,aA6CA,OA5CAvkB,EAAA,gBAAAsnB,IAGA,IAAArqB,EAAAva,QAAAua,EAAAva,OAAAZ,EAAAmb,EAAAqlB,gBAEAtiB,EAAA,6BADAsnB,GAAA,GAMArqB,EAAAmlB,OAAAnlB,EAAAqnB,QAEAtkB,EAAA,mBADAsnB,GAAA,GAEAA,IACAtnB,EAAA,WACA/C,EAAAqnB,SAAA,EACArnB,EAAAtY,MAAA,EAEA,IAAAsY,EAAAva,SAAAua,EAAAsnB,cAAA,GAEA7iC,KAAA8+B,MAAAvjB,EAAAqlB,eACArlB,EAAAtY,MAAA,EAGAsY,EAAAqnB,UAAAxiC,EAAAwkC,EAAAe,EAAApqB,KAIA,QADA9L,EAAArP,EAAA,EAAA+kC,EAAA/kC,EAAAmb,GAAA,OAEAA,EAAAsnB,aAAAtnB,EAAAva,QAAAua,EAAAqlB,cACAxgC,EAAA,IAEAmb,EAAAva,QAAAZ,EACAmb,EAAA8nB,WAAA,GAEA,IAAA9nB,EAAAva,SAGAua,EAAAmlB,QAAAnlB,EAAAsnB,cAAA,GAGA8C,IAAAvlC,GAAAmb,EAAAmlB,OAAA4E,EAAAtlC,OAEA,OAAAyP,GAAAzP,KAAA6a,KAAA,OAAApL,GACAA,CACA,EA6GAkuB,EAAAt6B,UAAAy7B,MAAA,SAAA1+B,GACA+hC,EAAAniC,KAAA,IAAAiiC,EAAA,WACA,EACAtE,EAAAt6B,UAAAgzB,KAAA,SAAAwP,EAAAC,GACA,IAAAzyB,EAAArT,KACAub,EAAAvb,KAAA8gC,eACA,OAAAvlB,EAAAknB,YACA,KAAA,EACAlnB,EAAAinB,MAAAqD,EACA,MACA,KAAA,EACAtqB,EAAAinB,MAAA,CAAAjnB,EAAAinB,MAAAqD,GACA,MACA,QACAtqB,EAAAinB,MAAAz/B,KAAA8iC,GAGAtqB,EAAAknB,YAAA,EACAnkB,EAAA,wBAAA/C,EAAAknB,WAAAqD,GACA,IACAC,IADAD,IAAA,IAAAA,EAAA1/B,MAAAy/B,IAAA1gB,EAAA6gB,QAAAH,IAAA1gB,EAAA8gB,OACAzF,EAAA0F,EAGA,SAAAC,EAAA5F,EAAA6F,GACA9nB,EAAA,YACAiiB,IAAAltB,GACA+yB,IAAA,IAAAA,EAAAC,aACAD,EAAAC,YAAA,EAkBA/nB,EAAA,WAEAunB,EAAAtsB,eAAA,QAAA+sB,GACAT,EAAAtsB,eAAA,SAAAgtB,GACAV,EAAAtsB,eAAA,QAAAitB,GACAX,EAAAtsB,eAAA,QAAAujB,GACA+I,EAAAtsB,eAAA,SAAA4sB,GACA9yB,EAAAkG,eAAA,MAAAinB,GACAntB,EAAAkG,eAAA,MAAA2sB,GACA7yB,EAAAkG,eAAA,OAAAktB,GACAC,GAAA,GAOAnrB,EAAA8nB,YAAAwC,EAAApF,iBAAAoF,EAAApF,eAAAkG,WAAAH,IA/BA,CACA,SAAAhG,IACAliB,EAAA,SACAunB,EAAAz/B,KACA,CAdAmV,EAAAonB,WAAAxd,EAAA4L,SAAAgV,GAAA1yB,EAAAvR,KAAA,MAAAikC,GACAF,EAAAjsB,GAAA,SAAAusB,GAmBA,IAAAK,EAgFA,SAAAnzB,GACA,OAAA,WACA,IAAAkI,EAAAlI,EAAAytB,eACAxiB,EAAA,cAAA/C,EAAA8nB,YACA9nB,EAAA8nB,YAAA9nB,EAAA8nB,aACA,IAAA9nB,EAAA8nB,YAAAjC,EAAA/tB,EAAA,UACAkI,EAAAmnB,SAAA,EACAoC,EAAAzxB,GAEA,CACA,CA1FAuzB,CAAAvzB,GACAwyB,EAAAjsB,GAAA,QAAA4sB,GACA,IAAAE,GAAA,EAsBA,SAAAD,EAAAzQ,GACA1X,EAAA,UACA,IAAA7O,EAAAo2B,EAAAj+B,MAAAouB,GACA1X,EAAA,aAAA7O,IACA,IAAAA,KAKA,IAAA8L,EAAAknB,YAAAlnB,EAAAinB,QAAAqD,GAAAtqB,EAAAknB,WAAA,IAAA,IAAAv8B,EAAAqV,EAAAinB,MAAAqD,MAAAa,IACApoB,EAAA,8BAAA/C,EAAA8nB,YACA9nB,EAAA8nB,cAEAhwB,EAAAwzB,QAEA,CAIA,SAAA/J,EAAAxgB,GACAgC,EAAA,UAAAhC,GACA4pB,IACAL,EAAAtsB,eAAA,QAAAujB,GACA,IAAAsE,EAAAyE,EAAA,UAAA1D,EAAA0D,EAAAvpB,EACA,CAMA,SAAAgqB,IACAT,EAAAtsB,eAAA,SAAAgtB,GACAL,GACA,CAEA,SAAAK,IACAjoB,EAAA,YACAunB,EAAAtsB,eAAA,QAAA+sB,GACAJ,GACA,CAEA,SAAAA,IACA5nB,EAAA,UACAjL,EAAA6yB,OAAAL,EACA,CAUA,OAvDAxyB,EAAAuG,GAAA,OAAA6sB,GAniBA,SAAAvtB,EAAA4tB,EAAAplC,GAGA,GAAA,mBAAAwX,EAAAyD,gBAAA,OAAAzD,EAAAyD,gBAAAmqB,EAAAplC,GAMAwX,EAAAY,SAAAZ,EAAAY,QAAAgtB,GAAA5jC,MAAAC,QAAA+V,EAAAY,QAAAgtB,IAAA5tB,EAAAY,QAAAgtB,GAAAhsB,QAAApZ,GAAAwX,EAAAY,QAAAgtB,GAAA,CAAAplC,EAAAwX,EAAAY,QAAAgtB,IAAA5tB,EAAAU,GAAAktB,EAAAplC,EACA,CAqjBAib,CAAAkpB,EAAA,QAAA/I,GAOA+I,EAAA/jC,KAAA,QAAAwkC,GAMAT,EAAA/jC,KAAA,SAAAykC,GAOAV,EAAAhrB,KAAA,OAAAxH,GAGAkI,EAAAmnB,UACApkB,EAAA,eACAjL,EAAAmkB,UAEAqO,CACA,EAYAlI,EAAAt6B,UAAA6iC,OAAA,SAAAL,GACA,IAAAtqB,EAAAvb,KAAA8gC,eACAsF,EAAA,CACAC,YAAA,GAIA,GAAA,IAAA9qB,EAAAknB,WAAA,OAAAziC,KAGA,GAAA,IAAAub,EAAAknB,WAEA,OAAAoD,GAAAA,IAAAtqB,EAAAinB,QACAqD,IAAAA,EAAAtqB,EAAAinB,OAGAjnB,EAAAinB,MAAA,KACAjnB,EAAAknB,WAAA,EACAlnB,EAAAmnB,SAAA,EACAmD,GAAAA,EAAAhrB,KAAA,SAAA7a,KAAAomC,IAPApmC,KAaA,IAAA6lC,EAAA,CAEA,IAAAkB,EAAAxrB,EAAAinB,MACA9+B,EAAA6X,EAAAknB,WACAlnB,EAAAinB,MAAA,KACAjnB,EAAAknB,WAAA,EACAlnB,EAAAmnB,SAAA,EACA,IAAA,IAAAniC,EAAA,EAAAA,EAAAmD,EAAAnD,IAAAwmC,EAAAxmC,GAAAsa,KAAA,SAAA7a,KAAA,CACAqmC,YAAA,IAEA,OAAArmC,IACA,CAGA,IAAAyB,EAAAyE,EAAAqV,EAAAinB,MAAAqD,GACA,OAAA,IAAApkC,IACA8Z,EAAAinB,MAAAxO,OAAAvyB,EAAA,GACA8Z,EAAAknB,YAAA,EACA,IAAAlnB,EAAAknB,aAAAlnB,EAAAinB,MAAAjnB,EAAAinB,MAAA,IACAqD,EAAAhrB,KAAA,SAAA7a,KAAAomC,IAJApmC,IAMA,EAIA29B,EAAAt6B,UAAAuW,GAAA,SAAAotB,EAAAtlC,GACA,IAAA6K,EAAA80B,EAAAh+B,UAAAuW,GAAA7Y,KAAAf,KAAAgnC,EAAAtlC,GACA6Z,EAAAvb,KAAA8gC,eAqBA,MApBA,SAAAkG,GAGAzrB,EAAAwnB,kBAAA/iC,KAAA8b,cAAA,YAAA,GAGA,IAAAP,EAAAmnB,SAAA1iC,KAAAw3B,UACA,aAAAwP,IACAzrB,EAAAonB,YAAApnB,EAAAwnB,oBACAxnB,EAAAwnB,kBAAAxnB,EAAAsnB,cAAA,EACAtnB,EAAAmnB,SAAA,EACAnnB,EAAAunB,iBAAA,EACAxkB,EAAA,cAAA/C,EAAAva,OAAAua,EAAAqnB,SACArnB,EAAAva,OACA4iC,EAAA5jC,MACAub,EAAAqnB,SACAzd,EAAA4L,SAAAkU,EAAAjlC,QAIAuM,CACA,EACAoxB,EAAAt6B,UAAAqZ,YAAAihB,EAAAt6B,UAAAuW,GACA+jB,EAAAt6B,UAAAkW,eAAA,SAAAytB,EAAAtlC,GACA,IAAA6K,EAAA80B,EAAAh+B,UAAAkW,eAAAxY,KAAAf,KAAAgnC,EAAAtlC,GAUA,MATA,aAAAslC,GAOA7hB,EAAA4L,SAAAiU,EAAAhlC,MAEAuM,CACA,EACAoxB,EAAAt6B,UAAA6Z,mBAAA,SAAA8pB,GACA,IAAAz6B,EAAA80B,EAAAh+B,UAAA6Z,mBAAAvb,MAAA3B,KAAA4B,WAUA,MATA,aAAAolC,QAAA1+B,IAAA0+B,GAOA7hB,EAAA4L,SAAAiU,EAAAhlC,MAEAuM,CACA,EAqBAoxB,EAAAt6B,UAAAm0B,OAAA,WACA,IAAAjc,EAAAvb,KAAA8gC,eAUA,OATAvlB,EAAAmnB,UACApkB,EAAA,UAIA/C,EAAAmnB,SAAAnnB,EAAAwnB,kBAMA,SAAAjN,EAAAva,GACAA,EAAAynB,kBACAznB,EAAAynB,iBAAA,EACA7d,EAAA4L,SAAAmU,EAAApP,EAAAva,GAEA,CAVAic,CAAAx3B,KAAAub,IAEAA,EAAA0nB,QAAA,EACAjjC,IACA,EAiBA29B,EAAAt6B,UAAAwjC,MAAA,WAQA,OAPAvoB,EAAA,wBAAAte,KAAA8gC,eAAA4B,UACA,IAAA1iC,KAAA8gC,eAAA4B,UACApkB,EAAA,SACAte,KAAA8gC,eAAA4B,SAAA,EACA1iC,KAAA6a,KAAA,UAEA7a,KAAA8gC,eAAAmC,QAAA,EACAjjC,IACA,EAUA29B,EAAAt6B,UAAA4jC,KAAA,SAAAnR,GACA,IAAAoR,EAAAlnC,KACAub,EAAAvb,KAAA8gC,eACAmC,GAAA,EAwBA,IAAA,IAAA1iC,KAvBAu1B,EAAAlc,GAAA,OAAA,WAEA,GADA0E,EAAA,eACA/C,EAAAgoB,UAAAhoB,EAAAmlB,MAAA,CACA,IAAA1K,EAAAza,EAAAgoB,QAAAn9B,MACA4vB,GAAAA,EAAAh1B,QAAAkmC,EAAAnkC,KAAAizB,EACA,CACAkR,EAAAnkC,KAAA,KACA,IACA+yB,EAAAlc,GAAA,QAAA,SAAAoc,IACA1X,EAAA,gBACA/C,EAAAgoB,UAAAvN,EAAAza,EAAAgoB,QAAA37B,MAAAouB,IAGAza,EAAA+mB,YAAA,MAAAtM,KAAAza,EAAA+mB,YAAAtM,GAAAA,EAAAh1B,UACAkmC,EAAAnkC,KAAAizB,KAEAiN,GAAA,EACAnN,EAAA+Q,SAEA,IAIA/Q,OACAxtB,IAAAtI,KAAAO,IAAA,mBAAAu1B,EAAAv1B,KACAP,KAAAO,GAAA,SAAAw2B,GACA,OAAA,WACA,OAAAjB,EAAAiB,GAAAp1B,MAAAm0B,EAAAl0B,UACA,CACA,CAJA,CAIArB,IAKA,IAAA,IAAAH,EAAA,EAAAA,EAAAgiC,EAAAphC,OAAAZ,IACA01B,EAAAlc,GAAAwoB,EAAAhiC,GAAAJ,KAAA6a,KAAAzE,KAAApW,KAAAoiC,EAAAhiC,KAYA,OAPAJ,KAAA8+B,MAAA,SAAA1+B,GACAke,EAAA,gBAAAle,GACA6iC,IACAA,GAAA,EACAnN,EAAA0B,SAEA,EACAx3B,IACA,EACA,mBAAAiJ,SACA00B,EAAAt6B,UAAA4F,OAAAk+B,eAAA,WAIA,YAHA7+B,IAAAo5B,IACAA,EAAAjhC,EAAA,sCAEAihC,EAAA1hC,KACA,GAEAoD,OAAAqK,eAAAkwB,EAAAt6B,UAAA,wBAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,OAAA3N,KAAA8gC,eAAAF,aACA,IAEAx9B,OAAAqK,eAAAkwB,EAAAt6B,UAAA,iBAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,OAAA3N,KAAA8gC,gBAAA9gC,KAAA8gC,eAAA34B,MACA,IAEA/E,OAAAqK,eAAAkwB,EAAAt6B,UAAA,kBAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,OAAA3N,KAAA8gC,eAAA4B,OACA,EACA3vB,IAAA,SAAAwI,GACAvb,KAAA8gC,iBACA9gC,KAAA8gC,eAAA4B,QAAAnnB,EAEA,IAIAoiB,EAAAyJ,UAAAjC,EACA/hC,OAAAqK,eAAAkwB,EAAAt6B,UAAA,iBAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,OAAA3N,KAAA8gC,eAAA9/B,MACA,IA+CA,mBAAAiI,SACA00B,EAAAp2B,KAAA,SAAA8/B,EAAA/Q,GAIA,YAHAhuB,IAAAf,IACAA,EAAA9G,EAAA,4BAEA8G,EAAAo2B,EAAA0J,EAAA/Q,EACA,ExD0wOC,GAAEv1B,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAA8B,oBAAXX,OAAyBA,OAAyB,oBAATC,KAAuBA,KAAyB,oBAAXF,OAAyBA,OAAS,CAAC,EAEtK,EAAE,CAAC,YAAY,GAAG,mBAAmB,GAAG,oCAAoC,GAAG,iCAAiC,GAAG,6BAA6B,GAAG,0BAA0B,GAAG,2BAA2B,GAAG,4BAA4B,GAAGmmB,SAAW,GAAG7d,OAAS,GAAGqS,OAAS,GAAGsf,SAAW,GAAG,kBAAkB,GAAGwN,KAAO,KAAK,GAAG,CAAC,SAAS7mC,EAAQf,EAAOD,GyDtsQ9VC,EAAAD,QAAAwhC,EACA,IAAAa,EAAArhC,EAAA,aAAA2+B,MACA6C,EAAAH,EAAAG,2BACAsF,EAAAzF,EAAAyF,sBACAC,EAAA1F,EAAA0F,mCACAC,EAAA3F,EAAA2F,4BACApH,EAAA5/B,EAAA,oBAEA,SAAAinC,EAAAprB,EAAAvT,GACA,IAAA4+B,EAAA3nC,KAAA4nC,gBACAD,EAAAE,cAAA,EACA,IAAAvmC,EAAAqmC,EAAAG,QACA,GAAA,OAAAxmC,EACA,OAAAtB,KAAA6a,KAAA,QAAA,IAAA0sB,GAEAI,EAAAI,WAAA,KACAJ,EAAAG,QAAA,KACA,MAAA/+B,GAEA/I,KAAA+C,KAAAgG,GACAzH,EAAAgb,GACA,IAAA0rB,EAAAhoC,KAAA8gC,eACAkH,EAAApF,SAAA,GACAoF,EAAAnF,cAAAmF,EAAAhnC,OAAAgnC,EAAApH,gBACA5gC,KAAA8+B,MAAAkJ,EAAApH,cAEA,CACA,SAAAK,EAAAlM,GACA,KAAA/0B,gBAAAihC,GAAA,OAAA,IAAAA,EAAAlM,GACAsL,EAAAt/B,KAAAf,KAAA+0B,GACA/0B,KAAA4nC,gBAAA,CACAF,eAAAA,EAAAtxB,KAAApW,MACAioC,eAAA,EACAJ,cAAA,EACAC,QAAA,KACAC,WAAA,KACAG,cAAA,MAIAloC,KAAA8gC,eAAA+B,cAAA,EAKA7iC,KAAA8gC,eAAA79B,MAAA,EACA8xB,IACA,mBAAAA,EAAAoT,YAAAnoC,KAAAkhC,WAAAnM,EAAAoT,WACA,mBAAApT,EAAAqT,QAAApoC,KAAAqoC,OAAAtT,EAAAqT,QAIApoC,KAAA4Z,GAAA,YAAA0uB,EACA,CACA,SAAAA,IACA,IAAApB,EAAAlnC,KACA,mBAAAA,KAAAqoC,QAAAroC,KAAA8gC,eAAAC,UAKA3+B,EAAApC,KAAA,KAAA,MAJAA,KAAAqoC,QAAA,SAAA/rB,EAAAvT,GACA3G,EAAA8kC,EAAA5qB,EAAAvT,EACA,GAIA,CAiDA,SAAA3G,EAAA0zB,EAAAxZ,EAAAvT,GACA,GAAAuT,EAAA,OAAAwZ,EAAAjb,KAAA,QAAAyB,GAQA,GAPA,MAAAvT,GAEA+sB,EAAA/yB,KAAAgG,GAKA+sB,EAAA2K,eAAAz/B,OAAA,MAAA,IAAAymC,EACA,GAAA3R,EAAA8R,gBAAAC,aAAA,MAAA,IAAAL,EACA,OAAA1R,EAAA/yB,KAAA,KACA,CArHAtC,EAAA,WAAAA,CAAAwgC,EAAAZ,GAyDAY,EAAA59B,UAAAN,KAAA,SAAAizB,EAAAvuB,GAEA,OADAzH,KAAA4nC,gBAAAK,eAAA,EACA5H,EAAAh9B,UAAAN,KAAAhC,KAAAf,KAAAg2B,EAAAvuB,EACA,EAYAw5B,EAAA59B,UAAA69B,WAAA,SAAAlL,EAAAvuB,EAAAnG,GACAA,EAAA,IAAA2gC,EAAA,gBACA,EACAhB,EAAA59B,UAAA65B,OAAA,SAAAlH,EAAAvuB,EAAAnG,GACA,IAAAqmC,EAAA3nC,KAAA4nC,gBAIA,GAHAD,EAAAG,QAAAxmC,EACAqmC,EAAAI,WAAA/R,EACA2R,EAAAO,cAAAzgC,GACAkgC,EAAAE,aAAA,CACA,IAAAG,EAAAhoC,KAAA8gC,gBACA6G,EAAAM,eAAAD,EAAAnF,cAAAmF,EAAAhnC,OAAAgnC,EAAApH,gBAAA5gC,KAAA8+B,MAAAkJ,EAAApH,cACA,CACA,EAKAK,EAAA59B,UAAAy7B,MAAA,SAAA1+B,GACA,IAAAunC,EAAA3nC,KAAA4nC,gBACA,OAAAD,EAAAI,YAAAJ,EAAAE,aAMAF,EAAAM,eAAA,GALAN,EAAAE,cAAA,EACA7nC,KAAAkhC,WAAAyG,EAAAI,WAAAJ,EAAAO,cAAAP,EAAAD,gBAMA,EACAzG,EAAA59B,UAAAmgC,SAAA,SAAA/gC,EAAAnB,GACA++B,EAAAh9B,UAAAmgC,SAAAziC,KAAAf,KAAAyC,GAAA,SAAA8lC,GACAjnC,EAAAinC,EACA,GACA,CzDsxQA,EAAE,CAAC,YAAY,GAAG,mBAAmB,GAAGzO,SAAW,KAAK,GAAG,CAAC,SAASr5B,EAAQf,EAAOD,IACpF,SAAW0lB,EAAQrlB,IAAQ,W0Dh6Q3B,SAAA0oC,EAAAjtB,GACA,IAAA2rB,EAAAlnC,KACAA,KAAA6B,KAAA,KACA7B,KAAAyoC,MAAA,KACAzoC,KAAA0oC,OAAA,YA6iBA,SAAAC,EAAAptB,EAAA9Y,GACA,IAAAgmC,EAAAE,EAAAF,MACAE,EAAAF,MAAA,KACA,KAAAA,GAAA,CACA,IAAAnnC,EAAAmnC,EAAA5lC,SACA0Y,EAAAqtB,YACAtnC,EAAAmB,GACAgmC,EAAAA,EAAA5mC,IACA,CAGA0Z,EAAAstB,mBAAAhnC,KAAA8mC,CACA,CAxjBAG,CAAA5B,EAAA3rB,EACA,CACA,CAIA,IAAA8kB,EAvBA3gC,EAAAD,QAAAy6B,EA0BAA,EAAA6O,cAAAA,EAGA,IAAAC,EAAA,CACAC,UAAAxoC,EAAA,mBAKA4gC,EAAA5gC,EAAA,6BAGA+F,EAAA/F,EAAA,UAAA+F,OACA86B,QAAA,IAAAxhC,EAAAA,EAAA,oBAAAD,OAAAA,OAAA,oBAAAE,KAAAA,KAAA,CAAA,GAAAkG,YAAA,WAAA,EAOA,IA8IAijC,EA9IAtH,EAAAnhC,EAAA,8BAEAohC,EADAphC,EAAA,4BACAohC,iBACAC,EAAArhC,EAAA,aAAA2+B,MACA2C,EAAAD,EAAAC,qBACAE,EAAAH,EAAAG,2BACAsF,EAAAzF,EAAAyF,sBACA4B,EAAArH,EAAAqH,uBACAC,EAAAtH,EAAAsH,qBACAC,EAAAvH,EAAAuH,uBACAC,EAAAxH,EAAAwH,2BACAC,EAAAzH,EAAAyH,qBACApH,EAAAP,EAAAO,eAEA,SAAAqH,IAAA,CACA,SAAAT,EAAAhU,EAAAe,EAAAuM,GACAhC,EAAAA,GAAA5/B,EAAA,oBACAs0B,EAAAA,GAAA,CAAA,EAOA,kBAAAsN,IAAAA,EAAAvM,aAAAuK,GAIArgC,KAAAsiC,aAAAvN,EAAAuN,WACAD,IAAAriC,KAAAsiC,WAAAtiC,KAAAsiC,cAAAvN,EAAA0U,oBAKAzpC,KAAA4gC,cAAAiB,EAAA7hC,KAAA+0B,EAAA,wBAAAsN,GAGAriC,KAAA0pC,aAAA,EAGA1pC,KAAA2mC,WAAA,EAEA3mC,KAAA2pC,QAAA,EAEA3pC,KAAA0gC,OAAA,EAEA1gC,KAAAylC,UAAA,EAGAzlC,KAAA+gC,WAAA,EAKA,IAAA6I,GAAA,IAAA7U,EAAA8U,cACA7pC,KAAA6pC,eAAAD,EAKA5pC,KAAAojC,gBAAArO,EAAAqO,iBAAA,OAKApjC,KAAAgB,OAAA,EAGAhB,KAAA8pC,SAAA,EAGA9pC,KAAA+pC,OAAA,EAMA/pC,KAAAiD,MAAA,EAKAjD,KAAAgqC,kBAAA,EAGAhqC,KAAAiqC,QAAA,SAAA3tB,IAsQA,SAAAwZ,EAAAxZ,GACA,IAAAf,EAAAua,EAAA2K,eACAx9B,EAAAsY,EAAAtY,KACA3B,EAAAia,EAAAusB,QACA,GAAA,mBAAAxmC,EAAA,MAAA,IAAAimC,EAEA,GAZA,SAAAhsB,GACAA,EAAAuuB,SAAA,EACAvuB,EAAAusB,QAAA,KACAvsB,EAAAva,QAAAua,EAAA2uB,SACA3uB,EAAA2uB,SAAA,CACA,CAMAC,CAAA5uB,GACAe,GAlCA,SAAAwZ,EAAAva,EAAAtY,EAAAqZ,EAAAhb,KACAia,EAAAqtB,UACA3lC,GAGAkiB,EAAA4L,SAAAzvB,EAAAgb,GAGA6I,EAAA4L,SAAAqZ,EAAAtU,EAAAva,GACAua,EAAA2K,eAAA4J,cAAA,EACAlI,EAAArM,EAAAxZ,KAIAhb,EAAAgb,GACAwZ,EAAA2K,eAAA4J,cAAA,EACAlI,EAAArM,EAAAxZ,GAGA8tB,EAAAtU,EAAAva,GAEA,CAaA+uB,CAAAxU,EAAAva,EAAAtY,EAAAqZ,EAAAhb,OAAA,CAEA,IAAAmkC,EAAA8E,EAAAhvB,IAAAua,EAAAiL,UACA0E,GAAAlqB,EAAAwuB,QAAAxuB,EAAAyuB,mBAAAzuB,EAAAivB,iBACAC,EAAA3U,EAAAva,GAEAtY,EACAkiB,EAAA4L,SAAA2Z,EAAA5U,EAAAva,EAAAkqB,EAAAnkC,GAEAopC,EAAA5U,EAAAva,EAAAkqB,EAAAnkC,EAEA,CACA,CAvRA2oC,CAAAnU,EAAAxZ,EACA,EAGAtc,KAAA8nC,QAAA,KAGA9nC,KAAAkqC,SAAA,EACAlqC,KAAAwqC,gBAAA,KACAxqC,KAAA2qC,oBAAA,KAIA3qC,KAAA4oC,UAAA,EAIA5oC,KAAA4qC,aAAA,EAGA5qC,KAAAqqC,cAAA,EAGArqC,KAAAkjC,WAAA,IAAAnO,EAAAmO,UAGAljC,KAAAmjC,cAAApO,EAAAoO,YAGAnjC,KAAA6qC,qBAAA,EAIA7qC,KAAA6oC,mBAAA,IAAAL,EAAAxoC,KACA,CAqCA,SAAAk6B,EAAAnF,GAaA,IAAAsN,EAAAriC,gBAZAqgC,EAAAA,GAAA5/B,EAAA,qBAaA,IAAA4hC,IAAA6G,EAAAnoC,KAAAm5B,EAAAl6B,MAAA,OAAA,IAAAk6B,EAAAnF,GACA/0B,KAAAygC,eAAA,IAAAsI,EAAAhU,EAAA/0B,KAAAqiC,GAGAriC,KAAA8N,UAAA,EACAinB,IACA,mBAAAA,EAAAntB,QAAA5H,KAAAk9B,OAAAnI,EAAAntB,OACA,mBAAAmtB,EAAA+V,SAAA9qC,KAAA+qC,QAAAhW,EAAA+V,QACA,mBAAA/V,EAAAoI,UAAAn9B,KAAAwjC,SAAAzO,EAAAoI,SACA,mBAAApI,EAAAiW,QAAAhrC,KAAAirC,OAAAlW,EAAAiW,QAEA3J,EAAAtgC,KAAAf,KACA,CAgIA,SAAAkrC,EAAApV,EAAAva,EAAAuvB,EAAApnC,EAAAsyB,EAAAvuB,EAAAnG,GACAia,EAAA2uB,SAAAxmC,EACA6X,EAAAusB,QAAAxmC,EACAia,EAAAuuB,SAAA,EACAvuB,EAAAtY,MAAA,EACAsY,EAAAwlB,UAAAxlB,EAAA0uB,QAAA,IAAAb,EAAA,UAAA0B,EAAAhV,EAAAiV,QAAA/U,EAAAza,EAAA0uB,SAAAnU,EAAAoH,OAAAlH,EAAAvuB,EAAA8T,EAAA0uB,SACA1uB,EAAAtY,MAAA,CACA,CAgDA,SAAAynC,EAAA5U,EAAAva,EAAAkqB,EAAAnkC,GACAmkC,GASA,SAAA3P,EAAAva,GACA,IAAAA,EAAAva,QAAAua,EAAAorB,YACAprB,EAAAorB,WAAA,EACA7Q,EAAAjb,KAAA,SAEA,CAdAswB,CAAArV,EAAAva,GACAA,EAAAqtB,YACAtnC,IACA8oC,EAAAtU,EAAAva,EACA,CAaA,SAAAkvB,EAAA3U,EAAAva,GACAA,EAAAyuB,kBAAA,EACA,IAAAvB,EAAAltB,EAAAivB,gBACA,GAAA1U,EAAAiV,SAAAtC,GAAAA,EAAA5mC,KAAA,CAEA,IAAA6jC,EAAAnqB,EAAAsvB,qBACA1iC,EAAA,IAAAjF,MAAAwiC,GACA0F,EAAA7vB,EAAAstB,mBACAuC,EAAA3C,MAAAA,EAGA,IAFA,IAAAxtB,EAAA,EACAowB,GAAA,EACA5C,GACAtgC,EAAA8S,GAAAwtB,EACAA,EAAA6C,QAAAD,GAAA,GACA5C,EAAAA,EAAA5mC,KACAoZ,GAAA,EAEA9S,EAAAkjC,WAAAA,EACAH,EAAApV,EAAAva,GAAA,EAAAA,EAAAva,OAAAmH,EAAA,GAAAijC,EAAA1C,QAIAntB,EAAAqtB,YACArtB,EAAAovB,oBAAA,KACAS,EAAAvpC,MACA0Z,EAAAstB,mBAAAuC,EAAAvpC,KACAupC,EAAAvpC,KAAA,MAEA0Z,EAAAstB,mBAAA,IAAAL,EAAAjtB,GAEAA,EAAAsvB,qBAAA,CACA,KAAA,CAEA,KAAApC,GAAA,CACA,IAAAzS,EAAAyS,EAAAzS,MACAvuB,EAAAghC,EAAAhhC,SACAnG,EAAAmnC,EAAA5lC,SASA,GAPAqoC,EAAApV,EAAAva,GAAA,EADAA,EAAA+mB,WAAA,EAAAtM,EAAAh1B,OACAg1B,EAAAvuB,EAAAnG,GACAmnC,EAAAA,EAAA5mC,KACA0Z,EAAAsvB,uBAKAtvB,EAAAuuB,QACA,KAEA,CACA,OAAArB,IAAAltB,EAAAovB,oBAAA,KACA,CACApvB,EAAAivB,gBAAA/B,EACAltB,EAAAyuB,kBAAA,CACA,CAoCA,SAAAO,EAAAhvB,GACA,OAAAA,EAAAouB,QAAA,IAAApuB,EAAAva,QAAA,OAAAua,EAAAivB,kBAAAjvB,EAAAkqB,WAAAlqB,EAAAuuB,OACA,CACA,SAAAyB,EAAAzV,EAAAva,GACAua,EAAAmV,QAAA,SAAAxoC,GACA8Y,EAAAqtB,YACAnmC,GACA0/B,EAAArM,EAAArzB,GAEA8Y,EAAAqvB,aAAA,EACA9U,EAAAjb,KAAA,aACAuvB,EAAAtU,EAAAva,EACA,GACA,CAaA,SAAA6uB,EAAAtU,EAAAva,GACA,IAAAiwB,EAAAjB,EAAAhvB,GACA,GAAAiwB,IAdA,SAAA1V,EAAAva,GACAA,EAAAqvB,aAAArvB,EAAAmuB,cACA,mBAAA5T,EAAAmV,QAAA1vB,EAAAwlB,WAKAxlB,EAAAqvB,aAAA,EACA9U,EAAAjb,KAAA,eALAU,EAAAqtB,YACArtB,EAAAmuB,aAAA,EACAvkB,EAAA4L,SAAAwa,EAAAzV,EAAAva,IAMA,CAIA+sB,CAAAxS,EAAAva,GACA,IAAAA,EAAAqtB,YACArtB,EAAAkqB,UAAA,EACA3P,EAAAjb,KAAA,UACAU,EAAA4nB,cAAA,CAGA,IAAAsI,EAAA3V,EAAAgL,iBACA2K,GAAAA,EAAAtI,aAAAsI,EAAA9I,aACA7M,EAAAqH,SAEA,CAGA,OAAAqO,CACA,CAxfA/qC,EAAA,WAAAA,CAAAy5B,EAAAmH,GA4GA0H,EAAA1lC,UAAAw9B,UAAA,WAGA,IAFA,IAAA6K,EAAA1rC,KAAAwqC,gBACA96B,EAAA,GACAg8B,GACAh8B,EAAA3M,KAAA2oC,GACAA,EAAAA,EAAA7pC,KAEA,OAAA6N,CACA,EACA,WACA,IACAtM,OAAAqK,eAAAs7B,EAAA1lC,UAAA,SAAA,CACAsK,IAAAq7B,EAAAC,WAAA,WACA,OAAAjpC,KAAA6gC,WACA,GAAA,6EAAA,YAEA,CAAA,MAAA8K,GAAA,CACA,CARA,GAaA,mBAAA1iC,QAAAA,OAAA2iC,aAAA,mBAAAjzB,SAAAtV,UAAA4F,OAAA2iC,cACA1C,EAAAvwB,SAAAtV,UAAA4F,OAAA2iC,aACAxoC,OAAAqK,eAAAysB,EAAAjxB,OAAA2iC,YAAA,CACArnC,MAAA,SAAAsnC,GACA,QAAA3C,EAAAnoC,KAAAf,KAAA6rC,IACA7rC,OAAAk6B,IACA2R,GAAAA,EAAApL,0BAAAsI,EACA,KAGAG,EAAA,SAAA2C,GACA,OAAAA,aAAA7rC,IACA,EA+BAk6B,EAAA72B,UAAAgzB,KAAA,WACA8L,EAAAniC,KAAA,IAAAmpC,EACA,EAyBAjP,EAAA72B,UAAAuE,MAAA,SAAAouB,EAAAvuB,EAAAnG,GACA,IAzNAY,EAyNAqZ,EAAAvb,KAAAygC,eACAhxB,GAAA,EACA67B,GAAA/vB,EAAA+mB,aA3NApgC,EA2NA8zB,EA1NAxvB,EAAAkC,SAAAxG,IAAAA,aAAAo/B,GAwOA,OAbAgK,IAAA9kC,EAAAkC,SAAAstB,KACAA,EAhOA,SAAAA,GACA,OAAAxvB,EAAAe,KAAAyuB,EACA,CA8NAgO,CAAAhO,IAEA,mBAAAvuB,IACAnG,EAAAmG,EACAA,EAAA,MAEA6jC,EAAA7jC,EAAA,SAAAA,IAAAA,EAAA8T,EAAA6nB,iBACA,mBAAA9hC,IAAAA,EAAAkoC,GACAjuB,EAAAouB,OArCA,SAAA7T,EAAAx0B,GACA,IAAAgb,EAAA,IAAAgtB,EAEAnH,EAAArM,EAAAxZ,GACA6I,EAAA4L,SAAAzvB,EAAAgb,EACA,CAgCAwvB,CAAA9rC,KAAAsB,IAAAgqC,GA3BA,SAAAxV,EAAAva,EAAAya,EAAA10B,GACA,IAAAgb,EAMA,OALA,OAAA0Z,EACA1Z,EAAA,IAAA+sB,EACA,iBAAArT,GAAAza,EAAA+mB,aACAhmB,EAAA,IAAAylB,EAAA,QAAA,CAAA,SAAA,UAAA/L,KAEA1Z,IACA6lB,EAAArM,EAAAxZ,GACA6I,EAAA4L,SAAAzvB,EAAAgb,IACA,EAGA,CAcAyvB,CAAA/rC,KAAAub,EAAAya,EAAA10B,MACAia,EAAAqtB,YACAn5B,EAiDA,SAAAqmB,EAAAva,EAAA+vB,EAAAtV,EAAAvuB,EAAAnG,GACA,IAAAgqC,EAAA,CACA,IAAAU,EArBA,SAAAzwB,EAAAya,EAAAvuB,GACA8T,EAAA+mB,aAAA,IAAA/mB,EAAAsuB,eAAA,iBAAA7T,IACAA,EAAAxvB,EAAAe,KAAAyuB,EAAAvuB,IAEA,OAAAuuB,CACA,CAgBAiW,CAAA1wB,EAAAya,EAAAvuB,GACAuuB,IAAAgW,IACAV,GAAA,EACA7jC,EAAA,SACAuuB,EAAAgW,EAEA,CACA,IAAAtoC,EAAA6X,EAAA+mB,WAAA,EAAAtM,EAAAh1B,OACAua,EAAAva,QAAA0C,EACA,IAAA+L,EAAA8L,EAAAva,OAAAua,EAAAqlB,cAEAnxB,IAAA8L,EAAAorB,WAAA,GACA,GAAAprB,EAAAuuB,SAAAvuB,EAAAwuB,OAAA,CACA,IAAAmC,EAAA3wB,EAAAovB,oBACApvB,EAAAovB,oBAAA,CACA3U,MAAAA,EACAvuB,SAAAA,EACA6jC,MAAAA,EACAzoC,SAAAvB,EACAO,KAAA,MAEAqqC,EACAA,EAAArqC,KAAA0Z,EAAAovB,oBAEApvB,EAAAivB,gBAAAjvB,EAAAovB,oBAEApvB,EAAAsvB,sBAAA,CACA,MACAK,EAAApV,EAAAva,GAAA,EAAA7X,EAAAsyB,EAAAvuB,EAAAnG,GAEA,OAAAmO,CACA,CAlFA08B,CAAAnsC,KAAAub,EAAA+vB,EAAAtV,EAAAvuB,EAAAnG,IAEAmO,CACA,EACAyqB,EAAA72B,UAAA+oC,KAAA,WACApsC,KAAAygC,eAAAsJ,QACA,EACA7P,EAAA72B,UAAAgpC,OAAA,WACA,IAAA9wB,EAAAvb,KAAAygC,eACAllB,EAAAwuB,SACAxuB,EAAAwuB,SACAxuB,EAAAuuB,SAAAvuB,EAAAwuB,QAAAxuB,EAAAyuB,mBAAAzuB,EAAAivB,iBAAAC,EAAAzqC,KAAAub,GAEA,EACA2e,EAAA72B,UAAAipC,mBAAA,SAAA7kC,GAGA,GADA,iBAAAA,IAAAA,EAAAA,EAAAgC,iBACA,CAAA,MAAA,OAAA,QAAA,QAAA,SAAA,SAAA,OAAA,QAAA,UAAA,WAAA,OAAAvD,SAAAuB,EAAA,IAAAgC,gBAAA,GAAA,MAAA,IAAA8/B,EAAA9hC,GAEA,OADAzH,KAAAygC,eAAA2C,gBAAA37B,EACAzH,IACA,EACAoD,OAAAqK,eAAAysB,EAAA72B,UAAA,iBAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,OAAA3N,KAAAygC,gBAAAzgC,KAAAygC,eAAAI,WACA,IAQAz9B,OAAAqK,eAAAysB,EAAA72B,UAAA,wBAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,OAAA3N,KAAAygC,eAAAG,aACA,IAuKA1G,EAAA72B,UAAA65B,OAAA,SAAAlH,EAAAvuB,EAAAnG,GACAA,EAAA,IAAA2gC,EAAA,YACA,EACA/H,EAAA72B,UAAA0nC,QAAA,KACA7Q,EAAA72B,UAAA+C,IAAA,SAAA4vB,EAAAvuB,EAAAnG,GACA,IAAAia,EAAAvb,KAAAygC,eAmBA,MAlBA,mBAAAzK,GACA10B,EAAA00B,EACAA,EAAA,KACAvuB,EAAA,MACA,mBAAAA,IACAnG,EAAAmG,EACAA,EAAA,MAEAuuB,SAAAh2B,KAAA4H,MAAAouB,EAAAvuB,GAGA8T,EAAAwuB,SACAxuB,EAAAwuB,OAAA,EACA/pC,KAAAqsC,UAIA9wB,EAAAouB,QAyDA,SAAA7T,EAAAva,EAAAja,GACAia,EAAAouB,QAAA,EACAS,EAAAtU,EAAAva,GACAja,IACAia,EAAAkqB,SAAAtgB,EAAA4L,SAAAzvB,GAAAw0B,EAAAh0B,KAAA,SAAAR,IAEAia,EAAAmlB,OAAA,EACA5K,EAAAhoB,UAAA,CACA,CAjEAy+B,CAAAvsC,KAAAub,EAAAja,GACAtB,IACA,EACAoD,OAAAqK,eAAAysB,EAAA72B,UAAA,iBAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,OAAA3N,KAAAygC,eAAAz/B,MACA,IAqEAoC,OAAAqK,eAAAysB,EAAA72B,UAAA,YAAA,CAIAqK,YAAA,EACAC,IAAA,WACA,YAAArF,IAAAtI,KAAAygC,gBAGAzgC,KAAAygC,eAAAM,SACA,EACAhuB,IAAA,SAAAxO,GAGAvE,KAAAygC,iBAMAzgC,KAAAygC,eAAAM,UAAAx8B,EACA,IAEA21B,EAAA72B,UAAA85B,QAAAyE,EAAAzE,QACAjD,EAAA72B,UAAA8gC,WAAAvC,EAAAwC,UACAlK,EAAA72B,UAAAmgC,SAAA,SAAA/gC,EAAAnB,GACAA,EAAAmB,EACA,C1Dy8QC,GAAE1B,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAA8B,oBAAXX,OAAyBA,OAAyB,oBAATC,KAAuBA,KAAyB,oBAAXF,OAAyBA,OAAS,CAAC,EAEtK,EAAE,CAAC,YAAY,GAAG,mBAAmB,GAAG,6BAA6B,GAAG,2BAA2B,GAAG,4BAA4B,GAAGmmB,SAAW,GAAG7d,OAAS,GAAG2xB,SAAW,GAAG,iBAAiB,KAAK,GAAG,CAAC,SAASr5B,EAAQf,EAAOD,IAC/N,SAAW0lB,IAAS,W2D1kSpB,IAAAqnB,EACA,SAAAC,EAAAvqC,EAAAM,EAAA+B,GAAA,OAAA/B,EACA,SAAA2E,GAAA,IAAA3E,EACA,SAAAkxB,EAAAgZ,GAAA,GAAA,iBAAAhZ,GAAA,OAAAA,EAAA,OAAAA,EAAA,IAAAiZ,EAAAjZ,EAAAzqB,OAAAC,aAAA,QAAAZ,IAAAqkC,EAAA,CAAA,IAAApgC,EAAAogC,EAAA5rC,KAAA2yB,EAAAgZ,GAAA,WAAA,GAAA,iBAAAngC,EAAA,OAAAA,EAAA,MAAA,IAAAlF,UAAA,+CAAA,CAAA,OAAA,WAAAqlC,EAAA/hC,OAAAQ,QAAAuoB,EAAA,CADAkZ,CAAAzlC,EAAA,UAAA,MAAA,iBAAA3E,EAAAA,EAAAmI,OAAAnI,EAAA,CADAqqC,CAAArqC,MAAAN,EAAAkB,OAAAqK,eAAAvL,EAAAM,EAAA,CAAA+B,MAAAA,EAAAmJ,YAAA,EAAAG,cAAA,EAAAC,UAAA,IAAA5L,EAAAM,GAAA+B,EAAArC,CAAA,CAGA,IAAAujC,EAAAhlC,EAAA,mBACAqsC,EAAA7jC,OAAA,eACA8jC,EAAA9jC,OAAA,cACA+jC,EAAA/jC,OAAA,SACAgkC,EAAAhkC,OAAA,SACAikC,EAAAjkC,OAAA,eACAkkC,EAAAlkC,OAAA,iBACAmkC,EAAAnkC,OAAA,UACA,SAAAokC,EAAA9oC,EAAAnC,GACA,MAAA,CACAmC,MAAAA,EACAnC,KAAAA,EAEA,CACA,SAAAkrC,EAAAC,GACA,IAAAn0B,EAAAm0B,EAAAT,GACA,GAAA,OAAA1zB,EAAA,CACA,IAAArQ,EAAAwkC,EAAAH,GAAAxiC,OAIA,OAAA7B,IACAwkC,EAAAL,GAAA,KACAK,EAAAT,GAAA,KACAS,EAAAR,GAAA,KACA3zB,EAAAi0B,EAAAtkC,GAAA,IAEA,CACA,CACA,SAAAykC,EAAAD,GAGApoB,EAAA4L,SAAAuc,EAAAC,EACA,CAYA,IAAAE,EAAArqC,OAAA8Y,gBAAA,WAAA,IACAwxB,EAAAtqC,OAAAuqC,gBAmDAlB,EAnDAD,EAAA,CACA1W,aACA,OAAA91B,KAAAotC,EACA,EACAvrC,KAAA,WACA,IAAAqlC,EAAAlnC,KAGAwN,EAAAxN,KAAAgtC,GACA,GAAA,OAAAx/B,EACA,OAAA2L,QAAAE,OAAA7L,GAEA,GAAAxN,KAAAitC,GACA,OAAA9zB,QAAAC,QAAAi0B,OAAA/kC,GAAA,IAEA,GAAAtI,KAAAotC,GAAArM,UAKA,OAAA,IAAA5nB,SAAA,SAAAC,EAAAC,GACA8L,EAAA4L,UAAA,WACAmW,EAAA8F,GACA3zB,EAAA6tB,EAAA8F,IAEA5zB,EAAAi0B,OAAA/kC,GAAA,GAEA,GACA,IAOA,IACAslC,EADAC,EAAA7tC,KAAAktC,GAEA,GAAAW,EACAD,EAAA,IAAAz0B,QAlDA,SAAA00B,EAAAN,GACA,OAAA,SAAAn0B,EAAAC,GACAw0B,EAAA9R,MAAA,WACAwR,EAAAN,GACA7zB,EAAAi0B,OAAA/kC,GAAA,IAGAilC,EAAAJ,GAAA/zB,EAAAC,EACA,GAAAA,EACA,CACA,CAwCAy0B,CAAAD,EAAA7tC,WACA,CAGA,IAAA+I,EAAA/I,KAAAotC,GAAAxiC,OACA,GAAA,OAAA7B,EACA,OAAAoQ,QAAAC,QAAAi0B,EAAAtkC,GAAA,IAEA6kC,EAAA,IAAAz0B,QAAAnZ,KAAAmtC,GACA,CAEA,OADAntC,KAAAktC,GAAAU,EACAA,CACA,GACA3kC,OAAAk+B,eAAA,WACA,OAAAnnC,IACA,IAAAysC,EAAAD,EAAA,UAAA,WACA,IAAAuB,EAAA/tC,KAIA,OAAA,IAAAmZ,SAAA,SAAAC,EAAAC,GACA00B,EAAAX,GAAAjQ,QAAA,MAAA,SAAA16B,GACAA,EACA4W,EAAA5W,GAGA2W,EAAAi0B,OAAA/kC,GAAA,GACA,GACA,GACA,IAAAkkC,GAAAiB,GA4DA/tC,EAAAD,QA3DA,SAAAq2B,GACA,IAAAkY,EACA3sC,EAAA+B,OAAAuX,OAAA+yB,GAAAjB,EAAAuB,EAAA,CAAA,EAAAZ,EAAA,CACA7oC,MAAAuxB,EACAhoB,UAAA,IACA2+B,EAAAuB,EAAAlB,EAAA,CACAvoC,MAAA,KACAuJ,UAAA,IACA2+B,EAAAuB,EAAAjB,EAAA,CACAxoC,MAAA,KACAuJ,UAAA,IACA2+B,EAAAuB,EAAAhB,EAAA,CACAzoC,MAAA,KACAuJ,UAAA,IACA2+B,EAAAuB,EAAAf,EAAA,CACA1oC,MAAAuxB,EAAAgL,eAAA6B,WACA70B,UAAA,IACA2+B,EAAAuB,EAAAb,EAAA,CACA5oC,MAAA,SAAA6U,EAAAC,GACA,IAAAtQ,EAAA1H,EAAA+rC,GAAAxiC,OACA7B,GACA1H,EAAA6rC,GAAA,KACA7rC,EAAAyrC,GAAA,KACAzrC,EAAA0rC,GAAA,KACA3zB,EAAAi0B,EAAAtkC,GAAA,MAEA1H,EAAAyrC,GAAA1zB,EACA/X,EAAA0rC,GAAA1zB,EAEA,EACAvL,UAAA,IACAkgC,IA0BA,OAzBA3sC,EAAA6rC,GAAA,KACAzH,EAAA3P,GAAA,SAAArzB,GACA,GAAAA,GAAA,+BAAAA,EAAA5B,KAAA,CACA,IAAAwY,EAAAhY,EAAA0rC,GAUA,OAPA,OAAA1zB,IACAhY,EAAA6rC,GAAA,KACA7rC,EAAAyrC,GAAA,KACAzrC,EAAA0rC,GAAA,KACA1zB,EAAA5W,SAEApB,EAAA2rC,GAAAvqC,EAEA,CACA,IAAA2W,EAAA/X,EAAAyrC,GACA,OAAA1zB,IACA/X,EAAA6rC,GAAA,KACA7rC,EAAAyrC,GAAA,KACAzrC,EAAA0rC,GAAA,KACA3zB,EAAAi0B,OAAA/kC,GAAA,KAEAjH,EAAA4rC,IAAA,CACA,IACAnX,EAAAlc,GAAA,WAAA4zB,EAAAp3B,KAAA,KAAA/U,IACAA,CACA,C3D+kSC,GAAEN,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAElC,EAAE,CAAC,kBAAkB,GAAGulB,SAAW,KAAK,GAAG,CAAC,SAASvlB,EAAQf,EAAOD,G4DjwSpE,SAAAmZ,EAAAizB,EAAAoC,GAAA,IAAAtqC,EAAAP,OAAAO,KAAAkoC,GAAA,GAAAzoC,OAAAyV,sBAAA,CAAA,IAAAq1B,EAAA9qC,OAAAyV,sBAAAgzB,GAAAoC,IAAAC,EAAAA,EAAAC,QAAA,SAAAC,GAAA,OAAAhrC,OAAAirC,yBAAAxC,EAAAuC,GAAA1gC,UAAA,KAAA/J,EAAAZ,KAAApB,MAAAgC,EAAAuqC,EAAA,CAAA,OAAAvqC,CAAA,CACA,SAAA2qC,EAAAt/B,GAAA,IAAA,IAAAzO,EAAA,EAAAA,EAAAqB,UAAAZ,OAAAT,IAAA,CAAA,IAAAguC,EAAA,MAAA3sC,UAAArB,GAAAqB,UAAArB,GAAA,CAAA,EAAAA,EAAA,EAAAqY,EAAAxV,OAAAmrC,IAAA,GAAAlnB,SAAA,SAAA7kB,GAAAiqC,EAAAz9B,EAAAxM,EAAA+rC,EAAA/rC,GAAA,IAAAY,OAAAorC,0BAAAprC,OAAAqrC,iBAAAz/B,EAAA5L,OAAAorC,0BAAAD,IAAA31B,EAAAxV,OAAAmrC,IAAAlnB,SAAA,SAAA7kB,GAAAY,OAAAqK,eAAAuB,EAAAxM,EAAAY,OAAAirC,yBAAAE,EAAA/rC,GAAA,GAAA,CAAA,OAAAwM,CAAA,CACA,SAAAy9B,EAAAvqC,EAAAM,EAAA+B,GAAA,OAAA/B,EAAAqqC,EAAArqC,MAAAN,EAAAkB,OAAAqK,eAAAvL,EAAAM,EAAA,CAAA+B,MAAAA,EAAAmJ,YAAA,EAAAG,cAAA,EAAAC,UAAA,IAAA5L,EAAAM,GAAA+B,EAAArC,CAAA,CAEA,SAAAwsC,EAAA1/B,EAAA2/B,GAAA,IAAA,IAAApuC,EAAA,EAAAA,EAAAouC,EAAA3tC,OAAAT,IAAA,CAAA,IAAAquC,EAAAD,EAAApuC,GAAAquC,EAAAlhC,WAAAkhC,EAAAlhC,aAAA,EAAAkhC,EAAA/gC,cAAA,EAAA,UAAA+gC,IAAAA,EAAA9gC,UAAA,GAAA1K,OAAAqK,eAAAuB,EAAA69B,EAAA+B,EAAApsC,KAAAosC,EAAA,CAAA,CAEA,SAAA/B,EAAA1lC,GAAA,IAAA3E,EACA,SAAAkxB,EAAAgZ,GAAA,GAAA,iBAAAhZ,GAAA,OAAAA,EAAA,OAAAA,EAAA,IAAAiZ,EAAAjZ,EAAAzqB,OAAAC,aAAA,QAAAZ,IAAAqkC,EAAA,CAAA,IAAApgC,EAAAogC,EAAA5rC,KAAA2yB,EAAAgZ,GAAA,WAAA,GAAA,iBAAAngC,EAAA,OAAAA,EAAA,MAAA,IAAAlF,UAAA,+CAAA,CAAA,OAAA,WAAAqlC,EAAA/hC,OAAAQ,QAAAuoB,EAAA,CADAkZ,CAAAzlC,EAAA,UAAA,MAAA,iBAAA3E,EAAAA,EAAAmI,OAAAnI,EAAA,CAEA,IACAgE,EADA/F,EAAA,UACA+F,OAEAqI,EADApO,EAAA,QACAoO,QACAggC,EAAAhgC,GAAAA,EAAAggC,QAAA,UAIAnvC,EAAAD,QAAA,WACA,SAAAkiC,KAdA,SAAAmN,EAAAC,GAAA,KAAAD,aAAAC,GAAA,MAAA,IAAA1nC,UAAA,oCAAA,CAeA2nC,CAAAhvC,KAAA2hC,GACA3hC,KAAAwkC,KAAA,KACAxkC,KAAAivC,KAAA,KACAjvC,KAAAgB,OAAA,CACA,CAjBA,IAAA+tC,EAAAG,EAAAC,EA8KA,OA9KAJ,EAkBApN,GAlBAuN,EAkBA,CAAA,CACA1sC,IAAA,OACA+B,MAAA,SAAA6wB,GACA,IAAAqT,EAAA,CACA1/B,KAAAqsB,EACAvzB,KAAA,MAEA7B,KAAAgB,OAAA,EAAAhB,KAAAivC,KAAAptC,KAAA4mC,EAAAzoC,KAAAwkC,KAAAiE,EACAzoC,KAAAivC,KAAAxG,IACAzoC,KAAAgB,MACA,GACA,CACAwB,IAAA,UACA+B,MAAA,SAAA6wB,GACA,IAAAqT,EAAA,CACA1/B,KAAAqsB,EACAvzB,KAAA7B,KAAAwkC,MAEA,IAAAxkC,KAAAgB,SAAAhB,KAAAivC,KAAAxG,GACAzoC,KAAAwkC,KAAAiE,IACAzoC,KAAAgB,MACA,GACA,CACAwB,IAAA,QACA+B,MAAA,WACA,GAAA,IAAAvE,KAAAgB,OAAA,CACA,IAAAyO,EAAAzP,KAAAwkC,KAAAz7B,KAGA,OAFA,IAAA/I,KAAAgB,OAAAhB,KAAAwkC,KAAAxkC,KAAAivC,KAAA,KAAAjvC,KAAAwkC,KAAAxkC,KAAAwkC,KAAA3iC,OACA7B,KAAAgB,OACAyO,CAJA,CAKA,GACA,CACAjN,IAAA,QACA+B,MAAA,WACAvE,KAAAwkC,KAAAxkC,KAAAivC,KAAA,KACAjvC,KAAAgB,OAAA,CACA,GACA,CACAwB,IAAA,OACA+B,MAAA,SAAA8lB,GACA,GAAA,IAAArqB,KAAAgB,OAAA,MAAA,GAGA,IAFA,IAAAF,EAAAd,KAAAwkC,KACA/0B,EAAA,GAAA3O,EAAAiI,KACAjI,EAAAA,EAAAe,MAAA4N,GAAA4a,EAAAvpB,EAAAiI,KACA,OAAA0G,CACA,GACA,CACAjN,IAAA,SACA+B,MAAA,SAAAnE,GACA,GAAA,IAAAJ,KAAAgB,OAAA,OAAAwF,EAAAI,MAAA,GAIA,IAHA,IA5DAyM,EAAArE,EAAA9D,EA4DAuE,EAAAjJ,EAAAc,YAAAlH,IAAA,GACAU,EAAAd,KAAAwkC,KACAjkC,EAAA,EACAO,GA/DAuS,EAgEAvS,EAAAiI,KAhEAiG,EAgEAS,EAhEAvE,EAgEA3K,EA/DAiG,EAAAnD,UAAAuF,KAAA7H,KAAAsS,EAAArE,EAAA9D,GAgEA3K,GAAAO,EAAAiI,KAAA/H,OACAF,EAAAA,EAAAe,KAEA,OAAA4N,CACA,GAGA,CACAjN,IAAA,UACA+B,MAAA,SAAAnE,EAAAgvC,GACA,IAAA3/B,EAYA,OAXArP,EAAAJ,KAAAwkC,KAAAz7B,KAAA/H,QAEAyO,EAAAzP,KAAAwkC,KAAAz7B,KAAAlB,MAAA,EAAAzH,GACAJ,KAAAwkC,KAAAz7B,KAAA/I,KAAAwkC,KAAAz7B,KAAAlB,MAAAzH,IAGAqP,EAFArP,IAAAJ,KAAAwkC,KAAAz7B,KAAA/H,OAEAhB,KAAA+c,QAGAqyB,EAAApvC,KAAAqvC,WAAAjvC,GAAAJ,KAAAsvC,WAAAlvC,GAEAqP,CACA,GACA,CACAjN,IAAA,QACA+B,MAAA,WACA,OAAAvE,KAAAwkC,KAAAz7B,IACA,GAGA,CACAvG,IAAA,aACA+B,MAAA,SAAAnE,GACA,IAAAU,EAAAd,KAAAwkC,KACAhkC,EAAA,EACAiP,EAAA3O,EAAAiI,KAEA,IADA3I,GAAAqP,EAAAzO,OACAF,EAAAA,EAAAe,MAAA,CACA,IAAA+J,EAAA9K,EAAAiI,KACAwmC,EAAAnvC,EAAAwL,EAAA5K,OAAA4K,EAAA5K,OAAAZ,EAGA,GAFAmvC,IAAA3jC,EAAA5K,OAAAyO,GAAA7D,EAAA6D,GAAA7D,EAAA/D,MAAA,EAAAzH,GAEA,IADAA,GAAAmvC,GACA,CACAA,IAAA3jC,EAAA5K,UACAR,EACAM,EAAAe,KAAA7B,KAAAwkC,KAAA1jC,EAAAe,KAAA7B,KAAAwkC,KAAAxkC,KAAAivC,KAAA,OAEAjvC,KAAAwkC,KAAA1jC,EACAA,EAAAiI,KAAA6C,EAAA/D,MAAA0nC,IAEA,KACA,GACA/uC,CACA,CAEA,OADAR,KAAAgB,QAAAR,EACAiP,CACA,GAGA,CACAjN,IAAA,aACA+B,MAAA,SAAAnE,GACA,IAAAqP,EAAAjJ,EAAAc,YAAAlH,GACAU,EAAAd,KAAAwkC,KACAhkC,EAAA,EAGA,IAFAM,EAAAiI,KAAAH,KAAA6G,GACArP,GAAAU,EAAAiI,KAAA/H,OACAF,EAAAA,EAAAe,MAAA,CACA,IAAAoF,EAAAnG,EAAAiI,KACAwmC,EAAAnvC,EAAA6G,EAAAjG,OAAAiG,EAAAjG,OAAAZ,EAGA,GAFA6G,EAAA2B,KAAA6G,EAAAA,EAAAzO,OAAAZ,EAAA,EAAAmvC,GAEA,IADAnvC,GAAAmvC,GACA,CACAA,IAAAtoC,EAAAjG,UACAR,EACAM,EAAAe,KAAA7B,KAAAwkC,KAAA1jC,EAAAe,KAAA7B,KAAAwkC,KAAAxkC,KAAAivC,KAAA,OAEAjvC,KAAAwkC,KAAA1jC,EACAA,EAAAiI,KAAA9B,EAAAY,MAAA0nC,IAEA,KACA,GACA/uC,CACA,CAEA,OADAR,KAAAgB,QAAAR,EACAiP,CACA,GAGA,CACAjN,IAAAqsC,EACAtqC,MAAA,SAAAonC,EAAA5W,GACA,OAAAlmB,EAAA7O,KAAAsuC,EAAAA,EAAA,CAAA,EAAAvZ,GAAA,CAAA,EAAA,CAEAya,MAAA,EAEAC,eAAA,IAEA,MA5KAf,EAAAK,EAAA1rC,UAAA6rC,GAAAC,GAAAT,EAAAK,EAAAI,GAAA/rC,OAAAqK,eAAAshC,EAAA,YAAA,CAAAjhC,UAAA,IA8KA6zB,CACA,CApKA,E5Dy6SA,EAAE,CAACx5B,OAAS,GAAGm/B,KAAO,KAAK,GAAG,CAAC,SAAS7mC,EAAQf,EAAOD,IACvD,SAAW0lB,IAAS,W6Dz4SpB,SAAAuqB,EAAA3vC,EAAA0C,GACAktC,EAAA5vC,EAAA0C,GACAmtC,EAAA7vC,EACA,CACA,SAAA6vC,EAAA7vC,GACAA,EAAA0gC,iBAAA1gC,EAAA0gC,eAAAyC,WACAnjC,EAAA+gC,iBAAA/gC,EAAA+gC,eAAAoC,WACAnjC,EAAA8a,KAAA,QACA,CAkBA,SAAA80B,EAAA5vC,EAAA0C,GACA1C,EAAA8a,KAAA,QAAApY,EACA,CAYA/C,EAAAD,QAAA,CACA09B,QAzFA,SAAA16B,EAAAnB,GACA,IAAA4lC,EAAAlnC,KACA6vC,EAAA7vC,KAAA8gC,gBAAA9gC,KAAA8gC,eAAAC,UACA+O,EAAA9vC,KAAAygC,gBAAAzgC,KAAAygC,eAAAM,UACA,OAAA8O,GAAAC,GACAxuC,EACAA,EAAAmB,GACAA,IACAzC,KAAAygC,eAEAzgC,KAAAygC,eAAA4J,eACArqC,KAAAygC,eAAA4J,cAAA,EACAllB,EAAA4L,SAAA4e,EAAA3vC,KAAAyC,IAHA0iB,EAAA4L,SAAA4e,EAAA3vC,KAAAyC,IAMAzC,OAMAA,KAAA8gC,iBACA9gC,KAAA8gC,eAAAC,WAAA,GAIA/gC,KAAAygC,iBACAzgC,KAAAygC,eAAAM,WAAA,GAEA/gC,KAAAwjC,SAAA/gC,GAAA,MAAA,SAAAA,IACAnB,GAAAmB,EACAykC,EAAAzG,eAEAyG,EAAAzG,eAAA4J,aAIAllB,EAAA4L,SAAA6e,EAAA1I,IAHAA,EAAAzG,eAAA4J,cAAA,EACAllB,EAAA4L,SAAA2e,EAAAxI,EAAAzkC,IAHA0iB,EAAA4L,SAAA2e,EAAAxI,EAAAzkC,GAOAnB,GACA6jB,EAAA4L,SAAA6e,EAAA1I,GACA5lC,EAAAmB,IAEA0iB,EAAA4L,SAAA6e,EAAA1I,EAEA,IACAlnC,KACA,EA2CAokC,UAjCA,WACApkC,KAAA8gC,iBACA9gC,KAAA8gC,eAAAC,WAAA,EACA/gC,KAAA8gC,eAAA8B,SAAA,EACA5iC,KAAA8gC,eAAAJ,OAAA,EACA1gC,KAAA8gC,eAAA6B,YAAA,GAEA3iC,KAAAygC,iBACAzgC,KAAAygC,eAAAM,WAAA,EACA/gC,KAAAygC,eAAAC,OAAA,EACA1gC,KAAAygC,eAAAkJ,QAAA,EACA3pC,KAAAygC,eAAAiJ,aAAA,EACA1pC,KAAAygC,eAAAmK,aAAA,EACA5qC,KAAAygC,eAAAgF,UAAA,EACAzlC,KAAAygC,eAAA4J,cAAA,EAEA,EAkBAlI,eAdA,SAAArM,EAAArzB,GAOA,IAAAgpC,EAAA3V,EAAAgL,eACA0E,EAAA1P,EAAA2K,eACAgL,GAAAA,EAAAtI,aAAAqC,GAAAA,EAAArC,YAAArN,EAAAqH,QAAA16B,GAAAqzB,EAAAjb,KAAA,QAAApY,EACA,E7Dm8SC,GAAE1B,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,YAElC,EAAE,CAACulB,SAAW,KAAK,GAAG,CAAC,SAASvlB,EAAQf,EAAOD,G8D1hT/C,IAAAswC,EAAAtvC,EAAA,mBAAA2+B,MAAA2Q,2BAYA,SAAAhuC,IAAA,CAoEArC,EAAAD,QAhEA,SAAAuwC,EAAAla,EAAAQ,EAAAzzB,GACA,GAAA,mBAAAyzB,EAAA,OAAA0Z,EAAAla,EAAA,KAAAQ,GACAA,IAAAA,EAAA,CAAA,GACAzzB,EAlBA,SAAAA,GACA,IAAAkoB,GAAA,EACA,OAAA,WACA,IAAAA,EAAA,CACAA,GAAA,EACA,IAAA,IAAAklB,EAAAruC,UAAAZ,OAAA4B,EAAA,IAAAM,MAAA+sC,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IACAttC,EAAAstC,GAAAtuC,UAAAsuC,GAEArtC,EAAAlB,MAAA3B,KAAA4C,EALA,CAMA,CACA,CAQAd,CAAAe,GAAAd,GACA,IAAAw+B,EAAAjK,EAAAiK,WAAA,IAAAjK,EAAAiK,UAAAzK,EAAAyK,SACAzyB,EAAAwoB,EAAAxoB,WAAA,IAAAwoB,EAAAxoB,UAAAgoB,EAAAhoB,SACAqiC,EAAA,WACAra,EAAAhoB,UAAAy4B,GACA,EACA6J,EAAAta,EAAA2K,gBAAA3K,EAAA2K,eAAAgF,SACAc,EAAA,WACAz4B,GAAA,EACAsiC,GAAA,EACA7P,GAAA19B,EAAA9B,KAAA+0B,EACA,EACAua,EAAAva,EAAAgL,gBAAAhL,EAAAgL,eAAA6B,WACAnC,EAAA,WACAD,GAAA,EACA8P,GAAA,EACAviC,GAAAjL,EAAA9B,KAAA+0B,EACA,EACAgH,EAAA,SAAAr6B,GACAI,EAAA9B,KAAA+0B,EAAArzB,EACA,EACA6jC,EAAA,WACA,IAAA7jC,EACA,OAAA89B,IAAA8P,GACAva,EAAAgL,gBAAAhL,EAAAgL,eAAAJ,QAAAj+B,EAAA,IAAAstC,GACAltC,EAAA9B,KAAA+0B,EAAArzB,IAEAqL,IAAAsiC,GACAta,EAAA2K,gBAAA3K,EAAA2K,eAAAC,QAAAj+B,EAAA,IAAAstC,GACAltC,EAAA9B,KAAA+0B,EAAArzB,SAFA,CAIA,EACA6tC,EAAA,WACAxa,EAAAqB,IAAAvd,GAAA,SAAA2sB,EACA,EAcA,OAtDA,SAAAzQ,GACA,OAAAA,EAAAwE,WAAA,mBAAAxE,EAAA+B,KACA,CAuCA0Y,CAAAza,GAIAhoB,IAAAgoB,EAAA2K,iBAEA3K,EAAAlc,GAAA,MAAAu2B,GACAra,EAAAlc,GAAA,QAAAu2B,KANAra,EAAAlc,GAAA,WAAA2sB,GACAzQ,EAAAlc,GAAA,QAAA0sB,GACAxQ,EAAAqB,IAAAmZ,IAAAxa,EAAAlc,GAAA,UAAA02B,IAMAxa,EAAAlc,GAAA,MAAA4mB,GACA1K,EAAAlc,GAAA,SAAA2sB,IACA,IAAAjQ,EAAA9oB,OAAAsoB,EAAAlc,GAAA,QAAAkjB,GACAhH,EAAAlc,GAAA,QAAA0sB,GACA,WACAxQ,EAAAvc,eAAA,WAAAgtB,GACAzQ,EAAAvc,eAAA,QAAA+sB,GACAxQ,EAAAvc,eAAA,UAAA+2B,GACAxa,EAAAqB,KAAArB,EAAAqB,IAAA5d,eAAA,SAAAgtB,GACAzQ,EAAAvc,eAAA,MAAA42B,GACAra,EAAAvc,eAAA,QAAA42B,GACAra,EAAAvc,eAAA,SAAAgtB,GACAzQ,EAAAvc,eAAA,MAAAinB,GACA1K,EAAAvc,eAAA,QAAAujB,GACAhH,EAAAvc,eAAA,QAAA+sB,EACA,CACA,C9DkiTA,EAAE,CAAC,kBAAkB,KAAK,GAAG,CAAC,SAAS7lC,EAAQf,EAAOD,G+DtnTtDC,EAAAD,QAAA,WACA,MAAA,IAAAmB,MAAA,gDACA,C/DynTA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASH,EAAQf,EAAOD,GgEtnTlC,IAAAuwC,EASA,IAAAlO,EAAArhC,EAAA,mBAAA2+B,MACAoR,EAAA1O,EAAA0O,iBACApH,EAAAtH,EAAAsH,qBACA,SAAArnC,EAAAU,GAEA,GAAAA,EAAA,MAAAA,CACA,CA+BA,SAAA1B,EAAAW,GACAA,GACA,CACA,SAAA20B,EAAA9uB,EAAA4kB,GACA,OAAA5kB,EAAA8uB,KAAAlK,EACA,CA6BAzsB,EAAAD,QAvBA,WACA,IAAA,IAAAwwC,EAAAruC,UAAAZ,OAAAyvC,EAAA,IAAAvtC,MAAA+sC,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IACAO,EAAAP,GAAAtuC,UAAAsuC,GAEA,IAKA1iC,EALA3K,EATA,SAAA4tC,GACA,OAAAA,EAAAzvC,OACA,mBAAAyvC,EAAAA,EAAAzvC,OAAA,GAAAe,EACA0uC,EAAA3tC,MAFAf,CAGA,CAKA2uC,CAAAD,GAEA,GADAvtC,MAAAC,QAAAstC,EAAA,MAAAA,EAAAA,EAAA,IACAA,EAAAzvC,OAAA,EACA,MAAA,IAAAwvC,EAAA,WAGA,IAAAG,EAAAF,EAAA9d,KAAA,SAAAmD,EAAAv1B,GACA,IAAAqiC,EAAAriC,EAAAkwC,EAAAzvC,OAAA,EAEA,OAnDA,SAAA80B,EAAA8M,EAAAkH,EAAAjnC,GACAA,EAnBA,SAAAA,GACA,IAAAkoB,GAAA,EACA,OAAA,WACAA,IACAA,GAAA,EACAloB,EAAAlB,WAAA,EAAAC,WACA,CACA,CAYAE,CAAAe,GACA,IAAA+tC,GAAA,EACA9a,EAAAlc,GAAA,SAAA,WACAg3B,GAAA,CACA,SACAtoC,IAAA0nC,IAAAA,EAAAvvC,EAAA,oBACAuvC,EAAAla,EAAA,CACAyK,SAAAqC,EACA90B,SAAAg8B,IACA,SAAArnC,GACA,GAAAA,EAAA,OAAAI,EAAAJ,GACAmuC,GAAA,EACA/tC,GACA,IACA,IAAAk+B,GAAA,EACA,OAAA,SAAAt+B,GACA,IAAAmuC,IACA7P,EAIA,OAHAA,GAAA,EAtBA,SAAAjL,GACA,OAAAA,EAAAwE,WAAA,mBAAAxE,EAAA+B,KACA,CAuBA0Y,CAAAza,GAAAA,EAAA+B,QACA,mBAAA/B,EAAAqH,QAAArH,EAAAqH,eACAt6B,EAAAJ,GAAA,IAAA2mC,EAAA,QACA,CACA,CAyBAyH,CAAA/a,EAAA8M,EADAriC,EAAA,GACA,SAAAkC,GACA+K,IAAAA,EAAA/K,GACAA,GAAAkuC,EAAAtpB,QAAAtmB,GACA6hC,IACA+N,EAAAtpB,QAAAtmB,GACA8B,EAAA2K,GACA,GACA,IACA,OAAAijC,EAAAK,OAAAza,EACA,ChE8nTA,EAAE,CAAC,kBAAkB,GAAG,kBAAkB,KAAK,GAAG,CAAC,SAAS51B,EAAQf,EAAOD,GiEhtT3E,IAAAsxC,EAAAtwC,EAAA,mBAAA2+B,MAAA2R,sBAiBArxC,EAAAD,QAAA,CACAoiC,iBAdA,SAAAtmB,EAAAwZ,EAAAic,EAAA3O,GACA,IAAA4O,EAJA,SAAAlc,EAAAsN,EAAA2O,GACA,OAAA,MAAAjc,EAAA6L,cAAA7L,EAAA6L,cAAAyB,EAAAtN,EAAAic,GAAA,IACA,CAEAE,CAAAnc,EAAAsN,EAAA2O,GACA,GAAA,MAAAC,EAAA,CACA,IAAA3hC,SAAA2hC,IAAAjtC,KAAAia,MAAAgzB,KAAAA,GAAAA,EAAA,EAEA,MAAA,IAAAF,EADA1O,EAAA2O,EAAA,gBACAC,GAEA,OAAAjtC,KAAAia,MAAAgzB,EACA,CAGA,OAAA11B,EAAA+mB,WAAA,GAAA,KACA,EjEutTA,EAAE,CAAC,kBAAkB,KAAK,GAAG,CAAC,SAAS7hC,EAAQf,EAAOD,GkEzuTtDC,EAAAD,QAAAgB,EAAA,UAAAuY,YlE4uTA,EAAE,CAACwB,OAAS,KAAK,GAAG,CAAC,SAAS/Z,EAAQf,EAAOD,ImE5uT7CA,EAAAC,EAAAD,QAAAgB,EAAA,8BACA4gC,OAAA5hC,EACAA,EAAAk+B,SAAAl+B,EACAA,EAAAy6B,SAAAz5B,EAAA,6BACAhB,EAAA4gC,OAAA5/B,EAAA,2BACAhB,EAAAwhC,UAAAxgC,EAAA,8BACAhB,EAAAuhC,YAAAvgC,EAAA,gCACAhB,EAAAgmC,SAAAhlC,EAAA,2CACAhB,EAAA0xC,SAAA1wC,EAAA,qCnE+uTA,EAAE,CAAC,0BAA0B,GAAG,+BAA+B,GAAG,4BAA4B,GAAG,6BAA6B,GAAG,4BAA4B,GAAG,0CAA0C,GAAG,qCAAqC,KAAK,GAAG,CAAC,SAASA,EAAQf,EAAOD,GoE9tTnR,IAAA+G,EAAA/F,EAAA,eAAA+F,OAGAkB,EAAAlB,EAAAkB,YAAA,SAAAD,GAEA,QADAA,EAAA,GAAAA,IACAA,EAAAgC,eACA,IAAA,MAAA,IAAA,OAAA,IAAA,QAAA,IAAA,QAAA,IAAA,SAAA,IAAA,SAAA,IAAA,OAAA,IAAA,QAAA,IAAA,UAAA,IAAA,WAAA,IAAA,MACA,OAAA,EACA,QACA,OAAA,EAEA,EA0CA,SAAAg4B,EAAAh6B,GAEA,IAAA8nC,EACA,OAFAvvC,KAAAyH,SAXA,SAAA88B,GACA,IAAA6M,EA/BA,SAAA7M,GACA,IAAAA,EAAA,MAAA,OAEA,IADA,IAAA8M,IAEA,OAAA9M,GACA,IAAA,OACA,IAAA,QACA,MAAA,OACA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,MAAA,UACA,IAAA,SACA,IAAA,SACA,MAAA,SACA,IAAA,SACA,IAAA,QACA,IAAA,MACA,OAAAA,EACA,QACA,GAAA8M,EAAA,OACA9M,GAAA,GAAAA,GAAA96B,cACA4nC,GAAA,EAGA,CAKAC,CAAA/M,GACA,GAAA,iBAAA6M,IAAA5qC,EAAAkB,aAAAA,IAAAA,EAAA68B,IAAA,MAAA,IAAA3jC,MAAA,qBAAA2jC,GACA,OAAA6M,GAAA7M,CACA,CAOAgN,CAAA9pC,GAEAzH,KAAAyH,UACA,IAAA,UACAzH,KAAAwxC,KAAAC,EACAzxC,KAAAoG,IAAAsrC,EACAnC,EAAA,EACA,MACA,IAAA,OACAvvC,KAAA2xC,SAAAC,EACArC,EAAA,EACA,MACA,IAAA,SACAvvC,KAAAwxC,KAAAK,EACA7xC,KAAAoG,IAAA0rC,EACAvC,EAAA,EACA,MACA,QAGA,OAFAvvC,KAAA4H,MAAAmqC,OACA/xC,KAAAoG,IAAA4rC,GAGAhyC,KAAAiyC,SAAA,EACAjyC,KAAAkyC,UAAA,EACAlyC,KAAAmyC,SAAA3rC,EAAAc,YAAAioC,EACA,CAmCA,SAAA6C,EAAAC,GACA,OAAAA,GAAA,IAAA,EAAAA,GAAA,GAAA,EAAA,EAAAA,GAAA,GAAA,GAAA,EAAAA,GAAA,GAAA,GAAA,EACAA,GAAA,GAAA,GAAA,GAAA,CACA,CA0DA,SAAAT,EAAA3qC,GACA,IAAAnG,EAAAd,KAAAkyC,UAAAlyC,KAAAiyC,SACA/xC,EAtBA,SAAAH,EAAAkH,EAAAnG,GACA,GAAA,MAAA,IAAAmG,EAAA,IAEA,OADAlH,EAAAkyC,SAAA,EACA,IAEA,GAAAlyC,EAAAkyC,SAAA,GAAAhrC,EAAAjG,OAAA,EAAA,CACA,GAAA,MAAA,IAAAiG,EAAA,IAEA,OADAlH,EAAAkyC,SAAA,EACA,IAEA,GAAAlyC,EAAAkyC,SAAA,GAAAhrC,EAAAjG,OAAA,GACA,MAAA,IAAAiG,EAAA,IAEA,OADAlH,EAAAkyC,SAAA,EACA,GAGA,CACA,CAKAK,CAAAtyC,KAAAiH,GACA,YAAAqB,IAAApI,EAAAA,EACAF,KAAAiyC,UAAAhrC,EAAAjG,QACAiG,EAAA2B,KAAA5I,KAAAmyC,SAAArxC,EAAA,EAAAd,KAAAiyC,UACAjyC,KAAAmyC,SAAA7uC,SAAAtD,KAAAyH,SAAA,EAAAzH,KAAAkyC,aAEAjrC,EAAA2B,KAAA5I,KAAAmyC,SAAArxC,EAAA,EAAAmG,EAAAjG,aACAhB,KAAAiyC,UAAAhrC,EAAAjG,QACA,CA0BA,SAAAywC,EAAAxqC,EAAA1G,GACA,IAAA0G,EAAAjG,OAAAT,GAAA,GAAA,EAAA,CACA,IAAAL,EAAA+G,EAAA3D,SAAA,UAAA/C,GACA,GAAAL,EAAA,CACA,IAAAM,EAAAN,EAAAqF,WAAArF,EAAAc,OAAA,GACA,GAAAR,GAAA,OAAAA,GAAA,MAKA,OAJAR,KAAAiyC,SAAA,EACAjyC,KAAAkyC,UAAA,EACAlyC,KAAAmyC,SAAA,GAAAlrC,EAAAA,EAAAjG,OAAA,GACAhB,KAAAmyC,SAAA,GAAAlrC,EAAAA,EAAAjG,OAAA,GACAd,EAAA2H,MAAA,GAAA,EAEA,CACA,OAAA3H,CACA,CAIA,OAHAF,KAAAiyC,SAAA,EACAjyC,KAAAkyC,UAAA,EACAlyC,KAAAmyC,SAAA,GAAAlrC,EAAAA,EAAAjG,OAAA,GACAiG,EAAA3D,SAAA,UAAA/C,EAAA0G,EAAAjG,OAAA,EACA,CAIA,SAAA0wC,EAAAzqC,GACA,IAAA/G,EAAA+G,GAAAA,EAAAjG,OAAAhB,KAAA4H,MAAAX,GAAA,GACA,GAAAjH,KAAAiyC,SAAA,CACA,IAAA7rC,EAAApG,KAAAkyC,UAAAlyC,KAAAiyC,SACA,OAAA/xC,EAAAF,KAAAmyC,SAAA7uC,SAAA,UAAA,EAAA8C,EACA,CACA,OAAAlG,CACA,CAEA,SAAA2xC,EAAA5qC,EAAA1G,GACA,IAAAH,GAAA6G,EAAAjG,OAAAT,GAAA,EACA,OAAA,IAAAH,EAAA6G,EAAA3D,SAAA,SAAA/C,IACAP,KAAAiyC,SAAA,EAAA7xC,EACAJ,KAAAkyC,UAAA,EACA,IAAA9xC,EACAJ,KAAAmyC,SAAA,GAAAlrC,EAAAA,EAAAjG,OAAA,IAEAhB,KAAAmyC,SAAA,GAAAlrC,EAAAA,EAAAjG,OAAA,GACAhB,KAAAmyC,SAAA,GAAAlrC,EAAAA,EAAAjG,OAAA,IAEAiG,EAAA3D,SAAA,SAAA/C,EAAA0G,EAAAjG,OAAAZ,GACA,CAEA,SAAA0xC,EAAA7qC,GACA,IAAA/G,EAAA+G,GAAAA,EAAAjG,OAAAhB,KAAA4H,MAAAX,GAAA,GACA,OAAAjH,KAAAiyC,SAAA/xC,EAAAF,KAAAmyC,SAAA7uC,SAAA,SAAA,EAAA,EAAAtD,KAAAiyC,UACA/xC,CACA,CAGA,SAAA6xC,EAAA9qC,GACA,OAAAA,EAAA3D,SAAAtD,KAAAyH,SACA,CAEA,SAAAuqC,EAAA/qC,GACA,OAAAA,GAAAA,EAAAjG,OAAAhB,KAAA4H,MAAAX,GAAA,EACA,CA1NAxH,EAAAgiC,cAAAA,EA6BAA,EAAAp+B,UAAAuE,MAAA,SAAAX,GACA,GAAA,IAAAA,EAAAjG,OAAA,MAAA,GACA,IAAAd,EACAK,EACA,GAAAP,KAAAiyC,SAAA,CAEA,QAAA3pC,KADApI,EAAAF,KAAA2xC,SAAA1qC,IACA,MAAA,GACA1G,EAAAP,KAAAiyC,SACAjyC,KAAAiyC,SAAA,CACA,MACA1xC,EAAA,EAEA,OAAAA,EAAA0G,EAAAjG,OAAAd,EAAAA,EAAAF,KAAAwxC,KAAAvqC,EAAA1G,GAAAP,KAAAwxC,KAAAvqC,EAAA1G,GACAL,GAAA,EACA,EAEAuhC,EAAAp+B,UAAA+C,IAwGA,SAAAa,GACA,IAAA/G,EAAA+G,GAAAA,EAAAjG,OAAAhB,KAAA4H,MAAAX,GAAA,GACA,OAAAjH,KAAAiyC,SAAA/xC,EAAA,IACAA,CACA,EAzGAuhC,EAAAp+B,UAAAmuC,KA0FA,SAAAvqC,EAAA1G,GACA,IAAAgyC,EArEA,SAAAxyC,EAAAkH,EAAA1G,GACA,IAAAyK,EAAA/D,EAAAjG,OAAA,EACA,GAAAgK,EAAAzK,EAAA,OAAA,EACA,IAAAgvC,EAAA6C,EAAAnrC,EAAA+D,IACA,GAAAukC,GAAA,EAEA,OADAA,EAAA,IAAAxvC,EAAAkyC,SAAA1C,EAAA,GACAA,EAEA,KAAAvkC,EAAAzK,IAAA,IAAAgvC,EAAA,OAAA,EAEA,GADAA,EAAA6C,EAAAnrC,EAAA+D,IACAukC,GAAA,EAEA,OADAA,EAAA,IAAAxvC,EAAAkyC,SAAA1C,EAAA,GACAA,EAEA,KAAAvkC,EAAAzK,IAAA,IAAAgvC,EAAA,OAAA,EAEA,GADAA,EAAA6C,EAAAnrC,EAAA+D,IACAukC,GAAA,EAIA,OAHAA,EAAA,IACA,IAAAA,EAAAA,EAAA,EAAAxvC,EAAAkyC,SAAA1C,EAAA,GAEAA,EAEA,OAAA,CACA,CA8CAiD,CAAAxyC,KAAAiH,EAAA1G,GACA,IAAAP,KAAAiyC,SAAA,OAAAhrC,EAAA3D,SAAA,OAAA/C,GACAP,KAAAkyC,UAAAK,EACA,IAAAnsC,EAAAa,EAAAjG,QAAAuxC,EAAAvyC,KAAAiyC,UAEA,OADAhrC,EAAA2B,KAAA5I,KAAAmyC,SAAA,EAAA/rC,GACAa,EAAA3D,SAAA,OAAA/C,EAAA6F,EACA,EA9FAq7B,EAAAp+B,UAAAsuC,SAAA,SAAA1qC,GACA,GAAAjH,KAAAiyC,UAAAhrC,EAAAjG,OAEA,OADAiG,EAAA2B,KAAA5I,KAAAmyC,SAAAnyC,KAAAkyC,UAAAlyC,KAAAiyC,SAAA,EAAAjyC,KAAAiyC,UACAjyC,KAAAmyC,SAAA7uC,SAAAtD,KAAAyH,SAAA,EAAAzH,KAAAkyC,WAEAjrC,EAAA2B,KAAA5I,KAAAmyC,SAAAnyC,KAAAkyC,UAAAlyC,KAAAiyC,SAAA,EAAAhrC,EAAAjG,QACAhB,KAAAiyC,UAAAhrC,EAAAjG,MACA,CpEy5TA,EAAE,CAAC,cAAc,KAAK,GAAG,CAAC,SAASP,EAAQf,EAAOD,IAClD,SAAWiD,EAAa+vC,IAAgB,WqEjiUxC,IAAA1hB,EAAAtwB,EAAA,sBAAAswB,SACApvB,EAAAgX,SAAAtV,UAAA1B,MACAkG,EAAA3E,MAAAG,UAAAwE,MACA6qC,EAAA,CAAA,EACAC,EAAA,EAaA,SAAAC,EAAAC,EAAAC,GACA9yC,KAAA+yC,IAAAF,EACA7yC,KAAAgzC,SAAAF,CACA,CAZArzC,EAAA4E,WAAA,WACA,OAAA,IAAAuuC,EAAAjxC,EAAAZ,KAAAsD,WAAAxE,OAAA+B,WAAAuuB,aACA,EACA1wB,EAAAwzC,YAAA,WACA,OAAA,IAAAL,EAAAjxC,EAAAZ,KAAAkyC,YAAApzC,OAAA+B,WAAAsxC,cACA,EACAzzC,EAAA0wB,aACA1wB,EAAAyzC,cAAA,SAAAxiB,GAAAA,EAAAwN,OAAA,EAMA0U,EAAAvvC,UAAA8vC,MAAAP,EAAAvvC,UAAA+vC,IAAA,WAAA,EACAR,EAAAvvC,UAAA66B,MAAA,WACAl+B,KAAAgzC,SAAAjyC,KAAAlB,OAAAG,KAAA+yC,IACA,EAGAtzC,EAAA4zC,OAAA,SAAAC,EAAAC,GACApjB,aAAAmjB,EAAAE,gBACAF,EAAAG,aAAAF,CACA,EAEA9zC,EAAAi0C,SAAA,SAAAJ,GACAnjB,aAAAmjB,EAAAE,gBACAF,EAAAG,cAAA,CACA,EAEAh0C,EAAAk0C,aAAAl0C,EAAAm0C,OAAA,SAAAN,GACAnjB,aAAAmjB,EAAAE,gBAEA,IAAAD,EAAAD,EAAAG,aACAF,GAAA,IACAD,EAAAE,eAAAnvC,YAAA,WACAivC,EAAAO,YACAP,EAAAO,YACA,GAAAN,GAEA,EAGA9zC,EAAAiD,aAAA,mBAAAA,EAAAA,EAAA,SAAAhB,GACA,IAAAmxC,EAAAF,IACA/vC,IAAAhB,UAAAZ,OAAA,IAAA6G,EAAA9G,KAAAa,UAAA,GAkBA,OAhBA8wC,EAAAG,IAAA,EAEA9hB,GAAA,WACA2hB,EAAAG,KAGAjwC,EACAlB,EAAAC,MAAA,KAAAiB,GAEAlB,EAAAX,KAAA,MAGAtB,EAAAgzC,eAAAI,GAEA,IAEAA,CACA,EAEApzC,EAAAgzC,eAAA,mBAAAA,EAAAA,EAAA,SAAAI,UACAH,EAAAG,EACA,CrEmiUC,GAAE9xC,KAAKf,KAAM,GAAEe,KAAKf,KAAKS,EAAQ,UAAUiC,aAAajC,EAAQ,UAAUgyC,eAE3E,EAAE,CAAC,qBAAqB,GAAGnuC,OAAS,KAAK,GAAG,CAAC,SAAS7D,EAAQf,EAAOD,GsEzlUrE,IAAAmyB,EAAAnxB,EAAA,YACA6mC,EAAA7mC,EAAA,UASA,SAAAqzC,IACA9zC,KAAA2pB,SAAA,KACA3pB,KAAA+zC,QAAA,KACA/zC,KAAA02B,KAAA,KACA12B,KAAAu3B,KAAA,KACAv3B,KAAAy2B,KAAA,KACAz2B,KAAAw2B,SAAA,KACAx2B,KAAAg0C,KAAA,KACAh0C,KAAAm4B,OAAA,KACAn4B,KAAAi0C,MAAA,KACAj0C,KAAAk0C,SAAA,KACAl0C,KAAA0gB,KAAA,KACA1gB,KAAAm0C,KAAA,IACA,CApBA10C,EAAAinB,MAAA0tB,EACA30C,EAAA2Z,QA0ZA,SAAAm1B,EAAAriB,GACA,OAAAkoB,EAAA7F,GAAA,GAAA,GAAAn1B,QAAA8S,EACA,EA3ZAzsB,EAAA40C,cAiaA,SAAA9F,EAAAriB,GACA,OAAAqiB,EACA6F,EAAA7F,GAAA,GAAA,GAAA8F,cAAAnoB,GADAA,CAEA,EAnaAzsB,EAAA6tB,OAsVA,SAAAprB,GAKAolC,EAAAgN,SAAApyC,KAAAA,EAAAkyC,EAAAlyC,IACA,OAAAA,aAAA4xC,EACA5xC,EAAAorB,SADAwmB,EAAAzwC,UAAAiqB,OAAAvsB,KAAAmB,EAEA,EA5VAzC,EAAAq0C,IAAAA,EAqBA,IAAAS,EAAA,oBACAC,EAAA,WAGAC,EAAA,qCAOAC,EAAA,CAAA,IAAA,IAAA,IAAA,KAAA,IAAA,KAAAhwC,OAHA,CAAA,IAAA,IAAA,IAAA,IAAA,IAAA,KAAA,KAAA,OAMAiwC,EAAA,CAAA,KAAAjwC,OAAAgwC,GAKAE,EAAA,CAAA,IAAA,IAAA,IAAA,IAAA,KAAAlwC,OAAAiwC,GACAE,EAAA,CAAA,IAAA,IAAA,KAEAC,EAAA,yBACAC,EAAA,+BAEAC,EAAA,CACAC,YAAA,EACA,eAAA,GAGAC,EAAA,CACAD,YAAA,EACA,eAAA,GAGAE,EAAA,CACA7rB,MAAA,EACAE,OAAA,EACA4rB,KAAA,EACAC,QAAA,EACAC,MAAA,EACA,SAAA,EACA,UAAA,EACA,QAAA,EACA,WAAA,EACA,SAAA,GAEAnf,EAAA11B,EAAA,eAEA,SAAA2zC,EAAA7qB,EAAAgsB,EAAAC,GACA,GAAAjsB,GAAA+d,EAAAmO,SAAAlsB,IAAAA,aAAAuqB,EAAA,OAAAvqB,EAEA,IAAA7oB,EAAA,IAAAozC,EAEA,OADApzC,EAAAgmB,MAAA6C,EAAAgsB,EAAAC,GACA90C,CACA,CAEAozC,EAAAzwC,UAAAqjB,MAAA,SAAA6C,EAAAgsB,EAAAC,GACA,IAAAlO,EAAAgN,SAAA/qB,GACA,MAAA,IAAAliB,UAAA,gDAAAkiB,GAMA,IAAAmsB,EAAAnsB,EAAArjB,QAAA,KACAyvC,GACA,IAAAD,GAAAA,EAAAnsB,EAAArjB,QAAA,KAAA,IAAA,IACA0vC,EAAArsB,EAAApW,MAAAwiC,GAEAC,EAAA,GAAAA,EAAA,GAAA9mC,QADA,MACA,KAGA,IAAA5K,EAFAqlB,EAAAqsB,EAAA5vC,KAAA2vC,GAQA,GAFAzxC,EAAAA,EAAA6K,QAEAymC,GAAA,IAAAjsB,EAAApW,MAAA,KAAAnS,OAAA,CAEA,IAAA60C,EAAApB,EAAAqB,KAAA5xC,GACA,GAAA2xC,EAeA,OAdA71C,KAAA0gB,KAAAxc,EACAlE,KAAAm0C,KAAAjwC,EACAlE,KAAAk0C,SAAA2B,EAAA,GACAA,EAAA,IACA71C,KAAAm4B,OAAA0d,EAAA,GAEA71C,KAAAi0C,MADAsB,EACApf,EAAAzP,MAAA1mB,KAAAm4B,OAAA3sB,OAAA,IAEAxL,KAAAm4B,OAAA3sB,OAAA,IAEA+pC,IACAv1C,KAAAm4B,OAAA,GACAn4B,KAAAi0C,MAAA,CAAA,GAEAj0C,IAEA,CAEA,IAAAmrB,EAAAopB,EAAAuB,KAAA5xC,GACA,GAAAinB,EAAA,CAEA,IAAA4qB,GADA5qB,EAAAA,EAAA,IACA1hB,cACAzJ,KAAA2pB,SAAAosB,EACA7xC,EAAAA,EAAAsH,OAAA2f,EAAAnqB,OACA,CAMA,GAAAw0C,GAAArqB,GAAAjnB,EAAAwR,MAAA,wBAAA,CACA,IAAAq+B,EAAA,OAAA7vC,EAAAsH,OAAA,EAAA,IACAuoC,GAAA5oB,GAAA+pB,EAAA/pB,KACAjnB,EAAAA,EAAAsH,OAAA,GACAxL,KAAA+zC,SAAA,EAEA,CAEA,IAAAmB,EAAA/pB,KACA4oB,GAAA5oB,IAAAgqB,EAAAhqB,IAAA,CAmBA,IADA,IASAuL,EAAAsf,EATAC,GAAA,EACA11C,EAAA,EAAAA,EAAAs0C,EAAA7zC,OAAAT,IAAA,EAEA,KADA21C,EAAAhyC,EAAAgC,QAAA2uC,EAAAt0C,QACA,IAAA01C,GAAAC,EAAAD,KACAA,EAAAC,EACA,EAgBA,KATAF,GAFA,IAAAC,EAEA/xC,EAAAqG,YAAA,KAIArG,EAAAqG,YAAA,IAAA0rC,MAMAvf,EAAAxyB,EAAA2D,MAAA,EAAAmuC,GACA9xC,EAAAA,EAAA2D,MAAAmuC,EAAA,GACAh2C,KAAA02B,KAAApB,mBAAAoB,IAIAuf,GAAA,EACA,IAAA11C,EAAA,EAAAA,EAAAq0C,EAAA5zC,OAAAT,IAAA,CACA,IAAA21C,GACA,KADAA,EAAAhyC,EAAAgC,QAAA0uC,EAAAr0C,QACA,IAAA01C,GAAAC,EAAAD,KACAA,EAAAC,EACA,EAEA,IAAAD,IACAA,EAAA/xC,EAAAlD,QAEAhB,KAAAu3B,KAAArzB,EAAA2D,MAAA,EAAAouC,GACA/xC,EAAAA,EAAA2D,MAAAouC,GAGAj2C,KAAAm2C,YAIAn2C,KAAAw2B,SAAAx2B,KAAAw2B,UAAA,GAIA,IAAA4f,EAAA,MAAAp2C,KAAAw2B,SAAA,IACA,MAAAx2B,KAAAw2B,SAAAx2B,KAAAw2B,SAAAx1B,OAAA,GAGA,IAAAo1C,EAEA,IADA,IAAAC,EAAAr2C,KAAAw2B,SAAArjB,MAAA,MACAuyB,GAAAnlC,EAAA,EAAA81C,EAAAr1C,QAAAT,EAAAmlC,EAAAnlC,IAAA,CACA,IAAA+1C,EAAAD,EAAA91C,GACA,GAAA+1C,IACAA,EAAA5gC,MAAAo/B,GAAA,CAEA,IADA,IAAAyB,EAAA,GACAvrC,EAAA,EAAApH,EAAA0yC,EAAAt1C,OAAAgK,EAAApH,EAAAoH,IACAsrC,EAAA/wC,WAAAyF,GAAA,IAIAurC,GAAA,IAEAA,GAAAD,EAAAtrC,GAIA,IAAAurC,EAAA7gC,MAAAo/B,GAAA,CACA,IAAA0B,EAAAH,EAAAxuC,MAAA,EAAAtH,GACAk2C,EAAAJ,EAAAxuC,MAAAtH,EAAA,GACAm2C,EAAAJ,EAAA5gC,MAAAq/B,GACA2B,IACAF,EAAAzzC,KAAA2zC,EAAA,IACAD,EAAA37B,QAAA47B,EAAA,KAEAD,EAAAz1C,SACAkD,EAAA,IAAAuyC,EAAAzwC,KAAA,KAAA9B,GAEAlE,KAAAw2B,SAAAggB,EAAAxwC,KAAA,KACA,KACA,CACA,CACA,CAGAhG,KAAAw2B,SAAAx1B,OAjNA,IAkNAhB,KAAAw2B,SAAA,GAGAx2B,KAAAw2B,SAAAx2B,KAAAw2B,SAAA/sB,cAGA2sC,IAKAp2C,KAAAw2B,SAAA5E,EAAA6C,QAAAz0B,KAAAw2B,WAGA,IAAA11B,EAAAd,KAAAy2B,KAAA,IAAAz2B,KAAAy2B,KAAA,GACAkgB,EAAA32C,KAAAw2B,UAAA,GACAx2B,KAAAu3B,KAAAof,EAAA71C,EACAd,KAAAm0C,MAAAn0C,KAAAu3B,KAIA6e,IACAp2C,KAAAw2B,SAAAx2B,KAAAw2B,SAAAhrB,OAAA,EAAAxL,KAAAw2B,SAAAx1B,OAAA,GACA,MAAAkD,EAAA,KACAA,EAAA,IAAAA,GAGA,CAIA,IAAA8wC,EAAAe,GAKA,IAAAx1C,EAAA,EAAAmlC,EAAAiP,EAAA3zC,OAAAT,EAAAmlC,EAAAnlC,IAAA,CACA,IAAAq2C,EAAAjC,EAAAp0C,GACA,IAAA,IAAA2D,EAAAgC,QAAA0wC,GAAA,CAEA,IAAAC,EAAAlhB,mBAAAihB,GACAC,IAAAD,IACAC,EAAAC,OAAAF,IAEA1yC,EAAAA,EAAAiP,MAAAyjC,GAAA5wC,KAAA6wC,EALA,CAMA,CAKA,IAAA7C,EAAA9vC,EAAAgC,QAAA,MACA,IAAA8tC,IAEAh0C,KAAAg0C,KAAA9vC,EAAAsH,OAAAwoC,GACA9vC,EAAAA,EAAA2D,MAAA,EAAAmsC,IAEA,IAAA+C,EAAA7yC,EAAAgC,QAAA,KAoBA,IAnBA,IAAA6wC,GACA/2C,KAAAm4B,OAAAj0B,EAAAsH,OAAAurC,GACA/2C,KAAAi0C,MAAA/vC,EAAAsH,OAAAurC,EAAA,GACAxB,IACAv1C,KAAAi0C,MAAA9d,EAAAzP,MAAA1mB,KAAAi0C,QAEA/vC,EAAAA,EAAA2D,MAAA,EAAAkvC,IACAxB,IAEAv1C,KAAAm4B,OAAA,GACAn4B,KAAAi0C,MAAA,CAAA,GAEA/vC,IAAAlE,KAAAk0C,SAAAhwC,GACAixC,EAAAY,IACA/1C,KAAAw2B,WAAAx2B,KAAAk0C,WACAl0C,KAAAk0C,SAAA,KAIAl0C,KAAAk0C,UAAAl0C,KAAAm4B,OAAA,CACAr3B,EAAAd,KAAAk0C,UAAA,GAAA,IACA7pB,EAAArqB,KAAAm4B,QAAA,GACAn4B,KAAA0gB,KAAA5f,EAAAupB,CACA,CAIA,OADArqB,KAAAm0C,KAAAn0C,KAAAstB,SACAttB,IACA,EAaA8zC,EAAAzwC,UAAAiqB,OAAA,WACA,IAAAoJ,EAAA12B,KAAA02B,MAAA,GACAA,IAEAA,GADAA,EAAAf,mBAAAe,IACA5nB,QAAA,OAAA,KACA4nB,GAAA,KAGA,IAAA/M,EAAA3pB,KAAA2pB,UAAA,GACAuqB,EAAAl0C,KAAAk0C,UAAA,GACAF,EAAAh0C,KAAAg0C,MAAA,GACAzc,GAAA,EACA0c,EAAA,GAEAj0C,KAAAu3B,KACAA,EAAAb,EAAA12B,KAAAu3B,KACAv3B,KAAAw2B,WACAe,EAAAb,IAAA,IAAA12B,KAAAw2B,SAAAtwB,QAAA,KACAlG,KAAAw2B,SACA,IAAAx2B,KAAAw2B,SAAA,KACAx2B,KAAAy2B,OACAc,GAAA,IAAAv3B,KAAAy2B,OAIAz2B,KAAAi0C,OACA3M,EAAAmO,SAAAz1C,KAAAi0C,QACA7wC,OAAAO,KAAA3D,KAAAi0C,OAAAjzC,SACAizC,EAAA9d,EAAA9V,UAAArgB,KAAAi0C,QAGA,IAAA9b,EAAAn4B,KAAAm4B,QAAA8b,GAAA,IAAAA,GAAA,GAsBA,OApBAtqB,GAAA,MAAAA,EAAAne,QAAA,KAAAme,GAAA,KAIA3pB,KAAA+zC,WACApqB,GAAAwrB,EAAAxrB,MAAA,IAAA4N,GACAA,EAAA,MAAAA,GAAA,IACA2c,GAAA,MAAAA,EAAA9qB,OAAA,KAAA8qB,EAAA,IAAAA,IACA3c,IACAA,EAAA,IAGAyc,GAAA,MAAAA,EAAA5qB,OAAA,KAAA4qB,EAAA,IAAAA,GACA7b,GAAA,MAAAA,EAAA/O,OAAA,KAAA+O,EAAA,IAAAA,GAOAxO,EAAA4N,GALA2c,EAAAA,EAAAplC,QAAA,SAAA,SAAA4G,GACA,OAAAigB,mBAAAjgB,EACA,MACAyiB,EAAAA,EAAArpB,QAAA,IAAA,QAEAklC,CACA,EAMAF,EAAAzwC,UAAA+V,QAAA,SAAA8S,GACA,OAAAlsB,KAAAq0C,cAAAD,EAAAloB,GAAA,GAAA,IAAAoB,QACA,EAOAwmB,EAAAzwC,UAAAgxC,cAAA,SAAAnoB,GACA,GAAAob,EAAAgN,SAAApoB,GAAA,CACA,IAAA8qB,EAAA,IAAAlD,EACAkD,EAAAtwB,MAAAwF,GAAA,GAAA,GACAA,EAAA8qB,CACA,CAIA,IAFA,IAAApkB,EAAA,IAAAkhB,EACAmD,EAAA7zC,OAAAO,KAAA3D,MACAk3C,EAAA,EAAAA,EAAAD,EAAAj2C,OAAAk2C,IAAA,CACA,IAAAC,EAAAF,EAAAC,GACAtkB,EAAAukB,GAAAn3C,KAAAm3C,EACA,CAOA,GAHAvkB,EAAAohB,KAAA9nB,EAAA8nB,KAGA,KAAA9nB,EAAAioB,KAEA,OADAvhB,EAAAuhB,KAAAvhB,EAAAtF,SACAsF,EAIA,GAAA1G,EAAA6nB,UAAA7nB,EAAAvC,SAAA,CAGA,IADA,IAAAytB,EAAAh0C,OAAAO,KAAAuoB,GACAmrB,EAAA,EAAAA,EAAAD,EAAAp2C,OAAAq2C,IAAA,CACA,IAAAC,EAAAF,EAAAC,GACA,aAAAC,IACA1kB,EAAA0kB,GAAAprB,EAAAorB,GACA,CASA,OANAnC,EAAAviB,EAAAjJ,WACAiJ,EAAA4D,WAAA5D,EAAAshB,WACAthB,EAAAlS,KAAAkS,EAAAshB,SAAA,KAGAthB,EAAAuhB,KAAAvhB,EAAAtF,SACAsF,CACA,CAEA,GAAA1G,EAAAvC,UAAAuC,EAAAvC,WAAAiJ,EAAAjJ,SAAA,CASA,IAAAwrB,EAAAjpB,EAAAvC,UAAA,CAEA,IADA,IAAAhmB,EAAAP,OAAAO,KAAAuoB,GACAkJ,EAAA,EAAAA,EAAAzxB,EAAA3C,OAAAo0B,IAAA,CACA,IAAAxxB,EAAAD,EAAAyxB,GACAxC,EAAAhvB,GAAAsoB,EAAAtoB,EACA,CAEA,OADAgvB,EAAAuhB,KAAAvhB,EAAAtF,SACAsF,CACA,CAGA,GADAA,EAAAjJ,SAAAuC,EAAAvC,SACAuC,EAAAqL,MAAA2d,EAAAhpB,EAAAvC,UASAiJ,EAAAshB,SAAAhoB,EAAAgoB,aATA,CAEA,IADA,IAAAqD,GAAArrB,EAAAgoB,UAAA,IAAA/gC,MAAA,KACAokC,EAAAv2C,UAAAkrB,EAAAqL,KAAAggB,EAAAx6B,WACAmP,EAAAqL,OAAArL,EAAAqL,KAAA,IACArL,EAAAsK,WAAAtK,EAAAsK,SAAA,IACA,KAAA+gB,EAAA,IAAAA,EAAAz8B,QAAA,IACAy8B,EAAAv2C,OAAA,GAAAu2C,EAAAz8B,QAAA,IACA8X,EAAAshB,SAAAqD,EAAAvxC,KAAA,IACA,CAUA,GAPA4sB,EAAAuF,OAAAjM,EAAAiM,OACAvF,EAAAqhB,MAAA/nB,EAAA+nB,MACArhB,EAAA2E,KAAArL,EAAAqL,MAAA,GACA3E,EAAA8D,KAAAxK,EAAAwK,KACA9D,EAAA4D,SAAAtK,EAAAsK,UAAAtK,EAAAqL,KACA3E,EAAA6D,KAAAvK,EAAAuK,KAEA7D,EAAAshB,UAAAthB,EAAAuF,OAAA,CACA,IAAAr3B,EAAA8xB,EAAAshB,UAAA,GACA7pB,EAAAuI,EAAAuF,QAAA,GACAvF,EAAAlS,KAAA5f,EAAAupB,CACA,CAGA,OAFAuI,EAAAmhB,QAAAnhB,EAAAmhB,SAAA7nB,EAAA6nB,QACAnhB,EAAAuhB,KAAAvhB,EAAAtF,SACAsF,CACA,CAEA,IAAA4kB,EAAA5kB,EAAAshB,UAAA,MAAAthB,EAAAshB,SAAA9qB,OAAA,GACAquB,EACAvrB,EAAAqL,MACArL,EAAAgoB,UAAA,MAAAhoB,EAAAgoB,SAAA9qB,OAAA,GAEAsuB,EAAAD,GAAAD,GACA5kB,EAAA2E,MAAArL,EAAAgoB,SACAyD,EAAAD,EACAE,EAAAhlB,EAAAshB,UAAAthB,EAAAshB,SAAA/gC,MAAA,MAAA,GAEA0kC,GADAN,EAAArrB,EAAAgoB,UAAAhoB,EAAAgoB,SAAA/gC,MAAA,MAAA,GACAyf,EAAAjJ,WAAAwrB,EAAAviB,EAAAjJ,WA2BA,GApBAkuB,IACAjlB,EAAA4D,SAAA,GACA5D,EAAA6D,KAAA,KACA7D,EAAA2E,OACA,KAAAqgB,EAAA,GAAAA,EAAA,GAAAhlB,EAAA2E,KACAqgB,EAAA98B,QAAA8X,EAAA2E,OAEA3E,EAAA2E,KAAA,GACArL,EAAAvC,WACAuC,EAAAsK,SAAA,KACAtK,EAAAuK,KAAA,KACAvK,EAAAqL,OACA,KAAAggB,EAAA,GAAAA,EAAA,GAAArrB,EAAAqL,KACAggB,EAAAz8B,QAAAoR,EAAAqL,OAEArL,EAAAqL,KAAA,MAEAmgB,EAAAA,IAAA,KAAAH,EAAA,IAAA,KAAAK,EAAA,KAGAH,EAEA7kB,EAAA2E,KAAArL,EAAAqL,MAAA,KAAArL,EAAAqL,KACArL,EAAAqL,KAAA3E,EAAA2E,KACA3E,EAAA4D,SAAAtK,EAAAsK,UAAA,KAAAtK,EAAAsK,SACAtK,EAAAsK,SAAA5D,EAAA4D,SACA5D,EAAAuF,OAAAjM,EAAAiM,OACAvF,EAAAqhB,MAAA/nB,EAAA+nB,MACA2D,EAAAL,OAEA,GAAAA,EAAAv2C,OAGA42C,IAAAA,EAAA,IACAA,EAAA90C,MACA80C,EAAAA,EAAAlzC,OAAA6yC,GACA3kB,EAAAuF,OAAAjM,EAAAiM,OACAvF,EAAAqhB,MAAA/nB,EAAA+nB,WACA,IAAA3M,EAAAwQ,kBAAA5rB,EAAAiM,QAAA,CAIA,GAAA0f,EACAjlB,EAAA4D,SAAA5D,EAAA2E,KAAAqgB,EAAA76B,SAIAg7B,KAAAnlB,EAAA2E,MAAA3E,EAAA2E,KAAArxB,QAAA,KAAA,IACA0sB,EAAA2E,KAAApkB,MAAA,QAEAyf,EAAA8D,KAAAqhB,EAAAh7B,QACA6V,EAAA2E,KAAA3E,EAAA4D,SAAAuhB,EAAAh7B,SAWA,OARA6V,EAAAuF,OAAAjM,EAAAiM,OACAvF,EAAAqhB,MAAA/nB,EAAA+nB,MAEA3M,EAAA0Q,OAAAplB,EAAAshB,WAAA5M,EAAA0Q,OAAAplB,EAAAuF,UACAvF,EAAAlS,MAAAkS,EAAAshB,SAAAthB,EAAAshB,SAAA,KACAthB,EAAAuF,OAAAvF,EAAAuF,OAAA,KAEAvF,EAAAuhB,KAAAvhB,EAAAtF,SACAsF,CACA,CAEA,IAAAglB,EAAA52C,OAWA,OARA4xB,EAAAshB,SAAA,KAEAthB,EAAAuF,OACAvF,EAAAlS,KAAA,IAAAkS,EAAAuF,OAEAvF,EAAAlS,KAAA,KAEAkS,EAAAuhB,KAAAvhB,EAAAtF,SACAsF,EAcA,IARA,IAAAsZ,EAAA0L,EAAA/vC,OAAA,GAAA,GACAowC,GACArlB,EAAA2E,MAAArL,EAAAqL,MAAAqgB,EAAA52C,OAAA,KACA,MAAAkrC,GAAA,OAAAA,IAAA,KAAAA,EAIAgM,EAAA,EACA33C,EAAAq3C,EAAA52C,OAAAT,GAAA,EAAAA,IAEA,OADA2rC,EAAA0L,EAAAr3C,IAEAq3C,EAAA5jB,OAAAzzB,EAAA,GACA,OAAA2rC,GACA0L,EAAA5jB,OAAAzzB,EAAA,GACA23C,KACAA,IACAN,EAAA5jB,OAAAzzB,EAAA,GACA23C,KAKA,IAAAR,IAAAC,EACA,KAAAO,IAAAA,EACAN,EAAA98B,QAAA,OAIA48B,GAAA,KAAAE,EAAA,IACAA,EAAA,IAAA,MAAAA,EAAA,GAAAxuB,OAAA,IACAwuB,EAAA98B,QAAA,IAGAm9B,GAAA,MAAAL,EAAA5xC,KAAA,KAAAwF,QAAA,IACAosC,EAAA70C,KAAA,IAGA,IAUAg1C,EAVAhsB,EAAA,KAAA6rB,EAAA,IACAA,EAAA,IAAA,MAAAA,EAAA,GAAAxuB,OAAA,GAGAyuB,IACAjlB,EAAA4D,SAAA5D,EAAA2E,KAAAxL,EAAA,GACA6rB,EAAA52C,OAAA42C,EAAA76B,QAAA,IAIAg7B,KAAAnlB,EAAA2E,MAAA3E,EAAA2E,KAAArxB,QAAA,KAAA,IACA0sB,EAAA2E,KAAApkB,MAAA,QAEAyf,EAAA8D,KAAAqhB,EAAAh7B,QACA6V,EAAA2E,KAAA3E,EAAA4D,SAAAuhB,EAAAh7B,UAyBA,OArBA26B,EAAAA,GAAA9kB,EAAA2E,MAAAqgB,EAAA52C,UAEA+qB,GACA6rB,EAAA98B,QAAA,IAGA88B,EAAA52C,OAIA4xB,EAAAshB,SAAA0D,EAAA5xC,KAAA,MAHA4sB,EAAAshB,SAAA,KACAthB,EAAAlS,KAAA,MAMA4mB,EAAA0Q,OAAAplB,EAAAshB,WAAA5M,EAAA0Q,OAAAplB,EAAAuF,UACAvF,EAAAlS,MAAAkS,EAAAshB,SAAAthB,EAAAshB,SAAA,KACAthB,EAAAuF,OAAAvF,EAAAuF,OAAA,KAEAvF,EAAA8D,KAAAxK,EAAAwK,MAAA9D,EAAA8D,KACA9D,EAAAmhB,QAAAnhB,EAAAmhB,SAAA7nB,EAAA6nB,QACAnhB,EAAAuhB,KAAAvhB,EAAAtF,SACAsF,CACA,EAEAkhB,EAAAzwC,UAAA8yC,UAAA,WACA,IAAA5e,EAAAv3B,KAAAu3B,KACAd,EAAA+d,EAAAsB,KAAAve,GACAd,IAEA,OADAA,EAAAA,EAAA,MAEAz2B,KAAAy2B,KAAAA,EAAAjrB,OAAA,IAEA+rB,EAAAA,EAAA/rB,OAAA,EAAA+rB,EAAAv2B,OAAAy1B,EAAAz1B,SAEAu2B,IAAAv3B,KAAAw2B,SAAAe,EACA,CtEmnUA,EAAE,CAAC,SAAS,GAAG3F,SAAW,GAAGuE,YAAc,KAAK,GAAG,CAAC,SAAS11B,EAAQf,EAAOD,GuE50V5EC,EAAAD,QAAA,CACA60C,SAAA,SAAAntC,GACA,MAAA,iBAAAA,CACA,EACAsuC,SAAA,SAAAtuC,GACA,MAAA,iBAAAA,GAAA,OAAAA,CACA,EACA6wC,OAAA,SAAA7wC,GACA,OAAA,OAAAA,CACA,EACA2wC,kBAAA,SAAA3wC,GACA,OAAA,MAAAA,CACA,EvEk1VA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS1G,EAAQf,EAAOD,IAClC,SAAWK,IAAQ,WwEzyVnB,SAAAq4C,EAAA3kC,GAEA,IACA,IAAA1T,EAAAs4C,aAAA,OAAA,CACA,CAAA,MAAAzM,GACA,OAAA,CACA,CACA,IAAAvhC,EAAAtK,EAAAs4C,aAAA5kC,GACA,OAAA,MAAApJ,GACA,SAAAO,OAAAP,GAAAX,aACA,CA7DA/J,EAAAD,QAoBA,SAAAiC,EAAAy+B,GACA,GAAAgY,EAAA,iBACA,OAAAz2C,EAGA,IAAAqZ,GAAA,EAeA,OAdA,WACA,IAAAA,EAAA,CACA,GAAAo9B,EAAA,oBACA,MAAA,IAAAv3C,MAAAu/B,GACAgY,EAAA,oBACA5qC,QAAA4Q,MAAAgiB,GAEA5yB,QAAA2N,KAAAilB,GAEAplB,GAAA,CACA,CACA,OAAArZ,EAAAC,MAAA3B,KAAA4B,UACA,CAGA,CxEw3VC,GAAEb,KAAKf,KAAM,GAAEe,KAAKf,KAAuB,oBAAXF,OAAyBA,OAAyB,oBAATC,KAAuBA,KAAyB,oBAAXF,OAAyBA,OAAS,CAAC,EAElJ,EAAE,CAAC,GAAG,GAAG,CAAC,SAASY,EAAQf,EAAOD,GyEn6VlCC,EAAAD,QACA,SAAAqrB,EAAAppB,EAAAJ,GACA,GAAAI,GAAAJ,EAAA,OAAAwpB,EAAAppB,EAAAopB,CAAAxpB,GAEA,GAAA,mBAAAI,EACA,MAAA,IAAA2F,UAAA,yBAMA,OAJAjE,OAAAO,KAAAjC,GAAA2lB,SAAA,SAAAzjB,GACAy0C,EAAAz0C,GAAAlC,EAAAkC,EACA,IAEAy0C,EAEA,SAAAA,IAEA,IADA,IAAAz1C,EAAA,IAAAM,MAAAtB,UAAAZ,QACAT,EAAA,EAAAA,EAAAqC,EAAA5B,OAAAT,IACAqC,EAAArC,GAAAqB,UAAArB,GAEA,IAAAkP,EAAA/N,EAAAC,MAAA3B,KAAA4C,GACAtB,EAAAsB,EAAAA,EAAA5B,OAAA,GAMA,MALA,mBAAAyO,GAAAA,IAAAnO,GACA8B,OAAAO,KAAArC,GAAA+lB,SAAA,SAAAzjB,GACA6L,EAAA7L,GAAAtC,EAAAsC,EACA,IAEA6L,CACA,CACA,CzE26VA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAShP,EAAQf,EAAOD,G0E38VlCC,EAAAD,QAIA,WAGA,IAFA,IAAAuP,EAAA,CAAA,EAEAzO,EAAA,EAAAA,EAAAqB,UAAAZ,OAAAT,IAAA,CACA,IAAAguC,EAAA3sC,UAAArB,GAEA,IAAA,IAAAiC,KAAA+rC,EACA1qC,EAAA9C,KAAAwtC,EAAA/rC,KACAwM,EAAAxM,GAAA+rC,EAAA/rC,GAGA,CAEA,OAAAwM,CACA,EAhBA,IAAAnL,EAAAT,OAAAC,UAAAQ,c1E89VA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASpD,EAAQf,EAAOD,G2Eh+VlC,IAAA64C,EAAA73C,EAAA,cAEA,iBAAAZ,QAAAA,OAAAgE,eAAA,WAEAhE,OAAAI,MAAAq4C,GAGA54C,EAAAD,QAAA64C,C3Ek+VA,EAAE,CAAC,aAAa,KAAK,GAAG,CAAC,SAAS73C,EAAQf,EAAOD,G4Ez+VjD,MAAA84C,EAAAn4B,KAAAC,UACA,CACAm4B,SAAA,CACAC,MAAA,EACAC,MAAA,EAEAC,MAAA,GACAC,QAAA,GAEAC,QAAA,GAEAC,OAAA,CACAC,WAAA,EAEAC,mBAAA,EACAC,sBAAA,EAEAC,MAAA,EACAC,eAAA,EAEAC,UAAA,EACAC,QAAA,GAEAC,OAAA,GACAC,IAAA,KAgGA75C,EAAAD,QA7FA,MAEA8T,YAAA4O,EAAAq3B,EAAAC,GAEAz5C,KAAA05C,MAAAv3B,EAEAniB,KAAAwT,KAAAgmC,EAEAx5C,KAAAub,MAAA6E,KAAAsG,MAAA6xB,GAEAv4C,KAAAub,MAAAi9B,SAAAC,KAAAz4C,KAAA05C,MAAArwB,UACArpB,KAAAub,MAAAi9B,SAAAE,KAAA14C,KAAAub,MAAAk9B,KAEA,iBAAAgB,IAEAz5C,KAAAub,MAAAi9B,SAAAE,KAAAe,EAEA,CAEAhB,WAEA,OAAAz4C,KAAAub,MAAAi9B,SAAAC,IACA,CAEAC,WAEA,OAAA14C,KAAAub,MAAAi9B,SAAAE,IACA,CAEAv4B,UAEA,OAAAngB,IACA,CAEA25C,kBAAAl7B,EAAAL,EAAAC,GAEAre,KAAAub,MAAAg+B,IAAAx2C,KAAA,GAAA2B,QAAA,IAAAkZ,MAAAg8B,cAAA,MAAAl1C,OAAA+Z,EAAA,OAAA/Z,OAAA0Z,IAEA,iBAAAC,GAEAre,KAAAub,MAAAg+B,IAAAx2C,KAAAqd,KAAAC,UAAAhC,GAEA,CAEAw7B,qBAAAz7B,EAAAC,GAEAre,KAAAub,MAAA+9B,OAAAv2C,KAAA,GAAA2B,OAAA0Z,IAEA,iBAAAC,GAEAre,KAAAub,MAAA+9B,OAAAv2C,KAAAqd,KAAAC,UAAAhC,GAEA,CAEAF,MAAAC,EAAAC,GAEAre,KAAA25C,kBAAA,QAAAv7B,EAAAC,GACAre,KAAA05C,MAAAv5B,IAAAhC,MAAAC,EAAAC,EACA,CAEAC,MAAAF,EAAAC,GAEAre,KAAA25C,kBAAA,QAAAv7B,EAAAC,GACAre,KAAA05C,MAAAv5B,IAAA7B,MAAAF,EAAAC,EACA,CAEAE,KAAAH,EAAAC,GAEAre,KAAA25C,kBAAA,OAAAv7B,EAAAC,GACAre,KAAA05C,MAAAv5B,IAAA5B,KAAAH,EAAAC,EACA,CAEAnD,KAAAkD,EAAAC,GAEAre,KAAA25C,kBAAA,OAAAv7B,EAAAC,GACAre,KAAA05C,MAAAv5B,IAAAjF,KAAAkD,EAAAC,EACA,CAEA7Q,MAAA4Q,EAAAC,GAEAre,KAAA25C,kBAAA,QAAAv7B,EAAAC,GACAre,KAAA65C,qBAAAz7B,EAAAC,GACAre,KAAA05C,MAAAv5B,IAAA3S,MAAA4Q,EAAAC,EACA,CAEAG,MAAAJ,EAAAC,GAEAre,KAAA25C,kBAAA,QAAAv7B,EAAAC,GACAre,KAAA65C,qBAAAz7B,EAAAC,GACAre,KAAA05C,MAAAv5B,IAAA3B,MAAAJ,EAAAC,EACA,E5E8+VA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS5d,EAAQf,EAAOD,G6EhkWlCC,EAAAD;;;;;;;;;;AAzBA,MAEA8T,YAAAumC,EAAAC,GAEA/5C,KAAA05C,OAAA,EAEA15C,KAAA+0B,QAAA,iBAAA+kB,EAAAA,EAAA,CAAA,EAEA95C,KAAAg6C,YAAA,UAGAh6C,KAAAi6C,KAAA,WAAAv1C,OAAAV,KAAAia,MAAA,MAAAja,KAAAga,SAAA,MAEAhe,KAAA04C,KAAA,iBAAAqB,EAAAA,EAAA,GAAAr1C,OAAA1E,KAAAi6C,KACA,CAGAC,aAAA/3B,GAIA,OAFAniB,KAAA05C,MAAAv3B,GAEA,CACA,E7EwmWA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS1hB,EAAQf,EAAOD;;;;;;A8EloWlC,MAAA06C,EAAA15C,EAAA,kCAwGAf,EAAAD,QAtGA,MAEA8T,YAAA4O,GAEAniB,KAAA05C,MAAAv3B,EAEAniB,KAAAo6C,aAAA,GAGAp6C,KAAAq6C,SAAA,CAAA,EAGAr6C,KAAAs6C,gBAAA,CAAA,EAGAt6C,KAAAu6C,eAAA,CAAA,CACA,CAEAC,eAAAC,EAAAC,GAGA16C,KAAAo6C,aAAAr3C,KAAA03C,GAGAz6C,KAAAq6C,SAAAI,GAAA,CAAA,EAEA,mBAAAC,GAAAA,EAAAr3C,qBAAA82C,EAGAn6C,KAAAu6C,eAAAE,GAAAC,EAKA16C,KAAAu6C,eAAAE,GAAAN,CAEA,CAEAQ,2BAAAF,EAAAX,EAAAc,GAGA,IAAAC,EAAA76C,KAAA86C,8CAAAL,EAAAX,EAAAc,GAWA,OARA56C,KAAAq6C,SAAAI,GAAAI,EAAAnC,MAAAmC,EAGA76C,KAAAs6C,gBAAAz2C,eAAA42C,KAEAz6C,KAAAs6C,gBAAAG,GAAAI,GAGAA,CACA,CAGAC,8CAAAL,EAAAX,EAAAc,GAIA,OADA,IAAA56C,KAAAu6C,eAAAE,GAAAz6C,KAAA05C,MAAAI,EAAAc,EAEA,CAGAG,sCAAAC,GAEA,IAAAC,EAAAD,EAAAhB,YACAkB,EAAAF,EAAAtC,KAoBA,OAjBAsC,EAAAd,aAAAl6C,KAAA05C,OAEA15C,KAAAq6C,SAAAx2C,eAAAo3C,KAIAj7C,KAAAq6C,SAAAY,GAAA,CAAA,GAGAj7C,KAAAq6C,SAAAY,GAAAC,GAAAF,EAGAh7C,KAAAs6C,gBAAAz2C,eAAAo3C,KAEAj7C,KAAAs6C,gBAAAW,GAAAD,GAGAA,CACA,CAEAG,+BAAAV,EAAAV,GAEA,QAAA/5C,KAAAq6C,SAAAI,GAAA52C,eAAAk2C,KAEA/5C,KAAAs6C,gBAAAG,GAAAz6C,KAAAq6C,SAAAI,GAAAV,IACA,EAIA,GAKAr6C,EAAAD,QAAA27C,oBAAAjB,C9E0oWA,EAAE,CAAC,iCAAiC,KAAK,GAAG,CAAC,SAAS15C,EAAQf,EAAOD,G+EpuWrEC,EAAAD;;;;;;AAhBA,MAEA8T,YAAA4O,EAAA23B,EAAAC,GAEA/5C,KAAA05C,MAAAv3B,EAEAniB,KAAA+0B,QAAA,iBAAA+kB,EAAAA,EAAA,CAAA,EAEA95C,KAAAg6C,YAAA,UAEAh6C,KAAAi6C,KAAA93B,EAAAkH,UAEArpB,KAAA04C,KAAA,iBAAAqB,EAAAA,EAAA,GAAAr1C,OAAA1E,KAAAi6C,KACA,E/EgwWA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASx5C,EAAQf,EAAOD;;;;;;AgF7wWlC,MAAA47C,EAAA56C,EAAA,kBACA66C,EAAA76C,EAAA,cACA86C,EAAA96C,EAAA,aAEA+6C,EAAA/6C,EAAA,yCACAg7C,EAAAh7C,EAAA,6BAGAi7C,EAAAj7C,EAAA,8CACAk7C,EAAAl7C,EAAA,4CACAm7C,EAAAn7C,EAAA,0CACAo7C,EAAAp7C,EAAA,wCACAq7C,EAAAr7C,EAAA,uCAEAs7C,EAAAt7C,EAAA,wBAEA,MAAAR,EAEAsT,YAAAuR,GAEA,IAAA1C,EAAA,IAAAi5B,EAAAv2B,GAEA9kB,KAAAg8C,gBAAA55B,EAGApiB,KAAAi8C,QAAA,IAAAX,EAAAt7C,KAAAg8C,gBAAAn1B,UAEA7mB,KAAAmgB,IAAA,IAAAo7B,EAAAv7C,KAAAg8C,gBAAAn1B,UACA7mB,KAAAmgB,IAAAjC,aAGAle,KAAAk8C,aACA,CACA52B,UAAA+1B,EAAA/1B,WAIAtlB,KAAAm8C,WAAA,CAAA,EAEAn8C,KAAAo8C,eAAA,IAAAX,EAAAz7C,MAGAA,KAAAo8C,eAAA5B,eAAA,iBAAAkB,GACA17C,KAAA05C,MAAA0C,eAAAzB,2BAAA,iBAAA,CAAA,EAAA,kCAEA36C,KAAAq8C,eAAAr8C,KAAAo8C,eAAA9B,gBAAA+B,eAAAC,uBAGAt8C,KAAAo8C,eAAA5B,eAAA,WAAAqB,GAGA77C,KAAAo8C,eAAA5B,eAAA,eAAAmB,GAGA37C,KAAAo8C,eAAA5B,eAAA,UAAAsB,GACA97C,KAAA05C,MAAA0C,eAAAzB,2BAAA,UAAA,CAAA,EAAA,2BACA36C,KAAAu8C,QAAAv8C,KAAAo8C,eAAA9B,gBAAAiC,QAGAv8C,KAAAo8C,eAAA5B,eAAA,aAAAoB,GAEA57C,KAAAq6C,SAAAr6C,KAAAo8C,eAAA/B,SACAr6C,KAAAs6C,gBAAAt6C,KAAAo8C,eAAA9B,eACA,CAEAzzB,eAEA,OAAA7mB,KAAAg8C,gBAAAn1B,QACA,CAEA6yB,YAEA,OAAA15C,IACA,CAEAqpB,UAEA,OAAArpB,KAAAi8C,QAAA5yB,SACA,CAEAmzB,gBAAAhD,EAAAC,GAEA,IAAAgD,EAAA,IAAAV,EAAA/7C,KAAAw5C,EAAAC,GAYA,OAVAz5C,KAAAm8C,WAAAt4C,eAAA44C,EAAA/D,QAOA14C,KAAAm8C,WAAAM,EAAA/D,MAAA+D,GAGAA,CACA,CAEAC,aAAAjD,GAEA,QAAAz5C,KAAAm8C,WAAAt4C,eAAA41C,IAMAz5C,KAAAm8C,WAAA1C,EAEA,EASA/5C,EAAAD,QAAAQ,EACAP,EAAAD,QAAAolB,IANA,SAAAC,GAEA,OAAA,IAAA7kB,EAAA6kB,EACA,EAKAplB,EAAAD,QAAAslB,gBAAAw2B,EAAAx2B,gBACArlB,EAAAD,QAAA27C,oBAAAK,EAAAL,oBACA17C,EAAAD,QAAAk9C,2BAAAnB,EAEA97C,EAAAD,QAAA6lB,UAAA+1B,EAAA/1B,ShFqxWA,EAAE,CAAC,uBAAuB,GAAG,wCAAwC,GAAG,4BAA4B,GAAG,6CAA6C,GAAG,2CAA2C,GAAG,yCAAyC,GAAG,uCAAuC,GAAG,sCAAsC,GAAG,YAAY,GAAG,iBAAiB,GAAG,aAAa,KAAK,GAAG,CAAC,SAAS7kB,EAAQf,EAAOD,GiFt5WrZ,MAAA06C,EAAA15C,EAAA,mCAEAm8C,EAAAn8C,EAAA,mBAcAf,EAAAD,QAZA,cAAA06C,EAEA5mC,YAAA4O,EAAA23B,EAAAC,GAEA96B,MAAAkD,EAAA23B,EAAAC,GAEA/5C,KAAAg6C,YAAA,iBAEAh6C,KAAAs8C,uBAAA,IAAAM,CACA,EjF25WA,EAAE,CAAC,kCAAkC,GAAG,kBAAkB,KAAK,GAAG,CAAC,SAASn8C,EAAQf,EAAOD,GkFx6W3F,MAAA06C,EAAA15C,EAAA,mCAEAwlB,EAAAxlB,EAAA,aAsCAf,EAAAD,QApCA,cAAA06C,EAEA5mC,YAAA4O,EAAA23B,EAAAC,GAEA96B,MAAAkD,EAAA23B,EAAAC,GAEA/5C,KAAAg6C,YAAA,eAEAh6C,KAAA68C,qBAAA,IAAA52B,EAAAjmB,KAAA+0B,QACA,CAUAxP,WAAA2I,EAAAC,EAAAC,GAEA,OAAApuB,KAAA68C,qBAAAt3B,WAAA2I,EAAAC,EAAAC,EACA,CAQArI,YAAAxR,EAAA8Z,GAEA,OAAAruB,KAAA68C,qBAAA92B,YAAAxR,EAAA8Z,EACA,ElF66WA,EAAE,CAAC,kCAAkC,GAAG/I,UAAY,KAAK,GAAG,CAAC,SAAS7kB,EAAQf,EAAOD,GmFl9WrF,MAAA06C,EAAA15C,EAAA,mCAEAq8C,EAAAr8C,EAAA,cAcAf,EAAAD,QAZA,cAAA06C,EAEA5mC,YAAA4O,EAAA23B,EAAAC,GAEA96B,MAAAkD,EAAA23B,EAAAC,GAEA/5C,KAAAg6C,YAAA,aAEAh6C,KAAA+8C,WAAA,IAAAD,CACA,EnFu9WA,EAAE,CAAC,kCAAkC,GAAG,aAAa,KAAK,GAAG,CAAC,SAASr8C,EAAQf,EAAOD,GoFp+WtF,MAAA06C,EAAA15C,EAAA,mCAyGAf,EAAAD,QAvGA,cAAA06C,EAWA5mC,YAAA4O,EAAA23B,EAAAC,GAEA96B,MAAAkD,EAAA23B,EAAAC,GAEA/5C,KAAAg6C,YAAA,WAIAh6C,KAAAg9C,SACA,CACAC,SAAA,kBACAC,YAAA,mBACAC,QAAA,+BACAC,UAAA,8BAEAC,mBAAA,MAKAr9C,KAAAs9C,gBAAA,CACA,KAAA,KACA,IAAA,IACAp9C,EAAA,KACA,KAAA,IACAE,EAAA,KACA,KAAA,IACAC,EAAA,KACA,KAAA,IACAk9C,MAAA,SACA,SAAA,QACAC,MAAA,SACA,SAAA,SAKAx9C,KAAAy9C,gBAAA,EACAz9C,KAAA09C,gBAAA,CACA,CAEAC,eAAAtvB,GAEA,OAAAruB,KAAAy9C,eAAApvB,EACA,CAEAuvB,iBAAAvvB,GAGA,OADAruB,KAAA29C,eAAAvnC,KAAApW,KAEA,CAEA69C,sBAAAC,EAAAzvB,GA2BA,OAvBAruB,KAAA+9C,eAAA,SAAAD,EACAhvC,QAAA9O,KAAAg9C,SAAAG,SACAvnC,GAEA,KAAAlR,OAAA1E,KAAAs9C,gBAAA1nC,MAEA9G,QAAA9O,KAAAg9C,SAAAE,aAAAl9C,KAAAg9C,SAAAK,oBACA,CAAAznC,EAAAooC,IAEA,QAAAt5C,OAAA4wB,mBAAA0oB,GAAA,WAEAlvC,QAAA9O,KAAAg9C,SAAAC,UAAAj9C,KAAAg9C,SAAAK,oBACA,CAAAznC,EAAAooC,IAEA,OAAAt5C,OAAA4wB,mBAAA0oB,GAAA,eACA,OAGAh+C,KAAA+9C,eAAA,mCAAAr5C,OAAA1E,KAAA+9C,eAAA,OACA/9C,KAAA+9C,eAAA,oFAAAr5C,OAAA1E,KAAA+9C,eAAA,iBAEA/9C,KAAAy9C,eAAA,IAAA9kC,SAAA,sBAAA3Y,KAAA+9C,qBAEA,IAAA1vB,EAEAruB,KAAAy9C,eAAApvB,IAKAruB,KAAAi+C,uBAAA,mBAAAj+C,KAAA+9C,eAAA,IAEA/9C,KAAA49C,mBACA,EpFy+WA,EAAE,CAAC,kCAAkC,KAAK,GAAG,CAAC,SAASn9C,EAAQf,EAAOD,GqF/kXtE,MAAA06C,EAAA15C,EAAA,mCAIAy9C,EAAAz9C,EAAA,mBACA09C,EAAA19C,EAAA,mBA6EAf,EAAAD,QA3EA,cAAA06C,EAWA5mC,YAAA4O,EAAA23B,EAAAC,GAEA96B,MAAAkD,EAAA23B,EAAAC,GAEA/5C,KAAAo+C,UAAA,CAAA,EAGAp+C,KAAAq+C,UAAAH,EACAl+C,KAAAs+C,UAAAH,CACA,CAIAnmB,OAAAumB,GACA,IAAA,IAAAC,EAAA58C,UAAAZ,OADAy9C,EAAA,IAAAv7C,MAAAs7C,EAAA,EAAAA,EAAA,EAAA,GAAAE,EAAA,EAAAA,EAAAF,EAAAE,IAAAD,EAAAC,EAAA,GAAA98C,UAAA88C,GAEA,OAAAt7C,OAAAugB,OAAA46B,KAAAE,EACA,CAKAE,SAAAb,EAAAzvB,GAIA,OAFAruB,KAAA05C,MAAA0C,eAAAtB,8CAAA,YAEA+C,sBAAAC,EAAAzvB,EACA,CAGAuwB,oBAAAC,EAAAf,EAAAzvB,GAEA,IAAAywB,EAAA9+C,KAAA05C,MAAA0C,eAAAzB,2BAAA,WAAA,CAAA,EAAAkE,GAIA,OAFA7+C,KAAAo+C,UAAAS,GAAAC,EAAAjB,sBAAAC,EAAAzvB,GAEAruB,KAAAo+C,UAAAS,EACA,CAOA7oB,MAAA+oB,EAAAC,EAAAC,GAEA,IAAAC,EAAA,IAAAH,GAEAI,EAAA,iBAAAH,EAAAA,EAAA,EACAI,OAAA,IAAAH,EAAAA,EAAA,GAEA,GAAAE,GAAA,EAEA,OAAAC,EAGA,KAAAF,EAAAl+C,QAEAo+C,EAAAr8C,KAAAm8C,EAAAlrB,OAAA,EAAAmrB,IAGA,OAAAC,CACA,ErFolXA,EAAE,CAAC,kCAAkC,GAAG,kBAAkB,EAAE,kBAAkB,MAAM,CAAC,EAAE,CAAC,ICnqXxF,CDmqX6F,GAC7F","file":"fable.min.js","sourcesContent":["(function(f){if(typeof exports===\"object\"&&typeof module!==\"undefined\"){module.exports=f()}else if(typeof define===\"function\"&&define.amd){define([],f)}else{var g;if(typeof window!==\"undefined\"){g=window}else if(typeof global!==\"undefined\"){g=global}else if(typeof self!==\"undefined\"){g=self}else{g=this}g.Fable = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c=\"function\"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error(\"Cannot find module '\"+i+\"'\");throw a.code=\"MODULE_NOT_FOUND\",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u=\"function\"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){\n'use strict';\n\nvar eachOfLimit = require('async.util.eachoflimit');\nvar withoutIndex = require('async.util.withoutindex');\n\nmodule.exports = function eachLimit(arr, limit, iterator, cb) {\n return eachOfLimit(limit)(arr, withoutIndex(iterator), cb);\n};\n\n},{\"async.util.eachoflimit\":3,\"async.util.withoutindex\":14}],2:[function(require,module,exports){\n'use strict';\n\nmodule.exports = function(tasks) {\n function makeCallback(index) {\n function fn() {\n if (tasks.length) {\n tasks[index].apply(null, arguments);\n }\n return fn.next();\n }\n fn.next = function() {\n return (index < tasks.length - 1) ? makeCallback(index + 1) : null;\n };\n return fn;\n }\n return makeCallback(0);\n};\n\n},{}],3:[function(require,module,exports){\nvar once = require('async.util.once');\nvar noop = require('async.util.noop');\nvar onlyOnce = require('async.util.onlyonce');\nvar keyIterator = require('async.util.keyiterator');\n\nmodule.exports = function eachOfLimit(limit) {\n return function(obj, iterator, cb) {\n cb = once(cb || noop);\n obj = obj || [];\n var nextKey = keyIterator(obj);\n if (limit <= 0) {\n return cb(null);\n }\n var done = false;\n var running = 0;\n var errored = false;\n\n (function replenish() {\n if (done && running <= 0) {\n return cb(null);\n }\n\n while (running < limit && !errored) {\n var key = nextKey();\n if (key === null) {\n done = true;\n if (running <= 0) {\n cb(null);\n }\n return;\n }\n running += 1;\n iterator(obj[key], key, onlyOnce(function(err) {\n running -= 1;\n if (err) {\n cb(err);\n errored = true;\n } else {\n replenish();\n }\n }));\n }\n })();\n };\n};\n\n},{\"async.util.keyiterator\":7,\"async.util.noop\":9,\"async.util.once\":10,\"async.util.onlyonce\":11}],4:[function(require,module,exports){\n'use strict';\nvar setImmediate = require('async.util.setimmediate');\nvar restParam = require('async.util.restparam');\n\nmodule.exports = function(fn) {\n return restParam(function(args) {\n var callback = args.pop();\n args.push(function() {\n var innerArgs = arguments;\n if (sync) {\n setImmediate(function() {\n callback.apply(null, innerArgs);\n });\n } else {\n callback.apply(null, innerArgs);\n }\n });\n var sync = true;\n fn.apply(this, args);\n sync = false;\n });\n};\n\n},{\"async.util.restparam\":12,\"async.util.setimmediate\":13}],5:[function(require,module,exports){\n'use strict';\n\nmodule.exports = Array.isArray || function isArray(obj) {\n return Object.prototype.toString.call(obj) === '[object Array]';\n};\n\n},{}],6:[function(require,module,exports){\n'use strict';\n\nvar isArray = require('async.util.isarray');\n\nmodule.exports = function isArrayLike(arr) {\n return isArray(arr) || (\n // has a positive integer length property\n typeof arr.length === 'number' &&\n arr.length >= 0 &&\n arr.length % 1 === 0\n );\n};\n\n},{\"async.util.isarray\":5}],7:[function(require,module,exports){\n'use strict';\n\nvar _keys = require('async.util.keys');\nvar isArrayLike = require('async.util.isarraylike');\n\nmodule.exports = function keyIterator(coll) {\n var i = -1;\n var len;\n var keys;\n if (isArrayLike(coll)) {\n len = coll.length;\n return function next() {\n i++;\n return i < len ? i : null;\n };\n } else {\n keys = _keys(coll);\n len = keys.length;\n return function next() {\n i++;\n return i < len ? keys[i] : null;\n };\n }\n};\n\n},{\"async.util.isarraylike\":6,\"async.util.keys\":8}],8:[function(require,module,exports){\n'use strict';\n\nmodule.exports = Object.keys || function keys(obj) {\n var _keys = [];\n for (var k in obj) {\n if (obj.hasOwnProperty(k)) {\n _keys.push(k);\n }\n }\n return _keys;\n};\n\n},{}],9:[function(require,module,exports){\n'use strict';\n\nmodule.exports = function noop () {};\n\n},{}],10:[function(require,module,exports){\n'use strict';\n\nmodule.exports = function once(fn) {\n return function() {\n if (fn === null) return;\n fn.apply(this, arguments);\n fn = null;\n };\n};\n\n},{}],11:[function(require,module,exports){\n'use strict';\n\nmodule.exports = function only_once(fn) {\n return function() {\n if (fn === null) throw new Error('Callback was already called.');\n fn.apply(this, arguments);\n fn = null;\n };\n};\n\n},{}],12:[function(require,module,exports){\n'use strict';\nmodule.exports = function restParam(func, startIndex) {\n startIndex = startIndex == null ? func.length - 1 : +startIndex;\n return function() {\n var length = Math.max(arguments.length - startIndex, 0);\n var rest = new Array(length);\n for (var index = 0; index < length; index++) {\n rest[index] = arguments[index + startIndex];\n }\n switch (startIndex) {\n case 0:\n return func.call(this, rest);\n case 1:\n return func.call(this, arguments[0], rest);\n }\n };\n};\n\n},{}],13:[function(require,module,exports){\n(function (setImmediate){(function (){\n'use strict';\n\nvar _setImmediate = typeof setImmediate === 'function' && setImmediate;\nvar fallback = function(fn) {\n setTimeout(fn, 0);\n};\n\nmodule.exports = function setImmediate(fn) {\n // not a direct alias for IE10 compatibility\n return (_setImmediate || fallback)(fn);\n};\n\n}).call(this)}).call(this,require(\"timers\").setImmediate)\n\n},{\"timers\":70}],14:[function(require,module,exports){\n'use strict';\n\nmodule.exports = function withoutIndex(iterator) {\n return function(value, index, callback) {\n return iterator(value, callback);\n };\n};\n\n},{}],15:[function(require,module,exports){\n'use strict';\n\nvar once = require('async.util.once');\nvar noop = require('async.util.noop');\nvar isArray = require('async.util.isarray');\nvar restParam = require('async.util.restparam');\nvar ensureAsync = require('async.util.ensureasync');\nvar iterator = require('async.iterator');\n\nmodule.exports = function(tasks, cb) {\n cb = once(cb || noop);\n if (!isArray(tasks)) return cb(new Error('First argument to waterfall must be an array of functions'));\n if (!tasks.length) return cb();\n\n function wrapIterator(iterator) {\n return restParam(function(err, args) {\n if (err) {\n cb.apply(null, [err].concat(args));\n } else {\n var next = iterator.next();\n if (next) {\n args.push(wrapIterator(next));\n } else {\n args.push(cb);\n }\n ensureAsync(iterator).apply(null, args);\n }\n });\n }\n wrapIterator(iterator(tasks))();\n};\n\n},{\"async.iterator\":2,\"async.util.ensureasync\":4,\"async.util.isarray\":5,\"async.util.noop\":9,\"async.util.once\":10,\"async.util.restparam\":12}],16:[function(require,module,exports){\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(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\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\n},{}],17:[function(require,module,exports){\n\n},{}],18:[function(require,module,exports){\narguments[4][17][0].apply(exports,arguments)\n},{\"dup\":17}],19:[function(require,module,exports){\n(function (Buffer){(function (){\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <https://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')\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nvar K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Print warning and recommend using `buffer` v4.x which has an Object\n * 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 * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n typeof console.error === 'function') {\n console.error(\n 'This browser lacks typed array (Uint8Array) support which is required by ' +\n '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n )\n}\n\nfunction typedArraySupport () {\n // Can typed array instances can be augmented?\n try {\n var arr = new Uint8Array(1)\n arr.__proto__ = { __proto__: Uint8Array.prototype, foo: function () { return 42 } }\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.buffer\n }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.byteOffset\n }\n})\n\nfunction createBuffer (length) {\n if (length > K_MAX_LENGTH) {\n throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n }\n // Return an augmented `Uint8Array` instance\n var buf = new Uint8Array(length)\n buf.__proto__ = Buffer.prototype\n return buf\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 // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new TypeError(\n 'The \"string\" argument must be of type string. Received type number'\n )\n }\n return allocUnsafe(arg)\n }\n return from(arg, encodingOrOffset, length)\n}\n\n// Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\nif (typeof Symbol !== 'undefined' && Symbol.species != null &&\n Buffer[Symbol.species] === Buffer) {\n Object.defineProperty(Buffer, Symbol.species, {\n value: null,\n configurable: true,\n enumerable: false,\n writable: false\n })\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n if (typeof value === 'string') {\n return fromString(value, encodingOrOffset)\n }\n\n if (ArrayBuffer.isView(value)) {\n return fromArrayLike(value)\n }\n\n if (value == null) {\n throw TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n }\n\n if (isInstance(value, ArrayBuffer) ||\n (value && isInstance(value.buffer, ArrayBuffer))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof value === 'number') {\n throw new TypeError(\n 'The \"value\" argument must not be of type number. Received type number'\n )\n }\n\n var valueOf = value.valueOf && value.valueOf()\n if (valueOf != null && valueOf !== value) {\n return Buffer.from(valueOf, encodingOrOffset, length)\n }\n\n var b = fromObject(value)\n if (b) return b\n\n if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n typeof value[Symbol.toPrimitive] === 'function') {\n return Buffer.from(\n value[Symbol.toPrimitive]('string'), encodingOrOffset, length\n )\n }\n\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\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(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nBuffer.prototype.__proto__ = Uint8Array.prototype\nBuffer.__proto__ = Uint8Array\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be of type number')\n } else if (size < 0) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n}\n\nfunction alloc (size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(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(size).fill(fill, encoding)\n : createBuffer(size).fill(fill)\n }\n return createBuffer(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(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n assertSize(size)\n return createBuffer(size < 0 ? 0 : checked(size) | 0)\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(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(size)\n}\n\nfunction fromString (string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n var length = byteLength(string, encoding) | 0\n var buf = createBuffer(length)\n\n var actual = buf.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 buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (array) {\n var length = array.length < 0 ? 0 : checked(array.length) | 0\n var buf = createBuffer(length)\n for (var i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\"offset\" is outside of buffer bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\"length\" is outside of buffer bounds')\n }\n\n var buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n // Return an augmented `Uint8Array` instance\n buf.__proto__ = Buffer.prototype\n return buf\n}\n\nfunction fromObject (obj) {\n if (Buffer.isBuffer(obj)) {\n var len = checked(obj.length) | 0\n var buf = createBuffer(len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj.length !== undefined) {\n if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n return createBuffer(0)\n }\n return fromArrayLike(obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(obj.data)\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.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 === true &&\n b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError(\n 'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n )\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 (!Array.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 (isInstance(buf, Uint8Array)) {\n buf = Buffer.from(buf)\n }\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 (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n throw new TypeError(\n 'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n 'Received type ' + typeof string\n )\n }\n\n var len = string.length\n var mustMatch = (arguments.length > 2 && arguments[2] === true)\n if (!mustMatch && 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 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) {\n return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n }\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// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\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\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.toLocaleString = Buffer.prototype.toString\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 str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n if (this.length > max) str += ' ... '\n return '<Buffer ' + str + '>'\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (isInstance(target, Uint8Array)) {\n target = Buffer.from(target, target.offset, target.byteLength)\n }\n if (!Buffer.isBuffer(target)) {\n throw new TypeError(\n 'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n 'Received type ' + (typeof target)\n )\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 (numberIsNaN(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 (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 var strLen = string.length\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 (numberIsNaN(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 } 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 = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n newBuf.__proto__ = Buffer.prototype\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 offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 this[offset] = (value & 0xff)\n return offset + 1\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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\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 this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\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 this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\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 this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\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 (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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\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 this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\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 this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\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 value = +value\n offset = offset >>> 0\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 value = +value\n offset = offset >>> 0\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 (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\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('Index out of range')\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\n if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n // Use built-in when available, missing from IE11\n this.copyWithin(targetStart, start, end)\n } else if (this === target && start < targetStart && targetStart < end) {\n // descending copy from end\n for (var i = len - 1; i >= 0; --i) {\n target[i + targetStart] = this[i + start]\n }\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, end),\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 (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 if (val.length === 1) {\n var code = val.charCodeAt(0)\n if ((encoding === 'utf8' && code < 128) ||\n encoding === 'latin1') {\n // Fast path: If `val` fits into a single byte, use that numeric value.\n val = code\n }\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 : Buffer.from(val, encoding)\n var len = bytes.length\n if (len === 0) {\n throw new TypeError('The value \"' + val +\n '\" is invalid for argument \"value\"')\n }\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 takes equal signs as end of the Base64 encoding\n str = str.split('=')[0]\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = str.trim().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 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\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n return obj instanceof type ||\n (obj != null && obj.constructor != null && obj.constructor.name != null &&\n obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n // For IE11 support\n return obj !== obj // eslint-disable-line no-self-compare\n}\n\n}).call(this)}).call(this,require(\"buffer\").Buffer)\n\n},{\"base64-js\":16,\"buffer\":19,\"ieee754\":35}],20:[function(require,module,exports){\nmodule.exports = {\n \"100\": \"Continue\",\n \"101\": \"Switching Protocols\",\n \"102\": \"Processing\",\n \"200\": \"OK\",\n \"201\": \"Created\",\n \"202\": \"Accepted\",\n \"203\": \"Non-Authoritative Information\",\n \"204\": \"No Content\",\n \"205\": \"Reset Content\",\n \"206\": \"Partial Content\",\n \"207\": \"Multi-Status\",\n \"208\": \"Already Reported\",\n \"226\": \"IM Used\",\n \"300\": \"Multiple Choices\",\n \"301\": \"Moved Permanently\",\n \"302\": \"Found\",\n \"303\": \"See Other\",\n \"304\": \"Not Modified\",\n \"305\": \"Use Proxy\",\n \"307\": \"Temporary Redirect\",\n \"308\": \"Permanent Redirect\",\n \"400\": \"Bad Request\",\n \"401\": \"Unauthorized\",\n \"402\": \"Payment Required\",\n \"403\": \"Forbidden\",\n \"404\": \"Not Found\",\n \"405\": \"Method Not Allowed\",\n \"406\": \"Not Acceptable\",\n \"407\": \"Proxy Authentication Required\",\n \"408\": \"Request Timeout\",\n \"409\": \"Conflict\",\n \"410\": \"Gone\",\n \"411\": \"Length Required\",\n \"412\": \"Precondition Failed\",\n \"413\": \"Payload Too Large\",\n \"414\": \"URI Too Long\",\n \"415\": \"Unsupported Media Type\",\n \"416\": \"Range Not Satisfiable\",\n \"417\": \"Expectation Failed\",\n \"418\": \"I'm a teapot\",\n \"421\": \"Misdirected Request\",\n \"422\": \"Unprocessable Entity\",\n \"423\": \"Locked\",\n \"424\": \"Failed Dependency\",\n \"425\": \"Unordered Collection\",\n \"426\": \"Upgrade Required\",\n \"428\": \"Precondition Required\",\n \"429\": \"Too Many Requests\",\n \"431\": \"Request Header Fields Too Large\",\n \"451\": \"Unavailable For Legal Reasons\",\n \"500\": \"Internal Server Error\",\n \"501\": \"Not Implemented\",\n \"502\": \"Bad Gateway\",\n \"503\": \"Service Unavailable\",\n \"504\": \"Gateway Timeout\",\n \"505\": \"HTTP Version Not Supported\",\n \"506\": \"Variant Also Negotiates\",\n \"507\": \"Insufficient Storage\",\n \"508\": \"Loop Detected\",\n \"509\": \"Bandwidth Limit Exceeded\",\n \"510\": \"Not Extended\",\n \"511\": \"Network Authentication Required\"\n}\n\n},{}],21:[function(require,module,exports){\n/**\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\n/**\n* Data Arithmatic\n*\n* @class DataArithmatic\n*/\nclass DataArithmatic\n{\n\tconstructor()\n\t{\n\t\t// Regular Expressions (so they don't have to be recompiled every time)\n\t\t// These could be defined as static, but I'm not sure if that will work with browserify ... and specifically the QT browser.\n\t\tthis._Regex_formatterInsertCommas = /.{1,3}/g;\n\t\t// Match Function:\n\t\t// function(pMatch, pSign, pZeros, pBefore, pDecimal, pAfter)\n\t\t// Thoughts about below: /^([+-]?)(0*)(\\d+)(\\.(\\d+))?$/;\n\t\tthis._Regex_formatterAddCommasToNumber = /^([-+]?)(0?)(\\d+)(.?)(\\d+)$/g;\n\t\tthis._Regex_formatterDollarsRemoveCommas = /,/gi;\n\t\tthis._Regex_formatterCleanNonAlpha = /[^a-z0-9]/gi;\n\n\t\t// TODO: Potentially pull these in from a configuration.\n\t\t// TODO: Use locale data for this if it's defaults all the way down.\n\t\tthis._Value_MoneySign_Currency = '$';\n\t\tthis._Value_NaN_Currency = '--';\n\t\tthis._Value_GroupSeparator_Number = ',';\n\n\t\tthis._Value_Prefix_StringHash = 'HSH';\n\t\tthis._Value_Clean_formatterCleanNonAlpha = '_';\n\n\t\tthis._UseEngineStringStartsWith = (typeof(String.prototype.startsWith) === 'function');\n\t\tthis._UseEngineStringEndsWith = (typeof(String.prototype.endsWith) === 'function');\n\t}\n\n\n\t/*************************************************************************\n\t * String Manipulation and Comparison Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Reverse a string\n\t *\n\t * @param {string} pString - The string to reverse\n\t * @returns {string}\n\t */\n\tstringReverse (pString)\n\t{\n\t\t// TODO: Benchmark if there are faster ways we want to do this with all the newer JS stuff\n\t\t// ... and if it will work with browserify in a clean way.\n\t return pString.split('').reverse().join('');\n\t}\n\n\t/**\n\t * Test if a string starts with a given substring.\n\t *\n\t * @param {*} pString\n\t * @param {*} pSearchString\n\t * @param {*} pStartIndex\n\t * @returns {*}\n\t */\n\tstringStartsWith (pString, pSearchString, pStartIndex)\n\t{\n\t\tif (this._UseEngineStringStartsWith)\n\t\t{\n\t\t\treturn pString.startsWith(pSearchString, pStartIndex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.stringStartsWith_Polyfill.call(pString, pSearchString, pStartIndex);\n\t\t}\n\t}\n\n\t/**\n\t * Check if a string starts with a given substring. This is a safe polyfill for the ES6 string.startsWith() function.\n\t *\n\t * @param {*} pSearchString - The string to search for\n\t * @param {*} pStartIndex - The index to start the search at\n\t * @returns {boolean}\n\t */\n\tstringStartsWith_Polyfill (pSearchString, pStartIndex)\n\t{\n\t\treturn this.slice(pStartIndex || 0, pSearchString.length) === pSearchString;\n\t}\n\n\t/**\n\t * Test if a string starts with a given substring.\n\t *\n\t * @param {*} pString\n\t * @param {*} pSearchString\n\t * @param {*} pEndIndex\n\t * @returns {*}\n\t */\n\tstringEndsWith (pString, pSearchString, pEndIndex)\n\t{\n\t\tif (this._UseEngineStringEndsWith)\n\t\t{\n\t\t\treturn pString.endsWith(pSearchString, pEndIndex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.stringEndsWith_Polyfill.call(pString, pSearchString, pEndIndex);\n\t\t}\n\t}\n\n\t/**\n\t * Check if a string starts with a given substring. This is a safe polyfill for the ES6 string.startsWith() function.\n\t *\n\t * @param {*} pSearchString - The string to search for\n\t * @param {*} pEndIndex - The index to end the search at\n\t * @returns {boolean}\n\t */\n\tstringEndsWith_Polyfill (pSearchString, pEndIndex)\n\t{\n\t\t// This works much better than >= because\n\t\t// it compensates for NaN:\n\t\tif (!(pEndIndex < this.length))\n\t\t{\n\t\t\tpEndIndex = this.length;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpEndIndex |= 0; // round position\n\t\t}\n\t\treturn this.substr(pEndIndex - pSearchString.length, pSearchString.length) === pSearchString;\n\t}\n\n\t/**\n\t * Generate an insecure string hash. Not meant to be secure, just a quick way to generate a hash for a string. This is not a cryptographic hash. Additional warranty and disclaimer ... this is not for passwords!\n\t *\n\t * @param {string} pString\n\t * @returns {string}\n\t */\n\tinsecureStringHash (pString)\n\t{\n\t let tmpHash = 0;\n\t let tmpStringLength = pString.length;\n\t let tmpCharacterIndex = 0;\n\n\t while (tmpCharacterIndex < tmpStringLength)\n\t {\n\t tmpHash = (tmpHash << 5) - tmpHash + pString.charCodeAt(tmpCharacterIndex++) | 0;\n\t }\n\n\t return `${this._Value_Prefix_StringHash}${tmpHash}`;\n\t}\n\n\t/**\n\t * Clean wrapping characters if they exist consistently around the string. If they do not, the string is returned unchanged.\n\t *\n\t * @param {string} pWrapCharacter - The character expected as the wrapping character\n\t * @param {string} pString - the string to clean\n\t * @returns {string}\n\t */\n\tcleanEnclosureWrapCharacters (pWrapCharacter, pString)\n\t{\n\t\t// # Use case from ManyFest DSL:\n\t\t//\n\t\t// When a boxed property is passed in, it should have quotes of some\n\t\t// kind around it.\n\t\t//\n\t\t// For instance:\n\t\t// \t\tMyValues['Name']\n\t\t// \t\tMyValues[\"Age\"]\n\t\t// \t\tMyValues[`Cost`]\n\t\t//\n\t\t// This function is necessary to remove the wrapping quotes before object\n\t\t// resolution can occur.\n\t\tif (pString.startsWith(pWrapCharacter) && pString.endsWith(pWrapCharacter))\n\t\t{\n\t\t\treturn pString.substring(1, pString.length - 1);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn pString;\n\t\t}\n\t}\n\n\t/**\n\t *\n\t * @param {*} pString\n\t * @returns\n\t */\n\tcleanNonAlphaCharacters (pString)\n\t{\n\t if ((typeof(pString) == 'string') && (pString != ''))\n\t {\n\t return pString.replace(this._Regex_formatterCleanNonAlpha, this._Value_Clean_formatterCleanNonAlpha);\n\t }\n\t}\n\n\n\t/*************************************************************************\n\t * Number Formatting Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Insert commas every 3 characters from the right. Used by formatterAddCommasToNumber().\n\t *\n\t * @param {*} pString\n\t * @returns {*}\n\t */\n\tformatterInsertCommas (pString)\n\t{\n\t // Reverse, because it's easier to do things from the left, given arbitrary digit counts\n\t let tmpReversed = this.stringReverse(pString);\n\t // Add commas every three characters\n\t let tmpReversedWithCommas = tmpReversed.match(this._Regex_formatterInsertCommas).join(',');\n\t // Reverse again (back to normal direction)\n\t return this.stringReverse(tmpReversedWithCommas);\n\t}\n\n\tprocessAddCommasToNumberRegex(pMatch, pSign, pZeros, pBefore, pDecimal, pAfter)\n\t{\n\t\t// If there was no decimal, the last capture grabs the final digit, so\n\t\t// we have to put it back together with the 'before' substring\n\t\treturn pSign + (pDecimal ? this.formatterInsertCommas(pBefore) + pDecimal + pAfter : this.formatterInsertCommas(pBefore + pAfter));\n\t}\n\n\t/**\n\t * Add Commas to a Number for readability.\n\t *\n\t * @param {*} pNumber\n\t * @returns {string}\n\t */\n\tformatterAddCommasToNumber (pNumber)\n\t{\n\t // If the regex doesn't match, `replace` returns the string unmodified\n\t return (pNumber.toString()).replace\n\t (\n\t\t\tthis._Regex_formatterAddCommasToNumber,\n\t this.processAddCommasToNumberRegex.bind(this)\n\t );\n\t}\n\n\t/**\n\t * This will take a number and format it as a dollar string. It will also add commas to the number. If the number is not a number, it will return '--'.\n\t *\n\t * @param {*} pValue\n\t * @returns {string}\n\t */\n\tformatterDollars (pValue)\n\t{\n\t let tmpDollarAmount = parseFloat(pValue).toFixed(2);\n\n\t if (isNaN(tmpDollarAmount))\n\t {\n\t // Try again and see if what was passed in was a dollars string.\n\t if (typeof(pValue) == 'string')\n\t {\n\t\t\t\t// TODO: Better rounding function? This is a hack to get rid of the currency symbol and commas.\n\t tmpDollarAmount = parseFloat(pValue.replace(this._Value_MoneySign_Currency,'').replace(this._Regex_formatterDollarsRemoveCommas,'')).toFixed(2);\n\t }\n\t\t\t// If we didn't get a number, return the \"not a number\" string.\n\t if (isNaN(tmpDollarAmount))\n\t {\n\t return this._Value_NaN_Currency;\n\t }\n\t }\n\n\t // TODO: Get locale data and use that for this stuff.\n\t return `$${this.formatterAddCommasToNumber(tmpDollarAmount)}`;\n\t}\n\n\t/**\n\t * Round a number to a certain number of digits. If the number is not a number, it will return 0. If no digits are specified, it will default to 2 significant digits.\n\t *\n\t * @param {*} pValue\n\t * @param {number} pDigits\n\t * @returns {string}\n\t */\n\tformatterRoundNumber (pValue, pDigits)\n\t{\n\t let tmpDigits = (typeof(pDigits) == 'undefined') ? 2 : pDigits;\n\n\t let tmpValue = parseFloat(pValue).toFixed(tmpDigits);\n\t if (isNaN(tmpValue))\n\t {\n\t let tmpZed = 0;\n\t return tmpZed.toFixed(tmpDigits);\n\t }\n\t else\n\t {\n\t return tmpValue;\n\t }\n\t}\n\n\n\t/*************************************************************************\n\t * String Tokenization Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Return the string before the matched substring.\n\t *\n\t * If the substring is not found, the entire string is returned. This only deals with the *first* match.\n\t *\n\t * @param {string} pString\n\t * @param {string} pMatch\n\t * @returns {string}\n\t */\n\tstringBeforeMatch (pString, pMatch)\n\t{\n\t\treturn pString.split(pMatch)[0];\n\t}\n\n\t/**\n\t * Return the string after the matched substring.\n\t *\n\t * If the substring is not found, an empty string is returned. This only deals with the *first* match.\n\t *\n\t * @param {string} pString\n\t * @param {string} pMatch\n\t * @returns {string}\n\t */\n\tstringAfterMatch (pString, pMatch)\n\t{\n\t let tmpStringSplitLocation = pString.indexOf(pMatch);\n\n\t\tif ((tmpStringSplitLocation < 0) || ((tmpStringSplitLocation + pMatch.length) >= pString.length))\n\t {\n\t return '';\n\t }\n\n\t return pString.substring(tmpStringSplitLocation + pMatch.length);\n\t}\n\n\t/**\n\t * Count the number of enclosures in a string based on the start and end characters.\n\t *\n\t * If no start or end characters are specified, it will default to parentheses. If the string is not a string, it will return 0.\n\t *\n\t * @param {string} pString\n\t * @param {string} pEnclosureStart\n\t * @param {string} pEnclosureEnd\n\t * @returns the count of full in the string\n\t */\n\tstringCountEnclosures (pString, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t if (tmpEnclosureDepth == 0)\n\t {\n\t tmpEnclosureCount++;\n\t }\n\t tmpEnclosureDepth++;\n\t }\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\t }\n\t }\n\n\t return tmpEnclosureCount;\n\t}\n\n\n\t/**\n\t * Get the value of the enclosure at the specified index.\n\t *\n\t * If the index is not a number, it will default to 0. If the string is not a string, it will return an empty string. If the enclosure is not found, it will return an empty string. If the enclosure\n\t *\n\t * @param {string} pString\n\t * @param {number} pEnclosureIndexToGet\n\t * @param {string} pEnclosureStart\n\t * @param {string}} pEnclosureEnd\n\t * @returns {string}\n\t */\n\tstringGetEnclosureValueByIndex (pString, pEnclosureIndexToGet, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureIndexToGet = (typeof(pEnclosureIndexToGet) == 'number') ? pEnclosureIndexToGet : 0;\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t let tmpEnclosedValueStartIndex = 0;\n\t let tmpEnclosedValueEndIndex = 0;\n\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t tmpEnclosureDepth++;\n\n\t\t\t\t// Only count enclosures at depth 1, but still this parses both pairs of all of them.\n\t\t\t\tif (tmpEnclosureDepth == 1)\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureCount++;\n\t\t\t\t\tif (tmpEnclosureIndexToGet == (tmpEnclosureCount - 1))\n\t\t\t\t\t{\n\t\t\t\t\t\t// This is the start of *the* enclosure\n\t\t\t\t\t\ttmpMatchedEnclosureIndex = true;\n\t\t\t\t\t\ttmpEnclosedValueStartIndex = i;\n\t\t\t\t\t}\n\t\t\t\t}\n\t }\n\t\t\t// This is the end of an enclosure\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\n\t\t\t\t// Again, only count enclosures at depth 1, but still this parses both pairs of all of them.\n\t\t\t\tif ((tmpEnclosureDepth == 0) &&\n\t\t\t\t\ttmpMatchedEnclosureIndex &&\n\t\t\t\t\t(tmpEnclosedValueEndIndex <= tmpEnclosedValueStartIndex))\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosedValueEndIndex = i;\n\t\t\t\t\ttmpMatchedEnclosureIndex = false;\n\t\t\t\t}\n\t }\n\t }\n\n\t if (tmpEnclosureCount <= tmpEnclosureIndexToGet)\n\t {\n\t\t\t// Return an empty string if the enclosure is not found\n\t return '';\n\t }\n\n\t if ((tmpEnclosedValueEndIndex > 0) && (tmpEnclosedValueEndIndex > tmpEnclosedValueStartIndex))\n\t {\n\t return tmpString.substring(tmpEnclosedValueStartIndex+1, tmpEnclosedValueEndIndex);\n\t }\n\t else\n\t {\n\t return tmpString.substring(tmpEnclosedValueStartIndex+1);\n\t }\n\t}\n\n\n\t/**\n\t * Remove an enclosure from a string based on the index of the enclosure.\n\t *\n\t * @param {string} pString\n\t * @param {number} pEnclosureIndexToRemove\n\t * @param {number} pEnclosureStart\n\t * @param {number} pEnclosureEnd\n\t * @returns {string}\n\t */\n\tstringRemoveEnclosureByIndex (pString, pEnclosureIndexToRemove, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureIndexToRemove = (typeof(pEnclosureIndexToRemove) == 'number') ? pEnclosureIndexToRemove : 0;\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t let tmpEnclosureStartIndex = 0;\n\t let tmpEnclosureEndIndex = 0;\n\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t tmpEnclosureDepth++;\n\n\t if (tmpEnclosureDepth == 1)\n\t {\n\t tmpEnclosureCount++;\n\t\t\t\t\tif (tmpEnclosureIndexToRemove == (tmpEnclosureCount - 1))\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpMatchedEnclosureIndex = true;\n\t\t\t\t\t\ttmpEnclosureStartIndex = i;\n\t\t\t\t\t}\n\t }\n\t }\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\n\t\t\t\tif ((tmpEnclosureDepth == 0) &&\n\t\t\t\t\ttmpMatchedEnclosureIndex &&\n\t\t\t\t\t(tmpEnclosureEndIndex <= tmpEnclosureStartIndex))\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureEndIndex = i;\n\t\t\t\t\ttmpMatchedEnclosureIndex = false;\n\t\t\t\t}\n\t }\n\t }\n\n\t if (tmpEnclosureCount <= tmpEnclosureIndexToRemove)\n\t {\n\t return tmpString;\n\t }\n\n\t let tmpReturnString = '';\n\n\t if (tmpEnclosureStartIndex > 1)\n\t {\n\t tmpReturnString = tmpString.substring(0, tmpEnclosureStartIndex);\n\t }\n\n\t if ((tmpString.length > (tmpEnclosureEndIndex + 1)) && (tmpEnclosureEndIndex > tmpEnclosureStartIndex))\n\t {\n\t tmpReturnString += tmpString.substring(tmpEnclosureEndIndex+1);\n\t }\n\n\t return tmpReturnString;\n\t}\n}\n\nmodule.exports = DataArithmatic;\n},{}],22:[function(require,module,exports){\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\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n ? R.apply\n : function ReflectApply(target, receiver, args) {\n return Function.prototype.apply.call(target, receiver, args);\n }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n ReflectOwnKeys = function ReflectOwnKeys(target) {\n return Object.getOwnPropertyNames(target)\n .concat(Object.getOwnPropertySymbols(target));\n };\n} else {\n ReflectOwnKeys = function ReflectOwnKeys(target) {\n return Object.getOwnPropertyNames(target);\n };\n}\n\nfunction ProcessEmitWarning(warning) {\n if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n return value !== value;\n}\n\nfunction EventEmitter() {\n EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n if (typeof listener !== 'function') {\n throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n enumerable: true,\n get: function() {\n return defaultMaxListeners;\n },\n set: function(arg) {\n if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n }\n defaultMaxListeners = arg;\n }\n});\n\nEventEmitter.init = function() {\n\n if (this._events === undefined ||\n this._events === Object.getPrototypeOf(this)._events) {\n this._events = Object.create(null);\n this._eventsCount = 0;\n }\n\n this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n }\n this._maxListeners = n;\n return this;\n};\n\nfunction _getMaxListeners(that) {\n if (that._maxListeners === undefined)\n return EventEmitter.defaultMaxListeners;\n return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n var args = [];\n for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n var doError = (type === 'error');\n\n var events = this._events;\n if (events !== undefined)\n doError = (doError && events.error === undefined);\n else if (!doError)\n return false;\n\n // If there is no 'error' event listener then throw.\n if (doError) {\n var er;\n if (args.length > 0)\n er = args[0];\n if (er instanceof Error) {\n // Note: The comments on the `throw` lines are intentional, they show\n // up in Node's output if this results in an unhandled exception.\n throw er; // Unhandled 'error' event\n }\n // At least give some kind of context to the user\n var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n err.context = er;\n throw err; // Unhandled 'error' event\n }\n\n var handler = events[type];\n\n if (handler === undefined)\n return false;\n\n if (typeof handler === 'function') {\n ReflectApply(handler, this, args);\n } else {\n var len = handler.length;\n var listeners = arrayClone(handler, len);\n for (var i = 0; i < len; ++i)\n ReflectApply(listeners[i], this, args);\n }\n\n return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n var m;\n var events;\n var existing;\n\n checkListener(listener);\n\n events = target._events;\n if (events === undefined) {\n events = target._events = Object.create(null);\n target._eventsCount = 0;\n } else {\n // To avoid recursion in the case that type === \"newListener\"! Before\n // adding it to the listeners, first emit \"newListener\".\n if (events.newListener !== undefined) {\n target.emit('newListener', type,\n listener.listener ? listener.listener : listener);\n\n // Re-assign `events` because a newListener handler could have caused the\n // this._events to be assigned to a new object\n events = target._events;\n }\n existing = events[type];\n }\n\n if (existing === undefined) {\n // Optimize the case of one listener. Don't need the extra array object.\n existing = events[type] = listener;\n ++target._eventsCount;\n } else {\n if (typeof existing === 'function') {\n // Adding the second element, need to change to array.\n existing = events[type] =\n prepend ? [listener, existing] : [existing, listener];\n // If we've already got an array, just append.\n } else if (prepend) {\n existing.unshift(listener);\n } else {\n existing.push(listener);\n }\n\n // Check for listener leak\n m = _getMaxListeners(target);\n if (m > 0 && existing.length > m && !existing.warned) {\n existing.warned = true;\n // No error code for this since it is a Warning\n // eslint-disable-next-line no-restricted-syntax\n var w = new Error('Possible EventEmitter memory leak detected. ' +\n existing.length + ' ' + String(type) + ' listeners ' +\n 'added. Use emitter.setMaxListeners() to ' +\n 'increase limit');\n w.name = 'MaxListenersExceededWarning';\n w.emitter = target;\n w.type = type;\n w.count = existing.length;\n ProcessEmitWarning(w);\n }\n }\n\n return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n function prependListener(type, listener) {\n return _addListener(this, type, listener, true);\n };\n\nfunction onceWrapper() {\n if (!this.fired) {\n this.target.removeListener(this.type, this.wrapFn);\n this.fired = true;\n if (arguments.length === 0)\n return this.listener.call(this.target);\n return this.listener.apply(this.target, arguments);\n }\n}\n\nfunction _onceWrap(target, type, listener) {\n var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n var wrapped = onceWrapper.bind(state);\n wrapped.listener = listener;\n state.wrapFn = wrapped;\n return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n checkListener(listener);\n this.on(type, _onceWrap(this, type, listener));\n return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n function prependOnceListener(type, listener) {\n checkListener(listener);\n this.prependListener(type, _onceWrap(this, type, listener));\n return this;\n };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n function removeListener(type, listener) {\n var list, events, position, i, originalListener;\n\n checkListener(listener);\n\n events = this._events;\n if (events === undefined)\n return this;\n\n list = events[type];\n if (list === undefined)\n return this;\n\n if (list === listener || list.listener === listener) {\n if (--this._eventsCount === 0)\n this._events = Object.create(null);\n else {\n delete events[type];\n if (events.removeListener)\n this.emit('removeListener', type, list.listener || listener);\n }\n } else if (typeof list !== 'function') {\n position = -1;\n\n for (i = list.length - 1; i >= 0; i--) {\n if (list[i] === listener || list[i].listener === listener) {\n originalListener = list[i].listener;\n position = i;\n break;\n }\n }\n\n if (position < 0)\n return this;\n\n if (position === 0)\n list.shift();\n else {\n spliceOne(list, position);\n }\n\n if (list.length === 1)\n events[type] = list[0];\n\n if (events.removeListener !== undefined)\n this.emit('removeListener', type, originalListener || listener);\n }\n\n return this;\n };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n function removeAllListeners(type) {\n var listeners, events, i;\n\n events = this._events;\n if (events === undefined)\n return this;\n\n // not listening for removeListener, no need to emit\n if (events.removeListener === undefined) {\n if (arguments.length === 0) {\n this._events = Object.create(null);\n this._eventsCount = 0;\n } else if (events[type] !== undefined) {\n if (--this._eventsCount === 0)\n this._events = Object.create(null);\n else\n delete events[type];\n }\n return this;\n }\n\n // emit removeListener for all listeners on all events\n if (arguments.length === 0) {\n var keys = Object.keys(events);\n var key;\n for (i = 0; i < keys.length; ++i) {\n key = keys[i];\n if (key === 'removeListener') continue;\n this.removeAllListeners(key);\n }\n this.removeAllListeners('removeListener');\n this._events = Object.create(null);\n this._eventsCount = 0;\n return this;\n }\n\n listeners = events[type];\n\n if (typeof listeners === 'function') {\n this.removeListener(type, listeners);\n } else if (listeners !== undefined) {\n // LIFO order\n for (i = listeners.length - 1; i >= 0; i--) {\n this.removeListener(type, listeners[i]);\n }\n }\n\n return this;\n };\n\nfunction _listeners(target, type, unwrap) {\n var events = target._events;\n\n if (events === undefined)\n return [];\n\n var evlistener = events[type];\n if (evlistener === undefined)\n return [];\n\n if (typeof evlistener === 'function')\n return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n return unwrap ?\n unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n if (typeof emitter.listenerCount === 'function') {\n return emitter.listenerCount(type);\n } else {\n return listenerCount.call(emitter, type);\n }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n var events = this._events;\n\n if (events !== undefined) {\n var evlistener = events[type];\n\n if (typeof evlistener === 'function') {\n return 1;\n } else if (evlistener !== undefined) {\n return evlistener.length;\n }\n }\n\n return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n var copy = new Array(n);\n for (var i = 0; i < n; ++i)\n copy[i] = arr[i];\n return copy;\n}\n\nfunction spliceOne(list, index) {\n for (; index + 1 < list.length; index++)\n list[index] = list[index + 1];\n list.pop();\n}\n\nfunction unwrapListeners(arr) {\n var ret = new Array(arr.length);\n for (var i = 0; i < ret.length; ++i) {\n ret[i] = arr[i].listener || arr[i];\n }\n return ret;\n}\n\nfunction once(emitter, name) {\n return new Promise(function (resolve, reject) {\n function errorListener(err) {\n emitter.removeListener(name, resolver);\n reject(err);\n }\n\n function resolver() {\n if (typeof emitter.removeListener === 'function') {\n emitter.removeListener('error', errorListener);\n }\n resolve([].slice.call(arguments));\n };\n\n eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n if (name !== 'error') {\n addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n }\n });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n if (typeof emitter.on === 'function') {\n eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n if (typeof emitter.on === 'function') {\n if (flags.once) {\n emitter.once(name, listener);\n } else {\n emitter.on(name, listener);\n }\n } else if (typeof emitter.addEventListener === 'function') {\n // EventTarget does not have `error` event semantics like Node\n // EventEmitters, we do not listen for `error` events here.\n emitter.addEventListener(name, function wrapListener(arg) {\n // IE does not have builtin `{ once: true }` support so we\n // have to do it manually.\n if (flags.once) {\n emitter.removeEventListener(name, wrapListener);\n }\n listener(arg);\n });\n } else {\n throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n }\n}\n\n},{}],23:[function(require,module,exports){\n/**\n* Base Logger Class\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\nclass BaseLogger\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\t// This should not possibly be able to be instantiated without a settings object\n\t\tthis._Settings = (typeof(pLogStreamSettings) == 'object') ? pLogStreamSettings : {};\n\n\t\t// The base logger does nothing but associate a UUID with itself\n\t\t// We added this as the mechanism for tracking loggers to allow multiple simultaneous streams\n\t\t// to the same provider.\n\t\tthis.loggerUUID = this.generateInsecureUUID();\n\n\t\t// Eventually we can use this array to ompute which levels the provider allows.\n\t\t// For now it's just used to precompute some string concatenations.\n\t\tthis.levels = (\n\t\t\t[\n\t\t\t\t\"trace\",\n\t\t\t\t\"debug\",\n\t\t\t\t\"info\",\n\t\t\t\t\"warn\",\n\t\t\t\t\"error\",\n\t\t\t\t\"fatal\"\n\t\t\t]);\n\t}\n\n\t// This is meant to generate programmatically insecure UUIDs to identify loggers\n\tgenerateInsecureUUID()\n\t{\n\t\tlet tmpDate = new Date().getTime();\n\t\tlet tmpUUID = 'LOGSTREAM-xxxxxx-yxxxxx'.replace(/[xy]/g,\n\t\t\t\t(pCharacter) =>\n\t\t\t\t{\n\t\t\t\t\t// Funny algorithm from w3resource that is twister-ish without the deep math and security\n\t\t\t\t\t// ..but good enough for unique log stream identifiers\n\t\t\t\t\tlet tmpRandomData = (tmpDate + Math.random()*16)%16 | 0;\n\t\t\t\t\ttmpDate = Math.floor(tmpDate/16);\n\n\t\t\t\t\treturn (pCharacter =='x' ? tmpRandomData : (tmpRandomData&0x3|0x8)).toString(16);\n\t\t\t\t});\n\t\treturn tmpUUID;\n\t}\n\n\tinitialize()\n\t{\n\t\t// No operation.\n\t}\n\n\ttrace(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"trace\", pLogText, pLogObject);\n\t}\n\n\tdebug(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"debug\", pLogText, pLogObject);\n\t}\n\n\tinfo(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"info\", pLogText, pLogObject);\n\t}\n\n\twarn(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"warn\", pLogText, pLogObject);\n\t}\n\n\terror(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"error\", pLogText, pLogObject);\n\t}\n\n\tfatal(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"fatal\", pLogText, pLogObject);\n\t}\n\n\twrite(pLogLevel, pLogText, pLogObject)\n\t{\n\t\t// The base logger does nothing.\n\t\treturn true;\n\t}\n}\n\nmodule.exports = BaseLogger;\n\n},{}],24:[function(require,module,exports){\n/**\n* Default Logger Provider Function\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\n// Return the providers that are available without extensions loaded\nvar getDefaultProviders = () =>\n{\n\tlet tmpDefaultProviders = {};\n\n\ttmpDefaultProviders.console = require('./Fable-Log-Logger-Console.js');\n\n\ttmpDefaultProviders.default = tmpDefaultProviders.console;\n\n\treturn tmpDefaultProviders;\n}\n\nmodule.exports = getDefaultProviders();\n},{\"./Fable-Log-Logger-Console.js\":26}],25:[function(require,module,exports){\nmodule.exports=[\n {\n \"loggertype\": \"console\",\n \"streamtype\": \"console\",\n \"level\": \"trace\"\n }\n]\n},{}],26:[function(require,module,exports){\nlet libBaseLogger = require('./Fable-Log-BaseLogger.js');\n\nclass ConsoleLogger extends libBaseLogger\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\tsuper(pLogStreamSettings);\n\n\t\tthis._ShowTimeStamps = this._Settings.hasOwnProperty('showtimestamps') ? (this._Settings.showtimestamps == true) : true;\n\t\tthis._FormattedTimeStamps = this._Settings.hasOwnProperty('formattedtimestamps') ? (this._Settings.formattedtimestamps == true) : true;\n\n\t\tthis._ContextMessage = this._Settings.hasOwnProperty('Context') ? `(${this._Settings.Context})` : \n\t\t\t\t\t\t\t\tpFableLog._Settings.hasOwnProperty('Product') ? `(${pFableLog._Settings.Product})` :\n\t\t\t\t\t\t\t\t'Unnamed_Log_Context';\n\n\t\t// Allow the user to decide what gets output to the console\n\t\tthis._OutputLogLinesToConsole = this._Settings.hasOwnProperty('outputloglinestoconsole') ? this._Settings.outputloglinestoconsole : true;\n\t\tthis._OutputObjectsToConsole = this._Settings.hasOwnProperty('outputobjectstoconsole') ? this._Settings.outputobjectstoconsole : true;\n\n\t\t// Precompute the prefix for each level\n\t\tthis.prefixCache = {};\n\t\tfor (let i = 0; i <= this.levels.length; i++)\n\t\t{\n\t\t\tthis.prefixCache[this.levels[i]] = `[${this.levels[i]}] ${this._ContextMessage}: `;\n\n\t\t\tif (this._ShowTimeStamps)\n\t\t\t{\n\t\t\t\t// If there is a timestamp we need a to prepend space before the prefixcache string, since the timestamp comes first\n\t\t\t\tthis.prefixCache[this.levels[i]] = ' '+this.prefixCache[this.levels[i]];\n\t\t\t}\n\t\t}\n\t}\n\n\twrite(pLevel, pLogText, pObject)\n\t{\n\t\tlet tmpTimeStamp = '';\n\t\tif (this._ShowTimeStamps && this._FormattedTimeStamps)\n\t\t{\n\t\t\ttmpTimeStamp = (new Date()).toISOString();\n\t\t}\n\t\telse if (this._ShowTimeStamps)\n\t\t{\n\t\t\ttmpTimeStamp = +new Date();\n\t\t}\n\n\t\tlet tmpLogLine = `${tmpTimeStamp}${this.prefixCache[pLevel]}${pLogText}`;\n\n\t\tif (this._OutputLogLinesToConsole)\n\t\t{\n\t\t\tconsole.log(tmpLogLine);\n\t\t}\n\n\t\t// Write out the object on a separate line if it is passed in\n\t\tif (this._OutputObjectsToConsole && (typeof(pObject) !== 'undefined'))\n\t\t{\n\t\t\tconsole.log(JSON.stringify(pObject, null, 2));\n\t\t}\n\n\t\t// Provide an easy way to be overridden and be consistent\n\t\treturn tmpLogLine;\n\t}\n}\n\nmodule.exports = ConsoleLogger;\n},{\"./Fable-Log-BaseLogger.js\":23}],27:[function(require,module,exports){\nconst libConsoleLog = require('./Fable-Log-Logger-Console.js');\nconst libFS = require('fs');\nconst libPath = require('path');\n\nclass SimpleFlatFileLogger extends libConsoleLog\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\tsuper(pLogStreamSettings, pFableLog);\n\n\t\t// If a path isn't provided for the logfile, it tries to use the ProductName or Context\n\t\tthis.logFileRawPath = (this._Settings.hasOwnProperty('path')) ? this._Settings.path : `./${this._ContextMessage}.log`;\n\t\tthis.logFilePath = libPath.normalize(this.logFileRawPath);\n\n\t\tthis.logFileStreamOptions = (this._Settings.hasOwnProperty('fileStreamoptions')) ? this._Settings.fileStreamOptions : (\n\t\t\t{\n\t\t\t\t\"flags\": \"a\",\n\t\t\t\t\"encoding\": \"utf8\"\n\t\t\t})\n\n\t\tthis.fileWriter = libFS.createWriteStream(this.logFilePath, this.logFileStreamOptions);\n\n\t\tthis.activelyWriting = false;\n\n\t\tthis.logLineStrings = [];\n\t\tthis.logObjectStrings = [];\n\n\t\tthis.defaultWriteCompleteCallback = ()=>{};\n\t\tthis.defaultBufferFlushCallback = ()=>{};\n\t}\n\n\tcloseWriter(fCloseComplete)\n\t{\n\t\tlet tmpCloseComplete = (typeof(fCloseComplete) == 'function') ? fCloseComplete : ()=>{};\n\t\tif (this.fileWriter)\n\t\t{\n\t\t\tthis.fileWriter.end('\\n');\n\t\t\treturn this.fileWriter.once('finish', tmpCloseComplete.bind(this));\n\t\t}\n\t};\n\n\tcompleteBufferFlushToLogFile(fFlushComplete)\n\t{\n\t\tthis.activelyWriting = false;\n\t\tlet tmpFlushComplete = (typeof(fFlushComplete) == 'function') ? fFlushComplete : this.defaultBufferFlushCallback;\n\n\t\tif (this.logLineStrings.length > 0)\n\t\t{\n\t\t\tthis.flushBufferToLogFile(tmpFlushComplete);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn tmpFlushComplete();\n\t\t}\n\t}\n\n\tflushBufferToLogFile(fFlushComplete)\n\t{\n\t\tif (!this.activelyWriting)\n\t\t{\n\t\t\t// Only want to be writing one thing at a time....\n\t\t\tthis.activelyWriting = true;\n\n\t\t\tlet tmpFlushComplete = (typeof(fFlushComplete) == 'function') ? fFlushComplete : this.defaultBufferFlushCallback;\n\n\t\t\t// Get the current buffer arrays. These should always have matching number of elements.\n\t\t\tlet tmpLineStrings = this.logLineStrings;\n\t\t\tlet tmpObjectStrings = this.logObjectStrings;\n\n\t\t\t// Reset these to be filled while we process this queue...\n\t\t\tthis.logLineStrings = [];\n\t\t\tthis.logObjectStrings = [];\n\n\t\t\t// This is where we will put each line before writing it to the file...\n\t\t\tlet tmpConstructedBufferOutputString = '';\n\n\t\t\tfor (let i = 0; i < tmpLineStrings.length; i++)\n\t\t\t{\n\t\t\t\t// TODO: Windows Newline? ....... yo no se!\n\t\t\t\ttmpConstructedBufferOutputString += `${tmpLineStrings[i]}\\n`;\n\t\t\t\tif (tmpObjectStrings[i] !== false)\n\t\t\t\t{\n\t\t\t\t\ttmpConstructedBufferOutputString += `${tmpObjectStrings[i]}\\n`;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!this.fileWriter.write(tmpConstructedBufferOutputString, 'utf8'))\n\t\t\t{\n\t\t\t\t// If the streamwriter returns false, we need to wait for it to drain.\n\t\t\t\tthis.fileWriter.once('drain', this.completeBufferFlushToLogFile.bind(this, tmpFlushComplete));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn this.completeBufferFlushToLogFile(tmpFlushComplete);\n\t\t\t}\n\t\t}\n\t}\n\n\twrite(pLevel, pLogText, pObject)\n\t{\n\t\tlet tmpLogLine = super.write(pLevel, pLogText, pObject);\n\n\t\t// Use a very simple array as the write buffer\n\t\tthis.logLineStrings.push(tmpLogLine);\n\n\t\t// Write out the object on a separate line if it is passed in\n\t\tif (typeof(pObject) !== 'undefined')\n\t\t{\n\t\t\tthis.logObjectStrings.push(JSON.stringify(pObject, null, 4));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.logObjectStrings.push(false);\n\t\t}\n\n\t\tthis.flushBufferToLogFile();\n\t}\n}\n\nmodule.exports = SimpleFlatFileLogger;\n},{\"./Fable-Log-Logger-Console.js\":26,\"fs\":18,\"path\":38}],28:[function(require,module,exports){\n/**\n* Fable Logging Add-on\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Logger\n*/\n\n/**\n* Fable Solution Log Wrapper Main Class\n*\n* @class FableLog\n* @constructor\n*/\nclass FableLog\n{\n\tconstructor(pFableSettings, pFable)\n\t{\n\t\tlet tmpSettings = (typeof(pFableSettings) === 'object') ? pFableSettings : {}\n\t\tthis._Settings = tmpSettings;\n\n\t\tthis._Providers = require('./Fable-Log-DefaultProviders-Node.js');\n\n\t\tthis._StreamDefinitions = (tmpSettings.hasOwnProperty('LogStreams')) ? tmpSettings.LogStreams : require('./Fable-Log-DefaultStreams.json');\n\n\t\tthis.logStreams = [];\n\n\t\t// This object gets decorated for one-time instantiated providers that\n\t\t// have multiple outputs, such as bunyan.\n\t\tthis.logProviders = {};\n\n\t\t// A hash list of the GUIDs for each log stream, so they can't be added to the set more than one time\n\t\tthis.activeLogStreams = {};\n\n\t\tthis.logStreamsTrace = [];\n\t\tthis.logStreamsDebug = [];\n\t\tthis.logStreamsInfo = [];\n\t\tthis.logStreamsWarn = [];\n\t\tthis.logStreamsError = [];\n\t\tthis.logStreamsFatal = [];\n\n\t\tthis.datumDecorator = (pDatum) => pDatum;\n\n\t\tthis.uuid = (typeof(tmpSettings.Product) === 'string') ? tmpSettings.Product : 'Default';\n\t}\n\n\taddLogger(pLogger, pLevel)\n\t{\n\t\t// Bail out if we've already created one.\n\t\tif (this.activeLogStreams.hasOwnProperty(pLogger.loggerUUID))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\t// Add it to the streams and to the mutex\n\t\tthis.logStreams.push(pLogger);\n\t\tthis.activeLogStreams[pLogger.loggerUUID] = true;\n\n\t\t// Make sure a kosher level was passed in\n\t\tswitch (pLevel)\n\t\t{\n\t\t\tcase 'trace':\n\t\t\t\tthis.logStreamsTrace.push(pLogger);\n\t\t\tcase 'debug':\n\t\t\t\tthis.logStreamsDebug.push(pLogger);\n\t\t\tcase 'info':\n\t\t\t\tthis.logStreamsInfo.push(pLogger);\n\t\t\tcase 'warn':\n\t\t\t\tthis.logStreamsWarn.push(pLogger);\n\t\t\tcase 'error':\n\t\t\t\tthis.logStreamsError.push(pLogger);\n\t\t\tcase 'fatal':\n\t\t\t\tthis.logStreamsFatal.push(pLogger);\n\t\t\t\tbreak;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tsetDatumDecorator(fDatumDecorator)\n\t{\n\t\tif (typeof(fDatumDecorator) === 'function')\n\t\t{\n\t\t\tthis.datumDecorator = fDatumDecorator;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.datumDecorator = (pDatum) => pDatum;\n\t\t}\n\t}\n\n\ttrace(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsTrace.length; i++)\n\t\t{\n\t\t\tthis.logStreamsTrace[i].trace(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tdebug(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsDebug.length; i++)\n\t\t{\n\t\t\tthis.logStreamsDebug[i].debug(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tinfo(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsInfo.length; i++)\n\t\t{\n\t\t\tthis.logStreamsInfo[i].info(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\twarn(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsWarn.length; i++)\n\t\t{\n\t\t\tthis.logStreamsWarn[i].warn(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\terror(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsError.length; i++)\n\t\t{\n\t\t\tthis.logStreamsError[i].error(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tfatal(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsFatal.length; i++)\n\t\t{\n\t\t\tthis.logStreamsFatal[i].fatal(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tinitialize()\n\t{\n\t\t// \"initialize\" each logger as defined in the logging parameters\n\t\tfor (let i = 0; i < this._StreamDefinitions.length; i++)\n\t\t{\n\t\t\tlet tmpStreamDefinition = Object.assign({loggertype:'default',streamtype:'console',level:'info'},this._StreamDefinitions[i]);\n\n\t\t\tif (!this._Providers.hasOwnProperty(tmpStreamDefinition.loggertype))\n\t\t\t{\n\t\t\t\tconsole.log(`Error initializing log stream: bad loggertype in stream definition ${JSON.stringify(tmpStreamDefinition)}`);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.addLogger(new this._Providers[tmpStreamDefinition.loggertype](tmpStreamDefinition, this), tmpStreamDefinition.level);\n\t\t\t}\n\t\t}\n\n\t\t// Now initialize each one.\n\t\tfor (let i = 0; i < this.logStreams.length; i++)\n\t\t{\n\t\t\tthis.logStreams[i].initialize();\n\t\t}\n\t}\n\n\tlogTime(pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time';\n\t\tlet tmpTime = new Date();\n\t\tthis.info(`${tmpMessage} ${tmpTime} (epoch ${+tmpTime})`, pDatum);\n\t}\n\n\t// Get a timestamp\n\tgetTimeStamp()\n\t{\n\t\treturn +new Date();\n\t}\n\n\tgetTimeDelta(pTimeStamp)\n\t{\n\t\tlet tmpEndTime = +new Date();\n\t\treturn tmpEndTime-pTimeStamp;\n\t}\n\n\t// Log the delta between a timestamp, and now with a message\n\tlogTimeDelta(pTimeDelta, pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time Measurement';\n\t\tlet tmpDatum = (typeof(pDatum) === 'object') ? pDatum : {};\n\n\t\tlet tmpEndTime = +new Date();\n\n\t\tthis.info(`${tmpMessage} logged at (epoch ${+tmpEndTime}) took (${pTimeDelta}ms)`, pDatum);\n\t}\n\n\tlogTimeDeltaHuman(pTimeDelta, pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time Measurement';\n\n\t\tlet tmpEndTime = +new Date();\n\n\t\tlet tmpMs = parseInt(pTimeDelta%1000);\n\t\tlet tmpSeconds = parseInt((pTimeDelta/1000)%60);\n\t\tlet tmpMinutes = parseInt((pTimeDelta/(1000*60))%60);\n\t\tlet tmpHours = parseInt(pTimeDelta/(1000*60*60));\n\n\t\ttmpMs = (tmpMs < 10) ? \"00\"+tmpMs : (tmpMs < 100) ? \"0\"+tmpMs : tmpMs;\n\t\ttmpSeconds = (tmpSeconds < 10) ? \"0\"+tmpSeconds : tmpSeconds;\n\t\ttmpMinutes = (tmpMinutes < 10) ? \"0\"+tmpMinutes : tmpMinutes;\n\t\ttmpHours = (tmpHours < 10) ? \"0\"+tmpHours : tmpHours;\n\n\t\tthis.info(`${tmpMessage} logged at (epoch ${+tmpEndTime}) took (${pTimeDelta}ms) or (${tmpHours}:${tmpMinutes}:${tmpSeconds}.${tmpMs})`, pDatum);\n\t}\n\n\tlogTimeDeltaRelative(pStartTime, pMessage, pDatum)\n\t{\n\t\tthis.logTimeDelta(this.getTimeDelta(pStartTime), pMessage, pDatum);\n\t}\n\n\tlogTimeDeltaRelativeHuman(pStartTime, pMessage, pDatum)\n\t{\n\t\tthis.logTimeDeltaHuman(this.getTimeDelta(pStartTime), pMessage, pDatum);\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableLog(pSettings);\n}\n\n\nmodule.exports = FableLog;\nmodule.exports.new = autoConstruct;\nmodule.exports.LogProviderBase = require('./Fable-Log-BaseLogger.js');\nmodule.exports.LogProviderConsole = require('./Fable-Log-Logger-Console.js');\nmodule.exports.LogProviderConsole = require('./Fable-Log-Logger-SimpleFlatFile.js');\n\n},{\"./Fable-Log-BaseLogger.js\":23,\"./Fable-Log-DefaultProviders-Node.js\":24,\"./Fable-Log-DefaultStreams.json\":25,\"./Fable-Log-Logger-Console.js\":26,\"./Fable-Log-Logger-SimpleFlatFile.js\":27}],29:[function(require,module,exports){\nmodule.exports={\n\t\"Product\": \"ApplicationNameHere\",\n\t\"ProductVersion\": \"0.0.0\",\n\n\t\"ConfigFile\": false,\n\n\t\"LogStreams\":\n\t[\n\t\t{\n\t\t\t\"level\": \"trace\"\n\t\t}\n\t]\n}\n\n},{}],30:[function(require,module,exports){\n(function (process){(function (){\n/**\n* Fable Settings Template Processor\n*\n* This class allows environment variables to come in via templated expressions, and defaults to be set.\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\n\nclass FableSettingsTemplateProcessor\n{\n\tconstructor(pDependencies)\n\t{\n // Use a no-dependencies templating engine to parse out environment variables\n\t\tthis.templateProcessor = new pDependencies.precedent();\n\n // TODO: Make the environment variable wrap expression demarcation characters configurable?\n\t\tthis.templateProcessor.addPattern('${', '}',\n\t\t\t(pTemplateValue)=>\n\t\t\t{\n\t\t\t\tlet tmpTemplateValue = pTemplateValue.trim();\n\n\t\t\t\tlet tmpSeparatorIndex = tmpTemplateValue.indexOf('|');\n\n\t\t\t\t// If there is no pipe, the default value will end up being whatever the variable name is.\n\t\t\t\tlet tmpDefaultValue = tmpTemplateValue.substring(tmpSeparatorIndex+1);\n\n\t\t\t\tlet tmpEnvironmentVariableName = (tmpSeparatorIndex > -1) ? tmpTemplateValue.substring(0, tmpSeparatorIndex) : tmpTemplateValue;\n\n\t\t\t\tif (process.env.hasOwnProperty(tmpEnvironmentVariableName))\n\t\t\t\t{\n\t\t\t\t\treturn process.env[tmpEnvironmentVariableName];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\treturn tmpDefaultValue;\n\t\t\t\t}\n\t\t\t});\n }\n\n parseSetting(pString)\n {\n return this.templateProcessor.parseString(pString);\n }\n}\n\nmodule.exports = FableSettingsTemplateProcessor;\n}).call(this)}).call(this,require('_process'))\n\n},{\"_process\":42}],31:[function(require,module,exports){\n/**\n* Fable Settings Add-on\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\n\nconst libPrecedent = require('precedent');\nconst libFableSettingsTemplateProcessor = require('./Fable-Settings-TemplateProcessor.js');\n\nclass FableSettings\n{\n\tconstructor(pFableSettings)\n\t{\n\t\t// Expose the dependencies for downstream re-use\n\t\tthis.dependencies = (\n\t\t\t{\n\t\t\t\tprecedent: libPrecedent\n\t\t\t});\n\n\t\t// Initialize the settings value template processor\n\t\tthis.settingsTemplateProcessor = new libFableSettingsTemplateProcessor(this.dependencies);\n\n\t\t// set straight away so anything that uses it respects the initial setting\n\t\tthis._configureEnvTemplating(pFableSettings);\n\n\t\tthis.default = this.buildDefaultSettings();\n\n\t\t// Construct a new settings object\n\t\tlet tmpSettings = this.merge(pFableSettings, this.buildDefaultSettings());\n\n\t\t// The base settings object (what they were on initialization, before other actors have altered them)\n\t\tthis.base = JSON.parse(JSON.stringify(tmpSettings));\n\n\t\tif (tmpSettings.DefaultConfigFile)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\t// If there is a DEFAULT configuration file, try to load and merge it.\n\t\t\t\ttmpSettings = this.merge(require(tmpSettings.DefaultConfigFile), tmpSettings);\n\t\t\t}\n\t\t\tcatch (pException)\n\t\t\t{\n\t\t\t\t// Why this? Often for an app we want settings to work out of the box, but\n\t\t\t\t// would potentially want to have a config file for complex settings.\n\t\t\t\tconsole.log('Fable-Settings Warning: Default configuration file specified but there was a problem loading it. Falling back to base.');\n\t\t\t\tconsole.log(' Loading Exception: '+pException);\n\t\t\t}\n\t\t}\n\n\t\tif (tmpSettings.ConfigFile)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\t// If there is a configuration file, try to load and merge it.\n\t\t\t\ttmpSettings = this.merge(require(tmpSettings.ConfigFile), tmpSettings);\n\t\t\t}\n\t\t\tcatch (pException)\n\t\t\t{\n\t\t\t\t// Why this? Often for an app we want settings to work out of the box, but\n\t\t\t\t// would potentially want to have a config file for complex settings.\n\t\t\t\tconsole.log('Fable-Settings Warning: Configuration file specified but there was a problem loading it. Falling back to base.');\n\t\t\t\tconsole.log(' Loading Exception: '+pException);\n\t\t\t}\n\t\t}\n\n\t\tthis.settings = tmpSettings;\n\t}\n\n\t// Build a default settings object. Use the JSON jimmy to ensure it is always a new object.\n\tbuildDefaultSettings()\n\t{\n\t\treturn JSON.parse(JSON.stringify(require('./Fable-Settings-Default')));\n\t}\n\n\t// Update the configuration for environment variable templating based on the current settings object\n\t_configureEnvTemplating(pSettings)\n\t{\n\t\t// default environment variable templating to on\n\t\tthis._PerformEnvTemplating = !pSettings || pSettings.NoEnvReplacement !== true;\n\t}\n\n\t// Resolve (recursive) any environment variables found in settings object.\n\t_resolveEnv(pSettings)\n\t{\n\t\tfor (const tmpKey in pSettings)\n\t\t{\n\t\t\tif (typeof(pSettings[tmpKey]) === 'object')\n\t\t\t{\n\t\t\t\tthis._resolveEnv(pSettings[tmpKey]);\n\t\t\t}\n\t\t\telse if (typeof(pSettings[tmpKey]) === 'string')\n\t\t\t{\n\t\t\t\tpSettings[tmpKey] = this.settingsTemplateProcessor.parseSetting(pSettings[tmpKey]);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Check to see if a value is an object (but not an array).\n\t */\n\t_isObject(value)\n\t{\n\t\treturn typeof(value) === 'object' && !Array.isArray(value);\n\t}\n\n\t/**\n\t * Merge two plain objects. Keys that are objects in both will be merged property-wise.\n\t */\n\t_deepMergeObjects(toObject, fromObject)\n\t{\n\t\tif (!fromObject || !this._isObject(fromObject))\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\tObject.keys(fromObject).forEach((key) =>\n\t\t{\n\t\t\tconst fromValue = fromObject[key];\n\t\t\tif (this._isObject(fromValue))\n\t\t\t{\n\t\t\t\tconst toValue = toObject[key];\n\t\t\t\tif (toValue && this._isObject(toValue))\n\t\t\t\t{\n\t\t\t\t\t// both are objects, so do a recursive merge\n\t\t\t\t\tthis._deepMergeObjects(toValue, fromValue);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttoObject[key] = fromValue;\n\t\t});\n\t\treturn toObject;\n\t}\n\n\t// Merge some new object into the existing settings.\n\tmerge(pSettingsFrom, pSettingsTo)\n\t{\n\t\t// If an invalid settings from object is passed in (e.g. object constructor without passing in anything) this should still work\n\t\tlet tmpSettingsFrom = (typeof(pSettingsFrom) === 'object') ? pSettingsFrom : {};\n\t\t// Default to the settings object if none is passed in for the merge.\n\t\tlet tmpSettingsTo = (typeof(pSettingsTo) === 'object') ? pSettingsTo : this.settings;\n\n\t\t// do not mutate the From object property values\n\t\tlet tmpSettingsFromCopy = JSON.parse(JSON.stringify(tmpSettingsFrom));\n\t\ttmpSettingsTo = this._deepMergeObjects(tmpSettingsTo, tmpSettingsFromCopy);\n\n\t\tif (this._PerformEnvTemplating)\n\t\t{\n\t\t\tthis._resolveEnv(tmpSettingsTo);\n\t\t}\n\t\t// Update env tempating config, since we just updated the config object, and it may have changed\n\t\tthis._configureEnvTemplating(tmpSettingsTo);\n\n\t\treturn tmpSettingsTo;\n\t}\n\n\t// Fill in settings gaps without overwriting settings that are already there\n\tfill(pSettingsFrom)\n\t{\n\t\t// If an invalid settings from object is passed in (e.g. object constructor without passing in anything) this should still work\n\t\tlet tmpSettingsFrom = (typeof(pSettingsFrom) === 'object') ? pSettingsFrom : {};\n\n\t\t// do not mutate the From object property values\n\t\tlet tmpSettingsFromCopy = JSON.parse(JSON.stringify(tmpSettingsFrom));\n\n\t\tthis.settings = this._deepMergeObjects(tmpSettingsFromCopy, this.settings);\n\n\t\treturn this.settings;\n\t}\n};\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableSettings(pSettings);\n}\n\nmodule.exports = FableSettings;\nmodule.exports.new = autoConstruct;\nmodule.exports.precedent = libPrecedent;\n},{\"./Fable-Settings-Default\":29,\"./Fable-Settings-TemplateProcessor.js\":30,\"precedent\":39}],32:[function(require,module,exports){\n/**\n* Random Byte Generator - Browser version\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\n// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n// Unique ID creation requires a high quality random # generator. In the\n// browser this is a little complicated due to unknown quality of Math.random()\n// and inconsistent support for the `crypto` API. We do the best we can via\n// feature-detection\nclass RandomBytes\n{\n\tconstructor()\n\t{\n\n\t\t// getRandomValues needs to be invoked in a context where \"this\" is a Crypto\n\t\t// implementation. Also, find the complete implementation of crypto on IE11.\n\t\tthis.getRandomValues = (typeof(crypto) != 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto)) ||\n \t\t(typeof(msCrypto) != 'undefined' && typeof window.msCrypto.getRandomValues == 'function' && msCrypto.getRandomValues.bind(msCrypto));\n\t}\n\n\t// WHATWG crypto RNG - http://wiki.whatwg.org/wiki/Crypto\n\tgenerateWhatWGBytes()\n\t{\n\t\tlet tmpBuffer = new Uint8Array(16); // eslint-disable-line no-undef\n\n\t\tthis.getRandomValues(tmpBuffer);\n\t\treturn tmpBuffer;\n\t}\n\n\t// Math.random()-based (RNG)\n\tgenerateRandomBytes()\n\t{\n\t\t// If all else fails, use Math.random(). It's fast, but is of unspecified\n\t\t// quality.\n\t\tlet tmpBuffer = new Uint8Array(16); // eslint-disable-line no-undef\n\n\t\tfor (let i = 0, tmpValue; i < 16; i++)\n\t\t{\n\t\t\tif ((i & 0x03) === 0)\n\t\t\t{\n\t\t\t\ttmpValue = Math.random() * 0x100000000;\n\t\t\t}\n\n\t\t\ttmpBuffer[i] = tmpValue >>> ((i & 0x03) << 3) & 0xff;\n\t\t}\n\n\t\treturn tmpBuffer;\n\t}\n\n\tgenerate()\n\t{\n\t\tif (this.getRandomValues)\n\t\t{\n\t\t\treturn this.generateWhatWGBytes();\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.generateRandomBytes();\n\t\t}\n\t}\n}\n\nmodule.exports = RandomBytes;\n\n},{}],33:[function(require,module,exports){\n/**\n* Fable UUID Generator\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable UUID\n*/\n\n/**\n* Fable Solution UUID Generation Main Class\n*\n* @class FableUUID\n* @constructor\n*/\n\nvar libRandomByteGenerator = require('./Fable-UUID-Random.js')\n\nclass FableUUID\n{\n\tconstructor(pSettings)\n\t{\n\t\t// Determine if the module is in \"Random UUID Mode\" which means just use the random character function rather than the v4 random UUID spec.\n\t\t// Note this allows UUIDs of various lengths (including very short ones) although guaranteed uniqueness goes downhill fast.\n\t\tthis._UUIDModeRandom = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDModeRandom')) ? (pSettings.UUIDModeRandom == true) : false;\n\t\t// These two properties are only useful if we are in Random mode. Otherwise it generates a v4 spec\n\t\t// Length for \"Random UUID Mode\" is set -- if not set it to 8\n\t\tthis._UUIDLength = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDLength')) ? (pSettings.UUIDLength + 0) : 8;\n\t\t// Dictionary for \"Random UUID Mode\"\n\t\tthis._UUIDRandomDictionary = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDDictionary')) ? (pSettings.UUIDDictionary + 0) : '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ';\n\n\t\tthis.randomByteGenerator = new libRandomByteGenerator();\n\n\t\t// Lookup table for hex codes\n\t\tthis._HexLookup = [];\n\t\tfor (let i = 0; i < 256; ++i)\n\t\t{\n\t\t\tthis._HexLookup[i] = (i + 0x100).toString(16).substr(1);\n\t\t}\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tbytesToUUID(pBuffer)\n\t{\n\t\tlet i = 0;\n\t\t// join used to fix memory issue caused by concatenation: https://bugs.chromium.org/p/v8/issues/detail?id=3175#c4\n\t\treturn ([\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], \n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]]\n\t\t\t\t]).join('');\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tgenerateUUIDv4()\n\t{\n\t\tlet tmpBuffer = new Array(16);\n\t\tvar tmpRandomBytes = this.randomByteGenerator.generate();\n\n\t\t// Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\t\ttmpRandomBytes[6] = (tmpRandomBytes[6] & 0x0f) | 0x40;\n\t\ttmpRandomBytes[8] = (tmpRandomBytes[8] & 0x3f) | 0x80;\n\n\t\treturn this.bytesToUUID(tmpRandomBytes);\n\t}\n\n\t// Simple random UUID generation\n\tgenerateRandom()\n\t{\n\t\tlet tmpUUID = '';\n\n\t\tfor (let i = 0; i < this._UUIDLength; i++)\n\t\t{\n\t\t\ttmpUUID += this._UUIDRandomDictionary.charAt(Math.floor(Math.random() * (this._UUIDRandomDictionary.length-1)));\n\t\t}\n\n\t\treturn tmpUUID;\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tgetUUID()\n\t{\n\t\tif (this._UUIDModeRandom)\n\t\t{\n\t\t\treturn this.generateRandom();\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.generateUUIDv4();\n\t\t}\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableUUID(pSettings);\n}\n\n\nmodule.exports = FableUUID;\nmodule.exports.new = autoConstruct;\n\n},{\"./Fable-UUID-Random.js\":32}],34:[function(require,module,exports){\nvar http = require('http')\nvar url = require('url')\n\nvar https = module.exports\n\nfor (var key in http) {\n if (http.hasOwnProperty(key)) https[key] = http[key]\n}\n\nhttps.request = function (params, cb) {\n params = validateParams(params)\n return http.request.call(this, params, cb)\n}\n\nhttps.get = function (params, cb) {\n params = validateParams(params)\n return http.get.call(this, params, cb)\n}\n\nfunction validateParams (params) {\n if (typeof params === 'string') {\n params = url.parse(params)\n }\n if (!params.protocol) {\n params.protocol = 'https:'\n }\n if (params.protocol !== 'https:') {\n throw new Error('Protocol \"' + params.protocol + '\" not supported. Expected \"https:\"')\n }\n return params\n}\n\n},{\"http\":50,\"url\":71}],35:[function(require,module,exports){\n/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.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\n},{}],36:[function(require,module,exports){\nif (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n if (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 };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n if (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}\n\n},{}],37:[function(require,module,exports){\nvar wrappy = require('wrappy')\nmodule.exports = wrappy(once)\nmodule.exports.strict = wrappy(onceStrict)\n\nonce.proto = once(function () {\n Object.defineProperty(Function.prototype, 'once', {\n value: function () {\n return once(this)\n },\n configurable: true\n })\n\n Object.defineProperty(Function.prototype, 'onceStrict', {\n value: function () {\n return onceStrict(this)\n },\n configurable: true\n })\n})\n\nfunction once (fn) {\n var f = function () {\n if (f.called) return f.value\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n f.called = false\n return f\n}\n\nfunction onceStrict (fn) {\n var f = function () {\n if (f.called)\n throw new Error(f.onceError)\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n var name = fn.name || 'Function wrapped with `once`'\n f.onceError = name + \" shouldn't be called more than once\"\n f.called = false\n return f\n}\n\n},{\"wrappy\":74}],38:[function(require,module,exports){\n(function (process){(function (){\n// 'path' module extracted from Node.js v8.11.1 (only the posix part)\n// transplited with Babel\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\n'use strict';\n\nfunction assertPath(path) {\n if (typeof path !== 'string') {\n throw new TypeError('Path must be a string. Received ' + JSON.stringify(path));\n }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n var res = '';\n var lastSegmentLength = 0;\n var lastSlash = -1;\n var dots = 0;\n var code;\n for (var i = 0; i <= path.length; ++i) {\n if (i < path.length)\n code = path.charCodeAt(i);\n else if (code === 47 /*/*/)\n break;\n else\n code = 47 /*/*/;\n if (code === 47 /*/*/) {\n if (lastSlash === i - 1 || dots === 1) {\n // NOOP\n } else if (lastSlash !== i - 1 && dots === 2) {\n if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) {\n if (res.length > 2) {\n var lastSlashIndex = res.lastIndexOf('/');\n if (lastSlashIndex !== res.length - 1) {\n if (lastSlashIndex === -1) {\n res = '';\n lastSegmentLength = 0;\n } else {\n res = res.slice(0, lastSlashIndex);\n lastSegmentLength = res.length - 1 - res.lastIndexOf('/');\n }\n lastSlash = i;\n dots = 0;\n continue;\n }\n } else if (res.length === 2 || res.length === 1) {\n res = '';\n lastSegmentLength = 0;\n lastSlash = i;\n dots = 0;\n continue;\n }\n }\n if (allowAboveRoot) {\n if (res.length > 0)\n res += '/..';\n else\n res = '..';\n lastSegmentLength = 2;\n }\n } else {\n if (res.length > 0)\n res += '/' + path.slice(lastSlash + 1, i);\n else\n res = path.slice(lastSlash + 1, i);\n lastSegmentLength = i - lastSlash - 1;\n }\n lastSlash = i;\n dots = 0;\n } else if (code === 46 /*.*/ && dots !== -1) {\n ++dots;\n } else {\n dots = -1;\n }\n }\n return res;\n}\n\nfunction _format(sep, pathObject) {\n var dir = pathObject.dir || pathObject.root;\n var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || '');\n if (!dir) {\n return base;\n }\n if (dir === pathObject.root) {\n return dir + base;\n }\n return dir + sep + base;\n}\n\nvar posix = {\n // path.resolve([from ...], to)\n resolve: function resolve() {\n var resolvedPath = '';\n var resolvedAbsolute = false;\n var cwd;\n\n for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n var path;\n if (i >= 0)\n path = arguments[i];\n else {\n if (cwd === undefined)\n cwd = process.cwd();\n path = cwd;\n }\n\n assertPath(path);\n\n // Skip empty entries\n if (path.length === 0) {\n continue;\n }\n\n resolvedPath = path + '/' + resolvedPath;\n resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/;\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n if (resolvedAbsolute) {\n if (resolvedPath.length > 0)\n return '/' + resolvedPath;\n else\n return '/';\n } else if (resolvedPath.length > 0) {\n return resolvedPath;\n } else {\n return '.';\n }\n },\n\n normalize: function normalize(path) {\n assertPath(path);\n\n if (path.length === 0) return '.';\n\n var isAbsolute = path.charCodeAt(0) === 47 /*/*/;\n var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/;\n\n // Normalize the path\n path = normalizeStringPosix(path, !isAbsolute);\n\n if (path.length === 0 && !isAbsolute) path = '.';\n if (path.length > 0 && trailingSeparator) path += '/';\n\n if (isAbsolute) return '/' + path;\n return path;\n },\n\n isAbsolute: function isAbsolute(path) {\n assertPath(path);\n return path.length > 0 && path.charCodeAt(0) === 47 /*/*/;\n },\n\n join: function join() {\n if (arguments.length === 0)\n return '.';\n var joined;\n for (var i = 0; i < arguments.length; ++i) {\n var arg = arguments[i];\n assertPath(arg);\n if (arg.length > 0) {\n if (joined === undefined)\n joined = arg;\n else\n joined += '/' + arg;\n }\n }\n if (joined === undefined)\n return '.';\n return posix.normalize(joined);\n },\n\n relative: function relative(from, to) {\n assertPath(from);\n assertPath(to);\n\n if (from === to) return '';\n\n from = posix.resolve(from);\n to = posix.resolve(to);\n\n if (from === to) return '';\n\n // Trim any leading backslashes\n var fromStart = 1;\n for (; fromStart < from.length; ++fromStart) {\n if (from.charCodeAt(fromStart) !== 47 /*/*/)\n break;\n }\n var fromEnd = from.length;\n var fromLen = fromEnd - fromStart;\n\n // Trim any leading backslashes\n var toStart = 1;\n for (; toStart < to.length; ++toStart) {\n if (to.charCodeAt(toStart) !== 47 /*/*/)\n break;\n }\n var toEnd = to.length;\n var toLen = toEnd - toStart;\n\n // Compare paths to find the longest common path from root\n var length = fromLen < toLen ? fromLen : toLen;\n var lastCommonSep = -1;\n var i = 0;\n for (; i <= length; ++i) {\n if (i === length) {\n if (toLen > length) {\n if (to.charCodeAt(toStart + i) === 47 /*/*/) {\n // We get here if `from` is the exact base path for `to`.\n // For example: from='/foo/bar'; to='/foo/bar/baz'\n return to.slice(toStart + i + 1);\n } else if (i === 0) {\n // We get here if `from` is the root\n // For example: from='/'; to='/foo'\n return to.slice(toStart + i);\n }\n } else if (fromLen > length) {\n if (from.charCodeAt(fromStart + i) === 47 /*/*/) {\n // We get here if `to` is the exact base path for `from`.\n // For example: from='/foo/bar/baz'; to='/foo/bar'\n lastCommonSep = i;\n } else if (i === 0) {\n // We get here if `to` is the root.\n // For example: from='/foo'; to='/'\n lastCommonSep = 0;\n }\n }\n break;\n }\n var fromCode = from.charCodeAt(fromStart + i);\n var toCode = to.charCodeAt(toStart + i);\n if (fromCode !== toCode)\n break;\n else if (fromCode === 47 /*/*/)\n lastCommonSep = i;\n }\n\n var out = '';\n // Generate the relative path based on the path difference between `to`\n // and `from`\n for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n if (i === fromEnd || from.charCodeAt(i) === 47 /*/*/) {\n if (out.length === 0)\n out += '..';\n else\n out += '/..';\n }\n }\n\n // Lastly, append the rest of the destination (`to`) path that comes after\n // the common path parts\n if (out.length > 0)\n return out + to.slice(toStart + lastCommonSep);\n else {\n toStart += lastCommonSep;\n if (to.charCodeAt(toStart) === 47 /*/*/)\n ++toStart;\n return to.slice(toStart);\n }\n },\n\n _makeLong: function _makeLong(path) {\n return path;\n },\n\n dirname: function dirname(path) {\n assertPath(path);\n if (path.length === 0) return '.';\n var code = path.charCodeAt(0);\n var hasRoot = code === 47 /*/*/;\n var end = -1;\n var matchedSlash = true;\n for (var i = path.length - 1; i >= 1; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n if (!matchedSlash) {\n end = i;\n break;\n }\n } else {\n // We saw the first non-path separator\n matchedSlash = false;\n }\n }\n\n if (end === -1) return hasRoot ? '/' : '.';\n if (hasRoot && end === 1) return '//';\n return path.slice(0, end);\n },\n\n basename: function basename(path, ext) {\n if (ext !== undefined && typeof ext !== 'string') throw new TypeError('\"ext\" argument must be a string');\n assertPath(path);\n\n var start = 0;\n var end = -1;\n var matchedSlash = true;\n var i;\n\n if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n if (ext.length === path.length && ext === path) return '';\n var extIdx = ext.length - 1;\n var firstNonSlashEnd = -1;\n for (i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else {\n if (firstNonSlashEnd === -1) {\n // We saw the first non-path separator, remember this index in case\n // we need it if the extension ends up not matching\n matchedSlash = false;\n firstNonSlashEnd = i + 1;\n }\n if (extIdx >= 0) {\n // Try to match the explicit extension\n if (code === ext.charCodeAt(extIdx)) {\n if (--extIdx === -1) {\n // We matched the extension, so mark this as the end of our path\n // component\n end = i;\n }\n } else {\n // Extension does not match, so our result is the entire path\n // component\n extIdx = -1;\n end = firstNonSlashEnd;\n }\n }\n }\n }\n\n if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length;\n return path.slice(start, end);\n } else {\n for (i = path.length - 1; i >= 0; --i) {\n if (path.charCodeAt(i) === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // path component\n matchedSlash = false;\n end = i + 1;\n }\n }\n\n if (end === -1) return '';\n return path.slice(start, end);\n }\n },\n\n extname: function extname(path) {\n assertPath(path);\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n for (var i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1)\n startDot = i;\n else if (preDotState !== 1)\n preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n return '';\n }\n return path.slice(startDot, end);\n },\n\n format: function format(pathObject) {\n if (pathObject === null || typeof pathObject !== 'object') {\n throw new TypeError('The \"pathObject\" argument must be of type Object. Received type ' + typeof pathObject);\n }\n return _format('/', pathObject);\n },\n\n parse: function parse(path) {\n assertPath(path);\n\n var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n if (path.length === 0) return ret;\n var code = path.charCodeAt(0);\n var isAbsolute = code === 47 /*/*/;\n var start;\n if (isAbsolute) {\n ret.root = '/';\n start = 1;\n } else {\n start = 0;\n }\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n var i = path.length - 1;\n\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n\n // Get non-dir info\n for (; i >= start; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n if (end !== -1) {\n if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end);\n }\n } else {\n if (startPart === 0 && isAbsolute) {\n ret.name = path.slice(1, startDot);\n ret.base = path.slice(1, end);\n } else {\n ret.name = path.slice(startPart, startDot);\n ret.base = path.slice(startPart, end);\n }\n ret.ext = path.slice(startDot, end);\n }\n\n if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/';\n\n return ret;\n },\n\n sep: '/',\n delimiter: ':',\n win32: null,\n posix: null\n};\n\nposix.posix = posix;\n\nmodule.exports = posix;\n\n}).call(this)}).call(this,require('_process'))\n\n},{\"_process\":42}],39:[function(require,module,exports){\n/**\n* Precedent Meta-Templating\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Process text streams, parsing out meta-template expressions.\n*/\nvar libWordTree = require(`./WordTree.js`);\nvar libStringParser = require(`./StringParser.js`);\n\nclass Precedent\n{\n\t/**\n\t * Precedent Constructor\n\t */\n\tconstructor()\n\t{\n\t\tthis.WordTree = new libWordTree();\n\n\t\tthis.StringParser = new libStringParser();\n\n\t\tthis.ParseTree = this.WordTree.ParseTree;\n\t}\n\n\t/**\n\t * Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pTree - A node on the parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern(pPatternStart, pPatternEnd, pParser)\n\t{\n\t\treturn this.WordTree.addPattern(pPatternStart, pPatternEnd, pParser);\n\t}\n\n\t/**\n\t * Parse a string with the existing parse tree\n\t * @method parseString\n\t * @param {string} pString - The string to parse\n\t * @param {object} pData - Data to pass in as the second argument\n\t * @return {string} The result from the parser\n\t */\n\tparseString(pString, pData)\n\t{\n\t\treturn this.StringParser.parseString(pString, this.ParseTree, pData);\n\t}\n}\n\nmodule.exports = Precedent;\n\n},{\"./StringParser.js\":40,\"./WordTree.js\":41}],40:[function(require,module,exports){\n/**\n* String Parser\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Parse a string, properly processing each matched token in the word tree.\n*/\n\nclass StringParser\n{\n\t/**\n\t * StringParser Constructor\n\t */\n\tconstructor()\n\t{\n\t}\n\n\t/**\n\t * Create a fresh parsing state object to work with.\n\t * @method newParserState\n\t * @param {Object} pParseTree - A node on the parse tree to begin parsing from (usually root)\n\t * @return {Object} A new parser state object for running a character parser on\n\t * @private\n\t */\n\tnewParserState (pParseTree)\n\t{\n\t\treturn (\n\t\t{\n\t\t\tParseTree: pParseTree,\n\n\t\t\tOutput: '',\n\t\t\tOutputBuffer: '',\n\n\t\t\tPattern: false,\n\n\t\t\tPatternMatch: false,\n\t\t\tPatternMatchOutputBuffer: ''\n\t\t});\n\t}\n\n\t/**\n\t * Assign a node of the parser tree to be the next potential match.\n\t * If the node has a PatternEnd property, it is a valid match and supercedes the last valid match (or becomes the initial match).\n\t * @method assignNode\n\t * @param {Object} pNode - A node on the parse tree to assign\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tassignNode (pNode, pParserState)\n\t{\n\t\tpParserState.PatternMatch = pNode;\n\n\t\t// If the pattern has a END we can assume it has a parse function...\n\t\tif (pParserState.PatternMatch.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\t// ... this is the legitimate start of a pattern.\n\t\t\tpParserState.Pattern = pParserState.PatternMatch;\n\t\t}\n\t}\n\n\t/**\n\t * Append a character to the output buffer in the parser state.\n\t * This output buffer is used when a potential match is being explored, or a match is being explored.\n\t * @method appendOutputBuffer\n\t * @param {string} pCharacter - The character to append\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tappendOutputBuffer (pCharacter, pParserState)\n\t{\n\t\tpParserState.OutputBuffer += pCharacter;\n\t}\n\n\t/**\n\t * Flush the output buffer to the output and clear it.\n\t * @method flushOutputBuffer\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tflushOutputBuffer (pParserState)\n\t{\n\t\tpParserState.Output += pParserState.OutputBuffer;\n\t\tpParserState.OutputBuffer = '';\n\t}\n\n\n\t/**\n\t * Check if the pattern has ended. If it has, properly flush the buffer and start looking for new patterns.\n\t * @method checkPatternEnd\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tcheckPatternEnd (pParserState, pData)\n\t{\n\t\tif ((pParserState.OutputBuffer.length >= pParserState.Pattern.PatternEnd.length+pParserState.Pattern.PatternStart.length) &&\n\t\t\t(pParserState.OutputBuffer.substr(-pParserState.Pattern.PatternEnd.length) === pParserState.Pattern.PatternEnd))\n\t\t{\n\t\t\t// ... this is the end of a pattern, cut off the end tag and parse it.\n\t\t\t// Trim the start and end tags off the output buffer now\n\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStart.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStart.length+pParserState.Pattern.PatternEnd.length)), pData);\n\t\t\t// Flush the output buffer.\n\t\t\tthis.flushOutputBuffer(pParserState);\n\t\t\t// End pattern mode\n\t\t\tpParserState.Pattern = false;\n\t\t\tpParserState.PatternMatch = false;\n\t\t}\n\t}\n\n\t/**\n\t * Parse a character in the buffer.\n\t * @method parseCharacter\n\t * @param {string} pCharacter - The character to append\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tparseCharacter (pCharacter, pParserState, pData)\n\t{\n\t\t// (1) If we aren't in a pattern match, and we aren't potentially matching, and this may be the start of a new pattern....\n\t\tif (!pParserState.PatternMatch && pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t{\n\t\t\t// ... assign the node as the matched node.\n\t\t\tthis.assignNode(pParserState.ParseTree[pCharacter], pParserState);\n\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t}\n\t\t// (2) If we are in a pattern match (actively seeing if this is part of a new pattern token)\n\t\telse if (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern has a subpattern with this key\n\t\t\tif (pParserState.PatternMatch.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// Continue matching patterns.\n\t\t\t\tthis.assignNode(pParserState.PatternMatch[pCharacter], pParserState);\n\t\t\t}\n\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\tif (pParserState.Pattern)\n\t\t\t{\n\t\t\t\t// ... Check if this is the end of the pattern (if we are matching a valid pattern)...\n\t\t\t\tthis.checkPatternEnd(pParserState, pData);\n\t\t\t}\n\t\t}\n\t\t// (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\telse\n\t\t{\n\t\t\tpParserState.Output += pCharacter;\n\t\t}\n\t}\n\n\t/**\n\t * Parse a string for matches, and process any template segments that occur.\n\t * @method parseString\n\t * @param {string} pString - The string to parse.\n\t * @param {Object} pParseTree - The parse tree to begin parsing from (usually root)\n\t * @param {Object} pData - The data to pass to the function as a second paramter\n\t */\n\tparseString (pString, pParseTree, pData)\n\t{\n\t\tlet tmpParserState = this.newParserState(pParseTree);\n\n\t\tfor (var i = 0; i < pString.length; i++)\n\t\t{\n\t\t\t// TODO: This is not fast.\n\t\t\tthis.parseCharacter(pString[i], tmpParserState, pData);\n\t\t}\n\n\t\tthis.flushOutputBuffer(tmpParserState);\n\n\t\treturn tmpParserState.Output;\n\t}\n}\n\nmodule.exports = StringParser;\n\n},{}],41:[function(require,module,exports){\n/**\n* Word Tree\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Create a tree (directed graph) of Javascript objects, one character per object.\n*/\n\nclass WordTree\n{\n\t/**\n\t * WordTree Constructor\n\t */\n\tconstructor()\n\t{\n\t\tthis.ParseTree = {};\n\t}\n\t\n\t/** \n\t * Add a child character to a Parse Tree node\n\t * @method addChild\n\t * @param {Object} pTree - A parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - The index of the character in the pattern\n\t * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddChild (pTree, pPattern, pIndex)\n\t{\n\t\tif (!pTree.hasOwnProperty(pPattern[pIndex]))\n\t\t\tpTree[pPattern[pIndex]] = {};\n\t\t\n\t\treturn pTree[pPattern[pIndex]];\n\t}\n\t\n\t/** Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pPatternStart - The starting string for the pattern (e.g. \"${\")\n\t * @param {string} pPatternEnd - The ending string for the pattern (e.g. \"}\")\n\t * @param {number} pParser - The function to parse if this is the matched pattern, once the Pattern End is met. If this is a string, a simple replacement occurs.\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern (pPatternStart, pPatternEnd, pParser)\n\t{\n\t\tif (pPatternStart.length < 1)\n\t\t\treturn false;\n\n\t\tif ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length < 1))\n\t\t\treturn false;\n\n\t\tlet tmpLeaf = this.ParseTree;\n\n\t\t// Add the tree of leaves iteratively\n\t\tfor (var i = 0; i < pPatternStart.length; i++)\n\t\t\ttmpLeaf = this.addChild(tmpLeaf, pPatternStart, i);\n\n\t\ttmpLeaf.PatternStart = pPatternStart;\n\t\ttmpLeaf.PatternEnd = ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length > 0)) ? pPatternEnd : pPatternStart;\n\t\ttmpLeaf.Parse = (typeof(pParser) === 'function') ? pParser : \n\t\t\t\t\t\t(typeof(pParser) === 'string') ? () => { return pParser; } :\n\t\t\t\t\t\t(pData) => { return pData; };\n\n\t\treturn true;\n\t}\n}\n\nmodule.exports = WordTree;\n\n},{}],42:[function(require,module,exports){\n// 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\n},{}],43:[function(require,module,exports){\n(function (global){(function (){\n/*! https://mths.be/punycode v1.4.1 by @mathias */\n;(function(root) {\n\n\t/** Detect free variables */\n\tvar freeExports = typeof exports == 'object' && exports &&\n\t\t!exports.nodeType && exports;\n\tvar freeModule = typeof module == 'object' && module &&\n\t\t!module.nodeType && module;\n\tvar freeGlobal = typeof global == 'object' && global;\n\tif (\n\t\tfreeGlobal.global === freeGlobal ||\n\t\tfreeGlobal.window === freeGlobal ||\n\t\tfreeGlobal.self === freeGlobal\n\t) {\n\t\troot = freeGlobal;\n\t}\n\n\t/**\n\t * The `punycode` object.\n\t * @name punycode\n\t * @type Object\n\t */\n\tvar punycode,\n\n\t/** Highest positive signed 32-bit float value */\n\tmaxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1\n\n\t/** Bootstring parameters */\n\tbase = 36,\n\ttMin = 1,\n\ttMax = 26,\n\tskew = 38,\n\tdamp = 700,\n\tinitialBias = 72,\n\tinitialN = 128, // 0x80\n\tdelimiter = '-', // '\\x2D'\n\n\t/** Regular expressions */\n\tregexPunycode = /^xn--/,\n\tregexNonASCII = /[^\\x20-\\x7E]/, // unprintable ASCII chars + non-ASCII chars\n\tregexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g, // RFC 3490 separators\n\n\t/** Error messages */\n\terrors = {\n\t\t'overflow': 'Overflow: input needs wider integers to process',\n\t\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t\t'invalid-input': 'Invalid input'\n\t},\n\n\t/** Convenience shortcuts */\n\tbaseMinusTMin = base - tMin,\n\tfloor = Math.floor,\n\tstringFromCharCode = String.fromCharCode,\n\n\t/** Temporary variable */\n\tkey;\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/**\n\t * A generic error utility function.\n\t * @private\n\t * @param {String} type The error type.\n\t * @returns {Error} Throws a `RangeError` with the applicable error message.\n\t */\n\tfunction error(type) {\n\t\tthrow new RangeError(errors[type]);\n\t}\n\n\t/**\n\t * A generic `Array#map` utility function.\n\t * @private\n\t * @param {Array} array The array to iterate over.\n\t * @param {Function} callback The function that gets called for every array\n\t * item.\n\t * @returns {Array} A new array of values returned by the callback function.\n\t */\n\tfunction map(array, fn) {\n\t\tvar length = array.length;\n\t\tvar result = [];\n\t\twhile (length--) {\n\t\t\tresult[length] = fn(array[length]);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * A simple `Array#map`-like wrapper to work with domain name strings or email\n\t * addresses.\n\t * @private\n\t * @param {String} domain The domain name or email address.\n\t * @param {Function} callback The function that gets called for every\n\t * character.\n\t * @returns {Array} A new string of characters returned by the callback\n\t * function.\n\t */\n\tfunction mapDomain(string, fn) {\n\t\tvar parts = string.split('@');\n\t\tvar result = '';\n\t\tif (parts.length > 1) {\n\t\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t\t// the local part (i.e. everything up to `@`) intact.\n\t\t\tresult = parts[0] + '@';\n\t\t\tstring = parts[1];\n\t\t}\n\t\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\t\tstring = string.replace(regexSeparators, '\\x2E');\n\t\tvar labels = string.split('.');\n\t\tvar encoded = map(labels, fn).join('.');\n\t\treturn result + encoded;\n\t}\n\n\t/**\n\t * Creates an array containing the numeric code points of each Unicode\n\t * character in the string. While JavaScript uses UCS-2 internally,\n\t * this function will convert a pair of surrogate halves (each of which\n\t * UCS-2 exposes as separate characters) into a single code point,\n\t * matching UTF-16.\n\t * @see `punycode.ucs2.encode`\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode.ucs2\n\t * @name decode\n\t * @param {String} string The Unicode input string (UCS-2).\n\t * @returns {Array} The new array of code points.\n\t */\n\tfunction ucs2decode(string) {\n\t\tvar output = [],\n\t\t counter = 0,\n\t\t length = string.length,\n\t\t value,\n\t\t extra;\n\t\twhile (counter < length) {\n\t\t\tvalue = string.charCodeAt(counter++);\n\t\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t\t// high surrogate, and there is a next character\n\t\t\t\textra = string.charCodeAt(counter++);\n\t\t\t\tif ((extra & 0xFC00) == 0xDC00) { // low surrogate\n\t\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t\t} else {\n\t\t\t\t\t// unmatched surrogate; only append this code unit, in case the next\n\t\t\t\t\t// code unit is the high surrogate of a surrogate pair\n\t\t\t\t\toutput.push(value);\n\t\t\t\t\tcounter--;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\toutput.push(value);\n\t\t\t}\n\t\t}\n\t\treturn output;\n\t}\n\n\t/**\n\t * Creates a string based on an array of numeric code points.\n\t * @see `punycode.ucs2.decode`\n\t * @memberOf punycode.ucs2\n\t * @name encode\n\t * @param {Array} codePoints The array of numeric code points.\n\t * @returns {String} The new Unicode string (UCS-2).\n\t */\n\tfunction ucs2encode(array) {\n\t\treturn map(array, function(value) {\n\t\t\tvar output = '';\n\t\t\tif (value > 0xFFFF) {\n\t\t\t\tvalue -= 0x10000;\n\t\t\t\toutput += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);\n\t\t\t\tvalue = 0xDC00 | value & 0x3FF;\n\t\t\t}\n\t\t\toutput += stringFromCharCode(value);\n\t\t\treturn output;\n\t\t}).join('');\n\t}\n\n\t/**\n\t * Converts a basic code point into a digit/integer.\n\t * @see `digitToBasic()`\n\t * @private\n\t * @param {Number} codePoint The basic numeric code point value.\n\t * @returns {Number} The numeric value of a basic code point (for use in\n\t * representing integers) in the range `0` to `base - 1`, or `base` if\n\t * the code point does not represent a value.\n\t */\n\tfunction basicToDigit(codePoint) {\n\t\tif (codePoint - 48 < 10) {\n\t\t\treturn codePoint - 22;\n\t\t}\n\t\tif (codePoint - 65 < 26) {\n\t\t\treturn codePoint - 65;\n\t\t}\n\t\tif (codePoint - 97 < 26) {\n\t\t\treturn codePoint - 97;\n\t\t}\n\t\treturn base;\n\t}\n\n\t/**\n\t * Converts a digit/integer into a basic code point.\n\t * @see `basicToDigit()`\n\t * @private\n\t * @param {Number} digit The numeric value of a basic code point.\n\t * @returns {Number} The basic code point whose value (when used for\n\t * representing integers) is `digit`, which needs to be in the range\n\t * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n\t * used; else, the lowercase form is used. The behavior is undefined\n\t * if `flag` is non-zero and `digit` has no uppercase form.\n\t */\n\tfunction digitToBasic(digit, flag) {\n\t\t// 0..25 map to ASCII a..z or A..Z\n\t\t// 26..35 map to ASCII 0..9\n\t\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n\t}\n\n\t/**\n\t * Bias adaptation function as per section 3.4 of RFC 3492.\n\t * https://tools.ietf.org/html/rfc3492#section-3.4\n\t * @private\n\t */\n\tfunction adapt(delta, numPoints, firstTime) {\n\t\tvar k = 0;\n\t\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\t\tdelta += floor(delta / numPoints);\n\t\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\t\tdelta = floor(delta / baseMinusTMin);\n\t\t}\n\t\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n\t}\n\n\t/**\n\t * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n\t * symbols.\n\t * @memberOf punycode\n\t * @param {String} input The Punycode string of ASCII-only symbols.\n\t * @returns {String} The resulting string of Unicode symbols.\n\t */\n\tfunction decode(input) {\n\t\t// Don't use UCS-2\n\t\tvar output = [],\n\t\t inputLength = input.length,\n\t\t out,\n\t\t i = 0,\n\t\t n = initialN,\n\t\t bias = initialBias,\n\t\t basic,\n\t\t j,\n\t\t index,\n\t\t oldi,\n\t\t w,\n\t\t k,\n\t\t digit,\n\t\t t,\n\t\t /** Cached calculation results */\n\t\t baseMinusT;\n\n\t\t// Handle the basic code points: let `basic` be the number of input code\n\t\t// points before the last delimiter, or `0` if there is none, then copy\n\t\t// the first basic code points to the output.\n\n\t\tbasic = input.lastIndexOf(delimiter);\n\t\tif (basic < 0) {\n\t\t\tbasic = 0;\n\t\t}\n\n\t\tfor (j = 0; j < basic; ++j) {\n\t\t\t// if it's not a basic code point\n\t\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\t\terror('not-basic');\n\t\t\t}\n\t\t\toutput.push(input.charCodeAt(j));\n\t\t}\n\n\t\t// Main decoding loop: start just after the last delimiter if any basic code\n\t\t// points were copied; start at the beginning otherwise.\n\n\t\tfor (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t\t// `index` is the index of the next character to be consumed.\n\t\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t\t// which gets added to `i`. The overflow checking is easier\n\t\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t\t// value at the end to obtain `delta`.\n\t\t\tfor (oldi = i, w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\t\tif (index >= inputLength) {\n\t\t\t\t\terror('invalid-input');\n\t\t\t\t}\n\n\t\t\t\tdigit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\t\tif (digit >= base || digit > floor((maxInt - i) / w)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\ti += digit * w;\n\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\t\tif (digit < t) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbaseMinusT = base - t;\n\t\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tw *= baseMinusT;\n\n\t\t\t}\n\n\t\t\tout = output.length + 1;\n\t\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t\t// incrementing `n` each time, so we'll fix that now:\n\t\t\tif (floor(i / out) > maxInt - n) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tn += floor(i / out);\n\t\t\ti %= out;\n\n\t\t\t// Insert `n` at position `i` of the output\n\t\t\toutput.splice(i++, 0, n);\n\n\t\t}\n\n\t\treturn ucs2encode(output);\n\t}\n\n\t/**\n\t * Converts a string of Unicode symbols (e.g. a domain name label) to a\n\t * Punycode string of ASCII-only symbols.\n\t * @memberOf punycode\n\t * @param {String} input The string of Unicode symbols.\n\t * @returns {String} The resulting Punycode string of ASCII-only symbols.\n\t */\n\tfunction encode(input) {\n\t\tvar n,\n\t\t delta,\n\t\t handledCPCount,\n\t\t basicLength,\n\t\t bias,\n\t\t j,\n\t\t m,\n\t\t q,\n\t\t k,\n\t\t t,\n\t\t currentValue,\n\t\t output = [],\n\t\t /** `inputLength` will hold the number of code points in `input`. */\n\t\t inputLength,\n\t\t /** Cached calculation results */\n\t\t handledCPCountPlusOne,\n\t\t baseMinusT,\n\t\t qMinusT;\n\n\t\t// Convert the input in UCS-2 to Unicode\n\t\tinput = ucs2decode(input);\n\n\t\t// Cache the length\n\t\tinputLength = input.length;\n\n\t\t// Initialize the state\n\t\tn = initialN;\n\t\tdelta = 0;\n\t\tbias = initialBias;\n\n\t\t// Handle the basic code points\n\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\tcurrentValue = input[j];\n\t\t\tif (currentValue < 0x80) {\n\t\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t\t}\n\t\t}\n\n\t\thandledCPCount = basicLength = output.length;\n\n\t\t// `handledCPCount` is the number of code points that have been handled;\n\t\t// `basicLength` is the number of basic code points.\n\n\t\t// Finish the basic string - if it is not empty - with a delimiter\n\t\tif (basicLength) {\n\t\t\toutput.push(delimiter);\n\t\t}\n\n\t\t// Main encoding loop:\n\t\twhile (handledCPCount < inputLength) {\n\n\t\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t\t// larger one:\n\t\t\tfor (m = maxInt, j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\t\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\t\tm = currentValue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t\t// but guard against overflow\n\t\t\thandledCPCountPlusOne = handledCPCount + 1;\n\t\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\t\tn = m;\n\n\t\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\n\t\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tif (currentValue == n) {\n\t\t\t\t\t// Represent delta as a generalized variable-length integer\n\t\t\t\t\tfor (q = delta, k = base; /* no condition */; k += base) {\n\t\t\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tqMinusT = q - t;\n\t\t\t\t\t\tbaseMinusT = base - t;\n\t\t\t\t\t\toutput.push(\n\t\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t\t);\n\t\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t\t}\n\n\t\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);\n\t\t\t\t\tdelta = 0;\n\t\t\t\t\t++handledCPCount;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t++delta;\n\t\t\t++n;\n\n\t\t}\n\t\treturn output.join('');\n\t}\n\n\t/**\n\t * Converts a Punycode string representing a domain name or an email address\n\t * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n\t * it doesn't matter if you call it on a string that has already been\n\t * converted to Unicode.\n\t * @memberOf punycode\n\t * @param {String} input The Punycoded domain name or email address to\n\t * convert to Unicode.\n\t * @returns {String} The Unicode representation of the given Punycode\n\t * string.\n\t */\n\tfunction toUnicode(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexPunycode.test(string)\n\t\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/**\n\t * Converts a Unicode string representing a domain name or an email address to\n\t * Punycode. Only the non-ASCII parts of the domain name will be converted,\n\t * i.e. it doesn't matter if you call it with a domain that's already in\n\t * ASCII.\n\t * @memberOf punycode\n\t * @param {String} input The domain name or email address to convert, as a\n\t * Unicode string.\n\t * @returns {String} The Punycode representation of the given domain name or\n\t * email address.\n\t */\n\tfunction toASCII(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexNonASCII.test(string)\n\t\t\t\t? 'xn--' + encode(string)\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/** Define the public API */\n\tpunycode = {\n\t\t/**\n\t\t * A string representing the current Punycode.js version number.\n\t\t * @memberOf punycode\n\t\t * @type String\n\t\t */\n\t\t'version': '1.4.1',\n\t\t/**\n\t\t * An object of methods to convert from JavaScript's internal character\n\t\t * representation (UCS-2) to Unicode code points, and back.\n\t\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t\t * @memberOf punycode\n\t\t * @type Object\n\t\t */\n\t\t'ucs2': {\n\t\t\t'decode': ucs2decode,\n\t\t\t'encode': ucs2encode\n\t\t},\n\t\t'decode': decode,\n\t\t'encode': encode,\n\t\t'toASCII': toASCII,\n\t\t'toUnicode': toUnicode\n\t};\n\n\t/** Expose `punycode` */\n\t// Some AMD build optimizers, like r.js, check for specific condition patterns\n\t// like the following:\n\tif (\n\t\ttypeof define == 'function' &&\n\t\ttypeof define.amd == 'object' &&\n\t\tdefine.amd\n\t) {\n\t\tdefine('punycode', function() {\n\t\t\treturn punycode;\n\t\t});\n\t} else if (freeExports && freeModule) {\n\t\tif (module.exports == freeExports) {\n\t\t\t// in Node.js, io.js, or RingoJS v0.8.0+\n\t\t\tfreeModule.exports = punycode;\n\t\t} else {\n\t\t\t// in Narwhal or RingoJS v0.7.0-\n\t\t\tfor (key in punycode) {\n\t\t\t\tpunycode.hasOwnProperty(key) && (freeExports[key] = punycode[key]);\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// in Rhino or a web browser\n\t\troot.punycode = punycode;\n\t}\n\n}(this));\n\n}).call(this)}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n\n},{}],44:[function(require,module,exports){\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\n'use strict';\n\n// If obj.hasOwnProperty has been overridden, then calling\n// obj.hasOwnProperty(prop) will break.\n// See: https://github.com/joyent/node/issues/1707\nfunction hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nmodule.exports = function(qs, sep, eq, options) {\n sep = sep || '&';\n eq = eq || '=';\n var obj = {};\n\n if (typeof qs !== 'string' || qs.length === 0) {\n return obj;\n }\n\n var regexp = /\\+/g;\n qs = qs.split(sep);\n\n var maxKeys = 1000;\n if (options && typeof options.maxKeys === 'number') {\n maxKeys = options.maxKeys;\n }\n\n var len = qs.length;\n // maxKeys <= 0 means that we should not limit keys count\n if (maxKeys > 0 && len > maxKeys) {\n len = maxKeys;\n }\n\n for (var i = 0; i < len; ++i) {\n var x = qs[i].replace(regexp, '%20'),\n idx = x.indexOf(eq),\n kstr, vstr, k, v;\n\n if (idx >= 0) {\n kstr = x.substr(0, idx);\n vstr = x.substr(idx + 1);\n } else {\n kstr = x;\n vstr = '';\n }\n\n k = decodeURIComponent(kstr);\n v = decodeURIComponent(vstr);\n\n if (!hasOwnProperty(obj, k)) {\n obj[k] = v;\n } else if (isArray(obj[k])) {\n obj[k].push(v);\n } else {\n obj[k] = [obj[k], v];\n }\n }\n\n return obj;\n};\n\nvar isArray = Array.isArray || function (xs) {\n return Object.prototype.toString.call(xs) === '[object Array]';\n};\n\n},{}],45:[function(require,module,exports){\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\n'use strict';\n\nvar stringifyPrimitive = function(v) {\n switch (typeof v) {\n case 'string':\n return v;\n\n case 'boolean':\n return v ? 'true' : 'false';\n\n case 'number':\n return isFinite(v) ? v : '';\n\n default:\n return '';\n }\n};\n\nmodule.exports = function(obj, sep, eq, name) {\n sep = sep || '&';\n eq = eq || '=';\n if (obj === null) {\n obj = undefined;\n }\n\n if (typeof obj === 'object') {\n return map(objectKeys(obj), function(k) {\n var ks = encodeURIComponent(stringifyPrimitive(k)) + eq;\n if (isArray(obj[k])) {\n return map(obj[k], function(v) {\n return ks + encodeURIComponent(stringifyPrimitive(v));\n }).join(sep);\n } else {\n return ks + encodeURIComponent(stringifyPrimitive(obj[k]));\n }\n }).join(sep);\n\n }\n\n if (!name) return '';\n return encodeURIComponent(stringifyPrimitive(name)) + eq +\n encodeURIComponent(stringifyPrimitive(obj));\n};\n\nvar isArray = Array.isArray || function (xs) {\n return Object.prototype.toString.call(xs) === '[object Array]';\n};\n\nfunction map (xs, f) {\n if (xs.map) return xs.map(f);\n var res = [];\n for (var i = 0; i < xs.length; i++) {\n res.push(f(xs[i], i));\n }\n return res;\n}\n\nvar objectKeys = Object.keys || function (obj) {\n var res = [];\n for (var key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) res.push(key);\n }\n return res;\n};\n\n},{}],46:[function(require,module,exports){\n'use strict';\n\nexports.decode = exports.parse = require('./decode');\nexports.encode = exports.stringify = require('./encode');\n\n},{\"./decode\":44,\"./encode\":45}],47:[function(require,module,exports){\n/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n\n},{\"buffer\":19}],48:[function(require,module,exports){\n(function (Buffer){(function (){\n/*! simple-concat. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nmodule.exports = function (stream, cb) {\n var chunks = []\n stream.on('data', function (chunk) {\n chunks.push(chunk)\n })\n stream.once('end', function () {\n if (cb) cb(null, Buffer.concat(chunks))\n cb = null\n })\n stream.once('error', function (err) {\n if (cb) cb(err)\n cb = null\n })\n}\n\n}).call(this)}).call(this,require(\"buffer\").Buffer)\n\n},{\"buffer\":19}],49:[function(require,module,exports){\n(function (Buffer){(function (){\n/*! simple-get. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nmodule.exports = simpleGet\n\nconst concat = require('simple-concat')\nconst decompressResponse = require('decompress-response') // excluded from browser build\nconst http = require('http')\nconst https = require('https')\nconst once = require('once')\nconst querystring = require('querystring')\nconst url = require('url')\n\nconst isStream = o => o !== null && typeof o === 'object' && typeof o.pipe === 'function'\n\nfunction simpleGet (opts, cb) {\n opts = Object.assign({ maxRedirects: 10 }, typeof opts === 'string' ? { url: opts } : opts)\n cb = once(cb)\n\n if (opts.url) {\n const { hostname, port, protocol, auth, path } = url.parse(opts.url) // eslint-disable-line node/no-deprecated-api\n delete opts.url\n if (!hostname && !port && !protocol && !auth) opts.path = path // Relative redirect\n else Object.assign(opts, { hostname, port, protocol, auth, path }) // Absolute redirect\n }\n\n const headers = { 'accept-encoding': 'gzip, deflate' }\n if (opts.headers) Object.keys(opts.headers).forEach(k => (headers[k.toLowerCase()] = opts.headers[k]))\n opts.headers = headers\n\n let body\n if (opts.body) {\n body = opts.json && !isStream(opts.body) ? JSON.stringify(opts.body) : opts.body\n } else if (opts.form) {\n body = typeof opts.form === 'string' ? opts.form : querystring.stringify(opts.form)\n opts.headers['content-type'] = 'application/x-www-form-urlencoded'\n }\n\n if (body) {\n if (!opts.method) opts.method = 'POST'\n if (!isStream(body)) opts.headers['content-length'] = Buffer.byteLength(body)\n if (opts.json && !opts.form) opts.headers['content-type'] = 'application/json'\n }\n delete opts.body; delete opts.form\n\n if (opts.json) opts.headers.accept = 'application/json'\n if (opts.method) opts.method = opts.method.toUpperCase()\n\n const originalHost = opts.hostname // hostname before potential redirect\n const protocol = opts.protocol === 'https:' ? https : http // Support http/https urls\n const req = protocol.request(opts, res => {\n if (opts.followRedirects !== false && res.statusCode >= 300 && res.statusCode < 400 && res.headers.location) {\n opts.url = res.headers.location // Follow 3xx redirects\n delete opts.headers.host // Discard `host` header on redirect (see #32)\n res.resume() // Discard response\n\n const redirectHost = url.parse(opts.url).hostname // eslint-disable-line node/no-deprecated-api\n // If redirected host is different than original host, drop headers to prevent cookie leak (#73)\n if (redirectHost !== null && redirectHost !== originalHost) {\n delete opts.headers.cookie\n delete opts.headers.authorization\n }\n\n if (opts.method === 'POST' && [301, 302].includes(res.statusCode)) {\n opts.method = 'GET' // On 301/302 redirect, change POST to GET (see #35)\n delete opts.headers['content-length']; delete opts.headers['content-type']\n }\n\n if (opts.maxRedirects-- === 0) return cb(new Error('too many redirects'))\n else return simpleGet(opts, cb)\n }\n\n const tryUnzip = typeof decompressResponse === 'function' && opts.method !== 'HEAD'\n cb(null, tryUnzip ? decompressResponse(res) : res)\n })\n req.on('timeout', () => {\n req.abort()\n cb(new Error('Request timed out'))\n })\n req.on('error', cb)\n\n if (isStream(body)) body.on('error', cb).pipe(req)\n else req.end(body)\n\n return req\n}\n\nsimpleGet.concat = (opts, cb) => {\n return simpleGet(opts, (err, res) => {\n if (err) return cb(err)\n concat(res, (err, data) => {\n if (err) return cb(err)\n if (opts.json) {\n try {\n data = JSON.parse(data.toString())\n } catch (err) {\n return cb(err, res, data)\n }\n }\n cb(null, res, data)\n })\n })\n}\n\n;['get', 'post', 'put', 'patch', 'head', 'delete'].forEach(method => {\n simpleGet[method] = (opts, cb) => {\n if (typeof opts === 'string') opts = { url: opts }\n return simpleGet(Object.assign({ method: method.toUpperCase() }, opts), cb)\n }\n})\n\n}).call(this)}).call(this,require(\"buffer\").Buffer)\n\n},{\"buffer\":19,\"decompress-response\":17,\"http\":50,\"https\":34,\"once\":37,\"querystring\":46,\"simple-concat\":48,\"url\":71}],50:[function(require,module,exports){\n(function (global){(function (){\nvar ClientRequest = require('./lib/request')\nvar response = require('./lib/response')\nvar extend = require('xtend')\nvar statusCodes = require('builtin-status-codes')\nvar url = require('url')\n\nvar http = exports\n\nhttp.request = function (opts, cb) {\n\tif (typeof opts === 'string')\n\t\topts = url.parse(opts)\n\telse\n\t\topts = extend(opts)\n\n\t// Normally, the page is loaded from http or https, so not specifying a protocol\n\t// will result in a (valid) protocol-relative url. However, this won't work if\n\t// the protocol is something else, like 'file:'\n\tvar defaultProtocol = global.location.protocol.search(/^https?:$/) === -1 ? 'http:' : ''\n\n\tvar protocol = opts.protocol || defaultProtocol\n\tvar host = opts.hostname || opts.host\n\tvar port = opts.port\n\tvar path = opts.path || '/'\n\n\t// Necessary for IPv6 addresses\n\tif (host && host.indexOf(':') !== -1)\n\t\thost = '[' + host + ']'\n\n\t// This may be a relative url. The browser should always be able to interpret it correctly.\n\topts.url = (host ? (protocol + '//' + host) : '') + (port ? ':' + port : '') + path\n\topts.method = (opts.method || 'GET').toUpperCase()\n\topts.headers = opts.headers || {}\n\n\t// Also valid opts.auth, opts.mode\n\n\tvar req = new ClientRequest(opts)\n\tif (cb)\n\t\treq.on('response', cb)\n\treturn req\n}\n\nhttp.get = function get (opts, cb) {\n\tvar req = http.request(opts, cb)\n\treq.end()\n\treturn req\n}\n\nhttp.ClientRequest = ClientRequest\nhttp.IncomingMessage = response.IncomingMessage\n\nhttp.Agent = function () {}\nhttp.Agent.defaultMaxSockets = 4\n\nhttp.globalAgent = new http.Agent()\n\nhttp.STATUS_CODES = statusCodes\n\nhttp.METHODS = [\n\t'CHECKOUT',\n\t'CONNECT',\n\t'COPY',\n\t'DELETE',\n\t'GET',\n\t'HEAD',\n\t'LOCK',\n\t'M-SEARCH',\n\t'MERGE',\n\t'MKACTIVITY',\n\t'MKCOL',\n\t'MOVE',\n\t'NOTIFY',\n\t'OPTIONS',\n\t'PATCH',\n\t'POST',\n\t'PROPFIND',\n\t'PROPPATCH',\n\t'PURGE',\n\t'PUT',\n\t'REPORT',\n\t'SEARCH',\n\t'SUBSCRIBE',\n\t'TRACE',\n\t'UNLOCK',\n\t'UNSUBSCRIBE'\n]\n}).call(this)}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n\n},{\"./lib/request\":52,\"./lib/response\":53,\"builtin-status-codes\":20,\"url\":71,\"xtend\":75}],51:[function(require,module,exports){\n(function (global){(function (){\nexports.fetch = isFunction(global.fetch) && isFunction(global.ReadableStream)\n\nexports.writableStream = isFunction(global.WritableStream)\n\nexports.abortController = isFunction(global.AbortController)\n\n// The xhr request to example.com may violate some restrictive CSP configurations,\n// so if we're running in a browser that supports `fetch`, avoid calling getXHR()\n// and assume support for certain features below.\nvar xhr\nfunction getXHR () {\n\t// Cache the xhr value\n\tif (xhr !== undefined) return xhr\n\n\tif (global.XMLHttpRequest) {\n\t\txhr = new global.XMLHttpRequest()\n\t\t// If XDomainRequest is available (ie only, where xhr might not work\n\t\t// cross domain), use the page location. Otherwise use example.com\n\t\t// Note: this doesn't actually make an http request.\n\t\ttry {\n\t\t\txhr.open('GET', global.XDomainRequest ? '/' : 'https://example.com')\n\t\t} catch(e) {\n\t\t\txhr = null\n\t\t}\n\t} else {\n\t\t// Service workers don't have XHR\n\t\txhr = null\n\t}\n\treturn xhr\n}\n\nfunction checkTypeSupport (type) {\n\tvar xhr = getXHR()\n\tif (!xhr) return false\n\ttry {\n\t\txhr.responseType = type\n\t\treturn xhr.responseType === type\n\t} catch (e) {}\n\treturn false\n}\n\n// If fetch is supported, then arraybuffer will be supported too. Skip calling\n// checkTypeSupport(), since that calls getXHR().\nexports.arraybuffer = exports.fetch || checkTypeSupport('arraybuffer')\n\n// These next two tests unavoidably show warnings in Chrome. Since fetch will always\n// be used if it's available, just return false for these to avoid the warnings.\nexports.msstream = !exports.fetch && checkTypeSupport('ms-stream')\nexports.mozchunkedarraybuffer = !exports.fetch && checkTypeSupport('moz-chunked-arraybuffer')\n\n// If fetch is supported, then overrideMimeType will be supported too. Skip calling\n// getXHR().\nexports.overrideMimeType = exports.fetch || (getXHR() ? isFunction(getXHR().overrideMimeType) : false)\n\nfunction isFunction (value) {\n\treturn typeof value === 'function'\n}\n\nxhr = null // Help gc\n\n}).call(this)}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n\n},{}],52:[function(require,module,exports){\n(function (process,global,Buffer){(function (){\nvar capability = require('./capability')\nvar inherits = require('inherits')\nvar response = require('./response')\nvar stream = require('readable-stream')\n\nvar IncomingMessage = response.IncomingMessage\nvar rStates = response.readyStates\n\nfunction decideMode (preferBinary, useFetch) {\n\tif (capability.fetch && useFetch) {\n\t\treturn 'fetch'\n\t} else if (capability.mozchunkedarraybuffer) {\n\t\treturn 'moz-chunked-arraybuffer'\n\t} else if (capability.msstream) {\n\t\treturn 'ms-stream'\n\t} else if (capability.arraybuffer && preferBinary) {\n\t\treturn 'arraybuffer'\n\t} else {\n\t\treturn 'text'\n\t}\n}\n\nvar ClientRequest = module.exports = function (opts) {\n\tvar self = this\n\tstream.Writable.call(self)\n\n\tself._opts = opts\n\tself._body = []\n\tself._headers = {}\n\tif (opts.auth)\n\t\tself.setHeader('Authorization', 'Basic ' + Buffer.from(opts.auth).toString('base64'))\n\tObject.keys(opts.headers).forEach(function (name) {\n\t\tself.setHeader(name, opts.headers[name])\n\t})\n\n\tvar preferBinary\n\tvar useFetch = true\n\tif (opts.mode === 'disable-fetch' || ('requestTimeout' in opts && !capability.abortController)) {\n\t\t// If the use of XHR should be preferred. Not typically needed.\n\t\tuseFetch = false\n\t\tpreferBinary = true\n\t} else if (opts.mode === 'prefer-streaming') {\n\t\t// If streaming is a high priority but binary compatibility and\n\t\t// the accuracy of the 'content-type' header aren't\n\t\tpreferBinary = false\n\t} else if (opts.mode === 'allow-wrong-content-type') {\n\t\t// If streaming is more important than preserving the 'content-type' header\n\t\tpreferBinary = !capability.overrideMimeType\n\t} else if (!opts.mode || opts.mode === 'default' || opts.mode === 'prefer-fast') {\n\t\t// Use binary if text streaming may corrupt data or the content-type header, or for speed\n\t\tpreferBinary = true\n\t} else {\n\t\tthrow new Error('Invalid value for opts.mode')\n\t}\n\tself._mode = decideMode(preferBinary, useFetch)\n\tself._fetchTimer = null\n\tself._socketTimeout = null\n\tself._socketTimer = null\n\n\tself.on('finish', function () {\n\t\tself._onFinish()\n\t})\n}\n\ninherits(ClientRequest, stream.Writable)\n\nClientRequest.prototype.setHeader = function (name, value) {\n\tvar self = this\n\tvar lowerName = name.toLowerCase()\n\t// This check is not necessary, but it prevents warnings from browsers about setting unsafe\n\t// headers. To be honest I'm not entirely sure hiding these warnings is a good thing, but\n\t// http-browserify did it, so I will too.\n\tif (unsafeHeaders.indexOf(lowerName) !== -1)\n\t\treturn\n\n\tself._headers[lowerName] = {\n\t\tname: name,\n\t\tvalue: value\n\t}\n}\n\nClientRequest.prototype.getHeader = function (name) {\n\tvar header = this._headers[name.toLowerCase()]\n\tif (header)\n\t\treturn header.value\n\treturn null\n}\n\nClientRequest.prototype.removeHeader = function (name) {\n\tvar self = this\n\tdelete self._headers[name.toLowerCase()]\n}\n\nClientRequest.prototype._onFinish = function () {\n\tvar self = this\n\n\tif (self._destroyed)\n\t\treturn\n\tvar opts = self._opts\n\n\tif ('timeout' in opts && opts.timeout !== 0) {\n\t\tself.setTimeout(opts.timeout)\n\t}\n\n\tvar headersObj = self._headers\n\tvar body = null\n\tif (opts.method !== 'GET' && opts.method !== 'HEAD') {\n body = new Blob(self._body, {\n type: (headersObj['content-type'] || {}).value || ''\n });\n }\n\n\t// create flattened list of headers\n\tvar headersList = []\n\tObject.keys(headersObj).forEach(function (keyName) {\n\t\tvar name = headersObj[keyName].name\n\t\tvar value = headersObj[keyName].value\n\t\tif (Array.isArray(value)) {\n\t\t\tvalue.forEach(function (v) {\n\t\t\t\theadersList.push([name, v])\n\t\t\t})\n\t\t} else {\n\t\t\theadersList.push([name, value])\n\t\t}\n\t})\n\n\tif (self._mode === 'fetch') {\n\t\tvar signal = null\n\t\tif (capability.abortController) {\n\t\t\tvar controller = new AbortController()\n\t\t\tsignal = controller.signal\n\t\t\tself._fetchAbortController = controller\n\n\t\t\tif ('requestTimeout' in opts && opts.requestTimeout !== 0) {\n\t\t\t\tself._fetchTimer = global.setTimeout(function () {\n\t\t\t\t\tself.emit('requestTimeout')\n\t\t\t\t\tif (self._fetchAbortController)\n\t\t\t\t\t\tself._fetchAbortController.abort()\n\t\t\t\t}, opts.requestTimeout)\n\t\t\t}\n\t\t}\n\n\t\tglobal.fetch(self._opts.url, {\n\t\t\tmethod: self._opts.method,\n\t\t\theaders: headersList,\n\t\t\tbody: body || undefined,\n\t\t\tmode: 'cors',\n\t\t\tcredentials: opts.withCredentials ? 'include' : 'same-origin',\n\t\t\tsignal: signal\n\t\t}).then(function (response) {\n\t\t\tself._fetchResponse = response\n\t\t\tself._resetTimers(false)\n\t\t\tself._connect()\n\t\t}, function (reason) {\n\t\t\tself._resetTimers(true)\n\t\t\tif (!self._destroyed)\n\t\t\t\tself.emit('error', reason)\n\t\t})\n\t} else {\n\t\tvar xhr = self._xhr = new global.XMLHttpRequest()\n\t\ttry {\n\t\t\txhr.open(self._opts.method, self._opts.url, true)\n\t\t} catch (err) {\n\t\t\tprocess.nextTick(function () {\n\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t\treturn\n\t\t}\n\n\t\t// Can't set responseType on really old browsers\n\t\tif ('responseType' in xhr)\n\t\t\txhr.responseType = self._mode\n\n\t\tif ('withCredentials' in xhr)\n\t\t\txhr.withCredentials = !!opts.withCredentials\n\n\t\tif (self._mode === 'text' && 'overrideMimeType' in xhr)\n\t\t\txhr.overrideMimeType('text/plain; charset=x-user-defined')\n\n\t\tif ('requestTimeout' in opts) {\n\t\t\txhr.timeout = opts.requestTimeout\n\t\t\txhr.ontimeout = function () {\n\t\t\t\tself.emit('requestTimeout')\n\t\t\t}\n\t\t}\n\n\t\theadersList.forEach(function (header) {\n\t\t\txhr.setRequestHeader(header[0], header[1])\n\t\t})\n\n\t\tself._response = null\n\t\txhr.onreadystatechange = function () {\n\t\t\tswitch (xhr.readyState) {\n\t\t\t\tcase rStates.LOADING:\n\t\t\t\tcase rStates.DONE:\n\t\t\t\t\tself._onXHRProgress()\n\t\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\t// Necessary for streaming in Firefox, since xhr.response is ONLY defined\n\t\t// in onprogress, not in onreadystatechange with xhr.readyState = 3\n\t\tif (self._mode === 'moz-chunked-arraybuffer') {\n\t\t\txhr.onprogress = function () {\n\t\t\t\tself._onXHRProgress()\n\t\t\t}\n\t\t}\n\n\t\txhr.onerror = function () {\n\t\t\tif (self._destroyed)\n\t\t\t\treturn\n\t\t\tself._resetTimers(true)\n\t\t\tself.emit('error', new Error('XHR error'))\n\t\t}\n\n\t\ttry {\n\t\t\txhr.send(body)\n\t\t} catch (err) {\n\t\t\tprocess.nextTick(function () {\n\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t\treturn\n\t\t}\n\t}\n}\n\n/**\n * Checks if xhr.status is readable and non-zero, indicating no error.\n * Even though the spec says it should be available in readyState 3,\n * accessing it throws an exception in IE8\n */\nfunction statusValid (xhr) {\n\ttry {\n\t\tvar status = xhr.status\n\t\treturn (status !== null && status !== 0)\n\t} catch (e) {\n\t\treturn false\n\t}\n}\n\nClientRequest.prototype._onXHRProgress = function () {\n\tvar self = this\n\n\tself._resetTimers(false)\n\n\tif (!statusValid(self._xhr) || self._destroyed)\n\t\treturn\n\n\tif (!self._response)\n\t\tself._connect()\n\n\tself._response._onXHRProgress(self._resetTimers.bind(self))\n}\n\nClientRequest.prototype._connect = function () {\n\tvar self = this\n\n\tif (self._destroyed)\n\t\treturn\n\n\tself._response = new IncomingMessage(self._xhr, self._fetchResponse, self._mode, self._resetTimers.bind(self))\n\tself._response.on('error', function(err) {\n\t\tself.emit('error', err)\n\t})\n\n\tself.emit('response', self._response)\n}\n\nClientRequest.prototype._write = function (chunk, encoding, cb) {\n\tvar self = this\n\n\tself._body.push(chunk)\n\tcb()\n}\n\nClientRequest.prototype._resetTimers = function (done) {\n\tvar self = this\n\n\tglobal.clearTimeout(self._socketTimer)\n\tself._socketTimer = null\n\n\tif (done) {\n\t\tglobal.clearTimeout(self._fetchTimer)\n\t\tself._fetchTimer = null\n\t} else if (self._socketTimeout) {\n\t\tself._socketTimer = global.setTimeout(function () {\n\t\t\tself.emit('timeout')\n\t\t}, self._socketTimeout)\n\t}\n}\n\nClientRequest.prototype.abort = ClientRequest.prototype.destroy = function (err) {\n\tvar self = this\n\tself._destroyed = true\n\tself._resetTimers(true)\n\tif (self._response)\n\t\tself._response._destroyed = true\n\tif (self._xhr)\n\t\tself._xhr.abort()\n\telse if (self._fetchAbortController)\n\t\tself._fetchAbortController.abort()\n\n\tif (err)\n\t\tself.emit('error', err)\n}\n\nClientRequest.prototype.end = function (data, encoding, cb) {\n\tvar self = this\n\tif (typeof data === 'function') {\n\t\tcb = data\n\t\tdata = undefined\n\t}\n\n\tstream.Writable.prototype.end.call(self, data, encoding, cb)\n}\n\nClientRequest.prototype.setTimeout = function (timeout, cb) {\n\tvar self = this\n\n\tif (cb)\n\t\tself.once('timeout', cb)\n\n\tself._socketTimeout = timeout\n\tself._resetTimers(false)\n}\n\nClientRequest.prototype.flushHeaders = function () {}\nClientRequest.prototype.setNoDelay = function () {}\nClientRequest.prototype.setSocketKeepAlive = function () {}\n\n// Taken from http://www.w3.org/TR/XMLHttpRequest/#the-setrequestheader%28%29-method\nvar unsafeHeaders = [\n\t'accept-charset',\n\t'accept-encoding',\n\t'access-control-request-headers',\n\t'access-control-request-method',\n\t'connection',\n\t'content-length',\n\t'cookie',\n\t'cookie2',\n\t'date',\n\t'dnt',\n\t'expect',\n\t'host',\n\t'keep-alive',\n\t'origin',\n\t'referer',\n\t'te',\n\t'trailer',\n\t'transfer-encoding',\n\t'upgrade',\n\t'via'\n]\n\n}).call(this)}).call(this,require('_process'),typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {},require(\"buffer\").Buffer)\n\n},{\"./capability\":51,\"./response\":53,\"_process\":42,\"buffer\":19,\"inherits\":36,\"readable-stream\":68}],53:[function(require,module,exports){\n(function (process,global,Buffer){(function (){\nvar capability = require('./capability')\nvar inherits = require('inherits')\nvar stream = require('readable-stream')\n\nvar rStates = exports.readyStates = {\n\tUNSENT: 0,\n\tOPENED: 1,\n\tHEADERS_RECEIVED: 2,\n\tLOADING: 3,\n\tDONE: 4\n}\n\nvar IncomingMessage = exports.IncomingMessage = function (xhr, response, mode, resetTimers) {\n\tvar self = this\n\tstream.Readable.call(self)\n\n\tself._mode = mode\n\tself.headers = {}\n\tself.rawHeaders = []\n\tself.trailers = {}\n\tself.rawTrailers = []\n\n\t// Fake the 'close' event, but only once 'end' fires\n\tself.on('end', function () {\n\t\t// The nextTick is necessary to prevent the 'request' module from causing an infinite loop\n\t\tprocess.nextTick(function () {\n\t\t\tself.emit('close')\n\t\t})\n\t})\n\n\tif (mode === 'fetch') {\n\t\tself._fetchResponse = response\n\n\t\tself.url = response.url\n\t\tself.statusCode = response.status\n\t\tself.statusMessage = response.statusText\n\t\t\n\t\tresponse.headers.forEach(function (header, key){\n\t\t\tself.headers[key.toLowerCase()] = header\n\t\t\tself.rawHeaders.push(key, header)\n\t\t})\n\n\t\tif (capability.writableStream) {\n\t\t\tvar writable = new WritableStream({\n\t\t\t\twrite: function (chunk) {\n\t\t\t\t\tresetTimers(false)\n\t\t\t\t\treturn new Promise(function (resolve, reject) {\n\t\t\t\t\t\tif (self._destroyed) {\n\t\t\t\t\t\t\treject()\n\t\t\t\t\t\t} else if(self.push(Buffer.from(chunk))) {\n\t\t\t\t\t\t\tresolve()\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tself._resumeFetch = resolve\n\t\t\t\t\t\t}\n\t\t\t\t\t})\n\t\t\t\t},\n\t\t\t\tclose: function () {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.push(null)\n\t\t\t\t},\n\t\t\t\tabort: function (err) {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.emit('error', err)\n\t\t\t\t}\n\t\t\t})\n\n\t\t\ttry {\n\t\t\t\tresponse.body.pipeTo(writable).catch(function (err) {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.emit('error', err)\n\t\t\t\t})\n\t\t\t\treturn\n\t\t\t} catch (e) {} // pipeTo method isn't defined. Can't find a better way to feature test this\n\t\t}\n\t\t// fallback for when writableStream or pipeTo aren't available\n\t\tvar reader = response.body.getReader()\n\t\tfunction read () {\n\t\t\treader.read().then(function (result) {\n\t\t\t\tif (self._destroyed)\n\t\t\t\t\treturn\n\t\t\t\tresetTimers(result.done)\n\t\t\t\tif (result.done) {\n\t\t\t\t\tself.push(null)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tself.push(Buffer.from(result.value))\n\t\t\t\tread()\n\t\t\t}).catch(function (err) {\n\t\t\t\tresetTimers(true)\n\t\t\t\tif (!self._destroyed)\n\t\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t}\n\t\tread()\n\t} else {\n\t\tself._xhr = xhr\n\t\tself._pos = 0\n\n\t\tself.url = xhr.responseURL\n\t\tself.statusCode = xhr.status\n\t\tself.statusMessage = xhr.statusText\n\t\tvar headers = xhr.getAllResponseHeaders().split(/\\r?\\n/)\n\t\theaders.forEach(function (header) {\n\t\t\tvar matches = header.match(/^([^:]+):\\s*(.*)/)\n\t\t\tif (matches) {\n\t\t\t\tvar key = matches[1].toLowerCase()\n\t\t\t\tif (key === 'set-cookie') {\n\t\t\t\t\tif (self.headers[key] === undefined) {\n\t\t\t\t\t\tself.headers[key] = []\n\t\t\t\t\t}\n\t\t\t\t\tself.headers[key].push(matches[2])\n\t\t\t\t} else if (self.headers[key] !== undefined) {\n\t\t\t\t\tself.headers[key] += ', ' + matches[2]\n\t\t\t\t} else {\n\t\t\t\t\tself.headers[key] = matches[2]\n\t\t\t\t}\n\t\t\t\tself.rawHeaders.push(matches[1], matches[2])\n\t\t\t}\n\t\t})\n\n\t\tself._charset = 'x-user-defined'\n\t\tif (!capability.overrideMimeType) {\n\t\t\tvar mimeType = self.rawHeaders['mime-type']\n\t\t\tif (mimeType) {\n\t\t\t\tvar charsetMatch = mimeType.match(/;\\s*charset=([^;])(;|$)/)\n\t\t\t\tif (charsetMatch) {\n\t\t\t\t\tself._charset = charsetMatch[1].toLowerCase()\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!self._charset)\n\t\t\t\tself._charset = 'utf-8' // best guess\n\t\t}\n\t}\n}\n\ninherits(IncomingMessage, stream.Readable)\n\nIncomingMessage.prototype._read = function () {\n\tvar self = this\n\n\tvar resolve = self._resumeFetch\n\tif (resolve) {\n\t\tself._resumeFetch = null\n\t\tresolve()\n\t}\n}\n\nIncomingMessage.prototype._onXHRProgress = function (resetTimers) {\n\tvar self = this\n\n\tvar xhr = self._xhr\n\n\tvar response = null\n\tswitch (self._mode) {\n\t\tcase 'text':\n\t\t\tresponse = xhr.responseText\n\t\t\tif (response.length > self._pos) {\n\t\t\t\tvar newData = response.substr(self._pos)\n\t\t\t\tif (self._charset === 'x-user-defined') {\n\t\t\t\t\tvar buffer = Buffer.alloc(newData.length)\n\t\t\t\t\tfor (var i = 0; i < newData.length; i++)\n\t\t\t\t\t\tbuffer[i] = newData.charCodeAt(i) & 0xff\n\n\t\t\t\t\tself.push(buffer)\n\t\t\t\t} else {\n\t\t\t\t\tself.push(newData, self._charset)\n\t\t\t\t}\n\t\t\t\tself._pos = response.length\n\t\t\t}\n\t\t\tbreak\n\t\tcase 'arraybuffer':\n\t\t\tif (xhr.readyState !== rStates.DONE || !xhr.response)\n\t\t\t\tbreak\n\t\t\tresponse = xhr.response\n\t\t\tself.push(Buffer.from(new Uint8Array(response)))\n\t\t\tbreak\n\t\tcase 'moz-chunked-arraybuffer': // take whole\n\t\t\tresponse = xhr.response\n\t\t\tif (xhr.readyState !== rStates.LOADING || !response)\n\t\t\t\tbreak\n\t\t\tself.push(Buffer.from(new Uint8Array(response)))\n\t\t\tbreak\n\t\tcase 'ms-stream':\n\t\t\tresponse = xhr.response\n\t\t\tif (xhr.readyState !== rStates.LOADING)\n\t\t\t\tbreak\n\t\t\tvar reader = new global.MSStreamReader()\n\t\t\treader.onprogress = function () {\n\t\t\t\tif (reader.result.byteLength > self._pos) {\n\t\t\t\t\tself.push(Buffer.from(new Uint8Array(reader.result.slice(self._pos))))\n\t\t\t\t\tself._pos = reader.result.byteLength\n\t\t\t\t}\n\t\t\t}\n\t\t\treader.onload = function () {\n\t\t\t\tresetTimers(true)\n\t\t\t\tself.push(null)\n\t\t\t}\n\t\t\t// reader.onerror = ??? // TODO: this\n\t\t\treader.readAsArrayBuffer(response)\n\t\t\tbreak\n\t}\n\n\t// The ms-stream case handles end separately in reader.onload()\n\tif (self._xhr.readyState === rStates.DONE && self._mode !== 'ms-stream') {\n\t\tresetTimers(true)\n\t\tself.push(null)\n\t}\n}\n\n}).call(this)}).call(this,require('_process'),typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {},require(\"buffer\").Buffer)\n\n},{\"./capability\":51,\"_process\":42,\"buffer\":19,\"inherits\":36,\"readable-stream\":68}],54:[function(require,module,exports){\n'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inheritsLoose(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n }\n\n return NodeError;\n }(Base);\n\n NodeError.prototype.name = Base.name;\n NodeError.prototype.code = code;\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n // determiner: 'must be' or 'must not be'\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n }\n\n msg += \". Received type \".concat(typeof actual);\n return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\n\n},{}],55:[function(require,module,exports){\n(function (process){(function (){\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\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n\n'use strict';\n\n/*<replacement>*/\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n for (var key in obj) keys.push(key);\n return keys;\n};\n/*</replacement>*/\n\nmodule.exports = Duplex;\nvar Readable = require('./_stream_readable');\nvar Writable = require('./_stream_writable');\nrequire('inherits')(Duplex, Readable);\n{\n // Allow the keys array to be GC'ed.\n var keys = objectKeys(Writable.prototype);\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n Readable.call(this, options);\n Writable.call(this, options);\n this.allowHalfOpen = true;\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\n}\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\n\n// the no-half-open enforcer\nfunction onend() {\n // If the writable side ended, then we're ok.\n if (this._writableState.ended) return;\n\n // no more data can be written.\n // But allow more writes to happen in this tick.\n process.nextTick(onEndNT, this);\n}\nfunction onEndNT(self) {\n self.end();\n}\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n});\n}).call(this)}).call(this,require('_process'))\n\n},{\"./_stream_readable\":57,\"./_stream_writable\":59,\"_process\":42,\"inherits\":36}],56:[function(require,module,exports){\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\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n\n'use strict';\n\nmodule.exports = PassThrough;\nvar Transform = require('./_stream_transform');\nrequire('inherits')(PassThrough, Transform);\nfunction PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n Transform.call(this, options);\n}\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n cb(null, chunk);\n};\n},{\"./_stream_transform\":58,\"inherits\":36}],57:[function(require,module,exports){\n(function (process,global){(function (){\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\n'use strict';\n\nmodule.exports = Readable;\n\n/*<replacement>*/\nvar Duplex;\n/*</replacement>*/\n\nReadable.ReadableState = ReadableState;\n\n/*<replacement>*/\nvar EE = require('events').EventEmitter;\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n return emitter.listeners(type).length;\n};\n/*</replacement>*/\n\n/*<replacement>*/\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\n/*<replacement>*/\nvar debugUtil = require('util');\nvar debug;\nif (debugUtil && debugUtil.debuglog) {\n debug = debugUtil.debuglog('stream');\n} else {\n debug = function debug() {};\n}\n/*</replacement>*/\n\nvar BufferList = require('./internal/streams/buffer_list');\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;\n\n// Lazy loaded to improve the startup performance.\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\nrequire('inherits')(Readable, Stream);\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\nfunction prependListener(emitter, event, fn) {\n // Sadly this is not cacheable as some libraries bundle their own\n // event emitter implementation with them.\n if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn);\n\n // This is a hack to make sure that our error handler is attached before any\n // userland ones. NEVER DO THIS. This is here only because this code needs\n // to continue to work with older versions of Node.js that do not include\n // the prependListener() method. The goal is to eventually remove this hack.\n if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\nfunction ReadableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag. Used to make read(n) ignore n and to\n // make all the buffer merging and length checks go away\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode;\n\n // the point at which it stops calling _read() to fill the buffer\n // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex);\n\n // A linked list is used to store data chunks instead of an array because the\n // linked list can remove elements from the beginning faster than\n // array.shift()\n this.buffer = new BufferList();\n this.length = 0;\n this.pipes = null;\n this.pipesCount = 0;\n this.flowing = null;\n this.ended = false;\n this.endEmitted = false;\n this.reading = false;\n\n // a flag to be able to tell if the event 'readable'/'data' is emitted\n // immediately, or on a later tick. We set this to true at first, because\n // any actions that shouldn't happen until \"later\" should generally also\n // not happen before the first read call.\n this.sync = true;\n\n // whenever we return null, then we set a flag to say\n // that we're awaiting a 'readable' event emission.\n this.needReadable = false;\n this.emittedReadable = false;\n this.readableListening = false;\n this.resumeScheduled = false;\n this.paused = true;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'end' (and potentially 'finish')\n this.autoDestroy = !!options.autoDestroy;\n\n // has it been destroyed\n this.destroyed = false;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // the number of writers that are awaiting a drain event in .pipe()s\n this.awaitDrain = 0;\n\n // if true, a maybeReadMore has been scheduled\n this.readingMore = false;\n this.decoder = null;\n this.encoding = null;\n if (options.encoding) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this.decoder = new StringDecoder(options.encoding);\n this.encoding = options.encoding;\n }\n}\nfunction Readable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n if (!(this instanceof Readable)) return new Readable(options);\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the ReadableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n this._readableState = new ReadableState(options, this, isDuplex);\n\n // legacy\n this.readable = true;\n if (options) {\n if (typeof options.read === 'function') this._read = options.read;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n }\n Stream.call(this);\n}\nObject.defineProperty(Readable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined) {\n return false;\n }\n return this._readableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._readableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\nReadable.prototype._destroy = function (err, cb) {\n cb(err);\n};\n\n// Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\nReadable.prototype.push = function (chunk, encoding) {\n var state = this._readableState;\n var skipChunkCheck;\n if (!state.objectMode) {\n if (typeof chunk === 'string') {\n encoding = encoding || state.defaultEncoding;\n if (encoding !== state.encoding) {\n chunk = Buffer.from(chunk, encoding);\n encoding = '';\n }\n skipChunkCheck = true;\n }\n } else {\n skipChunkCheck = true;\n }\n return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n};\n\n// Unshift should *always* be something directly out of read()\nReadable.prototype.unshift = function (chunk) {\n return readableAddChunk(this, chunk, null, true, false);\n};\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n debug('readableAddChunk', chunk);\n var state = stream._readableState;\n if (chunk === null) {\n state.reading = false;\n onEofChunk(stream, state);\n } else {\n var er;\n if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n if (er) {\n errorOrDestroy(stream, er);\n } else if (state.objectMode || chunk && chunk.length > 0) {\n if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (addToFront) {\n if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n } else if (state.destroyed) {\n return false;\n } else {\n state.reading = false;\n if (state.decoder && !encoding) {\n chunk = state.decoder.write(chunk);\n if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n } else {\n addChunk(stream, state, chunk, false);\n }\n }\n } else if (!addToFront) {\n state.reading = false;\n maybeReadMore(stream, state);\n }\n }\n\n // We can push more data if we are below the highWaterMark.\n // Also, if we have no data yet, we can stand some more bytes.\n // This is to work around cases where hwm=0, such as the repl.\n return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n state.awaitDrain = 0;\n stream.emit('data', chunk);\n } else {\n // update the buffer info.\n state.length += state.objectMode ? 1 : chunk.length;\n if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n if (state.needReadable) emitReadable(stream);\n }\n maybeReadMore(stream, state);\n}\nfunction chunkInvalid(state, chunk) {\n var er;\n if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n }\n return er;\n}\nReadable.prototype.isPaused = function () {\n return this._readableState.flowing === false;\n};\n\n// backwards compatibility.\nReadable.prototype.setEncoding = function (enc) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n var decoder = new StringDecoder(enc);\n this._readableState.decoder = decoder;\n // If setEncoding(null), decoder.encoding equals utf8\n this._readableState.encoding = this._readableState.decoder.encoding;\n\n // Iterate over current buffer to convert already stored Buffers:\n var p = this._readableState.buffer.head;\n var content = '';\n while (p !== null) {\n content += decoder.write(p.data);\n p = p.next;\n }\n this._readableState.buffer.clear();\n if (content !== '') this._readableState.buffer.push(content);\n this._readableState.length = content.length;\n return this;\n};\n\n// Don't raise the hwm > 1GB\nvar MAX_HWM = 0x40000000;\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\n n = MAX_HWM;\n } else {\n // Get the next highest power of 2 to prevent increasing hwm excessively in\n // tiny amounts\n n--;\n n |= n >>> 1;\n n |= n >>> 2;\n n |= n >>> 4;\n n |= n >>> 8;\n n |= n >>> 16;\n n++;\n }\n return n;\n}\n\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction howMuchToRead(n, state) {\n if (n <= 0 || state.length === 0 && state.ended) return 0;\n if (state.objectMode) return 1;\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n }\n // If we're asking for more than the current hwm, then raise the hwm.\n if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n;\n // Don't have enough\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n return state.length;\n}\n\n// you can override either this method, or the async _read(n) below.\nReadable.prototype.read = function (n) {\n debug('read', n);\n n = parseInt(n, 10);\n var state = this._readableState;\n var nOrig = n;\n if (n !== 0) state.emittedReadable = false;\n\n // if we're doing read(0) to trigger a readable event, but we\n // already have a bunch of data in the buffer, then just trigger\n // the 'readable' event and move on.\n if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) {\n debug('read: emitReadable', state.length, state.ended);\n if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n return null;\n }\n n = howMuchToRead(n, state);\n\n // if we've ended, and we're now clear, then finish it up.\n if (n === 0 && state.ended) {\n if (state.length === 0) endReadable(this);\n return null;\n }\n\n // All the actual chunk generation logic needs to be\n // *below* the call to _read. The reason is that in certain\n // synthetic stream cases, such as passthrough streams, _read\n // may be a completely synchronous operation which may change\n // the state of the read buffer, providing enough data when\n // before there was *not* enough.\n //\n // So, the steps are:\n // 1. Figure out what the state of things will be after we do\n // a read from the buffer.\n //\n // 2. If that resulting state will trigger a _read, then call _read.\n // Note that this may be asynchronous, or synchronous. Yes, it is\n // deeply ugly to write APIs this way, but that still doesn't mean\n // that the Readable class should behave improperly, as streams are\n // designed to be sync/async agnostic.\n // Take note if the _read call is sync or async (ie, if the read call\n // has returned yet), so that we know whether or not it's safe to emit\n // 'readable' etc.\n //\n // 3. Actually pull the requested chunks out of the buffer and return.\n\n // if we need a readable event, then we need to do some reading.\n var doRead = state.needReadable;\n debug('need readable', doRead);\n\n // if we currently have less than the highWaterMark, then also read some\n if (state.length === 0 || state.length - n < state.highWaterMark) {\n doRead = true;\n debug('length less than watermark', doRead);\n }\n\n // however, if we've ended, then there's no point, and if we're already\n // reading, then it's unnecessary.\n if (state.ended || state.reading) {\n doRead = false;\n debug('reading or ended', doRead);\n } else if (doRead) {\n debug('do read');\n state.reading = true;\n state.sync = true;\n // if the length is currently zero, then we *need* a readable event.\n if (state.length === 0) state.needReadable = true;\n // call internal read method\n this._read(state.highWaterMark);\n state.sync = false;\n // If _read pushed data synchronously, then `reading` will be false,\n // and we need to re-evaluate how much data we can return to the user.\n if (!state.reading) n = howMuchToRead(nOrig, state);\n }\n var ret;\n if (n > 0) ret = fromList(n, state);else ret = null;\n if (ret === null) {\n state.needReadable = state.length <= state.highWaterMark;\n n = 0;\n } else {\n state.length -= n;\n state.awaitDrain = 0;\n }\n if (state.length === 0) {\n // If we have nothing in the buffer, then we want to know\n // as soon as we *do* get something into the buffer.\n if (!state.ended) state.needReadable = true;\n\n // If we tried to read() past the EOF, then emit end on the next tick.\n if (nOrig !== n && state.ended) endReadable(this);\n }\n if (ret !== null) this.emit('data', ret);\n return ret;\n};\nfunction onEofChunk(stream, state) {\n debug('onEofChunk');\n if (state.ended) return;\n if (state.decoder) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) {\n state.buffer.push(chunk);\n state.length += state.objectMode ? 1 : chunk.length;\n }\n }\n state.ended = true;\n if (state.sync) {\n // if we are sync, wait until next tick to emit the data.\n // Otherwise we risk emitting data in the flow()\n // the readable code triggers during a read() call\n emitReadable(stream);\n } else {\n // emit 'readable' now to make sure it gets picked up.\n state.needReadable = false;\n if (!state.emittedReadable) {\n state.emittedReadable = true;\n emitReadable_(stream);\n }\n }\n}\n\n// Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow. This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\nfunction emitReadable(stream) {\n var state = stream._readableState;\n debug('emitReadable', state.needReadable, state.emittedReadable);\n state.needReadable = false;\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n process.nextTick(emitReadable_, stream);\n }\n}\nfunction emitReadable_(stream) {\n var state = stream._readableState;\n debug('emitReadable_', state.destroyed, state.length, state.ended);\n if (!state.destroyed && (state.length || state.ended)) {\n stream.emit('readable');\n state.emittedReadable = false;\n }\n\n // The stream needs another readable event if\n // 1. It is not flowing, as the flow mechanism will take\n // care of it.\n // 2. It is not ended.\n // 3. It is below the highWaterMark, so we can schedule\n // another readable later.\n state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\n flow(stream);\n}\n\n// at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data. that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\nfunction maybeReadMore(stream, state) {\n if (!state.readingMore) {\n state.readingMore = true;\n process.nextTick(maybeReadMore_, stream, state);\n }\n}\nfunction maybeReadMore_(stream, state) {\n // Attempt to read more data if we should.\n //\n // The conditions for reading more data are (one of):\n // - Not enough data buffered (state.length < state.highWaterMark). The loop\n // is responsible for filling the buffer with enough data if such data\n // is available. If highWaterMark is 0 and we are not in the flowing mode\n // we should _not_ attempt to buffer any extra data. We'll get more data\n // when the stream consumer calls read() instead.\n // - No data in the buffer, and the stream is in flowing mode. In this mode\n // the loop below is responsible for ensuring read() is called. Failing to\n // call read here would abort the flow and there's no other mechanism for\n // continuing the flow if the stream consumer has just subscribed to the\n // 'data' event.\n //\n // In addition to the above conditions to keep reading data, the following\n // conditions prevent the data from being read:\n // - The stream has ended (state.ended).\n // - There is already a pending 'read' operation (state.reading). This is a\n // case where the the stream has called the implementation defined _read()\n // method, but they are processing the call asynchronously and have _not_\n // called push() with new data. In this case we skip performing more\n // read()s. The execution ends in this method again after the _read() ends\n // up calling push() with more data.\n while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n var len = state.length;\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length)\n // didn't get any data, stop spinning.\n break;\n }\n state.readingMore = false;\n}\n\n// abstract method. to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\nReadable.prototype._read = function (n) {\n errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\n};\nReadable.prototype.pipe = function (dest, pipeOpts) {\n var src = this;\n var state = this._readableState;\n switch (state.pipesCount) {\n case 0:\n state.pipes = dest;\n break;\n case 1:\n state.pipes = [state.pipes, dest];\n break;\n default:\n state.pipes.push(dest);\n break;\n }\n state.pipesCount += 1;\n debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n var endFn = doEnd ? onend : unpipe;\n if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn);\n dest.on('unpipe', onunpipe);\n function onunpipe(readable, unpipeInfo) {\n debug('onunpipe');\n if (readable === src) {\n if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n unpipeInfo.hasUnpiped = true;\n cleanup();\n }\n }\n }\n function onend() {\n debug('onend');\n dest.end();\n }\n\n // when the dest drains, it reduces the awaitDrain counter\n // on the source. This would be more elegant with a .once()\n // handler in flow(), but adding and removing repeatedly is\n // too slow.\n var ondrain = pipeOnDrain(src);\n dest.on('drain', ondrain);\n var cleanedUp = false;\n function cleanup() {\n debug('cleanup');\n // cleanup event handlers once the pipe is broken\n dest.removeListener('close', onclose);\n dest.removeListener('finish', onfinish);\n dest.removeListener('drain', ondrain);\n dest.removeListener('error', onerror);\n dest.removeListener('unpipe', onunpipe);\n src.removeListener('end', onend);\n src.removeListener('end', unpipe);\n src.removeListener('data', ondata);\n cleanedUp = true;\n\n // if the reader is waiting for a drain event from this\n // specific writer, then it would cause it to never start\n // flowing again.\n // So, if this is awaiting a drain, then we just call it now.\n // If we don't know, then assume that we are waiting for one.\n if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n }\n src.on('data', ondata);\n function ondata(chunk) {\n debug('ondata');\n var ret = dest.write(chunk);\n debug('dest.write', ret);\n if (ret === false) {\n // If the user unpiped during `dest.write()`, it is possible\n // to get stuck in a permanently paused state if that write\n // also returned false.\n // => Check whether `dest` is still a piping destination.\n if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n debug('false write response, pause', state.awaitDrain);\n state.awaitDrain++;\n }\n src.pause();\n }\n }\n\n // if the dest has an error, then stop piping into it.\n // however, don't suppress the throwing behavior for this.\n function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n }\n\n // Make sure our error handler is attached before userland ones.\n prependListener(dest, 'error', onerror);\n\n // Both close and finish should trigger unpipe, but only once.\n function onclose() {\n dest.removeListener('finish', onfinish);\n unpipe();\n }\n dest.once('close', onclose);\n function onfinish() {\n debug('onfinish');\n dest.removeListener('close', onclose);\n unpipe();\n }\n dest.once('finish', onfinish);\n function unpipe() {\n debug('unpipe');\n src.unpipe(dest);\n }\n\n // tell the dest that it's being piped to\n dest.emit('pipe', src);\n\n // start the flow if it hasn't been started already.\n if (!state.flowing) {\n debug('pipe resume');\n src.resume();\n }\n return dest;\n};\nfunction pipeOnDrain(src) {\n return function pipeOnDrainFunctionResult() {\n var state = src._readableState;\n debug('pipeOnDrain', state.awaitDrain);\n if (state.awaitDrain) state.awaitDrain--;\n if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n state.flowing = true;\n flow(src);\n }\n };\n}\nReadable.prototype.unpipe = function (dest) {\n var state = this._readableState;\n var unpipeInfo = {\n hasUnpiped: false\n };\n\n // if we're not piping anywhere, then do nothing.\n if (state.pipesCount === 0) return this;\n\n // just one destination. most common case.\n if (state.pipesCount === 1) {\n // passed in one, but it's not the right one.\n if (dest && dest !== state.pipes) return this;\n if (!dest) dest = state.pipes;\n\n // got a match.\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n if (dest) dest.emit('unpipe', this, unpipeInfo);\n return this;\n }\n\n // slow case. multiple pipe destinations.\n\n if (!dest) {\n // remove all.\n var dests = state.pipes;\n var len = state.pipesCount;\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n for (var i = 0; i < len; i++) dests[i].emit('unpipe', this, {\n hasUnpiped: false\n });\n return this;\n }\n\n // try to find the right one.\n var index = indexOf(state.pipes, dest);\n if (index === -1) return this;\n state.pipes.splice(index, 1);\n state.pipesCount -= 1;\n if (state.pipesCount === 1) state.pipes = state.pipes[0];\n dest.emit('unpipe', this, unpipeInfo);\n return this;\n};\n\n// set up data events if they are asked for\n// Ensure readable listeners eventually get something\nReadable.prototype.on = function (ev, fn) {\n var res = Stream.prototype.on.call(this, ev, fn);\n var state = this._readableState;\n if (ev === 'data') {\n // update readableListening so that resume() may be a no-op\n // a few lines down. This is needed to support once('readable').\n state.readableListening = this.listenerCount('readable') > 0;\n\n // Try start flowing on next tick if stream isn't explicitly paused\n if (state.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.flowing = false;\n state.emittedReadable = false;\n debug('on readable', state.length, state.reading);\n if (state.length) {\n emitReadable(this);\n } else if (!state.reading) {\n process.nextTick(nReadingNextTick, this);\n }\n }\n }\n return res;\n};\nReadable.prototype.addListener = Readable.prototype.on;\nReadable.prototype.removeListener = function (ev, fn) {\n var res = Stream.prototype.removeListener.call(this, ev, fn);\n if (ev === 'readable') {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nReadable.prototype.removeAllListeners = function (ev) {\n var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n if (ev === 'readable' || ev === undefined) {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nfunction updateReadableListening(self) {\n var state = self._readableState;\n state.readableListening = self.listenerCount('readable') > 0;\n if (state.resumeScheduled && !state.paused) {\n // flowing needs to be set to true now, otherwise\n // the upcoming resume will not flow.\n state.flowing = true;\n\n // crude way to check if we should resume\n } else if (self.listenerCount('data') > 0) {\n self.resume();\n }\n}\nfunction nReadingNextTick(self) {\n debug('readable nexttick read 0');\n self.read(0);\n}\n\n// pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\nReadable.prototype.resume = function () {\n var state = this._readableState;\n if (!state.flowing) {\n debug('resume');\n // we flow only if there is no one listening\n // for readable, but we still have to call\n // resume()\n state.flowing = !state.readableListening;\n resume(this, state);\n }\n state.paused = false;\n return this;\n};\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n process.nextTick(resume_, stream, state);\n }\n}\nfunction resume_(stream, state) {\n debug('resume', state.reading);\n if (!state.reading) {\n stream.read(0);\n }\n state.resumeScheduled = false;\n stream.emit('resume');\n flow(stream);\n if (state.flowing && !state.reading) stream.read(0);\n}\nReadable.prototype.pause = function () {\n debug('call pause flowing=%j', this._readableState.flowing);\n if (this._readableState.flowing !== false) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n this._readableState.paused = true;\n return this;\n};\nfunction flow(stream) {\n var state = stream._readableState;\n debug('flow', state.flowing);\n while (state.flowing && stream.read() !== null);\n}\n\n// wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\nReadable.prototype.wrap = function (stream) {\n var _this = this;\n var state = this._readableState;\n var paused = false;\n stream.on('end', function () {\n debug('wrapped end');\n if (state.decoder && !state.ended) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) _this.push(chunk);\n }\n _this.push(null);\n });\n stream.on('data', function (chunk) {\n debug('wrapped data');\n if (state.decoder) chunk = state.decoder.write(chunk);\n\n // don't skip over falsy values in objectMode\n if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n var ret = _this.push(chunk);\n if (!ret) {\n paused = true;\n stream.pause();\n }\n });\n\n // proxy all the other methods.\n // important when wrapping filters and duplexes.\n for (var i in stream) {\n if (this[i] === undefined && typeof stream[i] === 'function') {\n this[i] = function methodWrap(method) {\n return function methodWrapReturnFunction() {\n return stream[method].apply(stream, arguments);\n };\n }(i);\n }\n }\n\n // proxy certain important events.\n for (var n = 0; n < kProxyEvents.length; n++) {\n stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n }\n\n // when we try to consume some more bytes, simply unpause the\n // underlying stream.\n this._read = function (n) {\n debug('wrapped _read', n);\n if (paused) {\n paused = false;\n stream.resume();\n }\n };\n return this;\n};\nif (typeof Symbol === 'function') {\n Readable.prototype[Symbol.asyncIterator] = function () {\n if (createReadableStreamAsyncIterator === undefined) {\n createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n }\n return createReadableStreamAsyncIterator(this);\n };\n}\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.highWaterMark;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState && this._readableState.buffer;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.flowing;\n },\n set: function set(state) {\n if (this._readableState) {\n this._readableState.flowing = state;\n }\n }\n});\n\n// exposed for testing purposes only.\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.length;\n }\n});\n\n// Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction fromList(n, state) {\n // nothing buffered\n if (state.length === 0) return null;\n var ret;\n if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n // read it all, truncate the list\n if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = state.buffer.consume(n, state.decoder);\n }\n return ret;\n}\nfunction endReadable(stream) {\n var state = stream._readableState;\n debug('endReadable', state.endEmitted);\n if (!state.endEmitted) {\n state.ended = true;\n process.nextTick(endReadableNT, state, stream);\n }\n}\nfunction endReadableNT(state, stream) {\n debug('endReadableNT', state.endEmitted, state.length);\n\n // Check that we didn't get one last unshift.\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the writable side is ready for autoDestroy as well\n var wState = stream._writableState;\n if (!wState || wState.autoDestroy && wState.finished) {\n stream.destroy();\n }\n }\n }\n}\nif (typeof Symbol === 'function') {\n Readable.from = function (iterable, opts) {\n if (from === undefined) {\n from = require('./internal/streams/from');\n }\n return from(Readable, iterable, opts);\n };\n}\nfunction indexOf(xs, x) {\n for (var i = 0, l = xs.length; i < l; i++) {\n if (xs[i] === x) return i;\n }\n return -1;\n}\n}).call(this)}).call(this,require('_process'),typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n\n},{\"../errors\":54,\"./_stream_duplex\":55,\"./internal/streams/async_iterator\":60,\"./internal/streams/buffer_list\":61,\"./internal/streams/destroy\":62,\"./internal/streams/from\":64,\"./internal/streams/state\":66,\"./internal/streams/stream\":67,\"_process\":42,\"buffer\":19,\"events\":22,\"inherits\":36,\"string_decoder/\":69,\"util\":17}],58:[function(require,module,exports){\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\n// a transform stream is a readable/writable stream where you do\n// something with the data. Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored. (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation. For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes. When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up. When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer. When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks. If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk. However,\n// a pathological inflate type of transform can cause excessive buffering\n// here. For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output. In this case, you could write a very small\n// amount of input, and end up with a very large amount of output. In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform. A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n\n'use strict';\n\nmodule.exports = Transform;\nvar _require$codes = require('../errors').codes,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\nvar Duplex = require('./_stream_duplex');\nrequire('inherits')(Transform, Duplex);\nfunction afterTransform(er, data) {\n var ts = this._transformState;\n ts.transforming = false;\n var cb = ts.writecb;\n if (cb === null) {\n return this.emit('error', new ERR_MULTIPLE_CALLBACK());\n }\n ts.writechunk = null;\n ts.writecb = null;\n if (data != null)\n // single equals check for both `null` and `undefined`\n this.push(data);\n cb(er);\n var rs = this._readableState;\n rs.reading = false;\n if (rs.needReadable || rs.length < rs.highWaterMark) {\n this._read(rs.highWaterMark);\n }\n}\nfunction Transform(options) {\n if (!(this instanceof Transform)) return new Transform(options);\n Duplex.call(this, options);\n this._transformState = {\n afterTransform: afterTransform.bind(this),\n needTransform: false,\n transforming: false,\n writecb: null,\n writechunk: null,\n writeencoding: null\n };\n\n // start out asking for a readable event once data is transformed.\n this._readableState.needReadable = true;\n\n // we have implemented the _read method, and done the other things\n // that Readable wants before the first _read call, so unset the\n // sync guard flag.\n this._readableState.sync = false;\n if (options) {\n if (typeof options.transform === 'function') this._transform = options.transform;\n if (typeof options.flush === 'function') this._flush = options.flush;\n }\n\n // When the writable side finishes, then flush out anything remaining.\n this.on('prefinish', prefinish);\n}\nfunction prefinish() {\n var _this = this;\n if (typeof this._flush === 'function' && !this._readableState.destroyed) {\n this._flush(function (er, data) {\n done(_this, er, data);\n });\n } else {\n done(this, null, null);\n }\n}\nTransform.prototype.push = function (chunk, encoding) {\n this._transformState.needTransform = false;\n return Duplex.prototype.push.call(this, chunk, encoding);\n};\n\n// This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side. You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk. If you pass\n// an error, then that'll put the hurt on the whole operation. If you\n// never call cb(), then you'll never get another chunk.\nTransform.prototype._transform = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\n};\nTransform.prototype._write = function (chunk, encoding, cb) {\n var ts = this._transformState;\n ts.writecb = cb;\n ts.writechunk = chunk;\n ts.writeencoding = encoding;\n if (!ts.transforming) {\n var rs = this._readableState;\n if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n }\n};\n\n// Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\nTransform.prototype._read = function (n) {\n var ts = this._transformState;\n if (ts.writechunk !== null && !ts.transforming) {\n ts.transforming = true;\n this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n } else {\n // mark that we need a transform, so that any data that comes in\n // will get processed, now that we've asked for it.\n ts.needTransform = true;\n }\n};\nTransform.prototype._destroy = function (err, cb) {\n Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\n });\n};\nfunction done(stream, er, data) {\n if (er) return stream.emit('error', er);\n if (data != null)\n // single equals check for both `null` and `undefined`\n stream.push(data);\n\n // TODO(BridgeAR): Write a test for these two error cases\n // if there's nothing in the write buffer, then that means\n // that nothing more will ever be provided\n if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0();\n if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n return stream.push(null);\n}\n},{\"../errors\":54,\"./_stream_duplex\":55,\"inherits\":36}],59:[function(require,module,exports){\n(function (process,global){(function (){\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\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n\n'use strict';\n\nmodule.exports = Writable;\n\n/* <replacement> */\nfunction WriteReq(chunk, encoding, cb) {\n this.chunk = chunk;\n this.encoding = encoding;\n this.callback = cb;\n this.next = null;\n}\n\n// It seems a linked list but it is not\n// there will be only 2 of these for each stream\nfunction CorkedRequest(state) {\n var _this = this;\n this.next = null;\n this.entry = null;\n this.finish = function () {\n onCorkedFinish(_this, state);\n };\n}\n/* </replacement> */\n\n/*<replacement>*/\nvar Duplex;\n/*</replacement>*/\n\nWritable.WritableState = WritableState;\n\n/*<replacement>*/\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/*</replacement>*/\n\n/*<replacement>*/\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nrequire('inherits')(Writable, Stream);\nfunction nop() {}\nfunction WritableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream,\n // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag to indicate whether or not this stream\n // contains buffers or objects.\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode;\n\n // the point at which write() starts returning false\n // Note: 0 is a valid value, means that we always return false if\n // the entire buffer is not flushed immediately on write()\n this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex);\n\n // if _final has been called\n this.finalCalled = false;\n\n // drain event flag.\n this.needDrain = false;\n // at the start of calling end()\n this.ending = false;\n // when end() has been called, and returned\n this.ended = false;\n // when 'finish' is emitted\n this.finished = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // should we decode strings into buffers before passing to _write?\n // this is here so that some node-core streams can optimize string\n // handling at a lower level.\n var noDecode = options.decodeStrings === false;\n this.decodeStrings = !noDecode;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // not an actual buffer we keep track of, but a measurement\n // of how much we're waiting to get pushed to some underlying\n // socket or file.\n this.length = 0;\n\n // a flag to see when we're in the middle of a write.\n this.writing = false;\n\n // when true all writes will be buffered until .uncork() call\n this.corked = 0;\n\n // a flag to be able to tell if the onwrite cb is called immediately,\n // or on a later tick. We set this to true at first, because any\n // actions that shouldn't happen until \"later\" should generally also\n // not happen before the first write call.\n this.sync = true;\n\n // a flag to know if we're processing previously buffered items, which\n // may call the _write() callback in the same tick, so that we don't\n // end up in an overlapped onwrite situation.\n this.bufferProcessing = false;\n\n // the callback that's passed to _write(chunk,cb)\n this.onwrite = function (er) {\n onwrite(stream, er);\n };\n\n // the callback that the user supplies to write(chunk,encoding,cb)\n this.writecb = null;\n\n // the amount that is being written when _write is called.\n this.writelen = 0;\n this.bufferedRequest = null;\n this.lastBufferedRequest = null;\n\n // number of pending user-supplied write callbacks\n // this must be 0 before 'finish' can be emitted\n this.pendingcb = 0;\n\n // emit prefinish if the only thing we're waiting for is _write cbs\n // This is relevant for synchronous Transform streams\n this.prefinished = false;\n\n // True if the error was already emitted and should not be thrown again\n this.errorEmitted = false;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'finish' (and potentially 'end')\n this.autoDestroy = !!options.autoDestroy;\n\n // count buffered requests\n this.bufferedRequestCount = 0;\n\n // allocate the first CorkedRequest, there is always\n // one allocated and free to use, and we maintain at most two\n this.corkedRequestsFree = new CorkedRequest(this);\n}\nWritableState.prototype.getBuffer = function getBuffer() {\n var current = this.bufferedRequest;\n var out = [];\n while (current) {\n out.push(current);\n current = current.next;\n }\n return out;\n};\n(function () {\n try {\n Object.defineProperty(WritableState.prototype, 'buffer', {\n get: internalUtil.deprecate(function writableStateBufferGetter() {\n return this.getBuffer();\n }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n });\n } catch (_) {}\n})();\n\n// Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\nvar realHasInstance;\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n realHasInstance = Function.prototype[Symbol.hasInstance];\n Object.defineProperty(Writable, Symbol.hasInstance, {\n value: function value(object) {\n if (realHasInstance.call(this, object)) return true;\n if (this !== Writable) return false;\n return object && object._writableState instanceof WritableState;\n }\n });\n} else {\n realHasInstance = function realHasInstance(object) {\n return object instanceof this;\n };\n}\nfunction Writable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n\n // Writable ctor is applied to Duplexes, too.\n // `realHasInstance` is necessary because using plain `instanceof`\n // would return false, as no `_writableState` property is attached.\n\n // Trying to use the custom `instanceof` for Writable here will also break the\n // Node.js LazyTransform implementation, which has a non-trivial getter for\n // `_writableState` that would lead to infinite recursion.\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the WritableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n this._writableState = new WritableState(options, this, isDuplex);\n\n // legacy.\n this.writable = true;\n if (options) {\n if (typeof options.write === 'function') this._write = options.write;\n if (typeof options.writev === 'function') this._writev = options.writev;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n if (typeof options.final === 'function') this._final = options.final;\n }\n Stream.call(this);\n}\n\n// Otherwise people can pipe Writable streams, which is just wrong.\nWritable.prototype.pipe = function () {\n errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\nfunction writeAfterEnd(stream, cb) {\n var er = new ERR_STREAM_WRITE_AFTER_END();\n // TODO: defer error events consistently everywhere, not just the cb\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n}\n\n// Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\nfunction validChunk(stream, state, chunk, cb) {\n var er;\n if (chunk === null) {\n er = new ERR_STREAM_NULL_VALUES();\n } else if (typeof chunk !== 'string' && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n }\n if (er) {\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n return false;\n }\n return true;\n}\nWritable.prototype.write = function (chunk, encoding, cb) {\n var state = this._writableState;\n var ret = false;\n var isBuf = !state.objectMode && _isUint8Array(chunk);\n if (isBuf && !Buffer.isBuffer(chunk)) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n if (typeof cb !== 'function') cb = nop;\n if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n state.pendingcb++;\n ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n }\n return ret;\n};\nWritable.prototype.cork = function () {\n this._writableState.corked++;\n};\nWritable.prototype.uncork = function () {\n var state = this._writableState;\n if (state.corked) {\n state.corked--;\n if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n }\n};\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n // node::ParseEncoding() requires lower case.\n if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nfunction decodeChunk(state, chunk, encoding) {\n if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n chunk = Buffer.from(chunk, encoding);\n }\n return chunk;\n}\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\n\n// if we're already writing something, then just put this\n// in the queue, and wait our turn. Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n if (!isBuf) {\n var newChunk = decodeChunk(state, chunk, encoding);\n if (chunk !== newChunk) {\n isBuf = true;\n encoding = 'buffer';\n chunk = newChunk;\n }\n }\n var len = state.objectMode ? 1 : chunk.length;\n state.length += len;\n var ret = state.length < state.highWaterMark;\n // we must ensure that previous needDrain will not be reset to false.\n if (!ret) state.needDrain = true;\n if (state.writing || state.corked) {\n var last = state.lastBufferedRequest;\n state.lastBufferedRequest = {\n chunk: chunk,\n encoding: encoding,\n isBuf: isBuf,\n callback: cb,\n next: null\n };\n if (last) {\n last.next = state.lastBufferedRequest;\n } else {\n state.bufferedRequest = state.lastBufferedRequest;\n }\n state.bufferedRequestCount += 1;\n } else {\n doWrite(stream, state, false, len, chunk, encoding, cb);\n }\n return ret;\n}\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n state.writelen = len;\n state.writecb = cb;\n state.writing = true;\n state.sync = true;\n if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n state.sync = false;\n}\nfunction onwriteError(stream, state, sync, er, cb) {\n --state.pendingcb;\n if (sync) {\n // defer the callback if we are being called synchronously\n // to avoid piling up things on the stack\n process.nextTick(cb, er);\n // this can emit finish, and it will always happen\n // after error\n process.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n } else {\n // the caller expect this to happen before if\n // it is async\n cb(er);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n // this can emit finish, but finish must\n // always follow error\n finishMaybe(stream, state);\n }\n}\nfunction onwriteStateUpdate(state) {\n state.writing = false;\n state.writecb = null;\n state.length -= state.writelen;\n state.writelen = 0;\n}\nfunction onwrite(stream, er) {\n var state = stream._writableState;\n var sync = state.sync;\n var cb = state.writecb;\n if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\n onwriteStateUpdate(state);\n if (er) onwriteError(stream, state, sync, er, cb);else {\n // Check if we're actually ready to finish, but don't emit yet\n var finished = needFinish(state) || stream.destroyed;\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n if (sync) {\n process.nextTick(afterWrite, stream, state, finished, cb);\n } else {\n afterWrite(stream, state, finished, cb);\n }\n }\n}\nfunction afterWrite(stream, state, finished, cb) {\n if (!finished) onwriteDrain(stream, state);\n state.pendingcb--;\n cb();\n finishMaybe(stream, state);\n}\n\n// Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\nfunction onwriteDrain(stream, state) {\n if (state.length === 0 && state.needDrain) {\n state.needDrain = false;\n stream.emit('drain');\n }\n}\n\n// if there's something in the buffer waiting, then process it\nfunction clearBuffer(stream, state) {\n state.bufferProcessing = true;\n var entry = state.bufferedRequest;\n if (stream._writev && entry && entry.next) {\n // Fast case, write everything using _writev()\n var l = state.bufferedRequestCount;\n var buffer = new Array(l);\n var holder = state.corkedRequestsFree;\n holder.entry = entry;\n var count = 0;\n var allBuffers = true;\n while (entry) {\n buffer[count] = entry;\n if (!entry.isBuf) allBuffers = false;\n entry = entry.next;\n count += 1;\n }\n buffer.allBuffers = allBuffers;\n doWrite(stream, state, true, state.length, buffer, '', holder.finish);\n\n // doWrite is almost always async, defer these to save a bit of time\n // as the hot path ends with doWrite\n state.pendingcb++;\n state.lastBufferedRequest = null;\n if (holder.next) {\n state.corkedRequestsFree = holder.next;\n holder.next = null;\n } else {\n state.corkedRequestsFree = new CorkedRequest(state);\n }\n state.bufferedRequestCount = 0;\n } else {\n // Slow case, write chunks one-by-one\n while (entry) {\n var chunk = entry.chunk;\n var encoding = entry.encoding;\n var cb = entry.callback;\n var len = state.objectMode ? 1 : chunk.length;\n doWrite(stream, state, false, len, chunk, encoding, cb);\n entry = entry.next;\n state.bufferedRequestCount--;\n // if we didn't call the onwrite immediately, then\n // it means that we need to wait until it does.\n // also, that means that the chunk and cb are currently\n // being processed, so move the buffer counter past them.\n if (state.writing) {\n break;\n }\n }\n if (entry === null) state.lastBufferedRequest = null;\n }\n state.bufferedRequest = entry;\n state.bufferProcessing = false;\n}\nWritable.prototype._write = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()'));\n};\nWritable.prototype._writev = null;\nWritable.prototype.end = function (chunk, encoding, cb) {\n var state = this._writableState;\n if (typeof chunk === 'function') {\n cb = chunk;\n chunk = null;\n encoding = null;\n } else if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (chunk !== null && chunk !== undefined) this.write(chunk, encoding);\n\n // .end() fully uncorks\n if (state.corked) {\n state.corked = 1;\n this.uncork();\n }\n\n // ignore unnecessary end() calls.\n if (!state.ending) endWritable(this, state, cb);\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\nfunction needFinish(state) {\n return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\nfunction callFinal(stream, state) {\n stream._final(function (err) {\n state.pendingcb--;\n if (err) {\n errorOrDestroy(stream, err);\n }\n state.prefinished = true;\n stream.emit('prefinish');\n finishMaybe(stream, state);\n });\n}\nfunction prefinish(stream, state) {\n if (!state.prefinished && !state.finalCalled) {\n if (typeof stream._final === 'function' && !state.destroyed) {\n state.pendingcb++;\n state.finalCalled = true;\n process.nextTick(callFinal, stream, state);\n } else {\n state.prefinished = true;\n stream.emit('prefinish');\n }\n }\n}\nfunction finishMaybe(stream, state) {\n var need = needFinish(state);\n if (need) {\n prefinish(stream, state);\n if (state.pendingcb === 0) {\n state.finished = true;\n stream.emit('finish');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the readable side is ready for autoDestroy as well\n var rState = stream._readableState;\n if (!rState || rState.autoDestroy && rState.endEmitted) {\n stream.destroy();\n }\n }\n }\n }\n return need;\n}\nfunction endWritable(stream, state, cb) {\n state.ending = true;\n finishMaybe(stream, state);\n if (cb) {\n if (state.finished) process.nextTick(cb);else stream.once('finish', cb);\n }\n state.ended = true;\n stream.writable = false;\n}\nfunction onCorkedFinish(corkReq, state, err) {\n var entry = corkReq.entry;\n corkReq.entry = null;\n while (entry) {\n var cb = entry.callback;\n state.pendingcb--;\n cb(err);\n entry = entry.next;\n }\n\n // reuse the free corkReq.\n state.corkedRequestsFree.next = corkReq;\n}\nObject.defineProperty(Writable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._writableState === undefined) {\n return false;\n }\n return this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._writableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._writableState.destroyed = value;\n }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\nWritable.prototype._destroy = function (err, cb) {\n cb(err);\n};\n}).call(this)}).call(this,require('_process'),typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n\n},{\"../errors\":54,\"./_stream_duplex\":55,\"./internal/streams/destroy\":62,\"./internal/streams/state\":66,\"./internal/streams/stream\":67,\"_process\":42,\"buffer\":19,\"inherits\":36,\"util-deprecate\":73}],60:[function(require,module,exports){\n(function (process){(function (){\n'use strict';\n\nvar _Object$setPrototypeO;\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar finished = require('./end-of-stream');\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\nfunction createIterResult(value, done) {\n return {\n value: value,\n done: done\n };\n}\nfunction readAndResolve(iter) {\n var resolve = iter[kLastResolve];\n if (resolve !== null) {\n var data = iter[kStream].read();\n // we defer if data is null\n // we can be expecting either 'end' or\n // 'error'\n if (data !== null) {\n iter[kLastPromise] = null;\n iter[kLastResolve] = null;\n iter[kLastReject] = null;\n resolve(createIterResult(data, false));\n }\n }\n}\nfunction onReadable(iter) {\n // we wait for the next tick, because it might\n // emit an error with process.nextTick\n process.nextTick(readAndResolve, iter);\n}\nfunction wrapForNext(lastPromise, iter) {\n return function (resolve, reject) {\n lastPromise.then(function () {\n if (iter[kEnded]) {\n resolve(createIterResult(undefined, true));\n return;\n }\n iter[kHandlePromise](resolve, reject);\n }, reject);\n };\n}\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n get stream() {\n return this[kStream];\n },\n next: function next() {\n var _this = this;\n // if we have detected an error in the meanwhile\n // reject straight away\n var error = this[kError];\n if (error !== null) {\n return Promise.reject(error);\n }\n if (this[kEnded]) {\n return Promise.resolve(createIterResult(undefined, true));\n }\n if (this[kStream].destroyed) {\n // We need to defer via nextTick because if .destroy(err) is\n // called, the error will be emitted via nextTick, and\n // we cannot guarantee that there is no error lingering around\n // waiting to be emitted.\n return new Promise(function (resolve, reject) {\n process.nextTick(function () {\n if (_this[kError]) {\n reject(_this[kError]);\n } else {\n resolve(createIterResult(undefined, true));\n }\n });\n });\n }\n\n // if we have multiple next() calls\n // we will wait for the previous Promise to finish\n // this logic is optimized to support for await loops,\n // where next() is only called once at a time\n var lastPromise = this[kLastPromise];\n var promise;\n if (lastPromise) {\n promise = new Promise(wrapForNext(lastPromise, this));\n } else {\n // fast path needed to support multiple this.push()\n // without triggering the next() queue\n var data = this[kStream].read();\n if (data !== null) {\n return Promise.resolve(createIterResult(data, false));\n }\n promise = new Promise(this[kHandlePromise]);\n }\n this[kLastPromise] = promise;\n return promise;\n }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n var _this2 = this;\n // destroy(err, cb) is a private API\n // we can guarantee we have that here, because we control the\n // Readable class this is attached to\n return new Promise(function (resolve, reject) {\n _this2[kStream].destroy(null, function (err) {\n if (err) {\n reject(err);\n return;\n }\n resolve(createIterResult(undefined, true));\n });\n });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n var _Object$create;\n var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n value: stream,\n writable: true\n }), _defineProperty(_Object$create, kLastResolve, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kLastReject, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kError, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kEnded, {\n value: stream._readableState.endEmitted,\n writable: true\n }), _defineProperty(_Object$create, kHandlePromise, {\n value: function value(resolve, reject) {\n var data = iterator[kStream].read();\n if (data) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(data, false));\n } else {\n iterator[kLastResolve] = resolve;\n iterator[kLastReject] = reject;\n }\n },\n writable: true\n }), _Object$create));\n iterator[kLastPromise] = null;\n finished(stream, function (err) {\n if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n var reject = iterator[kLastReject];\n // reject if we are waiting for data in the Promise\n // returned by next() and store the error\n if (reject !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n reject(err);\n }\n iterator[kError] = err;\n return;\n }\n var resolve = iterator[kLastResolve];\n if (resolve !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(undefined, true));\n }\n iterator[kEnded] = true;\n });\n stream.on('readable', onReadable.bind(null, iterator));\n return iterator;\n};\nmodule.exports = createReadableStreamAsyncIterator;\n}).call(this)}).call(this,require('_process'))\n\n},{\"./end-of-stream\":63,\"_process\":42}],61:[function(require,module,exports){\n'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar _require = require('buffer'),\n Buffer = _require.Buffer;\nvar _require2 = require('util'),\n inspect = _require2.inspect;\nvar custom = inspect && inspect.custom || 'inspect';\nfunction copyBuffer(src, target, offset) {\n Buffer.prototype.copy.call(src, target, offset);\n}\nmodule.exports = /*#__PURE__*/function () {\n function BufferList() {\n _classCallCheck(this, BufferList);\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n _createClass(BufferList, [{\n key: \"push\",\n value: function push(v) {\n var entry = {\n data: v,\n next: null\n };\n if (this.length > 0) this.tail.next = entry;else this.head = entry;\n this.tail = entry;\n ++this.length;\n }\n }, {\n key: \"unshift\",\n value: function unshift(v) {\n var entry = {\n data: v,\n next: this.head\n };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n }\n }, {\n key: \"shift\",\n value: function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n --this.length;\n return ret;\n }\n }, {\n key: \"clear\",\n value: function clear() {\n this.head = this.tail = null;\n this.length = 0;\n }\n }, {\n key: \"join\",\n value: function join(s) {\n if (this.length === 0) return '';\n var p = this.head;\n var ret = '' + p.data;\n while (p = p.next) ret += s + p.data;\n return ret;\n }\n }, {\n key: \"concat\",\n value: function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n return ret;\n }\n\n // Consumes a specified amount of bytes or characters from the buffered data.\n }, {\n key: \"consume\",\n value: function consume(n, hasStrings) {\n var ret;\n if (n < this.head.data.length) {\n // `slice` is the same for buffers and strings.\n ret = this.head.data.slice(0, n);\n this.head.data = this.head.data.slice(n);\n } else if (n === this.head.data.length) {\n // First chunk is a perfect match.\n ret = this.shift();\n } else {\n // Result spans more than one buffer.\n ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n }\n return ret;\n }\n }, {\n key: \"first\",\n value: function first() {\n return this.head.data;\n }\n\n // Consumes a specified amount of characters from the buffered data.\n }, {\n key: \"_getString\",\n value: function _getString(n) {\n var p = this.head;\n var c = 1;\n var ret = p.data;\n n -= ret.length;\n while (p = p.next) {\n var str = p.data;\n var nb = n > str.length ? str.length : n;\n if (nb === str.length) ret += str;else ret += str.slice(0, n);\n n -= nb;\n if (n === 0) {\n if (nb === str.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = str.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Consumes a specified amount of bytes from the buffered data.\n }, {\n key: \"_getBuffer\",\n value: function _getBuffer(n) {\n var ret = Buffer.allocUnsafe(n);\n var p = this.head;\n var c = 1;\n p.data.copy(ret);\n n -= p.data.length;\n while (p = p.next) {\n var buf = p.data;\n var nb = n > buf.length ? buf.length : n;\n buf.copy(ret, ret.length - n, 0, nb);\n n -= nb;\n if (n === 0) {\n if (nb === buf.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = buf.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Make sure the linked list only shows the minimal necessary information.\n }, {\n key: custom,\n value: function value(_, options) {\n return inspect(this, _objectSpread(_objectSpread({}, options), {}, {\n // Only inspect one level.\n depth: 0,\n // It should not recurse.\n customInspect: false\n }));\n }\n }]);\n return BufferList;\n}();\n},{\"buffer\":19,\"util\":17}],62:[function(require,module,exports){\n(function (process){(function (){\n'use strict';\n\n// undocumented cb() API, needed for core, not for public API\nfunction destroy(err, cb) {\n var _this = this;\n var readableDestroyed = this._readableState && this._readableState.destroyed;\n var writableDestroyed = this._writableState && this._writableState.destroyed;\n if (readableDestroyed || writableDestroyed) {\n if (cb) {\n cb(err);\n } else if (err) {\n if (!this._writableState) {\n process.nextTick(emitErrorNT, this, err);\n } else if (!this._writableState.errorEmitted) {\n this._writableState.errorEmitted = true;\n process.nextTick(emitErrorNT, this, err);\n }\n }\n return this;\n }\n\n // we set destroyed to true before firing error callbacks in order\n // to make it re-entrance safe in case destroy() is called within callbacks\n\n if (this._readableState) {\n this._readableState.destroyed = true;\n }\n\n // if this is a duplex stream mark the writable part as destroyed as well\n if (this._writableState) {\n this._writableState.destroyed = true;\n }\n this._destroy(err || null, function (err) {\n if (!cb && err) {\n if (!_this._writableState) {\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else if (!_this._writableState.errorEmitted) {\n _this._writableState.errorEmitted = true;\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n } else if (cb) {\n process.nextTick(emitCloseNT, _this);\n cb(err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n });\n return this;\n}\nfunction emitErrorAndCloseNT(self, err) {\n emitErrorNT(self, err);\n emitCloseNT(self);\n}\nfunction emitCloseNT(self) {\n if (self._writableState && !self._writableState.emitClose) return;\n if (self._readableState && !self._readableState.emitClose) return;\n self.emit('close');\n}\nfunction undestroy() {\n if (this._readableState) {\n this._readableState.destroyed = false;\n this._readableState.reading = false;\n this._readableState.ended = false;\n this._readableState.endEmitted = false;\n }\n if (this._writableState) {\n this._writableState.destroyed = false;\n this._writableState.ended = false;\n this._writableState.ending = false;\n this._writableState.finalCalled = false;\n this._writableState.prefinished = false;\n this._writableState.finished = false;\n this._writableState.errorEmitted = false;\n }\n}\nfunction emitErrorNT(self, err) {\n self.emit('error', err);\n}\nfunction errorOrDestroy(stream, err) {\n // We have tests that rely on errors being emitted\n // in the same tick, so changing this is semver major.\n // For now when you opt-in to autoDestroy we allow\n // the error to be emitted nextTick. In a future\n // semver major update we should change the default to this.\n\n var rState = stream._readableState;\n var wState = stream._writableState;\n if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy,\n errorOrDestroy: errorOrDestroy\n};\n}).call(this)}).call(this,require('_process'))\n\n},{\"_process\":42}],63:[function(require,module,exports){\n// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n callback.apply(this, args);\n };\n}\nfunction noop() {}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction eos(stream, opts, callback) {\n if (typeof opts === 'function') return eos(stream, null, opts);\n if (!opts) opts = {};\n callback = once(callback || noop);\n var readable = opts.readable || opts.readable !== false && stream.readable;\n var writable = opts.writable || opts.writable !== false && stream.writable;\n var onlegacyfinish = function onlegacyfinish() {\n if (!stream.writable) onfinish();\n };\n var writableEnded = stream._writableState && stream._writableState.finished;\n var onfinish = function onfinish() {\n writable = false;\n writableEnded = true;\n if (!readable) callback.call(stream);\n };\n var readableEnded = stream._readableState && stream._readableState.endEmitted;\n var onend = function onend() {\n readable = false;\n readableEnded = true;\n if (!writable) callback.call(stream);\n };\n var onerror = function onerror(err) {\n callback.call(stream, err);\n };\n var onclose = function onclose() {\n var err;\n if (readable && !readableEnded) {\n if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n if (writable && !writableEnded) {\n if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n };\n var onrequest = function onrequest() {\n stream.req.on('finish', onfinish);\n };\n if (isRequest(stream)) {\n stream.on('complete', onfinish);\n stream.on('abort', onclose);\n if (stream.req) onrequest();else stream.on('request', onrequest);\n } else if (writable && !stream._writableState) {\n // legacy streams\n stream.on('end', onlegacyfinish);\n stream.on('close', onlegacyfinish);\n }\n stream.on('end', onend);\n stream.on('finish', onfinish);\n if (opts.error !== false) stream.on('error', onerror);\n stream.on('close', onclose);\n return function () {\n stream.removeListener('complete', onfinish);\n stream.removeListener('abort', onclose);\n stream.removeListener('request', onrequest);\n if (stream.req) stream.req.removeListener('finish', onfinish);\n stream.removeListener('end', onlegacyfinish);\n stream.removeListener('close', onlegacyfinish);\n stream.removeListener('finish', onfinish);\n stream.removeListener('end', onend);\n stream.removeListener('error', onerror);\n stream.removeListener('close', onclose);\n };\n}\nmodule.exports = eos;\n},{\"../../../errors\":54}],64:[function(require,module,exports){\nmodule.exports = function () {\n throw new Error('Readable.from is not available in the browser')\n};\n\n},{}],65:[function(require,module,exports){\n// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar eos;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n callback.apply(void 0, arguments);\n };\n}\nvar _require$codes = require('../../../errors').codes,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\nfunction noop(err) {\n // Rethrow the error if it exists to avoid swallowing it\n if (err) throw err;\n}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction destroyer(stream, reading, writing, callback) {\n callback = once(callback);\n var closed = false;\n stream.on('close', function () {\n closed = true;\n });\n if (eos === undefined) eos = require('./end-of-stream');\n eos(stream, {\n readable: reading,\n writable: writing\n }, function (err) {\n if (err) return callback(err);\n closed = true;\n callback();\n });\n var destroyed = false;\n return function (err) {\n if (closed) return;\n if (destroyed) return;\n destroyed = true;\n\n // request.destroy just do .end - .abort is what we want\n if (isRequest(stream)) return stream.abort();\n if (typeof stream.destroy === 'function') return stream.destroy();\n callback(err || new ERR_STREAM_DESTROYED('pipe'));\n };\n}\nfunction call(fn) {\n fn();\n}\nfunction pipe(from, to) {\n return from.pipe(to);\n}\nfunction popCallback(streams) {\n if (!streams.length) return noop;\n if (typeof streams[streams.length - 1] !== 'function') return noop;\n return streams.pop();\n}\nfunction pipeline() {\n for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n streams[_key] = arguments[_key];\n }\n var callback = popCallback(streams);\n if (Array.isArray(streams[0])) streams = streams[0];\n if (streams.length < 2) {\n throw new ERR_MISSING_ARGS('streams');\n }\n var error;\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1;\n var writing = i > 0;\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err;\n if (err) destroys.forEach(call);\n if (reading) return;\n destroys.forEach(call);\n callback(error);\n });\n });\n return streams.reduce(pipe);\n}\nmodule.exports = pipeline;\n},{\"../../../errors\":54,\"./end-of-stream\":63}],66:[function(require,module,exports){\n'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n return Math.floor(hwm);\n }\n\n // Default value\n return state.objectMode ? 16 : 16 * 1024;\n}\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};\n},{\"../../../errors\":54}],67:[function(require,module,exports){\nmodule.exports = require('events').EventEmitter;\n\n},{\"events\":22}],68:[function(require,module,exports){\nexports = module.exports = require('./lib/_stream_readable.js');\nexports.Stream = exports;\nexports.Readable = exports;\nexports.Writable = require('./lib/_stream_writable.js');\nexports.Duplex = require('./lib/_stream_duplex.js');\nexports.Transform = require('./lib/_stream_transform.js');\nexports.PassThrough = require('./lib/_stream_passthrough.js');\nexports.finished = require('./lib/internal/streams/end-of-stream.js');\nexports.pipeline = require('./lib/internal/streams/pipeline.js');\n\n},{\"./lib/_stream_duplex.js\":55,\"./lib/_stream_passthrough.js\":56,\"./lib/_stream_readable.js\":57,\"./lib/_stream_transform.js\":58,\"./lib/_stream_writable.js\":59,\"./lib/internal/streams/end-of-stream.js\":63,\"./lib/internal/streams/pipeline.js\":65}],69:[function(require,module,exports){\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\n'use strict';\n\n/*<replacement>*/\n\nvar Buffer = require('safe-buffer').Buffer;\n/*</replacement>*/\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n encoding = '' + encoding;\n switch (encoding && encoding.toLowerCase()) {\n case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw':\n return true;\n default:\n return false;\n }\n};\n\nfunction _normalizeEncoding(enc) {\n if (!enc) return 'utf8';\n var retried;\n while (true) {\n switch (enc) {\n case 'utf8':\n case 'utf-8':\n return 'utf8';\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return 'utf16le';\n case 'latin1':\n case 'binary':\n return 'latin1';\n case 'base64':\n case 'ascii':\n case 'hex':\n return enc;\n default:\n if (retried) return; // undefined\n enc = ('' + enc).toLowerCase();\n retried = true;\n }\n }\n};\n\n// Do not cache `Buffer.isEncoding` when checking encoding names as some\n// modules monkey-patch it to support additional encodings\nfunction normalizeEncoding(enc) {\n var nenc = _normalizeEncoding(enc);\n if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n return nenc || enc;\n}\n\n// StringDecoder provides an interface for efficiently splitting a series of\n// buffers into a series of JS strings without breaking apart multi-byte\n// characters.\nexports.StringDecoder = StringDecoder;\nfunction StringDecoder(encoding) {\n this.encoding = normalizeEncoding(encoding);\n var nb;\n switch (this.encoding) {\n case 'utf16le':\n this.text = utf16Text;\n this.end = utf16End;\n nb = 4;\n break;\n case 'utf8':\n this.fillLast = utf8FillLast;\n nb = 4;\n break;\n case 'base64':\n this.text = base64Text;\n this.end = base64End;\n nb = 3;\n break;\n default:\n this.write = simpleWrite;\n this.end = simpleEnd;\n return;\n }\n this.lastNeed = 0;\n this.lastTotal = 0;\n this.lastChar = Buffer.allocUnsafe(nb);\n}\n\nStringDecoder.prototype.write = function (buf) {\n if (buf.length === 0) return '';\n var r;\n var i;\n if (this.lastNeed) {\n r = this.fillLast(buf);\n if (r === undefined) return '';\n i = this.lastNeed;\n this.lastNeed = 0;\n } else {\n i = 0;\n }\n if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n return r || '';\n};\n\nStringDecoder.prototype.end = utf8End;\n\n// Returns only complete characters in a Buffer\nStringDecoder.prototype.text = utf8Text;\n\n// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\nStringDecoder.prototype.fillLast = function (buf) {\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n this.lastNeed -= buf.length;\n};\n\n// Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a\n// continuation byte. If an invalid byte is detected, -2 is returned.\nfunction utf8CheckByte(byte) {\n if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) return 3;else if (byte >> 3 === 0x1E) return 4;\n return byte >> 6 === 0x02 ? -1 : -2;\n}\n\n// Checks at most 3 bytes at the end of a Buffer in order to detect an\n// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4)\n// needed to complete the UTF-8 character (if applicable) are returned.\nfunction utf8CheckIncomplete(self, buf, i) {\n var j = buf.length - 1;\n if (j < i) return 0;\n var nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 1;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 2;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) {\n if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n }\n return nb;\n }\n return 0;\n}\n\n// Validates as many continuation bytes for a multi-byte UTF-8 character as\n// needed or are available. If we see a non-continuation byte where we expect\n// one, we \"replace\" the validated continuation bytes we've seen so far with\n// a single UTF-8 replacement character ('\\ufffd'), to match v8's UTF-8 decoding\n// behavior. The continuation byte check is included three times in the case\n// where all of the continuation bytes for a character exist in the same buffer.\n// It is also done this way as a slight performance increase instead of using a\n// loop.\nfunction utf8CheckExtraBytes(self, buf, p) {\n if ((buf[0] & 0xC0) !== 0x80) {\n self.lastNeed = 0;\n return '\\ufffd';\n }\n if (self.lastNeed > 1 && buf.length > 1) {\n if ((buf[1] & 0xC0) !== 0x80) {\n self.lastNeed = 1;\n return '\\ufffd';\n }\n if (self.lastNeed > 2 && buf.length > 2) {\n if ((buf[2] & 0xC0) !== 0x80) {\n self.lastNeed = 2;\n return '\\ufffd';\n }\n }\n }\n}\n\n// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\nfunction utf8FillLast(buf) {\n var p = this.lastTotal - this.lastNeed;\n var r = utf8CheckExtraBytes(this, buf, p);\n if (r !== undefined) return r;\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, p, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, p, 0, buf.length);\n this.lastNeed -= buf.length;\n}\n\n// Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a\n// partial character, the character's bytes are buffered until the required\n// number of bytes are available.\nfunction utf8Text(buf, i) {\n var total = utf8CheckIncomplete(this, buf, i);\n if (!this.lastNeed) return buf.toString('utf8', i);\n this.lastTotal = total;\n var end = buf.length - (total - this.lastNeed);\n buf.copy(this.lastChar, 0, end);\n return buf.toString('utf8', i, end);\n}\n\n// For UTF-8, a replacement character is added when ending on a partial\n// character.\nfunction utf8End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + '\\ufffd';\n return r;\n}\n\n// UTF-16LE typically needs two bytes per character, but even if we have an even\n// number of bytes available, we need to check if we end on a leading/high\n// surrogate. In that case, we need to wait for the next two bytes in order to\n// decode the last character properly.\nfunction utf16Text(buf, i) {\n if ((buf.length - i) % 2 === 0) {\n var r = buf.toString('utf16le', i);\n if (r) {\n var c = r.charCodeAt(r.length - 1);\n if (c >= 0xD800 && c <= 0xDBFF) {\n this.lastNeed = 2;\n this.lastTotal = 4;\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n return r.slice(0, -1);\n }\n }\n return r;\n }\n this.lastNeed = 1;\n this.lastTotal = 2;\n this.lastChar[0] = buf[buf.length - 1];\n return buf.toString('utf16le', i, buf.length - 1);\n}\n\n// For UTF-16LE we do not explicitly append special replacement characters if we\n// end on a partial character, we simply let v8 handle that.\nfunction utf16End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) {\n var end = this.lastTotal - this.lastNeed;\n return r + this.lastChar.toString('utf16le', 0, end);\n }\n return r;\n}\n\nfunction base64Text(buf, i) {\n var n = (buf.length - i) % 3;\n if (n === 0) return buf.toString('base64', i);\n this.lastNeed = 3 - n;\n this.lastTotal = 3;\n if (n === 1) {\n this.lastChar[0] = buf[buf.length - 1];\n } else {\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n }\n return buf.toString('base64', i, buf.length - n);\n}\n\nfunction base64End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed);\n return r;\n}\n\n// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\nfunction simpleWrite(buf) {\n return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n return buf && buf.length ? this.write(buf) : '';\n}\n},{\"safe-buffer\":47}],70:[function(require,module,exports){\n(function (setImmediate,clearImmediate){(function (){\nvar nextTick = require('process/browser.js').nextTick;\nvar apply = Function.prototype.apply;\nvar slice = Array.prototype.slice;\nvar immediateIds = {};\nvar nextImmediateId = 0;\n\n// DOM APIs, for completeness\n\nexports.setTimeout = function() {\n return new Timeout(apply.call(setTimeout, window, arguments), clearTimeout);\n};\nexports.setInterval = function() {\n return new Timeout(apply.call(setInterval, window, arguments), clearInterval);\n};\nexports.clearTimeout =\nexports.clearInterval = function(timeout) { timeout.close(); };\n\nfunction Timeout(id, clearFn) {\n this._id = id;\n this._clearFn = clearFn;\n}\nTimeout.prototype.unref = Timeout.prototype.ref = function() {};\nTimeout.prototype.close = function() {\n this._clearFn.call(window, this._id);\n};\n\n// Does not start the time, just sets up the members needed.\nexports.enroll = function(item, msecs) {\n clearTimeout(item._idleTimeoutId);\n item._idleTimeout = msecs;\n};\n\nexports.unenroll = function(item) {\n clearTimeout(item._idleTimeoutId);\n item._idleTimeout = -1;\n};\n\nexports._unrefActive = exports.active = function(item) {\n clearTimeout(item._idleTimeoutId);\n\n var msecs = item._idleTimeout;\n if (msecs >= 0) {\n item._idleTimeoutId = setTimeout(function onTimeout() {\n if (item._onTimeout)\n item._onTimeout();\n }, msecs);\n }\n};\n\n// That's not how node.js implements it but the exposed api is the same.\nexports.setImmediate = typeof setImmediate === \"function\" ? setImmediate : function(fn) {\n var id = nextImmediateId++;\n var args = arguments.length < 2 ? false : slice.call(arguments, 1);\n\n immediateIds[id] = true;\n\n nextTick(function onNextTick() {\n if (immediateIds[id]) {\n // fn.call() is faster so we optimize for the common use-case\n // @see http://jsperf.com/call-apply-segu\n if (args) {\n fn.apply(null, args);\n } else {\n fn.call(null);\n }\n // Prevent ids from leaking\n exports.clearImmediate(id);\n }\n });\n\n return id;\n};\n\nexports.clearImmediate = typeof clearImmediate === \"function\" ? clearImmediate : function(id) {\n delete immediateIds[id];\n};\n}).call(this)}).call(this,require(\"timers\").setImmediate,require(\"timers\").clearImmediate)\n\n},{\"process/browser.js\":42,\"timers\":70}],71:[function(require,module,exports){\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\n'use strict';\n\nvar punycode = require('punycode');\nvar util = require('./util');\n\nexports.parse = urlParse;\nexports.resolve = urlResolve;\nexports.resolveObject = urlResolveObject;\nexports.format = urlFormat;\n\nexports.Url = Url;\n\nfunction Url() {\n this.protocol = null;\n this.slashes = null;\n this.auth = null;\n this.host = null;\n this.port = null;\n this.hostname = null;\n this.hash = null;\n this.search = null;\n this.query = null;\n this.pathname = null;\n this.path = null;\n this.href = null;\n}\n\n// Reference: RFC 3986, RFC 1808, RFC 2396\n\n// define these here so at least they only have to be\n// compiled once on the first module load.\nvar protocolPattern = /^([a-z0-9.+-]+:)/i,\n portPattern = /:[0-9]*$/,\n\n // Special case for a simple path URL\n simplePathPattern = /^(\\/\\/?(?!\\/)[^\\?\\s]*)(\\?[^\\s]*)?$/,\n\n // RFC 2396: characters reserved for delimiting URLs.\n // We actually just auto-escape these.\n delims = ['<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t'],\n\n // RFC 2396: characters not allowed for various reasons.\n unwise = ['{', '}', '|', '\\\\', '^', '`'].concat(delims),\n\n // Allowed by RFCs, but cause of XSS attacks. Always escape these.\n autoEscape = ['\\''].concat(unwise),\n // Characters that are never ever allowed in a hostname.\n // Note that any invalid chars are also handled, but these\n // are the ones that are *expected* to be seen, so we fast-path\n // them.\n nonHostChars = ['%', '/', '?', ';', '#'].concat(autoEscape),\n hostEndingChars = ['/', '?', '#'],\n hostnameMaxLen = 255,\n hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/,\n hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/,\n // protocols that can allow \"unsafe\" and \"unwise\" chars.\n unsafeProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that never have a hostname.\n hostlessProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that always contain a // bit.\n slashedProtocol = {\n 'http': true,\n 'https': true,\n 'ftp': true,\n 'gopher': true,\n 'file': true,\n 'http:': true,\n 'https:': true,\n 'ftp:': true,\n 'gopher:': true,\n 'file:': true\n },\n querystring = require('querystring');\n\nfunction urlParse(url, parseQueryString, slashesDenoteHost) {\n if (url && util.isObject(url) && url instanceof Url) return url;\n\n var u = new Url;\n u.parse(url, parseQueryString, slashesDenoteHost);\n return u;\n}\n\nUrl.prototype.parse = function(url, parseQueryString, slashesDenoteHost) {\n if (!util.isString(url)) {\n throw new TypeError(\"Parameter 'url' must be a string, not \" + typeof url);\n }\n\n // Copy chrome, IE, opera backslash-handling behavior.\n // Back slashes before the query string get converted to forward slashes\n // See: https://code.google.com/p/chromium/issues/detail?id=25916\n var queryIndex = url.indexOf('?'),\n splitter =\n (queryIndex !== -1 && queryIndex < url.indexOf('#')) ? '?' : '#',\n uSplit = url.split(splitter),\n slashRegex = /\\\\/g;\n uSplit[0] = uSplit[0].replace(slashRegex, '/');\n url = uSplit.join(splitter);\n\n var rest = url;\n\n // trim before proceeding.\n // This is to support parse stuff like \" http://foo.com \\n\"\n rest = rest.trim();\n\n if (!slashesDenoteHost && url.split('#').length === 1) {\n // Try fast path regexp\n var simplePath = simplePathPattern.exec(rest);\n if (simplePath) {\n this.path = rest;\n this.href = rest;\n this.pathname = simplePath[1];\n if (simplePath[2]) {\n this.search = simplePath[2];\n if (parseQueryString) {\n this.query = querystring.parse(this.search.substr(1));\n } else {\n this.query = this.search.substr(1);\n }\n } else if (parseQueryString) {\n this.search = '';\n this.query = {};\n }\n return this;\n }\n }\n\n var proto = protocolPattern.exec(rest);\n if (proto) {\n proto = proto[0];\n var lowerProto = proto.toLowerCase();\n this.protocol = lowerProto;\n rest = rest.substr(proto.length);\n }\n\n // figure out if it's got a host\n // user@server is *always* interpreted as a hostname, and url\n // resolution will treat //foo/bar as host=foo,path=bar because that's\n // how the browser resolves relative URLs.\n if (slashesDenoteHost || proto || rest.match(/^\\/\\/[^@\\/]+@[^@\\/]+/)) {\n var slashes = rest.substr(0, 2) === '//';\n if (slashes && !(proto && hostlessProtocol[proto])) {\n rest = rest.substr(2);\n this.slashes = true;\n }\n }\n\n if (!hostlessProtocol[proto] &&\n (slashes || (proto && !slashedProtocol[proto]))) {\n\n // there's a hostname.\n // the first instance of /, ?, ;, or # ends the host.\n //\n // If there is an @ in the hostname, then non-host chars *are* allowed\n // to the left of the last @ sign, unless some host-ending character\n // comes *before* the @-sign.\n // URLs are obnoxious.\n //\n // ex:\n // http://a@b@c/ => user:a@b host:c\n // http://a@b?@c => user:a host:c path:/?@c\n\n // v0.12 TODO(isaacs): This is not quite how Chrome does things.\n // Review our test case against browsers more comprehensively.\n\n // find the first instance of any hostEndingChars\n var hostEnd = -1;\n for (var i = 0; i < hostEndingChars.length; i++) {\n var hec = rest.indexOf(hostEndingChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n\n // at this point, either we have an explicit point where the\n // auth portion cannot go past, or the last @ char is the decider.\n var auth, atSign;\n if (hostEnd === -1) {\n // atSign can be anywhere.\n atSign = rest.lastIndexOf('@');\n } else {\n // atSign must be in auth portion.\n // http://a@b/c@d => host:b auth:a path:/c@d\n atSign = rest.lastIndexOf('@', hostEnd);\n }\n\n // Now we have a portion which is definitely the auth.\n // Pull that off.\n if (atSign !== -1) {\n auth = rest.slice(0, atSign);\n rest = rest.slice(atSign + 1);\n this.auth = decodeURIComponent(auth);\n }\n\n // the host is the remaining to the left of the first non-host char\n hostEnd = -1;\n for (var i = 0; i < nonHostChars.length; i++) {\n var hec = rest.indexOf(nonHostChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n // if we still have not hit it, then the entire thing is a host.\n if (hostEnd === -1)\n hostEnd = rest.length;\n\n this.host = rest.slice(0, hostEnd);\n rest = rest.slice(hostEnd);\n\n // pull out port.\n this.parseHost();\n\n // we've indicated that there is a hostname,\n // so even if it's empty, it has to be present.\n this.hostname = this.hostname || '';\n\n // if hostname begins with [ and ends with ]\n // assume that it's an IPv6 address.\n var ipv6Hostname = this.hostname[0] === '[' &&\n this.hostname[this.hostname.length - 1] === ']';\n\n // validate a little.\n if (!ipv6Hostname) {\n var hostparts = this.hostname.split(/\\./);\n for (var i = 0, l = hostparts.length; i < l; i++) {\n var part = hostparts[i];\n if (!part) continue;\n if (!part.match(hostnamePartPattern)) {\n var newpart = '';\n for (var j = 0, k = part.length; j < k; j++) {\n if (part.charCodeAt(j) > 127) {\n // we replace non-ASCII char with a temporary placeholder\n // we need this to make sure size of hostname is not\n // broken by replacing non-ASCII by nothing\n newpart += 'x';\n } else {\n newpart += part[j];\n }\n }\n // we test again with ASCII char only\n if (!newpart.match(hostnamePartPattern)) {\n var validParts = hostparts.slice(0, i);\n var notHost = hostparts.slice(i + 1);\n var bit = part.match(hostnamePartStart);\n if (bit) {\n validParts.push(bit[1]);\n notHost.unshift(bit[2]);\n }\n if (notHost.length) {\n rest = '/' + notHost.join('.') + rest;\n }\n this.hostname = validParts.join('.');\n break;\n }\n }\n }\n }\n\n if (this.hostname.length > hostnameMaxLen) {\n this.hostname = '';\n } else {\n // hostnames are always lower case.\n this.hostname = this.hostname.toLowerCase();\n }\n\n if (!ipv6Hostname) {\n // IDNA Support: Returns a punycoded representation of \"domain\".\n // It only converts parts of the domain name that\n // have non-ASCII characters, i.e. it doesn't matter if\n // you call it with a domain that already is ASCII-only.\n this.hostname = punycode.toASCII(this.hostname);\n }\n\n var p = this.port ? ':' + this.port : '';\n var h = this.hostname || '';\n this.host = h + p;\n this.href += this.host;\n\n // strip [ and ] from the hostname\n // the host field still retains them, though\n if (ipv6Hostname) {\n this.hostname = this.hostname.substr(1, this.hostname.length - 2);\n if (rest[0] !== '/') {\n rest = '/' + rest;\n }\n }\n }\n\n // now rest is set to the post-host stuff.\n // chop off any delim chars.\n if (!unsafeProtocol[lowerProto]) {\n\n // First, make 100% sure that any \"autoEscape\" chars get\n // escaped, even if encodeURIComponent doesn't think they\n // need to be.\n for (var i = 0, l = autoEscape.length; i < l; i++) {\n var ae = autoEscape[i];\n if (rest.indexOf(ae) === -1)\n continue;\n var esc = encodeURIComponent(ae);\n if (esc === ae) {\n esc = escape(ae);\n }\n rest = rest.split(ae).join(esc);\n }\n }\n\n\n // chop off from the tail first.\n var hash = rest.indexOf('#');\n if (hash !== -1) {\n // got a fragment string.\n this.hash = rest.substr(hash);\n rest = rest.slice(0, hash);\n }\n var qm = rest.indexOf('?');\n if (qm !== -1) {\n this.search = rest.substr(qm);\n this.query = rest.substr(qm + 1);\n if (parseQueryString) {\n this.query = querystring.parse(this.query);\n }\n rest = rest.slice(0, qm);\n } else if (parseQueryString) {\n // no query string, but parseQueryString still requested\n this.search = '';\n this.query = {};\n }\n if (rest) this.pathname = rest;\n if (slashedProtocol[lowerProto] &&\n this.hostname && !this.pathname) {\n this.pathname = '/';\n }\n\n //to support http.request\n if (this.pathname || this.search) {\n var p = this.pathname || '';\n var s = this.search || '';\n this.path = p + s;\n }\n\n // finally, reconstruct the href based on what has been validated.\n this.href = this.format();\n return this;\n};\n\n// format a parsed object into a url string\nfunction urlFormat(obj) {\n // ensure it's an object, and not a string url.\n // If it's an obj, this is a no-op.\n // this way, you can call url_format() on strings\n // to clean up potentially wonky urls.\n if (util.isString(obj)) obj = urlParse(obj);\n if (!(obj instanceof Url)) return Url.prototype.format.call(obj);\n return obj.format();\n}\n\nUrl.prototype.format = function() {\n var auth = this.auth || '';\n if (auth) {\n auth = encodeURIComponent(auth);\n auth = auth.replace(/%3A/i, ':');\n auth += '@';\n }\n\n var protocol = this.protocol || '',\n pathname = this.pathname || '',\n hash = this.hash || '',\n host = false,\n query = '';\n\n if (this.host) {\n host = auth + this.host;\n } else if (this.hostname) {\n host = auth + (this.hostname.indexOf(':') === -1 ?\n this.hostname :\n '[' + this.hostname + ']');\n if (this.port) {\n host += ':' + this.port;\n }\n }\n\n if (this.query &&\n util.isObject(this.query) &&\n Object.keys(this.query).length) {\n query = querystring.stringify(this.query);\n }\n\n var search = this.search || (query && ('?' + query)) || '';\n\n if (protocol && protocol.substr(-1) !== ':') protocol += ':';\n\n // only the slashedProtocols get the //. Not mailto:, xmpp:, etc.\n // unless they had them to begin with.\n if (this.slashes ||\n (!protocol || slashedProtocol[protocol]) && host !== false) {\n host = '//' + (host || '');\n if (pathname && pathname.charAt(0) !== '/') pathname = '/' + pathname;\n } else if (!host) {\n host = '';\n }\n\n if (hash && hash.charAt(0) !== '#') hash = '#' + hash;\n if (search && search.charAt(0) !== '?') search = '?' + search;\n\n pathname = pathname.replace(/[?#]/g, function(match) {\n return encodeURIComponent(match);\n });\n search = search.replace('#', '%23');\n\n return protocol + host + pathname + search + hash;\n};\n\nfunction urlResolve(source, relative) {\n return urlParse(source, false, true).resolve(relative);\n}\n\nUrl.prototype.resolve = function(relative) {\n return this.resolveObject(urlParse(relative, false, true)).format();\n};\n\nfunction urlResolveObject(source, relative) {\n if (!source) return relative;\n return urlParse(source, false, true).resolveObject(relative);\n}\n\nUrl.prototype.resolveObject = function(relative) {\n if (util.isString(relative)) {\n var rel = new Url();\n rel.parse(relative, false, true);\n relative = rel;\n }\n\n var result = new Url();\n var tkeys = Object.keys(this);\n for (var tk = 0; tk < tkeys.length; tk++) {\n var tkey = tkeys[tk];\n result[tkey] = this[tkey];\n }\n\n // hash is always overridden, no matter what.\n // even href=\"\" will remove it.\n result.hash = relative.hash;\n\n // if the relative url is empty, then there's nothing left to do here.\n if (relative.href === '') {\n result.href = result.format();\n return result;\n }\n\n // hrefs like //foo/bar always cut to the protocol.\n if (relative.slashes && !relative.protocol) {\n // take everything except the protocol from relative\n var rkeys = Object.keys(relative);\n for (var rk = 0; rk < rkeys.length; rk++) {\n var rkey = rkeys[rk];\n if (rkey !== 'protocol')\n result[rkey] = relative[rkey];\n }\n\n //urlParse appends trailing / to urls like http://www.example.com\n if (slashedProtocol[result.protocol] &&\n result.hostname && !result.pathname) {\n result.path = result.pathname = '/';\n }\n\n result.href = result.format();\n return result;\n }\n\n if (relative.protocol && relative.protocol !== result.protocol) {\n // if it's a known url protocol, then changing\n // the protocol does weird things\n // first, if it's not file:, then we MUST have a host,\n // and if there was a path\n // to begin with, then we MUST have a path.\n // if it is file:, then the host is dropped,\n // because that's known to be hostless.\n // anything else is assumed to be absolute.\n if (!slashedProtocol[relative.protocol]) {\n var keys = Object.keys(relative);\n for (var v = 0; v < keys.length; v++) {\n var k = keys[v];\n result[k] = relative[k];\n }\n result.href = result.format();\n return result;\n }\n\n result.protocol = relative.protocol;\n if (!relative.host && !hostlessProtocol[relative.protocol]) {\n var relPath = (relative.pathname || '').split('/');\n while (relPath.length && !(relative.host = relPath.shift()));\n if (!relative.host) relative.host = '';\n if (!relative.hostname) relative.hostname = '';\n if (relPath[0] !== '') relPath.unshift('');\n if (relPath.length < 2) relPath.unshift('');\n result.pathname = relPath.join('/');\n } else {\n result.pathname = relative.pathname;\n }\n result.search = relative.search;\n result.query = relative.query;\n result.host = relative.host || '';\n result.auth = relative.auth;\n result.hostname = relative.hostname || relative.host;\n result.port = relative.port;\n // to support http.request\n if (result.pathname || result.search) {\n var p = result.pathname || '';\n var s = result.search || '';\n result.path = p + s;\n }\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n }\n\n var isSourceAbs = (result.pathname && result.pathname.charAt(0) === '/'),\n isRelAbs = (\n relative.host ||\n relative.pathname && relative.pathname.charAt(0) === '/'\n ),\n mustEndAbs = (isRelAbs || isSourceAbs ||\n (result.host && relative.pathname)),\n removeAllDots = mustEndAbs,\n srcPath = result.pathname && result.pathname.split('/') || [],\n relPath = relative.pathname && relative.pathname.split('/') || [],\n psychotic = result.protocol && !slashedProtocol[result.protocol];\n\n // if the url is a non-slashed url, then relative\n // links like ../.. should be able\n // to crawl up to the hostname, as well. This is strange.\n // result.protocol has already been set by now.\n // Later on, put the first path part into the host field.\n if (psychotic) {\n result.hostname = '';\n result.port = null;\n if (result.host) {\n if (srcPath[0] === '') srcPath[0] = result.host;\n else srcPath.unshift(result.host);\n }\n result.host = '';\n if (relative.protocol) {\n relative.hostname = null;\n relative.port = null;\n if (relative.host) {\n if (relPath[0] === '') relPath[0] = relative.host;\n else relPath.unshift(relative.host);\n }\n relative.host = null;\n }\n mustEndAbs = mustEndAbs && (relPath[0] === '' || srcPath[0] === '');\n }\n\n if (isRelAbs) {\n // it's absolute.\n result.host = (relative.host || relative.host === '') ?\n relative.host : result.host;\n result.hostname = (relative.hostname || relative.hostname === '') ?\n relative.hostname : result.hostname;\n result.search = relative.search;\n result.query = relative.query;\n srcPath = relPath;\n // fall through to the dot-handling below.\n } else if (relPath.length) {\n // it's relative\n // throw away the existing file, and take the new path instead.\n if (!srcPath) srcPath = [];\n srcPath.pop();\n srcPath = srcPath.concat(relPath);\n result.search = relative.search;\n result.query = relative.query;\n } else if (!util.isNullOrUndefined(relative.search)) {\n // just pull out the search.\n // like href='?foo'.\n // Put this after the other two cases because it simplifies the booleans\n if (psychotic) {\n result.hostname = result.host = srcPath.shift();\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost = result.host && result.host.indexOf('@') > 0 ?\n result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n result.search = relative.search;\n result.query = relative.query;\n //to support http.request\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path = (result.pathname ? result.pathname : '') +\n (result.search ? result.search : '');\n }\n result.href = result.format();\n return result;\n }\n\n if (!srcPath.length) {\n // no path at all. easy.\n // we've already handled the other stuff above.\n result.pathname = null;\n //to support http.request\n if (result.search) {\n result.path = '/' + result.search;\n } else {\n result.path = null;\n }\n result.href = result.format();\n return result;\n }\n\n // if a url ENDs in . or .., then it must get a trailing slash.\n // however, if it ends in anything else non-slashy,\n // then it must NOT get a trailing slash.\n var last = srcPath.slice(-1)[0];\n var hasTrailingSlash = (\n (result.host || relative.host || srcPath.length > 1) &&\n (last === '.' || last === '..') || last === '');\n\n // strip single dots, resolve double dots to parent dir\n // if the path tries to go above the root, `up` ends up > 0\n var up = 0;\n for (var i = srcPath.length; i >= 0; i--) {\n last = srcPath[i];\n if (last === '.') {\n srcPath.splice(i, 1);\n } else if (last === '..') {\n srcPath.splice(i, 1);\n up++;\n } else if (up) {\n srcPath.splice(i, 1);\n up--;\n }\n }\n\n // if the path is allowed to go above the root, restore leading ..s\n if (!mustEndAbs && !removeAllDots) {\n for (; up--; up) {\n srcPath.unshift('..');\n }\n }\n\n if (mustEndAbs && srcPath[0] !== '' &&\n (!srcPath[0] || srcPath[0].charAt(0) !== '/')) {\n srcPath.unshift('');\n }\n\n if (hasTrailingSlash && (srcPath.join('/').substr(-1) !== '/')) {\n srcPath.push('');\n }\n\n var isAbsolute = srcPath[0] === '' ||\n (srcPath[0] && srcPath[0].charAt(0) === '/');\n\n // put the host back\n if (psychotic) {\n result.hostname = result.host = isAbsolute ? '' :\n srcPath.length ? srcPath.shift() : '';\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost = result.host && result.host.indexOf('@') > 0 ?\n result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n\n mustEndAbs = mustEndAbs || (result.host && srcPath.length);\n\n if (mustEndAbs && !isAbsolute) {\n srcPath.unshift('');\n }\n\n if (!srcPath.length) {\n result.pathname = null;\n result.path = null;\n } else {\n result.pathname = srcPath.join('/');\n }\n\n //to support request.http\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path = (result.pathname ? result.pathname : '') +\n (result.search ? result.search : '');\n }\n result.auth = relative.auth || result.auth;\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n};\n\nUrl.prototype.parseHost = function() {\n var host = this.host;\n var port = portPattern.exec(host);\n if (port) {\n port = port[0];\n if (port !== ':') {\n this.port = port.substr(1);\n }\n host = host.substr(0, host.length - port.length);\n }\n if (host) this.hostname = host;\n};\n\n},{\"./util\":72,\"punycode\":43,\"querystring\":46}],72:[function(require,module,exports){\n'use strict';\n\nmodule.exports = {\n isString: function(arg) {\n return typeof(arg) === 'string';\n },\n isObject: function(arg) {\n return typeof(arg) === 'object' && arg !== null;\n },\n isNull: function(arg) {\n return arg === null;\n },\n isNullOrUndefined: function(arg) {\n return arg == null;\n }\n};\n\n},{}],73:[function(require,module,exports){\n(function (global){(function (){\n\n/**\n * Module exports.\n */\n\nmodule.exports = deprecate;\n\n/**\n * Mark that a method should not be used.\n * Returns a modified function which warns once by default.\n *\n * If `localStorage.noDeprecation = true` is set, then it is a no-op.\n *\n * If `localStorage.throwDeprecation = true` is set, then deprecated functions\n * will throw an Error when invoked.\n *\n * If `localStorage.traceDeprecation = true` is set, then deprecated functions\n * will invoke `console.trace()` instead of `console.error()`.\n *\n * @param {Function} fn - the function to deprecate\n * @param {String} msg - the string to print to the console when `fn` is invoked\n * @returns {Function} a new \"deprecated\" version of `fn`\n * @api public\n */\n\nfunction deprecate (fn, msg) {\n if (config('noDeprecation')) {\n return fn;\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (config('throwDeprecation')) {\n throw new Error(msg);\n } else if (config('traceDeprecation')) {\n console.trace(msg);\n } else {\n console.warn(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n}\n\n/**\n * Checks `localStorage` for boolean values for the given `name`.\n *\n * @param {String} name\n * @returns {Boolean}\n * @api private\n */\n\nfunction config (name) {\n // accessing global.localStorage can trigger a DOMException in sandboxed iframes\n try {\n if (!global.localStorage) return false;\n } catch (_) {\n return false;\n }\n var val = global.localStorage[name];\n if (null == val) return false;\n return String(val).toLowerCase() === 'true';\n}\n\n}).call(this)}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n\n},{}],74:[function(require,module,exports){\n// Returns a wrapper function that returns a wrapped callback\n// The wrapper function should do some stuff, and return a\n// presumably different callback function.\n// This makes sure that own properties are retained, so that\n// decorations and such are not lost along the way.\nmodule.exports = wrappy\nfunction wrappy (fn, cb) {\n if (fn && cb) return wrappy(fn)(cb)\n\n if (typeof fn !== 'function')\n throw new TypeError('need wrapper function')\n\n Object.keys(fn).forEach(function (k) {\n wrapper[k] = fn[k]\n })\n\n return wrapper\n\n function wrapper() {\n var args = new Array(arguments.length)\n for (var i = 0; i < args.length; i++) {\n args[i] = arguments[i]\n }\n var ret = fn.apply(this, args)\n var cb = args[args.length-1]\n if (typeof ret === 'function' && ret !== cb) {\n Object.keys(cb).forEach(function (k) {\n ret[k] = cb[k]\n })\n }\n return ret\n }\n}\n\n},{}],75:[function(require,module,exports){\nmodule.exports = extend\n\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\nfunction extend() {\n var target = {}\n\n for (var i = 0; i < arguments.length; i++) {\n var source = arguments[i]\n\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n target[key] = source[key]\n }\n }\n }\n\n return target\n}\n\n},{}],76:[function(require,module,exports){\nvar libNPMModuleWrapper = require('./Fable.js');\n\nif ((typeof(window) === 'object') && !window.hasOwnProperty('Fable'))\n{\n\twindow.Fable = libNPMModuleWrapper;\n}\n\nmodule.exports = libNPMModuleWrapper;\n},{\"./Fable.js\":81}],77:[function(require,module,exports){\nconst _OperationStatePrototype = JSON.stringify(\n{\n\t\"Metadata\": {\n\t\t\"GUID\": false,\n\t\t\"Hash\": false,\n\n\t\t\"Title\": \"\",\n\t\t\"Summary\": \"\",\n\n\t\t\"Version\": 0\n\t},\n\t\"Status\": {\n \"Completed\": false,\n\n \"CompletionProgress\": 0,\n \"CompletionTimeElapsed\": 0,\n\n \"Steps\": 1,\n \"StepsCompleted\": 0,\n\n \"StartTime\": 0,\n \"EndTime\": 0\n\t},\n\t\"Errors\": [],\n\t\"Log\": []\n});\n\nclass FableOperation\n{\n\tconstructor(pFable, pOperationName, pOperationHash)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.name = pOperationName;\n\n\t\tthis.state = JSON.parse(_OperationStatePrototype);\n\n\t\tthis.state.Metadata.GUID = this.fable.getUUID();\n\t\tthis.state.Metadata.Hash = this.state.GUID;\n\n\t\tif (typeof(pOperationHash) == 'string')\n\t\t{\n\t\t\tthis.state.Metadata.Hash = pOperationHash;\n\t\t}\n\t}\n\n\tget GUID()\n\t{\n\t\treturn this.state.Metadata.GUID;\n\t}\n\n\tget Hash()\n\t{\n\t\treturn this.state.Metadata.Hash;\n\t}\n\n\tget log()\n\t{\n\t\treturn this;\n\t}\n\n\twriteOperationLog(pLogLevel, pLogText, pLogObject)\n\t{\n\t\tthis.state.Log.push(`${new Date().toUTCString()} [${pLogLevel}]: ${pLogText}`);\n\n\t\tif (typeof(pLogObject) == 'object')\n\t\t{\n\t\t\tthis.state.Log.push(JSON.stringify(pLogObject));\n\t\t}\n\t}\n\n\twriteOperationErrors(pLogText, pLogObject)\n\t{\n\t\tthis.state.Errors.push(`${pLogText}`);\n\n\t\tif (typeof(pLogObject) == 'object')\n\t\t{\n\t\t\tthis.state.Errors.push(JSON.stringify(pLogObject));\n\t\t}\n\t}\n\n\ttrace(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('TRACE', pLogText, pLogObject);\n\t\tthis.fable.log.trace(pLogText, pLogObject);\n\t}\n\n\tdebug(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('DEBUG', pLogText, pLogObject);\n\t\tthis.fable.log.debug(pLogText, pLogObject);\n\t}\n\n\tinfo(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('INFO', pLogText, pLogObject);\n\t\tthis.fable.log.info(pLogText, pLogObject);\n\t}\n\n\twarn(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('WARN', pLogText, pLogObject);\n\t\tthis.fable.log.warn(pLogText, pLogObject);\n\t}\n\n\terror(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('ERROR', pLogText, pLogObject);\n\t\tthis.writeOperationErrors(pLogText, pLogObject);\n\t\tthis.fable.log.error(pLogText, pLogObject);\n\t}\n\n\tfatal(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('FATAL', pLogText, pLogObject);\n\t\tthis.writeOperationErrors(pLogText, pLogObject);\n\t\tthis.fable.log.fatal(pLogText, pLogObject);\n\t}\n}\n\nmodule.exports = FableOperation;\n},{}],78:[function(require,module,exports){\n/**\n* Fable Core Pre-initialization Service Base\n*\n* For a couple services, we need to be able to instantiate them before the Fable object is fully initialized.\n* This is a base class for those services.\n*\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\nclass FablePreinitServiceProviderBase\n{\n\tconstructor(pOptions, pServiceHash)\n\t{\n\t\tthis.fable = false;\n\n\t\tthis.options = (typeof(pOptions) === 'object') ? pOptions : {};\n\n this.serviceType = 'Unknown';\n\n\t\t// The hash will be a non-standard UUID ... the UUID service uses this base class!\n this.UUID = `CORESVC-${Math.floor((Math.random() * (99999 - 10000)) + 10000)}`;\n\n this.Hash = (typeof(pServiceHash) === 'string') ? pServiceHash : `${this.UUID}`;\n\t}\n\n\t// After fable is initialized, it would be expected to be wired in as a normal service.\n\tconnectFable(pFable)\n\t{\n\t\tthis.fable = pFable;\n\n\t\treturn true;\n\t}\n}\n\nmodule.exports = FablePreinitServiceProviderBase;\n},{}],79:[function(require,module,exports){\n/**\n* Fable Application Services Management\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\nconst libFableServiceBase = require('./Fable-ServiceProviderBase.js');\n\nclass FableService\n{\n\tconstructor(pFable)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.serviceTypes = [];\n\n\t\t// A map of instantiated services\n\t\tthis.services = {};\n\n\t\t// A map of the default instantiated service by type\n\t\tthis.defaultServices = {};\n\n\t\t// A map of class constructors for services\n\t\tthis.serviceClasses = {};\n\t}\n\n\taddServiceType(pServiceType, pServiceClass)\n\t{\n\t\t// Add the type to the list of types\n\t\tthis.serviceTypes.push(pServiceType);\n\n\t\t// Add the container for instantiated services to go in\n\t\tthis.services[pServiceType] = {};\n\n\t\tif ((typeof(pServiceClass) == 'function') && (pServiceClass.prototype instanceof libFableServiceBase))\n\t\t{\n\t\t\t// Add the class to the list of classes\n\t\t\tthis.serviceClasses[pServiceType] = pServiceClass;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Add the base class to the list of classes\n\t\t\tthis.serviceClasses[pServiceType] = libFableServiceBase;\n\t\t}\n\t}\n\n\tinstantiateServiceProvider(pServiceType, pOptions, pCustomServiceHash)\n\t{\n\t\t// Instantiate the service\n\t\tlet tmpService = this.instantiateServiceProviderWithoutRegistration(pServiceType, pOptions, pCustomServiceHash);\n\n\t\t// Add the service to the service map\n\t\tthis.services[pServiceType][tmpService.Hash] = tmpService;\n\n\t\t// If this is the first service of this type, make it the default\n\t\tif (!this.defaultServices.hasOwnProperty(pServiceType))\n\t\t{\n\t\t\tthis.defaultServices[pServiceType] = tmpService;\n\t\t}\n\n\t\treturn tmpService;\n\t}\n\n\t// Create a service provider but don't register it to live forever in fable.services\n\tinstantiateServiceProviderWithoutRegistration(pServiceType, pOptions, pCustomServiceHash)\n\t{\n\t\t// Instantiate the service\n\t\tlet tmpService = new this.serviceClasses[pServiceType](this.fable, pOptions, pCustomServiceHash);\n\t\treturn tmpService;\n\t}\n\n\t// Connect an initialized service provider that came before Fable was initialized\n\tconnectPreinitServiceProviderInstance(pServiceInstance)\n\t{\n\t\tlet tmpServiceType = pServiceInstance.serviceType;\n\t\tlet tmpServiceHash = pServiceInstance.Hash;\n\n\t\t// The service should already be instantiated, so just connect it to fable\n\t\tpServiceInstance.connectFable(this.fable);\n\n\t\tif (!this.services.hasOwnProperty(tmpServiceType))\n\t\t{\n\t\t\t// If the core service hasn't registered itself yet, create the service container for it.\n\t\t\t// This means you couldn't register another with this type unless it was later registered with a constructor class.\n\t\t\tthis.services[tmpServiceType] = {};\n\t\t}\n\t\t// Add the service to the service map\n\t\tthis.services[tmpServiceType][tmpServiceHash] = pServiceInstance;\n\n\t\t// If this is the first service of this type, make it the default\n\t\tif (!this.defaultServices.hasOwnProperty(tmpServiceType))\n\t\t{\n\t\t\tthis.defaultServices[tmpServiceType] = pServiceInstance;\n\t\t}\n\n\t\treturn pServiceInstance;\n\t}\n\n\tsetDefaultServiceInstantiation(pServiceType, pServiceHash)\n\t{\n\t\tif (this.services[pServiceType].hasOwnProperty(pServiceHash))\n\t\t{\n\t\t\tthis.defaultServices[pServiceType] = this.services[pServiceType][pServiceHash];\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n}\n\nmodule.exports = FableService;\n\nmodule.exports.ServiceProviderBase = libFableServiceBase;\n},{\"./Fable-ServiceProviderBase.js\":80}],80:[function(require,module,exports){\n/**\n* Fable Service Base\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\nclass FableServiceProviderBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.options = (typeof(pOptions) === 'object') ? pOptions : {};\n\n this.serviceType = 'Unknown';\n\n this.UUID = pFable.getUUID();\n\n this.Hash = (typeof(pServiceHash) === 'string') ? pServiceHash : `${this.UUID}`;\n\t}\n}\n\nmodule.exports = FableServiceProviderBase;\n\n},{}],81:[function(require,module,exports){\n/**\n* Fable Application Services Support Library\n* @license MIT\n* @author <steven@velozo.com>\n*/\n// Pre-init services\nconst libFableSettings = require('fable-settings');\nconst libFableUUID = require('fable-uuid');\nconst libFableLog = require('fable-log');\n\nconst libFablePreinitServiceProviderBase = require('./Fable-PreinitServiceProviderBase.js');\nconst libFableServiceManager = require('./Fable-ServiceManager.js');\n\n// Services\nconst libFableServiceDataArithmatic = require('./services/Fable-Service-DataArithmatic.js');\nconst libFableServiceMetaTemplate = require('./services/Fable-Service-MetaTemplate.js');\nconst libFableServiceRestClient = require('./services/Fable-Service-RestClient.js');\nconst libFableServiceTemplate = require('./services/Fable-Service-Template.js');\nconst libFableServiceUtility = require('./services/Fable-Service-Utility.js');\n\nconst libFableOperation = require('./Fable-Operation.js');\n\nclass Fable\n{\n\tconstructor(pSettings)\n\t{\n\t\tlet tmpSettings = new libFableSettings(pSettings);\n\n\t\tthis.settingsManager = tmpSettings;\n\n\t\t// Instantiate the UUID generator\n\t\tthis.libUUID = new libFableUUID(this.settingsManager.settings);\n\n\t\tthis.log = new libFableLog(this.settingsManager.settings);\n\t\tthis.log.initialize();\n\n\t\t// Built-in dependencies\n\t\tthis.Dependencies = (\n\t\t\t{\n\t\t\t\tprecedent: libFableSettings.precedent\n\t\t\t});\n\n\t\t// Location for Operation state\n\t\tthis.Operations = {};\n\n\t\tthis.serviceManager = new libFableServiceManager(this);\n\n\t\t// Initialize and instantiate the default baked-in Data Arithmatic service\n\t\tthis.serviceManager.addServiceType('DataArithmatic', libFableServiceDataArithmatic);\n\t\tthis.fable.serviceManager.instantiateServiceProvider('DataArithmatic', {}, 'Default-Service-DataArithmatic');\n\t\t// This service is passing through the data arithmatic library\n\t\tthis.DataArithmatic = this.serviceManager.defaultServices.DataArithmatic._DataArithmaticLibrary;\n\n\t\t// Initialize the template service\n\t\tthis.serviceManager.addServiceType('Template', libFableServiceTemplate);\n\n\t\t// Initialize the metatemplate service\n\t\tthis.serviceManager.addServiceType('MetaTemplate', libFableServiceMetaTemplate);\n\n\t\t// Initialize and instantiate the default baked-in Utility service\n\t\tthis.serviceManager.addServiceType('Utility', libFableServiceUtility)\n\t\tthis.fable.serviceManager.instantiateServiceProvider('Utility', {}, 'Default-Service-Utility');\n\t\tthis.Utility = this.serviceManager.defaultServices.Utility;\n\n\t\t// Add the REST Client service type\n\t\tthis.serviceManager.addServiceType('RestClient', libFableServiceRestClient);\n\n\t\tthis.services = this.serviceManager.services;\n\t\tthis.defaultServices = this.serviceManager.defaultServices;\n\t}\n\n\tget settings()\n\t{\n\t\treturn this.settingsManager.settings;\n\t}\n\n\tget fable()\n\t{\n\t\treturn this;\n\t}\n\n\tgetUUID()\n\t{\n\t\treturn this.libUUID.getUUID();\n\t}\n\n\tcreateOperation(pOperationName, pOperationHash)\n\t{\n\t\tlet tmpOperation = new libFableOperation(this, pOperationName, pOperationHash);\n\n\t\tif (this.Operations.hasOwnProperty(tmpOperation.Hash))\n\t\t{\n\t\t\t// Uh Oh ...... Operation Hash Collision!\n\t\t\t// TODO: What to do?!\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.Operations[tmpOperation.Hash] = tmpOperation;\n\t\t}\n\n\t\treturn tmpOperation;\n\t}\n\n\tgetOperation(pOperationHash)\n\t{\n\t\tif (!this.Operations.hasOwnProperty(pOperationHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.Operations[pOperationHash];\n\t\t}\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new Fable(pSettings);\n}\n\nmodule.exports = Fable;\nmodule.exports.new = autoConstruct;\n\nmodule.exports.LogProviderBase = libFableLog.LogProviderBase;\nmodule.exports.ServiceProviderBase = libFableServiceManager.ServiceProviderBase;\nmodule.exports.PreinitServiceProviderBase = libFablePreinitServiceProviderBase;\n\nmodule.exports.precedent = libFableSettings.precedent;\n},{\"./Fable-Operation.js\":77,\"./Fable-PreinitServiceProviderBase.js\":78,\"./Fable-ServiceManager.js\":79,\"./services/Fable-Service-DataArithmatic.js\":82,\"./services/Fable-Service-MetaTemplate.js\":83,\"./services/Fable-Service-RestClient.js\":84,\"./services/Fable-Service-Template.js\":85,\"./services/Fable-Service-Utility.js\":86,\"fable-log\":28,\"fable-settings\":31,\"fable-uuid\":33}],82:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceProviderBase.js');\n\nconst libDataArithmatic = require('data-arithmatic');\n\nclass FableServiceDataArithmatic extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'DataArithmatic';\n\n this._DataArithmaticLibrary = new libDataArithmatic();\n\t}\n}\n\nmodule.exports = FableServiceDataArithmatic;\n},{\"../Fable-ServiceProviderBase.js\":80,\"data-arithmatic\":21}],83:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceProviderBase.js');\n\nconst libPrecedent = require('precedent');\n\nclass FableServiceMetaTemplate extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'MetaTemplate';\n\n this._MetaTemplateLibrary = new libPrecedent(this.options);\n\t}\n\n\t/**\n\t * Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pTree - A node on the parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern(pPatternStart, pPatternEnd, pParser)\n\t{\n\t\treturn this._MetaTemplateLibrary.addPattern(pPatternStart, pPatternEnd, pParser);\n\t}\n\n\t/**\n\t * Parse a string with the existing parse tree\n\t * @method parseString\n\t * @param {string} pString - The string to parse\n\t * @return {string} The result from the parser\n\t */\n\tparseString(pString, pData)\n\t{\n\t\treturn this._MetaTemplateLibrary.parseString(pString, pData);\n\t}\n}\n\nmodule.exports = FableServiceMetaTemplate;\n},{\"../Fable-ServiceProviderBase.js\":80,\"precedent\":39}],84:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceProviderBase.js');\n\nconst libSimpleGet = require('simple-get');\n\nclass FableServiceRestClient extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'RestClient';\n\n this._SimpleGet = new libSimpleGet();\n\t}\n}\n\nmodule.exports = FableServiceRestClient;\n},{\"../Fable-ServiceProviderBase.js\":80,\"simple-get\":49}],85:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceProviderBase.js');\n\nclass FableServiceTemplate extends libFableServiceBase\n{\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\t//\n\t// NOTE: This does not implement underscore escape expressions\n\t// NOTE: This does not implement underscore magic browser variable assignment\n\t//\n\t// This is an implementation of that.\n\t// TODO: Make this use precedent, add configuration, add debugging.\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'Template';\n\n\t\t// These are the exact regex's used in lodash/underscore\n\t\t// TODO: Switch this to precedent\n\t\tthis.Matchers = (\n\t\t\t{\n\t\t\t\tEvaluate: /<%([\\s\\S]+?)%>/g,\n\t\t\t\tInterpolate: /<%=([\\s\\S]+?)%>/g,\n\t\t\t\tEscaper: /\\\\|'|\\r|\\n|\\t|\\u2028|\\u2029/g,\n\t\t\t\tUnescaper: /\\\\(\\\\|'|r|n|t|u2028|u2029)/g,\n\t\t\t\t// This is how underscore does it, so we are keeping it for now.\n\t\t\t\tGuaranteedNonMatch: /.^/\n\t\t\t});\n\n\t\t// This is a helper for the escaper and unescaper functions.\n\t\t// Right now we are going to keep what underscore is doing, but, not forever.\n\t\tthis.templateEscapes = {\n\t\t\t'\\\\': '\\\\',\n\t\t\t\"'\": \"'\",\n\t\t\t'r': '\\r',\n\t\t\t'\\r': 'r',\n\t\t\t'n': '\\n',\n\t\t\t'\\n': 'n',\n\t\t\t't': '\\t',\n\t\t\t'\\t': 't',\n\t\t\t'u2028': '\\u2028',\n\t\t\t'\\u2028': 'u2028',\n\t\t\t'u2029': '\\u2029',\n\t\t\t'\\u2029': 'u2029'\n\t\t};\n\n\t\t// This is defined as such to underscore that it is a dynamic programming\n\t\t// function on this class.\n\t\tthis.renderFunction = false;\n this.templateString = false;\n\t}\n\n\trenderTemplate(pData)\n\t{\n\t\treturn this.renderFunction(pData);\n\t}\n\n\ttemplateFunction(pData)\n\t{\n\t\tlet fRenderTemplateBound = this.renderTemplate.bind(this);\n\t\treturn fRenderTemplateBound;\n\t}\n\n\tbuildTemplateFunction(pTemplateText, pData)\n\t{\n\t\t// For now this is being kept in a weird form ... this is to mimic the old\n\t\t// underscore code until this is rewritten using precedent.\n\t\tthis.TemplateSource = \"__p+='\" + pTemplateText\n\t\t\t.replace(this.Matchers.Escaper,\n\t\t\t\t(pMatch)=>\n\t\t\t\t{\n\t\t\t\t\treturn `\\\\${this.templateEscapes[pMatch]}`;\n\t\t\t\t})\n\t\t\t.replace(this.Matchers.Interpolate || this.Matchers.GuaranteedNonMatch,\n\t\t\t\t(pMatch, pCode) =>\n\t\t\t\t{\n\t\t\t\t\treturn `'+\\n(${decodeURIComponent(pCode)})+\\n'`;\n\t\t\t\t})\n\t\t\t.replace(this.Matchers.Evaluate || this.Matchers.GuaranteedNonMatch,\n\t\t\t\t(pMatch, pCode) =>\n\t\t\t\t{\n\t\t\t\t\treturn `';\\n${decodeURIComponent(pCode)}\\n;__p+='`;\n\t\t\t\t}) + `';\\n`;\n\n\n\t\tthis.TemplateSource = `with(pTemplateDataObject||{}){\\n${this.TemplateSource}}\\n`;\n\t\tthis.TemplateSource = `var __p='';var print=function(){__p+=Array.prototype.join.call(arguments, '')};\\n${this.TemplateSource}return __p;\\n`;\n\n\t\tthis.renderFunction = new Function('pTemplateDataObject', this.TemplateSource);\n\n\t\tif (typeof(pData) != 'undefined')\n\t\t{\n\t\t\treturn this.renderFunction(pData);\n\t\t}\n\n\t\t// Provide the compiled function source as a convenience for build time\n\t\t// precompilation.\n\t\tthis.TemplateSourceCompiled = 'function(obj){\\n' + this.TemplateSource + '}';\n\n\t\treturn this.templateFunction();\n\t}\n}\n\nmodule.exports = FableServiceTemplate;\n},{\"../Fable-ServiceProviderBase.js\":80}],86:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceProviderBase.js');\n\n\n// TODO: These are still pretty big -- consider the smaller polyfills\nconst libAsyncWaterfall = require('async.waterfall');\nconst libAsyncEachLimit = require('async.eachlimit');\n\nclass FableServiceUtility extends libFableServiceBase\n{\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\t//\n\t// NOTE: This does not implement underscore escape expressions\n\t// NOTE: This does not implement underscore magic browser variable assignment\n\t//\n\t// This is an implementation of that.\n\t// TODO: Make this use precedent, add configuration, add debugging.\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n\t\tthis.templates = {};\n\n\t\t// These two functions are used extensively throughout\n\t\tthis.waterfall = libAsyncWaterfall;\n\t\tthis.eachLimit = libAsyncEachLimit;\n\t}\n\n\t// Underscore and lodash have a behavior, _.extend, which merges objects.\n\t// Now that es6 gives us this, use the native thingy.\n\textend(pDestinationObject, ...pSourceObjects)\n\t{\n\t\treturn Object.assign(pDestinationObject, ...pSourceObjects);\n\t}\n\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\ttemplate(pTemplateText, pData)\n\t{\n\t\tlet tmpTemplate = this.fable.serviceManager.instantiateServiceProviderWithoutRegistration('Template');\n\n\t\treturn tmpTemplate.buildTemplateFunction(pTemplateText, pData);\n\t}\n\n\t// Build a template function from a template hash, and, register it with the service provider\n\tbuildHashedTemplate(pTemplateHash, pTemplateText, pData)\n\t{\n\t\tlet tmpTemplate = this.fable.serviceManager.instantiateServiceProvider('Template', {}, pTemplateHash);\n\n\t\tthis.templates[pTemplateHash] = tmpTemplate.buildTemplateFunction(pTemplateText, pData);\n\n\t\treturn this.templates[pTemplateHash];\n\t}\n\n\t// This is a safe, modern version of chunk from underscore\n\t// Algorithm pulled from a mix of these two polyfills:\n\t// https://github.com/you-dont-need/You-Dont-Need-Lodash-Underscore#_chunk\n\t// https://youmightnotneed.com/lodash\n\t// This implementation was most tolerant in browsers. Uglify can fix the rest.\n\tchunk (pInput, pChunkSize, pChunkCache)\n\t{\n\t\tlet tmpInputArray = [...pInput];\n\t\t// Note lodash defaults to 1, underscore defaults to 0\n\t\tlet tmpChunkSize = (typeof(pChunkSize) == 'number') ? pChunkSize : 0;\n\t\tlet tmpChunkCache = (typeof(pChunkCache) != 'undefined') ? pChunkCache : [];\n\n\t\tif (tmpChunkSize <= 0)\n\t\t{\n\t\t\treturn tmpChunkCache;\n\t\t}\n\n\t\twhile (tmpInputArray.length)\n\t\t{\n\t\t\ttmpChunkCache.push(tmpInputArray.splice(0, tmpChunkSize));\n\t\t}\n\n\t\treturn tmpChunkCache;\n\t}\n}\n\nmodule.exports = FableServiceUtility;\n},{\"../Fable-ServiceProviderBase.js\":80,\"async.eachlimit\":1,\"async.waterfall\":15}]},{},[76])(76)\n});\n\n","(function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c=\"function\"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error(\"Cannot find module '\"+i+\"'\");throw a.code=\"MODULE_NOT_FOUND\",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u=\"function\"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()","'use strict';\n\nvar eachOfLimit = require('async.util.eachoflimit');\nvar withoutIndex = require('async.util.withoutindex');\n\nmodule.exports = function eachLimit(arr, limit, iterator, cb) {\n return eachOfLimit(limit)(arr, withoutIndex(iterator), cb);\n};\n","'use strict';\n\nmodule.exports = function(tasks) {\n function makeCallback(index) {\n function fn() {\n if (tasks.length) {\n tasks[index].apply(null, arguments);\n }\n return fn.next();\n }\n fn.next = function() {\n return (index < tasks.length - 1) ? makeCallback(index + 1) : null;\n };\n return fn;\n }\n return makeCallback(0);\n};\n","var once = require('async.util.once');\nvar noop = require('async.util.noop');\nvar onlyOnce = require('async.util.onlyonce');\nvar keyIterator = require('async.util.keyiterator');\n\nmodule.exports = function eachOfLimit(limit) {\n return function(obj, iterator, cb) {\n cb = once(cb || noop);\n obj = obj || [];\n var nextKey = keyIterator(obj);\n if (limit <= 0) {\n return cb(null);\n }\n var done = false;\n var running = 0;\n var errored = false;\n\n (function replenish() {\n if (done && running <= 0) {\n return cb(null);\n }\n\n while (running < limit && !errored) {\n var key = nextKey();\n if (key === null) {\n done = true;\n if (running <= 0) {\n cb(null);\n }\n return;\n }\n running += 1;\n iterator(obj[key], key, onlyOnce(function(err) {\n running -= 1;\n if (err) {\n cb(err);\n errored = true;\n } else {\n replenish();\n }\n }));\n }\n })();\n };\n};\n","'use strict';\nvar setImmediate = require('async.util.setimmediate');\nvar restParam = require('async.util.restparam');\n\nmodule.exports = function(fn) {\n return restParam(function(args) {\n var callback = args.pop();\n args.push(function() {\n var innerArgs = arguments;\n if (sync) {\n setImmediate(function() {\n callback.apply(null, innerArgs);\n });\n } else {\n callback.apply(null, innerArgs);\n }\n });\n var sync = true;\n fn.apply(this, args);\n sync = false;\n });\n};\n","'use strict';\n\nmodule.exports = Array.isArray || function isArray(obj) {\n return Object.prototype.toString.call(obj) === '[object Array]';\n};\n","'use strict';\n\nvar isArray = require('async.util.isarray');\n\nmodule.exports = function isArrayLike(arr) {\n return isArray(arr) || (\n // has a positive integer length property\n typeof arr.length === 'number' &&\n arr.length >= 0 &&\n arr.length % 1 === 0\n );\n};\n","'use strict';\n\nvar _keys = require('async.util.keys');\nvar isArrayLike = require('async.util.isarraylike');\n\nmodule.exports = function keyIterator(coll) {\n var i = -1;\n var len;\n var keys;\n if (isArrayLike(coll)) {\n len = coll.length;\n return function next() {\n i++;\n return i < len ? i : null;\n };\n } else {\n keys = _keys(coll);\n len = keys.length;\n return function next() {\n i++;\n return i < len ? keys[i] : null;\n };\n }\n};\n","'use strict';\n\nmodule.exports = Object.keys || function keys(obj) {\n var _keys = [];\n for (var k in obj) {\n if (obj.hasOwnProperty(k)) {\n _keys.push(k);\n }\n }\n return _keys;\n};\n","'use strict';\n\nmodule.exports = function noop () {};\n","'use strict';\n\nmodule.exports = function once(fn) {\n return function() {\n if (fn === null) return;\n fn.apply(this, arguments);\n fn = null;\n };\n};\n","'use strict';\n\nmodule.exports = function only_once(fn) {\n return function() {\n if (fn === null) throw new Error('Callback was already called.');\n fn.apply(this, arguments);\n fn = null;\n };\n};\n","'use strict';\nmodule.exports = function restParam(func, startIndex) {\n startIndex = startIndex == null ? func.length - 1 : +startIndex;\n return function() {\n var length = Math.max(arguments.length - startIndex, 0);\n var rest = new Array(length);\n for (var index = 0; index < length; index++) {\n rest[index] = arguments[index + startIndex];\n }\n switch (startIndex) {\n case 0:\n return func.call(this, rest);\n case 1:\n return func.call(this, arguments[0], rest);\n }\n };\n};\n","'use strict';\n\nvar _setImmediate = typeof setImmediate === 'function' && setImmediate;\nvar fallback = function(fn) {\n setTimeout(fn, 0);\n};\n\nmodule.exports = function setImmediate(fn) {\n // not a direct alias for IE10 compatibility\n return (_setImmediate || fallback)(fn);\n};\n","'use strict';\n\nmodule.exports = function withoutIndex(iterator) {\n return function(value, index, callback) {\n return iterator(value, callback);\n };\n};\n","'use strict';\n\nvar once = require('async.util.once');\nvar noop = require('async.util.noop');\nvar isArray = require('async.util.isarray');\nvar restParam = require('async.util.restparam');\nvar ensureAsync = require('async.util.ensureasync');\nvar iterator = require('async.iterator');\n\nmodule.exports = function(tasks, cb) {\n cb = once(cb || noop);\n if (!isArray(tasks)) return cb(new Error('First argument to waterfall must be an array of functions'));\n if (!tasks.length) return cb();\n\n function wrapIterator(iterator) {\n return restParam(function(err, args) {\n if (err) {\n cb.apply(null, [err].concat(args));\n } else {\n var next = iterator.next();\n if (next) {\n args.push(wrapIterator(next));\n } else {\n args.push(cb);\n }\n ensureAsync(iterator).apply(null, args);\n }\n });\n }\n wrapIterator(iterator(tasks))();\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(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\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","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <https://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')\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nvar K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Print warning and recommend using `buffer` v4.x which has an Object\n * 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 * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n typeof console.error === 'function') {\n console.error(\n 'This browser lacks typed array (Uint8Array) support which is required by ' +\n '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n )\n}\n\nfunction typedArraySupport () {\n // Can typed array instances can be augmented?\n try {\n var arr = new Uint8Array(1)\n arr.__proto__ = { __proto__: Uint8Array.prototype, foo: function () { return 42 } }\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.buffer\n }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.byteOffset\n }\n})\n\nfunction createBuffer (length) {\n if (length > K_MAX_LENGTH) {\n throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n }\n // Return an augmented `Uint8Array` instance\n var buf = new Uint8Array(length)\n buf.__proto__ = Buffer.prototype\n return buf\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 // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new TypeError(\n 'The \"string\" argument must be of type string. Received type number'\n )\n }\n return allocUnsafe(arg)\n }\n return from(arg, encodingOrOffset, length)\n}\n\n// Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\nif (typeof Symbol !== 'undefined' && Symbol.species != null &&\n Buffer[Symbol.species] === Buffer) {\n Object.defineProperty(Buffer, Symbol.species, {\n value: null,\n configurable: true,\n enumerable: false,\n writable: false\n })\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n if (typeof value === 'string') {\n return fromString(value, encodingOrOffset)\n }\n\n if (ArrayBuffer.isView(value)) {\n return fromArrayLike(value)\n }\n\n if (value == null) {\n throw TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n }\n\n if (isInstance(value, ArrayBuffer) ||\n (value && isInstance(value.buffer, ArrayBuffer))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof value === 'number') {\n throw new TypeError(\n 'The \"value\" argument must not be of type number. Received type number'\n )\n }\n\n var valueOf = value.valueOf && value.valueOf()\n if (valueOf != null && valueOf !== value) {\n return Buffer.from(valueOf, encodingOrOffset, length)\n }\n\n var b = fromObject(value)\n if (b) return b\n\n if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n typeof value[Symbol.toPrimitive] === 'function') {\n return Buffer.from(\n value[Symbol.toPrimitive]('string'), encodingOrOffset, length\n )\n }\n\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\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(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nBuffer.prototype.__proto__ = Uint8Array.prototype\nBuffer.__proto__ = Uint8Array\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be of type number')\n } else if (size < 0) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n}\n\nfunction alloc (size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(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(size).fill(fill, encoding)\n : createBuffer(size).fill(fill)\n }\n return createBuffer(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(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n assertSize(size)\n return createBuffer(size < 0 ? 0 : checked(size) | 0)\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(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(size)\n}\n\nfunction fromString (string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n var length = byteLength(string, encoding) | 0\n var buf = createBuffer(length)\n\n var actual = buf.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 buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (array) {\n var length = array.length < 0 ? 0 : checked(array.length) | 0\n var buf = createBuffer(length)\n for (var i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\"offset\" is outside of buffer bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\"length\" is outside of buffer bounds')\n }\n\n var buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n // Return an augmented `Uint8Array` instance\n buf.__proto__ = Buffer.prototype\n return buf\n}\n\nfunction fromObject (obj) {\n if (Buffer.isBuffer(obj)) {\n var len = checked(obj.length) | 0\n var buf = createBuffer(len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj.length !== undefined) {\n if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n return createBuffer(0)\n }\n return fromArrayLike(obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(obj.data)\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.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 === true &&\n b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError(\n 'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n )\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 (!Array.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 (isInstance(buf, Uint8Array)) {\n buf = Buffer.from(buf)\n }\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 (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n throw new TypeError(\n 'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n 'Received type ' + typeof string\n )\n }\n\n var len = string.length\n var mustMatch = (arguments.length > 2 && arguments[2] === true)\n if (!mustMatch && 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 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) {\n return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n }\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// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\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\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.toLocaleString = Buffer.prototype.toString\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 str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n if (this.length > max) str += ' ... '\n return '<Buffer ' + str + '>'\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (isInstance(target, Uint8Array)) {\n target = Buffer.from(target, target.offset, target.byteLength)\n }\n if (!Buffer.isBuffer(target)) {\n throw new TypeError(\n 'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n 'Received type ' + (typeof target)\n )\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 (numberIsNaN(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 (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 var strLen = string.length\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 (numberIsNaN(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 } 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 = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n newBuf.__proto__ = Buffer.prototype\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 offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 this[offset] = (value & 0xff)\n return offset + 1\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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\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 this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\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 this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\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 this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\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 (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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\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 this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\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 this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\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 value = +value\n offset = offset >>> 0\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 value = +value\n offset = offset >>> 0\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 (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\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('Index out of range')\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\n if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n // Use built-in when available, missing from IE11\n this.copyWithin(targetStart, start, end)\n } else if (this === target && start < targetStart && targetStart < end) {\n // descending copy from end\n for (var i = len - 1; i >= 0; --i) {\n target[i + targetStart] = this[i + start]\n }\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, end),\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 (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 if (val.length === 1) {\n var code = val.charCodeAt(0)\n if ((encoding === 'utf8' && code < 128) ||\n encoding === 'latin1') {\n // Fast path: If `val` fits into a single byte, use that numeric value.\n val = code\n }\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 : Buffer.from(val, encoding)\n var len = bytes.length\n if (len === 0) {\n throw new TypeError('The value \"' + val +\n '\" is invalid for argument \"value\"')\n }\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 takes equal signs as end of the Base64 encoding\n str = str.split('=')[0]\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = str.trim().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 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\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n return obj instanceof type ||\n (obj != null && obj.constructor != null && obj.constructor.name != null &&\n obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n // For IE11 support\n return obj !== obj // eslint-disable-line no-self-compare\n}\n","module.exports = {\n \"100\": \"Continue\",\n \"101\": \"Switching Protocols\",\n \"102\": \"Processing\",\n \"200\": \"OK\",\n \"201\": \"Created\",\n \"202\": \"Accepted\",\n \"203\": \"Non-Authoritative Information\",\n \"204\": \"No Content\",\n \"205\": \"Reset Content\",\n \"206\": \"Partial Content\",\n \"207\": \"Multi-Status\",\n \"208\": \"Already Reported\",\n \"226\": \"IM Used\",\n \"300\": \"Multiple Choices\",\n \"301\": \"Moved Permanently\",\n \"302\": \"Found\",\n \"303\": \"See Other\",\n \"304\": \"Not Modified\",\n \"305\": \"Use Proxy\",\n \"307\": \"Temporary Redirect\",\n \"308\": \"Permanent Redirect\",\n \"400\": \"Bad Request\",\n \"401\": \"Unauthorized\",\n \"402\": \"Payment Required\",\n \"403\": \"Forbidden\",\n \"404\": \"Not Found\",\n \"405\": \"Method Not Allowed\",\n \"406\": \"Not Acceptable\",\n \"407\": \"Proxy Authentication Required\",\n \"408\": \"Request Timeout\",\n \"409\": \"Conflict\",\n \"410\": \"Gone\",\n \"411\": \"Length Required\",\n \"412\": \"Precondition Failed\",\n \"413\": \"Payload Too Large\",\n \"414\": \"URI Too Long\",\n \"415\": \"Unsupported Media Type\",\n \"416\": \"Range Not Satisfiable\",\n \"417\": \"Expectation Failed\",\n \"418\": \"I'm a teapot\",\n \"421\": \"Misdirected Request\",\n \"422\": \"Unprocessable Entity\",\n \"423\": \"Locked\",\n \"424\": \"Failed Dependency\",\n \"425\": \"Unordered Collection\",\n \"426\": \"Upgrade Required\",\n \"428\": \"Precondition Required\",\n \"429\": \"Too Many Requests\",\n \"431\": \"Request Header Fields Too Large\",\n \"451\": \"Unavailable For Legal Reasons\",\n \"500\": \"Internal Server Error\",\n \"501\": \"Not Implemented\",\n \"502\": \"Bad Gateway\",\n \"503\": \"Service Unavailable\",\n \"504\": \"Gateway Timeout\",\n \"505\": \"HTTP Version Not Supported\",\n \"506\": \"Variant Also Negotiates\",\n \"507\": \"Insufficient Storage\",\n \"508\": \"Loop Detected\",\n \"509\": \"Bandwidth Limit Exceeded\",\n \"510\": \"Not Extended\",\n \"511\": \"Network Authentication Required\"\n}\n","/**\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\n/**\n* Data Arithmatic\n*\n* @class DataArithmatic\n*/\nclass DataArithmatic\n{\n\tconstructor()\n\t{\n\t\t// Regular Expressions (so they don't have to be recompiled every time)\n\t\t// These could be defined as static, but I'm not sure if that will work with browserify ... and specifically the QT browser.\n\t\tthis._Regex_formatterInsertCommas = /.{1,3}/g;\n\t\t// Match Function:\n\t\t// function(pMatch, pSign, pZeros, pBefore, pDecimal, pAfter)\n\t\t// Thoughts about below: /^([+-]?)(0*)(\\d+)(\\.(\\d+))?$/;\n\t\tthis._Regex_formatterAddCommasToNumber = /^([-+]?)(0?)(\\d+)(.?)(\\d+)$/g;\n\t\tthis._Regex_formatterDollarsRemoveCommas = /,/gi;\n\t\tthis._Regex_formatterCleanNonAlpha = /[^a-z0-9]/gi;\n\n\t\t// TODO: Potentially pull these in from a configuration.\n\t\t// TODO: Use locale data for this if it's defaults all the way down.\n\t\tthis._Value_MoneySign_Currency = '$';\n\t\tthis._Value_NaN_Currency = '--';\n\t\tthis._Value_GroupSeparator_Number = ',';\n\n\t\tthis._Value_Prefix_StringHash = 'HSH';\n\t\tthis._Value_Clean_formatterCleanNonAlpha = '_';\n\n\t\tthis._UseEngineStringStartsWith = (typeof(String.prototype.startsWith) === 'function');\n\t\tthis._UseEngineStringEndsWith = (typeof(String.prototype.endsWith) === 'function');\n\t}\n\n\n\t/*************************************************************************\n\t * String Manipulation and Comparison Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Reverse a string\n\t *\n\t * @param {string} pString - The string to reverse\n\t * @returns {string}\n\t */\n\tstringReverse (pString)\n\t{\n\t\t// TODO: Benchmark if there are faster ways we want to do this with all the newer JS stuff\n\t\t// ... and if it will work with browserify in a clean way.\n\t return pString.split('').reverse().join('');\n\t}\n\n\t/**\n\t * Test if a string starts with a given substring.\n\t *\n\t * @param {*} pString\n\t * @param {*} pSearchString\n\t * @param {*} pStartIndex\n\t * @returns {*}\n\t */\n\tstringStartsWith (pString, pSearchString, pStartIndex)\n\t{\n\t\tif (this._UseEngineStringStartsWith)\n\t\t{\n\t\t\treturn pString.startsWith(pSearchString, pStartIndex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.stringStartsWith_Polyfill.call(pString, pSearchString, pStartIndex);\n\t\t}\n\t}\n\n\t/**\n\t * Check if a string starts with a given substring. This is a safe polyfill for the ES6 string.startsWith() function.\n\t *\n\t * @param {*} pSearchString - The string to search for\n\t * @param {*} pStartIndex - The index to start the search at\n\t * @returns {boolean}\n\t */\n\tstringStartsWith_Polyfill (pSearchString, pStartIndex)\n\t{\n\t\treturn this.slice(pStartIndex || 0, pSearchString.length) === pSearchString;\n\t}\n\n\t/**\n\t * Test if a string starts with a given substring.\n\t *\n\t * @param {*} pString\n\t * @param {*} pSearchString\n\t * @param {*} pEndIndex\n\t * @returns {*}\n\t */\n\tstringEndsWith (pString, pSearchString, pEndIndex)\n\t{\n\t\tif (this._UseEngineStringEndsWith)\n\t\t{\n\t\t\treturn pString.endsWith(pSearchString, pEndIndex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.stringEndsWith_Polyfill.call(pString, pSearchString, pEndIndex);\n\t\t}\n\t}\n\n\t/**\n\t * Check if a string starts with a given substring. This is a safe polyfill for the ES6 string.startsWith() function.\n\t *\n\t * @param {*} pSearchString - The string to search for\n\t * @param {*} pEndIndex - The index to end the search at\n\t * @returns {boolean}\n\t */\n\tstringEndsWith_Polyfill (pSearchString, pEndIndex)\n\t{\n\t\t// This works much better than >= because\n\t\t// it compensates for NaN:\n\t\tif (!(pEndIndex < this.length))\n\t\t{\n\t\t\tpEndIndex = this.length;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpEndIndex |= 0; // round position\n\t\t}\n\t\treturn this.substr(pEndIndex - pSearchString.length, pSearchString.length) === pSearchString;\n\t}\n\n\t/**\n\t * Generate an insecure string hash. Not meant to be secure, just a quick way to generate a hash for a string. This is not a cryptographic hash. Additional warranty and disclaimer ... this is not for passwords!\n\t *\n\t * @param {string} pString\n\t * @returns {string}\n\t */\n\tinsecureStringHash (pString)\n\t{\n\t let tmpHash = 0;\n\t let tmpStringLength = pString.length;\n\t let tmpCharacterIndex = 0;\n\n\t while (tmpCharacterIndex < tmpStringLength)\n\t {\n\t tmpHash = (tmpHash << 5) - tmpHash + pString.charCodeAt(tmpCharacterIndex++) | 0;\n\t }\n\n\t return `${this._Value_Prefix_StringHash}${tmpHash}`;\n\t}\n\n\t/**\n\t * Clean wrapping characters if they exist consistently around the string. If they do not, the string is returned unchanged.\n\t *\n\t * @param {string} pWrapCharacter - The character expected as the wrapping character\n\t * @param {string} pString - the string to clean\n\t * @returns {string}\n\t */\n\tcleanEnclosureWrapCharacters (pWrapCharacter, pString)\n\t{\n\t\t// # Use case from ManyFest DSL:\n\t\t//\n\t\t// When a boxed property is passed in, it should have quotes of some\n\t\t// kind around it.\n\t\t//\n\t\t// For instance:\n\t\t// \t\tMyValues['Name']\n\t\t// \t\tMyValues[\"Age\"]\n\t\t// \t\tMyValues[`Cost`]\n\t\t//\n\t\t// This function is necessary to remove the wrapping quotes before object\n\t\t// resolution can occur.\n\t\tif (pString.startsWith(pWrapCharacter) && pString.endsWith(pWrapCharacter))\n\t\t{\n\t\t\treturn pString.substring(1, pString.length - 1);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn pString;\n\t\t}\n\t}\n\n\t/**\n\t *\n\t * @param {*} pString\n\t * @returns\n\t */\n\tcleanNonAlphaCharacters (pString)\n\t{\n\t if ((typeof(pString) == 'string') && (pString != ''))\n\t {\n\t return pString.replace(this._Regex_formatterCleanNonAlpha, this._Value_Clean_formatterCleanNonAlpha);\n\t }\n\t}\n\n\n\t/*************************************************************************\n\t * Number Formatting Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Insert commas every 3 characters from the right. Used by formatterAddCommasToNumber().\n\t *\n\t * @param {*} pString\n\t * @returns {*}\n\t */\n\tformatterInsertCommas (pString)\n\t{\n\t // Reverse, because it's easier to do things from the left, given arbitrary digit counts\n\t let tmpReversed = this.stringReverse(pString);\n\t // Add commas every three characters\n\t let tmpReversedWithCommas = tmpReversed.match(this._Regex_formatterInsertCommas).join(',');\n\t // Reverse again (back to normal direction)\n\t return this.stringReverse(tmpReversedWithCommas);\n\t}\n\n\tprocessAddCommasToNumberRegex(pMatch, pSign, pZeros, pBefore, pDecimal, pAfter)\n\t{\n\t\t// If there was no decimal, the last capture grabs the final digit, so\n\t\t// we have to put it back together with the 'before' substring\n\t\treturn pSign + (pDecimal ? this.formatterInsertCommas(pBefore) + pDecimal + pAfter : this.formatterInsertCommas(pBefore + pAfter));\n\t}\n\n\t/**\n\t * Add Commas to a Number for readability.\n\t *\n\t * @param {*} pNumber\n\t * @returns {string}\n\t */\n\tformatterAddCommasToNumber (pNumber)\n\t{\n\t // If the regex doesn't match, `replace` returns the string unmodified\n\t return (pNumber.toString()).replace\n\t (\n\t\t\tthis._Regex_formatterAddCommasToNumber,\n\t this.processAddCommasToNumberRegex.bind(this)\n\t );\n\t}\n\n\t/**\n\t * This will take a number and format it as a dollar string. It will also add commas to the number. If the number is not a number, it will return '--'.\n\t *\n\t * @param {*} pValue\n\t * @returns {string}\n\t */\n\tformatterDollars (pValue)\n\t{\n\t let tmpDollarAmount = parseFloat(pValue).toFixed(2);\n\n\t if (isNaN(tmpDollarAmount))\n\t {\n\t // Try again and see if what was passed in was a dollars string.\n\t if (typeof(pValue) == 'string')\n\t {\n\t\t\t\t// TODO: Better rounding function? This is a hack to get rid of the currency symbol and commas.\n\t tmpDollarAmount = parseFloat(pValue.replace(this._Value_MoneySign_Currency,'').replace(this._Regex_formatterDollarsRemoveCommas,'')).toFixed(2);\n\t }\n\t\t\t// If we didn't get a number, return the \"not a number\" string.\n\t if (isNaN(tmpDollarAmount))\n\t {\n\t return this._Value_NaN_Currency;\n\t }\n\t }\n\n\t // TODO: Get locale data and use that for this stuff.\n\t return `$${this.formatterAddCommasToNumber(tmpDollarAmount)}`;\n\t}\n\n\t/**\n\t * Round a number to a certain number of digits. If the number is not a number, it will return 0. If no digits are specified, it will default to 2 significant digits.\n\t *\n\t * @param {*} pValue\n\t * @param {number} pDigits\n\t * @returns {string}\n\t */\n\tformatterRoundNumber (pValue, pDigits)\n\t{\n\t let tmpDigits = (typeof(pDigits) == 'undefined') ? 2 : pDigits;\n\n\t let tmpValue = parseFloat(pValue).toFixed(tmpDigits);\n\t if (isNaN(tmpValue))\n\t {\n\t let tmpZed = 0;\n\t return tmpZed.toFixed(tmpDigits);\n\t }\n\t else\n\t {\n\t return tmpValue;\n\t }\n\t}\n\n\n\t/*************************************************************************\n\t * String Tokenization Functions\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Return the string before the matched substring.\n\t *\n\t * If the substring is not found, the entire string is returned. This only deals with the *first* match.\n\t *\n\t * @param {string} pString\n\t * @param {string} pMatch\n\t * @returns {string}\n\t */\n\tstringBeforeMatch (pString, pMatch)\n\t{\n\t\treturn pString.split(pMatch)[0];\n\t}\n\n\t/**\n\t * Return the string after the matched substring.\n\t *\n\t * If the substring is not found, an empty string is returned. This only deals with the *first* match.\n\t *\n\t * @param {string} pString\n\t * @param {string} pMatch\n\t * @returns {string}\n\t */\n\tstringAfterMatch (pString, pMatch)\n\t{\n\t let tmpStringSplitLocation = pString.indexOf(pMatch);\n\n\t\tif ((tmpStringSplitLocation < 0) || ((tmpStringSplitLocation + pMatch.length) >= pString.length))\n\t {\n\t return '';\n\t }\n\n\t return pString.substring(tmpStringSplitLocation + pMatch.length);\n\t}\n\n\t/**\n\t * Count the number of enclosures in a string based on the start and end characters.\n\t *\n\t * If no start or end characters are specified, it will default to parentheses. If the string is not a string, it will return 0.\n\t *\n\t * @param {string} pString\n\t * @param {string} pEnclosureStart\n\t * @param {string} pEnclosureEnd\n\t * @returns the count of full in the string\n\t */\n\tstringCountEnclosures (pString, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t if (tmpEnclosureDepth == 0)\n\t {\n\t tmpEnclosureCount++;\n\t }\n\t tmpEnclosureDepth++;\n\t }\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\t }\n\t }\n\n\t return tmpEnclosureCount;\n\t}\n\n\n\t/**\n\t * Get the value of the enclosure at the specified index.\n\t *\n\t * If the index is not a number, it will default to 0. If the string is not a string, it will return an empty string. If the enclosure is not found, it will return an empty string. If the enclosure\n\t *\n\t * @param {string} pString\n\t * @param {number} pEnclosureIndexToGet\n\t * @param {string} pEnclosureStart\n\t * @param {string}} pEnclosureEnd\n\t * @returns {string}\n\t */\n\tstringGetEnclosureValueByIndex (pString, pEnclosureIndexToGet, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureIndexToGet = (typeof(pEnclosureIndexToGet) == 'number') ? pEnclosureIndexToGet : 0;\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t let tmpEnclosedValueStartIndex = 0;\n\t let tmpEnclosedValueEndIndex = 0;\n\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t tmpEnclosureDepth++;\n\n\t\t\t\t// Only count enclosures at depth 1, but still this parses both pairs of all of them.\n\t\t\t\tif (tmpEnclosureDepth == 1)\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureCount++;\n\t\t\t\t\tif (tmpEnclosureIndexToGet == (tmpEnclosureCount - 1))\n\t\t\t\t\t{\n\t\t\t\t\t\t// This is the start of *the* enclosure\n\t\t\t\t\t\ttmpMatchedEnclosureIndex = true;\n\t\t\t\t\t\ttmpEnclosedValueStartIndex = i;\n\t\t\t\t\t}\n\t\t\t\t}\n\t }\n\t\t\t// This is the end of an enclosure\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\n\t\t\t\t// Again, only count enclosures at depth 1, but still this parses both pairs of all of them.\n\t\t\t\tif ((tmpEnclosureDepth == 0) &&\n\t\t\t\t\ttmpMatchedEnclosureIndex &&\n\t\t\t\t\t(tmpEnclosedValueEndIndex <= tmpEnclosedValueStartIndex))\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosedValueEndIndex = i;\n\t\t\t\t\ttmpMatchedEnclosureIndex = false;\n\t\t\t\t}\n\t }\n\t }\n\n\t if (tmpEnclosureCount <= tmpEnclosureIndexToGet)\n\t {\n\t\t\t// Return an empty string if the enclosure is not found\n\t return '';\n\t }\n\n\t if ((tmpEnclosedValueEndIndex > 0) && (tmpEnclosedValueEndIndex > tmpEnclosedValueStartIndex))\n\t {\n\t return tmpString.substring(tmpEnclosedValueStartIndex+1, tmpEnclosedValueEndIndex);\n\t }\n\t else\n\t {\n\t return tmpString.substring(tmpEnclosedValueStartIndex+1);\n\t }\n\t}\n\n\n\t/**\n\t * Remove an enclosure from a string based on the index of the enclosure.\n\t *\n\t * @param {string} pString\n\t * @param {number} pEnclosureIndexToRemove\n\t * @param {number} pEnclosureStart\n\t * @param {number} pEnclosureEnd\n\t * @returns {string}\n\t */\n\tstringRemoveEnclosureByIndex (pString, pEnclosureIndexToRemove, pEnclosureStart, pEnclosureEnd)\n\t{\n\t let tmpString = (typeof(pString) == 'string') ? pString : '';\n\t let tmpEnclosureIndexToRemove = (typeof(pEnclosureIndexToRemove) == 'number') ? pEnclosureIndexToRemove : 0;\n\t let tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t let tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t let tmpEnclosureCount = 0;\n\t let tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t let tmpEnclosureStartIndex = 0;\n\t let tmpEnclosureEndIndex = 0;\n\n\t for (let i = 0; i < tmpString.length; i++)\n\t {\n\t // This is the start of an enclosure\n\t if (tmpString[i] == tmpEnclosureStart)\n\t {\n\t tmpEnclosureDepth++;\n\n\t if (tmpEnclosureDepth == 1)\n\t {\n\t tmpEnclosureCount++;\n\t\t\t\t\tif (tmpEnclosureIndexToRemove == (tmpEnclosureCount - 1))\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpMatchedEnclosureIndex = true;\n\t\t\t\t\t\ttmpEnclosureStartIndex = i;\n\t\t\t\t\t}\n\t }\n\t }\n\t else if (tmpString[i] == tmpEnclosureEnd)\n\t {\n\t tmpEnclosureDepth--;\n\n\t\t\t\tif ((tmpEnclosureDepth == 0) &&\n\t\t\t\t\ttmpMatchedEnclosureIndex &&\n\t\t\t\t\t(tmpEnclosureEndIndex <= tmpEnclosureStartIndex))\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureEndIndex = i;\n\t\t\t\t\ttmpMatchedEnclosureIndex = false;\n\t\t\t\t}\n\t }\n\t }\n\n\t if (tmpEnclosureCount <= tmpEnclosureIndexToRemove)\n\t {\n\t return tmpString;\n\t }\n\n\t let tmpReturnString = '';\n\n\t if (tmpEnclosureStartIndex > 1)\n\t {\n\t tmpReturnString = tmpString.substring(0, tmpEnclosureStartIndex);\n\t }\n\n\t if ((tmpString.length > (tmpEnclosureEndIndex + 1)) && (tmpEnclosureEndIndex > tmpEnclosureStartIndex))\n\t {\n\t tmpReturnString += tmpString.substring(tmpEnclosureEndIndex+1);\n\t }\n\n\t return tmpReturnString;\n\t}\n}\n\nmodule.exports = DataArithmatic;","// 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\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n ? R.apply\n : function ReflectApply(target, receiver, args) {\n return Function.prototype.apply.call(target, receiver, args);\n }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n ReflectOwnKeys = function ReflectOwnKeys(target) {\n return Object.getOwnPropertyNames(target)\n .concat(Object.getOwnPropertySymbols(target));\n };\n} else {\n ReflectOwnKeys = function ReflectOwnKeys(target) {\n return Object.getOwnPropertyNames(target);\n };\n}\n\nfunction ProcessEmitWarning(warning) {\n if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n return value !== value;\n}\n\nfunction EventEmitter() {\n EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n if (typeof listener !== 'function') {\n throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n enumerable: true,\n get: function() {\n return defaultMaxListeners;\n },\n set: function(arg) {\n if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n }\n defaultMaxListeners = arg;\n }\n});\n\nEventEmitter.init = function() {\n\n if (this._events === undefined ||\n this._events === Object.getPrototypeOf(this)._events) {\n this._events = Object.create(null);\n this._eventsCount = 0;\n }\n\n this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n }\n this._maxListeners = n;\n return this;\n};\n\nfunction _getMaxListeners(that) {\n if (that._maxListeners === undefined)\n return EventEmitter.defaultMaxListeners;\n return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n var args = [];\n for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n var doError = (type === 'error');\n\n var events = this._events;\n if (events !== undefined)\n doError = (doError && events.error === undefined);\n else if (!doError)\n return false;\n\n // If there is no 'error' event listener then throw.\n if (doError) {\n var er;\n if (args.length > 0)\n er = args[0];\n if (er instanceof Error) {\n // Note: The comments on the `throw` lines are intentional, they show\n // up in Node's output if this results in an unhandled exception.\n throw er; // Unhandled 'error' event\n }\n // At least give some kind of context to the user\n var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n err.context = er;\n throw err; // Unhandled 'error' event\n }\n\n var handler = events[type];\n\n if (handler === undefined)\n return false;\n\n if (typeof handler === 'function') {\n ReflectApply(handler, this, args);\n } else {\n var len = handler.length;\n var listeners = arrayClone(handler, len);\n for (var i = 0; i < len; ++i)\n ReflectApply(listeners[i], this, args);\n }\n\n return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n var m;\n var events;\n var existing;\n\n checkListener(listener);\n\n events = target._events;\n if (events === undefined) {\n events = target._events = Object.create(null);\n target._eventsCount = 0;\n } else {\n // To avoid recursion in the case that type === \"newListener\"! Before\n // adding it to the listeners, first emit \"newListener\".\n if (events.newListener !== undefined) {\n target.emit('newListener', type,\n listener.listener ? listener.listener : listener);\n\n // Re-assign `events` because a newListener handler could have caused the\n // this._events to be assigned to a new object\n events = target._events;\n }\n existing = events[type];\n }\n\n if (existing === undefined) {\n // Optimize the case of one listener. Don't need the extra array object.\n existing = events[type] = listener;\n ++target._eventsCount;\n } else {\n if (typeof existing === 'function') {\n // Adding the second element, need to change to array.\n existing = events[type] =\n prepend ? [listener, existing] : [existing, listener];\n // If we've already got an array, just append.\n } else if (prepend) {\n existing.unshift(listener);\n } else {\n existing.push(listener);\n }\n\n // Check for listener leak\n m = _getMaxListeners(target);\n if (m > 0 && existing.length > m && !existing.warned) {\n existing.warned = true;\n // No error code for this since it is a Warning\n // eslint-disable-next-line no-restricted-syntax\n var w = new Error('Possible EventEmitter memory leak detected. ' +\n existing.length + ' ' + String(type) + ' listeners ' +\n 'added. Use emitter.setMaxListeners() to ' +\n 'increase limit');\n w.name = 'MaxListenersExceededWarning';\n w.emitter = target;\n w.type = type;\n w.count = existing.length;\n ProcessEmitWarning(w);\n }\n }\n\n return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n function prependListener(type, listener) {\n return _addListener(this, type, listener, true);\n };\n\nfunction onceWrapper() {\n if (!this.fired) {\n this.target.removeListener(this.type, this.wrapFn);\n this.fired = true;\n if (arguments.length === 0)\n return this.listener.call(this.target);\n return this.listener.apply(this.target, arguments);\n }\n}\n\nfunction _onceWrap(target, type, listener) {\n var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n var wrapped = onceWrapper.bind(state);\n wrapped.listener = listener;\n state.wrapFn = wrapped;\n return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n checkListener(listener);\n this.on(type, _onceWrap(this, type, listener));\n return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n function prependOnceListener(type, listener) {\n checkListener(listener);\n this.prependListener(type, _onceWrap(this, type, listener));\n return this;\n };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n function removeListener(type, listener) {\n var list, events, position, i, originalListener;\n\n checkListener(listener);\n\n events = this._events;\n if (events === undefined)\n return this;\n\n list = events[type];\n if (list === undefined)\n return this;\n\n if (list === listener || list.listener === listener) {\n if (--this._eventsCount === 0)\n this._events = Object.create(null);\n else {\n delete events[type];\n if (events.removeListener)\n this.emit('removeListener', type, list.listener || listener);\n }\n } else if (typeof list !== 'function') {\n position = -1;\n\n for (i = list.length - 1; i >= 0; i--) {\n if (list[i] === listener || list[i].listener === listener) {\n originalListener = list[i].listener;\n position = i;\n break;\n }\n }\n\n if (position < 0)\n return this;\n\n if (position === 0)\n list.shift();\n else {\n spliceOne(list, position);\n }\n\n if (list.length === 1)\n events[type] = list[0];\n\n if (events.removeListener !== undefined)\n this.emit('removeListener', type, originalListener || listener);\n }\n\n return this;\n };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n function removeAllListeners(type) {\n var listeners, events, i;\n\n events = this._events;\n if (events === undefined)\n return this;\n\n // not listening for removeListener, no need to emit\n if (events.removeListener === undefined) {\n if (arguments.length === 0) {\n this._events = Object.create(null);\n this._eventsCount = 0;\n } else if (events[type] !== undefined) {\n if (--this._eventsCount === 0)\n this._events = Object.create(null);\n else\n delete events[type];\n }\n return this;\n }\n\n // emit removeListener for all listeners on all events\n if (arguments.length === 0) {\n var keys = Object.keys(events);\n var key;\n for (i = 0; i < keys.length; ++i) {\n key = keys[i];\n if (key === 'removeListener') continue;\n this.removeAllListeners(key);\n }\n this.removeAllListeners('removeListener');\n this._events = Object.create(null);\n this._eventsCount = 0;\n return this;\n }\n\n listeners = events[type];\n\n if (typeof listeners === 'function') {\n this.removeListener(type, listeners);\n } else if (listeners !== undefined) {\n // LIFO order\n for (i = listeners.length - 1; i >= 0; i--) {\n this.removeListener(type, listeners[i]);\n }\n }\n\n return this;\n };\n\nfunction _listeners(target, type, unwrap) {\n var events = target._events;\n\n if (events === undefined)\n return [];\n\n var evlistener = events[type];\n if (evlistener === undefined)\n return [];\n\n if (typeof evlistener === 'function')\n return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n return unwrap ?\n unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n if (typeof emitter.listenerCount === 'function') {\n return emitter.listenerCount(type);\n } else {\n return listenerCount.call(emitter, type);\n }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n var events = this._events;\n\n if (events !== undefined) {\n var evlistener = events[type];\n\n if (typeof evlistener === 'function') {\n return 1;\n } else if (evlistener !== undefined) {\n return evlistener.length;\n }\n }\n\n return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n var copy = new Array(n);\n for (var i = 0; i < n; ++i)\n copy[i] = arr[i];\n return copy;\n}\n\nfunction spliceOne(list, index) {\n for (; index + 1 < list.length; index++)\n list[index] = list[index + 1];\n list.pop();\n}\n\nfunction unwrapListeners(arr) {\n var ret = new Array(arr.length);\n for (var i = 0; i < ret.length; ++i) {\n ret[i] = arr[i].listener || arr[i];\n }\n return ret;\n}\n\nfunction once(emitter, name) {\n return new Promise(function (resolve, reject) {\n function errorListener(err) {\n emitter.removeListener(name, resolver);\n reject(err);\n }\n\n function resolver() {\n if (typeof emitter.removeListener === 'function') {\n emitter.removeListener('error', errorListener);\n }\n resolve([].slice.call(arguments));\n };\n\n eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n if (name !== 'error') {\n addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n }\n });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n if (typeof emitter.on === 'function') {\n eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n if (typeof emitter.on === 'function') {\n if (flags.once) {\n emitter.once(name, listener);\n } else {\n emitter.on(name, listener);\n }\n } else if (typeof emitter.addEventListener === 'function') {\n // EventTarget does not have `error` event semantics like Node\n // EventEmitters, we do not listen for `error` events here.\n emitter.addEventListener(name, function wrapListener(arg) {\n // IE does not have builtin `{ once: true }` support so we\n // have to do it manually.\n if (flags.once) {\n emitter.removeEventListener(name, wrapListener);\n }\n listener(arg);\n });\n } else {\n throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n }\n}\n","/**\n* Base Logger Class\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\nclass BaseLogger\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\t// This should not possibly be able to be instantiated without a settings object\n\t\tthis._Settings = (typeof(pLogStreamSettings) == 'object') ? pLogStreamSettings : {};\n\n\t\t// The base logger does nothing but associate a UUID with itself\n\t\t// We added this as the mechanism for tracking loggers to allow multiple simultaneous streams\n\t\t// to the same provider.\n\t\tthis.loggerUUID = this.generateInsecureUUID();\n\n\t\t// Eventually we can use this array to ompute which levels the provider allows.\n\t\t// For now it's just used to precompute some string concatenations.\n\t\tthis.levels = (\n\t\t\t[\n\t\t\t\t\"trace\",\n\t\t\t\t\"debug\",\n\t\t\t\t\"info\",\n\t\t\t\t\"warn\",\n\t\t\t\t\"error\",\n\t\t\t\t\"fatal\"\n\t\t\t]);\n\t}\n\n\t// This is meant to generate programmatically insecure UUIDs to identify loggers\n\tgenerateInsecureUUID()\n\t{\n\t\tlet tmpDate = new Date().getTime();\n\t\tlet tmpUUID = 'LOGSTREAM-xxxxxx-yxxxxx'.replace(/[xy]/g,\n\t\t\t\t(pCharacter) =>\n\t\t\t\t{\n\t\t\t\t\t// Funny algorithm from w3resource that is twister-ish without the deep math and security\n\t\t\t\t\t// ..but good enough for unique log stream identifiers\n\t\t\t\t\tlet tmpRandomData = (tmpDate + Math.random()*16)%16 | 0;\n\t\t\t\t\ttmpDate = Math.floor(tmpDate/16);\n\n\t\t\t\t\treturn (pCharacter =='x' ? tmpRandomData : (tmpRandomData&0x3|0x8)).toString(16);\n\t\t\t\t});\n\t\treturn tmpUUID;\n\t}\n\n\tinitialize()\n\t{\n\t\t// No operation.\n\t}\n\n\ttrace(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"trace\", pLogText, pLogObject);\n\t}\n\n\tdebug(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"debug\", pLogText, pLogObject);\n\t}\n\n\tinfo(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"info\", pLogText, pLogObject);\n\t}\n\n\twarn(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"warn\", pLogText, pLogObject);\n\t}\n\n\terror(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"error\", pLogText, pLogObject);\n\t}\n\n\tfatal(pLogText, pLogObject)\n\t{\n\t\tthis.write(\"fatal\", pLogText, pLogObject);\n\t}\n\n\twrite(pLogLevel, pLogText, pLogObject)\n\t{\n\t\t// The base logger does nothing.\n\t\treturn true;\n\t}\n}\n\nmodule.exports = BaseLogger;\n","/**\n* Default Logger Provider Function\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\n// Return the providers that are available without extensions loaded\nvar getDefaultProviders = () =>\n{\n\tlet tmpDefaultProviders = {};\n\n\ttmpDefaultProviders.console = require('./Fable-Log-Logger-Console.js');\n\n\ttmpDefaultProviders.default = tmpDefaultProviders.console;\n\n\treturn tmpDefaultProviders;\n}\n\nmodule.exports = getDefaultProviders();","module.exports=[\n {\n \"loggertype\": \"console\",\n \"streamtype\": \"console\",\n \"level\": \"trace\"\n }\n]","let libBaseLogger = require('./Fable-Log-BaseLogger.js');\n\nclass ConsoleLogger extends libBaseLogger\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\tsuper(pLogStreamSettings);\n\n\t\tthis._ShowTimeStamps = this._Settings.hasOwnProperty('showtimestamps') ? (this._Settings.showtimestamps == true) : true;\n\t\tthis._FormattedTimeStamps = this._Settings.hasOwnProperty('formattedtimestamps') ? (this._Settings.formattedtimestamps == true) : true;\n\n\t\tthis._ContextMessage = this._Settings.hasOwnProperty('Context') ? `(${this._Settings.Context})` : \n\t\t\t\t\t\t\t\tpFableLog._Settings.hasOwnProperty('Product') ? `(${pFableLog._Settings.Product})` :\n\t\t\t\t\t\t\t\t'Unnamed_Log_Context';\n\n\t\t// Allow the user to decide what gets output to the console\n\t\tthis._OutputLogLinesToConsole = this._Settings.hasOwnProperty('outputloglinestoconsole') ? this._Settings.outputloglinestoconsole : true;\n\t\tthis._OutputObjectsToConsole = this._Settings.hasOwnProperty('outputobjectstoconsole') ? this._Settings.outputobjectstoconsole : true;\n\n\t\t// Precompute the prefix for each level\n\t\tthis.prefixCache = {};\n\t\tfor (let i = 0; i <= this.levels.length; i++)\n\t\t{\n\t\t\tthis.prefixCache[this.levels[i]] = `[${this.levels[i]}] ${this._ContextMessage}: `;\n\n\t\t\tif (this._ShowTimeStamps)\n\t\t\t{\n\t\t\t\t// If there is a timestamp we need a to prepend space before the prefixcache string, since the timestamp comes first\n\t\t\t\tthis.prefixCache[this.levels[i]] = ' '+this.prefixCache[this.levels[i]];\n\t\t\t}\n\t\t}\n\t}\n\n\twrite(pLevel, pLogText, pObject)\n\t{\n\t\tlet tmpTimeStamp = '';\n\t\tif (this._ShowTimeStamps && this._FormattedTimeStamps)\n\t\t{\n\t\t\ttmpTimeStamp = (new Date()).toISOString();\n\t\t}\n\t\telse if (this._ShowTimeStamps)\n\t\t{\n\t\t\ttmpTimeStamp = +new Date();\n\t\t}\n\n\t\tlet tmpLogLine = `${tmpTimeStamp}${this.prefixCache[pLevel]}${pLogText}`;\n\n\t\tif (this._OutputLogLinesToConsole)\n\t\t{\n\t\t\tconsole.log(tmpLogLine);\n\t\t}\n\n\t\t// Write out the object on a separate line if it is passed in\n\t\tif (this._OutputObjectsToConsole && (typeof(pObject) !== 'undefined'))\n\t\t{\n\t\t\tconsole.log(JSON.stringify(pObject, null, 2));\n\t\t}\n\n\t\t// Provide an easy way to be overridden and be consistent\n\t\treturn tmpLogLine;\n\t}\n}\n\nmodule.exports = ConsoleLogger;","const libConsoleLog = require('./Fable-Log-Logger-Console.js');\nconst libFS = require('fs');\nconst libPath = require('path');\n\nclass SimpleFlatFileLogger extends libConsoleLog\n{\n\tconstructor(pLogStreamSettings, pFableLog)\n\t{\n\t\tsuper(pLogStreamSettings, pFableLog);\n\n\t\t// If a path isn't provided for the logfile, it tries to use the ProductName or Context\n\t\tthis.logFileRawPath = (this._Settings.hasOwnProperty('path')) ? this._Settings.path : `./${this._ContextMessage}.log`;\n\t\tthis.logFilePath = libPath.normalize(this.logFileRawPath);\n\n\t\tthis.logFileStreamOptions = (this._Settings.hasOwnProperty('fileStreamoptions')) ? this._Settings.fileStreamOptions : (\n\t\t\t{\n\t\t\t\t\"flags\": \"a\",\n\t\t\t\t\"encoding\": \"utf8\"\n\t\t\t})\n\n\t\tthis.fileWriter = libFS.createWriteStream(this.logFilePath, this.logFileStreamOptions);\n\n\t\tthis.activelyWriting = false;\n\n\t\tthis.logLineStrings = [];\n\t\tthis.logObjectStrings = [];\n\n\t\tthis.defaultWriteCompleteCallback = ()=>{};\n\t\tthis.defaultBufferFlushCallback = ()=>{};\n\t}\n\n\tcloseWriter(fCloseComplete)\n\t{\n\t\tlet tmpCloseComplete = (typeof(fCloseComplete) == 'function') ? fCloseComplete : ()=>{};\n\t\tif (this.fileWriter)\n\t\t{\n\t\t\tthis.fileWriter.end('\\n');\n\t\t\treturn this.fileWriter.once('finish', tmpCloseComplete.bind(this));\n\t\t}\n\t};\n\n\tcompleteBufferFlushToLogFile(fFlushComplete)\n\t{\n\t\tthis.activelyWriting = false;\n\t\tlet tmpFlushComplete = (typeof(fFlushComplete) == 'function') ? fFlushComplete : this.defaultBufferFlushCallback;\n\n\t\tif (this.logLineStrings.length > 0)\n\t\t{\n\t\t\tthis.flushBufferToLogFile(tmpFlushComplete);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn tmpFlushComplete();\n\t\t}\n\t}\n\n\tflushBufferToLogFile(fFlushComplete)\n\t{\n\t\tif (!this.activelyWriting)\n\t\t{\n\t\t\t// Only want to be writing one thing at a time....\n\t\t\tthis.activelyWriting = true;\n\n\t\t\tlet tmpFlushComplete = (typeof(fFlushComplete) == 'function') ? fFlushComplete : this.defaultBufferFlushCallback;\n\n\t\t\t// Get the current buffer arrays. These should always have matching number of elements.\n\t\t\tlet tmpLineStrings = this.logLineStrings;\n\t\t\tlet tmpObjectStrings = this.logObjectStrings;\n\n\t\t\t// Reset these to be filled while we process this queue...\n\t\t\tthis.logLineStrings = [];\n\t\t\tthis.logObjectStrings = [];\n\n\t\t\t// This is where we will put each line before writing it to the file...\n\t\t\tlet tmpConstructedBufferOutputString = '';\n\n\t\t\tfor (let i = 0; i < tmpLineStrings.length; i++)\n\t\t\t{\n\t\t\t\t// TODO: Windows Newline? ....... yo no se!\n\t\t\t\ttmpConstructedBufferOutputString += `${tmpLineStrings[i]}\\n`;\n\t\t\t\tif (tmpObjectStrings[i] !== false)\n\t\t\t\t{\n\t\t\t\t\ttmpConstructedBufferOutputString += `${tmpObjectStrings[i]}\\n`;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!this.fileWriter.write(tmpConstructedBufferOutputString, 'utf8'))\n\t\t\t{\n\t\t\t\t// If the streamwriter returns false, we need to wait for it to drain.\n\t\t\t\tthis.fileWriter.once('drain', this.completeBufferFlushToLogFile.bind(this, tmpFlushComplete));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn this.completeBufferFlushToLogFile(tmpFlushComplete);\n\t\t\t}\n\t\t}\n\t}\n\n\twrite(pLevel, pLogText, pObject)\n\t{\n\t\tlet tmpLogLine = super.write(pLevel, pLogText, pObject);\n\n\t\t// Use a very simple array as the write buffer\n\t\tthis.logLineStrings.push(tmpLogLine);\n\n\t\t// Write out the object on a separate line if it is passed in\n\t\tif (typeof(pObject) !== 'undefined')\n\t\t{\n\t\t\tthis.logObjectStrings.push(JSON.stringify(pObject, null, 4));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.logObjectStrings.push(false);\n\t\t}\n\n\t\tthis.flushBufferToLogFile();\n\t}\n}\n\nmodule.exports = SimpleFlatFileLogger;","/**\n* Fable Logging Add-on\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Logger\n*/\n\n/**\n* Fable Solution Log Wrapper Main Class\n*\n* @class FableLog\n* @constructor\n*/\nclass FableLog\n{\n\tconstructor(pFableSettings, pFable)\n\t{\n\t\tlet tmpSettings = (typeof(pFableSettings) === 'object') ? pFableSettings : {}\n\t\tthis._Settings = tmpSettings;\n\n\t\tthis._Providers = require('./Fable-Log-DefaultProviders-Node.js');\n\n\t\tthis._StreamDefinitions = (tmpSettings.hasOwnProperty('LogStreams')) ? tmpSettings.LogStreams : require('./Fable-Log-DefaultStreams.json');\n\n\t\tthis.logStreams = [];\n\n\t\t// This object gets decorated for one-time instantiated providers that\n\t\t// have multiple outputs, such as bunyan.\n\t\tthis.logProviders = {};\n\n\t\t// A hash list of the GUIDs for each log stream, so they can't be added to the set more than one time\n\t\tthis.activeLogStreams = {};\n\n\t\tthis.logStreamsTrace = [];\n\t\tthis.logStreamsDebug = [];\n\t\tthis.logStreamsInfo = [];\n\t\tthis.logStreamsWarn = [];\n\t\tthis.logStreamsError = [];\n\t\tthis.logStreamsFatal = [];\n\n\t\tthis.datumDecorator = (pDatum) => pDatum;\n\n\t\tthis.uuid = (typeof(tmpSettings.Product) === 'string') ? tmpSettings.Product : 'Default';\n\t}\n\n\taddLogger(pLogger, pLevel)\n\t{\n\t\t// Bail out if we've already created one.\n\t\tif (this.activeLogStreams.hasOwnProperty(pLogger.loggerUUID))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\t// Add it to the streams and to the mutex\n\t\tthis.logStreams.push(pLogger);\n\t\tthis.activeLogStreams[pLogger.loggerUUID] = true;\n\n\t\t// Make sure a kosher level was passed in\n\t\tswitch (pLevel)\n\t\t{\n\t\t\tcase 'trace':\n\t\t\t\tthis.logStreamsTrace.push(pLogger);\n\t\t\tcase 'debug':\n\t\t\t\tthis.logStreamsDebug.push(pLogger);\n\t\t\tcase 'info':\n\t\t\t\tthis.logStreamsInfo.push(pLogger);\n\t\t\tcase 'warn':\n\t\t\t\tthis.logStreamsWarn.push(pLogger);\n\t\t\tcase 'error':\n\t\t\t\tthis.logStreamsError.push(pLogger);\n\t\t\tcase 'fatal':\n\t\t\t\tthis.logStreamsFatal.push(pLogger);\n\t\t\t\tbreak;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tsetDatumDecorator(fDatumDecorator)\n\t{\n\t\tif (typeof(fDatumDecorator) === 'function')\n\t\t{\n\t\t\tthis.datumDecorator = fDatumDecorator;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.datumDecorator = (pDatum) => pDatum;\n\t\t}\n\t}\n\n\ttrace(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsTrace.length; i++)\n\t\t{\n\t\t\tthis.logStreamsTrace[i].trace(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tdebug(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsDebug.length; i++)\n\t\t{\n\t\t\tthis.logStreamsDebug[i].debug(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tinfo(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsInfo.length; i++)\n\t\t{\n\t\t\tthis.logStreamsInfo[i].info(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\twarn(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsWarn.length; i++)\n\t\t{\n\t\t\tthis.logStreamsWarn[i].warn(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\terror(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsError.length; i++)\n\t\t{\n\t\t\tthis.logStreamsError[i].error(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tfatal(pMessage, pDatum)\n\t{\n\t\tconst tmpDecoratedDatum = this.datumDecorator(pDatum);\n\t\tfor (let i = 0; i < this.logStreamsFatal.length; i++)\n\t\t{\n\t\t\tthis.logStreamsFatal[i].fatal(pMessage, tmpDecoratedDatum);\n\t\t}\n\t}\n\n\tinitialize()\n\t{\n\t\t// \"initialize\" each logger as defined in the logging parameters\n\t\tfor (let i = 0; i < this._StreamDefinitions.length; i++)\n\t\t{\n\t\t\tlet tmpStreamDefinition = Object.assign({loggertype:'default',streamtype:'console',level:'info'},this._StreamDefinitions[i]);\n\n\t\t\tif (!this._Providers.hasOwnProperty(tmpStreamDefinition.loggertype))\n\t\t\t{\n\t\t\t\tconsole.log(`Error initializing log stream: bad loggertype in stream definition ${JSON.stringify(tmpStreamDefinition)}`);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.addLogger(new this._Providers[tmpStreamDefinition.loggertype](tmpStreamDefinition, this), tmpStreamDefinition.level);\n\t\t\t}\n\t\t}\n\n\t\t// Now initialize each one.\n\t\tfor (let i = 0; i < this.logStreams.length; i++)\n\t\t{\n\t\t\tthis.logStreams[i].initialize();\n\t\t}\n\t}\n\n\tlogTime(pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time';\n\t\tlet tmpTime = new Date();\n\t\tthis.info(`${tmpMessage} ${tmpTime} (epoch ${+tmpTime})`, pDatum);\n\t}\n\n\t// Get a timestamp\n\tgetTimeStamp()\n\t{\n\t\treturn +new Date();\n\t}\n\n\tgetTimeDelta(pTimeStamp)\n\t{\n\t\tlet tmpEndTime = +new Date();\n\t\treturn tmpEndTime-pTimeStamp;\n\t}\n\n\t// Log the delta between a timestamp, and now with a message\n\tlogTimeDelta(pTimeDelta, pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time Measurement';\n\t\tlet tmpDatum = (typeof(pDatum) === 'object') ? pDatum : {};\n\n\t\tlet tmpEndTime = +new Date();\n\n\t\tthis.info(`${tmpMessage} logged at (epoch ${+tmpEndTime}) took (${pTimeDelta}ms)`, pDatum);\n\t}\n\n\tlogTimeDeltaHuman(pTimeDelta, pMessage, pDatum)\n\t{\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : 'Time Measurement';\n\n\t\tlet tmpEndTime = +new Date();\n\n\t\tlet tmpMs = parseInt(pTimeDelta%1000);\n\t\tlet tmpSeconds = parseInt((pTimeDelta/1000)%60);\n\t\tlet tmpMinutes = parseInt((pTimeDelta/(1000*60))%60);\n\t\tlet tmpHours = parseInt(pTimeDelta/(1000*60*60));\n\n\t\ttmpMs = (tmpMs < 10) ? \"00\"+tmpMs : (tmpMs < 100) ? \"0\"+tmpMs : tmpMs;\n\t\ttmpSeconds = (tmpSeconds < 10) ? \"0\"+tmpSeconds : tmpSeconds;\n\t\ttmpMinutes = (tmpMinutes < 10) ? \"0\"+tmpMinutes : tmpMinutes;\n\t\ttmpHours = (tmpHours < 10) ? \"0\"+tmpHours : tmpHours;\n\n\t\tthis.info(`${tmpMessage} logged at (epoch ${+tmpEndTime}) took (${pTimeDelta}ms) or (${tmpHours}:${tmpMinutes}:${tmpSeconds}.${tmpMs})`, pDatum);\n\t}\n\n\tlogTimeDeltaRelative(pStartTime, pMessage, pDatum)\n\t{\n\t\tthis.logTimeDelta(this.getTimeDelta(pStartTime), pMessage, pDatum);\n\t}\n\n\tlogTimeDeltaRelativeHuman(pStartTime, pMessage, pDatum)\n\t{\n\t\tthis.logTimeDeltaHuman(this.getTimeDelta(pStartTime), pMessage, pDatum);\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableLog(pSettings);\n}\n\n\nmodule.exports = FableLog;\nmodule.exports.new = autoConstruct;\nmodule.exports.LogProviderBase = require('./Fable-Log-BaseLogger.js');\nmodule.exports.LogProviderConsole = require('./Fable-Log-Logger-Console.js');\nmodule.exports.LogProviderConsole = require('./Fable-Log-Logger-SimpleFlatFile.js');\n","module.exports={\n\t\"Product\": \"ApplicationNameHere\",\n\t\"ProductVersion\": \"0.0.0\",\n\n\t\"ConfigFile\": false,\n\n\t\"LogStreams\":\n\t[\n\t\t{\n\t\t\t\"level\": \"trace\"\n\t\t}\n\t]\n}\n","/**\n* Fable Settings Template Processor\n*\n* This class allows environment variables to come in via templated expressions, and defaults to be set.\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\n\nclass FableSettingsTemplateProcessor\n{\n\tconstructor(pDependencies)\n\t{\n // Use a no-dependencies templating engine to parse out environment variables\n\t\tthis.templateProcessor = new pDependencies.precedent();\n\n // TODO: Make the environment variable wrap expression demarcation characters configurable?\n\t\tthis.templateProcessor.addPattern('${', '}',\n\t\t\t(pTemplateValue)=>\n\t\t\t{\n\t\t\t\tlet tmpTemplateValue = pTemplateValue.trim();\n\n\t\t\t\tlet tmpSeparatorIndex = tmpTemplateValue.indexOf('|');\n\n\t\t\t\t// If there is no pipe, the default value will end up being whatever the variable name is.\n\t\t\t\tlet tmpDefaultValue = tmpTemplateValue.substring(tmpSeparatorIndex+1);\n\n\t\t\t\tlet tmpEnvironmentVariableName = (tmpSeparatorIndex > -1) ? tmpTemplateValue.substring(0, tmpSeparatorIndex) : tmpTemplateValue;\n\n\t\t\t\tif (process.env.hasOwnProperty(tmpEnvironmentVariableName))\n\t\t\t\t{\n\t\t\t\t\treturn process.env[tmpEnvironmentVariableName];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\treturn tmpDefaultValue;\n\t\t\t\t}\n\t\t\t});\n }\n\n parseSetting(pString)\n {\n return this.templateProcessor.parseString(pString);\n }\n}\n\nmodule.exports = FableSettingsTemplateProcessor;","/**\n* Fable Settings Add-on\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\n\nconst libPrecedent = require('precedent');\nconst libFableSettingsTemplateProcessor = require('./Fable-Settings-TemplateProcessor.js');\n\nclass FableSettings\n{\n\tconstructor(pFableSettings)\n\t{\n\t\t// Expose the dependencies for downstream re-use\n\t\tthis.dependencies = (\n\t\t\t{\n\t\t\t\tprecedent: libPrecedent\n\t\t\t});\n\n\t\t// Initialize the settings value template processor\n\t\tthis.settingsTemplateProcessor = new libFableSettingsTemplateProcessor(this.dependencies);\n\n\t\t// set straight away so anything that uses it respects the initial setting\n\t\tthis._configureEnvTemplating(pFableSettings);\n\n\t\tthis.default = this.buildDefaultSettings();\n\n\t\t// Construct a new settings object\n\t\tlet tmpSettings = this.merge(pFableSettings, this.buildDefaultSettings());\n\n\t\t// The base settings object (what they were on initialization, before other actors have altered them)\n\t\tthis.base = JSON.parse(JSON.stringify(tmpSettings));\n\n\t\tif (tmpSettings.DefaultConfigFile)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\t// If there is a DEFAULT configuration file, try to load and merge it.\n\t\t\t\ttmpSettings = this.merge(require(tmpSettings.DefaultConfigFile), tmpSettings);\n\t\t\t}\n\t\t\tcatch (pException)\n\t\t\t{\n\t\t\t\t// Why this? Often for an app we want settings to work out of the box, but\n\t\t\t\t// would potentially want to have a config file for complex settings.\n\t\t\t\tconsole.log('Fable-Settings Warning: Default configuration file specified but there was a problem loading it. Falling back to base.');\n\t\t\t\tconsole.log(' Loading Exception: '+pException);\n\t\t\t}\n\t\t}\n\n\t\tif (tmpSettings.ConfigFile)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\t// If there is a configuration file, try to load and merge it.\n\t\t\t\ttmpSettings = this.merge(require(tmpSettings.ConfigFile), tmpSettings);\n\t\t\t}\n\t\t\tcatch (pException)\n\t\t\t{\n\t\t\t\t// Why this? Often for an app we want settings to work out of the box, but\n\t\t\t\t// would potentially want to have a config file for complex settings.\n\t\t\t\tconsole.log('Fable-Settings Warning: Configuration file specified but there was a problem loading it. Falling back to base.');\n\t\t\t\tconsole.log(' Loading Exception: '+pException);\n\t\t\t}\n\t\t}\n\n\t\tthis.settings = tmpSettings;\n\t}\n\n\t// Build a default settings object. Use the JSON jimmy to ensure it is always a new object.\n\tbuildDefaultSettings()\n\t{\n\t\treturn JSON.parse(JSON.stringify(require('./Fable-Settings-Default')));\n\t}\n\n\t// Update the configuration for environment variable templating based on the current settings object\n\t_configureEnvTemplating(pSettings)\n\t{\n\t\t// default environment variable templating to on\n\t\tthis._PerformEnvTemplating = !pSettings || pSettings.NoEnvReplacement !== true;\n\t}\n\n\t// Resolve (recursive) any environment variables found in settings object.\n\t_resolveEnv(pSettings)\n\t{\n\t\tfor (const tmpKey in pSettings)\n\t\t{\n\t\t\tif (typeof(pSettings[tmpKey]) === 'object')\n\t\t\t{\n\t\t\t\tthis._resolveEnv(pSettings[tmpKey]);\n\t\t\t}\n\t\t\telse if (typeof(pSettings[tmpKey]) === 'string')\n\t\t\t{\n\t\t\t\tpSettings[tmpKey] = this.settingsTemplateProcessor.parseSetting(pSettings[tmpKey]);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Check to see if a value is an object (but not an array).\n\t */\n\t_isObject(value)\n\t{\n\t\treturn typeof(value) === 'object' && !Array.isArray(value);\n\t}\n\n\t/**\n\t * Merge two plain objects. Keys that are objects in both will be merged property-wise.\n\t */\n\t_deepMergeObjects(toObject, fromObject)\n\t{\n\t\tif (!fromObject || !this._isObject(fromObject))\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\tObject.keys(fromObject).forEach((key) =>\n\t\t{\n\t\t\tconst fromValue = fromObject[key];\n\t\t\tif (this._isObject(fromValue))\n\t\t\t{\n\t\t\t\tconst toValue = toObject[key];\n\t\t\t\tif (toValue && this._isObject(toValue))\n\t\t\t\t{\n\t\t\t\t\t// both are objects, so do a recursive merge\n\t\t\t\t\tthis._deepMergeObjects(toValue, fromValue);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttoObject[key] = fromValue;\n\t\t});\n\t\treturn toObject;\n\t}\n\n\t// Merge some new object into the existing settings.\n\tmerge(pSettingsFrom, pSettingsTo)\n\t{\n\t\t// If an invalid settings from object is passed in (e.g. object constructor without passing in anything) this should still work\n\t\tlet tmpSettingsFrom = (typeof(pSettingsFrom) === 'object') ? pSettingsFrom : {};\n\t\t// Default to the settings object if none is passed in for the merge.\n\t\tlet tmpSettingsTo = (typeof(pSettingsTo) === 'object') ? pSettingsTo : this.settings;\n\n\t\t// do not mutate the From object property values\n\t\tlet tmpSettingsFromCopy = JSON.parse(JSON.stringify(tmpSettingsFrom));\n\t\ttmpSettingsTo = this._deepMergeObjects(tmpSettingsTo, tmpSettingsFromCopy);\n\n\t\tif (this._PerformEnvTemplating)\n\t\t{\n\t\t\tthis._resolveEnv(tmpSettingsTo);\n\t\t}\n\t\t// Update env tempating config, since we just updated the config object, and it may have changed\n\t\tthis._configureEnvTemplating(tmpSettingsTo);\n\n\t\treturn tmpSettingsTo;\n\t}\n\n\t// Fill in settings gaps without overwriting settings that are already there\n\tfill(pSettingsFrom)\n\t{\n\t\t// If an invalid settings from object is passed in (e.g. object constructor without passing in anything) this should still work\n\t\tlet tmpSettingsFrom = (typeof(pSettingsFrom) === 'object') ? pSettingsFrom : {};\n\n\t\t// do not mutate the From object property values\n\t\tlet tmpSettingsFromCopy = JSON.parse(JSON.stringify(tmpSettingsFrom));\n\n\t\tthis.settings = this._deepMergeObjects(tmpSettingsFromCopy, this.settings);\n\n\t\treturn this.settings;\n\t}\n};\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableSettings(pSettings);\n}\n\nmodule.exports = FableSettings;\nmodule.exports.new = autoConstruct;\nmodule.exports.precedent = libPrecedent;","/**\n* Random Byte Generator - Browser version\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\n// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n// Unique ID creation requires a high quality random # generator. In the\n// browser this is a little complicated due to unknown quality of Math.random()\n// and inconsistent support for the `crypto` API. We do the best we can via\n// feature-detection\nclass RandomBytes\n{\n\tconstructor()\n\t{\n\n\t\t// getRandomValues needs to be invoked in a context where \"this\" is a Crypto\n\t\t// implementation. Also, find the complete implementation of crypto on IE11.\n\t\tthis.getRandomValues = (typeof(crypto) != 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto)) ||\n \t\t(typeof(msCrypto) != 'undefined' && typeof window.msCrypto.getRandomValues == 'function' && msCrypto.getRandomValues.bind(msCrypto));\n\t}\n\n\t// WHATWG crypto RNG - http://wiki.whatwg.org/wiki/Crypto\n\tgenerateWhatWGBytes()\n\t{\n\t\tlet tmpBuffer = new Uint8Array(16); // eslint-disable-line no-undef\n\n\t\tthis.getRandomValues(tmpBuffer);\n\t\treturn tmpBuffer;\n\t}\n\n\t// Math.random()-based (RNG)\n\tgenerateRandomBytes()\n\t{\n\t\t// If all else fails, use Math.random(). It's fast, but is of unspecified\n\t\t// quality.\n\t\tlet tmpBuffer = new Uint8Array(16); // eslint-disable-line no-undef\n\n\t\tfor (let i = 0, tmpValue; i < 16; i++)\n\t\t{\n\t\t\tif ((i & 0x03) === 0)\n\t\t\t{\n\t\t\t\ttmpValue = Math.random() * 0x100000000;\n\t\t\t}\n\n\t\t\ttmpBuffer[i] = tmpValue >>> ((i & 0x03) << 3) & 0xff;\n\t\t}\n\n\t\treturn tmpBuffer;\n\t}\n\n\tgenerate()\n\t{\n\t\tif (this.getRandomValues)\n\t\t{\n\t\t\treturn this.generateWhatWGBytes();\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.generateRandomBytes();\n\t\t}\n\t}\n}\n\nmodule.exports = RandomBytes;\n","/**\n* Fable UUID Generator\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable UUID\n*/\n\n/**\n* Fable Solution UUID Generation Main Class\n*\n* @class FableUUID\n* @constructor\n*/\n\nvar libRandomByteGenerator = require('./Fable-UUID-Random.js')\n\nclass FableUUID\n{\n\tconstructor(pSettings)\n\t{\n\t\t// Determine if the module is in \"Random UUID Mode\" which means just use the random character function rather than the v4 random UUID spec.\n\t\t// Note this allows UUIDs of various lengths (including very short ones) although guaranteed uniqueness goes downhill fast.\n\t\tthis._UUIDModeRandom = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDModeRandom')) ? (pSettings.UUIDModeRandom == true) : false;\n\t\t// These two properties are only useful if we are in Random mode. Otherwise it generates a v4 spec\n\t\t// Length for \"Random UUID Mode\" is set -- if not set it to 8\n\t\tthis._UUIDLength = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDLength')) ? (pSettings.UUIDLength + 0) : 8;\n\t\t// Dictionary for \"Random UUID Mode\"\n\t\tthis._UUIDRandomDictionary = (typeof(pSettings) === 'object') && (pSettings.hasOwnProperty('UUIDDictionary')) ? (pSettings.UUIDDictionary + 0) : '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ';\n\n\t\tthis.randomByteGenerator = new libRandomByteGenerator();\n\n\t\t// Lookup table for hex codes\n\t\tthis._HexLookup = [];\n\t\tfor (let i = 0; i < 256; ++i)\n\t\t{\n\t\t\tthis._HexLookup[i] = (i + 0x100).toString(16).substr(1);\n\t\t}\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tbytesToUUID(pBuffer)\n\t{\n\t\tlet i = 0;\n\t\t// join used to fix memory issue caused by concatenation: https://bugs.chromium.org/p/v8/issues/detail?id=3175#c4\n\t\treturn ([\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], \n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], '-',\n\t\t\t\t\tthis._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]], this._HexLookup[pBuffer[i++]]\n\t\t\t\t]).join('');\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tgenerateUUIDv4()\n\t{\n\t\tlet tmpBuffer = new Array(16);\n\t\tvar tmpRandomBytes = this.randomByteGenerator.generate();\n\n\t\t// Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\t\ttmpRandomBytes[6] = (tmpRandomBytes[6] & 0x0f) | 0x40;\n\t\ttmpRandomBytes[8] = (tmpRandomBytes[8] & 0x3f) | 0x80;\n\n\t\treturn this.bytesToUUID(tmpRandomBytes);\n\t}\n\n\t// Simple random UUID generation\n\tgenerateRandom()\n\t{\n\t\tlet tmpUUID = '';\n\n\t\tfor (let i = 0; i < this._UUIDLength; i++)\n\t\t{\n\t\t\ttmpUUID += this._UUIDRandomDictionary.charAt(Math.floor(Math.random() * (this._UUIDRandomDictionary.length-1)));\n\t\t}\n\n\t\treturn tmpUUID;\n\t}\n\n\t// Adapted from node-uuid (https://github.com/kelektiv/node-uuid)\n\tgetUUID()\n\t{\n\t\tif (this._UUIDModeRandom)\n\t\t{\n\t\t\treturn this.generateRandom();\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.generateUUIDv4();\n\t\t}\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new FableUUID(pSettings);\n}\n\n\nmodule.exports = FableUUID;\nmodule.exports.new = autoConstruct;\n","var http = require('http')\nvar url = require('url')\n\nvar https = module.exports\n\nfor (var key in http) {\n if (http.hasOwnProperty(key)) https[key] = http[key]\n}\n\nhttps.request = function (params, cb) {\n params = validateParams(params)\n return http.request.call(this, params, cb)\n}\n\nhttps.get = function (params, cb) {\n params = validateParams(params)\n return http.get.call(this, params, cb)\n}\n\nfunction validateParams (params) {\n if (typeof params === 'string') {\n params = url.parse(params)\n }\n if (!params.protocol) {\n params.protocol = 'https:'\n }\n if (params.protocol !== 'https:') {\n throw new Error('Protocol \"' + params.protocol + '\" not supported. Expected \"https:\"')\n }\n return params\n}\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.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","if (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n if (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 };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n if (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}\n","var wrappy = require('wrappy')\nmodule.exports = wrappy(once)\nmodule.exports.strict = wrappy(onceStrict)\n\nonce.proto = once(function () {\n Object.defineProperty(Function.prototype, 'once', {\n value: function () {\n return once(this)\n },\n configurable: true\n })\n\n Object.defineProperty(Function.prototype, 'onceStrict', {\n value: function () {\n return onceStrict(this)\n },\n configurable: true\n })\n})\n\nfunction once (fn) {\n var f = function () {\n if (f.called) return f.value\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n f.called = false\n return f\n}\n\nfunction onceStrict (fn) {\n var f = function () {\n if (f.called)\n throw new Error(f.onceError)\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n var name = fn.name || 'Function wrapped with `once`'\n f.onceError = name + \" shouldn't be called more than once\"\n f.called = false\n return f\n}\n","// 'path' module extracted from Node.js v8.11.1 (only the posix part)\n// transplited with Babel\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\n'use strict';\n\nfunction assertPath(path) {\n if (typeof path !== 'string') {\n throw new TypeError('Path must be a string. Received ' + JSON.stringify(path));\n }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n var res = '';\n var lastSegmentLength = 0;\n var lastSlash = -1;\n var dots = 0;\n var code;\n for (var i = 0; i <= path.length; ++i) {\n if (i < path.length)\n code = path.charCodeAt(i);\n else if (code === 47 /*/*/)\n break;\n else\n code = 47 /*/*/;\n if (code === 47 /*/*/) {\n if (lastSlash === i - 1 || dots === 1) {\n // NOOP\n } else if (lastSlash !== i - 1 && dots === 2) {\n if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) {\n if (res.length > 2) {\n var lastSlashIndex = res.lastIndexOf('/');\n if (lastSlashIndex !== res.length - 1) {\n if (lastSlashIndex === -1) {\n res = '';\n lastSegmentLength = 0;\n } else {\n res = res.slice(0, lastSlashIndex);\n lastSegmentLength = res.length - 1 - res.lastIndexOf('/');\n }\n lastSlash = i;\n dots = 0;\n continue;\n }\n } else if (res.length === 2 || res.length === 1) {\n res = '';\n lastSegmentLength = 0;\n lastSlash = i;\n dots = 0;\n continue;\n }\n }\n if (allowAboveRoot) {\n if (res.length > 0)\n res += '/..';\n else\n res = '..';\n lastSegmentLength = 2;\n }\n } else {\n if (res.length > 0)\n res += '/' + path.slice(lastSlash + 1, i);\n else\n res = path.slice(lastSlash + 1, i);\n lastSegmentLength = i - lastSlash - 1;\n }\n lastSlash = i;\n dots = 0;\n } else if (code === 46 /*.*/ && dots !== -1) {\n ++dots;\n } else {\n dots = -1;\n }\n }\n return res;\n}\n\nfunction _format(sep, pathObject) {\n var dir = pathObject.dir || pathObject.root;\n var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || '');\n if (!dir) {\n return base;\n }\n if (dir === pathObject.root) {\n return dir + base;\n }\n return dir + sep + base;\n}\n\nvar posix = {\n // path.resolve([from ...], to)\n resolve: function resolve() {\n var resolvedPath = '';\n var resolvedAbsolute = false;\n var cwd;\n\n for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n var path;\n if (i >= 0)\n path = arguments[i];\n else {\n if (cwd === undefined)\n cwd = process.cwd();\n path = cwd;\n }\n\n assertPath(path);\n\n // Skip empty entries\n if (path.length === 0) {\n continue;\n }\n\n resolvedPath = path + '/' + resolvedPath;\n resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/;\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n if (resolvedAbsolute) {\n if (resolvedPath.length > 0)\n return '/' + resolvedPath;\n else\n return '/';\n } else if (resolvedPath.length > 0) {\n return resolvedPath;\n } else {\n return '.';\n }\n },\n\n normalize: function normalize(path) {\n assertPath(path);\n\n if (path.length === 0) return '.';\n\n var isAbsolute = path.charCodeAt(0) === 47 /*/*/;\n var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/;\n\n // Normalize the path\n path = normalizeStringPosix(path, !isAbsolute);\n\n if (path.length === 0 && !isAbsolute) path = '.';\n if (path.length > 0 && trailingSeparator) path += '/';\n\n if (isAbsolute) return '/' + path;\n return path;\n },\n\n isAbsolute: function isAbsolute(path) {\n assertPath(path);\n return path.length > 0 && path.charCodeAt(0) === 47 /*/*/;\n },\n\n join: function join() {\n if (arguments.length === 0)\n return '.';\n var joined;\n for (var i = 0; i < arguments.length; ++i) {\n var arg = arguments[i];\n assertPath(arg);\n if (arg.length > 0) {\n if (joined === undefined)\n joined = arg;\n else\n joined += '/' + arg;\n }\n }\n if (joined === undefined)\n return '.';\n return posix.normalize(joined);\n },\n\n relative: function relative(from, to) {\n assertPath(from);\n assertPath(to);\n\n if (from === to) return '';\n\n from = posix.resolve(from);\n to = posix.resolve(to);\n\n if (from === to) return '';\n\n // Trim any leading backslashes\n var fromStart = 1;\n for (; fromStart < from.length; ++fromStart) {\n if (from.charCodeAt(fromStart) !== 47 /*/*/)\n break;\n }\n var fromEnd = from.length;\n var fromLen = fromEnd - fromStart;\n\n // Trim any leading backslashes\n var toStart = 1;\n for (; toStart < to.length; ++toStart) {\n if (to.charCodeAt(toStart) !== 47 /*/*/)\n break;\n }\n var toEnd = to.length;\n var toLen = toEnd - toStart;\n\n // Compare paths to find the longest common path from root\n var length = fromLen < toLen ? fromLen : toLen;\n var lastCommonSep = -1;\n var i = 0;\n for (; i <= length; ++i) {\n if (i === length) {\n if (toLen > length) {\n if (to.charCodeAt(toStart + i) === 47 /*/*/) {\n // We get here if `from` is the exact base path for `to`.\n // For example: from='/foo/bar'; to='/foo/bar/baz'\n return to.slice(toStart + i + 1);\n } else if (i === 0) {\n // We get here if `from` is the root\n // For example: from='/'; to='/foo'\n return to.slice(toStart + i);\n }\n } else if (fromLen > length) {\n if (from.charCodeAt(fromStart + i) === 47 /*/*/) {\n // We get here if `to` is the exact base path for `from`.\n // For example: from='/foo/bar/baz'; to='/foo/bar'\n lastCommonSep = i;\n } else if (i === 0) {\n // We get here if `to` is the root.\n // For example: from='/foo'; to='/'\n lastCommonSep = 0;\n }\n }\n break;\n }\n var fromCode = from.charCodeAt(fromStart + i);\n var toCode = to.charCodeAt(toStart + i);\n if (fromCode !== toCode)\n break;\n else if (fromCode === 47 /*/*/)\n lastCommonSep = i;\n }\n\n var out = '';\n // Generate the relative path based on the path difference between `to`\n // and `from`\n for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n if (i === fromEnd || from.charCodeAt(i) === 47 /*/*/) {\n if (out.length === 0)\n out += '..';\n else\n out += '/..';\n }\n }\n\n // Lastly, append the rest of the destination (`to`) path that comes after\n // the common path parts\n if (out.length > 0)\n return out + to.slice(toStart + lastCommonSep);\n else {\n toStart += lastCommonSep;\n if (to.charCodeAt(toStart) === 47 /*/*/)\n ++toStart;\n return to.slice(toStart);\n }\n },\n\n _makeLong: function _makeLong(path) {\n return path;\n },\n\n dirname: function dirname(path) {\n assertPath(path);\n if (path.length === 0) return '.';\n var code = path.charCodeAt(0);\n var hasRoot = code === 47 /*/*/;\n var end = -1;\n var matchedSlash = true;\n for (var i = path.length - 1; i >= 1; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n if (!matchedSlash) {\n end = i;\n break;\n }\n } else {\n // We saw the first non-path separator\n matchedSlash = false;\n }\n }\n\n if (end === -1) return hasRoot ? '/' : '.';\n if (hasRoot && end === 1) return '//';\n return path.slice(0, end);\n },\n\n basename: function basename(path, ext) {\n if (ext !== undefined && typeof ext !== 'string') throw new TypeError('\"ext\" argument must be a string');\n assertPath(path);\n\n var start = 0;\n var end = -1;\n var matchedSlash = true;\n var i;\n\n if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n if (ext.length === path.length && ext === path) return '';\n var extIdx = ext.length - 1;\n var firstNonSlashEnd = -1;\n for (i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else {\n if (firstNonSlashEnd === -1) {\n // We saw the first non-path separator, remember this index in case\n // we need it if the extension ends up not matching\n matchedSlash = false;\n firstNonSlashEnd = i + 1;\n }\n if (extIdx >= 0) {\n // Try to match the explicit extension\n if (code === ext.charCodeAt(extIdx)) {\n if (--extIdx === -1) {\n // We matched the extension, so mark this as the end of our path\n // component\n end = i;\n }\n } else {\n // Extension does not match, so our result is the entire path\n // component\n extIdx = -1;\n end = firstNonSlashEnd;\n }\n }\n }\n }\n\n if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length;\n return path.slice(start, end);\n } else {\n for (i = path.length - 1; i >= 0; --i) {\n if (path.charCodeAt(i) === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // path component\n matchedSlash = false;\n end = i + 1;\n }\n }\n\n if (end === -1) return '';\n return path.slice(start, end);\n }\n },\n\n extname: function extname(path) {\n assertPath(path);\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n for (var i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1)\n startDot = i;\n else if (preDotState !== 1)\n preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n return '';\n }\n return path.slice(startDot, end);\n },\n\n format: function format(pathObject) {\n if (pathObject === null || typeof pathObject !== 'object') {\n throw new TypeError('The \"pathObject\" argument must be of type Object. Received type ' + typeof pathObject);\n }\n return _format('/', pathObject);\n },\n\n parse: function parse(path) {\n assertPath(path);\n\n var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n if (path.length === 0) return ret;\n var code = path.charCodeAt(0);\n var isAbsolute = code === 47 /*/*/;\n var start;\n if (isAbsolute) {\n ret.root = '/';\n start = 1;\n } else {\n start = 0;\n }\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n var i = path.length - 1;\n\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n\n // Get non-dir info\n for (; i >= start; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n if (end !== -1) {\n if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end);\n }\n } else {\n if (startPart === 0 && isAbsolute) {\n ret.name = path.slice(1, startDot);\n ret.base = path.slice(1, end);\n } else {\n ret.name = path.slice(startPart, startDot);\n ret.base = path.slice(startPart, end);\n }\n ret.ext = path.slice(startDot, end);\n }\n\n if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/';\n\n return ret;\n },\n\n sep: '/',\n delimiter: ':',\n win32: null,\n posix: null\n};\n\nposix.posix = posix;\n\nmodule.exports = posix;\n","/**\n* Precedent Meta-Templating\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Process text streams, parsing out meta-template expressions.\n*/\nvar libWordTree = require(`./WordTree.js`);\nvar libStringParser = require(`./StringParser.js`);\n\nclass Precedent\n{\n\t/**\n\t * Precedent Constructor\n\t */\n\tconstructor()\n\t{\n\t\tthis.WordTree = new libWordTree();\n\n\t\tthis.StringParser = new libStringParser();\n\n\t\tthis.ParseTree = this.WordTree.ParseTree;\n\t}\n\n\t/**\n\t * Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pTree - A node on the parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern(pPatternStart, pPatternEnd, pParser)\n\t{\n\t\treturn this.WordTree.addPattern(pPatternStart, pPatternEnd, pParser);\n\t}\n\n\t/**\n\t * Parse a string with the existing parse tree\n\t * @method parseString\n\t * @param {string} pString - The string to parse\n\t * @param {object} pData - Data to pass in as the second argument\n\t * @return {string} The result from the parser\n\t */\n\tparseString(pString, pData)\n\t{\n\t\treturn this.StringParser.parseString(pString, this.ParseTree, pData);\n\t}\n}\n\nmodule.exports = Precedent;\n","/**\n* String Parser\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Parse a string, properly processing each matched token in the word tree.\n*/\n\nclass StringParser\n{\n\t/**\n\t * StringParser Constructor\n\t */\n\tconstructor()\n\t{\n\t}\n\n\t/**\n\t * Create a fresh parsing state object to work with.\n\t * @method newParserState\n\t * @param {Object} pParseTree - A node on the parse tree to begin parsing from (usually root)\n\t * @return {Object} A new parser state object for running a character parser on\n\t * @private\n\t */\n\tnewParserState (pParseTree)\n\t{\n\t\treturn (\n\t\t{\n\t\t\tParseTree: pParseTree,\n\n\t\t\tOutput: '',\n\t\t\tOutputBuffer: '',\n\n\t\t\tPattern: false,\n\n\t\t\tPatternMatch: false,\n\t\t\tPatternMatchOutputBuffer: ''\n\t\t});\n\t}\n\n\t/**\n\t * Assign a node of the parser tree to be the next potential match.\n\t * If the node has a PatternEnd property, it is a valid match and supercedes the last valid match (or becomes the initial match).\n\t * @method assignNode\n\t * @param {Object} pNode - A node on the parse tree to assign\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tassignNode (pNode, pParserState)\n\t{\n\t\tpParserState.PatternMatch = pNode;\n\n\t\t// If the pattern has a END we can assume it has a parse function...\n\t\tif (pParserState.PatternMatch.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\t// ... this is the legitimate start of a pattern.\n\t\t\tpParserState.Pattern = pParserState.PatternMatch;\n\t\t}\n\t}\n\n\t/**\n\t * Append a character to the output buffer in the parser state.\n\t * This output buffer is used when a potential match is being explored, or a match is being explored.\n\t * @method appendOutputBuffer\n\t * @param {string} pCharacter - The character to append\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tappendOutputBuffer (pCharacter, pParserState)\n\t{\n\t\tpParserState.OutputBuffer += pCharacter;\n\t}\n\n\t/**\n\t * Flush the output buffer to the output and clear it.\n\t * @method flushOutputBuffer\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tflushOutputBuffer (pParserState)\n\t{\n\t\tpParserState.Output += pParserState.OutputBuffer;\n\t\tpParserState.OutputBuffer = '';\n\t}\n\n\n\t/**\n\t * Check if the pattern has ended. If it has, properly flush the buffer and start looking for new patterns.\n\t * @method checkPatternEnd\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tcheckPatternEnd (pParserState, pData)\n\t{\n\t\tif ((pParserState.OutputBuffer.length >= pParserState.Pattern.PatternEnd.length+pParserState.Pattern.PatternStart.length) &&\n\t\t\t(pParserState.OutputBuffer.substr(-pParserState.Pattern.PatternEnd.length) === pParserState.Pattern.PatternEnd))\n\t\t{\n\t\t\t// ... this is the end of a pattern, cut off the end tag and parse it.\n\t\t\t// Trim the start and end tags off the output buffer now\n\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStart.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStart.length+pParserState.Pattern.PatternEnd.length)), pData);\n\t\t\t// Flush the output buffer.\n\t\t\tthis.flushOutputBuffer(pParserState);\n\t\t\t// End pattern mode\n\t\t\tpParserState.Pattern = false;\n\t\t\tpParserState.PatternMatch = false;\n\t\t}\n\t}\n\n\t/**\n\t * Parse a character in the buffer.\n\t * @method parseCharacter\n\t * @param {string} pCharacter - The character to append\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tparseCharacter (pCharacter, pParserState, pData)\n\t{\n\t\t// (1) If we aren't in a pattern match, and we aren't potentially matching, and this may be the start of a new pattern....\n\t\tif (!pParserState.PatternMatch && pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t{\n\t\t\t// ... assign the node as the matched node.\n\t\t\tthis.assignNode(pParserState.ParseTree[pCharacter], pParserState);\n\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t}\n\t\t// (2) If we are in a pattern match (actively seeing if this is part of a new pattern token)\n\t\telse if (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern has a subpattern with this key\n\t\t\tif (pParserState.PatternMatch.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// Continue matching patterns.\n\t\t\t\tthis.assignNode(pParserState.PatternMatch[pCharacter], pParserState);\n\t\t\t}\n\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\tif (pParserState.Pattern)\n\t\t\t{\n\t\t\t\t// ... Check if this is the end of the pattern (if we are matching a valid pattern)...\n\t\t\t\tthis.checkPatternEnd(pParserState, pData);\n\t\t\t}\n\t\t}\n\t\t// (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\telse\n\t\t{\n\t\t\tpParserState.Output += pCharacter;\n\t\t}\n\t}\n\n\t/**\n\t * Parse a string for matches, and process any template segments that occur.\n\t * @method parseString\n\t * @param {string} pString - The string to parse.\n\t * @param {Object} pParseTree - The parse tree to begin parsing from (usually root)\n\t * @param {Object} pData - The data to pass to the function as a second paramter\n\t */\n\tparseString (pString, pParseTree, pData)\n\t{\n\t\tlet tmpParserState = this.newParserState(pParseTree);\n\n\t\tfor (var i = 0; i < pString.length; i++)\n\t\t{\n\t\t\t// TODO: This is not fast.\n\t\t\tthis.parseCharacter(pString[i], tmpParserState, pData);\n\t\t}\n\n\t\tthis.flushOutputBuffer(tmpParserState);\n\n\t\treturn tmpParserState.Output;\n\t}\n}\n\nmodule.exports = StringParser;\n","/**\n* Word Tree\n*\n* @license MIT\n*\n* @author Steven Velozo <steven@velozo.com>\n*\n* @description Create a tree (directed graph) of Javascript objects, one character per object.\n*/\n\nclass WordTree\n{\n\t/**\n\t * WordTree Constructor\n\t */\n\tconstructor()\n\t{\n\t\tthis.ParseTree = {};\n\t}\n\t\n\t/** \n\t * Add a child character to a Parse Tree node\n\t * @method addChild\n\t * @param {Object} pTree - A parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - The index of the character in the pattern\n\t * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddChild (pTree, pPattern, pIndex)\n\t{\n\t\tif (!pTree.hasOwnProperty(pPattern[pIndex]))\n\t\t\tpTree[pPattern[pIndex]] = {};\n\t\t\n\t\treturn pTree[pPattern[pIndex]];\n\t}\n\t\n\t/** Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pPatternStart - The starting string for the pattern (e.g. \"${\")\n\t * @param {string} pPatternEnd - The ending string for the pattern (e.g. \"}\")\n\t * @param {number} pParser - The function to parse if this is the matched pattern, once the Pattern End is met. If this is a string, a simple replacement occurs.\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern (pPatternStart, pPatternEnd, pParser)\n\t{\n\t\tif (pPatternStart.length < 1)\n\t\t\treturn false;\n\n\t\tif ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length < 1))\n\t\t\treturn false;\n\n\t\tlet tmpLeaf = this.ParseTree;\n\n\t\t// Add the tree of leaves iteratively\n\t\tfor (var i = 0; i < pPatternStart.length; i++)\n\t\t\ttmpLeaf = this.addChild(tmpLeaf, pPatternStart, i);\n\n\t\ttmpLeaf.PatternStart = pPatternStart;\n\t\ttmpLeaf.PatternEnd = ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length > 0)) ? pPatternEnd : pPatternStart;\n\t\ttmpLeaf.Parse = (typeof(pParser) === 'function') ? pParser : \n\t\t\t\t\t\t(typeof(pParser) === 'string') ? () => { return pParser; } :\n\t\t\t\t\t\t(pData) => { return pData; };\n\n\t\treturn true;\n\t}\n}\n\nmodule.exports = WordTree;\n","// 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","/*! https://mths.be/punycode v1.4.1 by @mathias */\n;(function(root) {\n\n\t/** Detect free variables */\n\tvar freeExports = typeof exports == 'object' && exports &&\n\t\t!exports.nodeType && exports;\n\tvar freeModule = typeof module == 'object' && module &&\n\t\t!module.nodeType && module;\n\tvar freeGlobal = typeof global == 'object' && global;\n\tif (\n\t\tfreeGlobal.global === freeGlobal ||\n\t\tfreeGlobal.window === freeGlobal ||\n\t\tfreeGlobal.self === freeGlobal\n\t) {\n\t\troot = freeGlobal;\n\t}\n\n\t/**\n\t * The `punycode` object.\n\t * @name punycode\n\t * @type Object\n\t */\n\tvar punycode,\n\n\t/** Highest positive signed 32-bit float value */\n\tmaxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1\n\n\t/** Bootstring parameters */\n\tbase = 36,\n\ttMin = 1,\n\ttMax = 26,\n\tskew = 38,\n\tdamp = 700,\n\tinitialBias = 72,\n\tinitialN = 128, // 0x80\n\tdelimiter = '-', // '\\x2D'\n\n\t/** Regular expressions */\n\tregexPunycode = /^xn--/,\n\tregexNonASCII = /[^\\x20-\\x7E]/, // unprintable ASCII chars + non-ASCII chars\n\tregexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g, // RFC 3490 separators\n\n\t/** Error messages */\n\terrors = {\n\t\t'overflow': 'Overflow: input needs wider integers to process',\n\t\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t\t'invalid-input': 'Invalid input'\n\t},\n\n\t/** Convenience shortcuts */\n\tbaseMinusTMin = base - tMin,\n\tfloor = Math.floor,\n\tstringFromCharCode = String.fromCharCode,\n\n\t/** Temporary variable */\n\tkey;\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/**\n\t * A generic error utility function.\n\t * @private\n\t * @param {String} type The error type.\n\t * @returns {Error} Throws a `RangeError` with the applicable error message.\n\t */\n\tfunction error(type) {\n\t\tthrow new RangeError(errors[type]);\n\t}\n\n\t/**\n\t * A generic `Array#map` utility function.\n\t * @private\n\t * @param {Array} array The array to iterate over.\n\t * @param {Function} callback The function that gets called for every array\n\t * item.\n\t * @returns {Array} A new array of values returned by the callback function.\n\t */\n\tfunction map(array, fn) {\n\t\tvar length = array.length;\n\t\tvar result = [];\n\t\twhile (length--) {\n\t\t\tresult[length] = fn(array[length]);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * A simple `Array#map`-like wrapper to work with domain name strings or email\n\t * addresses.\n\t * @private\n\t * @param {String} domain The domain name or email address.\n\t * @param {Function} callback The function that gets called for every\n\t * character.\n\t * @returns {Array} A new string of characters returned by the callback\n\t * function.\n\t */\n\tfunction mapDomain(string, fn) {\n\t\tvar parts = string.split('@');\n\t\tvar result = '';\n\t\tif (parts.length > 1) {\n\t\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t\t// the local part (i.e. everything up to `@`) intact.\n\t\t\tresult = parts[0] + '@';\n\t\t\tstring = parts[1];\n\t\t}\n\t\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\t\tstring = string.replace(regexSeparators, '\\x2E');\n\t\tvar labels = string.split('.');\n\t\tvar encoded = map(labels, fn).join('.');\n\t\treturn result + encoded;\n\t}\n\n\t/**\n\t * Creates an array containing the numeric code points of each Unicode\n\t * character in the string. While JavaScript uses UCS-2 internally,\n\t * this function will convert a pair of surrogate halves (each of which\n\t * UCS-2 exposes as separate characters) into a single code point,\n\t * matching UTF-16.\n\t * @see `punycode.ucs2.encode`\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode.ucs2\n\t * @name decode\n\t * @param {String} string The Unicode input string (UCS-2).\n\t * @returns {Array} The new array of code points.\n\t */\n\tfunction ucs2decode(string) {\n\t\tvar output = [],\n\t\t counter = 0,\n\t\t length = string.length,\n\t\t value,\n\t\t extra;\n\t\twhile (counter < length) {\n\t\t\tvalue = string.charCodeAt(counter++);\n\t\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t\t// high surrogate, and there is a next character\n\t\t\t\textra = string.charCodeAt(counter++);\n\t\t\t\tif ((extra & 0xFC00) == 0xDC00) { // low surrogate\n\t\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t\t} else {\n\t\t\t\t\t// unmatched surrogate; only append this code unit, in case the next\n\t\t\t\t\t// code unit is the high surrogate of a surrogate pair\n\t\t\t\t\toutput.push(value);\n\t\t\t\t\tcounter--;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\toutput.push(value);\n\t\t\t}\n\t\t}\n\t\treturn output;\n\t}\n\n\t/**\n\t * Creates a string based on an array of numeric code points.\n\t * @see `punycode.ucs2.decode`\n\t * @memberOf punycode.ucs2\n\t * @name encode\n\t * @param {Array} codePoints The array of numeric code points.\n\t * @returns {String} The new Unicode string (UCS-2).\n\t */\n\tfunction ucs2encode(array) {\n\t\treturn map(array, function(value) {\n\t\t\tvar output = '';\n\t\t\tif (value > 0xFFFF) {\n\t\t\t\tvalue -= 0x10000;\n\t\t\t\toutput += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);\n\t\t\t\tvalue = 0xDC00 | value & 0x3FF;\n\t\t\t}\n\t\t\toutput += stringFromCharCode(value);\n\t\t\treturn output;\n\t\t}).join('');\n\t}\n\n\t/**\n\t * Converts a basic code point into a digit/integer.\n\t * @see `digitToBasic()`\n\t * @private\n\t * @param {Number} codePoint The basic numeric code point value.\n\t * @returns {Number} The numeric value of a basic code point (for use in\n\t * representing integers) in the range `0` to `base - 1`, or `base` if\n\t * the code point does not represent a value.\n\t */\n\tfunction basicToDigit(codePoint) {\n\t\tif (codePoint - 48 < 10) {\n\t\t\treturn codePoint - 22;\n\t\t}\n\t\tif (codePoint - 65 < 26) {\n\t\t\treturn codePoint - 65;\n\t\t}\n\t\tif (codePoint - 97 < 26) {\n\t\t\treturn codePoint - 97;\n\t\t}\n\t\treturn base;\n\t}\n\n\t/**\n\t * Converts a digit/integer into a basic code point.\n\t * @see `basicToDigit()`\n\t * @private\n\t * @param {Number} digit The numeric value of a basic code point.\n\t * @returns {Number} The basic code point whose value (when used for\n\t * representing integers) is `digit`, which needs to be in the range\n\t * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n\t * used; else, the lowercase form is used. The behavior is undefined\n\t * if `flag` is non-zero and `digit` has no uppercase form.\n\t */\n\tfunction digitToBasic(digit, flag) {\n\t\t// 0..25 map to ASCII a..z or A..Z\n\t\t// 26..35 map to ASCII 0..9\n\t\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n\t}\n\n\t/**\n\t * Bias adaptation function as per section 3.4 of RFC 3492.\n\t * https://tools.ietf.org/html/rfc3492#section-3.4\n\t * @private\n\t */\n\tfunction adapt(delta, numPoints, firstTime) {\n\t\tvar k = 0;\n\t\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\t\tdelta += floor(delta / numPoints);\n\t\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\t\tdelta = floor(delta / baseMinusTMin);\n\t\t}\n\t\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n\t}\n\n\t/**\n\t * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n\t * symbols.\n\t * @memberOf punycode\n\t * @param {String} input The Punycode string of ASCII-only symbols.\n\t * @returns {String} The resulting string of Unicode symbols.\n\t */\n\tfunction decode(input) {\n\t\t// Don't use UCS-2\n\t\tvar output = [],\n\t\t inputLength = input.length,\n\t\t out,\n\t\t i = 0,\n\t\t n = initialN,\n\t\t bias = initialBias,\n\t\t basic,\n\t\t j,\n\t\t index,\n\t\t oldi,\n\t\t w,\n\t\t k,\n\t\t digit,\n\t\t t,\n\t\t /** Cached calculation results */\n\t\t baseMinusT;\n\n\t\t// Handle the basic code points: let `basic` be the number of input code\n\t\t// points before the last delimiter, or `0` if there is none, then copy\n\t\t// the first basic code points to the output.\n\n\t\tbasic = input.lastIndexOf(delimiter);\n\t\tif (basic < 0) {\n\t\t\tbasic = 0;\n\t\t}\n\n\t\tfor (j = 0; j < basic; ++j) {\n\t\t\t// if it's not a basic code point\n\t\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\t\terror('not-basic');\n\t\t\t}\n\t\t\toutput.push(input.charCodeAt(j));\n\t\t}\n\n\t\t// Main decoding loop: start just after the last delimiter if any basic code\n\t\t// points were copied; start at the beginning otherwise.\n\n\t\tfor (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t\t// `index` is the index of the next character to be consumed.\n\t\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t\t// which gets added to `i`. The overflow checking is easier\n\t\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t\t// value at the end to obtain `delta`.\n\t\t\tfor (oldi = i, w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\t\tif (index >= inputLength) {\n\t\t\t\t\terror('invalid-input');\n\t\t\t\t}\n\n\t\t\t\tdigit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\t\tif (digit >= base || digit > floor((maxInt - i) / w)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\ti += digit * w;\n\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\t\tif (digit < t) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbaseMinusT = base - t;\n\t\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tw *= baseMinusT;\n\n\t\t\t}\n\n\t\t\tout = output.length + 1;\n\t\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t\t// incrementing `n` each time, so we'll fix that now:\n\t\t\tif (floor(i / out) > maxInt - n) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tn += floor(i / out);\n\t\t\ti %= out;\n\n\t\t\t// Insert `n` at position `i` of the output\n\t\t\toutput.splice(i++, 0, n);\n\n\t\t}\n\n\t\treturn ucs2encode(output);\n\t}\n\n\t/**\n\t * Converts a string of Unicode symbols (e.g. a domain name label) to a\n\t * Punycode string of ASCII-only symbols.\n\t * @memberOf punycode\n\t * @param {String} input The string of Unicode symbols.\n\t * @returns {String} The resulting Punycode string of ASCII-only symbols.\n\t */\n\tfunction encode(input) {\n\t\tvar n,\n\t\t delta,\n\t\t handledCPCount,\n\t\t basicLength,\n\t\t bias,\n\t\t j,\n\t\t m,\n\t\t q,\n\t\t k,\n\t\t t,\n\t\t currentValue,\n\t\t output = [],\n\t\t /** `inputLength` will hold the number of code points in `input`. */\n\t\t inputLength,\n\t\t /** Cached calculation results */\n\t\t handledCPCountPlusOne,\n\t\t baseMinusT,\n\t\t qMinusT;\n\n\t\t// Convert the input in UCS-2 to Unicode\n\t\tinput = ucs2decode(input);\n\n\t\t// Cache the length\n\t\tinputLength = input.length;\n\n\t\t// Initialize the state\n\t\tn = initialN;\n\t\tdelta = 0;\n\t\tbias = initialBias;\n\n\t\t// Handle the basic code points\n\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\tcurrentValue = input[j];\n\t\t\tif (currentValue < 0x80) {\n\t\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t\t}\n\t\t}\n\n\t\thandledCPCount = basicLength = output.length;\n\n\t\t// `handledCPCount` is the number of code points that have been handled;\n\t\t// `basicLength` is the number of basic code points.\n\n\t\t// Finish the basic string - if it is not empty - with a delimiter\n\t\tif (basicLength) {\n\t\t\toutput.push(delimiter);\n\t\t}\n\n\t\t// Main encoding loop:\n\t\twhile (handledCPCount < inputLength) {\n\n\t\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t\t// larger one:\n\t\t\tfor (m = maxInt, j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\t\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\t\tm = currentValue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t\t// but guard against overflow\n\t\t\thandledCPCountPlusOne = handledCPCount + 1;\n\t\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\t\tn = m;\n\n\t\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\n\t\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tif (currentValue == n) {\n\t\t\t\t\t// Represent delta as a generalized variable-length integer\n\t\t\t\t\tfor (q = delta, k = base; /* no condition */; k += base) {\n\t\t\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tqMinusT = q - t;\n\t\t\t\t\t\tbaseMinusT = base - t;\n\t\t\t\t\t\toutput.push(\n\t\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t\t);\n\t\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t\t}\n\n\t\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);\n\t\t\t\t\tdelta = 0;\n\t\t\t\t\t++handledCPCount;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t++delta;\n\t\t\t++n;\n\n\t\t}\n\t\treturn output.join('');\n\t}\n\n\t/**\n\t * Converts a Punycode string representing a domain name or an email address\n\t * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n\t * it doesn't matter if you call it on a string that has already been\n\t * converted to Unicode.\n\t * @memberOf punycode\n\t * @param {String} input The Punycoded domain name or email address to\n\t * convert to Unicode.\n\t * @returns {String} The Unicode representation of the given Punycode\n\t * string.\n\t */\n\tfunction toUnicode(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexPunycode.test(string)\n\t\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/**\n\t * Converts a Unicode string representing a domain name or an email address to\n\t * Punycode. Only the non-ASCII parts of the domain name will be converted,\n\t * i.e. it doesn't matter if you call it with a domain that's already in\n\t * ASCII.\n\t * @memberOf punycode\n\t * @param {String} input The domain name or email address to convert, as a\n\t * Unicode string.\n\t * @returns {String} The Punycode representation of the given domain name or\n\t * email address.\n\t */\n\tfunction toASCII(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexNonASCII.test(string)\n\t\t\t\t? 'xn--' + encode(string)\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/** Define the public API */\n\tpunycode = {\n\t\t/**\n\t\t * A string representing the current Punycode.js version number.\n\t\t * @memberOf punycode\n\t\t * @type String\n\t\t */\n\t\t'version': '1.4.1',\n\t\t/**\n\t\t * An object of methods to convert from JavaScript's internal character\n\t\t * representation (UCS-2) to Unicode code points, and back.\n\t\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t\t * @memberOf punycode\n\t\t * @type Object\n\t\t */\n\t\t'ucs2': {\n\t\t\t'decode': ucs2decode,\n\t\t\t'encode': ucs2encode\n\t\t},\n\t\t'decode': decode,\n\t\t'encode': encode,\n\t\t'toASCII': toASCII,\n\t\t'toUnicode': toUnicode\n\t};\n\n\t/** Expose `punycode` */\n\t// Some AMD build optimizers, like r.js, check for specific condition patterns\n\t// like the following:\n\tif (\n\t\ttypeof define == 'function' &&\n\t\ttypeof define.amd == 'object' &&\n\t\tdefine.amd\n\t) {\n\t\tdefine('punycode', function() {\n\t\t\treturn punycode;\n\t\t});\n\t} else if (freeExports && freeModule) {\n\t\tif (module.exports == freeExports) {\n\t\t\t// in Node.js, io.js, or RingoJS v0.8.0+\n\t\t\tfreeModule.exports = punycode;\n\t\t} else {\n\t\t\t// in Narwhal or RingoJS v0.7.0-\n\t\t\tfor (key in punycode) {\n\t\t\t\tpunycode.hasOwnProperty(key) && (freeExports[key] = punycode[key]);\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// in Rhino or a web browser\n\t\troot.punycode = punycode;\n\t}\n\n}(this));\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\n'use strict';\n\n// If obj.hasOwnProperty has been overridden, then calling\n// obj.hasOwnProperty(prop) will break.\n// See: https://github.com/joyent/node/issues/1707\nfunction hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nmodule.exports = function(qs, sep, eq, options) {\n sep = sep || '&';\n eq = eq || '=';\n var obj = {};\n\n if (typeof qs !== 'string' || qs.length === 0) {\n return obj;\n }\n\n var regexp = /\\+/g;\n qs = qs.split(sep);\n\n var maxKeys = 1000;\n if (options && typeof options.maxKeys === 'number') {\n maxKeys = options.maxKeys;\n }\n\n var len = qs.length;\n // maxKeys <= 0 means that we should not limit keys count\n if (maxKeys > 0 && len > maxKeys) {\n len = maxKeys;\n }\n\n for (var i = 0; i < len; ++i) {\n var x = qs[i].replace(regexp, '%20'),\n idx = x.indexOf(eq),\n kstr, vstr, k, v;\n\n if (idx >= 0) {\n kstr = x.substr(0, idx);\n vstr = x.substr(idx + 1);\n } else {\n kstr = x;\n vstr = '';\n }\n\n k = decodeURIComponent(kstr);\n v = decodeURIComponent(vstr);\n\n if (!hasOwnProperty(obj, k)) {\n obj[k] = v;\n } else if (isArray(obj[k])) {\n obj[k].push(v);\n } else {\n obj[k] = [obj[k], v];\n }\n }\n\n return obj;\n};\n\nvar isArray = Array.isArray || function (xs) {\n return Object.prototype.toString.call(xs) === '[object Array]';\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\n'use strict';\n\nvar stringifyPrimitive = function(v) {\n switch (typeof v) {\n case 'string':\n return v;\n\n case 'boolean':\n return v ? 'true' : 'false';\n\n case 'number':\n return isFinite(v) ? v : '';\n\n default:\n return '';\n }\n};\n\nmodule.exports = function(obj, sep, eq, name) {\n sep = sep || '&';\n eq = eq || '=';\n if (obj === null) {\n obj = undefined;\n }\n\n if (typeof obj === 'object') {\n return map(objectKeys(obj), function(k) {\n var ks = encodeURIComponent(stringifyPrimitive(k)) + eq;\n if (isArray(obj[k])) {\n return map(obj[k], function(v) {\n return ks + encodeURIComponent(stringifyPrimitive(v));\n }).join(sep);\n } else {\n return ks + encodeURIComponent(stringifyPrimitive(obj[k]));\n }\n }).join(sep);\n\n }\n\n if (!name) return '';\n return encodeURIComponent(stringifyPrimitive(name)) + eq +\n encodeURIComponent(stringifyPrimitive(obj));\n};\n\nvar isArray = Array.isArray || function (xs) {\n return Object.prototype.toString.call(xs) === '[object Array]';\n};\n\nfunction map (xs, f) {\n if (xs.map) return xs.map(f);\n var res = [];\n for (var i = 0; i < xs.length; i++) {\n res.push(f(xs[i], i));\n }\n return res;\n}\n\nvar objectKeys = Object.keys || function (obj) {\n var res = [];\n for (var key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) res.push(key);\n }\n return res;\n};\n","'use strict';\n\nexports.decode = exports.parse = require('./decode');\nexports.encode = exports.stringify = require('./encode');\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","/*! simple-concat. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nmodule.exports = function (stream, cb) {\n var chunks = []\n stream.on('data', function (chunk) {\n chunks.push(chunk)\n })\n stream.once('end', function () {\n if (cb) cb(null, Buffer.concat(chunks))\n cb = null\n })\n stream.once('error', function (err) {\n if (cb) cb(err)\n cb = null\n })\n}\n","/*! simple-get. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nmodule.exports = simpleGet\n\nconst concat = require('simple-concat')\nconst decompressResponse = require('decompress-response') // excluded from browser build\nconst http = require('http')\nconst https = require('https')\nconst once = require('once')\nconst querystring = require('querystring')\nconst url = require('url')\n\nconst isStream = o => o !== null && typeof o === 'object' && typeof o.pipe === 'function'\n\nfunction simpleGet (opts, cb) {\n opts = Object.assign({ maxRedirects: 10 }, typeof opts === 'string' ? { url: opts } : opts)\n cb = once(cb)\n\n if (opts.url) {\n const { hostname, port, protocol, auth, path } = url.parse(opts.url) // eslint-disable-line node/no-deprecated-api\n delete opts.url\n if (!hostname && !port && !protocol && !auth) opts.path = path // Relative redirect\n else Object.assign(opts, { hostname, port, protocol, auth, path }) // Absolute redirect\n }\n\n const headers = { 'accept-encoding': 'gzip, deflate' }\n if (opts.headers) Object.keys(opts.headers).forEach(k => (headers[k.toLowerCase()] = opts.headers[k]))\n opts.headers = headers\n\n let body\n if (opts.body) {\n body = opts.json && !isStream(opts.body) ? JSON.stringify(opts.body) : opts.body\n } else if (opts.form) {\n body = typeof opts.form === 'string' ? opts.form : querystring.stringify(opts.form)\n opts.headers['content-type'] = 'application/x-www-form-urlencoded'\n }\n\n if (body) {\n if (!opts.method) opts.method = 'POST'\n if (!isStream(body)) opts.headers['content-length'] = Buffer.byteLength(body)\n if (opts.json && !opts.form) opts.headers['content-type'] = 'application/json'\n }\n delete opts.body; delete opts.form\n\n if (opts.json) opts.headers.accept = 'application/json'\n if (opts.method) opts.method = opts.method.toUpperCase()\n\n const originalHost = opts.hostname // hostname before potential redirect\n const protocol = opts.protocol === 'https:' ? https : http // Support http/https urls\n const req = protocol.request(opts, res => {\n if (opts.followRedirects !== false && res.statusCode >= 300 && res.statusCode < 400 && res.headers.location) {\n opts.url = res.headers.location // Follow 3xx redirects\n delete opts.headers.host // Discard `host` header on redirect (see #32)\n res.resume() // Discard response\n\n const redirectHost = url.parse(opts.url).hostname // eslint-disable-line node/no-deprecated-api\n // If redirected host is different than original host, drop headers to prevent cookie leak (#73)\n if (redirectHost !== null && redirectHost !== originalHost) {\n delete opts.headers.cookie\n delete opts.headers.authorization\n }\n\n if (opts.method === 'POST' && [301, 302].includes(res.statusCode)) {\n opts.method = 'GET' // On 301/302 redirect, change POST to GET (see #35)\n delete opts.headers['content-length']; delete opts.headers['content-type']\n }\n\n if (opts.maxRedirects-- === 0) return cb(new Error('too many redirects'))\n else return simpleGet(opts, cb)\n }\n\n const tryUnzip = typeof decompressResponse === 'function' && opts.method !== 'HEAD'\n cb(null, tryUnzip ? decompressResponse(res) : res)\n })\n req.on('timeout', () => {\n req.abort()\n cb(new Error('Request timed out'))\n })\n req.on('error', cb)\n\n if (isStream(body)) body.on('error', cb).pipe(req)\n else req.end(body)\n\n return req\n}\n\nsimpleGet.concat = (opts, cb) => {\n return simpleGet(opts, (err, res) => {\n if (err) return cb(err)\n concat(res, (err, data) => {\n if (err) return cb(err)\n if (opts.json) {\n try {\n data = JSON.parse(data.toString())\n } catch (err) {\n return cb(err, res, data)\n }\n }\n cb(null, res, data)\n })\n })\n}\n\n;['get', 'post', 'put', 'patch', 'head', 'delete'].forEach(method => {\n simpleGet[method] = (opts, cb) => {\n if (typeof opts === 'string') opts = { url: opts }\n return simpleGet(Object.assign({ method: method.toUpperCase() }, opts), cb)\n }\n})\n","var ClientRequest = require('./lib/request')\nvar response = require('./lib/response')\nvar extend = require('xtend')\nvar statusCodes = require('builtin-status-codes')\nvar url = require('url')\n\nvar http = exports\n\nhttp.request = function (opts, cb) {\n\tif (typeof opts === 'string')\n\t\topts = url.parse(opts)\n\telse\n\t\topts = extend(opts)\n\n\t// Normally, the page is loaded from http or https, so not specifying a protocol\n\t// will result in a (valid) protocol-relative url. However, this won't work if\n\t// the protocol is something else, like 'file:'\n\tvar defaultProtocol = global.location.protocol.search(/^https?:$/) === -1 ? 'http:' : ''\n\n\tvar protocol = opts.protocol || defaultProtocol\n\tvar host = opts.hostname || opts.host\n\tvar port = opts.port\n\tvar path = opts.path || '/'\n\n\t// Necessary for IPv6 addresses\n\tif (host && host.indexOf(':') !== -1)\n\t\thost = '[' + host + ']'\n\n\t// This may be a relative url. The browser should always be able to interpret it correctly.\n\topts.url = (host ? (protocol + '//' + host) : '') + (port ? ':' + port : '') + path\n\topts.method = (opts.method || 'GET').toUpperCase()\n\topts.headers = opts.headers || {}\n\n\t// Also valid opts.auth, opts.mode\n\n\tvar req = new ClientRequest(opts)\n\tif (cb)\n\t\treq.on('response', cb)\n\treturn req\n}\n\nhttp.get = function get (opts, cb) {\n\tvar req = http.request(opts, cb)\n\treq.end()\n\treturn req\n}\n\nhttp.ClientRequest = ClientRequest\nhttp.IncomingMessage = response.IncomingMessage\n\nhttp.Agent = function () {}\nhttp.Agent.defaultMaxSockets = 4\n\nhttp.globalAgent = new http.Agent()\n\nhttp.STATUS_CODES = statusCodes\n\nhttp.METHODS = [\n\t'CHECKOUT',\n\t'CONNECT',\n\t'COPY',\n\t'DELETE',\n\t'GET',\n\t'HEAD',\n\t'LOCK',\n\t'M-SEARCH',\n\t'MERGE',\n\t'MKACTIVITY',\n\t'MKCOL',\n\t'MOVE',\n\t'NOTIFY',\n\t'OPTIONS',\n\t'PATCH',\n\t'POST',\n\t'PROPFIND',\n\t'PROPPATCH',\n\t'PURGE',\n\t'PUT',\n\t'REPORT',\n\t'SEARCH',\n\t'SUBSCRIBE',\n\t'TRACE',\n\t'UNLOCK',\n\t'UNSUBSCRIBE'\n]","exports.fetch = isFunction(global.fetch) && isFunction(global.ReadableStream)\n\nexports.writableStream = isFunction(global.WritableStream)\n\nexports.abortController = isFunction(global.AbortController)\n\n// The xhr request to example.com may violate some restrictive CSP configurations,\n// so if we're running in a browser that supports `fetch`, avoid calling getXHR()\n// and assume support for certain features below.\nvar xhr\nfunction getXHR () {\n\t// Cache the xhr value\n\tif (xhr !== undefined) return xhr\n\n\tif (global.XMLHttpRequest) {\n\t\txhr = new global.XMLHttpRequest()\n\t\t// If XDomainRequest is available (ie only, where xhr might not work\n\t\t// cross domain), use the page location. Otherwise use example.com\n\t\t// Note: this doesn't actually make an http request.\n\t\ttry {\n\t\t\txhr.open('GET', global.XDomainRequest ? '/' : 'https://example.com')\n\t\t} catch(e) {\n\t\t\txhr = null\n\t\t}\n\t} else {\n\t\t// Service workers don't have XHR\n\t\txhr = null\n\t}\n\treturn xhr\n}\n\nfunction checkTypeSupport (type) {\n\tvar xhr = getXHR()\n\tif (!xhr) return false\n\ttry {\n\t\txhr.responseType = type\n\t\treturn xhr.responseType === type\n\t} catch (e) {}\n\treturn false\n}\n\n// If fetch is supported, then arraybuffer will be supported too. Skip calling\n// checkTypeSupport(), since that calls getXHR().\nexports.arraybuffer = exports.fetch || checkTypeSupport('arraybuffer')\n\n// These next two tests unavoidably show warnings in Chrome. Since fetch will always\n// be used if it's available, just return false for these to avoid the warnings.\nexports.msstream = !exports.fetch && checkTypeSupport('ms-stream')\nexports.mozchunkedarraybuffer = !exports.fetch && checkTypeSupport('moz-chunked-arraybuffer')\n\n// If fetch is supported, then overrideMimeType will be supported too. Skip calling\n// getXHR().\nexports.overrideMimeType = exports.fetch || (getXHR() ? isFunction(getXHR().overrideMimeType) : false)\n\nfunction isFunction (value) {\n\treturn typeof value === 'function'\n}\n\nxhr = null // Help gc\n","var capability = require('./capability')\nvar inherits = require('inherits')\nvar response = require('./response')\nvar stream = require('readable-stream')\n\nvar IncomingMessage = response.IncomingMessage\nvar rStates = response.readyStates\n\nfunction decideMode (preferBinary, useFetch) {\n\tif (capability.fetch && useFetch) {\n\t\treturn 'fetch'\n\t} else if (capability.mozchunkedarraybuffer) {\n\t\treturn 'moz-chunked-arraybuffer'\n\t} else if (capability.msstream) {\n\t\treturn 'ms-stream'\n\t} else if (capability.arraybuffer && preferBinary) {\n\t\treturn 'arraybuffer'\n\t} else {\n\t\treturn 'text'\n\t}\n}\n\nvar ClientRequest = module.exports = function (opts) {\n\tvar self = this\n\tstream.Writable.call(self)\n\n\tself._opts = opts\n\tself._body = []\n\tself._headers = {}\n\tif (opts.auth)\n\t\tself.setHeader('Authorization', 'Basic ' + Buffer.from(opts.auth).toString('base64'))\n\tObject.keys(opts.headers).forEach(function (name) {\n\t\tself.setHeader(name, opts.headers[name])\n\t})\n\n\tvar preferBinary\n\tvar useFetch = true\n\tif (opts.mode === 'disable-fetch' || ('requestTimeout' in opts && !capability.abortController)) {\n\t\t// If the use of XHR should be preferred. Not typically needed.\n\t\tuseFetch = false\n\t\tpreferBinary = true\n\t} else if (opts.mode === 'prefer-streaming') {\n\t\t// If streaming is a high priority but binary compatibility and\n\t\t// the accuracy of the 'content-type' header aren't\n\t\tpreferBinary = false\n\t} else if (opts.mode === 'allow-wrong-content-type') {\n\t\t// If streaming is more important than preserving the 'content-type' header\n\t\tpreferBinary = !capability.overrideMimeType\n\t} else if (!opts.mode || opts.mode === 'default' || opts.mode === 'prefer-fast') {\n\t\t// Use binary if text streaming may corrupt data or the content-type header, or for speed\n\t\tpreferBinary = true\n\t} else {\n\t\tthrow new Error('Invalid value for opts.mode')\n\t}\n\tself._mode = decideMode(preferBinary, useFetch)\n\tself._fetchTimer = null\n\tself._socketTimeout = null\n\tself._socketTimer = null\n\n\tself.on('finish', function () {\n\t\tself._onFinish()\n\t})\n}\n\ninherits(ClientRequest, stream.Writable)\n\nClientRequest.prototype.setHeader = function (name, value) {\n\tvar self = this\n\tvar lowerName = name.toLowerCase()\n\t// This check is not necessary, but it prevents warnings from browsers about setting unsafe\n\t// headers. To be honest I'm not entirely sure hiding these warnings is a good thing, but\n\t// http-browserify did it, so I will too.\n\tif (unsafeHeaders.indexOf(lowerName) !== -1)\n\t\treturn\n\n\tself._headers[lowerName] = {\n\t\tname: name,\n\t\tvalue: value\n\t}\n}\n\nClientRequest.prototype.getHeader = function (name) {\n\tvar header = this._headers[name.toLowerCase()]\n\tif (header)\n\t\treturn header.value\n\treturn null\n}\n\nClientRequest.prototype.removeHeader = function (name) {\n\tvar self = this\n\tdelete self._headers[name.toLowerCase()]\n}\n\nClientRequest.prototype._onFinish = function () {\n\tvar self = this\n\n\tif (self._destroyed)\n\t\treturn\n\tvar opts = self._opts\n\n\tif ('timeout' in opts && opts.timeout !== 0) {\n\t\tself.setTimeout(opts.timeout)\n\t}\n\n\tvar headersObj = self._headers\n\tvar body = null\n\tif (opts.method !== 'GET' && opts.method !== 'HEAD') {\n body = new Blob(self._body, {\n type: (headersObj['content-type'] || {}).value || ''\n });\n }\n\n\t// create flattened list of headers\n\tvar headersList = []\n\tObject.keys(headersObj).forEach(function (keyName) {\n\t\tvar name = headersObj[keyName].name\n\t\tvar value = headersObj[keyName].value\n\t\tif (Array.isArray(value)) {\n\t\t\tvalue.forEach(function (v) {\n\t\t\t\theadersList.push([name, v])\n\t\t\t})\n\t\t} else {\n\t\t\theadersList.push([name, value])\n\t\t}\n\t})\n\n\tif (self._mode === 'fetch') {\n\t\tvar signal = null\n\t\tif (capability.abortController) {\n\t\t\tvar controller = new AbortController()\n\t\t\tsignal = controller.signal\n\t\t\tself._fetchAbortController = controller\n\n\t\t\tif ('requestTimeout' in opts && opts.requestTimeout !== 0) {\n\t\t\t\tself._fetchTimer = global.setTimeout(function () {\n\t\t\t\t\tself.emit('requestTimeout')\n\t\t\t\t\tif (self._fetchAbortController)\n\t\t\t\t\t\tself._fetchAbortController.abort()\n\t\t\t\t}, opts.requestTimeout)\n\t\t\t}\n\t\t}\n\n\t\tglobal.fetch(self._opts.url, {\n\t\t\tmethod: self._opts.method,\n\t\t\theaders: headersList,\n\t\t\tbody: body || undefined,\n\t\t\tmode: 'cors',\n\t\t\tcredentials: opts.withCredentials ? 'include' : 'same-origin',\n\t\t\tsignal: signal\n\t\t}).then(function (response) {\n\t\t\tself._fetchResponse = response\n\t\t\tself._resetTimers(false)\n\t\t\tself._connect()\n\t\t}, function (reason) {\n\t\t\tself._resetTimers(true)\n\t\t\tif (!self._destroyed)\n\t\t\t\tself.emit('error', reason)\n\t\t})\n\t} else {\n\t\tvar xhr = self._xhr = new global.XMLHttpRequest()\n\t\ttry {\n\t\t\txhr.open(self._opts.method, self._opts.url, true)\n\t\t} catch (err) {\n\t\t\tprocess.nextTick(function () {\n\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t\treturn\n\t\t}\n\n\t\t// Can't set responseType on really old browsers\n\t\tif ('responseType' in xhr)\n\t\t\txhr.responseType = self._mode\n\n\t\tif ('withCredentials' in xhr)\n\t\t\txhr.withCredentials = !!opts.withCredentials\n\n\t\tif (self._mode === 'text' && 'overrideMimeType' in xhr)\n\t\t\txhr.overrideMimeType('text/plain; charset=x-user-defined')\n\n\t\tif ('requestTimeout' in opts) {\n\t\t\txhr.timeout = opts.requestTimeout\n\t\t\txhr.ontimeout = function () {\n\t\t\t\tself.emit('requestTimeout')\n\t\t\t}\n\t\t}\n\n\t\theadersList.forEach(function (header) {\n\t\t\txhr.setRequestHeader(header[0], header[1])\n\t\t})\n\n\t\tself._response = null\n\t\txhr.onreadystatechange = function () {\n\t\t\tswitch (xhr.readyState) {\n\t\t\t\tcase rStates.LOADING:\n\t\t\t\tcase rStates.DONE:\n\t\t\t\t\tself._onXHRProgress()\n\t\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\t// Necessary for streaming in Firefox, since xhr.response is ONLY defined\n\t\t// in onprogress, not in onreadystatechange with xhr.readyState = 3\n\t\tif (self._mode === 'moz-chunked-arraybuffer') {\n\t\t\txhr.onprogress = function () {\n\t\t\t\tself._onXHRProgress()\n\t\t\t}\n\t\t}\n\n\t\txhr.onerror = function () {\n\t\t\tif (self._destroyed)\n\t\t\t\treturn\n\t\t\tself._resetTimers(true)\n\t\t\tself.emit('error', new Error('XHR error'))\n\t\t}\n\n\t\ttry {\n\t\t\txhr.send(body)\n\t\t} catch (err) {\n\t\t\tprocess.nextTick(function () {\n\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t\treturn\n\t\t}\n\t}\n}\n\n/**\n * Checks if xhr.status is readable and non-zero, indicating no error.\n * Even though the spec says it should be available in readyState 3,\n * accessing it throws an exception in IE8\n */\nfunction statusValid (xhr) {\n\ttry {\n\t\tvar status = xhr.status\n\t\treturn (status !== null && status !== 0)\n\t} catch (e) {\n\t\treturn false\n\t}\n}\n\nClientRequest.prototype._onXHRProgress = function () {\n\tvar self = this\n\n\tself._resetTimers(false)\n\n\tif (!statusValid(self._xhr) || self._destroyed)\n\t\treturn\n\n\tif (!self._response)\n\t\tself._connect()\n\n\tself._response._onXHRProgress(self._resetTimers.bind(self))\n}\n\nClientRequest.prototype._connect = function () {\n\tvar self = this\n\n\tif (self._destroyed)\n\t\treturn\n\n\tself._response = new IncomingMessage(self._xhr, self._fetchResponse, self._mode, self._resetTimers.bind(self))\n\tself._response.on('error', function(err) {\n\t\tself.emit('error', err)\n\t})\n\n\tself.emit('response', self._response)\n}\n\nClientRequest.prototype._write = function (chunk, encoding, cb) {\n\tvar self = this\n\n\tself._body.push(chunk)\n\tcb()\n}\n\nClientRequest.prototype._resetTimers = function (done) {\n\tvar self = this\n\n\tglobal.clearTimeout(self._socketTimer)\n\tself._socketTimer = null\n\n\tif (done) {\n\t\tglobal.clearTimeout(self._fetchTimer)\n\t\tself._fetchTimer = null\n\t} else if (self._socketTimeout) {\n\t\tself._socketTimer = global.setTimeout(function () {\n\t\t\tself.emit('timeout')\n\t\t}, self._socketTimeout)\n\t}\n}\n\nClientRequest.prototype.abort = ClientRequest.prototype.destroy = function (err) {\n\tvar self = this\n\tself._destroyed = true\n\tself._resetTimers(true)\n\tif (self._response)\n\t\tself._response._destroyed = true\n\tif (self._xhr)\n\t\tself._xhr.abort()\n\telse if (self._fetchAbortController)\n\t\tself._fetchAbortController.abort()\n\n\tif (err)\n\t\tself.emit('error', err)\n}\n\nClientRequest.prototype.end = function (data, encoding, cb) {\n\tvar self = this\n\tif (typeof data === 'function') {\n\t\tcb = data\n\t\tdata = undefined\n\t}\n\n\tstream.Writable.prototype.end.call(self, data, encoding, cb)\n}\n\nClientRequest.prototype.setTimeout = function (timeout, cb) {\n\tvar self = this\n\n\tif (cb)\n\t\tself.once('timeout', cb)\n\n\tself._socketTimeout = timeout\n\tself._resetTimers(false)\n}\n\nClientRequest.prototype.flushHeaders = function () {}\nClientRequest.prototype.setNoDelay = function () {}\nClientRequest.prototype.setSocketKeepAlive = function () {}\n\n// Taken from http://www.w3.org/TR/XMLHttpRequest/#the-setrequestheader%28%29-method\nvar unsafeHeaders = [\n\t'accept-charset',\n\t'accept-encoding',\n\t'access-control-request-headers',\n\t'access-control-request-method',\n\t'connection',\n\t'content-length',\n\t'cookie',\n\t'cookie2',\n\t'date',\n\t'dnt',\n\t'expect',\n\t'host',\n\t'keep-alive',\n\t'origin',\n\t'referer',\n\t'te',\n\t'trailer',\n\t'transfer-encoding',\n\t'upgrade',\n\t'via'\n]\n","var capability = require('./capability')\nvar inherits = require('inherits')\nvar stream = require('readable-stream')\n\nvar rStates = exports.readyStates = {\n\tUNSENT: 0,\n\tOPENED: 1,\n\tHEADERS_RECEIVED: 2,\n\tLOADING: 3,\n\tDONE: 4\n}\n\nvar IncomingMessage = exports.IncomingMessage = function (xhr, response, mode, resetTimers) {\n\tvar self = this\n\tstream.Readable.call(self)\n\n\tself._mode = mode\n\tself.headers = {}\n\tself.rawHeaders = []\n\tself.trailers = {}\n\tself.rawTrailers = []\n\n\t// Fake the 'close' event, but only once 'end' fires\n\tself.on('end', function () {\n\t\t// The nextTick is necessary to prevent the 'request' module from causing an infinite loop\n\t\tprocess.nextTick(function () {\n\t\t\tself.emit('close')\n\t\t})\n\t})\n\n\tif (mode === 'fetch') {\n\t\tself._fetchResponse = response\n\n\t\tself.url = response.url\n\t\tself.statusCode = response.status\n\t\tself.statusMessage = response.statusText\n\t\t\n\t\tresponse.headers.forEach(function (header, key){\n\t\t\tself.headers[key.toLowerCase()] = header\n\t\t\tself.rawHeaders.push(key, header)\n\t\t})\n\n\t\tif (capability.writableStream) {\n\t\t\tvar writable = new WritableStream({\n\t\t\t\twrite: function (chunk) {\n\t\t\t\t\tresetTimers(false)\n\t\t\t\t\treturn new Promise(function (resolve, reject) {\n\t\t\t\t\t\tif (self._destroyed) {\n\t\t\t\t\t\t\treject()\n\t\t\t\t\t\t} else if(self.push(Buffer.from(chunk))) {\n\t\t\t\t\t\t\tresolve()\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tself._resumeFetch = resolve\n\t\t\t\t\t\t}\n\t\t\t\t\t})\n\t\t\t\t},\n\t\t\t\tclose: function () {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.push(null)\n\t\t\t\t},\n\t\t\t\tabort: function (err) {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.emit('error', err)\n\t\t\t\t}\n\t\t\t})\n\n\t\t\ttry {\n\t\t\t\tresponse.body.pipeTo(writable).catch(function (err) {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.emit('error', err)\n\t\t\t\t})\n\t\t\t\treturn\n\t\t\t} catch (e) {} // pipeTo method isn't defined. Can't find a better way to feature test this\n\t\t}\n\t\t// fallback for when writableStream or pipeTo aren't available\n\t\tvar reader = response.body.getReader()\n\t\tfunction read () {\n\t\t\treader.read().then(function (result) {\n\t\t\t\tif (self._destroyed)\n\t\t\t\t\treturn\n\t\t\t\tresetTimers(result.done)\n\t\t\t\tif (result.done) {\n\t\t\t\t\tself.push(null)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tself.push(Buffer.from(result.value))\n\t\t\t\tread()\n\t\t\t}).catch(function (err) {\n\t\t\t\tresetTimers(true)\n\t\t\t\tif (!self._destroyed)\n\t\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t}\n\t\tread()\n\t} else {\n\t\tself._xhr = xhr\n\t\tself._pos = 0\n\n\t\tself.url = xhr.responseURL\n\t\tself.statusCode = xhr.status\n\t\tself.statusMessage = xhr.statusText\n\t\tvar headers = xhr.getAllResponseHeaders().split(/\\r?\\n/)\n\t\theaders.forEach(function (header) {\n\t\t\tvar matches = header.match(/^([^:]+):\\s*(.*)/)\n\t\t\tif (matches) {\n\t\t\t\tvar key = matches[1].toLowerCase()\n\t\t\t\tif (key === 'set-cookie') {\n\t\t\t\t\tif (self.headers[key] === undefined) {\n\t\t\t\t\t\tself.headers[key] = []\n\t\t\t\t\t}\n\t\t\t\t\tself.headers[key].push(matches[2])\n\t\t\t\t} else if (self.headers[key] !== undefined) {\n\t\t\t\t\tself.headers[key] += ', ' + matches[2]\n\t\t\t\t} else {\n\t\t\t\t\tself.headers[key] = matches[2]\n\t\t\t\t}\n\t\t\t\tself.rawHeaders.push(matches[1], matches[2])\n\t\t\t}\n\t\t})\n\n\t\tself._charset = 'x-user-defined'\n\t\tif (!capability.overrideMimeType) {\n\t\t\tvar mimeType = self.rawHeaders['mime-type']\n\t\t\tif (mimeType) {\n\t\t\t\tvar charsetMatch = mimeType.match(/;\\s*charset=([^;])(;|$)/)\n\t\t\t\tif (charsetMatch) {\n\t\t\t\t\tself._charset = charsetMatch[1].toLowerCase()\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!self._charset)\n\t\t\t\tself._charset = 'utf-8' // best guess\n\t\t}\n\t}\n}\n\ninherits(IncomingMessage, stream.Readable)\n\nIncomingMessage.prototype._read = function () {\n\tvar self = this\n\n\tvar resolve = self._resumeFetch\n\tif (resolve) {\n\t\tself._resumeFetch = null\n\t\tresolve()\n\t}\n}\n\nIncomingMessage.prototype._onXHRProgress = function (resetTimers) {\n\tvar self = this\n\n\tvar xhr = self._xhr\n\n\tvar response = null\n\tswitch (self._mode) {\n\t\tcase 'text':\n\t\t\tresponse = xhr.responseText\n\t\t\tif (response.length > self._pos) {\n\t\t\t\tvar newData = response.substr(self._pos)\n\t\t\t\tif (self._charset === 'x-user-defined') {\n\t\t\t\t\tvar buffer = Buffer.alloc(newData.length)\n\t\t\t\t\tfor (var i = 0; i < newData.length; i++)\n\t\t\t\t\t\tbuffer[i] = newData.charCodeAt(i) & 0xff\n\n\t\t\t\t\tself.push(buffer)\n\t\t\t\t} else {\n\t\t\t\t\tself.push(newData, self._charset)\n\t\t\t\t}\n\t\t\t\tself._pos = response.length\n\t\t\t}\n\t\t\tbreak\n\t\tcase 'arraybuffer':\n\t\t\tif (xhr.readyState !== rStates.DONE || !xhr.response)\n\t\t\t\tbreak\n\t\t\tresponse = xhr.response\n\t\t\tself.push(Buffer.from(new Uint8Array(response)))\n\t\t\tbreak\n\t\tcase 'moz-chunked-arraybuffer': // take whole\n\t\t\tresponse = xhr.response\n\t\t\tif (xhr.readyState !== rStates.LOADING || !response)\n\t\t\t\tbreak\n\t\t\tself.push(Buffer.from(new Uint8Array(response)))\n\t\t\tbreak\n\t\tcase 'ms-stream':\n\t\t\tresponse = xhr.response\n\t\t\tif (xhr.readyState !== rStates.LOADING)\n\t\t\t\tbreak\n\t\t\tvar reader = new global.MSStreamReader()\n\t\t\treader.onprogress = function () {\n\t\t\t\tif (reader.result.byteLength > self._pos) {\n\t\t\t\t\tself.push(Buffer.from(new Uint8Array(reader.result.slice(self._pos))))\n\t\t\t\t\tself._pos = reader.result.byteLength\n\t\t\t\t}\n\t\t\t}\n\t\t\treader.onload = function () {\n\t\t\t\tresetTimers(true)\n\t\t\t\tself.push(null)\n\t\t\t}\n\t\t\t// reader.onerror = ??? // TODO: this\n\t\t\treader.readAsArrayBuffer(response)\n\t\t\tbreak\n\t}\n\n\t// The ms-stream case handles end separately in reader.onload()\n\tif (self._xhr.readyState === rStates.DONE && self._mode !== 'ms-stream') {\n\t\tresetTimers(true)\n\t\tself.push(null)\n\t}\n}\n","'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inheritsLoose(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n }\n\n return NodeError;\n }(Base);\n\n NodeError.prototype.name = Base.name;\n NodeError.prototype.code = code;\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n // determiner: 'must be' or 'must not be'\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n }\n\n msg += \". Received type \".concat(typeof actual);\n return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\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\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n\n'use strict';\n\n/*<replacement>*/\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n for (var key in obj) keys.push(key);\n return keys;\n};\n/*</replacement>*/\n\nmodule.exports = Duplex;\nvar Readable = require('./_stream_readable');\nvar Writable = require('./_stream_writable');\nrequire('inherits')(Duplex, Readable);\n{\n // Allow the keys array to be GC'ed.\n var keys = objectKeys(Writable.prototype);\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n Readable.call(this, options);\n Writable.call(this, options);\n this.allowHalfOpen = true;\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\n}\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\n\n// the no-half-open enforcer\nfunction onend() {\n // If the writable side ended, then we're ok.\n if (this._writableState.ended) return;\n\n // no more data can be written.\n // But allow more writes to happen in this tick.\n process.nextTick(onEndNT, this);\n}\nfunction onEndNT(self) {\n self.end();\n}\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\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\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n\n'use strict';\n\nmodule.exports = PassThrough;\nvar Transform = require('./_stream_transform');\nrequire('inherits')(PassThrough, Transform);\nfunction PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n Transform.call(this, options);\n}\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n cb(null, chunk);\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\n'use strict';\n\nmodule.exports = Readable;\n\n/*<replacement>*/\nvar Duplex;\n/*</replacement>*/\n\nReadable.ReadableState = ReadableState;\n\n/*<replacement>*/\nvar EE = require('events').EventEmitter;\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n return emitter.listeners(type).length;\n};\n/*</replacement>*/\n\n/*<replacement>*/\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\n/*<replacement>*/\nvar debugUtil = require('util');\nvar debug;\nif (debugUtil && debugUtil.debuglog) {\n debug = debugUtil.debuglog('stream');\n} else {\n debug = function debug() {};\n}\n/*</replacement>*/\n\nvar BufferList = require('./internal/streams/buffer_list');\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;\n\n// Lazy loaded to improve the startup performance.\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\nrequire('inherits')(Readable, Stream);\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\nfunction prependListener(emitter, event, fn) {\n // Sadly this is not cacheable as some libraries bundle their own\n // event emitter implementation with them.\n if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn);\n\n // This is a hack to make sure that our error handler is attached before any\n // userland ones. NEVER DO THIS. This is here only because this code needs\n // to continue to work with older versions of Node.js that do not include\n // the prependListener() method. The goal is to eventually remove this hack.\n if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\nfunction ReadableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag. Used to make read(n) ignore n and to\n // make all the buffer merging and length checks go away\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode;\n\n // the point at which it stops calling _read() to fill the buffer\n // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex);\n\n // A linked list is used to store data chunks instead of an array because the\n // linked list can remove elements from the beginning faster than\n // array.shift()\n this.buffer = new BufferList();\n this.length = 0;\n this.pipes = null;\n this.pipesCount = 0;\n this.flowing = null;\n this.ended = false;\n this.endEmitted = false;\n this.reading = false;\n\n // a flag to be able to tell if the event 'readable'/'data' is emitted\n // immediately, or on a later tick. We set this to true at first, because\n // any actions that shouldn't happen until \"later\" should generally also\n // not happen before the first read call.\n this.sync = true;\n\n // whenever we return null, then we set a flag to say\n // that we're awaiting a 'readable' event emission.\n this.needReadable = false;\n this.emittedReadable = false;\n this.readableListening = false;\n this.resumeScheduled = false;\n this.paused = true;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'end' (and potentially 'finish')\n this.autoDestroy = !!options.autoDestroy;\n\n // has it been destroyed\n this.destroyed = false;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // the number of writers that are awaiting a drain event in .pipe()s\n this.awaitDrain = 0;\n\n // if true, a maybeReadMore has been scheduled\n this.readingMore = false;\n this.decoder = null;\n this.encoding = null;\n if (options.encoding) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this.decoder = new StringDecoder(options.encoding);\n this.encoding = options.encoding;\n }\n}\nfunction Readable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n if (!(this instanceof Readable)) return new Readable(options);\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the ReadableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n this._readableState = new ReadableState(options, this, isDuplex);\n\n // legacy\n this.readable = true;\n if (options) {\n if (typeof options.read === 'function') this._read = options.read;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n }\n Stream.call(this);\n}\nObject.defineProperty(Readable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined) {\n return false;\n }\n return this._readableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._readableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\nReadable.prototype._destroy = function (err, cb) {\n cb(err);\n};\n\n// Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\nReadable.prototype.push = function (chunk, encoding) {\n var state = this._readableState;\n var skipChunkCheck;\n if (!state.objectMode) {\n if (typeof chunk === 'string') {\n encoding = encoding || state.defaultEncoding;\n if (encoding !== state.encoding) {\n chunk = Buffer.from(chunk, encoding);\n encoding = '';\n }\n skipChunkCheck = true;\n }\n } else {\n skipChunkCheck = true;\n }\n return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n};\n\n// Unshift should *always* be something directly out of read()\nReadable.prototype.unshift = function (chunk) {\n return readableAddChunk(this, chunk, null, true, false);\n};\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n debug('readableAddChunk', chunk);\n var state = stream._readableState;\n if (chunk === null) {\n state.reading = false;\n onEofChunk(stream, state);\n } else {\n var er;\n if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n if (er) {\n errorOrDestroy(stream, er);\n } else if (state.objectMode || chunk && chunk.length > 0) {\n if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (addToFront) {\n if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n } else if (state.destroyed) {\n return false;\n } else {\n state.reading = false;\n if (state.decoder && !encoding) {\n chunk = state.decoder.write(chunk);\n if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n } else {\n addChunk(stream, state, chunk, false);\n }\n }\n } else if (!addToFront) {\n state.reading = false;\n maybeReadMore(stream, state);\n }\n }\n\n // We can push more data if we are below the highWaterMark.\n // Also, if we have no data yet, we can stand some more bytes.\n // This is to work around cases where hwm=0, such as the repl.\n return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n state.awaitDrain = 0;\n stream.emit('data', chunk);\n } else {\n // update the buffer info.\n state.length += state.objectMode ? 1 : chunk.length;\n if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n if (state.needReadable) emitReadable(stream);\n }\n maybeReadMore(stream, state);\n}\nfunction chunkInvalid(state, chunk) {\n var er;\n if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n }\n return er;\n}\nReadable.prototype.isPaused = function () {\n return this._readableState.flowing === false;\n};\n\n// backwards compatibility.\nReadable.prototype.setEncoding = function (enc) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n var decoder = new StringDecoder(enc);\n this._readableState.decoder = decoder;\n // If setEncoding(null), decoder.encoding equals utf8\n this._readableState.encoding = this._readableState.decoder.encoding;\n\n // Iterate over current buffer to convert already stored Buffers:\n var p = this._readableState.buffer.head;\n var content = '';\n while (p !== null) {\n content += decoder.write(p.data);\n p = p.next;\n }\n this._readableState.buffer.clear();\n if (content !== '') this._readableState.buffer.push(content);\n this._readableState.length = content.length;\n return this;\n};\n\n// Don't raise the hwm > 1GB\nvar MAX_HWM = 0x40000000;\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\n n = MAX_HWM;\n } else {\n // Get the next highest power of 2 to prevent increasing hwm excessively in\n // tiny amounts\n n--;\n n |= n >>> 1;\n n |= n >>> 2;\n n |= n >>> 4;\n n |= n >>> 8;\n n |= n >>> 16;\n n++;\n }\n return n;\n}\n\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction howMuchToRead(n, state) {\n if (n <= 0 || state.length === 0 && state.ended) return 0;\n if (state.objectMode) return 1;\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n }\n // If we're asking for more than the current hwm, then raise the hwm.\n if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n;\n // Don't have enough\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n return state.length;\n}\n\n// you can override either this method, or the async _read(n) below.\nReadable.prototype.read = function (n) {\n debug('read', n);\n n = parseInt(n, 10);\n var state = this._readableState;\n var nOrig = n;\n if (n !== 0) state.emittedReadable = false;\n\n // if we're doing read(0) to trigger a readable event, but we\n // already have a bunch of data in the buffer, then just trigger\n // the 'readable' event and move on.\n if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) {\n debug('read: emitReadable', state.length, state.ended);\n if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n return null;\n }\n n = howMuchToRead(n, state);\n\n // if we've ended, and we're now clear, then finish it up.\n if (n === 0 && state.ended) {\n if (state.length === 0) endReadable(this);\n return null;\n }\n\n // All the actual chunk generation logic needs to be\n // *below* the call to _read. The reason is that in certain\n // synthetic stream cases, such as passthrough streams, _read\n // may be a completely synchronous operation which may change\n // the state of the read buffer, providing enough data when\n // before there was *not* enough.\n //\n // So, the steps are:\n // 1. Figure out what the state of things will be after we do\n // a read from the buffer.\n //\n // 2. If that resulting state will trigger a _read, then call _read.\n // Note that this may be asynchronous, or synchronous. Yes, it is\n // deeply ugly to write APIs this way, but that still doesn't mean\n // that the Readable class should behave improperly, as streams are\n // designed to be sync/async agnostic.\n // Take note if the _read call is sync or async (ie, if the read call\n // has returned yet), so that we know whether or not it's safe to emit\n // 'readable' etc.\n //\n // 3. Actually pull the requested chunks out of the buffer and return.\n\n // if we need a readable event, then we need to do some reading.\n var doRead = state.needReadable;\n debug('need readable', doRead);\n\n // if we currently have less than the highWaterMark, then also read some\n if (state.length === 0 || state.length - n < state.highWaterMark) {\n doRead = true;\n debug('length less than watermark', doRead);\n }\n\n // however, if we've ended, then there's no point, and if we're already\n // reading, then it's unnecessary.\n if (state.ended || state.reading) {\n doRead = false;\n debug('reading or ended', doRead);\n } else if (doRead) {\n debug('do read');\n state.reading = true;\n state.sync = true;\n // if the length is currently zero, then we *need* a readable event.\n if (state.length === 0) state.needReadable = true;\n // call internal read method\n this._read(state.highWaterMark);\n state.sync = false;\n // If _read pushed data synchronously, then `reading` will be false,\n // and we need to re-evaluate how much data we can return to the user.\n if (!state.reading) n = howMuchToRead(nOrig, state);\n }\n var ret;\n if (n > 0) ret = fromList(n, state);else ret = null;\n if (ret === null) {\n state.needReadable = state.length <= state.highWaterMark;\n n = 0;\n } else {\n state.length -= n;\n state.awaitDrain = 0;\n }\n if (state.length === 0) {\n // If we have nothing in the buffer, then we want to know\n // as soon as we *do* get something into the buffer.\n if (!state.ended) state.needReadable = true;\n\n // If we tried to read() past the EOF, then emit end on the next tick.\n if (nOrig !== n && state.ended) endReadable(this);\n }\n if (ret !== null) this.emit('data', ret);\n return ret;\n};\nfunction onEofChunk(stream, state) {\n debug('onEofChunk');\n if (state.ended) return;\n if (state.decoder) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) {\n state.buffer.push(chunk);\n state.length += state.objectMode ? 1 : chunk.length;\n }\n }\n state.ended = true;\n if (state.sync) {\n // if we are sync, wait until next tick to emit the data.\n // Otherwise we risk emitting data in the flow()\n // the readable code triggers during a read() call\n emitReadable(stream);\n } else {\n // emit 'readable' now to make sure it gets picked up.\n state.needReadable = false;\n if (!state.emittedReadable) {\n state.emittedReadable = true;\n emitReadable_(stream);\n }\n }\n}\n\n// Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow. This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\nfunction emitReadable(stream) {\n var state = stream._readableState;\n debug('emitReadable', state.needReadable, state.emittedReadable);\n state.needReadable = false;\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n process.nextTick(emitReadable_, stream);\n }\n}\nfunction emitReadable_(stream) {\n var state = stream._readableState;\n debug('emitReadable_', state.destroyed, state.length, state.ended);\n if (!state.destroyed && (state.length || state.ended)) {\n stream.emit('readable');\n state.emittedReadable = false;\n }\n\n // The stream needs another readable event if\n // 1. It is not flowing, as the flow mechanism will take\n // care of it.\n // 2. It is not ended.\n // 3. It is below the highWaterMark, so we can schedule\n // another readable later.\n state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\n flow(stream);\n}\n\n// at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data. that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\nfunction maybeReadMore(stream, state) {\n if (!state.readingMore) {\n state.readingMore = true;\n process.nextTick(maybeReadMore_, stream, state);\n }\n}\nfunction maybeReadMore_(stream, state) {\n // Attempt to read more data if we should.\n //\n // The conditions for reading more data are (one of):\n // - Not enough data buffered (state.length < state.highWaterMark). The loop\n // is responsible for filling the buffer with enough data if such data\n // is available. If highWaterMark is 0 and we are not in the flowing mode\n // we should _not_ attempt to buffer any extra data. We'll get more data\n // when the stream consumer calls read() instead.\n // - No data in the buffer, and the stream is in flowing mode. In this mode\n // the loop below is responsible for ensuring read() is called. Failing to\n // call read here would abort the flow and there's no other mechanism for\n // continuing the flow if the stream consumer has just subscribed to the\n // 'data' event.\n //\n // In addition to the above conditions to keep reading data, the following\n // conditions prevent the data from being read:\n // - The stream has ended (state.ended).\n // - There is already a pending 'read' operation (state.reading). This is a\n // case where the the stream has called the implementation defined _read()\n // method, but they are processing the call asynchronously and have _not_\n // called push() with new data. In this case we skip performing more\n // read()s. The execution ends in this method again after the _read() ends\n // up calling push() with more data.\n while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n var len = state.length;\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length)\n // didn't get any data, stop spinning.\n break;\n }\n state.readingMore = false;\n}\n\n// abstract method. to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\nReadable.prototype._read = function (n) {\n errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\n};\nReadable.prototype.pipe = function (dest, pipeOpts) {\n var src = this;\n var state = this._readableState;\n switch (state.pipesCount) {\n case 0:\n state.pipes = dest;\n break;\n case 1:\n state.pipes = [state.pipes, dest];\n break;\n default:\n state.pipes.push(dest);\n break;\n }\n state.pipesCount += 1;\n debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n var endFn = doEnd ? onend : unpipe;\n if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn);\n dest.on('unpipe', onunpipe);\n function onunpipe(readable, unpipeInfo) {\n debug('onunpipe');\n if (readable === src) {\n if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n unpipeInfo.hasUnpiped = true;\n cleanup();\n }\n }\n }\n function onend() {\n debug('onend');\n dest.end();\n }\n\n // when the dest drains, it reduces the awaitDrain counter\n // on the source. This would be more elegant with a .once()\n // handler in flow(), but adding and removing repeatedly is\n // too slow.\n var ondrain = pipeOnDrain(src);\n dest.on('drain', ondrain);\n var cleanedUp = false;\n function cleanup() {\n debug('cleanup');\n // cleanup event handlers once the pipe is broken\n dest.removeListener('close', onclose);\n dest.removeListener('finish', onfinish);\n dest.removeListener('drain', ondrain);\n dest.removeListener('error', onerror);\n dest.removeListener('unpipe', onunpipe);\n src.removeListener('end', onend);\n src.removeListener('end', unpipe);\n src.removeListener('data', ondata);\n cleanedUp = true;\n\n // if the reader is waiting for a drain event from this\n // specific writer, then it would cause it to never start\n // flowing again.\n // So, if this is awaiting a drain, then we just call it now.\n // If we don't know, then assume that we are waiting for one.\n if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n }\n src.on('data', ondata);\n function ondata(chunk) {\n debug('ondata');\n var ret = dest.write(chunk);\n debug('dest.write', ret);\n if (ret === false) {\n // If the user unpiped during `dest.write()`, it is possible\n // to get stuck in a permanently paused state if that write\n // also returned false.\n // => Check whether `dest` is still a piping destination.\n if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n debug('false write response, pause', state.awaitDrain);\n state.awaitDrain++;\n }\n src.pause();\n }\n }\n\n // if the dest has an error, then stop piping into it.\n // however, don't suppress the throwing behavior for this.\n function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n }\n\n // Make sure our error handler is attached before userland ones.\n prependListener(dest, 'error', onerror);\n\n // Both close and finish should trigger unpipe, but only once.\n function onclose() {\n dest.removeListener('finish', onfinish);\n unpipe();\n }\n dest.once('close', onclose);\n function onfinish() {\n debug('onfinish');\n dest.removeListener('close', onclose);\n unpipe();\n }\n dest.once('finish', onfinish);\n function unpipe() {\n debug('unpipe');\n src.unpipe(dest);\n }\n\n // tell the dest that it's being piped to\n dest.emit('pipe', src);\n\n // start the flow if it hasn't been started already.\n if (!state.flowing) {\n debug('pipe resume');\n src.resume();\n }\n return dest;\n};\nfunction pipeOnDrain(src) {\n return function pipeOnDrainFunctionResult() {\n var state = src._readableState;\n debug('pipeOnDrain', state.awaitDrain);\n if (state.awaitDrain) state.awaitDrain--;\n if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n state.flowing = true;\n flow(src);\n }\n };\n}\nReadable.prototype.unpipe = function (dest) {\n var state = this._readableState;\n var unpipeInfo = {\n hasUnpiped: false\n };\n\n // if we're not piping anywhere, then do nothing.\n if (state.pipesCount === 0) return this;\n\n // just one destination. most common case.\n if (state.pipesCount === 1) {\n // passed in one, but it's not the right one.\n if (dest && dest !== state.pipes) return this;\n if (!dest) dest = state.pipes;\n\n // got a match.\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n if (dest) dest.emit('unpipe', this, unpipeInfo);\n return this;\n }\n\n // slow case. multiple pipe destinations.\n\n if (!dest) {\n // remove all.\n var dests = state.pipes;\n var len = state.pipesCount;\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n for (var i = 0; i < len; i++) dests[i].emit('unpipe', this, {\n hasUnpiped: false\n });\n return this;\n }\n\n // try to find the right one.\n var index = indexOf(state.pipes, dest);\n if (index === -1) return this;\n state.pipes.splice(index, 1);\n state.pipesCount -= 1;\n if (state.pipesCount === 1) state.pipes = state.pipes[0];\n dest.emit('unpipe', this, unpipeInfo);\n return this;\n};\n\n// set up data events if they are asked for\n// Ensure readable listeners eventually get something\nReadable.prototype.on = function (ev, fn) {\n var res = Stream.prototype.on.call(this, ev, fn);\n var state = this._readableState;\n if (ev === 'data') {\n // update readableListening so that resume() may be a no-op\n // a few lines down. This is needed to support once('readable').\n state.readableListening = this.listenerCount('readable') > 0;\n\n // Try start flowing on next tick if stream isn't explicitly paused\n if (state.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.flowing = false;\n state.emittedReadable = false;\n debug('on readable', state.length, state.reading);\n if (state.length) {\n emitReadable(this);\n } else if (!state.reading) {\n process.nextTick(nReadingNextTick, this);\n }\n }\n }\n return res;\n};\nReadable.prototype.addListener = Readable.prototype.on;\nReadable.prototype.removeListener = function (ev, fn) {\n var res = Stream.prototype.removeListener.call(this, ev, fn);\n if (ev === 'readable') {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nReadable.prototype.removeAllListeners = function (ev) {\n var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n if (ev === 'readable' || ev === undefined) {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n return res;\n};\nfunction updateReadableListening(self) {\n var state = self._readableState;\n state.readableListening = self.listenerCount('readable') > 0;\n if (state.resumeScheduled && !state.paused) {\n // flowing needs to be set to true now, otherwise\n // the upcoming resume will not flow.\n state.flowing = true;\n\n // crude way to check if we should resume\n } else if (self.listenerCount('data') > 0) {\n self.resume();\n }\n}\nfunction nReadingNextTick(self) {\n debug('readable nexttick read 0');\n self.read(0);\n}\n\n// pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\nReadable.prototype.resume = function () {\n var state = this._readableState;\n if (!state.flowing) {\n debug('resume');\n // we flow only if there is no one listening\n // for readable, but we still have to call\n // resume()\n state.flowing = !state.readableListening;\n resume(this, state);\n }\n state.paused = false;\n return this;\n};\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n process.nextTick(resume_, stream, state);\n }\n}\nfunction resume_(stream, state) {\n debug('resume', state.reading);\n if (!state.reading) {\n stream.read(0);\n }\n state.resumeScheduled = false;\n stream.emit('resume');\n flow(stream);\n if (state.flowing && !state.reading) stream.read(0);\n}\nReadable.prototype.pause = function () {\n debug('call pause flowing=%j', this._readableState.flowing);\n if (this._readableState.flowing !== false) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n this._readableState.paused = true;\n return this;\n};\nfunction flow(stream) {\n var state = stream._readableState;\n debug('flow', state.flowing);\n while (state.flowing && stream.read() !== null);\n}\n\n// wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\nReadable.prototype.wrap = function (stream) {\n var _this = this;\n var state = this._readableState;\n var paused = false;\n stream.on('end', function () {\n debug('wrapped end');\n if (state.decoder && !state.ended) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) _this.push(chunk);\n }\n _this.push(null);\n });\n stream.on('data', function (chunk) {\n debug('wrapped data');\n if (state.decoder) chunk = state.decoder.write(chunk);\n\n // don't skip over falsy values in objectMode\n if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n var ret = _this.push(chunk);\n if (!ret) {\n paused = true;\n stream.pause();\n }\n });\n\n // proxy all the other methods.\n // important when wrapping filters and duplexes.\n for (var i in stream) {\n if (this[i] === undefined && typeof stream[i] === 'function') {\n this[i] = function methodWrap(method) {\n return function methodWrapReturnFunction() {\n return stream[method].apply(stream, arguments);\n };\n }(i);\n }\n }\n\n // proxy certain important events.\n for (var n = 0; n < kProxyEvents.length; n++) {\n stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n }\n\n // when we try to consume some more bytes, simply unpause the\n // underlying stream.\n this._read = function (n) {\n debug('wrapped _read', n);\n if (paused) {\n paused = false;\n stream.resume();\n }\n };\n return this;\n};\nif (typeof Symbol === 'function') {\n Readable.prototype[Symbol.asyncIterator] = function () {\n if (createReadableStreamAsyncIterator === undefined) {\n createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n }\n return createReadableStreamAsyncIterator(this);\n };\n}\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.highWaterMark;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState && this._readableState.buffer;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.flowing;\n },\n set: function set(state) {\n if (this._readableState) {\n this._readableState.flowing = state;\n }\n }\n});\n\n// exposed for testing purposes only.\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.length;\n }\n});\n\n// Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction fromList(n, state) {\n // nothing buffered\n if (state.length === 0) return null;\n var ret;\n if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n // read it all, truncate the list\n if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = state.buffer.consume(n, state.decoder);\n }\n return ret;\n}\nfunction endReadable(stream) {\n var state = stream._readableState;\n debug('endReadable', state.endEmitted);\n if (!state.endEmitted) {\n state.ended = true;\n process.nextTick(endReadableNT, state, stream);\n }\n}\nfunction endReadableNT(state, stream) {\n debug('endReadableNT', state.endEmitted, state.length);\n\n // Check that we didn't get one last unshift.\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the writable side is ready for autoDestroy as well\n var wState = stream._writableState;\n if (!wState || wState.autoDestroy && wState.finished) {\n stream.destroy();\n }\n }\n }\n}\nif (typeof Symbol === 'function') {\n Readable.from = function (iterable, opts) {\n if (from === undefined) {\n from = require('./internal/streams/from');\n }\n return from(Readable, iterable, opts);\n };\n}\nfunction indexOf(xs, x) {\n for (var i = 0, l = xs.length; i < l; i++) {\n if (xs[i] === x) return i;\n }\n return -1;\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\n// a transform stream is a readable/writable stream where you do\n// something with the data. Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored. (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation. For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes. When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up. When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer. When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks. If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk. However,\n// a pathological inflate type of transform can cause excessive buffering\n// here. For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output. In this case, you could write a very small\n// amount of input, and end up with a very large amount of output. In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform. A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n\n'use strict';\n\nmodule.exports = Transform;\nvar _require$codes = require('../errors').codes,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\nvar Duplex = require('./_stream_duplex');\nrequire('inherits')(Transform, Duplex);\nfunction afterTransform(er, data) {\n var ts = this._transformState;\n ts.transforming = false;\n var cb = ts.writecb;\n if (cb === null) {\n return this.emit('error', new ERR_MULTIPLE_CALLBACK());\n }\n ts.writechunk = null;\n ts.writecb = null;\n if (data != null)\n // single equals check for both `null` and `undefined`\n this.push(data);\n cb(er);\n var rs = this._readableState;\n rs.reading = false;\n if (rs.needReadable || rs.length < rs.highWaterMark) {\n this._read(rs.highWaterMark);\n }\n}\nfunction Transform(options) {\n if (!(this instanceof Transform)) return new Transform(options);\n Duplex.call(this, options);\n this._transformState = {\n afterTransform: afterTransform.bind(this),\n needTransform: false,\n transforming: false,\n writecb: null,\n writechunk: null,\n writeencoding: null\n };\n\n // start out asking for a readable event once data is transformed.\n this._readableState.needReadable = true;\n\n // we have implemented the _read method, and done the other things\n // that Readable wants before the first _read call, so unset the\n // sync guard flag.\n this._readableState.sync = false;\n if (options) {\n if (typeof options.transform === 'function') this._transform = options.transform;\n if (typeof options.flush === 'function') this._flush = options.flush;\n }\n\n // When the writable side finishes, then flush out anything remaining.\n this.on('prefinish', prefinish);\n}\nfunction prefinish() {\n var _this = this;\n if (typeof this._flush === 'function' && !this._readableState.destroyed) {\n this._flush(function (er, data) {\n done(_this, er, data);\n });\n } else {\n done(this, null, null);\n }\n}\nTransform.prototype.push = function (chunk, encoding) {\n this._transformState.needTransform = false;\n return Duplex.prototype.push.call(this, chunk, encoding);\n};\n\n// This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side. You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk. If you pass\n// an error, then that'll put the hurt on the whole operation. If you\n// never call cb(), then you'll never get another chunk.\nTransform.prototype._transform = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\n};\nTransform.prototype._write = function (chunk, encoding, cb) {\n var ts = this._transformState;\n ts.writecb = cb;\n ts.writechunk = chunk;\n ts.writeencoding = encoding;\n if (!ts.transforming) {\n var rs = this._readableState;\n if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n }\n};\n\n// Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\nTransform.prototype._read = function (n) {\n var ts = this._transformState;\n if (ts.writechunk !== null && !ts.transforming) {\n ts.transforming = true;\n this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n } else {\n // mark that we need a transform, so that any data that comes in\n // will get processed, now that we've asked for it.\n ts.needTransform = true;\n }\n};\nTransform.prototype._destroy = function (err, cb) {\n Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\n });\n};\nfunction done(stream, er, data) {\n if (er) return stream.emit('error', er);\n if (data != null)\n // single equals check for both `null` and `undefined`\n stream.push(data);\n\n // TODO(BridgeAR): Write a test for these two error cases\n // if there's nothing in the write buffer, then that means\n // that nothing more will ever be provided\n if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0();\n if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n return stream.push(null);\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\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n\n'use strict';\n\nmodule.exports = Writable;\n\n/* <replacement> */\nfunction WriteReq(chunk, encoding, cb) {\n this.chunk = chunk;\n this.encoding = encoding;\n this.callback = cb;\n this.next = null;\n}\n\n// It seems a linked list but it is not\n// there will be only 2 of these for each stream\nfunction CorkedRequest(state) {\n var _this = this;\n this.next = null;\n this.entry = null;\n this.finish = function () {\n onCorkedFinish(_this, state);\n };\n}\n/* </replacement> */\n\n/*<replacement>*/\nvar Duplex;\n/*</replacement>*/\n\nWritable.WritableState = WritableState;\n\n/*<replacement>*/\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/*</replacement>*/\n\n/*<replacement>*/\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\nvar Buffer = require('buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nrequire('inherits')(Writable, Stream);\nfunction nop() {}\nfunction WritableState(options, stream, isDuplex) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream,\n // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex;\n\n // object stream flag to indicate whether or not this stream\n // contains buffers or objects.\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode;\n\n // the point at which write() starts returning false\n // Note: 0 is a valid value, means that we always return false if\n // the entire buffer is not flushed immediately on write()\n this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex);\n\n // if _final has been called\n this.finalCalled = false;\n\n // drain event flag.\n this.needDrain = false;\n // at the start of calling end()\n this.ending = false;\n // when end() has been called, and returned\n this.ended = false;\n // when 'finish' is emitted\n this.finished = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // should we decode strings into buffers before passing to _write?\n // this is here so that some node-core streams can optimize string\n // handling at a lower level.\n var noDecode = options.decodeStrings === false;\n this.decodeStrings = !noDecode;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // not an actual buffer we keep track of, but a measurement\n // of how much we're waiting to get pushed to some underlying\n // socket or file.\n this.length = 0;\n\n // a flag to see when we're in the middle of a write.\n this.writing = false;\n\n // when true all writes will be buffered until .uncork() call\n this.corked = 0;\n\n // a flag to be able to tell if the onwrite cb is called immediately,\n // or on a later tick. We set this to true at first, because any\n // actions that shouldn't happen until \"later\" should generally also\n // not happen before the first write call.\n this.sync = true;\n\n // a flag to know if we're processing previously buffered items, which\n // may call the _write() callback in the same tick, so that we don't\n // end up in an overlapped onwrite situation.\n this.bufferProcessing = false;\n\n // the callback that's passed to _write(chunk,cb)\n this.onwrite = function (er) {\n onwrite(stream, er);\n };\n\n // the callback that the user supplies to write(chunk,encoding,cb)\n this.writecb = null;\n\n // the amount that is being written when _write is called.\n this.writelen = 0;\n this.bufferedRequest = null;\n this.lastBufferedRequest = null;\n\n // number of pending user-supplied write callbacks\n // this must be 0 before 'finish' can be emitted\n this.pendingcb = 0;\n\n // emit prefinish if the only thing we're waiting for is _write cbs\n // This is relevant for synchronous Transform streams\n this.prefinished = false;\n\n // True if the error was already emitted and should not be thrown again\n this.errorEmitted = false;\n\n // Should close be emitted on destroy. Defaults to true.\n this.emitClose = options.emitClose !== false;\n\n // Should .destroy() be called after 'finish' (and potentially 'end')\n this.autoDestroy = !!options.autoDestroy;\n\n // count buffered requests\n this.bufferedRequestCount = 0;\n\n // allocate the first CorkedRequest, there is always\n // one allocated and free to use, and we maintain at most two\n this.corkedRequestsFree = new CorkedRequest(this);\n}\nWritableState.prototype.getBuffer = function getBuffer() {\n var current = this.bufferedRequest;\n var out = [];\n while (current) {\n out.push(current);\n current = current.next;\n }\n return out;\n};\n(function () {\n try {\n Object.defineProperty(WritableState.prototype, 'buffer', {\n get: internalUtil.deprecate(function writableStateBufferGetter() {\n return this.getBuffer();\n }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n });\n } catch (_) {}\n})();\n\n// Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\nvar realHasInstance;\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n realHasInstance = Function.prototype[Symbol.hasInstance];\n Object.defineProperty(Writable, Symbol.hasInstance, {\n value: function value(object) {\n if (realHasInstance.call(this, object)) return true;\n if (this !== Writable) return false;\n return object && object._writableState instanceof WritableState;\n }\n });\n} else {\n realHasInstance = function realHasInstance(object) {\n return object instanceof this;\n };\n}\nfunction Writable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n\n // Writable ctor is applied to Duplexes, too.\n // `realHasInstance` is necessary because using plain `instanceof`\n // would return false, as no `_writableState` property is attached.\n\n // Trying to use the custom `instanceof` for Writable here will also break the\n // Node.js LazyTransform implementation, which has a non-trivial getter for\n // `_writableState` that would lead to infinite recursion.\n\n // Checking for a Stream.Duplex instance is faster here instead of inside\n // the WritableState constructor, at least with V8 6.5\n var isDuplex = this instanceof Duplex;\n if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n this._writableState = new WritableState(options, this, isDuplex);\n\n // legacy.\n this.writable = true;\n if (options) {\n if (typeof options.write === 'function') this._write = options.write;\n if (typeof options.writev === 'function') this._writev = options.writev;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n if (typeof options.final === 'function') this._final = options.final;\n }\n Stream.call(this);\n}\n\n// Otherwise people can pipe Writable streams, which is just wrong.\nWritable.prototype.pipe = function () {\n errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\nfunction writeAfterEnd(stream, cb) {\n var er = new ERR_STREAM_WRITE_AFTER_END();\n // TODO: defer error events consistently everywhere, not just the cb\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n}\n\n// Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\nfunction validChunk(stream, state, chunk, cb) {\n var er;\n if (chunk === null) {\n er = new ERR_STREAM_NULL_VALUES();\n } else if (typeof chunk !== 'string' && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n }\n if (er) {\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n return false;\n }\n return true;\n}\nWritable.prototype.write = function (chunk, encoding, cb) {\n var state = this._writableState;\n var ret = false;\n var isBuf = !state.objectMode && _isUint8Array(chunk);\n if (isBuf && !Buffer.isBuffer(chunk)) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n if (typeof cb !== 'function') cb = nop;\n if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n state.pendingcb++;\n ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n }\n return ret;\n};\nWritable.prototype.cork = function () {\n this._writableState.corked++;\n};\nWritable.prototype.uncork = function () {\n var state = this._writableState;\n if (state.corked) {\n state.corked--;\n if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n }\n};\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n // node::ParseEncoding() requires lower case.\n if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nfunction decodeChunk(state, chunk, encoding) {\n if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n chunk = Buffer.from(chunk, encoding);\n }\n return chunk;\n}\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\n\n// if we're already writing something, then just put this\n// in the queue, and wait our turn. Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n if (!isBuf) {\n var newChunk = decodeChunk(state, chunk, encoding);\n if (chunk !== newChunk) {\n isBuf = true;\n encoding = 'buffer';\n chunk = newChunk;\n }\n }\n var len = state.objectMode ? 1 : chunk.length;\n state.length += len;\n var ret = state.length < state.highWaterMark;\n // we must ensure that previous needDrain will not be reset to false.\n if (!ret) state.needDrain = true;\n if (state.writing || state.corked) {\n var last = state.lastBufferedRequest;\n state.lastBufferedRequest = {\n chunk: chunk,\n encoding: encoding,\n isBuf: isBuf,\n callback: cb,\n next: null\n };\n if (last) {\n last.next = state.lastBufferedRequest;\n } else {\n state.bufferedRequest = state.lastBufferedRequest;\n }\n state.bufferedRequestCount += 1;\n } else {\n doWrite(stream, state, false, len, chunk, encoding, cb);\n }\n return ret;\n}\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n state.writelen = len;\n state.writecb = cb;\n state.writing = true;\n state.sync = true;\n if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n state.sync = false;\n}\nfunction onwriteError(stream, state, sync, er, cb) {\n --state.pendingcb;\n if (sync) {\n // defer the callback if we are being called synchronously\n // to avoid piling up things on the stack\n process.nextTick(cb, er);\n // this can emit finish, and it will always happen\n // after error\n process.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n } else {\n // the caller expect this to happen before if\n // it is async\n cb(er);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, er);\n // this can emit finish, but finish must\n // always follow error\n finishMaybe(stream, state);\n }\n}\nfunction onwriteStateUpdate(state) {\n state.writing = false;\n state.writecb = null;\n state.length -= state.writelen;\n state.writelen = 0;\n}\nfunction onwrite(stream, er) {\n var state = stream._writableState;\n var sync = state.sync;\n var cb = state.writecb;\n if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\n onwriteStateUpdate(state);\n if (er) onwriteError(stream, state, sync, er, cb);else {\n // Check if we're actually ready to finish, but don't emit yet\n var finished = needFinish(state) || stream.destroyed;\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n if (sync) {\n process.nextTick(afterWrite, stream, state, finished, cb);\n } else {\n afterWrite(stream, state, finished, cb);\n }\n }\n}\nfunction afterWrite(stream, state, finished, cb) {\n if (!finished) onwriteDrain(stream, state);\n state.pendingcb--;\n cb();\n finishMaybe(stream, state);\n}\n\n// Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\nfunction onwriteDrain(stream, state) {\n if (state.length === 0 && state.needDrain) {\n state.needDrain = false;\n stream.emit('drain');\n }\n}\n\n// if there's something in the buffer waiting, then process it\nfunction clearBuffer(stream, state) {\n state.bufferProcessing = true;\n var entry = state.bufferedRequest;\n if (stream._writev && entry && entry.next) {\n // Fast case, write everything using _writev()\n var l = state.bufferedRequestCount;\n var buffer = new Array(l);\n var holder = state.corkedRequestsFree;\n holder.entry = entry;\n var count = 0;\n var allBuffers = true;\n while (entry) {\n buffer[count] = entry;\n if (!entry.isBuf) allBuffers = false;\n entry = entry.next;\n count += 1;\n }\n buffer.allBuffers = allBuffers;\n doWrite(stream, state, true, state.length, buffer, '', holder.finish);\n\n // doWrite is almost always async, defer these to save a bit of time\n // as the hot path ends with doWrite\n state.pendingcb++;\n state.lastBufferedRequest = null;\n if (holder.next) {\n state.corkedRequestsFree = holder.next;\n holder.next = null;\n } else {\n state.corkedRequestsFree = new CorkedRequest(state);\n }\n state.bufferedRequestCount = 0;\n } else {\n // Slow case, write chunks one-by-one\n while (entry) {\n var chunk = entry.chunk;\n var encoding = entry.encoding;\n var cb = entry.callback;\n var len = state.objectMode ? 1 : chunk.length;\n doWrite(stream, state, false, len, chunk, encoding, cb);\n entry = entry.next;\n state.bufferedRequestCount--;\n // if we didn't call the onwrite immediately, then\n // it means that we need to wait until it does.\n // also, that means that the chunk and cb are currently\n // being processed, so move the buffer counter past them.\n if (state.writing) {\n break;\n }\n }\n if (entry === null) state.lastBufferedRequest = null;\n }\n state.bufferedRequest = entry;\n state.bufferProcessing = false;\n}\nWritable.prototype._write = function (chunk, encoding, cb) {\n cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()'));\n};\nWritable.prototype._writev = null;\nWritable.prototype.end = function (chunk, encoding, cb) {\n var state = this._writableState;\n if (typeof chunk === 'function') {\n cb = chunk;\n chunk = null;\n encoding = null;\n } else if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n if (chunk !== null && chunk !== undefined) this.write(chunk, encoding);\n\n // .end() fully uncorks\n if (state.corked) {\n state.corked = 1;\n this.uncork();\n }\n\n // ignore unnecessary end() calls.\n if (!state.ending) endWritable(this, state, cb);\n return this;\n};\nObject.defineProperty(Writable.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\nfunction needFinish(state) {\n return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\nfunction callFinal(stream, state) {\n stream._final(function (err) {\n state.pendingcb--;\n if (err) {\n errorOrDestroy(stream, err);\n }\n state.prefinished = true;\n stream.emit('prefinish');\n finishMaybe(stream, state);\n });\n}\nfunction prefinish(stream, state) {\n if (!state.prefinished && !state.finalCalled) {\n if (typeof stream._final === 'function' && !state.destroyed) {\n state.pendingcb++;\n state.finalCalled = true;\n process.nextTick(callFinal, stream, state);\n } else {\n state.prefinished = true;\n stream.emit('prefinish');\n }\n }\n}\nfunction finishMaybe(stream, state) {\n var need = needFinish(state);\n if (need) {\n prefinish(stream, state);\n if (state.pendingcb === 0) {\n state.finished = true;\n stream.emit('finish');\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the readable side is ready for autoDestroy as well\n var rState = stream._readableState;\n if (!rState || rState.autoDestroy && rState.endEmitted) {\n stream.destroy();\n }\n }\n }\n }\n return need;\n}\nfunction endWritable(stream, state, cb) {\n state.ending = true;\n finishMaybe(stream, state);\n if (cb) {\n if (state.finished) process.nextTick(cb);else stream.once('finish', cb);\n }\n state.ended = true;\n stream.writable = false;\n}\nfunction onCorkedFinish(corkReq, state, err) {\n var entry = corkReq.entry;\n corkReq.entry = null;\n while (entry) {\n var cb = entry.callback;\n state.pendingcb--;\n cb(err);\n entry = entry.next;\n }\n\n // reuse the free corkReq.\n state.corkedRequestsFree.next = corkReq;\n}\nObject.defineProperty(Writable.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._writableState === undefined) {\n return false;\n }\n return this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._writableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._writableState.destroyed = value;\n }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\nWritable.prototype._destroy = function (err, cb) {\n cb(err);\n};","'use strict';\n\nvar _Object$setPrototypeO;\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar finished = require('./end-of-stream');\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\nfunction createIterResult(value, done) {\n return {\n value: value,\n done: done\n };\n}\nfunction readAndResolve(iter) {\n var resolve = iter[kLastResolve];\n if (resolve !== null) {\n var data = iter[kStream].read();\n // we defer if data is null\n // we can be expecting either 'end' or\n // 'error'\n if (data !== null) {\n iter[kLastPromise] = null;\n iter[kLastResolve] = null;\n iter[kLastReject] = null;\n resolve(createIterResult(data, false));\n }\n }\n}\nfunction onReadable(iter) {\n // we wait for the next tick, because it might\n // emit an error with process.nextTick\n process.nextTick(readAndResolve, iter);\n}\nfunction wrapForNext(lastPromise, iter) {\n return function (resolve, reject) {\n lastPromise.then(function () {\n if (iter[kEnded]) {\n resolve(createIterResult(undefined, true));\n return;\n }\n iter[kHandlePromise](resolve, reject);\n }, reject);\n };\n}\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n get stream() {\n return this[kStream];\n },\n next: function next() {\n var _this = this;\n // if we have detected an error in the meanwhile\n // reject straight away\n var error = this[kError];\n if (error !== null) {\n return Promise.reject(error);\n }\n if (this[kEnded]) {\n return Promise.resolve(createIterResult(undefined, true));\n }\n if (this[kStream].destroyed) {\n // We need to defer via nextTick because if .destroy(err) is\n // called, the error will be emitted via nextTick, and\n // we cannot guarantee that there is no error lingering around\n // waiting to be emitted.\n return new Promise(function (resolve, reject) {\n process.nextTick(function () {\n if (_this[kError]) {\n reject(_this[kError]);\n } else {\n resolve(createIterResult(undefined, true));\n }\n });\n });\n }\n\n // if we have multiple next() calls\n // we will wait for the previous Promise to finish\n // this logic is optimized to support for await loops,\n // where next() is only called once at a time\n var lastPromise = this[kLastPromise];\n var promise;\n if (lastPromise) {\n promise = new Promise(wrapForNext(lastPromise, this));\n } else {\n // fast path needed to support multiple this.push()\n // without triggering the next() queue\n var data = this[kStream].read();\n if (data !== null) {\n return Promise.resolve(createIterResult(data, false));\n }\n promise = new Promise(this[kHandlePromise]);\n }\n this[kLastPromise] = promise;\n return promise;\n }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n var _this2 = this;\n // destroy(err, cb) is a private API\n // we can guarantee we have that here, because we control the\n // Readable class this is attached to\n return new Promise(function (resolve, reject) {\n _this2[kStream].destroy(null, function (err) {\n if (err) {\n reject(err);\n return;\n }\n resolve(createIterResult(undefined, true));\n });\n });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n var _Object$create;\n var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n value: stream,\n writable: true\n }), _defineProperty(_Object$create, kLastResolve, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kLastReject, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kError, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kEnded, {\n value: stream._readableState.endEmitted,\n writable: true\n }), _defineProperty(_Object$create, kHandlePromise, {\n value: function value(resolve, reject) {\n var data = iterator[kStream].read();\n if (data) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(data, false));\n } else {\n iterator[kLastResolve] = resolve;\n iterator[kLastReject] = reject;\n }\n },\n writable: true\n }), _Object$create));\n iterator[kLastPromise] = null;\n finished(stream, function (err) {\n if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n var reject = iterator[kLastReject];\n // reject if we are waiting for data in the Promise\n // returned by next() and store the error\n if (reject !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n reject(err);\n }\n iterator[kError] = err;\n return;\n }\n var resolve = iterator[kLastResolve];\n if (resolve !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(undefined, true));\n }\n iterator[kEnded] = true;\n });\n stream.on('readable', onReadable.bind(null, iterator));\n return iterator;\n};\nmodule.exports = createReadableStreamAsyncIterator;","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar _require = require('buffer'),\n Buffer = _require.Buffer;\nvar _require2 = require('util'),\n inspect = _require2.inspect;\nvar custom = inspect && inspect.custom || 'inspect';\nfunction copyBuffer(src, target, offset) {\n Buffer.prototype.copy.call(src, target, offset);\n}\nmodule.exports = /*#__PURE__*/function () {\n function BufferList() {\n _classCallCheck(this, BufferList);\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n _createClass(BufferList, [{\n key: \"push\",\n value: function push(v) {\n var entry = {\n data: v,\n next: null\n };\n if (this.length > 0) this.tail.next = entry;else this.head = entry;\n this.tail = entry;\n ++this.length;\n }\n }, {\n key: \"unshift\",\n value: function unshift(v) {\n var entry = {\n data: v,\n next: this.head\n };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n }\n }, {\n key: \"shift\",\n value: function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n --this.length;\n return ret;\n }\n }, {\n key: \"clear\",\n value: function clear() {\n this.head = this.tail = null;\n this.length = 0;\n }\n }, {\n key: \"join\",\n value: function join(s) {\n if (this.length === 0) return '';\n var p = this.head;\n var ret = '' + p.data;\n while (p = p.next) ret += s + p.data;\n return ret;\n }\n }, {\n key: \"concat\",\n value: function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n return ret;\n }\n\n // Consumes a specified amount of bytes or characters from the buffered data.\n }, {\n key: \"consume\",\n value: function consume(n, hasStrings) {\n var ret;\n if (n < this.head.data.length) {\n // `slice` is the same for buffers and strings.\n ret = this.head.data.slice(0, n);\n this.head.data = this.head.data.slice(n);\n } else if (n === this.head.data.length) {\n // First chunk is a perfect match.\n ret = this.shift();\n } else {\n // Result spans more than one buffer.\n ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n }\n return ret;\n }\n }, {\n key: \"first\",\n value: function first() {\n return this.head.data;\n }\n\n // Consumes a specified amount of characters from the buffered data.\n }, {\n key: \"_getString\",\n value: function _getString(n) {\n var p = this.head;\n var c = 1;\n var ret = p.data;\n n -= ret.length;\n while (p = p.next) {\n var str = p.data;\n var nb = n > str.length ? str.length : n;\n if (nb === str.length) ret += str;else ret += str.slice(0, n);\n n -= nb;\n if (n === 0) {\n if (nb === str.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = str.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Consumes a specified amount of bytes from the buffered data.\n }, {\n key: \"_getBuffer\",\n value: function _getBuffer(n) {\n var ret = Buffer.allocUnsafe(n);\n var p = this.head;\n var c = 1;\n p.data.copy(ret);\n n -= p.data.length;\n while (p = p.next) {\n var buf = p.data;\n var nb = n > buf.length ? buf.length : n;\n buf.copy(ret, ret.length - n, 0, nb);\n n -= nb;\n if (n === 0) {\n if (nb === buf.length) {\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = buf.slice(nb);\n }\n break;\n }\n ++c;\n }\n this.length -= c;\n return ret;\n }\n\n // Make sure the linked list only shows the minimal necessary information.\n }, {\n key: custom,\n value: function value(_, options) {\n return inspect(this, _objectSpread(_objectSpread({}, options), {}, {\n // Only inspect one level.\n depth: 0,\n // It should not recurse.\n customInspect: false\n }));\n }\n }]);\n return BufferList;\n}();","'use strict';\n\n// undocumented cb() API, needed for core, not for public API\nfunction destroy(err, cb) {\n var _this = this;\n var readableDestroyed = this._readableState && this._readableState.destroyed;\n var writableDestroyed = this._writableState && this._writableState.destroyed;\n if (readableDestroyed || writableDestroyed) {\n if (cb) {\n cb(err);\n } else if (err) {\n if (!this._writableState) {\n process.nextTick(emitErrorNT, this, err);\n } else if (!this._writableState.errorEmitted) {\n this._writableState.errorEmitted = true;\n process.nextTick(emitErrorNT, this, err);\n }\n }\n return this;\n }\n\n // we set destroyed to true before firing error callbacks in order\n // to make it re-entrance safe in case destroy() is called within callbacks\n\n if (this._readableState) {\n this._readableState.destroyed = true;\n }\n\n // if this is a duplex stream mark the writable part as destroyed as well\n if (this._writableState) {\n this._writableState.destroyed = true;\n }\n this._destroy(err || null, function (err) {\n if (!cb && err) {\n if (!_this._writableState) {\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else if (!_this._writableState.errorEmitted) {\n _this._writableState.errorEmitted = true;\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n } else if (cb) {\n process.nextTick(emitCloseNT, _this);\n cb(err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n });\n return this;\n}\nfunction emitErrorAndCloseNT(self, err) {\n emitErrorNT(self, err);\n emitCloseNT(self);\n}\nfunction emitCloseNT(self) {\n if (self._writableState && !self._writableState.emitClose) return;\n if (self._readableState && !self._readableState.emitClose) return;\n self.emit('close');\n}\nfunction undestroy() {\n if (this._readableState) {\n this._readableState.destroyed = false;\n this._readableState.reading = false;\n this._readableState.ended = false;\n this._readableState.endEmitted = false;\n }\n if (this._writableState) {\n this._writableState.destroyed = false;\n this._writableState.ended = false;\n this._writableState.ending = false;\n this._writableState.finalCalled = false;\n this._writableState.prefinished = false;\n this._writableState.finished = false;\n this._writableState.errorEmitted = false;\n }\n}\nfunction emitErrorNT(self, err) {\n self.emit('error', err);\n}\nfunction errorOrDestroy(stream, err) {\n // We have tests that rely on errors being emitted\n // in the same tick, so changing this is semver major.\n // For now when you opt-in to autoDestroy we allow\n // the error to be emitted nextTick. In a future\n // semver major update we should change the default to this.\n\n var rState = stream._readableState;\n var wState = stream._writableState;\n if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy,\n errorOrDestroy: errorOrDestroy\n};","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n callback.apply(this, args);\n };\n}\nfunction noop() {}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction eos(stream, opts, callback) {\n if (typeof opts === 'function') return eos(stream, null, opts);\n if (!opts) opts = {};\n callback = once(callback || noop);\n var readable = opts.readable || opts.readable !== false && stream.readable;\n var writable = opts.writable || opts.writable !== false && stream.writable;\n var onlegacyfinish = function onlegacyfinish() {\n if (!stream.writable) onfinish();\n };\n var writableEnded = stream._writableState && stream._writableState.finished;\n var onfinish = function onfinish() {\n writable = false;\n writableEnded = true;\n if (!readable) callback.call(stream);\n };\n var readableEnded = stream._readableState && stream._readableState.endEmitted;\n var onend = function onend() {\n readable = false;\n readableEnded = true;\n if (!writable) callback.call(stream);\n };\n var onerror = function onerror(err) {\n callback.call(stream, err);\n };\n var onclose = function onclose() {\n var err;\n if (readable && !readableEnded) {\n if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n if (writable && !writableEnded) {\n if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n };\n var onrequest = function onrequest() {\n stream.req.on('finish', onfinish);\n };\n if (isRequest(stream)) {\n stream.on('complete', onfinish);\n stream.on('abort', onclose);\n if (stream.req) onrequest();else stream.on('request', onrequest);\n } else if (writable && !stream._writableState) {\n // legacy streams\n stream.on('end', onlegacyfinish);\n stream.on('close', onlegacyfinish);\n }\n stream.on('end', onend);\n stream.on('finish', onfinish);\n if (opts.error !== false) stream.on('error', onerror);\n stream.on('close', onclose);\n return function () {\n stream.removeListener('complete', onfinish);\n stream.removeListener('abort', onclose);\n stream.removeListener('request', onrequest);\n if (stream.req) stream.req.removeListener('finish', onfinish);\n stream.removeListener('end', onlegacyfinish);\n stream.removeListener('close', onlegacyfinish);\n stream.removeListener('finish', onfinish);\n stream.removeListener('end', onend);\n stream.removeListener('error', onerror);\n stream.removeListener('close', onclose);\n };\n}\nmodule.exports = eos;","module.exports = function () {\n throw new Error('Readable.from is not available in the browser')\n};\n","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar eos;\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n callback.apply(void 0, arguments);\n };\n}\nvar _require$codes = require('../../../errors').codes,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\nfunction noop(err) {\n // Rethrow the error if it exists to avoid swallowing it\n if (err) throw err;\n}\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction destroyer(stream, reading, writing, callback) {\n callback = once(callback);\n var closed = false;\n stream.on('close', function () {\n closed = true;\n });\n if (eos === undefined) eos = require('./end-of-stream');\n eos(stream, {\n readable: reading,\n writable: writing\n }, function (err) {\n if (err) return callback(err);\n closed = true;\n callback();\n });\n var destroyed = false;\n return function (err) {\n if (closed) return;\n if (destroyed) return;\n destroyed = true;\n\n // request.destroy just do .end - .abort is what we want\n if (isRequest(stream)) return stream.abort();\n if (typeof stream.destroy === 'function') return stream.destroy();\n callback(err || new ERR_STREAM_DESTROYED('pipe'));\n };\n}\nfunction call(fn) {\n fn();\n}\nfunction pipe(from, to) {\n return from.pipe(to);\n}\nfunction popCallback(streams) {\n if (!streams.length) return noop;\n if (typeof streams[streams.length - 1] !== 'function') return noop;\n return streams.pop();\n}\nfunction pipeline() {\n for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n streams[_key] = arguments[_key];\n }\n var callback = popCallback(streams);\n if (Array.isArray(streams[0])) streams = streams[0];\n if (streams.length < 2) {\n throw new ERR_MISSING_ARGS('streams');\n }\n var error;\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1;\n var writing = i > 0;\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err;\n if (err) destroys.forEach(call);\n if (reading) return;\n destroys.forEach(call);\n callback(error);\n });\n });\n return streams.reduce(pipe);\n}\nmodule.exports = pipeline;","'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n return Math.floor(hwm);\n }\n\n // Default value\n return state.objectMode ? 16 : 16 * 1024;\n}\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};","module.exports = require('events').EventEmitter;\n","exports = module.exports = require('./lib/_stream_readable.js');\nexports.Stream = exports;\nexports.Readable = exports;\nexports.Writable = require('./lib/_stream_writable.js');\nexports.Duplex = require('./lib/_stream_duplex.js');\nexports.Transform = require('./lib/_stream_transform.js');\nexports.PassThrough = require('./lib/_stream_passthrough.js');\nexports.finished = require('./lib/internal/streams/end-of-stream.js');\nexports.pipeline = require('./lib/internal/streams/pipeline.js');\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\n'use strict';\n\n/*<replacement>*/\n\nvar Buffer = require('safe-buffer').Buffer;\n/*</replacement>*/\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n encoding = '' + encoding;\n switch (encoding && encoding.toLowerCase()) {\n case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw':\n return true;\n default:\n return false;\n }\n};\n\nfunction _normalizeEncoding(enc) {\n if (!enc) return 'utf8';\n var retried;\n while (true) {\n switch (enc) {\n case 'utf8':\n case 'utf-8':\n return 'utf8';\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return 'utf16le';\n case 'latin1':\n case 'binary':\n return 'latin1';\n case 'base64':\n case 'ascii':\n case 'hex':\n return enc;\n default:\n if (retried) return; // undefined\n enc = ('' + enc).toLowerCase();\n retried = true;\n }\n }\n};\n\n// Do not cache `Buffer.isEncoding` when checking encoding names as some\n// modules monkey-patch it to support additional encodings\nfunction normalizeEncoding(enc) {\n var nenc = _normalizeEncoding(enc);\n if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n return nenc || enc;\n}\n\n// StringDecoder provides an interface for efficiently splitting a series of\n// buffers into a series of JS strings without breaking apart multi-byte\n// characters.\nexports.StringDecoder = StringDecoder;\nfunction StringDecoder(encoding) {\n this.encoding = normalizeEncoding(encoding);\n var nb;\n switch (this.encoding) {\n case 'utf16le':\n this.text = utf16Text;\n this.end = utf16End;\n nb = 4;\n break;\n case 'utf8':\n this.fillLast = utf8FillLast;\n nb = 4;\n break;\n case 'base64':\n this.text = base64Text;\n this.end = base64End;\n nb = 3;\n break;\n default:\n this.write = simpleWrite;\n this.end = simpleEnd;\n return;\n }\n this.lastNeed = 0;\n this.lastTotal = 0;\n this.lastChar = Buffer.allocUnsafe(nb);\n}\n\nStringDecoder.prototype.write = function (buf) {\n if (buf.length === 0) return '';\n var r;\n var i;\n if (this.lastNeed) {\n r = this.fillLast(buf);\n if (r === undefined) return '';\n i = this.lastNeed;\n this.lastNeed = 0;\n } else {\n i = 0;\n }\n if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n return r || '';\n};\n\nStringDecoder.prototype.end = utf8End;\n\n// Returns only complete characters in a Buffer\nStringDecoder.prototype.text = utf8Text;\n\n// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\nStringDecoder.prototype.fillLast = function (buf) {\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n this.lastNeed -= buf.length;\n};\n\n// Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a\n// continuation byte. If an invalid byte is detected, -2 is returned.\nfunction utf8CheckByte(byte) {\n if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) return 3;else if (byte >> 3 === 0x1E) return 4;\n return byte >> 6 === 0x02 ? -1 : -2;\n}\n\n// Checks at most 3 bytes at the end of a Buffer in order to detect an\n// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4)\n// needed to complete the UTF-8 character (if applicable) are returned.\nfunction utf8CheckIncomplete(self, buf, i) {\n var j = buf.length - 1;\n if (j < i) return 0;\n var nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 1;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 2;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) {\n if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n }\n return nb;\n }\n return 0;\n}\n\n// Validates as many continuation bytes for a multi-byte UTF-8 character as\n// needed or are available. If we see a non-continuation byte where we expect\n// one, we \"replace\" the validated continuation bytes we've seen so far with\n// a single UTF-8 replacement character ('\\ufffd'), to match v8's UTF-8 decoding\n// behavior. The continuation byte check is included three times in the case\n// where all of the continuation bytes for a character exist in the same buffer.\n// It is also done this way as a slight performance increase instead of using a\n// loop.\nfunction utf8CheckExtraBytes(self, buf, p) {\n if ((buf[0] & 0xC0) !== 0x80) {\n self.lastNeed = 0;\n return '\\ufffd';\n }\n if (self.lastNeed > 1 && buf.length > 1) {\n if ((buf[1] & 0xC0) !== 0x80) {\n self.lastNeed = 1;\n return '\\ufffd';\n }\n if (self.lastNeed > 2 && buf.length > 2) {\n if ((buf[2] & 0xC0) !== 0x80) {\n self.lastNeed = 2;\n return '\\ufffd';\n }\n }\n }\n}\n\n// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\nfunction utf8FillLast(buf) {\n var p = this.lastTotal - this.lastNeed;\n var r = utf8CheckExtraBytes(this, buf, p);\n if (r !== undefined) return r;\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, p, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, p, 0, buf.length);\n this.lastNeed -= buf.length;\n}\n\n// Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a\n// partial character, the character's bytes are buffered until the required\n// number of bytes are available.\nfunction utf8Text(buf, i) {\n var total = utf8CheckIncomplete(this, buf, i);\n if (!this.lastNeed) return buf.toString('utf8', i);\n this.lastTotal = total;\n var end = buf.length - (total - this.lastNeed);\n buf.copy(this.lastChar, 0, end);\n return buf.toString('utf8', i, end);\n}\n\n// For UTF-8, a replacement character is added when ending on a partial\n// character.\nfunction utf8End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + '\\ufffd';\n return r;\n}\n\n// UTF-16LE typically needs two bytes per character, but even if we have an even\n// number of bytes available, we need to check if we end on a leading/high\n// surrogate. In that case, we need to wait for the next two bytes in order to\n// decode the last character properly.\nfunction utf16Text(buf, i) {\n if ((buf.length - i) % 2 === 0) {\n var r = buf.toString('utf16le', i);\n if (r) {\n var c = r.charCodeAt(r.length - 1);\n if (c >= 0xD800 && c <= 0xDBFF) {\n this.lastNeed = 2;\n this.lastTotal = 4;\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n return r.slice(0, -1);\n }\n }\n return r;\n }\n this.lastNeed = 1;\n this.lastTotal = 2;\n this.lastChar[0] = buf[buf.length - 1];\n return buf.toString('utf16le', i, buf.length - 1);\n}\n\n// For UTF-16LE we do not explicitly append special replacement characters if we\n// end on a partial character, we simply let v8 handle that.\nfunction utf16End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) {\n var end = this.lastTotal - this.lastNeed;\n return r + this.lastChar.toString('utf16le', 0, end);\n }\n return r;\n}\n\nfunction base64Text(buf, i) {\n var n = (buf.length - i) % 3;\n if (n === 0) return buf.toString('base64', i);\n this.lastNeed = 3 - n;\n this.lastTotal = 3;\n if (n === 1) {\n this.lastChar[0] = buf[buf.length - 1];\n } else {\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n }\n return buf.toString('base64', i, buf.length - n);\n}\n\nfunction base64End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed);\n return r;\n}\n\n// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\nfunction simpleWrite(buf) {\n return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n return buf && buf.length ? this.write(buf) : '';\n}","var nextTick = require('process/browser.js').nextTick;\nvar apply = Function.prototype.apply;\nvar slice = Array.prototype.slice;\nvar immediateIds = {};\nvar nextImmediateId = 0;\n\n// DOM APIs, for completeness\n\nexports.setTimeout = function() {\n return new Timeout(apply.call(setTimeout, window, arguments), clearTimeout);\n};\nexports.setInterval = function() {\n return new Timeout(apply.call(setInterval, window, arguments), clearInterval);\n};\nexports.clearTimeout =\nexports.clearInterval = function(timeout) { timeout.close(); };\n\nfunction Timeout(id, clearFn) {\n this._id = id;\n this._clearFn = clearFn;\n}\nTimeout.prototype.unref = Timeout.prototype.ref = function() {};\nTimeout.prototype.close = function() {\n this._clearFn.call(window, this._id);\n};\n\n// Does not start the time, just sets up the members needed.\nexports.enroll = function(item, msecs) {\n clearTimeout(item._idleTimeoutId);\n item._idleTimeout = msecs;\n};\n\nexports.unenroll = function(item) {\n clearTimeout(item._idleTimeoutId);\n item._idleTimeout = -1;\n};\n\nexports._unrefActive = exports.active = function(item) {\n clearTimeout(item._idleTimeoutId);\n\n var msecs = item._idleTimeout;\n if (msecs >= 0) {\n item._idleTimeoutId = setTimeout(function onTimeout() {\n if (item._onTimeout)\n item._onTimeout();\n }, msecs);\n }\n};\n\n// That's not how node.js implements it but the exposed api is the same.\nexports.setImmediate = typeof setImmediate === \"function\" ? setImmediate : function(fn) {\n var id = nextImmediateId++;\n var args = arguments.length < 2 ? false : slice.call(arguments, 1);\n\n immediateIds[id] = true;\n\n nextTick(function onNextTick() {\n if (immediateIds[id]) {\n // fn.call() is faster so we optimize for the common use-case\n // @see http://jsperf.com/call-apply-segu\n if (args) {\n fn.apply(null, args);\n } else {\n fn.call(null);\n }\n // Prevent ids from leaking\n exports.clearImmediate(id);\n }\n });\n\n return id;\n};\n\nexports.clearImmediate = typeof clearImmediate === \"function\" ? clearImmediate : function(id) {\n delete immediateIds[id];\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\n'use strict';\n\nvar punycode = require('punycode');\nvar util = require('./util');\n\nexports.parse = urlParse;\nexports.resolve = urlResolve;\nexports.resolveObject = urlResolveObject;\nexports.format = urlFormat;\n\nexports.Url = Url;\n\nfunction Url() {\n this.protocol = null;\n this.slashes = null;\n this.auth = null;\n this.host = null;\n this.port = null;\n this.hostname = null;\n this.hash = null;\n this.search = null;\n this.query = null;\n this.pathname = null;\n this.path = null;\n this.href = null;\n}\n\n// Reference: RFC 3986, RFC 1808, RFC 2396\n\n// define these here so at least they only have to be\n// compiled once on the first module load.\nvar protocolPattern = /^([a-z0-9.+-]+:)/i,\n portPattern = /:[0-9]*$/,\n\n // Special case for a simple path URL\n simplePathPattern = /^(\\/\\/?(?!\\/)[^\\?\\s]*)(\\?[^\\s]*)?$/,\n\n // RFC 2396: characters reserved for delimiting URLs.\n // We actually just auto-escape these.\n delims = ['<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t'],\n\n // RFC 2396: characters not allowed for various reasons.\n unwise = ['{', '}', '|', '\\\\', '^', '`'].concat(delims),\n\n // Allowed by RFCs, but cause of XSS attacks. Always escape these.\n autoEscape = ['\\''].concat(unwise),\n // Characters that are never ever allowed in a hostname.\n // Note that any invalid chars are also handled, but these\n // are the ones that are *expected* to be seen, so we fast-path\n // them.\n nonHostChars = ['%', '/', '?', ';', '#'].concat(autoEscape),\n hostEndingChars = ['/', '?', '#'],\n hostnameMaxLen = 255,\n hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/,\n hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/,\n // protocols that can allow \"unsafe\" and \"unwise\" chars.\n unsafeProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that never have a hostname.\n hostlessProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that always contain a // bit.\n slashedProtocol = {\n 'http': true,\n 'https': true,\n 'ftp': true,\n 'gopher': true,\n 'file': true,\n 'http:': true,\n 'https:': true,\n 'ftp:': true,\n 'gopher:': true,\n 'file:': true\n },\n querystring = require('querystring');\n\nfunction urlParse(url, parseQueryString, slashesDenoteHost) {\n if (url && util.isObject(url) && url instanceof Url) return url;\n\n var u = new Url;\n u.parse(url, parseQueryString, slashesDenoteHost);\n return u;\n}\n\nUrl.prototype.parse = function(url, parseQueryString, slashesDenoteHost) {\n if (!util.isString(url)) {\n throw new TypeError(\"Parameter 'url' must be a string, not \" + typeof url);\n }\n\n // Copy chrome, IE, opera backslash-handling behavior.\n // Back slashes before the query string get converted to forward slashes\n // See: https://code.google.com/p/chromium/issues/detail?id=25916\n var queryIndex = url.indexOf('?'),\n splitter =\n (queryIndex !== -1 && queryIndex < url.indexOf('#')) ? '?' : '#',\n uSplit = url.split(splitter),\n slashRegex = /\\\\/g;\n uSplit[0] = uSplit[0].replace(slashRegex, '/');\n url = uSplit.join(splitter);\n\n var rest = url;\n\n // trim before proceeding.\n // This is to support parse stuff like \" http://foo.com \\n\"\n rest = rest.trim();\n\n if (!slashesDenoteHost && url.split('#').length === 1) {\n // Try fast path regexp\n var simplePath = simplePathPattern.exec(rest);\n if (simplePath) {\n this.path = rest;\n this.href = rest;\n this.pathname = simplePath[1];\n if (simplePath[2]) {\n this.search = simplePath[2];\n if (parseQueryString) {\n this.query = querystring.parse(this.search.substr(1));\n } else {\n this.query = this.search.substr(1);\n }\n } else if (parseQueryString) {\n this.search = '';\n this.query = {};\n }\n return this;\n }\n }\n\n var proto = protocolPattern.exec(rest);\n if (proto) {\n proto = proto[0];\n var lowerProto = proto.toLowerCase();\n this.protocol = lowerProto;\n rest = rest.substr(proto.length);\n }\n\n // figure out if it's got a host\n // user@server is *always* interpreted as a hostname, and url\n // resolution will treat //foo/bar as host=foo,path=bar because that's\n // how the browser resolves relative URLs.\n if (slashesDenoteHost || proto || rest.match(/^\\/\\/[^@\\/]+@[^@\\/]+/)) {\n var slashes = rest.substr(0, 2) === '//';\n if (slashes && !(proto && hostlessProtocol[proto])) {\n rest = rest.substr(2);\n this.slashes = true;\n }\n }\n\n if (!hostlessProtocol[proto] &&\n (slashes || (proto && !slashedProtocol[proto]))) {\n\n // there's a hostname.\n // the first instance of /, ?, ;, or # ends the host.\n //\n // If there is an @ in the hostname, then non-host chars *are* allowed\n // to the left of the last @ sign, unless some host-ending character\n // comes *before* the @-sign.\n // URLs are obnoxious.\n //\n // ex:\n // http://a@b@c/ => user:a@b host:c\n // http://a@b?@c => user:a host:c path:/?@c\n\n // v0.12 TODO(isaacs): This is not quite how Chrome does things.\n // Review our test case against browsers more comprehensively.\n\n // find the first instance of any hostEndingChars\n var hostEnd = -1;\n for (var i = 0; i < hostEndingChars.length; i++) {\n var hec = rest.indexOf(hostEndingChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n\n // at this point, either we have an explicit point where the\n // auth portion cannot go past, or the last @ char is the decider.\n var auth, atSign;\n if (hostEnd === -1) {\n // atSign can be anywhere.\n atSign = rest.lastIndexOf('@');\n } else {\n // atSign must be in auth portion.\n // http://a@b/c@d => host:b auth:a path:/c@d\n atSign = rest.lastIndexOf('@', hostEnd);\n }\n\n // Now we have a portion which is definitely the auth.\n // Pull that off.\n if (atSign !== -1) {\n auth = rest.slice(0, atSign);\n rest = rest.slice(atSign + 1);\n this.auth = decodeURIComponent(auth);\n }\n\n // the host is the remaining to the left of the first non-host char\n hostEnd = -1;\n for (var i = 0; i < nonHostChars.length; i++) {\n var hec = rest.indexOf(nonHostChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n // if we still have not hit it, then the entire thing is a host.\n if (hostEnd === -1)\n hostEnd = rest.length;\n\n this.host = rest.slice(0, hostEnd);\n rest = rest.slice(hostEnd);\n\n // pull out port.\n this.parseHost();\n\n // we've indicated that there is a hostname,\n // so even if it's empty, it has to be present.\n this.hostname = this.hostname || '';\n\n // if hostname begins with [ and ends with ]\n // assume that it's an IPv6 address.\n var ipv6Hostname = this.hostname[0] === '[' &&\n this.hostname[this.hostname.length - 1] === ']';\n\n // validate a little.\n if (!ipv6Hostname) {\n var hostparts = this.hostname.split(/\\./);\n for (var i = 0, l = hostparts.length; i < l; i++) {\n var part = hostparts[i];\n if (!part) continue;\n if (!part.match(hostnamePartPattern)) {\n var newpart = '';\n for (var j = 0, k = part.length; j < k; j++) {\n if (part.charCodeAt(j) > 127) {\n // we replace non-ASCII char with a temporary placeholder\n // we need this to make sure size of hostname is not\n // broken by replacing non-ASCII by nothing\n newpart += 'x';\n } else {\n newpart += part[j];\n }\n }\n // we test again with ASCII char only\n if (!newpart.match(hostnamePartPattern)) {\n var validParts = hostparts.slice(0, i);\n var notHost = hostparts.slice(i + 1);\n var bit = part.match(hostnamePartStart);\n if (bit) {\n validParts.push(bit[1]);\n notHost.unshift(bit[2]);\n }\n if (notHost.length) {\n rest = '/' + notHost.join('.') + rest;\n }\n this.hostname = validParts.join('.');\n break;\n }\n }\n }\n }\n\n if (this.hostname.length > hostnameMaxLen) {\n this.hostname = '';\n } else {\n // hostnames are always lower case.\n this.hostname = this.hostname.toLowerCase();\n }\n\n if (!ipv6Hostname) {\n // IDNA Support: Returns a punycoded representation of \"domain\".\n // It only converts parts of the domain name that\n // have non-ASCII characters, i.e. it doesn't matter if\n // you call it with a domain that already is ASCII-only.\n this.hostname = punycode.toASCII(this.hostname);\n }\n\n var p = this.port ? ':' + this.port : '';\n var h = this.hostname || '';\n this.host = h + p;\n this.href += this.host;\n\n // strip [ and ] from the hostname\n // the host field still retains them, though\n if (ipv6Hostname) {\n this.hostname = this.hostname.substr(1, this.hostname.length - 2);\n if (rest[0] !== '/') {\n rest = '/' + rest;\n }\n }\n }\n\n // now rest is set to the post-host stuff.\n // chop off any delim chars.\n if (!unsafeProtocol[lowerProto]) {\n\n // First, make 100% sure that any \"autoEscape\" chars get\n // escaped, even if encodeURIComponent doesn't think they\n // need to be.\n for (var i = 0, l = autoEscape.length; i < l; i++) {\n var ae = autoEscape[i];\n if (rest.indexOf(ae) === -1)\n continue;\n var esc = encodeURIComponent(ae);\n if (esc === ae) {\n esc = escape(ae);\n }\n rest = rest.split(ae).join(esc);\n }\n }\n\n\n // chop off from the tail first.\n var hash = rest.indexOf('#');\n if (hash !== -1) {\n // got a fragment string.\n this.hash = rest.substr(hash);\n rest = rest.slice(0, hash);\n }\n var qm = rest.indexOf('?');\n if (qm !== -1) {\n this.search = rest.substr(qm);\n this.query = rest.substr(qm + 1);\n if (parseQueryString) {\n this.query = querystring.parse(this.query);\n }\n rest = rest.slice(0, qm);\n } else if (parseQueryString) {\n // no query string, but parseQueryString still requested\n this.search = '';\n this.query = {};\n }\n if (rest) this.pathname = rest;\n if (slashedProtocol[lowerProto] &&\n this.hostname && !this.pathname) {\n this.pathname = '/';\n }\n\n //to support http.request\n if (this.pathname || this.search) {\n var p = this.pathname || '';\n var s = this.search || '';\n this.path = p + s;\n }\n\n // finally, reconstruct the href based on what has been validated.\n this.href = this.format();\n return this;\n};\n\n// format a parsed object into a url string\nfunction urlFormat(obj) {\n // ensure it's an object, and not a string url.\n // If it's an obj, this is a no-op.\n // this way, you can call url_format() on strings\n // to clean up potentially wonky urls.\n if (util.isString(obj)) obj = urlParse(obj);\n if (!(obj instanceof Url)) return Url.prototype.format.call(obj);\n return obj.format();\n}\n\nUrl.prototype.format = function() {\n var auth = this.auth || '';\n if (auth) {\n auth = encodeURIComponent(auth);\n auth = auth.replace(/%3A/i, ':');\n auth += '@';\n }\n\n var protocol = this.protocol || '',\n pathname = this.pathname || '',\n hash = this.hash || '',\n host = false,\n query = '';\n\n if (this.host) {\n host = auth + this.host;\n } else if (this.hostname) {\n host = auth + (this.hostname.indexOf(':') === -1 ?\n this.hostname :\n '[' + this.hostname + ']');\n if (this.port) {\n host += ':' + this.port;\n }\n }\n\n if (this.query &&\n util.isObject(this.query) &&\n Object.keys(this.query).length) {\n query = querystring.stringify(this.query);\n }\n\n var search = this.search || (query && ('?' + query)) || '';\n\n if (protocol && protocol.substr(-1) !== ':') protocol += ':';\n\n // only the slashedProtocols get the //. Not mailto:, xmpp:, etc.\n // unless they had them to begin with.\n if (this.slashes ||\n (!protocol || slashedProtocol[protocol]) && host !== false) {\n host = '//' + (host || '');\n if (pathname && pathname.charAt(0) !== '/') pathname = '/' + pathname;\n } else if (!host) {\n host = '';\n }\n\n if (hash && hash.charAt(0) !== '#') hash = '#' + hash;\n if (search && search.charAt(0) !== '?') search = '?' + search;\n\n pathname = pathname.replace(/[?#]/g, function(match) {\n return encodeURIComponent(match);\n });\n search = search.replace('#', '%23');\n\n return protocol + host + pathname + search + hash;\n};\n\nfunction urlResolve(source, relative) {\n return urlParse(source, false, true).resolve(relative);\n}\n\nUrl.prototype.resolve = function(relative) {\n return this.resolveObject(urlParse(relative, false, true)).format();\n};\n\nfunction urlResolveObject(source, relative) {\n if (!source) return relative;\n return urlParse(source, false, true).resolveObject(relative);\n}\n\nUrl.prototype.resolveObject = function(relative) {\n if (util.isString(relative)) {\n var rel = new Url();\n rel.parse(relative, false, true);\n relative = rel;\n }\n\n var result = new Url();\n var tkeys = Object.keys(this);\n for (var tk = 0; tk < tkeys.length; tk++) {\n var tkey = tkeys[tk];\n result[tkey] = this[tkey];\n }\n\n // hash is always overridden, no matter what.\n // even href=\"\" will remove it.\n result.hash = relative.hash;\n\n // if the relative url is empty, then there's nothing left to do here.\n if (relative.href === '') {\n result.href = result.format();\n return result;\n }\n\n // hrefs like //foo/bar always cut to the protocol.\n if (relative.slashes && !relative.protocol) {\n // take everything except the protocol from relative\n var rkeys = Object.keys(relative);\n for (var rk = 0; rk < rkeys.length; rk++) {\n var rkey = rkeys[rk];\n if (rkey !== 'protocol')\n result[rkey] = relative[rkey];\n }\n\n //urlParse appends trailing / to urls like http://www.example.com\n if (slashedProtocol[result.protocol] &&\n result.hostname && !result.pathname) {\n result.path = result.pathname = '/';\n }\n\n result.href = result.format();\n return result;\n }\n\n if (relative.protocol && relative.protocol !== result.protocol) {\n // if it's a known url protocol, then changing\n // the protocol does weird things\n // first, if it's not file:, then we MUST have a host,\n // and if there was a path\n // to begin with, then we MUST have a path.\n // if it is file:, then the host is dropped,\n // because that's known to be hostless.\n // anything else is assumed to be absolute.\n if (!slashedProtocol[relative.protocol]) {\n var keys = Object.keys(relative);\n for (var v = 0; v < keys.length; v++) {\n var k = keys[v];\n result[k] = relative[k];\n }\n result.href = result.format();\n return result;\n }\n\n result.protocol = relative.protocol;\n if (!relative.host && !hostlessProtocol[relative.protocol]) {\n var relPath = (relative.pathname || '').split('/');\n while (relPath.length && !(relative.host = relPath.shift()));\n if (!relative.host) relative.host = '';\n if (!relative.hostname) relative.hostname = '';\n if (relPath[0] !== '') relPath.unshift('');\n if (relPath.length < 2) relPath.unshift('');\n result.pathname = relPath.join('/');\n } else {\n result.pathname = relative.pathname;\n }\n result.search = relative.search;\n result.query = relative.query;\n result.host = relative.host || '';\n result.auth = relative.auth;\n result.hostname = relative.hostname || relative.host;\n result.port = relative.port;\n // to support http.request\n if (result.pathname || result.search) {\n var p = result.pathname || '';\n var s = result.search || '';\n result.path = p + s;\n }\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n }\n\n var isSourceAbs = (result.pathname && result.pathname.charAt(0) === '/'),\n isRelAbs = (\n relative.host ||\n relative.pathname && relative.pathname.charAt(0) === '/'\n ),\n mustEndAbs = (isRelAbs || isSourceAbs ||\n (result.host && relative.pathname)),\n removeAllDots = mustEndAbs,\n srcPath = result.pathname && result.pathname.split('/') || [],\n relPath = relative.pathname && relative.pathname.split('/') || [],\n psychotic = result.protocol && !slashedProtocol[result.protocol];\n\n // if the url is a non-slashed url, then relative\n // links like ../.. should be able\n // to crawl up to the hostname, as well. This is strange.\n // result.protocol has already been set by now.\n // Later on, put the first path part into the host field.\n if (psychotic) {\n result.hostname = '';\n result.port = null;\n if (result.host) {\n if (srcPath[0] === '') srcPath[0] = result.host;\n else srcPath.unshift(result.host);\n }\n result.host = '';\n if (relative.protocol) {\n relative.hostname = null;\n relative.port = null;\n if (relative.host) {\n if (relPath[0] === '') relPath[0] = relative.host;\n else relPath.unshift(relative.host);\n }\n relative.host = null;\n }\n mustEndAbs = mustEndAbs && (relPath[0] === '' || srcPath[0] === '');\n }\n\n if (isRelAbs) {\n // it's absolute.\n result.host = (relative.host || relative.host === '') ?\n relative.host : result.host;\n result.hostname = (relative.hostname || relative.hostname === '') ?\n relative.hostname : result.hostname;\n result.search = relative.search;\n result.query = relative.query;\n srcPath = relPath;\n // fall through to the dot-handling below.\n } else if (relPath.length) {\n // it's relative\n // throw away the existing file, and take the new path instead.\n if (!srcPath) srcPath = [];\n srcPath.pop();\n srcPath = srcPath.concat(relPath);\n result.search = relative.search;\n result.query = relative.query;\n } else if (!util.isNullOrUndefined(relative.search)) {\n // just pull out the search.\n // like href='?foo'.\n // Put this after the other two cases because it simplifies the booleans\n if (psychotic) {\n result.hostname = result.host = srcPath.shift();\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost = result.host && result.host.indexOf('@') > 0 ?\n result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n result.search = relative.search;\n result.query = relative.query;\n //to support http.request\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path = (result.pathname ? result.pathname : '') +\n (result.search ? result.search : '');\n }\n result.href = result.format();\n return result;\n }\n\n if (!srcPath.length) {\n // no path at all. easy.\n // we've already handled the other stuff above.\n result.pathname = null;\n //to support http.request\n if (result.search) {\n result.path = '/' + result.search;\n } else {\n result.path = null;\n }\n result.href = result.format();\n return result;\n }\n\n // if a url ENDs in . or .., then it must get a trailing slash.\n // however, if it ends in anything else non-slashy,\n // then it must NOT get a trailing slash.\n var last = srcPath.slice(-1)[0];\n var hasTrailingSlash = (\n (result.host || relative.host || srcPath.length > 1) &&\n (last === '.' || last === '..') || last === '');\n\n // strip single dots, resolve double dots to parent dir\n // if the path tries to go above the root, `up` ends up > 0\n var up = 0;\n for (var i = srcPath.length; i >= 0; i--) {\n last = srcPath[i];\n if (last === '.') {\n srcPath.splice(i, 1);\n } else if (last === '..') {\n srcPath.splice(i, 1);\n up++;\n } else if (up) {\n srcPath.splice(i, 1);\n up--;\n }\n }\n\n // if the path is allowed to go above the root, restore leading ..s\n if (!mustEndAbs && !removeAllDots) {\n for (; up--; up) {\n srcPath.unshift('..');\n }\n }\n\n if (mustEndAbs && srcPath[0] !== '' &&\n (!srcPath[0] || srcPath[0].charAt(0) !== '/')) {\n srcPath.unshift('');\n }\n\n if (hasTrailingSlash && (srcPath.join('/').substr(-1) !== '/')) {\n srcPath.push('');\n }\n\n var isAbsolute = srcPath[0] === '' ||\n (srcPath[0] && srcPath[0].charAt(0) === '/');\n\n // put the host back\n if (psychotic) {\n result.hostname = result.host = isAbsolute ? '' :\n srcPath.length ? srcPath.shift() : '';\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost = result.host && result.host.indexOf('@') > 0 ?\n result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n\n mustEndAbs = mustEndAbs || (result.host && srcPath.length);\n\n if (mustEndAbs && !isAbsolute) {\n srcPath.unshift('');\n }\n\n if (!srcPath.length) {\n result.pathname = null;\n result.path = null;\n } else {\n result.pathname = srcPath.join('/');\n }\n\n //to support request.http\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path = (result.pathname ? result.pathname : '') +\n (result.search ? result.search : '');\n }\n result.auth = relative.auth || result.auth;\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n};\n\nUrl.prototype.parseHost = function() {\n var host = this.host;\n var port = portPattern.exec(host);\n if (port) {\n port = port[0];\n if (port !== ':') {\n this.port = port.substr(1);\n }\n host = host.substr(0, host.length - port.length);\n }\n if (host) this.hostname = host;\n};\n","'use strict';\n\nmodule.exports = {\n isString: function(arg) {\n return typeof(arg) === 'string';\n },\n isObject: function(arg) {\n return typeof(arg) === 'object' && arg !== null;\n },\n isNull: function(arg) {\n return arg === null;\n },\n isNullOrUndefined: function(arg) {\n return arg == null;\n }\n};\n","\n/**\n * Module exports.\n */\n\nmodule.exports = deprecate;\n\n/**\n * Mark that a method should not be used.\n * Returns a modified function which warns once by default.\n *\n * If `localStorage.noDeprecation = true` is set, then it is a no-op.\n *\n * If `localStorage.throwDeprecation = true` is set, then deprecated functions\n * will throw an Error when invoked.\n *\n * If `localStorage.traceDeprecation = true` is set, then deprecated functions\n * will invoke `console.trace()` instead of `console.error()`.\n *\n * @param {Function} fn - the function to deprecate\n * @param {String} msg - the string to print to the console when `fn` is invoked\n * @returns {Function} a new \"deprecated\" version of `fn`\n * @api public\n */\n\nfunction deprecate (fn, msg) {\n if (config('noDeprecation')) {\n return fn;\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (config('throwDeprecation')) {\n throw new Error(msg);\n } else if (config('traceDeprecation')) {\n console.trace(msg);\n } else {\n console.warn(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n}\n\n/**\n * Checks `localStorage` for boolean values for the given `name`.\n *\n * @param {String} name\n * @returns {Boolean}\n * @api private\n */\n\nfunction config (name) {\n // accessing global.localStorage can trigger a DOMException in sandboxed iframes\n try {\n if (!global.localStorage) return false;\n } catch (_) {\n return false;\n }\n var val = global.localStorage[name];\n if (null == val) return false;\n return String(val).toLowerCase() === 'true';\n}\n","// Returns a wrapper function that returns a wrapped callback\n// The wrapper function should do some stuff, and return a\n// presumably different callback function.\n// This makes sure that own properties are retained, so that\n// decorations and such are not lost along the way.\nmodule.exports = wrappy\nfunction wrappy (fn, cb) {\n if (fn && cb) return wrappy(fn)(cb)\n\n if (typeof fn !== 'function')\n throw new TypeError('need wrapper function')\n\n Object.keys(fn).forEach(function (k) {\n wrapper[k] = fn[k]\n })\n\n return wrapper\n\n function wrapper() {\n var args = new Array(arguments.length)\n for (var i = 0; i < args.length; i++) {\n args[i] = arguments[i]\n }\n var ret = fn.apply(this, args)\n var cb = args[args.length-1]\n if (typeof ret === 'function' && ret !== cb) {\n Object.keys(cb).forEach(function (k) {\n ret[k] = cb[k]\n })\n }\n return ret\n }\n}\n","module.exports = extend\n\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\nfunction extend() {\n var target = {}\n\n for (var i = 0; i < arguments.length; i++) {\n var source = arguments[i]\n\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n target[key] = source[key]\n }\n }\n }\n\n return target\n}\n","var libNPMModuleWrapper = require('./Fable.js');\n\nif ((typeof(window) === 'object') && !window.hasOwnProperty('Fable'))\n{\n\twindow.Fable = libNPMModuleWrapper;\n}\n\nmodule.exports = libNPMModuleWrapper;","const _OperationStatePrototype = JSON.stringify(\n{\n\t\"Metadata\": {\n\t\t\"GUID\": false,\n\t\t\"Hash\": false,\n\n\t\t\"Title\": \"\",\n\t\t\"Summary\": \"\",\n\n\t\t\"Version\": 0\n\t},\n\t\"Status\": {\n \"Completed\": false,\n\n \"CompletionProgress\": 0,\n \"CompletionTimeElapsed\": 0,\n\n \"Steps\": 1,\n \"StepsCompleted\": 0,\n\n \"StartTime\": 0,\n \"EndTime\": 0\n\t},\n\t\"Errors\": [],\n\t\"Log\": []\n});\n\nclass FableOperation\n{\n\tconstructor(pFable, pOperationName, pOperationHash)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.name = pOperationName;\n\n\t\tthis.state = JSON.parse(_OperationStatePrototype);\n\n\t\tthis.state.Metadata.GUID = this.fable.getUUID();\n\t\tthis.state.Metadata.Hash = this.state.GUID;\n\n\t\tif (typeof(pOperationHash) == 'string')\n\t\t{\n\t\t\tthis.state.Metadata.Hash = pOperationHash;\n\t\t}\n\t}\n\n\tget GUID()\n\t{\n\t\treturn this.state.Metadata.GUID;\n\t}\n\n\tget Hash()\n\t{\n\t\treturn this.state.Metadata.Hash;\n\t}\n\n\tget log()\n\t{\n\t\treturn this;\n\t}\n\n\twriteOperationLog(pLogLevel, pLogText, pLogObject)\n\t{\n\t\tthis.state.Log.push(`${new Date().toUTCString()} [${pLogLevel}]: ${pLogText}`);\n\n\t\tif (typeof(pLogObject) == 'object')\n\t\t{\n\t\t\tthis.state.Log.push(JSON.stringify(pLogObject));\n\t\t}\n\t}\n\n\twriteOperationErrors(pLogText, pLogObject)\n\t{\n\t\tthis.state.Errors.push(`${pLogText}`);\n\n\t\tif (typeof(pLogObject) == 'object')\n\t\t{\n\t\t\tthis.state.Errors.push(JSON.stringify(pLogObject));\n\t\t}\n\t}\n\n\ttrace(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('TRACE', pLogText, pLogObject);\n\t\tthis.fable.log.trace(pLogText, pLogObject);\n\t}\n\n\tdebug(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('DEBUG', pLogText, pLogObject);\n\t\tthis.fable.log.debug(pLogText, pLogObject);\n\t}\n\n\tinfo(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('INFO', pLogText, pLogObject);\n\t\tthis.fable.log.info(pLogText, pLogObject);\n\t}\n\n\twarn(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('WARN', pLogText, pLogObject);\n\t\tthis.fable.log.warn(pLogText, pLogObject);\n\t}\n\n\terror(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('ERROR', pLogText, pLogObject);\n\t\tthis.writeOperationErrors(pLogText, pLogObject);\n\t\tthis.fable.log.error(pLogText, pLogObject);\n\t}\n\n\tfatal(pLogText, pLogObject)\n\t{\n\t\tthis.writeOperationLog('FATAL', pLogText, pLogObject);\n\t\tthis.writeOperationErrors(pLogText, pLogObject);\n\t\tthis.fable.log.fatal(pLogText, pLogObject);\n\t}\n}\n\nmodule.exports = FableOperation;","/**\n* Fable Core Pre-initialization Service Base\n*\n* For a couple services, we need to be able to instantiate them before the Fable object is fully initialized.\n* This is a base class for those services.\n*\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\nclass FablePreinitServiceProviderBase\n{\n\tconstructor(pOptions, pServiceHash)\n\t{\n\t\tthis.fable = false;\n\n\t\tthis.options = (typeof(pOptions) === 'object') ? pOptions : {};\n\n this.serviceType = 'Unknown';\n\n\t\t// The hash will be a non-standard UUID ... the UUID service uses this base class!\n this.UUID = `CORESVC-${Math.floor((Math.random() * (99999 - 10000)) + 10000)}`;\n\n this.Hash = (typeof(pServiceHash) === 'string') ? pServiceHash : `${this.UUID}`;\n\t}\n\n\t// After fable is initialized, it would be expected to be wired in as a normal service.\n\tconnectFable(pFable)\n\t{\n\t\tthis.fable = pFable;\n\n\t\treturn true;\n\t}\n}\n\nmodule.exports = FablePreinitServiceProviderBase;","/**\n* Fable Application Services Management\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\nconst libFableServiceBase = require('./Fable-ServiceProviderBase.js');\n\nclass FableService\n{\n\tconstructor(pFable)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.serviceTypes = [];\n\n\t\t// A map of instantiated services\n\t\tthis.services = {};\n\n\t\t// A map of the default instantiated service by type\n\t\tthis.defaultServices = {};\n\n\t\t// A map of class constructors for services\n\t\tthis.serviceClasses = {};\n\t}\n\n\taddServiceType(pServiceType, pServiceClass)\n\t{\n\t\t// Add the type to the list of types\n\t\tthis.serviceTypes.push(pServiceType);\n\n\t\t// Add the container for instantiated services to go in\n\t\tthis.services[pServiceType] = {};\n\n\t\tif ((typeof(pServiceClass) == 'function') && (pServiceClass.prototype instanceof libFableServiceBase))\n\t\t{\n\t\t\t// Add the class to the list of classes\n\t\t\tthis.serviceClasses[pServiceType] = pServiceClass;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Add the base class to the list of classes\n\t\t\tthis.serviceClasses[pServiceType] = libFableServiceBase;\n\t\t}\n\t}\n\n\tinstantiateServiceProvider(pServiceType, pOptions, pCustomServiceHash)\n\t{\n\t\t// Instantiate the service\n\t\tlet tmpService = this.instantiateServiceProviderWithoutRegistration(pServiceType, pOptions, pCustomServiceHash);\n\n\t\t// Add the service to the service map\n\t\tthis.services[pServiceType][tmpService.Hash] = tmpService;\n\n\t\t// If this is the first service of this type, make it the default\n\t\tif (!this.defaultServices.hasOwnProperty(pServiceType))\n\t\t{\n\t\t\tthis.defaultServices[pServiceType] = tmpService;\n\t\t}\n\n\t\treturn tmpService;\n\t}\n\n\t// Create a service provider but don't register it to live forever in fable.services\n\tinstantiateServiceProviderWithoutRegistration(pServiceType, pOptions, pCustomServiceHash)\n\t{\n\t\t// Instantiate the service\n\t\tlet tmpService = new this.serviceClasses[pServiceType](this.fable, pOptions, pCustomServiceHash);\n\t\treturn tmpService;\n\t}\n\n\t// Connect an initialized service provider that came before Fable was initialized\n\tconnectPreinitServiceProviderInstance(pServiceInstance)\n\t{\n\t\tlet tmpServiceType = pServiceInstance.serviceType;\n\t\tlet tmpServiceHash = pServiceInstance.Hash;\n\n\t\t// The service should already be instantiated, so just connect it to fable\n\t\tpServiceInstance.connectFable(this.fable);\n\n\t\tif (!this.services.hasOwnProperty(tmpServiceType))\n\t\t{\n\t\t\t// If the core service hasn't registered itself yet, create the service container for it.\n\t\t\t// This means you couldn't register another with this type unless it was later registered with a constructor class.\n\t\t\tthis.services[tmpServiceType] = {};\n\t\t}\n\t\t// Add the service to the service map\n\t\tthis.services[tmpServiceType][tmpServiceHash] = pServiceInstance;\n\n\t\t// If this is the first service of this type, make it the default\n\t\tif (!this.defaultServices.hasOwnProperty(tmpServiceType))\n\t\t{\n\t\t\tthis.defaultServices[tmpServiceType] = pServiceInstance;\n\t\t}\n\n\t\treturn pServiceInstance;\n\t}\n\n\tsetDefaultServiceInstantiation(pServiceType, pServiceHash)\n\t{\n\t\tif (this.services[pServiceType].hasOwnProperty(pServiceHash))\n\t\t{\n\t\t\tthis.defaultServices[pServiceType] = this.services[pServiceType][pServiceHash];\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n}\n\nmodule.exports = FableService;\n\nmodule.exports.ServiceProviderBase = libFableServiceBase;","/**\n* Fable Service Base\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\nclass FableServiceProviderBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tthis.fable = pFable;\n\n\t\tthis.options = (typeof(pOptions) === 'object') ? pOptions : {};\n\n this.serviceType = 'Unknown';\n\n this.UUID = pFable.getUUID();\n\n this.Hash = (typeof(pServiceHash) === 'string') ? pServiceHash : `${this.UUID}`;\n\t}\n}\n\nmodule.exports = FableServiceProviderBase;\n","/**\n* Fable Application Services Support Library\n* @license MIT\n* @author <steven@velozo.com>\n*/\n// Pre-init services\nconst libFableSettings = require('fable-settings');\nconst libFableUUID = require('fable-uuid');\nconst libFableLog = require('fable-log');\n\nconst libFablePreinitServiceProviderBase = require('./Fable-PreinitServiceProviderBase.js');\nconst libFableServiceManager = require('./Fable-ServiceManager.js');\n\n// Services\nconst libFableServiceDataArithmatic = require('./services/Fable-Service-DataArithmatic.js');\nconst libFableServiceMetaTemplate = require('./services/Fable-Service-MetaTemplate.js');\nconst libFableServiceRestClient = require('./services/Fable-Service-RestClient.js');\nconst libFableServiceTemplate = require('./services/Fable-Service-Template.js');\nconst libFableServiceUtility = require('./services/Fable-Service-Utility.js');\n\nconst libFableOperation = require('./Fable-Operation.js');\n\nclass Fable\n{\n\tconstructor(pSettings)\n\t{\n\t\tlet tmpSettings = new libFableSettings(pSettings);\n\n\t\tthis.settingsManager = tmpSettings;\n\n\t\t// Instantiate the UUID generator\n\t\tthis.libUUID = new libFableUUID(this.settingsManager.settings);\n\n\t\tthis.log = new libFableLog(this.settingsManager.settings);\n\t\tthis.log.initialize();\n\n\t\t// Built-in dependencies\n\t\tthis.Dependencies = (\n\t\t\t{\n\t\t\t\tprecedent: libFableSettings.precedent\n\t\t\t});\n\n\t\t// Location for Operation state\n\t\tthis.Operations = {};\n\n\t\tthis.serviceManager = new libFableServiceManager(this);\n\n\t\t// Initialize and instantiate the default baked-in Data Arithmatic service\n\t\tthis.serviceManager.addServiceType('DataArithmatic', libFableServiceDataArithmatic);\n\t\tthis.fable.serviceManager.instantiateServiceProvider('DataArithmatic', {}, 'Default-Service-DataArithmatic');\n\t\t// This service is passing through the data arithmatic library\n\t\tthis.DataArithmatic = this.serviceManager.defaultServices.DataArithmatic._DataArithmaticLibrary;\n\n\t\t// Initialize the template service\n\t\tthis.serviceManager.addServiceType('Template', libFableServiceTemplate);\n\n\t\t// Initialize the metatemplate service\n\t\tthis.serviceManager.addServiceType('MetaTemplate', libFableServiceMetaTemplate);\n\n\t\t// Initialize and instantiate the default baked-in Utility service\n\t\tthis.serviceManager.addServiceType('Utility', libFableServiceUtility)\n\t\tthis.fable.serviceManager.instantiateServiceProvider('Utility', {}, 'Default-Service-Utility');\n\t\tthis.Utility = this.serviceManager.defaultServices.Utility;\n\n\t\t// Add the REST Client service type\n\t\tthis.serviceManager.addServiceType('RestClient', libFableServiceRestClient);\n\n\t\tthis.services = this.serviceManager.services;\n\t\tthis.defaultServices = this.serviceManager.defaultServices;\n\t}\n\n\tget settings()\n\t{\n\t\treturn this.settingsManager.settings;\n\t}\n\n\tget fable()\n\t{\n\t\treturn this;\n\t}\n\n\tgetUUID()\n\t{\n\t\treturn this.libUUID.getUUID();\n\t}\n\n\tcreateOperation(pOperationName, pOperationHash)\n\t{\n\t\tlet tmpOperation = new libFableOperation(this, pOperationName, pOperationHash);\n\n\t\tif (this.Operations.hasOwnProperty(tmpOperation.Hash))\n\t\t{\n\t\t\t// Uh Oh ...... Operation Hash Collision!\n\t\t\t// TODO: What to do?!\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.Operations[tmpOperation.Hash] = tmpOperation;\n\t\t}\n\n\t\treturn tmpOperation;\n\t}\n\n\tgetOperation(pOperationHash)\n\t{\n\t\tif (!this.Operations.hasOwnProperty(pOperationHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn this.Operations[pOperationHash];\n\t\t}\n\t}\n}\n\n// This is for backwards compatibility\nfunction autoConstruct(pSettings)\n{\n\treturn new Fable(pSettings);\n}\n\nmodule.exports = Fable;\nmodule.exports.new = autoConstruct;\n\nmodule.exports.LogProviderBase = libFableLog.LogProviderBase;\nmodule.exports.ServiceProviderBase = libFableServiceManager.ServiceProviderBase;\nmodule.exports.PreinitServiceProviderBase = libFablePreinitServiceProviderBase;\n\nmodule.exports.precedent = libFableSettings.precedent;","const libFableServiceBase = require('../Fable-ServiceProviderBase.js');\n\nconst libDataArithmatic = require('data-arithmatic');\n\nclass FableServiceDataArithmatic extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'DataArithmatic';\n\n this._DataArithmaticLibrary = new libDataArithmatic();\n\t}\n}\n\nmodule.exports = FableServiceDataArithmatic;","const libFableServiceBase = require('../Fable-ServiceProviderBase.js');\n\nconst libPrecedent = require('precedent');\n\nclass FableServiceMetaTemplate extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'MetaTemplate';\n\n this._MetaTemplateLibrary = new libPrecedent(this.options);\n\t}\n\n\t/**\n\t * Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pTree - A node on the parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern(pPatternStart, pPatternEnd, pParser)\n\t{\n\t\treturn this._MetaTemplateLibrary.addPattern(pPatternStart, pPatternEnd, pParser);\n\t}\n\n\t/**\n\t * Parse a string with the existing parse tree\n\t * @method parseString\n\t * @param {string} pString - The string to parse\n\t * @return {string} The result from the parser\n\t */\n\tparseString(pString, pData)\n\t{\n\t\treturn this._MetaTemplateLibrary.parseString(pString, pData);\n\t}\n}\n\nmodule.exports = FableServiceMetaTemplate;","const libFableServiceBase = require('../Fable-ServiceProviderBase.js');\n\nconst libSimpleGet = require('simple-get');\n\nclass FableServiceRestClient extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'RestClient';\n\n this._SimpleGet = new libSimpleGet();\n\t}\n}\n\nmodule.exports = FableServiceRestClient;","const libFableServiceBase = require('../Fable-ServiceProviderBase.js');\n\nclass FableServiceTemplate extends libFableServiceBase\n{\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\t//\n\t// NOTE: This does not implement underscore escape expressions\n\t// NOTE: This does not implement underscore magic browser variable assignment\n\t//\n\t// This is an implementation of that.\n\t// TODO: Make this use precedent, add configuration, add debugging.\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'Template';\n\n\t\t// These are the exact regex's used in lodash/underscore\n\t\t// TODO: Switch this to precedent\n\t\tthis.Matchers = (\n\t\t\t{\n\t\t\t\tEvaluate: /<%([\\s\\S]+?)%>/g,\n\t\t\t\tInterpolate: /<%=([\\s\\S]+?)%>/g,\n\t\t\t\tEscaper: /\\\\|'|\\r|\\n|\\t|\\u2028|\\u2029/g,\n\t\t\t\tUnescaper: /\\\\(\\\\|'|r|n|t|u2028|u2029)/g,\n\t\t\t\t// This is how underscore does it, so we are keeping it for now.\n\t\t\t\tGuaranteedNonMatch: /.^/\n\t\t\t});\n\n\t\t// This is a helper for the escaper and unescaper functions.\n\t\t// Right now we are going to keep what underscore is doing, but, not forever.\n\t\tthis.templateEscapes = {\n\t\t\t'\\\\': '\\\\',\n\t\t\t\"'\": \"'\",\n\t\t\t'r': '\\r',\n\t\t\t'\\r': 'r',\n\t\t\t'n': '\\n',\n\t\t\t'\\n': 'n',\n\t\t\t't': '\\t',\n\t\t\t'\\t': 't',\n\t\t\t'u2028': '\\u2028',\n\t\t\t'\\u2028': 'u2028',\n\t\t\t'u2029': '\\u2029',\n\t\t\t'\\u2029': 'u2029'\n\t\t};\n\n\t\t// This is defined as such to underscore that it is a dynamic programming\n\t\t// function on this class.\n\t\tthis.renderFunction = false;\n this.templateString = false;\n\t}\n\n\trenderTemplate(pData)\n\t{\n\t\treturn this.renderFunction(pData);\n\t}\n\n\ttemplateFunction(pData)\n\t{\n\t\tlet fRenderTemplateBound = this.renderTemplate.bind(this);\n\t\treturn fRenderTemplateBound;\n\t}\n\n\tbuildTemplateFunction(pTemplateText, pData)\n\t{\n\t\t// For now this is being kept in a weird form ... this is to mimic the old\n\t\t// underscore code until this is rewritten using precedent.\n\t\tthis.TemplateSource = \"__p+='\" + pTemplateText\n\t\t\t.replace(this.Matchers.Escaper,\n\t\t\t\t(pMatch)=>\n\t\t\t\t{\n\t\t\t\t\treturn `\\\\${this.templateEscapes[pMatch]}`;\n\t\t\t\t})\n\t\t\t.replace(this.Matchers.Interpolate || this.Matchers.GuaranteedNonMatch,\n\t\t\t\t(pMatch, pCode) =>\n\t\t\t\t{\n\t\t\t\t\treturn `'+\\n(${decodeURIComponent(pCode)})+\\n'`;\n\t\t\t\t})\n\t\t\t.replace(this.Matchers.Evaluate || this.Matchers.GuaranteedNonMatch,\n\t\t\t\t(pMatch, pCode) =>\n\t\t\t\t{\n\t\t\t\t\treturn `';\\n${decodeURIComponent(pCode)}\\n;__p+='`;\n\t\t\t\t}) + `';\\n`;\n\n\n\t\tthis.TemplateSource = `with(pTemplateDataObject||{}){\\n${this.TemplateSource}}\\n`;\n\t\tthis.TemplateSource = `var __p='';var print=function(){__p+=Array.prototype.join.call(arguments, '')};\\n${this.TemplateSource}return __p;\\n`;\n\n\t\tthis.renderFunction = new Function('pTemplateDataObject', this.TemplateSource);\n\n\t\tif (typeof(pData) != 'undefined')\n\t\t{\n\t\t\treturn this.renderFunction(pData);\n\t\t}\n\n\t\t// Provide the compiled function source as a convenience for build time\n\t\t// precompilation.\n\t\tthis.TemplateSourceCompiled = 'function(obj){\\n' + this.TemplateSource + '}';\n\n\t\treturn this.templateFunction();\n\t}\n}\n\nmodule.exports = FableServiceTemplate;","const libFableServiceBase = require('../Fable-ServiceProviderBase.js');\n\n\n// TODO: These are still pretty big -- consider the smaller polyfills\nconst libAsyncWaterfall = require('async.waterfall');\nconst libAsyncEachLimit = require('async.eachlimit');\n\nclass FableServiceUtility extends libFableServiceBase\n{\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\t//\n\t// NOTE: This does not implement underscore escape expressions\n\t// NOTE: This does not implement underscore magic browser variable assignment\n\t//\n\t// This is an implementation of that.\n\t// TODO: Make this use precedent, add configuration, add debugging.\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n\t\tthis.templates = {};\n\n\t\t// These two functions are used extensively throughout\n\t\tthis.waterfall = libAsyncWaterfall;\n\t\tthis.eachLimit = libAsyncEachLimit;\n\t}\n\n\t// Underscore and lodash have a behavior, _.extend, which merges objects.\n\t// Now that es6 gives us this, use the native thingy.\n\textend(pDestinationObject, ...pSourceObjects)\n\t{\n\t\treturn Object.assign(pDestinationObject, ...pSourceObjects);\n\t}\n\n\t// Underscore and lodash have a behavior, _.template, which compiles a\n\t// string-based template with code snippets into simple executable pieces,\n\t// with the added twist of returning a precompiled function ready to go.\n\ttemplate(pTemplateText, pData)\n\t{\n\t\tlet tmpTemplate = this.fable.serviceManager.instantiateServiceProviderWithoutRegistration('Template');\n\n\t\treturn tmpTemplate.buildTemplateFunction(pTemplateText, pData);\n\t}\n\n\t// Build a template function from a template hash, and, register it with the service provider\n\tbuildHashedTemplate(pTemplateHash, pTemplateText, pData)\n\t{\n\t\tlet tmpTemplate = this.fable.serviceManager.instantiateServiceProvider('Template', {}, pTemplateHash);\n\n\t\tthis.templates[pTemplateHash] = tmpTemplate.buildTemplateFunction(pTemplateText, pData);\n\n\t\treturn this.templates[pTemplateHash];\n\t}\n\n\t// This is a safe, modern version of chunk from underscore\n\t// Algorithm pulled from a mix of these two polyfills:\n\t// https://github.com/you-dont-need/You-Dont-Need-Lodash-Underscore#_chunk\n\t// https://youmightnotneed.com/lodash\n\t// This implementation was most tolerant in browsers. Uglify can fix the rest.\n\tchunk (pInput, pChunkSize, pChunkCache)\n\t{\n\t\tlet tmpInputArray = [...pInput];\n\t\t// Note lodash defaults to 1, underscore defaults to 0\n\t\tlet tmpChunkSize = (typeof(pChunkSize) == 'number') ? pChunkSize : 0;\n\t\tlet tmpChunkCache = (typeof(pChunkCache) != 'undefined') ? pChunkCache : [];\n\n\t\tif (tmpChunkSize <= 0)\n\t\t{\n\t\t\treturn tmpChunkCache;\n\t\t}\n\n\t\twhile (tmpInputArray.length)\n\t\t{\n\t\t\ttmpChunkCache.push(tmpInputArray.splice(0, tmpChunkSize));\n\t\t}\n\n\t\treturn tmpChunkCache;\n\t}\n}\n\nmodule.exports = FableServiceUtility;"]}