fable 3.0.86 → 3.0.87

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 (34) hide show
  1. package/debug/Harness.js +8 -10
  2. package/package.json +2 -2
  3. package/retold-harness/bookstore-serve-api.js +2 -2
  4. package/source/Fable.js +187 -50
  5. package/source/services/Fable-Service-Anticipate.js +1 -1
  6. package/source/services/Fable-Service-DataGeneration.js +1 -1
  7. package/source/services/Fable-Service-EnvironmentData-Web.js +1 -1
  8. package/source/services/Fable-Service-EnvironmentData.js +1 -1
  9. package/source/services/Fable-Service-FilePersistence-Web.js +2 -1
  10. package/source/services/Fable-Service-FilePersistence.js +25 -7
  11. package/source/services/Fable-Service-MetaTemplate.js +1 -1
  12. package/source/services/Fable-Service-Operation-DefaultSettings.js +4 -6
  13. package/source/services/Fable-Service-Operation.js +97 -2
  14. package/source/services/Fable-Service-RestClient.js +1 -1
  15. package/source/services/Fable-Service-Template.js +1 -1
  16. package/source/services/Fable-Service-Utility.js +3 -3
  17. package/test/Anticipate_tests.js +2 -2
  18. package/test/CSVParser_tests.js +1 -1
  19. package/test/Cache_tests.js +1 -1
  20. package/test/DataGeneration_tests.js +7 -7
  21. package/test/DateManipulation_tests.js +1 -1
  22. package/test/FableOperation_tests.js +33 -4
  23. package/test/FableServiceManager_tests.js +51 -51
  24. package/test/FilePersistence_tests.js +9 -9
  25. package/test/Manifest_tests.js +1 -1
  26. package/test/MetaTemplating_tests.js +1 -1
  27. package/test/RestClient_test.js +6 -6
  28. package/dist/fable.compatible.js +0 -3353
  29. package/dist/fable.compatible.min.js +0 -12
  30. package/dist/fable.compatible.min.js.map +0 -1
  31. package/dist/fable.js +0 -3353
  32. package/dist/fable.min.js +0 -12
  33. package/dist/fable.min.js.map +0 -1
  34. package/source/Fable-ServiceManager.js +0 -164
package/dist/fable.compatible.min.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"sources":["fable.compatible.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/big.js/big.js","node_modules/buffer/index.js","node_modules/builtin-status-codes/browser.js","node_modules/cachetrax/source/CacheTrax.js","node_modules/cachetrax/source/LinkedList-Node.js","node_modules/cachetrax/source/LinkedList.js","node_modules/call-bind/callBound.js","node_modules/call-bind/index.js","node_modules/cookie/index.js","node_modules/dayjs/dayjs.min.js","node_modules/dayjs/plugin/advancedFormat.js","node_modules/dayjs/plugin/isoWeek.js","node_modules/dayjs/plugin/relativeTime.js","node_modules/dayjs/plugin/timezone.js","node_modules/dayjs/plugin/utc.js","node_modules/dayjs/plugin/weekOfYear.js","node_modules/dayjs/plugin/weekday.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-serviceproviderbase/source/Fable-ServiceProviderBase-Preinit.js","node_modules/fable-serviceproviderbase/source/Fable-ServiceProviderBase.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/function-bind/implementation.js","node_modules/function-bind/index.js","node_modules/get-intrinsic/index.js","node_modules/has-proto/index.js","node_modules/has-symbols/index.js","node_modules/has-symbols/shams.js","node_modules/has/src/index.js","node_modules/https-browserify/index.js","node_modules/ieee754/index.js","node_modules/inherits/inherits_browser.js","node_modules/manyfest/source/Manyfest-CleanWrapCharacters.js","node_modules/manyfest/source/Manyfest-HashTranslation.js","node_modules/manyfest/source/Manyfest-LogToConsole.js","node_modules/manyfest/source/Manyfest-ObjectAddress-CheckAddressExists.js","node_modules/manyfest/source/Manyfest-ObjectAddress-DeleteValue.js","node_modules/manyfest/source/Manyfest-ObjectAddress-GetValue.js","node_modules/manyfest/source/Manyfest-ObjectAddress-SetValue.js","node_modules/manyfest/source/Manyfest-ObjectAddressGeneration.js","node_modules/manyfest/source/Manyfest-ParseConditionals.js","node_modules/manyfest/source/Manyfest-SchemaManipulation.js","node_modules/manyfest/source/Manyfest.js","node_modules/object-inspect/index.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/qs/lib/formats.js","node_modules/qs/lib/index.js","node_modules/qs/lib/parse.js","node_modules/qs/lib/stringify.js","node_modules/qs/lib/utils.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/side-channel/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/util-deprecate/browser.js","node_modules/wrappy/wrappy.js","node_modules/xtend/immutable.js","source/Fable-ServiceManager.js","source/Fable.js","source/services/Fable-Service-Anticipate.js","source/services/Fable-Service-CSVParser.js","source/services/Fable-Service-DataFormat.js","source/services/Fable-Service-DataGeneration-DefaultValues.json","source/services/Fable-Service-DataGeneration.js","source/services/Fable-Service-DateManipulation.js","source/services/Fable-Service-EnvironmentData.js","source/services/Fable-Service-FilePersistence.js","source/services/Fable-Service-MetaTemplate.js","source/services/Fable-Service-MetaTemplate/MetaTemplate-StringParser.js","source/services/Fable-Service-MetaTemplate/MetaTemplate-WordTree.js","source/services/Fable-Service-Operation-DefaultSettings.js","source/services/Fable-Service-Operation.js","source/services/Fable-Service-RestClient.js","source/services/Fable-Service-Template.js","source/services/Fable-Service-Utility.js"],"names":["_toConsumableArray","arr","_arrayWithoutHoles","_iterableToArray","_unsupportedIterableToArray","_nonIterableSpread","TypeError","o","minLen","_arrayLikeToArray","n","Object","prototype","toString","call","slice","constructor","name","Array","from","test","iter","Symbol","iterator","isArray","len","length","i","arr2","_defineProperty2","obj","key","value","_toPropertyKey2","defineProperty","enumerable","configurable","writable","_get","Reflect","get","bind","target","property","receiver","base","_superPropBase","desc","getOwnPropertyDescriptor","arguments","apply","this","object","hasOwnProperty","_getPrototypeOf","_classCallCheck2","instance","Constructor","_defineProperties","props","descriptor","_createClass2","protoProps","staticProps","arg","_toPrimitive2","_typeof","String","input","hint","prim","toPrimitive","undefined","res","Number","_inherits","subClass","superClass","create","_setPrototypeOf","p","setPrototypeOf","__proto__","_createSuper","Derived","hasNativeReflectConstruct","_isNativeReflectConstruct","result","Super","NewTarget","construct","_possibleConstructorReturn","self","_assertThisInitialized","ReferenceError","sham","Proxy","Boolean","valueOf","e","getPrototypeOf","f","exports","module","define","amd","window","global","Fable","r","t","c","require","u","a","Error","code","eachOfLimit","withoutIndex","limit","cb","tasks","makeCallback","index","fn","next","once","noop","onlyOnce","keyIterator","nextKey","done","running","errored","replenish","err","setImmediate","restParam","args","callback","pop","push","innerArgs","sync","_keys","isArrayLike","coll","keys","k","func","startIndex","Math","max","rest","_setImmediate","fallback","setTimeout","timers","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","GLOBAL","Big","MAX_DP","MAX_POWER","NAME","INVALID","INVALID_DP","INVALID_RM","DIV_BY_ZERO","P","UNDEFINED","NUMERIC","round","x","sd","rm","more","xc","RM","unshift","stringify","doExponential","isNonzero","s","charAt","abs","cmp","y","isneg","yc","j","l","div","b","dp","DP","bl","bt","ri","bz","ai","al","rl","q","qc","qi","shift","eq","gt","gte","lt","lte","minus","sub","xlty","plus","xe","ye","reverse","mod","ygtx","times","neg","add","pow","one","prec","sqrt","half","toExponential","mul","toFixed","toJSON","NE","PE","toNumber","strict","toPrecision","_Big_","nl","replace","search","substring","parse","roundDown","roundHalfUp","roundHalfEven","roundUp","dup","Buffer","base64","ieee754","SlowBuffer","alloc","INSPECT_MAX_BYTES","K_MAX_LENGTH","createBuffer","RangeError","buf","encodingOrOffset","allocUnsafe","string","encoding","isEncoding","actual","write","fromString","ArrayBuffer","isView","fromArrayLike","isInstance","buffer","array","byteOffset","fromArrayBuffer","isBuffer","checked","copy","numberIsNaN","type","data","fromObject","assertSize","size","mustMatch","loweredCase","utf8ToBytes","base64ToBytes","toLowerCase","slowToString","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","swap","m","bidirectionalIndexOf","val","dir","arrayIndexOf","lastIndexOf","indexSize","arrLength","valLength","read","readUInt16BE","foundIndex","found","hexWrite","offset","remaining","strLen","parsed","parseInt","substr","utf8Write","blitBuffer","asciiWrite","str","byteArray","asciiToBytes","latin1Write","base64Write","ucs2Write","units","hi","lo","utf16leToBytes","min","secondByte","thirdByte","fourthByte","tempCodePoint","firstByte","codePoint","bytesPerSequence","codePoints","MAX_ARGUMENTS_LENGTH","fromCharCode","decodeCodePointsArray","kMaxLength","TYPED_ARRAY_SUPPORT","foo","typedArraySupport","console","error","species","poolSize","fill","allocUnsafeSlow","_isBuffer","compare","list","pos","swap16","swap32","swap64","toLocaleString","equals","inspect","trim","thisStart","thisEnd","thisCopy","targetCopy","includes","isFinite","_arr","ret","out","toHex","bytes","checkOffset","ext","checkInt","checkIEEE754","writeFloat","littleEndian","noAssert","writeDouble","newBuf","subarray","readUIntLE","readUIntBE","readUInt8","readUInt16LE","readUInt32LE","readUInt32BE","readIntLE","readIntBE","readInt8","readInt16LE","readInt16BE","readInt32LE","readInt32BE","readFloatLE","readFloatBE","readDoubleLE","readDoubleBE","writeUIntLE","writeUIntBE","writeUInt8","writeUInt16LE","writeUInt16BE","writeUInt32LE","writeUInt32BE","writeIntLE","writeIntBE","writeInt8","writeInt16LE","writeInt16BE","writeInt32LE","writeInt32BE","writeFloatLE","writeFloatBE","writeDoubleLE","writeDoubleBE","targetStart","copyWithin","set","INVALID_BASE64_RE","Infinity","leadSurrogate","split","base64clean","src","dst","libFableServiceProviderBase","libLinkedList","CashMoney","_libFableServiceProvi","_super","pFable","pManifest","pServiceHash","_this3","serviceType","_HashMap","_RecordMap","_List","maxLength","maxAge","pData","pHash","Datum","tmpNode","Hash","Metadata","Created","Date","remove","put","fComplete","pRemovedRecords","tmpRemovedRecords","tmpNow","tmpKeys","expire","fPruneFunction","_this4","pruneBasedOnExpiration","fExpirationPruneComplete","pruneBasedOnLength","LinkedListNode","LeftNode","RightNode","__ISNODE","libLinkedListNode","LinkedList","totalNodes","head","tail","pDatum","tmpHash","initializeNode","append","pNode","fAction","_this5","fIterator","pError","pNodeIndex","GetIntrinsic","callBind","$indexOf","allowMissing","intrinsic","$apply","$call","$reflectApply","$gOPD","$defineProperty","$max","originalFunction","applyBind","options","dec","decode","eqIdx","endIdx","tryDecode","serialize","opt","enc","encode","fieldContentRegExp","isNaN","floor","domain","path","expires","__toString","isDate","toUTCString","httpOnly","secure","priority","sameSite","decodeURIComponent","encodeURIComponent","h","d","$","M","weekdays","months","ordinal","v","z","utcOffset","date","year","month","clone","ceil","w","D","ms","Q","g","S","_","O","locale","$L","utc","$u","$x","$offset","$d","NaN","match","UTC","init","$y","getFullYear","$M","getMonth","$D","getDate","$W","getDay","$H","getHours","$m","getMinutes","$s","getSeconds","$ms","getMilliseconds","$utils","isValid","isSame","startOf","endOf","isAfter","isBefore","$g","unix","getTime","toDate","$locale","weekStart","$set","daysInMonth","subtract","format","invalidDate","meridiem","monthsShort","weekdaysMin","weekdaysShort","getTimezoneOffset","diff","toISOString","forEach","extend","$i","isDayjs","en","Ls","globalThis","dayjs","weekYear","isoWeekYear","week","isoWeek","offsetName","dayjs_plugin_advancedFormat","isoWeekday","day","dayjs_plugin_isoWeek","future","past","mm","hh","dd","MM","yy","fromToBase","relativeTime","thresholds","rounding","to","toNow","fromNow","dayjs_plugin_relativeTime","hour","minute","second","timeZoneName","Intl","DateTimeFormat","hour12","timeZone","formatToParts","tz","$timezone","guess","find","resolvedOptions","setDefault","dayjs_plugin_timezone","local","getUTCFullYear","getUTCMonth","getUTCDate","getUTCDay","getUTCHours","getUTCMinutes","getUTCSeconds","getUTCMilliseconds","$localOffset","isUTC","dayjs_plugin_utc","yearStart","weeks","dayjs_plugin_weekOfYear","weekday","dayjs_plugin_weekday","ReflectOwnKeys","R","ReflectApply","Function","ownKeys","getOwnPropertySymbols","getOwnPropertyNames","NumberIsNaN","EventEmitter","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","newListener","emit","warned","count","warn","onceWrapper","fired","wrapFn","_onceWrap","state","wrapped","_listeners","unwrap","evlistener","unwrapListeners","arrayClone","listenerCount","addEventListener","wrapListener","removeEventListener","setMaxListeners","getMaxListeners","doError","er","message","context","listeners","addListener","prependListener","prependOnceListener","position","originalListener","spliceOne","off","removeAllListeners","rawListeners","eventNames","BaseLogger","_libFableServiceProvi2","_super2","pLogStreamSettings","pLogStreamHash","_this6","_Settings","loggerUUID","generateInsecureUUID","levels","tmpDate","pCharacter","tmpRandomData","random","pLogText","pLogObject","pLogLevel","CoreServiceProviderBase","tmpDefaultProviders","loggertype","streamtype","level","ConsoleLogger","_libBaseLogger","_super3","pFableLog","_this7","_ShowTimeStamps","showtimestamps","_FormattedTimeStamps","formattedtimestamps","_ContextMessage","Context","Product","_OutputLogLinesToConsole","outputloglinestoconsole","_OutputObjectsToConsole","outputobjectstoconsole","prefixCache","pLevel","pObject","tmpTimeStamp","tmpLogLine","log","JSON","libConsoleLog","libFS","libPath","SimpleFlatFileLogger","_libConsoleLog","_super4","_this8","logFileRawPath","logFilePath","normalize","logFileStreamOptions","fileStreamOptions","fileWriter","createWriteStream","activelyWriting","logLineStrings","logObjectStrings","defaultWriteCompleteCallback","defaultBufferFlushCallback","fCloseComplete","tmpCloseComplete","fFlushComplete","tmpFlushComplete","flushBufferToLogFile","tmpLineStrings","tmpObjectStrings","tmpConstructedBufferOutputString","completeBufferFlushToLogFile","fs","FableLog","_libFableServiceProvi3","_super5","pSettings","_this9","tmpSettings","_Providers","_StreamDefinitions","LogStreams","logStreams","logProviders","activeLogStreams","logStreamsTrace","logStreamsDebug","logStreamsInfo","logStreamsWarn","logStreamsError","logStreamsFatal","datumDecorator","uuid","pLogger","fDatumDecorator","pMessage","tmpDecoratedDatum","trace","debug","info","fatal","tmpStreamDefinition","assign","addLogger","initialize","tmpMessage","tmpTime","pTimeStamp","pTimeDelta","tmpEndTime","tmpMs","tmpSeconds","tmpMinutes","tmpHours","pStartTime","logTimeDelta","getTimeDelta","logTimeDeltaHuman","LogProviderBase","LogProviderConsole","LogProviderFlatfile","FableCoreServiceProviderBase","pOptions","fable","UUID","FableServiceProviderBase","isFable","getUUID","servicesMap","services","ProductVersion","ConfigFile","process","libPrecedent","FableSettingsTemplateProcessor","pDependencies","templateProcessor","addPattern","pTemplateValue","tmpTemplateValue","tmpSeparatorIndex","tmpDefaultValue","tmpEnvironmentVariableName","env","pString","parseString","_process","precedent","libFableSettingsTemplateProcessor","FableSettings","_libFableServiceProvi4","_super6","_this10","settingsTemplateProcessor","_configureEnvTemplating","buildDefaultSettings","merge","DefaultConfigFile","pException","settings","_PerformEnvTemplating","NoEnvReplacement","tmpKey","_resolveEnv","parseSetting","toObject","_this11","_isObject","fromValue","toValue","_deepMergeObjects","pSettingsFrom","pSettingsTo","tmpSettingsFrom","tmpSettingsTo","tmpSettingsFromCopy","RandomBytes","getRandomValues","crypto","msCrypto","tmpBuffer","tmpValue","generateWhatWGBytes","generateRandomBytes","libRandomByteGenerator","FableUUID","_libFableServiceProvi5","_super7","_this12","_UUIDModeRandom","UUIDModeRandom","_UUIDLength","UUIDLength","_UUIDRandomDictionary","UUIDDictionary","randomByteGenerator","_HexLookup","pBuffer","tmpRandomBytes","generate","bytesToUUID","tmpUUID","generateRandom","generateUUIDv4","toStr","bound","boundLength","boundArgs","Empty","implementation","$SyntaxError","SyntaxError","$Function","$TypeError","getEvalledConstructor","expressionSyntax","throwTypeError","ThrowTypeError","calleeThrows","gOPDthrows","hasSymbols","hasProto","getProto","needsEval","TypedArray","INTRINSICS","AggregateError","Atomics","BigInt","BigInt64Array","BigUint64Array","DataView","decodeURI","encodeURI","eval","EvalError","Float32Array","Float64Array","FinalizationRegistry","Int8Array","Int16Array","Int32Array","Map","parseFloat","RegExp","Set","SharedArrayBuffer","Uint8ClampedArray","Uint16Array","Uint32Array","URIError","WeakMap","WeakRef","WeakSet","errorProto","doEval","gen","LEGACY_ALIASES","hasOwn","$concat","$spliceApply","splice","$replace","$strSlice","$exec","exec","rePropName","reEscapeChar","getBaseIntrinsic","alias","intrinsicName","first","last","number","quote","subString","stringToPath","intrinsicBaseName","intrinsicRealName","skipFurtherCaching","isOwn","part","has","$Object","origSymbol","hasSymbolSham","sym","symObj","syms","propertyIsEnumerable","http","url","https","validateParams","params","protocol","request","isLE","mLen","nBytes","eLen","eMax","eBias","nBits","rt","LN2","ctor","superCtor","super_","TempCtor","startsWith","endsWith","libSimpleLog","ManyfestHashTranslation","pInfoLog","pErrorLog","logInfo","logError","translationTable","pTranslation","_this13","pTranslationSource","pTranslationHash","_this14","removeTranslationHash","removeTranslation","pLogLine","ManyfestObjectAddressResolverCheckAddressExists","pAddress","tmpBracketStartIndex","tmpBracketStopIndex","tmpBoxedPropertyName","tmpBoxedPropertyReference","tmpBoxedPropertyNumber","cleanWrapCharacters","tmpSubObjectName","tmpNewAddress","checkAddressExists","fCleanWrapCharacters","fParseConditionals","ManyfestObjectAddressResolverDeleteValue","pRecord","pParentAddress","tmpParentAddress","tmpObjectTypeMarkerIndex","tmpInputArray","checkFilters","tmpObjectPropertyName","deleteValueAtAddress","tmpArrayProperty","tmpContainerObject","tmpPropertyParentAddress","tmpObjectProperty","tmpObjectPropertyKeys","ManyfestObjectAddressResolverGetValue","pRootObject","tmpRootObject","tmpParentAddressParts","tmpBackNavigationCount","tmpParentAddressLength","tmpRecurseAddress","getValueAtAddress","tmpOutputArray","ManyfestObjectAddressSetValue","pValue","setValueAtAddress","ManyfestObjectAddressGeneration","pBaseAddress","pSchema","tmpBaseAddress","tmpSchema","tmpObjectType","tmpSchemaObjectEntry","Address","Name","InSchema","DataType","Default","generateAddressses","tmpObjectProperties","_ConditionalStanzaStart","_ConditionalStanzaEnd","testCondition","pManyfest","pSearchAddress","pSearchComparator","tmpKeepRecord","tmpStartIndex","tmpStopIndex","tmpMagicComparisonPatternSet","tmpSearchAddress","tmpSearchComparator","tmpSearchValue","ManyfestSchemaManipulation","pManyfestSchemaDescriptors","pAddressMapping","tmpManyfestAddresses","tmpHashMapping","pInputAddress","tmpNewDescriptorAddress","tmpOldDescriptorAddress","tmpDescriptor","tmpManyfestSchemaDescriptors","resolveAddressMappings","pManyfestSchemaDescriptorsDestination","pManyfestSchemaDescriptorsSource","tmpSource","tmpNewManyfestSchemaDescriptors","pDescriptorAddress","libHashTranslation","libObjectAddressCheckAddressExists","libObjectAddressGetValue","libObjectAddressSetValue","libObjectAddressDeleteValue","libObjectAddressGeneration","libSchemaManipulation","_DefaultConfiguration","Scope","Descriptors","Manyfest","_libFableServiceProvi6","_super8","_this15","objectAddressCheckAddressExists","objectAddressGetValue","objectAddressSetValue","objectAddressDeleteValue","defaultValues","Float","Integer","Binary","DateTime","Null","scope","elementAddresses","elementHashes","elementDescriptors","reset","loadManifest","schemaManipulations","objectAddressGeneration","hashTranslations","tmpNewOptions","tmpNewManyfest","getManifest","addTranslation","pManifestString","tmpManifest","tmpDescriptorKeys","tmpDescriptionAddresses","addDescriptor","HashTranslations","pDescriptor","getDescriptor","resolveHashAddress","tmpDescriptorAddresses","tmpInElementHashTable","tmpInTranslationTable","translate","getDefaultValue","getDescriptorByHash","tmpValidationData","Errors","MissingElements","addValidationError","pErrorMessage","tmpValueExists","Required","tmpElementType","tmpDataType","pOverwriteProperties","populateObject","fFilter","_this16","tmpObject","tmpOverwriteProperties","tmpFilterFunction","hasMap","mapSizeDescriptor","mapSize","mapForEach","hasSet","setSizeDescriptor","setSize","setForEach","weakMapHas","weakSetHas","weakRefDeref","deref","booleanValueOf","objectToString","functionToString","$match","$slice","$toUpperCase","toUpperCase","$toLowerCase","$test","$join","$arrSlice","$floor","bigIntValueOf","gOPS","symToString","hasShammedSymbols","toStringTag","isEnumerable","gPO","addNumericSeparator","sepRegex","int","intStr","utilInspect","inspectCustom","custom","inspectSymbol","isSymbol","wrapQuotes","defaultStyle","opts","quoteChar","quoteStyle","isRegExp","inspect_","depth","seen","maxStringLength","customInspect","indent","numericSeparator","inspectString","bigIntStr","maxDepth","baseIndent","prev","getIndent","noIndent","newOpts","nameOf","arrObjKeys","symString","markBoxed","HTMLElement","nodeName","getAttribute","isElement","attrs","attributes","childNodes","xs","singleLineValues","indentedJoin","isError","cause","isMap","mapParts","collectionOf","isSet","setParts","isWeakMap","weakCollectionOf","isWeakSet","isWeakRef","isNumber","isBigInt","isBoolean","isString","ys","isPlainObject","protoTag","stringTag","tag","trailer","lowbyte","entries","lineJoiner","isArr","symMap","wrappy","called","onceStrict","onceError","proto","assertPath","normalizeStringPosix","allowAboveRoot","lastSegmentLength","lastSlash","dots","lastSlashIndex","posix","cwd","resolvedPath","resolvedAbsolute","isAbsolute","trailingSeparator","joined","relative","fromStart","fromEnd","fromLen","toStart","toLen","lastCommonSep","fromCode","_makeLong","dirname","hasRoot","matchedSlash","basename","extIdx","firstNonSlashEnd","extname","startDot","startPart","preDotState","pathObject","sep","root","_format","delimiter","win32","libWordTree","libStringParser","Precedent","WordTree","StringParser","ParseTree","pPatternStart","pPatternEnd","pParser","pParseTree","Asynchronous","Output","OutputBuffer","Pattern","PatternMatch","PatternMatchEnd","pParserState","flushOutputBuffer","PatternStartNode","StartPatternMatchComplete","EndPatternMatchBegan","appendOutputBuffer","PatternEnd","Parse","PatternStartString","PatternEndString","resetOutputBuffer","tmpParserState","newParserState","parseCharacter","pTree","pPattern","fParser","tmpLeaf","addChild","tmpPatternEnd","addEndChild","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","mapDomain","ucs2decode","extra","counter","ucs2encode","digitToBasic","digit","flag","adapt","delta","numPoints","firstTime","basic","oldi","baseMinusT","inputLength","bias","handledCPCount","basicLength","currentValue","handledCPCountPlusOne","qMinusT","ucs2","toASCII","toUnicode","percentTwenties","Format","default","formatters","RFC1738","RFC3986","formats","utils","defaults","allowDots","allowPrototypes","allowSparse","arrayLimit","charset","charsetSentinel","comma","decoder","ignoreQueryPrefix","interpretNumericEntities","parameterLimit","parseArrays","plainObjects","strictNullHandling","$0","numberStr","parseArrayValue","parseKeys","givenKey","valuesParsed","child","segment","parent","chain","leaf","cleanRoot","parseObject","normalizeParseOptions","tempObj","cleanStr","skipIndex","bracketEqualsPos","maybeMap","encodedVal","combine","parseValues","newObj","compact","getSideChannel","arrayPrefixGenerators","brackets","prefix","indices","repeat","pushToArray","valueOrArray","toISO","defaultFormat","addQueryPrefix","encoder","encodeValuesOnly","formatter","serializeDate","skipNulls","sentinel","generateArrayPrefix","commaRoundTrip","filter","sort","sideChannel","tmpSc","step","findFlag","objKeys","values","adjustedPrefix","keyPrefix","valueSideChannel","normalizeStringifyOptions","arrayFormat","hexTable","arrayToObject","source","reduce","acc","prop","refs","item","compacted","compactQueue","strWithoutPlus","unescape","defaultEncoder","kind","escape","mapped","mergeTarget","targetItem","qs","regexp","maxKeys","kstr","vstr","idx","stringifyPrimitive","objectKeys","ks","copyProps","SafeBuffer","callBound","$WeakMap","$Map","$weakMapGet","$weakMapSet","$weakMapHas","$mapGet","$mapSet","$mapHas","listGetNode","curr","$wm","$o","channel","assert","objects","node","listGet","listHas","listSet","stream","chunks","chunk","simpleGet","decompressResponse","querystring","isStream","pipe","maxRedirects","_url$parse","hostname","port","auth","body","headers","json","form","method","accept","originalHost","req","followRedirects","statusCode","location","host","resume","redirectHost","cookie","authorization","tryUnzip","abort","ClientRequest","response","statusCodes","defaultProtocol","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","reader","getReader","_pos","responseURL","getAllResponseHeaders","matches","_charset","mimeType","charsetMatch","_read","responseText","newData","MSStreamReader","onload","readAsArrayBuffer","codes","createErrorType","Base","NodeError","_Base","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","_destroy","readableAddChunk","addToFront","skipChunkCheck","emitReadable","emitReadable_","onEofChunk","chunkInvalid","_uint8ArrayToBuffer","addChunk","maybeReadMore","_undestroy","undestroy","isPaused","setEncoding","content","clear","MAX_HWM","howMuchToRead","computeNewHighWaterMark","flow","maybeReadMore_","updateReadableListening","nReadingNextTick","resume_","fromList","consume","endReadable","endReadableNT","wState","finished","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","doWrite","onwriteDrain","holder","allBuffers","isBuf","callFinal","need","rState","current","hasInstance","writeAfterEnd","validChunk","newChunk","decodeChunk","writeOrBuffer","cork","uncork","setDefaultEncoding","endWritable","_Object$setPrototypeO","_defineProperty","_toPrimitive","_toPropertyKey","kLastResolve","kLastReject","kError","kEnded","kLastPromise","kHandlePromise","kStream","createIterResult","readAndResolve","onReadable","AsyncIteratorPrototype","ReadableStreamAsyncIteratorPrototype","promise","lastPromise","wrapForNext","_this2","_Object$create","enumerableOnly","symbols","_objectSpread","getOwnPropertyDescriptors","defineProperties","_classCallCheck","hasStrings","_getString","_getBuffer","nb","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","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","msecs","_idleTimeoutId","_idleTimeout","unenroll","_unrefActive","active","_onTimeout","Url","slashes","hash","query","pathname","href","protocolPattern","portPattern","simplePathPattern","unwise","autoEscape","nonHostChars","hostEndingChars","hostnamePartPattern","hostnamePartStart","unsafeProtocol","javascript","hostlessProtocol","slashedProtocol","ftp","gopher","file","urlParse","parseQueryString","slashesDenoteHost","queryIndex","splitter","uSplit","simplePath","lowerProto","atSign","hostEnd","hec","parseHost","ipv6Hostname","hostparts","newpart","validParts","notHost","bit","ae","esc","qm","resolveObject","rel","tkeys","tk","tkey","rkeys","rk","rkey","relPath","isSourceAbs","isRelAbs","mustEndAbs","removeAllDots","srcPath","psychotic","authInHost","hasTrailingSlash","up","config","localStorage","wrapper","libFableServiceBase","FableService","_libFableServiceBase$","_super9","_this17","serviceTypes","serviceClasses","extraServiceInitialization","pServiceType","pServiceClass","isFableService","addServiceType","instantiateServiceProvider","pCustomServiceHash","pServicePrototype","tmpService","setDefaultServiceInstantiation","instantiateServiceProviderWithoutRegistration","pServiceInstance","tmpServiceType","tmpServiceHash","connectFable","ServiceProviderBase","libFableSettings","libFableUUID","libFableLog","libFableServiceManager","_coreServices","SettingsManager","Logging","ServiceManager","serviceManager","connectPreinitServiceProviderInstance","addAndInstantiateServiceType","cachetrax","manyfest","FableServiceAnticipate","_libFableServiceBase","_super10","_this18","operationQueue","erroredOperations","executingOperationCount","completedOperationCount","maxOperations","lastError","waitingFunctions","tmpOperation","buildAnticipatorCallback","fAsynchronousFunction","checkQueue","tmpCallbackState","Called","OperationSet","fCallback","CSVParser","_libFableServiceProvi7","_super11","_this19","Header","HeaderFieldNames","Delimiter","QuoteCharacter","CleanCharacters","HeaderLineIndex","HasHeader","HasSetHeader","EmitHeader","EmitJSON","EscapedQuoteString","CurrentLine","CurrentRecord","InQuote","InEscapedQuote","LinesParsed","RowsEmitted","pRowArray","pHeaderArray","pFormatAsJSON","tmpFormatAsJSON","tmpCompletedRecord","marshalRowToJSON","pLineString","pushLine","emitRow","DataFormat","_libFableServiceProvi8","_super12","_this20","pTargetLength","pPadString","tmpString","stringGeneratePaddingString","_Regex_formatterInsertCommas","_Regex_formatterAddCommasToNumber","_Regex_formatterDollarsRemoveCommas","_Regex_formatterCleanNonAlphaChar","_Regex_formatterCapitalizeEachWord","_Value_MoneySign_Currency","_Value_NaN_Currency","_Value_GroupSeparator_Number","_Value_Prefix_StringHash","_Value_Clean_formatterCleanNonAlpha","_UseEngineStringStartsWith","_UseEngineStringEndsWith","pSearchString","pStartIndex","stringStartsWith_Polyfill","pEndIndex","stringEndsWith_Polyfill","tmpStringLength","tmpCharacterIndex","pMatch","pWrapCharacter","tmpReversedWithCommas","stringReverse","pSign","pZeros","pBefore","pDecimal","pAfter","formatterInsertCommas","pNumber","processAddCommasToNumberRegex","tmpDollarAmount","Utility","bigNumber","formatterAddCommasToNumber","pDigits","tmpDigits","tmpTargetLength","tmpPadString","tmpPadLength","pTimeSpan","stringPadStart","pTimeStart","pTimeEnd","formatTimeSpan","pJavascriptDate","pStrict","tmpStrict","tmpMonth","tmpDay","tmpYear","pDate","tmpStringSplitLocation","pEnclosureStart","pEnclosureEnd","tmpEnclosureStart","tmpEnclosureEnd","tmpEnclosureCount","tmpEnclosureDepth","pEnclosureIndexToGet","tmpEnclosureIndexToGet","tmpMatchedEnclosureIndex","tmpEnclosedValueStartIndex","tmpEnclosedValueEndIndex","pEnclosureIndexToRemove","tmpEnclosureIndexToRemove","tmpEnclosureStartIndex","tmpEnclosureEndIndex","tmpReturnString","DefaultIntegerMinimum","DefaultIntegerMaximum","DefaultNumericStringLength","MonthSet","WeekDaySet","ColorSet","SurNameSet","NameSet","FableServiceDataGeneration","_libFableServiceBase2","_super13","_this21","defaultData","pMinimum","pMaximum","randomIntegerBetween","pLength","pMaxNumber","tmpLength","tmpMaxNumber","randomIntegerUpTo","DateManipulation","_libFableServiceProvi9","_super14","_this22","dayJS","plugin_weekOfYear","plugin_weekday","plugin_isoWeek","plugin_timezone","plugin_relativetime","plugin_utc","plugin_advancedFormat","FableServiceEnvironmentData","_libFableServiceBase3","_super15","_this23","Environment","libReadline","FableServiceFilePersistence","_libFableServiceBase4","_super16","_this24","Mode","pPath","existsSync","pFileName","pFileContent","tmpOptions","writeFileSync","pAppendContent","appendFileSync","unlinkSync","rmdirSync","pFileArray","pFilePath","fOnLine","fOnComplete","fOnError","tmpLineReader","filePath","fileStream","createReadStream","createInterface","crlfDelay","pParameters","_this25","tmpParameters","Path","CurrentPathIndex","ActualPath","ActualPathParts","CurrentPath","pFileDescriptor","closeSync","makeFolderRecursive","mkdir","pCreateError","readline","FableServiceMetaTemplate","_libFableServiceBase5","_super17","_this26","eachLimit","pParserPromise","addPatternAsync","fEachLimit","isAsync","_this27","pAsyncOutput","PatternStart","_this28","fCharacterCallback","parseCharacterAsync","Title","Summary","Version","Status","Completed","CompletionProgress","CompletionTimeElapsed","Steps","StepsCompleted","StartTime","EndTime","Log","_OperationStatePrototypeString","FableOperation","_libFableServiceBase6","_super18","_this29","timeStamps","progressTrackers","writeOperationLog","writeOperationErrors","pTimeStampHash","tmpTimeStampHash","tmpOperationTime","pTotalOperations","pProgressTrackerHash","tmpProgressTrackerHash","tmpTotalOperations","tmpProgressTracker","createTimeStamp","CurrentTime","PercentComplete","AverageOperationTime","EstimatedCompletionTime","TotalCount","CurrentCount","createProgressTracker","pCurrentOperations","tmpCurrentOperations","solveProgressTrackerStatus","pIncrementSize","tmpIncrementSize","updateProgressTrackerStatus","libSimpleGet","libCookie","FableServiceRestClient","_libFableServiceBase7","_super19","_this30","TraceLog","dataFormat","prepareRequestOptions","pRequestOptions","tmpCookieObject","tmpCookieKeys","prepareCookies","_this31","preRequest","RequestStartTime","getTimeStamp","pResponse","tmpConnectTime","formatTimeDelta","tmpData","pChunk","tmpChunkTime","tmpCompletionTime","_this32","tmpDataBuffer","_this33","tmpJSONData","pOptionsOrURL","tmpRequestOptions","executeJSONRequest","executeChunkedRequest","FableServiceTemplate","_libFableServiceBase8","_super20","_this34","Matchers","Evaluate","Interpolate","Escaper","Unescaper","GuaranteedNonMatch","templateEscapes","u2028","u2029","renderFunction","templateString","renderTemplate","pTemplateText","_this35","TemplateSource","pCode","TemplateSourceCompiled","templateFunction","libAsyncWaterfall","libAsyncEachLimit","libBigNumber","FableServiceUtility","_libFableServiceBase9","_super21","_this36","templates","waterfall","pDestinationObject","tmpSourceObject","buildTemplateFunction","pTemplateHash","tmpTemplate","pInput","pChunkSize","pChunkCache","tmpChunkSize","tmpChunkCache","pISOString","tmpDateParts","tmpReturnDate","tmpTimeZoneOffsetInHours","tmpTimeZoneOffsetInMinutes","setUTCDate","setUTCMonth","setUTCHours","setUTCMinutes","setUTCSeconds","setUTCMilliseconds","setUTCFullYear","setHours"],"mappings":"AAAA,aAAa,SAASA,mBAAmBC,GAAK,OAAOC,mBAAmBD,IAAME,iBAAiBF,IAAMG,4BAA4BH,IAAMI,oBAAqB,CAAC,SAASA,qBAAqB,MAAM,IAAIC,UAAU,uIAAwI,CAAC,SAASF,4BAA4BG,EAAEC,GAAQ,GAAID,EAAJ,CAAa,GAAc,iBAAJA,EAAa,OAAOE,kBAAkBF,EAAEC,GAAQ,IAAIE,EAAEC,OAAOC,UAAUC,SAASC,KAAKP,GAAGQ,MAAM,GAAG,GAAuD,MAA7C,WAAJL,GAAcH,EAAES,cAAYN,EAAEH,EAAES,YAAYC,MAAY,QAAJP,GAAe,QAAJA,EAAiBQ,MAAMC,KAAKZ,GAAU,cAAJG,GAAiB,2CAA2CU,KAAKV,GAAUD,kBAAkBF,EAAEC,QAAlG,CAAhN,CAA0T,CAAC,SAASL,iBAAiBkB,GAAM,GAAmB,oBAATC,QAA6C,MAAvBD,EAAKC,OAAOC,WAAqC,MAApBF,EAAK,cAAoB,OAAOH,MAAMC,KAAKE,EAAM,CAAC,SAASnB,mBAAmBD,GAAK,GAAGiB,MAAMM,QAAQvB,GAAK,OAAOQ,kBAAkBR,EAAK,CAAC,SAASQ,kBAAkBR,EAAIwB,IAAa,MAALA,GAAWA,EAAIxB,EAAIyB,UAAOD,EAAIxB,EAAIyB,QAAO,IAAI,IAAIC,EAAE,EAAEC,EAAK,IAAIV,MAAMO,GAAKE,EAAEF,EAAIE,IAAIC,EAAKD,GAAG1B,EAAI0B,GAAG,OAAOC,CAAK,CAAC,SAASC,iBAAiBC,EAAIC,EAAIC,GAAkK,OAA3JD,EAAIE,gBAAgBF,MAAeD,EAAKnB,OAAOuB,eAAeJ,EAAIC,EAAI,CAACC,MAAMA,EAAMG,YAAW,EAAKC,cAAa,EAAKC,UAAS,IAAaP,EAAIC,GAAKC,EAAcF,CAAI,CAAC,SAASQ,OAA6U,OAAxRA,KAA1B,oBAAVC,SAAuBA,QAAQC,IAAUD,QAAQC,IAAIC,OAAkB,SAAcC,EAAOC,EAASC,GAAU,IAAIC,EAAKC,eAAeJ,EAAOC,GAAU,GAAIE,EAAJ,CAAgB,IAAIE,EAAKpC,OAAOqC,yBAAyBH,EAAKF,GAAU,OAAGI,EAAKP,IAAYO,EAAKP,IAAI1B,KAAKmC,UAAUvB,OAAO,EAAEgB,EAAOE,GAAkBG,EAAKf,KAA5I,CAAkJ,EAAUM,KAAKY,MAAMC,KAAKF,UAAW,CAAC,SAASH,eAAeM,EAAOT,GAAU,MAAOhC,OAAOC,UAAUyC,eAAevC,KAAKsC,EAAOT,IAAsD,QAA3CS,EAAOE,gBAAgBF,MAAgC,OAAOA,CAAO,CAAC,SAASG,iBAAiBC,EAASC,GAAa,KAAKD,aAAoBC,GAAc,MAAM,IAAInD,UAAU,oCAAsC,CAAC,SAASoD,kBAAkBhB,EAAOiB,GAAO,IAAI,IAAIhC,EAAE,EAAEA,EAAEgC,EAAMjC,OAAOC,IAAI,CAAC,IAAIiC,EAAWD,EAAMhC,GAAGiC,EAAWzB,WAAWyB,EAAWzB,aAAY,EAAMyB,EAAWxB,cAAa,EAAQ,UAAUwB,IAAWA,EAAWvB,UAAS,GAAK1B,OAAOuB,eAAeQ,EAAOT,gBAAgB2B,EAAW7B,KAAK6B,EAAY,CAAC,CAAC,SAASC,cAAcJ,EAAYK,EAAWC,GAAyM,OAAzLD,GAAWJ,kBAAkBD,EAAY7C,UAAUkD,GAAeC,GAAYL,kBAAkBD,EAAYM,GAAapD,OAAOuB,eAAeuB,EAAY,YAAY,CAACpB,UAAS,IAAeoB,CAAY,CAAC,SAASxB,gBAAgB+B,GAAK,IAAIjC,EAAIkC,cAAcD,EAAI,UAAU,MAAsB,WAAfE,QAAQnC,GAAgBA,EAAIoC,OAAOpC,EAAK,CAAC,SAASkC,cAAcG,EAAMC,GAAM,GAAoB,WAAjBH,QAAQE,IAA2B,OAARA,EAAa,OAAOA,EAAM,IAAIE,EAAKF,EAAM9C,OAAOiD,aAAa,QAAUC,IAAPF,EAAiB,CAAC,IAAIG,EAAIH,EAAKxD,KAAKsD,EAAMC,GAAM,WAAW,GAAkB,WAAfH,QAAQO,GAAgB,OAAOA,EAAI,MAAM,IAAInE,UAAU,+CAAgD,CAAC,OAAc,WAAP+D,EAAgBF,OAAOO,QAAQN,EAAO,CAAC,SAASO,UAAUC,EAASC,GAAY,GAAuB,mBAAbA,GAAsC,OAAbA,EAAmB,MAAM,IAAIvE,UAAU,sDAAuDsE,EAAShE,UAAUD,OAAOmE,OAAOD,GAAYA,EAAWjE,UAAU,CAACI,YAAY,CAACgB,MAAM4C,EAASvC,UAAS,EAAKD,cAAa,KAAQzB,OAAOuB,eAAe0C,EAAS,YAAY,CAACvC,UAAS,IAAWwC,GAAWE,gBAAgBH,EAASC,EAAY,CAAC,SAASE,gBAAgBxE,EAAEyE,GAA6H,OAA1HD,gBAAgBpE,OAAOsE,eAAetE,OAAOsE,eAAexC,OAAO,SAAyBlC,EAAEyE,GAAiB,OAAdzE,EAAE2E,UAAUF,EAASzE,CAAE,EAASwE,gBAAgBxE,EAAEyE,EAAG,CAAC,SAASG,aAAaC,GAAS,IAAIC,EAA0BC,4BAA4B,OAAO,WAAgC,IAAmCC,EAA/BC,EAAMlC,gBAAgB8B,GAAgB,GAAGC,EAA0B,CAAC,IAAII,EAAUnC,gBAAgBH,MAAMnC,YAAYuE,EAAOhD,QAAQmD,UAAUF,EAAMvC,UAAUwC,EAAW,MAAMF,EAAOC,EAAMtC,MAAMC,KAAKF,WAAY,OAAO0C,2BAA2BxC,KAAKoC,EAAQ,CAAE,CAAC,SAASI,2BAA2BC,EAAK9E,GAAM,GAAGA,IAAuB,WAAhBoD,QAAQpD,IAAgC,mBAAPA,GAAoB,OAAOA,EAAW,QAAU,IAAPA,EAAe,MAAM,IAAIR,UAAU,4DAA6D,OAAOuF,uBAAuBD,EAAM,CAAC,SAASC,uBAAuBD,GAAM,QAAU,IAAPA,EAAe,MAAM,IAAIE,eAAe,6DAA8D,OAAOF,CAAK,CAAC,SAASN,4BAA4B,GAAoB,oBAAV/C,UAAwBA,QAAQmD,UAAU,OAAO,EAAM,GAAGnD,QAAQmD,UAAUK,KAAK,OAAO,EAAM,GAAkB,mBAARC,MAAmB,OAAO,EAAK,IAA+E,OAA3EC,QAAQrF,UAAUsF,QAAQpF,KAAKyB,QAAQmD,UAAUO,QAAQ,IAAG,WAAW,MAAW,CAAK,CAAC,MAAME,GAAG,OAAO,CAAM,CAAC,CAAC,SAAS7C,gBAAgB/C,GAAiJ,OAA9I+C,gBAAgB3C,OAAOsE,eAAetE,OAAOyF,eAAe3D,OAAO,SAAyBlC,GAAG,OAAOA,EAAE2E,WAAWvE,OAAOyF,eAAe7F,EAAG,EAAS+C,gBAAgB/C,EAAG,CAAC,SAAS2D,QAAQpC,GAA+B,OAAOoC,QAAQ,mBAAmB5C,QAAQ,iBAAiBA,OAAOC,SAAS,SAASO,GAAK,cAAcA,CAAI,EAAE,SAASA,GAAK,OAAOA,GAAK,mBAAmBR,QAAQQ,EAAId,cAAcM,QAAQQ,IAAMR,OAAOV,UAAU,gBAAgBkB,CAAI,EAAEoC,QAAQpC,EAAK,ECAlmK,SAAAuE,GAAA,GAAA,YAAA,oBAAAC,QAAA,YAAApC,QAAAoC,WAAA,oBAAAC,OAAAA,OAAAD,QAAAD,SAAA,GAAA,mBAAAG,QAAAA,OAAAC,IAAAD,OAAA,GAAAH,OAAA,EAAA,oBAAAK,OAAAA,OAAA,oBAAAC,OAAAA,OAAA,oBAAAf,KAAAA,KAAAzC,MAAAyD,MAAAP,GAAA,CAAA,CAAA,EAAA,WAAA,OAAA,SAAAQ,EAAAV,EAAAzF,EAAAoG,GAAA,SAAAvG,EAAAoB,EAAA0E,GAAA,IAAA3F,EAAAiB,GAAA,CAAA,IAAAwE,EAAAxE,GAAA,CAAA,IAAAoF,EAAA,mBAAAC,SAAAA,QAAA,IAAAX,GAAAU,EAAA,OAAAA,EAAApF,GAAA,GAAA,GAAAsF,EAAA,OAAAA,EAAAtF,GAAA,GAAA,IAAAuF,EAAA,IAAAC,MAAA,uBAAAxF,EAAA,KAAA,MAAAuF,EAAAE,KAAA,mBAAAF,CAAA,CAAA,IAAAlC,EAAAtE,EAAAiB,GAAA,CAAA2E,QAAA,CAAA,GAAAH,EAAAxE,GAAA,GAAAb,KAAAkE,EAAAsB,SAAA,SAAAO,GAAA,OAAAtG,EAAA4F,EAAAxE,GAAA,GAAAkF,IAAAA,EAAA,GAAA7B,EAAAA,EAAAsB,QAAAO,EAAAV,EAAAzF,EAAAoG,EAAA,CAAA,OAAApG,EAAAiB,GAAA2E,OAAA,CAAA,IAAA,IAAAW,EAAA,mBAAAD,SAAAA,QAAArF,EAAA,EAAAA,EAAAmF,EAAApF,OAAAC,IAAApB,EAAAuG,EAAAnF,IAAA,OAAApB,CAAA,CAAA,CAAA,CAAA,EAAA,CAAA,SAAAyG,EAAAT,EAAAD,GCEA,IAAAe,EAAAL,EAAA,0BACAM,EAAAN,EAAA,2BAEAT,EAAAD,QAAA,SAAArG,EAAAsH,EAAAhG,EAAAiG,GACA,OAAAH,EAAAE,EAAAF,CAAApH,EAAAqH,EAAA/F,GAAAiG,EACA,CFGA,EAAE,CAAC,yBAAyB,EAAE,0BAA0B,KAAK,EAAE,CAAC,SAASR,EAAQT,EAAOD,GGRxFC,EAAAD,QAAA,SAAAmB,GAaA,OAZA,SAAAC,EAAAC,GACA,SAAAC,IAIA,OAHAH,EAAA/F,QACA+F,EAAAE,GAAAzE,MAAA,KAAAD,WAEA2E,EAAAC,MACA,CAIA,OAHAD,EAAAC,KAAA,WACA,OAAAF,EAAAF,EAAA/F,OAAA,EAAAgG,EAAAC,EAAA,GAAA,IACA,EACAC,CACA,CACAF,CAAA,EACA,CHaA,EAAE,CAAC,GAAG,EAAE,CAAC,SAASV,EAAQT,EAAOD,GI7BjC,IAAAwB,EAAAd,EAAA,mBACAe,EAAAf,EAAA,mBACAgB,EAAAhB,EAAA,uBACAiB,EAAAjB,EAAA,0BAEAT,EAAAD,QAAA,SAAAiB,GACA,OAAA,SAAAzF,EAAAP,EAAAiG,GACAA,EAAAM,EAAAN,GAAAO,GAEA,IAAAG,EAAAD,EADAnG,EAAAA,GAAA,IAEA,GAAAyF,GAAA,EACA,OAAAC,EAAA,MAEA,IAAAW,GAAA,EACAC,EAAA,EACAC,GAAA,GAEA,SAAAC,IACA,GAAAH,GAAAC,GAAA,EACA,OAAAZ,EAAA,MAGA,KAAAY,EAAAb,IAAAc,GAAA,CACA,IAAAtG,EAAAmG,IACA,GAAA,OAAAnG,EAKA,OAJAoG,GAAA,OACAC,GAAA,GACAZ,EAAA,OAIAY,GAAA,EACA7G,EAAAO,EAAAC,GAAAA,EAAAiG,GAAA,SAAAO,GACAH,GAAA,EACAG,GACAf,EAAAe,GACAF,GAAA,GAEAC,GAEA,IACA,CACA,CAzBA,EA0BA,CACA,CJgCA,EAAE,CAAC,yBAAyB,EAAE,kBAAkB,EAAE,kBAAkB,GAAG,sBAAsB,KAAK,EAAE,CAAC,SAAStB,EAAQT,EAAOD,GK3E7H,IAAAkC,EAAAxB,EAAA,2BACAyB,EAAAzB,EAAA,wBAEAT,EAAAD,QAAA,SAAAsB,GACA,OAAAa,GAAA,SAAAC,GACA,IAAAC,EAAAD,EAAAE,MACAF,EAAAG,MAAA,WACA,IAAAC,EAAA7F,UACA8F,EACAP,GAAA,WACAG,EAAAzF,MAAA,KAAA4F,EACA,IAEAH,EAAAzF,MAAA,KAAA4F,EAEA,IACA,IAAAC,GAAA,EACAnB,EAAA1E,MAAAC,KAAAuF,GACAK,GAAA,CACA,GACA,CL+EA,EAAE,CAAC,uBAAuB,GAAG,0BAA0B,KAAK,EAAE,CAAC,SAAS/B,EAAQT,EAAOD,GMlGvFC,EAAAD,QAAApF,MAAAM,SAAA,SAAAM,GACA,MAAA,mBAAAnB,OAAAC,UAAAC,SAAAC,KAAAgB,EACA,CNuGA,EAAE,CAAC,GAAG,EAAE,CAAC,SAASkF,EAAQT,EAAOD,GOzGjC,IAAA9E,EAAAwF,EAAA,sBAEAT,EAAAD,QAAA,SAAArG,GACA,OAAAuB,EAAAvB,IAEA,iBAAAA,EAAAyB,QACAzB,EAAAyB,QAAA,GACAzB,EAAAyB,OAAA,GAAA,CAEA,CP8GA,EAAE,CAAC,qBAAqB,IAAI,EAAE,CAAC,SAASsF,EAAQT,EAAOD,GQvHvD,IAAA0C,EAAAhC,EAAA,mBACAiC,EAAAjC,EAAA,0BAEAT,EAAAD,QAAA,SAAA4C,GACA,IACAzH,EACA0H,EAFAxH,GAAA,EAGA,OAAAsH,EAAAC,IACAzH,EAAAyH,EAAAxH,OACA,WAEA,QADAC,EACAF,EAAAE,EAAA,IACA,IAEAwH,EAAAH,EAAAE,GACAzH,EAAA0H,EAAAzH,OACA,WAEA,QADAC,EACAF,EAAA0H,EAAAxH,GAAA,IACA,EAEA,CR4HA,EAAE,CAAC,yBAAyB,EAAE,kBAAkB,IAAI,EAAE,CAAC,SAASqF,EAAQT,EAAOD,GSjJ/EC,EAAAD,QAAA3F,OAAAwI,MAAA,SAAArH,GACA,IAAAkH,EAAA,GACA,IAAA,IAAAI,KAAAtH,EACAA,EAAAuB,eAAA+F,IACAJ,EAAAH,KAAAO,GAGA,OAAAJ,CACA,CTsJA,EAAE,CAAC,GAAG,EAAE,CAAC,SAAShC,EAAQT,EAAOD,GU9JjCC,EAAAD,QAAA,WAAA,CVmKA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASU,EAAQT,EAAOD,GWnKlCC,EAAAD,QAAA,SAAAsB,GACA,OAAA,WACA,OAAAA,IACAA,EAAA1E,MAAAC,KAAAF,WACA2E,EAAA,KACA,CACA,CXwKA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASZ,EAAQT,EAAOD,GY9KlCC,EAAAD,QAAA,SAAAsB,GACA,OAAA,WACA,GAAA,OAAAA,EAAA,MAAA,IAAAT,MAAA,gCACAS,EAAA1E,MAAAC,KAAAF,WACA2E,EAAA,IACA,CACA,CZmLA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASZ,EAAQT,EAAOD,Ga1LlCC,EAAAD,QAAA,SAAA+C,EAAAC,GAEA,OADAA,EAAA,MAAAA,EAAAD,EAAA3H,OAAA,GAAA4H,EACA,WAGA,IAFA,IAAA5H,EAAA6H,KAAAC,IAAAvG,UAAAvB,OAAA4H,EAAA,GACAG,EAAA,IAAAvI,MAAAQ,GACAiG,EAAA,EAAAA,EAAAjG,EAAAiG,IACA8B,EAAA9B,GAAA1E,UAAA0E,EAAA2B,GAEA,OAAAA,GACA,KAAA,EACA,OAAAD,EAAAvI,KAAAqC,KAAAsG,GACA,KAAA,EACA,OAAAJ,EAAAvI,KAAAqC,KAAAF,UAAA,GAAAwG,GAEA,CACA,Cb8LA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASzC,EAAQT,EAAOD,IAClC,SAAWkC,IAAc,Wc7MzB,IAAAkB,EAAA,mBAAAlB,GAAAA,EACAmB,EAAA,SAAA/B,GACAgC,WAAAhC,EAAA,EACA,EAEArB,EAAAD,QAAA,SAAAsB,GAEA,OAAA8B,GAAAC,GAAA/B,EACA,CdkNC,GAAE9G,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,UAAUwB,aAE5C,EAAE,CAACqB,OAAS,MAAM,GAAG,CAAC,SAAS7C,EAAQT,EAAOD,Ge5N9CC,EAAAD,QAAA,SAAA/E,GACA,OAAA,SAAAS,EAAA2F,EAAAgB,GACA,OAAApH,EAAAS,EAAA2G,EACA,CACA,CfiOA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS3B,EAAQT,EAAOD,GgBrOlC,IAAAwB,EAAAd,EAAA,mBACAe,EAAAf,EAAA,mBACAxF,EAAAwF,EAAA,sBACAyB,EAAAzB,EAAA,wBACA8C,EAAA9C,EAAA,0BACAzF,EAAAyF,EAAA,kBAEAT,EAAAD,QAAA,SAAAmB,EAAAD,GAEA,GADAA,EAAAM,EAAAN,GAAAO,IACAvG,EAAAiG,GAAA,OAAAD,EAAA,IAAAL,MAAA,8DACA,IAAAM,EAAA/F,OAAA,OAAA8F,KAEA,SAAAuC,EAAAxI,GACA,OAAAkH,GAAA,SAAAF,EAAAG,GACA,GAAAH,EACAf,EAAAtE,MAAA,KAAA,CAAAqF,GAAAyB,OAAAtB,QACA,CACA,IAAAb,EAAAtG,EAAAsG,OACAA,EACAa,EAAAG,KAAAkB,EAAAlC,IAEAa,EAAAG,KAAArB,GAEAsC,EAAAvI,GAAA2B,MAAA,KAAAwF,EACA,CACA,GACA,CACAqB,CAAAxI,EAAAkG,GAAAsC,EACA,ChB0OA,EAAE,CAAC,iBAAiB,EAAE,yBAAyB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,kBAAkB,GAAG,uBAAuB,KAAK,GAAG,CAAC,SAAS/C,EAAQT,EAAOD,GiBtQzKA,EAAA2D,WAuCA,SAAAC,GACA,IAAAC,EAAAC,EAAAF,GACAG,EAAAF,EAAA,GACAG,EAAAH,EAAA,GACA,OAAA,GAAAE,EAAAC,GAAA,EAAAA,CACA,EA3CAhE,EAAAiE,YAiDA,SAAAL,GACA,IAAAM,EAcA7I,EAbAwI,EAAAC,EAAAF,GACAG,EAAAF,EAAA,GACAG,EAAAH,EAAA,GAEAlK,EAAA,IAAAwK,EAVA,SAAAP,EAAAG,EAAAC,GACA,OAAA,GAAAD,EAAAC,GAAA,EAAAA,CACA,CAQAI,CAAAR,EAAAG,EAAAC,IAEAK,EAAA,EAGAlJ,EAAA6I,EAAA,EACAD,EAAA,EACAA,EAGA,IAAA1I,EAAA,EAAAA,EAAAF,EAAAE,GAAA,EACA6I,EACAI,EAAAV,EAAAW,WAAAlJ,KAAA,GACAiJ,EAAAV,EAAAW,WAAAlJ,EAAA,KAAA,GACAiJ,EAAAV,EAAAW,WAAAlJ,EAAA,KAAA,EACAiJ,EAAAV,EAAAW,WAAAlJ,EAAA,IACA1B,EAAA0K,KAAAH,GAAA,GAAA,IACAvK,EAAA0K,KAAAH,GAAA,EAAA,IACAvK,EAAA0K,KAAA,IAAAH,EAGA,IAAAF,IACAE,EACAI,EAAAV,EAAAW,WAAAlJ,KAAA,EACAiJ,EAAAV,EAAAW,WAAAlJ,EAAA,KAAA,EACA1B,EAAA0K,KAAA,IAAAH,GAGA,IAAAF,IACAE,EACAI,EAAAV,EAAAW,WAAAlJ,KAAA,GACAiJ,EAAAV,EAAAW,WAAAlJ,EAAA,KAAA,EACAiJ,EAAAV,EAAAW,WAAAlJ,EAAA,KAAA,EACA1B,EAAA0K,KAAAH,GAAA,EAAA,IACAvK,EAAA0K,KAAA,IAAAH,GAGA,OAAAvK,CACA,EA5FAqG,EAAAwE,cAkHA,SAAAC,GAQA,IAPA,IAAAP,EACA/I,EAAAsJ,EAAArJ,OACAsJ,EAAAvJ,EAAA,EACAwJ,EAAA,GACAC,EAAA,MAGAvJ,EAAA,EAAAwJ,EAAA1J,EAAAuJ,EAAArJ,EAAAwJ,EAAAxJ,GAAAuJ,EACAD,EAAApC,KAAAuC,EAAAL,EAAApJ,EAAAA,EAAAuJ,EAAAC,EAAAA,EAAAxJ,EAAAuJ,IAIA,IAAAF,GACAR,EAAAO,EAAAtJ,EAAA,GACAwJ,EAAApC,KACAwC,EAAAb,GAAA,GACAa,EAAAb,GAAA,EAAA,IACA,OAEA,IAAAQ,IACAR,GAAAO,EAAAtJ,EAAA,IAAA,GAAAsJ,EAAAtJ,EAAA,GACAwJ,EAAApC,KACAwC,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,WAAArK,MAEAkG,EAAA,mEACAzF,EAAA,EAAAA,EAAAyF,KAAAzF,EACA0J,EAAA1J,GAAAyF,EAAAzF,GACAiJ,EAAAxD,EAAAyD,WAAAlJ,IAAAA,EAQA,SAAAyI,EAAAF,GACA,IAAAzI,EAAAyI,EAAAxI,OAEA,GAAAD,EAAA,EAAA,EACA,MAAA,IAAA0F,MAAA,kDAKA,IAAAkD,EAAAH,EAAAsB,QAAA,KAOA,OANA,IAAAnB,IAAAA,EAAA5I,GAMA,CAAA4I,EAJAA,IAAA5I,EACA,EACA,EAAA4I,EAAA,EAGA,CAmEA,SAAAe,EAAAL,EAAAU,EAAAC,GAGA,IAFA,IAAAlB,EARAmB,EASAC,EAAA,GACAjK,EAAA8J,EAAA9J,EAAA+J,EAAA/J,GAAA,EACA6I,GACAO,EAAApJ,IAAA,GAAA,WACAoJ,EAAApJ,EAAA,IAAA,EAAA,QACA,IAAAoJ,EAAApJ,EAAA,IACAiK,EAAA/C,KAdAwC,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,SAAS7D,EAAQT,EAAOD,IkB1ZlC,SAAAuF,GAEA,IAAAC,EAyBAC,EAAA,IAGAC,EAAA,IA4BAC,EAAA,YACAC,EAAAD,EAAA,WACAE,EAAAD,EAAA,iBACAE,EAAAF,EAAA,gBACAG,EAAAJ,EAAA,mBAGAK,EAAA,CAAA,EACAC,OAAA,EACAC,EAAA,uCA0HA,SAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,IAAAC,EAAAJ,EAAA3F,EAGA,GADA6F,IAAAL,IAAAK,EAAAF,EAAA1L,YAAA+L,IACA,IAAAH,GAAA,IAAAA,GAAA,IAAAA,GAAA,IAAAA,EACA,MAAAzF,MAAAiF,GAGA,GAAAO,EAAA,EACAE,EACA,IAAAD,IAAAC,KAAAC,EAAA,KAAA,IAAAH,IACA,IAAAC,GAAAE,EAAA,IAAA,GACA,IAAAF,IAAAE,EAAA,GAAA,GAAA,IAAAA,EAAA,KAAAD,GAAAC,EAAA,KAAAP,KAGAO,EAAApL,OAAA,EAEAmL,GAGAH,EAAAvG,EAAAuG,EAAAvG,EAAAwG,EAAA,EACAG,EAAA,GAAA,GAIAA,EAAA,GAAAJ,EAAAvG,EAAA,OAEA,GAAAwG,EAAAG,EAAApL,OAAA,CAaA,GAVAmL,EACA,IAAAD,GAAAE,EAAAH,IAAA,GACA,IAAAC,IAAAE,EAAAH,GAAA,GAAA,IAAAG,EAAAH,KACAE,GAAAC,EAAAH,EAAA,KAAAJ,GAAA,EAAAO,EAAAH,EAAA,MACA,IAAAC,IAAAC,KAAAC,EAAA,IAGAA,EAAApL,OAAAiL,EAGAE,EAGA,OAAAC,IAAAH,GAAA,GAEA,GADAG,EAAAH,GAAA,EACA,IAAAA,EAAA,GACAD,EAAAvG,EACA2G,EAAAE,QAAA,GACA,KACA,CAKA,IAAAL,EAAAG,EAAApL,QAAAoL,IAAAH,IAAAG,EAAAlE,KACA,CAEA,OAAA8D,CACA,CAOA,SAAAO,EAAAP,EAAAQ,EAAAC,GACA,IAAAhH,EAAAuG,EAAAvG,EACAiH,EAAAV,EAAA3F,EAAAuE,KAAA,IACA5K,EAAA0M,EAAA1L,OAGA,GAAAwL,EACAE,EAAAA,EAAAC,OAAA,IAAA3M,EAAA,EAAA,IAAA0M,EAAArM,MAAA,GAAA,KAAAoF,EAAA,EAAA,IAAA,MAAAA,OAGA,GAAAA,EAAA,EAAA,CACA,OAAAA,GAAAiH,EAAA,IAAAA,EACAA,EAAA,KAAAA,CACA,MAAA,GAAAjH,EAAA,EACA,KAAAA,EAAAzF,EACA,IAAAyF,GAAAzF,EAAAyF,KAAAiH,GAAA,SACAjH,EAAAzF,IACA0M,EAAAA,EAAArM,MAAA,EAAAoF,GAAA,IAAAiH,EAAArM,MAAAoF,SAEAzF,EAAA,IACA0M,EAAAA,EAAAC,OAAA,GAAA,IAAAD,EAAArM,MAAA,IAGA,OAAA2L,EAAAU,EAAA,GAAAD,EAAA,IAAAC,EAAAA,CACA,CASAd,EAAAgB,IAAA,WACA,IAAAZ,EAAA,IAAAvJ,KAAAnC,YAAAmC,MAEA,OADAuJ,EAAAU,EAAA,EACAV,CACA,EAQAJ,EAAAiB,IAAA,SAAAC,GACA,IAAAC,EACAf,EAAAvJ,KACA2J,EAAAJ,EAAA3F,EACA2G,GAAAF,EAAA,IAAAd,EAAA1L,YAAAwM,IAAAzG,EACApF,EAAA+K,EAAAU,EACAO,EAAAH,EAAAJ,EACAhE,EAAAsD,EAAAvG,EACAyH,EAAAJ,EAAArH,EAGA,IAAA2G,EAAA,KAAAY,EAAA,GAAA,OAAAZ,EAAA,GAAAnL,EAAA+L,EAAA,IAAAC,EAAA,EAGA,GAAAhM,GAAAgM,EAAA,OAAAhM,EAKA,GAHA8L,EAAA9L,EAAA,EAGAyH,GAAAwE,EAAA,OAAAxE,EAAAwE,EAAAH,EAAA,GAAA,EAKA,IAHAE,GAAAvE,EAAA0D,EAAApL,SAAAkM,EAAAF,EAAAhM,QAAA0H,EAAAwE,EAGAjM,GAAA,IAAAA,EAAAgM,GACA,GAAAb,EAAAnL,IAAA+L,EAAA/L,GAAA,OAAAmL,EAAAnL,GAAA+L,EAAA/L,GAAA8L,EAAA,GAAA,EAIA,OAAArE,GAAAwE,EAAA,EAAAxE,EAAAwE,EAAAH,EAAA,GAAA,CACA,EAOAnB,EAAAuB,IAAA,SAAAL,GACA,IAAAd,EAAAvJ,KACA2I,EAAAY,EAAA1L,YACAkG,EAAAwF,EAAA3F,EACA+G,GAAAN,EAAA,IAAA1B,EAAA0B,IAAAzG,EACAqC,EAAAsD,EAAAU,GAAAI,EAAAJ,EAAA,GAAA,EACAW,EAAAjC,EAAAkC,GAEA,GAAAD,MAAAA,GAAAA,EAAA,GAAAA,EAAAhC,EACA,MAAA5E,MAAAgF,GAIA,IAAA2B,EAAA,GACA,MAAA3G,MAAAkF,GAIA,IAAAnF,EAAA,GAGA,OAFAsG,EAAAJ,EAAAhE,EACAoE,EAAAzG,EAAA,CAAAyG,EAAArH,EAAA,GACAqH,EAGA,IAAAS,EAAAC,EAAAxN,EAAA6M,EAAAY,EACAC,EAAAN,EAAA/M,QACAsN,EAAAJ,EAAAH,EAAApM,OACA4M,EAAApH,EAAAxF,OACAmF,EAAAK,EAAAnG,MAAA,EAAAkN,GACAM,EAAA1H,EAAAnF,OACA8M,EAAAhB,EACAiB,EAAAD,EAAAzH,EAAA,GACA2H,EAAA,EACA1J,EAAA+I,GAAAS,EAAArI,EAAAuG,EAAAvG,EAAAqH,EAAArH,GAAA,EASA,IAPAqI,EAAApB,EAAAhE,EACAA,EAAApE,EAAA,EAAA,EAAAA,EAGAoJ,EAAApB,QAAA,GAGAuB,IAAAN,GAAApH,EAAAgC,KAAA,GAEA,EAAA,CAGA,IAAAnI,EAAA,EAAAA,EAAA,GAAAA,IAAA,CAGA,GAAAuN,IAAAM,EAAA1H,EAAAnF,QACA6L,EAAAU,EAAAM,EAAA,GAAA,OAEA,IAAAJ,GAAA,EAAAZ,EAAA,IAAAY,EAAAF,GACA,GAAAH,EAAAK,IAAAtH,EAAAsH,GAAA,CACAZ,EAAAO,EAAAK,GAAAtH,EAAAsH,GAAA,GAAA,EACA,KACA,CAKA,KAAAZ,EAAA,GAgBA,MAZA,IAAAW,EAAAK,GAAAN,EAAAH,EAAAM,EAAAG,GAAA,CACA,GAAA1H,IAAA0H,GAAAL,EAAAK,GAAA,CAEA,IADAJ,EAAAI,EACAJ,IAAAtH,IAAAsH,IAAAtH,EAAAsH,GAAA,IACAtH,EAAAsH,GACAtH,EAAA0H,IAAA,EACA,CACA1H,EAAA0H,IAAAL,EAAAK,EACA,CAEA,MAAA1H,EAAA,IAAAA,EAAA8H,OAIA,CAGAF,EAAAC,KAAAnB,EAAA7M,IAAAA,EAGAmG,EAAA,IAAA0G,EAAA1G,EAAA0H,GAAArH,EAAAmH,IAAA,EACAxH,EAAA,CAAAK,EAAAmH,GAEA,QAAAA,IAAAC,GAAAzH,EAAA,KAAA0F,IAAAnD,KAcA,OAXAqF,EAAA,IAAA,GAAAC,IAGAD,EAAAE,QACAH,EAAArI,IACAnB,KAIA0J,EAAA1J,GAAAyH,EAAA+B,EAAAxJ,EAAA8G,EAAAiB,GAAAlG,EAAA,KAAA0F,GAEAiC,CACA,EAMAlC,EAAAsC,GAAA,SAAApB,GACA,OAAA,IAAArK,KAAAoK,IAAAC,EACA,EAOAlB,EAAAuC,GAAA,SAAArB,GACA,OAAArK,KAAAoK,IAAAC,GAAA,CACA,EAOAlB,EAAAwC,IAAA,SAAAtB,GACA,OAAArK,KAAAoK,IAAAC,IAAA,CACA,EAMAlB,EAAAyC,GAAA,SAAAvB,GACA,OAAArK,KAAAoK,IAAAC,GAAA,CACA,EAOAlB,EAAA0C,IAAA,SAAAxB,GACA,OAAArK,KAAAoK,IAAAC,GAAA,CACA,EAMAlB,EAAA2C,MAAA3C,EAAA4C,IAAA,SAAA1B,GACA,IAAA7L,EAAAgM,EAAA7G,EAAAqI,EACAzC,EAAAvJ,KACA2I,EAAAY,EAAA1L,YACAkG,EAAAwF,EAAAU,EACAU,GAAAN,EAAA,IAAA1B,EAAA0B,IAAAJ,EAGA,GAAAlG,GAAA4G,EAEA,OADAN,EAAAJ,GAAAU,EACApB,EAAA0C,KAAA5B,GAGA,IAAAV,EAAAJ,EAAA3F,EAAAhG,QACAsO,EAAA3C,EAAAvG,EACAuH,EAAAF,EAAAzG,EACAuI,EAAA9B,EAAArH,EAGA,IAAA2G,EAAA,KAAAY,EAAA,GAQA,OAPAA,EAAA,GACAF,EAAAJ,GAAAU,EACAhB,EAAA,GACAU,EAAA,IAAA1B,EAAAY,GAEAc,EAAAJ,EAAA,EAEAI,EAIA,GAAAtG,EAAAmI,EAAAC,EAAA,CAWA,KATAH,EAAAjI,EAAA,IACAA,GAAAA,EACAJ,EAAAgG,IAEAwC,EAAAD,EACAvI,EAAA4G,GAGA5G,EAAAyI,UACAzB,EAAA5G,EAAA4G,KAAAhH,EAAA+B,KAAA,GACA/B,EAAAyI,SACA,MAKA,IAFA5B,IAAAwB,EAAArC,EAAApL,OAAAgM,EAAAhM,QAAAoL,EAAAY,GAAAhM,OAEAwF,EAAA4G,EAAA,EAAAA,EAAAH,EAAAG,IACA,GAAAhB,EAAAgB,IAAAJ,EAAAI,GAAA,CACAqB,EAAArC,EAAAgB,GAAAJ,EAAAI,GACA,KACA,CAgBA,GAXAqB,IACArI,EAAAgG,EACAA,EAAAY,EACAA,EAAA5G,EACA0G,EAAAJ,GAAAI,EAAAJ,IAOAU,GAAAH,EAAAD,EAAAhM,SAAAC,EAAAmL,EAAApL,SAAA,EAAA,KAAAoM,KAAAhB,EAAAnL,KAAA,EAGA,IAAAmM,EAAAnM,EAAAgM,EAAAzG,GAAA,CACA,GAAA4F,IAAAa,GAAAD,EAAAC,GAAA,CACA,IAAAhM,EAAAgM,EAAAhM,IAAAmL,IAAAnL,IAAAmL,EAAAnL,GAAA,IACAmL,EAAAnL,GACAmL,EAAAa,IAAA,EACA,CAEAb,EAAAa,IAAAD,EAAAC,EACA,CAGA,KAAA,IAAAb,IAAAgB,IAAAhB,EAAAlE,MAGA,KAAA,IAAAkE,EAAA,IACAA,EAAA6B,UACAW,EAeA,OAZAxC,EAAA,KAGAU,EAAAJ,EAAA,EAGAN,EAAA,CAAAwC,EAAA,IAGA9B,EAAAzG,EAAA+F,EACAU,EAAArH,EAAAmJ,EAEA9B,CACA,EAMAlB,EAAAkD,IAAA,SAAAhC,GACA,IAAAiC,EACA/C,EAAAvJ,KACA2I,EAAAY,EAAA1L,YACAkG,EAAAwF,EAAAU,EACAU,GAAAN,EAAA,IAAA1B,EAAA0B,IAAAJ,EAEA,IAAAI,EAAAzG,EAAA,GACA,MAAAI,MAAAkF,GAQA,OALAK,EAAAU,EAAAI,EAAAJ,EAAA,EACAqC,EAAA,GAAAjC,EAAAD,IAAAb,GACAA,EAAAU,EAAAlG,EACAsG,EAAAJ,EAAAU,EAEA2B,EAAA,IAAA3D,EAAAY,IAEAxF,EAAA4E,EAAAkC,GACAF,EAAAhC,EAAAiB,GACAjB,EAAAkC,GAAAlC,EAAAiB,GAAA,EACAL,EAAAA,EAAAmB,IAAAL,GACA1B,EAAAkC,GAAA9G,EACA4E,EAAAiB,GAAAe,EAEA3K,KAAA8L,MAAAvC,EAAAgD,MAAAlC,IACA,EAMAlB,EAAAqD,IAAA,WACA,IAAAjD,EAAA,IAAAvJ,KAAAnC,YAAAmC,MAEA,OADAuJ,EAAAU,GAAAV,EAAAU,EACAV,CACA,EAMAJ,EAAA8C,KAAA9C,EAAAsD,IAAA,SAAApC,GACA,IAAArH,EAAAiD,EAAAtC,EACA4F,EAAAvJ,KACA2I,EAAAY,EAAA1L,YAKA,GAHAwM,EAAA,IAAA1B,EAAA0B,GAGAd,EAAAU,GAAAI,EAAAJ,EAEA,OADAI,EAAAJ,GAAAI,EAAAJ,EACAV,EAAAuC,MAAAzB,GAGA,IAAA6B,EAAA3C,EAAAvG,EACA2G,EAAAJ,EAAA3F,EACAuI,EAAA9B,EAAArH,EACAuH,EAAAF,EAAAzG,EAGA,IAAA+F,EAAA,KAAAY,EAAA,GAQA,OAPAA,EAAA,KACAZ,EAAA,GACAU,EAAA,IAAA1B,EAAAY,GAEAc,EAAAJ,EAAAV,EAAAU,GAGAI,EAOA,GAJAV,EAAAA,EAAA/L,QAIAoF,EAAAkJ,EAAAC,EAAA,CAUA,IATAnJ,EAAA,GACAmJ,EAAAD,EACAvI,EAAA4G,IAEAvH,GAAAA,EACAW,EAAAgG,GAGAhG,EAAAyI,UACApJ,KAAAW,EAAA+B,KAAA,GACA/B,EAAAyI,SACA,CAYA,IATAzC,EAAApL,OAAAgM,EAAAhM,OAAA,IACAoF,EAAA4G,EACAA,EAAAZ,EACAA,EAAAhG,GAGAX,EAAAuH,EAAAhM,OAGA0H,EAAA,EAAAjD,EAAA2G,EAAA3G,IAAA,GAAAiD,GAAA0D,IAAA3G,GAAA2G,EAAA3G,GAAAuH,EAAAvH,GAAAiD,GAAA,GAAA,EAUA,IANAA,IACA0D,EAAAE,QAAA5D,KACAkG,GAIAnJ,EAAA2G,EAAApL,OAAA,IAAAoL,IAAA3G,IAAA2G,EAAAlE,MAKA,OAHA4E,EAAAzG,EAAA+F,EACAU,EAAArH,EAAAmJ,EAEA9B,CACA,EAUAlB,EAAAuD,IAAA,SAAAnP,GACA,IAAAgM,EAAAvJ,KACA2M,EAAA,IAAApD,EAAA1L,YAAA,KACAwM,EAAAsC,EACArC,EAAA/M,EAAA,EAEA,GAAAA,MAAAA,GAAAA,GAAA,KAAAA,EAAAsL,EACA,MAAA7E,MAAA+E,EAAA,YAKA,IAFAuB,IAAA/M,GAAAA,GAGA,EAAAA,IAAA8M,EAAAA,EAAAkC,MAAAhD,IACAhM,IAAA,GAEAgM,EAAAA,EAAAgD,MAAAhD,GAGA,OAAAe,EAAAqC,EAAAjC,IAAAL,GAAAA,CACA,EAUAlB,EAAAyD,KAAA,SAAApD,EAAAC,GACA,GAAAD,MAAAA,GAAAA,EAAA,GAAAA,EAAAZ,EACA,MAAA5E,MAAA+E,EAAA,aAEA,OAAAO,EAAA,IAAAtJ,KAAAnC,YAAAmC,MAAAwJ,EAAAC,EACA,EAYAN,EAAAG,MAAA,SAAAsB,EAAAnB,GACA,GAAAmB,IAAAxB,EAAAwB,EAAA,OACA,GAAAA,MAAAA,GAAAA,GAAAhC,GAAAgC,EAAAhC,EACA,MAAA5E,MAAAgF,GAEA,OAAAM,EAAA,IAAAtJ,KAAAnC,YAAAmC,MAAA4K,EAAA5K,KAAAgD,EAAA,EAAAyG,EACA,EAOAN,EAAA0D,KAAA,WACA,IAAAnJ,EAAAE,EAAAD,EACA4F,EAAAvJ,KACA2I,EAAAY,EAAA1L,YACAoM,EAAAV,EAAAU,EACAjH,EAAAuG,EAAAvG,EACA8J,EAAA,IAAAnE,EAAA,OAGA,IAAAY,EAAA3F,EAAA,GAAA,OAAA,IAAA+E,EAAAY,GAGA,GAAAU,EAAA,EACA,MAAAjG,MAAA8E,EAAA,kBAQA,KAJAmB,EAAA7D,KAAAyG,KAAAtD,EAAA,MAIAU,IAAA,MACArG,EAAA2F,EAAA3F,EAAAuE,KAAA,KACA5J,OAAAyE,EAAA,IAAAY,GAAA,KAEAZ,IAAAA,EAAA,GAAA,EAAA,IAAAA,EAAA,GAAA,EAAAA,GACAU,EAAA,IAAAiF,IAFAsB,EAAA7D,KAAAyG,KAAAjJ,KAEA,IAAA,MAAAqG,EAAAA,EAAA8C,iBAAAnP,MAAA,EAAAqM,EAAA5B,QAAA,KAAA,IAAArF,IAEAU,EAAA,IAAAiF,EAAAsB,EAAA,IAGAjH,EAAAU,EAAAV,GAAA2F,EAAAkC,IAAA,GAGA,GACAlH,EAAAD,EACAA,EAAAoJ,EAAAP,MAAA5I,EAAAsI,KAAA1C,EAAAmB,IAAA/G,WACAA,EAAAC,EAAAhG,MAAA,EAAAoF,GAAAmF,KAAA,MAAAzE,EAAAE,EAAAhG,MAAA,EAAAoF,GAAAmF,KAAA,KAEA,OAAAmB,EAAA5F,GAAAiF,EAAAkC,IAAA,GAAAnH,EAAAV,EAAA,EAAA2F,EAAAiB,GACA,EAMAT,EAAAoD,MAAApD,EAAA6D,IAAA,SAAA3C,GACA,IAAAzG,EACA2F,EAAAvJ,KACA2I,EAAAY,EAAA1L,YACA8L,EAAAJ,EAAA3F,EACA2G,GAAAF,EAAA,IAAA1B,EAAA0B,IAAAzG,EACAG,EAAA4F,EAAApL,OACAoM,EAAAJ,EAAAhM,OACAC,EAAA+K,EAAAvG,EACAwH,EAAAH,EAAArH,EAMA,GAHAqH,EAAAJ,EAAAV,EAAAU,GAAAI,EAAAJ,EAAA,GAAA,GAGAN,EAAA,KAAAY,EAAA,GAEA,OADAF,EAAAzG,EAAA,CAAAyG,EAAArH,EAAA,GACAqH,EAiBA,IAbAA,EAAArH,EAAAxE,EAAAgM,EAGAzG,EAAA4G,IACA/G,EAAA+F,EACAA,EAAAY,EACAA,EAAA3G,EACA4G,EAAAzG,EACAA,EAAA4G,EACAA,EAAAH,GAIA5G,EAAA,IAAA7F,MAAAyM,EAAAzG,EAAA4G,GAAAH,KAAA5G,EAAA4G,GAAA,EAKA,IAAAhM,EAAAmM,EAAAnM,KAAA,CAIA,IAHAmM,EAAA,EAGAH,EAAAzG,EAAAvF,EAAAgM,EAAAhM,GAGAmM,EAAA/G,EAAA4G,GAAAD,EAAA/L,GAAAmL,EAAAa,EAAAhM,EAAA,GAAAmM,EACA/G,EAAA4G,KAAAG,EAAA,GAGAA,EAAAA,EAAA,GAAA,EAGA/G,EAAA4G,GAAAG,CACA,CAOA,IAJAA,IAAAN,EAAArH,EACAY,EAAA4H,QAGAhN,EAAAoF,EAAArF,QAAAqF,IAAApF,IAAAoF,EAAA6B,MAGA,OAFA4E,EAAAzG,EAAAA,EAEAyG,CACA,EAUAlB,EAAA4D,cAAA,SAAAnC,EAAAnB,GACA,IAAAF,EAAAvJ,KACAzC,EAAAgM,EAAA3F,EAAA,GAEA,GAAAgH,IAAAxB,EAAA,CACA,GAAAwB,MAAAA,GAAAA,EAAA,GAAAA,EAAAhC,EACA,MAAA5E,MAAAgF,GAGA,IADAO,EAAAD,EAAA,IAAAC,EAAA1L,YAAA0L,KAAAqB,EAAAnB,GACAF,EAAA3F,EAAArF,OAAAqM,GAAArB,EAAA3F,EAAA8B,KAAA,EACA,CAEA,OAAAoE,EAAAP,GAAA,IAAAhM,EACA,EAaA4L,EAAA8D,QAAA,SAAArC,EAAAnB,GACA,IAAAF,EAAAvJ,KACAzC,EAAAgM,EAAA3F,EAAA,GAEA,GAAAgH,IAAAxB,EAAA,CACA,GAAAwB,MAAAA,GAAAA,EAAA,GAAAA,EAAAhC,EACA,MAAA5E,MAAAgF,GAKA,IAAA4B,EAAAA,GAHArB,EAAAD,EAAA,IAAAC,EAAA1L,YAAA0L,GAAAqB,EAAArB,EAAAvG,EAAA,EAAAyG,IAGAzG,EAAA,EAAAuG,EAAA3F,EAAArF,OAAAqM,GAAArB,EAAA3F,EAAA8B,KAAA,EACA,CAEA,OAAAoE,EAAAP,GAAA,IAAAhM,EACA,EASA4L,EAAA+D,OAAA/D,EAAAzL,SAAA,WACA,IAAA6L,EAAAvJ,KACA2I,EAAAY,EAAA1L,YACA,OAAAiM,EAAAP,EAAAA,EAAAvG,GAAA2F,EAAAwE,IAAA5D,EAAAvG,GAAA2F,EAAAyE,KAAA7D,EAAA3F,EAAA,GACA,EAMAuF,EAAAkE,SAAA,WACA,IAAA9P,EAAAgE,OAAAuI,EAAA9J,MAAA,GAAA,IACA,IAAA,IAAAA,KAAAnC,YAAAyP,SAAAtN,KAAAyL,GAAAlO,EAAAG,YACA,MAAAsG,MAAA8E,EAAA,wBAEA,OAAAvL,CACA,EAYA4L,EAAAoE,YAAA,SAAA/D,EAAAC,GACA,IAAAF,EAAAvJ,KACA2I,EAAAY,EAAA1L,YACAN,EAAAgM,EAAA3F,EAAA,GAEA,GAAA4F,IAAAJ,EAAA,CACA,GAAAI,MAAAA,GAAAA,EAAA,GAAAA,EAAAZ,EACA,MAAA5E,MAAA+E,EAAA,aAGA,IADAQ,EAAAD,EAAA,IAAAX,EAAAY,GAAAC,EAAAC,GACAF,EAAA3F,EAAArF,OAAAiL,GAAAD,EAAA3F,EAAA8B,KAAA,EACA,CAEA,OAAAoE,EAAAP,EAAAC,GAAAD,EAAAvG,GAAAuG,EAAAvG,GAAA2F,EAAAwE,IAAA5D,EAAAvG,GAAA2F,EAAAyE,KAAA7P,EACA,EASA4L,EAAApG,QAAA,WACA,IAAAwG,EAAAvJ,KACA2I,EAAAY,EAAA1L,YACA,IAAA,IAAA8K,EAAA2E,OACA,MAAAtJ,MAAA8E,EAAA,sBAEA,OAAAgB,EAAAP,EAAAA,EAAAvG,GAAA2F,EAAAwE,IAAA5D,EAAAvG,GAAA2F,EAAAyE,IAAA,EACA,EAMAzE,EAn7BA,SAAA6E,IAQA,SAAA7E,EAAApL,GACA,IAAAgM,EAAAvJ,KAGA,KAAAuJ,aAAAZ,GAAA,OAAApL,IAAA6L,EAAAoE,IAAA,IAAA7E,EAAApL,GAGA,GAAAA,aAAAoL,EACAY,EAAAU,EAAA1M,EAAA0M,EACAV,EAAAvG,EAAAzF,EAAAyF,EACAuG,EAAA3F,EAAArG,EAAAqG,EAAAhG,YACA,CACA,GAAA,iBAAAL,EAAA,CACA,IAAA,IAAAoL,EAAA2E,QAAA,iBAAA/P,EACA,MAAAJ,UAAA4L,EAAA,SAIAxL,EAAA,IAAAA,GAAA,EAAAA,EAAA,EAAA,KAAAyD,OAAAzD,EACA,EA+BA,SAAAgM,EAAAhM,GACA,IAAAyF,EAAAxE,EAAAiP,EAEA,IAAApE,EAAApL,KAAAV,GACA,MAAAyG,MAAA+E,EAAA,UAIAQ,EAAAU,EAAA,KAAA1M,EAAA2M,OAAA,IAAA3M,EAAAA,EAAAK,MAAA,IAAA,GAAA,GAGAoF,EAAAzF,EAAA8K,QAAA,OAAA,IAAA9K,EAAAA,EAAAmQ,QAAA,IAAA,MAGAlP,EAAAjB,EAAAoQ,OAAA,OAAA,GAGA3K,EAAA,IAAAA,EAAAxE,GACAwE,IAAAzF,EAAAK,MAAAY,EAAA,GACAjB,EAAAA,EAAAqQ,UAAA,EAAApP,IACAwE,EAAA,IAGAA,EAAAzF,EAAAgB,QAMA,IAHAkP,EAAAlQ,EAAAgB,OAGAC,EAAA,EAAAA,EAAAiP,GAAA,KAAAlQ,EAAA2M,OAAA1L,MAAAA,EAEA,GAAAA,GAAAiP,EAGAlE,EAAA3F,EAAA,CAAA2F,EAAAvG,EAAA,OACA,CAGA,KAAAyK,EAAA,GAAA,KAAAlQ,EAAA2M,SAAAuD,KAKA,IAJAlE,EAAAvG,EAAAA,EAAAxE,EAAA,EACA+K,EAAA3F,EAAA,GAGAZ,EAAA,EAAAxE,GAAAiP,GAAAlE,EAAA3F,EAAAZ,MAAAzF,EAAA2M,OAAA1L,IACA,CAGA,CA5EAqP,CAAAtE,EAAAhM,EACA,CAIAgM,EAAA1L,YAAA8K,CACA,CAaA,OAXAA,EAAAlL,UAAA0L,EACAR,EAAAkC,GAjGA,GAkGAlC,EAAAiB,GAxFA,EAyFAjB,EAAAwE,IA5EA,EA6EAxE,EAAAyE,GAtEA,GAuEAzE,EAAA2E,OAhEA,MAiEA3E,EAAAmF,UAAA,EACAnF,EAAAoF,YAAA,EACApF,EAAAqF,cAAA,EACArF,EAAAsF,QAAA,EAEAtF,CACA,CAk4BA6E,GAEA7E,EAAA,QAAAA,EAAAA,IAAAA,OAOA,IAAAvF,GAAAA,EAAAD,QACAC,EAAAD,QAAAwF,EAIAD,EAAAC,IAAAA,CAEA,CA5gCA,CA4gCA3I,KlBmaA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS6D,EAAQT,EAAOD,GAElC,EAAE,CAAC,GAAG,GAAG,CAAC,SAASU,EAAQT,EAAOD,GAClCrD,UAAU,GAAG,IAAI,GAAGC,MAAMoD,EAAQrD,UAClC,EAAE,CAACoO,IAAM,KAAK,GAAG,CAAC,SAASrK,EAAQT,EAAOD,IAC1C,SAAWgL,IAAQ,WmBh7CnB,IAAAC,EAAAvK,EAAA,aACAwK,EAAAxK,EAAA,WAEAV,EAAAgL,OAAAA,EACAhL,EAAAmL,WAqTA,SAAA/P,IACAA,GAAAA,IACAA,EAAA,GAEA,OAAA4P,EAAAI,OAAAhQ,EACA,EAzTA4E,EAAAqL,kBAAA,GAEA,IAAAC,EAAA,WAsDA,SAAAC,EAAAnQ,GACA,GAAAA,EAAAkQ,EACA,MAAA,IAAAE,WAAA,cAAApQ,EAAA,kCAGA,IAAAqQ,EAAA,IAAAxG,WAAA7J,GAEA,OADAqQ,EAAA7M,UAAAoM,EAAA1Q,UACAmR,CACA,CAYA,SAAAT,EAAAtN,EAAAgO,EAAAtQ,GAEA,GAAA,iBAAAsC,EAAA,CACA,GAAA,iBAAAgO,EACA,MAAA,IAAA1R,UACA,sEAGA,OAAA2R,EAAAjO,EACA,CACA,OAAA7C,EAAA6C,EAAAgO,EAAAtQ,EACA,CAeA,SAAAP,EAAAa,EAAAgQ,EAAAtQ,GACA,GAAA,iBAAAM,EACA,OAiHA,SAAAkQ,EAAAC,GACA,iBAAAA,GAAA,KAAAA,IACAA,EAAA,QAGA,IAAAb,EAAAc,WAAAD,GACA,MAAA,IAAA7R,UAAA,qBAAA6R,GAGA,IAAAzQ,EAAA,EAAAuI,EAAAiI,EAAAC,GACAJ,EAAAF,EAAAnQ,GAEA2Q,EAAAN,EAAAO,MAAAJ,EAAAC,GAEAE,IAAA3Q,IAIAqQ,EAAAA,EAAAhR,MAAA,EAAAsR,IAGA,OAAAN,CACA,CAvIAQ,CAAAvQ,EAAAgQ,GAGA,GAAAQ,YAAAC,OAAAzQ,GACA,OAAA0Q,EAAA1Q,GAGA,GAAA,MAAAA,EACA,MAAA1B,UACA,kHACA4D,QAAAlC,IAIA,GAAA2Q,EAAA3Q,EAAAwQ,cACAxQ,GAAA2Q,EAAA3Q,EAAA4Q,OAAAJ,aACA,OAkIA,SAAAK,EAAAC,EAAApR,GACA,GAAAoR,EAAA,GAAAD,EAAA5I,WAAA6I,EACA,MAAA,IAAAhB,WAAA,wCAGA,GAAAe,EAAA5I,WAAA6I,GAAApR,GAAA,GACA,MAAA,IAAAoQ,WAAA,wCAGA,IAAAC,EAEAA,OADAvN,IAAAsO,QAAAtO,IAAA9C,EACA,IAAA6J,WAAAsH,QACArO,IAAA9C,EACA,IAAA6J,WAAAsH,EAAAC,GAEA,IAAAvH,WAAAsH,EAAAC,EAAApR,GAKA,OADAqQ,EAAA7M,UAAAoM,EAAA1Q,UACAmR,CACA,CAvJAgB,CAAA/Q,EAAAgQ,EAAAtQ,GAGA,GAAA,iBAAAM,EACA,MAAA,IAAA1B,UACA,yEAIA,IAAA4F,EAAAlE,EAAAkE,SAAAlE,EAAAkE,UACA,GAAA,MAAAA,GAAAA,IAAAlE,EACA,OAAAsP,EAAAnQ,KAAA+E,EAAA8L,EAAAtQ,GAGA,IAAAoM,EA2IA,SAAAhM,GACA,GAAAwP,EAAA0B,SAAAlR,GAAA,CACA,IAAAL,EAAA,EAAAwR,EAAAnR,EAAAJ,QACAqQ,EAAAF,EAAApQ,GAEA,OAAA,IAAAsQ,EAAArQ,QAIAI,EAAAoR,KAAAnB,EAAA,EAAA,EAAAtQ,GAHAsQ,CAKA,CAEA,QAAAvN,IAAA1C,EAAAJ,OACA,MAAA,iBAAAI,EAAAJ,QAAAyR,EAAArR,EAAAJ,QACAmQ,EAAA,GAEAa,EAAA5Q,GAGA,GAAA,WAAAA,EAAAsR,MAAAlS,MAAAM,QAAAM,EAAAuR,MACA,OAAAX,EAAA5Q,EAAAuR,KAEA,CAlKAC,CAAAtR,GACA,GAAA8L,EAAA,OAAAA,EAEA,GAAA,oBAAAxM,QAAA,MAAAA,OAAAiD,aACA,mBAAAvC,EAAAV,OAAAiD,aACA,OAAA+M,EAAAnQ,KACAa,EAAAV,OAAAiD,aAAA,UAAAyN,EAAAtQ,GAIA,MAAA,IAAApB,UACA,kHACA4D,QAAAlC,GAEA,CAmBA,SAAAuR,EAAAC,GACA,GAAA,iBAAAA,EACA,MAAA,IAAAlT,UAAA,0CACA,GAAAkT,EAAA,EACA,MAAA,IAAA1B,WAAA,cAAA0B,EAAA,iCAEA,CA0BA,SAAAvB,EAAAuB,GAEA,OADAD,EAAAC,GACA3B,EAAA2B,EAAA,EAAA,EAAA,EAAAP,EAAAO,GACA,CAuCA,SAAAd,EAAAG,GAGA,IAFA,IAAAnR,EAAAmR,EAAAnR,OAAA,EAAA,EAAA,EAAAuR,EAAAJ,EAAAnR,QACAqQ,EAAAF,EAAAnQ,GACAC,EAAA,EAAAA,EAAAD,EAAAC,GAAA,EACAoQ,EAAApQ,GAAA,IAAAkR,EAAAlR,GAEA,OAAAoQ,CACA,CAkDA,SAAAkB,EAAAvR,GAGA,GAAAA,GAAAkQ,EACA,MAAA,IAAAE,WAAA,0DACAF,EAAA/Q,SAAA,IAAA,UAEA,OAAA,EAAAa,CACA,CA6FA,SAAAuI,EAAAiI,EAAAC,GACA,GAAAb,EAAA0B,SAAAd,GACA,OAAAA,EAAAxQ,OAEA,GAAA8Q,YAAAC,OAAAP,IAAAS,EAAAT,EAAAM,aACA,OAAAN,EAAAjI,WAEA,GAAA,iBAAAiI,EACA,MAAA,IAAA5R,UACA,2FACA4D,QAAAgO,IAIA,IAAAzQ,EAAAyQ,EAAAxQ,OACA+R,EAAAxQ,UAAAvB,OAAA,IAAA,IAAAuB,UAAA,GACA,IAAAwQ,GAAA,IAAAhS,EAAA,OAAA,EAIA,IADA,IAAAiS,GAAA,IAEA,OAAAvB,GACA,IAAA,QACA,IAAA,SACA,IAAA,SACA,OAAA1Q,EACA,IAAA,OACA,IAAA,QACA,OAAAkS,EAAAzB,GAAAxQ,OACA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAA,EAAAD,EACA,IAAA,MACA,OAAAA,IAAA,EACA,IAAA,SACA,OAAAmS,EAAA1B,GAAAxQ,OACA,QACA,GAAAgS,EACA,OAAAD,GAAA,EAAAE,EAAAzB,GAAAxQ,OAEAyQ,GAAA,GAAAA,GAAA0B,cACAH,GAAA,EAGA,CAGA,SAAAI,EAAA3B,EAAA1G,EAAAC,GACA,IAAAgI,GAAA,EAcA,SALAlP,IAAAiH,GAAAA,EAAA,KACAA,EAAA,GAIAA,EAAAtI,KAAAzB,OACA,MAAA,GAOA,SAJA8C,IAAAkH,GAAAA,EAAAvI,KAAAzB,UACAgK,EAAAvI,KAAAzB,QAGAgK,GAAA,EACA,MAAA,GAOA,IAHAA,KAAA,KACAD,KAAA,GAGA,MAAA,GAKA,IAFA0G,IAAAA,EAAA,UAGA,OAAAA,GACA,IAAA,MACA,OAAA4B,EAAA5Q,KAAAsI,EAAAC,GAEA,IAAA,OACA,IAAA,QACA,OAAAsI,EAAA7Q,KAAAsI,EAAAC,GAEA,IAAA,QACA,OAAAuI,EAAA9Q,KAAAsI,EAAAC,GAEA,IAAA,SACA,IAAA,SACA,OAAAwI,EAAA/Q,KAAAsI,EAAAC,GAEA,IAAA,SACA,OAAAyI,EAAAhR,KAAAsI,EAAAC,GAEA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAA0I,EAAAjR,KAAAsI,EAAAC,GAEA,QACA,GAAAgI,EAAA,MAAA,IAAApT,UAAA,qBAAA6R,GACAA,GAAAA,EAAA,IAAA0B,cACAH,GAAA,EAGA,CAUA,SAAAW,EAAAvG,EAAApN,EAAA4T,GACA,IAAA3S,EAAAmM,EAAApN,GACAoN,EAAApN,GAAAoN,EAAAwG,GACAxG,EAAAwG,GAAA3S,CACA,CAwIA,SAAA4S,EAAA3B,EAAA4B,EAAA1B,EAAAX,EAAAsC,GAEA,GAAA,IAAA7B,EAAAlR,OAAA,OAAA,EAmBA,GAhBA,iBAAAoR,GACAX,EAAAW,EACAA,EAAA,GACAA,EAAA,WACAA,EAAA,WACAA,GAAA,aACAA,GAAA,YAGAK,EADAL,GAAAA,KAGAA,EAAA2B,EAAA,EAAA7B,EAAAlR,OAAA,GAIAoR,EAAA,IAAAA,EAAAF,EAAAlR,OAAAoR,GACAA,GAAAF,EAAAlR,OAAA,CACA,GAAA+S,EAAA,OAAA,EACA3B,EAAAF,EAAAlR,OAAA,CACA,MAAA,GAAAoR,EAAA,EAAA,CACA,IAAA2B,EACA,OAAA,EADA3B,EAAA,CAEA,CAQA,GALA,iBAAA0B,IACAA,EAAAlD,EAAAnQ,KAAAqT,EAAArC,IAIAb,EAAA0B,SAAAwB,GAEA,OAAA,IAAAA,EAAA9S,QACA,EAEAgT,EAAA9B,EAAA4B,EAAA1B,EAAAX,EAAAsC,GACA,GAAA,iBAAAD,EAEA,OADAA,GAAA,IACA,mBAAAjJ,WAAA3K,UAAA4K,QACAiJ,EACAlJ,WAAA3K,UAAA4K,QAAA1K,KAAA8R,EAAA4B,EAAA1B,GAEAvH,WAAA3K,UAAA+T,YAAA7T,KAAA8R,EAAA4B,EAAA1B,GAGA4B,EAAA9B,EAAA,CAAA4B,GAAA1B,EAAAX,EAAAsC,GAGA,MAAA,IAAAnU,UAAA,uCACA,CAEA,SAAAoU,EAAAzU,EAAAuU,EAAA1B,EAAAX,EAAAsC,GACA,IA0BA9S,EA1BAiT,EAAA,EACAC,EAAA5U,EAAAyB,OACAoT,EAAAN,EAAA9S,OAEA,QAAA8C,IAAA2N,IAEA,UADAA,EAAAhO,OAAAgO,GAAA0B,gBACA,UAAA1B,GACA,YAAAA,GAAA,aAAAA,GAAA,CACA,GAAAlS,EAAAyB,OAAA,GAAA8S,EAAA9S,OAAA,EACA,OAAA,EAEAkT,EAAA,EACAC,GAAA,EACAC,GAAA,EACAhC,GAAA,CACA,CAGA,SAAAiC,EAAAhD,EAAApQ,GACA,OAAA,IAAAiT,EACA7C,EAAApQ,GAEAoQ,EAAAiD,aAAArT,EAAAiT,EAEA,CAGA,GAAAH,EAAA,CACA,IAAAQ,GAAA,EACA,IAAAtT,EAAAmR,EAAAnR,EAAAkT,EAAAlT,IACA,GAAAoT,EAAA9U,EAAA0B,KAAAoT,EAAAP,GAAA,IAAAS,EAAA,EAAAtT,EAAAsT,IAEA,IADA,IAAAA,IAAAA,EAAAtT,GACAA,EAAAsT,EAAA,IAAAH,EAAA,OAAAG,EAAAL,OAEA,IAAAK,IAAAtT,GAAAA,EAAAsT,GACAA,GAAA,CAGA,MAEA,IADAnC,EAAAgC,EAAAD,IAAA/B,EAAA+B,EAAAC,GACAnT,EAAAmR,EAAAnR,GAAA,EAAAA,IAAA,CAEA,IADA,IAAAuT,GAAA,EACAvH,EAAA,EAAAA,EAAAmH,EAAAnH,IACA,GAAAoH,EAAA9U,EAAA0B,EAAAgM,KAAAoH,EAAAP,EAAA7G,GAAA,CACAuH,GAAA,EACA,KACA,CAEA,GAAAA,EAAA,OAAAvT,CACA,CAGA,OAAA,CACA,CAcA,SAAAwT,EAAApD,EAAAG,EAAAkD,EAAA1T,GACA0T,EAAA1Q,OAAA0Q,IAAA,EACA,IAAAC,EAAAtD,EAAArQ,OAAA0T,EACA1T,GAGAA,EAAAgD,OAAAhD,IACA2T,IACA3T,EAAA2T,GAJA3T,EAAA2T,EAQA,IAAAC,EAAApD,EAAAxQ,OAEAA,EAAA4T,EAAA,IACA5T,EAAA4T,EAAA,GAEA,IAAA,IAAA3T,EAAA,EAAAA,EAAAD,IAAAC,EAAA,CACA,IAAA4T,EAAAC,SAAAtD,EAAAuD,OAAA,EAAA9T,EAAA,GAAA,IACA,GAAAwR,EAAAoC,GAAA,OAAA5T,EACAoQ,EAAAqD,EAAAzT,GAAA4T,CACA,CACA,OAAA5T,CACA,CAEA,SAAA+T,EAAA3D,EAAAG,EAAAkD,EAAA1T,GACA,OAAAiU,EAAAhC,EAAAzB,EAAAH,EAAArQ,OAAA0T,GAAArD,EAAAqD,EAAA1T,EACA,CAEA,SAAAkU,EAAA7D,EAAAG,EAAAkD,EAAA1T,GACA,OAAAiU,EA63BA,SAAAE,GAEA,IADA,IAAAC,EAAA,GACAnU,EAAA,EAAAA,EAAAkU,EAAAnU,SAAAC,EAEAmU,EAAAjN,KAAA,IAAAgN,EAAAhL,WAAAlJ,IAEA,OAAAmU,CACA,CAp4BAC,CAAA7D,GAAAH,EAAAqD,EAAA1T,EACA,CAEA,SAAAsU,EAAAjE,EAAAG,EAAAkD,EAAA1T,GACA,OAAAkU,EAAA7D,EAAAG,EAAAkD,EAAA1T,EACA,CAEA,SAAAuU,EAAAlE,EAAAG,EAAAkD,EAAA1T,GACA,OAAAiU,EAAA/B,EAAA1B,GAAAH,EAAAqD,EAAA1T,EACA,CAEA,SAAAwU,EAAAnE,EAAAG,EAAAkD,EAAA1T,GACA,OAAAiU,EA03BA,SAAAE,EAAAM,GAGA,IAFA,IAAApP,EAAAqP,EAAAC,EACAP,EAAA,GACAnU,EAAA,EAAAA,EAAAkU,EAAAnU,WACAyU,GAAA,GAAA,KADAxU,EAIAyU,GADArP,EAAA8O,EAAAhL,WAAAlJ,KACA,EACA0U,EAAAtP,EAAA,IACA+O,EAAAjN,KAAAwN,GACAP,EAAAjN,KAAAuN,GAGA,OAAAN,CACA,CAx4BAQ,CAAApE,EAAAH,EAAArQ,OAAA0T,GAAArD,EAAAqD,EAAA1T,EACA,CAgFA,SAAAyS,EAAApC,EAAAtG,EAAAC,GACA,OAAA,IAAAD,GAAAC,IAAAqG,EAAArQ,OACA6P,EAAAzG,cAAAiH,GAEAR,EAAAzG,cAAAiH,EAAAhR,MAAA0K,EAAAC,GAEA,CAEA,SAAAsI,EAAAjC,EAAAtG,EAAAC,GACAA,EAAAnC,KAAAgN,IAAAxE,EAAArQ,OAAAgK,GAIA,IAHA,IAAAjH,EAAA,GAEA9C,EAAA8J,EACA9J,EAAA+J,GAAA,CACA,IAQA8K,EAAAC,EAAAC,EAAAC,EARAC,EAAA7E,EAAApQ,GACAkV,EAAA,KACAC,EAAAF,EAAA,IAAA,EACAA,EAAA,IAAA,EACAA,EAAA,IAAA,EACA,EAEA,GAAAjV,EAAAmV,GAAApL,EAGA,OAAAoL,GACA,KAAA,EACAF,EAAA,MACAC,EAAAD,GAEA,MACA,KAAA,EAEA,MAAA,KADAJ,EAAAzE,EAAApQ,EAAA,OAEAgV,GAAA,GAAAC,IAAA,EAAA,GAAAJ,GACA,MACAK,EAAAF,GAGA,MACA,KAAA,EACAH,EAAAzE,EAAApQ,EAAA,GACA8U,EAAA1E,EAAApQ,EAAA,GACA,MAAA,IAAA6U,IAAA,MAAA,IAAAC,KACAE,GAAA,GAAAC,IAAA,IAAA,GAAAJ,IAAA,EAAA,GAAAC,GACA,OAAAE,EAAA,OAAAA,EAAA,SACAE,EAAAF,GAGA,MACA,KAAA,EACAH,EAAAzE,EAAApQ,EAAA,GACA8U,EAAA1E,EAAApQ,EAAA,GACA+U,EAAA3E,EAAApQ,EAAA,GACA,MAAA,IAAA6U,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,MACApS,EAAAoE,KAAAgO,IAAA,GAAA,KAAA,OACAA,EAAA,MAAA,KAAAA,GAGApS,EAAAoE,KAAAgO,GACAlV,GAAAmV,CACA,CAEA,OAQA,SAAAC,GACA,IAAAtV,EAAAsV,EAAArV,OACA,GAAAD,GAAAuV,EACA,OAAA7S,OAAA8S,aAAA/T,MAAAiB,OAAA4S,GAIA,IAAAtS,EAAA,GACA9C,EAAA,EACA,KAAAA,EAAAF,GACAgD,GAAAN,OAAA8S,aAAA/T,MACAiB,OACA4S,EAAAhW,MAAAY,EAAAA,GAAAqV,IAGA,OAAAvS,CACA,CAxBAyS,CAAAzS,EACA,CA79BA6B,EAAA6Q,WAAAvF,EAgBAN,EAAA8F,oBAUA,WAEA,IACA,IAAAnX,EAAA,IAAAsL,WAAA,GAEA,OADAtL,EAAAiF,UAAA,CAAAA,UAAAqG,WAAA3K,UAAAyW,IAAA,WAAA,OAAA,EAAA,GACA,KAAApX,EAAAoX,KACA,CAAA,MAAAlR,GACA,OAAA,CACA,CACA,CAnBAmR,GAEAhG,EAAA8F,qBAAA,oBAAAG,SACA,mBAAAA,QAAAC,OACAD,QAAAC,MACA,iJAgBA7W,OAAAuB,eAAAoP,EAAA1Q,UAAA,SAAA,CACAuB,YAAA,EACAK,IAAA,WACA,GAAA8O,EAAA0B,SAAA7P,MACA,OAAAA,KAAAyP,MACA,IAGAjS,OAAAuB,eAAAoP,EAAA1Q,UAAA,SAAA,CACAuB,YAAA,EACAK,IAAA,WACA,GAAA8O,EAAA0B,SAAA7P,MACA,OAAAA,KAAA2P,UACA,IAqCA,oBAAAxR,QAAA,MAAAA,OAAAmW,SACAnG,EAAAhQ,OAAAmW,WAAAnG,GACA3Q,OAAAuB,eAAAoP,EAAAhQ,OAAAmW,QAAA,CACAzV,MAAA,KACAI,cAAA,EACAD,YAAA,EACAE,UAAA,IAIAiP,EAAAoG,SAAA,KA0DApG,EAAAnQ,KAAA,SAAAa,EAAAgQ,EAAAtQ,GACA,OAAAP,EAAAa,EAAAgQ,EAAAtQ,EACA,EAIA4P,EAAA1Q,UAAAsE,UAAAqG,WAAA3K,UACA0Q,EAAApM,UAAAqG,WA8BA+F,EAAAI,MAAA,SAAA8B,EAAAmE,EAAAxF,GACA,OArBA,SAAAqB,EAAAmE,EAAAxF,GAEA,OADAoB,EAAAC,GACAA,GAAA,EACA3B,EAAA2B,QAEAhP,IAAAmT,EAIA,iBAAAxF,EACAN,EAAA2B,GAAAmE,KAAAA,EAAAxF,GACAN,EAAA2B,GAAAmE,KAAAA,GAEA9F,EAAA2B,EACA,CAOA9B,CAAA8B,EAAAmE,EAAAxF,EACA,EAUAb,EAAAW,YAAA,SAAAuB,GACA,OAAAvB,EAAAuB,EACA,EAIAlC,EAAAsG,gBAAA,SAAApE,GACA,OAAAvB,EAAAuB,EACA,EAoGAlC,EAAA0B,SAAA,SAAAlF,GACA,OAAA,MAAAA,IAAA,IAAAA,EAAA+J,WACA/J,IAAAwD,EAAA1Q,SACA,EAEA0Q,EAAAwG,QAAA,SAAA5Q,EAAA4G,GAGA,GAFA6E,EAAAzL,EAAAqE,cAAArE,EAAAoK,EAAAnQ,KAAA+F,EAAAA,EAAAkO,OAAAlO,EAAA+C,aACA0I,EAAA7E,EAAAvC,cAAAuC,EAAAwD,EAAAnQ,KAAA2M,EAAAA,EAAAsH,OAAAtH,EAAA7D,cACAqH,EAAA0B,SAAA9L,KAAAoK,EAAA0B,SAAAlF,GACA,MAAA,IAAAxN,UACA,yEAIA,GAAA4G,IAAA4G,EAAA,OAAA,EAKA,IAHA,IAAApB,EAAAxF,EAAAxF,OACA8L,EAAAM,EAAApM,OAEAC,EAAA,EAAAF,EAAA8H,KAAAgN,IAAA7J,EAAAc,GAAA7L,EAAAF,IAAAE,EACA,GAAAuF,EAAAvF,KAAAmM,EAAAnM,GAAA,CACA+K,EAAAxF,EAAAvF,GACA6L,EAAAM,EAAAnM,GACA,KACA,CAGA,OAAA+K,EAAAc,GAAA,EACAA,EAAAd,EAAA,EACA,CACA,EAEA4E,EAAAc,WAAA,SAAAD,GACA,OAAAhO,OAAAgO,GAAA0B,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,EAEAvC,EAAAtH,OAAA,SAAA+N,EAAArW,GACA,IAAAR,MAAAM,QAAAuW,GACA,MAAA,IAAAzX,UAAA,+CAGA,GAAA,IAAAyX,EAAArW,OACA,OAAA4P,EAAAI,MAAA,GAGA,IAAA/P,EACA,QAAA6C,IAAA9C,EAEA,IADAA,EAAA,EACAC,EAAA,EAAAA,EAAAoW,EAAArW,SAAAC,EACAD,GAAAqW,EAAApW,GAAAD,OAIA,IAAAkR,EAAAtB,EAAAW,YAAAvQ,GACAsW,EAAA,EACA,IAAArW,EAAA,EAAAA,EAAAoW,EAAArW,SAAAC,EAAA,CACA,IAAAoQ,EAAAgG,EAAApW,GAIA,GAHAgR,EAAAZ,EAAAxG,cACAwG,EAAAT,EAAAnQ,KAAA4Q,KAEAT,EAAA0B,SAAAjB,GACA,MAAA,IAAAzR,UAAA,+CAEAyR,EAAAmB,KAAAN,EAAAoF,GACAA,GAAAjG,EAAArQ,MACA,CACA,OAAAkR,CACA,EAiDAtB,EAAArH,WAAAA,EA8EAqH,EAAA1Q,UAAAiX,WAAA,EAQAvG,EAAA1Q,UAAAqX,OAAA,WACA,IAAAxW,EAAA0B,KAAAzB,OACA,GAAAD,EAAA,GAAA,EACA,MAAA,IAAAqQ,WAAA,6CAEA,IAAA,IAAAnQ,EAAA,EAAAA,EAAAF,EAAAE,GAAA,EACA0S,EAAAlR,KAAAxB,EAAAA,EAAA,GAEA,OAAAwB,IACA,EAEAmO,EAAA1Q,UAAAsX,OAAA,WACA,IAAAzW,EAAA0B,KAAAzB,OACA,GAAAD,EAAA,GAAA,EACA,MAAA,IAAAqQ,WAAA,6CAEA,IAAA,IAAAnQ,EAAA,EAAAA,EAAAF,EAAAE,GAAA,EACA0S,EAAAlR,KAAAxB,EAAAA,EAAA,GACA0S,EAAAlR,KAAAxB,EAAA,EAAAA,EAAA,GAEA,OAAAwB,IACA,EAEAmO,EAAA1Q,UAAAuX,OAAA,WACA,IAAA1W,EAAA0B,KAAAzB,OACA,GAAAD,EAAA,GAAA,EACA,MAAA,IAAAqQ,WAAA,6CAEA,IAAA,IAAAnQ,EAAA,EAAAA,EAAAF,EAAAE,GAAA,EACA0S,EAAAlR,KAAAxB,EAAAA,EAAA,GACA0S,EAAAlR,KAAAxB,EAAA,EAAAA,EAAA,GACA0S,EAAAlR,KAAAxB,EAAA,EAAAA,EAAA,GACA0S,EAAAlR,KAAAxB,EAAA,EAAAA,EAAA,GAEA,OAAAwB,IACA,EAEAmO,EAAA1Q,UAAAC,SAAA,WACA,IAAAa,EAAAyB,KAAAzB,OACA,OAAA,IAAAA,EAAA,GACA,IAAAuB,UAAAvB,OAAAsS,EAAA7Q,KAAA,EAAAzB,GACAoS,EAAA5Q,MAAAC,KAAAF,UACA,EAEAqO,EAAA1Q,UAAAwX,eAAA9G,EAAA1Q,UAAAC,SAEAyQ,EAAA1Q,UAAAyX,OAAA,SAAAvK,GACA,IAAAwD,EAAA0B,SAAAlF,GAAA,MAAA,IAAAxN,UAAA,6BACA,OAAA6C,OAAA2K,GACA,IAAAwD,EAAAwG,QAAA3U,KAAA2K,EACA,EAEAwD,EAAA1Q,UAAA0X,QAAA,WACA,IAAAzC,EAAA,GACArM,EAAAlD,EAAAqL,kBAGA,OAFAkE,EAAA1S,KAAAtC,SAAA,MAAA,EAAA2I,GAAAqH,QAAA,UAAA,OAAA0H,OACApV,KAAAzB,OAAA8H,IAAAqM,GAAA,SACA,WAAAA,EAAA,GACA,EAEAvE,EAAA1Q,UAAAkX,QAAA,SAAApV,EAAA+I,EAAAC,EAAA8M,EAAAC,GAIA,GAHA9F,EAAAjQ,EAAA6I,cACA7I,EAAA4O,EAAAnQ,KAAAuB,EAAAA,EAAA0S,OAAA1S,EAAAuH,cAEAqH,EAAA0B,SAAAtQ,GACA,MAAA,IAAApC,UACA,iFACA4D,QAAAxB,IAiBA,QAbA8B,IAAAiH,IACAA,EAAA,QAEAjH,IAAAkH,IACAA,EAAAhJ,EAAAA,EAAAhB,OAAA,QAEA8C,IAAAgU,IACAA,EAAA,QAEAhU,IAAAiU,IACAA,EAAAtV,KAAAzB,QAGA+J,EAAA,GAAAC,EAAAhJ,EAAAhB,QAAA8W,EAAA,GAAAC,EAAAtV,KAAAzB,OACA,MAAA,IAAAoQ,WAAA,sBAGA,GAAA0G,GAAAC,GAAAhN,GAAAC,EACA,OAAA,EAEA,GAAA8M,GAAAC,EACA,OAAA,EAEA,GAAAhN,GAAAC,EACA,OAAA,EAQA,GAAAvI,OAAAT,EAAA,OAAA,EASA,IAPA,IAAAgK,GAJA+L,KAAA,IADAD,KAAA,GAMAhL,GAPA9B,KAAA,IADAD,KAAA,GASAhK,EAAA8H,KAAAgN,IAAA7J,EAAAc,GAEAkL,EAAAvV,KAAApC,MAAAyX,EAAAC,GACAE,EAAAjW,EAAA3B,MAAA0K,EAAAC,GAEA/J,EAAA,EAAAA,EAAAF,IAAAE,EACA,GAAA+W,EAAA/W,KAAAgX,EAAAhX,GAAA,CACA+K,EAAAgM,EAAA/W,GACA6L,EAAAmL,EAAAhX,GACA,KACA,CAGA,OAAA+K,EAAAc,GAAA,EACAA,EAAAd,EAAA,EACA,CACA,EA2HA4E,EAAA1Q,UAAAgY,SAAA,SAAApE,EAAA1B,EAAAX,GACA,OAAA,IAAAhP,KAAAqI,QAAAgJ,EAAA1B,EAAAX,EACA,EAEAb,EAAA1Q,UAAA4K,QAAA,SAAAgJ,EAAA1B,EAAAX,GACA,OAAAoC,EAAApR,KAAAqR,EAAA1B,EAAAX,GAAA,EACA,EAEAb,EAAA1Q,UAAA+T,YAAA,SAAAH,EAAA1B,EAAAX,GACA,OAAAoC,EAAApR,KAAAqR,EAAA1B,EAAAX,GAAA,EACA,EA+CAb,EAAA1Q,UAAA0R,MAAA,SAAAJ,EAAAkD,EAAA1T,EAAAyQ,GAEA,QAAA3N,IAAA4Q,EACAjD,EAAA,OACAzQ,EAAAyB,KAAAzB,OACA0T,EAAA,OAEA,QAAA5Q,IAAA9C,GAAA,iBAAA0T,EACAjD,EAAAiD,EACA1T,EAAAyB,KAAAzB,OACA0T,EAAA,MAEA,KAAAyD,SAAAzD,GAUA,MAAA,IAAAjO,MACA,2EAVAiO,KAAA,EACAyD,SAAAnX,IACAA,KAAA,OACA8C,IAAA2N,IAAAA,EAAA,UAEAA,EAAAzQ,EACAA,OAAA8C,EAMA,CAEA,IAAA6Q,EAAAlS,KAAAzB,OAAA0T,EAGA,SAFA5Q,IAAA9C,GAAAA,EAAA2T,KAAA3T,EAAA2T,GAEAnD,EAAAxQ,OAAA,IAAAA,EAAA,GAAA0T,EAAA,IAAAA,EAAAjS,KAAAzB,OACA,MAAA,IAAAoQ,WAAA,0CAGAK,IAAAA,EAAA,QAGA,IADA,IAAAuB,GAAA,IAEA,OAAAvB,GACA,IAAA,MACA,OAAAgD,EAAAhS,KAAA+O,EAAAkD,EAAA1T,GAEA,IAAA,OACA,IAAA,QACA,OAAAgU,EAAAvS,KAAA+O,EAAAkD,EAAA1T,GAEA,IAAA,QACA,OAAAkU,EAAAzS,KAAA+O,EAAAkD,EAAA1T,GAEA,IAAA,SACA,IAAA,SACA,OAAAsU,EAAA7S,KAAA+O,EAAAkD,EAAA1T,GAEA,IAAA,SAEA,OAAAuU,EAAA9S,KAAA+O,EAAAkD,EAAA1T,GAEA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAAwU,EAAA/S,KAAA+O,EAAAkD,EAAA1T,GAEA,QACA,GAAAgS,EAAA,MAAA,IAAApT,UAAA,qBAAA6R,GACAA,GAAA,GAAAA,GAAA0B,cACAH,GAAA,EAGA,EAEApC,EAAA1Q,UAAAyP,OAAA,WACA,MAAA,CACA+C,KAAA,SACAC,KAAAnS,MAAAN,UAAAG,MAAAD,KAAAqC,KAAA2V,MAAA3V,KAAA,GAEA,EAsFA,IAAA6T,EAAA,KAoBA,SAAA/C,EAAAlC,EAAAtG,EAAAC,GACA,IAAAqN,EAAA,GACArN,EAAAnC,KAAAgN,IAAAxE,EAAArQ,OAAAgK,GAEA,IAAA,IAAA/J,EAAA8J,EAAA9J,EAAA+J,IAAA/J,EACAoX,GAAA5U,OAAA8S,aAAA,IAAAlF,EAAApQ,IAEA,OAAAoX,CACA,CAEA,SAAA7E,EAAAnC,EAAAtG,EAAAC,GACA,IAAAqN,EAAA,GACArN,EAAAnC,KAAAgN,IAAAxE,EAAArQ,OAAAgK,GAEA,IAAA,IAAA/J,EAAA8J,EAAA9J,EAAA+J,IAAA/J,EACAoX,GAAA5U,OAAA8S,aAAAlF,EAAApQ,IAEA,OAAAoX,CACA,CAEA,SAAAhF,EAAAhC,EAAAtG,EAAAC,GACA,IAAAjK,EAAAsQ,EAAArQ,SAEA+J,GAAAA,EAAA,KAAAA,EAAA,KACAC,GAAAA,EAAA,GAAAA,EAAAjK,KAAAiK,EAAAjK,GAGA,IADA,IAAAuX,EAAA,GACArX,EAAA8J,EAAA9J,EAAA+J,IAAA/J,EACAqX,GAAAC,EAAAlH,EAAApQ,IAEA,OAAAqX,CACA,CAEA,SAAA5E,EAAArC,EAAAtG,EAAAC,GAGA,IAFA,IAAAwN,EAAAnH,EAAAhR,MAAA0K,EAAAC,GACAjH,EAAA,GACA9C,EAAA,EAAAA,EAAAuX,EAAAxX,OAAAC,GAAA,EACA8C,GAAAN,OAAA8S,aAAAiC,EAAAvX,GAAA,IAAAuX,EAAAvX,EAAA,IAEA,OAAA8C,CACA,CAgCA,SAAA0U,EAAA/D,EAAAgE,EAAA1X,GACA,GAAA0T,EAAA,GAAA,GAAAA,EAAA,EAAA,MAAA,IAAAtD,WAAA,sBACA,GAAAsD,EAAAgE,EAAA1X,EAAA,MAAA,IAAAoQ,WAAA,wCACA,CA4KA,SAAAuH,EAAAtH,EAAA/P,EAAAoT,EAAAgE,EAAA5P,EAAA+M,GACA,IAAAjF,EAAA0B,SAAAjB,GAAA,MAAA,IAAAzR,UAAA,+CACA,GAAA0B,EAAAwH,GAAAxH,EAAAuU,EAAA,MAAA,IAAAzE,WAAA,qCACA,GAAAsD,EAAAgE,EAAArH,EAAArQ,OAAA,MAAA,IAAAoQ,WAAA,qBACA,CAwLA,SAAAwH,EAAAvH,EAAA/P,EAAAoT,EAAAgE,EAAA5P,EAAA+M,GACA,GAAAnB,EAAAgE,EAAArH,EAAArQ,OAAA,MAAA,IAAAoQ,WAAA,sBACA,GAAAsD,EAAA,EAAA,MAAA,IAAAtD,WAAA,qBACA,CAEA,SAAAyH,EAAAxH,EAAA/P,EAAAoT,EAAAoE,EAAAC,GAOA,OANAzX,GAAAA,EACAoT,KAAA,EACAqE,GACAH,EAAAvH,EAAA/P,EAAAoT,EAAA,GAEA5D,EAAAc,MAAAP,EAAA/P,EAAAoT,EAAAoE,EAAA,GAAA,GACApE,EAAA,CACA,CAUA,SAAAsE,EAAA3H,EAAA/P,EAAAoT,EAAAoE,EAAAC,GAOA,OANAzX,GAAAA,EACAoT,KAAA,EACAqE,GACAH,EAAAvH,EAAA/P,EAAAoT,EAAA,GAEA5D,EAAAc,MAAAP,EAAA/P,EAAAoT,EAAAoE,EAAA,GAAA,GACApE,EAAA,CACA,CAxaA9D,EAAA1Q,UAAAG,MAAA,SAAA0K,EAAAC,GACA,IAAAjK,EAAA0B,KAAAzB,QACA+J,IAAAA,GAGA,GACAA,GAAAhK,GACA,IAAAgK,EAAA,GACAA,EAAAhK,IACAgK,EAAAhK,IANAiK,OAAAlH,IAAAkH,EAAAjK,IAAAiK,GASA,GACAA,GAAAjK,GACA,IAAAiK,EAAA,GACAA,EAAAjK,IACAiK,EAAAjK,GAGAiK,EAAAD,IAAAC,EAAAD,GAEA,IAAAkO,EAAAxW,KAAAyW,SAAAnO,EAAAC,GAGA,OADAiO,EAAAzU,UAAAoM,EAAA1Q,UACA+Y,CACA,EAUArI,EAAA1Q,UAAAiZ,WAAA,SAAAzE,EAAAnL,EAAAwP,GACArE,KAAA,EACAnL,KAAA,EACAwP,GAAAN,EAAA/D,EAAAnL,EAAA9G,KAAAzB,QAKA,IAHA,IAAA8S,EAAArR,KAAAiS,GACAjF,EAAA,EACAxO,EAAA,IACAA,EAAAsI,IAAAkG,GAAA,MACAqE,GAAArR,KAAAiS,EAAAzT,GAAAwO,EAGA,OAAAqE,CACA,EAEAlD,EAAA1Q,UAAAkZ,WAAA,SAAA1E,EAAAnL,EAAAwP,GACArE,KAAA,EACAnL,KAAA,EACAwP,GACAN,EAAA/D,EAAAnL,EAAA9G,KAAAzB,QAKA,IAFA,IAAA8S,EAAArR,KAAAiS,IAAAnL,GACAkG,EAAA,EACAlG,EAAA,IAAAkG,GAAA,MACAqE,GAAArR,KAAAiS,IAAAnL,GAAAkG,EAGA,OAAAqE,CACA,EAEAlD,EAAA1Q,UAAAmZ,UAAA,SAAA3E,EAAAqE,GAGA,OAFArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QACAyB,KAAAiS,EACA,EAEA9D,EAAA1Q,UAAAoZ,aAAA,SAAA5E,EAAAqE,GAGA,OAFArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QACAyB,KAAAiS,GAAAjS,KAAAiS,EAAA,IAAA,CACA,EAEA9D,EAAA1Q,UAAAoU,aAAA,SAAAI,EAAAqE,GAGA,OAFArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QACAyB,KAAAiS,IAAA,EAAAjS,KAAAiS,EAAA,EACA,EAEA9D,EAAA1Q,UAAAqZ,aAAA,SAAA7E,EAAAqE,GAIA,OAHArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,SAEAyB,KAAAiS,GACAjS,KAAAiS,EAAA,IAAA,EACAjS,KAAAiS,EAAA,IAAA,IACA,SAAAjS,KAAAiS,EAAA,EACA,EAEA9D,EAAA1Q,UAAAsZ,aAAA,SAAA9E,EAAAqE,GAIA,OAHArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QAEA,SAAAyB,KAAAiS,IACAjS,KAAAiS,EAAA,IAAA,GACAjS,KAAAiS,EAAA,IAAA,EACAjS,KAAAiS,EAAA,GACA,EAEA9D,EAAA1Q,UAAAuZ,UAAA,SAAA/E,EAAAnL,EAAAwP,GACArE,KAAA,EACAnL,KAAA,EACAwP,GAAAN,EAAA/D,EAAAnL,EAAA9G,KAAAzB,QAKA,IAHA,IAAA8S,EAAArR,KAAAiS,GACAjF,EAAA,EACAxO,EAAA,IACAA,EAAAsI,IAAAkG,GAAA,MACAqE,GAAArR,KAAAiS,EAAAzT,GAAAwO,EAMA,OAFAqE,IAFArE,GAAA,OAEAqE,GAAAjL,KAAAsG,IAAA,EAAA,EAAA5F,IAEAuK,CACA,EAEAlD,EAAA1Q,UAAAwZ,UAAA,SAAAhF,EAAAnL,EAAAwP,GACArE,KAAA,EACAnL,KAAA,EACAwP,GAAAN,EAAA/D,EAAAnL,EAAA9G,KAAAzB,QAKA,IAHA,IAAAC,EAAAsI,EACAkG,EAAA,EACAqE,EAAArR,KAAAiS,IAAAzT,GACAA,EAAA,IAAAwO,GAAA,MACAqE,GAAArR,KAAAiS,IAAAzT,GAAAwO,EAMA,OAFAqE,IAFArE,GAAA,OAEAqE,GAAAjL,KAAAsG,IAAA,EAAA,EAAA5F,IAEAuK,CACA,EAEAlD,EAAA1Q,UAAAyZ,SAAA,SAAAjF,EAAAqE,GAGA,OAFArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QACA,IAAAyB,KAAAiS,IACA,GAAA,IAAAjS,KAAAiS,GAAA,GADAjS,KAAAiS,EAEA,EAEA9D,EAAA1Q,UAAA0Z,YAAA,SAAAlF,EAAAqE,GACArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QACA,IAAA8S,EAAArR,KAAAiS,GAAAjS,KAAAiS,EAAA,IAAA,EACA,OAAA,MAAAZ,EAAA,WAAAA,EAAAA,CACA,EAEAlD,EAAA1Q,UAAA2Z,YAAA,SAAAnF,EAAAqE,GACArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QACA,IAAA8S,EAAArR,KAAAiS,EAAA,GAAAjS,KAAAiS,IAAA,EACA,OAAA,MAAAZ,EAAA,WAAAA,EAAAA,CACA,EAEAlD,EAAA1Q,UAAA4Z,YAAA,SAAApF,EAAAqE,GAIA,OAHArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QAEAyB,KAAAiS,GACAjS,KAAAiS,EAAA,IAAA,EACAjS,KAAAiS,EAAA,IAAA,GACAjS,KAAAiS,EAAA,IAAA,EACA,EAEA9D,EAAA1Q,UAAA6Z,YAAA,SAAArF,EAAAqE,GAIA,OAHArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QAEAyB,KAAAiS,IAAA,GACAjS,KAAAiS,EAAA,IAAA,GACAjS,KAAAiS,EAAA,IAAA,EACAjS,KAAAiS,EAAA,EACA,EAEA9D,EAAA1Q,UAAA8Z,YAAA,SAAAtF,EAAAqE,GAGA,OAFArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QACA8P,EAAAuD,KAAA5R,KAAAiS,GAAA,EAAA,GAAA,EACA,EAEA9D,EAAA1Q,UAAA+Z,YAAA,SAAAvF,EAAAqE,GAGA,OAFArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QACA8P,EAAAuD,KAAA5R,KAAAiS,GAAA,EAAA,GAAA,EACA,EAEA9D,EAAA1Q,UAAAga,aAAA,SAAAxF,EAAAqE,GAGA,OAFArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QACA8P,EAAAuD,KAAA5R,KAAAiS,GAAA,EAAA,GAAA,EACA,EAEA9D,EAAA1Q,UAAAia,aAAA,SAAAzF,EAAAqE,GAGA,OAFArE,KAAA,EACAqE,GAAAN,EAAA/D,EAAA,EAAAjS,KAAAzB,QACA8P,EAAAuD,KAAA5R,KAAAiS,GAAA,EAAA,GAAA,EACA,EAQA9D,EAAA1Q,UAAAka,YAAA,SAAA9Y,EAAAoT,EAAAnL,EAAAwP,IACAzX,GAAAA,EACAoT,KAAA,EACAnL,KAAA,EACAwP,IAEAJ,EAAAlW,KAAAnB,EAAAoT,EAAAnL,EADAV,KAAAsG,IAAA,EAAA,EAAA5F,GAAA,EACA,GAGA,IAAAkG,EAAA,EACAxO,EAAA,EAEA,IADAwB,KAAAiS,GAAA,IAAApT,IACAL,EAAAsI,IAAAkG,GAAA,MACAhN,KAAAiS,EAAAzT,GAAAK,EAAAmO,EAAA,IAGA,OAAAiF,EAAAnL,CACA,EAEAqH,EAAA1Q,UAAAma,YAAA,SAAA/Y,EAAAoT,EAAAnL,EAAAwP,IACAzX,GAAAA,EACAoT,KAAA,EACAnL,KAAA,EACAwP,IAEAJ,EAAAlW,KAAAnB,EAAAoT,EAAAnL,EADAV,KAAAsG,IAAA,EAAA,EAAA5F,GAAA,EACA,GAGA,IAAAtI,EAAAsI,EAAA,EACAkG,EAAA,EAEA,IADAhN,KAAAiS,EAAAzT,GAAA,IAAAK,IACAL,GAAA,IAAAwO,GAAA,MACAhN,KAAAiS,EAAAzT,GAAAK,EAAAmO,EAAA,IAGA,OAAAiF,EAAAnL,CACA,EAEAqH,EAAA1Q,UAAAoa,WAAA,SAAAhZ,EAAAoT,EAAAqE,GAKA,OAJAzX,GAAAA,EACAoT,KAAA,EACAqE,GAAAJ,EAAAlW,KAAAnB,EAAAoT,EAAA,EAAA,IAAA,GACAjS,KAAAiS,GAAA,IAAApT,EACAoT,EAAA,CACA,EAEA9D,EAAA1Q,UAAAqa,cAAA,SAAAjZ,EAAAoT,EAAAqE,GAMA,OALAzX,GAAAA,EACAoT,KAAA,EACAqE,GAAAJ,EAAAlW,KAAAnB,EAAAoT,EAAA,EAAA,MAAA,GACAjS,KAAAiS,GAAA,IAAApT,EACAmB,KAAAiS,EAAA,GAAApT,IAAA,EACAoT,EAAA,CACA,EAEA9D,EAAA1Q,UAAAsa,cAAA,SAAAlZ,EAAAoT,EAAAqE,GAMA,OALAzX,GAAAA,EACAoT,KAAA,EACAqE,GAAAJ,EAAAlW,KAAAnB,EAAAoT,EAAA,EAAA,MAAA,GACAjS,KAAAiS,GAAApT,IAAA,EACAmB,KAAAiS,EAAA,GAAA,IAAApT,EACAoT,EAAA,CACA,EAEA9D,EAAA1Q,UAAAua,cAAA,SAAAnZ,EAAAoT,EAAAqE,GAQA,OAPAzX,GAAAA,EACAoT,KAAA,EACAqE,GAAAJ,EAAAlW,KAAAnB,EAAAoT,EAAA,EAAA,WAAA,GACAjS,KAAAiS,EAAA,GAAApT,IAAA,GACAmB,KAAAiS,EAAA,GAAApT,IAAA,GACAmB,KAAAiS,EAAA,GAAApT,IAAA,EACAmB,KAAAiS,GAAA,IAAApT,EACAoT,EAAA,CACA,EAEA9D,EAAA1Q,UAAAwa,cAAA,SAAApZ,EAAAoT,EAAAqE,GAQA,OAPAzX,GAAAA,EACAoT,KAAA,EACAqE,GAAAJ,EAAAlW,KAAAnB,EAAAoT,EAAA,EAAA,WAAA,GACAjS,KAAAiS,GAAApT,IAAA,GACAmB,KAAAiS,EAAA,GAAApT,IAAA,GACAmB,KAAAiS,EAAA,GAAApT,IAAA,EACAmB,KAAAiS,EAAA,GAAA,IAAApT,EACAoT,EAAA,CACA,EAEA9D,EAAA1Q,UAAAya,WAAA,SAAArZ,EAAAoT,EAAAnL,EAAAwP,GAGA,GAFAzX,GAAAA,EACAoT,KAAA,GACAqE,EAAA,CACA,IAAAlS,EAAAgC,KAAAsG,IAAA,EAAA,EAAA5F,EAAA,GAEAoP,EAAAlW,KAAAnB,EAAAoT,EAAAnL,EAAA1C,EAAA,GAAAA,EACA,CAEA,IAAA5F,EAAA,EACAwO,EAAA,EACAjB,EAAA,EAEA,IADA/L,KAAAiS,GAAA,IAAApT,IACAL,EAAAsI,IAAAkG,GAAA,MACAnO,EAAA,GAAA,IAAAkN,GAAA,IAAA/L,KAAAiS,EAAAzT,EAAA,KACAuN,EAAA,GAEA/L,KAAAiS,EAAAzT,IAAAK,EAAAmO,GAAA,GAAAjB,EAAA,IAGA,OAAAkG,EAAAnL,CACA,EAEAqH,EAAA1Q,UAAA0a,WAAA,SAAAtZ,EAAAoT,EAAAnL,EAAAwP,GAGA,GAFAzX,GAAAA,EACAoT,KAAA,GACAqE,EAAA,CACA,IAAAlS,EAAAgC,KAAAsG,IAAA,EAAA,EAAA5F,EAAA,GAEAoP,EAAAlW,KAAAnB,EAAAoT,EAAAnL,EAAA1C,EAAA,GAAAA,EACA,CAEA,IAAA5F,EAAAsI,EAAA,EACAkG,EAAA,EACAjB,EAAA,EAEA,IADA/L,KAAAiS,EAAAzT,GAAA,IAAAK,IACAL,GAAA,IAAAwO,GAAA,MACAnO,EAAA,GAAA,IAAAkN,GAAA,IAAA/L,KAAAiS,EAAAzT,EAAA,KACAuN,EAAA,GAEA/L,KAAAiS,EAAAzT,IAAAK,EAAAmO,GAAA,GAAAjB,EAAA,IAGA,OAAAkG,EAAAnL,CACA,EAEAqH,EAAA1Q,UAAA2a,UAAA,SAAAvZ,EAAAoT,EAAAqE,GAMA,OALAzX,GAAAA,EACAoT,KAAA,EACAqE,GAAAJ,EAAAlW,KAAAnB,EAAAoT,EAAA,EAAA,KAAA,KACApT,EAAA,IAAAA,EAAA,IAAAA,EAAA,GACAmB,KAAAiS,GAAA,IAAApT,EACAoT,EAAA,CACA,EAEA9D,EAAA1Q,UAAA4a,aAAA,SAAAxZ,EAAAoT,EAAAqE,GAMA,OALAzX,GAAAA,EACAoT,KAAA,EACAqE,GAAAJ,EAAAlW,KAAAnB,EAAAoT,EAAA,EAAA,OAAA,OACAjS,KAAAiS,GAAA,IAAApT,EACAmB,KAAAiS,EAAA,GAAApT,IAAA,EACAoT,EAAA,CACA,EAEA9D,EAAA1Q,UAAA6a,aAAA,SAAAzZ,EAAAoT,EAAAqE,GAMA,OALAzX,GAAAA,EACAoT,KAAA,EACAqE,GAAAJ,EAAAlW,KAAAnB,EAAAoT,EAAA,EAAA,OAAA,OACAjS,KAAAiS,GAAApT,IAAA,EACAmB,KAAAiS,EAAA,GAAA,IAAApT,EACAoT,EAAA,CACA,EAEA9D,EAAA1Q,UAAA8a,aAAA,SAAA1Z,EAAAoT,EAAAqE,GAQA,OAPAzX,GAAAA,EACAoT,KAAA,EACAqE,GAAAJ,EAAAlW,KAAAnB,EAAAoT,EAAA,EAAA,YAAA,YACAjS,KAAAiS,GAAA,IAAApT,EACAmB,KAAAiS,EAAA,GAAApT,IAAA,EACAmB,KAAAiS,EAAA,GAAApT,IAAA,GACAmB,KAAAiS,EAAA,GAAApT,IAAA,GACAoT,EAAA,CACA,EAEA9D,EAAA1Q,UAAA+a,aAAA,SAAA3Z,EAAAoT,EAAAqE,GASA,OARAzX,GAAAA,EACAoT,KAAA,EACAqE,GAAAJ,EAAAlW,KAAAnB,EAAAoT,EAAA,EAAA,YAAA,YACApT,EAAA,IAAAA,EAAA,WAAAA,EAAA,GACAmB,KAAAiS,GAAApT,IAAA,GACAmB,KAAAiS,EAAA,GAAApT,IAAA,GACAmB,KAAAiS,EAAA,GAAApT,IAAA,EACAmB,KAAAiS,EAAA,GAAA,IAAApT,EACAoT,EAAA,CACA,EAiBA9D,EAAA1Q,UAAAgb,aAAA,SAAA5Z,EAAAoT,EAAAqE,GACA,OAAAF,EAAApW,KAAAnB,EAAAoT,GAAA,EAAAqE,EACA,EAEAnI,EAAA1Q,UAAAib,aAAA,SAAA7Z,EAAAoT,EAAAqE,GACA,OAAAF,EAAApW,KAAAnB,EAAAoT,GAAA,EAAAqE,EACA,EAYAnI,EAAA1Q,UAAAkb,cAAA,SAAA9Z,EAAAoT,EAAAqE,GACA,OAAAC,EAAAvW,KAAAnB,EAAAoT,GAAA,EAAAqE,EACA,EAEAnI,EAAA1Q,UAAAmb,cAAA,SAAA/Z,EAAAoT,EAAAqE,GACA,OAAAC,EAAAvW,KAAAnB,EAAAoT,GAAA,EAAAqE,EACA,EAGAnI,EAAA1Q,UAAAsS,KAAA,SAAAxQ,EAAAsZ,EAAAvQ,EAAAC,GACA,IAAA4F,EAAA0B,SAAAtQ,GAAA,MAAA,IAAApC,UAAA,+BAQA,GAPAmL,IAAAA,EAAA,GACAC,GAAA,IAAAA,IAAAA,EAAAvI,KAAAzB,QACAsa,GAAAtZ,EAAAhB,SAAAsa,EAAAtZ,EAAAhB,QACAsa,IAAAA,EAAA,GACAtQ,EAAA,GAAAA,EAAAD,IAAAC,EAAAD,GAGAC,IAAAD,EAAA,OAAA,EACA,GAAA,IAAA/I,EAAAhB,QAAA,IAAAyB,KAAAzB,OAAA,OAAA,EAGA,GAAAsa,EAAA,EACA,MAAA,IAAAlK,WAAA,6BAEA,GAAArG,EAAA,GAAAA,GAAAtI,KAAAzB,OAAA,MAAA,IAAAoQ,WAAA,sBACA,GAAApG,EAAA,EAAA,MAAA,IAAAoG,WAAA,2BAGApG,EAAAvI,KAAAzB,SAAAgK,EAAAvI,KAAAzB,QACAgB,EAAAhB,OAAAsa,EAAAtQ,EAAAD,IACAC,EAAAhJ,EAAAhB,OAAAsa,EAAAvQ,GAGA,IAAAhK,EAAAiK,EAAAD,EAEA,GAAAtI,OAAAT,GAAA,mBAAA6I,WAAA3K,UAAAqb,WAEA9Y,KAAA8Y,WAAAD,EAAAvQ,EAAAC,QACA,GAAAvI,OAAAT,GAAA+I,EAAAuQ,GAAAA,EAAAtQ,EAEA,IAAA,IAAA/J,EAAAF,EAAA,EAAAE,GAAA,IAAAA,EACAe,EAAAf,EAAAqa,GAAA7Y,KAAAxB,EAAA8J,QAGAF,WAAA3K,UAAAsb,IAAApb,KACA4B,EACAS,KAAAyW,SAAAnO,EAAAC,GACAsQ,GAIA,OAAAva,CACA,EAMA6P,EAAA1Q,UAAA+W,KAAA,SAAAnD,EAAA/I,EAAAC,EAAAyG,GAEA,GAAA,iBAAAqC,EAAA,CASA,GARA,iBAAA/I,GACA0G,EAAA1G,EACAA,EAAA,EACAC,EAAAvI,KAAAzB,QACA,iBAAAgK,IACAyG,EAAAzG,EACAA,EAAAvI,KAAAzB,aAEA8C,IAAA2N,GAAA,iBAAAA,EACA,MAAA,IAAA7R,UAAA,6BAEA,GAAA,iBAAA6R,IAAAb,EAAAc,WAAAD,GACA,MAAA,IAAA7R,UAAA,qBAAA6R,GAEA,GAAA,IAAAqC,EAAA9S,OAAA,CACA,IAAA0F,EAAAoN,EAAA3J,WAAA,IACA,SAAAsH,GAAA/K,EAAA,KACA,WAAA+K,KAEAqC,EAAApN,EAEA,CACA,KAAA,iBAAAoN,IACAA,GAAA,KAIA,GAAA/I,EAAA,GAAAtI,KAAAzB,OAAA+J,GAAAtI,KAAAzB,OAAAgK,EACA,MAAA,IAAAoG,WAAA,sBAGA,GAAApG,GAAAD,EACA,OAAAtI,KAQA,IAAAxB,EACA,GANA8J,KAAA,EACAC,OAAAlH,IAAAkH,EAAAvI,KAAAzB,OAAAgK,IAAA,EAEA8I,IAAAA,EAAA,GAGA,iBAAAA,EACA,IAAA7S,EAAA8J,EAAA9J,EAAA+J,IAAA/J,EACAwB,KAAAxB,GAAA6S,MAEA,CACA,IAAA0E,EAAA5H,EAAA0B,SAAAwB,GACAA,EACAlD,EAAAnQ,KAAAqT,EAAArC,GACA1Q,EAAAyX,EAAAxX,OACA,GAAA,IAAAD,EACA,MAAA,IAAAnB,UAAA,cAAAkU,EACA,qCAEA,IAAA7S,EAAA,EAAAA,EAAA+J,EAAAD,IAAA9J,EACAwB,KAAAxB,EAAA8J,GAAAyN,EAAAvX,EAAAF,EAEA,CAEA,OAAA0B,IACA,EAKA,IAAAgZ,EAAA,oBAgBA,SAAAlD,EAAAvY,GACA,OAAAA,EAAA,GAAA,IAAAA,EAAAG,SAAA,IACAH,EAAAG,SAAA,GACA,CAEA,SAAA8S,EAAAzB,EAAAiE,GAEA,IAAAU,EADAV,EAAAA,GAAAiG,IAMA,IAJA,IAAA1a,EAAAwQ,EAAAxQ,OACA2a,EAAA,KACAnD,EAAA,GAEAvX,EAAA,EAAAA,EAAAD,IAAAC,EAAA,CAIA,IAHAkV,EAAA3E,EAAArH,WAAAlJ,IAGA,OAAAkV,EAAA,MAAA,CAEA,IAAAwF,EAAA,CAEA,GAAAxF,EAAA,MAAA,EAEAV,GAAA,IAAA,GAAA+C,EAAArQ,KAAA,IAAA,IAAA,KACA,QACA,CAAA,GAAAlH,EAAA,IAAAD,EAAA,EAEAyU,GAAA,IAAA,GAAA+C,EAAArQ,KAAA,IAAA,IAAA,KACA,QACA,CAGAwT,EAAAxF,EAEA,QACA,CAGA,GAAAA,EAAA,MAAA,EACAV,GAAA,IAAA,GAAA+C,EAAArQ,KAAA,IAAA,IAAA,KACAwT,EAAAxF,EACA,QACA,CAGAA,EAAA,OAAAwF,EAAA,OAAA,GAAAxF,EAAA,MACA,MAAAwF,IAEAlG,GAAA,IAAA,GAAA+C,EAAArQ,KAAA,IAAA,IAAA,KAMA,GAHAwT,EAAA,KAGAxF,EAAA,IAAA,CACA,IAAAV,GAAA,GAAA,EAAA,MACA+C,EAAArQ,KAAAgO,EACA,MAAA,GAAAA,EAAA,KAAA,CACA,IAAAV,GAAA,GAAA,EAAA,MACA+C,EAAArQ,KACAgO,GAAA,EAAA,IACA,GAAAA,EAAA,IAEA,MAAA,GAAAA,EAAA,MAAA,CACA,IAAAV,GAAA,GAAA,EAAA,MACA+C,EAAArQ,KACAgO,GAAA,GAAA,IACAA,GAAA,EAAA,GAAA,IACA,GAAAA,EAAA,IAEA,KAAA,MAAAA,EAAA,SASA,MAAA,IAAA1P,MAAA,sBARA,IAAAgP,GAAA,GAAA,EAAA,MACA+C,EAAArQ,KACAgO,GAAA,GAAA,IACAA,GAAA,GAAA,GAAA,IACAA,GAAA,EAAA,GAAA,IACA,GAAAA,EAAA,IAIA,CACA,CAEA,OAAAqC,CACA,CA2BA,SAAAtF,EAAAiC,GACA,OAAAtE,EAAAhH,YA7HA,SAAAsL,GAMA,IAFAA,GAFAA,EAAAA,EAAAyG,MAAA,KAAA,IAEA/D,OAAA1H,QAAAsL,EAAA,KAEAza,OAAA,EAAA,MAAA,GAEA,KAAAmU,EAAAnU,OAAA,GAAA,GACAmU,GAAA,IAEA,OAAAA,CACA,CAiHA0G,CAAA1G,GACA,CAEA,SAAAF,EAAA6G,EAAAC,EAAArH,EAAA1T,GACA,IAAA,IAAAC,EAAA,EAAAA,EAAAD,KACAC,EAAAyT,GAAAqH,EAAA/a,QAAAC,GAAA6a,EAAA9a,UADAC,EAEA8a,EAAA9a,EAAAyT,GAAAoH,EAAA7a,GAEA,OAAAA,CACA,CAKA,SAAAgR,EAAA7Q,EAAAsR,GACA,OAAAtR,aAAAsR,GACA,MAAAtR,GAAA,MAAAA,EAAAd,aAAA,MAAAc,EAAAd,YAAAC,MACAa,EAAAd,YAAAC,OAAAmS,EAAAnS,IACA,CACA,SAAAkS,EAAArR,GAEA,OAAAA,GAAAA,CACA,CnB67CC,GAAEhB,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,UAAUsK,OAE5C,EAAE,CAAC,YAAY,GAAGsB,OAAS,GAAGpB,QAAU,KAAK,GAAG,CAAC,SAASxK,EAAQT,EAAOD,GoB/qGzEC,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,kCpBmrGA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASU,EAAQT,EAAOD,GqBjuGlC,IAAAoW,EAAA1V,EAAA,6BAEA2V,EAAA3V,EAAA,mBAEA4V,EAAA,SAAAC,GAAAlY,UAAAiY,EAAAC,GAAA,IAAAC,EAAA3X,aAAAyX,GAEA,SAAAA,EAAAG,EAAAC,EAAAC,GACA,IAAAC,EAuBA,OAvBA3Z,iBAAAJ,KAAAyZ,IAGAM,OAFA1Y,IAAAuY,EAEAD,EAAAhc,KAAAqC,KAAA,CAAA,GAIA2Z,EAAAhc,KAAAqC,KAAA4Z,EAAAC,EAAAC,IAGAE,YAAA,cAGAD,EAAAE,SAAA,CAAA,EAEAF,EAAAG,WAAA,CAAA,EAEAH,EAAAI,MAAA,IAAAX,EAGAO,EAAAK,UAAA,EAGAL,EAAAM,OAAA,EAAA7X,2BAAAuX,EACA,CA8KA,OA9KArZ,cAAA+Y,EAAA,CAAA,CAAA7a,IAAA,YAAAS,IAEA,WAEA,OAAAW,KAAAka,UACA,GAEA,CAAAtb,IAAA,MAAAC,MACA,SAAAyb,EAAAC,GAGA,GAAAva,KAAAia,SAAA/Z,eAAAqa,GAKA,OAFAva,KAAAia,SAAAM,GAAAC,MAAAF,EACAta,KAAAka,WAAAK,GAAAD,EACAta,KAAAia,SAAAM,GAAAC,MAGA,IAAAC,EAAAza,KAAAma,MAAAzU,KAAA4U,EAAAC,GAiBA,OAhBAva,KAAAia,SAAAQ,EAAAC,MAAAD,EACAza,KAAAka,WAAAK,GAAAD,EAGAta,KAAAoa,UAAA,GAAApa,KAAAma,MAAA5b,OAAAyB,KAAAoa,YAGAK,EAAAza,KAAAma,MAAA1U,aAEAzF,KAAAka,WAAAO,EAAAC,aACA1a,KAAAia,SAAAQ,EAAAC,OAIAD,EAAAE,SAAAC,SAAA,IAAAC,KAEAJ,EAAAD,KACA,GAEA,CAAA5b,IAAA,OAAAC,MACA,SAAA0b,GAEA,QAAAva,KAAAia,SAAA/Z,eAAAqa,IAKAva,KAAAia,SAAAM,GAAAC,KACA,GAEA,CAAA5b,IAAA,QAAAC,MACA,SAAA0b,GAEA,IAAAva,KAAAia,SAAA/Z,eAAAqa,GAEA,OAAA,EAIA,IAAAE,EAAAza,KAAAma,MAAAW,OAAA9a,KAAAia,SAAAM,IAMA,cAJAva,KAAAka,WAAAK,UACAva,KAAAia,SAAAM,GAGAva,KAAA+a,IAAAN,EAAAD,MAAAC,EAAAC,KACA,GAEA,CAAA9b,IAAA,SAAAC,MACA,SAAA0b,GAEA,IAAAva,KAAAia,SAAA/Z,eAAAqa,GAEA,OAAA,EAGA,IAAAE,EAAAza,KAAAia,SAAAM,GASA,OANAE,EAAAza,KAAAma,MAAAW,OAAAL,UAEAza,KAAAka,WAAAO,EAAAC,aACA1a,KAAAia,SAAAQ,EAAAC,MAGAD,CACA,GAEA,CAAA7b,IAAA,yBAAAC,MACA,SAAAmc,EAAAC,GAEA,IAAAC,OAAA,IAAAD,EAAA,GAAAA,EAEA,GAAAjb,KAAAqa,OAAA,EAEA,OAAAW,EAAAE,GAOA,IAHA,IAAAC,GAAA,IAAAN,KACAO,EAAA5d,OAAAwI,KAAAhG,KAAAia,UAEAzb,EAAA,EAAAA,EAAA4c,EAAA7c,OAAAC,IAGA2c,EAAAnb,KAAAia,SAAAmB,EAAA5c,IAAAmc,SAAAC,SAAA5a,KAAAqa,QAEAa,EAAAxV,KAAA1F,KAAAqb,OAAAD,EAAA5c,KAGAwc,EAAAE,EACA,GAEA,CAAAtc,IAAA,qBAAAC,MACA,SAAAmc,EAAAC,GAEA,IAAAC,OAAA,IAAAD,EAAA,GAAAA,EAGA,GAAAjb,KAAAoa,UAAA,EAEA,KAAApa,KAAAma,MAAA5b,OAAAyB,KAAAoa,WAEAc,EAAAxV,KAAA1F,KAAAma,MAAA1U,OAIA,OAAAuV,EAAAE,EACA,GAEA,CAAAtc,IAAA,cAAAC,MACA,SAAAmc,EAAAM,EAAAL,GAKA,IAHA,IAAAC,OAAA,IAAAD,EAAA,GAAAA,EAEAG,EAAA5d,OAAAwI,KAAAhG,KAAAia,UACAzb,EAAA,EAAAA,EAAA4c,EAAA7c,OAAAC,IACA,CACA,IAAAic,EAAAza,KAAAia,SAAAmB,EAAA5c,IAEA8c,EAAAb,EAAAD,MAAAC,EAAAC,KAAAD,IAEAS,EAAAxV,KAAA1F,KAAAqb,OAAAD,EAAA5c,IAEA,CACAwc,EAAAE,EACA,GAEA,CAAAtc,IAAA,QAAAC,MACA,SAAAmc,GACA,IAAAO,EAAAvb,KACAkb,EAAA,GAGA,GAAAlb,KAAAma,MAAA5b,OAAA,EAEA,OAAAyc,EAAAE,GAIAlb,KAAAwb,wBAAA,SAAAC,GAGAF,EAAAG,mBAAAV,EAAAE,EACA,GAAAA,EACA,GAEA,CAAAtc,IAAA,UAAAC,MACA,SAAA0b,GAEA,QAAAva,KAAAia,SAAA/Z,eAAAqa,IAGAva,KAAAia,SAAAM,EACA,KAAAd,CAAA,CAzMA,CAAAF,GA4MAnW,EAAAD,QAAAsW,CrBmvGA,EAAE,CAAC,kBAAkB,GAAG,4BAA4B,KAAK,GAAG,CAAC,SAAS5V,EAAQT,EAAOD,GsB58GrF,IAOAwY,EAAAjb,eAEA,SAAAib,IACAvb,iBAAAJ,KAAA2b,GACA3b,KAAA0a,MAAA,EACA1a,KAAAwa,OAAA,EAGAxa,KAAA2a,SAAA,CAAA,EAEA3a,KAAA4b,UAAA,EACA5b,KAAA6b,WAAA,EAGA7b,KAAA8b,UAAA,CACA,IAGA1Y,EAAAD,QAAAwY,CtBq9GA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS9X,EAAQT,EAAOD,GuB7+GlC,IAAA4Y,EAAAlY,EAAA,wBASAmY,EAAA,WAEA,SAAAA,IACA5b,iBAAAJ,KAAAgc,GAEAhc,KAAAic,WAAA,EAGAjc,KAAAzB,OAAA,EAEAyB,KAAAkc,MAAA,EACAlc,KAAAmc,MAAA,CACA,CAqLA,OAnLAzb,cAAAsb,EAAA,CAAA,CAAApd,IAAA,iBAAAC,MACA,SAAAud,EAAA7B,GAGA,QAAA,IAAA6B,EACA,OAAA,EAEApc,KAAAic,aAGA,IAAAI,OAAA,IAAA9B,EAAAA,EAAA,QAAA1T,OAAA7G,KAAAic,WAAA,KAEAxB,EAAA,IAAAsB,EAKA,OAHAtB,EAAAC,KAAA2B,EACA5B,EAAAD,MAAA4B,EAEA3B,CACA,GAEA,CAAA7b,IAAA,SAAAC,MACA,SAAAud,EAAA7B,GAGA,IAAAE,EAAAza,KAAAsc,eAAAF,EAAA7B,GACA,QAAAE,IAIAza,KAAAzB,SAGA,GAAAyB,KAAAzB,QAEAyB,KAAAkc,KAAAzB,EACAza,KAAAmc,KAAA1B,EACAA,IAGAza,KAAAmc,KAAAN,UAAApB,EACAA,EAAAmB,SAAA5b,KAAAmc,KACAnc,KAAAmc,KAAA1B,EAEAA,GACA,GAEA,CAAA7b,IAAA,OAAAC,MACA,SAAAud,EAAA7B,GAEA,OAAAva,KAAAuc,OAAAH,EAAA7B,EACA,GAEA,CAAA3b,IAAA,UAAAC,MACA,SAAAud,EAAA7B,GAGA,IAAAE,EAAAza,KAAAsc,eAAAF,EAAA7B,GACA,QAAAE,IAIAza,KAAAzB,SAGA,GAAAyB,KAAAzB,QAEAyB,KAAAkc,KAAAzB,EACAza,KAAAmc,KAAA1B,EACAA,IAGAza,KAAAkc,KAAAN,SAAAnB,EACAA,EAAAoB,UAAA7b,KAAAkc,KACAlc,KAAAkc,KAAAzB,EACAA,GACA,GAEA,CAAA7b,IAAA,SAAAC,MACA,SAAA2d,GAEA,YAAA,IAAAA,MAGAA,EAAAV,WAGA9b,KAAAzB,SAGAyB,KAAAzB,OAAA,GAEAyB,KAAAkc,MAAA,EACAlc,KAAAmc,MAAA,EACAK,GAIAA,EAAAZ,UAAAY,EAAAX,WAEAW,EAAAZ,SAAAC,UAAAW,EAAAX,UACAW,EAAAX,UAAAD,SAAAY,EAAAZ,SAEAY,EAAAX,WAAA,EACAW,EAAAZ,UAAA,EACAY,GAIAA,EAAAZ,UAEAY,EAAAZ,SAAAC,WAAA,EACA7b,KAAAmc,KAAAK,EAAAZ,SACAY,EAAAZ,UAAA,EACAY,IAIAA,EAAAX,UAAAD,UAAA,EACA5b,KAAAkc,KAAAM,EAAAX,UACAW,EAAAX,WAAA,EACAW,IACA,GAEA,CAAA5d,IAAA,MAAAC,MACA,WAEA,OAAAmB,KAAA8a,OAAA9a,KAAAkc,KACA,GAEA,CAAAtd,IAAA,OAAAC,MACA,SAAA4d,EAAAzB,GACA,IAAA0B,EAAA1c,KACA,GAAAA,KAAAzB,OAAA,EACA,OAAAyc,IAEA,IAAAP,GAAA,EAwBA,OAtBA,SAAAkC,EAAAC,GAGA,GAAAA,EACA,OAAA5B,EAAA4B,GAGA,GAAAnC,EAGA,KAAAA,EAAAoB,UACA,OAAAb,IAGAP,EAAAA,EAAAoB,SAAA,MANApB,EAAAiC,EAAAR,KAUAO,EAAAhC,EAAAD,MAAAC,EAAAC,KAAAiC,EACA,CAGAA,EACA,GAEA,CAAA/d,IAAA,OAAAC,MACA,SAAAge,GAEA,IAAAA,EACA,OAAA,EACA,GAAA7c,KAAAzB,OAAA,EACA,OAAA,EACA,GAAAse,GAAA7c,KAAAzB,OACA,OAAA,EAGA,IADA,IAAAkc,EAAAza,KAAAkc,KACA1d,EAAA,EAAAA,EAAAqe,EAAAre,IAEAic,EAAAA,EAAAoB,UAGA,OAAApB,CACA,KAAAuB,CAAA,CAjMA,GAoMA5Y,EAAAD,QAAA6Y,CvBu/GA,EAAE,CAAC,uBAAuB,KAAK,GAAG,CAAC,SAASnY,EAAQT,EAAOD,GwB1sH3D,IAAA2Z,EAAAjZ,EAAA,iBAEAkZ,EAAAlZ,EAAA,MAEAmZ,EAAAD,EAAAD,EAAA,6BAEA1Z,EAAAD,QAAA,SAAArF,EAAAmf,GACA,IAAAC,EAAAJ,EAAAhf,IAAAmf,GACA,MAAA,mBAAAC,GAAAF,EAAAlf,EAAA,gBAAA,EACAif,EAAAG,GAEAA,CACA,CxB+sHA,EAAE,CAAC,KAAK,GAAG,gBAAgB,KAAK,GAAG,CAAC,SAASrZ,EAAQT,EAAOD,GyB3tH5D,IAAA7D,EAAAuE,EAAA,iBACAiZ,EAAAjZ,EAAA,iBAEAsZ,EAAAL,EAAA,8BACAM,EAAAN,EAAA,6BACAO,EAAAP,EAAA,mBAAA,IAAAxd,EAAA3B,KAAAyf,EAAAD,GAEAG,EAAAR,EAAA,qCAAA,GACAS,EAAAT,EAAA,2BAAA,GACAU,EAAAV,EAAA,cAEA,GAAAS,EACA,IACAA,EAAA,CAAA,EAAA,IAAA,CAAA1e,MAAA,GACA,CAAA,MAAAmE,GAEAua,EAAA,IACA,CAGAna,EAAAD,QAAA,SAAAsa,GACA,IAAAvX,EAAAmX,EAAA/d,EAAA8d,EAAAtd,WACAwd,GAAAC,IACAD,EAAApX,EAAA,UACAjH,cAEAse,EACArX,EACA,SACA,CAAArH,MAAA,EAAA2e,EAAA,EAAAC,EAAAlf,QAAAuB,UAAAvB,OAAA,OAIA,OAAA2H,CACA,EAEA,IAAAwX,EAAA,WACA,OAAAL,EAAA/d,EAAA6d,EAAArd,UACA,EAEAyd,EACAA,EAAAna,EAAAD,QAAA,QAAA,CAAAtE,MAAA6e,IAEAta,EAAAD,QAAApD,MAAA2d,CzBiuHA,EAAE,CAAC,gBAAgB,GAAG,gBAAgB,KAAK,GAAG,CAAC,SAAS7Z,EAAQT,EAAOD,G0BhwHvEA,EAAA0K,MAgCA,SAAA6E,EAAAiL,GACA,GAAA,iBAAAjL,EACA,MAAA,IAAAvV,UAAA,iCAGA,IAAAwB,EAAA,CAAA,EAEAif,GADAD,GAAA,CAAA,GACAE,QAAAA,EAEArZ,EAAA,EACA,KAAAA,EAAAkO,EAAAnU,QAAA,CACA,IAAAuf,EAAApL,EAAArK,QAAA,IAAA7D,GAGA,IAAA,IAAAsZ,EACA,MAGA,IAAAC,EAAArL,EAAArK,QAAA,IAAA7D,GAEA,IAAA,IAAAuZ,EACAA,EAAArL,EAAAnU,YACA,GAAAwf,EAAAD,EAAA,CAEAtZ,EAAAkO,EAAAlB,YAAA,IAAAsM,EAAA,GAAA,EACA,QACA,CAEA,IAAAlf,EAAA8T,EAAA9U,MAAA4G,EAAAsZ,GAAA1I,OAGA,QAAA/T,IAAA1C,EAAAC,GAAA,CACA,IAAAyS,EAAAqB,EAAA9U,MAAAkgB,EAAA,EAAAC,GAAA3I,OAGA,KAAA/D,EAAA3J,WAAA,KACA2J,EAAAA,EAAAzT,MAAA,GAAA,IAGAe,EAAAC,GAAAof,EAAA3M,EAAAuM,EACA,CAEApZ,EAAAuZ,EAAA,CACA,CAEA,OAAApf,CACA,EA7EAwE,EAAA8a,UA+FA,SAAAngB,EAAAuT,EAAAsM,GACA,IAAAO,EAAAP,GAAA,CAAA,EACAQ,EAAAD,EAAAE,QAAAA,EAEA,GAAA,mBAAAD,EACA,MAAA,IAAAhhB,UAAA,4BAGA,IAAAkhB,EAAApgB,KAAAH,GACA,MAAA,IAAAX,UAAA,4BAGA,IAAA0B,EAAAsf,EAAA9M,GAEA,GAAAxS,IAAAwf,EAAApgB,KAAAY,GACA,MAAA,IAAA1B,UAAA,2BAGA,IAAAuV,EAAA5U,EAAA,IAAAe,EAEA,GAAA,MAAAqf,EAAA7D,OAAA,CACA,IAAAA,EAAA6D,EAAA7D,OAAA,EAEA,GAAAiE,MAAAjE,KAAA3E,SAAA2E,GACA,MAAA,IAAAld,UAAA,4BAGAuV,GAAA,aAAAtM,KAAAmY,MAAAlE,EACA,CAEA,GAAA6D,EAAAM,OAAA,CACA,IAAAH,EAAApgB,KAAAigB,EAAAM,QACA,MAAA,IAAArhB,UAAA,4BAGAuV,GAAA,YAAAwL,EAAAM,MACA,CAEA,GAAAN,EAAAO,KAAA,CACA,IAAAJ,EAAApgB,KAAAigB,EAAAO,MACA,MAAA,IAAAthB,UAAA,0BAGAuV,GAAA,UAAAwL,EAAAO,IACA,CAEA,GAAAP,EAAAQ,QAAA,CACA,IAAAA,EAAAR,EAAAQ,QAEA,IA2FA,SAAArN,GACA,MAAA,kBAAAsN,EAAAhhB,KAAA0T,IACAA,aAAAwJ,IACA,CA9FA+D,CAAAF,IAAAJ,MAAAI,EAAA3b,WACA,MAAA,IAAA5F,UAAA,6BAGAuV,GAAA,aAAAgM,EAAAG,aACA,CAEAX,EAAAY,WACApM,GAAA,cAGAwL,EAAAa,SACArM,GAAA,YAGA,GAAAwL,EAAAc,SAAA,CAKA,OAJA,iBAAAd,EAAAc,SACAd,EAAAc,SAAAtO,cACAwN,EAAAc,UAGA,IAAA,MACAtM,GAAA,iBACA,MACA,IAAA,SACAA,GAAA,oBACA,MACA,IAAA,OACAA,GAAA,kBACA,MACA,QACA,MAAA,IAAAvV,UAAA,8BAEA,CAEA,GAAA+gB,EAAAe,SAAA,CAIA,OAHA,iBAAAf,EAAAe,SACAf,EAAAe,SAAAvO,cAAAwN,EAAAe,UAGA,KAAA,EACAvM,GAAA,oBACA,MACA,IAAA,MACAA,GAAA,iBACA,MACA,IAAA,SACAA,GAAA,oBACA,MACA,IAAA,OACAA,GAAA,kBACA,MACA,QACA,MAAA,IAAAvV,UAAA,8BAEA,CAEA,OAAAuV,CACA,EAnMA,IAAAiM,EAAAnhB,OAAAC,UAAAC,SAUA2gB,EAAA,wCAkMA,SAAAR,EAAAnL,GACA,OAAA,IAAAA,EAAArK,QAAA,KACA6W,mBAAAxM,GACAA,CACA,CASA,SAAA0L,EAAA/M,GACA,OAAA8N,mBAAA9N,EACA,CAsBA,SAAA2M,EAAAtL,EAAAmL,GACA,IACA,OAAAA,EAAAnL,EACA,CAAA,MAAA1P,GACA,OAAA0P,CACA,CACA,C1BixHA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS7O,EAAQT,EAAOD,G2B9hIlC,IAAAQ,EAAAX,EAAAW,EAAA3D,KAAAgD,EAAA,WAAA,IAAAA,EAAA,IAAAzF,EAAA,KAAAmG,EAAA,cAAAlF,EAAA,SAAAyL,EAAA,SAAAnG,EAAA,OAAAC,EAAA,MAAA3G,EAAA,OAAAwG,EAAA,QAAAV,EAAA,UAAAkc,EAAA,OAAAC,EAAA,OAAA5U,EAAA,eAAA6U,EAAA,6FAAAjV,EAAA,sFAAAkV,EAAA,CAAAzhB,KAAA,KAAA0hB,SAAA,2DAAArG,MAAA,KAAAsG,OAAA,wFAAAtG,MAAA,KAAAuG,QAAA,SAAA/b,GAAA,IAAAX,EAAA,CAAA,KAAA,KAAA,KAAA,MAAAzF,EAAAoG,EAAA,IAAA,MAAA,IAAAA,GAAAX,GAAAzF,EAAA,IAAA,KAAAyF,EAAAzF,IAAAyF,EAAA,IAAA,GAAA,GAAAmO,EAAA,SAAAxN,EAAAX,EAAAzF,GAAA,IAAAmG,EAAA1C,OAAA2C,GAAA,OAAAD,GAAAA,EAAAnF,QAAAyE,EAAAW,EAAA,GAAA5F,MAAAiF,EAAA,EAAAU,EAAAnF,QAAA4J,KAAA5K,GAAAoG,CAAA,EAAAgc,EAAA,CAAA1V,EAAAkH,EAAAyO,EAAA,SAAAjc,GAAA,IAAAX,GAAAW,EAAAkc,YAAAtiB,EAAA6I,KAAA+D,IAAAnH,GAAAU,EAAA0C,KAAAmY,MAAAhhB,EAAA,IAAAiB,EAAAjB,EAAA,GAAA,OAAAyF,GAAA,EAAA,IAAA,KAAAmO,EAAAzN,EAAA,EAAA,KAAA,IAAAyN,EAAA3S,EAAA,EAAA,IAAA,EAAA2S,EAAA,SAAAxN,EAAAX,EAAAzF,GAAA,GAAAyF,EAAA8c,OAAAviB,EAAAuiB,OAAA,OAAAnc,EAAApG,EAAAyF,GAAA,IAAAU,EAAA,IAAAnG,EAAAwiB,OAAA/c,EAAA+c,SAAAxiB,EAAAyiB,QAAAhd,EAAAgd,SAAAxhB,EAAAwE,EAAAid,QAAAxT,IAAA/I,EAAAE,GAAAqG,EAAA1M,EAAAiB,EAAA,EAAAsF,EAAAd,EAAAid,QAAAxT,IAAA/I,GAAAuG,GAAA,EAAA,GAAArG,GAAA,UAAAF,GAAAnG,EAAAiB,IAAAyL,EAAAzL,EAAAsF,EAAAA,EAAAtF,KAAA,EAAA,EAAAuF,EAAA,SAAAJ,GAAA,OAAAA,EAAA,EAAAyC,KAAA8Z,KAAAvc,IAAA,EAAAyC,KAAAmY,MAAA5a,EAAA,EAAA9B,EAAA,SAAA8B,GAAA,MAAA,CAAA4b,EAAA3b,EAAAyG,EAAA+U,EAAAe,EAAA/iB,EAAAiiB,EAAAtb,EAAAqc,EAAAf,EAAAD,EAAAtb,EAAAqN,EAAAlH,EAAAA,EAAAzL,EAAA6hB,GAAA3c,EAAA4c,EAAApd,GAAAS,IAAA3C,OAAA2C,GAAA,IAAA+M,cAAAhD,QAAA,KAAA,GAAA,EAAA5J,EAAA,SAAAH,GAAA,YAAA,IAAAA,CAAA,GAAA4c,EAAA,KAAAH,EAAA,CAAA,EAAAA,EAAAG,GAAAhB,EAAA,IAAA1d,EAAA,iBAAA2e,EAAA,SAAA7c,GAAA,OAAAA,aAAA8c,MAAA9c,IAAAA,EAAA9B,GAAA,EAAAse,EAAA,SAAAxc,EAAAX,EAAAzF,EAAAmG,GAAA,IAAAlF,EAAA,IAAAwE,EAAA,OAAAud,EAAA,GAAA,iBAAAvd,EAAA,CAAA,IAAAiH,EAAAjH,EAAA0N,cAAA0P,EAAAnW,KAAAzL,EAAAyL,GAAA1M,IAAA6iB,EAAAnW,GAAA1M,EAAAiB,EAAAyL,GAAA,IAAAnG,EAAAd,EAAAmW,MAAA,KAAA,IAAA3a,GAAAsF,EAAAvF,OAAA,EAAA,OAAAoF,EAAAG,EAAA,GAAA,KAAA,CAAA,IAAAC,EAAAf,EAAAlF,KAAAsiB,EAAArc,GAAAf,EAAAxE,EAAAuF,CAAA,CAAA,OAAAL,GAAAlF,IAAA+hB,EAAA/hB,GAAAA,IAAAkF,GAAA6c,CAAA,EAAAG,EAAA,SAAA/c,EAAAX,GAAA,GAAAwd,EAAA7c,GAAA,OAAAA,EAAAsc,QAAA,IAAA1iB,EAAA,UAAAwD,QAAAiC,GAAAA,EAAA,CAAA,EAAA,OAAAzF,EAAAuiB,KAAAnc,EAAApG,EAAAgI,KAAAzF,UAAA,IAAA2gB,EAAAljB,EAAA,EAAAoN,EAAAgV,EAAAhV,EAAAF,EAAA0V,EAAAxV,EAAAnM,EAAAgiB,EAAA7V,EAAAwV,EAAA,SAAAxc,EAAAX,GAAA,OAAA0d,EAAA/c,EAAA,CAAAgd,OAAA3d,EAAA4d,GAAAC,IAAA7d,EAAA8d,GAAAvX,EAAAvG,EAAA+d,GAAAC,QAAAhe,EAAAge,SAAA,EAAA,IAAAP,EAAA,WAAA,SAAAlB,EAAA5b,GAAA3D,KAAA4gB,GAAAT,EAAAxc,EAAAgd,OAAA,MAAA,GAAA3gB,KAAA6N,MAAAlK,GAAA3D,KAAA+gB,GAAA/gB,KAAA+gB,IAAApd,EAAA4F,GAAA,CAAA,EAAAvJ,KAAA6B,IAAA,CAAA,CAAA,IAAAsP,EAAAoO,EAAA9hB,UAAA,OAAA0T,EAAAtD,MAAA,SAAAlK,GAAA3D,KAAAihB,GAAA,SAAAtd,GAAA,IAAAX,EAAAW,EAAAmc,KAAAviB,EAAAoG,EAAAkd,IAAA,GAAA,OAAA7d,EAAA,OAAA,IAAA6X,KAAAqG,KAAA,GAAAvW,EAAA7G,EAAAd,GAAA,OAAA,IAAA6X,KAAA,GAAA7X,aAAA6X,KAAA,OAAA,IAAAA,KAAA7X,GAAA,GAAA,iBAAAA,IAAA,MAAA/E,KAAA+E,GAAA,CAAA,IAAAU,EAAAV,EAAAme,MAAA7B,GAAA,GAAA5b,EAAA,CAAA,IAAAlF,EAAAkF,EAAA,GAAA,GAAA,EAAAuG,GAAAvG,EAAA,IAAA,KAAAkK,UAAA,EAAA,GAAA,OAAArQ,EAAA,IAAAsd,KAAAA,KAAAuG,IAAA1d,EAAA,GAAAlF,EAAAkF,EAAA,IAAA,EAAAA,EAAA,IAAA,EAAAA,EAAA,IAAA,EAAAA,EAAA,IAAA,EAAAuG,IAAA,IAAA4Q,KAAAnX,EAAA,GAAAlF,EAAAkF,EAAA,IAAA,EAAAA,EAAA,IAAA,EAAAA,EAAA,IAAA,EAAAA,EAAA,IAAA,EAAAuG,EAAA,CAAA,CAAA,OAAA,IAAA4Q,KAAA7X,EAAA,CAAA,CAAAW,GAAA3D,KAAAqhB,MAAA,EAAAlQ,EAAAkQ,KAAA,WAAA,IAAA1d,EAAA3D,KAAAihB,GAAAjhB,KAAAshB,GAAA3d,EAAA4d,cAAAvhB,KAAAwhB,GAAA7d,EAAA8d,WAAAzhB,KAAA0hB,GAAA/d,EAAAge,UAAA3hB,KAAA4hB,GAAAje,EAAAke,SAAA7hB,KAAA8hB,GAAAne,EAAAoe,WAAA/hB,KAAAgiB,GAAAre,EAAAse,aAAAjiB,KAAAkiB,GAAAve,EAAAwe,aAAAniB,KAAAoiB,IAAAze,EAAA0e,iBAAA,EAAAlR,EAAAmR,OAAA,WAAA,OAAA3X,CAAA,EAAAwG,EAAAoR,QAAA,WAAA,QAAAviB,KAAAihB,GAAAvjB,aAAA+M,EAAA,EAAA0G,EAAAqR,OAAA,SAAA7e,EAAAX,GAAA,IAAAzF,EAAAmjB,EAAA/c,GAAA,OAAA3D,KAAAyiB,QAAAzf,IAAAzF,GAAAA,GAAAyC,KAAA0iB,MAAA1f,EAAA,EAAAmO,EAAAwR,QAAA,SAAAhf,EAAAX,GAAA,OAAA0d,EAAA/c,GAAA3D,KAAAyiB,QAAAzf,EAAA,EAAAmO,EAAAyR,SAAA,SAAAjf,EAAAX,GAAA,OAAAhD,KAAA0iB,MAAA1f,GAAA0d,EAAA/c,EAAA,EAAAwN,EAAA0R,GAAA,SAAAlf,EAAAX,EAAAzF,GAAA,OAAAoN,EAAA7G,EAAAH,GAAA3D,KAAAgD,GAAAhD,KAAA+Y,IAAAxb,EAAAoG,EAAA,EAAAwN,EAAA2R,KAAA,WAAA,OAAA1c,KAAAmY,MAAAve,KAAA+C,UAAA,IAAA,EAAAoO,EAAApO,QAAA,WAAA,OAAA/C,KAAAihB,GAAA8B,SAAA,EAAA5R,EAAAsR,QAAA,SAAA9e,EAAAX,GAAA,IAAAzF,EAAAyC,KAAA0D,IAAAiH,EAAA7G,EAAAd,IAAAA,EAAAE,EAAAyH,EAAA9I,EAAA8B,GAAA8G,EAAA,SAAA9G,EAAAX,GAAA,IAAAxE,EAAAmM,EAAAwV,EAAA5iB,EAAAujB,GAAAjG,KAAAuG,IAAA7jB,EAAA+jB,GAAAte,EAAAW,GAAA,IAAAkX,KAAAtd,EAAA+jB,GAAAte,EAAAW,GAAApG,GAAA,OAAAmG,EAAAlF,EAAAA,EAAAkkB,MAAA3e,EAAA,EAAAub,EAAA,SAAA3b,EAAAX,GAAA,OAAA2H,EAAAwV,EAAA5iB,EAAAylB,SAAArf,GAAA5D,MAAAxC,EAAAylB,OAAA,MAAAtf,EAAA,CAAA,EAAA,EAAA,EAAA,GAAA,CAAA,GAAA,GAAA,GAAA,MAAA9F,MAAAoF,IAAAzF,EAAA,EAAA8M,EAAArK,KAAA4hB,GAAArC,EAAAvf,KAAAwhB,GAAArQ,EAAAnR,KAAA0hB,GAAA/B,EAAA,OAAA3f,KAAA8gB,GAAA,MAAA,IAAA,OAAA5d,GAAA,KAAAkc,EAAA,OAAA1b,EAAA+G,EAAA,EAAA,GAAAA,EAAA,GAAA,IAAA,KAAA7G,EAAA,OAAAF,EAAA+G,EAAA,EAAA8U,GAAA9U,EAAA,EAAA8U,EAAA,GAAA,KAAAniB,EAAA,IAAAmjB,EAAAvgB,KAAAijB,UAAAC,WAAA,EAAA9C,GAAA/V,EAAAkW,EAAAlW,EAAA,EAAAA,GAAAkW,EAAA,OAAA9V,EAAA/G,EAAAyN,EAAAiP,EAAAjP,GAAA,EAAAiP,GAAAb,GAAA,KAAAxb,EAAA,KAAAsb,EAAA,OAAAC,EAAAK,EAAA,QAAA,GAAA,KAAA7b,EAAA,OAAAwb,EAAAK,EAAA,UAAA,GAAA,KAAA1V,EAAA,OAAAqV,EAAAK,EAAA,UAAA,GAAA,KAAAnhB,EAAA,OAAA8gB,EAAAK,EAAA,eAAA,GAAA,QAAA,OAAA3f,KAAAigB,QAAA,EAAA9O,EAAAuR,MAAA,SAAA/e,GAAA,OAAA3D,KAAAyiB,QAAA9e,GAAA,EAAA,EAAAwN,EAAAgS,KAAA,SAAAxf,EAAAX,GAAA,IAAAzF,EAAAH,EAAAuN,EAAA9I,EAAA8B,GAAAT,EAAA,OAAAlD,KAAA8gB,GAAA,MAAA,IAAArW,GAAAlN,EAAA,CAAA,EAAAA,EAAAwG,GAAAb,EAAA,OAAA3F,EAAA8hB,GAAAnc,EAAA,OAAA3F,EAAAqG,GAAAV,EAAA,QAAA3F,EAAA6hB,GAAAlc,EAAA,WAAA3F,EAAAuG,GAAAZ,EAAA,QAAA3F,EAAA0M,GAAA/G,EAAA,UAAA3F,EAAAiB,GAAA0E,EAAA,UAAA3F,EAAAmG,GAAAR,EAAA,eAAA3F,GAAAH,GAAAkiB,EAAAliB,IAAA2G,EAAA/D,KAAA0hB,IAAA1e,EAAAhD,KAAA4hB,IAAA5e,EAAA,GAAA5F,IAAAwG,GAAAxG,IAAAgiB,EAAA,CAAA,IAAA/U,EAAArK,KAAAigB,QAAAlH,IAAAsG,EAAA,GAAAhV,EAAA4W,GAAAxW,GAAA6U,GAAAjV,EAAAgX,OAAArhB,KAAAihB,GAAA5W,EAAA0O,IAAAsG,EAAAjZ,KAAAgN,IAAApT,KAAA0hB,GAAArX,EAAA+Y,gBAAAnC,EAAA,MAAAxW,GAAAzK,KAAAihB,GAAAxW,GAAA6U,GAAA,OAAAtf,KAAAqhB,OAAArhB,IAAA,EAAAmR,EAAA4H,IAAA,SAAApV,EAAAX,GAAA,OAAAhD,KAAAigB,QAAAkD,KAAAxf,EAAAX,EAAA,EAAAmO,EAAA9R,IAAA,SAAAsE,GAAA,OAAA3D,KAAA2K,EAAA9I,EAAA8B,KAAA,EAAAwN,EAAA1E,IAAA,SAAA/I,EAAAR,GAAA,IAAAmc,EAAA5U,EAAAzK,KAAA0D,EAAAnC,OAAAmC,GAAA,IAAA4b,EAAA3U,EAAA9I,EAAAqB,GAAAmH,EAAA,SAAA1G,GAAA,IAAAX,EAAA0d,EAAAjW,GAAA,OAAAE,EAAAwV,EAAAnd,EAAA8c,KAAA9c,EAAA8c,OAAA1Z,KAAAkD,MAAA3F,EAAAD,IAAA+G,EAAA,EAAA,GAAA6U,IAAA1b,EAAA,OAAA5D,KAAA+Y,IAAAnV,EAAA5D,KAAAwhB,GAAA9d,GAAA,GAAA4b,IAAAF,EAAA,OAAApf,KAAA+Y,IAAAqG,EAAApf,KAAAshB,GAAA5d,GAAA,GAAA4b,IAAAvb,EAAA,OAAAsG,EAAA,GAAA,GAAAiV,IAAAliB,EAAA,OAAAiN,EAAA,GAAA,IAAAkV,GAAAF,EAAA,CAAA,EAAAA,EAAApV,GAAAjH,EAAAqc,EAAAvb,GAAAvG,EAAA8hB,EAAA7gB,GAAA,IAAA6gB,GAAAC,IAAA,EAAAnO,EAAAnR,KAAAihB,GAAA8B,UAAArf,EAAA6b,EAAA,OAAA5U,EAAAwV,EAAAhP,EAAAnR,KAAA,EAAAmR,EAAAkS,SAAA,SAAA1f,EAAAX,GAAA,OAAAhD,KAAAyM,KAAA,EAAA9I,EAAAX,EAAA,EAAAmO,EAAAmS,OAAA,SAAA3f,GAAA,IAAAX,EAAAhD,KAAAzC,EAAAyC,KAAAijB,UAAA,IAAAjjB,KAAAuiB,UAAA,OAAAhlB,EAAAgmB,aAAA9Y,EAAA,IAAA/G,EAAAC,GAAA,uBAAAnF,EAAAmM,EAAAiV,EAAA5f,MAAAiK,EAAAjK,KAAA8hB,GAAAhe,EAAA9D,KAAAgiB,GAAAje,EAAA/D,KAAAwhB,GAAApkB,EAAAG,EAAAiiB,SAAA5b,EAAArG,EAAAkiB,OAAAvc,EAAA3F,EAAAimB,SAAApE,EAAA,SAAAzb,EAAApG,EAAAiB,EAAAyL,GAAA,OAAAtG,IAAAA,EAAApG,IAAAoG,EAAAX,EAAAU,KAAAlF,EAAAjB,GAAAK,MAAA,EAAAqM,EAAA,EAAAoV,EAAA,SAAA1b,GAAA,OAAAgH,EAAAV,EAAAA,EAAA,IAAA,GAAAtG,EAAA,IAAA,EAAA2b,EAAApc,GAAA,SAAAS,EAAAX,EAAAzF,GAAA,IAAAmG,EAAAC,EAAA,GAAA,KAAA,KAAA,OAAApG,EAAAmG,EAAAgN,cAAAhN,CAAA,EAAA,OAAAA,EAAAgK,QAAArD,GAAA,SAAA1G,EAAAD,GAAA,OAAAA,GAAA,SAAAC,GAAA,OAAAA,GAAA,IAAA,KAAA,OAAA3C,OAAAgC,EAAAse,IAAA1jB,OAAA,GAAA,IAAA,OAAA,OAAA+M,EAAAV,EAAAjH,EAAAse,GAAA,EAAA,KAAA,IAAA,IAAA,OAAAvd,EAAA,EAAA,IAAA,KAAA,OAAA4G,EAAAV,EAAAlG,EAAA,EAAA,EAAA,KAAA,IAAA,MAAA,OAAAqb,EAAA7hB,EAAAkmB,YAAA1f,EAAAH,EAAA,GAAA,IAAA,OAAA,OAAAwb,EAAAxb,EAAAG,GAAA,IAAA,IAAA,OAAAf,EAAA0e,GAAA,IAAA,KAAA,OAAA/W,EAAAV,EAAAjH,EAAA0e,GAAA,EAAA,KAAA,IAAA,IAAA,OAAA1gB,OAAAgC,EAAA4e,IAAA,IAAA,KAAA,OAAAxC,EAAA7hB,EAAAmmB,YAAA1gB,EAAA4e,GAAAxkB,EAAA,GAAA,IAAA,MAAA,OAAAgiB,EAAA7hB,EAAAomB,cAAA3gB,EAAA4e,GAAAxkB,EAAA,GAAA,IAAA,OAAA,OAAAA,EAAA4F,EAAA4e,IAAA,IAAA,IAAA,OAAA5gB,OAAAiJ,GAAA,IAAA,KAAA,OAAAU,EAAAV,EAAAA,EAAA,EAAA,KAAA,IAAA,IAAA,OAAAoV,EAAA,GAAA,IAAA,KAAA,OAAAA,EAAA,GAAA,IAAA,IAAA,OAAAC,EAAArV,EAAAnG,GAAA,GAAA,IAAA,IAAA,OAAAwb,EAAArV,EAAAnG,GAAA,GAAA,IAAA,IAAA,OAAA9C,OAAA8C,GAAA,IAAA,KAAA,OAAA6G,EAAAV,EAAAnG,EAAA,EAAA,KAAA,IAAA,IAAA,OAAA9C,OAAAgC,EAAAkf,IAAA,IAAA,KAAA,OAAAvX,EAAAV,EAAAjH,EAAAkf,GAAA,EAAA,KAAA,IAAA,MAAA,OAAAvX,EAAAV,EAAAjH,EAAAof,IAAA,EAAA,KAAA,IAAA,IAAA,OAAA5jB,EAAA,OAAA,IAAA,CAAA,CAAAmF,IAAAnF,EAAAkP,QAAA,IAAA,GAAA,GAAA,EAAAyD,EAAA0O,UAAA,WAAA,OAAA,IAAAzZ,KAAAkD,MAAAtJ,KAAAihB,GAAA2C,oBAAA,GAAA,EAAAzS,EAAA0S,KAAA,SAAAngB,EAAA2b,EAAA5U,GAAA,IAAA6U,EAAAjV,EAAArK,KAAAuf,EAAA5U,EAAA9I,EAAAwd,GAAAlO,EAAAuP,EAAAhd,GAAAic,GAAAxO,EAAA0O,YAAA7f,KAAA6f,aAAA7c,EAAAud,EAAAvgB,KAAAmR,EAAAiP,EAAA,WAAA,OAAAzV,EAAAwG,EAAA9G,EAAA8G,EAAA,EAAA,OAAAoO,GAAA,KAAAH,EAAAE,EAAAc,IAAA,GAAA,MAAA,KAAAxc,EAAA0b,EAAAc,IAAA,MAAA,KAAAld,EAAAoc,EAAAc,IAAA,EAAA,MAAA,KAAAhjB,EAAAkiB,GAAAiB,EAAAZ,GAAA,OAAA,MAAA,KAAA5b,EAAAub,GAAAiB,EAAAZ,GAAA,MAAA,MAAA,KAAA7b,EAAAwb,EAAAiB,EAAAhjB,EAAA,MAAA,KAAA0M,EAAAqV,EAAAiB,EAAAvd,EAAA,MAAA,KAAAxE,EAAA8gB,EAAAiB,EAAA,IAAA,MAAA,QAAAjB,EAAAiB,EAAA,OAAA9V,EAAA6U,EAAA3U,EAAA5G,EAAAub,EAAA,EAAAnO,EAAAiS,YAAA,WAAA,OAAApjB,KAAA0iB,MAAA9e,GAAA8d,EAAA,EAAAvQ,EAAA8R,QAAA,WAAA,OAAA7C,EAAApgB,KAAA4gB,GAAA,EAAAzP,EAAAwP,OAAA,SAAAhd,EAAAX,GAAA,IAAAW,EAAA,OAAA3D,KAAA4gB,GAAA,IAAArjB,EAAAyC,KAAAigB,QAAAvc,EAAAyc,EAAAxc,EAAAX,GAAA,GAAA,OAAAU,IAAAnG,EAAAqjB,GAAAld,GAAAnG,CAAA,EAAA4T,EAAA8O,MAAA,WAAA,OAAAtV,EAAAwV,EAAAngB,KAAAihB,GAAAjhB,KAAA,EAAAmR,EAAA6R,OAAA,WAAA,OAAA,IAAAnI,KAAA7a,KAAA+C,UAAA,EAAAoO,EAAAjE,OAAA,WAAA,OAAAlN,KAAAuiB,UAAAviB,KAAA8jB,cAAA,IAAA,EAAA3S,EAAA2S,YAAA,WAAA,OAAA9jB,KAAAihB,GAAA6C,aAAA,EAAA3S,EAAAzT,SAAA,WAAA,OAAAsC,KAAAihB,GAAApC,aAAA,EAAAU,CAAA,CAAA,GAAAtZ,EAAAwa,EAAAhjB,UAAA,OAAAijB,EAAAjjB,UAAAwI,EAAA,CAAA,CAAA,MAAAvC,GAAA,CAAA,KAAAlF,GAAA,CAAA,KAAAyL,GAAA,CAAA,KAAAnG,GAAA,CAAA,KAAAC,GAAA,CAAA,KAAAH,GAAA,CAAA,KAAAwb,GAAA,CAAA,KAAAC,IAAA0E,SAAA,SAAApgB,GAAAsC,EAAAtC,EAAA,IAAA,SAAAX,GAAA,OAAAhD,KAAA6iB,GAAA7f,EAAAW,EAAA,GAAAA,EAAA,GAAA,CAAA,IAAA+c,EAAAsD,OAAA,SAAArgB,EAAAX,GAAA,OAAAW,EAAAsgB,KAAAtgB,EAAAX,EAAAyd,EAAAC,GAAA/c,EAAAsgB,IAAA,GAAAvD,CAAA,EAAAA,EAAAC,OAAAR,EAAAO,EAAAwD,QAAA1D,EAAAE,EAAAoC,KAAA,SAAAnf,GAAA,OAAA+c,EAAA,IAAA/c,EAAA,EAAA+c,EAAAyD,GAAA/D,EAAAG,GAAAG,EAAA0D,GAAAhE,EAAAM,EAAA7e,EAAA,CAAA,EAAA6e,CAAA,EAAA,UAAA3f,QAAAoC,SAAA,IAAAC,EAAAA,EAAAD,QAAAH,KAAAW,EAAA,oBAAA0gB,WAAAA,WAAA1gB,GAAAlB,MAAA6hB,MAAAthB,G3BgiIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASa,EAAQT,EAAOD,G4BhiIlC,IAAAH,EAAAW,EAAAX,EAAAhD,KAAA2D,EAAA,WAAA,OAAA,SAAAX,EAAAW,GAAA,IAAAD,EAAAC,EAAAlG,UAAAF,EAAAmG,EAAA4f,OAAA5f,EAAA4f,OAAA,SAAAtgB,GAAA,IAAAW,EAAA3D,KAAA0D,EAAA1D,KAAAijB,UAAA,IAAAjjB,KAAAuiB,UAAA,OAAAhlB,EAAA+B,KAAAU,KAAAzC,CAAAyF,GAAA,IAAAiH,EAAAjK,KAAAsiB,SAAAve,GAAAf,GAAA,wBAAA0K,QAAA,+DAAA,SAAA1K,GAAA,OAAAA,GAAA,IAAA,IAAA,OAAAoD,KAAA8Z,MAAAvc,EAAA6d,GAAA,GAAA,GAAA,IAAA,KAAA,OAAA9d,EAAAgc,QAAA/b,EAAA+d,IAAA,IAAA,OAAA,OAAA/d,EAAA4gB,WAAA,IAAA,OAAA,OAAA5gB,EAAA6gB,cAAA,IAAA,KAAA,OAAA9gB,EAAAgc,QAAA/b,EAAA8gB,OAAA,KAAA,IAAA,IAAA,IAAA,KAAA,OAAAxa,EAAAA,EAAAtG,EAAA8gB,OAAA,MAAAzhB,EAAA,EAAA,EAAA,KAAA,IAAA,IAAA,IAAA,KAAA,OAAAiH,EAAAA,EAAAtG,EAAA+gB,UAAA,MAAA1hB,EAAA,EAAA,EAAA,KAAA,IAAA,IAAA,IAAA,KAAA,OAAAiH,EAAAA,EAAAjJ,OAAA,IAAA2C,EAAAme,GAAA,GAAAne,EAAAme,IAAA,MAAA9e,EAAA,EAAA,EAAA,KAAA,IAAA,IAAA,OAAAoD,KAAAmY,MAAA5a,EAAAsd,GAAA8B,UAAA,KAAA,IAAA,IAAA,OAAApf,EAAAsd,GAAA8B,UAAA,IAAA,IAAA,MAAA,IAAApf,EAAAghB,aAAA,IAAA,IAAA,MAAA,MAAA,IAAAhhB,EAAAghB,WAAA,QAAA,IAAA,QAAA,OAAA3hB,EAAA,IAAA,OAAAzF,EAAA+B,KAAAU,KAAAzC,CAAAwG,EAAA,CAAA,CAAA,EAAA,UAAAhD,QAAAoC,SAAA,IAAAC,EAAAA,EAAAD,QAAAQ,KAAAX,EAAA,oBAAAqhB,WAAAA,WAAArhB,GAAAP,MAAAmiB,4BAAAjhB,G5BkiIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASE,EAAQT,EAAOD,G6BliIlC,IAAAH,EAAAW,EAAAX,EAAAhD,KAAA2D,EAAA,WAAA,IAAAX,EAAA,MAAA,OAAA,SAAAW,EAAAnF,EAAAyL,GAAA,IAAAlG,EAAA,SAAAJ,GAAA,OAAAA,EAAA8I,IAAA,EAAA9I,EAAAkhB,aAAA7hB,EAAA,EAAAqc,EAAA7gB,EAAAf,UAAA4hB,EAAAmF,YAAA,WAAA,OAAAzgB,EAAA/D,MAAA+f,MAAA,EAAAV,EAAAqF,QAAA,SAAA/gB,GAAA,IAAA3D,KAAAsiB,SAAAxe,EAAAH,GAAA,OAAA3D,KAAAyM,IAAA,GAAA9I,EAAA3D,KAAA0kB,WAAA1hB,GAAA,IAAAxE,EAAAjB,EAAAH,EAAAsG,EAAAK,EAAA/D,MAAA8D,GAAAtF,EAAAwB,KAAAwkB,cAAApnB,EAAA,GAAAG,GAAAyC,KAAA8gB,GAAA7W,EAAA4W,IAAA5W,KAAA8V,KAAAvhB,GAAAikB,QAAA,SAAAoC,aAAAtnB,EAAAsnB,aAAA,IAAAznB,GAAA,GAAAG,EAAAkP,IAAArP,EAAA4F,IAAA,OAAAU,EAAAmgB,KAAA/f,EAAA,QAAA,CAAA,EAAAub,EAAAwF,WAAA,SAAA7hB,GAAA,OAAAhD,KAAAsiB,SAAAxe,EAAAd,GAAAhD,KAAA8kB,OAAA,EAAA9kB,KAAA8kB,IAAA9kB,KAAA8kB,MAAA,EAAA9hB,EAAAA,EAAA,EAAA,EAAA,IAAAzF,EAAA8hB,EAAAoD,QAAApD,EAAAoD,QAAA,SAAAzf,EAAAW,GAAA,IAAAnF,EAAAwB,KAAAsiB,SAAArY,IAAAzL,EAAAsF,EAAAH,IAAAA,EAAA,MAAA,YAAAnF,EAAAqD,EAAAmB,GAAAiH,EAAAjK,KAAA8f,KAAA9f,KAAA8f,QAAA9f,KAAA6kB,aAAA,IAAApC,QAAA,OAAAziB,KAAA8f,KAAA9f,KAAA8f,OAAA,GAAA9f,KAAA6kB,aAAA,GAAA,GAAAnC,MAAA,OAAAnlB,EAAA+B,KAAAU,KAAAzC,CAAAyF,EAAAW,EAAA,CAAA,CAAA,EAAA,UAAA5C,QAAAoC,SAAA,IAAAC,EAAAA,EAAAD,QAAAQ,KAAAX,EAAA,oBAAAqhB,WAAAA,WAAArhB,GAAAP,MAAAsiB,qBAAAphB,G7BoiIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASE,EAAQT,EAAOD,G8BpiIlC,IAAAO,EAAAV,EAAAU,EAAA1D,KAAAgD,EAAA,WAAA,OAAA,SAAAU,EAAAV,EAAAW,GAAAD,EAAAA,GAAA,CAAA,EAAA,IAAAnG,EAAAyF,EAAAvF,UAAAL,EAAA,CAAA4nB,OAAA,QAAAC,KAAA,SAAAhb,EAAA,gBAAAkH,EAAA,WAAA+T,GAAA,aAAA9F,EAAA,UAAA+F,GAAA,WAAA9F,EAAA,QAAA+F,GAAA,UAAA7F,EAAA,UAAA8F,GAAA,YAAAhb,EAAA,SAAAib,GAAA,YAAA,SAAA9mB,EAAAkF,EAAAV,EAAAW,EAAAvG,GAAA,OAAAG,EAAAgoB,WAAA7hB,EAAAV,EAAAW,EAAAvG,EAAA,CAAAuG,EAAAwgB,GAAAqB,aAAApoB,EAAAG,EAAAgoB,WAAA,SAAAviB,EAAAzF,EAAAiB,EAAA6gB,EAAAvb,GAAA,IAAA,IAAAZ,EAAAa,EAAAkG,EAAAQ,EAAAjM,EAAAykB,UAAAuC,cAAApoB,EAAAgiB,EAAA1b,EAAA+hB,YAAA,CAAA,CAAAhb,EAAA,IAAA/G,EAAA,GAAA2b,EAAA,UAAA,CAAA5U,EAAA,IAAA/G,EAAA,IAAA,CAAA+G,EAAA,KAAA/G,EAAA,GAAA2b,EAAA,UAAA,CAAA5U,EAAA,IAAA/G,EAAA,IAAA,CAAA+G,EAAA,KAAA/G,EAAA,GAAA2b,EAAA,QAAA,CAAA5U,EAAA,IAAA/G,EAAA,IAAA,CAAA+G,EAAA,KAAA/G,EAAA,GAAA2b,EAAA,OAAA,CAAA5U,EAAA,IAAA/G,EAAA,IAAA,CAAA+G,EAAA,KAAA/G,EAAA,GAAA2b,EAAA,SAAA,CAAA5U,EAAA,IAAA/G,EAAA,IAAA,CAAA+G,EAAA,KAAA4U,EAAA,SAAAlO,EAAAiO,EAAA7gB,OAAAqF,EAAA,EAAAA,EAAAuN,EAAAvN,GAAA,EAAA,CAAA,IAAAyG,EAAA+U,EAAAxb,GAAAyG,EAAAgV,IAAAnc,EAAAmc,EAAA1b,EAAAX,GAAA6gB,KAAArlB,EAAA6L,EAAAgV,GAAA,GAAA7gB,EAAAqlB,KAAA7gB,EAAAqH,EAAAgV,GAAA,IAAA,IAAAxd,GAAA6B,EAAAgiB,UAAAtf,KAAAkD,OAAAlD,KAAA+D,IAAAjH,IAAA,GAAA+G,EAAA/G,EAAA,EAAArB,GAAAwI,EAAA3G,IAAA2G,EAAA3G,EAAA,CAAA7B,GAAA,GAAA+B,EAAA,IAAAyG,EAAA+U,EAAAxb,EAAA,IAAA,IAAA+b,EAAAlV,EAAAJ,EAAAI,GAAA3G,IAAAjC,EAAAiC,EAAA,GAAAjC,IAAAkC,EAAA,iBAAA4b,EAAAA,EAAAjS,QAAA,KAAA7L,GAAA8d,EAAA9d,EAAAtE,EAAA8M,EAAAI,EAAAR,GAAA,KAAA,CAAA,CAAA,GAAA1M,EAAA,OAAAwG,EAAA,IAAAwb,EAAAtV,EAAAQ,EAAAua,OAAAva,EAAAwa,KAAA,MAAA,mBAAA1F,EAAAA,EAAAxb,GAAAwb,EAAA7R,QAAA,KAAA3J,EAAA,EAAAxG,EAAAooB,GAAA,SAAAjiB,EAAAV,GAAA,OAAAxE,EAAAkF,EAAAV,EAAAhD,MAAA,EAAA,EAAAzC,EAAAS,KAAA,SAAA0F,EAAAV,GAAA,OAAAxE,EAAAkF,EAAAV,EAAAhD,KAAA,EAAA,IAAAqf,EAAA,SAAA3b,GAAA,OAAAA,EAAAod,GAAAnd,EAAAkd,MAAAld,GAAA,EAAApG,EAAAqoB,MAAA,SAAAliB,GAAA,OAAA1D,KAAA2lB,GAAAtG,EAAArf,MAAA0D,EAAA,EAAAnG,EAAAsoB,QAAA,SAAAniB,GAAA,OAAA1D,KAAAhC,KAAAqhB,EAAArf,MAAA0D,EAAA,CAAA,CAAA,EAAA,UAAA3C,QAAAoC,SAAA,IAAAC,EAAAA,EAAAD,QAAAH,KAAAU,EAAA,oBAAA2gB,WAAAA,WAAA3gB,GAAAjB,MAAAqjB,0BAAA9iB,G9BsiIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASa,EAAQT,EAAOD,G+BtiIlC,IAAAQ,EAAAX,EAAAW,EAAA3D,KAAAgD,EAAA,WAAA,IAAAW,EAAA,CAAAoc,KAAA,EAAAC,MAAA,EAAA8E,IAAA,EAAAiB,KAAA,EAAAC,OAAA,EAAAC,OAAA,GAAAjjB,EAAA,CAAA,EAAA,OAAA,SAAAzF,EAAAiB,EAAApB,GAAA,IAAAsG,EAAAK,EAAA,SAAAJ,EAAApG,EAAAiB,QAAA,IAAAA,IAAAA,EAAA,CAAA,GAAA,IAAApB,EAAA,IAAAyd,KAAAlX,GAAAD,EAAA,SAAAC,EAAApG,QAAA,IAAAA,IAAAA,EAAA,CAAA,GAAA,IAAAiB,EAAAjB,EAAA2oB,cAAA,QAAA9oB,EAAAuG,EAAA,IAAAnF,EAAAkF,EAAAV,EAAA5F,GAAA,OAAAsG,IAAAA,EAAA,IAAAyiB,KAAAC,eAAA,QAAA,CAAAC,QAAA,EAAAC,SAAA3iB,EAAAoc,KAAA,UAAAC,MAAA,UAAA8E,IAAA,UAAAiB,KAAA,UAAAC,OAAA,UAAAC,OAAA,UAAAC,aAAA1nB,IAAAwE,EAAA5F,GAAAsG,GAAAA,CAAA,CAAA,CAAAnG,EAAAiB,GAAA,OAAAkF,EAAA6iB,cAAAnpB,EAAA,EAAA0G,EAAA,SAAAd,EAAAzF,GAAA,IAAA,IAAAiB,EAAAuF,EAAAf,EAAAzF,GAAAmG,EAAA,GAAAI,EAAA,EAAAA,EAAAtF,EAAAD,OAAAuF,GAAA,EAAA,CAAA,IAAAZ,EAAA1E,EAAAsF,GAAAmG,EAAA/G,EAAA+M,KAAAkB,EAAAjO,EAAArE,MAAA+E,EAAAD,EAAAsG,GAAArG,GAAA,IAAAF,EAAAE,GAAAyO,SAAAlB,EAAA,IAAA,CAAA,IAAAkO,EAAA3b,EAAA,GAAA+G,EAAA,KAAA4U,EAAA,EAAAA,EAAAD,EAAA1b,EAAA,GAAA,IAAAA,EAAA,GAAA,IAAAA,EAAA,GAAA,IAAA+G,EAAA,IAAA/G,EAAA,GAAA,IAAAA,EAAA,GAAA,OAAAic,GAAA3c,EAAA,OAAA5F,EAAAyjB,IAAAzB,GAAArc,WAAA4c,GAAAA,EAAA,MAAA,GAAA,EAAAzc,EAAA1E,EAAAf,UAAAyF,EAAAsjB,GAAA,SAAA7iB,EAAAX,QAAA,IAAAW,IAAAA,EAAAD,GAAA,IAAAnG,EAAAyC,KAAA6f,YAAArhB,EAAAwB,KAAAgjB,SAAAjf,EAAAvF,EAAAyW,eAAA,QAAA,CAAAqR,SAAA3iB,IAAAG,EAAAsC,KAAAkD,OAAA9K,EAAA,IAAAqc,KAAA9W,IAAA,IAAA,IAAAb,EAAA9F,EAAA2G,EAAA,CAAA4c,OAAA3gB,KAAA4gB,KAAAuC,KAAA,cAAAnjB,KAAAoiB,KAAAvC,UAAA,IAAAzZ,KAAAkD,MAAA9K,EAAAolB,oBAAA,IAAA9f,GAAA,GAAA,GAAAd,EAAA,CAAA,IAAAiH,EAAA/G,EAAA2c,YAAA3c,EAAAA,EAAAuJ,IAAAlP,EAAA0M,EAAA,SAAA,CAAA,OAAA/G,EAAA6d,GAAA0F,UAAA9iB,EAAAT,CAAA,EAAAA,EAAAyhB,WAAA,SAAAhhB,GAAA,IAAAX,EAAAhD,KAAA+gB,GAAA0F,WAAArpB,EAAAopB,GAAAE,QAAAnpB,EAAAwG,EAAA/D,KAAA+C,UAAAC,EAAA,CAAAkjB,aAAAviB,IAAAgjB,MAAA,SAAAhjB,GAAA,MAAA,iBAAAA,EAAAsM,KAAAS,aAAA,IAAA,OAAAnT,GAAAA,EAAAsB,KAAA,EAAA,IAAAoL,EAAA/G,EAAAuf,QAAAvf,EAAAuf,QAAA,SAAA9e,EAAAX,GAAA,IAAAhD,KAAA+gB,KAAA/gB,KAAA+gB,GAAA0F,UAAA,OAAAxc,EAAAtM,KAAAqC,KAAA2D,EAAAX,GAAA,IAAAzF,EAAAH,EAAA4C,KAAAsjB,OAAA,2BAAA,CAAA3C,OAAA3gB,KAAA4gB,KAAA,OAAA3W,EAAAtM,KAAAJ,EAAAoG,EAAAX,GAAAwjB,GAAAxmB,KAAA+gB,GAAA0F,WAAA,EAAA,EAAArpB,EAAAopB,GAAA,SAAA7iB,EAAAX,EAAAzF,GAAA,IAAAiB,EAAAjB,GAAAyF,EAAAe,EAAAxG,GAAAyF,GAAAU,EAAAR,EAAAY,GAAA1G,IAAA2G,GAAA,GAAA,iBAAAJ,EAAA,OAAAvG,EAAAuG,GAAA6iB,GAAAziB,GAAA,IAAAkG,EAAA,SAAAtG,EAAAX,EAAAzF,GAAA,IAAAiB,EAAAmF,EAAA,GAAAX,EAAA,IAAA5F,EAAA0G,EAAAtF,EAAAjB,GAAA,GAAAyF,IAAA5F,EAAA,MAAA,CAAAoB,EAAAwE,GAAA,IAAAU,EAAAI,EAAAtF,GAAA,IAAApB,EAAA4F,GAAA,IAAAzF,GAAA,OAAAH,IAAAsG,EAAA,CAAAlF,EAAApB,GAAA,CAAAuG,EAAA,GAAAyC,KAAAgN,IAAAhW,EAAAsG,GAAA,IAAA0C,KAAAC,IAAAjJ,EAAAsG,GAAA,CAAA,CAAAtG,EAAAyjB,IAAAld,EAAAnF,GAAAuE,UAAAG,EAAAa,GAAAoN,EAAAlH,EAAA,GAAArG,EAAAqG,EAAA,GAAAoV,EAAAjiB,EAAA+T,GAAA0O,UAAAjc,GAAA,OAAAyb,EAAA0B,GAAA0F,UAAA1iB,EAAAsb,CAAA,EAAAjiB,EAAAopB,GAAAE,MAAA,WAAA,OAAAP,KAAAC,iBAAAQ,kBAAAN,QAAA,EAAAlpB,EAAAopB,GAAAK,WAAA,SAAAljB,GAAAD,EAAAC,CAAA,CAAA,CAAA,EAAA,UAAA5C,QAAAoC,SAAA,IAAAC,EAAAA,EAAAD,QAAAH,KAAAW,EAAA,oBAAA0gB,WAAAA,WAAA1gB,GAAAlB,MAAAqkB,sBAAA9jB,G/BwiIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASa,EAAQT,EAAOD,GgCxiIlC,IAAAQ,EAAAnF,EAAAmF,EAAA3D,KAAAxB,EAAA,WAAA,IAAAmF,EAAA,SAAAnF,EAAA,uBAAAwE,EAAA,eAAA,OAAA,SAAAiH,EAAA/G,EAAA3F,GAAA,IAAAuG,EAAAZ,EAAAzF,UAAAF,EAAAsjB,IAAA,SAAAld,GAAA,OAAA,IAAAT,EAAA,CAAA4c,KAAAnc,EAAAkd,KAAA,EAAAtb,KAAAzF,WAAA,EAAAgE,EAAA+c,IAAA,SAAAriB,GAAA,IAAAwE,EAAAzF,EAAAyC,KAAAgjB,SAAA,CAAArC,OAAA3gB,KAAA4gB,GAAAC,KAAA,IAAA,OAAAriB,EAAAwE,EAAAyJ,IAAAzM,KAAA6f,YAAAlc,GAAAX,CAAA,EAAAc,EAAAijB,MAAA,WAAA,OAAAxpB,EAAAyC,KAAAgjB,SAAA,CAAArC,OAAA3gB,KAAA4gB,GAAAC,KAAA,GAAA,EAAA,IAAAzjB,EAAA0G,EAAA+J,MAAA/J,EAAA+J,MAAA,SAAAlK,GAAAA,EAAAkd,MAAA7gB,KAAA8gB,IAAA,GAAA9gB,KAAAsiB,SAAAxe,EAAAH,EAAAqd,WAAAhhB,KAAAghB,QAAArd,EAAAqd,SAAA5jB,EAAAO,KAAAqC,KAAA2D,EAAA,EAAA,IAAAD,EAAAI,EAAAud,KAAAvd,EAAAud,KAAA,WAAA,GAAArhB,KAAA8gB,GAAA,CAAA,IAAAnd,EAAA3D,KAAAihB,GAAAjhB,KAAAshB,GAAA3d,EAAAqjB,iBAAAhnB,KAAAwhB,GAAA7d,EAAAsjB,cAAAjnB,KAAA0hB,GAAA/d,EAAAujB,aAAAlnB,KAAA4hB,GAAAje,EAAAwjB,YAAAnnB,KAAA8hB,GAAAne,EAAAyjB,cAAApnB,KAAAgiB,GAAAre,EAAA0jB,gBAAArnB,KAAAkiB,GAAAve,EAAA2jB,gBAAAtnB,KAAAoiB,IAAAze,EAAA4jB,oBAAA,MAAA7jB,EAAA/F,KAAAqC,KAAA,EAAA,IAAA+D,EAAAD,EAAA+b,UAAA/b,EAAA+b,UAAA,SAAA5V,EAAA/G,GAAA,IAAA3F,EAAAyC,KAAAsiB,SAAAxe,EAAA,GAAAvG,EAAA0M,GAAA,OAAAjK,KAAA8gB,GAAA,EAAAvjB,EAAAyC,KAAAghB,SAAAjd,EAAApG,KAAAqC,MAAAA,KAAAghB,QAAA,GAAA,iBAAA/W,IAAAA,EAAA,SAAAtG,QAAA,IAAAA,IAAAA,EAAA,IAAA,IAAAsG,EAAAtG,EAAAwd,MAAA3iB,GAAA,IAAAyL,EAAA,OAAA,KAAA,IAAA/G,GAAA,GAAA+G,EAAA,IAAAkX,MAAAne,IAAA,CAAA,IAAA,EAAA,GAAAzF,EAAA2F,EAAA,GAAAY,EAAA,IAAAZ,EAAA,KAAAA,EAAA,GAAA,OAAA,IAAAY,EAAA,EAAA,MAAAvG,EAAAuG,GAAAA,CAAA,CAAA,CAAAmG,GAAA,OAAAA,GAAA,OAAAjK,KAAA,IAAA8D,EAAAsC,KAAA+D,IAAAF,IAAA,GAAA,GAAAA,EAAAA,EAAA7M,EAAA4C,KAAA,GAAAkD,EAAA,OAAA9F,EAAA4jB,QAAAld,EAAA1G,EAAA0jB,GAAA,IAAA7W,EAAA7M,EAAA,GAAA,IAAA6M,EAAA,CAAA,IAAAvG,EAAA1D,KAAA8gB,GAAA9gB,KAAAgjB,SAAAY,qBAAA,EAAA5jB,KAAA6f,aAAAziB,EAAA4C,KAAA+mB,QAAAta,IAAA3I,EAAAJ,EAAAC,IAAAqd,QAAAld,EAAA1G,EAAA2jB,GAAAyG,aAAA9jB,CAAA,MAAAtG,EAAA4C,KAAA6gB,MAAA,OAAAzjB,CAAA,EAAA,IAAAgiB,EAAAtb,EAAAwf,OAAAxf,EAAAwf,OAAA,SAAA3f,GAAA,IAAAnF,EAAAmF,IAAA3D,KAAA8gB,GAAA,yBAAA,IAAA,OAAA1B,EAAAzhB,KAAAqC,KAAAxB,EAAA,EAAAsF,EAAAf,QAAA,WAAA,IAAAY,EAAA3D,KAAAsiB,SAAAxe,EAAA9D,KAAAghB,SAAA,EAAAhhB,KAAAghB,SAAAhhB,KAAA+gB,GAAAyG,cAAAxnB,KAAAihB,GAAA2C,qBAAA,OAAA5jB,KAAAihB,GAAAle,UAAA,IAAAY,CAAA,EAAAG,EAAA2jB,MAAA,WAAA,QAAAznB,KAAA8gB,EAAA,EAAAhd,EAAAggB,YAAA,WAAA,OAAA9jB,KAAAgjB,SAAAc,aAAA,EAAAhgB,EAAApG,SAAA,WAAA,OAAAsC,KAAAgjB,SAAAnE,aAAA,EAAA,IAAApU,EAAA3G,EAAAkf,OAAAlf,EAAAkf,OAAA,SAAArf,GAAA,MAAA,MAAAA,GAAA3D,KAAAghB,QAAAzjB,EAAAyC,KAAAsjB,OAAA,4BAAAN,SAAAvY,EAAA9M,KAAAqC,KAAA,EAAA,IAAA4D,EAAAE,EAAA+f,KAAA/f,EAAA+f,KAAA,SAAAlgB,EAAAnF,EAAAwE,GAAA,GAAAW,GAAA3D,KAAA8gB,KAAAnd,EAAAmd,GAAA,OAAAld,EAAAjG,KAAAqC,KAAA2D,EAAAnF,EAAAwE,GAAA,IAAAiH,EAAAjK,KAAA+mB,QAAA7jB,EAAA3F,EAAAoG,GAAAojB,QAAA,OAAAnjB,EAAAjG,KAAAsM,EAAA/G,EAAA1E,EAAAwE,EAAA,CAAA,CAAA,EAAA,UAAAjC,QAAAoC,SAAA,IAAAC,EAAAA,EAAAD,QAAA3E,KAAAmF,EAAA,oBAAA0gB,WAAAA,WAAA1gB,GAAAlB,MAAAilB,iBAAAlpB,GhC0iIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASqF,EAAQT,EAAOD,GiC1iIlC,IAAAH,EAAAW,EAAAX,EAAAhD,KAAA2D,EAAA,WAAA,IAAAX,EAAA,OAAAW,EAAA,OAAA,OAAA,SAAAnF,EAAAjB,EAAAmG,GAAA,IAAAR,EAAA3F,EAAAE,UAAAyF,EAAAuhB,KAAA,SAAAjmB,GAAA,QAAA,IAAAA,IAAAA,EAAA,MAAA,OAAAA,EAAA,OAAAwB,KAAAyM,IAAA,GAAAjO,EAAAwB,KAAAykB,QAAA,OAAA,IAAAlnB,EAAAyC,KAAAijB,UAAA0E,WAAA,EAAA,GAAA,KAAA3nB,KAAAggB,SAAAhgB,KAAA8f,OAAA,GAAA,CAAA,IAAA5c,EAAAQ,EAAA1D,MAAAyiB,QAAA9e,GAAA8I,IAAA,EAAA9I,GAAAmc,KAAAviB,GAAA0M,EAAAvG,EAAA1D,MAAA0iB,MAAA1f,GAAA,GAAAE,EAAA0f,SAAA3Y,GAAA,OAAA,CAAA,CAAA,IAAAlG,EAAAL,EAAA1D,MAAAyiB,QAAA9e,GAAAmc,KAAAviB,GAAAklB,QAAAzf,GAAAqgB,SAAA,EAAA,eAAAjmB,EAAA4C,KAAA6jB,KAAA9f,EAAAf,GAAA,GAAA,OAAA5F,EAAA,EAAAsG,EAAA1D,MAAAyiB,QAAA,QAAAgC,OAAAre,KAAA8Z,KAAA9iB,EAAA,EAAA8F,EAAA0kB,MAAA,SAAA5kB,GAAA,YAAA,IAAAA,IAAAA,EAAA,MAAAhD,KAAAykB,KAAAzhB,EAAA,CAAA,CAAA,EAAA,UAAAjC,QAAAoC,SAAA,IAAAC,EAAAA,EAAAD,QAAAQ,KAAAX,EAAA,oBAAAqhB,WAAAA,WAAArhB,GAAAP,MAAAolB,wBAAAlkB,GjC4iIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASE,EAAQT,EAAOD,GkC5iIlC,IAAAH,IAAAhD,KAAA,UAAAe,QAAAoC,SAAA,IAAAC,EAAAA,EAAAD,QAAA,SAAAH,EAAAW,GAAAA,EAAAlG,UAAAqqB,QAAA,SAAA9kB,GAAA,IAAAW,EAAA3D,KAAAijB,UAAAC,WAAA,EAAA1kB,EAAAwB,KAAA4hB,GAAArkB,GAAAiB,EAAAmF,EAAAnF,EAAA,EAAAA,GAAAmF,EAAA,OAAA3D,KAAAsiB,SAAAxe,EAAAd,GAAAzF,EAAAyC,KAAAqjB,SAAA9lB,EAAA,OAAAkP,IAAAzJ,EAAA,MAAA,CAAA,GAAAA,EAAA,oBAAAqhB,WAAAA,WAAArhB,GAAAP,MAAAslB,qBAAA,SAAA/kB,EAAAW,GAAAA,EAAAlG,UAAAqqB,QAAA,SAAA9kB,GAAA,IAAAW,EAAA3D,KAAAijB,UAAAC,WAAA,EAAA1kB,EAAAwB,KAAA4hB,GAAArkB,GAAAiB,EAAAmF,EAAAnF,EAAA,EAAAA,GAAAmF,EAAA,OAAA3D,KAAAsiB,SAAAxe,EAAAd,GAAAzF,EAAAyC,KAAAqjB,SAAA9lB,EAAA,OAAAkP,IAAAzJ,EAAA,MAAA,CAAA,ClC8iIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASa,EAAQT,EAAOD,GmCvhIlC,IAOA6kB,EAPAC,EAAA,YAAA,oBAAA7oB,QAAA,YAAA2B,QAAA3B,UAAAA,QAAA,KACA8oB,EAAAD,GAAA,mBAAAA,EAAAloB,MACAkoB,EAAAloB,MACA,SAAAR,EAAAE,EAAA8F,GACA,OAAA4iB,SAAA1qB,UAAAsC,MAAApC,KAAA4B,EAAAE,EAAA8F,EACA,EAIAyiB,EADAC,GAAA,mBAAAA,EAAAG,QACAH,EAAAG,QACA5qB,OAAA6qB,sBACA,SAAA9oB,GACA,OAAA/B,OAAA8qB,oBAAA/oB,GACAsH,OAAArJ,OAAA6qB,sBAAA9oB,GACA,EAEA,SAAAA,GACA,OAAA/B,OAAA8qB,oBAAA/oB,EACA,EAOA,IAAAgpB,EAAAhnB,OAAA+c,OAAA,SAAAzf,GACA,OAAAA,GAAAA,CACA,EAEA,SAAA2pB,IACAA,EAAAnH,KAAA1jB,KAAAqC,KACA,CACAoD,EAAAD,QAAAqlB,EACAplB,EAAAD,QAAAwB,KAwYA,SAAA8jB,EAAA3qB,GACA,OAAA,IAAA4qB,SAAA,SAAAC,EAAAC,GACA,SAAAC,EAAAzjB,GACAqjB,EAAAK,eAAAhrB,EAAAirB,GACAH,EAAAxjB,EACA,CAEA,SAAA2jB,IACA,mBAAAN,EAAAK,gBACAL,EAAAK,eAAA,QAAAD,GAEAF,EAAA,GAAA/qB,MAAAD,KAAAmC,WACA,CAEAkpB,EAAAP,EAAA3qB,EAAAirB,EAAA,CAAApkB,MAAA,IACA,UAAA7G,GAMA,SAAA2qB,EAAAQ,EAAAC,GACA,mBAAAT,EAAAU,IACAH,EAAAP,EAAA,QAAAQ,EAAAC,EAEA,CATAE,CAAAX,EAAAI,EAAA,CAAAlkB,MAAA,GAEA,GACA,EAxZA6jB,EAAAA,aAAAA,EAEAA,EAAA/qB,UAAA4rB,aAAAhoB,EACAmnB,EAAA/qB,UAAA6rB,aAAA,EACAd,EAAA/qB,UAAA8rB,mBAAAloB,EAIA,IAAAmoB,EAAA,GAEA,SAAAC,EAAAC,GACA,GAAA,mBAAAA,EACA,MAAA,IAAAvsB,UAAA,mEAAA4D,QAAA2oB,GAEA,CAoCA,SAAAC,EAAAC,GACA,YAAAvoB,IAAAuoB,EAAAL,cACAf,EAAAgB,oBACAI,EAAAL,aACA,CAkDA,SAAAM,EAAAtqB,EAAA0Q,EAAAyZ,EAAAI,GACA,IAAA3Y,EACA4Y,EACAC,EA1HAC,EAgJA,GApBAR,EAAAC,QAGAroB,KADA0oB,EAAAxqB,EAAA8pB,UAEAU,EAAAxqB,EAAA8pB,QAAA7rB,OAAAmE,OAAA,MACApC,EAAA+pB,aAAA,SAIAjoB,IAAA0oB,EAAAG,cACA3qB,EAAA4qB,KAAA,cAAAla,EACAyZ,EAAAA,SAAAA,EAAAA,SAAAA,GAIAK,EAAAxqB,EAAA8pB,SAEAW,EAAAD,EAAA9Z,SAGA5O,IAAA2oB,EAEAA,EAAAD,EAAA9Z,GAAAyZ,IACAnqB,EAAA+pB,kBAeA,GAbA,mBAAAU,EAEAA,EAAAD,EAAA9Z,GACA6Z,EAAA,CAAAJ,EAAAM,GAAA,CAAAA,EAAAN,GAEAI,EACAE,EAAAngB,QAAA6f,GAEAM,EAAAtkB,KAAAgkB,IAIAvY,EAAAwY,EAAApqB,IACA,GAAAyqB,EAAAzrB,OAAA4S,IAAA6Y,EAAAI,OAAA,CACAJ,EAAAI,QAAA,EAGA,IAAAjK,EAAA,IAAAnc,MAAA,+CACAgmB,EAAAzrB,OAAA,IAAAyC,OAAAiP,GADA,qEAIAkQ,EAAAriB,KAAA,8BACAqiB,EAAAsI,QAAAlpB,EACA4gB,EAAAlQ,KAAAA,EACAkQ,EAAAkK,MAAAL,EAAAzrB,OA7KA0rB,EA8KA9J,EA7KA/L,SAAAA,QAAAkW,MAAAlW,QAAAkW,KAAAL,EA8KA,CAGA,OAAA1qB,CACA,CAaA,SAAAgrB,IACA,IAAAvqB,KAAAwqB,MAGA,OAFAxqB,KAAAT,OAAAupB,eAAA9oB,KAAAiQ,KAAAjQ,KAAAyqB,QACAzqB,KAAAwqB,OAAA,EACA,IAAA1qB,UAAAvB,OACAyB,KAAA0pB,SAAA/rB,KAAAqC,KAAAT,QACAS,KAAA0pB,SAAA3pB,MAAAC,KAAAT,OAAAO,UAEA,CAEA,SAAA4qB,EAAAnrB,EAAA0Q,EAAAyZ,GACA,IAAAiB,EAAA,CAAAH,OAAA,EAAAC,YAAAppB,EAAA9B,OAAAA,EAAA0Q,KAAAA,EAAAyZ,SAAAA,GACAkB,EAAAL,EAAAjrB,KAAAqrB,GAGA,OAFAC,EAAAlB,SAAAA,EACAiB,EAAAF,OAAAG,EACAA,CACA,CAyHA,SAAAC,EAAAtrB,EAAA0Q,EAAA6a,GACA,IAAAf,EAAAxqB,EAAA8pB,QAEA,QAAAhoB,IAAA0oB,EACA,MAAA,GAEA,IAAAgB,EAAAhB,EAAA9Z,GACA,YAAA5O,IAAA0pB,EACA,GAEA,mBAAAA,EACAD,EAAA,CAAAC,EAAArB,UAAAqB,GAAA,CAAAA,GAEAD,EAsDA,SAAAhuB,GAEA,IADA,IAAA8Y,EAAA,IAAA7X,MAAAjB,EAAAyB,QACAC,EAAA,EAAAA,EAAAoX,EAAArX,SAAAC,EACAoX,EAAApX,GAAA1B,EAAA0B,GAAAkrB,UAAA5sB,EAAA0B,GAEA,OAAAoX,CACA,CA3DAoV,CAAAD,GAAAE,EAAAF,EAAAA,EAAAxsB,OACA,CAmBA,SAAA2sB,EAAAjb,GACA,IAAA8Z,EAAA/pB,KAAAqpB,QAEA,QAAAhoB,IAAA0oB,EAAA,CACA,IAAAgB,EAAAhB,EAAA9Z,GAEA,GAAA,mBAAA8a,EACA,OAAA,EACA,QAAA1pB,IAAA0pB,EACA,OAAAA,EAAAxsB,MAEA,CAEA,OAAA,CACA,CAMA,SAAA0sB,EAAAnuB,EAAAS,GAEA,IADA,IAAAwS,EAAA,IAAAhS,MAAAR,GACAiB,EAAA,EAAAA,EAAAjB,IAAAiB,EACAuR,EAAAvR,GAAA1B,EAAA0B,GACA,OAAAuR,CACA,CA2CA,SAAAiZ,EAAAP,EAAA3qB,EAAA4rB,EAAAR,GACA,GAAA,mBAAAT,EAAAU,GACAD,EAAAvkB,KACA8jB,EAAA9jB,KAAA7G,EAAA4rB,GAEAjB,EAAAU,GAAArrB,EAAA4rB,OAEA,IAAA,mBAAAjB,EAAA0C,iBAYA,MAAA,IAAAhuB,UAAA,sEAAA4D,QAAA0nB,IATAA,EAAA0C,iBAAArtB,GAAA,SAAAstB,EAAAvqB,GAGAqoB,EAAAvkB,MACA8jB,EAAA4C,oBAAAvtB,EAAAstB,GAEA1B,EAAA7oB,EACA,GAGA,CACA,CAraArD,OAAAuB,eAAAypB,EAAA,sBAAA,CACAxpB,YAAA,EACAK,IAAA,WACA,OAAAmqB,CACA,EACAzQ,IAAA,SAAAlY,GACA,GAAA,iBAAAA,GAAAA,EAAA,GAAA0nB,EAAA1nB,GACA,MAAA,IAAA8N,WAAA,kGAAA9N,EAAA,KAEA2oB,EAAA3oB,CACA,IAGA2nB,EAAAnH,KAAA,gBAEAhgB,IAAArB,KAAAqpB,SACArpB,KAAAqpB,UAAA7rB,OAAAyF,eAAAjD,MAAAqpB,UACArpB,KAAAqpB,QAAA7rB,OAAAmE,OAAA,MACA3B,KAAAspB,aAAA,GAGAtpB,KAAAupB,cAAAvpB,KAAAupB,oBAAAloB,CACA,EAIAmnB,EAAA/qB,UAAA6tB,gBAAA,SAAA/tB,GACA,GAAA,iBAAAA,GAAAA,EAAA,GAAAgrB,EAAAhrB,GACA,MAAA,IAAAoR,WAAA,gFAAApR,EAAA,KAGA,OADAyC,KAAAupB,cAAAhsB,EACAyC,IACA,EAQAwoB,EAAA/qB,UAAA8tB,gBAAA,WACA,OAAA5B,EAAA3pB,KACA,EAEAwoB,EAAA/qB,UAAA0sB,KAAA,SAAAla,GAEA,IADA,IAAA1K,EAAA,GACA/G,EAAA,EAAAA,EAAAsB,UAAAvB,OAAAC,IAAA+G,EAAAG,KAAA5F,UAAAtB,IACA,IAAAgtB,EAAA,UAAAvb,EAEA8Z,EAAA/pB,KAAAqpB,QACA,QAAAhoB,IAAA0oB,EACAyB,EAAAA,QAAAnqB,IAAA0oB,EAAA1V,WACA,IAAAmX,EACA,OAAA,EAGA,GAAAA,EAAA,CACA,IAAAC,EAGA,GAFAlmB,EAAAhH,OAAA,IACAktB,EAAAlmB,EAAA,IACAkmB,aAAAznB,MAGA,MAAAynB,EAGA,IAAArmB,EAAA,IAAApB,MAAA,oBAAAynB,EAAA,KAAAA,EAAAC,QAAA,IAAA,KAEA,MADAtmB,EAAAumB,QAAAF,EACArmB,CACA,CAEA,IAAA6jB,EAAAc,EAAA9Z,GAEA,QAAA5O,IAAA4nB,EACA,OAAA,EAEA,GAAA,mBAAAA,EACAf,EAAAe,EAAAjpB,KAAAuF,OAEA,KAAAjH,EAAA2qB,EAAA1qB,OACAqtB,EAAAX,EAAAhC,EAAA3qB,GACA,IAAAE,EAAA,EAAAA,EAAAF,IAAAE,EACA0pB,EAAA0D,EAAAptB,GAAAwB,KAAAuF,EAHA,CAMA,OAAA,CACA,EAgEAijB,EAAA/qB,UAAAouB,YAAA,SAAA5b,EAAAyZ,GACA,OAAAG,EAAA7pB,KAAAiQ,EAAAyZ,GAAA,EACA,EAEAlB,EAAA/qB,UAAA0rB,GAAAX,EAAA/qB,UAAAouB,YAEArD,EAAA/qB,UAAAquB,gBACA,SAAA7b,EAAAyZ,GACA,OAAAG,EAAA7pB,KAAAiQ,EAAAyZ,GAAA,EACA,EAoBAlB,EAAA/qB,UAAAkH,KAAA,SAAAsL,EAAAyZ,GAGA,OAFAD,EAAAC,GACA1pB,KAAAmpB,GAAAlZ,EAAAya,EAAA1qB,KAAAiQ,EAAAyZ,IACA1pB,IACA,EAEAwoB,EAAA/qB,UAAAsuB,oBACA,SAAA9b,EAAAyZ,GAGA,OAFAD,EAAAC,GACA1pB,KAAA8rB,gBAAA7b,EAAAya,EAAA1qB,KAAAiQ,EAAAyZ,IACA1pB,IACA,EAGAwoB,EAAA/qB,UAAAqrB,eACA,SAAA7Y,EAAAyZ,GACA,IAAA9U,EAAAmV,EAAAiC,EAAAxtB,EAAAytB,EAKA,GAHAxC,EAAAC,QAGAroB,KADA0oB,EAAA/pB,KAAAqpB,SAEA,OAAArpB,KAGA,QAAAqB,KADAuT,EAAAmV,EAAA9Z,IAEA,OAAAjQ,KAEA,GAAA4U,IAAA8U,GAAA9U,EAAA8U,WAAAA,EACA,KAAA1pB,KAAAspB,aACAtpB,KAAAqpB,QAAA7rB,OAAAmE,OAAA,cAEAooB,EAAA9Z,GACA8Z,EAAAjB,gBACA9oB,KAAAmqB,KAAA,iBAAAla,EAAA2E,EAAA8U,UAAAA,SAEA,GAAA,mBAAA9U,EAAA,CAGA,IAFAoX,GAAA,EAEAxtB,EAAAoW,EAAArW,OAAA,EAAAC,GAAA,EAAAA,IACA,GAAAoW,EAAApW,KAAAkrB,GAAA9U,EAAApW,GAAAkrB,WAAAA,EAAA,CACAuC,EAAArX,EAAApW,GAAAkrB,SACAsC,EAAAxtB,EACA,KACA,CAGA,GAAAwtB,EAAA,EACA,OAAAhsB,KAEA,IAAAgsB,EACApX,EAAApJ,QAiIA,SAAAoJ,EAAApQ,GACA,KAAAA,EAAA,EAAAoQ,EAAArW,OAAAiG,IACAoQ,EAAApQ,GAAAoQ,EAAApQ,EAAA,GACAoQ,EAAAnP,KACA,CAnIAymB,CAAAtX,EAAAoX,GAGA,IAAApX,EAAArW,SACAwrB,EAAA9Z,GAAA2E,EAAA,SAEAvT,IAAA0oB,EAAAjB,gBACA9oB,KAAAmqB,KAAA,iBAAAla,EAAAgc,GAAAvC,EACA,CAEA,OAAA1pB,IACA,EAEAwoB,EAAA/qB,UAAA0uB,IAAA3D,EAAA/qB,UAAAqrB,eAEAN,EAAA/qB,UAAA2uB,mBACA,SAAAnc,GACA,IAAA2b,EAAA7B,EAAAvrB,EAGA,QAAA6C,KADA0oB,EAAA/pB,KAAAqpB,SAEA,OAAArpB,KAGA,QAAAqB,IAAA0oB,EAAAjB,eAUA,OATA,IAAAhpB,UAAAvB,QACAyB,KAAAqpB,QAAA7rB,OAAAmE,OAAA,MACA3B,KAAAspB,aAAA,QACAjoB,IAAA0oB,EAAA9Z,KACA,KAAAjQ,KAAAspB,aACAtpB,KAAAqpB,QAAA7rB,OAAAmE,OAAA,aAEAooB,EAAA9Z,IAEAjQ,KAIA,GAAA,IAAAF,UAAAvB,OAAA,CACA,IACAK,EADAoH,EAAAxI,OAAAwI,KAAA+jB,GAEA,IAAAvrB,EAAA,EAAAA,EAAAwH,EAAAzH,SAAAC,EAEA,oBADAI,EAAAoH,EAAAxH,KAEAwB,KAAAosB,mBAAAxtB,GAKA,OAHAoB,KAAAosB,mBAAA,kBACApsB,KAAAqpB,QAAA7rB,OAAAmE,OAAA,MACA3B,KAAAspB,aAAA,EACAtpB,IACA,CAIA,GAAA,mBAFA4rB,EAAA7B,EAAA9Z,IAGAjQ,KAAA8oB,eAAA7Y,EAAA2b,QACA,QAAAvqB,IAAAuqB,EAEA,IAAAptB,EAAAotB,EAAArtB,OAAA,EAAAC,GAAA,EAAAA,IACAwB,KAAA8oB,eAAA7Y,EAAA2b,EAAAptB,IAIA,OAAAwB,IACA,EAmBAwoB,EAAA/qB,UAAAmuB,UAAA,SAAA3b,GACA,OAAA4a,EAAA7qB,KAAAiQ,GAAA,EACA,EAEAuY,EAAA/qB,UAAA4uB,aAAA,SAAApc,GACA,OAAA4a,EAAA7qB,KAAAiQ,GAAA,EACA,EAEAuY,EAAA0C,cAAA,SAAAzC,EAAAxY,GACA,MAAA,mBAAAwY,EAAAyC,cACAzC,EAAAyC,cAAAjb,GAEAib,EAAAvtB,KAAA8qB,EAAAxY,EAEA,EAEAuY,EAAA/qB,UAAAytB,cAAAA,EAiBA1C,EAAA/qB,UAAA6uB,WAAA,WACA,OAAAtsB,KAAAspB,aAAA,EAAAtB,EAAAhoB,KAAAqpB,SAAA,EACA,CnCwnIA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASxlB,EAAQT,EAAOD,GoC1hJlC,IAEAopB,EAAA,SAAAC,GAAAhrB,UAAA+qB,EAAAC,GAAA,IAAAC,EAAAzqB,aAAAuqB,GAEA,SAAAA,EAAAG,EAAAC,GACA,IAAAC,EAsBA,OAtBAxsB,iBAAAJ,KAAAusB,IACAK,EAAAH,EAAA9uB,KAAAqC,KAAA0sB,EAAAC,IAEAE,UAAA,UAAA9rB,QAAA2rB,GAAAA,EAAA,CAAA,EAEAE,EAAA5S,YAAA,mBAKA4S,EAAAE,WAAAF,EAAAG,uBAIAH,EAAAI,OACA,CACA,QACA,QACA,OACA,OACA,QACA,SACAJ,CACA,CA0DA,OAxDAlsB,cAAA6rB,EAAA,CAAA,CAAA3tB,IAAA,uBAAAC,MACA,WAEA,IAAAouB,GAAA,IAAApS,MAAAkI,UAWA,MAVA,0BAAArV,QAAA,SACA,SAAAwf,GAIA,IAAAC,GAAAF,EAAA,GAAA7mB,KAAAgnB,UAAA,GAAA,EAGA,OAFAH,EAAA7mB,KAAAmY,MAAA0O,EAAA,KAEA,KAAAC,EAAAC,EAAA,EAAAA,EAAA,GAAAzvB,SAAA,GACA,GAEA,GAAA,CAAAkB,IAAA,aAAAC,MAEA,WAEA,GACA,CAAAD,IAAA,QAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAmP,MAAA,QAAAke,EAAAC,EACA,GAAA,CAAA1uB,IAAA,QAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAmP,MAAA,QAAAke,EAAAC,EACA,GAAA,CAAA1uB,IAAA,OAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAmP,MAAA,OAAAke,EAAAC,EACA,GAAA,CAAA1uB,IAAA,OAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAmP,MAAA,OAAAke,EAAAC,EACA,GAAA,CAAA1uB,IAAA,QAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAmP,MAAA,QAAAke,EAAAC,EACA,GAAA,CAAA1uB,IAAA,QAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAmP,MAAA,QAAAke,EAAAC,EACA,GAAA,CAAA1uB,IAAA,QAAAC,MAEA,SAAA0uB,EAAAF,EAAAC,GAGA,OAAA,CACA,KAAAf,CAAA,CApFA,CAFA1oB,EAAA,6BAAA2pB,yBAyFApqB,EAAAD,QAAAopB,CpCoiJA,EAAE,CAAC,4BAA4B,KAAK,GAAG,CAAC,SAAS1oB,EAAQT,EAAOD,GqC5nJhE,IAEAsqB,EASArqB,EAAAD,UATAsqB,EAAA,CAAA,GAEArZ,QAAAvQ,EAAA,iCAEA4pB,EAAA,QAAAA,EAAArZ,QAEAqZ,ErCyoJA,EAAE,CAAC,gCAAgC,KAAK,GAAG,CAAC,SAAS5pB,EAAQT,EAAOD,GsCzpJpEC,EAAAD,QAAA,CACA,CACAuqB,WAAA,UACAC,WAAA,UACAC,MAAA,StC6pJA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS/pB,EAAQT,EAAOD,GuCjqJlC,IAEA0qB,EAAA,SAAAC,GAAAtsB,UAAAqsB,EAAAC,GAAA,IAAAC,EAAA/rB,aAAA6rB,GAEA,SAAAA,EAAAnB,EAAAsB,GACA,IAAAC,EAAA7tB,iBAAAJ,KAAA6tB,IACAI,EAAAF,EAAApwB,KAAAqC,KAAA0sB,IAEAwB,iBAAAD,EAAApB,UAAA3sB,eAAA,mBAAA,GAAA+tB,EAAApB,UAAAsB,eACAF,EAAAG,sBAAAH,EAAApB,UAAA3sB,eAAA,wBAAA,GAAA+tB,EAAApB,UAAAwB,oBAEAJ,EAAAK,gBAAAL,EAAApB,UAAA3sB,eAAA,WAAA,IAAA2G,OAAAonB,EAAApB,UAAA0B,QAAA,KACAP,EAAAnB,UAAA3sB,eAAA,WAAA,IAAA2G,OAAAmnB,EAAAnB,UAAA2B,QAAA,KACA,sBAGAP,EAAAQ,0BAAAR,EAAApB,UAAA3sB,eAAA,4BAAA+tB,EAAApB,UAAA6B,wBACAT,EAAAU,yBAAAV,EAAApB,UAAA3sB,eAAA,2BAAA+tB,EAAApB,UAAA+B,uBAGAX,EAAAY,YAAA,CAAA,EACA,IAAA,IAAArwB,EAAA,EAAAA,GAAAyvB,EAAAjB,OAAAzuB,OAAAC,IAEAyvB,EAAAY,YAAAZ,EAAAjB,OAAAxuB,IAAA,IAAAqI,OAAAonB,EAAAjB,OAAAxuB,GAAA,MAAAqI,OAAAonB,EAAAK,gBAAA,MAEAL,EAAAC,kBAGAD,EAAAY,YAAAZ,EAAAjB,OAAAxuB,IAAA,IAAAyvB,EAAAY,YAAAZ,EAAAjB,OAAAxuB,KAEA,OAAAyvB,CACA,CA6BA,OA7BAvtB,cAAAmtB,EAAA,CAAA,CAAAjvB,IAAA,QAAAC,MAEA,SAAAiwB,EAAAzB,EAAA0B,GAEA,IAAAC,EAAA,GACAhvB,KAAAkuB,iBAAAluB,KAAAouB,qBAEAY,GAAA,IAAAnU,MAAAiJ,cAEA9jB,KAAAkuB,kBAEAc,GAAA,IAAAnU,MAGA,IAAAoU,EAAA,GAAApoB,OAAAmoB,GAAAnoB,OAAA7G,KAAA6uB,YAAAC,IAAAjoB,OAAAwmB,GAcA,OAZArtB,KAAAyuB,0BAEAra,QAAA8a,IAAAD,GAIAjvB,KAAA2uB,8BAAA,IAAAI,GAEA3a,QAAA8a,IAAAC,KAAArlB,UAAAilB,EAAA,KAAA,IAIAE,CACA,KAAApB,CAAA,CA1DA,CAFAhqB,EAAA,8BA+DAT,EAAAD,QAAA0qB,CvCmqJA,EAAE,CAAC,4BAA4B,KAAK,GAAG,CAAC,SAAShqB,EAAQT,EAAOD,GwCluJhE,IAAAisB,EAAAvrB,EAAA,iCACAwrB,EAAAxrB,EAAA,MACAyrB,EAAAzrB,EAAA,QAEA0rB,EAAA,SAAAC,GAAAhuB,UAAA+tB,EAAAC,GAAA,IAAAC,EAAAztB,aAAAutB,GAEA,SAAAA,EAAA7C,EAAAsB,GACA,IAAA0B,EAqBA,OArBAtvB,iBAAAJ,KAAAuvB,IACAG,EAAAD,EAAA9xB,KAAAqC,KAAA0sB,EAAAsB,IAGA2B,eAAAD,EAAA7C,UAAA3sB,eAAA,QAAAwvB,EAAA7C,UAAApO,KAAA,KAAA5X,OAAA6oB,EAAApB,gBAAA,QACAoB,EAAAE,YAAAN,EAAAO,UAAAH,EAAAC,gBAEAD,EAAAI,qBAAAJ,EAAA7C,UAAA3sB,eAAA,qBAAAwvB,EAAA7C,UAAAkD,kBACA,CACA7G,MAAA,IACAla,SAAA,QAGA0gB,EAAAM,WAAAX,EAAAY,kBAAAP,EAAAE,YAAAF,EAAAI,sBAEAJ,EAAAQ,iBAAA,EAEAR,EAAAS,eAAA,GACAT,EAAAU,iBAAA,GAEAV,EAAAW,6BAAA,WAAA,EACAX,EAAAY,2BAAA,WAAA,EAAAZ,CACA,CAuFA,OAvFAhvB,cAAA6uB,EAAA,CAAA,CAAA3wB,IAAA,cAAAC,MAEA,SAAA0xB,GAEA,IAAAC,EAAA,mBAAAD,EAAAA,EAAA,WAAA,EACA,GAAAvwB,KAAAgwB,WAGA,OADAhwB,KAAAgwB,WAAAznB,IAAA,MACAvI,KAAAgwB,WAAArrB,KAAA,SAAA6rB,EAAAlxB,KAAAU,MAEA,GAAA,CAAApB,IAAA,+BAAAC,MAEA,SAAA4xB,GAEAzwB,KAAAkwB,iBAAA,EACA,IAAAQ,EAAA,mBAAAD,EAAAA,EAAAzwB,KAAAswB,2BAEA,KAAAtwB,KAAAmwB,eAAA5xB,OAAA,GAMA,OAAAmyB,IAJA1wB,KAAA2wB,qBAAAD,EAMA,GAAA,CAAA9xB,IAAA,uBAAAC,MAEA,SAAA4xB,GAEA,IAAAzwB,KAAAkwB,gBACA,CAEAlwB,KAAAkwB,iBAAA,EAEA,IAAAQ,EAAA,mBAAAD,EAAAA,EAAAzwB,KAAAswB,2BAGAM,EAAA5wB,KAAAmwB,eACAU,EAAA7wB,KAAAowB,iBAGApwB,KAAAmwB,eAAA,GACAnwB,KAAAowB,iBAAA,GAKA,IAFA,IAAAU,EAAA,GAEAtyB,EAAA,EAAAA,EAAAoyB,EAAAryB,OAAAC,IAGAsyB,GAAA,GAAAjqB,OAAA+pB,EAAApyB,GAAA,OACA,IAAAqyB,EAAAryB,KAEAsyB,GAAA,GAAAjqB,OAAAgqB,EAAAryB,GAAA,OAIA,GAAAwB,KAAAgwB,WAAA7gB,MAAA2hB,EAAA,QAOA,OAAA9wB,KAAA+wB,6BAAAL,GAJA1wB,KAAAgwB,WAAArrB,KAAA,QAAA3E,KAAA+wB,6BAAAzxB,KAAAU,KAAA0wB,GAMA,CACA,GAAA,CAAA9xB,IAAA,QAAAC,MAEA,SAAAiwB,EAAAzB,EAAA0B,GAEA,IAAAE,EAAA9vB,KAAAgB,gBAAAovB,EAAA9xB,WAAA,QAAAuC,MAAArC,KAAAqC,KAAA8uB,EAAAzB,EAAA0B,GAGA/uB,KAAAmwB,eAAAzqB,KAAAupB,QAGA,IAAAF,EAEA/uB,KAAAowB,iBAAA1qB,KAAAypB,KAAArlB,UAAAilB,EAAA,KAAA,IAIA/uB,KAAAowB,iBAAA1qB,MAAA,GAGA1F,KAAA2wB,sBACA,KAAApB,CAAA,CAhHA,CAAAH,GAmHAhsB,EAAAD,QAAAosB,CxCouJA,EAAE,CAAC,gCAAgC,GAAGyB,GAAK,GAAGvS,KAAO,KAAK,GAAG,CAAC,SAAS5a,EAAQT,EAAOD,GyCv1JtF,IAEA8tB,EAAA,SAAAC,GAAA1vB,UAAAyvB,EAAAC,GAAA,IAAAC,EAAAnvB,aAAAivB,GAEA,SAAAA,EAAAG,EAAAtX,GACA,IAAAuX,EAAAjxB,iBAAAJ,KAAAixB,IACAI,EAAAF,EAAAxzB,KAAAqC,KAAAoxB,EAAAtX,IAEAE,YAAA,UAEA,IAAAsX,EAAA,WAAAvwB,QAAAqwB,GAAAA,EAAA,CAAA,EAyBA,OAxBAC,EAAAxE,UAAAyE,EAEAD,EAAAE,WAAA1tB,EAAA,wCAEAwtB,EAAAG,mBAAAF,EAAApxB,eAAA,cAAAoxB,EAAAG,WAAA5tB,EAAA,mCAEAwtB,EAAAK,WAAA,GAIAL,EAAAM,aAAA,CAAA,EAGAN,EAAAO,iBAAA,CAAA,EAEAP,EAAAQ,gBAAA,GACAR,EAAAS,gBAAA,GACAT,EAAAU,eAAA,GACAV,EAAAW,eAAA,GACAX,EAAAY,gBAAA,GACAZ,EAAAa,gBAAA,GAEAb,EAAAc,eAAA,SAAA/V,GAAA,OAAAA,CAAA,EAEAiV,EAAAe,KAAA,iBAAAd,EAAA9C,QAAA8C,EAAA9C,QAAA,UAAA6C,CACA,CAsLA,OAtLA3wB,cAAAuwB,EAAA,CAAA,CAAAryB,IAAA,YAAAC,MAEA,SAAAwzB,EAAAvD,GAGA,GAAA9uB,KAAA4xB,iBAAA1xB,eAAAmyB,EAAAvF,YAEA,OAAA,EAQA,OAJA9sB,KAAA0xB,WAAAhsB,KAAA2sB,GACAryB,KAAA4xB,iBAAAS,EAAAvF,aAAA,EAGAgC,GAEA,IAAA,QACA9uB,KAAA6xB,gBAAAnsB,KAAA2sB,GACA,IAAA,QACAryB,KAAA8xB,gBAAApsB,KAAA2sB,GACA,IAAA,OACAryB,KAAA+xB,eAAArsB,KAAA2sB,GACA,IAAA,OACAryB,KAAAgyB,eAAAtsB,KAAA2sB,GACA,IAAA,QACAryB,KAAAiyB,gBAAAvsB,KAAA2sB,GACA,IAAA,QACAryB,KAAAkyB,gBAAAxsB,KAAA2sB,GAIA,OAAA,CACA,GAAA,CAAAzzB,IAAA,oBAAAC,MAEA,SAAAyzB,GAIAtyB,KAAAmyB,eAFA,mBAAAG,EAEAA,EAIA,SAAAlW,GAAA,OAAAA,CAAA,CAEA,GAAA,CAAAxd,IAAA,QAAAC,MAEA,SAAA0zB,EAAAnW,GAGA,IADA,IAAAoW,EAAAxyB,KAAAmyB,eAAA/V,GACA5d,EAAA,EAAAA,EAAAwB,KAAA6xB,gBAAAtzB,OAAAC,IAEAwB,KAAA6xB,gBAAArzB,GAAAi0B,MAAAF,EAAAC,EAEA,GAAA,CAAA5zB,IAAA,QAAAC,MAEA,SAAA0zB,EAAAnW,GAGA,IADA,IAAAoW,EAAAxyB,KAAAmyB,eAAA/V,GACA5d,EAAA,EAAAA,EAAAwB,KAAA8xB,gBAAAvzB,OAAAC,IAEAwB,KAAA8xB,gBAAAtzB,GAAAk0B,MAAAH,EAAAC,EAEA,GAAA,CAAA5zB,IAAA,OAAAC,MAEA,SAAA0zB,EAAAnW,GAGA,IADA,IAAAoW,EAAAxyB,KAAAmyB,eAAA/V,GACA5d,EAAA,EAAAA,EAAAwB,KAAA+xB,eAAAxzB,OAAAC,IAEAwB,KAAA+xB,eAAAvzB,GAAAm0B,KAAAJ,EAAAC,EAEA,GAAA,CAAA5zB,IAAA,OAAAC,MAEA,SAAA0zB,EAAAnW,GAGA,IADA,IAAAoW,EAAAxyB,KAAAmyB,eAAA/V,GACA5d,EAAA,EAAAA,EAAAwB,KAAAgyB,eAAAzzB,OAAAC,IAEAwB,KAAAgyB,eAAAxzB,GAAA8rB,KAAAiI,EAAAC,EAEA,GAAA,CAAA5zB,IAAA,QAAAC,MAEA,SAAA0zB,EAAAnW,GAGA,IADA,IAAAoW,EAAAxyB,KAAAmyB,eAAA/V,GACA5d,EAAA,EAAAA,EAAAwB,KAAAiyB,gBAAA1zB,OAAAC,IAEAwB,KAAAiyB,gBAAAzzB,GAAA6V,MAAAke,EAAAC,EAEA,GAAA,CAAA5zB,IAAA,QAAAC,MAEA,SAAA0zB,EAAAnW,GAGA,IADA,IAAAoW,EAAAxyB,KAAAmyB,eAAA/V,GACA5d,EAAA,EAAAA,EAAAwB,KAAAkyB,gBAAA3zB,OAAAC,IAEAwB,KAAAkyB,gBAAA1zB,GAAAo0B,MAAAL,EAAAC,EAEA,GAAA,CAAA5zB,IAAA,aAAAC,MAEA,WAGA,IAAA,IAAAL,EAAA,EAAAA,EAAAwB,KAAAwxB,mBAAAjzB,OAAAC,IACA,CACA,IAAAq0B,EAAAr1B,OAAAs1B,OAAA,CAAApF,WAAA,UAAAC,WAAA,UAAAC,MAAA,QAAA5tB,KAAAwxB,mBAAAhzB,IAEAwB,KAAAuxB,WAAArxB,eAAA2yB,EAAAnF,YAMA1tB,KAAA+yB,UAAA,IAAA/yB,KAAAuxB,WAAAsB,EAAAnF,YAAAmF,EAAA7yB,MAAA6yB,EAAAjF,OAJAxZ,QAAA8a,IAAA,sEAAAroB,OAAAsoB,KAAArlB,UAAA+oB,IAMA,CAGA,IAAA,IAAAr0B,EAAA,EAAAA,EAAAwB,KAAA0xB,WAAAnzB,OAAAC,IAEAwB,KAAA0xB,WAAAlzB,GAAAw0B,YAEA,GAAA,CAAAp0B,IAAA,UAAAC,MAEA,SAAA0zB,EAAAnW,GAEA,IAAA6W,OAAA,IAAAV,EAAAA,EAAA,OACAW,EAAA,IAAArY,KACA7a,KAAA2yB,KAAA,GAAA9rB,OAAAosB,EAAA,KAAApsB,OAAAqsB,EAAA,YAAArsB,QAAAqsB,EAAA,KAAA9W,EACA,GAEA,CAAAxd,IAAA,eAAAC,MACA,WAEA,OAAA,IAAAgc,IACA,GAAA,CAAAjc,IAAA,eAAAC,MAEA,SAAAs0B,GAGA,OADA,IAAAtY,KACAsY,CACA,GAEA,CAAAv0B,IAAA,eAAAC,MACA,SAAAu0B,EAAAb,EAAAnW,GAEA,IAAA6W,OAAA,IAAAV,EAAAA,EAAA,mBAGAc,GAFAtyB,QAAAqb,IAEA,IAAAvB,MAEA7a,KAAA2yB,KAAA,GAAA9rB,OAAAosB,EAAA,sBAAApsB,QAAAwsB,EAAA,YAAAxsB,OAAAusB,EAAA,OAAAhX,EACA,GAAA,CAAAxd,IAAA,oBAAAC,MAEA,SAAAu0B,EAAAb,EAAAnW,GAEA,IAAA6W,OAAA,IAAAV,EAAAA,EAAA,mBAEAc,GAAA,IAAAxY,KAEAyY,EAAAjhB,SAAA+gB,EAAA,KACAG,EAAAlhB,SAAA+gB,EAAA,IAAA,IACAI,EAAAnhB,SAAA+gB,EAAA,IAAA,IACAK,EAAAphB,SAAA+gB,EAAA,MAEAE,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,EAEAzzB,KAAA2yB,KAAA,GAAA9rB,OAAAosB,EAAA,sBAAApsB,QAAAwsB,EAAA,YAAAxsB,OAAAusB,EAAA,YAAAvsB,OAAA4sB,EAAA,KAAA5sB,OAAA2sB,EAAA,KAAA3sB,OAAA0sB,EAAA,KAAA1sB,OAAAysB,EAAA,KAAAlX,EACA,GAAA,CAAAxd,IAAA,uBAAAC,MAEA,SAAA60B,EAAAnB,EAAAnW,GAEApc,KAAA2zB,aAAA3zB,KAAA4zB,aAAAF,GAAAnB,EAAAnW,EACA,GAAA,CAAAxd,IAAA,4BAAAC,MAEA,SAAA60B,EAAAnB,EAAAnW,GAEApc,KAAA6zB,kBAAA7zB,KAAA4zB,aAAAF,GAAAnB,EAAAnW,EACA,KAAA6U,CAAA,CAxNA,CAFAptB,EAAA,6BAAA2pB,yBA6NApqB,EAAAD,QAAA8tB,EACA7tB,EAAAD,QAAA2wB,gBAAAjwB,EAAA,6BACAT,EAAAD,QAAA4wB,mBAAAlwB,EAAA,iCACAT,EAAAD,QAAA6wB,oBAAAnwB,EAAA,uCzC81JA,EAAE,CAAC,4BAA4B,GAAG,uCAAuC,GAAG,kCAAkC,GAAG,gCAAgC,GAAG,uCAAuC,GAAG,4BAA4B,KAAK,GAAG,CAAC,SAASA,EAAQT,EAAOD,G0ClkK3P,IASA8wB,EAAA,WAEA,SAAAA,EAAAC,EAAApa,GACA1Z,iBAAAJ,KAAAi0B,GACAj0B,KAAAm0B,OAAA,EAEAn0B,KAAA2d,QAAA,WAAA5c,QAAAmzB,GAAAA,EAAA,CAAA,EAEAl0B,KAAAga,YAAA,UAGAha,KAAAo0B,KAAA,WAAAvtB,OAAAT,KAAAmY,MAAA,MAAAnY,KAAAgnB,SAAA,MAEAptB,KAAA0a,KAAA,iBAAAZ,EAAAA,EAAA,GAAAjT,OAAA7G,KAAAo0B,KACA,CAWA,OAXA1zB,cAAAuzB,EAAA,CAAA,CAAAr1B,IAAA,eAAAC,MAMA,SAAA+a,GAIA,OAFA5Z,KAAAm0B,MAAAva,GAEA,CACA,KAAAqa,CAAA,CAzBA,GAyBAv1B,iBAzBAu1B,EAAA,kBAiBA,GAWA7wB,EAAAD,QAAA8wB,C1CqkKA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASpwB,EAAQT,EAAOD,G2C1mKlC,IAKAkxB,EAAA3zB,eAEA,SAAA2zB,EAAAza,EAAAsa,EAAApa,GACA1Z,iBAAAJ,KAAAq0B,GACAr0B,KAAAm0B,MAAAva,EAEA5Z,KAAA2d,QAAA,WAAA5c,QAAAmzB,GAAAA,EACA,WAAAnzB,QAAA6Y,IAAAA,EAAA0a,QACA,CAAA,EADA1a,EAGA5Z,KAAAga,YAAA,UAEA,mBAAAJ,EAAA2a,QAEAv0B,KAAAo0B,KAAAxa,EAAA2a,UAIAv0B,KAAAo0B,KAAA,cAAAvtB,OAAAT,KAAAmY,MAAA,MAAAnY,KAAAgnB,SAAA,MAGAptB,KAAA0a,KAAA,iBAAAZ,EAAAA,EAAA,GAAAjT,OAAA7G,KAAAo0B,MAGAp0B,KAAAkvB,IAAAlvB,KAAAm0B,MAAAjF,IACAlvB,KAAAw0B,YAAAx0B,KAAAm0B,MAAAK,YACAx0B,KAAAy0B,SAAAz0B,KAAAm0B,MAAAM,QACA,IAAA/1B,iBA3BA21B,EAAA,kBA6BA,GAGAjxB,EAAAD,QAAAkxB,EAEAjxB,EAAAD,QAAAqqB,wBAAA3pB,EAAA,yC3C4mKA,EAAE,CAAC,yCAAyC,KAAK,GAAG,CAAC,SAASA,EAAQT,EAAOD,G4CnpK7EC,EAAAD,QAAA,CACAqrB,QAAA,sBACAkG,eAAA,QAEAC,YAAA,EAEAlD,WACA,CACA,CACA7D,MAAA,U5CypKA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS/pB,EAAQT,EAAOD,IAClC,SAAWyxB,IAAS,W6C1pKpB,IAAAC,EAAAhxB,EAAA,aAEAixB,EAAA,WAEA,SAAAA,EAAAC,GACA30B,iBAAAJ,KAAA80B,GAEA90B,KAAAg1B,kBAAA,IAAAH,EAGA70B,KAAAg1B,kBAAAC,WAAA,KAAA,KACA,SAAAC,GAEA,IAAAC,EAAAD,EAAA9f,OAEAggB,EAAAD,EAAA9sB,QAAA,KAEAgtB,EAAAD,GAAA,EAAAD,EAAAvnB,UAAAwnB,EAAA,GAAA,GAEAE,EAAAF,GAAA,EAAAD,EAAAvnB,UAAA,EAAAwnB,GAAAD,EAEA,OAAAP,EAAAW,IAAAr1B,eAAAo1B,GAEAV,EAAAW,IAAAD,GAIAD,CAEA,GACA,CAKA,OALA30B,cAAAo0B,EAAA,CAAA,CAAAl2B,IAAA,eAAAC,MAEA,SAAA22B,GAEA,OAAAx1B,KAAAg1B,kBAAAS,YAAAD,EACA,KAAAV,CAAA,CAjCA,GAoCA1xB,EAAAD,QAAA2xB,C7CsqKC,GAAEn3B,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,YAElC,EAAE,CAAC6xB,SAAW,GAAGC,UAAY,KAAK,GAAG,CAAC,SAAS9xB,EAAQT,EAAOD,G8C/sK9D,IAAAoW,EAAA1V,EAAA,6BAAA2pB,wBAEAoI,EAAA/xB,EAAA,yCAEAgyB,EAAA,SAAAC,GAAAt0B,UAAAq0B,EAAAC,GAAA,IAAAC,EAAA/zB,aAAA6zB,GAEA,SAAAA,EAAAzE,EAAAtX,GACA,IAAAkc,EAAA51B,iBAAAJ,KAAA61B,IACAG,EAAAD,EAAAp4B,KAAAqC,KAAAoxB,EAAAtX,IAEAE,YAAA,kBAGAgc,EAAAC,0BAAA,IAAAL,EAGAI,EAAAE,wBAAA9E,GAEA4E,EAAA,QAAAA,EAAAG,uBAGA,IAAA7E,EAAA0E,EAAAI,MAAAhF,EAAA4E,EAAAG,wBAKA,GAFAH,EAAAt2B,KAAAyvB,KAAAthB,MAAAshB,KAAArlB,UAAAwnB,IAEAA,EAAA+E,kBAEA,IAGA/E,EAAA0E,EAAAI,MAAAvyB,EAAAytB,EAAA+E,mBAAA/E,EACA,CACA,MAAAgF,GAIAliB,QAAA8a,IAAA,2HACA9a,QAAA8a,IAAA,2BAAAoH,EACA,CAGA,GAAAhF,EAAAqD,WAEA,IAGArD,EAAA0E,EAAAI,MAAAvyB,EAAAytB,EAAAqD,YAAArD,EACA,CACA,MAAAgF,GAIAliB,QAAA8a,IAAA,mHACA9a,QAAA8a,IAAA,2BAAAoH,EACA,CAGA,OAAAN,EAAAO,SAAAjF,EAAA0E,CACA,CAoGA,OAlGAt1B,cAAAm1B,EAAA,CAAA,CAAAj3B,IAAA,uBAAAC,MACA,WAEA,OAAAswB,KAAAthB,MAAAshB,KAAArlB,UAAAjG,EAAA,6BACA,GAEA,CAAAjF,IAAA,0BAAAC,MACA,SAAAuyB,GAGApxB,KAAAw2B,uBAAApF,IAAA,IAAAA,EAAAqF,gBACA,GAEA,CAAA73B,IAAA,cAAAC,MACA,SAAAuyB,GAEA,IAAA,IAAAsF,KAAAtF,EAEA,WAAArwB,QAAAqwB,EAAAsF,IAEA12B,KAAA22B,YAAAvF,EAAAsF,IAEA,iBAAAtF,EAAAsF,KAEAtF,EAAAsF,GAAA12B,KAAAi2B,0BAAAW,aAAAxF,EAAAsF,IAGA,GAEA,CAAA93B,IAAA,YAAAC,MAGA,SAAAA,GAEA,MAAA,WAAAkC,QAAAlC,KAAAd,MAAAM,QAAAQ,EACA,GAEA,CAAAD,IAAA,oBAAAC,MAGA,SAAAg4B,EAAA1mB,GACA,IAAA2mB,EAAA92B,KACA,GAAAmQ,GAAAnQ,KAAA+2B,UAAA5mB,GAmBA,OAfA3S,OAAAwI,KAAAmK,GAAA4T,SAAA,SAAAnlB,GAEA,IAAAo4B,EAAA7mB,EAAAvR,GACA,GAAAk4B,EAAAC,UAAAC,GACA,CACA,IAAAC,EAAAJ,EAAAj4B,GACA,GAAAq4B,GAAAH,EAAAC,UAAAE,GAIA,YADAH,EAAAI,kBAAAD,EAAAD,EAGA,CACAH,EAAAj4B,GAAAo4B,CACA,IACAH,CACA,GAEA,CAAAj4B,IAAA,QAAAC,MACA,SAAAs4B,EAAAC,GAGA,IAAAC,EAAA,WAAAt2B,QAAAo2B,GAAAA,EAAA,CAAA,EAEAG,EAAA,WAAAv2B,QAAAq2B,GAAAA,EAAAp3B,KAAAu2B,SAGAgB,EAAApI,KAAAthB,MAAAshB,KAAArlB,UAAAutB,IAUA,OATAC,EAAAt3B,KAAAk3B,kBAAAI,EAAAC,GAEAv3B,KAAAw2B,uBAEAx2B,KAAA22B,YAAAW,GAGAt3B,KAAAk2B,wBAAAoB,GAEAA,CACA,GAEA,CAAA14B,IAAA,OAAAC,MACA,SAAAs4B,GAGA,IAAAE,EAAA,WAAAt2B,QAAAo2B,GAAAA,EAAA,CAAA,EAGAI,EAAApI,KAAAthB,MAAAshB,KAAArlB,UAAAutB,IAIA,OAFAr3B,KAAAu2B,SAAAv2B,KAAAk3B,kBAAAK,EAAAv3B,KAAAu2B,UAEAv2B,KAAAu2B,QACA,KAAAV,CAAA,CA3JA,CAAAtc,GAoKAnW,EAAAD,QAAA0yB,EACAzyB,EAAAD,QAAA,IANA,SAAAiuB,GAEA,OAAA,IAAAyE,EAAAzE,EACA,C9C4tKA,EAAE,CAAC,2BAA2B,GAAG,wCAAwC,GAAG,4BAA4B,KAAK,GAAG,CAAC,SAASvtB,EAAQT,EAAOD,G+C/3KzI,IACAq0B,EAAA,WAEA,SAAAA,IACAp3B,iBAAAJ,KAAAw3B,GAIAx3B,KAAAy3B,gBAAA,oBAAAC,QAAAA,OAAAD,iBAAAC,OAAAD,gBAAAn4B,KAAAo4B,SACA,oBAAAC,UAAA,mBAAAp0B,OAAAo0B,SAAAF,iBAAAE,SAAAF,gBAAAn4B,KAAAq4B,SACA,CAyCA,OAvCAj3B,cAAA82B,EAAA,CAAA,CAAA54B,IAAA,sBAAAC,MACA,WAEA,IAAA+4B,EAAA,IAAAxvB,WAAA,IAGA,OADApI,KAAAy3B,gBAAAG,GACAA,CACA,GAEA,CAAAh5B,IAAA,sBAAAC,MACA,WAMA,IAFA,IAEAg5B,EAFAD,EAAA,IAAAxvB,WAAA,IAEA5J,EAAA,EAAAA,EAAA,GAAAA,IAEA,IAAA,EAAAA,KAEAq5B,EAAA,WAAAzxB,KAAAgnB,UAGAwK,EAAAp5B,GAAAq5B,MAAA,EAAAr5B,IAAA,GAAA,IAGA,OAAAo5B,CACA,GAAA,CAAAh5B,IAAA,WAAAC,MAEA,WAEA,OAAAmB,KAAAy3B,gBAEAz3B,KAAA83B,sBAIA93B,KAAA+3B,qBAEA,KAAAP,CAAA,CAlDA,GAqDAp0B,EAAAD,QAAAq0B,C/C64KA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS3zB,EAAQT,EAAOD,GgD18KlC,IAAAoW,EAAA1V,EAAA,6BAAA2pB,wBAEAwK,EAAAn0B,EAAA,0BAEAo0B,EAAA,SAAAC,GAAA12B,UAAAy2B,EAAAC,GAAA,IAAAC,EAAAn2B,aAAAi2B,GAEA,SAAAA,EAAA7G,EAAAtX,GACA,IAAAse,EAAAh4B,iBAAAJ,KAAAi4B,IACAG,EAAAD,EAAAx6B,KAAAqC,KAAAoxB,EAAAtX,IAEAE,YAAA,OAIAoe,EAAAC,kBAAA,WAAAt3B,QAAAqwB,KAAAA,EAAAlxB,eAAA,oBAAA,GAAAkxB,EAAAkH,eAGAF,EAAAG,YAAA,WAAAx3B,QAAAqwB,IAAAA,EAAAlxB,eAAA,cAAAkxB,EAAAoH,WAAA,EAAA,EAEAJ,EAAAK,sBAAA,WAAA13B,QAAAqwB,IAAAA,EAAAlxB,eAAA,kBAAAkxB,EAAAsH,eAAA,EAAA,iEAEAN,EAAAO,oBAAA,IAAAX,EAGAI,EAAAQ,WAAA,GACA,IAAA,IAAAp6B,EAAA,EAAAA,EAAA,MAAAA,EAEA45B,EAAAQ,WAAAp6B,IAAAA,EAAA,KAAAd,SAAA,IAAA4U,OAAA,GACA,OAAA8lB,CACA,CAsDA,OApDA13B,cAAAu3B,EAAA,CAAA,CAAAr5B,IAAA,cAAAC,MACA,SAAAg6B,GAEA,IAAAr6B,EAAA,EAEA,MAAA,CACAwB,KAAA44B,WAAAC,EAAAr6B,MAAAwB,KAAA44B,WAAAC,EAAAr6B,MACAwB,KAAA44B,WAAAC,EAAAr6B,MAAAwB,KAAA44B,WAAAC,EAAAr6B,MAAA,IACAwB,KAAA44B,WAAAC,EAAAr6B,MAAAwB,KAAA44B,WAAAC,EAAAr6B,MAAA,IACAwB,KAAA44B,WAAAC,EAAAr6B,MAAAwB,KAAA44B,WAAAC,EAAAr6B,MAAA,IACAwB,KAAA44B,WAAAC,EAAAr6B,MAAAwB,KAAA44B,WAAAC,EAAAr6B,MAAA,IACAwB,KAAA44B,WAAAC,EAAAr6B,MAAAwB,KAAA44B,WAAAC,EAAAr6B,MAAAwB,KAAA44B,WAAAC,EAAAr6B,MAAAwB,KAAA44B,WAAAC,EAAAr6B,MAAAwB,KAAA44B,WAAAC,EAAAr6B,MAAAwB,KAAA44B,WAAAC,EAAAr6B,OACA2J,KAAA,GACA,GAEA,CAAAvJ,IAAA,iBAAAC,MACA,WAEA,IAAAd,MAAA,IAAA,IACA+6B,EAAA94B,KAAA24B,oBAAAI,WAMA,OAHAD,EAAA,GAAA,GAAAA,EAAA,GAAA,GACAA,EAAA,GAAA,GAAAA,EAAA,GAAA,IAEA94B,KAAAg5B,YAAAF,EACA,GAEA,CAAAl6B,IAAA,iBAAAC,MACA,WAIA,IAFA,IAAAo6B,EAAA,GAEAz6B,EAAA,EAAAA,EAAAwB,KAAAu4B,YAAA/5B,IAEAy6B,GAAAj5B,KAAAy4B,sBAAAvuB,OAAA9D,KAAAmY,MAAAnY,KAAAgnB,UAAAptB,KAAAy4B,sBAAAl6B,OAAA,KAGA,OAAA06B,CACA,GAEA,CAAAr6B,IAAA,UAAAC,MACA,WAEA,OAAAmB,KAAAq4B,gBAEAr4B,KAAAk5B,iBAIAl5B,KAAAm5B,gBAEA,KAAAlB,CAAA,CA/EA,CAAA1e,GAyFAnW,EAAAD,QAAA80B,EACA70B,EAAAD,QAAA,IAPA,SAAAiuB,GAEA,OAAA,IAAA6G,EAAA7G,EACA,ChDq9KA,EAAE,CAAC,yBAAyB,GAAG,4BAA4B,KAAK,GAAG,CAAC,SAASvtB,EAAQT,EAAOD,GiD/iL5F,IACAvF,EAAAG,MAAAN,UAAAG,MACAw7B,EAAA57B,OAAAC,UAAAC,SAGA0F,EAAAD,QAAA,SAAAymB,GACA,IAAArqB,EAAAS,KACA,GAAA,mBAAAT,GAJA,sBAIA65B,EAAAz7B,KAAA4B,GACA,MAAA,IAAApC,UARA,kDAQAoC,GAyBA,IAvBA,IAEA85B,EAFA9zB,EAAA3H,EAAAD,KAAAmC,UAAA,GAqBAw5B,EAAAlzB,KAAAC,IAAA,EAAA9G,EAAAhB,OAAAgH,EAAAhH,QACAg7B,EAAA,GACA/6B,EAAA,EAAAA,EAAA86B,EAAA96B,IACA+6B,EAAA7zB,KAAA,IAAAlH,GAKA,GAFA66B,EAAAlR,SAAA,SAAA,oBAAAoR,EAAApxB,KAAA,KAAA,4CAAAggB,EAxBA,WACA,GAAAnoB,gBAAAq5B,EAAA,CACA,IAAAj3B,EAAA7C,EAAAQ,MACAC,KACAuF,EAAAsB,OAAAjJ,EAAAD,KAAAmC,aAEA,OAAAtC,OAAA4E,KAAAA,EACAA,EAEApC,IACA,CACA,OAAAT,EAAAQ,MACA6pB,EACArkB,EAAAsB,OAAAjJ,EAAAD,KAAAmC,YAGA,IAUAP,EAAA9B,UAAA,CACA,IAAA+7B,EAAA,WAAA,EACAA,EAAA/7B,UAAA8B,EAAA9B,UACA47B,EAAA57B,UAAA,IAAA+7B,EACAA,EAAA/7B,UAAA,IACA,CAEA,OAAA47B,CACA,CjDsjLA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASx1B,EAAQT,EAAOD,GkDvmLlC,IAAAs2B,EAAA51B,EAAA,oBAEAT,EAAAD,QAAAglB,SAAA1qB,UAAA6B,MAAAm6B,ClD4mLA,EAAE,CAAC,mBAAmB,KAAK,GAAG,CAAC,SAAS51B,EAAQT,EAAOD,GmD9mLvD,IAAA9B,EAEAq4B,EAAAC,YACAC,EAAAzR,SACA0R,EAAA18B,UAGA28B,EAAA,SAAAC,GACA,IACA,OAAAH,EAAA,yBAAAG,EAAA,iBAAAH,EACA,CAAA,MAAA52B,GAAA,CACA,EAEAsa,EAAA9f,OAAAqC,yBACA,GAAAyd,EACA,IACAA,EAAA,CAAA,EAAA,GACA,CAAA,MAAAta,GACAsa,EAAA,IACA,CAGA,IAAA0c,EAAA,WACA,MAAA,IAAAH,CACA,EACAI,EAAA3c,EACA,WACA,IAGA,OAAA0c,CACA,CAAA,MAAAE,GACA,IAEA,OAAA5c,EAAAxd,UAAA,UAAAT,GACA,CAAA,MAAA86B,GACA,OAAAH,CACA,CACA,CACA,CAbA,GAcAA,EAEAI,EAAAv2B,EAAA,cAAAA,GACAw2B,EAAAx2B,EAAA,YAAAA,GAEAy2B,EAAA98B,OAAAyF,iBACAo3B,EACA,SAAA9wB,GAAA,OAAAA,EAAAxH,SAAA,EACA,MAGAw4B,EAAA,CAAA,EAEAC,EAAA,oBAAApyB,YAAAkyB,EAAAA,EAAAlyB,YAAA/G,EAEAo5B,EAAA,CACA,mBAAA,oBAAAC,eAAAr5B,EAAAq5B,eACA,UAAA38B,MACA,gBAAA,oBAAAsR,YAAAhO,EAAAgO,YACA,2BAAA+qB,GAAAE,EAAAA,EAAA,GAAAn8B,OAAAC,aAAAiD,EACA,mCAAAA,EACA,kBAAAk5B,EACA,mBAAAA,EACA,2BAAAA,EACA,2BAAAA,EACA,YAAA,oBAAAI,QAAAt5B,EAAAs5B,QACA,WAAA,oBAAAC,OAAAv5B,EAAAu5B,OACA,kBAAA,oBAAAC,cAAAx5B,EAAAw5B,cACA,mBAAA,oBAAAC,eAAAz5B,EAAAy5B,eACA,YAAAh4B,QACA,aAAA,oBAAAi4B,SAAA15B,EAAA05B,SACA,SAAAlgB,KACA,cAAAmgB,UACA,uBAAA9b,mBACA,cAAA+b,UACA,uBAAA9b,mBACA,UAAAnb,MACA,SAAAk3B,KACA,cAAAC,UACA,iBAAA,oBAAAC,aAAA/5B,EAAA+5B,aACA,iBAAA,oBAAAC,aAAAh6B,EAAAg6B,aACA,yBAAA,oBAAAC,qBAAAj6B,EAAAi6B,qBACA,aAAA1B,EACA,sBAAAW,EACA,cAAA,oBAAAgB,UAAAl6B,EAAAk6B,UACA,eAAA,oBAAAC,WAAAn6B,EAAAm6B,WACA,eAAA,oBAAAC,WAAAp6B,EAAAo6B,WACA,aAAA/lB,SACA,UAAA4I,MACA,sBAAA8b,GAAAE,EAAAA,EAAAA,EAAA,GAAAn8B,OAAAC,cAAAiD,EACA,SAAA,YAAA,oBAAA8tB,KAAA,YAAApuB,QAAAouB,OAAAA,KAAA9tB,EACA,QAAA,oBAAAq6B,IAAAr6B,EAAAq6B,IACA,yBAAA,oBAAAA,KAAAtB,GAAAE,EAAAA,GAAA,IAAAoB,KAAAv9B,OAAAC,aAAAiD,EACA,SAAA+E,KACA,WAAA7E,OACA,WAAA/D,OACA,eAAAm+B,WACA,aAAAtpB,SACA,YAAA,oBAAAqW,QAAArnB,EAAAqnB,QACA,UAAA,oBAAA7lB,MAAAxB,EAAAwB,MACA,eAAA8L,WACA,mBAAAhM,eACA,YAAA,oBAAAvD,QAAAiC,EAAAjC,QACA,WAAAw8B,OACA,QAAA,oBAAAC,IAAAx6B,EAAAw6B,IACA,yBAAA,oBAAAA,KAAAzB,GAAAE,EAAAA,GAAA,IAAAuB,KAAA19B,OAAAC,aAAAiD,EACA,sBAAA,oBAAAy6B,kBAAAz6B,EAAAy6B,kBACA,WAAA96B,OACA,4BAAAo5B,GAAAE,EAAAA,EAAA,GAAAn8B,OAAAC,aAAAiD,EACA,WAAA+4B,EAAAj8B,OAAAkD,EACA,gBAAAq4B,EACA,mBAAAO,EACA,eAAAO,EACA,cAAAX,EACA,eAAA,oBAAAzxB,WAAA/G,EAAA+G,WACA,sBAAA,oBAAA2zB,kBAAA16B,EAAA06B,kBACA,gBAAA,oBAAAC,YAAA36B,EAAA26B,YACA,gBAAA,oBAAAC,YAAA56B,EAAA46B,YACA,aAAAC,SACA,YAAA,oBAAAC,QAAA96B,EAAA86B,QACA,YAAA,oBAAAC,QAAA/6B,EAAA+6B,QACA,YAAA,oBAAAC,QAAAh7B,EAAAg7B,SAGA,GAAA/B,EACA,IACA,KAAAjmB,KACA,CAAA,MAAArR,GAEA,IAAAs5B,EAAAhC,EAAAA,EAAAt3B,IACAy3B,EAAA,qBAAA6B,CACA,CAGA,IAAAC,EAAA,SAAAA,EAAAz+B,GACA,IAAAe,EACA,GAAA,oBAAAf,EACAe,EAAAi7B,EAAA,6BACA,GAAA,wBAAAh8B,EACAe,EAAAi7B,EAAA,wBACA,GAAA,6BAAAh8B,EACAe,EAAAi7B,EAAA,8BACA,GAAA,qBAAAh8B,EAAA,CACA,IAAA2G,EAAA83B,EAAA,4BACA93B,IACA5F,EAAA4F,EAAAhH,UAEA,MAAA,GAAA,6BAAAK,EAAA,CACA,IAAA0+B,EAAAD,EAAA,oBACAC,GAAAlC,IACAz7B,EAAAy7B,EAAAkC,EAAA/+B,WAEA,CAIA,OAFAg9B,EAAA38B,GAAAe,EAEAA,CACA,EAEA49B,EAAA,CACA,yBAAA,CAAA,cAAA,aACA,mBAAA,CAAA,QAAA,aACA,uBAAA,CAAA,QAAA,YAAA,WACA,uBAAA,CAAA,QAAA,YAAA,WACA,oBAAA,CAAA,QAAA,YAAA,QACA,sBAAA,CAAA,QAAA,YAAA,UACA,2BAAA,CAAA,gBAAA,aACA,mBAAA,CAAA,yBAAA,aACA,4BAAA,CAAA,yBAAA,YAAA,aACA,qBAAA,CAAA,UAAA,aACA,sBAAA,CAAA,WAAA,aACA,kBAAA,CAAA,OAAA,aACA,mBAAA,CAAA,QAAA,aACA,uBAAA,CAAA,YAAA,aACA,0BAAA,CAAA,eAAA,aACA,0BAAA,CAAA,eAAA,aACA,sBAAA,CAAA,WAAA,aACA,cAAA,CAAA,oBAAA,aACA,uBAAA,CAAA,oBAAA,YAAA,aACA,uBAAA,CAAA,YAAA,aACA,wBAAA,CAAA,aAAA,aACA,wBAAA,CAAA,aAAA,aACA,cAAA,CAAA,OAAA,SACA,kBAAA,CAAA,OAAA,aACA,iBAAA,CAAA,MAAA,aACA,oBAAA,CAAA,SAAA,aACA,oBAAA,CAAA,SAAA,aACA,sBAAA,CAAA,SAAA,YAAA,YACA,qBAAA,CAAA,SAAA,YAAA,WACA,qBAAA,CAAA,UAAA,aACA,sBAAA,CAAA,UAAA,YAAA,QACA,gBAAA,CAAA,UAAA,OACA,mBAAA,CAAA,UAAA,UACA,oBAAA,CAAA,UAAA,WACA,wBAAA,CAAA,aAAA,aACA,4BAAA,CAAA,iBAAA,aACA,oBAAA,CAAA,SAAA,aACA,iBAAA,CAAA,MAAA,aACA,+BAAA,CAAA,oBAAA,aACA,oBAAA,CAAA,SAAA,aACA,oBAAA,CAAA,SAAA,aACA,yBAAA,CAAA,cAAA,aACA,wBAAA,CAAA,aAAA,aACA,uBAAA,CAAA,YAAA,aACA,wBAAA,CAAA,aAAA,aACA,+BAAA,CAAA,oBAAA,aACA,yBAAA,CAAA,cAAA,aACA,yBAAA,CAAA,cAAA,aACA,sBAAA,CAAA,WAAA,aACA,qBAAA,CAAA,UAAA,aACA,qBAAA,CAAA,UAAA,cAGAn9B,EAAAuE,EAAA,iBACA64B,EAAA74B,EAAA,OACA84B,EAAAr9B,EAAA3B,KAAAwqB,SAAAxqB,KAAAI,MAAAN,UAAAoJ,QACA+1B,EAAAt9B,EAAA3B,KAAAwqB,SAAApoB,MAAAhC,MAAAN,UAAAo/B,QACAC,EAAAx9B,EAAA3B,KAAAwqB,SAAAxqB,KAAAqD,OAAAvD,UAAAiQ,SACAqvB,EAAAz9B,EAAA3B,KAAAwqB,SAAAxqB,KAAAqD,OAAAvD,UAAAG,OACAo/B,EAAA19B,EAAA3B,KAAAwqB,SAAAxqB,KAAAi+B,OAAAn+B,UAAAw/B,MAGAC,EAAA,qGACAC,EAAA,WAiBAC,EAAA,SAAAt/B,EAAAmf,GACA,IACAogB,EADAC,EAAAx/B,EAOA,GALA4+B,EAAAD,EAAAa,KAEAA,EAAA,KADAD,EAAAZ,EAAAa,IACA,GAAA,KAGAZ,EAAAjC,EAAA6C,GAAA,CACA,IAAAz+B,EAAA47B,EAAA6C,GAIA,GAHAz+B,IAAA07B,IACA17B,EAAA09B,EAAAe,SAEA,IAAAz+B,IAAAoe,EACA,MAAA,IAAA4c,EAAA,aAAA/7B,EAAA,wDAGA,MAAA,CACAu/B,MAAAA,EACAv/B,KAAAw/B,EACAz+B,MAAAA,EAEA,CAEA,MAAA,IAAA66B,EAAA,aAAA57B,EAAA,mBACA,EAEAsF,EAAAD,QAAA,SAAArF,EAAAmf,GACA,GAAA,iBAAAnf,GAAA,IAAAA,EAAAS,OACA,MAAA,IAAAs7B,EAAA,6CAEA,GAAA/5B,UAAAvB,OAAA,GAAA,kBAAA0e,EACA,MAAA,IAAA4c,EAAA,6CAGA,GAAA,OAAAmD,EAAA,cAAAl/B,GACA,MAAA,IAAA47B,EAAA,sFAEA,IAAA5xB,EAtDA,SAAAiH,GACA,IAAAwuB,EAAAR,EAAAhuB,EAAA,EAAA,GACAyuB,EAAAT,EAAAhuB,GAAA,GACA,GAAA,MAAAwuB,GAAA,MAAAC,EACA,MAAA,IAAA9D,EAAA,kDACA,GAAA,MAAA8D,GAAA,MAAAD,EACA,MAAA,IAAA7D,EAAA,kDAEA,IAAAt3B,EAAA,GAIA,OAHA06B,EAAA/tB,EAAAmuB,GAAA,SAAA/b,EAAAsc,EAAAC,EAAAC,GACAv7B,EAAAA,EAAA7D,QAAAm/B,EAAAZ,EAAAa,EAAAR,EAAA,MAAAM,GAAAtc,CACA,IACA/e,CACA,CAyCAw7B,CAAA9/B,GACA+/B,EAAA/1B,EAAAvJ,OAAA,EAAAuJ,EAAA,GAAA,GAEAoV,EAAAkgB,EAAA,IAAAS,EAAA,IAAA5gB,GACA6gB,EAAA5gB,EAAApf,KACAe,EAAAqe,EAAAre,MACAk/B,GAAA,EAEAV,EAAAngB,EAAAmgB,MACAA,IACAQ,EAAAR,EAAA,GACAT,EAAA90B,EAAA60B,EAAA,CAAA,EAAA,GAAAU,KAGA,IAAA,IAAA7+B,EAAA,EAAAw/B,GAAA,EAAAx/B,EAAAsJ,EAAAvJ,OAAAC,GAAA,EAAA,CACA,IAAAy/B,EAAAn2B,EAAAtJ,GACA++B,EAAAR,EAAAkB,EAAA,EAAA,GACAT,EAAAT,EAAAkB,GAAA,GACA,IAEA,MAAAV,GAAA,MAAAA,GAAA,MAAAA,GACA,MAAAC,GAAA,MAAAA,GAAA,MAAAA,IAEAD,IAAAC,EAEA,MAAA,IAAA9D,EAAA,wDASA,GAPA,gBAAAuE,GAAAD,IACAD,GAAA,GAMArB,EAAAjC,EAFAqD,EAAA,KADAD,GAAA,IAAAI,GACA,KAGAp/B,EAAA47B,EAAAqD,QACA,GAAA,MAAAj/B,EAAA,CACA,KAAAo/B,KAAAp/B,GAAA,CACA,IAAAoe,EACA,MAAA,IAAA4c,EAAA,sBAAA/7B,EAAA,+CAEA,MACA,CACA,GAAAwf,GAAA9e,EAAA,GAAAsJ,EAAAvJ,OAAA,CACA,IAAAqB,EAAA0d,EAAAze,EAAAo/B,GAWAp/B,GAVAm/B,IAAAp+B,IASA,QAAAA,KAAA,kBAAAA,EAAAP,KACAO,EAAAP,IAEAR,EAAAo/B,EAEA,MACAD,EAAAtB,EAAA79B,EAAAo/B,GACAp/B,EAAAA,EAAAo/B,GAGAD,IAAAD,IACAtD,EAAAqD,GAAAj/B,EAEA,CACA,CACA,OAAAA,CACA,CnDmnLA,EAAE,CAAC,gBAAgB,GAAGq/B,IAAM,GAAG,YAAY,GAAG,cAAc,KAAK,GAAG,CAAC,SAASr6B,EAAQT,EAAOD,GoD/8L7F,IAAAlF,EAAA,CACAiW,IAAA,CAAA,GAGAiqB,EAAA3gC,OAEA4F,EAAAD,QAAA,WACA,MAAA,CAAApB,UAAA9D,GAAAiW,MAAAjW,EAAAiW,OAAA,CAAAnS,UAAA,gBAAAo8B,EACA,CpDo9LA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASt6B,EAAQT,EAAOD,GqD59LlC,IAAAi7B,EAAA,oBAAAjgC,QAAAA,OACAkgC,EAAAx6B,EAAA,WAEAT,EAAAD,QAAA,WACA,MAAA,mBAAAi7B,IACA,mBAAAjgC,SACA,WAAA4C,QAAAq9B,EAAA,UACA,WAAAr9B,QAAA5C,OAAA,SAEAkgC,MACA,CrDi+LA,EAAE,CAAC,UAAU,KAAK,GAAG,CAAC,SAASx6B,EAAQT,EAAOD,GsD1+L9CC,EAAAD,QAAA,WACA,GAAA,mBAAAhF,QAAA,mBAAAX,OAAA6qB,sBAAA,OAAA,EACA,GAAA,WAAAtnB,QAAA5C,OAAAC,UAAA,OAAA,EAEA,IAAAO,EAAA,CAAA,EACA2/B,EAAAngC,OAAA,QACAogC,EAAA/gC,OAAA8gC,GACA,GAAA,iBAAAA,EAAA,OAAA,EAEA,GAAA,oBAAA9gC,OAAAC,UAAAC,SAAAC,KAAA2gC,GAAA,OAAA,EACA,GAAA,oBAAA9gC,OAAAC,UAAAC,SAAAC,KAAA4gC,GAAA,OAAA,EAYA,IAAAD,KADA3/B,EAAA2/B,GADA,GAEA3/B,EAAA,OAAA,EACA,GAAA,mBAAAnB,OAAAwI,MAAA,IAAAxI,OAAAwI,KAAArH,GAAAJ,OAAA,OAAA,EAEA,GAAA,mBAAAf,OAAA8qB,qBAAA,IAAA9qB,OAAA8qB,oBAAA3pB,GAAAJ,OAAA,OAAA,EAEA,IAAAigC,EAAAhhC,OAAA6qB,sBAAA1pB,GACA,GAAA,IAAA6/B,EAAAjgC,QAAAigC,EAAA,KAAAF,EAAA,OAAA,EAEA,IAAA9gC,OAAAC,UAAAghC,qBAAA9gC,KAAAgB,EAAA2/B,GAAA,OAAA,EAEA,GAAA,mBAAA9gC,OAAAqC,yBAAA,CACA,IAAAY,EAAAjD,OAAAqC,yBAAAlB,EAAA2/B,GACA,GAdA,KAcA79B,EAAA5B,QAAA,IAAA4B,EAAAzB,WAAA,OAAA,CACA,CAEA,OAAA,CACA,CtDg/LA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS6E,EAAQT,EAAOD,GuDvhMlC,IAAA7D,EAAAuE,EAAA,iBAEAT,EAAAD,QAAA7D,EAAA3B,KAAAwqB,SAAAxqB,KAAAH,OAAAC,UAAAyC,evD4hMA,EAAE,CAAC,gBAAgB,KAAK,GAAG,CAAC,SAAS2D,EAAQT,EAAOD,GwDhiMpD,IAAAu7B,EAAA76B,EAAA,QACA86B,EAAA96B,EAAA,OAEA+6B,EAAAx7B,EAAAD,QAEA,IAAA,IAAAvE,KAAA8/B,EACAA,EAAAx+B,eAAAtB,KAAAggC,EAAAhgC,GAAA8/B,EAAA9/B,IAaA,SAAAigC,EAAAC,GAOA,GANA,iBAAAA,IACAA,EAAAH,EAAA9wB,MAAAixB,IAEAA,EAAAC,WACAD,EAAAC,SAAA,UAEA,WAAAD,EAAAC,SACA,MAAA,IAAA/6B,MAAA,aAAA86B,EAAAC,SAAA,sCAEA,OAAAD,CACA,CArBAF,EAAAI,QAAA,SAAAF,EAAAz6B,GAEA,OADAy6B,EAAAD,EAAAC,GACAJ,EAAAM,QAAArhC,KAAAqC,KAAA8+B,EAAAz6B,EACA,EAEAu6B,EAAAv/B,IAAA,SAAAy/B,EAAAz6B,GAEA,OADAy6B,EAAAD,EAAAC,GACAJ,EAAAr/B,IAAA1B,KAAAqC,KAAA8+B,EAAAz6B,EACA,CxDgjMA,EAAE,CAACq6B,KAAO,GAAGC,IAAM,MAAM,GAAG,CAAC,SAAS96B,EAAQT,EAAOD,4FyDhkMrDA,EAAAyO,KAAA,SAAAnC,EAAAwC,EAAAgtB,EAAAC,EAAAC,GACA,IAAAn8B,EAAAmO,EACAiuB,EAAA,EAAAD,EAAAD,EAAA,EACAG,GAAA,GAAAD,GAAA,EACAE,EAAAD,GAAA,EACAE,GAAA,EACA/gC,EAAAygC,EAAAE,EAAA,EAAA,EACA9f,EAAA4f,GAAA,EAAA,EACAh1B,EAAAwF,EAAAwC,EAAAzT,GAOA,IALAA,GAAA6gB,EAEArc,EAAAiH,GAAA,IAAAs1B,GAAA,EACAt1B,KAAAs1B,EACAA,GAAAH,EACAG,EAAA,EAAAv8B,EAAA,IAAAA,EAAAyM,EAAAwC,EAAAzT,GAAAA,GAAA6gB,EAAAkgB,GAAA,GAKA,IAHApuB,EAAAnO,GAAA,IAAAu8B,GAAA,EACAv8B,KAAAu8B,EACAA,GAAAL,EACAK,EAAA,EAAApuB,EAAA,IAAAA,EAAA1B,EAAAwC,EAAAzT,GAAAA,GAAA6gB,EAAAkgB,GAAA,GAEA,GAAA,IAAAv8B,EACAA,EAAA,EAAAs8B,MACA,IAAAt8B,IAAAq8B,EACA,OAAAluB,EAAA+P,IAAAjI,KAAAhP,GAAA,EAAA,GAEAkH,GAAA/K,KAAAsG,IAAA,EAAAwyB,GACAl8B,GAAAs8B,CACA,CACA,OAAAr1B,GAAA,EAAA,GAAAkH,EAAA/K,KAAAsG,IAAA,EAAA1J,EAAAk8B,EACA,EAEA/7B,EAAAgM,MAAA,SAAAM,EAAA5Q,EAAAoT,EAAAgtB,EAAAC,EAAAC,GACA,IAAAn8B,EAAAmO,EAAAvN,EACAw7B,EAAA,EAAAD,EAAAD,EAAA,EACAG,GAAA,GAAAD,GAAA,EACAE,EAAAD,GAAA,EACAG,EAAA,KAAAN,EAAA94B,KAAAsG,IAAA,GAAA,IAAAtG,KAAAsG,IAAA,GAAA,IAAA,EACAlO,EAAAygC,EAAA,EAAAE,EAAA,EACA9f,EAAA4f,EAAA,GAAA,EACAh1B,EAAApL,EAAA,GAAA,IAAAA,GAAA,EAAAA,EAAA,EAAA,EAAA,EAmCA,IAjCAA,EAAAuH,KAAA+D,IAAAtL,GAEAyf,MAAAzf,IAAAA,IAAAoa,KACA9H,EAAAmN,MAAAzf,GAAA,EAAA,EACAmE,EAAAq8B,IAEAr8B,EAAAoD,KAAAmY,MAAAnY,KAAA8oB,IAAArwB,GAAAuH,KAAAq5B,KACA5gC,GAAA+E,EAAAwC,KAAAsG,IAAA,GAAA1J,IAAA,IACAA,IACAY,GAAA,IAGA/E,GADAmE,EAAAs8B,GAAA,EACAE,EAAA57B,EAEA47B,EAAAp5B,KAAAsG,IAAA,EAAA,EAAA4yB,IAEA17B,GAAA,IACAZ,IACAY,GAAA,GAGAZ,EAAAs8B,GAAAD,GACAluB,EAAA,EACAnO,EAAAq8B,GACAr8B,EAAAs8B,GAAA,GACAnuB,GAAAtS,EAAA+E,EAAA,GAAAwC,KAAAsG,IAAA,EAAAwyB,GACAl8B,GAAAs8B,IAEAnuB,EAAAtS,EAAAuH,KAAAsG,IAAA,EAAA4yB,EAAA,GAAAl5B,KAAAsG,IAAA,EAAAwyB,GACAl8B,EAAA,IAIAk8B,GAAA,EAAAzvB,EAAAwC,EAAAzT,GAAA,IAAA2S,EAAA3S,GAAA6gB,EAAAlO,GAAA,IAAA+tB,GAAA,GAIA,IAFAl8B,EAAAA,GAAAk8B,EAAA/tB,EACAiuB,GAAAF,EACAE,EAAA,EAAA3vB,EAAAwC,EAAAzT,GAAA,IAAAwE,EAAAxE,GAAA6gB,EAAArc,GAAA,IAAAo8B,GAAA,GAEA3vB,EAAAwC,EAAAzT,EAAA6gB,IAAA,IAAApV,CACA,CzDokMA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASpG,EAAQT,EAAOD,G0DxpMlC,mBAAA3F,OAAAmE,OAEAyB,EAAAD,QAAA,SAAAu8B,EAAAC,GACAA,IACAD,EAAAE,OAAAD,EACAD,EAAAjiC,UAAAD,OAAAmE,OAAAg+B,EAAAliC,UAAA,CACAI,YAAA,CACAgB,MAAA6gC,EACA1gC,YAAA,EACAE,UAAA,EACAD,cAAA,KAIA,EAGAmE,EAAAD,QAAA,SAAAu8B,EAAAC,GACA,GAAAA,EAAA,CACAD,EAAAE,OAAAD,EACA,IAAAE,EAAA,WAAA,EACAA,EAAApiC,UAAAkiC,EAAAliC,UACAiiC,EAAAjiC,UAAA,IAAAoiC,EACAH,EAAAjiC,UAAAI,YAAA6hC,CACA,CACA,C1D4pMA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS77B,EAAQT,EAAOD,G2D1pMlCC,EAAAD,QAZA,SAAA+pB,EAAAsI,GAEA,OAAAA,EAAAsK,WAAA5S,IAAAsI,EAAAuK,SAAA7S,GAEAsI,EAAA5nB,UAAA,EAAA4nB,EAAAj3B,OAAA,GAIAi3B,CAEA,C3DyrMA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS3xB,EAAQT,EAAOD,G4D/sMlC,IAAA68B,EAAAn8B,EAAA,8BAiBAo8B,EAAA,WAEA,SAAAA,EAAAC,EAAAC,GACA//B,iBAAAJ,KAAAigC,GAEAjgC,KAAAogC,QAAA,mBAAAF,EAAAA,EAAAF,EACAhgC,KAAAqgC,SAAA,mBAAAF,EAAAA,EAAAH,EAEAhgC,KAAAsgC,iBAAA,CAAA,CACA,CAoFA,OApFA5/B,cAAAu/B,EAAA,CAAA,CAAArhC,IAAA,mBAAAC,MAEA,WAEA,OAAArB,OAAAwI,KAAAhG,KAAAsgC,kBAAA/hC,MACA,GAAA,CAAAK,IAAA,iBAAAC,MAEA,SAAA0hC,GACA,IAAAC,EAAAxgC,KAGA,GAAA,UAAAe,QAAAw/B,GAGA,OADAvgC,KAAAqgC,SAAA,2FAAAx5B,OAAA9F,QAAAw/B,MACA,EAGA/iC,OAAAwI,KAAAu6B,GAEAxc,SACA,SAAA0c,GAEA,iBAAAF,EAAAE,GAEAD,EAAAH,SAAA,gFAAAx5B,OAAA45B,EAAA,6CAAA55B,OAAA9F,QAAAw/B,EAAAE,MAIAD,EAAAF,iBAAAG,GAAAF,EAAAE,EAEA,GACA,GAAA,CAAA7hC,IAAA,wBAAAC,MAEA,SAAA6hC,GAEA1gC,KAAAsgC,iBAAApgC,eAAAwgC,WAEA1gC,KAAAsgC,iBAAAI,EAEA,GAIA,CAAA9hC,IAAA,oBAAAC,MACA,SAAA0hC,GACA,IAAAI,EAAA3gC,KACA,MAAA,iBAAAugC,GAEAvgC,KAAA4gC,sBAAAL,IACA,GAEA,UAAAx/B,QAAAw/B,IAEA/iC,OAAAwI,KAAAu6B,GAEAxc,SACA,SAAA0c,GAEAE,EAAAE,kBAAAJ,EACA,KACA,IAIAzgC,KAAAqgC,SAAA,mHAAAx5B,OAAA9F,QAAAw/B,MACA,EAEA,GAAA,CAAA3hC,IAAA,oBAAAC,MAEA,WAEAmB,KAAAsgC,iBAAA,CAAA,CACA,GAAA,CAAA1hC,IAAA,YAAAC,MAEA,SAAA0hC,GAEA,OAAAvgC,KAAAsgC,iBAAApgC,eAAAqgC,GAEAvgC,KAAAsgC,iBAAAC,GAIAA,CAEA,KAAAN,CAAA,CA7FA,GAgGA78B,EAAAD,QAAA88B,C5DotMA,EAAE,CAAC,6BAA6B,KAAK,GAAG,CAAC,SAASp8B,EAAQT,EAAOD,G6DvzMjEC,EAAAD,QATA,SAAA29B,EAAAxT,GAEA,IAAA2B,EAAA,iBAAA6R,EAAAA,EAAA,GAEA1sB,QAAA8a,IAAA,cAAAroB,OAAAooB,IAEA3B,GAAAlZ,QAAA8a,IAAAC,KAAArlB,UAAAwjB,GACA,C7D40MA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASzpB,EAAQT,EAAOD,G8Dx1MlC,IAAA68B,EAAAn8B,EAAA,8BAoBAk9B,EAAA,WAEA,SAAAA,EAAAb,EAAAC,GACA//B,iBAAAJ,KAAA+gC,GAEA/gC,KAAAogC,QAAA,mBAAAF,EAAAA,EAAAF,EACAhgC,KAAAqgC,SAAA,mBAAAF,EAAAA,EAAAH,CACA,CAmLA,OA5KAt/B,cAAAqgC,EAAA,CAAA,CAAAniC,IAAA,qBAAAC,MACA,SAAAkwB,EAAAiS,GAIA,GAAA,UAAAjgC,QAAAguB,GAAA,OAAA,EAEA,GAAA,iBAAAiS,EAAA,OAAA,EAGA,IAAA5L,EAAA4L,EAAA34B,QAAA,KAGA,IAAA,GAAA+sB,EACA,CAEA,IAAA6L,EAAAD,EAAA34B,QAAA,KACA64B,EAAAF,EAAA34B,QAAA,KAUA,GAAA44B,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,EAAA,EACA,CAEA,IAAAE,EAAAH,EAAApzB,UAAA,EAAAqzB,GAAA7rB,OAIA,GAAA,WAAArU,QAAAguB,EAAAoS,IAEA,OAAA,EAIA,IAAAC,EAAAJ,EAAApzB,UAAAqzB,EAAA,EAAAC,GAAA9rB,OAEAisB,EAAAhvB,SAAA+uB,EAAA,IAOA,OAAArjC,MAAAM,QAAA0wB,EAAAoS,KAAA7iB,MAAA+iB,KAOA/iB,MAAA+iB,IAIAD,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GAGArS,EAAAoS,GAAAjhC,eAAAkhC,IAKAC,KAAAtS,EAAAoS,GAEA,CAIA,OAAApS,EAAA7uB,eAAA8gC,EAEA,CAGA,IAAAO,EAAAP,EAAApzB,UAAA,EAAAwnB,GACAoM,EAAAR,EAAApzB,UAAAwnB,EAAA,GAIA6L,EAAAM,EAAAl5B,QAAA,KACA64B,EAAAK,EAAAl5B,QAAA,KAUA,GAAA44B,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,EAAA,EACA,CACA,IAAAE,EAAAI,EAAA3zB,UAAA,EAAAqzB,GAAA7rB,OAEAgsB,EAAAG,EAAA3zB,UAAAqzB,EAAA,EAAAC,GAAA9rB,OAEAisB,EAAAhvB,SAAA+uB,EAAA,IAgBA,OAAArjC,MAAAM,QAAA0wB,EAAAoS,KAAA7iB,MAAA+iB,KAUA/iB,MAAA+iB,IAGAD,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GAGAphC,KAAAyhC,mBAAA1S,EAAAoS,GAAAC,GAAAI,IAKAxhC,KAAAyhC,mBAAA1S,EAAAoS,GAAAE,GAAAG,GAEA,CAIA,QAAAzS,EAAA7uB,eAAAqhC,IAAA,WAAAxgC,QAAAguB,EAAAwS,OAIAxS,EAAA7uB,eAAAqhC,KAQAxS,EAAAwS,GAAA,CAAA,GALAvhC,KAAAyhC,mBAAA1S,EAAAwS,GAAAC,GASA,KAAAT,CAAA,CA1LA,GA6LA39B,EAAAD,QAAA49B,C9D61MA,EAAE,CAAC,6BAA6B,KAAK,GAAG,CAAC,SAASl9B,EAAQT,EAAOD,G+D9iNjE,IAAA68B,EAAAn8B,EAAA,8BACA69B,EAAA79B,EAAA,qCACA89B,EAAA99B,EAAA,2CAsBA+9B,EAAA,WAEA,SAAAA,EAAA1B,EAAAC,GACA//B,iBAAAJ,KAAA4hC,GAEA5hC,KAAAogC,QAAA,mBAAAF,EAAAA,EAAAF,EACAhgC,KAAAqgC,SAAA,mBAAAF,EAAAA,EAAAH,EAEAhgC,KAAAshC,oBAAAI,CACA,CA6TA,OA3TAhhC,cAAAkhC,EAAA,CAAA,CAAAhjC,IAAA,eAAAC,MACA,SAAAmiC,EAAAa,GAEA,OAAAF,EAAA3hC,KAAAghC,EAAAa,EACA,GAEA,CAAAjjC,IAAA,uBAAAC,MACA,SAAAkwB,EAAAiS,EAAAc,GAGA,GAAA,UAAA/gC,QAAAguB,IAEA,iBAAAiS,EAAA,CAEA,IAAAe,EAAA,GACA,iBAAAD,IAEAC,EAAAD,GAIA,IAAA1M,EAAA4L,EAAA34B,QAAA,KAGA,IAAA,GAAA+sB,EACA,CAEA,IAAA6L,EAAAD,EAAA34B,QAAA,KACA64B,EAAAF,EAAA34B,QAAA,KAIA25B,EAAAhB,EAAA34B,QAAA,MAWA,GAAA44B,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,EAAA,EACA,CAEA,IAAAE,EAAAH,EAAApzB,UAAA,EAAAqzB,GAAA7rB,OAIA,GAAA,WAAArU,QAAAguB,EAAAoS,IAEA,OAAA,EAIA,IAAAC,EAAAJ,EAAApzB,UAAAqzB,EAAA,EAAAC,GAAA9rB,OAEAisB,EAAAhvB,SAAA+uB,EAAA,IAOA,OAAArjC,MAAAM,QAAA0wB,EAAAoS,KAAA7iB,MAAA+iB,KAOA/iB,MAAA+iB,IAIAD,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,UAGArS,EAAAoS,GAAAC,IACA,WAIArS,EAAAoS,GAAAE,IACA,GAEA,CAGA,GAAAJ,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,GAAA,EACA,CACA,IAAAE,EAAAH,EAAApzB,UAAA,EAAAqzB,GAAA7rB,OAEA,IAAArX,MAAAM,QAAA0wB,EAAAoS,IAGA,OAAA,EAKA,IAFA,IAAAc,EAAAlT,EAAAoS,GAEA3iC,EAAAyjC,EAAA1jC,OAAA,EAAAC,GAAA,EAAAA,IACA,CAEAwB,KAAAkiC,aAAAlB,EAAAiB,EAAAzjC,KAIAyjC,EAAApF,OAAAr+B,EAAA,EAEA,CACA,OAAA,CACA,CAEA,GAAAwjC,EAAA,EACA,CACA,IAAAG,EAAAnB,EAAApzB,UAAA,EAAAo0B,GAAA5sB,OAEA,MAAA,UAAArU,QAAAguB,EAAAoT,aAMApT,EAAAoT,IACA,EACA,CAKA,cADApT,EAAAiS,IACA,CAEA,CAGA,IAAAO,EAAAP,EAAApzB,UAAA,EAAAwnB,GACAoM,EAAAR,EAAApzB,UAAAwnB,EAAA,GAKA6L,EAAAM,EAAAl5B,QAAA,KACA64B,EAAAK,EAAAl5B,QAAA,KAUA,GAAA44B,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,EAAA,EACA,CACA,IAAAE,EAAAI,EAAA3zB,UAAA,EAAAqzB,GAAA7rB,OAEAgsB,EAAAG,EAAA3zB,UAAAqzB,EAAA,EAAAC,GAAA9rB,OAEAisB,EAAAhvB,SAAA+uB,EAAA,IAgBA,OAAArjC,MAAAM,QAAA0wB,EAAAoS,KAAA7iB,MAAA+iB,KAKA,UAAAtgC,QAAAguB,EAAAoS,MASA7iB,MAAA+iB,IAGAD,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GAGAW,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAA06B,GAEAvhC,KAAAoiC,qBAAArT,EAAAoS,GAAAC,GAAAI,EAAAO,KAKAA,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAA06B,GAEAvhC,KAAAoiC,qBAAArT,EAAAoS,GAAAE,GAAAG,EAAAO,KAEA,CAGA,GAAAd,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,GAAA,EACA,CACA,IAAAE,EAAAH,EAAApzB,UAAA,EAAAqzB,GAAA7rB,OAEA,IAAArX,MAAAM,QAAA0wB,EAAAoS,IAGA,OAAA,EAIA,IAAAkB,EAAAtT,EAAAoS,GAEAY,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAAs6B,GAGA,IADA,IAAAmB,EAAA,CAAA,EACA9jC,EAAA,EAAAA,EAAA6jC,EAAA9jC,OAAAC,IACA,CACA,IAAA+jC,EAAA,GAAA17B,OAAAk7B,EAAA,KAAAl7B,OAAArI,EAAA,KACAq5B,EAAA73B,KAAAoiC,qBAAArT,EAAAoS,GAAA3iC,GAAAgjC,EAAAe,GAEAD,EAAA,GAAAz7B,OAAA07B,EAAA,KAAA17B,OAAA26B,IAAA3J,CACA,CAEA,OAAAyK,CACA,CAIA,IAAAN,EAAAhB,EAAA34B,QAAA,MACA,GAAA25B,EAAA,EACA,CACA,IAAAG,EAAAnB,EAAApzB,UAAA,EAAAo0B,GAAA5sB,OAEA,GAAA,UAAArU,QAAAguB,EAAAoT,IAGA,OAAA,EAIA,IAAAK,EAAAzT,EAAAoT,GACAM,EAAAjlC,OAAAwI,KAAAw8B,GAEAT,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAAs7B,GAGA,IADA,IAAAG,EAAA,CAAA,EACA9jC,EAAA,EAAAA,EAAAikC,EAAAlkC,OAAAC,IACA,CACA,IAAA+jC,EAAA,GAAA17B,OAAAk7B,EAAA,KAAAl7B,OAAA47B,EAAAjkC,IACAq5B,EAAA73B,KAAAoiC,qBAAArT,EAAAoT,GAAAM,EAAAjkC,IAAAgjC,EAAAe,GAGAviC,KAAAkiC,aAAAlB,EAAAnJ,KAGAyK,EAAA,GAAAz7B,OAAA07B,EAAA,KAAA17B,OAAA26B,IAAA3J,EAEA,CAEA,OAAAyK,CACA,CAIA,OAAAvT,EAAA7uB,eAAAqhC,IAAA,WAAAxgC,QAAAguB,EAAAwS,SAEA,EAEAxS,EAAA7uB,eAAAqhC,IAIAQ,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAA06B,GACAvhC,KAAAoiC,qBAAArT,EAAAwS,GAAAC,EAAAO,KAMAA,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAA06B,GACAxS,EAAAwS,GAAA,CAAA,EACAvhC,KAAAoiC,qBAAArT,EAAAwS,GAAAC,EAAAO,GA5SA,CA+SA,KAAAH,CAAA,CAtUA,GAyUAx+B,EAAAD,QAAAy+B,C/DmjNA,EAAE,CAAC,0CAA0C,GAAG,oCAAoC,GAAG,6BAA6B,KAAK,GAAG,CAAC,SAAS/9B,EAAQT,EAAOD,GgEp5NrJ,IAAA68B,EAAAn8B,EAAA,8BACA69B,EAAA79B,EAAA,qCACA89B,EAAA99B,EAAA,2CAsBA6+B,EAAA,WAEA,SAAAA,EAAAxC,EAAAC,GACA//B,iBAAAJ,KAAA0iC,GAEA1iC,KAAAogC,QAAA,mBAAAF,EAAAA,EAAAF,EACAhgC,KAAAqgC,SAAA,mBAAAF,EAAAA,EAAAH,EAEAhgC,KAAAshC,oBAAAI,CACA,CAqWA,OArWAhhC,cAAAgiC,EAAA,CAAA,CAAA9jC,IAAA,eAAAC,MAEA,SAAAmiC,EAAAa,GAEA,OAAAF,EAAA3hC,KAAAghC,EAAAa,EACA,GAEA,CAAAjjC,IAAA,oBAAAC,MACA,SAAAkwB,EAAAiS,EAAAc,EAAAa,GAGA,GAAA,UAAA5hC,QAAAguB,IAEA,iBAAAiS,EAAA,CAEA,IAAAe,EAAA,GACA,iBAAAD,IAEAC,EAAAD,GAIA,IAAAc,OAAA,IAAAD,EAAA5T,EAAA4T,EAGAvN,EAAA4L,EAAA34B,QAAA,KAGA,GAAA,GAAA+sB,EACA,CAQA,IALA,IAAAyN,EAAAd,EAAA5oB,MAAA,KAEA2pB,EAAA,EAGAtkC,EAAA,EAAAA,EAAAwiC,EAAAziC,QAEA,KAAAyiC,EAAA92B,OAAA1L,GAFAA,IAMAskC,IAGA,IAAAC,EAAAF,EAAAtkC,OAAAukC,EAEA,GAAAC,EAAA,EAKA,OAMA,IAAAC,EAAAhC,EAAApjC,MAAAklC,GAMA,OALAC,EAAA,IAEAC,EAAA,GAAAn8B,OAAAg8B,EAAAjlC,MAAA,EAAAmlC,GAAA56B,KAAA,KAAA,KAAAtB,OAAAm8B,IAEAhjC,KAAAogC,QAAA,yDAAAv5B,OAAAm8B,EAAA,MACAhjC,KAAAijC,kBAAAL,EAAAI,EAEA,CAGA,IAAA,GAAA5N,EACA,CAEA,IAAA6L,EAAAD,EAAA34B,QAAA,KACA64B,EAAAF,EAAA34B,QAAA,KAIA25B,EAAAhB,EAAA34B,QAAA,MAWA,GAAA44B,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,EAAA,EACA,CAEA,IAAAE,EAAAH,EAAApzB,UAAA,EAAAqzB,GAAA7rB,OAIA,GAAA,WAAArU,QAAAguB,EAAAoS,IAEA,OAIA,IAAAC,EAAAJ,EAAApzB,UAAAqzB,EAAA,EAAAC,GAAA9rB,OAEAisB,EAAAhvB,SAAA+uB,EAAA,IAOA,GAAArjC,MAAAM,QAAA0wB,EAAAoS,KAAA7iB,MAAA+iB,GAEA,OAKA,OAAA/iB,MAAA+iB,IAIAD,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GAGArS,EAAAoS,GAAAC,IAIArS,EAAAoS,GAAAE,EAEA,CAGA,GAAAJ,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,GAAA,EACA,CACA,IAAAE,EAAAH,EAAApzB,UAAA,EAAAqzB,GAAA7rB,OAEA,IAAArX,MAAAM,QAAA0wB,EAAAoS,IAGA,OAAA,EAKA,IAFA,IAAAc,EAAAlT,EAAAoS,GACA+B,EAAA,GACA1kC,EAAA,EAAAA,EAAAyjC,EAAA1jC,OAAAC,IACA,CAEAwB,KAAAkiC,aAAAlB,EAAAiB,EAAAzjC,KAGA0kC,EAAAx9B,KAAAu8B,EAAAzjC,GAEA,CAEA,OAAA0kC,CACA,CAEA,GAAAlB,EAAA,EACA,CACA,IAAAG,EAAAnB,EAAApzB,UAAA,EAAAo0B,GAAA5sB,OAEA,MAAA,UAAArU,QAAAguB,EAAAoT,KAMApT,EAAAoT,EACA,CAIA,OAAApT,EAAAiS,EAEA,CAGA,IAAAO,EAAAP,EAAApzB,UAAA,EAAAwnB,GACAoM,EAAAR,EAAApzB,UAAAwnB,EAAA,GAKA6L,EAAAM,EAAAl5B,QAAA,KACA64B,EAAAK,EAAAl5B,QAAA,KAUA,GAAA44B,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,EAAA,EACA,CACA,IAAAE,EAAAI,EAAA3zB,UAAA,EAAAqzB,GAAA7rB,OAEAgsB,EAAAG,EAAA3zB,UAAAqzB,EAAA,EAAAC,GAAA9rB,OAEAisB,EAAAhvB,SAAA+uB,EAAA,IAgBA,GAAArjC,MAAAM,QAAA0wB,EAAAoS,KAAA7iB,MAAA+iB,GAEA,OAGA,GAAA,UAAAtgC,QAAAguB,EAAAoS,IAEA,OAOA,OAAA7iB,MAAA+iB,IAGAD,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GAGAW,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAA06B,GAEAvhC,KAAAijC,kBAAAlU,EAAAoS,GAAAC,GAAAI,EAAAO,EAAAa,KAKAb,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAA06B,GAEAvhC,KAAAijC,kBAAAlU,EAAAoS,GAAAE,GAAAG,EAAAO,EAAAa,GAEA,CAGA,GAAA3B,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,GAAA,EACA,CACA,IAAAE,EAAAH,EAAApzB,UAAA,EAAAqzB,GAAA7rB,OAEA,IAAArX,MAAAM,QAAA0wB,EAAAoS,IAGA,OAAA,EAIA,IAAAkB,EAAAtT,EAAAoS,GAEAY,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAAs6B,GAGA,IADA,IAAAmB,EAAA,CAAA,EACA9jC,EAAA,EAAAA,EAAA6jC,EAAA9jC,OAAAC,IACA,CACA,IAAA+jC,EAAA,GAAA17B,OAAAk7B,EAAA,KAAAl7B,OAAArI,EAAA,KACAq5B,EAAA73B,KAAAijC,kBAAAlU,EAAAoS,GAAA3iC,GAAAgjC,EAAAe,EAAAK,GAEAN,EAAA,GAAAz7B,OAAA07B,EAAA,KAAA17B,OAAA26B,IAAA3J,CACA,CAEA,OAAAyK,CACA,CAIA,IAAAN,EAAAhB,EAAA34B,QAAA,MACA,GAAA25B,EAAA,EACA,CACA,IAAAG,EAAAnB,EAAApzB,UAAA,EAAAo0B,GAAA5sB,OAEA,GAAA,UAAArU,QAAAguB,EAAAoT,IAGA,OAAA,EAIA,IAAAK,EAAAzT,EAAAoT,GACAM,EAAAjlC,OAAAwI,KAAAw8B,GAEAT,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAAs7B,GAGA,IADA,IAAAG,EAAA,CAAA,EACA9jC,EAAA,EAAAA,EAAAikC,EAAAlkC,OAAAC,IACA,CACA,IAAA+jC,EAAA,GAAA17B,OAAAk7B,EAAA,KAAAl7B,OAAA47B,EAAAjkC,IACAq5B,EAAA73B,KAAAijC,kBAAAlU,EAAAoT,GAAAM,EAAAjkC,IAAAgjC,EAAAe,EAAAK,GAGA5iC,KAAAkiC,aAAAlB,EAAAnJ,KAGAyK,EAAA,GAAAz7B,OAAA07B,EAAA,KAAA17B,OAAA26B,IAAA3J,EAEA,CAEA,OAAAyK,CACA,CAIA,OAAAvT,EAAA7uB,eAAAqhC,IAAA,WAAAxgC,QAAAguB,EAAAwS,SAEA,EAEAxS,EAAA7uB,eAAAqhC,IAIAQ,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAA06B,GACAvhC,KAAAijC,kBAAAlU,EAAAwS,GAAAC,EAAAO,EAAAa,KAMAb,EAAA,GAAAl7B,OAAAk7B,GAAAl7B,OAAAk7B,EAAAxjC,OAAA,EAAA,IAAA,IAAAsI,OAAA06B,GACAxS,EAAAwS,GAAA,CAAA,EACAvhC,KAAAijC,kBAAAlU,EAAAwS,GAAAC,EAAAO,EAAAa,GArVA,CAwVA,KAAAF,CAAA,CA9WA,GAiXAt/B,EAAAD,QAAAu/B,ChEy5NA,EAAE,CAAC,0CAA0C,GAAG,oCAAoC,GAAG,6BAA6B,KAAK,GAAG,CAAC,SAAS7+B,EAAQT,EAAOD,GiElyOrJ,IAAA68B,EAAAn8B,EAAA,8BACA69B,EAAA79B,EAAA,qCAoBAs/B,EAAA,WAEA,SAAAA,EAAAjD,EAAAC,GACA//B,iBAAAJ,KAAAmjC,GAEAnjC,KAAAogC,QAAA,mBAAAF,EAAAA,EAAAF,EACAhgC,KAAAqgC,SAAA,mBAAAF,EAAAA,EAAAH,EAEAhgC,KAAAshC,oBAAAI,CACA,CA+KA,OA7KAhhC,cAAAyiC,EAAA,CAAA,CAAAvkC,IAAA,oBAAAC,MACA,SAAAkwB,EAAAiS,EAAAoC,GAGA,GAAA,UAAAriC,QAAAguB,GAAA,OAAA,EAEA,GAAA,iBAAAiS,EAAA,OAAA,EAEA,IAAA5L,EAAA4L,EAAA34B,QAAA,KAEA,IAAA,GAAA+sB,EACA,CAEA,IAAA6L,EAAAD,EAAA34B,QAAA,KACA64B,EAAAF,EAAA34B,QAAA,KAUA,GAAA44B,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,EAAA,EACA,CAEA,IAAAE,EAAAH,EAAApzB,UAAA,EAAAqzB,GAAA7rB,OAIA,GAAA,WAAArU,QAAAguB,EAAAoS,IAEA,OAAA,EAIA,IAAAC,EAAAJ,EAAApzB,UAAAqzB,EAAA,EAAAC,GAAA9rB,OAEAisB,EAAAhvB,SAAA+uB,EAAA,IAOA,OAAArjC,MAAAM,QAAA0wB,EAAAoS,KAAA7iB,MAAA+iB,KAOA/iB,MAAA+iB,IAIAD,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GAGArS,EAAAoS,GAAAC,GAAAgC,GACA,IAIArU,EAAAoS,GAAAE,GAAA+B,GACA,GAEA,CAKA,OADArU,EAAAiS,GAAAoC,GACA,CAEA,CAGA,IAAA7B,EAAAP,EAAApzB,UAAA,EAAAwnB,GACAoM,EAAAR,EAAApzB,UAAAwnB,EAAA,GAIA6L,EAAAM,EAAAl5B,QAAA,KACA64B,EAAAK,EAAAl5B,QAAA,KAUA,GAAA44B,EAAA,GAEAC,EAAAD,GAEAC,EAAAD,EAAA,EACA,CACA,IAAAE,EAAAI,EAAA3zB,UAAA,EAAAqzB,GAAA7rB,OAEAgsB,EAAAG,EAAA3zB,UAAAqzB,EAAA,EAAAC,GAAA9rB,OAEAisB,EAAAhvB,SAAA+uB,EAAA,IAgBA,OAAArjC,MAAAM,QAAA0wB,EAAAoS,KAAA7iB,MAAA+iB,KAQA/iB,MAAA+iB,IAGAD,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GACAA,EAAAphC,KAAAshC,oBAAA,IAAAF,GAGAphC,KAAAqjC,kBAAAtU,EAAAoS,GAAAC,GAAAI,EAAA4B,IAKApjC,KAAAqjC,kBAAAtU,EAAAoS,GAAAE,GAAAG,EAAA4B,GAEA,CAIA,OAAArU,EAAA7uB,eAAAqhC,IAAA,WAAAxgC,QAAAguB,EAAAwS,KAEAxS,EAAA7uB,eAAA,aACA6uB,EAAA,QAAA,CAAA,GAEAA,EAAA,QAAAiS,GAAAoC,GACA,IAEArU,EAAA7uB,eAAAqhC,KAQAxS,EAAAwS,GAAA,CAAA,GALAvhC,KAAAqjC,kBAAAtU,EAAAwS,GAAAC,EAAA4B,GASA,KAAAD,CAAA,CAxLA,GA2LA//B,EAAAD,QAAAggC,CjEuyOA,EAAE,CAAC,oCAAoC,GAAG,6BAA6B,KAAK,GAAG,CAAC,SAASt/B,EAAQT,EAAOD,GkEv/OxG,IAAA68B,EAAAn8B,EAAA,8BAwBAy/B,EAAA,WAEA,SAAAA,EAAApD,EAAAC,GACA//B,iBAAAJ,KAAAsjC,GAEAtjC,KAAAogC,QAAA,mBAAAF,EAAAA,EAAAF,EACAhgC,KAAAqgC,SAAA,mBAAAF,EAAAA,EAAAH,CACA,CA0FA,OAhFAt/B,cAAA4iC,EAAA,CAAA,CAAA1kC,IAAA,qBAAAC,MACA,SAAAkwB,EAAAwU,EAAAC,GAEA,IAAAC,EAAA,iBAAAF,EAAAA,EAAA,GACAG,EAAA,UAAA3iC,QAAAyiC,GAAAA,EAAA,CAAA,EAEAG,EAAA5iC,QAAAguB,GAEA6U,EACA,CACAC,QAAAJ,EACA/oB,KAAA+oB,EACAK,KAAAL,EAEAM,UAAA,GASA,OALA,UAAAJ,GAAA,MAAA5U,IAEA4U,EAAA,QAGAA,GAEA,IAAA,SACAC,EAAAI,SAAA,SACAJ,EAAAK,QAAAlV,EACA2U,EAAAD,GAAAG,EACA,MACA,IAAA,SACA,IAAA,SACAA,EAAAI,SAAA,SACAJ,EAAAK,QAAAlV,EACA2U,EAAAD,GAAAG,EACA,MACA,IAAA,YACA,IAAA,OACAA,EAAAI,SAAA,MACAJ,EAAAK,QAAAlV,EACA2U,EAAAD,GAAAG,EACA,MACA,IAAA,SACA,GAAA7lC,MAAAM,QAAA0wB,GACA,CACA6U,EAAAI,SAAA,QACA,IAAAP,IAEAC,EAAAD,GAAAG,GAGA,IAAA,IAAAplC,EAAA,EAAAA,EAAAuwB,EAAAxwB,OAAAC,IAEAwB,KAAAkkC,mBAAAnV,EAAAvwB,GAAA,GAAAqI,OAAA48B,EAAA,KAAA58B,OAAArI,EAAA,KAAAklC,EAEA,KAEA,CACAE,EAAAI,SAAA,SACA,IAAAP,IAEAC,EAAAD,GAAAG,EACAH,GAAA,KAKA,IAFA,IAAAU,EAAA3mC,OAAAwI,KAAA+oB,GAEAvwB,EAAA,EAAAA,EAAA2lC,EAAA5lC,OAAAC,IAEAwB,KAAAkkC,mBAAAnV,EAAAoV,EAAA3lC,IAAA,GAAAqI,OAAA48B,GAAA58B,OAAAs9B,EAAA3lC,IAAAklC,EAEA,EAQA,OAAAA,CACA,KAAAJ,CAAA,CAjGA,GAoGAlgC,EAAAD,QAAAmgC,ClE4/OA,EAAE,CAAC,6BAA6B,KAAK,GAAG,CAAC,SAASz/B,EAAQT,EAAOD,GmE7mPjE,IAAAihC,EAAA,OAEAC,EAAA,OAIAC,EAAA,SAAAC,EAAA1C,EAAA2C,EAAAC,EAAArB,GAEA,OAAAqB,GAEA,IAAA,KACA,OAAAF,EAAAtB,kBAAApB,EAAA2C,IAAApB,EAEA,IAAA,IACA,OAAAmB,EAAAtB,kBAAApB,EAAA2C,GAAApB,EAEA,IAAA,IACA,OAAAmB,EAAAtB,kBAAApB,EAAA2C,GAAApB,EAEA,IAAA,KACA,OAAAmB,EAAAtB,kBAAApB,EAAA2C,IAAApB,EAEA,IAAA,KACA,OAAAmB,EAAAtB,kBAAApB,EAAA2C,IAAApB,EAEA,IAAA,MACA,OAAAmB,EAAAtB,kBAAApB,EAAA2C,KAAApB,EAGA,QACA,OAAAmB,EAAAtB,kBAAApB,EAAA2C,IAAApB,EAGA,EA2CAhgC,EAAAD,QAzCA,SAAAohC,EAAAvD,EAAAa,GAeA,IAbA,IAAA6C,GAAA,EAWAC,EAAA3D,EAAA34B,QAAA+7B,IAEA,GAAAO,GACA,CACA,IAAAC,EAAA5D,EAAA34B,QAAAg8B,EAAAM,EAnDAP,GAqDA,IAAA,GAAAQ,EACA,CACA,IAAAC,EAAA7D,EAAApzB,UAAA+2B,EAvDAP,EAuDAQ,GAAAzrB,MAAA,KAEA2rB,EAAAD,EAAA,GACAE,EAAAF,EAAA,GACAG,EAAAH,EAAA,GAGAH,EAAAA,GAAAJ,EAAAC,EAAA1C,EAAAiD,EAAAC,EAAAC,GACAL,EAAA3D,EAAA34B,QAAA+7B,EAAAQ,EA7DAP,EA8DA,MAGAM,GAAA,CAGA,CAEA,OAAAD,CACA,CnE+nPA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS7gC,EAAQT,EAAOD,GoEptPlC,IAAA68B,EAAAn8B,EAAA,8BAOAohC,EAAA,WAEA,SAAAA,EAAA/E,EAAAC,GACA//B,iBAAAJ,KAAAilC,GAEAjlC,KAAAogC,QAAA,mBAAAF,EAAAA,EAAAF,EACAhgC,KAAAqgC,SAAA,mBAAAF,EAAAA,EAAAH,CACA,CAoHA,OAjGAt/B,cAAAukC,EAAA,CAAA,CAAArmC,IAAA,yBAAAC,MACA,SAAAqmC,EAAAC,GAEA,GAAA,UAAApkC,QAAAmkC,GAGA,OADAllC,KAAAqgC,SAAA,+EACA,EAGA,GAAA,UAAAt/B,QAAAokC,GAGA,OAAA,EAIA,IAAAC,EAAA5nC,OAAAwI,KAAAk/B,GACAG,EAAA,CAAA,EA6CA,OA5CAD,EAAArhB,SACA,SAAAid,GAEAkE,EAAAlE,GAAA9gC,eAAA,UAEAmlC,EAAAH,EAAAlE,GAAAtmB,MAAAsmB,EAEA,IAEAxjC,OAAAwI,KAAAm/B,GAEAphB,SACA,SAAAuhB,GAEA,IAAAC,EAAAJ,EAAAG,GACAE,GAAA,EACAC,GAAA,EAGAP,EAAAhlC,eAAAolC,GAEAE,EAAAF,EAEAD,EAAAnlC,eAAAolC,KAEAE,EAAAH,EAAAC,IAIAE,GAEAC,EAAAP,EAAAM,UACAN,EAAAM,IAKAC,EAAA,CAAA/qB,KAAA4qB,GAIAJ,EAAAK,GAAAE,CACA,KAEA,CACA,GAAA,CAAA7mC,IAAA,6BAAAC,MAEA,SAAAqmC,EAAAC,GAGA,IAAAO,EAAAvW,KAAAthB,MAAAshB,KAAArlB,UAAAo7B,IAEA,OADAllC,KAAA2lC,uBAAAD,EAAAP,GACAO,CACA,GAAA,CAAA9mC,IAAA,uBAAAC,MAEA,SAAA+mC,EAAAC,GAEA,GAAA,UAAA9kC,QAAA8kC,IAAA,UAAA9kC,QAAA6kC,GAGA,OADA5lC,KAAAqgC,SAAA,yEACA,EAGA,IAAAyF,EAAA3W,KAAAthB,MAAAshB,KAAArlB,UAAA+7B,IACAE,EAAA5W,KAAAthB,MAAAshB,KAAArlB,UAAA87B,IAcA,OAXApoC,OAAAwI,KAAA8/B,GAEA/hB,SACA,SAAAiiB,GAEAD,EAAA7lC,eAAA8lC,KAEAD,EAAAC,GAAAF,EAAAE,GAEA,IAEAD,CACA,KAAAd,CAAA,CA3HA,GA8HA7hC,EAAAD,QAAA8hC,CpEytPA,EAAE,CAAC,6BAA6B,KAAK,GAAG,CAAC,SAASphC,EAAQT,EAAOD,GqE91PjE,IAAAoW,EAAA1V,EAAA,6BAEAm8B,EAAAn8B,EAAA,8BAEAoiC,EAAApiC,EAAA,iCACAqiC,EAAAriC,EAAA,kDACAsiC,EAAAtiC,EAAA,wCACAuiC,EAAAviC,EAAA,wCACAwiC,EAAAxiC,EAAA,2CACAyiC,EAAAziC,EAAA,yCACA0iC,EAAA1iC,EAAA,oCAEA2iC,EAAA,CAAAC,MAAA,UAAAC,YAAA,CAAA,GAOAC,EAAA,SAAAC,GAAAplC,UAAAmlC,EAAAC,GAAA,IAAAC,EAAA7kC,aAAA2kC,GAEA,SAAAA,EAAA/sB,EAAAC,EAAAC,GACA,IAAAgtB,EA0DA,OA1DA1mC,iBAAAJ,KAAA2mC,IAGAG,OAFAzlC,IAAAuY,EAEAitB,EAAAlpC,KAAAqC,KAAA,CAAA,GAIA6mC,EAAAlpC,KAAAqC,KAAA4Z,EAAAC,EAAAC,IAGAE,YAAA,WAGA8sB,EAAA1G,QAAAJ,EACA8G,EAAAzG,SAAAL,EAGA8G,EAAAC,gCAAA,IAAAb,EAAAY,EAAA1G,QAAA0G,EAAAzG,UACAyG,EAAAE,sBAAA,IAAAb,EAAAW,EAAA1G,QAAA0G,EAAAzG,UACAyG,EAAAG,sBAAA,IAAAb,EAAAU,EAAA1G,QAAA0G,EAAAzG,UACAyG,EAAAI,yBAAA,IAAAb,EAAAS,EAAA1G,QAAA0G,EAAAzG,UAEAyG,EAAAnpB,QAAAzd,eAAA,mBAEA4mC,EAAAnpB,QAAAwpB,cACA,CACAnmC,OAAA,GACAO,OAAA,EACA6lC,MAAA,EACAC,QAAA,EACAvkC,SAAA,EACAwkC,OAAA,EACAC,SAAA,EACAxpC,MAAA,GACAP,OAAA,CAAA,EACAgqC,KAAA,OAGAV,EAAAnpB,QAAAzd,eAAA,YAEA4mC,EAAAnpB,QAAArQ,QAAA,GAGAw5B,EAAAW,WAAApmC,EACAylC,EAAAY,sBAAArmC,EACAylC,EAAAa,mBAAAtmC,EACAylC,EAAAc,wBAAAvmC,EAEAylC,EAAAe,QAEA,WAAA9mC,QAAA+lC,EAAAnpB,UAEAmpB,EAAAgB,aAAAhB,EAAAnpB,SAGAmpB,EAAAiB,oBAAA,IAAAxB,EAAAO,EAAA1G,QAAA0G,EAAAzG,UACAyG,EAAAkB,wBAAA,IAAA1B,EAAAQ,EAAA1G,QAAA0G,EAAAzG,UAEAyG,EAAAmB,iBAAA,IAAAhC,EAAAa,EAAA1G,QAAA0G,EAAAzG,UAAA79B,2BAAAskC,EACA,CAucA,OAjcApmC,cAAAimC,EAAA,CAAA,CAAA/nC,IAAA,QAAAC,MACA,WAEAmB,KAAAynC,MAAA,UACAznC,KAAA0nC,iBAAA,GACA1nC,KAAA2nC,cAAA,CAAA,EACA3nC,KAAA4nC,mBAAA,CAAA,CACA,GAAA,CAAAhpC,IAAA,QAAAC,MAEA,WAGA,IAAAqpC,EAAA/Y,KAAAthB,MAAAshB,KAAArlB,UAAA9J,KAAA2d,UAEAwqB,EAAA,IAAAxB,EAAA3mC,KAAAooC,cAAApoC,KAAAogC,QAAApgC,KAAAqgC,SAAA6H,GAKA,OAFAC,EAAAF,iBAAAI,eAAAroC,KAAAioC,iBAAA3H,kBAEA6H,CACA,GAEA,CAAAvpC,IAAA,cAAAC,MACA,SAAAypC,GAGA,OAAAtoC,KAAA8nC,aAAA3Y,KAAAthB,MAAAy6B,GACA,GAEA,CAAA1pC,IAAA,eAAAC,MACA,SAAAgb,GAEA,WAAA9Y,QAAA8Y,IAEA7Z,KAAAqgC,SAAA,IAAAx5B,OAAA7G,KAAAynC,MAAA,yEAAA5gC,OAAA9F,QAAA8Y,GAAA,MAOA,IAJA,IAAA0uB,EAAA,UAAAxnC,QAAA8Y,GAAAA,EAAA,CAAA,EAEA2uB,EAAAhrC,OAAAwI,KAAAwgC,GAEAhoC,EAAA,EAAAA,EAAAgqC,EAAAjqC,OAAAC,IAEA+pC,EAAAroC,eAAAsoC,EAAAhqC,MAEA+pC,EAAAC,EAAAhqC,IAAA2wB,KAAAthB,MAAAshB,KAAArlB,UAAA08B,EAAAgC,EAAAhqC,OAoBA,GAhBA+pC,EAAAroC,eAAA,SAEA,iBAAAqoC,EAAA9B,MAEAzmC,KAAAynC,MAAAc,EAAA9B,MAIAzmC,KAAAqgC,SAAA,IAAAx5B,OAAA7G,KAAAynC,MAAA,kFAAA5gC,OAAA9F,QAAAwnC,EAAA9B,OAAA,KAAA8B,GAKAvoC,KAAAqgC,SAAA,IAAAx5B,OAAA7G,KAAAynC,MAAA,2GAAAc,GAGAA,EAAAroC,eAAA,eAEA,GAAA,WAAAa,QAAAwnC,EAAA7B,aAGA,IADA,IAAA+B,EAAAjrC,OAAAwI,KAAAuiC,EAAA7B,aACAloC,EAAA,EAAAA,EAAAiqC,EAAAlqC,OAAAC,IAEAwB,KAAA0oC,cAAAD,EAAAjqC,GAAA+pC,EAAA7B,YAAA+B,EAAAjqC,UAKAwB,KAAAqgC,SAAA,IAAAx5B,OAAA7G,KAAAynC,MAAA,sIAAA5gC,OAAA9F,QAAAwnC,EAAA7B,aAAA,KAAA6B,QAKAvoC,KAAAqgC,SAAA,IAAAx5B,OAAA7G,KAAAynC,MAAA,uIAAAc,GAGA,GAAAA,EAAAroC,eAAA,qBAEA,WAAAa,QAAAwnC,EAAAI,kBAEA,IAAA,IAAAnqC,EAAA,EAAAA,EAAA+pC,EAAAI,iBAAApqC,OAAAC,KAMA,GAEA,CAAAI,IAAA,YAAAC,MACA,WAEA,OAAAswB,KAAArlB,UAAA9J,KAAAooC,cACA,GAAA,CAAAxpC,IAAA,cAAAC,MAEA,WAEA,MACA,CACA4nC,MAAAzmC,KAAAynC,MACAf,YAAAvX,KAAAthB,MAAAshB,KAAArlB,UAAA9J,KAAA4nC,qBACAe,iBAAAxZ,KAAAthB,MAAAshB,KAAArlB,UAAA9J,KAAAioC,iBAAA3H,mBAEA,GAEA,CAAA1hC,IAAA,gBAAAC,MACA,SAAAmiC,EAAA4H,GAEA,MAAA,WAAA7nC,QAAA6nC,IAGAA,EAAA1oC,eAAA,aAEA0oC,EAAA/E,QAAA7C,GAGAhhC,KAAA4nC,mBAAA1nC,eAAA8gC,IAEAhhC,KAAA0nC,iBAAAhiC,KAAAs7B,GAIAhhC,KAAA4nC,mBAAA5G,GAAA4H,EAGA5oC,KAAA2nC,cAAA3G,GAAAA,EAEA4H,EAAA1oC,eAAA,QAIAF,KAAA2nC,cAAAiB,EAAAluB,MAAAsmB,EAIA4H,EAAAluB,KAAAsmB,GAGA,IAIAhhC,KAAAqgC,SAAA,IAAAx5B,OAAA7G,KAAAynC,MAAA,mDAAA5gC,OAAAm6B,EAAA,uEAAAn6B,OAAA9F,QAAA6nC,GAAA,OACA,EAEA,GAAA,CAAAhqC,IAAA,sBAAAC,MAEA,SAAA0b,GAEA,OAAAva,KAAA6oC,cAAA7oC,KAAA8oC,mBAAAvuB,GACA,GAAA,CAAA3b,IAAA,gBAAAC,MAEA,SAAAmiC,GAEA,OAAAhhC,KAAA4nC,mBAAA5G,EACA,GAEA,CAAApiC,IAAA,iBAAAC,MACA,SAAA4d,GAGA,IADA,IAAAssB,EAAAvrC,OAAAwI,KAAAhG,KAAA4nC,oBACAppC,EAAA,EAAAA,EAAAuqC,EAAAxqC,OAAAC,IAEAie,EAAAzc,KAAA4nC,mBAAAmB,EAAAvqC,IAGA,GAKA,CAAAI,IAAA,2BAAAC,MACA,SAAAkwB,EAAAxU,GAEA,OAAAva,KAAAyhC,mBAAA1S,EAAA/uB,KAAA8oC,mBAAAvuB,GACA,GAEA,CAAA3b,IAAA,qBAAAC,MACA,SAAAkwB,EAAAiS,GAEA,OAAAhhC,KAAA+mC,gCAAAtF,mBAAA1S,EAAAiS,EACA,GAEA,CAAApiC,IAAA,qBAAAC,MACA,SAAA0b,GAEA,IAEAyuB,EAAAhpC,KAAA2nC,cAAAznC,eAAAqa,GACA0uB,EAAAjpC,KAAAioC,iBAAA3H,iBAAApgC,eAAAqa,GAwBA,OArBAyuB,IAAAC,EAEAjpC,KAAA2nC,cAAAptB,GAGA0uB,GAAAjpC,KAAA2nC,cAAAznC,eAAAF,KAAAioC,iBAAAiB,UAAA3uB,IAEAva,KAAA2nC,cAAA3nC,KAAAioC,iBAAAiB,UAAA3uB,IAGA0uB,EAEAjpC,KAAAioC,iBAAAiB,UAAA3uB,GAMAA,CAIA,GAEA,CAAA3b,IAAA,iBAAAC,MACA,SAAAkwB,EAAAxU,GAEA,IAAAsd,EAAA73B,KAAAijC,kBAAAlU,EAAA/uB,KAAA8oC,mBAAAvuB,IAQA,YANA,IAAAsd,IAGAA,EAAA73B,KAAAmpC,gBAAAnpC,KAAAopC,oBAAA7uB,KAGAsd,CACA,GAEA,CAAAj5B,IAAA,oBAAAC,MACA,SAAAkwB,EAAAiS,GAEA,IAAAnJ,EAAA73B,KAAAgnC,sBAAA/D,kBAAAlU,EAAAiS,GAQA,YANA,IAAAnJ,IAGAA,EAAA73B,KAAAmpC,gBAAAnpC,KAAA6oC,cAAA7H,KAGAnJ,CACA,GAEA,CAAAj5B,IAAA,iBAAAC,MACA,SAAAkwB,EAAAxU,EAAA6oB,GAEA,OAAApjC,KAAAqjC,kBAAAtU,EAAA/uB,KAAA8oC,mBAAAvuB,GAAA6oB,EACA,GAEA,CAAAxkC,IAAA,oBAAAC,MACA,SAAAkwB,EAAAiS,EAAAoC,GAEA,OAAApjC,KAAAinC,sBAAA5D,kBAAAtU,EAAAiS,EAAAoC,EACA,GAEA,CAAAxkC,IAAA,oBAAAC,MACA,SAAAkwB,EAAAxU,EAAA6oB,GAEA,OAAApjC,KAAAoiC,qBAAArT,EAAA/uB,KAAA8oC,mBAAAvuB,GAAA6oB,EACA,GAEA,CAAAxkC,IAAA,uBAAAC,MACA,SAAAkwB,EAAAiS,EAAAoC,GAEA,OAAApjC,KAAAknC,yBAAA9E,qBAAArT,EAAAiS,EAAAoC,EACA,GAEA,CAAAxkC,IAAA,WAAAC,MACA,SAAAkwB,GAEA,IAAAsa,EACA,CACArlC,MAAA,KACAslC,OAAA,GACAC,gBAAA,IAGA,WAAAxoC,QAAAguB,KAEAsa,EAAArlC,OAAA,EACAqlC,EAAAC,OAAA5jC,KAAA,iEAAAmB,OAAA9F,QAAAguB,MAUA,IAPA,IAAAya,EAAA,SAAAxI,EAAAyI,GAEAJ,EAAArlC,OAAA,EACAqlC,EAAAC,OAAA5jC,KAAA,uBAAAmB,OAAAm6B,EAAA,MAAAn6B,OAAA4iC,EAAA,KACA,EAGAjrC,EAAA,EAAAA,EAAAwB,KAAA0nC,iBAAAnpC,OAAAC,IACA,CACA,IAAAinC,EAAAzlC,KAAA6oC,cAAA7oC,KAAA0nC,iBAAAlpC,IACAkrC,EAAA1pC,KAAAyhC,mBAAA1S,EAAA0W,EAAA5B,SACAhM,EAAA73B,KAAAijC,kBAAAlU,EAAA0W,EAAA5B,SAcA,QAZA,IAAAhM,GAAA6R,IAIAL,EAAAE,gBAAA7jC,KAAA+/B,EAAA5B,UACA4B,EAAAkE,UAAA3pC,KAAA2d,QAAArQ,SAEAk8B,EAAA/D,EAAA5B,QAAA,qDAKA4B,EAAAzB,SACA,CACA,IAAA4F,EAAA7oC,QAAA82B,GACA,OAAA4N,EAAAzB,SAAAtmC,WAAA0X,OAAA1E,eAEA,IAAA,SACA,UAAAk5B,GAEAJ,EAAA/D,EAAA5B,QAAA,kBAAAh9B,OAAA4+B,EAAAzB,SAAA,wBAAAn9B,OAAA+iC,IAEA,MAEA,IAAA,SACA,UAAAA,GAEAJ,EAAA/D,EAAA5B,QAAA,kBAAAh9B,OAAA4+B,EAAAzB,SAAA,wBAAAn9B,OAAA+iC,IAEA,MAEA,IAAA,UACA,GAAA,UAAAA,EAEAJ,EAAA/D,EAAA5B,QAAA,kBAAAh9B,OAAA4+B,EAAAzB,SAAA,wBAAAn9B,OAAA+iC,SAIA/R,EAAAn6B,WACA2K,QAAA,MAAA,GAGAmhC,EAAA/D,EAAA5B,QAAA,kBAAAh9B,OAAA4+B,EAAAzB,SAAA,4CAGA,MAEA,IAAA,QACA,UAAA4F,GAEAJ,EAAA/D,EAAA5B,QAAA,kBAAAh9B,OAAA4+B,EAAAzB,SAAA,wBAAAn9B,OAAA+iC,IAEA,MAEA,IAAA,WAEA,gBADA,IAAA/uB,KAAAgd,GACAn6B,YAEA8rC,EAAA/D,EAAA5B,QAAA,kBAAAh9B,OAAA4+B,EAAAzB,SAAA,iDAGA,QAGA,UAAA4F,GAEAJ,EAAA/D,EAAA5B,QAAA,kBAAAh9B,OAAA4+B,EAAAzB,SAAA,qFAAAn9B,OAAA+iC,IAIA,CACA,CAEA,OAAAP,CACA,GAEA,CAAAzqC,IAAA,kBAAAC,MACA,SAAA+pC,GAEA,GAAA,UAAA7nC,QAAA6nC,GAAA,CAKA,GAAAA,EAAA1oC,eAAA,WAEA,OAAA0oC,EAAA3E,QAMA,IAAA4F,EAAAjB,EAAA1oC,eAAA,YAAA0oC,EAAA5E,SAAA,SACA,OAAAhkC,KAAA2d,QAAAwpB,cAAAjnC,eAAA2pC,GAEA7pC,KAAA2d,QAAAwpB,cAAA0C,GAKA,IAlBA,CAqBA,GAEA,CAAAjrC,IAAA,mBAAAC,MACA,SAAAkwB,EAAA+a,GAEA,OAAA9pC,KAAA+pC,eAAAhb,EAAA+a,GAEA,SAAAlB,GAEA,OAAAA,EAAA1oC,eAAA,UACA,GACA,GAGA,CAAAtB,IAAA,iBAAAC,MACA,SAAAkwB,EAAA+a,EAAAE,GACA,IAAAC,EAAAjqC,KAEAkqC,EAAA,WAAAnpC,QAAAguB,GAAAA,EAAA,CAAA,EAEAob,OAAA,IAAAL,GAAAA,EAGAM,EAAA,mBAAAJ,EAAAA,EAAA,SAAApB,GAAA,OAAA,CAAA,EAiBA,OAfA5oC,KAAA0nC,iBAAA3jB,SACA,SAAAid,GAEA,IAAAyE,EAAAwE,EAAApB,cAAA7H,GAEAoJ,EAAA3E,MAGA0E,GAAAF,EAAAxI,mBAAAyI,EAAAlJ,IAEAiJ,EAAA5G,kBAAA6G,EAAAlJ,EAAAiJ,EAAAd,gBAAA1D,IAGA,IAEAyE,CACA,KAAAvD,CAAA,CArgBA,CAAAptB,GAwgBAnW,EAAAD,QAAAwjC,CrEm2PA,EAAE,CAAC,gCAAgC,GAAG,6BAA6B,GAAG,iDAAiD,GAAG,0CAA0C,GAAG,uCAAuC,GAAG,uCAAuC,GAAG,wCAAwC,GAAG,mCAAmC,GAAG,4BAA4B,KAAK,GAAG,CAAC,SAAS9iC,EAAQT,EAAOD,GsEj4QzY,IAAAknC,EAAA,mBAAA3O,KAAAA,IAAAj+B,UACA6sC,EAAA9sC,OAAAqC,0BAAAwqC,EAAA7sC,OAAAqC,yBAAA67B,IAAAj+B,UAAA,QAAA,KACA8sC,EAAAF,GAAAC,GAAA,mBAAAA,EAAAjrC,IAAAirC,EAAAjrC,IAAA,KACAmrC,EAAAH,GAAA3O,IAAAj+B,UAAAsmB,QACA0mB,EAAA,mBAAA5O,KAAAA,IAAAp+B,UACAitC,EAAAltC,OAAAqC,0BAAA4qC,EAAAjtC,OAAAqC,yBAAAg8B,IAAAp+B,UAAA,QAAA,KACAktC,EAAAF,GAAAC,GAAA,mBAAAA,EAAArrC,IAAAqrC,EAAArrC,IAAA,KACAurC,EAAAH,GAAA5O,IAAAp+B,UAAAsmB,QAEA8mB,EADA,mBAAA1O,SAAAA,QAAA1+B,UACA0+B,QAAA1+B,UAAAygC,IAAA,KAEA4M,EADA,mBAAAzO,SAAAA,QAAA5+B,UACA4+B,QAAA5+B,UAAAygC,IAAA,KAEA6M,EADA,mBAAA3O,SAAAA,QAAA3+B,UACA2+B,QAAA3+B,UAAAutC,MAAA,KACAC,EAAAnoC,QAAArF,UAAAsF,QACAmoC,EAAA1tC,OAAAC,UAAAC,SACAytC,EAAAhjB,SAAA1qB,UAAAC,SACA0tC,EAAApqC,OAAAvD,UAAA0jB,MACAkqB,EAAArqC,OAAAvD,UAAAG,MACAk/B,EAAA97B,OAAAvD,UAAAiQ,QACA49B,EAAAtqC,OAAAvD,UAAA8tC,YACAC,EAAAxqC,OAAAvD,UAAAiT,YACA+6B,EAAA7P,OAAAn+B,UAAAQ,KACA0+B,EAAA5+B,MAAAN,UAAAoJ,OACA6kC,EAAA3tC,MAAAN,UAAA0K,KACAwjC,EAAA5tC,MAAAN,UAAAG,MACAguC,EAAAxlC,KAAAmY,MACAstB,EAAA,mBAAAjR,OAAAA,OAAAn9B,UAAAsF,QAAA,KACA+oC,EAAAtuC,OAAA6qB,sBACA0jB,EAAA,mBAAA5tC,QAAA,WAAA4C,QAAA5C,OAAAC,UAAAD,OAAAV,UAAAC,SAAA,KACAsuC,EAAA,mBAAA7tC,QAAA,WAAA4C,QAAA5C,OAAAC,UAEA6tC,EAAA,mBAAA9tC,QAAAA,OAAA8tC,cAAAlrC,QAAA5C,OAAA8tC,eAAAD,GAAA,UACA7tC,OAAA8tC,YACA,KACAC,EAAA1uC,OAAAC,UAAAghC,qBAEA0N,GAAA,mBAAA/sC,QAAAA,QAAA6D,eAAAzF,OAAAyF,kBACA,GAAAlB,YAAAhE,MAAAN,UACA,SAAAijB,GACA,OAAAA,EAAA3e,SACA,EACA,MAGA,SAAAqqC,EAAA5jC,EAAAkK,GACA,GACAlK,IAAAyQ,KACAzQ,KAAAyQ,KACAzQ,GAAAA,GACAA,GAAAA,GAAA,KAAAA,EAAA,KACAijC,EAAA9tC,KAAA,IAAA+U,GAEA,OAAAA,EAEA,IAAA25B,EAAA,mCACA,GAAA,iBAAA7jC,EAAA,CACA,IAAA8jC,EAAA9jC,EAAA,GAAAojC,GAAApjC,GAAAojC,EAAApjC,GACA,GAAA8jC,IAAA9jC,EAAA,CACA,IAAA+jC,EAAAvrC,OAAAsrC,GACA1uB,EAAAytB,EAAA1tC,KAAA+U,EAAA65B,EAAAhuC,OAAA,GACA,OAAAu+B,EAAAn/B,KAAA4uC,EAAAF,EAAA,OAAA,IAAAvP,EAAAn/B,KAAAm/B,EAAAn/B,KAAAigB,EAAA,cAAA,OAAA,KAAA,GACA,CACA,CACA,OAAAkf,EAAAn/B,KAAA+U,EAAA25B,EAAA,MACA,CAEA,IAAAG,EAAA3oC,EAAA,kBACA4oC,EAAAD,EAAAE,OACAC,EAAAC,EAAAH,GAAAA,EAAA,KA4LA,SAAAI,EAAA5iC,EAAA6iC,EAAAC,GACA,IAAAC,EAAA,YAAAD,EAAAE,YAAAH,GAAA,IAAA,IACA,OAAAE,EAAA/iC,EAAA+iC,CACA,CAEA,SAAAtP,EAAAzzB,GACA,OAAA6yB,EAAAn/B,KAAAqD,OAAAiJ,GAAA,KAAA,SACA,CAEA,SAAA5L,EAAAM,GAAA,QAAA,mBAAAy6B,EAAAz6B,IAAAstC,GAAA,WAAAlrC,QAAApC,IAAAstC,KAAAttC,EAAA,CAEA,SAAAuuC,EAAAvuC,GAAA,QAAA,oBAAAy6B,EAAAz6B,IAAAstC,GAAA,WAAAlrC,QAAApC,IAAAstC,KAAAttC,EAAA,CAOA,SAAAiuC,EAAAjuC,GACA,GAAAqtC,EACA,OAAArtC,GAAA,WAAAoC,QAAApC,IAAAA,aAAAR,OAEA,GAAA,WAAA4C,QAAApC,GACA,OAAA,EAEA,IAAAA,GAAA,WAAAoC,QAAApC,KAAAotC,EACA,OAAA,EAEA,IAEA,OADAA,EAAApuC,KAAAgB,IACA,CACA,CAAA,MAAAqE,GAAA,CACA,OAAA,CACA,CA3NAI,EAAAD,QAAA,SAAAgqC,EAAAxuC,EAAAgf,EAAAyvB,EAAAC,GACA,IAAAN,EAAApvB,GAAA,CAAA,EAEA,GAAAugB,EAAA6O,EAAA,eAAA,WAAAA,EAAAE,YAAA,WAAAF,EAAAE,WACA,MAAA,IAAA9vC,UAAA,oDAEA,GACA+gC,EAAA6O,EAAA,qBAAA,iBAAAA,EAAAO,gBACAP,EAAAO,gBAAA,GAAAP,EAAAO,kBAAAr0B,IACA,OAAA8zB,EAAAO,iBAGA,MAAA,IAAAnwC,UAAA,0FAEA,IAAAowC,GAAArP,EAAA6O,EAAA,kBAAAA,EAAAQ,cACA,GAAA,kBAAAA,GAAA,WAAAA,EACA,MAAA,IAAApwC,UAAA,iFAGA,GACA+gC,EAAA6O,EAAA,WACA,OAAAA,EAAAS,QACA,OAAAT,EAAAS,UACAn7B,SAAA06B,EAAAS,OAAA,MAAAT,EAAAS,QAAAT,EAAAS,OAAA,GAEA,MAAA,IAAArwC,UAAA,4DAEA,GAAA+gC,EAAA6O,EAAA,qBAAA,kBAAAA,EAAAU,iBACA,MAAA,IAAAtwC,UAAA,qEAEA,IAAAswC,EAAAV,EAAAU,iBAEA,QAAA,IAAA9uC,EACA,MAAA,YAEA,GAAA,OAAAA,EACA,MAAA,OAEA,GAAA,kBAAAA,EACA,OAAAA,EAAA,OAAA,QAGA,GAAA,iBAAAA,EACA,OAAA+uC,EAAA/uC,EAAAouC,GAEA,GAAA,iBAAApuC,EAAA,CACA,GAAA,IAAAA,EACA,OAAAsa,IAAAta,EAAA,EAAA,IAAA,KAEA,IAAA+T,EAAA1R,OAAArC,GACA,OAAA8uC,EAAArB,EAAAztC,EAAA+T,GAAAA,CACA,CACA,GAAA,iBAAA/T,EAAA,CACA,IAAAgvC,EAAA3sC,OAAArC,GAAA,IACA,OAAA8uC,EAAArB,EAAAztC,EAAAgvC,GAAAA,CACA,CAEA,IAAAC,OAAA,IAAAb,EAAAK,MAAA,EAAAL,EAAAK,MAEA,QADA,IAAAA,IAAAA,EAAA,GACAA,GAAAQ,GAAAA,EAAA,GAAA,WAAA7sC,QAAApC,GACA,OAAAN,EAAAM,GAAA,UAAA,WAGA,IAAA6uC,EAkUA,SAAAT,EAAAK,GACA,IAAAS,EACA,GAAA,OAAAd,EAAAS,OACAK,EAAA,SACA,MAAA,iBAAAd,EAAAS,QAAAT,EAAAS,OAAA,GAGA,OAAA,KAFAK,EAAAnC,EAAA/tC,KAAAI,MAAAgvC,EAAAS,OAAA,GAAA,IAGA,CACA,MAAA,CACA9tC,KAAAmuC,EACAC,KAAApC,EAAA/tC,KAAAI,MAAAqvC,EAAA,GAAAS,GAEA,CA/UAE,CAAAhB,EAAAK,GAEA,QAAA,IAAAC,EACAA,EAAA,QACA,GAAAhlC,EAAAglC,EAAA1uC,IAAA,EACA,MAAA,aAGA,SAAAwW,EAAAtW,EAAAb,EAAAgwC,GAKA,GAJAhwC,IACAqvC,EAAA1B,EAAAhuC,KAAA0vC,IACA3nC,KAAA1H,GAEAgwC,EAAA,CACA,IAAAC,EAAA,CACAb,MAAAL,EAAAK,OAKA,OAHAlP,EAAA6O,EAAA,gBACAkB,EAAAhB,WAAAF,EAAAE,YAEAE,EAAAtuC,EAAAovC,EAAAb,EAAA,EAAAC,EACA,CACA,OAAAF,EAAAtuC,EAAAkuC,EAAAK,EAAA,EAAAC,EACA,CAEA,GAAA,mBAAA1uC,IAAAuuC,EAAAvuC,GAAA,CACA,IAAAb,EAwJA,SAAAoF,GACA,GAAAA,EAAApF,KAAA,OAAAoF,EAAApF,KACA,IAAAqT,EAAAi6B,EAAAztC,KAAAwtC,EAAAxtC,KAAAuF,GAAA,wBACA,GAAAiO,EAAA,OAAAA,EAAA,GACA,OAAA,IACA,CA7JA+8B,CAAAvvC,GACAqH,EAAAmoC,EAAAxvC,EAAAwW,GACA,MAAA,aAAArX,EAAA,KAAAA,EAAA,gBAAA,KAAAkI,EAAAzH,OAAA,EAAA,MAAAmtC,EAAA/tC,KAAAqI,EAAA,MAAA,KAAA,GACA,CACA,GAAA4mC,EAAAjuC,GAAA,CACA,IAAAyvC,GAAApC,EAAAlP,EAAAn/B,KAAAqD,OAAArC,GAAA,yBAAA,MAAAotC,EAAApuC,KAAAgB,GACA,MAAA,WAAAoC,QAAApC,IAAAqtC,EAAAoC,GAAAC,EAAAD,GACA,CACA,GA0OA,SAAA7kC,GACA,IAAAA,GAAA,WAAAxI,QAAAwI,GAAA,OAAA,EACA,GAAA,oBAAA+kC,aAAA/kC,aAAA+kC,YACA,OAAA,EAEA,MAAA,iBAAA/kC,EAAAglC,UAAA,mBAAAhlC,EAAAilC,YACA,CAhPAC,CAAA9vC,GAAA,CAGA,IAFA,IAAAsL,GAAA,IAAAuhC,EAAA7tC,KAAAqD,OAAArC,EAAA4vC,WACAG,GAAA/vC,EAAAgwC,YAAA,GACAnwC,GAAA,EAAAA,GAAAkwC,GAAAnwC,OAAAC,KACAyL,IAAA,IAAAykC,GAAAlwC,IAAAV,KAAA,IAAA+uC,EAAAnP,EAAAgR,GAAAlwC,IAAAK,OAAA,SAAAkuC,GAKA,OAHA9iC,IAAA,IACAtL,EAAAiwC,YAAAjwC,EAAAiwC,WAAArwC,SAAA0L,IAAA,OACAA,IAAA,KAAAuhC,EAAA7tC,KAAAqD,OAAArC,EAAA4vC,WAAA,GAEA,CACA,GAAAlwC,EAAAM,GAAA,CACA,GAAA,IAAAA,EAAAJ,OAAA,MAAA,KACA,IAAAswC,GAAAV,EAAAxvC,EAAAwW,GACA,OAAAq4B,IAyQA,SAAAqB,GACA,IAAA,IAAArwC,EAAA,EAAAA,EAAAqwC,EAAAtwC,OAAAC,IACA,GAAA6J,EAAAwmC,EAAArwC,GAAA,OAAA,EACA,OAAA,EAGA,OAAA,CACA,CAhRAswC,CAAAD,IACA,IAAAE,EAAAF,GAAArB,GAAA,IAEA,KAAA9B,EAAA/tC,KAAAkxC,GAAA,MAAA,IACA,CACA,GAkFA,SAAAlwC,GAAA,QAAA,mBAAAy6B,EAAAz6B,IAAAstC,GAAA,WAAAlrC,QAAApC,IAAAstC,KAAAttC,EAAA,CAlFAqwC,CAAArwC,GAAA,CACA,IAAAmJ,GAAAqmC,EAAAxvC,EAAAwW,GACA,MAAA,UAAAnR,MAAAvG,aAAA,UAAAkB,IAAAutC,EAAAvuC,KAAAgB,EAAA,SAGA,IAAAmJ,GAAAvJ,OAAA,IAAAyC,OAAArC,GAAA,IACA,MAAAqC,OAAArC,GAAA,KAAA+sC,EAAA/tC,KAAAmK,GAAA,MAAA,KAHA,MAAA9G,OAAArC,GAAA,KAAA+sC,EAAA/tC,KAAAg/B,EAAAh/B,KAAA,YAAAwX,EAAAxW,EAAAswC,OAAAnnC,IAAA,MAAA,IAIA,CACA,GAAA,WAAA/G,QAAApC,IAAA4uC,EAAA,CACA,GAAAZ,GAAA,mBAAAhuC,EAAAguC,IAAAH,EACA,OAAAA,EAAA7tC,EAAA,CAAAyuC,MAAAQ,EAAAR,IACA,GAAA,WAAAG,GAAA,mBAAA5uC,EAAAwW,QACA,OAAAxW,EAAAwW,SAEA,CACA,GA6HA,SAAA5L,GACA,IAAAghC,IAAAhhC,GAAA,WAAAxI,QAAAwI,GACA,OAAA,EAEA,IACAghC,EAAA5sC,KAAA4L,GACA,IACAohC,EAAAhtC,KAAA4L,EACA,CAAA,MAAAU,GACA,OAAA,CACA,CACA,OAAAV,aAAAmyB,GACA,CAAA,MAAA14B,GAAA,CACA,OAAA,CACA,CA3IAksC,CAAAvwC,GAAA,CACA,IAAAwwC,GAAA,GAMA,OALA3E,GACAA,EAAA7sC,KAAAgB,GAAA,SAAAE,EAAAD,GACAuwC,GAAAzpC,KAAAyP,EAAAvW,EAAAD,GAAA,GAAA,OAAAwW,EAAAtW,EAAAF,GACA,IAEAywC,EAAA,MAAA7E,EAAA5sC,KAAAgB,GAAAwwC,GAAA3B,EACA,CACA,GA+JA,SAAAjkC,GACA,IAAAohC,IAAAphC,GAAA,WAAAxI,QAAAwI,GACA,OAAA,EAEA,IACAohC,EAAAhtC,KAAA4L,GACA,IACAghC,EAAA5sC,KAAA4L,EACA,CAAA,MAAA4H,GACA,OAAA,CACA,CACA,OAAA5H,aAAAsyB,GACA,CAAA,MAAA74B,GAAA,CACA,OAAA,CACA,CA7KAqsC,CAAA1wC,GAAA,CACA,IAAA2wC,GAAA,GAMA,OALA1E,GACAA,EAAAjtC,KAAAgB,GAAA,SAAAE,GACAywC,GAAA5pC,KAAAyP,EAAAtW,EAAAF,GACA,IAEAywC,EAAA,MAAAzE,EAAAhtC,KAAAgB,GAAA2wC,GAAA9B,EACA,CACA,GA2HA,SAAAjkC,GACA,IAAAshC,IAAAthC,GAAA,WAAAxI,QAAAwI,GACA,OAAA,EAEA,IACAshC,EAAAltC,KAAA4L,EAAAshC,GACA,IACAC,EAAAntC,KAAA4L,EAAAuhC,EACA,CAAA,MAAA7gC,GACA,OAAA,CACA,CACA,OAAAV,aAAA4yB,OACA,CAAA,MAAAn5B,GAAA,CACA,OAAA,CACA,CAzIAusC,CAAA5wC,GACA,OAAA6wC,EAAA,WAEA,GAmKA,SAAAjmC,GACA,IAAAuhC,IAAAvhC,GAAA,WAAAxI,QAAAwI,GACA,OAAA,EAEA,IACAuhC,EAAAntC,KAAA4L,EAAAuhC,GACA,IACAD,EAAAltC,KAAA4L,EAAAshC,EACA,CAAA,MAAA5gC,GACA,OAAA,CACA,CACA,OAAAV,aAAA8yB,OACA,CAAA,MAAAr5B,GAAA,CACA,OAAA,CACA,CAjLAysC,CAAA9wC,GACA,OAAA6wC,EAAA,WAEA,GAqIA,SAAAjmC,GACA,IAAAwhC,IAAAxhC,GAAA,WAAAxI,QAAAwI,GACA,OAAA,EAEA,IAEA,OADAwhC,EAAAptC,KAAA4L,IACA,CACA,CAAA,MAAAvG,GAAA,CACA,OAAA,CACA,CA9IA0sC,CAAA/wC,GACA,OAAA6wC,EAAA,WAEA,GA0CA,SAAA7wC,GAAA,QAAA,oBAAAy6B,EAAAz6B,IAAAstC,GAAA,WAAAlrC,QAAApC,IAAAstC,KAAAttC,EAAA,CA1CAgxC,CAAAhxC,GACA,OAAA0vC,EAAAl5B,EAAA5T,OAAA5C,KAEA,GA4DA,SAAAA,GACA,IAAAA,GAAA,WAAAoC,QAAApC,KAAAktC,EACA,OAAA,EAEA,IAEA,OADAA,EAAAluC,KAAAgB,IACA,CACA,CAAA,MAAAqE,GAAA,CACA,OAAA,CACA,CArEA4sC,CAAAjxC,GACA,OAAA0vC,EAAAl5B,EAAA02B,EAAAluC,KAAAgB,KAEA,GAqCA,SAAAA,GAAA,QAAA,qBAAAy6B,EAAAz6B,IAAAstC,GAAA,WAAAlrC,QAAApC,IAAAstC,KAAAttC,EAAA,CArCAkxC,CAAAlxC,GACA,OAAA0vC,EAAApD,EAAAttC,KAAAgB,IAEA,GAgCA,SAAAA,GAAA,QAAA,oBAAAy6B,EAAAz6B,IAAAstC,GAAA,WAAAlrC,QAAApC,IAAAstC,KAAAttC,EAAA,CAhCAmxC,CAAAnxC,GACA,OAAA0vC,EAAAl5B,EAAAnU,OAAArC,KAEA,IA0BA,SAAAA,GAAA,QAAA,kBAAAy6B,EAAAz6B,IAAAstC,GAAA,WAAAlrC,QAAApC,IAAAstC,KAAAttC,EAAA,CA1BAigB,CAAAjgB,KAAAuuC,EAAAvuC,GAAA,CACA,IAAAoxC,GAAA5B,EAAAxvC,EAAAwW,GACA66B,GAAA7D,EAAAA,EAAAxtC,KAAAnB,OAAAC,UAAAkB,aAAAnB,QAAAmB,EAAAd,cAAAL,OACAyyC,GAAAtxC,aAAAnB,OAAA,GAAA,iBACA0yC,IAAAF,IAAA/D,GAAAzuC,OAAAmB,KAAAA,GAAAstC,KAAAttC,EAAA0sC,EAAA1tC,KAAAy7B,EAAAz6B,GAAA,GAAA,GAAAsxC,GAAA,SAAA,GAEAE,IADAH,IAAA,mBAAArxC,EAAAd,YAAA,GAAAc,EAAAd,YAAAC,KAAAa,EAAAd,YAAAC,KAAA,IAAA,KACAoyC,IAAAD,GAAA,IAAAvE,EAAA/tC,KAAAg/B,EAAAh/B,KAAA,GAAAuyC,IAAA,GAAAD,IAAA,IAAA,MAAA,KAAA,IACA,OAAA,IAAAF,GAAAxxC,OAAA4xC,GAAA,KACA3C,EACA2C,GAAA,IAAApB,EAAAgB,GAAAvC,GAAA,IAEA2C,GAAA,KAAAzE,EAAA/tC,KAAAoyC,GAAA,MAAA,IACA,CACA,OAAA/uC,OAAArC,EACA,EAgDA,IAAA+9B,EAAAl/B,OAAAC,UAAAyC,gBAAA,SAAAtB,GAAA,OAAAA,KAAAoB,IAAA,EACA,SAAAk+B,EAAAv/B,EAAAC,GACA,OAAA89B,EAAA/+B,KAAAgB,EAAAC,EACA,CAEA,SAAAw6B,EAAAz6B,GACA,OAAAusC,EAAAvtC,KAAAgB,EACA,CASA,SAAA0J,EAAAwmC,EAAAtlC,GACA,GAAAslC,EAAAxmC,QAAA,OAAAwmC,EAAAxmC,QAAAkB,GACA,IAAA,IAAA/K,EAAA,EAAAiM,EAAAokC,EAAAtwC,OAAAC,EAAAiM,EAAAjM,IACA,GAAAqwC,EAAArwC,KAAA+K,EAAA,OAAA/K,EAEA,OAAA,CACA,CAqFA,SAAAkvC,EAAAh7B,EAAAq6B,GACA,GAAAr6B,EAAAnU,OAAAwuC,EAAAO,gBAAA,CACA,IAAAp7B,EAAAQ,EAAAnU,OAAAwuC,EAAAO,gBACA8C,EAAA,OAAAl+B,EAAA,mBAAAA,EAAA,EAAA,IAAA,IACA,OAAAw7B,EAAArC,EAAA1tC,KAAA+U,EAAA,EAAAq6B,EAAAO,iBAAAP,GAAAqD,CACA,CAGA,OAAAvD,EADA/P,EAAAn/B,KAAAm/B,EAAAn/B,KAAA+U,EAAA,WAAA,QAAA,eAAA29B,GACA,SAAAtD,EACA,CAEA,SAAAsD,EAAAzsC,GACA,IAAArG,EAAAqG,EAAA8D,WAAA,GACA6B,EAAA,CACA,EAAA,IACA,EAAA,IACA,GAAA,IACA,GAAA,IACA,GAAA,KACAhM,GACA,OAAAgM,EAAA,KAAAA,EACA,OAAAhM,EAAA,GAAA,IAAA,IAAA+tC,EAAA3tC,KAAAJ,EAAAG,SAAA,IACA,CAEA,SAAA2wC,EAAA37B,GACA,MAAA,UAAAA,EAAA,GACA,CAEA,SAAA88B,EAAAv/B,GACA,OAAAA,EAAA,QACA,CAEA,SAAAm/B,EAAAn/B,EAAAI,EAAAigC,EAAA9C,GAEA,OAAAv9B,EAAA,KAAAI,EAAA,OADAm9B,EAAAuB,EAAAuB,EAAA9C,GAAA9B,EAAA/tC,KAAA2yC,EAAA,OACA,GACA,CA0BA,SAAAvB,EAAAF,EAAArB,GACA,GAAA,IAAAqB,EAAAtwC,OAAA,MAAA,GACA,IAAAgyC,EAAA,KAAA/C,EAAAM,KAAAN,EAAA9tC,KACA,OAAA6wC,EAAA7E,EAAA/tC,KAAAkxC,EAAA,IAAA0B,GAAA,KAAA/C,EAAAM,IACA,CAEA,SAAAK,EAAAxvC,EAAAwW,GACA,IAAAq7B,EAAAnyC,EAAAM,GACAkwC,EAAA,GACA,GAAA2B,EAAA,CACA3B,EAAAtwC,OAAAI,EAAAJ,OACA,IAAA,IAAAC,EAAA,EAAAA,EAAAG,EAAAJ,OAAAC,IACAqwC,EAAArwC,GAAA0/B,EAAAv/B,EAAAH,GAAA2W,EAAAxW,EAAAH,GAAAG,GAAA,EAEA,CACA,IACA8xC,EADAjS,EAAA,mBAAAsN,EAAAA,EAAAntC,GAAA,GAEA,GAAAqtC,EAAA,CACAyE,EAAA,CAAA,EACA,IAAA,IAAAxqC,EAAA,EAAAA,EAAAu4B,EAAAjgC,OAAA0H,IACAwqC,EAAA,IAAAjS,EAAAv4B,IAAAu4B,EAAAv4B,EAEA,CAEA,IAAA,IAAArH,KAAAD,EACAu/B,EAAAv/B,EAAAC,KACA4xC,GAAAxvC,OAAAO,OAAA3C,MAAAA,GAAAA,EAAAD,EAAAJ,QACAytC,GAAAyE,EAAA,IAAA7xC,aAAAT,SAGAstC,EAAA9tC,KAAA,SAAAiB,GACAiwC,EAAAnpC,KAAAyP,EAAAvW,EAAAD,GAAA,KAAAwW,EAAAxW,EAAAC,GAAAD,IAEAkwC,EAAAnpC,KAAA9G,EAAA,KAAAuW,EAAAxW,EAAAC,GAAAD,MAGA,GAAA,mBAAAmtC,EACA,IAAA,IAAAthC,EAAA,EAAAA,EAAAg0B,EAAAjgC,OAAAiM,IACA0hC,EAAAvuC,KAAAgB,EAAA6/B,EAAAh0B,KACAqkC,EAAAnpC,KAAA,IAAAyP,EAAAqpB,EAAAh0B,IAAA,MAAA2K,EAAAxW,EAAA6/B,EAAAh0B,IAAA7L,IAIA,OAAAkwC,CACA,CtEo4QA,EAAE,CAAC,iBAAiB,KAAK,GAAG,CAAC,SAAShrC,EAAQT,EAAOD,GuEv4RrD,IAAAutC,EAAA7sC,EAAA,UAoBA,SAAAc,EAAAF,GACA,IAAAvB,EAAA,SAAAA,IACA,OAAAA,EAAAytC,OAAAztC,EAAArE,OACAqE,EAAAytC,QAAA,EACAztC,EAAArE,MAAA4F,EAAA1E,MAAAC,KAAAF,WACA,EAEA,OADAoD,EAAAytC,QAAA,EACAztC,CACA,CAEA,SAAA0tC,EAAAnsC,GACA,IAAAvB,EAAA,SAAAA,IACA,GAAAA,EAAAytC,OACA,MAAA,IAAA3sC,MAAAd,EAAA2tC,WAEA,OADA3tC,EAAAytC,QAAA,EACAztC,EAAArE,MAAA4F,EAAA1E,MAAAC,KAAAF,UACA,EACAhC,EAAA2G,EAAA3G,MAAA,+BAGA,OAFAoF,EAAA2tC,UAAA/yC,EAAA,sCACAoF,EAAAytC,QAAA,EACAztC,CACA,CAxCAE,EAAAD,QAAAutC,EAAA/rC,GACAvB,EAAAD,QAAAmK,OAAAojC,EAAAE,GAEAjsC,EAAAmsC,MAAAnsC,GAAA,WACAnH,OAAAuB,eAAAopB,SAAA1qB,UAAA,OAAA,CACAoB,MAAA,WACA,OAAA8F,EAAA3E,KACA,EACAf,cAAA,IAGAzB,OAAAuB,eAAAopB,SAAA1qB,UAAA,aAAA,CACAoB,MAAA,WACA,OAAA+xC,EAAA5wC,KACA,EACAf,cAAA,GAEA,GvEi6RA,EAAE,CAACyxC,OAAS,MAAM,GAAG,CAAC,SAAS7sC,EAAQT,EAAOD,IAC9C,SAAWyxB,IAAS,WwE15RpB,SAAAmc,EAAAtyB,GACA,GAAA,iBAAAA,EACA,MAAA,IAAAthB,UAAA,mCAAAgyB,KAAArlB,UAAA2U,GAEA,CAGA,SAAAuyB,EAAAvyB,EAAAwyB,GAMA,IALA,IAIAhtC,EAJA3C,EAAA,GACA4vC,EAAA,EACAC,GAAA,EACAC,EAAA,EAEA5yC,EAAA,EAAAA,GAAAigB,EAAAlgB,SAAAC,EAAA,CACA,GAAAA,EAAAigB,EAAAlgB,OACA0F,EAAAwa,EAAA/W,WAAAlJ,OACA,IAAA,KAAAyF,EACA,MAEAA,EAAA,EAAA,CACA,GAAA,KAAAA,EAAA,CACA,GAAAktC,IAAA3yC,EAAA,GAAA,IAAA4yC,QAEA,GAAAD,IAAA3yC,EAAA,GAAA,IAAA4yC,EAAA,CACA,GAAA9vC,EAAA/C,OAAA,GAAA,IAAA2yC,GAAA,KAAA5vC,EAAAoG,WAAApG,EAAA/C,OAAA,IAAA,KAAA+C,EAAAoG,WAAApG,EAAA/C,OAAA,GACA,GAAA+C,EAAA/C,OAAA,EAAA,CACA,IAAA8yC,EAAA/vC,EAAAkQ,YAAA,KACA,GAAA6/B,IAAA/vC,EAAA/C,OAAA,EAAA,EACA,IAAA8yC,GACA/vC,EAAA,GACA4vC,EAAA,GAGAA,GADA5vC,EAAAA,EAAA1D,MAAA,EAAAyzC,IACA9yC,OAAA,EAAA+C,EAAAkQ,YAAA,KAEA2/B,EAAA3yC,EACA4yC,EAAA,EACA,QACA,CACA,MAAA,GAAA,IAAA9vC,EAAA/C,QAAA,IAAA+C,EAAA/C,OAAA,CACA+C,EAAA,GACA4vC,EAAA,EACAC,EAAA3yC,EACA4yC,EAAA,EACA,QACA,CAEAH,IACA3vC,EAAA/C,OAAA,EACA+C,GAAA,MAEAA,EAAA,KACA4vC,EAAA,EAEA,MACA5vC,EAAA/C,OAAA,EACA+C,GAAA,IAAAmd,EAAA7gB,MAAAuzC,EAAA,EAAA3yC,GAEA8C,EAAAmd,EAAA7gB,MAAAuzC,EAAA,EAAA3yC,GACA0yC,EAAA1yC,EAAA2yC,EAAA,EAEAA,EAAA3yC,EACA4yC,EAAA,CACA,MAAA,KAAAntC,IAAA,IAAAmtC,IACAA,EAEAA,GAAA,CAEA,CACA,OAAA9vC,CACA,CAcA,IAAAgwC,EAAA,CAEA3oB,QAAA,WAKA,IAJA,IAEA4oB,EAFAC,EAAA,GACAC,GAAA,EAGAjzC,EAAAsB,UAAAvB,OAAA,EAAAC,IAAA,IAAAizC,EAAAjzC,IAAA,CACA,IAAAigB,EACAjgB,GAAA,EACAigB,EAAA3e,UAAAtB,SAEA6C,IAAAkwC,IACAA,EAAA3c,EAAA2c,OACA9yB,EAAA8yB,GAGAR,EAAAtyB,GAGA,IAAAA,EAAAlgB,SAIAizC,EAAA/yB,EAAA,IAAA+yB,EACAC,EAAA,KAAAhzB,EAAA/W,WAAA,GACA,CAQA,OAFA8pC,EAAAR,EAAAQ,GAAAC,GAEAA,EACAD,EAAAjzC,OAAA,EACA,IAAAizC,EAEA,IACAA,EAAAjzC,OAAA,EACAizC,EAEA,GAEA,EAEA3hB,UAAA,SAAApR,GAGA,GAFAsyB,EAAAtyB,GAEA,IAAAA,EAAAlgB,OAAA,MAAA,IAEA,IAAAmzC,EAAA,KAAAjzB,EAAA/W,WAAA,GACAiqC,EAAA,KAAAlzB,EAAA/W,WAAA+W,EAAAlgB,OAAA,GAQA,OAHA,KAFAkgB,EAAAuyB,EAAAvyB,GAAAizB,IAEAnzC,QAAAmzC,IAAAjzB,EAAA,KACAA,EAAAlgB,OAAA,GAAAozC,IAAAlzB,GAAA,KAEAizB,EAAA,IAAAjzB,EACAA,CACA,EAEAizB,WAAA,SAAAjzB,GAEA,OADAsyB,EAAAtyB,GACAA,EAAAlgB,OAAA,GAAA,KAAAkgB,EAAA/W,WAAA,EACA,EAEAS,KAAA,WACA,GAAA,IAAArI,UAAAvB,OACA,MAAA,IAEA,IADA,IAAAqzC,EACApzC,EAAA,EAAAA,EAAAsB,UAAAvB,SAAAC,EAAA,CACA,IAAAqC,EAAAf,UAAAtB,GACAuyC,EAAAlwC,GACAA,EAAAtC,OAAA,SACA8C,IAAAuwC,EACAA,EAAA/wC,EAEA+wC,GAAA,IAAA/wC,EAEA,CACA,YAAAQ,IAAAuwC,EACA,IACAN,EAAAzhB,UAAA+hB,EACA,EAEAC,SAAA,SAAA7zC,EAAA2nB,GAIA,GAHAorB,EAAA/yC,GACA+yC,EAAAprB,GAEA3nB,IAAA2nB,EAAA,MAAA,GAKA,IAHA3nB,EAAAszC,EAAA3oB,QAAA3qB,OACA2nB,EAAA2rB,EAAA3oB,QAAAhD,IAEA,MAAA,GAIA,IADA,IAAAmsB,EAAA,EACAA,EAAA9zC,EAAAO,QACA,KAAAP,EAAA0J,WAAAoqC,KADAA,GASA,IALA,IAAAC,EAAA/zC,EAAAO,OACAyzC,EAAAD,EAAAD,EAGAG,EAAA,EACAA,EAAAtsB,EAAApnB,QACA,KAAAonB,EAAAje,WAAAuqC,KADAA,GAWA,IAPA,IACAC,EADAvsB,EAAApnB,OACA0zC,EAGA1zC,EAAAyzC,EAAAE,EAAAF,EAAAE,EACAC,GAAA,EACA3zC,EAAA,EACAA,GAAAD,IAAAC,EAAA,CACA,GAAAA,IAAAD,EAAA,CACA,GAAA2zC,EAAA3zC,EAAA,CACA,GAAA,KAAAonB,EAAAje,WAAAuqC,EAAAzzC,GAGA,OAAAmnB,EAAA/nB,MAAAq0C,EAAAzzC,EAAA,GACA,GAAA,IAAAA,EAGA,OAAAmnB,EAAA/nB,MAAAq0C,EAAAzzC,EAEA,MAAAwzC,EAAAzzC,IACA,KAAAP,EAAA0J,WAAAoqC,EAAAtzC,GAGA2zC,EAAA3zC,EACA,IAAAA,IAGA2zC,EAAA,IAGA,KACA,CACA,IAAAC,EAAAp0C,EAAA0J,WAAAoqC,EAAAtzC,GAEA,GAAA4zC,IADAzsB,EAAAje,WAAAuqC,EAAAzzC,GAEA,MACA,KAAA4zC,IACAD,EAAA3zC,EACA,CAEA,IAAAqX,EAAA,GAGA,IAAArX,EAAAszC,EAAAK,EAAA,EAAA3zC,GAAAuzC,IAAAvzC,EACAA,IAAAuzC,GAAA,KAAA/zC,EAAA0J,WAAAlJ,KACA,IAAAqX,EAAAtX,OACAsX,GAAA,KAEAA,GAAA,OAMA,OAAAA,EAAAtX,OAAA,EACAsX,EAAA8P,EAAA/nB,MAAAq0C,EAAAE,IAEAF,GAAAE,EACA,KAAAxsB,EAAAje,WAAAuqC,MACAA,EACAtsB,EAAA/nB,MAAAq0C,GAEA,EAEAI,UAAA,SAAA5zB,GACA,OAAAA,CACA,EAEA6zB,QAAA,SAAA7zB,GAEA,GADAsyB,EAAAtyB,GACA,IAAAA,EAAAlgB,OAAA,MAAA,IAKA,IAJA,IAAA0F,EAAAwa,EAAA/W,WAAA,GACA6qC,EAAA,KAAAtuC,EACAsE,GAAA,EACAiqC,GAAA,EACAh0C,EAAAigB,EAAAlgB,OAAA,EAAAC,GAAA,IAAAA,EAEA,GAAA,MADAyF,EAAAwa,EAAA/W,WAAAlJ,KAEA,IAAAg0C,EAAA,CACAjqC,EAAA/J,EACA,KACA,OAGAg0C,GAAA,EAIA,OAAA,IAAAjqC,EAAAgqC,EAAA,IAAA,IACAA,GAAA,IAAAhqC,EAAA,KACAkW,EAAA7gB,MAAA,EAAA2K,EACA,EAEAkqC,SAAA,SAAAh0B,EAAAxI,GACA,QAAA5U,IAAA4U,GAAA,iBAAAA,EAAA,MAAA,IAAA9Y,UAAA,mCACA4zC,EAAAtyB,GAEA,IAGAjgB,EAHA8J,EAAA,EACAC,GAAA,EACAiqC,GAAA,EAGA,QAAAnxC,IAAA4U,GAAAA,EAAA1X,OAAA,GAAA0X,EAAA1X,QAAAkgB,EAAAlgB,OAAA,CACA,GAAA0X,EAAA1X,SAAAkgB,EAAAlgB,QAAA0X,IAAAwI,EAAA,MAAA,GACA,IAAAi0B,EAAAz8B,EAAA1X,OAAA,EACAo0C,GAAA,EACA,IAAAn0C,EAAAigB,EAAAlgB,OAAA,EAAAC,GAAA,IAAAA,EAAA,CACA,IAAAyF,EAAAwa,EAAA/W,WAAAlJ,GACA,GAAA,KAAAyF,GAGA,IAAAuuC,EAAA,CACAlqC,EAAA9J,EAAA,EACA,KACA,OAEA,IAAAm0C,IAGAH,GAAA,EACAG,EAAAn0C,EAAA,GAEAk0C,GAAA,IAEAzuC,IAAAgS,EAAAvO,WAAAgrC,IACA,KAAAA,IAGAnqC,EAAA/J,IAKAk0C,GAAA,EACAnqC,EAAAoqC,GAIA,CAGA,OADArqC,IAAAC,EAAAA,EAAAoqC,GAAA,IAAApqC,IAAAA,EAAAkW,EAAAlgB,QACAkgB,EAAA7gB,MAAA0K,EAAAC,EACA,CACA,IAAA/J,EAAAigB,EAAAlgB,OAAA,EAAAC,GAAA,IAAAA,EACA,GAAA,KAAAigB,EAAA/W,WAAAlJ,IAGA,IAAAg0C,EAAA,CACAlqC,EAAA9J,EAAA,EACA,KACA,OACA,IAAA+J,IAGAiqC,GAAA,EACAjqC,EAAA/J,EAAA,GAIA,OAAA,IAAA+J,EAAA,GACAkW,EAAA7gB,MAAA0K,EAAAC,EAEA,EAEAqqC,QAAA,SAAAn0B,GACAsyB,EAAAtyB,GAQA,IAPA,IAAAo0B,GAAA,EACAC,EAAA,EACAvqC,GAAA,EACAiqC,GAAA,EAGAO,EAAA,EACAv0C,EAAAigB,EAAAlgB,OAAA,EAAAC,GAAA,IAAAA,EAAA,CACA,IAAAyF,EAAAwa,EAAA/W,WAAAlJ,GACA,GAAA,KAAAyF,GASA,IAAAsE,IAGAiqC,GAAA,EACAjqC,EAAA/J,EAAA,GAEA,KAAAyF,GAEA,IAAA4uC,EACAA,EAAAr0C,EACA,IAAAu0C,IACAA,EAAA,IACA,IAAAF,IAGAE,GAAA,QArBA,IAAAP,EAAA,CACAM,EAAAt0C,EAAA,EACA,KACA,CAoBA,CAEA,OAAA,IAAAq0C,IAAA,IAAAtqC,GAEA,IAAAwqC,GAEA,IAAAA,GAAAF,IAAAtqC,EAAA,GAAAsqC,IAAAC,EAAA,EACA,GAEAr0B,EAAA7gB,MAAAi1C,EAAAtqC,EACA,EAEA+a,OAAA,SAAA0vB,GACA,GAAA,OAAAA,GAAA,WAAAjyC,QAAAiyC,GACA,MAAA,IAAA71C,UAAA,mEAAA4D,QAAAiyC,IAEA,OAvVA,SAAAC,EAAAD,GACA,IAAA1hC,EAAA0hC,EAAA1hC,KAAA0hC,EAAAE,KACAxzC,EAAAszC,EAAAtzC,OAAAszC,EAAAl1C,MAAA,KAAAk1C,EAAA/8B,KAAA,IACA,OAAA3E,EAGAA,IAAA0hC,EAAAE,KACA5hC,EAAA5R,EAEA4R,EAAA2hC,EAAAvzC,EALAA,CAMA,CA6UAyzC,CAAA,IAAAH,EACA,EAEAnlC,MAAA,SAAA4Q,GACAsyB,EAAAtyB,GAEA,IAAA7I,EAAA,CAAAs9B,KAAA,GAAA5hC,IAAA,GAAA5R,KAAA,GAAAuW,IAAA,GAAAnY,KAAA,IACA,GAAA,IAAA2gB,EAAAlgB,OAAA,OAAAqX,EACA,IAEAtN,EAFArE,EAAAwa,EAAA/W,WAAA,GACAgqC,EAAA,KAAAztC,EAEAytC,GACA97B,EAAAs9B,KAAA,IACA5qC,EAAA,GAEAA,EAAA,EAaA,IAXA,IAAAuqC,GAAA,EACAC,EAAA,EACAvqC,GAAA,EACAiqC,GAAA,EACAh0C,EAAAigB,EAAAlgB,OAAA,EAIAw0C,EAAA,EAGAv0C,GAAA8J,IAAA9J,EAEA,GAAA,MADAyF,EAAAwa,EAAA/W,WAAAlJ,KAUA,IAAA+J,IAGAiqC,GAAA,EACAjqC,EAAA/J,EAAA,GAEA,KAAAyF,GAEA,IAAA4uC,EAAAA,EAAAr0C,EAAA,IAAAu0C,IAAAA,EAAA,IACA,IAAAF,IAGAE,GAAA,QAlBA,IAAAP,EAAA,CACAM,EAAAt0C,EAAA,EACA,KACA,CAwCA,OArBA,IAAAq0C,IAAA,IAAAtqC,GAEA,IAAAwqC,GAEA,IAAAA,GAAAF,IAAAtqC,EAAA,GAAAsqC,IAAAC,EAAA,GACA,IAAAvqC,IACAqN,EAAAlW,KAAAkW,EAAA9X,KAAA,IAAAg1C,GAAApB,EAAAjzB,EAAA7gB,MAAA,EAAA2K,GAAAkW,EAAA7gB,MAAAk1C,EAAAvqC,KAGA,IAAAuqC,GAAApB,GACA97B,EAAA9X,KAAA2gB,EAAA7gB,MAAA,EAAAi1C,GACAj9B,EAAAlW,KAAA+e,EAAA7gB,MAAA,EAAA2K,KAEAqN,EAAA9X,KAAA2gB,EAAA7gB,MAAAk1C,EAAAD,GACAj9B,EAAAlW,KAAA+e,EAAA7gB,MAAAk1C,EAAAvqC,IAEAqN,EAAAK,IAAAwI,EAAA7gB,MAAAi1C,EAAAtqC,IAGAuqC,EAAA,EAAAl9B,EAAAtE,IAAAmN,EAAA7gB,MAAA,EAAAk1C,EAAA,GAAApB,IAAA97B,EAAAtE,IAAA,KAEAsE,CACA,EAEAq9B,IAAA,IACAG,UAAA,IACAC,MAAA,KACA/B,MAAA,MAGAA,EAAAA,MAAAA,EAEAluC,EAAAD,QAAAmuC,CxEu7RC,GAAE3zC,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,YAElC,EAAE,CAAC6xB,SAAW,KAAK,GAAG,CAAC,SAAS7xB,EAAQT,EAAOD;;;;;;;;;;AyEh8S/C,IAAAmwC,EAAAzvC,EAAA,iBACA0vC,EAAA1vC,EAAA,qBAEA2vC,EAAA,WAKA,SAAAA,IACApzC,iBAAAJ,KAAAwzC,GACAxzC,KAAAyzC,SAAA,IAAAH,EAEAtzC,KAAA0zC,aAAA,IAAAH,EAEAvzC,KAAA2zC,UAAA3zC,KAAAyzC,SAAAE,SACA,CAyBA,OAvBAjzC,cAAA8yC,EAAA,CAAA,CAAA50C,IAAA,aAAAC,MAQA,SAAA+0C,EAAAC,EAAAC,GAEA,OAAA9zC,KAAAyzC,SAAAxe,WAAA2e,EAAAC,EAAAC,EACA,GAEA,CAAAl1C,IAAA,cAAAC,MAOA,SAAA22B,EAAAlb,GAEA,OAAAta,KAAA0zC,aAAAje,YAAAD,EAAAx1B,KAAA2zC,UAAAr5B,EACA,KAAAk5B,CAAA,CArCA,GAwCApwC,EAAAD,QAAAqwC,CzE48SA,EAAE,CAAC,oBAAoB,GAAG,gBAAgB,KAAK,GAAG,CAAC,SAAS3vC,EAAQT,EAAOD,G0EhgT3E,IAMAuwC,EAAA,WAKA,SAAAA,IACAtzC,iBAAAJ,KAAA0zC,EACA,CAuLA,OArLAhzC,cAAAgzC,EAAA,CAAA,CAAA90C,IAAA,iBAAAC,MAOA,SAAAk1C,GAEA,MACA,CACAJ,UAAAI,EAEAC,cAAA,EAEAC,OAAA,GACAC,aAAA,GAEAC,QAAA,CAAA,EAEAC,cAAA,EACAC,iBAAA,EAEA,GAEA,CAAAz1C,IAAA,qBAAAC,MAQA,SAAAquB,EAAAonB,GAEAA,EAAAJ,cAAAhnB,CACA,GAEA,CAAAtuB,IAAA,oBAAAC,MAMA,SAAAy1C,GAEAA,EAAAL,QAAAK,EAAAJ,aACAI,EAAAJ,aAAA,EACA,GAAA,CAAAt1C,IAAA,oBAAAC,MAEA,SAAAy1C,GAWA,OARAt0C,KAAAu0C,kBAAAD,GAEAA,EAAAH,SAAA,EACAG,EAAAE,kBAAA,EACAF,EAAAG,2BAAA,EACAH,EAAAI,sBAAA,EACAJ,EAAAF,cAAA,GAEA,CACA,GAEA,CAAAx1C,IAAA,iBAAAC,MAOA,SAAAquB,EAAAonB,EAAAh6B,GAGA,GAAAg6B,EAAAF,aAGA,IAAAE,EAAAG,2BAAAH,EAAAH,QAAAj0C,eAAAgtB,GAEAonB,EAAAH,QAAAG,EAAAH,QAAAjnB,GACAltB,KAAA20C,mBAAAznB,EAAAonB,QAEA,GAAAA,EAAAI,qBAEA,GAAAJ,EAAAH,QAAAS,WAAA10C,eAAAgtB,IAOA,GAJAonB,EAAAH,QAAAG,EAAAH,QAAAS,WAAA1nB,GAEAltB,KAAA20C,mBAAAznB,EAAAonB,GAEAA,EAAAH,QAAAj0C,eAAA,SAIA,OADAo0C,EAAAJ,aAAAI,EAAAH,QAAAU,MAAAP,EAAAJ,aAAA5hC,OAAAgiC,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAJ,aAAA31C,QAAA+1C,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAH,QAAAY,iBAAAx2C,SAAA+b,GACAta,KAAAg1C,kBAAAV,QAGAA,EAAAE,iBAAAI,WAAA10C,eAAAgtB,IAGAonB,EAAAH,QAAAG,EAAAE,iBAAAI,WAAA1nB,GACAltB,KAAA20C,mBAAAznB,EAAAonB,KAIAA,EAAAI,sBAAA,EACA10C,KAAA20C,mBAAAznB,EAAAonB,SAGA,GAAAA,EAAAH,QAAAj0C,eAAA,eAUA,GARAo0C,EAAAG,4BAEAH,EAAAG,2BAAA,EACAH,EAAAE,iBAAAF,EAAAH,SAGAn0C,KAAA20C,mBAAAznB,EAAAonB,GAEAA,EAAAH,QAAAS,WAAA10C,eAAAgtB,KAGAonB,EAAAI,sBAAA,EAEAJ,EAAAH,QAAAG,EAAAH,QAAAS,WAAA1nB,GAEAonB,EAAAH,QAAAj0C,eAAA,UAIA,OADAo0C,EAAAJ,aAAAI,EAAAH,QAAAU,MAAAP,EAAAJ,aAAA5hC,OAAAgiC,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAJ,aAAA31C,QAAA+1C,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAH,QAAAY,iBAAAx2C,SAAA+b,GACAta,KAAAg1C,kBAAAV,QAOAt0C,KAAAg1C,kBAAAV,GAIA,IAAAA,EAAAF,aACA,CAEA,GAAAE,EAAAX,UAAAzzC,eAAAgtB,GAOA,OAJAltB,KAAAg1C,kBAAAV,GACAt0C,KAAA20C,mBAAAznB,EAAAonB,GACAA,EAAAH,QAAAG,EAAAX,UAAAzmB,GACAonB,EAAAF,cAAA,GACA,EAIAp0C,KAAA20C,mBAAAznB,EAAAonB,EAEA,CACA,OAAA,CACA,GAEA,CAAA11C,IAAA,cAAAC,MAOA,SAAA22B,EAAAue,EAAAz5B,GAIA,IAFA,IAAA26B,EAAAj1C,KAAAk1C,eAAAnB,GAEAv1C,EAAA,EAAAA,EAAAg3B,EAAAj3B,OAAAC,IAEAwB,KAAAm1C,eAAA3f,EAAAh3B,GAAAy2C,EAAA36B,GAKA,OAFAta,KAAAu0C,kBAAAU,GAEAA,EAAAhB,MACA,KAAAP,CAAA,CA9LA,GAiMAtwC,EAAAD,QAAAuwC,C1EmgTA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS7vC,EAAQT,EAAOD,G2E1sTlC,IAMAswC,EAAA,WAKA,SAAAA,IACArzC,iBAAAJ,KAAAyzC,GACAzzC,KAAA2zC,UAAA,CAAA,CACA,CAqFA,OAnFAjzC,cAAA+yC,EAAA,CAAA,CAAA70C,IAAA,WAAAC,MAQA,SAAAu2C,EAAAC,GAOA,OALAD,EAAAl1C,eAAAm1C,KAEAD,EAAAC,GAAA,CAAA,GAGAD,EAAAC,EACA,GAEA,CAAAz2C,IAAA,cAAAC,MAQA,SAAAu2C,EAAAC,GASA,OAPAD,EAAAl1C,eAAA,gBAEAk1C,EAAAR,WAAA,CAAA,GAGAQ,EAAAR,WAAAS,GAAA,CAAA,EAEAD,EAAAR,WAAAS,EACA,GAEA,CAAAz2C,IAAA,aAAAC,MAOA,SAAA+0C,EAAAC,EAAAyB,GAEA,GAAA1B,EAAAr1C,OAAA,EAEA,OAAA,EAGA,GAAA,iBAAAs1C,GAAAA,EAAAt1C,OAAA,EAEA,OAAA,EAMA,IAHA,IAAAg3C,EAAAv1C,KAAA2zC,UAGAn1C,EAAA,EAAAA,EAAAo1C,EAAAr1C,OAAAC,IAEA+2C,EAAAv1C,KAAAw1C,SAAAD,EAAA3B,EAAAp1C,GAAAA,GAGA+2C,EAAAr1C,eAAA,gBAEAq1C,EAAAX,WAAA,CAAA,GAIA,IADA,IAAAa,EAAA,iBAAA5B,EAAAA,EAAAD,EACAp1C,EAAA,EAAAA,EAAAi3C,EAAAl3C,OAAAC,IAEA+2C,EAAAv1C,KAAA01C,YAAAH,EAAAE,EAAAj3C,GAAAA,GASA,OANA+2C,EAAAT,mBAAAlB,EACA2B,EAAAR,iBAAAU,EACAF,EAAAV,MAAA,mBAAAS,EAAAA,EACA,iBAAAA,EAAA,WAAA,OAAAA,CAAA,EACA,SAAAh7B,GAAA,OAAAA,CAAA,GAEA,CACA,KAAAm5B,CAAA,CA7FA,GAgGArwC,EAAAD,QAAAswC,C3E6sTA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS5vC,EAAQT,EAAOD,G4ElzTlC,IAOAwyC,EACAC,EARAhhB,EAAAxxB,EAAAD,QAAA,CAAA,EAUA,SAAA0yC,IACA,MAAA,IAAA7xC,MAAA,kCACA,CACA,SAAA8xC,IACA,MAAA,IAAA9xC,MAAA,oCACA,CAqBA,SAAA+xC,EAAAC,GACA,GAAAL,IAAAlvC,WAEA,OAAAA,WAAAuvC,EAAA,GAGA,IAAAL,IAAAE,IAAAF,IAAAlvC,WAEA,OADAkvC,EAAAlvC,WACAA,WAAAuvC,EAAA,GAEA,IAEA,OAAAL,EAAAK,EAAA,EACA,CAAA,MAAAhzC,GACA,IAEA,OAAA2yC,EAAAh4C,KAAA,KAAAq4C,EAAA,EACA,CAAA,MAAAhzC,GAEA,OAAA2yC,EAAAh4C,KAAAqC,KAAAg2C,EAAA,EACA,CACA,CAGA,EA5CA,WACA,IAEAL,EADA,mBAAAlvC,WACAA,WAEAovC,CAEA,CAAA,MAAA7yC,GACA2yC,EAAAE,CACA,CACA,IAEAD,EADA,mBAAAK,aACAA,aAEAH,CAEA,CAAA,MAAA9yC,GACA4yC,EAAAE,CACA,CACA,CAnBA,GAwEA,IAEAI,EAFAC,EAAA,GACAC,GAAA,EAEAC,GAAA,EAEA,SAAAC,IACAF,GAAAF,IAGAE,GAAA,EACAF,EAAA33C,OACA43C,EAAAD,EAAArvC,OAAAsvC,GAEAE,GAAA,EAEAF,EAAA53C,QACAg4C,IAEA,CAEA,SAAAA,IACA,IAAAH,EAAA,CAGA,IAAAI,EAAAT,EAAAO,GACAF,GAAA,EAGA,IADA,IAAA93C,EAAA63C,EAAA53C,OACAD,GAAA,CAGA,IAFA43C,EAAAC,EACAA,EAAA,KACAE,EAAA/3C,GACA43C,GACAA,EAAAG,GAAAI,MAGAJ,GAAA,EACA/3C,EAAA63C,EAAA53C,MACA,CACA23C,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,MAAA1zC,GACA,IAEA,OAAA4yC,EAAAj4C,KAAA,KAAA+4C,EACA,CAAA,MAAA1zC,GAGA,OAAA4yC,EAAAj4C,KAAAqC,KAAA02C,EACA,CACA,CAIA,CA0CAC,CAAAH,EAlBA,CAmBA,CAgBA,SAAAI,EAAAZ,EAAAtmC,GACA1P,KAAAg2C,IAAAA,EACAh2C,KAAA0P,MAAAA,CACA,CAWA,SAAA9K,IAAA,CA5BAgwB,EAAAiiB,SAAA,SAAAb,GACA,IAAAzwC,EAAA,IAAAxH,MAAA+B,UAAAvB,OAAA,GACA,GAAAuB,UAAAvB,OAAA,EACA,IAAA,IAAAC,EAAA,EAAAA,EAAAsB,UAAAvB,OAAAC,IACA+G,EAAA/G,EAAA,GAAAsB,UAAAtB,GAGA23C,EAAAzwC,KAAA,IAAAkxC,EAAAZ,EAAAzwC,IACA,IAAA4wC,EAAA53C,QAAA63C,GACAL,EAAAQ,EAEA,EAOAK,EAAAn5C,UAAAg5C,IAAA,WACAz2C,KAAAg2C,IAAAj2C,MAAA,KAAAC,KAAA0P,MACA,EACAklB,EAAAkiB,MAAA,UACAliB,EAAAmiB,SAAA,EACAniB,EAAAW,IAAA,CAAA,EACAX,EAAAoiB,KAAA,GACApiB,EAAAqiB,QAAA,GACAriB,EAAAsiB,SAAA,CAAA,EAIAtiB,EAAAzL,GAAAvkB,EACAgwB,EAAA/I,YAAAjnB,EACAgwB,EAAAjwB,KAAAC,EACAgwB,EAAAzI,IAAAvnB,EACAgwB,EAAA9L,eAAAlkB,EACAgwB,EAAAxI,mBAAAxnB,EACAgwB,EAAAzK,KAAAvlB,EACAgwB,EAAA9I,gBAAAlnB,EACAgwB,EAAA7I,oBAAAnnB,EAEAgwB,EAAAhJ,UAAA,SAAA9tB,GAAA,MAAA,EAAA,EAEA82B,EAAAuiB,QAAA,SAAAr5C,GACA,MAAA,IAAAkG,MAAA,mCACA,EAEA4wB,EAAA2c,IAAA,WAAA,MAAA,GAAA,EACA3c,EAAAwiB,MAAA,SAAA9lC,GACA,MAAA,IAAAtN,MAAA,iCACA,EACA4wB,EAAAyiB,MAAA,WAAA,OAAA,CAAA,C5EszTA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASxzC,EAAQT,EAAOD,IAClC,SAAWK,IAAQ,Y6E7+TnB,SAAA0vC,GAGA,IAAAoE,EAAA,UAAAv2C,QAAAoC,IAAAA,IACAA,EAAAo0C,UAAAp0C,EACAq0C,EAAA,UAAAz2C,QAAAqC,IAAAA,IACAA,EAAAm0C,UAAAn0C,EACAq0C,EAAA,UAAA12C,QAAAyC,IAAAA,EAEAi0C,EAAAj0C,SAAAi0C,GACAA,EAAAl0C,SAAAk0C,GACAA,EAAAh1C,OAAAg1C,IAEAvE,EAAAuE,GAQA,IAAAC,EAiCA94C,EA9BA+4C,EAAA,WAGAj4C,EAAA,GACAk4C,EAAA,EACAC,EAAA,GACAC,EAAA,GACAC,EAAA,IACAC,EAAA,GACAC,EAAA,IACA7E,EAAA,IAGA8E,EAAA,QACAC,EAAA,eACAC,EAAA,4BAGAC,EAAA,CACAC,SAAA,kDACA,YAAA,iDACA,gBAAA,iBAIAC,EAAA74C,EAAAk4C,EACAr5B,EAAAnY,KAAAmY,MACAi6B,EAAAx3C,OAAA8S,aAaA,SAAAO,EAAApE,GACA,MAAA,IAAAtB,WAAA0pC,EAAApoC,GACA,CAUA,SAAAwoC,EAAA/oC,EAAAjL,GAGA,IAFA,IAAAlG,EAAAmR,EAAAnR,OACA6D,EAAA,GACA7D,KACA6D,EAAA7D,GAAAkG,EAAAiL,EAAAnR,IAEA,OAAA6D,CACA,CAYA,SAAAs2C,EAAA3pC,EAAAtK,GACA,IAAAqD,EAAAiH,EAAAoK,MAAA,KACA/W,EAAA,GAWA,OAVA0F,EAAAvJ,OAAA,IAGA6D,EAAA0F,EAAA,GAAA,IACAiH,EAAAjH,EAAA,IAMA1F,EADAq2C,GAFA1pC,EAAAA,EAAArB,QAAA0qC,EAAA,MACAj/B,MAAA,KACA1U,GAAA0D,KAAA,IAEA,CAeA,SAAAwwC,EAAA5pC,GAMA,IALA,IAGAlQ,EACA+5C,EAJAnwC,EAAA,GACAowC,EAAA,EACAt6C,EAAAwQ,EAAAxQ,OAGAs6C,EAAAt6C,IACAM,EAAAkQ,EAAArH,WAAAmxC,OACA,OAAAh6C,GAAA,OAAAg6C,EAAAt6C,EAGA,QAAA,OADAq6C,EAAA7pC,EAAArH,WAAAmxC,OAEApwC,EAAA/C,OAAA,KAAA7G,IAAA,KAAA,KAAA+5C,GAAA,QAIAnwC,EAAA/C,KAAA7G,GACAg6C,KAGApwC,EAAA/C,KAAA7G,GAGA,OAAA4J,CACA,CAUA,SAAAqwC,EAAAppC,GACA,OAAA+oC,EAAA/oC,GAAA,SAAA7Q,GACA,IAAA4J,EAAA,GAOA,OANA5J,EAAA,QAEA4J,GAAA+vC,GADA35C,GAAA,SACA,GAAA,KAAA,OACAA,EAAA,MAAA,KAAAA,GAEA4J,GAAA+vC,EAAA35C,EAEA,IAAAsJ,KAAA,GACA,CAmCA,SAAA4wC,EAAAC,EAAAC,GAGA,OAAAD,EAAA,GAAA,IAAAA,EAAA,MAAA,GAAAC,IAAA,EACA,CAOA,SAAAC,EAAAC,EAAAC,EAAAC,GACA,IAAApzC,EAAA,EAGA,IAFAkzC,EAAAE,EAAA96B,EAAA46B,EAAApB,GAAAoB,GAAA,EACAA,GAAA56B,EAAA46B,EAAAC,GACAD,EAAAZ,EAAAV,GAAA,EAAA5xC,GAAAvG,EACAy5C,EAAA56B,EAAA46B,EAAAZ,GAEA,OAAAh6B,EAAAtY,GAAAsyC,EAAA,GAAAY,GAAAA,EAAArB,GACA,CASA,SAAAj6B,EAAA5c,GAEA,IAEA4U,EAIAyjC,EACA9uC,EACAhG,EACA+0C,EACAp5B,EACAla,EACA+yC,EACAr1C,EAEA61C,EArEA9lC,EAsDAjL,EAAA,GACAgxC,EAAAx4C,EAAA1C,OAEAC,EAAA,EACAjB,EAAA06C,EACAyB,EAAA1B,EAqBA,KALAsB,EAAAr4C,EAAAuQ,YAAA4hC,IACA,IACAkG,EAAA,GAGA9uC,EAAA,EAAAA,EAAA8uC,IAAA9uC,EAEAvJ,EAAAyG,WAAA8C,IAAA,KACA6J,EAAA,aAEA5L,EAAA/C,KAAAzE,EAAAyG,WAAA8C,IAMA,IAAAhG,EAAA80C,EAAA,EAAAA,EAAA,EAAA,EAAA90C,EAAAi1C,GAAA,CAOA,IAAAF,EAAA/6C,EAAA2hB,EAAA,EAAAla,EAAAvG,EAEA8E,GAAAi1C,GACAplC,EAAA,mBAGA2kC,GAxGAtlC,EAwGAzS,EAAAyG,WAAAlD,MAvGA,GAAA,GACAkP,EAAA,GAEAA,EAAA,GAAA,GACAA,EAAA,GAEAA,EAAA,GAAA,GACAA,EAAA,GAEAhU,IAgGAA,GAAAs5C,EAAAz6B,GAAAo5B,EAAAn5C,GAAA2hB,KACA9L,EAAA,YAGA7V,GAAAw6C,EAAA74B,IAGA64B,GAFAr1C,EAAAsC,GAAAyzC,EAAA9B,EAAA3xC,GAAAyzC,EAAA7B,EAAAA,EAAA5xC,EAAAyzC,IAbAzzC,GAAAvG,EAoBAygB,EAAA5B,EAAAo5B,GADA6B,EAAA95C,EAAAiE,KAEA0Q,EAAA,YAGA8L,GAAAq5B,EAKAE,EAAAR,EAAA16C,EAAA+6C,EADA1jC,EAAApN,EAAAlK,OAAA,EACA,GAAAg7C,GAIAh7B,EAAA/f,EAAAqX,GAAA8hC,EAAAp6C,GACA8W,EAAA,YAGA9W,GAAAghB,EAAA/f,EAAAqX,GACArX,GAAAqX,EAGApN,EAAAo0B,OAAAr+B,IAAA,EAAAjB,EAEA,CAEA,OAAAu7C,EAAArwC,EACA,CASA,SAAA2V,EAAAnd,GACA,IAAA1D,EACA47C,EACAQ,EACAC,EACAF,EACAlvC,EACA2G,EACA9F,EACApF,EACAtC,EACAk2C,EAGAJ,EAEAK,EACAN,EACAO,EANAtxC,EAAA,GAoBA,IARAgxC,GAHAx4C,EAAA03C,EAAA13C,IAGA1C,OAGAhB,EAAA06C,EACAkB,EAAA,EACAO,EAAA1B,EAGAxtC,EAAA,EAAAA,EAAAivC,IAAAjvC,GACAqvC,EAAA54C,EAAAuJ,IACA,KACA/B,EAAA/C,KAAA8yC,EAAAqB,IAeA,IAXAF,EAAAC,EAAAnxC,EAAAlK,OAMAq7C,GACAnxC,EAAA/C,KAAA0tC,GAIAuG,EAAAF,GAAA,CAIA,IAAAtoC,EAAAwmC,EAAAntC,EAAA,EAAAA,EAAAivC,IAAAjvC,GACAqvC,EAAA54C,EAAAuJ,KACAjN,GAAAs8C,EAAA1oC,IACAA,EAAA0oC,GAcA,IAPA1oC,EAAA5T,EAAAghB,GAAAo5B,EAAAwB,IADAW,EAAAH,EAAA,KAEAtlC,EAAA,YAGA8kC,IAAAhoC,EAAA5T,GAAAu8C,EACAv8C,EAAA4T,EAEA3G,EAAA,EAAAA,EAAAivC,IAAAjvC,EAOA,IANAqvC,EAAA54C,EAAAuJ,IAEAjN,KAAA47C,EAAAxB,GACAtjC,EAAA,YAGAwlC,GAAAt8C,EAAA,CAEA,IAAA8N,EAAA8tC,EAAAlzC,EAAAvG,IAEA2L,GADA1H,EAAAsC,GAAAyzC,EAAA9B,EAAA3xC,GAAAyzC,EAAA7B,EAAAA,EAAA5xC,EAAAyzC,IADAzzC,GAAAvG,EAKAq6C,EAAA1uC,EAAA1H,EACA61C,EAAA95C,EAAAiE,EACA8E,EAAA/C,KACA8yC,EAAAO,EAAAp1C,EAAAo2C,EAAAP,EAAA,KAEAnuC,EAAAkT,EAAAw7B,EAAAP,GAGA/wC,EAAA/C,KAAA8yC,EAAAO,EAAA1tC,EAAA,KACAquC,EAAAR,EAAAC,EAAAW,EAAAH,GAAAC,GACAT,EAAA,IACAQ,CACA,GAGAR,IACA57C,CAEA,CACA,OAAAkL,EAAAN,KAAA,GACA,CA8EA,GAnCAuvC,EAAA,CAMAT,QAAA,QAQA+C,KAAA,CACAn8B,OAAA86B,EACAv6B,OAAA06B,GAEAj7B,OAAAA,EACAO,OAAAA,EACA67B,QA/BA,SAAAh5C,GACA,OAAAy3C,EAAAz3C,GAAA,SAAA8N,GACA,OAAAopC,EAAAl6C,KAAA8Q,GACA,OAAAqP,EAAArP,GACAA,CACA,GACA,EA0BAmrC,UAnDA,SAAAj5C,GACA,OAAAy3C,EAAAz3C,GAAA,SAAA8N,GACA,OAAAmpC,EAAAj6C,KAAA8Q,GACA8O,EAAA9O,EAAAnR,MAAA,GAAA8S,eACA3B,CACA,GACA,GA2DAuoC,GAAAE,EACA,GAAAp0C,EAAAD,SAAAm0C,EAEAE,EAAAr0C,QAAAu0C,OAGA,IAAA94C,KAAA84C,EACAA,EAAAx3C,eAAAtB,KAAA04C,EAAA14C,GAAA84C,EAAA94C,SAKAs0C,EAAAwE,SAAAA,CAGA,CAnhBA,CAmhBA13C,K7Ei/TC,GAAErC,KAAKqC,KAAM,GAAErC,KAAKqC,KAAuB,oBAAXwD,OAAyBA,OAAyB,oBAATf,KAAuBA,KAAyB,oBAAXc,OAAyBA,OAAS,CAAC,EAElJ,EAAE,CAAC,GAAG,GAAG,CAAC,SAASM,EAAQT,EAAOD,G8ErgVlC,IAAAuK,EAAA1M,OAAAvD,UAAAiQ,QACAysC,EAAA,OAEAC,EACA,UADAA,EAEA,UAGAh3C,EAAAD,QAAA,CACAk3C,QAAAD,EACAE,WAAA,CACAC,QAAA,SAAA17C,GACA,OAAA6O,EAAA/P,KAAAkB,EAAAs7C,EAAA,IACA,EACAK,QAAA,SAAA37C,GACA,OAAAmC,OAAAnC,EACA,GAEA07C,QAAAH,EACAI,QAAAJ,E9E2gVA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASv2C,EAAQT,EAAOD,G+E9hVlC,IAAA2G,EAAAjG,EAAA,eACAgK,EAAAhK,EAAA,WACA42C,EAAA52C,EAAA,aAEAT,EAAAD,QAAA,CACAs3C,QAAAA,EACA5sC,MAAAA,EACA/D,UAAAA,E/EoiVA,EAAE,CAAC,YAAY,GAAG,UAAU,GAAG,cAAc,KAAK,GAAG,CAAC,SAASjG,EAAQT,EAAOD,GgF3iV9E,IAAAu3C,EAAA72C,EAAA,WAEAq6B,EAAA1gC,OAAAC,UAAAyC,eACA7B,EAAAN,MAAAM,QAEAs8C,EAAA,CACAC,WAAA,EACAC,iBAAA,EACAC,aAAA,EACAC,WAAA,GACAC,QAAA,QACAC,iBAAA,EACAC,OAAA,EACAC,QAAAT,EAAA78B,OACAu1B,UAAA,IACAhG,MAAA,EACAgO,mBAAA,EACAC,0BAAA,EACAC,eAAA,IACAC,aAAA,EACAC,cAAA,EACAC,oBAAA,GAGAJ,EAAA,SAAA3oC,GACA,OAAAA,EAAAhF,QAAA,aAAA,SAAAguC,EAAAC,GACA,OAAA36C,OAAA8S,aAAAzB,SAAAspC,EAAA,IACA,GACA,EAEAC,EAAA,SAAAvqC,EAAAsM,GACA,OAAAtM,GAAA,iBAAAA,GAAAsM,EAAAu9B,OAAA7pC,EAAAhJ,QAAA,MAAA,EACAgJ,EAAA8H,MAAA,KAGA9H,CACA,EAgHAwqC,EAAA,SAAAC,EAAAzqC,EAAAsM,EAAAo+B,GACA,GAAAD,EAAA,CAKA,IAAAl9C,EAAA+e,EAAAi9B,UAAAkB,EAAApuC,QAAA,cAAA,QAAAouC,EAKAE,EAAA,gBAIAC,EAAAt+B,EAAAyvB,MAAA,GALA,eAKAnQ,KAAAr+B,GACAs9C,EAAAD,EAAAr9C,EAAAhB,MAAA,EAAAq+C,EAAAz3C,OAAA5F,EAIAoH,EAAA,GACA,GAAAk2C,EAAA,CAEA,IAAAv+B,EAAA69B,cAAAtd,EAAAvgC,KAAAH,OAAAC,UAAAy+C,KACAv+B,EAAAk9B,gBACA,OAIA70C,EAAAN,KAAAw2C,EACA,CAKA,IADA,IAAA19C,EAAA,EACAmf,EAAAyvB,MAAA,GAAA,QAAA6O,EAAAD,EAAA/e,KAAAr+B,KAAAJ,EAAAmf,EAAAyvB,OAAA,CAEA,GADA5uC,GAAA,GACAmf,EAAA69B,cAAAtd,EAAAvgC,KAAAH,OAAAC,UAAAw+C,EAAA,GAAAr+C,MAAA,GAAA,MACA+f,EAAAk9B,gBACA,OAGA70C,EAAAN,KAAAu2C,EAAA,GACA,CAQA,OAJAA,GACAj2C,EAAAN,KAAA,IAAA9G,EAAAhB,MAAAq+C,EAAAz3C,OAAA,KAnFA,SAAA23C,EAAA9qC,EAAAsM,EAAAo+B,GAGA,IAFA,IAAAK,EAAAL,EAAA1qC,EAAAuqC,EAAAvqC,EAAAsM,GAEAnf,EAAA29C,EAAA59C,OAAA,EAAAC,GAAA,IAAAA,EAAA,CACA,IAAAG,EACAu0C,EAAAiJ,EAAA39C,GAEA,GAAA,OAAA00C,GAAAv1B,EAAA49B,YACA58C,EAAA,GAAAkI,OAAAu1C,OACA,CACAz9C,EAAAgf,EAAA69B,aAAAh+C,OAAAmE,OAAA,MAAA,CAAA,EACA,IAAA06C,EAAA,MAAAnJ,EAAAhpC,OAAA,IAAA,MAAAgpC,EAAAhpC,OAAAgpC,EAAA30C,OAAA,GAAA20C,EAAAt1C,MAAA,GAAA,GAAAs1C,EACA1uC,EAAA6N,SAAAgqC,EAAA,IACA1+B,EAAA49B,aAAA,KAAAc,GAGA/9B,MAAA9Z,IACA0uC,IAAAmJ,GACAr7C,OAAAwD,KAAA63C,GACA73C,GAAA,GACAmZ,EAAA49B,aAAA/2C,GAAAmZ,EAAAo9B,YAEAp8C,EAAA,IACA6F,GAAA43C,EACA,cAAAC,IACA19C,EAAA09C,GAAAD,GAXAz9C,EAAA,CAAA,EAAAy9C,EAaA,CAEAA,EAAAz9C,CACA,CAEA,OAAAy9C,CACA,CAqDAE,CAAAt2C,EAAAqL,EAAAsM,EAAAo+B,EAhDA,CAiDA,EAqCA34C,EAAAD,QAAA,SAAAuP,EAAAq6B,GACA,IAAApvB,EApCA,SAAAovB,GACA,IAAAA,EACA,OAAA4N,EAGA,GAAA,OAAA5N,EAAAoO,cAAA95C,IAAA0rC,EAAAoO,SAAA,mBAAApO,EAAAoO,QACA,MAAA,IAAAh+C,UAAA,iCAGA,QAAA,IAAA4vC,EAAAiO,SAAA,UAAAjO,EAAAiO,SAAA,eAAAjO,EAAAiO,QACA,MAAA,IAAA79C,UAAA,qEAEA,IAAA69C,OAAA,IAAAjO,EAAAiO,QAAAL,EAAAK,QAAAjO,EAAAiO,QAEA,MAAA,CACAJ,eAAA,IAAA7N,EAAA6N,UAAAD,EAAAC,YAAA7N,EAAA6N,UACAC,gBAAA,kBAAA9N,EAAA8N,gBAAA9N,EAAA8N,gBAAAF,EAAAE,gBACAC,YAAA,kBAAA/N,EAAA+N,YAAA/N,EAAA+N,YAAAH,EAAAG,YACAC,WAAA,iBAAAhO,EAAAgO,WAAAhO,EAAAgO,WAAAJ,EAAAI,WACAC,QAAAA,EACAC,gBAAA,kBAAAlO,EAAAkO,gBAAAlO,EAAAkO,gBAAAN,EAAAM,gBACAC,MAAA,kBAAAnO,EAAAmO,MAAAnO,EAAAmO,MAAAP,EAAAO,MACAC,QAAA,mBAAApO,EAAAoO,QAAApO,EAAAoO,QAAAR,EAAAQ,QACA/H,UAAA,iBAAArG,EAAAqG,WAAAsH,EAAAxN,SAAAH,EAAAqG,WAAArG,EAAAqG,UAAAuH,EAAAvH,UAEAhG,MAAA,iBAAAL,EAAAK,QAAA,IAAAL,EAAAK,OAAAL,EAAAK,MAAAuN,EAAAvN,MACAgO,mBAAA,IAAArO,EAAAqO,kBACAC,yBAAA,kBAAAtO,EAAAsO,yBAAAtO,EAAAsO,yBAAAV,EAAAU,yBACAC,eAAA,iBAAAvO,EAAAuO,eAAAvO,EAAAuO,eAAAX,EAAAW,eACAC,aAAA,IAAAxO,EAAAwO,YACAC,aAAA,kBAAAzO,EAAAyO,aAAAzO,EAAAyO,aAAAb,EAAAa,aACAC,mBAAA,kBAAA1O,EAAA0O,mBAAA1O,EAAA0O,mBAAAd,EAAAc,mBAEA,CAGAc,CAAAxP,GAEA,GAAA,KAAAr6B,SAAAA,EACA,OAAAiL,EAAA69B,aAAAh+C,OAAAmE,OAAA,MAAA,CAAA,EASA,IANA,IAAA66C,EAAA,iBAAA9pC,EApMA,SAAAA,EAAAiL,GACA,IAMAnf,EANAG,EAAA,CAAAoD,UAAA,MAEA06C,EAAA9+B,EAAAy9B,kBAAA1oC,EAAAhF,QAAA,MAAA,IAAAgF,EACAtO,EAAAuZ,EAAA29B,iBAAAriC,SAAA5X,EAAAsc,EAAA29B,eACAxzC,EAAA20C,EAAAtjC,MAAAwE,EAAAy1B,UAAAhvC,GACAs4C,GAAA,EAGA1B,EAAAr9B,EAAAq9B,QACA,GAAAr9B,EAAAs9B,gBACA,IAAAz8C,EAAA,EAAAA,EAAAsJ,EAAAvJ,SAAAC,EACA,IAAAsJ,EAAAtJ,GAAA6J,QAAA,WAdA,mBAeAP,EAAAtJ,GACAw8C,EAAA,QAnBA,wBAoBAlzC,EAAAtJ,KACAw8C,EAAA,cAEA0B,EAAAl+C,EACAA,EAAAsJ,EAAAvJ,QAKA,IAAAC,EAAA,EAAAA,EAAAsJ,EAAAvJ,SAAAC,EACA,GAAAA,IAAAk+C,EAAA,CAGA,IAKA99C,EAAAyS,EALA4sB,EAAAn2B,EAAAtJ,GAEAm+C,EAAA1e,EAAA51B,QAAA,MACAwM,GAAA,IAAA8nC,EAAA1e,EAAA51B,QAAA,KAAAs0C,EAAA,GAGA,IAAA9nC,GACAjW,EAAA+e,EAAAw9B,QAAAld,EAAA0c,EAAAQ,QAAAH,EAAA,OACA3pC,EAAAsM,EAAA89B,mBAAA,KAAA,KAEA78C,EAAA+e,EAAAw9B,QAAAld,EAAArgC,MAAA,EAAAiX,GAAA8lC,EAAAQ,QAAAH,EAAA,OACA3pC,EAAAqpC,EAAAkC,SACAhB,EAAA3d,EAAArgC,MAAAiX,EAAA,GAAA8I,IACA,SAAAk/B,GACA,OAAAl/B,EAAAw9B,QAAA0B,EAAAlC,EAAAQ,QAAAH,EAAA,QACA,KAIA3pC,GAAAsM,EAAA09B,0BAAA,eAAAL,IACA3pC,EAAAgqC,EAAAhqC,IAGA4sB,EAAA51B,QAAA,QAAA,IACAgJ,EAAAhT,EAAAgT,GAAA,CAAAA,GAAAA,GAGA6sB,EAAAvgC,KAAAgB,EAAAC,GACAD,EAAAC,GAAA87C,EAAAoC,QAAAn+C,EAAAC,GAAAyS,GAEA1S,EAAAC,GAAAyS,CA/BA,CAmCA,OAAA1S,CACA,CAqIAo+C,CAAArqC,EAAAiL,GAAAjL,EACA/T,EAAAgf,EAAA69B,aAAAh+C,OAAAmE,OAAA,MAAA,CAAA,EAIAqE,EAAAxI,OAAAwI,KAAAw2C,GACAh+C,EAAA,EAAAA,EAAAwH,EAAAzH,SAAAC,EAAA,CACA,IAAAI,EAAAoH,EAAAxH,GACAw+C,EAAAnB,EAAAj9C,EAAA49C,EAAA59C,GAAA+e,EAAA,iBAAAjL,GACA/T,EAAA+7C,EAAAtkB,MAAAz3B,EAAAq+C,EAAAr/B,EACA,CAEA,OAAA,IAAAA,EAAAm9B,YACAn8C,EAGA+7C,EAAAuC,QAAAt+C,EACA,ChFgjVA,EAAE,CAAC,UAAU,KAAK,GAAG,CAAC,SAASkF,EAAQT,EAAOD,GiFrzV9C,IAAA+5C,EAAAr5C,EAAA,gBACA62C,EAAA72C,EAAA,WACA42C,EAAA52C,EAAA,aACAq6B,EAAA1gC,OAAAC,UAAAyC,eAEAi9C,EAAA,CACAC,SAAA,SAAAC,GACA,OAAAA,EAAA,IACA,EACAnC,MAAA,QACAoC,QAAA,SAAAD,EAAAz+C,GACA,OAAAy+C,EAAA,IAAAz+C,EAAA,GACA,EACA2+C,OAAA,SAAAF,GACA,OAAAA,CACA,GAGAh/C,EAAAN,MAAAM,QACAqH,EAAA3H,MAAAN,UAAAiI,KACA83C,EAAA,SAAA1gD,EAAA2gD,GACA/3C,EAAA3F,MAAAjD,EAAAuB,EAAAo/C,GAAAA,EAAA,CAAAA,GACA,EAEAC,EAAA7iC,KAAApd,UAAAqmB,YAEA65B,EAAAlD,EAAA,QACAE,EAAA,CACAiD,gBAAA,EACAhD,WAAA,EACAI,QAAA,QACAC,iBAAA,EACA7H,UAAA,IACAh1B,QAAA,EACAy/B,QAAAnD,EAAAt8B,OACA0/B,kBAAA,EACAx6B,OAAAq6B,EACAI,UAAAtD,EAAAH,WAAAqD,GAEAL,SAAA,EACAU,cAAA,SAAAl+B,GACA,OAAA49B,EAAA//C,KAAAmiB,EACA,EACAm+B,WAAA,EACAxC,oBAAA,GAWAyC,EAAA,CAAA,EAEAp0C,EAAA,SAAAA,EACA7J,EACAo9C,EACAc,EACAC,EACA3C,EACAwC,EACAJ,EACAQ,EACAC,EACA1D,EACAoD,EACA16B,EACAy6B,EACAD,EACA9C,EACAuD,GAOA,IALA,IA5BA5+B,EA4BAhhB,EAAAsB,EAEAu+C,EAAAD,EACAE,EAAA,EACAC,GAAA,OACA,KAAAF,EAAAA,EAAAn/C,IAAA6+C,MAAAQ,GAAA,CAEA,IAAA7pC,EAAA2pC,EAAAn/C,IAAAY,GAEA,GADAw+C,GAAA,OACA,IAAA5pC,EAAA,CACA,GAAAA,IAAA4pC,EACA,MAAA,IAAA9vC,WAAA,uBAEA+vC,GAAA,CAEA,MACA,IAAAF,EAAAn/C,IAAA6+C,KACAO,EAAA,EAEA,CAeA,GAbA,mBAAAJ,EACA1/C,EAAA0/C,EAAAhB,EAAA1+C,GACAA,aAAAkc,KACAlc,EAAAq/C,EAAAr/C,GACA,UAAAw/C,GAAA9/C,EAAAM,KACAA,EAAA+7C,EAAAkC,SAAAj+C,GAAA,SAAAE,GACA,OAAAA,aAAAgc,KACAmjC,EAAAn/C,GAEAA,CACA,KAGA,OAAAF,EAAA,CACA,GAAA88C,EACA,OAAAoC,IAAAC,EAAAD,EAAAR,EAAA1C,EAAAkD,QAAA7C,EAAA,MAAA13B,GAAA+5B,EAGA1+C,EAAA,EACA,CAEA,GArEA,iBADAghB,EAsEAhhB,IApEA,iBAAAghB,GACA,kBAAAA,GACA,WAAA5e,QAAA4e,IACA,iBAAAA,GAiEA+6B,EAAA7qC,SAAAlR,GACA,OAAAk/C,EAEA,CAAAE,EADAD,EAAAT,EAAAQ,EAAAR,EAAA1C,EAAAkD,QAAA7C,EAAA,MAAA13B,IACA,IAAAy6B,EAAAF,EAAAl/C,EAAAg8C,EAAAkD,QAAA7C,EAAA,QAAA13B,KAEA,CAAAy6B,EAAAV,GAAA,IAAAU,EAAA/8C,OAAArC,KAGA,IAMAggD,EANAC,EAAA,GAEA,QAAA,IAAAjgD,EACA,OAAAigD,EAIA,GAAA,UAAAT,GAAA9/C,EAAAM,GAEAm/C,GAAAD,IACAl/C,EAAA+7C,EAAAkC,SAAAj+C,EAAAk/C,IAEAc,EAAA,CAAA,CAAA9/C,MAAAF,EAAAJ,OAAA,EAAAI,EAAAwJ,KAAA,MAAA,UAAA,SACA,GAAA9J,EAAAggD,GACAM,EAAAN,MACA,CACA,IAAAr4C,EAAAxI,OAAAwI,KAAArH,GACAggD,EAAAL,EAAAt4C,EAAAs4C,KAAAA,GAAAt4C,CACA,CAIA,IAFA,IAAA64C,EAAAT,GAAA//C,EAAAM,IAAA,IAAAA,EAAAJ,OAAA8+C,EAAA,KAAAA,EAEA7yC,EAAA,EAAAA,EAAAm0C,EAAApgD,SAAAiM,EAAA,CACA,IAAA5L,EAAA+/C,EAAAn0C,GACA3L,EAAA,WAAAkC,QAAAnC,SAAA,IAAAA,EAAAC,MAAAD,EAAAC,MAAAF,EAAAC,GAEA,IAAAq/C,GAAA,OAAAp/C,EAAA,CAIA,IAAAigD,EAAAzgD,EAAAM,GACA,mBAAAw/C,EAAAA,EAAAU,EAAAjgD,GAAAigD,EACAA,GAAAjE,EAAA,IAAAh8C,EAAA,IAAAA,EAAA,KAEA2/C,EAAAxlC,IAAA9Y,EAAAw+C,GACA,IAAAM,EAAA7B,IACA6B,EAAAhmC,IAAAmlC,EAAAK,GACAf,EAAAoB,EAAA90C,EACAjL,EACAigD,EACAX,EACAC,EACA3C,EACAwC,EACA,UAAAE,GAAAL,GAAAz/C,EAAAM,GAAA,KAAAk/C,EACAQ,EACAC,EACA1D,EACAoD,EACA16B,EACAy6B,EACAD,EACA9C,EACA+D,GAzBA,CA2BA,CAEA,OAAAH,CACA,EAiDAx7C,EAAAD,QAAA,SAAAlD,EAAA8sC,GACA,IAGA4R,EAHAhgD,EAAAsB,EACA0d,EAjDA,SAAAovB,GACA,IAAAA,EACA,OAAA4N,EAGA,GAAA,OAAA5N,EAAA8Q,cAAA,IAAA9Q,EAAA8Q,SAAA,mBAAA9Q,EAAA8Q,QACA,MAAA,IAAA1gD,UAAA,iCAGA,IAAA69C,EAAAjO,EAAAiO,SAAAL,EAAAK,QACA,QAAA,IAAAjO,EAAAiO,SAAA,UAAAjO,EAAAiO,SAAA,eAAAjO,EAAAiO,QACA,MAAA,IAAA79C,UAAA,qEAGA,IAAAmmB,EAAAm3B,EAAA,QACA,QAAA,IAAA1N,EAAAzpB,OAAA,CACA,IAAA4a,EAAAvgC,KAAA88C,EAAAH,WAAAvN,EAAAzpB,QACA,MAAA,IAAAnmB,UAAA,mCAEAmmB,EAAAypB,EAAAzpB,MACA,CACA,IAAAy6B,EAAAtD,EAAAH,WAAAh3B,GAEA+6B,EAAA1D,EAAA0D,OAKA,OAJA,mBAAAtR,EAAAsR,QAAAhgD,EAAA0uC,EAAAsR,WACAA,EAAAtR,EAAAsR,QAGA,CACAT,eAAA,kBAAA7Q,EAAA6Q,eAAA7Q,EAAA6Q,eAAAjD,EAAAiD,eACAhD,eAAA,IAAA7N,EAAA6N,UAAAD,EAAAC,YAAA7N,EAAA6N,UACAI,QAAAA,EACAC,gBAAA,kBAAAlO,EAAAkO,gBAAAlO,EAAAkO,gBAAAN,EAAAM,gBACA7H,eAAA,IAAArG,EAAAqG,UAAAuH,EAAAvH,UAAArG,EAAAqG,UACAh1B,OAAA,kBAAA2uB,EAAA3uB,OAAA2uB,EAAA3uB,OAAAu8B,EAAAv8B,OACAy/B,QAAA,mBAAA9Q,EAAA8Q,QAAA9Q,EAAA8Q,QAAAlD,EAAAkD,QACAC,iBAAA,kBAAA/Q,EAAA+Q,iBAAA/Q,EAAA+Q,iBAAAnD,EAAAmD,iBACAO,OAAAA,EACA/6B,OAAAA,EACAy6B,UAAAA,EACAC,cAAA,mBAAAjR,EAAAiR,cAAAjR,EAAAiR,cAAArD,EAAAqD,cACAC,UAAA,kBAAAlR,EAAAkR,UAAAlR,EAAAkR,UAAAtD,EAAAsD,UACAK,KAAA,mBAAAvR,EAAAuR,KAAAvR,EAAAuR,KAAA,KACA7C,mBAAA,kBAAA1O,EAAA0O,mBAAA1O,EAAA0O,mBAAAd,EAAAc,mBAEA,CAIAuD,CAAAjS,GAKA,mBAAApvB,EAAA0gC,OAEA1/C,GADA0/C,EAAA1gC,EAAA0gC,QACA,GAAA1/C,GACAN,EAAAsf,EAAA0gC,UAEAM,EADAhhC,EAAA0gC,QAIA,IAMAY,EANAj5C,EAAA,GAEA,GAAA,WAAAjF,QAAApC,IAAA,OAAAA,EACA,MAAA,GAKAsgD,EADAlS,GAAAA,EAAAkS,eAAA9B,EACApQ,EAAAkS,YACAlS,GAAA,YAAAA,EACAA,EAAAuQ,QAAA,UAAA,SAEA,UAGA,IAAAa,EAAAhB,EAAA8B,GACA,GAAAlS,GAAA,mBAAAA,GAAA,kBAAAA,EAAAqR,eACA,MAAA,IAAAjhD,UAAA,iDAEA,IAAAihD,EAAA,UAAAD,GAAApR,GAAAA,EAAAqR,eAEAO,IACAA,EAAAnhD,OAAAwI,KAAArH,IAGAgf,EAAA2gC,MACAK,EAAAL,KAAA3gC,EAAA2gC,MAIA,IADA,IAAAC,EAAArB,IACA1+C,EAAA,EAAAA,EAAAmgD,EAAApgD,SAAAC,EAAA,CACA,IAAAI,EAAA+/C,EAAAngD,GAEAmf,EAAAsgC,WAAA,OAAAt/C,EAAAC,IAGA4+C,EAAAx3C,EAAA8D,EACAnL,EAAAC,GACAA,EACAu/C,EACAC,EACAzgC,EAAA89B,mBACA99B,EAAAsgC,UACAtgC,EAAAS,OAAAT,EAAAkgC,QAAA,KACAlgC,EAAA0gC,OACA1gC,EAAA2gC,KACA3gC,EAAAi9B,UACAj9B,EAAAqgC,cACArgC,EAAA2F,OACA3F,EAAAogC,UACApgC,EAAAmgC,iBACAngC,EAAAq9B,QACAuD,GAEA,CAEA,IAAA3M,EAAA5rC,EAAAmC,KAAAwV,EAAAy1B,WACAiK,GAAA,IAAA1/B,EAAAigC,eAAA,IAAA,GAYA,OAVAjgC,EAAAs9B,kBACA,eAAAt9B,EAAAq9B,QAEAqC,GAAA,uBAGAA,GAAA,mBAIAzL,EAAArzC,OAAA,EAAA8+C,EAAAzL,EAAA,EACA,CjF0zVA,EAAE,CAAC,YAAY,GAAG,UAAU,GAAG,eAAe,KAAK,GAAG,CAAC,SAAS/tC,EAAQT,EAAOD,GkFvnW/E,IAAAs3C,EAAA52C,EAAA,aAEAq6B,EAAA1gC,OAAAC,UAAAyC,eACA7B,EAAAN,MAAAM,QAEA6gD,EAAA,WAEA,IADA,IAAAxvC,EAAA,GACAlR,EAAA,EAAAA,EAAA,MAAAA,EACAkR,EAAAhK,KAAA,MAAAlH,EAAA,GAAA,IAAA,IAAAA,EAAAd,SAAA,KAAA6tC,eAGA,OAAA77B,CACA,CAPA,GA4BAyvC,EAAA,SAAAC,EAAAzhC,GAEA,IADA,IAAAhf,EAAAgf,GAAAA,EAAA69B,aAAAh+C,OAAAmE,OAAA,MAAA,CAAA,EACAnD,EAAA,EAAAA,EAAA4gD,EAAA7gD,SAAAC,OACA,IAAA4gD,EAAA5gD,KACAG,EAAAH,GAAA4gD,EAAA5gD,IAIA,OAAAG,CACA,EAoMAyE,EAAAD,QAAA,CACAg8C,cAAAA,EACArsB,OA3IA,SAAAvzB,EAAA6/C,GACA,OAAA5hD,OAAAwI,KAAAo5C,GAAAC,QAAA,SAAAC,EAAA1gD,GAEA,OADA0gD,EAAA1gD,GAAAwgD,EAAAxgD,GACA0gD,CACA,GAAA//C,EACA,EAuIAu9C,QAlBA,SAAA/4C,EAAA4G,GACA,MAAA,GAAA9D,OAAA9C,EAAA4G,EACA,EAiBAsyC,QAvDA,SAAAp+C,GAIA,IAHA,IAAAs3C,EAAA,CAAA,CAAAx3C,IAAA,CAAAvB,EAAAyB,GAAA0gD,KAAA,MACAC,EAAA,GAEAhhD,EAAA,EAAAA,EAAA23C,EAAA53C,SAAAC,EAKA,IAJA,IAAAihD,EAAAtJ,EAAA33C,GACAG,EAAA8gD,EAAA9gD,IAAA8gD,EAAAF,MAEAv5C,EAAAxI,OAAAwI,KAAArH,GACA6L,EAAA,EAAAA,EAAAxE,EAAAzH,SAAAiM,EAAA,CACA,IAAA5L,EAAAoH,EAAAwE,GACA6G,EAAA1S,EAAAC,GACA,WAAAmC,QAAAsQ,IAAA,OAAAA,IAAA,IAAAmuC,EAAAn3C,QAAAgJ,KACA8kC,EAAAzwC,KAAA,CAAA/G,IAAAA,EAAA4gD,KAAA3gD,IACA4gD,EAAA95C,KAAA2L,GAEA,CAKA,OAlMA,SAAA8kC,GACA,KAAAA,EAAA53C,OAAA,GAAA,CACA,IAAAkhD,EAAAtJ,EAAA1wC,MACA9G,EAAA8gD,EAAA9gD,IAAA8gD,EAAAF,MAEA,GAAAlhD,EAAAM,GAAA,CAGA,IAFA,IAAA+gD,EAAA,GAEAl1C,EAAA,EAAAA,EAAA7L,EAAAJ,SAAAiM,OACA,IAAA7L,EAAA6L,IACAk1C,EAAAh6C,KAAA/G,EAAA6L,IAIAi1C,EAAA9gD,IAAA8gD,EAAAF,MAAAG,CACA,CACA,CACA,CA+KAC,CAAAxJ,GAEAt3C,CACA,EAkCAgf,OAvIA,SAAAnL,EAAAyoC,EAAAH,GACA,IAAA4E,EAAAltC,EAAAhF,QAAA,MAAA,KACA,GAAA,eAAAstC,EAEA,OAAA4E,EAAAlyC,QAAA,iBAAAmyC,UAGA,IACA,OAAA3gC,mBAAA0gC,EACA,CAAA,MAAA58C,GACA,OAAA48C,CACA,CACA,EA4HAxhC,OA1HA,SAAA1L,EAAAotC,EAAA9E,EAAA+E,EAAAz8B,GAGA,GAAA,IAAA5Q,EAAAnU,OACA,OAAAmU,EAGA,IAAA3D,EAAA2D,EAOA,GANA,WAAA3R,QAAA2R,GACA3D,EAAA5Q,OAAAV,UAAAC,SAAAC,KAAA+U,GACA,iBAAAA,IACA3D,EAAA/N,OAAA0R,IAGA,eAAAsoC,EACA,OAAAgF,OAAAjxC,GAAArB,QAAA,mBAAA,SAAAguC,GACA,MAAA,SAAArpC,SAAAqpC,EAAA99C,MAAA,GAAA,IAAA,KACA,IAIA,IADA,IAAAiY,EAAA,GACArX,EAAA,EAAAA,EAAAuQ,EAAAxQ,SAAAC,EAAA,CACA,IAAAoF,EAAAmL,EAAArH,WAAAlJ,GAGA,KAAAoF,GACA,KAAAA,GACA,KAAAA,GACA,MAAAA,GACAA,GAAA,IAAAA,GAAA,IACAA,GAAA,IAAAA,GAAA,IACAA,GAAA,IAAAA,GAAA,KACA0f,IAAAm3B,EAAAF,UAAA,KAAA32C,GAAA,KAAAA,GAEAiS,GAAA9G,EAAA7E,OAAA1L,GAIAoF,EAAA,IACAiS,GAAAqpC,EAAAt7C,GAIAA,EAAA,KACAiS,GAAAqpC,EAAA,IAAAt7C,GAAA,GAAAs7C,EAAA,IAAA,GAAAt7C,GAIAA,EAAA,OAAAA,GAAA,MACAiS,GAAAqpC,EAAA,IAAAt7C,GAAA,IAAAs7C,EAAA,IAAAt7C,GAAA,EAAA,IAAAs7C,EAAA,IAAA,GAAAt7C,IAIApF,GAAA,EACAoF,EAAA,QAAA,KAAAA,IAAA,GAAA,KAAAmL,EAAArH,WAAAlJ,IAEAqX,GAAAqpC,EAAA,IAAAt7C,GAAA,IACAs7C,EAAA,IAAAt7C,GAAA,GAAA,IACAs7C,EAAA,IAAAt7C,GAAA,EAAA,IACAs7C,EAAA,IAAA,GAAAt7C,GACA,CAEA,OAAAiS,CACA,EA4DAhG,SA9BA,SAAAlR,GACA,SAAAA,GAAA,WAAAoC,QAAApC,QAIAA,EAAAd,aAAAc,EAAAd,YAAAgS,UAAAlR,EAAAd,YAAAgS,SAAAlR,GACA,EAyBAuuC,SAnCA,SAAAvuC,GACA,MAAA,oBAAAnB,OAAAC,UAAAC,SAAAC,KAAAgB,EACA,EAkCAi+C,SApBA,SAAAvrC,EAAA5M,GACA,GAAApG,EAAAgT,GAAA,CAEA,IADA,IAAA4uC,EAAA,GACAzhD,EAAA,EAAAA,EAAA6S,EAAA9S,OAAAC,GAAA,EACAyhD,EAAAv6C,KAAAjB,EAAA4M,EAAA7S,KAEA,OAAAyhD,CACA,CACA,OAAAx7C,EAAA4M,EACA,EAYA+kB,MA5MA,SAAAA,EAAA72B,EAAA6/C,EAAAzhC,GAEA,IAAAyhC,EACA,OAAA7/C,EAGA,GAAA,WAAAwB,QAAAq+C,GAAA,CACA,GAAA/gD,EAAAkB,GACAA,EAAAmG,KAAA05C,OACA,KAAA7/C,GAAA,WAAAwB,QAAAxB,GAKA,MAAA,CAAAA,EAAA6/C,IAJAzhC,IAAAA,EAAA69B,cAAA79B,EAAAk9B,mBAAA3c,EAAAvgC,KAAAH,OAAAC,UAAA2hD,MACA7/C,EAAA6/C,IAAA,EAIA,CAEA,OAAA7/C,CACA,CAEA,IAAAA,GAAA,WAAAwB,QAAAxB,GACA,MAAA,CAAAA,GAAAsH,OAAAu4C,GAGA,IAAAc,EAAA3gD,EAKA,OAJAlB,EAAAkB,KAAAlB,EAAA+gD,KACAc,EAAAf,EAAA5/C,EAAAoe,IAGAtf,EAAAkB,IAAAlB,EAAA+gD,IACAA,EAAAr7B,SAAA,SAAA07B,EAAAjhD,GACA,GAAA0/B,EAAAvgC,KAAA4B,EAAAf,GAAA,CACA,IAAA2hD,EAAA5gD,EAAAf,GACA2hD,GAAA,WAAAp/C,QAAAo/C,IAAAV,GAAA,WAAA1+C,QAAA0+C,GACAlgD,EAAAf,GAAA43B,EAAA+pB,EAAAV,EAAA9hC,GAEApe,EAAAmG,KAAA+5C,EAEA,MACAlgD,EAAAf,GAAAihD,CAEA,IACAlgD,GAGA/B,OAAAwI,KAAAo5C,GAAAC,QAAA,SAAAC,EAAA1gD,GACA,IAAAC,EAAAugD,EAAAxgD,GAOA,OALAs/B,EAAAvgC,KAAA2hD,EAAA1gD,GACA0gD,EAAA1gD,GAAAw3B,EAAAkpB,EAAA1gD,GAAAC,EAAA8e,GAEA2hC,EAAA1gD,GAAAC,EAEAygD,CACA,GAAAY,EACA,ElFkxWA,EAAE,CAAC,YAAY,KAAK,GAAG,CAAC,SAASr8C,EAAQT,EAAOD,GmF71WhD,SAAAjD,EAAAvB,EAAA4gD,GACA,OAAA/hD,OAAAC,UAAAyC,eAAAvC,KAAAgB,EAAA4gD,EACA,CAEAn8C,EAAAD,QAAA,SAAAi9C,EAAAnN,EAAAxnC,EAAAkS,GACAs1B,EAAAA,GAAA,IACAxnC,EAAAA,GAAA,IACA,IAAA9M,EAAA,CAAA,EAEA,GAAA,iBAAAyhD,GAAA,IAAAA,EAAA7hD,OACA,OAAAI,EAGA,IAAA0hD,EAAA,MACAD,EAAAA,EAAAjnC,MAAA85B,GAEA,IAAAqN,EAAA,IACA3iC,GAAA,iBAAAA,EAAA2iC,UACAA,EAAA3iC,EAAA2iC,SAGA,IAAAhiD,EAAA8hD,EAAA7hD,OAEA+hD,EAAA,GAAAhiD,EAAAgiD,IACAhiD,EAAAgiD,GAGA,IAAA,IAAA9hD,EAAA,EAAAA,EAAAF,IAAAE,EAAA,CACA,IAEA+hD,EAAAC,EAAAv6C,EAAA0Z,EAFApW,EAAA62C,EAAA5hD,GAAAkP,QAAA2yC,EAAA,OACAI,EAAAl3C,EAAAlB,QAAAoD,GAGAg1C,GAAA,GACAF,EAAAh3C,EAAA+I,OAAA,EAAAmuC,GACAD,EAAAj3C,EAAA+I,OAAAmuC,EAAA,KAEAF,EAAAh3C,EACAi3C,EAAA,IAGAv6C,EAAAiZ,mBAAAqhC,GACA5gC,EAAAT,mBAAAshC,GAEAtgD,EAAAvB,EAAAsH,GAEA5H,EAAAM,EAAAsH,IACAtH,EAAAsH,GAAAP,KAAAia,GAEAhhB,EAAAsH,GAAA,CAAAtH,EAAAsH,GAAA0Z,GAJAhhB,EAAAsH,GAAA0Z,CAMA,CAEA,OAAAhhB,CACA,EAEA,IAAAN,EAAAN,MAAAM,SAAA,SAAAwwC,GACA,MAAA,mBAAArxC,OAAAC,UAAAC,SAAAC,KAAAkxC,EACA,CnF03WA,EAAE,CAAC,GAAG,GAAG,CAAC,SAAShrC,EAAQT,EAAOD,GoFt7WlC,IAAAu9C,EAAA,SAAA/gC,GACA,OAAA5e,QAAA4e,IACA,IAAA,SACA,OAAAA,EAEA,IAAA,UACA,OAAAA,EAAA,OAAA,QAEA,IAAA,SACA,OAAAjK,SAAAiK,GAAAA,EAAA,GAEA,QACA,MAAA,GAEA,EAEAvc,EAAAD,QAAA,SAAAxE,EAAAs0C,EAAAxnC,EAAA3N,GAOA,OANAm1C,EAAAA,GAAA,IACAxnC,EAAAA,GAAA,IACA,OAAA9M,IACAA,OAAA0C,GAGA,WAAAN,QAAApC,GACA85C,EAAAkI,EAAAhiD,IAAA,SAAAsH,GACA,IAAA26C,EAAAzhC,mBAAAuhC,EAAAz6C,IAAAwF,EACA,OAAApN,EAAAM,EAAAsH,IACAwyC,EAAA95C,EAAAsH,IAAA,SAAA0Z,GACA,OAAAihC,EAAAzhC,mBAAAuhC,EAAA/gC,GACA,IAAAxX,KAAA8qC,GAEA2N,EAAAzhC,mBAAAuhC,EAAA/hD,EAAAsH,IAEA,IAAAkC,KAAA8qC,GAIAn1C,EACAqhB,mBAAAuhC,EAAA5iD,IAAA2N,EACA0T,mBAAAuhC,EAAA/hD,IAFA,EAGA,EAEA,IAAAN,EAAAN,MAAAM,SAAA,SAAAwwC,GACA,MAAA,mBAAArxC,OAAAC,UAAAC,SAAAC,KAAAkxC,EACA,EAEA,SAAA4J,EAAA5J,EAAA3rC,GACA,GAAA2rC,EAAA4J,IAAA,OAAA5J,EAAA4J,IAAAv1C,GAEA,IADA,IAAA5B,EAAA,GACA9C,EAAA,EAAAA,EAAAqwC,EAAAtwC,OAAAC,IACA8C,EAAAoE,KAAAxC,EAAA2rC,EAAArwC,GAAAA,IAEA,OAAA8C,CACA,CAEA,IAAAq/C,EAAAnjD,OAAAwI,MAAA,SAAArH,GACA,IAAA2C,EAAA,GACA,IAAA,IAAA1C,KAAAD,EACAnB,OAAAC,UAAAyC,eAAAvC,KAAAgB,EAAAC,IAAA0C,EAAAoE,KAAA9G,GAEA,OAAA0C,CACA,CpFg9WA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASuC,EAAQT,EAAOD,GqFliXlCA,EAAA0a,OAAA1a,EAAA0K,MAAAhK,EAAA,YACAV,EAAAib,OAAAjb,EAAA2G,UAAAjG,EAAA,WrFuiXA,EAAE,CAAC,WAAW,GAAG,WAAW,KAAK,GAAG,CAAC,SAASA,EAAQT,EAAOD,uFsFxiX7D,IAAAsM,EAAA5L,EAAA,UACAsK,EAAAsB,EAAAtB,OAGA,SAAA0yC,EAAAxnC,EAAAC,GACA,IAAA,IAAA1a,KAAAya,EACAC,EAAA1a,GAAAya,EAAAza,EAEA,CASA,SAAAkiD,EAAAjgD,EAAAgO,EAAAtQ,GACA,OAAA4P,EAAAtN,EAAAgO,EAAAtQ,EACA,CAVA4P,EAAAnQ,MAAAmQ,EAAAI,OAAAJ,EAAAW,aAAAX,EAAAsG,gBACArR,EAAAD,QAAAsM,GAGAoxC,EAAApxC,EAAAtM,GACAA,EAAAgL,OAAA2yC,GAOAA,EAAArjD,UAAAD,OAAAmE,OAAAwM,EAAA1Q,WAGAojD,EAAA1yC,EAAA2yC,GAEAA,EAAA9iD,KAAA,SAAA6C,EAAAgO,EAAAtQ,GACA,GAAA,iBAAAsC,EACA,MAAA,IAAA1D,UAAA,iCAEA,OAAAgR,EAAAtN,EAAAgO,EAAAtQ,EACA,EAEAuiD,EAAAvyC,MAAA,SAAA8B,EAAAmE,EAAAxF,GACA,GAAA,iBAAAqB,EACA,MAAA,IAAAlT,UAAA,6BAEA,IAAAyR,EAAAT,EAAAkC,GAUA,YATAhP,IAAAmT,EACA,iBAAAxF,EACAJ,EAAA4F,KAAAA,EAAAxF,GAEAJ,EAAA4F,KAAAA,GAGA5F,EAAA4F,KAAA,GAEA5F,CACA,EAEAkyC,EAAAhyC,YAAA,SAAAuB,GACA,GAAA,iBAAAA,EACA,MAAA,IAAAlT,UAAA,6BAEA,OAAAgR,EAAAkC,EACA,EAEAywC,EAAArsC,gBAAA,SAAApE,GACA,GAAA,iBAAAA,EACA,MAAA,IAAAlT,UAAA,6BAEA,OAAAsS,EAAAnB,WAAA+B,EACA,CtF6iXA,EAAE,CAACZ,OAAS,KAAK,GAAG,CAAC,SAAS5L,EAAQT,EAAOD,GuF3mX7C,IAAA2Z,EAAAjZ,EAAA,iBACAk9C,EAAAl9C,EAAA,uBACAsR,EAAAtR,EAAA,kBAEAg2B,EAAA/c,EAAA,eACAkkC,EAAAlkC,EAAA,aAAA,GACAmkC,EAAAnkC,EAAA,SAAA,GAEAokC,EAAAH,EAAA,yBAAA,GACAI,EAAAJ,EAAA,yBAAA,GACAK,EAAAL,EAAA,yBAAA,GACAM,EAAAN,EAAA,qBAAA,GACAO,EAAAP,EAAA,qBAAA,GACAQ,EAAAR,EAAA,qBAAA,GAUAS,EAAA,SAAA5sC,EAAAhW,GACA,IAAA,IAAA6iD,EAAA3T,EAAAl5B,EAAA,QAAA6sC,EAAA3T,EAAAppC,MAAAopC,EAAA2T,EACA,GAAAA,EAAA7iD,MAAAA,EAIA,OAHAkvC,EAAAppC,KAAA+8C,EAAA/8C,KACA+8C,EAAA/8C,KAAAkQ,EAAAlQ,KACAkQ,EAAAlQ,KAAA+8C,EACAA,CAGA,EAuBAr+C,EAAAD,QAAA,WACA,IAAAu+C,EACA1/B,EACA2/B,EACAC,EAAA,CACAC,OAAA,SAAAjjD,GACA,IAAAgjD,EAAA1jB,IAAAt/B,GACA,MAAA,IAAAi7B,EAAA,iCAAA1kB,EAAAvW,GAEA,EACAS,IAAA,SAAAT,GACA,GAAAoiD,GAAApiD,IAAA,WAAAmC,QAAAnC,IAAA,mBAAAA,IACA,GAAA8iD,EACA,OAAAR,EAAAQ,EAAA9iD,QAEA,GAAAqiD,GACA,GAAAj/B,EACA,OAAAq/B,EAAAr/B,EAAApjB,QAGA,GAAA+iD,EACA,OA1CA,SAAAG,EAAAljD,GACA,IAAAmjD,EAAAP,EAAAM,EAAAljD,GACA,OAAAmjD,GAAAA,EAAAljD,KACA,CAuCAmjD,CAAAL,EAAA/iD,EAGA,EACAs/B,IAAA,SAAAt/B,GACA,GAAAoiD,GAAApiD,IAAA,WAAAmC,QAAAnC,IAAA,mBAAAA,IACA,GAAA8iD,EACA,OAAAN,EAAAM,EAAA9iD,QAEA,GAAAqiD,GACA,GAAAj/B,EACA,OAAAu/B,EAAAv/B,EAAApjB,QAGA,GAAA+iD,EACA,OAxCA,SAAAG,EAAAljD,GACA,QAAA4iD,EAAAM,EAAAljD,EACA,CAsCAqjD,CAAAN,EAAA/iD,GAGA,OAAA,CACA,EACAma,IAAA,SAAAna,EAAAC,GACAmiD,GAAApiD,IAAA,WAAAmC,QAAAnC,IAAA,mBAAAA,IACA8iD,IACAA,EAAA,IAAAV,GAEAG,EAAAO,EAAA9iD,EAAAC,IACAoiD,GACAj/B,IACAA,EAAA,IAAAi/B,GAEAK,EAAAt/B,EAAApjB,EAAAC,KAEA8iD,IAMAA,EAAA,CAAA/iD,IAAA,CAAA,EAAA8F,KAAA,OA5EA,SAAAo9C,EAAAljD,EAAAC,GACA,IAAAkjD,EAAAP,EAAAM,EAAAljD,GACAmjD,EACAA,EAAAljD,MAAAA,EAGAijD,EAAAp9C,KAAA,CACA9F,IAAAA,EACA8F,KAAAo9C,EAAAp9C,KACA7F,MAAAA,EAGA,CAkEAqjD,CAAAP,EAAA/iD,EAAAC,GAEA,GAEA,OAAA+iD,CACA,CvFgnXA,EAAE,CAAC,sBAAsB,GAAG,gBAAgB,GAAG,iBAAiB,KAAK,GAAG,CAAC,SAAS/9C,EAAQT,EAAOD,IACjG,SAAWgL,IAAQ,iGwF3uXnB/K,EAAAD,QAAA,SAAAg/C,EAAA99C,GACA,IAAA+9C,EAAA,GACAD,EAAAh5B,GAAA,QAAA,SAAAk5B,GACAD,EAAA18C,KAAA28C,EACA,IACAF,EAAAx9C,KAAA,OAAA,WACAN,GAAAA,EAAA,KAAA8J,EAAAtH,OAAAu7C,IACA/9C,EAAA,IACA,IACA89C,EAAAx9C,KAAA,SAAA,SAAAS,GACAf,GAAAA,EAAAe,GACAf,EAAA,IACA,GACA,CxF+uXC,GAAE1G,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,UAAUsK,OAE5C,EAAE,CAACsB,OAAS,KAAK,GAAG,CAAC,SAAS5L,EAAQT,EAAOD,IAC7C,SAAWgL,IAAQ,8FyF/vXnB/K,EAAAD,QAAAm/C,EAEA,IAAAz7C,EAAAhD,EAAA,iBACA0+C,EAAA1+C,EAAA,uBACA66B,EAAA76B,EAAA,QACA+6B,EAAA/6B,EAAA,SACAc,EAAAd,EAAA,QACA2+C,EAAA3+C,EAAA,eACA86B,EAAA96B,EAAA,OAEA4+C,EAAA,SAAArlD,GAAA,OAAA,OAAAA,GAAA,WAAA2D,QAAA3D,IAAA,mBAAAA,EAAAslD,IAAA,EAEA,SAAAJ,EAAAvV,EAAA1oC,GAIA,GAHA0oC,EAAAvvC,OAAAs1B,OAAA,CAAA6vB,aAAA,IAAA,iBAAA5V,EAAA,CAAApO,IAAAoO,GAAAA,GACA1oC,EAAAM,EAAAN,GAEA0oC,EAAApO,IAAA,CACA,IAAAikB,EAAAjkB,EAAA9wB,MAAAk/B,EAAApO,KAAAkkB,EAAAD,EAAAC,SAAAC,EAAAF,EAAAE,KAAA/jB,EAAA6jB,EAAA7jB,SAAAgkB,EAAAH,EAAAG,KAAAtkC,EAAAmkC,EAAAnkC,YACAsuB,EAAApO,IACAkkB,GAAAC,GAAA/jB,GAAAgkB,EACAvlD,OAAAs1B,OAAAia,EAAA,CAAA8V,SAAAA,EAAAC,KAAAA,EAAA/jB,SAAAA,EAAAgkB,KAAAA,EAAAtkC,KAAAA,IADAsuB,EAAAtuB,KAAAA,CAEA,CAEA,IAIAukC,EAJAC,EAAA,CAAA,kBAAA,iBACAlW,EAAAkW,SAAAzlD,OAAAwI,KAAA+mC,EAAAkW,SAAAl/B,SAAA,SAAA9d,GAAA,OAAAg9C,EAAAh9C,EAAAyK,eAAAq8B,EAAAkW,QAAAh9C,EAAA,IACA8mC,EAAAkW,QAAAA,EAGAlW,EAAAiW,KACAA,EAAAjW,EAAAmW,OAAAT,EAAA1V,EAAAiW,MAAA7zB,KAAArlB,UAAAijC,EAAAiW,MAAAjW,EAAAiW,KACAjW,EAAAoW,OACAH,EAAA,iBAAAjW,EAAAoW,KAAApW,EAAAoW,KAAAX,EAAA14C,UAAAijC,EAAAoW,MACApW,EAAAkW,QAAA,gBAAA,qCAGAD,IACAjW,EAAAqW,SAAArW,EAAAqW,OAAA,QACAX,EAAAO,KAAAjW,EAAAkW,QAAA,kBAAA90C,EAAArH,WAAAk8C,IACAjW,EAAAmW,OAAAnW,EAAAoW,OAAApW,EAAAkW,QAAA,gBAAA,4BAEAlW,EAAAiW,YAAAjW,EAAAoW,KAEApW,EAAAmW,OAAAnW,EAAAkW,QAAAI,OAAA,oBACAtW,EAAAqW,SAAArW,EAAAqW,OAAArW,EAAAqW,OAAA7X,eAEA,IAAA+X,EAAAvW,EAAA8V,SAEAU,GADA,WAAAxW,EAAAhO,SAAAH,EAAAF,GACAM,QAAA+N,GAAA,SAAAzrC,GACA,IAAA,IAAAyrC,EAAAyW,iBAAAliD,EAAAmiD,YAAA,KAAAniD,EAAAmiD,WAAA,KAAAniD,EAAA2hD,QAAAS,SAAA,CACA3W,EAAApO,IAAAr9B,EAAA2hD,QAAAS,gBACA3W,EAAAkW,QAAAU,KACAriD,EAAAsiD,SAEA,IAAAC,EAAAllB,EAAA9wB,MAAAk/B,EAAApO,KAAAkkB,SAYA,OAVA,OAAAgB,GAAAA,IAAAP,WACAvW,EAAAkW,QAAAa,cACA/W,EAAAkW,QAAAc,eAGA,SAAAhX,EAAAqW,QAAA,CAAA,IAAA,KAAA3tC,SAAAnU,EAAAmiD,cACA1W,EAAAqW,OAAA,aACArW,EAAAkW,QAAA,yBAAAlW,EAAAkW,QAAA,iBAGA,GAAAlW,EAAA4V,eAAAt+C,EAAA,IAAAL,MAAA,uBACAs+C,EAAAvV,EAAA1oC,EACA,CAEA,IAAA2/C,EAAA,mBAAAzB,GAAA,SAAAxV,EAAAqW,OACA/+C,EAAA,KAAA2/C,EAAAzB,EAAAjhD,GAAAA,EACA,IAUA,OATAiiD,EAAAp6B,GAAA,WAAA,WACAo6B,EAAAU,QACA5/C,EAAA,IAAAL,MAAA,qBACA,IACAu/C,EAAAp6B,GAAA,QAAA9kB,GAEAo+C,EAAAO,GAAAA,EAAA75B,GAAA,QAAA9kB,GAAAq+C,KAAAa,GACAA,EAAAh7C,IAAAy6C,GAEAO,CACA,CAEAjB,EAAAz7C,OAAA,SAAAkmC,EAAA1oC,GACA,OAAAi+C,EAAAvV,GAAA,SAAA3nC,EAAA9D,GACA,GAAA8D,EAAA,OAAAf,EAAAe,GACAyB,EAAAvF,GAAA,SAAA8D,EAAA8K,GACA,GAAA9K,EAAA,OAAAf,EAAAe,GACA,GAAA2nC,EAAAmW,KACA,IACAhzC,EAAAif,KAAAthB,MAAAqC,EAAAxS,WACA,CAAA,MAAA0H,GACA,OAAAf,EAAAe,EAAA9D,EAAA4O,EACA,CAEA7L,EAAA,KAAA/C,EAAA4O,EACA,GACA,GACA,EAEA,CAAA,MAAA,OAAA,MAAA,QAAA,OAAA,UAAA6T,SAAA,SAAAq/B,GACAd,EAAAc,GAAA,SAAArW,EAAA1oC,GAEA,MADA,iBAAA0oC,IAAAA,EAAA,CAAApO,IAAAoO,IACAuV,EAAA9kD,OAAAs1B,OAAA,CAAAswB,OAAAA,EAAA7X,eAAAwB,GAAA1oC,EACA,CACA,GzFmwXC,GAAE1G,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,UAAUsK,OAE5C,EAAE,CAACsB,OAAS,GAAG,sBAAsB,GAAGivB,KAAO,GAAGE,MAAQ,GAAGj6B,KAAO,GAAG69C,YAAc,GAAG,gBAAgB,GAAG7jB,IAAM,MAAM,GAAG,CAAC,SAAS96B,EAAQT,EAAOD,IACnJ,SAAWK,IAAQ,W0Fj3XnB,IAAA0gD,EAAArgD,EAAA,iBACAsgD,EAAAtgD,EAAA,kBACAmgB,EAAAngB,EAAA,SACAugD,EAAAvgD,EAAA,wBACA86B,EAAA96B,EAAA,OAEA66B,EAAAv7B,EAEAu7B,EAAAM,QAAA,SAAA+N,EAAA1oC,GAEA0oC,EADA,iBAAAA,EACApO,EAAA9wB,MAAAk/B,GAEA/oB,EAAA+oB,GAKA,IAAAsX,GAAA,IAAA7gD,EAAAkgD,SAAA3kB,SAAApxB,OAAA,aAAA,QAAA,GAEAoxB,EAAAgO,EAAAhO,UAAAslB,EACAV,EAAA5W,EAAA8V,UAAA9V,EAAA4W,KACAb,EAAA/V,EAAA+V,KACArkC,EAAAsuB,EAAAtuB,MAAA,IAGAklC,IAAA,IAAAA,EAAAt7C,QAAA,OACAs7C,EAAA,IAAAA,EAAA,KAGA5W,EAAApO,KAAAglB,EAAA5kB,EAAA,KAAA4kB,EAAA,KAAAb,EAAA,IAAAA,EAAA,IAAArkC,EACAsuB,EAAAqW,QAAArW,EAAAqW,QAAA,OAAA7X,cACAwB,EAAAkW,QAAAlW,EAAAkW,SAAA,CAAA,EAIA,IAAAM,EAAA,IAAAW,EAAAnX,GAGA,OAFA1oC,GACAk/C,EAAAp6B,GAAA,WAAA9kB,GACAk/C,CACA,EAEA7kB,EAAAr/B,IAAA,SAAA0tC,EAAA1oC,GACA,IAAAk/C,EAAA7kB,EAAAM,QAAA+N,EAAA1oC,GAEA,OADAk/C,EAAAh7C,MACAg7C,CACA,EAEA7kB,EAAAwlB,cAAAA,EACAxlB,EAAA4lB,gBAAAH,EAAAG,gBAEA5lB,EAAA6lB,MAAA,WAAA,EACA7lB,EAAA6lB,MAAAC,kBAAA,EAEA9lB,EAAA+lB,YAAA,IAAA/lB,EAAA6lB,MAEA7lB,EAAAgmB,aAAAN,EAEA1lB,EAAAimB,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,c1Fo3XC,GAAEhnD,KAAKqC,KAAM,GAAErC,KAAKqC,KAAuB,oBAAXwD,OAAyBA,OAAyB,oBAATf,KAAuBA,KAAyB,oBAAXc,OAAyBA,OAAS,CAAC,EAElJ,EAAE,CAAC,gBAAgB,GAAG,iBAAiB,GAAG,uBAAuB,GAAGo7B,IAAM,IAAIimB,MAAQ,MAAM,GAAG,CAAC,SAAS/gD,EAAQT,EAAOD,IACxH,SAAWK,IAAQ,W2Fj8XnB,IAAAqhD,EACA,SAAAC,IAEA,QAAAzjD,IAAAwjD,EAAA,OAAAA,EAEA,GAAArhD,EAAAuhD,eAAA,CACAF,EAAA,IAAArhD,EAAAuhD,eAIA,IACAF,EAAAG,KAAA,MAAAxhD,EAAAyhD,eAAA,IAAA,sBACA,CAAA,MAAAjiD,GACA6hD,EAAA,IACA,CACA,MAEAA,EAAA,KAEA,OAAAA,CACA,CAEA,SAAAK,EAAAj1C,GACA,IAAA40C,EAAAC,IACA,IAAAD,EAAA,OAAA,EACA,IAEA,OADAA,EAAAM,aAAAl1C,EACA40C,EAAAM,eAAAl1C,CACA,CAAA,MAAAjN,GAAA,CACA,OAAA,CACA,CAeA,SAAAoiD,EAAAvmD,GACA,MAAA,mBAAAA,CACA,CAxDAsE,EAAAkiD,MAAAD,EAAA5hD,EAAA6hD,QAAAD,EAAA5hD,EAAA8hD,gBAEAniD,EAAAoiD,eAAAH,EAAA5hD,EAAAgiD,gBAEAriD,EAAAsiD,gBAAAL,EAAA5hD,EAAAkiD,iBAuCAviD,EAAAwiD,YAAAxiD,EAAAkiD,OAAAH,EAAA,eAIA/hD,EAAAyiD,UAAAziD,EAAAkiD,OAAAH,EAAA,aACA/hD,EAAA0iD,uBAAA1iD,EAAAkiD,OAAAH,EAAA,2BAIA/hD,EAAA2iD,iBAAA3iD,EAAAkiD,SAAAP,KAAAM,EAAAN,IAAAgB,kBAMAjB,EAAA,I3F68XC,GAAElnD,KAAKqC,KAAM,GAAErC,KAAKqC,KAAuB,oBAAXwD,OAAyBA,OAAyB,oBAATf,KAAuBA,KAAyB,oBAAXc,OAAyBA,OAAS,CAAC,EAElJ,EAAE,CAAC,GAAG,GAAG,CAAC,SAASM,EAAQT,EAAOD,IAClC,SAAWyxB,EAAQpxB,EAAO2K,IAAQ,W4F1gYlC,IAAA43C,EAAAliD,EAAA,gBACAmiD,EAAAniD,EAAA,YACAsgD,EAAAtgD,EAAA,cACAs+C,EAAAt+C,EAAA,mBAEAygD,EAAAH,EAAAG,gBACA2B,EAAA9B,EAAA+B,YAgBA,IAAAhC,EAAA9gD,EAAAD,QAAA,SAAA4pC,GACA,IAYAoZ,EAZA1jD,EAAAzC,KACAmiD,EAAAiE,SAAAzoD,KAAA8E,GAEAA,EAAA4jD,MAAAtZ,EACAtqC,EAAA6jD,MAAA,GACA7jD,EAAA8jD,SAAA,CAAA,EACAxZ,EAAAgW,MACAtgD,EAAA+jD,UAAA,gBAAA,SAAAr4C,EAAAnQ,KAAA+uC,EAAAgW,MAAArlD,SAAA,WACAF,OAAAwI,KAAA+mC,EAAAkW,SAAAl/B,SAAA,SAAAjmB,GACA2E,EAAA+jD,UAAA1oD,EAAAivC,EAAAkW,QAAAnlD,GACA,IAGA,IAAA2oD,GAAA,EACA,GAAA,kBAAA1Z,EAAA2Z,MAAA,mBAAA3Z,IAAAgZ,EAAAN,gBAEAgB,GAAA,EACAN,GAAA,OACA,GAAA,qBAAApZ,EAAA2Z,KAGAP,GAAA,OACA,GAAA,6BAAApZ,EAAA2Z,KAEAP,GAAAJ,EAAAD,qBACA,IAAA/Y,EAAA2Z,MAAA,YAAA3Z,EAAA2Z,MAAA,gBAAA3Z,EAAA2Z,KAIA,MAAA,IAAA1iD,MAAA,+BAFAmiD,GAAA,CAGA,CACA1jD,EAAAkkD,MA9CA,SAAAR,EAAAM,GACA,OAAAV,EAAAV,OAAAoB,EACA,QACAV,EAAAF,sBACA,0BACAE,EAAAH,SACA,YACAG,EAAAJ,aAAAQ,EACA,cAEA,MAEA,CAkCAS,CAAAT,EAAAM,GACAhkD,EAAAokD,YAAA,KACApkD,EAAAqkD,eAAA,KACArkD,EAAAskD,aAAA,KAEAtkD,EAAA0mB,GAAA,UAAA,WACA1mB,EAAAukD,WACA,GACA,EAEAhB,EAAA9B,EAAA/B,EAAAiE,UAEAlC,EAAAzmD,UAAA+oD,UAAA,SAAA1oD,EAAAe,GACA,IACAooD,EAAAnpD,EAAA4S,eAIA,IAAAw2C,EAAA7+C,QAAA4+C,KALAjnD,KAQAumD,SAAAU,GAAA,CACAnpD,KAAAA,EACAe,MAAAA,GAEA,EAEAqlD,EAAAzmD,UAAA0pD,UAAA,SAAArpD,GACA,IAAAspD,EAAApnD,KAAAumD,SAAAzoD,EAAA4S,eACA,OAAA02C,EACAA,EAAAvoD,MACA,IACA,EAEAqlD,EAAAzmD,UAAA4pD,aAAA,SAAAvpD,UACAkC,KACAumD,SAAAzoD,EAAA4S,cACA,EAEAwzC,EAAAzmD,UAAAupD,UAAA,WACA,IAAAvkD,EAAAzC,KAEA,IAAAyC,EAAA6kD,WAAA,CAEA,IAAAva,EAAAtqC,EAAA4jD,MAEA,YAAAtZ,GAAA,IAAAA,EAAAyJ,SACA/zC,EAAAgE,WAAAsmC,EAAAyJ,SAGA,IAAA+Q,EAAA9kD,EAAA8jD,SACAvD,EAAA,KACA,QAAAjW,EAAAqW,QAAA,SAAArW,EAAAqW,SACAJ,EAAA,IAAAwE,KAAA/kD,EAAA6jD,MAAA,CACAr2C,MAAAs3C,EAAA,iBAAA,CAAA,GAAA1oD,OAAA,MAKA,IAAA4oD,EAAA,GAaA,GAZAjqD,OAAAwI,KAAAuhD,GAAAxjC,SAAA,SAAA2jC,GACA,IAAA5pD,EAAAypD,EAAAG,GAAA5pD,KACAe,EAAA0oD,EAAAG,GAAA7oD,MACAd,MAAAM,QAAAQ,GACAA,EAAAklB,SAAA,SAAApE,GACA8nC,EAAA/hD,KAAA,CAAA5H,EAAA6hB,GACA,IAEA8nC,EAAA/hD,KAAA,CAAA5H,EAAAe,GAEA,IAEA,UAAA4D,EAAAkkD,MAAA,CACA,IAAAgB,EAAA,KACA,GAAA5B,EAAAN,gBAAA,CACA,IAAAmC,EAAA,IAAAlC,gBACAiC,EAAAC,EAAAD,OACAllD,EAAAolD,sBAAAD,EAEA,mBAAA7a,GAAA,IAAAA,EAAA+a,iBACArlD,EAAAokD,YAAArjD,EAAAiD,YAAA,WACAhE,EAAA0nB,KAAA,kBACA1nB,EAAAolD,uBACAplD,EAAAolD,sBAAA5D,OACA,GAAAlX,EAAA+a,gBAEA,CAEAtkD,EAAA6hD,MAAA5iD,EAAA4jD,MAAA1nB,IAAA,CACAykB,OAAA3gD,EAAA4jD,MAAAjD,OACAH,QAAAwE,EACAzE,KAAAA,QAAA3hD,EACAqlD,KAAA,OACAqB,YAAAhb,EAAAib,gBAAA,UAAA,cACAL,OAAAA,IACAM,MAAA,SAAA9D,GACA1hD,EAAAylD,eAAA/D,EACA1hD,EAAA0lD,cAAA,GACA1lD,EAAA2lD,UACA,IAAA,SAAAC,GACA5lD,EAAA0lD,cAAA,GACA1lD,EAAA6kD,YACA7kD,EAAA0nB,KAAA,QAAAk+B,EACA,GACA,KAAA,CACA,IAAAxD,EAAApiD,EAAA6lD,KAAA,IAAA9kD,EAAAuhD,eACA,IACAF,EAAAG,KAAAviD,EAAA4jD,MAAAjD,OAAA3gD,EAAA4jD,MAAA1nB,KAAA,EACA,CAAA,MAAAv5B,GAIA,YAHAwvB,EAAAiiB,UAAA,WACAp0C,EAAA0nB,KAAA,QAAA/kB,EACA,GAEA,CAGA,iBAAAy/C,IACAA,EAAAM,aAAA1iD,EAAAkkD,OAEA,oBAAA9B,IACAA,EAAAmD,kBAAAjb,EAAAib,iBAEA,SAAAvlD,EAAAkkD,OAAA,qBAAA9B,GACAA,EAAAiB,iBAAA,sCAEA,mBAAA/Y,IACA8X,EAAArO,QAAAzJ,EAAA+a,eACAjD,EAAA0D,UAAA,WACA9lD,EAAA0nB,KAAA,iBACA,GAGAs9B,EAAA1jC,SAAA,SAAAqjC,GACAvC,EAAA2D,iBAAApB,EAAA,GAAAA,EAAA,GACA,IAEA3kD,EAAAgmD,UAAA,KACA5D,EAAA6D,mBAAA,WACA,OAAA7D,EAAA8D,YACA,KAAA1C,EAAA2C,QACA,KAAA3C,EAAA4C,KACApmD,EAAAqmD,iBAGA,EAGA,4BAAArmD,EAAAkkD,QACA9B,EAAAkE,WAAA,WACAtmD,EAAAqmD,gBACA,GAGAjE,EAAAmE,QAAA,WACAvmD,EAAA6kD,aAEA7kD,EAAA0lD,cAAA,GACA1lD,EAAA0nB,KAAA,QAAA,IAAAnmB,MAAA,cACA,EAEA,IACA6gD,EAAAoE,KAAAjG,EACA,CAAA,MAAA59C,GAIA,YAHAwvB,EAAAiiB,UAAA,WACAp0C,EAAA0nB,KAAA,QAAA/kB,EACA,GAEA,CACA,CA7HA,CA8HA,EAgBA8+C,EAAAzmD,UAAAqrD,eAAA,WACA,IAAArmD,EAAAzC,KAEAyC,EAAA0lD,cAAA,GAZA,SAAAtD,GACA,IACA,IAAAqE,EAAArE,EAAAqE,OACA,OAAA,OAAAA,GAAA,IAAAA,CACA,CAAA,MAAAlmD,GACA,OAAA,CACA,CACA,CAOAmmD,CAAA1mD,EAAA6lD,QAAA7lD,EAAA6kD,aAGA7kD,EAAAgmD,WACAhmD,EAAA2lD,WAEA3lD,EAAAgmD,UAAAK,eAAArmD,EAAA0lD,aAAA7oD,KAAAmD,IACA,EAEAyhD,EAAAzmD,UAAA2qD,SAAA,WACA,IAAA3lD,EAAAzC,KAEAyC,EAAA6kD,aAGA7kD,EAAAgmD,UAAA,IAAAnE,EAAA7hD,EAAA6lD,KAAA7lD,EAAAylD,eAAAzlD,EAAAkkD,MAAAlkD,EAAA0lD,aAAA7oD,KAAAmD,IACAA,EAAAgmD,UAAAt/B,GAAA,SAAA,SAAA/jB,GACA3C,EAAA0nB,KAAA,QAAA/kB,EACA,IAEA3C,EAAA0nB,KAAA,WAAA1nB,EAAAgmD,WACA,EAEAvE,EAAAzmD,UAAA2rD,OAAA,SAAA/G,EAAArzC,EAAA3K,GACArE,KAEAsmD,MAAA5gD,KAAA28C,GACAh+C,GACA,EAEA6/C,EAAAzmD,UAAA0qD,aAAA,SAAAnjD,GACA,IAAAvC,EAAAzC,KAEAwD,EAAAyyC,aAAAxzC,EAAAskD,cACAtkD,EAAAskD,aAAA,KAEA/hD,GACAxB,EAAAyyC,aAAAxzC,EAAAokD,aACApkD,EAAAokD,YAAA,MACApkD,EAAAqkD,iBACArkD,EAAAskD,aAAAvjD,EAAAiD,YAAA,WACAhE,EAAA0nB,KAAA,UACA,GAAA1nB,EAAAqkD,gBAEA,EAEA5C,EAAAzmD,UAAAwmD,MAAAC,EAAAzmD,UAAA4rD,QAAA,SAAAjkD,GACA,IAAA3C,EAAAzC,KACAyC,EAAA6kD,YAAA,EACA7kD,EAAA0lD,cAAA,GACA1lD,EAAAgmD,YACAhmD,EAAAgmD,UAAAnB,YAAA,GACA7kD,EAAA6lD,KACA7lD,EAAA6lD,KAAArE,QACAxhD,EAAAolD,uBACAplD,EAAAolD,sBAAA5D,QAEA7+C,GACA3C,EAAA0nB,KAAA,QAAA/kB,EACA,EAEA8+C,EAAAzmD,UAAA8K,IAAA,SAAA2H,EAAAlB,EAAA3K,GAEA,mBAAA6L,IACA7L,EAAA6L,EACAA,OAAA7O,GAGA8gD,EAAAiE,SAAA3oD,UAAA8K,IAAA5K,KANAqC,KAMAkQ,EAAAlB,EAAA3K,EACA,EAEA6/C,EAAAzmD,UAAAgJ,WAAA,SAAA+vC,EAAAnyC,GACA,IAAA5B,EAAAzC,KAEAqE,GACA5B,EAAAkC,KAAA,UAAAN,GAEA5B,EAAAqkD,eAAAtQ,EACA/zC,EAAA0lD,cAAA,EACA,EAEAjE,EAAAzmD,UAAA6rD,aAAA,WAAA,EACApF,EAAAzmD,UAAA8rD,WAAA,WAAA,EACArF,EAAAzmD,UAAA+rD,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,M5F8gYC,GAAEvpD,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,YAA8B,oBAAXL,OAAyBA,OAAyB,oBAATf,KAAuBA,KAAyB,oBAAXc,OAAyBA,OAAS,CAAC,EAAEM,EAAQ,UAAUsK,OAE1L,EAAE,CAAC,eAAe,GAAG,aAAa,GAAGunB,SAAW,GAAGjmB,OAAS,GAAGu2C,SAAW,GAAG,kBAAkB,MAAM,GAAG,CAAC,SAASniD,EAAQT,EAAOD,IACjI,SAAWyxB,EAAQpxB,EAAO2K,IAAQ,W6F/2YlC,IAAA43C,EAAAliD,EAAA,gBACAmiD,EAAAniD,EAAA,YACAs+C,EAAAt+C,EAAA,mBAEAoiD,EAAA9iD,EAAA+iD,YAAA,CACAuD,OAAA,EACAC,OAAA,EACAC,iBAAA,EACAf,QAAA,EACAC,KAAA,GAGAvE,EAAAnhD,EAAAmhD,gBAAA,SAAAO,EAAAV,EAAAuC,EAAAkD,GACA,IAAAnnD,EAAAzC,KAiBA,GAhBAmiD,EAAA0H,SAAAlsD,KAAA8E,GAEAA,EAAAkkD,MAAAD,EACAjkD,EAAAwgD,QAAA,CAAA,EACAxgD,EAAAqnD,WAAA,GACArnD,EAAAsnD,SAAA,CAAA,EACAtnD,EAAAunD,YAAA,GAGAvnD,EAAA0mB,GAAA,OAAA,WAEAyL,EAAAiiB,UAAA,WACAp0C,EAAA0nB,KAAA,QACA,GACA,IAEA,UAAAu8B,EAAA,CAYA,GAXAjkD,EAAAylD,eAAA/D,EAEA1hD,EAAAk8B,IAAAwlB,EAAAxlB,IACAl8B,EAAAghD,WAAAU,EAAA+E,OACAzmD,EAAAwnD,cAAA9F,EAAA+F,WAEA/F,EAAAlB,QAAAl/B,SAAA,SAAAqjC,EAAAxoD,GACA6D,EAAAwgD,QAAArkD,EAAA8R,eAAA02C,EACA3kD,EAAAqnD,WAAApkD,KAAA9G,EAAAwoD,EACA,IAEArB,EAAAR,eAAA,CACA,IAAArmD,EAAA,IAAAsmD,eAAA,CACAr2C,MAAA,SAAAkzC,GAEA,OADAuH,GAAA,GACA,IAAAlhC,SAAA,SAAAC,EAAAC,GACAnmB,EAAA6kD,WACA1+B,IACAnmB,EAAAiD,KAAAyI,EAAAnQ,KAAAqkD,IACA15B,IAEAlmB,EAAA0nD,aAAAxhC,CAEA,GACA,EACAyhC,MAAA,WACAR,GAAA,GACAnnD,EAAA6kD,YACA7kD,EAAAiD,KAAA,KACA,EACAu+C,MAAA,SAAA7+C,GACAwkD,GAAA,GACAnnD,EAAA6kD,YACA7kD,EAAA0nB,KAAA,QAAA/kB,EACA,IAGA,IAMA,YALA++C,EAAAnB,KAAAqH,OAAAnrD,GAAA,OAAA,SAAAkG,GACAwkD,GAAA,GACAnnD,EAAA6kD,YACA7kD,EAAA0nB,KAAA,QAAA/kB,EACA,GAEA,CAAA,MAAApC,GAAA,CACA,CAEA,IAAAsnD,EAAAnG,EAAAnB,KAAAuH,aACA,SAAA34C,IACA04C,EAAA14C,OAAAq2C,MAAA,SAAA7lD,GACAK,EAAA6kD,aAEAsC,EAAAxnD,EAAA4C,MACA5C,EAAA4C,KACAvC,EAAAiD,KAAA,OAGAjD,EAAAiD,KAAAyI,EAAAnQ,KAAAoE,EAAAvD,QACA+S,KACA,IAAA,OAAA,SAAAxM,GACAwkD,GAAA,GACAnnD,EAAA6kD,YACA7kD,EAAA0nB,KAAA,QAAA/kB,EACA,GACA,CACAwM,EACA,KAAA,CA2BA,GA1BAnP,EAAA6lD,KAAAzD,EACApiD,EAAA+nD,KAAA,EAEA/nD,EAAAk8B,IAAAkmB,EAAA4F,YACAhoD,EAAAghD,WAAAoB,EAAAqE,OACAzmD,EAAAwnD,cAAApF,EAAAqF,WACArF,EAAA6F,wBAAAvxC,MAAA,SACA4K,SAAA,SAAAqjC,GACA,IAAAuD,EAAAvD,EAAAjmC,MAAA,oBACA,GAAAwpC,EAAA,CACA,IAAA/rD,EAAA+rD,EAAA,GAAAj6C,cACA,eAAA9R,QACAyC,IAAAoB,EAAAwgD,QAAArkD,KACA6D,EAAAwgD,QAAArkD,GAAA,IAEA6D,EAAAwgD,QAAArkD,GAAA8G,KAAAilD,EAAA,UACAtpD,IAAAoB,EAAAwgD,QAAArkD,GACA6D,EAAAwgD,QAAArkD,IAAA,KAAA+rD,EAAA,GAEAloD,EAAAwgD,QAAArkD,GAAA+rD,EAAA,GAEAloD,EAAAqnD,WAAApkD,KAAAilD,EAAA,GAAAA,EAAA,GACA,CACA,IAEAloD,EAAAmoD,SAAA,kBACA7E,EAAAD,iBAAA,CACA,IAAA+E,EAAApoD,EAAAqnD,WAAA,aACA,GAAAe,EAAA,CACA,IAAAC,EAAAD,EAAA1pC,MAAA,2BACA2pC,IACAroD,EAAAmoD,SAAAE,EAAA,GAAAp6C,cAEA,CACAjO,EAAAmoD,WACAnoD,EAAAmoD,SAAA,QACA,CACA,CACA,EAEA5E,EAAA1B,EAAAnC,EAAA0H,UAEAvF,EAAA7mD,UAAAstD,MAAA,WACA,IAEApiC,EAFA3oB,KAEAmqD,aACAxhC,IAHA3oB,KAIAmqD,aAAA,KACAxhC,IAEA,EAEA27B,EAAA7mD,UAAAqrD,eAAA,SAAAc,GACA,IAAAnnD,EAAAzC,KAEA6kD,EAAApiD,EAAA6lD,KAEAnE,EAAA,KACA,OAAA1hD,EAAAkkD,OACA,IAAA,OAEA,IADAxC,EAAAU,EAAAmG,cACAzsD,OAAAkE,EAAA+nD,KAAA,CACA,IAAAS,EAAA9G,EAAA7xC,OAAA7P,EAAA+nD,MACA,GAAA,mBAAA/nD,EAAAmoD,SAAA,CAEA,IADA,IAAAn7C,EAAAtB,EAAAI,MAAA08C,EAAA1sD,QACAC,EAAA,EAAAA,EAAAysD,EAAA1sD,OAAAC,IACAiR,EAAAjR,GAAA,IAAAysD,EAAAvjD,WAAAlJ,GAEAiE,EAAAiD,KAAA+J,EACA,MACAhN,EAAAiD,KAAAulD,EAAAxoD,EAAAmoD,UAEAnoD,EAAA+nD,KAAArG,EAAA5lD,MACA,CACA,MACA,IAAA,cACA,GAAAsmD,EAAA8D,aAAA1C,EAAA4C,OAAAhE,EAAAV,SACA,MACAA,EAAAU,EAAAV,SACA1hD,EAAAiD,KAAAyI,EAAAnQ,KAAA,IAAAoK,WAAA+7C,KACA,MACA,IAAA,0BAEA,GADAA,EAAAU,EAAAV,SACAU,EAAA8D,aAAA1C,EAAA2C,UAAAzE,EACA,MACA1hD,EAAAiD,KAAAyI,EAAAnQ,KAAA,IAAAoK,WAAA+7C,KACA,MACA,IAAA,YAEA,GADAA,EAAAU,EAAAV,SACAU,EAAA8D,aAAA1C,EAAA2C,QACA,MACA,IAAA0B,EAAA,IAAA9mD,EAAA0nD,eACAZ,EAAAvB,WAAA,WACAuB,EAAAloD,OAAA0E,WAAArE,EAAA+nD,OACA/nD,EAAAiD,KAAAyI,EAAAnQ,KAAA,IAAAoK,WAAAkiD,EAAAloD,OAAAxE,MAAA6E,EAAA+nD,SACA/nD,EAAA+nD,KAAAF,EAAAloD,OAAA0E,WAEA,EACAwjD,EAAAa,OAAA,WACAvB,GAAA,GACAnnD,EAAAiD,KAAA,KACA,EAEA4kD,EAAAc,kBAAAjH,GAKA1hD,EAAA6lD,KAAAK,aAAA1C,EAAA4C,MAAA,cAAApmD,EAAAkkD,QACAiD,GAAA,GACAnnD,EAAAiD,KAAA,MAEA,C7Fk3YC,GAAE/H,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,YAA8B,oBAAXL,OAAyBA,OAAyB,oBAATf,KAAuBA,KAAyB,oBAAXc,OAAyBA,OAAS,CAAC,EAAEM,EAAQ,UAAUsK,OAE1L,EAAE,CAAC,eAAe,GAAGunB,SAAW,GAAGjmB,OAAS,GAAGu2C,SAAW,GAAG,kBAAkB,MAAM,GAAG,CAAC,SAASniD,EAAQT,EAAOD,G8FlkZjH,IAAAkoD,EAAA,CAAA,EAEA,SAAAC,EAAArnD,EAAAynB,EAAA6/B,GACAA,IACAA,EAAAvnD,OAWA,IAAAwnD,EAEA,SAAAC,GAnBA,IAAAhqD,EAAAC,EAsBA,SAAA8pD,EAAAE,EAAAC,EAAAC,GACA,OAAAH,EAAA9tD,KAAAqC,KAdA,SAAA0rD,EAAAC,EAAAC,GACA,MAAA,iBAAAlgC,EACAA,EAEAA,EAAAggC,EAAAC,EAAAC,EAEA,CAQAC,CAAAH,EAAAC,EAAAC,KAAA5rD,IACA,CAEA,OA1BA0B,EAoBA+pD,GApBAhqD,EAoBA+pD,GApBA/tD,UAAAD,OAAAmE,OAAAD,EAAAjE,WAAAgE,EAAAhE,UAAAI,YAAA4D,EAAAA,EAAAM,UAAAL,EA0BA8pD,CACA,CARA,CAQAD,GAEAC,EAAA/tD,UAAAK,KAAAytD,EAAAztD,KACA0tD,EAAA/tD,UAAAwG,KAAAA,EACAonD,EAAApnD,GAAAunD,CACA,CAGA,SAAAM,EAAAC,EAAAC,GACA,GAAAjuD,MAAAM,QAAA0tD,GAAA,CACA,IAAAztD,EAAAytD,EAAAxtD,OAKA,OAJAwtD,EAAAA,EAAAtT,KAAA,SAAAj6C,GACA,OAAAwC,OAAAxC,EACA,IAEAF,EAAA,EACA,UAAAuI,OAAAmlD,EAAA,KAAAnlD,OAAAklD,EAAAnuD,MAAA,EAAAU,EAAA,GAAA6J,KAAA,MAAA,SAAA4jD,EAAAztD,EAAA,GACA,IAAAA,EACA,UAAAuI,OAAAmlD,EAAA,KAAAnlD,OAAAklD,EAAA,GAAA,QAAAllD,OAAAklD,EAAA,IAEA,MAAAllD,OAAAmlD,EAAA,KAAAnlD,OAAAklD,EAAA,GAEA,CACA,MAAA,MAAAllD,OAAAmlD,EAAA,KAAAnlD,OAAA7F,OAAA+qD,GAEA,CA6BAT,EAAA,yBAAA,SAAAxtD,EAAAe,GACA,MAAA,cAAAA,EAAA,4BAAAf,EAAA,GACA,GAAAX,WACAmuD,EAAA,wBAAA,SAAAxtD,EAAAiuD,EAAA78C,GAEA,IAAA+8C,EA/BAt+C,EAAAkH,EAwCAq3C,EAEA,GATA,iBAAAH,IAjCAp+C,EAiCA,OAAAo+C,EAhCAz5C,QAAAuC,GAAAA,EAAA,EAAA,GAAAA,EAAAlH,EAAApP,UAAAoP,IAiCAs+C,EAAA,cACAF,EAAAA,EAAAr+C,QAAA,QAAA,KAEAu+C,EAAA,UAhCA,SAAAv5C,EAAA/E,EAAAw+C,GAKA,YAJA9qD,IAAA8qD,GAAAA,EAAAz5C,EAAAnU,UACA4tD,EAAAz5C,EAAAnU,QAGAmU,EAAA9E,UAAAu+C,EAAAx+C,EAAApP,OAAA4tD,KAAAx+C,CACA,CA+BAoyB,CAAAjiC,EAAA,aAEAouD,EAAA,OAAArlD,OAAA/I,EAAA,KAAA+I,OAAAolD,EAAA,KAAAplD,OAAAilD,EAAAC,EAAA,aACA,CACA,IAAA97C,EAhCA,SAAAyC,EAAA/E,EAAArF,GAKA,MAJA,iBAAAA,IACAA,EAAA,KAGAA,EAAAqF,EAAApP,OAAAmU,EAAAnU,UAGA,IAAAmU,EAAArK,QAAAsF,EAAArF,EAEA,CAsBAmN,CAAA3X,EAAA,KAAA,WAAA,WACAouD,EAAA,QAAArlD,OAAA/I,EAAA,MAAA+I,OAAAoJ,EAAA,KAAApJ,OAAAolD,EAAA,KAAAplD,OAAAilD,EAAAC,EAAA,QACA,CAGA,OADAG,GAAA,mBAAArlD,OAAA9F,QAAAmO,GAEA,GAAA/R,WACAmuD,EAAA,4BAAA,2BACAA,EAAA,8BAAA,SAAAxtD,GACA,MAAA,OAAAA,EAAA,4BACA,IACAwtD,EAAA,6BAAA,mBACAA,EAAA,wBAAA,SAAAxtD,GACA,MAAA,eAAAA,EAAA,+BACA,IACAwtD,EAAA,wBAAA,kCACAA,EAAA,yBAAA,6BACAA,EAAA,6BAAA,mBACAA,EAAA,yBAAA,sCAAAnuD,WACAmuD,EAAA,wBAAA,SAAAzqD,GACA,MAAA,qBAAAA,CACA,GAAA1D,WACAmuD,EAAA,qCAAA,oCACAloD,EAAAD,QAAAkoD,MAAAA,C9FykZA,EAAE,CAAC,GAAG,GAAG,CAAC,SAASxnD,EAAQT,EAAOD,IAClC,SAAWyxB,IAAS,W+F3qZpB,IAAA+rB,EAAAnjD,OAAAwI,MAAA,SAAArH,GACA,IAAAqH,EAAA,GACA,IAAA,IAAApH,KAAAD,EAAAqH,EAAAN,KAAA9G,GACA,OAAAoH,CACA,EAGA5C,EAAAD,QAAAipD,EACA,IAAAvC,EAAAhmD,EAAA,sBACAuiD,EAAAviD,EAAA,sBACAA,EAAA,WAAAA,CAAAuoD,EAAAvC,GAIA,IADA,IAAA7jD,EAAA26C,EAAAyF,EAAA3oD,WACAkiB,EAAA,EAAAA,EAAA3Z,EAAAzH,OAAAohB,IAAA,CACA,IAAAyjC,EAAAp9C,EAAA2Z,GACAysC,EAAA3uD,UAAA2lD,KAAAgJ,EAAA3uD,UAAA2lD,GAAAgD,EAAA3oD,UAAA2lD,GACA,CAEA,SAAAgJ,EAAAzuC,GACA,KAAA3d,gBAAAosD,GAAA,OAAA,IAAAA,EAAAzuC,GACAksC,EAAAlsD,KAAAqC,KAAA2d,GACAyoC,EAAAzoD,KAAAqC,KAAA2d,GACA3d,KAAAqsD,eAAA,EACA1uC,KACA,IAAAA,EAAA2uC,WAAAtsD,KAAAssD,UAAA,IACA,IAAA3uC,EAAAze,WAAAc,KAAAd,UAAA,IACA,IAAAye,EAAA0uC,gBACArsD,KAAAqsD,eAAA,EACArsD,KAAA2E,KAAA,MAAA4nD,IAGA,CA8BA,SAAAA,IAEAvsD,KAAAwsD,eAAAC,OAIA73B,EAAAiiB,SAAA6V,EAAA1sD,KACA,CACA,SAAA0sD,EAAAjqD,GACAA,EAAA8F,KACA,CAvCA/K,OAAAuB,eAAAqtD,EAAA3uD,UAAA,wBAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,OAAAW,KAAAwsD,eAAAG,aACA,IAEAnvD,OAAAuB,eAAAqtD,EAAA3uD,UAAA,iBAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,OAAAW,KAAAwsD,gBAAAxsD,KAAAwsD,eAAAI,WACA,IAEApvD,OAAAuB,eAAAqtD,EAAA3uD,UAAA,iBAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,OAAAW,KAAAwsD,eAAAjuD,MACA,IAeAf,OAAAuB,eAAAqtD,EAAA3uD,UAAA,YAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,YAAAgC,IAAArB,KAAA6sD,qBAAAxrD,IAAArB,KAAAwsD,iBAGAxsD,KAAA6sD,eAAAC,WAAA9sD,KAAAwsD,eAAAM,UACA,EACA/zC,IAAA,SAAAla,QAGAwC,IAAArB,KAAA6sD,qBAAAxrD,IAAArB,KAAAwsD,iBAMAxsD,KAAA6sD,eAAAC,UAAAjuD,EACAmB,KAAAwsD,eAAAM,UAAAjuD,EACA,G/F2sZC,GAAElB,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,YAElC,EAAE,CAAC,qBAAqB,GAAG,qBAAqB,IAAI6xB,SAAW,GAAGswB,SAAW,KAAK,GAAG,CAAC,SAASniD,EAAQT,EAAOD,GgG9yZ9GC,EAAAD,QAAA4pD,EACA,IAAAC,EAAAnpD,EAAA,uBAEA,SAAAkpD,EAAApvC,GACA,KAAA3d,gBAAA+sD,GAAA,OAAA,IAAAA,EAAApvC,GACAqvC,EAAArvD,KAAAqC,KAAA2d,EACA,CAJA9Z,EAAA,WAAAA,CAAAkpD,EAAAC,GAKAD,EAAAtvD,UAAAwvD,WAAA,SAAA5K,EAAArzC,EAAA3K,GACAA,EAAA,KAAAg+C,EACA,ChG20ZA,EAAE,CAAC,sBAAsB,GAAG2D,SAAW,KAAK,GAAG,CAAC,SAASniD,EAAQT,EAAOD,IACxE,SAAWyxB,EAAQpxB,IAAQ,WiGt1Z3B,IAAA4oD,EAHAhpD,EAAAD,QAAA0mD,EAMAA,EAAAqD,cAAAA,EAGArpD,EAAA,UAAA2kB,aAAA,IACA2kC,EAAA,SAAA1kC,EAAAxY,GACA,OAAAwY,EAAAmD,UAAA3b,GAAA1R,MACA,EAIA6uD,EAAAvpD,EAAA,6BAGAsK,EAAAtK,EAAA,UAAAsK,OACAk/C,QAAA,IAAA7pD,EAAAA,EAAA,oBAAAD,OAAAA,OAAA,oBAAAd,KAAAA,KAAA,CAAA,GAAA2F,YAAA,WAAA,EASA,IACAsqB,EADA46B,EAAAzpD,EAAA,QAGA6uB,EADA46B,GAAAA,EAAAC,SACAD,EAAAC,SAAA,UAEA,WAAA,EAIA,IAWAC,EACAC,EACAzvD,EAbA0vD,EAAA7pD,EAAA,kCACA8pD,EAAA9pD,EAAA,8BAEA+pD,EADA/pD,EAAA,4BACA+pD,iBACAC,EAAAhqD,EAAA,aAAAwnD,MACAyC,EAAAD,EAAAC,qBACAC,EAAAF,EAAAE,0BACAC,EAAAH,EAAAG,2BACAC,EAAAJ,EAAAI,mCAMApqD,EAAA,WAAAA,CAAAgmD,EAAAuD,GACA,IAAAc,EAAAP,EAAAO,eACAC,EAAA,CAAA,QAAA,QAAA,UAAA,QAAA,UAYA,SAAAjB,EAAAvvC,EAAAwkC,EAAAiM,GACAhC,EAAAA,GAAAvoD,EAAA,oBACA8Z,EAAAA,GAAA,CAAA,EAOA,kBAAAywC,IAAAA,EAAAjM,aAAAiK,GAIApsD,KAAAquD,aAAA1wC,EAAA0wC,WACAD,IAAApuD,KAAAquD,WAAAruD,KAAAquD,cAAA1wC,EAAA2wC,oBAIAtuD,KAAA2sD,cAAAiB,EAAA5tD,KAAA2d,EAAA,wBAAAywC,GAKApuD,KAAAyP,OAAA,IAAAi+C,EACA1tD,KAAAzB,OAAA,EACAyB,KAAAuuD,MAAA,KACAvuD,KAAAwuD,WAAA,EACAxuD,KAAAyuD,QAAA,KACAzuD,KAAAysD,OAAA,EACAzsD,KAAA0uD,YAAA,EACA1uD,KAAA2uD,SAAA,EAMA3uD,KAAA4F,MAAA,EAIA5F,KAAA4uD,cAAA,EACA5uD,KAAA6uD,iBAAA,EACA7uD,KAAA8uD,mBAAA,EACA9uD,KAAA+uD,iBAAA,EACA/uD,KAAAgvD,QAAA,EAGAhvD,KAAAivD,WAAA,IAAAtxC,EAAAsxC,UAGAjvD,KAAAkvD,cAAAvxC,EAAAuxC,YAGAlvD,KAAA8sD,WAAA,EAKA9sD,KAAAmvD,gBAAAxxC,EAAAwxC,iBAAA,OAGAnvD,KAAAovD,WAAA,EAGApvD,KAAAqvD,aAAA,EACArvD,KAAAm7C,QAAA,KACAn7C,KAAAgP,SAAA,KACA2O,EAAA3O,WACAw+C,IAAAA,EAAA3pD,EAAA,mBAAA2pD,eACAxtD,KAAAm7C,QAAA,IAAAqS,EAAA7vC,EAAA3O,UACAhP,KAAAgP,SAAA2O,EAAA3O,SAEA,CACA,SAAA66C,EAAAlsC,GAEA,GADAyuC,EAAAA,GAAAvoD,EAAA,sBACA7D,gBAAA6pD,GAAA,OAAA,IAAAA,EAAAlsC,GAIA,IAAAywC,EAAApuD,gBAAAosD,EACApsD,KAAA6sD,eAAA,IAAAK,EAAAvvC,EAAA3d,KAAAouD,GAGApuD,KAAAssD,UAAA,EACA3uC,IACA,mBAAAA,EAAA/L,OAAA5R,KAAA+qD,MAAAptC,EAAA/L,MACA,mBAAA+L,EAAA0rC,UAAArpD,KAAAsvD,SAAA3xC,EAAA0rC,UAEA+D,EAAAzvD,KAAAqC,KACA,CAwDA,SAAAuvD,EAAApN,EAAAE,EAAArzC,EAAAwgD,EAAAC,GACA/8B,EAAA,mBAAA2vB,GACA,IAKA52B,EALAd,EAAAw3B,EAAA0K,eACA,GAAA,OAAAxK,EACA13B,EAAAgkC,SAAA,EAuNA,SAAAxM,EAAAx3B,GAEA,GADA+H,EAAA,cACA/H,EAAA8hC,MAAA,OACA,GAAA9hC,EAAAwwB,QAAA,CACA,IAAAkH,EAAA13B,EAAAwwB,QAAA5yC,MACA85C,GAAAA,EAAA9jD,SACAosB,EAAAlb,OAAA/J,KAAA28C,GACA13B,EAAApsB,QAAAosB,EAAA0jC,WAAA,EAAAhM,EAAA9jD,OAEA,CACAosB,EAAA8hC,OAAA,EACA9hC,EAAA/kB,KAIA8pD,EAAAvN,IAGAx3B,EAAAikC,cAAA,EACAjkC,EAAAkkC,kBACAlkC,EAAAkkC,iBAAA,EACAc,EAAAxN,IAGA,CA9OAyN,CAAAzN,EAAAx3B,QAIA,GADA8kC,IAAAhkC,EA6CA,SAAAd,EAAA03B,GACA,IAAA52B,EAjPA9sB,EAkPA0jD,EAjPAl0C,EAAA0B,SAAAlR,IAAAA,aAAA0uD,GAiPA,iBAAAhL,QAAAhhD,IAAAghD,GAAA13B,EAAA0jC,aACA5iC,EAAA,IAAAqiC,EAAA,QAAA,CAAA,SAAA,SAAA,cAAAzL,IAnPA,IAAA1jD,EAqPA,OAAA8sB,CACA,CAnDAokC,CAAAllC,EAAA03B,IACA52B,EACAyiC,EAAA/L,EAAA12B,QACA,GAAAd,EAAA0jC,YAAAhM,GAAAA,EAAA9jD,OAAA,EAIA,GAHA,iBAAA8jD,GAAA13B,EAAA0jC,YAAA7wD,OAAAyF,eAAAo/C,KAAAl0C,EAAA1Q,YACA4kD,EA3MA,SAAAA,GACA,OAAAl0C,EAAAnQ,KAAAqkD,EACA,CAyMAyN,CAAAzN,IAEAmN,EACA7kC,EAAA+jC,WAAAR,EAAA/L,EAAA,IAAA8L,GAAA8B,EAAA5N,EAAAx3B,EAAA03B,GAAA,QACA,GAAA13B,EAAA8hC,MACAyB,EAAA/L,EAAA,IAAA4L,OACA,IAAApjC,EAAAmiC,UACA,OAAA,EAEAniC,EAAAgkC,SAAA,EACAhkC,EAAAwwB,UAAAnsC,GACAqzC,EAAA13B,EAAAwwB,QAAAhsC,MAAAkzC,GACA13B,EAAA0jC,YAAA,IAAAhM,EAAA9jD,OAAAwxD,EAAA5N,EAAAx3B,EAAA03B,GAAA,GAAA2N,EAAA7N,EAAAx3B,IAEAolC,EAAA5N,EAAAx3B,EAAA03B,GAAA,EAEA,MACAmN,IACA7kC,EAAAgkC,SAAA,EACAqB,EAAA7N,EAAAx3B,IAOA,OAAAA,EAAA8hC,QAAA9hC,EAAApsB,OAAAosB,EAAAgiC,eAAA,IAAAhiC,EAAApsB,OACA,CACA,SAAAwxD,EAAA5N,EAAAx3B,EAAA03B,EAAAmN,GACA7kC,EAAA8jC,SAAA,IAAA9jC,EAAApsB,SAAAosB,EAAA/kB,MACA+kB,EAAAykC,WAAA,EACAjN,EAAAh4B,KAAA,OAAAk4B,KAGA13B,EAAApsB,QAAAosB,EAAA0jC,WAAA,EAAAhM,EAAA9jD,OACAixD,EAAA7kC,EAAAlb,OAAA5F,QAAAw4C,GAAA13B,EAAAlb,OAAA/J,KAAA28C,GACA13B,EAAAikC,cAAAc,EAAAvN,IAEA6N,EAAA7N,EAAAx3B,EACA,CA3GAntB,OAAAuB,eAAA8qD,EAAApsD,UAAA,YAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,YAAAgC,IAAArB,KAAA6sD,gBAGA7sD,KAAA6sD,eAAAC,SACA,EACA/zC,IAAA,SAAAla,GAGAmB,KAAA6sD,iBAMA7sD,KAAA6sD,eAAAC,UAAAjuD,EACA,IAEAgrD,EAAApsD,UAAA4rD,QAAAsE,EAAAtE,QACAQ,EAAApsD,UAAAwyD,WAAAtC,EAAAuC,UACArG,EAAApsD,UAAA6xD,SAAA,SAAAlqD,EAAAf,GACAA,EAAAe,EACA,EAMAykD,EAAApsD,UAAAiI,KAAA,SAAA28C,EAAArzC,GACA,IACAygD,EADA9kC,EAAA3qB,KAAA6sD,eAcA,OAZAliC,EAAA0jC,WAUAoB,GAAA,EATA,iBAAApN,KACArzC,EAAAA,GAAA2b,EAAAwkC,mBACAxkC,EAAA3b,WACAqzC,EAAAl0C,EAAAnQ,KAAAqkD,EAAArzC,GACAA,EAAA,IAEAygD,GAAA,GAKAF,EAAAvvD,KAAAqiD,EAAArzC,GAAA,EAAAygD,EACA,EAGA5F,EAAApsD,UAAAoM,QAAA,SAAAw4C,GACA,OAAAkN,EAAAvvD,KAAAqiD,EAAA,MAAA,GAAA,EACA,EA6DAwH,EAAApsD,UAAA0yD,SAAA,WACA,OAAA,IAAAnwD,KAAA6sD,eAAA4B,OACA,EAGA5E,EAAApsD,UAAA2yD,YAAA,SAAAjyC,GACAqvC,IAAAA,EAAA3pD,EAAA,mBAAA2pD,eACA,IAAArS,EAAA,IAAAqS,EAAArvC,GACAne,KAAA6sD,eAAA1R,QAAAA,EAEAn7C,KAAA6sD,eAAA79C,SAAAhP,KAAA6sD,eAAA1R,QAAAnsC,SAKA,IAFA,IAAAnN,EAAA7B,KAAA6sD,eAAAp9C,OAAAyM,KACAm0C,EAAA,GACA,OAAAxuD,GACAwuD,GAAAlV,EAAAhsC,MAAAtN,EAAAqO,MACArO,EAAAA,EAAA6C,KAKA,OAHA1E,KAAA6sD,eAAAp9C,OAAA6gD,QACA,KAAAD,GAAArwD,KAAA6sD,eAAAp9C,OAAA/J,KAAA2qD,GACArwD,KAAA6sD,eAAAtuD,OAAA8xD,EAAA9xD,OACAyB,IACA,EAGA,IAAAuwD,EAAA,WAqBA,SAAAC,EAAAjzD,EAAAotB,GACA,OAAAptB,GAAA,GAAA,IAAAotB,EAAApsB,QAAAosB,EAAA8hC,MAAA,EACA9hC,EAAA0jC,WAAA,EACA9wD,GAAAA,EAEAotB,EAAA8jC,SAAA9jC,EAAApsB,OAAAosB,EAAAlb,OAAAyM,KAAAhM,KAAA3R,OAAAosB,EAAApsB,QAGAhB,EAAAotB,EAAAgiC,gBAAAhiC,EAAAgiC,cA5BA,SAAApvD,GAeA,OAdAA,GAAAgzD,EAEAhzD,EAAAgzD,GAIAhzD,IACAA,GAAAA,IAAA,EACAA,GAAAA,IAAA,EACAA,GAAAA,IAAA,EACAA,GAAAA,IAAA,EACAA,GAAAA,IAAA,GACAA,KAEAA,CACA,CAYAkzD,CAAAlzD,IACAA,GAAAotB,EAAApsB,OAAAhB,EAEAotB,EAAA8hC,MAIA9hC,EAAApsB,QAHAosB,EAAAikC,cAAA,EACA,GAGA,CA6HA,SAAAc,EAAAvN,GACA,IAAAx3B,EAAAw3B,EAAA0K,eACAn6B,EAAA,eAAA/H,EAAAikC,aAAAjkC,EAAAkkC,iBACAlkC,EAAAikC,cAAA,EACAjkC,EAAAkkC,kBACAn8B,EAAA,eAAA/H,EAAA8jC,SACA9jC,EAAAkkC,iBAAA,EACAj6B,EAAAiiB,SAAA8Y,EAAAxN,GAEA,CACA,SAAAwN,EAAAxN,GACA,IAAAx3B,EAAAw3B,EAAA0K,eACAn6B,EAAA,gBAAA/H,EAAAmiC,UAAAniC,EAAApsB,OAAAosB,EAAA8hC,OACA9hC,EAAAmiC,YAAAniC,EAAApsB,SAAAosB,EAAA8hC,QACAtK,EAAAh4B,KAAA,YACAQ,EAAAkkC,iBAAA,GASAlkC,EAAAikC,cAAAjkC,EAAA8jC,UAAA9jC,EAAA8hC,OAAA9hC,EAAApsB,QAAAosB,EAAAgiC,cACA+D,EAAAvO,EACA,CAQA,SAAA6N,EAAA7N,EAAAx3B,GACAA,EAAA0kC,cACA1kC,EAAA0kC,aAAA,EACAz6B,EAAAiiB,SAAA8Z,EAAAxO,EAAAx3B,GAEA,CACA,SAAAgmC,EAAAxO,EAAAx3B,GAwBA,MAAAA,EAAAgkC,UAAAhkC,EAAA8hC,QAAA9hC,EAAApsB,OAAAosB,EAAAgiC,eAAAhiC,EAAA8jC,SAAA,IAAA9jC,EAAApsB,SAAA,CACA,IAAAD,EAAAqsB,EAAApsB,OAGA,GAFAm0B,EAAA,wBACAyvB,EAAAvwC,KAAA,GACAtT,IAAAqsB,EAAApsB,OAEA,KACA,CACAosB,EAAA0kC,aAAA,CACA,CAgPA,SAAAuB,EAAAnuD,GACA,IAAAkoB,EAAAloB,EAAAoqD,eACAliC,EAAAmkC,kBAAArsD,EAAAyoB,cAAA,YAAA,EACAP,EAAAokC,kBAAApkC,EAAAqkC,OAGArkC,EAAA8jC,SAAA,EAGAhsD,EAAAyoB,cAAA,QAAA,GACAzoB,EAAAmhD,QAEA,CACA,SAAAiN,EAAApuD,GACAiwB,EAAA,4BACAjwB,EAAAmP,KAAA,EACA,CAuBA,SAAAk/C,EAAA3O,EAAAx3B,GACA+H,EAAA,SAAA/H,EAAAgkC,SACAhkC,EAAAgkC,SACAxM,EAAAvwC,KAAA,GAEA+Y,EAAAokC,iBAAA,EACA5M,EAAAh4B,KAAA,UACAumC,EAAAvO,GACAx3B,EAAA8jC,UAAA9jC,EAAAgkC,SAAAxM,EAAAvwC,KAAA,EACA,CAWA,SAAA8+C,EAAAvO,GACA,IAAAx3B,EAAAw3B,EAAA0K,eAEA,IADAn6B,EAAA,OAAA/H,EAAA8jC,SACA9jC,EAAA8jC,SAAA,OAAAtM,EAAAvwC,SACA,CAmHA,SAAAm/C,EAAAxzD,EAAAotB,GAEA,OAAA,IAAAA,EAAApsB,OAAA,MAEAosB,EAAA0jC,WAAAz4C,EAAA+U,EAAAlb,OAAAjE,SAAAjO,GAAAA,GAAAotB,EAAApsB,QAEAqX,EAAA+U,EAAAwwB,QAAAxwB,EAAAlb,OAAAtH,KAAA,IAAA,IAAAwiB,EAAAlb,OAAAlR,OAAAosB,EAAAlb,OAAA8tB,QAAA5S,EAAAlb,OAAA5I,OAAA8jB,EAAApsB,QACAosB,EAAAlb,OAAA6gD,SAGA16C,EAAA+U,EAAAlb,OAAAuhD,QAAAzzD,EAAAotB,EAAAwwB,SAEAvlC,GATA,IAAAA,CAUA,CACA,SAAAq7C,EAAA9O,GACA,IAAAx3B,EAAAw3B,EAAA0K,eACAn6B,EAAA,cAAA/H,EAAA+jC,YACA/jC,EAAA+jC,aACA/jC,EAAA8hC,OAAA,EACA73B,EAAAiiB,SAAAqa,EAAAvmC,EAAAw3B,GAEA,CACA,SAAA+O,EAAAvmC,EAAAw3B,GAIA,GAHAzvB,EAAA,gBAAA/H,EAAA+jC,WAAA/jC,EAAApsB,SAGAosB,EAAA+jC,YAAA,IAAA/jC,EAAApsB,SACAosB,EAAA+jC,YAAA,EACAvM,EAAAmK,UAAA,EACAnK,EAAAh4B,KAAA,OACAQ,EAAAukC,aAAA,CAGA,IAAAiC,EAAAhP,EAAAqK,iBACA2E,GAAAA,EAAAjC,aAAAiC,EAAAC,WACAjP,EAAAkH,SAEA,CAEA,CASA,SAAAhhD,EAAAwmC,EAAAtlC,GACA,IAAA,IAAA/K,EAAA,EAAAiM,EAAAokC,EAAAtwC,OAAAC,EAAAiM,EAAAjM,IACA,GAAAqwC,EAAArwC,KAAA+K,EAAA,OAAA/K,EAEA,OAAA,CACA,CA1pBAqrD,EAAApsD,UAAAmU,KAAA,SAAArU,GACAm1B,EAAA,OAAAn1B,GACAA,EAAA8U,SAAA9U,EAAA,IACA,IAAAotB,EAAA3qB,KAAA6sD,eACAwE,EAAA9zD,EAMA,GALA,IAAAA,IAAAotB,EAAAkkC,iBAAA,GAKA,IAAAtxD,GAAAotB,EAAAikC,gBAAA,IAAAjkC,EAAAgiC,cAAAhiC,EAAApsB,QAAAosB,EAAAgiC,cAAAhiC,EAAApsB,OAAA,IAAAosB,EAAA8hC,OAGA,OAFA/5B,EAAA,qBAAA/H,EAAApsB,OAAAosB,EAAA8hC,OACA,IAAA9hC,EAAApsB,QAAAosB,EAAA8hC,MAAAwE,EAAAjxD,MAAA0vD,EAAA1vD,MACA,KAKA,GAAA,KAHAzC,EAAAizD,EAAAjzD,EAAAotB,KAGAA,EAAA8hC,MAEA,OADA,IAAA9hC,EAAApsB,QAAA0yD,EAAAjxD,MACA,KA0BA,IA2BA4V,EA3BA07C,EAAA3mC,EAAAikC,aA6CA,OA5CAl8B,EAAA,gBAAA4+B,IAGA,IAAA3mC,EAAApsB,QAAAosB,EAAApsB,OAAAhB,EAAAotB,EAAAgiC,gBAEAj6B,EAAA,6BADA4+B,GAAA,GAMA3mC,EAAA8hC,OAAA9hC,EAAAgkC,QAEAj8B,EAAA,mBADA4+B,GAAA,GAEAA,IACA5+B,EAAA,WACA/H,EAAAgkC,SAAA,EACAhkC,EAAA/kB,MAAA,EAEA,IAAA+kB,EAAApsB,SAAAosB,EAAAikC,cAAA,GAEA5uD,KAAA+qD,MAAApgC,EAAAgiC,eACAhiC,EAAA/kB,MAAA,EAGA+kB,EAAAgkC,UAAApxD,EAAAizD,EAAAa,EAAA1mC,KAIA,QADA/U,EAAArY,EAAA,EAAAwzD,EAAAxzD,EAAAotB,GAAA,OAEAA,EAAAikC,aAAAjkC,EAAApsB,QAAAosB,EAAAgiC,cACApvD,EAAA,IAEAotB,EAAApsB,QAAAhB,EACAotB,EAAAykC,WAAA,GAEA,IAAAzkC,EAAApsB,SAGAosB,EAAA8hC,QAAA9hC,EAAAikC,cAAA,GAGAyC,IAAA9zD,GAAAotB,EAAA8hC,OAAAwE,EAAAjxD,OAEA,OAAA4V,GAAA5V,KAAAmqB,KAAA,OAAAvU,GACAA,CACA,EA6GAi0C,EAAApsD,UAAAstD,MAAA,SAAAxtD,GACA2wD,EAAAluD,KAAA,IAAAguD,EAAA,WACA,EACAnE,EAAApsD,UAAAilD,KAAA,SAAA6O,EAAAC,GACA,IAAAn4C,EAAArZ,KACA2qB,EAAA3qB,KAAA6sD,eACA,OAAAliC,EAAA6jC,YACA,KAAA,EACA7jC,EAAA4jC,MAAAgD,EACA,MACA,KAAA,EACA5mC,EAAA4jC,MAAA,CAAA5jC,EAAA4jC,MAAAgD,GACA,MACA,QACA5mC,EAAA4jC,MAAA7oD,KAAA6rD,GAGA5mC,EAAA6jC,YAAA,EACA97B,EAAA,wBAAA/H,EAAA6jC,WAAAgD,GACA,IACAC,IADAD,IAAA,IAAAA,EAAAjpD,MAAAgpD,IAAA38B,EAAA88B,QAAAH,IAAA38B,EAAA+8B,OACApF,EAAAqF,EAGA,SAAAC,EAAAvF,EAAAwF,GACAp/B,EAAA,YACA45B,IAAAjzC,GACAy4C,IAAA,IAAAA,EAAAC,aACAD,EAAAC,YAAA,EAkBAr/B,EAAA,WAEA6+B,EAAAzoC,eAAA,QAAAkpC,GACAT,EAAAzoC,eAAA,SAAAmpC,GACAV,EAAAzoC,eAAA,QAAAopC,GACAX,EAAAzoC,eAAA,QAAAkgC,GACAuI,EAAAzoC,eAAA,SAAA+oC,GACAx4C,EAAAyP,eAAA,MAAAyjC,GACAlzC,EAAAyP,eAAA,MAAA8oC,GACAv4C,EAAAyP,eAAA,OAAAqpC,GACAC,GAAA,GAOAznC,EAAAykC,YAAAmC,EAAA/E,iBAAA+E,EAAA/E,eAAA6F,WAAAH,IA/BA,CACA,SAAA3F,IACA75B,EAAA,SACA6+B,EAAAhpD,KACA,CAdAoiB,EAAA+jC,WAAA95B,EAAAiiB,SAAA4a,GAAAp4C,EAAA1U,KAAA,MAAA8sD,GACAF,EAAApoC,GAAA,SAAA0oC,GAmBA,IAAAK,EAgFA,SAAA74C,GACA,OAAA,WACA,IAAAsR,EAAAtR,EAAAwzC,eACAn6B,EAAA,cAAA/H,EAAAykC,YACAzkC,EAAAykC,YAAAzkC,EAAAykC,aACA,IAAAzkC,EAAAykC,YAAAjC,EAAA9zC,EAAA,UACAsR,EAAA8jC,SAAA,EACAiC,EAAAr3C,GAEA,CACA,CA1FAi5C,CAAAj5C,GACAk4C,EAAApoC,GAAA,QAAA+oC,GACA,IAAAE,GAAA,EAsBA,SAAAD,EAAA9P,GACA3vB,EAAA,UACA,IAAA9c,EAAA27C,EAAApiD,MAAAkzC,GACA3vB,EAAA,aAAA9c,IACA,IAAAA,KAKA,IAAA+U,EAAA6jC,YAAA7jC,EAAA4jC,QAAAgD,GAAA5mC,EAAA6jC,WAAA,IAAA,IAAAnmD,EAAAsiB,EAAA4jC,MAAAgD,MAAAa,IACA1/B,EAAA,8BAAA/H,EAAAykC,YACAzkC,EAAAykC,cAEA/1C,EAAAk5C,QAEA,CAIA,SAAAvJ,EAAAv9B,GACAiH,EAAA,UAAAjH,GACAmmC,IACAL,EAAAzoC,eAAA,QAAAkgC,GACA,IAAAmE,EAAAoE,EAAA,UAAArD,EAAAqD,EAAA9lC,EACA,CAMA,SAAAumC,IACAT,EAAAzoC,eAAA,SAAAmpC,GACAL,GACA,CAEA,SAAAK,IACAv/B,EAAA,YACA6+B,EAAAzoC,eAAA,QAAAkpC,GACAJ,GACA,CAEA,SAAAA,IACAl/B,EAAA,UACArZ,EAAAu4C,OAAAL,EACA,CAUA,OAvDAl4C,EAAA8P,GAAA,OAAAgpC,GAniBA,SAAA1pC,EAAA+pC,EAAA/tD,GAGA,GAAA,mBAAAgkB,EAAAqD,gBAAA,OAAArD,EAAAqD,gBAAA0mC,EAAA/tD,GAMAgkB,EAAAY,SAAAZ,EAAAY,QAAAmpC,GAAAz0D,MAAAM,QAAAoqB,EAAAY,QAAAmpC,IAAA/pC,EAAAY,QAAAmpC,GAAA3oD,QAAApF,GAAAgkB,EAAAY,QAAAmpC,GAAA,CAAA/tD,EAAAgkB,EAAAY,QAAAmpC,IAAA/pC,EAAAU,GAAAqpC,EAAA/tD,EACA,CAqjBAqnB,CAAAylC,EAAA,QAAAvI,GAOAuI,EAAA5sD,KAAA,QAAAqtD,GAMAT,EAAA5sD,KAAA,SAAAstD,GAOAV,EAAApnC,KAAA,OAAA9Q,GAGAsR,EAAA8jC,UACA/7B,EAAA,eACArZ,EAAAuqC,UAEA2N,CACA,EAYA1H,EAAApsD,UAAAm0D,OAAA,SAAAL,GACA,IAAA5mC,EAAA3qB,KAAA6sD,eACAiF,EAAA,CACAC,YAAA,GAIA,GAAA,IAAApnC,EAAA6jC,WAAA,OAAAxuD,KAGA,GAAA,IAAA2qB,EAAA6jC,WAEA,OAAA+C,GAAAA,IAAA5mC,EAAA4jC,QACAgD,IAAAA,EAAA5mC,EAAA4jC,OAGA5jC,EAAA4jC,MAAA,KACA5jC,EAAA6jC,WAAA,EACA7jC,EAAA8jC,SAAA,EACA8C,GAAAA,EAAApnC,KAAA,SAAAnqB,KAAA8xD,IAPA9xD,KAaA,IAAAuxD,EAAA,CAEA,IAAAkB,EAAA9nC,EAAA4jC,MACAjwD,EAAAqsB,EAAA6jC,WACA7jC,EAAA4jC,MAAA,KACA5jC,EAAA6jC,WAAA,EACA7jC,EAAA8jC,SAAA,EACA,IAAA,IAAAjwD,EAAA,EAAAA,EAAAF,EAAAE,IAAAi0D,EAAAj0D,GAAA2rB,KAAA,SAAAnqB,KAAA,CACA+xD,YAAA,IAEA,OAAA/xD,IACA,CAGA,IAAAwE,EAAA6D,EAAAsiB,EAAA4jC,MAAAgD,GACA,OAAA,IAAA/sD,IACAmmB,EAAA4jC,MAAA1xB,OAAAr4B,EAAA,GACAmmB,EAAA6jC,YAAA,EACA,IAAA7jC,EAAA6jC,aAAA7jC,EAAA4jC,MAAA5jC,EAAA4jC,MAAA,IACAgD,EAAApnC,KAAA,SAAAnqB,KAAA8xD,IAJA9xD,IAMA,EAIA6pD,EAAApsD,UAAA0rB,GAAA,SAAAupC,EAAAjuD,GACA,IAAAnD,EAAA8rD,EAAA3vD,UAAA0rB,GAAAxrB,KAAAqC,KAAA0yD,EAAAjuD,GACAkmB,EAAA3qB,KAAA6sD,eAqBA,MApBA,SAAA6F,GAGA/nC,EAAAmkC,kBAAA9uD,KAAAkrB,cAAA,YAAA,GAGA,IAAAP,EAAA8jC,SAAAzuD,KAAA4jD,UACA,aAAA8O,IACA/nC,EAAA+jC,YAAA/jC,EAAAmkC,oBACAnkC,EAAAmkC,kBAAAnkC,EAAAikC,cAAA,EACAjkC,EAAA8jC,SAAA,EACA9jC,EAAAkkC,iBAAA,EACAn8B,EAAA,cAAA/H,EAAApsB,OAAAosB,EAAAgkC,SACAhkC,EAAApsB,OACAmxD,EAAA1vD,MACA2qB,EAAAgkC,SACA/5B,EAAAiiB,SAAAga,EAAA7wD,QAIAsB,CACA,EACAuoD,EAAApsD,UAAAouB,YAAAg+B,EAAApsD,UAAA0rB,GACA0gC,EAAApsD,UAAAqrB,eAAA,SAAA4pC,EAAAjuD,GACA,IAAAnD,EAAA8rD,EAAA3vD,UAAAqrB,eAAAnrB,KAAAqC,KAAA0yD,EAAAjuD,GAUA,MATA,aAAAiuD,GAOA99B,EAAAiiB,SAAA+Z,EAAA5wD,MAEAsB,CACA,EACAuoD,EAAApsD,UAAA2uB,mBAAA,SAAAsmC,GACA,IAAApxD,EAAA8rD,EAAA3vD,UAAA2uB,mBAAArsB,MAAAC,KAAAF,WAUA,MATA,aAAA4yD,QAAArxD,IAAAqxD,GAOA99B,EAAAiiB,SAAA+Z,EAAA5wD,MAEAsB,CACA,EAqBAuoD,EAAApsD,UAAAmmD,OAAA,WACA,IAAAj5B,EAAA3qB,KAAA6sD,eAUA,OATAliC,EAAA8jC,UACA/7B,EAAA,UAIA/H,EAAA8jC,SAAA9jC,EAAAmkC,kBAMA,SAAA3M,EAAAx3B,GACAA,EAAAokC,kBACApkC,EAAAokC,iBAAA,EACAn6B,EAAAiiB,SAAAia,EAAA3O,EAAAx3B,GAEA,CAVAi5B,CAAA5jD,KAAA2qB,IAEAA,EAAAqkC,QAAA,EACAhvD,IACA,EAiBA6pD,EAAApsD,UAAA80D,MAAA,WAQA,OAPA7/B,EAAA,wBAAA1yB,KAAA6sD,eAAA4B,UACA,IAAAzuD,KAAA6sD,eAAA4B,UACA/7B,EAAA,SACA1yB,KAAA6sD,eAAA4B,SAAA,EACAzuD,KAAAmqB,KAAA,UAEAnqB,KAAA6sD,eAAAmC,QAAA,EACAhvD,IACA,EAUA6pD,EAAApsD,UAAAk1D,KAAA,SAAAxQ,GACA,IAAAyQ,EAAA5yD,KACA2qB,EAAA3qB,KAAA6sD,eACAmC,GAAA,EAwBA,IAAA,IAAAxwD,KAvBA2jD,EAAAh5B,GAAA,OAAA,WAEA,GADAuJ,EAAA,eACA/H,EAAAwwB,UAAAxwB,EAAA8hC,MAAA,CACA,IAAApK,EAAA13B,EAAAwwB,QAAA5yC,MACA85C,GAAAA,EAAA9jD,QAAAq0D,EAAAltD,KAAA28C,EACA,CACAuQ,EAAAltD,KAAA,KACA,IACAy8C,EAAAh5B,GAAA,QAAA,SAAAk5B,IACA3vB,EAAA,gBACA/H,EAAAwwB,UAAAkH,EAAA13B,EAAAwwB,QAAAhsC,MAAAkzC,IAGA13B,EAAA0jC,YAAA,MAAAhM,KAAA13B,EAAA0jC,YAAAhM,GAAAA,EAAA9jD,UACAq0D,EAAAltD,KAAA28C,KAEA2M,GAAA,EACA7M,EAAAoQ,SAEA,IAIApQ,OACA9gD,IAAArB,KAAAxB,IAAA,mBAAA2jD,EAAA3jD,KACAwB,KAAAxB,GAAA,SAAA4kD,GACA,OAAA,WACA,OAAAjB,EAAAiB,GAAArjD,MAAAoiD,EAAAriD,UACA,CACA,CAJA,CAIAtB,IAKA,IAAA,IAAAjB,EAAA,EAAAA,EAAA4wD,EAAA5vD,OAAAhB,IACA4kD,EAAAh5B,GAAAglC,EAAA5wD,GAAAyC,KAAAmqB,KAAA7qB,KAAAU,KAAAmuD,EAAA5wD,KAYA,OAPAyC,KAAA+qD,MAAA,SAAAxtD,GACAm1B,EAAA,gBAAAn1B,GACAyxD,IACAA,GAAA,EACA7M,EAAAyB,SAEA,EACA5jD,IACA,EACA,mBAAA7B,SACA0rD,EAAApsD,UAAAU,OAAA00D,eAAA,WAIA,YAHAxxD,IAAAosD,IACAA,EAAA5pD,EAAA,sCAEA4pD,EAAAztD,KACA,GAEAxC,OAAAuB,eAAA8qD,EAAApsD,UAAA,wBAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,OAAAW,KAAA6sD,eAAAF,aACA,IAEAnvD,OAAAuB,eAAA8qD,EAAApsD,UAAA,iBAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,OAAAW,KAAA6sD,gBAAA7sD,KAAA6sD,eAAAp9C,MACA,IAEAjS,OAAAuB,eAAA8qD,EAAApsD,UAAA,kBAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,OAAAW,KAAA6sD,eAAA4B,OACA,EACA11C,IAAA,SAAA4R,GACA3qB,KAAA6sD,iBACA7sD,KAAA6sD,eAAA4B,QAAA9jC,EAEA,IAIAk/B,EAAAiJ,UAAA/B,EACAvzD,OAAAuB,eAAA8qD,EAAApsD,UAAA,iBAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,OAAAW,KAAA6sD,eAAAtuD,MACA,IA+CA,mBAAAJ,SACA0rD,EAAA7rD,KAAA,SAAA+0D,EAAAhmB,GAIA,YAHA1rC,IAAArD,IACAA,EAAA6F,EAAA,4BAEA7F,EAAA6rD,EAAAkJ,EAAAhmB,EACA,EjGy3ZC,GAAEpvC,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,YAA8B,oBAAXL,OAAyBA,OAAyB,oBAATf,KAAuBA,KAAyB,oBAAXc,OAAyBA,OAAS,CAAC,EAEtK,EAAE,CAAC,YAAY,GAAG,mBAAmB,GAAG,oCAAoC,IAAI,iCAAiC,IAAI,6BAA6B,IAAI,0BAA0B,IAAI,2BAA2B,IAAI,4BAA4B,IAAImyB,SAAW,GAAGjmB,OAAS,GAAGsa,OAAS,GAAGi8B,SAAW,GAAG,kBAAkB,IAAIgN,KAAO,KAAK,GAAG,CAAC,SAASnvD,EAAQT,EAAOD,GkGrzbrWC,EAAAD,QAAA6pD,EACA,IAAAa,EAAAhqD,EAAA,aAAAwnD,MACA2C,EAAAH,EAAAG,2BACAiF,EAAApF,EAAAoF,sBACAC,EAAArF,EAAAqF,mCACAC,EAAAtF,EAAAsF,4BACA/G,EAAAvoD,EAAA,oBAEA,SAAAuvD,EAAA3nC,EAAAvb,GACA,IAAAmjD,EAAArzD,KAAAszD,gBACAD,EAAAE,cAAA,EACA,IAAAlvD,EAAAgvD,EAAAG,QACA,GAAA,OAAAnvD,EACA,OAAArE,KAAAmqB,KAAA,QAAA,IAAA8oC,GAEAI,EAAAI,WAAA,KACAJ,EAAAG,QAAA,KACA,MAAAtjD,GAEAlQ,KAAA0F,KAAAwK,GACA7L,EAAAonB,GACA,IAAAioC,EAAA1zD,KAAA6sD,eACA6G,EAAA/E,SAAA,GACA+E,EAAA9E,cAAA8E,EAAAn1D,OAAAm1D,EAAA/G,gBACA3sD,KAAA+qD,MAAA2I,EAAA/G,cAEA,CACA,SAAAK,EAAArvC,GACA,KAAA3d,gBAAAgtD,GAAA,OAAA,IAAAA,EAAArvC,GACAyuC,EAAAzuD,KAAAqC,KAAA2d,GACA3d,KAAAszD,gBAAA,CACAF,eAAAA,EAAA9zD,KAAAU,MACA2zD,eAAA,EACAJ,cAAA,EACAC,QAAA,KACAC,WAAA,KACAG,cAAA,MAIA5zD,KAAA6sD,eAAA+B,cAAA,EAKA5uD,KAAA6sD,eAAAjnD,MAAA,EACA+X,IACA,mBAAAA,EAAAk2C,YAAA7zD,KAAAitD,WAAAtvC,EAAAk2C,WACA,mBAAAl2C,EAAAm2C,QAAA9zD,KAAA+zD,OAAAp2C,EAAAm2C,QAIA9zD,KAAAmpB,GAAA,YAAA6qC,EACA,CACA,SAAAA,IACA,IAAApB,EAAA5yD,KACA,mBAAAA,KAAA+zD,QAAA/zD,KAAA6sD,eAAAC,UAKA9nD,EAAAhF,KAAA,KAAA,MAJAA,KAAA+zD,QAAA,SAAAtoC,EAAAvb,GACAlL,EAAA4tD,EAAAnnC,EAAAvb,EACA,GAIA,CAiDA,SAAAlL,EAAAm9C,EAAA12B,EAAAvb,GACA,GAAAub,EAAA,OAAA02B,EAAAh4B,KAAA,QAAAsB,GAQA,GAPA,MAAAvb,GAEAiyC,EAAAz8C,KAAAwK,GAKAiyC,EAAAqK,eAAAjuD,OAAA,MAAA,IAAA40D,EACA,GAAAhR,EAAAmR,gBAAAC,aAAA,MAAA,IAAAL,EACA,OAAA/Q,EAAAz8C,KAAA,KACA,CArHA7B,EAAA,WAAAA,CAAAmpD,EAAAZ,GAyDAY,EAAAvvD,UAAAiI,KAAA,SAAA28C,EAAArzC,GAEA,OADAhP,KAAAszD,gBAAAK,eAAA,EACAvH,EAAA3uD,UAAAiI,KAAA/H,KAAAqC,KAAAqiD,EAAArzC,EACA,EAYAg+C,EAAAvvD,UAAAwvD,WAAA,SAAA5K,EAAArzC,EAAA3K,GACAA,EAAA,IAAA2pD,EAAA,gBACA,EACAhB,EAAAvvD,UAAA2rD,OAAA,SAAA/G,EAAArzC,EAAA3K,GACA,IAAAgvD,EAAArzD,KAAAszD,gBAIA,GAHAD,EAAAG,QAAAnvD,EACAgvD,EAAAI,WAAApR,EACAgR,EAAAO,cAAA5kD,GACAqkD,EAAAE,aAAA,CACA,IAAAG,EAAA1zD,KAAA6sD,gBACAwG,EAAAM,eAAAD,EAAA9E,cAAA8E,EAAAn1D,OAAAm1D,EAAA/G,gBAAA3sD,KAAA+qD,MAAA2I,EAAA/G,cACA,CACA,EAKAK,EAAAvvD,UAAAstD,MAAA,SAAAxtD,GACA,IAAA81D,EAAArzD,KAAAszD,gBACA,OAAAD,EAAAI,YAAAJ,EAAAE,aAMAF,EAAAM,eAAA,GALAN,EAAAE,cAAA,EACAvzD,KAAAitD,WAAAoG,EAAAI,WAAAJ,EAAAO,cAAAP,EAAAD,gBAMA,EACApG,EAAAvvD,UAAA6xD,SAAA,SAAAlqD,EAAAf,GACA+nD,EAAA3uD,UAAA6xD,SAAA3xD,KAAAqC,KAAAoF,GAAA,SAAA6uD,GACA5vD,EAAA4vD,EACA,GACA,ClGq4bA,EAAE,CAAC,YAAY,GAAG,mBAAmB,GAAGjO,SAAW,KAAK,IAAI,CAAC,SAASniD,EAAQT,EAAOD,IACrF,SAAWyxB,EAAQpxB,IAAQ,WmG/gc3B,SAAA0wD,EAAAvpC,GACA,IAAAioC,EAAA5yD,KACAA,KAAA0E,KAAA,KACA1E,KAAAm0D,MAAA,KACAn0D,KAAAo0D,OAAA,YA6iBA,SAAAC,EAAA1pC,EAAAvlB,GACA,IAAA+uD,EAAAE,EAAAF,MACAE,EAAAF,MAAA,KACA,KAAAA,GAAA,CACA,IAAA9vD,EAAA8vD,EAAA3uD,SACAmlB,EAAA2pC,YACAjwD,EAAAe,GACA+uD,EAAAA,EAAAzvD,IACA,CAGAimB,EAAA4pC,mBAAA7vD,KAAA2vD,CACA,CAxjBAG,CAAA5B,EAAAjoC,EACA,CACA,CAIA,IAAAyhC,EAvBAhpD,EAAAD,QAAAijD,EA0BAA,EAAAqO,cAAAA,EAGA,IAAAC,EAAA,CACAC,UAAA9wD,EAAA,mBAKAupD,EAAAvpD,EAAA,6BAGAsK,EAAAtK,EAAA,UAAAsK,OACAk/C,QAAA,IAAA7pD,EAAAA,EAAA,oBAAAD,OAAAA,OAAA,oBAAAd,KAAAA,KAAA,CAAA,GAAA2F,YAAA,WAAA,EAOA,IA8IAwsD,EA9IAjH,EAAA9pD,EAAA,8BAEA+pD,EADA/pD,EAAA,4BACA+pD,iBACAC,EAAAhqD,EAAA,aAAAwnD,MACAyC,EAAAD,EAAAC,qBACAE,EAAAH,EAAAG,2BACAiF,EAAApF,EAAAoF,sBACA4B,EAAAhH,EAAAgH,uBACAC,EAAAjH,EAAAiH,qBACAC,EAAAlH,EAAAkH,uBACAC,EAAAnH,EAAAmH,2BACAC,EAAApH,EAAAoH,qBACA/G,EAAAP,EAAAO,eAEA,SAAAgH,IAAA,CACA,SAAAT,EAAA92C,EAAAwkC,EAAAiM,GACAhC,EAAAA,GAAAvoD,EAAA,oBACA8Z,EAAAA,GAAA,CAAA,EAOA,kBAAAywC,IAAAA,EAAAjM,aAAAiK,GAIApsD,KAAAquD,aAAA1wC,EAAA0wC,WACAD,IAAApuD,KAAAquD,WAAAruD,KAAAquD,cAAA1wC,EAAAw3C,oBAKAn1D,KAAA2sD,cAAAiB,EAAA5tD,KAAA2d,EAAA,wBAAAywC,GAGApuD,KAAAo1D,aAAA,EAGAp1D,KAAAqyD,WAAA,EAEAryD,KAAAq1D,QAAA,EAEAr1D,KAAAysD,OAAA,EAEAzsD,KAAAoxD,UAAA,EAGApxD,KAAA8sD,WAAA,EAKA,IAAAwI,GAAA,IAAA33C,EAAA43C,cACAv1D,KAAAu1D,eAAAD,EAKAt1D,KAAAmvD,gBAAAxxC,EAAAwxC,iBAAA,OAKAnvD,KAAAzB,OAAA,EAGAyB,KAAAw1D,SAAA,EAGAx1D,KAAAy1D,OAAA,EAMAz1D,KAAA4F,MAAA,EAKA5F,KAAA01D,kBAAA,EAGA11D,KAAA21D,QAAA,SAAAlqC,IAsQA,SAAA02B,EAAA12B,GACA,IAAAd,EAAAw3B,EAAAqK,eACA5mD,EAAA+kB,EAAA/kB,KACAvB,EAAAsmB,EAAA6oC,QACA,GAAA,mBAAAnvD,EAAA,MAAA,IAAA4uD,EAEA,GAZA,SAAAtoC,GACAA,EAAA6qC,SAAA,EACA7qC,EAAA6oC,QAAA,KACA7oC,EAAApsB,QAAAosB,EAAAirC,SACAjrC,EAAAirC,SAAA,CACA,CAMAC,CAAAlrC,GACAc,GAlCA,SAAA02B,EAAAx3B,EAAA/kB,EAAA6lB,EAAApnB,KACAsmB,EAAA2pC,UACA1uD,GAGAgvB,EAAAiiB,SAAAxyC,EAAAonB,GAGAmJ,EAAAiiB,SAAAif,EAAA3T,EAAAx3B,GACAw3B,EAAAqK,eAAAuJ,cAAA,EACA7H,EAAA/L,EAAA12B,KAIApnB,EAAAonB,GACA02B,EAAAqK,eAAAuJ,cAAA,EACA7H,EAAA/L,EAAA12B,GAGAqqC,EAAA3T,EAAAx3B,GAEA,CAaAqrC,CAAA7T,EAAAx3B,EAAA/kB,EAAA6lB,EAAApnB,OAAA,CAEA,IAAA+sD,EAAA6E,EAAAtrC,IAAAw3B,EAAA2K,UACAsE,GAAAzmC,EAAA8qC,QAAA9qC,EAAA+qC,mBAAA/qC,EAAAurC,iBACAC,EAAAhU,EAAAx3B,GAEA/kB,EACAgvB,EAAAiiB,SAAAuf,EAAAjU,EAAAx3B,EAAAymC,EAAA/sD,GAEA+xD,EAAAjU,EAAAx3B,EAAAymC,EAAA/sD,EAEA,CACA,CAvRAsxD,CAAAxT,EAAA12B,EACA,EAGAzrB,KAAAwzD,QAAA,KAGAxzD,KAAA41D,SAAA,EACA51D,KAAAk2D,gBAAA,KACAl2D,KAAAq2D,oBAAA,KAIAr2D,KAAAs0D,UAAA,EAIAt0D,KAAAs2D,aAAA,EAGAt2D,KAAA+1D,cAAA,EAGA/1D,KAAAivD,WAAA,IAAAtxC,EAAAsxC,UAGAjvD,KAAAkvD,cAAAvxC,EAAAuxC,YAGAlvD,KAAAu2D,qBAAA,EAIAv2D,KAAAu0D,mBAAA,IAAAL,EAAAl0D,KACA,CAqCA,SAAAomD,EAAAzoC,GAaA,IAAAywC,EAAApuD,gBAZAosD,EAAAA,GAAAvoD,EAAA,qBAaA,IAAAuqD,IAAAwG,EAAAj3D,KAAAyoD,EAAApmD,MAAA,OAAA,IAAAomD,EAAAzoC,GACA3d,KAAAwsD,eAAA,IAAAiI,EAAA92C,EAAA3d,KAAAouD,GAGApuD,KAAAd,UAAA,EACAye,IACA,mBAAAA,EAAAxO,QAAAnP,KAAAopD,OAAAzrC,EAAAxO,OACA,mBAAAwO,EAAA64C,SAAAx2D,KAAAy2D,QAAA94C,EAAA64C,QACA,mBAAA74C,EAAA0rC,UAAArpD,KAAAsvD,SAAA3xC,EAAA0rC,SACA,mBAAA1rC,EAAA,QAAA3d,KAAA02D,OAAA/4C,EAAA,QAEAyvC,EAAAzvD,KAAAqC,KACA,CAgIA,SAAA22D,EAAAxU,EAAAx3B,EAAA6rC,EAAAl4D,EAAA+jD,EAAArzC,EAAA3K,GACAsmB,EAAAirC,SAAAt3D,EACAqsB,EAAA6oC,QAAAnvD,EACAsmB,EAAA6qC,SAAA,EACA7qC,EAAA/kB,MAAA,EACA+kB,EAAAmiC,UAAAniC,EAAAgrC,QAAA,IAAAb,EAAA,UAAA0B,EAAArU,EAAAsU,QAAApU,EAAA13B,EAAAgrC,SAAAxT,EAAAiH,OAAA/G,EAAArzC,EAAA2b,EAAAgrC,SACAhrC,EAAA/kB,MAAA,CACA,CAgDA,SAAAwwD,EAAAjU,EAAAx3B,EAAAymC,EAAA/sD,GACA+sD,GASA,SAAAjP,EAAAx3B,GACA,IAAAA,EAAApsB,QAAAosB,EAAA0nC,YACA1nC,EAAA0nC,WAAA,EACAlQ,EAAAh4B,KAAA,SAEA,CAdAysC,CAAAzU,EAAAx3B,GACAA,EAAA2pC,YACAjwD,IACAyxD,EAAA3T,EAAAx3B,EACA,CAaA,SAAAwrC,EAAAhU,EAAAx3B,GACAA,EAAA+qC,kBAAA,EACA,IAAAvB,EAAAxpC,EAAAurC,gBACA,GAAA/T,EAAAsU,SAAAtC,GAAAA,EAAAzvD,KAAA,CAEA,IAAA+F,EAAAkgB,EAAA4rC,qBACA9mD,EAAA,IAAA1R,MAAA0M,GACAosD,EAAAlsC,EAAA4pC,mBACAsC,EAAA1C,MAAAA,EAGA,IAFA,IAAA9pC,EAAA,EACAysC,GAAA,EACA3C,GACA1kD,EAAA4a,GAAA8pC,EACAA,EAAA4C,QAAAD,GAAA,GACA3C,EAAAA,EAAAzvD,KACA2lB,GAAA,EAEA5a,EAAAqnD,WAAAA,EACAH,EAAAxU,EAAAx3B,GAAA,EAAAA,EAAApsB,OAAAkR,EAAA,GAAAonD,EAAAzC,QAIAzpC,EAAA2pC,YACA3pC,EAAA0rC,oBAAA,KACAQ,EAAAnyD,MACAimB,EAAA4pC,mBAAAsC,EAAAnyD,KACAmyD,EAAAnyD,KAAA,MAEAimB,EAAA4pC,mBAAA,IAAAL,EAAAvpC,GAEAA,EAAA4rC,qBAAA,CACA,KAAA,CAEA,KAAApC,GAAA,CACA,IAAA9R,EAAA8R,EAAA9R,MACArzC,EAAAmlD,EAAAnlD,SACA3K,EAAA8vD,EAAA3uD,SASA,GAPAmxD,EAAAxU,EAAAx3B,GAAA,EADAA,EAAA0jC,WAAA,EAAAhM,EAAA9jD,OACA8jD,EAAArzC,EAAA3K,GACA8vD,EAAAA,EAAAzvD,KACAimB,EAAA4rC,uBAKA5rC,EAAA6qC,QACA,KAEA,CACA,OAAArB,IAAAxpC,EAAA0rC,oBAAA,KACA,CACA1rC,EAAAurC,gBAAA/B,EACAxpC,EAAA+qC,kBAAA,CACA,CAoCA,SAAAO,EAAAtrC,GACA,OAAAA,EAAA0qC,QAAA,IAAA1qC,EAAApsB,QAAA,OAAAosB,EAAAurC,kBAAAvrC,EAAAymC,WAAAzmC,EAAA6qC,OACA,CACA,SAAAwB,EAAA7U,EAAAx3B,GACAw3B,EAAAuU,QAAA,SAAAtxD,GACAulB,EAAA2pC,YACAlvD,GACA8oD,EAAA/L,EAAA/8C,GAEAulB,EAAA2rC,aAAA,EACAnU,EAAAh4B,KAAA,aACA2rC,EAAA3T,EAAAx3B,EACA,GACA,CAaA,SAAAmrC,EAAA3T,EAAAx3B,GACA,IAAAssC,EAAAhB,EAAAtrC,GACA,GAAAssC,IAdA,SAAA9U,EAAAx3B,GACAA,EAAA2rC,aAAA3rC,EAAAyqC,cACA,mBAAAjT,EAAAuU,QAAA/rC,EAAAmiC,WAKAniC,EAAA2rC,aAAA,EACAnU,EAAAh4B,KAAA,eALAQ,EAAA2pC,YACA3pC,EAAAyqC,aAAA,EACAxgC,EAAAiiB,SAAAmgB,EAAA7U,EAAAx3B,IAMA,CAIAqpC,CAAA7R,EAAAx3B,GACA,IAAAA,EAAA2pC,YACA3pC,EAAAymC,UAAA,EACAjP,EAAAh4B,KAAA,UACAQ,EAAAukC,cAAA,CAGA,IAAAgI,EAAA/U,EAAA0K,iBACAqK,GAAAA,EAAAhI,aAAAgI,EAAAxI,aACAvM,EAAAkH,SAEA,CAGA,OAAA4N,CACA,CAxfApzD,EAAA,WAAAA,CAAAuiD,EAAAgH,GA4GAqH,EAAAh3D,UAAAmvD,UAAA,WAGA,IAFA,IAAAuK,EAAAn3D,KAAAk2D,gBACArgD,EAAA,GACAshD,GACAthD,EAAAnQ,KAAAyxD,GACAA,EAAAA,EAAAzyD,KAEA,OAAAmR,CACA,EACA,WACA,IACArY,OAAAuB,eAAA01D,EAAAh3D,UAAA,SAAA,CACA4B,IAAAq1D,EAAAC,WAAA,WACA,OAAA30D,KAAA4sD,WACA,GAAA,6EAAA,YAEA,CAAA,MAAAnsC,GAAA,CACA,CARA,GAaA,mBAAAtiB,QAAAA,OAAAi5D,aAAA,mBAAAjvC,SAAA1qB,UAAAU,OAAAi5D,cACAxC,EAAAzsC,SAAA1qB,UAAAU,OAAAi5D,aACA55D,OAAAuB,eAAAqnD,EAAAjoD,OAAAi5D,YAAA,CACAv4D,MAAA,SAAAoB,GACA,QAAA20D,EAAAj3D,KAAAqC,KAAAC,IACAD,OAAAomD,IACAnmD,GAAAA,EAAAusD,0BAAAiI,EACA,KAGAG,EAAA,SAAA30D,GACA,OAAAA,aAAAD,IACA,EA+BAomD,EAAA3oD,UAAAilD,KAAA,WACAwL,EAAAluD,KAAA,IAAA60D,EACA,EAyBAzO,EAAA3oD,UAAA0R,MAAA,SAAAkzC,EAAArzC,EAAA3K,GACA,IAzNA1F,EAyNAgsB,EAAA3qB,KAAAwsD,eACA52C,GAAA,EACAmhD,GAAApsC,EAAA0jC,aA3NA1vD,EA2NA0jD,EA1NAl0C,EAAA0B,SAAAlR,IAAAA,aAAA0uD,GAwOA,OAbA0J,IAAA5oD,EAAA0B,SAAAwyC,KACAA,EAhOA,SAAAA,GACA,OAAAl0C,EAAAnQ,KAAAqkD,EACA,CA8NAyN,CAAAzN,IAEA,mBAAArzC,IACA3K,EAAA2K,EACAA,EAAA,MAEA+nD,EAAA/nD,EAAA,SAAAA,IAAAA,EAAA2b,EAAAwkC,iBACA,mBAAA9qD,IAAAA,EAAA6wD,GACAvqC,EAAA0qC,OArCA,SAAAlT,EAAA99C,GACA,IAAAonB,EAAA,IAAAupC,EAEA9G,EAAA/L,EAAA12B,GACAmJ,EAAAiiB,SAAAxyC,EAAAonB,EACA,CAgCA4rC,CAAAr3D,KAAAqE,IAAA0yD,GA3BA,SAAA5U,EAAAx3B,EAAA03B,EAAAh+C,GACA,IAAAonB,EAMA,OALA,OAAA42B,EACA52B,EAAA,IAAAspC,EACA,iBAAA1S,GAAA13B,EAAA0jC,aACA5iC,EAAA,IAAAqiC,EAAA,QAAA,CAAA,SAAA,UAAAzL,KAEA52B,IACAyiC,EAAA/L,EAAA12B,GACAmJ,EAAAiiB,SAAAxyC,EAAAonB,IACA,EAGA,CAcA6rC,CAAAt3D,KAAA2qB,EAAA03B,EAAAh+C,MACAsmB,EAAA2pC,YACA1+C,EAiDA,SAAAusC,EAAAx3B,EAAAosC,EAAA1U,EAAArzC,EAAA3K,GACA,IAAA0yD,EAAA,CACA,IAAAQ,EArBA,SAAA5sC,EAAA03B,EAAArzC,GACA2b,EAAA0jC,aAAA,IAAA1jC,EAAA4qC,eAAA,iBAAAlT,IACAA,EAAAl0C,EAAAnQ,KAAAqkD,EAAArzC,IAEA,OAAAqzC,CACA,CAgBAmV,CAAA7sC,EAAA03B,EAAArzC,GACAqzC,IAAAkV,IACAR,GAAA,EACA/nD,EAAA,SACAqzC,EAAAkV,EAEA,CACA,IAAAj5D,EAAAqsB,EAAA0jC,WAAA,EAAAhM,EAAA9jD,OACAosB,EAAApsB,QAAAD,EACA,IAAAsX,EAAA+U,EAAApsB,OAAAosB,EAAAgiC,cAEA/2C,IAAA+U,EAAA0nC,WAAA,GACA,GAAA1nC,EAAA6qC,SAAA7qC,EAAA8qC,OAAA,CACA,IAAAj4B,EAAA7S,EAAA0rC,oBACA1rC,EAAA0rC,oBAAA,CACAhU,MAAAA,EACArzC,SAAAA,EACA+nD,MAAAA,EACAvxD,SAAAnB,EACAK,KAAA,MAEA84B,EACAA,EAAA94B,KAAAimB,EAAA0rC,oBAEA1rC,EAAAurC,gBAAAvrC,EAAA0rC,oBAEA1rC,EAAA4rC,sBAAA,CACA,MACAI,EAAAxU,EAAAx3B,GAAA,EAAArsB,EAAA+jD,EAAArzC,EAAA3K,GAEA,OAAAuR,CACA,CAlFA6hD,CAAAz3D,KAAA2qB,EAAAosC,EAAA1U,EAAArzC,EAAA3K,IAEAuR,CACA,EACAwwC,EAAA3oD,UAAAi6D,KAAA,WACA13D,KAAAwsD,eAAAiJ,QACA,EACArP,EAAA3oD,UAAAk6D,OAAA,WACA,IAAAhtC,EAAA3qB,KAAAwsD,eACA7hC,EAAA8qC,SACA9qC,EAAA8qC,SACA9qC,EAAA6qC,SAAA7qC,EAAA8qC,QAAA9qC,EAAA+qC,mBAAA/qC,EAAAurC,iBAAAC,EAAAn2D,KAAA2qB,GAEA,EACAy7B,EAAA3oD,UAAAm6D,mBAAA,SAAA5oD,GAGA,GADA,iBAAAA,IAAAA,EAAAA,EAAA0B,iBACA,CAAA,MAAA,OAAA,QAAA,QAAA,SAAA,SAAA,OAAA,QAAA,UAAA,WAAA,OAAArI,SAAA2G,EAAA,IAAA0B,gBAAA,GAAA,MAAA,IAAAukD,EAAAjmD,GAEA,OADAhP,KAAAwsD,eAAA2C,gBAAAngD,EACAhP,IACA,EACAxC,OAAAuB,eAAAqnD,EAAA3oD,UAAA,iBAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,OAAAW,KAAAwsD,gBAAAxsD,KAAAwsD,eAAAI,WACA,IAQApvD,OAAAuB,eAAAqnD,EAAA3oD,UAAA,wBAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,OAAAW,KAAAwsD,eAAAG,aACA,IAuKAvG,EAAA3oD,UAAA2rD,OAAA,SAAA/G,EAAArzC,EAAA3K,GACAA,EAAA,IAAA2pD,EAAA,YACA,EACA5H,EAAA3oD,UAAAg5D,QAAA,KACArQ,EAAA3oD,UAAA8K,IAAA,SAAA85C,EAAArzC,EAAA3K,GACA,IAAAsmB,EAAA3qB,KAAAwsD,eAmBA,MAlBA,mBAAAnK,GACAh+C,EAAAg+C,EACAA,EAAA,KACArzC,EAAA,MACA,mBAAAA,IACA3K,EAAA2K,EACAA,EAAA,MAEAqzC,SAAAriD,KAAAmP,MAAAkzC,EAAArzC,GAGA2b,EAAA8qC,SACA9qC,EAAA8qC,OAAA,EACAz1D,KAAA23D,UAIAhtC,EAAA0qC,QAyDA,SAAAlT,EAAAx3B,EAAAtmB,GACAsmB,EAAA0qC,QAAA,EACAS,EAAA3T,EAAAx3B,GACAtmB,IACAsmB,EAAAymC,SAAAx8B,EAAAiiB,SAAAxyC,GAAA89C,EAAAx9C,KAAA,SAAAN,IAEAsmB,EAAA8hC,OAAA,EACAtK,EAAAjjD,UAAA,CACA,CAjEA24D,CAAA73D,KAAA2qB,EAAAtmB,GACArE,IACA,EACAxC,OAAAuB,eAAAqnD,EAAA3oD,UAAA,iBAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,OAAAW,KAAAwsD,eAAAjuD,MACA,IAqEAf,OAAAuB,eAAAqnD,EAAA3oD,UAAA,YAAA,CAIAuB,YAAA,EACAK,IAAA,WACA,YAAAgC,IAAArB,KAAAwsD,gBAGAxsD,KAAAwsD,eAAAM,SACA,EACA/zC,IAAA,SAAAla,GAGAmB,KAAAwsD,iBAMAxsD,KAAAwsD,eAAAM,UAAAjuD,EACA,IAEAunD,EAAA3oD,UAAA4rD,QAAAsE,EAAAtE,QACAjD,EAAA3oD,UAAAwyD,WAAAtC,EAAAuC,UACA9J,EAAA3oD,UAAA6xD,SAAA,SAAAlqD,EAAAf,GACAA,EAAAe,EACA,CnGwjcC,GAAEzH,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,YAA8B,oBAAXL,OAAyBA,OAAyB,oBAATf,KAAuBA,KAAyB,oBAAXc,OAAyBA,OAAS,CAAC,EAEtK,EAAE,CAAC,YAAY,GAAG,mBAAmB,GAAG,6BAA6B,IAAI,2BAA2B,IAAI,4BAA4B,IAAImyB,SAAW,GAAGjmB,OAAS,GAAGu2C,SAAW,GAAG,iBAAiB,MAAM,IAAI,CAAC,SAASniD,EAAQT,EAAOD,IACpO,SAAWyxB,IAAS,WoGzrdpB,IAAAkjC,EACA,SAAAC,EAAAp5D,EAAAC,EAAAC,GAAA,OAAAD,EACA,SAAAiC,GAAA,IAAAjC,EACA,SAAAqC,EAAAC,GAAA,GAAA,WAAAH,QAAAE,IAAA,OAAAA,EAAA,OAAAA,EAAA,IAAAE,EAAAF,EAAA9C,OAAAiD,aAAA,QAAAC,IAAAF,EAAA,CAAA,IAAAG,EAAAH,EAAAxD,KAAAsD,EAAAC,GAAA,WAAA,GAAA,WAAAH,QAAAO,GAAA,OAAAA,EAAA,MAAA,IAAAnE,UAAA,+CAAA,CAAA,OAAA,WAAA+D,EAAAF,OAAAO,QAAAN,EAAA,CADA+2D,CAAAn3D,EAAA,UAAA,MAAA,WAAAE,QAAAnC,GAAAA,EAAAoC,OAAApC,EAAA,CADAq5D,CAAAr5D,MAAAD,EAAAnB,OAAAuB,eAAAJ,EAAAC,EAAA,CAAAC,MAAAA,EAAAG,YAAA,EAAAC,cAAA,EAAAC,UAAA,IAAAP,EAAAC,GAAAC,EAAAF,CAAA,CAGA,IAAAyyD,EAAAvtD,EAAA,mBACAq0D,EAAA/5D,OAAA,eACAg6D,EAAAh6D,OAAA,cACAi6D,EAAAj6D,OAAA,SACAk6D,EAAAl6D,OAAA,SACAm6D,EAAAn6D,OAAA,eACAo6D,EAAAp6D,OAAA,iBACAq6D,EAAAr6D,OAAA,UACA,SAAAs6D,EAAA55D,EAAAmG,GACA,MAAA,CACAnG,MAAAA,EACAmG,KAAAA,EAEA,CACA,SAAA0zD,EAAAx6D,GACA,IAAAyqB,EAAAzqB,EAAAg6D,GACA,GAAA,OAAAvvC,EAAA,CACA,IAAAzY,EAAAhS,EAAAs6D,GAAA5mD,OAIA,OAAA1B,IACAhS,EAAAo6D,GAAA,KACAp6D,EAAAg6D,GAAA,KACAh6D,EAAAi6D,GAAA,KACAxvC,EAAA8vC,EAAAvoD,GAAA,IAEA,CACA,CACA,SAAAyoD,EAAAz6D,GAGA02B,EAAAiiB,SAAA6hB,EAAAx6D,EACA,CAYA,IAAA06D,EAAAp7D,OAAAyF,gBAAA,WAAA,IACA41D,EAAAr7D,OAAAsE,gBAmDAi2D,EAnDAD,EAAA,CACA3V,aACA,OAAAniD,KAAAw4D,EACA,EACA9zD,KAAA,WACA,IAAAkuD,EAAA5yD,KAGAqU,EAAArU,KAAAo4D,GACA,GAAA,OAAA/jD,EACA,OAAAqU,QAAAE,OAAAvU,GAEA,GAAArU,KAAAq4D,GACA,OAAA3vC,QAAAC,QAAA8vC,OAAAp3D,GAAA,IAEA,GAAArB,KAAAw4D,GAAA1L,UAKA,OAAA,IAAApkC,SAAA,SAAAC,EAAAC,GACAgM,EAAAiiB,UAAA,WACA+b,EAAAwF,GACAxvC,EAAAgqC,EAAAwF,IAEAzvC,EAAA8vC,OAAAp3D,GAAA,GAEA,GACA,IAOA,IACAy3D,EADAC,EAAA/4D,KAAAs4D,GAEA,GAAAS,EACAD,EAAA,IAAApwC,QAlDA,SAAAqwC,EAAA76D,GACA,OAAA,SAAAyqB,EAAAC,GACAmwC,EAAA9Q,MAAA,WACA/pD,EAAAm6D,GACA1vC,EAAA8vC,OAAAp3D,GAAA,IAGAnD,EAAAq6D,GAAA5vC,EAAAC,EACA,GAAAA,EACA,CACA,CAwCAowC,CAAAD,EAAA/4D,WACA,CAGA,IAAAkQ,EAAAlQ,KAAAw4D,GAAA5mD,OACA,GAAA,OAAA1B,EACA,OAAAwY,QAAAC,QAAA8vC,EAAAvoD,GAAA,IAEA4oD,EAAA,IAAApwC,QAAA1oB,KAAAu4D,GACA,CAEA,OADAv4D,KAAAs4D,GAAAQ,EACAA,CACA,GACA36D,OAAA00D,eAAA,WACA,OAAA7yD,IACA,IAAA+3D,EAAAD,EAAA,UAAA,WACA,IAAAmB,EAAAj5D,KAIA,OAAA,IAAA0oB,SAAA,SAAAC,EAAAC,GACAqwC,EAAAT,GAAAnP,QAAA,MAAA,SAAAjkD,GACAA,EACAwjB,EAAAxjB,GAGAujB,EAAA8vC,OAAAp3D,GAAA,GACA,GACA,GACA,IAAAy2D,GAAAc,GA4DAx1D,EAAAD,QA3DA,SAAAg/C,GACA,IAAA+W,EACA96D,EAAAZ,OAAAmE,OAAAk3D,GAAAd,EAAAmB,EAAA,CAAA,EAAAV,EAAA,CACA35D,MAAAsjD,EACAjjD,UAAA,IACA64D,EAAAmB,EAAAhB,EAAA,CACAr5D,MAAA,KACAK,UAAA,IACA64D,EAAAmB,EAAAf,EAAA,CACAt5D,MAAA,KACAK,UAAA,IACA64D,EAAAmB,EAAAd,EAAA,CACAv5D,MAAA,KACAK,UAAA,IACA64D,EAAAmB,EAAAb,EAAA,CACAx5D,MAAAsjD,EAAA0K,eAAA6B,WACAxvD,UAAA,IACA64D,EAAAmB,EAAAX,EAAA,CACA15D,MAAA,SAAA8pB,EAAAC,GACA,IAAA1Y,EAAA9R,EAAAo6D,GAAA5mD,OACA1B,GACA9R,EAAAk6D,GAAA,KACAl6D,EAAA85D,GAAA,KACA95D,EAAA+5D,GAAA,KACAxvC,EAAA8vC,EAAAvoD,GAAA,MAEA9R,EAAA85D,GAAAvvC,EACAvqB,EAAA+5D,GAAAvvC,EAEA,EACA1pB,UAAA,IACAg6D,IA0BA,OAzBA96D,EAAAk6D,GAAA,KACAlH,EAAAjP,GAAA,SAAA/8C,GACA,GAAAA,GAAA,+BAAAA,EAAAnB,KAAA,CACA,IAAA2kB,EAAAxqB,EAAA+5D,GAUA,OAPA,OAAAvvC,IACAxqB,EAAAk6D,GAAA,KACAl6D,EAAA85D,GAAA,KACA95D,EAAA+5D,GAAA,KACAvvC,EAAAxjB,SAEAhH,EAAAg6D,GAAAhzD,EAEA,CACA,IAAAujB,EAAAvqB,EAAA85D,GACA,OAAAvvC,IACAvqB,EAAAk6D,GAAA,KACAl6D,EAAA85D,GAAA,KACA95D,EAAA+5D,GAAA,KACAxvC,EAAA8vC,OAAAp3D,GAAA,KAEAjD,EAAAi6D,IAAA,CACA,IACAlW,EAAAh5B,GAAA,WAAAwvC,EAAAr5D,KAAA,KAAAlB,IACAA,CACA,CpG8rdC,GAAET,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,YAElC,EAAE,CAAC,kBAAkB,IAAI6xB,SAAW,KAAK,IAAI,CAAC,SAAS7xB,EAAQT,EAAOD,GqGh3dtE,SAAAilB,EAAAnoB,EAAAk5D,GAAA,IAAAnzD,EAAAxI,OAAAwI,KAAA/F,GAAA,GAAAzC,OAAA6qB,sBAAA,CAAA,IAAA+wC,EAAA57D,OAAA6qB,sBAAApoB,GAAAk5D,IAAAC,EAAAA,EAAA/a,QAAA,SAAA/f,GAAA,OAAA9gC,OAAAqC,yBAAAI,EAAAq+B,GAAAt/B,UAAA,KAAAgH,EAAAN,KAAA3F,MAAAiG,EAAAozD,EAAA,CAAA,OAAApzD,CAAA,CACA,SAAAqzD,EAAA95D,GAAA,IAAA,IAAAf,EAAA,EAAAA,EAAAsB,UAAAvB,OAAAC,IAAA,CAAA,IAAA4gD,EAAA,MAAAt/C,UAAAtB,GAAAsB,UAAAtB,GAAA,CAAA,EAAAA,EAAA,EAAA4pB,EAAA5qB,OAAA4hD,IAAA,GAAAr7B,SAAA,SAAAnlB,GAAAm5D,EAAAx4D,EAAAX,EAAAwgD,EAAAxgD,GAAA,IAAApB,OAAA87D,0BAAA97D,OAAA+7D,iBAAAh6D,EAAA/B,OAAA87D,0BAAAla,IAAAh3B,EAAA5qB,OAAA4hD,IAAAr7B,SAAA,SAAAnlB,GAAApB,OAAAuB,eAAAQ,EAAAX,EAAApB,OAAAqC,yBAAAu/C,EAAAxgD,GAAA,GAAA,CAAA,OAAAW,CAAA,CACA,SAAAw4D,EAAAp5D,EAAAC,EAAAC,GAAA,OAAAD,EAAAq5D,EAAAr5D,MAAAD,EAAAnB,OAAAuB,eAAAJ,EAAAC,EAAA,CAAAC,MAAAA,EAAAG,YAAA,EAAAC,cAAA,EAAAC,UAAA,IAAAP,EAAAC,GAAAC,EAAAF,CAAA,CAEA,SAAA4B,EAAAhB,EAAAiB,GAAA,IAAA,IAAAhC,EAAA,EAAAA,EAAAgC,EAAAjC,OAAAC,IAAA,CAAA,IAAAiC,EAAAD,EAAAhC,GAAAiC,EAAAzB,WAAAyB,EAAAzB,aAAA,EAAAyB,EAAAxB,cAAA,EAAA,UAAAwB,IAAAA,EAAAvB,UAAA,GAAA1B,OAAAuB,eAAAQ,EAAA04D,EAAAx3D,EAAA7B,KAAA6B,EAAA,CAAA,CAEA,SAAAw3D,EAAAp3D,GAAA,IAAAjC,EACA,SAAAqC,EAAAC,GAAA,GAAA,WAAAH,QAAAE,IAAA,OAAAA,EAAA,OAAAA,EAAA,IAAAE,EAAAF,EAAA9C,OAAAiD,aAAA,QAAAC,IAAAF,EAAA,CAAA,IAAAG,EAAAH,EAAAxD,KAAAsD,EAAAC,GAAA,WAAA,GAAA,WAAAH,QAAAO,GAAA,OAAAA,EAAA,MAAA,IAAAnE,UAAA,+CAAA,CAAA,OAAA,WAAA+D,EAAAF,OAAAO,QAAAN,EAAA,CADA+2D,CAAAn3D,EAAA,UAAA,MAAA,WAAAE,QAAAnC,GAAAA,EAAAoC,OAAApC,EAAA,CAEA,IACAuP,EADAtK,EAAA,UACAsK,OAEAgH,EADAtR,EAAA,QACAsR,QACAu3B,EAAAv3B,GAAAA,EAAAu3B,QAAA,UAIAtpC,EAAAD,QAAA,WACA,SAAAuqD,KAdA,SAAArtD,EAAAC,GAAA,KAAAD,aAAAC,GAAA,MAAA,IAAAnD,UAAA,oCAAA,CAeAq8D,CAAAx5D,KAAA0tD,GACA1tD,KAAAkc,KAAA,KACAlc,KAAAmc,KAAA,KACAnc,KAAAzB,OAAA,CACA,CAjBA,IAAA+B,EAAAK,EAAAC,EA8KA,OA9KAN,EAkBAotD,GAlBA/sD,EAkBA,CAAA,CACA/B,IAAA,OACAC,MAAA,SAAA8gB,GACA,IAAAw0C,EAAA,CACAjkD,KAAAyP,EACAjb,KAAA,MAEA1E,KAAAzB,OAAA,EAAAyB,KAAAmc,KAAAzX,KAAAyvD,EAAAn0D,KAAAkc,KAAAi4C,EACAn0D,KAAAmc,KAAAg4C,IACAn0D,KAAAzB,MACA,GACA,CACAK,IAAA,UACAC,MAAA,SAAA8gB,GACA,IAAAw0C,EAAA,CACAjkD,KAAAyP,EACAjb,KAAA1E,KAAAkc,MAEA,IAAAlc,KAAAzB,SAAAyB,KAAAmc,KAAAg4C,GACAn0D,KAAAkc,KAAAi4C,IACAn0D,KAAAzB,MACA,GACA,CACAK,IAAA,QACAC,MAAA,WACA,GAAA,IAAAmB,KAAAzB,OAAA,CACA,IAAAqX,EAAA5V,KAAAkc,KAAAhM,KAGA,OAFA,IAAAlQ,KAAAzB,OAAAyB,KAAAkc,KAAAlc,KAAAmc,KAAA,KAAAnc,KAAAkc,KAAAlc,KAAAkc,KAAAxX,OACA1E,KAAAzB,OACAqX,CAJA,CAKA,GACA,CACAhX,IAAA,QACAC,MAAA,WACAmB,KAAAkc,KAAAlc,KAAAmc,KAAA,KACAnc,KAAAzB,OAAA,CACA,GACA,CACAK,IAAA,OACAC,MAAA,SAAAoL,GACA,GAAA,IAAAjK,KAAAzB,OAAA,MAAA,GAGA,IAFA,IAAAsD,EAAA7B,KAAAkc,KACAtG,EAAA,GAAA/T,EAAAqO,KACArO,EAAAA,EAAA6C,MAAAkR,GAAA3L,EAAApI,EAAAqO,KACA,OAAA0F,CACA,GACA,CACAhX,IAAA,SACAC,MAAA,SAAAtB,GACA,GAAA,IAAAyC,KAAAzB,OAAA,OAAA4P,EAAAI,MAAA,GAIA,IAHA,IA5DA8K,EAAA9Z,EAAA0S,EA4DA2D,EAAAzH,EAAAW,YAAAvR,IAAA,GACAsE,EAAA7B,KAAAkc,KACA1d,EAAA,EACAqD,GA/DAwX,EAgEAxX,EAAAqO,KAhEA3Q,EAgEAqW,EAhEA3D,EAgEAzT,EA/DA2P,EAAA1Q,UAAAsS,KAAApS,KAAA0b,EAAA9Z,EAAA0S,GAgEAzT,GAAAqD,EAAAqO,KAAA3R,OACAsD,EAAAA,EAAA6C,KAEA,OAAAkR,CACA,GAGA,CACAhX,IAAA,UACAC,MAAA,SAAAtB,EAAAk8D,GACA,IAAA7jD,EAYA,OAXArY,EAAAyC,KAAAkc,KAAAhM,KAAA3R,QAEAqX,EAAA5V,KAAAkc,KAAAhM,KAAAtS,MAAA,EAAAL,GACAyC,KAAAkc,KAAAhM,KAAAlQ,KAAAkc,KAAAhM,KAAAtS,MAAAL,IAGAqY,EAFArY,IAAAyC,KAAAkc,KAAAhM,KAAA3R,OAEAyB,KAAAwL,QAGAiuD,EAAAz5D,KAAA05D,WAAAn8D,GAAAyC,KAAA25D,WAAAp8D,GAEAqY,CACA,GACA,CACAhX,IAAA,QACAC,MAAA,WACA,OAAAmB,KAAAkc,KAAAhM,IACA,GAGA,CACAtR,IAAA,aACAC,MAAA,SAAAtB,GACA,IAAAsE,EAAA7B,KAAAkc,KACAtY,EAAA,EACAgS,EAAA/T,EAAAqO,KAEA,IADA3S,GAAAqY,EAAArX,OACAsD,EAAAA,EAAA6C,MAAA,CACA,IAAAgO,EAAA7Q,EAAAqO,KACA0pD,EAAAr8D,EAAAmV,EAAAnU,OAAAmU,EAAAnU,OAAAhB,EAGA,GAFAq8D,IAAAlnD,EAAAnU,OAAAqX,GAAAlD,EAAAkD,GAAAlD,EAAA9U,MAAA,EAAAL,GAEA,IADAA,GAAAq8D,GACA,CACAA,IAAAlnD,EAAAnU,UACAqF,EACA/B,EAAA6C,KAAA1E,KAAAkc,KAAAra,EAAA6C,KAAA1E,KAAAkc,KAAAlc,KAAAmc,KAAA,OAEAnc,KAAAkc,KAAAra,EACAA,EAAAqO,KAAAwC,EAAA9U,MAAAg8D,IAEA,KACA,GACAh2D,CACA,CAEA,OADA5D,KAAAzB,QAAAqF,EACAgS,CACA,GAGA,CACAhX,IAAA,aACAC,MAAA,SAAAtB,GACA,IAAAqY,EAAAzH,EAAAW,YAAAvR,GACAsE,EAAA7B,KAAAkc,KACAtY,EAAA,EAGA,IAFA/B,EAAAqO,KAAAH,KAAA6F,GACArY,GAAAsE,EAAAqO,KAAA3R,OACAsD,EAAAA,EAAA6C,MAAA,CACA,IAAAkK,EAAA/M,EAAAqO,KACA0pD,EAAAr8D,EAAAqR,EAAArQ,OAAAqQ,EAAArQ,OAAAhB,EAGA,GAFAqR,EAAAmB,KAAA6F,EAAAA,EAAArX,OAAAhB,EAAA,EAAAq8D,GAEA,IADAr8D,GAAAq8D,GACA,CACAA,IAAAhrD,EAAArQ,UACAqF,EACA/B,EAAA6C,KAAA1E,KAAAkc,KAAAra,EAAA6C,KAAA1E,KAAAkc,KAAAlc,KAAAmc,KAAA,OAEAnc,KAAAkc,KAAAra,EACAA,EAAAqO,KAAAtB,EAAAhR,MAAAg8D,IAEA,KACA,GACAh2D,CACA,CAEA,OADA5D,KAAAzB,QAAAqF,EACAgS,CACA,GAGA,CACAhX,IAAA8tC,EACA7tC,MAAA,SAAA4hB,EAAA9C,GACA,OAAAxI,EAAAnV,KAAAq5D,EAAAA,EAAA,CAAA,EAAA17C,GAAA,CAAA,EAAA,CAEAyvB,MAAA,EAEAG,eAAA,IAEA,MA5KAhtC,EAAAD,EAAA7C,UAAAkD,GAAAC,GAAAL,EAAAD,EAAAM,GAAApD,OAAAuB,eAAAuB,EAAA,YAAA,CAAApB,UAAA,IA8KAwuD,CACA,CApKA,ErGwheA,EAAE,CAACj+C,OAAS,GAAGujD,KAAO,KAAK,IAAI,CAAC,SAASnvD,EAAQT,EAAOD,IACxD,SAAWyxB,IAAS,WsGx/dpB,SAAAilC,EAAAp3D,EAAA2C,GACA00D,EAAAr3D,EAAA2C,GACA20D,EAAAt3D,EACA,CACA,SAAAs3D,EAAAt3D,GACAA,EAAA+pD,iBAAA/pD,EAAA+pD,eAAAyC,WACAxsD,EAAAoqD,iBAAApqD,EAAAoqD,eAAAoC,WACAxsD,EAAA0nB,KAAA,QACA,CAkBA,SAAA2vC,EAAAr3D,EAAA2C,GACA3C,EAAA0nB,KAAA,QAAA/kB,EACA,CAYAhC,EAAAD,QAAA,CACAkmD,QAzFA,SAAAjkD,EAAAf,GACA,IAAAuuD,EAAA5yD,KACAg6D,EAAAh6D,KAAA6sD,gBAAA7sD,KAAA6sD,eAAAC,UACAmN,EAAAj6D,KAAAwsD,gBAAAxsD,KAAAwsD,eAAAM,UACA,OAAAkN,GAAAC,GACA51D,EACAA,EAAAe,GACAA,IACApF,KAAAwsD,eAEAxsD,KAAAwsD,eAAAuJ,eACA/1D,KAAAwsD,eAAAuJ,cAAA,EACAnhC,EAAAiiB,SAAAijB,EAAA95D,KAAAoF,IAHAwvB,EAAAiiB,SAAAijB,EAAA95D,KAAAoF,IAMApF,OAMAA,KAAA6sD,iBACA7sD,KAAA6sD,eAAAC,WAAA,GAIA9sD,KAAAwsD,iBACAxsD,KAAAwsD,eAAAM,WAAA,GAEA9sD,KAAAsvD,SAAAlqD,GAAA,MAAA,SAAAA,IACAf,GAAAe,EACAwtD,EAAApG,eAEAoG,EAAApG,eAAAuJ,aAIAnhC,EAAAiiB,SAAAkjB,EAAAnH,IAHAA,EAAApG,eAAAuJ,cAAA,EACAnhC,EAAAiiB,SAAAgjB,EAAAjH,EAAAxtD,IAHAwvB,EAAAiiB,SAAAgjB,EAAAjH,EAAAxtD,GAOAf,GACAuwB,EAAAiiB,SAAAkjB,EAAAnH,GACAvuD,EAAAe,IAEAwvB,EAAAiiB,SAAAkjB,EAAAnH,EAEA,IACA5yD,KACA,EA2CAkwD,UAjCA,WACAlwD,KAAA6sD,iBACA7sD,KAAA6sD,eAAAC,WAAA,EACA9sD,KAAA6sD,eAAA8B,SAAA,EACA3uD,KAAA6sD,eAAAJ,OAAA,EACAzsD,KAAA6sD,eAAA6B,YAAA,GAEA1uD,KAAAwsD,iBACAxsD,KAAAwsD,eAAAM,WAAA,EACA9sD,KAAAwsD,eAAAC,OAAA,EACAzsD,KAAAwsD,eAAA6I,QAAA,EACAr1D,KAAAwsD,eAAA4I,aAAA,EACAp1D,KAAAwsD,eAAA8J,aAAA,EACAt2D,KAAAwsD,eAAA4E,UAAA,EACApxD,KAAAwsD,eAAAuJ,cAAA,EAEA,EAkBA7H,eAdA,SAAA/L,EAAA/8C,GAOA,IAAA8xD,EAAA/U,EAAA0K,eACAsE,EAAAhP,EAAAqK,eACA0K,GAAAA,EAAAhI,aAAAiC,GAAAA,EAAAjC,YAAA/M,EAAAkH,QAAAjkD,GAAA+8C,EAAAh4B,KAAA,QAAA/kB,EACA,EtGkjeC,GAAEzH,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,YAElC,EAAE,CAAC6xB,SAAW,KAAK,IAAI,CAAC,SAAS7xB,EAAQT,EAAOD,GuGzoehD,IAAA+2D,EAAAr2D,EAAA,mBAAAwnD,MAAA6O,2BAYA,SAAAt1D,IAAA,CAoEAxB,EAAAD,QAhEA,SAAAg3D,EAAAhY,EAAApV,EAAAvnC,GACA,GAAA,mBAAAunC,EAAA,OAAAotB,EAAAhY,EAAA,KAAApV,GACAA,IAAAA,EAAA,CAAA,GACAvnC,EAlBA,SAAAA,GACA,IAAAmrC,GAAA,EACA,OAAA,WACA,IAAAA,EAAA,CACAA,GAAA,EACA,IAAA,IAAAypB,EAAAt6D,UAAAvB,OAAAgH,EAAA,IAAAxH,MAAAq8D,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IACA90D,EAAA80D,GAAAv6D,UAAAu6D,GAEA70D,EAAAzF,MAAAC,KAAAuF,EALA,CAMA,CACA,CAQAZ,CAAAa,GAAAZ,GACA,IAAA0nD,EAAAvf,EAAAuf,WAAA,IAAAvf,EAAAuf,UAAAnK,EAAAmK,SACAptD,EAAA6tC,EAAA7tC,WAAA,IAAA6tC,EAAA7tC,UAAAijD,EAAAjjD,SACAo7D,EAAA,WACAnY,EAAAjjD,UAAA+yD,GACA,EACAsI,EAAApY,EAAAqK,gBAAArK,EAAAqK,eAAA4E,SACAa,EAAA,WACA/yD,GAAA,EACAq7D,GAAA,EACAjO,GAAA9mD,EAAA7H,KAAAwkD,EACA,EACAqY,EAAArY,EAAA0K,gBAAA1K,EAAA0K,eAAA6B,WACAnC,EAAA,WACAD,GAAA,EACAkO,GAAA,EACAt7D,GAAAsG,EAAA7H,KAAAwkD,EACA,EACA6G,EAAA,SAAA5jD,GACAI,EAAA7H,KAAAwkD,EAAA/8C,EACA,EACA4sD,EAAA,WACA,IAAA5sD,EACA,OAAAknD,IAAAkO,GACArY,EAAA0K,gBAAA1K,EAAA0K,eAAAJ,QAAArnD,EAAA,IAAA80D,GACA10D,EAAA7H,KAAAwkD,EAAA/8C,IAEAlG,IAAAq7D,GACApY,EAAAqK,gBAAArK,EAAAqK,eAAAC,QAAArnD,EAAA,IAAA80D,GACA10D,EAAA7H,KAAAwkD,EAAA/8C,SAFA,CAIA,EACAq1D,EAAA,WACAtY,EAAAoB,IAAAp6B,GAAA,SAAA8oC,EACA,EAcA,OAtDA,SAAA9P,GACA,OAAAA,EAAAqE,WAAA,mBAAArE,EAAA8B,KACA,CAuCAyW,CAAAvY,GAIAjjD,IAAAijD,EAAAqK,iBAEArK,EAAAh5B,GAAA,MAAAmxC,GACAnY,EAAAh5B,GAAA,QAAAmxC,KANAnY,EAAAh5B,GAAA,WAAA8oC,GACA9P,EAAAh5B,GAAA,QAAA6oC,GACA7P,EAAAoB,IAAAkX,IAAAtY,EAAAh5B,GAAA,UAAAsxC,IAMAtY,EAAAh5B,GAAA,MAAAojC,GACApK,EAAAh5B,GAAA,SAAA8oC,IACA,IAAAllB,EAAA14B,OAAA8tC,EAAAh5B,GAAA,QAAA6/B,GACA7G,EAAAh5B,GAAA,QAAA6oC,GACA,WACA7P,EAAAr5B,eAAA,WAAAmpC,GACA9P,EAAAr5B,eAAA,QAAAkpC,GACA7P,EAAAr5B,eAAA,UAAA2xC,GACAtY,EAAAoB,KAAApB,EAAAoB,IAAAz6B,eAAA,SAAAmpC,GACA9P,EAAAr5B,eAAA,MAAAwxC,GACAnY,EAAAr5B,eAAA,QAAAwxC,GACAnY,EAAAr5B,eAAA,SAAAmpC,GACA9P,EAAAr5B,eAAA,MAAAyjC,GACApK,EAAAr5B,eAAA,QAAAkgC,GACA7G,EAAAr5B,eAAA,QAAAkpC,EACA,CACA,CvGipeA,EAAE,CAAC,kBAAkB,KAAK,IAAI,CAAC,SAASnuD,EAAQT,EAAOD,GwGruevDC,EAAAD,QAAA,WACA,MAAA,IAAAa,MAAA,gDACA,CxGwueA,EAAE,CAAC,GAAG,IAAI,CAAC,SAASH,EAAQT,EAAOD,GyGruenC,IAAAg3D,EASA,IAAAtM,EAAAhqD,EAAA,mBAAAwnD,MACAsP,EAAA9M,EAAA8M,iBACA7F,EAAAjH,EAAAiH,qBACA,SAAAlwD,EAAAQ,GAEA,GAAAA,EAAA,MAAAA,CACA,CA+BA,SAAAzH,EAAA8G,GACAA,GACA,CACA,SAAAi+C,EAAA1kD,EAAA2nB,GACA,OAAA3nB,EAAA0kD,KAAA/8B,EACA,CA6BAviB,EAAAD,QAvBA,WACA,IAAA,IAAAi3D,EAAAt6D,UAAAvB,OAAAq8D,EAAA,IAAA78D,MAAAq8D,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IACAO,EAAAP,GAAAv6D,UAAAu6D,GAEA,IAKAhmD,EALA7O,EATA,SAAAo1D,GACA,OAAAA,EAAAr8D,OACA,mBAAAq8D,EAAAA,EAAAr8D,OAAA,GAAAqG,EACAg2D,EAAAn1D,MAFAb,CAGA,CAKAi2D,CAAAD,GAEA,GADA78D,MAAAM,QAAAu8D,EAAA,MAAAA,EAAAA,EAAA,IACAA,EAAAr8D,OAAA,EACA,MAAA,IAAAo8D,EAAA,WAGA,IAAAG,EAAAF,EAAAniB,KAAA,SAAA0J,EAAA3jD,GACA,IAAAmwD,EAAAnwD,EAAAo8D,EAAAr8D,OAAA,EAEA,OAnDA,SAAA4jD,EAAAwM,EAAA6G,EAAAhwD,GACAA,EAnBA,SAAAA,GACA,IAAAmrC,GAAA,EACA,OAAA,WACAA,IACAA,GAAA,EACAnrC,EAAAzF,WAAA,EAAAD,WACA,CACA,CAYA6E,CAAAa,GACA,IAAAu1D,GAAA,EACA5Y,EAAAh5B,GAAA,SAAA,WACA4xC,GAAA,CACA,SACA15D,IAAA84D,IAAAA,EAAAt2D,EAAA,oBACAs2D,EAAAhY,EAAA,CACAmK,SAAAqC,EACAzvD,SAAAs2D,IACA,SAAApwD,GACA,GAAAA,EAAA,OAAAI,EAAAJ,GACA21D,GAAA,EACAv1D,GACA,IACA,IAAAsnD,GAAA,EACA,OAAA,SAAA1nD,GACA,IAAA21D,IACAjO,EAIA,OAHAA,GAAA,EAtBA,SAAA3K,GACA,OAAAA,EAAAqE,WAAA,mBAAArE,EAAA8B,KACA,CAuBAyW,CAAAvY,GAAAA,EAAA8B,QACA,mBAAA9B,EAAAkH,QAAAlH,EAAAkH,eACA7jD,EAAAJ,GAAA,IAAA0vD,EAAA,QACA,CACA,CAyBAkG,CAAA7Y,EAAAwM,EADAnwD,EAAA,GACA,SAAA4G,GACAiP,IAAAA,EAAAjP,GACAA,GAAA01D,EAAA/2C,QAAApmB,GACAgxD,IACAmM,EAAA/2C,QAAApmB,GACA6H,EAAA6O,GACA,GACA,IACA,OAAAumD,EAAAvb,OAAAqD,EACA,CzG6ueA,EAAE,CAAC,kBAAkB,GAAG,kBAAkB,MAAM,IAAI,CAAC,SAAS7+C,EAAQT,EAAOD,G0G/ze7E,IAAA83D,EAAAp3D,EAAA,mBAAAwnD,MAAA4P,sBAiBA73D,EAAAD,QAAA,CACAyqD,iBAdA,SAAAjjC,EAAAhN,EAAAu9C,EAAA9M,GACA,IAAA+M,EAJA,SAAAx9C,EAAAywC,EAAA8M,GACA,OAAA,MAAAv9C,EAAAgvC,cAAAhvC,EAAAgvC,cAAAyB,EAAAzwC,EAAAu9C,GAAA,IACA,CAEAE,CAAAz9C,EAAAywC,EAAA8M,GACA,GAAA,MAAAC,EAAA,CACA,IAAAzlD,SAAAylD,IAAA/0D,KAAAmY,MAAA48C,KAAAA,GAAAA,EAAA,EAEA,MAAA,IAAAF,EADA7M,EAAA8M,EAAA,gBACAC,GAEA,OAAA/0D,KAAAmY,MAAA48C,EACA,CAGA,OAAAxwC,EAAA0jC,WAAA,GAAA,KACA,E1Gs0eA,EAAE,CAAC,kBAAkB,KAAK,IAAI,CAAC,SAASxqD,EAAQT,EAAOD,G2Gx1evDC,EAAAD,QAAAU,EAAA,UAAA2kB,Y3G21eA,EAAE,CAACuB,OAAS,KAAK,IAAI,CAAC,SAASlmB,EAAQT,EAAOD,I4G31e9CA,EAAAC,EAAAD,QAAAU,EAAA,8BACAupD,OAAAjqD,EACAA,EAAA0mD,SAAA1mD,EACAA,EAAAijD,SAAAviD,EAAA,6BACAV,EAAAipD,OAAAvoD,EAAA,2BACAV,EAAA6pD,UAAAnpD,EAAA,8BACAV,EAAA4pD,YAAAlpD,EAAA,gCACAV,EAAAiuD,SAAAvtD,EAAA,2CACAV,EAAAk4D,SAAAx3D,EAAA,qC5G81eA,EAAE,CAAC,0BAA0B,GAAG,+BAA+B,GAAG,4BAA4B,GAAG,6BAA6B,GAAG,4BAA4B,IAAI,0CAA0C,IAAI,qCAAqC,MAAM,IAAI,CAAC,SAASA,EAAQT,EAAOD,G6G70evR,IAAAgL,EAAAtK,EAAA,eAAAsK,OAGAc,EAAAd,EAAAc,YAAA,SAAAD,GAEA,QADAA,EAAA,GAAAA,IACAA,EAAA0B,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,SAAA88C,EAAAx+C,GAEA,IAAA4qD,EACA,OAFA55D,KAAAgP,SAXA,SAAAmP,GACA,IAAAm9C,EA/BA,SAAAn9C,GACA,IAAAA,EAAA,MAAA,OAEA,IADA,IAAAo9C,IAEA,OAAAp9C,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,GAAAo9C,EAAA,OACAp9C,GAAA,GAAAA,GAAAzN,cACA6qD,GAAA,EAGA,CAKAC,CAAAr9C,GACA,GAAA,iBAAAm9C,IAAAntD,EAAAc,aAAAA,IAAAA,EAAAkP,IAAA,MAAA,IAAAna,MAAA,qBAAAma,GACA,OAAAm9C,GAAAn9C,CACA,CAOAs9C,CAAAzsD,GAEAhP,KAAAgP,UACA,IAAA,UACAhP,KAAA07D,KAAAC,EACA37D,KAAAuI,IAAAqzD,EACAhC,EAAA,EACA,MACA,IAAA,OACA55D,KAAA67D,SAAAC,EACAlC,EAAA,EACA,MACA,IAAA,SACA55D,KAAA07D,KAAAK,EACA/7D,KAAAuI,IAAAyzD,EACApC,EAAA,EACA,MACA,QAGA,OAFA55D,KAAAmP,MAAA8sD,OACAj8D,KAAAuI,IAAA2zD,GAGAl8D,KAAAm8D,SAAA,EACAn8D,KAAAo8D,UAAA,EACAp8D,KAAAq8D,SAAAluD,EAAAW,YAAA8qD,EACA,CAmCA,SAAA0C,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,EAAAltD,GACA,IAAA/M,EAAA7B,KAAAo8D,UAAAp8D,KAAAm8D,SACAz4D,EAtBA,SAAAjB,EAAAmM,EAAA/M,GACA,GAAA,MAAA,IAAA+M,EAAA,IAEA,OADAnM,EAAA05D,SAAA,EACA,IAEA,GAAA15D,EAAA05D,SAAA,GAAAvtD,EAAArQ,OAAA,EAAA,CACA,GAAA,MAAA,IAAAqQ,EAAA,IAEA,OADAnM,EAAA05D,SAAA,EACA,IAEA,GAAA15D,EAAA05D,SAAA,GAAAvtD,EAAArQ,OAAA,GACA,MAAA,IAAAqQ,EAAA,IAEA,OADAnM,EAAA05D,SAAA,EACA,GAGA,CACA,CAKAK,CAAAx8D,KAAA4O,GACA,YAAAvN,IAAAqC,EAAAA,EACA1D,KAAAm8D,UAAAvtD,EAAArQ,QACAqQ,EAAAmB,KAAA/P,KAAAq8D,SAAAx6D,EAAA,EAAA7B,KAAAm8D,UACAn8D,KAAAq8D,SAAA3+D,SAAAsC,KAAAgP,SAAA,EAAAhP,KAAAo8D,aAEAxtD,EAAAmB,KAAA/P,KAAAq8D,SAAAx6D,EAAA,EAAA+M,EAAArQ,aACAyB,KAAAm8D,UAAAvtD,EAAArQ,QACA,CA0BA,SAAAo9D,EAAA/sD,EAAApQ,GACA,IAAAoQ,EAAArQ,OAAAC,GAAA,GAAA,EAAA,CACA,IAAAkF,EAAAkL,EAAAlR,SAAA,UAAAc,GACA,GAAAkF,EAAA,CACA,IAAAE,EAAAF,EAAAgE,WAAAhE,EAAAnF,OAAA,GACA,GAAAqF,GAAA,OAAAA,GAAA,MAKA,OAJA5D,KAAAm8D,SAAA,EACAn8D,KAAAo8D,UAAA,EACAp8D,KAAAq8D,SAAA,GAAAztD,EAAAA,EAAArQ,OAAA,GACAyB,KAAAq8D,SAAA,GAAAztD,EAAAA,EAAArQ,OAAA,GACAmF,EAAA9F,MAAA,GAAA,EAEA,CACA,OAAA8F,CACA,CAIA,OAHA1D,KAAAm8D,SAAA,EACAn8D,KAAAo8D,UAAA,EACAp8D,KAAAq8D,SAAA,GAAAztD,EAAAA,EAAArQ,OAAA,GACAqQ,EAAAlR,SAAA,UAAAc,EAAAoQ,EAAArQ,OAAA,EACA,CAIA,SAAAq9D,EAAAhtD,GACA,IAAAlL,EAAAkL,GAAAA,EAAArQ,OAAAyB,KAAAmP,MAAAP,GAAA,GACA,GAAA5O,KAAAm8D,SAAA,CACA,IAAA5zD,EAAAvI,KAAAo8D,UAAAp8D,KAAAm8D,SACA,OAAAz4D,EAAA1D,KAAAq8D,SAAA3+D,SAAA,UAAA,EAAA6K,EACA,CACA,OAAA7E,CACA,CAEA,SAAAq4D,EAAAntD,EAAApQ,GACA,IAAAjB,GAAAqR,EAAArQ,OAAAC,GAAA,EACA,OAAA,IAAAjB,EAAAqR,EAAAlR,SAAA,SAAAc,IACAwB,KAAAm8D,SAAA,EAAA5+D,EACAyC,KAAAo8D,UAAA,EACA,IAAA7+D,EACAyC,KAAAq8D,SAAA,GAAAztD,EAAAA,EAAArQ,OAAA,IAEAyB,KAAAq8D,SAAA,GAAAztD,EAAAA,EAAArQ,OAAA,GACAyB,KAAAq8D,SAAA,GAAAztD,EAAAA,EAAArQ,OAAA,IAEAqQ,EAAAlR,SAAA,SAAAc,EAAAoQ,EAAArQ,OAAAhB,GACA,CAEA,SAAAy+D,EAAAptD,GACA,IAAAlL,EAAAkL,GAAAA,EAAArQ,OAAAyB,KAAAmP,MAAAP,GAAA,GACA,OAAA5O,KAAAm8D,SAAAz4D,EAAA1D,KAAAq8D,SAAA3+D,SAAA,SAAA,EAAA,EAAAsC,KAAAm8D,UACAz4D,CACA,CAGA,SAAAu4D,EAAArtD,GACA,OAAAA,EAAAlR,SAAAsC,KAAAgP,SACA,CAEA,SAAAktD,EAAAttD,GACA,OAAAA,GAAAA,EAAArQ,OAAAyB,KAAAmP,MAAAP,GAAA,EACA,CA1NAzL,EAAAqqD,cAAAA,EA6BAA,EAAA/vD,UAAA0R,MAAA,SAAAP,GACA,GAAA,IAAAA,EAAArQ,OAAA,MAAA,GACA,IAAAmF,EACAlF,EACA,GAAAwB,KAAAm8D,SAAA,CAEA,QAAA96D,KADAqC,EAAA1D,KAAA67D,SAAAjtD,IACA,MAAA,GACApQ,EAAAwB,KAAAm8D,SACAn8D,KAAAm8D,SAAA,CACA,MACA39D,EAAA,EAEA,OAAAA,EAAAoQ,EAAArQ,OAAAmF,EAAAA,EAAA1D,KAAA07D,KAAA9sD,EAAApQ,GAAAwB,KAAA07D,KAAA9sD,EAAApQ,GACAkF,GAAA,EACA,EAEA8pD,EAAA/vD,UAAA8K,IAwGA,SAAAqG,GACA,IAAAlL,EAAAkL,GAAAA,EAAArQ,OAAAyB,KAAAmP,MAAAP,GAAA,GACA,OAAA5O,KAAAm8D,SAAAz4D,EAAA,IACAA,CACA,EAzGA8pD,EAAA/vD,UAAAi+D,KA0FA,SAAA9sD,EAAApQ,GACA,IAAAi+D,EArEA,SAAAh6D,EAAAmM,EAAApQ,GACA,IAAAgM,EAAAoE,EAAArQ,OAAA,EACA,GAAAiM,EAAAhM,EAAA,OAAA,EACA,IAAAo7D,EAAA0C,EAAA1tD,EAAApE,IACA,GAAAovD,GAAA,EAEA,OADAA,EAAA,IAAAn3D,EAAA05D,SAAAvC,EAAA,GACAA,EAEA,KAAApvD,EAAAhM,IAAA,IAAAo7D,EAAA,OAAA,EAEA,GADAA,EAAA0C,EAAA1tD,EAAApE,IACAovD,GAAA,EAEA,OADAA,EAAA,IAAAn3D,EAAA05D,SAAAvC,EAAA,GACAA,EAEA,KAAApvD,EAAAhM,IAAA,IAAAo7D,EAAA,OAAA,EAEA,GADAA,EAAA0C,EAAA1tD,EAAApE,IACAovD,GAAA,EAIA,OAHAA,EAAA,IACA,IAAAA,EAAAA,EAAA,EAAAn3D,EAAA05D,SAAAvC,EAAA,GAEAA,EAEA,OAAA,CACA,CA8CA8C,CAAA18D,KAAA4O,EAAApQ,GACA,IAAAwB,KAAAm8D,SAAA,OAAAvtD,EAAAlR,SAAA,OAAAc,GACAwB,KAAAo8D,UAAAK,EACA,IAAAl0D,EAAAqG,EAAArQ,QAAAk+D,EAAAz8D,KAAAm8D,UAEA,OADAvtD,EAAAmB,KAAA/P,KAAAq8D,SAAA,EAAA9zD,GACAqG,EAAAlR,SAAA,OAAAc,EAAA+J,EACA,EA9FAilD,EAAA/vD,UAAAo+D,SAAA,SAAAjtD,GACA,GAAA5O,KAAAm8D,UAAAvtD,EAAArQ,OAEA,OADAqQ,EAAAmB,KAAA/P,KAAAq8D,SAAAr8D,KAAAo8D,UAAAp8D,KAAAm8D,SAAA,EAAAn8D,KAAAm8D,UACAn8D,KAAAq8D,SAAA3+D,SAAAsC,KAAAgP,SAAA,EAAAhP,KAAAo8D,WAEAxtD,EAAAmB,KAAA/P,KAAAq8D,SAAAr8D,KAAAo8D,UAAAp8D,KAAAm8D,SAAA,EAAAvtD,EAAArQ,QACAyB,KAAAm8D,UAAAvtD,EAAArQ,MACA,C7GwgfA,EAAE,CAAC,cAAc,KAAK,IAAI,CAAC,SAASsF,EAAQT,EAAOD,IACnD,SAAWkC,EAAas3D,IAAgB,W8GhpfxC,IAAA9lB,EAAAhzC,EAAA,sBAAAgzC,SACA92C,EAAAooB,SAAA1qB,UAAAsC,MACAnC,EAAAG,MAAAN,UAAAG,MACAg/D,EAAA,CAAA,EACAC,EAAA,EAaA,SAAAC,EAAAC,EAAAC,GACAh9D,KAAAi9D,IAAAF,EACA/8D,KAAAk9D,SAAAF,CACA,CAZA75D,EAAAsD,WAAA,WACA,OAAA,IAAAq2D,EAAA/8D,EAAApC,KAAA8I,WAAAlD,OAAAzD,WAAAm2C,aACA,EACA9yC,EAAAg6D,YAAA,WACA,OAAA,IAAAL,EAAA/8D,EAAApC,KAAAw/D,YAAA55D,OAAAzD,WAAAs9D,cACA,EACAj6D,EAAA8yC,aACA9yC,EAAAi6D,cAAA,SAAA5mB,GAAAA,EAAA4T,OAAA,EAMA0S,EAAAr/D,UAAA4/D,MAAAP,EAAAr/D,UAAA6/D,IAAA,WAAA,EACAR,EAAAr/D,UAAA2sD,MAAA,WACApqD,KAAAk9D,SAAAv/D,KAAA4F,OAAAvD,KAAAi9D,IACA,EAGA95D,EAAAo6D,OAAA,SAAA9d,EAAA+d,GACAvnB,aAAAwJ,EAAAge,gBACAhe,EAAAie,aAAAF,CACA,EAEAr6D,EAAAw6D,SAAA,SAAAle,GACAxJ,aAAAwJ,EAAAge,gBACAhe,EAAAie,cAAA,CACA,EAEAv6D,EAAAy6D,aAAAz6D,EAAA06D,OAAA,SAAApe,GACAxJ,aAAAwJ,EAAAge,gBAEA,IAAAD,EAAA/d,EAAAie,aACAF,GAAA,IACA/d,EAAAge,eAAAh3D,YAAA,WACAg5C,EAAAqe,YACAre,EAAAqe,YACA,GAAAN,GAEA,EAGAr6D,EAAAkC,aAAA,mBAAAA,EAAAA,EAAA,SAAAZ,GACA,IAAAs4D,EAAAF,IACAt3D,IAAAzF,UAAAvB,OAAA,IAAAX,EAAAD,KAAAmC,UAAA,GAkBA,OAhBA88D,EAAAG,IAAA,EAEAlmB,GAAA,WACA+lB,EAAAG,KAGAx3D,EACAd,EAAA1E,MAAA,KAAAwF,GAEAd,EAAA9G,KAAA,MAGAwF,EAAAw5D,eAAAI,GAEA,IAEAA,CACA,EAEA55D,EAAAw5D,eAAA,mBAAAA,EAAAA,EAAA,SAAAI,UACAH,EAAAG,EACA,C9GkpfC,GAAEp/D,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,UAAUwB,aAAaxB,EAAQ,UAAU84D,eAE3E,EAAE,CAAC,qBAAqB,GAAGj2D,OAAS,MAAM,IAAI,CAAC,SAAS7C,EAAQT,EAAOD,G+GtsfvE,IAAAu0C,EAAA7zC,EAAA,YAEA,SAAAk6D,IACA/9D,KAAA++B,SAAA,KACA/+B,KAAAg+D,QAAA,KACAh+D,KAAA+iD,KAAA,KACA/iD,KAAA2jD,KAAA,KACA3jD,KAAA8iD,KAAA,KACA9iD,KAAA6iD,SAAA,KACA7iD,KAAAi+D,KAAA,KACAj+D,KAAA2N,OAAA,KACA3N,KAAAk+D,MAAA,KACAl+D,KAAAm+D,SAAA,KACAn+D,KAAAye,KAAA,KACAze,KAAAo+D,KAAA,IACA,CAQA,IAAAC,EAAA,oBACAC,EAAA,WAGAC,EAAA,oCAWAC,EAAA,CACA,IAAA,IAAA,IAAA,KAAA,IAAA,KACA33D,OAPA,CACA,IAAA,IAAA,IAAA,IAAA,IAAA,KAAA,KAAA,OASA43D,EAAA,CAAA,KAAA53D,OAAA23D,GAOAE,EAAA,CACA,IAAA,IAAA,IAAA,IAAA,KACA73D,OAAA43D,GACAE,EAAA,CACA,IAAA,IAAA,KAGAC,EAAA,yBACAC,EAAA,+BAEAC,EAAA,CACAC,YAAA,EACA,eAAA,GAGAC,EAAA,CACAD,YAAA,EACA,eAAA,GAGAE,EAAA,CACAvgC,MAAA,EACAE,OAAA,EACAsgC,KAAA,EACAC,QAAA,EACAC,MAAA,EACA,SAAA,EACA,UAAA,EACA,QAAA,EACA,WAAA,EACA,SAAA,GAEA5c,EAAA3+C,EAAA,MAEA,SAAAw7D,EAAA1gC,EAAA2gC,EAAAC,GACA,GAAA5gC,GAAA,WAAA59B,QAAA49B,IAAAA,aAAAo/B,EAAA,OAAAp/B,EAEA,IAAA76B,EAAA,IAAAi6D,EAEA,OADAj6D,EAAA+J,MAAA8wB,EAAA2gC,EAAAC,GACAz7D,CACA,CAEAi6D,EAAAtgE,UAAAoQ,MAAA,SAAA8wB,EAAA2gC,EAAAC,GACA,GAAA,iBAAA5gC,EACA,MAAA,IAAAxhC,UAAA,yCAAA4D,QAAA49B,IAQA,IAAA6gC,EAAA7gC,EAAAt2B,QAAA,KACAo3D,GAAA,IAAAD,GAAAA,EAAA7gC,EAAAt2B,QAAA,KAAA,IAAA,IACAq3D,EAAA/gC,EAAAxlB,MAAAsmD,GAEAC,EAAA,GAAAA,EAAA,GAAAhyD,QADA,MACA,KAGA,IAAApH,EAFAq4B,EAAA+gC,EAAAv3D,KAAAs3D,GAUA,GAFAn5D,EAAAA,EAAA8O,QAEAmqD,GAAA,IAAA5gC,EAAAxlB,MAAA,KAAA5a,OAAA,CAEA,IAAAohE,EAAApB,EAAAthC,KAAA32B,GACA,GAAAq5D,EAeA,OAdA3/D,KAAAye,KAAAnY,EACAtG,KAAAo+D,KAAA93D,EACAtG,KAAAm+D,SAAAwB,EAAA,GACAA,EAAA,IACA3/D,KAAA2N,OAAAgyD,EAAA,GAEA3/D,KAAAk+D,MADAoB,EACA9c,EAAA30C,MAAA7N,KAAA2N,OAAA2E,OAAA,IAEAtS,KAAA2N,OAAA2E,OAAA,IAEAgtD,IACAt/D,KAAA2N,OAAA,GACA3N,KAAAk+D,MAAA,CAAA,GAEAl+D,IAEA,CAEA,IAAA8wC,EAAAutB,EAAAphC,KAAA32B,GACA,GAAAwqC,EAAA,CAEA,IAAA8uB,GADA9uB,EAAAA,EAAA,IACApgC,cACA1Q,KAAA++B,SAAA6gC,EACAt5D,EAAAA,EAAAgM,OAAAw+B,EAAAvyC,OACA,CAQA,GAAAghE,GAAAzuB,GAAAxqC,EAAA6a,MAAA,sBAAA,CACA,IAAA68C,EAAA,OAAA13D,EAAAgM,OAAA,EAAA,IACA0rD,GAAAltB,GAAAkuB,EAAAluB,KACAxqC,EAAAA,EAAAgM,OAAA,GACAtS,KAAAg+D,SAAA,EAEA,CAEA,IAAAgB,EAAAluB,KAAAktB,GAAAltB,IAAAmuB,EAAAnuB,IAAA,CAuBA,IADA,IAUAiS,EAAA8c,EAVAC,GAAA,EACAthE,EAAA,EAAAA,EAAAmgE,EAAApgE,OAAAC,IAAA,EAEA,KADAuhE,EAAAz5D,EAAA+B,QAAAs2D,EAAAngE,QACA,IAAAshE,GAAAC,EAAAD,KAAAA,EAAAC,EACA,EAsBA,KAbAF,GAFA,IAAAC,EAEAx5D,EAAAkL,YAAA,KAMAlL,EAAAkL,YAAA,IAAAsuD,MAQA/c,EAAAz8C,EAAA1I,MAAA,EAAAiiE,GACAv5D,EAAAA,EAAA1I,MAAAiiE,EAAA,GACA7/D,KAAA+iD,KAAA7jC,mBAAA6jC,IAIA+c,GAAA,EACA,IAAAthE,EAAA,EAAAA,EAAAkgE,EAAAngE,OAAAC,IAAA,CACA,IAAAuhE,GACA,KADAA,EAAAz5D,EAAA+B,QAAAq2D,EAAAlgE,QACA,IAAAshE,GAAAC,EAAAD,KAAAA,EAAAC,EACA,EAEA,IAAAD,IAAAA,EAAAx5D,EAAA/H,QAEAyB,KAAA2jD,KAAAr9C,EAAA1I,MAAA,EAAAkiE,GACAx5D,EAAAA,EAAA1I,MAAAkiE,GAGA9/D,KAAAggE,YAMAhgE,KAAA6iD,SAAA7iD,KAAA6iD,UAAA,GAMA,IAAAod,EAAA,MAAAjgE,KAAA6iD,SAAA,IAAA,MAAA7iD,KAAA6iD,SAAA7iD,KAAA6iD,SAAAtkD,OAAA,GAGA,IAAA0hE,EAEA,IADA,IAAAC,EAAAlgE,KAAA6iD,SAAA1pC,MAAA,MACA1O,GAAAjM,EAAA,EAAA0hE,EAAA3hE,QAAAC,EAAAiM,EAAAjM,IAAA,CACA,IAAAy/B,EAAAiiC,EAAA1hE,GACA,GAAAy/B,IACAA,EAAA9c,MAAAy9C,GAAA,CAEA,IADA,IAAAuB,EAAA,GACA31D,EAAA,EAAAvE,EAAAg4B,EAAA1/B,OAAAiM,EAAAvE,EAAAuE,IACAyzB,EAAAv2B,WAAA8C,GAAA,IAMA21D,GAAA,IAEAA,GAAAliC,EAAAzzB,GAIA,IAAA21D,EAAAh/C,MAAAy9C,GAAA,CACA,IAAAwB,EAAAF,EAAAtiE,MAAA,EAAAY,GACA6hE,EAAAH,EAAAtiE,MAAAY,EAAA,GACA8hE,EAAAriC,EAAA9c,MAAA09C,GACAyB,IACAF,EAAA16D,KAAA46D,EAAA,IACAD,EAAAx2D,QAAAy2D,EAAA,KAEAD,EAAA9hE,SACA+H,EAAA,IAAA+5D,EAAAl4D,KAAA,KAAA7B,GAEAtG,KAAA6iD,SAAAud,EAAAj4D,KAAA,KACA,KACA,CACA,CACA,CAGAnI,KAAA6iD,SAAAtkD,OAjOA,IAkOAyB,KAAA6iD,SAAA,GAGA7iD,KAAA6iD,SAAA7iD,KAAA6iD,SAAAnyC,cAGAuvD,IAOAjgE,KAAA6iD,SAAAnL,EAAAuC,QAAAj6C,KAAA6iD,WAGA,IAAAhhD,EAAA7B,KAAA8iD,KAAA,IAAA9iD,KAAA8iD,KAAA,GACA1jC,EAAApf,KAAA6iD,UAAA,GACA7iD,KAAA2jD,KAAAvkC,EAAAvd,EACA7B,KAAAo+D,MAAAp+D,KAAA2jD,KAMAsc,IACAjgE,KAAA6iD,SAAA7iD,KAAA6iD,SAAAvwC,OAAA,EAAAtS,KAAA6iD,SAAAtkD,OAAA,GACA,MAAA+H,EAAA,KACAA,EAAA,IAAAA,GAGA,CAMA,IAAAw4D,EAAAc,GAOA,IAAAphE,EAAA,EAAAiM,EAAAg0D,EAAAlgE,OAAAC,EAAAiM,EAAAjM,IAAA,CACA,IAAA+hE,EAAA9B,EAAAjgE,GACA,IAAA,IAAA8H,EAAA+B,QAAAk4D,GAAA,CACA,IAAAC,EAAArhD,mBAAAohD,GACAC,IAAAD,IACAC,EAAAxgB,OAAAugB,IAEAj6D,EAAAA,EAAA6S,MAAAonD,GAAAp4D,KAAAq4D,EALA,CAMA,CAIA,IAAAvC,EAAA33D,EAAA+B,QAAA,MACA,IAAA41D,IAEAj+D,KAAAi+D,KAAA33D,EAAAgM,OAAA2rD,GACA33D,EAAAA,EAAA1I,MAAA,EAAAqgE,IAEA,IAAAwC,EAAAn6D,EAAA+B,QAAA,KAmBA,IAlBA,IAAAo4D,GACAzgE,KAAA2N,OAAArH,EAAAgM,OAAAmuD,GACAzgE,KAAAk+D,MAAA53D,EAAAgM,OAAAmuD,EAAA,GACAnB,IACAt/D,KAAAk+D,MAAA1b,EAAA30C,MAAA7N,KAAAk+D,QAEA53D,EAAAA,EAAA1I,MAAA,EAAA6iE,IACAnB,IAEAt/D,KAAA2N,OAAA,GACA3N,KAAAk+D,MAAA,CAAA,GAEA53D,IAAAtG,KAAAm+D,SAAA73D,GACA24D,EAAAW,IAAA5/D,KAAA6iD,WAAA7iD,KAAAm+D,WACAn+D,KAAAm+D,SAAA,KAIAn+D,KAAAm+D,UAAAn+D,KAAA2N,OAAA,CACA9L,EAAA7B,KAAAm+D,UAAA,GAAA,IACAl0D,EAAAjK,KAAA2N,QAAA,GACA3N,KAAAye,KAAA5c,EAAAoI,CACA,CAIA,OADAjK,KAAAo+D,KAAAp+D,KAAAsjB,SACAtjB,IACA,EAeA+9D,EAAAtgE,UAAA6lB,OAAA,WACA,IAAAy/B,EAAA/iD,KAAA+iD,MAAA,GACAA,IAEAA,GADAA,EAAA5jC,mBAAA4jC,IACAr1C,QAAA,OAAA,KACAq1C,GAAA,KAGA,IAAAhkB,EAAA/+B,KAAA++B,UAAA,GACAo/B,EAAAn+D,KAAAm+D,UAAA,GACAF,EAAAj+D,KAAAi+D,MAAA,GACAta,GAAA,EACAua,EAAA,GAEAl+D,KAAA2jD,KACAA,EAAAZ,EAAA/iD,KAAA2jD,KACA3jD,KAAA6iD,WACAc,EAAAZ,IAAA,IAAA/iD,KAAA6iD,SAAAx6C,QAAA,KAAArI,KAAA6iD,SAAA,IAAA7iD,KAAA6iD,SAAA,KACA7iD,KAAA8iD,OACAa,GAAA,IAAA3jD,KAAA8iD,OAIA9iD,KAAAk+D,OAAA,WAAAn9D,QAAAf,KAAAk+D,QAAA1gE,OAAAwI,KAAAhG,KAAAk+D,OAAA3/D,SACA2/D,EAAA1b,EAAA14C,UAAA9J,KAAAk+D,QAGA,IAAAvwD,EAAA3N,KAAA2N,QAAAuwD,GAAA,IAAAA,GAAA,GAuBA,OArBAn/B,GAAA,MAAAA,EAAAzsB,QAAA,KAAAysB,GAAA,KAMA/+B,KAAAg+D,WAAAj/B,GAAAkgC,EAAAlgC,MAAA,IAAA4kB,GACAA,EAAA,MAAAA,GAAA,IACAwa,GAAA,MAAAA,EAAAj0D,OAAA,KAAAi0D,EAAA,IAAAA,IACAxa,IACAA,EAAA,IAGAsa,GAAA,MAAAA,EAAA/zD,OAAA,KAAA+zD,EAAA,IAAAA,GACAtwD,GAAA,MAAAA,EAAAzD,OAAA,KAAAyD,EAAA,IAAAA,GAOAoxB,EAAA4kB,GALAwa,EAAAA,EAAAzwD,QAAA,SAAA,SAAAyT,GACA,OAAAhC,mBAAAgC,EACA,MACAxT,EAAAA,EAAAD,QAAA,IAAA,QAEAuwD,CACA,EAMAF,EAAAtgE,UAAAkrB,QAAA,SAAAkpB,GACA,OAAA7xC,KAAA0gE,cAAArB,EAAAxtB,GAAA,GAAA,IAAAvuB,QACA,EAOAy6C,EAAAtgE,UAAAijE,cAAA,SAAA7uB,GACA,GAAA,iBAAAA,EAAA,CACA,IAAA8uB,EAAA,IAAA5C,EACA4C,EAAA9yD,MAAAgkC,GAAA,GAAA,GACAA,EAAA8uB,CACA,CAIA,IAFA,IAAAv+D,EAAA,IAAA27D,EACA6C,EAAApjE,OAAAwI,KAAAhG,MACA6gE,EAAA,EAAAA,EAAAD,EAAAriE,OAAAsiE,IAAA,CACA,IAAAC,EAAAF,EAAAC,GACAz+D,EAAA0+D,GAAA9gE,KAAA8gE,EACA,CASA,GAHA1+D,EAAA67D,KAAApsB,EAAAosB,KAGA,KAAApsB,EAAAusB,KAEA,OADAh8D,EAAAg8D,KAAAh8D,EAAAkhB,SACAlhB,EAIA,GAAAyvC,EAAAmsB,UAAAnsB,EAAA9S,SAAA,CAGA,IADA,IAAAgiC,EAAAvjE,OAAAwI,KAAA6rC,GACAmvB,EAAA,EAAAA,EAAAD,EAAAxiE,OAAAyiE,IAAA,CACA,IAAAC,EAAAF,EAAAC,GACA,aAAAC,IAAA7+D,EAAA6+D,GAAApvB,EAAAovB,GACA,CASA,OANAhC,EAAA78D,EAAA28B,WAAA38B,EAAAygD,WAAAzgD,EAAA+7D,WACA/7D,EAAA+7D,SAAA,IACA/7D,EAAAqc,KAAArc,EAAA+7D,UAGA/7D,EAAAg8D,KAAAh8D,EAAAkhB,SACAlhB,CACA,CAEA,GAAAyvC,EAAA9S,UAAA8S,EAAA9S,WAAA38B,EAAA28B,SAAA,CAWA,IAAAkgC,EAAAptB,EAAA9S,UAAA,CAEA,IADA,IAAA/4B,EAAAxI,OAAAwI,KAAA6rC,GACAlyB,EAAA,EAAAA,EAAA3Z,EAAAzH,OAAAohB,IAAA,CACA,IAAA1Z,EAAAD,EAAA2Z,GACAvd,EAAA6D,GAAA4rC,EAAA5rC,EACA,CAEA,OADA7D,EAAAg8D,KAAAh8D,EAAAkhB,SACAlhB,CACA,CAGA,GADAA,EAAA28B,SAAA8S,EAAA9S,SACA8S,EAAA8R,MAAAqb,EAAAntB,EAAA9S,UASA38B,EAAA+7D,SAAAtsB,EAAAssB,aATA,CAEA,IADA,IAAA+C,GAAArvB,EAAAssB,UAAA,IAAAhlD,MAAA,KACA+nD,EAAA3iE,UAAAszC,EAAA8R,KAAAud,EAAA11D,WACAqmC,EAAA8R,OAAA9R,EAAA8R,KAAA,IACA9R,EAAAgR,WAAAhR,EAAAgR,SAAA,IACA,KAAAqe,EAAA,IAAAA,EAAAr3D,QAAA,IACAq3D,EAAA3iE,OAAA,GAAA2iE,EAAAr3D,QAAA,IACAzH,EAAA+7D,SAAA+C,EAAA/4D,KAAA,IACA,CAUA,GAPA/F,EAAAuL,OAAAkkC,EAAAlkC,OACAvL,EAAA87D,MAAArsB,EAAAqsB,MACA97D,EAAAuhD,KAAA9R,EAAA8R,MAAA,GACAvhD,EAAA2gD,KAAAlR,EAAAkR,KACA3gD,EAAAygD,SAAAhR,EAAAgR,UAAAhR,EAAA8R,KACAvhD,EAAA0gD,KAAAjR,EAAAiR,KAEA1gD,EAAA+7D,UAAA/7D,EAAAuL,OAAA,CACA,IAAA9L,EAAAO,EAAA+7D,UAAA,GACAl0D,EAAA7H,EAAAuL,QAAA,GACAvL,EAAAqc,KAAA5c,EAAAoI,CACA,CAGA,OAFA7H,EAAA47D,QAAA57D,EAAA47D,SAAAnsB,EAAAmsB,QACA57D,EAAAg8D,KAAAh8D,EAAAkhB,SACAlhB,CACA,CAEA,IAAA++D,EAAA/+D,EAAA+7D,UAAA,MAAA/7D,EAAA+7D,SAAAj0D,OAAA,GACAk3D,EAAAvvB,EAAA8R,MAAA9R,EAAAssB,UAAA,MAAAtsB,EAAAssB,SAAAj0D,OAAA,GACAm3D,EAAAD,GAAAD,GAAA/+D,EAAAuhD,MAAA9R,EAAAssB,SACAmD,EAAAD,EACAE,EAAAn/D,EAAA+7D,UAAA/7D,EAAA+7D,SAAAhlD,MAAA,MAAA,GAEAqoD,GADAN,EAAArvB,EAAAssB,UAAAtsB,EAAAssB,SAAAhlD,MAAA,MAAA,GACA/W,EAAA28B,WAAAkgC,EAAA78D,EAAA28B,WA2BA,GAlBAyiC,IACAp/D,EAAAygD,SAAA,GACAzgD,EAAA0gD,KAAA,KACA1gD,EAAAuhD,OACA,KAAA4d,EAAA,GAAAA,EAAA,GAAAn/D,EAAAuhD,KAAA4d,EAAA13D,QAAAzH,EAAAuhD,OAEAvhD,EAAAuhD,KAAA,GACA9R,EAAA9S,WACA8S,EAAAgR,SAAA,KACAhR,EAAAiR,KAAA,KACAjR,EAAA8R,OACA,KAAAud,EAAA,GAAAA,EAAA,GAAArvB,EAAA8R,KAAAud,EAAAr3D,QAAAgoC,EAAA8R,OAEA9R,EAAA8R,KAAA,MAEA0d,EAAAA,IAAA,KAAAH,EAAA,IAAA,KAAAK,EAAA,KAGAH,EAEAh/D,EAAAuhD,KAAA9R,EAAA8R,MAAA,KAAA9R,EAAA8R,KAAA9R,EAAA8R,KAAAvhD,EAAAuhD,KACAvhD,EAAAygD,SAAAhR,EAAAgR,UAAA,KAAAhR,EAAAgR,SAAAhR,EAAAgR,SAAAzgD,EAAAygD,SACAzgD,EAAAuL,OAAAkkC,EAAAlkC,OACAvL,EAAA87D,MAAArsB,EAAAqsB,MACAqD,EAAAL,OAEA,GAAAA,EAAA3iE,OAKAgjE,IAAAA,EAAA,IACAA,EAAA97D,MACA87D,EAAAA,EAAA16D,OAAAq6D,GACA9+D,EAAAuL,OAAAkkC,EAAAlkC,OACAvL,EAAA87D,MAAArsB,EAAAqsB,WACA,GAAA,MAAArsB,EAAAlkC,OAAA,CAMA,GAAA6zD,EACAp/D,EAAAuhD,KAAA4d,EAAA/1D,QACApJ,EAAAygD,SAAAzgD,EAAAuhD,MAMA8d,KAAAr/D,EAAAuhD,MAAAvhD,EAAAuhD,KAAAt7C,QAAA,KAAA,IAAAjG,EAAAuhD,KAAAxqC,MAAA,QAEA/W,EAAA2gD,KAAA0e,EAAAj2D,QACApJ,EAAAygD,SAAA4e,EAAAj2D,QACApJ,EAAAuhD,KAAAvhD,EAAAygD,UAUA,OAPAzgD,EAAAuL,OAAAkkC,EAAAlkC,OACAvL,EAAA87D,MAAArsB,EAAAqsB,MAEA,OAAA97D,EAAA+7D,UAAA,OAAA/7D,EAAAuL,SACAvL,EAAAqc,MAAArc,EAAA+7D,SAAA/7D,EAAA+7D,SAAA,KAAA/7D,EAAAuL,OAAAvL,EAAAuL,OAAA,KAEAvL,EAAAg8D,KAAAh8D,EAAAkhB,SACAlhB,CACA,CAEA,IAAAm/D,EAAAhjE,OAaA,OARA6D,EAAA+7D,SAAA,KAEA/7D,EAAAuL,OACAvL,EAAAqc,KAAA,IAAArc,EAAAuL,OAEAvL,EAAAqc,KAAA,KAEArc,EAAAg8D,KAAAh8D,EAAAkhB,SACAlhB,EAgBA,IARA,IAAAo7B,EAAA+jC,EAAA3jE,OAAA,GAAA,GACA8jE,GAAAt/D,EAAAuhD,MAAA9R,EAAA8R,MAAA4d,EAAAhjE,OAAA,KAAA,MAAAi/B,GAAA,OAAAA,IAAA,KAAAA,EAMAmkC,EAAA,EACAnjE,EAAA+iE,EAAAhjE,OAAAC,GAAA,EAAAA,IAEA,OADAg/B,EAAA+jC,EAAA/iE,IAEA+iE,EAAA1kC,OAAAr+B,EAAA,GACA,OAAAg/B,GACA+jC,EAAA1kC,OAAAr+B,EAAA,GACAmjE,KACAA,IACAJ,EAAA1kC,OAAAr+B,EAAA,GACAmjE,KAKA,IAAAN,IAAAC,EACA,KAAAK,IAAAA,EACAJ,EAAA13D,QAAA,OAIAw3D,GAAA,KAAAE,EAAA,IAAAA,EAAA,IAAA,MAAAA,EAAA,GAAAr3D,OAAA,IACAq3D,EAAA13D,QAAA,IAGA63D,GAAA,MAAAH,EAAAp5D,KAAA,KAAAmK,QAAA,IACAivD,EAAA77D,KAAA,IAGA,IAWA+7D,EAXA/vB,EAAA,KAAA6vB,EAAA,IAAAA,EAAA,IAAA,MAAAA,EAAA,GAAAr3D,OAAA,GAGAs3D,IACAp/D,EAAAygD,SAAAnR,EAAA,GAAA6vB,EAAAhjE,OAAAgjE,EAAA/1D,QAAA,GACApJ,EAAAuhD,KAAAvhD,EAAAygD,UAMA4e,KAAAr/D,EAAAuhD,MAAAvhD,EAAAuhD,KAAAt7C,QAAA,KAAA,IAAAjG,EAAAuhD,KAAAxqC,MAAA,QAEA/W,EAAA2gD,KAAA0e,EAAAj2D,QACApJ,EAAAygD,SAAA4e,EAAAj2D,QACApJ,EAAAuhD,KAAAvhD,EAAAygD,WAwBA,OApBAwe,EAAAA,GAAAj/D,EAAAuhD,MAAA4d,EAAAhjE,UAEAmzC,GACA6vB,EAAA13D,QAAA,IAGA03D,EAAAhjE,OAAA,EACA6D,EAAA+7D,SAAAoD,EAAAp5D,KAAA,MAEA/F,EAAA+7D,SAAA,KACA/7D,EAAAqc,KAAA,MAIA,OAAArc,EAAA+7D,UAAA,OAAA/7D,EAAAuL,SACAvL,EAAAqc,MAAArc,EAAA+7D,SAAA/7D,EAAA+7D,SAAA,KAAA/7D,EAAAuL,OAAAvL,EAAAuL,OAAA,KAEAvL,EAAA2gD,KAAAlR,EAAAkR,MAAA3gD,EAAA2gD,KACA3gD,EAAA47D,QAAA57D,EAAA47D,SAAAnsB,EAAAmsB,QACA57D,EAAAg8D,KAAAh8D,EAAAkhB,SACAlhB,CACA,EAEA27D,EAAAtgE,UAAAuiE,UAAA,WACA,IAAArc,EAAA3jD,KAAA2jD,KACAb,EAAAwb,EAAArhC,KAAA0mB,GACAb,IAEA,OADAA,EAAAA,EAAA,MAEA9iD,KAAA8iD,KAAAA,EAAAxwC,OAAA,IAEAqxC,EAAAA,EAAArxC,OAAA,EAAAqxC,EAAAplD,OAAAukD,EAAAvkD,SAEAolD,IAAA3jD,KAAA6iD,SAAAc,EACA,EAEAxgD,EAAA0K,MAAAwxD,EACAl8D,EAAAwlB,QA/SA,SAAAy2B,EAAAvN,GACA,OAAAwtB,EAAAjgB,GAAA,GAAA,GAAAz2B,QAAAkpB,EACA,EA8SA1uC,EAAAu9D,cAxSA,SAAAthB,EAAAvN,GACA,OAAAuN,EACAigB,EAAAjgB,GAAA,GAAA,GAAAshB,cAAA7uB,GADAA,CAEA,EAsSA1uC,EAAAmgB,OAlXA,SAAA3kB,GAQA,MADA,iBAAAA,IAAAA,EAAA0gE,EAAA1gE,IACAA,aAAAo/D,EACAp/D,EAAA2kB,SADAy6C,EAAAtgE,UAAA6lB,OAAA3lB,KAAAgB,EAEA,EA0WAwE,EAAA46D,IAAAA,C/GkufA,EAAE,CAACrmB,SAAW,GAAG0I,GAAK,KAAK,IAAI,CAAC,SAASv8C,EAAQT,EAAOD,IACxD,SAAWK,IAAQ,WgH/6gBnB,SAAAo+D,EAAA9jE,GAEA,IACA,IAAA0F,EAAAq+D,aAAA,OAAA,CACA,CAAA,MAAAphD,GACA,OAAA,CACA,CACA,IAAApP,EAAA7N,EAAAq+D,aAAA/jE,GACA,OAAA,MAAAuT,GACA,SAAArQ,OAAAqQ,GAAAX,aACA,CA7DAtN,EAAAD,QAoBA,SAAAsB,EAAAynD,GACA,GAAA0V,EAAA,iBACA,OAAAn9D,EAGA,IAAA2lB,GAAA,EAeA,OAdA,WACA,IAAAA,EAAA,CACA,GAAAw3C,EAAA,oBACA,MAAA,IAAA59D,MAAAkoD,GACA0V,EAAA,oBACAxtD,QAAAqe,MAAAy5B,GAEA93C,QAAAkW,KAAA4hC,GAEA9hC,GAAA,CACA,CACA,OAAA3lB,EAAA1E,MAAAC,KAAAF,UACA,CAGA,ChH8/gBC,GAAEnC,KAAKqC,KAAM,GAAErC,KAAKqC,KAAuB,oBAAXwD,OAAyBA,OAAyB,oBAATf,KAAuBA,KAAyB,oBAAXc,OAAyBA,OAAS,CAAC,EAElJ,EAAE,CAAC,GAAG,IAAI,CAAC,SAASM,EAAQT,EAAOD,GiHzihBnCC,EAAAD,QACA,SAAAutC,EAAAjsC,EAAAJ,GACA,GAAAI,GAAAJ,EAAA,OAAAqsC,EAAAjsC,EAAAisC,CAAArsC,GAEA,GAAA,mBAAAI,EACA,MAAA,IAAAtH,UAAA,yBAMA,OAJAK,OAAAwI,KAAAvB,GAAAsf,SAAA,SAAA9d,GACA67D,EAAA77D,GAAAxB,EAAAwB,EACA,IAEA67D,EAEA,SAAAA,IAEA,IADA,IAAAv8D,EAAA,IAAAxH,MAAA+B,UAAAvB,QACAC,EAAA,EAAAA,EAAA+G,EAAAhH,OAAAC,IACA+G,EAAA/G,GAAAsB,UAAAtB,GAEA,IAAAoX,EAAAnR,EAAA1E,MAAAC,KAAAuF,GACAlB,EAAAkB,EAAAA,EAAAhH,OAAA,GAMA,MALA,mBAAAqX,GAAAA,IAAAvR,GACA7G,OAAAwI,KAAA3B,GAAA0f,SAAA,SAAA9d,GACA2P,EAAA3P,GAAA5B,EAAA4B,EACA,IAEA2P,CACA,CACA,CjHijhBA,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS/R,EAAQT,EAAOD,GkHjlhBnCC,EAAAD,QAIA,WAGA,IAFA,IAAA5D,EAAA,CAAA,EAEAf,EAAA,EAAAA,EAAAsB,UAAAvB,OAAAC,IAAA,CACA,IAAA4gD,EAAAt/C,UAAAtB,GAEA,IAAA,IAAAI,KAAAwgD,EACAl/C,EAAAvC,KAAAyhD,EAAAxgD,KACAW,EAAAX,GAAAwgD,EAAAxgD,GAGA,CAEA,OAAAW,CACA,EAhBA,IAAAW,EAAA1C,OAAAC,UAAAyC,clHomhBA,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS2D,EAAQT,EAAOD,GmHjmhBnC,IAAA4+D,EAAAl+D,EAAA,6BAEAm+D,EAAA,SAAAC,GAAAzgE,UAAAwgE,EAAAC,GAAA,IAAAC,EAAAlgE,aAAAggE,GAEA,SAAAA,EAAA5wC,EAAAtX,GACA,IAAAqoD,EAiBA,OAjBA/hE,iBAAAJ,KAAAgiE,IACAG,EAAAD,EAAAvkE,KAAAqC,KAAAoxB,EAAAtX,IAEAE,YAAA,iBAEAmoD,EAAAC,aAAA,GAGAD,EAAA3tC,YAAA,CAAA,EAGA2tC,EAAA1tC,SAAA,CAAA,EAGA0tC,EAAAE,eAAA,CAAA,EAGAF,EAAAG,4BAAA,EAAAH,CACA,CAiIA,OAjIAzhE,cAAAshE,EAAA,CAAA,CAAApjE,IAAA,iBAAAC,MAEA,SAAA0jE,EAAAC,GAEAxiE,KAAAw0B,YAAAt0B,eAAAqiE,GAGAviE,KAAAm0B,MAAAjF,IAAA5E,KAAA,0BAAAzjB,OAAA07D,EAAA,4BAKAviE,KAAAw0B,YAAA+tC,GAAA,CAAA,EAGAviE,KAAAoiE,aAAA18D,KAAA68D,IAIA,mBAAAC,GAAAA,EAAAC,eAGAziE,KAAAqiE,eAAAE,GAAAC,GAKAxiE,KAAAm0B,MAAAjF,IAAA7a,MAAA,kCAAAxN,OAAA07D,EAAA,oHACAviE,KAAAqiE,eAAAE,GAAAR,EAEA,GAEA,CAAAnjE,IAAA,+BAAAC,MACA,SAAA0jE,EAAAC,GAGA,OADAxiE,KAAA0iE,eAAAH,EAAAC,GACAxiE,KAAA2iE,2BAAAJ,EAAA,CAAA,EAAA,GAAA17D,OAAA07D,EAAA,YACA,GAEA,CAAA3jE,IAAA,0CAAAC,MACA,SAAA0jE,EAAAruC,EAAA0uC,EAAAC,GAGA,IAAAC,EAAA,IAAAD,EAAA7iE,KAAAm0B,MAAAD,EAAA0uC,GAgBA,OAdA5iE,KAAAsiE,6BAEAQ,EAAA9iE,KAAAsiE,2BAAAQ,IAIA9iE,KAAAw0B,YAAA+tC,GAAAO,EAAApoD,MAAAooD,EAGA9iE,KAAAy0B,SAAAv0B,eAAAqiE,IAEAviE,KAAA+iE,+BAAAR,EAAAO,EAAApoD,MAGAooD,CACA,GAAA,CAAAlkE,IAAA,6BAAAC,MAGA,SAAA0jE,EAAAruC,EAAA0uC,GAGA,IAAAE,EAAA9iE,KAAAgjE,8CAAAT,EAAAruC,EAAA0uC,GAWA,OARA5iE,KAAAw0B,YAAA+tC,GAAAO,EAAApoD,MAAAooD,EAGA9iE,KAAAy0B,SAAAv0B,eAAAqiE,IAEAviE,KAAA+iE,+BAAAR,EAAAO,EAAApoD,MAGAooD,CACA,GAEA,CAAAlkE,IAAA,gDAAAC,MACA,SAAA0jE,EAAAruC,EAAA0uC,GAGA,IAAAE,EAAA,IAAA9iE,KAAAqiE,eAAAE,GAAAviE,KAAAm0B,MAAAD,EAAA0uC,GAKA,OAJA5iE,KAAAsiE,6BAEAQ,EAAA9iE,KAAAsiE,2BAAAQ,IAEAA,CACA,GAEA,CAAAlkE,IAAA,wCAAAC,MACA,SAAAokE,GAEA,IAAAC,EAAAD,EAAAjpD,YACAmpD,EAAAF,EAAAvoD,KAoBA,OAjBAuoD,EAAAG,aAAApjE,KAAAm0B,OAEAn0B,KAAAw0B,YAAAt0B,eAAAgjE,KAIAljE,KAAAw0B,YAAA0uC,GAAA,CAAA,GAGAljE,KAAAw0B,YAAA0uC,GAAAC,GAAAF,EAGAjjE,KAAAy0B,SAAAv0B,eAAAgjE,IAEAljE,KAAA+iE,+BAAAG,EAAAC,GAGAF,CACA,GAAA,CAAArkE,IAAA,iCAAAC,MAEA,SAAA0jE,EAAAzoD,GAEA,QAAA9Z,KAAAw0B,YAAA+tC,GAAAriE,eAAA4Z,KAEA9Z,KAAAm0B,MAAAouC,GAAAviE,KAAAw0B,YAAA+tC,GAAAzoD,GACA9Z,KAAAy0B,SAAA8tC,GAAAviE,KAAAw0B,YAAA+tC,GAAAzoD,IACA,EAIA,KAAAkoD,CAAA,CAtJA,CAAAD,EAAAv0C,yBAyJApqB,EAAAD,QAAA6+D,EAEA5+D,EAAAD,QAAAkgE,oBAAAtB,EACA3+D,EAAAD,QAAAqqB,wBAAAu0C,EAAAv0C,uBnHwmhBA,EAAE,CAAC,4BAA4B,KAAK,IAAI,CAAC,SAAS3pB,EAAQT,EAAOD,GoHtwhBjE,IAAAmgE,EAAAz/D,EAAA,kBACA0/D,EAAA1/D,EAAA,cACA2/D,EAAA3/D,EAAA,aAEA4/D,EAAA5/D,EAAA,6BAEAJ,EAAA,WAEA,SAAAA,EAAA2tB,GACAhxB,iBAAAJ,KAAAyD,GAKAzD,KAAA0jE,cAAA,CAAA,EAGA1jE,KAAA0jE,cAAAC,gBAAA,IAAAL,EAAAlyC,GAEApxB,KAAA0jE,cAAAtvC,KAAA,IAAAmvC,EAAAvjE,KAAA0jE,cAAAC,gBAAAptC,UAEAv2B,KAAA0jE,cAAAE,QAAA,IAAAJ,EAAAxjE,KAAA0jE,cAAAC,gBAAAptC,UACAv2B,KAAA0jE,cAAAE,QAAA5wC,aAIAhzB,KAAA0jE,cAAAG,eAAA,IAAAJ,EAAAzjE,MACAA,KAAA8jE,eAAA9jE,KAAA0jE,cAAAG,eACA7jE,KAAA8jE,eAAAV,aAAApjE,MAKAA,KAAA8jE,eAAAC,sCAAA/jE,KAAA0jE,cAAAG,gBACA7jE,KAAA8jE,eAAAC,sCAAA/jE,KAAA0jE,cAAAtvC,MACAp0B,KAAA8jE,eAAAC,sCAAA/jE,KAAA0jE,cAAAE,SACA5jE,KAAA8jE,eAAAC,sCAAA/jE,KAAA0jE,cAAAC,iBAGA3jE,KAAA8jE,eAAAE,6BAAA,kBAAAngE,EAAA,gDACA7D,KAAA8jE,eAAApB,eAAA,WAAA7+D,EAAA,yCACA7D,KAAA8jE,eAAApB,eAAA,eAAA7+D,EAAA,6CACA7D,KAAA8jE,eAAApB,eAAA,aAAA7+D,EAAA,2CACA7D,KAAA8jE,eAAAE,6BAAA,QAAAngE,EAAA,iDACA7D,KAAA8jE,eAAAE,6BAAA,aAAAngE,EAAA,2CACA7D,KAAA8jE,eAAAE,6BAAA,iBAAAngE,EAAA,+CACA7D,KAAA8jE,eAAAE,6BAAA,UAAAngE,EAAA,wCACA7D,KAAA8jE,eAAApB,eAAA,YAAA7+D,EAAA,0CACA7D,KAAA8jE,eAAApB,eAAA,aAAA7+D,EAAA,2CACA7D,KAAA8jE,eAAApB,eAAA,YAAA7+D,EAAA,0CACA7D,KAAA8jE,eAAApB,eAAA,WAAA7+D,EAAA,aACA7D,KAAA8jE,eAAApB,eAAA,cAAA7+D,EAAA,cACA7D,KAAA8jE,eAAApB,eAAA,kBAAA7+D,EAAA,+CACA,CAwCA,OAxCAnD,cAAA+C,EAAA,CAAA,CAAA7E,IAAA,UAAAS,IAEA,WAEA,OAAA,CACA,GAAA,CAAAT,IAAA,WAAAS,IAEA,WAEA,OAAAW,KAAA0jE,cAAAC,gBAAAptC,QACA,GAAA,CAAA33B,IAAA,kBAAAS,IAEA,WAEA,OAAAW,KAAA0jE,cAAAC,eACA,GAAA,CAAA/kE,IAAA,MAAAS,IAEA,WAEA,OAAAW,KAAA0jE,cAAAE,OACA,GAAA,CAAAhlE,IAAA,WAAAS,IAEA,WAEA,OAAAW,KAAA0jE,cAAAG,eAAApvC,QACA,GAAA,CAAA71B,IAAA,cAAAS,IAEA,WAEA,OAAAW,KAAA0jE,cAAAG,eAAArvC,WACA,GAAA,CAAA51B,IAAA,UAAAC,MAEA,WAEA,OAAAmB,KAAA0jE,cAAAtvC,KAAAG,SACA,GAAA,CAAA31B,IAAA,QAAAS,IAEA,WAEA,OAAAW,IACA,KAAAyD,CAAA,CAvFA,GAgGAL,EAAAD,QAAAM,EACAL,EAAAD,QAAA,IANA,SAAAiuB,GAEA,OAAA,IAAA3tB,EAAA2tB,EACA,EAKAhuB,EAAAD,QAAA2wB,gBAAA0vC,EAAA1vC,gBACA1wB,EAAAD,QAAAkgE,oBAAAI,EAAAJ,oBACAjgE,EAAAD,QAAAqqB,wBAAAi2C,EAAAj2C,wBAEApqB,EAAAD,QAAAwyB,UAAA2tC,EAAA3tC,SpH6whBA,EAAE,CAAC,4BAA4B,IAAI,yCAAyC,IAAI,wCAAwC,IAAI,yCAAyC,IAAI,6CAA6C,IAAI,+CAA+C,IAAI,8CAA8C,IAAI,8CAA8C,IAAI,2CAA2C,IAAI,wCAAwC,IAAI,yCAAyC,IAAI,uCAAuC,IAAI,sCAAsC,IAAIsuC,UAAY,GAAG,YAAY,GAAG,iBAAiB,GAAG,aAAa,GAAGC,SAAW,KAAK,IAAI,CAAC,SAASrgE,EAAQT,EAAOD,GqH/3hB7rB,IAEAghE,EAAA,SAAAC,GAAA5iE,UAAA2iE,EAAAC,GAAA,IAAAC,EAAAriE,aAAAmiE,GAEA,SAAAA,EAAAvqD,EAAAsa,EAAApa,GACA,IAAAwqD,EAeA,OAfAlkE,iBAAAJ,KAAAmkE,IACAG,EAAAD,EAAA1mE,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAEAE,YAAA,kBAGAsqD,EAAAC,eAAA,GACAD,EAAAE,kBAAA,GAEAF,EAAAG,wBAAA,EACAH,EAAAI,wBAAA,EAEAJ,EAAAK,cAAA,EAEAL,EAAAM,eAAAvjE,EACAijE,EAAAO,iBAAA,GAAAP,CACA,CA8DA,OA9DA5jE,cAAAyjE,EAAA,CAAA,CAAAvlE,IAAA,aAAAC,MAEA,WAGA,GAAAmB,KAAAukE,eAAAhmE,OAAA,GAAAyB,KAAAykE,wBAAAzkE,KAAA2kE,cACA,CACA,IAAAG,EAAA9kE,KAAAukE,eAAA/4D,QACAxL,KAAAykE,yBAAA,EACAK,EAAA9kE,KAAA+kE,2BACA,MACA,GAAA/kE,KAAA6kE,iBAAAtmE,OAAA,GAAAyB,KAAAykE,wBAAA,EACA,CAEA,IAAA,IAAAjmE,EAAA,EAAAA,EAAAwB,KAAA6kE,iBAAAtmE,OAAAC,IAEAwB,KAAA6kE,iBAAArmE,GAAAwB,KAAA4kE,WAGA5kE,KAAA4kE,eAAAvjE,EACArB,KAAA6kE,iBAAA,EACA,CACA,GAEA,CAAAjmE,IAAA,aAAAC,MACA,SAAAmmE,GAEAhlE,KAAAukE,eAAA7+D,KAAAs/D,GACAhlE,KAAAilE,YACA,GAAA,CAAArmE,IAAA,2BAAAC,MAEA,WAGA,IAAAqmE,EACA,CACAC,QAAA,EACAnhE,WAAA3C,EACA+jE,aAAAplE,MAEA,OACA,SAAA4c,GAEA,GAAAsoD,EAAAC,OAGA,MAAA,IAAAnhE,MAAA,+CAEAkhE,EAAAC,QAAA,EACAD,EAAA7wD,MAAAuI,EAEAsoD,EAAAE,aAAAX,yBAAA,EACAS,EAAAE,aAAAV,yBAAA,EAEAQ,EAAAE,aAAAH,YACA,CACA,GAAA,CAAArmE,IAAA,OAAAC,MAEA,SAAAwmE,GAEArlE,KAAA6kE,iBAAAn/D,KAAA2/D,GACArlE,KAAAilE,YACA,KAAAd,CAAA,CAjFA,CAFAtgE,EAAA,8BAAAw/D,qBAsFAjgE,EAAAD,QAAAghE,CrHi4hBA,EAAE,CAAC,6BAA6B,MAAM,IAAI,CAAC,SAAStgE,EAAQT,EAAOD,GsHv9hBnE,IAcAmiE,EAAA,SAAAC,GAAA/jE,UAAA8jE,EAAAC,GAAA,IAAAC,EAAAxjE,aAAAsjE,GAEA,SAAAA,EAAA1rD,EAAAsa,EAAApa,GACA,IAAA2rD,EA8BA,OA9BArlE,iBAAAJ,KAAAslE,IACAG,EAAAD,EAAA7nE,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAEAE,YAAA,YAEAyrD,EAAAC,OAAA,GACAD,EAAAE,iBAAA,GAEAF,EAAAG,UAAA,IACAH,EAAAI,eAAA,IAEAJ,EAAAK,gBAAA,CAAA,MAEAL,EAAAM,gBAAA,EACAN,EAAAO,WAAA,EACAP,EAAAQ,cAAA,EACAR,EAAAS,YAAA,EAEAT,EAAAU,UAAA,EAEAV,EAAAW,mBAAA,SAGAX,EAAAY,YAAA,GACAZ,EAAAa,cAAA,GAEAb,EAAAc,SAAA,EACAd,EAAAe,gBAAA,EAEAf,EAAAgB,YAAA,EACAhB,EAAAiB,YAAA,EAAAjB,CACA,CAmJA,OAnJA/kE,cAAA4kE,EAAA,CAAA,CAAA1mE,IAAA,mBAAAC,MAEA,SAAA8nE,GAEA,IAAA5oE,MAAAM,QAAAsoE,GAEA,OAAA,EAGA,IAAA,IAAAnoE,EAAAwB,KAAA2lE,iBAAApnE,OAAAC,EAAAmoE,EAAApoE,OAAAC,IAEAwB,KAAA2lE,iBAAAnnE,GAAA,GAAAqI,OAAArI,GAKA,IAFA,IAAA0rC,EAAA,CAAA,EAEA1rC,EAAA,EAAAA,EAAAmoE,EAAApoE,OAAAC,IAEA0rC,EAAAlqC,KAAA2lE,iBAAAnnE,IAAAmoE,EAAAnoE,GAGA,OAAA0rC,CACA,GAEA,CAAAtrC,IAAA,YAAAC,MACA,SAAA+nE,GAEA5mE,KAAA0lE,OAAAkB,EAEA,IAAA,IAAApoE,EAAA,EAAAA,EAAAwB,KAAA0lE,OAAAnnE,OAAAC,SAEA,IAAAwB,KAAA0lE,OAAAlnE,GAEAwB,KAAA2lE,iBAAAnnE,GAAA,GAAAqI,OAAArI,GAIAwB,KAAA2lE,iBAAAnnE,GAAAwB,KAAA0lE,OAAAlnE,GAAAd,UAGA,GAAA,CAAAkB,IAAA,gBAAAC,MAEA,WAEAmB,KAAAsmE,cAAA,EACA,GAAA,CAAA1nE,IAAA,WAAAC,MAEA,WAEA,IAAA,IAAAL,EAAA,EAAAA,EAAAwB,KAAA8lE,gBAAAvnE,OAAAC,IAEAwB,KAAAqmE,YAAArmE,KAAAqmE,YAAA34D,QAAA1N,KAAA8lE,gBAAAtnE,GAAA,IAEAwB,KAAAsmE,cAAA5gE,KAAA1F,KAAAqmE,aACArmE,KAAAqmE,YAAA,EACA,GAAA,CAAAznE,IAAA,UAAAC,MAEA,SAAAgoE,GAEA,IAAAC,OAAA,IAAAD,EAAA7mE,KAAAmmE,SAAAU,EAEA7mE,KAAA0mE,cACA,IAAAK,EAAA/mE,KAAAsmE,cAGA,OAFAtmE,KAAAsmE,cAAA,GAEAQ,EAEA9mE,KAAAgnE,iBAAAD,GAIAA,CAEA,GAAA,CAAAnoE,IAAA,eAAAC,MAEA,SAAAooE,GAEAjnE,KAAAymE,cAEA,IAAA,IAAAjoE,EAAA,EAAAA,EAAAyoE,EAAA1oE,OAAAC,IAEAwB,KAAAumE,SAAAU,EAAAzoE,IAAAwB,KAAA4lE,UAIAqB,EAAAzoE,IAAAwB,KAAA6lE,eAGA7lE,KAAAwmE,eAEAxmE,KAAAwmE,gBAAA,EAGAxmE,KAAAumE,QAKA/nE,EAAAyoE,EAAA1oE,QAAA0oE,EAAAzoE,EAAA,IAAAwB,KAAA6lE,gBAEA7lE,KAAAqmE,aAAArmE,KAAAomE,mBACApmE,KAAAwmE,gBAAA,GAKAxmE,KAAAumE,SAAA,EAXAvmE,KAAAumE,SAAA,EAgBAvmE,KAAAqmE,aAAAY,EAAAzoE,GA5BAwB,KAAAknE,WAiCA,OAAAlnE,KAAAumE,UAGAvmE,KAAAknE,WAGAlnE,KAAAgmE,YAAAhmE,KAAAimE,cAAAjmE,KAAA0mE,aAAA1mE,KAAA+lE,iBAEA/lE,KAAAimE,cAAA,EAEAjmE,KAAAwmD,UAAAxmD,KAAAmnE,SAAA,MAGAnnE,KAAAkmE,YAEAlmE,KAAA0lE,QASA1lE,KAAAmnE,UAOA,KAAA7B,CAAA,CArLA,CAdAzhE,EAAA,8BAsMAT,EAAAD,QAAAmiE,CtHy9hBA,EAAE,CAAC,4BAA4B,KAAK,IAAI,CAAC,SAASzhE,EAAQT,EAAOD,GuH/piBjE,IAMAikE,EAAA,SAAAC,GAAA7lE,UAAA4lE,EAAAC,GAAA,IAAAC,EAAAtlE,aAAAolE,GAEA,SAAAA,EAAAxtD,EAAAsa,EAAApa,GACA,IAAAytD,EA0BA,OA1BAnnE,iBAAAJ,KAAAonE,GA0VA1oE,iBAAAgE,uBAzVA6kE,EAAAD,EAAA3pE,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAyVA,kBAOA,SAAA0b,EAAAgyC,EAAAC,GAEA,IAAAC,EAAAlyC,EAAA93B,WACA,OAAAsC,KAAA2nE,4BAAAD,EAAAF,EAAAC,GAAAC,CACA,IAEAhpE,iBAAAgE,uBAAA6kE,GAAA,gBAOA,SAAA/xC,EAAAgyC,EAAAC,GAEA,IAAAC,EAAAlyC,EAAA93B,WACA,OAAAgqE,EAAA1nE,KAAA2nE,4BAAAD,EAAAF,EAAAC,EACA,IA/WAF,EAAAvtD,YAAA,iBAIAutD,EAAAK,6BAAA,UAIAL,EAAAM,kCAAA,+BACAN,EAAAO,oCAAA,MACAP,EAAAQ,kCAAA,cACAR,EAAAS,mCAAA,eAIAT,EAAAU,0BAAA,IACAV,EAAAW,oBAAA,KACAX,EAAAY,6BAAA,IAEAZ,EAAAa,yBAAA,MACAb,EAAAc,oCAAA,GAEAd,EAAAe,2BAAA,mBAAAtnE,OAAAvD,UAAAqiC,WACAynC,EAAAgB,yBAAA,mBAAAvnE,OAAAvD,UAAAsiC,SAAAwnC,CACA,CAyoBA,OAloBA7mE,cAAA0mE,EAAA,CAAA,CAAAxoE,IAAA,gBAAAC,MAMA,SAAA22B,GAIA,OAAAA,EAAArc,MAAA,IAAA/M,UAAAjE,KAAA,GACA,GAEA,CAAAvJ,IAAA,mBAAAC,MAQA,SAAA22B,EAAAgzC,EAAAC,GAEA,OAAAzoE,KAAAsoE,2BAEA9yC,EAAAsK,WAAA0oC,EAAAC,GAIAzoE,KAAA0oE,0BAAA/qE,KAAA63B,EAAAgzC,EAAAC,EAEA,GAEA,CAAA7pE,IAAA,4BAAAC,MAOA,SAAA2pE,EAAAC,GAEA,OAAAzoE,KAAApC,MAAA6qE,GAAA,EAAAD,EAAAjqE,UAAAiqE,CACA,GAEA,CAAA5pE,IAAA,iBAAAC,MAQA,SAAA22B,EAAAgzC,EAAAG,GAEA,OAAA3oE,KAAAuoE,yBAEA/yC,EAAAuK,SAAAyoC,EAAAG,GAIA3oE,KAAA4oE,wBAAAjrE,KAAA63B,EAAAgzC,EAAAG,EAEA,GAEA,CAAA/pE,IAAA,0BAAAC,MAOA,SAAA2pE,EAAAG,GAYA,OARAA,EAAA3oE,KAAAzB,OAMAoqE,GAAA,EAJAA,EAAA3oE,KAAAzB,OAMAyB,KAAAsS,OAAAq2D,EAAAH,EAAAjqE,OAAAiqE,EAAAjqE,UAAAiqE,CACA,GAEA,CAAA5pE,IAAA,qBAAAC,MAMA,SAAA22B,GAMA,IAJA,IAAAnZ,EAAA,EACAwsD,EAAArzC,EAAAj3B,OACAuqE,EAAA,EAEAA,EAAAD,GAEAxsD,GAAAA,GAAA,GAAAA,EAAAmZ,EAAA9tB,WAAAohE,KAAA,EAGA,MAAA,GAAAjiE,OAAA7G,KAAAooE,0BAAAvhE,OAAAwV,EACA,GAAA,CAAAzd,IAAA,qBAAAC,MAEA,SAAA22B,GAEA,OAAAA,EAAA9nB,QAAA1N,KAAAgoE,oCACA,SAAAe,GAEA,OAAAA,EAAA7+D,OAAA,GAAAqhC,cAAAw9B,EAAAz2D,OAAA,EACA,GACA,GAEA,CAAA1T,IAAA,+BAAAC,MAOA,SAAAmqE,EAAAxzC,GAcA,OAAAA,EAAAsK,WAAAkpC,IAAAxzC,EAAAuK,SAAAipC,GAEAxzC,EAAA5nB,UAAA,EAAA4nB,EAAAj3B,OAAA,GAIAi3B,CAEA,GAEA,CAAA52B,IAAA,0BAAAC,MAMA,SAAA22B,GAEA,MAAA,iBAAAA,GAAA,IAAAA,EAEAA,EAAA9nB,QAAA1N,KAAA+nE,kCAAA/nE,KAAAqoE,qCAGA,EACA,GAOA,CAAAzpE,IAAA,wBAAAC,MAMA,SAAA22B,GAGA,IAEAyzC,EAFAjpE,KAAAkpE,cAAA1zC,GAEArU,MAAAnhB,KAAA4nE,8BAAAz/D,KAAA,KAEA,OAAAnI,KAAAkpE,cAAAD,EACA,GAAA,CAAArqE,IAAA,gCAAAC,MAEA,SAAAkqE,EAAAI,EAAAC,EAAAC,EAAAC,EAAAC,GAIA,OAAAJ,GAAAG,EAAAtpE,KAAAwpE,sBAAAH,GAAAC,EAAAC,EAAAvpE,KAAAwpE,sBAAAH,EAAAE,GACA,GAEA,CAAA3qE,IAAA,6BAAAC,MAMA,SAAA4qE,GAGA,OAAAA,EAAA/rE,WAAAgQ,QAEA1N,KAAA6nE,kCACA7nE,KAAA0pE,8BAAApqE,KAAAU,MAEA,GAEA,CAAApB,IAAA,mBAAAC,MAMA,SAAAukC,GAEA,GAAA9kB,MAAA8kB,GAEA,OAAApjC,KAAAkoE,oBAGA,GAAA9kC,QAEA,OAAApjC,KAAAkoE,oBAGA,IACAyB,EADA3pE,KAAAm0B,MAAAy1C,QAAAC,UAAAzmC,GACAn2B,QAAA,GAEA,OAAAqR,MAAAqrD,KAGA,iBAAAvmC,IAGAumC,EAAAhuC,WAAAyH,EAAA11B,QAAA1N,KAAAioE,0BAAA,IAAAv6D,QAAA1N,KAAA8nE,oCAAA,KAAA76D,QAAA,IAGAqR,MAAAqrD,IAEA3pE,KAAAkoE,oBAKA,IAAArhE,OAAA7G,KAAA8pE,2BAAAH,GACA,GAEA,CAAA/qE,IAAA,uBAAAC,MAOA,SAAAukC,EAAA2mC,GAEA,IAAAC,OAAA,IAAAD,EAAA,EAAAA,EAEA,GAAAzrD,MAAA8kB,GACA,CAEA,OADA,GACAn2B,QAAA+8D,EACA,CAEA,GAAA5mC,QAEA,MAAA,GAGA,IACAvL,EADA73B,KAAAm0B,MAAAy1C,QAAAC,UAAAzmC,GACAn2B,QAAA+8D,GAEA,GAAA1rD,MAAAuZ,GACA,CAEA,OADA,GACA5qB,QAAA+8D,EACA,CAGA,OAAAnyC,CAEA,GAGA,CAAAj5B,IAAA,8BAAAC,MAQA,SAAA22B,EAAAgyC,EAAAC,GAEA,IAAAwC,EAAAzC,GAAA,EACA0C,EAAAlpE,YAAA,IAAAymE,EAAAA,EAAA,KACA,GAAAjyC,EAAAj3B,OAAAipE,EAGA,MAAA,GAIA,IAAA2C,EAAA3C,EAAAhyC,EAAAj3B,OAKA,OAJA4rE,EAAAD,EAAA3rE,SAEA2rE,GAAAA,EAAA3sB,OAAA0sB,EAAAC,EAAA3rE,SAEA2rE,EAAAtsE,MAAA,EAAAusE,EAEA,GAAA,CAAAvrE,IAAA,iBAAAC,MAqCA,SAAAurE,GAEA,GAAA,iBAAAA,EAEA,MAAA,GAGA,IAAA92C,EAAAjhB,SAAA+3D,EAAA,KACA72C,EAAAlhB,SAAA+3D,EAAA,IAAA,IACA52C,EAAAnhB,SAAA+3D,EAAA,IAAA,IACA32C,EAAAphB,SAAA+3D,EAAA,MAEA,MAAA,GAAAvjE,OAAA7G,KAAAqqE,eAAA52C,EAAA,EAAA,KAAA,KAAA5sB,OAAA7G,KAAAqqE,eAAA72C,EAAA,EAAA,KAAA,KAAA3sB,OAAA7G,KAAAqqE,eAAA92C,EAAA,EAAA,KAAA,KAAA1sB,OAAA7G,KAAAqqE,eAAA/2C,EAAA,EAAA,KACA,GAEA,CAAA10B,IAAA,kBAAAC,MAOA,SAAAyrE,EAAAC,GAEA,MAAA,iBAAAD,GAAA,iBAAAC,EAEA,GAGAvqE,KAAAwqE,eAAAD,EAAAD,EACA,GAEA,CAAA1rE,IAAA,mBAAAC,MACA,SAAA4rE,GAGA,MADA,CAAA,UAAA,WAAA,QAAA,QAAA,MAAA,OAAA,OAAA,SAAA,YAAA,UAAA,WAAA,YACAA,EAAAhpD,WACA,GAAA,CAAA7iB,IAAA,8BAAAC,MAEA,SAAA4rE,GAGA,MADA,CAAA,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,OACAA,EAAAhpD,WACA,GAAA,CAAA7iB,IAAA,6BAAAC,MAEA,SAAA4rE,EAAAC,GAEA,IAAAC,OAAA,IAAAD,GAAAA,EAEAE,EAAAH,EAAAhpD,WAAA,EACAopD,EAAAJ,EAAA9oD,UACAmpD,EAAAL,EAAAlpD,cASA,OAPAopD,IAEAC,EAAA5qE,KAAAqqE,eAAAO,EAAA,EAAA,KACAC,EAAA7qE,KAAAqqE,eAAAQ,EAAA,EAAA,KACAC,EAAA9qE,KAAAqqE,eAAAS,EAAA,EAAA,MAGA,GAAAjkE,OAAA+jE,EAAA,KAAA/jE,OAAAgkE,EAAA,KAAAhkE,OAAAikE,EACA,GAAA,CAAAlsE,IAAA,+BAAAC,MAEA,SAAAksE,GAEA,OAAAA,EAAAxpD,cAAAvhB,KAAAqqE,eAAAU,EAAAtpD,WAAA,EAAA,KAAAzhB,KAAAqqE,eAAAU,EAAAppD,UAAA,EAAA,IACA,GAMA,CAAA/iB,IAAA,oBAAAC,MASA,SAAA22B,EAAAuzC,GAEA,OAAAvzC,EAAArc,MAAA4vD,GAAA,EACA,GAEA,CAAAnqE,IAAA,mBAAAC,MASA,SAAA22B,EAAAuzC,GAEA,IAAAiC,EAAAx1C,EAAAntB,QAAA0gE,GAEA,OAAAiC,EAAA,GAAAA,EAAAjC,EAAAxqE,QAAAi3B,EAAAj3B,OAEA,GAGAi3B,EAAA5nB,UAAAo9D,EAAAjC,EAAAxqE,OACA,GAEA,CAAAK,IAAA,wBAAAC,MAUA,SAAA22B,EAAAy1C,EAAAC,GAQA,IANA,IAAAxD,EAAA,iBAAAlyC,EAAAA,EAAA,GACA21C,EAAA,iBAAAF,EAAAA,EAAA,IACAG,EAAA,iBAAAF,EAAAA,EAAA,IAEAG,EAAA,EACAC,EAAA,EACA9sE,EAAA,EAAAA,EAAAkpE,EAAAnpE,OAAAC,IAGAkpE,EAAAlpE,IAAA2sE,GAEA,GAAAG,GAEAD,IAEAC,KAEA5D,EAAAlpE,IAAA4sE,GAEAE,IAIA,OAAAD,CACA,GAGA,CAAAzsE,IAAA,iCAAAC,MAWA,SAAA22B,EAAA+1C,EAAAN,EAAAC,GAcA,IAZA,IAAAxD,EAAA,iBAAAlyC,EAAAA,EAAA,GACAg2C,EAAA,iBAAAD,EAAAA,EAAA,EACAJ,EAAA,iBAAAF,EAAAA,EAAA,IACAG,EAAA,iBAAAF,EAAAA,EAAA,IAEAG,EAAA,EACAC,EAAA,EAEAG,GAAA,EACAC,EAAA,EACAC,EAAA,EAEAntE,EAAA,EAAAA,EAAAkpE,EAAAnpE,OAAAC,IAGAkpE,EAAAlpE,IAAA2sE,EAKA,KAHAG,GAMAE,KADAH,EACA,IAGAI,GAAA,EACAC,EAAAltE,GAKAkpE,EAAAlpE,IAAA4sE,GAKA,KAHAE,GAIAG,GACAE,GAAAD,IAEAC,EAAAntE,EACAitE,GAAA,GAKA,OAAAJ,GAAAG,EAGA,GAGAG,EAAA,GAAAA,EAAAD,EAEAhE,EAAA95D,UAAA89D,EAAA,EAAAC,GAIAjE,EAAA95D,UAAA89D,EAAA,EAEA,GAGA,CAAA9sE,IAAA,+BAAAC,MASA,SAAA22B,EAAAo2C,EAAAX,EAAAC,GAcA,IAZA,IAAAxD,EAAA,iBAAAlyC,EAAAA,EAAA,GACAq2C,EAAA,iBAAAD,EAAAA,EAAA,EACAT,EAAA,iBAAAF,EAAAA,EAAA,IACAG,EAAA,iBAAAF,EAAAA,EAAA,IAEAG,EAAA,EACAC,EAAA,EAEAG,GAAA,EACAK,EAAA,EACAC,EAAA,EAEAvtE,EAAA,EAAAA,EAAAkpE,EAAAnpE,OAAAC,IAGAkpE,EAAAlpE,IAAA2sE,EAIA,KAFAG,GAKAO,KADAR,EACA,IAEAI,GAAA,EACAK,EAAAttE,GAIAkpE,EAAAlpE,IAAA4sE,GAIA,KAFAE,GAGAG,GACAM,GAAAD,IAEAC,EAAAvtE,EACAitE,GAAA,GAKA,GAAAJ,GAAAQ,EAEA,OAAAnE,EAGA,IAAAsE,EAAA,GAYA,OAVAF,EAAA,IAEAE,EAAAtE,EAAA95D,UAAA,EAAAk+D,IAGApE,EAAAnpE,OAAAwtE,EAAA,GAAAA,EAAAD,IAEAE,GAAAtE,EAAA95D,UAAAm+D,EAAA,IAGAC,CACA,KAAA5E,CAAA,CAvqBA,CANAvjE,EAAA,8BAgrBAT,EAAAD,QAAAikE,CvHiqiBA,EAAE,CAAC,4BAA4B,KAAK,IAAI,CAAC,SAASvjE,EAAQT,EAAOD,GwHj1jBjEC,EAAAD,QAAA,CACA8oE,sBAAA,EACAC,sBAAA,QAEAC,2BAAA,GAEAC,SAAA,CAAA,UAAA,WAAA,QAAA,QAAA,MAAA,OAAA,OAAA,SAAA,YAAA,UAAA,WAAA,YAEAC,WAAA,CAAA,SAAA,SAAA,UAAA,YAAA,WAAA,SAAA,YAEAC,SACA,CACA,MAAA,SAAA,SAAA,QAAA,OAAA,SAAA,SAAA,OAAA,SAAA,YAAA,OACA,OAAA,SAAA,OAAA,QAAA,OAAA,QAAA,QAAA,QAAA,MAAA,QACA,OAAA,QAAA,SAAA,YAGAC,WACA,CACA,QAAA,UAAA,WAAA,QAAA,QAAA,SAAA,QAAA,SAAA,YAAA,SACA,WAAA,WAAA,SAAA,SAAA,YAAA,QAAA,SAAA,UAAA,WAAA,QACA,QAAA,MAAA,WAAA,SAAA,QAAA,QAAA,WAAA,SAAA,QAAA,OACA,QAAA,QAAA,UAAA,SAAA,OAAA,QAAA,QAAA,QAAA,QAAA,SACA,OAAA,UAAA,WAAA,WAAA,UAAA,SAAA,WAAA,QAAA,SAAA,SACA,SAAA,UAAA,UAAA,UAAA,SAAA,SAAA,SAAA,SAAA,SAAA,OACA,SAAA,SAAA,WAAA,SAAA,OAAA,SAAA,OAAA,QAAA,QAAA,SACA,OAAA,MAAA,OAAA,aAAA,OAAA,SAAA,SAAA,UAAA,OAAA,QACA,QAAA,OAAA,SAAA,QAAA,QAAA,OAAA,SAAA,UAAA,OAAA,UACA,SAAA,WAAA,UAAA,QAAA,UAAA,YAAA,QAAA,SAAA,SAAA,UAGAC,QACA,CACA,OAAA,WAAA,WAAA,QAAA,YAAA,UAAA,QAAA,UAAA,QAAA,QACA,OAAA,QAAA,QAAA,SAAA,WAAA,SAAA,WAAA,QAAA,QAAA,WACA,QAAA,SAAA,UAAA,UAAA,YAAA,UAAA,UAAA,SAAA,QAAA,UACA,MAAA,WAAA,SAAA,UAAA,SAAA,OAAA,OAAA,SAAA,SAAA,WACA,YAAA,YAAA,QAAA,QAAA,SAAA,UAAA,QAAA,QAAA,YAAA,UACA,QAAA,SAAA,QAAA,QAAA,WAAA,OAAA,WAAA,SAAA,QAAA,YACA,OAAA,SAAA,SAAA,SAAA,SAAA,QAAA,SAAA,aAAA,SAAA,UACA,SAAA,SAAA,OAAA,SAAA,MAAA,UAAA,UAAA,SAAA,UAAA,OACA,QAAA,OAAA,WAAA,QAAA,QAAA,QAAA,SAAA,WAAA,UAAA,UACA,YAAA,UAAA,UAAA,QAAA,WAAA,QAAA,QAAA,SAAA,OAAA,QACA,QAAA,SAAA,OAAA,UAAA,QAAA,UAAA,UAAA,SAAA,SAAA,cACA,UAAA,SAAA,UAAA,UAAA,OAAA,SAAA,SAAA,SAAA,OAAA,SACA,UAAA,QAAA,QAAA,SAAA,UAAA,SAAA,QAAA,SAAA,UAAA,OACA,QAAA,OAAA,WAAA,OAAA,WAAA,UAAA,QAAA,SAAA,QAAA,UACA,WAAA,SAAA,UAAA,YAAA,UAAA,QAAA,UAAA,OAAA,SAAA,QACA,QAAA,QAAA,OAAA,OAAA,SAAA,QAAA,UAAA,UAAA,QAAA,OACA,OAAA,QAAA,SAAA,SAAA,YAAA,QAAA,QAAA,QAAA,SAAA,OACA,SAAA,OAAA,SAAA,QAAA,SAAA,WAAA,SAAA,QAAA,QAAA,QACA,QAAA,UAAA,MAAA,QAAA,OAAA,OAAA,SAAA,SAAA,SAAA,QACA,QAAA,UAAA,QAAA,MAAA,QAAA,QAAA,UAAA,UAAA,SAAA,UxHq1jBA,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS3oE,EAAQT,EAAOD,GyHz4jBnC,IAEAspE,EAAA,SAAAC,GAAAlrE,UAAAirE,EAAAC,GAAA,IAAAC,EAAA3qE,aAAAyqE,GAEA,SAAAA,EAAA7yD,EAAAsa,EAAApa,GACA,IAAA8yD,EAKA,OALAxsE,iBAAAJ,KAAAysE,IACAG,EAAAD,EAAAhvE,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAEAE,YAAA,iBAEA4yD,EAAAC,YAAAhpE,EAAA,qDAAA+oE,CACA,CAmDA,OAjDAlsE,cAAA+rE,EAAA,CAAA,CAAA7tE,IAAA,uBAAAC,MACA,SAAAiuE,EAAAC,GAEA,OAAA3mE,KAAAmY,MAAAnY,KAAAgnB,UAAA2/C,EAAAD,IAAAA,CACA,GACA,CAAAluE,IAAA,oBAAAC,MACA,SAAAkuE,GAEA,OAAA/sE,KAAAgtE,qBAAA,EAAAD,EACA,GACA,CAAAnuE,IAAA,gBAAAC,MACA,WAEA,OAAAuH,KAAAmY,MAAAnY,KAAAgnB,SAAAptB,KAAA6sE,YAAAX,sBACA,GAAA,CAAAttE,IAAA,sBAAAC,MAGA,SAAAouE,EAAAC,GAEA,IAAAC,OAAA,IAAAF,EAAA,GAAAA,EACAG,OAAA,IAAAF,EAAA9mE,KAAAsG,IAAA,GAAAygE,GAAA,EAAAD,EAEA,OAAAltE,KAAAy0B,SAAA2yC,WAAAiD,eAAArqE,KAAAqtE,kBAAAD,GAAAH,EAAA,IACA,GAAA,CAAAruE,IAAA,cAAAC,MAGA,WAEA,OAAAmB,KAAA6sE,YAAAT,SAAApsE,KAAAqtE,kBAAArtE,KAAA6sE,YAAAT,SAAA7tE,OAAA,GACA,GAAA,CAAAK,IAAA,kBAAAC,MACA,WAEA,OAAAmB,KAAA6sE,YAAAR,WAAArsE,KAAAqtE,kBAAArtE,KAAA6sE,YAAAR,WAAA9tE,OAAA,GACA,GAAA,CAAAK,IAAA,cAAAC,MAGA,WAEA,OAAAmB,KAAA6sE,YAAAP,SAAAtsE,KAAAqtE,kBAAArtE,KAAA6sE,YAAAP,SAAA/tE,OAAA,GACA,GAAA,CAAAK,IAAA,aAAAC,MAGA,WAEA,OAAAmB,KAAA6sE,YAAAL,QAAAxsE,KAAAqtE,kBAAArtE,KAAA6sE,YAAAL,QAAAjuE,OAAA,GACA,GAAA,CAAAK,IAAA,gBAAAC,MACA,WAEA,OAAAmB,KAAA6sE,YAAAN,WAAAvsE,KAAAqtE,kBAAArtE,KAAA6sE,YAAAN,WAAAhuE,OAAA,GACA,KAAAkuE,CAAA,CA5DA,CAFA5oE,EAAA,8BAAAw/D,qBAiEAjgE,EAAAD,QAAAspE,CzH24jBA,EAAE,CAAC,6BAA6B,IAAI,oDAAoD,MAAM,IAAI,CAAC,SAAS5oE,EAAQT,EAAOD,G0H58jB3H,IAMAmqE,EAAA,SAAAC,GAAA/rE,UAAA8rE,EAAAC,GAAA,IAAAC,EAAAxrE,aAAAsrE,GAEA,SAAAA,EAAA1zD,EAAAsa,EAAApa,GACA,IAAA2zD,EAgCA,OAhCArtE,iBAAAJ,KAAAstE,IACAG,EAAAD,EAAA7vE,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAEAE,YAAA,QAEAyzD,EAAAC,MAAA7pE,EAAA,SAGA4pE,EAAAE,kBAAA9pE,EAAA,2BACA4pE,EAAAC,MAAA1pD,OAAAypD,EAAAE,mBAEAF,EAAAG,eAAA/pE,EAAA,wBACA4pE,EAAAC,MAAA1pD,OAAAypD,EAAAG,gBAEAH,EAAAI,eAAAhqE,EAAA,wBACA4pE,EAAAC,MAAA1pD,OAAAypD,EAAAI,gBAEAJ,EAAAK,gBAAAjqE,EAAA,yBACA4pE,EAAAC,MAAA1pD,OAAAypD,EAAAK,iBAEAL,EAAAM,oBAAAlqE,EAAA,6BACA4pE,EAAAC,MAAA1pD,OAAAypD,EAAAM,qBAEAN,EAAAO,WAAAnqE,EAAA,oBACA4pE,EAAAC,MAAA1pD,OAAAypD,EAAAO,YAEAP,EAAAQ,sBAAApqE,EAAA,+BACA4pE,EAAAC,MAAA1pD,OAAAypD,EAAAQ,uBAKAR,CACA,CAAA,OAAA/sE,cAAA4sE,EAAA,CApCA,CANAzpE,EAAA,8BA6CAT,EAAAD,QAAAmqE,C1H88jBA,EAAE,CAAChpD,MAAQ,GAAG,8BAA8B,GAAG,uBAAuB,GAAG,4BAA4B,GAAG,wBAAwB,GAAG,mBAAmB,GAAG,0BAA0B,GAAG,uBAAuB,GAAG,4BAA4B,KAAK,IAAI,CAAC,SAASzgB,EAAQT,EAAOD,G2H3/jB9Q,IAEA+qE,EAAA,SAAAC,GAAA3sE,UAAA0sE,EAAAC,GAAA,IAAAC,EAAApsE,aAAAksE,GAEA,SAAAA,EAAAt0D,EAAAsa,EAAApa,GACA,IAAAu0D,EAKA,OALAjuE,iBAAAJ,KAAAkuE,IACAG,EAAAD,EAAAzwE,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAEAE,YAAA,kBAEAq0D,EAAAC,YAAA,UAAAD,CACA,CAAA,OAAA3tE,cAAAwtE,EAAA,CATA,CAFArqE,EAAA,8BAAAw/D,qBAcAjgE,EAAAD,QAAA+qE,C3H6/jBA,EAAE,CAAC,6BAA6B,MAAM,IAAI,CAAC,SAASrqE,EAAQT,EAAOD,IACnE,SAAWyxB,IAAS,W4H5gkBpB,IAAAmtC,EAAAl+D,EAAA,8BAAAw/D,oBAEAh0C,EAAAxrB,EAAA,MACAyrB,EAAAzrB,EAAA,QACA0qE,EAAA1qE,EAAA,YAGA2qE,EAAA,SAAAC,GAAAjtE,UAAAgtE,EAAAC,GAAA,IAAAC,EAAA1sE,aAAAwsE,GAEA,SAAAA,EAAA50D,EAAAsa,EAAApa,GACA,IAAA60D,EAYA,OAZAvuE,iBAAAJ,KAAAwuE,IACAG,EAAAD,EAAA/wE,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAEAE,YAAA,kBAEA20D,EAAAhxD,QAAAzd,eAAA,UAEAyuE,EAAAhxD,QAAAixD,KAAAv8D,SAAA,OAAA,IAAAuiB,EAAAyiB,SAGAs3B,EAAAt/C,MAAAA,EACAs/C,EAAAr/C,QAAAA,EACAq/C,EAAAJ,YAAAA,EAAAI,CACA,CA2LA,OA3LAjuE,cAAA8tE,EAAA,CAAA,CAAA5vE,IAAA,WAAAC,MAEA,WAEA,OAAAywB,EAAA3G,QAAA5oB,MAAAuvB,EAAAxvB,UACA,GAAA,CAAAlB,IAAA,aAAAC,MAEA,SAAAgwE,GAEA,OAAAx/C,EAAAy/C,WAAAD,EACA,GAAA,CAAAjwE,IAAA,SAAAC,MAEA,SAAAgwE,EAAAxJ,GAIA,OAAAA,EAAA,KAFArlE,KAAA8uE,WAAAD,GAGA,GAAA,CAAAjwE,IAAA,gBAAAC,MAEA,SAAAkwE,EAAAC,EAAA96C,GAEA,IAAA+6C,OAAA,IAAA/6C,EAAA,OAAAA,EACA,OAAA7E,EAAA6/C,cAAAH,EAAAC,EAAAC,EACA,GAAA,CAAArwE,IAAA,iBAAAC,MAEA,SAAAkwE,EAAAI,EAAAj7C,GAEA,IAAA+6C,OAAA,IAAA/6C,EAAA,OAAAA,EACA,OAAA7E,EAAA+/C,eAAAL,EAAAI,EAAAF,EACA,GAAA,CAAArwE,IAAA,iBAAAC,MAEA,SAAAkwE,GAEA,OAAA1/C,EAAAggD,WAAAN,EACA,GAAA,CAAAnwE,IAAA,mBAAAC,MAEA,SAAAkwE,GAEA,OAAA1/C,EAAAigD,UAAAP,EACA,GAAA,CAAAnwE,IAAA,0BAAAC,MAEA,SAAAkwE,EAAAhgD,GAEA,OAAA/uB,KAAAkvE,cAAAH,EAAA5/C,KAAArlB,UAAAilB,EAAA,KAAA,GACA,GAAA,CAAAnwB,IAAA,yBAAAC,MAEA,SAAAkwE,EAAAQ,GAEA,IAAAxxE,MAAAM,QAAAkxE,GAGA,OADAvvE,KAAAkvB,IAAA7a,MAAA,+CAAAxN,OAAAkoE,EAAA,kEAAAloE,OAAA9F,QAAAwuE,GAAA,OACAvrE,MAAA,wHAIA,IAAA,IAAAxF,EAAA,EAAAA,EAAA+wE,EAAAhxE,OAAAC,IAEA,OAAAwB,KAAAovE,eAAAL,EAAA,GAAAloE,OAAA0oE,EAAA/wE,GAAA,MAGA,GAAA,CAAAI,IAAA,oBAAAC,MAEA,SAAA2wE,EAAAC,EAAAC,EAAAC,GAEA,IAAAC,EAAA,CAAA,EAEA,MAAA,iBAAAJ,IAKAI,EAAAC,SAAAL,EAEAI,EAAAE,WAAAzgD,EAAA0gD,iBAAAH,EAAAC,UAEAD,EAAAtlB,OAAAikB,EAAAyB,gBAAA,CAAA/uE,MAAA2uE,EAAAE,WAAAG,UAAAh3D,MAEA,mBAAA02D,GAEAC,EAAAtlB,OAAAnhC,GAAA,QAAAwmD,GAGAC,EAAAtlB,OAAAnhC,GAAA,OAAA,mBAAAsmD,EAAAA,EAAA,WAAA,GAEA,mBAAAC,GAEAE,EAAAtlB,OAAAnhC,GAAA,QAAAumD,GAGAE,EACA,GAEA,CAAAhxE,IAAA,sBAAAC,MACA,SAAAqxE,EAAA7K,GACA,IAAA8K,EAAAnwE,KACAowE,EAAAF,EAEA,GAAA,iBAAAA,EAEAE,EAAA,CAAAC,KAAAH,QAEA,GAAA,WAAAnvE,QAAAmvE,GAGA,OADA7K,EAAA,IAAArhE,MAAA,iFACA,EAGA,MAAA,iBAAAosE,EAAAC,MAEAhL,EAAA,IAAArhE,MAAA,wEACA,IAGAosE,EAAAlwE,eAAA,UAEAkwE,EAAAxB,KAAA5uE,KAAA2d,QAAAixD,WAIA,IAAAwB,EAAAE,kBAGAF,EAAAG,WAAAjhD,EAAAO,UAAAugD,EAAAC,MACAD,EAAAI,gBAAAJ,EAAAG,WAAAp3D,MAAAmW,EAAA2jB,KACAm9B,EAAAE,iBAAA,EACAF,EAAAK,YAAA,KAMAL,EAAAK,aAAAnhD,EAAA2jB,IAEAm9B,EAAAK,YAAAL,EAAAK,YAAAL,EAAAI,gBAAAJ,EAAAE,kBAIAF,EAAAK,YAAAL,EAAAK,YAAAnhD,EAAA2jB,IAAAm9B,EAAAI,gBAAAJ,EAAAE,kBAIAF,EAAAE,oBAIAF,EAAAE,kBAAAF,EAAAI,gBAAAjyE,OAEA8mE,EAAA,WAIAh2C,EAAA21B,KAAAorB,EAAAK,YAAAnhD,EAAA2jB,IAAAm9B,EAAAI,gBAAAJ,EAAAE,kBAAA,KACA,SAAA1zD,EAAA8zD,GAOA,GALAA,GAEArhD,EAAAshD,UAAAD,IAGA9zD,GAAA,UAAAA,EAAA3Y,KAyBA,OAAAksE,EAAAS,oBAAAR,EAAA/K,GAtBAh2C,EAAAwhD,MAAAT,EAAAK,YAAAnhD,EAAA2jB,IAAAm9B,EAAAI,gBAAAJ,EAAAE,kBAAAF,EAAAxB,MACA,SAAAkC,GAEA,OAAAA,EAKA,UAAAA,EAAA7sE,KAGAksE,EAAAS,oBAAAR,EAAA/K,IAIAjxD,QAAA8a,IAAA4hD,EAAA7sE,MACAohE,EAAAyL,IAVAX,EAAAS,oBAAAR,EAAA/K,EAYA,GAMA,IACA,KAAAmJ,CAAA,CA3MA,CAAAzM,GA8MA3+D,EAAAD,QAAAqrE,C5H8gkBC,GAAE7wE,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,YAElC,EAAE,CAAC,6BAA6B,IAAI6xB,SAAW,GAAG1E,GAAK,GAAGvS,KAAO,GAAGsyD,SAAW,KAAK,IAAI,CAAC,SAASltE,EAAQT,EAAOD,G6HrukBjH,IAAA4+D,EAAAl+D,EAAA,8BAAAw/D,oBAOA/vB,EAAAzvC,EAAA,yDACA0vC,EAAA1vC,EAAA,6DAGAmtE,EAAA,SAAAC,GAAAzvE,UAAAwvE,EAAAC,GAAA,IAAAC,EAAAlvE,aAAAgvE,GAEA,SAAAA,EAAAp3D,EAAAsa,EAAApa,GACA,IAAAq3D,EAUA,OAVA/wE,iBAAAJ,KAAAgxE,IACAG,EAAAD,EAAAvzE,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAEAE,YAAA,eAEAm3D,EAAA19B,SAAA,IAAAH,EAGA69B,EAAAz9B,aAAA,IAAAH,EAAA49B,EAAAh9C,MAAAM,SAAAm1C,QAAAwH,WAEAD,EAAAx9B,UAAAw9B,EAAA19B,SAAAE,UAAAw9B,CACA,CA+BA,OA5BAzwE,cAAAswE,EAAA,CAAA,CAAApyE,IAAA,aAAAC,MAQA,SAAA+0C,EAAAC,EAAAC,GAEA,OAAA9zC,KAAAyzC,SAAAxe,WAAA2e,EAAAC,EAAAC,EACA,GAAA,CAAAl1C,IAAA,kBAAAC,MAEA,SAAA+0C,EAAAC,EAAAw9B,GAEA,OAAArxE,KAAAyzC,SAAA69B,gBAAA19B,EAAAC,EAAAw9B,EACA,GAEA,CAAAzyE,IAAA,cAAAC,MAOA,SAAA22B,EAAAlb,EAAA+qD,GAEA,OAAArlE,KAAA0zC,aAAAje,YAAAD,EAAAx1B,KAAA2zC,UAAAr5B,EAAA+qD,EACA,KAAA2L,CAAA,CA7CA,CAAAjP,GAgDA3+D,EAAAD,QAAA6tE,C7HuukBA,EAAE,CAAC,6BAA6B,IAAI,4DAA4D,IAAI,wDAAwD,MAAM,IAAI,CAAC,SAASntE,EAAQT,EAAOD,G8HlykB/L,IAMAuwC,EAAA,WAKA,SAAAA,EAAA69B,GACAnxE,iBAAAJ,KAAA0zC,GACA1zC,KAAAoxE,UAAAG,CACA,CAqWA,OAnWA7wE,cAAAgzC,EAAA,CAAA,CAAA90C,IAAA,iBAAAC,MAOA,SAAAk1C,GAEA,MACA,CACAJ,UAAAI,EAEAC,cAAA,EAEAC,OAAA,GACAC,aAAA,GAEAC,QAAA,CAAA,EAEAC,cAAA,EACAC,iBAAA,EAEA,GAEA,CAAAz1C,IAAA,qBAAAC,MAQA,SAAAquB,EAAAonB,GAEAA,EAAAJ,cAAAhnB,CACA,GAEA,CAAAtuB,IAAA,oBAAAC,MAMA,SAAAy1C,GAEAA,EAAAL,QAAAK,EAAAJ,aACAI,EAAAJ,aAAA,EACA,GAAA,CAAAt1C,IAAA,oBAAAC,MAEA,SAAAy1C,GAWA,OARAt0C,KAAAu0C,kBAAAD,GAEAA,EAAAH,SAAA,EACAG,EAAAE,kBAAA,EACAF,EAAAG,2BAAA,EACAH,EAAAI,sBAAA,EACAJ,EAAAF,cAAA,GAEA,CACA,GAEA,CAAAx1C,IAAA,iBAAAC,MAOA,SAAAquB,EAAAonB,EAAAh6B,GAGA,GAAAg6B,EAAAF,aAGA,IAAAE,EAAAG,2BAAAH,EAAAH,QAAAj0C,eAAAgtB,GAEAonB,EAAAH,QAAAG,EAAAH,QAAAjnB,GACAltB,KAAA20C,mBAAAznB,EAAAonB,QAEA,GAAAA,EAAAI,qBAEA,GAAAJ,EAAAH,QAAAS,WAAA10C,eAAAgtB,IAOA,GAJAonB,EAAAH,QAAAG,EAAAH,QAAAS,WAAA1nB,GAEAltB,KAAA20C,mBAAAznB,EAAAonB,GAEAA,EAAAH,QAAAj0C,eAAA,SAIA,OADAo0C,EAAAJ,aAAAI,EAAAH,QAAAU,MAAAP,EAAAJ,aAAA5hC,OAAAgiC,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAJ,aAAA31C,QAAA+1C,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAH,QAAAY,iBAAAx2C,SAAA+b,GACAta,KAAAg1C,kBAAAV,QAGAA,EAAAE,iBAAAI,WAAA10C,eAAAgtB,IAGAonB,EAAAH,QAAAG,EAAAE,iBAAAI,WAAA1nB,GACAltB,KAAA20C,mBAAAznB,EAAAonB,KAIAA,EAAAI,sBAAA,EACA10C,KAAA20C,mBAAAznB,EAAAonB,SAGA,GAAAA,EAAAH,QAAAj0C,eAAA,eAUA,GARAo0C,EAAAG,4BAEAH,EAAAG,2BAAA,EACAH,EAAAE,iBAAAF,EAAAH,SAGAn0C,KAAA20C,mBAAAznB,EAAAonB,GAEAA,EAAAH,QAAAS,WAAA10C,eAAAgtB,KAGAonB,EAAAI,sBAAA,EAEAJ,EAAAH,QAAAG,EAAAH,QAAAS,WAAA1nB,GAEAonB,EAAAH,QAAAj0C,eAAA,UACA,CACA,IAAAo0C,EAAAH,QAAAq9B,QASA,OADAl9B,EAAAJ,aAAAI,EAAAH,QAAAU,MAAAP,EAAAJ,aAAA5hC,OAAAgiC,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAJ,aAAA31C,QAAA+1C,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAH,QAAAY,iBAAAx2C,SAAA+b,GACAta,KAAAg1C,kBAAAV,GAPAt0C,KAAAkvB,IAAA7a,MAAA,6BAAAxN,OAAAytC,EAAAH,QAAAW,mBAAA,iEACA90C,KAAAg1C,kBAAAV,EAQA,OAMAt0C,KAAAg1C,kBAAAV,GAIA,IAAAA,EAAAF,aACA,CAEA,GAAAE,EAAAX,UAAAzzC,eAAAgtB,GAOA,OAJAltB,KAAAg1C,kBAAAV,GACAt0C,KAAA20C,mBAAAznB,EAAAonB,GACAA,EAAAH,QAAAG,EAAAX,UAAAzmB,GACAonB,EAAAF,cAAA,GACA,EAIAp0C,KAAA20C,mBAAAznB,EAAAonB,EAEA,CACA,OAAA,CACA,GAEA,CAAA11C,IAAA,sBAAAC,MAOA,SAAAquB,EAAAonB,EAAAh6B,EAAA+qD,GACA,IAAAoM,EAAAzxE,KAEA,GAAAs0C,EAAAF,aAGA,IAAAE,EAAAG,2BAAAH,EAAAH,QAAAj0C,eAAAgtB,GAEAonB,EAAAH,QAAAG,EAAAH,QAAAjnB,GACAltB,KAAA20C,mBAAAznB,EAAAonB,QAEA,GAAAA,EAAAI,qBAEA,GAAAJ,EAAAH,QAAAS,WAAA10C,eAAAgtB,IAOA,GAJAonB,EAAAH,QAAAG,EAAAH,QAAAS,WAAA1nB,GAEAltB,KAAA20C,mBAAAznB,EAAAonB,GAEAA,EAAAH,QAAAj0C,eAAA,SAIA,OAAAo0C,EAAAH,QAAAq9B,QAGAl9B,EAAAH,QAAAU,MAAAP,EAAAJ,aAAA5hC,OAAAgiC,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAJ,aAAA31C,QAAA+1C,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAH,QAAAY,iBAAAx2C,SAAA+b,GACA,SAAAsC,EAAA80D,GASA,OAPA90D,GAEAxI,QAAA8a,IAAA,0DAAAroB,OAAAytC,EAAAH,QAAAw9B,aAAA,SAAA9qE,OAAAytC,EAAAH,QAAAS,WAAA,MAAA/tC,OAAA+V,IAGA03B,EAAAJ,aAAAw9B,EACAD,EAAAz8B,kBAAAV,GACA+wB,GACA,KAKA/wB,EAAAJ,aAAAI,EAAAH,QAAAU,MAAAP,EAAAJ,aAAA5hC,OAAAgiC,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAJ,aAAA31C,QAAA+1C,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAH,QAAAY,iBAAAx2C,SAAA+b,GACAta,KAAAg1C,kBAAAV,GACA+wB,UAIA/wB,EAAAE,iBAAAI,WAAA10C,eAAAgtB,IAGAonB,EAAAH,QAAAG,EAAAE,iBAAAI,WAAA1nB,GACAltB,KAAA20C,mBAAAznB,EAAAonB,KAIAA,EAAAI,sBAAA,EACA10C,KAAA20C,mBAAAznB,EAAAonB,QAGA,KAAAA,EAAAH,QAAAj0C,eAAA,cAmDA,OADAF,KAAAg1C,kBAAAV,GACA+wB,IAzCA,GARA/wB,EAAAG,4BAEAH,EAAAG,2BAAA,EACAH,EAAAE,iBAAAF,EAAAH,SAGAn0C,KAAA20C,mBAAAznB,EAAAonB,GAEAA,EAAAH,QAAAS,WAAA10C,eAAAgtB,KAGAonB,EAAAI,sBAAA,EAEAJ,EAAAH,QAAAG,EAAAH,QAAAS,WAAA1nB,GAEAonB,EAAAH,QAAAj0C,eAAA,UAIA,OAAAo0C,EAAAH,QAAAq9B,QAGAl9B,EAAAH,QAAAU,MAAAP,EAAAJ,aAAA5hC,OAAAgiC,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAJ,aAAA31C,QAAA+1C,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAH,QAAAY,iBAAAx2C,SAAA+b,GACA,SAAAsC,EAAA80D,GASA,OAPA90D,GAEAxI,QAAA8a,IAAA,0DAAAroB,OAAAytC,EAAAH,QAAAw9B,aAAA,SAAA9qE,OAAAytC,EAAAH,QAAAS,WAAA,MAAA/tC,OAAA+V,IAGA03B,EAAAJ,aAAAw9B,EACAD,EAAAz8B,kBAAAV,GACA+wB,GACA,KAKA/wB,EAAAJ,aAAAI,EAAAH,QAAAU,MAAAP,EAAAJ,aAAA5hC,OAAAgiC,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAJ,aAAA31C,QAAA+1C,EAAAH,QAAAW,mBAAAv2C,OAAA+1C,EAAAH,QAAAY,iBAAAx2C,SAAA+b,GACAta,KAAAg1C,kBAAAV,GACA+wB,IAUA,CAmBA,OAhBA/wB,EAAAF,eAGAE,EAAAX,UAAAzzC,eAAAgtB,IAGAltB,KAAAg1C,kBAAAV,GACAt0C,KAAA20C,mBAAAznB,EAAAonB,GACAA,EAAAH,QAAAG,EAAAX,UAAAzmB,GACAonB,EAAAF,cAAA,GAIAp0C,KAAA20C,mBAAAznB,EAAAonB,IAGA+wB,GACA,GAEA,CAAAzmE,IAAA,cAAAC,MAQA,SAAA22B,EAAAue,EAAAz5B,EAAA+qD,GACA,IAAAuM,EAAA5xE,KACA,GAAA,mBAAAqlE,EACA,CAGA,IAFA,IAAApwB,EAAAj1C,KAAAk1C,eAAAnB,GAEAv1C,EAAA,EAAAA,EAAAg3B,EAAAj3B,OAAAC,IAGAwB,KAAAm1C,eAAA3f,EAAAh3B,GAAAy2C,EAAA36B,EAAA+qD,GAKA,OAFArlE,KAAAu0C,kBAAAU,GAEAA,EAAAhB,MACA,CAIA,IAAAgB,EAAAj1C,KAAAk1C,eAAAnB,GACAkB,EAAAjB,cAAA,EAEAh0C,KAAAoxE,UAAA57C,EAAA,GACA,SAAAtI,EAAA2kD,GAEAD,EAAAE,oBAAA5kD,EAAA+nB,EAAA36B,EAAAu3D,EACA,IACA,SAAAj1D,GAGAg1D,EAAAr9B,kBAAAU,GACAowB,EAAAzoD,EAAAq4B,EAAAhB,OACA,GAGA,KAAAP,CAAA,CA7WA,GAgXAtwC,EAAAD,QAAAuwC,C9HqykBA,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS7vC,EAAQT,EAAOD,G+H3plBnC,IAMAswC,EAAA,WAKA,SAAAA,IACArzC,iBAAAJ,KAAAyzC,GACAzzC,KAAA2zC,UAAA,CAAA,CACA,CAsGA,OApGAjzC,cAAA+yC,EAAA,CAAA,CAAA70C,IAAA,WAAAC,MAQA,SAAAu2C,EAAAC,GAOA,OALAD,EAAAl1C,eAAAm1C,KAEAD,EAAAC,GAAA,CAAA,GAGAD,EAAAC,EACA,GAEA,CAAAz2C,IAAA,cAAAC,MAQA,SAAAu2C,EAAAC,GASA,OAPAD,EAAAl1C,eAAA,gBAEAk1C,EAAAR,WAAA,CAAA,GAGAQ,EAAAR,WAAAS,GAAA,CAAA,EAEAD,EAAAR,WAAAS,EACA,GAEA,CAAAz2C,IAAA,aAAAC,MAOA,SAAA+0C,EAAAC,EAAAyB,GAEA,GAAA1B,EAAAr1C,OAAA,EAEA,OAAA,EAGA,GAAA,iBAAAs1C,GAAAA,EAAAt1C,OAAA,EAEA,OAAA,EAMA,IAHA,IAAAg3C,EAAAv1C,KAAA2zC,UAGAn1C,EAAA,EAAAA,EAAAo1C,EAAAr1C,OAAAC,IAEA+2C,EAAAv1C,KAAAw1C,SAAAD,EAAA3B,EAAAp1C,GAAAA,GAGA+2C,EAAAr1C,eAAA,gBAEAq1C,EAAAX,WAAA,CAAA,GAIA,IADA,IAAAa,EAAA,iBAAA5B,EAAAA,EAAAD,EACAp1C,EAAA,EAAAA,EAAAi3C,EAAAl3C,OAAAC,IAEA+2C,EAAAv1C,KAAA01C,YAAAH,EAAAE,EAAAj3C,GAAAA,GASA,OANA+2C,EAAAT,mBAAAlB,EACA2B,EAAAR,iBAAAU,EACAF,EAAAV,MAAA,mBAAAS,EAAAA,EACA,iBAAAA,EAAA,WAAA,OAAAA,CAAA,EACA,SAAAh7B,GAAA,OAAAA,CAAA,EAEAi7B,CACA,GAGA,CAAA32C,IAAA,kBAAAC,MAOA,SAAA+0C,EAAAC,EAAAyB,GAEA,IAAAC,EAAAv1C,KAAAi1B,WAAA2e,EAAAC,EAAAyB,GACAC,IAEAA,EAAAi8B,SAAA,EAEA,KAAA/9B,CAAA,CA9GA,GAiHArwC,EAAAD,QAAAswC,C/H8plBA,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS5vC,EAAQT,EAAOD,GgIrxlBnCC,EAAAD,QACA,CACAwX,SAAA,CACAyZ,MAAA,EACA1Z,MAAA,EAEAq3D,MAAA,GACAC,QAAA,GAEAC,QAAA,GAEAC,OAAA,CACAC,WAAA,EAEAC,mBAAA,EACAC,sBAAA,EAEAC,MAAA,EACAC,eAAA,EAEAC,UAAA,EACAC,QAAA,GAEAnpC,OAAA,GACAopC,IAAA,GhIyxlBA,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS7uE,EAAQT,EAAOD,GiIjzlBnC,IAAA4+D,EAAAl+D,EAAA,8BAAAw/D,oBAEAsP,EAAAxjD,KAAArlB,UAAAjG,EAAA,iDAEA+uE,EAAA,SAAAC,GAAArxE,UAAAoxE,EAAAC,GAAA,IAAAC,EAAA9wE,aAAA4wE,GAGA,SAAAA,EAAAh5D,EAAAsa,EAAApa,GACA,IAAAi5D,EAkBA,OAlBA3yE,iBAAAJ,KAAA4yE,IACAG,EAAAD,EAAAn1E,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAGAk5D,WAAA,CAAA,EAEAD,EAAAE,iBAAA,CAAA,EAEAF,EAAA/4D,YAAA,kBAEA+4D,EAAApoD,MAAAwE,KAAAthB,MAAA8kE,GAGAI,EAAApoD,MAAAhQ,SAAAD,KAAAq4D,EAAAr4D,KACAq4D,EAAApoD,MAAAhQ,SAAAyZ,KAAA2+C,EAAA3+C,KAEA2+C,EAAAj1E,KAAA,iBAAAi1E,EAAAp1D,QAAAmmB,KAAAivC,EAAAp1D,QAAAmmB,KAAA,qBAAAj9B,OAAAksE,EAAApoD,MAAAhQ,SAAAyZ,MAEA2+C,EAAA7jD,IAAAxsB,uBAAAqwE,GAAAA,CACA,CAoPA,OApPAryE,cAAAkyE,EAAA,CAAA,CAAAh0E,IAAA,oBAAAC,MAEA,SAAA0uB,EAAAF,EAAAC,GAEAttB,KAAA2qB,MAAA+nD,IAAAhtE,KAAA,GAAAmB,QAAA,IAAAgU,MAAAgE,cAAA,MAAAhY,OAAA0mB,EAAA,OAAA1mB,OAAAwmB,IAEA,UAAAtsB,QAAAusB,IAEAttB,KAAA2qB,MAAA+nD,IAAAhtE,KAAAypB,KAAArlB,UAAAwjB,GAEA,GAAA,CAAA1uB,IAAA,uBAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAA2qB,MAAA2e,OAAA5jC,KAAA,GAAAmB,OAAAwmB,IAEA,UAAAtsB,QAAAusB,IAEAttB,KAAA2qB,MAAA2e,OAAA5jC,KAAAypB,KAAArlB,UAAAwjB,GAEA,GAAA,CAAA1uB,IAAA,QAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAkzE,kBAAA,QAAA7lD,EAAAC,GACAttB,KAAAm0B,MAAAjF,IAAAuD,MAAApF,EAAAC,EACA,GAAA,CAAA1uB,IAAA,QAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAkzE,kBAAA,QAAA7lD,EAAAC,GACAttB,KAAAm0B,MAAAjF,IAAAwD,MAAArF,EAAAC,EACA,GAAA,CAAA1uB,IAAA,OAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAkzE,kBAAA,OAAA7lD,EAAAC,GACAttB,KAAAm0B,MAAAjF,IAAAyD,KAAAtF,EAAAC,EACA,GAAA,CAAA1uB,IAAA,OAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAkzE,kBAAA,OAAA7lD,EAAAC,GACAttB,KAAAm0B,MAAAjF,IAAA5E,KAAA+C,EAAAC,EACA,GAAA,CAAA1uB,IAAA,QAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAkzE,kBAAA,QAAA7lD,EAAAC,GACAttB,KAAAmzE,qBAAA9lD,EAAAC,GACAttB,KAAAm0B,MAAAjF,IAAA7a,MAAAgZ,EAAAC,EACA,GAAA,CAAA1uB,IAAA,QAAAC,MAEA,SAAAwuB,EAAAC,GAEAttB,KAAAkzE,kBAAA,QAAA7lD,EAAAC,GACAttB,KAAAmzE,qBAAA9lD,EAAAC,GACAttB,KAAAm0B,MAAAjF,IAAA0D,MAAAvF,EAAAC,EACA,GAEA,CAAA1uB,IAAA,kBAAAC,MAGA,SAAAu0E,GAEA,IAAAC,EAAA,iBAAAD,EAAAA,EAAA,UAEA,OADApzE,KAAAgzE,WAAAK,IAAA,IAAAx4D,KACA7a,KAAAgzE,WAAAK,EACA,GAAA,CAAAz0E,IAAA,eAAAC,MAEA,SAAAu0E,GAEA,IAAAC,EAAA,iBAAAD,EAAAA,EAAA,UACA,OAAApzE,KAAAgzE,WAAA9yE,eAAAmzE,IAEA,IAAAx4D,KACA7a,KAAAgzE,WAAAK,IAIA,CAEA,GAAA,CAAAz0E,IAAA,eAAAC,MAEA,SAAAu0E,EAAA7gD,GAEA,IACAU,OAAA,IAAAV,EAAAA,EAAA,eAAA1rB,OADA,iBAAAusE,EAAAA,EAAA,UACA,MACAE,EAAAtzE,KAAA4zB,aAAAw/C,GAEA,OADApzE,KAAA2yB,KAAAM,EAAA,KAAAqgD,EAAA,OACAA,CACA,GAAA,CAAA10E,IAAA,wBAAAC,MAEA,SAAA00E,EAAAC,GAEA,IAAAC,EAAA,iBAAAD,EAAAA,EAAA,yBACAE,EAAA,iBAAAH,EAAAA,EAAA,IAEAI,EACA,CACAj5D,KAAA+4D,EACAjB,UAAAxyE,KAAA4zE,gBAAAH,GACAhB,QAAA,EACAoB,YAAA,EACAC,iBAAA,EACAC,sBAAA,EACAC,yBAAA,EACAC,WAAAP,EACAQ,cAAA,GAKA,OAFAl0E,KAAAizE,iBAAAQ,GAAAE,EAEAA,CACA,GAAA,CAAA/0E,IAAA,6BAAAC,MAEA,SAAA20E,GAEA,IAAAC,EAAA,iBAAAD,EAAAA,EAAA,yBAEAxzE,KAAAizE,iBAAA/yE,eAAAuzE,IAEAzzE,KAAAm0E,sBAAA,IAAAV,GAGA,IAAAE,EAAA3zE,KAAAizE,iBAAAQ,GAEAE,EAAAE,YAAA7zE,KAAA4zB,aAAA+/C,EAAAj5D,MAEAi5D,EAAAO,aAAA,GAAAP,EAAAM,WAAA,IAEAN,EAAAG,gBAAAH,EAAAO,aAAAP,EAAAM,WAAA,KAGAN,EAAAO,aAAA,GAAAP,EAAAE,YAAA,IAEAF,EAAAI,qBAAAJ,EAAAE,YAAAF,EAAAO,cAGAP,EAAAO,aAAAP,EAAAM,YAAAN,EAAAI,qBAAA,IAEAJ,EAAAK,yBAAAL,EAAAM,WAAAN,EAAAO,cAAAP,EAAAI,qBAEA,GAAA,CAAAn1E,IAAA,8BAAAC,MAEA,SAAA20E,EAAAY,GAEA,IAAAX,EAAA,iBAAAD,EAAAA,EAAA,yBACAa,EAAAhiE,SAAA+hE,GAEA,OAAA91D,MAAA+1D,KAKAr0E,KAAAizE,iBAAA/yE,eAAAuzE,IAEAzzE,KAAAm0E,sBAAA,IAAAV,GAGAzzE,KAAAizE,iBAAAQ,GAAAS,aAAAG,EACAr0E,KAAAizE,iBAAAQ,GAAAI,YAAA7zE,KAAA4zB,aAAA6/C,GAEAzzE,KAAAs0E,2BAAAb,GAEAzzE,KAAAizE,iBAAAQ,GACA,GAAA,CAAA70E,IAAA,iCAAAC,MAEA,SAAA20E,EAAAe,GAEA,IAAAd,EAAA,iBAAAD,EAAAA,EAAA,yBACAgB,EAAAniE,SAAAkiE,GAEA,OAAAj2D,MAAAk2D,KAKAx0E,KAAAizE,iBAAA/yE,eAAAuzE,IAEAzzE,KAAAm0E,sBAAA,IAAAV,GAGAzzE,KAAAizE,iBAAAQ,GAAAS,aAAAl0E,KAAAizE,iBAAAQ,GAAAS,aAAAM,EACAx0E,KAAAizE,iBAAAQ,GAAAI,YAAA7zE,KAAA4zB,aAAA6/C,GAEAzzE,KAAAs0E,2BAAAb,GAEAzzE,KAAAizE,iBAAAQ,GACA,GAAA,CAAA70E,IAAA,4BAAAC,MAEA,SAAA20E,EAAAY,GAEA,IAAAX,EAAA,iBAAAD,EAAAA,EAAA,yBACAa,EAAAhiE,SAAA+hE,GAEA,QAAAp0E,KAAAizE,iBAAA/yE,eAAAuzE,KAIAn1D,MAAA+1D,IAEAr0E,KAAAy0E,4BAAAhB,EAAAY,GAGAr0E,KAAAizE,iBAAAQ,GAAAhB,QAAAzyE,KAAA4zB,aAAA6/C,GAEAzzE,KAAAs0E,2BAAAb,GAEAzzE,KAAAizE,iBAAAQ,GACA,GAAA,CAAA70E,IAAA,6BAAAC,MAEA,SAAA20E,GAEA,IAAAC,EAAA,iBAAAD,EAAAA,EAAA,yBAEA,GAAAxzE,KAAAizE,iBAAA/yE,eAAAuzE,GAKA,CACA,IAAAE,EAAA3zE,KAAAizE,iBAAAQ,GAEAE,EAAAO,aAAA,EAEAl0E,KAAA2yB,KAAA,uBAAA9rB,OAAA8sE,EAAAj5D,KAAA,mCAAA7T,OAAA8sE,EAAAE,YAAA,0CAEAF,EAAAlB,QAAA,EAEAzyE,KAAA2yB,KAAA,uBAAA9rB,OAAA8sE,EAAAj5D,KAAA,QAAA7T,OAAA8sE,EAAAG,gBAAA7mE,QAAA,GAAA,kBAAApG,OAAA8sE,EAAAO,aAAA,OAAArtE,OAAA8sE,EAAAM,WAAA,qBAAAptE,OAAA8sE,EAAAE,YAAA,eAAAhtE,OAAA8sE,EAAAI,qBAAA9mE,QAAA,GAAA,oCAAApG,OAAA8sE,EAAAK,wBAAA/mE,QAAA,GAAA,UAAApG,QAAA8sE,EAAAK,wBAAA,IAAA,IAAA/mE,QAAA,GAAA,YAIAjN,KAAA2yB,KAAA,uBAAA9rB,OAAA8sE,EAAAj5D,KAAA,2BAAA7T,OAAA8sE,EAAAO,aAAA,OAAArtE,OAAA8sE,EAAAM,WAAA,mBAAAptE,OAAA8sE,EAAAlB,QAAA,OAEA,MAlBAzyE,KAAA2yB,KAAA,uBAAA9rB,OAAA4sE,EAAA,0CAmBA,KAOAb,CAAA,CA3QA,CAAA7Q,GAgRA3+D,EAAAD,QAAAyvE,CjImzlBA,EAAE,CAAC,6BAA6B,IAAI,+CAA+C,MAAM,IAAI,CAAC,SAAS/uE,EAAQT,EAAOD,IACtH,SAAWgL,IAAQ,WkIxkmBnB,IAAA4zD,EAAAl+D,EAAA,8BAAAw/D,oBAEAqR,EAAA7wE,EAAA,cACA8wE,EAAA9wE,EAAA,UAEA+wE,EAAA,SAAAC,GAAArzE,UAAAozE,EAAAC,GAAA,IAAAC,EAAA9yE,aAAA4yE,GAEA,SAAAA,EAAAh7D,EAAAsa,EAAApa,GACA,IAAAi7D,EAiBA,OAjBA30E,iBAAAJ,KAAA40E,IACAG,EAAAD,EAAAn3E,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAEAk7D,UAAA,GACAD,EAAAp3D,QAAAq3D,UAAAD,EAAA5gD,MAAA6gD,YAEAD,EAAAC,UAAA,GAGAD,EAAAE,WAAAF,EAAA5gD,MAAAM,SAAA2yC,WAEA2N,EAAA/6D,YAAA,aAEA+6D,EAAAjxB,QAAA,EAIAixB,EAAAG,sBAAA,SAAAhhD,GAAA,OAAAA,CAAA,EAAA6gD,CACA,CA6RA,OA7RAr0E,cAAAk0E,EAAA,CAAA,CAAAh2E,IAAA,YAAAS,IAEA,WAEA,OAAAq1E,CACA,GAAA,CAAA91E,IAAA,iBAAAC,MAEA,SAAAs2E,GAEA,GAAAn1E,KAAA8jD,OACA,CACA,IAAAsxB,EAAAp1E,KAAA8jD,OACAqxB,EAAAj1E,eAAA,aAEAi1E,EAAAlyB,QAAA,CAAA,GAEA,IAAAoyB,EAAA73E,OAAAwI,KAAAovE,GACAC,EAAA92E,OAAA,IAGA42E,EAAAlyB,QAAAa,OAAA6wB,EAAA12D,UAAAo3D,EAAA,GAAAD,EAAAC,EAAA,KAEA,CACA,OAAAF,CACA,GAAA,CAAAv2E,IAAA,aAAAC,MAEA,SAAAq1B,GAGA,IAAA+6C,EAAAjvE,KAAAs1E,eAAAphD,GACA,OAAAl0B,KAAAk1E,sBAAAjG,EACA,GAAA,CAAArwE,IAAA,wBAAAC,MAEA,SAAAq1B,EAAAmxC,GACA,IAAAkQ,EAAAv1E,KACAivE,EAAAjvE,KAAAw1E,WAAAthD,GASA,OAPA+6C,EAAAwG,iBAAAz1E,KAAAm0B,MAAAjF,IAAAwmD,eAEA11E,KAAAg1E,UAEAh1E,KAAAm0B,MAAAjF,IAAAwD,MAAA,aAAA7rB,OAAAooE,EAAA7rB,OAAA,gBAAAv8C,OAAAooE,EAAAtwC,IAAA,QAAA93B,OAAAooE,EAAAwG,mBAGAf,EAAAzF,GACA,SAAAryD,EAAA+4D,GAEA,GAAA/4D,EAEA,OAAAyoD,EAAAzoD,EAAA+4D,GAGA,GAAAJ,EAAAP,SACA,CACA,IAAAY,EAAAL,EAAAphD,MAAAjF,IAAAwmD,eACAH,EAAAphD,MAAAjF,IAAAwD,MAAA,UAAA7rB,OAAAooE,EAAA7rB,OAAA,kBAAAv8C,OAAA0uE,EAAAN,WAAAY,gBAAA5G,EAAAwG,iBAAAG,GAAA,YAAA/uE,OAAA8uE,EAAAlyB,YACA,CAEA,IAAAqyB,EAAA,GAEAH,EAAAxsD,GAAA,QAAA,SAAA4sD,GAGA,GAAAR,EAAAP,SACA,CACA,IAAAgB,EAAAT,EAAAphD,MAAAjF,IAAAwmD,eACAH,EAAAphD,MAAAjF,IAAAwD,MAAA,UAAA7rB,OAAAooE,EAAA7rB,OAAA,qBAAAv8C,OAAAkvE,EAAAx3E,OAAA,kBAAAsI,OAAA0uE,EAAAN,WAAAY,gBAAA5G,EAAAwG,iBAAAO,GAAA,MACA,CACAF,GAAAC,CACA,IAEAJ,EAAAxsD,GAAA,OAAA,WAEA,GAAAosD,EAAAP,SACA,CACA,IAAAiB,EAAAV,EAAAphD,MAAAjF,IAAAwmD,eACAH,EAAAphD,MAAAjF,IAAAwD,MAAA,OAAA7rB,OAAAooE,EAAA7rB,OAAA,yBAAAv8C,OAAAivE,EAAAv3E,OAAA,kBAAAsI,OAAA0uE,EAAAN,WAAAY,gBAAA5G,EAAAwG,iBAAAQ,GAAA,MACA,CACA,OAAA5Q,EAAAzoD,EAAA+4D,EAAAG,EACA,GACA,GACA,GAAA,CAAAl3E,IAAA,8BAAAC,MAEA,SAAAq1B,EAAAmxC,GACA,IAAA6Q,EAAAl2E,KACAivE,EAAAjvE,KAAAw1E,WAAAthD,GAYA,OAVA+6C,EAAAwG,iBAAAz1E,KAAAm0B,MAAAjF,IAAAwmD,eAEA11E,KAAAg1E,UAEAh1E,KAAAm0B,MAAAjF,IAAAwD,MAAA,aAAA7rB,OAAAooE,EAAA7rB,OAAA,gBAAAv8C,OAAAooE,EAAAtwC,IAAA,QAAA93B,OAAAooE,EAAAwG,mBAGAxG,EAAA/rB,MAAA,EACA+rB,EAAAjgE,SAAA,KAEA0lE,EAAAzF,GACA,SAAAryD,EAAA+4D,GAEA,GAAA/4D,EAEA,OAAAyoD,EAAAzoD,EAAA+4D,GAGA,GAAAO,EAAAlB,SACA,CACA,IAAAY,EAAAM,EAAA/hD,MAAAjF,IAAAwmD,eACAQ,EAAA/hD,MAAAjF,IAAAwD,MAAA,UAAA7rB,OAAAooE,EAAA7rB,OAAA,kBAAAv8C,OAAAqvE,EAAAjB,WAAAY,gBAAA5G,EAAAwG,iBAAAG,GAAA,YAAA/uE,OAAA8uE,EAAAlyB,YACA,CAEA,IAAA0yB,GAAA,EAEAR,EAAAxsD,GAAA,QAAA,SAAA4sD,GAGA,GAAAG,EAAAlB,SACA,CACA,IAAAgB,EAAAE,EAAA/hD,MAAAjF,IAAAwmD,eACAQ,EAAA/hD,MAAAjF,IAAAwD,MAAA,UAAA7rB,OAAAooE,EAAA7rB,OAAA,qBAAAv8C,OAAAkvE,EAAAx3E,OAAA,kBAAAsI,OAAAqvE,EAAAjB,WAAAY,gBAAA5G,EAAAwG,iBAAAO,GAAA,MACA,CAQAG,EANAA,EAMAhoE,EAAAtH,OAAA,CAAAsvE,EAAAJ,IAJA5nE,EAAAnQ,KAAA+3E,EAMA,IAEAJ,EAAAxsD,GAAA,OAAA,WAEA,GAAA+sD,EAAAlB,SACA,CACA,IAAAiB,EAAAC,EAAA/hD,MAAAjF,IAAAwmD,eACAQ,EAAA/hD,MAAAjF,IAAAwD,MAAA,OAAA7rB,OAAAooE,EAAA7rB,OAAA,yBAAAv8C,OAAAsvE,EAAA53E,OAAA,kBAAAsI,OAAAqvE,EAAAjB,WAAAY,gBAAA5G,EAAAwG,iBAAAQ,GAAA,MACA,CACA,OAAA5Q,EAAAzoD,EAAA+4D,EAAAQ,EACA,GACA,GACA,GAAA,CAAAv3E,IAAA,qBAAAC,MAEA,SAAAq1B,EAAAmxC,GACA,IAAA+Q,EAAAp2E,KACAk0B,EAAAgvB,MAAA,EAEA,IAAA+rB,EAAAjvE,KAAAw1E,WAAAthD,GAoBA,OAlBA+6C,EAAA/uE,eAAA,aAEA+uE,EAAAhsB,QAAA,CAAA,GASAgsB,EAAAwG,iBAAAz1E,KAAAm0B,MAAAjF,IAAAwmD,eAEA11E,KAAAg1E,UAEAh1E,KAAAm0B,MAAAjF,IAAAwD,MAAA,aAAA7rB,OAAAooE,EAAA7rB,OAAA,qBAAAv8C,OAAAooE,EAAAtwC,IAAA,QAAA93B,OAAAooE,EAAAwG,mBAGAf,EAAAzF,GACA,SAAAryD,EAAA+4D,GAEA,GAAA/4D,EAEA,OAAAyoD,EAAAzoD,EAAA+4D,GAGA,GAAAS,EAAApB,SACA,CACA,IAAAY,EAAAQ,EAAAjiD,MAAAjF,IAAAwmD,eACAU,EAAAjiD,MAAAjF,IAAAwD,MAAA,eAAA7rB,OAAAooE,EAAA7rB,OAAA,kBAAAv8C,OAAAuvE,EAAAnB,WAAAY,gBAAA5G,EAAAwG,iBAAAG,GAAA,YAAA/uE,OAAA8uE,EAAAlyB,YACA,CAEA,IAAA4yB,EAAA,GAEAV,EAAAxsD,GAAA,QAAA,SAAA4sD,GAEA,GAAAK,EAAApB,SACA,CACA,IAAAgB,EAAAI,EAAAjiD,MAAAjF,IAAAwmD,eACAU,EAAAjiD,MAAAjF,IAAAwD,MAAA,eAAA7rB,OAAAooE,EAAA7rB,OAAA,qBAAAv8C,OAAAkvE,EAAAx3E,OAAA,kBAAAsI,OAAAuvE,EAAAnB,WAAAY,gBAAA5G,EAAAwG,iBAAAO,GAAA,MACA,CACAK,GAAAN,CACA,IAEAJ,EAAAxsD,GAAA,OAAA,WAEA,GAAAitD,EAAApB,SACA,CACA,IAAAiB,EAAAG,EAAAjiD,MAAAjF,IAAAwmD,eACAU,EAAAjiD,MAAAjF,IAAAwD,MAAA,YAAA7rB,OAAAooE,EAAA7rB,OAAA,6BAAAv8C,OAAAuvE,EAAAnB,WAAAY,gBAAA5G,EAAAwG,iBAAAQ,GAAA,MACA,CACA,OAAA5Q,EAAAzoD,EAAA+4D,EAAAxmD,KAAAthB,MAAAwoE,GACA,GACA,GACA,GAAA,CAAAz3E,IAAA,UAAAC,MAEA,SAAAy3E,EAAAjR,GAEA,IAAAkR,EAAA,UAAAx1E,QAAAu1E,GAAAA,EAAA,CAAA,EAQA,MAPA,iBAAAA,IAEAC,EAAA53C,IAAA23C,GAGAC,EAAAnzB,OAAA,MAEApjD,KAAAw2E,mBAAAD,EAAAlR,EACA,GAAA,CAAAzmE,IAAA,UAAAC,MAEA,SAAAq1B,EAAAmxC,GAEA,MAAA,UAAAtkE,QAAAmzB,EAAA8uB,MAEAqiB,EAAA,IAAArhE,MAAA,2CAGAkwB,EAAAkvB,OAAA,MAEApjD,KAAAw2E,mBAAAtiD,EAAAmxC,GACA,GAAA,CAAAzmE,IAAA,WAAAC,MAEA,SAAAq1B,EAAAmxC,GAEA,MAAA,UAAAtkE,QAAAmzB,EAAA8uB,MAEAqiB,EAAA,IAAArhE,MAAA,4CAGAkwB,EAAAkvB,OAAA,OAEApjD,KAAAw2E,mBAAAtiD,EAAAmxC,GACA,GAAA,CAAAzmE,IAAA,YAAAC,MAEA,SAAAq1B,EAAAmxC,GAEA,MAAA,UAAAtkE,QAAAmzB,EAAA8uB,MAEAqiB,EAAA,IAAArhE,MAAA,6CAGAkwB,EAAAkvB,OAAA,QAEApjD,KAAAw2E,mBAAAtiD,EAAAmxC,GACA,GAAA,CAAAzmE,IAAA,WAAAC,MAEA,SAAAq1B,EAAAmxC,GAEA,MAAA,UAAAtkE,QAAAmzB,EAAA8uB,MAEAqiB,EAAA,IAAArhE,MAAA,4CAGAkwB,EAAAkvB,OAAA,OAEApjD,KAAAw2E,mBAAAtiD,EAAAmxC,GACA,GAAA,CAAAzmE,IAAA,UAAAC,MAEA,SAAAq1B,EAAAmxC,GAIA,OAFAnxC,EAAAkvB,OAAA,SAEApjD,KAAAw2E,mBAAAtiD,EAAAmxC,EACA,GAAA,CAAAzmE,IAAA,aAAAC,MAEA,SAAAy3E,EAAAjR,GAEA,IAAAkR,EAAA,UAAAx1E,QAAAu1E,GAAAA,EAAA,CAAA,EAQA,MAPA,iBAAAA,IAEAC,EAAA53C,IAAA23C,GAGAC,EAAAnzB,OAAA,MAEApjD,KAAAy2E,sBAAAF,EAAAlR,EACA,KAAAuP,CAAA,CAlTA,CAAA7S,GAqTA3+D,EAAAD,QAAAyxE,ClI0kmBC,GAAEj3E,KAAKqC,KAAM,GAAErC,KAAKqC,KAAK6D,EAAQ,UAAUsK,OAE5C,EAAE,CAAC,6BAA6B,IAAIsB,OAAS,GAAGq0C,OAAS,GAAG,aAAa,KAAK,IAAI,CAAC,SAASjgD,EAAQT,EAAOD,GmIt4mB3G,IAEAuzE,EAAA,SAAAC,GAAAn1E,UAAAk1E,EAAAC,GAAA,IAAAC,EAAA50E,aAAA00E,GAWA,SAAAA,EAAA98D,EAAAsa,EAAApa,GACA,IAAA+8D,EAqCA,OArCAz2E,iBAAAJ,KAAA02E,IACAG,EAAAD,EAAAj5E,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAEAE,YAAA,WAIA68D,EAAAC,SACA,CACAC,SAAA,kBACAC,YAAA,mBACAC,QAAA,+BACAC,UAAA,8BAEAC,mBAAA,MAKAN,EAAAO,gBAAA,CACA,KAAA,KACA,IAAA,IACA1zE,EAAA,KACA,KAAA,IACAnG,EAAA,KACA,KAAA,IACAoG,EAAA,KACA,KAAA,IACA0zE,MAAA,SACA,SAAA,QACAC,MAAA,SACA,SAAA,SAKAT,EAAAU,gBAAA,EACAV,EAAAW,gBAAA,EAAAX,CACA,CAkDA,OAlDAn2E,cAAAg2E,EAAA,CAAA,CAAA93E,IAAA,iBAAAC,MAEA,SAAAyb,GAEA,OAAAta,KAAAu3E,eAAAj9D,EACA,GAAA,CAAA1b,IAAA,mBAAAC,MAEA,SAAAyb,GAGA,OADAta,KAAAy3E,eAAAn4E,KAAAU,KAEA,GAAA,CAAApB,IAAA,wBAAAC,MAEA,SAAA64E,EAAAp9D,GACA,IAAAq9D,EAAA33E,KA0BA,OAvBAA,KAAA43E,eAAA,SAAAF,EACAhqE,QAAA1N,KAAA82E,SAAAG,SACA,SAAAlO,GAEA,MAAA,KAAAliE,OAAA8wE,EAAAP,gBAAArO,GACA,IACAr7D,QAAA1N,KAAA82E,SAAAE,aAAAh3E,KAAA82E,SAAAK,oBACA,SAAApO,EAAA8O,GAEA,MAAA,QAAAhxE,OAAAqY,mBAAA24D,GAAA,QACA,IACAnqE,QAAA1N,KAAA82E,SAAAC,UAAA/2E,KAAA82E,SAAAK,oBACA,SAAApO,EAAA8O,GAEA,MAAA,OAAAhxE,OAAAqY,mBAAA24D,GAAA,YACA,IAAA,OAGA73E,KAAA43E,eAAA,mCAAA/wE,OAAA7G,KAAA43E,eAAA,OACA53E,KAAA43E,eAAA,oFAAA/wE,OAAA7G,KAAA43E,eAAA,iBAEA53E,KAAAu3E,eAAA,IAAApvD,SAAA,sBAAAnoB,KAAA43E,qBAEA,IAAAt9D,EAEAta,KAAAu3E,eAAAj9D,IAKAta,KAAA83E,uBAAA,mBAAA93E,KAAA43E,eAAA,IAEA53E,KAAA+3E,mBACA,KAAArB,CAAA,CApGA,CAFA7yE,EAAA,8BAAAw/D,qBAyGAjgE,EAAAD,QAAAuzE,CnIw4mBA,EAAE,CAAC,6BAA6B,MAAM,IAAI,CAAC,SAAS7yE,EAAQT,EAAOD,GoIj/mBnE,IAAA4+D,EAAAl+D,EAAA,8BAAAw/D,oBAGA2U,EAAAn0E,EAAA,mBACAo0E,EAAAp0E,EAAA,mBAEAq0E,EAAAr0E,EAAA,UAEAs0E,EAAA,SAAAC,GAAA52E,UAAA22E,EAAAC,GAAA,IAAAC,EAAAr2E,aAAAm2E,GAWA,SAAAA,EAAAv+D,EAAAsa,EAAApa,GACA,IAAAw+D,EASA,OATAl4E,iBAAAJ,KAAAm4E,IACAG,EAAAD,EAAA16E,KAAAqC,KAAA4Z,EAAAsa,EAAApa,IAEAy+D,UAAA,CAAA,EAGAD,EAAAE,UAAAR,EACAM,EAAAlH,UAAA6G,EAEAK,EAAAzO,UAAAqO,EAAAI,CACA,CAgJA,OA3IA53E,cAAAy3E,EAAA,CAAA,CAAAv5E,IAAA,SAAAC,MACA,SAAA45E,GAEA,IAAA,IAAAj6E,EAAA,EAAAA,GAAAsB,UAAAvB,QAAA,EAAA,EAAAuB,UAAAvB,OAAA,GAAAC,IACA,CACA,IAAAk6E,EAAAl6E,EAAA,EAAA,GAAAsB,UAAAvB,QAAAC,EAAA,OAAA6C,EAAAvB,UAAAtB,EAAA,GACA,GAAA,WAAAuC,QAAA23E,GAGA,IADA,IAAAv0C,EAAA3mC,OAAAwI,KAAA0yE,GACAzyE,EAAA,EAAAA,EAAAk+B,EAAA5lC,OAAA0H,IAEAwyE,EAAAt0C,EAAAl+B,IAAAyyE,EAAAv0C,EAAAl+B,GAGA,CACA,OAAAwyE,CACA,GAIA,CAAA75E,IAAA,WAAAC,MACA,SAAA64E,EAAAp9D,GAIA,OAFAta,KAAAm0B,MAAA2vC,eAAAd,8CAAA,YAEA2V,sBAAAjB,EAAAp9D,EACA,GAEA,CAAA1b,IAAA,sBAAAC,MACA,SAAA+5E,EAAAlB,EAAAp9D,GAEA,IAAAu+D,EAAA74E,KAAAm0B,MAAA2vC,eAAAnB,2BAAA,WAAA,CAAA,EAAAiW,GAIA,OAFA54E,KAAAu4E,UAAAK,GAAAC,EAAAF,sBAAAjB,EAAAp9D,GAEAta,KAAAu4E,UAAAK,EACA,GAMA,CAAAh6E,IAAA,QAAAC,MACA,SAAAi6E,EAAAC,EAAAC,GAEA,IAAA/2C,EAAAplC,mBAAAi8E,GAEAG,EAAA,iBAAAF,EAAAA,EAAA,EACAG,OAAA,IAAAF,EAAAA,EAAA,GAEA,GAAAC,GAAA,EAEA,OAAAC,EAGA,KAAAj3C,EAAA1jC,QAEA26E,EAAAxzE,KAAAu8B,EAAApF,OAAA,EAAAo8C,IAGA,OAAAC,CACA,GAWA,CAAAt6E,IAAA,kBAAAC,MACA,SAAAs6E,GAIA,IAAAC,EAAAD,EAAAhgE,MAAA,OAGAkgE,EAAA,IAAAx+D,KAGAy+D,EAAA,EAEAC,EAAA,EAqDA,OAlDAF,EAAAG,WAAA,GACAH,EAAAI,YAAA,GACAJ,EAAAK,YAAA,GACAL,EAAAM,cAAA,GACAN,EAAAO,cAAA,GACAP,EAAAQ,mBAAA,GAMAR,EAAAS,eAAAznE,SAAA+mE,EAAA,KAIAC,EAAAI,YAAApnE,SAAA+mE,EAAA,IAAA,GAEAC,EAAAG,WAAAnnE,SAAA+mE,EAAA,KAGAC,EAAAK,YAAArnE,SAAA+mE,EAAA,KACAC,EAAAM,cAAAtnE,SAAA+mE,EAAA,KACAC,EAAAO,cAAAvnE,SAAA+mE,EAAA,KACAC,EAAAQ,mBAAAxnE,SAAA+mE,EAAA,MAGAA,EAAA,IAAAA,EAAA,MAGAA,EAAA,KAGAG,EAAAlnE,SAAA+mE,EAAA,IAAA,IAIAE,EAAAjnE,SAAA+mE,EAAA,IAAAG,EAGA,KAAAJ,EAAA7mE,QAAA,EAAA,KAGAgnE,IAAA,IAKAD,EAAAU,SAAAV,EAAAt3D,WAAAu3D,GAGAD,CACA,KAAAlB,CAAA,CAtKA,CAAApW,GAyKA3+D,EAAAD,QAAAg1E,CpIm/mBA,EAAE,CAAC,6BAA6B,IAAI,kBAAkB,EAAE,kBAAkB,GAAG,SAAS,MAAM,CAAC,EAAE,CAAC,KCpqnBhG,CDoqnBsG,IACtG","file":"fable.compatible.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\":111}],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/*\r\n * big.js v6.2.1\r\n * A small, fast, easy-to-use library for arbitrary-precision decimal arithmetic.\r\n * Copyright (c) 2022 Michael Mclaughlin\r\n * https://github.com/MikeMcl/big.js/LICENCE.md\r\n */\r\n;(function (GLOBAL) {\r\n 'use strict';\r\n var Big,\r\n\r\n\r\n/************************************** EDITABLE DEFAULTS *****************************************/\r\n\r\n\r\n // The default values below must be integers within the stated ranges.\r\n\r\n /*\r\n * The maximum number of decimal places (DP) of the results of operations involving division:\r\n * div and sqrt, and pow with negative exponents.\r\n */\r\n DP = 20, // 0 to MAX_DP\r\n\r\n /*\r\n * The rounding mode (RM) used when rounding to the above decimal places.\r\n *\r\n * 0 Towards zero (i.e. truncate, no rounding). (ROUND_DOWN)\r\n * 1 To nearest neighbour. If equidistant, round up. (ROUND_HALF_UP)\r\n * 2 To nearest neighbour. If equidistant, to even. (ROUND_HALF_EVEN)\r\n * 3 Away from zero. (ROUND_UP)\r\n */\r\n RM = 1, // 0, 1, 2 or 3\r\n\r\n // The maximum value of DP and Big.DP.\r\n MAX_DP = 1E6, // 0 to 1000000\r\n\r\n // The maximum magnitude of the exponent argument to the pow method.\r\n MAX_POWER = 1E6, // 1 to 1000000\r\n\r\n /*\r\n * The negative exponent (NE) at and beneath which toString returns exponential notation.\r\n * (JavaScript numbers: -7)\r\n * -1000000 is the minimum recommended exponent value of a Big.\r\n */\r\n NE = -7, // 0 to -1000000\r\n\r\n /*\r\n * The positive exponent (PE) at and above which toString returns exponential notation.\r\n * (JavaScript numbers: 21)\r\n * 1000000 is the maximum recommended exponent value of a Big, but this limit is not enforced.\r\n */\r\n PE = 21, // 0 to 1000000\r\n\r\n /*\r\n * When true, an error will be thrown if a primitive number is passed to the Big constructor,\r\n * or if valueOf is called, or if toNumber is called on a Big which cannot be converted to a\r\n * primitive number without a loss of precision.\r\n */\r\n STRICT = false, // true or false\r\n\r\n\r\n/**************************************************************************************************/\r\n\r\n\r\n // Error messages.\r\n NAME = '[big.js] ',\r\n INVALID = NAME + 'Invalid ',\r\n INVALID_DP = INVALID + 'decimal places',\r\n INVALID_RM = INVALID + 'rounding mode',\r\n DIV_BY_ZERO = NAME + 'Division by zero',\r\n\r\n // The shared prototype object.\r\n P = {},\r\n UNDEFINED = void 0,\r\n NUMERIC = /^-?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i;\r\n\r\n\r\n /*\r\n * Create and return a Big constructor.\r\n */\r\n function _Big_() {\r\n\r\n /*\r\n * The Big constructor and exported function.\r\n * Create and return a new instance of a Big number object.\r\n *\r\n * n {number|string|Big} A numeric value.\r\n */\r\n function Big(n) {\r\n var x = this;\r\n\r\n // Enable constructor usage without new.\r\n if (!(x instanceof Big)) return n === UNDEFINED ? _Big_() : new Big(n);\r\n\r\n // Duplicate.\r\n if (n instanceof Big) {\r\n x.s = n.s;\r\n x.e = n.e;\r\n x.c = n.c.slice();\r\n } else {\r\n if (typeof n !== 'string') {\r\n if (Big.strict === true && typeof n !== 'bigint') {\r\n throw TypeError(INVALID + 'value');\r\n }\r\n\r\n // Minus zero?\r\n n = n === 0 && 1 / n < 0 ? '-0' : String(n);\r\n }\r\n\r\n parse(x, n);\r\n }\r\n\r\n // Retain a reference to this Big constructor.\r\n // Shadow Big.prototype.constructor which points to Object.\r\n x.constructor = Big;\r\n }\r\n\r\n Big.prototype = P;\r\n Big.DP = DP;\r\n Big.RM = RM;\r\n Big.NE = NE;\r\n Big.PE = PE;\r\n Big.strict = STRICT;\r\n Big.roundDown = 0;\r\n Big.roundHalfUp = 1;\r\n Big.roundHalfEven = 2;\r\n Big.roundUp = 3;\r\n\r\n return Big;\r\n }\r\n\r\n\r\n /*\r\n * Parse the number or string value passed to a Big constructor.\r\n *\r\n * x {Big} A Big number instance.\r\n * n {number|string} A numeric value.\r\n */\r\n function parse(x, n) {\r\n var e, i, nl;\r\n\r\n if (!NUMERIC.test(n)) {\r\n throw Error(INVALID + 'number');\r\n }\r\n\r\n // Determine sign.\r\n x.s = n.charAt(0) == '-' ? (n = n.slice(1), -1) : 1;\r\n\r\n // Decimal point?\r\n if ((e = n.indexOf('.')) > -1) n = n.replace('.', '');\r\n\r\n // Exponential form?\r\n if ((i = n.search(/e/i)) > 0) {\r\n\r\n // Determine exponent.\r\n if (e < 0) e = i;\r\n e += +n.slice(i + 1);\r\n n = n.substring(0, i);\r\n } else if (e < 0) {\r\n\r\n // Integer.\r\n e = n.length;\r\n }\r\n\r\n nl = n.length;\r\n\r\n // Determine leading zeros.\r\n for (i = 0; i < nl && n.charAt(i) == '0';) ++i;\r\n\r\n if (i == nl) {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n } else {\r\n\r\n // Determine trailing zeros.\r\n for (; nl > 0 && n.charAt(--nl) == '0';);\r\n x.e = e - i - 1;\r\n x.c = [];\r\n\r\n // Convert string to array of digits without leading/trailing zeros.\r\n for (e = 0; i <= nl;) x.c[e++] = +n.charAt(i++);\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n /*\r\n * Round Big x to a maximum of sd significant digits using rounding mode rm.\r\n *\r\n * x {Big} The Big to round.\r\n * sd {number} Significant digits: integer, 0 to MAX_DP inclusive.\r\n * rm {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n * [more] {boolean} Whether the result of division was truncated.\r\n */\r\n function round(x, sd, rm, more) {\r\n var xc = x.c;\r\n\r\n if (rm === UNDEFINED) rm = x.constructor.RM;\r\n if (rm !== 0 && rm !== 1 && rm !== 2 && rm !== 3) {\r\n throw Error(INVALID_RM);\r\n }\r\n\r\n if (sd < 1) {\r\n more =\r\n rm === 3 && (more || !!xc[0]) || sd === 0 && (\r\n rm === 1 && xc[0] >= 5 ||\r\n rm === 2 && (xc[0] > 5 || xc[0] === 5 && (more || xc[1] !== UNDEFINED))\r\n );\r\n\r\n xc.length = 1;\r\n\r\n if (more) {\r\n\r\n // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n x.e = x.e - sd + 1;\r\n xc[0] = 1;\r\n } else {\r\n\r\n // Zero.\r\n xc[0] = x.e = 0;\r\n }\r\n } else if (sd < xc.length) {\r\n\r\n // xc[sd] is the digit after the digit that may be rounded up.\r\n more =\r\n rm === 1 && xc[sd] >= 5 ||\r\n rm === 2 && (xc[sd] > 5 || xc[sd] === 5 &&\r\n (more || xc[sd + 1] !== UNDEFINED || xc[sd - 1] & 1)) ||\r\n rm === 3 && (more || !!xc[0]);\r\n\r\n // Remove any digits after the required precision.\r\n xc.length = sd;\r\n\r\n // Round up?\r\n if (more) {\r\n\r\n // Rounding up may mean the previous digit has to be rounded up.\r\n for (; ++xc[--sd] > 9;) {\r\n xc[sd] = 0;\r\n if (sd === 0) {\r\n ++x.e;\r\n xc.unshift(1);\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (sd = xc.length; !xc[--sd];) xc.pop();\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n /*\r\n * Return a string representing the value of Big x in normal or exponential notation.\r\n * Handles P.toExponential, P.toFixed, P.toJSON, P.toPrecision, P.toString and P.valueOf.\r\n */\r\n function stringify(x, doExponential, isNonzero) {\r\n var e = x.e,\r\n s = x.c.join(''),\r\n n = s.length;\r\n\r\n // Exponential notation?\r\n if (doExponential) {\r\n s = s.charAt(0) + (n > 1 ? '.' + s.slice(1) : '') + (e < 0 ? 'e' : 'e+') + e;\r\n\r\n // Normal notation.\r\n } else if (e < 0) {\r\n for (; ++e;) s = '0' + s;\r\n s = '0.' + s;\r\n } else if (e > 0) {\r\n if (++e > n) {\r\n for (e -= n; e--;) s += '0';\r\n } else if (e < n) {\r\n s = s.slice(0, e) + '.' + s.slice(e);\r\n }\r\n } else if (n > 1) {\r\n s = s.charAt(0) + '.' + s.slice(1);\r\n }\r\n\r\n return x.s < 0 && isNonzero ? '-' + s : s;\r\n }\r\n\r\n\r\n // Prototype/instance methods\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the absolute value of this Big.\r\n */\r\n P.abs = function () {\r\n var x = new this.constructor(this);\r\n x.s = 1;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * Return 1 if the value of this Big is greater than the value of Big y,\r\n * -1 if the value of this Big is less than the value of Big y, or\r\n * 0 if they have the same value.\r\n */\r\n P.cmp = function (y) {\r\n var isneg,\r\n x = this,\r\n xc = x.c,\r\n yc = (y = new x.constructor(y)).c,\r\n i = x.s,\r\n j = y.s,\r\n k = x.e,\r\n l = y.e;\r\n\r\n // Either zero?\r\n if (!xc[0] || !yc[0]) return !xc[0] ? !yc[0] ? 0 : -j : i;\r\n\r\n // Signs differ?\r\n if (i != j) return i;\r\n\r\n isneg = i < 0;\r\n\r\n // Compare exponents.\r\n if (k != l) return k > l ^ isneg ? 1 : -1;\r\n\r\n j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n // Compare digit by digit.\r\n for (i = -1; ++i < j;) {\r\n if (xc[i] != yc[i]) return xc[i] > yc[i] ^ isneg ? 1 : -1;\r\n }\r\n\r\n // Compare lengths.\r\n return k == l ? 0 : k > l ^ isneg ? 1 : -1;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big divided by the value of Big y, rounded,\r\n * if necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\r\n */\r\n P.div = function (y) {\r\n var x = this,\r\n Big = x.constructor,\r\n a = x.c, // dividend\r\n b = (y = new Big(y)).c, // divisor\r\n k = x.s == y.s ? 1 : -1,\r\n dp = Big.DP;\r\n\r\n if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n throw Error(INVALID_DP);\r\n }\r\n\r\n // Divisor is zero?\r\n if (!b[0]) {\r\n throw Error(DIV_BY_ZERO);\r\n }\r\n\r\n // Dividend is 0? Return +-0.\r\n if (!a[0]) {\r\n y.s = k;\r\n y.c = [y.e = 0];\r\n return y;\r\n }\r\n\r\n var bl, bt, n, cmp, ri,\r\n bz = b.slice(),\r\n ai = bl = b.length,\r\n al = a.length,\r\n r = a.slice(0, bl), // remainder\r\n rl = r.length,\r\n q = y, // quotient\r\n qc = q.c = [],\r\n qi = 0,\r\n p = dp + (q.e = x.e - y.e) + 1; // precision of the result\r\n\r\n q.s = k;\r\n k = p < 0 ? 0 : p;\r\n\r\n // Create version of divisor with leading zero.\r\n bz.unshift(0);\r\n\r\n // Add zeros to make remainder as long as divisor.\r\n for (; rl++ < bl;) r.push(0);\r\n\r\n do {\r\n\r\n // n is how many times the divisor goes into current remainder.\r\n for (n = 0; n < 10; n++) {\r\n\r\n // Compare divisor and remainder.\r\n if (bl != (rl = r.length)) {\r\n cmp = bl > rl ? 1 : -1;\r\n } else {\r\n for (ri = -1, cmp = 0; ++ri < bl;) {\r\n if (b[ri] != r[ri]) {\r\n cmp = b[ri] > r[ri] ? 1 : -1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // If divisor < remainder, subtract divisor from remainder.\r\n if (cmp < 0) {\r\n\r\n // Remainder can't be more than 1 digit longer than divisor.\r\n // Equalise lengths using divisor with extra leading zero?\r\n for (bt = rl == bl ? b : bz; rl;) {\r\n if (r[--rl] < bt[rl]) {\r\n ri = rl;\r\n for (; ri && !r[--ri];) r[ri] = 9;\r\n --r[ri];\r\n r[rl] += 10;\r\n }\r\n r[rl] -= bt[rl];\r\n }\r\n\r\n for (; !r[0];) r.shift();\r\n } else {\r\n break;\r\n }\r\n }\r\n\r\n // Add the digit n to the result array.\r\n qc[qi++] = cmp ? n : ++n;\r\n\r\n // Update the remainder.\r\n if (r[0] && cmp) r[rl] = a[ai] || 0;\r\n else r = [a[ai]];\r\n\r\n } while ((ai++ < al || r[0] !== UNDEFINED) && k--);\r\n\r\n // Leading zero? Do not remove if result is simply zero (qi == 1).\r\n if (!qc[0] && qi != 1) {\r\n\r\n // There can't be more than one zero.\r\n qc.shift();\r\n q.e--;\r\n p--;\r\n }\r\n\r\n // Round?\r\n if (qi > p) round(q, p, Big.RM, r[0] !== UNDEFINED);\r\n\r\n return q;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Big is equal to the value of Big y, otherwise return false.\r\n */\r\n P.eq = function (y) {\r\n return this.cmp(y) === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Big is greater than the value of Big y, otherwise return\r\n * false.\r\n */\r\n P.gt = function (y) {\r\n return this.cmp(y) > 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Big is greater than or equal to the value of Big y, otherwise\r\n * return false.\r\n */\r\n P.gte = function (y) {\r\n return this.cmp(y) > -1;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Big is less than the value of Big y, otherwise return false.\r\n */\r\n P.lt = function (y) {\r\n return this.cmp(y) < 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Big is less than or equal to the value of Big y, otherwise\r\n * return false.\r\n */\r\n P.lte = function (y) {\r\n return this.cmp(y) < 1;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big minus the value of Big y.\r\n */\r\n P.minus = P.sub = function (y) {\r\n var i, j, t, xlty,\r\n x = this,\r\n Big = x.constructor,\r\n a = x.s,\r\n b = (y = new Big(y)).s;\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.plus(y);\r\n }\r\n\r\n var xc = x.c.slice(),\r\n xe = x.e,\r\n yc = y.c,\r\n ye = y.e;\r\n\r\n // Either zero?\r\n if (!xc[0] || !yc[0]) {\r\n if (yc[0]) {\r\n y.s = -b;\r\n } else if (xc[0]) {\r\n y = new Big(x);\r\n } else {\r\n y.s = 1;\r\n }\r\n return y;\r\n }\r\n\r\n // Determine which is the bigger number. Prepend zeros to equalise exponents.\r\n if (a = xe - ye) {\r\n\r\n if (xlty = a < 0) {\r\n a = -a;\r\n t = xc;\r\n } else {\r\n ye = xe;\r\n t = yc;\r\n }\r\n\r\n t.reverse();\r\n for (b = a; b--;) t.push(0);\r\n t.reverse();\r\n } else {\r\n\r\n // Exponents equal. Check digit by digit.\r\n j = ((xlty = xc.length < yc.length) ? xc : yc).length;\r\n\r\n for (a = b = 0; b < j; b++) {\r\n if (xc[b] != yc[b]) {\r\n xlty = xc[b] < yc[b];\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // x < y? Point xc to the array of the bigger number.\r\n if (xlty) {\r\n t = xc;\r\n xc = yc;\r\n yc = t;\r\n y.s = -y.s;\r\n }\r\n\r\n /*\r\n * Append zeros to xc if shorter. No need to add zeros to yc if shorter as subtraction only\r\n * needs to start at yc.length.\r\n */\r\n if ((b = (j = yc.length) - (i = xc.length)) > 0) for (; b--;) xc[i++] = 0;\r\n\r\n // Subtract yc from xc.\r\n for (b = i; j > a;) {\r\n if (xc[--j] < yc[j]) {\r\n for (i = j; i && !xc[--i];) xc[i] = 9;\r\n --xc[i];\r\n xc[j] += 10;\r\n }\r\n\r\n xc[j] -= yc[j];\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (; xc[--b] === 0;) xc.pop();\r\n\r\n // Remove leading zeros and adjust exponent accordingly.\r\n for (; xc[0] === 0;) {\r\n xc.shift();\r\n --ye;\r\n }\r\n\r\n if (!xc[0]) {\r\n\r\n // n - n = +0\r\n y.s = 1;\r\n\r\n // Result must be zero.\r\n xc = [ye = 0];\r\n }\r\n\r\n y.c = xc;\r\n y.e = ye;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big modulo the value of Big y.\r\n */\r\n P.mod = function (y) {\r\n var ygtx,\r\n x = this,\r\n Big = x.constructor,\r\n a = x.s,\r\n b = (y = new Big(y)).s;\r\n\r\n if (!y.c[0]) {\r\n throw Error(DIV_BY_ZERO);\r\n }\r\n\r\n x.s = y.s = 1;\r\n ygtx = y.cmp(x) == 1;\r\n x.s = a;\r\n y.s = b;\r\n\r\n if (ygtx) return new Big(x);\r\n\r\n a = Big.DP;\r\n b = Big.RM;\r\n Big.DP = Big.RM = 0;\r\n x = x.div(y);\r\n Big.DP = a;\r\n Big.RM = b;\r\n\r\n return this.minus(x.times(y));\r\n };\r\n \r\n \r\n /*\r\n * Return a new Big whose value is the value of this Big negated.\r\n */\r\n P.neg = function () {\r\n var x = new this.constructor(this);\r\n x.s = -x.s;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big plus the value of Big y.\r\n */\r\n P.plus = P.add = function (y) {\r\n var e, k, t,\r\n x = this,\r\n Big = x.constructor;\r\n\r\n y = new Big(y);\r\n\r\n // Signs differ?\r\n if (x.s != y.s) {\r\n y.s = -y.s;\r\n return x.minus(y);\r\n }\r\n\r\n var xe = x.e,\r\n xc = x.c,\r\n ye = y.e,\r\n yc = y.c;\r\n\r\n // Either zero?\r\n if (!xc[0] || !yc[0]) {\r\n if (!yc[0]) {\r\n if (xc[0]) {\r\n y = new Big(x);\r\n } else {\r\n y.s = x.s;\r\n }\r\n }\r\n return y;\r\n }\r\n\r\n xc = xc.slice();\r\n\r\n // Prepend zeros to equalise exponents.\r\n // Note: reverse faster than unshifts.\r\n if (e = xe - ye) {\r\n if (e > 0) {\r\n ye = xe;\r\n t = yc;\r\n } else {\r\n e = -e;\r\n t = xc;\r\n }\r\n\r\n t.reverse();\r\n for (; e--;) t.push(0);\r\n t.reverse();\r\n }\r\n\r\n // Point xc to the longer array.\r\n if (xc.length - yc.length < 0) {\r\n t = yc;\r\n yc = xc;\r\n xc = t;\r\n }\r\n\r\n e = yc.length;\r\n\r\n // Only start adding at yc.length - 1 as the further digits of xc can be left as they are.\r\n for (k = 0; e; xc[e] %= 10) k = (xc[--e] = xc[e] + yc[e] + k) / 10 | 0;\r\n\r\n // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n\r\n if (k) {\r\n xc.unshift(k);\r\n ++ye;\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (e = xc.length; xc[--e] === 0;) xc.pop();\r\n\r\n y.c = xc;\r\n y.e = ye;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /*\r\n * Return a Big whose value is the value of this Big raised to the power n.\r\n * If n is negative, round to a maximum of Big.DP decimal places using rounding\r\n * mode Big.RM.\r\n *\r\n * n {number} Integer, -MAX_POWER to MAX_POWER inclusive.\r\n */\r\n P.pow = function (n) {\r\n var x = this,\r\n one = new x.constructor('1'),\r\n y = one,\r\n isneg = n < 0;\r\n\r\n if (n !== ~~n || n < -MAX_POWER || n > MAX_POWER) {\r\n throw Error(INVALID + 'exponent');\r\n }\r\n\r\n if (isneg) n = -n;\r\n\r\n for (;;) {\r\n if (n & 1) y = y.times(x);\r\n n >>= 1;\r\n if (!n) break;\r\n x = x.times(x);\r\n }\r\n\r\n return isneg ? one.div(y) : y;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big rounded to a maximum precision of sd\r\n * significant digits using rounding mode rm, or Big.RM if rm is not specified.\r\n *\r\n * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\n P.prec = function (sd, rm) {\r\n if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\r\n throw Error(INVALID + 'precision');\r\n }\r\n return round(new this.constructor(this), sd, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big rounded to a maximum of dp decimal places\r\n * using rounding mode rm, or Big.RM if rm is not specified.\r\n * If dp is negative, round to an integer which is a multiple of 10**-dp.\r\n * If dp is not specified, round to 0 decimal places.\r\n *\r\n * dp? {number} Integer, -MAX_DP to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\n P.round = function (dp, rm) {\r\n if (dp === UNDEFINED) dp = 0;\r\n else if (dp !== ~~dp || dp < -MAX_DP || dp > MAX_DP) {\r\n throw Error(INVALID_DP);\r\n }\r\n return round(new this.constructor(this), dp + this.e + 1, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the square root of the value of this Big, rounded, if\r\n * necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\r\n */\r\n P.sqrt = function () {\r\n var r, c, t,\r\n x = this,\r\n Big = x.constructor,\r\n s = x.s,\r\n e = x.e,\r\n half = new Big('0.5');\r\n\r\n // Zero?\r\n if (!x.c[0]) return new Big(x);\r\n\r\n // Negative?\r\n if (s < 0) {\r\n throw Error(NAME + 'No square root');\r\n }\r\n\r\n // Estimate.\r\n s = Math.sqrt(x + '');\r\n\r\n // Math.sqrt underflow/overflow?\r\n // Re-estimate: pass x coefficient to Math.sqrt as integer, then adjust the result exponent.\r\n if (s === 0 || s === 1 / 0) {\r\n c = x.c.join('');\r\n if (!(c.length + e & 1)) c += '0';\r\n s = Math.sqrt(c);\r\n e = ((e + 1) / 2 | 0) - (e < 0 || e & 1);\r\n r = new Big((s == 1 / 0 ? '5e' : (s = s.toExponential()).slice(0, s.indexOf('e') + 1)) + e);\r\n } else {\r\n r = new Big(s + '');\r\n }\r\n\r\n e = r.e + (Big.DP += 4);\r\n\r\n // Newton-Raphson iteration.\r\n do {\r\n t = r;\r\n r = half.times(t.plus(x.div(t)));\r\n } while (t.c.slice(0, e).join('') !== r.c.slice(0, e).join(''));\r\n\r\n return round(r, (Big.DP -= 4) + r.e + 1, Big.RM);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big times the value of Big y.\r\n */\r\n P.times = P.mul = function (y) {\r\n var c,\r\n x = this,\r\n Big = x.constructor,\r\n xc = x.c,\r\n yc = (y = new Big(y)).c,\r\n a = xc.length,\r\n b = yc.length,\r\n i = x.e,\r\n j = y.e;\r\n\r\n // Determine sign of result.\r\n y.s = x.s == y.s ? 1 : -1;\r\n\r\n // Return signed 0 if either 0.\r\n if (!xc[0] || !yc[0]) {\r\n y.c = [y.e = 0];\r\n return y;\r\n }\r\n\r\n // Initialise exponent of result as x.e + y.e.\r\n y.e = i + j;\r\n\r\n // If array xc has fewer digits than yc, swap xc and yc, and lengths.\r\n if (a < b) {\r\n c = xc;\r\n xc = yc;\r\n yc = c;\r\n j = a;\r\n a = b;\r\n b = j;\r\n }\r\n\r\n // Initialise coefficient array of result with zeros.\r\n for (c = new Array(j = a + b); j--;) c[j] = 0;\r\n\r\n // Multiply.\r\n\r\n // i is initially xc.length.\r\n for (i = b; i--;) {\r\n b = 0;\r\n\r\n // a is yc.length.\r\n for (j = a + i; j > i;) {\r\n\r\n // Current sum of products at this digit position, plus carry.\r\n b = c[j] + yc[i] * xc[j - i - 1] + b;\r\n c[j--] = b % 10;\r\n\r\n // carry\r\n b = b / 10 | 0;\r\n }\r\n\r\n c[j] = b;\r\n }\r\n\r\n // Increment result exponent if there is a final carry, otherwise remove leading zero.\r\n if (b) ++y.e;\r\n else c.shift();\r\n\r\n // Remove trailing zeros.\r\n for (i = c.length; !c[--i];) c.pop();\r\n y.c = c;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Big in exponential notation rounded to dp fixed\r\n * decimal places using rounding mode rm, or Big.RM if rm is not specified.\r\n *\r\n * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\n P.toExponential = function (dp, rm) {\r\n var x = this,\r\n n = x.c[0];\r\n\r\n if (dp !== UNDEFINED) {\r\n if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n throw Error(INVALID_DP);\r\n }\r\n x = round(new x.constructor(x), ++dp, rm);\r\n for (; x.c.length < dp;) x.c.push(0);\r\n }\r\n\r\n return stringify(x, true, !!n);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Big in normal notation rounded to dp fixed\r\n * decimal places using rounding mode rm, or Big.RM if rm is not specified.\r\n *\r\n * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n *\r\n * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n */\r\n P.toFixed = function (dp, rm) {\r\n var x = this,\r\n n = x.c[0];\r\n\r\n if (dp !== UNDEFINED) {\r\n if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n throw Error(INVALID_DP);\r\n }\r\n x = round(new x.constructor(x), dp + x.e + 1, rm);\r\n\r\n // x.e may have changed if the value is rounded up.\r\n for (dp = dp + x.e + 1; x.c.length < dp;) x.c.push(0);\r\n }\r\n\r\n return stringify(x, false, !!n);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Big.\r\n * Return exponential notation if this Big has a positive exponent equal to or greater than\r\n * Big.PE, or a negative exponent equal to or less than Big.NE.\r\n * Omit the sign for negative zero.\r\n */\r\n P.toJSON = P.toString = function () {\r\n var x = this,\r\n Big = x.constructor;\r\n return stringify(x, x.e <= Big.NE || x.e >= Big.PE, !!x.c[0]);\r\n };\r\n\r\n\r\n /*\r\n * Return the value of this Big as a primitve number.\r\n */\r\n P.toNumber = function () {\r\n var n = Number(stringify(this, true, true));\r\n if (this.constructor.strict === true && !this.eq(n.toString())) {\r\n throw Error(NAME + 'Imprecise conversion');\r\n }\r\n return n;\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Big rounded to sd significant digits using\r\n * rounding mode rm, or Big.RM if rm is not specified.\r\n * Use exponential notation if sd is less than the number of digits necessary to represent\r\n * the integer part of the value in normal notation.\r\n *\r\n * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\n P.toPrecision = function (sd, rm) {\r\n var x = this,\r\n Big = x.constructor,\r\n n = x.c[0];\r\n\r\n if (sd !== UNDEFINED) {\r\n if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\r\n throw Error(INVALID + 'precision');\r\n }\r\n x = round(new Big(x), sd, rm);\r\n for (; x.c.length < sd;) x.c.push(0);\r\n }\r\n\r\n return stringify(x, sd <= x.e || x.e <= Big.NE || x.e >= Big.PE, !!n);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Big.\r\n * Return exponential notation if this Big has a positive exponent equal to or greater than\r\n * Big.PE, or a negative exponent equal to or less than Big.NE.\r\n * Include the sign for negative zero.\r\n */\r\n P.valueOf = function () {\r\n var x = this,\r\n Big = x.constructor;\r\n if (Big.strict === true) {\r\n throw Error(NAME + 'valueOf disallowed');\r\n }\r\n return stringify(x, x.e <= Big.NE || x.e >= Big.PE, true);\r\n };\r\n\r\n\r\n // Export\r\n\r\n\r\n Big = _Big_();\r\n\r\n Big['default'] = Big.Big = Big;\r\n\r\n //AMD.\r\n if (typeof define === 'function' && define.amd) {\r\n define(function () { return Big; });\r\n\r\n // Node and other CommonJS-like environments that support module.exports.\r\n } else if (typeof module !== 'undefined' && module.exports) {\r\n module.exports = Big;\r\n\r\n //Browser.\r\n } else {\r\n GLOBAL.Big = Big;\r\n }\r\n})(this);\r\n\n},{}],18:[function(require,module,exports){\n\n},{}],19:[function(require,module,exports){\narguments[4][18][0].apply(exports,arguments)\n},{\"dup\":18}],20:[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\":20,\"ieee754\":58}],21:[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},{}],22:[function(require,module,exports){\n/**\n* Cache data structure with:\n* - enumerable items\n* - unique hash item access (if none is passed in, one is generated)\n* - size (length) expiration\n* - controllable expiration (e.g. keep in cache longer if older/less likely to change)\n* - time-based expiration\n* - custom expiration based on passed-in function\n*\n* Also:\n* - built to work well with browserify\n* - no dependencies at all\n* - pet friendly\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\nconst libFableServiceProviderBase = require('fable-serviceproviderbase');\n\nconst libLinkedList = require(`./LinkedList.js`);\n\nclass CashMoney extends libFableServiceProviderBase\n{\n\tconstructor(pFable, pManifest, pServiceHash)\n\t{\n\t\tif (pFable === undefined)\n\t\t{\n\t\t\tsuper({});\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsuper(pFable, pManifest, pServiceHash);\n\t\t}\n\n this.serviceType = 'ObjectCache';\n\n\t\t// The map of node objects by hash because Reasons.\n\t\tthis._HashMap = {};\n\n\t\tthis._RecordMap = {};\n\n\t\tthis._List = new libLinkedList();\n\n\t\t// If the list gets over maxLength, we will automatically remove nodes on insertion.\n\t\tthis.maxLength = 0;\n\n\t\t// If cache entries get over this age, they are removed with prune\n\t\tthis.maxAge = 0;\n\t}\n\n\tget RecordMap()\n\t{\n\t\treturn this._RecordMap;\n\t}\n\n\t// Add (or update) a node in the cache\n\tput(pData, pHash)\n\t{\n\t\t// If the hash of the record exists\n\t\tif (this._HashMap.hasOwnProperty(pHash))\n\t\t{\n\t\t\t// Just update the hashed records datum\n\t\t\tthis._HashMap[pHash].Datum = pData;\n\t\t\tthis._RecordMap[pHash] = pData;\n\t\t\treturn this._HashMap[pHash].Datum;\n\t\t}\n\n\t\tlet tmpNode = this._List.push(pData, pHash);\n\t\tthis._HashMap[tmpNode.Hash] = tmpNode;\n\t\tthis._RecordMap[pHash] = pData;\n\n\t\t// Automatically prune if over length, but only prune this nodes worth.\n\t\tif (this.maxLength > 0 && this._List.length > this.maxLength)\n\t\t{\n\t\t\t// Pop it off the head of the list\n\t\t\ttmpNode = this._List.pop();\n\t\t\t// Also remove it from the hashmap\n\t\t\tdelete this._RecordMap[tmpNode.Hash];\n\t\t\tdelete this._HashMap[tmpNode.Hash];\n\t\t}\n\n\t\t// Now some expiration properties on the node metadata... namely the birthdate in ms of the node\n\t\ttmpNode.Metadata.Created = +new Date();\n\n\t\treturn tmpNode.Datum;\n\t}\n\n\t// Read a datum by hash from the cache\n\tread(pHash)\n\t{\n\t\tif (!this._HashMap.hasOwnProperty(pHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\treturn this._HashMap[pHash].Datum;\n\t}\n\n\t// Reinvigorate a node based on hash, updating the timestamp and moving it to the head of the list (also removes custom metadata)\n\ttouch(pHash)\n\t{\n\t\tif (!this._HashMap.hasOwnProperty(pHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\t// Get the old node out of the list\n\t\tlet tmpNode = this._List.remove(this._HashMap[pHash]);\n\t\t// Remove it from the hash map\n\t\tdelete this._RecordMap[pHash];\n\t\tdelete this._HashMap[pHash];\n\n\t\t// Now put it back, fresh.\n\t\treturn this.put(tmpNode.Datum, tmpNode.Hash);\n\t}\n\n\t// Expire a cached record based on hash\n\texpire(pHash)\n\t{\n\t\tif (!this._HashMap.hasOwnProperty(pHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tlet tmpNode = this._HashMap[pHash];\n\n\t\t// Remove it from the list of cached records\n\t\ttmpNode = this._List.remove(tmpNode);\n\t\t// Also remove it from the hashmap\n\t\tdelete this._RecordMap[tmpNode.Hash];\n\t\tdelete this._HashMap[tmpNode.Hash];\n\n\t\t// Return it in case the consumer wants to do anything with it\n\t\treturn tmpNode;\n\t}\n\n\t// Prune records from the cached set based on maxAge\n\tpruneBasedOnExpiration(fComplete, pRemovedRecords)\n\t{\n\t\tlet tmpRemovedRecords = (typeof(pRemovedRecords) === 'undefined') ? [] : pRemovedRecords;\n\n\t\tif (this.maxAge < 1)\n\t\t{\n\t\t\treturn fComplete(tmpRemovedRecords);\n\t\t}\n\n\t\t// Now enumerate each record and remove any that are expired\n\t\tlet tmpNow = +new Date();\n\t\tlet tmpKeys = Object.keys(this._HashMap);\n\n\t\tfor (let i = 0; i < tmpKeys.length; i++)\n\t\t{\n\t\t\t// Expire the node if it is older than max age milliseconds\n\t\t\tif (tmpNow - this._HashMap[tmpKeys[i]].Metadata.Created >= this.maxAge)\n\t\t\t{\n\t\t\t\ttmpRemovedRecords.push(this.expire(tmpKeys[i]));\n\t\t\t}\n\t\t}\n\t\tfComplete(tmpRemovedRecords);\n\t}\n\n\t// Prune records from the cached set based on maxLength\n\tpruneBasedOnLength(fComplete, pRemovedRecords)\n\t{\n\t\tlet tmpRemovedRecords = (typeof(pRemovedRecords) === 'undefined') ? [] : pRemovedRecords;\n\n\t\t// Pop records off until we have reached maxLength unless it's 0\n\t\tif (this.maxLength > 0)\n\t\t{\n\t\t\twhile (this._List.length > this.maxLength)\n\t\t\t{\n\t\t\t\ttmpRemovedRecords.push(this._List.pop());\n\t\t\t}\n\t\t}\n\n\t\treturn fComplete(tmpRemovedRecords);\n\t}\n\n\t// Prune records from the cached set based on passed in pPruneFunction(pDatum, pHash, pNode) -- returning true expires it\n\tpruneCustom(fComplete, fPruneFunction, pRemovedRecords)\n\t{\n\t\tlet tmpRemovedRecords = (typeof(pRemovedRecords) === 'undefined') ? [] : pRemovedRecords;\n\n\t\tlet tmpKeys = Object.keys(this._HashMap);\n\t\tfor (let i = 0; i < tmpKeys.length; i++)\n\t\t{\n\t\t\tlet tmpNode = this._HashMap[tmpKeys[i]];\n\t\t\t// Expire the node if the passed in function returns true\n\t\t\tif (fPruneFunction(tmpNode.Datum, tmpNode.Hash, tmpNode))\n\t\t\t{\n\t\t\t\ttmpRemovedRecords.push(this.expire(tmpKeys[i]));\n\t\t\t}\n\t\t}\n\t\tfComplete(tmpRemovedRecords);\n\t}\n\n\t// Prune the list down to the asserted rules (max age then max length if still too long)\n\tprune(fComplete)\n\t{\n\t\tlet tmpRemovedRecords = [];\n\n\t\t// If there are no cached records, we are done.\n\t\tif (this._List.length < 1)\n\t\t{\n\t\t\treturn fComplete(tmpRemovedRecords);\n\t\t}\n\n\t\t// Now prune based on expiration time\n\t\tthis.pruneBasedOnExpiration((fExpirationPruneComplete)=>\n\t\t\t{\n\t\t\t\t// Now prune based on length, then return the removed records in the callback.\n\t\t\t\tthis.pruneBasedOnLength(fComplete, tmpRemovedRecords);\n\t\t\t}, tmpRemovedRecords);\n\t}\n\n\t// Get a low level node (including metadata statistics) by hash from the cache\n\tgetNode(pHash)\n\t{\n\t\tif (!this._HashMap.hasOwnProperty(pHash))\n\t\t\treturn false;\n\n\t\treturn this._HashMap[pHash];\n\t}\n}\n\nmodule.exports = CashMoney;\n},{\"./LinkedList.js\":24,\"fable-serviceproviderbase\":44}],23:[function(require,module,exports){\n/**\n* Double Linked List Node\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module CashMoney\n*/\n\n/**\n* Linked List Node Prototype\n*\n* @class LinkedListNode\n* @constructor\n*/\n\nclass LinkedListNode\n{\n\tconstructor()\n\t{\n\t\tthis.Hash = false;\n\t\tthis.Datum = false;\n\n\t\t// This is where expiration and other elements are stored;\n\t\tthis.Metadata = {};\n\n\t\tthis.LeftNode = false;\n\t\tthis.RightNode = false;\n\n\t\t// To allow safe specialty operations on nodes\n\t\tthis.__ISNODE = true;\n\t}\n}\n\nmodule.exports = LinkedListNode;\n},{}],24:[function(require,module,exports){\n\"use strict\"\n/**\n* Simple double linked list to hold the cache entries in, in order.\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module FeeFiFo\n*/\n\nconst libLinkedListNode = require('./LinkedList-Node.js');\n\n/**\n* Quality Cache Goodness\n*\n* @class CashMoney\n* @constructor\n*/\n\nclass LinkedList\n{\n\tconstructor()\n\t{\n\t\t// Total number of nodes ever processed by this ADT\n\t\tthis.totalNodes = 0;\n\n\t\t// The length of the set of nodes currently in the list\n\t\tthis.length = 0;\n\n\t\tthis.head = false;\n\t\tthis.tail = false;\n\t}\n\n\t// Create a node object.\n\tinitializeNode(pDatum, pHash)\n\t{\n\t\t// Don't allow undefined to be added to the list because of reasons\n\t\tif (typeof(pDatum) === 'undefined')\n\t\t\treturn false;\n\n\t\tthis.totalNodes++;\n\n\t\t// Get (or create) a unique hash\n\t\tlet tmpHash = (typeof(pHash) != 'undefined') ? pHash : `NODE[${this.totalNodes}]`;\n\n\t\tlet tmpNode = new libLinkedListNode();\n\n\t\ttmpNode.Hash = tmpHash;\n\t\ttmpNode.Datum = pDatum;\n\n\t\treturn tmpNode;\n\t}\n\n\t// Add a node to the end (right of tail) of the list.\n\tappend(pDatum, pHash)\n\t{\n\t\t// TODO: Should we check if pDatum is actually a node and do the \"right\" thing?\n\t\tlet tmpNode = this.initializeNode(pDatum, pHash);\n\t\tif (!tmpNode)\n\t\t\treturn false;\n\n\t\t// The list just got longer!\n\t\tthis.length++;\n\n\t\t// If the list was empty, create a new list from it (it isn't possible to have a tail with no head)\n\t\tif (this.length == 1)\n\t\t{\n\t\t\tthis.head = tmpNode;\n\t\t\tthis.tail = tmpNode;\n\t\t\treturn tmpNode;\n\t\t}\n\n\t\tthis.tail.RightNode = tmpNode;\n\t\ttmpNode.LeftNode = this.tail;\n\t\tthis.tail = tmpNode;\n\n\t\treturn tmpNode;\n\t}\n\n\t// Append to tail of list (FIFO)\n\tpush(pDatum, pHash)\n\t{\n\t\treturn this.append(pDatum, pHash);\n\t}\n\n\t// Add a node to the beginning (left of head) of the list.\n\tprepend(pDatum, pHash)\n\t{\n\t\t// TODO: Should we check if pDatum is actually a node and do the \"right\" thing?\n\t\tlet tmpNode = this.initializeNode(pDatum, pHash);\n\t\tif (!tmpNode)\n\t\t\treturn false;\n\n\t\t// The list just got longer!\n\t\tthis.length++;\n\n\t\t// If the list was empty, create a new list from it (it isn't possible to have a tail with no head)\n\t\tif (this.length == 1)\n\t\t{\n\t\t\tthis.head = tmpNode;\n\t\t\tthis.tail = tmpNode;\n\t\t\treturn tmpNode;\n\t\t}\n\n\t\tthis.head.LeftNode = tmpNode;\n\t\ttmpNode.RightNode = this.head;\n\t\tthis.head = tmpNode;\n\t\treturn tmpNode;\n\t}\n\n\t// Remove a node from the list\n\tremove(pNode)\n\t{\n\t\tif (typeof(pNode) === 'undefined')\n\t\t\treturn false;\n\n\t\tif (!pNode.__ISNODE)\n\t\t\treturn false;\n\n\t\tthis.length--;\n\n\t\t// Last element in list. Empty it out.\n\t\tif (this.length < 1)\n\t\t{\n\t\t\tthis.head = false;\n\t\t\tthis.tail = false;\n\t\t\treturn pNode;\n\t\t}\n\n\t\t// It's somewhere in the middle, surgically remove it.\n\t\tif (pNode.LeftNode && pNode.RightNode)\n\t\t{\n\t\t\tpNode.LeftNode.RightNode = pNode.RightNode;\n\t\t\tpNode.RightNode.LeftNode = pNode.LeftNode;\n\n\t\t\tpNode.RightNode = false;\n\t\t\tpNode.LeftNode = false;\n\t\t\treturn pNode;\n\t\t}\n\n\t\t// It's the tail\n\t\tif (pNode.LeftNode)\n\t\t{\n\t\t\tpNode.LeftNode.RightNode = false;\n\t\t\tthis.tail = pNode.LeftNode;\n\t\t\tpNode.LeftNode = false;\n\t\t\treturn pNode;\n\t\t}\n\n\t\t// It must be the head\n\t\tpNode.RightNode.LeftNode = false;\n\t\tthis.head = pNode.RightNode;\n\t\tpNode.RightNode = false;\n\t\treturn pNode;\n\t}\n\n\t// Remove the head of the list (FIFO)\n\tpop()\n\t{\n\t\treturn this.remove(this.head);\n\t}\n\n\t// Enumerate over each node IN ORDER, running the function fAction(pDatum, pHash, fCallback) then calling the function fComplete callback when done\n\teach(fAction, fComplete)\n\t{\n\t\tif (this.length < 1)\n\t\t\treturn fComplete();\n\n\t\tlet tmpNode = false;\n\n\t\tlet fIterator = (pError)=>\n\t\t{\n\t\t\t// If the user passed in a callback with an error, call their callback with the error\n\t\t\tif (pError)\n\t\t\t\treturn fComplete(pError);\n\n\t\t\t// If there is no node, this must be the initial run.\n\t\t\tif (!tmpNode)\n\t\t\t\ttmpNode = this.head;\n\t\t\t// Check if we are at the tail of the list\n\t\t\telse if (!tmpNode.RightNode)\n\t\t\t\treturn fComplete();\n\t\t\t// Proceed to the next node\n\t\t\telse\n\t\t\t\ttmpNode = tmpNode.RightNode;\n\n\t\t\t// Call the actual action\n\t\t\t// I hate this pattern because long tails eventually cause stack overflows.\n\t\t\tfAction(tmpNode.Datum, tmpNode.Hash, fIterator);\n\t\t};\n\n\t\t// Now kick off the iterator\n\t\treturn fIterator();\n\t}\n\n\t// Seek a specific node, 0 is the index of the first node.\n\tseek(pNodeIndex)\n\t{\n\t\tif (!pNodeIndex)\n\t\t\treturn false;\n\t\tif (this.length < 1)\n\t\t\treturn false;\n\t\tif (pNodeIndex >= this.length)\n\t\t\treturn false;\n\n\t\tlet tmpNode = this.head;\n\t\tfor (let i = 0; i < pNodeIndex; i++)\n\t\t{\n\t\t\ttmpNode = tmpNode.RightNode;\n\t\t}\n\n\t\treturn tmpNode;\n\t}\n}\n\nmodule.exports = LinkedList;\n},{\"./LinkedList-Node.js\":23}],25:[function(require,module,exports){\n'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBind = require('./');\n\nvar $indexOf = callBind(GetIntrinsic('String.prototype.indexOf'));\n\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\tvar intrinsic = GetIntrinsic(name, !!allowMissing);\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBind(intrinsic);\n\t}\n\treturn intrinsic;\n};\n\n},{\"./\":26,\"get-intrinsic\":52}],26:[function(require,module,exports){\n'use strict';\n\nvar bind = require('function-bind');\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $apply = GetIntrinsic('%Function.prototype.apply%');\nvar $call = GetIntrinsic('%Function.prototype.call%');\nvar $reflectApply = GetIntrinsic('%Reflect.apply%', true) || bind.call($call, $apply);\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true);\nvar $defineProperty = GetIntrinsic('%Object.defineProperty%', true);\nvar $max = GetIntrinsic('%Math.max%');\n\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = null;\n\t}\n}\n\nmodule.exports = function callBind(originalFunction) {\n\tvar func = $reflectApply(bind, $call, arguments);\n\tif ($gOPD && $defineProperty) {\n\t\tvar desc = $gOPD(func, 'length');\n\t\tif (desc.configurable) {\n\t\t\t// original length, plus the receiver, minus any additional arguments (after the receiver)\n\t\t\t$defineProperty(\n\t\t\t\tfunc,\n\t\t\t\t'length',\n\t\t\t\t{ value: 1 + $max(0, originalFunction.length - (arguments.length - 1)) }\n\t\t\t);\n\t\t}\n\t}\n\treturn func;\n};\n\nvar applyBind = function applyBind() {\n\treturn $reflectApply(bind, $apply, arguments);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n\n},{\"function-bind\":51,\"get-intrinsic\":52}],27:[function(require,module,exports){\n/*!\n * cookie\n * Copyright(c) 2012-2014 Roman Shtylman\n * Copyright(c) 2015 Douglas Christopher Wilson\n * MIT Licensed\n */\n\n'use strict';\n\n/**\n * Module exports.\n * @public\n */\n\nexports.parse = parse;\nexports.serialize = serialize;\n\n/**\n * Module variables.\n * @private\n */\n\nvar __toString = Object.prototype.toString\n\n/**\n * RegExp to match field-content in RFC 7230 sec 3.2\n *\n * field-content = field-vchar [ 1*( SP / HTAB ) field-vchar ]\n * field-vchar = VCHAR / obs-text\n * obs-text = %x80-FF\n */\n\nvar fieldContentRegExp = /^[\\u0009\\u0020-\\u007e\\u0080-\\u00ff]+$/;\n\n/**\n * Parse a cookie header.\n *\n * Parse the given cookie header string into an object\n * The object has the various cookies as keys(names) => values\n *\n * @param {string} str\n * @param {object} [options]\n * @return {object}\n * @public\n */\n\nfunction parse(str, options) {\n if (typeof str !== 'string') {\n throw new TypeError('argument str must be a string');\n }\n\n var obj = {}\n var opt = options || {};\n var dec = opt.decode || decode;\n\n var index = 0\n while (index < str.length) {\n var eqIdx = str.indexOf('=', index)\n\n // no more cookie pairs\n if (eqIdx === -1) {\n break\n }\n\n var endIdx = str.indexOf(';', index)\n\n if (endIdx === -1) {\n endIdx = str.length\n } else if (endIdx < eqIdx) {\n // backtrack on prior semicolon\n index = str.lastIndexOf(';', eqIdx - 1) + 1\n continue\n }\n\n var key = str.slice(index, eqIdx).trim()\n\n // only assign once\n if (undefined === obj[key]) {\n var val = str.slice(eqIdx + 1, endIdx).trim()\n\n // quoted values\n if (val.charCodeAt(0) === 0x22) {\n val = val.slice(1, -1)\n }\n\n obj[key] = tryDecode(val, dec);\n }\n\n index = endIdx + 1\n }\n\n return obj;\n}\n\n/**\n * Serialize data into a cookie header.\n *\n * Serialize the a name value pair into a cookie string suitable for\n * http headers. An optional options object specified cookie parameters.\n *\n * serialize('foo', 'bar', { httpOnly: true })\n * => \"foo=bar; httpOnly\"\n *\n * @param {string} name\n * @param {string} val\n * @param {object} [options]\n * @return {string}\n * @public\n */\n\nfunction serialize(name, val, options) {\n var opt = options || {};\n var enc = opt.encode || encode;\n\n if (typeof enc !== 'function') {\n throw new TypeError('option encode is invalid');\n }\n\n if (!fieldContentRegExp.test(name)) {\n throw new TypeError('argument name is invalid');\n }\n\n var value = enc(val);\n\n if (value && !fieldContentRegExp.test(value)) {\n throw new TypeError('argument val is invalid');\n }\n\n var str = name + '=' + value;\n\n if (null != opt.maxAge) {\n var maxAge = opt.maxAge - 0;\n\n if (isNaN(maxAge) || !isFinite(maxAge)) {\n throw new TypeError('option maxAge is invalid')\n }\n\n str += '; Max-Age=' + Math.floor(maxAge);\n }\n\n if (opt.domain) {\n if (!fieldContentRegExp.test(opt.domain)) {\n throw new TypeError('option domain is invalid');\n }\n\n str += '; Domain=' + opt.domain;\n }\n\n if (opt.path) {\n if (!fieldContentRegExp.test(opt.path)) {\n throw new TypeError('option path is invalid');\n }\n\n str += '; Path=' + opt.path;\n }\n\n if (opt.expires) {\n var expires = opt.expires\n\n if (!isDate(expires) || isNaN(expires.valueOf())) {\n throw new TypeError('option expires is invalid');\n }\n\n str += '; Expires=' + expires.toUTCString()\n }\n\n if (opt.httpOnly) {\n str += '; HttpOnly';\n }\n\n if (opt.secure) {\n str += '; Secure';\n }\n\n if (opt.priority) {\n var priority = typeof opt.priority === 'string'\n ? opt.priority.toLowerCase()\n : opt.priority\n\n switch (priority) {\n case 'low':\n str += '; Priority=Low'\n break\n case 'medium':\n str += '; Priority=Medium'\n break\n case 'high':\n str += '; Priority=High'\n break\n default:\n throw new TypeError('option priority is invalid')\n }\n }\n\n if (opt.sameSite) {\n var sameSite = typeof opt.sameSite === 'string'\n ? opt.sameSite.toLowerCase() : opt.sameSite;\n\n switch (sameSite) {\n case true:\n str += '; SameSite=Strict';\n break;\n case 'lax':\n str += '; SameSite=Lax';\n break;\n case 'strict':\n str += '; SameSite=Strict';\n break;\n case 'none':\n str += '; SameSite=None';\n break;\n default:\n throw new TypeError('option sameSite is invalid');\n }\n }\n\n return str;\n}\n\n/**\n * URL-decode string value. Optimized to skip native call when no %.\n *\n * @param {string} str\n * @returns {string}\n */\n\nfunction decode (str) {\n return str.indexOf('%') !== -1\n ? decodeURIComponent(str)\n : str\n}\n\n/**\n * URL-encode value.\n *\n * @param {string} str\n * @returns {string}\n */\n\nfunction encode (val) {\n return encodeURIComponent(val)\n}\n\n/**\n * Determine if value is a Date.\n *\n * @param {*} val\n * @private\n */\n\nfunction isDate (val) {\n return __toString.call(val) === '[object Date]' ||\n val instanceof Date\n}\n\n/**\n * Try decoding a string using a decoding function.\n *\n * @param {string} str\n * @param {function} decode\n * @private\n */\n\nfunction tryDecode(str, decode) {\n try {\n return decode(str);\n } catch (e) {\n return str;\n }\n}\n\n},{}],28:[function(require,module,exports){\n!function(t,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=e():\"function\"==typeof define&&define.amd?define(e):(t=\"undefined\"!=typeof globalThis?globalThis:t||self).dayjs=e()}(this,(function(){\"use strict\";var t=1e3,e=6e4,n=36e5,r=\"millisecond\",i=\"second\",s=\"minute\",u=\"hour\",a=\"day\",o=\"week\",c=\"month\",f=\"quarter\",h=\"year\",d=\"date\",l=\"Invalid Date\",$=/^(\\d{4})[-/]?(\\d{1,2})?[-/]?(\\d{0,2})[Tt\\s]*(\\d{1,2})?:?(\\d{1,2})?:?(\\d{1,2})?[.:]?(\\d+)?$/,y=/\\[([^\\]]+)]|Y{1,4}|M{1,4}|D{1,2}|d{1,4}|H{1,2}|h{1,2}|a|A|m{1,2}|s{1,2}|Z{1,2}|SSS/g,M={name:\"en\",weekdays:\"Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday\".split(\"_\"),months:\"January_February_March_April_May_June_July_August_September_October_November_December\".split(\"_\"),ordinal:function(t){var e=[\"th\",\"st\",\"nd\",\"rd\"],n=t%100;return\"[\"+t+(e[(n-20)%10]||e[n]||e[0])+\"]\"}},m=function(t,e,n){var r=String(t);return!r||r.length>=e?t:\"\"+Array(e+1-r.length).join(n)+t},v={s:m,z:function(t){var e=-t.utcOffset(),n=Math.abs(e),r=Math.floor(n/60),i=n%60;return(e<=0?\"+\":\"-\")+m(r,2,\"0\")+\":\"+m(i,2,\"0\")},m:function t(e,n){if(e.date()<n.date())return-t(n,e);var r=12*(n.year()-e.year())+(n.month()-e.month()),i=e.clone().add(r,c),s=n-i<0,u=e.clone().add(r+(s?-1:1),c);return+(-(r+(n-i)/(s?i-u:u-i))||0)},a:function(t){return t<0?Math.ceil(t)||0:Math.floor(t)},p:function(t){return{M:c,y:h,w:o,d:a,D:d,h:u,m:s,s:i,ms:r,Q:f}[t]||String(t||\"\").toLowerCase().replace(/s$/,\"\")},u:function(t){return void 0===t}},g=\"en\",D={};D[g]=M;var p=\"$isDayjsObject\",S=function(t){return t instanceof _||!(!t||!t[p])},w=function t(e,n,r){var i;if(!e)return g;if(\"string\"==typeof e){var s=e.toLowerCase();D[s]&&(i=s),n&&(D[s]=n,i=s);var u=e.split(\"-\");if(!i&&u.length>1)return t(u[0])}else{var a=e.name;D[a]=e,i=a}return!r&&i&&(g=i),i||!r&&g},O=function(t,e){if(S(t))return t.clone();var n=\"object\"==typeof e?e:{};return n.date=t,n.args=arguments,new _(n)},b=v;b.l=w,b.i=S,b.w=function(t,e){return O(t,{locale:e.$L,utc:e.$u,x:e.$x,$offset:e.$offset})};var _=function(){function M(t){this.$L=w(t.locale,null,!0),this.parse(t),this.$x=this.$x||t.x||{},this[p]=!0}var m=M.prototype;return m.parse=function(t){this.$d=function(t){var e=t.date,n=t.utc;if(null===e)return new Date(NaN);if(b.u(e))return new Date;if(e instanceof Date)return new Date(e);if(\"string\"==typeof e&&!/Z$/i.test(e)){var r=e.match($);if(r){var i=r[2]-1||0,s=(r[7]||\"0\").substring(0,3);return n?new Date(Date.UTC(r[1],i,r[3]||1,r[4]||0,r[5]||0,r[6]||0,s)):new Date(r[1],i,r[3]||1,r[4]||0,r[5]||0,r[6]||0,s)}}return new Date(e)}(t),this.init()},m.init=function(){var t=this.$d;this.$y=t.getFullYear(),this.$M=t.getMonth(),this.$D=t.getDate(),this.$W=t.getDay(),this.$H=t.getHours(),this.$m=t.getMinutes(),this.$s=t.getSeconds(),this.$ms=t.getMilliseconds()},m.$utils=function(){return b},m.isValid=function(){return!(this.$d.toString()===l)},m.isSame=function(t,e){var n=O(t);return this.startOf(e)<=n&&n<=this.endOf(e)},m.isAfter=function(t,e){return O(t)<this.startOf(e)},m.isBefore=function(t,e){return this.endOf(e)<O(t)},m.$g=function(t,e,n){return b.u(t)?this[e]:this.set(n,t)},m.unix=function(){return Math.floor(this.valueOf()/1e3)},m.valueOf=function(){return this.$d.getTime()},m.startOf=function(t,e){var n=this,r=!!b.u(e)||e,f=b.p(t),l=function(t,e){var i=b.w(n.$u?Date.UTC(n.$y,e,t):new Date(n.$y,e,t),n);return r?i:i.endOf(a)},$=function(t,e){return b.w(n.toDate()[t].apply(n.toDate(\"s\"),(r?[0,0,0,0]:[23,59,59,999]).slice(e)),n)},y=this.$W,M=this.$M,m=this.$D,v=\"set\"+(this.$u?\"UTC\":\"\");switch(f){case h:return r?l(1,0):l(31,11);case c:return r?l(1,M):l(0,M+1);case o:var g=this.$locale().weekStart||0,D=(y<g?y+7:y)-g;return l(r?m-D:m+(6-D),M);case a:case d:return $(v+\"Hours\",0);case u:return $(v+\"Minutes\",1);case s:return $(v+\"Seconds\",2);case i:return $(v+\"Milliseconds\",3);default:return this.clone()}},m.endOf=function(t){return this.startOf(t,!1)},m.$set=function(t,e){var n,o=b.p(t),f=\"set\"+(this.$u?\"UTC\":\"\"),l=(n={},n[a]=f+\"Date\",n[d]=f+\"Date\",n[c]=f+\"Month\",n[h]=f+\"FullYear\",n[u]=f+\"Hours\",n[s]=f+\"Minutes\",n[i]=f+\"Seconds\",n[r]=f+\"Milliseconds\",n)[o],$=o===a?this.$D+(e-this.$W):e;if(o===c||o===h){var y=this.clone().set(d,1);y.$d[l]($),y.init(),this.$d=y.set(d,Math.min(this.$D,y.daysInMonth())).$d}else l&&this.$d[l]($);return this.init(),this},m.set=function(t,e){return this.clone().$set(t,e)},m.get=function(t){return this[b.p(t)]()},m.add=function(r,f){var d,l=this;r=Number(r);var $=b.p(f),y=function(t){var e=O(l);return b.w(e.date(e.date()+Math.round(t*r)),l)};if($===c)return this.set(c,this.$M+r);if($===h)return this.set(h,this.$y+r);if($===a)return y(1);if($===o)return y(7);var M=(d={},d[s]=e,d[u]=n,d[i]=t,d)[$]||1,m=this.$d.getTime()+r*M;return b.w(m,this)},m.subtract=function(t,e){return this.add(-1*t,e)},m.format=function(t){var e=this,n=this.$locale();if(!this.isValid())return n.invalidDate||l;var r=t||\"YYYY-MM-DDTHH:mm:ssZ\",i=b.z(this),s=this.$H,u=this.$m,a=this.$M,o=n.weekdays,c=n.months,f=n.meridiem,h=function(t,n,i,s){return t&&(t[n]||t(e,r))||i[n].slice(0,s)},d=function(t){return b.s(s%12||12,t,\"0\")},$=f||function(t,e,n){var r=t<12?\"AM\":\"PM\";return n?r.toLowerCase():r};return r.replace(y,(function(t,r){return r||function(t){switch(t){case\"YY\":return String(e.$y).slice(-2);case\"YYYY\":return b.s(e.$y,4,\"0\");case\"M\":return a+1;case\"MM\":return b.s(a+1,2,\"0\");case\"MMM\":return h(n.monthsShort,a,c,3);case\"MMMM\":return h(c,a);case\"D\":return e.$D;case\"DD\":return b.s(e.$D,2,\"0\");case\"d\":return String(e.$W);case\"dd\":return h(n.weekdaysMin,e.$W,o,2);case\"ddd\":return h(n.weekdaysShort,e.$W,o,3);case\"dddd\":return o[e.$W];case\"H\":return String(s);case\"HH\":return b.s(s,2,\"0\");case\"h\":return d(1);case\"hh\":return d(2);case\"a\":return $(s,u,!0);case\"A\":return $(s,u,!1);case\"m\":return String(u);case\"mm\":return b.s(u,2,\"0\");case\"s\":return String(e.$s);case\"ss\":return b.s(e.$s,2,\"0\");case\"SSS\":return b.s(e.$ms,3,\"0\");case\"Z\":return i}return null}(t)||i.replace(\":\",\"\")}))},m.utcOffset=function(){return 15*-Math.round(this.$d.getTimezoneOffset()/15)},m.diff=function(r,d,l){var $,y=this,M=b.p(d),m=O(r),v=(m.utcOffset()-this.utcOffset())*e,g=this-m,D=function(){return b.m(y,m)};switch(M){case h:$=D()/12;break;case c:$=D();break;case f:$=D()/3;break;case o:$=(g-v)/6048e5;break;case a:$=(g-v)/864e5;break;case u:$=g/n;break;case s:$=g/e;break;case i:$=g/t;break;default:$=g}return l?$:b.a($)},m.daysInMonth=function(){return this.endOf(c).$D},m.$locale=function(){return D[this.$L]},m.locale=function(t,e){if(!t)return this.$L;var n=this.clone(),r=w(t,e,!0);return r&&(n.$L=r),n},m.clone=function(){return b.w(this.$d,this)},m.toDate=function(){return new Date(this.valueOf())},m.toJSON=function(){return this.isValid()?this.toISOString():null},m.toISOString=function(){return this.$d.toISOString()},m.toString=function(){return this.$d.toUTCString()},M}(),k=_.prototype;return O.prototype=k,[[\"$ms\",r],[\"$s\",i],[\"$m\",s],[\"$H\",u],[\"$W\",a],[\"$M\",c],[\"$y\",h],[\"$D\",d]].forEach((function(t){k[t[1]]=function(e){return this.$g(e,t[0],t[1])}})),O.extend=function(t,e){return t.$i||(t(e,_,O),t.$i=!0),O},O.locale=w,O.isDayjs=S,O.unix=function(t){return O(1e3*t)},O.en=D[g],O.Ls=D,O.p={},O}));\n},{}],29:[function(require,module,exports){\n!function(e,t){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=t():\"function\"==typeof define&&define.amd?define(t):(e=\"undefined\"!=typeof globalThis?globalThis:e||self).dayjs_plugin_advancedFormat=t()}(this,(function(){\"use strict\";return function(e,t){var r=t.prototype,n=r.format;r.format=function(e){var t=this,r=this.$locale();if(!this.isValid())return n.bind(this)(e);var s=this.$utils(),a=(e||\"YYYY-MM-DDTHH:mm:ssZ\").replace(/\\[([^\\]]+)]|Q|wo|ww|w|WW|W|zzz|z|gggg|GGGG|Do|X|x|k{1,2}|S/g,(function(e){switch(e){case\"Q\":return Math.ceil((t.$M+1)/3);case\"Do\":return r.ordinal(t.$D);case\"gggg\":return t.weekYear();case\"GGGG\":return t.isoWeekYear();case\"wo\":return r.ordinal(t.week(),\"W\");case\"w\":case\"ww\":return s.s(t.week(),\"w\"===e?1:2,\"0\");case\"W\":case\"WW\":return s.s(t.isoWeek(),\"W\"===e?1:2,\"0\");case\"k\":case\"kk\":return s.s(String(0===t.$H?24:t.$H),\"k\"===e?1:2,\"0\");case\"X\":return Math.floor(t.$d.getTime()/1e3);case\"x\":return t.$d.getTime();case\"z\":return\"[\"+t.offsetName()+\"]\";case\"zzz\":return\"[\"+t.offsetName(\"long\")+\"]\";default:return e}}));return n.bind(this)(a)}}}));\n},{}],30:[function(require,module,exports){\n!function(e,t){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=t():\"function\"==typeof define&&define.amd?define(t):(e=\"undefined\"!=typeof globalThis?globalThis:e||self).dayjs_plugin_isoWeek=t()}(this,(function(){\"use strict\";var e=\"day\";return function(t,i,s){var a=function(t){return t.add(4-t.isoWeekday(),e)},d=i.prototype;d.isoWeekYear=function(){return a(this).year()},d.isoWeek=function(t){if(!this.$utils().u(t))return this.add(7*(t-this.isoWeek()),e);var i,d,n,o,r=a(this),u=(i=this.isoWeekYear(),d=this.$u,n=(d?s.utc:s)().year(i).startOf(\"year\"),o=4-n.isoWeekday(),n.isoWeekday()>4&&(o+=7),n.add(o,e));return r.diff(u,\"week\")+1},d.isoWeekday=function(e){return this.$utils().u(e)?this.day()||7:this.day(this.day()%7?e:e-7)};var n=d.startOf;d.startOf=function(e,t){var i=this.$utils(),s=!!i.u(t)||t;return\"isoweek\"===i.p(e)?s?this.date(this.date()-(this.isoWeekday()-1)).startOf(\"day\"):this.date(this.date()-1-(this.isoWeekday()-1)+7).endOf(\"day\"):n.bind(this)(e,t)}}}));\n},{}],31:[function(require,module,exports){\n!function(r,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=e():\"function\"==typeof define&&define.amd?define(e):(r=\"undefined\"!=typeof globalThis?globalThis:r||self).dayjs_plugin_relativeTime=e()}(this,(function(){\"use strict\";return function(r,e,t){r=r||{};var n=e.prototype,o={future:\"in %s\",past:\"%s ago\",s:\"a few seconds\",m:\"a minute\",mm:\"%d minutes\",h:\"an hour\",hh:\"%d hours\",d:\"a day\",dd:\"%d days\",M:\"a month\",MM:\"%d months\",y:\"a year\",yy:\"%d years\"};function i(r,e,t,o){return n.fromToBase(r,e,t,o)}t.en.relativeTime=o,n.fromToBase=function(e,n,i,d,u){for(var f,a,s,l=i.$locale().relativeTime||o,h=r.thresholds||[{l:\"s\",r:44,d:\"second\"},{l:\"m\",r:89},{l:\"mm\",r:44,d:\"minute\"},{l:\"h\",r:89},{l:\"hh\",r:21,d:\"hour\"},{l:\"d\",r:35},{l:\"dd\",r:25,d:\"day\"},{l:\"M\",r:45},{l:\"MM\",r:10,d:\"month\"},{l:\"y\",r:17},{l:\"yy\",d:\"year\"}],m=h.length,c=0;c<m;c+=1){var y=h[c];y.d&&(f=d?t(e).diff(i,y.d,!0):i.diff(e,y.d,!0));var p=(r.rounding||Math.round)(Math.abs(f));if(s=f>0,p<=y.r||!y.r){p<=1&&c>0&&(y=h[c-1]);var v=l[y.l];u&&(p=u(\"\"+p)),a=\"string\"==typeof v?v.replace(\"%d\",p):v(p,n,y.l,s);break}}if(n)return a;var M=s?l.future:l.past;return\"function\"==typeof M?M(a):M.replace(\"%s\",a)},n.to=function(r,e){return i(r,e,this,!0)},n.from=function(r,e){return i(r,e,this)};var d=function(r){return r.$u?t.utc():t()};n.toNow=function(r){return this.to(d(this),r)},n.fromNow=function(r){return this.from(d(this),r)}}}));\n},{}],32:[function(require,module,exports){\n!function(t,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=e():\"function\"==typeof define&&define.amd?define(e):(t=\"undefined\"!=typeof globalThis?globalThis:t||self).dayjs_plugin_timezone=e()}(this,(function(){\"use strict\";var t={year:0,month:1,day:2,hour:3,minute:4,second:5},e={};return function(n,i,o){var r,a=function(t,n,i){void 0===i&&(i={});var o=new Date(t),r=function(t,n){void 0===n&&(n={});var i=n.timeZoneName||\"short\",o=t+\"|\"+i,r=e[o];return r||(r=new Intl.DateTimeFormat(\"en-US\",{hour12:!1,timeZone:t,year:\"numeric\",month:\"2-digit\",day:\"2-digit\",hour:\"2-digit\",minute:\"2-digit\",second:\"2-digit\",timeZoneName:i}),e[o]=r),r}(n,i);return r.formatToParts(o)},u=function(e,n){for(var i=a(e,n),r=[],u=0;u<i.length;u+=1){var f=i[u],s=f.type,m=f.value,c=t[s];c>=0&&(r[c]=parseInt(m,10))}var d=r[3],l=24===d?0:d,h=r[0]+\"-\"+r[1]+\"-\"+r[2]+\" \"+l+\":\"+r[4]+\":\"+r[5]+\":000\",v=+e;return(o.utc(h).valueOf()-(v-=v%1e3))/6e4},f=i.prototype;f.tz=function(t,e){void 0===t&&(t=r);var n=this.utcOffset(),i=this.toDate(),a=i.toLocaleString(\"en-US\",{timeZone:t}),u=Math.round((i-new Date(a))/1e3/60),f=o(a,{locale:this.$L}).$set(\"millisecond\",this.$ms).utcOffset(15*-Math.round(i.getTimezoneOffset()/15)-u,!0);if(e){var s=f.utcOffset();f=f.add(n-s,\"minute\")}return f.$x.$timezone=t,f},f.offsetName=function(t){var e=this.$x.$timezone||o.tz.guess(),n=a(this.valueOf(),e,{timeZoneName:t}).find((function(t){return\"timezonename\"===t.type.toLowerCase()}));return n&&n.value};var s=f.startOf;f.startOf=function(t,e){if(!this.$x||!this.$x.$timezone)return s.call(this,t,e);var n=o(this.format(\"YYYY-MM-DD HH:mm:ss:SSS\"),{locale:this.$L});return s.call(n,t,e).tz(this.$x.$timezone,!0)},o.tz=function(t,e,n){var i=n&&e,a=n||e||r,f=u(+o(),a);if(\"string\"!=typeof t)return o(t).tz(a);var s=function(t,e,n){var i=t-60*e*1e3,o=u(i,n);if(e===o)return[i,e];var r=u(i-=60*(o-e)*1e3,n);return o===r?[i,o]:[t-60*Math.min(o,r)*1e3,Math.max(o,r)]}(o.utc(t,i).valueOf(),f,a),m=s[0],c=s[1],d=o(m).utcOffset(c);return d.$x.$timezone=a,d},o.tz.guess=function(){return Intl.DateTimeFormat().resolvedOptions().timeZone},o.tz.setDefault=function(t){r=t}}}));\n},{}],33:[function(require,module,exports){\n!function(t,i){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=i():\"function\"==typeof define&&define.amd?define(i):(t=\"undefined\"!=typeof globalThis?globalThis:t||self).dayjs_plugin_utc=i()}(this,(function(){\"use strict\";var t=\"minute\",i=/[+-]\\d\\d(?::?\\d\\d)?/g,e=/([+-]|\\d\\d)/g;return function(s,f,n){var u=f.prototype;n.utc=function(t){var i={date:t,utc:!0,args:arguments};return new f(i)},u.utc=function(i){var e=n(this.toDate(),{locale:this.$L,utc:!0});return i?e.add(this.utcOffset(),t):e},u.local=function(){return n(this.toDate(),{locale:this.$L,utc:!1})};var o=u.parse;u.parse=function(t){t.utc&&(this.$u=!0),this.$utils().u(t.$offset)||(this.$offset=t.$offset),o.call(this,t)};var r=u.init;u.init=function(){if(this.$u){var t=this.$d;this.$y=t.getUTCFullYear(),this.$M=t.getUTCMonth(),this.$D=t.getUTCDate(),this.$W=t.getUTCDay(),this.$H=t.getUTCHours(),this.$m=t.getUTCMinutes(),this.$s=t.getUTCSeconds(),this.$ms=t.getUTCMilliseconds()}else r.call(this)};var a=u.utcOffset;u.utcOffset=function(s,f){var n=this.$utils().u;if(n(s))return this.$u?0:n(this.$offset)?a.call(this):this.$offset;if(\"string\"==typeof s&&(s=function(t){void 0===t&&(t=\"\");var s=t.match(i);if(!s)return null;var f=(\"\"+s[0]).match(e)||[\"-\",0,0],n=f[0],u=60*+f[1]+ +f[2];return 0===u?0:\"+\"===n?u:-u}(s),null===s))return this;var u=Math.abs(s)<=16?60*s:s,o=this;if(f)return o.$offset=u,o.$u=0===s,o;if(0!==s){var r=this.$u?this.toDate().getTimezoneOffset():-1*this.utcOffset();(o=this.local().add(u+r,t)).$offset=u,o.$x.$localOffset=r}else o=this.utc();return o};var h=u.format;u.format=function(t){var i=t||(this.$u?\"YYYY-MM-DDTHH:mm:ss[Z]\":\"\");return h.call(this,i)},u.valueOf=function(){var t=this.$utils().u(this.$offset)?0:this.$offset+(this.$x.$localOffset||this.$d.getTimezoneOffset());return this.$d.valueOf()-6e4*t},u.isUTC=function(){return!!this.$u},u.toISOString=function(){return this.toDate().toISOString()},u.toString=function(){return this.toDate().toUTCString()};var l=u.toDate;u.toDate=function(t){return\"s\"===t&&this.$offset?n(this.format(\"YYYY-MM-DD HH:mm:ss:SSS\")).toDate():l.call(this)};var c=u.diff;u.diff=function(t,i,e){if(t&&this.$u===t.$u)return c.call(this,t,i,e);var s=this.local(),f=n(t).local();return c.call(s,f,i,e)}}}));\n},{}],34:[function(require,module,exports){\n!function(e,t){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=t():\"function\"==typeof define&&define.amd?define(t):(e=\"undefined\"!=typeof globalThis?globalThis:e||self).dayjs_plugin_weekOfYear=t()}(this,(function(){\"use strict\";var e=\"week\",t=\"year\";return function(i,n,r){var f=n.prototype;f.week=function(i){if(void 0===i&&(i=null),null!==i)return this.add(7*(i-this.week()),\"day\");var n=this.$locale().yearStart||1;if(11===this.month()&&this.date()>25){var f=r(this).startOf(t).add(1,t).date(n),s=r(this).endOf(e);if(f.isBefore(s))return 1}var a=r(this).startOf(t).date(n).startOf(e).subtract(1,\"millisecond\"),o=this.diff(a,e,!0);return o<0?r(this).startOf(\"week\").week():Math.ceil(o)},f.weeks=function(e){return void 0===e&&(e=null),this.week(e)}}}));\n},{}],35:[function(require,module,exports){\n!function(e,t){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=t():\"function\"==typeof define&&define.amd?define(t):(e=\"undefined\"!=typeof globalThis?globalThis:e||self).dayjs_plugin_weekday=t()}(this,(function(){\"use strict\";return function(e,t){t.prototype.weekday=function(e){var t=this.$locale().weekStart||0,i=this.$W,n=(i<t?i+7:i)-t;return this.$utils().u(e)?n:this.subtract(n,\"day\").add(e,\"day\")}}}));\n},{}],36:[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},{}],37:[function(require,module,exports){\n/**\n* Base Logger Class\n*\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\nconst libFableServiceProviderBase = require('fable-serviceproviderbase').CoreServiceProviderBase;\n\nclass BaseLogger extends libFableServiceProviderBase\n{\n\tconstructor(pLogStreamSettings, pLogStreamHash)\n\t{\n\t\tsuper(pLogStreamSettings, pLogStreamHash);\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\tthis.serviceType = 'Logging-Provider';\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},{\"fable-serviceproviderbase\":44}],38:[function(require,module,exports){\n/**\n* Default Logger Provider Function\n*\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\":40}],39:[function(require,module,exports){\nmodule.exports=[\n {\n \"loggertype\": \"console\",\n \"streamtype\": \"console\",\n \"level\": \"trace\"\n }\n]\n},{}],40:[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\":37}],41:[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\":40,\"fs\":19,\"path\":73}],42:[function(require,module,exports){\n/**\n* Fable Logging Service\n*/\n\nconst libFableServiceProviderBase = require('fable-serviceproviderbase').CoreServiceProviderBase;\n\nclass FableLog extends libFableServiceProviderBase\n{\n\tconstructor(pSettings, pServiceHash)\n\t{\n\t\tsuper(pSettings, pServiceHash);\n\n\t\tthis.serviceType = 'Logging';\n\n\t\tlet tmpSettings = (typeof(pSettings) === 'object') ? pSettings : {}\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\nmodule.exports = FableLog;\nmodule.exports.LogProviderBase = require('./Fable-Log-BaseLogger.js');\nmodule.exports.LogProviderConsole = require('./Fable-Log-Logger-Console.js');\nmodule.exports.LogProviderFlatfile = require('./Fable-Log-Logger-SimpleFlatFile.js');\n\n},{\"./Fable-Log-BaseLogger.js\":37,\"./Fable-Log-DefaultProviders-Node.js\":38,\"./Fable-Log-DefaultStreams.json\":39,\"./Fable-Log-Logger-Console.js\":40,\"./Fable-Log-Logger-SimpleFlatFile.js\":41,\"fable-serviceproviderbase\":44}],43:[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* @author <steven@velozo.com>\n*/\n\nclass FableCoreServiceProviderBase\n{\n\tconstructor(pOptions, pServiceHash)\n\t{\n\t\tthis.fable = false;\n\n\t\tthis.options = (typeof(pOptions) === 'object') ? pOptions : {};\n\n\t\tthis.serviceType = 'Unknown';\n\n\t\t// The hash will be a non-standard UUID ... the UUID service uses this base class!\n\t\tthis.UUID = `CORESVC-${Math.floor((Math.random() * (99999 - 10000)) + 10000)}`;\n\n\t\tthis.Hash = (typeof(pServiceHash) === 'string') ? pServiceHash : `${this.UUID}`;\n\t}\n\n\n\tstatic isFableService = true;\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 = FableCoreServiceProviderBase;\n\n},{}],44:[function(require,module,exports){\n/**\n* Fable Service Base\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\t\t\t\t\t\t: ((typeof(pFable) === 'object') && !pFable.isFable) ? pFable\n\t\t\t\t\t\t: {};\n\n\t\tthis.serviceType = 'Unknown';\n\n\t\tif (typeof(pFable.getUUID) == 'function')\n\t\t{\n\t\t\tthis.UUID = pFable.getUUID();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.UUID = `NoFABLESVC-${Math.floor((Math.random() * (99999 - 10000)) + 10000)}`\n\t\t}\n\n\t\tthis.Hash = (typeof(pServiceHash) === 'string') ? pServiceHash : `${this.UUID}`;\n\n\t\t// Pull back a few things\n\t\tthis.log = this.fable.log;\n\t\tthis.servicesMap = this.fable.servicesMap;\n\t\tthis.services = this.fable.services;\n\t}\n\n\tstatic isFableService = true;\n}\n\nmodule.exports = FableServiceProviderBase;\n\nmodule.exports.CoreServiceProviderBase = require('./Fable-ServiceProviderBase-Preinit.js');\n},{\"./Fable-ServiceProviderBase-Preinit.js\":43}],45:[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},{}],46:[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*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\nconst libPrecedent = require('precedent');\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 libPrecedent();\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\tconst tmpDefaultValue = tmpSeparatorIndex >= 0 ? 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\n}).call(this)}).call(this,require('_process'))\n\n},{\"_process\":77,\"precedent\":74}],47:[function(require,module,exports){\n/**\n* Fable Settings Add-on\n*\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\n\nconst libFableServiceProviderBase = require('fable-serviceproviderbase').CoreServiceProviderBase;\n\nconst libFableSettingsTemplateProcessor = require('./Fable-Settings-TemplateProcessor.js');\n\nclass FableSettings extends libFableServiceProviderBase\n{\n\tconstructor(pSettings, pServiceHash)\n\t{\n\t\tsuper(pSettings, pServiceHash);\n\n\t\tthis.serviceType = 'SettingsManager';\n\n\t\t// Initialize the settings value template processor\n\t\tthis.settingsTemplateProcessor = new libFableSettingsTemplateProcessor();\n\n\t\t// set straight away so anything that uses it respects the initial setting\n\t\tthis._configureEnvTemplating(pSettings);\n\n\t\tthis.default = this.buildDefaultSettings();\n\n\t\t// Construct a new settings object\n\t\tlet tmpSettings = this.merge(pSettings, 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;\n},{\"./Fable-Settings-Default\":45,\"./Fable-Settings-TemplateProcessor.js\":46,\"fable-serviceproviderbase\":44}],48:[function(require,module,exports){\n/**\n* Random Byte Generator - Browser version\n*\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},{}],49:[function(require,module,exports){\n/**\n* Fable UUID Generator\n*/\n\nconst libFableServiceProviderBase = require('fable-serviceproviderbase').CoreServiceProviderBase;0\n\nconst libRandomByteGenerator = require('./Fable-UUID-Random.js')\n\nclass FableUUID extends libFableServiceProviderBase\n{\n\tconstructor(pSettings, pServiceHash)\n\t{\n\t\tsuper(pSettings, pServiceHash);\n\n\t\tthis.serviceType = 'UUID';\n\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\":48,\"fable-serviceproviderbase\":44}],50:[function(require,module,exports){\n'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar slice = Array.prototype.slice;\nvar toStr = Object.prototype.toString;\nvar funcType = '[object Function]';\n\nmodule.exports = function bind(that) {\n var target = this;\n if (typeof target !== 'function' || toStr.call(target) !== funcType) {\n throw new TypeError(ERROR_MESSAGE + target);\n }\n var args = slice.call(arguments, 1);\n\n var bound;\n var binder = function () {\n if (this instanceof bound) {\n var result = target.apply(\n this,\n args.concat(slice.call(arguments))\n );\n if (Object(result) === result) {\n return result;\n }\n return this;\n } else {\n return target.apply(\n that,\n args.concat(slice.call(arguments))\n );\n }\n };\n\n var boundLength = Math.max(0, target.length - args.length);\n var boundArgs = [];\n for (var i = 0; i < boundLength; i++) {\n boundArgs.push('$' + i);\n }\n\n bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder);\n\n if (target.prototype) {\n var Empty = function Empty() {};\n Empty.prototype = target.prototype;\n bound.prototype = new Empty();\n Empty.prototype = null;\n }\n\n return bound;\n};\n\n},{}],51:[function(require,module,exports){\n'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n\n},{\"./implementation\":50}],52:[function(require,module,exports){\n'use strict';\n\nvar undefined;\n\nvar $SyntaxError = SyntaxError;\nvar $Function = Function;\nvar $TypeError = TypeError;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = Object.getOwnPropertyDescriptor;\nif ($gOPD) {\n\ttry {\n\t\t$gOPD({}, '');\n\t} catch (e) {\n\t\t$gOPD = null; // this is IE 8, which has a broken gOPD\n\t}\n}\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = require('has-symbols')();\nvar hasProto = require('has-proto')();\n\nvar getProto = Object.getPrototypeOf || (\n\thasProto\n\t\t? function (x) { return x.__proto__; } // eslint-disable-line no-proto\n\t\t: null\n);\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' || !getProto ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols && getProto ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%BigInt64Array%': typeof BigInt64Array === 'undefined' ? undefined : BigInt64Array,\n\t'%BigUint64Array%': typeof BigUint64Array === 'undefined' ? undefined : BigUint64Array,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': EvalError,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols && getProto ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': Object,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': RangeError,\n\t'%ReferenceError%': ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols && getProto ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet\n};\n\nif (getProto) {\n\ttry {\n\t\tnull.error; // eslint-disable-line no-unused-expressions\n\t} catch (e) {\n\t\t// https://github.com/tc39/proposal-shadowrealm/pull/384#issuecomment-1364264229\n\t\tvar errorProto = getProto(getProto(e));\n\t\tINTRINSICS['%Error.prototype%'] = errorProto;\n\t}\n}\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen && getProto) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = require('function-bind');\nvar hasOwn = require('has');\nvar $concat = bind.call(Function.call, Array.prototype.concat);\nvar $spliceApply = bind.call(Function.apply, Array.prototype.splice);\nvar $replace = bind.call(Function.call, String.prototype.replace);\nvar $strSlice = bind.call(Function.call, String.prototype.slice);\nvar $exec = bind.call(Function.call, RegExp.prototype.exec);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tif ($exec(/^%?[^%]*%?$/, name) === null) {\n\t\tthrow new $SyntaxError('`%` may not be present anywhere but at the beginning and end of the intrinsic name');\n\t}\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n\n},{\"function-bind\":51,\"has\":56,\"has-proto\":53,\"has-symbols\":54}],53:[function(require,module,exports){\n'use strict';\n\nvar test = {\n\tfoo: {}\n};\n\nvar $Object = Object;\n\nmodule.exports = function hasProto() {\n\treturn { __proto__: test }.foo === test.foo && !({ __proto__: null } instanceof $Object);\n};\n\n},{}],54:[function(require,module,exports){\n'use strict';\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = require('./shams');\n\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n\n},{\"./shams\":55}],55:[function(require,module,exports){\n'use strict';\n\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (sym in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\tvar descriptor = Object.getOwnPropertyDescriptor(obj, sym);\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n\n},{}],56:[function(require,module,exports){\n'use strict';\n\nvar bind = require('function-bind');\n\nmodule.exports = bind.call(Function.call, Object.prototype.hasOwnProperty);\n\n},{\"function-bind\":51}],57:[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\":91,\"url\":112}],58:[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},{}],59:[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},{}],60:[function(require,module,exports){\n// When a boxed property is passed in, it should have quotes of some\n// kind around it.\n//\n// For instance:\n// \t\tMyValues['Name']\n// \t\tMyValues[\"Age\"]\n// \t\tMyValues[`Cost`]\n//\n// This function removes the wrapping quotes.\n//\n// Please note it *DOES NOT PARSE* template literals, so backticks just\n// end up doing the same thing as other quote types.\n//\n// TODO: Should template literals be processed? If so what state do they have access to? That should happen here if so.\n// TODO: Make a simple class include library with these\nconst cleanWrapCharacters = (pCharacter, pString) =>\n{\n\tif (pString.startsWith(pCharacter) && pString.endsWith(pCharacter))\n\t{\n\t\treturn pString.substring(1, pString.length - 1);\n\t}\n\telse\n\t{\n\t\treturn pString;\n\t}\n};\n\nmodule.exports = cleanWrapCharacters;\n},{}],61:[function(require,module,exports){\n/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\n\n/**\n* Hash Translation\n*\n* This is a very simple translation table for hashes, which allows the same schema to resolve\n* differently based on a loaded translation table.\n*\n* This is to prevent the requirement for mutating schemas over and over again when we want to\n* reuse the structure but look up data elements by different addresses.\n*\n* One side-effect of this is that a translation table can \"override\" the built-in hashes, since\n* this is always used to resolve hashes before any of the functionCallByHash(pHash, ...) perform\n* their lookups by hash.\n*\n* @class ManyfestHashTranslation\n*/\nclass ManyfestHashTranslation\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) === 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) === 'function') ? pErrorLog : libSimpleLog;\n\n this.translationTable = {};\n\t}\n\n translationCount()\n {\n return Object.keys(this.translationTable).length;\n }\n\n addTranslation(pTranslation)\n {\n // This adds a translation in the form of:\n // { \"SourceHash\": \"DestinationHash\", \"SecondSourceHash\":\"SecondDestinationHash\" }\n if (typeof(pTranslation) != 'object')\n {\n this.logError(`Hash translation addTranslation expected a translation be type object but was passed in ${typeof(pTranslation)}`);\n return false;\n }\n\n let tmpTranslationSources = Object.keys(pTranslation)\n\n tmpTranslationSources.forEach(\n (pTranslationSource) =>\n {\n if (typeof(pTranslation[pTranslationSource]) != 'string')\n {\n this.logError(`Hash translation addTranslation expected a translation destination hash for [${pTranslationSource}] to be a string but the referrant was a ${typeof(pTranslation[pTranslationSource])}`);\n }\n else\n {\n this.translationTable[pTranslationSource] = pTranslation[pTranslationSource];\n }\n });\n }\n\n removeTranslationHash(pTranslationHash)\n {\n if (this.translationTable.hasOwnProperty(pTranslationHash))\n {\n delete this.translationTable[pTranslationHash];\n }\n }\n\n // This removes translations.\n // If passed a string, just removes the single one.\n // If passed an object, it does all the source keys.\n removeTranslation(pTranslation)\n {\n if (typeof(pTranslation) == 'string')\n {\n this.removeTranslationHash(pTranslation);\n return true;\n }\n else if (typeof(pTranslation) == 'object')\n {\n let tmpTranslationSources = Object.keys(pTranslation)\n\n tmpTranslationSources.forEach(\n (pTranslationSource) =>\n {\n this.removeTranslation(pTranslationSource);\n });\n return true;\n }\n else\n {\n this.logError(`Hash translation removeTranslation expected either a string or an object but the passed-in translation was type ${typeof(pTranslation)}`);\n return false;\n }\n }\n\n clearTranslations()\n {\n this.translationTable = {};\n }\n\n translate(pTranslation)\n {\n if (this.translationTable.hasOwnProperty(pTranslation))\n {\n return this.translationTable[pTranslation];\n }\n else\n {\n return pTranslation;\n }\n }\n}\n\nmodule.exports = ManyfestHashTranslation;\n},{\"./Manyfest-LogToConsole.js\":62}],62:[function(require,module,exports){\n/**\n* @author <steven@velozo.com>\n*/\n\n/**\n* Manyfest simple logging shim (for browser and dependency-free running)\n*/\n\nconst logToConsole = (pLogLine, pLogObject) =>\n{\n let tmpLogLine = (typeof(pLogLine) === 'string') ? pLogLine : '';\n\n console.log(`[Manyfest] ${tmpLogLine}`);\n\n if (pLogObject) console.log(JSON.stringify(pLogObject));\n};\n\nmodule.exports = logToConsole;\n},{}],63:[function(require,module,exports){\n/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\n\n/**\n* Object Address Resolver\n*\n* IMPORTANT NOTE: This code is intentionally more verbose than necessary, to\n* be extremely clear what is going on in the recursion for\n* each of the three address resolution functions.\n*\n* Although there is some opportunity to repeat ourselves a\n* bit less in this codebase (e.g. with detection of arrays\n* versus objects versus direct properties), it can make\n* debugging.. challenging. The minified version of the code\n* optimizes out almost anything repeated in here. So please\n* be kind and rewind... meaning please keep the codebase less\n* terse and more verbose so humans can comprehend it.\n*\n*\n* @class ManyfestObjectAddressResolverCheckAddressExists\n*/\nclass ManyfestObjectAddressResolverCheckAddressExists\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) == 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;\n\t}\n\n\t// Check if an address exists.\n\t//\n\t// This is necessary because the getValueAtAddress function is ambiguous on\n\t// whether the element/property is actually there or not (it returns\n\t// undefined whether the property exists or not). This function checks for\n\t// existance and returns true or false dependent.\n\tcheckAddressExists (pObject, pAddress)\n\t{\n\t\t// TODO: Should these throw an error?\n\t\t// Make sure pObject is an object\n\t\tif (typeof(pObject) != 'object') return false;\n\t\t// Make sure pAddress is a string\n\t\tif (typeof(pAddress) != 'string') return false;\n\n\t\t// TODO: Make this work for things like SomeRootObject.Metadata[\"Some.People.Use.Bad.Object.Property.Names\"]\n\t\tlet tmpSeparatorIndex = pAddress.indexOf('.');\n\n\t\t// This is the terminal address string (no more dots so the RECUSION ENDS IN HERE somehow)\n\t\tif (tmpSeparatorIndex == -1)\n\t\t{\n\t\t\t// Check if the address refers to a boxed property\n\t\t\tlet tmpBracketStartIndex = pAddress.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = pAddress.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[10]\n\t\t\t// \t\tMyValues['Name']\n\t\t\t// \t\tMyValues[\"Age\"]\n\t\t\t// \t\tMyValues[`Cost`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\t// The \"Name\" of the Object contained too the left of the bracket\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\t// If the subproperty doesn't test as a proper Object, none of the rest of this is possible.\n\t\t\t\t// This is a rare case where Arrays testing as Objects is useful\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) !== 'object')\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// The \"Reference\" to the property within it, either an array element or object property\n\t\t\t\tlet tmpBoxedPropertyReference = pAddress.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\t\t\t\t// Attempt to parse the reference as a number, which will be used as an array element\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to treat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynamic object property.\n\t\t\t\t\t// We would expect the property to be wrapped in some kind of quotes so strip them\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Check if the property exists.\n\t\t\t\t\treturn pObject[tmpBoxedPropertyName].hasOwnProperty(tmpBoxedPropertyReference);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// Use the new in operator to see if the element is in the array\n\t\t\t\t\treturn (tmpBoxedPropertyNumber in pObject[tmpBoxedPropertyName]);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Check if the property exists\n\t\t\t\treturn pObject.hasOwnProperty(pAddress);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlet tmpSubObjectName = pAddress.substring(0, tmpSeparatorIndex);\n\t\t\tlet tmpNewAddress = pAddress.substring(tmpSeparatorIndex+1);\n\n\t\t\t// Test if the tmpNewAddress is an array or object\n\t\t\t// Check if it's a boxed property\n\t\t\tlet tmpBracketStartIndex = tmpSubObjectName.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = tmpSubObjectName.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[42]\n\t\t\t// \t\tMyValues['Color']\n\t\t\t// \t\tMyValues[\"Weight\"]\n\t\t\t// \t\tMyValues[`Diameter`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = tmpSubObjectName.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyReference = tmpSubObjectName.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[1].Tardy\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an object, so the [1].Tardy is not possible to access\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[\"JaneDoe\"].Grade\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an array, so the [\"JaneDoe\"].Grade is not possible to access\n\t\t\t\t// TODO: Should this be an error or something? Should we keep a log of failures like this?\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// Because this is an impossible address, the property doesn't exist\n\t\t\t\t\t// TODO: Should we throw an error in this condition?\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t//This is a bracketed value\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to reat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynanmic object property.\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Recurse directly into the subobject\n\t\t\t\t\treturn this.checkAddressExists(pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference], tmpNewAddress);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// We parsed a valid number out of the boxed property name, so recurse into the array\n\t\t\t\t\treturn this.checkAddressExists(pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber], tmpNewAddress);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// If there is an object property already named for the sub object, but it isn't an object\n\t\t\t// then the system can't set the value in there. Error and abort!\n\t\t\tif (pObject.hasOwnProperty(tmpSubObjectName) && typeof(pObject[tmpSubObjectName]) !== 'object')\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\telse if (pObject.hasOwnProperty(tmpSubObjectName))\n\t\t\t{\n\t\t\t\t// If there is already a subobject pass that to the recursive thingy\n\t\t\t\treturn this.checkAddressExists(pObject[tmpSubObjectName], tmpNewAddress);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Create a subobject and then pass that\n\t\t\t\tpObject[tmpSubObjectName] = {};\n\t\t\t\treturn this.checkAddressExists(pObject[tmpSubObjectName], tmpNewAddress);\n\t\t\t}\n\t\t}\n\t}\n};\n\nmodule.exports = ManyfestObjectAddressResolverCheckAddressExists;\n},{\"./Manyfest-LogToConsole.js\":62}],64:[function(require,module,exports){\n/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\nlet fCleanWrapCharacters = require('./Manyfest-CleanWrapCharacters.js');\nlet fParseConditionals = require(`../source/Manyfest-ParseConditionals.js`)\n\n/**\n* Object Address Resolver - DeleteValue\n*\n* IMPORTANT NOTE: This code is intentionally more verbose than necessary, to\n* be extremely clear what is going on in the recursion for\n* each of the three address resolution functions.\n*\n* Although there is some opportunity to repeat ourselves a\n* bit less in this codebase (e.g. with detection of arrays\n* versus objects versus direct properties), it can make\n* debugging.. challenging. The minified version of the code\n* optimizes out almost anything repeated in here. So please\n* be kind and rewind... meaning please keep the codebase less\n* terse and more verbose so humans can comprehend it.\n*\n* TODO: Once we validate this pattern is good to go, break these out into\n* three separate modules.\n*\n* @class ManyfestObjectAddressResolverDeleteValue\n*/\nclass ManyfestObjectAddressResolverDeleteValue\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) == 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;\n\n\t\tthis.cleanWrapCharacters = fCleanWrapCharacters;\n\t}\n\n\t// TODO: Dry me\n\tcheckFilters(pAddress, pRecord)\n\t{\n\t\treturn fParseConditionals(this, pAddress, pRecord);\n\t}\n\n\t// Delete the value of an element at an address\n\tdeleteValueAtAddress (pObject, pAddress, pParentAddress)\n\t{\n\t\t// Make sure pObject (the object we are meant to be recursing) is an object (which could be an array or object)\n\t\tif (typeof(pObject) != 'object') return undefined;\n\t\t// Make sure pAddress (the address we are resolving) is a string\n\t\tif (typeof(pAddress) != 'string') return undefined;\n\t\t// Stash the parent address for later resolution\n\t\tlet tmpParentAddress = \"\";\n\t\tif (typeof(pParentAddress) == 'string')\n\t\t{\n\t\t\ttmpParentAddress = pParentAddress;\n\t\t}\n\n\t\t// TODO: Make this work for things like SomeRootObject.Metadata[\"Some.People.Use.Bad.Object.Property.Names\"]\n\t\tlet tmpSeparatorIndex = pAddress.indexOf('.');\n\n\t\t// This is the terminal address string (no more dots so the RECUSION ENDS IN HERE somehow)\n\t\tif (tmpSeparatorIndex == -1)\n\t\t{\n\t\t\t// Check if the address refers to a boxed property\n\t\t\tlet tmpBracketStartIndex = pAddress.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = pAddress.indexOf(']');\n\n\t\t\t// Check for the Object Set Type marker.\n\t\t\t// Note this will not work with a bracket in the same address box set\n\t\t\tlet tmpObjectTypeMarkerIndex = pAddress.indexOf('{}');\n\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[10]\n\t\t\t// \t\tMyValues['Name']\n\t\t\t// \t\tMyValues[\"Age\"]\n\t\t\t// \t\tMyValues[`Cost`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\t// The \"Name\" of the Object contained too the left of the bracket\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\t// If the subproperty doesn't test as a proper Object, none of the rest of this is possible.\n\t\t\t\t// This is a rare case where Arrays testing as Objects is useful\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) !== 'object')\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// The \"Reference\" to the property within it, either an array element or object property\n\t\t\t\tlet tmpBoxedPropertyReference = pAddress.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\t\t\t\t// Attempt to parse the reference as a number, which will be used as an array element\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to treat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynamic object property.\n\t\t\t\t\t// We would expect the property to be wrapped in some kind of quotes so strip them\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Return the value in the property\n\t\t\t\t\tdelete pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference];\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tdelete pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber];\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// The requirements to detect a boxed set element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\telse if ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket is after the start bracket\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is nothing in the brackets\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex == 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tif (!Array.isArray(pObject[tmpBoxedPropertyName]))\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tlet tmpInputArray = pObject[tmpBoxedPropertyName];\n\t\t\t\t// Count from the end to the beginning so splice doesn't %&%#$ up the array\n\t\t\t\tfor (let i = tmpInputArray.length - 1; i >= 0; i--)\n\t\t\t\t{\n\t\t\t\t\t// The filtering is complex but allows config-based metaprogramming directly from schema\n\t\t\t\t\tlet tmpKeepRecord = this.checkFilters(pAddress, tmpInputArray[i]);\n\t\t\t\t\tif (tmpKeepRecord)\n\t\t\t\t\t{\n\t\t\t\t\t\t// Delete elements end to beginning\n\t\t\t\t\t\ttmpInputArray.splice(i, 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t// The object has been flagged as an object set, so treat it as such\n\t\t\telse if (tmpObjectTypeMarkerIndex > 0)\n\t\t\t{\n\t\t\t\tlet tmpObjectPropertyName = pAddress.substring(0, tmpObjectTypeMarkerIndex).trim();\n\n\t\t\t\tif (typeof(pObject[tmpObjectPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tdelete pObject[tmpObjectPropertyName];\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Now is the point in recursion to return the value in the address\n\t\t\t\tdelete pObject[pAddress];\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlet tmpSubObjectName = pAddress.substring(0, tmpSeparatorIndex);\n\t\t\tlet tmpNewAddress = pAddress.substring(tmpSeparatorIndex+1);\n\n\t\t\t// BOXED ELEMENTS\n\t\t\t// Test if the tmpNewAddress is an array or object\n\t\t\t// Check if it's a boxed property\n\t\t\tlet tmpBracketStartIndex = tmpSubObjectName.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = tmpSubObjectName.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[42]\n\t\t\t// \t\tMyValues['Color']\n\t\t\t// \t\tMyValues[\"Weight\"]\n\t\t\t// \t\tMyValues[`Diameter`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = tmpSubObjectName.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyReference = tmpSubObjectName.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[1].Tardy\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an object, so the [1].Tardy is not possible to access\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[\"JaneDoe\"].Grade\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an array, so the [\"JaneDoe\"].Grade is not possible to access\n\t\t\t\t// TODO: Should this be an error or something? Should we keep a log of failures like this?\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\t// Check if the boxed property is an object.\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\n\t\t\t\t//This is a bracketed value\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to reat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynanmic object property.\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\t\t// Recurse directly into the subobject\n\t\t\t\t\treturn this.deleteValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference], tmpNewAddress, tmpParentAddress);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\t\t// We parsed a valid number out of the boxed property name, so recurse into the array\n\t\t\t\t\treturn this.deleteValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber], tmpNewAddress, tmpParentAddress);\n\t\t\t\t}\n\t\t\t}\n\t\t\t// The requirements to detect a boxed set element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\telse if ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket is after the start bracket\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is nothing in the brackets\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex == 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tif (!Array.isArray(pObject[tmpBoxedPropertyName]))\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// We need to enumerate the array and grab the addresses from there.\n\t\t\t\tlet tmpArrayProperty = pObject[tmpBoxedPropertyName];\n\t\t\t\t// Managing the parent address is a bit more complex here -- the box will be added for each element.\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpBoxedPropertyName}`;\n\t\t\t\t// The container object is where we have the \"Address\":SOMEVALUE pairs\n\t\t\t\tlet tmpContainerObject = {};\n\t\t\t\tfor (let i = 0; i < tmpArrayProperty.length; i++)\n\t\t\t\t{\n\t\t\t\t\tlet tmpPropertyParentAddress = `${tmpParentAddress}[${i}]`;\n\t\t\t\t\tlet tmpValue = this.deleteValueAtAddress(pObject[tmpBoxedPropertyName][i], tmpNewAddress, tmpPropertyParentAddress);\n\n\t\t\t\t\ttmpContainerObject[`${tmpPropertyParentAddress}.${tmpNewAddress}`] = tmpValue;\n\t\t\t\t}\n\n\t\t\t\treturn tmpContainerObject;\n\t\t\t}\n\n\t\t\t// OBJECT SET\n\t\t\t// Note this will not work with a bracket in the same address box set\n\t\t\tlet tmpObjectTypeMarkerIndex = pAddress.indexOf('{}');\n\t\t\tif (tmpObjectTypeMarkerIndex > 0)\n\t\t\t{\n\t\t\t\tlet tmpObjectPropertyName = pAddress.substring(0, tmpObjectTypeMarkerIndex).trim();\n\n\t\t\t\tif (typeof(pObject[tmpObjectPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// We need to enumerate the Object and grab the addresses from there.\n\t\t\t\tlet tmpObjectProperty = pObject[tmpObjectPropertyName];\n\t\t\t\tlet tmpObjectPropertyKeys = Object.keys(tmpObjectProperty);\n\t\t\t\t// Managing the parent address is a bit more complex here -- the box will be added for each element.\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpObjectPropertyName}`;\n\t\t\t\t// The container object is where we have the \"Address\":SOMEVALUE pairs\n\t\t\t\tlet tmpContainerObject = {};\n\t\t\t\tfor (let i = 0; i < tmpObjectPropertyKeys.length; i++)\n\t\t\t\t{\n\t\t\t\t\tlet tmpPropertyParentAddress = `${tmpParentAddress}.${tmpObjectPropertyKeys[i]}`;\n\t\t\t\t\tlet tmpValue = this.deleteValueAtAddress(pObject[tmpObjectPropertyName][tmpObjectPropertyKeys[i]], tmpNewAddress, tmpPropertyParentAddress);\n\n\t\t\t\t\t// The filtering is complex but allows config-based metaprogramming directly from schema\n\t\t\t\t\tlet tmpKeepRecord = this.checkFilters(pAddress, tmpValue);\n\t\t\t\t\tif (tmpKeepRecord)\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpContainerObject[`${tmpPropertyParentAddress}.${tmpNewAddress}`] = tmpValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn tmpContainerObject;\n\t\t\t}\n\n\t\t\t// If there is an object property already named for the sub object, but it isn't an object\n\t\t\t// then the system can't set the value in there. Error and abort!\n\t\t\tif (pObject.hasOwnProperty(tmpSubObjectName) && typeof(pObject[tmpSubObjectName]) !== 'object')\n\t\t\t{\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t\telse if (pObject.hasOwnProperty(tmpSubObjectName))\n\t\t\t{\n\t\t\t\t// If there is already a subobject pass that to the recursive thingy\n\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\treturn this.deleteValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Create a subobject and then pass that\n\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\tpObject[tmpSubObjectName] = {};\n\t\t\t\treturn this.deleteValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress);\n\t\t\t}\n\t\t}\n\t}\n};\n\nmodule.exports = ManyfestObjectAddressResolverDeleteValue;\n},{\"../source/Manyfest-ParseConditionals.js\":68,\"./Manyfest-CleanWrapCharacters.js\":60,\"./Manyfest-LogToConsole.js\":62}],65:[function(require,module,exports){\n/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\nlet fCleanWrapCharacters = require('./Manyfest-CleanWrapCharacters.js');\nlet fParseConditionals = require(`../source/Manyfest-ParseConditionals.js`)\n\n/**\n* Object Address Resolver - GetValue\n*\n* IMPORTANT NOTE: This code is intentionally more verbose than necessary, to\n* be extremely clear what is going on in the recursion for\n* each of the three address resolution functions.\n*\n* Although there is some opportunity to repeat ourselves a\n* bit less in this codebase (e.g. with detection of arrays\n* versus objects versus direct properties), it can make\n* debugging.. challenging. The minified version of the code\n* optimizes out almost anything repeated in here. So please\n* be kind and rewind... meaning please keep the codebase less\n* terse and more verbose so humans can comprehend it.\n*\n* TODO: Once we validate this pattern is good to go, break these out into\n* three separate modules.\n*\n* @class ManyfestObjectAddressResolverGetValue\n*/\nclass ManyfestObjectAddressResolverGetValue\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) == 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;\n\n\t\tthis.cleanWrapCharacters = fCleanWrapCharacters;\n\t}\n\n\tcheckFilters(pAddress, pRecord)\n\t{\n\t\treturn fParseConditionals(this, pAddress, pRecord);\n\t}\n\n\t// Get the value of an element at an address\n\tgetValueAtAddress (pObject, pAddress, pParentAddress, pRootObject)\n\t{\n\t\t// Make sure pObject (the object we are meant to be recursing) is an object (which could be an array or object)\n\t\tif (typeof(pObject) != 'object') return undefined;\n\t\t// Make sure pAddress (the address we are resolving) is a string\n\t\tif (typeof(pAddress) != 'string') return undefined;\n\t\t// Stash the parent address for later resolution\n\t\tlet tmpParentAddress = \"\";\n\t\tif (typeof(pParentAddress) == 'string')\n\t\t{\n\t\t\ttmpParentAddress = pParentAddress;\n\t\t}\n\n\t\t// Set the root object to the passed-in object if it isn't set yet. This is expected to be the root object.\n\t\tlet tmpRootObject = (typeof(pRootObject) == 'undefined') ? pObject : pRootObject;\n\n\t\t// TODO: Make this work for things like SomeRootObject.Metadata[\"Some.People.Use.Bad.Object.Property.Names\"]\n\t\tlet tmpSeparatorIndex = pAddress.indexOf('.');\n\n\t\t// Adding simple back-navigation in objects\n\t\tif (tmpSeparatorIndex == 0)\n\t\t{\n\t\t\t// Given an address of \"Bundle.Contract.IDContract...Project.IDProject\" the ... would be interpreted as two back-navigations from IDContract.\n\t\t\t// When the address is passed in, though, the first . is already eliminated. So we can count the dots.\n\t\t\tlet tmpParentAddressParts = tmpParentAddress.split('.');\n\n\t\t\tlet tmpBackNavigationCount = 0;\n\n\t\t\t// Count the number of dots\n\t\t\tfor (let i = 0; i < pAddress.length; i++)\n\t\t\t{\n\t\t\t\tif (pAddress.charAt(i) != '.')\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\ttmpBackNavigationCount++;\n\t\t\t}\n\n\t\t\tlet tmpParentAddressLength = tmpParentAddressParts.length - tmpBackNavigationCount;\n\n\t\t\tif (tmpParentAddressLength < 0)\n\t\t\t{\n\t\t\t\t// We are trying to back navigate more than we can.\n\t\t\t\t// TODO: Should this be undefined or should we bank out at the bottom and try to go forward?\n\t\t\t\t// This seems safest for now.\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// We are trying to back navigate to a parent object.\n\t\t\t\t// Recurse with the back-propagated parent address, and, the new address without the back-navigation dots.\n\t\t\t\tlet tmpRecurseAddress = pAddress.slice(tmpBackNavigationCount);\n\t\t\t\tif (tmpParentAddressLength > 0)\n\t\t\t\t{\n\t\t\t\t\ttmpRecurseAddress = `${tmpParentAddressParts.slice(0, tmpParentAddressLength).join('.')}.${tmpRecurseAddress}`;\n\t\t\t\t}\n\t\t\t\tthis.logInfo(`Back-navigation detected. Recursing back to address [${tmpRecurseAddress}]`);\n\t\t\t\treturn this.getValueAtAddress(tmpRootObject, tmpRecurseAddress);\n\t\t\t}\n\t\t}\n\n\t\t// This is the terminal address string (no more dots so the RECUSION ENDS IN HERE somehow)\n\t\tif (tmpSeparatorIndex == -1)\n\t\t{\n\t\t\t// Check if the address refers to a boxed property\n\t\t\tlet tmpBracketStartIndex = pAddress.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = pAddress.indexOf(']');\n\n\t\t\t// Check for the Object Set Type marker.\n\t\t\t// Note this will not work with a bracket in the same address box set\n\t\t\tlet tmpObjectTypeMarkerIndex = pAddress.indexOf('{}');\n\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[10]\n\t\t\t// \t\tMyValues['Name']\n\t\t\t// \t\tMyValues[\"Age\"]\n\t\t\t// \t\tMyValues[`Cost`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\t// The \"Name\" of the Object contained too the left of the bracket\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\t// If the subproperty doesn't test as a proper Object, none of the rest of this is possible.\n\t\t\t\t// This is a rare case where Arrays testing as Objects is useful\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) !== 'object')\n\t\t\t\t{\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\n\t\t\t\t// The \"Reference\" to the property within it, either an array element or object property\n\t\t\t\tlet tmpBoxedPropertyReference = pAddress.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\t\t\t\t// Attempt to parse the reference as a number, which will be used as an array element\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to treat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynamic object property.\n\t\t\t\t\t// We would expect the property to be wrapped in some kind of quotes so strip them\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Return the value in the property\n\t\t\t\t\treturn pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\treturn pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber];\n\t\t\t\t}\n\t\t\t}\n\t\t\t// The requirements to detect a boxed set element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\telse if ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket is after the start bracket\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is nothing in the brackets\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex == 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tif (!Array.isArray(pObject[tmpBoxedPropertyName]))\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tlet tmpInputArray = pObject[tmpBoxedPropertyName];\n\t\t\t\tlet tmpOutputArray = [];\n\t\t\t\tfor (let i = 0; i < tmpInputArray.length; i++)\n\t\t\t\t{\n\t\t\t\t\t// The filtering is complex but allows config-based metaprogramming directly from schema\n\t\t\t\t\tlet tmpKeepRecord = this.checkFilters(pAddress, tmpInputArray[i]);\n\t\t\t\t\tif (tmpKeepRecord)\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpOutputArray.push(tmpInputArray[i]);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn tmpOutputArray;\n\t\t\t}\n\t\t\t// The object has been flagged as an object set, so treat it as such\n\t\t\telse if (tmpObjectTypeMarkerIndex > 0)\n\t\t\t{\n\t\t\t\tlet tmpObjectPropertyName = pAddress.substring(0, tmpObjectTypeMarkerIndex).trim();\n\n\t\t\t\tif (typeof(pObject[tmpObjectPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\treturn pObject[tmpObjectPropertyName];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Now is the point in recursion to return the value in the address\n\t\t\t\treturn pObject[pAddress];\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlet tmpSubObjectName = pAddress.substring(0, tmpSeparatorIndex);\n\t\t\tlet tmpNewAddress = pAddress.substring(tmpSeparatorIndex+1);\n\n\t\t\t// BOXED ELEMENTS\n\t\t\t// Test if the tmpNewAddress is an array or object\n\t\t\t// Check if it's a boxed property\n\t\t\tlet tmpBracketStartIndex = tmpSubObjectName.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = tmpSubObjectName.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[42]\n\t\t\t// \t\tMyValues['Color']\n\t\t\t// \t\tMyValues[\"Weight\"]\n\t\t\t// \t\tMyValues[`Diameter`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = tmpSubObjectName.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyReference = tmpSubObjectName.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[1].Tardy\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an object, so the [1].Tardy is not possible to access\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[\"JaneDoe\"].Grade\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an array, so the [\"JaneDoe\"].Grade is not possible to access\n\t\t\t\t// TODO: Should this be an error or something? Should we keep a log of failures like this?\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\t\t\t\t// Check if the boxed property is an object.\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\n\n\t\t\t\t//This is a bracketed value\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to reat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynanmic object property.\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\t\t// Recurse directly into the subobject\n\t\t\t\t\treturn this.getValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference], tmpNewAddress, tmpParentAddress, tmpRootObject);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\t\t// We parsed a valid number out of the boxed property name, so recurse into the array\n\t\t\t\t\treturn this.getValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber], tmpNewAddress, tmpParentAddress, tmpRootObject);\n\t\t\t\t}\n\t\t\t}\n\t\t\t// The requirements to detect a boxed set element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\telse if ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket is after the start bracket\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is nothing in the brackets\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex == 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tif (!Array.isArray(pObject[tmpBoxedPropertyName]))\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// We need to enumerate the array and grab the addresses from there.\n\t\t\t\tlet tmpArrayProperty = pObject[tmpBoxedPropertyName];\n\t\t\t\t// Managing the parent address is a bit more complex here -- the box will be added for each element.\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpBoxedPropertyName}`;\n\t\t\t\t// The container object is where we have the \"Address\":SOMEVALUE pairs\n\t\t\t\tlet tmpContainerObject = {};\n\t\t\t\tfor (let i = 0; i < tmpArrayProperty.length; i++)\n\t\t\t\t{\n\t\t\t\t\tlet tmpPropertyParentAddress = `${tmpParentAddress}[${i}]`;\n\t\t\t\t\tlet tmpValue = this.getValueAtAddress(pObject[tmpBoxedPropertyName][i], tmpNewAddress, tmpPropertyParentAddress, tmpRootObject);\n\n\t\t\t\t\ttmpContainerObject[`${tmpPropertyParentAddress}.${tmpNewAddress}`] = tmpValue;\n\t\t\t\t}\n\n\t\t\t\treturn tmpContainerObject;\n\t\t\t}\n\n\t\t\t// OBJECT SET\n\t\t\t// Note this will not work with a bracket in the same address box set\n\t\t\tlet tmpObjectTypeMarkerIndex = pAddress.indexOf('{}');\n\t\t\tif (tmpObjectTypeMarkerIndex > 0)\n\t\t\t{\n\t\t\t\tlet tmpObjectPropertyName = pAddress.substring(0, tmpObjectTypeMarkerIndex).trim();\n\n\t\t\t\tif (typeof(pObject[tmpObjectPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// We need to enumerate the Object and grab the addresses from there.\n\t\t\t\tlet tmpObjectProperty = pObject[tmpObjectPropertyName];\n\t\t\t\tlet tmpObjectPropertyKeys = Object.keys(tmpObjectProperty);\n\t\t\t\t// Managing the parent address is a bit more complex here -- the box will be added for each element.\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpObjectPropertyName}`;\n\t\t\t\t// The container object is where we have the \"Address\":SOMEVALUE pairs\n\t\t\t\tlet tmpContainerObject = {};\n\t\t\t\tfor (let i = 0; i < tmpObjectPropertyKeys.length; i++)\n\t\t\t\t{\n\t\t\t\t\tlet tmpPropertyParentAddress = `${tmpParentAddress}.${tmpObjectPropertyKeys[i]}`;\n\t\t\t\t\tlet tmpValue = this.getValueAtAddress(pObject[tmpObjectPropertyName][tmpObjectPropertyKeys[i]], tmpNewAddress, tmpPropertyParentAddress, tmpRootObject);\n\n\t\t\t\t\t// The filtering is complex but allows config-based metaprogramming directly from schema\n\t\t\t\t\tlet tmpKeepRecord = this.checkFilters(pAddress, tmpValue);\n\t\t\t\t\tif (tmpKeepRecord)\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpContainerObject[`${tmpPropertyParentAddress}.${tmpNewAddress}`] = tmpValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn tmpContainerObject;\n\t\t\t}\n\n\t\t\t// If there is an object property already named for the sub object, but it isn't an object\n\t\t\t// then the system can't set the value in there. Error and abort!\n\t\t\tif (pObject.hasOwnProperty(tmpSubObjectName) && typeof(pObject[tmpSubObjectName]) !== 'object')\n\t\t\t{\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t\telse if (pObject.hasOwnProperty(tmpSubObjectName))\n\t\t\t{\n\t\t\t\t// If there is already a subobject pass that to the recursive thingy\n\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\treturn this.getValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress, tmpRootObject);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Create a subobject and then pass that\n\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\tpObject[tmpSubObjectName] = {};\n\t\t\t\treturn this.getValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress, tmpRootObject);\n\t\t\t}\n\t\t}\n\t}\n};\n\nmodule.exports = ManyfestObjectAddressResolverGetValue;\n},{\"../source/Manyfest-ParseConditionals.js\":68,\"./Manyfest-CleanWrapCharacters.js\":60,\"./Manyfest-LogToConsole.js\":62}],66:[function(require,module,exports){\n/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\nlet fCleanWrapCharacters = require('./Manyfest-CleanWrapCharacters.js');\n\n/**\n* Object Address Resolver - SetValue\n*\n* IMPORTANT NOTE: This code is intentionally more verbose than necessary, to\n* be extremely clear what is going on in the recursion for\n* each of the three address resolution functions.\n*\n* Although there is some opportunity to repeat ourselves a\n* bit less in this codebase (e.g. with detection of arrays\n* versus objects versus direct properties), it can make\n* debugging.. challenging. The minified version of the code\n* optimizes out almost anything repeated in here. So please\n* be kind and rewind... meaning please keep the codebase less\n* terse and more verbose so humans can comprehend it.\n*\n*\n* @class ManyfestObjectAddressSetValue\n*/\nclass ManyfestObjectAddressSetValue\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) == 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;\n\n\t\tthis.cleanWrapCharacters = fCleanWrapCharacters;\n\t}\n\n\t// Set the value of an element at an address\n\tsetValueAtAddress (pObject, pAddress, pValue)\n\t{\n\t\t// Make sure pObject is an object\n\t\tif (typeof(pObject) != 'object') return false;\n\t\t// Make sure pAddress is a string\n\t\tif (typeof(pAddress) != 'string') return false;\n\n\t\tlet tmpSeparatorIndex = pAddress.indexOf('.');\n\n\t\tif (tmpSeparatorIndex == -1)\n\t\t{\n\t\t\t// Check if it's a boxed property\n\t\t\tlet tmpBracketStartIndex = pAddress.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = pAddress.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[10]\n\t\t\t// \t\tMyValues['Name']\n\t\t\t// \t\tMyValues[\"Age\"]\n\t\t\t// \t\tMyValues[`Cost`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\t// The \"Name\" of the Object contained too the left of the bracket\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\t// If the subproperty doesn't test as a proper Object, none of the rest of this is possible.\n\t\t\t\t// This is a rare case where Arrays testing as Objects is useful\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) !== 'object')\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// The \"Reference\" to the property within it, either an array element or object property\n\t\t\t\tlet tmpBoxedPropertyReference = pAddress.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\t\t\t\t// Attempt to parse the reference as a number, which will be used as an array element\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to treat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynamic object property.\n\t\t\t\t\t// We would expect the property to be wrapped in some kind of quotes so strip them\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Return the value in the property\n\t\t\t\t\tpObject[tmpBoxedPropertyName][tmpBoxedPropertyReference] = pValue;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber] = pValue;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Now is the time in recursion to set the value in the object\n\t\t\t\tpObject[pAddress] = pValue;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlet tmpSubObjectName = pAddress.substring(0, tmpSeparatorIndex);\n\t\t\tlet tmpNewAddress = pAddress.substring(tmpSeparatorIndex+1);\n\n\t\t\t// Test if the tmpNewAddress is an array or object\n\t\t\t// Check if it's a boxed property\n\t\t\tlet tmpBracketStartIndex = tmpSubObjectName.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = tmpSubObjectName.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[42]\n\t\t\t// \t\tMyValues['Color']\n\t\t\t// \t\tMyValues[\"Weight\"]\n\t\t\t// \t\tMyValues[`Diameter`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = tmpSubObjectName.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyReference = tmpSubObjectName.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[1].Tardy\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an object, so the [1].Tardy is not possible to access\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[\"JaneDoe\"].Grade\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an array, so the [\"JaneDoe\"].Grade is not possible to access\n\t\t\t\t// TODO: Should this be an error or something? Should we keep a log of failures like this?\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t//This is a bracketed value\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to reat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynanmic object property.\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Recurse directly into the subobject\n\t\t\t\t\treturn this.setValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference], tmpNewAddress, pValue);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// We parsed a valid number out of the boxed property name, so recurse into the array\n\t\t\t\t\treturn this.setValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber], tmpNewAddress, pValue);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// If there is an object property already named for the sub object, but it isn't an object\n\t\t\t// then the system can't set the value in there. Error and abort!\n\t\t\tif (pObject.hasOwnProperty(tmpSubObjectName) && typeof(pObject[tmpSubObjectName]) !== 'object')\n\t\t\t{\n\t\t\t\tif (!pObject.hasOwnProperty('__ERROR'))\n\t\t\t\t\tpObject['__ERROR'] = {};\n\t\t\t\t// Put it in an error object so data isn't lost\n\t\t\t\tpObject['__ERROR'][pAddress] = pValue;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\telse if (pObject.hasOwnProperty(tmpSubObjectName))\n\t\t\t{\n\t\t\t\t// If there is already a subobject pass that to the recursive thingy\n\t\t\t\treturn this.setValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, pValue);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Create a subobject and then pass that\n\t\t\t\tpObject[tmpSubObjectName] = {};\n\t\t\t\treturn this.setValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, pValue);\n\t\t\t}\n\t\t}\n\t}\n};\n\nmodule.exports = ManyfestObjectAddressSetValue;\n},{\"./Manyfest-CleanWrapCharacters.js\":60,\"./Manyfest-LogToConsole.js\":62}],67:[function(require,module,exports){\n/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\n\n/**\n* Object Address Generation\n*\n* Automagically generate addresses and properties based on a passed-in object,\n* to be used for easy creation of schemas. Meant to simplify the lives of\n* developers wanting to create schemas without typing a bunch of stuff.\n*\n* IMPORTANT NOTE: This code is intentionally more verbose than necessary, to\n* be extremely clear what is going on in the recursion for\n* each of the three address resolution functions.\n*\n* Although there is some opportunity to repeat ourselves a\n* bit less in this codebase (e.g. with detection of arrays\n* versus objects versus direct properties), it can make\n* debugging.. challenging. The minified version of the code\n* optimizes out almost anything repeated in here. So please\n* be kind and rewind... meaning please keep the codebase less\n* terse and more verbose so humans can comprehend it.\n*\n*\n* @class ManyfestObjectAddressGeneration\n*/\nclass ManyfestObjectAddressGeneration\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) == 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;\n\t}\n\n\t// generateAddressses\n\t//\n\t// This flattens an object into a set of key:value pairs for *EVERY SINGLE\n\t// POSSIBLE ADDRESS* in the object. It can get ... really insane really\n\t// quickly. This is not meant to be used directly to generate schemas, but\n\t// instead as a starting point for scripts or UIs.\n\t//\n\t// This will return a mega set of key:value pairs with all possible schema\n\t// permutations and default values (when not an object) and everything else.\n\tgenerateAddressses (pObject, pBaseAddress, pSchema)\n\t{\n\t\tlet tmpBaseAddress = (typeof(pBaseAddress) == 'string') ? pBaseAddress : '';\n\t\tlet tmpSchema = (typeof(pSchema) == 'object') ? pSchema : {};\n\n\t\tlet tmpObjectType = typeof(pObject);\n\n\t\tlet tmpSchemaObjectEntry = (\n\t\t\t{\n\t\t\t\tAddress: tmpBaseAddress,\n\t\t\t\tHash: tmpBaseAddress,\n\t\t\t\tName: tmpBaseAddress,\n\t\t\t\t// This is so scripts and UI controls can force a developer to opt-in.\n\t\t\t\tInSchema: false\n\t\t\t}\n\t\t)\n\n\t\tif ((tmpObjectType == 'object') && (pObject == null))\n\t\t{\n\t\t\ttmpObjectType = 'null';\n\t\t}\n\n\t\tswitch(tmpObjectType)\n\t\t{\n\t\t\tcase 'string':\n\t\t\t\ttmpSchemaObjectEntry.DataType = 'String';\n\t\t\t\ttmpSchemaObjectEntry.Default = pObject;\n\t\t\t\ttmpSchema[tmpBaseAddress] = tmpSchemaObjectEntry;\n\t\t\t\tbreak;\n\t\t\tcase 'number':\n\t\t\tcase 'bigint':\n\t\t\t\ttmpSchemaObjectEntry.DataType = 'Number';\n\t\t\t\ttmpSchemaObjectEntry.Default = pObject;\n\t\t\t\ttmpSchema[tmpBaseAddress] = tmpSchemaObjectEntry;\n\t\t\t\tbreak;\n\t\t\tcase 'undefined':\n\t\t\tcase 'null':\n\t\t\t\ttmpSchemaObjectEntry.DataType = 'Any';\n\t\t\t\ttmpSchemaObjectEntry.Default = pObject;\n\t\t\t\ttmpSchema[tmpBaseAddress] = tmpSchemaObjectEntry;\n\t\t\t\tbreak;\n\t\t\tcase 'object':\n\t\t\t\tif (Array.isArray(pObject))\n\t\t\t\t{\n\t\t\t\t\ttmpSchemaObjectEntry.DataType = 'Array';\n\t\t\t\t\tif (tmpBaseAddress != '')\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpSchema[tmpBaseAddress] = tmpSchemaObjectEntry;\n\t\t\t\t\t}\n\n\t\t\t\t\tfor (let i = 0; i < pObject.length; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tthis.generateAddressses(pObject[i], `${tmpBaseAddress}[${i}]`, tmpSchema);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\ttmpSchemaObjectEntry.DataType = 'Object';\n\t\t\t\t\tif (tmpBaseAddress != '')\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpSchema[tmpBaseAddress] = tmpSchemaObjectEntry;\n\t\t\t\t\t\ttmpBaseAddress += '.';\n\t\t\t\t\t}\n\n\t\t\t\t\tlet tmpObjectProperties = Object.keys(pObject);\n\n\t\t\t\t\tfor (let i = 0; i < tmpObjectProperties.length; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tthis.generateAddressses(pObject[tmpObjectProperties[i]], `${tmpBaseAddress}${tmpObjectProperties[i]}`, tmpSchema);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'symbol':\n\t\t\tcase 'function':\n\t\t\t\t// Symbols and functions neither recurse nor get added to the schema\n\t\t\t\tbreak;\n\t\t}\n\n\t\treturn tmpSchema;\n\t}\n};\n\nmodule.exports = ManyfestObjectAddressGeneration;\n},{\"./Manyfest-LogToConsole.js\":62}],68:[function(require,module,exports){\n// Given a string, parse out any conditional expressions and set whether or not to keep the record.\n//\n// For instance:\n// \t\t'files[]<<~?format,==,Thumbnail?~>>'\n// 'files[]<<~?format,==,Metadata?~>>'\n// 'files[]<<~?size,>,4000?~>>'\n//\n// The wrapping parts are the <<~? and ?~>> megabrackets.\n//\n// The function does not need to alter the string -- just check the conditionals within.\n\n// TODO: Consider making this an es6 class\n\n// Let's use indexOf since it is apparently the fastest.\nconst _ConditionalStanzaStart = '<<~?';\nconst _ConditionalStanzaStartLength = _ConditionalStanzaStart.length;\nconst _ConditionalStanzaEnd = '?~>>';\nconst _ConditionalStanzaEndLength = _ConditionalStanzaEnd.length;\n\n// Test the condition of a value in a record\nconst testCondition = (pManyfest, pRecord, pSearchAddress, pSearchComparator, pValue) =>\n{\n\tswitch(pSearchComparator)\n\t{\n\t\tcase '!=':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) != pValue);\n\t\t\tbreak;\n\t\tcase '<':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) < pValue);\n\t\t\tbreak;\n\t\tcase '>':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) > pValue);\n\t\t\tbreak;\n\t\tcase '<=':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) <= pValue);\n\t\t\tbreak;\n\t\tcase '>=':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) >= pValue);\n\t\t\tbreak;\n\t\tcase '===':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) === pValue);\n\t\t\tbreak;\n\t\tcase '==':\n\t\tdefault:\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) == pValue);\n\t\t\tbreak;\n\t}\n};\n\nconst parseConditionals = (pManyfest, pAddress, pRecord) =>\n{\n\tlet tmpKeepRecord = true;\n\n\t/*\n\t\tAlgorithm is simple:\n\n\t\t1. Enuerate start points\n\n\t\t2. Find stop points within each start point\n\t\t3. Check the conditional\n\t*/\n\n\tlet tmpStartIndex = pAddress.indexOf(_ConditionalStanzaStart);\n\n\twhile (tmpStartIndex != -1)\n\t{\n\t\tlet tmpStopIndex = pAddress.indexOf(_ConditionalStanzaEnd, tmpStartIndex+_ConditionalStanzaStartLength);\n\n\t\tif (tmpStopIndex != -1)\n\t\t{\n\t\t\tlet tmpMagicComparisonPatternSet = pAddress.substring(tmpStartIndex+_ConditionalStanzaStartLength, tmpStopIndex).split(',');\n\n\t\t\tlet tmpSearchAddress = tmpMagicComparisonPatternSet[0];\n\t\t\tlet tmpSearchComparator = tmpMagicComparisonPatternSet[1];\n\t\t\tlet tmpSearchValue = tmpMagicComparisonPatternSet[2];\n\n\t\t\t// Process the piece\n\t\t\ttmpKeepRecord = tmpKeepRecord && testCondition(pManyfest, pRecord, tmpSearchAddress, tmpSearchComparator, tmpSearchValue);\n\t\t\ttmpStartIndex = pAddress.indexOf(_ConditionalStanzaStart, tmpStopIndex+_ConditionalStanzaEndLength);\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttmpStartIndex = -1;\n\t\t}\n\t\t\n\t}\n\n\treturn tmpKeepRecord;\n}\n\nmodule.exports = parseConditionals;\n},{}],69:[function(require,module,exports){\n/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\n\n/**\n* Schema Manipulation Functions\n*\n* @class ManyfestSchemaManipulation\n*/\nclass ManyfestSchemaManipulation\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) === 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) === 'function') ? pErrorLog : libSimpleLog;\n\t}\n\n // This translates the default address mappings to something different.\n //\n // For instance you can pass in manyfest schema descriptor object:\n // \t{\n\t//\t \"Address.Of.a\": { \"Hash\": \"a\", \"Type\": \"Number\" },\n\t//\t \"Address.Of.b\": { \"Hash\": \"b\", \"Type\": \"Number\" }\n\t// }\n //\n //\n // And then an address mapping (basically a Hash->Address map)\n // {\n // \"a\": \"New.Address.Of.a\",\n // \"b\": \"New.Address.Of.b\"\n // }\n //\n // NOTE: This mutates the schema object permanently, altering the base hash.\n // If there is a collision with an existing address, it can lead to overwrites.\n // TODO: Discuss what should happen on collisions.\n\tresolveAddressMappings(pManyfestSchemaDescriptors, pAddressMapping)\n\t{\n\t\tif (typeof(pManyfestSchemaDescriptors) != 'object')\n\t\t{\n\t\t\tthis.logError(`Attempted to resolve address mapping but the descriptor was not an object.`);\n\t\t\treturn false;\n\t\t}\n\n\t\tif (typeof(pAddressMapping) != 'object')\n\t\t{\n\t\t\t// No mappings were passed in\n\t\t\treturn true;\n\t\t}\n\n\t\t// Get the arrays of both the schema definition and the hash mapping\n\t\tlet tmpManyfestAddresses = Object.keys(pManyfestSchemaDescriptors);\n\t\tlet tmpHashMapping = {};\n\t\ttmpManyfestAddresses.forEach(\n\t\t\t(pAddress) =>\n\t\t\t{\n\t\t\t\tif (pManyfestSchemaDescriptors[pAddress].hasOwnProperty('Hash'))\n\t\t\t\t{\n\t\t\t\t\ttmpHashMapping[pManyfestSchemaDescriptors[pAddress].Hash] = pAddress;\n\t\t\t\t}\n\t\t\t});\n\n\t\tlet tmpAddressMappingSet = Object.keys(pAddressMapping);\n\n\t\ttmpAddressMappingSet.forEach(\n\t\t\t(pInputAddress) =>\n\t\t\t{\n\t\t\t\tlet tmpNewDescriptorAddress = pAddressMapping[pInputAddress];\n\t\t\t\tlet tmpOldDescriptorAddress = false;\n\t\t\t\tlet tmpDescriptor = false;\n\n\t\t\t\t// See if there is a matching descriptor either by Address directly or Hash\n\t\t\t\tif (pManyfestSchemaDescriptors.hasOwnProperty(pInputAddress))\n\t\t\t\t{\n\t\t\t\t\ttmpOldDescriptorAddress = pInputAddress;\n\t\t\t\t}\n\t\t\t\telse if (tmpHashMapping.hasOwnProperty(pInputAddress))\n\t\t\t\t{\n\t\t\t\t\ttmpOldDescriptorAddress = tmpHashMapping[pInputAddress];\n\t\t\t\t}\n\n\t\t\t\t// If there was a matching descriptor in the manifest, store it in the temporary descriptor\n\t\t\t\tif (tmpOldDescriptorAddress)\n\t\t\t\t{\n\t\t\t\t\ttmpDescriptor = pManyfestSchemaDescriptors[tmpOldDescriptorAddress];\n\t\t\t\t\tdelete pManyfestSchemaDescriptors[tmpOldDescriptorAddress];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// Create a new descriptor! Map it to the input address.\n\t\t\t\t\ttmpDescriptor = { Hash:pInputAddress };\n\t\t\t\t}\n\n\t\t\t\t// Now re-add the descriptor to the manyfest schema\n\t\t\t\tpManyfestSchemaDescriptors[tmpNewDescriptorAddress] = tmpDescriptor;\n\t\t\t});\n\n\t\treturn true;\n\t}\n\n\tsafeResolveAddressMappings(pManyfestSchemaDescriptors, pAddressMapping)\n\t{\n\t\t// This returns the descriptors as a new object, safely remapping without mutating the original schema Descriptors\n\t\tlet tmpManyfestSchemaDescriptors = JSON.parse(JSON.stringify(pManyfestSchemaDescriptors));\n\t\tthis.resolveAddressMappings(tmpManyfestSchemaDescriptors, pAddressMapping);\n\t\treturn tmpManyfestSchemaDescriptors;\n\t}\n\n\tmergeAddressMappings(pManyfestSchemaDescriptorsDestination, pManyfestSchemaDescriptorsSource)\n\t{\n\t\tif ((typeof(pManyfestSchemaDescriptorsSource) != 'object') || (typeof(pManyfestSchemaDescriptorsDestination) != 'object'))\n\t\t{\n\t\t\tthis.logError(`Attempted to merge two schema descriptors but both were not objects.`);\n\t\t\treturn false;\n\t\t}\n\n\t\tlet tmpSource = JSON.parse(JSON.stringify(pManyfestSchemaDescriptorsSource));\n\t\tlet tmpNewManyfestSchemaDescriptors = JSON.parse(JSON.stringify(pManyfestSchemaDescriptorsDestination));\n\n\t\t// The first passed-in set of descriptors takes precedence.\n\t\tlet tmpDescriptorAddresses = Object.keys(tmpSource);\n\n\t\ttmpDescriptorAddresses.forEach(\n\t\t\t(pDescriptorAddress) =>\n\t\t\t{\n\t\t\t\tif (!tmpNewManyfestSchemaDescriptors.hasOwnProperty(pDescriptorAddress))\n\t\t\t\t{\n\t\t\t\t\ttmpNewManyfestSchemaDescriptors[pDescriptorAddress] = tmpSource[pDescriptorAddress];\n\t\t\t\t}\n\t\t\t});\n\n\t\treturn tmpNewManyfestSchemaDescriptors;\n\t}\n}\n\nmodule.exports = ManyfestSchemaManipulation;\n},{\"./Manyfest-LogToConsole.js\":62}],70:[function(require,module,exports){\n/**\n* @author <steven@velozo.com>\n*/\nconst libFableServiceProviderBase = require('fable-serviceproviderbase');\n\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\n\nlet libHashTranslation = require('./Manyfest-HashTranslation.js');\nlet libObjectAddressCheckAddressExists = require('./Manyfest-ObjectAddress-CheckAddressExists.js');\nlet libObjectAddressGetValue = require('./Manyfest-ObjectAddress-GetValue.js');\nlet libObjectAddressSetValue = require('./Manyfest-ObjectAddress-SetValue.js');\nlet libObjectAddressDeleteValue = require('./Manyfest-ObjectAddress-DeleteValue.js');\nlet libObjectAddressGeneration = require('./Manyfest-ObjectAddressGeneration.js');\nlet libSchemaManipulation = require('./Manyfest-SchemaManipulation.js');\n\nconst _DefaultConfiguration = { Scope:'DEFAULT', Descriptors: {} }\n\n/**\n* Manyfest object address-based descriptions and manipulations.\n*\n* @class Manyfest\n*/\nclass Manyfest extends libFableServiceProviderBase\n{\n\tconstructor(pFable, pManifest, pServiceHash)\n\t{\n\t\tif (pFable === undefined)\n\t\t{\n\t\t\tsuper({});\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsuper(pFable, pManifest, pServiceHash);\n\t\t}\n\n this.serviceType = 'Manifest';\n\n\t\t// Wire in logging\n\t\tthis.logInfo = libSimpleLog;\n\t\tthis.logError = libSimpleLog;\n\n\t\t// Create an object address resolver and map in the functions\n\t\tthis.objectAddressCheckAddressExists = new libObjectAddressCheckAddressExists(this.logInfo, this.logError);\n\t\tthis.objectAddressGetValue = new libObjectAddressGetValue(this.logInfo, this.logError);\n\t\tthis.objectAddressSetValue = new libObjectAddressSetValue(this.logInfo, this.logError);\n\t\tthis.objectAddressDeleteValue = new libObjectAddressDeleteValue(this.logInfo, this.logError);\n\n\t\tif (!this.options.hasOwnProperty('defaultValues'))\n\t\t{\n\t\t\tthis.options.defaultValues = (\n\t\t\t\t{\n\t\t\t\t\t\"String\": \"\",\n\t\t\t\t\t\"Number\": 0,\n\t\t\t\t\t\"Float\": 0.0,\n\t\t\t\t\t\"Integer\": 0,\n\t\t\t\t\t\"Boolean\": false,\n\t\t\t\t\t\"Binary\": 0,\n\t\t\t\t\t\"DateTime\": 0,\n\t\t\t\t\t\"Array\": [],\n\t\t\t\t\t\"Object\": {},\n\t\t\t\t\t\"Null\": null\n\t\t\t\t});\n\t\t}\n\t\tif (!this.options.hasOwnProperty('strict'))\n\t\t{\n\t\t\tthis.options.strict = false;\n\t\t}\n\n\t\tthis.scope = undefined;\n\t\tthis.elementAddresses = undefined;\n\t\tthis.elementHashes = undefined;\n\t\tthis.elementDescriptors = undefined;\n\n\t\tthis.reset();\n\n\t\tif (typeof(this.options) === 'object')\n\t\t{\n\t\t\tthis.loadManifest(this.options);\n\t\t}\n\n\t\tthis.schemaManipulations = new libSchemaManipulation(this.logInfo, this.logError);\n\t\tthis.objectAddressGeneration = new libObjectAddressGeneration(this.logInfo, this.logError);\n\n\t\tthis.hashTranslations = new libHashTranslation(this.logInfo, this.logError);\n\t}\n\n\t/*************************************************************************\n\t * Schema Manifest Loading, Reading, Manipulation and Serialization Functions\n\t */\n\n\t// Reset critical manifest properties\n\treset()\n\t{\n\t\tthis.scope = 'DEFAULT';\n\t\tthis.elementAddresses = [];\n\t\tthis.elementHashes = {};\n\t\tthis.elementDescriptors = {};\n\t}\n\n\tclone()\n\t{\n\t\t// Make a copy of the options in-place\n\t\tlet tmpNewOptions = JSON.parse(JSON.stringify(this.options));\n\n\t\tlet tmpNewManyfest = new Manyfest(this.getManifest(), this.logInfo, this.logError, tmpNewOptions);\n\n\t\t// Import the hash translations\n\t\ttmpNewManyfest.hashTranslations.addTranslation(this.hashTranslations.translationTable);\n\n\t\treturn tmpNewManyfest;\n\t}\n\n\t// Deserialize a Manifest from a string\n\tdeserialize(pManifestString)\n\t{\n\t\t// TODO: Add guards for bad manifest string\n\t\treturn this.loadManifest(JSON.parse(pManifestString));\n\t}\n\n\t// Load a manifest from an object\n\tloadManifest(pManifest)\n\t{\n\t\tif (typeof(pManifest) !== 'object')\n\t\t{\n\t\t\tthis.logError(`(${this.scope}) Error loading manifest; expecting an object but parameter was type ${typeof(pManifest)}.`);\n\t\t}\n\n\t\tlet tmpManifest = (typeof(pManifest) == 'object') ? pManifest : {};\n\n\t\tlet tmpDescriptorKeys = Object.keys(_DefaultConfiguration);\n\n\t\tfor (let i = 0; i < tmpDescriptorKeys.length; i++)\n\t\t{\n\t\t\tif (!tmpManifest.hasOwnProperty(tmpDescriptorKeys[i]))\n\t\t\t{\n\t\t\t\ttmpManifest[tmpDescriptorKeys[i]] = JSON.parse(JSON.stringify(_DefaultConfiguration[tmpDescriptorKeys[i]]));\n\t\t\t}\n\t\t}\n\n\t\tif (tmpManifest.hasOwnProperty('Scope'))\n\t\t{\n\t\t\tif (typeof(tmpManifest.Scope) === 'string')\n\t\t\t{\n\t\t\t\tthis.scope = tmpManifest.Scope;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.logError(`(${this.scope}) Error loading scope from manifest; expecting a string but property was type ${typeof(tmpManifest.Scope)}.`, tmpManifest);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.logError(`(${this.scope}) Error loading scope from manifest object. Property \"Scope\" does not exist in the root of the object.`, tmpManifest);\n\t\t}\n\n\t\tif (tmpManifest.hasOwnProperty('Descriptors'))\n\t\t{\n\t\t\tif (typeof(tmpManifest.Descriptors) === 'object')\n\t\t\t{\n\t\t\t\tlet tmpDescriptionAddresses = Object.keys(tmpManifest.Descriptors);\n\t\t\t\tfor (let i = 0; i < tmpDescriptionAddresses.length; i++)\n\t\t\t\t{\n\t\t\t\t\tthis.addDescriptor(tmpDescriptionAddresses[i], tmpManifest.Descriptors[tmpDescriptionAddresses[i]]);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.logError(`(${this.scope}) Error loading description object from manifest object. Expecting an object in 'Manifest.Descriptors' but the property was type ${typeof(tmpManifest.Descriptors)}.`, tmpManifest);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.logError(`(${this.scope}) Error loading object description from manifest object. Property \"Descriptors\" does not exist in the root of the Manifest object.`, tmpManifest);\n\t\t}\n\n\t\tif (tmpManifest.hasOwnProperty('HashTranslations'))\n\t\t{\n\t\t\tif (typeof(tmpManifest.HashTranslations) === 'object')\n\t\t\t{\n\t\t\t\tfor (let i = 0; i < tmpManifest.HashTranslations.length; i++)\n\t\t\t\t{\n\t\t\t\t\t// Each translation is \n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Serialize the Manifest to a string\n\tserialize()\n\t{\n\t\treturn JSON.stringify(this.getManifest());\n\t}\n\n\tgetManifest()\n\t{\n\t\treturn (\n\t\t\t{\n\t\t\t\tScope: this.scope,\n\t\t\t\tDescriptors: JSON.parse(JSON.stringify(this.elementDescriptors)),\n\t\t\t\tHashTranslations: JSON.parse(JSON.stringify(this.hashTranslations.translationTable))\n\t\t\t});\n\t}\n\n\t// Add a descriptor to the manifest\n\taddDescriptor(pAddress, pDescriptor)\n\t{\n\t\tif (typeof(pDescriptor) === 'object')\n\t\t{\n\t\t\t// Add the Address into the Descriptor if it doesn't exist:\n\t\t\tif (!pDescriptor.hasOwnProperty('Address'))\n\t\t\t{\n\t\t\t\tpDescriptor.Address = pAddress;\n\t\t\t}\n\n\t\t\tif (!this.elementDescriptors.hasOwnProperty(pAddress))\n\t\t\t{\n\t\t\t\tthis.elementAddresses.push(pAddress);\n\t\t\t}\n\n\t\t\t// Add the element descriptor to the schema\n\t\t\tthis.elementDescriptors[pAddress] = pDescriptor;\n\n\t\t\t// Always add the address as a hash\n\t\t\tthis.elementHashes[pAddress] = pAddress;\n\n\t\t\tif (pDescriptor.hasOwnProperty('Hash'))\n\t\t\t{\n\t\t\t\t// TODO: Check if this is a good idea or not..\n\t\t\t\t// Collisions are bound to happen with both representations of the address/hash in here and developers being able to create their own hashes.\n\t\t\t\tthis.elementHashes[pDescriptor.Hash] = pAddress;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpDescriptor.Hash = pAddress;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.logError(`(${this.scope}) Error loading object descriptor for address '${pAddress}' from manifest object. Expecting an object but property was type ${typeof(pDescriptor)}.`);\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tgetDescriptorByHash(pHash)\n\t{\n\t\treturn this.getDescriptor(this.resolveHashAddress(pHash));\n\t}\n\n\tgetDescriptor(pAddress)\n\t{\n\t\treturn this.elementDescriptors[pAddress];\n\t}\n\n\t// execute an action function for each descriptor\n\teachDescriptor(fAction)\n\t{\n let tmpDescriptorAddresses = Object.keys(this.elementDescriptors);\n for (let i = 0; i < tmpDescriptorAddresses.length; i++)\n {\n fAction(this.elementDescriptors[tmpDescriptorAddresses[i]]);\n }\n\n\t}\n\n\t/*************************************************************************\n\t * Beginning of Object Manipulation (read & write) Functions\n\t */\n\t// Check if an element exists by its hash\n\tcheckAddressExistsByHash (pObject, pHash)\n\t{\n\t\treturn this.checkAddressExists(pObject,this.resolveHashAddress(pHash));\n\t}\n\n\t// Check if an element exists at an address\n\tcheckAddressExists (pObject, pAddress)\n\t{\n\t\treturn this.objectAddressCheckAddressExists.checkAddressExists(pObject, pAddress);\n\t}\n\n\t// Turn a hash into an address, factoring in the translation table.\n\tresolveHashAddress(pHash)\n\t{\n\t\tlet tmpAddress = undefined;\n\n\t\tlet tmpInElementHashTable = this.elementHashes.hasOwnProperty(pHash);\n\t\tlet tmpInTranslationTable = this.hashTranslations.translationTable.hasOwnProperty(pHash);\n\n\t\t// The most straightforward: the hash exists, no translations.\n\t\tif (tmpInElementHashTable && !tmpInTranslationTable)\n\t\t{\n\t\t\ttmpAddress = this.elementHashes[pHash];\n\t\t}\n\t\t// There is a translation from one hash to another, and, the elementHashes contains the pointer end\n\t\telse if (tmpInTranslationTable && this.elementHashes.hasOwnProperty(this.hashTranslations.translate(pHash)))\n\t\t{\n\t\t\ttmpAddress = this.elementHashes[this.hashTranslations.translate(pHash)];\n\t\t}\n\t\t// Use the level of indirection only in the Translation Table\n\t\telse if (tmpInTranslationTable)\n\t\t{\n\t\t\ttmpAddress = this.hashTranslations.translate(pHash);\n\t\t}\n\t\t// Just treat the hash as an address.\n\t\t// TODO: Discuss this ... it is magic but controversial\n\t\telse\n\t\t{\n\t\t\ttmpAddress = pHash;\n\t\t}\n\n\t\treturn tmpAddress;\n\t}\n\n\t// Get the value of an element by its hash\n\tgetValueByHash (pObject, pHash)\n\t{\n\t\tlet tmpValue = this.getValueAtAddress(pObject, this.resolveHashAddress(pHash));\n\n\t\tif (typeof(tmpValue) == 'undefined')\n\t\t{\n\t\t\t// Try to get a default if it exists\n\t\t\ttmpValue = this.getDefaultValue(this.getDescriptorByHash(pHash));\n\t\t}\n\n\t\treturn tmpValue;\n\t}\n\n\t// Get the value of an element at an address\n\tgetValueAtAddress (pObject, pAddress)\n\t{\n\t\tlet tmpValue = this.objectAddressGetValue.getValueAtAddress(pObject, pAddress);\n\n\t\tif (typeof(tmpValue) == 'undefined')\n\t\t{\n\t\t\t// Try to get a default if it exists\n\t\t\ttmpValue = this.getDefaultValue(this.getDescriptor(pAddress));\n\t\t}\n\n\t\treturn tmpValue;\n\t}\n\n\t// Set the value of an element by its hash\n\tsetValueByHash(pObject, pHash, pValue)\n\t{\n\t\treturn this.setValueAtAddress(pObject, this.resolveHashAddress(pHash), pValue);\n\t}\n\n\t// Set the value of an element at an address\n\tsetValueAtAddress (pObject, pAddress, pValue)\n\t{\n\t\treturn this.objectAddressSetValue.setValueAtAddress(pObject, pAddress, pValue);\n\t}\n\n\t// Delete the value of an element by its hash\n\tdeleteValueByHash(pObject, pHash, pValue)\n\t{\n\t\treturn this.deleteValueAtAddress(pObject, this.resolveHashAddress(pHash), pValue);\n\t}\n\n\t// Delete the value of an element at an address\n\tdeleteValueAtAddress (pObject, pAddress, pValue)\n\t{\n\t\treturn this.objectAddressDeleteValue.deleteValueAtAddress(pObject, pAddress, pValue);\n\t}\n\n\t// Validate the consistency of an object against the schema\n\tvalidate(pObject)\n\t{\n\t\tlet tmpValidationData =\n\t\t{\n\t\t\tError: null,\n\t\t\tErrors: [],\n\t\t\tMissingElements:[]\n\t\t};\n\n\t\tif (typeof(pObject) !== 'object')\n\t\t{\n\t\t\ttmpValidationData.Error = true;\n\t\t\ttmpValidationData.Errors.push(`Expected passed in object to be type object but was passed in ${typeof(pObject)}`);\n\t\t}\n\n\t\tlet addValidationError = (pAddress, pErrorMessage) =>\n\t\t{\n\t\t\ttmpValidationData.Error = true;\n\t\t\ttmpValidationData.Errors.push(`Element at address \"${pAddress}\" ${pErrorMessage}.`);\n\t\t};\n\n\t\t// Now enumerate through the values and check for anomalies based on the schema\n\t\tfor (let i = 0; i < this.elementAddresses.length; i++)\n\t\t{\n\t\t\tlet tmpDescriptor = this.getDescriptor(this.elementAddresses[i]);\n\t\t\tlet tmpValueExists = this.checkAddressExists(pObject, tmpDescriptor.Address);\n\t\t\tlet tmpValue = this.getValueAtAddress(pObject, tmpDescriptor.Address);\n\n\t\t\tif ((typeof(tmpValue) == 'undefined') || !tmpValueExists)\n\t\t\t{\n\t\t\t\t// This will technically mean that `Object.Some.Value = undefined` will end up showing as \"missing\"\n\t\t\t\t// TODO: Do we want to do a different message based on if the property exists but is undefined?\n\t\t\t\ttmpValidationData.MissingElements.push(tmpDescriptor.Address);\n\t\t\t\tif (tmpDescriptor.Required || this.options.strict)\n\t\t\t\t{\n\t\t\t\t\taddValidationError(tmpDescriptor.Address, 'is flagged REQUIRED but is not set in the object');\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Now see if there is a data type specified for this element\n\t\t\tif (tmpDescriptor.DataType)\n\t\t\t{\n\t\t\t\tlet tmpElementType = typeof(tmpValue);\n\t\t\t\tswitch(tmpDescriptor.DataType.toString().trim().toLowerCase())\n\t\t\t\t{\n\t\t\t\t\tcase 'string':\n\t\t\t\t\t\tif (tmpElementType != 'string')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but is of the type ${tmpElementType}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 'number':\n\t\t\t\t\t\tif (tmpElementType != 'number')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but is of the type ${tmpElementType}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 'integer':\n\t\t\t\t\t\tif (tmpElementType != 'number')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but is of the type ${tmpElementType}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpValueString = tmpValue.toString();\n\t\t\t\t\t\t\tif (tmpValueString.indexOf('.') > -1)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t// TODO: Is this an error?\n\t\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but has a decimal point in the number.`);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 'float':\n\t\t\t\t\t\tif (tmpElementType != 'number')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but is of the type ${tmpElementType}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 'DateTime':\n\t\t\t\t\t\tlet tmpValueDate = new Date(tmpValue);\n\t\t\t\t\t\tif (tmpValueDate.toString() == 'Invalid Date')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but is not parsable as a Date by Javascript`);\n\t\t\t\t\t\t}\n\n\t\t\t\t\tdefault:\n\t\t\t\t\t\t// Check if this is a string, in the default case\n\t\t\t\t\t\t// Note this is only when a DataType is specified and it is an unrecognized data type.\n\t\t\t\t\t\tif (tmpElementType != 'string')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} (which auto-converted to String because it was unrecognized) but is of the type ${tmpElementType}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn tmpValidationData;\n\t}\n\n\t// Returns a default value, or, the default value for the data type (which is overridable with configuration)\n\tgetDefaultValue(pDescriptor)\n\t{\n\t\tif (typeof(pDescriptor) != 'object')\n\t\t{\n\t\t\treturn undefined;\n\t\t}\n\n\t\tif (pDescriptor.hasOwnProperty('Default'))\n\t\t{\n\t\t\treturn pDescriptor.Default;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Default to a null if it doesn't have a type specified.\n\t\t\t// This will ensure a placeholder is created but isn't misinterpreted.\n\t\t\tlet tmpDataType = (pDescriptor.hasOwnProperty('DataType')) ? pDescriptor.DataType : 'String';\n\t\t\tif (this.options.defaultValues.hasOwnProperty(tmpDataType))\n\t\t\t{\n\t\t\t\treturn this.options.defaultValues[tmpDataType];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// give up and return null\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t}\n\n\t// Enumerate through the schema and populate default values if they don't exist.\n\tpopulateDefaults(pObject, pOverwriteProperties)\n\t{\n\t\treturn this.populateObject(pObject, pOverwriteProperties,\n\t\t\t// This just sets up a simple filter to see if there is a default set.\n\t\t\t(pDescriptor) =>\n\t\t\t{\n\t\t\t\treturn pDescriptor.hasOwnProperty('Default');\n\t\t\t});\n\t}\n\n\t// Forcefully populate all values even if they don't have defaults.\n\t// Based on type, this can do unexpected things.\n\tpopulateObject(pObject, pOverwriteProperties, fFilter)\n\t{\n\t\t// Automatically create an object if one isn't passed in.\n\t\tlet tmpObject = (typeof(pObject) === 'object') ? pObject : {};\n\t\t// Default to *NOT OVERWRITING* properties\n\t\tlet tmpOverwriteProperties = (typeof(pOverwriteProperties) == 'undefined') ? false : pOverwriteProperties;\n\t\t// This is a filter function, which is passed the schema and allows complex filtering of population\n\t\t// The default filter function just returns true, populating everything.\n\t\tlet tmpFilterFunction = (typeof(fFilter) == 'function') ? fFilter : (pDescriptor) => { return true; };\n\n\t\tthis.elementAddresses.forEach(\n\t\t\t(pAddress) =>\n\t\t\t{\n\t\t\t\tlet tmpDescriptor = this.getDescriptor(pAddress);\n\t\t\t\t// Check the filter function to see if this is an address we want to set the value for.\n\t\t\t\tif (tmpFilterFunction(tmpDescriptor))\n\t\t\t\t{\n\t\t\t\t\t// If we are overwriting properties OR the property does not exist\n\t\t\t\t\tif (tmpOverwriteProperties || !this.checkAddressExists(tmpObject, pAddress))\n\t\t\t\t\t{\n\t\t\t\t\t\tthis.setValueAtAddress(tmpObject, pAddress, this.getDefaultValue(tmpDescriptor));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\n\t\treturn tmpObject;\n\t}\n};\n\nmodule.exports = Manyfest;\n},{\"./Manyfest-HashTranslation.js\":61,\"./Manyfest-LogToConsole.js\":62,\"./Manyfest-ObjectAddress-CheckAddressExists.js\":63,\"./Manyfest-ObjectAddress-DeleteValue.js\":64,\"./Manyfest-ObjectAddress-GetValue.js\":65,\"./Manyfest-ObjectAddress-SetValue.js\":66,\"./Manyfest-ObjectAddressGeneration.js\":67,\"./Manyfest-SchemaManipulation.js\":69,\"fable-serviceproviderbase\":44}],71:[function(require,module,exports){\nvar hasMap = typeof Map === 'function' && Map.prototype;\nvar mapSizeDescriptor = Object.getOwnPropertyDescriptor && hasMap ? Object.getOwnPropertyDescriptor(Map.prototype, 'size') : null;\nvar mapSize = hasMap && mapSizeDescriptor && typeof mapSizeDescriptor.get === 'function' ? mapSizeDescriptor.get : null;\nvar mapForEach = hasMap && Map.prototype.forEach;\nvar hasSet = typeof Set === 'function' && Set.prototype;\nvar setSizeDescriptor = Object.getOwnPropertyDescriptor && hasSet ? Object.getOwnPropertyDescriptor(Set.prototype, 'size') : null;\nvar setSize = hasSet && setSizeDescriptor && typeof setSizeDescriptor.get === 'function' ? setSizeDescriptor.get : null;\nvar setForEach = hasSet && Set.prototype.forEach;\nvar hasWeakMap = typeof WeakMap === 'function' && WeakMap.prototype;\nvar weakMapHas = hasWeakMap ? WeakMap.prototype.has : null;\nvar hasWeakSet = typeof WeakSet === 'function' && WeakSet.prototype;\nvar weakSetHas = hasWeakSet ? WeakSet.prototype.has : null;\nvar hasWeakRef = typeof WeakRef === 'function' && WeakRef.prototype;\nvar weakRefDeref = hasWeakRef ? WeakRef.prototype.deref : null;\nvar booleanValueOf = Boolean.prototype.valueOf;\nvar objectToString = Object.prototype.toString;\nvar functionToString = Function.prototype.toString;\nvar $match = String.prototype.match;\nvar $slice = String.prototype.slice;\nvar $replace = String.prototype.replace;\nvar $toUpperCase = String.prototype.toUpperCase;\nvar $toLowerCase = String.prototype.toLowerCase;\nvar $test = RegExp.prototype.test;\nvar $concat = Array.prototype.concat;\nvar $join = Array.prototype.join;\nvar $arrSlice = Array.prototype.slice;\nvar $floor = Math.floor;\nvar bigIntValueOf = typeof BigInt === 'function' ? BigInt.prototype.valueOf : null;\nvar gOPS = Object.getOwnPropertySymbols;\nvar symToString = typeof Symbol === 'function' && typeof Symbol.iterator === 'symbol' ? Symbol.prototype.toString : null;\nvar hasShammedSymbols = typeof Symbol === 'function' && typeof Symbol.iterator === 'object';\n// ie, `has-tostringtag/shams\nvar toStringTag = typeof Symbol === 'function' && Symbol.toStringTag && (typeof Symbol.toStringTag === hasShammedSymbols ? 'object' : 'symbol')\n ? Symbol.toStringTag\n : null;\nvar isEnumerable = Object.prototype.propertyIsEnumerable;\n\nvar gPO = (typeof Reflect === 'function' ? Reflect.getPrototypeOf : Object.getPrototypeOf) || (\n [].__proto__ === Array.prototype // eslint-disable-line no-proto\n ? function (O) {\n return O.__proto__; // eslint-disable-line no-proto\n }\n : null\n);\n\nfunction addNumericSeparator(num, str) {\n if (\n num === Infinity\n || num === -Infinity\n || num !== num\n || (num && num > -1000 && num < 1000)\n || $test.call(/e/, str)\n ) {\n return str;\n }\n var sepRegex = /[0-9](?=(?:[0-9]{3})+(?![0-9]))/g;\n if (typeof num === 'number') {\n var int = num < 0 ? -$floor(-num) : $floor(num); // trunc(num)\n if (int !== num) {\n var intStr = String(int);\n var dec = $slice.call(str, intStr.length + 1);\n return $replace.call(intStr, sepRegex, '$&_') + '.' + $replace.call($replace.call(dec, /([0-9]{3})/g, '$&_'), /_$/, '');\n }\n }\n return $replace.call(str, sepRegex, '$&_');\n}\n\nvar utilInspect = require('./util.inspect');\nvar inspectCustom = utilInspect.custom;\nvar inspectSymbol = isSymbol(inspectCustom) ? inspectCustom : null;\n\nmodule.exports = function inspect_(obj, options, depth, seen) {\n var opts = options || {};\n\n if (has(opts, 'quoteStyle') && (opts.quoteStyle !== 'single' && opts.quoteStyle !== 'double')) {\n throw new TypeError('option \"quoteStyle\" must be \"single\" or \"double\"');\n }\n if (\n has(opts, 'maxStringLength') && (typeof opts.maxStringLength === 'number'\n ? opts.maxStringLength < 0 && opts.maxStringLength !== Infinity\n : opts.maxStringLength !== null\n )\n ) {\n throw new TypeError('option \"maxStringLength\", if provided, must be a positive integer, Infinity, or `null`');\n }\n var customInspect = has(opts, 'customInspect') ? opts.customInspect : true;\n if (typeof customInspect !== 'boolean' && customInspect !== 'symbol') {\n throw new TypeError('option \"customInspect\", if provided, must be `true`, `false`, or `\\'symbol\\'`');\n }\n\n if (\n has(opts, 'indent')\n && opts.indent !== null\n && opts.indent !== '\\t'\n && !(parseInt(opts.indent, 10) === opts.indent && opts.indent > 0)\n ) {\n throw new TypeError('option \"indent\" must be \"\\\\t\", an integer > 0, or `null`');\n }\n if (has(opts, 'numericSeparator') && typeof opts.numericSeparator !== 'boolean') {\n throw new TypeError('option \"numericSeparator\", if provided, must be `true` or `false`');\n }\n var numericSeparator = opts.numericSeparator;\n\n if (typeof obj === 'undefined') {\n return 'undefined';\n }\n if (obj === null) {\n return 'null';\n }\n if (typeof obj === 'boolean') {\n return obj ? 'true' : 'false';\n }\n\n if (typeof obj === 'string') {\n return inspectString(obj, opts);\n }\n if (typeof obj === 'number') {\n if (obj === 0) {\n return Infinity / obj > 0 ? '0' : '-0';\n }\n var str = String(obj);\n return numericSeparator ? addNumericSeparator(obj, str) : str;\n }\n if (typeof obj === 'bigint') {\n var bigIntStr = String(obj) + 'n';\n return numericSeparator ? addNumericSeparator(obj, bigIntStr) : bigIntStr;\n }\n\n var maxDepth = typeof opts.depth === 'undefined' ? 5 : opts.depth;\n if (typeof depth === 'undefined') { depth = 0; }\n if (depth >= maxDepth && maxDepth > 0 && typeof obj === 'object') {\n return isArray(obj) ? '[Array]' : '[Object]';\n }\n\n var indent = getIndent(opts, depth);\n\n if (typeof seen === 'undefined') {\n seen = [];\n } else if (indexOf(seen, obj) >= 0) {\n return '[Circular]';\n }\n\n function inspect(value, from, noIndent) {\n if (from) {\n seen = $arrSlice.call(seen);\n seen.push(from);\n }\n if (noIndent) {\n var newOpts = {\n depth: opts.depth\n };\n if (has(opts, 'quoteStyle')) {\n newOpts.quoteStyle = opts.quoteStyle;\n }\n return inspect_(value, newOpts, depth + 1, seen);\n }\n return inspect_(value, opts, depth + 1, seen);\n }\n\n if (typeof obj === 'function' && !isRegExp(obj)) { // in older engines, regexes are callable\n var name = nameOf(obj);\n var keys = arrObjKeys(obj, inspect);\n return '[Function' + (name ? ': ' + name : ' (anonymous)') + ']' + (keys.length > 0 ? ' { ' + $join.call(keys, ', ') + ' }' : '');\n }\n if (isSymbol(obj)) {\n var symString = hasShammedSymbols ? $replace.call(String(obj), /^(Symbol\\(.*\\))_[^)]*$/, '$1') : symToString.call(obj);\n return typeof obj === 'object' && !hasShammedSymbols ? markBoxed(symString) : symString;\n }\n if (isElement(obj)) {\n var s = '<' + $toLowerCase.call(String(obj.nodeName));\n var attrs = obj.attributes || [];\n for (var i = 0; i < attrs.length; i++) {\n s += ' ' + attrs[i].name + '=' + wrapQuotes(quote(attrs[i].value), 'double', opts);\n }\n s += '>';\n if (obj.childNodes && obj.childNodes.length) { s += '...'; }\n s += '</' + $toLowerCase.call(String(obj.nodeName)) + '>';\n return s;\n }\n if (isArray(obj)) {\n if (obj.length === 0) { return '[]'; }\n var xs = arrObjKeys(obj, inspect);\n if (indent && !singleLineValues(xs)) {\n return '[' + indentedJoin(xs, indent) + ']';\n }\n return '[ ' + $join.call(xs, ', ') + ' ]';\n }\n if (isError(obj)) {\n var parts = arrObjKeys(obj, inspect);\n if (!('cause' in Error.prototype) && 'cause' in obj && !isEnumerable.call(obj, 'cause')) {\n return '{ [' + String(obj) + '] ' + $join.call($concat.call('[cause]: ' + inspect(obj.cause), parts), ', ') + ' }';\n }\n if (parts.length === 0) { return '[' + String(obj) + ']'; }\n return '{ [' + String(obj) + '] ' + $join.call(parts, ', ') + ' }';\n }\n if (typeof obj === 'object' && customInspect) {\n if (inspectSymbol && typeof obj[inspectSymbol] === 'function' && utilInspect) {\n return utilInspect(obj, { depth: maxDepth - depth });\n } else if (customInspect !== 'symbol' && typeof obj.inspect === 'function') {\n return obj.inspect();\n }\n }\n if (isMap(obj)) {\n var mapParts = [];\n if (mapForEach) {\n mapForEach.call(obj, function (value, key) {\n mapParts.push(inspect(key, obj, true) + ' => ' + inspect(value, obj));\n });\n }\n return collectionOf('Map', mapSize.call(obj), mapParts, indent);\n }\n if (isSet(obj)) {\n var setParts = [];\n if (setForEach) {\n setForEach.call(obj, function (value) {\n setParts.push(inspect(value, obj));\n });\n }\n return collectionOf('Set', setSize.call(obj), setParts, indent);\n }\n if (isWeakMap(obj)) {\n return weakCollectionOf('WeakMap');\n }\n if (isWeakSet(obj)) {\n return weakCollectionOf('WeakSet');\n }\n if (isWeakRef(obj)) {\n return weakCollectionOf('WeakRef');\n }\n if (isNumber(obj)) {\n return markBoxed(inspect(Number(obj)));\n }\n if (isBigInt(obj)) {\n return markBoxed(inspect(bigIntValueOf.call(obj)));\n }\n if (isBoolean(obj)) {\n return markBoxed(booleanValueOf.call(obj));\n }\n if (isString(obj)) {\n return markBoxed(inspect(String(obj)));\n }\n if (!isDate(obj) && !isRegExp(obj)) {\n var ys = arrObjKeys(obj, inspect);\n var isPlainObject = gPO ? gPO(obj) === Object.prototype : obj instanceof Object || obj.constructor === Object;\n var protoTag = obj instanceof Object ? '' : 'null prototype';\n var stringTag = !isPlainObject && toStringTag && Object(obj) === obj && toStringTag in obj ? $slice.call(toStr(obj), 8, -1) : protoTag ? 'Object' : '';\n var constructorTag = isPlainObject || typeof obj.constructor !== 'function' ? '' : obj.constructor.name ? obj.constructor.name + ' ' : '';\n var tag = constructorTag + (stringTag || protoTag ? '[' + $join.call($concat.call([], stringTag || [], protoTag || []), ': ') + '] ' : '');\n if (ys.length === 0) { return tag + '{}'; }\n if (indent) {\n return tag + '{' + indentedJoin(ys, indent) + '}';\n }\n return tag + '{ ' + $join.call(ys, ', ') + ' }';\n }\n return String(obj);\n};\n\nfunction wrapQuotes(s, defaultStyle, opts) {\n var quoteChar = (opts.quoteStyle || defaultStyle) === 'double' ? '\"' : \"'\";\n return quoteChar + s + quoteChar;\n}\n\nfunction quote(s) {\n return $replace.call(String(s), /\"/g, '&quot;');\n}\n\nfunction isArray(obj) { return toStr(obj) === '[object Array]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isDate(obj) { return toStr(obj) === '[object Date]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isRegExp(obj) { return toStr(obj) === '[object RegExp]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isError(obj) { return toStr(obj) === '[object Error]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isString(obj) { return toStr(obj) === '[object String]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isNumber(obj) { return toStr(obj) === '[object Number]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isBoolean(obj) { return toStr(obj) === '[object Boolean]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\n\n// Symbol and BigInt do have Symbol.toStringTag by spec, so that can't be used to eliminate false positives\nfunction isSymbol(obj) {\n if (hasShammedSymbols) {\n return obj && typeof obj === 'object' && obj instanceof Symbol;\n }\n if (typeof obj === 'symbol') {\n return true;\n }\n if (!obj || typeof obj !== 'object' || !symToString) {\n return false;\n }\n try {\n symToString.call(obj);\n return true;\n } catch (e) {}\n return false;\n}\n\nfunction isBigInt(obj) {\n if (!obj || typeof obj !== 'object' || !bigIntValueOf) {\n return false;\n }\n try {\n bigIntValueOf.call(obj);\n return true;\n } catch (e) {}\n return false;\n}\n\nvar hasOwn = Object.prototype.hasOwnProperty || function (key) { return key in this; };\nfunction has(obj, key) {\n return hasOwn.call(obj, key);\n}\n\nfunction toStr(obj) {\n return objectToString.call(obj);\n}\n\nfunction nameOf(f) {\n if (f.name) { return f.name; }\n var m = $match.call(functionToString.call(f), /^function\\s*([\\w$]+)/);\n if (m) { return m[1]; }\n return null;\n}\n\nfunction indexOf(xs, x) {\n if (xs.indexOf) { return xs.indexOf(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\nfunction isMap(x) {\n if (!mapSize || !x || typeof x !== 'object') {\n return false;\n }\n try {\n mapSize.call(x);\n try {\n setSize.call(x);\n } catch (s) {\n return true;\n }\n return x instanceof Map; // core-js workaround, pre-v2.5.0\n } catch (e) {}\n return false;\n}\n\nfunction isWeakMap(x) {\n if (!weakMapHas || !x || typeof x !== 'object') {\n return false;\n }\n try {\n weakMapHas.call(x, weakMapHas);\n try {\n weakSetHas.call(x, weakSetHas);\n } catch (s) {\n return true;\n }\n return x instanceof WeakMap; // core-js workaround, pre-v2.5.0\n } catch (e) {}\n return false;\n}\n\nfunction isWeakRef(x) {\n if (!weakRefDeref || !x || typeof x !== 'object') {\n return false;\n }\n try {\n weakRefDeref.call(x);\n return true;\n } catch (e) {}\n return false;\n}\n\nfunction isSet(x) {\n if (!setSize || !x || typeof x !== 'object') {\n return false;\n }\n try {\n setSize.call(x);\n try {\n mapSize.call(x);\n } catch (m) {\n return true;\n }\n return x instanceof Set; // core-js workaround, pre-v2.5.0\n } catch (e) {}\n return false;\n}\n\nfunction isWeakSet(x) {\n if (!weakSetHas || !x || typeof x !== 'object') {\n return false;\n }\n try {\n weakSetHas.call(x, weakSetHas);\n try {\n weakMapHas.call(x, weakMapHas);\n } catch (s) {\n return true;\n }\n return x instanceof WeakSet; // core-js workaround, pre-v2.5.0\n } catch (e) {}\n return false;\n}\n\nfunction isElement(x) {\n if (!x || typeof x !== 'object') { return false; }\n if (typeof HTMLElement !== 'undefined' && x instanceof HTMLElement) {\n return true;\n }\n return typeof x.nodeName === 'string' && typeof x.getAttribute === 'function';\n}\n\nfunction inspectString(str, opts) {\n if (str.length > opts.maxStringLength) {\n var remaining = str.length - opts.maxStringLength;\n var trailer = '... ' + remaining + ' more character' + (remaining > 1 ? 's' : '');\n return inspectString($slice.call(str, 0, opts.maxStringLength), opts) + trailer;\n }\n // eslint-disable-next-line no-control-regex\n var s = $replace.call($replace.call(str, /(['\\\\])/g, '\\\\$1'), /[\\x00-\\x1f]/g, lowbyte);\n return wrapQuotes(s, 'single', opts);\n}\n\nfunction lowbyte(c) {\n var n = c.charCodeAt(0);\n var x = {\n 8: 'b',\n 9: 't',\n 10: 'n',\n 12: 'f',\n 13: 'r'\n }[n];\n if (x) { return '\\\\' + x; }\n return '\\\\x' + (n < 0x10 ? '0' : '') + $toUpperCase.call(n.toString(16));\n}\n\nfunction markBoxed(str) {\n return 'Object(' + str + ')';\n}\n\nfunction weakCollectionOf(type) {\n return type + ' { ? }';\n}\n\nfunction collectionOf(type, size, entries, indent) {\n var joinedEntries = indent ? indentedJoin(entries, indent) : $join.call(entries, ', ');\n return type + ' (' + size + ') {' + joinedEntries + '}';\n}\n\nfunction singleLineValues(xs) {\n for (var i = 0; i < xs.length; i++) {\n if (indexOf(xs[i], '\\n') >= 0) {\n return false;\n }\n }\n return true;\n}\n\nfunction getIndent(opts, depth) {\n var baseIndent;\n if (opts.indent === '\\t') {\n baseIndent = '\\t';\n } else if (typeof opts.indent === 'number' && opts.indent > 0) {\n baseIndent = $join.call(Array(opts.indent + 1), ' ');\n } else {\n return null;\n }\n return {\n base: baseIndent,\n prev: $join.call(Array(depth + 1), baseIndent)\n };\n}\n\nfunction indentedJoin(xs, indent) {\n if (xs.length === 0) { return ''; }\n var lineJoiner = '\\n' + indent.prev + indent.base;\n return lineJoiner + $join.call(xs, ',' + lineJoiner) + '\\n' + indent.prev;\n}\n\nfunction arrObjKeys(obj, inspect) {\n var isArr = isArray(obj);\n var xs = [];\n if (isArr) {\n xs.length = obj.length;\n for (var i = 0; i < obj.length; i++) {\n xs[i] = has(obj, i) ? inspect(obj[i], obj) : '';\n }\n }\n var syms = typeof gOPS === 'function' ? gOPS(obj) : [];\n var symMap;\n if (hasShammedSymbols) {\n symMap = {};\n for (var k = 0; k < syms.length; k++) {\n symMap['$' + syms[k]] = syms[k];\n }\n }\n\n for (var key in obj) { // eslint-disable-line no-restricted-syntax\n if (!has(obj, key)) { continue; } // eslint-disable-line no-restricted-syntax, no-continue\n if (isArr && String(Number(key)) === key && key < obj.length) { continue; } // eslint-disable-line no-restricted-syntax, no-continue\n if (hasShammedSymbols && symMap['$' + key] instanceof Symbol) {\n // this is to prevent shammed Symbols, which are stored as strings, from being included in the string key section\n continue; // eslint-disable-line no-restricted-syntax, no-continue\n } else if ($test.call(/[^\\w$]/, key)) {\n xs.push(inspect(key, obj) + ': ' + inspect(obj[key], obj));\n } else {\n xs.push(key + ': ' + inspect(obj[key], obj));\n }\n }\n if (typeof gOPS === 'function') {\n for (var j = 0; j < syms.length; j++) {\n if (isEnumerable.call(obj, syms[j])) {\n xs.push('[' + inspect(syms[j]) + ']: ' + inspect(obj[syms[j]], obj));\n }\n }\n }\n return xs;\n}\n\n},{\"./util.inspect\":18}],72:[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\":114}],73:[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\":77}],74:[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\":75,\"./WordTree.js\":76}],75:[function(require,module,exports){\n/**\n* String Parser\n* @author Steven Velozo <steven@velozo.com>\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\tAsynchronous: false,\n\n\t\t\tOutput: '',\n\t\t\tOutputBuffer: '',\n\n\t\t\tPattern: {},\n\n\t\t\tPatternMatch: false,\n\t\t\tPatternMatchEnd: false\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\tresetOutputBuffer (pParserState)\n\t{\n\t\t// Flush the output buffer.\n\t\tthis.flushOutputBuffer(pParserState);\n\t\t// End pattern mode\n\t\tpParserState.Pattern = false;\n\t\tpParserState.PatternStartNode = false;\n\t\tpParserState.StartPatternMatchComplete = false;\n\t\tpParserState.EndPatternMatchBegan = false;\n\t\tpParserState.PatternMatch = false;\n\n\t\treturn true;\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// If we are already in a pattern match traversal\n\t\tif (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern is still matching the start and we haven't passed the buffer\n\t\t\tif (!pParserState.StartPatternMatchComplete && pParserState.Pattern.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\tpParserState.Pattern = pParserState.Pattern[pCharacter];\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t\telse if (pParserState.EndPatternMatchBegan)\n\t\t\t{\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// Flush the output buffer.\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\t// Run the function\n\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\treturn this.resetOutputBuffer(pParserState);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (pParserState.PatternStartNode.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// We broke out of the end -- see if this is a new start of the end.\n\t\t\t\t\tpParserState.Pattern = pParserState.PatternStartNode.PatternEnd[pCharacter];\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpParserState.EndPatternMatchBegan = false;\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (pParserState.Pattern.hasOwnProperty('PatternEnd'))\n\t\t\t{\n\t\t\t\tif (!pParserState.StartPatternMatchComplete)\n\t\t\t\t{\n\t\t\t\t\tpParserState.StartPatternMatchComplete = true;\n\t\t\t\t\tpParserState.PatternStartNode = pParserState.Pattern;\n\t\t\t\t}\n\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This is the first character of the end pattern.\n\t\t\t\t\tpParserState.EndPatternMatchBegan = true;\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\t// Run the t*mplate function\n\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\treturn this.resetOutputBuffer(pParserState);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// We are in a pattern start but didn't match one; reset and start trying again from this character.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t}\n\t\t}\n\t\t// If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\tif (!pParserState.PatternMatch)\n\t\t{\n\t\t\t// This may be the start of a new pattern....\n\t\t\tif (pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// ... assign the root node as the matched node.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\tpParserState.Pattern = pParserState.ParseTree[pCharacter];\n\t\t\t\tpParserState.PatternMatch = true;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t}\n\t\treturn false;\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 parameter\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\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},{}],76:[function(require,module,exports){\n/**\n* Word Tree\n* @author Steven Velozo <steven@velozo.com>\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\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 * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddChild (pTree, pPattern)\n\t{\n\t\tif (!pTree.hasOwnProperty(pPattern))\n\t\t{\n\t\t\tpTree[pPattern] = {};\n\t\t}\n\n\t\treturn pTree[pPattern];\n\t}\n\n\t/**\n\t * Add a child character to a Parse Tree PatternEnd subtree\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 * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddEndChild (pTree, pPattern)\n\t{\n\t\tif (!pTree.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\tpTree.PatternEnd = {};\n\t\t}\n\n\t\tpTree.PatternEnd[pPattern] = {};\n\n\t\treturn pTree.PatternEnd[pPattern];\n\t}\n\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 {function} fParser - 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, fParser)\n\t{\n\t\tif (pPatternStart.length < 1)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tif ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length < 1))\n\t\t{\n\t\t\treturn false;\n\t\t}\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{\n\t\t\ttmpLeaf = this.addChild(tmpLeaf, pPatternStart[i], i);\n\t\t}\n\n\t\tif (!tmpLeaf.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\ttmpLeaf.PatternEnd = {};\n\t\t}\n\n\t\tlet tmpPatternEnd = (typeof(pPatternEnd) === 'string') ? pPatternEnd : pPatternStart;\n\t\tfor (let i = 0; i < tmpPatternEnd.length; i++)\n\t\t{\n\t\t\ttmpLeaf = this.addEndChild(tmpLeaf, tmpPatternEnd[i], i);\n\t\t}\n\n\t\ttmpLeaf.PatternStartString = pPatternStart;\n\t\ttmpLeaf.PatternEndString = tmpPatternEnd;\n\t\ttmpLeaf.Parse = (typeof(fParser) === 'function') ? fParser :\n\t\t\t\t\t\t(typeof(fParser) === 'string') ? () => { return fParser; } :\n\t\t\t\t\t\t(pData) => { return pData; };\n\n\t\treturn true;\n\t}\n}\n\nmodule.exports = WordTree;\n\n},{}],77:[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},{}],78:[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},{}],79:[function(require,module,exports){\n'use strict';\n\nvar replace = String.prototype.replace;\nvar percentTwenties = /%20/g;\n\nvar Format = {\n RFC1738: 'RFC1738',\n RFC3986: 'RFC3986'\n};\n\nmodule.exports = {\n 'default': Format.RFC3986,\n formatters: {\n RFC1738: function (value) {\n return replace.call(value, percentTwenties, '+');\n },\n RFC3986: function (value) {\n return String(value);\n }\n },\n RFC1738: Format.RFC1738,\n RFC3986: Format.RFC3986\n};\n\n},{}],80:[function(require,module,exports){\n'use strict';\n\nvar stringify = require('./stringify');\nvar parse = require('./parse');\nvar formats = require('./formats');\n\nmodule.exports = {\n formats: formats,\n parse: parse,\n stringify: stringify\n};\n\n},{\"./formats\":79,\"./parse\":81,\"./stringify\":82}],81:[function(require,module,exports){\n'use strict';\n\nvar utils = require('./utils');\n\nvar has = Object.prototype.hasOwnProperty;\nvar isArray = Array.isArray;\n\nvar defaults = {\n allowDots: false,\n allowPrototypes: false,\n allowSparse: false,\n arrayLimit: 20,\n charset: 'utf-8',\n charsetSentinel: false,\n comma: false,\n decoder: utils.decode,\n delimiter: '&',\n depth: 5,\n ignoreQueryPrefix: false,\n interpretNumericEntities: false,\n parameterLimit: 1000,\n parseArrays: true,\n plainObjects: false,\n strictNullHandling: false\n};\n\nvar interpretNumericEntities = function (str) {\n return str.replace(/&#(\\d+);/g, function ($0, numberStr) {\n return String.fromCharCode(parseInt(numberStr, 10));\n });\n};\n\nvar parseArrayValue = function (val, options) {\n if (val && typeof val === 'string' && options.comma && val.indexOf(',') > -1) {\n return val.split(',');\n }\n\n return val;\n};\n\n// This is what browsers will submit when the ✓ character occurs in an\n// application/x-www-form-urlencoded body and the encoding of the page containing\n// the form is iso-8859-1, or when the submitted form has an accept-charset\n// attribute of iso-8859-1. Presumably also with other charsets that do not contain\n// the ✓ character, such as us-ascii.\nvar isoSentinel = 'utf8=%26%2310003%3B'; // encodeURIComponent('&#10003;')\n\n// These are the percent-encoded utf-8 octets representing a checkmark, indicating that the request actually is utf-8 encoded.\nvar charsetSentinel = 'utf8=%E2%9C%93'; // encodeURIComponent('✓')\n\nvar parseValues = function parseQueryStringValues(str, options) {\n var obj = { __proto__: null };\n\n var cleanStr = options.ignoreQueryPrefix ? str.replace(/^\\?/, '') : str;\n var limit = options.parameterLimit === Infinity ? undefined : options.parameterLimit;\n var parts = cleanStr.split(options.delimiter, limit);\n var skipIndex = -1; // Keep track of where the utf8 sentinel was found\n var i;\n\n var charset = options.charset;\n if (options.charsetSentinel) {\n for (i = 0; i < parts.length; ++i) {\n if (parts[i].indexOf('utf8=') === 0) {\n if (parts[i] === charsetSentinel) {\n charset = 'utf-8';\n } else if (parts[i] === isoSentinel) {\n charset = 'iso-8859-1';\n }\n skipIndex = i;\n i = parts.length; // The eslint settings do not allow break;\n }\n }\n }\n\n for (i = 0; i < parts.length; ++i) {\n if (i === skipIndex) {\n continue;\n }\n var part = parts[i];\n\n var bracketEqualsPos = part.indexOf(']=');\n var pos = bracketEqualsPos === -1 ? part.indexOf('=') : bracketEqualsPos + 1;\n\n var key, val;\n if (pos === -1) {\n key = options.decoder(part, defaults.decoder, charset, 'key');\n val = options.strictNullHandling ? null : '';\n } else {\n key = options.decoder(part.slice(0, pos), defaults.decoder, charset, 'key');\n val = utils.maybeMap(\n parseArrayValue(part.slice(pos + 1), options),\n function (encodedVal) {\n return options.decoder(encodedVal, defaults.decoder, charset, 'value');\n }\n );\n }\n\n if (val && options.interpretNumericEntities && charset === 'iso-8859-1') {\n val = interpretNumericEntities(val);\n }\n\n if (part.indexOf('[]=') > -1) {\n val = isArray(val) ? [val] : val;\n }\n\n if (has.call(obj, key)) {\n obj[key] = utils.combine(obj[key], val);\n } else {\n obj[key] = val;\n }\n }\n\n return obj;\n};\n\nvar parseObject = function (chain, val, options, valuesParsed) {\n var leaf = valuesParsed ? val : parseArrayValue(val, options);\n\n for (var i = chain.length - 1; i >= 0; --i) {\n var obj;\n var root = chain[i];\n\n if (root === '[]' && options.parseArrays) {\n obj = [].concat(leaf);\n } else {\n obj = options.plainObjects ? Object.create(null) : {};\n var cleanRoot = root.charAt(0) === '[' && root.charAt(root.length - 1) === ']' ? root.slice(1, -1) : root;\n var index = parseInt(cleanRoot, 10);\n if (!options.parseArrays && cleanRoot === '') {\n obj = { 0: leaf };\n } else if (\n !isNaN(index)\n && root !== cleanRoot\n && String(index) === cleanRoot\n && index >= 0\n && (options.parseArrays && index <= options.arrayLimit)\n ) {\n obj = [];\n obj[index] = leaf;\n } else if (cleanRoot !== '__proto__') {\n obj[cleanRoot] = leaf;\n }\n }\n\n leaf = obj;\n }\n\n return leaf;\n};\n\nvar parseKeys = function parseQueryStringKeys(givenKey, val, options, valuesParsed) {\n if (!givenKey) {\n return;\n }\n\n // Transform dot notation to bracket notation\n var key = options.allowDots ? givenKey.replace(/\\.([^.[]+)/g, '[$1]') : givenKey;\n\n // The regex chunks\n\n var brackets = /(\\[[^[\\]]*])/;\n var child = /(\\[[^[\\]]*])/g;\n\n // Get the parent\n\n var segment = options.depth > 0 && brackets.exec(key);\n var parent = segment ? key.slice(0, segment.index) : key;\n\n // Stash the parent if it exists\n\n var keys = [];\n if (parent) {\n // If we aren't using plain objects, optionally prefix keys that would overwrite object prototype properties\n if (!options.plainObjects && has.call(Object.prototype, parent)) {\n if (!options.allowPrototypes) {\n return;\n }\n }\n\n keys.push(parent);\n }\n\n // Loop through children appending to the array until we hit depth\n\n var i = 0;\n while (options.depth > 0 && (segment = child.exec(key)) !== null && i < options.depth) {\n i += 1;\n if (!options.plainObjects && has.call(Object.prototype, segment[1].slice(1, -1))) {\n if (!options.allowPrototypes) {\n return;\n }\n }\n keys.push(segment[1]);\n }\n\n // If there's a remainder, just add whatever is left\n\n if (segment) {\n keys.push('[' + key.slice(segment.index) + ']');\n }\n\n return parseObject(keys, val, options, valuesParsed);\n};\n\nvar normalizeParseOptions = function normalizeParseOptions(opts) {\n if (!opts) {\n return defaults;\n }\n\n if (opts.decoder !== null && opts.decoder !== undefined && typeof opts.decoder !== 'function') {\n throw new TypeError('Decoder has to be a function.');\n }\n\n if (typeof opts.charset !== 'undefined' && opts.charset !== 'utf-8' && opts.charset !== 'iso-8859-1') {\n throw new TypeError('The charset option must be either utf-8, iso-8859-1, or undefined');\n }\n var charset = typeof opts.charset === 'undefined' ? defaults.charset : opts.charset;\n\n return {\n allowDots: typeof opts.allowDots === 'undefined' ? defaults.allowDots : !!opts.allowDots,\n allowPrototypes: typeof opts.allowPrototypes === 'boolean' ? opts.allowPrototypes : defaults.allowPrototypes,\n allowSparse: typeof opts.allowSparse === 'boolean' ? opts.allowSparse : defaults.allowSparse,\n arrayLimit: typeof opts.arrayLimit === 'number' ? opts.arrayLimit : defaults.arrayLimit,\n charset: charset,\n charsetSentinel: typeof opts.charsetSentinel === 'boolean' ? opts.charsetSentinel : defaults.charsetSentinel,\n comma: typeof opts.comma === 'boolean' ? opts.comma : defaults.comma,\n decoder: typeof opts.decoder === 'function' ? opts.decoder : defaults.decoder,\n delimiter: typeof opts.delimiter === 'string' || utils.isRegExp(opts.delimiter) ? opts.delimiter : defaults.delimiter,\n // eslint-disable-next-line no-implicit-coercion, no-extra-parens\n depth: (typeof opts.depth === 'number' || opts.depth === false) ? +opts.depth : defaults.depth,\n ignoreQueryPrefix: opts.ignoreQueryPrefix === true,\n interpretNumericEntities: typeof opts.interpretNumericEntities === 'boolean' ? opts.interpretNumericEntities : defaults.interpretNumericEntities,\n parameterLimit: typeof opts.parameterLimit === 'number' ? opts.parameterLimit : defaults.parameterLimit,\n parseArrays: opts.parseArrays !== false,\n plainObjects: typeof opts.plainObjects === 'boolean' ? opts.plainObjects : defaults.plainObjects,\n strictNullHandling: typeof opts.strictNullHandling === 'boolean' ? opts.strictNullHandling : defaults.strictNullHandling\n };\n};\n\nmodule.exports = function (str, opts) {\n var options = normalizeParseOptions(opts);\n\n if (str === '' || str === null || typeof str === 'undefined') {\n return options.plainObjects ? Object.create(null) : {};\n }\n\n var tempObj = typeof str === 'string' ? parseValues(str, options) : str;\n var obj = options.plainObjects ? Object.create(null) : {};\n\n // Iterate over the keys and setup the new object\n\n var keys = Object.keys(tempObj);\n for (var i = 0; i < keys.length; ++i) {\n var key = keys[i];\n var newObj = parseKeys(key, tempObj[key], options, typeof str === 'string');\n obj = utils.merge(obj, newObj, options);\n }\n\n if (options.allowSparse === true) {\n return obj;\n }\n\n return utils.compact(obj);\n};\n\n},{\"./utils\":83}],82:[function(require,module,exports){\n'use strict';\n\nvar getSideChannel = require('side-channel');\nvar utils = require('./utils');\nvar formats = require('./formats');\nvar has = Object.prototype.hasOwnProperty;\n\nvar arrayPrefixGenerators = {\n brackets: function brackets(prefix) {\n return prefix + '[]';\n },\n comma: 'comma',\n indices: function indices(prefix, key) {\n return prefix + '[' + key + ']';\n },\n repeat: function repeat(prefix) {\n return prefix;\n }\n};\n\nvar isArray = Array.isArray;\nvar push = Array.prototype.push;\nvar pushToArray = function (arr, valueOrArray) {\n push.apply(arr, isArray(valueOrArray) ? valueOrArray : [valueOrArray]);\n};\n\nvar toISO = Date.prototype.toISOString;\n\nvar defaultFormat = formats['default'];\nvar defaults = {\n addQueryPrefix: false,\n allowDots: false,\n charset: 'utf-8',\n charsetSentinel: false,\n delimiter: '&',\n encode: true,\n encoder: utils.encode,\n encodeValuesOnly: false,\n format: defaultFormat,\n formatter: formats.formatters[defaultFormat],\n // deprecated\n indices: false,\n serializeDate: function serializeDate(date) {\n return toISO.call(date);\n },\n skipNulls: false,\n strictNullHandling: false\n};\n\nvar isNonNullishPrimitive = function isNonNullishPrimitive(v) {\n return typeof v === 'string'\n || typeof v === 'number'\n || typeof v === 'boolean'\n || typeof v === 'symbol'\n || typeof v === 'bigint';\n};\n\nvar sentinel = {};\n\nvar stringify = function stringify(\n object,\n prefix,\n generateArrayPrefix,\n commaRoundTrip,\n strictNullHandling,\n skipNulls,\n encoder,\n filter,\n sort,\n allowDots,\n serializeDate,\n format,\n formatter,\n encodeValuesOnly,\n charset,\n sideChannel\n) {\n var obj = object;\n\n var tmpSc = sideChannel;\n var step = 0;\n var findFlag = false;\n while ((tmpSc = tmpSc.get(sentinel)) !== void undefined && !findFlag) {\n // Where object last appeared in the ref tree\n var pos = tmpSc.get(object);\n step += 1;\n if (typeof pos !== 'undefined') {\n if (pos === step) {\n throw new RangeError('Cyclic object value');\n } else {\n findFlag = true; // Break while\n }\n }\n if (typeof tmpSc.get(sentinel) === 'undefined') {\n step = 0;\n }\n }\n\n if (typeof filter === 'function') {\n obj = filter(prefix, obj);\n } else if (obj instanceof Date) {\n obj = serializeDate(obj);\n } else if (generateArrayPrefix === 'comma' && isArray(obj)) {\n obj = utils.maybeMap(obj, function (value) {\n if (value instanceof Date) {\n return serializeDate(value);\n }\n return value;\n });\n }\n\n if (obj === null) {\n if (strictNullHandling) {\n return encoder && !encodeValuesOnly ? encoder(prefix, defaults.encoder, charset, 'key', format) : prefix;\n }\n\n obj = '';\n }\n\n if (isNonNullishPrimitive(obj) || utils.isBuffer(obj)) {\n if (encoder) {\n var keyValue = encodeValuesOnly ? prefix : encoder(prefix, defaults.encoder, charset, 'key', format);\n return [formatter(keyValue) + '=' + formatter(encoder(obj, defaults.encoder, charset, 'value', format))];\n }\n return [formatter(prefix) + '=' + formatter(String(obj))];\n }\n\n var values = [];\n\n if (typeof obj === 'undefined') {\n return values;\n }\n\n var objKeys;\n if (generateArrayPrefix === 'comma' && isArray(obj)) {\n // we need to join elements in\n if (encodeValuesOnly && encoder) {\n obj = utils.maybeMap(obj, encoder);\n }\n objKeys = [{ value: obj.length > 0 ? obj.join(',') || null : void undefined }];\n } else if (isArray(filter)) {\n objKeys = filter;\n } else {\n var keys = Object.keys(obj);\n objKeys = sort ? keys.sort(sort) : keys;\n }\n\n var adjustedPrefix = commaRoundTrip && isArray(obj) && obj.length === 1 ? prefix + '[]' : prefix;\n\n for (var j = 0; j < objKeys.length; ++j) {\n var key = objKeys[j];\n var value = typeof key === 'object' && typeof key.value !== 'undefined' ? key.value : obj[key];\n\n if (skipNulls && value === null) {\n continue;\n }\n\n var keyPrefix = isArray(obj)\n ? typeof generateArrayPrefix === 'function' ? generateArrayPrefix(adjustedPrefix, key) : adjustedPrefix\n : adjustedPrefix + (allowDots ? '.' + key : '[' + key + ']');\n\n sideChannel.set(object, step);\n var valueSideChannel = getSideChannel();\n valueSideChannel.set(sentinel, sideChannel);\n pushToArray(values, stringify(\n value,\n keyPrefix,\n generateArrayPrefix,\n commaRoundTrip,\n strictNullHandling,\n skipNulls,\n generateArrayPrefix === 'comma' && encodeValuesOnly && isArray(obj) ? null : encoder,\n filter,\n sort,\n allowDots,\n serializeDate,\n format,\n formatter,\n encodeValuesOnly,\n charset,\n valueSideChannel\n ));\n }\n\n return values;\n};\n\nvar normalizeStringifyOptions = function normalizeStringifyOptions(opts) {\n if (!opts) {\n return defaults;\n }\n\n if (opts.encoder !== null && typeof opts.encoder !== 'undefined' && typeof opts.encoder !== 'function') {\n throw new TypeError('Encoder has to be a function.');\n }\n\n var charset = opts.charset || defaults.charset;\n if (typeof opts.charset !== 'undefined' && opts.charset !== 'utf-8' && opts.charset !== 'iso-8859-1') {\n throw new TypeError('The charset option must be either utf-8, iso-8859-1, or undefined');\n }\n\n var format = formats['default'];\n if (typeof opts.format !== 'undefined') {\n if (!has.call(formats.formatters, opts.format)) {\n throw new TypeError('Unknown format option provided.');\n }\n format = opts.format;\n }\n var formatter = formats.formatters[format];\n\n var filter = defaults.filter;\n if (typeof opts.filter === 'function' || isArray(opts.filter)) {\n filter = opts.filter;\n }\n\n return {\n addQueryPrefix: typeof opts.addQueryPrefix === 'boolean' ? opts.addQueryPrefix : defaults.addQueryPrefix,\n allowDots: typeof opts.allowDots === 'undefined' ? defaults.allowDots : !!opts.allowDots,\n charset: charset,\n charsetSentinel: typeof opts.charsetSentinel === 'boolean' ? opts.charsetSentinel : defaults.charsetSentinel,\n delimiter: typeof opts.delimiter === 'undefined' ? defaults.delimiter : opts.delimiter,\n encode: typeof opts.encode === 'boolean' ? opts.encode : defaults.encode,\n encoder: typeof opts.encoder === 'function' ? opts.encoder : defaults.encoder,\n encodeValuesOnly: typeof opts.encodeValuesOnly === 'boolean' ? opts.encodeValuesOnly : defaults.encodeValuesOnly,\n filter: filter,\n format: format,\n formatter: formatter,\n serializeDate: typeof opts.serializeDate === 'function' ? opts.serializeDate : defaults.serializeDate,\n skipNulls: typeof opts.skipNulls === 'boolean' ? opts.skipNulls : defaults.skipNulls,\n sort: typeof opts.sort === 'function' ? opts.sort : null,\n strictNullHandling: typeof opts.strictNullHandling === 'boolean' ? opts.strictNullHandling : defaults.strictNullHandling\n };\n};\n\nmodule.exports = function (object, opts) {\n var obj = object;\n var options = normalizeStringifyOptions(opts);\n\n var objKeys;\n var filter;\n\n if (typeof options.filter === 'function') {\n filter = options.filter;\n obj = filter('', obj);\n } else if (isArray(options.filter)) {\n filter = options.filter;\n objKeys = filter;\n }\n\n var keys = [];\n\n if (typeof obj !== 'object' || obj === null) {\n return '';\n }\n\n var arrayFormat;\n if (opts && opts.arrayFormat in arrayPrefixGenerators) {\n arrayFormat = opts.arrayFormat;\n } else if (opts && 'indices' in opts) {\n arrayFormat = opts.indices ? 'indices' : 'repeat';\n } else {\n arrayFormat = 'indices';\n }\n\n var generateArrayPrefix = arrayPrefixGenerators[arrayFormat];\n if (opts && 'commaRoundTrip' in opts && typeof opts.commaRoundTrip !== 'boolean') {\n throw new TypeError('`commaRoundTrip` must be a boolean, or absent');\n }\n var commaRoundTrip = generateArrayPrefix === 'comma' && opts && opts.commaRoundTrip;\n\n if (!objKeys) {\n objKeys = Object.keys(obj);\n }\n\n if (options.sort) {\n objKeys.sort(options.sort);\n }\n\n var sideChannel = getSideChannel();\n for (var i = 0; i < objKeys.length; ++i) {\n var key = objKeys[i];\n\n if (options.skipNulls && obj[key] === null) {\n continue;\n }\n pushToArray(keys, stringify(\n obj[key],\n key,\n generateArrayPrefix,\n commaRoundTrip,\n options.strictNullHandling,\n options.skipNulls,\n options.encode ? options.encoder : null,\n options.filter,\n options.sort,\n options.allowDots,\n options.serializeDate,\n options.format,\n options.formatter,\n options.encodeValuesOnly,\n options.charset,\n sideChannel\n ));\n }\n\n var joined = keys.join(options.delimiter);\n var prefix = options.addQueryPrefix === true ? '?' : '';\n\n if (options.charsetSentinel) {\n if (options.charset === 'iso-8859-1') {\n // encodeURIComponent('&#10003;'), the \"numeric entity\" representation of a checkmark\n prefix += 'utf8=%26%2310003%3B&';\n } else {\n // encodeURIComponent('✓')\n prefix += 'utf8=%E2%9C%93&';\n }\n }\n\n return joined.length > 0 ? prefix + joined : '';\n};\n\n},{\"./formats\":79,\"./utils\":83,\"side-channel\":88}],83:[function(require,module,exports){\n'use strict';\n\nvar formats = require('./formats');\n\nvar has = Object.prototype.hasOwnProperty;\nvar isArray = Array.isArray;\n\nvar hexTable = (function () {\n var array = [];\n for (var i = 0; i < 256; ++i) {\n array.push('%' + ((i < 16 ? '0' : '') + i.toString(16)).toUpperCase());\n }\n\n return array;\n}());\n\nvar compactQueue = function compactQueue(queue) {\n while (queue.length > 1) {\n var item = queue.pop();\n var obj = item.obj[item.prop];\n\n if (isArray(obj)) {\n var compacted = [];\n\n for (var j = 0; j < obj.length; ++j) {\n if (typeof obj[j] !== 'undefined') {\n compacted.push(obj[j]);\n }\n }\n\n item.obj[item.prop] = compacted;\n }\n }\n};\n\nvar arrayToObject = function arrayToObject(source, options) {\n var obj = options && options.plainObjects ? Object.create(null) : {};\n for (var i = 0; i < source.length; ++i) {\n if (typeof source[i] !== 'undefined') {\n obj[i] = source[i];\n }\n }\n\n return obj;\n};\n\nvar merge = function merge(target, source, options) {\n /* eslint no-param-reassign: 0 */\n if (!source) {\n return target;\n }\n\n if (typeof source !== 'object') {\n if (isArray(target)) {\n target.push(source);\n } else if (target && typeof target === 'object') {\n if ((options && (options.plainObjects || options.allowPrototypes)) || !has.call(Object.prototype, source)) {\n target[source] = true;\n }\n } else {\n return [target, source];\n }\n\n return target;\n }\n\n if (!target || typeof target !== 'object') {\n return [target].concat(source);\n }\n\n var mergeTarget = target;\n if (isArray(target) && !isArray(source)) {\n mergeTarget = arrayToObject(target, options);\n }\n\n if (isArray(target) && isArray(source)) {\n source.forEach(function (item, i) {\n if (has.call(target, i)) {\n var targetItem = target[i];\n if (targetItem && typeof targetItem === 'object' && item && typeof item === 'object') {\n target[i] = merge(targetItem, item, options);\n } else {\n target.push(item);\n }\n } else {\n target[i] = item;\n }\n });\n return target;\n }\n\n return Object.keys(source).reduce(function (acc, key) {\n var value = source[key];\n\n if (has.call(acc, key)) {\n acc[key] = merge(acc[key], value, options);\n } else {\n acc[key] = value;\n }\n return acc;\n }, mergeTarget);\n};\n\nvar assign = function assignSingleSource(target, source) {\n return Object.keys(source).reduce(function (acc, key) {\n acc[key] = source[key];\n return acc;\n }, target);\n};\n\nvar decode = function (str, decoder, charset) {\n var strWithoutPlus = str.replace(/\\+/g, ' ');\n if (charset === 'iso-8859-1') {\n // unescape never throws, no try...catch needed:\n return strWithoutPlus.replace(/%[0-9a-f]{2}/gi, unescape);\n }\n // utf-8\n try {\n return decodeURIComponent(strWithoutPlus);\n } catch (e) {\n return strWithoutPlus;\n }\n};\n\nvar encode = function encode(str, defaultEncoder, charset, kind, format) {\n // This code was originally written by Brian White (mscdex) for the io.js core querystring library.\n // It has been adapted here for stricter adherence to RFC 3986\n if (str.length === 0) {\n return str;\n }\n\n var string = str;\n if (typeof str === 'symbol') {\n string = Symbol.prototype.toString.call(str);\n } else if (typeof str !== 'string') {\n string = String(str);\n }\n\n if (charset === 'iso-8859-1') {\n return escape(string).replace(/%u[0-9a-f]{4}/gi, function ($0) {\n return '%26%23' + parseInt($0.slice(2), 16) + '%3B';\n });\n }\n\n var out = '';\n for (var i = 0; i < string.length; ++i) {\n var c = string.charCodeAt(i);\n\n if (\n c === 0x2D // -\n || c === 0x2E // .\n || c === 0x5F // _\n || c === 0x7E // ~\n || (c >= 0x30 && c <= 0x39) // 0-9\n || (c >= 0x41 && c <= 0x5A) // a-z\n || (c >= 0x61 && c <= 0x7A) // A-Z\n || (format === formats.RFC1738 && (c === 0x28 || c === 0x29)) // ( )\n ) {\n out += string.charAt(i);\n continue;\n }\n\n if (c < 0x80) {\n out = out + hexTable[c];\n continue;\n }\n\n if (c < 0x800) {\n out = out + (hexTable[0xC0 | (c >> 6)] + hexTable[0x80 | (c & 0x3F)]);\n continue;\n }\n\n if (c < 0xD800 || c >= 0xE000) {\n out = out + (hexTable[0xE0 | (c >> 12)] + hexTable[0x80 | ((c >> 6) & 0x3F)] + hexTable[0x80 | (c & 0x3F)]);\n continue;\n }\n\n i += 1;\n c = 0x10000 + (((c & 0x3FF) << 10) | (string.charCodeAt(i) & 0x3FF));\n /* eslint operator-linebreak: [2, \"before\"] */\n out += hexTable[0xF0 | (c >> 18)]\n + hexTable[0x80 | ((c >> 12) & 0x3F)]\n + hexTable[0x80 | ((c >> 6) & 0x3F)]\n + hexTable[0x80 | (c & 0x3F)];\n }\n\n return out;\n};\n\nvar compact = function compact(value) {\n var queue = [{ obj: { o: value }, prop: 'o' }];\n var refs = [];\n\n for (var i = 0; i < queue.length; ++i) {\n var item = queue[i];\n var obj = item.obj[item.prop];\n\n var keys = Object.keys(obj);\n for (var j = 0; j < keys.length; ++j) {\n var key = keys[j];\n var val = obj[key];\n if (typeof val === 'object' && val !== null && refs.indexOf(val) === -1) {\n queue.push({ obj: obj, prop: key });\n refs.push(val);\n }\n }\n }\n\n compactQueue(queue);\n\n return value;\n};\n\nvar isRegExp = function isRegExp(obj) {\n return Object.prototype.toString.call(obj) === '[object RegExp]';\n};\n\nvar isBuffer = function isBuffer(obj) {\n if (!obj || typeof obj !== 'object') {\n return false;\n }\n\n return !!(obj.constructor && obj.constructor.isBuffer && obj.constructor.isBuffer(obj));\n};\n\nvar combine = function combine(a, b) {\n return [].concat(a, b);\n};\n\nvar maybeMap = function maybeMap(val, fn) {\n if (isArray(val)) {\n var mapped = [];\n for (var i = 0; i < val.length; i += 1) {\n mapped.push(fn(val[i]));\n }\n return mapped;\n }\n return fn(val);\n};\n\nmodule.exports = {\n arrayToObject: arrayToObject,\n assign: assign,\n combine: combine,\n compact: compact,\n decode: decode,\n encode: encode,\n isBuffer: isBuffer,\n isRegExp: isRegExp,\n maybeMap: maybeMap,\n merge: merge\n};\n\n},{\"./formats\":79}],84:[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},{}],85:[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},{}],86:[function(require,module,exports){\n'use strict';\n\nexports.decode = exports.parse = require('./decode');\nexports.encode = exports.stringify = require('./encode');\n\n},{\"./decode\":84,\"./encode\":85}],87:[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\":20}],88:[function(require,module,exports){\n'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\nvar callBound = require('call-bind/callBound');\nvar inspect = require('object-inspect');\n\nvar $TypeError = GetIntrinsic('%TypeError%');\nvar $WeakMap = GetIntrinsic('%WeakMap%', true);\nvar $Map = GetIntrinsic('%Map%', true);\n\nvar $weakMapGet = callBound('WeakMap.prototype.get', true);\nvar $weakMapSet = callBound('WeakMap.prototype.set', true);\nvar $weakMapHas = callBound('WeakMap.prototype.has', true);\nvar $mapGet = callBound('Map.prototype.get', true);\nvar $mapSet = callBound('Map.prototype.set', true);\nvar $mapHas = callBound('Map.prototype.has', true);\n\n/*\n * This function traverses the list returning the node corresponding to the\n * given key.\n *\n * That node is also moved to the head of the list, so that if it's accessed\n * again we don't need to traverse the whole list. By doing so, all the recently\n * used nodes can be accessed relatively quickly.\n */\nvar listGetNode = function (list, key) { // eslint-disable-line consistent-return\n\tfor (var prev = list, curr; (curr = prev.next) !== null; prev = curr) {\n\t\tif (curr.key === key) {\n\t\t\tprev.next = curr.next;\n\t\t\tcurr.next = list.next;\n\t\t\tlist.next = curr; // eslint-disable-line no-param-reassign\n\t\t\treturn curr;\n\t\t}\n\t}\n};\n\nvar listGet = function (objects, key) {\n\tvar node = listGetNode(objects, key);\n\treturn node && node.value;\n};\nvar listSet = function (objects, key, value) {\n\tvar node = listGetNode(objects, key);\n\tif (node) {\n\t\tnode.value = value;\n\t} else {\n\t\t// Prepend the new node to the beginning of the list\n\t\tobjects.next = { // eslint-disable-line no-param-reassign\n\t\t\tkey: key,\n\t\t\tnext: objects.next,\n\t\t\tvalue: value\n\t\t};\n\t}\n};\nvar listHas = function (objects, key) {\n\treturn !!listGetNode(objects, key);\n};\n\nmodule.exports = function getSideChannel() {\n\tvar $wm;\n\tvar $m;\n\tvar $o;\n\tvar channel = {\n\t\tassert: function (key) {\n\t\t\tif (!channel.has(key)) {\n\t\t\t\tthrow new $TypeError('Side channel does not contain ' + inspect(key));\n\t\t\t}\n\t\t},\n\t\tget: function (key) { // eslint-disable-line consistent-return\n\t\t\tif ($WeakMap && key && (typeof key === 'object' || typeof key === 'function')) {\n\t\t\t\tif ($wm) {\n\t\t\t\t\treturn $weakMapGet($wm, key);\n\t\t\t\t}\n\t\t\t} else if ($Map) {\n\t\t\t\tif ($m) {\n\t\t\t\t\treturn $mapGet($m, key);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ($o) { // eslint-disable-line no-lonely-if\n\t\t\t\t\treturn listGet($o, key);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\thas: function (key) {\n\t\t\tif ($WeakMap && key && (typeof key === 'object' || typeof key === 'function')) {\n\t\t\t\tif ($wm) {\n\t\t\t\t\treturn $weakMapHas($wm, key);\n\t\t\t\t}\n\t\t\t} else if ($Map) {\n\t\t\t\tif ($m) {\n\t\t\t\t\treturn $mapHas($m, key);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ($o) { // eslint-disable-line no-lonely-if\n\t\t\t\t\treturn listHas($o, key);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t},\n\t\tset: function (key, value) {\n\t\t\tif ($WeakMap && key && (typeof key === 'object' || typeof key === 'function')) {\n\t\t\t\tif (!$wm) {\n\t\t\t\t\t$wm = new $WeakMap();\n\t\t\t\t}\n\t\t\t\t$weakMapSet($wm, key, value);\n\t\t\t} else if ($Map) {\n\t\t\t\tif (!$m) {\n\t\t\t\t\t$m = new $Map();\n\t\t\t\t}\n\t\t\t\t$mapSet($m, key, value);\n\t\t\t} else {\n\t\t\t\tif (!$o) {\n\t\t\t\t\t/*\n\t\t\t\t\t * Initialize the linked list as an empty node, so that we don't have\n\t\t\t\t\t * to special-case handling of the first node: we can always refer to\n\t\t\t\t\t * it as (previous node).next, instead of something like (list).head\n\t\t\t\t\t */\n\t\t\t\t\t$o = { key: {}, next: null };\n\t\t\t\t}\n\t\t\t\tlistSet($o, key, value);\n\t\t\t}\n\t\t}\n\t};\n\treturn channel;\n};\n\n},{\"call-bind/callBound\":25,\"get-intrinsic\":52,\"object-inspect\":71}],89:[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\":20}],90:[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\":20,\"decompress-response\":18,\"http\":91,\"https\":57,\"once\":72,\"querystring\":86,\"simple-concat\":89,\"url\":112}],91:[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\":93,\"./lib/response\":94,\"builtin-status-codes\":21,\"url\":112,\"xtend\":115}],92:[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},{}],93:[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\":92,\"./response\":94,\"_process\":77,\"buffer\":20,\"inherits\":59,\"readable-stream\":109}],94:[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\":92,\"_process\":77,\"buffer\":20,\"inherits\":59,\"readable-stream\":109}],95:[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},{}],96:[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\":98,\"./_stream_writable\":100,\"_process\":77,\"inherits\":59}],97:[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\":99,\"inherits\":59}],98:[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\":95,\"./_stream_duplex\":96,\"./internal/streams/async_iterator\":101,\"./internal/streams/buffer_list\":102,\"./internal/streams/destroy\":103,\"./internal/streams/from\":105,\"./internal/streams/state\":107,\"./internal/streams/stream\":108,\"_process\":77,\"buffer\":20,\"events\":36,\"inherits\":59,\"string_decoder/\":110,\"util\":18}],99:[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\":95,\"./_stream_duplex\":96,\"inherits\":59}],100:[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\":95,\"./_stream_duplex\":96,\"./internal/streams/destroy\":103,\"./internal/streams/state\":107,\"./internal/streams/stream\":108,\"_process\":77,\"buffer\":20,\"inherits\":59,\"util-deprecate\":113}],101:[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\":104,\"_process\":77}],102:[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\":20,\"util\":18}],103:[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\":77}],104:[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\":95}],105:[function(require,module,exports){\nmodule.exports = function () {\n throw new Error('Readable.from is not available in the browser')\n};\n\n},{}],106:[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\":95,\"./end-of-stream\":104}],107:[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\":95}],108:[function(require,module,exports){\nmodule.exports = require('events').EventEmitter;\n\n},{\"events\":36}],109:[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\":96,\"./lib/_stream_passthrough.js\":97,\"./lib/_stream_readable.js\":98,\"./lib/_stream_transform.js\":99,\"./lib/_stream_writable.js\":100,\"./lib/internal/streams/end-of-stream.js\":104,\"./lib/internal/streams/pipeline.js\":106}],110:[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\":87}],111:[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\":77,\"timers\":111}],112:[function(require,module,exports){\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\n'use strict';\n\nvar punycode = require('punycode');\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/*\n * define these here so at least they only have to be\n * compiled once on the first module load.\n */\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 /*\n * RFC 2396: characters reserved for delimiting URLs.\n * We actually just auto-escape these.\n */\n delims = [\n '<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t'\n ],\n\n // RFC 2396: characters not allowed for various reasons.\n unwise = [\n '{', '}', '|', '\\\\', '^', '`'\n ].concat(delims),\n\n // Allowed by RFCs, but cause of XSS attacks. Always escape these.\n autoEscape = ['\\''].concat(unwise),\n /*\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 */\n nonHostChars = [\n '%', '/', '?', ';', '#'\n ].concat(autoEscape),\n hostEndingChars = [\n '/', '?', '#'\n ],\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('qs');\n\nfunction urlParse(url, parseQueryString, slashesDenoteHost) {\n if (url && typeof url === 'object' && 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 (typeof url !== 'string') {\n throw new TypeError(\"Parameter 'url' must be a string, not \" + typeof url);\n }\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 */\n var queryIndex = url.indexOf('?'),\n splitter = 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 /*\n * trim before proceeding.\n * This is to support parse stuff like \" http://foo.com \\n\"\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 /*\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 */\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] && (slashes || (proto && !slashedProtocol[proto]))) {\n\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\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\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)) { hostEnd = hec; }\n }\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 */\n var auth, atSign;\n if (hostEnd === -1) {\n // atSign can be anywhere.\n atSign = rest.lastIndexOf('@');\n } else {\n /*\n * atSign must be in auth portion.\n * http://a@b/c@d => host:b auth:a path:/c@d\n */\n atSign = rest.lastIndexOf('@', hostEnd);\n }\n\n /*\n * Now we have a portion which is definitely the auth.\n * Pull that off.\n */\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)) { hostEnd = hec; }\n }\n // if we still have not hit it, then the entire thing is a host.\n if (hostEnd === -1) { 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 /*\n * we've indicated that there is a hostname,\n * so even if it's empty, it has to be present.\n */\n this.hostname = this.hostname || '';\n\n /*\n * if hostname begins with [ and ends with ]\n * assume that it's an IPv6 address.\n */\n var ipv6Hostname = this.hostname[0] === '[' && 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 /*\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 */\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 /*\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 */\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 /*\n * strip [ and ] from the hostname\n * the host field still retains them, though\n */\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 /*\n * now rest is set to the post-host stuff.\n * chop off any delim chars.\n */\n if (!unsafeProtocol[lowerProto]) {\n\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 */\n for (var i = 0, l = autoEscape.length; i < l; i++) {\n var ae = autoEscape[i];\n if (rest.indexOf(ae) === -1) { 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 // 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] && 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 /*\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 */\n if (typeof obj === 'string') { 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 ? this.hostname : '[' + this.hostname + ']');\n if (this.port) {\n host += ':' + this.port;\n }\n }\n\n if (this.query && typeof this.query === 'object' && 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 /*\n * only the slashedProtocols get the //. Not mailto:, xmpp:, etc.\n * unless they had them to begin with.\n */\n if (this.slashes || (!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 (typeof relative === 'string') {\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 /*\n * hash is always overridden, no matter what.\n * even href=\"\" will remove it.\n */\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') { result[rkey] = relative[rkey]; }\n }\n\n // urlParse appends trailing / to urls like http://www.example.com\n if (slashedProtocol[result.protocol] && result.hostname && !result.pathname) {\n 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 /*\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 */\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 = relative.host || relative.pathname && relative.pathname.charAt(0) === '/',\n mustEndAbs = isRelAbs || isSourceAbs || (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 /*\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 */\n if (psychotic) {\n result.hostname = '';\n result.port = null;\n if (result.host) {\n if (srcPath[0] === '') { srcPath[0] = result.host; } 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; } 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 === '' ? relative.host : result.host;\n result.hostname = relative.hostname || relative.hostname === '' ? 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 /*\n * it's relative\n * throw away the existing file, and take the new path instead.\n */\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 (relative.search != null) {\n /*\n * just pull out the search.\n * like href='?foo'.\n * Put this after the other two cases because it simplifies the booleans\n */\n if (psychotic) {\n result.host = srcPath.shift();\n result.hostname = result.host;\n /*\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 */\n var authInHost = result.host && result.host.indexOf('@') > 0 ? result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.hostname = authInHost.shift();\n result.host = result.hostname;\n }\n }\n result.search = relative.search;\n result.query = relative.query;\n // to support http.request\n if (result.pathname !== null || result.search !== null) {\n result.path = (result.pathname ? result.pathname : '') + (result.search ? result.search : '');\n }\n result.href = result.format();\n return result;\n }\n\n if (!srcPath.length) {\n /*\n * no path at all. easy.\n * we've already handled the other stuff above.\n */\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 /*\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 */\n var last = srcPath.slice(-1)[0];\n var hasTrailingSlash = (result.host || relative.host || srcPath.length > 1) && (last === '.' || last === '..') || last === '';\n\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 */\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] !== '' && (!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] === '' || (srcPath[0] && srcPath[0].charAt(0) === '/');\n\n // put the host back\n if (psychotic) {\n result.hostname = isAbsolute ? '' : srcPath.length ? srcPath.shift() : '';\n result.host = result.hostname;\n /*\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 */\n var authInHost = result.host && result.host.indexOf('@') > 0 ? result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.hostname = authInHost.shift();\n result.host = result.hostname;\n }\n }\n\n mustEndAbs = mustEndAbs || (result.host && srcPath.length);\n\n if (mustEndAbs && !isAbsolute) {\n srcPath.unshift('');\n }\n\n if (srcPath.length > 0) {\n result.pathname = srcPath.join('/');\n } else {\n result.pathname = null;\n result.path = null;\n }\n\n // to support request.http\n if (result.pathname !== null || result.search !== null) {\n result.path = (result.pathname ? result.pathname : '') + (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\nexports.parse = urlParse;\nexports.resolve = urlResolve;\nexports.resolveObject = urlResolveObject;\nexports.format = urlFormat;\n\nexports.Url = Url;\n\n},{\"punycode\":78,\"qs\":80}],113:[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},{}],114:[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},{}],115:[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},{}],116:[function(require,module,exports){\n/**\n* Fable Application Services Management\n* @author <steven@velozo.com>\n*/\n\nconst libFableServiceBase = require('fable-serviceproviderbase');\n\nclass FableService extends libFableServiceBase.CoreServiceProviderBase\n{\n\tconstructor(pSettings, pServiceHash)\n\t{\n\t\tsuper(pSettings, pServiceHash);\n\n\t\tthis.serviceType = 'ServiceManager';\n\n\t\tthis.serviceTypes = [];\n\n\t\t// A map of instantiated services\n\t\tthis.servicesMap = {};\n\n\t\t// A map of the default instantiated service by type\n\t\tthis.services = {};\n\n\t\t// A map of class constructors for services\n\t\tthis.serviceClasses = {};\n\n\t\t// If we need extra service initialization capabilities\n\t\tthis.extraServiceInitialization = false;\n\t}\n\n\taddServiceType(pServiceType, pServiceClass)\n\t{\n\t\tif (this.servicesMap.hasOwnProperty(pServiceType))\n\t\t{\n\t\t\t// TODO: Check if any services are running?\n\t\t\tthis.fable.log.warn(`Adding a service type [${pServiceType}] that already exists.`);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Add the container for instantiated services to go in\n\t\t\tthis.servicesMap[pServiceType] = {};\n\n\t\t\t// Add the type to the list of types\n\t\t\tthis.serviceTypes.push(pServiceType);\n\t\t}\n\n\t\t// Using the static member of the class is a much more reliable way to check if it is a service class than instanceof\n\t\tif ((typeof(pServiceClass) == 'function') && (pServiceClass.isFableService))\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.fable.log.error(`Attempted to add service type [${pServiceType}] with an invalid class. Using base service class, which will not crash but won't provide meaningful services.`);\n\t\t\tthis.serviceClasses[pServiceType] = libFableServiceBase;\n\t\t}\n\t}\n\n\t// This is for the services that are meant to run mostly single-instance so need a default at initialization\n\taddAndInstantiateServiceType(pServiceType, pServiceClass)\n\t{\n\t\tthis.addServiceType(pServiceType, pServiceClass);\n\t\treturn this.instantiateServiceProvider(pServiceType, {}, `${pServiceType}-Default`);\n\t}\n\n\t// Some services expect to be overloaded / customized class.\n\tinstantiateServiceProviderFromPrototype(pServiceType, pOptions, pCustomServiceHash, pServicePrototype)\n\t{\n\t\t// Instantiate the service\n\t\tlet tmpService = new pServicePrototype(this.fable, pOptions, pCustomServiceHash);\n\n\t\tif (this.extraServiceInitialization)\n\t\t{\n\t\t\ttmpService = this.extraServiceInitialization(tmpService);\n\t\t}\n\n\t\t// Add the service to the service map\n\t\tthis.servicesMap[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.services.hasOwnProperty(pServiceType))\n\t\t{\n\t\t\tthis.setDefaultServiceInstantiation(pServiceType, tmpService.Hash)\n\t\t}\n\n\t\treturn tmpService;\n\t}\n\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.servicesMap[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.services.hasOwnProperty(pServiceType))\n\t\t{\n\t\t\tthis.setDefaultServiceInstantiation(pServiceType, tmpService.Hash)\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\tif (this.extraServiceInitialization)\n\t\t{\n\t\t\ttmpService = this.extraServiceInitialization(tmpService);\n\t\t}\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.servicesMap.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.servicesMap[tmpServiceType] = {};\n\t\t}\n\t\t// Add the service to the service map\n\t\tthis.servicesMap[tmpServiceType][tmpServiceHash] = pServiceInstance;\n\n\t\t// If this is the first service of this type, make it the default\n\t\tif (!this.services.hasOwnProperty(tmpServiceType))\n\t\t{\n\t\t\tthis.setDefaultServiceInstantiation(tmpServiceType, tmpServiceHash)\n\t\t}\n\n\t\treturn pServiceInstance;\n\t}\n\n\tsetDefaultServiceInstantiation(pServiceType, pServiceHash)\n\t{\n\t\tif (this.servicesMap[pServiceType].hasOwnProperty(pServiceHash))\n\t\t{\n\t\t\tthis.fable[pServiceType] = this.servicesMap[pServiceType][pServiceHash];\n\t\t\tthis.services[pServiceType] = this.servicesMap[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;\nmodule.exports.CoreServiceProviderBase = libFableServiceBase.CoreServiceProviderBase;\n},{\"fable-serviceproviderbase\":44}],117:[function(require,module,exports){\n/**\n* Fable Application Services Support Library\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 libFableServiceManager = require('./Fable-ServiceManager.js');\n\nclass Fable\n{\n\tconstructor(pSettings)\n\t{\n\t\t// Initialization Phase 0: Set up the lowest level state (core services)\n\t\t// Container for the core services prototypes.\n\t\t// This is here so if an API consumer changes the default for a core service,\n\t\t// fable still runs with what was initialized.\n\t\tthis._coreServices = {};\n\n\t\t// Instantiate the default Settings Manager\n\t\tthis._coreServices.SettingsManager = new libFableSettings(pSettings);\n\t\t// Instantiate the UUID generator\n\t\tthis._coreServices.UUID = new libFableUUID(this._coreServices.SettingsManager.settings);\n\t\t// Instantiate the logging system\n\t\tthis._coreServices.Logging = new libFableLog(this._coreServices.SettingsManager.settings);\n\t\tthis._coreServices.Logging.initialize();\n\n\t\t// Initialization Phase 1: Instantiate the service manager\n\t\t// This is the start actual bootstrapping point for fable\n\t\tthis._coreServices.ServiceManager = new libFableServiceManager(this);\n\t\tthis.serviceManager = this._coreServices.ServiceManager;\n\t\tthis.serviceManager.connectFable(this);\n\t\t// Bootstrapping of fable into the Service Manager is complete\n\n\t\t// Initialization Phase 2: Map in the default services.\n\t\t// They will then be available in the Default service provider set as well.\n\t\tthis.serviceManager.connectPreinitServiceProviderInstance(this._coreServices.ServiceManager);\n\t\tthis.serviceManager.connectPreinitServiceProviderInstance(this._coreServices.UUID);\n\t\tthis.serviceManager.connectPreinitServiceProviderInstance(this._coreServices.Logging);\n\t\tthis.serviceManager.connectPreinitServiceProviderInstance(this._coreServices.SettingsManager);\n\n\t\t// Initialize and instantiate the default baked-in Data Arithmatic service\n\t\tthis.serviceManager.addAndInstantiateServiceType('EnvironmentData', require('./services/Fable-Service-EnvironmentData.js'));\n\t\tthis.serviceManager.addServiceType('Template', require('./services/Fable-Service-Template.js'));\n\t\tthis.serviceManager.addServiceType('MetaTemplate', require('./services/Fable-Service-MetaTemplate.js'));\n\t\tthis.serviceManager.addServiceType('Anticipate', require('./services/Fable-Service-Anticipate.js'));\n\t\tthis.serviceManager.addAndInstantiateServiceType('Dates', require('./services/Fable-Service-DateManipulation.js'));\n\t\tthis.serviceManager.addAndInstantiateServiceType('DataFormat', require('./services/Fable-Service-DataFormat.js'));\n\t\tthis.serviceManager.addAndInstantiateServiceType('DataGeneration', require('./services/Fable-Service-DataGeneration.js'));\n\t\tthis.serviceManager.addAndInstantiateServiceType('Utility', require('./services/Fable-Service-Utility.js'));\n\t\tthis.serviceManager.addServiceType('Operation', require('./services/Fable-Service-Operation.js'));\n\t\tthis.serviceManager.addServiceType('RestClient', require('./services/Fable-Service-RestClient.js'));\n\t\tthis.serviceManager.addServiceType('CSVParser', require('./services/Fable-Service-CSVParser.js'));\n\t\tthis.serviceManager.addServiceType('Manifest', require('manyfest'));\n\t\tthis.serviceManager.addServiceType('ObjectCache', require('cachetrax'));\n\t\tthis.serviceManager.addServiceType('FilePersistence', require('./services/Fable-Service-FilePersistence.js'));\n\t}\n\n\tget isFable()\n\t{\n\t\treturn true;\n\t}\n\n\tget settings()\n\t{\n\t\treturn this._coreServices.SettingsManager.settings;\n\t}\n\n\tget settingsManager()\n\t{\n\t\treturn this._coreServices.SettingsManager;\n\t}\n\n\tget log()\n\t{\n\t\treturn this._coreServices.Logging;\n\t}\n\n\tget services()\n\t{\n\t\treturn this._coreServices.ServiceManager.services;\n\t}\n\n\tget servicesMap()\n\t{\n\t\treturn this._coreServices.ServiceManager.servicesMap;\n\t}\n\n\tgetUUID()\n\t{\n\t\treturn this._coreServices.UUID.getUUID();\n\t}\n\n\tget fable()\n\t{\n\t\treturn this;\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.CoreServiceProviderBase = libFableServiceManager.CoreServiceProviderBase;\n\nmodule.exports.precedent = libFableSettings.precedent;\n},{\"./Fable-ServiceManager.js\":116,\"./services/Fable-Service-Anticipate.js\":118,\"./services/Fable-Service-CSVParser.js\":119,\"./services/Fable-Service-DataFormat.js\":120,\"./services/Fable-Service-DataGeneration.js\":122,\"./services/Fable-Service-DateManipulation.js\":123,\"./services/Fable-Service-EnvironmentData.js\":124,\"./services/Fable-Service-FilePersistence.js\":125,\"./services/Fable-Service-MetaTemplate.js\":126,\"./services/Fable-Service-Operation.js\":130,\"./services/Fable-Service-RestClient.js\":131,\"./services/Fable-Service-Template.js\":132,\"./services/Fable-Service-Utility.js\":133,\"cachetrax\":22,\"fable-log\":42,\"fable-settings\":47,\"fable-uuid\":49,\"manyfest\":70}],118:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nclass FableServiceAnticipate extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash);\n\n\t\tthis.serviceType = 'AsyncAnticipate';\n\n\t\t// The queue of operations waiting to run.\n\t\tthis.operationQueue = [];\n\t\tthis.erroredOperations = [];\n\n\t\tthis.executingOperationCount = 0;\n\t\tthis.completedOperationCount = 0;\n\n\t\tthis.maxOperations = 1;\n\n\t\tthis.lastError = undefined;\n\t\tthis.waitingFunctions = [];\n\t}\n\n\tcheckQueue()\n\t{\n\t\t// This checks to see if we need to start any operations.\n\t\tif (this.operationQueue.length > 0 && this.executingOperationCount < this.maxOperations)\n\t\t{\n\t\t\tlet tmpOperation = this.operationQueue.shift();\n\t\t\tthis.executingOperationCount += 1;\n\t\t\ttmpOperation(this.buildAnticipatorCallback());\n\t\t}\n\t\telse if (this.waitingFunctions.length > 0 && this.executingOperationCount < 1)\n\t\t{\n\t\t\t// If there are no operations left, and we have waiting functions, call them.\n\t\t\tfor (let i = 0; i < this.waitingFunctions.length; i++)\n\t\t\t{\n\t\t\t\tthis.waitingFunctions[i](this.lastError);\n\t\t\t}\n\t\t\t// Reset our state\n\t\t\tthis.lastError = undefined;\n\t\t\tthis.waitingFunctions = [];\n\t\t}\n\t}\n\n\t// Expects a function fAsynchronousFunction(fCallback)\n\tanticipate(fAsynchronousFunction)\n\t{\n\t\tthis.operationQueue.push(fAsynchronousFunction);\n\t\tthis.checkQueue();\n\t}\n\n\tbuildAnticipatorCallback()\n\t{\n\t\t// This uses closure-scoped state to track the callback state\n\t\tlet tmpCallbackState = (\n\t\t\t{\n\t\t\t\tCalled: false,\n\t\t\t\tError: undefined,\n\t\t\t\tOperationSet: this\n\t\t\t});\t\t\n\t\treturn hoistedCallback;\n\t\tfunction hoistedCallback(pError)\n\t\t{\n\t\t\tif (tmpCallbackState.Called)\n\t\t\t{\n\t\t\t\t// If they call the callback twice, throw an error\n\t\t\t\tthrow new Error(\"Anticipation async callback called twice...\");\n\t\t\t}\n\t\t\ttmpCallbackState.Called = true;\n\t\t\ttmpCallbackState.error = pError;\n\n\t\t\ttmpCallbackState.OperationSet.executingOperationCount -= 1;\n\t\t\ttmpCallbackState.OperationSet.completedOperationCount += 1;\n\n\t\t\ttmpCallbackState.OperationSet.checkQueue();\n\t\t}\n\t}\n\n\twait(fCallback)\n\t{\n\t\tthis.waitingFunctions.push(fCallback);\n\t\tthis.checkQueue();\n\t}\n}\n\nmodule.exports = FableServiceAnticipate;\n},{\"../Fable-ServiceManager.js\":116}],119:[function(require,module,exports){\nconst libFableServiceProviderBase = require('fable-serviceproviderbase');\n/**\n* Parsing CSVs. Why? Because it's a thing that needs to be done.\n*\n* 1. And the other node CSV parsers had issues with the really messy files we had.\n* \n*\n* 2. None of the CSV parsers dealt with and multi-line quoted string columns\n* which are apparently a-ok according to the official spec.\n* Plus a lot of them are asynchronous because apparently that's the best way to\n* do anything; unfortunately some files have a sequence issue with that.\n*\n* @class CSVParser\n*/\nclass CSVParser extends libFableServiceProviderBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash);\n\n\t\tthis.serviceType = 'CSVParser';\n\n this.Header = [];\n this.HeaderFieldNames = [];\n\n this.Delimiter = ',';\n this.QuoteCharacter = '\"';\n\n this.CleanCharacters = ['\\r'];\n\n this.HeaderLineIndex = 0;\n this.HasHeader = true;\n this.HasSetHeader = false;\n this.EmitHeader = false;\n\n this.EmitJSON = true;\n\n this.EscapedQuoteString = '&quot;';\n\n // Current Line Parsing State\n this.CurrentLine = '';\n this.CurrentRecord = [];\n\n this.InQuote = false;\n this.InEscapedQuote = false;\n\n this.LinesParsed = 0;\n this.RowsEmitted = 0;\n }\n\n marshalRowToJSON(pRowArray)\n {\n if (!Array.isArray(pRowArray))\n {\n return false;\n }\n\n for (let i = this.HeaderFieldNames.length; i < pRowArray.length; i++)\n {\n this.HeaderFieldNames[i] = `${i}`;\n }\n\n let tmpObject = {};\n\n for (let i = 0; i < pRowArray.length; i++)\n {\n tmpObject[this.HeaderFieldNames[i]] = pRowArray[i];\n }\n\n return tmpObject;\n }\n\n // Set the header data, for use in marshalling to JSON.\n setHeader (pHeaderArray)\n {\n this.Header = pHeaderArray;\n\n for (let i = 0; i < this.Header.length; i++)\n {\n if (typeof(this.Header[i]) == 'undefined')\n {\n this.HeaderFieldNames[i] = `${i}`;\n }\n else\n {\n this.HeaderFieldNames[i] = this.Header[i].toString();\n }\n }\n }\n\n resetRowState()\n {\n this.CurrentRecord = [];\n }\n\n pushLine()\n {\n for (let i = 0; i < this.CleanCharacters.length; i++)\n {\n this.CurrentLine = this.CurrentLine.replace(this.CleanCharacters[i],'');\n }\n this.CurrentRecord.push(this.CurrentLine);\n this.CurrentLine = '';\n }\n\n emitRow(pFormatAsJSON)\n {\n let tmpFormatAsJSON = (typeof(pFormatAsJSON) == 'undefined') ? this.EmitJSON : pFormatAsJSON;\n\n this.RowsEmitted++;\n let tmpCompletedRecord = this.CurrentRecord;\n this.CurrentRecord = [];\n\n if (tmpFormatAsJSON)\n {\n return this.marshalRowToJSON(tmpCompletedRecord);\n }\n else\n {\n return tmpCompletedRecord;\n }\n }\n\n parseCSVLine (pLineString)\n {\n this.LinesParsed++;\n\n for (let i = 0; i < pLineString.length; i++)\n {\n if ((!this.InQuote) && (pLineString[i] == this.Delimiter))\n {\n this.pushLine();\n }\n else if (pLineString[i] == this.QuoteCharacter)\n {\n // If we are in the second part of an escaped quote, ignore it.\n if (this.InEscapedQuote)\n {\n this.InEscapedQuote = false;\n }\n // If we aren't in a quote, enter quote\n else if (!this.InQuote)\n {\n this.InQuote = true;\n }\n // We are in a quote, so peek forward to see if this is an \"escaped\" quote pair\n else if ((i < pLineString.length) && (pLineString[i+1] == this.QuoteCharacter))\n {\n this.CurrentLine += this.EscapedQuoteString;\n this.InEscapedQuote = true;\n }\n // We are in a quote, this isn't an \"escaped\" quote pair, so go out of quote mode\n else\n {\n this.InQuote = false;\n }\n }\n else\n {\n this.CurrentLine += pLineString[i];\n }\n }\n\n // See if we are in a multiline quoted entry -- if not, emit the row.\n if (!this.InQuote)\n {\n // Push the last remaining column from the buffer to the current line.\n this.pushLine();\n\n // Check to see if there is a header -- and if so, if this is the header row\n if (this.HasHeader && !this.HasSetHeader && (this.RowsEmitted == this.HeaderLineIndex))\n {\n this.HasSetHeader = true;\n // Override the format as json bit\n this.setHeader(this.emitRow(false));\n\n // No matter what, formatting this as JSON is silly and we don't want to go there anyway.\n if (this.EmitHeader)\n {\n return this.Header;\n }\n else\n {\n return false;\n }\n }\n else\n {\n return this.emitRow();\n }\n }\n else\n {\n return false;\n }\n };\n}\n\nmodule.exports = CSVParser;\n},{\"fable-serviceproviderbase\":44}],120:[function(require,module,exports){\nconst libFableServiceProviderBase = require('fable-serviceproviderbase');\n/**\n* Data Formatting and Translation Functions\n*\n* @class DataFormat\n*/\nclass DataFormat extends libFableServiceProviderBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash)\n\n\t\tthis.serviceType = 'DataArithmatic';\n\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_formatterCleanNonAlphaChar = /[^a-zA-Z]/gi;\n\t\tthis._Regex_formatterCapitalizeEachWord = /([a-zA-Z]+)/g;\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\treturn 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\tlet tmpHash = 0;\n\t\tlet tmpStringLength = pString.length;\n\t\tlet tmpCharacterIndex = 0;\n\n\t\twhile (tmpCharacterIndex < tmpStringLength)\n\t\t{\n\t\t\ttmpHash = (tmpHash << 5) - tmpHash + pString.charCodeAt(tmpCharacterIndex++) | 0;\n\t\t}\n\n\t\treturn `${this._Value_Prefix_StringHash}${tmpHash}`;\n\t}\n\n\tcapitalizeEachWord (pString)\n\t{\n\t\treturn pString.replace(this._Regex_formatterCapitalizeEachWord,\n\t\t\t(pMatch) =>\n\t\t\t{\n\t\t\t\treturn pMatch.charAt(0).toUpperCase() + pMatch.substr(1);\n\t\t\t});\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 * Clean a string of any non-alpha characters (including numbers)\n\t *\n\t * @param {*} pString\n\t * @returns\n\t */\n\tcleanNonAlphaCharacters (pString)\n\t{\n\t\tif ((typeof(pString) == 'string') && (pString != ''))\n\t\t{\n\t\t\treturn pString.replace(this._Regex_formatterCleanNonAlphaChar, this._Value_Clean_formatterCleanNonAlpha);\n\t\t}\n\n\t\treturn '';\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\t// Reverse, because it's easier to do things from the left, given arbitrary digit counts\n\t\tlet tmpReversed = this.stringReverse(pString);\n\t\t// Add commas every three characters\n\t\tlet tmpReversedWithCommas = tmpReversed.match(this._Regex_formatterInsertCommas).join(',');\n\t\t// Reverse again (back to normal direction)\n\t\treturn 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\t// If the regex doesn't match, `replace` returns the string unmodified\n\t\treturn (pNumber.toString()).replace\n\t\t(\n\t\t\tthis._Regex_formatterAddCommasToNumber,\n\t\t\tthis.processAddCommasToNumberRegex.bind(this)\n\t\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\tif (isNaN(pValue))\n\t\t{\n\t\t\treturn this._Value_NaN_Currency;\n\t\t}\n\n\t\tif (pValue === null || pValue === undefined)\n\t\t{\n\t\t\treturn this._Value_NaN_Currency;\n\t\t}\n\n\t\tlet tmpDollarAmountArbitrary = this.fable.Utility.bigNumber(pValue);\n\t\tlet tmpDollarAmount = tmpDollarAmountArbitrary.toFixed(2);\n\n\t\tif (isNaN(tmpDollarAmount))\n\t\t{\n\t\t\t// Try again and see if what was passed in was a dollars string.\n\t\t\tif (typeof(pValue) == 'string')\n\t\t\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\t\t\ttmpDollarAmount = parseFloat(pValue.replace(this._Value_MoneySign_Currency,'').replace(this._Regex_formatterDollarsRemoveCommas,'')).toFixed(2);\n\t\t\t}\n\t\t\t// If we didn't get a number, return the \"not a number\" string.\n\t\t\tif (isNaN(tmpDollarAmount))\n\t\t\t{\n\t\t\t\treturn this._Value_NaN_Currency;\n\t\t\t}\n\t\t}\n\n\t\t// TODO: Get locale data and use that for this stuff.\n\t\treturn `$${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\tlet tmpDigits = (typeof(pDigits) == 'undefined') ? 2 : pDigits;\n\n\t\tif (isNaN(pValue))\n\t\t{\n\t\t\tlet tmpZed = 0;\n\t\t\treturn tmpZed.toFixed(tmpDigits);\n\t\t}\n\n\t\tif (pValue === null || pValue === undefined)\n\t\t{\n\t\t\treturn '';\n\t\t}\n\n\t\tlet tmpAmountArbitrary = this.fable.Utility.bigNumber(pValue);\n\t\tlet tmpValue = tmpAmountArbitrary.toFixed(tmpDigits);\n\n\t\tif (isNaN(tmpValue))\n\t\t{\n\t\t\tlet tmpZed = 0;\n\t\t\treturn tmpZed.toFixed(tmpDigits);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn tmpValue;\n\t\t}\n\t}\n\n\n\t/**\n\t * Generate a reapeating padding string to be appended before or after depending on \n\t * which padding function it uses.\n\t *\n\t * @param {*} pString\n\t * @param {number} pTargetLength\n\t * @returns {string} pPadString\n\t */\n\tstringGeneratePaddingString(pString, pTargetLength, pPadString)\n\t{\n\t\tlet tmpTargetLength = pTargetLength >> 0;\n\t\tlet tmpPadString = String((typeof pPadString !== 'undefined' ? pPadString : ' '));\n\t\tif (pString.length > pTargetLength)\n\t\t{\n\t\t\t// No padding string if the source string is already longer than the target length, return an empty string\n\t\t\treturn '';\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlet tmpPadLength = pTargetLength - pString.length;\n\t\t\tif (tmpPadLength > tmpPadString.length)\n\t\t\t{\n\t\t\t\ttmpPadString += tmpPadString.repeat(tmpTargetLength / tmpPadString.length);\n\t\t\t}\n\t\t\treturn tmpPadString.slice(0, tmpPadLength);\n\t\t}\n\t}\n\n\t/**\n\t * Pad the start of a string.\n\t *\n\t * @param {*} pString\n\t * @param {number} pTargetLength\n\t * @returns {string} pPadString\n\t */\n\tstringPadStart = function(pString, pTargetLength, pPadString)\n\t{\n\t\tlet tmpString = pString.toString();\n\t\treturn this.stringGeneratePaddingString(tmpString, pTargetLength, pPadString) + tmpString;\n\t}\n\n\t/**\n\t * Pad the end of a string.\n\t *\n\t * @param {*} pString\n\t * @param {number} pTargetLength\n\t * @returns {string} pPadString\n\t */\n\tstringPadEnd = function(pString, pTargetLength, pPadString)\n\t{\n\t\tlet tmpString = pString.toString();\n\t\treturn tmpString + this.stringGeneratePaddingString(tmpString, pTargetLength, pPadString);\n\t}\n\n\t/*************************************************************************\n\t * Time Formatting Functions (milliseconds)\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Format a time length in milliseconds into a human readable string.\n\t * @param {number} pTimeSpan \n\t * @returns {string} - HH:MM:SS.mmm\n\t */\n\tformatTimeSpan(pTimeSpan)\n\t{\n\t\tif (typeof(pTimeSpan) != 'number')\n\t\t{\n\t\t\treturn '';\n\t\t}\n\n\t\tlet tmpMs = parseInt(pTimeSpan%1000);\n\t\tlet tmpSeconds = parseInt((pTimeSpan/1000)%60);\n\t\tlet tmpMinutes = parseInt((pTimeSpan/(1000*60))%60);\n\t\tlet tmpHours = parseInt(pTimeSpan/(1000*60*60));\n\n\t\treturn `${this.stringPadStart(tmpHours,2,'0')}:${this.stringPadStart(tmpMinutes,2,'0')}:${this.stringPadStart(tmpSeconds,2,'0')}.${this.stringPadStart(tmpMs,3,'0')}`;\n\t}\n\n\t/**\n\t * Format the time delta between two times in milliseconds into a human readable string.\n\t * \n\t * @param {number} pTimeStart \n\t * @param {number} pTimeEnd \n\t * @returns {string} - HH:MM:SS.mmm\n\t */\n\tformatTimeDelta(pTimeStart, pTimeEnd)\n\t{\n\t\tif ((typeof(pTimeStart) != 'number') || (typeof(pTimeEnd) != 'number'))\n\t\t{\n\t\t\treturn '';\n\t\t}\n\n\t\treturn this.formatTimeSpan(pTimeEnd-pTimeStart);\n\t}\n\n\t// THE FOLLOWING TERRIBLE FUNCTIONS ARE FOR QT / WKHTMLTOPDF when luxon and moment don't work so well\n\tgetMonthFromDate (pJavascriptDate)\n\t{\n\t\tvar tmpMonths = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"];\n\t\treturn tmpMonths[pJavascriptDate.getMonth()];\n\t}\n\n\tgetMonthAbbreviatedFromDate (pJavascriptDate)\n\t{\n\t\tvar tmpMonths = [\"Jan\", \"Feb\", \"Mar\", \"Apr\", \"May\", \"Jun\", \"Jul\", \"Aug\", \"Sep\", \"Oct\", \"Nov\", \"Dec\"];\n\t\treturn tmpMonths[pJavascriptDate.getMonth()];\n\t}\n\n\tformatMonthDayYearFromDate (pJavascriptDate, pStrict)\n\t{\n\t\tlet tmpStrict = (typeof(pStrict) !== 'undefined') ? pStrict : false;\n\n\t\tlet tmpMonth = pJavascriptDate.getMonth() + 1;\n\t\tlet tmpDay = pJavascriptDate.getDate();\n\t\tlet tmpYear = pJavascriptDate.getFullYear();\n\t\t\n\t\tif (tmpStrict)\n\t\t{\n\t\t\ttmpMonth = this.stringPadStart(tmpMonth, 2, '0');\n\t\t\ttmpDay = this.stringPadStart(tmpDay, 2, '0');\n\t\t\ttmpYear = this.stringPadStart(tmpYear, 4, '0');\n\t\t}\n\n\t\treturn `${tmpMonth}/${tmpDay}/${tmpYear}`;\n\t}\n\t\n\tformatSortableStringFromDate (pDate)\n\t{\n\t\treturn pDate.getFullYear()+this.stringPadStart(pDate.getMonth(),2,'0')+this.stringPadStart(pDate.getDate(),2,'0');\n\t}\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\tlet tmpStringSplitLocation = pString.indexOf(pMatch);\n\n\t\tif ((tmpStringSplitLocation < 0) || ((tmpStringSplitLocation + pMatch.length) >= pString.length))\n\t\t{\n\t\t\treturn '';\n\t\t}\n\n\t\treturn 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\tlet tmpString = (typeof(pString) == 'string') ? pString : '';\n\t\tlet tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t\tlet tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t\tlet tmpEnclosureCount = 0;\n\t\tlet tmpEnclosureDepth = 0;\n\t\tfor (let i = 0; i < tmpString.length; i++)\n\t\t{\n\t\t\t// This is the start of an enclosure\n\t\t\tif (tmpString[i] == tmpEnclosureStart)\n\t\t\t{\n\t\t\t\tif (tmpEnclosureDepth == 0)\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureCount++;\n\t\t\t\t}\n\t\t\t\ttmpEnclosureDepth++;\n\t\t\t}\n\t\t\telse if (tmpString[i] == tmpEnclosureEnd)\n\t\t\t{\n\t\t\t\ttmpEnclosureDepth--;\n\t\t\t}\n\t\t}\n\n\t\treturn 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\tlet tmpString = (typeof(pString) == 'string') ? pString : '';\n\t\tlet tmpEnclosureIndexToGet = (typeof(pEnclosureIndexToGet) == 'number') ? pEnclosureIndexToGet : 0;\n\t\tlet tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t\tlet tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t\tlet tmpEnclosureCount = 0;\n\t\tlet tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t\tlet tmpEnclosedValueStartIndex = 0;\n\t\tlet tmpEnclosedValueEndIndex = 0;\n\n\t\tfor (let i = 0; i < tmpString.length; i++)\n\t\t{\n\t\t\t// This is the start of an enclosure\n\t\t\tif (tmpString[i] == tmpEnclosureStart)\n\t\t\t{\n\t\t\t\ttmpEnclosureDepth++;\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\t\t}\n\t\t\t// This is the end of an enclosure\n\t\t\telse if (tmpString[i] == tmpEnclosureEnd)\n\t\t\t{\n\t\t\t\ttmpEnclosureDepth--;\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\t\t}\n\t\t}\n\n\t\tif (tmpEnclosureCount <= tmpEnclosureIndexToGet)\n\t\t{\n\t\t\t// Return an empty string if the enclosure is not found\n\t\t\treturn '';\n\t\t}\n\n\t\tif ((tmpEnclosedValueEndIndex > 0) && (tmpEnclosedValueEndIndex > tmpEnclosedValueStartIndex))\n\t\t{\n\t\t\treturn tmpString.substring(tmpEnclosedValueStartIndex+1, tmpEnclosedValueEndIndex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn tmpString.substring(tmpEnclosedValueStartIndex+1);\n\t\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\tlet tmpString = (typeof(pString) == 'string') ? pString : '';\n\t\tlet tmpEnclosureIndexToRemove = (typeof(pEnclosureIndexToRemove) == 'number') ? pEnclosureIndexToRemove : 0;\n\t\tlet tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t\tlet tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t\tlet tmpEnclosureCount = 0;\n\t\tlet tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t\tlet tmpEnclosureStartIndex = 0;\n\t\tlet tmpEnclosureEndIndex = 0;\n\n\t\tfor (let i = 0; i < tmpString.length; i++)\n\t\t{\n\t\t\t// This is the start of an enclosure\n\t\t\tif (tmpString[i] == tmpEnclosureStart)\n\t\t\t{\n\t\t\t\ttmpEnclosureDepth++;\n\n\t\t\t\tif (tmpEnclosureDepth == 1)\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureCount++;\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\t\t\t}\n\t\t\t}\n\t\t\telse if (tmpString[i] == tmpEnclosureEnd)\n\t\t\t{\n\t\t\t\ttmpEnclosureDepth--;\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\t\t}\n\t\t}\n\n\t\tif (tmpEnclosureCount <= tmpEnclosureIndexToRemove)\n\t\t{\n\t\t\treturn tmpString;\n\t\t}\n\n\t\tlet tmpReturnString = '';\n\n\t\tif (tmpEnclosureStartIndex > 1)\n\t\t{\n\t\t\ttmpReturnString = tmpString.substring(0, tmpEnclosureStartIndex);\n\t\t}\n\n\t\tif ((tmpString.length > (tmpEnclosureEndIndex + 1)) && (tmpEnclosureEndIndex > tmpEnclosureStartIndex))\n\t\t{\n\t\t\ttmpReturnString += tmpString.substring(tmpEnclosureEndIndex+1);\n\t\t}\n\n\t\treturn tmpReturnString;\n\t}\n}\n\nmodule.exports = DataFormat;\n},{\"fable-serviceproviderbase\":44}],121:[function(require,module,exports){\nmodule.exports={\n\t\"DefaultIntegerMinimum\": 0,\n\t\"DefaultIntegerMaximum\": 9999999,\n\n\t\"DefaultNumericStringLength\": 10,\n\n\t\"MonthSet\": [\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"],\n\n\t\"WeekDaySet\":[\"Sunday\",\"Monday\",\"Tuesday\",\"Wednesday\",\"Thursday\",\"Friday\",\"Saturday\"],\n\n\t\"ColorSet\": \n\t\t[\n\t\t\t\"Red\", \"Orange\", \"Yellow\", \"Green\", \"Blue\", \"Indigo\", \"Violet\", \"Pink\", \"Purple\", \"Turquoise\", \"Gold\",\n\t\t\t\"Lime\", \"Maroon\", \"Navy\", \"Coral\", \"Teal\", \"Brown\", \"White\", \"Black\", \"Sky\", \"Berry\",\n\t\t\t\"Grey\", \"Straw\", \"Silver\", \"Sapphire\"\n\t\t],\n\n\t\"SurNameSet\":\n\t\t[\n\t\t\t\"Smith\", \"Johnson\", \"Williams\", \"Brown\", \"Jones\", \"Miller\", \"Davis\", \"Garcia\", \"Rodriguez\", \"Wilson\",\n\t\t\t\"Martinez\", \"Anderson\", \"Taylor\", \"Thomas\", \"Hernandez\", \"Moore\", \"Martin\", \"Jackson\", \"Thompson\", \"White\",\n\t\t\t\"Lopez\", \"Lee\", \"Gonzalez\", \"Harris\", \"Clark\", \"Lewis\", \"Robinson\", \"Walker\", \"Perez\", \"Hall\",\n\t\t\t\"Young\", \"Allen\", \"Sanchez\", \"Wright\", \"King\", \"Scott\", \"Green\", \"Baker\", \"Adams\", \"Nelson\",\n\t\t\t\"Hill\", \"Ramirez\", \"Campbell\", \"Mitchell\", \"Roberts\", \"Carter\", \"Phillips\", \"Evans\", \"Turner\", \"Torres\",\n\t\t\t\"Parker\", \"Collins\", \"Edwards\", \"Stewart\", \"Flores\", \"Morris\", \"Nguyen\", \"Murphy\", \"Rivera\", \"Cook\",\n\t\t\t\"Rogers\", \"Morgan\", \"Peterson\", \"Cooper\", \"Reed\", \"Bailey\", \"Bell\", \"Gomez\", \"Kelly\", \"Howard\",\n\t\t\t\"Ward\", \"Cox\", \"Diaz\", \"Richardson\", \"Wood\", \"Watson\", \"Brooks\", \"Bennett\", \"Gray\", \"James\",\n\t\t\t\"Reyes\", \"Cruz\", \"Hughes\", \"Price\", \"Myers\", \"Long\", \"Foster\", \"Sanders\", \"Ross\", \"Morales\",\n\t\t\t\"Powell\", \"Sullivan\", \"Russell\", \"Ortiz\", \"Jenkins\", \"Gutierrez\", \"Perry\", \"Butler\", \"Barnes\", \"Fisher\"\n\t\t],\n\n\t\"NameSet\":\n\t\t[\n\t\t\t\"Mary\", \"Patricia\", \"Jennifer\", \"Linda\", \"Elizabeth\", \"Barbara\", \"Susan\", \"Jessica\", \"Sarah\", \"Karen\",\n\t\t\t\"Lisa\", \"Nancy\", \"Betty\", \"Sandra\", \"Margaret\", \"Ashley\", \"Kimberly\", \"Emily\", \"Donna\", \"Michelle\",\n\t\t\t\"Carol\", \"Amanda\", \"Melissa\", \"Deborah\", \"Stephanie\", \"Dorothy\", \"Rebecca\", \"Sharon\", \"Laura\", \"Cynthia\",\n\t\t\t\"Amy\", \"Kathleen\", \"Angela\", \"Shirley\", \"Brenda\", \"Emma\", \"Anna\", \"Pamela\", \"Nicole\", \"Samantha\",\n\t\t\t\"Katherine\", \"Christine\", \"Helen\", \"Debra\", \"Rachel\", \"Carolyn\", \"Janet\", \"Maria\", \"Catherine\", \"Heather\",\n\t\t\t\"Diane\", \"Olivia\", \"Julie\", \"Joyce\", \"Victoria\", \"Ruth\", \"Virginia\", \"Lauren\", \"Kelly\", \"Christina\",\n\t\t\t\"Joan\", \"Evelyn\", \"Judith\", \"Andrea\", \"Hannah\", \"Megan\", \"Cheryl\", \"Jacqueline\", \"Martha\", \"Madison\",\n\t\t\t\"Teresa\", \"Gloria\", \"Sara\", \"Janice\", \"Ann\", \"Kathryn\", \"Abigail\", \"Sophia\", \"Frances\", \"Jean\",\n\t\t\t\"Alice\", \"Judy\", \"Isabella\", \"Julia\", \"Grace\", \"Amber\", \"Denise\", \"Danielle\", \"Marilyn\", \"Beverly\",\n\t\t\t\"Charlotte\", \"Natalie\", \"Theresa\", \"Diana\", \"Brittany\", \"Doris\", \"Kayla\", \"Alexis\", \"Lori\", \"Marie\",\n\t\t\t\"James\", \"Robert\", \"John\", \"Michael\", \"David\", \"William\", \"Richard\", \"Joseph\", \"Thomas\", \"Christopher\",\n\t\t\t\"Charles\", \"Daniel\", \"Matthew\", \"Anthony\", \"Mark\", \"Donald\", \"Steven\", \"Andrew\", \"Paul\", \"Joshua\",\n\t\t\t\"Kenneth\", \"Kevin\", \"Brian\", \"George\", \"Timothy\", \"Ronald\", \"Jason\", \"Edward\", \"Jeffrey\", \"Ryan\",\n\t\t\t\"Jacob\", \"Gary\", \"Nicholas\", \"Eric\", \"Jonathan\", \"Stephen\", \"Larry\", \"Justin\", \"Scott\", \"Brandon\",\n\t\t\t\"Benjamin\", \"Samuel\", \"Gregory\", \"Alexander\", \"Patrick\", \"Frank\", \"Raymond\", \"Jack\", \"Dennis\", \"Jerry\",\n\t\t\t\"Tyler\", \"Aaron\", \"Jose\", \"Adam\", \"Nathan\", \"Henry\", \"Zachary\", \"Douglas\", \"Peter\", \"Kyle\",\n\t\t\t\"Noah\", \"Ethan\", \"Jeremy\", \"Walter\", \"Christian\", \"Keith\", \"Roger\", \"Terry\", \"Austin\", \"Sean\",\n\t\t\t\"Gerald\", \"Carl\", \"Harold\", \"Dylan\", \"Arthur\", \"Lawrence\", \"Jordan\", \"Jesse\", \"Bryan\", \"Billy\",\n\t\t\t\"Bruce\", \"Gabriel\", \"Joe\", \"Logan\", \"Alan\", \"Juan\", \"Albert\", \"Willie\", \"Elijah\", \"Wayne\",\n\t\t\t\"Randy\", \"Vincent\", \"Mason\", \"Roy\", \"Ralph\", \"Bobby\", \"Russell\", \"Bradley\", \"Philip\", \"Eugene\"\n\t\t]\n}\n},{}],122:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nclass FableServiceDataGeneration extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash);\n\n\t\tthis.serviceType = 'DataGeneration';\n\n\t\tthis.defaultData = require('./Fable-Service-DataGeneration-DefaultValues.json');\n\t}\n\n\t// Return a random integer between pMinimum and pMaximum\n\trandomIntegerBetween(pMinimum, pMaximum)\n\t{\n\t\treturn Math.floor(Math.random() * (pMaximum - pMinimum)) + pMinimum;\n\t}\n\t// Return a random integer up to the passed-in maximum\n\trandomIntegerUpTo(pMaximum)\n\t{\n\t\treturn this.randomIntegerBetween(0, pMaximum);\n\t}\n\t// Return a random integer between 0 and 9999999\n\trandomInteger()\n\t{\n\t\treturn Math.floor(Math.random()*this.defaultData.DefaultIntegerMaximum);\n\t}\n\n\n\trandomNumericString(pLength, pMaxNumber)\n\t{\n\t\tlet tmpLength = (typeof(pLength) === 'undefined') ? 10 : pLength;\n\t\tlet tmpMaxNumber = (typeof(pMaxNumber) === 'undefined') ? ((10 ** tmpLength) - 1) : pMaxNumber;\n\n\t\treturn this.services.DataFormat.stringPadStart(this.randomIntegerUpTo(tmpMaxNumber), pLength, '0');\n\t}\n\n\n\trandomMonth()\n\t{\n\t\treturn this.defaultData.MonthSet[this.randomIntegerUpTo(this.defaultData.MonthSet.length-1)];\n\t}\n\trandomDayOfWeek()\n\t{\n\t\treturn this.defaultData.WeekDaySet[this.randomIntegerUpTo(this.defaultData.WeekDaySet.length-1)];\n\t}\n\n\n\trandomColor()\n\t{\n\t\treturn this.defaultData.ColorSet[this.randomIntegerUpTo(this.defaultData.ColorSet.length-1)];\n\t}\n\n\n\trandomName()\n\t{\n\t\treturn this.defaultData.NameSet[this.randomIntegerUpTo(this.defaultData.NameSet.length-1)];\n\t}\n\trandomSurname()\n\t{\n\t\treturn this.defaultData.SurNameSet[this.randomIntegerUpTo(this.defaultData.SurNameSet.length-1)];\n\t}\n}\n\nmodule.exports = FableServiceDataGeneration;\n},{\"../Fable-ServiceManager.js\":116,\"./Fable-Service-DataGeneration-DefaultValues.json\":121}],123:[function(require,module,exports){\nconst libFableServiceProviderBase = require('fable-serviceproviderbase');\n/**\n* Date management a la Moment using days.js\n*\n* @class DateManipulation\n*/\nclass DateManipulation extends libFableServiceProviderBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash)\n\n\t\tthis.serviceType = 'Dates';\n\n\t\tthis.dayJS = require('dayjs');\n\n\t\t// Include the `weekOfYear` plugin\n\t\tthis.plugin_weekOfYear = require('dayjs/plugin/weekOfYear');\n\t\tthis.dayJS.extend(this.plugin_weekOfYear);\n\t\t// Include the `weekday` plugin\n\t\tthis.plugin_weekday = require('dayjs/plugin/weekday');\n\t\tthis.dayJS.extend(this.plugin_weekday);\n\t\t// Include the `isoWeek` plugin\n\t\tthis.plugin_isoWeek = require('dayjs/plugin/isoWeek');\n\t\tthis.dayJS.extend(this.plugin_isoWeek);\n\t\t// Include the `timezone` plugin\n\t\tthis.plugin_timezone = require('dayjs/plugin/timezone');\n\t\tthis.dayJS.extend(this.plugin_timezone);\n\t\t// Include the `relativetime` plugin\n\t\tthis.plugin_relativetime = require('dayjs/plugin/relativeTime');\n\t\tthis.dayJS.extend(this.plugin_relativetime);\n\t\t// Include the `utc` plugin\n\t\tthis.plugin_utc = require('dayjs/plugin/utc');\n\t\tthis.dayJS.extend(this.plugin_utc);\n\t\t// Include the `advancedFormat` plugin\n\t\tthis.plugin_advancedFormat = require('dayjs/plugin/advancedFormat');\n\t\tthis.dayJS.extend(this.plugin_advancedFormat);\n\n\t\t// A developer can include locales if they want\n\t\t// You would do the following:\n\t\t// const localeDE = require('dayjs/locale/de');\n\t\t// _Fable.Dates.dayJS.locale('de');\n\t}\n}\n\nmodule.exports = DateManipulation;\n},{\"dayjs\":28,\"dayjs/plugin/advancedFormat\":29,\"dayjs/plugin/isoWeek\":30,\"dayjs/plugin/relativeTime\":31,\"dayjs/plugin/timezone\":32,\"dayjs/plugin/utc\":33,\"dayjs/plugin/weekOfYear\":34,\"dayjs/plugin/weekday\":35,\"fable-serviceproviderbase\":44}],124:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nclass FableServiceEnvironmentData extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'EnvironmentData';\n\n\t\tthis.Environment = `node.js`;\n\t}\n}\n\nmodule.exports = FableServiceEnvironmentData;\n},{\"../Fable-ServiceManager.js\":116}],125:[function(require,module,exports){\n(function (process){(function (){\nconst libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nconst libFS = require('fs');\nconst libPath = require('path');\nconst libReadline = require('readline');\n\n\nclass FableServiceFilePersistence extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash);\n\n\t\tthis.serviceType = 'FilePersistence';\n\n\t\tif (!this.options.hasOwnProperty('Mode'))\n\t\t{\n\t\t\tthis.options.Mode = parseInt('0777', 8) & ~process.umask();\n\t\t}\n\n\t\tthis.libFS = libFS;\n\t\tthis.libPath = libPath;\n\t\tthis.libReadline = libReadline;\n\t}\n\n\tjoinPath(...pPathArray)\n\t{\n\t\treturn libPath.resolve(...pPathArray);\n\t}\n\n\texistsSync(pPath)\n\t{\n\t\treturn libFS.existsSync(pPath);\n\t}\n\n\texists(pPath, fCallback)\n\t{\n\t\tlet tmpFileExists = this.existsSync(pPath);;\n\n\t\treturn fCallback(null, tmpFileExists);\n\t}\n\n\twriteFileSync(pFileName, pFileContent, pOptions)\n\t{\n\t\tlet tmpOptions = (typeof(pOptions) === 'undefined') ? 'utf8' : pOptions;\n\t\treturn libFS.writeFileSync(pFileName, pFileContent, tmpOptions);\n\t}\n\n\tappendFileSync(pFileName, pAppendContent, pOptions)\n\t{\n\t\tlet tmpOptions = (typeof(pOptions) === 'undefined') ? 'utf8' : pOptions;\n\t\treturn libFS.appendFileSync(pFileName, pAppendContent, tmpOptions);\n\t}\n\n\tdeleteFileSync(pFileName)\n\t{\n\t\treturn libFS.unlinkSync(pFileName);\n\t}\n\n\tdeleteFolderSync(pFileName)\n\t{\n\t\treturn libFS.rmdirSync(pFileName);\n\t}\n\n\twriteFileSyncFromObject(pFileName, pObject)\n\t{\n\t\treturn this.writeFileSync(pFileName, JSON.stringify(pObject, null, 4));\n\t}\n\n\twriteFileSyncFromArray(pFileName, pFileArray)\n\t{\n\t\tif (!Array.isArray(pFileArray))\n\t\t{\n\t\t\tthis.log.error(`File Persistence Service attempted to write ${pFileName} from array but the expected array was not an array (it was a ${typeof(pFileArray)}).`);\n\t\t\treturn Error('Attempted to write ${pFileName} from array but the expected array was not an array (it was a ${typeof(pFileArray)}).');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (let i = 0; i < pFileArray.length; i++)\n\t\t\t{\n\t\t\t\treturn this.appendFileSync(pFileName, `${pFileArray[i]}\\n`);\n\t\t\t}\n\t\t}\n\t}\n\n\tlineReaderFactory(pFilePath, fOnLine, fOnComplete, fOnError)\n\t{\n\t\tlet tmpLineReader = {};\n\n\t\tif (typeof(pFilePath) != 'string')\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\ttmpLineReader.filePath = pFilePath;\n\n\t\ttmpLineReader.fileStream = libFS.createReadStream(tmpLineReader.filePath);\n\n\t\ttmpLineReader.reader = libReadline.createInterface({ input: tmpLineReader.fileStream, crlfDelay: Infinity });\n\n\t\tif (typeof(fOnError) === 'function')\n\t\t{\n\t\t\ttmpLineReader.reader.on('error', fOnError);\n\t\t}\n\n\t\ttmpLineReader.reader.on('line', (typeof(fOnLine) === 'function') ? fOnLine : () => {});\n\n\t\tif (typeof(fOnComplete) === 'function')\n\t\t{\n\t\t\ttmpLineReader.reader.on('close', fOnComplete);\n\t\t}\n\n\t\treturn tmpLineReader;\n\t}\n\n\t// Folder management\n\tmakeFolderRecursive(pParameters, fCallback)\n\t{\n\t\tlet tmpParameters = pParameters;\n\n\t\tif (typeof(pParameters) == 'string')\n\t\t{\n\t\t\ttmpParameters = { Path: pParameters };\n\t\t}\n\t\telse if (typeof(pParameters) !== 'object')\n\t\t{\n\t\t\tfCallback(new Error('Parameters object or string not properly passed to recursive folder create.'));\n\t\t\treturn false;\n\t\t}\n\n\t\tif ((typeof(tmpParameters.Path) !== 'string'))\n\t\t{\n\t\t\tfCallback(new Error('Parameters object needs a path to run the folder create operation.'));\n\t\t\treturn false;\n\t\t}\n\n\t\tif (!tmpParameters.hasOwnProperty('Mode'))\n\t\t{\n\t\t\ttmpParameters.Mode = this.options.Mode;\n\t\t}\n\n\t\t// Check if we are just starting .. if so, build the initial state for our recursive function\n\t\tif (typeof(tmpParameters.CurrentPathIndex) === 'undefined')\n\t\t{\n\t\t\t// Build the tools to start recursing\n\t\t\ttmpParameters.ActualPath = libPath.normalize(tmpParameters.Path);\n\t\t\ttmpParameters.ActualPathParts = tmpParameters.ActualPath.split(libPath.sep);\n\t\t\ttmpParameters.CurrentPathIndex = 0;\n\t\t\ttmpParameters.CurrentPath = '';\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// This is not our first run, so we will continue the recursion.\n\t\t\t// Build the new base path\n\t\t\tif (tmpParameters.CurrentPath == libPath.sep)\n\t\t\t{\n\t\t\t\ttmpParameters.CurrentPath = tmpParameters.CurrentPath + tmpParameters.ActualPathParts[tmpParameters.CurrentPathIndex];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttmpParameters.CurrentPath = tmpParameters.CurrentPath + libPath.sep + tmpParameters.ActualPathParts[tmpParameters.CurrentPathIndex];\n\t\t\t}\n\n\t\t\t// Increment the path index\n\t\t\ttmpParameters.CurrentPathIndex++;\n\t\t}\n\n\t\t// Check if the path is fully complete\n\t\tif (tmpParameters.CurrentPathIndex >= tmpParameters.ActualPathParts.length)\n\t\t{\n\t\t\treturn fCallback(null);\n\t\t}\n\n\t\t// Check if the path exists (and is a folder)\n\t\tlibFS.open(tmpParameters.CurrentPath + libPath.sep + tmpParameters.ActualPathParts[tmpParameters.CurrentPathIndex], 'r',\n\t\t\t(pError, pFileDescriptor)=>\n\t\t\t{\n\t\t\t\tif (pFileDescriptor)\n\t\t\t\t{\n\t\t\t\t\tlibFS.closeSync(pFileDescriptor);\n\t\t\t\t}\n\n\t\t\t\tif (pError && pError.code=='ENOENT')\n\t\t\t\t{\n\t\t\t\t\t/* Path doesn't exist, create it */\n\t\t\t\t\tlibFS.mkdir(tmpParameters.CurrentPath + libPath.sep + tmpParameters.ActualPathParts[tmpParameters.CurrentPathIndex], tmpParameters.Mode,\n\t\t\t\t\t\t(pCreateError) =>\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (!pCreateError)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t// We have now created our folder and there was no error -- continue.\n\t\t\t\t\t\t\t\treturn this.makeFolderRecursive(tmpParameters, fCallback);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (pCreateError.code =='EEXIST')\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t// The folder exists -- our dev might be running this in parallel/async/whatnot.\n\t\t\t\t\t\t\t\treturn this.makeFolderRecursive(tmpParameters, fCallback);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconsole.log(pCreateError.code);\n\t\t\t\t\t\t\t\treturn fCallback(pCreateError);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\treturn this.makeFolderRecursive(tmpParameters, fCallback);\n\t\t\t\t}\n\t\t\t});\n\t}\n}\n\nmodule.exports = FableServiceFilePersistence;\n}).call(this)}).call(this,require('_process'))\n\n},{\"../Fable-ServiceManager.js\":116,\"_process\":77,\"fs\":19,\"path\":73,\"readline\":19}],126:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\n/**\n* Precedent Meta-Templating\n* @author Steven Velozo <steven@velozo.com>\n* @description Process text stream trie and postfix tree, parsing out meta-template expression functions.\n*/\nconst libWordTree = require(`./Fable-Service-MetaTemplate/MetaTemplate-WordTree.js`);\nconst libStringParser = require(`./Fable-Service-MetaTemplate/MetaTemplate-StringParser.js`);\n\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\t\tthis.WordTree = new libWordTree();\n\n\t\t// In order to allow asynchronous template processing we need to use the async.eachLimit function\n\t\tthis.StringParser = new libStringParser(this.fable.services.Utility.eachLimit);\n\n\t\tthis.ParseTree = this.WordTree.ParseTree;\n\t}\n\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\taddPatternAsync(pPatternStart, pPatternEnd, pParserPromise)\n\t{\n\t\treturn this.WordTree.addPatternAsync(pPatternStart, pPatternEnd, pParserPromise);\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, fCallback)\n\t{\n\t\treturn this.StringParser.parseString(pString, this.ParseTree, pData, fCallback);\n\t}\n}\n\nmodule.exports = FableServiceMetaTemplate;\n},{\"../Fable-ServiceManager.js\":116,\"./Fable-Service-MetaTemplate/MetaTemplate-StringParser.js\":127,\"./Fable-Service-MetaTemplate/MetaTemplate-WordTree.js\":128}],127:[function(require,module,exports){\n/**\n* String Parser\n* @author Steven Velozo <steven@velozo.com>\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(fEachLimit)\n\t{\n\t\tthis.eachLimit = fEachLimit;\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\tAsynchronous: false,\n\n\t\t\tOutput: '',\n\t\t\tOutputBuffer: '',\n\n\t\t\tPattern: {},\n\n\t\t\tPatternMatch: false,\n\t\t\tPatternMatchEnd: false\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\tresetOutputBuffer (pParserState)\n\t{\n\t\t// Flush the output buffer.\n\t\tthis.flushOutputBuffer(pParserState);\n\t\t// End pattern mode\n\t\tpParserState.Pattern = false;\n\t\tpParserState.PatternStartNode = false;\n\t\tpParserState.StartPatternMatchComplete = false;\n\t\tpParserState.EndPatternMatchBegan = false;\n\t\tpParserState.PatternMatch = false;\n\n\t\treturn true;\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// If we are already in a pattern match traversal\n\t\tif (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern is still matching the start and we haven't passed the buffer\n\t\t\tif (!pParserState.StartPatternMatchComplete && pParserState.Pattern.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\tpParserState.Pattern = pParserState.Pattern[pCharacter];\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t\telse if (pParserState.EndPatternMatchBegan)\n\t\t\t{\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// Flush the output buffer.\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\t// Run the function\n\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\treturn this.resetOutputBuffer(pParserState);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (pParserState.PatternStartNode.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// We broke out of the end -- see if this is a new start of the end.\n\t\t\t\t\tpParserState.Pattern = pParserState.PatternStartNode.PatternEnd[pCharacter];\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpParserState.EndPatternMatchBegan = false;\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (pParserState.Pattern.hasOwnProperty('PatternEnd'))\n\t\t\t{\n\t\t\t\tif (!pParserState.StartPatternMatchComplete)\n\t\t\t\t{\n\t\t\t\t\tpParserState.StartPatternMatchComplete = true;\n\t\t\t\t\tpParserState.PatternStartNode = pParserState.Pattern;\n\t\t\t\t}\n\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This is the first character of the end pattern.\n\t\t\t\t\tpParserState.EndPatternMatchBegan = true;\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\tif (pParserState.Pattern.isAsync)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tthis.log.error(`MetaTemplate: The pattern ${pParserState.Pattern.PatternStartString} is asynchronous and cannot be used in a synchronous parser.`);\n\t\t\t\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Run the t*mplate function\n\t\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\t\treturn this.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// We are in a pattern start but didn't match one; reset and start trying again from this character.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t}\n\t\t}\n\t\t// If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\tif (!pParserState.PatternMatch)\n\t\t{\n\t\t\t// This may be the start of a new pattern....\n\t\t\tif (pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// ... assign the root node as the matched node.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\tpParserState.Pattern = pParserState.ParseTree[pCharacter];\n\t\t\t\tpParserState.PatternMatch = true;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t}\n\t\treturn false;\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\tparseCharacterAsync (pCharacter, pParserState, pData, fCallback)\n\t{\n\t\t// If we are already in a pattern match traversal\n\t\tif (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern is still matching the start and we haven't passed the buffer\n\t\t\tif (!pParserState.StartPatternMatchComplete && pParserState.Pattern.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\tpParserState.Pattern = pParserState.Pattern[pCharacter];\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t\telse if (pParserState.EndPatternMatchBegan)\n\t\t\t{\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// Flush the output buffer.\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\t// ... this is the end of a pattern, cut off the end tag and parse it.\n\t\t\t\t\t\t// Trim the start and end tags off the output buffer now\n\t\t\t\t\t\tif (pParserState.Pattern.isAsync)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Run the function\n\t\t\t\t\t\t\treturn pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData,\n\t\t\t\t\t\t\t\t(pError, pAsyncOutput) =>\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif (pError)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tconsole.log(`Precedent ERROR: Async template error happened parsing ${pParserState.Pattern.PatternStart} ... ${pParserState.Pattern.PatternEnd}: ${pError}`);\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tpParserState.OutputBuffer = pAsyncOutput;\n\t\t\t\t\t\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t\t\t\treturn fCallback();\n\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Run the t*mplate function\n\t\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t\treturn fCallback();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (pParserState.PatternStartNode.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// We broke out of the end -- see if this is a new start of the end.\n\t\t\t\t\tpParserState.Pattern = pParserState.PatternStartNode.PatternEnd[pCharacter];\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpParserState.EndPatternMatchBegan = false;\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (pParserState.Pattern.hasOwnProperty('PatternEnd'))\n\t\t\t{\n\t\t\t\tif (!pParserState.StartPatternMatchComplete)\n\t\t\t\t{\n\t\t\t\t\tpParserState.StartPatternMatchComplete = true;\n\t\t\t\t\tpParserState.PatternStartNode = pParserState.Pattern;\n\t\t\t\t}\n\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This is the first character of the end pattern.\n\t\t\t\t\tpParserState.EndPatternMatchBegan = true;\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\t// ... this is the end of a pattern, cut off the end tag and parse it.\n\t\t\t\t\t\t// Trim the start and end tags off the output buffer now\n\t\t\t\t\t\tif (pParserState.Pattern.isAsync)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Run the function\n\t\t\t\t\t\t\treturn pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData,\n\t\t\t\t\t\t\t\t(pError, pAsyncOutput) =>\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif (pError)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tconsole.log(`Precedent ERROR: Async template error happened parsing ${pParserState.Pattern.PatternStart} ... ${pParserState.Pattern.PatternEnd}: ${pError}`);\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tpParserState.OutputBuffer = pAsyncOutput;\n\t\t\t\t\t\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t\t\t\treturn fCallback();\n\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Run the t*mplate function\n\t\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t\treturn fCallback();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// We are in a pattern start but didn't match one; reset and start trying again from this character.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\treturn fCallback();\n\t\t\t}\n\t\t}\n\t\t// If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\tif (!pParserState.PatternMatch)\n\t\t{\n\t\t\t// This may be the start of a new pattern....\n\t\t\tif (pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// ... assign the root node as the matched node.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\tpParserState.Pattern = pParserState.ParseTree[pCharacter];\n\t\t\t\tpParserState.PatternMatch = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t}\n\t\treturn fCallback();\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 parameter\n\t * @param {function} fCallback - The callback function to call when the parse is complete\n\t */\n\tparseString (pString, pParseTree, pData, fCallback)\n\t{\n\t\tif (typeof(fCallback) !== 'function')\n\t\t{\n\t\t\tlet tmpParserState = this.newParserState(pParseTree);\n\n\t\t\tfor (var i = 0; i < pString.length; i++)\n\t\t\t{\n\t\t\t\t// TODO: This is not fast.\n\t\t\t\tthis.parseCharacter(pString[i], tmpParserState, pData, fCallback);\n\t\t\t}\n\n\t\t\tthis.flushOutputBuffer(tmpParserState);\n\n\t\t\treturn tmpParserState.Output;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// This is the async mode\n\t\t\tlet tmpParserState = this.newParserState(pParseTree);\n\t\t\ttmpParserState.Asynchronous = true;\n\n\t\t\tthis.eachLimit(pString, 1,\n\t\t\t\t(pCharacter, fCharacterCallback) =>\n\t\t\t\t{\n\t\t\t\t\tthis.parseCharacterAsync(pCharacter, tmpParserState, pData, fCharacterCallback);\n\t\t\t\t},\n\t\t\t\t(pError) =>\n\t\t\t\t{\n\t\t\t\t\t// Flush the remaining data\n\t\t\t\t\tthis.flushOutputBuffer(tmpParserState);\n\t\t\t\t\tfCallback(pError, tmpParserState.Output);\n\t\t\t\t});\n\n\t\t}\n\t}\n}\n\nmodule.exports = StringParser;\n\n},{}],128:[function(require,module,exports){\n/**\n* Word Tree\n* @author Steven Velozo <steven@velozo.com>\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\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 * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddChild (pTree, pPattern)\n\t{\n\t\tif (!pTree.hasOwnProperty(pPattern))\n\t\t{\n\t\t\tpTree[pPattern] = {};\n\t\t}\n\n\t\treturn pTree[pPattern];\n\t}\n\n\t/**\n\t * Add a child character to a Parse Tree PatternEnd subtree\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 * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddEndChild (pTree, pPattern)\n\t{\n\t\tif (!pTree.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\tpTree.PatternEnd = {};\n\t\t}\n\n\t\tpTree.PatternEnd[pPattern] = {};\n\n\t\treturn pTree.PatternEnd[pPattern];\n\t}\n\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 {function} fParser - 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, fParser)\n\t{\n\t\tif (pPatternStart.length < 1)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tif ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length < 1))\n\t\t{\n\t\t\treturn false;\n\t\t}\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{\n\t\t\ttmpLeaf = this.addChild(tmpLeaf, pPatternStart[i], i);\n\t\t}\n\n\t\tif (!tmpLeaf.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\ttmpLeaf.PatternEnd = {};\n\t\t}\n\n\t\tlet tmpPatternEnd = (typeof(pPatternEnd) === 'string') ? pPatternEnd : pPatternStart;\n\t\tfor (let i = 0; i < tmpPatternEnd.length; i++)\n\t\t{\n\t\t\ttmpLeaf = this.addEndChild(tmpLeaf, tmpPatternEnd[i], i);\n\t\t}\n\n\t\ttmpLeaf.PatternStartString = pPatternStart;\n\t\ttmpLeaf.PatternEndString = tmpPatternEnd;\n\t\ttmpLeaf.Parse = (typeof(fParser) === 'function') ? fParser :\n\t\t\t\t\t\t(typeof(fParser) === 'string') ? () => { return fParser; } :\n\t\t\t\t\t\t(pData) => { return pData; };\n\n\t\treturn tmpLeaf;\n\t}\n\n\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 {function} fParser - 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\taddPatternAsync (pPatternStart, pPatternEnd, fParser)\n\t{\n\t\tlet tmpLeaf = this.addPattern(pPatternStart, pPatternEnd, fParser);\n\t\tif (tmpLeaf)\n\t\t{\n\t\t\ttmpLeaf.isAsync = true;\n\t\t}\n\t}\n}\n\nmodule.exports = WordTree;\n\n},{}],129:[function(require,module,exports){\nmodule.exports = (\n {\n \"Metadata\": {\n \"UUID\": false,\n \"Hash\": false,\n\n \"Title\": \"\",\n \"Summary\": \"\",\n\n \"Version\": 0\n },\n \"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 },\n \"Errors\": [],\n \"Log\": []\n }\n);\n},{}],130:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nconst _OperationStatePrototypeString = JSON.stringify(require('./Fable-Service-Operation-DefaultSettings.js'));\n\nclass FableOperation extends libFableServiceBase\n{\n\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n\t\t// Timestamps will just be the long ints\n\t\tthis.timeStamps = {};\n\t\t// ProgressTrackers have an object format of: {Hash:'SomeHash',EndTime:UINT,CurrentTime:UINT,TotalCount:INT,CurrentCount:INT}\n\t\tthis.progressTrackers = {};\n\n this.serviceType = 'PhasedOperation';\n\n\t\tthis.state = JSON.parse(_OperationStatePrototypeString);\n\n\t\t// Match the service instantiation to the operation.\n\t\tthis.state.Metadata.Hash = this.Hash;\n\t\tthis.state.Metadata.UUID = this.UUID;\n\n\t\tthis.name = (typeof(this.options.Name) == 'string') ? this.options.Name : `Unnamed Operation ${this.state.Metadata.UUID}`;\n\n\t\tthis.log = 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\t/************************************************************************\n\t * BEGINNING OF --> Telemetry Helpers\n\t */\n\tcreateTimeStamp(pTimeStampHash)\n\t{\n\t\tlet tmpTimeStampHash = (typeof(pTimeStampHash) == 'string') ? pTimeStampHash : 'Default';\n\t\tthis.timeStamps[tmpTimeStampHash] = +new Date();\n\t\treturn this.timeStamps[tmpTimeStampHash];\n\t}\n\n\tgetTimeDelta(pTimeStampHash)\n\t{\n\t\tlet tmpTimeStampHash = (typeof(pTimeStampHash) == 'string') ? pTimeStampHash : 'Default';\n\t\tif (this.timeStamps.hasOwnProperty(tmpTimeStampHash))\n\t\t{\n\t\t\tlet tmpEndTime = +new Date();\n\t\t\treturn tmpEndTime-this.timeStamps[tmpTimeStampHash];\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tlogTimeDelta(pTimeStampHash, pMessage)\n\t{\n\t\tlet tmpTimeStampHash = (typeof(pTimeStampHash) == 'string') ? pTimeStampHash : 'Default';\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : `Elapsed for ${tmpTimeStampHash}: `;\n\t\tlet tmpOperationTime = this.getTimeDelta(pTimeStampHash);\n\t\tthis.info(tmpMessage +' ('+tmpOperationTime+'ms)');\n\t\treturn tmpOperationTime;\n\t}\n\n\tcreateProgressTracker(pTotalOperations, pProgressTrackerHash)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\t\tlet tmpTotalOperations = (typeof(pTotalOperations) == 'number') ? pTotalOperations : 100;\n\n\t\tlet tmpProgressTracker = (\n\t\t\t{\n\t\t\t\tHash: tmpProgressTrackerHash,\n\t\t\t\tStartTime: this.createTimeStamp(tmpProgressTrackerHash),\n\t\t\t\tEndTime: 0,\n\t\t\t\tCurrentTime: 0,\n\t\t\t\tPercentComplete: -1,\n\t\t\t\tAverageOperationTime: -1,\n\t\t\t\tEstimatedCompletionTime: -1,\n\t\t\t\tTotalCount: tmpTotalOperations,\n\t\t\t\tCurrentCount:-1\n\t\t\t});\n\n\t\tthis.progressTrackers[tmpProgressTrackerHash] = tmpProgressTracker;\n\n\t\treturn tmpProgressTracker;\n\t}\n\n\tsolveProgressTrackerStatus(pProgressTrackerHash)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\n\t\tif (!this.progressTrackers.hasOwnProperty(tmpProgressTrackerHash))\n\t\t{\n\t\t\tthis.createProgressTracker(100, tmpProgressTrackerHash);\n\t\t}\n\n\t\tlet tmpProgressTracker = this.progressTrackers[tmpProgressTrackerHash];\n\n\t\ttmpProgressTracker.CurrentTime = this.getTimeDelta(tmpProgressTracker.Hash);\n\n\t\tif ((tmpProgressTracker.CurrentCount > 0) && (tmpProgressTracker.TotalCount > 0))\n\t\t{\n\t\t\ttmpProgressTracker.PercentComplete = (tmpProgressTracker.CurrentCount / tmpProgressTracker.TotalCount) * 100.0;\n\t\t}\n\n\t\tif ((tmpProgressTracker.CurrentCount > 0) && (tmpProgressTracker.CurrentTime > 0))\n\t\t{\n\t\t\ttmpProgressTracker.AverageOperationTime = tmpProgressTracker.CurrentTime / tmpProgressTracker.CurrentCount;\n\t\t}\n\n\t\tif ((tmpProgressTracker.CurrentCount < tmpProgressTracker.TotalCount) && (tmpProgressTracker.AverageOperationTime > 0))\n\t\t{\n\t\t\ttmpProgressTracker.EstimatedCompletionTime = (tmpProgressTracker.TotalCount - tmpProgressTracker.CurrentCount) * tmpProgressTracker.AverageOperationTime;\n\t\t}\n\t}\n\n\tupdateProgressTrackerStatus(pProgressTrackerHash, pCurrentOperations)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\t\tlet tmpCurrentOperations = parseInt(pCurrentOperations);\n\n\t\tif (isNaN(tmpCurrentOperations))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tif (!this.progressTrackers.hasOwnProperty(tmpProgressTrackerHash))\n\t\t{\n\t\t\tthis.createProgressTracker(100, tmpProgressTrackerHash);\n\t\t}\n\n\t\tthis.progressTrackers[tmpProgressTrackerHash].CurrentCount = tmpCurrentOperations;\n\t\tthis.progressTrackers[tmpProgressTrackerHash].CurrentTime = this.getTimeDelta(tmpProgressTrackerHash);\n\n\t\tthis.solveProgressTrackerStatus(tmpProgressTrackerHash);\n\n\t\treturn this.progressTrackers[tmpProgressTrackerHash];\n\t}\n\n\tincrementProgressTrackerStatus(pProgressTrackerHash, pIncrementSize)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\t\tlet tmpIncrementSize = parseInt(pIncrementSize);\n\n\t\tif (isNaN(tmpIncrementSize))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tif (!this.progressTrackers.hasOwnProperty(tmpProgressTrackerHash))\n\t\t{\n\t\t\tthis.createProgressTracker(100, tmpProgressTrackerHash);\n\t\t}\n\n\t\tthis.progressTrackers[tmpProgressTrackerHash].CurrentCount = this.progressTrackers[tmpProgressTrackerHash].CurrentCount + tmpIncrementSize;\n\t\tthis.progressTrackers[tmpProgressTrackerHash].CurrentTime = this.getTimeDelta(tmpProgressTrackerHash);\n\n\t\tthis.solveProgressTrackerStatus(tmpProgressTrackerHash);\n\n\t\treturn this.progressTrackers[tmpProgressTrackerHash];\n\t}\n\n\tsetProgressTrackerEndTime(pProgressTrackerHash, pCurrentOperations)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\t\tlet tmpCurrentOperations = parseInt(pCurrentOperations);\n\n\t\tif (!this.progressTrackers.hasOwnProperty(tmpProgressTrackerHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tif (!isNaN(tmpCurrentOperations))\n\t\t{\n\t\t\tthis.updateProgressTrackerStatus(tmpProgressTrackerHash, tmpCurrentOperations);\n\t\t}\n\n\t\tthis.progressTrackers[tmpProgressTrackerHash].EndTime = this.getTimeDelta(tmpProgressTrackerHash);\n\n\t\tthis.solveProgressTrackerStatus(tmpProgressTrackerHash);\n\n\t\treturn this.progressTrackers[tmpProgressTrackerHash];\n\t}\n\n\tprintProgressTrackerStatus(pProgressTrackerHash)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\n\t\tif (!this.progressTrackers.hasOwnProperty(tmpProgressTrackerHash))\n\t\t{\n\t\t\tthis.info(`>> Progress Tracker ${tmpProgressTrackerHash} does not exist! No stats to display.`);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tconst tmpProgressTracker = this.progressTrackers[tmpProgressTrackerHash];\n\n\t\t\tif (tmpProgressTracker.CurrentCount < 1)\n\t\t\t{\n\t\t\t\tthis.info(`>> Progress Tracker ${tmpProgressTracker.Hash} has no completed operations. ${tmpProgressTracker.CurrentTime}ms have elapsed since it was started.`);\n\t\t\t}\n\t\t\telse if (tmpProgressTracker.EndTime < 1)\n\t\t\t{\n\t\t\t\tthis.info(`>> Progress Tracker ${tmpProgressTracker.Hash} is ${tmpProgressTracker.PercentComplete.toFixed(3)}% completed - ${tmpProgressTracker.CurrentCount} / ${tmpProgressTracker.TotalCount} operations over ${tmpProgressTracker.CurrentTime}ms (median ${tmpProgressTracker.AverageOperationTime.toFixed(3)} per). Estimated completion in ${tmpProgressTracker.EstimatedCompletionTime.toFixed(0)}ms or ${(tmpProgressTracker.EstimatedCompletionTime / 1000 / 60).toFixed(2)}minutes`)\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.info(`>> Progress Tracker ${tmpProgressTracker.Hash} is done and completed ${tmpProgressTracker.CurrentCount} / ${tmpProgressTracker.TotalCount} operations in ${tmpProgressTracker.EndTime}ms.`)\n\t\t\t}\n\t\t}\n\t}\n\t// logMemoryResourcesUsed()\n\t// {\n\t//\n\t// \tconst tmpResourcesUsed = process.memoryUsage().heapUsed / 1024 / 1024;\n\t// \tthis.info(`Memory usage at ${Math.round(tmpResourcesUsed * 100) / 100} MB`);\n\t// }\n\t/*\n\t * END OF --> Logging and Telemetry Helpers\n\t ************************************************************************/\n}\n\nmodule.exports = FableOperation;\n},{\"../Fable-ServiceManager.js\":116,\"./Fable-Service-Operation-DefaultSettings.js\":129}],131:[function(require,module,exports){\n(function (Buffer){(function (){\nconst libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nconst libSimpleGet = require('simple-get');\nconst libCookie = require('cookie');\n\nclass FableServiceRestClient extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash);\n\n\t\tthis.TraceLog = false;\n\t\tif (this.options.TraceLog || this.fable.TraceLog)\n\t\t{\n\t\t\tthis.TraceLog = true;\n\t\t}\n\n\t\tthis.dataFormat = this.fable.services.DataFormat;\n\n\t\tthis.serviceType = 'RestClient';\n\n\t\tthis.cookie = false;\n\n\t\t// This is a function that can be overridden, to allow the management\n\t\t// of the request options before they are passed to the request library.\n\t\tthis.prepareRequestOptions = (pOptions) => { return pOptions; };\n\t}\n\n\tget simpleGet()\n\t{\n\t\treturn libSimpleGet;\n\t}\n\n\tprepareCookies(pRequestOptions)\n\t{\n\t\tif (this.cookie)\n\t\t{\n\t\t\tlet tmpCookieObject = this.cookie;\n\t\t\tif (!pRequestOptions.hasOwnProperty('headers'))\n\t\t\t{\n\t\t\t\tpRequestOptions.headers = {};\n\t\t\t}\n\t\t\tlet tmpCookieKeys = Object.keys(tmpCookieObject);\n\t\t\tif (tmpCookieKeys.length > 0)\n\t\t\t{\n\t\t\t\t// Only grab the first for now.\n\t\t\t\tpRequestOptions.headers.cookie = libCookie.serialize(tmpCookieKeys[0], tmpCookieObject[tmpCookieKeys[0]]);\t\t\t\t\n\t\t\t}\n\t\t}\n\t\treturn pRequestOptions;\n\t}\n\n\tpreRequest(pOptions)\n\t{\n\t\t// Validate the options object\n\t\tlet tmpOptions = this.prepareCookies(pOptions);\n\t\treturn this.prepareRequestOptions(tmpOptions);\n\t}\n\n\texecuteChunkedRequest(pOptions, fCallback)\n\t{\n\t\tlet tmpOptions = this.preRequest(pOptions);\n\n\t\ttmpOptions.RequestStartTime = this.fable.log.getTimeStamp();\n\n\t\tif (this.TraceLog)\n\t\t{\n\t\t\tthis.fable.log.debug(`Beginning ${tmpOptions.method} request to ${tmpOptions.url} at ${tmpOptions.RequestStartTime}`);\n\t\t}\n\n\t\treturn libSimpleGet(tmpOptions,\n\t\t\t(pError, pResponse)=>\n\t\t\t{\n\t\t\t\tif (pError)\n\t\t\t\t{\n\t\t\t\t\treturn fCallback(pError, pResponse);\n\t\t\t\t}\n\n\t\t\t\tif (this.TraceLog)\n\t\t\t\t{\n\t\t\t\t\tlet tmpConnectTime = this.fable.log.getTimeStamp();\n\t\t\t\t\tthis.fable.log.debug(`--> ${tmpOptions.method} connected in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpConnectTime)}ms code ${pResponse.statusCode}`);\n\t\t\t\t}\n\n\t\t\t\tlet tmpData = '';\n\n\t\t\t\tpResponse.on('data', (pChunk) =>\n\t\t\t\t\t{\n\t\t\t\t\t\t// For JSON, the chunk is the serialized object.\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpChunkTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`--> ${tmpOptions.method} data chunk size ${pChunk.length}b received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpChunkTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttmpData += pChunk;\n\t\t\t\t\t});\n\n\t\t\t\tpResponse.on('end', ()=>\n\t\t\t\t\t{\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpCompletionTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`==> ${tmpOptions.method} completed data size ${tmpData.length}b received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpCompletionTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fCallback(pError, pResponse, tmpData);\n\t\t\t\t\t});\n\t\t\t});\n\t}\n\n\texecuteChunkedRequestBinary(pOptions, fCallback)\n\t{\n\t\tlet tmpOptions = this.preRequest(pOptions);\n\n\t\ttmpOptions.RequestStartTime = this.fable.log.getTimeStamp();\n\n\t\tif (this.TraceLog)\n\t\t{\n\t\t\tthis.fable.log.debug(`Beginning ${tmpOptions.method} request to ${tmpOptions.url} at ${tmpOptions.RequestStartTime}`);\n\t\t}\n\n\t\ttmpOptions.json = false;\n\t\ttmpOptions.encoding = null;\n\n\t\treturn libSimpleGet(tmpOptions,\n\t\t\t(pError, pResponse)=>\n\t\t\t{\n\t\t\t\tif (pError)\n\t\t\t\t{\n\t\t\t\t\treturn fCallback(pError, pResponse);\n\t\t\t\t}\n\n\t\t\t\tif (this.TraceLog)\n\t\t\t\t{\n\t\t\t\t\tlet tmpConnectTime = this.fable.log.getTimeStamp();\n\t\t\t\t\tthis.fable.log.debug(`--> ${tmpOptions.method} connected in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpConnectTime)}ms code ${pResponse.statusCode}`);\n\t\t\t\t}\n\n\t\t\t\tlet tmpDataBuffer = false;\n\n\t\t\t\tpResponse.on('data', (pChunk) =>\n\t\t\t\t\t{\n\t\t\t\t\t\t// For JSON, the chunk is the serialized object.\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpChunkTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`--> ${tmpOptions.method} data chunk size ${pChunk.length}b received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpChunkTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// TODO: Potentially create a third option that streams this to a file? So it doesn't have to hold it all in memory.\n\t\t\t\t\t\tif (!tmpDataBuffer)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttmpDataBuffer = Buffer.from(pChunk);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttmpDataBuffer = Buffer.concat([tmpDataBuffer, pChunk]);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\n\t\t\t\tpResponse.on('end', ()=>\n\t\t\t\t\t{\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpCompletionTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`==> ${tmpOptions.method} completed data size ${tmpDataBuffer.length}b received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpCompletionTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fCallback(pError, pResponse, tmpDataBuffer);\n\t\t\t\t\t});\n\t\t\t});\n\t}\n\n\texecuteJSONRequest(pOptions, fCallback)\n\t{\n\t\tpOptions.json = true;\n\n\t\tlet tmpOptions = this.preRequest(pOptions);\n\n\t\tif (!tmpOptions.hasOwnProperty('headers'))\n\t\t{\n\t\t\ttmpOptions.headers = {};\n\t\t}\n\t\t/* Automated headers break some APIs\n\t\tif (!tmpOptions.headers.hasOwnProperty('Content-Type'))\n\t\t{\n\t\t\ttmpOptions.headers['Content-Type'] = 'application/json';\n\t\t}\n\t\t*/\n\n\t\ttmpOptions.RequestStartTime = this.fable.log.getTimeStamp();\n\n\t\tif (this.TraceLog)\n\t\t{\n\t\t\tthis.fable.log.debug(`Beginning ${tmpOptions.method} JSON request to ${tmpOptions.url} at ${tmpOptions.RequestStartTime}`);\n\t\t}\n\n\t\treturn libSimpleGet(tmpOptions,\n\t\t\t(pError, pResponse)=>\n\t\t\t{\n\t\t\t\tif (pError)\n\t\t\t\t{\n\t\t\t\t\treturn fCallback(pError, pResponse);\n\t\t\t\t}\n\n\t\t\t\tif (this.TraceLog)\n\t\t\t\t{\n\t\t\t\t\tlet tmpConnectTime = this.fable.log.getTimeStamp();\n\t\t\t\t\tthis.fable.log.debug(`--> JSON ${tmpOptions.method} connected in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpConnectTime)}ms code ${pResponse.statusCode}`);\n\t\t\t\t}\n\n\t\t\t\tlet tmpJSONData = '';\n\n\t\t\t\tpResponse.on('data', (pChunk) =>\n\t\t\t\t\t{\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpChunkTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`--> JSON ${tmpOptions.method} data chunk size ${pChunk.length}b received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpChunkTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttmpJSONData += pChunk;\n\t\t\t\t\t});\n\n\t\t\t\tpResponse.on('end', ()=>\n\t\t\t\t\t{\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpCompletionTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`==> JSON ${tmpOptions.method} completed - received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpCompletionTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fCallback(pError, pResponse, JSON.parse(tmpJSONData));\n\t\t\t\t\t});\n\t\t\t});\n\t}\n\n\tgetJSON(pOptionsOrURL, fCallback)\n\t{\n\t\tlet tmpRequestOptions = (typeof(pOptionsOrURL) == 'object') ? pOptionsOrURL : {};\n\t\tif (typeof(pOptionsOrURL) == 'string')\n\t\t{\n\t\t\ttmpRequestOptions.url = pOptionsOrURL;\n\t\t}\n\n\t\ttmpRequestOptions.method = 'GET';\n\n\t\treturn this.executeJSONRequest(tmpRequestOptions, fCallback);\n\t}\n\n\tputJSON(pOptions, fCallback)\n\t{\n\t\tif (typeof(pOptions.body) != 'object')\n\t\t{\n\t\t\treturn fCallback(new Error(`PUT JSON Error Invalid options object`));\n\t\t}\n\n\t\tpOptions.method = 'PUT';\n\n\t\treturn this.executeJSONRequest(pOptions, fCallback);\n\t}\n\n\tpostJSON(pOptions, fCallback)\n\t{\n\t\tif (typeof(pOptions.body) != 'object')\n\t\t{\n\t\t\treturn fCallback(new Error(`POST JSON Error Invalid options object`));\n\t\t}\n\n\t\tpOptions.method = 'POST';\n\n\t\treturn this.executeJSONRequest(pOptions, fCallback);\n\t}\n\n\tpatchJSON(pOptions, fCallback)\n\t{\n\t\tif (typeof(pOptions.body) != 'object')\n\t\t{\n\t\t\treturn fCallback(new Error(`PATCH JSON Error Invalid options object`));\n\t\t}\n\n\t\tpOptions.method = 'PATCH';\n\n\t\treturn this.executeJSONRequest(pOptions, fCallback);\n\t}\n\n\theadJSON(pOptions, fCallback)\n\t{\n\t\tif (typeof(pOptions.body) != 'object')\n\t\t{\n\t\t\treturn fCallback(new Error(`HEAD JSON Error Invalid options object`));\n\t\t}\n\n\t\tpOptions.method = 'HEAD';\n\n\t\treturn this.executeJSONRequest(pOptions, fCallback);\n\t}\n\n\tdelJSON(pOptions, fCallback)\n\t{\n\t\tpOptions.method = 'DELETE';\n\n\t\treturn this.executeJSONRequest(pOptions, fCallback);\n\t}\n\n\tgetRawText(pOptionsOrURL, fCallback)\n\t{\n\t\tlet tmpRequestOptions = (typeof(pOptionsOrURL) == 'object') ? pOptionsOrURL : {};\n\t\tif (typeof(pOptionsOrURL) == 'string')\n\t\t{\n\t\t\ttmpRequestOptions.url = pOptionsOrURL;\n\t\t}\n\n\t\ttmpRequestOptions.method = 'GET';\n\n\t\treturn this.executeChunkedRequest(tmpRequestOptions, fCallback);\n\t}\n}\n\nmodule.exports = FableServiceRestClient;\n}).call(this)}).call(this,require(\"buffer\").Buffer)\n\n},{\"../Fable-ServiceManager.js\":116,\"buffer\":20,\"cookie\":27,\"simple-get\":90}],132:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\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-ServiceManager.js\":116}],133:[function(require,module,exports){\nconst libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\n// TODO: These are still pretty big -- consider the smaller polyfills\nconst libAsyncWaterfall = require('async.waterfall');\nconst libAsyncEachLimit = require('async.eachlimit');\n\nconst libBigNumber = require('big.js');\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\n\t\tthis.bigNumber = libBigNumber;\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\t// Nevermind, the native thing is not stable enough across environments\n\t// Basic shallow copy\n\textend(pDestinationObject, ...pSourceObjects)\n\t{\n\t\tfor (let i = 0; i < pSourceObjects.length; i++)\n\t\t{\n\t\t\tlet tmpSourceObject = pSourceObjects[i];\n\t\t\tif (typeof(tmpSourceObject) === 'object')\n\t\t\t{\n\t\t\t\tlet tmpObjectProperties = Object.keys(tmpSourceObject);\n\t\t\t\tfor (let k = 0; k < tmpObjectProperties.length; k++)\n\t\t\t\t{\n\t\t\t\t\tpDestinationObject[tmpObjectProperties[k]] = tmpSourceObject[tmpObjectProperties[k]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn pDestinationObject;\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\t// Convert an ISO string to a javascript date object\n\t// Adapted from https://stackoverflow.com/a/54751179\n\t//\n\t// Takes strings like: 2022-11-04T11:34:45.000Z\n\t// and: 1986-06-11T09:34:46.012Z+0200\n\t// ... and converts them into javascript timestamps, following the directions of the timezone stuff.\n\t//\n\t// This is not meant to replace the more complex libraries such as moment or luxon.\n\t// This *is* meant to be a simple, small, and fast way to convert ISO strings to dates in engines\n\t// with ultra limited JS capabilities where those don't work.\n\tisoStringToDate (pISOString)\n\t{\n\n\t\t// Split the string into an array based on the digit groups.\n\t\tlet tmpDateParts = pISOString.split( /\\D+/ );\n\n\t\t// Set up a date object with the current time.\n\t\tlet tmpReturnDate = new Date();\n\n\t\t// Track the number of hours we need to adjust the date by based on the timezone.\n\t\tlet tmpTimeZoneOffsetInHours = 0;\n\t\t// Track the number of minutes we need to adjust the date by based on the timezone.\n\t\tlet tmpTimeZoneOffsetInMinutes = 0;\n\n\t\t// This fixes an inconsistency with constructing the date programmatically.\n\t\ttmpReturnDate.setUTCDate(1);\n\t\ttmpReturnDate.setUTCMonth(1);\n\t\ttmpReturnDate.setUTCHours(0);\n\t\ttmpReturnDate.setUTCMinutes(0);\n\t\ttmpReturnDate.setUTCSeconds(0);\n\t\ttmpReturnDate.setUTCMilliseconds(0);\n\n\t\t// Manually parse the parts of the string and set each part for the\n\t\t// date. Note: Using the UTC versions of these functions is necessary\n\t\t// because we're manually adjusting for time zones stored in the\n\t\t// string.\n\t\ttmpReturnDate.setUTCFullYear( parseInt( tmpDateParts[ 0 ] ) );\n\n\t\t// The month numbers are one \"off\" from what normal humans would expect\n\t\t// because January == 0.\n\t\ttmpReturnDate.setUTCMonth( parseInt( tmpDateParts[ 1 ] ) - 1 );\n\n\t\ttmpReturnDate.setUTCDate( parseInt( tmpDateParts[ 2 ] ) );\n\n\t\t// Set the time parts of the date object.\n\t\ttmpReturnDate.setUTCHours( parseInt( tmpDateParts[ 3 ] ) );\n\t\ttmpReturnDate.setUTCMinutes( parseInt( tmpDateParts[ 4 ] ) );\n\t\ttmpReturnDate.setUTCSeconds( parseInt( tmpDateParts[ 5 ] ) );\n\t\ttmpReturnDate.setUTCMilliseconds( parseInt( tmpDateParts[ 6 ] ) );\n\n\t\t// If there's a value for either the hours or minutes offset.\n\t\tif (tmpDateParts[ 7 ] || tmpDateParts[ 8 ])\n\t\t{\n\t\t\t// If there's a value for the minutes offset.\n\t\t\tif (tmpDateParts[8])\n\t\t\t{\n\t\t\t\t// Convert the minutes value into an hours value.\n\t\t\t\ttmpTimeZoneOffsetInMinutes = parseInt(tmpDateParts[8]) / 60;\n\t\t\t}\n\n\t\t\t// Add the hours and minutes values to get the total offset in hours.\n\t\t\ttmpTimeZoneOffsetInHours = parseInt(tmpDateParts[7]) + tmpTimeZoneOffsetInMinutes;\n\n\t\t\t// If the sign for the timezone is a plus to indicate the timezone is ahead of UTC time.\n\t\t\tif (pISOString.substr( -6, 1 ) == \"+\")\n\t\t\t{\n\t\t\t\t// Make the offset negative since the hours will need to be subtracted from the date.\n\t\t\t\ttmpTimeZoneOffsetInHours *= -1;\n\t\t\t}\n\t\t}\n\n\t\t// Get the current hours for the date and add the offset to get the correct time adjusted for timezone.\n\t\ttmpReturnDate.setHours( tmpReturnDate.getHours() + tmpTimeZoneOffsetInHours );\n\n\t\t// Return the Date object calculated from the string.\n\t\treturn tmpReturnDate;\n\t}\n}\n\nmodule.exports = FableServiceUtility;\n},{\"../Fable-ServiceManager.js\":116,\"async.eachlimit\":1,\"async.waterfall\":15,\"big.js\":17}]},{},[117])(117)\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","/*\r\n * big.js v6.2.1\r\n * A small, fast, easy-to-use library for arbitrary-precision decimal arithmetic.\r\n * Copyright (c) 2022 Michael Mclaughlin\r\n * https://github.com/MikeMcl/big.js/LICENCE.md\r\n */\r\n;(function (GLOBAL) {\r\n 'use strict';\r\n var Big,\r\n\r\n\r\n/************************************** EDITABLE DEFAULTS *****************************************/\r\n\r\n\r\n // The default values below must be integers within the stated ranges.\r\n\r\n /*\r\n * The maximum number of decimal places (DP) of the results of operations involving division:\r\n * div and sqrt, and pow with negative exponents.\r\n */\r\n DP = 20, // 0 to MAX_DP\r\n\r\n /*\r\n * The rounding mode (RM) used when rounding to the above decimal places.\r\n *\r\n * 0 Towards zero (i.e. truncate, no rounding). (ROUND_DOWN)\r\n * 1 To nearest neighbour. If equidistant, round up. (ROUND_HALF_UP)\r\n * 2 To nearest neighbour. If equidistant, to even. (ROUND_HALF_EVEN)\r\n * 3 Away from zero. (ROUND_UP)\r\n */\r\n RM = 1, // 0, 1, 2 or 3\r\n\r\n // The maximum value of DP and Big.DP.\r\n MAX_DP = 1E6, // 0 to 1000000\r\n\r\n // The maximum magnitude of the exponent argument to the pow method.\r\n MAX_POWER = 1E6, // 1 to 1000000\r\n\r\n /*\r\n * The negative exponent (NE) at and beneath which toString returns exponential notation.\r\n * (JavaScript numbers: -7)\r\n * -1000000 is the minimum recommended exponent value of a Big.\r\n */\r\n NE = -7, // 0 to -1000000\r\n\r\n /*\r\n * The positive exponent (PE) at and above which toString returns exponential notation.\r\n * (JavaScript numbers: 21)\r\n * 1000000 is the maximum recommended exponent value of a Big, but this limit is not enforced.\r\n */\r\n PE = 21, // 0 to 1000000\r\n\r\n /*\r\n * When true, an error will be thrown if a primitive number is passed to the Big constructor,\r\n * or if valueOf is called, or if toNumber is called on a Big which cannot be converted to a\r\n * primitive number without a loss of precision.\r\n */\r\n STRICT = false, // true or false\r\n\r\n\r\n/**************************************************************************************************/\r\n\r\n\r\n // Error messages.\r\n NAME = '[big.js] ',\r\n INVALID = NAME + 'Invalid ',\r\n INVALID_DP = INVALID + 'decimal places',\r\n INVALID_RM = INVALID + 'rounding mode',\r\n DIV_BY_ZERO = NAME + 'Division by zero',\r\n\r\n // The shared prototype object.\r\n P = {},\r\n UNDEFINED = void 0,\r\n NUMERIC = /^-?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i;\r\n\r\n\r\n /*\r\n * Create and return a Big constructor.\r\n */\r\n function _Big_() {\r\n\r\n /*\r\n * The Big constructor and exported function.\r\n * Create and return a new instance of a Big number object.\r\n *\r\n * n {number|string|Big} A numeric value.\r\n */\r\n function Big(n) {\r\n var x = this;\r\n\r\n // Enable constructor usage without new.\r\n if (!(x instanceof Big)) return n === UNDEFINED ? _Big_() : new Big(n);\r\n\r\n // Duplicate.\r\n if (n instanceof Big) {\r\n x.s = n.s;\r\n x.e = n.e;\r\n x.c = n.c.slice();\r\n } else {\r\n if (typeof n !== 'string') {\r\n if (Big.strict === true && typeof n !== 'bigint') {\r\n throw TypeError(INVALID + 'value');\r\n }\r\n\r\n // Minus zero?\r\n n = n === 0 && 1 / n < 0 ? '-0' : String(n);\r\n }\r\n\r\n parse(x, n);\r\n }\r\n\r\n // Retain a reference to this Big constructor.\r\n // Shadow Big.prototype.constructor which points to Object.\r\n x.constructor = Big;\r\n }\r\n\r\n Big.prototype = P;\r\n Big.DP = DP;\r\n Big.RM = RM;\r\n Big.NE = NE;\r\n Big.PE = PE;\r\n Big.strict = STRICT;\r\n Big.roundDown = 0;\r\n Big.roundHalfUp = 1;\r\n Big.roundHalfEven = 2;\r\n Big.roundUp = 3;\r\n\r\n return Big;\r\n }\r\n\r\n\r\n /*\r\n * Parse the number or string value passed to a Big constructor.\r\n *\r\n * x {Big} A Big number instance.\r\n * n {number|string} A numeric value.\r\n */\r\n function parse(x, n) {\r\n var e, i, nl;\r\n\r\n if (!NUMERIC.test(n)) {\r\n throw Error(INVALID + 'number');\r\n }\r\n\r\n // Determine sign.\r\n x.s = n.charAt(0) == '-' ? (n = n.slice(1), -1) : 1;\r\n\r\n // Decimal point?\r\n if ((e = n.indexOf('.')) > -1) n = n.replace('.', '');\r\n\r\n // Exponential form?\r\n if ((i = n.search(/e/i)) > 0) {\r\n\r\n // Determine exponent.\r\n if (e < 0) e = i;\r\n e += +n.slice(i + 1);\r\n n = n.substring(0, i);\r\n } else if (e < 0) {\r\n\r\n // Integer.\r\n e = n.length;\r\n }\r\n\r\n nl = n.length;\r\n\r\n // Determine leading zeros.\r\n for (i = 0; i < nl && n.charAt(i) == '0';) ++i;\r\n\r\n if (i == nl) {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n } else {\r\n\r\n // Determine trailing zeros.\r\n for (; nl > 0 && n.charAt(--nl) == '0';);\r\n x.e = e - i - 1;\r\n x.c = [];\r\n\r\n // Convert string to array of digits without leading/trailing zeros.\r\n for (e = 0; i <= nl;) x.c[e++] = +n.charAt(i++);\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n /*\r\n * Round Big x to a maximum of sd significant digits using rounding mode rm.\r\n *\r\n * x {Big} The Big to round.\r\n * sd {number} Significant digits: integer, 0 to MAX_DP inclusive.\r\n * rm {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n * [more] {boolean} Whether the result of division was truncated.\r\n */\r\n function round(x, sd, rm, more) {\r\n var xc = x.c;\r\n\r\n if (rm === UNDEFINED) rm = x.constructor.RM;\r\n if (rm !== 0 && rm !== 1 && rm !== 2 && rm !== 3) {\r\n throw Error(INVALID_RM);\r\n }\r\n\r\n if (sd < 1) {\r\n more =\r\n rm === 3 && (more || !!xc[0]) || sd === 0 && (\r\n rm === 1 && xc[0] >= 5 ||\r\n rm === 2 && (xc[0] > 5 || xc[0] === 5 && (more || xc[1] !== UNDEFINED))\r\n );\r\n\r\n xc.length = 1;\r\n\r\n if (more) {\r\n\r\n // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n x.e = x.e - sd + 1;\r\n xc[0] = 1;\r\n } else {\r\n\r\n // Zero.\r\n xc[0] = x.e = 0;\r\n }\r\n } else if (sd < xc.length) {\r\n\r\n // xc[sd] is the digit after the digit that may be rounded up.\r\n more =\r\n rm === 1 && xc[sd] >= 5 ||\r\n rm === 2 && (xc[sd] > 5 || xc[sd] === 5 &&\r\n (more || xc[sd + 1] !== UNDEFINED || xc[sd - 1] & 1)) ||\r\n rm === 3 && (more || !!xc[0]);\r\n\r\n // Remove any digits after the required precision.\r\n xc.length = sd;\r\n\r\n // Round up?\r\n if (more) {\r\n\r\n // Rounding up may mean the previous digit has to be rounded up.\r\n for (; ++xc[--sd] > 9;) {\r\n xc[sd] = 0;\r\n if (sd === 0) {\r\n ++x.e;\r\n xc.unshift(1);\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (sd = xc.length; !xc[--sd];) xc.pop();\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n /*\r\n * Return a string representing the value of Big x in normal or exponential notation.\r\n * Handles P.toExponential, P.toFixed, P.toJSON, P.toPrecision, P.toString and P.valueOf.\r\n */\r\n function stringify(x, doExponential, isNonzero) {\r\n var e = x.e,\r\n s = x.c.join(''),\r\n n = s.length;\r\n\r\n // Exponential notation?\r\n if (doExponential) {\r\n s = s.charAt(0) + (n > 1 ? '.' + s.slice(1) : '') + (e < 0 ? 'e' : 'e+') + e;\r\n\r\n // Normal notation.\r\n } else if (e < 0) {\r\n for (; ++e;) s = '0' + s;\r\n s = '0.' + s;\r\n } else if (e > 0) {\r\n if (++e > n) {\r\n for (e -= n; e--;) s += '0';\r\n } else if (e < n) {\r\n s = s.slice(0, e) + '.' + s.slice(e);\r\n }\r\n } else if (n > 1) {\r\n s = s.charAt(0) + '.' + s.slice(1);\r\n }\r\n\r\n return x.s < 0 && isNonzero ? '-' + s : s;\r\n }\r\n\r\n\r\n // Prototype/instance methods\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the absolute value of this Big.\r\n */\r\n P.abs = function () {\r\n var x = new this.constructor(this);\r\n x.s = 1;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * Return 1 if the value of this Big is greater than the value of Big y,\r\n * -1 if the value of this Big is less than the value of Big y, or\r\n * 0 if they have the same value.\r\n */\r\n P.cmp = function (y) {\r\n var isneg,\r\n x = this,\r\n xc = x.c,\r\n yc = (y = new x.constructor(y)).c,\r\n i = x.s,\r\n j = y.s,\r\n k = x.e,\r\n l = y.e;\r\n\r\n // Either zero?\r\n if (!xc[0] || !yc[0]) return !xc[0] ? !yc[0] ? 0 : -j : i;\r\n\r\n // Signs differ?\r\n if (i != j) return i;\r\n\r\n isneg = i < 0;\r\n\r\n // Compare exponents.\r\n if (k != l) return k > l ^ isneg ? 1 : -1;\r\n\r\n j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n // Compare digit by digit.\r\n for (i = -1; ++i < j;) {\r\n if (xc[i] != yc[i]) return xc[i] > yc[i] ^ isneg ? 1 : -1;\r\n }\r\n\r\n // Compare lengths.\r\n return k == l ? 0 : k > l ^ isneg ? 1 : -1;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big divided by the value of Big y, rounded,\r\n * if necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\r\n */\r\n P.div = function (y) {\r\n var x = this,\r\n Big = x.constructor,\r\n a = x.c, // dividend\r\n b = (y = new Big(y)).c, // divisor\r\n k = x.s == y.s ? 1 : -1,\r\n dp = Big.DP;\r\n\r\n if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n throw Error(INVALID_DP);\r\n }\r\n\r\n // Divisor is zero?\r\n if (!b[0]) {\r\n throw Error(DIV_BY_ZERO);\r\n }\r\n\r\n // Dividend is 0? Return +-0.\r\n if (!a[0]) {\r\n y.s = k;\r\n y.c = [y.e = 0];\r\n return y;\r\n }\r\n\r\n var bl, bt, n, cmp, ri,\r\n bz = b.slice(),\r\n ai = bl = b.length,\r\n al = a.length,\r\n r = a.slice(0, bl), // remainder\r\n rl = r.length,\r\n q = y, // quotient\r\n qc = q.c = [],\r\n qi = 0,\r\n p = dp + (q.e = x.e - y.e) + 1; // precision of the result\r\n\r\n q.s = k;\r\n k = p < 0 ? 0 : p;\r\n\r\n // Create version of divisor with leading zero.\r\n bz.unshift(0);\r\n\r\n // Add zeros to make remainder as long as divisor.\r\n for (; rl++ < bl;) r.push(0);\r\n\r\n do {\r\n\r\n // n is how many times the divisor goes into current remainder.\r\n for (n = 0; n < 10; n++) {\r\n\r\n // Compare divisor and remainder.\r\n if (bl != (rl = r.length)) {\r\n cmp = bl > rl ? 1 : -1;\r\n } else {\r\n for (ri = -1, cmp = 0; ++ri < bl;) {\r\n if (b[ri] != r[ri]) {\r\n cmp = b[ri] > r[ri] ? 1 : -1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // If divisor < remainder, subtract divisor from remainder.\r\n if (cmp < 0) {\r\n\r\n // Remainder can't be more than 1 digit longer than divisor.\r\n // Equalise lengths using divisor with extra leading zero?\r\n for (bt = rl == bl ? b : bz; rl;) {\r\n if (r[--rl] < bt[rl]) {\r\n ri = rl;\r\n for (; ri && !r[--ri];) r[ri] = 9;\r\n --r[ri];\r\n r[rl] += 10;\r\n }\r\n r[rl] -= bt[rl];\r\n }\r\n\r\n for (; !r[0];) r.shift();\r\n } else {\r\n break;\r\n }\r\n }\r\n\r\n // Add the digit n to the result array.\r\n qc[qi++] = cmp ? n : ++n;\r\n\r\n // Update the remainder.\r\n if (r[0] && cmp) r[rl] = a[ai] || 0;\r\n else r = [a[ai]];\r\n\r\n } while ((ai++ < al || r[0] !== UNDEFINED) && k--);\r\n\r\n // Leading zero? Do not remove if result is simply zero (qi == 1).\r\n if (!qc[0] && qi != 1) {\r\n\r\n // There can't be more than one zero.\r\n qc.shift();\r\n q.e--;\r\n p--;\r\n }\r\n\r\n // Round?\r\n if (qi > p) round(q, p, Big.RM, r[0] !== UNDEFINED);\r\n\r\n return q;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Big is equal to the value of Big y, otherwise return false.\r\n */\r\n P.eq = function (y) {\r\n return this.cmp(y) === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Big is greater than the value of Big y, otherwise return\r\n * false.\r\n */\r\n P.gt = function (y) {\r\n return this.cmp(y) > 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Big is greater than or equal to the value of Big y, otherwise\r\n * return false.\r\n */\r\n P.gte = function (y) {\r\n return this.cmp(y) > -1;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Big is less than the value of Big y, otherwise return false.\r\n */\r\n P.lt = function (y) {\r\n return this.cmp(y) < 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Big is less than or equal to the value of Big y, otherwise\r\n * return false.\r\n */\r\n P.lte = function (y) {\r\n return this.cmp(y) < 1;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big minus the value of Big y.\r\n */\r\n P.minus = P.sub = function (y) {\r\n var i, j, t, xlty,\r\n x = this,\r\n Big = x.constructor,\r\n a = x.s,\r\n b = (y = new Big(y)).s;\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.plus(y);\r\n }\r\n\r\n var xc = x.c.slice(),\r\n xe = x.e,\r\n yc = y.c,\r\n ye = y.e;\r\n\r\n // Either zero?\r\n if (!xc[0] || !yc[0]) {\r\n if (yc[0]) {\r\n y.s = -b;\r\n } else if (xc[0]) {\r\n y = new Big(x);\r\n } else {\r\n y.s = 1;\r\n }\r\n return y;\r\n }\r\n\r\n // Determine which is the bigger number. Prepend zeros to equalise exponents.\r\n if (a = xe - ye) {\r\n\r\n if (xlty = a < 0) {\r\n a = -a;\r\n t = xc;\r\n } else {\r\n ye = xe;\r\n t = yc;\r\n }\r\n\r\n t.reverse();\r\n for (b = a; b--;) t.push(0);\r\n t.reverse();\r\n } else {\r\n\r\n // Exponents equal. Check digit by digit.\r\n j = ((xlty = xc.length < yc.length) ? xc : yc).length;\r\n\r\n for (a = b = 0; b < j; b++) {\r\n if (xc[b] != yc[b]) {\r\n xlty = xc[b] < yc[b];\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // x < y? Point xc to the array of the bigger number.\r\n if (xlty) {\r\n t = xc;\r\n xc = yc;\r\n yc = t;\r\n y.s = -y.s;\r\n }\r\n\r\n /*\r\n * Append zeros to xc if shorter. No need to add zeros to yc if shorter as subtraction only\r\n * needs to start at yc.length.\r\n */\r\n if ((b = (j = yc.length) - (i = xc.length)) > 0) for (; b--;) xc[i++] = 0;\r\n\r\n // Subtract yc from xc.\r\n for (b = i; j > a;) {\r\n if (xc[--j] < yc[j]) {\r\n for (i = j; i && !xc[--i];) xc[i] = 9;\r\n --xc[i];\r\n xc[j] += 10;\r\n }\r\n\r\n xc[j] -= yc[j];\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (; xc[--b] === 0;) xc.pop();\r\n\r\n // Remove leading zeros and adjust exponent accordingly.\r\n for (; xc[0] === 0;) {\r\n xc.shift();\r\n --ye;\r\n }\r\n\r\n if (!xc[0]) {\r\n\r\n // n - n = +0\r\n y.s = 1;\r\n\r\n // Result must be zero.\r\n xc = [ye = 0];\r\n }\r\n\r\n y.c = xc;\r\n y.e = ye;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big modulo the value of Big y.\r\n */\r\n P.mod = function (y) {\r\n var ygtx,\r\n x = this,\r\n Big = x.constructor,\r\n a = x.s,\r\n b = (y = new Big(y)).s;\r\n\r\n if (!y.c[0]) {\r\n throw Error(DIV_BY_ZERO);\r\n }\r\n\r\n x.s = y.s = 1;\r\n ygtx = y.cmp(x) == 1;\r\n x.s = a;\r\n y.s = b;\r\n\r\n if (ygtx) return new Big(x);\r\n\r\n a = Big.DP;\r\n b = Big.RM;\r\n Big.DP = Big.RM = 0;\r\n x = x.div(y);\r\n Big.DP = a;\r\n Big.RM = b;\r\n\r\n return this.minus(x.times(y));\r\n };\r\n \r\n \r\n /*\r\n * Return a new Big whose value is the value of this Big negated.\r\n */\r\n P.neg = function () {\r\n var x = new this.constructor(this);\r\n x.s = -x.s;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big plus the value of Big y.\r\n */\r\n P.plus = P.add = function (y) {\r\n var e, k, t,\r\n x = this,\r\n Big = x.constructor;\r\n\r\n y = new Big(y);\r\n\r\n // Signs differ?\r\n if (x.s != y.s) {\r\n y.s = -y.s;\r\n return x.minus(y);\r\n }\r\n\r\n var xe = x.e,\r\n xc = x.c,\r\n ye = y.e,\r\n yc = y.c;\r\n\r\n // Either zero?\r\n if (!xc[0] || !yc[0]) {\r\n if (!yc[0]) {\r\n if (xc[0]) {\r\n y = new Big(x);\r\n } else {\r\n y.s = x.s;\r\n }\r\n }\r\n return y;\r\n }\r\n\r\n xc = xc.slice();\r\n\r\n // Prepend zeros to equalise exponents.\r\n // Note: reverse faster than unshifts.\r\n if (e = xe - ye) {\r\n if (e > 0) {\r\n ye = xe;\r\n t = yc;\r\n } else {\r\n e = -e;\r\n t = xc;\r\n }\r\n\r\n t.reverse();\r\n for (; e--;) t.push(0);\r\n t.reverse();\r\n }\r\n\r\n // Point xc to the longer array.\r\n if (xc.length - yc.length < 0) {\r\n t = yc;\r\n yc = xc;\r\n xc = t;\r\n }\r\n\r\n e = yc.length;\r\n\r\n // Only start adding at yc.length - 1 as the further digits of xc can be left as they are.\r\n for (k = 0; e; xc[e] %= 10) k = (xc[--e] = xc[e] + yc[e] + k) / 10 | 0;\r\n\r\n // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n\r\n if (k) {\r\n xc.unshift(k);\r\n ++ye;\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (e = xc.length; xc[--e] === 0;) xc.pop();\r\n\r\n y.c = xc;\r\n y.e = ye;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /*\r\n * Return a Big whose value is the value of this Big raised to the power n.\r\n * If n is negative, round to a maximum of Big.DP decimal places using rounding\r\n * mode Big.RM.\r\n *\r\n * n {number} Integer, -MAX_POWER to MAX_POWER inclusive.\r\n */\r\n P.pow = function (n) {\r\n var x = this,\r\n one = new x.constructor('1'),\r\n y = one,\r\n isneg = n < 0;\r\n\r\n if (n !== ~~n || n < -MAX_POWER || n > MAX_POWER) {\r\n throw Error(INVALID + 'exponent');\r\n }\r\n\r\n if (isneg) n = -n;\r\n\r\n for (;;) {\r\n if (n & 1) y = y.times(x);\r\n n >>= 1;\r\n if (!n) break;\r\n x = x.times(x);\r\n }\r\n\r\n return isneg ? one.div(y) : y;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big rounded to a maximum precision of sd\r\n * significant digits using rounding mode rm, or Big.RM if rm is not specified.\r\n *\r\n * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\n P.prec = function (sd, rm) {\r\n if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\r\n throw Error(INVALID + 'precision');\r\n }\r\n return round(new this.constructor(this), sd, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big rounded to a maximum of dp decimal places\r\n * using rounding mode rm, or Big.RM if rm is not specified.\r\n * If dp is negative, round to an integer which is a multiple of 10**-dp.\r\n * If dp is not specified, round to 0 decimal places.\r\n *\r\n * dp? {number} Integer, -MAX_DP to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\n P.round = function (dp, rm) {\r\n if (dp === UNDEFINED) dp = 0;\r\n else if (dp !== ~~dp || dp < -MAX_DP || dp > MAX_DP) {\r\n throw Error(INVALID_DP);\r\n }\r\n return round(new this.constructor(this), dp + this.e + 1, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the square root of the value of this Big, rounded, if\r\n * necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\r\n */\r\n P.sqrt = function () {\r\n var r, c, t,\r\n x = this,\r\n Big = x.constructor,\r\n s = x.s,\r\n e = x.e,\r\n half = new Big('0.5');\r\n\r\n // Zero?\r\n if (!x.c[0]) return new Big(x);\r\n\r\n // Negative?\r\n if (s < 0) {\r\n throw Error(NAME + 'No square root');\r\n }\r\n\r\n // Estimate.\r\n s = Math.sqrt(x + '');\r\n\r\n // Math.sqrt underflow/overflow?\r\n // Re-estimate: pass x coefficient to Math.sqrt as integer, then adjust the result exponent.\r\n if (s === 0 || s === 1 / 0) {\r\n c = x.c.join('');\r\n if (!(c.length + e & 1)) c += '0';\r\n s = Math.sqrt(c);\r\n e = ((e + 1) / 2 | 0) - (e < 0 || e & 1);\r\n r = new Big((s == 1 / 0 ? '5e' : (s = s.toExponential()).slice(0, s.indexOf('e') + 1)) + e);\r\n } else {\r\n r = new Big(s + '');\r\n }\r\n\r\n e = r.e + (Big.DP += 4);\r\n\r\n // Newton-Raphson iteration.\r\n do {\r\n t = r;\r\n r = half.times(t.plus(x.div(t)));\r\n } while (t.c.slice(0, e).join('') !== r.c.slice(0, e).join(''));\r\n\r\n return round(r, (Big.DP -= 4) + r.e + 1, Big.RM);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Big whose value is the value of this Big times the value of Big y.\r\n */\r\n P.times = P.mul = function (y) {\r\n var c,\r\n x = this,\r\n Big = x.constructor,\r\n xc = x.c,\r\n yc = (y = new Big(y)).c,\r\n a = xc.length,\r\n b = yc.length,\r\n i = x.e,\r\n j = y.e;\r\n\r\n // Determine sign of result.\r\n y.s = x.s == y.s ? 1 : -1;\r\n\r\n // Return signed 0 if either 0.\r\n if (!xc[0] || !yc[0]) {\r\n y.c = [y.e = 0];\r\n return y;\r\n }\r\n\r\n // Initialise exponent of result as x.e + y.e.\r\n y.e = i + j;\r\n\r\n // If array xc has fewer digits than yc, swap xc and yc, and lengths.\r\n if (a < b) {\r\n c = xc;\r\n xc = yc;\r\n yc = c;\r\n j = a;\r\n a = b;\r\n b = j;\r\n }\r\n\r\n // Initialise coefficient array of result with zeros.\r\n for (c = new Array(j = a + b); j--;) c[j] = 0;\r\n\r\n // Multiply.\r\n\r\n // i is initially xc.length.\r\n for (i = b; i--;) {\r\n b = 0;\r\n\r\n // a is yc.length.\r\n for (j = a + i; j > i;) {\r\n\r\n // Current sum of products at this digit position, plus carry.\r\n b = c[j] + yc[i] * xc[j - i - 1] + b;\r\n c[j--] = b % 10;\r\n\r\n // carry\r\n b = b / 10 | 0;\r\n }\r\n\r\n c[j] = b;\r\n }\r\n\r\n // Increment result exponent if there is a final carry, otherwise remove leading zero.\r\n if (b) ++y.e;\r\n else c.shift();\r\n\r\n // Remove trailing zeros.\r\n for (i = c.length; !c[--i];) c.pop();\r\n y.c = c;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Big in exponential notation rounded to dp fixed\r\n * decimal places using rounding mode rm, or Big.RM if rm is not specified.\r\n *\r\n * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\n P.toExponential = function (dp, rm) {\r\n var x = this,\r\n n = x.c[0];\r\n\r\n if (dp !== UNDEFINED) {\r\n if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n throw Error(INVALID_DP);\r\n }\r\n x = round(new x.constructor(x), ++dp, rm);\r\n for (; x.c.length < dp;) x.c.push(0);\r\n }\r\n\r\n return stringify(x, true, !!n);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Big in normal notation rounded to dp fixed\r\n * decimal places using rounding mode rm, or Big.RM if rm is not specified.\r\n *\r\n * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n *\r\n * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n */\r\n P.toFixed = function (dp, rm) {\r\n var x = this,\r\n n = x.c[0];\r\n\r\n if (dp !== UNDEFINED) {\r\n if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n throw Error(INVALID_DP);\r\n }\r\n x = round(new x.constructor(x), dp + x.e + 1, rm);\r\n\r\n // x.e may have changed if the value is rounded up.\r\n for (dp = dp + x.e + 1; x.c.length < dp;) x.c.push(0);\r\n }\r\n\r\n return stringify(x, false, !!n);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Big.\r\n * Return exponential notation if this Big has a positive exponent equal to or greater than\r\n * Big.PE, or a negative exponent equal to or less than Big.NE.\r\n * Omit the sign for negative zero.\r\n */\r\n P.toJSON = P.toString = function () {\r\n var x = this,\r\n Big = x.constructor;\r\n return stringify(x, x.e <= Big.NE || x.e >= Big.PE, !!x.c[0]);\r\n };\r\n\r\n\r\n /*\r\n * Return the value of this Big as a primitve number.\r\n */\r\n P.toNumber = function () {\r\n var n = Number(stringify(this, true, true));\r\n if (this.constructor.strict === true && !this.eq(n.toString())) {\r\n throw Error(NAME + 'Imprecise conversion');\r\n }\r\n return n;\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Big rounded to sd significant digits using\r\n * rounding mode rm, or Big.RM if rm is not specified.\r\n * Use exponential notation if sd is less than the number of digits necessary to represent\r\n * the integer part of the value in normal notation.\r\n *\r\n * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\n P.toPrecision = function (sd, rm) {\r\n var x = this,\r\n Big = x.constructor,\r\n n = x.c[0];\r\n\r\n if (sd !== UNDEFINED) {\r\n if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\r\n throw Error(INVALID + 'precision');\r\n }\r\n x = round(new Big(x), sd, rm);\r\n for (; x.c.length < sd;) x.c.push(0);\r\n }\r\n\r\n return stringify(x, sd <= x.e || x.e <= Big.NE || x.e >= Big.PE, !!n);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Big.\r\n * Return exponential notation if this Big has a positive exponent equal to or greater than\r\n * Big.PE, or a negative exponent equal to or less than Big.NE.\r\n * Include the sign for negative zero.\r\n */\r\n P.valueOf = function () {\r\n var x = this,\r\n Big = x.constructor;\r\n if (Big.strict === true) {\r\n throw Error(NAME + 'valueOf disallowed');\r\n }\r\n return stringify(x, x.e <= Big.NE || x.e >= Big.PE, true);\r\n };\r\n\r\n\r\n // Export\r\n\r\n\r\n Big = _Big_();\r\n\r\n Big['default'] = Big.Big = Big;\r\n\r\n //AMD.\r\n if (typeof define === 'function' && define.amd) {\r\n define(function () { return Big; });\r\n\r\n // Node and other CommonJS-like environments that support module.exports.\r\n } else if (typeof module !== 'undefined' && module.exports) {\r\n module.exports = Big;\r\n\r\n //Browser.\r\n } else {\r\n GLOBAL.Big = Big;\r\n }\r\n})(this);\r\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* Cache data structure with:\n* - enumerable items\n* - unique hash item access (if none is passed in, one is generated)\n* - size (length) expiration\n* - controllable expiration (e.g. keep in cache longer if older/less likely to change)\n* - time-based expiration\n* - custom expiration based on passed-in function\n*\n* Also:\n* - built to work well with browserify\n* - no dependencies at all\n* - pet friendly\n*\n* @author Steven Velozo <steven@velozo.com>\n*/\nconst libFableServiceProviderBase = require('fable-serviceproviderbase');\n\nconst libLinkedList = require(`./LinkedList.js`);\n\nclass CashMoney extends libFableServiceProviderBase\n{\n\tconstructor(pFable, pManifest, pServiceHash)\n\t{\n\t\tif (pFable === undefined)\n\t\t{\n\t\t\tsuper({});\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsuper(pFable, pManifest, pServiceHash);\n\t\t}\n\n this.serviceType = 'ObjectCache';\n\n\t\t// The map of node objects by hash because Reasons.\n\t\tthis._HashMap = {};\n\n\t\tthis._RecordMap = {};\n\n\t\tthis._List = new libLinkedList();\n\n\t\t// If the list gets over maxLength, we will automatically remove nodes on insertion.\n\t\tthis.maxLength = 0;\n\n\t\t// If cache entries get over this age, they are removed with prune\n\t\tthis.maxAge = 0;\n\t}\n\n\tget RecordMap()\n\t{\n\t\treturn this._RecordMap;\n\t}\n\n\t// Add (or update) a node in the cache\n\tput(pData, pHash)\n\t{\n\t\t// If the hash of the record exists\n\t\tif (this._HashMap.hasOwnProperty(pHash))\n\t\t{\n\t\t\t// Just update the hashed records datum\n\t\t\tthis._HashMap[pHash].Datum = pData;\n\t\t\tthis._RecordMap[pHash] = pData;\n\t\t\treturn this._HashMap[pHash].Datum;\n\t\t}\n\n\t\tlet tmpNode = this._List.push(pData, pHash);\n\t\tthis._HashMap[tmpNode.Hash] = tmpNode;\n\t\tthis._RecordMap[pHash] = pData;\n\n\t\t// Automatically prune if over length, but only prune this nodes worth.\n\t\tif (this.maxLength > 0 && this._List.length > this.maxLength)\n\t\t{\n\t\t\t// Pop it off the head of the list\n\t\t\ttmpNode = this._List.pop();\n\t\t\t// Also remove it from the hashmap\n\t\t\tdelete this._RecordMap[tmpNode.Hash];\n\t\t\tdelete this._HashMap[tmpNode.Hash];\n\t\t}\n\n\t\t// Now some expiration properties on the node metadata... namely the birthdate in ms of the node\n\t\ttmpNode.Metadata.Created = +new Date();\n\n\t\treturn tmpNode.Datum;\n\t}\n\n\t// Read a datum by hash from the cache\n\tread(pHash)\n\t{\n\t\tif (!this._HashMap.hasOwnProperty(pHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\treturn this._HashMap[pHash].Datum;\n\t}\n\n\t// Reinvigorate a node based on hash, updating the timestamp and moving it to the head of the list (also removes custom metadata)\n\ttouch(pHash)\n\t{\n\t\tif (!this._HashMap.hasOwnProperty(pHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\t// Get the old node out of the list\n\t\tlet tmpNode = this._List.remove(this._HashMap[pHash]);\n\t\t// Remove it from the hash map\n\t\tdelete this._RecordMap[pHash];\n\t\tdelete this._HashMap[pHash];\n\n\t\t// Now put it back, fresh.\n\t\treturn this.put(tmpNode.Datum, tmpNode.Hash);\n\t}\n\n\t// Expire a cached record based on hash\n\texpire(pHash)\n\t{\n\t\tif (!this._HashMap.hasOwnProperty(pHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tlet tmpNode = this._HashMap[pHash];\n\n\t\t// Remove it from the list of cached records\n\t\ttmpNode = this._List.remove(tmpNode);\n\t\t// Also remove it from the hashmap\n\t\tdelete this._RecordMap[tmpNode.Hash];\n\t\tdelete this._HashMap[tmpNode.Hash];\n\n\t\t// Return it in case the consumer wants to do anything with it\n\t\treturn tmpNode;\n\t}\n\n\t// Prune records from the cached set based on maxAge\n\tpruneBasedOnExpiration(fComplete, pRemovedRecords)\n\t{\n\t\tlet tmpRemovedRecords = (typeof(pRemovedRecords) === 'undefined') ? [] : pRemovedRecords;\n\n\t\tif (this.maxAge < 1)\n\t\t{\n\t\t\treturn fComplete(tmpRemovedRecords);\n\t\t}\n\n\t\t// Now enumerate each record and remove any that are expired\n\t\tlet tmpNow = +new Date();\n\t\tlet tmpKeys = Object.keys(this._HashMap);\n\n\t\tfor (let i = 0; i < tmpKeys.length; i++)\n\t\t{\n\t\t\t// Expire the node if it is older than max age milliseconds\n\t\t\tif (tmpNow - this._HashMap[tmpKeys[i]].Metadata.Created >= this.maxAge)\n\t\t\t{\n\t\t\t\ttmpRemovedRecords.push(this.expire(tmpKeys[i]));\n\t\t\t}\n\t\t}\n\t\tfComplete(tmpRemovedRecords);\n\t}\n\n\t// Prune records from the cached set based on maxLength\n\tpruneBasedOnLength(fComplete, pRemovedRecords)\n\t{\n\t\tlet tmpRemovedRecords = (typeof(pRemovedRecords) === 'undefined') ? [] : pRemovedRecords;\n\n\t\t// Pop records off until we have reached maxLength unless it's 0\n\t\tif (this.maxLength > 0)\n\t\t{\n\t\t\twhile (this._List.length > this.maxLength)\n\t\t\t{\n\t\t\t\ttmpRemovedRecords.push(this._List.pop());\n\t\t\t}\n\t\t}\n\n\t\treturn fComplete(tmpRemovedRecords);\n\t}\n\n\t// Prune records from the cached set based on passed in pPruneFunction(pDatum, pHash, pNode) -- returning true expires it\n\tpruneCustom(fComplete, fPruneFunction, pRemovedRecords)\n\t{\n\t\tlet tmpRemovedRecords = (typeof(pRemovedRecords) === 'undefined') ? [] : pRemovedRecords;\n\n\t\tlet tmpKeys = Object.keys(this._HashMap);\n\t\tfor (let i = 0; i < tmpKeys.length; i++)\n\t\t{\n\t\t\tlet tmpNode = this._HashMap[tmpKeys[i]];\n\t\t\t// Expire the node if the passed in function returns true\n\t\t\tif (fPruneFunction(tmpNode.Datum, tmpNode.Hash, tmpNode))\n\t\t\t{\n\t\t\t\ttmpRemovedRecords.push(this.expire(tmpKeys[i]));\n\t\t\t}\n\t\t}\n\t\tfComplete(tmpRemovedRecords);\n\t}\n\n\t// Prune the list down to the asserted rules (max age then max length if still too long)\n\tprune(fComplete)\n\t{\n\t\tlet tmpRemovedRecords = [];\n\n\t\t// If there are no cached records, we are done.\n\t\tif (this._List.length < 1)\n\t\t{\n\t\t\treturn fComplete(tmpRemovedRecords);\n\t\t}\n\n\t\t// Now prune based on expiration time\n\t\tthis.pruneBasedOnExpiration((fExpirationPruneComplete)=>\n\t\t\t{\n\t\t\t\t// Now prune based on length, then return the removed records in the callback.\n\t\t\t\tthis.pruneBasedOnLength(fComplete, tmpRemovedRecords);\n\t\t\t}, tmpRemovedRecords);\n\t}\n\n\t// Get a low level node (including metadata statistics) by hash from the cache\n\tgetNode(pHash)\n\t{\n\t\tif (!this._HashMap.hasOwnProperty(pHash))\n\t\t\treturn false;\n\n\t\treturn this._HashMap[pHash];\n\t}\n}\n\nmodule.exports = CashMoney;","/**\n* Double Linked List Node\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module CashMoney\n*/\n\n/**\n* Linked List Node Prototype\n*\n* @class LinkedListNode\n* @constructor\n*/\n\nclass LinkedListNode\n{\n\tconstructor()\n\t{\n\t\tthis.Hash = false;\n\t\tthis.Datum = false;\n\n\t\t// This is where expiration and other elements are stored;\n\t\tthis.Metadata = {};\n\n\t\tthis.LeftNode = false;\n\t\tthis.RightNode = false;\n\n\t\t// To allow safe specialty operations on nodes\n\t\tthis.__ISNODE = true;\n\t}\n}\n\nmodule.exports = LinkedListNode;","\"use strict\"\n/**\n* Simple double linked list to hold the cache entries in, in order.\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module FeeFiFo\n*/\n\nconst libLinkedListNode = require('./LinkedList-Node.js');\n\n/**\n* Quality Cache Goodness\n*\n* @class CashMoney\n* @constructor\n*/\n\nclass LinkedList\n{\n\tconstructor()\n\t{\n\t\t// Total number of nodes ever processed by this ADT\n\t\tthis.totalNodes = 0;\n\n\t\t// The length of the set of nodes currently in the list\n\t\tthis.length = 0;\n\n\t\tthis.head = false;\n\t\tthis.tail = false;\n\t}\n\n\t// Create a node object.\n\tinitializeNode(pDatum, pHash)\n\t{\n\t\t// Don't allow undefined to be added to the list because of reasons\n\t\tif (typeof(pDatum) === 'undefined')\n\t\t\treturn false;\n\n\t\tthis.totalNodes++;\n\n\t\t// Get (or create) a unique hash\n\t\tlet tmpHash = (typeof(pHash) != 'undefined') ? pHash : `NODE[${this.totalNodes}]`;\n\n\t\tlet tmpNode = new libLinkedListNode();\n\n\t\ttmpNode.Hash = tmpHash;\n\t\ttmpNode.Datum = pDatum;\n\n\t\treturn tmpNode;\n\t}\n\n\t// Add a node to the end (right of tail) of the list.\n\tappend(pDatum, pHash)\n\t{\n\t\t// TODO: Should we check if pDatum is actually a node and do the \"right\" thing?\n\t\tlet tmpNode = this.initializeNode(pDatum, pHash);\n\t\tif (!tmpNode)\n\t\t\treturn false;\n\n\t\t// The list just got longer!\n\t\tthis.length++;\n\n\t\t// If the list was empty, create a new list from it (it isn't possible to have a tail with no head)\n\t\tif (this.length == 1)\n\t\t{\n\t\t\tthis.head = tmpNode;\n\t\t\tthis.tail = tmpNode;\n\t\t\treturn tmpNode;\n\t\t}\n\n\t\tthis.tail.RightNode = tmpNode;\n\t\ttmpNode.LeftNode = this.tail;\n\t\tthis.tail = tmpNode;\n\n\t\treturn tmpNode;\n\t}\n\n\t// Append to tail of list (FIFO)\n\tpush(pDatum, pHash)\n\t{\n\t\treturn this.append(pDatum, pHash);\n\t}\n\n\t// Add a node to the beginning (left of head) of the list.\n\tprepend(pDatum, pHash)\n\t{\n\t\t// TODO: Should we check if pDatum is actually a node and do the \"right\" thing?\n\t\tlet tmpNode = this.initializeNode(pDatum, pHash);\n\t\tif (!tmpNode)\n\t\t\treturn false;\n\n\t\t// The list just got longer!\n\t\tthis.length++;\n\n\t\t// If the list was empty, create a new list from it (it isn't possible to have a tail with no head)\n\t\tif (this.length == 1)\n\t\t{\n\t\t\tthis.head = tmpNode;\n\t\t\tthis.tail = tmpNode;\n\t\t\treturn tmpNode;\n\t\t}\n\n\t\tthis.head.LeftNode = tmpNode;\n\t\ttmpNode.RightNode = this.head;\n\t\tthis.head = tmpNode;\n\t\treturn tmpNode;\n\t}\n\n\t// Remove a node from the list\n\tremove(pNode)\n\t{\n\t\tif (typeof(pNode) === 'undefined')\n\t\t\treturn false;\n\n\t\tif (!pNode.__ISNODE)\n\t\t\treturn false;\n\n\t\tthis.length--;\n\n\t\t// Last element in list. Empty it out.\n\t\tif (this.length < 1)\n\t\t{\n\t\t\tthis.head = false;\n\t\t\tthis.tail = false;\n\t\t\treturn pNode;\n\t\t}\n\n\t\t// It's somewhere in the middle, surgically remove it.\n\t\tif (pNode.LeftNode && pNode.RightNode)\n\t\t{\n\t\t\tpNode.LeftNode.RightNode = pNode.RightNode;\n\t\t\tpNode.RightNode.LeftNode = pNode.LeftNode;\n\n\t\t\tpNode.RightNode = false;\n\t\t\tpNode.LeftNode = false;\n\t\t\treturn pNode;\n\t\t}\n\n\t\t// It's the tail\n\t\tif (pNode.LeftNode)\n\t\t{\n\t\t\tpNode.LeftNode.RightNode = false;\n\t\t\tthis.tail = pNode.LeftNode;\n\t\t\tpNode.LeftNode = false;\n\t\t\treturn pNode;\n\t\t}\n\n\t\t// It must be the head\n\t\tpNode.RightNode.LeftNode = false;\n\t\tthis.head = pNode.RightNode;\n\t\tpNode.RightNode = false;\n\t\treturn pNode;\n\t}\n\n\t// Remove the head of the list (FIFO)\n\tpop()\n\t{\n\t\treturn this.remove(this.head);\n\t}\n\n\t// Enumerate over each node IN ORDER, running the function fAction(pDatum, pHash, fCallback) then calling the function fComplete callback when done\n\teach(fAction, fComplete)\n\t{\n\t\tif (this.length < 1)\n\t\t\treturn fComplete();\n\n\t\tlet tmpNode = false;\n\n\t\tlet fIterator = (pError)=>\n\t\t{\n\t\t\t// If the user passed in a callback with an error, call their callback with the error\n\t\t\tif (pError)\n\t\t\t\treturn fComplete(pError);\n\n\t\t\t// If there is no node, this must be the initial run.\n\t\t\tif (!tmpNode)\n\t\t\t\ttmpNode = this.head;\n\t\t\t// Check if we are at the tail of the list\n\t\t\telse if (!tmpNode.RightNode)\n\t\t\t\treturn fComplete();\n\t\t\t// Proceed to the next node\n\t\t\telse\n\t\t\t\ttmpNode = tmpNode.RightNode;\n\n\t\t\t// Call the actual action\n\t\t\t// I hate this pattern because long tails eventually cause stack overflows.\n\t\t\tfAction(tmpNode.Datum, tmpNode.Hash, fIterator);\n\t\t};\n\n\t\t// Now kick off the iterator\n\t\treturn fIterator();\n\t}\n\n\t// Seek a specific node, 0 is the index of the first node.\n\tseek(pNodeIndex)\n\t{\n\t\tif (!pNodeIndex)\n\t\t\treturn false;\n\t\tif (this.length < 1)\n\t\t\treturn false;\n\t\tif (pNodeIndex >= this.length)\n\t\t\treturn false;\n\n\t\tlet tmpNode = this.head;\n\t\tfor (let i = 0; i < pNodeIndex; i++)\n\t\t{\n\t\t\ttmpNode = tmpNode.RightNode;\n\t\t}\n\n\t\treturn tmpNode;\n\t}\n}\n\nmodule.exports = LinkedList;","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBind = require('./');\n\nvar $indexOf = callBind(GetIntrinsic('String.prototype.indexOf'));\n\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\tvar intrinsic = GetIntrinsic(name, !!allowMissing);\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBind(intrinsic);\n\t}\n\treturn intrinsic;\n};\n","'use strict';\n\nvar bind = require('function-bind');\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $apply = GetIntrinsic('%Function.prototype.apply%');\nvar $call = GetIntrinsic('%Function.prototype.call%');\nvar $reflectApply = GetIntrinsic('%Reflect.apply%', true) || bind.call($call, $apply);\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true);\nvar $defineProperty = GetIntrinsic('%Object.defineProperty%', true);\nvar $max = GetIntrinsic('%Math.max%');\n\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = null;\n\t}\n}\n\nmodule.exports = function callBind(originalFunction) {\n\tvar func = $reflectApply(bind, $call, arguments);\n\tif ($gOPD && $defineProperty) {\n\t\tvar desc = $gOPD(func, 'length');\n\t\tif (desc.configurable) {\n\t\t\t// original length, plus the receiver, minus any additional arguments (after the receiver)\n\t\t\t$defineProperty(\n\t\t\t\tfunc,\n\t\t\t\t'length',\n\t\t\t\t{ value: 1 + $max(0, originalFunction.length - (arguments.length - 1)) }\n\t\t\t);\n\t\t}\n\t}\n\treturn func;\n};\n\nvar applyBind = function applyBind() {\n\treturn $reflectApply(bind, $apply, arguments);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n","/*!\n * cookie\n * Copyright(c) 2012-2014 Roman Shtylman\n * Copyright(c) 2015 Douglas Christopher Wilson\n * MIT Licensed\n */\n\n'use strict';\n\n/**\n * Module exports.\n * @public\n */\n\nexports.parse = parse;\nexports.serialize = serialize;\n\n/**\n * Module variables.\n * @private\n */\n\nvar __toString = Object.prototype.toString\n\n/**\n * RegExp to match field-content in RFC 7230 sec 3.2\n *\n * field-content = field-vchar [ 1*( SP / HTAB ) field-vchar ]\n * field-vchar = VCHAR / obs-text\n * obs-text = %x80-FF\n */\n\nvar fieldContentRegExp = /^[\\u0009\\u0020-\\u007e\\u0080-\\u00ff]+$/;\n\n/**\n * Parse a cookie header.\n *\n * Parse the given cookie header string into an object\n * The object has the various cookies as keys(names) => values\n *\n * @param {string} str\n * @param {object} [options]\n * @return {object}\n * @public\n */\n\nfunction parse(str, options) {\n if (typeof str !== 'string') {\n throw new TypeError('argument str must be a string');\n }\n\n var obj = {}\n var opt = options || {};\n var dec = opt.decode || decode;\n\n var index = 0\n while (index < str.length) {\n var eqIdx = str.indexOf('=', index)\n\n // no more cookie pairs\n if (eqIdx === -1) {\n break\n }\n\n var endIdx = str.indexOf(';', index)\n\n if (endIdx === -1) {\n endIdx = str.length\n } else if (endIdx < eqIdx) {\n // backtrack on prior semicolon\n index = str.lastIndexOf(';', eqIdx - 1) + 1\n continue\n }\n\n var key = str.slice(index, eqIdx).trim()\n\n // only assign once\n if (undefined === obj[key]) {\n var val = str.slice(eqIdx + 1, endIdx).trim()\n\n // quoted values\n if (val.charCodeAt(0) === 0x22) {\n val = val.slice(1, -1)\n }\n\n obj[key] = tryDecode(val, dec);\n }\n\n index = endIdx + 1\n }\n\n return obj;\n}\n\n/**\n * Serialize data into a cookie header.\n *\n * Serialize the a name value pair into a cookie string suitable for\n * http headers. An optional options object specified cookie parameters.\n *\n * serialize('foo', 'bar', { httpOnly: true })\n * => \"foo=bar; httpOnly\"\n *\n * @param {string} name\n * @param {string} val\n * @param {object} [options]\n * @return {string}\n * @public\n */\n\nfunction serialize(name, val, options) {\n var opt = options || {};\n var enc = opt.encode || encode;\n\n if (typeof enc !== 'function') {\n throw new TypeError('option encode is invalid');\n }\n\n if (!fieldContentRegExp.test(name)) {\n throw new TypeError('argument name is invalid');\n }\n\n var value = enc(val);\n\n if (value && !fieldContentRegExp.test(value)) {\n throw new TypeError('argument val is invalid');\n }\n\n var str = name + '=' + value;\n\n if (null != opt.maxAge) {\n var maxAge = opt.maxAge - 0;\n\n if (isNaN(maxAge) || !isFinite(maxAge)) {\n throw new TypeError('option maxAge is invalid')\n }\n\n str += '; Max-Age=' + Math.floor(maxAge);\n }\n\n if (opt.domain) {\n if (!fieldContentRegExp.test(opt.domain)) {\n throw new TypeError('option domain is invalid');\n }\n\n str += '; Domain=' + opt.domain;\n }\n\n if (opt.path) {\n if (!fieldContentRegExp.test(opt.path)) {\n throw new TypeError('option path is invalid');\n }\n\n str += '; Path=' + opt.path;\n }\n\n if (opt.expires) {\n var expires = opt.expires\n\n if (!isDate(expires) || isNaN(expires.valueOf())) {\n throw new TypeError('option expires is invalid');\n }\n\n str += '; Expires=' + expires.toUTCString()\n }\n\n if (opt.httpOnly) {\n str += '; HttpOnly';\n }\n\n if (opt.secure) {\n str += '; Secure';\n }\n\n if (opt.priority) {\n var priority = typeof opt.priority === 'string'\n ? opt.priority.toLowerCase()\n : opt.priority\n\n switch (priority) {\n case 'low':\n str += '; Priority=Low'\n break\n case 'medium':\n str += '; Priority=Medium'\n break\n case 'high':\n str += '; Priority=High'\n break\n default:\n throw new TypeError('option priority is invalid')\n }\n }\n\n if (opt.sameSite) {\n var sameSite = typeof opt.sameSite === 'string'\n ? opt.sameSite.toLowerCase() : opt.sameSite;\n\n switch (sameSite) {\n case true:\n str += '; SameSite=Strict';\n break;\n case 'lax':\n str += '; SameSite=Lax';\n break;\n case 'strict':\n str += '; SameSite=Strict';\n break;\n case 'none':\n str += '; SameSite=None';\n break;\n default:\n throw new TypeError('option sameSite is invalid');\n }\n }\n\n return str;\n}\n\n/**\n * URL-decode string value. Optimized to skip native call when no %.\n *\n * @param {string} str\n * @returns {string}\n */\n\nfunction decode (str) {\n return str.indexOf('%') !== -1\n ? decodeURIComponent(str)\n : str\n}\n\n/**\n * URL-encode value.\n *\n * @param {string} str\n * @returns {string}\n */\n\nfunction encode (val) {\n return encodeURIComponent(val)\n}\n\n/**\n * Determine if value is a Date.\n *\n * @param {*} val\n * @private\n */\n\nfunction isDate (val) {\n return __toString.call(val) === '[object Date]' ||\n val instanceof Date\n}\n\n/**\n * Try decoding a string using a decoding function.\n *\n * @param {string} str\n * @param {function} decode\n * @private\n */\n\nfunction tryDecode(str, decode) {\n try {\n return decode(str);\n } catch (e) {\n return str;\n }\n}\n","!function(t,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=e():\"function\"==typeof define&&define.amd?define(e):(t=\"undefined\"!=typeof globalThis?globalThis:t||self).dayjs=e()}(this,(function(){\"use strict\";var t=1e3,e=6e4,n=36e5,r=\"millisecond\",i=\"second\",s=\"minute\",u=\"hour\",a=\"day\",o=\"week\",c=\"month\",f=\"quarter\",h=\"year\",d=\"date\",l=\"Invalid Date\",$=/^(\\d{4})[-/]?(\\d{1,2})?[-/]?(\\d{0,2})[Tt\\s]*(\\d{1,2})?:?(\\d{1,2})?:?(\\d{1,2})?[.:]?(\\d+)?$/,y=/\\[([^\\]]+)]|Y{1,4}|M{1,4}|D{1,2}|d{1,4}|H{1,2}|h{1,2}|a|A|m{1,2}|s{1,2}|Z{1,2}|SSS/g,M={name:\"en\",weekdays:\"Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday\".split(\"_\"),months:\"January_February_March_April_May_June_July_August_September_October_November_December\".split(\"_\"),ordinal:function(t){var e=[\"th\",\"st\",\"nd\",\"rd\"],n=t%100;return\"[\"+t+(e[(n-20)%10]||e[n]||e[0])+\"]\"}},m=function(t,e,n){var r=String(t);return!r||r.length>=e?t:\"\"+Array(e+1-r.length).join(n)+t},v={s:m,z:function(t){var e=-t.utcOffset(),n=Math.abs(e),r=Math.floor(n/60),i=n%60;return(e<=0?\"+\":\"-\")+m(r,2,\"0\")+\":\"+m(i,2,\"0\")},m:function t(e,n){if(e.date()<n.date())return-t(n,e);var r=12*(n.year()-e.year())+(n.month()-e.month()),i=e.clone().add(r,c),s=n-i<0,u=e.clone().add(r+(s?-1:1),c);return+(-(r+(n-i)/(s?i-u:u-i))||0)},a:function(t){return t<0?Math.ceil(t)||0:Math.floor(t)},p:function(t){return{M:c,y:h,w:o,d:a,D:d,h:u,m:s,s:i,ms:r,Q:f}[t]||String(t||\"\").toLowerCase().replace(/s$/,\"\")},u:function(t){return void 0===t}},g=\"en\",D={};D[g]=M;var p=\"$isDayjsObject\",S=function(t){return t instanceof _||!(!t||!t[p])},w=function t(e,n,r){var i;if(!e)return g;if(\"string\"==typeof e){var s=e.toLowerCase();D[s]&&(i=s),n&&(D[s]=n,i=s);var u=e.split(\"-\");if(!i&&u.length>1)return t(u[0])}else{var a=e.name;D[a]=e,i=a}return!r&&i&&(g=i),i||!r&&g},O=function(t,e){if(S(t))return t.clone();var n=\"object\"==typeof e?e:{};return n.date=t,n.args=arguments,new _(n)},b=v;b.l=w,b.i=S,b.w=function(t,e){return O(t,{locale:e.$L,utc:e.$u,x:e.$x,$offset:e.$offset})};var _=function(){function M(t){this.$L=w(t.locale,null,!0),this.parse(t),this.$x=this.$x||t.x||{},this[p]=!0}var m=M.prototype;return m.parse=function(t){this.$d=function(t){var e=t.date,n=t.utc;if(null===e)return new Date(NaN);if(b.u(e))return new Date;if(e instanceof Date)return new Date(e);if(\"string\"==typeof e&&!/Z$/i.test(e)){var r=e.match($);if(r){var i=r[2]-1||0,s=(r[7]||\"0\").substring(0,3);return n?new Date(Date.UTC(r[1],i,r[3]||1,r[4]||0,r[5]||0,r[6]||0,s)):new Date(r[1],i,r[3]||1,r[4]||0,r[5]||0,r[6]||0,s)}}return new Date(e)}(t),this.init()},m.init=function(){var t=this.$d;this.$y=t.getFullYear(),this.$M=t.getMonth(),this.$D=t.getDate(),this.$W=t.getDay(),this.$H=t.getHours(),this.$m=t.getMinutes(),this.$s=t.getSeconds(),this.$ms=t.getMilliseconds()},m.$utils=function(){return b},m.isValid=function(){return!(this.$d.toString()===l)},m.isSame=function(t,e){var n=O(t);return this.startOf(e)<=n&&n<=this.endOf(e)},m.isAfter=function(t,e){return O(t)<this.startOf(e)},m.isBefore=function(t,e){return this.endOf(e)<O(t)},m.$g=function(t,e,n){return b.u(t)?this[e]:this.set(n,t)},m.unix=function(){return Math.floor(this.valueOf()/1e3)},m.valueOf=function(){return this.$d.getTime()},m.startOf=function(t,e){var n=this,r=!!b.u(e)||e,f=b.p(t),l=function(t,e){var i=b.w(n.$u?Date.UTC(n.$y,e,t):new Date(n.$y,e,t),n);return r?i:i.endOf(a)},$=function(t,e){return b.w(n.toDate()[t].apply(n.toDate(\"s\"),(r?[0,0,0,0]:[23,59,59,999]).slice(e)),n)},y=this.$W,M=this.$M,m=this.$D,v=\"set\"+(this.$u?\"UTC\":\"\");switch(f){case h:return r?l(1,0):l(31,11);case c:return r?l(1,M):l(0,M+1);case o:var g=this.$locale().weekStart||0,D=(y<g?y+7:y)-g;return l(r?m-D:m+(6-D),M);case a:case d:return $(v+\"Hours\",0);case u:return $(v+\"Minutes\",1);case s:return $(v+\"Seconds\",2);case i:return $(v+\"Milliseconds\",3);default:return this.clone()}},m.endOf=function(t){return this.startOf(t,!1)},m.$set=function(t,e){var n,o=b.p(t),f=\"set\"+(this.$u?\"UTC\":\"\"),l=(n={},n[a]=f+\"Date\",n[d]=f+\"Date\",n[c]=f+\"Month\",n[h]=f+\"FullYear\",n[u]=f+\"Hours\",n[s]=f+\"Minutes\",n[i]=f+\"Seconds\",n[r]=f+\"Milliseconds\",n)[o],$=o===a?this.$D+(e-this.$W):e;if(o===c||o===h){var y=this.clone().set(d,1);y.$d[l]($),y.init(),this.$d=y.set(d,Math.min(this.$D,y.daysInMonth())).$d}else l&&this.$d[l]($);return this.init(),this},m.set=function(t,e){return this.clone().$set(t,e)},m.get=function(t){return this[b.p(t)]()},m.add=function(r,f){var d,l=this;r=Number(r);var $=b.p(f),y=function(t){var e=O(l);return b.w(e.date(e.date()+Math.round(t*r)),l)};if($===c)return this.set(c,this.$M+r);if($===h)return this.set(h,this.$y+r);if($===a)return y(1);if($===o)return y(7);var M=(d={},d[s]=e,d[u]=n,d[i]=t,d)[$]||1,m=this.$d.getTime()+r*M;return b.w(m,this)},m.subtract=function(t,e){return this.add(-1*t,e)},m.format=function(t){var e=this,n=this.$locale();if(!this.isValid())return n.invalidDate||l;var r=t||\"YYYY-MM-DDTHH:mm:ssZ\",i=b.z(this),s=this.$H,u=this.$m,a=this.$M,o=n.weekdays,c=n.months,f=n.meridiem,h=function(t,n,i,s){return t&&(t[n]||t(e,r))||i[n].slice(0,s)},d=function(t){return b.s(s%12||12,t,\"0\")},$=f||function(t,e,n){var r=t<12?\"AM\":\"PM\";return n?r.toLowerCase():r};return r.replace(y,(function(t,r){return r||function(t){switch(t){case\"YY\":return String(e.$y).slice(-2);case\"YYYY\":return b.s(e.$y,4,\"0\");case\"M\":return a+1;case\"MM\":return b.s(a+1,2,\"0\");case\"MMM\":return h(n.monthsShort,a,c,3);case\"MMMM\":return h(c,a);case\"D\":return e.$D;case\"DD\":return b.s(e.$D,2,\"0\");case\"d\":return String(e.$W);case\"dd\":return h(n.weekdaysMin,e.$W,o,2);case\"ddd\":return h(n.weekdaysShort,e.$W,o,3);case\"dddd\":return o[e.$W];case\"H\":return String(s);case\"HH\":return b.s(s,2,\"0\");case\"h\":return d(1);case\"hh\":return d(2);case\"a\":return $(s,u,!0);case\"A\":return $(s,u,!1);case\"m\":return String(u);case\"mm\":return b.s(u,2,\"0\");case\"s\":return String(e.$s);case\"ss\":return b.s(e.$s,2,\"0\");case\"SSS\":return b.s(e.$ms,3,\"0\");case\"Z\":return i}return null}(t)||i.replace(\":\",\"\")}))},m.utcOffset=function(){return 15*-Math.round(this.$d.getTimezoneOffset()/15)},m.diff=function(r,d,l){var $,y=this,M=b.p(d),m=O(r),v=(m.utcOffset()-this.utcOffset())*e,g=this-m,D=function(){return b.m(y,m)};switch(M){case h:$=D()/12;break;case c:$=D();break;case f:$=D()/3;break;case o:$=(g-v)/6048e5;break;case a:$=(g-v)/864e5;break;case u:$=g/n;break;case s:$=g/e;break;case i:$=g/t;break;default:$=g}return l?$:b.a($)},m.daysInMonth=function(){return this.endOf(c).$D},m.$locale=function(){return D[this.$L]},m.locale=function(t,e){if(!t)return this.$L;var n=this.clone(),r=w(t,e,!0);return r&&(n.$L=r),n},m.clone=function(){return b.w(this.$d,this)},m.toDate=function(){return new Date(this.valueOf())},m.toJSON=function(){return this.isValid()?this.toISOString():null},m.toISOString=function(){return this.$d.toISOString()},m.toString=function(){return this.$d.toUTCString()},M}(),k=_.prototype;return O.prototype=k,[[\"$ms\",r],[\"$s\",i],[\"$m\",s],[\"$H\",u],[\"$W\",a],[\"$M\",c],[\"$y\",h],[\"$D\",d]].forEach((function(t){k[t[1]]=function(e){return this.$g(e,t[0],t[1])}})),O.extend=function(t,e){return t.$i||(t(e,_,O),t.$i=!0),O},O.locale=w,O.isDayjs=S,O.unix=function(t){return O(1e3*t)},O.en=D[g],O.Ls=D,O.p={},O}));","!function(e,t){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=t():\"function\"==typeof define&&define.amd?define(t):(e=\"undefined\"!=typeof globalThis?globalThis:e||self).dayjs_plugin_advancedFormat=t()}(this,(function(){\"use strict\";return function(e,t){var r=t.prototype,n=r.format;r.format=function(e){var t=this,r=this.$locale();if(!this.isValid())return n.bind(this)(e);var s=this.$utils(),a=(e||\"YYYY-MM-DDTHH:mm:ssZ\").replace(/\\[([^\\]]+)]|Q|wo|ww|w|WW|W|zzz|z|gggg|GGGG|Do|X|x|k{1,2}|S/g,(function(e){switch(e){case\"Q\":return Math.ceil((t.$M+1)/3);case\"Do\":return r.ordinal(t.$D);case\"gggg\":return t.weekYear();case\"GGGG\":return t.isoWeekYear();case\"wo\":return r.ordinal(t.week(),\"W\");case\"w\":case\"ww\":return s.s(t.week(),\"w\"===e?1:2,\"0\");case\"W\":case\"WW\":return s.s(t.isoWeek(),\"W\"===e?1:2,\"0\");case\"k\":case\"kk\":return s.s(String(0===t.$H?24:t.$H),\"k\"===e?1:2,\"0\");case\"X\":return Math.floor(t.$d.getTime()/1e3);case\"x\":return t.$d.getTime();case\"z\":return\"[\"+t.offsetName()+\"]\";case\"zzz\":return\"[\"+t.offsetName(\"long\")+\"]\";default:return e}}));return n.bind(this)(a)}}}));","!function(e,t){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=t():\"function\"==typeof define&&define.amd?define(t):(e=\"undefined\"!=typeof globalThis?globalThis:e||self).dayjs_plugin_isoWeek=t()}(this,(function(){\"use strict\";var e=\"day\";return function(t,i,s){var a=function(t){return t.add(4-t.isoWeekday(),e)},d=i.prototype;d.isoWeekYear=function(){return a(this).year()},d.isoWeek=function(t){if(!this.$utils().u(t))return this.add(7*(t-this.isoWeek()),e);var i,d,n,o,r=a(this),u=(i=this.isoWeekYear(),d=this.$u,n=(d?s.utc:s)().year(i).startOf(\"year\"),o=4-n.isoWeekday(),n.isoWeekday()>4&&(o+=7),n.add(o,e));return r.diff(u,\"week\")+1},d.isoWeekday=function(e){return this.$utils().u(e)?this.day()||7:this.day(this.day()%7?e:e-7)};var n=d.startOf;d.startOf=function(e,t){var i=this.$utils(),s=!!i.u(t)||t;return\"isoweek\"===i.p(e)?s?this.date(this.date()-(this.isoWeekday()-1)).startOf(\"day\"):this.date(this.date()-1-(this.isoWeekday()-1)+7).endOf(\"day\"):n.bind(this)(e,t)}}}));","!function(r,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=e():\"function\"==typeof define&&define.amd?define(e):(r=\"undefined\"!=typeof globalThis?globalThis:r||self).dayjs_plugin_relativeTime=e()}(this,(function(){\"use strict\";return function(r,e,t){r=r||{};var n=e.prototype,o={future:\"in %s\",past:\"%s ago\",s:\"a few seconds\",m:\"a minute\",mm:\"%d minutes\",h:\"an hour\",hh:\"%d hours\",d:\"a day\",dd:\"%d days\",M:\"a month\",MM:\"%d months\",y:\"a year\",yy:\"%d years\"};function i(r,e,t,o){return n.fromToBase(r,e,t,o)}t.en.relativeTime=o,n.fromToBase=function(e,n,i,d,u){for(var f,a,s,l=i.$locale().relativeTime||o,h=r.thresholds||[{l:\"s\",r:44,d:\"second\"},{l:\"m\",r:89},{l:\"mm\",r:44,d:\"minute\"},{l:\"h\",r:89},{l:\"hh\",r:21,d:\"hour\"},{l:\"d\",r:35},{l:\"dd\",r:25,d:\"day\"},{l:\"M\",r:45},{l:\"MM\",r:10,d:\"month\"},{l:\"y\",r:17},{l:\"yy\",d:\"year\"}],m=h.length,c=0;c<m;c+=1){var y=h[c];y.d&&(f=d?t(e).diff(i,y.d,!0):i.diff(e,y.d,!0));var p=(r.rounding||Math.round)(Math.abs(f));if(s=f>0,p<=y.r||!y.r){p<=1&&c>0&&(y=h[c-1]);var v=l[y.l];u&&(p=u(\"\"+p)),a=\"string\"==typeof v?v.replace(\"%d\",p):v(p,n,y.l,s);break}}if(n)return a;var M=s?l.future:l.past;return\"function\"==typeof M?M(a):M.replace(\"%s\",a)},n.to=function(r,e){return i(r,e,this,!0)},n.from=function(r,e){return i(r,e,this)};var d=function(r){return r.$u?t.utc():t()};n.toNow=function(r){return this.to(d(this),r)},n.fromNow=function(r){return this.from(d(this),r)}}}));","!function(t,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=e():\"function\"==typeof define&&define.amd?define(e):(t=\"undefined\"!=typeof globalThis?globalThis:t||self).dayjs_plugin_timezone=e()}(this,(function(){\"use strict\";var t={year:0,month:1,day:2,hour:3,minute:4,second:5},e={};return function(n,i,o){var r,a=function(t,n,i){void 0===i&&(i={});var o=new Date(t),r=function(t,n){void 0===n&&(n={});var i=n.timeZoneName||\"short\",o=t+\"|\"+i,r=e[o];return r||(r=new Intl.DateTimeFormat(\"en-US\",{hour12:!1,timeZone:t,year:\"numeric\",month:\"2-digit\",day:\"2-digit\",hour:\"2-digit\",minute:\"2-digit\",second:\"2-digit\",timeZoneName:i}),e[o]=r),r}(n,i);return r.formatToParts(o)},u=function(e,n){for(var i=a(e,n),r=[],u=0;u<i.length;u+=1){var f=i[u],s=f.type,m=f.value,c=t[s];c>=0&&(r[c]=parseInt(m,10))}var d=r[3],l=24===d?0:d,h=r[0]+\"-\"+r[1]+\"-\"+r[2]+\" \"+l+\":\"+r[4]+\":\"+r[5]+\":000\",v=+e;return(o.utc(h).valueOf()-(v-=v%1e3))/6e4},f=i.prototype;f.tz=function(t,e){void 0===t&&(t=r);var n=this.utcOffset(),i=this.toDate(),a=i.toLocaleString(\"en-US\",{timeZone:t}),u=Math.round((i-new Date(a))/1e3/60),f=o(a,{locale:this.$L}).$set(\"millisecond\",this.$ms).utcOffset(15*-Math.round(i.getTimezoneOffset()/15)-u,!0);if(e){var s=f.utcOffset();f=f.add(n-s,\"minute\")}return f.$x.$timezone=t,f},f.offsetName=function(t){var e=this.$x.$timezone||o.tz.guess(),n=a(this.valueOf(),e,{timeZoneName:t}).find((function(t){return\"timezonename\"===t.type.toLowerCase()}));return n&&n.value};var s=f.startOf;f.startOf=function(t,e){if(!this.$x||!this.$x.$timezone)return s.call(this,t,e);var n=o(this.format(\"YYYY-MM-DD HH:mm:ss:SSS\"),{locale:this.$L});return s.call(n,t,e).tz(this.$x.$timezone,!0)},o.tz=function(t,e,n){var i=n&&e,a=n||e||r,f=u(+o(),a);if(\"string\"!=typeof t)return o(t).tz(a);var s=function(t,e,n){var i=t-60*e*1e3,o=u(i,n);if(e===o)return[i,e];var r=u(i-=60*(o-e)*1e3,n);return o===r?[i,o]:[t-60*Math.min(o,r)*1e3,Math.max(o,r)]}(o.utc(t,i).valueOf(),f,a),m=s[0],c=s[1],d=o(m).utcOffset(c);return d.$x.$timezone=a,d},o.tz.guess=function(){return Intl.DateTimeFormat().resolvedOptions().timeZone},o.tz.setDefault=function(t){r=t}}}));","!function(t,i){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=i():\"function\"==typeof define&&define.amd?define(i):(t=\"undefined\"!=typeof globalThis?globalThis:t||self).dayjs_plugin_utc=i()}(this,(function(){\"use strict\";var t=\"minute\",i=/[+-]\\d\\d(?::?\\d\\d)?/g,e=/([+-]|\\d\\d)/g;return function(s,f,n){var u=f.prototype;n.utc=function(t){var i={date:t,utc:!0,args:arguments};return new f(i)},u.utc=function(i){var e=n(this.toDate(),{locale:this.$L,utc:!0});return i?e.add(this.utcOffset(),t):e},u.local=function(){return n(this.toDate(),{locale:this.$L,utc:!1})};var o=u.parse;u.parse=function(t){t.utc&&(this.$u=!0),this.$utils().u(t.$offset)||(this.$offset=t.$offset),o.call(this,t)};var r=u.init;u.init=function(){if(this.$u){var t=this.$d;this.$y=t.getUTCFullYear(),this.$M=t.getUTCMonth(),this.$D=t.getUTCDate(),this.$W=t.getUTCDay(),this.$H=t.getUTCHours(),this.$m=t.getUTCMinutes(),this.$s=t.getUTCSeconds(),this.$ms=t.getUTCMilliseconds()}else r.call(this)};var a=u.utcOffset;u.utcOffset=function(s,f){var n=this.$utils().u;if(n(s))return this.$u?0:n(this.$offset)?a.call(this):this.$offset;if(\"string\"==typeof s&&(s=function(t){void 0===t&&(t=\"\");var s=t.match(i);if(!s)return null;var f=(\"\"+s[0]).match(e)||[\"-\",0,0],n=f[0],u=60*+f[1]+ +f[2];return 0===u?0:\"+\"===n?u:-u}(s),null===s))return this;var u=Math.abs(s)<=16?60*s:s,o=this;if(f)return o.$offset=u,o.$u=0===s,o;if(0!==s){var r=this.$u?this.toDate().getTimezoneOffset():-1*this.utcOffset();(o=this.local().add(u+r,t)).$offset=u,o.$x.$localOffset=r}else o=this.utc();return o};var h=u.format;u.format=function(t){var i=t||(this.$u?\"YYYY-MM-DDTHH:mm:ss[Z]\":\"\");return h.call(this,i)},u.valueOf=function(){var t=this.$utils().u(this.$offset)?0:this.$offset+(this.$x.$localOffset||this.$d.getTimezoneOffset());return this.$d.valueOf()-6e4*t},u.isUTC=function(){return!!this.$u},u.toISOString=function(){return this.toDate().toISOString()},u.toString=function(){return this.toDate().toUTCString()};var l=u.toDate;u.toDate=function(t){return\"s\"===t&&this.$offset?n(this.format(\"YYYY-MM-DD HH:mm:ss:SSS\")).toDate():l.call(this)};var c=u.diff;u.diff=function(t,i,e){if(t&&this.$u===t.$u)return c.call(this,t,i,e);var s=this.local(),f=n(t).local();return c.call(s,f,i,e)}}}));","!function(e,t){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=t():\"function\"==typeof define&&define.amd?define(t):(e=\"undefined\"!=typeof globalThis?globalThis:e||self).dayjs_plugin_weekOfYear=t()}(this,(function(){\"use strict\";var e=\"week\",t=\"year\";return function(i,n,r){var f=n.prototype;f.week=function(i){if(void 0===i&&(i=null),null!==i)return this.add(7*(i-this.week()),\"day\");var n=this.$locale().yearStart||1;if(11===this.month()&&this.date()>25){var f=r(this).startOf(t).add(1,t).date(n),s=r(this).endOf(e);if(f.isBefore(s))return 1}var a=r(this).startOf(t).date(n).startOf(e).subtract(1,\"millisecond\"),o=this.diff(a,e,!0);return o<0?r(this).startOf(\"week\").week():Math.ceil(o)},f.weeks=function(e){return void 0===e&&(e=null),this.week(e)}}}));","!function(e,t){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=t():\"function\"==typeof define&&define.amd?define(t):(e=\"undefined\"!=typeof globalThis?globalThis:e||self).dayjs_plugin_weekday=t()}(this,(function(){\"use strict\";return function(e,t){t.prototype.weekday=function(e){var t=this.$locale().weekStart||0,i=this.$W,n=(i<t?i+7:i)-t;return this.$utils().u(e)?n:this.subtract(n,\"day\").add(e,\"day\")}}}));","// 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*\n* @author Steven Velozo <steven@velozo.com>\n*/\n\nconst libFableServiceProviderBase = require('fable-serviceproviderbase').CoreServiceProviderBase;\n\nclass BaseLogger extends libFableServiceProviderBase\n{\n\tconstructor(pLogStreamSettings, pLogStreamHash)\n\t{\n\t\tsuper(pLogStreamSettings, pLogStreamHash);\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\tthis.serviceType = 'Logging-Provider';\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*\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 Service\n*/\n\nconst libFableServiceProviderBase = require('fable-serviceproviderbase').CoreServiceProviderBase;\n\nclass FableLog extends libFableServiceProviderBase\n{\n\tconstructor(pSettings, pServiceHash)\n\t{\n\t\tsuper(pSettings, pServiceHash);\n\n\t\tthis.serviceType = 'Logging';\n\n\t\tlet tmpSettings = (typeof(pSettings) === 'object') ? pSettings : {}\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\nmodule.exports = FableLog;\nmodule.exports.LogProviderBase = require('./Fable-Log-BaseLogger.js');\nmodule.exports.LogProviderConsole = require('./Fable-Log-Logger-Console.js');\nmodule.exports.LogProviderFlatfile = require('./Fable-Log-Logger-SimpleFlatFile.js');\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* @author <steven@velozo.com>\n*/\n\nclass FableCoreServiceProviderBase\n{\n\tconstructor(pOptions, pServiceHash)\n\t{\n\t\tthis.fable = false;\n\n\t\tthis.options = (typeof(pOptions) === 'object') ? pOptions : {};\n\n\t\tthis.serviceType = 'Unknown';\n\n\t\t// The hash will be a non-standard UUID ... the UUID service uses this base class!\n\t\tthis.UUID = `CORESVC-${Math.floor((Math.random() * (99999 - 10000)) + 10000)}`;\n\n\t\tthis.Hash = (typeof(pServiceHash) === 'string') ? pServiceHash : `${this.UUID}`;\n\t}\n\n\n\tstatic isFableService = true;\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 = FableCoreServiceProviderBase;\n","/**\n* Fable Service Base\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\t\t\t\t\t\t: ((typeof(pFable) === 'object') && !pFable.isFable) ? pFable\n\t\t\t\t\t\t: {};\n\n\t\tthis.serviceType = 'Unknown';\n\n\t\tif (typeof(pFable.getUUID) == 'function')\n\t\t{\n\t\t\tthis.UUID = pFable.getUUID();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.UUID = `NoFABLESVC-${Math.floor((Math.random() * (99999 - 10000)) + 10000)}`\n\t\t}\n\n\t\tthis.Hash = (typeof(pServiceHash) === 'string') ? pServiceHash : `${this.UUID}`;\n\n\t\t// Pull back a few things\n\t\tthis.log = this.fable.log;\n\t\tthis.servicesMap = this.fable.servicesMap;\n\t\tthis.services = this.fable.services;\n\t}\n\n\tstatic isFableService = true;\n}\n\nmodule.exports = FableServiceProviderBase;\n\nmodule.exports.CoreServiceProviderBase = require('./Fable-ServiceProviderBase-Preinit.js');","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*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\nconst libPrecedent = require('precedent');\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 libPrecedent();\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\tconst tmpDefaultValue = tmpSeparatorIndex >= 0 ? 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","/**\n* Fable Settings Add-on\n*\n*\n* @author Steven Velozo <steven@velozo.com>\n* @module Fable Settings\n*/\n\nconst libFableServiceProviderBase = require('fable-serviceproviderbase').CoreServiceProviderBase;\n\nconst libFableSettingsTemplateProcessor = require('./Fable-Settings-TemplateProcessor.js');\n\nclass FableSettings extends libFableServiceProviderBase\n{\n\tconstructor(pSettings, pServiceHash)\n\t{\n\t\tsuper(pSettings, pServiceHash);\n\n\t\tthis.serviceType = 'SettingsManager';\n\n\t\t// Initialize the settings value template processor\n\t\tthis.settingsTemplateProcessor = new libFableSettingsTemplateProcessor();\n\n\t\t// set straight away so anything that uses it respects the initial setting\n\t\tthis._configureEnvTemplating(pSettings);\n\n\t\tthis.default = this.buildDefaultSettings();\n\n\t\t// Construct a new settings object\n\t\tlet tmpSettings = this.merge(pSettings, 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;","/**\n* Random Byte Generator - Browser version\n*\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\nconst libFableServiceProviderBase = require('fable-serviceproviderbase').CoreServiceProviderBase;0\n\nconst libRandomByteGenerator = require('./Fable-UUID-Random.js')\n\nclass FableUUID extends libFableServiceProviderBase\n{\n\tconstructor(pSettings, pServiceHash)\n\t{\n\t\tsuper(pSettings, pServiceHash);\n\n\t\tthis.serviceType = 'UUID';\n\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","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar slice = Array.prototype.slice;\nvar toStr = Object.prototype.toString;\nvar funcType = '[object Function]';\n\nmodule.exports = function bind(that) {\n var target = this;\n if (typeof target !== 'function' || toStr.call(target) !== funcType) {\n throw new TypeError(ERROR_MESSAGE + target);\n }\n var args = slice.call(arguments, 1);\n\n var bound;\n var binder = function () {\n if (this instanceof bound) {\n var result = target.apply(\n this,\n args.concat(slice.call(arguments))\n );\n if (Object(result) === result) {\n return result;\n }\n return this;\n } else {\n return target.apply(\n that,\n args.concat(slice.call(arguments))\n );\n }\n };\n\n var boundLength = Math.max(0, target.length - args.length);\n var boundArgs = [];\n for (var i = 0; i < boundLength; i++) {\n boundArgs.push('$' + i);\n }\n\n bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder);\n\n if (target.prototype) {\n var Empty = function Empty() {};\n Empty.prototype = target.prototype;\n bound.prototype = new Empty();\n Empty.prototype = null;\n }\n\n return bound;\n};\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","'use strict';\n\nvar undefined;\n\nvar $SyntaxError = SyntaxError;\nvar $Function = Function;\nvar $TypeError = TypeError;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = Object.getOwnPropertyDescriptor;\nif ($gOPD) {\n\ttry {\n\t\t$gOPD({}, '');\n\t} catch (e) {\n\t\t$gOPD = null; // this is IE 8, which has a broken gOPD\n\t}\n}\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = require('has-symbols')();\nvar hasProto = require('has-proto')();\n\nvar getProto = Object.getPrototypeOf || (\n\thasProto\n\t\t? function (x) { return x.__proto__; } // eslint-disable-line no-proto\n\t\t: null\n);\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' || !getProto ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols && getProto ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%BigInt64Array%': typeof BigInt64Array === 'undefined' ? undefined : BigInt64Array,\n\t'%BigUint64Array%': typeof BigUint64Array === 'undefined' ? undefined : BigUint64Array,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': EvalError,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols && getProto ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': Object,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': RangeError,\n\t'%ReferenceError%': ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols && getProto ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet\n};\n\nif (getProto) {\n\ttry {\n\t\tnull.error; // eslint-disable-line no-unused-expressions\n\t} catch (e) {\n\t\t// https://github.com/tc39/proposal-shadowrealm/pull/384#issuecomment-1364264229\n\t\tvar errorProto = getProto(getProto(e));\n\t\tINTRINSICS['%Error.prototype%'] = errorProto;\n\t}\n}\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen && getProto) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = require('function-bind');\nvar hasOwn = require('has');\nvar $concat = bind.call(Function.call, Array.prototype.concat);\nvar $spliceApply = bind.call(Function.apply, Array.prototype.splice);\nvar $replace = bind.call(Function.call, String.prototype.replace);\nvar $strSlice = bind.call(Function.call, String.prototype.slice);\nvar $exec = bind.call(Function.call, RegExp.prototype.exec);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tif ($exec(/^%?[^%]*%?$/, name) === null) {\n\t\tthrow new $SyntaxError('`%` may not be present anywhere but at the beginning and end of the intrinsic name');\n\t}\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n","'use strict';\n\nvar test = {\n\tfoo: {}\n};\n\nvar $Object = Object;\n\nmodule.exports = function hasProto() {\n\treturn { __proto__: test }.foo === test.foo && !({ __proto__: null } instanceof $Object);\n};\n","'use strict';\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = require('./shams');\n\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n","'use strict';\n\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (sym in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\tvar descriptor = Object.getOwnPropertyDescriptor(obj, sym);\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n","'use strict';\n\nvar bind = require('function-bind');\n\nmodule.exports = bind.call(Function.call, Object.prototype.hasOwnProperty);\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","// When a boxed property is passed in, it should have quotes of some\n// kind around it.\n//\n// For instance:\n// \t\tMyValues['Name']\n// \t\tMyValues[\"Age\"]\n// \t\tMyValues[`Cost`]\n//\n// This function removes the wrapping quotes.\n//\n// Please note it *DOES NOT PARSE* template literals, so backticks just\n// end up doing the same thing as other quote types.\n//\n// TODO: Should template literals be processed? If so what state do they have access to? That should happen here if so.\n// TODO: Make a simple class include library with these\nconst cleanWrapCharacters = (pCharacter, pString) =>\n{\n\tif (pString.startsWith(pCharacter) && pString.endsWith(pCharacter))\n\t{\n\t\treturn pString.substring(1, pString.length - 1);\n\t}\n\telse\n\t{\n\t\treturn pString;\n\t}\n};\n\nmodule.exports = cleanWrapCharacters;","/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\n\n/**\n* Hash Translation\n*\n* This is a very simple translation table for hashes, which allows the same schema to resolve\n* differently based on a loaded translation table.\n*\n* This is to prevent the requirement for mutating schemas over and over again when we want to\n* reuse the structure but look up data elements by different addresses.\n*\n* One side-effect of this is that a translation table can \"override\" the built-in hashes, since\n* this is always used to resolve hashes before any of the functionCallByHash(pHash, ...) perform\n* their lookups by hash.\n*\n* @class ManyfestHashTranslation\n*/\nclass ManyfestHashTranslation\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) === 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) === 'function') ? pErrorLog : libSimpleLog;\n\n this.translationTable = {};\n\t}\n\n translationCount()\n {\n return Object.keys(this.translationTable).length;\n }\n\n addTranslation(pTranslation)\n {\n // This adds a translation in the form of:\n // { \"SourceHash\": \"DestinationHash\", \"SecondSourceHash\":\"SecondDestinationHash\" }\n if (typeof(pTranslation) != 'object')\n {\n this.logError(`Hash translation addTranslation expected a translation be type object but was passed in ${typeof(pTranslation)}`);\n return false;\n }\n\n let tmpTranslationSources = Object.keys(pTranslation)\n\n tmpTranslationSources.forEach(\n (pTranslationSource) =>\n {\n if (typeof(pTranslation[pTranslationSource]) != 'string')\n {\n this.logError(`Hash translation addTranslation expected a translation destination hash for [${pTranslationSource}] to be a string but the referrant was a ${typeof(pTranslation[pTranslationSource])}`);\n }\n else\n {\n this.translationTable[pTranslationSource] = pTranslation[pTranslationSource];\n }\n });\n }\n\n removeTranslationHash(pTranslationHash)\n {\n if (this.translationTable.hasOwnProperty(pTranslationHash))\n {\n delete this.translationTable[pTranslationHash];\n }\n }\n\n // This removes translations.\n // If passed a string, just removes the single one.\n // If passed an object, it does all the source keys.\n removeTranslation(pTranslation)\n {\n if (typeof(pTranslation) == 'string')\n {\n this.removeTranslationHash(pTranslation);\n return true;\n }\n else if (typeof(pTranslation) == 'object')\n {\n let tmpTranslationSources = Object.keys(pTranslation)\n\n tmpTranslationSources.forEach(\n (pTranslationSource) =>\n {\n this.removeTranslation(pTranslationSource);\n });\n return true;\n }\n else\n {\n this.logError(`Hash translation removeTranslation expected either a string or an object but the passed-in translation was type ${typeof(pTranslation)}`);\n return false;\n }\n }\n\n clearTranslations()\n {\n this.translationTable = {};\n }\n\n translate(pTranslation)\n {\n if (this.translationTable.hasOwnProperty(pTranslation))\n {\n return this.translationTable[pTranslation];\n }\n else\n {\n return pTranslation;\n }\n }\n}\n\nmodule.exports = ManyfestHashTranslation;","/**\n* @author <steven@velozo.com>\n*/\n\n/**\n* Manyfest simple logging shim (for browser and dependency-free running)\n*/\n\nconst logToConsole = (pLogLine, pLogObject) =>\n{\n let tmpLogLine = (typeof(pLogLine) === 'string') ? pLogLine : '';\n\n console.log(`[Manyfest] ${tmpLogLine}`);\n\n if (pLogObject) console.log(JSON.stringify(pLogObject));\n};\n\nmodule.exports = logToConsole;","/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\n\n/**\n* Object Address Resolver\n*\n* IMPORTANT NOTE: This code is intentionally more verbose than necessary, to\n* be extremely clear what is going on in the recursion for\n* each of the three address resolution functions.\n*\n* Although there is some opportunity to repeat ourselves a\n* bit less in this codebase (e.g. with detection of arrays\n* versus objects versus direct properties), it can make\n* debugging.. challenging. The minified version of the code\n* optimizes out almost anything repeated in here. So please\n* be kind and rewind... meaning please keep the codebase less\n* terse and more verbose so humans can comprehend it.\n*\n*\n* @class ManyfestObjectAddressResolverCheckAddressExists\n*/\nclass ManyfestObjectAddressResolverCheckAddressExists\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) == 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;\n\t}\n\n\t// Check if an address exists.\n\t//\n\t// This is necessary because the getValueAtAddress function is ambiguous on\n\t// whether the element/property is actually there or not (it returns\n\t// undefined whether the property exists or not). This function checks for\n\t// existance and returns true or false dependent.\n\tcheckAddressExists (pObject, pAddress)\n\t{\n\t\t// TODO: Should these throw an error?\n\t\t// Make sure pObject is an object\n\t\tif (typeof(pObject) != 'object') return false;\n\t\t// Make sure pAddress is a string\n\t\tif (typeof(pAddress) != 'string') return false;\n\n\t\t// TODO: Make this work for things like SomeRootObject.Metadata[\"Some.People.Use.Bad.Object.Property.Names\"]\n\t\tlet tmpSeparatorIndex = pAddress.indexOf('.');\n\n\t\t// This is the terminal address string (no more dots so the RECUSION ENDS IN HERE somehow)\n\t\tif (tmpSeparatorIndex == -1)\n\t\t{\n\t\t\t// Check if the address refers to a boxed property\n\t\t\tlet tmpBracketStartIndex = pAddress.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = pAddress.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[10]\n\t\t\t// \t\tMyValues['Name']\n\t\t\t// \t\tMyValues[\"Age\"]\n\t\t\t// \t\tMyValues[`Cost`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\t// The \"Name\" of the Object contained too the left of the bracket\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\t// If the subproperty doesn't test as a proper Object, none of the rest of this is possible.\n\t\t\t\t// This is a rare case where Arrays testing as Objects is useful\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) !== 'object')\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// The \"Reference\" to the property within it, either an array element or object property\n\t\t\t\tlet tmpBoxedPropertyReference = pAddress.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\t\t\t\t// Attempt to parse the reference as a number, which will be used as an array element\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to treat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynamic object property.\n\t\t\t\t\t// We would expect the property to be wrapped in some kind of quotes so strip them\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Check if the property exists.\n\t\t\t\t\treturn pObject[tmpBoxedPropertyName].hasOwnProperty(tmpBoxedPropertyReference);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// Use the new in operator to see if the element is in the array\n\t\t\t\t\treturn (tmpBoxedPropertyNumber in pObject[tmpBoxedPropertyName]);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Check if the property exists\n\t\t\t\treturn pObject.hasOwnProperty(pAddress);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlet tmpSubObjectName = pAddress.substring(0, tmpSeparatorIndex);\n\t\t\tlet tmpNewAddress = pAddress.substring(tmpSeparatorIndex+1);\n\n\t\t\t// Test if the tmpNewAddress is an array or object\n\t\t\t// Check if it's a boxed property\n\t\t\tlet tmpBracketStartIndex = tmpSubObjectName.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = tmpSubObjectName.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[42]\n\t\t\t// \t\tMyValues['Color']\n\t\t\t// \t\tMyValues[\"Weight\"]\n\t\t\t// \t\tMyValues[`Diameter`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = tmpSubObjectName.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyReference = tmpSubObjectName.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[1].Tardy\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an object, so the [1].Tardy is not possible to access\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[\"JaneDoe\"].Grade\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an array, so the [\"JaneDoe\"].Grade is not possible to access\n\t\t\t\t// TODO: Should this be an error or something? Should we keep a log of failures like this?\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// Because this is an impossible address, the property doesn't exist\n\t\t\t\t\t// TODO: Should we throw an error in this condition?\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t//This is a bracketed value\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to reat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynanmic object property.\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Recurse directly into the subobject\n\t\t\t\t\treturn this.checkAddressExists(pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference], tmpNewAddress);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// We parsed a valid number out of the boxed property name, so recurse into the array\n\t\t\t\t\treturn this.checkAddressExists(pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber], tmpNewAddress);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// If there is an object property already named for the sub object, but it isn't an object\n\t\t\t// then the system can't set the value in there. Error and abort!\n\t\t\tif (pObject.hasOwnProperty(tmpSubObjectName) && typeof(pObject[tmpSubObjectName]) !== 'object')\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\telse if (pObject.hasOwnProperty(tmpSubObjectName))\n\t\t\t{\n\t\t\t\t// If there is already a subobject pass that to the recursive thingy\n\t\t\t\treturn this.checkAddressExists(pObject[tmpSubObjectName], tmpNewAddress);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Create a subobject and then pass that\n\t\t\t\tpObject[tmpSubObjectName] = {};\n\t\t\t\treturn this.checkAddressExists(pObject[tmpSubObjectName], tmpNewAddress);\n\t\t\t}\n\t\t}\n\t}\n};\n\nmodule.exports = ManyfestObjectAddressResolverCheckAddressExists;","/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\nlet fCleanWrapCharacters = require('./Manyfest-CleanWrapCharacters.js');\nlet fParseConditionals = require(`../source/Manyfest-ParseConditionals.js`)\n\n/**\n* Object Address Resolver - DeleteValue\n*\n* IMPORTANT NOTE: This code is intentionally more verbose than necessary, to\n* be extremely clear what is going on in the recursion for\n* each of the three address resolution functions.\n*\n* Although there is some opportunity to repeat ourselves a\n* bit less in this codebase (e.g. with detection of arrays\n* versus objects versus direct properties), it can make\n* debugging.. challenging. The minified version of the code\n* optimizes out almost anything repeated in here. So please\n* be kind and rewind... meaning please keep the codebase less\n* terse and more verbose so humans can comprehend it.\n*\n* TODO: Once we validate this pattern is good to go, break these out into\n* three separate modules.\n*\n* @class ManyfestObjectAddressResolverDeleteValue\n*/\nclass ManyfestObjectAddressResolverDeleteValue\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) == 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;\n\n\t\tthis.cleanWrapCharacters = fCleanWrapCharacters;\n\t}\n\n\t// TODO: Dry me\n\tcheckFilters(pAddress, pRecord)\n\t{\n\t\treturn fParseConditionals(this, pAddress, pRecord);\n\t}\n\n\t// Delete the value of an element at an address\n\tdeleteValueAtAddress (pObject, pAddress, pParentAddress)\n\t{\n\t\t// Make sure pObject (the object we are meant to be recursing) is an object (which could be an array or object)\n\t\tif (typeof(pObject) != 'object') return undefined;\n\t\t// Make sure pAddress (the address we are resolving) is a string\n\t\tif (typeof(pAddress) != 'string') return undefined;\n\t\t// Stash the parent address for later resolution\n\t\tlet tmpParentAddress = \"\";\n\t\tif (typeof(pParentAddress) == 'string')\n\t\t{\n\t\t\ttmpParentAddress = pParentAddress;\n\t\t}\n\n\t\t// TODO: Make this work for things like SomeRootObject.Metadata[\"Some.People.Use.Bad.Object.Property.Names\"]\n\t\tlet tmpSeparatorIndex = pAddress.indexOf('.');\n\n\t\t// This is the terminal address string (no more dots so the RECUSION ENDS IN HERE somehow)\n\t\tif (tmpSeparatorIndex == -1)\n\t\t{\n\t\t\t// Check if the address refers to a boxed property\n\t\t\tlet tmpBracketStartIndex = pAddress.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = pAddress.indexOf(']');\n\n\t\t\t// Check for the Object Set Type marker.\n\t\t\t// Note this will not work with a bracket in the same address box set\n\t\t\tlet tmpObjectTypeMarkerIndex = pAddress.indexOf('{}');\n\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[10]\n\t\t\t// \t\tMyValues['Name']\n\t\t\t// \t\tMyValues[\"Age\"]\n\t\t\t// \t\tMyValues[`Cost`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\t// The \"Name\" of the Object contained too the left of the bracket\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\t// If the subproperty doesn't test as a proper Object, none of the rest of this is possible.\n\t\t\t\t// This is a rare case where Arrays testing as Objects is useful\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) !== 'object')\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// The \"Reference\" to the property within it, either an array element or object property\n\t\t\t\tlet tmpBoxedPropertyReference = pAddress.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\t\t\t\t// Attempt to parse the reference as a number, which will be used as an array element\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to treat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynamic object property.\n\t\t\t\t\t// We would expect the property to be wrapped in some kind of quotes so strip them\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Return the value in the property\n\t\t\t\t\tdelete pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference];\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tdelete pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber];\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// The requirements to detect a boxed set element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\telse if ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket is after the start bracket\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is nothing in the brackets\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex == 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tif (!Array.isArray(pObject[tmpBoxedPropertyName]))\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tlet tmpInputArray = pObject[tmpBoxedPropertyName];\n\t\t\t\t// Count from the end to the beginning so splice doesn't %&%#$ up the array\n\t\t\t\tfor (let i = tmpInputArray.length - 1; i >= 0; i--)\n\t\t\t\t{\n\t\t\t\t\t// The filtering is complex but allows config-based metaprogramming directly from schema\n\t\t\t\t\tlet tmpKeepRecord = this.checkFilters(pAddress, tmpInputArray[i]);\n\t\t\t\t\tif (tmpKeepRecord)\n\t\t\t\t\t{\n\t\t\t\t\t\t// Delete elements end to beginning\n\t\t\t\t\t\ttmpInputArray.splice(i, 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t// The object has been flagged as an object set, so treat it as such\n\t\t\telse if (tmpObjectTypeMarkerIndex > 0)\n\t\t\t{\n\t\t\t\tlet tmpObjectPropertyName = pAddress.substring(0, tmpObjectTypeMarkerIndex).trim();\n\n\t\t\t\tif (typeof(pObject[tmpObjectPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tdelete pObject[tmpObjectPropertyName];\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Now is the point in recursion to return the value in the address\n\t\t\t\tdelete pObject[pAddress];\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlet tmpSubObjectName = pAddress.substring(0, tmpSeparatorIndex);\n\t\t\tlet tmpNewAddress = pAddress.substring(tmpSeparatorIndex+1);\n\n\t\t\t// BOXED ELEMENTS\n\t\t\t// Test if the tmpNewAddress is an array or object\n\t\t\t// Check if it's a boxed property\n\t\t\tlet tmpBracketStartIndex = tmpSubObjectName.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = tmpSubObjectName.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[42]\n\t\t\t// \t\tMyValues['Color']\n\t\t\t// \t\tMyValues[\"Weight\"]\n\t\t\t// \t\tMyValues[`Diameter`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = tmpSubObjectName.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyReference = tmpSubObjectName.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[1].Tardy\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an object, so the [1].Tardy is not possible to access\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[\"JaneDoe\"].Grade\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an array, so the [\"JaneDoe\"].Grade is not possible to access\n\t\t\t\t// TODO: Should this be an error or something? Should we keep a log of failures like this?\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\t// Check if the boxed property is an object.\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\n\t\t\t\t//This is a bracketed value\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to reat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynanmic object property.\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\t\t// Recurse directly into the subobject\n\t\t\t\t\treturn this.deleteValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference], tmpNewAddress, tmpParentAddress);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\t\t// We parsed a valid number out of the boxed property name, so recurse into the array\n\t\t\t\t\treturn this.deleteValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber], tmpNewAddress, tmpParentAddress);\n\t\t\t\t}\n\t\t\t}\n\t\t\t// The requirements to detect a boxed set element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\telse if ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket is after the start bracket\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is nothing in the brackets\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex == 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tif (!Array.isArray(pObject[tmpBoxedPropertyName]))\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// We need to enumerate the array and grab the addresses from there.\n\t\t\t\tlet tmpArrayProperty = pObject[tmpBoxedPropertyName];\n\t\t\t\t// Managing the parent address is a bit more complex here -- the box will be added for each element.\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpBoxedPropertyName}`;\n\t\t\t\t// The container object is where we have the \"Address\":SOMEVALUE pairs\n\t\t\t\tlet tmpContainerObject = {};\n\t\t\t\tfor (let i = 0; i < tmpArrayProperty.length; i++)\n\t\t\t\t{\n\t\t\t\t\tlet tmpPropertyParentAddress = `${tmpParentAddress}[${i}]`;\n\t\t\t\t\tlet tmpValue = this.deleteValueAtAddress(pObject[tmpBoxedPropertyName][i], tmpNewAddress, tmpPropertyParentAddress);\n\n\t\t\t\t\ttmpContainerObject[`${tmpPropertyParentAddress}.${tmpNewAddress}`] = tmpValue;\n\t\t\t\t}\n\n\t\t\t\treturn tmpContainerObject;\n\t\t\t}\n\n\t\t\t// OBJECT SET\n\t\t\t// Note this will not work with a bracket in the same address box set\n\t\t\tlet tmpObjectTypeMarkerIndex = pAddress.indexOf('{}');\n\t\t\tif (tmpObjectTypeMarkerIndex > 0)\n\t\t\t{\n\t\t\t\tlet tmpObjectPropertyName = pAddress.substring(0, tmpObjectTypeMarkerIndex).trim();\n\n\t\t\t\tif (typeof(pObject[tmpObjectPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// We need to enumerate the Object and grab the addresses from there.\n\t\t\t\tlet tmpObjectProperty = pObject[tmpObjectPropertyName];\n\t\t\t\tlet tmpObjectPropertyKeys = Object.keys(tmpObjectProperty);\n\t\t\t\t// Managing the parent address is a bit more complex here -- the box will be added for each element.\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpObjectPropertyName}`;\n\t\t\t\t// The container object is where we have the \"Address\":SOMEVALUE pairs\n\t\t\t\tlet tmpContainerObject = {};\n\t\t\t\tfor (let i = 0; i < tmpObjectPropertyKeys.length; i++)\n\t\t\t\t{\n\t\t\t\t\tlet tmpPropertyParentAddress = `${tmpParentAddress}.${tmpObjectPropertyKeys[i]}`;\n\t\t\t\t\tlet tmpValue = this.deleteValueAtAddress(pObject[tmpObjectPropertyName][tmpObjectPropertyKeys[i]], tmpNewAddress, tmpPropertyParentAddress);\n\n\t\t\t\t\t// The filtering is complex but allows config-based metaprogramming directly from schema\n\t\t\t\t\tlet tmpKeepRecord = this.checkFilters(pAddress, tmpValue);\n\t\t\t\t\tif (tmpKeepRecord)\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpContainerObject[`${tmpPropertyParentAddress}.${tmpNewAddress}`] = tmpValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn tmpContainerObject;\n\t\t\t}\n\n\t\t\t// If there is an object property already named for the sub object, but it isn't an object\n\t\t\t// then the system can't set the value in there. Error and abort!\n\t\t\tif (pObject.hasOwnProperty(tmpSubObjectName) && typeof(pObject[tmpSubObjectName]) !== 'object')\n\t\t\t{\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t\telse if (pObject.hasOwnProperty(tmpSubObjectName))\n\t\t\t{\n\t\t\t\t// If there is already a subobject pass that to the recursive thingy\n\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\treturn this.deleteValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Create a subobject and then pass that\n\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\tpObject[tmpSubObjectName] = {};\n\t\t\t\treturn this.deleteValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress);\n\t\t\t}\n\t\t}\n\t}\n};\n\nmodule.exports = ManyfestObjectAddressResolverDeleteValue;","/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\nlet fCleanWrapCharacters = require('./Manyfest-CleanWrapCharacters.js');\nlet fParseConditionals = require(`../source/Manyfest-ParseConditionals.js`)\n\n/**\n* Object Address Resolver - GetValue\n*\n* IMPORTANT NOTE: This code is intentionally more verbose than necessary, to\n* be extremely clear what is going on in the recursion for\n* each of the three address resolution functions.\n*\n* Although there is some opportunity to repeat ourselves a\n* bit less in this codebase (e.g. with detection of arrays\n* versus objects versus direct properties), it can make\n* debugging.. challenging. The minified version of the code\n* optimizes out almost anything repeated in here. So please\n* be kind and rewind... meaning please keep the codebase less\n* terse and more verbose so humans can comprehend it.\n*\n* TODO: Once we validate this pattern is good to go, break these out into\n* three separate modules.\n*\n* @class ManyfestObjectAddressResolverGetValue\n*/\nclass ManyfestObjectAddressResolverGetValue\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) == 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;\n\n\t\tthis.cleanWrapCharacters = fCleanWrapCharacters;\n\t}\n\n\tcheckFilters(pAddress, pRecord)\n\t{\n\t\treturn fParseConditionals(this, pAddress, pRecord);\n\t}\n\n\t// Get the value of an element at an address\n\tgetValueAtAddress (pObject, pAddress, pParentAddress, pRootObject)\n\t{\n\t\t// Make sure pObject (the object we are meant to be recursing) is an object (which could be an array or object)\n\t\tif (typeof(pObject) != 'object') return undefined;\n\t\t// Make sure pAddress (the address we are resolving) is a string\n\t\tif (typeof(pAddress) != 'string') return undefined;\n\t\t// Stash the parent address for later resolution\n\t\tlet tmpParentAddress = \"\";\n\t\tif (typeof(pParentAddress) == 'string')\n\t\t{\n\t\t\ttmpParentAddress = pParentAddress;\n\t\t}\n\n\t\t// Set the root object to the passed-in object if it isn't set yet. This is expected to be the root object.\n\t\tlet tmpRootObject = (typeof(pRootObject) == 'undefined') ? pObject : pRootObject;\n\n\t\t// TODO: Make this work for things like SomeRootObject.Metadata[\"Some.People.Use.Bad.Object.Property.Names\"]\n\t\tlet tmpSeparatorIndex = pAddress.indexOf('.');\n\n\t\t// Adding simple back-navigation in objects\n\t\tif (tmpSeparatorIndex == 0)\n\t\t{\n\t\t\t// Given an address of \"Bundle.Contract.IDContract...Project.IDProject\" the ... would be interpreted as two back-navigations from IDContract.\n\t\t\t// When the address is passed in, though, the first . is already eliminated. So we can count the dots.\n\t\t\tlet tmpParentAddressParts = tmpParentAddress.split('.');\n\n\t\t\tlet tmpBackNavigationCount = 0;\n\n\t\t\t// Count the number of dots\n\t\t\tfor (let i = 0; i < pAddress.length; i++)\n\t\t\t{\n\t\t\t\tif (pAddress.charAt(i) != '.')\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\ttmpBackNavigationCount++;\n\t\t\t}\n\n\t\t\tlet tmpParentAddressLength = tmpParentAddressParts.length - tmpBackNavigationCount;\n\n\t\t\tif (tmpParentAddressLength < 0)\n\t\t\t{\n\t\t\t\t// We are trying to back navigate more than we can.\n\t\t\t\t// TODO: Should this be undefined or should we bank out at the bottom and try to go forward?\n\t\t\t\t// This seems safest for now.\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// We are trying to back navigate to a parent object.\n\t\t\t\t// Recurse with the back-propagated parent address, and, the new address without the back-navigation dots.\n\t\t\t\tlet tmpRecurseAddress = pAddress.slice(tmpBackNavigationCount);\n\t\t\t\tif (tmpParentAddressLength > 0)\n\t\t\t\t{\n\t\t\t\t\ttmpRecurseAddress = `${tmpParentAddressParts.slice(0, tmpParentAddressLength).join('.')}.${tmpRecurseAddress}`;\n\t\t\t\t}\n\t\t\t\tthis.logInfo(`Back-navigation detected. Recursing back to address [${tmpRecurseAddress}]`);\n\t\t\t\treturn this.getValueAtAddress(tmpRootObject, tmpRecurseAddress);\n\t\t\t}\n\t\t}\n\n\t\t// This is the terminal address string (no more dots so the RECUSION ENDS IN HERE somehow)\n\t\tif (tmpSeparatorIndex == -1)\n\t\t{\n\t\t\t// Check if the address refers to a boxed property\n\t\t\tlet tmpBracketStartIndex = pAddress.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = pAddress.indexOf(']');\n\n\t\t\t// Check for the Object Set Type marker.\n\t\t\t// Note this will not work with a bracket in the same address box set\n\t\t\tlet tmpObjectTypeMarkerIndex = pAddress.indexOf('{}');\n\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[10]\n\t\t\t// \t\tMyValues['Name']\n\t\t\t// \t\tMyValues[\"Age\"]\n\t\t\t// \t\tMyValues[`Cost`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\t// The \"Name\" of the Object contained too the left of the bracket\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\t// If the subproperty doesn't test as a proper Object, none of the rest of this is possible.\n\t\t\t\t// This is a rare case where Arrays testing as Objects is useful\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) !== 'object')\n\t\t\t\t{\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\n\t\t\t\t// The \"Reference\" to the property within it, either an array element or object property\n\t\t\t\tlet tmpBoxedPropertyReference = pAddress.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\t\t\t\t// Attempt to parse the reference as a number, which will be used as an array element\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to treat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynamic object property.\n\t\t\t\t\t// We would expect the property to be wrapped in some kind of quotes so strip them\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Return the value in the property\n\t\t\t\t\treturn pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\treturn pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber];\n\t\t\t\t}\n\t\t\t}\n\t\t\t// The requirements to detect a boxed set element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\telse if ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket is after the start bracket\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is nothing in the brackets\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex == 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tif (!Array.isArray(pObject[tmpBoxedPropertyName]))\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tlet tmpInputArray = pObject[tmpBoxedPropertyName];\n\t\t\t\tlet tmpOutputArray = [];\n\t\t\t\tfor (let i = 0; i < tmpInputArray.length; i++)\n\t\t\t\t{\n\t\t\t\t\t// The filtering is complex but allows config-based metaprogramming directly from schema\n\t\t\t\t\tlet tmpKeepRecord = this.checkFilters(pAddress, tmpInputArray[i]);\n\t\t\t\t\tif (tmpKeepRecord)\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpOutputArray.push(tmpInputArray[i]);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn tmpOutputArray;\n\t\t\t}\n\t\t\t// The object has been flagged as an object set, so treat it as such\n\t\t\telse if (tmpObjectTypeMarkerIndex > 0)\n\t\t\t{\n\t\t\t\tlet tmpObjectPropertyName = pAddress.substring(0, tmpObjectTypeMarkerIndex).trim();\n\n\t\t\t\tif (typeof(pObject[tmpObjectPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\treturn pObject[tmpObjectPropertyName];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Now is the point in recursion to return the value in the address\n\t\t\t\treturn pObject[pAddress];\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlet tmpSubObjectName = pAddress.substring(0, tmpSeparatorIndex);\n\t\t\tlet tmpNewAddress = pAddress.substring(tmpSeparatorIndex+1);\n\n\t\t\t// BOXED ELEMENTS\n\t\t\t// Test if the tmpNewAddress is an array or object\n\t\t\t// Check if it's a boxed property\n\t\t\tlet tmpBracketStartIndex = tmpSubObjectName.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = tmpSubObjectName.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[42]\n\t\t\t// \t\tMyValues['Color']\n\t\t\t// \t\tMyValues[\"Weight\"]\n\t\t\t// \t\tMyValues[`Diameter`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = tmpSubObjectName.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyReference = tmpSubObjectName.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[1].Tardy\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an object, so the [1].Tardy is not possible to access\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[\"JaneDoe\"].Grade\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an array, so the [\"JaneDoe\"].Grade is not possible to access\n\t\t\t\t// TODO: Should this be an error or something? Should we keep a log of failures like this?\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\t\t\t\t// Check if the boxed property is an object.\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\n\n\t\t\t\t//This is a bracketed value\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to reat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynanmic object property.\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\t\t// Recurse directly into the subobject\n\t\t\t\t\treturn this.getValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference], tmpNewAddress, tmpParentAddress, tmpRootObject);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\t\t// We parsed a valid number out of the boxed property name, so recurse into the array\n\t\t\t\t\treturn this.getValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber], tmpNewAddress, tmpParentAddress, tmpRootObject);\n\t\t\t\t}\n\t\t\t}\n\t\t\t// The requirements to detect a boxed set element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\telse if ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket is after the start bracket\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is nothing in the brackets\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex == 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tif (!Array.isArray(pObject[tmpBoxedPropertyName]))\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// We need to enumerate the array and grab the addresses from there.\n\t\t\t\tlet tmpArrayProperty = pObject[tmpBoxedPropertyName];\n\t\t\t\t// Managing the parent address is a bit more complex here -- the box will be added for each element.\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpBoxedPropertyName}`;\n\t\t\t\t// The container object is where we have the \"Address\":SOMEVALUE pairs\n\t\t\t\tlet tmpContainerObject = {};\n\t\t\t\tfor (let i = 0; i < tmpArrayProperty.length; i++)\n\t\t\t\t{\n\t\t\t\t\tlet tmpPropertyParentAddress = `${tmpParentAddress}[${i}]`;\n\t\t\t\t\tlet tmpValue = this.getValueAtAddress(pObject[tmpBoxedPropertyName][i], tmpNewAddress, tmpPropertyParentAddress, tmpRootObject);\n\n\t\t\t\t\ttmpContainerObject[`${tmpPropertyParentAddress}.${tmpNewAddress}`] = tmpValue;\n\t\t\t\t}\n\n\t\t\t\treturn tmpContainerObject;\n\t\t\t}\n\n\t\t\t// OBJECT SET\n\t\t\t// Note this will not work with a bracket in the same address box set\n\t\t\tlet tmpObjectTypeMarkerIndex = pAddress.indexOf('{}');\n\t\t\tif (tmpObjectTypeMarkerIndex > 0)\n\t\t\t{\n\t\t\t\tlet tmpObjectPropertyName = pAddress.substring(0, tmpObjectTypeMarkerIndex).trim();\n\n\t\t\t\tif (typeof(pObject[tmpObjectPropertyName]) != 'object')\n\t\t\t\t{\n\t\t\t\t\t// We asked for a set from an array but it isnt' an array.\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// We need to enumerate the Object and grab the addresses from there.\n\t\t\t\tlet tmpObjectProperty = pObject[tmpObjectPropertyName];\n\t\t\t\tlet tmpObjectPropertyKeys = Object.keys(tmpObjectProperty);\n\t\t\t\t// Managing the parent address is a bit more complex here -- the box will be added for each element.\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpObjectPropertyName}`;\n\t\t\t\t// The container object is where we have the \"Address\":SOMEVALUE pairs\n\t\t\t\tlet tmpContainerObject = {};\n\t\t\t\tfor (let i = 0; i < tmpObjectPropertyKeys.length; i++)\n\t\t\t\t{\n\t\t\t\t\tlet tmpPropertyParentAddress = `${tmpParentAddress}.${tmpObjectPropertyKeys[i]}`;\n\t\t\t\t\tlet tmpValue = this.getValueAtAddress(pObject[tmpObjectPropertyName][tmpObjectPropertyKeys[i]], tmpNewAddress, tmpPropertyParentAddress, tmpRootObject);\n\n\t\t\t\t\t// The filtering is complex but allows config-based metaprogramming directly from schema\n\t\t\t\t\tlet tmpKeepRecord = this.checkFilters(pAddress, tmpValue);\n\t\t\t\t\tif (tmpKeepRecord)\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpContainerObject[`${tmpPropertyParentAddress}.${tmpNewAddress}`] = tmpValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn tmpContainerObject;\n\t\t\t}\n\n\t\t\t// If there is an object property already named for the sub object, but it isn't an object\n\t\t\t// then the system can't set the value in there. Error and abort!\n\t\t\tif (pObject.hasOwnProperty(tmpSubObjectName) && typeof(pObject[tmpSubObjectName]) !== 'object')\n\t\t\t{\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t\telse if (pObject.hasOwnProperty(tmpSubObjectName))\n\t\t\t{\n\t\t\t\t// If there is already a subobject pass that to the recursive thingy\n\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\treturn this.getValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress, tmpRootObject);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Create a subobject and then pass that\n\t\t\t\t// Continue to manage the parent address for recursion\n\t\t\t\ttmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;\n\t\t\t\tpObject[tmpSubObjectName] = {};\n\t\t\t\treturn this.getValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress, tmpRootObject);\n\t\t\t}\n\t\t}\n\t}\n};\n\nmodule.exports = ManyfestObjectAddressResolverGetValue;","/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\nlet fCleanWrapCharacters = require('./Manyfest-CleanWrapCharacters.js');\n\n/**\n* Object Address Resolver - SetValue\n*\n* IMPORTANT NOTE: This code is intentionally more verbose than necessary, to\n* be extremely clear what is going on in the recursion for\n* each of the three address resolution functions.\n*\n* Although there is some opportunity to repeat ourselves a\n* bit less in this codebase (e.g. with detection of arrays\n* versus objects versus direct properties), it can make\n* debugging.. challenging. The minified version of the code\n* optimizes out almost anything repeated in here. So please\n* be kind and rewind... meaning please keep the codebase less\n* terse and more verbose so humans can comprehend it.\n*\n*\n* @class ManyfestObjectAddressSetValue\n*/\nclass ManyfestObjectAddressSetValue\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) == 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;\n\n\t\tthis.cleanWrapCharacters = fCleanWrapCharacters;\n\t}\n\n\t// Set the value of an element at an address\n\tsetValueAtAddress (pObject, pAddress, pValue)\n\t{\n\t\t// Make sure pObject is an object\n\t\tif (typeof(pObject) != 'object') return false;\n\t\t// Make sure pAddress is a string\n\t\tif (typeof(pAddress) != 'string') return false;\n\n\t\tlet tmpSeparatorIndex = pAddress.indexOf('.');\n\n\t\tif (tmpSeparatorIndex == -1)\n\t\t{\n\t\t\t// Check if it's a boxed property\n\t\t\tlet tmpBracketStartIndex = pAddress.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = pAddress.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[10]\n\t\t\t// \t\tMyValues['Name']\n\t\t\t// \t\tMyValues[\"Age\"]\n\t\t\t// \t\tMyValues[`Cost`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\t// The \"Name\" of the Object contained too the left of the bracket\n\t\t\t\tlet tmpBoxedPropertyName = pAddress.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\t// If the subproperty doesn't test as a proper Object, none of the rest of this is possible.\n\t\t\t\t// This is a rare case where Arrays testing as Objects is useful\n\t\t\t\tif (typeof(pObject[tmpBoxedPropertyName]) !== 'object')\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// The \"Reference\" to the property within it, either an array element or object property\n\t\t\t\tlet tmpBoxedPropertyReference = pAddress.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\t\t\t\t// Attempt to parse the reference as a number, which will be used as an array element\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to treat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynamic object property.\n\t\t\t\t\t// We would expect the property to be wrapped in some kind of quotes so strip them\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Return the value in the property\n\t\t\t\t\tpObject[tmpBoxedPropertyName][tmpBoxedPropertyReference] = pValue;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber] = pValue;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Now is the time in recursion to set the value in the object\n\t\t\t\tpObject[pAddress] = pValue;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlet tmpSubObjectName = pAddress.substring(0, tmpSeparatorIndex);\n\t\t\tlet tmpNewAddress = pAddress.substring(tmpSeparatorIndex+1);\n\n\t\t\t// Test if the tmpNewAddress is an array or object\n\t\t\t// Check if it's a boxed property\n\t\t\tlet tmpBracketStartIndex = tmpSubObjectName.indexOf('[');\n\t\t\tlet tmpBracketStopIndex = tmpSubObjectName.indexOf(']');\n\t\t\t// Boxed elements look like this:\n\t\t\t// \t\tMyValues[42]\n\t\t\t// \t\tMyValues['Color']\n\t\t\t// \t\tMyValues[\"Weight\"]\n\t\t\t// \t\tMyValues[`Diameter`]\n\t\t\t//\n\t\t\t// When we are passed SomeObject[\"Name\"] this code below recurses as if it were SomeObject.Name\n\t\t\t// The requirements to detect a boxed element are:\n\t\t\t// 1) The start bracket is after character 0\n\t\t\tif ((tmpBracketStartIndex > 0)\n\t\t\t// 2) The end bracket has something between them\n\t\t\t\t&& (tmpBracketStopIndex > tmpBracketStartIndex)\n\t\t\t// 3) There is data\n\t\t\t\t&& (tmpBracketStopIndex - tmpBracketStartIndex > 1))\n\t\t\t{\n\t\t\t\tlet tmpBoxedPropertyName = tmpSubObjectName.substring(0, tmpBracketStartIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyReference = tmpSubObjectName.substring(tmpBracketStartIndex+1, tmpBracketStopIndex).trim();\n\n\t\t\t\tlet tmpBoxedPropertyNumber = parseInt(tmpBoxedPropertyReference, 10);\n\n\t\t\t\t// Guard: If the referrant is a number and the boxed property is not an array, or vice versa, return undefined.\n\t\t\t\t// This seems confusing to me at first read, so explaination:\n\t\t\t\t// Is the Boxed Object an Array? TRUE\n\t\t\t\t// And is the Reference inside the boxed Object not a number? TRUE\n\t\t\t\t// --> So when these are in agreement, it's an impossible access state\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[1].Tardy\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an object, so the [1].Tardy is not possible to access\n\t\t\t\t// This could be a failure in the recursion chain because they passed something like this in:\n\t\t\t\t// StudentData.Sections.Algebra.Students[\"JaneDoe\"].Grade\n\t\t\t\t// BUT\n\t\t\t\t// StudentData.Sections.Algebra.Students is an array, so the [\"JaneDoe\"].Grade is not possible to access\n\t\t\t\t// TODO: Should this be an error or something? Should we keep a log of failures like this?\n\t\t\t\tif (Array.isArray(pObject[tmpBoxedPropertyName]) == isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\t//This is a bracketed value\n\t\t\t\t// 4) If the middle part is *only* a number (no single, double or backtick quotes) it is an array element,\n\t\t\t\t// otherwise we will try to reat it as a dynamic object property.\n\t\t\t\tif (isNaN(tmpBoxedPropertyNumber))\n\t\t\t\t{\n\t\t\t\t\t// This isn't a number ... let's treat it as a dynanmic object property.\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('\"', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters('`', tmpBoxedPropertyReference);\n\t\t\t\t\ttmpBoxedPropertyReference = this.cleanWrapCharacters(\"'\", tmpBoxedPropertyReference);\n\n\t\t\t\t\t// Recurse directly into the subobject\n\t\t\t\t\treturn this.setValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference], tmpNewAddress, pValue);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// We parsed a valid number out of the boxed property name, so recurse into the array\n\t\t\t\t\treturn this.setValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber], tmpNewAddress, pValue);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// If there is an object property already named for the sub object, but it isn't an object\n\t\t\t// then the system can't set the value in there. Error and abort!\n\t\t\tif (pObject.hasOwnProperty(tmpSubObjectName) && typeof(pObject[tmpSubObjectName]) !== 'object')\n\t\t\t{\n\t\t\t\tif (!pObject.hasOwnProperty('__ERROR'))\n\t\t\t\t\tpObject['__ERROR'] = {};\n\t\t\t\t// Put it in an error object so data isn't lost\n\t\t\t\tpObject['__ERROR'][pAddress] = pValue;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\telse if (pObject.hasOwnProperty(tmpSubObjectName))\n\t\t\t{\n\t\t\t\t// If there is already a subobject pass that to the recursive thingy\n\t\t\t\treturn this.setValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, pValue);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Create a subobject and then pass that\n\t\t\t\tpObject[tmpSubObjectName] = {};\n\t\t\t\treturn this.setValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, pValue);\n\t\t\t}\n\t\t}\n\t}\n};\n\nmodule.exports = ManyfestObjectAddressSetValue;","/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\n\n/**\n* Object Address Generation\n*\n* Automagically generate addresses and properties based on a passed-in object,\n* to be used for easy creation of schemas. Meant to simplify the lives of\n* developers wanting to create schemas without typing a bunch of stuff.\n*\n* IMPORTANT NOTE: This code is intentionally more verbose than necessary, to\n* be extremely clear what is going on in the recursion for\n* each of the three address resolution functions.\n*\n* Although there is some opportunity to repeat ourselves a\n* bit less in this codebase (e.g. with detection of arrays\n* versus objects versus direct properties), it can make\n* debugging.. challenging. The minified version of the code\n* optimizes out almost anything repeated in here. So please\n* be kind and rewind... meaning please keep the codebase less\n* terse and more verbose so humans can comprehend it.\n*\n*\n* @class ManyfestObjectAddressGeneration\n*/\nclass ManyfestObjectAddressGeneration\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) == 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;\n\t}\n\n\t// generateAddressses\n\t//\n\t// This flattens an object into a set of key:value pairs for *EVERY SINGLE\n\t// POSSIBLE ADDRESS* in the object. It can get ... really insane really\n\t// quickly. This is not meant to be used directly to generate schemas, but\n\t// instead as a starting point for scripts or UIs.\n\t//\n\t// This will return a mega set of key:value pairs with all possible schema\n\t// permutations and default values (when not an object) and everything else.\n\tgenerateAddressses (pObject, pBaseAddress, pSchema)\n\t{\n\t\tlet tmpBaseAddress = (typeof(pBaseAddress) == 'string') ? pBaseAddress : '';\n\t\tlet tmpSchema = (typeof(pSchema) == 'object') ? pSchema : {};\n\n\t\tlet tmpObjectType = typeof(pObject);\n\n\t\tlet tmpSchemaObjectEntry = (\n\t\t\t{\n\t\t\t\tAddress: tmpBaseAddress,\n\t\t\t\tHash: tmpBaseAddress,\n\t\t\t\tName: tmpBaseAddress,\n\t\t\t\t// This is so scripts and UI controls can force a developer to opt-in.\n\t\t\t\tInSchema: false\n\t\t\t}\n\t\t)\n\n\t\tif ((tmpObjectType == 'object') && (pObject == null))\n\t\t{\n\t\t\ttmpObjectType = 'null';\n\t\t}\n\n\t\tswitch(tmpObjectType)\n\t\t{\n\t\t\tcase 'string':\n\t\t\t\ttmpSchemaObjectEntry.DataType = 'String';\n\t\t\t\ttmpSchemaObjectEntry.Default = pObject;\n\t\t\t\ttmpSchema[tmpBaseAddress] = tmpSchemaObjectEntry;\n\t\t\t\tbreak;\n\t\t\tcase 'number':\n\t\t\tcase 'bigint':\n\t\t\t\ttmpSchemaObjectEntry.DataType = 'Number';\n\t\t\t\ttmpSchemaObjectEntry.Default = pObject;\n\t\t\t\ttmpSchema[tmpBaseAddress] = tmpSchemaObjectEntry;\n\t\t\t\tbreak;\n\t\t\tcase 'undefined':\n\t\t\tcase 'null':\n\t\t\t\ttmpSchemaObjectEntry.DataType = 'Any';\n\t\t\t\ttmpSchemaObjectEntry.Default = pObject;\n\t\t\t\ttmpSchema[tmpBaseAddress] = tmpSchemaObjectEntry;\n\t\t\t\tbreak;\n\t\t\tcase 'object':\n\t\t\t\tif (Array.isArray(pObject))\n\t\t\t\t{\n\t\t\t\t\ttmpSchemaObjectEntry.DataType = 'Array';\n\t\t\t\t\tif (tmpBaseAddress != '')\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpSchema[tmpBaseAddress] = tmpSchemaObjectEntry;\n\t\t\t\t\t}\n\n\t\t\t\t\tfor (let i = 0; i < pObject.length; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tthis.generateAddressses(pObject[i], `${tmpBaseAddress}[${i}]`, tmpSchema);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\ttmpSchemaObjectEntry.DataType = 'Object';\n\t\t\t\t\tif (tmpBaseAddress != '')\n\t\t\t\t\t{\n\t\t\t\t\t\ttmpSchema[tmpBaseAddress] = tmpSchemaObjectEntry;\n\t\t\t\t\t\ttmpBaseAddress += '.';\n\t\t\t\t\t}\n\n\t\t\t\t\tlet tmpObjectProperties = Object.keys(pObject);\n\n\t\t\t\t\tfor (let i = 0; i < tmpObjectProperties.length; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tthis.generateAddressses(pObject[tmpObjectProperties[i]], `${tmpBaseAddress}${tmpObjectProperties[i]}`, tmpSchema);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'symbol':\n\t\t\tcase 'function':\n\t\t\t\t// Symbols and functions neither recurse nor get added to the schema\n\t\t\t\tbreak;\n\t\t}\n\n\t\treturn tmpSchema;\n\t}\n};\n\nmodule.exports = ManyfestObjectAddressGeneration;","// Given a string, parse out any conditional expressions and set whether or not to keep the record.\n//\n// For instance:\n// \t\t'files[]<<~?format,==,Thumbnail?~>>'\n// 'files[]<<~?format,==,Metadata?~>>'\n// 'files[]<<~?size,>,4000?~>>'\n//\n// The wrapping parts are the <<~? and ?~>> megabrackets.\n//\n// The function does not need to alter the string -- just check the conditionals within.\n\n// TODO: Consider making this an es6 class\n\n// Let's use indexOf since it is apparently the fastest.\nconst _ConditionalStanzaStart = '<<~?';\nconst _ConditionalStanzaStartLength = _ConditionalStanzaStart.length;\nconst _ConditionalStanzaEnd = '?~>>';\nconst _ConditionalStanzaEndLength = _ConditionalStanzaEnd.length;\n\n// Test the condition of a value in a record\nconst testCondition = (pManyfest, pRecord, pSearchAddress, pSearchComparator, pValue) =>\n{\n\tswitch(pSearchComparator)\n\t{\n\t\tcase '!=':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) != pValue);\n\t\t\tbreak;\n\t\tcase '<':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) < pValue);\n\t\t\tbreak;\n\t\tcase '>':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) > pValue);\n\t\t\tbreak;\n\t\tcase '<=':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) <= pValue);\n\t\t\tbreak;\n\t\tcase '>=':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) >= pValue);\n\t\t\tbreak;\n\t\tcase '===':\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) === pValue);\n\t\t\tbreak;\n\t\tcase '==':\n\t\tdefault:\n\t\t\treturn (pManyfest.getValueAtAddress(pRecord, pSearchAddress) == pValue);\n\t\t\tbreak;\n\t}\n};\n\nconst parseConditionals = (pManyfest, pAddress, pRecord) =>\n{\n\tlet tmpKeepRecord = true;\n\n\t/*\n\t\tAlgorithm is simple:\n\n\t\t1. Enuerate start points\n\n\t\t2. Find stop points within each start point\n\t\t3. Check the conditional\n\t*/\n\n\tlet tmpStartIndex = pAddress.indexOf(_ConditionalStanzaStart);\n\n\twhile (tmpStartIndex != -1)\n\t{\n\t\tlet tmpStopIndex = pAddress.indexOf(_ConditionalStanzaEnd, tmpStartIndex+_ConditionalStanzaStartLength);\n\n\t\tif (tmpStopIndex != -1)\n\t\t{\n\t\t\tlet tmpMagicComparisonPatternSet = pAddress.substring(tmpStartIndex+_ConditionalStanzaStartLength, tmpStopIndex).split(',');\n\n\t\t\tlet tmpSearchAddress = tmpMagicComparisonPatternSet[0];\n\t\t\tlet tmpSearchComparator = tmpMagicComparisonPatternSet[1];\n\t\t\tlet tmpSearchValue = tmpMagicComparisonPatternSet[2];\n\n\t\t\t// Process the piece\n\t\t\ttmpKeepRecord = tmpKeepRecord && testCondition(pManyfest, pRecord, tmpSearchAddress, tmpSearchComparator, tmpSearchValue);\n\t\t\ttmpStartIndex = pAddress.indexOf(_ConditionalStanzaStart, tmpStopIndex+_ConditionalStanzaEndLength);\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttmpStartIndex = -1;\n\t\t}\n\t\t\n\t}\n\n\treturn tmpKeepRecord;\n}\n\nmodule.exports = parseConditionals;","/**\n* @author <steven@velozo.com>\n*/\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\n\n/**\n* Schema Manipulation Functions\n*\n* @class ManyfestSchemaManipulation\n*/\nclass ManyfestSchemaManipulation\n{\n\tconstructor(pInfoLog, pErrorLog)\n\t{\n\t\t// Wire in logging\n\t\tthis.logInfo = (typeof(pInfoLog) === 'function') ? pInfoLog : libSimpleLog;\n\t\tthis.logError = (typeof(pErrorLog) === 'function') ? pErrorLog : libSimpleLog;\n\t}\n\n // This translates the default address mappings to something different.\n //\n // For instance you can pass in manyfest schema descriptor object:\n // \t{\n\t//\t \"Address.Of.a\": { \"Hash\": \"a\", \"Type\": \"Number\" },\n\t//\t \"Address.Of.b\": { \"Hash\": \"b\", \"Type\": \"Number\" }\n\t// }\n //\n //\n // And then an address mapping (basically a Hash->Address map)\n // {\n // \"a\": \"New.Address.Of.a\",\n // \"b\": \"New.Address.Of.b\"\n // }\n //\n // NOTE: This mutates the schema object permanently, altering the base hash.\n // If there is a collision with an existing address, it can lead to overwrites.\n // TODO: Discuss what should happen on collisions.\n\tresolveAddressMappings(pManyfestSchemaDescriptors, pAddressMapping)\n\t{\n\t\tif (typeof(pManyfestSchemaDescriptors) != 'object')\n\t\t{\n\t\t\tthis.logError(`Attempted to resolve address mapping but the descriptor was not an object.`);\n\t\t\treturn false;\n\t\t}\n\n\t\tif (typeof(pAddressMapping) != 'object')\n\t\t{\n\t\t\t// No mappings were passed in\n\t\t\treturn true;\n\t\t}\n\n\t\t// Get the arrays of both the schema definition and the hash mapping\n\t\tlet tmpManyfestAddresses = Object.keys(pManyfestSchemaDescriptors);\n\t\tlet tmpHashMapping = {};\n\t\ttmpManyfestAddresses.forEach(\n\t\t\t(pAddress) =>\n\t\t\t{\n\t\t\t\tif (pManyfestSchemaDescriptors[pAddress].hasOwnProperty('Hash'))\n\t\t\t\t{\n\t\t\t\t\ttmpHashMapping[pManyfestSchemaDescriptors[pAddress].Hash] = pAddress;\n\t\t\t\t}\n\t\t\t});\n\n\t\tlet tmpAddressMappingSet = Object.keys(pAddressMapping);\n\n\t\ttmpAddressMappingSet.forEach(\n\t\t\t(pInputAddress) =>\n\t\t\t{\n\t\t\t\tlet tmpNewDescriptorAddress = pAddressMapping[pInputAddress];\n\t\t\t\tlet tmpOldDescriptorAddress = false;\n\t\t\t\tlet tmpDescriptor = false;\n\n\t\t\t\t// See if there is a matching descriptor either by Address directly or Hash\n\t\t\t\tif (pManyfestSchemaDescriptors.hasOwnProperty(pInputAddress))\n\t\t\t\t{\n\t\t\t\t\ttmpOldDescriptorAddress = pInputAddress;\n\t\t\t\t}\n\t\t\t\telse if (tmpHashMapping.hasOwnProperty(pInputAddress))\n\t\t\t\t{\n\t\t\t\t\ttmpOldDescriptorAddress = tmpHashMapping[pInputAddress];\n\t\t\t\t}\n\n\t\t\t\t// If there was a matching descriptor in the manifest, store it in the temporary descriptor\n\t\t\t\tif (tmpOldDescriptorAddress)\n\t\t\t\t{\n\t\t\t\t\ttmpDescriptor = pManyfestSchemaDescriptors[tmpOldDescriptorAddress];\n\t\t\t\t\tdelete pManyfestSchemaDescriptors[tmpOldDescriptorAddress];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// Create a new descriptor! Map it to the input address.\n\t\t\t\t\ttmpDescriptor = { Hash:pInputAddress };\n\t\t\t\t}\n\n\t\t\t\t// Now re-add the descriptor to the manyfest schema\n\t\t\t\tpManyfestSchemaDescriptors[tmpNewDescriptorAddress] = tmpDescriptor;\n\t\t\t});\n\n\t\treturn true;\n\t}\n\n\tsafeResolveAddressMappings(pManyfestSchemaDescriptors, pAddressMapping)\n\t{\n\t\t// This returns the descriptors as a new object, safely remapping without mutating the original schema Descriptors\n\t\tlet tmpManyfestSchemaDescriptors = JSON.parse(JSON.stringify(pManyfestSchemaDescriptors));\n\t\tthis.resolveAddressMappings(tmpManyfestSchemaDescriptors, pAddressMapping);\n\t\treturn tmpManyfestSchemaDescriptors;\n\t}\n\n\tmergeAddressMappings(pManyfestSchemaDescriptorsDestination, pManyfestSchemaDescriptorsSource)\n\t{\n\t\tif ((typeof(pManyfestSchemaDescriptorsSource) != 'object') || (typeof(pManyfestSchemaDescriptorsDestination) != 'object'))\n\t\t{\n\t\t\tthis.logError(`Attempted to merge two schema descriptors but both were not objects.`);\n\t\t\treturn false;\n\t\t}\n\n\t\tlet tmpSource = JSON.parse(JSON.stringify(pManyfestSchemaDescriptorsSource));\n\t\tlet tmpNewManyfestSchemaDescriptors = JSON.parse(JSON.stringify(pManyfestSchemaDescriptorsDestination));\n\n\t\t// The first passed-in set of descriptors takes precedence.\n\t\tlet tmpDescriptorAddresses = Object.keys(tmpSource);\n\n\t\ttmpDescriptorAddresses.forEach(\n\t\t\t(pDescriptorAddress) =>\n\t\t\t{\n\t\t\t\tif (!tmpNewManyfestSchemaDescriptors.hasOwnProperty(pDescriptorAddress))\n\t\t\t\t{\n\t\t\t\t\ttmpNewManyfestSchemaDescriptors[pDescriptorAddress] = tmpSource[pDescriptorAddress];\n\t\t\t\t}\n\t\t\t});\n\n\t\treturn tmpNewManyfestSchemaDescriptors;\n\t}\n}\n\nmodule.exports = ManyfestSchemaManipulation;","/**\n* @author <steven@velozo.com>\n*/\nconst libFableServiceProviderBase = require('fable-serviceproviderbase');\n\nlet libSimpleLog = require('./Manyfest-LogToConsole.js');\n\nlet libHashTranslation = require('./Manyfest-HashTranslation.js');\nlet libObjectAddressCheckAddressExists = require('./Manyfest-ObjectAddress-CheckAddressExists.js');\nlet libObjectAddressGetValue = require('./Manyfest-ObjectAddress-GetValue.js');\nlet libObjectAddressSetValue = require('./Manyfest-ObjectAddress-SetValue.js');\nlet libObjectAddressDeleteValue = require('./Manyfest-ObjectAddress-DeleteValue.js');\nlet libObjectAddressGeneration = require('./Manyfest-ObjectAddressGeneration.js');\nlet libSchemaManipulation = require('./Manyfest-SchemaManipulation.js');\n\nconst _DefaultConfiguration = { Scope:'DEFAULT', Descriptors: {} }\n\n/**\n* Manyfest object address-based descriptions and manipulations.\n*\n* @class Manyfest\n*/\nclass Manyfest extends libFableServiceProviderBase\n{\n\tconstructor(pFable, pManifest, pServiceHash)\n\t{\n\t\tif (pFable === undefined)\n\t\t{\n\t\t\tsuper({});\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsuper(pFable, pManifest, pServiceHash);\n\t\t}\n\n this.serviceType = 'Manifest';\n\n\t\t// Wire in logging\n\t\tthis.logInfo = libSimpleLog;\n\t\tthis.logError = libSimpleLog;\n\n\t\t// Create an object address resolver and map in the functions\n\t\tthis.objectAddressCheckAddressExists = new libObjectAddressCheckAddressExists(this.logInfo, this.logError);\n\t\tthis.objectAddressGetValue = new libObjectAddressGetValue(this.logInfo, this.logError);\n\t\tthis.objectAddressSetValue = new libObjectAddressSetValue(this.logInfo, this.logError);\n\t\tthis.objectAddressDeleteValue = new libObjectAddressDeleteValue(this.logInfo, this.logError);\n\n\t\tif (!this.options.hasOwnProperty('defaultValues'))\n\t\t{\n\t\t\tthis.options.defaultValues = (\n\t\t\t\t{\n\t\t\t\t\t\"String\": \"\",\n\t\t\t\t\t\"Number\": 0,\n\t\t\t\t\t\"Float\": 0.0,\n\t\t\t\t\t\"Integer\": 0,\n\t\t\t\t\t\"Boolean\": false,\n\t\t\t\t\t\"Binary\": 0,\n\t\t\t\t\t\"DateTime\": 0,\n\t\t\t\t\t\"Array\": [],\n\t\t\t\t\t\"Object\": {},\n\t\t\t\t\t\"Null\": null\n\t\t\t\t});\n\t\t}\n\t\tif (!this.options.hasOwnProperty('strict'))\n\t\t{\n\t\t\tthis.options.strict = false;\n\t\t}\n\n\t\tthis.scope = undefined;\n\t\tthis.elementAddresses = undefined;\n\t\tthis.elementHashes = undefined;\n\t\tthis.elementDescriptors = undefined;\n\n\t\tthis.reset();\n\n\t\tif (typeof(this.options) === 'object')\n\t\t{\n\t\t\tthis.loadManifest(this.options);\n\t\t}\n\n\t\tthis.schemaManipulations = new libSchemaManipulation(this.logInfo, this.logError);\n\t\tthis.objectAddressGeneration = new libObjectAddressGeneration(this.logInfo, this.logError);\n\n\t\tthis.hashTranslations = new libHashTranslation(this.logInfo, this.logError);\n\t}\n\n\t/*************************************************************************\n\t * Schema Manifest Loading, Reading, Manipulation and Serialization Functions\n\t */\n\n\t// Reset critical manifest properties\n\treset()\n\t{\n\t\tthis.scope = 'DEFAULT';\n\t\tthis.elementAddresses = [];\n\t\tthis.elementHashes = {};\n\t\tthis.elementDescriptors = {};\n\t}\n\n\tclone()\n\t{\n\t\t// Make a copy of the options in-place\n\t\tlet tmpNewOptions = JSON.parse(JSON.stringify(this.options));\n\n\t\tlet tmpNewManyfest = new Manyfest(this.getManifest(), this.logInfo, this.logError, tmpNewOptions);\n\n\t\t// Import the hash translations\n\t\ttmpNewManyfest.hashTranslations.addTranslation(this.hashTranslations.translationTable);\n\n\t\treturn tmpNewManyfest;\n\t}\n\n\t// Deserialize a Manifest from a string\n\tdeserialize(pManifestString)\n\t{\n\t\t// TODO: Add guards for bad manifest string\n\t\treturn this.loadManifest(JSON.parse(pManifestString));\n\t}\n\n\t// Load a manifest from an object\n\tloadManifest(pManifest)\n\t{\n\t\tif (typeof(pManifest) !== 'object')\n\t\t{\n\t\t\tthis.logError(`(${this.scope}) Error loading manifest; expecting an object but parameter was type ${typeof(pManifest)}.`);\n\t\t}\n\n\t\tlet tmpManifest = (typeof(pManifest) == 'object') ? pManifest : {};\n\n\t\tlet tmpDescriptorKeys = Object.keys(_DefaultConfiguration);\n\n\t\tfor (let i = 0; i < tmpDescriptorKeys.length; i++)\n\t\t{\n\t\t\tif (!tmpManifest.hasOwnProperty(tmpDescriptorKeys[i]))\n\t\t\t{\n\t\t\t\ttmpManifest[tmpDescriptorKeys[i]] = JSON.parse(JSON.stringify(_DefaultConfiguration[tmpDescriptorKeys[i]]));\n\t\t\t}\n\t\t}\n\n\t\tif (tmpManifest.hasOwnProperty('Scope'))\n\t\t{\n\t\t\tif (typeof(tmpManifest.Scope) === 'string')\n\t\t\t{\n\t\t\t\tthis.scope = tmpManifest.Scope;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.logError(`(${this.scope}) Error loading scope from manifest; expecting a string but property was type ${typeof(tmpManifest.Scope)}.`, tmpManifest);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.logError(`(${this.scope}) Error loading scope from manifest object. Property \"Scope\" does not exist in the root of the object.`, tmpManifest);\n\t\t}\n\n\t\tif (tmpManifest.hasOwnProperty('Descriptors'))\n\t\t{\n\t\t\tif (typeof(tmpManifest.Descriptors) === 'object')\n\t\t\t{\n\t\t\t\tlet tmpDescriptionAddresses = Object.keys(tmpManifest.Descriptors);\n\t\t\t\tfor (let i = 0; i < tmpDescriptionAddresses.length; i++)\n\t\t\t\t{\n\t\t\t\t\tthis.addDescriptor(tmpDescriptionAddresses[i], tmpManifest.Descriptors[tmpDescriptionAddresses[i]]);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.logError(`(${this.scope}) Error loading description object from manifest object. Expecting an object in 'Manifest.Descriptors' but the property was type ${typeof(tmpManifest.Descriptors)}.`, tmpManifest);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.logError(`(${this.scope}) Error loading object description from manifest object. Property \"Descriptors\" does not exist in the root of the Manifest object.`, tmpManifest);\n\t\t}\n\n\t\tif (tmpManifest.hasOwnProperty('HashTranslations'))\n\t\t{\n\t\t\tif (typeof(tmpManifest.HashTranslations) === 'object')\n\t\t\t{\n\t\t\t\tfor (let i = 0; i < tmpManifest.HashTranslations.length; i++)\n\t\t\t\t{\n\t\t\t\t\t// Each translation is \n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Serialize the Manifest to a string\n\tserialize()\n\t{\n\t\treturn JSON.stringify(this.getManifest());\n\t}\n\n\tgetManifest()\n\t{\n\t\treturn (\n\t\t\t{\n\t\t\t\tScope: this.scope,\n\t\t\t\tDescriptors: JSON.parse(JSON.stringify(this.elementDescriptors)),\n\t\t\t\tHashTranslations: JSON.parse(JSON.stringify(this.hashTranslations.translationTable))\n\t\t\t});\n\t}\n\n\t// Add a descriptor to the manifest\n\taddDescriptor(pAddress, pDescriptor)\n\t{\n\t\tif (typeof(pDescriptor) === 'object')\n\t\t{\n\t\t\t// Add the Address into the Descriptor if it doesn't exist:\n\t\t\tif (!pDescriptor.hasOwnProperty('Address'))\n\t\t\t{\n\t\t\t\tpDescriptor.Address = pAddress;\n\t\t\t}\n\n\t\t\tif (!this.elementDescriptors.hasOwnProperty(pAddress))\n\t\t\t{\n\t\t\t\tthis.elementAddresses.push(pAddress);\n\t\t\t}\n\n\t\t\t// Add the element descriptor to the schema\n\t\t\tthis.elementDescriptors[pAddress] = pDescriptor;\n\n\t\t\t// Always add the address as a hash\n\t\t\tthis.elementHashes[pAddress] = pAddress;\n\n\t\t\tif (pDescriptor.hasOwnProperty('Hash'))\n\t\t\t{\n\t\t\t\t// TODO: Check if this is a good idea or not..\n\t\t\t\t// Collisions are bound to happen with both representations of the address/hash in here and developers being able to create their own hashes.\n\t\t\t\tthis.elementHashes[pDescriptor.Hash] = pAddress;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpDescriptor.Hash = pAddress;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.logError(`(${this.scope}) Error loading object descriptor for address '${pAddress}' from manifest object. Expecting an object but property was type ${typeof(pDescriptor)}.`);\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tgetDescriptorByHash(pHash)\n\t{\n\t\treturn this.getDescriptor(this.resolveHashAddress(pHash));\n\t}\n\n\tgetDescriptor(pAddress)\n\t{\n\t\treturn this.elementDescriptors[pAddress];\n\t}\n\n\t// execute an action function for each descriptor\n\teachDescriptor(fAction)\n\t{\n let tmpDescriptorAddresses = Object.keys(this.elementDescriptors);\n for (let i = 0; i < tmpDescriptorAddresses.length; i++)\n {\n fAction(this.elementDescriptors[tmpDescriptorAddresses[i]]);\n }\n\n\t}\n\n\t/*************************************************************************\n\t * Beginning of Object Manipulation (read & write) Functions\n\t */\n\t// Check if an element exists by its hash\n\tcheckAddressExistsByHash (pObject, pHash)\n\t{\n\t\treturn this.checkAddressExists(pObject,this.resolveHashAddress(pHash));\n\t}\n\n\t// Check if an element exists at an address\n\tcheckAddressExists (pObject, pAddress)\n\t{\n\t\treturn this.objectAddressCheckAddressExists.checkAddressExists(pObject, pAddress);\n\t}\n\n\t// Turn a hash into an address, factoring in the translation table.\n\tresolveHashAddress(pHash)\n\t{\n\t\tlet tmpAddress = undefined;\n\n\t\tlet tmpInElementHashTable = this.elementHashes.hasOwnProperty(pHash);\n\t\tlet tmpInTranslationTable = this.hashTranslations.translationTable.hasOwnProperty(pHash);\n\n\t\t// The most straightforward: the hash exists, no translations.\n\t\tif (tmpInElementHashTable && !tmpInTranslationTable)\n\t\t{\n\t\t\ttmpAddress = this.elementHashes[pHash];\n\t\t}\n\t\t// There is a translation from one hash to another, and, the elementHashes contains the pointer end\n\t\telse if (tmpInTranslationTable && this.elementHashes.hasOwnProperty(this.hashTranslations.translate(pHash)))\n\t\t{\n\t\t\ttmpAddress = this.elementHashes[this.hashTranslations.translate(pHash)];\n\t\t}\n\t\t// Use the level of indirection only in the Translation Table\n\t\telse if (tmpInTranslationTable)\n\t\t{\n\t\t\ttmpAddress = this.hashTranslations.translate(pHash);\n\t\t}\n\t\t// Just treat the hash as an address.\n\t\t// TODO: Discuss this ... it is magic but controversial\n\t\telse\n\t\t{\n\t\t\ttmpAddress = pHash;\n\t\t}\n\n\t\treturn tmpAddress;\n\t}\n\n\t// Get the value of an element by its hash\n\tgetValueByHash (pObject, pHash)\n\t{\n\t\tlet tmpValue = this.getValueAtAddress(pObject, this.resolveHashAddress(pHash));\n\n\t\tif (typeof(tmpValue) == 'undefined')\n\t\t{\n\t\t\t// Try to get a default if it exists\n\t\t\ttmpValue = this.getDefaultValue(this.getDescriptorByHash(pHash));\n\t\t}\n\n\t\treturn tmpValue;\n\t}\n\n\t// Get the value of an element at an address\n\tgetValueAtAddress (pObject, pAddress)\n\t{\n\t\tlet tmpValue = this.objectAddressGetValue.getValueAtAddress(pObject, pAddress);\n\n\t\tif (typeof(tmpValue) == 'undefined')\n\t\t{\n\t\t\t// Try to get a default if it exists\n\t\t\ttmpValue = this.getDefaultValue(this.getDescriptor(pAddress));\n\t\t}\n\n\t\treturn tmpValue;\n\t}\n\n\t// Set the value of an element by its hash\n\tsetValueByHash(pObject, pHash, pValue)\n\t{\n\t\treturn this.setValueAtAddress(pObject, this.resolveHashAddress(pHash), pValue);\n\t}\n\n\t// Set the value of an element at an address\n\tsetValueAtAddress (pObject, pAddress, pValue)\n\t{\n\t\treturn this.objectAddressSetValue.setValueAtAddress(pObject, pAddress, pValue);\n\t}\n\n\t// Delete the value of an element by its hash\n\tdeleteValueByHash(pObject, pHash, pValue)\n\t{\n\t\treturn this.deleteValueAtAddress(pObject, this.resolveHashAddress(pHash), pValue);\n\t}\n\n\t// Delete the value of an element at an address\n\tdeleteValueAtAddress (pObject, pAddress, pValue)\n\t{\n\t\treturn this.objectAddressDeleteValue.deleteValueAtAddress(pObject, pAddress, pValue);\n\t}\n\n\t// Validate the consistency of an object against the schema\n\tvalidate(pObject)\n\t{\n\t\tlet tmpValidationData =\n\t\t{\n\t\t\tError: null,\n\t\t\tErrors: [],\n\t\t\tMissingElements:[]\n\t\t};\n\n\t\tif (typeof(pObject) !== 'object')\n\t\t{\n\t\t\ttmpValidationData.Error = true;\n\t\t\ttmpValidationData.Errors.push(`Expected passed in object to be type object but was passed in ${typeof(pObject)}`);\n\t\t}\n\n\t\tlet addValidationError = (pAddress, pErrorMessage) =>\n\t\t{\n\t\t\ttmpValidationData.Error = true;\n\t\t\ttmpValidationData.Errors.push(`Element at address \"${pAddress}\" ${pErrorMessage}.`);\n\t\t};\n\n\t\t// Now enumerate through the values and check for anomalies based on the schema\n\t\tfor (let i = 0; i < this.elementAddresses.length; i++)\n\t\t{\n\t\t\tlet tmpDescriptor = this.getDescriptor(this.elementAddresses[i]);\n\t\t\tlet tmpValueExists = this.checkAddressExists(pObject, tmpDescriptor.Address);\n\t\t\tlet tmpValue = this.getValueAtAddress(pObject, tmpDescriptor.Address);\n\n\t\t\tif ((typeof(tmpValue) == 'undefined') || !tmpValueExists)\n\t\t\t{\n\t\t\t\t// This will technically mean that `Object.Some.Value = undefined` will end up showing as \"missing\"\n\t\t\t\t// TODO: Do we want to do a different message based on if the property exists but is undefined?\n\t\t\t\ttmpValidationData.MissingElements.push(tmpDescriptor.Address);\n\t\t\t\tif (tmpDescriptor.Required || this.options.strict)\n\t\t\t\t{\n\t\t\t\t\taddValidationError(tmpDescriptor.Address, 'is flagged REQUIRED but is not set in the object');\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Now see if there is a data type specified for this element\n\t\t\tif (tmpDescriptor.DataType)\n\t\t\t{\n\t\t\t\tlet tmpElementType = typeof(tmpValue);\n\t\t\t\tswitch(tmpDescriptor.DataType.toString().trim().toLowerCase())\n\t\t\t\t{\n\t\t\t\t\tcase 'string':\n\t\t\t\t\t\tif (tmpElementType != 'string')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but is of the type ${tmpElementType}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 'number':\n\t\t\t\t\t\tif (tmpElementType != 'number')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but is of the type ${tmpElementType}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 'integer':\n\t\t\t\t\t\tif (tmpElementType != 'number')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but is of the type ${tmpElementType}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpValueString = tmpValue.toString();\n\t\t\t\t\t\t\tif (tmpValueString.indexOf('.') > -1)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t// TODO: Is this an error?\n\t\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but has a decimal point in the number.`);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 'float':\n\t\t\t\t\t\tif (tmpElementType != 'number')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but is of the type ${tmpElementType}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 'DateTime':\n\t\t\t\t\t\tlet tmpValueDate = new Date(tmpValue);\n\t\t\t\t\t\tif (tmpValueDate.toString() == 'Invalid Date')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} but is not parsable as a Date by Javascript`);\n\t\t\t\t\t\t}\n\n\t\t\t\t\tdefault:\n\t\t\t\t\t\t// Check if this is a string, in the default case\n\t\t\t\t\t\t// Note this is only when a DataType is specified and it is an unrecognized data type.\n\t\t\t\t\t\tif (tmpElementType != 'string')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\taddValidationError(tmpDescriptor.Address, `has a DataType ${tmpDescriptor.DataType} (which auto-converted to String because it was unrecognized) but is of the type ${tmpElementType}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn tmpValidationData;\n\t}\n\n\t// Returns a default value, or, the default value for the data type (which is overridable with configuration)\n\tgetDefaultValue(pDescriptor)\n\t{\n\t\tif (typeof(pDescriptor) != 'object')\n\t\t{\n\t\t\treturn undefined;\n\t\t}\n\n\t\tif (pDescriptor.hasOwnProperty('Default'))\n\t\t{\n\t\t\treturn pDescriptor.Default;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Default to a null if it doesn't have a type specified.\n\t\t\t// This will ensure a placeholder is created but isn't misinterpreted.\n\t\t\tlet tmpDataType = (pDescriptor.hasOwnProperty('DataType')) ? pDescriptor.DataType : 'String';\n\t\t\tif (this.options.defaultValues.hasOwnProperty(tmpDataType))\n\t\t\t{\n\t\t\t\treturn this.options.defaultValues[tmpDataType];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// give up and return null\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t}\n\n\t// Enumerate through the schema and populate default values if they don't exist.\n\tpopulateDefaults(pObject, pOverwriteProperties)\n\t{\n\t\treturn this.populateObject(pObject, pOverwriteProperties,\n\t\t\t// This just sets up a simple filter to see if there is a default set.\n\t\t\t(pDescriptor) =>\n\t\t\t{\n\t\t\t\treturn pDescriptor.hasOwnProperty('Default');\n\t\t\t});\n\t}\n\n\t// Forcefully populate all values even if they don't have defaults.\n\t// Based on type, this can do unexpected things.\n\tpopulateObject(pObject, pOverwriteProperties, fFilter)\n\t{\n\t\t// Automatically create an object if one isn't passed in.\n\t\tlet tmpObject = (typeof(pObject) === 'object') ? pObject : {};\n\t\t// Default to *NOT OVERWRITING* properties\n\t\tlet tmpOverwriteProperties = (typeof(pOverwriteProperties) == 'undefined') ? false : pOverwriteProperties;\n\t\t// This is a filter function, which is passed the schema and allows complex filtering of population\n\t\t// The default filter function just returns true, populating everything.\n\t\tlet tmpFilterFunction = (typeof(fFilter) == 'function') ? fFilter : (pDescriptor) => { return true; };\n\n\t\tthis.elementAddresses.forEach(\n\t\t\t(pAddress) =>\n\t\t\t{\n\t\t\t\tlet tmpDescriptor = this.getDescriptor(pAddress);\n\t\t\t\t// Check the filter function to see if this is an address we want to set the value for.\n\t\t\t\tif (tmpFilterFunction(tmpDescriptor))\n\t\t\t\t{\n\t\t\t\t\t// If we are overwriting properties OR the property does not exist\n\t\t\t\t\tif (tmpOverwriteProperties || !this.checkAddressExists(tmpObject, pAddress))\n\t\t\t\t\t{\n\t\t\t\t\t\tthis.setValueAtAddress(tmpObject, pAddress, this.getDefaultValue(tmpDescriptor));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\n\t\treturn tmpObject;\n\t}\n};\n\nmodule.exports = Manyfest;","var hasMap = typeof Map === 'function' && Map.prototype;\nvar mapSizeDescriptor = Object.getOwnPropertyDescriptor && hasMap ? Object.getOwnPropertyDescriptor(Map.prototype, 'size') : null;\nvar mapSize = hasMap && mapSizeDescriptor && typeof mapSizeDescriptor.get === 'function' ? mapSizeDescriptor.get : null;\nvar mapForEach = hasMap && Map.prototype.forEach;\nvar hasSet = typeof Set === 'function' && Set.prototype;\nvar setSizeDescriptor = Object.getOwnPropertyDescriptor && hasSet ? Object.getOwnPropertyDescriptor(Set.prototype, 'size') : null;\nvar setSize = hasSet && setSizeDescriptor && typeof setSizeDescriptor.get === 'function' ? setSizeDescriptor.get : null;\nvar setForEach = hasSet && Set.prototype.forEach;\nvar hasWeakMap = typeof WeakMap === 'function' && WeakMap.prototype;\nvar weakMapHas = hasWeakMap ? WeakMap.prototype.has : null;\nvar hasWeakSet = typeof WeakSet === 'function' && WeakSet.prototype;\nvar weakSetHas = hasWeakSet ? WeakSet.prototype.has : null;\nvar hasWeakRef = typeof WeakRef === 'function' && WeakRef.prototype;\nvar weakRefDeref = hasWeakRef ? WeakRef.prototype.deref : null;\nvar booleanValueOf = Boolean.prototype.valueOf;\nvar objectToString = Object.prototype.toString;\nvar functionToString = Function.prototype.toString;\nvar $match = String.prototype.match;\nvar $slice = String.prototype.slice;\nvar $replace = String.prototype.replace;\nvar $toUpperCase = String.prototype.toUpperCase;\nvar $toLowerCase = String.prototype.toLowerCase;\nvar $test = RegExp.prototype.test;\nvar $concat = Array.prototype.concat;\nvar $join = Array.prototype.join;\nvar $arrSlice = Array.prototype.slice;\nvar $floor = Math.floor;\nvar bigIntValueOf = typeof BigInt === 'function' ? BigInt.prototype.valueOf : null;\nvar gOPS = Object.getOwnPropertySymbols;\nvar symToString = typeof Symbol === 'function' && typeof Symbol.iterator === 'symbol' ? Symbol.prototype.toString : null;\nvar hasShammedSymbols = typeof Symbol === 'function' && typeof Symbol.iterator === 'object';\n// ie, `has-tostringtag/shams\nvar toStringTag = typeof Symbol === 'function' && Symbol.toStringTag && (typeof Symbol.toStringTag === hasShammedSymbols ? 'object' : 'symbol')\n ? Symbol.toStringTag\n : null;\nvar isEnumerable = Object.prototype.propertyIsEnumerable;\n\nvar gPO = (typeof Reflect === 'function' ? Reflect.getPrototypeOf : Object.getPrototypeOf) || (\n [].__proto__ === Array.prototype // eslint-disable-line no-proto\n ? function (O) {\n return O.__proto__; // eslint-disable-line no-proto\n }\n : null\n);\n\nfunction addNumericSeparator(num, str) {\n if (\n num === Infinity\n || num === -Infinity\n || num !== num\n || (num && num > -1000 && num < 1000)\n || $test.call(/e/, str)\n ) {\n return str;\n }\n var sepRegex = /[0-9](?=(?:[0-9]{3})+(?![0-9]))/g;\n if (typeof num === 'number') {\n var int = num < 0 ? -$floor(-num) : $floor(num); // trunc(num)\n if (int !== num) {\n var intStr = String(int);\n var dec = $slice.call(str, intStr.length + 1);\n return $replace.call(intStr, sepRegex, '$&_') + '.' + $replace.call($replace.call(dec, /([0-9]{3})/g, '$&_'), /_$/, '');\n }\n }\n return $replace.call(str, sepRegex, '$&_');\n}\n\nvar utilInspect = require('./util.inspect');\nvar inspectCustom = utilInspect.custom;\nvar inspectSymbol = isSymbol(inspectCustom) ? inspectCustom : null;\n\nmodule.exports = function inspect_(obj, options, depth, seen) {\n var opts = options || {};\n\n if (has(opts, 'quoteStyle') && (opts.quoteStyle !== 'single' && opts.quoteStyle !== 'double')) {\n throw new TypeError('option \"quoteStyle\" must be \"single\" or \"double\"');\n }\n if (\n has(opts, 'maxStringLength') && (typeof opts.maxStringLength === 'number'\n ? opts.maxStringLength < 0 && opts.maxStringLength !== Infinity\n : opts.maxStringLength !== null\n )\n ) {\n throw new TypeError('option \"maxStringLength\", if provided, must be a positive integer, Infinity, or `null`');\n }\n var customInspect = has(opts, 'customInspect') ? opts.customInspect : true;\n if (typeof customInspect !== 'boolean' && customInspect !== 'symbol') {\n throw new TypeError('option \"customInspect\", if provided, must be `true`, `false`, or `\\'symbol\\'`');\n }\n\n if (\n has(opts, 'indent')\n && opts.indent !== null\n && opts.indent !== '\\t'\n && !(parseInt(opts.indent, 10) === opts.indent && opts.indent > 0)\n ) {\n throw new TypeError('option \"indent\" must be \"\\\\t\", an integer > 0, or `null`');\n }\n if (has(opts, 'numericSeparator') && typeof opts.numericSeparator !== 'boolean') {\n throw new TypeError('option \"numericSeparator\", if provided, must be `true` or `false`');\n }\n var numericSeparator = opts.numericSeparator;\n\n if (typeof obj === 'undefined') {\n return 'undefined';\n }\n if (obj === null) {\n return 'null';\n }\n if (typeof obj === 'boolean') {\n return obj ? 'true' : 'false';\n }\n\n if (typeof obj === 'string') {\n return inspectString(obj, opts);\n }\n if (typeof obj === 'number') {\n if (obj === 0) {\n return Infinity / obj > 0 ? '0' : '-0';\n }\n var str = String(obj);\n return numericSeparator ? addNumericSeparator(obj, str) : str;\n }\n if (typeof obj === 'bigint') {\n var bigIntStr = String(obj) + 'n';\n return numericSeparator ? addNumericSeparator(obj, bigIntStr) : bigIntStr;\n }\n\n var maxDepth = typeof opts.depth === 'undefined' ? 5 : opts.depth;\n if (typeof depth === 'undefined') { depth = 0; }\n if (depth >= maxDepth && maxDepth > 0 && typeof obj === 'object') {\n return isArray(obj) ? '[Array]' : '[Object]';\n }\n\n var indent = getIndent(opts, depth);\n\n if (typeof seen === 'undefined') {\n seen = [];\n } else if (indexOf(seen, obj) >= 0) {\n return '[Circular]';\n }\n\n function inspect(value, from, noIndent) {\n if (from) {\n seen = $arrSlice.call(seen);\n seen.push(from);\n }\n if (noIndent) {\n var newOpts = {\n depth: opts.depth\n };\n if (has(opts, 'quoteStyle')) {\n newOpts.quoteStyle = opts.quoteStyle;\n }\n return inspect_(value, newOpts, depth + 1, seen);\n }\n return inspect_(value, opts, depth + 1, seen);\n }\n\n if (typeof obj === 'function' && !isRegExp(obj)) { // in older engines, regexes are callable\n var name = nameOf(obj);\n var keys = arrObjKeys(obj, inspect);\n return '[Function' + (name ? ': ' + name : ' (anonymous)') + ']' + (keys.length > 0 ? ' { ' + $join.call(keys, ', ') + ' }' : '');\n }\n if (isSymbol(obj)) {\n var symString = hasShammedSymbols ? $replace.call(String(obj), /^(Symbol\\(.*\\))_[^)]*$/, '$1') : symToString.call(obj);\n return typeof obj === 'object' && !hasShammedSymbols ? markBoxed(symString) : symString;\n }\n if (isElement(obj)) {\n var s = '<' + $toLowerCase.call(String(obj.nodeName));\n var attrs = obj.attributes || [];\n for (var i = 0; i < attrs.length; i++) {\n s += ' ' + attrs[i].name + '=' + wrapQuotes(quote(attrs[i].value), 'double', opts);\n }\n s += '>';\n if (obj.childNodes && obj.childNodes.length) { s += '...'; }\n s += '</' + $toLowerCase.call(String(obj.nodeName)) + '>';\n return s;\n }\n if (isArray(obj)) {\n if (obj.length === 0) { return '[]'; }\n var xs = arrObjKeys(obj, inspect);\n if (indent && !singleLineValues(xs)) {\n return '[' + indentedJoin(xs, indent) + ']';\n }\n return '[ ' + $join.call(xs, ', ') + ' ]';\n }\n if (isError(obj)) {\n var parts = arrObjKeys(obj, inspect);\n if (!('cause' in Error.prototype) && 'cause' in obj && !isEnumerable.call(obj, 'cause')) {\n return '{ [' + String(obj) + '] ' + $join.call($concat.call('[cause]: ' + inspect(obj.cause), parts), ', ') + ' }';\n }\n if (parts.length === 0) { return '[' + String(obj) + ']'; }\n return '{ [' + String(obj) + '] ' + $join.call(parts, ', ') + ' }';\n }\n if (typeof obj === 'object' && customInspect) {\n if (inspectSymbol && typeof obj[inspectSymbol] === 'function' && utilInspect) {\n return utilInspect(obj, { depth: maxDepth - depth });\n } else if (customInspect !== 'symbol' && typeof obj.inspect === 'function') {\n return obj.inspect();\n }\n }\n if (isMap(obj)) {\n var mapParts = [];\n if (mapForEach) {\n mapForEach.call(obj, function (value, key) {\n mapParts.push(inspect(key, obj, true) + ' => ' + inspect(value, obj));\n });\n }\n return collectionOf('Map', mapSize.call(obj), mapParts, indent);\n }\n if (isSet(obj)) {\n var setParts = [];\n if (setForEach) {\n setForEach.call(obj, function (value) {\n setParts.push(inspect(value, obj));\n });\n }\n return collectionOf('Set', setSize.call(obj), setParts, indent);\n }\n if (isWeakMap(obj)) {\n return weakCollectionOf('WeakMap');\n }\n if (isWeakSet(obj)) {\n return weakCollectionOf('WeakSet');\n }\n if (isWeakRef(obj)) {\n return weakCollectionOf('WeakRef');\n }\n if (isNumber(obj)) {\n return markBoxed(inspect(Number(obj)));\n }\n if (isBigInt(obj)) {\n return markBoxed(inspect(bigIntValueOf.call(obj)));\n }\n if (isBoolean(obj)) {\n return markBoxed(booleanValueOf.call(obj));\n }\n if (isString(obj)) {\n return markBoxed(inspect(String(obj)));\n }\n if (!isDate(obj) && !isRegExp(obj)) {\n var ys = arrObjKeys(obj, inspect);\n var isPlainObject = gPO ? gPO(obj) === Object.prototype : obj instanceof Object || obj.constructor === Object;\n var protoTag = obj instanceof Object ? '' : 'null prototype';\n var stringTag = !isPlainObject && toStringTag && Object(obj) === obj && toStringTag in obj ? $slice.call(toStr(obj), 8, -1) : protoTag ? 'Object' : '';\n var constructorTag = isPlainObject || typeof obj.constructor !== 'function' ? '' : obj.constructor.name ? obj.constructor.name + ' ' : '';\n var tag = constructorTag + (stringTag || protoTag ? '[' + $join.call($concat.call([], stringTag || [], protoTag || []), ': ') + '] ' : '');\n if (ys.length === 0) { return tag + '{}'; }\n if (indent) {\n return tag + '{' + indentedJoin(ys, indent) + '}';\n }\n return tag + '{ ' + $join.call(ys, ', ') + ' }';\n }\n return String(obj);\n};\n\nfunction wrapQuotes(s, defaultStyle, opts) {\n var quoteChar = (opts.quoteStyle || defaultStyle) === 'double' ? '\"' : \"'\";\n return quoteChar + s + quoteChar;\n}\n\nfunction quote(s) {\n return $replace.call(String(s), /\"/g, '&quot;');\n}\n\nfunction isArray(obj) { return toStr(obj) === '[object Array]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isDate(obj) { return toStr(obj) === '[object Date]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isRegExp(obj) { return toStr(obj) === '[object RegExp]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isError(obj) { return toStr(obj) === '[object Error]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isString(obj) { return toStr(obj) === '[object String]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isNumber(obj) { return toStr(obj) === '[object Number]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\nfunction isBoolean(obj) { return toStr(obj) === '[object Boolean]' && (!toStringTag || !(typeof obj === 'object' && toStringTag in obj)); }\n\n// Symbol and BigInt do have Symbol.toStringTag by spec, so that can't be used to eliminate false positives\nfunction isSymbol(obj) {\n if (hasShammedSymbols) {\n return obj && typeof obj === 'object' && obj instanceof Symbol;\n }\n if (typeof obj === 'symbol') {\n return true;\n }\n if (!obj || typeof obj !== 'object' || !symToString) {\n return false;\n }\n try {\n symToString.call(obj);\n return true;\n } catch (e) {}\n return false;\n}\n\nfunction isBigInt(obj) {\n if (!obj || typeof obj !== 'object' || !bigIntValueOf) {\n return false;\n }\n try {\n bigIntValueOf.call(obj);\n return true;\n } catch (e) {}\n return false;\n}\n\nvar hasOwn = Object.prototype.hasOwnProperty || function (key) { return key in this; };\nfunction has(obj, key) {\n return hasOwn.call(obj, key);\n}\n\nfunction toStr(obj) {\n return objectToString.call(obj);\n}\n\nfunction nameOf(f) {\n if (f.name) { return f.name; }\n var m = $match.call(functionToString.call(f), /^function\\s*([\\w$]+)/);\n if (m) { return m[1]; }\n return null;\n}\n\nfunction indexOf(xs, x) {\n if (xs.indexOf) { return xs.indexOf(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\nfunction isMap(x) {\n if (!mapSize || !x || typeof x !== 'object') {\n return false;\n }\n try {\n mapSize.call(x);\n try {\n setSize.call(x);\n } catch (s) {\n return true;\n }\n return x instanceof Map; // core-js workaround, pre-v2.5.0\n } catch (e) {}\n return false;\n}\n\nfunction isWeakMap(x) {\n if (!weakMapHas || !x || typeof x !== 'object') {\n return false;\n }\n try {\n weakMapHas.call(x, weakMapHas);\n try {\n weakSetHas.call(x, weakSetHas);\n } catch (s) {\n return true;\n }\n return x instanceof WeakMap; // core-js workaround, pre-v2.5.0\n } catch (e) {}\n return false;\n}\n\nfunction isWeakRef(x) {\n if (!weakRefDeref || !x || typeof x !== 'object') {\n return false;\n }\n try {\n weakRefDeref.call(x);\n return true;\n } catch (e) {}\n return false;\n}\n\nfunction isSet(x) {\n if (!setSize || !x || typeof x !== 'object') {\n return false;\n }\n try {\n setSize.call(x);\n try {\n mapSize.call(x);\n } catch (m) {\n return true;\n }\n return x instanceof Set; // core-js workaround, pre-v2.5.0\n } catch (e) {}\n return false;\n}\n\nfunction isWeakSet(x) {\n if (!weakSetHas || !x || typeof x !== 'object') {\n return false;\n }\n try {\n weakSetHas.call(x, weakSetHas);\n try {\n weakMapHas.call(x, weakMapHas);\n } catch (s) {\n return true;\n }\n return x instanceof WeakSet; // core-js workaround, pre-v2.5.0\n } catch (e) {}\n return false;\n}\n\nfunction isElement(x) {\n if (!x || typeof x !== 'object') { return false; }\n if (typeof HTMLElement !== 'undefined' && x instanceof HTMLElement) {\n return true;\n }\n return typeof x.nodeName === 'string' && typeof x.getAttribute === 'function';\n}\n\nfunction inspectString(str, opts) {\n if (str.length > opts.maxStringLength) {\n var remaining = str.length - opts.maxStringLength;\n var trailer = '... ' + remaining + ' more character' + (remaining > 1 ? 's' : '');\n return inspectString($slice.call(str, 0, opts.maxStringLength), opts) + trailer;\n }\n // eslint-disable-next-line no-control-regex\n var s = $replace.call($replace.call(str, /(['\\\\])/g, '\\\\$1'), /[\\x00-\\x1f]/g, lowbyte);\n return wrapQuotes(s, 'single', opts);\n}\n\nfunction lowbyte(c) {\n var n = c.charCodeAt(0);\n var x = {\n 8: 'b',\n 9: 't',\n 10: 'n',\n 12: 'f',\n 13: 'r'\n }[n];\n if (x) { return '\\\\' + x; }\n return '\\\\x' + (n < 0x10 ? '0' : '') + $toUpperCase.call(n.toString(16));\n}\n\nfunction markBoxed(str) {\n return 'Object(' + str + ')';\n}\n\nfunction weakCollectionOf(type) {\n return type + ' { ? }';\n}\n\nfunction collectionOf(type, size, entries, indent) {\n var joinedEntries = indent ? indentedJoin(entries, indent) : $join.call(entries, ', ');\n return type + ' (' + size + ') {' + joinedEntries + '}';\n}\n\nfunction singleLineValues(xs) {\n for (var i = 0; i < xs.length; i++) {\n if (indexOf(xs[i], '\\n') >= 0) {\n return false;\n }\n }\n return true;\n}\n\nfunction getIndent(opts, depth) {\n var baseIndent;\n if (opts.indent === '\\t') {\n baseIndent = '\\t';\n } else if (typeof opts.indent === 'number' && opts.indent > 0) {\n baseIndent = $join.call(Array(opts.indent + 1), ' ');\n } else {\n return null;\n }\n return {\n base: baseIndent,\n prev: $join.call(Array(depth + 1), baseIndent)\n };\n}\n\nfunction indentedJoin(xs, indent) {\n if (xs.length === 0) { return ''; }\n var lineJoiner = '\\n' + indent.prev + indent.base;\n return lineJoiner + $join.call(xs, ',' + lineJoiner) + '\\n' + indent.prev;\n}\n\nfunction arrObjKeys(obj, inspect) {\n var isArr = isArray(obj);\n var xs = [];\n if (isArr) {\n xs.length = obj.length;\n for (var i = 0; i < obj.length; i++) {\n xs[i] = has(obj, i) ? inspect(obj[i], obj) : '';\n }\n }\n var syms = typeof gOPS === 'function' ? gOPS(obj) : [];\n var symMap;\n if (hasShammedSymbols) {\n symMap = {};\n for (var k = 0; k < syms.length; k++) {\n symMap['$' + syms[k]] = syms[k];\n }\n }\n\n for (var key in obj) { // eslint-disable-line no-restricted-syntax\n if (!has(obj, key)) { continue; } // eslint-disable-line no-restricted-syntax, no-continue\n if (isArr && String(Number(key)) === key && key < obj.length) { continue; } // eslint-disable-line no-restricted-syntax, no-continue\n if (hasShammedSymbols && symMap['$' + key] instanceof Symbol) {\n // this is to prevent shammed Symbols, which are stored as strings, from being included in the string key section\n continue; // eslint-disable-line no-restricted-syntax, no-continue\n } else if ($test.call(/[^\\w$]/, key)) {\n xs.push(inspect(key, obj) + ': ' + inspect(obj[key], obj));\n } else {\n xs.push(key + ': ' + inspect(obj[key], obj));\n }\n }\n if (typeof gOPS === 'function') {\n for (var j = 0; j < syms.length; j++) {\n if (isEnumerable.call(obj, syms[j])) {\n xs.push('[' + inspect(syms[j]) + ']: ' + inspect(obj[syms[j]], obj));\n }\n }\n }\n return xs;\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* @author Steven Velozo <steven@velozo.com>\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\tAsynchronous: false,\n\n\t\t\tOutput: '',\n\t\t\tOutputBuffer: '',\n\n\t\t\tPattern: {},\n\n\t\t\tPatternMatch: false,\n\t\t\tPatternMatchEnd: false\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\tresetOutputBuffer (pParserState)\n\t{\n\t\t// Flush the output buffer.\n\t\tthis.flushOutputBuffer(pParserState);\n\t\t// End pattern mode\n\t\tpParserState.Pattern = false;\n\t\tpParserState.PatternStartNode = false;\n\t\tpParserState.StartPatternMatchComplete = false;\n\t\tpParserState.EndPatternMatchBegan = false;\n\t\tpParserState.PatternMatch = false;\n\n\t\treturn true;\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// If we are already in a pattern match traversal\n\t\tif (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern is still matching the start and we haven't passed the buffer\n\t\t\tif (!pParserState.StartPatternMatchComplete && pParserState.Pattern.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\tpParserState.Pattern = pParserState.Pattern[pCharacter];\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t\telse if (pParserState.EndPatternMatchBegan)\n\t\t\t{\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// Flush the output buffer.\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\t// Run the function\n\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\treturn this.resetOutputBuffer(pParserState);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (pParserState.PatternStartNode.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// We broke out of the end -- see if this is a new start of the end.\n\t\t\t\t\tpParserState.Pattern = pParserState.PatternStartNode.PatternEnd[pCharacter];\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpParserState.EndPatternMatchBegan = false;\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (pParserState.Pattern.hasOwnProperty('PatternEnd'))\n\t\t\t{\n\t\t\t\tif (!pParserState.StartPatternMatchComplete)\n\t\t\t\t{\n\t\t\t\t\tpParserState.StartPatternMatchComplete = true;\n\t\t\t\t\tpParserState.PatternStartNode = pParserState.Pattern;\n\t\t\t\t}\n\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This is the first character of the end pattern.\n\t\t\t\t\tpParserState.EndPatternMatchBegan = true;\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\t// Run the t*mplate function\n\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\treturn this.resetOutputBuffer(pParserState);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// We are in a pattern start but didn't match one; reset and start trying again from this character.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t}\n\t\t}\n\t\t// If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\tif (!pParserState.PatternMatch)\n\t\t{\n\t\t\t// This may be the start of a new pattern....\n\t\t\tif (pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// ... assign the root node as the matched node.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\tpParserState.Pattern = pParserState.ParseTree[pCharacter];\n\t\t\t\tpParserState.PatternMatch = true;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t}\n\t\treturn false;\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 parameter\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\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* @author Steven Velozo <steven@velozo.com>\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\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 * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddChild (pTree, pPattern)\n\t{\n\t\tif (!pTree.hasOwnProperty(pPattern))\n\t\t{\n\t\t\tpTree[pPattern] = {};\n\t\t}\n\n\t\treturn pTree[pPattern];\n\t}\n\n\t/**\n\t * Add a child character to a Parse Tree PatternEnd subtree\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 * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddEndChild (pTree, pPattern)\n\t{\n\t\tif (!pTree.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\tpTree.PatternEnd = {};\n\t\t}\n\n\t\tpTree.PatternEnd[pPattern] = {};\n\n\t\treturn pTree.PatternEnd[pPattern];\n\t}\n\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 {function} fParser - 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, fParser)\n\t{\n\t\tif (pPatternStart.length < 1)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tif ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length < 1))\n\t\t{\n\t\t\treturn false;\n\t\t}\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{\n\t\t\ttmpLeaf = this.addChild(tmpLeaf, pPatternStart[i], i);\n\t\t}\n\n\t\tif (!tmpLeaf.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\ttmpLeaf.PatternEnd = {};\n\t\t}\n\n\t\tlet tmpPatternEnd = (typeof(pPatternEnd) === 'string') ? pPatternEnd : pPatternStart;\n\t\tfor (let i = 0; i < tmpPatternEnd.length; i++)\n\t\t{\n\t\t\ttmpLeaf = this.addEndChild(tmpLeaf, tmpPatternEnd[i], i);\n\t\t}\n\n\t\ttmpLeaf.PatternStartString = pPatternStart;\n\t\ttmpLeaf.PatternEndString = tmpPatternEnd;\n\t\ttmpLeaf.Parse = (typeof(fParser) === 'function') ? fParser :\n\t\t\t\t\t\t(typeof(fParser) === 'string') ? () => { return fParser; } :\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","'use strict';\n\nvar replace = String.prototype.replace;\nvar percentTwenties = /%20/g;\n\nvar Format = {\n RFC1738: 'RFC1738',\n RFC3986: 'RFC3986'\n};\n\nmodule.exports = {\n 'default': Format.RFC3986,\n formatters: {\n RFC1738: function (value) {\n return replace.call(value, percentTwenties, '+');\n },\n RFC3986: function (value) {\n return String(value);\n }\n },\n RFC1738: Format.RFC1738,\n RFC3986: Format.RFC3986\n};\n","'use strict';\n\nvar stringify = require('./stringify');\nvar parse = require('./parse');\nvar formats = require('./formats');\n\nmodule.exports = {\n formats: formats,\n parse: parse,\n stringify: stringify\n};\n","'use strict';\n\nvar utils = require('./utils');\n\nvar has = Object.prototype.hasOwnProperty;\nvar isArray = Array.isArray;\n\nvar defaults = {\n allowDots: false,\n allowPrototypes: false,\n allowSparse: false,\n arrayLimit: 20,\n charset: 'utf-8',\n charsetSentinel: false,\n comma: false,\n decoder: utils.decode,\n delimiter: '&',\n depth: 5,\n ignoreQueryPrefix: false,\n interpretNumericEntities: false,\n parameterLimit: 1000,\n parseArrays: true,\n plainObjects: false,\n strictNullHandling: false\n};\n\nvar interpretNumericEntities = function (str) {\n return str.replace(/&#(\\d+);/g, function ($0, numberStr) {\n return String.fromCharCode(parseInt(numberStr, 10));\n });\n};\n\nvar parseArrayValue = function (val, options) {\n if (val && typeof val === 'string' && options.comma && val.indexOf(',') > -1) {\n return val.split(',');\n }\n\n return val;\n};\n\n// This is what browsers will submit when the ✓ character occurs in an\n// application/x-www-form-urlencoded body and the encoding of the page containing\n// the form is iso-8859-1, or when the submitted form has an accept-charset\n// attribute of iso-8859-1. Presumably also with other charsets that do not contain\n// the ✓ character, such as us-ascii.\nvar isoSentinel = 'utf8=%26%2310003%3B'; // encodeURIComponent('&#10003;')\n\n// These are the percent-encoded utf-8 octets representing a checkmark, indicating that the request actually is utf-8 encoded.\nvar charsetSentinel = 'utf8=%E2%9C%93'; // encodeURIComponent('✓')\n\nvar parseValues = function parseQueryStringValues(str, options) {\n var obj = { __proto__: null };\n\n var cleanStr = options.ignoreQueryPrefix ? str.replace(/^\\?/, '') : str;\n var limit = options.parameterLimit === Infinity ? undefined : options.parameterLimit;\n var parts = cleanStr.split(options.delimiter, limit);\n var skipIndex = -1; // Keep track of where the utf8 sentinel was found\n var i;\n\n var charset = options.charset;\n if (options.charsetSentinel) {\n for (i = 0; i < parts.length; ++i) {\n if (parts[i].indexOf('utf8=') === 0) {\n if (parts[i] === charsetSentinel) {\n charset = 'utf-8';\n } else if (parts[i] === isoSentinel) {\n charset = 'iso-8859-1';\n }\n skipIndex = i;\n i = parts.length; // The eslint settings do not allow break;\n }\n }\n }\n\n for (i = 0; i < parts.length; ++i) {\n if (i === skipIndex) {\n continue;\n }\n var part = parts[i];\n\n var bracketEqualsPos = part.indexOf(']=');\n var pos = bracketEqualsPos === -1 ? part.indexOf('=') : bracketEqualsPos + 1;\n\n var key, val;\n if (pos === -1) {\n key = options.decoder(part, defaults.decoder, charset, 'key');\n val = options.strictNullHandling ? null : '';\n } else {\n key = options.decoder(part.slice(0, pos), defaults.decoder, charset, 'key');\n val = utils.maybeMap(\n parseArrayValue(part.slice(pos + 1), options),\n function (encodedVal) {\n return options.decoder(encodedVal, defaults.decoder, charset, 'value');\n }\n );\n }\n\n if (val && options.interpretNumericEntities && charset === 'iso-8859-1') {\n val = interpretNumericEntities(val);\n }\n\n if (part.indexOf('[]=') > -1) {\n val = isArray(val) ? [val] : val;\n }\n\n if (has.call(obj, key)) {\n obj[key] = utils.combine(obj[key], val);\n } else {\n obj[key] = val;\n }\n }\n\n return obj;\n};\n\nvar parseObject = function (chain, val, options, valuesParsed) {\n var leaf = valuesParsed ? val : parseArrayValue(val, options);\n\n for (var i = chain.length - 1; i >= 0; --i) {\n var obj;\n var root = chain[i];\n\n if (root === '[]' && options.parseArrays) {\n obj = [].concat(leaf);\n } else {\n obj = options.plainObjects ? Object.create(null) : {};\n var cleanRoot = root.charAt(0) === '[' && root.charAt(root.length - 1) === ']' ? root.slice(1, -1) : root;\n var index = parseInt(cleanRoot, 10);\n if (!options.parseArrays && cleanRoot === '') {\n obj = { 0: leaf };\n } else if (\n !isNaN(index)\n && root !== cleanRoot\n && String(index) === cleanRoot\n && index >= 0\n && (options.parseArrays && index <= options.arrayLimit)\n ) {\n obj = [];\n obj[index] = leaf;\n } else if (cleanRoot !== '__proto__') {\n obj[cleanRoot] = leaf;\n }\n }\n\n leaf = obj;\n }\n\n return leaf;\n};\n\nvar parseKeys = function parseQueryStringKeys(givenKey, val, options, valuesParsed) {\n if (!givenKey) {\n return;\n }\n\n // Transform dot notation to bracket notation\n var key = options.allowDots ? givenKey.replace(/\\.([^.[]+)/g, '[$1]') : givenKey;\n\n // The regex chunks\n\n var brackets = /(\\[[^[\\]]*])/;\n var child = /(\\[[^[\\]]*])/g;\n\n // Get the parent\n\n var segment = options.depth > 0 && brackets.exec(key);\n var parent = segment ? key.slice(0, segment.index) : key;\n\n // Stash the parent if it exists\n\n var keys = [];\n if (parent) {\n // If we aren't using plain objects, optionally prefix keys that would overwrite object prototype properties\n if (!options.plainObjects && has.call(Object.prototype, parent)) {\n if (!options.allowPrototypes) {\n return;\n }\n }\n\n keys.push(parent);\n }\n\n // Loop through children appending to the array until we hit depth\n\n var i = 0;\n while (options.depth > 0 && (segment = child.exec(key)) !== null && i < options.depth) {\n i += 1;\n if (!options.plainObjects && has.call(Object.prototype, segment[1].slice(1, -1))) {\n if (!options.allowPrototypes) {\n return;\n }\n }\n keys.push(segment[1]);\n }\n\n // If there's a remainder, just add whatever is left\n\n if (segment) {\n keys.push('[' + key.slice(segment.index) + ']');\n }\n\n return parseObject(keys, val, options, valuesParsed);\n};\n\nvar normalizeParseOptions = function normalizeParseOptions(opts) {\n if (!opts) {\n return defaults;\n }\n\n if (opts.decoder !== null && opts.decoder !== undefined && typeof opts.decoder !== 'function') {\n throw new TypeError('Decoder has to be a function.');\n }\n\n if (typeof opts.charset !== 'undefined' && opts.charset !== 'utf-8' && opts.charset !== 'iso-8859-1') {\n throw new TypeError('The charset option must be either utf-8, iso-8859-1, or undefined');\n }\n var charset = typeof opts.charset === 'undefined' ? defaults.charset : opts.charset;\n\n return {\n allowDots: typeof opts.allowDots === 'undefined' ? defaults.allowDots : !!opts.allowDots,\n allowPrototypes: typeof opts.allowPrototypes === 'boolean' ? opts.allowPrototypes : defaults.allowPrototypes,\n allowSparse: typeof opts.allowSparse === 'boolean' ? opts.allowSparse : defaults.allowSparse,\n arrayLimit: typeof opts.arrayLimit === 'number' ? opts.arrayLimit : defaults.arrayLimit,\n charset: charset,\n charsetSentinel: typeof opts.charsetSentinel === 'boolean' ? opts.charsetSentinel : defaults.charsetSentinel,\n comma: typeof opts.comma === 'boolean' ? opts.comma : defaults.comma,\n decoder: typeof opts.decoder === 'function' ? opts.decoder : defaults.decoder,\n delimiter: typeof opts.delimiter === 'string' || utils.isRegExp(opts.delimiter) ? opts.delimiter : defaults.delimiter,\n // eslint-disable-next-line no-implicit-coercion, no-extra-parens\n depth: (typeof opts.depth === 'number' || opts.depth === false) ? +opts.depth : defaults.depth,\n ignoreQueryPrefix: opts.ignoreQueryPrefix === true,\n interpretNumericEntities: typeof opts.interpretNumericEntities === 'boolean' ? opts.interpretNumericEntities : defaults.interpretNumericEntities,\n parameterLimit: typeof opts.parameterLimit === 'number' ? opts.parameterLimit : defaults.parameterLimit,\n parseArrays: opts.parseArrays !== false,\n plainObjects: typeof opts.plainObjects === 'boolean' ? opts.plainObjects : defaults.plainObjects,\n strictNullHandling: typeof opts.strictNullHandling === 'boolean' ? opts.strictNullHandling : defaults.strictNullHandling\n };\n};\n\nmodule.exports = function (str, opts) {\n var options = normalizeParseOptions(opts);\n\n if (str === '' || str === null || typeof str === 'undefined') {\n return options.plainObjects ? Object.create(null) : {};\n }\n\n var tempObj = typeof str === 'string' ? parseValues(str, options) : str;\n var obj = options.plainObjects ? Object.create(null) : {};\n\n // Iterate over the keys and setup the new object\n\n var keys = Object.keys(tempObj);\n for (var i = 0; i < keys.length; ++i) {\n var key = keys[i];\n var newObj = parseKeys(key, tempObj[key], options, typeof str === 'string');\n obj = utils.merge(obj, newObj, options);\n }\n\n if (options.allowSparse === true) {\n return obj;\n }\n\n return utils.compact(obj);\n};\n","'use strict';\n\nvar getSideChannel = require('side-channel');\nvar utils = require('./utils');\nvar formats = require('./formats');\nvar has = Object.prototype.hasOwnProperty;\n\nvar arrayPrefixGenerators = {\n brackets: function brackets(prefix) {\n return prefix + '[]';\n },\n comma: 'comma',\n indices: function indices(prefix, key) {\n return prefix + '[' + key + ']';\n },\n repeat: function repeat(prefix) {\n return prefix;\n }\n};\n\nvar isArray = Array.isArray;\nvar push = Array.prototype.push;\nvar pushToArray = function (arr, valueOrArray) {\n push.apply(arr, isArray(valueOrArray) ? valueOrArray : [valueOrArray]);\n};\n\nvar toISO = Date.prototype.toISOString;\n\nvar defaultFormat = formats['default'];\nvar defaults = {\n addQueryPrefix: false,\n allowDots: false,\n charset: 'utf-8',\n charsetSentinel: false,\n delimiter: '&',\n encode: true,\n encoder: utils.encode,\n encodeValuesOnly: false,\n format: defaultFormat,\n formatter: formats.formatters[defaultFormat],\n // deprecated\n indices: false,\n serializeDate: function serializeDate(date) {\n return toISO.call(date);\n },\n skipNulls: false,\n strictNullHandling: false\n};\n\nvar isNonNullishPrimitive = function isNonNullishPrimitive(v) {\n return typeof v === 'string'\n || typeof v === 'number'\n || typeof v === 'boolean'\n || typeof v === 'symbol'\n || typeof v === 'bigint';\n};\n\nvar sentinel = {};\n\nvar stringify = function stringify(\n object,\n prefix,\n generateArrayPrefix,\n commaRoundTrip,\n strictNullHandling,\n skipNulls,\n encoder,\n filter,\n sort,\n allowDots,\n serializeDate,\n format,\n formatter,\n encodeValuesOnly,\n charset,\n sideChannel\n) {\n var obj = object;\n\n var tmpSc = sideChannel;\n var step = 0;\n var findFlag = false;\n while ((tmpSc = tmpSc.get(sentinel)) !== void undefined && !findFlag) {\n // Where object last appeared in the ref tree\n var pos = tmpSc.get(object);\n step += 1;\n if (typeof pos !== 'undefined') {\n if (pos === step) {\n throw new RangeError('Cyclic object value');\n } else {\n findFlag = true; // Break while\n }\n }\n if (typeof tmpSc.get(sentinel) === 'undefined') {\n step = 0;\n }\n }\n\n if (typeof filter === 'function') {\n obj = filter(prefix, obj);\n } else if (obj instanceof Date) {\n obj = serializeDate(obj);\n } else if (generateArrayPrefix === 'comma' && isArray(obj)) {\n obj = utils.maybeMap(obj, function (value) {\n if (value instanceof Date) {\n return serializeDate(value);\n }\n return value;\n });\n }\n\n if (obj === null) {\n if (strictNullHandling) {\n return encoder && !encodeValuesOnly ? encoder(prefix, defaults.encoder, charset, 'key', format) : prefix;\n }\n\n obj = '';\n }\n\n if (isNonNullishPrimitive(obj) || utils.isBuffer(obj)) {\n if (encoder) {\n var keyValue = encodeValuesOnly ? prefix : encoder(prefix, defaults.encoder, charset, 'key', format);\n return [formatter(keyValue) + '=' + formatter(encoder(obj, defaults.encoder, charset, 'value', format))];\n }\n return [formatter(prefix) + '=' + formatter(String(obj))];\n }\n\n var values = [];\n\n if (typeof obj === 'undefined') {\n return values;\n }\n\n var objKeys;\n if (generateArrayPrefix === 'comma' && isArray(obj)) {\n // we need to join elements in\n if (encodeValuesOnly && encoder) {\n obj = utils.maybeMap(obj, encoder);\n }\n objKeys = [{ value: obj.length > 0 ? obj.join(',') || null : void undefined }];\n } else if (isArray(filter)) {\n objKeys = filter;\n } else {\n var keys = Object.keys(obj);\n objKeys = sort ? keys.sort(sort) : keys;\n }\n\n var adjustedPrefix = commaRoundTrip && isArray(obj) && obj.length === 1 ? prefix + '[]' : prefix;\n\n for (var j = 0; j < objKeys.length; ++j) {\n var key = objKeys[j];\n var value = typeof key === 'object' && typeof key.value !== 'undefined' ? key.value : obj[key];\n\n if (skipNulls && value === null) {\n continue;\n }\n\n var keyPrefix = isArray(obj)\n ? typeof generateArrayPrefix === 'function' ? generateArrayPrefix(adjustedPrefix, key) : adjustedPrefix\n : adjustedPrefix + (allowDots ? '.' + key : '[' + key + ']');\n\n sideChannel.set(object, step);\n var valueSideChannel = getSideChannel();\n valueSideChannel.set(sentinel, sideChannel);\n pushToArray(values, stringify(\n value,\n keyPrefix,\n generateArrayPrefix,\n commaRoundTrip,\n strictNullHandling,\n skipNulls,\n generateArrayPrefix === 'comma' && encodeValuesOnly && isArray(obj) ? null : encoder,\n filter,\n sort,\n allowDots,\n serializeDate,\n format,\n formatter,\n encodeValuesOnly,\n charset,\n valueSideChannel\n ));\n }\n\n return values;\n};\n\nvar normalizeStringifyOptions = function normalizeStringifyOptions(opts) {\n if (!opts) {\n return defaults;\n }\n\n if (opts.encoder !== null && typeof opts.encoder !== 'undefined' && typeof opts.encoder !== 'function') {\n throw new TypeError('Encoder has to be a function.');\n }\n\n var charset = opts.charset || defaults.charset;\n if (typeof opts.charset !== 'undefined' && opts.charset !== 'utf-8' && opts.charset !== 'iso-8859-1') {\n throw new TypeError('The charset option must be either utf-8, iso-8859-1, or undefined');\n }\n\n var format = formats['default'];\n if (typeof opts.format !== 'undefined') {\n if (!has.call(formats.formatters, opts.format)) {\n throw new TypeError('Unknown format option provided.');\n }\n format = opts.format;\n }\n var formatter = formats.formatters[format];\n\n var filter = defaults.filter;\n if (typeof opts.filter === 'function' || isArray(opts.filter)) {\n filter = opts.filter;\n }\n\n return {\n addQueryPrefix: typeof opts.addQueryPrefix === 'boolean' ? opts.addQueryPrefix : defaults.addQueryPrefix,\n allowDots: typeof opts.allowDots === 'undefined' ? defaults.allowDots : !!opts.allowDots,\n charset: charset,\n charsetSentinel: typeof opts.charsetSentinel === 'boolean' ? opts.charsetSentinel : defaults.charsetSentinel,\n delimiter: typeof opts.delimiter === 'undefined' ? defaults.delimiter : opts.delimiter,\n encode: typeof opts.encode === 'boolean' ? opts.encode : defaults.encode,\n encoder: typeof opts.encoder === 'function' ? opts.encoder : defaults.encoder,\n encodeValuesOnly: typeof opts.encodeValuesOnly === 'boolean' ? opts.encodeValuesOnly : defaults.encodeValuesOnly,\n filter: filter,\n format: format,\n formatter: formatter,\n serializeDate: typeof opts.serializeDate === 'function' ? opts.serializeDate : defaults.serializeDate,\n skipNulls: typeof opts.skipNulls === 'boolean' ? opts.skipNulls : defaults.skipNulls,\n sort: typeof opts.sort === 'function' ? opts.sort : null,\n strictNullHandling: typeof opts.strictNullHandling === 'boolean' ? opts.strictNullHandling : defaults.strictNullHandling\n };\n};\n\nmodule.exports = function (object, opts) {\n var obj = object;\n var options = normalizeStringifyOptions(opts);\n\n var objKeys;\n var filter;\n\n if (typeof options.filter === 'function') {\n filter = options.filter;\n obj = filter('', obj);\n } else if (isArray(options.filter)) {\n filter = options.filter;\n objKeys = filter;\n }\n\n var keys = [];\n\n if (typeof obj !== 'object' || obj === null) {\n return '';\n }\n\n var arrayFormat;\n if (opts && opts.arrayFormat in arrayPrefixGenerators) {\n arrayFormat = opts.arrayFormat;\n } else if (opts && 'indices' in opts) {\n arrayFormat = opts.indices ? 'indices' : 'repeat';\n } else {\n arrayFormat = 'indices';\n }\n\n var generateArrayPrefix = arrayPrefixGenerators[arrayFormat];\n if (opts && 'commaRoundTrip' in opts && typeof opts.commaRoundTrip !== 'boolean') {\n throw new TypeError('`commaRoundTrip` must be a boolean, or absent');\n }\n var commaRoundTrip = generateArrayPrefix === 'comma' && opts && opts.commaRoundTrip;\n\n if (!objKeys) {\n objKeys = Object.keys(obj);\n }\n\n if (options.sort) {\n objKeys.sort(options.sort);\n }\n\n var sideChannel = getSideChannel();\n for (var i = 0; i < objKeys.length; ++i) {\n var key = objKeys[i];\n\n if (options.skipNulls && obj[key] === null) {\n continue;\n }\n pushToArray(keys, stringify(\n obj[key],\n key,\n generateArrayPrefix,\n commaRoundTrip,\n options.strictNullHandling,\n options.skipNulls,\n options.encode ? options.encoder : null,\n options.filter,\n options.sort,\n options.allowDots,\n options.serializeDate,\n options.format,\n options.formatter,\n options.encodeValuesOnly,\n options.charset,\n sideChannel\n ));\n }\n\n var joined = keys.join(options.delimiter);\n var prefix = options.addQueryPrefix === true ? '?' : '';\n\n if (options.charsetSentinel) {\n if (options.charset === 'iso-8859-1') {\n // encodeURIComponent('&#10003;'), the \"numeric entity\" representation of a checkmark\n prefix += 'utf8=%26%2310003%3B&';\n } else {\n // encodeURIComponent('✓')\n prefix += 'utf8=%E2%9C%93&';\n }\n }\n\n return joined.length > 0 ? prefix + joined : '';\n};\n","'use strict';\n\nvar formats = require('./formats');\n\nvar has = Object.prototype.hasOwnProperty;\nvar isArray = Array.isArray;\n\nvar hexTable = (function () {\n var array = [];\n for (var i = 0; i < 256; ++i) {\n array.push('%' + ((i < 16 ? '0' : '') + i.toString(16)).toUpperCase());\n }\n\n return array;\n}());\n\nvar compactQueue = function compactQueue(queue) {\n while (queue.length > 1) {\n var item = queue.pop();\n var obj = item.obj[item.prop];\n\n if (isArray(obj)) {\n var compacted = [];\n\n for (var j = 0; j < obj.length; ++j) {\n if (typeof obj[j] !== 'undefined') {\n compacted.push(obj[j]);\n }\n }\n\n item.obj[item.prop] = compacted;\n }\n }\n};\n\nvar arrayToObject = function arrayToObject(source, options) {\n var obj = options && options.plainObjects ? Object.create(null) : {};\n for (var i = 0; i < source.length; ++i) {\n if (typeof source[i] !== 'undefined') {\n obj[i] = source[i];\n }\n }\n\n return obj;\n};\n\nvar merge = function merge(target, source, options) {\n /* eslint no-param-reassign: 0 */\n if (!source) {\n return target;\n }\n\n if (typeof source !== 'object') {\n if (isArray(target)) {\n target.push(source);\n } else if (target && typeof target === 'object') {\n if ((options && (options.plainObjects || options.allowPrototypes)) || !has.call(Object.prototype, source)) {\n target[source] = true;\n }\n } else {\n return [target, source];\n }\n\n return target;\n }\n\n if (!target || typeof target !== 'object') {\n return [target].concat(source);\n }\n\n var mergeTarget = target;\n if (isArray(target) && !isArray(source)) {\n mergeTarget = arrayToObject(target, options);\n }\n\n if (isArray(target) && isArray(source)) {\n source.forEach(function (item, i) {\n if (has.call(target, i)) {\n var targetItem = target[i];\n if (targetItem && typeof targetItem === 'object' && item && typeof item === 'object') {\n target[i] = merge(targetItem, item, options);\n } else {\n target.push(item);\n }\n } else {\n target[i] = item;\n }\n });\n return target;\n }\n\n return Object.keys(source).reduce(function (acc, key) {\n var value = source[key];\n\n if (has.call(acc, key)) {\n acc[key] = merge(acc[key], value, options);\n } else {\n acc[key] = value;\n }\n return acc;\n }, mergeTarget);\n};\n\nvar assign = function assignSingleSource(target, source) {\n return Object.keys(source).reduce(function (acc, key) {\n acc[key] = source[key];\n return acc;\n }, target);\n};\n\nvar decode = function (str, decoder, charset) {\n var strWithoutPlus = str.replace(/\\+/g, ' ');\n if (charset === 'iso-8859-1') {\n // unescape never throws, no try...catch needed:\n return strWithoutPlus.replace(/%[0-9a-f]{2}/gi, unescape);\n }\n // utf-8\n try {\n return decodeURIComponent(strWithoutPlus);\n } catch (e) {\n return strWithoutPlus;\n }\n};\n\nvar encode = function encode(str, defaultEncoder, charset, kind, format) {\n // This code was originally written by Brian White (mscdex) for the io.js core querystring library.\n // It has been adapted here for stricter adherence to RFC 3986\n if (str.length === 0) {\n return str;\n }\n\n var string = str;\n if (typeof str === 'symbol') {\n string = Symbol.prototype.toString.call(str);\n } else if (typeof str !== 'string') {\n string = String(str);\n }\n\n if (charset === 'iso-8859-1') {\n return escape(string).replace(/%u[0-9a-f]{4}/gi, function ($0) {\n return '%26%23' + parseInt($0.slice(2), 16) + '%3B';\n });\n }\n\n var out = '';\n for (var i = 0; i < string.length; ++i) {\n var c = string.charCodeAt(i);\n\n if (\n c === 0x2D // -\n || c === 0x2E // .\n || c === 0x5F // _\n || c === 0x7E // ~\n || (c >= 0x30 && c <= 0x39) // 0-9\n || (c >= 0x41 && c <= 0x5A) // a-z\n || (c >= 0x61 && c <= 0x7A) // A-Z\n || (format === formats.RFC1738 && (c === 0x28 || c === 0x29)) // ( )\n ) {\n out += string.charAt(i);\n continue;\n }\n\n if (c < 0x80) {\n out = out + hexTable[c];\n continue;\n }\n\n if (c < 0x800) {\n out = out + (hexTable[0xC0 | (c >> 6)] + hexTable[0x80 | (c & 0x3F)]);\n continue;\n }\n\n if (c < 0xD800 || c >= 0xE000) {\n out = out + (hexTable[0xE0 | (c >> 12)] + hexTable[0x80 | ((c >> 6) & 0x3F)] + hexTable[0x80 | (c & 0x3F)]);\n continue;\n }\n\n i += 1;\n c = 0x10000 + (((c & 0x3FF) << 10) | (string.charCodeAt(i) & 0x3FF));\n /* eslint operator-linebreak: [2, \"before\"] */\n out += hexTable[0xF0 | (c >> 18)]\n + hexTable[0x80 | ((c >> 12) & 0x3F)]\n + hexTable[0x80 | ((c >> 6) & 0x3F)]\n + hexTable[0x80 | (c & 0x3F)];\n }\n\n return out;\n};\n\nvar compact = function compact(value) {\n var queue = [{ obj: { o: value }, prop: 'o' }];\n var refs = [];\n\n for (var i = 0; i < queue.length; ++i) {\n var item = queue[i];\n var obj = item.obj[item.prop];\n\n var keys = Object.keys(obj);\n for (var j = 0; j < keys.length; ++j) {\n var key = keys[j];\n var val = obj[key];\n if (typeof val === 'object' && val !== null && refs.indexOf(val) === -1) {\n queue.push({ obj: obj, prop: key });\n refs.push(val);\n }\n }\n }\n\n compactQueue(queue);\n\n return value;\n};\n\nvar isRegExp = function isRegExp(obj) {\n return Object.prototype.toString.call(obj) === '[object RegExp]';\n};\n\nvar isBuffer = function isBuffer(obj) {\n if (!obj || typeof obj !== 'object') {\n return false;\n }\n\n return !!(obj.constructor && obj.constructor.isBuffer && obj.constructor.isBuffer(obj));\n};\n\nvar combine = function combine(a, b) {\n return [].concat(a, b);\n};\n\nvar maybeMap = function maybeMap(val, fn) {\n if (isArray(val)) {\n var mapped = [];\n for (var i = 0; i < val.length; i += 1) {\n mapped.push(fn(val[i]));\n }\n return mapped;\n }\n return fn(val);\n};\n\nmodule.exports = {\n arrayToObject: arrayToObject,\n assign: assign,\n combine: combine,\n compact: compact,\n decode: decode,\n encode: encode,\n isBuffer: isBuffer,\n isRegExp: isRegExp,\n maybeMap: maybeMap,\n merge: merge\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\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","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\nvar callBound = require('call-bind/callBound');\nvar inspect = require('object-inspect');\n\nvar $TypeError = GetIntrinsic('%TypeError%');\nvar $WeakMap = GetIntrinsic('%WeakMap%', true);\nvar $Map = GetIntrinsic('%Map%', true);\n\nvar $weakMapGet = callBound('WeakMap.prototype.get', true);\nvar $weakMapSet = callBound('WeakMap.prototype.set', true);\nvar $weakMapHas = callBound('WeakMap.prototype.has', true);\nvar $mapGet = callBound('Map.prototype.get', true);\nvar $mapSet = callBound('Map.prototype.set', true);\nvar $mapHas = callBound('Map.prototype.has', true);\n\n/*\n * This function traverses the list returning the node corresponding to the\n * given key.\n *\n * That node is also moved to the head of the list, so that if it's accessed\n * again we don't need to traverse the whole list. By doing so, all the recently\n * used nodes can be accessed relatively quickly.\n */\nvar listGetNode = function (list, key) { // eslint-disable-line consistent-return\n\tfor (var prev = list, curr; (curr = prev.next) !== null; prev = curr) {\n\t\tif (curr.key === key) {\n\t\t\tprev.next = curr.next;\n\t\t\tcurr.next = list.next;\n\t\t\tlist.next = curr; // eslint-disable-line no-param-reassign\n\t\t\treturn curr;\n\t\t}\n\t}\n};\n\nvar listGet = function (objects, key) {\n\tvar node = listGetNode(objects, key);\n\treturn node && node.value;\n};\nvar listSet = function (objects, key, value) {\n\tvar node = listGetNode(objects, key);\n\tif (node) {\n\t\tnode.value = value;\n\t} else {\n\t\t// Prepend the new node to the beginning of the list\n\t\tobjects.next = { // eslint-disable-line no-param-reassign\n\t\t\tkey: key,\n\t\t\tnext: objects.next,\n\t\t\tvalue: value\n\t\t};\n\t}\n};\nvar listHas = function (objects, key) {\n\treturn !!listGetNode(objects, key);\n};\n\nmodule.exports = function getSideChannel() {\n\tvar $wm;\n\tvar $m;\n\tvar $o;\n\tvar channel = {\n\t\tassert: function (key) {\n\t\t\tif (!channel.has(key)) {\n\t\t\t\tthrow new $TypeError('Side channel does not contain ' + inspect(key));\n\t\t\t}\n\t\t},\n\t\tget: function (key) { // eslint-disable-line consistent-return\n\t\t\tif ($WeakMap && key && (typeof key === 'object' || typeof key === 'function')) {\n\t\t\t\tif ($wm) {\n\t\t\t\t\treturn $weakMapGet($wm, key);\n\t\t\t\t}\n\t\t\t} else if ($Map) {\n\t\t\t\tif ($m) {\n\t\t\t\t\treturn $mapGet($m, key);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ($o) { // eslint-disable-line no-lonely-if\n\t\t\t\t\treturn listGet($o, key);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\thas: function (key) {\n\t\t\tif ($WeakMap && key && (typeof key === 'object' || typeof key === 'function')) {\n\t\t\t\tif ($wm) {\n\t\t\t\t\treturn $weakMapHas($wm, key);\n\t\t\t\t}\n\t\t\t} else if ($Map) {\n\t\t\t\tif ($m) {\n\t\t\t\t\treturn $mapHas($m, key);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ($o) { // eslint-disable-line no-lonely-if\n\t\t\t\t\treturn listHas($o, key);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t},\n\t\tset: function (key, value) {\n\t\t\tif ($WeakMap && key && (typeof key === 'object' || typeof key === 'function')) {\n\t\t\t\tif (!$wm) {\n\t\t\t\t\t$wm = new $WeakMap();\n\t\t\t\t}\n\t\t\t\t$weakMapSet($wm, key, value);\n\t\t\t} else if ($Map) {\n\t\t\t\tif (!$m) {\n\t\t\t\t\t$m = new $Map();\n\t\t\t\t}\n\t\t\t\t$mapSet($m, key, value);\n\t\t\t} else {\n\t\t\t\tif (!$o) {\n\t\t\t\t\t/*\n\t\t\t\t\t * Initialize the linked list as an empty node, so that we don't have\n\t\t\t\t\t * to special-case handling of the first node: we can always refer to\n\t\t\t\t\t * it as (previous node).next, instead of something like (list).head\n\t\t\t\t\t */\n\t\t\t\t\t$o = { key: {}, next: null };\n\t\t\t\t}\n\t\t\t\tlistSet($o, key, value);\n\t\t\t}\n\t\t}\n\t};\n\treturn channel;\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};","/*\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\n'use strict';\n\nvar punycode = require('punycode');\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/*\n * define these here so at least they only have to be\n * compiled once on the first module load.\n */\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 /*\n * RFC 2396: characters reserved for delimiting URLs.\n * We actually just auto-escape these.\n */\n delims = [\n '<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t'\n ],\n\n // RFC 2396: characters not allowed for various reasons.\n unwise = [\n '{', '}', '|', '\\\\', '^', '`'\n ].concat(delims),\n\n // Allowed by RFCs, but cause of XSS attacks. Always escape these.\n autoEscape = ['\\''].concat(unwise),\n /*\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 */\n nonHostChars = [\n '%', '/', '?', ';', '#'\n ].concat(autoEscape),\n hostEndingChars = [\n '/', '?', '#'\n ],\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('qs');\n\nfunction urlParse(url, parseQueryString, slashesDenoteHost) {\n if (url && typeof url === 'object' && 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 (typeof url !== 'string') {\n throw new TypeError(\"Parameter 'url' must be a string, not \" + typeof url);\n }\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 */\n var queryIndex = url.indexOf('?'),\n splitter = 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 /*\n * trim before proceeding.\n * This is to support parse stuff like \" http://foo.com \\n\"\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 /*\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 */\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] && (slashes || (proto && !slashedProtocol[proto]))) {\n\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\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\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)) { hostEnd = hec; }\n }\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 */\n var auth, atSign;\n if (hostEnd === -1) {\n // atSign can be anywhere.\n atSign = rest.lastIndexOf('@');\n } else {\n /*\n * atSign must be in auth portion.\n * http://a@b/c@d => host:b auth:a path:/c@d\n */\n atSign = rest.lastIndexOf('@', hostEnd);\n }\n\n /*\n * Now we have a portion which is definitely the auth.\n * Pull that off.\n */\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)) { hostEnd = hec; }\n }\n // if we still have not hit it, then the entire thing is a host.\n if (hostEnd === -1) { 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 /*\n * we've indicated that there is a hostname,\n * so even if it's empty, it has to be present.\n */\n this.hostname = this.hostname || '';\n\n /*\n * if hostname begins with [ and ends with ]\n * assume that it's an IPv6 address.\n */\n var ipv6Hostname = this.hostname[0] === '[' && 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 /*\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 */\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 /*\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 */\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 /*\n * strip [ and ] from the hostname\n * the host field still retains them, though\n */\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 /*\n * now rest is set to the post-host stuff.\n * chop off any delim chars.\n */\n if (!unsafeProtocol[lowerProto]) {\n\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 */\n for (var i = 0, l = autoEscape.length; i < l; i++) {\n var ae = autoEscape[i];\n if (rest.indexOf(ae) === -1) { 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 // 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] && 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 /*\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 */\n if (typeof obj === 'string') { 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 ? this.hostname : '[' + this.hostname + ']');\n if (this.port) {\n host += ':' + this.port;\n }\n }\n\n if (this.query && typeof this.query === 'object' && 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 /*\n * only the slashedProtocols get the //. Not mailto:, xmpp:, etc.\n * unless they had them to begin with.\n */\n if (this.slashes || (!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 (typeof relative === 'string') {\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 /*\n * hash is always overridden, no matter what.\n * even href=\"\" will remove it.\n */\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') { result[rkey] = relative[rkey]; }\n }\n\n // urlParse appends trailing / to urls like http://www.example.com\n if (slashedProtocol[result.protocol] && result.hostname && !result.pathname) {\n 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 /*\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 */\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 = relative.host || relative.pathname && relative.pathname.charAt(0) === '/',\n mustEndAbs = isRelAbs || isSourceAbs || (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 /*\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 */\n if (psychotic) {\n result.hostname = '';\n result.port = null;\n if (result.host) {\n if (srcPath[0] === '') { srcPath[0] = result.host; } 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; } 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 === '' ? relative.host : result.host;\n result.hostname = relative.hostname || relative.hostname === '' ? 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 /*\n * it's relative\n * throw away the existing file, and take the new path instead.\n */\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 (relative.search != null) {\n /*\n * just pull out the search.\n * like href='?foo'.\n * Put this after the other two cases because it simplifies the booleans\n */\n if (psychotic) {\n result.host = srcPath.shift();\n result.hostname = result.host;\n /*\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 */\n var authInHost = result.host && result.host.indexOf('@') > 0 ? result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.hostname = authInHost.shift();\n result.host = result.hostname;\n }\n }\n result.search = relative.search;\n result.query = relative.query;\n // to support http.request\n if (result.pathname !== null || result.search !== null) {\n result.path = (result.pathname ? result.pathname : '') + (result.search ? result.search : '');\n }\n result.href = result.format();\n return result;\n }\n\n if (!srcPath.length) {\n /*\n * no path at all. easy.\n * we've already handled the other stuff above.\n */\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 /*\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 */\n var last = srcPath.slice(-1)[0];\n var hasTrailingSlash = (result.host || relative.host || srcPath.length > 1) && (last === '.' || last === '..') || last === '';\n\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 */\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] !== '' && (!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] === '' || (srcPath[0] && srcPath[0].charAt(0) === '/');\n\n // put the host back\n if (psychotic) {\n result.hostname = isAbsolute ? '' : srcPath.length ? srcPath.shift() : '';\n result.host = result.hostname;\n /*\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 */\n var authInHost = result.host && result.host.indexOf('@') > 0 ? result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.hostname = authInHost.shift();\n result.host = result.hostname;\n }\n }\n\n mustEndAbs = mustEndAbs || (result.host && srcPath.length);\n\n if (mustEndAbs && !isAbsolute) {\n srcPath.unshift('');\n }\n\n if (srcPath.length > 0) {\n result.pathname = srcPath.join('/');\n } else {\n result.pathname = null;\n result.path = null;\n }\n\n // to support request.http\n if (result.pathname !== null || result.search !== null) {\n result.path = (result.pathname ? result.pathname : '') + (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\nexports.parse = urlParse;\nexports.resolve = urlResolve;\nexports.resolveObject = urlResolveObject;\nexports.format = urlFormat;\n\nexports.Url = Url;\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","/**\n* Fable Application Services Management\n* @author <steven@velozo.com>\n*/\n\nconst libFableServiceBase = require('fable-serviceproviderbase');\n\nclass FableService extends libFableServiceBase.CoreServiceProviderBase\n{\n\tconstructor(pSettings, pServiceHash)\n\t{\n\t\tsuper(pSettings, pServiceHash);\n\n\t\tthis.serviceType = 'ServiceManager';\n\n\t\tthis.serviceTypes = [];\n\n\t\t// A map of instantiated services\n\t\tthis.servicesMap = {};\n\n\t\t// A map of the default instantiated service by type\n\t\tthis.services = {};\n\n\t\t// A map of class constructors for services\n\t\tthis.serviceClasses = {};\n\n\t\t// If we need extra service initialization capabilities\n\t\tthis.extraServiceInitialization = false;\n\t}\n\n\taddServiceType(pServiceType, pServiceClass)\n\t{\n\t\tif (this.servicesMap.hasOwnProperty(pServiceType))\n\t\t{\n\t\t\t// TODO: Check if any services are running?\n\t\t\tthis.fable.log.warn(`Adding a service type [${pServiceType}] that already exists.`);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Add the container for instantiated services to go in\n\t\t\tthis.servicesMap[pServiceType] = {};\n\n\t\t\t// Add the type to the list of types\n\t\t\tthis.serviceTypes.push(pServiceType);\n\t\t}\n\n\t\t// Using the static member of the class is a much more reliable way to check if it is a service class than instanceof\n\t\tif ((typeof(pServiceClass) == 'function') && (pServiceClass.isFableService))\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.fable.log.error(`Attempted to add service type [${pServiceType}] with an invalid class. Using base service class, which will not crash but won't provide meaningful services.`);\n\t\t\tthis.serviceClasses[pServiceType] = libFableServiceBase;\n\t\t}\n\t}\n\n\t// This is for the services that are meant to run mostly single-instance so need a default at initialization\n\taddAndInstantiateServiceType(pServiceType, pServiceClass)\n\t{\n\t\tthis.addServiceType(pServiceType, pServiceClass);\n\t\treturn this.instantiateServiceProvider(pServiceType, {}, `${pServiceType}-Default`);\n\t}\n\n\t// Some services expect to be overloaded / customized class.\n\tinstantiateServiceProviderFromPrototype(pServiceType, pOptions, pCustomServiceHash, pServicePrototype)\n\t{\n\t\t// Instantiate the service\n\t\tlet tmpService = new pServicePrototype(this.fable, pOptions, pCustomServiceHash);\n\n\t\tif (this.extraServiceInitialization)\n\t\t{\n\t\t\ttmpService = this.extraServiceInitialization(tmpService);\n\t\t}\n\n\t\t// Add the service to the service map\n\t\tthis.servicesMap[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.services.hasOwnProperty(pServiceType))\n\t\t{\n\t\t\tthis.setDefaultServiceInstantiation(pServiceType, tmpService.Hash)\n\t\t}\n\n\t\treturn tmpService;\n\t}\n\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.servicesMap[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.services.hasOwnProperty(pServiceType))\n\t\t{\n\t\t\tthis.setDefaultServiceInstantiation(pServiceType, tmpService.Hash)\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\tif (this.extraServiceInitialization)\n\t\t{\n\t\t\ttmpService = this.extraServiceInitialization(tmpService);\n\t\t}\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.servicesMap.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.servicesMap[tmpServiceType] = {};\n\t\t}\n\t\t// Add the service to the service map\n\t\tthis.servicesMap[tmpServiceType][tmpServiceHash] = pServiceInstance;\n\n\t\t// If this is the first service of this type, make it the default\n\t\tif (!this.services.hasOwnProperty(tmpServiceType))\n\t\t{\n\t\t\tthis.setDefaultServiceInstantiation(tmpServiceType, tmpServiceHash)\n\t\t}\n\n\t\treturn pServiceInstance;\n\t}\n\n\tsetDefaultServiceInstantiation(pServiceType, pServiceHash)\n\t{\n\t\tif (this.servicesMap[pServiceType].hasOwnProperty(pServiceHash))\n\t\t{\n\t\t\tthis.fable[pServiceType] = this.servicesMap[pServiceType][pServiceHash];\n\t\t\tthis.services[pServiceType] = this.servicesMap[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;\nmodule.exports.CoreServiceProviderBase = libFableServiceBase.CoreServiceProviderBase;","/**\n* Fable Application Services Support Library\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 libFableServiceManager = require('./Fable-ServiceManager.js');\n\nclass Fable\n{\n\tconstructor(pSettings)\n\t{\n\t\t// Initialization Phase 0: Set up the lowest level state (core services)\n\t\t// Container for the core services prototypes.\n\t\t// This is here so if an API consumer changes the default for a core service,\n\t\t// fable still runs with what was initialized.\n\t\tthis._coreServices = {};\n\n\t\t// Instantiate the default Settings Manager\n\t\tthis._coreServices.SettingsManager = new libFableSettings(pSettings);\n\t\t// Instantiate the UUID generator\n\t\tthis._coreServices.UUID = new libFableUUID(this._coreServices.SettingsManager.settings);\n\t\t// Instantiate the logging system\n\t\tthis._coreServices.Logging = new libFableLog(this._coreServices.SettingsManager.settings);\n\t\tthis._coreServices.Logging.initialize();\n\n\t\t// Initialization Phase 1: Instantiate the service manager\n\t\t// This is the start actual bootstrapping point for fable\n\t\tthis._coreServices.ServiceManager = new libFableServiceManager(this);\n\t\tthis.serviceManager = this._coreServices.ServiceManager;\n\t\tthis.serviceManager.connectFable(this);\n\t\t// Bootstrapping of fable into the Service Manager is complete\n\n\t\t// Initialization Phase 2: Map in the default services.\n\t\t// They will then be available in the Default service provider set as well.\n\t\tthis.serviceManager.connectPreinitServiceProviderInstance(this._coreServices.ServiceManager);\n\t\tthis.serviceManager.connectPreinitServiceProviderInstance(this._coreServices.UUID);\n\t\tthis.serviceManager.connectPreinitServiceProviderInstance(this._coreServices.Logging);\n\t\tthis.serviceManager.connectPreinitServiceProviderInstance(this._coreServices.SettingsManager);\n\n\t\t// Initialize and instantiate the default baked-in Data Arithmatic service\n\t\tthis.serviceManager.addAndInstantiateServiceType('EnvironmentData', require('./services/Fable-Service-EnvironmentData.js'));\n\t\tthis.serviceManager.addServiceType('Template', require('./services/Fable-Service-Template.js'));\n\t\tthis.serviceManager.addServiceType('MetaTemplate', require('./services/Fable-Service-MetaTemplate.js'));\n\t\tthis.serviceManager.addServiceType('Anticipate', require('./services/Fable-Service-Anticipate.js'));\n\t\tthis.serviceManager.addAndInstantiateServiceType('Dates', require('./services/Fable-Service-DateManipulation.js'));\n\t\tthis.serviceManager.addAndInstantiateServiceType('DataFormat', require('./services/Fable-Service-DataFormat.js'));\n\t\tthis.serviceManager.addAndInstantiateServiceType('DataGeneration', require('./services/Fable-Service-DataGeneration.js'));\n\t\tthis.serviceManager.addAndInstantiateServiceType('Utility', require('./services/Fable-Service-Utility.js'));\n\t\tthis.serviceManager.addServiceType('Operation', require('./services/Fable-Service-Operation.js'));\n\t\tthis.serviceManager.addServiceType('RestClient', require('./services/Fable-Service-RestClient.js'));\n\t\tthis.serviceManager.addServiceType('CSVParser', require('./services/Fable-Service-CSVParser.js'));\n\t\tthis.serviceManager.addServiceType('Manifest', require('manyfest'));\n\t\tthis.serviceManager.addServiceType('ObjectCache', require('cachetrax'));\n\t\tthis.serviceManager.addServiceType('FilePersistence', require('./services/Fable-Service-FilePersistence.js'));\n\t}\n\n\tget isFable()\n\t{\n\t\treturn true;\n\t}\n\n\tget settings()\n\t{\n\t\treturn this._coreServices.SettingsManager.settings;\n\t}\n\n\tget settingsManager()\n\t{\n\t\treturn this._coreServices.SettingsManager;\n\t}\n\n\tget log()\n\t{\n\t\treturn this._coreServices.Logging;\n\t}\n\n\tget services()\n\t{\n\t\treturn this._coreServices.ServiceManager.services;\n\t}\n\n\tget servicesMap()\n\t{\n\t\treturn this._coreServices.ServiceManager.servicesMap;\n\t}\n\n\tgetUUID()\n\t{\n\t\treturn this._coreServices.UUID.getUUID();\n\t}\n\n\tget fable()\n\t{\n\t\treturn this;\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.CoreServiceProviderBase = libFableServiceManager.CoreServiceProviderBase;\n\nmodule.exports.precedent = libFableSettings.precedent;","const libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nclass FableServiceAnticipate extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash);\n\n\t\tthis.serviceType = 'AsyncAnticipate';\n\n\t\t// The queue of operations waiting to run.\n\t\tthis.operationQueue = [];\n\t\tthis.erroredOperations = [];\n\n\t\tthis.executingOperationCount = 0;\n\t\tthis.completedOperationCount = 0;\n\n\t\tthis.maxOperations = 1;\n\n\t\tthis.lastError = undefined;\n\t\tthis.waitingFunctions = [];\n\t}\n\n\tcheckQueue()\n\t{\n\t\t// This checks to see if we need to start any operations.\n\t\tif (this.operationQueue.length > 0 && this.executingOperationCount < this.maxOperations)\n\t\t{\n\t\t\tlet tmpOperation = this.operationQueue.shift();\n\t\t\tthis.executingOperationCount += 1;\n\t\t\ttmpOperation(this.buildAnticipatorCallback());\n\t\t}\n\t\telse if (this.waitingFunctions.length > 0 && this.executingOperationCount < 1)\n\t\t{\n\t\t\t// If there are no operations left, and we have waiting functions, call them.\n\t\t\tfor (let i = 0; i < this.waitingFunctions.length; i++)\n\t\t\t{\n\t\t\t\tthis.waitingFunctions[i](this.lastError);\n\t\t\t}\n\t\t\t// Reset our state\n\t\t\tthis.lastError = undefined;\n\t\t\tthis.waitingFunctions = [];\n\t\t}\n\t}\n\n\t// Expects a function fAsynchronousFunction(fCallback)\n\tanticipate(fAsynchronousFunction)\n\t{\n\t\tthis.operationQueue.push(fAsynchronousFunction);\n\t\tthis.checkQueue();\n\t}\n\n\tbuildAnticipatorCallback()\n\t{\n\t\t// This uses closure-scoped state to track the callback state\n\t\tlet tmpCallbackState = (\n\t\t\t{\n\t\t\t\tCalled: false,\n\t\t\t\tError: undefined,\n\t\t\t\tOperationSet: this\n\t\t\t});\t\t\n\t\treturn hoistedCallback;\n\t\tfunction hoistedCallback(pError)\n\t\t{\n\t\t\tif (tmpCallbackState.Called)\n\t\t\t{\n\t\t\t\t// If they call the callback twice, throw an error\n\t\t\t\tthrow new Error(\"Anticipation async callback called twice...\");\n\t\t\t}\n\t\t\ttmpCallbackState.Called = true;\n\t\t\ttmpCallbackState.error = pError;\n\n\t\t\ttmpCallbackState.OperationSet.executingOperationCount -= 1;\n\t\t\ttmpCallbackState.OperationSet.completedOperationCount += 1;\n\n\t\t\ttmpCallbackState.OperationSet.checkQueue();\n\t\t}\n\t}\n\n\twait(fCallback)\n\t{\n\t\tthis.waitingFunctions.push(fCallback);\n\t\tthis.checkQueue();\n\t}\n}\n\nmodule.exports = FableServiceAnticipate;","const libFableServiceProviderBase = require('fable-serviceproviderbase');\n/**\n* Parsing CSVs. Why? Because it's a thing that needs to be done.\n*\n* 1. And the other node CSV parsers had issues with the really messy files we had.\n* \n*\n* 2. None of the CSV parsers dealt with and multi-line quoted string columns\n* which are apparently a-ok according to the official spec.\n* Plus a lot of them are asynchronous because apparently that's the best way to\n* do anything; unfortunately some files have a sequence issue with that.\n*\n* @class CSVParser\n*/\nclass CSVParser extends libFableServiceProviderBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash);\n\n\t\tthis.serviceType = 'CSVParser';\n\n this.Header = [];\n this.HeaderFieldNames = [];\n\n this.Delimiter = ',';\n this.QuoteCharacter = '\"';\n\n this.CleanCharacters = ['\\r'];\n\n this.HeaderLineIndex = 0;\n this.HasHeader = true;\n this.HasSetHeader = false;\n this.EmitHeader = false;\n\n this.EmitJSON = true;\n\n this.EscapedQuoteString = '&quot;';\n\n // Current Line Parsing State\n this.CurrentLine = '';\n this.CurrentRecord = [];\n\n this.InQuote = false;\n this.InEscapedQuote = false;\n\n this.LinesParsed = 0;\n this.RowsEmitted = 0;\n }\n\n marshalRowToJSON(pRowArray)\n {\n if (!Array.isArray(pRowArray))\n {\n return false;\n }\n\n for (let i = this.HeaderFieldNames.length; i < pRowArray.length; i++)\n {\n this.HeaderFieldNames[i] = `${i}`;\n }\n\n let tmpObject = {};\n\n for (let i = 0; i < pRowArray.length; i++)\n {\n tmpObject[this.HeaderFieldNames[i]] = pRowArray[i];\n }\n\n return tmpObject;\n }\n\n // Set the header data, for use in marshalling to JSON.\n setHeader (pHeaderArray)\n {\n this.Header = pHeaderArray;\n\n for (let i = 0; i < this.Header.length; i++)\n {\n if (typeof(this.Header[i]) == 'undefined')\n {\n this.HeaderFieldNames[i] = `${i}`;\n }\n else\n {\n this.HeaderFieldNames[i] = this.Header[i].toString();\n }\n }\n }\n\n resetRowState()\n {\n this.CurrentRecord = [];\n }\n\n pushLine()\n {\n for (let i = 0; i < this.CleanCharacters.length; i++)\n {\n this.CurrentLine = this.CurrentLine.replace(this.CleanCharacters[i],'');\n }\n this.CurrentRecord.push(this.CurrentLine);\n this.CurrentLine = '';\n }\n\n emitRow(pFormatAsJSON)\n {\n let tmpFormatAsJSON = (typeof(pFormatAsJSON) == 'undefined') ? this.EmitJSON : pFormatAsJSON;\n\n this.RowsEmitted++;\n let tmpCompletedRecord = this.CurrentRecord;\n this.CurrentRecord = [];\n\n if (tmpFormatAsJSON)\n {\n return this.marshalRowToJSON(tmpCompletedRecord);\n }\n else\n {\n return tmpCompletedRecord;\n }\n }\n\n parseCSVLine (pLineString)\n {\n this.LinesParsed++;\n\n for (let i = 0; i < pLineString.length; i++)\n {\n if ((!this.InQuote) && (pLineString[i] == this.Delimiter))\n {\n this.pushLine();\n }\n else if (pLineString[i] == this.QuoteCharacter)\n {\n // If we are in the second part of an escaped quote, ignore it.\n if (this.InEscapedQuote)\n {\n this.InEscapedQuote = false;\n }\n // If we aren't in a quote, enter quote\n else if (!this.InQuote)\n {\n this.InQuote = true;\n }\n // We are in a quote, so peek forward to see if this is an \"escaped\" quote pair\n else if ((i < pLineString.length) && (pLineString[i+1] == this.QuoteCharacter))\n {\n this.CurrentLine += this.EscapedQuoteString;\n this.InEscapedQuote = true;\n }\n // We are in a quote, this isn't an \"escaped\" quote pair, so go out of quote mode\n else\n {\n this.InQuote = false;\n }\n }\n else\n {\n this.CurrentLine += pLineString[i];\n }\n }\n\n // See if we are in a multiline quoted entry -- if not, emit the row.\n if (!this.InQuote)\n {\n // Push the last remaining column from the buffer to the current line.\n this.pushLine();\n\n // Check to see if there is a header -- and if so, if this is the header row\n if (this.HasHeader && !this.HasSetHeader && (this.RowsEmitted == this.HeaderLineIndex))\n {\n this.HasSetHeader = true;\n // Override the format as json bit\n this.setHeader(this.emitRow(false));\n\n // No matter what, formatting this as JSON is silly and we don't want to go there anyway.\n if (this.EmitHeader)\n {\n return this.Header;\n }\n else\n {\n return false;\n }\n }\n else\n {\n return this.emitRow();\n }\n }\n else\n {\n return false;\n }\n };\n}\n\nmodule.exports = CSVParser;","const libFableServiceProviderBase = require('fable-serviceproviderbase');\n/**\n* Data Formatting and Translation Functions\n*\n* @class DataFormat\n*/\nclass DataFormat extends libFableServiceProviderBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash)\n\n\t\tthis.serviceType = 'DataArithmatic';\n\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_formatterCleanNonAlphaChar = /[^a-zA-Z]/gi;\n\t\tthis._Regex_formatterCapitalizeEachWord = /([a-zA-Z]+)/g;\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\treturn 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\tlet tmpHash = 0;\n\t\tlet tmpStringLength = pString.length;\n\t\tlet tmpCharacterIndex = 0;\n\n\t\twhile (tmpCharacterIndex < tmpStringLength)\n\t\t{\n\t\t\ttmpHash = (tmpHash << 5) - tmpHash + pString.charCodeAt(tmpCharacterIndex++) | 0;\n\t\t}\n\n\t\treturn `${this._Value_Prefix_StringHash}${tmpHash}`;\n\t}\n\n\tcapitalizeEachWord (pString)\n\t{\n\t\treturn pString.replace(this._Regex_formatterCapitalizeEachWord,\n\t\t\t(pMatch) =>\n\t\t\t{\n\t\t\t\treturn pMatch.charAt(0).toUpperCase() + pMatch.substr(1);\n\t\t\t});\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 * Clean a string of any non-alpha characters (including numbers)\n\t *\n\t * @param {*} pString\n\t * @returns\n\t */\n\tcleanNonAlphaCharacters (pString)\n\t{\n\t\tif ((typeof(pString) == 'string') && (pString != ''))\n\t\t{\n\t\t\treturn pString.replace(this._Regex_formatterCleanNonAlphaChar, this._Value_Clean_formatterCleanNonAlpha);\n\t\t}\n\n\t\treturn '';\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\t// Reverse, because it's easier to do things from the left, given arbitrary digit counts\n\t\tlet tmpReversed = this.stringReverse(pString);\n\t\t// Add commas every three characters\n\t\tlet tmpReversedWithCommas = tmpReversed.match(this._Regex_formatterInsertCommas).join(',');\n\t\t// Reverse again (back to normal direction)\n\t\treturn 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\t// If the regex doesn't match, `replace` returns the string unmodified\n\t\treturn (pNumber.toString()).replace\n\t\t(\n\t\t\tthis._Regex_formatterAddCommasToNumber,\n\t\t\tthis.processAddCommasToNumberRegex.bind(this)\n\t\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\tif (isNaN(pValue))\n\t\t{\n\t\t\treturn this._Value_NaN_Currency;\n\t\t}\n\n\t\tif (pValue === null || pValue === undefined)\n\t\t{\n\t\t\treturn this._Value_NaN_Currency;\n\t\t}\n\n\t\tlet tmpDollarAmountArbitrary = this.fable.Utility.bigNumber(pValue);\n\t\tlet tmpDollarAmount = tmpDollarAmountArbitrary.toFixed(2);\n\n\t\tif (isNaN(tmpDollarAmount))\n\t\t{\n\t\t\t// Try again and see if what was passed in was a dollars string.\n\t\t\tif (typeof(pValue) == 'string')\n\t\t\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\t\t\ttmpDollarAmount = parseFloat(pValue.replace(this._Value_MoneySign_Currency,'').replace(this._Regex_formatterDollarsRemoveCommas,'')).toFixed(2);\n\t\t\t}\n\t\t\t// If we didn't get a number, return the \"not a number\" string.\n\t\t\tif (isNaN(tmpDollarAmount))\n\t\t\t{\n\t\t\t\treturn this._Value_NaN_Currency;\n\t\t\t}\n\t\t}\n\n\t\t// TODO: Get locale data and use that for this stuff.\n\t\treturn `$${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\tlet tmpDigits = (typeof(pDigits) == 'undefined') ? 2 : pDigits;\n\n\t\tif (isNaN(pValue))\n\t\t{\n\t\t\tlet tmpZed = 0;\n\t\t\treturn tmpZed.toFixed(tmpDigits);\n\t\t}\n\n\t\tif (pValue === null || pValue === undefined)\n\t\t{\n\t\t\treturn '';\n\t\t}\n\n\t\tlet tmpAmountArbitrary = this.fable.Utility.bigNumber(pValue);\n\t\tlet tmpValue = tmpAmountArbitrary.toFixed(tmpDigits);\n\n\t\tif (isNaN(tmpValue))\n\t\t{\n\t\t\tlet tmpZed = 0;\n\t\t\treturn tmpZed.toFixed(tmpDigits);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn tmpValue;\n\t\t}\n\t}\n\n\n\t/**\n\t * Generate a reapeating padding string to be appended before or after depending on \n\t * which padding function it uses.\n\t *\n\t * @param {*} pString\n\t * @param {number} pTargetLength\n\t * @returns {string} pPadString\n\t */\n\tstringGeneratePaddingString(pString, pTargetLength, pPadString)\n\t{\n\t\tlet tmpTargetLength = pTargetLength >> 0;\n\t\tlet tmpPadString = String((typeof pPadString !== 'undefined' ? pPadString : ' '));\n\t\tif (pString.length > pTargetLength)\n\t\t{\n\t\t\t// No padding string if the source string is already longer than the target length, return an empty string\n\t\t\treturn '';\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlet tmpPadLength = pTargetLength - pString.length;\n\t\t\tif (tmpPadLength > tmpPadString.length)\n\t\t\t{\n\t\t\t\ttmpPadString += tmpPadString.repeat(tmpTargetLength / tmpPadString.length);\n\t\t\t}\n\t\t\treturn tmpPadString.slice(0, tmpPadLength);\n\t\t}\n\t}\n\n\t/**\n\t * Pad the start of a string.\n\t *\n\t * @param {*} pString\n\t * @param {number} pTargetLength\n\t * @returns {string} pPadString\n\t */\n\tstringPadStart = function(pString, pTargetLength, pPadString)\n\t{\n\t\tlet tmpString = pString.toString();\n\t\treturn this.stringGeneratePaddingString(tmpString, pTargetLength, pPadString) + tmpString;\n\t}\n\n\t/**\n\t * Pad the end of a string.\n\t *\n\t * @param {*} pString\n\t * @param {number} pTargetLength\n\t * @returns {string} pPadString\n\t */\n\tstringPadEnd = function(pString, pTargetLength, pPadString)\n\t{\n\t\tlet tmpString = pString.toString();\n\t\treturn tmpString + this.stringGeneratePaddingString(tmpString, pTargetLength, pPadString);\n\t}\n\n\t/*************************************************************************\n\t * Time Formatting Functions (milliseconds)\n\t *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/\n\n\t/**\n\t * Format a time length in milliseconds into a human readable string.\n\t * @param {number} pTimeSpan \n\t * @returns {string} - HH:MM:SS.mmm\n\t */\n\tformatTimeSpan(pTimeSpan)\n\t{\n\t\tif (typeof(pTimeSpan) != 'number')\n\t\t{\n\t\t\treturn '';\n\t\t}\n\n\t\tlet tmpMs = parseInt(pTimeSpan%1000);\n\t\tlet tmpSeconds = parseInt((pTimeSpan/1000)%60);\n\t\tlet tmpMinutes = parseInt((pTimeSpan/(1000*60))%60);\n\t\tlet tmpHours = parseInt(pTimeSpan/(1000*60*60));\n\n\t\treturn `${this.stringPadStart(tmpHours,2,'0')}:${this.stringPadStart(tmpMinutes,2,'0')}:${this.stringPadStart(tmpSeconds,2,'0')}.${this.stringPadStart(tmpMs,3,'0')}`;\n\t}\n\n\t/**\n\t * Format the time delta between two times in milliseconds into a human readable string.\n\t * \n\t * @param {number} pTimeStart \n\t * @param {number} pTimeEnd \n\t * @returns {string} - HH:MM:SS.mmm\n\t */\n\tformatTimeDelta(pTimeStart, pTimeEnd)\n\t{\n\t\tif ((typeof(pTimeStart) != 'number') || (typeof(pTimeEnd) != 'number'))\n\t\t{\n\t\t\treturn '';\n\t\t}\n\n\t\treturn this.formatTimeSpan(pTimeEnd-pTimeStart);\n\t}\n\n\t// THE FOLLOWING TERRIBLE FUNCTIONS ARE FOR QT / WKHTMLTOPDF when luxon and moment don't work so well\n\tgetMonthFromDate (pJavascriptDate)\n\t{\n\t\tvar tmpMonths = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"];\n\t\treturn tmpMonths[pJavascriptDate.getMonth()];\n\t}\n\n\tgetMonthAbbreviatedFromDate (pJavascriptDate)\n\t{\n\t\tvar tmpMonths = [\"Jan\", \"Feb\", \"Mar\", \"Apr\", \"May\", \"Jun\", \"Jul\", \"Aug\", \"Sep\", \"Oct\", \"Nov\", \"Dec\"];\n\t\treturn tmpMonths[pJavascriptDate.getMonth()];\n\t}\n\n\tformatMonthDayYearFromDate (pJavascriptDate, pStrict)\n\t{\n\t\tlet tmpStrict = (typeof(pStrict) !== 'undefined') ? pStrict : false;\n\n\t\tlet tmpMonth = pJavascriptDate.getMonth() + 1;\n\t\tlet tmpDay = pJavascriptDate.getDate();\n\t\tlet tmpYear = pJavascriptDate.getFullYear();\n\t\t\n\t\tif (tmpStrict)\n\t\t{\n\t\t\ttmpMonth = this.stringPadStart(tmpMonth, 2, '0');\n\t\t\ttmpDay = this.stringPadStart(tmpDay, 2, '0');\n\t\t\ttmpYear = this.stringPadStart(tmpYear, 4, '0');\n\t\t}\n\n\t\treturn `${tmpMonth}/${tmpDay}/${tmpYear}`;\n\t}\n\t\n\tformatSortableStringFromDate (pDate)\n\t{\n\t\treturn pDate.getFullYear()+this.stringPadStart(pDate.getMonth(),2,'0')+this.stringPadStart(pDate.getDate(),2,'0');\n\t}\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\tlet tmpStringSplitLocation = pString.indexOf(pMatch);\n\n\t\tif ((tmpStringSplitLocation < 0) || ((tmpStringSplitLocation + pMatch.length) >= pString.length))\n\t\t{\n\t\t\treturn '';\n\t\t}\n\n\t\treturn 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\tlet tmpString = (typeof(pString) == 'string') ? pString : '';\n\t\tlet tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t\tlet tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t\tlet tmpEnclosureCount = 0;\n\t\tlet tmpEnclosureDepth = 0;\n\t\tfor (let i = 0; i < tmpString.length; i++)\n\t\t{\n\t\t\t// This is the start of an enclosure\n\t\t\tif (tmpString[i] == tmpEnclosureStart)\n\t\t\t{\n\t\t\t\tif (tmpEnclosureDepth == 0)\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureCount++;\n\t\t\t\t}\n\t\t\t\ttmpEnclosureDepth++;\n\t\t\t}\n\t\t\telse if (tmpString[i] == tmpEnclosureEnd)\n\t\t\t{\n\t\t\t\ttmpEnclosureDepth--;\n\t\t\t}\n\t\t}\n\n\t\treturn 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\tlet tmpString = (typeof(pString) == 'string') ? pString : '';\n\t\tlet tmpEnclosureIndexToGet = (typeof(pEnclosureIndexToGet) == 'number') ? pEnclosureIndexToGet : 0;\n\t\tlet tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t\tlet tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t\tlet tmpEnclosureCount = 0;\n\t\tlet tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t\tlet tmpEnclosedValueStartIndex = 0;\n\t\tlet tmpEnclosedValueEndIndex = 0;\n\n\t\tfor (let i = 0; i < tmpString.length; i++)\n\t\t{\n\t\t\t// This is the start of an enclosure\n\t\t\tif (tmpString[i] == tmpEnclosureStart)\n\t\t\t{\n\t\t\t\ttmpEnclosureDepth++;\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\t\t}\n\t\t\t// This is the end of an enclosure\n\t\t\telse if (tmpString[i] == tmpEnclosureEnd)\n\t\t\t{\n\t\t\t\ttmpEnclosureDepth--;\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\t\t}\n\t\t}\n\n\t\tif (tmpEnclosureCount <= tmpEnclosureIndexToGet)\n\t\t{\n\t\t\t// Return an empty string if the enclosure is not found\n\t\t\treturn '';\n\t\t}\n\n\t\tif ((tmpEnclosedValueEndIndex > 0) && (tmpEnclosedValueEndIndex > tmpEnclosedValueStartIndex))\n\t\t{\n\t\t\treturn tmpString.substring(tmpEnclosedValueStartIndex+1, tmpEnclosedValueEndIndex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn tmpString.substring(tmpEnclosedValueStartIndex+1);\n\t\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\tlet tmpString = (typeof(pString) == 'string') ? pString : '';\n\t\tlet tmpEnclosureIndexToRemove = (typeof(pEnclosureIndexToRemove) == 'number') ? pEnclosureIndexToRemove : 0;\n\t\tlet tmpEnclosureStart = (typeof(pEnclosureStart) == 'string') ? pEnclosureStart : '(';\n\t\tlet tmpEnclosureEnd = (typeof(pEnclosureEnd) == 'string') ? pEnclosureEnd : ')';\n\n\t\tlet tmpEnclosureCount = 0;\n\t\tlet tmpEnclosureDepth = 0;\n\n\t\tlet tmpMatchedEnclosureIndex = false;\n\t\tlet tmpEnclosureStartIndex = 0;\n\t\tlet tmpEnclosureEndIndex = 0;\n\n\t\tfor (let i = 0; i < tmpString.length; i++)\n\t\t{\n\t\t\t// This is the start of an enclosure\n\t\t\tif (tmpString[i] == tmpEnclosureStart)\n\t\t\t{\n\t\t\t\ttmpEnclosureDepth++;\n\n\t\t\t\tif (tmpEnclosureDepth == 1)\n\t\t\t\t{\n\t\t\t\t\ttmpEnclosureCount++;\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\t\t\t}\n\t\t\t}\n\t\t\telse if (tmpString[i] == tmpEnclosureEnd)\n\t\t\t{\n\t\t\t\ttmpEnclosureDepth--;\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\t\t}\n\t\t}\n\n\t\tif (tmpEnclosureCount <= tmpEnclosureIndexToRemove)\n\t\t{\n\t\t\treturn tmpString;\n\t\t}\n\n\t\tlet tmpReturnString = '';\n\n\t\tif (tmpEnclosureStartIndex > 1)\n\t\t{\n\t\t\ttmpReturnString = tmpString.substring(0, tmpEnclosureStartIndex);\n\t\t}\n\n\t\tif ((tmpString.length > (tmpEnclosureEndIndex + 1)) && (tmpEnclosureEndIndex > tmpEnclosureStartIndex))\n\t\t{\n\t\t\ttmpReturnString += tmpString.substring(tmpEnclosureEndIndex+1);\n\t\t}\n\n\t\treturn tmpReturnString;\n\t}\n}\n\nmodule.exports = DataFormat;","module.exports={\n\t\"DefaultIntegerMinimum\": 0,\n\t\"DefaultIntegerMaximum\": 9999999,\n\n\t\"DefaultNumericStringLength\": 10,\n\n\t\"MonthSet\": [\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"],\n\n\t\"WeekDaySet\":[\"Sunday\",\"Monday\",\"Tuesday\",\"Wednesday\",\"Thursday\",\"Friday\",\"Saturday\"],\n\n\t\"ColorSet\": \n\t\t[\n\t\t\t\"Red\", \"Orange\", \"Yellow\", \"Green\", \"Blue\", \"Indigo\", \"Violet\", \"Pink\", \"Purple\", \"Turquoise\", \"Gold\",\n\t\t\t\"Lime\", \"Maroon\", \"Navy\", \"Coral\", \"Teal\", \"Brown\", \"White\", \"Black\", \"Sky\", \"Berry\",\n\t\t\t\"Grey\", \"Straw\", \"Silver\", \"Sapphire\"\n\t\t],\n\n\t\"SurNameSet\":\n\t\t[\n\t\t\t\"Smith\", \"Johnson\", \"Williams\", \"Brown\", \"Jones\", \"Miller\", \"Davis\", \"Garcia\", \"Rodriguez\", \"Wilson\",\n\t\t\t\"Martinez\", \"Anderson\", \"Taylor\", \"Thomas\", \"Hernandez\", \"Moore\", \"Martin\", \"Jackson\", \"Thompson\", \"White\",\n\t\t\t\"Lopez\", \"Lee\", \"Gonzalez\", \"Harris\", \"Clark\", \"Lewis\", \"Robinson\", \"Walker\", \"Perez\", \"Hall\",\n\t\t\t\"Young\", \"Allen\", \"Sanchez\", \"Wright\", \"King\", \"Scott\", \"Green\", \"Baker\", \"Adams\", \"Nelson\",\n\t\t\t\"Hill\", \"Ramirez\", \"Campbell\", \"Mitchell\", \"Roberts\", \"Carter\", \"Phillips\", \"Evans\", \"Turner\", \"Torres\",\n\t\t\t\"Parker\", \"Collins\", \"Edwards\", \"Stewart\", \"Flores\", \"Morris\", \"Nguyen\", \"Murphy\", \"Rivera\", \"Cook\",\n\t\t\t\"Rogers\", \"Morgan\", \"Peterson\", \"Cooper\", \"Reed\", \"Bailey\", \"Bell\", \"Gomez\", \"Kelly\", \"Howard\",\n\t\t\t\"Ward\", \"Cox\", \"Diaz\", \"Richardson\", \"Wood\", \"Watson\", \"Brooks\", \"Bennett\", \"Gray\", \"James\",\n\t\t\t\"Reyes\", \"Cruz\", \"Hughes\", \"Price\", \"Myers\", \"Long\", \"Foster\", \"Sanders\", \"Ross\", \"Morales\",\n\t\t\t\"Powell\", \"Sullivan\", \"Russell\", \"Ortiz\", \"Jenkins\", \"Gutierrez\", \"Perry\", \"Butler\", \"Barnes\", \"Fisher\"\n\t\t],\n\n\t\"NameSet\":\n\t\t[\n\t\t\t\"Mary\", \"Patricia\", \"Jennifer\", \"Linda\", \"Elizabeth\", \"Barbara\", \"Susan\", \"Jessica\", \"Sarah\", \"Karen\",\n\t\t\t\"Lisa\", \"Nancy\", \"Betty\", \"Sandra\", \"Margaret\", \"Ashley\", \"Kimberly\", \"Emily\", \"Donna\", \"Michelle\",\n\t\t\t\"Carol\", \"Amanda\", \"Melissa\", \"Deborah\", \"Stephanie\", \"Dorothy\", \"Rebecca\", \"Sharon\", \"Laura\", \"Cynthia\",\n\t\t\t\"Amy\", \"Kathleen\", \"Angela\", \"Shirley\", \"Brenda\", \"Emma\", \"Anna\", \"Pamela\", \"Nicole\", \"Samantha\",\n\t\t\t\"Katherine\", \"Christine\", \"Helen\", \"Debra\", \"Rachel\", \"Carolyn\", \"Janet\", \"Maria\", \"Catherine\", \"Heather\",\n\t\t\t\"Diane\", \"Olivia\", \"Julie\", \"Joyce\", \"Victoria\", \"Ruth\", \"Virginia\", \"Lauren\", \"Kelly\", \"Christina\",\n\t\t\t\"Joan\", \"Evelyn\", \"Judith\", \"Andrea\", \"Hannah\", \"Megan\", \"Cheryl\", \"Jacqueline\", \"Martha\", \"Madison\",\n\t\t\t\"Teresa\", \"Gloria\", \"Sara\", \"Janice\", \"Ann\", \"Kathryn\", \"Abigail\", \"Sophia\", \"Frances\", \"Jean\",\n\t\t\t\"Alice\", \"Judy\", \"Isabella\", \"Julia\", \"Grace\", \"Amber\", \"Denise\", \"Danielle\", \"Marilyn\", \"Beverly\",\n\t\t\t\"Charlotte\", \"Natalie\", \"Theresa\", \"Diana\", \"Brittany\", \"Doris\", \"Kayla\", \"Alexis\", \"Lori\", \"Marie\",\n\t\t\t\"James\", \"Robert\", \"John\", \"Michael\", \"David\", \"William\", \"Richard\", \"Joseph\", \"Thomas\", \"Christopher\",\n\t\t\t\"Charles\", \"Daniel\", \"Matthew\", \"Anthony\", \"Mark\", \"Donald\", \"Steven\", \"Andrew\", \"Paul\", \"Joshua\",\n\t\t\t\"Kenneth\", \"Kevin\", \"Brian\", \"George\", \"Timothy\", \"Ronald\", \"Jason\", \"Edward\", \"Jeffrey\", \"Ryan\",\n\t\t\t\"Jacob\", \"Gary\", \"Nicholas\", \"Eric\", \"Jonathan\", \"Stephen\", \"Larry\", \"Justin\", \"Scott\", \"Brandon\",\n\t\t\t\"Benjamin\", \"Samuel\", \"Gregory\", \"Alexander\", \"Patrick\", \"Frank\", \"Raymond\", \"Jack\", \"Dennis\", \"Jerry\",\n\t\t\t\"Tyler\", \"Aaron\", \"Jose\", \"Adam\", \"Nathan\", \"Henry\", \"Zachary\", \"Douglas\", \"Peter\", \"Kyle\",\n\t\t\t\"Noah\", \"Ethan\", \"Jeremy\", \"Walter\", \"Christian\", \"Keith\", \"Roger\", \"Terry\", \"Austin\", \"Sean\",\n\t\t\t\"Gerald\", \"Carl\", \"Harold\", \"Dylan\", \"Arthur\", \"Lawrence\", \"Jordan\", \"Jesse\", \"Bryan\", \"Billy\",\n\t\t\t\"Bruce\", \"Gabriel\", \"Joe\", \"Logan\", \"Alan\", \"Juan\", \"Albert\", \"Willie\", \"Elijah\", \"Wayne\",\n\t\t\t\"Randy\", \"Vincent\", \"Mason\", \"Roy\", \"Ralph\", \"Bobby\", \"Russell\", \"Bradley\", \"Philip\", \"Eugene\"\n\t\t]\n}","const libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nclass FableServiceDataGeneration extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash);\n\n\t\tthis.serviceType = 'DataGeneration';\n\n\t\tthis.defaultData = require('./Fable-Service-DataGeneration-DefaultValues.json');\n\t}\n\n\t// Return a random integer between pMinimum and pMaximum\n\trandomIntegerBetween(pMinimum, pMaximum)\n\t{\n\t\treturn Math.floor(Math.random() * (pMaximum - pMinimum)) + pMinimum;\n\t}\n\t// Return a random integer up to the passed-in maximum\n\trandomIntegerUpTo(pMaximum)\n\t{\n\t\treturn this.randomIntegerBetween(0, pMaximum);\n\t}\n\t// Return a random integer between 0 and 9999999\n\trandomInteger()\n\t{\n\t\treturn Math.floor(Math.random()*this.defaultData.DefaultIntegerMaximum);\n\t}\n\n\n\trandomNumericString(pLength, pMaxNumber)\n\t{\n\t\tlet tmpLength = (typeof(pLength) === 'undefined') ? 10 : pLength;\n\t\tlet tmpMaxNumber = (typeof(pMaxNumber) === 'undefined') ? ((10 ** tmpLength) - 1) : pMaxNumber;\n\n\t\treturn this.services.DataFormat.stringPadStart(this.randomIntegerUpTo(tmpMaxNumber), pLength, '0');\n\t}\n\n\n\trandomMonth()\n\t{\n\t\treturn this.defaultData.MonthSet[this.randomIntegerUpTo(this.defaultData.MonthSet.length-1)];\n\t}\n\trandomDayOfWeek()\n\t{\n\t\treturn this.defaultData.WeekDaySet[this.randomIntegerUpTo(this.defaultData.WeekDaySet.length-1)];\n\t}\n\n\n\trandomColor()\n\t{\n\t\treturn this.defaultData.ColorSet[this.randomIntegerUpTo(this.defaultData.ColorSet.length-1)];\n\t}\n\n\n\trandomName()\n\t{\n\t\treturn this.defaultData.NameSet[this.randomIntegerUpTo(this.defaultData.NameSet.length-1)];\n\t}\n\trandomSurname()\n\t{\n\t\treturn this.defaultData.SurNameSet[this.randomIntegerUpTo(this.defaultData.SurNameSet.length-1)];\n\t}\n}\n\nmodule.exports = FableServiceDataGeneration;","const libFableServiceProviderBase = require('fable-serviceproviderbase');\n/**\n* Date management a la Moment using days.js\n*\n* @class DateManipulation\n*/\nclass DateManipulation extends libFableServiceProviderBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash)\n\n\t\tthis.serviceType = 'Dates';\n\n\t\tthis.dayJS = require('dayjs');\n\n\t\t// Include the `weekOfYear` plugin\n\t\tthis.plugin_weekOfYear = require('dayjs/plugin/weekOfYear');\n\t\tthis.dayJS.extend(this.plugin_weekOfYear);\n\t\t// Include the `weekday` plugin\n\t\tthis.plugin_weekday = require('dayjs/plugin/weekday');\n\t\tthis.dayJS.extend(this.plugin_weekday);\n\t\t// Include the `isoWeek` plugin\n\t\tthis.plugin_isoWeek = require('dayjs/plugin/isoWeek');\n\t\tthis.dayJS.extend(this.plugin_isoWeek);\n\t\t// Include the `timezone` plugin\n\t\tthis.plugin_timezone = require('dayjs/plugin/timezone');\n\t\tthis.dayJS.extend(this.plugin_timezone);\n\t\t// Include the `relativetime` plugin\n\t\tthis.plugin_relativetime = require('dayjs/plugin/relativeTime');\n\t\tthis.dayJS.extend(this.plugin_relativetime);\n\t\t// Include the `utc` plugin\n\t\tthis.plugin_utc = require('dayjs/plugin/utc');\n\t\tthis.dayJS.extend(this.plugin_utc);\n\t\t// Include the `advancedFormat` plugin\n\t\tthis.plugin_advancedFormat = require('dayjs/plugin/advancedFormat');\n\t\tthis.dayJS.extend(this.plugin_advancedFormat);\n\n\t\t// A developer can include locales if they want\n\t\t// You would do the following:\n\t\t// const localeDE = require('dayjs/locale/de');\n\t\t// _Fable.Dates.dayJS.locale('de');\n\t}\n}\n\nmodule.exports = DateManipulation;","const libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nclass FableServiceEnvironmentData extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n this.serviceType = 'EnvironmentData';\n\n\t\tthis.Environment = `node.js`;\n\t}\n}\n\nmodule.exports = FableServiceEnvironmentData;","const libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nconst libFS = require('fs');\nconst libPath = require('path');\nconst libReadline = require('readline');\n\n\nclass FableServiceFilePersistence extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash);\n\n\t\tthis.serviceType = 'FilePersistence';\n\n\t\tif (!this.options.hasOwnProperty('Mode'))\n\t\t{\n\t\t\tthis.options.Mode = parseInt('0777', 8) & ~process.umask();\n\t\t}\n\n\t\tthis.libFS = libFS;\n\t\tthis.libPath = libPath;\n\t\tthis.libReadline = libReadline;\n\t}\n\n\tjoinPath(...pPathArray)\n\t{\n\t\treturn libPath.resolve(...pPathArray);\n\t}\n\n\texistsSync(pPath)\n\t{\n\t\treturn libFS.existsSync(pPath);\n\t}\n\n\texists(pPath, fCallback)\n\t{\n\t\tlet tmpFileExists = this.existsSync(pPath);;\n\n\t\treturn fCallback(null, tmpFileExists);\n\t}\n\n\twriteFileSync(pFileName, pFileContent, pOptions)\n\t{\n\t\tlet tmpOptions = (typeof(pOptions) === 'undefined') ? 'utf8' : pOptions;\n\t\treturn libFS.writeFileSync(pFileName, pFileContent, tmpOptions);\n\t}\n\n\tappendFileSync(pFileName, pAppendContent, pOptions)\n\t{\n\t\tlet tmpOptions = (typeof(pOptions) === 'undefined') ? 'utf8' : pOptions;\n\t\treturn libFS.appendFileSync(pFileName, pAppendContent, tmpOptions);\n\t}\n\n\tdeleteFileSync(pFileName)\n\t{\n\t\treturn libFS.unlinkSync(pFileName);\n\t}\n\n\tdeleteFolderSync(pFileName)\n\t{\n\t\treturn libFS.rmdirSync(pFileName);\n\t}\n\n\twriteFileSyncFromObject(pFileName, pObject)\n\t{\n\t\treturn this.writeFileSync(pFileName, JSON.stringify(pObject, null, 4));\n\t}\n\n\twriteFileSyncFromArray(pFileName, pFileArray)\n\t{\n\t\tif (!Array.isArray(pFileArray))\n\t\t{\n\t\t\tthis.log.error(`File Persistence Service attempted to write ${pFileName} from array but the expected array was not an array (it was a ${typeof(pFileArray)}).`);\n\t\t\treturn Error('Attempted to write ${pFileName} from array but the expected array was not an array (it was a ${typeof(pFileArray)}).');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (let i = 0; i < pFileArray.length; i++)\n\t\t\t{\n\t\t\t\treturn this.appendFileSync(pFileName, `${pFileArray[i]}\\n`);\n\t\t\t}\n\t\t}\n\t}\n\n\tlineReaderFactory(pFilePath, fOnLine, fOnComplete, fOnError)\n\t{\n\t\tlet tmpLineReader = {};\n\n\t\tif (typeof(pFilePath) != 'string')\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\ttmpLineReader.filePath = pFilePath;\n\n\t\ttmpLineReader.fileStream = libFS.createReadStream(tmpLineReader.filePath);\n\n\t\ttmpLineReader.reader = libReadline.createInterface({ input: tmpLineReader.fileStream, crlfDelay: Infinity });\n\n\t\tif (typeof(fOnError) === 'function')\n\t\t{\n\t\t\ttmpLineReader.reader.on('error', fOnError);\n\t\t}\n\n\t\ttmpLineReader.reader.on('line', (typeof(fOnLine) === 'function') ? fOnLine : () => {});\n\n\t\tif (typeof(fOnComplete) === 'function')\n\t\t{\n\t\t\ttmpLineReader.reader.on('close', fOnComplete);\n\t\t}\n\n\t\treturn tmpLineReader;\n\t}\n\n\t// Folder management\n\tmakeFolderRecursive(pParameters, fCallback)\n\t{\n\t\tlet tmpParameters = pParameters;\n\n\t\tif (typeof(pParameters) == 'string')\n\t\t{\n\t\t\ttmpParameters = { Path: pParameters };\n\t\t}\n\t\telse if (typeof(pParameters) !== 'object')\n\t\t{\n\t\t\tfCallback(new Error('Parameters object or string not properly passed to recursive folder create.'));\n\t\t\treturn false;\n\t\t}\n\n\t\tif ((typeof(tmpParameters.Path) !== 'string'))\n\t\t{\n\t\t\tfCallback(new Error('Parameters object needs a path to run the folder create operation.'));\n\t\t\treturn false;\n\t\t}\n\n\t\tif (!tmpParameters.hasOwnProperty('Mode'))\n\t\t{\n\t\t\ttmpParameters.Mode = this.options.Mode;\n\t\t}\n\n\t\t// Check if we are just starting .. if so, build the initial state for our recursive function\n\t\tif (typeof(tmpParameters.CurrentPathIndex) === 'undefined')\n\t\t{\n\t\t\t// Build the tools to start recursing\n\t\t\ttmpParameters.ActualPath = libPath.normalize(tmpParameters.Path);\n\t\t\ttmpParameters.ActualPathParts = tmpParameters.ActualPath.split(libPath.sep);\n\t\t\ttmpParameters.CurrentPathIndex = 0;\n\t\t\ttmpParameters.CurrentPath = '';\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// This is not our first run, so we will continue the recursion.\n\t\t\t// Build the new base path\n\t\t\tif (tmpParameters.CurrentPath == libPath.sep)\n\t\t\t{\n\t\t\t\ttmpParameters.CurrentPath = tmpParameters.CurrentPath + tmpParameters.ActualPathParts[tmpParameters.CurrentPathIndex];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttmpParameters.CurrentPath = tmpParameters.CurrentPath + libPath.sep + tmpParameters.ActualPathParts[tmpParameters.CurrentPathIndex];\n\t\t\t}\n\n\t\t\t// Increment the path index\n\t\t\ttmpParameters.CurrentPathIndex++;\n\t\t}\n\n\t\t// Check if the path is fully complete\n\t\tif (tmpParameters.CurrentPathIndex >= tmpParameters.ActualPathParts.length)\n\t\t{\n\t\t\treturn fCallback(null);\n\t\t}\n\n\t\t// Check if the path exists (and is a folder)\n\t\tlibFS.open(tmpParameters.CurrentPath + libPath.sep + tmpParameters.ActualPathParts[tmpParameters.CurrentPathIndex], 'r',\n\t\t\t(pError, pFileDescriptor)=>\n\t\t\t{\n\t\t\t\tif (pFileDescriptor)\n\t\t\t\t{\n\t\t\t\t\tlibFS.closeSync(pFileDescriptor);\n\t\t\t\t}\n\n\t\t\t\tif (pError && pError.code=='ENOENT')\n\t\t\t\t{\n\t\t\t\t\t/* Path doesn't exist, create it */\n\t\t\t\t\tlibFS.mkdir(tmpParameters.CurrentPath + libPath.sep + tmpParameters.ActualPathParts[tmpParameters.CurrentPathIndex], tmpParameters.Mode,\n\t\t\t\t\t\t(pCreateError) =>\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (!pCreateError)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t// We have now created our folder and there was no error -- continue.\n\t\t\t\t\t\t\t\treturn this.makeFolderRecursive(tmpParameters, fCallback);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (pCreateError.code =='EEXIST')\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t// The folder exists -- our dev might be running this in parallel/async/whatnot.\n\t\t\t\t\t\t\t\treturn this.makeFolderRecursive(tmpParameters, fCallback);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconsole.log(pCreateError.code);\n\t\t\t\t\t\t\t\treturn fCallback(pCreateError);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\treturn this.makeFolderRecursive(tmpParameters, fCallback);\n\t\t\t\t}\n\t\t\t});\n\t}\n}\n\nmodule.exports = FableServiceFilePersistence;","const libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\n/**\n* Precedent Meta-Templating\n* @author Steven Velozo <steven@velozo.com>\n* @description Process text stream trie and postfix tree, parsing out meta-template expression functions.\n*/\nconst libWordTree = require(`./Fable-Service-MetaTemplate/MetaTemplate-WordTree.js`);\nconst libStringParser = require(`./Fable-Service-MetaTemplate/MetaTemplate-StringParser.js`);\n\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\t\tthis.WordTree = new libWordTree();\n\n\t\t// In order to allow asynchronous template processing we need to use the async.eachLimit function\n\t\tthis.StringParser = new libStringParser(this.fable.services.Utility.eachLimit);\n\n\t\tthis.ParseTree = this.WordTree.ParseTree;\n\t}\n\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\taddPatternAsync(pPatternStart, pPatternEnd, pParserPromise)\n\t{\n\t\treturn this.WordTree.addPatternAsync(pPatternStart, pPatternEnd, pParserPromise);\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, fCallback)\n\t{\n\t\treturn this.StringParser.parseString(pString, this.ParseTree, pData, fCallback);\n\t}\n}\n\nmodule.exports = FableServiceMetaTemplate;","/**\n* String Parser\n* @author Steven Velozo <steven@velozo.com>\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(fEachLimit)\n\t{\n\t\tthis.eachLimit = fEachLimit;\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\tAsynchronous: false,\n\n\t\t\tOutput: '',\n\t\t\tOutputBuffer: '',\n\n\t\t\tPattern: {},\n\n\t\t\tPatternMatch: false,\n\t\t\tPatternMatchEnd: false\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\tresetOutputBuffer (pParserState)\n\t{\n\t\t// Flush the output buffer.\n\t\tthis.flushOutputBuffer(pParserState);\n\t\t// End pattern mode\n\t\tpParserState.Pattern = false;\n\t\tpParserState.PatternStartNode = false;\n\t\tpParserState.StartPatternMatchComplete = false;\n\t\tpParserState.EndPatternMatchBegan = false;\n\t\tpParserState.PatternMatch = false;\n\n\t\treturn true;\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// If we are already in a pattern match traversal\n\t\tif (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern is still matching the start and we haven't passed the buffer\n\t\t\tif (!pParserState.StartPatternMatchComplete && pParserState.Pattern.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\tpParserState.Pattern = pParserState.Pattern[pCharacter];\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t\telse if (pParserState.EndPatternMatchBegan)\n\t\t\t{\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// Flush the output buffer.\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\t// Run the function\n\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\treturn this.resetOutputBuffer(pParserState);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (pParserState.PatternStartNode.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// We broke out of the end -- see if this is a new start of the end.\n\t\t\t\t\tpParserState.Pattern = pParserState.PatternStartNode.PatternEnd[pCharacter];\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpParserState.EndPatternMatchBegan = false;\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (pParserState.Pattern.hasOwnProperty('PatternEnd'))\n\t\t\t{\n\t\t\t\tif (!pParserState.StartPatternMatchComplete)\n\t\t\t\t{\n\t\t\t\t\tpParserState.StartPatternMatchComplete = true;\n\t\t\t\t\tpParserState.PatternStartNode = pParserState.Pattern;\n\t\t\t\t}\n\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This is the first character of the end pattern.\n\t\t\t\t\tpParserState.EndPatternMatchBegan = true;\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\tif (pParserState.Pattern.isAsync)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tthis.log.error(`MetaTemplate: The pattern ${pParserState.Pattern.PatternStartString} is asynchronous and cannot be used in a synchronous parser.`);\n\t\t\t\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Run the t*mplate function\n\t\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\t\treturn this.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// We are in a pattern start but didn't match one; reset and start trying again from this character.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t}\n\t\t}\n\t\t// If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\tif (!pParserState.PatternMatch)\n\t\t{\n\t\t\t// This may be the start of a new pattern....\n\t\t\tif (pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// ... assign the root node as the matched node.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\tpParserState.Pattern = pParserState.ParseTree[pCharacter];\n\t\t\t\tpParserState.PatternMatch = true;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t}\n\t\treturn false;\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\tparseCharacterAsync (pCharacter, pParserState, pData, fCallback)\n\t{\n\t\t// If we are already in a pattern match traversal\n\t\tif (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern is still matching the start and we haven't passed the buffer\n\t\t\tif (!pParserState.StartPatternMatchComplete && pParserState.Pattern.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\tpParserState.Pattern = pParserState.Pattern[pCharacter];\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t\telse if (pParserState.EndPatternMatchBegan)\n\t\t\t{\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// Flush the output buffer.\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\t// ... this is the end of a pattern, cut off the end tag and parse it.\n\t\t\t\t\t\t// Trim the start and end tags off the output buffer now\n\t\t\t\t\t\tif (pParserState.Pattern.isAsync)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Run the function\n\t\t\t\t\t\t\treturn pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData,\n\t\t\t\t\t\t\t\t(pError, pAsyncOutput) =>\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif (pError)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tconsole.log(`Precedent ERROR: Async template error happened parsing ${pParserState.Pattern.PatternStart} ... ${pParserState.Pattern.PatternEnd}: ${pError}`);\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tpParserState.OutputBuffer = pAsyncOutput;\n\t\t\t\t\t\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t\t\t\treturn fCallback();\n\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Run the t*mplate function\n\t\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t\treturn fCallback();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (pParserState.PatternStartNode.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// We broke out of the end -- see if this is a new start of the end.\n\t\t\t\t\tpParserState.Pattern = pParserState.PatternStartNode.PatternEnd[pCharacter];\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpParserState.EndPatternMatchBegan = false;\n\t\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (pParserState.Pattern.hasOwnProperty('PatternEnd'))\n\t\t\t{\n\t\t\t\tif (!pParserState.StartPatternMatchComplete)\n\t\t\t\t{\n\t\t\t\t\tpParserState.StartPatternMatchComplete = true;\n\t\t\t\t\tpParserState.PatternStartNode = pParserState.Pattern;\n\t\t\t\t}\n\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\n\t\t\t\tif (pParserState.Pattern.PatternEnd.hasOwnProperty(pCharacter))\n\t\t\t\t{\n\t\t\t\t\t// This is the first character of the end pattern.\n\t\t\t\t\tpParserState.EndPatternMatchBegan = true;\n\t\t\t\t\t// This leaf has a PatternEnd tree, so we will wait until that end is met.\n\t\t\t\t\tpParserState.Pattern = pParserState.Pattern.PatternEnd[pCharacter];\n\t\t\t\t\t// If this last character is the end of the pattern, parse it.\n\t\t\t\t\tif (pParserState.Pattern.hasOwnProperty('Parse'))\n\t\t\t\t\t{\n\t\t\t\t\t\t// ... this is the end of a pattern, cut off the end tag and parse it.\n\t\t\t\t\t\t// Trim the start and end tags off the output buffer now\n\t\t\t\t\t\tif (pParserState.Pattern.isAsync)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Run the function\n\t\t\t\t\t\t\treturn pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData,\n\t\t\t\t\t\t\t\t(pError, pAsyncOutput) =>\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif (pError)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tconsole.log(`Precedent ERROR: Async template error happened parsing ${pParserState.Pattern.PatternStart} ... ${pParserState.Pattern.PatternEnd}: ${pError}`);\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tpParserState.OutputBuffer = pAsyncOutput;\n\t\t\t\t\t\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t\t\t\treturn fCallback();\n\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Run the t*mplate function\n\t\t\t\t\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStartString.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStartString.length+pParserState.Pattern.PatternEndString.length)), pData);\n\t\t\t\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\t\t\t\treturn fCallback();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// We are in a pattern start but didn't match one; reset and start trying again from this character.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\treturn fCallback();\n\t\t\t}\n\t\t}\n\t\t// If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\tif (!pParserState.PatternMatch)\n\t\t{\n\t\t\t// This may be the start of a new pattern....\n\t\t\tif (pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// ... assign the root node as the matched node.\n\t\t\t\tthis.resetOutputBuffer(pParserState);\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t\tpParserState.Pattern = pParserState.ParseTree[pCharacter];\n\t\t\t\tpParserState.PatternMatch = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\t}\n\t\t}\n\t\treturn fCallback();\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 parameter\n\t * @param {function} fCallback - The callback function to call when the parse is complete\n\t */\n\tparseString (pString, pParseTree, pData, fCallback)\n\t{\n\t\tif (typeof(fCallback) !== 'function')\n\t\t{\n\t\t\tlet tmpParserState = this.newParserState(pParseTree);\n\n\t\t\tfor (var i = 0; i < pString.length; i++)\n\t\t\t{\n\t\t\t\t// TODO: This is not fast.\n\t\t\t\tthis.parseCharacter(pString[i], tmpParserState, pData, fCallback);\n\t\t\t}\n\n\t\t\tthis.flushOutputBuffer(tmpParserState);\n\n\t\t\treturn tmpParserState.Output;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// This is the async mode\n\t\t\tlet tmpParserState = this.newParserState(pParseTree);\n\t\t\ttmpParserState.Asynchronous = true;\n\n\t\t\tthis.eachLimit(pString, 1,\n\t\t\t\t(pCharacter, fCharacterCallback) =>\n\t\t\t\t{\n\t\t\t\t\tthis.parseCharacterAsync(pCharacter, tmpParserState, pData, fCharacterCallback);\n\t\t\t\t},\n\t\t\t\t(pError) =>\n\t\t\t\t{\n\t\t\t\t\t// Flush the remaining data\n\t\t\t\t\tthis.flushOutputBuffer(tmpParserState);\n\t\t\t\t\tfCallback(pError, tmpParserState.Output);\n\t\t\t\t});\n\n\t\t}\n\t}\n}\n\nmodule.exports = StringParser;\n","/**\n* Word Tree\n* @author Steven Velozo <steven@velozo.com>\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\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 * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddChild (pTree, pPattern)\n\t{\n\t\tif (!pTree.hasOwnProperty(pPattern))\n\t\t{\n\t\t\tpTree[pPattern] = {};\n\t\t}\n\n\t\treturn pTree[pPattern];\n\t}\n\n\t/**\n\t * Add a child character to a Parse Tree PatternEnd subtree\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 * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddEndChild (pTree, pPattern)\n\t{\n\t\tif (!pTree.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\tpTree.PatternEnd = {};\n\t\t}\n\n\t\tpTree.PatternEnd[pPattern] = {};\n\n\t\treturn pTree.PatternEnd[pPattern];\n\t}\n\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 {function} fParser - 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, fParser)\n\t{\n\t\tif (pPatternStart.length < 1)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tif ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length < 1))\n\t\t{\n\t\t\treturn false;\n\t\t}\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{\n\t\t\ttmpLeaf = this.addChild(tmpLeaf, pPatternStart[i], i);\n\t\t}\n\n\t\tif (!tmpLeaf.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\ttmpLeaf.PatternEnd = {};\n\t\t}\n\n\t\tlet tmpPatternEnd = (typeof(pPatternEnd) === 'string') ? pPatternEnd : pPatternStart;\n\t\tfor (let i = 0; i < tmpPatternEnd.length; i++)\n\t\t{\n\t\t\ttmpLeaf = this.addEndChild(tmpLeaf, tmpPatternEnd[i], i);\n\t\t}\n\n\t\ttmpLeaf.PatternStartString = pPatternStart;\n\t\ttmpLeaf.PatternEndString = tmpPatternEnd;\n\t\ttmpLeaf.Parse = (typeof(fParser) === 'function') ? fParser :\n\t\t\t\t\t\t(typeof(fParser) === 'string') ? () => { return fParser; } :\n\t\t\t\t\t\t(pData) => { return pData; };\n\n\t\treturn tmpLeaf;\n\t}\n\n\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 {function} fParser - 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\taddPatternAsync (pPatternStart, pPatternEnd, fParser)\n\t{\n\t\tlet tmpLeaf = this.addPattern(pPatternStart, pPatternEnd, fParser);\n\t\tif (tmpLeaf)\n\t\t{\n\t\t\ttmpLeaf.isAsync = true;\n\t\t}\n\t}\n}\n\nmodule.exports = WordTree;\n","module.exports = (\n {\n \"Metadata\": {\n \"UUID\": false,\n \"Hash\": false,\n\n \"Title\": \"\",\n \"Summary\": \"\",\n\n \"Version\": 0\n },\n \"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 },\n \"Errors\": [],\n \"Log\": []\n }\n);","const libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nconst _OperationStatePrototypeString = JSON.stringify(require('./Fable-Service-Operation-DefaultSettings.js'));\n\nclass FableOperation extends libFableServiceBase\n{\n\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n super(pFable, pOptions, pServiceHash);\n\n\t\t// Timestamps will just be the long ints\n\t\tthis.timeStamps = {};\n\t\t// ProgressTrackers have an object format of: {Hash:'SomeHash',EndTime:UINT,CurrentTime:UINT,TotalCount:INT,CurrentCount:INT}\n\t\tthis.progressTrackers = {};\n\n this.serviceType = 'PhasedOperation';\n\n\t\tthis.state = JSON.parse(_OperationStatePrototypeString);\n\n\t\t// Match the service instantiation to the operation.\n\t\tthis.state.Metadata.Hash = this.Hash;\n\t\tthis.state.Metadata.UUID = this.UUID;\n\n\t\tthis.name = (typeof(this.options.Name) == 'string') ? this.options.Name : `Unnamed Operation ${this.state.Metadata.UUID}`;\n\n\t\tthis.log = 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\t/************************************************************************\n\t * BEGINNING OF --> Telemetry Helpers\n\t */\n\tcreateTimeStamp(pTimeStampHash)\n\t{\n\t\tlet tmpTimeStampHash = (typeof(pTimeStampHash) == 'string') ? pTimeStampHash : 'Default';\n\t\tthis.timeStamps[tmpTimeStampHash] = +new Date();\n\t\treturn this.timeStamps[tmpTimeStampHash];\n\t}\n\n\tgetTimeDelta(pTimeStampHash)\n\t{\n\t\tlet tmpTimeStampHash = (typeof(pTimeStampHash) == 'string') ? pTimeStampHash : 'Default';\n\t\tif (this.timeStamps.hasOwnProperty(tmpTimeStampHash))\n\t\t{\n\t\t\tlet tmpEndTime = +new Date();\n\t\t\treturn tmpEndTime-this.timeStamps[tmpTimeStampHash];\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tlogTimeDelta(pTimeStampHash, pMessage)\n\t{\n\t\tlet tmpTimeStampHash = (typeof(pTimeStampHash) == 'string') ? pTimeStampHash : 'Default';\n\t\tlet tmpMessage = (typeof(pMessage) !== 'undefined') ? pMessage : `Elapsed for ${tmpTimeStampHash}: `;\n\t\tlet tmpOperationTime = this.getTimeDelta(pTimeStampHash);\n\t\tthis.info(tmpMessage +' ('+tmpOperationTime+'ms)');\n\t\treturn tmpOperationTime;\n\t}\n\n\tcreateProgressTracker(pTotalOperations, pProgressTrackerHash)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\t\tlet tmpTotalOperations = (typeof(pTotalOperations) == 'number') ? pTotalOperations : 100;\n\n\t\tlet tmpProgressTracker = (\n\t\t\t{\n\t\t\t\tHash: tmpProgressTrackerHash,\n\t\t\t\tStartTime: this.createTimeStamp(tmpProgressTrackerHash),\n\t\t\t\tEndTime: 0,\n\t\t\t\tCurrentTime: 0,\n\t\t\t\tPercentComplete: -1,\n\t\t\t\tAverageOperationTime: -1,\n\t\t\t\tEstimatedCompletionTime: -1,\n\t\t\t\tTotalCount: tmpTotalOperations,\n\t\t\t\tCurrentCount:-1\n\t\t\t});\n\n\t\tthis.progressTrackers[tmpProgressTrackerHash] = tmpProgressTracker;\n\n\t\treturn tmpProgressTracker;\n\t}\n\n\tsolveProgressTrackerStatus(pProgressTrackerHash)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\n\t\tif (!this.progressTrackers.hasOwnProperty(tmpProgressTrackerHash))\n\t\t{\n\t\t\tthis.createProgressTracker(100, tmpProgressTrackerHash);\n\t\t}\n\n\t\tlet tmpProgressTracker = this.progressTrackers[tmpProgressTrackerHash];\n\n\t\ttmpProgressTracker.CurrentTime = this.getTimeDelta(tmpProgressTracker.Hash);\n\n\t\tif ((tmpProgressTracker.CurrentCount > 0) && (tmpProgressTracker.TotalCount > 0))\n\t\t{\n\t\t\ttmpProgressTracker.PercentComplete = (tmpProgressTracker.CurrentCount / tmpProgressTracker.TotalCount) * 100.0;\n\t\t}\n\n\t\tif ((tmpProgressTracker.CurrentCount > 0) && (tmpProgressTracker.CurrentTime > 0))\n\t\t{\n\t\t\ttmpProgressTracker.AverageOperationTime = tmpProgressTracker.CurrentTime / tmpProgressTracker.CurrentCount;\n\t\t}\n\n\t\tif ((tmpProgressTracker.CurrentCount < tmpProgressTracker.TotalCount) && (tmpProgressTracker.AverageOperationTime > 0))\n\t\t{\n\t\t\ttmpProgressTracker.EstimatedCompletionTime = (tmpProgressTracker.TotalCount - tmpProgressTracker.CurrentCount) * tmpProgressTracker.AverageOperationTime;\n\t\t}\n\t}\n\n\tupdateProgressTrackerStatus(pProgressTrackerHash, pCurrentOperations)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\t\tlet tmpCurrentOperations = parseInt(pCurrentOperations);\n\n\t\tif (isNaN(tmpCurrentOperations))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tif (!this.progressTrackers.hasOwnProperty(tmpProgressTrackerHash))\n\t\t{\n\t\t\tthis.createProgressTracker(100, tmpProgressTrackerHash);\n\t\t}\n\n\t\tthis.progressTrackers[tmpProgressTrackerHash].CurrentCount = tmpCurrentOperations;\n\t\tthis.progressTrackers[tmpProgressTrackerHash].CurrentTime = this.getTimeDelta(tmpProgressTrackerHash);\n\n\t\tthis.solveProgressTrackerStatus(tmpProgressTrackerHash);\n\n\t\treturn this.progressTrackers[tmpProgressTrackerHash];\n\t}\n\n\tincrementProgressTrackerStatus(pProgressTrackerHash, pIncrementSize)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\t\tlet tmpIncrementSize = parseInt(pIncrementSize);\n\n\t\tif (isNaN(tmpIncrementSize))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tif (!this.progressTrackers.hasOwnProperty(tmpProgressTrackerHash))\n\t\t{\n\t\t\tthis.createProgressTracker(100, tmpProgressTrackerHash);\n\t\t}\n\n\t\tthis.progressTrackers[tmpProgressTrackerHash].CurrentCount = this.progressTrackers[tmpProgressTrackerHash].CurrentCount + tmpIncrementSize;\n\t\tthis.progressTrackers[tmpProgressTrackerHash].CurrentTime = this.getTimeDelta(tmpProgressTrackerHash);\n\n\t\tthis.solveProgressTrackerStatus(tmpProgressTrackerHash);\n\n\t\treturn this.progressTrackers[tmpProgressTrackerHash];\n\t}\n\n\tsetProgressTrackerEndTime(pProgressTrackerHash, pCurrentOperations)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\t\tlet tmpCurrentOperations = parseInt(pCurrentOperations);\n\n\t\tif (!this.progressTrackers.hasOwnProperty(tmpProgressTrackerHash))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tif (!isNaN(tmpCurrentOperations))\n\t\t{\n\t\t\tthis.updateProgressTrackerStatus(tmpProgressTrackerHash, tmpCurrentOperations);\n\t\t}\n\n\t\tthis.progressTrackers[tmpProgressTrackerHash].EndTime = this.getTimeDelta(tmpProgressTrackerHash);\n\n\t\tthis.solveProgressTrackerStatus(tmpProgressTrackerHash);\n\n\t\treturn this.progressTrackers[tmpProgressTrackerHash];\n\t}\n\n\tprintProgressTrackerStatus(pProgressTrackerHash)\n\t{\n\t\tlet tmpProgressTrackerHash = (typeof(pProgressTrackerHash) == 'string') ? pProgressTrackerHash : 'DefaultProgressTracker';\n\n\t\tif (!this.progressTrackers.hasOwnProperty(tmpProgressTrackerHash))\n\t\t{\n\t\t\tthis.info(`>> Progress Tracker ${tmpProgressTrackerHash} does not exist! No stats to display.`);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tconst tmpProgressTracker = this.progressTrackers[tmpProgressTrackerHash];\n\n\t\t\tif (tmpProgressTracker.CurrentCount < 1)\n\t\t\t{\n\t\t\t\tthis.info(`>> Progress Tracker ${tmpProgressTracker.Hash} has no completed operations. ${tmpProgressTracker.CurrentTime}ms have elapsed since it was started.`);\n\t\t\t}\n\t\t\telse if (tmpProgressTracker.EndTime < 1)\n\t\t\t{\n\t\t\t\tthis.info(`>> Progress Tracker ${tmpProgressTracker.Hash} is ${tmpProgressTracker.PercentComplete.toFixed(3)}% completed - ${tmpProgressTracker.CurrentCount} / ${tmpProgressTracker.TotalCount} operations over ${tmpProgressTracker.CurrentTime}ms (median ${tmpProgressTracker.AverageOperationTime.toFixed(3)} per). Estimated completion in ${tmpProgressTracker.EstimatedCompletionTime.toFixed(0)}ms or ${(tmpProgressTracker.EstimatedCompletionTime / 1000 / 60).toFixed(2)}minutes`)\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.info(`>> Progress Tracker ${tmpProgressTracker.Hash} is done and completed ${tmpProgressTracker.CurrentCount} / ${tmpProgressTracker.TotalCount} operations in ${tmpProgressTracker.EndTime}ms.`)\n\t\t\t}\n\t\t}\n\t}\n\t// logMemoryResourcesUsed()\n\t// {\n\t//\n\t// \tconst tmpResourcesUsed = process.memoryUsage().heapUsed / 1024 / 1024;\n\t// \tthis.info(`Memory usage at ${Math.round(tmpResourcesUsed * 100) / 100} MB`);\n\t// }\n\t/*\n\t * END OF --> Logging and Telemetry Helpers\n\t ************************************************************************/\n}\n\nmodule.exports = FableOperation;","const libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\n\nconst libSimpleGet = require('simple-get');\nconst libCookie = require('cookie');\n\nclass FableServiceRestClient extends libFableServiceBase\n{\n\tconstructor(pFable, pOptions, pServiceHash)\n\t{\n\t\tsuper(pFable, pOptions, pServiceHash);\n\n\t\tthis.TraceLog = false;\n\t\tif (this.options.TraceLog || this.fable.TraceLog)\n\t\t{\n\t\t\tthis.TraceLog = true;\n\t\t}\n\n\t\tthis.dataFormat = this.fable.services.DataFormat;\n\n\t\tthis.serviceType = 'RestClient';\n\n\t\tthis.cookie = false;\n\n\t\t// This is a function that can be overridden, to allow the management\n\t\t// of the request options before they are passed to the request library.\n\t\tthis.prepareRequestOptions = (pOptions) => { return pOptions; };\n\t}\n\n\tget simpleGet()\n\t{\n\t\treturn libSimpleGet;\n\t}\n\n\tprepareCookies(pRequestOptions)\n\t{\n\t\tif (this.cookie)\n\t\t{\n\t\t\tlet tmpCookieObject = this.cookie;\n\t\t\tif (!pRequestOptions.hasOwnProperty('headers'))\n\t\t\t{\n\t\t\t\tpRequestOptions.headers = {};\n\t\t\t}\n\t\t\tlet tmpCookieKeys = Object.keys(tmpCookieObject);\n\t\t\tif (tmpCookieKeys.length > 0)\n\t\t\t{\n\t\t\t\t// Only grab the first for now.\n\t\t\t\tpRequestOptions.headers.cookie = libCookie.serialize(tmpCookieKeys[0], tmpCookieObject[tmpCookieKeys[0]]);\t\t\t\t\n\t\t\t}\n\t\t}\n\t\treturn pRequestOptions;\n\t}\n\n\tpreRequest(pOptions)\n\t{\n\t\t// Validate the options object\n\t\tlet tmpOptions = this.prepareCookies(pOptions);\n\t\treturn this.prepareRequestOptions(tmpOptions);\n\t}\n\n\texecuteChunkedRequest(pOptions, fCallback)\n\t{\n\t\tlet tmpOptions = this.preRequest(pOptions);\n\n\t\ttmpOptions.RequestStartTime = this.fable.log.getTimeStamp();\n\n\t\tif (this.TraceLog)\n\t\t{\n\t\t\tthis.fable.log.debug(`Beginning ${tmpOptions.method} request to ${tmpOptions.url} at ${tmpOptions.RequestStartTime}`);\n\t\t}\n\n\t\treturn libSimpleGet(tmpOptions,\n\t\t\t(pError, pResponse)=>\n\t\t\t{\n\t\t\t\tif (pError)\n\t\t\t\t{\n\t\t\t\t\treturn fCallback(pError, pResponse);\n\t\t\t\t}\n\n\t\t\t\tif (this.TraceLog)\n\t\t\t\t{\n\t\t\t\t\tlet tmpConnectTime = this.fable.log.getTimeStamp();\n\t\t\t\t\tthis.fable.log.debug(`--> ${tmpOptions.method} connected in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpConnectTime)}ms code ${pResponse.statusCode}`);\n\t\t\t\t}\n\n\t\t\t\tlet tmpData = '';\n\n\t\t\t\tpResponse.on('data', (pChunk) =>\n\t\t\t\t\t{\n\t\t\t\t\t\t// For JSON, the chunk is the serialized object.\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpChunkTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`--> ${tmpOptions.method} data chunk size ${pChunk.length}b received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpChunkTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttmpData += pChunk;\n\t\t\t\t\t});\n\n\t\t\t\tpResponse.on('end', ()=>\n\t\t\t\t\t{\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpCompletionTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`==> ${tmpOptions.method} completed data size ${tmpData.length}b received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpCompletionTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fCallback(pError, pResponse, tmpData);\n\t\t\t\t\t});\n\t\t\t});\n\t}\n\n\texecuteChunkedRequestBinary(pOptions, fCallback)\n\t{\n\t\tlet tmpOptions = this.preRequest(pOptions);\n\n\t\ttmpOptions.RequestStartTime = this.fable.log.getTimeStamp();\n\n\t\tif (this.TraceLog)\n\t\t{\n\t\t\tthis.fable.log.debug(`Beginning ${tmpOptions.method} request to ${tmpOptions.url} at ${tmpOptions.RequestStartTime}`);\n\t\t}\n\n\t\ttmpOptions.json = false;\n\t\ttmpOptions.encoding = null;\n\n\t\treturn libSimpleGet(tmpOptions,\n\t\t\t(pError, pResponse)=>\n\t\t\t{\n\t\t\t\tif (pError)\n\t\t\t\t{\n\t\t\t\t\treturn fCallback(pError, pResponse);\n\t\t\t\t}\n\n\t\t\t\tif (this.TraceLog)\n\t\t\t\t{\n\t\t\t\t\tlet tmpConnectTime = this.fable.log.getTimeStamp();\n\t\t\t\t\tthis.fable.log.debug(`--> ${tmpOptions.method} connected in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpConnectTime)}ms code ${pResponse.statusCode}`);\n\t\t\t\t}\n\n\t\t\t\tlet tmpDataBuffer = false;\n\n\t\t\t\tpResponse.on('data', (pChunk) =>\n\t\t\t\t\t{\n\t\t\t\t\t\t// For JSON, the chunk is the serialized object.\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpChunkTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`--> ${tmpOptions.method} data chunk size ${pChunk.length}b received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpChunkTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// TODO: Potentially create a third option that streams this to a file? So it doesn't have to hold it all in memory.\n\t\t\t\t\t\tif (!tmpDataBuffer)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttmpDataBuffer = Buffer.from(pChunk);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttmpDataBuffer = Buffer.concat([tmpDataBuffer, pChunk]);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\n\t\t\t\tpResponse.on('end', ()=>\n\t\t\t\t\t{\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpCompletionTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`==> ${tmpOptions.method} completed data size ${tmpDataBuffer.length}b received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpCompletionTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fCallback(pError, pResponse, tmpDataBuffer);\n\t\t\t\t\t});\n\t\t\t});\n\t}\n\n\texecuteJSONRequest(pOptions, fCallback)\n\t{\n\t\tpOptions.json = true;\n\n\t\tlet tmpOptions = this.preRequest(pOptions);\n\n\t\tif (!tmpOptions.hasOwnProperty('headers'))\n\t\t{\n\t\t\ttmpOptions.headers = {};\n\t\t}\n\t\t/* Automated headers break some APIs\n\t\tif (!tmpOptions.headers.hasOwnProperty('Content-Type'))\n\t\t{\n\t\t\ttmpOptions.headers['Content-Type'] = 'application/json';\n\t\t}\n\t\t*/\n\n\t\ttmpOptions.RequestStartTime = this.fable.log.getTimeStamp();\n\n\t\tif (this.TraceLog)\n\t\t{\n\t\t\tthis.fable.log.debug(`Beginning ${tmpOptions.method} JSON request to ${tmpOptions.url} at ${tmpOptions.RequestStartTime}`);\n\t\t}\n\n\t\treturn libSimpleGet(tmpOptions,\n\t\t\t(pError, pResponse)=>\n\t\t\t{\n\t\t\t\tif (pError)\n\t\t\t\t{\n\t\t\t\t\treturn fCallback(pError, pResponse);\n\t\t\t\t}\n\n\t\t\t\tif (this.TraceLog)\n\t\t\t\t{\n\t\t\t\t\tlet tmpConnectTime = this.fable.log.getTimeStamp();\n\t\t\t\t\tthis.fable.log.debug(`--> JSON ${tmpOptions.method} connected in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpConnectTime)}ms code ${pResponse.statusCode}`);\n\t\t\t\t}\n\n\t\t\t\tlet tmpJSONData = '';\n\n\t\t\t\tpResponse.on('data', (pChunk) =>\n\t\t\t\t\t{\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpChunkTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`--> JSON ${tmpOptions.method} data chunk size ${pChunk.length}b received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpChunkTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttmpJSONData += pChunk;\n\t\t\t\t\t});\n\n\t\t\t\tpResponse.on('end', ()=>\n\t\t\t\t\t{\n\t\t\t\t\t\tif (this.TraceLog)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlet tmpCompletionTime = this.fable.log.getTimeStamp();\n\t\t\t\t\t\t\tthis.fable.log.debug(`==> JSON ${tmpOptions.method} completed - received in ${this.dataFormat.formatTimeDelta(tmpOptions.RequestStartTime, tmpCompletionTime)}ms`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fCallback(pError, pResponse, JSON.parse(tmpJSONData));\n\t\t\t\t\t});\n\t\t\t});\n\t}\n\n\tgetJSON(pOptionsOrURL, fCallback)\n\t{\n\t\tlet tmpRequestOptions = (typeof(pOptionsOrURL) == 'object') ? pOptionsOrURL : {};\n\t\tif (typeof(pOptionsOrURL) == 'string')\n\t\t{\n\t\t\ttmpRequestOptions.url = pOptionsOrURL;\n\t\t}\n\n\t\ttmpRequestOptions.method = 'GET';\n\n\t\treturn this.executeJSONRequest(tmpRequestOptions, fCallback);\n\t}\n\n\tputJSON(pOptions, fCallback)\n\t{\n\t\tif (typeof(pOptions.body) != 'object')\n\t\t{\n\t\t\treturn fCallback(new Error(`PUT JSON Error Invalid options object`));\n\t\t}\n\n\t\tpOptions.method = 'PUT';\n\n\t\treturn this.executeJSONRequest(pOptions, fCallback);\n\t}\n\n\tpostJSON(pOptions, fCallback)\n\t{\n\t\tif (typeof(pOptions.body) != 'object')\n\t\t{\n\t\t\treturn fCallback(new Error(`POST JSON Error Invalid options object`));\n\t\t}\n\n\t\tpOptions.method = 'POST';\n\n\t\treturn this.executeJSONRequest(pOptions, fCallback);\n\t}\n\n\tpatchJSON(pOptions, fCallback)\n\t{\n\t\tif (typeof(pOptions.body) != 'object')\n\t\t{\n\t\t\treturn fCallback(new Error(`PATCH JSON Error Invalid options object`));\n\t\t}\n\n\t\tpOptions.method = 'PATCH';\n\n\t\treturn this.executeJSONRequest(pOptions, fCallback);\n\t}\n\n\theadJSON(pOptions, fCallback)\n\t{\n\t\tif (typeof(pOptions.body) != 'object')\n\t\t{\n\t\t\treturn fCallback(new Error(`HEAD JSON Error Invalid options object`));\n\t\t}\n\n\t\tpOptions.method = 'HEAD';\n\n\t\treturn this.executeJSONRequest(pOptions, fCallback);\n\t}\n\n\tdelJSON(pOptions, fCallback)\n\t{\n\t\tpOptions.method = 'DELETE';\n\n\t\treturn this.executeJSONRequest(pOptions, fCallback);\n\t}\n\n\tgetRawText(pOptionsOrURL, fCallback)\n\t{\n\t\tlet tmpRequestOptions = (typeof(pOptionsOrURL) == 'object') ? pOptionsOrURL : {};\n\t\tif (typeof(pOptionsOrURL) == 'string')\n\t\t{\n\t\t\ttmpRequestOptions.url = pOptionsOrURL;\n\t\t}\n\n\t\ttmpRequestOptions.method = 'GET';\n\n\t\treturn this.executeChunkedRequest(tmpRequestOptions, fCallback);\n\t}\n}\n\nmodule.exports = FableServiceRestClient;","const libFableServiceBase = require('../Fable-ServiceManager.js').ServiceProviderBase;\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-ServiceManager.js').ServiceProviderBase;\n\n// TODO: These are still pretty big -- consider the smaller polyfills\nconst libAsyncWaterfall = require('async.waterfall');\nconst libAsyncEachLimit = require('async.eachlimit');\n\nconst libBigNumber = require('big.js');\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\n\t\tthis.bigNumber = libBigNumber;\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\t// Nevermind, the native thing is not stable enough across environments\n\t// Basic shallow copy\n\textend(pDestinationObject, ...pSourceObjects)\n\t{\n\t\tfor (let i = 0; i < pSourceObjects.length; i++)\n\t\t{\n\t\t\tlet tmpSourceObject = pSourceObjects[i];\n\t\t\tif (typeof(tmpSourceObject) === 'object')\n\t\t\t{\n\t\t\t\tlet tmpObjectProperties = Object.keys(tmpSourceObject);\n\t\t\t\tfor (let k = 0; k < tmpObjectProperties.length; k++)\n\t\t\t\t{\n\t\t\t\t\tpDestinationObject[tmpObjectProperties[k]] = tmpSourceObject[tmpObjectProperties[k]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn pDestinationObject;\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\t// Convert an ISO string to a javascript date object\n\t// Adapted from https://stackoverflow.com/a/54751179\n\t//\n\t// Takes strings like: 2022-11-04T11:34:45.000Z\n\t// and: 1986-06-11T09:34:46.012Z+0200\n\t// ... and converts them into javascript timestamps, following the directions of the timezone stuff.\n\t//\n\t// This is not meant to replace the more complex libraries such as moment or luxon.\n\t// This *is* meant to be a simple, small, and fast way to convert ISO strings to dates in engines\n\t// with ultra limited JS capabilities where those don't work.\n\tisoStringToDate (pISOString)\n\t{\n\n\t\t// Split the string into an array based on the digit groups.\n\t\tlet tmpDateParts = pISOString.split( /\\D+/ );\n\n\t\t// Set up a date object with the current time.\n\t\tlet tmpReturnDate = new Date();\n\n\t\t// Track the number of hours we need to adjust the date by based on the timezone.\n\t\tlet tmpTimeZoneOffsetInHours = 0;\n\t\t// Track the number of minutes we need to adjust the date by based on the timezone.\n\t\tlet tmpTimeZoneOffsetInMinutes = 0;\n\n\t\t// This fixes an inconsistency with constructing the date programmatically.\n\t\ttmpReturnDate.setUTCDate(1);\n\t\ttmpReturnDate.setUTCMonth(1);\n\t\ttmpReturnDate.setUTCHours(0);\n\t\ttmpReturnDate.setUTCMinutes(0);\n\t\ttmpReturnDate.setUTCSeconds(0);\n\t\ttmpReturnDate.setUTCMilliseconds(0);\n\n\t\t// Manually parse the parts of the string and set each part for the\n\t\t// date. Note: Using the UTC versions of these functions is necessary\n\t\t// because we're manually adjusting for time zones stored in the\n\t\t// string.\n\t\ttmpReturnDate.setUTCFullYear( parseInt( tmpDateParts[ 0 ] ) );\n\n\t\t// The month numbers are one \"off\" from what normal humans would expect\n\t\t// because January == 0.\n\t\ttmpReturnDate.setUTCMonth( parseInt( tmpDateParts[ 1 ] ) - 1 );\n\n\t\ttmpReturnDate.setUTCDate( parseInt( tmpDateParts[ 2 ] ) );\n\n\t\t// Set the time parts of the date object.\n\t\ttmpReturnDate.setUTCHours( parseInt( tmpDateParts[ 3 ] ) );\n\t\ttmpReturnDate.setUTCMinutes( parseInt( tmpDateParts[ 4 ] ) );\n\t\ttmpReturnDate.setUTCSeconds( parseInt( tmpDateParts[ 5 ] ) );\n\t\ttmpReturnDate.setUTCMilliseconds( parseInt( tmpDateParts[ 6 ] ) );\n\n\t\t// If there's a value for either the hours or minutes offset.\n\t\tif (tmpDateParts[ 7 ] || tmpDateParts[ 8 ])\n\t\t{\n\t\t\t// If there's a value for the minutes offset.\n\t\t\tif (tmpDateParts[8])\n\t\t\t{\n\t\t\t\t// Convert the minutes value into an hours value.\n\t\t\t\ttmpTimeZoneOffsetInMinutes = parseInt(tmpDateParts[8]) / 60;\n\t\t\t}\n\n\t\t\t// Add the hours and minutes values to get the total offset in hours.\n\t\t\ttmpTimeZoneOffsetInHours = parseInt(tmpDateParts[7]) + tmpTimeZoneOffsetInMinutes;\n\n\t\t\t// If the sign for the timezone is a plus to indicate the timezone is ahead of UTC time.\n\t\t\tif (pISOString.substr( -6, 1 ) == \"+\")\n\t\t\t{\n\t\t\t\t// Make the offset negative since the hours will need to be subtracted from the date.\n\t\t\t\ttmpTimeZoneOffsetInHours *= -1;\n\t\t\t}\n\t\t}\n\n\t\t// Get the current hours for the date and add the offset to get the correct time adjusted for timezone.\n\t\ttmpReturnDate.setHours( tmpReturnDate.getHours() + tmpTimeZoneOffsetInHours );\n\n\t\t// Return the Date object calculated from the string.\n\t\treturn tmpReturnDate;\n\t}\n}\n\nmodule.exports = FableServiceUtility;"]}